interval-2.1.0/DESCRIPTION0000644000000000000000000000170313031036767013201 0ustar 00000000000000Name: interval Version: 2.1.0 Date: 2016-12-28 Author: Oliver Heimlich Maintainer: Oliver Heimlich Title: Real-valued interval arithmetic Description: The interval package for real-valued interval arithmetic allows one to evaluate functions over subsets of their domain. All results are verified, because interval computations automatically keep track of any errors. These concepts can be used to handle uncertainties, estimate arithmetic errors and produce reliable results. Also it can be applied to computer-assisted proofs, constraint programming, and verified computing. The implementation is based on interval boundaries represented by binary64 numbers and is conforming to IEEE Std 1788-2015, IEEE standard for interval arithmetic. Depends: octave (>= 3.8.0) SystemRequirements: mpfr (>= 3.1.0) [Debian] libmpfr4 (>= 3.1.0) BuildRequires: mpfr (>= 3.1.0) [Debian] libmpfr-dev (>= 3.1.0) License: GPL-3.0+ interval-2.1.0/INDEX0000644000000000000000000000656613031036767012301 0ustar 00000000000000interval >> Real-valued interval arithmetic Interval constant empty entire nai Interval constructor hull midrad @infsup/infsup @infsup/newdec @infsupdec/infsupdec Interval function (most with tightest accuracy) @infsup/abs @infsup/acos @infsup/acosh @infsup/asin @infsup/asinh @infsup/atan @infsup/atan2 @infsup/atanh @infsup/cancelminus @infsup/cancelplus @infsup/cbrt @infsup/ceil @infsup/cos @infsup/cosh @infsup/cot @infsup/coth @infsup/csc @infsup/csch @infsup/dilog @infsup/ei @infsup/erf @infsup/erfc @infsup/exp @infsup/expm1 @infsup/factorial @infsup/fix @infsup/floor @infsup/fma @infsup/gamma @infsup/gammaln @infsup/hypot @infsup/ldivide @infsup/linspace @infsup/log @infsup/log10 @infsup/log1p @infsup/log2 @infsup/max @infsup/min @infsup/minus @infsup/nthroot @infsup/plus @infsup/pow @infsup/pow10 @infsup/pow2 @infsup/power @infsup/pown @infsup/psi @infsup/rdivide @infsup/realsqrt @infsup/round @infsup/roundb @infsup/rsqrt @infsup/sec @infsup/sech @infsup/sign @infsup/sin @infsup/sinh @infsup/tan @infsup/tanh @infsup/times @infsup/uminus @infsup/uplus Interval matrix operation @infsup/chol @infsup/det @infsup/dot @infsup/expm @infsup/inv @infsup/lu @infsup/mldivide @infsup/mpower @infsup/mrdivide @infsup/mtimes @infsup/norm @infsup/prod @infsup/qr @infsup/sum @infsup/sumabs @infsup/sumsq Interval comparison @infsup/disjoint @infsup/eq @infsup/ge @infsup/gt @infsup/interior @infsup/iscommoninterval @infsup/isempty @infsup/isentire @infsup/ismember @infsup/issingleton @infsup/le @infsup/lt @infsup/ne @infsup/overlap @infsup/precedes @infsup/strictprecedes @infsup/strictsubset @infsup/subset @infsupdec/isnai Set operation @infsup/bisect @infsup/intersect @infsup/mince @infsup/nextout @infsup/setdiff @infsup/setxor @infsup/union Interval reverse operation @infsup/absrev @infsup/atan2rev1 @infsup/atan2rev2 @infsup/coshrev @infsup/cosrev @infsup/mulrev @infsup/pownrev @infsup/powrev1 @infsup/powrev2 @infsup/sinrev @infsup/sqrrev @infsup/tanrev Interval numeric function @infsup/hdist @infsup/idist @infsup/inf @infsup/mag @infsup/mid @infsup/mig @infsup/rad @infsup/sdist @infsup/smig @infsup/sup @infsup/wid Interval input and output interval_bitpack exacttointerval @infsup/bitunpack @infsup/disp @infsup/display @infsup/intervaltoexact @infsup/intervaltotext @infsup/plot @infsup/plot3 Interval solver or optimizer @infsup/fminsearch @infsup/fsolve @infsup/fzero @infsup/gauss @infsup/polyval Interval contractor arithmetic ctc_intersect ctc_union Verified solver or optimizer vereigback vereigvec verintlinineqs verinvnonneg verlinineqnn verlinprog Utility function @infsup/cat @infsup/columns @infsup/ctranspose @infsup/diag @infsup/horzcat @infsup/iscolumn @infsup/ismatrix @infsup/isrow @infsup/isscalar @infsup/issquare @infsup/isvector @infsup/length @infsup/meshgrid @infsup/ndims @infsup/numel @infsup/postpad @infsup/prepad @infsup/reshape @infsup/resize @infsup/rows @infsup/size @infsup/subsasgn @infsup/subsref @infsup/transpose @infsup/tril @infsup/triu @infsup/vertcat @infsupdec/decorationpart @infsupdec/intervalpart API function to the MPFR and crlibm libraries crlibm_function mpfr_function_d mpfr_linspace_d mpfr_matrix_mul_d mpfr_matrix_sqr_d mpfr_to_string_d mpfr_vector_sum_d mpfr_vector_dot_d interval-2.1.0/doc/.octaverc0000644000000000000000000000025513031036767014050 0ustar 00000000000000set (0, 'defaultaxesfontname', 'Fantasque Sans Mono'); set (0, 'defaulttextfontname', 'Roboto Condensed'); set (0, 'defaultfigurevisible', 'off'); pkg ('load', 'interval'); interval-2.1.0/doc/CITATION.texinfo0000644000000000000000000000141113031036767015044 0ustar 00000000000000\input texinfo @setfilename CITATION @settitle CITATION file @documentencoding UTF-8 @c This is part of the GNU Octave Interval Package. @c Copyright 2015-2016 Oliver Heimlich. @c See the file COPYING for copying conditions. The interval package is a collection of functions for interval arithmetic. It is developed at Octave Forge, a sibling of the GNU Octave project. To cite this particular version of the interval package in publications use: @display @@software@{octave-interval, author = @{Oliver Heimlich@}, title = @{GNU Octave Interval Package@}, url = @{http://octave.sourceforge.net/interval/@}, version = @{@value{version}@}, date = @{@value{date}@}, @} @end display @noindent See also @command{citation} for citing Octave as a whole. @bye interval-2.1.0/doc/COPYING.texinfo0000644000000000000000000000211113031036767014740 0ustar 00000000000000\input texinfo @setfilename COPYING @settitle COPYING file @documentencoding UTF-8 @c This is part of the GNU Octave Interval Package. @c Copyright 2015-2016 Oliver Heimlich. The interval package is free software and can be used under the terms of the GNU General Public License Version 3 (or at your option any later version). The wording of the license can be found below. The interval package contains derivative work, which is based on other free software released under various licenses. Original authors are properly attributed in the manual and copyright statements have been retained in the particular source files. For simplicity, any derivative work has been relicensed in this package. Thus, the GPLv3+ is the only effective license for the software in this package. For legal reasons a copy of the Apache License 2.0 is included in this package. You can find the license in the file @code{doc/license/apache-2.0.texi}. However, that license does not apply to the software in this package. @sp 5 @center The GNU General Public License. @include license/gpl-3.0.texi @bye interval-2.1.0/doc/Makefile0000644000000000000000000000274013031036767013702 0ustar 00000000000000## This is part of the GNU Octave Interval Package. ## Copyright 2015-2016 Oliver Heimlich. ## See the file COPYING for copying conditions. SHELL = /bin/sh M_IMAGE = $(wildcard image/*.m) $(patsubst %.m.texinfo,%.m,$(wildcard image/*.m.texinfo)) IMAGE_OBJ = $(patsubst %,%.png,$(M_IMAGE)) OBJ = manual.html manual.pdf $(IMAGE_OBJ) MAKEINFO ?= makeinfo VERSION ?= $(shell grep "^Version: " ../packinfo/DESCRIPTION ../DESCRIPTION | head -1 | cut -f2 -d" ") OCTAVE ?= octave .PHONY: all clean images all: $(OBJ) images: $(IMAGE_OBJ) manual.html: manual.texinfo $(wildcard chapter/*) license/gpl-3.0.texi $(wildcard image/*.texinfo) $(IMAGE_OBJ) $(MAKEINFO) -D 'version $(VERSION)' --html --no-split --css-ref='https://www.gnu.org/software/octave/doc/interpreter/octave.css' --css-include manual.css "$<" manual.pdf: manual.texinfo $(wildcard chapter/*) license/gpl-3.0.texi $(wildcard image/*.texinfo) $(wildcard image/*.pdf) $(IMAGE_OBJ) $(MAKEINFO) --Xopt=--texinfo='@set version $(VERSION)' --pdf "$<" image/%.m.png: image/%.m $(OCTAVE) \ --no-gui --silent --no-history \ --eval "source ('$<');" \ --eval "__print_mesa__ (gcf, '$@');" @# The image size is too large for inclusion in the pdf, @# thus we increase the resolution from 150 to 250 dpi. convert -density 98.425 -units PixelsPerCentimeter "$@" "$@" image/%.m: image/%.m.texinfo $(MAKEINFO) -D m-file --plaintext "$<" > "$@" clean: $(RM) $(OBJ) $(RM) *.aux *.cp *.fn *.ky *.log *.pg *.toc *.tp *.vr interval-2.1.0/doc/NEWS.texinfo0000644000000000000000000004404013031036767014413 0ustar 00000000000000\input texinfo @setfilename NEWS @settitle NEWS file @documentencoding UTF-8 @c This is part of the GNU Octave Interval Package. @c Copyright 2015-2016 Oliver Heimlich. @c See the file COPYING for copying conditions. @macro release{version, date} @heading Version \version\ \date\ @end macro @center GNU Octave Interval Package @center Summary of important user-visible changes @release{2.1.0, 2016-12-28} @itemize @item The speed of some arithmetic operations has been greatly improved. They have previously been computed by multi-precision arithmetic which simulates binary64 floating-point arithmetic (MPFR library). Now, a specialized correctly rounded mathematical library (crlibm) computes identical results 30–100 times faster. There is no accuracy drawback, arithmetic operations will compute tight interval enclosures as before. The following functions benefit from this: acos, asin, atan, cos, cosh, exp, expm1, log, log10, log1p, log2, sin, sinh, tan. @end itemize Bugfixes @itemize @item Fixed indexing expression in interval constructor for illegal intervals of the form @code{[-inf, -inf]} or @code{[inf, inf]} @item polyval: Fixed unnecessary warnings when evaluated on empty intervals @item Fixed compilation errors on FreeBSD 9.3 @end itemize @release{2.0.0, 2016-11-20} This major release contains fundamental changes to the interval constructors. After a discussion on the P1788 mailing list, it has been revealed that this interval package didn't implement exceptions from the standard for interval arithmetic correctly: Operations from IEEE Std 1788-2015 which trigger an “exception” shall return a value nonetheless. Conformance has been improved in this new version, but may break compatibility with previous versions. A second big news is that the interval package comprises functions from VERSOFT, a verification software package by Jiří Rohn, who has generously published his work as free software this year. Unfortunately, some of VERSOFT's functions are encrypted and could not be included yet. @itemize @item nai: With additional arguments, matrices of NaI (not an interval) values can be constructed. Previously, NaI has been restricted to be of scalar value. @item infsup: The bare interval constructor merely triggers a warning instead of an error on illegal input, which creates empty intervals. If input contains legitimate as well as illegal input, only entries with illegal input will carry empty intervals. @item infsupdec: The decorated interval constructor may create interval matrices which have NaI (not an interval) as entries. If input contains legitimate as well as illegal input, only entries with illegal input will carry NaI values. @item Warning and error identifiers of the constructors have been revised. The warning identifier @code{interval:NaI} has been removed. Illegal input signals an @code{interval:UndefinedOperation} warning. If the input is of an illegal data type or of illegal size, the constructors signal an @code{interval:InvalidOperand} warning. The warning identifier @code{interval:PossiblyUndefinedOperation} has been renamed to @code{interval:PossiblyUndefined} to better match the wording in the standard document. Also, previous versions failed to trigger this warning in cases where there is a floating point number between boundaries @var{u} < @var{l}, which has been fixed. @item It is no longer valid to call @code{infsup (+inf, -inf)} to create an empty interval and the constructor will signal a warning in these cases. This change has been made to better conform to the @command{numsToInterval} function from the interval standard. You may create empty intervals with either @code{infsup ()} or @code{infsupdec ()} or @code{empty ()}. @item inf, sup: If the input is NaI (not an interval), these functions return NaN (not a number) values instead of an error. @item Output of intervals in hexadecimal form discriminates between subnormal boundaries and normal boundaries. Subnormal numbers start with “0x0.” whereas normal numbers start with “0x1.”. Also, hexadecimal form has been changed to lower case. @item resize: New interval elements are initialized with zero instead of empty intervals to better match the corresponding Octave function. @item Interval constructors may broadcast column and row vectors. @item Performance improvements: factorial on large arguments; plot and plot3 on input that is plotted as a line. @item New interval functions: tril, triu, qr @item New functions which have been ported from Jiří Rohn's VERSOFT: chol, vereigback, vereigvec, verintlinineqs, verinvnonneg, verlinineqnn, verlinprog @item recip, sqr: The functions have been removed, after they have been deprecated in version 1.4.0. @item plot3: Fixed plotting with gnuplot and fixed an issue where the figure did not switch from 2D to 3D after plotting. @item expm1: Fixed documentation, the function computes exp (X) - 1 instead of exp (X - 1). @item norm: Fixed an error where the Hamming norm of empty intervals was non-empty. @end itemize @release{1.5.0, 2016-05-31} @itemize @item norm: Added subordinate matrix norms and the max norm @item strictsubset: New interval comparison function @item Package documentation: Added new example (Cameleon problem), and the growing list of examples has been split into several web pages. @item Package documentation: Updated recommendations to install and load the package. The autoload feature will be removed in Octave 4.2.0. (patch #8981, thanks to juanpi) @item Support package installation in Octave 4.1.0+ (bug #47288) @end itemize @release{1.4.1, 2016-02-13} @itemize @item Fixed a compile error for 32-bit systems during package installation (bug #47100) @end itemize @release{1.4.0, 2016-02-09} @itemize @item mpower: Improved accuracy and speed. The interval matrix square can now be computed without dependency errors and with tightest accuracy. @item factorial: New interval arithmetic operation @item expm, norm: New interval matrix operations @item The functions recip and sqr have been deprecated and will be removed in a future release. Please use @code{1 ./ @var{x}} and @code{@var{x} .^ 2} instead. @end itemize @noindent Bugfixes @itemize @item bitunpack, interval_bitpack: The order of inf/sup/dec parts has been fixed. The function documentation describes how the functions behave on little-endian and big-endian systems. @end itemize @release{1.3.0, 2015-12-22} @itemize @item postpad, prepad, subsasgn: Implicit new elements during subscript assignment and padding have been initialized with empty intervals before this release. This behavior has changed. Now, the implicit new element are initialized with zero to make a correct interval extension of the corresponding built-in function. @item fsolve: New function to solve (systems of) equations and compute the inverse of a set under a function @item ctc_intersect, ctc_union: Utility functions for contractors and the fsolve function @item det, prod, recip: New interval arithmetic functions @item diag: New utility function to create diagonal matrices or extract vectors from diagonals of matrices @item decorationpart: Choose between different return types with a second parameter @item For several functions it is now possible to broadcast row vectors against column vectors or vectors against matrices. @item The user manual has been restructured for better accessibility by new users. A bunch of usage examples demonstrates the package's capabilities. @end itemize @noindent Bugfixes @itemize @item sum, sumabs, sumsq: Fixed result for matrices of size zero @item powrev1, powrev2: Fixed indexing for vectors @end itemize @release{1.2.0, 2015-10-01} @itemize @item The output format for intervals has been changed. The number of decimal places now respects what has been set by the user with the @command{format short} or @command{format long} command, and is much shorter by default. Also it is possible to use @command{format hex}. The old format can be accessed with the @command{intervaltotext} function. @item fminsearch: New optimizer function for finding the minimum value of a function over interval constraints using the Skelboe-Moore algorithm @item fzero: Changed function parameters to support optimset options @item power: Improved speed of the general interval power function and monomials with the notation x .^ n @item plot, plot3: Added support for colormaps @end itemize @noindent Bugfixes @itemize @item mldivide: Fixed algorithm to handle more matrices without error @item bisect: Fixed an error during bisection of singleton intervals (thanks to Helmut for finding this during OctConf 2015) @end itemize @release{1.1.0, 2015-08-03} @itemize @item meshgrid, mince: New utility functions to help plotting of interval functions @item linspace: New interval arithmetic function @item intersect, max, min, union: Allow evaluation as aggregate functions within an interval matrix along a common dimension @item Improvements to the documentation @itemize @item Added cross-references between package documentation and function reference @item Extended information about interval arithmetic in general @item Extended information about implemented IEEE Std 1788-2015 functions and fixed references to the standard document @item Added information about plotting intervals @item Simplified package description @item Graphics with higher resolutions, demo of interval sombrero function plot on first page, and minor style fixes @end itemize @end itemize @noindent Bugfixes @itemize @item plot3: Fixed plotting of interval edges when plotting several intervals at once using matrices @end itemize @release{1.0.0, 2015-06-13} @itemize @item IEEE Std 1788-2015, IEEE standard for interval arithmetic, was approved on June 11. To mark the occasion, the major version number has been raised. @item All interval constructors have been extended to create interval matrices from a single string. Commas or spaces may be used as a column separator (consecutive separators are trimmed). Semicolon and new line characters can be used as a row separator. @item hdist, idist, sdist, smig: New interval numeric functions @item User manual: Relicensed under GPL, added examples from the former Octave SIMP package, and various minor improvements. @end itemize @noindent Bugfixes @itemize @item mtimes: Fixed matrix-vector multiplication of decorated intervals @item Fixed a linking error in mkoctfile that could prevent package installation (bug #45280) @end itemize @release{0.2.1, 2015-05-30} @itemize @item plot, plot3: New interval plotting functions. Pay attention to the included examples, which can be executed with @code{demo @@infsup/plot} and @code{demo @@infsup/plot3} respectively. @item polyval: New interval arithmetic algorithm @item bisect: New set operation for bisecting algorithms @item sinrev, cosrev, tanrev, atan2rev1, atan2rev2: Now allow non-scalar arguments @item Simplified licensing: Relicensed parts of the software that were not under GPL @item Updated information for citation of the package @end itemize @noindent Bugfixes @itemize @item Fixed generation of the manual in PDF format @item subsasgn: Fixed cases where decoration could be lost (bug #42735) @end itemize @release{0.2.0, 2015-05-03} @itemize @item User manual included in the package, see doc/manual.texinfo @item New utility functions: cat, postpad, prepad, reshape, resize @item and, or: Removed deprecated functions @item Improved display output for cell arrays and new function: disp @item Minor performance improvements (all decorated interval functions, horzcat, vertcat) @end itemize @noindent Bugfixes @itemize @item issquare, isrow, iscolumn: Fixed compatibility issues with GNU Octave 4.0 @item cbrt: Allow negative values as parameter @item cot: Fixed accuracy for x = 0 @item cos, csc, sec, sin: Fixed correctness in certain cases @item Prevent multibyte characters in Microsoft Windows console @end itemize @release{0.1.5, 2015-04-06} @itemize @item Implicit decoration of bare intervals triggers a warning now and can be allowed or forbidden by the user. Implicit decoration of bare interval literals is not affected. @item newdec: New operation for explicit promotion of bare intervals into decorated intervals (without warning). @item Decorated interval literals with illegal decoration are no longer allowed and produce NaIs. @item hull: In contrast to the union function, the interval constructor is no longer considered a set operation and can create intervals with a non-trivial decoration. @item setdiff, setxor: New set operations @item intersect, union: Renamed set operations; the old function names (and, or) are hereby deprecated and are going to be removed in the next release. @item intervaltotext, intervaltoexact: Decimal fractions no longer omit zero before the point, and unnecessary trailing decimal places can be omitted more consistently and in more cases than before (also affects console output). Improved accuracy and performance with support for interval matrices. @end itemize @noindent Bugfixes @itemize @item mtimes, mldivide: Support for broadcasting of scalar parameters @item nextout: Support for decorated intervals @item An error in GNU Octave core, which could lead to lost or wrong interval decorations, no longer affects decorated intervals (bug #42735) @item Some errors in the function documentation have been fixed (thanks to doctest-for-matlab and Colin's texinfo compatibility patches) @item Fixed interval field access on Windows @end itemize @release{0.1.4, 2015-03-15} @itemize @item New interval constructors: hull, midrad @item New interval arithmetic functions: cbrt, cot, coth, csc, csch, dilog, ei, erf, erfc, gamma, gammaln, psi, rsqrt, sec, sech @item mtimes: Support for fast, less accurate evaluation using BLAS routines @item mldivide, mrdivide, inv: Improved performance by using faster mtimes @item infsup, infsupdec: Enabled broadcasting of scalar boundaries @item rad: May compute mid and rad simultaneously @item subsref: Access to interval properties using field syntax: x.inf and x.sup @end itemize @release{0.1.3, 2015-02-24} @itemize @item Fixed a compile error that could possibly occur during package installation @end itemize @release{0.1.2, 2015-02-22} @itemize @item New interval arithmetic functions: nthroot, hypot, log1p, expm1 @item lu: New operation for LU(P) decomposition of interval matrices @item nai: New decorated interval constant @item mldivide, mrdivide, inv: Greatly improved accuracy and performance of the linear solver @item Improved accuracy of vector sums, dot products, pownrev, and powrev2 @item powrev1, powrev2, pownrev, mulrev: Now allow non-scalar arguments @item overlap: Renamed one overlapping state from equal to equals @item mulrevtopair: No longer available, use mulrev with two output parameters for two-output division @item setdec: No longer available, use infsupdec instead @item Small performance improvements @end itemize @noindent Bugfixes @itemize @item Compatibility with GNU Octave 4.0 (bug #43925) @item Build problems during package installation with environment variables @item iscommoninterval: The decorated variant must return true for common intervals without com decoration @item eq: The decorated variant must not consider the decoration value @item Several decorated functions: When evaluated on a subset of the function's domain, the result's decoration must be dac if the function's restriction to that subset is continuous @item Decorated boolean functions: Must return false when evaluated on NaI input @item Interval constructors: A PossibleUndefined warning must be issued if an interval is created from two very close decimal numbers (which can not be separated in the floating-point context) where the lower boundary is greater than the upper boundary when compared with infinite precision @item Interval constructors: NaNs must produce empty intervals @item Decorated interval constructor: Illegal decorations for empty intervals must be adjusted to trv, and illegal decoration com for unbounded intervals must be adjusted to dac. @item cancelminus/cancelplus: The functions returned wrong results if the interval widths could not be compared in double-precision @item cos: Accuracy for x = [0] improved @item pow, powrev1, powrev2: The function must be defined for x = 0 and y > 0 @item All reverse operations: Must return a trivial decoration information at best (the only exception is mulrev) @end itemize @release{0.1.1, 2015-02-01} @itemize @item Increased speed of computation for large matrices @item Improved performance for fma and dot @item mpfr_vector_dot_d: Changed syntax for faster computation on intervals @item Decorated versions of mtimes, mldivide, mpower, inv and reduction operations sum, dot, subabs, subsquare @item Renamed function sumsquare to sumsq in accordance with GNU Octave function names @item New function: fzero for finding all roots of an interval arithmetic function @end itemize @noindent Bugfixes @itemize @item nextout: Function returned wrong results @item exacttointerval: Now produces bare intervals instead of decorated intervals in conformance with IEEE P1788 @item atanh: Function returned wrong results for ±1 @item dot: Function returned wrong results for some inputs @item fma: Function returned wrong results for some inputs @item infsup: Function returned wrong interval boundaries for decimal numbers, function failed on mixed numerical and string boundaries in single cell array parameter @item mulrevtopair: Fixed order of operands in conformance with IEEE P1788 and wrong results when evaluated on intervals that contain zero @end itemize @release{0.1.0, 2015-01-21} @itemize @item Initial release version, which already contains all required operations of the preliminary standard document IEEE P1788. @end itemize @bye interval-2.1.0/doc/chapter/advanced-topics.texinfo0000644000000000000000000002647213031036767020342 0ustar 00000000000000@c This is part of the GNU Octave Interval Package Manual. @c Copyright 2015-2016 Oliver Heimlich. @c See the file manual.texinfo for copying conditions. @documentencoding UTF-8 @chapter Advanced Topics @section Error Handling Due to the nature of set-based interval arithmetic, one should not observe errors (in the sense of raised GNU Octave error messages) during computation unless operations are evaluated for incompatible data types. Arithmetic operations which are not defined for (parts of) their input, simply ignore anything that is outside of their domain. However, the interval constructors can produce warnings depending on the input. The @funref{@@infsup/infsup} constructor will warn if the interval boundaries are invalid and returns empty intervals in these cases. Contrariwise, the (preferred) @funref{@@infsupdec/infsupdec}, @funref{midrad} and @funref{hull} constructors will only issue a warning and return [NaI] objects, which will propagate and survive through computations. NaI stands for “not an interval”. Effects of set-based interval arithmetic on partial functions and the NaI object @example @group ## Evaluation of a function outside of its domain ## returns an empty interval infsupdec (2) / 0 @result{} ans = [Empty]_trv infsupdec (0) ^ infsupdec (0) @result{} ans = [Empty]_trv @end group @end example @example @group ## Illegal interval construction creates a NaI infsupdec (3, 2) @print{} warning: illegal interval boundaries: @print{} infimum greater than supremum @result{} ans = [NaI] @end group @end example @example @group ## NaI even survives through computations ans + 1 @result{} ans = [NaI] @end group @end example There are some situations where the interval package cannot decide whether an error occurred or not and issues a warning. The user may choose to ignore these warnings or handle them as errors, see @command{help warning} for instructions. @float Table,tab:warnings @caption{Warning IDs} @table @option @item interval:PossiblyUndefined @table @asis @item Reason Interval construction with boundaries in decimal format, and the constructor can't decide whether the lower boundary is smaller than the upper boundary. Both boundaries are very close and lie between subsequent binary64 numbers. @item Possible consequences The constructed interval is a valid and tight enclosure of both numbers. If the lower boundary was actually greater than the upper boundary, this illegal interval is not considered an error. @end table @item interval:ImplicitPromote @table @asis @item Reason An interval operation has been evaluated on both, a bare and a decorated interval. The bare interval has been converted into a decorated interval in order to produce a decorated result. Note: This warning does not occur if a bare interval literal string gets promoted into a decorated interval, e. g., @code{infsupdec (1, 2) + "[3, 4]"} does not produce this warning whereas @code{infsupdec (1, 2) + infsup (3, 4)} does. A bare interval can be explicitly promoted with the @funref{@@infsup/newdec} function. @item Possible consequences The implicit conversion applies the best possible decoration for the bare interval. If the bare interval has been produced from an interval arithmetic computation, this branch of computation is not covered by the decoration information and the final decoration could be considered wrong. For example, @code{infsupdec (1, 2) + infsup (0, 1) ^ 0} would ignore that 0^0 is undefined. @end table @item interval:UndefinedOperation @table @asis @item Reason An error has occurred during interval construction and the NaI object has been produced (an empty interval in case of the bare interval constructor). The warning text contains further details. A NaI can be explicitly created with the @funref{nai} function. @item Possible consequences Nothing bad is going to happen, because the semantics of NaI and empty intervals are well defined by IEEE Std 1788-2015. However, the user might choose to cancel the algorithm immediately when the NaI is encountered for the first time. @end table @end table @end float @section Decorations The interval package provides a powerful decoration system for intervals, as specified by IEEE Std 1788-2015, IEEE standard for interval arithmetic. By default any interval carries a decoration, which collects additional information about the course of function evaluation on the interval data. Only the (unfavored) @funref{@@infsup/infsup} constructor creates bare, undecorated intervals and the @funref{@@infsupdec/intervalpart} operation may be used to demote decorated intervals into bare, undecorated ones. It is highly recommended to always use the decorated interval arithmetic, which gives additional information about an interval result in exchange for a tiny overhead. The following decorations are available: @float @multitable {Decoration ABC} {Bounded} {Continuous} {Defined} {Definition Definition Definition} @headitem Decoration @tab Bounded @tab Continuous @tab Defined @tab Definition @item com (common) @tab ✓ @tab ✓ @tab ✓ @tab x is a bounded, nonempty subset of Dom(f); f is continuous at each point of x; and the computed interval f(x) is bounded @item dac (defined and continuous) @tab @tab ✓ @tab ✓ @tab x is a nonempty subset of Dom(f); and the restriction of f to x is continuous @item def (defined) @tab @tab @tab ✓ @tab x is a nonempty subset of Dom(f) @item trv (trivial) @tab @tab @tab @tab always true@*(so gives no information) @item ill (ill-formed) @tab @tab @tab @tab Not an interval, at least one interval constructor failed during the course of computation @end multitable @end float The decoration information is especially useful after a very long and complicated function evaluation. For example, when the “def” decoration survives until the final result, it is proven that the overall function is actually defined for all values covered by the input intervals. Examples of using the decoration system @example @group x = infsupdec (3, 4) @result{} x = [3, 4]_com y = x - 3.5 @result{} y = [-0.5, +0.5]_com @end group @end example @example @group ## The square root function ignores any negative part of the input, ## but the decoration indicates whether this has or has not happened. sqrt (x) @result{} ans ⊂ [1.732, 2]_com sqrt (y) @result{} ans ⊂ [0, 0.70711]_trv @end group @end example Please note that decoration information will not survive through reverse operations (see below) and set operations. @section Specialized interval constructors Above mentioned interval construction with decimal numbers or numeric data is straightforward. Beyond that, there are more ways to define intervals or interval boundaries. @itemize @item Hexadecimal-floating-constant form: Each interval boundary may be defined by a hexadecimal number (optionally containing a point) and an exponent field with an integral power of two as defined by the C99 standard @uref{http://www.open-std.org/jtc1/sc22/WG14/www/docs/n1256.pdf,@asis{ISO/IEC9899, N1256, §6.4.4.2}}. This can be used as a convenient way to define interval boundaries in binary64 precision, because the hexadecimal form is much shorter than the decimal representation of many numbers. @item Rational literals: Each interval boundary may be defined as a fraction of two decimal numbers. This is especially useful if interval boundaries shall be tightest enclosures of fractions, that would be hard to write down as a decimal number. @item Uncertain form: The interval as a whole can be defined by a midpoint or upper/lower boundary and an integral number of @uref{http://en.wikipedia.org/wiki/Unit_in_the_last_place,“units in last place” (ULPs)} as an uncertainty. The format is @code{m?ruE}, where @table @code @item m is a mantissa in decimal, @item r is either empty (which means ½ ULP) or is a non-negative decimal integral ULP count or is the @option{?} character (for unbounded intervals), @item u is either empty (symmetrical uncertainty of r ULPs in both directions) or is either @option{u} (up) or @option{d} (down), @item E is either empty or an exponent field comprising the character @code{e} followed by a decimal integer exponent (base 10). @end table @end itemize Examples of different formats during interval construction @example @group infsupdec ("0x1.999999999999Ap-4") # hex-form @result{} ans ⊂ [0.1, 0.10001]_com @end group @end example @example @group infsupdec ("1/3", "7/9") # rational form @result{} ans ⊂ [0.33333, 0.77778]_com @end group @end example @example @group infsupdec ("121.2?") # uncertain form @result{} ans ⊂ [121.14, 121.25]_com @end group @end example @example @group infsupdec ("5?32e2") # uncertain form with ulp count @result{} ans = [-2700, +3700]_com @end group @end example @example @group infsupdec ("-42??u") # unbound uncertain form @result{} ans = [-42, +Inf]_dac @end group @end example The hex-form can be set for output with the @command{format hex} command. @section Reverse Arithmetic Operations Some arithmetic functions also provide reverse mode operations. That is inverse functions with interval constraints. For example the @funref{@@infsup/sqrrev} function can compute the inverse of the @code{@var{x} .^ 2} function on intervals. The syntax is @code{sqrrev (@var{C}, @var{X})} and will compute the enclosure of all numbers x ∈ @var{X} that fulfill the constraint x² ∈ @var{C}. In the following example, we compute the constraints for base and exponent of the power function pow as shown in the figure. @float Figure,reverse @caption{Reverse power operations. A relevant subset of the function's domain is outlined and hatched. In this example we use x^y ∈ [2, 3].} @shortcaption{Reverse power operations} @myimage{image/inverse-power.svg,Reverse Power Functions} @end float @example @group x = powrev1 (infsupdec ("[1.1, 1.45]"), infsupdec (2, 3)) @result{} x ⊂ [1.6128, 2.7149]_trv y = powrev2 (infsupdec ("[2.14, 2.5]"), infsupdec (2, 3)) @result{} y ⊂ [0.75647, 1.4441]_trv @end group @end example @section Tips and Tricks For convenience it is possible to implicitly call the interval constructor during all interval operations if at least one input already is an interval object. @example @group infsupdec ("17.7") + 1 @result{} ans ⊂ [18.699, 18.701]_com ans + "[0, 2]" @result{} ans ⊂ [18.699, 20.701]_com @end group @end example Interval functions with only one argument can be called by using property syntax, e. g. @code{x.inf}, @code{x.sup} or even @code{x.sqrt}. Whilst most functions (@funref{@@infsup/size}, @funref{@@infsup/isvector}, @funref{@@infsup/ismatrix}, …) work as expected on interval data types, the function @funref{@@infsup/isempty} is evaluated element-wise and checks if an interval equals the empty set. @example @group builtin ("isempty", empty ()) @result{} ans = 0 isempty (empty ()) @result{} ans = 1 @end group @end example @section Validation The interval package contains an extensive test suite, which can be run with the command @command{__run_test_suite__ (@{pkg("list", "interval")@{@}.dir@}, @{@})} to verify correct functionality for a particular system. In addition, examples from the package documentation can be verified using the doctest package: @example @c doctest: +SKIP @group pkg load doctest doctest (pkg ("list", "interval")@{@}.dir) @end group @end example interval-2.1.0/doc/chapter/examples.texinfo0000644000000000000000000003643713031036767017116 0ustar 00000000000000@c This is part of the GNU Octave Interval Package Manual. @c Copyright 2015-2016 Oliver Heimlich. @c See the file manual.texinfo for copying conditions. @documentencoding UTF-8 @chapter Examples This chapter presents some more or less exotic use cases for the interval package. @section Arithmetic with System-independent Accuracy According to IEEE Std 754 only the most basic floating-point operations must be provided with high accuracy. This is also true for the arithmetic functions in Octave. It is no surprise that many arithmetic functions fail to provide perfect results and their output may be system dependent. We compute the cosecant for 100 different values. @example @group x = vec (1 ./ magic (10)); sum (subset (csc (x), csc (infsupdec (x)))) @result{} ans = 98 @end group @end example Due to the general containment rule of interval arithmetic @code{x ∈ X ⇒ f (x) ∈ f (X)} one would expect the @code{csc (x)} to always be contained in the interval version of the cosecant for the same input. However, the classic cosecant is not very accurate whereas the interval version is. In 2 out 100 cases the built-in cosecant is less accurate than 1 ULP. @section Prove the Existence of a Fixed Point A weaker formulation of Brower's fixed-point theorem goes: If @var{x} is a bounded interval and function @var{f} is continuous and @var{f} (@var{x}) ⊂ @var{x}, then there exists a point @var{x}₀ ∈ @var{x} such that @var{f} (@var{x}₀) = @var{x}₀. These properties can be tested automatically. Decorated intervals can even prove that the function is continuous. @example @group x = infsupdec ("[-1, +1]"); f = @@cos; subset (f (x), x) @result{} ans = 1 iscommoninterval (x) @result{} ans = 1 continuous = strcmp (decorationpart (f (x)), "com") @result{} continuous = 1 @end group @end example Furthermore it is sometimes possible to approximate the fixed-point by repetitive evaluation of the function, although there are better methods to do so in general. @example @group for i = 1 : 20 x = f (x); endfor display (x) @result{} x ⊂ [0.73893, 0.73919]_com @end group @end example @menu Further Examples * Floating-point Numbers:: Analyze properties of binary64 numbers with intervals * Root Finding:: Find guaranteed enclosures for roots of a function * Parameter Estimation:: Examples of set inversion via interval analysis * Path Planning:: Find a feasible path between two points @end menu @node Floating-point Numbers @section Floating-point Numbers Floating-point numbers are most commonly used in binary64 format, a.k.a. double precision. Internally they are stored in the form @code{± @var{m} * 2 ^ @var{e}} with some integral mantissa @var{m} and exponent @var{e}. Most decimal fractions can only be stored approximately in this format. The @funref{@@infsup/intervaltotext} function can be used to output the approximate value up to the last decimal digit. @example @group intervaltotext (infsup (0.1), "exact decimal") @result{} ans = [0.1000000000000000055511151231257827021181583404541015625] @end group @end example It can be seen that 0.1 is converted into the most accurate floating-point number. In this case that value is greater than 0.1. The next lower value can be seen after producing an interval enclosure around 0.1 with the nearest floating-point numbers in each direction. @example @group intervaltotext (infsup ("0.1"), "exact decimal") @result{} ans = [0.09999999999999999167332731531132594682276248931884765625, 0.1000000000000000055511151231257827021181583404541015625] @end group @end example The error of this approximation can be examined with the @funref{@@infsup/wid} function. @example @group wid (infsup ("0.1")) @result{} ans = 1.3878e-17 @end group @end example With the @funref{@@infsup/nextout} function an interval can be enlarged in each direction up to the next floating-point number. Around zero the distance towards the next floating point number is very small, but gets bigger for numbers of higher magnitude. @example @group wid (nextout (infsup ([0, 1, 1e10, 1e100]))) @result{} ans = 9.8813e-324 3.3307e-16 3.8147e-06 3.8853e+84 @end group @end example @node Root Finding @section Root Finding @subsection Interval Newton Method In numerical analysis, @uref{https://en.wikipedia.org/wiki/Newton%27s_method,Newton's method} can find an approximation to a root of a function. Starting at a location @var{x}₀ the algorithms executes the following step to produce a better approximation: @display @var{x}₁ = @var{x}₀ @minus{} @var{f} (@var{x}₀) / @var{f}' (@var{x}₀) @end display The step can be interpreted geometrically as an intersection of the graph's tangent with the x-axis. Eventually, this may converge to a single root. In interval analysis, we start with an interval @var{x}₀ and utilize the following interval Newton step: @display @var{x}₁ = (mid (@var{x}₀) @minus{} @var{f} (mid (@var{x}₀)) / @var{f}' (@var{x}₀)) ∩ @var{x}₀ @end display Here we use the pivot element @code{mid (@var{x}₀)} and produce an enclosure of all possible tangents with the x-axis. In special cases the division with @code{@var{f}' (@var{x}₀)} yields two intervals and the algorithm bisects the search range. Eventually this algorithm produces enclosures for all possible roots of the function @var{f}. The interval newton method is implemented by the function @funref{@@infsup/fzero}. To produce the derivative of function @var{f}, the automatic differentiation from the symbolic package bears a helping hand. However, be careful since this may introduce numeric errors with coefficients. @example @group f = @@(x) sqrt (x) + (x + 1) .* cos (x); @end group @group pkg load symbolic df = function_handle (diff (formula (f (sym ("x"))))) @result{} df = @@(x) -(x + 1) .* sin (x) + cos (x) + 1 ./ (2 .* sqrt (x)) @end group @group fzero (f, infsup ("[0, 6]"), df) @result{} ans ⊂ 2×1 interval vector [2.059, 2.0591] [4.3107, 4.3108] @end group @end example We could find two roots in the interval [0, 6]. @subsection Bisection Consider the function @code{f (@var{x}, @var{y}) = -(5*@var{y} - 20*@var{y}^3 + 16*@var{y}^5)^6 + (-(5*@var{x} - 20*@var{x}^3 + 16*@var{x}^5)^3 + 5*@var{y} - 20*@var{y}^3 + 16*@var{y}^5)^2}, which has several roots in the area @var{x}, @var{y} ∈ [-1, 1]. @myimage{image/poly-example-surf.m,Surface plot of @code{f (@var{x}, @var{y})} which shows a lot of roots for the function} The function is particular difficult to compute with intervals, because its variables appear several times in the expression, which benefits overestimation from the dependency problem. Computing root enclosures with the @funref{@@infsup/fsolve} function is unfeasible, because many bisections would be necessary until the algorithm terminates with a useful result. It is possible to reduce the overestimation with the @funref{@@infsup/polyval} function to some degree, but since this function is quite costly to compute, it does not speed up the bisecting algorithm. @include image/poly-example-roots-simple.m.texinfo @myimage{image/poly-example-roots-simple.m,Enclosures of roots for the function @code{f (@var{x}, @var{y})}} Now we use the same algorithm with the same number of iterations, but also utilize the @emph{mean value theorem} to produce better enclosures of the function value with first order approximation of the function. The function is evaluated at the interval's midpoint and a range evaluation of the derivative can be used to produce an enclosure of possible function values. @include image/poly-example-roots-with-deriv.m.texinfo By using the derivative, it is possible to reduce overestimation errors and achieve a much better convergence behavior. @myimage{image/poly-example-roots-with-deriv.m,Enclosures of roots for the function @code{f (@var{x}, @var{y})}} @node Parameter Estimation @section Parameter Estimation @subsection Small Search Space Consider the model @code{y (@var{t}) = @var{p1} * exp (@var{p2} * t)}. The parameters @var{p1} and @var{p2} are unknown, but it is known that the model fulfills the following constraints, which have been obtained using measurements with known error bounds. @display @verbatim p1, p2 ∈ [-3, 3] y (0.2) ∈ [1.5, 2] y (1) ∈ [0.7, 0.8] y (2) ∈ [0.1, 0.3] y (4) ∈ [-0.1, 0.03] @end verbatim @end display A better enclosure of the parameters @var{p1} and @var{p2} can be estimated with the @funref{@@infsup/fsolve} function. @example @group ## Model y = @@(p1, p2, t) p1 .* exp (p2 .* t); ## Observations / Constraints t = [0.2; 1; 2; 4]; y_t = infsup ("[1.5, 2]; [0.7, 0.8]; [0.1, 0.3]; [-0.1, 0.03]"); ## Estimate parameters f = @@(p1, p2) y (p1, p2, t); p = fsolve (f, infsup ("[-3, 3]; [-3, 3]"), y_t) @result{} p ⊂ 2×1 interval vector [1.9863, 2.6075] [-1.3243, -1.0429] @end group @end example The resulting @code{p} guarantees to contain all parameters @code{[@var{p1}; @var{p2}]} which satisfy all constraints on @var{y}. It is no surprise that @code{f (p)} intersects the constraints for @var{y}. @example @group f (p(1), p(2)) @result{} ans ⊂ 4×1 interval vector [1.5241, 2.1166] [0.52838, 0.91888] [0.14055, 0.32382] [0.0099459, 0.040216] @end group @end example @subsection Larger Search Space Consider the function @code{f (x) = @var{p1} ^ x * (@var{p2} + @var{p3} * x + @var{p4} * x^2)}. Let's say we have some known function values (measurements) and want to find matching parameters @var{p1} through @var{p4}. The data sets (@var{x}, @var{y}) can be simulated. The parameters shall be reconstructed from the observed values on the search range @var{p}. Using plain @funref{@@infsup/fsolve} would take considerably longer, because the search range has 4 dimensions. Bisecting intervals requires an exponential number of steps and can easily become inefficient. Thus we use a contractor for function @var{f}, which in addition to the function value can produce a refinement for its parameter constraints. Contractors can easily be build using interval reverse operations like @funref{@@infsup/mulrev}, @funref{@@infsup/sqrrev}, @funref{@@infsup/powrev1}, etc. @example @group ## Simulate some data sets and add uncertainty x = -6 : 3 : 18; f = @@(p1, p2, p3, p4) ... p1 .^ x .* (p2 + p3 .* x + p4 .* x .^ 2); y = f (1.5, 1, -3, 0.5) .* infsup ("[0.999, 1.001]"); @end group @group function [fval, p1, p2, p3, p4] = ... contractor (y, p1, p2, p3, p4) x = -6 : 3 : 18; ## Forward evaluation a = p1 .^ x; b = p3 .* x; c = p2 + b; d = p4 .* x .^ 2; e = c + d; fval = a .* e; ## Reverse evaluation and ## undo broadcasting of x y = intersect (y, fval); a = mulrev (e, y, a); e = mulrev (a, y, e); p1 = powrev1 (x, a, p1); p1 = intersect (p1, [], 2); c = intersect (c, e - d); d = intersect (d, e - c); p2 = intersect (p2, c - b); p2 = intersect (p2, [], 2); b = intersect (b, c - p2); p3 = mulrev (x, b, p3); p3 = intersect (p3, [], 2); p4 = mulrev (x .^ 2, d, p4); p4 = intersect (p4, [], 2); endfunction @end group @end example Now, search for solutions in the range of @code{p} and try to restore the function parameters. @example @group p = infsup ("[1.1, 2] [1, 5] [-5, -1] [0.1, 5]"); p = fsolve (@@contractor, ... p, y, ... struct ("Contract", true))' @result{} p ⊂ 4×1 interval vector [1.4991, 1.5009] [1, 1.0011] [-3.0117, -2.9915] [0.49772, 0.50578] @end group @end example The function parameters 1.5, 1, @minus{}3, and 0.5 from above could be restored. The contractor function could significantly improve the convergence speed of the algorithm. @subsection Combination of Functions Sometimes it is hard to express the search range in terms of a single function and its constraints, when the preimage of the function consists of a union or intersection of different parts. Several contractor functions can be combined using @funref{ctc_union} or @funref{ctc_intersect} to make a contractor function for more complicated sets. The combined contractor function allows one to solve for more complicated sets in a single step. @include image/contractor-rings-union.m.texinfo @myimage{image/contractor-rings-union.m,Set inversion for two rings} Intersections of contractor functions are especially useful to apply several constraints at once. For example, when it is known that a particular location has a distance of @var{a} ∈ [3, 4] from object A, located at coordinates (1, 3), and a distance of @var{b} ∈ [5, 6] from object B, located at coordinates (2, -1), the intersection of both rings yields all possible locations in the search range. The combined contractor function enables fast convergence of the search algorithm. @include image/contractor-rings-intersect.m.texinfo @myimage{image/contractor-rings-intersect.m,Set inversion for intersection of two rings} @node Path Planning @section Path Planning @float Figure,cameleon-problem @caption{Cameleon Problem: The polygon has to be moved from the left to the right without touching any obstacles along the path.} @shortcaption{Cameleon Problem Description} @myimage{image/cameleon-start-end.svg,Cameleon Problem: Start and End Position} @end float The problem presented here is a simplified version from the paper L. Jaulin (2001). @uref{https://www.ensta-bretagne.fr/jaulin/cameleon.html,Path planning using intervals and graphs.} Reliable Computing, issue 1, volume 7, 1–15. There is an object, a simple polygon in this case, which shall be moved from a starting position to a specified target position. Along the way there are obstacles which may not be touched by the polygon. The polygon can be moved in one direction (left to right or right to left) and may be rotated around its lower left corner. This makes a two dimensional parameter space and any feasible positions can be determined using interval arithmetic like in the examples above. Then we use a simple path planning algorithm: We move along the centers of adjacent and feasible boxes in the parameter space until we have a closed path from the start position to the end position. The path is guaranteed to be feasible, that is, there will be no collisions if we follow the path. @include image/cameleon.m.texinfo The script visualizes the solution in the parameter space. Unfeasible parameters are white, and uncertain combinations of parameters are red. The algorithm's accuracy is just good enough to find a closed path, which is drawn in green color. The uncertain red area is quite big because we have used a very simple check for verification whether the polygon overlaps the obstacles. This could be improved. @myimage{image/cameleon.m,Computed feasible path in parameter space} The solution is not optimal, please refer to Luc Jaulin's paper for more sophisticated approaches. However, we could find a valid solution that moves the polygon as desired without touching any obstacles. @float Figure,cameleon-solution @caption{Cameleon Problem: A possible solution which moves the polygon from the left to the right without touching obstacles.} @shortcaption{Cameleon Problem Solution} @html @end html @myimage{image/cameleon-transition.svg,Cameleon Problem: Transition from Start to End Position} @html @end html @end float interval-2.1.0/doc/chapter/getting-started.texinfo0000644000000000000000000004532213031036767020376 0ustar 00000000000000@c This is part of the GNU Octave Interval Package Manual. @c Copyright 2015-2016 Oliver Heimlich. @c See the file manual.texinfo for copying conditions. @documentencoding UTF-8 @chapter Getting Started This chapter takes you by the hand and gives a quick overview on the interval packages basic capabilities. More detailed information can usually be found in the functions' documentation. @section Installation It is recommended to install the package from specialized distributors for the particular platform, e. g., @uref{https://tracker.debian.org/pkg/octave-interval,Debian GNU/Linux}, @uref{https://trac.macports.org/browser/trunk/dports/math/octave-interval,MacPorts (for Mac OS X)}, @uref{http://www.freshports.org/math/octave-forge-interval/,FreshPorts (for FreeBSD)}, and so on. Since Octave version 4.0.1 the package is included in the @uref{https://ftp.gnu.org/gnu/octave/windows/,official installer for Microsoft Windows} and is installed automatically on that platform. In any case, the interval package can alternatively be installed with the @command{pkg} command from within Octave. Latest release versions are published at Octave Forge and can be automatically downloaded with the @option{-forge} option. @example @c doctest: +SKIP @group pkg install -forge interval   @print{} For information about changes from previous versions   @print{} of the interval package, run 'news interval'. @end group @end example During this kind of installation parts of the interval package are compiled for the target system, which requires development libraries for GNU Octave (version ≥ 3.8.0) and GNU MPFR (version ≥ 3.1.0) to be installed. It might be necessary to install packages “liboctave-dev” and “libmpfr-dev”, which are provided by most GNU distributions (names may vary). In order to use the interval package during an Octave session, it must have been @emph{loaded}, i. e., added to the path. In the following parts of the manual it is assumed that the package has been loaded, which can be accomplished with the @command{pkg load interval} command. It is recommended to add this command at the beginning of script files, especially if script files are published or shared. Automatic loading of the interval package can be activated by adding the line @command{pkg load interval} to your @file{.octaverc} file located in your user folder, for more information @pxref{Startup Files,,, octave, GNU Octave manual}. That's it. The package is ready to be used within Octave. @section Set-based Interval Arithmetic The most important and fundamental concepts in the context of the interval package are: @itemize @item Intervals are closed, connected subsets of the real numbers. Intervals may be unbound (in either or both directions) or empty. In special cases @code{+inf} and @code{-inf} are used to denote boundaries of unbound intervals, but any member of the interval is a @emph{finite} real number. @item Classical functions are extended to interval functions as follows: The result of function @var{f} evaluated on interval @var{x} is an interval enclosure of all possible values of @var{f} over @var{x} where the function is defined. Most interval arithmetic functions in this package manage to produce a very accurate such enclosure. @item The result of an interval arithmetic function is an interval in general. It might happen, that the mathematical range of a function consist of several intervals, but their union will be returned, e. g., 1 / [-1, 1] = [Entire]. @end itemize More details can be found in @ref{Introduction to Interval Arithmetic}. @section Input and Output Before exercising interval arithmetic, interval objects must be created from non-interval data. There are interval constants @funref{empty} and @funref{entire} and the interval constructors @funref{@@infsupdec/infsupdec} (create an interval from boundaries), @funref{midrad} (create an interval from midpoint and radius) and @funref{hull} (create an interval enclosure for a list of mixed arguments: numbers, intervals or interval literals). The constructors are very sophisticated and can be used with several kinds of parameters: Interval boundaries can be given by numeric values or string values with decimal numbers. Create intervals for performing interval arithmetic @example @group ## Interval with a single number infsupdec (1) @result{} ans = [1]_com @end group @end example @example @group ## Interval defined by lower and upper bound infsupdec (1, 2) @result{} ans = [1, 2]_com @end group @end example @example @group ## Boundaries are converted from strings infsupdec ("3", "4") @result{} ans = [3, 4]_com @end group @end example @example @group ## Decimal number infsupdec ("1.1") @result{} ans ⊂ [1.0999, 1.1001]_com @end group @end example @example @group ## Decimal number with scientific notation infsupdec ("5.8e-17") @result{} ans ⊂ [5.7999e-17, 5.8001e-17]_com @end group @end example @example @group ## Interval around 12 with uncertainty of 3 midrad (12, 3) @result{} ans = [9, 15]_com @end group @end example @example @group ## Again with decimal numbers midrad ("4.2", "1e-3") @result{} ans ⊂ [4.1989, 4.2011]_com @end group @end example @example @group ## Interval members with arbitrary order hull (3, 42, "19.3", "-2.3") @result{} ans ⊂ [-2.3001, +42]_com @end group @end example @example @group ## Symbolic numbers hull ("pi", "e") @result{} ans ⊂ [2.7182, 3.1416]_com @end group @end example @strong{Warning:} In above examples decimal fractions are passed as a string to the constructor. Otherwise it is possible, that GNU Octave introduces conversion errors when the numeric literal is converted into a floating-point number @emph{before} it is passed to the constructor. The interval construction is a critical process, but after this the interval package takes care of any further conversion errors, representational errors, round-off errors and inaccurate numeric functions. Beware of the conversion pitfall @example @group ## The numeric constant 0.3 is an approximation of the ## decimal number 0.3. An interval around this approximation ## will not contain the decimal number 0.3. output_precision (17) infsupdec (0.3) @result{} ans ⊂ [0.29999999999999998, 0.29999999999999999]_com @end group @end example @example @group ## However, passing the decimal number 0.3 as a string ## to the interval constructor will create an interval which ## actually encloses the decimal number. format short infsupdec ("0.3") @result{} ans ⊂ [0.29999, 0.30001]_com @end group @end example For maximum portability it is recommended to use interval literals, which are standardized by IEEE Std 1788-2015. Both interval boundaries are then given as a string in the form @code{[@var{l}, @var{u}]}. The output in the examples above gives examples of several interval literals. @example @group ## Interval literal infsupdec ("[20, 4.2e10]") @result{} ans = [20, 4.2e+10]_com @end group @end example The default text representation of intervals is not guaranteed to be exact, because this would massively spam console output. For example, the exact text representation of @code{realmin} would be over 700 decimal places long! However, the output is correct as it guarantees to contain the actual boundaries: a displayed lower (upper) boundary is always less (greater) than or equal to the actual boundary. @subsection Interval Vectors and Matrices Vectors and matrices of intervals can be created by passing numerical matrices, string or cell arrays to the interval constructors. With cell arrays it is also possible to mix several types of boundaries. Interval matrices behave like normal matrices in GNU Octave and can be used for broadcasting and vectorized function evaluation. Vectorized function evaluation usually is the key to create very fast programs. Create interval matrices @example @group M = infsupdec (magic (3)) @result{} M = 3×3 interval matrix [8]_com [1]_com [6]_com [3]_com [5]_com [7]_com [4]_com [9]_com [2]_com @end group @end example @example @group infsupdec (magic (3), magic (3) + 1) @result{} ans = 3×3 interval matrix [8, 9]_com [1, 2]_com [6, 7]_com [3, 4]_com [5, 6]_com [7, 8]_com [4, 5]_com [9, 10]_com [2, 3]_com @end group @end example @example @group infsupdec ("0.1; 0.2; 0.3; 0.4; 0.5") @result{} ans ⊂ 5×1 interval vector [0.099999, 0.10001]_com [0.19999, 0.20001]_com [0.29999, 0.30001]_com [0.39999, 0.40001]_com [0.5]_com @end group @end example @example @group infsupdec ("1 [2, 3]; 4, 5, 6") @result{} ans = 2×3 interval matrix [1]_com [2, 3]_com [Empty]_trv [4]_com [5]_com [6]_com @end group @end example @example @group infsupdec (@{1; eps; "4/7"; "pi"@}, @{2; 1; "e"; "0xff"@}) @result{} ans ⊂ 4×1 interval vector [1, 2]_com [2.2204e-16, 1]_com [0.57142, 2.7183]_com [3.1415, 255]_com @end group @end example @section Arithmetic Operations The interval package comprises many interval arithmetic operations. A complete list can be found in its function reference. Function names match GNU Octave standard functions where applicable and follow recommendations by IEEE Std 1788-2015 otherwise, @pxref{Function Names}. The interval arithmetic flavor used by this package is the “set-based” interval arithmetic and follows these rules: Intervals are sets. They are subsets of the set of real numbers. The interval version of an elementary function such as sin(x) is essentially the natural extension to sets of the corresponding point-wise function on real numbers. That is, the function is evaluated for each number in the interval where the function is defined and the result must be an enclosure of all possible values that may occur. By default arithmetic functions are computed with best possible accuracy (which is more than what is guaranteed by GNU Octave core functions). The result will therefore be a tight and very accurate enclosure of the true mathematical value in most cases. Details on each function's accuracy can be found in its documentation, which is accessible with GNU Octave's @command{help} command. Examples of using interval arithmetic functions @example @group sin (infsupdec (0.5)) @result{} ans ⊂ [0.47942, 0.47943]_com @end group @end example @example @group power (infsupdec (2), infsupdec (3, 4)) @result{} ans = [8, 16]_com @end group @end example @example @group atan2 (infsupdec (1), infsupdec (1)) @result{} ans ⊂ [0.78539, 0.7854]_com @end group @end example @example @group midrad (magic (3), 0.5) * pascal (3) @result{} ans = 3×3 interval matrix [13.5, 16.5]_com [25, 31]_com [42, 52]_com [13.5, 16.5]_com [31, 37]_com [55, 65]_com [13.5, 16.5]_com [25, 31]_com [38, 48]_com @end group @end example @section Numerical Operations Some interval functions do not return an interval enclosure, but a single number (in binary64 precision). Most important are @funref{@@infsup/inf} and @funref{@@infsup/sup}, which return the lower and upper interval boundaries. More such operations are @funref{@@infsup/mid} (approximation of the interval's midpoint), @funref{@@infsup/wid} (approximation of the interval's width), @funref{@@infsup/rad} (approximation of the interval's radius), @funref{@@infsup/mag} (interval's magnitude) and @funref{@@infsup/mig} (interval's mignitude). @example @group ## Enclosure of the decimal number 0.1 is not exact ## and results in an interval with a small uncertainty. wid (infsupdec ("0.1")) @result{} ans = 1.3878e-17 @end group @end example @section Boolean Operations Interval comparison operations produce boolean results. While some comparisons are especially for intervals (@funref{@@infsup/subset}, @funref{@@infsup/interior}, @funref{@@infsup/ismember}, @funref{@@infsup/isempty}, @funref{@@infsup/disjoint}, …) others are interval extensions of simple numerical comparison. For example, the less-or-equal comparison is mathematically defined as ∀a ∃b a ≤ b ∧ ∀b ∃a a ≤ b. @example @group infsup (1, 3) <= infsup (2, 4) @result{} ans = 1 @end group @end example @section Matrix Operations Above mentioned operations can also be applied element-wise to interval vectors and matrices. Many operations use vectorization techniques. In addition, there are matrix operations on interval matrices. These operations comprise: dot product, matrix multiplication, vector sums (all with tightest accuracy), matrix inversion, matrix powers, and solving linear systems (the latter are less accurate). As a result of missing hardware / low-level library support and missing optimizations, these operations are relatively slow compared to familiar operations in floating-point arithmetic. Examples of using interval matrix functions @example @group A = infsupdec ([1, 2, 3; 4, 0, 0; 0, 0, 1]); A (2, 3) = "[0, 6]" @result{} A = 3×3 interval matrix [1]_com [2]_com [3]_com [4]_com [0]_com [0, 6]_com [0]_com [0]_com [1]_com @end group @end example @example @group B = inv (A) @result{} B = 3×3 interval matrix [0]_trv [0.25]_trv [-1.5, 0]_trv [0.5]_trv [-0.125]_trv [-1.5, -0.75]_trv [0]_trv [0]_trv [1]_trv @end group @end example @example @group A * B @result{} ans = 3×3 interval matrix [1]_trv [0]_trv [-1.5, +1.5]_trv [0]_trv [1]_trv [-6, +6]_trv [0]_trv [0]_trv [1]_trv @end group @end example @example @group A = infsupdec (magic (3)) @result{} A = 3×3 interval matrix [8]_com [1]_com [6]_com [3]_com [5]_com [7]_com [4]_com [9]_com [2]_com @end group @end example @example @group c = A \ [3; 4; 5] @result{} c ⊂ 3×1 interval vector [0.18333, 0.18334]_trv [0.43333, 0.43334]_trv [0.18333, 0.18334]_trv @end group @end example @example @group A * c @result{} ans ⊂ 3×1 interval vector [2.9999, 3.0001]_trv [3.9999, 4.0001]_trv [4.9999, 5.0001]_trv @end group @end example @subsection Notes on Linear Systems A system of linear equations in the form A@var{x} = b with intervals can be seen as a range of classical linear systems, which can be solved simultaneously. Whereas classical algorithms compute an approximation for a single solution of a single linear system, interval algorithms compute an enclosure for all possible solutions of (possibly several) linear systems. Some characteristics should definitely be known when linear interval systems are solved: @itemize @item If the linear system is underdetermined and has infinitely many solutions, the interval solution will be unbound in at least one of its coordinates. Contrariwise, from an unbound result it can not be concluded whether the linear system is underdetermined or has solutions. @item If the interval result is empty in at least one of its coordinates, the linear system is guaranteed to be overdetermined and has no solutions. Contrariwise, from a non-empty result it can not be concluded whether all or some of the systems have solutions or not. @item Wide intervals within the matrix A can easily lead to a superposition of cases, where the rank of A is no longer unique. If the linear interval system contains cases of linear independent equations as well as linear dependent equations, the resulting enclosure of solutions will inevitably be very broad. @end itemize However, solving linear systems with interval arithmetic can produce useful results in many cases and automatically carries a guarantee for error boundaries. Additionally, it can give better information than the floating-point variants for some cases. Standard floating point arithmetic versus interval arithmetic on ill-conditioned linear systems @example @group A = [1, 0; 2, 0]; ## This linear system has no solutions A \ [3; 0] @print{} warning: ...matrix singular to machine precision... @result{} ans = 0.60000 0.00000 @end group @end example @example @group ## This linear system has many solutions A \ [4; 8] @result{} ans = 4 0 @end group @end example @example @group ## The empty interval vector proves that there is no solution infsup (A) \ [3; 0] @result{} ans = 2×1 interval vector [Empty] [Empty] @end group @end example @example @group ## The unbound interval vector indicates ## that there may be many solutions infsup (A) \ [4; 8] @result{} ans = 2×1 interval vector [4] [Entire] @end group @end example @section Plotting Plotting of intervals in 2D and 3D can be achieved with the functions @funref{@@infsup/plot} and @funref{@@infsup/plot3} respectively. However, some differences in comparison with classical plotting in Octave shall be noted. When plotting classical (non-interval) functions in Octave, one normally uses a vector and evaluates a function on that vector element-wise. The resulting X and Y (and possibly Z) coordinates are then drawn against each other, whilst coordinates can be connected using interpolated lines. The plot shows an approximation of the function's graph and the accuracy (and smoothness of the graph) primarily depends on the number of coordinates where the function has been evaluated. Evaluating the same function on a single interval (e. g. the part of the function's domain that is of interest) yields a single interval result which covers the actual range of the function. Plotting just two intervals, input and output, against each other is boring, because the plot would only show a single rectangle. Contrariwise, evaluating the function for many individual points (e. g. using @funref{@@infsup/linspace}) would hardly fit in the philosophy of interval arithmetic. Individual points of evaluation are not interconnected by the interval plotting functions, because that would introduce errors. The solution for plotting functions with interval arithmetic is called: “mincing”. The @funref{@@infsup/mince} function divides an interval into many smaller adjacent subsets, which can be used for range evaluations of the function. As a result, one gets vectors of intervals, which produce a coverage of the function's graph using rectangles. Please note, how the rectangles cover the sine function's true range from @minus{}1 to 1 in the following example, whilst the interpolated lines make a poor approximation. @include image/interval-vs-normal-plot.m.texinfo @myimage{image/interval-vs-normal-plot.m,Plotting an interval function and a classic function} For 3D plotting the @funref{@@infsup/meshgrid} function, as usual, becomes handy. The following example shows how two different ranges for X and Y coordinates are used to construct a grid, where the function @funref{@@infsup/atan2} is evaluated. In this particular case the interval grid has gaps, because X and Y coordinates have been constructed such that intervals do not intersect. @include image/interval-plot3.m.texinfo @myimage{image/interval-plot3.m,Plotting 3D interval grid points} interval-2.1.0/doc/chapter/ieee-1788.texinfo0000644000000000000000000004661213031036767016610 0ustar 00000000000000@c This is part of the GNU Octave Interval Package Manual. @c Copyright 2015-2016 Oliver Heimlich. @c See the file manual.texinfo for copying conditions. @documentencoding UTF-8 @appendix IEEE Std 1788-2015 The IEEE standard for interval arithmetic is an important asset for the general use of interval arithmetic. Several interval arithmetic libraries have been created (most popular for the language C++), which vary greatly in their philosophy, completeness and—most important—mathematical definition of certain functions and arithmetic evaluation. The standard grants support for several interval arithmetic flavors, but fights incompatibilities on many layers: Interval arithmetic applications shall be portable, predictable, and reproducible. This is especially important since interval arithmetic shall lead to reliable results. Also a common standard is necessary to catalyze the availability of (fast) interval operations in hardware. For all conforming implementations certain accuracy constraints must be satisfied and a good amount of interval functions must be implemented. It is defined how to handle functions that are not globally defined or have limiting values. Also such basic things like interval representation, many useful constructors, and interchange encoding are addressed. The interval package for GNU Octave is the first complete implementation that claims to be standard conforming. @menu * Function Names:: List of functions defined by IEEE Std 1788-2015@*and how they have been implemented in GNU Octave * Conformance Claim:: Official statement and some@*implementation specific details regarding the standard @end menu @node Function Names @appendixsec Function Names In terms of a better integration into the GNU Octave language, several operations use a function name which is different from the name proposed in the standard document. The following table translates and lists the implemented function names of the IEEE standard for interval arithmetic. The implementation provides several additional functions, but this section lists only functions that are mentioned in IEEE Std 1788-2015. @appendixsubsec Interval constants See @funref{empty} and @funref{entire}. @appendixsubsec Constructors The operations textToInterval (@var{S}), numsToInterval (@var{l}, @var{u}), and setDec (@var{x}) are implemented by the class constructors @funref{@@infsup/infsup} for bare intervals and @funref{@@infsupdec/infsupdec} for decorated intervals. @appendixsubsec Required functions @float Table,tab:required-forward-functions @caption{Required forward elementary functions} @shortcaption{Required forward elementary functions} @multitable {roundTiesToAway (x)} {@@infsupdec/iscommoninterval} {Tightness (and comments...)} @headitem Operation @tab Implementation @tab Tightness @ifnottex @headitem @tab @r{@emph{Basic operations}} @tab @end ifnottex @item neg (@var{x}) @tab@funref{@@infsup/uminus} @tab tightest @item add (@var{x}, @var{y}) @tab@funref{@@infsup/plus} @tab tightest @item sub (@var{x}, @var{y}) @tab@funref{@@infsup/minus} @tab tightest @item mul (@var{x}, @var{y}) @tab@funref{@@infsup/times} @tab tightest @item div (@var{x}, @var{y}) @tab@funref{@@infsup/rdivide} @tab tightest @item recip (@var{x}) @tab@code{1 ./ @var{x}} @tab tightest @item sqr (@var{x}) @tab@code{@var{x} .^ 2} @tab tightest @item sqrt (@var{x}) @tab@funref{@@infsup/realsqrt} @tab tightest @item fma (@var{x}, @var{y}, @var{z}) @tab@funref{@@infsup/fma} @tab tightest @ifnottex @headitem @tab @r{@emph{Power functions}} @tab @end ifnottex @item pown (@var{x}, @var{p}) @tab@funref{@@infsup/pown} @tab tightest @item pow (@var{x}, @var{y}) @tab@funref{@@infsup/pow} @tab tightest @item exp (@var{x}) @tab@funref{@@infsup/exp} @tab tightest @item exp2 (@var{x}) @tab@funref{@@infsup/pow2} @tab tightest @item exp10 (@var{x}) @tab@funref{@@infsup/pow10} @tab tightest @item log (@var{x}) @tab@funref{@@infsup/log} @tab tightest @item log2 (@var{x}) @tab@funref{@@infsup/log2} @tab tightest @item log10 (@var{x}) @tab@funref{@@infsup/log10} @tab tightest @ifnottex @headitem @tab @r{@emph{Trigonometric / hyperbolic}} @tab @end ifnottex @item sin (@var{x}) @tab@funref{@@infsup/sin} @tab tightest @item cos (@var{x}) @tab@funref{@@infsup/cos} @tab tightest @item tan (@var{x}) @tab@funref{@@infsup/tan} @tab tightest @item asin (@var{x}) @tab@funref{@@infsup/asin} @tab tightest @item acos (@var{x}) @tab@funref{@@infsup/acos} @tab tightest @item atan (@var{x}) @tab@funref{@@infsup/atan} @tab tightest @item atan2 (@var{y}, @var{x}) @tab@funref{@@infsup/atan2} @tab tightest @item sinh (@var{x}) @tab@funref{@@infsup/sinh} @tab tightest @item cosh (@var{x}) @tab@funref{@@infsup/cosh} @tab tightest @item tanh (@var{x}) @tab@funref{@@infsup/tanh} @tab tightest @item asinh (@var{x}) @tab@funref{@@infsup/asinh} @tab tightest @item acosh (@var{x}) @tab@funref{@@infsup/acosh} @tab tightest @item atanh (@var{x}) @tab@funref{@@infsup/atanh} @tab tightest @ifnottex @headitem @tab @r{@emph{Integer functions}} @tab @end ifnottex @item sign (@var{x}) @tab@funref{@@infsup/sign} @tab tightest @item ceil (@var{x}) @tab@funref{@@infsup/ceil} @tab tightest @item floor (@var{x}) @tab@funref{@@infsup/floor} @tab tightest @item trunc (@var{x}) @tab@funref{@@infsup/fix} @tab tightest @item roundTiesToEven (@var{x}) @tab@funref{@@infsup/roundb} @tab tightest @item roundTiesToAway (@var{x}) @tab@funref{@@infsup/round} @tab tightest @ifnottex @headitem @tab @r{@emph{Absmax functions}} @tab @end ifnottex @item abs (@var{x}) @tab@funref{@@infsup/abs} @tab tightest @item min (@var{x}, @var{y}) @tab@funref{@@infsup/min} @tab tightest @item max (@var{x}, @var{y}) @tab@funref{@@infsup/max} @tab tightest @end multitable @end float @float Table,tab:required-reverse-functions @caption{Required reverse functions} @shortcaption{Required reverse functions} @multitable {roundTiesToAway (x)} {@@infsupdec/iscommoninterval} {Tightness (and comments...)} @headitem Operation @tab Implementation @tab Tightness @ifnottex @headitem @tab @r{@emph{From unary functions}} @tab @end ifnottex @item sqrRev (@var{c}, @var{x}) @tab@funref{@@infsup/sqrrev} @tab tightest @item absRev (@var{c}, @var{x}) @tab@funref{@@infsup/absrev} @tab tightest @item pownRev (@var{c}, @var{x}, @var{p}) @tab@funref{@@infsup/pownrev} @tab valid (tightest for @var{p} ≥ @minus{}2) @item sinRev (@var{c}, @var{x}) @tab@funref{@@infsup/sinrev} @tab valid @item cosRev (@var{c}, @var{x}) @tab@funref{@@infsup/cosrev} @tab valid @item tanRev (@var{c}, @var{x}) @tab@funref{@@infsup/tanrev} @tab valid @item coshRev (@var{c}, @var{x}) @tab@funref{@@infsup/coshrev} @tab tightest @ifnottex @headitem @tab @r{@emph{From binary functions}} @tab @end ifnottex @item mulRev (@var{b}, @var{c}, @var{x}) @tab@funref{@@infsup/mulrev} @tab tightest @item powRev1 (@var{b}, @var{c}, @var{x}) @tab@funref{@@infsup/powrev1} @tab valid @item powRev2 (@var{a}, @var{c}, @var{x}) @tab@funref{@@infsup/powrev2} @tab valid @item atan2Rev1 (@var{b}, @var{c}, @var{x}) @tab@funref{@@infsup/atan2rev1} @tab valid @item atan2Rev2 (@var{a}, @var{c}, @var{x}) @tab@funref{@@infsup/atan2rev2} @tab valid @ifnottex @headitem @tab @r{@emph{Two-output division}} @tab @end ifnottex @item mulRevToPair (@var{b}, @var{c}) @tab@funref{@@infsup/mulrev} @tab tightest @ifnottex @headitem @tab @r{@emph{Cancellative addition@*and subtraction}} @tab @end ifnottex @item cancelMinus (@var{x}, @var{y}) @tab@funref{@@infsup/cancelminus} @tab tightest @item cancelPlus (@var{x}, @var{y}) @tab@funref{@@infsup/cancelplus} @tab tightest @end multitable @end float @float Table,tab:required-set-operations @caption{Required set operations} @shortcaption{Required set operations} @multitable {roundTiesToAway (x)} {@@infsupdec/iscommoninterval} {Tightness (and comments...)} @headitem Operation @tab Implementation @tab Tightness @item intersection (@var{x}, @var{y}) @tab@funref{@@infsup/intersect} @tab tightest @item convexHull (@var{x}, @var{y}) @tab@funref{@@infsup/union} @tab tightest @end multitable @end float @float Table,tab:required-numeric-functions @caption{Required numeric functions of intervals} @shortcaption{Required numeric functions of intervals} @multitable {roundTiesToAway (x)} {@@infsupdec/iscommoninterval} {Tightness (and comments...)} @headitem Operation @tab Implementation @tab Rounding mode @item inf (@var{x}) @tab@funref{@@infsup/inf} @tab @item sup (@var{x}) @tab@funref{@@infsup/sup} @tab @item mid (@var{x}) @tab@funref{@@infsup/mid} @tab to nearest, ties to even @item wid (@var{x}) @tab@funref{@@infsup/wid} @tab toward +∞ @item rad (@var{x}) @tab@funref{@@infsup/rad} @tab toward +∞ @item mag (@var{x}) @tab@funref{@@infsup/mag} @tab @item mig (@var{x}) @tab@funref{@@infsup/mig} @tab @end multitable @end float @float Table,tab:required-boolean-functions @caption{Required boolean functions of intervals} @shortcaption{Required boolean functions of intervals} @multitable {roundTiesToAway (x)} {@@infsupdec/iscommoninterval} {Tightness (and comments...)} @headitem Operation @tab Implementation @tab Description @item isEmpty (@var{x}) @tab@funref{@@infsup/isempty} @tab @var{x} is the empty set @item isEntire (@var{x}) @tab@funref{@@infsup/isentire} @tab @var{x} is the whole line @item equal (@var{a}, @var{b}) @tab@funref{@@infsup/eq} @tab @var{a} equals @var{b} @item subset (@var{a}, @var{b}) @tab@funref{@@infsup/subset} @tab @var{a} is a subset of @var{b} @item less (@var{a}, @var{b}) @tab@funref{@@infsup/le} @tab @var{a} is weakly less than @var{b} @item precedes (@var{a}, @var{b}) @tab@funref{@@infsup/precedes} @tab @var{a} is left of but may touch @var{b} @item interior (@var{a}, @var{b}) @tab@funref{@@infsup/interior} @tab @var{a} is interior to @var{b} @item strictLess (@var{a}, @var{b}) @tab@funref{@@infsup/lt} @tab @var{a} is strictly less than @var{b} @item strictPrecedes (@var{a}, @var{b}) @tab@funref{@@infsup/strictprecedes} @tab @var{a} is strictly left of @var{b} @item disjoint (@var{a}, @var{b}) @tab@funref{@@infsup/disjoint} @tab @var{a} and @var{b} are disjoint @end multitable @end float @appendixsubsec Recommended functions @float Table,tab:recommended-functions @caption{Recommended functions} @shortcaption{Recommended functions} @multitable {roundTiesToAway (x)} {@@infsupdec/iscommoninterval} {Tightness (and comments...)} @headitem Operation @tab Implementation @tab Tightness / Comments @ifnottex @headitem @tab @r{@emph{Elementary functions}} @tab @end ifnottex @item rootn (@var{x}, @var{q}) @tab@funref{@@infsup/nthroot} @tab valid (tightest for @var{q} ≥ @minus{}2) @item expm1 (@var{x}) @tab@funref{@@infsup/expm1} @tab tightest @item logp1 (@var{x}) @tab@funref{@@infsup/log1p} @tab tightest @item hypot (@var{x}, @var{y}) @tab@funref{@@infsup/hypot} @tab tightest @item rSqrt (@var{x}) @tab@funref{@@infsup/rsqrt} @tab tightest @ifnottex @headitem @tab @r{@emph{Boolean functions}} @tab @end ifnottex @item isCommonInterval (@var{x}) @tab@funref{@@infsup/iscommoninterval} @tab (=bound and non-empty) @item isSingleton (@var{x}) @tab@funref{@@infsup/issingleton} @tab (=single real) @item isMember (@var{m}, @var{x}) @tab@funref{@@infsup/ismember} @tab @ifnottex @headitem @tab @r{@emph{Extended comparison}} @tab @end ifnottex @item overlap (@var{a}, @var{b}) @tab@funref{@@infsup/overlap} @tab @end multitable @end float @appendixsubsec Operations on/with decorations See @funref{@@infsup/newdec}, @funref{@@infsupdec/intervalpart}, and @funref{@@infsupdec/decorationpart}. The operation setDec is implemented by @funref{@@infsupdec/infsupdec}. For comparison of decorations with respect to the propagation order @code{com > dac > def > trv > ill} use the numeric value returned by @code{decorationpart (@var{x}, "uint8")}. @appendixsubsec Reduction operations See @funref{mpfr_vector_sum_d} and @funref{mpfr_vector_dot_d}. The operations @code{sumAbs} and @code{sumSquare} can be computed with @code{mpfr_vector_sum_d (@var{rounding mode}, abs (@var{x}))} and @code{mpfr_vector_dot_d (@var{rounding mode}, @var{x}, @var{x})} respectively. @appendixsubsec Input The operation @code{textToInterval} is implemented by the class constructors @funref{@@infsup/infsup} for bare intervals and @funref{@@infsupdec/infsupdec} for decorated intervals. Both are able to operate on interval literals provided as strings. @appendixsubsec Output See @funref{@@infsup/intervaltotext}. @appendixsubsec Exact text representation See @funref{exacttointerval} and @funref{@@infsup/intervaltoexact}. @appendixsubsec Interchange representation and encoding See @funref{interval_bitpack} and @funref{@@infsup/bitunpack}. @node Conformance Claim @appendixsec Conformance Claim The inverval package version @value{version} for GNU Octave is conforming to IEEE Std 1788-2015, IEEE Standard for Interval Arithmetic. It is conforming to the set-based flavor with IEEE 754 conformance for the infsup binary64 interval type and without compressed arithmetic. Additionally it provides no further flavors. @appendixsec Conformance Questionnaire @html
@end html @enumerate a @item Implementation-defined behavior @enumerate 1 @item What status flags or other means to signal the occurrence of certain decoration values in computations does the implementation provide if any? The implementation does not signal the occurrence of decoration values. @end enumerate @item Documentation of behavior @enumerate 1 @item If the implementation supports implicit interval types, how is the interval hull operation realized? The implementation supports explicit interval types only. @item What accuracy is achieved (i.e., tightest, accurate, or valid) for each of the implementation’s interval operations? The accuracy requirements of IEEE Std 1788-2015 are fulfilled. Most operations achieve tightest accuracy, some operations (especially reverse operations) do not. The tightness of each operation is documented in the function's documentation string and can be displayed with the @command{help} command. @item Under what conditions is a constructor unable to determine whether a Level 1 value exists that corresponds to the supplied inputs? When two different string boundaries for an interval both lie between the same two subsequent binary64 numbers, a PossiblyUndefined warning is created. @item How are ties broken in rounding numbers if multiple numbers qualify as the rounded result? Tie-breaking uses the IEEE Std 754 default: round ties to even. @item How are interval datums converted to their exact text representations? The binary64 boundaries are converted into hexadecimal-significand form as required by the standard. It is also possible to convert interval datums to exact interval literals in decimal form, see optional arguments of function @funref{@@infsup/intervaltotext} for that purpose. @end enumerate @item Implementation-defined behavior @enumerate 1 Does the implementation include the interval overlapping function? If so, how is it made available to the user? Yes, the interval overlapping function is implemented under the name @funref{@@infsup/overlap}. @item Does the implementation store additional information in a NaI? What functions are provided for the user to set and read this information? No additional information is stored in a NaI. @item What means if any does the implementation provide for an exception to be signaled when a NaI is produced? The creation of a NaI is signaled with GNU Octave's warning mechanism. @item What interval types are supported besides the required ones? None. @item What mechanisms of exception handling are used in exception handlers provided by the implementation? What additional exception handling is provided by the implementation? The exceptions described by IEEE Std 1788-2015 raise a warning, which can be handled with GNU Octave's warning mechanism. The warning may be customized to produce an error instead and interrupt computation. The implementation provides no additional exception handling. @item [Question does not apply to IEEE 754 conforming types.] @item Does the implementation include different versions of the same operation for a given type and how are these provided to the user? The interval matrix multiplication (see @funref{@@infsup/mtimes}) offers two implementations, with either @option{tightest} or @option{valid} accuracy. The user may chose the desired version with an optional argument during the function call. @item What combinations of formats are supported in interval constructors? Any reasonable combination of the formats described in the standard document is supported. @item [Question does not apply to IEEE 754 conforming types.] @item What methods are used to read or write strings from or to character streams? Does the implementation employ variations in locales (such as specific character case matching)? This includes the syntax used in the strings for reading and writing. Input and output is implemented with GNU Octave string variables in UTF-8 encoding. There is no discrimination between different locales. Character case is ignored during input. The syntax for interval literals is used as described by the standard document. @item What is the tightness for the interval to string conversion for all interval types? The general-purpose interval to string conversion produces the tightest decimal infsup form which has no more digits than are necessary to separate two binary64 numbers. @item What is the result of Level 3 operations for invalid inputs? Interval constructors prevent the creation of invalid Level 3 interval datums. Any non-interval input to Level 3 operations is implicitly converted into an interval and the operation silently continues on interval inputs. If at least one input is a decorated interval, bare interval inputs are implicitly decorated as described by @command{newDec} in the standard document. Implicit promotion from a bare interval to a decorated interval is signaled with GNU Octave's warning mechanism. If implicit conversion fails (e.g., illegal interval literals), bare interval operations produce empty intervals, whereas the decorated interval operations continue on NaI inputs. @item [Question does not apply to IEEE 754 conforming types.] @item What decorations does the implementation provide and what is their mathematical definition? How are these decorations mapped when converting an interval to the interchange format? The implementation provides the decorations com, dac, def, trv, and ill as described by the standard document. @item [Question does not apply to IEEE 754 conforming types.] @end enumerate @item [Question applies to compressed arithmetic only, which is not supported.] @item [Questions apply to non-standard flavors only, which are not supported.] @end enumerate interval-2.1.0/doc/chapter/introduction-to-interval-arithmetic.texinfo0000644000000000000000000003256213031036767024405 0ustar 00000000000000@c This is part of the GNU Octave Interval Package Manual. @c Copyright 2015-2016 Oliver Heimlich. @c Copyright 2008-2009 Simone Pernice. @c See the file manual.texinfo for copying conditions. @documentencoding UTF-8 @chapter Introduction to Interval Arithmetic @quotation Give a digital computer a problem in arithmetic, and it will grind away methodically, tirelessly, at gigahertz speed, until ultimately it produces the wrong answer. … An interval computation yields a pair of numbers, an upper and a lower bound, which are guaranteed to enclose the exact answer. Maybe you still don’t know the truth, but at least you know how much you don’t know. @author Brian Hayes, @uref{http://dx.doi.org/10.1511/2003.6.484,DOI: 10.1511/2003.6.484} @end quotation Interval arithmetic adds two unique features to ordinary computer arithmetic: (1) Functions can be evaluated over (connected) subsets of their domain, and (2) any computational errors are automatically considered and are accumulated in the final outcome. In conjunction they yield a @emph{verified result enclosure} over a range of input values. These possibilities of interval arithmetic enable great new possibilities, but what is wrong with the well-known computer arithmetic in the first place? @section Motivation Floating-point arithmetic, as specified by @uref{http://en.wikipedia.org/wiki/IEEE_floating_point,IEEE Std 754}, is available in almost every computer system today. It is wide-spread, implemented in common hardware and integral part in programming languages. For example, the binary64 format (a.k.a. double-precision) is the default numeric data type in GNU Octave. Benefits are obvious: The results of arithmetic operations are (mostly) well-defined and comparable between different systems and computation is highly efficient. However, there are some downsides of floating-point arithmetic in practice, which will eventually produce errors in computations. Generally speaking, most of these problems occur in any arithmetic with finite precision. @itemize @item Floating-point arithmetic is often used mindlessly by developers. @url{http://docs.oracle.com/cd/E19957-01/806-3568/ncg_goldberg.html} @url{http://www.cs.berkeley.edu/~wkahan/Mindless.pdf} @url{http://www.ima.umn.edu/~arnold/disasters/} @item The binary (base-2) data types categorically are not suitable for doing financial computations. Very often representational errors are introduced when using “real world” decimal numbers. @url{http://en.wikipedia.org/wiki/Decimal_computer} @item Even if the developer would be proficient, most developing environments / technologies limit floating-point arithmetic capabilities to a very limited subset of IEEE Std 754: Only one or two data types, no rounding modes, missing functions, … @url{http://www.cs.berkeley.edu/~wkahan/JAVAhurt.pdf} @item Results are @uref{https://hal.archives-ouvertes.fr/hal-00128124/en/,hardly predictable}. All operations produce the best possible accuracy at runtime, this is how a floating point works. Contrariwise, financial computer systems typically use a @uref{http://en.wikipedia.org/wiki/Fixed-point_arithmetic,fixed-point arithmetic} (COBOL, PL/I, …), where overflow and rounding can be precisely predicted at @emph{compile-time}. @item Results are system dependent. All but the most basic floating-point operations are @uref{http://www.gnu.org/software/libc/manual/html_node/Errors-in-Math-Functions.html#Errors-in-Math-Functions,not guaranteed to be accurate} and produce different results depending on low level libraries and @uref{http://developer.amd.com/tools-and-sdks/cpu-development/libm/,hardware}. @item If you do not know the technical details (cf. first bullet) you ignore the fact that the computer lies to you in many situations. For example, when looking at numerical output and the computer says “@code{ans = 0.1},” this is not absolutely correct. In fact, the value is only close enough to the value 0.1. Additionally, many functions produce limit values (∞ × −∞ = −∞, ∞ ÷ 0 = ∞, ∞ ÷ −0 = −∞, log (0) = −∞), which is sometimes (but not always!) useful when overflow and underflow occur. @end itemize Interval arithmetic addresses above problems in its very special way. It accepts the fact that numbers cannot be stored or computed with infinite precision and introduces enclosures of exact values, which can be computed on any machine with finite precision. This introduces new possibilities for algorithms. Any errors are covered by the range of an interval during the course of computation. All members of intervals are by definition finite real numbers, which results in an exception free and mathematically well-defined arithmetic. The possibility to actually evaluate a function on a connected range of values and compute a guaranteed enclosure of all possible values is a unique selling point. For example, the @uref{http://en.wikipedia.org/wiki/Interval_arithmetic#Interval_Newton_method,interval newton method} (see @funref{@@infsup/fzero}) is able to find @emph{all} zeros of a particular function. More precisely, the algorithm is able to reliably eliminate ranges of values where the function cannot have a root by a simple interval evaluation of either the function itself or its derivative. Global convergence can be achieved by bisecting the intermediate ranges. @section Error bounds in real life @c This section is largely based on the documentation for the Octave SIMP package by Simone Pernice. Intervals can be used instead of simple numbers to automatically take into account the tolerance (or uncertainty) of the values used in calculation. Every day we need to compute the result of a lot of simple mathematical equations. For example the cost of the apples bought at the farmer's market is given by: @display apple price = apple cost per kilo · kilos of apple bought @end display When we need the result of those mathematical expressions, we put the values on the right hand side of the equation and we compute its result for the left hand side. We usually put wrong (erroneous) numbers into the equation and therefore where is no doubt we get wrong results. There are a lot of reasons why we use incorrect values, for example @enumerate @item Most of the values are measured, therefore they are known within a given tolerance. @uref{http://en.wikipedia.org/wiki/Accuracy_and_precision,Wikipedia sv. accuracy and precision} @item Some values have an infinite number of digits after the (decimal) point, e.g. π. @item Some values change with time or samples (or whatever), like the weight of a person, which can change of 5 percent during the day, or the current gain of a bipolar junction transistor (BJP), which can change of 50 percent on the samples of the same series. @item Some values are estimation or guess—something like between a minimum and a maximum. @end enumerate @noindent For example, if a pipe breaks and you want to buy a new one you need its diameter. If you do not have a caliber, you may measure its circumference and divide it by π. @display diameter = circumference / π @end display Here are two errors: the circumference is known within the tolerance given by your meter, moreover π has an infinite number of digits while only few of them can be used in the operation. You may think the error is negligible, the result is enough accurate to buy a new pipe in a hardware shop. However, the not infinite precision of those operations avoid the use of computers as automatic theorem demonstration tools and so on. This kind of issue is quite common in engineer design. What engineers do is to make sure their design will work in the worst case or in most of the cases (usually more than 99.9 percent). A simple example follows. Let us say you want to repaint the walls of your living room completely messed up by your children. You need to compute how many paint cans you need to buy. The equation is quite simple: @display paint cans = 2 · (room width + room length) · room height / (paint per can · paint efficiency), @end display @noindent where “paint efficiency” is how many square meters of surface can be painted with a liter of paint. The problem here is that usually we do not have a long enough meter to measure the room width and length. It is much simpler to count the number of steps to go through it (1 step is about a meter, let us say from 0.9 to 1.1 meters). Moreover, the paint provider usually declares a paint efficiency range. Here is the data: @itemize @item room width = 6 steps (5.4m to 6.6m) @item room length = 4 steps (3.6m to 4.4m) @item room height = 3m (it is assumed to be correct) @item paint efficiency = from 0.7 to 1.3 square meters per liter @item paint liters per can = 40 (it is assumed to be correct) @end itemize @noindent To compute the average result just put average values in. We get: paint cans = 2 · (6 + 4) · 3 / (40 · 1) = 1.5, which means two paint cans unless you are able to buy just half of the second can. What happens in the worst case? Just put pessimistic values in the equation. We get: paint cans = 2 · (6.6 + 4.4) · 3 / (40 · 0.7) = 2.36. That is, in the worst case we would be short 0.36 cans of paint. It makes sense to buy 3 cans. Last, consider the best case. Is it enough to only buy a single can of paint? Just put optimistic values in the equation. We get: paint cans = 2 · (5.4 + 3.6) · 3 / (40 · 1.3) = 1.04, which means one can of paint would not be enough. You have to buy at least two cans, but probably need one more. For this result we had to go through the equation multiple times (at least twice) and carefully consider for each variable, which would be the most optimistic / pessimistic value assignment, which is not trivial. For example consider the room size versus the paint efficiency: It depends whether the highest or the lowest value takes an optimistic or pessimistic role—and this was a simple example with basic arithmetic operations. Using interval arithmetic it is possible to compute the result in a single run with ranges as inputs. The following example demonstrates this and further below is explained how it works. @example @group step = midrad (1, "0.1"); w = 6 * step; l = 4 * step; h = 3; eff = infsupdec ("[0.7, 1.3]"); cansize = 40; cans = 2 * (w + l) * h / (eff * cansize) @result{} cans ⊂ [1.0384, 2.3572]_com @end group @end example @example @group ## Since we can only buy whole cans ceil (cans) @result{} ans = [2, 3]_def @end group @end example @section Pros and Cons Interval arithmetic, introduced in the 1960s, is a young and powerful technique. Its first application has been to control errors in computations and simplify error analysis for engineers (rounding errors, truncation errors, and conversion errors). The range evaluation of functions has soon been exploited for reliably checking for certain function values and for self-verifying algorithms. Latest usage scenarios comprise root finding, function approximation, and robust pattern recognition. More useful applications are certainly left to be detected. The major problem in interval arithmetic is that errors can easily build up, such that the final result is too wide to be useful. This is especially true when the @emph{dependency problem} applies, that is, a single variable occurs several times within a computation and is represented by an interval in each occurrence. Then, the variable virtually may take different values independently, which introduces a systematic error. For example, computing @code{x .^ 2} will always yield a subset of @code{times (x, x)}, the latter considers two intervals independent of each other. @example @group x = infsupdec ("[-1, 3]"); x .^ 2 @result{} ans = [0, 9]_com times (x, x) @result{} ans = [-3, +9]_com @end group @end example After all, it is possible to reduce overestimation errors by subdividing the function's domain into smaller intervals, e. g., with bisection. This technique is called “mincing”. The computational errors are proportional to the interval width and a linear convergence can be achieved. @example @group x1 = infsupdec ("[-1, 1]"); x2 = infsupdec ("[1, 3]"); hull (x1 .^ 2, x2 .^ 2) @result{} ans = [0, 9]_com hull (times (x1, x1), times (x2, x2)) @result{} ans = [-1, +9]_com @end group @end example However, this does not help when ranges of input values are too big. For certain applications it is better to use statistical models, where infinite domains are supported. @section Theory There are good introductions to interval arithmetic available and should be consulted for a deeper understanding of the topic. The following recommendations can make a starting point. @itemize @item @uref{http://en.wikipedia.org/wiki/Interval_arithmetic,Wikipedia sv. interval arithmetic} @item Introduction to Interval Analysis (2009), by Ramon E. Moore, R. Baker Kearfott, and Michael J. Cloud. Cambridge University Press. ISBN 978-0898716696. @item @uref{http://www-sop.inria.fr/coprin/logiciels/ALIAS/Examples/COURS/index.html,Introduction to the methods used in interval arithmetic (French)}. @item @uref{http://www.maths.manchester.ac.uk/~higham/narep/narep416.pdf,Interval analysis in MATLAB} Note: The INTLAB toolbox for Matlab is not entirely compatible with this interval package for GNU Octave. However, basic operations can be compared and should be compatible for common intervals. @item @uref{http://www.cs.utep.edu/interval-comp/,Interval related collection of links} @end itemize interval-2.1.0/doc/chapter/preface.texinfo0000644000000000000000000003144213031036767016674 0ustar 00000000000000@c This is part of the GNU Octave Interval Package Manual. @c Copyright 2015-2016 Oliver Heimlich. @c See the file manual.texinfo for copying conditions. @documentencoding UTF-8 @unnumbered Preface Welcome to the user manual of the @dfn{interval package} for GNU Octave. This chapter presents background information and may safely be skipped. First-time users who want to cut right to the chase should read @ref{Getting Started}, which teaches basic concepts and first steps with the package. Users who are not familiar with interval arithmetic should read @ref{Introduction to Interval Arithmetic} first. Still feeling undecided? Look at the @ref{Examples} and see how easy you can put this software to great use! Development of the GNU Octave Interval Package started in September 2014. The IEEE standard for interval arithmetic, IEEE Std 1788-2015, had been drafted by its working group until July 2014 and was about to enter the balloting process. In January 2015 a first package release could be made, which contained the full set of functions required by the standard's draft. On June 11 the standard finally became approved and this interval package can be seen as the first ever completed standard conforming interval arithmetic library. The creation of the interval package has been straightforward, although the author had no previous experience with Octave. Octave is a great environment for getting things done and its active community helps a lot. In this spirit, the interval package wants to be an easy to use tool for experimenting with and quick prototyping of interval arithmetic algorithms and applications. Originally it was intended to only implement the operations required by the standard document, but support for fundamental concepts of Octave as well as interval vectors and interval matrices have soon been added. Today the package contains many useful interval analysis algorithms and solvers, which, together with basic arithmetic functions, form a powerful and versatile library. @myimage{image/octave-interval.ly,GNU Octave Interval Pun} Like Octave, the interval package has nothing to do with music. Above picture is a pun and shows an “octave interval” between the notes d' and d''. The frequencies of these notes can be enclosed by an interval which is a subset of [293, 588] Hz. @menu * Acknowledgments:: * Philosophy:: * Distribution and Development:: * Getting Help:: @end menu @node Acknowledgments @section Acknowledgments The GNU Octave interval package is build upon great third-party software. @itemize @item Most correctly rounded arithmetic operations are based on the @uref{http://www.mpfr.org/,GNU MPFR library} by Guillaume Hanrot, Vincent Lefèvre, Patrick Pélissier, Philippe Théveny and Paul Zimmermann. @item Several correctly rounded arithmetic operations are based on the @uref{http://lipforge.ens-lyon.fr/www/crlibm/,correctly rounded math library} by Jean-Michel Muller, Florent de Dinechin, Christoph Lauter, David Defour, Catherine Daramy-Loirat, Matthieu Gallet, and Nicolas Gast. @item Jiří Rohn has published his comprehensive verification toolbox @uref{http://uivtx.cs.cas.cz/~rohn/matlab/,VERSOFT} as free software on July 26, 2016. On November 24 he has fully disclosed the source code and several high-level functions could be included in the interval package with minor adjustments, e. g., @funref{@@infsup/chol}, @funref{vereigvec}, and @funref{verlinprog}. Also, many thanks to Vladik Kreinovich who has helped to clear the licensing issue with VERSOFT. @item A linear system solver @funref{@@infsup/mldivide} and a polynomial evaluation algorithm @funref{@@infsup/polyval} for bare intervals are derived from routines developed for @uref{http://www2.math.uni-wuppertal.de/~xsc/,C-XSC} at University of Wuppertal, Germany. @item @ref{Introduction to Interval Arithmetic} is partly based on the documentation for the former SIMP package for Octave by Simone Pernice. @item A French translation of the package description has been made by Rodéric Moitié. @item In the @ref{Examples} for finding root enclosures a function and code by Helmut Podhaisky has been used. @item The @uref{http://iamooc.ensta-bretagne.fr/, online course on interval analysis} by Luc Jaulin and Jordan Ninin at ENSTA-Bretagne has inspired me to implement the set inversion algorithms in @funref{@@infsup/fsolve}. @item I have gained access to scientific literature thanks to the @uref{https://www.hswt.de/about-us/central-facilities/library.html, Weihenstephan-Triesdorf University of Applied Sciences}. @item Most unit tests are written in portable ITL format and converted into GNU Octave test cases with the @uref{https://github.com/nehmeier/ITF1788,Interval Testing Framework for IEEE 1788}. The framework has been developed by Maximilian Kiesner and Marco Nehmeier, Chair of Software Engineering, Department of Computer Science, University of Würzburg, Germany. @item Several unit tests are derived from @uref{https://github.com/nehmeier/libieeep1788,libieeep1788}, a C++ implementation of IEEE Std 1788-2015, IEEE standard for interval arithmetic. The library contains several unit tests for its IEEE 754 flavor, which is compatible with the arithmetic of the GNU Octave interval package. I have converted nearly 6000 of these test cases into portable ITL format for verification of this package. @comment libieeep1788/NOTICE @comment According to the Apache License, this shall be included in the documentation @indentedblock @verbatiminclude license/libieeep1788.NOTICE @end indentedblock @item Several unit tests are derived from @uref{http://perso.ens-lyon.fr/nathalie.revol/software.html,MPFI}, a C++ interval arithmetic library based on GNU MPFR. The library contains several unit tests for binary64 numbers, which are compatible with the arithmetic of the GNU Octave interval package. I have converted nearly 1500 of these test cases into portable ITL format for verification of this package. @item Several unit tests are derived from @uref{http://www2.math.uni-wuppertal.de/wrswt/software/filib.html,FI_LIB}, an ANSI-C interval arithmetic library based on binary64 numbers. The library contains several unit tests, which are compatible with the arithmetic of the GNU Octave interval package. I have converted 800 of these test cases into portable ITL format for verification of this package. @item Some unit tests are derived from @uref{http://www2.math.uni-wuppertal.de/~xsc/xsc/cxsc_new.html,C-XSC}, a C++ class library for interval arithmetic. The library contains some unit tests, which are compatible with the arithmetic of the GNU Octave interval package. I have converted 160 of these test cases into portable ITL format for verification of this package. @item Fast matrix multiplication (see @funref{@@infsup/mtimes}) as well as the linear system solver (see @funref{@@infsup/mldivide}) use BLAS routines with directed rounding. An OCT-file interface for setting the rounding mode has been developed by Kai Torben Ohlus, Institute for Reliable Computing, Hamburg University of Technology, Germany. @end itemize Last, but not least, many thanks to everybody who has contributed to the success of free software! @node Philosophy @section Philosophy @noindent Features @itemize @item Free software licensed under the terms of the GNU General Public License (Version 3 or later) @item Many interval arithmetic functions with high, system-independent accuracy @item Conforming to IEEE Std 1788-2015, IEEE standard for interval arithmetic @item Support for interval vectors and interval matrices @itemize @item very accurate vector sum, vector dot and matrix multiplication (correctly rounded) @item fast matrix multiplication and fast solver for dense linear systems (BLAS routines) @item vectorized function evaluation @end itemize @item Easy usage @itemize @item GNU Octave function names @item convenient interval constructors @item broadcasting @end itemize @end itemize @noindent Limitations @itemize @item No complex numbers @item No sparse matrices (maybe in the future, if requested by users) @item No multidimensional arrays (maybe in the future, if requested by users) @end itemize The interval arithmetic provided by the interval package focuses on easy usage, accuracy and correctness. It is rather slow compared to other arithmetic libraries. If accurate type checking during compile time—a substantial feature for verified computing—is needed, the user is advised to try third-party interval libraries for strongly typed programming languages like C/C++. The interval package for GNU Octave can nonetheless be used for prototyping of interval algorithms. @emph{Why is the interval package slow?} All arithmetic interval operations are simulated in high-level Octave language using C99 or multi-precision floating-point routines, which is a lot slower than a @uref{https://books.google.de/books?id=JTc4XdXFnQIC&pg=PA61,hardware implementation}. Building interval arithmetic operations from floating-point routines is easy for simple monotonic functions, e. g., addition and subtraction, but is complex for others, e. g., interval power function, atan2, or reverse functions. For some interval operations it is not even possible to rely on floating-point routines, since not all required routines are available in C99 or BLAS. For example, accurate multiplication of matrices with many elements becomes unfeasible as it takes a lot of time. @float Table,tab:runtime @caption{Approximate runtime for certain functions (wall clock time in seconds) — Results have been produced with GNU Octave 3.8.2 and Interval package 0.1.4 on an Intel Core i5-4340M CPU (2.9–3.6 GHz)} @shortcaption{Approximate runtime for certain functions} @multitable {matrix size} {accuracy} {accuracy} {accuracy} {accuracy} {accuracy} {accuracy} @headitem @tab@command{plus} @tab@command{log} @tab@command{pow} @tab@command{mtimes} @tab@command{mtimes} @tab@command{inv} @item Interval@*matrix size @tab tightest@*accuracy @tab tightest@*accuracy @tab tightest@*accuracy @tab valid@*accuracy @tab tightest@*accuracy @tab valid@*accuracy @item 10 × 10 @tab < 0.001 @tab 0.001 @tab 0.008 @tab 0.001 @tab 0.002 @tab 0.025 @item 100 × 100 @tab 0.003 @tab 0.055 @tab 0.61 @tab 0.012 @tab 0.53 @tab 0.30 @item 500 × 500 @tab 0.060 @tab 1.3 @tab 15 @tab 0.30 @tab 63 @tab 4.2 @end multitable @end float @emph{Why is the interval package accurate?} The GNU Octave built-in floating-point routines are not useful for interval arithmetic: Their results depend on hardware, system libraries and compilation options. The interval package handles all arithmetic functions with the help of the GNU MPFR library. With MPFR it is possible to compute system-independent, valid and tight enclosures of the correct results for most functions. However, it should be noted that some reverse operations and matrix operations do not exists in GNU MPFR and therefore cannot be computed with the same accuracy. It is possible to use faster (BLAS based) routines during computation of the matrix multiplication @funref{@@infsup/mtimes}, because correctly rounded matrix multiplication could be considered too slow for certain applications. However, this is not the default behavior and must be explicitly activated by the user. @node Distribution and Development @section Distribution and Development The interval package is free software: Everyone is encouraged to use it, copy it and redistribute it, as well as to make changes under the terms of the GNU General Public License. The interval package is part of Octave Forge, a sibling of the GNU Octave project. Official releases are published at @url{http://octave.sourceforge.net/}. The @uref{https://sourceforge.net/p/octave/interval/ci/default/tree/,source code repository} is located at Octave Forge and contains the latest development version. Information for developers can be found on the @uref{http://wiki.octave.org/Interval_package,package's page at Octave wiki}. Bug reports and feature requests for either the software or this manual may be posted under the @uref{http://savannah.gnu.org/projects/octave,Octave Project at Savannah}. Contributions to the software and this manual are highly appreciated. @node Getting Help @section Getting Help The interval package contains online help for every function, which can be accessed with the @command{help} command from Octave. The interval arithmetic is implemented with specialized data types, which override standard functions. Whilst the command @command{help @var{function name}} shows the documentation for core Octave functions, the interval variants of these functions can be requested with the command @command{help @@infsup/@var{function name}}. Further help can be seeked at the @uref{https://lists.gnu.org/mailman/listinfo/help-octave,Octave Help mailing list}. interval-2.1.0/doc/htmlxref.cnf0000644000000000000000000000010113031036767014550 0ustar 00000000000000octave node https://www.gnu.org/software/octave/doc/interpreter/ interval-2.1.0/doc/image/cameleon-animation.svg0000644000000000000000000046750613031036767017624 0ustar 00000000000000 Cameleon Problem, Transition Animation image/svg+xml Cameleon Problem, Transition Animation 2016-03-29 Oliver Heimlich Oliver Heimlich own work Hover/click to start animation interval-2.1.0/doc/image/cameleon-start-end.svg0000644000000000000000000001340313031036767017525 0ustar 00000000000000 Cameleon Problem, Start and End State image/svg+xml Cameleon Problem, Start and End State 2016-03-29 Oliver Heimlich Oliver Heimlich own work Start Position End Position Obstacles interval-2.1.0/doc/image/cameleon-transition.svg0000644000000000000000000002575213031036767020030 0ustar 00000000000000 Cameleon Problem, Transition States image/svg+xml Cameleon Problem, Transition States 2016-03-29 Oliver Heimlich Oliver Heimlich own work interval-2.1.0/doc/image/cameleon.m.texinfo0000644000000000000000000000744413031036767016746 0ustar 00000000000000@c This is part of the GNU Octave Interval Package Manual. @c Copyright 2016 Oliver Heimlich. @c See the file manual.texinfo for copying conditions. @documentencoding UTF-8 @example @group @c doctest: +SKIP # We can build the simple polygon from interval boxes global polygon_x = ... infsup ("[18,20] [0,20] [0, 2] [ 0,14] [12,14] [10,14]")'; global polygon_y = ... infsup ("[ 0,18] [0, 2] [0,14] [12,14] [ 6,14] [ 6, 8]")'; global obstacle_x = infsup ("[ 8,11] [25,28]"); global obstacle_y = infsup ("[10,10] [10,10]"); color_feasible = [238 232 213] ./ 255; color_uncertain = [220 50 47] ./ 255; color_path = [133 153 0] ./ 255; @end group @group function feasible = check_collision (obstacle_x, obstacle_y) global polygon_x; global polygon_y; feasible = infsup (zeros (size (obstacle_x)), ... ones (size (obstacle_x))); # Check if the obstacle is inside the polygon inside = any (... subset (obstacle_x, polygon_x) & subset (obstacle_y, polygon_y)); feasible(inside) = 0; # Check if the obstacle is outside the polygon outside = all (... disjoint (obstacle_x, polygon_x) | ... disjoint (obstacle_y, polygon_y)); feasible(outside) = 1; endfunction @end group @group function feasible = check_parameters (x_offset, angle) global obstacle_x; global obstacle_y; # Instead of rotating the polygon, we rotate the obstacles (reverse) s = sin (-angle); c = cos (-angle); f_x = @@(x, y) (x - x_offset) .* c - y .* s; f_y = @@(x, y) (x - x_offset) .* s + y .* c; # All obstacles must be considered feasible = 1; for i = 1 : numel (obstacle_x) feasible = min (feasible, ... check_collision (f_x (obstacle_x(i), obstacle_y(i)), ... f_y (obstacle_x(i), obstacle_y(i)))); endfor endfunction @end group @group # Compute a paving of feasible polygon states [x, paving, inner] = fsolve (... @@check_parameters, ... infsup ("[-28, 57] [-1.4, 2.7]"), ... 1, ... struct ('MaxIter', 21, 'TolX', 0.03)); hold on plot (paving(1, inner), paving(2, inner), color_feasible); plot (paving(1, not (inner)), paving(2, not (inner)), color_uncertain); # Consider only states that are guaranteed to be feasible paving = paving (:, inner); @end group @group # Path search start_idx = find (all (ismember ([0; 0], paving)), 1); end_idx = find (all (ismember ([17; 0], paving)), 1); adjacency = not (disjoint (paving(1, :), transpose (paving(1, :))) | ... disjoint (paving(2, :), transpose (paving(2, :)))); # Do a Dijkstra search until we reach end_idx distance = inf (columns (paving), 1); # nan = visited previous = zeros (columns (paving), 1); distance(start_idx) = 0; while (not (isnan (distance(end_idx)))) [pivot_distance, pivot_idx] = min (distance); visited = isnan (distance); neighbors_idx = adjacency(:, pivot_idx) & not (visited); if (not (any (neighbors_idx))) error ("Cannot reach target location") endif neighbors_distance = subsasgn (... distance, ... substruct ("()", @{neighbors_idx@}), ... pivot_distance + hypot (... # Compute distance between centers of boxes mid (paving(1, pivot_idx)) - mid (paving(1, neighbors_idx)), ... mid (paving(2, pivot_idx)) - mid (paving(2, neighbors_idx)))); shorter_path = neighbors_idx & (neighbors_distance < distance); previous(shorter_path) = pivot_idx; distance(shorter_path) = neighbors_distance(shorter_path); distance(pivot_idx) = nan; endwhile @end group @group # Plot the path to the target location last_idx = end_idx; while (last_idx != start_idx) next_idx = previous(last_idx); x1 = mid (paving(1, last_idx)); y1 = mid (paving(2, last_idx)); x2 = mid (paving(1, next_idx)); y2 = mid (paving(2, next_idx)); plot ([x1 x2], [y1 y2], 'linewidth', 2, 'color', color_path); last_idx = next_idx; endwhile @end group @end example interval-2.1.0/doc/image/contractor-rings-intersect.m.texinfo0000644000000000000000000000301513031036767022445 0ustar 00000000000000@c This is part of the GNU Octave Interval Package Manual. @c Copyright 2015-2016 Oliver Heimlich. @c See the file manual.texinfo for copying conditions. @documentencoding UTF-8 @example @ifset m-file @group @c doctest: +SKIP ## General ring contractor function [fval, cx1, cx2] = ctc_ring (y, c1, c2, x1, x2) x1_c1 = x1 - c1; x2_c2 = x2 - c2; sqr_x1_c1 = x1_c1 .^ 2; sqr_x2_c2 = x2_c2 .^ 2; fval = hypot (x1_c1, x2_c2); y = intersect (y, fval); sqr_y = y .^ 2; sqr_x1_c1 = intersect (sqr_x1_c1, sqr_y - sqr_x2_c2); sqr_x2_c2 = intersect (sqr_x2_c2, sqr_y - sqr_x1_c1); x1_c1 = sqrrev (sqr_x1_c1, x1_c1); x2_c2 = sqrrev (sqr_x2_c2, x2_c2); cx1 = intersect (x1, x1_c1 + c1); cx2 = intersect (x2, x2_c2 + c2); endfunction @end group @group ## Ring 1 with center at (1, 3) ## Ring 2 with center at (2, -1) ctc_ring1 = @@(y, x1, x2) ctc_ring (y, 1, 3, x1, x2); ctc_ring2 = @@(y, x1, x2) ctc_ring (y, 2, -1, x1, x2); @end group @end ifset @group @c doctest: +SKIP ## Intersect ring 1 with radius 3..4 and ring 2 with radius 5..6 ctc_intersection_of_rings = ctc_intersect (ctc_ring1, "[3, 4]", ... ctc_ring2, "[5, 6]"); @end group @group ## Compute a paving to approximate the intersection of rings ## in the area x, y = -10..10 [~, paving] = fsolve (ctc_intersection_of_rings, ... infsup ("[-10, 10] [-10, 10]"), ... struct ("Contract", true)); plot (paving(1, :), paving(2, :)) axis equal @end group @end example interval-2.1.0/doc/image/contractor-rings-union.m.texinfo0000644000000000000000000000275613031036767021610 0ustar 00000000000000@c This is part of the GNU Octave Interval Package Manual. @c Copyright 2015-2016 Oliver Heimlich. @c See the file manual.texinfo for copying conditions. @documentencoding UTF-8 @example @group @c doctest: +SKIP ## General ring contractor function [fval, cx1, cx2] = ctc_ring (y, c1, c2, x1, x2) ## Forward evaluation x1_c1 = x1 - c1; x2_c2 = x2 - c2; sqr_x1_c1 = x1_c1 .^ 2; sqr_x2_c2 = x2_c2 .^ 2; fval = hypot (x1_c1, x2_c2); ## Reverse evaluation y = intersect (y, fval); sqr_y = y .^ 2; sqr_x1_c1 = intersect (sqr_x1_c1, sqr_y - sqr_x2_c2); sqr_x2_c2 = intersect (sqr_x2_c2, sqr_y - sqr_x1_c1); x1_c1 = sqrrev (sqr_x1_c1, x1_c1); x2_c2 = sqrrev (sqr_x2_c2, x2_c2); cx1 = intersect (x1, x1_c1 + c1); cx2 = intersect (x2, x2_c2 + c2); endfunction @end group @group ## Ring 1 with center at (1, 3) ## Ring 2 with center at (2, -1) ctc_ring1 = @@(y, x1, x2) ctc_ring (y, 1, 3, x1, x2); ctc_ring2 = @@(y, x1, x2) ctc_ring (y, 2, -1, x1, x2); @end group @group ## Unite ring 1 with radius 3..4 and ring 2 with radius 5..6 ctc_union_of_rings = ctc_union (ctc_ring1, "[3, 4]", ... ctc_ring2, "[5, 6]"); @end group @group ## Compute a paving to approximate the union of rings ## in the area x, y = -10..10 [~, paving] = fsolve (ctc_union_of_rings, ... infsup ("[-10, 10] [-10, 10]"), ... struct ("Contract", true)); plot (paving(1, :), paving(2, :)) axis equal @end group @end example interval-2.1.0/doc/image/interval-plot3.m.texinfo0000644000000000000000000000102613031036767020034 0ustar 00000000000000@c This is part of the GNU Octave Interval Package Manual. @c Copyright 2015-2016 Oliver Heimlich. @c See the file manual.texinfo for copying conditions. @documentencoding UTF-8 @example @group @c doctest: +SKIP red = [220 50 47] ./ 255; shade = [238 232 213] ./ 255; @end group @group x = midrad (1 : 6, 0.25); y = midrad (-3 : 3, 0.25); [x, y] = meshgrid (x, y); z = atan2 (y, x); plot3 (x, y, z, shade, red) @end group @group view ([-35, 30]) box off set (gca, "xgrid", "on", "ygrid", "on", "zgrid", "on") @end group @end example interval-2.1.0/doc/image/interval-sombrero.m0000644000000000000000000000245513031036767017157 0ustar 00000000000000## This is part of the GNU Octave Interval Package Manual. ## Copyright 2015-2016 Oliver Heimlich. ## See the file manual.texinfo for copying conditions. clf hold on light = [253 246 227] ./ 255; blue = [38 139 210] ./ 255; green = [133 153 0] ./ 255; yellow = [181 137 0] ./ 255; orange = [203 75 22] ./ 255; red = [220 50 47] ./ 255; range = mince (infsupdec (-8, 8), 13); [x, y] = meshgrid (range); h = hypot (x, y); z = sin (h) ./ h; ## The sombrero function would suffer from the dependency problem ## Thus, we compute an interval version of the function, which works around it. select = mag (h) < pi; z (select) = hull (sin (mag (h (select))) ./ mag (h (select)), ... sin (mig (h (select))) ./ mig (h (select))); z (mig (h) == 0) = union (z (mig (h) == 0), 1); flat = sup (z) < .3; low = ismember (sup (z), infsup (0.3, 0.8)); mid = ismember (sup (z), infsup (0.8, 0.9)); high = ismember (sup (z), infsup (0.9, 1)); top = sup (z) >= 1; plot3 (x (flat), y (flat), z (flat), blue, light) plot3 (x (low), y (low), z (low), green, light) plot3 (x (mid), y (mid), z (mid), yellow, light) plot3 (x (high), y (high), z (high), orange, light) plot3 (x (top), y (top), z (top), red, light) view ([-37.5, 30]) zlim ([-.4, 1]) box off set (gca, "xgrid", "on", "ygrid", "on", "zgrid", "on") %!assert(1); interval-2.1.0/doc/image/interval-vs-normal-plot.m.texinfo0000644000000000000000000000115113031036767021664 0ustar 00000000000000@c This is part of the GNU Octave Interval Package Manual. @c Copyright 2015-2016 Oliver Heimlich. @c See the file manual.texinfo for copying conditions. @documentencoding UTF-8 @example @group @c doctest: +SKIP hold on blue = [38 139 210] ./ 255; shade = [238 232 213] ./ 255; @end group @group ## Interval plotting x = mince (2*infsup (0, "pi"), 6); plot (x, sin (x), shade) @end group @group ## Classical plotting x = linspace (0, 2*pi, 7); plot (x, sin (x), 'linewidth', 2, 'color', blue) @end group @group set (gca, 'XTick', 0 : pi : 2*pi) set (gca, 'XTickLabel', @{'0', 'pi', '2 pi'@}) @end group @end example interval-2.1.0/doc/image/inverse-power.svg0000644000000000000000000010454113031036767016654 0ustar 00000000000000 Inserse Power Functionimage/svg+xmlInserse Power Function2012-10-11Oliver HeimlichCopyright 2012-2016 Oliver Heimlichown workGraphical interpretation of reverse power operations. The (twodimensional) inverse image of z is hatched and outlined in the figure, in the shown example it is z = [2, 3]. A, for given intervals y and z find every x with x^y ∩ z ≠ Ø. B, for given intervals x and z find every y with x^y ∩ z ≠ Ø. x x y A B x y y -1 -2 0 1 2 2 1 0 -1 -2 0 1 2 2 1 0 interval-2.1.0/doc/image/octave-interval.ly0000644000000000000000000000122313031036767016770 0ustar 00000000000000%% This is part of the GNU Octave Interval Package Manual. %% Copyright 2015-2016 Oliver Heimlich. %% See the file manual.texinfo for copying conditions. \include "lilypond-book-preamble.ly" \paper { indent = 0\mm line-width = 6\in % offset the left padding, also add 1mm as lilypond creates cropped % images with a little space on the right line-width = #(- line-width (* mm 3.000000) (* mm 1)) } \score { % Between d' and d'' lies an octave interval. \new Voice = "" { { 1 } } % Frequency of d' in just intonation is approx. 293,7 Hz, % wheras d'' has this doubled. \addlyrics { \lyricmode { "[293, 588]" } } \layout { } } interval-2.1.0/doc/image/poly-example-roots-simple.m.texinfo0000644000000000000000000000231213031036767022217 0ustar 00000000000000@c This is part of the GNU Octave Interval Package Manual. @c Copyright 2015-2016 Oliver Heimlich. @c Copyright 2015 Helmut Podhaisky. @c See the file manual.texinfo for copying conditions. @documentencoding UTF-8 @example @group @c doctest: +SKIP f = @@(x,y) ... -(5.*y - 20.*y.^3 + 16.*y.^5).^6 + ... (-(5.*x - 20.*x.^3 + 16.*x.^5).^3 + ... 5.*y - 20.*y.^3 + 16.*y.^5).^2; X = Y = infsup ("[-1, 1]"); has_roots = n = 1; @end group @group for iter = 1 : 10 ## Bisect [i,j] = ind2sub ([n,n], has_roots); X = infsup ([X.inf,X.inf,X.mid,X.mid],[X.mid,X.mid,X.sup,X.sup]); Y = infsup ([Y.inf,Y.mid,Y.inf,Y.mid],[Y.mid,Y.sup,Y.mid,Y.sup]); ii = [2*(i-1)+1,2*(i-1)+2,2*(i-1)+1,2*(i-1)+2] ; jj = [2*(j-1)+1,2*(j-1)+1,2*(j-1)+2,2*(j-1)+2] ; has_roots = sub2ind ([2*n,2*n], ii, jj); n *= 2; ## Check if function value covers zero fval = f (X, Y); zero_contained = find (ismember (0, fval)); ## Discard values without roots has_roots = has_roots(zero_contained); X = X(zero_contained); Y = Y(zero_contained); endfor @end group @group colormap gray B = false (n); B(has_roots) = true; imagesc (B) axis equal axis off @end group @end example interval-2.1.0/doc/image/poly-example-roots-with-deriv.m.texinfo0000644000000000000000000000375413031036767023023 0ustar 00000000000000@c This is part of the GNU Octave Interval Package Manual. @c Copyright 2015-2016 Oliver Heimlich. @c Copyright 2015 Helmut Podhaisky. @c See the file manual.texinfo for copying conditions. @documentencoding UTF-8 @example @group @c doctest: +SKIP f_dx = @@(x,y) ... -6.*(5 - 60.*x.^2 + 80.*x.^4) .* ... (5.*x - 20.*x.^3 + 16.*x.^5).^2 .* ... (-(5.*x - 20.*x.^3 + 16.*x.^5).^3 + ... 5.*y - 20.*y.^3 + 16.*y.^5); f_dy = @@(x,y) ... -6.*(5 - 60.*y.^2 + 80.*y.^4) .* ... (5.*y - 20.*y.^3 + 16.*y.^5).^5 + ... 2.*(5 - 60.*y.^2 + 80.*y.^4) .* ... (-(5.*x - 20.*x.^3 + 16.*x.^5).^3 + ... 5.*y - 20.*y.^3 + 16.*y.^5); @ifset m-file f = @@(x,y) ... -(5.*y - 20.*y.^3 + 16.*y.^5).^6 + ... (-(5.*x - 20.*x.^3 + 16.*x.^5).^3 + ... 5.*y - 20.*y.^3 + 16.*y.^5).^2; X = Y = infsup ("[-1, 1]"); has_roots = n = 1; @end ifset @end group @group for iter = 1 : 10 @ifset m-file ## Bisect [i,j] = ind2sub ([n,n], has_roots); X = infsup ([X.inf,X.inf,X.mid,X.mid],[X.mid,X.mid,X.sup,X.sup]); Y = infsup ([Y.inf,Y.mid,Y.inf,Y.mid],[Y.mid,Y.sup,Y.mid,Y.sup]); ii = [2*(i-1)+1,2*(i-1)+2,2*(i-1)+1,2*(i-1)+2] ; jj = [2*(j-1)+1,2*(j-1)+1,2*(j-1)+2,2*(j-1)+2] ; has_roots = sub2ind ([2*n,2*n], ii, jj); n *= 2; @end ifset @ifclear m-file @dots{} @end ifclear ## Check if function value covers zero fval1 = f (X, Y); fval2 = f (mid (X), mid (Y)) + ... (X - mid (X)) .* f_dx (X, Y) + ... (Y - mid (Y)) .* f_dy (X, Y); fval = intersect (fval1, fval2); @ifclear m-file @dots{} @end ifclear @ifset m-file zero_contained = find (ismember (0, fval)); ## Discard values without roots has_roots = has_roots(zero_contained); X = X(zero_contained); Y = Y(zero_contained); @end ifset endfor @end group @ifset m-file @group colormap gray B = false (n); B(has_roots) = true; imagesc (B) axis equal axis off @end group @end ifset @end example interval-2.1.0/doc/image/poly-example-surf.m0000644000000000000000000000027313031036767017072 0ustar 00000000000000f=@(x,y)-(5.*y - 20.*y.^3 + 16.*y.^5).^6 + (-(5.*x - 20.*x.^3 + 16.*x.^5).^3 + 5.*y - 20.*y.^3 + 16.*y.^5).^2; [x, y] = meshgrid (-1:0.01:1, -1:0.01:1); surf(x, y, f(x, y)) %!assert(1); interval-2.1.0/doc/license/apache-2.0.texi0000644000000000000000000002620613031036767016300 0ustar 00000000000000@center Apache License @center Version 2.0, January 2004 @center http://www.apache.org/licenses/ @heading TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION @enumerate 1 @item Definitions. ``License'' shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. ``Licensor'' shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. ``Legal Entity'' shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, ``control'' means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. ``You'' (or ``Your'') shall mean an individual or Legal Entity exercising permissions granted by this License. ``Source'' form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. ``Object'' form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. ``Work'' shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). ``Derivative Works'' shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. ``Contribution'' shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, ``submitted'' means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as ``Not a Contribution." ``Contributor'' shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. @item Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. @item Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. @item Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: @enumerate a @item You must give any other recipients of the Work or Derivative Works a copy of this License; and @item You must cause any modified files to carry prominent notices stating that You changed the files; and @item You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and @item If the Work includes a ``NOTICE'' text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. @end enumerate You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. @item Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. @item Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. @item Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an ``AS IS'' BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. @item Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. @item Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. @end enumerate @heading END OF TERMS AND CONDITIONS @heading APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets ``[]'' replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same ``printed page'' as the copyright notice for easier identification within third-party archives. @smallexample Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at @url{http://www.apache.org/licenses/LICENSE-2.0} Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. @end smallexample interval-2.1.0/doc/license/gpl-3.0.texi0000644000000000000000000010471213031036767015641 0ustar 00000000000000@c The GNU General Public License. @center Version 3, 29 June 2007 @c This file is intended to be included within another document, @c hence no sectioning command or @node. @display Copyright @copyright{} 2007 Free Software Foundation, Inc. @url{http://fsf.org/} Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. @end display @heading Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program---to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. 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 them 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 prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. 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. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. @heading TERMS AND CONDITIONS @html
@end html @enumerate 0 @item Definitions. ``This License'' refers to version 3 of the GNU General Public License. ``Copyright'' also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. ``The Program'' refers to any copyrightable work licensed under this License. Each licensee is addressed as ``you''. ``Licensees'' and ``recipients'' may be individuals or organizations. To ``modify'' a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a ``modified version'' of the earlier work or a work ``based on'' the earlier work. A ``covered work'' means either the unmodified Program or a work based on the Program. To ``propagate'' a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To ``convey'' a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays ``Appropriate Legal Notices'' to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. @item Source Code. The ``source code'' for a work means the preferred form of the work for making modifications to it. ``Object code'' means any non-source form of a work. A ``Standard Interface'' means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The ``System Libraries'' of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A ``Major Component'', in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The ``Corresponding Source'' for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. @item Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. @item Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. @item Conveying Verbatim Copies. You may convey 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; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. @item Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: @html
@end html @enumerate a @item The work must carry prominent notices stating that you modified it, and giving a relevant date. @item The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to ``keep intact all notices''. @item You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. @item If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. @end enumerate A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an ``aggregate'' if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. @item Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: @html
@end html @enumerate a @item Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. @item Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. @item Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. @item Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. @item Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. @end enumerate A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A ``User Product'' is either (1) a ``consumer product'', which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, ``normally used'' refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. ``Installation Information'' for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. @item Additional Terms. ``Additional permissions'' are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: @html
@end html @enumerate a @item Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or @item Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or @item Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or @item Limiting the use for publicity purposes of names of licensors or authors of the material; or @item Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or @item Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. @end enumerate All other non-permissive additional terms are considered ``further restrictions'' within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. @item Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. @item Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. @item Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An ``entity transaction'' is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. @item Patents. A ``contributor'' is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's ``contributor version''. A contributor's ``essential patent claims'' are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, ``control'' includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a ``patent license'' is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To ``grant'' such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. ``Knowingly relying'' means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is ``discriminatory'' if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. @item No Surrender of Others' Freedom. If 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 convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. @item Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. @item Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU 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 that a certain numbered version of the GNU General Public License ``or any later version'' applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. @item Disclaimer of Warranty. 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. @item Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 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. @item Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. @end enumerate @heading END OF TERMS AND CONDITIONS @heading 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 state the exclusion of warranty; and each file should have at least the ``copyright'' line and a pointer to where the full notice is found. @smallexample @var{one line to give the program's name and a brief idea of what it does.} Copyright (C) @var{year} @var{name of author} 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 @url{http://www.gnu.org/licenses/}. @end smallexample Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: @smallexample @var{program} Copyright (C) @var{year} @var{name of author} This program comes with ABSOLUTELY NO WARRANTY; for details type @samp{show w}. This is free software, and you are welcome to redistribute it under certain conditions; type @samp{show c} for details. @end smallexample The hypothetical commands @samp{show w} and @samp{show c} should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an ``about box''. You should also get your employer (if you work as a programmer) or school, if any, to sign a ``copyright disclaimer'' for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see @url{http://www.gnu.org/licenses/}. The GNU 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 Lesser General Public License instead of this License. But first, please read @url{http://www.gnu.org/philosophy/why-not-lgpl.html}. interval-2.1.0/doc/license/libieeep1788.NOTICE0000644000000000000000000000053513031036767016675 0ustar 00000000000000libieeep1788 ============ Copyright 2013 - 2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) Department of Computer Science, University of Wuerzburg, Germany This product includes software developed at Chair of Software Engineering, Department of Computer Science, University of Wuerzburg, Germany http://se.informatik.uni-wuerzburg.de/ interval-2.1.0/doc/manual.css0000644000000000000000000000143113031036767014225 0ustar 00000000000000/* This is part of the GNU Octave Interval Package Manual. Copyright 2015-2016 Oliver Heimlich. See the file manual.texinfo for copying conditions. */ /* Workaround for missing support of alpha lists and lists starting from zero in Texinfo's HTML output. FIXME: This should be fixed upstream. */ div.alpha-list + ol { list-style-type:lower-alpha; } div.zero-list + ol { counter-reset: item -1; } div.zero-list + ol > li { display:block; } div.zero-list + ol > li:before { content: counter(item) "."; counter-increment: item; display:inline-block; margin-left: -2.5em; min-width: 2em; margin-right: 0.2em; text-align: right; } /* Improve display of large graphics. FIXME: This should go into Octave's CSS file. */ div.float img { display: block; max-width: 42em; } object { max-width: 100% } interval-2.1.0/doc/manual.texinfo0000644000000000000000000000642013031036767015114 0ustar 00000000000000\input texinfo @setfilename manual.info @settitle GNU Octave Interval Package Manual @documentencoding UTF-8 @tex % U and the following characters have been predefined in TexInfo 6 @ifcommandnotdefined U \DeclareUnicodeCharacter{00A0}{\ } \DeclareUnicodeCharacter{00A7}{\S} \DeclareUnicodeCharacter{00B1}{$\pm$} \DeclareUnicodeCharacter{00B2}{${}^2$} \DeclareUnicodeCharacter{00B7}{$\cdot$} \DeclareUnicodeCharacter{00BD}{1/2} \DeclareUnicodeCharacter{00D7}{$\times$} \DeclareUnicodeCharacter{00F7}{$\div$} @end ifcommandnotdefined \DeclareUnicodeCharacter{03C0}{$\pi$} \DeclareUnicodeCharacter{202F}{\thinspace} \DeclareUnicodeCharacter{2080}{$_0$} \DeclareUnicodeCharacter{2081}{$_1$} \DeclareUnicodeCharacter{2200}{$\forall$} \DeclareUnicodeCharacter{2203}{$\exists$} \DeclareUnicodeCharacter{2208}{$\in$} \DeclareUnicodeCharacter{221E}{$\infty$} \DeclareUnicodeCharacter{2227}{$\wedge$} \DeclareUnicodeCharacter{2229}{$\cap$} \DeclareUnicodeCharacter{2264}{$\leq$} \DeclareUnicodeCharacter{2265}{$\geq$} \DeclareUnicodeCharacter{2282}{$\subset$} \DeclareUnicodeCharacter{2287}{$\supseteq$} \DeclareUnicodeCharacter{2713}{$\ast$} @end tex @copying This manual is for the GNU Octave interval package, version @value{version}. Copyright @copyright{} 2015–2016 Oliver Heimlich Permission is granted to copy, distribute and/or modify this document under the terms of the GNU General Public License, Version 3 or any later version published by the Free Software Foundation. A copy of the license is included in @ref{GNU General Public License}. @end copying @macro myimage{file, description} @ifnothtml @center @image{\file\,,,\description\,} @end ifnothtml @html \description\ @end html @end macro @macro funref{function} @inlinefmtifelse{html,@uref{@inlineifset{octave-forge,..}@inlineifclear{octave-forge,http://octave.sourceforge.net/interval}/function/\function\.html,\function\},@command{\function\}} @end macro @titlepage @title GNU Octave Interval Package @subtitle User Manual @vskip 0pt plus 3filll @myimage{image/interval-sombrero.m,Interval sombrero} @vskip 0pt plus 1filll @author Oliver Heimlich @page @vskip 0pt plus 1filll @insertcopying @end titlepage @ifnottex @insertcopying @end ifnottex @node Top @ifnottex @top @end ifnottex @menu How to install and use the interval package for GNU Octave * Preface:: Background information before usage * Getting Started:: Quick-start guide for the basics * Introduction to Interval Arithmetic:: Fundamental concepts * Examples:: Showcase of use cases * Advanced Topics:: Get the most out of it Appendix * IEEE Std 1788-2015:: IEEE standard for interval arithmetic * GNU General Public License:: The license for this software and its manual @end menu @ifhtml @myimage{image/interval-sombrero.m,Interval sombrero} @end ifhtml @contents @node Preface @include chapter/preface.texinfo @node Getting Started @include chapter/getting-started.texinfo @node Introduction to Interval Arithmetic @include chapter/introduction-to-interval-arithmetic.texinfo @node Examples @include chapter/examples.texinfo @node Advanced Topics @include chapter/advanced-topics.texinfo @node IEEE Std 1788-2015 @include chapter/ieee-1788.texinfo @node GNU General Public License @appendix GNU General Public License @include license/gpl-3.0.texi @bye interval-2.1.0/inst/@infsup/abs.m0000644000000000000000000000605213031036767015001 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} abs (@var{X}) ## ## Compute the absolute value of numbers. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## abs (infsup (2.5, 3.5)) ## @result{} ans = [2.5, 3.5] ## abs (infsup (-0.5, 5.5)) ## @result{} ans = [0, 5.5] ## @end group ## @end example ## @seealso{@@infsup/mag, @@infsup/mig} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = abs (x) if (nargin ~= 1) print_usage (); return endif ## This is already correct, if the interval(s) are non-negative. l = x.inf; u = x.sup; ## This is even correct, if the interval(s) are empty. notpositive = (x.sup <= 0); l(notpositive) = -x.sup(notpositive); u(notpositive) = -x.inf(notpositive); zerointerior = (x.inf < 0 & not (notpositive)); l(zerointerior) = -0; u(zerointerior) = max (-x.inf(zerointerior), x.sup(zerointerior)); x.inf = l; x.sup = u; endfunction %!# Empty interval %!assert (abs (infsup ()) == infsup ()); %!# Singleton intervals %!assert (abs (infsup (1)) == infsup (1)); %!assert (abs (infsup (0)) == infsup (0)); %!assert (abs (infsup (-1)) == infsup (1)); %!assert (abs (infsup (realmax)) == infsup (realmax)); %!assert (abs (infsup (realmin)) == infsup (realmin)); %!assert (abs (infsup (-realmin)) == infsup (realmin)); %!assert (abs (infsup (-realmax)) == infsup (realmax)); %!# Bounded intervals %!assert (abs (infsup (1, 2)) == infsup (1, 2)); %!assert (abs (infsup (0, 1)) == infsup (0, 1)); %!assert (abs (infsup (-1, 1)) == infsup (0, 1)); %!assert (abs (infsup (-1, 0)) == infsup (0, 1)); %!assert (abs (infsup (-2, -1)) == infsup (1, 2)); %!# Unbounded intervals %!assert (abs (infsup (0, inf)) == infsup (0, inf)); %!assert (abs (infsup (-inf, inf)) == infsup (0, inf)); %!assert (abs (infsup (-inf, 0)) == infsup (0, inf)); %!assert (abs (infsup (1, inf)) == infsup (1, inf)); %!assert (abs (infsup (-1, inf)) == infsup (0, inf)); %!assert (abs (infsup (-inf, -1)) == infsup (1, inf)); %!assert (abs (infsup (-inf, 1)) == infsup (0, inf)); %!# from the documentation string %!assert (abs (infsup (2.5, 3.5)) == infsup (2.5, 3.5)); %!assert (abs (infsup (-0.5, 5.5)) == infsup (0, 5.5)); %!# correct use of signed zeros %!assert (signbit (inf (abs (infsup (-1, 0))))); %!test %! x = abs (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/absrev.m0000644000000000000000000000631713031036767015522 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{X} =} absrev (@var{C}, @var{X}) ## @deftypemethodx {@@infsup} {@var{X} =} absrev (@var{C}) ## ## Compute the reverse absolute value function. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{abs (x) ∈ @var{C}}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## absrev (infsup (-2, 1)) ## @result{} ans = [-1, +1] ## @end group ## @end example ## @seealso{@@infsup/abs} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = absrev (c, x) if (nargin < 1 || nargin > 2) print_usage (); return endif if (not (isa (c, "infsup"))) c = infsup (c); endif if (nargin < 2) x = infsup (-inf, inf); elseif (not (isa (x, "infsup"))) x = infsup (x); endif ## Compute the pre-image of abs for positive and negative x separately. p = intersect (c, infsup (0, inf)); n = -p; result = union (intersect (p, x), intersect (n, x)); endfunction %!# Empty interval %!assert (absrev (infsup ()) == infsup ()); %!assert (absrev (infsup (0, 1), infsup ()) == infsup ()); %!assert (absrev (infsup (0, 1), infsup (7, 9)) == infsup ()); %!assert (absrev (infsup (), infsup (0, 1)) == infsup ()); %!assert (absrev (infsup (-2, -1)) == infsup ()); %!# Singleton intervals %!assert (absrev (infsup (1)) == infsup (-1, 1)); %!assert (absrev (infsup (0)) == infsup (0)); %!assert (absrev (infsup (-1)) == infsup ()); %!assert (absrev (infsup (realmax)) == infsup (-realmax, realmax)); %!assert (absrev (infsup (realmin)) == infsup (-realmin, realmin)); %!assert (absrev (infsup (-realmin)) == infsup ()); %!assert (absrev (infsup (-realmax)) == infsup ()); %!# Bound intervals %!assert (absrev (infsup (1, 2)) == infsup (-2, 2)); %!assert (absrev (infsup (1, 2), infsup (0, 2)) == infsup (1, 2)); %!assert (absrev (infsup (0, 1), infsup (-0.5, 2)) == infsup (-0.5, 1)); %!assert (absrev (infsup (-1, 1)) == infsup (-1, 1)); %!assert (absrev (infsup (-1, 0)) == infsup (0)); %!# Unbound intervals %!assert (absrev (infsup (0, inf)) == infsup (-inf, inf)); %!assert (absrev (infsup (-inf, inf)) == infsup (-inf, inf)); %!assert (absrev (infsup (-inf, 0)) == infsup (0)); %!assert (absrev (infsup (1, inf), infsup (-inf, 0)) == infsup (-inf, -1)); %!assert (absrev (infsup (-1, inf)) == infsup (-inf, inf)); %!assert (absrev (infsup (-inf, -1)) == infsup ()); %!assert (absrev (infsup (-inf, 1)) == infsup (-1, 1)); %!# from the documentation string %!assert (absrev (infsup (-2, 1)) == infsup (-1, 1)); interval-2.1.0/inst/@infsup/acos.m0000644000000000000000000000542613031036767015165 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} acos (@var{X}) ## ## Compute the inverse cosine in radians (arccosine). ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## acos (infsup (.5)) ## @result{} ans ⊂ [1.0471, 1.0472] ## @end group ## @end example ## @seealso{@@infsup/cos} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-06 function x = acos (x) if (nargin ~= 1) print_usage (); return endif persistent domain = infsup (-1, 1); x = intersect (x, domain); ## acos is monotonically decreasing from (-1, pi) to (+1, 0) if (__check_crlibm__ ()) l = crlibm_function ('acos', -inf, x.sup); u = crlibm_function ('acos', +inf, x.inf); else l = mpfr_function_d ('acos', -inf, x.sup); u = mpfr_function_d ('acos', +inf, x.inf); endif l(l == 0) = -0; emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; x.inf = l; x.sup = u; endfunction %!# Empty interval %!assert (acos (infsup ()) == infsup ()); %!# Singleton intervals %!assert (acos (infsup (-1)) == infsup ("pi")); %!assert (subset (acos (infsup (-.5)), union ((infsup ("pi") / 2), infsup ("pi")))); %!assert (acos (infsup (0)) == infsup ("pi") / 2); %!assert (subset (acos (infsup (.5)), union ((infsup ("pi") / 2), infsup (0)))); %!assert (acos (infsup (1)) == infsup (0)); %!# Bounded intervals %!assert (acos (infsup (-1, 0)) == union ((infsup ("pi") / 2), infsup ("pi"))); %!assert (acos (infsup (0, 1)) == union ((infsup ("pi") / 2), infsup (0))); %!assert (acos (infsup (-1, 1)) == infsup (0, "pi")); %!assert (acos (infsup (-2, 2)) == infsup (0, "pi")); %!# Unbounded intervals %!assert (acos (infsup (0, inf)) == union ((infsup ("pi") / 2), infsup (0))); %!assert (acos (infsup (-inf, 0)) == union ((infsup ("pi") / 2), infsup ("pi"))); %!assert (acos (infsup (-inf, inf)) == infsup (0, "pi")); %!# from the documentation string %!assert (acos (infsup (.5)) == "[0x1.0C152382D7365, 0x1.0C152382D7366]"); %!# correct use of signed zeros %!test %! x = acos (infsup (1)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/acosh.m0000644000000000000000000000457613031036767015342 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} acosh (@var{X}) ## ## Compute the inverse hyperbolic cosine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## acosh (infsup (2)) ## @result{} ans ⊂ [1.3169, 1.317] ## @end group ## @end example ## @seealso{@@infsup/cosh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-07 function x = acosh (x) if (nargin ~= 1) print_usage (); return endif persistent domain = infsup (1, inf); x = intersect (x, domain); ## acosh is monotonically increasing from (1, 0) to (inf, inf) l = mpfr_function_d ('acosh', -inf, x.inf); u = mpfr_function_d ('acosh', +inf, x.sup); l(l == 0) = -0; emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; x.inf = l; x.sup = u; endfunction %!# Empty interval %!assert (acosh (infsup ()) == infsup ()); %!# Singleton intervals %!assert (acosh (infsup (0)) == infsup ()); %!assert (acosh (infsup (1)) == infsup (0)); %!test %! x = infsup (1 : 3 : 100); %! assert (min (subset (acosh (x), log (x + sqrt (x + 1) .* sqrt (x - 1))))); %!# Bounded intervals %!assert (acosh (infsup (0, 1)) == infsup (0)); %!# Unbounded intervals %!assert (acosh (infsup (-inf, 0)) == infsup ()); %!assert (acosh (infsup (-inf, 1)) == infsup (0)); %!assert (acosh (infsup (0, inf)) == infsup (0, inf)); %!assert (acosh (infsup (1, inf)) == infsup (0, inf)); %!assert (subset (acosh (infsup (2, inf)), infsup (1, inf))); %!# from the documentation string %!assert (acosh (infsup (2)) == "[0x1.5124271980434, 0x1.5124271980435]"); %!# correct use of signed zeros %!test %! x = acosh (infsup (1)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/asin.m0000644000000000000000000000367613031036767015177 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} asin (@var{X}) ## ## Compute the inverse sine in radians (arcsine). ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## asin (infsup (.5)) ## @result{} ans ⊂ [0.52359, 0.5236] ## @end group ## @end example ## @seealso{@@infsup/sin} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-06 function x = asin (x) if (nargin ~= 1) print_usage (); return endif persistent domain = infsup (-1, 1); x = intersect (x, domain); ## asin is monotonically increasing from (-1, -pi/2) to (1, pi/2) if (__check_crlibm__ ()) l = crlibm_function ('asin', -inf, x.inf); u = crlibm_function ('asin', +inf, x.sup); else l = mpfr_function_d ('asin', -inf, x.inf); u = mpfr_function_d ('asin', +inf, x.sup); endif l(l == 0) = -0; emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; x.inf = l; x.sup = u; endfunction %!# Empty interval %!assert (asin (infsup ()) == infsup ()); %!# from the documentation string %!assert (asin (infsup (.5)) == "[0x1.0C152382D7365p-1, 0x1.0C152382D7366p-1]"); %!# correct use of signed zeros %!test %! x = asin (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/asinh.m0000644000000000000000000000316513031036767015340 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} asinh (@var{X}) ## ## Compute the inverse hyperbolic sine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## asinh (infsup (1)) ## @result{} ans ⊂ [0.88137, 0.88138] ## @end group ## @end example ## @seealso{@@infsup/sinh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-07 function x = asinh (x) if (nargin ~= 1) print_usage (); return endif ## asinh is monotonically increasing ## This also works for empty intervals! l = mpfr_function_d ('asinh', -inf, x.inf); u = mpfr_function_d ('asinh', +inf, x.sup); l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (asinh (infsup (1)) == "[0x1.C34366179D426p-1, 0x1.C34366179D427p-1]"); %!# correct use of signed zeros %!test %! x = asinh (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/atan.m0000644000000000000000000000345113031036767015157 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} atan (@var{X}) ## ## Compute the inverse tangent in radians. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## atan (infsup (1)) ## @result{} ans ⊂ [0.78539, 0.7854] ## @end group ## @end example ## @seealso{@@infsup/tan, @@infsup/atan2} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-06 function x = atan (x) if (nargin ~= 1) print_usage (); return endif ## atan is monotonically increasing if (__check_crlibm__ ()) l = crlibm_function ('atan', -inf, x.inf); u = crlibm_function ('atan', +inf, x.sup); else l = mpfr_function_d ('atan', -inf, x.inf); u = mpfr_function_d ('atan', +inf, x.sup); endif l(l == 0) = -0; emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (atan (infsup (1)) == "[0x1.921FB54442D18p-1, 0x1.921FB54442D19p-1]"); %!# correct use of signed zeros %!test %! x = atan (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/atan2.m0000644000000000000000000001055013031036767015237 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} atan2 (@var{Y}, @var{X}) ## ## Compute the inverse tangent with two arguments. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## atan2 (infsup (1), infsup (-1)) ## @result{} ans ⊂ [2.3561, 2.3562] ## @end group ## @end example ## @seealso{@@infsup/tan} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-06 function y = atan2 (y, x) if (nargin ~= 2) print_usage (); return endif if (not (isa (y, "infsup"))) y = infsup (y); endif if (not (isa (x, "infsup"))) x = infsup (x); endif ## Resize, if scalar × matrix if (not (size_equal (x.inf, y.inf))) x.inf = ones (size (y.inf)) .* x.inf; x.sup = ones (size (y.inf)) .* x.sup; y.inf = ones (size (x.inf)) .* y.inf; y.sup = ones (size (x.inf)) .* y.sup; endif ## Partitionize the function's domain ## y ## ^ ## p1 | p2 ## ------0------> ## p4 | p3 x ## persistent pos = infsup (0, inf); persistent neg = infsup (-inf, 0); x1 = x4 = intersect (x, neg); y1 = y2 = intersect (y, pos); x2 = x3 = intersect (x, pos); y3 = y4 = intersect (y, neg); ## Intersect each partition with atan2's domain p1 = not (isempty (x1) | isempty (y1)) & (x1.inf < 0 | y1.sup > 0); p2 = not (isempty (x2) | isempty (y2)) & (x2.sup > 0 | y2.sup > 0); p3 = not (isempty (x3) | isempty (y3)) & (x3.sup > 0 | y3.inf < 0); p4 = not (isempty (x4) | isempty (y4)) & (x4.inf < 0 | y4.inf < 0); ## Prevent wrong limit values of atan2 (0, 0) in cases with y = 0. select = (p1 & y1.sup == 0); x1.inf(select) = x1.sup(select) = -1; select = (p2 & y2.sup == 0); x2.inf(select) = x2.sup(select) = 1; select = (p3 & y3.inf == 0); x3.inf(select) = x3.sup(select) = 1; p4(y4.inf == 0) = false (); # don't consider y >= 0 in partition 4 ## Prevent wrong limit values of atan2 (0, 0) in cases with x = 0. select = (p1 & x1.inf == 0); y1.inf(select) = y1.sup(select) = 1; select = (p2 & x2.sup == 0); y2.inf(select) = y2.sup(select) = 1; y3.inf(p3 & x3.sup == 0) = y3.sup(p3 & x3.sup == 0) = -1; select = (p4 & x4.inf == 0); y4.inf(select) = y4.sup(select) = -1; ## Fix interval boundaries for y = 0 and x < 0, because atan2 (±0, -eps) = ±pi y1.inf(p1 & y1.inf == 0) = +0; y4.sup(p4 & y4.sup == 0) = -0; ## Compute lower boundary (atan2 is increasing from p4 to p1) l = inf (size (p1)); select = p4; l(select) = mpfr_function_d ('atan2', -inf, y4.sup(select), x4.inf(select)); select = p3 & not (p4); l(select) = mpfr_function_d ('atan2', -inf, y3.inf(select), x3.inf(select)); select = p2 & not (p3 | p4); l(select) = mpfr_function_d ('atan2', -inf, y2.inf(select), x2.sup(select)); select = p1 & not (p2 | p3 | p4); l(select) = mpfr_function_d ('atan2', -inf, y1.sup(select), x1.sup(select)); ## Compute upper boundary (atan2 is decreasing from p1 to p4) u = -inf (size (p1)); select = p1; u(select) = mpfr_function_d ('atan2', +inf, y1.inf(select), x1.inf(select)); select = p2 & not (p1); u(select) = mpfr_function_d ('atan2', +inf, y2.sup(select), x2.inf(select)); select = p3 & not (p1 | p2); u(select) = mpfr_function_d ('atan2', +inf, y3.sup(select), x3.sup(select)); select = p4 & not (p1 | p2 | p3); u(select) = mpfr_function_d ('atan2', +inf, y4.inf(select), x4.sup(select)); ## Now, we have computed l and u for all cases where p1 | p2 | p3 | p4. In all ## other cases, l and u will produce an empty interval. l(l == 0) = -0; y.inf = l; y.sup = u; endfunction %!test "from the documentation string"; %!assert (atan2 (infsup (1), infsup (-1)) == "[0x1.2D97C7F3321D2p1, 0x1.2D97C7F3321D3p1]"); %!# correct use of signed zeros %!test %! x = atan2 (0, infsup (1)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/atan2rev1.m0000644000000000000000000001530113031036767016034 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{Y} =} atan2rev1 (@var{B}, @var{C}, @var{Y}) ## @deftypemethodx {@@infsup} {@var{Y} =} atan2rev1 (@var{B}, @var{C}) ## ## Compute the reverse atan2 function for the first parameter. ## ## That is, an enclosure of all @code{y ∈ @var{Y}} where ## @code{atan2 (y, b) ∈ @var{C}} for any @code{b ∈ @var{B}}. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## atan2rev1 (infsup (1, 2), infsup ("pi") / 4) ## @result{} ans ⊂ [0.99999, 2.0001] ## @end group ## @end example ## @seealso{@@infsup/atan2} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = atan2rev1 (b, c, y) if (nargin < 2 || nargin > 3) print_usage (); return endif if (nargin < 3) y = infsup (-inf, inf); endif if (not (isa (b, "infsup"))) b = infsup (b); endif if (not (isa (c, "infsup"))) c = infsup (c); endif if (not (isa (y, "infsup"))) y = infsup (y); endif ## Resize, if scalar × matrix or vector × matrix or scalar × vector if (not (size_equal (b.inf, c.inf))) b.inf = ones (size (c.inf)) .* b.inf; b.sup = ones (size (c.inf)) .* b.sup; c.inf = ones (size (b.inf)) .* c.inf; c.sup = ones (size (b.inf)) .* c.sup; endif if (not (size_equal (b.inf, y.inf))) b.inf = ones (size (y.inf)) .* b.inf; b.sup = ones (size (y.inf)) .* b.sup; c.inf = ones (size (y.inf)) .* c.inf; c.sup = ones (size (y.inf)) .* c.sup; y.inf = ones (size (b.inf)) .* y.inf; y.sup = ones (size (b.inf)) .* y.sup; endif persistent pi = infsup ("pi"); idx.type = '()'; emptyresult = isempty (y) | isempty (b) | isempty (c) | ... c.inf >= sup (pi) | c.sup <= inf (-pi); result = repmat (infsup (), size (y.inf)); ## c1 is the part of c where y >= 0 and x <= 0 c1 = intersect (c, infsup (inf (pi) / 2, sup (pi))); select = not (emptyresult | isempty (c1) | ... b.inf > 0 | y.sup < 0 | c1.sup == inf (pi) / 2 | ... (b.inf >= 0 & y.sup <= 0) | (b.inf >= 0 & c1.inf > inf (pi) / 2)); if (any (select(:))) ## The inverse function is y = b * tan (c) ## minimum is located at b.sup, c.sup ## maximum is located at b.inf, c.inf l = zeros (size (result.inf)); select_l = select & c1.sup < sup (pi) & b.sup < 0; l (select_l) = ... max (0, ... inf (b.sup (select_l) .* tan (infsup (c1.sup (select_l))))); u = inf (size (result.inf)); select_u = select & c1.inf > inf (pi) / 2 & b.inf > -inf; u (select_u) = ... sup (b.inf (select_u) .* tan (infsup (c1.inf (select_u)))); idx.subs = {select}; result = subsasgn (result, idx, ... intersect (subsref (y, idx), ... infsup (subsref (l, idx), subsref (u, idx)))); endif ## c2 is the part of c where y >= 0 and x >= 0 c2 = intersect (c, infsup (0, sup (pi) / 2)); select = not (emptyresult | isempty (c2) | b.sup < 0 | y.sup < 0 | ... c2.inf == sup (pi) / 2 | ... (b.sup <= 0 & y.sup <= 0) | (b.sup <= 0 & c2.sup < sup (pi) / 2)); if (any (select(:))) ## The inverse function is y = b * tan (c) ## minimum is located at b.inf, c.inf ## maximum is located at b.sup, c.sup l = zeros (size (result.inf)); select_l = select & c2.inf > 0 & b.inf > 0; l (select_l) = ... max (0, ... inf (b.inf (select_l) .* tan (infsup (c2.inf (select_l))))); u = inf (size (result.inf)); u (c2.sup == 0) = 0; select_u = select & c2.sup ~= 0 & c2.sup < sup (pi) / 2 & b.sup < inf; u (select_u) = ... sup (b.sup (select_u) .* tan (infsup (c2.sup (select_u)))); idx.subs = {select}; result = subsasgn (result, idx, ... union (subsref (result, idx), ... intersect (subsref (y, idx), ... infsup (subsref (l, idx), subsref (u, idx))))); endif ## c3 is the part of c where y <= 0 and x >= 0 c3 = intersect (c, infsup (inf (-pi) / 2, 0)); select = not (emptyresult | isempty (c3) | b.sup < 0 | y.inf > 0 | ... c3.sup == inf (-pi) / 2 | (b.sup <= 0 & y.inf >= 0) | ... (b.sup <= 0 & c2.inf > inf (-pi) / 2)); if (any (select(:))) ## The inverse function is y = b * tan (c) ## minimum is located at b.sup, c.inf ## maximum is located at b.inf, c.sup l = -inf (size (result.inf)); l (c3.inf == 0) = 0; select_l = select & c3.inf ~= 0 & c3.inf > inf (-pi) / 2 & b.sup < inf; l (select_l) = ... inf (b.sup (select_l) .* tan (infsup (c3.inf (select_l)))); u = zeros (size (result.inf)); select_u = select & c3.sup ~= 0 & b.inf > 0; u (select_u) = ... sup (b.inf (select_u) .* tan (infsup (c3.sup (select_u)))); idx.subs = {select}; result = subsasgn (result, idx, ... union (subsref (result, idx), ... intersect (subsref (y, idx), ... infsup (subsref (l, idx), subsref (u, idx))))); endif ## c4 is the part of c where y <= 0 and x <= 0 c4 = intersect (c, infsup (inf (-pi), sup (-pi) / 2)); select = not (emptyresult | isempty (c4) | b.inf > 0 | y.inf > 0 | ... c4.inf == sup (-pi) / 2 | (b.inf >= 0 & y.inf >= 0) | ... (b.inf >= 0 & c4.sup < sup (-pi) / 2)); if (any (select(:))) ## The inverse function is y = b * tan (c) ## minimum is located at b.inf, c.sup ## maximum is located at b.sup, c.inf l = -inf (size (result.inf)); select_l = select & c4.sup < sup (-pi) / 2 & b.inf > -inf; l (select_l) = ... inf (b.inf (select_l) .* tan (infsup (c4.sup (select_l)))); u = zeros (size (result.inf)); select_u = select & c4.inf > inf (-pi) & b.sup < 0; u (select_u) = ... min (0, ... sup (b.sup (select_u) .* tan (infsup (c4.sup (select_u))))); idx.subs = {select}; result = subsasgn (result, idx, ... union (subsref (result, idx), ... intersect (subsref (y, idx), ... infsup (subsref (l, idx), subsref (u, idx))))); endif endfunction %!# from the documentation string %!assert (atan2rev1 (infsup (1, 2), infsup ("pi") / 4) == "[0x1.FFFFFFFFFFFFFp-1, 0x1.0000000000001p1]"); interval-2.1.0/inst/@infsup/atan2rev2.m0000644000000000000000000001522413031036767016041 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{X} =} atan2rev2 (@var{A}, @var{C}, @var{X}) ## @deftypemethodx {@@infsup} {@var{X} =} atan2rev2 (@var{A}, @var{C}) ## ## Compute the reverse atan2 function for the second parameter. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{atan2 (a, x) ∈ @var{C}} for any @code{a ∈ @var{A}}. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## atan2rev2 (infsup (1, 2), infsup ("pi") / 4) ## @result{} ans ⊂ [0.99999, 2.0001] ## @end group ## @end example ## @seealso{@@infsup/atan2} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = atan2rev2 (a, c, x) if (nargin < 2 || nargin > 3) print_usage (); return endif if (nargin < 3) x = infsup (-inf, inf); endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (c, "infsup"))) c = infsup (c); endif if (not (isa (x, "infsup"))) x = infsup (x); endif ## Resize, if scalar × matrix or vector × matrix or scalar × vector if (not (size_equal (a.inf, c.inf))) a.inf = ones (size (c.inf)) .* a.inf; a.sup = ones (size (c.inf)) .* a.sup; c.inf = ones (size (a.inf)) .* c.inf; c.sup = ones (size (a.inf)) .* c.sup; endif if (not (size_equal (a.inf, x.inf))) a.inf = ones (size (x.inf)) .* a.inf; a.sup = ones (size (x.inf)) .* a.sup; c.inf = ones (size (x.inf)) .* c.inf; c.sup = ones (size (x.inf)) .* c.sup; x.inf = ones (size (a.inf)) .* x.inf; x.sup = ones (size (a.inf)) .* x.sup; endif pi = infsup ("pi"); idx.type = '()'; emptyresult = isempty (x) | isempty (a) | isempty (c) | ... c.inf >= sup (pi) | c.sup <= inf (-pi); result = repmat (infsup (), size (x.inf)); ## c1 is the part of c where y >= 0 and x <= 0 c1 = intersect (c, infsup (inf (pi) / 2, sup (pi))); select = not (emptyresult | isempty (c1) | x.inf > 0 | a.sup < 0 | ... c1.sup == inf (pi) / 2 | ... (x.inf >= 0 & a.sup <= 0) | (a.sup <= 0 & c1.inf > inf (pi) / 2)); if (any (select(:))) ## The inverse function is x = a / tan (c) ## minimum is located at a.sup, c.sup ## maximum is located at a.inf, c.inf l = -inf (size (result.inf)); select_l = select & c1.sup < sup (pi) & a.sup < inf; l (select_l) = ... inf (a.sup (select_l) ./ tan (infsup (c1.sup (select_l)))); u = zeros (size (result.inf)); select_u = select & c1.inf > inf (pi) / 2 & a.inf > 0; u (select_u) = ... sup (a.inf (select_u) ./ tan (infsup (c1.inf (select_u)))); idx.subs = {select}; result = subsasgn (result, idx, ... intersect (subsref (x, idx), ... infsup (subsref (l, idx), subsref (u, idx)))); endif ## c2 is the part of c where y >= 0 and x >= 0 c2 = intersect (c, infsup (0, sup (pi) / 2)); select = not (emptyresult | isempty (c2) | x.sup < 0 | a.sup < 0 | ... c2.inf == sup (pi) / 2 | ... (x.sup <= 0 & a.sup <= 0) | (c2.sup <= 0 & a.inf > 0) | ... (a.sup <= 0 & c2.inf > 0)); if (any (select(:))) ## The inverse function is x = a / tan (c) ## minimum is located at a.inf, c.sup ## maximum is located at a.sup, c.inf l = zeros (size (result.inf)); select_l = select & c2.sup ~= 0 & c2.sup < sup (pi) / 2; l (select_l) = ... max (0, ... inf (a.inf (select_l) ./ tan (infsup (c2.sup (select_l))))); u = inf (size (result.inf)); select_u = select & c2.inf ~= 0 & c2.sup ~= 0 & a.sup < inf; u (select_u) = ... sup (a.sup (select_u) ./ tan (infsup (c2.inf (select_u)))); idx.subs = {select}; result = subsasgn (result, idx, ... union (subsref (result, idx), ... intersect (subsref (x, idx), ... infsup (subsref (l, idx), subsref (u, idx))))); endif ## c3 is the part of c where y <= 0 and x >= 0 c3 = intersect (c, infsup (inf (-pi) / 2, 0)); select = not (emptyresult | isempty (c3) | x.sup < 0 | a.inf > 0 | ... c3.sup == inf (-pi) / 2 | (x.sup <= 0 & a.inf >= 0) | ... (c3.inf >= 0 & a.sup < 0) | (a.inf >= 0 & c3.sup < 0)); if (any (select(:))) ## The inverse function is x = a / tan (c) ## minimum is located at a.sup, c.inf ## maximum is located at a.inf, c.sup l = zeros (size (result.inf)); select_l = select & c3.inf > inf (-pi) / 2 & c3.inf ~= 0; l (select_l) = ... max (0, ... inf (a.sup (select_l) ./ tan (infsup (c3.inf (select_l))))); u = inf (size (result.inf)); select_u = select & c3.inf ~= 0 & c3.sup ~= 0 & a.inf < inf; u (select_u) = ... sup (a.inf (select_u) ./ tan (infsup (c3.sup (select_u)))); idx.subs = {select}; result = subsasgn (result, idx, ... union (subsref (result, idx), ... intersect (subsref (x, idx), ... infsup (subsref (l, idx), subsref (u, idx))))); endif ## c4 is the part of c where y <= 0 and x <= 0 c4 = intersect (c, infsup (inf (-pi), sup (-pi) / 2)); select = not (emptyresult | isempty (c4) | x.inf > 0 | a.inf > 0 | ... c4.inf == sup (-pi) / 2 | (x.inf >= 0 & a.inf >= 0) | ... (a.inf >= 0 & c4.inf > inf (-pi))); if (any (select(:))) ## The inverse function is x = a / tan (c) ## minimum is located at a.inf, c.inf ## maximum is located at a.sup, c.sup l = -inf (size (result.inf)); select_l = select & c4.inf > inf (-pi) & a.inf > -inf; l (select_l) = ... inf (a.inf (select_l) ./ tan (infsup (c4.inf (select_l)))); u = zeros (size (result.inf)); select_u = select & c4.sup < sup (-pi) / 2 & a.sup < 0; u (select_u) = ... sup (a.sup (select_u) ./ tan (infsup (c4.sup (select_u)))); idx.subs = {select}; result = subsasgn (result, idx, ... union (subsref (result, idx), ... intersect (subsref (x, idx), ... infsup (subsref (l, idx), subsref (u, idx))))); endif endfunction %!# from the documentation string %!assert (atan2rev2 (infsup (1, 2), infsup ("pi") / 4) == "[0x1.FFFFFFFFFFFFEp-1, 0x1.0000000000001p1]"); interval-2.1.0/inst/@infsup/atanh.m0000644000000000000000000000337213031036767015331 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} atanh (@var{X}) ## ## Compute the inverse hyperbolic tangent. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## atanh (infsup (.5)) ## @result{} ans ⊂ [0.5493, 0.54931] ## @end group ## @end example ## @seealso{@@infsup/tanh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-07 function x = atanh (x) if (nargin ~= 1) print_usage (); return endif x = intersect (x, infsup (-1, 1)); ## atanh is monotonically increasing between (-1, -inf) and (1, inf) l = mpfr_function_d ('atanh', -inf, x.inf); u = mpfr_function_d ('atanh', +inf, x.sup); emptyresult = isempty (x) | x.sup <= -1 | x.inf >= 1; l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (atanh (infsup (.5)) == "[0x1.193EA7AAD030Ap-1, 0x1.193EA7AAD030Bp-1]"); %!# correct use of signed zeros %!test %! x = atanh (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/bisect.m0000644000000000000000000001025313031036767015503 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {[@var{A}, @var{B}] =} bisect (@var{X}) ## ## Bisect an interval into two intervals, which contain half the amount of ## binary64 numbers each. ## ## Instead of bisecting the values of numbers in the interval at ## @code{mid (@var{X})}, this function bisects a function that counts them. In ## a bisect method this eliminates exactly half of the solutions and avoids ## slow convergence speeds in extreme cases. ## ## If all numbers in interval @var{X} are of equal sign, the pivot element used ## for bisection is @code{pow2 (mid (log2 (abs (@var{X}))))}. If @var{X} is no ## empty interval, the intervals @var{A} and @var{B} are non-empty and satisfy ## @code{@var{A}.sup == @var{B}.inf}. ## ## @example ## @group ## [a, b] = bisect (infsup (2, 32)) ## @result{} ## a = [2, 8] ## b = [8, 32] ## @end group ## @end example ## @seealso{@@infsup/mince, @@infsup/nextout} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-05-25 function [a, b] = bisect (x) if (nargin > 1) print_usage (); return endif m = zeros (size (x.inf)); idx.type = '()'; positive = x.inf >= 0 & x.sup > 0; if (any (positive(:))) idx.subs = {positive}; bounded = intersect (infsup (pow2 (-1074), realmax), subsref (x, idx)); m(positive) = min (realmax, pow2 (mid (log2 (bounded)))); endif negative = x.inf < 0 & x.sup <= 0; if (any (negative(:))) idx.subs = {negative}; bounded = intersect (infsup (-realmax, -pow2 (-1074)), subsref (x, idx)); m(negative) = ... uminus (min (realmax, pow2 (mid (log2 (uminus (bounded)))))); endif both_signs = x.inf < 0 & x.sup > 0; both_signs_p = both_signs & x.sup > -x.inf; if (any (both_signs_p(:))) idx.subs = {both_signs_p}; bounded_n = intersect (infsup (-realmax, -pow2 (-1074)), subsref (x, idx)); bounded_p = intersect (infsup (pow2 (-1074), realmax), subsref (x, idx)); m(both_signs_p) = min (realmax, pow2 ( mid (log2 (bounded_p)) ... - mid (log2 (uminus (bounded_n))) ... - 1074)); endif both_signs_n = both_signs & x.sup < -x.inf; if (any (both_signs_n(:))) idx.subs = {both_signs_n}; bounded_n = intersect (infsup (-realmax, -pow2 (-1074)), subsref (x, idx)); bounded_p = intersect (infsup (pow2 (-1074), realmax), subsref (x, idx)); m(both_signs_n) = uminus (min (realmax, pow2 ( mid (log2 (uminus (bounded_n))) ... - mid (log2 (bounded_p)) ... - 1074))); endif m = min (max (m, x.inf), x.sup); a = b = x; m(isempty (x)) = -inf; a.sup = m; m(isempty (x)) = inf; m(m == 0) = -0; b.inf = m; endfunction %!test %! # from the documentation string %! [a, b] = bisect (infsup (2, 32)); %! assert (a == infsup (2, 8)); %! assert (b == infsup (8, 32)); %!test %! [a, b] = bisect (infsup (-inf, inf)); %! assert (a == infsup (-inf, 0)); %! assert (b == infsup (0, inf)); %!test %! [a, b] = bisect (infsup (0)); %! assert (a == 0); %! assert (b == 0); %!test %! [a, b] = bisect (infsup ()); %! assert (isempty (a)); %! assert (isempty (b)); %!test %! [a, b] = bisect (infsup (0, inf)); %! assert (a == infsup (0, pow2 (-25))); %! assert (b == infsup (pow2 (-25), inf)); %!test %! [a, b] = bisect (infsup (-inf, 0)); %! assert (a == infsup (-inf, -pow2 (-25))); %! assert (b == infsup (-pow2 (-25), 0)); %!# correct use of signed zeros %!test %! [a, b] = bisect (infsup (0)); %! assert (signbit (inf (a))); %! assert (signbit (inf (b))); %! assert (not (signbit (sup (a)))); %! assert (not (signbit (sup (b)))); interval-2.1.0/inst/@infsup/bitunpack.m0000644000000000000000000000460413031036767016215 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} bitunpack (@var{X}) ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## ## Encode bare interval @var{X} in interchange format. ## ## The result is a raw bit pattern of length 128 that derive from two binary64 ## numbers. Bits are in increasing order. Byte order depends on the system's ## endianness. First 8 bytes come from the lower interval boundary, last ## 8 bytes come from the upper interval boundary. ## ## The result is a row vector if @var{X} is a row vector; otherwise, it is a ## column vector. ## ## For all scalar intervals the following equation holds: ## @code{@var{X} == interval_bitpack (bitunpack (@var{X}))}. ## ## @seealso{interval_bitpack} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-12-23 function result = bitunpack (x) if (nargin ~= 1) print_usage (); return endif ## The exchange representation of [Empty] is (+inf, -inf). The exchange ## representation of [0, 0] is (-0, +0). Both is guaranteed by the infsup ## constructor. l = bitunpack (x.inf); u = bitunpack (x.sup); ## Initialize result vector result = zeros (1, length (l) + length (u), 'logical'); if (not (isrow (l))) result = result'; endif ## Merge 64 bit blocks from l and u (alternating) together into result. target = reshape (1 : length (result), 64, numel (x.inf) + numel (x.sup)); target(:, 2 : 2 : size (target, 2)) = []; result(target) = l; result(target + 64) = u; endfunction %!test; %! littleendian = bitunpack (uint16 (1))(1); %! b = zeros (1, 128); %! if (littleendian) %! b([52, 63, 117, 127]) = 1; %! else %! b([7, 12, 71, 77]) = 1; %! endif %! assert (bitunpack (infsup (3, 4)), logical (b)); interval-2.1.0/inst/@infsup/cancelminus.m0000644000000000000000000000517113031036767016536 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{Z} =} cancelminus (@var{X}, @var{Y}) ## ## Recover interval @var{Z} from intervals @var{X} and @var{Y}, given that one ## knows @var{X} was obtained as the sum @var{Y} + @var{Z}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## cancelminus (infsup (2, 3), infsup (1, 1.5)) ## @result{} ans = [1, 1.5] ## @end group ## @end example ## @seealso{@@infsup/cancelplus} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function x = cancelminus (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); endif l = mpfr_function_d ('minus', -inf, x.inf, y.inf); u = mpfr_function_d ('minus', +inf, x.sup, y.sup); wid_x1 = wid (intersect (x, infsup (-inf, 0))); wid_x2 = wid (intersect (x, infsup (0, inf))); wid_y1 = wid (intersect (y, infsup (-inf, 0))); wid_y2 = wid (intersect (y, infsup (0, inf))); [wid_x1, wid_x2] = deal (max (wid_x1, wid_x2), min (wid_x1, wid_x2)); [wid_y1, wid_y2] = deal (max (wid_y1, wid_y2), min (wid_y1, wid_y2)); entireresult = (isempty (y) & not (isempty (x))) | ... y.inf == -inf | y.sup == inf | ... x.inf == -inf | x.sup == inf | ... ## We have to check for wid (x) < wid (y), which is difficult ## for wid > realmax, because of overflow and ## for interior zero, because of rounding errors. (iscommoninterval (x) & iscommoninterval (y) & ... (wid_x1 - wid_y1) + (wid_x2 - wid_y2) < 0); l(entireresult) = -inf; u(entireresult) = inf; emptyresult = isempty (x) & not (entireresult); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (cancelminus (infsup (2, 3), infsup (1, 1.5)) == infsup (1, 1.5)); interval-2.1.0/inst/@infsup/cancelplus.m0000644000000000000000000000274713031036767016374 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{Z} =} cancelplus (@var{X}, @var{Y}) ## ## Recover interval @var{Z} from intervals @var{X} and @var{Y}, given that one ## knows @var{X} was obtained as the difference @var{Z} - @var{Y}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## cancelplus (infsup (2, 3), infsup (1, 1.5)) ## @result{} ans = [3.5, 4] ## @end group ## @end example ## @seealso{@@infsup/cancelminus} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = cancelplus (x, y) if (nargin ~= 2) print_usage (); return endif result = cancelminus (x, -y); endfunction %!# from the documentation string %!assert (cancelplus (infsup (2, 3), infsup (1, 1.5)) == infsup (3.5, 4)); interval-2.1.0/inst/@infsup/cat.m0000644000000000000000000000433713031036767015007 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} cat (@var{DIM}, @var{MATRIX1}, @var{MATRIX2}, @dots{}) ## ## Return the concatenation of interval matrices @var{MATRIX1}, @var{MATRIX2}, ## … along dimension @var{DIM}. ## ## Interval matrices support no more than 2 dimensions. ## ## @example ## @group ## cat (2, infsup (magic (3)), infsup (pascal (3))) ## @result{} 3×6 interval matrix ## ## [8] [1] [6] [1] [1] [1] ## [3] [5] [7] [1] [2] [3] ## [4] [9] [2] [1] [3] [6] ## @end group ## @end example ## @seealso{@@infsup/horzcat, @@infsup/vertcat} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-19 function result = cat (dim, varargin) if (isa (dim, "infsup")) print_usage (); return endif if (dim > 2) error ("interval:InvalidOperand", ... "cat: no more than 2 dimensions are supported"); endif ## Conversion of non-interval parameters to intervals interval_idx = cellfun ("isclass", varargin, "infsup"); to_convert_idx = not (interval_idx); varargin(to_convert_idx) = cellfun (@infsup, ... varargin(to_convert_idx), ... "UniformOutput", false); ## Stack intervals along dimension dim s = cellfun ("struct", varargin); # struct array result = infsup (); result.inf = cat (dim, s.inf); result.sup = cat (dim, s.sup); endfunction %!assert (size (cat (1, infsup ([]), infsup ([]))), [0 0]); %!assert (cat (1, infsup (1), infsup (2)) == infsup (cat (1, 1, 2))); %!assert (cat (2, infsup (1), infsup (2)) == infsup (cat (2, 1, 2))); interval-2.1.0/inst/@infsup/cbrt.m0000644000000000000000000000275213031036767015171 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} cbrt (@var{X}) ## ## Compute the cube root. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## cbrt (infsup (-27, 27)) ## @result{} ans = [-3, +3] ## @end group ## @end example ## @seealso{@@infsup/realsqrt, @@infsup/nthroot} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function x = cbrt (x) if (nargin ~= 1) print_usage (); return endif x.inf = mpfr_function_d ('cbrt', -inf, x.inf); x.sup = mpfr_function_d ('cbrt', +inf, x.sup); endfunction %!# from the documentation string %!assert (cbrt (infsup (-27, 27)) == infsup (-3, 3)); %!# correct use of signed zeros %!test %! x = cbrt (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/ceil.m0000644000000000000000000000526613031036767015156 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} ceil (@var{X}) ## ## Round each number in interval @var{X} towards +Inf. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## ceil (infsup (2.5, 3.5)) ## @result{} ans = [3, 4] ## ceil (infsup (-0.5, 5)) ## @result{} ans = [0, 5] ## @end group ## @end example ## @seealso{@@infsup/floor, @@infsup/round, @@infsup/roundb, @@infsup/fix} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = ceil (x) if (nargin ~= 1) print_usage (); return endif x.inf = ceil (x.inf); x.sup = ceil (x.sup); x.sup(x.sup == 0) = +0; endfunction %!# Empty interval %!assert (ceil (infsup ()) == infsup ()); %!# Singleton intervals %!assert (ceil (infsup (0)) == infsup (0)); %!assert (ceil (infsup (0.5)) == infsup (1)); %!assert (ceil (infsup (-0.5)) == infsup (0)); %!# Bounded intervals %!assert (ceil (infsup (-0.5, 0)) == infsup (0)); %!assert (ceil (infsup (0, 0.5)) == infsup (0, 1)); %!assert (ceil (infsup (0.25, 0.5)) == infsup (1)); %!assert (ceil (infsup (-1, 0)) == infsup (-1, 0)); %!assert (ceil (infsup (-1, 1)) == infsup (-1, 1)); %!assert (ceil (infsup (-realmin, realmin)) == infsup (0, 1)); %!assert (ceil (infsup (-realmax, realmax)) == infsup (-realmax, realmax)); %!# Unbounded intervals %!assert (ceil (infsup (-realmin, inf)) == infsup (0, inf)); %!assert (ceil (infsup (-realmax, inf)) == infsup (-realmax, inf)); %!assert (ceil (infsup (-inf, realmin)) == infsup (-inf, 1)); %!assert (ceil (infsup (-inf, realmax)) == infsup (-inf, realmax)); %!assert (ceil (infsup (-inf, inf)) == infsup (-inf, inf)); %!# from the documentation string %!assert (ceil (infsup (2.5, 3.5)) == infsup (3, 4)); %!assert (ceil (infsup (-.5, 5)) == infsup (0, 5)); %!# correct use of signed zeros %!test %! x = ceil (infsup (-0.5)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = ceil (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/chol.m0000644000000000000000000001223313031036767015157 0ustar 00000000000000## Copyright 2008 Jiří Rohn ## Copyright 2016 Oliver Heimlich ## ## This program is derived from verchol in VERSOFT, published on ## 2016-07-26, which is distributed under the terms of the Expat license, ## a.k.a. the MIT license. Original Author is Jiří Rohn. Migration to Octave ## code has been performed by Oliver Heimlich. ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{R} = } chol (@var{A}) ## @deftypemethodx {@@infsup} {[@var{R}, @var{P}] = } chol (@var{A}) ## @deftypemethodx {@@infsup} {[@var{R}, @dots{}] = } chol (@dots{}, "upper") ## @deftypemethodx {@@infsup} {[@var{L}, @dots{}] = } chol (@dots{}, "lower") ## Compute the Cholesky factor, @var{R}, of each symmetric positive definite ## matrix in @var{A}. ## ## The Cholsky factor is defined by ## @display ## @var{R}' * @var{R} = @var{A}. ## @end display ## ## @example ## @group ## chol (infsup (pascal (3))) ## @result{} ans = 3×3 interval matrix ## ## [1] [1] [1] ## [0] [1] [2] ## [0] [0] [1] ## ## @end group ## @end example ## ## Called using the @option{lower} flag, @command{chol} returns the lower ## triangular factorization such that ## @display ## @var{L} * @var{L}' = @var{A}. ## @end display ## ## @example ## @group ## chol (infsup (pascal (3)), "lower") ## @result{} ans = 3×3 interval matrix ## ## [1] [0] [0] ## [1] [1] [0] ## [1] [2] [1] ## ## @end group ## @end example ## ## Warning: Output data widths may grow rapidly with increasing dimensions. ## ## Called with one output argument this function fails if each symmetric matrix ## in @var{A} is guaranteed to be not positive definite. With two output ## arguments @var{P} flags whether each symmetric matrix was guaranteed to be ## not positive definite and the function does not fail. A positive value of ## @var{P} indicates that each symmetric matrix in A is guaranteed to be not ## positive definite. Otherwise @var{P} is zero. ## ## This function tries to guarantee that each symmetric matrix in @var{A} is ## positive definite. If that fails, a warning is triggered. ## ## @example ## @group ## A = infsup (pascal (3)); ## A(3, 3) = "[5, 6]"; ## chol (A) ## @print{} warning: chol: matrix is not guaranteed to be positive definite ## @result{} ans = 3×3 interval matrix ## ## [1] [1] [1] ## [0] [1] [2] ## [0] [0] [0, 1] ## ## @end group ## @end example ## ## @seealso{@@infsup/lu, @@infsup/qr} ## @end deftypemethod ## Author: Jiří Rohn ## Keywords: interval ## Created: 2008-02-02 function [fact, P] = chol (A, option) if (nargin > 2) print_usage (); return elseif (nargin < 2) option = "upper"; endif if (not (ischar (option) && any (strcmp (option, {"upper", "lower"})))) print_usage (); return endif [m, n] = size (A); if (m ~= n) error ("chol: matrix is not square"); endif ## Matrix is symmetric by definition, eliminate illegal values A = intersect (A, A'); P = 0; ## columnwise computation of L done in frame of A for k = 1 : n idx_diag = substruct ("()", {k, k}); ## row vector # enables vectorized computation el = subsref (A, substruct ("()", {k, 1 : k - 1})); ## first main formula (diagonal entry) alpha = subsref (A, idx_diag) - el * el'; if (inf (alpha) <= 0) if (sup (alpha) <= 0) ## each symmetric Ao in A verified not to be PD P = -alpha.sup; if (nargout < 2) error ("chol: matrix is not positive definite"); endif else ## continue only on PD values, but warn about it warning ("chol:PD", ... "chol: matrix is not guaranteed to be positive definite"); endif endif s = sqrt (alpha); A = subsasgn (A, idx_diag, s); ## second main formula (subdiagonal entries) idx_subdiag = substruct ("()", {k + 1 : n, k}); A = subsasgn (A, idx_subdiag, ... (subsref (A, idx_subdiag) - ... subsref (A, substruct ("()", {k + 1 : n, 1 : k - 1})) * ... el') ./ s); endfor ## verified Cholesky decomposition found L = tril (A); # lower triangular part extracted switch (option) case "lower" fact = L; case "upper" fact = L'; endswitch endfunction %!assert (chol (infsup (pascal (10))) == chol (pascal (10))); %!assert (chol (infsupdec (pascal (10))) == chol (pascal (10))); %!test %! A = infsup ([2, 1; 1, 1]); %! R = chol (A); %! assert (ismember ([sqrt(2), 1/sqrt(2); 0, 1/sqrt(2)], R)); %! assert (wid (R) < 1e-15); interval-2.1.0/inst/@infsup/columns.m0000644000000000000000000000243113031036767015711 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} columns (@var{A}) ## ## Return the number of columns of @var{A}. ## @seealso{@@infsup/numel, @@infsup/size, @@infsup/length, @@infsup/rows} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-29 function result = columns (a) if (nargin ~= 1) print_usage (); return endif result = columns (a.inf); endfunction %!assert (columns (infsup (zeros (3, 4))), 4); %!assert (columns (infsup (zeros (0, 4))), 4); %!assert (columns (infsup (zeros (3, 0))), 0); %!assert (columns (infsup (zeros (3, 1))), 1); interval-2.1.0/inst/@infsup/cos.m0000644000000000000000000000754413031036767015027 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} cos (@var{X}) ## ## Compute the cosine in radians. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## cos (infsup (1)) ## @result{} ans ⊂ [0.5403, 0.54031] ## @end group ## @end example ## @seealso{@@infsup/acos, @@infsup/sec, @@infsup/cosh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-05 function x = cos (x) if (nargin ~= 1) print_usage (); return endif l = u = sinsignl = sinsignu = zeros (size (x.inf)); ## Check, if wid (x) is certainly greater than 2*pi. This can save the ## computation if some cosine values. width = mpfr_function_d ('minus', -inf, x.sup, x.inf); persistent pi = infsup ("pi"); persistent twopi = 2 .* pi; certainlyfullperiod = width >= sup (twopi); l(certainlyfullperiod) = -1; u(certainlyfullperiod) = 1; possiblynotfullperiod = not (certainlyfullperiod); if (__check_crlibm__ ()) l(possiblynotfullperiod) = min (... crlibm_function ('cos', -inf, x.inf(possiblynotfullperiod)), ... crlibm_function ('cos', -inf, x.sup(possiblynotfullperiod))); u(possiblynotfullperiod) = max (... crlibm_function ('cos', inf, x.inf(possiblynotfullperiod)), ... crlibm_function ('cos', inf, x.sup(possiblynotfullperiod))); ## We use sign (-sin) to know the gradient at the boundaries. sinsignl(possiblynotfullperiod) = sign (... -crlibm_function ('sin', .5, x.inf(possiblynotfullperiod))); sinsignu(possiblynotfullperiod) = sign (... -crlibm_function ('sin', .5, x.sup(possiblynotfullperiod))); else l(possiblynotfullperiod) = min (... mpfr_function_d ('cos', -inf, x.inf(possiblynotfullperiod)), ... mpfr_function_d ('cos', -inf, x.sup(possiblynotfullperiod))); u(possiblynotfullperiod) = max (... mpfr_function_d ('cos', inf, x.inf(possiblynotfullperiod)), ... mpfr_function_d ('cos', inf, x.sup(possiblynotfullperiod))); ## We use sign (-sin) to know the gradient at the boundaries. sinsignl(possiblynotfullperiod) = sign (... -mpfr_function_d ('sin', .5, x.inf(possiblynotfullperiod))); sinsignu(possiblynotfullperiod) = sign (... -mpfr_function_d ('sin', .5, x.sup(possiblynotfullperiod))); endif ## In case of sign (-sin) == 0, we conservatively use sign (-sin) of nextout. sinsignl(sinsignl == 0) = (-1) .* sign (l(sinsignl == 0)); sinsignu(sinsignu == 0) = sign (u(sinsignu == 0)); containsinf = possiblynotfullperiod & ((sinsignl == -1 & sinsignu == 1) | ... (sinsignl == sinsignu & ... width >= sup (pi))) ... & ne (0, x); l(containsinf) = -1; containssup = possiblynotfullperiod & ((sinsignl == 1 & sinsignu == -1) | ... (sinsignl == sinsignu & ... width >= sup (pi))); u(containssup) = 1; emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (cos (infsup (1)) == "[0x1.14A280FB5068Bp-1, 0x1.14A280FB5068Cp-1]"); interval-2.1.0/inst/@infsup/cosh.m0000644000000000000000000000330713031036767015170 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} cosh (@var{X}) ## ## Compute the hyperbolic cosine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## cosh (infsup (1)) ## @result{} ans ⊂ [1.543, 1.5431] ## @end group ## @end example ## @seealso{@@infsup/acosh, @@infsup/sech, @@infsup/sinh, @@infsup/tanh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-07 function x = cosh (x) if (nargin ~= 1) print_usage (); return endif ## cosh is symmetric and has its global minimum located at (0, 1). if (__check_crlibm__ ()) l = crlibm_function ('cosh', -inf, mig (x)); u = crlibm_function ('cosh', +inf, mag (x)); else l = mpfr_function_d ('cosh', -inf, mig (x)); u = mpfr_function_d ('cosh', +inf, mag (x)); endif emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (cosh (infsup (1)) == "[0x1.8B07551D9F55, 0x1.8B07551D9F551]"); interval-2.1.0/inst/@infsup/coshrev.m0000644000000000000000000000326313031036767015706 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{X} =} coshrev (@var{C}, @var{X}) ## @deftypemethodx {@@infsup} {@var{X} =} coshrev (@var{C}) ## ## Compute the reverse hyperbolic cosine function. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{cosh (x) ∈ @var{C}}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## coshrev (infsup (-2, 1)) ## @result{} ans = [0] ## @end group ## @end example ## @seealso{@@infsup/cosh} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = coshrev (c, x) if (nargin > 2) print_usage (); return endif if (nargin < 2) x = infsup (-inf, inf); endif if (not (isa (c, "infsup"))) c = infsup (c); endif if (not (isa (x, "infsup"))) x = infsup (x); endif p = acosh (c); n = uminus (p); result = union (intersect (p, x), intersect (n, x)); endfunction %!# from the documentation string %!assert (coshrev (infsup (-2, 1)) == 0); interval-2.1.0/inst/@infsup/cosrev.m0000644000000000000000000001241113031036767015531 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{X} =} cosrev (@var{C}, @var{X}) ## @deftypemethodx {@@infsup} {@var{X} =} cosrev (@var{C}) ## ## Compute the reverse cosine function. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{cos (x) ∈ @var{C}}. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## cosrev (infsup (0), infsup (6, 9)) ## @result{} ans ⊂ [7.8539, 7.854] ## @end group ## @end example ## @seealso{@@infsup/cos} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = cosrev (c, x) if (nargin > 2) print_usage (); return endif if (nargin < 2) x = infsup (-inf, inf); endif if (not (isa (c, "infsup"))) c = infsup (c); endif if (not (isa (x, "infsup"))) x = infsup (x); endif arccosine = acos (c); result = x; ## Resize, if scalar × matrix if (not (size_equal (arccosine.inf, result.inf))) arccosine.inf = ones (size (result.inf)) .* arccosine.inf; arccosine.sup = ones (size (result.inf)) .* arccosine.sup; result.inf = ones (size (arccosine.inf)) .* result.inf; result.sup = ones (size (arccosine.inf)) .* result.sup; endif result.inf(isempty (arccosine)) = inf; result.sup(isempty (arccosine)) = -inf; idx.type = '()'; persistent pi = infsup ("pi"); select = not (isempty (result)) ... & not (subset (infsup (0, pi.sup), arccosine)); if (any (select(:))) ## Find a smaller upper bound for x, if the restriction from c allows it u = inf (size (result.inf)); select_u = select & result.sup < inf; ## Find n, such that result.sup is within a distance of pi/2 ## around (n + 1/2) * pi. n = result.sup; n(select_u) = floor (sup (n(select_u) ./ pi)); arccosineshifted = arccosine; idx.subs = {(select_u & rem (n, 2) == 0)}; arccosineshifted = subsasgn (arccosineshifted, idx, ... subsref (arccosine, idx) + subsref (n, idx) .* pi); idx.subs = {(select_u & rem (n, 2) ~= 0)}; arccosineshifted = subsasgn (arccosineshifted, idx, ... (infsup (subsref (n, idx)) + 1) .* pi - subsref (arccosine, idx)); overlapping = not (isempty (intersect (result, arccosineshifted))); u(select_u & overlapping) = ... min (result.sup(select_u & overlapping), ... arccosineshifted.sup(select_u & overlapping)); m = n; m(select_u & ~overlapping) = ... mpfr_function_d ('minus', +inf, m(select_u & ~overlapping), 1); idx.subs = {(select_u & ~overlapping & rem (n, 2) == 0)}; u(idx.subs {1}) = ... sup (subsref (n, idx) .* pi - subsref (arccosine, idx)); idx.subs = {(select_u & ~overlapping & rem (n, 2) ~= 0)}; u(idx.subs {1}) = ... sup (subsref (arccosine, idx) + subsref (m, idx) .* pi); ## Find a larger lower bound for x, if the restriction from c allows it l = -inf (size (result.inf)); select_l = select & result.inf > -inf; ## Find n, such that result.inf is within a distance of pi/2 ## around (n + 1/2) * pi. n = result.inf; n(select_l) = floor (inf (n(select_l) ./ pi)); arccosineshifted = arccosine; idx.subs = {(select_l & rem (n, 2) == 0)}; arccosineshifted = subsasgn (arccosineshifted, idx, ... subsref (arccosine, idx) + subsref (n, idx) .* pi); idx.subs = {(select_l & rem (n, 2) ~= 0)}; arccosineshifted = subsasgn (arccosineshifted, idx, ... (infsup (subsref (n, idx)) + 1) .* pi - subsref (arccosine, idx)); overlapping = not (isempty (intersect (result, arccosineshifted))); l(select_l & overlapping) = ... max (result.inf(select_l & overlapping), ... arccosineshifted.inf(select_l & overlapping)); m = n; m(select_l & ~overlapping) = ... mpfr_function_d ('plus', -inf, m(select_l & ~overlapping), 1); idx.subs = {(select_l & ~overlapping & rem (n, 2) == 0)}; l(idx.subs {1}) = ... inf ((infsup (subsref (m, idx)) + 1) .* pi - subsref (arccosine, idx)); idx.subs = {(select_l & ~overlapping & rem (n, 2) ~= 0)}; l(idx.subs {1}) = ... inf (subsref (arccosine, idx) + subsref (m, idx) .* pi); result.inf(select) = max (l(select), result.inf(select)); result.sup(select) = min (u(select), result.sup(select)); result.inf(result.inf > result.sup) = inf; result.sup(result.inf > result.sup) = -inf; endif endfunction %!# from the documentation string %!assert (cosrev (0, infsup (6, 9)) == "[0x1.F6A7A2955385Ep2, 0x1.F6A7A2955386p2]"); %!# correct use of signed zeros %!test %! x = cosrev (infsup (1), infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/cot.m0000644000000000000000000000435413031036767015024 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} cot (@var{X}) ## ## Compute the cotangent in radians, that is the reciprocal tangent. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## cot (infsup (1)) ## @result{} ans ⊂ [0.64209, 0.6421] ## @end group ## @end example ## @seealso{@@infsup/tan, @@infsup/csc, @@infsup/sec} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function x = cot (x) if (nargin ~= 1) print_usage (); return endif l = u = zeros (size (x)); ## Check, if wid (x) is certainly greater than pi. This may save computation of ## some cotangent values. width = mpfr_function_d ('minus', -inf, x.sup, x.inf); persistent pi = infsup ("pi"); certainlyfullperiod = width >= sup (pi); possiblynotfullperiod = not (certainlyfullperiod); l(possiblynotfullperiod) = ... mpfr_function_d ('cot', -inf, x.sup(possiblynotfullperiod)); u(possiblynotfullperiod) = ... mpfr_function_d ('cot', +inf, x.inf(possiblynotfullperiod)); l(x.sup == 0) = -inf; u(x.inf == 0) = +inf; singularity = certainlyfullperiod | ... l > u | (... width > 2 & (... sign (l) == sign (u) | ... max (abs (l), abs (u)) < 1)); l(singularity) = -inf; u(singularity) = inf; emptyresult = isempty (x) | (x.inf == 0 & x.sup == 0); l(emptyresult) = inf; u(emptyresult) = -inf; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (cot (infsup (1)) == "[0x1.48C05D04E1CFDp-1, 0x1.48C05D04E1CFEp-1]"); interval-2.1.0/inst/@infsup/coth.m0000644000000000000000000000353413031036767015173 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} coth (@var{X}) ## ## Compute the hyperbolic cotangent, that is the reciprocal hyperbolic tangent. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## coth (infsup (1)) ## @result{} ans ⊂ [1.313, 1.3131] ## @end group ## @end example ## @seealso{@@infsup/tanh, @@infsup/csch, @@infsup/sech} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function x = coth (x) if (nargin ~= 1) print_usage (); return endif l = u = zeros (size (x.inf)); select = x.inf >= 0 | x.sup <= 0; if (any (select(:))) l(select) = mpfr_function_d ('coth', -inf, x.sup(select)); l(select & x.sup == 0) = -inf; u(select) = mpfr_function_d ('coth', +inf, x.inf(select)); u(select & x.inf == 0) = inf; endif select = x.inf < 0 & x.sup > 0; if (any (select(:))) l(select) = -inf; u(select) = inf; endif emptyresult = isempty (x) | (x.inf == 0 & x.sup == 0); l(emptyresult) = inf; u(emptyresult) = -inf; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (coth (infsup (1)) == "[0x1.50231499B6B1D, 0x1.50231499B6B1E]"); interval-2.1.0/inst/@infsup/csc.m0000644000000000000000000000550513031036767015006 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} csc (@var{X}) ## ## Compute the cosecant in radians, that is the reciprocal sine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## csc (infsup (1)) ## @result{} ans ⊂ [1.1883, 1.1884] ## @end group ## @end example ## @seealso{@@infsup/sin, @@infsup/sec, @@infsup/cot} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function x = csc (x) if (nargin ~= 1) print_usage (); return endif l = u = derivl = derivu = zeros (size (x.inf)); ## Check, if wid (x) is certainly greater than 2*pi. This can save the ## computation if some values. width = mpfr_function_d ('minus', -inf, x.sup, x.inf); persistent pi = infsup ("pi"); certainlysingularity = width >= sup (pi); ## We simply compute the cosecant for both endpoints. x.inf(x.inf == 0) = +0; x.sup(x.sup == 0) = -0; select = not (certainlysingularity); l(select) = min (... mpfr_function_d ('csc', -inf, x.inf(select)), ... mpfr_function_d ('csc', -inf, x.sup(select))); u(select) = max (... mpfr_function_d ('csc', inf, x.inf(select)), ... mpfr_function_d ('csc', inf, x.sup(select))); ## A change of sign is a sufficient singularity indicator certainlysingularity = certainlysingularity | (select & sign (l) ~= sign (u)); l(certainlysingularity) = -inf; u(certainlysingularity) = inf; ## Check, whether the interval contains a local extremum using the derivative select = not (certainlysingularity); derivl(select) = -mpfr_function_d ('csc', 0, x.inf(select)) .* ... mpfr_function_d ('cot', 0, x.inf(select)); derivu(select) = -mpfr_function_d ('csc', 0, x.sup(select)) .* ... mpfr_function_d ('cot', 0, x.sup(select)); hasextremum = select & ((derivl <= 0 & derivu >= 0) | ... (derivl >= 0 & derivu <= 0)); l(hasextremum & l > 0) = 1; u(hasextremum & u < 0) = -1; emptyresult = isempty (x) | (x.inf == 0 & x.sup == 0); l(emptyresult) = inf; u(emptyresult) = -inf; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (csc (infsup (1)) == "[0x1.303AA9620B223, 0x1.303AA9620B224]"); interval-2.1.0/inst/@infsup/csch.m0000644000000000000000000000377413031036767015164 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} csch (@var{X}) ## ## Compute the hyperbolic cosecant, that is the reciprocal hyperbolic sine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## csch (infsup (1)) ## @result{} ans ⊂ [0.85091, 0.85092] ## @end group ## @end example ## @seealso{@@infsup/sinh, @@infsup/sech, @@infsup/coth} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function x = csch (x) if (nargin ~= 1) print_usage (); return endif l = u = zeros (size (x.inf)); select = x.inf >= 0 | x.sup <= 0; if (any (select(:))) l(select) = mpfr_function_d ('csch', -inf, x.sup(select)); l(select & x.sup == 0) = -inf; u(select) = mpfr_function_d ('csch', +inf, x.inf(select)); u(select & x.inf == 0) = inf; endif select = x.inf < 0 & x.sup > 0; if (any (select(:))) l(select) = -inf; u(select) = inf; endif emptyresult = isempty (x) | (x.inf == 0 & x.sup == 0); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (csch (infsup (1)) == "[0x1.B3AB8A78B90Cp-1, 0x1.B3AB8A78B90C1p-1]"); %!# correct use of signed zeros %!test %! x = csch (infsup (0, inf)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/ctranspose.m0000644000000000000000000000243613031036767016417 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} ctranspose (@var{X}) ## @defopx Operator {@@infsup} {@var{X}'} ## ## Return the complex conjugate transpose of @var{X}. ## ## Since intervals are only defined for real numbers, this function and ## @code{transpose} are equivalent. ## ## @seealso{@@infsup/transpose} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-29 function result = ctranspose (x) if (nargin ~= 1) print_usage (); return endif result = transpose (x); endfunction %!assert (ctranspose (infsup (magic (3))) == infsup (magic (3)')); interval-2.1.0/inst/@infsup/det.m0000644000000000000000000000474413031036767015016 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} det (@var{A}) ## ## Compute the determinant of matrix @var{A}. ## ## The determinant for matrices of size 3×3 or greater is computed via L-U ## decomposition and may be affected by overestimation due to the dependency ## problem. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## det (infsup (magic (3))) ## @result{} ans = [-360] ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-10-23 function result = det (x) if (nargin ~= 1) print_usage (); return endif if (not (issquare (x.inf))) error ("det: argument must be a square matrix"); endif if (any (isempty (x)(:))) result = infsup (); return endif switch (rows (x.inf)) case 0 result = infsup (1); return case 1 result = x; return case 2 ## det ([1, 3; 2, 4]) = 4*1 - 3*2 ## The result will be tightest. result = mtimes (infsup ([x.inf(4), -x.sup(3)], ... [x.sup(4), -x.inf(3)]), ... infsup (x.inf(:, 1), x.sup(:, 1))); return endswitch zero = x.inf == 0 & x.sup == 0; if (any (all (zero, 1)) || any (all (zero, 2))) ## One column or row being zero result = infsup (0); return endif ## P * x = L * U, with ## det (P) = ±1 and det (L) = 1 and det (U) = prod (diag (U)) ## ## => det (x) = det (P) * det (U) [~, U, P] = lu (x); result = times (det (P), prod (diag (U))); ## Integer matrix, determinant must be integral if (all (all (fix (x.inf) == x.inf & fix (x.sup) == x.sup))) result.inf = ceil (result.inf); result.sup = floor (result.sup); endif endfunction %!# from the documentation string %!assert (det (infsup (magic (3))) == -360); interval-2.1.0/inst/@infsup/diag.m0000644000000000000000000000441513031036767015141 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {M =} diag (@var{V}) ## @deftypemethodx {@@infsup} {V =} diag (@var{M}) ## @deftypemethodx {@@infsup} {M =} diag (@var{V}, @var{K}) ## @deftypemethodx {@@infsup} {M =} diag (@var{V}, @var{M}, @var{N}) ## @deftypemethodx {@@infsup} {V =} diag (@var{M}, @var{K}) ## ## Create a diagonal matrix @var{M} with vector @var{V} on diagonal @var{K} or ## extract a vector @var{V} from the @var{K}-th diagonal of matrix @var{M}. ## ## With three arguments, create a matrix of size @var{M}×@var{N}. ## ## @example ## @group ## diag (infsup (1 : 3)) ## @result{} ans = 3×3 interval matrix ## ## [1] [0] [0] ## [0] [2] [0] ## [0] [0] [3] ## @end group ## @end example ## @seealso{@@infsup/tril, @@infsup/triu} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-10-23 function x = diag (x, varargin) if (nargin >= 2 && isa (m, 'infsup')) error ('diag: invalid second argument; it must not be an interval'); endif if (nargin >= 3 && isa (n, 'infsup')) error ('diag: invalid third argument; it must not be an interval'); endif if (nargin > 3) print_usage (); return endif l = diag (x.inf, varargin{:}); u = diag (x.sup, varargin{:}); l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!assert (diag (infsup (-inf, inf)) == "[Entire]"); %!assert (diag (infsup ()) == "[Empty]"); %!assert (numel (diag (infsup ([]))), 0); %!assert (isequal (diag (infsup (magic (3))), infsup ([8; 5; 2]))); %!assert (isequal (diag (infsup ([8 5 3])), infsup ([8 0 0; 0 5 0; 0 0 3]))); interval-2.1.0/inst/@infsup/dilog.m0000644000000000000000000000440213031036767015327 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} dilog (@var{X}) ## ## Compute the real part of the dilogarithm function. ## ## @tex ## $$ ## {\rm dilog} (x) = -\Re \int_0^x {{\log (1-t)} \over t} dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## x ## / log (1 - t) ## dilog (x) = - Re | ------------- dt ## / t ## 0 ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## dilog (infsup (1)) ## @result{} ans ⊂ [1.6449, 1.645] ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-29 function x = dilog (x) if (nargin ~= 1) print_usage (); return endif l = inf (size (x.inf)); u = -l; ## Monotonically increasing for x1 x1 = intersect (x, infsup (-inf, 2)); select = not (isempty (x1)); if (any (select(:))) l(select) = mpfr_function_d ('dilog', -inf, x1.inf(select)); u(select) = mpfr_function_d ('dilog', +inf, x1.sup(select)); endif ## Monotonically decreasing for x2 x2 = intersect (x, infsup (2, inf)); select = not (isempty (x2)); if (any (select(:))) l(select) = min (l(select), ... mpfr_function_d ('dilog', -inf, x2.sup(select))); u(select) = mpfr_function_d ('dilog', +inf, x2.inf(select)); endif x.inf = l; x.sup = u; endfunction %!assert (dilog (infsup (-inf, inf)) == "[-Inf, +0x1.3BD3CC9BE45DFp1]"); %!# from the documentation string %!assert (dilog (infsup (1)) == "[0x1.A51A6625307D3, 0x1.A51A6625307D4]"); interval-2.1.0/inst/@infsup/disjoint.m0000644000000000000000000000314413031036767016056 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} disjoint (@var{A}, @var{B}) ## ## Evaluate disjoint comparison on intervals. ## ## True, if all numbers from @var{A} are not contained in @var{B} and vice ## versa. False, if @var{A} and @var{B} have at least one element in common. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsup/eq, @@infsup/subset, @@infsup/interior} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function result = disjoint (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (b, "infsup"))) b = infsup (b); endif result = (a.sup < b.inf | b.sup < a.inf); result(isempty (a) | isempty (b)) = true; endfunction %!assert (disjoint (infsup (3, 4), infsup (5, 6))); %!assert (not (disjoint (infsup (3, 4), infsup (4, 5)))); interval-2.1.0/inst/@infsup/disp.m0000644000000000000000000001030413031036767015166 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} disp (@var{X}) ## ## Display the value of interval @var{X}. ## ## Interval boundaries are approximated with faithful decimal numbers. ## ## Interval matrices with many rows are wrapped according to the terminal ## width. @code{disp} prints nothing when @var{X} is an interval matrix ## without elements. ## ## Note that the output from @code{disp} always ends with a newline. ## ## If an output value is requested, @code{disp} prints nothing and returns the ## formatted output in a string. ## ## @example ## @group ## format long ## disp (infsupdec ("pi")) ## @result{} [3.14159265358979, 3.1415926535898]_com ## format short ## disp (infsupdec ("pi")) ## @result{} [3.1415, 3.1416]_com ## disp (infsupdec (1 : 5)) ## @result{} [1]_com [2]_com [3]_com [4]_com [5]_com ## s = disp (infsupdec (0)) ## @result{} s = [0]_com ## @end group ## @end example ## @seealso{@@infsup/display, @@infsup/intervaltotext} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-30 function varargout = disp (x) if (nargin ~= 1) print_usage (); return endif ## With format="auto" the output precision can be set with the format command [s, isexact] = intervaltotext (x, "auto"); if (not (iscell (s))) ## Scalar interval if (nargout == 0) disp (s); else varargout{1} = cstrcat (s, "\n"); varargout{2} = isexact; endif return endif ## Interval matrix / vector columnwidth = max (cellfun ("length", s), [], 1); columnwidth += 3; # add 3 spaces between columns ## Print all columns buffer = ""; if (rows (x.inf) > 0) ## FIXME: See display.m for how current_print_indent_level is used global current_print_indent_level; maxwidth = terminal_size ()(2) - current_print_indent_level; cstart = uint32 (1); cend = cstart - 1; while (cstart <= columns (x.inf)) ## Determine number of columns to print, print at least one column usedwidth = 0; submatrix = ""; do cend ++; submatrix = strcat (submatrix, ... prepad (strjust (char (s(:, cend))), columnwidth(cend), " ", 2)); usedwidth += columnwidth(cend); until (cend == columns (x.inf) || ... (split_long_rows () && ... usedwidth + columnwidth(cend + 1) > maxwidth)) if (cstart > 1 || cend < columns (x.inf)) if (cstart > 1) buffer = cstrcat (buffer, "\n"); endif if (cend > cstart) buffer = cstrcat (buffer, ... sprintf(" Columns %d through %d:\n\n", ... cstart, cend)); ... else buffer = cstrcat (buffer, ... sprintf(" Column %d:\n\n", cstart)); endif endif ## Convert string matrix into string with newlines buffer = cstrcat (buffer, strjoin (cellstr (submatrix), "\n"), "\n"); if (nargout == 0) printf (buffer); buffer = ""; endif cstart = cend + 1; endwhile endif if (nargout > 0) varargout{1} = buffer; varargout{2} = isexact; endif endfunction %!assert (disp (infsup([])), ""); %!assert (disp (infsup(0)), "[0]\n"); %!assert (disp (infsup(0, 1)), "[0, 1]\n"); %!assert (disp (infsup([0 0])), " [0] [0]\n"); %!assert (disp (infsup([0 0; 0 0])), " [0] [0]\n [0] [0]\n"); %!assert (disp (infsup([0; 0])), " [0]\n [0]\n"); interval-2.1.0/inst/@infsup/display.m0000644000000000000000000001013113031036767015672 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} display (@var{X}) ## ## Display the variable name and value of interval @var{X}. ## ## Interval boundaries are approximated with faithful decimal numbers. ## ## If @var{X} is a variable, the interval is display together with its variable ## name. The variable name is followed by an equality sign if all decimal ## boundaries exactly represent the actual boundaries. Otherwise a subset ## symbol is used instead (this feature is not available on Microsoft Windows). ## ## For non-scalar intervals the size and classification (interval vector or ## interval matrix) is displayed before the content. ## ## @example ## @group ## display (infsupdec (2)); ## @result{} [2]_com ## @end group ## @end example ## @example ## @group ## x = infsupdec (2); display (x); ## @result{} x = [2]_com ## @end group ## @end example ## @example ## @group ## y = infsupdec (eps); display (y); ## @result{} y ⊂ [2.2204e-16, 2.2205e-16]_com ## @end group ## @end example ## @example ## @group ## z = infsupdec (pascal (2)); display (z); ## @result{} z = 2×2 interval matrix ## [1]_com [1]_com ## [1]_com [2]_com ## @end group ## @end example ## @seealso{@@infsup/disp, @@infsup/intervaltotext} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-28 function display (x) if (nargin ~= 1) print_usage (); return endif global current_print_indent_level; save_current_print_indent_level = current_print_indent_level; unwind_protect label = inputname (1); if (isempty (label) && regexp(argn, '^\[\d+,\d+\]$')) ## During output of cell array contents label = argn; ## FIXME: Need access to octave_value::current_print_indent_level ## for correctly formatted nested cell array output current_print_indent_level = 2; else current_print_indent_level = 0; endif line_prefix = " "(ones (1, current_print_indent_level)); [s, isexact] = disp (x); printf (line_prefix); if (not (isempty (label))) printf (label); if (isexact || ispc ()) printf (" = "); else ## The Microsoft Windows console does not support this multibyte ## character. printf (" ⊂ "); endif endif if (isscalar (x)) ## Scalar interval printf (s); if (isempty (label)) printf ("\n"); endif return endif if (ispc ()) printf ("%dx%d interval ", size (x, 1), size (x, 2)); else ## The Microsoft Windows console does not support multibyte characters. printf ("%d×%d interval ", size (x, 1), size (x, 2)); endif if (isvector (x)) printf ("vector"); else printf ("matrix"); endif printf ("\n\n"); if (not (isempty (s))) printf (line_prefix); if (current_print_indent_level > 0) s = strrep (s, "\n", cstrcat ("\n", line_prefix)); s(end - current_print_indent_level + 1 : end) = ""; endif printf (s); printf ("\n"); endif unwind_protect_cleanup current_print_indent_level = save_current_print_indent_level; end_unwind_protect endfunction %!# Can't test the display function. Would have to capture console output. %!# However, this is largely done with the help of the doctest package. %!assert (1); interval-2.1.0/inst/@infsup/dot.m0000644000000000000000000001212513031036767015020 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} dot (@var{X}, @var{Y}) ## @defmethodx {@@infsup} dot (@var{X}, @var{Y}, @var{DIM}) ## ## Compute the dot product of two interval vectors. ## ## If @var{X} and @var{Y} are matrices, calculate the dot products along the ## first non-singleton dimension. If the optional argument @var{DIM} is given, ## calculate the dot products along this dimension. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## dot ([infsup(1), 2, 3], [infsup(2), 3, 4]) ## @result{} ans = [20] ## @end group ## @group ## dot (infsup ([realmax; realmin; realmax]), [1; -1; -1], 1) ## @result{} ans ⊂ [-2.2251e-308, -2.225e-308] ## @end group ## @end example ## @seealso{@@infsup/plus, @@infsup/sum, @@infsup/times, @@infsup/sumabs, @@infsup/sumsq} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-26 function x = dot (x, y, dim) if (nargin < 2 || nargin > 3) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); endif if (nargin < 3) if (isvector (x.inf) && isvector (y.inf)) ## Align vectors along common dimension dim = 1; x.inf = vec (x.inf, dim); x.sup = vec (x.sup, dim); y.inf = vec (y.inf, dim); y.sup = vec (y.sup, dim); else ## Try to find non-singleton dimension dim = find (any (size (x.inf), size (y.inf)) > 1, 1); if (isempty (dim)) dim = 1; endif endif endif ## null matrix input -> null matrix output if (isempty (x.inf) || isempty (y.inf)) x = infsup (zeros (min (size (x.inf), size (y.inf)))); return endif ## Only the sizes of non-singleton dimensions must agree. Singleton dimensions ## do broadcast (independent of parameter dim). if ((min (size (x.inf, 1), size (y.inf, 1)) > 1 && ... size (x.inf, 1) ~= size (y.inf, 1)) || ... (min (size (x.inf, 2), size (y.inf, 2)) > 1 && ... size (x.inf, 2) ~= size (y.inf, 2))) error ("interval:InvalidOperand", "dot: sizes of X and Y must match") endif resultsize = max (size (x.inf), size (y.inf)); resultsize(dim) = 1; l = u = zeros (resultsize); for n = 1 : numel (l) idx.type = "()"; idx.subs = cell (1, 2); idx.subs{dim} = ":"; idx.subs{3 - dim} = n; ## Select current vector in matrix or broadcast scalars and vectors. if (size (x.inf, 3 - dim) == 1) vector.x = x; else vector.x = subsref (x, idx); endif if (size (y.inf, 3 - dim) == 1) vector.y = y; else vector.y = subsref (y, idx); endif [l(n), u(n)] = vectordot (vector.x, vector.y); endfor l(l == 0) = -0; x.inf = l; x.sup = u; endfunction ## Dot product of two interval vectors; or one vector and one scalar. ## Accuracy is tightest. function [l, u] = vectordot (x, y) if (isscalar (x.inf) && isscalar (y.inf)) ## Short-circuit: scalar × scalar z = x .* y; l = z.inf; u = z.sup; return endif [l, u] = mpfr_vector_dot_d (x.inf, y.inf, x.sup, y.sup); endfunction %!# matrix × matrix %!assert (dot (infsup (magic (3)), magic (3)) == [89, 107, 89]); %!assert (dot (infsup (magic (3)), magic (3), 1) == [89, 107, 89]); %!assert (dot (infsup (magic (3)), magic (3), 2) == [101; 83; 101]); %!# matrix × vector %!assert (dot (infsup (magic (3)), [1, 2, 3]) == [15, 30, 45]); %!assert (dot (infsup (magic (3)), [1, 2, 3], 1) == [15, 30, 45]); %!assert (dot (infsup (magic (3)), [1, 2, 3], 2) == [28; 34; 28]); %!assert (dot (infsup (magic (3)), [1; 2; 3]) == [26, 38, 26]); %!assert (dot (infsup (magic (3)), [1; 2; 3], 1) == [26, 38, 26]); %!assert (dot (infsup (magic (3)), [1; 2; 3], 2) == [15; 30; 45]); %!# matrix × scalar %!assert (dot (infsup (magic (3)), 42) == [630, 630, 630]); %!assert (dot (infsup (magic (3)), 42, 1) == [630, 630, 630]); %!assert (dot (infsup (magic (3)), 42, 2) == [630; 630; 630]); %!# vector × scalar %!assert (dot (infsup ([1, 2, 3]), 42) == 252); %!assert (dot (infsup ([1, 2, 3]), 42, 1) == [42, 84, 126]); %!assert (dot (infsup ([1, 2, 3]), 42, 2) == 252); %!assert (dot (infsup ([1; 2; 3]), 42) == 252); %!assert (dot (infsup ([1; 2; 3]), 42, 1) == 252); %!assert (dot (infsup ([1; 2; 3]), 42, 2) == [42; 84; 126]); %!# from the documentation string %!assert (dot ([infsup(1), 2, 3], [infsup(2), 3, 4]) == 20); %!assert (dot (infsup ([realmax; realmin; realmax]), [1; -1; -1], 1) == -realmin); interval-2.1.0/inst/@infsup/ei.m0000644000000000000000000000366113031036767014634 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} ei (@var{X}) ## ## Compute the exponential integral for positive arguments. ## ## @tex ## $$ ## {\rm ei} (x) = \int_{-\infty}^x {{\exp t} \over t} dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## x ## / exp (t) ## ei (x) = | --------- dt ## / t ## -∞ ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## ei (infsup (1)) ## @result{} ans ⊂ [1.8951, 1.8952] ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-29 function x = ei (x) if (nargin ~= 1) print_usage (); return endif l = inf (size (x.inf)); u = -l; ## ei is monotonically increasing and defined for x > 0 defined = x.sup > 0; l(defined) = mpfr_function_d ('ei', -inf, max (0, x.inf(defined))); u(defined) = mpfr_function_d ('ei', +inf, x.sup(defined)); l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!assert (isempty (ei (infsup (0)))); %!assert (isempty (ei (infsup (-inf, -2)))); %!assert (isentire (ei (infsup (0, inf)))); %!# from the documentation string %!assert (ei (infsup (1)) == "[0x1.E52670F350D08, 0x1.E52670F350D09]"); interval-2.1.0/inst/@infsup/eq.m0000644000000000000000000000524013031036767014637 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} eq (@var{A}, @var{B}) ## @defopx Operator {@@infsup} {@var{A} == @var{B}} ## ## Compare intervals @var{A} and @var{B} for equality. ## ## True, if all numbers from @var{A} are also contained in @var{B} and vice ## versa. False, if @var{A} contains a number which is not a member in @var{B} ## or vice versa. ## ## @example ## @group ## x = infsup (2, 3); ## y = infsup (1, 2); ## x == y ## @result{} ans = 0 ## @end group ## @end example ## @seealso{@@infsup/subset, @@infsup/interior, @@infsup/disjoint} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function result = eq (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (b, "infsup"))) b = infsup (b); elseif (isa (b, "infsupdec")) ## Workaround for bug #42735 result = eq (a, b); return endif result = (a.inf == b.inf & a.sup == b.sup); endfunction %!test "Empty interval"; %! assert (eq (infsup (), infsup ()) == true); %! assert (eq (infsup (), infsup (1)) == false); %! assert (eq (infsup (0), infsup ()) == false); %! assert (eq (infsup (-inf, inf), infsup ()) == false); %!test "Singleton intervals"; %! assert (eq (infsup (0), infsup (1)) == false); %! assert (eq (infsup (0), infsup (0)) == true); %!test "Bounded intervals"; %! assert (eq (infsup (1, 2), infsup (3, 4)) == false); %! assert (eq (infsup (1, 2), infsup (2, 3)) == false); %! assert (eq (infsup (1, 2), infsup (1.5, 2.5)) == false); %! assert (eq (infsup (1, 2), infsup (1, 2)) == true); %!test "Unbounded intervals"; %! assert (eq (infsup (0, inf), infsup (-inf, 0)) == false); %! assert (eq (infsup (0, inf), infsup (0, inf)) == true); %! assert (eq (infsup (-inf, 0), infsup (-inf, 0)) == true); %! assert (eq (infsup (-inf, inf), infsup (42)) == false); %! assert (eq (infsup (-inf, 0), infsup (-inf, inf)) == false); %! assert (eq (infsup (-inf, inf), infsup (-inf, inf)) == true); interval-2.1.0/inst/@infsup/erf.m0000644000000000000000000000365613031036767015017 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} erf (@var{X}) ## ## Compute the error function. ## ## @tex ## $$ ## {\rm erf} (x) = {2 \over \sqrt{\pi}}\int_0^x \exp (-t^2) dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## x ## 2 / ## erf (x) = ----- | exp (-t²) dt ## √π / ## 0 ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## erf (infsup (1)) ## @result{} ans ⊂ [0.8427, 0.84271] ## @end group ## @end example ## @seealso{@@infsup/erfc} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-28 function x = erf (x) if (nargin ~= 1) print_usage (); return endif ## erf is monotonically increasing l = mpfr_function_d ('erf', -inf, x.inf); u = mpfr_function_d ('erf', +inf, x.sup); emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (erf (infsup (1)) == "[0x1.AF767A741088Ap-1, 0x1.AF767A741088Bp-1]"); %!# correct use of signed zeros %!test %! x = erf (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/erfc.m0000644000000000000000000000375613031036767015163 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} erfc (@var{X}) ## ## Compute the complementary error function @code{1 - erf (@var{X})}. ## ## @tex ## $$ ## {\rm erfc} (x) = {2 \over \sqrt{\pi}}\int_x^\infty \exp (-t^2) dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## ∞ ## 2 / ## erfc (x) = ----- | exp (-t²) dt ## √π / ## x ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## erfc (infsup (1)) ## @result{} ans ⊂ [0.15729, 0.1573] ## @end group ## @end example ## @seealso{@@infsup/erf} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-28 function x = erfc (x) if (nargin ~= 1) print_usage (); return endif ## erf is monotonically decreasing l = mpfr_function_d ('erfc', -inf, x.sup); u = mpfr_function_d ('erfc', +inf, x.inf); emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (erfc (infsup (1)) == "[0x1.4226162FBDDD4p-3, 0x1.4226162FBDDD5p-3]"); %!# correct use of signed zeros %!test %! x = erfc (infsup (realmax)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/exp.m0000644000000000000000000000353313031036767015031 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} exp (@var{X}) ## ## Compute the exponential function. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## exp (infsup (1)) ## @result{} ans ⊂ [2.7182, 2.7183] ## @end group ## @end example ## @seealso{@@infsup/log, @@infsup/pow} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function x = exp (x) if (nargin ~= 1) print_usage (); return endif ## exp is monotonically increasing from (-inf, 0) to (inf, inf) if (__check_crlibm__ ()) l = crlibm_function ('exp', -inf, x.inf); # this also works for empty intervals u = crlibm_function ('exp', +inf, x.sup); # ... this does not else l = mpfr_function_d ('exp', -inf, x.inf); # this also works for empty intervals u = mpfr_function_d ('exp', +inf, x.sup); # ... this does not endif l(l == 0) = -0; u(isempty (x)) = -inf; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (exp (infsup (1)) == infsup ("e")); %!# correct use of signed zeros %!test %! x = exp (infsup (-realmax)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/expm.m0000644000000000000000000000772713031036767015217 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} expm (@var{A}) ## ## Compute the matrix exponential of square matrix @var{A}. ## ## The matrix exponential is defined as the infinite Taylor series ## ## @tex ## $$ ## {\rm expm} (A) = \sum_{k = 0}^{\infty} {A^k \over k!} ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## A² A³ ## expm (A) = I + A + ---- + ---- + … ## 2! 3! ## @end verbatim ## @end group ## @end ifnottex ## ## The function implements the following algorithm: 1. The matrix is scaled, ## 2. an enclosure of the Taylor series is computed using the Horner scheme, ## 3. the matrix is squared. That is, the algorithm computes ## @code{expm (@var{A} ./ pow2 (@var{L})) ^ pow2 (@var{L})}. The scaling ## reduces the matrix norm below 1, which reduces errors during exponentiation. ## Exponentiation typically is done by Padé approximation, but that doesn't ## work for interval matrices, so we compute a Horner evaluation of the Taylor ## series. Finally, the exponentiation with @code{pow2 (@var{L})} is computed ## with @var{L} successive interval matrix square operations. Interval matrix ## square operations can be done without dependency errors (regarding each ## single step). ## ## The algorithm has been published by Alexandre Goldsztejn and Arnold ## Neumaier (2009), “On the Exponentiation of Interval Matrices.” ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## vec (expm (infsup(magic (3)))) ## @result{} ans ⊂ 9×1 interval vector ## ## [1.0897e+06, 1.0898e+06] ## [1.0896e+06, 1.0897e+06] ## [1.0896e+06, 1.0897e+06] ## [1.0895e+06, 1.0896e+06] ## [1.0897e+06, 1.0898e+06] ## [1.0897e+06, 1.0898e+06] ## [1.0896e+06, 1.0897e+06] ## [1.0896e+06, 1.0897e+06] ## [1.0896e+06, 1.0897e+06] ## ## @end group ## @end example ## @seealso{@@infsup/mpower, @@infsup/exp} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-01-26 function result = expm (A) if (nargin ~= 1) print_usage (); return endif if (isscalar (A)) ## Short-circuit for scalars result = exp (A); return endif if (not (issquare (A.inf))) error ("interval:InvalidOperand", ... "expm: must be square matrix"); endif ## Choose L such that ||A|| / 2^L < 0.1 and 10 <= L <= 100 L = min (max (inf (ceil (log2 (10 * norm (A, inf)))), 10), 100); ## Choose K such that K + 2 > ||A|| and 10 <= K <= 170 K = min (max (inf (ceil (norm (A, inf) - 2)), 10), 170); ## 1. Scale A = rdivide (A, pow2 (L)); ## 2. Compute Taylor series ## Compute Horner scheme: I + A*(I + A/2*(I + A/3*( ... (I + A/K) ... ))) result = I = eye (size (A.inf)); for k = K : -1 : 1 result = I + A ./ k * result; endfor ## Truncation error for the exponential series alpha = norm (A, inf); rho = pown (alpha, K + 1) ./ ... (factorial (infsup (K + 1)) * (1 - alpha ./ (K + 2))); warning ("off", "interval:ImplicitPromote", "local"); truncation_error = rho .* infsup (-1, 1); result = result + truncation_error; ## 3. Squaring result = mpower (result, pow2 (L)); endfunction %!# from the paper %!test %! A = infsup ([0 1; 0 -3], [0 1; 0 -2]); %! assert (all (all (subset (infsup ([1, 0.316738; 0, 0.0497871], [1, 0.432332; 0, 0.135335]), expm (A)))));interval-2.1.0/inst/@infsup/expm1.m0000644000000000000000000000364313031036767015271 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} expm1 (@var{X}) ## ## Compute @code{exp (@var{X}) - 1} accurately in the neighborhood of zero. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## expm1 (infsup (eps)) ## @result{} ans ⊂ [2.2204e-16, 2.2205e-16] ## @end group ## @end example ## @seealso{@@infsup/exp, @@infsup/log1p} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-20 function x = expm1 (x) if (nargin ~= 1) print_usage (); return endif ## expm1 is monotonically increasing from (-inf, 0) to (inf, inf) if (__check_crlibm__ ()) l = crlibm_function ('expm1', -inf, x.inf); # this also works for [Empty] u = crlibm_function ('expm1', +inf, x.sup); # ... this does not else l = mpfr_function_d ('expm1', -inf, x.inf); # this also works for [Empty] u = mpfr_function_d ('expm1', +inf, x.sup); # ... this does not endif l(l == 0) = -0; u(isempty (x)) = -inf; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (expm1 (infsup (eps)) == "[0x1p-52, 0x1.0000000000001p-52]"); %!# correct use of signed zeros %!test %! x = expm1 (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/factorial.m0000644000000000000000000000444713031036767016206 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} factorial (@var{N}) ## ## Compute the factorial of @var{N} where @var{N} is a non-negative integer. ## ## If @var{N} is a scalar, this is equivalent to ## @display ## factorial (@var{N}) = 1 * 2 * @dots{} * @var{N}. ## @end display ## For vector or matrix arguments, return the factorial of each element in the ## array. ## ## For non-integers see the generalized factorial function @command{gamma}. ## Note that the factorial function grows large quite quickly, and the result ## cannot be represented exactly in binary64 for @var{N} ≥ 23 and will overflow ## for @var{N} ≥ 171. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## factorial (infsup (6)) ## @result{} ans = [720] ## @end group ## @end example ## @seealso{@@infsup/prod, @@infsup/gamma, @@infsup/gammaln} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-01-31 function x = factorial (x) if (nargin ~= 1) print_usage (); return endif l = max (0, ceil (x.inf)); u = floor (x.sup); emptyresult = l > u; l(emptyresult) = inf; u(emptyresult) = -inf; l(not (emptyresult)) = ... mpfr_function_d ("factorial", -inf, l(not (emptyresult))); u(not (emptyresult)) = ... mpfr_function_d ("factorial", +inf, u(not (emptyresult))); x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (factorial (infsup (6)) == 720); %!assert (factorial (infsup (0)) == 1); %!assert (factorial (infsup ("[0, 1.99]")) == 1); %!assert (factorial (infsup ("[0, 2]")) == "[1, 2]"); %!assert (factorial (infsup ("[1.4, 1.6]")) == "[Empty]"); interval-2.1.0/inst/@infsup/fix.m0000644000000000000000000000573213031036767015026 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} fix (@var{X}) ## ## Truncate fractional portion of each number in interval @var{X}. This is ## equivalent to rounding towards zero. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## fix (infsup (2.5, 3.5)) ## @result{} ans = [2, 3] ## fix (infsup (-0.5, 5)) ## @result{} ans = [0, 5] ## @end group ## @end example ## @seealso{@@infsup/floor, @@infsup/ceil, @@infsup/round, @@infsup/roundb} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = fix (x) if (nargin ~= 1) print_usage (); return endif x.inf = fix (x.inf); x.sup = fix (x.sup); x.inf(x.inf == 0) = -0; x.sup(x.sup == 0) = +0; endfunction %!# Empty interval %!assert (fix (infsup ()) == infsup ()); %!# Singleton intervals %!assert (fix (infsup (0)) == infsup (0)); %!assert (fix (infsup (1)) == infsup (1)); %!assert (fix (infsup (1+eps)) == infsup (1)); %!assert (fix (infsup (-1)) == infsup (-1)); %!assert (fix (infsup (0.5)) == infsup (0)); %!assert (fix (infsup (-0.5)) == infsup (0)); %!# Bounded intervals %!assert (fix (infsup (-0.5, 0)) == infsup (0)); %!assert (fix (infsup (0, 0.5)) == infsup (0)); %!assert (fix (infsup (0.25, 0.5)) == infsup (0)); %!assert (fix (infsup (-1, 0)) == infsup (-1, 0)); %!assert (fix (infsup (-1, 1)) == infsup (-1, 1)); %!assert (fix (infsup (-realmin, realmin)) == infsup (0)); %!assert (fix (infsup (-realmax, realmax)) == infsup (-realmax, realmax)); %!# Unbounded intervals %!assert (fix (infsup (-realmin, inf)) == infsup (0, inf)); %!assert (fix (infsup (-realmax, inf)) == infsup (-realmax, inf)); %!assert (fix (infsup (-inf, realmin)) == infsup (-inf, 0)); %!assert (fix (infsup (-inf, realmax)) == infsup (-inf, realmax)); %!assert (fix (infsup (-inf, inf)) == infsup (-inf, inf)); %!# from the documentation string %!assert (fix (infsup (2.5, 3.5)) == infsup (2, 3)); %!assert (fix (infsup (-0.5, 5)) == infsup (0, 5)); %!# correct use of signed zeros %!test %! x = fix (infsup (0.5)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = fix (infsup (-0.5)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = fix (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/floor.m0000644000000000000000000000532613031036767015360 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} floor (@var{X}) ## ## Round each number in interval @var{X} towards -Inf. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## floor (infsup (2.5, 3.5)) ## @result{} ans = [2, 3] ## floor (infsup (-0.5, 5)) ## @result{} ans = [-1, +5] ## @end group ## @end example ## @seealso{@@infsup/ceil, @@infsup/round, @@infsup/roundb, @@infsup/fix} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = floor (x) if (nargin ~= 1) print_usage (); return endif x.inf = floor (x.inf); x.sup = floor (x.sup); x.inf(x.inf == 0) = -0; endfunction %!# Empty interval %!assert (floor (infsup ()) == infsup ()); %!# Singleton intervals %!assert (floor (infsup (0)) == infsup (0)); %!assert (floor (infsup (0.5)) == infsup (0)); %!assert (floor (infsup (-0.5)) == infsup (-1)); %!# Bounded intervals %!assert (floor (infsup (-0.5, 0)) == infsup (-1, 0)); %!assert (floor (infsup (0, 0.5)) == infsup (0)); %!assert (floor (infsup (0.25, 0.5)) == infsup (0)); %!assert (floor (infsup (-1, 0)) == infsup (-1, 0)); %!assert (floor (infsup (-1, 1)) == infsup (-1, 1)); %!assert (floor (infsup (-realmin, realmin)) == infsup (-1, 0)); %!assert (floor (infsup (-realmax, realmax)) == infsup (-realmax, realmax)); %!# Unbounded intervals %!assert (floor (infsup (-realmin, inf)) == infsup (-1, inf)); %!assert (floor (infsup (-realmax, inf)) == infsup (-realmax, inf)); %!assert (floor (infsup (-inf, realmin)) == infsup (-inf, 0)); %!assert (floor (infsup (-inf, realmax)) == infsup (-inf, realmax)); %!assert (floor (infsup (-inf, inf)) == infsup (-inf, inf)); %!# from the documentation string %!assert (floor (infsup (2.5, 3.5)) == infsup (2, 3)); %!assert (floor (infsup (-0.5, 5)) == infsup (-1, 5)); %!# correct use of signed zeros %!test %! x = floor (infsup (0.5)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = floor (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/fma.m0000644000000000000000000001110213031036767014767 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} fma (@var{X}, @var{Y}, @var{Z}) ## ## Fused multiply and add @code{@var{X} * @var{Y} + @var{Z}}. ## ## This function is semantically equivalent to evaluating multiplication and ## addition separately, but in addition guarantees a tight enclosure of the ## result. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## output_precision (16, 'local') ## fma (infsup (1+eps), infsup (7), infsup ("0.1")) ## @result{} ans ⊂ [7.100000000000001, 7.100000000000003] ## infsup (1+eps) * infsup (7) + infsup ("0.1") ## @result{} ans ⊂ [7.1, 7.100000000000003] ## @end group ## @end example ## @seealso{@@infsup/plus, @@infsup/times} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-03 function x = fma (x, y, z) if (nargin ~= 3) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); endif if (not (isa (z, "infsup"))) z = infsup (z); endif ## Resize, if scalar × matrix if (not (size_equal (x.inf, y.inf))) x.inf = ones (size (y.inf)) .* x.inf; x.sup = ones (size (y.inf)) .* x.sup; y.inf = ones (size (x.inf)) .* y.inf; y.sup = ones (size (x.inf)) .* y.sup; endif if (not (size_equal (y.inf, z.inf))) y.inf = ones (size (z.inf)) .* y.inf; y.sup = ones (size (z.inf)) .* y.sup; z.inf = ones (size (y.inf)) .* z.inf; z.sup = ones (size (y.inf)) .* z.sup; endif if (not (size_equal (x.inf, z.inf))) x.inf = ones (size (z.inf)) .* x.inf; x.sup = ones (size (z.inf)) .* x.sup; z.inf = ones (size (x.inf)) .* z.inf; z.sup = ones (size (x.inf)) .* z.sup; endif ## [Empty] × anything = [Empty] ## [0] × anything = [0] × [0] ## [Entire] × anything but [0] = [Entire] × [Entire] ## This prevents the cases where 0 × inf would produce NaNs. entireproduct = isentire (x) | isentire (y); zeroproduct = (x.inf == 0 & x.sup == 0) | (y.inf == 0 & y.sup == 0); emptyresult = isempty (x) | isempty (y) | isempty (z); x.inf(entireproduct) = y.inf(entireproduct) = -inf; x.sup(entireproduct) = y.sup(entireproduct) = inf; x.inf(zeroproduct) = x.sup(zeroproduct) = ... y.inf(zeroproduct) = y.sup(zeroproduct) = 0; ## It is hard to determine, which boundaries of x and y take part in the ## multiplication of fma. Therefore, we simply compute the fma for each triple ## of boundaries where the min/max could be located. ## ## How to construct complicated cases: a = rand, b = rand, c = rand, ## d = a * b / c (with round towards -infinity for multiplication and towards ## +infinity for division). Then, it is not possible to decide in 50% of all ## cases whether a * b would be greater or less than c * d by computing the ## products in double-precision. l = min (min (min (... mpfr_function_d ('fma', -inf, x.inf, y.inf, z.inf), ... mpfr_function_d ('fma', -inf, x.inf, y.sup, z.inf)), ... mpfr_function_d ('fma', -inf, x.sup, y.inf, z.inf)), ... mpfr_function_d ('fma', -inf, x.sup, y.sup, z.inf)); u = max (max (max (... mpfr_function_d ('fma', +inf, x.inf, y.inf, z.sup), ... mpfr_function_d ('fma', +inf, x.inf, y.sup, z.sup)), ... mpfr_function_d ('fma', +inf, x.sup, y.inf, z.sup)), ... mpfr_function_d ('fma', +inf, x.sup, y.sup, z.sup)); l(emptyresult) = +inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (fma (infsup (1+eps), infsup (7), infsup ("0.1")) == "[0x1.C666666666668p2, 0x1.C666666666669p2]"); %!# correct use of signed zeros %!test %! x = fma (infsup (0), 0, 0); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = fma (infsup (1), 0, 0); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = fma (infsup (1), 1, -1); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/fminsearch.m0000644000000000000000000002135113031036767016352 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{X} =} fminsearch (@var{f}, @var{X0}) ## @deftypemethodx {@@infsup} {[@var{X}, @var{FVAL}] =} fminsearch (@var{f}, @var{X0}, @var{options}) ## ## Minimize the function @var{f} over the interval box @var{X0} and return ## rigorous bounds. ## ## The function @var{f} may be multivariate, that is, the interval box @var{X0} ## may be a vector or matrix of intervals. The output of the function must be ## scalar. ## ## The rigorous bounds on @var{FVAL} satisfy 0 ≤ min @{f (@var{x}) | ## @var{x} ∈ @var{X0}@} - inf (@var{FVAL}) ≤ 1e-4 by default. Different ## accuracy requirements may be defined using @var{options}.TolFun. ## ## @example ## @group ## [x, fval] = fminsearch (@@cos, infsup ("[0, 4]")) ## @result{} ## x ⊂ [3.114, 3.1858] ## fval ⊂ [-1, -0.99996] ## @end group ## @end example ## ## During each iteration the interval is bisected at its widest coordinate ## until the desired accuracy has been reached. ## ## @example ## @group ## f = @@(x) x(1) .^ 2 - x(2) .^ 2; ## [x, fval] = fminsearch (f, infsup ("[-1, 1] [-1, 1]")) ## @result{} ## x ⊂ 1×2 interval vector ## ## [7.8828e-11, 8.8786e-06] [0.99991, 1] ## ## fval ⊂ [-1, -0.99991] ## @end group ## @end example ## ## Note that the algorithm tries to minimize @var{FVAL} and the returned ## value for @var{X} need not contain the minimum value of the function over ## @var{X0}; the value @var{X} is just “close” to one of possibly several ## places where the minimum occurs, that is, hull (f (@var{X})) overlaps ## [@var{M}-ε, @var{M}+ε], where @var{M} is the actual minimum of the ## function f over @var{X0} and ε equals @var{options}.TolFun. Also, it holds ## @var{M} ∈ @var{FVAL}, but in general it does @emph{not} hold ## f (@var{X}) ⊆ @var{FVAL}. ## ## It is possible to use the following optimization @var{options}: ## @option{Display}, @option{MaxFunEvals}, @option{MaxIter}, ## @option{OutputFcn}, @option{TolFun}, @option{TolX}. ## ## @example ## @group ## f = @@(x) -sin (hypot (x(1), x(2))) / hypot (x(1), x(2)); ## [x, fval] = fminsearch (f, infsup ("[-1, 1] [-1, 1]"), ... ## optimset ('MaxIter', 20)) ## @result{} ## x ⊂ 1×2 interval vector ## ## [0, 1.9763e-323] [0, 1.9763e-323] ## ## fval ⊂ [-Inf, -0.99999] ## @end group ## @end example ## ## The function utilizes the Skelboe-Moore algorithm and has been implemented ## after Algorithm 6.1 in R. E. Moore, R. B. Kearfott, and M. J. Cloud. 2009. ## Introduction to Interval Analysis. Society for Industrial and Applied ## Mathematics. ## ## @seealso{optimset} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-09-18 function [X, FVAL, iter] = fminsearch (f, X, options) if (nargin < 2) print_usage (); return endif if (not (is_function_handle (f)) && not (ischar (f))) error ("interval:InvalidOperand", ... "fminsearch: Parameter f is no function handle") elseif (not (isa (X, "infsup"))) error ("interval:InvalidOperand", ... "fminsearch: Parameter X0 is no interval") endif defaultoptions = optimset (optimset, 'TolFun', 1e-4); if (nargin < 3) options = defaultoptions; else options = optimset (defaultoptions, options); endif displayiter = strcmp (options.Display, "iter"); ## 1 Rigorous upper bound on the minimum of f over X fmX = feval (f, infsup (mid (X))); if (not (isa (fmX, "infsup")) || not (isscalar (fmX))) error ("interval:InvalidOperand", ... "fminsearch: Function f does not return scalar intervals") endif if (isempty (fmX)) f_ub = inf; else f_ub = sup (fmX); endif ## 3 Initialize queues ## C: Completed boxes where accuracy has been reached (it suffices to store a ## single element, because this function doesn't return all candidates) ## L: Boxes where accuracy has not been reached yet L.X = C.X = {}; L.fX = C.fX = infsup ([]); iter = 0; feval_count = 1; cancel_algorithm = false (); idx.type = "()"; while (true) iter ++; if (displayiter) display (X); endif ## 4 Bisect X at the coordinate i with the widest interval X1 = X2 = X; [~, i] = max (vec (wid (X))); idx.subs = {i}; [pt1, pt2] = bisect (subsref (X, idx)); X1 = subsasgn (X1, idx, pt1); X2 = subsasgn (X2, idx, pt2); if (not (isempty (options.OutputFcn))) feval (options.OutputFcn, X1); feval (options.OutputFcn, X2); endif ## 5 Improve upper bound fmX1 = feval (f, infsup (mid (X1))); if (not (isempty (fmX1))) f_ub = min (f_ub, sup (fmX1)); endif fmX2 = feval (f, infsup (mid (X2))); if (not (isempty (fmX2))) f_ub = min (f_ub, sup (fmX2)); endif ## 6 Quit current X box if accuracy has been reached f1 = feval (f, X1); f2 = feval (f, X2); feval_count += 4; cancel_algorithm = feval_count >= options.MaxFunEvals || ... iter >= options.MaxIter || ... f_ub <= -realmax (); if (min (f_ub, max (sup (f1), sup (f2))) ... - min (inf (f1), inf (f2)) < options.TolFun ... || max (max (wid (X1))) < options.TolX ... || cancel_algorithm) ## Accuracy has been reached for X1 and X2 C = merge_candidates (C, X1, f1); C = merge_candidates (C, X2, f2); else ## Put intervals into work queue if (inf (f1) < f_ub) L = insert_ordered_list (L, X1, f1); endif if (inf (f2) < f_ub) L = insert_ordered_list (L, X2, f2); endif endif ## More refinement to do on other boxes? if (isempty (L.X) || cancel_algorithm) break endif ## (i) Use next item from L [L, X, fX] = pop_ordered_list (L); ## (ii) Check whether improvement is still possible if (inf (fX) > f_ub) break endif endwhile assert (not (isempty (C.X))); [C, X, FVAL] = pop_ordered_list (C); if (isfinite (f_ub)) FVAL = intersect (FVAL, infsup (-inf, f_ub)); endif if (any (strcmp (options.Display, {"iter", "final"})) || ... (cancel_algorithm && strcmp (options.Display, "notify"))) printf ('\nTarget accuracy has%s been reached after %d step(s)\n', ... ' not'(1:end * cancel_algorithm), ... iter); display (X); display (FVAL); endif endfunction function candidate = merge_candidates (candidate, X, fX) if (isempty (candidate.X) || inf (fX) < inf (candidate.fX)) candidate.X = {X}; candidate.fX = fX; endif endfunction function list = insert_ordered_list (list, X, fX) position = find (inf (list.fX) >= inf (fX), 1); if (isempty (position)) list.fX = vertcat (list.fX, fX); list.X = vertcat (list.X, {X}); elseif (position == 1) list.fX = vertcat (fX, list.fX); list.X = vertcat ({X}, list.X); else idx1.type = idx2.type = "()"; idx1.subs = {1:(position - 1)}; idx2.subs = {position:numel(list.X)}; list.fX = vertcat (subsref (list.fX, idx1), ... fX, ... subsref (list.fX, idx2)); idx.type = "{}"; list.X = vertcat (subsref (list.X, idx1), ... {X}, ... subsref (list.X, idx2)); endif endfunction function [list, X, fX] = pop_ordered_list (list) X = list.X {1}; idx.type = "()"; if (nargout >= 3) idx.subs = {1}; fX = subsref (list.fX, idx); endif if (numel (list.X) == 1) list.fX = infsup ([]); list.X = {}; else idx.subs = {2:numel(list.X)}; list.fX = subsref (list.fX, idx); list.X = subsref (list.X, idx); endif endfunction %!test %! sqr = @(x) x .^ 2; %! [x, y] = fminsearch (sqr, infsup (-inf, inf)); %! assert (y == 0); %!demo %! clf %! hold on %! draw = @(x) plot (x(1), x(2), [238 232 213]/255, [88 110 117]/255); %! f = @(x) (x(1) - 2) .^ 2 - x(2) .^ 2; %! fminsearch (f, infsup ("[1, 3] [0, 1]"), ... %! optimset ('OutputFcn', draw)); %! hold off interval-2.1.0/inst/@infsup/fsolve.m0000644000000000000000000005136513031036767015541 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{X} =} fsolve (@var{F}) ## @deftypemethodx {@@infsup} {@var{X} =} fsolve (@var{F}, @var{X0}) ## @deftypemethodx {@@infsup} {@var{X} =} fsolve (@var{F}, @var{X0}, @var{Y}) ## @deftypemethodx {@@infsup} {@var{X} =} fsolve (@dots{}, @var{OPTIONS}) ## @deftypemethodx {@@infsup} {[@var{X}, @var{X_PAVING}, @var{X_INNER_IDX}] =} fsolve (@dots{}) ## ## Compute the preimage of the set @var{Y} under function @var{F}. ## ## Parameter @var{Y} is optional and without it solve ## @code{@var{F}(@var{x}) = 0} for @var{x} ∈ @var{X0}. Without a starting box ## @var{X0} the function is assumed to be univariate and the solution is ## searched among all real numbers. ## ## The function must be an interval arithmetic function and may be ## multivariate, that is, @var{X0} and @var{Y} may be vectors or matrices of ## intervals. The computational complexity largely depends on the dimension of ## @var{X0}. ## ## Return value @var{X} is an interval enclosure of ## @code{@{@var{x} ∈ @var{X0} | @var{F}(@var{x}) ∈ @var{Y}@}}. The optional ## return value @var{X_PAVING} is a matrix of non-overlapping interval values ## for @var{x} in each column, which form a more detailed enclosure for the ## preimage of @var{Y}. An index vector @var{X_INNER_IDX} indicates the ## columns of @var{X_PAVING}, which are guaranteed to be subsets of the ## preimage of @var{Y}. ## ## This function uses the set inversion via interval arithmetic (SIVIA) ## algorithm. That is, @var{X} is bisected until @var{F}(@var{X}) is either ## a subset of @var{Y} or until they are disjoint. ## ## @example ## @group ## fsolve (@@cos, infsup(0, "pi")) ## @result{} ans ⊂ [1.5646, 1.5708] ## @end group ## @end example ## ## It is possible to use the following optimization @var{options}: ## @option{MaxFunEvals}, @option{MaxIter}, @option{TolFun}, @option{TolX}, ## @option{Vectorize}, @option{Contract}. ## ## If @option{Vectorize} is @code{true}, the function @var{F} will be called ## with input arguments @code{@var{x}(1)}, @code{@var{x}(2)}, @dots{}, ## @code{@var{x}(numel (@var{X0}))} and each input argument will carry a vector ## of different values which shall be computed simultaneously. If @var{Y} is a ## scalar or vector, @option{Vectorize} defaults to @code{true}. If ## @option{Vectorize} is @code{false}, the function @var{F} will receive only ## one input argument @var{x} at a time, which has the size of @var{X0}. ## ## @example ## @group ## # Solve x1 ^ 2 + x2 ^ 2 = 1 for -3 ≤ x1, x2 ≤ 3, ## # the exact solution is a unit circle ## x = fsolve (@@hypot, infsup ([-3; -3], [3; 3]), 1) ## @result{} x ⊂ 2×1 interval vector ## ## [-1.002, +1.002] ## [-1.0079, +1.0079] ## ## @end group ## @end example ## ## If @option{Contract} is @code{true}, the function @var{F} will be called ## with @var{Y} as an additional leading input argument and, in addition to the ## function value, must return a @dfn{contraction} of its input argument(s). ## A contraction for input argument @var{x} is a subset of @var{x} which ## contains all possible solutions for the equation ## @code{@var{F} (@var{x}) = @var{Y}}. Contractions can be computed using ## interval reverse operations, for example with @code{@@infsup/absrev} which ## contracts the input argument for the absolute value function. ## ## @example ## @group ## # Solve x1 ^ 2 + x2 ^ 2 = 1 for -3 ≤ x1, x2 ≤ 3 again, ## # but now contractions speed up the algorithm. ## function [fval, cx1, cx2] = f (y, x1, x2) ## # Forward evaluation ## x1_sqr = x1 .^ 2; ## x2_sqr = x2 .^ 2; ## fval = hypot (x1, x2); ## ## # Reverse evaluation and contraction ## y = intersect (y, fval); ## # Contract the squares ## x1_sqr = intersect (x1_sqr, y - x2_sqr); ## x2_sqr = intersect (x2_sqr, y - x1_sqr); ## # Contract the parameters ## cx1 = sqrrev (x1_sqr, x1); ## cx2 = sqrrev (x2_sqr, x2); ## endfunction ## ## x = fsolve (@@f, infsup ([-3; -3], [3; 3]), 1, ... ## struct ('Contract', true)) ## @result{} x = 2×1 interval vector ## ## [-1, +1] ## [-1, +1] ## ## @end group ## @end example ## ## It is possible to combine options @option{Vectorize} and @option{Contract}. ## Depending on the combination, function @var{F} should have one of the ## following signatures. ## ## @table @code ## @item function fval = f (x) ## @option{Vectorize} = @code{false} and @option{Contract} = @code{false}. ## @item function fval = f (x1, x2, @dots{}, xN) ## @option{Vectorize} = @code{true} and @option{Contract} = @code{false}. ## @item function [fval, cx] = f (y, x) ## @option{Vectorize} = @code{false} and @option{Contract} = @code{true}. ## @code{cx} is a contraction of @code{x}. ## @item function [fval, cx1, cx2, @dots{}, cxN] = f (y, x1, x2, @dots{}, xN) ## @option{Vectorize} = @code{true} and @option{Contract} = @code{true}. ## @code{cx1} is a contraction of @code{x1}, @code{cx2} is a contraction of ## @code{x2}, and so on. ## @end table ## ## Note on performance: The bisection method is a brute-force approach to ## exhaust the function's domain and requires a lot of function evaluations. ## It is highly recommended to use a function @var{F} which allows ## vectorization. For higher dimensions of @var{X0} it is also necessary to ## use a contraction function. ## ## Accuracy: The result is a valid enclosure. ## ## @seealso{@@infsup/fzero, ctc_union, ctc_intersect, optimset} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-11-28 function [x, x_paving, x_inner_idx] = fsolve (f, x0, y, options) ## Set default parameters warning ("off", "", "local") # disable optimset warning defaultoptions = optimset (optimset, ... 'MaxIter', 20, ... 'MaxFunEval', 3000, ... 'TolX', 1e-2, ... 'TolFun', 1e-2, ... 'Vectorize', [], ... 'Contract', false); switch (nargin) case 1 x0 = infsup (-inf, inf); y = infsup (0); options = defaultoptions; case 2 y = infsup (0); if (isstruct (x0)) options = optimset (defaultoptions, x0); x0 = infsup (-inf, inf); else options = defaultoptions; endif case 3 if (isstruct (y)) options = optimset (defaultoptions, y); y = infsup (0); else options = defaultoptions; endif case 4 options = optimset (defaultoptions, options); otherwise print_usage (); return endswitch ## Convert x0 and y to intervals if (not (isa (x0, "infsup"))) if (isa (y, "infsupdec")) x0 = infsupdec (x0); else x0 = infsup (x0); endif endif if (not (isa (y, "infsup"))) if (isa (x0, "infsupdec")) y = infsupdec (y); else y = infsup (y); endif endif ## Check parameters if (isempty (x0) || isempty (y) || numel (x0) == 0 || numel (y) == 0) error ("interval:InvalidOperand", ... "fsolve: Initial interval is empty, nothing to do") elseif (not (is_function_handle (f)) && not (ischar (f))) error ("interval:InvalidOperand", ... "fsolve: Parameter F is no function handle") endif ## Strip decoration part if (isa (x0, "infsupdec")) if (isnai (x0)) x = x0; x_paving = {x0}; x_inner_idx = false; return endif x0 = intervalpart (x0); endif if (isa (y, "infsupdec")) if (isnai (y)) x = y; x_paving = {y}; x_inner_idx = false; return endif y = intervalpart (y); endif ## Try to vectorize function evaluation if (isempty (options.Vectorize) && isvector (y)) try f_argn = nargin (f); if (options.Contract) options.Vectorize = (f_argn > 2 || f_argn < 0 || numel (x0) == 1); else options.Vectorize = (f_argn > 1 || f_argn < 0 || numel (x0) == 1); endif catch ## nargin doesn't work for built-in functions, which happen to agree ## with infsup methods. Try to vectorize these. options.Vectorize = true; end_try_catch endif if (options.Vectorize) if (nargout >= 2) [x, x_paving, x_inner_idx] = vectorized (f, x0, y, options); else x = vectorized (f, x0, y, options); endif return endif warning ("off", "interval:ImplicitPromote", "local"); x = empty (size (x0)); x_paving = {}; x_inner_idx = false (0); queue = {x0}; x_scalar = isscalar (x0); ## Test functions verify_subset = @(fval) all (all (subset (fval, y))); verify_disjoint = @(fval) any (any (disjoint (fval, y))); check_contradiction = @(x) any (any (isempty (x))); max_wid = @(interval) max (max (wid (interval))); ## Utility functions for bisection if (x_scalar) bisect_coord = {1}; exchange_coordinate = @(interval, coord, l, u) infsup (l, u); else largest_coordinate = @(interval, max_wid) ... find (wid (interval) == max_wid, 1); exchange_coordinate = @replace_coordinate; endif while (not (isempty (queue))) ## Evaluate f(x) options.MaxFunEvals -= numel (queue); options.MaxIter --; if (options.Contract) [fval, contractions] = cellfun (f, {y}, queue, ... "UniformOutput", false); ## Sanitize the contractions returned by the function queue = cellfun (@intersect, queue, contractions, ... "UniformOutput", false); ## Utilize contradictions to discard candidates contradiction = cellfun (check_contradiction, queue); queue = queue(not (contradiction)); if (isempty (queue)) break endif fval = fval(not (contradiction)); else fval = cellfun (f, queue, "UniformOutput", false); endif ## Check whether x is outside of the preimage of y ## or x is inside the preimage of y is_outside = cellfun (verify_disjoint, fval); is_inside = cellfun (verify_subset, fval) & not (is_outside); ## Store the verified subsets of the preimage of y and continue only on ## elements that are not verified x = hull (x, queue(is_inside){:}); x_paving = vertcat (x_paving, queue(is_inside)); x_inner_idx = vertcat (x_inner_idx, true (sum (is_inside), 1)); queue = queue(not (is_inside | is_outside)); ## Stop after MaxIter or MaxFunEvals if (options.MaxIter <= 0 || options.MaxFunEvals <= 0) x = hull (x, queue{:}); x_paving = vertcat (x_paving, queue); x_inner_idx = vertcat (x_inner_idx, false (numel (queue), 1)); break endif ## Stop iteration for small intervals if (not (isempty (options.TolFun))) fval = fval(not (is_inside | is_outside)); widths = cellfun (max_wid, fval); is_small = widths < options.TolFun; else is_small = false (size (queue)); endif widths = cellfun (max_wid, queue); is_small = is_small | (widths < options.TolX); x = hull (x, queue(is_small){:}); x_paving = vertcat (x_paving, queue(is_small)); x_inner_idx = vertcat (x_inner_idx, false (sum (is_small), 1)); queue = queue(not (is_small)); widths = widths(not (is_small)); ## Bisect remaining intervals at the largest coordinate. ## ## Since the bisect function is the most costly, we want to call it only ## once. Thus, we extract the largest coordinate from each interval matrix ## inside queue and combine them into an interval vector [l_coord, u_coord] ## with the length of queue. We call the bisect function on this vector, ## which bisects each interval component and produces vectors ## [l_coord, m_coord] and [m_coord, u_coord]. These are used to replace the ## largest coordinate from each original interval matrix. if (x_scalar) [l_coord, u_coord] = ... cellfun (@(interval) ... deal (interval.inf, interval.sup), ... queue); else bisect_coord = cellfun (largest_coordinate, ... queue, num2cell (widths), ... "UniformOutput", false); [l_coord, u_coord] = ... cellfun (@(interval, coord) ... deal (interval.inf(coord), interval.sup(coord)), ... queue, bisect_coord); endif m_coord = mid (infsup (l_coord, u_coord)); l_coord = num2cell (l_coord); m_coord = num2cell (m_coord); u_coord = num2cell (u_coord); queue = vertcat (... cellfun (exchange_coordinate, ... queue, bisect_coord, l_coord, m_coord, ... "UniformOutput", false), ... cellfun (exchange_coordinate, ... queue, bisect_coord, m_coord, u_coord, ... "UniformOutput", false)); ## Short-circuit if no paving must be computed and remaining intervals ## are subsets of the already computed interval enclosure. if (isempty (queue)) break endif if (nargout < 2) x_bare = intervalpart (x); queue = queue(not (cellfun (@(q) all (all (subset (q, x_bare))), ... queue))); endif endwhile x = intervalpart (x); if (nargout >= 2) x_paving = cellfun (@vec, x_paving, "UniformOutput", false); x_paving = horzcat (x_paving{:}); endif endfunction function interval = replace_coordinate (interval, coord, l, u) interval.inf(coord) = l; interval.sup(coord) = u; endfunction ## Variant of above algorithm, which utilized vectorized evaluation of f function [x, x_paving, x_inner_idx] = vectorized (f, x0, y, options) warning ("off", "Octave:broadcast", "local"); ## Make vectorization dimension cat_dim orthogonal to the dimension of the data ## in y to allow simple function definitions. if (iscolumn (y)) x0 = vec (x0); data_dim = 1; cat_dim = 2; else assert (isrow (y)); x0 = transpose (vec (x0)); data_dim = 2; cat_dim = 1; endif x = intervalpart (empty (size (x0))); s = size (x0); s(cat_dim) = 0; x_paving = infsup (zeros (s)); x_inner_idx = false (0); queue = x0; x_scalar = isscalar (x0); ## Test functions verify_subset = @(fval) all (subset (fval, y), data_dim); verify_disjoint = @(fval) any (disjoint (fval, y), data_dim); ## Utility functions for indexing the queue idx.type = '()'; idx.subs = {:, :}; while (not (isempty (queue.inf))) ## Evaluate f(x) l_args = num2cell (queue.inf, cat_dim); u_args = num2cell (queue.sup, cat_dim); f_args = cellfun (@(l, u) infsup (l, u), ... l_args, u_args, ... "UniformOutput", false); options.MaxFunEvals --; options.MaxIter --; if (options.Contract) fval_and_contractions = nthargout (1 : (1 + length (x0)), ... @feval, f, y, f_args{:}); fval = fval_and_contractions{1}; contractions = cat (data_dim, fval_and_contractions{2 : end}); ## Sanitize the contractions returned by the function queue = intersect (queue, contractions); ## Utilize contradictions to discard candidates contradiction = any (isempty (queue), data_dim); idx.subs{cat_dim} = not (contradiction); queue = subsref (queue, idx); if (isempty (queue.inf)) break endif fval = subsref (fval, idx); else fval = feval (f, f_args{:}); endif ## Check whether x is outside of the preimage of y ## or x is inside the preimage of y is_outside = verify_disjoint (fval); is_inside = verify_subset (fval) & not (is_outside); ## Store the verified subsets of the preimage of y and continue only on ## elements that are not verified idx.subs{cat_dim} = is_inside; queue_inside = subsref (queue, idx); x = union (cat (cat_dim, x, queue_inside), [], cat_dim); x_paving = cat (cat_dim, x_paving, queue_inside); x_inner_idx = cat (cat_dim, x_inner_idx, is_inside(is_inside)); idx.subs{cat_dim} = not (is_inside | is_outside); queue = subsref (queue, idx); ## Stop after MaxIter or MaxFunEvals if (options.MaxIter <= 0 || options.MaxFunEvals <= 0) x = union (cat (cat_dim, x, queue), [], cat_dim); x_paving = cat (cat_dim, x_paving, queue); s = size (queue); s(data_dim) = 1; x_inner_idx = cat (cat_dim, x_inner_idx, false (s)); break endif ## Stop iteration for small intervals if (not (isempty (options.TolFun))) idx.subs{cat_dim} = not (is_inside | is_outside); fval = subsref (fval, idx); widths = max (wid (fval), [], data_dim); is_small = widths < options.TolFun; else s = size (queue); s(data_dim) = 1; is_small = false (s); endif [widths, bisect_coord] = max (wid (queue), [], data_dim); is_small = is_small | (widths < options.TolX); idx.subs{cat_dim} = is_small; queue_is_small = subsref (queue, idx); x = union (cat (cat_dim, x, queue_is_small), [], cat_dim); x_paving = cat (cat_dim, x_paving, queue_is_small); x_inner_idx = cat (cat_dim, x_inner_idx, not (is_small(is_small))); idx.subs{cat_dim} = not (is_small); queue = subsref (queue, idx); widths = widths(not (is_small)); bisect_coord = bisect_coord(not (is_small)); ## Bisect remaining intervals at the largest coordinate. x1 = x2 = queue; if (x_scalar) coord = queue; else coord_idx.type = "()"; if (data_dim == 1) coord_idx.subs = {bisect_coord - 1 + ... (1 : rows (queue.inf) : numel (queue.inf))}; else coord_idx.subs = {bisect_coord - 1 + ... (1 : columns (queue.inf) : numel (queue.inf)).'}; endif coord = subsref (queue, coord_idx); endif m_coord = mid (coord); if (x_scalar) x1.sup = x2.inf = m_coord; else x1.sup = subsasgn (x1.sup, coord_idx, m_coord); x2.inf = subsasgn (x2.inf, coord_idx, m_coord); endif queue = cat (cat_dim, x1, x2); if (isempty (queue.inf)) break endif ## Short-circuit if no paving must be computed and remaining intervals ## are subsets of the already computed interval enclosure. if (nargout < 2) idx.subs{cat_dim} = not (all (subset (queue, x), data_dim)); queue = subsref (queue, idx); endif endwhile if (nargout >= 2 && data_dim != 1) x_paving = transpose (x_paving); endif endfunction %!test %! sqr = @(x) x .^ 2; %! assert (subset (sqrt (infsup (2)), fsolve (sqr, infsup (0, 3), 2))); %!test %! sqr = @(x) x .^ 2; %! assert (subset (sqrt (infsup (2)), fsolve (sqr, infsup (0, 3), 2, struct ("Vectorize", false)))); %!function [fval, x] = contractor (y, x) %! fval = x .^ 2; %! y = intersect (y, fval); %! x = sqrrev (y, x); %!endfunction %!assert (subset (sqrt (infsup (2)), fsolve (@contractor, infsup (0, 3), 2, struct ("Contract", true)))); %!assert (subset (sqrt (infsup (2)), fsolve (@contractor, infsup (0, 3), 2, struct ("Contract", true, "Vectorize", false)))); %!demo %! clf %! hold on %! grid on %! axis equal %! shade = [238 232 213] / 255; %! blue = [38 139 210] / 255; %! cyan = [42 161 152] / 255; %! red = [220 50 47] / 255; %! # 2D ring %! f = @(x, y) hypot (x, y); %! [outer, paving, inner] = fsolve (f, infsup ([-3; -3], [3; 3]), ... %! infsup (0.5, 2), ... %! optimset ('TolX', 0.1)); %! # Plot the outer interval enclosure %! plot (outer(1), outer(2), shade) %! # Plot the guaranteed inner interval enclosures of the preimage %! plot (paving(1, inner), paving(2, inner), blue, cyan); %! # Plot the boundary of the preimage %! plot (paving(1, not (inner)), paving(2, not (inner)), red); %!demo %! clf %! hold on %! grid on %! shade = [238 232 213] / 255; %! blue = [38 139 210] / 255; %! # This 3D ring is difficult to approximate with interval boxes %! f = @(x, y, z) hypot (hypot (x, y) - 2, z); %! [~, paving, inner] = fsolve (f, infsup ([-4; -4; -2], [4; 4; 2]), ... %! infsup (0, 0.5), ... %! optimset ('TolX', 0.2)); %! plot3 (paving(1, not (inner)), ... %! paving(2, not (inner)), ... %! paving(3, not (inner)), shade, blue); %! view (50, 60) interval-2.1.0/inst/@infsup/fzero.m0000644000000000000000000001662013031036767015363 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{X} =} fzero (@var{F}, @var{X0}) ## @deftypemethodx {@@infsup} {@var{X} =} fzero (@var{F}, @var{X0}, @var{DF}) ## @deftypemethodx {@@infsup} {@var{X} =} fzero (@var{F}, @var{X0}, @var{OPTIONS}) ## @deftypemethodx {@@infsup} {@var{X} =} fzero (@var{F}, @var{X0}, @var{DF}, @var{OPTIONS}) ## ## Compute the enclosure of all roots of function @var{F} in interval @var{X0}. ## ## Parameters @var{F} and (possibly) @var{DF} may either be a function handle, ## inline function, or string containing the name of the function to evaluate. ## ## The function must be an interval arithmetic function. ## ## Optional parameters are the function's derivative @var{DF} and the maximum ## recursion steps @var{OPTIONS}.MaxIter (default: 200) to use. If @var{DF} is ## given, the algorithm tries to apply the interval newton method for finding ## the roots; otherwise pure bisection is used (which is slower). ## ## The result is a column vector with one element for each root enclosure that ## has been be found. Each root enclosure may contain more than one root and ## each root enclosure must not contain any root. However, all numbers in ## @var{X0} that are not covered by the result are guaranteed to be no roots of ## the function. ## ## Best results can be achieved when (a) the function @var{F} does not suffer ## from the dependency problem of interval arithmetic, (b) the derivative ## @var{DF} is given, (c) the derivative is non-zero at the function's roots, ## and (d) the derivative is continuous. ## ## It is possible to use the following optimization @var{options}: ## @option{Display}, @option{MaxFunEvals}, @option{MaxIter}, ## @option{OutputFcn}, @option{TolFun}, @option{TolX}. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## f = @@(x) cos (x); ## df = @@(x) -sin (x); ## fzero (f, infsup ("[-10, 10]"), df) ## @result{} ans ⊂ 6×1 interval vector ## ## [-7.854, -7.8539] ## [-4.7124, -4.7123] ## [-1.5708, -1.5707] ## [1.5707, 1.5708] ## [4.7123, 4.7124] ## [7.8539, 7.854] ## sqr = @@(x) x .^ 2; ## fzero (sqr, infsup ("[Entire]")) ## @result{} ans ⊂ [-3.2968e-161, +3.2968e-161] ## @end group ## @end example ## ## @seealso{@@infsup/fsolve, optimset} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-01 function x = fzero (f, x0, df, options) if (nargin > 4 || nargin < 2) print_usage (); return endif ## Set default parameters defaultoptions = optimset (optimset, 'MaxIter', 200); if (nargin == 2) df = []; options = defaultoptions; elseif (nargin == 3) if (isstruct (df)) options = optimset (defaultoptions, options); df = []; else options = defaultoptions; endif else options = optimset (defaultoptions, options); endif ## Check parameters if (not (isa (x0, "infsup"))) error ("interval:InvalidOperand", "fzero: Parameter X0 is no interval") elseif (not (isscalar (x0))) error ("interval:InvalidOperand", ... "fzero: Parameter X0 must be a scalar / F must be univariate") elseif (isempty (x0)) error ("interval:InvalidOperand", ... "fzero: Initial interval is empty, nothing to do") elseif (not (is_function_handle (f)) && not (ischar (f))) error ("interval:InvalidOperand", ... "fzero: Parameter F is no function handle") elseif (not (isempty (df)) && ... not (is_function_handle (df)) && ... not (ischar (df))) error ("interval:InvalidOperand", ... "fzero: Parameter DF is not function handle") endif ## Does not work on decorated intervals, strip decoration part if (isa (x0, "infsupdec")) if (isnai (x0)) result = x0; return endif x0 = intervalpart (x0); endif [l, u] = findroots (f, df, x0, 0, options); x = infsup (); x.inf = l; x.sup = u; endfunction ## This function will perform the recursive newton / bisection steps function [l, u] = findroots (f, df, x0, stepcount, options) l = u = zeros (0, 1); ## Try the newton step, if derivative is known if (not (isempty (df))) m = infsup (mid (x0)); [a, b] = mulrev (feval (df, x0), feval (f, m)); if (isempty (a) && isempty (b)) ## Function evaluated outside of its domain a = x0; else a = intersect (x0, m - a); b = intersect (x0, m - b); if (isempty (a)) [a, b] = deal (b, a); endif endif else a = x0; b = infsup (); endif ## Switch to bisection if the newton step did not produce two intervals if ((eq (x0, a) || isempty (b)) && not (issingleton (a)) && not (isempty (a))) ## When the interval is very large, bisection at the midpoint would ## take “forever” to converge, because floating point numbers are not ## distributed evenly on the real number lane. ## ## We enumerate all floating point numbers within a with ## 1, 2, ... 2n and split the interval at n. ## ## When the interval is small, this algorithm will choose ## approximately mid (a). [a, b] = bisect (a); elseif (b < a) ## Sort the roots in ascending order [a, b] = deal (b, a); endif for x1 = {a, b} x1 = x1 {1}; if (strcmp (options.Display, "iter")) display (x1); endif f_x1 = feval (f, x1); if (not (ismember (0, f_x1))) ## The interval evaluation of f over x1 proves that there are no roots ## or x1 is empty continue endif if (isentire (f_x1) || ... wid (f_x1) / max (realmin (), wid (x1)) < pow2 (-20)) ## Slow convergence detected, cancel iteration soon options.MaxIter = options.MaxIter / 1.5; endif if (eq (x1, x0) || stepcount >= options.MaxIter || wid (x1) <= options.TolX || wid (f_x1) <= options.TolFun) ## Stop recursion if result is accurate enough or if no improvement [newl, newu] = deal (x1.inf, x1.sup); else [newl, newu] = findroots (f, df, x1, stepcount + 1, options); endif if (not (isempty (newl))) if (isempty (l)) l = newl; u = newu; elseif (u (end) == newl (1)) ## Merge intersecting intervals u (end) = newu (1); l = [l; newl(2 : end, 1)]; u = [u; newu(2 : end, 1)]; else l = [l; newl]; u = [u; newu]; endif endif endfor endfunction %!test "from the documentation string"; %! f = @(x) cos (x); %! df = @(x) -sin (x); %! zeros = fzero (f, infsup ("[-10, 10]"), df); %! assert (all (subset (pi * (-2.5:1:2.5)', zeros))); %! assert (max (rad (zeros)) < 8 * eps); %! sqr = @(x) x .^ 2; %! zeros = fzero (sqr, infsup ("[Entire]")); %! assert (all (subset (0, zeros))); %! assert (max (rad (zeros)) < eps); interval-2.1.0/inst/@infsup/gamma.m0000644000000000000000000001535513031036767015324 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} gamma (@var{X}) ## ## Compute the gamma function. ## ## @tex ## $$ ## {\rm gamma} (x) = \int_0^\infty t^(x-1) \exp (-t) dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## ∞ ## / ## gamma (x) = | t^(x - 1) * exp (-t) dt ## / ## 0 ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a valid enclosure. The result is tightest for ## @var{X} >= -10. ## ## @example ## @group ## gamma (infsup (1.5)) ## @result{} ans ⊂ [0.88622, 0.88623] ## @end group ## @end example ## @seealso{@@infsup/psi, @@infsup/gammaln, @@infsup/factorial} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-01 function result = gamma (x) if (nargin ~= 1) print_usage (); return endif ## Positive x ================================================================= ## https://oeis.org/A030169 persistent x_min_inf = 1.4616321449683623; persistent x_min_sup = 1.4616321449683624; ## Both gamma (infsup (x_min_inf)) and gamma (infsup (x_min_sup)) contain ## the exact minimum value of gamma. Thus we can simply split the function's ## domain in half and assume that each is strictly monotonic. l = inf (size (x.inf)); u = -l; ## Monotonically decreasing for x1 x1 = intersect (x, infsup (0, x_min_sup)); select = not (isempty (x1)) & x1.sup > 0; if (any (select(:))) x1.inf(x1.inf == 0) = 0; # fix negative zero l(select) = mpfr_function_d ('gamma', -inf, x1.sup(select)); u(select) = mpfr_function_d ('gamma', +inf, x1.inf(select)); endif ## Monotonically increasing for x2 x2 = intersect (x, infsup (x_min_inf, inf)); select = not (isempty (x2)); if (any (select(:))) l(select) = mpfr_function_d ('gamma', -inf, x2.inf(select)); u(select) = max (u(select), ... mpfr_function_d ('gamma', +inf, x2.sup(select))); endif pos = infsup (); pos.inf = l; pos.sup = u; ## Negative x ================================================================= x = intersect (x, infsup (-inf, 0)); u = inf (size (x.inf)); l = -u; nosingularity = floor (x.inf) + 1 == ceil (x.sup); if (any (nosingularity(:))) negative_value = nosingularity & mod (ceil (x.sup), 2) == 0; positive_value = nosingularity & not (negative_value); x.sup(x.sup == 0) = -0; # fix negative zero psil = psiu = zeros (size (x.inf)); psil(nosingularity) = mpfr_function_d ('psi', 0, x.inf(nosingularity)); psil(isnan (psil)) = -inf; psiu(nosingularity) = mpfr_function_d ('psi', 0, x.sup(nosingularity)); psiu(isnan (psiu)) = inf; encloses_extremum = false (size (x.inf)); encloses_extremum(nosingularity) = ... psil(nosingularity) <= 0 & psiu(nosingularity) >= 0; encloses_extremum(x.sup == x.inf + 1) = true (); select = encloses_extremum & negative_value & ... fix (x.inf) ~= x.inf & fix (x.sup) ~= x.sup; if (any (select(:))) l(select) = min (mpfr_function_d ('gamma', -inf, x.inf(select)), ... mpfr_function_d ('gamma', -inf, x.sup(select))); endif select = encloses_extremum & positive_value & ... fix (x.inf) ~= x.inf & fix (x.sup) ~= x.sup; if (any (select(:))) u(select) = max (mpfr_function_d ('gamma', +inf, x.inf(select)), ... mpfr_function_d ('gamma', +inf, x.sup(select))); endif select = not (encloses_extremum) & negative_value; u(select) = -inf; select = not (encloses_extremum) & positive_value; l(select) = inf; select = nosingularity & not (encloses_extremum); if (any (select(:))) l(select) = min (l(select), ... min (mpfr_function_d ('gamma', -inf, x.inf(select)), ... mpfr_function_d ('gamma', -inf, x.sup(select)))); u(select) = max (u(select), ... max (mpfr_function_d ('gamma', +inf, x.inf(select)), ... mpfr_function_d ('gamma', +inf, x.sup(select)))); endif select = encloses_extremum & negative_value; if (any (select(:))) u(select) = find_extremum (x.inf(select), x.sup(select)); endif select = encloses_extremum & positive_value; if (any (select(:))) l(select) = find_extremum (x.inf(select), x.sup(select)); endif endif emptyresult = (x.inf == x.sup & fix (x.inf) == x.inf & x.inf <= 0) | x.inf > 0; l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; neg = infsup (); neg.inf = l; neg.sup = u; ## ============================================================================ result = union (pos, neg); endfunction function y = find_extremum (l, u) ## Compute the extremum's value of gamma between l and u. l and u are negative ## and lie between two subsequent integral numbers. y = zeros (size (l)); # inaccurate, but already correct ## Tightest values for l >= -10 n = floor (l); y(n == -1) = -3.544643611155005; y(n == -2) = 2.3024072583396799; y(n == -3) = -.8881363584012418; y(n == -4) = .24512753983436624; y(n == -5) = -.052779639587319397; y(n == -6) = .009324594482614849; y(n == -7) = -.001397396608949767; y(n == -8) = 1.8187844490940416e-4; y(n == -9) = -2.0925290446526666e-5; y(n == -10) = 2.1574161045228504e-6; ## From Euler's reflection formula it follows: ## gamma (-x) = pi / ( sin (pi * (x + 1)) * gamma (x + 1) ) ## ## The extremum is located at -x = n + epsilon, ## where epsilon < 0.3 for n <= -10. Thus, we can estimate ## abs (pi / sin (pi * (x + 1))) >= 3.88 for n <= -10. ## Also it holds gamma (x + 1) = gamma (-n - epsilon + 1) <= gamma (-n + 1). ## ## Now, altogether we can estimate: abs (gamma (-x)) >= 3.88 / gamma (-n + 1) ## for n <= -10 remaining_estimates = n < -10; if (any (remaining_estimates(:))) y(remaining_estimates) = ... (-1) .^ (rem (n(remaining_estimates), 2) == -1) * ... mpfr_function_d ('rdivide', -inf, 3.88, ... mpfr_function_d ('gamma', +inf, -n(remaining_estimates) + 1)); endif endfunction %!# from the documentation string %!assert (gamma (infsup (1.5)) == "[0x1.C5BF891B4EF6Ap-1, 0x1.C5BF891B4EF6Bp-1]"); interval-2.1.0/inst/@infsup/gammaln.m0000644000000000000000000000631213031036767015647 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} gammaln (@var{X}) ## ## Compute the logarithm of the gamma function for positive arguments. ## ## @tex ## $$ ## {\rm gammaln} (x) = \log \int_0^\infty t^{x-1} \exp (-t) dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## ∞ ## / ## gammaln (x) = log | t^(x-1) exp (-t) dt ## / ## 0 ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## gammaln (infsup (1.5)) ## @result{} ans ⊂ [-0.12079, -0.12078] ## @end group ## @end example ## @seealso{@@infsup/psi, @@infsup/gamma, @@infsup/factorial} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-28 function x = gammaln (x) if (nargin ~= 1) print_usage (); return endif ## The gamma function is also defined for negative, non-integral arguments and ## its logarithm would be defined for −2n <= x <= −2n+1. ## However, we only compute the function for x > 0. ## https://oeis.org/A030169 persistent x_min_inf = 1.4616321449683623; persistent x_min_sup = 1.4616321449683624; ## Both gammaln (infsup (x_min_inf)) and gammaln (infsup (x_min_sup)) contain ## the exact minimum value of gammaln. Thus we can simply split the function's ## domain in half and assume that each is strictly monotonic. l = inf (size (x.inf)); u = -l; ## Monotonically decreasing for x1 x1 = intersect (x, infsup (0, x_min_sup)); select = not (isempty (x1)) & x1.sup > 0; if (any (select(:))) x1.inf(x1.inf == 0) = 0; # fix negative zero l(select) = mpfr_function_d ('gammaln', -inf, x1.sup(select)); u(select) = mpfr_function_d ('gammaln', +inf, x1.inf(select)); endif ## Monotonically increasing for x2 x2 = intersect (x, infsup (x_min_inf, inf)); select = not (isempty (x2)); if (any (select(:))) l(select) = mpfr_function_d ('gammaln', -inf, x2.inf(select)); u(select) = max (u (select), ... mpfr_function_d ('gammaln', +inf, x2.sup(select))); endif l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!assert (gammaln (infsup (-inf, inf)) == "[-0x1.F19B9BCC38A42p-4, +Inf]"); %!# from the documentation string %!assert (gammaln (infsup (1.5)) == "[-0x1.EEB95B094C192p-4, -0x1.EEB95B094C191p-4]"); %!# correct use of signed zeros %!test %! x = gammaln (infsup (1)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = gammaln (infsup (2)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/gauss.m0000644000000000000000000001577613031036767015373 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{x} =} gauss (@var{A}, @var{b}) ## ## Solve a linear interval system @var{A} * @var{x} = @var{b} using Gaussian ## elimination. ## ## The found enclosure is improved with the help of the Gauß-Seidel-method. ## ## Note: This algorithm is very inaccurate and slow for matrices of a dimension ## greater than 3. A better solver is provided by @code{mldivide}. The ## inaccuracy mainly comes from the dependency problem of interval arithmetic ## during back-substitution of the solution's enclosure. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## gauss (infsup ([1, 0; 0, 2]), [2, 0; 0, 4]) ## @result{} ans = 2×2 interval matrix ## [2] [0] ## [0] [2] ## @end group ## @end example ## @seealso{@@infsup/mldivide} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-31 function result = gauss (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); endif if (isscalar (x) || isscalar (y)) result = rdivide (y, x); return endif ## x must be square assert (size (x.inf, 1) == size (x.inf, 2), ... "gauss: nonconformant arguments, X is not square"); ## vertical sizes of x and y must equal assert (rows (x.inf) == rows (y.inf), ... "gauss: nonconformant arguments, first dimension mismatch"); n = length (x.inf); m = columns (y.inf); ## We have to compute z = inv (x) * y. ## This can be done by Gaußian elimination by solving the following equation ## for the variable z: x * z = y ## Step 1: Perform LUP decomposition of x into triangular matrices L, U and ## permutation matrix P ## P * x = L * U [L, U, P] = lu (x); ## Step 2: Forward substitution ## Solve L * s = inv (P) * y s = permute (inv (P), y); curelement.type = prevvars.type = "()"; for i = 1 : m ## Special case: k == 1 ## s (k, i) already is correct for k = 2 : n curelement.subs = {k, i}; prevvars.subs = {1 : k, i}; varcol = subsref (s, prevvars); Lrow = subsref (L, substruct ("()", {k, 1 : k})); ## We have to subtract varcol (1 : (k - 1)) * Lrow (1 : (k - 1)) from ## s (k, i). Since varcol (k) == s (k, i), we can simply set ## Lrow (k) = -1 and the dot product will compute the difference for us ## with high accurracy. Lrow.inf(k) = Lrow.sup(k) = -1; ## Then, we only have to flip the sign afterwards. s = subsasgn (s, curelement, -dot (Lrow, varcol)); endfor endfor ## Step 3: Backward substitution ## Solve U * z = s z = s; Urowstart.type = Urowrest.type = "()"; for i = 1 : m ## Special case: k == n curelement.subs = {n, i}; Urowstart.subs = {n, n}; z = subsasgn (z, curelement, ... mulrev (subsref (U, Urowstart), subsref (z, curelement))); for k = (n - 1) : -1 : 1 curelement.subs = {k, i}; Urowstart.subs = {k, k}; prevvars.subs = {k : n, i}; Urowrest.subs = {k, k : n}; varcol = subsref (z, prevvars); Urow = subsref (U, Urowrest); ## Use the same trick like above during forward substitution. Urow.inf(1) = Urow.sup(1) = -1; ## Additionally we must divide the element by the current diagonal ## element of U. z = subsasgn (z, curelement, ... mulrev (subsref (U, Urowstart), -dot (Urow, varcol))); endfor endfor ## Now we have solved inv (P) * L * U * z = y for z. ## ## The current result for z is only a rough estimation in general, because ## inv (P) * L * U is only an enclosure of the original linear interval ## system x * z = y and the Gaußian elimination above introduces several ## inaccuracies because of aggregated intermediate results and accumulated ## rounding errors. ## ## We can further try to improve the boundaries of the result with the original ## linear system. This is an iterative method using the mulrev operation. It ## is quite accurate in each step, because it only depends on one (tightest) ## dot operation and one (tightest) mulrev operation. However, the convergence ## speed is slow and each cycle is costly, so we have to cancel after one ## iteration. ## ## The method used here is similar to the Gauß-Seidel-method. Instead of ## diagonal elements of the matrix we use an arbitrary element that does not ## contain zero as an inner element. migx = mig (x); migx (isnan (migx)) = 0; for k = 1 : m zcol = subsref (z, substruct ("()", {1 : n, k})); for j = n : -1 : 1 z_jk = subsref (zcol, substruct ("()", {j})); if (isempty (z_jk) || issingleton (z_jk)) ## No improvement can be achieved. continue endif i = find (migx(:, j) == max (migx(:, j)), 1); xrow = subsref (x, substruct ("()", {i, 1 : n})); if (xrow.inf(j) < 0 && xrow.sup(j) > 0) ## No improvement can be achieved. continue endif x_ij = subsref (xrow, substruct ("()", {j})); yelement = subsref (y, substruct ("()", {i, k})); ## x(i, 1 : n) * z(1 : n, k) shall equal y(i, k). ## 1. Solve this equation for x(i, j) * z(j, k). ## 2. Compute a (possibly better) enclosure for z(j, k). xrow.inf(j) = yelement.inf; xrow.sup(j) = yelement.sup; zcol.inf(j) = zcol.sup(j) = -1; z_jk = mulrev (x_ij, -dot (xrow, zcol), z_jk); zcol.inf(j) = z.inf(j, k) = z_jk.inf; zcol.sup(j) = z.sup(j, k) = z_jk.sup; endfor endfor result = z; endfunction ## Apply permutation matrix P to an interval matrix: B = P * A. ## This is much faster than a matrix product, because the matrix product would ## use a lot of dot products. function B = permute (P, A) ## Note: [B.inf, B.sup] = deal (P * A.inf, P * A.sup) is not possible, ## because empty or unbound intervals would create NaNs during ## multiplication with P. B = A; for i = 1 : rows (P) targetrow = find (P(i, :) == 1, 1); B.inf(targetrow, :) = A.inf(i, :); B.sup(targetrow, :) = A.sup(i, :); endfor endfunction %!# from the documentation string %!assert (gauss (infsup ([1, 0; 0, 2]), [2, 0; 0, 4]) == [2, 0; 0, 2]); interval-2.1.0/inst/@infsup/ge.m0000644000000000000000000000240513031036767014625 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} ge (@var{A}, @var{B}) ## @defopx Operator {@@infsup} {@var{A} >= @var{B}} ## ## Compare intervals @var{A} and @var{B} for weakly greater. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsup/eq, @@infsup/le, @@infsup/gt} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-07 function result = ge (a, b) if (nargin ~= 2) print_usage (); return endif result = le (b, a); endfunction %!assert (ge (infsup (2, 3), infsup (1, 3))); interval-2.1.0/inst/@infsup/gt.m0000644000000000000000000000247213031036767014650 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} gt (@var{A}, @var{B}) ## @defopx Operator {@@infsup} {@var{A} > @var{B}} ## ## Compare intervals @var{A} and @var{B} for strict greater. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsup/eq, @@infsup/lt, @@infsup/ge} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-07 function result = gt (a, b) if (nargin ~= 2) print_usage (); return endif result = lt (b, a); endfunction %!assert (not (gt (infsup (2, 3), infsup (1, 3)))); %!assert (gt (infsup (2, 3.1), infsup (1, 3))); interval-2.1.0/inst/@infsup/hdist.m0000644000000000000000000000517313031036767015352 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} hdist (@var{X}, @var{Y}) ## ## Compute the Hausdorff distance between two intervals as sets. ## ## The Hausdorff distance for closed real intervals is the maximum distance ## between both pairs of interval boundaries. ## ## If any interval is empty, the result is NaN. For interval matrices the ## result is computed entry-wise. ## ## Accuracy: The result is correctly-rounded (towards infinity). ## ## @example ## @group ## hdist (infsup (1, 6), infsup (2, 8)) ## @result{} ans = 2 ## @end group ## @end example ## @seealso{@@infsup/sdist, @@infsup/idist} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-06-11 function result = hdist (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); endif ## Resize, if scalar × matrix if (not (size_equal (x.inf, y.inf))) x.inf = ones (size (y.inf)) .* x.inf; x.sup = ones (size (y.inf)) .* x.sup; y.inf = ones (size (x.inf)) .* y.inf; y.sup = ones (size (x.inf)) .* y.sup; endif result = zeros (size (x.inf)); select = x.inf < y.inf; if (any (select(:))) result(select) = ... mpfr_function_d ('minus', +inf, y.inf(select), x.inf(select)); endif select = x.inf > y.inf; if (any (select(:))) result(select) = max (result(select), ... mpfr_function_d ('minus', +inf, x.inf(select), y.inf(select))); endif select = x.sup < y.sup; if (any (select(:))) result(select) = max (result(select), ... mpfr_function_d ('minus', +inf, y.sup(select), x.sup(select))); endif select = x.sup > y.sup; if (any (select(:))) result(select) = max (result(select), ... mpfr_function_d ('minus', +inf, x.sup(select), y.sup(select))); endif result(isempty (x) | isempty (y)) = nan (); endfunction %!# from the documentation string %!assert (hdist (infsup (1, 6), infsup (2, 8)), 2); interval-2.1.0/inst/@infsup/horzcat.m0000644000000000000000000000277713031036767015720 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} horzcat (@var{ARRAY1}, @var{ARRAY2}, @dots{}) ## @defopx Operator {@@infsup} {[@var{ARRAY1}, @var{ARRAY2}, @dots{}]} ## ## Return the horizontal concatenation of interval array objects along ## dimension 2. ## ## @example ## @group ## a = infsup (2, 5); ## [a, a, a] ## @result{} ans = 1×3 interval vector ## [2, 5] [2, 5] [2, 5] ## @end group ## @end example ## @seealso{@@infsup/vertcat} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-29 function result = horzcat (varargin) result = cat (2, varargin{:}); endfunction %!assert (horzcat (infsup (1), infsup (2)) == infsup (horzcat (1, 2))); %!test %! # from the documentation string %! a = infsup (2, 5); %! assert (horzcat (a, a, a) == infsup ([2, 2, 2], [5, 5, 5])); interval-2.1.0/inst/@infsup/hypot.m0000644000000000000000000000356013031036767015400 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} hypot (@var{X}, @var{Y}) ## ## Compute the euclidean norm. ## ## @code{hypot (@var{x}, @var{y}) = sqrt (@var{x}^2 + @var{y}^2)} ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsup (2, 3); ## y = infsup (1, 2); ## hypot (x, y) ## @result{} ans ⊂ [2.236, 3.6056] ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-20 function x = hypot (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); endif l = mpfr_function_d ('hypot', -inf, mig (x), mig (y)); u = mpfr_function_d ('hypot', +inf, mag (x), mag (y)); emptyresult = isempty (x) | isempty (y); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (hypot (infsup (2, 3), infsup (1, 2)) == "[0x1.1E3779B97F4A7p1, 0x1.CD82B446159F4p1]"); %!# correct use of signed zeros %!test %! x = hypot (infsup (0), infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/idist.m0000644000000000000000000000472613031036767015356 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} idist (@var{X}, @var{Y}) ## ## Compute the inner distance between two intervals as sets. ## ## The inner distance for closed real intervals is the minimum distance ## between each pair of numbers. That is, the inner distance equals zero if ## a number can be found in both intervals. Otherwise the inner distance is ## the size of the gap between both intervals on the real number lane. ## ## If any interval is empty, the result is NaN. For interval matrices the ## result is computed entry-wise. ## ## Accuracy: The result is correctly-rounded (towards infinity). ## ## @example ## @group ## idist (infsup (0, 6), infsup (7, 20)) ## @result{} ans = 1 ## @end group ## @end example ## @seealso{@@infsup/sdist, @@infsup/hdist} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-06-11 function result = idist (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); endif ## Resize, if scalar × matrix if (not (size_equal (x.inf, y.inf))) x.inf = ones (size (y.inf)) .* x.inf; x.sup = ones (size (y.inf)) .* x.sup; y.inf = ones (size (x.inf)) .* y.inf; y.sup = ones (size (x.inf)) .* y.sup; endif result = zeros (size (x.inf)); select = x.sup < y.inf; if (any (select(:))) result(select) = ... mpfr_function_d ('minus', +inf, y.inf(select), x.sup(select)); endif select = x.inf > y.sup; if (any (select(:))) result(select) = max (result(select), ... mpfr_function_d ('minus', +inf, x.inf(select), y.sup(select))); endif result(isempty (x) | isempty (y)) = nan (); endfunction %!# from the documentation string %!assert (idist (infsup (0, 6), infsup (7, 20)), 1); interval-2.1.0/inst/@infsup/inf.m0000644000000000000000000000263713031036767015015 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} inf (@var{X}) ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## ## Get the (greatest) lower boundary for all numbers of interval @var{X}. ## ## If @var{X} is empty, @code{inf (@var{X})} is positive infinity. ## ## Accuracy: The result is exact. ## ## @example ## @group ## inf (infsup (2.5, 3.5)) ## @result{} ans = 2.5000 ## @end group ## @end example ## @seealso{@@infsup/sup, @@infsup/mid} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-27 function result = inf (x) if (nargin ~= 1) print_usage (); return endif result = x.inf; endfunction %!# from the documentation string %!assert (inf (infsup (2.5, 3.5)), 2.5); interval-2.1.0/inst/@infsup/infsup.m0000644000000000000000000013342713031036767015547 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypeop Constructor {@@infsup} {[@var{X}, @var{ISEXACT}] =} infsup () ## @deftypeopx Constructor {@@infsup} {[@var{X}, @var{ISEXACT}] =} infsup (@var{M}) ## @deftypeopx Constructor {@@infsup} {[@var{X}, @var{ISEXACT}] =} infsup (@var{S}) ## @deftypeopx Constructor {@@infsup} {[@var{X}, @var{ISEXACT}] =} infsup (@var{L}, @var{U}) ## ## Create an interval (from boundaries). Convert boundaries to double ## precision. ## ## The syntax without parameters creates an (exact) empty interval. The syntax ## with a single parameter @code{infsup (@var{M})} equals ## @code{infsup (@var{M}, @var{M})}. The syntax @code{infsup (@var{S})} parses ## an interval literal in inf-sup form or as a special value, where ## @code{infsup ("[S1, S2]")} is equivalent to @code{infsup ("S1", "S2")}. A ## second, logical output @var{ISEXACT} indicates if @var{X}'s boundaries both ## have been converted without precision loss. ## ## Each boundary can be provided in the following formats: literal constants ## [+-]inf[inity], e, pi; scalar real numeric data types, i. e., double, ## single, [u]int[8,16,32,64]; or decimal numbers as strings of the form ## [+-]d[,.]d[[eE][+-]d]; or hexadecimal numbers as string of the form ## [+-]0xh[,.]h[[pP][+-]d]; or decimal numbers in rational form ## [+-]d/d. ## ## Also it is possible, to construct intervals from the uncertain form in the ## form @code{m?ruE}, where @code{m} is a decimal mantissa, ## @code{r} is empty (= half ULP) or a decimal integer ULP count or a ## second @code{?} character for unbounded intervals, @code{u} is ## empty or a direction character (u: up, d: down), and @code{E} is an ## exponential field. ## ## If decimal or hexadecimal numbers are no binary64 floating point numbers, a ## tight enclosure will be computed. int64 and uint64 numbers of high ## magnitude (> 2^53) can also be affected from precision loss. ## ## For the creation of interval matrices, arguments may be provided as (1) cell ## arrays with arbitrary/mixed types, (2) numeric matrices, or (3) strings. ## Scalar values do broadcast. ## ## Non-standard behavior: This class constructor is not described by IEEE Std ## 1788-2015, IEEE standard for interval arithmetic, however it implements both ## standard functions numsToInterval and textToInterval for bare intervals. ## ## @example ## @group ## infsup () ## @result{} ans = [Empty] ## infsup ("[1]") ## @result{} ans = [1] ## infsup (2, 3) ## @result{} ans = [2, 3] ## infsup ("0.1") ## @result{} ans ⊂ [0.099999, 0.10001] ## infsup ("0.1", "0.2") ## @result{} ans ⊂ [0.099999, 0.20001] ## infsup ("0xff", "0x1.ffp14") ## @result{} ans = [255, 32704] ## infsup ("1/3") ## @result{} ans ⊂ [0.33333, 0.33334] ## infsup ("[1/9, 47/11]") ## @result{} ans ⊂ [0.11111, 4.2728] ## infsup ("7.3?9u") ## @result{} ans ⊂ [7.2999, 8.2001] ## infsup ("0??") ## @result{} ans = [Entire] ## infsup ("911??de-2") ## @result{} ans ⊂ [-Inf, +9.1101] ## infsup ("10?") ## @result{} ans = [9.5, 10.5] ## @end group ## @end example ## @seealso{exacttointerval} ## @end deftypeop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-27 function [x, isexact, overflow, isnai] = infsup (l, u) persistent scalar_empty_interval = class (struct ("inf", inf, ... "sup", -inf), ... "infsup"); ## Part 1 ## ## Split any arguments into l and u, where l and u denote lower and upper ## boundaries. l and u shall be either numeric arrays or cell arrays with ## strings or numeric entries. The size of l and u will equal the interval ## matrix size of the final result (unless broadcasting is going to be applied ## as a very last step). ## ## Strings in l and u will be normalized, that is, trimmed and converted to ## lower case. switch nargin case 0 ## empty interval x = scalar_empty_interval; isexact = true; isnai = overflow = false; return case 1 if (isa (l, "infsup")) ## already an interval—nothing to be done x = l; isexact = true (); isnai = overflow = false (size (l.inf)); return endif if (ischar (l)) ## Character string may contain a vector or a matrix of intervals, ## split the interval literals into a cell array of strings. ## Interval literals will be trimmed by the split function. l = __split_interval_literals__ (lower (l)); char_idx = true (size (l)); elseif (iscell (l)) ## Make sure that in a cell array (with possibly mixed types) all ## strings are trimmed. This is required during splitting of ## interval literals into lower and upper bounds. char_idx = cellfun ("ischar", l); l(char_idx) = lower (strtrim (l(char_idx))); else ## Not cell or char, e. g. numeric matrix. ## Syntax infsup (x) has to be equivalent with infsup (x, x). ## No need to trim or normalize character case. u = l; endif ## Correct construction of empty intervals is only possible by calling ## this constructor without arguments (see above), or by using one of ## the two interval literals [] or [empty]. ## Otherwise, construction of empty intervals must signal ## “UndefinedOperation”. ## In particular, the interval literal [+inf, -inf] is illegal and ## “numsToInterval (+inf, -inf)” would be an illegal function call, ## according to IEEE Std 1788-2015. ## ## 1. isnai defaults to -1 (unknown). ## 2. any non-empty interval (l <= u) is legal and we set isnai to ## false for those in the end. ## 3. for legal empty interval literals we set isnai = false ## explicitly. ## 4. for certain illegal interval literals we give a special warning ## and set isnai = true explicitly. ## 5. it remains isnai = -1 for any illegal intervals which have not ## been handled with, we give a warning and we return an empty ## interval in these cases. isnai = -ones (size (l), "int8"); illegal_boundary = struct ("inf", false (size (l)), ... "sup", false (size (l))); if (iscell (l)) ## At this point, only a cell array can contain interval literals ## as string. Split intervals and interval literals into lower and ## upper bounds. Except for empty intervals, strings are not ## converted into numeric values yet. ## ## [] -> (+inf, -inf) ## [empty] -> (+inf, -inf) ## [entire] -> (, ) ## [,] -> (, ) ## [l, u] -> (l, u) ## [m] -> (m, m) ## m -> (m, m) ## m?r -> (m?r, m?r) ## m?ru -> (m, m?r) ## m?rd -> (m?r, m) ## m?? -> (, ) ## m??u -> (m, ) ## m??d -> (, m) ## Initialize u such that the syntax infsup (x) is equivalent with ## infsup (x, x) unless interval literals are used. u = l; ## Find interval literals with square brackets. The strings are ## trimmed already, so they will start at the first character. square_bracket_idx = strncmp (l, "[", 1); %!# Verify correct behaviour of strncmp for empty strings and non-string %!# values within the cell array. %!assert (strncmp ({"[", double("["), ""}, "[", 1), logical ([1 0 0])); ## A bare interval literal which starts with a square bracket ## must end with a square bracket as well. square_bracket_idx = ... find (square_bracket_idx)(... cellfun (@(s) s(end) == "]", ... l(square_bracket_idx))); ## Strip square brackets and white space within square brackets. nobrackets = strtrim (cellfun (@(s) s([2 : (end - 1)]), ... l(square_bracket_idx), ... "UniformOutput", false)); ## Construction of empty intervals with the correct literal either ## [empty] or [] is legit. empty_interval_local_idx = strcmp (nobrackets, "empty") ... | cellfun ("isempty", nobrackets); empty_interval_idx = square_bracket_idx(empty_interval_local_idx); isnai(empty_interval_idx) = false; ## We remove the empty interval cases from the current work basket ## and don't need special handling of comma-less strings below ## ([] represents the empty interval, whereas [,] represents the ## set of all real numbers). square_bracket_idx = ... square_bracket_idx(not (empty_interval_local_idx)); nobrackets = nobrackets(not (empty_interval_local_idx)); char_idx(empty_interval_idx) = false; l(empty_interval_idx) = +inf; u(empty_interval_idx) = -inf; ## [entire] is equivalent to [,] nobrackets(strcmp (nobrackets, "entire")) = {""}; ## Split [l, u] literals into l and u strings at the comma. nobrackets = cellfun ("strsplit", nobrackets, {","}, ... "UniformOutput", false); nobrackets_parts = cellfun ("numel", nobrackets); ## For point intervals [m] we have removed the square brackets, ## trimmed any white space inside the square brackets and must ## store m into both l and u for further parsing below. ## Each boundary will be parsed individually with opposite rounding ## direction. point_interval_local_idx = (nobrackets_parts == 1); point_interval_idx = square_bracket_idx(point_interval_local_idx); l(point_interval_idx) = u(point_interval_idx) = ... vertcat ({}, nobrackets(point_interval_local_idx){:}); ## For infsup intervals [l, u] we can store the trimmed l and u ## strings for further parsing below. infsup_interval_local_idx = (nobrackets_parts == 2); infsup_interval_idx = square_bracket_idx(infsup_interval_local_idx); l(infsup_interval_idx) = strtrim (vertcat ({}, ... cellindexmat (nobrackets(infsup_interval_local_idx), 1){:})); u(infsup_interval_idx) = strtrim (vertcat ({}, ... cellindexmat (nobrackets(infsup_interval_local_idx), 2){:})); ## Find interval literals in uncertain form. uncertain_idx = char_idx; uncertain_idx(square_bracket_idx) = false; # already processed ## Find uncertain form with directed uncertainty (down or up) [~, ~, ~, ~, groups] = regexp (l(uncertain_idx), ... ["([^?]+)", ... # 1: mantissa "([?])", ... # 2: ? "(.*)", ... # 3: uncertainty "([du])", ... # 4: direction "(.*)"]); # 5: exponent directed_local_idx = not (cellfun ("isempty", groups)); directed_uncertain_idx = uncertain_idx; directed_uncertain_idx(uncertain_idx) = directed_local_idx; groups = vertcat ({}, groups(directed_local_idx){:}); ## Remove directed down/up uncertainty. for direction = ["d", "u"] direction_local_idx = strcmp (... vertcat ({}, cellindexmat (groups, 4){:}), ... direction); direction_idx = directed_uncertain_idx; direction_idx(directed_uncertain_idx) = direction_local_idx; ## Remove direction character persistent join_groups = @(parts) strcat (parts{:}); undirected_uncertain_form = ... cellfun (... join_groups, ... cellindexmat (groups(direction_local_idx), ... [1 2 3 5]), ... "UniformOutput", false); ## Also remove uncertainty undirected_certain_form = ... cellfun (... join_groups, ... cellindexmat (groups(direction_local_idx), ... [1 5]), ... "UniformOutput", false); ## Store uncertain boundaries without directed uncertainty switch direction case "d" l(direction_idx) = undirected_uncertain_form; u(direction_idx) = undirected_certain_form; case "u" l(direction_idx) = undirected_certain_form; u(direction_idx) = undirected_uncertain_form; endswitch ## Remove parsed uncertain form from work basket to prevent ## double parsing (strings with both d and u uncertainty). directed_uncertain_idx(direction_idx) = false; groups = groups(not (direction_local_idx)); endfor ## Remove unbound uncertainty ?? ## FIXME We should verify correctness of the interval literal more ## thoroughly. Otherwise we would ignore illegal literals which ## contain the double question mark. l_unbound_idx = uncertain_idx; l_unbound_idx(uncertain_idx) = ... not (cellfun ("isempty", strfind (l(uncertain_idx), "??"))); l(l_unbound_idx) = {""}; u_unbound_idx = uncertain_idx; u_unbound_idx(uncertain_idx) = ... not (cellfun ("isempty", strfind (u(uncertain_idx), "??"))); u(u_unbound_idx) = {""}; endif case 2 ## Split interval vectors if supplied as strings. if (ischar (l)) l = __split_interval_literals__ (l); endif if (ischar (u)) u = __split_interval_literals__ (u); endif ## Check dimensions and whether broadcasting is possible for dim = 1 : max (ndims (l), ndims (u)) if (size (l, dim) != 1 && size (u, dim) != 1 && ... size (l, dim) != size (u, dim)) warning ("interval:InvalidOperand", ... ["infsup: Dimensions of lower and upper ", ... "boundaries are not compatible"]); ## Unable to recover from this kind of error x = scalar_empty_interval; isexact = false; overflow = false; isnai = true; return endif endfor ## Compute result size after broadcasting and mark any empty intervals ## as illegal (will trigger “UndefinedOperation” signal later on). ## Construction of silent empty intervals is impossible with two args. isnai = zeros (size (l), "int8") - ones (size (u), "int8"); #-1=unknown illegal_boundary = struct ("inf", false (size (l)), ... "sup", false (size (u))); for argument = ["l", "u"] switch argument case "l" current_arg = l; case "u" current_arg = u; endswitch if (iscell (current_arg)) ## Normalize strings: trim and convert to lower case ## (as is done in the nargin == 1 case). char_idx = cellfun ("ischar", current_arg); current_arg(char_idx) = ... lower (strtrim (current_arg(char_idx))); ## In contrast to the nargin == 1 case we cannot allow interval ## literals here. Only simple boundaries are allowed if two ## arguments are given. square_bracket_idx = strncmp (current_arg, "[", 1); uncertain_idx = char_idx; uncertain_idx(square_bracket_idx) = false; uncertain_idx(uncertain_idx) = ... not (cellfun ("isempty", ... strfind (current_arg(uncertain_idx), "?"))); illegal_literal_idx = (square_bracket_idx | uncertain_idx); if (any (illegal_literal_idx(:))) switch argument case "l" warning ("interval:UndefinedOperation", ... "Lower boundary contains an interval literal"); current_arg(illegal_literal_idx) = +inf; illegal_boundary.inf(illegal_literal_idx) = true; case "u" warning ("interval:UndefinedOperation", ... "Upper boundary contains an interval literal"); current_arg(illegal_literal_idx) = -inf; illegal_boundary.sup(illegal_literal_idx) = true; endswitch endif switch argument case "l" l = current_arg; case "u" u = current_arg; endswitch endif endfor otherwise # nargin >= 3 print_usage (); return endswitch ## Part 2 ## ## Boundaries have been split into lower and upper boundaries and shall be ## converted to binary64 matrices with string parsing and outward rounding. ## ## l contains a cell array or a matrix of lower boundaries. ## u contains a cell array or a matrix of upper boundaries. ## ## Each of l and u will be converted into binary64 individually and will be ## stored in x.inf and x.sup respectively. isexact = true (); x = struct ("inf", inf (size (l)), ... "sup", -inf (size (u))); for [boundaries, key] = struct ("inf", {l}, "sup", {u}) if (isfloat (boundaries) && isreal (boundaries)) ## Simple case: the boundaries already are binary floating point ## numbers in single or double precision. ## This kind of operation is often used in internal functions and shall ## be fast. We check for NaNs later. x.(key) = double (boundaries); possiblyundefined.(key) = overflow.(key) = false (size (boundaries)); continue endif if (not (iscell (boundaries))) if (not (isnumeric (boundaries))) warning ("interval:InvalidOperand", ... ["infsup: Invalid argument type, only strings, ", ... "numerics, and cell arrays thereof are allowed"]); ## Unable to recover from this kind of error x = scalar_empty_interval; isexact = false; overflow = false; isnai = true; return endif boundaries = num2cell (boundaries); endif overflow.(key) = true (size (boundaries)); possiblyundefined.(key) = false (size (boundaries)); ## Track the entries in cell array boundaries, which haven't been ## converted yet. todo = true (size (boundaries)); ## [,] = [-inf, +inf] unbound_idx = cellfun ("isempty", boundaries); switch key case "inf" x.inf(unbound_idx) = -inf; case "sup" x.sup(unbound_idx) = +inf; endswitch overflow.(key)(unbound_idx) = false; todo(unbound_idx) = false; ## In the cell array each entry must represent a scalar value. non_scalar_entry_idx = todo & not (... cellfun ("isscalar", boundaries) | cellfun ("ischar", boundaries)); if (any (non_scalar_entry_idx(:))) warning ("interval:UndefinedOperation", ... "Cell arrays of matrix entries do not contain scalar values"); # Use default value of [empty] for these entries and continue todo(non_scalar_entry_idx) = false; illegal_boundary.(key)(non_scalar_entry_idx) = true; endif ## 64 bit integers: approximate in double precision. integer_idx = find (todo & ( ... cellfun ("isa", boundaries, {"uint64"}) ... | cellfun ("isa", boundaries, {"int64"}))); integers = vertcat (boundaries{integer_idx}); converted_integers = double (integers); exact_integer_local_idx = (converted_integers == integers); if (any (not (exact_integer_local_idx(:)))) isexact = false; possiblyundefined.(key)(integer_idx(not (exact_integer_local_idx))) ... = true; endif ## Fix conversion in cases where rounding to nearest has resulted in the ## wrong value, i. e., in a value that has not been rounded outward, ## but inward. switch key case "inf" wrong_round_local_idx = (converted_integers > integers); converted_integers(wrong_round_local_idx) = ... mpfr_function_d ('minus', -inf, ... converted_integers(wrong_round_local_idx), pow2 (-1074)); case "sup" wrong_round_local_idx = (converted_integers < integers); converted_integers(wrong_round_local_idx) = ... mpfr_function_d ('plus', +inf, ... converted_integers(wrong_round_local_idx), pow2 (-1074)); endswitch x.(key)(integer_idx) = converted_integers; overflow.(key)(integer_idx) = false; todo(integer_idx) = false; ## Lossless conversion from binary32, binary64, (u)int8, (u)int16, (u)int32 ## and logicals. real_idx = todo & ... ( ... ( ... cellfun ("isreal", boundaries) ... & cellfun ("isfloat", boundaries) ... ) ... | cellfun ("isinteger", boundaries) ... | cellfun ("islogical", boundaries) ); x.(key)(real_idx) = double (vertcat (boundaries{real_idx})); overflow.(key)(real_idx) = false; todo(real_idx) = false; ## Complex numbers: not allowed, will be mapped to [empty]. complex_idx = todo & cellfun ("iscomplex", boundaries); if (any (complex_idx(:))) warning ("interval:InvalidOperand", ... "infsup: Complex arguments are not permitted"); todo(complex_idx) = false; illegal_boundary.(key)(complex_idx) = true; endif ## Other kinds of parameters that are not strings char_idx = todo & cellfun ("ischar", boundaries); if (any ((todo & not (char_idx))(:))) warning ("interval:InvalidOperand", ... "infsup: Illegal boundary: must be numeric or string"); illegal_boundary.(key)(todo & not (char_idx)) = true; endif todo = char_idx; ## Hex strings hex_idx = find (todo & (strncmp (boundaries, "0x", 2) ... | strncmp (boundaries, "+0x", 3) ... | strncmp (boundaries, "-0x", 3))); switch key case "inf" direction = -inf; case "sup" direction = inf; endswitch for i = vec (hex_idx, 2) try [x.(key)(i), exact_conversion] = ... hex2double (boundaries{i}, direction); possiblyundefined.(key)(i) = not (exact_conversion); isexact = isexact && exact_conversion; catch warning ("interval:UndefinedOperation", lasterr ()); illegal_boundary.(key)(i) = true; end_try_catch endfor overflow.(key)(hex_idx) = false; todo(hex_idx) = false; ## Selected boundary literals persistent boundary_const = struct (... "inf", struct (... "-inf", -inf, ... "-infinity", -inf, ... "inf", inf, ... "+inf", inf, ... "infinity", inf, ... "+infinity", inf, ... "e", 0x56FC2A2 * pow2 (-25) ... + 0x628AED2 * pow2 (-52), ... "pi", 0x6487ED5 * pow2 (-25) ... + 0x442D180 * pow2 (-55)), ... "sup", struct (... "-inf", -inf, ... "-infinity", -inf, ... "inf", inf, ... "+inf", inf, ... "infinity", inf, ... "+infinity", inf, ... "e", 0x56FC2A2 * pow2 (-25) ... + 0x628AED4 * pow2 (-52), ... "pi", 0x6487ED5 * pow2 (-25) ... + 0x442D190 * pow2 (-55))); for [val, lit] = boundary_const.(key) const_idx = todo & strcmp (boundaries, lit); x.(key)(const_idx) = val; overflow.(key)(const_idx) = false; possiblyundefined.(key)(const_idx) = isfinite (val); todo(const_idx) = false; endfor ## It remains the decimal boundary strings for i = vec (find (todo), 2) try boundary = boundaries{i}; ## We have to parse a decimal string boundary and round the ## result up or down depending on the boundary ## (inf = down, sup = up). ## str2double will produce the correct answer in 50 % of ## all cases, because it uses rounding mode “to nearest”. ## The input and a double format approximation can be ## compared in a decimal floating point format without ## precision loss. if (strfind (boundary, "?")) ## Special case: uncertain-form [boundary, uncertain] = uncertainsplit (boundary); else uncertain = []; endif if (strfind (boundary, "/")) ## Special case: rational form boundary = strsplit (boundary, "/"); if (length (boundary) ~= 2) warning ("interval:UndefinedOperation", ... ["illegal " key " boundary: ", ... "rational form must have single slash"]); illegal_boundary.(key)(i) = true; continue; endif [decimal, remainder] = decimaldivide (... str2decimal (boundary{1}), ... str2decimal (boundary{2}), 18); if (not (isempty (remainder.m))) ## This will guarantee the enclosure of the exact ## value decimal.m(19, 1) = 1; isexact = false (); if (key == "inf") possiblyundefined.(key)(i) = true; endif endif ## Write result back into boundary for conversion to ## double boundary = ["0.", num2str(decimal.m)', ... "e", num2str(decimal.e)]; if (decimal.s) boundary = ["-", boundary]; endif else decimal = str2decimal (boundary); endif ## Parse and add uncertainty if (not (isempty (uncertain))) uncertain = str2decimal (uncertain); if ((key == "inf") == decimal.s) uncertain.s = decimal.s; else uncertain.s = not (decimal.s); endif decimal = decimaladd (decimal, uncertain); ## Write result back into boundary for conversion to ## double boundary = ["0.", num2str(decimal.m)', ... "e", num2str(decimal.e)]; if (decimal.s) boundary = ["-", boundary]; endif endif clear uncertain; ## Check if number is outside of range ## Realmax == 1.7...e308 == 0.17...e309 if (decimal.e > 309 || ... (decimal.e == 309 && ... decimal.s && ... decimalcompare (double2decimal (-realmax ()), ... decimal) > 0) || ... (decimal.e == 309 && ... not (decimal.s) && ... decimalcompare (double2decimal (realmax ()), ... decimal) < 0)) switch key case "inf" if (decimal.s) # -inf ... -realmax x.inf(i) = -inf; else # realmax ... inf x.inf(i) = realmax (); overflow.inf(i) = false; endif case "sup" if (decimal.s) # -inf ... -realmax x.sup(i) = -realmax (); overflow.sup(i) = false; else # realmax ... inf x.sup(i) = inf; endif endswitch possiblyundefined.(key)(i) = true; isexact = false; continue endif overflow.(key)(i) = false; ## Compute approximation, this only works between ± realmax binary = str2double (strrep (boundary, ",", ".")); ## Check approximation value comparison = decimalcompare (double2decimal (binary), ... decimal); if (comparison ~= 0) possiblyundefined.(key)(i) = true; isexact = false; endif if (comparison == 0 || ... # approximation is exact (comparison < 0 && key == "inf") || ... # lower bound (comparison > 0 && key == "sup")) # upper bound x.(key)(i) = binary; else ## Approximation is not exact and not rounded as needed ## However, because of faithful rounding the ## approximation is right next to the desired number. switch key case "inf" x.inf(i) = mpfr_function_d ('minus', -inf, ... binary, pow2 (-1074)); case "sup" x.sup(i) = mpfr_function_d ('plus', +inf, ... binary, pow2 (-1074)); endswitch endif catch warning ("interval:UndefinedOperation", lasterr ()); illegal_boundary.(key)(i) = true; end_try_catch endfor endfor ## Part 3 ## ## Check boundaries individually after conversion to double ## NaNs are illegal values for [boundary, key] = struct ("inf", {x.inf}, "sup", {x.sup}) nanvalue = isnan (boundary); if (any (nanvalue(:))) warning ("interval:UndefinedOperation", ... "input contains NaN values"); illegal_boundary.(key)(nanvalue) = true; endif endfor ## normalize boundaries: ## representation of the set containing only zero is always [-0,+0] x.inf(x.inf == 0) = -0; x.sup(x.sup == 0) = +0; ## Part 4 ## ## Broadcast boundaries and final checks if (nargout >= 3) overflow = overflow.inf | overflow.sup; overflow(x.inf > -inf & x.sup < inf) = false; endif x.inf = x.inf - zeros (size (x.sup)); x.sup = x.sup + zeros (size (x.inf)); possiblyundefined = possiblyundefined.inf & possiblyundefined.sup; if (any (possiblyundefined(:))) if (not (iscell (l)) && not (iscell (u))) ## infsup (x, x) or infsup (x) is not possibly undefined possiblyundefined(l == u) = false; else ## infsup ("x", "x") or infsup ("x") is not possibly undefined if (not (iscell (l))) l = num2cell (l); endif if (not (iscell (u))) u = num2cell (u); endif possiblyundefined(cellfun ("isequal", l, u)) = false; endif endif ## Non-empty intervals are always legal. isnai(x.inf <= x.sup) = false; ## Check for illegal boundaries [inf,inf] and [-inf,-inf]. illegal_inf_idx = not (isfinite (x.inf (x.inf == x.sup))); if (any (illegal_inf_idx(:))) warning ("interval:UndefinedOperation", ... "illegal interval boundaries: infimum = supremum = +/- infinity"); isnai(find (x.inf == x.sup)(illegal_inf_idx)) = true; endif ## Illegal boundaries make illegal intervals, ## we have triggered a warning already (see above). isnai(illegal_boundary.inf | illegal_boundary.sup) = true; ## Check boundary order ## isnai has been initialized with -1. Any non-empty or legal empty intervals ## have been set to 0. Any illegal interval literals or illegal boundaries ## have been set to +1. Any intervals with inf > sup still have their initial ## value of -1. wrong_boundary_order_idx = signbit (isnai); if (any (wrong_boundary_order_idx(:))) warning ("interval:UndefinedOperation", ... "illegal interval boundaries: infimum greater than supremum"); isnai(wrong_boundary_order_idx) = true; endif isnai = logical(isnai); ## Return [empty] for any illegal intervals. x.inf(isnai) = +inf; x.sup(isnai) = -inf; possiblyundefined(isnai) = false; isexact = isexact && not (any (isnai(:))); ## Check for possibly wrong boundary order. if (any (possiblyundefined(:))) ## Let a, b, and c be three consecutive floating point numbers. ## ## If a < u < b < l < c, then u and l will both be mapped to the same ## number b by outward rounding. ## ## If a < u < l < b, then u and l will both be mapped to consecutive ## floating point numbers a and b. if (any ((x.inf(possiblyundefined) == x.sup(possiblyundefined))(:)) ... || ... any ((max (-realmax, ... mpfr_function_d ('plus',... +inf, ... x.inf(possiblyundefined), ... pow2 (-1074))) == x.sup(possiblyundefined))(:))) warning ("interval:PossiblyUndefinedOperation", ... "infimum may be greater than supremum"); endif endif x = class (x, "infsup"); endfunction %!# Empty intervals %!test %! x = infsup (); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!test %! x = infsup ("[]"); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!test %! x = infsup ("[ ]"); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!test %! x = infsup ("[\t]"); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!test %! x = infsup ("[empty]"); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!test %! x = infsup ("[EMPTY]"); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!test %! x = infsup ("[ empty ]"); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!test %! x = infsup ("\t[\t Empty\t]\t"); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!# Entire interval %!test %! x = infsup ("[,]"); %! assert (inf (x), -inf); %! assert (sup (x), +inf); %!test %! x = infsup ("[entire]"); %! assert (inf (x), -inf); %! assert (sup (x), +inf); %!test %! x = infsup ("[ENTIRE]"); %! assert (inf (x), -inf); %! assert (sup (x), +inf); %!test %! x = infsup ("[ entire ]"); %! assert (inf (x), -inf); %! assert (sup (x), +inf); %!test %! x = infsup (" [Entire \t] "); %! assert (inf (x), -inf); %! assert (sup (x), +inf); %!test %! x = infsup ("[-inf,+inf]"); %! assert (inf (x), -inf); %! assert (sup (x), +inf); %!test %! x = infsup ("[-infinity, +infinity]"); %! assert (inf (x), -inf); %! assert (sup (x), +inf); %!test %! x = infsup ("[-INF, +INFinitY]"); %! assert (inf (x), -inf); %! assert (sup (x), +inf); %!# double boundaries %!test %! x = infsup (0); %! assert (inf (x), 0); %! assert (sup (x), 0); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = infsup (2, 3); %! assert (inf (x), 2); %! assert (sup (x), 3); %!test %! x = infsup (-inf, 0.1); %! assert (inf (x), -inf); %! assert (sup (x), 0.1); %!test %! x = infsup (-inf, +inf); %! assert (inf (x), -inf); %! assert (sup (x), +inf); %!# NaN values %!warning id=interval:UndefinedOperation %! x = infsup (nan); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!warning id=interval:UndefinedOperation %! x = infsup (nan, 2); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!warning id=interval:UndefinedOperation %! x = infsup (3, nan); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!# illegal numeric boundaries %!warning id=interval:UndefinedOperation %! x = infsup (+inf, -inf); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!warning id=interval:UndefinedOperation %! x = infsup (+inf, +inf); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!warning id=interval:UndefinedOperation %! x = infsup (-inf, -inf); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!warning id=interval:UndefinedOperation %! x = infsup (3, 2); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!warning id=interval:UndefinedOperation %! x = infsup (3, -inf); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!# double matrix %!test %! x = infsup (magic (4)); %! assert (inf (x), magic (4)); %! assert (sup (x), magic (4)); %!test %! x = infsup (magic (3), magic (3) + 1); %! assert (inf (x), magic (3)); %! assert (sup (x), magic (3) + 1); %!warning id=interval:UndefinedOperation %! x = infsup (nan (3)); %! assert (inf (x), +inf (3)); %! assert (sup (x), -inf (3)); %!test %! x = infsup (-inf (3), +inf (3)); %! assert (inf (x), -inf (3)); %! assert (sup (x), +inf (3)); %!# decimal boundaries %!test %! x = infsup ("0.1"); %! assert (inf (x), 0.1 - eps / 16); %! assert (sup (x), 0.1); %!test %! x = infsup ("0.1e1"); %! assert (inf (x), 1); %! assert (sup (x), 1); %!# hexadecimal boundaries %!test %! x = infsup ("0xff"); %! assert (inf (x), 255); %! assert (sup (x), 255); %!test %! x = infsup ("0xff.1"); %! assert (inf (x), 255.0625); %! assert (sup (x), 255.0625); %!test %! x = infsup ("0xff.1p-1"); %! assert (inf (x), 127.53125); %! assert (sup (x), 127.53125); %!# named constants %!test %! x = infsup ("pi"); %! assert (inf (x), pi); %! assert (sup (x), pi + 2 * eps); %!test %! x = infsup ("e"); %! assert (inf (x), e); %! assert (sup (x), e + eps); %!# uncertain form %!test %! x = infsup ("32?"); %! assert (inf (x), 31.5); %! assert (sup (x), 32.5); %!test %! x = infsup ("32?8"); %! assert (inf (x), 24); %! assert (sup (x), 40); %!test %! x = infsup ("32?u"); %! assert (inf (x), 32); %! assert (sup (x), 32.5); %!test %! x = infsup ("32?d"); %! assert (inf (x), 31.5); %! assert (sup (x), 32); %!test %! x = infsup ("32??"); %! assert (inf (x), -inf); %! assert (sup (x), +inf); %!test %! x = infsup ("32??d"); %! assert (inf (x), -inf); %! assert (sup (x), 32); %!test %! x = infsup ("32??u"); %! assert (inf (x), 32); %! assert (sup (x), +inf); %!test %! x = infsup ("32?e5"); %! assert (inf (x), 3150000); %! assert (sup (x), 3250000); %!# rational form %!test %! x = infsup ("6/9"); %! assert (inf (x), 2 / 3); %! assert (sup (x), 2 / 3 + eps / 2); %!test %! x = infsup ("6e1/9"); %! assert (inf (x), 20 / 3 - eps * 2); %! assert (sup (x), 20 / 3); %!test %! x = infsup ("6/9e1"); %! assert (inf (x), 2 / 30); %! assert (sup (x), 2 / 30 + eps / 16); %!test %! x = infsup ("-6/9"); %! assert (inf (x), -(2 / 3 + eps / 2)); %! assert (sup (x), -2 / 3); %!test %! x = infsup ("6/-9"); %! assert (inf (x), -(2 / 3 + eps / 2)); %! assert (sup (x), -2 / 3); %!test %! x = infsup ("-6/-9"); %! assert (inf (x), 2 / 3); %! assert (sup (x), 2 / 3 + eps / 2); %!test %! x = infsup ("6.6/9.9"); %! assert (inf (x), 2 / 3); %! assert (sup (x), 2 / 3 + eps / 2); %!# inf-sup interval literal %!test %! x = infsup ("[2, 3]"); %! assert (inf (x), 2); %! assert (sup (x), 3); %!test %! x = infsup ("[0.1]"); %! assert (inf (x), 0.1 - eps / 16); %! assert (sup (x), 0.1); %!test %! x = infsup ("[0xff, 0xff.1]"); %! assert (inf (x), 255); %! assert (sup (x), 255.0625); %!test %! x = infsup ("[e, pi]"); %! assert (inf (x), e); %! assert (sup (x), pi + 2 * eps); %!test %! x = infsup ("[6/9, 6e1/9]"); %! assert (inf (x), 2 / 3); %! assert (sup (x), 20 / 3); %!# corner cases %!test %! x = infsup (","); %! assert (inf (x), -inf); %! assert (sup (x), +inf); %!test %! x = infsup ("[, 3]"); %! assert (inf (x), -inf); %! assert (sup (x), 3); %!test %! x = infsup ("", "3"); %! assert (inf (x), -inf); %! assert (sup (x), 3); %!test %! x = infsup ("[2, ]"); %! assert (inf (x), 2); %! assert (sup (x), inf); %!test %! x = infsup ("2", ""); %! assert (inf (x), 2); %! assert (sup (x), inf); %!# decimal vector %!test %! x = infsup (["0.1"; "0.2"; "0.3"]); %! assert (inf (x), [0.1 - eps / 16; 0.2 - eps / 8; 0.3]); %! assert (sup (x), [0.1; 0.2; 0.3 + eps / 8]); %!test %! x = infsup ("0.1; 0.2; 0.3"); %! assert (inf (x), [0.1 - eps / 16; 0.2 - eps / 8; 0.3]); %! assert (sup (x), [0.1; 0.2; 0.3 + eps / 8]); %!test %! x = infsup ("0.1\n0.2\n0.3"); %! assert (inf (x), [0.1 - eps / 16; 0.2 - eps / 8; 0.3]); %! assert (sup (x), [0.1; 0.2; 0.3 + eps / 8]); %!# cell array with mixed boundaries %!test %! x = infsup ({"0.1", 42; "e", "3.2/8"}, {"0xffp2", "42e1"; "pi", 2}); %! assert (inf (x), [0.1 - eps / 16, 42; e, 0.4 - eps / 4]); %! assert (sup (x), [1020, 420; pi + 2 * eps, 2]); %!test %! x = infsup ({"[2, 3]", "3/4", "[Entire]", "42?3", 1, "0xf"}); %! assert (inf (x), [2, 0.75, -inf, 39, 1, 15]); %! assert (sup (x), [3, 0.75, +inf, 45, 1, 15]); %!# broadcasting %!test %! x = infsup (magic (3), 10); %! assert (inf (x), magic (3)); %! assert (sup (x), 10 .* ones (3)); %!test %! x = infsup (zeros (1, 20), ones (20, 1)); %! assert (inf (x), zeros (20, 20)); %! assert (sup (x), ones (20, 20)); %!# nai %!warning id=interval:UndefinedOperation %! x = infsup ("[nai]"); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!warning id=interval:UndefinedOperation %! x = infsup ("Ausgeschnitzel"); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!# interval literals vs. two arguments %!warning id=interval:UndefinedOperation %! x = infsup ("[empty]", 42); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!warning id=interval:UndefinedOperation %! x = infsup ("0?", 42); %! assert (inf (x), +inf); %! assert (sup (x), -inf); %!# extraction of single errors %!warning id=interval:UndefinedOperation %! x = infsup ("0 1 2 [xxx] 3 4"); %! assert (inf (x), [0 1 2 +inf 3 4]); %! assert (sup (x), [0 1 2 -inf 3 4]); %!warning id=interval:UndefinedOperation %! x = infsup ({1 2; 3 "[xxx]"}); %! assert (inf (x), [1 2; 3 +inf]); %! assert (sup (x), [1 2; 3 -inf]); %!# complex values %!warning id=interval:InvalidOperand %! x = infsup ([1 2 3+i 4+0i]); %! assert (inf (x), [1 2 +inf 4]); %! assert (sup (x), [1 2 -inf 4]); %!# inaccurate conversion %!warning id=interval:PossiblyUndefinedOperation %! x = infsup ("1.000000000000000000002", "1.000000000000000000001"); %! assert (inf (x), 1); %! assert (sup (x), 1 + eps); %!test %! n = uint64(2 ^ 53); %! x = infsup (n, n + 1); %! assert (inf (x), double (n)); %! assert (sup (x), double (n + 2)); %!test %! n = uint64(2 ^ 53); %! x = infsup ({n}, n + 1); %! assert (inf (x), double (n)); %! assert (sup (x), double (n + 2)); %!test %! n = uint64(2 ^ 53); %! x = infsup (n + 1, n + 1); %! assert (inf (x), double (n)); %! assert (sup (x), double (n + 2)); %!test %! n = uint64(2 ^ 54); %! x = infsup (n, n + 1); %! assert (inf (x), double (n)); %! assert (sup (x), double (n + 4)); %!warning id=interval:PossiblyUndefinedOperation %! n = uint64(2 ^ 54); %! x = infsup (n + 1, n + 2); %! assert (inf (x), double (n)); %! assert (sup (x), double (n + 4)); %!warning id=interval:PossiblyUndefinedOperation %! x = infsup ("pi", "3.141592653589793"); %! assert (inf (x), pi); %! assert (sup (x), pi); %!warning id=interval:PossiblyUndefinedOperation %! x = infsup ("pi", "3.1415926535897932"); %! assert (inf (x), pi); %! assert (sup (x), pi + 2 * eps); %!# isexact flag %!test %! [~, isexact] = infsup (); %! assert (isexact); %!test %! [~, isexact] = infsup (0); %! assert (isexact); %!test %! [~, isexact] = infsup ("1 2 3"); %! assert (isexact, true); %!test %! [~, isexact] = infsup ("1 2 3.1"); %! assert (isexact, false); %!warning %! [~, isexact] = infsup ("[nai]"); %! assert (not (isexact)); %!# overflow flag %!test %! [~, ~, overflow] = infsup (); %! assert (not (overflow)); %!test %! [~, ~, overflow] = infsup (0); %! assert (not (overflow)); %!test %! [~, ~, overflow] = infsup ([1 2 3]); %! assert (overflow, false (1, 3)); %!warning %! [~, ~, overflow] = infsup ("[nai]"); %! assert (not (overflow)); %!test %! [~, ~, overflow] = infsup ("1e3000"); %! assert (overflow); %!test %! [~, ~, overflow] = infsup ("[1, inf]"); %! assert (not (overflow)); %!# isnai flag %!test %! [~, ~, ~, isnai] = infsup (); %! assert (not (isnai)); %!test %! [~, ~, ~, isnai] = infsup (0); %! assert (not (isnai)); %!test %! [~, ~, ~, isnai] = infsup ([1 2 3]); %! assert (isnai, false (1, 3)); %!warning %! [~, ~, ~, isnai] = infsup ("[nai]"); %! assert (isnai); %!warning %! [~, ~, ~, isnai] = infsup ("xxx"); %! assert (isnai); %!warning %! [~, ~, ~, isnai] = infsup ("1 2 xxx 4"); %! assert (isnai, [false, false, true, false]); %!warning %! [~, ~, ~, isnai] = infsup ("[-inf, inf] [inf, inf]"); %! assert (isnai, [false, true]); interval-2.1.0/inst/@infsup/interior.m0000644000000000000000000000327513031036767016073 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} interior (@var{A}, @var{B}) ## ## Evaluate interior comparison on intervals. ## ## True, if all numbers from @var{A} are also contained in @var{B}, but are no ## boundaries of @var{B}. False, if @var{A} contains a number which is not a ## member in @var{B} or which is a boundary of @var{B}. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsup/eq, @@infsup/subset, @@infsup/disjoint} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function result = interior (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (b, "infsup"))) b = infsup (b); endif result = ((b.inf < a.inf | (b.inf == -inf & a.inf == -inf)) & ... (a.sup < b.sup | (a.sup == inf & b.sup == inf))); result(isempty (a) & isempty (b)) = true (); endfunction %!assert (interior (infsup (1, 2), infsup (0, 3))); interval-2.1.0/inst/@infsup/intersect.m0000644000000000000000000001003613031036767016231 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} intersect (@var{A}) ## @defmethodx {@@infsup} intersect (@var{A}, @var{B}) ## @defmethodx {@@infsup} intersect (@var{A}, [], @var{DIM}) ## ## Intersect intervals. ## ## With two arguments the intersection is built pair-wise. Otherwise the ## intersection is computed for all interval members along dimension @var{DIM}, ## which defaults to the first non-singleton dimension. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsup (1, 3); ## y = infsup (2, 4); ## intersect (x, y) ## @result{} ans = [2, 3] ## @end group ## @end example ## @seealso{@@infsup/union, @@infsup/setdiff, @@infsup/setxor} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-02 function a = intersect (a, b, dim) if (not (isa (a, "infsup"))) a = infsup (a); endif switch (nargin) case 1 l = max (a.inf); u = min (a.sup); case 2 if (not (isa (b, "infsup"))) b = infsup (b); endif l = max (a.inf, b.inf); u = min (a.sup, b.sup); case 3 if (not (builtin ("isempty", b))) warning ("intersect: second argument is ignored"); endif l = max (a.inf, [], dim); u = min (a.sup, [], dim); otherwise print_usage (); return endswitch ## If the intervals do not intersect, the result must be empty. emptyresult = l > u; l(emptyresult) = inf; u(emptyresult) = -inf; a.inf = l; a.sup = u; endfunction %!# Empty interval %!assert (intersect (infsup (), infsup ()) == infsup ()); %!assert (intersect (infsup (), infsup (1)) == infsup ()); %!assert (intersect (infsup (0), infsup ()) == infsup ()); %!assert (intersect (infsup (-inf, inf), infsup ()) == infsup ()); %!# Singleton intervals %!assert (intersect (infsup (0), infsup (1)) == infsup ()); %!assert (intersect (infsup (0), infsup (0)) == infsup (0)); %!# Bounded intervals %!assert (intersect (infsup (1, 2), infsup (3, 4)) == infsup ()); %!assert (intersect (infsup (1, 2), infsup (2, 3)) == infsup (2)); %!assert (intersect (infsup (1, 2), infsup (1.5, 2.5)) == infsup (1.5, 2)); %!assert (intersect (infsup (1, 2), infsup (1, 2)) == infsup (1, 2)); %!# Unbounded intervals %!assert (intersect (infsup (0, inf), infsup (-inf, 0)) == infsup (0)); %!assert (intersect (infsup (1, inf), infsup (-inf, -1)) == infsup ()); %!assert (intersect (infsup (-1, inf), infsup (-inf, 1)) == infsup (-1, 1)); %!assert (intersect (infsup (-inf, inf), infsup (42)) == infsup (42)); %!assert (intersect (infsup (42), infsup (-inf, inf)) == infsup (42)); %!assert (intersect (infsup (-inf, 0), infsup (-inf, inf)) == infsup (-inf, 0)); %!assert (intersect (infsup (-inf, inf), infsup (-inf, inf)) == infsup (-inf, inf)); %!# from the documentation string %!assert (intersect (infsup (1, 3), infsup (2, 4)) == infsup (2, 3)); %!# correct use of signed zeros %!test %! x = intersect (infsup (0), infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = intersect (infsup (0), infsup (0, 1)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = intersect (infsup (0, 1), infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = intersect (infsup (-1, 0), infsup (0, 1)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/intervaltoexact.m0000644000000000000000000000300513031036767017443 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{S} =} intervaltoexact (@var{X}) ## ## Build an exact representation of the interval @var{X} in ## hexadecimal-significand form. ## ## The interval boundaries are stored in binary floating point format and can ## be converted to hexadecimal format without precision loss. ## ## The equation @code{@var{X} == exacttointerval (intervaltoexact (@var{X}))} ## holds for all intervals @var{X}. ## ## Accuracy: The output is exact. ## @seealso{exacttointerval} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-01 function s = intervaltoexact (x) if (nargin ~= 1) print_usage (); return endif s = intervaltotext (x, "exact hexadecimal"); endfunction %!assert (intervaltoexact (infsup (1 + eps)), "[0x1.0000000000001p+0]"); interval-2.1.0/inst/@infsup/intervaltotext.m0000644000000000000000000001044313031036767017327 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{S} =} intervaltotext (@var{X}) ## @deftypemethodx {@@infsup} {@var{S} =} intervaltotext (@var{X}, @var{FORMAT}) ## ## Build an approximate representation of the interval @var{X}. ## ## Output @var{S} is a simple string for scalar intervals, and a cell array of ## strings for interval matrices. ## ## The interval boundaries are stored in binary floating point format and are ## converted to decimal or hexadecimal format with possible precision loss. If ## output is not exact, the boundaries are rounded accordingly (e. g. the upper ## boundary is rounded towards infinite for output representation). ## ## The exact decimal format may produce a lot of digits. ## ## Possible values for @var{FORMAT} are: @code{decimal} (default), ## @code{exact decimal}, @code{exact hexadecimal}, @code{auto} ## ## Accuracy: For all intervals @var{X} is an accurate subset of ## @code{infsup (intervaltotext (@var{X}))}. ## @example ## @group ## x = infsup (1 + eps); ## intervaltotext (x) ## @result{} [1.0000000000000002, 1.000000000000001] ## @end group ## @end example ## @example ## @group ## y = nextout (x); ## intervaltotext (y) ## @result{} [1, 1.0000000000000005] ## @end group ## @end example ## @example ## @group ## z = infsup (1); ## intervaltotext (z) ## @result{} [1] ## @end group ## @end example ## @seealso{@@infsup/intervaltoexact} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function [s, isexact] = intervaltotext (x, format) if (nargin > 2) print_usage (); return endif isexact = true (); if (nargin < 2) format = "decimal"; endif s = l = u = cell (size (x.inf)); s(isempty (x)) = "[Empty]"; s(isentire (x)) = "[Entire]"; select = not (isempty (x) | isentire (x)); if (any (select(:))) [l(select), lexact] = mpfr_to_string_d (-inf, format, x.inf(select)); [u(select), uexact] = mpfr_to_string_d (+inf, format, x.sup(select)); isexact = lexact && uexact; l(x.inf == 0) = "0"; # no sign for zero ## Normalize case of +-Inf l(select & x.inf == -inf) = "-Inf"; u(select & x.sup == inf) = "Inf"; ## If l is negative, then u shall also carry a sign (not zero) change_of_sign = select & x.inf < 0 & x.sup > 0; u(change_of_sign) = strcat ("+", u(change_of_sign)); singleton_string = strcmp (l, u); s(select & singleton_string) = strcat ("[", ... l(select & singleton_string), ... "]"); s(select & not (singleton_string)) = strcat (... "[", ... l(select & not (singleton_string)), ... {", "}, ... u(select & not (singleton_string)), ... "]"); endif if (isscalar (s)) s = s{1}; endif endfunction %!assert (intervaltotext (infsup (1 + eps), "exact decimal"), "[1.0000000000000002220446049250313080847263336181640625]"); %!assert (intervaltotext (infsup (1 + eps), "exact hexadecimal"), "[0x1.0000000000001p+0]"); %!test %! output_precision (3, 'local'); %! assert (intervaltotext (infsup (pi), "auto"), "[3.14, 3.15]"); %! output_precision (4, 'local'); %! assert (intervaltotext (infsup (pi), "auto"), "[3.141, 3.142]"); %!# from the documentation string %!assert (intervaltotext (infsup (1 + eps)), "[1.0000000000000002, 1.000000000000001]"); %!assert (intervaltotext (nextout (infsup (1 + eps))), "[1, 1.0000000000000005]"); %!assert (intervaltotext (infsup (1)), "[1]"); interval-2.1.0/inst/@infsup/inv.m0000644000000000000000000000404513031036767015030 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} inv (@var{A}) ## ## Compute the inverse of the square matrix @var{A}. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## inv (infsup ([2, 1, 1; 0, 1, 0; 1, 0, 0])) ## @result{} ans = 3×3 interval matrix ## [0] [0] [1] ## [0] [1] [0] ## [1] [-1] [-2] ## inv (infsup ([1, 2, 3; 4, 0, 6; 0, 0, 1])) ## @result{} ans = 3×3 interval matrix ## [0] [0.25] [-1.5] ## [0.5] [-0.125] [-0.75] ## [0] [0] [1] ## @end group ## @end example ## @seealso{@@infsup/mrdivide} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-31 function result = inv (x) if (nargin ~= 1) print_usage (); return endif n = length (x); if (n <= 1) result = rdivide (1, x); return endif result = mldivide (x, eye (n)); endfunction %!# from the wiki %!test %! A = infsup ([1, 2, 3; 4, 0, 0; 0, 0, 1]); %! A (2, 3) = "[0, 6]"; %! B = inv (A); %! assert (inf (B) == [0, .25, -1.5; .5, -.125, -1.5; 0, 0, 1]); %! assert (sup (B) == [0, .25, 0; .5, -.125, -.75; 0, 0, 1]); %!# from the documentation string %!assert (inv (infsup ([2, 1, 1; 0, 1, 0; 1, 0, 0])) == [0, 0, 1; 0, 1, 0; 1, -1, -2]); %!assert (inv (infsup ([1, 2, 3; 4, 0, 6; 0, 0, 1])) == [0, .25, -1.5; .5, -.125, -.75; 0, 0, 1]); interval-2.1.0/inst/@infsup/iscolumn.m0000644000000000000000000000257513031036767016073 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} iscolumn (@var{A}) ## ## Return true if @var{A} is an interval column vector. ## ## @seealso{@@infsup/isvector, @@infsup/isrow} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-18 ## FIXME This function is only required, because of a regression in octave 4.0 function result = iscolumn (A) if (nargin ~= 1) print_usage (); return endif result = iscolumn (A.inf); endfunction %!assert (not (iscolumn (infsup ([])))); %!assert (iscolumn (infsup (0))); %!assert (not (iscolumn (infsup (zeros (1, 2))))); %!assert (iscolumn (infsup (zeros (2, 1)))); %!assert (not (iscolumn (infsup (zeros (5))))); interval-2.1.0/inst/@infsup/iscommoninterval.m0000644000000000000000000000366513031036767017634 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} iscommoninterval (@var{X}) ## ## Check if the interval is a common interval, that is a nonemty, closed ## bounded real interval. ## ## Common intervals are used in class Moore interval arithmetic and are ## flavor-independent in IEEE Std 1788-2015 interval arithmetic. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsup/eq, @@infsup/isentire, @@infsup/isempty, @@infsup/issingleton} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-23 function result = iscommoninterval (x) if (nargin ~= 1) print_usage (); return endif result = isfinite (x.inf) & isfinite (x.sup); endfunction %!assert (iscommoninterval (infsup (2, 3))); %!assert (not (iscommoninterval (infsup (2, inf)))); %!assert (not (iscommoninterval (infsup ()))); %!assert (not (iscommoninterval (infsup (-inf, inf)))); %!assert (iscommoninterval (infsupdec (2, 3, "com"))); %!assert (iscommoninterval (infsupdec (2, 3, "trv"))); %!assert (not (iscommoninterval (infsupdec (2, inf, "trv")))); %!assert (not (iscommoninterval (empty ()))); %!assert (not (iscommoninterval (entire ()))); %!warning assert (not (iscommoninterval (infsupdec (2, 1)))); interval-2.1.0/inst/@infsup/isempty.m0000644000000000000000000000252313031036767015725 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} isempty (@var{X}) ## ## Check if the interval represents the empty set. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## Warning: This function is not compatible with the builtin @code{isempty} ## function. ## ## @seealso{@@infsup/eq, @@infsup/isentire, @@infsup/issingleton} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-27 function result = isempty (x) if (nargin ~= 1) print_usage (); return endif result = (x.inf > x.sup); endfunction %!assert (isempty (infsup ())); %!assert (not (isempty (infsup (1, 2)))); interval-2.1.0/inst/@infsup/isentire.m0000644000000000000000000000267113031036767016061 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} isentire (@var{X}) ## ## Check if the interval represents the entire set of real numbers. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{entire, @@infsup/eq, @@infsup/isempty, @@infsup/issingleton} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-27 function result = isentire (x) if (nargin ~= 1) print_usage (); return endif result = (x.inf == -inf & x.sup == inf); endfunction %!assert (isentire (entire ())); %!assert (isentire (intervalpart (entire ()))); %!assert (not (isentire (empty ()))); %!assert (not (isentire (intervalpart (empty ())))); %!warning assert (not (isentire (infsupdec (2, 1)))); interval-2.1.0/inst/@infsup/ismatrix.m0000644000000000000000000000310313031036767016066 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} ismatrix (@var{A}) ## ## Return true if @var{A} is an interval matrix. ## ## Scalars (1x1 matrices) and vectors (1xN or Nx1 matrices) are subsets of the ## more general N-dimensional matrix and @code{ismatrix} will return true for ## these objects as well. ## @seealso{@@infsup/isscalar, @@infsup/isvector} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-29 ## FIXME: One happy day this function can be removed, because bug #42422 has ## been solved with GNU Octave 4.0. function result = ismatrix (A) if (nargin ~= 1) print_usage (); return endif result = ismatrix (A.inf); endfunction %!assert (ismatrix (infsup ([]))); %!assert (ismatrix (infsup (0))); %!assert (ismatrix (infsup (zeros (3, 1)))); %!assert (ismatrix (infsup (zeros (1, 4)))); %!assert (ismatrix (infsup (zeros (3, 4)))); interval-2.1.0/inst/@infsup/ismember.m0000644000000000000000000000372613031036767016044 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} ismember (@var{M}, @var{X}) ## ## Check if the interval @var{X} contains the number @var{M}. ## ## The number can be a numerical data type or a string representation of a ## decimal number. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsup/eq, @@infsup/isentire, @@infsup/issingleton, @@infsup/isempty} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = ismember (real, interval) if (nargin ~= 2) print_usage (); return endif if (not (isa (interval, "infsup"))) interval = infsup (interval); endif if (isreal (real) && isfloat (real)) ## Simple checking is only possible with floating point numbers result = isfinite (real) & interval.inf <= real & real <= interval.sup; else ## Mixed mode comparison between integers and floats can be problematic ## as well as comparison with decimal numbers result = subset (infsup (real), interval); endif endfunction %!assert (ismember (0, entire ())); %!assert (ismember (0, intervalpart (entire ()))); %!assert (not (ismember (0, empty ()))); %!assert (not (ismember (0, intervalpart (empty ())))); %!warning assert (not (ismember (0, infsupdec (2, 1)))); interval-2.1.0/inst/@infsup/isrow.m0000644000000000000000000000254513031036767015402 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} isrow (@var{A}) ## ## Return true if @var{A} is an interval row vector. ## ## @seealso{@@infsup/isvector, @@infsup/iscolumn} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-18 ## FIXME This function is only required, because of a regression in octave 4.0 function result = isrow (A) if (nargin ~= 1) print_usage (); return endif result = isrow (A.inf); endfunction %!assert (not (isrow (infsup ([])))); %!assert (isrow (infsup (0))); %!assert (isrow (infsup (zeros (1, 2)))); %!assert (not (isrow (infsup (zeros (2, 1))))); %!assert (not (isrow (infsup (zeros (5))))); interval-2.1.0/inst/@infsup/isscalar.m0000644000000000000000000000302413031036767016031 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} isscalar (@var{A}) ## ## Return true if @var{A} is an interval scalar. ## ## Scalars (1x1 matrices) are subsets of the more general vector or matrix and ## @code{isvector} and @code{ismatrix} will return true for these objects as ## well. ## @seealso{@@infsup/isvector, @@infsup/ismatrix} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-02 ## FIXME This function is only required, because of bug #43925 function result = isscalar (A) if (nargin ~= 1) print_usage (); return endif result = isscalar (A.inf); endfunction %!assert (not (isscalar (infsup ([])))); %!assert (isscalar (infsup (0))); %!assert (not (isscalar (infsup (zeros (1, 2))))); %!assert (not (isscalar (infsup (zeros (2, 1))))); %!assert (not (isscalar (infsup (zeros (5))))); interval-2.1.0/inst/@infsup/issingleton.m0000644000000000000000000000312313031036767016566 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} issingleton (@var{X}) ## ## Check if the interval represents a set that contains a single real only. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsup/eq, @@infsup/isentire, @@infsup/isempty} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-07 function result = issingleton (x) if (nargin ~= 1) print_usage (); return endif ## This check also works for empty intervals (-inf ~= +inf) result = (x.inf == x.sup); endfunction %!assert (issingleton (infsup (0))); %!assert (issingleton (infsupdec (0))); %!assert (not (issingleton (entire ()))); %!assert (not (issingleton (intervalpart (entire ())))); %!assert (not (issingleton (empty ()))); %!assert (not (issingleton (intervalpart (empty ())))); %!warning assert (not (issingleton (infsupdec (2, 1)))); interval-2.1.0/inst/@infsup/issquare.m0000644000000000000000000000261413031036767016070 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} issquare (@var{A}) ## ## Return true if @var{A} is a square interval matrix. ## ## @seealso{@@infsup/isvector, @@infsup/ismatrix, @@infsup/isscalar} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-18 ## FIXME This function is only required, because of a regression in octave 4.0 function result = issquare (A) if (nargin ~= 1) print_usage (); return endif result = issquare (A.inf); endfunction %!assert (issquare (infsup ([]))); %!assert (issquare (infsup (0))); %!assert (not (issquare (infsup (zeros (1, 2))))); %!assert (not (issquare (infsup (zeros (2, 1))))); %!assert (issquare (infsup (zeros (5)))); interval-2.1.0/inst/@infsup/isvector.m0000644000000000000000000000275513031036767016100 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} isvector (@var{A}) ## ## Return true if @var{A} is an interval vector. ## ## Scalars (1x1 vectors) are subsets of the more general vector and ## @code{isvector} will return true for these objects as well. ## @seealso{@@infsup/isscalar, @@infsup/ismatrix} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-02 ## FIXME This function is only required, because of regression #44498 function result = isvector (A) if (nargin ~= 1) print_usage (); return endif result = isvector (A.inf); endfunction %!assert (not (isvector (infsup ([])))); %!assert (isvector (infsup (0))); %!assert (isvector (infsup (zeros (1, 2)))); %!assert (isvector (infsup (zeros (2, 1)))); %!assert (not (isvector (infsup (zeros (5))))); interval-2.1.0/inst/@infsup/ldivide.m0000644000000000000000000000265313031036767015657 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} ldivide (@var{X}, @var{Y}) ## @defopx Operator {@@infsup} {@var{X} .\ @var{Y}} ## ## Divide all numbers of interval @var{Y} by all numbers of @var{X}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsup (2, 3); ## y = infsup (1, 2); ## x .\ y ## @result{} ans ⊂ [0.33333, 1] ## @end group ## @end example ## @seealso{@@infsup/times} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function result = ldivide (x, y) if (nargin ~= 2) print_usage (); return endif result = rdivide (y, x); endfunction %!# from the documentation string %!assert (ldivide (infsup (2, 3), infsup (1, 2)) == "[1/3, 1]"); interval-2.1.0/inst/@infsup/le.m0000644000000000000000000000332413031036767014633 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} le (@var{A}, @var{B}) ## @defopx Operator {@@infsup} {@var{A} <= @var{B}} ## ## Compare intervals @var{A} and @var{B} for weakly less. ## ## True, if all numbers from @var{A} are weakly less than any number in ## @var{B}. False, if @var{A} contains a number which is strictly greater than ## all numbers in @var{B}. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsup/eq, @@infsup/lt, @@infsup/ge, @@infsup/subset, @@infsup/interior, @@infsup/disjoint} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-07 function result = le (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (b, "infsup"))) b = infsup (b); elseif (isa (b, "infsupdec")) ## Workaround for bug #42735 result = le (a, b); return endif result = (a.inf <= b.inf & a.sup <= b.sup); endfunction %!assert (le (infsup (1, 3), infsup (3))); interval-2.1.0/inst/@infsup/length.m0000644000000000000000000000267013031036767015517 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} length (@var{A}) ## ## Return the length of interval object @var{A}. ## ## The length is 0 for empty objects, 1 for scalars, and the number of elements ## for vectors. For matrix objects, the length is the number of rows or ## columns, whichever is greater. ## @seealso{@@infsup/numel, @@infsup/size, @@infsup/rows, @@infsup/columns} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-29 function result = length (a) result = length (a.inf); endfunction %!assert (length (infsup ([])), 0); %!assert (length (infsup (0)), 1); %!assert (length (infsup (zeros (3, 1))), 3); %!assert (length (infsup (zeros (1, 4))), 4); %!assert (length (infsup (zeros (3, 4))), 4); interval-2.1.0/inst/@infsup/linspace.m0000644000000000000000000000453313031036767016034 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} linspace (@var{BASE}, @var{LIMIT}) ## @defmethodx {@@infsup} linspace (@var{BASE}, @var{LIMIT}, @var{N}) ## ## Return a row vector of @var{N} linearly spaced members between @var{BASE} ## and @var{LIMIT}. ## ## If @var{BASE} is greater than @var{LIMIT}, members are returned in ## decreasing order. The default value for @var{N} is 100. ## ## If either @var{BASE} or @var{LIMIT} is not a scalar, the result is a matrix. ## ## Accuracy: The result is an accurate enclosure. ## ## @example ## @group ## transpose (linspace (infsup (0), infsup (10), 4)) ## @result{} ans ⊂ 4×1 interval vector ## ## [0] ## [3.3333, 3.3334] ## [6.6666, 6.6667] ## [10] ## @end group ## @end example ## @seealso{linspace} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-07-19 function base = linspace (base, limit, n) if (nargin < 2 || nargin > 3) print_usage (); return endif if (not (isa (base, "infsup"))) base = infsup (base); endif if (not (isa (limit, "infsup"))) limit = infsup (limit); endif if (nargin < 3) n = 100; endif l = mpfr_linspace_d (-inf, base.inf, limit.inf, n); u = mpfr_linspace_d (+inf, base.sup, limit.sup, n); empty = vec (isempty (base) | isempty (limit)); l(empty, :) = inf; u(empty, :) = -inf; l(l == 0) = -0; base.inf = l; base.sup = u; endfunction %!assert (isequal (linspace (infsup (0), infsup (10), 9), infsup (linspace (0, 10, 9)))); %!# correct use of signed zeros %!test %! x = linspace (infsup (0), infsup (0)); %! assert (all (signbit (inf (x)))); %! assert (all (not (signbit (sup (x))))); interval-2.1.0/inst/@infsup/log.m0000644000000000000000000000400013031036767015004 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} log (@var{X}) ## ## Compute the natural logarithm. ## ## The function is only defined where @var{X} is positive. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## log (infsup (2)) ## @result{} ans ⊂ [0.69314, 0.69315] ## @end group ## @end example ## @seealso{@@infsup/exp, @@infsup/log2, @@infsup/log10} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = log (x) if (nargin ~= 1) print_usage (); return endif x = intersect (x, infsup (0, inf)); ## log is monotonically increasing from (0, -inf) to (inf, inf) if (__check_crlibm__ ()) l = crlibm_function ('log', -inf, x.inf); # this works for empty intervals u = crlibm_function ('log', +inf, x.sup); # ... this does not else l = mpfr_function_d ('log', -inf, x.inf); # this works for empty intervals u = mpfr_function_d ('log', +inf, x.sup); # ... this does not endif l(x.sup == 0) = inf; l(l == 0) = -0; u(isempty (x) | x.sup == 0) = -inf; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (log (infsup (2)) == "[0x1.62E42FEFA39EFp-1, 0x1.62E42FEFA39Fp-1]"); %!# correct use of signed zeros %!test %! x = log (infsup (1)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/log10.m0000644000000000000000000000403713031036767015157 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} log10 (@var{X}) ## ## Compute the decimal (base-10) logarithm. ## ## The function is only defined where @var{X} is positive. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## log10 (infsup (2)) ## @result{} ans ⊂ [0.30102, 0.30103] ## @end group ## @end example ## @seealso{@@infsup/pow10, @@infsup/log, @@infsup/log2} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = log10 (x) if (nargin ~= 1) print_usage (); return endif x = intersect (x, infsup (0, inf)); ## log10 is monotonically increasing from (0, -inf) to (inf, inf) if (__check_crlibm__ ()) l = crlibm_function ('log10', -inf, x.inf); # this works for empty intervals u = crlibm_function ('log10', +inf, x.sup); # ... this does not else l = mpfr_function_d ('log10', -inf, x.inf); # this works for empty intervals u = mpfr_function_d ('log10', +inf, x.sup); # ... this does not endif l(x.sup == 0) = inf; l(l == 0) = -0; u(isempty (x) | x.sup == 0) = -inf; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (log10 (infsup (2)) == "[0x1.34413509F79FEp-2, 0x1.34413509F79FFp-2]"); %!# correct use of signed zeros %!test %! x = log10 (infsup (1)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/log1p.m0000644000000000000000000000406513031036767015260 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} log1p (@var{X}) ## ## Compute @code{log (1 + @var{X})} accurately in the neighborhood of zero. ## ## The function is only defined where @var{X} is greater than -1. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## log1p (infsup (eps)) ## @result{} ans ⊂ [2.2204e-16, 2.2205e-16] ## @end group ## @end example ## @seealso{@@infsup/exp, @@infsup/log} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-20 function x = log1p (x) if (nargin ~= 1) print_usage (); return endif x = intersect (x, infsup (-1, inf)); ## log is monotonically increasing from (-1, -inf) to (inf, inf) if (__check_crlibm__ ()) l = crlibm_function ('log1p', -inf, x.inf); # this works for empty intervals u = crlibm_function ('log1p', +inf, x.sup); # ... this does not else l = mpfr_function_d ('log1p', -inf, x.inf); # this works for empty intervals u = mpfr_function_d ('log1p', +inf, x.sup); # ... this does not endif l(x.sup == -1) = inf; l(l == 0) = -0; u(isempty (x) | x.sup == -1) = -inf; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (log1p (infsup (eps)) == "[0x1.FFFFFFFFFFFFFp-53, 0x1p-52]"); %!# correct use of signed zeros %!test %! x = log1p (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/log2.m0000644000000000000000000000372513031036767015103 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} log2 (@var{X}) ## ## Compute the binary (base-2) logarithm. ## ## The function is only defined where @var{X} is positive. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## log2 (infsup (2)) ## @result{} ans = [1] ## @end group ## @end example ## @seealso{@@infsup/pow2, @@infsup/log, @@infsup/log10} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = log2 (x) if (nargin ~= 1) print_usage (); return endif x = intersect (x, infsup (0, inf)); ## log2 is monotonically increasing from (0, -inf) to (inf, inf) if (__check_crlibm__ ()) l = crlibm_function ('log2', -inf, x.inf); # this works for empty intervals u = crlibm_function ('log2', +inf, x.sup); # ... this does not else l = mpfr_function_d ('log2', -inf, x.inf); # this works for empty intervals u = mpfr_function_d ('log2', +inf, x.sup); # ... this does not endif l(x.sup == 0) = inf; l(l == 0) = -0; u(isempty (x) | x.sup == 0) = -inf; x.sup = u; x.inf = l; endfunction %!# from the documentation string %!assert (log2 (infsup (2)) == 1); %!# correct use of signed zeros %!test %! x = log2 (infsup (1)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/lt.m0000644000000000000000000000366713031036767014664 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} lt (@var{A}, @var{B}) ## @defopx Operator {@@infsup} {@var{A} < @var{B}} ## ## Compare intervals @var{A} and @var{B} for strictly less. ## ## True, if all numbers from @var{A} are strict less than at least one number ## in @var{B}. False, if @var{A} contains a number which is greater than all ## numbers in @var{B} or is equal to the greatest number of @var{B}. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsup/eq, @@infsup/le, @@infsup/gt, @@infsup/subset, @@infsup/interior, @@infsup/disjoint} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-07 function result = lt (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (b, "infsup"))) b = infsup (b); elseif (isa (b, "infsupdec")) ## Workaround for bug #42735 result = lt (a, b); return endif result = ((a.inf < b.inf | (a.inf == -inf & b.inf == -inf)) & ... (a.sup < b.sup | (a.sup == inf & b.sup == inf))); result (isempty (a) & isempty (b)) = true (); endfunction %!assert (not (lt (infsup (1, 3), infsup (3)))); %!assert (lt (infsup (1, 3), infsup (3.1))); interval-2.1.0/inst/@infsup/lu.m0000644000000000000000000001443713031036767014662 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {[@var{L}, @var{U}] = } lu (@var{A}) ## @deftypemethodx {@@infsup} {[@var{L}, @var{U}, @var{P}] = } lu (@var{A}) ## ## Compute the LU decomposition of @var{A}. ## ## @var{A} will be a subset of @var{L} * @var{U} with lower triangular matrix ## @var{L} and upper triangular matrix @var{U}. ## ## The result is returned in a permuted form, according to the optional return ## value @var{P}. ## ## Accuracy: The result is a valid enclosure. ## @seealso{@@infsup/qr, @@infsup/chol} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-31 function [L, U, P] = lu (x) if (nargin ~= 1) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (isscalar (x)) L = P = eye (size (x)); U = x; return endif ## x must be square assert (issquare (x.inf), ... "operator \: nonconformant arguments, X is not square"); n = rows (x.inf); if (nargout < 3) P = eye (n); else ## Compute P such that the computation of L below will not fail because of ## division by zero. P * x should not have zeros in its main diagonal. ## The computation of P is a greedy heuristic algorithm, which I developed ## for the implementation of this function. P = zeros (n); migU = mig (x); magU = mag (x); ## Empty intervals are as bad as intervals containing only zero. migU (isnan (migU)) = 0; magU (isnan (magU)) = 0; for i = 1 : n ## Choose next pivot in one of the columns with the fewest mig (U) > 0. columnrating = sum (migU > 0, 1); ## Don't choose used columns columnrating(max (migU, [], 1) == inf) = inf; ## Use first possible column possiblecolumns = columnrating == min (columnrating); column = find (possiblecolumns, 1); if (columnrating(column) >= 1) ## Greedy: Use only intervals that do not contain zero. possiblerows = migU(:, column) > 0; else ## Only intervals left which contain zero. Try to use an interval ## that additionally contains other numbers. possiblerows = migU(:, column) >= 0 & magU(:, column) > 0; if (not (max (possiblerows))) ## All possible intervals contain only zero. possiblerows = migU(:, column) >= 0; endif endif if (sum (possiblerows) == 1) ## Short-ciruit: Take the only remaining useful row row = find (possiblerows, 1); else ## There are several good choices, take the one that will hopefully ## not hinder the choice of further pivot elements. ## That is, the row with the least mig (U) > 0. rowrating = sum (migU > 0, 2); ## We weight the rating in the columns with few mig (U) > 0 in ## order to prevent problems during the choice of pivots in the ## near future. rowrating += 0.5 * sum (migU(:, possiblecolumns) > 0, 2); rowrating (not (possiblerows)) = inf; row = find (rowrating == min (rowrating), 1); endif # assert (0 <= migU (row, column) && migU (row, column) < inf); P(row, column) = 1; ## In mig (U), for the choice of further pivots: ## - mark used columns with inf ## - mark used rows in unused columns with -inf migU(row, :) -= inf; migU(isnan (migU)) = inf; migU(:, column) = inf; endfor endif ## Initialize L and U L = infsup (eye (n)); U = permute (P, x); ## Compute L and U varidx.type = rowstart.type = Urefrow.type = Urow.type = "()"; for i = 1 : (n - 1) varidx.subs = {i, i}; Urefrow.subs = {i, i : n}; ## Go through rows of the remaining matrix for k = (i + 1) : n rowstart.subs = {k, i}; ## Compute L Lcurrentelement = mulrev (subsref (U, varidx), subsref (U, rowstart)); L = subsasgn (L, rowstart, Lcurrentelement); ## Go through columns of the remaining matrix Urow.subs = {k, i : n}; ## Compute U minuend = subsref (U, Urow); subtrahend = Lcurrentelement .* subsref (U, Urefrow); U = subsasgn (U, Urow, minuend - subtrahend); endfor endfor ## Cleanup U U.inf = triu (U.inf); U.sup = triu (U.sup); endfunction ## Apply permutation matrix P to an interval matrix: B = P * A. ## This is much faster than a matrix product, because the matrix product would ## use a lot of dot products. function B = permute (P, A) ## Note: [B.inf, B.sup] = deal (P * A.inf, P * A.sup) is not possible, ## because empty or unbound intervals would create NaNs during ## multiplication with P. B = A; for i = 1 : rows (P) targetrow = find (P(i, :) == 1, 1); B.inf(targetrow, :) = A.inf(i, :); B.sup(targetrow, :) = A.sup(i, :); endfor endfunction %!test %! [l, u] = lu (infsup (magic (3))); %! assert (l == infsup ({1, 0, 0; .375, 1, 0; .5, "68/37", 1}));, ... %! assert (subset (u, infsup ({8, 1, 6; 0, 4.625, 4.75; 0, 0, "-0x1.3759F2298375Bp3"}, ... %! {8, 1, 6; 0, 4.625, 4.75; 0, 0, "-0x1.3759F22983759p3"}))); %!test %! A = magic (3); %! A([1, 5, 9]) = 0; %! [l, u, p] = lu (infsup (A)); %! assert (p, [0, 0, 1; 1, 0, 0; 0, 1, 0]); %! assert (l == infsup ({1, 0, 0; "4/3", 1, 0; 0, "1/9", 1})); %! assert (subset (u, infsup ({3, 0, 7; 0, 9, "-0x1.2AAAAAAAAAAACp3"; 0, 0, "0x1.C25ED097B425Ep2"}, ... %! {3, 0, 7; 0, 9, "-0x1.2AAAAAAAAAAAAp3"; 0, 0, "0x1.C25ED097B426p2"}))); interval-2.1.0/inst/@infsup/mag.m0000644000000000000000000000271513031036767015002 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} mag (@var{X}) ## ## Get the magnitude of numbers in interval @var{X}, that is the maximum of ## absolute values for each element. ## ## If @var{X} is empty, @code{mag (@var{X})} is NaN. ## ## Accuracy: The result is exact. ## ## @example ## @group ## mag (infsup (-3, 2)) ## @result{} ans = 3 ## @end group ## @end example ## @seealso{@@infsup/mig, @@infsup/smig, @@infsup/inf, @@infsup/sup} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function result = mag (x) if (nargin ~= 1) print_usage (); return endif result = max (abs (x.inf), abs (x.sup)); result(isempty (x)) = nan (); endfunction %!assert (mag (infsup (-3, 4)), 4); %!assert (mag (infsup (-4, 3)), 4); interval-2.1.0/inst/@infsup/max.m0000644000000000000000000000472013031036767015021 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} max (@var{X}) ## @defmethodx {@@infsup} max (@var{X}, @var{Y}) ## @defmethodx {@@infsup} max (@var{X}, [], @var{DIM}) ## ## Compute the maximum value chosen from intervals. ## ## This function does not return the greatest element of the interval (see ## @code{sup}), but returns an interval enclosure of the function: ## @display ## max (@var{x}, @var{y}) = ( (x + y) + abs (x - y) ) / 2 ## @end display ## ## With two arguments the function is applied element-wise. Otherwise the ## maximum is computed for all interval members along dimension @var{DIM}, ## which defaults to the first non-singleton dimension. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsup (2, 3); ## y = infsup (1, 2); ## max (x, y) ## @result{} ans = [2, 3] ## @end group ## @end example ## @seealso{@@infsup/min} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = max (x, y, dim) if (not (isa (x, "infsup"))) x = infsup (x); endif switch (nargin) case 1 l = max (x.inf); u = max (x.sup); u(any (isempty (x))) = -inf; case 2 if (not (isa (y, "infsup"))) y = infsup (y); endif l = max (x.inf, y.inf); u = max (x.sup, y.sup); u(isempty (x) | isempty (y)) = -inf; case 3 if (not (builtin ("isempty", y))) warning ("max: second argument is ignored"); endif l = max (x.inf, [], dim); u = max (x.sup, [], dim); u(any (isempty (x), dim)) = -inf; otherwise print_usage (); return endswitch x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (max (infsup (2, 3), infsup (1, 2)) == infsup (2, 3)); interval-2.1.0/inst/@infsup/meshgrid.m0000644000000000000000000000657013031036767016043 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {[@var{XX}, @var{YY}] =} meshgrid (@var{X}, @var{Y}) ## @deftypemethodx {@@infsup} {[@var{XX}, @var{YY}, @var{ZZ}] =} meshgrid (@var{X}, @var{Y}, @var{Z}) ## @deftypemethodx {@@infsup} {[@var{XX}, @var{YY}] =} meshgrid (@var{X}) ## @deftypemethodx {@@infsup} {[@var{XX}, @var{YY}, @var{ZZ}] =} meshgrid (@var{X}) ## ## Given vectors of @var{X} and @var{Y} coordinates, return matrices @var{XX} ## and @var{YY} corresponding to a full 2-D grid. ## ## If the optional @var{Z} input is given, or @var{ZZ} is requested, then the ## output will be a full 3-D grid. ## ## Please note that this function does not produce multidimensional arrays in ## the case of 3-D grids like the built-in @code{meshgrid} function. This is ## because interval matrices currently only support two dimensions. The 3-D ## grid is reshaped to fit into two dimensions accordingly. ## ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-07-19 function [xx, yy, zz] = meshgrid (x, y, z) if (nargin > 3) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (nargin >= 2 && not (isa (y, "infsup"))) y = infsup (y); endif if (nargin >= 3 && not (isa (z, "infsup"))) z = infsup (z); endif switch (nargin) case 1 if (nargout >= 3) [lxx, lyy, lzz] = meshgrid (x.inf); [uxx, uyy, uzz] = meshgrid (x.sup); else [lxx, lyy] = meshgrid (x.inf); [uxx, uyy] = meshgrid (x.sup); endif case 2 if (nargout >= 3) [lxx, lyy, lzz] = meshgrid (x.inf, y.inf); [uxx, uyy, uzz] = meshgrid (x.sup, y.sup); else [lxx, lyy] = meshgrid (x.inf, y.inf); [uxx, uyy] = meshgrid (x.sup, y.sup); endif case 3 [lxx, lyy, lzz] = meshgrid (x.inf, y.inf, z.inf); [uxx, uyy, uzz] = meshgrid (x.sup, y.sup, z.sup); endswitch if (nargout >= 3 || nargin >= 3) ## Reshape 3 dimensions into 2 dimensions f = @(A) reshape (A, [size(A, 1), prod(size (A)(2 : end))]); lxx = f (lxx); uxx = f (uxx); lyy = f (lyy); uyy = f (uyy); lzz = f (lzz); uzz = f (uzz); endif xx = yy = x; xx.inf = lxx; xx.sup = uxx; yy.inf = lyy; yy.sup = uyy; if (nargout >= 3) zz = x; zz.inf = lzz; zz.sup = uzz; endif endfunction %!assert (isequal (meshgrid (infsup (0 : 3)), infsup (meshgrid (0 : 3)))); %!demo %! clf %! blue = [38 139 210] ./ 255; %! shade = [238 232 213] ./ 255; %! [x, y, z] = meshgrid (midrad (1 : 6, 0.125)); %! plot3 (x, y, z, shade, blue) %! view ([-42.5, 30]) %! box off %! set (gca, "xgrid", "on", "ygrid", "on", "zgrid", "on") interval-2.1.0/inst/@infsup/mid.m0000644000000000000000000000434513031036767015010 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} mid (@var{X}) ## ## Get the midpoint of interval @var{X}. ## ## If @var{X} is empty, @code{mid (@var{X})} is NaN. ## If @var{X} is entire, @code{mid (@var{X})} is 0. ## If @var{X} is unbounded in one direction, @code{mid (@var{X})} is positive ## or negative @code{realmax ()}. ## ## Accuracy: The result is rounded to the nearest floating point number and ## may thus be exact or not. However, it is guaranteed that the interval ## @var{X} is tightly enclosed by ## @code{[mid (@var{X}) - rad (@var{X}), mid (@var{X}) + rad (@var{X})]}. ## ## @example ## @group ## mid (infsup (2.5, 3.5)) ## @result{} ans = 3 ## @end group ## @end example ## @seealso{@@infsup/inf, @@infsup/sup, @@infsup/rad} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-05 function result = mid (x) if (nargin ~= 1) print_usage (); return endif ## First divide by 2 and then add, because this will prevent overflow. ## The different rounding modes for division will make errors of 2^-1075 ## with subnormal numbers cancel each other out, or will make the round ## to nearest prefer the side that had an underflow error. l = mpfr_function_d ('rdivide', -inf, x.inf, 2); u = mpfr_function_d ('rdivide', +inf, x.sup, 2); result = l + u; result(x.inf == -inf) = -realmax (); result(x.sup == inf) = realmax (); result(isentire (x)) = 0; result(isempty (x)) = nan (); endfunction %!assert (mid (infsup (-inf, inf)), 0); %!# from the documentation string %!assert (mid (infsup (2.5, 3.5)), 3); interval-2.1.0/inst/@infsup/mig.m0000644000000000000000000000275513031036767015016 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} mig (@var{X}) ## ## Get the mignitude of numbers in interval @var{X}, that is the minimum of ## absolute values for each element. ## ## If @var{X} is empty, @code{mig (@var{X})} is NaN. ## ## Accuracy: The result is exact. ## ## @example ## @group ## mig (infsup (-2, -1)) ## @result{} ans = 1 ## @end group ## @end example ## @seealso{@@infsup/mag, @@infsup/inf, @@infsup/sup} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function result = mig (x) if (nargin ~= 1) print_usage (); return endif result = min (abs (x.inf), abs (x.sup)); result(sign (x.inf) ~= sign (x.sup)) = 0; result(isempty (x)) = nan (); endfunction %!assert (mig (infsup (-1, 2)), 0); %!assert (mig (infsup (-42, -23)), 23); interval-2.1.0/inst/@infsup/min.m0000644000000000000000000000471213031036767015020 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} min (@var{X}) ## @defmethodx {@@infsup} min (@var{X}, @var{Y}) ## @defmethodx {@@infsup} min (@var{X}, [], @var{DIM}) ## ## Compute the minimum value chosen from intervals. ## ## This function does not return the least element of the interval (see ## @code{inf}), but returns an interval enclosure of the function: ## @display ## min (@var{x}, @var{y}) = ( (x + y) - abs (x - y) ) / 2 ## @end display ## ## With two arguments the function is applied element-wise. Otherwise the ## minimum is computed for all interval members along dimension @var{DIM}, ## which defaults to the first non-singleton dimension. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsup (2, 3); ## y = infsup (1, 2); ## min (x, y) ## @result{} ans = [1, 2] ## @end group ## @end example ## @seealso{@@infsup/max} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = min (x, y, dim) if (not (isa (x, "infsup"))) x = infsup (x); endif switch (nargin) case 1 l = min (x.inf); u = min (x.sup); l(any (isempty (x))) = inf; case 2 if (not (isa (y, "infsup"))) y = infsup (y); endif l = min (x.inf, y.inf); u = min (x.sup, y.sup); l(isempty (x) | isempty (y)) = inf; case 3 if (not (builtin ("isempty", y))) warning ("min: second argument is ignored"); endif l = min (x.inf, [], dim); u = min (x.sup, [], dim); l(any (isempty (x), dim)) = inf; otherwise print_usage (); return endswitch x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (min (infsup (2, 3), infsup (1, 2)) == infsup (1, 2)); interval-2.1.0/inst/@infsup/mince.m0000644000000000000000000000417213031036767015330 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} mince (@var{X}) ## @defmethodx {@@infsup} mince (@var{X}, @var{N}) ## ## Mince interval @var{X} into a row vector of @var{N} sub-intervals of equal ## size. ## ## The sub-intervals are returned in ascending order and may overlap due to ## round-off errors. ## ## If @var{X} is not a scalar, the result is a matrix. The default value for ## @var{N} is 100. ## ## Accuracy: The result is an accurate enclosure. ## ## @example ## @group ## mince (infsup (0, 10), 4) ## @result{} ans = 1×4 interval vector ## ## [0, 2.5] [2.5, 5] [5, 7.5] [7.5, 10] ## @end group ## @end example ## @seealso{@@infsup/linspace, @@infsup/bisect} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-07-19 function x = mince (x, n) if (nargin > 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (nargin < 2) n = 100; endif base = limit = x; idx.type = '()'; idx.subs = {isfinite(x.inf)}; base = subsasgn (base, idx, infsup (subsref (x.inf, idx))); idx.subs = {isfinite(x.sup)}; limit = subsasgn (limit, idx, infsup (subsref (x.sup, idx))); boundaries = linspace (base, limit, n + 1); l = boundaries.inf(:, 1 : end - 1); u = boundaries.sup(:, 2 : end); empty = vec (isempty (x)); l(empty, :) = inf; u(empty, :) = -inf; x.inf = l; x.sup = u; endfunction %!assert (isequal (mince (infsup (0, 10), 10), infsup (0 : 9, 1 : 10))); interval-2.1.0/inst/@infsup/minus.m0000644000000000000000000000370713031036767015373 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} minus (@var{X}, @var{Y}) ## @defopx Operator {@@infsup} {@var{X} - @var{Y}} ## ## Subtract all numbers of interval @var{Y} from all numbers of @var{X}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsup (2, 3); ## y = infsup (1, 2); ## x - y ## @result{} ans = [0, 2] ## @end group ## @end example ## @seealso{@@infsup/plus} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function x = minus (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); elseif (isa (y, "infsupdec")) ## Workaround for bug #42735 result = minus (x, y); return endif l = mpfr_function_d ('minus', -inf, x.inf, y.sup); u = mpfr_function_d ('minus', +inf, x.sup, y.inf); emptyresult = isempty (x) | isempty (y); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (infsup (2, 3) - infsup (1, 2) == infsup (0, 2)); %!# correct use of signed zeros %!test %! x = minus (infsup (0), infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/mldivide.m0000644000000000000000000002235513031036767016035 0ustar 00000000000000## Copyright 1990-2000 Institut für Angewandte Mathematik, ## Universität Karlsruhe, Germany ## Copyright 2000-2014 Wissenschaftliches Rechnen/Softwaretechnologie, ## Universität Wuppertal, Germany ## Copyright 2015-2016 Oliver Heimlich ## ## This program is derived from FastLSS in CXSC, C++ library for eXtended ## Scientific Computing (V 2.5.4), which is distributed under the terms of ## LGPLv2+. Original Author is Michael Zimmer. Migration to Octave code has ## been performed by Oliver Heimlich. ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} mldivide (@var{X}, @var{Y}) ## @defopx Operator {@@infsup} {@var{X} \ @var{Y}} ## ## Return the interval matrix left division of @var{X} and @var{Y}. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## infsup ([1, 0; 0, 2]) \ [2, 0; 0, 4] ## @result{} ans = 2×2 interval matrix ## [2] [0] ## [0] [2] ## @end group ## @end example ## @seealso{@@infsup/mtimes, @@infsup/gauss} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-17 function result = mldivide (A, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (A, "infsup"))) A = infsup (A); endif if (not (isa (b, "infsup"))) b = infsup (b); elseif (isa (b, "infsupdec")) ## Workaround for bug #42735 result = mldivide (A, b); return endif if (isscalar (A.inf)) result = ldivide (A, b); return elseif (not (issquare (A.inf))) error ("interval:InvalidOperand", "mldivide: Matrix is not square"); elseif (rows (A.inf) ~= rows (b.inf)) error ("interval:InvalidOperand", ["mldivide: ", ... "nonconformant arguments ", ... "(op1 is " num2str(rows (A.inf)) "×" num2str(columns (A.inf)) ",", ... " op2 is " num2str(rows (b.inf)) "×" num2str(columns (b.inf)) ")"]); elseif (isempty (A.inf)) result = infsup (zeros (0, columns (b.inf))); return endif ## Maximum number of iterations during the verification step cfg.maxIterVer = 5; ## Epsilon for the verification step ## (used for the Epsilon inflation during verification) cfg.epsVer = 1e-1; ## Maximum number of iterations during the refinement step cfg.maxIterRef = 5; ## Epsilon for the refinement step (stopping criterion for refinement step) cfg.epsRef = 1e-5; ## Maximum number of iterations during residual correction ## (not available for K=1) cfg.maxIterResCorr = 10; ## Epsilon for the residual correction cfg.epsResCorr = 1e-6; ## An approximate inverse R of A is computed. Then an approximate solution ## x1 is computed applying a conventional residual iteration. For the final ## verification, an interval residual iteration is performed. An enclosure of ## the unique solution is returned. ## ## If this first step fails, the solver will try to compute a verified solution ## by using an approximate inverse of double length. This second step takes ## considerably longer than the first step, because all computations must be ## performed using high precision scalar products. ## Compute midpoints of A and b for future reference Am = mid (A); bm = mid (b); ## Approximate inversion (non-interval computation) [R, cond] = inv (Am); if (cond == 0) result = gauss (A, b); return endif ## Part 1 ===================================================================== ## Approximate solution x1 (non-interval computation) x1 = R * bm; x1 += R * (bm - Am * x1); ## Interval residual x x = mtimes (R, b - mtimes (A, x1, "valid"), "valid"); C = eye (rows (R)) - mtimes (R, A, "valid"); ## Verify solution x1 + x [x, verified] = verify_and_refine (x, C, cfg, "valid"); if (verified) result = x1 + x; return endif ## Part 2 ===================================================================== ## R2 = inv (R * Am), with correctly rounded dot product R2 = zeros (size (R)); for i = 1 : rows (R) for j = 1 : columns (R) R2 (i, j) = mpfr_vector_dot_d (0.5, R (i, :), Am (:, j)); endfor endfor [R2, cond] = inv (R2); if (cond == 0) result = gauss (A, b); return endif ## R = R2 * R with correctly rounded dot product; error in R2 R1_ = R2_ = zeros (size (R)); for i = 1 : rows (R) for j = 1 : columns (R) [R1_(i, j), R2_(i, j)] = mpfr_vector_dot_d (0.5, R2 (i, :), R (:, j)); endfor endfor R = R1_; R2 = R2_; clear R1_ R2_; ## Loop over all right hand sides C_computed = false (); result = infsup (zeros (size (b.inf))); for s = 1 : columns (b.inf) s_idx.type = "()"; s_idx.subs = {":", s}; ## x1 = R * bm + R2 * bm with correctly rounded dot product; error in x0 x1 = x0 = zeros (rows (R), 1); parfor i = 1 : rows (R) [x1(i), x0(i)] = mpfr_vector_dot_d (0.5, [R(i, :), R2(i, :)], ... [bm(:, s); bm(:, s)]); endparfor ## Residual iteration (non-interval computation) for k = 1 : cfg.maxIterResCorr ## d = bm - Am * x1 - Am * x0 with correctly rounded dot product d = zeros (rows (R), 1); parfor i = 1 : rows (R) d (i) = mpfr_vector_dot_d (0.5, ... [bm(i, s), Am(i, :), Am(i, :)], ... [1; -x1; -x0]); endparfor ## y0 = x0 + R * d + R2 * d with correctly rounded dot product y0 = zeros (rows (R), 1); parfor i = 1 : rows (R) y0 (i) = mpfr_vector_dot_d (0.5, ... [x0(i), R(i, :), R2(i, :)], ... [1; d; d]); endparfor d = x1 + y0; p = relative_error (d, x1 + x0); if (p >= cfg.epsResCorr && k < cfg.maxIterResCorr) ## x0 = x1 + x0 - d with correctly rounded sum parfor i = 1 : rows (R) x0 (i) = mpfr_vector_sum_d (0.5, [x1(i), x0(i), -d(i)]); endparfor endif x1 = d; if (p < cfg.epsResCorr) break endif endfor ## compute enclosure y+Y1 of the residuum b-A*x1 of the approximation x1 ## and initialize x:= (R+R2)*(b-A*x1), C:= I-(R+R2)*A ## y = mid (b - A * x1) y = mid ([subsref(b, s_idx), A] * [1; -x1]); ## Y1 = b - A * x1 - y Y1 = [subsref(b, s_idx), A, y] * [1; -x1; -1]; ## x = R * y + R2 * y + R * Y1 + R2 * Y1 x = [R, R2, R, R2] * [y; y; Y1; Y1]; ## Verifying solution x1 + x ... if (all (x.inf == 0 & x.sup == 0)) ## exact solution! (however, not necessarily unique!) subsasgn (result, s_idx, x1); continue endif if (not (C_computed)) ## C = I - R * A - R2 * A (lazy computation) C = [eye(rows (R)), R, R2] * [eye(rows (R)); -A; -A]; C_computed = true (); endif [x, verified] = verify_and_refine (x, C, cfg, "tight"); if (not (verified)) error ("Verification failed") endif ## The exact solution lies x1 + x subsasgn (result, s_idx, x1 + x); endfor endfunction ## Perform an epsilon inflation function y = blow (x, eps) y = nextout ((1 + eps) .* x - eps .* x); endfunction ## Compute component-wise the maximum relative error function e = relative_error (new, old) nonzero = old ~= 0 & (1e6 * abs (new) >= abs (old)); e = max (abs ((new (nonzero) - old (nonzero)) ./ old (nonzero))); if (isempty (e)) e = 0; endif endfunction ## Interval iteration until inclusion is obtained (or max. iteration count) function [x, verified] = verify_and_refine (x0, C, cfg, accuracy) verified = false (); x = x0; for p = 1 : cfg.maxIterVer y = blow (x, cfg.epsVer); # epsilon inflation x = x0 + mtimes (C, y, accuracy); # new iterate verified = all (all (subset (x, y))); if (verified) break endif endfor if (verified) ## Iterative refinement for p = 1 : cfg.maxIterRef y = x; x = intersect (x0 + mtimes (C, x, accuracy), x); if (p == cfg.maxIterRef) break endif distance = max (abs (x.inf - y.inf), ... abs (x.sup - y.sup)); if (max (max (distance)) <= cfg.epsRef) break endif endfor endif endfunction %!# unique solution %!assert (infsup ([1, 0; 0, 2]) \ [2, 0; 0, 4] == [2, 0; 0 2]); %!# no solution %!assert (all (isempty (infsup ([1, 0; 2, 0]) \ [3; 0]))); %!# many solutions %!assert (infsup ([1, 0; 2, 0]) \ [4; 8] == infsup ([4; -inf], [4; inf])); %!assert (all (subset (infsup ([2, -1; -1, 2], [4, 1; 1, 4]) \ infsup ([-3; .8], [3; .8]), infsup ([-2.3; -1.1], [2.3; 1.6])))); interval-2.1.0/inst/@infsup/mpower.m0000644000000000000000000000656013031036767015551 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} mpower (@var{X}, @var{Y}) ## @defopx Operator {@@infsup} {@var{X} ^ @var{Y}} ## ## Return the matrix power operation of @var{X} raised to the @var{Y} power. ## ## If @var{X} is a scalar, this function and @code{power} are equivalent. ## Otherwise, @var{X} must be a square matrix and @var{Y} must be a single ## integer. ## ## Warning: This function is not defined by IEEE Std 1788-2015. ## ## Accuracy: The result is a valid enclosure. The result is tightest for ## @var{Y} in @{0, 1, 2@}. ## ## @example ## @group ## infsup (magic (3)) ^ 2 ## @result{} ans = 3×3 interval matrix ## [91] [67] [67] ## [67] [91] [67] ## [67] [67] [91] ## @end group ## @end example ## @seealso{@@infsup/pow, @@infsup/pown, @@infsup/pow2, @@infsup/pow10, @@infsup/exp} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-31 function result = mpower (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (isscalar (x)) ## Short-circuit for scalars result = power (x, y); return endif if (not (isreal (y)) || fix (y) ~= y) error ("interval:InvalidOperand", ... "mpower: only integral powers can be computed"); endif if (not (issquare (x.inf))) error ("interval:InvalidOperand", ... "mpower: must be square matrix"); endif ## Implements log-time algorithm A.1 in ## Heimlich, Oliver. 2011. “The General Interval Power Function.” ## Diplomarbeit, Institute for Computer Science, University of Würzburg. ## http://exp.ln0.de/heimlich-power-2011.htm. result = infsup (eye (length (x))); while (y ~= 0) if (rem (y, 2) == 0) # y is even [x.inf, x.sup] = mpfr_matrix_sqr_d (x.inf, x.sup); y /= 2; else # y is odd result = mtimes (result, x); if (all (vec (isempty (result))) || all (vec (isentire (result)))) ## We can stop the computation here, this is a fixed point break endif if (y > 0) y --; else y ++; if (y == 0) ## Inversion after computation of a negative power. ## Inversion should be the last step, because it is not ## tightest and would otherwise increase rounding errors. result = inv (result); endif endif endif endwhile endfunction %!# from the documentation string %!assert (isequal (infsup (magic (3)) ^ 2, infsup (magic (3) ^ 2))); %!# correct use of signed zeros %!test %! x = mpower (infsup (eye (2)), 2); %! assert (signbit (inf (x(1, 2)))); %! assert (not (signbit (sup (x(1, 2))))); interval-2.1.0/inst/@infsup/mrdivide.m0000644000000000000000000000354313031036767016041 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} mrdivide (@var{X}, @var{Y}) ## @defopx Operator {@@infsup} {@var{X} / @var{Y}} ## ## Return the interval matrix right division of @var{X} and @var{Y}. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## infsup ([1, 2; 3, 4]) / [3, 4; 1, 2] ## @result{} ans = 2×2 interval matrix ## [0] [1] ## [1] [0] ## @end group ## @end example ## @seealso{@@infsup/mtimes} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-31 function result = mrdivide (x, y) if (nargin ~= 2) print_usage (); return endif if (isa (y, "infsupdec")) if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif elseif (not (isa (x, "infsup"))) x = infsup (x); endif if (isa (x, "infsupdec")) if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif elseif (not (isa (y, "infsup"))) y = infsup (y); endif if (isscalar (x) || isscalar (y)) result = rdivide (x, y); return endif result = mldivide (y', x')'; endfunction %!# from the documentation string %!assert (infsup ([1, 2; 3, 4]) / [3, 4; 1, 2] == infsup ([0, 1; 1, 0])); interval-2.1.0/inst/@infsup/mtimes.m0000644000000000000000000001225613031036767015535 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} mtimes (@var{X}, @var{Y}) ## @defopx Method {@@infsup} mtimes (@var{X}, @var{Y}, @var{ACCURACY}) ## @defopx Operator {@@infsup} {@var{X} * @var{Y}} ## ## Compute the interval matrix multiplication. ## ## The @var{ACCURACY} can be set to @code{tight} (default) or @code{valid}. ## With @code{valid} accuracy an algorithm for fast matrix multiplication based ## on BLAS routines is used. The latter is published by ## Siegried M. Rump (2012), “Fast interval matrix multiplication,” ## Numerical Algorithms 61(1), 1-34. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsup ([1, 2; 7, 15], [2, 2; 7.5, 15]); ## y = infsup ([3, 3; 0, 1], [3, 3.25; 0, 2]); ## x * y ## @result{} ans = 2×2 interval matrix ## [3, 6] [5, 10.5] ## [21, 22.5] [36, 54.375] ## @end group ## @end example ## @seealso{@@infsup/mrdivide} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-31 function result = mtimes (x, y, accuracy) if (nargin < 2 || nargin > 3 || (nargin == 3 && not (ischar (accuracy)))) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); elseif (isa (y, "infsupdec")) ## Workaround for bug #42735 result = mtimes (x, y); return endif if (isscalar (x) || isscalar (y)) result = times (x, y); return endif if (size (x.inf, 2) ~= size (y.inf, 1)) error ("interval:InvalidOperand", ... "operator *: nonconformant arguments"); endif if (nargin >= 3) switch (accuracy) case "valid" ## Fast matrix multiplication uses rounding mode switches, which ## might not work on all systems. Thus, we validate whether the ## BLAS routines respect rounding modes correctly on the current ## platform and fall back to the slow implementation otherwise. persistent use_rounding_mode = check_rounding_mode (); if (use_rounding_mode) result = fast_mtimes (x, y); return else warning ('interval:rounding', ... ['mtimes: rounding modes not supported, falling ', ... 'back to slow but accurate matrix multiplication']); endif case "tight" ## Default mode otherwise print_usage(); return endswitch endif ## mtimes could also be computed with a for loop and the dot operation. ## However, that would take significantly longer (loop + missing JIT-compiler, ## several OCT-file calls), so we use an optimized ## OCT-file for that particular operation. [l, u] = mpfr_matrix_mul_d (x.inf, y.inf, x.sup, y.sup); result = infsup (l, u); endfunction function C = fast_mtimes (A, B) ## Implements Algorithm 4.8 ## IImul7: interval interval multiplication with 7 point matrix multiplications ## Rump, Siegried M. 2012. “Fast interval matrix multiplication.” ## Numerical Algorithms 61(1), 1-34. ## http://www.ti3.tu-harburg.de/paper/rump/Ru11a.pdf. ## ## Although this is the slowest of the published fast algorithms, it is the ## most accurate. [mA, rA] = rad (A); [mB, rB] = rad (B); rhoA = sign (mA) .* min (abs (mA), rA); rhoB = sign (mB) .* min (abs (mB), rB); unwind_protect __setround__ (+inf); rC = abs (mA) * rB + rA * (abs (mB) + rB) + (-abs (rhoA)) * abs (rhoB); u = mA * mB + rhoA * rhoB + rC; __setround__ (-inf); l = mA * mB + rhoA * rhoB - rC; unwind_protect_cleanup __setround__ (0.5); # restore default rounding mode (to nearest) end_unwind_protect C = infsup (l, u); endfunction function works = check_rounding_mode () try unwind_protect works = true (); __setround__ (+inf); works &= (1 + realmin > 1); works &= ([1 1 -1] * [1; realmin; realmin] > 1); __setround__ (-inf); works &= (1 + realmin == 1); works &= ([1 1 -1] * [1; realmin; realmin] < 1); unwind_protect_cleanup __setround__ (0.5); end_unwind_protect catch works = false (); end_try_catch endfunction %!# from the documentation string %!assert (infsup ([1, 2; 7, 15], [2, 2; 7.5, 15]) * infsup ([3, 3; 0, 1], [3, 3.25; 0, 2]) == infsup ([3, 5; 21, 36], [6, 10.5; 22.5, 54.375])); %!# matrix multiplication using BLAS routines %!assert (mtimes (infsup ([1, 2; 7, 15], [2, 2; 7.5, 15]), infsup ([3, 3; 0, 1], [3, 3.25; 0, 2]), 'valid') == infsup ([3, 5; 21, 36], [6, 10.5; 22.5, 54.375])); interval-2.1.0/inst/@infsup/mulrev.m0000644000000000000000000001603213031036767015545 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{X} =} mulrev (@var{B}, @var{C}, @var{X}) ## @deftypemethodx {@@infsup} {@var{X} =} mulrev (@var{B}, @var{C}) ## @deftypemethodx {@@infsup} {[@var{U}, @var{V}] =} mulrev (@var{B}, @var{C}) ## @deftypemethodx {@@infsup} {[@var{U}, @var{V}] =} mulrev (@var{B}, @var{C}, @var{X}) ## ## Compute the reverse multiplication function or the two-output division. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{x .* b ∈ @var{C}} for any @code{b ∈ @var{B}}. ## ## This function is similar to interval division @code{@var{C} ./ @var{B}}. ## However, it treats the case 0/0 as “any real number” instead of “undefined”. ## ## Interval division, considered as a set, can have zero, one or two disjoint ## connected components as a result. If called with two output parameters, ## this function returns the components separately. @var{U} contains the ## negative or unique component, whereas @var{V} contains the positive ## component in cases with two components. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## c = infsup (1); ## b = infsup (-inf, inf); ## [u, v] = mulrev (b, c) ## @result{} ## u = [-Inf, 0] ## v = [0, Inf] ## @end group ## @end example ## @seealso{@@infsup/times} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function [u, v] = mulrev (b, c, x) if (nargin < 2 || nargin > 3) print_usage (); return endif if (nargin < 3) x = infsup (-inf, inf); endif if (not (isa (b, "infsup"))) b = infsup (b); endif if (not (isa (c, "infsup"))) c = infsup (c); endif if (not (isa (x, "infsup"))) x = infsup (x); endif ## Resize, if scalar × matrix or vector × matrix or scalar × vector if (not (size_equal (b.inf, c.inf))) b.inf = ones (size (c.inf)) .* b.inf; b.sup = ones (size (c.inf)) .* b.sup; c.inf = ones (size (b.inf)) .* c.inf; c.sup = ones (size (b.inf)) .* c.sup; endif u = v = x; u.inf = v.inf = inf (size (b.inf)); u.sup = v.sup = -inf (size (b.inf)); emptyresult = b.inf == inf | c.inf == inf ... | (b.inf == 0 & b.sup == 0 & (c.sup < 0 | c.inf > 0)); # x * 0 ~= 0 twocomponents = b.inf < 0 & b.sup > 0 & not (emptyresult) & ... (c.sup < 0 | c.inf > 0); onecomponent = not (twocomponents) & not (emptyresult); u.inf(twocomponents) = -inf; v.sup(twocomponents) = inf; dom = twocomponents & c.inf <= 0 & c.sup >= 0; u.sup(dom) = v.inf(dom) = 0; dom = twocomponents & c.inf > 0; if (not (isempty (dom))) u.sup(dom) = mpfr_function_d ('rdivide', +inf, c.inf(dom), b.inf(dom)); v.inf(dom) = mpfr_function_d ('rdivide', -inf, c.inf(dom), b.sup(dom)); endif dom = twocomponents & c.sup < 0; if (not (isempty (dom))) u.sup(dom) = mpfr_function_d ('rdivide', +inf, c.sup(dom), b.sup(dom)); v.inf(dom) = mpfr_function_d ('rdivide', -inf, c.sup(dom), b.inf(dom)); endif dom = onecomponent & b.inf >= 0 & c.inf >= 0; if (not (isempty (dom))) b.inf(dom & b.inf == 0) = +0; c.inf(dom & c.inf == 0) = +0; u.inf(dom) = mpfr_function_d ('rdivide', -inf, c.inf(dom), b.sup(dom)); u.sup(dom) = mpfr_function_d ('rdivide', +inf, c.sup(dom), b.inf(dom)); endif dom = onecomponent & b.sup <= 0 & c.inf >= 0; if (not (isempty (dom))) b.sup(dom & b.sup == 0) = -0; c.inf(dom & c.inf == 0) = +0; u.inf(dom) = mpfr_function_d ('rdivide', -inf, c.sup(dom), b.sup(dom)); u.sup(dom) = mpfr_function_d ('rdivide', +inf, c.inf(dom), b.inf(dom)); endif dom = onecomponent & b.inf >= 0 & c.sup <= 0; if (not (isempty (dom))) b.inf(dom & b.inf == 0) = +0; c.sup(dom & c.sup == 0) = -0; u.inf(dom) = mpfr_function_d ('rdivide', -inf, c.inf(dom), b.inf(dom)); u.sup(dom) = mpfr_function_d ('rdivide', +inf, c.sup(dom), b.sup(dom)); endif dom = onecomponent & b.sup <= 0 & c.sup <= 0; if (not (isempty (dom))) b.sup(dom & b.sup == 0) = -0; c.sup(dom & c.sup == 0) = -0; u.inf(dom) = mpfr_function_d ('rdivide', -inf, c.sup(dom), b.inf(dom)); u.sup(dom) = mpfr_function_d ('rdivide', +inf, c.inf(dom), b.sup(dom)); endif dom = onecomponent & c.inf < 0 & c.sup > 0 & b.inf > 0; if (not (isempty (dom))) u.inf(dom) = mpfr_function_d ('rdivide', -inf, c.inf(dom), b.inf(dom)); u.sup(dom) = mpfr_function_d ('rdivide', +inf, c.sup(dom), b.inf(dom)); endif dom = onecomponent & c.inf < 0 & c.sup > 0 & b.sup < 0; if (not (isempty (dom))) u.inf(dom) = mpfr_function_d ('rdivide', -inf, c.sup(dom), b.sup(dom)); u.sup(dom) = mpfr_function_d ('rdivide', +inf, c.inf(dom), b.sup(dom)); endif dom = onecomponent & b.inf <= 0 & b.sup >= 0 & c.inf <= 0 & c.sup >= 0; # x * 0 == 0 u.inf(dom) = -inf; u.sup(dom) = inf; u.inf(u.inf == 0) = -0; u.sup(u.sup == 0) = +0; v.inf(v.inf == 0) = -0; v.sup(v.sup == 0) = +0; ## Intersect u and v with x u.inf = max (u.inf, x.inf); u.sup = min (u.sup, x.sup); v.inf = max (v.inf, x.inf); v.sup = min (v.sup, x.sup); if (nargout < 2) u.inf(twocomponents) = min (u.inf(twocomponents), v.inf(twocomponents)); u.sup(twocomponents) = max (u.sup(twocomponents), v.sup(twocomponents)); emptyresult = u.inf > u.sup; u.inf(emptyresult) = inf; u.sup(emptyresult) = -inf; else empty_u = u.inf > u.sup; u.inf(empty_u) = inf; u.sup(empty_u) = -inf; empty_v = v.inf > v.sup; v.inf(empty_v) = inf; v.sup(empty_v) = -inf; ## It can happen that the twocomponents result has only one component, ## because x is positive for example. Then, only one component shall be ## returned swap = twocomponents & isempty (u) & not (isempty (v)); [u.inf(swap), u.sup(swap), v.inf(swap), v.sup(swap)] = deal (... v.inf(swap), v.sup(swap), u.inf(swap), u.sup(swap)); endif endfunction %!#IEEE Std 1788-2015 mulRevToPair examples %!test %! [u, v] = mulrev (infsup (0), infsup (1, 2)); %! assert (isempty (u) & isempty (v)); %!test %! [u, v] = mulrev (infsup (0), infsup (0, 1)); %! assert (isentire (u) & isempty (v)); %!test %! [u, v] = mulrev (infsup (1), infsup (1, 2)); %! assert (eq (u, infsup (1, 2)) & isempty (v)); %!test %! [u, v] = mulrev (infsup (1, inf), infsup (1)); %! assert (eq (u, infsup (0, 1)) & isempty (v)); %!test %! [u, v] = mulrev (infsup (-1, 1), infsup (1, 2)); %! assert (eq (u, infsup (-inf, -1)) & eq (v, infsup (1, inf))); %!test %! [u, v] = mulrev (infsup (-inf, inf), infsup (1)); %! assert (eq (u, infsup (-inf, 0)) & eq (v, infsup (0, inf))); interval-2.1.0/inst/@infsup/ndims.m0000644000000000000000000000252713031036767015351 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} ndims (@var{A}) ## ## Return the number of dimensions of @var{A}. ## ## For any array, the result will always be larger than or equal to 2. ## Trailing singleton dimensions are not counted. ## @seealso{@@infsup/length, @@infsup/numel, @@infsup/size, @@infsup/rows, @@infsup/columns} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-29 function result = ndims (a) if (nargin ~= 1) print_usage (); return endif result = ndims (a.inf); endfunction %!assert (ndims (infsup ([])), 2); %!assert (ndims (infsup (0)), 2); %!assert (ndims (infsup (magic (3))), 2); interval-2.1.0/inst/@infsup/ne.m0000644000000000000000000000267313031036767014643 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} ne (@var{A}, @var{B}) ## @defopx Operator {@@infsup} {@var{A} ~= @var{B}} ## @defopx Operator {@@infsup} {@var{A} != @var{B}} ## ## Compare intervals @var{A} and @var{B} for inequality. ## ## True, if @var{A} contains a number which is not a member in @var{B} or vice ## versa. False, if all numbers from @var{A} are also contained in @var{B} and ## vice versa. ## ## @seealso{@@infsup/eq, @@infsup/subset, @@infsup/interior, @@infsup/disjoint} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function result = ne (a, b) if (nargin ~= 2) print_usage (); return endif result = not (eq (a, b)); endfunction %!assert (ne (infsup (1, 2), infsup (1, 3))); interval-2.1.0/inst/@infsup/newdec.m0000644000000000000000000000342713031036767015504 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} newdec (@var{X}) ## ## Create a decorated interval from a bare interval. ## ## The decorated interval will carry the best possible decoration, i. e., ## @code{trv} for empty intervals, @code{dac} for unbound intervals, and ## @code{com} for common intervals. ## ## If @var{X} already is decorated, nothing happens. In particular, the ## decoration will not be changed in order to not lose any information. ## ## @example ## @group ## newdec (infsup (2, 3)) ## @result{} ans = [2, 3]_com ## @end group ## @end example ## @seealso{@@infsupdec/infsupdec} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-12 function xd = newdec (x) if (nargin ~= 1) print_usage (); return endif warning ("off", "interval:ImplicitPromote", "local"); xd = infsupdec (x); endfunction %!# from the documentation string %!assert (isequal (newdec (infsup (2, 3)), infsupdec (2, 3))); %!assert (isequal (newdec (infsupdec (2, 3)), infsupdec (2, 3))); %!assert (isequal (newdec (infsupdec (1, "trv")), infsupdec (1, "trv"))); interval-2.1.0/inst/@infsup/nextout.m0000644000000000000000000000335013031036767015740 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} nextout (@var{X}) ## ## Increases the interval's boundaries in each direction to the next number. ## ## This is the equivalent function to IEEE 754's nextDown and nextUp. ## ## @example ## @group ## x = infsup (1); ## nextout (x) == infsup (1 - eps / 2, 1 + eps) ## @result{} ans = 1 ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function x = nextout (x) if (nargin ~= 1) print_usage (); return endif persistent delta = pow2 (-1074); l = mpfr_function_d ('minus', -inf, x.inf, delta); u = mpfr_function_d ('plus', +inf, x.sup, delta); l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!test %! x = nextout (infsup (1)); %! assert (inf (x), 1 - eps / 2); %! assert (sup (x), 1 + eps); %!# correct use of signed zeros %!test %! x = nextout (infsup (pow2 (-1074))); %! assert (signbit (inf (x))); %!test %! x = nextout (infsup (-pow2 (-1074))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/norm.m0000644000000000000000000001572513031036767015216 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} norm (@var{A}, @var{P}) ## @defmethodx {@@infsup} norm (@var{A}, @var{P}, @var{Q}) ## @defmethodx {@@infsup} norm (@var{A}, @var{P}, @var{OPT}) ## ## Compute the p-norm (or p,q-norm) of the matrix @var{A}. ## ## If @var{A} is a matrix: ## @table @asis ## @item @var{P} = 1 ## 1-norm, the largest column sum of the absolute values of @var{A}. ## @item @var{P} = inf ## Infinity norm, the largest row sum of the absolute values of @var{A}. ## @item @var{P} = "fro" ## Frobenius norm of @var{A}, @code{sqrt (sum (diag (@var{A}' * @var{A})))}. ## @end table ## ## If @var{A} is a vector or a scalar: ## @table @asis ## @item @var{P} = inf ## @code{max (abs (@var{A}))}. ## @item @var{P} = -inf ## @code{min (abs (@var{A}))}. ## @item @var{P} = "fro" ## Frobenius norm of @var{A}, @code{sqrt (sumsq (abs (A)))}. ## @item @var{P} = 0 ## Hamming norm - the number of nonzero elements. ## @item other @var{P}, @code{@var{P} > 1} ## p-norm of @var{A}, @code{(sum (abs (@var{A}) .^ @var{P})) ^ (1/@var{P})}. ## @item other @var{P}, @code{@var{P} < 1} ## p-pseudonorm defined as above. ## @end table ## ## It @var{Q} is used, compute the subordinate matrix norm induced by the ## vector p-norm and vector q-norm. The subordinate p,q-norm is defined as the ## maximum of @code{norm (@var{A} * @var{x}, @var{Q})}, where @var{x} can be ## chosen such that @code{norm (@var{x}, @var{P}) = 1}. For @code{@var{P} = 1} ## and @code{@var{Q} = inf} this is the max norm, ## @code{max (max (abs (@var{A})))}. ## ## If @var{OPT} is the value "rows", treat each row as a vector and compute its ## norm. The result returned as a column vector. Similarly, if @var{OPT} is ## "columns" or "cols" then compute the norms of each column and return a row ## vector. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## norm (infsup (magic (3)), "fro") ## @result{} ans ⊂ [16.881, 16.882] ## @end group ## @group ## norm (infsup (magic (3)), 1, "cols") ## @result{} ans = 1×3 interval vector ## ## [15] [15] [15] ## ## @end group ## @end example ## @seealso{@@infsup/abs, @@infsup/max} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-01-26 function result = norm (A, p, opt) if (nargin > 3 || not (isa (A, "infsup"))) print_usage (); return endif if (nargin < 2) p = 2; opt = ""; elseif (nargin < 3) opt = ""; endif if (strcmp (p, "inf")) p = inf; endif switch (opt) case "rows" dim = 2; case {"columns", "cols"} dim = 1; case "" if (isvector (A.inf)) ## Try to find non-singleton dimension dim = find (size (A.inf) > 1, 1); if (isempty (dim)) dim = 1; endif else dim = []; endif otherwise ## Subordinate p,q matrix norm q = opt; dim = []; if (strcmp (q, "inf")) q = inf; endif if (p == 1 && q == inf) ## Max norm result = max (max (abs (A))); return elseif (p == 1 && q == 1) ## 1-norm, computed below elseif (p == inf && q == inf) ## inf-norm, computed below elseif (p == inf && q == 1) ## inf,1-norm ## Computation via z' * A * y ## with y and z being vectors of -1 and 1 entries. ## Important papers by Jiří Rohn ## ## Computing the Norm || A ||_{inf,1} is NP-Hard ## Linear and Multilinear Algebra 47 (2000), 195-204. ## http://dx.doi.org/10.1080/03081080008818644 ## http://uivtx.cs.cas.cz/~rohn/publist/norm.pdf ## ## R. Farhadsefat, J. Rohn and T. Lotfi, ## Norms of Interval Matrices. ## Technical Report No. 1122, Institute of Computer Science, ## Academy of Sciences of the Czech Republic, Prague 2011. ## http://www3.cs.cas.cz/ics/reports/v1122-11.pdf ## http://uivtx.cs.cas.cz/~rohn/publist/normlaa.pdf result = 0; ## Unfortunately this is NP-hard # 2^n different logical vectors of length n y = dec2bin ((1 : pow2 (columns (A)))' - 1) == '1'; # 2^m different logical vectors of length m z = dec2bin ((1 : pow2 (rows (A)))' - 1) == '1'; for i = 1 : rows (y) idx = substruct ("()", {":", y(i, :)}); B = subsasgn (A, idx, ... uminus (subsref (A, idx))); for j = 1 : rows (z) idx = substruct ("()", {z(j, :), ":"}); C = subsasgn (B, idx, ... uminus (subsref (B, idx))); result = max (result, sum (vec (C))); endfor endfor return else error ("norm: Particular option or p,q-norm is not yet supported") endif endswitch if (isempty (dim)) ## Matrix norm switch (p) case 1 result = max (sum (abs (A), 1)); case inf result = max (sum (abs (A), 2)); case "fro" result = sqrt (sumsq (vec (A))); otherwise error ("norm: Particular matrix norm is not yet supported") endswitch else ## Vector norm switch (p) case inf result = max (abs (A), [], dim); case -inf result = min (abs (A), [], dim); case {"fro", 2} result = sqrt (sumsq (A, dim)); case 0 ## Hamming norm: the number of non-zero elements result = sum (subsasgn (subsasgn (subsasgn (A, ... substruct ("()", {ismember(0, A)}), "[0, 1]"), ... substruct ("()", {A == 0}), 0), ... substruct ("()", {A > 0 | A < 0}), 1), ... dim); otherwise warning ("off", "interval:ImplicitPromote", "local"); result = (sum (abs (A) .^ p, dim)) .^ (1 ./ infsup (p)); endswitch endif endfunction %!test %! A = infsup ("0 [Empty] [0, 1] 1"); %! assert (isequal (norm (A, 0, "cols"), infsup ("0 [Empty] [0, 1] 1"))); %!assert (norm (infsup (magic (3)), inf, 1) == 45); %!assert (norm (infsup (-magic (3), magic (3)), inf, 1) == "[0, 45]"); interval-2.1.0/inst/@infsup/nthroot.m0000644000000000000000000001405113031036767015727 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} nthroot (@var{X}, @var{N}) ## ## Compute the real n-th root of @var{X}. ## ## Accuracy: The result is a valid enclosure. The result is a tight ## enclosure for @var{n} ≥ -2. The result also is a tight enclosure if the ## reciprocal of @var{n} can be computed exactly in double-precision. ## @seealso{@@infsup/pown, @@infsup/pownrev, @@infsup/realsqrt, @@infsup/cbrt} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-20 function x = nthroot (x, n) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isnumeric (n)) || fix (n) ~= n) error ("interval:InvalidOperand", "nthroot: degree is not an integer"); endif even = mod (n, 2) == 0; if (even) x = intersect (x, infsup (0, inf)); endif switch sign (n) case +1 emptyresult = isempty (x); l = mpfr_function_d ('nthroot', -inf, x.inf, n); u = mpfr_function_d ('nthroot', +inf, x.sup, n); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; case -1 emptyresult = isempty (x) ... | (x.sup <= 0 & even) | (x.inf == 0 & x.sup == 0); if (even) l = zeros (size (x.inf)); u = inf (size (x.inf)); select = x.inf > 0 & isfinite (x.inf); if (any (select(:))) u(select) = invrootrounded (x.inf(select), -n, +inf); endif select = x.sup > 0 & isfinite (x.sup); if (any (select(:))) l(select) = invrootrounded (x.sup(select), -n, -inf); endif l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; else # uneven l = zeros (size (x.inf)); u = inf (size (x.inf)); select = x.inf > 0 & isfinite (x.inf); if (any (select(:))) u(select) = invrootrounded (x.inf(select), -n, +inf); endif select = x.sup > 0 & isfinite (x.sup); if (any (select(:))) l(select) = invrootrounded (x.sup(select), -n, -inf); endif notpositive = x.sup <= 0; l(emptyresult | notpositive) = inf; u(emptyresult | notpositive) = -inf; l(l == 0) = -0; # this is only the positive part pos = x; pos.inf = l; pos.sup = u; l = zeros (size (x.inf)); u = inf (size (x.inf)); select = x.sup < 0 & isfinite (x.sup); if (any (select(:))) u(select) = invrootrounded (-x.sup(select), -n, +inf); endif select = x.inf < 0 & isfinite (x.inf); if (any (select(:))) l(select) = invrootrounded (-x.inf(select), -n, -inf); endif notnegative = x.inf >= 0; l(emptyresult | notnegative) = inf; u(emptyresult | notnegative) = -inf; u(u == 0) = +0; neg = x; neg.inf = -u; neg.sup = -l; x = union (pos, neg); endif otherwise error ("interval:InvalidOperand", "nthroot: degree must not be zero"); endswitch endfunction function x = invrootrounded (z, n, direction) ## We cannot compute the inverse of the n-th root of z in a single step. ## Thus, we use three different ways for computation, each of which has an ## intermediate result with possible rounding errors and can't guarantee to ## produce a correctly rounded result. ## When we finally merge the 3 results, it is still not guaranteed to be ## correctly rounded. However, chances are good that one of the three ways ## produced a “relatively good” result. ## ## x1: z ^ (- 1 / n) ## x2: 1 / root (z, n) ## x3: root (1 / z, n) inv_n = 1 ./ infsup (n); if (direction > 0) x1 = z; select = z > 1; x1(select) = mpfr_function_d ('pow', direction, z(select), -inv_n.inf); select = z < 1; x1(select) = mpfr_function_d ('pow', direction, z(select), -inv_n.sup); else x1 = z; select = z > 1; x1(select) = mpfr_function_d ('pow', direction, z(select), -inv_n.sup); select = z < 1; x1(select) = mpfr_function_d ('pow', direction, z(select), -inv_n.inf); endif if (issingleton (inv_n)) ## We are lucky: The result is correctly rounded x = x1; return endif x2 = mpfr_function_d ('rdivide', direction, 1, ... mpfr_function_d ('nthroot', -direction, z, n)); x3 = mpfr_function_d ('nthroot', direction, ... mpfr_function_d ('rdivide', direction, 1, z), n); ## Choose the most accurate result if (direction > 0) x = min (min (x1, x2), x3); else x = max (max (x1, x2), x3); endif endfunction %!assert (nthroot (infsup (25, 36), 2) == infsup (5, 6)); %!# correct use of signed zeros %!test %! x = nthroot (infsup (0), 2); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = nthroot (infsup (0, inf), -2); %! assert (signbit (inf (x))); %!test %! x = nthroot (infsup (0, inf), -3); %! assert (signbit (inf (x))); interval-2.1.0/inst/@infsup/numel.m0000644000000000000000000000247313031036767015357 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} numel (@var{A}) ## ## Return the number of elements in the interval object @var{A}. ## @seealso{@@infsup/length, @@infsup/size, @@infsup/rows, @@infsup/columns} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-29 function result = numel (a) if (nargin ~= 1) print_usage (); return endif result = numel (a.inf); endfunction %!assert (numel (infsup ([])), 0); %!assert (numel (infsup (0)), 1); %!assert (numel (infsup (zeros (3, 1))), 3); %!assert (numel (infsup (zeros (1, 4))), 4); %!assert (numel (infsup (zeros (3, 4))), 12); interval-2.1.0/inst/@infsup/overlap.m0000644000000000000000000001106613031036767015705 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {[@var{STATE}, @var{BITMASK}] =} overlap(@var{A}, @var{B}) ## ## Extensively compare the positions of intervals @var{A} and @var{B} on the ## real number line. ## ## Return the @var{STATE} as a string and the @var{BITMASK} of the state as an ## uint16 number, which represents one of the 16 possible states by taking a ## value 2^i (i = 0 … 15). ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @table @asis ## @item @code{bothEmpty}, 2^0 ## Both intervals are empty ## @item @code{firstEmpty}, 2^1 ## Interval @var{A} is empty and @var{B} is not ## @item @code{secondEmpty}, 2^2 ## Interval @var{A} is not empty, but @var{B} is ## @item @code{before}, 2^3 ## [- - - @var{A} - - -]@ @ @ [- - - @var{B} - - -] ## @item @code{meets}, 2^4 ## [- - - @var{A} - - -][- - - @var{B} - - -] ## @*Interval @var{A}'s upper boundary equals interval @var{B}'s lower boundary ## and neither consists of a single point only. ## @item @code{overlaps}, 2^5 ## [- - - @var{A} - - - [= = =] - - - @var{B} - - -] ## @item @code{starts}, 2^6 ## [[= = = @var{A} = = =] - - - @var{B} - - -] ## @item @code{containedBy}, 2^7 ## [- - - @var{B} - - - [= = = @var{A} = = =] - - -] ## @item @code{finishes}, 2^8 ## [- - - @var{B} - - - [= = = @var{A} = = =]] ## @item @code{equals}, 2^9 ## Both intervals are equal (and not empty) ## @item @code{finishedBy}, 2^10 ## [- - - @var{A} - - - [= = = @var{B} = = =]] ## @item @code{contains}, 2^11 ## [- - - @var{A} - - - [= = = @var{B} = = =] - - -] ## @item @code{startedBy}, 2^12 ## [[= = = @var{B} = = =] - - - @var{A} - - -] ## @item @code{overlappedBy}, 2^13 ## [- - - @var{B} - - - [= = =] - - - @var{A} - - -] ## @item @code{metBy}, 2^14 ## [- - - @var{B} - - -][- - - @var{A} - - -] ## @*Interval @var{A}'s lower boundary equals interval @var{B}'s upper boundary ## and neither consists of a single point only. ## @item @code{after}, 2^15 ## [- - - @var{B} - - -]@ @ @ [- - - @var{A} - - -] ## @end table ## ## @seealso{@@infsup/eq, @@infsup/subset, @@infsup/interior, @@infsup/disjoint} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function [state, bitmask] = overlap (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (b, "infsup"))) b = infsup (b); endif emptya = isempty (a); emptyb = isempty (b); notempty = not (emptya | emptyb); comparison = {... "bothEmpty", (emptya & emptyb); ... "firstEmpty", (emptya & not (emptyb)); ... "secondEmpty", (emptyb & not (emptya)); ... "before", (notempty & a.sup < b.inf); ... "meets", (notempty & a.inf < a.sup & a.sup == b.inf & b.inf < b.sup); ... "overlaps", (notempty & a.inf < b.inf & b.inf < a.sup & a.sup < b.sup); ... "starts", (notempty & a.inf == b.inf & a.sup < b.sup); ... "containedBy", (notempty & b.inf < a.inf & a.sup < b.sup); ... "finishes", (notempty & b.inf < a.inf & a.sup == b.sup); ... "equals", (notempty & a.inf == b.inf & a.sup == b.sup); ... "finishedBy", (notempty & a.inf < b.inf & b.sup == a.sup); ... "contains", (notempty & a.inf < b.inf & b.sup < a.sup); ... "startedBy", (notempty & b.inf == a.inf & b.sup < a.sup); ... "overlappedBy", ... (notempty & b.inf < a.inf & a.inf < b.sup & b.sup < a.sup); ... "metBy", (notempty & b.inf < b.sup & b.sup == a.inf & a.inf < a.sup); ... "after", (notempty & b.sup < a.inf)}; if (nargout >= 2) bitmask = zeros (size (comparison{1, 2}), "uint16"); for i = 1 : rows (comparison) bitmask(comparison{i, 2}) = pow2 (16 - i); endfor endif state = cell (size (comparison{1, 2})); for i = 1 : rows (comparison) state(comparison{i, 2}) = comparison{i, 1}; endfor if (numel (state) == 1) state = state{1}; endif endfunction %!assert (overlap (infsup (1, 2), infsup (3, 4)), "before"); interval-2.1.0/inst/@infsup/plot.m0000644000000000000000000001160613031036767015213 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} plot (@var{X}, @var{Y}) ## @defmethodx {@@infsup} plot (@var{Y}) ## @defmethodx {@@infsup} plot (@var{X}, @var{Y}, @var{COLOR}) ## @defmethodx {@@infsup} plot (@var{X}, @var{Y}, @var{COLOR}, @var{EDGECOLOR}) ## ## Create a 2D-plot of intervals. ## ## If either of @var{X} or @var{Y} is an empty interval, nothing is plotted. ## If both @var{X} and @var{Y} are singleton intervals, a single point is ## plotted. If only one of @var{X} and @var{Y} is a singleton interval, a ## single line is plotted. If neither of @var{X} and @var{Y} is a singleton ## interval, a filled rectangle is plotted. ## ## If @var{X} or @var{Y} are matrices, each pair of elements is plotted ## separately. No connection of the interval areas is plotted, because that ## kind of interpolation would be wrong in general (in the sense that the ## actual values are enclosed by the plot). ## ## Without parameter @var{X}, the intervals in @var{Y} are plotted as points or ## lines, which are parallel to the y axis, at the coordinates ## @code{@var{X} = [1, …, n]}. ## ## If no @var{COLOR} is given, the current @command{colormap} is used. Use ## @var{COLOR} = @option{none} to disable plotting of filled rectangles. If an ## optional parameter @var{EDGECOLOR} is given, rectangles will have visible ## edges in a distinct color. ## ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-05-10 function plot (x, y, color, edgecolor) if (nargin > 4) print_usage (); return endif warning ("off", "interval:ImplicitPromote", "local"); if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (nargin >= 2 && not (isa (y, "infsupdec"))) y = infsupdec (y); endif if (nargin < 2) y = x; ## x = 1 ... n x = infsupdec (reshape (1 : numel (y.inf), size (y.inf))); endif if (nargin < 3 || isempty (color)) # don't use last row of colormap, which would often be just white color = colormap ()(ceil (rows (colormap ()) / 2), :); if (nargin < 4) # will only be used for lines and dots edgecolor = colormap ()(1, :); endif elseif (nargin < 4) # will only be used for lines and dots edgecolor = color; endif oldhold = ishold (); if (not (oldhold)) clf hold on endif pointsize = 3; edgewidth = 2; unwind_protect empty = isempty (x) | isempty (y); points = issingleton (x) & issingleton (y); lines = xor (issingleton (x), issingleton (y)) & not (empty); boxes = not (points | lines | empty); if (any (points(:))) scatter (x.inf(points), y.inf(points), ... pointsize, ... edgecolor, ... 'filled'); endif if (any (lines(:))) x_line = [vec(x.inf(lines)), vec(x.sup(lines))]'; y_line = [vec(y.inf(lines)), vec(y.sup(lines))]'; line (x_line, y_line, ... 'color', edgecolor, ... 'linewidth', edgewidth); endif if (any (boxes(:))) x_box = [vec(x.inf(boxes)), vec(x.sup(boxes))](:, [1 2 2 1])'; y_box = [vec(y.inf(boxes)), vec(y.sup(boxes))](:, [1 1 2 2])'; if (nargin < 4) edgecolor = 'none'; endif fill (x_box, y_box, [], ... 'linewidth', edgewidth, ... 'edgecolor', edgecolor, ... 'facecolor', color); endif unwind_protect_cleanup ## Reset hold state if (not (oldhold)) hold off endif end_unwind_protect endfunction %!# this test is rather pointless %!test %! clf %! plot (empty ()); %! close %!demo %! clf %! hold on %! plot (infsup (0), infsup (0)); %! plot (infsup (1, 2), infsup (0)); %! plot (infsup (0), infsup (1, 2)); %! plot (infsup (1, 2), infsup (1, 2)); %! axis ([-.5, 2.5, -.5, 2.5]); %! hold off %!demo %! clf %! plot (infsup (-rand (50, 1), +rand (50, 1))); %!demo %! clf %! hold on %! axis off %! range = infsup (0, 9); %! x = linspace (inf (range), sup (range), 250); %! X = mince (range, 9); %! f = @ (x) 0.5 * sin (x) .* x .^ 2; %! y = f (x); %! Y = f (X); %! plot (range, f (range), [42 161 152]/255); %! plot (X, Y, [238 232 213]/255, [88 110 117]/255); %! plot (x, y, '-', 'color', [220 50 47]/255, 'linewidth', 2); %! hold off interval-2.1.0/inst/@infsup/plot3.m0000644000000000000000000002412613031036767015277 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} plot3 (@var{X}, @var{Y}, @var{Z}) ## @defmethodx {@@infsup} plot3 (@var{X}, @var{Y}, @var{Z}, @var{COLOR}) ## @defmethodx {@@infsup} plot3 (@var{X}, @var{Y}, @var{Z}, @var{COLOR}, @var{EDGECOLOR}) ## ## Create a 3D-plot of intervals. ## ## If either of @var{X}, @var{Y} or @var{Z} is an empty interval, nothing is ## plotted. If all are singleton intervals, a single point is plotted. If ## two intervals are a singleton interval, a line is plotted. If one interval ## is a singleton interval, a rectangle is plotted. If neither of @var{X}, ## @var{Y} and @var{Z} is a singleton interval, a cuboid is plotted. ## ## When interval matrices of equal size are given, each triple of elements is ## printed separately. ## ## No connection of the interval areas is plotted, because that kind of ## interpolation would be wrong in general (in the sense that the actual values ## are enclosed by the plot). ## ## If no @var{COLOR} is given, the current @command{colormap} is used. Use ## @var{COLOR} = @option{none} to disable plotting of filled rectangles. If an ## optional parameter @var{EDGECOLOR} is given, rectangles and cuboids will ## have visible edges in a distinct color. ## ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-05-17 function plot3 (x, y, z, color, edgecolor) if (nargin < 3 || nargin > 5) print_usage (); return endif warning ("off", "interval:ImplicitPromote", "local"); if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif if (not (isa (z, "infsupdec"))) z = infsupdec (z); endif if (nargin < 4 || isempty (color)) color = 'interp'; if (nargin < 5) # will only be used for lines and dots edgecolor = colormap ()(1, :); endif elseif (nargin < 5) # will only be used for lines and dots edgecolor = color; endif oldhold = ishold (); if (not (oldhold)) clf hold on endif pointsize = 3; edgewidth = 2; unwind_protect empty = isempty (x) | isempty (y) | isempty (z); number_of_singletons = issingleton (x) + issingleton (y) + issingleton (z); points = number_of_singletons == 3; lines = number_of_singletons == 2 & not (empty); boxes = number_of_singletons <= 1 & not (empty); if (any (points(:))) scatter3 (x.inf(points), y.inf(points), z.inf(points), ... pointsize, ... edgecolor, ... 'filled'); endif if (any (lines(:))) x_line = [vec(x.inf(lines)), vec(x.sup(lines))]'; y_line = [vec(y.inf(lines)), vec(y.sup(lines))]'; z_line = [vec(z.inf(lines)), vec(z.sup(lines))]'; line (x_line, y_line, z_line, ... 'linewidth', edgewidth, ... 'color', edgecolor); endif ## + z ## | ## ## B--------D ## /| /| ## / | / | ## / A-----/--C -+ ## F--------H / y ## | / | / ## |/ |/ ## E--------G ## ## / ## + x ## The variables A through H help indexing the relevant rows in vertices. [A, B, C, D, E, F, G, H] = num2cell ((0 : 7) * sum (sum (boxes))) {:}; vertices = [vec(x.inf(boxes)), vec(y.inf(boxes)), vec(z.inf(boxes)); ... vec(x.inf(boxes)), vec(y.inf(boxes)), vec(z.sup(boxes)); ... vec(x.inf(boxes)), vec(y.sup(boxes)), vec(z.inf(boxes)); ... vec(x.inf(boxes)), vec(y.sup(boxes)), vec(z.sup(boxes)); ... vec(x.sup(boxes)), vec(y.inf(boxes)), vec(z.inf(boxes)); ... vec(x.sup(boxes)), vec(y.inf(boxes)), vec(z.sup(boxes)); ... vec(x.sup(boxes)), vec(y.sup(boxes)), vec(z.inf(boxes)); ... vec(x.sup(boxes)), vec(y.sup(boxes)), vec(z.sup(boxes))]; if (any (boxes(:))) ## To support gnuplot as a plotting backend, we have to use ## triangular instead of rectangular patches (see bug #45594). faces = zeros (0, 3); ## x-y rectangle at z.inf select = vec (find (x.inf(boxes) < x.sup(boxes) & ... y.inf(boxes) < y.sup(boxes))); faces = [faces; ... A+select, C+select, G+select; ... G+select, E+select, A+select]; ## x-z rectangle at y.inf select = vec (find (x.inf(boxes) < x.sup(boxes) & ... z.inf(boxes) < z.sup(boxes))); faces = [faces; ... A+select, E+select, F+select; ... F+select, B+select, A+select]; ## y-z rectangle at x.inf select = vec (find (y.inf(boxes) < y.sup(boxes) & ... z.inf(boxes) < z.sup(boxes))); faces = [faces; ... A+select, B+select, D+select; ... D+select, C+select, A+select]; ## The cuboids have 6 sides instead of only one select = vec (find (x.inf(boxes) < x.sup(boxes) & ... y.inf(boxes) < y.sup(boxes) & ... z.inf(boxes) < z.sup(boxes))); faces = [faces; ... ## x-y rectangle at z.sup B+select, F+select, H+select; ... H+select, D+select, B+select; ... ## x-z rectangle at y.sup C+select, D+select, H+select; H+select, G+select, C+select; ... ## y-z rectangle at x.inf E+select, G+select, H+select; ... H+select, F+select, E+select]; patch ('Vertices', vertices, ... 'Faces', faces, ... 'EdgeColor', 'none', ... 'FaceColor', color, ... 'FaceVertexCData', vertices (:, 3)); ## Draw edges for the rectangles. ## ## B B--------D D ## /| | | /| ## / | | | / | ## / A A--------C/ C or A--------C ## F / F--------H H / / / ## | / | | | / / / ## |/ | | |/ / / ## E E--------G G E--------G ## ## Note: The edges A-B, C-D, E-F, and G-H may be drawn twice. ## However, the benefit is that this approach produces only closed ## routes between the points, which is beneficial since it prevents ## graphics artifacts from line endings. Line endings might be rendered ## differently and we want to prevent that. if (nargin >= 5) faces = zeros (0, 4); ## x-y rectangle at z.inf select = vec (find (x.inf(boxes) < x.sup(boxes) & ... y.inf(boxes) < y.sup(boxes) & ... z.inf(boxes) == z.sup(boxes))); faces = [faces; ... A+select, C+select, G+select, E+select]; ## x-z rectangle at y.inf select = vec (find (x.inf(boxes) < x.sup(boxes) & ... z.inf(boxes) < z.sup(boxes))); faces = [faces; ... A+select, E+select, F+select, B+select]; ## y-z rectangle at x.inf select = vec (find (y.inf(boxes) < y.sup(boxes) & ... z.inf(boxes) < z.sup(boxes))); faces = [faces; ... A+select, B+select, D+select, C+select]; ## The cuboids have 6 sides instead of only one. ## It suffices to draw edges for 2 more sides (4 sides in total). select = vec (find (x.inf(boxes) < x.sup(boxes) & ... y.inf(boxes) < y.sup(boxes) & ... z.inf(boxes) < z.sup(boxes))); faces = [faces; ... ## x-z rectangle at y.sup C+select, D+select, H+select, G+select; ... ## y-z rectangle at x.inf E+select, G+select, H+select, F+select]; patch ('Vertices', vertices, ... 'Faces', faces, ... 'EdgeColor', edgecolor, ... 'LineWidth', edgewidth, ... 'FaceColor', 'none'); endif endif unwind_protect_cleanup ## Reset hold state and set the viewpoint for 3-D graphs (the latter would ## not happen automatically since above functions operate on 2-D objects). if (not (oldhold)) hold off view (3) endif end_unwind_protect endfunction %!# this test is rather pointless %!test %! clf %! plot3 (empty (), empty (), empty ()); %! close %!demo %! clf %! colormap hot %! x = y = z = (1 : 3) + infsup ("[0, 1]"); %! plot3 (x, y, z); %! grid on %!demo %! clf %! colormap jet %! z = 1 : 8; %! x = y = infsup ("[-1, 1]") ./ z; %! plot3 (x, y, z); %! grid on %!demo %! clf %! [x, y] = meshgrid (mince (infsup ("[-5, 5]"), 20), ... %! mince (infsup ("[0.1, 5]"), 10)); %! z = log (hypot (x, y)); %! blue = [38 139 210]/255; base2 = [238 232 213]/255; %! plot3 (x, y, z, base2, blue); %! view (330, 12) %!demo %! clf %! [x, y] = meshgrid (midrad (-10 : 0.5 : 10, .25)); %! z = sin (hypot (x, y)) .* hypot (x, y); %! plot3 (mid (x), mid (y), z); %! grid on interval-2.1.0/inst/@infsup/plus.m0000644000000000000000000000367613031036767015230 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} plus (@var{X}, @var{Y}) ## @defopx Operator {@@infsup} {@var{X} + @var{Y}} ## ## Add all numbers of interval @var{X} to all numbers of @var{Y}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsup (2, 3); ## y = infsup (1, 2); ## x + y ## @result{} ans = [3, 5] ## @end group ## @end example ## @seealso{@@infsup/minus} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function x = plus (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); elseif (isa (y, "infsupdec")) ## Workaround for bug #42735 result = plus (x, y); return endif l = mpfr_function_d ('plus', -inf, x.inf, y.inf); u = mpfr_function_d ('plus', +inf, x.sup, y.sup); emptyresult = isempty (x) | isempty (y); l (emptyresult) = inf; u (emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %! assert (infsup (2, 3) + infsup (1, 2) == infsup (3, 5)); %!# correct use of signed zeros %!test %! x = plus (infsup (0), infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/polyval.m0000644000000000000000000001152313031036767015721 0ustar 00000000000000## Copyright 1995 Rolf Hammer, Matthias Hocks, Dietmar Ratz ## Copyright 1990-2000 Institut für Angewandte Mathematik, ## Universität Karlsruhe, Germany ## Copyright 2000-2014 Wissenschaftliches Rechnen/Softwaretechnologie, ## Universität Wuppertal, Germany ## Copyright 2015-2016 Oliver Heimlich ## ## This program is derived from RPolyEval in CXSC, C++ library for eXtended ## Scientific Computing (V 2.5.4), which is distributed under the terms of ## LGPLv2+. Migration to Octave code has been performed by Oliver Heimlich. ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} polyval (@var{P}, @var{X}) ## ## Evaluate polynomial @var{P} with argument @var{X}. ## ## Horner's scheme is used to evaluate a first approximation. The result is ## improved with iterative refinement. ## ## Accuracy: The result is a tight enclosure for polynomials of degree 1 or ## less. For polynomials of higher degree the result is a valid enclosure. ## For @var{X} being no singleton interval, the algorithm suffers from the ## dependency problem. ## ## @example ## @group ## output_precision (16, 'local') ## polyval (infsup ([3 4 2 1]), 42) # 3x^3 + 4x^2 + 2x^1 + 1 | x = 42 ## @result{} [229405] ## polyval (infsup ([3 4 2 1]), "42?") # ... | x = 41.5 .. 42.5 ## @result{} [221393.125, 237607.875] ## @end group ## @end example ## @seealso{@@infsup/fzero} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-05-29 function result = polyval (p, x) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (p, "infsup"))) p = infsup (p); endif if (not (isscalar (x))) error ('point of evaluation X must be a scalar') endif if (not (isvector (p))) error ('polynomial P must be a vector of coefficients') endif if (isempty (x)) result = x; endif; n = numel (p); switch (n) case 0 # empty sum result = infsup (0); return case 1 # p .* x.^0 result = p; return case 2 # p(1) .* x.^1 + p(2) .* x.^0 result = fma (x, subsref (p, substruct ("()", {1})), ... subsref (p, substruct ("()", {2}))); return endswitch if (x == 0) result = subsref (p, substruct ("()", {n})); return elseif (x == 1) result = sum (p); return elseif (x == -1) result = dot (p, (-1) .^ ((n : -1 : 1) - 1)); return endif kMax = 20; idxNext.type = '()'; idxLast.type = '()'; ## Compute first approximation using Horner's scheme yy = infsup (zeros (n, 1)); idxNext.subs = {1}; result = subsref (p, idxNext); yy = subsasgn (yy, idxNext, result); for i = 2 : n idxNext.subs = {i}; result = fma (result, x, subsref (p, idxNext)); yy = subsasgn (yy, idxNext, result); endfor y = zeros (n, kMax); for k = 1 : kMax lastresult = result; if (isempty (result)) break endif ## Iterative refinement ## Store middle of residual as the next correction of y y(:, k) = mid (yy); ## Computation of the residual [r] and ## evaluation of the interval system A*[y] = [r] yy = infsup (zeros (n, 1)); for i = 2 : n idxNext.subs = {i}; idxLast.subs = {i-1}; coef = subsref (p, idxNext); yy = subsasgn (yy, idxNext, dot (... [subsref(yy, idxLast), coef, y(i, 1 : k), y(i - 1, 1 : k)], ... [x, 1, -ones(1, k), x.*ones(1, k)])); endfor ## Determination of a new enclosure of p (x) idxLast.subs = {n}; result = intersect (result, sum ([subsref(yy, idxLast), y(n, 1 : k)])); if (eq (result, lastresult)) ## No improvement break endif if (mpfr_function_d ('plus', +inf, inf (result), pow2 (-1074)) >= ... sup (result)) ## 1 ULP accuracy reached break endif endfor endfunction %!assert (polyval (infsup (42), 0) == 42); %!assert (polyval (infsup ([42 42]), 0) == 42); %!assert (polyval (infsup ([42 42]), 1) == 84); %!assert (polyval (infsup ([42 42]), -1) == 0); %!assert (polyval (infsup ([-42 42 42]), .5) == -42*0.5^2 + 42*0.5 + 42); %!assert (polyval (infsup (vec (pascal (3))), 0.1) == "[0X6.502E9A7231A08P+0, 0X6.502E9A7231A0CP+0]"); interval-2.1.0/inst/@infsup/postpad.m0000644000000000000000000000503213031036767015703 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} postpad (@var{X}, @var{L}) ## @defmethodx {@@infsup} postpad (@var{X}, @var{L}, @var{C}) ## @defmethodx {@@infsup} postpad (@var{X}, @var{L}, @var{C}, @var{DIM}) ## ## Append the scalar interval value @var{C} to the interval vector @var{X} ## until it is of length @var{L}. If @var{C} is not given, a value of 0 is ## used. ## ## If @code{length (@var{X}) > L}, elements from the end of @var{X} are removed ## until an interval vector of length @var{L} is obtained. ## ## If @var{X} is an interval matrix, elements are appended or removed from each ## row or column. ## ## If the optional argument DIM is given, operate along this dimension. ## ## @example ## @group ## postpad (infsup (1 : 3), 5, 42) ## @result{} ans = 1×5 interval vector ## [1] [2] [3] [42] [42] ## @end group ## @end example ## @seealso{@@infsup/reshape, @@infsup/cat, @@infsup/prepad, @@infsup/resize} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-19 function x = postpad (x, len, c, dim) if (nargin < 2 || nargin > 4) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (isa (len, "infsup")) error ("interval:InvalidOperand", "postpad: len must not be an interval"); endif if (nargin < 3) c = infsup (0); elseif (not (isa (c, "infsup"))) c = infsup (c); endif if (nargin < 4) if (isvector (x.inf) && not (isscalar (x.inf))) dim = find (size (x.inf) ~= 1, 1); else dim = 1; endif elseif (isa (dim, "infsup")) error ("interval:InvalidOperand", "postpad: dim must not be an interval"); endif x.inf = postpad (x.inf, len, c.inf, dim); x.sup = postpad (x.sup, len, c.sup, dim); endfunction %!assert (postpad (infsup (1:3), 4, 4) == infsup (1:4)); %!assert (postpad (infsup (1:3), 2, 4) == infsup (1:2)); interval-2.1.0/inst/@infsup/pow.m0000644000000000000000000000675313031036767015051 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} pow (@var{X}, @var{Y}) ## ## Compute the simple power function on intervals defined by ## @code{exp (@var{Y} * log (@var{X}))}. ## ## The function is only defined where @var{X} is positive or where @var{X} is ## zero and @var{Y} is positive. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## pow (infsup (5, 6), infsup (2, 3)) ## @result{} ans = [25, 216] ## @end group ## @end example ## @seealso{@@infsup/pown, @@infsup/pow2, @@infsup/pow10, @@infsup/exp, @@infsup/power} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = pow (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); endif ## Resize, if scalar × matrix if (not (size_equal (x.inf, y.inf))) x.inf = ones (size (y.inf)) .* x.inf; x.sup = ones (size (y.inf)) .* x.sup; y.inf = ones (size (x.inf)) .* y.inf; y.sup = ones (size (x.inf)) .* y.sup; endif ## Intersect with domain x = intersect (x, infsup (0, inf)); y.inf(x.sup == 0) = max (0, y.inf(x.sup == 0)); y.sup(y.inf > y.sup) = -inf; y.inf(y.inf > y.sup) = inf; ## Simple cases with no limit values, see Table 3.3 in ## Heimlich, Oliver. 2011. “The General Interval Power Function.” ## Diplomarbeit, Institute for Computer Science, University of Würzburg. ## http://exp.ln0.de/heimlich-power-2011.htm. ## ## The min/max is located at the boundaries of the input intervals. Like with ## the times function we do not start a case by case analysis but simply ## compute all four combinations for each result boundary. ## ## We have to compensate for boundary x.inf = -0 with the abs function. ## Otherwise the limit values of the MPFR pow function would be wrong. l = min (min (min (... mpfr_function_d ('pow', -inf, abs (x.inf), y.inf), ... mpfr_function_d ('pow', -inf, abs (x.inf), y.sup)), ... mpfr_function_d ('pow', -inf, x.sup, y.inf)), ... mpfr_function_d ('pow', -inf, x.sup, y.sup)); u = max (max (max (... mpfr_function_d ('pow', +inf, abs (x.inf), y.inf), ... mpfr_function_d ('pow', +inf, abs (x.inf), y.sup)), ... mpfr_function_d ('pow', +inf, x.sup, y.inf)), ... mpfr_function_d ('pow', +inf, x.sup, y.sup)); emptyresult = isempty (x) | isempty (y) | (x.sup == 0 & y.sup == 0); l(emptyresult) = inf; u(emptyresult) = -inf; ## Fix 0 ^ positive = 0 u(x.sup == 0 && u == 1) = 0; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (pow (infsup (5, 6), infsup (2, 3)) == infsup (25, 216)); %!# correct use of signed zeros %!test %! x = pow (infsup (0), infsup (1)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/pow10.m0000644000000000000000000000325313031036767015202 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} pow10 (@var{X}) ## ## Compute @code{10^x} for all numbers in @var{X}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## pow10 (infsup (5)) ## @result{} ans = [1e+05] ## @end group ## @end example ## @seealso{@@infsup/log10, @@infsup/pow, @@infsup/pow2, @@infsup/exp} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = pow10 (x) if (nargin ~= 1) print_usage (); return endif ## pow10 is monotonically increasing from (-inf, 0) to (inf, inf) l = mpfr_function_d ('pow10', -inf, x.inf); # this works for empty intervals u = mpfr_function_d ('pow10', +inf, x.sup); # ... this does not l(l == 0) = -0; u(isempty (x)) = -inf; x.inf = l; x.sup = u; endfunction %!# from the documentation string %! assert (pow10 (infsup (5)) == infsup (100000)); %!# correct use of signed zeros %!test %! x = pow10 (infsup (-inf, -realmax)); %! assert (signbit (inf (x))); interval-2.1.0/inst/@infsup/pow2.m0000644000000000000000000000323313031036767015121 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} pow2 (@var{X}) ## ## Compute @code{2^x} for all numbers in @var{X}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## pow2 (infsup (5)) ## @result{} ans = [32] ## @end group ## @end example ## @seealso{@@infsup/log2, @@infsup/pow, @@infsup/pow10, @@infsup/exp} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function x = pow2 (x) if (nargin ~= 1) print_usage (); return endif ## pow2 is monotonically increasing from (-inf, 0) to (inf, inf) l = mpfr_function_d ('pow2', -inf, x.inf); # this works for empty intervals u = mpfr_function_d ('pow2', +inf, x.sup); # ... this does not l(l == 0) = -0; u(isempty (x)) = -inf; x.inf = l; x.sup = u; endfunction %!# from the documentation string %! assert (pow2 (infsup (5)) == infsup (32)); %!# correct use of signed zeros %!test %! x = pow2 (infsup (-inf, -realmax)); %! assert (signbit (inf (x))); interval-2.1.0/inst/@infsup/power.m0000644000000000000000000002236413031036767015374 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} power (@var{X}, @var{Y}) ## @defopx Operator {@@infsup} {@var{X} .^ @var{Y}} ## ## Compute the general power function on intervals, which is defined for ## (1) any positive base @var{X}; (2) @code{@var{X} = 0} when @var{Y} is ## positive; (3) negative base @var{X} together with integral exponent @var{Y}. ## ## This definition complies with the common complex valued power function, ## restricted to the domain where results are real, plus limit values where ## @var{X} is zero. The complex power function is defined by ## @code{exp (@var{Y} * log (@var{X}))} with initial branch of complex ## logarithm and complex exponential function. ## ## Warning: This function is not defined by IEEE Std 1788-2015. However, it ## has been published as “pow2” in O. Heimlich, M. Nehmeier, J. Wolff von ## Gudenberg. 2013. “Variants of the general interval power function.” ## Soft Computing. Volume 17, Issue 8, pp 1357–1366. ## Springer Berlin Heidelberg. DOI 10.1007/s00500-013-1008-8. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## infsup (-5, 6) .^ infsup (2, 3) ## @result{} ans = [-125, +216] ## @end group ## @end example ## @seealso{@@infsup/pow, @@infsup/pown, @@infsup/pow2, @@infsup/pow10, @@infsup/exp} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2011 function z = power (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); elseif (isa (y, "infsupdec")) ## Workaround for bug #42735 z = power (x, y); return endif ## Short circuit integral powers, e.g., x.^2 if (any ((y.inf == 0)(:))) ## can't use pown, because 0^0 must evaluate to [Empty] elseif (any ((y.inf ~= y.sup)(:)) || ... any ((not (isfinite (y.inf)))(:)) || ... any ((fix (y.inf) ~= y.inf))(:)) ## can't use pown, because y is no integer else z = pown (x, y.inf); return endif ## Resize, if scalar × matrix or vector × matrix or scalar × vector if (not (size_equal (x.inf, y.inf))) x.inf = ones (size (y.inf)) .* x.inf; x.sup = ones (size (y.inf)) .* x.sup; y.inf = ones (size (x.inf)) .* y.inf; y.sup = ones (size (x.inf)) .* y.sup; endif idx.type = "()"; emptyresult = x.inf == inf | y.inf == inf | ... (x.inf == 0 & x.sup == 0 & y.sup <= 0); zPlus = pow (x, y); # pow is only defined for x > 0 zContainsZero = y.inf > 0 & x.inf <= 0 & x.sup >= 0; zMinus = repmat (infsup (), size (x.inf)); xMinusWithIntegerY = not (emptyresult) & x.inf < 0 & ... not (isfinite (y.inf) & isfinite (y.sup) & ... ceil (y.inf) > floor (y.sup)); if (any (xMinusWithIntegerY(:))) ySingleInteger = isfinite (y.inf) & isfinite (y.sup) & ... ceil (y.inf) == floor (y.sup); ## y contains a single integer idx.subs = {xMinusWithIntegerY & ySingleInteger}; if (any (idx.subs{1}(:))) xMinus = intersect (subsref (x, idx), ... # intersect to infsup (-inf, 0)); # speed up computation zMinus = subsasgn (zMinus, idx, ... pown (xMinus, ceil (subsref (y.inf, idx)))); endif ## y contains several integers idx.subs = {xMinusWithIntegerY & not(ySingleInteger)}; if (any (idx.subs{1}(:))) zMinus = subsasgn (zMinus, idx, ... multipleintegers (subsref (x, idx), ... subsref (y, idx))); endif endif z = union (zMinus, zPlus); idx.subs = {zContainsZero}; z = subsasgn (z, idx, union (subsref (z, idx), 0)); z.inf(emptyresult) = inf; z.sup(emptyresult) = -inf; endfunction function z = multipleintegers (x, y) ## Value of power on NEGATIVE base and multiple integral exponents ## Intersect to simplify computation x = intersect (x, infsup (-inf, 0)); y = intersect (ceil (y), floor (y)); assert (all (all (y.inf < y.sup & x.inf < 0))); ## Implements Table 3.4 in ## Heimlich, Oliver. 2011. “The General Interval Power Function.” ## Diplomarbeit, Institute for Computer Science, University of Würzburg. ## http://exp.ln0.de/heimlich-power-2011.htm. z = repmat (infsup (), size (x.inf)); idx.type = "()"; idx.subs = {(x.sup <= -1 & y.sup <= 0)}; if (any (idx.subs{1}(:))) xsup_idx = subsref (x.sup, idx); y_idx = subsref (y, idx); z = subsasgn (z, idx, twointegers (xsup_idx, goe (y_idx), gee (y_idx))); endif idx.subs = {(-1 <= x.inf & 0 <= y.inf)}; if (any (idx.subs{1}(:))) xinf_idx = subsref (x.inf, idx); y_idx = subsref (y, idx); z = subsasgn (z, idx, twointegers (xinf_idx, loe (y_idx), lee (y_idx))); endif idx.subs = {((x.sup <= -1 | (x.inf < -1 & -1 < x.sup)) & ... ((0 <= y.inf & not (-1 <= x.inf)) | (y.inf <= -1 & 1 <= y.sup)))}; if (any (idx.subs{1}(:))) xinf_idx = subsref (x.inf, idx); y_idx = subsref (y, idx); z = subsasgn (z, idx, twointegers (xinf_idx, goe (y_idx), gee (y_idx))); endif idx.subs = {(((x.inf < -1 & -1 < x.sup) | -1 <= x.inf) & ... ((y.inf <= -1 & 1 <= y.sup) | (y.sup <= 0 & not (x.sup <= -1))))}; if (any (idx.subs{1}(:))) xsup_idx = subsref (x.sup, idx); y_idx = subsref (y, idx); z = subsasgn (z, idx, union (subsref (z, idx), ... twointegers (xsup_idx, loe (y_idx), lee (y_idx)))); endif endfunction function z = twointegers (base, oddexponent, evenexponent) ## Range of power on single NEGATIVE base and two integral exponents ## ## twointegers (base, oddexponent, evenexponent) returns the interval ## [-abs(base) ^ oddexponent, abs(base) ^ evenexponent] with correctly ## rounded boundaries. ## ## twointegers (0, oddexponent, evenexponent) returns the limit value of ## [-abs(base) ^ oddexponent, abs(base) ^ evenexponent] for base -> 0. ## ## twointegers (-inf, oddexponent, evenexponent) returns the limit value of ## [-abs(base) ^ oddexponent, abs(base) ^ evenexponent] for base -> -inf. ## ## Note: oddexponent must not necessarily be odd, since it can be an ## overestimation of an actual odd exponent, if its magnitude is > 2^53. assert (all (all (oddexponent ~= 0))); assert (all (all (not (isfinite (oddexponent) & isfinite (evenexponent)) | ... abs (oddexponent - evenexponent) <= 1))); base = abs (base); z = infsup (zeros (size (base))); z.inf(base == 0 & oddexponent < 0) = -inf; z.sup(base == 0 & evenexponent < 0) = inf; z.sup(base == 0 & evenexponent == 0) = 1; z.inf(base == inf & oddexponent > 0) = -inf; z.sup(base == inf & evenexponent > 0) = inf; z.sup(base == inf & evenexponent == 0) = 1; z.sup(base == 1) = 1; z.sup(0 < base & base < 1 & evenexponent <= 0) = inf; z.sup(1 < base & base < inf & evenexponent >= 0) = inf; select = 0 < base & base < inf & isfinite (evenexponent); if (any (select(:))) z.sup(select) = sup (pown (infsup (base(select)), evenexponent(select))); endif z.inf(base == 1) = -1; z.inf(0 < base & base < 1 & oddexponent <= 0) = -inf; z.inf(1 < base & base < inf & oddexponent >= 0) = -inf; bigexponent = oddexponent == evenexponent; select = 0 < base & base < inf & bigexponent; z.inf(select) = -z.sup(select); select = 0 < base & base < inf & isfinite (oddexponent) & not (bigexponent); if (any (select(:))) z.inf(select) = -sup (pown (infsup (base(select)), oddexponent(select))); endif endfunction function e = goe (y) ## GOE Greatest odd exponent in interval y e = floor (y.sup); even = rem (e, 2) == 0; e(even) = mpfr_function_d ('minus', +inf, e(even), 1); e(e < y.inf) = nan (); # no odd number in interval endfunction function e = gee (y) ## GEE Greatest even exponent in interval y e = floor (y.sup); odd = rem (e, 2) ~= 0; e(odd) = mpfr_function_d ('minus', +inf, e(odd), 1); e(e < y.inf) = nan (); # no even number in interval endfunction function e = loe (y) ## LOE Least odd exponent in interval y e = ceil (y.inf); even = rem (e, 2) == 0; e(even) = mpfr_function_d ('plus', -inf, e(even), 1); e(e > y.sup) = nan (); # no odd number in interval endfunction function e = lee (y) ## LOE Least even exponent in interval y e = ceil (y.inf); odd = rem (e, 2) ~= 0; e(odd) = mpfr_function_d ('plus', -inf, e(odd), 1); e(e > y.sup) = nan (); # no odd number in interval endfunction %!# from the documentation string %!assert (infsup (-5, 6) .^ infsup (2, 3) == infsup (-125, 216)); %!assert (infsup (-10, 0) .^ infsup (0, 1:8) == infsup ([-1e1, -1e1, -1e3, -1e3, -1e5, -1e5, -1e7, -1e7], [1e0, 1e2, 1e2, 1e4, 1e4, 1e6, 1e6, 1e8])); %!# correct use of signed zeros %!test %! x = power (infsup (0), infsup (1)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/pown.m0000644000000000000000000000662313031036767015223 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} pown (@var{X}, @var{P}) ## ## Compute the monomial @code{x^@var{P}} for all numbers in @var{X}. ## ## Monomials are defined for all real numbers and the special monomial ## @code{@var{P} == 0} evaluates to @code{1} everywhere. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## pown (infsup (5, 6), 2) ## @result{} ans = [25, 36] ## @end group ## @end example ## @seealso{@@infsup/pow, @@infsup/pow2, @@infsup/pow10, @@infsup/exp} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function result = pown (x, p) if (nargin ~= 2) print_usage (); return endif if (not (isnumeric (p)) || any (any (fix (p) ~= p))) error ("interval:InvalidOperand", "pown: exponent is not an integer"); endif ## Resize, if scalar × matrix if (not (size_equal (x.inf, p))) x.inf = ones (size (p)) .* x.inf; x.sup = ones (size (p)) .* x.sup; p = ones (size (x.inf)) .* p; endif result = x; % already correct for p == 1 select = (p == 0 & not (isempty (x))); result.inf(select) = result.sup(select) = 1; idx.type = "()"; idx.subs = {(p == 2)}; # x^2 if (any (idx.subs{1}(:))) result = subsasgn (result, idx, sqr (subsref (x, idx))); endif idx.subs = {(p == -1)}; # x^-1 = 1./x if (any (idx.subs{1}(:))) result = subsasgn (result, idx, 1 ./ subsref (x, idx)); endif idx.subs = {(rem (p, 2) == 0 & p ~= 2 & p ~= 0)}; if (any (idx.subs{1}(:))) # p even x_mig = mig (subsref (x, idx)); x_mig(isnan (x_mig)) = inf; x_mag = mag (subsref (x, idx)); x_mag(isnan (x_mag)) = -inf; x.inf = subsasgn (x.inf, idx, x_mig); x.sup = subsasgn (x.sup, idx, x_mag); result = subsasgn (result, idx, pow (subsref (x, idx), subsref (p, idx))); endif idx.subs = {(rem (p, 2) ~= 0 & p ~= -1)}; if (any (idx.subs{1}(:))) # p odd x_idx = subsref (x, idx); p_idx = infsup (subsref (p, idx)); result = subsasgn (result, idx, ... union (pow (x_idx, p_idx), ... -pow (-x_idx, p_idx))); endif ## Special case: x = [0]. The pow function used above would be undefined. select = (p > 0 & x.inf == 0 & x.sup == 0); result.inf(select) = -0; result.sup(select) = +0; endfunction function x = sqr (x) ## Compute the square for each entry in @var{X}. ## ## Accuracy: The result is a tight enclosure. l = mpfr_function_d ('sqr', -inf, mig (x)); u = mpfr_function_d ('sqr', +inf, mag (x)); emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (pown (infsup (5, 6), 2) == infsup (25, 36)); %!assert (pown (infsup (-2, 1), 2) == infsup (0, 4)); interval-2.1.0/inst/@infsup/pownrev.m0000644000000000000000000000523013031036767015731 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{X} =} pownrev (@var{C}, @var{X}, @var{P}) ## @deftypemethodx {@@infsup} {@var{X} =} pownrev (@var{C}, @var{P}) ## ## Compute the reverse monomial @code{x^@var{P}}. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{pown (x, @var{P}) ∈ @var{C}}. ## ## Accuracy: The result is a valid enclosure. The result is a tight ## enclosure for @var{P} ≥ -2. The result also is a tight enclosure if the ## reciprocal of @var{P} can be computed exactly in double-precision. ## ## @seealso{@@infsup/pown} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = pownrev (c, x, p) if (nargin < 2 || nargin > 3) print_usage (); return endif if (nargin < 3) p = x; x = infsup (-inf, inf); endif if (not (isa (c, "infsup"))) c = infsup (c); endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isnumeric (p)) || fix (p) ~= p) error ("interval:InvalidOperand", "pownrev: exponent is not an integer"); endif ## Resize, if scalar × matrix if (not (size_equal (x.inf, c.inf))) x.inf = ones (size (c.inf)) .* x.inf; x.sup = ones (size (c.inf)) .* x.sup; c.inf = ones (size (x.inf)) .* c.inf; c.sup = ones (size (x.inf)) .* c.sup; endif if (p == 0) # x^p == 1 result = x; emptyresult = c.inf > 1 | c.sup < 1; result.inf(emptyresult) = inf; result.sup(emptyresult) = -inf; else even = mod (p, 2) == 0; if (even) result = union (... intersect (x, nthroot (intersect (c, infsup (0, inf)), p)), ... intersect (x, -nthroot (intersect (c, infsup (0, inf)), p))); else result = union (... intersect (x, nthroot (intersect (c, infsup (0, inf)), p)), ... intersect (x, nthroot (intersect (c, infsup (-inf, 0)), p))); endif endif endfunction %!assert (pownrev (infsup (25, 36), infsup (0, inf), 2) == infsup (5, 6)); interval-2.1.0/inst/@infsup/powrev1.m0000644000000000000000000001462113031036767015640 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{X} =} powrev1 (@var{B}, @var{C}, @var{X}) ## @deftypemethodx {@@infsup} {@var{X} =} powrev1 (@var{B}, @var{C}) ## ## Compute the reverse power function for the first parameter. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{pow (x, b) ∈ @var{C}} for any @code{b ∈ @var{B}}. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## powrev1 (infsup (2, 5), infsup (3, 6)) ## @result{} ans ⊂ [1.2457, 2.4495] ## @end group ## @end example ## @seealso{@@infsup/pow} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2011 function x = powrev1 (b, c, x) if (nargin < 2 || nargin > 3) print_usage (); return endif if (nargin < 3) x = infsup (-inf, inf); endif if (not (isa (b, "infsup"))) b = infsup (b); endif if (not (isa (c, "infsup"))) c = infsup (c); endif if (not (isa (x, "infsup"))) x = infsup (x); endif x = intersect (x, infsup (0, inf)); c = intersect (c, infsup (0, inf)); ## Resize, if scalar × matrix or vector × matrix or scalar × vector if (not (size_equal (b.inf, c.inf))) b.inf = ones (size (c.inf)) .* b.inf; b.sup = ones (size (c.inf)) .* b.sup; c.inf = ones (size (b.inf)) .* c.inf; c.sup = ones (size (b.inf)) .* c.sup; endif if (not (size_equal (b.inf, x.inf))) b.inf = ones (size (x.inf)) .* b.inf; b.sup = ones (size (x.inf)) .* b.sup; c.inf = ones (size (x.inf)) .* c.inf; c.sup = ones (size (x.inf)) .* c.sup; x.inf = ones (size (b.inf)) .* x.inf; x.sup = ones (size (b.inf)) .* x.sup; endif l = x.inf; u = x.sup; emptyresult = isempty (b) | isempty (c) | (x.sup == 0 & b.sup <= 0) ... | (b.sup <= 0 & ((x.sup <= 1 & c.sup < 1) | (x.inf >= 1 & c.inf > 1))) ... | (b.inf >= 0 & ((x.sup <= 1 & c.inf > 1) | (x.inf >= 1 & c.sup < 1))); l(emptyresult) = inf; u(emptyresult) = -inf; ## Implements Table B.1 in ## Heimlich, Oliver. 2011. “The General Interval Power Function.” ## Diplomarbeit, Institute for Computer Science, University of Würzburg. ## http://exp.ln0.de/heimlich-power-2011.htm. ## y before [0, 0] ============================================================ y = b.sup < 0; z = c.sup < 1; select = y & z & l < inf; if (any (select(:))) l(select) = max (l(select), ... powrev1rounded (c.sup(select), b.inf(select), -inf)); endif z = c.sup == 1; select = y & z & l < 1; l(select) = 1; z = c.sup > 1 & c.sup < inf; select = y & z & l < 1; if (any (select(:))) l(select) = max (l(select), ... powrev1rounded (c.sup(select), b.sup(select), -inf)); endif z = c.inf > 0 & c.inf < 1; select = y & z & u > 1; if (any (select(:))) u(select) = min (u(select), ... powrev1rounded (c.inf(select), b.sup(select), +inf)); endif z = c.inf == 1; select = y & z & u > 1; u(select) = 1; z = c.inf > 1; select = y & z & u > 0; if (any (select(:))) u(select) = min (u(select), ... powrev1rounded (c.inf(select), b.inf(select), +inf)); endif ## ismember (0, y) ============================================================ y = b.inf <= 0 & b.sup >= 0; gap.inf = -inf (size (l)); gap.sup = +inf (size (u)); z = c.sup < 1; select = y & z & b.sup > 0; if (any (select(:))) gap.inf(select) = powrev1rounded (c.sup(select), b.sup(select), +inf); endif select = y & z & b.inf < 0; if (any (select(:))) gap.sup(select) = powrev1rounded (c.sup(select), b.inf(select), -inf); endif z = c.inf > 1; select = y & z & b.inf < 0; if (any (select(:))) gap.inf(select) = powrev1rounded (c.inf(select), b.inf(select), +inf); endif select = y & z & b.sup > 0; if (any (select(:))) gap.sup(select) = powrev1rounded (c.inf(select), b.sup(select), -inf); endif z = c.sup < 1 | c.inf > 1; select = y & z & (l > gap.inf | (gap.inf == 1 & l == 1)); l(select) = max (l(select), gap.sup(select)); select = y & z & (u < gap.sup | gap.sup == inf | (gap.sup == 1 & u == 1)); u(select) = min (u(select), gap.inf(select)); ## y after [0, 0] ============================================================= y = b.inf > 0; z = c.sup < 1; select = y & z & u > 0; if (any (select(:))) u(select) = min (u(select), ... powrev1rounded (c.sup(select), b.sup(select), +inf)); endif z = c.sup == 1; select = y & z & u > 1; u(select) = 1; z = c.sup > 1 & c.sup < inf; select = y & z & u > 1; if (any (select(:))) u(select) = min (u(select), ... powrev1rounded (c.sup(select), b.inf(select), +inf)); endif z = c.inf > 0 & c.inf < 1; select = y & z & l < 1; if (any (select(:))) l(select) = max (l(select), ... powrev1rounded (c.inf(select), b.inf(select), -inf)); endif z = c.inf == 1; select = y & z & l < 1; l(select) = 1; z = c.inf > 1; select = y & z & l < inf; if (any (select(:))) l(select) = max (l(select), ... powrev1rounded (c.inf(select), b.sup(select), -inf)); endif ## ============================================================================ emptyresult = l > u | l == inf | u == -inf; l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction function x = powrev1rounded (z, y, direction) ## Return x = z ^ (1 / y) with directed rounding and limit values x = ones (size (z)); x((z == inf & y < 0) | (z == 0 & y > 0)) = 0; x((z == inf & y > 0) | (z == 0 & y < 0)) = inf; select = z > 1 & z < inf & isfinite (y); y(select) = mpfr_function_d ('rdivide', direction, 1, y(select)); select = z < 1 & z > 0 & isfinite (y); y(select) = mpfr_function_d ('rdivide', -direction, 1, y(select)); select = isfinite (y) & z > 0 & z ~= 1 & z < inf; x(select) = mpfr_function_d ('pow', direction, z(select), y(select)); endfunction %!# from the documentation string %!assert (powrev1 (infsup (2, 5), infsup (3, 6)) == "[0x1.3EE8390D43955, 0x1.3988E1409212Fp1]"); interval-2.1.0/inst/@infsup/powrev2.m0000644000000000000000000001717013031036767015643 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{Y} =} powrev2 (@var{A}, @var{C}, @var{Y}) ## @deftypemethodx {@@infsup} {@var{Y} =} powrev2 (@var{A}, @var{C}) ## ## Compute the reverse power function for the second parameter. ## ## That is, an enclosure of all @code{y ∈ @var{Y}} where ## @code{pow (a, y) ∈ @var{C}} for any @code{a ∈ @var{A}}. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## powrev2 (infsup (2, 5), infsup (3, 6)) ## @result{} ans ⊂ [0.6826, 2.585] ## @end group ## @end example ## @seealso{@@infsup/pow} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2011 function y = powrev2 (a, c, y) if (nargin < 2 || nargin > 3) print_usage (); return endif if (nargin < 3) y = infsup (-inf, inf); endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (c, "infsup"))) c = infsup (c); endif if (not (isa (y, "infsup"))) y = infsup (y); endif a = intersect (a, infsup (0, inf)); c = intersect (c, infsup (0, inf)); ## Resize, if scalar × matrix or vector × matrix or scalar × vector if (not (size_equal (a.inf, c.inf))) a.inf = ones (size (c.inf)) .* a.inf; a.sup = ones (size (c.inf)) .* a.sup; c.inf = ones (size (a.inf)) .* c.inf; c.sup = ones (size (a.inf)) .* c.sup; endif if (not (size_equal (a.inf, y.inf))) a.inf = ones (size (y.inf)) .* a.inf; a.sup = ones (size (y.inf)) .* a.sup; c.inf = ones (size (y.inf)) .* c.inf; c.sup = ones (size (y.inf)) .* c.sup; y.inf = ones (size (a.inf)) .* y.inf; y.sup = ones (size (a.inf)) .* y.sup; endif l = y.inf; u = y.sup; emptyresult = isempty (a) | isempty (c) ... | (a.sup == 0 & (y.sup <= 0 | c.inf > 0)) ... | (y.sup <= 0 & ((a.sup <= 1 & c.sup < 1) | (a.inf > 1 & c.inf > 1))) ... | (y.inf >= 0 & ((a.sup <= 1 & c.inf > 1) | (a.inf > 1 & c.sup < 1))) ... | (((a.inf == 1 & a.sup == 1) | (y.inf == 0 & y.sup == 0)) ... & (c.sup < 1 | c.inf > 1)); l(emptyresult) = inf; u(emptyresult) = -inf; ## Implements Table B.2 in ## Heimlich, Oliver. 2011. “The General Interval Power Function.” ## Diplomarbeit, Institute for Computer Science, University of Würzburg. ## http://exp.ln0.de/heimlich-power-2011.htm. ## x overlaps/starts/containedBy [0, 1] ======================================= x = a.sup < 1; select = a.sup == 0 & l < 0; l(select) = 0; z = c.sup <= 1; select = x & z & (a.inf == 0 | c.sup == 1) & l < 0; l(select) = 0; z = c.sup > 1 & c.sup < inf; select = x & z & l < 0; if (any (select(:))) l(select) = max (l(select), ... powrev2rounded (a.sup(select), c.sup(select), -inf)); endif z = c.inf >= 1; select = x & z & (a.inf == 0 | c.inf == 1) & u > 0; u(select) = 0; z = c.inf > 0 & c.inf < 1; select = x & z & u > 0; if (any (select(:))) u (select) = min (u (select), powrev2rounded (a.sup, c.inf, +inf)); endif ## x containedBy/finishes [0, 1] ============================================== x = a.inf > 0 & a.inf < 1 & a.sup <= 1; z = c.sup < 1 & c.sup > 0; select = x & z & l < inf; if (any (select(:))) l(select) = max (l(select), ... powrev2rounded (a.inf(select), c.sup(select), -inf)); endif z = c.inf > 1 & c.sup < inf; select = x & z & u > -inf; if (any (select(:))) u(select) = min (u(select), ... powrev2rounded (a.inf(select), c.inf (select), +inf)); endif ## ismember (1, x) ============================================================ x = a.sup >= 1 & a.inf <= 1; z = c.inf == 0 & c.sup == 0; select = x & z & l < 0; l(select) = 0; z = c.sup == inf & c.inf > 1; select = x & z & u > 0 && a.sup <= 1; u(select) = 0; gap.inf = -inf (size (l)); gap.sup = +inf (size (u)); z = c.sup < 1; select = x & z & a.inf == 0; gap.sup(select) = 0; select = x & z & a.sup > 1; if (any (select(:))) gap.inf(select) = powrev2rounded (a.sup(select), c.sup(select), +inf); endif select = x & z & a.inf > 0 & a.inf < 1 & a.sup > 1; if (any (select(:))) gap.sup(select) = powrev2rounded(a.inf(select), c.sup(select), -inf); endif z = c.inf > 1; select = x & z & a.inf == 0; gap.inf(select) = 0; select = x & z & a.sup > 1; if (any (select(:))) gap.sup(select) = powrev2rounded (a.sup(select), c.inf(select), -inf); endif select = x & z & a.inf > 0 & a.inf < 1 & a.sup > 1; if (any (select(:))) gap.inf(select) = powrev2rounded (a.inf(select), c.inf(select), +inf); endif z = c.sup < 1 | c.inf > 1; select = x & z & (l > gap.inf | gap.inf == -inf | (gap.inf == 0 & l == 0)) ... & (a.inf >= 1 | a.sup > 1 | a.inf <= 0); l(select) = max (l(select), gap.sup(select)); select = x & z & (u < gap.sup | gap.sup == inf | (gap.sup == 0 & u == 0)) ... & (a.inf >= 1 | a.sup > 1 | a.inf <= 0); u(select) = min (u(select), gap.inf(select)); ## x after [0, 1] ============================================================= x = a.inf > 1; z = c.sup < 1; select = x & z & u > -inf; if (any (select(:))) u(select) = min (u(select), ... powrev2rounded (a.sup(select), c.sup(select), +inf)); endif z = c.inf > 0 & c.inf < 1; select = x & z & l < 0; if (any (select(:))) l(select) = max (l(select), ... powrev2rounded (a.inf(select), c.inf(select), -inf)); endif z = c.inf == 1; select = x & z & l < 0; l(select) = 0; z = c.inf > 1; select = x & z & l < inf; if (any (select(:))) l(select) = max (l(select), ... powrev2rounded (a.sup(select), c.inf(select), -inf)); endif z = c.sup == 1; select = x & z & u > 0; u(select) = 0; z = c.sup > 1 & c.sup < inf; select = x & z & u > 0; if (any (select(:))) u(select) = min (u(select), ... powrev2rounded (a.inf(select), c.sup(select), +inf)); endif ## ============================================================================ emptyresult = l > u | l == inf | u == -inf; l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; y.inf = l; y.sup = u; endfunction function y = powrev2rounded (x, z, direction) ## Return y = log z / log x with directed rounding and limit values y = nominator = denominator = zeros (size (x)); y(z == inf & x < 1) = -inf; y(z == inf & x > 1 & x < inf) = inf; ## We do not use log here, because log2 is able to produce some results without ## rounding errors. rnd_log_numerator_up = (direction > 0) == (sign (x - 1) == sign (z - 1)); select = isfinite (x) & isfinite (z) & rnd_log_numerator_up; if (any (select(:))) denominator(select) = mpfr_function_d ('log2', -inf, x(select)); nominator(select) = mpfr_function_d ('log2', +inf, z(select)); endif select = isfinite (x) & isfinite (z) & not (rnd_log_numerator_up); if (any (select(:))) denominator(select) = mpfr_function_d ('log2', +inf, x(select)); nominator(select) = mpfr_function_d ('log2', -inf, z(select)); endif select = isfinite (x) & isfinite (z); if (any (select(:))) y(select) = mpfr_function_d ('rdivide', direction, ... nominator(select), ... denominator(select)); endif endfunction %!# from the documentation string %!assert (powrev2 (infsup (2, 5), infsup (3, 6)) == "[0x1.5D7E8F22BA886p-1, 0x1.4AE00D1CFDEB5p1]"); interval-2.1.0/inst/@infsup/precedes.m0000644000000000000000000000321513031036767016024 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} precedes (@var{A}, @var{B}) ## ## Evaluate precedes comparison on intervals. ## ## True, if @var{A} is left of @var{B}. The intervals may touch. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsup/eq, @@infsup/le, @@infsup/lt, @@infsup/gt, @@infsup/strictprecedes, @@infsup/subset, @@infsup/interior, @@infsup/disjoint} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-07 function result = precedes (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (b, "infsup"))) b = infsup (b); endif ## This comparison also works for empty intervels, where the comparison must ## always return true. result = (a.sup <= b.inf); endfunction %!assert (precedes (infsup (1, 2), infsup (2, 3))); %!assert (not (precedes (infsup (1, 2.1), infsup (1.9, 3)))); interval-2.1.0/inst/@infsup/prepad.m0000644000000000000000000000503013031036767015502 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} prepad (@var{X}, @var{L}) ## @defmethodx {@@infsup} prepad (@var{X}, @var{L}, @var{C}) ## @defmethodx {@@infsup} prepad (@var{X}, @var{L}, @var{C}, @var{DIM}) ## ## Prepend the scalar interval value @var{C} to the interval vector @var{X} ## until it is of length @var{L}. If @var{C} is not given, a value of 0 is ## used. ## ## If @code{length (@var{X}) > L}, elements from the beginning of @var{X} are ## removed until an interval vector of length @var{L} is obtained. ## ## If @var{X} is an interval matrix, elements are prepended or removed from ## each row or column. ## ## If the optional argument DIM is given, operate along this dimension. ## ## @example ## @group ## prepad (infsup (1 : 3), 5, 42) ## @result{} ans = 1×5 interval vector ## [42] [42] [1] [2] [3] ## @end group ## @end example ## @seealso{@@infsup/reshape, @@infsup/cat, @@infsup/postpad, @@infsup/resize} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-19 function x = prepad (x, len, c, dim) if (nargin < 2 || nargin > 4) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (isa (len, "infsup")) error ("interval:InvalidOperand", "prepad: len must not be an interval"); endif if (nargin < 3) c = infsup (0); elseif (not (isa (c, "infsup"))) c = infsup (c); endif if (nargin < 4) if (isvector (x.inf) && not (isscalar (x.inf))) dim = find (size (x.inf) ~= 1, 1); else dim = 1; endif elseif (isa (dim, "infsup")) error ("interval:InvalidOperand", "prepad: dim must not be an interval"); endif x.inf = prepad (x.inf, len, c.inf, dim); x.sup = prepad (x.sup, len, c.sup, dim); endfunction %!assert (prepad (infsup (2:4), 4, 1) == infsup (1:4)); %!assert (prepad (infsup (0:2), 2, 1) == infsup (1:2)); interval-2.1.0/inst/@infsup/private/decimaladd.m0000644000000000000000000000573613031036767017765 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypefun {@var{DECIMAL} =} decimaladd (@var{DECIMAL}, @var{ADDEND}) ## ## Add two decimal numbers. ## ## @end deftypefun ## Author: Oliver Heimlich ## Created: 2014-10-21 function [decimal] = decimaladd (decimal, addend) ## Align mantissas if (addend.e < decimal.e) addend.m = [zeros(decimal.e - addend.e, 1); ... addend.m]; addend.e = decimal.e; elseif (addend.e > decimal.e) decimal.m = [zeros(addend.e - decimal.e, 1); ... decimal.m]; decimal.e = addend.e; endif if (length (decimal.m) > length (addend.m)) addend.m = [addend.m; ... zeros(length (decimal.m) - ... length (addend.m), 1)]; elseif (length (decimal.m) < length (addend.m)) decimal.m = [decimal.m; ... zeros(length (addend.m) - ... length (decimal.m), 1)]; endif assert (length (decimal.m) == length (addend.m)); assert (decimal.e == addend.e); ## Add if (decimal.s == addend.s) decimal.m += addend.m; else decimal.m -= addend.m; endif ## Carry while (not (isempty (find (decimal.m >= 10)))) decimal.m = [0; rem(decimal.m, 10)] ... + [(decimal.m >= 10); 0]; if (decimal.m(1) == 0) decimal.m(1) = []; else decimal.e ++; endif endwhile ## Resolve negative decimal digits while (1) highestnegative = find (decimal.m < 0, 1); if (isempty (highestnegative)) break; endif highestpositive = find (decimal.m > 0, 1); if (isempty (highestpositive) || ... highestnegative < highestpositive) ## Flip sign decimal.s = not (decimal.s); decimal.m *= -1; else assert (decimal.m(1) >= 0); decimal.m += 10 * (decimal.m < 0) ... - [(decimal.m(2:end) < 0); 0]; endif endwhile clear highestnegative highestpositive; ## Normalize mantissa: remove leading zeroes firstnonzerodigit = find (decimal.m ~= 0, 1, "first"); if (firstnonzerodigit > 1) decimal.m = decimal.m(firstnonzerodigit:end); decimal.e -= firstnonzerodigit - 1; elseif (isempty (firstnonzerodigit)) # all digits are zero decimal.s = false; decimal.m = []; decimal.e = int64 (0); return endif ## Remove trailing zeros decimal.m = decimal.m(1 : find (decimal.m ~= 0, 1, "last")); endfunctioninterval-2.1.0/inst/@infsup/private/decimalcompare.m0000644000000000000000000000371313031036767020654 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deffun decimalcompare (@var{X}, @var{Y}) ## ## Compare two decimal floating point numbers. ## ## The result is a negative number, if @code{@var{X} < @var{Y}}; ## zero, if @code{@var{X} == @var{Y}}; a positive number, ## if @code{@var{X} > @var{Y}}. ## ## @seealso{str2decimal, double2decimal} ## @end deffun ## Author: Oliver Heimlich ## Created: 2014-09-29 function result = decimalcompare (x, y) ## Comparison with zero if (isempty (x.m) ~= isempty (y.m)) if (y.s || ... # Y < 0 not (x.s || isempty (x.m))) # X > 0 result = 1; else result = -1; endif return endif ## Different signs if (x.s ~= y.s) result = y.s - x.s; return endif ## Different exponents if (x.e ~= y.e) result = x.e - y.e; if (x.s) result .*= -1; endif return endif ## Compare common mantissa places for i = 1 : min (length (x.m), length (y.m)) if (x.m(i) ~= y.m(i)) result = x.m(i) - y.m(i); if (x.s) result .*= -1; endif return endif endfor ## Compare mantissa length. There is no need to inspect the digits, because the ## mantissa is normalized (no trailing zeroes). result = length (x.m) - length (y.m); if (x.s) result .*= -1; endif endfunctioninterval-2.1.0/inst/@infsup/private/decimaldivide.m0000644000000000000000000000417513031036767020475 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypefun {[@var{QUOTIENT}, @var{REMAINDER}] =} decimaldivide (@var{DIVIDEND}, @var{DIVISOR}, @var{PRECISION}) ## ## Divide two decimal numbers. The parameter @var{PRECISION} limits the ## maximum significand places in the @var{QUOTIENT}. ## ## @end deftypefun ## Author: Oliver Heimlich ## Created: 2014-10-22 function [quotient, remainder] = decimaldivide (dividend, divisor, precision) assert (not (isempty (divisor.m)), "division by zero"); if (isempty (dividend.m)) # 0 / divisor quotient = dividend; remainder = dividend; return endif ## Compute exponent and sign of the result quotient.e = dividend.e - divisor.e + 1; divisor.e = dividend.e; quotient.s = xor (dividend.s, divisor.s); divisor.s = dividend.s; quotient.m = zeros (precision, 1); ## Perform long division remainder = dividend; i = 1; while (i <= length (quotient.m)) if (isempty (remainder.m)) break endif while (sign (decimalcompare (divisor, remainder)) ~= (-1) ^ remainder.s) quotient.m (i) ++; ## Subtract divisor from remainder divisor.s = not (remainder.s); remainder = decimaladd (remainder, divisor); divisor.s = remainder.s; endwhile divisor.e --; if (i == 1 && quotient.m (i) == 0) quotient.e --; else i++; endif endwhile ## Remove trailing zeros quotient.m = quotient.m(1 : find (quotient.m ~= 0, 1, "last")); endfunctioninterval-2.1.0/inst/@infsup/private/double2decimal.m0000644000000000000000000000704613031036767020565 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deffun double2decimal (@var{X}) ## ## Convert a binary floating point number @var{X} in double precision to a ## decimal floating point number with arbitrary precision. The number must be ## a finite number and must not be NaN. ## ## Conversion is exact, because @code{rem (10, 2) == 0}. ## ## Sign: true (-) or false (+) ## ## Mantissa: Vector that holds the decimal digits after the decimal point. The ## first digit is not zero. Trailing zeroes are removed. ## ## Exponent: Integral exponent (base 10). ## ## @example ## @group ## x = double2decimal (-200) ## @result{} ## x.s = 1 ## x.m = [2] ## x.e = 2 ## y = double2decimal (0.125) ## @result{} ## y.s = 0 ## y.m = [1 2 5]' ## y.e = 0 ## z = double2decimal (0) ## @result{} ## z.s = 0 ## z.m = [] ## z.e = 0 ## @end group ## @end example ## @seealso{str2decimal} ## @end deffun ## Author: Oliver Heimlich ## Created: 2014-09-29 function decimal = double2decimal (binary) [decimal.s, exponent, fraction] = parsedouble (binary); if (sum (fraction) == 0) # this number equals zero decimal.s = false; # normalize: remove sign from -0 decimal.m = []; decimal.e = int64 (0); return endif ## Remove trailing zeroes if this might reduce the number of loop cycles below if (exponent < length (fraction)) fraction = fraction(1:find (fraction, 1, "last")); endif ## Move the point to the end of the mantissa and interpret mantissa as a binary ## integer number that is now in front of the point. Convert binary integer ## to decimal. exponent -= length (fraction); decimal.m = zeros (); for i = 1 : length(fraction) ## Multiply by 2 decimal.m .*= 2; ## Add 1 if necessary decimal.m(end) += fraction(i); ## Carry decimal.m = [0; rem(decimal.m, 10)] ... + [(decimal.m >= 10); 0]; endfor clear fraction; ## Normalize: Remove leading zeroes (for performance reasons not in loop) decimal.m = decimal.m(find (decimal.m ~= 0, 1, "first"):end); assert (length (decimal.m) > 0, "number must not equal zero at this point"); decimal.e = int64 (length (decimal.m)); ## Multiply decimal integer with 2 ^ exponent while (exponent > 0) decimal.m .*= 2; decimal.m = [0; rem(decimal.m, 10)] ... + [(decimal.m >= 10); 0]; if (decimal.m(1) == 0) decimal.m(1) = []; else decimal.e ++; endif exponent --; endwhile while (exponent < 0) ## Instead of division by 2 we devide by 10 and multiply by 5 decimal.e --; # cheap division by 10 decimal.m .*= 5; decimal.m = [0; rem(decimal.m, 10)] ... + [floor(decimal.m ./ 10); 0]; if (decimal.m(1) == 0) decimal.m(1) = []; else decimal.e ++; endif exponent ++; endwhile ## Normalize mantissa: remove trailing zeroes; decimal.m = decimal.m(1 : find (decimal.m ~= 0, 1, "last")); endfunctioninterval-2.1.0/inst/@infsup/private/hex2double.m0000644000000000000000000001266513031036767017756 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypefun {[@var{X}, @var{ISEXACT}] =} hex2double (@var{S}, @var{DIRECTION}) ## ## Convert a hexadecimal floating point number @var{S} to double precision with ## directed rounding. ## ## The input number format is [+-]0xh[,.]h[[pP][+-]d]. ## ## @seealso{str2decimal} ## @end deftypefun ## Author: Oliver Heimlich ## Created: 2014-10-20 function [binary, isexact] = hex2double (string, direction) ## Strip Sign if (isempty (string)) hex.s = false; else hex.s = (string (1) == "-"); if (strfind("+-", string(1))) string = string (2:end); endif endif ## Strip hex indicator if (strncmpi ("0x", string, 2)) string = string (3:end); else error ("interval:InvalidOperand", ... ["invalid hex number does not start with 0x: " string]); endif ## Split mantissa & exponent [hex.m, hex.e] = strtok (string, "pP"); ## Convert exponent from string to number if (isempty (hex.e)) hex.e = int64(0); # 2 ^ 0 = 1 else if (strfind (hex.e, ".") || strfind (hex.e, ",")) error ("interval:InvalidOperand", ... ["invalid hex number with rational exponent: " string]); endif hex.e = str2double (hex.e(2:end)); # remove “p” and convert if (isnan (hex.e) || ... # greater than realmax or illegal format abs(hex.e) >= pow2 (53)) # possibly lost precision error ("interval:InvalidOperand", ... ["invalid hex number with big/invalid exponent: " string]); endif hex.e = int64 (hex.e); endif ## Split Mantissa at point hex.m = strsplit (hex.m, {".",","}); switch length(hex.m) case 0 hex.m = {"", ""}; case 1 hex.m{2} = ""; case 2 # nothing to do otherwise error ("interval:InvalidOperand", ... ["invalid hex number with multiple points: " string]); endswitch ## Normalize mantissa string: move point to the right if (hex.e - length (hex.m{2}) * 4 <= intmin (class (hex.e))) error ("interval:InvalidOperand", ... ["exponent overflow during normalization: " string ]); endif hex.e -= length (hex.m{2}) * 4; hex.m = strcat (hex.m{1}, hex.m{2}); hexvalues = rem (uint8 (hex.m) - 47, 39); # 1 .. 16 lookup = [0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1;... 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1;... 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1;... 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1]; hex.m = (logical (lookup (:, hexvalues))) (:)'; ## Normalize mantissa: remove leading zeroes firstnonzerodigit = find (hex.m, 1, "first"); if (firstnonzerodigit > 1) hex.m = hex.m (firstnonzerodigit:end); elseif (isempty (firstnonzerodigit)) ## All digits are zero isexact = true (); if (hex.s) binary = -0; else binary = 0; endif return endif ## Move point to the left, right after the first significand binary digit if (length (hex.m) > 1) if (hex.e + (length (hex.m) - 1) >= intmax (class (hex.e))) error ("interval:InvalidOperand", ... ["exponent overflow during normalization: " string ]); endif hex.e += length (hex.m) - 1; endif ## Overflow if (hex.e > 1023) isexact = false (); if (hex.s && direction < 0) binary = -inf; elseif (hex.s) binary = -realmax (); elseif (direction > 0) binary = inf; else binary = realmax (); endif return endif ## Underflow if (hex.e < -1074) isexact = false (); if (hex.s && direction < 0) binary = -pow2 (-1074); elseif (hex.s) binary = -0; elseif (direction > 0) binary = pow2 (-1074); else binary = 0; endif return endif if (hex.e < -1022) ## Subnormal numbers hex.m = [zeros(1, -1022 - hex.e), hex.m]; ieee754exponent = -1023; else ## Normal numbers ieee754exponent = hex.e; endif ## Only the most significand 53 bits are relevant. significand = postpad (hex.m, 53, 0, 2); isexact = length (hex.m) <= length (significand) || ... isempty (find (hex.m (54:end), 1)); ## The first bit can be omitted (normalization). significand (1) = []; ## The remaining 52 bits can be converted to 13 hex digits ieee754mantissa = dec2hex (pow2 (51 : -1 : 0) * significand', 13); if (not (hex.s)) ieee754signandexponent = ieee754exponent + 1023; else ieee754signandexponent = ieee754exponent + 1023 + pow2 (11); endif ieee754double = strcat (dec2hex (ieee754signandexponent, 3), ieee754mantissa); binary = hex2num (ieee754double); ## Last, consider the rounding direction if (isexact || ... (direction < 0 && not (hex.s)) || (direction > 0 && hex.s)) ## The number is exact or the truncation of digits above resulted in ## correct rounding direction else delta = pow2 (-1074); binary = mpfr_function_d ('plus', direction, binary, delta); endif endfunctioninterval-2.1.0/inst/@infsup/private/parsedouble.m0000644000000000000000000000414113031036767020210 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypefun {[@var{SIGN}, @var{EXPONENT}, @var{MANTISSA}] =} parsedouble (@var{X}) ## ## Parse a finite binary floating point number @var{X} in double precision. ## ## The mantissa is normalized, the implicit first bit is moved after the point ## @code{@var{X} = (-1) ^ @var{SIGN} * @var{MANTISSA} (=0.XXXXX… in binary) * 2 ^ @var{EXPONENT}}. ## @end deftypefun ## Author: Oliver Heimlich ## Created: 2014-10-24 function [sign, exponent, mantissa] = parsedouble (binary) if (not (isfinite (binary)) || isnan (binary)) assert (false (), "Invalid call to parsedouble"); endif ## Decode bit representation hex = num2hex (binary); # 16 hexadecimal digits (with leading zeros) hexvalues = rem (uint8 (hex) - 47, 39); # 1 .. 16 lookup = [0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1;... 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1;... 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1;... 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1]; bits = (logical (lookup (:, hexvalues))) (:)'; ## Separate sign, exponent, and mantissa bits. sign = bits(1); exponent = bits(2 : 12); fraction = bits(13 : end)'; if (sum (exponent) == 0) # denormalized numbers mantissa = fraction; else # normalized numbers mantissa = [true(); fraction]; endif ## Decode IEEE 754 exponent exponent = int64(pow2 (10 : -1 : 0) * exponent') - 1023; ## binary == (-1) ^ sign * fraction (=X.XXXXX… in binary) * 2 ^ exponent exponent ++; endfunctioninterval-2.1.0/inst/@infsup/private/str2decimal.m0000644000000000000000000001121613031036767020115 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deffun str2decimal (@var{S}) ## ## Parse a decimal number string @var{S} and split the sign, the mantissa and ## the exponent information. ## ## The input number format is [+-]d[,.]d[[eE][+-]d] (cf. str2double). ## ## Limitations: The decimal exponent of the input format must be a number ## between -2^53 (exclusive) and +2^53 (exclusive). ## The number itself either must equal zero or its absolute value must be ## between 10^(-2^62) (inclusive) and 10^(2^63 - 1) (exclusive). ## ## Sign: true (-) or false (+) ## ## Mantissa: Vector that holds the decimal digits after the decimal point. The ## first digit is not zero. Trailing zeroes are removed. ## ## Exponent: Integral exponent (base 10). ## ## @example ## @group ## x = str2decimal ("-12.3e14") ## @result{} ## x.s = 1 ## x.m = [1 2 3]' ## x.e = 16 ## y = str2decimal ("0.00123e-14") ## @result{} ## y.s = 0 ## y.m = [1 2 3]' ## y.e = -12 ## z = str2decimal ("0") ## @result{} ## z.s = 0 ## z.m = [] ## z.e = 0 ## @end group ## @end example ## @seealso{double2decimal} ## @end deffun ## Author: Oliver Heimlich ## Created: 2014-09-27 function decimal = str2decimal (string) ## Strip Sign if (isempty (string)) decimal.s = false; else decimal.s = (string(1) == "-"); if (strfind("+-", string(1))) string = string (2:end); endif endif ## Split mantissa & exponent [decimal.m, decimal.e] = strtok (string, "eE"); ## Convert exponent from string to number if (isempty (decimal.e)) decimal.e = int64(0); # 10 ^ 0 = 1 else if (strfind (decimal.e, ".") || strfind (decimal.e, ",")) error ("interval:InvalidOperand", ... ["invalid decimal number with rational exponent: " string]); endif decimal.e = str2double (decimal.e(2:end)); # remove “e” and convert if (isnan (decimal.e) || ... # greater than realmax or illegal format abs(decimal.e) >= pow2 (53)) # possibly lost precision error ("interval:InvalidOperand", ... ["invalid decimal number with big/invalid exponent: " string]); endif decimal.e = int64 (decimal.e); endif ## Normalize mantissa: remove leading zeroes within string representation ## before decimal point. This does not affect the exponent and is therefore ## preferred over the normalization below, which might produce overflow errors. decimal.m = decimal.m(find(decimal.m ~= "0", 1):end); ## Split Mantissa at decimal point decimal.m = strsplit (decimal.m, {".",","}); switch length(decimal.m) case 0 decimal.m = {"", ""}; case 1 decimal.m{2} = ""; case 2 # nothing to do otherwise error ("interval:InvalidOperand", ... ["invalid decimal number with multiple decimal points: " ... string]); endswitch ## Normalize mantissa string: move decimal point to the left if (decimal.e + length (decimal.m{1}) >= intmax (class (decimal.e))) error ("interval:InvalidOperand", ... ["exponent overflow during normalization: " string ]); endif decimal.e += length (decimal.m{1}); decimal.m = strcat (decimal.m{1}, decimal.m{2}); ## Convert mantissa to numeric vector with decimal digits decimal.m = str2num (decimal.m'); ## Normalize mantissa: remove leading zeroes firstnonzerodigit = find (decimal.m ~= 0, 1, "first"); if (firstnonzerodigit > 1) decimal.m = decimal.m(firstnonzerodigit:end); if (decimal.e - (firstnonzerodigit - 1) <= intmin (class (decimal.e))) error ("interval:InvalidOperand", ... ["exponent overflow during normalization: " string ]); endif decimal.e -= firstnonzerodigit - 1; elseif (isempty (firstnonzerodigit)) # all digits are zero decimal.s = false; decimal.m = []; decimal.e = int64 (0); return endif ## Normalize mantissa: remove trailing zeroes; lastnonzerodigit = find (decimal.m ~= 0, 1, "last"); if (lastnonzerodigit < length (decimal.m)) decimal.m = decimal.m(1:lastnonzerodigit); endif endfunctioninterval-2.1.0/inst/@infsup/private/uncertainsplit.m0000644000000000000000000000513113031036767020747 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypefun {[@var{BOUNDARY}, @var{UNCERTAIN}] =} uncertainsplit (@var{BOUNDARY}) ## ## The the decimal number itself and the decimal number that represents the ## uncertainty for the number. ## @end deftypefun ## Author: Oliver Heimlich ## Created: 2014-10-21 function [boundary, uncertain] = uncertainsplit (boundary) uncertainseparator = find (boundary == "?", 1); assert (not (isempty (uncertainseparator))); exponentseparator = find (lower (boundary) == "e", 1); if (isempty (exponentseparator)) exponentfield = ""; if (uncertainseparator == length (boundary)) ulpcount = ""; else ulpcount = boundary ((uncertainseparator + 1) : end); endif else exponentfield = boundary (exponentseparator : end); ulpcount = boundary ((uncertainseparator + 1) : (exponentseparator - 1)); endif ## Strip uncertain information from the boundary literal = boundary (1 : (uncertainseparator - 1)); boundary = strcat (literal, exponentfield); ## Make a decimal number that represents the uncertainty decimalseparator = find ((literal == ".") + (literal == ","), 1); if (isempty (ulpcount)) ## Half-ULP if (isempty (decimalseparator)) uncertain = "0.5"; else uncertain = strcat (regexprep (literal, "[0-9]", "0"), "5"); endif else uncertain = ulpcount; if (not (isempty (decimalseparator))) ## Insert decimal point in ulp number placesafterpoint = length (literal) - decimalseparator; if (length (uncertain) < length (literal)) uncertain = prepad (uncertain, length (literal), "0", 2); endif uncertain = strcat (uncertain (1 : ... (length (uncertain) - placesafterpoint)), ... ".", ... uncertain ((length (uncertain) - placesafterpoint + 1) ... : length (uncertain))); endif endif uncertain = strcat (uncertain, exponentfield); endfunctioninterval-2.1.0/inst/@infsup/prod.m0000644000000000000000000000517413031036767015204 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} prod (@var{X}) ## @defmethodx {@@infsup} prod (@var{X}, @var{DIM}) ## ## Product of elements along dimension @var{DIM}. If @var{DIM} is omitted, it ## defaults to the first non-singleton dimension. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## prod (infsup (1 : 4)) ## @result{} ans = [24] ## @end group ## @end example ## @seealso{@@infsup/sum} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-10-23 function result = prod (x, dim) if (nargin > 2) print_usage (); return endif if (nargin < 2) ## Try to find non-singleton dimension dim = find (size (x.inf) > 1, 1); if (isempty (dim)) dim = 1; endif endif switch (dim) case 1 result = infsup (ones (1, max (1, size (x.inf, 2)))); case 2 result = infsup (ones (max (1, size (x.inf, 1)), 1)); otherwise error ("interval:InvalidOperand", ... "prod: DIM must be a valid dimension"); endswitch ## Short circuit in simple cases emptyresult = any (isempty (x), dim); result.inf(emptyresult) = +inf; result.sup(emptyresult) = -inf; zeroresult = not (emptyresult) & any (x.inf == 0 & x.sup == 0, dim); result.inf(zeroresult) = -0; result.sup(zeroresult) = +0; entireresult = not (emptyresult | zeroresult) & any (isentire (x), dim); result.inf(entireresult) = -inf; result.sup(entireresult) = +inf; idx.type = "()"; idx.subs = {":", ":"}; idx.subs{3 - dim} = not (emptyresult | zeroresult | entireresult); if (any (idx.subs{3 - dim}(:))) idx.subs{dim} = 1; result2 = subsref (result, idx); for i = 1 : size (x.inf, dim) idx.subs{dim} = i; result2 = times (result2, subsref (x, idx)); endfor idx.subs{dim} = 1; result = subsasgn (result, idx, result2); endif endfunction %!# from the documentation string %!assert (prod (infsup (1 : 4)) == 24); %!assert (prod (infsup ([])) == 1); interval-2.1.0/inst/@infsup/psi.m0000644000000000000000000000561513031036767015033 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} psi (@var{X}) ## ## Compute the digamma function, also known as the psi function. ## ## @tex ## $$ ## {\rm psi} (x) = \int_0^\infty \left( {{\exp(-t)} \over t} - {{\exp (-xt)} \over {1 - \exp (-t)}} \right) dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## ∞ ## / exp (-t) exp (-xt) ## psi (x) = | ---------- - -------------- dt ## / t 1 - exp (-t) ## 0 ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## psi (infsup (1)) ## @result{} ans ⊂ [-0.57722, -0.57721] ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-28 function x = psi (x) if (nargin ~= 1) print_usage (); return endif u = inf (size (x.inf)); l = -u; ## psi is monotonically increasing, but not defined for non-positive integers. nosingularity = x.inf >= 0 | ceil (x.inf) > floor (x.sup) | ... (ceil (x.inf) == floor (x.sup) & ... (fix (x.inf) == x.inf | fix (x.sup) == x.sup)); if (any (nosingularity(:))) x.inf(x.inf == 0) = 0; # fix negative zero l(nosingularity & (x.inf > 0 | fix (x.inf) ~= x.inf)) = ... mpfr_function_d ('psi', -inf, x.inf(nosingularity)); u(nosingularity & (x.sup > 0 | fix (x.sup) ~= x.sup)) = ... mpfr_function_d ('psi', +inf, x.sup(nosingularity)); endif emptyresult = x.inf == x.sup & fix (x.inf) == x.inf & x.inf <= 0; l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!assert (isempty (psi (infsup (0)))); %!assert (isempty (psi (infsup (-1)))); %!assert (isempty (psi (infsup (-2)))); %!assert (isempty (psi (infsup (-3)))); %!assert (isentire (psi (infsup (-inf, -42.23)))); %!assert (isentire (psi (infsup (0, inf)))); %!assert (isentire (psi (infsup (-1, 0)))); %!assert (isentire (psi (infsup (-2, -1)))); %!assert (isentire (psi (infsup (-eps, eps)))); %!assert (isentire (psi (infsup (-1-eps, -1+eps)))); %!assert (isentire (psi (infsup (-4.1, -3.9)))); %!# from the documentation string %!assert (psi (infsup (1)) == "[-0x1.2788CFC6FB619p-1, -0x1.2788CFC6FB618p-1]"); interval-2.1.0/inst/@infsup/qr.m0000644000000000000000000001251413031036767014656 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {[@var{Q}, @var{R}] =} qr (@var{A}) ## @deftypemethodx {@@infsup} {[@var{Q}, @var{R}, @var{P}] =} qr (@var{A}) ## Compute the QR decomposition of @var{A}. ## ## @var{A} will be a subset of @var{Q} * @var{R} with orthogonal matrix @var{Q} ## and triangular matrix @var{R}. ## ## The columns of @var{Q} are orthogonal unit vectors, that is, @code{Q' * Q} ## equals the identity. @var{R} is an upper triangular matrix with positive ## diagonal elements. ## ## The result is returned in a permuted form, according to the optional return ## value @var{P}. ## ## Accuracy: The result is a valid enclosure. ## @seealso{@@infsup/lu, @@infsup/chol} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-06-26 function [Q, R, P] = qr (A) ## We use the Gram-Schmidt process, since Householder reflections would ## introduce a much larger overestimation for Q in most cases. n = length (A); Q = resize (A, n); R = zeros (n); P = eye (columns (A)); for i = 1 : n iColIdx = substruct ("()", {":", i}); if (nargout >= 3 && i < columns (A)) ## Swap columns of Q, choose the column with maximum norm as next pivot B = subsref (Q, substruct ("()", {":", i : n})); [~, j] = max (mig (sumsq (B, 1))); j += i - 1; if (j != i) swapIdx = 1 : n; swapIdx([i j]) = [j i]; swap = @(X) subsref (X, substruct ("()", {":", swapIdx})); Q = swap (Q); R = swap (R); P = P(:, swapIdx(1 : columns (A))); endif endif iCol = subsref (Q, iColIdx); d = norm (iCol, 2); iCol = mulrev (d, iCol, "[-1, +1]"); Q = subsasgn (Q, iColIdx, iCol); R = subsasgn (R, substruct ("()", {i, i}), d); if (i < n) otherColsIdx = substruct ("()", {":", (i + 1) : n}); otherCols = subsref (Q, otherColsIdx); d = dot (otherCols, iCol, 1); otherCols -= d .* iCol; Q = subsasgn (Q, otherColsIdx, otherCols); R = subsasgn (R, substruct ("()", {i, (i + 1) : n}), d); endif endfor Q = resize (Q, rows (A)); R = resize (R, size (A)); P = inv (P); endfunction %!test %! A = infsup ([1 2 3; 4 5 6]); %! [Q, R] = qr (A); %! assert (all (all (subset (A, Q * R)))); %! assert (all (all (subset (eye (length (Q)), Q' * Q)))); %! assert (max (max (wid (Q))) < 1e-14); %!test %! A = infsup ([1 2; 3 4; 5 6]); %! [Q, R] = qr (A); %! assert (all (all (subset (A, Q * R)))); %! assert (all (all (subset (eye (length (Q)), Q' * Q)))); %! assert (max (max (wid (Q (:, [1 2])))) < 1e-14); %!test %! A = infsup ([1 2 3; 4 9 6; 9 8 7]); %! [Q, R] = qr (A); %! assert (all (all (subset (A, Q * R)))); %! assert (all (all (subset (eye (length (Q)), Q' * Q)))); %! assert (max (max (wid (Q))) < 1e-13); %!test %! for n = 3 : 2 : 10 %! A = infsup (magic (n)); %! [Q, R] = qr (A); %! assert (all (all (subset (A, Q * R)))); %! assert (all (all (subset (eye (length (Q)), Q' * Q)))); %! assert (max (max (wid (Q))) < 1e-10); %! endfor %!test %! A = infsup (magic (3)) + "[2, 2.2]"; %! [Q, R] = qr (A); %! assert (all (all (subset (A, Q * R)))); %! assert (all (all (subset (eye (length (Q)), Q' * Q)))); %! assert (max (max (wid (Q))) < 1.5); %!function result = is_permutation_matrix (P) %! result = isequal (P, eye (length (P))) || ... %! isequal (typeinfo (P), "permutation matrix"); %!endfunction %!test %! A = infsup ([1 2 3; 4 5 6]); %! [Q, R, P] = qr (A); %! assert (all (all (subset (A, Q * R * P)))); %! assert (all (all (subset (eye (length (Q)), Q' * Q)))); %! assert (max (max (wid (Q))) < 1e-14); %! assert (is_permutation_matrix (P)); %!test %! A = infsup ([1 2; 3 4; 5 6]); %! [Q, R, P] = qr (A); %! assert (all (all (subset (A, Q * R * P)))); %! assert (all (all (subset (eye (length (Q)), Q' * Q)))); %! assert (max (max (wid (Q (:, [1 2])))) < 1e-14); %! assert (is_permutation_matrix (P)); %!test %! A = infsup ([1 2 3; 4 9 6; 9 8 7]); %! [Q, R, P] = qr (A); %! assert (all (all (subset (A, Q * R * P)))); %! assert (all (all (subset (eye (length (Q)), Q' * Q)))); %! assert (max (max (wid (Q))) < 1e-13); %! assert (is_permutation_matrix (P)); %!test %! for n = 3 : 2 : 10 %! A = infsup (magic (n)); %! [Q, R, P] = qr (A); %! assert (all (all (subset (A, Q * R * P)))); %! assert (all (all (subset (eye (length (Q)), Q' * Q)))); %! assert (max (max (wid (Q))) < 1e-10); %! assert (is_permutation_matrix (P)); %! endfor %!test %! A = infsup (magic (3)) + "[2, 2.2]"; %! [Q, R, P] = qr (A); %! assert (all (all (subset (A, Q * R * P)))); %! assert (all (all (subset (eye (length (Q)), Q' * Q)))); %! assert (max (max (wid (Q))) < 1.5); %! assert (is_permutation_matrix (P)); interval-2.1.0/inst/@infsup/rad.m0000644000000000000000000000406013031036767014777 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{R} =} rad (@var{X}) ## @deftypemethodx {@@infsup} {[@var{M}, @var{R}] =} rad (@var{X}) ## ## Get the radius (and midpoint) of interval @var{X}. ## ## If @var{X} is empty, @code{rad (@var{X})} is NaN. ## If @var{X} is unbounded in one or both directions, @code{rad (@var{X})} is ## positive infinity. ## ## With two output parameters the midpoint and radius are computed. ## ## Accuracy: The radius @var{R} will make a tight enclosure of the interval ## together with midpoint @var{M}. ## ## @example ## @group ## rad (infsup (2.5, 3.5)) ## @result{} ans = 0.50000 ## @end group ## @end example ## @seealso{@@infsup/inf, @@infsup/sup, @@infsup/mid, @@infsup/wid} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-05 function [out1, out2] = rad (x) if (nargin ~= 1) print_usage (); return endif m = mid (x); ## The midpoint is rounded to nearest and the radius must cover both boundaries r1 = mpfr_function_d ('minus', +inf, m, x.inf); r2 = mpfr_function_d ('minus', +inf, x.sup, m); r = max (r1, r2); r (isempty (x)) = nan (); if (nargout >= 2) out1 = m; out2 = r; else out1 = r; endif endfunction %!test; %! [m, r] = rad (infsup (2.5, 3.5)); %! assert (m, 3); %! assert (r, .5); %!# from the documentation string %!assert (rad (infsup (2.5, 3.5)), .5); interval-2.1.0/inst/@infsup/rdivide.m0000644000000000000000000001233113031036767015657 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} rdivide (@var{X}, @var{Y}) ## @defopx Operator {@@infsup} {@var{X} ./ @var{Y}} ## ## Divide all numbers of interval @var{X} by all numbers of @var{Y}. ## ## For @var{X} = 1 compute the reciprocal of @var{Y}. Thus this function can ## compute @code{recip} as defined by IEEE Std 1788-2015. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsup (2, 3); ## y = infsup (1, 2); ## x ./ y ## @result{} ans = [1, 3] ## @end group ## @end example ## @seealso{@@infsup/times} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function result = rdivide (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); elseif (isa (y, "infsupdec")) ## Workaround for bug #42735 result = rdivide (x, y); return endif ## Short-circuit evaluation for 1 ./ x if (all (vec (x.inf == 1 & x.sup == 1))) result = recip (y); ## Resize, if scalar × matrix if (not (size_equal (x.inf, y.inf))) result.inf = ones (size (x.inf)) .* result.inf; result.sup = ones (size (x.inf)) .* result.sup; endif return endif ## Resize, if scalar × matrix if (not (size_equal (x.inf, y.inf))) x.inf = ones (size (y.inf)) .* x.inf; x.sup = ones (size (y.inf)) .* x.sup; y.inf = ones (size (x.inf)) .* y.inf; y.sup = ones (size (x.inf)) .* y.sup; endif ## Partitionize the function's domain q1 = x.sup <= 0 & y.sup < 0; q2 = x.sup <= 0 & y.inf > 0; q3 = x.sup <= 0 & y.sup == 0; q4 = x.sup <= 0 & y.sup > 0 & y.inf == 0; q5 = x.inf >= 0 & x.sup > 0 & y.sup < 0; q6 = x.inf >= 0 & x.sup > 0 & y.inf > 0; q7 = x.inf >= 0 & x.sup > 0 & y.sup == 0; q8 = x.inf >= 0 & x.sup > 0 & y.sup > 0 & y.inf == 0; q9 = x.inf < 0 & 0 < x.sup & y.sup < 0; q10 = x.inf < 0 & 0 < x.sup & y.inf > 0; l = u = zeros (size (x.inf)); l (q1) = mpfr_function_d ('rdivide', -inf, x.sup(q1), y.inf(q1)); l (q2) = mpfr_function_d ('rdivide', -inf, x.inf(q2), y.inf(q2)); l (q3) = mpfr_function_d ('rdivide', -inf, x.sup(q3), y.inf(q3)); l (q4) = -inf; l (q5) = mpfr_function_d ('rdivide', -inf, x.sup(q5), y.sup(q5)); l (q6) = mpfr_function_d ('rdivide', -inf, x.inf(q6), y.sup(q6)); l (q7) = -inf; l (q8) = mpfr_function_d ('rdivide', -inf, x.inf(q8), y.sup(q8)); l (q9) = mpfr_function_d ('rdivide', -inf, x.sup(q9), y.sup(q9)); l (q10) = mpfr_function_d ('rdivide', -inf, x.inf(q10), y.inf(q10)); u (q1) = mpfr_function_d ('rdivide', +inf, x.inf(q1), y.sup(q1)); u (q2) = mpfr_function_d ('rdivide', +inf, x.sup(q2), y.sup(q2)); u (q3) = inf; u (q4) = mpfr_function_d ('rdivide', +inf, x.sup(q4), y.sup(q4)); u (q5) = mpfr_function_d ('rdivide', +inf, x.inf(q5), y.inf(q5)); u (q6) = mpfr_function_d ('rdivide', +inf, x.sup(q6), y.inf(q6)); u (q7) = mpfr_function_d ('rdivide', +inf, x.inf(q7), y.inf(q7)); u (q8) = inf; u (q9) = mpfr_function_d ('rdivide', +inf, x.inf(q9), y.sup(q9)); u (q10) = mpfr_function_d ('rdivide', +inf, x.sup(q10), y.inf(q10)); entireresult = (y.inf < 0 & y.sup > 0) | (x.inf < 0 & x.sup > 0 & ... (y.inf == 0 | y.sup == 0)); l(entireresult) = -inf; u(entireresult) = inf; zeroresult = x.inf == 0 & x.sup == 0; l(zeroresult) = u(zeroresult) = 0; l(l == 0) = -0; emptyresult = isempty (x) | isempty (y) | (y.inf == 0 & y.sup == 0); l(emptyresult) = inf; u(emptyresult) = -inf; result = infsup (); result.inf = l; result.sup = u; endfunction function result = recip (x) ## Compute the reciprocal of @var{X}. ## ## The result is equivalent to @code{1 ./ @var{X}}, but is computed more ## efficiently. ## ## Accuracy: The result is a tight enclosure. l = inf (size (x.inf)); u = -l; ## Fix signs to make use of limit values for 1 ./ x. x.inf(x.inf == 0) = +0; x.sup(x.sup == 0) = -0; select = (x.inf >= 0 | x.sup <= 0) & ... # undefined for x = [0, 0] not (x.inf == 0 & x.sup == 0) & ... # x is not empty x.inf < inf; if (any (select(:))) ## recip is monotonically decreasing l(select) = mpfr_function_d ('rdivide', -inf, 1, x.sup(select)); u(select) = mpfr_function_d ('rdivide', +inf, 1, x.inf(select)); endif ## singularity at x = 0 select = x.inf < 0 & x.sup > 0; if (any (select(:))) l(select) = -inf; u(select) = +inf; endif l(l == 0) = -0; result = infsup (); result.inf = l; result.sup = u; endfunction %!# from the documentation string %!assert (infsup (2, 3) ./ infsup (1, 2) == infsup (1, 3)); %!assert (1 ./ infsup (1, 4) == infsup (0.25, 1)); interval-2.1.0/inst/@infsup/realsqrt.m0000644000000000000000000000333713031036767016074 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} realsqrt (@var{X}) ## ## Compute the square root (for all non-negative numbers). ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## realsqrt (infsup (-6, 4)) ## @result{} ans = [0, 2] ## @end group ## @end example ## @seealso{@@infsup/sqr, @@infsup/rsqrt, @@infsup/pow, @@infsup/cbrt, @@infsup/nthroot} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-01 function x = realsqrt (x) l = mpfr_function_d ('realsqrt', -inf, max (0, x.inf)); u = mpfr_function_d ('realsqrt', +inf, max (0, x.sup)); emptyresult = isempty (x) | x.sup < 0; l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (realsqrt (infsup (-6, 4)) == infsup (0, 2)); %!# correct use of signed zeros %!test %! x = realsqrt (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = realsqrt (infsup (0, 2)); %! assert (signbit (inf (x))); interval-2.1.0/inst/@infsup/reshape.m0000644000000000000000000000426513031036767015667 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} reshape (@var{A}, @var{M}, @var{N}) ## @defmethodx {@@infsup} reshape (@var{X}, [@var{M} @var{N}]) ## ## Return an interval matrix with the specified dimensions (M, N) whose ## elements are taken from the interval matrix @var{A}. The elements of the ## matrix are accessed in column-major order (like Fortran arrays are stored). ## ## Note that the total number of elements in the original matrix ## (@code{prod (size (@var{A}))}) must match the total number of elements in ## the new matrix (@code{prod ([@var{M} @var{N}])}). ## ## @example ## @group ## reshape (infsup (1 : 6), 2, 3) ## @result{} ans = 2×3 interval matrix ## [1] [3] [5] ## [2] [4] [6] ## @end group ## @end example ## @seealso{@@infsup/resize, @@infsup/cat, @@infsup/postpad, @@infsup/prepad} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-19 function a = reshape (a, m, n) switch nargin case 2 if (numel (m) ~= 2) error ("interval:InvalidOperand", ... "reshape: SIZE must have 2 dimensions") else n = m(2); m = m(1); endif case 3 ## Nothing to do otherwise print_usage (); return endswitch if (not (isa (a, "infsup"))) print_usage (); return endif a.inf = reshape (a.inf, m, n); a.sup = reshape (a.sup, m, n); endfunction %!assert (reshape (infsup (1 : 6), 2, 3) == infsup (reshape (1 : 6, 2, 3))); interval-2.1.0/inst/@infsup/resize.m0000644000000000000000000000504413031036767015535 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} resize (@var{X}, @var{M}) ## @defmethodx {@@infsup} resize (@var{X}, @var{M}, @var{N}) ## @defmethodx {@@infsup} resize (@var{X}, [@var{M} @var{N}]) ## ## Resize interval matrix @var{X} cutting off elements as necessary. ## ## In the result, element with certain indices is equal to the corresponding ## element of @var{X} if the indices are within the bounds of @var{X}; ## otherwise, the element is set to zero. ## ## If only @var{M} is supplied, and it is a scalar, the dimension of the result ## is @var{M}-by-@var{M}. If @var{M} and @var{N} are all scalars, then the ## dimensions of the result are @var{M}-by-@var{N}. If given a vector as ## input, then the dimensions of the result are given by the elements of that ## vector. ## ## @example ## @group ## resize (infsup (magic (3)), 4, 2) ## @result{} ans = 4×2 interval matrix ## [8] [1] ## [3] [5] ## [4] [9] ## [0] [0] ## @end group ## @end example ## @seealso{@@infsup/reshape, @@infsup/cat, @@infsup/postpad, @@infsup/prepad} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-19 function x = resize (x, m, n) switch nargin case 2 if (isempty (m)) m = n = 0; elseif (isscalar (m)) n = m; elseif (numel (m) > 2) error ("interval:InvalidOperand", ... "resize: no more than 2 dimensions are supported") else n = m(2); m = m(1); endif case 3 ## Nothing to do otherwise print_usage (); return endswitch if (not (isa (x, "infsup"))) print_usage (); return endif x.inf = resize (x.inf, m, n); x.sup = resize (x.sup, m, n); x.inf(x.inf == 0) = -0; endfunction %!assert (resize (infsup (magic (3)), 4, 2) == infsup ([8, 1; 3, 5; 4, 9; 0, 0])); interval-2.1.0/inst/@infsup/round.m0000644000000000000000000000544213031036767015365 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} round (@var{X}) ## ## Round each number in interval @var{X} to the nearest integer. Ties are ## rounded away from zero (towards +Inf or -Inf depending on the sign). ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## round (infsup (2.5, 3.5)) ## @result{} ans = [3, 4] ## round (infsup (-0.5, 5)) ## @result{} ans = [-1, +5] ## @end group ## @end example ## @seealso{@@infsup/floor, @@infsup/ceil, @@infsup/roundb, @@infsup/fix} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = round (x) if (nargin ~= 1) print_usage (); return endif x.inf = round (x.inf); x.sup = round (x.sup); x.inf(x.inf == 0) = -0; x.sup(x.sup == 0) = +0; endfunction %!# Empty interval %!assert (round (infsup ()) == infsup ()); %!# Singleton intervals %!assert (round (infsup (0)) == infsup (0)); %!assert (round (infsup (0.5)) == infsup (1)); %!assert (round (infsup (0.25)) == infsup (0)); %!assert (round (infsup (0.75)) == infsup (1)); %!assert (round (infsup (-0.5)) == infsup (-1)); %!# Bounded intervals %!assert (round (infsup (-0.5, 0)) == infsup (-1, 0)); %!assert (round (infsup (0, 0.5)) == infsup (0, 1)); %!assert (round (infsup (0.25, 0.5)) == infsup (0, 1)); %!assert (round (infsup (-1, 0)) == infsup (-1, 0)); %!assert (round (infsup (-1, 1)) == infsup (-1, 1)); %!assert (round (infsup (-realmin, realmin)) == infsup (0)); %!assert (round (infsup (-realmax, realmax)) == infsup (-realmax, realmax)); %!# Unbounded intervals %!assert (round (infsup (-realmin, inf)) == infsup (0, inf)); %!assert (round (infsup (-realmax, inf)) == infsup (-realmax, inf)); %!assert (round (infsup (-inf, realmin)) == infsup (-inf, 0)); %!assert (round (infsup (-inf, realmax)) == infsup (-inf, realmax)); %!assert (round (infsup (-inf, inf)) == infsup (-inf, inf)); %!# correct use of signed zeros %!test %! x = round (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = round (infsup (-0.25, 0.25)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/roundb.m0000644000000000000000000000556713031036767015537 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} roundb (@var{X}) ## ## Round each number in interval @var{X} to the nearest integer. Ties are ## rounded towards the nearest even integer. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## roundb (infsup (2.5, 3.5)) ## @result{} ans = [2, 4] ## roundb (infsup (-0.5, 5.5)) ## @result{} ans = [0, 6] ## @end group ## @end example ## @seealso{@@infsup/floor, @@infsup/ceil, @@infsup/round, @@infsup/fix} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = roundb (x) if (nargin ~= 1) print_usage (); return endif x.inf = roundb (x.inf); x.sup = roundb (x.sup); x.inf(x.inf == 0) = -0; x.sup(x.sup == 0) = +0; endfunction %!# Empty interval %!assert (roundb (infsup ()) == infsup ()); %!# Singleton intervals %!assert (roundb (infsup (0)) == infsup (0)); %!assert (roundb (infsup (0.5)) == infsup (0)); %!assert (roundb (infsup (0.25)) == infsup (0)); %!assert (roundb (infsup (0.75)) == infsup (1)); %!assert (roundb (infsup (1.5)) == infsup (2)); %!assert (roundb (infsup (-0.5)) == infsup (0)); %!assert (roundb (infsup (-1.5)) == infsup (-2)); %!# Bounded intervals %!assert (roundb (infsup (-0.5, 0)) == infsup (0)); %!assert (roundb (infsup (0, 0.5)) == infsup (0)); %!assert (roundb (infsup (0.25, 0.5)) == infsup (0)); %!assert (roundb (infsup (-1, 0)) == infsup (-1, 0)); %!assert (roundb (infsup (-1, 1)) == infsup (-1, 1)); %!assert (roundb (infsup (-realmin, realmin)) == infsup (0)); %!assert (roundb (infsup (-realmax, realmax)) == infsup (-realmax, realmax)); %!# Unbounded intervals %!assert (roundb (infsup (-realmin, inf)) == infsup (0, inf)); %!assert (roundb (infsup (-realmax, inf)) == infsup (-realmax, inf)); %!assert (roundb (infsup (-inf, realmin)) == infsup (-inf, 0)); %!assert (roundb (infsup (-inf, realmax)) == infsup (-inf, realmax)); %!assert (roundb (infsup (-inf, inf)) == infsup (-inf, inf)); %!# correct use of signed zeros %!test %! x = roundb (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); %!test %! x = roundb (infsup (-0.25, 0.25)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/rows.m0000644000000000000000000000220013031036767015215 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} rows (@var{A}) ## ## Return the number of rows of @var{A}. ## @seealso{@@infsup/numel, @@infsup/size, @@infsup/length, @@infsup/columns} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-29 function result = rows (a) if (nargin ~= 1) print_usage (); return endif result = rows (a.inf); endfunction %!assert (rows (infsup (zeros (3, 4))), 3); interval-2.1.0/inst/@infsup/rsqrt.m0000644000000000000000000000307013031036767015404 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} rsqrt (@var{X}) ## ## Compute the reciprocal square root (for all positive numbers). ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## rsqrt (infsup (-6, 4)) ## @result{} ans = [0.5, Inf] ## @end group ## @end example ## @seealso{@@infsup/realsqrt} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function x = rsqrt (x) l = mpfr_function_d ('rsqrt', -inf, max (0, x.sup)); u = mpfr_function_d ('rsqrt', +inf, max (0, x.inf)); emptyresult = isempty (x) | x.sup <= 0; l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (rsqrt (infsup (-6, 4)) == infsup (.5, inf)); %!# correct use of signed zeros %!test %! x = rsqrt (infsup (0, inf)); %! assert (signbit (inf (x))); interval-2.1.0/inst/@infsup/sdist.m0000644000000000000000000000540613031036767015364 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} sdist (@var{X}, @var{Y}) ## ## Compute the signed distance between two intervals as sets. ## ## The signed distance for closed real intervals is the minimum distance ## between each pair of numbers, where the result's sign indicates whether ## @var{x} precedes @var{y} (negative), @var{y} precedes @var{x} (positive), or ## @var{x} intersects @var{y} (zero). That is, the signed distance equals zero ## if a number can be found in both intervals. Otherwise the signed distance ## is the positive or negative size of the gap between both intervals on the ## real number lane. ## ## If any interval is empty, the result is NaN. For interval matrices the ## result is computed entry-wise. ## ## Accuracy: The result is correctly-rounded (away from zero). ## ## @example ## @group ## sdist (infsup (0, 6), infsup (7, 20)) ## @result{} ans = -1 ## sdist (infsup (3, 5), infsup (0, 1)) ## @result{} ans = 2 ## @end group ## @end example ## @seealso{@@infsup/idist, @@infsup/hdist} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-06-11 function result = sdist (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); endif ## Resize, if scalar × matrix if (not (size_equal (x.inf, y.inf))) x.inf = ones (size (y.inf)) .* x.inf; x.sup = ones (size (y.inf)) .* x.sup; y.inf = ones (size (x.inf)) .* y.inf; y.sup = ones (size (x.inf)) .* y.sup; endif result = zeros (size (x.inf)); select = x.sup < y.inf; if (any (select(:))) result(select) = ... mpfr_function_d ('minus', -inf, x.sup(select), y.inf(select)); endif select = x.inf > y.sup; if (any (select(:))) result(select) = max (result(select), ... mpfr_function_d ('minus', +inf, x.inf(select), y.sup(select))); endif result(isempty (x) | isempty (y)) = nan (); endfunction %!# from the documentation string %!assert (sdist (infsup (0, 6), infsup (7, 20)), -1); %!assert (sdist (infsup (3, 5), infsup (0, 1)), 2); interval-2.1.0/inst/@infsup/sec.m0000644000000000000000000000536513031036767015014 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} sec (@var{X}) ## ## Compute the secant in radians, that is the reciprocal cosine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sec (infsup (1)) ## @result{} ans ⊂ [1.8508, 1.8509] ## @end group ## @end example ## @seealso{@@infsup/cos, @@infsup/csc, @@infsup/cot} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function x = sec (x) if (nargin ~= 1) print_usage (); return endif l = u = derivl = derivu = zeros (size (x.inf)); ## Check, if wid (x) is certainly greater than 2*pi. This can save the ## computation if some values. width = mpfr_function_d ('minus', -inf, x.sup, x.inf); persistent pi = infsup ("pi"); certainlysingularity = width >= sup (pi); ## We simply compute the secant for both endpoints. select = not (certainlysingularity); l(select) = min (... mpfr_function_d ('sec', -inf, x.inf(select)), ... mpfr_function_d ('sec', -inf, x.sup(select))); u(select) = max (... mpfr_function_d ('sec', inf, x.inf(select)), ... mpfr_function_d ('sec', inf, x.sup(select))); ## A change of sign is a sufficient singularity indicator certainlysingularity = certainlysingularity | (select & sign (l) ~= sign (u)); l(certainlysingularity) = -inf; u(certainlysingularity) = inf; ## Check, whether the interval contains a local extremum using the derivative select = not (certainlysingularity); derivl(select) = mpfr_function_d ('sec', 0, x.inf(select)) .* ... mpfr_function_d ('tan', 0, x.inf(select)); derivu(select) = mpfr_function_d ('sec', 0, x.sup(select)) .* ... mpfr_function_d ('tan', 0, x.sup(select)); hasextremum = select & ((derivl <= 0 & derivu >= 0) | ... (derivl >= 0 & derivu <= 0)); l(hasextremum & l > 0) = 1; u(hasextremum & u < 0) = -1; emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (sec (infsup (1)) == "[0x1.D9CF0F125CC29, 0x1.D9CF0F125CC2A]"); interval-2.1.0/inst/@infsup/sech.m0000644000000000000000000000322113031036767015151 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} sech (@var{X}) ## ## Compute the hyperbolic secant, that is the reciprocal hyperbolic cosine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sech (infsup (1)) ## @result{} ans ⊂ [0.64805, 0.64806] ## @end group ## @end example ## @seealso{@@infsup/cosh, @@infsup/csch, @@infsup/coth} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function x = sech (x) if (nargin ~= 1) print_usage (); return endif l = mpfr_function_d ('sech', -inf, mag (x)); u = mpfr_function_d ('sech', +inf, mig (x)); emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (sech (infsup (1)) == "[0x1.4BCDC50ED6BE7p-1, 0x1.4BCDC50ED6BE8p-1]"); %!# correct use of signed zeros %!test %! x = sech (infsup (0, inf)); %! assert (signbit (inf (x))); interval-2.1.0/inst/@infsup/setdiff.m0000644000000000000000000000460713031036767015664 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} setdiff (@var{A}, @var{B}) ## ## Build the relative complement of interval @var{B} in interval @var{A}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsup (1, 3); ## y = infsup (2, 4); ## setdiff (x, y) ## @result{} ans = [1, 2] ## @end group ## @end example ## @seealso{@@infsup/intersect, @@infsup/union, @@infsup/setxor} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-03 function a = setdiff (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (b, "infsup"))) b = infsup (b); endif ## Resize, if scalar × matrix if (not (size_equal (a.inf, b.inf))) a.inf = ones (size (b.inf)) .* a.inf; a.sup = ones (size (b.inf)) .* a.sup; b.inf = ones (size (a.inf)) .* b.inf; b.sup = ones (size (a.inf)) .* b.sup; endif l = a.inf; u = a.sup; select = b.sup >= a.sup & b.inf > a.inf; u(select) = min (u(select), b.inf(select)); select = b.inf <= a.inf & b.sup < a.sup; l(select) = max (l(select), b.sup(select)); emptyresult = b.inf <= a.inf & b.sup >= a.sup; l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; u(u == 0) = +0; a.inf = l; a.sup = u; endfunction %!assert (isempty (setdiff (infsup (), infsup (1, 4)))); %!assert (setdiff (infsup (1, 3), infsup ()) == infsup (1, 3)); %!assert (isempty (setdiff (infsup (1, 3), infsup (-inf, inf)))); %!assert (isempty (setdiff (infsup (1, 3), infsup (1, 4)))); %!assert (setdiff (infsup (-inf, inf), infsup (1, 4)) == infsup (-inf, inf)); %!# from the documentation string %! assert (setdiff (infsup (1, 3), infsup (2, 4)) == infsup (1, 2)); interval-2.1.0/inst/@infsup/setxor.m0000644000000000000000000001013413031036767015554 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {} setxor (@var{A}, @var{B}) ## @deftypemethodx {@@infsup} {[@var{C}, @var{C1}, @var{C2}] =} setxor (@var{A}, @var{B}) ## ## Build the symmetric difference of intervals @var{A} and @var{B}. ## ## With three output arguments, return intervals @var{C1} and @var{C2} such ## that @var{C1} and @var{C2} are enclosures of disjoint sets whose union is ## enclosed by interval @var{C}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsup (1, 3); ## y = infsup (2, 4); ## [z, z1, z2] = setxor (x, y) ## @result{} ## z = [1, 4] ## z1 = [1, 2] ## z2 = [3, 4] ## @end group ## @end example ## @seealso{@@infsup/intersect, @@infsup/union, @@infsup/setdiff} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-03 function [c, c1, c2] = setxor (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (b, "infsup"))) b = infsup (b); endif ## Resize, if scalar × matrix if (not (size_equal (a.inf, b.inf))) a.inf = ones (size (b.inf)) .* a.inf; a.sup = ones (size (b.inf)) .* a.sup; b.inf = ones (size (a.inf)) .* b.inf; b.sup = ones (size (a.inf)) .* b.sup; endif ## Sort the four boundaries in ascending order b1 <= b2 <= b3 <= b4, ## if only one empty interval is present, then [b2, b3] = [Empty], ## with two empty intervals we also have [b1, b4] = [Empty]. b1 = min (a.inf, b.inf); b2 = max (a.inf, b.inf); b3 = min (a.sup, b.sup); b4 = max (a.sup, b.sup); [b2, b3] = deal (min (b2, b3), max (b2, b3)); l = b1; u = b4; select = a.inf == b.inf; l(select) = b3(select); select = a.sup == b.sup; u(select) = b2(select); select = a.inf == b.inf & a.sup == b.sup; l(select) = inf; u(select) = -inf; l(l == 0) = -0; u(u == 0) = +0; c = infsup (); c.inf = l; c.sup = u; if (nargout > 1) select = isempty (a) | isempty (b); b1(select) = a.inf(select); b2(select) = a.sup(select); b3(select) = b.inf(select); b4(select) = b.sup(select); l1 = b1; u1 = b2; select = a.inf == b.inf; l1(select) = inf; u1(select) = -inf; l1(l1 == 0) = -0; u1(u1 == 0) = +0; c1 = infsup (); c1.inf = l1; c1.sup = u1; l2 = b3; u2 = b4; select = a.sup == b.sup; l2(select) = inf; u2(select) = -inf; l2(l2 == 0) = -0; u2(u2 == 0) = +0; c2 = infsup (); c2.inf = l2; c2.sup = u2; endif endfunction %!test %! [z, z1, z2] = setxor (infsup (), infsup ()); %! assert (isempty (z)); %! assert (isempty (z1)); %! assert (isempty (z2)); %!test %! [z, z1, z2] = setxor (infsup (-inf, inf), infsup ()); %! assert (isentire (z)); %! assert (isentire (z1)); %! assert (isempty (z2)); %!test %! [z, z1, z2] = setxor (infsup (-inf, inf), infsup (2)); %! assert (isentire (z)); %! assert (z1 == infsup (-inf, 2)); %! assert (z2 == infsup (2, inf)); %!test %! [z, z1, z2] = setxor (infsup (2, 3), infsup (2)); %! assert (z == infsup (2, 3)); %! assert (z1 == infsup ()); %! assert (z2 == infsup (2, 3)); %!test %! [z, z1, z2] = setxor (infsup (2, 3), infsup (2, 2.5)); %! assert (z == infsup (2.5, 3)); %! assert (z1 == infsup ()); %! assert (z2 == infsup (2.5, 3)); %!# from the documentation string %!test %! [z, z1, z2] = setxor (infsup (1, 3), infsup (2, 4)); %! assert (z == infsup (1, 4)); %! assert (z1 == infsup (1, 2)); %! assert (z2 == infsup (3, 4)); interval-2.1.0/inst/@infsup/sign.m0000644000000000000000000000332113031036767015170 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} sign (@var{X}) ## ## Compute the signum function for each number in interval @var{X}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sign (infsup (2, 3)) ## @result{} ans = [1] ## sign (infsup (0, 5)) ## @result{} ans = [0, 1] ## sign (infsup (-17)) ## @result{} ans = [-1] ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function x = sign (x) if (nargin ~= 1) print_usage (); return endif l = sign (x.inf); u = sign (x.sup); emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (sign (infsup (2, 3)) == infsup (1)); %!assert (sign (infsup (0, 5)) == infsup (0, 1)); %!assert (sign (infsup (-17)) == infsup (-1)); %!# correct use of signed zeros %!test %! x = sign (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/sin.m0000644000000000000000000000765113031036767015033 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} sin (@var{X}) ## ## Compute the sine in radians. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sin (infsup (1)) ## @result{} ans ⊂ [0.84147, 0.84148] ## @end group ## @end example ## @seealso{@@infsup/asin, @@infsup/csc, @@infsup/sinh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-05 function x = sin (x) if (nargin ~= 1) print_usage (); return endif l = u = cossignl = cossignu = zeros (size (x.inf)); ## Check, if wid (x) is certainly greater than 2*pi. This can save the ## computation if some sine values. width = mpfr_function_d ('minus', -inf, x.sup, x.inf); persistent pi = infsup ("pi"); persistent twopi = 2 .* pi; certainlyfullperiod = width >= sup (twopi); l(certainlyfullperiod) = -1; u(certainlyfullperiod) = 1; possiblynotfullperiod = not (certainlyfullperiod); if (__check_crlibm__ ()) l(possiblynotfullperiod) = min (... crlibm_function ('sin', -inf, x.inf(possiblynotfullperiod)), ... crlibm_function ('sin', -inf, x.sup(possiblynotfullperiod))); u(possiblynotfullperiod) = max (... crlibm_function ('sin', inf, x.inf(possiblynotfullperiod)), ... crlibm_function ('sin', inf, x.sup(possiblynotfullperiod))); ## We use sign (cos) to know the gradient at the boundaries. cossignl(possiblynotfullperiod) = sign (... crlibm_function ('cos', .5, x.inf(possiblynotfullperiod))); cossignu(possiblynotfullperiod) = sign (... crlibm_function ('cos', .5, x.sup(possiblynotfullperiod))); else l(possiblynotfullperiod) = min (... mpfr_function_d ('sin', -inf, x.inf(possiblynotfullperiod)), ... mpfr_function_d ('sin', -inf, x.sup(possiblynotfullperiod))); u(possiblynotfullperiod) = max (... mpfr_function_d ('sin', inf, x.inf(possiblynotfullperiod)), ... mpfr_function_d ('sin', inf, x.sup(possiblynotfullperiod))); ## We use sign (cos) to know the gradient at the boundaries. cossignl(possiblynotfullperiod) = sign (... mpfr_function_d ('cos', .5, x.inf(possiblynotfullperiod))); cossignu(possiblynotfullperiod) = sign (... mpfr_function_d ('cos', .5, x.sup(possiblynotfullperiod))); endif ## In case of sign (cos) == 0, we conservatively use sign (cos) of nextout. cossignl(cossignl == 0) = sign (l(cossignl == 0)); cossignu(cossignu == 0) = (-1) * sign (u(cossignu == 0)); containsinf = possiblynotfullperiod & ((cossignl == -1 & cossignu == 1) | ... (cossignl == cossignu & ... width >= sup (pi))); l(containsinf) = -1; containssup = possiblynotfullperiod & ((cossignl == 1 & cossignu == -1) | ... (cossignl == cossignu & ... width >= sup (pi))); u(containssup) = 1; emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (sin (infsup (1)) == "[0x1.AED548F090CEEp-1, 0x1.AED548F090CEFp-1]"); %!# correct use of signed zeros %!test %! x = sin (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/sinh.m0000644000000000000000000000342313031036767015174 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} sinh (@var{X}) ## ## Compute the hyperbolic sine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sinh (infsup (1)) ## @result{} ans ⊂ [1.1752, 1.1753] ## @end group ## @end example ## @seealso{@@infsup/asinh, @@infsup/csch, @@infsup/cosh, @@infsup/tanh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-06 function x = sinh (x) if (nargin ~= 1) print_usage (); return endif if (__check_crlibm__ ()) l = crlibm_function ('sinh', -inf, x.inf); u = crlibm_function ('sinh', +inf, x.sup); else l = mpfr_function_d ('sinh', -inf, x.inf); u = mpfr_function_d ('sinh', +inf, x.sup); endif emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (sinh (infsup (1)) == "[0x1.2CD9FC44EB982, 0x1.2CD9FC44EB983]"); %!# correct use of signed zeros %!test %! x = sinh (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/sinrev.m0000644000000000000000000001210413031036767015535 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{X} =} sinrev (@var{C}, @var{X}) ## @deftypemethodx {@@infsup} {@var{X} =} sinrev (@var{C}) ## ## Compute the reverse sine function. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{sin (x) ∈ @var{C}}. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## sinrev (infsup (-1), infsup (0, 6)) ## @result{} ans ⊂ [4.7123, 4.7124] ## @end group ## @end example ## @seealso{@@infsup/sin} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = sinrev (c, x) if (nargin > 2) print_usage (); return endif if (nargin < 2) x = infsup (-inf, inf); endif if (not (isa (c, "infsup"))) c = infsup (c); endif if (not (isa (x, "infsup"))) x = infsup (x); endif arcsine = asin (c); result = x; ## Resize, if scalar × matrix if (not (size_equal (arcsine.inf, result.inf))) arcsine.inf = ones (size (result.inf)) .* arcsine.inf; arcsine.sup = ones (size (result.inf)) .* arcsine.sup; result.inf = ones (size (arcsine.inf)) .* result.inf; result.sup = ones (size (arcsine.inf)) .* result.sup; endif result.inf(isempty (arcsine)) = inf; result.sup(isempty (arcsine)) = -inf; idx.type = '()'; persistent pi = infsup ("pi"); select = not (isempty (result)) ... & not (subset (infsup (-pi.sup / 2, pi.sup / 2), arcsine)); if (any (select(:))) ## Find a smaller upper bound for x, if the restriction from c allows it u = inf (size (result.inf)); select_u = select & result.sup < inf; ## Find n, such that result.sup is within a distance of pi/2 around n * pi. n = result.sup; n(select_u) = ceil (floor (sup (n(select_u) ./ (pi ./ 2))) ./ 2); arcsineshifted = arcsine; idx.subs = {(select_u & rem (n, 2) == 0)}; arcsineshifted = subsasgn (arcsineshifted, idx, ... subsref (arcsineshifted, idx) + subsref (n, idx) .* pi); idx.subs = {(select_u & rem (n, 2) ~= 0)}; arcsineshifted = subsasgn (arcsineshifted, idx, ... subsref (n, idx) .* pi - subsref (arcsineshifted, idx)); overlapping = not (isempty (intersect (result, arcsineshifted))); u(select_u & overlapping) = ... min (result.sup(select_u & overlapping), ... arcsineshifted.sup(select_u & overlapping)); m = n; m(select_u & ~overlapping) = ... mpfr_function_d ('minus', +inf, m(select_u & ~overlapping), 1); idx.subs = {(select_u & ~overlapping & rem (n, 2) == 0)}; u(idx.subs{1}) = ... sup (subsref (m, idx) .* pi - subsref (arcsine, idx)); idx.subs = {(select_u & ~overlapping & rem (n, 2) ~= 0)}; u(idx.subs{1}) = ... sup (subsref (arcsine, idx) + subsref (m, idx) .* pi); ## Find a larger lower bound for x, if the restriction from c allows it l = -inf (size (result.inf)); select_l = select & result.inf > -inf; ## Find n, such that result.inf is within a distance of pi/2 around n * pi. n = result.inf; n(select_l) = floor (ceil (inf (n(select_l) ./ (pi ./ 2))) ./ 2); arcsineshifted = arcsine; idx.subs = {(select_l & rem (n, 2) == 0)}; arcsineshifted = subsasgn (arcsineshifted, idx, ... subsref (arcsineshifted, idx) + subsref (n, idx) .* pi); idx.subs = {(select_l & rem (n, 2) ~= 0)}; arcsineshifted = subsasgn (arcsineshifted, idx, ... subsref (n, idx) .* pi - subsref (arcsineshifted, idx)); overlapping = not (isempty (intersect (result, arcsineshifted))); l(select_l & overlapping) = ... max (result.inf(select_l & overlapping), ... arcsineshifted.inf(select_l & overlapping)); m = n; m(select_l & ~overlapping) = ... mpfr_function_d ('plus', -inf, m(select_l & ~overlapping), 1); idx.subs = {(select_l & ~overlapping & rem (n, 2) == 0)}; l(idx.subs {1}) = ... inf (subsref (m, idx) .* pi - subsref (arcsine, idx)); idx.subs = {(select_l & ~overlapping & rem (n, 2) ~= 0)}; l(idx.subs {1}) = ... inf (subsref (arcsine, idx) + subsref (m, idx) .* pi); result.inf(select) = max (l(select), result.inf(select)); result.sup(select) = min (u(select), result.sup(select)); result.inf(result.inf > result.sup) = inf; result.sup(result.inf > result.sup) = -inf; endif endfunction %!# from the documentation string %!assert (sinrev (infsup (-1), infsup (0, 6)) == "[0x1.2D97C7F3321D2p2, 0x1.2D97C7F3321D3p2]"); interval-2.1.0/inst/@infsup/size.m0000644000000000000000000000336013031036767015205 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} size (@var{A}) ## @defmethodx {@@infsup} size (@var{A}, @var{DIM}) ## ## Return the number of rows and columns of @var{A}. ## ## With one input argument and one output argument, the result is returned in a ## row vector. If there are multiple output arguments, the number of rows is ## assigned to the first, and the number of columns to the second, etc. ## ## If given a second argument, @code{size} will return the size of the ## corresponding dimension. ## @seealso{@@infsup/length, @@infsup/numel, @@infsup/rows, @@infsup/columns} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-29 function varargout = size (a, dim) if (nargin == 0 || nargin > 2) print_usage (); return endif if (nargin == 1) if (nargout <= 1) varargout{1} = size (a.inf); else varargout = mat2cell (size (a.inf)(1 : nargout)', ones (nargout, 1)); endif else varargout{1} = size (a.inf, dim); endif endfunction %!assert (size (infsup (zeros (3, 4))), [3 4]); interval-2.1.0/inst/@infsup/smig.m0000644000000000000000000000306613031036767015175 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} smig (@var{X}) ## ## Get the signed mignitude of numbers in interval @var{X}, that is the unique ## number closest to zero for each element. ## ## If @var{X} is empty, @code{smig (@var{X})} is NaN. ## ## Accuracy: The result is exact. ## ## @example ## @group ## smig (infsup (-2, -1)) ## @result{} ans = -1 ## @end group ## @end example ## @seealso{@@infsup/mig, @@infsup/mag, @@infsup/inf, @@infsup/sup} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-06-13 function result = smig (x) if (nargin ~= 1) print_usage (); return endif result = zeros (size (x.inf)); result(x.inf > 0) = x.inf; result(x.sup < 0) = x.sup; result(isempty (x)) = nan (); endfunction %!assert (smig (infsup (-1, 2)), 0); %!assert (smig (infsup (-42, -23)), -23); %!assert (smig (infsup (23, 42)), 23); interval-2.1.0/inst/@infsup/sqrrev.m0000644000000000000000000000325213031036767015555 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{X} =} sqrrev (@var{C}, @var{X}) ## @deftypemethodx {@@infsup} {@var{X} =} sqrrev (@var{C}) ## ## Compute the reverse square function. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{sqr (x) ∈ @var{C}}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sqrrev (infsup (-2, 1)) ## @result{} ans = [-1, +1] ## @end group ## @end example ## @seealso{@@infsup/sqr} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = sqrrev (c, x) if (nargin > 2) print_usage (); return endif if (nargin < 2) x = infsup (-inf, inf); endif if (not (isa (c, "infsup"))) c = infsup (c); endif if (not (isa (x, "infsup"))) x = infsup (x); endif p = sqrt (c); n = -p; result = union (intersect (p, x), intersect (n, x)); endfunction %!# from the documentation string %!assert (sqrrev (infsup (-2, 1)) == infsup (-1, 1)); interval-2.1.0/inst/@infsup/sqrt.m0000644000000000000000000000270213031036767015223 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} sqrt (@var{X}) ## ## Compute the square root (for all non-negative numbers). ## ## Since intervals are only defined for real numbers, this function and ## @code{realsqrt} are equivalent. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sqrt (infsup (-6, 4)) ## @result{} ans = [0, 2] ## @end group ## @end example ## @seealso{@@infsup/sqr, @@infsup/pow, @@infsup/nthroot, @@infsup/cbrt} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function result = sqrt (x) if (nargin ~= 1) print_usage (); return endif result = realsqrt (x); endfunction %!# from the documentation string %!assert (sqrt (infsup (-6, 4)) == infsup (0, 2)); interval-2.1.0/inst/@infsup/strictprecedes.m0000644000000000000000000000317413031036767017261 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} strictprecedes (@var{A}, @var{B}) ## ## Evaluate strict precedes comparison on intervals. ## ## True, if @var{A} is strictly left of @var{B}. The intervals may not touch. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsup/eq, @@infsup/le, @@infsup/lt, @@infsup/gt, @@infsup/precedes, @@infsup/subset, @@infsup/interior, @@infsup/disjoint} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-07 function result = strictprecedes (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (b, "infsup"))) b = infsup (b); endif result = (a.sup < b.inf); result(isempty (a) | isempty (b)) = true (); endfunction %!assert (strictprecedes (infsup (1, 1.9), infsup (2.1, 3))); %!assert (not (strictprecedes (infsup (1, 2), infsup (2, 3)))); interval-2.1.0/inst/@infsup/strictsubset.m0000644000000000000000000000424213031036767016771 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} strictsubset (@var{A}, @var{B}) ## ## Evaluate strict subset comparison on intervals. ## ## True, if all numbers from @var{A} are also contained in @var{B} and @var{B} ## contains a number that is not in @var{A}. ## False, if @var{A} contains a number which is not a member in @var{B} or if ## @var{A} and @var{B} are equal. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsup/subset, @@infsup/eq, @@infsup/interior} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-05-16 function result = strictsubset (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (b, "infsup"))) b = infsup (b); endif result = (b.inf <= a.inf & a.sup <= b.sup) & (b.inf != a.inf | a.sup != b.sup); endfunction %!assert (strictsubset (infsup (1, 2), infsup (1, 3))); %!assert (strictsubset (infsup (2, 3), infsup (1, 3))); %!assert (not (strictsubset (infsup (1, 2), infsup (1, 2)))); %!assert (not (strictsubset (infsup (1, 3), infsup (1, 2)))); %!assert (strictsubset (infsup (), infsup (1, 3))); %!assert (not (strictsubset (infsup (), infsup ()))); %!assert (strictsubset (infsup (), infsup (-inf, inf))); %!assert (strictsubset (infsup (0, inf), infsup (-inf, inf))); %!assert (strictsubset (infsup (-inf, 0), infsup (-inf, inf))); %!assert (not (strictsubset (infsup (-inf, inf), infsup (-inf, inf)))); interval-2.1.0/inst/@infsup/subsasgn.m0000644000000000000000000000375513031036767016070 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} subsasgn (@var{A}, @var{IDX}, @var{RHS}) ## @defopx Operator {@@infsup} {@var{A}(@var{SUBS}) = @var{RHS}} ## ## Perform the subscripted assignment operation according to the subscript ## specified by @var{IDX}. ## ## The subscript @var{IDX} is expected to be a structure array with fields ## @code{type} and @code{subs}. Only valid value for @var{type} is ## @code{"()"}. The @code{subs} field may be either @code{":"} or a cell array ## of index values. ## @seealso{@@infsup/subsref} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-29 function A = subsasgn (A, S, B) if (nargin ~= 3) print_usage (); return endif if (not (isa (A, "infsup"))) A = infsup (A); endif if (not (isa (B, "infsup"))) B = infsup (B); elseif (isa (B, "infsupdec")) ## Workaround for bug #42735 A = subsasgn (A, S, B); return endif assert (strcmp (S.type, "()"), "only subscripts with parenthesis allowed"); A.inf = subsasgn (A.inf, S, B.inf); A.sup = subsasgn (A.sup, S, B.sup); A.inf(A.inf == 0) = -0; # any new elements are stored as [-0, +0] internally endfunction %!test %! A = infsup (magic (3)); %! A(4, 4) = 42; %! assert (inf (A), [magic(3),[0;0;0];0,0,0,42]); %! assert (sup (A), [magic(3),[0;0;0];0,0,0,42]); interval-2.1.0/inst/@infsup/subset.m0000644000000000000000000000275713031036767015551 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} subset (@var{A}, @var{B}) ## ## Evaluate subset comparison on intervals. ## ## True, if all numbers from @var{A} are also contained in @var{B}. ## False, if @var{A} contains a number which is not a member in @var{B}. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsup/eq, @@infsup/interior, @@infsup/disjoint} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function result = subset (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsup"))) a = infsup (a); endif if (not (isa (b, "infsup"))) b = infsup (b); endif result = (b.inf <= a.inf & a.sup <= b.sup); endfunction %!assert (subset (infsup (1, 2), infsup (1, 3))); interval-2.1.0/inst/@infsup/subsref.m0000644000000000000000000000533113031036767015704 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} subsref (@var{A}, @var{IDX}) ## @defopx Operator {@@infsup} {@var{A}(@var{I})} ## @defopx Operator {@@infsup} {@var{A}(@var{I1}, @var{I2})} ## @defopx Operator {@@infsup} {@var{A}.@var{P}} ## ## Select property @var{P} or elements @var{I} from interval matrix @var{A}. ## ## The index @var{I} may be either @code{:} or an index matrix. ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## The property @var{P} may correspond to any unary method of the interval's ## class, but usually is either @code{inf} or @code{sup}. ## ## @example ## @group ## x = infsup (magic (3), magic (3) + 1); ## x (1) ## @result{} ans = [8, 9] ## x (:, 2) ## @result{} ans = 3×1 interval vector ## [1, 2] ## [5, 6] ## [9, 10] ## x.inf ## @result{} ans = ## 8 1 6 ## 3 5 7 ## 4 9 2 ## @end group ## @end example ## @seealso{@@infsup/subsasgn} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-29 function A = subsref (A, S) if (nargin ~= 2) print_usage (); return endif switch S(1).type case "()" A.inf = subsref (A.inf, S(1)); A.sup = subsref (A.sup, S(1)); case "{}" error ("interval cannot be indexed with {}") case "." if (not (any (strcmp (S(1).subs, methods (A))))) error (["interval property ‘", S(1).subs, "’ is unknown"]) endif functionname = ["@infsup", filesep(), S(1).subs]; if (nargin (functionname) ~= 1) error (["‘", S(1).subs, "’ is not a valid interval property"]) endif A = feval (S(1).subs, A); otherwise error ("invalid subscript type") endswitch if (numel (S) > 1) A = subsref (A, S(2 : end)); endif endfunction %!assert (infsup (magic (3))([1, 2, 3]) == magic (3)([1, 2, 3])); %!# from the documentation string %!test %! x = infsup (magic (3), magic (3) + 1); %! assert (x(1) == infsup (8, 9)); %! assert (x(:, 2) == infsup ([1; 5; 9], [2; 6; 10])); %! assert (x.inf, magic (3)); interval-2.1.0/inst/@infsup/sum.m0000644000000000000000000000536413031036767015045 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} sum (@var{X}) ## @defmethodx {@@infsup} sum (@var{X}, @var{DIM}) ## ## Sum of elements along dimension @var{DIM}. If @var{DIM} is omitted, it ## defaults to the first non-singleton dimension. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sum ([infsup(1), pow2(-1074), -1]) ## @result{} ans ⊂ [4.9406e-324, 4.9407e-324] ## infsup (1) + pow2 (-1074) - 1 ## @result{} ans ⊂ [0, 2.2205e-16] ## @end group ## @end example ## @seealso{@@infsup/plus, @@infsup/prod} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-26 function result = sum (x, dim) if (nargin > 2) print_usage (); return endif if (nargin < 2) ## Try to find non-singleton dimension dim = find (size (x.inf) > 1, 1); if (isempty (dim)) dim = 1; endif endif ## Short-circuit if (size (x.inf, dim) == 1) result = x; return endif if (dim == 1) resultsize = [1, max(1, size (x.inf, 2))]; elseif (dim == 2) resultsize = [max(1, size (x.inf, 1)), 1]; else error ("interval:InvalidOperand", "sum: DIM must be a valid dimension") endif l = u = zeros (resultsize); for n = 1 : size (x.inf, 3 - dim) idx.type = "()"; idx.subs = cell (1, 2); idx.subs{dim} = ":"; idx.subs{3 - dim} = n; ## Select current vector in matrix if (size (x.inf, 3 - dim) == 1) vector.x = x; else vector.x = subsref (x, idx); endif if (any (isempty (vector.x)(:))) ## One of the intervals is empty l(n) = inf; u(n) = -inf; else l(n) = mpfr_vector_sum_d (-inf, vector.x.inf); u(n) = mpfr_vector_sum_d (+inf, vector.x.sup); endif endfor result = infsup (); result.inf = l; result.sup = u; endfunction %!# from the documentation string %!assert (sum ([infsup(1), pow2(-1074), -1]) == infsup (pow2 (-1074))); %!assert (sum (infsup ([])) == 0); %!# correct use of signed zeros %!test %! x = sum (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/sumabs.m0000644000000000000000000000334613031036767015531 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} sumabs (@var{X}) ## @defmethodx {@@infsup} sumabs (@var{X}, @var{DIM}) ## ## Sum of absolute values along dimension @var{DIM}. If @var{DIM} is omitted, ## it defaults to the first non-singleton dimension. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sumabs ([infsup(1), pow2(-1074), -1]) ## @result{} ans ⊂ [2, 2.0001] ## @end group ## @end example ## @seealso{@@infsup/sum, @@infsup/plus, @@infsup/abs} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-26 function result = sumabs (x, dim) if (nargin > 2) print_usage (); return endif if (nargin < 2) result = sum (abs (x)); else result = sum (abs (x), dim); endif endfunction %!# from the documentation string %!assert (sumabs ([infsup(1), pow2(-1074), -1]) == infsup (2, 2+eps*2)); %!assert (sumabs (infsup ([])) == 0); %!# correct use of signed zeros %!test %! x = sumabs (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/sumsq.m0000644000000000000000000000356513031036767015412 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} sumsq (@var{X}) ## @defmethodx {@@infsup} sumsq (@var{X}, @var{DIM}) ## ## Sum of squares along dimension @var{DIM}. If @var{DIM} is omitted, ## it defaults to the first non-singleton dimension. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sumsq ([infsup(1), pow2(-1074), -1]) ## @result{} ans ⊂ [2, 2.0001] ## @end group ## @end example ## @seealso{@@infsup/plus, @@infsup/sum, @@infsup/sumabs} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-26 function result = sumsq (x, dim) if (nargin > 2) print_usage (); return endif if (isempty (x.inf)) if (isa (x, 'infsupdec')) result = infsupdec (0); else result = infsup (0); endif return endif x = abs (x); if (nargin < 2) result = dot (x, x); else result = dot (x, x, dim); endif endfunction %!# from the documentation string %!assert (sumsq ([infsup(1), pow2(-1074), -1]) == infsup (2, 2+eps*2)); %!assert (sumsq (infsup ([])) == 0); %!# correct use of signed zeros %!test %! x = sumsq (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/sup.m0000644000000000000000000000263413031036767015045 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} sup (@var{X}) ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## ## Get the (least) upper boundary for all numbers of interval @var{X}. ## ## If @var{X} is empty, @code{sup (@var{X})} is negative infinity. ## ## Accuracy: The result is exact. ## ## @example ## @group ## sup (infsup (2.5, 3.5)) ## @result{} ans = 3.5000 ## @end group ## @end example ## @seealso{@@infsup/inf, @@infsup/mid} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-27 function result = sup (x) if (nargin ~= 1) print_usage (); return endif result = x.sup; endfunction %!# from the documentation string %!assert (sup (infsup (2.5, 3.5)), 3.5); interval-2.1.0/inst/@infsup/tan.m0000644000000000000000000000472413031036767015022 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} tan (@var{X}) ## ## Compute the tangent in radians. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## tan (infsup (1)) ## @result{} ans ⊂ [1.5574, 1.5575] ## @end group ## @end example ## @seealso{@@infsup/atan, @@infsup/tanh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-06 function x = tan (x) if (nargin ~= 1) print_usage (); return endif l = u = zeros (size (x)); ## Check, if wid (x) is certainly greater than pi. This may save computation of ## some tangent values. width = mpfr_function_d ('minus', -inf, x.sup, x.inf); persistent pi = infsup ("pi"); certainlyfullperiod = width >= sup (pi); possiblynotfullperiod = not (certainlyfullperiod); if (__check_crlibm__ ()) l(possiblynotfullperiod) = crlibm_function ('tan', -inf, x.inf(possiblynotfullperiod)); u(possiblynotfullperiod) = crlibm_function ('tan', inf, x.sup(possiblynotfullperiod)); else l(possiblynotfullperiod) = mpfr_function_d ('tan', -inf, x.inf(possiblynotfullperiod)); u(possiblynotfullperiod) = mpfr_function_d ('tan', inf, x.sup(possiblynotfullperiod)); endif singularity = certainlyfullperiod | ... l > u | (... width > 2 & (... sign (l) == sign (u) | ... max (abs (l), abs (u)) < 1)); l(singularity) = -inf; u(singularity) = inf; emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (tan (infsup (1)) == "[0x1.8EB245CBEE3A5, 0x1.8EB245CBEE3A6]"); %!# correct use of signed zeros %!test %! x = tan (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/tanh.m0000644000000000000000000000332313031036767015164 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} tanh (@var{X}) ## ## Compute the hyperbolic tangent. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## tanh (infsup (1)) ## @result{} ans ⊂ [0.76159, 0.7616] ## @end group ## @end example ## @seealso{@@infsup/atanh, @@infsup/coth, @@infsup/sinh, @@infsup/cosh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-07 function x = tanh (x) if (nargin ~= 1) print_usage (); return endif ## tanh is monotonically increasing from (-inf, -1) to (inf, 1) l = mpfr_function_d ('tanh', -inf, x.inf); u = mpfr_function_d ('tanh', +inf, x.sup); emptyresult = isempty (x); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (tanh (infsup (1)) == "[0x1.85EFAB514F394p-1, 0x1.85EFAB514F395p-1]"); %!# correct use of signed zeros %!test %! x = tanh (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/tanrev.m0000644000000000000000000001061213031036767015530 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsup} {@var{X} =} tanrev (@var{C}, @var{X}) ## @deftypemethodx {@@infsup} {@var{X} =} tanrev (@var{C}) ## ## Compute the reverse tangent function. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{tan (x) ∈ @var{C}}. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## tanrev (infsup (0), infsup (2, 4)) ## @result{} ans ⊂ [3.1415, 3.1416] ## @end group ## @end example ## @seealso{@@infsup/tan} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = tanrev (c, x) if (nargin > 2) print_usage (); return endif if (nargin < 2) x = infsup (-inf, inf); endif if (not (isa (c, "infsup"))) c = infsup (c); endif if (not (isa (x, "infsup"))) x = infsup (x); endif arctangent = atan (c); result = x; ## Resize, if scalar × matrix if (not (size_equal (arctangent.inf, result.inf))) arctangent.inf = ones (size (result.inf)) .* arctangent.inf; arctangent.sup = ones (size (result.inf)) .* arctangent.sup; result.inf = ones (size (arctangent.inf)) .* result.inf; result.sup = ones (size (arctangent.inf)) .* result.sup; endif result.inf(isempty (arctangent)) = inf; result.sup(isempty (arctangent)) = -inf; idx.type = '()'; persistent pi = infsup ("pi"); select = not (isempty (result)) ... & not (subset (infsup (-pi.sup / 2, pi.sup / 2), arctangent)); if (any (select(:))) ## Find a smaller upper bound for x, if the restriction from c allows it u = inf (size (result.inf)); select_u = select & result.sup < inf; ## Find n, such that result.sup is within a distance of pi/2 around n * pi. n = result.sup; n(select_u) = ceil (floor (sup (n(select_u) ./ (pi ./ 2))) ./ 2); arctangentshifted = arctangent; idx.subs = {select_u}; arctangentshifted = subsasgn (arctangentshifted, idx, ... subsref (arctangentshifted, idx) + n(select_u) .* pi); overlapping = not (isempty (intersect (result, arctangentshifted))); u(select_u & overlapping) = ... min (result.sup(select_u & overlapping), ... arctangentshifted.sup(select_u & overlapping)); n(select_u & ~overlapping) = ... mpfr_function_d ('minus', +inf, n(select_u & ~overlapping), 1); idx.subs = {(select_u & ~overlapping)}; u(idx.subs{1}) = ... sup (subsref (arctangent, idx) + subsref (n, idx) .* pi); ## Find a larger lower bound for x, if the restriction from c allows it l = -inf (size (result.inf)); select_l = select & result.inf > -inf; ## Find n, such that result.inf is within a distance of pi/2 around n * pi. n = result.inf; n(select_l) = floor (ceil (inf (n(select_l) ./ (pi ./ 2))) ./ 2); arctangentshifted = arctangent; idx.subs = {select_l}; arctangentshifted = subsasgn (arctangentshifted, idx, ... subsref (arctangentshifted, idx) + n(select_l) .* pi); overlapping = not (isempty (intersect (result, arctangentshifted))); l(select_l & overlapping) = ... max (result.inf (select_l & overlapping), ... arctangentshifted.inf(select_l & overlapping)); n(select_l & ~overlapping) = ... mpfr_function_d ('plus', -inf, n(select_l & ~overlapping), 1); idx.subs = {(select_l & ~overlapping)}; l(idx.subs {1}) = ... inf (subsref (arctangent, idx) + subsref (n, idx) .* pi); result.inf(select) = max (l(select), result.inf(select)); result.sup(select) = min (u(select), result.sup(select)); result.inf(result.inf > result.sup) = inf; result.sup(result.inf > result.sup) = -inf; endif endfunction %!# from the documentation string %!assert (tanrev (infsup (0), infsup (2, 4)) == infsup ("pi")); interval-2.1.0/inst/@infsup/times.m0000644000000000000000000000603013031036767015351 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} times (@var{X}, @var{Y}) ## @defopx Operator {@@infsup} {@var{X} .* @var{Y}} ## ## Multiply all numbers of interval @var{X} by all numbers of @var{Y}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsup (2, 3); ## y = infsup (1, 2); ## x .* y ## @result{} ans = [2, 6] ## @end group ## @end example ## @seealso{@@infsup/rdivide} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function x = times (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsup"))) x = infsup (x); endif if (not (isa (y, "infsup"))) y = infsup (y); elseif (isa (y, "infsupdec")) ## Workaround for bug #42735 result = times (x, y); return endif ## At least one case of interval multiplication is complicated: when zero is an ## inner point of both interval factors. In all other cases it would suffice ## to compute a single product for each product boundary. ## ## It is not significandly faster to do a case by case analysis in order to ## save some calls to the times function with directed rounding. Therefore, we ## simply compute the product for each pair of boundaries where the min/max ## could be located. l = min (min (min (... mpfr_function_d ('times', -inf, x.inf, y.inf), ... mpfr_function_d ('times', -inf, x.inf, y.sup)), ... mpfr_function_d ('times', -inf, x.sup, y.inf)), ... mpfr_function_d ('times', -inf, x.sup, y.sup)); u = max (max (max (... mpfr_function_d ('times', +inf, x.inf, y.inf), ... mpfr_function_d ('times', +inf, x.inf, y.sup)), ... mpfr_function_d ('times', +inf, x.sup, y.inf)), ... mpfr_function_d ('times', +inf, x.sup, y.sup)); ## [0] × anything = [0] × [0] ## [Entire] × anything but [0] = [Entire] × [Entire] ## This prevents the cases where 0 × inf would produce NaNs. entireproduct = isentire (x) | isentire (y); l(entireproduct) = -inf; u(entireproduct) = inf; zeroproduct = (x.inf == 0 & x.sup == 0) | (y.inf == 0 & y.sup == 0); l(zeroproduct) = -0; u(zeroproduct) = +0; emptyresult = isempty (x) | isempty (y); l(emptyresult) = inf; u(emptyresult) = -inf; l(l == 0) = -0; x.inf = l; x.sup = u; endfunction %!# from the documentation string %!assert (infsup (2, 3) .* infsup (1, 2) == infsup (2, 6)); interval-2.1.0/inst/@infsup/transpose.m0000644000000000000000000000301013031036767016241 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} transpose (@var{X}) ## @defopx Operator {@@infsup} {@var{X}.'} ## ## Return the transpose of interval matrix or vector @var{X}. ## ## @example ## @group ## infsup (zeros (1, 3), ones (1, 3)) .' ## @result{} ans = 3×1 interval vector ## [0, 1] ## [0, 1] ## [0, 1] ## @end group ## @end example ## @seealso{@@infsup/ctranspose} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-29 function x = transpose (x) if (nargin ~= 1) print_usage (); return endif x.inf = transpose (x.inf); x.sup = transpose (x.sup); endfunction %!assert (transpose (infsup (magic (3))) == infsup (magic (3).')); %!# from the documentation string %!assert (transpose (infsup (zeros (1, 3), ones (1, 3))) == infsup (zeros (3, 1), ones (3, 1))); interval-2.1.0/inst/@infsup/tril.m0000644000000000000000000000412213031036767015202 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} tril (@var{A}) ## @defmethodx {@@infsup} tril (@var{A}, @var{k}) ## @defmethodx {@@infsup} tril (@var{A}, @var{k}, "pack") ## Return a new matrix formed by extracting the lower triangular part of the ## matrix @var{A}, and setting all other elements to zero. ## ## The second argument is optional, and specifies how many diagonals above or ## below the main diagonal should also be set to zero. ## ## If the option @option{pack} is given as third argument, the extracted ## elements are not inserted into a matrix, but rather stacked column-wise one ## above other. ## ## @seealso{@@infsup/triu, @@infsup/diag} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-08-04 function A = tril (A, varargin) if (nargin >= 2 && isa (varargin{1}, 'infsup')) error ('tril: invalid second argument; it must not be an interval'); endif if (nargin >= 3 && isa (varargin{2}, 'infsup')) error ('tril: invalid third argument; it must not be an interval'); endif A.inf = tril (A.inf, varargin{:}); A.sup = tril (A.sup, varargin{:}); A.inf(A.inf == 0) = -0; endfunction %!assert (tril (infsup (magic (10))) == tril (magic (10))); %!assert (tril (infsup (magic (10)), 1) == tril (magic (10), 1)); %!assert (tril (infsup (magic (10)), -1) == tril (magic (10), -1)); %!assert (tril (infsup (magic (10)), 0, "pack") == tril (magic (10), 0, "pack")); interval-2.1.0/inst/@infsup/triu.m0000644000000000000000000000412213031036767015213 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} triu (@var{A}) ## @defmethodx {@@infsup} triu (@var{A}, @var{k}) ## @defmethodx {@@infsup} triu (@var{A}, @var{k}, "pack") ## Return a new matrix formed by extracting the upper triangular part of the ## matrix @var{A}, and setting all other elements to zero. ## ## The second argument is optional, and specifies how many diagonals above or ## below the main diagonal should also be set to zero. ## ## If the option @option{pack} is given as third argument, the extracted ## elements are not inserted into a matrix, but rather stacked column-wise one ## above other. ## ## @seealso{@@infsup/tril, @@infsup/diag} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-08-04 function A = triu (A, varargin) if (nargin >= 2 && isa (varargin{1}, 'infsup')) error ('triu: invalid second argument; it must not be an interval'); endif if (nargin >= 3 && isa (varargin{2}, 'infsup')) error ('triu: invalid third argument; it must not be an interval'); endif A.inf = triu (A.inf, varargin{:}); A.sup = triu (A.sup, varargin{:}); A.inf(A.inf == 0) = -0; endfunction %!assert (triu (infsup (magic (10))) == triu (magic (10))); %!assert (triu (infsup (magic (10)), 1) == triu (magic (10), 1)); %!assert (triu (infsup (magic (10)), -1) == triu (magic (10), -1)); %!assert (triu (infsup (magic (10)), 0, "pack") == triu (magic (10), 0, "pack")); interval-2.1.0/inst/@infsup/uminus.m0000644000000000000000000000277013031036767015557 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} uminus (@var{X}) ## @defopx Operator {@@infsup} {-@var{X}} ## ## Negate all numbers in the interval. ## ## Accuracy: The result is exact. ## ## @example ## @group ## x = infsup (2, 3); ## -x ## @result{} ans = [-3, -2] ## @end group ## @end example ## @seealso{@@infsup/uplus} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function x = uminus (x) if (nargin ~= 1) print_usage (); return endif ## This also works for empty / entire intervals [x.inf, x.sup] = deal (-x.sup, -x.inf); endfunction %!# from the documentation string %!assert (-infsup (2, 3) == infsup (-3, -2)); %!# correct use of signed zeros %!test %! x = uminus (infsup (0)); %! assert (signbit (inf (x))); %! assert (not (signbit (sup (x)))); interval-2.1.0/inst/@infsup/union.m0000644000000000000000000000422013031036767015357 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} union (@var{A}) ## @defmethodx {@@infsup} union (@var{A}, @var{B}) ## @defmethodx {@@infsup} union (@var{A}, [], @var{DIM}) ## ## Build the interval hull of the union of intervals. ## ## With two arguments the union is built pair-wise. Otherwise the union is ## computed for all interval members along dimension @var{DIM}, which defaults ## to the first non-singleton dimension. ## ## Accuracy: The result is exact. ## ## @example ## @group ## x = infsup (1, 3); ## y = infsup (2, 4); ## union (x, y) ## @result{} ans = [1, 4] ## @end group ## @end example ## @seealso{@@infsup/intersect, @@infsup/setdiff, @@infsup/setxor} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-02 function a = union (a, b, dim) if (not (isa (a, "infsup"))) a = infsup (a); endif switch (nargin) case 1 l = min (a.inf); u = max (a.sup); case 2 if (not (isa (b, "infsup"))) b = infsup (b); endif l = min (a.inf, b.inf); u = max (a.sup, b.sup); case 3 if (not (builtin ("isempty", b))) warning ("union: second argument is ignored"); endif l = min (a.inf, [], dim); u = max (a.sup, [], dim); otherwise print_usage (); return endswitch a.inf = l; a.sup = u; endfunction %!# from the documentation string %!assert (union (infsup (1, 3), infsup (2, 4)) == infsup (1, 4)); interval-2.1.0/inst/@infsup/uplus.m0000644000000000000000000000241313031036767015401 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} uplus (@var{X}) ## @defopx Operator {@@infsup} {+@var{X}} ## ## Return the interval itself. ## ## Accuracy: The result is exact. ## ## @example ## @group ## x = infsup (2, 3); ## + x ## @result{} ans = [2, 3] ## @end group ## @end example ## @seealso{@@infsup/uminus} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-30 function x = uplus (x) if (nargin ~= 1) print_usage (); return endif endfunction %!# from the documentation string %!assert (+infsup (2, 3) == infsup (2, 3)); interval-2.1.0/inst/@infsup/vertcat.m0000644000000000000000000000301113031036767015674 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} vertcat (@var{ARRAY1}, @var{ARRAY2}, @dots{}) ## @defopx Operator {@@infsup} {[@var{ARRAY1}; @var{ARRAY2}; @dots{}]} ## ## Return the vertical concatenation of interval array objects along ## dimension 1. ## ## @example ## @group ## a = infsup (2, 5); ## [a; a; a] ## @result{} ans = 3×1 interval vector ## [2, 5] ## [2, 5] ## [2, 5] ## @end group ## @end example ## @seealso{@@infsup/horzcat} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-29 function result = vertcat (varargin) result = cat (1, varargin{:}); endfunction %!assert (vertcat (infsup (1), infsup (2)) == infsup (vertcat (1, 2))); %!test %! # from the documentation string %! a = infsup (2, 5); %! assert (vertcat (a, a, a) == infsup ([2; 2; 2], [5; 5; 5])); interval-2.1.0/inst/@infsup/wid.m0000644000000000000000000000302713031036767015016 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} wid (@var{X}) ## ## Get the width of interval @var{X}. ## ## If @var{X} is empty, @code{wid (@var{X})} is NaN. ## If @var{X} is unbounded in one or both directions, @code{wid (@var{X})} is ## positive infinity. ## ## Accuracy: The result is a tight enclosure of the interval's actual width. ## ## @example ## @group ## wid (infsup (2.5, 3.5)) ## @result{} ans = 1 ## @end group ## @end example ## @seealso{@@infsup/inf, @@infsup/sup, @@infsup/rad} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-05 function result = wid (x) if (nargin ~= 1) print_usage (); return endif result = mpfr_function_d ('minus', +inf, x.sup, x.inf); result(isempty (x)) = nan (); endfunction %!# from the documentation string %!assert (wid (infsup (2.5, 3.5)), 1); interval-2.1.0/inst/@infsupdec/abs.m0000644000000000000000000000564013031036767015457 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} abs (@var{X}) ## ## Compute the absolute value of numbers. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## abs (infsupdec (2.5, 3.5)) ## @result{} ans = [2.5, 3.5]_com ## abs (infsupdec (-0.5, 5.5)) ## @result{} ans = [0, 5.5]_com ## @end group ## @end example ## @seealso{@@infsupdec/mag, @@infsupdec/mig} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = abs (x) if (nargin ~= 1) print_usage (); return endif result = newdec (abs (x.infsup)); ## abs is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# Empty interval %!assert (isequal (abs (infsupdec ()), infsupdec ())); %!# Singleton intervals %!assert (isequal (abs (infsupdec (1)), infsupdec (1))); %!assert (isequal (abs (infsupdec (0)), infsupdec (0))); %!assert (isequal (abs (infsupdec (-1)), infsupdec (1))); %!assert (isequal (abs (infsupdec (realmax)), infsupdec (realmax))); %!assert (isequal (abs (infsupdec (realmin)), infsupdec (realmin))); %!assert (isequal (abs (infsupdec (-realmin)), infsupdec (realmin))); %!assert (isequal (abs (infsupdec (-realmax)), infsupdec (realmax))); %!# Bounded intervals %!assert (isequal (abs (infsupdec (1, 2)), infsupdec (1, 2))); %!assert (isequal (abs (infsupdec (0, 1)), infsupdec (0, 1))); %!assert (isequal (abs (infsupdec (-1, 1)), infsupdec (0, 1))); %!assert (isequal (abs (infsupdec (-1, 0)), infsupdec (0, 1))); %!assert (isequal (abs (infsupdec (-2, -1)), infsupdec (1, 2))); %!# Unbounded intervals %!assert (isequal (abs (infsupdec (0, inf)), infsupdec (0, inf))); %!assert (isequal (abs (infsupdec (-inf, inf)), infsupdec (0, inf))); %!assert (isequal (abs (infsupdec (-inf, 0)), infsupdec (0, inf))); %!assert (isequal (abs (infsupdec (1, inf)), infsupdec (1, inf))); %!assert (isequal (abs (infsupdec (-1, inf)), infsupdec (0, inf))); %!assert (isequal (abs (infsupdec (-inf, -1)), infsupdec (1, inf))); %!assert (isequal (abs (infsupdec (-inf, 1)), infsupdec (0, inf))); %!# from the documentation string %!assert (isequal (abs (infsupdec (2.5, 3.5)), infsupdec (2.5, 3.5))); %!assert (isequal (abs (infsupdec (-0.5, 5.5)), infsupdec (0, 5.5))); interval-2.1.0/inst/@infsupdec/absrev.m0000644000000000000000000000752213031036767016175 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{X} =} absrev (@var{C}, @var{X}) ## @deftypemethodx {@@infsupdec} {@var{X} =} absrev (@var{C}) ## ## Compute the reverse absolute value function. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{abs (x) ∈ @var{C}}. ## ## Accuracy: The result is a tight enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## No one way of decorating this operations gives useful information in all ## contexts. Therefore, the result will carry a @code{trv} decoration at best. ## ## @example ## @group ## absrev (infsupdec (-2, 1)) ## @result{} ans = [-1, +1]_trv ## @end group ## @end example ## @seealso{@@infsupdec/abs} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = absrev (c, x) if (nargin > 2) print_usage (); return endif if (nargin < 2) x = infsupdec (-inf, inf); endif if (not (isa (c, "infsupdec"))) c = infsupdec (c); endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif result = infsupdec (absrev (c.infsup, x.infsup), "trv"); result.dec(isnai (c) | isnai (x)) = _ill (); endfunction %!# Empty interval %!assert (isequal (absrev (infsupdec ()), infsupdec ())); %!assert (isequal (absrev (infsupdec (0, 1), infsupdec ()), infsupdec ())); %!assert (isequal (absrev (infsupdec (0, 1), infsupdec (7, 9)), infsupdec ())); %!assert (isequal (absrev (infsupdec (), infsupdec (0, 1)), infsupdec ())); %!assert (isequal (absrev (infsupdec (-2, -1)), infsupdec ())); %!# Singleton intervals %!assert (isequal (absrev (infsupdec (1)), infsupdec (-1, 1, "trv"))); %!assert (isequal (absrev (infsupdec (0)), infsupdec (0, "trv"))); %!assert (isequal (absrev (infsupdec (-1)), infsupdec ())); %!assert (isequal (absrev (infsupdec (realmax)), infsupdec (-realmax, realmax, "trv"))); %!assert (isequal (absrev (infsupdec (realmin)), infsupdec (-realmin, realmin, "trv"))); %!assert (isequal (absrev (infsupdec (-realmin)), infsupdec ())); %!assert (isequal (absrev (infsupdec (-realmax)), infsupdec ())); %!# Bound intervals %!assert (isequal (absrev (infsupdec (1, 2)), infsupdec (-2, 2, "trv"))); %!assert (isequal (absrev (infsupdec (1, 2), infsupdec (0, 2)), infsupdec (1, 2, "trv"))); %!assert (isequal (absrev (infsupdec (0, 1), infsupdec (-0.5, 2)), infsupdec (-0.5, 1, "trv"))); %!assert (isequal (absrev (infsupdec (-1, 1)), infsupdec (-1, 1, "trv"))); %!assert (isequal (absrev (infsupdec (-1, 0)), infsupdec (0, "trv"))); %!# Unbound intervals %!assert (isequal (absrev (infsupdec (0, inf)), infsupdec (-inf, inf, "trv"))); %!assert (isequal (absrev (infsupdec (-inf, inf)), infsupdec (-inf, inf, "trv"))); %!assert (isequal (absrev (infsupdec (-inf, 0)), infsupdec (0, "trv"))); %!assert (isequal (absrev (infsupdec (1, inf), infsupdec (-inf, 0)), infsupdec (-inf, -1, "trv"))); %!assert (isequal (absrev (infsupdec (-1, inf)), infsupdec (-inf, inf, "trv"))); %!assert (isequal (absrev (infsupdec (-inf, -1)), infsupdec ())); %!assert (isequal (absrev (infsupdec (-inf, 1)), infsupdec (-1, 1, "trv"))); %!# from the documentation string %!assert (isequal (absrev (infsupdec (-2, 1)), infsupdec (-1, 1, "trv"))); interval-2.1.0/inst/@infsupdec/acos.m0000644000000000000000000000306313031036767015634 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} acos (@var{X}) ## ## Compute the inverse cosine in radians (arccosine). ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## acos (infsupdec (.5)) ## @result{} ans ⊂ [1.0471, 1.0472]_com ## @end group ## @end example ## @seealso{@@infsupdec/cos} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = acos (x) if (nargin ~= 1) print_usage (); return endif result = newdec (acos (x.infsup)); ## acos is continuous everywhere, but defined for [-1, 1] only persistent domain = infsup (-1, 1); result.dec(not (subset (x.infsup, domain))) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (acos (infsupdec (.5)), infsupdec ("[0x1.0C152382D7365, 0x1.0C152382D7366]"))); interval-2.1.0/inst/@infsupdec/acosh.m0000644000000000000000000000305513031036767016005 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} acosh (@var{X}) ## ## Compute the inverse hyperbolic cosine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## acosh (infsupdec (2)) ## @result{} ans ⊂ [1.3169, 1.317]_com ## @end group ## @end example ## @seealso{@@infsupdec/cosh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = acosh (x) if (nargin ~= 1) print_usage (); return endif result = newdec (acosh (x.infsup)); ## acosh is continuous everywhere, but defined for [1, Inf] only persistent domain = infsup (1, inf); result.dec(not (subset (x.infsup, domain))) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (acosh (infsupdec (2)), infsupdec ("[0x1.5124271980434, 0x1.5124271980435]"))); interval-2.1.0/inst/@infsupdec/asin.m0000644000000000000000000000306613031036767015644 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} asin (@var{X}) ## ## Compute the inverse sine in radians (arcsine). ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## asin (infsupdec (.5)) ## @result{} ans ⊂ [0.52359, 0.5236]_com ## @end group ## @end example ## @seealso{@@infsupdec/sin} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = asin (x) if (nargin ~= 1) print_usage (); return endif result = newdec (asin (x.infsup)); ## asin is continuous everywhere, but defined for [-1, 1] only persistent domain = infsup (-1, 1); result.dec(not (subset (x.infsup, domain))) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (asin (infsupdec (.5)), infsupdec ("[0x1.0C152382D7365p-1, 0x1.0C152382D7366p-1]"))); interval-2.1.0/inst/@infsupdec/asinh.m0000644000000000000000000000270313031036767016011 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} asinh (@var{X}) ## ## Compute the inverse hyperbolic sine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## asinh (infsupdec (1)) ## @result{} ans ⊂ [0.88137, 0.88138]_com ## @end group ## @end example ## @seealso{@@infsupdec/sinh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = asinh (x) if (nargin ~= 1) print_usage (); return endif result = newdec (asinh (x.infsup)); ## asinh is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (asinh (infsupdec (1)), infsupdec ("[0x1.C34366179D426p-1, 0x1.C34366179D427p-1]"))); interval-2.1.0/inst/@infsupdec/atan.m0000644000000000000000000000272113031036767015632 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} atan (@var{X}) ## ## Compute the inverse tangent in radians. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## atan (infsupdec (1)) ## @result{} ans ⊂ [0.78539, 0.7854]_com ## @end group ## @end example ## @seealso{@@infsupdec/tan, @@infsupdec/atan2} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = atan (x) if (nargin ~= 1) print_usage (); return endif result = newdec (atan (x.infsup)); ## atan is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (atan (infsupdec (1)), infsupdec ("[0x1.921FB54442D18p-1, 0x1.921FB54442D19p-1]"))); interval-2.1.0/inst/@infsupdec/atan2.m0000644000000000000000000000413513031036767015715 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} atan2 (@var{Y}, @var{X}) ## ## Compute the inverse tangent with two arguments. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## atan2 (infsupdec (1), infsupdec (-1)) ## @result{} ans ⊂ [2.3561, 2.3562]_com ## @end group ## @end example ## @seealso{@@infsupdec/tan} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = atan2 (y, x) if (nargin ~= 2) print_usage (); return endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif result = newdec (atan2 (y.infsup, x.infsup)); ## The function is discontinuous for x <= 0 and y == 0 discontinuos = inf (y) < 0 & sup (y) >= 0 & inf (x) < 0; result.dec(discontinuos) = min (result.dec(discontinuos), _def ()); ## For y = [0, y.sup] the function is discontinuous, but its restriction is not onlyrestrictioncontinuous = inf (y) == 0 & inf (x) < 0; result.dec(onlyrestrictioncontinuous) = ... min (result.dec(onlyrestrictioncontinuous), _dac ()); ## The only undefined input is <0,0> result.dec(ismember (0, y) & ismember (0, x)) = _trv (); result.dec = min (result.dec, min (y.dec, x.dec)); endfunction %!# from the documentation string %!assert (isequal (atan2 (infsupdec (1), infsupdec (-1)), infsupdec ("[0x1.2D97C7F3321D2p1, 0x1.2D97C7F3321D3p1]"))); interval-2.1.0/inst/@infsupdec/atan2rev1.m0000644000000000000000000000442213031036767016512 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{Y} =} atan2rev1 (@var{B}, @var{C}, @var{Y}) ## @deftypemethodx {@@infsupdec} {@var{Y} =} atan2rev1 (@var{B}, @var{C}) ## ## Compute the reverse atan2 function for the first parameter. ## ## That is, an enclosure of all @code{y ∈ @var{Y}} where ## @code{atan2 (y, b) ∈ @var{C}} for any @code{b ∈ @var{B}}. ## ## Accuracy: The result is a valid enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## No one way of decorating this operations gives useful information in all ## contexts. Therefore, the result will carry a @code{trv} decoration at best. ## ## @example ## @group ## atan2rev1 (infsupdec (1, 2), infsupdec ("pi") / 4) ## @result{} ans ⊂ [0.99999, 2.0001]_trv ## @end group ## @end example ## @seealso{@@infsupdec/atan2} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = atan2rev1 (b, c, y) if (nargin < 2 || nargin > 3) print_usage (); return endif if (nargin < 3) y = infsupdec (-inf, inf); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif if (not (isa (c, "infsupdec"))) c = infsupdec (c); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif ## inverse atan2 is not a point function result = infsupdec (atan2rev1 (b.infsup, c.infsup, y.infsup), "trv"); result.dec(isnai (y) | isnai (b) | isnai (c)) = _ill (); endfunction %!# from the documentation string %!assert (isequal (atan2rev1 (infsupdec (1, 2), infsupdec ("pi") / 4), infsupdec ("[0x1.FFFFFFFFFFFFFp-1, 0x1.0000000000001p1]_trv"))); interval-2.1.0/inst/@infsupdec/atan2rev2.m0000644000000000000000000000442313031036767016514 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{X} =} atan2rev2 (@var{A}, @var{C}, @var{X}) ## @deftypemethodx {@@infsupdec} {@var{X} =} atan2rev2 (@var{A}, @var{C}) ## ## Compute the reverse atan2 function for the second parameter. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{atan2 (a, x) ∈ @var{C}} for any @code{a ∈ @var{A}}. ## ## Accuracy: The result is a valid enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## No one way of decorating this operations gives useful information in all ## contexts. Therefore, the result will carry a @code{trv} decoration at best. ## ## @example ## @group ## atan2rev2 (infsupdec (1, 2), infsupdec ("pi") / 4) ## @result{} ans ⊂ [0.99999, 2.0001]_trv ## @end group ## @end example ## @seealso{@@infsupdec/atan2} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = atan2rev2 (a, c, x) if (nargin < 2 || nargin > 3) print_usage (); return endif if (nargin < 3) x = infsupdec (-inf, inf); endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (c, "infsupdec"))) c = infsupdec (c); endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif ## inverse atan2 is not a point function result = infsupdec (atan2rev2 (a.infsup, c.infsup, x.infsup), "trv"); result.dec(isnai (x) | isnai (a) | isnai (c)) = _ill (); endfunction %!# from the documentation string %!assert (isequal (atan2rev2 (infsupdec (1, 2), infsupdec ("pi") / 4), infsupdec ("[0x1.FFFFFFFFFFFFEp-1, 0x1.0000000000001p1]_trv"))); interval-2.1.0/inst/@infsupdec/atanh.m0000644000000000000000000000310213031036767015774 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} atanh (@var{X}) ## ## Compute the inverse hyperbolic tangent. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## atanh (infsupdec (.5)) ## @result{} ans ⊂ [0.5493, 0.54931]_com ## @end group ## @end example ## @seealso{@@infsupdec/tanh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = atanh (x) if (nargin ~= 1) print_usage (); return endif result = newdec (atanh (x.infsup)); ## atanh is continuous everywhere, but defined for ]-1, 1[ only persistent domain_hull = infsup (-1, 1); result.dec(not (interior (x.infsup, domain_hull))) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (atanh (infsupdec (.5)), infsupdec ("[0x1.193EA7AAD030Ap-1, 0x1.193EA7AAD030Bp-1]"))); interval-2.1.0/inst/@infsupdec/bisect.m0000644000000000000000000000443613031036767016165 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {[@var{A}, @var{B}] =} bisect (@var{X}) ## ## Bisect an interval into two intervals, which contain half the amount of ## binary64 numbers each. ## ## Instead of bisecting the values of numbers in the interval at ## @code{mid (@var{X})}, this function bisects a function that counts them. In ## a bisect method this eliminates exactly half of the solutions and avoids ## slow convergence speeds in extreme cases. ## ## If all numbers in interval @var{X} are of equal sign, the pivot element used ## for bisection is @code{pow2 (mid (log2 (abs (@var{X}))))}. If @var{X} is no ## empty interval, the intervals @var{A} and @var{B} are non-empty and satisfy ## @code{@var{A}.sup == @var{B}.inf}. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## The function is a set operation and the result carries the @code{trv} ## decoration at best. ## ## @example ## @group ## [a, b] = bisect (infsupdec (2, 32)) ## @result{} ## a = [2, 8]_trv ## b = [8, 32]_trv ## @end group ## @end example ## @seealso{@@infsupdec/nextout} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-05-25 function [a, b] = bisect (x) if (nargin > 1) print_usage (); return endif ## bisect must not retain any useful decoration [a, b] = bisect (x.infsup); a = infsupdec (a, "trv"); b = infsupdec (b, "trv"); a.dec(isnai (x)) = b.dec(isnai (x)) = _ill (); endfunction %!# from the documentation string %!test %! [a, b] = bisect (infsupdec (2, 32)); %! assert (a == infsupdec (2, 8, "trv")); %! assert (b == infsupdec (8, 32, "trv")); interval-2.1.0/inst/@infsupdec/bitunpack.m0000644000000000000000000000516113031036767016670 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} bitunpack (@var{X}) ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## ## Encode decorated interval @var{X} in interchange format. ## ## The result is a raw bit pattern of length 136 that derive from two binary64 ## numbers plus 8 bit for the decoration. Bits are in increasing order. ## Byte order depends on the system's endianness. First 8 bytes come from the ## lower interval boundary, next 8 bytes come from the upper interval boundary, ## last byte comes from the decoration. ## ## The result is a row vector if @var{X} is a row vector; otherwise, it is a ## column vector. ## ## For all scalar intervals the following equation holds: ## @code{@var{X} == interval_bitpack (bitunpack (@var{X}))}. ## ## @seealso{interval_bitpack} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-12-23 function result = bitunpack (x) if (nargin ~= 1) print_usage (); return endif bare = bitunpack (x.infsup); d = bitunpack (x.dec); ## The exchange representation of [NaI] is (NaN, NaN, ill). if (any (isnai (x)(:))) bare(vec (1:128) + 128 .* vec (find (isnai (x)) - 1, 2)) = ... [bitunpack(nan (sum (isnai (x)), 2))]; endif ## Initialize result vector result = zeros (1, length (bare) + length (d), 'logical'); if (not (isrow (bare))) result = result'; endif ## Merge alternating 128 bit blocks from bare and 8 bit blocks from d together ## into result. target_bare = reshape (1 : length (result), 8, length (result) / 8); target_d = target_bare (:, 17 : 17 : size (target_bare, 2)); target_bare(:, 17 : 17 : size (target_bare, 2)) = []; result(target_bare) = bare; result(target_d) = d; endfunction %!test %! littleendian = bitunpack (uint16 (1))(1); %! b = zeros (1, 136); %! if (littleendian) %! b([52, 63, 117, 127, 133]) = 1; %! else %! b([7, 12, 71, 77, 133]) = 1; %! endif %! assert (bitunpack (infsupdec (3, 4)), logical (b)); interval-2.1.0/inst/@infsupdec/cancelminus.m0000644000000000000000000000367013031036767017214 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{Z} =} cancelminus (@var{X}, @var{Y}) ## ## Recover interval @var{Z} from intervals @var{X} and @var{Y}, given that one ## knows @var{X} was obtained as the sum @var{Y} + @var{Z}. ## ## Accuracy: The result is a tight enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## No one way of decorating this operations gives useful information in all ## contexts. Therefore, the result will carry a @code{trv} decoration at best. ## ## @example ## @group ## cancelminus (infsupdec (2, 3), infsupdec (1, 1.5)) ## @result{} ans = [1, 1.5]_trv ## @end group ## @end example ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = cancelminus (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif ## cancelMinus must not retain any useful decoration result = infsupdec (cancelminus (x.infsup, y.infsup), "trv"); result.dec(isnai (x) | isnai (y)) = _ill (); endfunction %!# from the documentation string %!assert (isequal (cancelminus (infsupdec (2, 3), infsupdec (1, 1.5)), infsupdec (1, 1.5, "trv"))); interval-2.1.0/inst/@infsupdec/cat.m0000644000000000000000000000543213031036767015460 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} cat (@var{DIM}, @var{MATRIX1}, @var{MATRIX2}, @dots{}) ## ## Return the concatenation of interval matrices @var{MATRIX1}, @var{MATRIX2}, ## … along dimension @var{DIM}. ## ## Interval matrices support no more than 2 dimensions. ## ## @example ## @group ## cat (2, infsupdec (magic (3)), infsupdec (pascal (3))) ## @result{} 3×6 interval matrix ## ## [8]_com [1]_com [6]_com [1]_com [1]_com [1]_com ## [3]_com [5]_com [7]_com [1]_com [2]_com [3]_com ## [4]_com [9]_com [2]_com [1]_com [3]_com [6]_com ## @end group ## @end example ## @seealso{@@infsup/horzcat, @@infsup/vertcat} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-10-09 function result = cat (dim, varargin) if (isa (dim, "infsup")) print_usage (); return endif if (dim > 2) error ("interval:InvalidOperand", ... "cat: no more than 2 dimensions are supported"); endif ## Conversion of non-interval and undecorated parameters to decorated intervals decorated_interval_idx = cellfun ("isclass", varargin, "infsupdec"); to_convert_idx = not (decorated_interval_idx); varargin(to_convert_idx) = cellfun (@infsupdec, ... varargin(to_convert_idx), ... "UniformOutput", false); ## Stack intervals along dimension dim s = cellfun ("struct", varargin); # struct array result = infsupdec (); result.infsup = cat (dim, s.infsup); result.dec = cat (dim, s.dec); endfunction %!assert (size (cat (1, infsupdec ([]), infsupdec ([]))), [0 0]); %!assert (isequal (cat (1, infsupdec (1), infsupdec (2)), infsupdec (cat (1, 1, 2)))); %!assert (isequal (cat (2, infsupdec (1), infsupdec (2)), infsupdec (cat (2, 1, 2)))); %!assert (isequal (horzcat (infsupdec (1), infsupdec (2)), infsupdec (horzcat (1, 2)))); %!test %! a = infsupdec (2, 5); %! assert (isequal (horzcat (a, a, a), infsupdec ([2, 2, 2], [5, 5, 5]))); %!assert (isequal (vertcat (infsupdec (1), infsupdec (2)), infsupdec (vertcat (1, 2)))); %!test %! a = infsupdec (2, 5); %! assert (isequal (vertcat (a, a, a), infsupdec ([2; 2; 2], [5; 5; 5]))); interval-2.1.0/inst/@infsupdec/cbrt.m0000644000000000000000000000256213031036767015644 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} cbrt (@var{X}) ## ## Compute the cube root. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## cbrt (infsupdec (-27, 27)) ## @result{} ans = [-3, +3]_com ## @end group ## @end example ## @seealso{@@infsupdec/realsqrt, @@infsupdec/nthroot} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function result = cbrt (x) if (nargin ~= 1) print_usage (); return endif result = newdec (cbrt (x.infsup)); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (cbrt (infsupdec (-27, 27)), infsupdec (-3, 3))); interval-2.1.0/inst/@infsupdec/ceil.m0000644000000000000000000000365313031036767015630 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} ceil (@var{X}) ## ## Round each number in interval @var{X} towards +Inf. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## ceil (infsupdec (2.5, 3.5)) ## @result{} ans = [3, 4]_def ## ceil (infsupdec (-0.5, 5)) ## @result{} ans = [0, 5]_def ## @end group ## @end example ## @seealso{@@infsupdec/floor, @@infsupdec/round, @@infsupdec/roundb, @@infsupdec/fix} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = ceil (x) if (nargin ~= 1) print_usage (); return endif result = newdec (ceil (x.infsup)); ## Between two integral numbers the function is constant, thus continuous discontinuos = not (issingleton (result)); result.dec(discontinuos) = min (result.dec(discontinuos), _def ()); onlyrestrictioncontinuous = issingleton (result) & fix (sup (x)) == sup (x); result.dec(onlyrestrictioncontinuous) = ... min (result.dec(onlyrestrictioncontinuous), _dac ()); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (ceil (infsupdec (2.5, 3.5)), infsupdec (3, 4, "def"))); %!assert (isequal (ceil (infsupdec (-.5, 5)), infsupdec (0, 5, "def"))); interval-2.1.0/inst/@infsupdec/cos.m0000644000000000000000000000272313031036767015475 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} cos (@var{X}) ## ## Compute the cosine in radians. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## cos (infsupdec (1)) ## @result{} ans ⊂ [0.5403, 0.54031]_com ## @end group ## @end example ## @seealso{@@infsupdec/acos, @@infsupdec/sec, @@infsupdec/cosh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = cos (x) if (nargin ~= 1) print_usage (); return endif result = newdec (cos (x.infsup)); ## cos is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (cos (infsupdec (1)), infsupdec ("[0x1.14A280FB5068Bp-1, 0x1.14A280FB5068Cp-1]"))); interval-2.1.0/inst/@infsupdec/cosh.m0000644000000000000000000000274413031036767015650 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} cosh (@var{X}) ## ## Compute the hyperbolic cosine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## cosh (infsupdec (1)) ## @result{} ans ⊂ [1.543, 1.5431]_com ## @end group ## @end example ## @seealso{@@infsupdec/acosh, @@infsupdec/sech, @@infsupdec/sinh, @@infsupdec/tanh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = cosh (x) if (nargin ~= 1) print_usage (); return endif result = newdec (cosh (x.infsup)); ## cosh is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (cosh (infsupdec (1)), infsupdec ("[0x1.8B07551D9F55, 0x1.8B07551D9F551]"))); interval-2.1.0/inst/@infsupdec/coshrev.m0000644000000000000000000000372513031036767016365 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{X} =} coshrev (@var{C}, @var{X}) ## @deftypemethodx {@@infsupdec} {@var{X} =} coshrev (@var{C}) ## ## Compute the reverse hyperbolic cosine function. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{cosh (x) ∈ @var{C}}. ## ## Accuracy: The result is a tight enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## No one way of decorating this operations gives useful information in all ## contexts. Therefore, the result will carry a @code{trv} decoration at best. ## ## @example ## @group ## coshrev (infsupdec (-2, 1)) ## @result{} ans = [0]_trv ## @end group ## @end example ## @seealso{@@infsupdec/cosh} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = coshrev (c, x) if (nargin > 2) print_usage (); return endif if (nargin < 2) x = infsupdec (-inf, inf); endif if (not (isa (c, "infsupdec"))) c = infsupdec (c); endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif result = infsupdec (coshrev (c.infsup, x.infsup), "trv"); result.dec(isnai (c) | isnai (x)) = _ill (); endfunction %!# from the documentation string %!assert (isequal (coshrev (infsupdec (-2, 1)), infsupdec (0, "trv"))); interval-2.1.0/inst/@infsupdec/cosrev.m0000644000000000000000000000401013031036767016201 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{X} =} cosrev (@var{C}, @var{X}) ## @deftypemethodx {@@infsupdec} {@var{X} =} cosrev (@var{C}) ## ## Compute the reverse cosine function. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{cos (x) ∈ @var{C}}. ## ## Accuracy: The result is a valid enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## No one way of decorating this operations gives useful information in all ## contexts. Therefore, the result will carry a @code{trv} decoration at best. ## ## @example ## @group ## cosrev (infsupdec (0), infsupdec (6, 9)) ## @result{} ans ⊂ [7.8539, 7.854]_trv ## @end group ## @end example ## @seealso{@@infsupdec/cos} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = cosrev (c, x) if (nargin > 2) print_usage (); return endif if (nargin < 2) x = infsupdec (-inf, inf); endif if (not (isa (c, "infsupdec"))) c = infsupdec (c); endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif result = infsupdec (cosrev (c.infsup, x.infsup), "trv"); result.dec(isnai (c) | isnai (x)) = _ill (); endfunction %!# from the documentation string %!assert (isequal (cosrev (0, infsupdec (6, 9)), infsupdec ("[0x1.F6A7A2955385Ep2, 0x1.F6A7A2955386p2]_trv"))); interval-2.1.0/inst/@infsupdec/cot.m0000644000000000000000000000326313031036767015476 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} cot (@var{X}) ## ## Compute the cotangent in radians, that is the reciprocal tangent. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## cot (infsupdec (1)) ## @result{} ans ⊂ [0.64209, 0.6421]_com ## @end group ## @end example ## @seealso{@@infsupdec/tan, @@infsupdec/csc, @@infsupdec/sec} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function result = cot (x) if (nargin ~= 1) print_usage (); return endif result = newdec (cot (x.infsup)); ## Because tan (nextdown (pi)) < realmax, we can simple check for ## a singularity by comparing the result with entire for x ~= 0. domain = not (isentire (result)) | (inf (x) <= 0 & sup (x) >= 0); result.dec(not (domain)) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (cot (infsupdec (1)), infsupdec ("[0x1.48C05D04E1CFDp-1, 0x1.48C05D04E1CFEp-1]"))); interval-2.1.0/inst/@infsupdec/coth.m0000644000000000000000000000307113031036767015643 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} coth (@var{X}) ## ## Compute the hyperbolic cotangent, that is the reciprocal hyperbolic tangent. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## coth (infsupdec (1)) ## @result{} ans ⊂ [1.313, 1.3131]_com ## @end group ## @end example ## @seealso{@@infsupdec/tanh, @@infsupdec/csch, @@infsupdec/sech} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function result = coth (x) if (nargin ~= 1) print_usage (); return endif result = newdec (coth (x.infsup)); ## coth is defined and continuous for x ~= 0 result.dec (inf (x) <= 0 & sup (x) >= 0) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (coth (infsupdec (1)), infsupdec ("[0x1.50231499B6B1D, 0x1.50231499B6B1E]_com"))); interval-2.1.0/inst/@infsupdec/csc.m0000644000000000000000000000325413031036767015461 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} csc (@var{X}) ## ## Compute the cosecant in radians, that is the reciprocal sine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## csc (infsupdec (1)) ## @result{} ans ⊂ [1.1883, 1.1884]_com ## @end group ## @end example ## @seealso{@@infsupdec/sin, @@infsupdec/sec, @@infsupdec/cot} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function result = csc (x) if (nargin ~= 1) print_usage (); return endif result = newdec (csc (x.infsup)); ## Because csc (nextdown (pi)) < realmax, we can simple check for ## a singularity by comparing the result with entire for x ~= 0. domain = not (isentire (result)) | (inf (x) <= 0 & sup (x) >= 0); result.dec(not (domain)) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (csc (infsupdec (1)), infsupdec ("[0x1.303AA9620B223, 0x1.303AA9620B224]_com"))); interval-2.1.0/inst/@infsupdec/csch.m0000644000000000000000000000315613031036767015632 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} csch (@var{X}) ## ## Compute the hyperbolic cosecant, that is the reciprocal hyperbolic sine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## csch (infsupdec (1)) ## @result{} ans ⊂ [0.85091, 0.85092]_com ## @end group ## @end example ## @seealso{@@infsupdec/sinh, @@infsupdec/sech, @@infsupdec/coth} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function result = csch (x) if (nargin ~= 1) print_usage (); return endif if (isnai (x)) result = x; return endif result = newdec (csch (x.infsup)); ## csch is defined and continuous for x ~= 0 result.dec (inf (x) <= 0 & sup (x) >= 0) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (csch (infsupdec (1)), infsupdec ("[0x1.B3AB8A78B90Cp-1, 0x1.B3AB8A78B90C1p-1]_com"))); interval-2.1.0/inst/@infsupdec/decorationpart.m0000644000000000000000000000537713031036767017737 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} decorationpart (@var{X}) ## @defmethodx {@@infsupdec} decorationpart (@var{X}, @var{TYPE}) ## ## Return the decoration of the decorated interval @var{X}. ## ## The returned value depends on the requested @var{TYPE}. ## @table @asis ## @item @option{char} (default) ## The decoration is a cell array of character strings and its size equals the ## size of its interval part. Possible values: @option{ill}, @option{trv}, ## @option{def}, @option{dac}, @option{com}. ## @item @option{uint8} ## The decoration is a matrix of uint8 numbers and its size equals the size of ## its interval part. Possible values: @option{0}, @option{4}, @option{8}, ## @option{12}, @option{16} as defined by IEEE Std 1788-2015, 14.4 Interchange ## representations and encodings. ## @end table ## ## @example ## @group ## x = infsupdec ("[0, 1] [1, inf] [-1, 1]_def [empty]"); ## decorationpart (x) ## @result{} ans = ## @{ ## [1,1] = com ## [1,2] = dac ## [1,3] = def ## [1,4] = trv ## @} ## decorationpart (x, "uint8") ## @result{} ans = ## ## 16 12 8 4 ## ## @end group ## @end example ## @seealso{@@infsupdec/intervalpart} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-12 function dec = decorationpart (x, type) if (nargin > 2) print_usage (); return endif if (nargin < 2) type = "char"; endif switch (type) case "char" # see below case "uint8" dec = x.dec; return otherwise error ("decorationpart: illegal value for parameter TYPE") endswitch persistent dec_translation = {... # 0 = ill "ill", [], [], [], ... # 4 = trv "trv", [], [], [], ... # 8 = def "def", [], [], [], ... # 12 = dac "dac", [], [], [], ... # 16 = com "com"}; dec = cell (size (x.dec)); dec(:) = dec_translation(x.dec(:) + 1); endfunction %!assert (decorationpart (infsupdec (3, 4)), {"com"}); %!assert (decorationpart (infsupdec (3, inf)), {"dac"}); %!assert (decorationpart (infsupdec ()), {"trv"}); interval-2.1.0/inst/@infsupdec/det.m0000644000000000000000000000275313031036767015470 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} det (@var{A}) ## ## Compute the determinant of matrix @var{A}. ## ## The determinant for matrices of size 3×3 or greater is computed via L-U ## decomposition and may be affected by overestimation due to the dependency ## problem. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## det (infsupdec (magic (3))) ## @result{} ans = [-360]_com ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-10-24 function result = det (x) if (nargin ~= 1) print_usage (); return endif result = newdec (det (x.infsup)); result.dec = min (result.dec, min (min (x.dec))); endfunction %!# from the documentation string %!assert (det (infsupdec (magic (3))) == -360); interval-2.1.0/inst/@infsupdec/diag.m0000644000000000000000000000456513031036767015623 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {M =} diag (@var{V}) ## @deftypemethodx {@@infsupdec} {V =} diag (@var{M}) ## @deftypemethodx {@@infsupdec} {M =} diag (@var{V}, @var{K}) ## @deftypemethodx {@@infsupdec} {M =} diag (@var{V}, @var{M}, @var{N}) ## @deftypemethodx {@@infsupdec} {V =} diag (@var{M}, @var{K}) ## ## Create a diagonal matrix @var{M} with vector @var{V} on diagonal @var{K} or ## extract a vector @var{V} from the @var{K}-th diagonal of matrix @var{M}. ## ## With three arguments, create a matrix of size @var{M}×@var{N}. ## ## @example ## @group ## diag (infsupdec (1 : 3)) ## @result{} ans = 3×3 interval matrix ## ## [1]_com [0]_com [0]_com ## [0]_com [2]_com [0]_com ## [0]_com [0]_com [3]_com ## @end group ## @end example ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-10-24 function x = diag (x, varargin) if (nargin > 3) print_usage (); return endif if ((nargin >= 2 && isa (varargin{1}, 'infsup')) || ... (nargin >= 3 && isa (varargin{2}, 'infsup'))) error ('diag: invalid argument; only the first may be an interval'); endif x.dec(x.dec == 0) = uint8 (255); x.infsup = diag (x.infsup, varargin{:}); x.dec = diag (x.dec, varargin{:}); x.dec(x.dec == uint8 (0)) = _com (); # any new elements are [0]_com x.dec(x.dec == uint8 (255)) = uint8 (0); endfunction %!assert (diag (infsupdec (-inf, inf)) == "[Entire]"); %!assert (diag (infsupdec ()) == "[Empty]"); %!assert (numel (diag (infsupdec ([]))), 0); %!assert (isequal (diag (infsupdec (magic (3))), infsupdec ([8; 5; 2]))); %!assert (isequal (diag (infsupdec ([8 5 3])), infsupdec ([8 0 0; 0 5 0; 0 0 3]))); interval-2.1.0/inst/@infsupdec/dilog.m0000644000000000000000000000353413031036767016010 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} dilog (@var{X}) ## ## Compute the real part of the dilogarithm function. ## ## @tex ## $$ ## {\rm dilog} (x) = -\Re \int_0^x {{\log (1-t)} \over t} dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## x ## / log (1 - t) ## dilog (x) = - Re | ------------- dt ## / t ## 0 ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## dilog (infsupdec (1)) ## @result{} ans ⊂ [1.6449, 1.645]_com ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-29 function result = dilog (x) if (nargin ~= 1) print_usage (); return endif result = newdec (dilog (x.infsup)); ## dilog is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!assert (isequal (dilog (infsupdec (-inf, inf)), infsupdec ("[-Inf, +0x1.3BD3CC9BE45DFp1]_dac"))); %!# from the documentation string %!assert (isequal (dilog (infsupdec (1)), infsupdec ("[0x1.A51A6625307D3, 0x1.A51A6625307D4]_com"))); interval-2.1.0/inst/@infsupdec/disjoint.m0000644000000000000000000000320613031036767016531 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} disjoint (@var{A}, @var{B}) ## ## Evaluate disjoint comparison on intervals. ## ## True, if all numbers from @var{A} are not contained in @var{B} and vice ## versa. False, if @var{A} and @var{B} have at least one element in common. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsupdec/eq, @@infsupdec/subset, @@infsupdec/interior} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = disjoint (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif result = disjoint (a.infsup, b.infsup); result(isnai (a) | isnai (b)) = false (); endfunction %!assert (disjoint (infsupdec (3, 4), infsupdec (5, 6))); %!assert (not (disjoint (infsupdec (3, 4), infsupdec (4, 5)))); interval-2.1.0/inst/@infsupdec/dot.m0000644000000000000000000000623313031036767015477 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} dot (@var{X}, @var{Y}) ## @defmethodx {@@infsupdec} dot (@var{X}, @var{Y}, @var{DIM}) ## ## Compute the dot product of two interval vectors. ## ## If @var{X} and @var{Y} are matrices, calculate the dot products along the ## first non-singleton dimension. If the optional argument @var{DIM} is given, ## calculate the dot products along this dimension. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## dot ([infsupdec(1), 2, 3], [infsupdec(2), 3, 4]) ## @result{} ans = [20]_com ## @end group ## @group ## dot (infsupdec ([realmax; realmin; realmax]), [1; -1; -1], 1) ## @result{} ans ⊂ [-2.2251e-308, -2.225e-308]_com ## @end group ## @end example ## @seealso{@@infsupdec/plus, @@infsupdec/sum, @@infsupdec/times} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-01-31 function result = dot (x, y, dim) if (nargin < 2 || nargin > 3) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif if (nargin < 3) if (isvector (x.dec) && isvector (y.dec)) ## Align vectors along common dimension dim = 1; x = vec (x, dim); y = vec (y, dim); else ## Try to find non-singleton dimension dim = find (any (size (x.dec), size (y.dec)) > 1, 1); if (isempty (dim)) dim = 1; endif endif endif ## null matrix input -> null matrix output if (isempty (x.dec) || isempty (y.dec)) result = infsupdec (zeros (min (size (x.dec), size (y.dec)))); return endif ## Only the sizes of non-singleton dimensions must agree. Singleton dimensions ## do broadcast (independent of parameter dim). if ((min (size (x.dec, 1), size (y.dec, 1)) > 1 && ... size (x.dec, 1) ~= size (y.dec, 1)) || ... (min (size (x.dec, 2), size (y.dec, 2)) > 1 && ... size (x.dec, 2) ~= size (y.dec, 2))) error ("interval:InvalidOperand", "dot: sizes of X and Y must match") endif result = newdec (dot (x.infsup, y.infsup, dim)); warning ("off", "Octave:broadcast", "local"); result.dec = min (result.dec, ... min (min (x.dec, [], dim), min (y.dec, [], dim))); endfunction %!# from the documentation string %!assert (isequal (dot ([infsupdec(1), 2, 3], [infsupdec(2), 3, 4]), infsupdec (20))); %!assert (isequal (dot (infsupdec ([realmax; realmin; realmax]), [1; -1; -1], 1), infsupdec (-realmin))); interval-2.1.0/inst/@infsupdec/ei.m0000644000000000000000000000406113031036767015303 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} ei (@var{X}) ## ## Compute the exponential integral for positive arguments. ## ## @tex ## $$ ## {\rm ei} (x) = \int_{-\infty}^x {{\exp t} \over t} dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## x ## / exp (t) ## ei (x) = | --------- dt ## / t ## -∞ ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## ei (infsupdec (1)) ## @result{} ans ⊂ [1.8951, 1.8952]_com ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-29 function result = ei (x) if (nargin ~= 1) print_usage (); return endif result = newdec (ei (x.infsup)); ## ei is continuous everywhere, but defined for x > 0 only persistent domain_hull = infsup (0, inf); result.dec (not (interior (x.infsup, domain_hull))) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!assert (isempty (ei (infsupdec (0)))); %!assert (isempty (ei (infsupdec (-inf, -2)))); %!assert (isequal (ei (infsupdec (0, inf)), infsupdec ("[Entire]_trv"))); %!assert (isequal (ei (infsupdec (1, inf)), infsupdec ("[0x1.E52670F350D08, Inf]_dac"))); %!# from the documentation string %!assert (isequal (ei (infsupdec (1)), infsupdec ("[0x1.E52670F350D08, 0x1.E52670F350D09]_com"))); interval-2.1.0/inst/@infsupdec/eq.m0000644000000000000000000000527313031036767015321 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} eq (@var{A}, @var{B}) ## @defopx Operator {@@infsupdec} {@var{A} == @var{B}} ## ## Compare intervals @var{A} and @var{B} for equality. ## ## True, if all numbers from @var{A} are also contained in @var{B} and vice ## versa. False, if @var{A} contains a number which is not a member in @var{B} ## or vice versa. ## ## @example ## @group ## x = infsupdec (2, 3); ## y = infsupdec (1, 2); ## x == y ## @result{} ans = 0 ## @end group ## @end example ## @seealso{@@infsupdec/subset, @@infsupdec/interior, @@infsupdec/disjoint} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = eq (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif result = eq (a.infsup, b.infsup); result(isnai (a) | isnai (b)) = false (); endfunction %!# Empty interval %!assert (eq (infsupdec (), infsupdec ()) == true); %!assert (eq (infsupdec (), infsupdec (1)) == false); %!assert (eq (infsupdec (0), infsupdec ()) == false); %!assert (eq (infsupdec (-inf, inf), infsupdec ()) == false); %!# Singleton intervals %!assert (eq (infsupdec (0), infsupdec (1)) == false); %!assert (eq (infsupdec (0), infsupdec (0)) == true); %!# Bounded intervals %!assert (eq (infsupdec (1, 2), infsupdec (3, 4)) == false); %!assert (eq (infsupdec (1, 2), infsupdec (2, 3)) == false); %!assert (eq (infsupdec (1, 2), infsupdec (1.5, 2.5)) == false); %!assert (eq (infsupdec (1, 2), infsupdec (1, 2)) == true); %!# Unbounded intervals %!assert (eq (infsupdec (0, inf), infsupdec (-inf, 0)) == false); %!assert (eq (infsupdec (0, inf), infsupdec (0, inf)) == true); %!assert (eq (infsupdec (-inf, 0), infsupdec (-inf, 0)) == true); %!assert (eq (infsupdec (-inf, inf), infsupdec (42)) == false); %!assert (eq (infsupdec (-inf, 0), infsupdec (-inf, inf)) == false); %!assert (eq (infsupdec (-inf, inf), infsupdec (-inf, inf)) == true); interval-2.1.0/inst/@infsupdec/erf.m0000644000000000000000000000331213031036767015460 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} erf (@var{X}) ## ## Compute the error function. ## ## @tex ## $$ ## {\rm erf} (x) = {2 \over \sqrt{\pi}}\int_0^x \exp (-t^2) dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## x ## 2 / ## erf (x) = ----- | exp (-t²) dt ## √π / ## 0 ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## erf (infsupdec (1)) ## @result{} ans ⊂ [0.8427, 0.84271]_com ## @end group ## @end example ## @seealso{@@infsupdec/erfc} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-28 function result = erf (x) if (nargin ~= 1) print_usage (); return endif result = newdec (erf (x.infsup)); ## erf is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (erf (infsupdec (1)) == "[0x1.AF767A741088Ap-1, 0x1.AF767A741088Bp-1]"); interval-2.1.0/inst/@infsupdec/erfc.m0000644000000000000000000000340013031036767015621 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} erfc (@var{X}) ## ## Compute the complementary error function @code{1 - erf (@var{X})}. ## ## @tex ## $$ ## {\rm erfc} (x) = {2 \over \sqrt{\pi}}\int_x^\infty \exp (-t^2) dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## ∞ ## 2 / ## erfc (x) = ----- | exp (-t²) dt ## √π / ## x ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## erfc (infsupdec (1)) ## @result{} ans ⊂ [0.15729, 0.1573]_com ## @end group ## @end example ## @seealso{@@infsup/erf} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-28 function result = erfc (x) if (nargin ~= 1) print_usage (); return endif result = newdec (erfc (x.infsup)); ## erfc is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (erfc (infsupdec (1)) == "[0x1.4226162FBDDD4p-3, 0x1.4226162FBDDD5p-3]"); interval-2.1.0/inst/@infsupdec/exp.m0000644000000000000000000000262713031036767015510 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} exp (@var{X}) ## ## Compute the exponential function. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## exp (infsupdec (1)) ## @result{} ans ⊂ [2.7182, 2.7183]_com ## @end group ## @end example ## @seealso{@@infsupdec/log, @@infsupdec/pow} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = exp (x) if (nargin ~= 1) print_usage (); return endif result = newdec (exp (x.infsup)); ## exp is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (exp (infsupdec (1)), infsupdec ("e"))); interval-2.1.0/inst/@infsupdec/expm1.m0000644000000000000000000000276113031036767015745 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} expm1 (@var{X}) ## ## Compute @code{exp (@var{X}) - 1} accurately in the neighborhood of zero. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## expm1 (infsupdec (eps)) ## @result{} ans ⊂ [2.2204e-16, 2.2205e-16]_com ## @end group ## @end example ## @seealso{@@infsup/exp, @@infsup/log1p} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-20 function result = expm1 (x) if (nargin ~= 1) print_usage (); return endif result = newdec (expm1 (x.infsup)); ## expm1 is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (expm1 (infsupdec (eps)), infsupdec ("[0x1p-52, 0x1.0000000000001p-52]"))); interval-2.1.0/inst/@infsupdec/factorial.m0000644000000000000000000000471713031036767016662 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} factorial (@var{N}) ## ## Compute the factorial of @var{N} where @var{N} is a non-negative integer. ## ## If @var{N} is a scalar, this is equivalent to ## @display ## factorial (@var{N}) = 1 * 2 * @dots{} * @var{N}. ## @end display ## For vector or matrix arguments, return the factorial of each element in the ## array. ## ## For non-integers see the generalized factorial function @command{gamma}. ## Note that the factorial function grows large quite quickly, and the result ## cannot be represented exactly in binary64 for @var{N} ≥ 23 and will overflow ## for @var{N} ≥ 171. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## factorial (infsupdec (6)) ## @result{} ans = [720]_dac ## @end group ## @end example ## @seealso{@@infsupdec/prod, @@infsupdec/gamma, @@infsupdec/gammaln} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-01-31 function result = factorial (x) if (nargin ~= 1) print_usage (); return endif ## The function is not continuous, since it is defined for non-negative ## integrals only. Thus the best possible decoration can be “dac”. result = infsupdec (factorial (x.infsup), "dac"); ## The function is defined for non-negative integrals only defined = issingleton (x) & fix (sup (x)) == sup (x); result.dec(not (defined)) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (factorial (infsupdec (6)) == infsupdec (720, "dac")); %!assert (factorial (infsupdec (0)) == infsupdec (1, "dac")); %!assert (factorial (infsupdec ("[0, 1.99]")) == infsupdec (1, "trv")); %!assert (factorial (infsupdec ("[0, 2]")) == "[1, 2]_trv"); %!assert (factorial (infsupdec ("[1.4, 1.6]")) == "[Empty]_trv"); interval-2.1.0/inst/@infsupdec/fix.m0000644000000000000000000000413513031036767015476 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} fix (@var{X}) ## ## Truncate fractional portion of each number in interval @var{X}. This is ## equivalent to rounding towards zero. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## fix (infsupdec (2.5, 3.5)) ## @result{} ans = [2, 3]_def ## fix (infsupdec (-0.5, 5)) ## @result{} ans = [0, 5]_def ## @end group ## @end example ## @seealso{@@infsupdec/floor, @@infsupdec/ceil, @@infsupdec/round, @@infsupdec/roundb} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = fix (x) if (nargin ~= 1) print_usage (); return endif result = newdec (fix (x.infsup)); ## Between two integral numbers the function is constant, thus continuous ## At x == 0 the function is continuous. discontinuous = not (issingleton (result)); result.dec(discontinuous) = min (result.dec(discontinuous), _def ()); onlyrestrictioncontinuous = issingleton (result) & ... ((sup (x) < 0 & fix (sup (x)) == sup (x)) | ... (inf (x) > 0 & fix (inf (x)) == inf (x))); result.dec(onlyrestrictioncontinuous) = ... min (result.dec(onlyrestrictioncontinuous), _dac ()); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (fix (infsupdec (2.5, 3.5)), infsupdec (2, 3, "def"))); %!assert (isequal (fix (infsupdec (-0.5, 5)), infsupdec (0, 5, "def"))); interval-2.1.0/inst/@infsupdec/floor.m0000644000000000000000000000367013031036767016034 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} floor (@var{X}) ## ## Round each number in interval @var{X} towards -Inf. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## floor (infsupdec (2.5, 3.5)) ## @result{} ans = [2, 3]_def ## floor (infsupdec (-0.5, 5)) ## @result{} ans = [-1, +5]_def ## @end group ## @end example ## @seealso{@@infsupdec/ceil, @@infsupdec/round, @@infsupdec/roundb, @@infsupdec/fix} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = floor (x) if (nargin ~= 1) print_usage (); return endif result = newdec (floor (x.infsup)); ## Between two integral numbers the function is constant, thus continuous discontinuous = not (issingleton (result)); result.dec(discontinuous) = min (result.dec(discontinuous), _def ()); onlyrestrictioncontinuous = issingleton (result) & fix (inf (x)) == inf (x); result.dec(onlyrestrictioncontinuous) = ... min (result.dec(onlyrestrictioncontinuous), _dac ()); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (floor (infsupdec (2.5, 3.5)), infsupdec (2, 3, "def"))); %!assert (isequal (floor (infsupdec (-0.5, 5)), infsupdec (-1, 5, "def"))); interval-2.1.0/inst/@infsupdec/fma.m0000644000000000000000000000416313031036767015454 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} fma (@var{X}, @var{Y}, @var{Z}) ## ## Fused multiply and add @code{@var{X} * @var{Y} + @var{Z}}. ## ## This function is semantically equivalent to evaluating multiplication and ## addition separately, but in addition guarantees a tight enclosure of the ## result. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## output_precision (16, 'local') ## fma (infsupdec (1+eps), infsupdec (7), infsupdec ("0.1")) ## @result{} ans ⊂ [7.100000000000001, 7.100000000000003]_com ## infsupdec (1+eps) * infsupdec (7) + infsupdec ("0.1") ## @result{} ans ⊂ [7.1, 7.100000000000003]_com ## @end group ## @end example ## @seealso{@@infsupdec/plus, @@infsupdec/mtimes} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = fma (x, y, z) if (nargin ~= 3) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif if (not (isa (z, "infsupdec"))) z = infsupdec (z); endif result = newdec (fma (x.infsup, y.infsup, z.infsup)); ## fma is defined and continuous everywhere result.dec = min (result.dec, min (x.dec, min (y.dec, z.dec))); endfunction %!# from the documentation string %!assert (isequal (fma (infsupdec (1+eps), infsupdec (7), infsupdec ("0.1")), infsupdec ("[0x1.C666666666668p2, 0x1.C666666666669p2]"))); interval-2.1.0/inst/@infsupdec/gamma.m0000644000000000000000000000402513031036767015770 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} gamma (@var{X}) ## ## Compute the gamma function. ## ## @tex ## $$ ## {\rm gamma} (x) = \int_0^\infty t^(x-1) \exp (-t) dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## ∞ ## / ## gamma (x) = | t^(x - 1) * exp (-t) dt ## / ## 0 ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a valid enclosure. The result is tightest for ## @var{X} >= -10. ## ## @example ## @group ## gamma (infsupdec (1.5)) ## @result{} ans ⊂ [0.88622, 0.88623]_com ## @end group ## @end example ## @seealso{@@infsupdec/psi, @@infsupdec/gammaln, @@infsupdec/factorial} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-01 function result = gamma (x) if (nargin ~= 1) print_usage (); return endif result = newdec (gamma (x.infsup)); ## gamma is continuous where it is defined undefined = (inf (x) <= 0 & fix (inf (x)) == inf (x)) | ... (sup (x) <= 0 & fix (sup (x)) == sup (x)) | ... (inf (x) < 0 & ceil (inf (x)) <= floor (sup (x))); result.dec(undefined) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (gamma (infsupdec (1.5)), infsupdec ("[0x1.C5BF891B4EF6Ap-1, 0x1.C5BF891B4EF6Bp-1]_com"))); interval-2.1.0/inst/@infsupdec/gammaln.m0000644000000000000000000000410513031036767016321 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} gammaln (@var{X}) ## ## Compute the logarithm of the gamma function for positive arguments. ## ## @tex ## $$ ## {\rm gammaln} (x) = \log \int_0^\infty t^{x-1} \exp (-t) dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## ∞ ## / ## gammaln (x) = log | t^(x-1) exp (-t) dt ## / ## 0 ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## gammaln (infsupdec (1.5)) ## @result{} ans ⊂ [-0.12079, -0.12078]_com ## @end group ## @end example ## @seealso{@@infsupdec/psi, @@infsupdec/gamma, @@infsupdec/factorial} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-28 function result = gammaln (x) if (nargin ~= 1) print_usage (); return endif result = newdec (gammaln (x.infsup)); ## gammaln is continuous everywhere, but defined for x > 0 only persistent domain_hull = infsup (0, inf); result.dec(not (interior (x.infsup, domain_hull))) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!assert (isequal (gammaln (infsupdec (-inf, inf)), infsupdec ("[-0x1.F19B9BCC38A42p-4, +Inf]_trv"))); %!# from the documentation string %!assert (isequal (gammaln (infsupdec (1.5)), infsupdec ("[-0x1.EEB95B094C192p-4, -0x1.EEB95B094C191p-4]_com"))); interval-2.1.0/inst/@infsupdec/gauss.m0000644000000000000000000000417613031036767016037 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{x} =} gauss (@var{A}, @var{b}) ## ## Solve a linear interval system @var{A} * @var{x} = @var{b} using Gaussian ## elimination. ## ## The found enclosure is improved with the help of the Gauß-Seidel-method. ## ## Note: This algorithm is very inaccurate and slow for matrices of a dimension ## greater than 3. A better solver is provided by @code{mldivide}. The ## inaccuracy mainly comes from the dependency problem of interval arithmetic ## during back-substitution of the solution's enclosure. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## gauss (infsupdec ([1, 0; 0, 2]), [2, 0; 0, 4]) ## @result{} ans = 2×2 interval matrix ## [2]_trv [0]_trv ## [0]_trv [2]_trv ## @end group ## @end example ## @seealso{@@infsupdec/mldivide} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-18 function result = gauss (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif result = infsupdec (gauss (x.infsup, y.infsup), "trv"); warning ("off", "Octave:broadcast", "local"); result.dec = min (result.dec, min (vec (min (x.dec, y.dec)))); endfunction %!# from the documentation string %!assert (isequal (gauss (infsupdec ([1, 0; 0, 2]), [2, 0; 0, 4]), infsupdec ([2, 0; 0, 2], "trv"))); interval-2.1.0/inst/@infsupdec/hypot.m0000644000000000000000000000327013031036767016052 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} hypot (@var{X}, @var{Y}) ## ## Compute the euclidean norm. ## ## @code{hypot (@var{x}, @var{y}) = sqrt (@var{x}^2 + @var{y}^2)} ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsupdec (2, 3); ## y = infsupdec (1, 2); ## hypot (x, y) ## @result{} ans ⊂ [2.236, 3.6056]_com ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-20 function result = hypot (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif result = newdec (hypot (x.infsup, y.infsup)); ## hypot is continuous and defined everywhere result.dec = min (result.dec, min (x.dec, y.dec)); endfunction %!# from the documentation string %!assert (isequal (hypot (infsupdec (2, 3), infsupdec (1, 2)), infsupdec ("[0x1.1E3779B97F4A7p1, 0x1.CD82B446159F4p1]"))); interval-2.1.0/inst/@infsupdec/inf.m0000644000000000000000000000317413031036767015466 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} inf (@var{X}) ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## ## Get the (greatest) lower boundary for all numbers of interval @var{X}. ## ## If @var{X} is empty, @code{inf (@var{X})} is positive infinity. If @var{X} ## is NaI, @code{inf (@var{X})} is NaN. ## ## Accuracy: The result is exact. ## ## @example ## @group ## inf (infsupdec (2.5, 3.5)) ## @result{} ans = 2.5000 ## @end group ## @end example ## @seealso{@@infsupdec/sup, @@infsup/mid} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-09-18 function result = inf (x) if (nargin ~= 1) print_usage (); return endif result = inf (x.infsup); result(isnai (x)) = nan; endfunction %!assert (inf (infsupdec (2.5, 3.5)), 2.5); %!assert (inf (infsupdec ()), +inf); %!assert (inf (infsupdec ("[nai]")), nan); %!warning id=interval:UndefinedOperation %! assert (inf (infsupdec (2, 1)), nan); interval-2.1.0/inst/@infsupdec/infsupdec.m0000644000000000000000000004043413031036767016672 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypeop Constructor {@@infsupdec} {[@var{X}, @var{ISEXACT}] =} infsupdec () ## @deftypeopx Constructor {@@infsupdec} {[@var{X}, @var{ISEXACT}] =} infsupdec (@var{M}) ## @deftypeopx Constructor {@@infsupdec} {[@var{X}, @var{ISEXACT}] =} infsupdec (@var{M}, @var{D}) ## @deftypeopx Constructor {@@infsupdec} {[@var{X}, @var{ISEXACT}] =} infsupdec (@var{S}) ## @deftypeopx Constructor {@@infsupdec} {[@var{X}, @var{ISEXACT}] =} infsupdec (@var{L}, @var{U}) ## @deftypeopx Constructor {@@infsupdec} {[@var{X}, @var{ISEXACT}] =} infsupdec (@var{L}, @var{U}, @var{D}) ## @deftypeopx Constructor {@@infsupdec} {[@var{X}, @var{ISEXACT}] =} infsupdec (@var{I}, @var{D}) ## ## Create a decorated interval from boundaries. Convert boundaries to double ## precision. ## ## The syntax without parameters creates an (exact) empty interval. The syntax ## with a single parameter @code{infsupdec (@var{M})} equals ## @code{infsupdec (@var{M}, @var{M})}. The syntax ## @code{infsupdec (@var{M}, @var{D})} equals ## @code{infsupdec (@var{M}, @var{M}, @var{D})}. The syntax ## @code{infsupdec (@var{S})} parses a possibly decorated interval literal in ## inf-sup form or as a special value, where @code{infsupdec ("[S1, S2]")} is ## equivalent to @code{infsupdec ("S1", "S2")} and, if [S1, S2]_D is a valid ## interval literal, ## @code{infsupdec ("[S1, S2]_D")} is equivalent to ## @code{infsupdec ("S1", "S2", "D")}. The syntax ## @code{infsupdec (@var{I}, @var{D})} overrides an interval @var{I}'s ## decoration with a new decoration @var{D}. A second, logical output ## @var{ISEXACT} indicates if @var{X}'s boundaries both have been converted ## without precision loss and without changes to the optional, desired ## decoration. ## ## If construction fails, the special value NaI, “not an interval,” will be ## returned and a warning message will be raised. NaI is equivalent to ## [Empty] together with an ill-formed decoration. ## ## Each boundary can be provided in the following formats: literal constants ## [+-]inf[inity], e, pi; scalar real numeric data types, i. e., double, ## single, [u]int[8,16,32,64]; or decimal numbers as strings of the form ## [+-]d[,.]d[[eE][+-]d]; or hexadecimal numbers as string of the form ## [+-]0xh[,.]h[[pP][+-]d]; or decimal numbers in rational form ## [+-]d/d. ## ## Also it is possible, to construct intervals from the uncertain form in the ## form @code{m?ruE}, where @code{m} is a decimal mantissa, ## @code{r} is empty (= half ULP) or a decimal integer ULP count or a ## second @code{?} character for unbounded intervals, @code{u} is ## empty or a direction character (u: up, d: down), and @code{E} is an ## exponential field. ## ## If decimal or hexadecimal numbers are no binary64 floating point numbers, a ## tight enclosure will be computed. int64 and uint64 numbers of high ## magnitude (> 2^53) can also be affected from precision loss. ## ## The decoration @var{D} must be any of @code{com}, @code{dac}, @code{def}, ## @code{trv}, or @code{ill}. Illegal decorations within interval literals ## will produce NaIs, whereas illegal decorations provided as an additional ## function parameter will be automatically adjusted. ## ## For the creation of interval matrices, arguments may be provided as (1) cell ## arrays with arbitrary/mixed types, (2) numeric matrices, or (3) strings. ## Scalar values do broadcast. ## ## Non-standard behavior: This class constructor is not described by IEEE Std ## 1788-2015, however it implements the standard functions setDec, ## numsToInterval, and textToInterval. ## ## @example ## @group ## v = infsupdec () ## @result{} v = [Empty]_trv ## w = infsupdec (1) ## @result{} w = [1]_com ## x = infsupdec (2, 3) ## @result{} x = [2, 3]_com ## y = infsupdec ("0.1") ## @result{} y ⊂ [0.099999, 0.10001]_com ## z = infsupdec ("0.1", "0.2") ## @result{} z ⊂ [0.099999, 0.20001]_com ## @end group ## @end example ## @seealso{exacttointerval, hull, midrad, @@infsup/newdec} ## @end deftypeop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-12 function [x, isexact] = infsupdec (varargin) persistent scalar_empty_interval = class (struct ("dec", _trv), ... "infsupdec", infsup ()); ## Enable all mixed mode functions to use decorated variants with implicit ## conversion from bare to decorated intervals. ## ## There is bug #42735 in GNU Octave core, which makes this a little ## complicated: When [infsup] [operator] [infsupdec] syntax is used, the ## decoration from the second argument would be lost, because the bare ## implementation for the operator is evaluated. However, sufficient runtime ## checks have been placed in the overloaded class operator implementations of ## the infsup class as a workaround. ## ## The workaround is necessary, because otherwise this could lead to wrong ## results, which is catastrophic for a verified computation package. superiorto ("infsup"); if (nargin == 0) x = scalar_empty_interval; isexact = true; return endif if (nargin == 1 && isa (varargin{1}, "infsupdec")) x = varargin{1}; isexact = true; return endif for i = 1 : numel (varargin) if (ischar (varargin{i})) varargin{i} = __split_interval_literals__ (varargin{i}); endif endfor if (nargin >= 1 && ... iscellstr (varargin{end}) && ... not (isempty (varargin{end})) && ... any (strcmpi (varargin{end}{1}, ... {"com", "dac", "def", "trv", "ill"}))) ## The decoration information has been passed as the last parameter decstr = varargin{end}; varargin = varargin(1 : end - 1); ## The setDec function, as described by IEEE Std 1788-2015, ## may fix decorations fix_illegal_decorations = true; elseif (nargin == 1 && iscell (varargin{1})) ## Extract decorations from possibly decorated interval literals char_idx = cellfun ("ischar", varargin{1}); ## Split bare interval literal and decoration literal_and_decoration = cellfun ("strsplit", ... varargin{1}(char_idx), {"_"}, ... "UniformOutput", false); number_of_parts = cellfun ("numel", literal_and_decoration); illegal_local_idx = number_of_parts > 2; if (any (illegal_local_idx(:))) ## More than 2 underscores in any literal warning ("interval:UndefinedOperation", ... "illegal decorated interval literal") literal_and_decoration(illegal_local_idx) = {"[nai]"}; endif ## Ignore strings without decoration has_decoration_local_idx = (number_of_parts == 2); literal_and_decoration = literal_and_decoration(has_decoration_local_idx); char_idx(char_idx) = has_decoration_local_idx; ## Extract decoration decstr = cell (size (varargin{1})); decstr(char_idx) = vertcat ({}, ... cellindexmat (literal_and_decoration, 2){:}); varargin{1}(char_idx) = vertcat({}, ... cellindexmat (literal_and_decoration, 1){:}); ## Interval literals must not carry illegal decorations fix_illegal_decorations = false; else ## Undecorated interval boundaries decstr = {""}; ## No need to fix illegal decorations fix_illegal_decorations = false; endif switch numel (varargin) case 0 [bare, isexact] = infsup (); isnai = overflow = false; case 1 switch class (varargin{1}) case "infsup" bare = varargin{1}; isexact = true; isnai = overflow = false (size (bare)); if (nargin == 1 && any (not (isempty (bare)(:)))) warning ("interval:ImplicitPromote", ... ["Implicitly decorated bare interval; ", ... "resulting decoration may be wrong"]); endif case "infsupdec" ## setDec and newDec replace the current decoration ## with a new one bare = struct (varargin{1}).infsup; isexact = true; isnai = overflow = false (size (bare)); case "cell" ## [nai] is a legal literal, but not allowed in the infsup ## constructor. Create a silent nai in these cases. nai_literal_idx = not (cellfun ("isempty", ... regexp (varargin{1}, '^\[\s*nai\s*\]$', ... "ignorecase"))); varargin{1}(nai_literal_idx) = "[]"; [bare, isexact, overflow, isnai] = infsup (varargin{1}); isnai(nai_literal_idx) = true; otherwise [bare, isexact, overflow, isnai] = infsup (varargin{1}); endswitch case 2 [bare, isexact, overflow, isnai] = infsup (varargin{1}, varargin{2}); otherwise print_usage (); return endswitch ## Convert decoration strings into decoration matrix. ## Initialize the matrix with the ill decoration, which is not allowed to ## be used explicitly as a parameter to this function. dec = repmat (_ill, size (decstr)); ## Missing decorations will later be assigned their final value missingdecoration_value = uint8 (1); # magic value, not used otherwise dec(cellfun ("isempty", decstr)) = missingdecoration_value; dec(strcmpi (decstr, "com")) = _com; dec(strcmpi (decstr, "dac")) = _dac; dec(strcmpi (decstr, "def")) = _def; dec(strcmpi (decstr, "trv")) = _trv; if (any ((dec == _ill)(:))) warning ("interval:UndefinedOperation", "illegal decoration"); endif ## Broadcast decoration and bare interval if (not (isequal (size (bare), size (dec)))) for dim = 1 : max (ndims (bare), ndims (dec)) if (size (bare, dim) != 1 && size (dec, dim) != 1 && ... size (bare, dim) != size (dec, dim)) warning ("interval:InvalidOperand", ... ["infsupdec: Dimensions of decoration and interval ", ... "are not compatible"]); ## Unable to recover from this kind of error x = scalar_empty_interval; isexact = false; return endif endfor dec = dec + zeros (size (bare), "uint8"); bare = bare + zeros (size (dec)); endif ## If creation failed in infsup constructor, make an illegal interval dec(isnai) = _ill; ## Silently fix decoration when overflow occurred dec(overflow & (dec == _com)) = _dac; ## Add missing decoration missingdecoration = (dec == missingdecoration_value); dec(missingdecoration) = _dac; dec(missingdecoration & isempty (bare)) = _trv; dec(missingdecoration & iscommoninterval (bare)) = _com; ## Check decoration empty_not_trv = isempty (bare) & (dec ~= _trv) & (dec ~= _ill); if (any (empty_not_trv(:))) if (not (fix_illegal_decorations)) warning ("interval:UndefinedOperation", ... "illegal decorated empty interval literal") dec(empty_not_trv) = _ill; else dec(empty_not_trv) = _trv; endif isexact = false (); endif uncommon_com = not (iscommoninterval (bare)) & (dec == _com); if (any (uncommon_com(:))) if (not (fix_illegal_decorations)) warning ("interval:UndefinedOperation", ... "illegal decorated uncommon interval literal") dec(uncommon_com) = _ill; else dec(uncommon_com) = _dac; endif isexact = false (); endif ## Illegal intervals must be empty illegal = (dec == _ill); if (any (illegal(:))) bare(illegal) = infsup (); isexact = false (); endif x = class (struct ("dec", dec), "infsupdec", bare); endfunction %!# [NaI]s %!assert (isnai (infsupdec ("[nai]"))); # quiet [NaI] %!warning id=interval:UndefinedOperation %! assert (isnai (infsupdec (3, 2))); # illegal boundaries %!warning id=interval:UndefinedOperation %! assert (isnai (infsupdec (inf, -inf))); # illegal boundaries %!warning id=interval:UndefinedOperation %! assert (isnai (infsupdec ("Flugeldufel"))); # illegal literal %!warning id=interval:UndefinedOperation %! assert (isnai (infsupdec ("[1, Inf]_com"))); # illegal decorated literal %!warning id=interval:UndefinedOperation %! assert (isnai (infsupdec ("[Empty]_def"))); # illegal decorated literal %!# decoration adjustments, setDec function %!test %! x = infsupdec (42, inf, "com"); %! assert (inf (x), 42); %! assert (sup (x), inf); %! assert (decorationpart (x), {"dac"}); %!test %! x = infsupdec (-inf, inf, {"com"}); %! assert (inf (x), -inf); %! assert (sup (x), inf); %! assert (decorationpart (x), {"dac"}); %!test %! x = infsupdec ("def"); %! assert (inf (x), inf); %! assert (sup (x), -inf); %! assert (decorationpart (x), {"trv"}); %!# overflow %!test %! x = infsupdec ("[1, 1e999]_com"); %! assert (inf (x), 1); %! assert (sup (x), inf); %! assert (decorationpart (x), {"dac"}); %!# decorated interval literal %!test %! x = infsupdec ("[2, 3]_def"); %! assert (inf (x), 2); %! assert (sup (x), 3); %! assert (decorationpart (x), {"def"}); %!test %! x = infsupdec ("[1, 5]_dac"); %! assert (inf (x), 1); %! assert (sup (x), 5); %! assert (decorationpart (x), {"dac"}); %!test %! x = infsupdec ("[1, Infinity]_dac"); %! assert (inf (x), 1); %! assert (sup (x), inf); %! assert (decorationpart (x), {"dac"}); %!test %! x = infsupdec ("[Empty]_trv"); %! assert (inf (x), inf); %! assert (sup (x), -inf); %! assert (decorationpart (x), {"trv"}); %!# automatic decoration / undecorated interval literal / newDec function %!test %! x = infsupdec ("[2, 3]"); %! assert (inf (x), 2); %! assert (sup (x), 3); %! assert (decorationpart (x), {"com"}); %!test %! x = infsupdec ("[Empty]"); %! assert (inf (x), inf); %! assert (sup (x), -inf); %! assert (decorationpart (x), {"trv"}); %!test %! x = infsupdec ("[Entire]"); %! assert (inf (x), -inf); %! assert (sup (x), inf); %! assert (decorationpart (x), {"dac"}); %!test %! x = infsupdec (""); %! assert (inf (x), -inf); %! assert (sup (x), inf); %! assert (decorationpart (x), {"dac"}); %!# separate decoration information %!test %! x = infsupdec ("[2, 3]", "def"); %! assert (inf (x), 2); %! assert (sup (x), 3); %! assert (decorationpart (x), {"def"}); %!# cell array with decorated interval literals %!test %! x = infsupdec ({"[2, 3]_def", "[4, 5]_dac"}); %! assert (inf (x), [2, 4]); %! assert (sup (x), [3, 5]); %! assert (decorationpart (x), {"def", "dac"}); %!#cell array with separate decoration cell array %!test %! x = infsupdec ({"[2, 3]", "[4, 5]"}, {"def", "dac"}); %! assert (inf (x), [2, 4]); %! assert (sup (x), [3, 5]); %! assert (decorationpart (x), {"def", "dac"}); %!# cell array with separate decoration vector %!test %! x = infsupdec ({"[2, 3]"; "[4, 5]"}, ["def"; "dac"]); %! assert (inf (x), [2; 4]); %! assert (sup (x), [3; 5]); %! assert (decorationpart (x), {"def"; "dac"}); %!# cell array with broadcasting decoration %!test %! x = infsupdec ({"[2, 3]", "[4, 5]"}, "def"); %! assert (inf (x), [2, 4]); %! assert (sup (x), [3, 5]); %! assert (decorationpart (x), {"def", "def"}); %!test %! x = infsupdec ({"[2, 3]", "[4, 5]"}, "def; dac"); %! assert (inf (x), [2, 4; 2, 4]); %! assert (sup (x), [3, 5; 3, 5]); %! assert (decorationpart (x), {"def", "def"; "dac", "dac"}); %!# separate boundaries with decoration %!test %! x = infsupdec (2, 3, "def"); %! assert (inf (x), 2); %! assert (sup (x), 3); %! assert (decorationpart (x), {"def"}); %!# matrix boundaries with decoration %!test %! x = infsupdec ([3, 16], {"def", "trv"}); %! assert (inf (x), [3, 16]); %! assert (sup (x), [3, 16]); %! assert (decorationpart (x), {"def", "trv"}); %!# separate matrix boundaries with broadcasting decoration %!test %! x = infsupdec (magic (3), magic (3) + 1, "def"); %! assert (inf (x), magic (3)); %! assert (sup (x), magic (3) + 1); %! assert (decorationpart (x), {"def", "def", "def"; "def", "def", "def"; "def", "def", "def"}); interval-2.1.0/inst/@infsupdec/interior.m0000644000000000000000000000317713031036767016550 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} interior (@var{A}, @var{B}) ## ## Evaluate interior comparison on intervals. ## ## True, if all numbers from @var{A} are also contained in @var{B}, but are no ## boundaries of @var{B}. False, if @var{A} contains a number which is not a ## member in @var{B} or which is a boundary of @var{B}. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsupdec/eq, @@infsupdec/subset, @@infsupdec/disjoint} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = interior (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif result = interior (a.infsup, b.infsup); result(isnai (a) | isnai (b)) = false; endfunction %!assert (interior (infsupdec (1, 2), infsupdec (0, 3))); interval-2.1.0/inst/@infsupdec/intersect.m0000644000000000000000000000513713031036767016713 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} intersect (@var{A}) ## @defmethodx {@@infsupdec} intersect (@var{A}, @var{B}) ## @defmethodx {@@infsupdec} intersect (@var{A}, [], @var{DIM}) ## ## Intersect intervals. ## ## With two arguments the intersection is built pair-wise. Otherwise the ## intersection is computed for all interval members along dimension @var{DIM}, ## which defaults to the first non-singleton dimension. ## ## Accuracy: The result is a tight enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## The function is a set operation and the result carries the @code{trv} ## decoration at best. ## ## @example ## @group ## x = infsupdec (1, 3); ## y = infsupdec (2, 4); ## intersect (x, y) ## @result{} ans = [2, 3]_trv ## @end group ## @end example ## @seealso{@@infsupdec/union, @@infsupdec/setdiff, @@infsupdec/setxor} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = intersect (a, b, dim) if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif switch (nargin) case 1 result = infsupdec (intersect (a.infsup), "trv"); result.dec = min (result.dec, min (a.dec)); case 2 if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif result = infsupdec (intersect (a.infsup, b.infsup), "trv"); warning ("off", "Octave:broadcast", "local"); result.dec = min (result.dec, min (a.dec, b.dec)); case 3 if (not (builtin ("isempty", b))) warning ("intersect: second argument is ignored"); endif result = infsupdec (intersect (a.infsup, [], dim), "trv"); result.dec = min (result.dec, min (a.dec, [], dim)); otherwise print_usage (); return endswitch endfunction %!# from the documentation string %!assert (isequal (intersect (infsupdec (1, 3), infsupdec (2, 4)), infsupdec (2, 3, "trv"))); interval-2.1.0/inst/@infsupdec/intervalpart.m0000644000000000000000000000257413031036767017430 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{S} =} intervalpart (@var{X}) ## ## Return the bare interval for the decorated interval @var{X}. ## ## @seealso{@@infsupdec/decorationpart} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-12 function bare = intervalpart (x) if (nargin ~= 1) print_usage (); return endif if (any (isnai (x)(:))) warning ("interval:IntvlPartOfNaI", ... "intervalpart: NaI has no interval part") endif bare = x.infsup; endfunction %!warning id=interval:IntvlPartOfNaI %! assert (intervalpart (nai ()) == infsup ()); %!assert (intervalpart (infsupdec (2, 3)) == infsup (2, 3)); interval-2.1.0/inst/@infsupdec/intervaltotext.m0000644000000000000000000000467013031036767020010 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{S} =} intervaltotext (@var{X}) ## @deftypemethodx {@@infsupdec} {@var{S} =} intervaltotext (@var{X}, @var{FORMAT}) ## ## Build an approximate representation of the interval @var{X}. ## ## Output @var{S} is a simple string for scalar intervals, and a cell array of ## strings for interval matrices. ## ## The interval boundaries are stored in binary floating point format and are ## converted to decimal or hexadecimal format with possible precision loss. If ## output is not exact, the boundaries are rounded accordingly (e. g. the upper ## boundary is rounded towards infinite for output representation). ## ## The exact decimal format may produce a lot of digits. ## ## Possible values for @var{FORMAT} are: @code{decimal} (default), ## @code{exact decimal}, @code{exact hexadecimal}, @code{auto} ## ## Accuracy: For all intervals @var{X} is an accurate subset of ## @code{infsupdec (intervaltotext (@var{X}))}. ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-12 function [s, isexact] = intervaltotext (x, format) if (nargin > 2) print_usage (); return endif if (nargin < 2) format = "decimal"; endif [s, isexact] = intervaltotext (x.infsup, format); s = strcat (s, {"_"}, decorationpart (x)); s(isnai (x)) = "[NaI]"; if (isscalar (s)) s = s{1}; endif endfunction %!assert (intervaltotext (infsupdec (1 + eps), "exact decimal"), "[1.0000000000000002220446049250313080847263336181640625]_com"); %!assert (intervaltotext (infsupdec (1 + eps), "exact hexadecimal"), "[0x1.0000000000001p+0]_com"); %!assert (intervaltotext (infsupdec (1 + eps)), "[1.0000000000000002, 1.000000000000001]_com"); %!assert (intervaltotext (infsupdec (1)), "[1]_com"); interval-2.1.0/inst/@infsupdec/isempty.m0000644000000000000000000000260313031036767016400 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} isempty (@var{X}) ## ## Check if the interval represents the empty set. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## Warning: This function is not compatible with the builtin @code{isempty} ## function. ## ## @seealso{@@infsupdec/eq, @@infsupdec/isentire, @@infsupdec/issingleton} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = isempty (x) if (nargin ~= 1) print_usage (); return endif result = isempty (x.infsup); result(isnai (x)) = false; endfunction %!assert (isempty (infsupdec ())); %!assert (not (isempty (infsupdec (1, 2)))); interval-2.1.0/inst/@infsupdec/isnai.m0000644000000000000000000000261313031036767016012 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} isnai (@var{X}) ## ## Check if the interval is the result of a failed interval construction. ## ## @seealso{@@infsupdec/eq, @@infsupdec/isentire, @@infsupdec/issingleton, @@infsupdec/isempty} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = isnai (interval) if (nargin ~= 1) print_usage (); return endif ## NaI is internally stored as an empty interval with ill decoration. result = (interval.dec == _ill ()); endfunction %!assert (isnai (infsupdec ("[nai]"))); %!assert (not (isnai (infsupdec (2, 3)))); %!warning assert (isnai (infsupdec ("happy 42 hacking")), logical ([1 0 1])); interval-2.1.0/inst/@infsupdec/le.m0000644000000000000000000000327313031036767015312 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} le (@var{A}, @var{B}) ## @defopx Operator {@@infsupdec} {@var{A} <= @var{B}} ## ## Compare intervals @var{A} and @var{B} for weakly less. ## ## True, if all numbers from @var{A} are weakly less than any number in ## @var{B}. False, if @var{A} contains a number which is strictly greater than ## all numbers in @var{B}. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsupdec/eq, @@infsupdec/lt, @@infsupdec/ge, @@infsupdec/subset, @@infsupdec/interior, @@infsupdec/disjoint} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = le (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif result = le (a.infsup, b.infsup); result (isnai (a) | isnai (b)) = false; endfunction %!assert (le (infsupdec (1, 3), infsupdec (3))); interval-2.1.0/inst/@infsupdec/linspace.m0000644000000000000000000000424413031036767016507 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} linspace (@var{BASE}, @var{LIMIT}) ## @defmethodx {@@infsupdec} linspace (@var{BASE}, @var{LIMIT}, @var{N}) ## ## Return a row vector of @var{N} linearly spaced members between @var{BASE} ## and @var{LIMIT}. ## ## If @var{BASE} is greater than @var{LIMIT}, members are returned in ## decreasing order. The default value for @var{N} is 100. ## ## If either @var{BASE} or @var{LIMIT} is not a scalar, the result is a matrix. ## ## Accuracy: The result is an accurate enclosure. ## ## @example ## @group ## transpose (linspace (infsupdec (0), infsupdec (10), 4)) ## @result{} ans ⊂ 4×1 interval vector ## ## [0]_com ## [3.3333, 3.3334]_com ## [6.6666, 6.6667]_com ## [10]_com ## @end group ## @end example ## @seealso{linspace} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-07-19 function result = linspace (base, limit, n) if (nargin < 2 || nargin > 3) print_usage (); return endif if (not (isa (base, "infsupdec"))) base = infsupdec (base); endif if (not (isa (limit, "infsupdec"))) limit = infsupdec (limit); endif if (nargin < 3) n = 100; endif result = newdec (linspace (base.infsup, limit.infsup, n)); ## linspace is defined and continuous everywhere result.dec = min (result.dec, min (base.dec, limit.dec)); endfunction %!assert (isequal (linspace (infsupdec (0), infsupdec (10), 9), infsupdec (linspace (0, 10, 9)))); interval-2.1.0/inst/@infsupdec/log.m0000644000000000000000000000321413031036767015466 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} log (@var{X}) ## ## Compute the natural logarithm. ## ## The function is only defined where @var{X} is positive. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## log (infsupdec (2)) ## @result{} ans ⊂ [0.69314, 0.69315]_com ## @end group ## @end example ## @seealso{@@infsupdec/exp, @@infsupdec/log2, @@infsupdec/log10} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = log (x) if (nargin ~= 1) print_usage (); return endif result = newdec (log (x.infsup)); ## log is continuous everywhere, but defined for x > 0 only persistent domain_hull = infsup (0, inf); result.dec(not (interior (x.infsup, domain_hull))) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (log (infsupdec (2)), infsupdec ("[0x1.62E42FEFA39EFp-1, 0x1.62E42FEFA39Fp-1]"))); interval-2.1.0/inst/@infsupdec/log10.m0000644000000000000000000000324313031036767015631 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} log10 (@var{X}) ## ## Compute the decimal (base-10) logarithm. ## ## The function is only defined where @var{X} is positive. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## log10 (infsupdec (2)) ## @result{} ans ⊂ [0.30102, 0.30103]_com ## @end group ## @end example ## @seealso{@@infsupdec/pow10, @@infsupdec/log, @@infsupdec/log2} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = log10 (x) if (nargin ~= 1) print_usage (); return endif result = newdec (log10 (x.infsup)); ## log10 is continuous everywhere, but defined for x > 0 only persistent domain_hull = infsup (0, inf); result.dec(not (interior (x.infsup, domain_hull))) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (log10 (infsupdec (2)), infsupdec ("[0x1.34413509F79FEp-2, 0x1.34413509F79FFp-2]"))); interval-2.1.0/inst/@infsupdec/log1p.m0000644000000000000000000000326013031036767015730 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} log1p (@var{X}) ## ## Compute @code{log (1 + @var{X})} accurately in the neighborhood of zero. ## ## The function is only defined where @var{X} is greater than -1. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## log1p (infsupdec (eps)) ## @result{} ans ⊂ [2.2204e-16, 2.2205e-16]_com ## @end group ## @end example ## @seealso{@@infsup/exp, @@infsup/log} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-20 function result = log1p (x) if (nargin ~= 1) print_usage (); return endif result = newdec (log1p (x.infsup)); ## log1p is continuous everywhere, but defined for x > -1 only persistent domain_hull = infsup (-1, inf); result.dec(not (interior (x.infsup, domain_hull))) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (log1p (infsupdec (eps)), infsupdec ("[0x1.FFFFFFFFFFFFFp-53, 0x1p-52]"))); interval-2.1.0/inst/@infsupdec/log2.m0000644000000000000000000000313513031036767015552 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} log2 (@var{X}) ## ## Compute the binary (base-2) logarithm. ## ## The function is only defined where @var{X} is positive. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## log2 (infsupdec (2)) ## @result{} ans = [1]_com ## @end group ## @end example ## @seealso{@@infsupdec/pow2, @@infsupdec/log, @@infsupdec/log10} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-04 function result = log2 (x) if (nargin ~= 1) print_usage (); return endif result = newdec (log2 (x.infsup)); ## log2 is continuous everywhere, but defined for x > 0 only persistent domain_hull = infsup (0, inf); result.dec(not (interior (x.infsup, domain_hull))) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (log2 (infsupdec (2)), infsupdec (1))); interval-2.1.0/inst/@infsupdec/lt.m0000644000000000000000000000344213031036767015327 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} lt (@var{A}, @var{B}) ## @defopx Operator {@@infsupdec} {@var{A} < @var{B}} ## ## Compare intervals @var{A} and @var{B} for strictly less. ## ## True, if all numbers from @var{A} are strict less than at least one number ## in @var{B}. False, if @var{A} contains a number which is greater than all ## numbers in @var{B} or is equal to the greatest number of @var{B}. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsupdec/eq, @@infsupdec/le, @@infsupdec/gt, @@infsupdec/subset, @@infsupdec/interior, @@infsupdec/disjoint} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = lt (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif result = lt (a.infsup, b.infsup); result(isnai (a) | isnai (b)) = false; endfunction %!assert (not (lt (infsupdec (1, 3), infsupdec (3)))); %!assert (lt (infsupdec (1, 3), infsupdec (3.1))); interval-2.1.0/inst/@infsupdec/lu.m0000644000000000000000000000460013031036767015325 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {[@var{L}, @var{U}] = } lu (@var{A}) ## @deftypemethodx {@@infsupdec} {[@var{L}, @var{U}, @var{P}] = } lu (@var{A}) ## ## Compute the LU decomposition of @var{A}. ## ## @var{A} will be a subset of @var{L} * @var{U} with lower triangular matrix ## @var{L} and upper triangular matrix @var{U}. ## ## The result is returned in a permuted form, according to the optional return ## value @var{P}. ## ## Accuracy: The result is a valid enclosure. ## @seealso{@infsup/qr} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-18 function [L, U, P] = lu (x) if (nargin ~= 1) print_usage (); return endif P = eye (size (x.dec)); if (isnai (x)) L = U = nai (); return endif if (nargout >= 3) [L, U, P] = lu (x.infsup); else [L, U] = lu (x.infsup); endif ## Reverse operations should not carry decoration L = infsupdec (L, "trv"); U = infsupdec (U, "trv"); endfunction %!test %! [l, u] = lu (infsupdec (magic (3))); %! assert (isequal (l, infsupdec ({1, 0, 0; .375, 1, 0; .5, "68/37", 1}, "trv")));, ... %! assert (subset (u, infsupdec ({8, 1, 6; 0, 4.625, 4.75; 0, 0, "-0x1.3759F2298375Bp3"}, ... %! {8, 1, 6; 0, 4.625, 4.75; 0, 0, "-0x1.3759F22983759p3"}))); %! A = magic (3); %! A ([1, 5, 9]) = 0; %! [l, u, p] = lu (infsupdec (A)); %! assert (p, [0, 0, 1; 1, 0, 0; 0, 1, 0]); %! assert (isequal (l, infsupdec ({1, 0, 0; "4/3", 1, 0; 0, "1/9", 1}, "trv"))); %! assert (subset (u, infsupdec ({3, 0, 7; 0, 9, "-0x1.2AAAAAAAAAAACp3"; 0, 0, "0x1.C25ED097B425Ep2"}, ... %! {3, 0, 7; 0, 9, "-0x1.2AAAAAAAAAAAAp3"; 0, 0, "0x1.C25ED097B426p2"}))); interval-2.1.0/inst/@infsupdec/max.m0000644000000000000000000000522113031036767015472 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} max (@var{X}) ## @defmethodx {@@infsupdec} max (@var{X}, @var{Y}) ## @defmethodx {@@infsupdec} max (@var{X}, [], @var{DIM}) ## ## Compute the maximum value chosen from intervals. ## ## This function does not return the greatest element of the interval (see ## @code{sup}), but returns an interval enclosure of the function: ## @display ## max (@var{x}, @var{y}) = ( (x + y) + abs (x - y) ) / 2 ## @end display ## ## With two arguments the function is applied element-wise. Otherwise the ## maximum is computed for all interval members along dimension @var{DIM}, ## which defaults to the first non-singleton dimension. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsupdec (2, 3); ## y = infsupdec (1, 2); ## max (x, y) ## @result{} ans = [2, 3]_com ## @end group ## @end example ## @seealso{@@infsupdec/min} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = max (x, y, dim) if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif switch (nargin) case 1 bare = max (x.infsup); case 2 if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif bare = max (x.infsup, y.infsup); case 3 if (not (builtin ("isempty", y))) warning ("max: second argument is ignored"); endif bare = max (x.infsup, [], dim); otherwise print_usage (); return endswitch result = newdec (bare); ## max is defined and continuous everywhere switch (nargin) case 1 result.dec = min (result.dec, min (x.dec)); case 2 warning ("off", "Octave:broadcast", "local"); result.dec = min (result.dec, min (x.dec, y.dec)); case 3 result.dec = min (result.dec, min (x.dec, [], dim)); endswitch endfunction %!# from the documentation string %!assert (isequal (max (infsupdec (2, 3), infsupdec (1, 2)), infsupdec (2, 3))); interval-2.1.0/inst/@infsupdec/meshgrid.m0000644000000000000000000000643213031036767016514 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {[@var{XX}, @var{YY}] =} meshgrid (@var{X}, @var{Y}) ## @deftypemethodx {@@infsupdec} {[@var{XX}, @var{YY}, @var{ZZ}] =} meshgrid (@var{X}, @var{Y}, @var{Z}) ## @deftypemethodx {@@infsupdec} {[@var{XX}, @var{YY}] =} meshgrid (@var{X}) ## @deftypemethodx {@@infsupdec} {[@var{XX}, @var{YY}, @var{ZZ}] =} meshgrid (@var{X}) ## ## Given vectors of @var{X} and @var{Y} coordinates, return matrices @var{XX} ## and @var{YY} corresponding to a full 2-D grid. ## ## If the optional @var{Z} input is given, or @var{ZZ} is requested, then the ## output will be a full 3-D grid. ## ## Please note that this function does not produce multidimensional arrays in ## the case of 3-D grids like the built-in @code{meshgrid} function. This is ## because interval matrices currently only support two dimensions. The 3-D ## grid is reshaped to fit into two dimensions accordingly. ## ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-07-19 function [xx, yy, zz] = meshgrid (x, y, z) if (nargin > 3) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (nargin >= 2 && not (isa (y, "infsupdec"))) y = infsupdec (y); endif if (nargin >= 3 && not (isa (z, "infsupdec"))) z = infsupdec (z); endif switch (nargin) case 1 if (nargout >= 3) [xx, yy, zz] = meshgrid (x.infsup); [dxx, dyy, dzz] = meshgrid (x.dec); else [xx, yy] = meshgrid (x.infsup); [dxx, dyy] = meshgrid (x.dec); endif case 2 if (nargout >= 3) [xx, yy, zz] = meshgrid (x.infsup, y.infsup); [dxx, dyy, dzz] = meshgrid (x.dec, y.dec); else [xx, yy] = meshgrid (x.infsup, y.infsup); [dxx, dyy] = meshgrid (x.dec, y.dec); endif case 3 [xx, yy, zz] = meshgrid (x.infsup, ... y.infsup, ... z.infsup); [dxx, dyy, dzz] = meshgrid (x.dec, y.dec, z.dec); endswitch if (nargout >= 3 || nargin >= 3) ## Reshape 3 dimensions into 2 dimensions f = @(A) reshape (A, [size(A,1), prod(size (A)(2 : end))]); ## No need to reshape xx, yy, and zz (already happens in @infsup/meshgrid) dxx = f (dxx); dyy = f (dyy); dzz = f (dzz); endif xx = newdec (xx); xx.dec = min (xx.dec, dxx); yy = newdec (yy); yy.dec = min (yy.dec, dyy); if (nargout >= 3) zz = newdec (zz); zz.dec = min (zz.dec, dzz); endif endfunction %!assert (isequal (meshgrid (infsupdec (0 : 3)), infsupdec (meshgrid (0 : 3)))); interval-2.1.0/inst/@infsupdec/min.m0000644000000000000000000000521613031036767015474 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} min (@var{X}) ## @defmethodx {@@infsupdec} min (@var{X}, @var{Y}) ## @defmethodx {@@infsupdec} min (@var{X}, [], @var{DIM}) ## ## Compute the minimum value chosen from intervals. ## ## This function does not return the least element of the interval (see ## @code{inf}), but returns an interval enclosure of the function: ## @display ## min (@var{x}, @var{y}) = ( (x + y) - abs (x - y) ) / 2 ## @end display ## ## With two arguments the function is applied element-wise. Otherwise the ## minimum is computed for all interval members along dimension @var{DIM}, ## which defaults to the first non-singleton dimension. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsupdec (2, 3); ## y = infsupdec (1, 2); ## min (x, y) ## @result{} ans = [1, 2]_com ## @end group ## @end example ## @seealso{@@infsupdec/max} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = min (x, y, dim) if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif switch (nargin) case 1 bare = min (x.infsup); case 2 if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif bare = min (x.infsup, y.infsup); case 3 if (not (builtin ("isempty", y))) warning ("min: second argument is ignored"); endif bare = min (x.infsup, [], dim); otherwise print_usage (); return endswitch result = newdec (bare); ## min is defined and continuous everywhere switch (nargin) case 1 result.dec = min (result.dec, min (x.dec)); case 2 warning ("off", "Octave:broadcast", "local"); result.dec = min (result.dec, min (x.dec, y.dec)); case 3 result.dec = min (result.dec, min (x.dec, [], dim)); endswitch endfunction %!# from the documentation string %!assert (isequal (min (infsupdec (2, 3), infsupdec (1, 2)), infsupdec (1, 2))); interval-2.1.0/inst/@infsupdec/mince.m0000644000000000000000000000354413031036767016006 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} mince (@var{X}) ## @defmethodx {@@infsupdec} mince (@var{X}, @var{N}) ## ## Mince interval @var{X} into a row vector of @var{N} sub-intervals of equal ## size. ## ## The sub-intervals are returned in ascending order and may overlap due to ## round-off errors. ## ## If @var{X} is not a scalar, the result is a matrix. The default value for ## @var{N} is 100. ## ## Accuracy: The result is an accurate enclosure. ## ## @example ## @group ## mince (infsupdec (0, 10), 4) ## @result{} ans = 1×4 interval vector ## ## [0, 2.5]_trv [2.5, 5]_trv [5, 7.5]_trv [7.5, 10]_trv ## @end group ## @end example ## @seealso{@@infsupdec/linspace, @@infsupdec/bisect} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-07-19 function result = mince (x, n) if (nargin > 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (nargin < 2) n = 100; endif result = infsupdec (mince (x.infsup, n), "trv"); result.dec = min (result.dec, x.dec); endfunction %!assert (isequal (mince (infsupdec (0, 10), 10), infsupdec (0 : 9, 1 : 10, "trv"))); interval-2.1.0/inst/@infsupdec/minus.m0000644000000000000000000000325713031036767016047 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} minus (@var{X}, @var{Y}) ## @defopx Operator {@@infsupdec} {@var{X} - @var{Y}} ## ## Subtract all numbers of interval @var{Y} from all numbers of @var{X}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsupdec (2, 3); ## y = infsupdec (1, 2); ## x - y ## @result{} ans = [0, 2]_com ## @end group ## @end example ## @seealso{@@infsupdec/plus} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = minus (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif result = newdec (minus (x.infsup, y.infsup)); ## minus is defined and continuous everywhere result.dec = min (result.dec, min (x.dec, y.dec)); endfunction %!# from the documentation string %!assert (isequal (infsupdec (2, 3) - infsupdec (1, 2), infsupdec (0, 2))); interval-2.1.0/inst/@infsupdec/mldivide.m0000644000000000000000000000376113031036767016511 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} mldivide (@var{X}, @var{Y}) ## @defopx Operator {@@infsupdec} {@var{X} \ @var{Y}} ## ## Return the interval matrix left division of @var{X} and @var{Y}. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## infsupdec ([1, 0; 0, 2]) \ [2, 0; 0, 4] ## @result{} ans = 2×2 interval matrix ## [2]_trv [0]_trv ## [0]_trv [2]_trv ## @end group ## @end example ## @seealso{@@infsupdec/mtimes} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-01-31 function result = mldivide (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif ## Reverse operations should not carry decoration result = infsupdec (mldivide (x.infsup, y.infsup), "trv"); warning ("off", "Octave:broadcast", "local"); result.dec = min (result.dec, min (vec (min (x.dec, y.dec)))); endfunction %!# unique solution %!assert (isequal (infsupdec ([1, 0; 0, 2]) \ [2, 0; 0, 4], infsupdec ([2, 0; 0 2], "trv"))); %!# no solution %!assert (all (isempty (infsupdec ([1, 0; 2, 0]) \ [3; 0]))); %!# many solutions %!assert (isequal (infsupdec ([1, 0; 2, 0]) \ [4; 8], infsupdec ([4; -inf], [4; inf], "trv"))); interval-2.1.0/inst/@infsupdec/mpower.m0000644000000000000000000000503213031036767016216 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsup} mpower (@var{X}, @var{Y}) ## @defopx Operator {@@infsup} {@var{X} ^ @var{Y}} ## ## Return the matrix power operation of @var{X} raised to the @var{Y} power. ## ## If @var{X} is a scalar, this function and @code{power} are equivalent. ## Otherwise, @var{X} must be a square matrix and @var{Y} must be a single ## integer. ## ## Warning: This function is not defined by IEEE Std 1788-2015. ## ## Accuracy: The result is a valid enclosure. The result is tightest for ## @var{Y} in @{0, 1, 2@}. ## ## @example ## @group ## infsupdec (magic (3)) ^ 2 ## @result{} ans = 3×3 interval matrix ## [91]_com [67]_com [67]_com ## [67]_com [91]_com [67]_com ## [67]_com [67]_com [91]_com ## @end group ## @end example ## @seealso{@@infsupdec/pow, @@infsupdec/pown, @@infsupdec/pow2, @@infsupdec/pow10, @@infsupdec/exp} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-01-24 function result = mpower (x, y) if (nargin != 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (isscalar (x.dec)) ## Short-circuit for scalars result = power (x, y); return endif if (not (isreal (y)) || fix (y) ~= y) error ("interval:InvalidOperand", ... "mpower: only integral powers can be computed"); endif result = newdec (mpower (x.infsup, y)); if (y < 0) result.dec(:) = _trv (); elseif (y < 2) result.dec = x.dec; elseif (y == 2) warning ('off', 'Octave:broadcast', 'local'); result.dec = min (result.dec, min (min (x.dec, [], 1), ... min (x.dec, [], 2))); elseif (y > 2) result.dec = min (result.dec, min (vec (x.dec))); endif endfunction %!# from the documentation string %!assert (isequal (infsupdec (magic (3)) ^ 2, infsupdec (magic (3) ^ 2))); interval-2.1.0/inst/@infsupdec/mtimes.m0000644000000000000000000000612613031036767016210 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} mtimes (@var{X}, @var{Y}) ## @defopx Method {@@infsupdec} mtimes (@var{X}, @var{Y}, @var{ACCURACY}) ## @defopx Operator {@@infsupdec} {@var{X} * @var{Y}} ## ## Compute the interval matrix multiplication. ## ## The @var{ACCURACY} can be set to @code{tight} (default) or @code{valid}. ## With @code{valid} accuracy an algorithm for fast matrix multiplication based ## on BLAS routines is used. The latter is published by ## Siegried M. Rump (2012), “Fast interval matrix multiplication,” ## Numerical Algorithms 61(1), 1-34. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsupdec ([1, 2; 7, 15], [2, 2; 7.5, 15]); ## y = infsupdec ([3, 3; 0, 1], [3, 3.25; 0, 2]); ## x * y ## @result{} ans = 2×2 interval matrix ## [3, 6]_com [5, 10.5]_com ## [21, 22.5]_com [36, 54.375]_com ## @end group ## @end example ## @seealso{@@infsupdec/mrdivide} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-21 function result = mtimes (x, y, accuracy) if (nargin < 2 || nargin > 3 || (nargin == 3 && not (ischar (accuracy)))) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif ## null matrix input -> null matrix output if (isempty (x.dec) || isempty (y.dec)) if (size (x.dec, 2) ~= size (y.dec, 1)) error ("interval:InvalidOperand", ... "operator *: nonconformant arguments"); endif result = infsupdec (zeros (rows (x.dec), columns (y.dec))); return endif if (isscalar (x) || isscalar (y)) result = times (x, y); return endif if (nargin == 2) result = newdec (mtimes (x.infsup, y.infsup)); else result = newdec (mtimes (x.infsup, y.infsup, accuracy)); endif dec_x = min (x.dec, [], 2); dec_y = min (y.dec, [], 1); warning ('off', 'Octave:broadcast', 'local'); result.dec = min (result.dec, min (dec_x, dec_y)); endfunction %!assert (isequal (infsupdec ([1, 2; 7, 15], [2, 2; 7.5, 15], {"com", "def"; "dac", "com"}) * infsupdec ([3, 3; 0, 1], [3, 3.25; 0, 2]), infsupdec ([3, 5; 21, 36], [6, 10.5; 22.5, 54.375], {"def", "def"; "dac", "dac"}))); %!# from the documentation string %!assert (isequal (infsupdec ([1, 2; 7, 15], [2, 2; 7.5, 15]) * infsupdec ([3, 3; 0, 1], [3, 3.25; 0, 2]), infsupdec ([3, 5; 21, 36], [6, 10.5; 22.5, 54.375]))); interval-2.1.0/inst/@infsupdec/mulrev.m0000644000000000000000000000763613031036767016233 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{X} =} mulrev (@var{B}, @var{C}, @var{X}) ## @deftypemethodx {@@infsupdec} {@var{X} =} mulrev (@var{B}, @var{C}) ## @deftypemethodx {@@infsupdec} {[@var{U}, @var{V}] =} mulrev (@var{B}, @var{C}) ## @deftypemethodx {@@infsupdec} {[@var{U}, @var{V}] =} mulrev (@var{B}, @var{C}, @var{X}) ## ## Compute the reverse multiplication function or the two-output division. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{x .* b ∈ @var{C}} for any @code{b ∈ @var{B}}. ## ## This function is similar to interval division @code{@var{C} ./ @var{B}}. ## However, it treats the case 0/0 as “any real number” instead of “undefined”. ## ## Interval division, considered as a set, can have zero, one or two disjoint ## connected components as a result. If called with two output parameters, ## this function returns the components separately. @var{U} contains the ## negative or unique component, whereas @var{V} contains the positive ## component in cases with two components. ## ## Accuracy: The result is a tight enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## No one way of decorating this operations gives useful information in all ## contexts. Therefore, the result will carry a @code{trv} decoration at best. ## ## @example ## @group ## c = infsupdec (1); ## b = infsupdec (-inf, inf); ## [u, v] = mulrev (b, c) ## @result{} ## u = [-Inf, 0]_trv ## v = [0, Inf]_trv ## @end group ## @end example ## @seealso{@@infsupdec/times} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function [u, v] = mulrev (b, c, x) if (nargin < 2 || nargin > 3) print_usage (); return endif if (nargin < 3) x = infsupdec (-inf, inf); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif if (not (isa (c, "infsupdec"))) c = infsupdec (c); endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (nargout < 2) u = mulrev (b.infsup, c.infsup, x.infsup); u = infsupdec (u, "trv"); u.dec(isnai (x) | isnai (b) | isnai (c)) = _ill (); else [u, v] = mulrev (b.infsup, c.infsup, x.infsup); u = newdec (u); u.dec(isempty (b) | isempty (c) | ismember (0, b)) = _trv (); u.dec = min (u.dec, min (b.dec, c.dec)); u.dec(isnai (x)) = _ill (); v = infsupdec (v, "trv"); v.dec(isnai (x) | isnai (b) | isnai (c)) = _ill (); endif endfunction %!# IEEE Std 1788-2015 mulRevToPair examples %!test %! [u, v] = mulrev (infsupdec (0), infsupdec (1, 2)); %! assert (isempty (u) & isempty (v)); %!test %! [u, v] = mulrev (infsupdec (0), infsupdec (0, 1)); %! assert (isentire (u) & isempty (v)); %!test %! [u, v] = mulrev (infsupdec (1), infsupdec (1, 2)); %! assert (isequal (u, infsupdec (1, 2)) & isempty (v)); %!test %! [u, v] = mulrev (infsupdec (1, inf), infsupdec (1)); %! assert (isequal (u, infsupdec (0, 1, "dac")) & isempty (v)); %!test %! [u, v] = mulrev (infsupdec (-1, 1), infsupdec (1, 2)); %! assert (isequal (u, infsupdec (-inf, -1, "trv")) & isequal (v, infsupdec (1, inf, "trv"))); %!test %! [u, v] = mulrev (infsupdec (-inf, inf), infsupdec (1)); %! assert (isequal (u, infsupdec (-inf, 0, "trv")) & isequal (v, infsupdec (0, inf, "trv"))); interval-2.1.0/inst/@infsupdec/nextout.m0000644000000000000000000000322713031036767016417 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} nextout (@var{X}) ## ## Increases the interval's boundaries in each direction to the next number. ## ## This is the equivalent function to IEEE 754's nextDown and nextUp. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## The function is a set operation and the result carries the @code{trv} ## decoration at best. ## ## @example ## @group ## x = infsupdec (1); ## nextout (x) == infsupdec (1 - eps / 2, 1 + eps) ## @result{} ans = 1 ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-03 function result = nextout (x) if (nargin ~= 1) print_usage (); return endif result = infsupdec (nextout (x.infsup), "trv"); result.dec(isnai (x)) = _ill (); endfunction %!# from the documentation string %!test %! x = nextout (infsupdec (1)); %! assert (inf (x), 1 - eps / 2); %! assert (sup (x), 1 + eps); %! assert (decorationpart (x), {"trv"}); interval-2.1.0/inst/@infsupdec/nthroot.m0000644000000000000000000000347713031036767016415 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} nthroot (@var{X}, @var{N}) ## ## Compute the real n-th root of @var{X}. ## ## Accuracy: The result is a valid enclosure. The result is a tight ## enclosure for @var{n} ≥ -2. The result also is a tight enclosure if the ## reciprocal of @var{n} can be computed exactly in double-precision. ## @seealso{@@infsupdec/pown, @@infsupdec/pownrev, @@infsupdec/realsqrt, @@infsupdec/cbrt} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-20 function result = nthroot (x, n) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif result = newdec (nthroot (intervalpart (x), n)); ## nthroot is continuous everywhere, but not defined everywhere even = mod (n, 2) == 0; defined = (not (even) & (n > 0 | inf (x) > 0 | sup (x) < 0)) ... | (even & ((n > 0 & inf (x) >= 0) ... | (n < 0 & inf (x) > 0))); result.dec(not (defined)) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!assert (isequal (nthroot (infsupdec (25, 36), 2), infsupdec (5, 6))); interval-2.1.0/inst/@infsupdec/overlap.m0000644000000000000000000000646613031036767016371 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {[@var{STATE}, @var{BITMASK}] =} overlap(@var{A}, @var{B}) ## ## Extensively compare the positions of intervals @var{A} and @var{B} on the ## real number line. ## ## Return the @var{STATE} as a string and the @var{BITMASK} of the state as an ## uint16 number, which represents one of the 16 possible states by taking a ## value 2^i (i = 0 … 15). ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @table @asis ## @item @code{bothEmpty}, 2^0 ## Both intervals are empty ## @item @code{firstEmpty}, 2^1 ## Interval @var{A} is empty and @var{B} is not ## @item @code{secondEmpty}, 2^2 ## Interval @var{A} is not empty, but @var{B} is ## @item @code{before}, 2^3 ## [- - - @var{A} - - -]@ @ @ [- - - @var{B} - - -] ## @item @code{meets}, 2^4 ## [- - - @var{A} - - -][- - - @var{B} - - -] ## @*Interval @var{A}'s upper boundary equals interval @var{B}'s lower boundary ## and neither consists of a single point only. ## @item @code{overlaps}, 2^5 ## [- - - @var{A} - - - [= = =] - - - @var{B} - - -] ## @item @code{starts}, 2^6 ## [[= = = @var{A} = = =] - - - @var{B} - - -] ## @item @code{containedBy}, 2^7 ## [- - - @var{B} - - - [= = = @var{A} = = =] - - -] ## @item @code{finishes}, 2^8 ## [- - - @var{B} - - - [= = = @var{A} = = =]] ## @item @code{equals}, 2^9 ## Both intervals are equal (and not empty) ## @item @code{finishedBy}, 2^10 ## [- - - @var{A} - - - [= = = @var{B} = = =]] ## @item @code{contains}, 2^11 ## [- - - @var{A} - - - [= = = @var{B} = = =] - - -] ## @item @code{startedBy}, 2^12 ## [[= = = @var{B} = = =] - - - @var{A} - - -] ## @item @code{overlappedBy}, 2^13 ## [- - - @var{B} - - - [= = =] - - - @var{A} - - -] ## @item @code{metBy}, 2^14 ## [- - - @var{B} - - -][- - - @var{A} - - -] ## @*Interval @var{A}'s lower boundary equals interval @var{B}'s upper boundary ## and neither consists of a single point only. ## @item @code{after}, 2^15 ## [- - - @var{B} - - -]@ @ @ [- - - @var{A} - - -] ## @end table ## ## @seealso{@@infsupdec/eq, @@infsupdec/subset, @@infsupdec/interior, @@infsupdec/disjoint} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function [state, bitmask] = overlap (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif if (isnai (a) || isnai (b)) error ("interval:InvalidOperand", "interval comparison with NaI") endif [state, bitmask] = overlap (a.infsup, b.infsup); endfunction %!assert (overlap (infsupdec (1, 2), infsupdec (3, 4)), "before"); interval-2.1.0/inst/@infsupdec/plus.m0000644000000000000000000000324513031036767015674 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} plus (@var{X}, @var{Y}) ## @defopx Operator {@@infsupdec} {@var{X} + @var{Y}} ## ## Add all numbers of interval @var{X} to all numbers of @var{Y}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsupdec (2, 3); ## y = infsupdec (1, 2); ## x + y ## @result{} ans = [3, 5]_com ## @end group ## @end example ## @seealso{@@infsupdec/minus} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = plus (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif result = newdec (plus (x.infsup, y.infsup)); ## plus is continuous and defined everywhere result.dec = min (result.dec, min (x.dec, y.dec)); endfunction %!# from the documentation string %!assert (isequal (infsupdec (2, 3) + infsupdec (1, 2), infsupdec (3, 5))); interval-2.1.0/inst/@infsupdec/polyval.m0000644000000000000000000000400013031036767016365 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} polyval (@var{P}, @var{X}) ## ## Evaluate polynomial @var{P} with argument @var{X}. ## ## Horner's scheme is used to evaluate a first approximation. The result is ## improved with iterative refinement. ## ## Accuracy: The result is a tight enclosure for polynomials of degree 1 or ## less. For polynomials of higher degree the result is a valid enclosure. ## For @var{X} being no singleton interval, the algorithm suffers from the ## dependency problem. ## ## @example ## @group ## output_precision (16, 'local') ## polyval (infsupdec ([3 4 2 1]), 42) # 3x^3 + 4x^2 + 2x^1 + 1 | x = 42 ## @result{} [229405]_com ## polyval (infsupdec ([3 4 2 1]), "42?") # ... | x = 41.5 .. 42.5 ## @result{} [221393.125, 237607.875]_com ## @end group ## @end example ## @seealso{@@infsup/fzero} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-05-30 function result = polyval (p, x) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (p, "infsupdec"))) p = infsupdec (p); endif result = newdec (polyval (p.infsup, x.infsup)); result.dec = min (result.dec, min (min (p.dec), x.dec)); endfunction %!assert (isequal (polyval (infsupdec (3, "trv"), 0), infsupdec (3, "trv"))); interval-2.1.0/inst/@infsupdec/postpad.m0000644000000000000000000000463413031036767016366 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} postpad (@var{X}, @var{L}) ## @defmethodx {@@infsupdec} postpad (@var{X}, @var{L}, @var{C}) ## @defmethodx {@@infsupdec} postpad (@var{X}, @var{L}, @var{C}, @var{DIM}) ## ## Append the scalar interval value @var{C} to the interval vector @var{X} ## until it is of length @var{L}. If @var{C} is not given, a value of 0 is ## used. ## ## If @code{length (@var{X}) > L}, elements from the end of @var{X} are removed ## until an interval vector of length @var{L} is obtained. ## ## If @var{X} is an interval matrix, elements are appended or removed from each ## row or column. ## ## If the optional argument DIM is given, operate along this dimension. ## ## @example ## @group ## postpad (infsupdec (1 : 3), 5, 42) ## @result{} ans = 1×5 interval vector ## [1]_com [2]_com [3]_com [42]_com [42]_com ## @end group ## @end example ## @seealso{@@infsupdec/reshape, @@infsup/cat, @@infsupdec/prepad, @@infsupdec/resize} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-19 function x = postpad (x, len, c, dim) if (nargin < 2 || nargin > 4) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (nargin < 3) c = infsupdec (0); elseif (not (isa (c, "infsupdec"))) c = infsupdec (c); endif if (nargin < 4) if (isvector (x.dec) && not (isscalar (x.dec))) dim = find (size (x.dec) ~= 1, 1); else dim = 1; endif endif x.infsup = postpad (x.infsup, len, c.infsup, dim); x.dec = postpad (x.dec, len, c.dec, dim); endfunction %!assert (isequal (postpad (infsupdec (1:3), 4, 4), infsupdec (1:4))); %!assert (isequal (postpad (infsupdec (1:3), 2, 4), infsupdec (1:2))); interval-2.1.0/inst/@infsupdec/pow.m0000644000000000000000000000412413031036767015513 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} pow (@var{X}, @var{Y}) ## ## Compute the simple power function on intervals defined by ## @code{exp (@var{Y} * log (@var{X}))}. ## ## The function is only defined where @var{X} is positive or where @var{X} is ## zero and @var{Y} is positive. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## pow (infsupdec (5, 6), infsupdec (2, 3)) ## @result{} ans = [25, 216]_com ## @end group ## @end example ## @seealso{@@infsupdec/pown, @@infsupdec/pow2, @@infsupdec/pow10, @@infsupdec/exp, @@infsupdec/mpower} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = pow (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif result = newdec (pow (x.infsup, y.infsup)); ## pow is continuous everywhere (where it is defined), ## but defined for x > 0 or (x = 0 and y > 0) only persistent nonnegative = infsup (0, inf); domain = interior (x.infsup, nonnegative) | ... (subset (x.infsup, nonnegative) & interior (y.infsup, nonnegative)); result.dec(not (domain)) = _trv (); result.dec = min (result.dec, min (x.dec, y.dec)); endfunction %!# from the documentation string %!assert (isequal (pow (infsupdec (5, 6), infsupdec (2, 3)), infsupdec (25, 216))); interval-2.1.0/inst/@infsupdec/pow10.m0000644000000000000000000000271613031036767015661 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} pow10 (@var{X}) ## ## Compute @code{10^x} for all numbers in @var{X}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## pow10 (infsupdec (5)) ## @result{} ans = [1e+05]_com ## @end group ## @end example ## @seealso{@@infsupdec/log10, @@infsupdec/pow, @@infsupdec/pow2, @@infsupdec/exp} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = pow10 (x) if (nargin ~= 1) print_usage (); return endif result = newdec (pow10 (x.infsup)); ## pow10 is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (pow10 (infsupdec (5)), infsupdec (100000))); interval-2.1.0/inst/@infsupdec/pow2.m0000644000000000000000000000270013031036767015573 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} pow2 (@var{X}) ## ## Compute @code{2^x} for all numbers in @var{X}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## pow2 (infsupdec (5)) ## @result{} ans = [32]_com ## @end group ## @end example ## @seealso{@@infsupdec/log2, @@infsupdec/pow, @@infsupdec/pow10, @@infsupdec/exp} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = pow2 (x) if (nargin ~= 1) print_usage (); return endif result = newdec (pow2 (x.infsup)); ## pow2 is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (pow2 (infsupdec (5)), infsupdec (32))); interval-2.1.0/inst/@infsupdec/power.m0000644000000000000000000000574613031036767016055 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} power (@var{X}, @var{Y}) ## @defopx Operator {@@infsupdec} {@var{X} .^ @var{Y}} ## ## Compute the general power function on intervals, which is defined for ## (1) any positive base @var{X}; (2) @code{@var{X} = 0} when @var{Y} is ## positive; (3) negative base @var{X} together with integral exponent @var{Y}. ## ## This definition complies with the common complex valued power function, ## restricted to the domain where results are real, plus limit values where ## @var{X} is zero. The complex power function is defined by ## @code{exp (@var{Y} * log (@var{X}))} with initial branch of complex ## logarithm and complex exponential function. ## ## Warning: This function is not defined by IEEE Std 1788-2015. However, it ## has been published as “pow2” in O. Heimlich, M. Nehmeier, J. Wolff von ## Gudenberg. 2013. “Variants of the general interval power function.” ## Soft Computing. Volume 17, Issue 8, pp 1357–1366. ## Springer Berlin Heidelberg. DOI 10.1007/s00500-013-1008-8. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## infsupdec (-5, 6) .^ infsupdec (2, 3) ## @result{} ans = [-125, +216]_trv ## @end group ## @end example ## @seealso{@@infsupdec/pow, @@infsupdec/pown, @@infsupdec/pow2, @@infsupdec/pow10, @@infsupdec/exp} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-15 function result = power (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif result = newdec (power (x.infsup, y.infsup)); ## The general power function is continuous where it is defined domain = not (isempty (result)) & (... inf (x) > 0 | ... # defined for all x > 0 (inf (x) == 0 & inf (y) > 0) | ... # defined for x = 0 if y > 0 # defined for x < 0 only where y is integral (issingleton (y) & fix (inf (y)) == inf (y) & ... (inf (y) > 0 | not (ismember (0, x))))); # not defined for 0^0 result.dec(not (domain)) = _trv (); result.dec = min (result.dec, min (x.dec, y.dec)); endfunction %!# from the documentation string %!assert (isequal (infsupdec (-5, 6) .^ infsupdec (2, 3), infsupdec (-125, 216, "trv"))); interval-2.1.0/inst/@infsupdec/pown.m0000644000000000000000000000340113031036767015666 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} pown (@var{X}, @var{P}) ## ## Compute the monomial @code{x^@var{P}} for all numbers in @var{X}. ## ## Monomials are defined for all real numbers and the special monomial ## @code{@var{P} == 0} evaluates to @code{1} everywhere. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## pown (infsupdec (5, 6), 2) ## @result{} ans = [25, 36]_com ## @end group ## @end example ## @seealso{@@infsupdec/pow, @@infsupdec/pow2, @@infsupdec/pow10, @@infsupdec/exp} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = pown (x, p) if (nargin ~= 2) print_usage (); return endif result = newdec (pown (x.infsup, p)); ## x^P is undefined for x == 0 and P < 0 domain = p >= 0 | not (ismember (0, x)); result.dec(not (domain)) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (pown (infsupdec (5, 6), 2), infsupdec (25, 36))); %!assert (pown (infsupdec (-2, 1), 2) == infsupdec (0, 4)); interval-2.1.0/inst/@infsupdec/pownrev.m0000644000000000000000000000410213031036767016402 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{X} =} pownrev (@var{C}, @var{X}, @var{P}) ## @deftypemethodx {@@infsupdec} {@var{X} =} pownrev (@var{C}, @var{P}) ## ## Compute the reverse monomial @code{x^@var{P}}. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{pown (x, @var{P}) ∈ @var{C}}. ## ## Accuracy: The result is a valid enclosure. The result is a tight ## enclosure for @var{P} ≥ -2. The result also is a tight enclosure if the ## reciprocal of @var{P} can be computed exactly in double-precision. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## No one way of decorating this operations gives useful information in all ## contexts. Therefore, the result will carry a @code{trv} decoration at best. ## ## @seealso{@@infsupdec/pown} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = pownrev (c, x, p) if (nargin < 2 || nargin > 3) print_usage (); return endif if (nargin < 3) p = x; x = infsupdec (-inf, inf); endif if (not (isa (c, "infsupdec"))) c = infsupdec (c); endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif result = infsupdec (pownrev (c.infsup, x.infsup, p), "trv"); result.dec(isnai (c) | isnai (x)) = _ill (); endfunction %!assert (isequal (pownrev (infsupdec (25, 36), infsupdec (0, inf), 2), infsupdec (5, 6, "trv"))); interval-2.1.0/inst/@infsupdec/powrev1.m0000644000000000000000000000436213031036767016315 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{X} =} powrev1 (@var{B}, @var{C}, @var{X}) ## @deftypemethodx {@@infsupdec} {@var{X} =} powrev1 (@var{B}, @var{C}) ## ## Compute the reverse power function for the first parameter. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{pow (x, b) ∈ @var{C}} for any @code{b ∈ @var{B}}. ## ## Accuracy: The result is a valid enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## No one way of decorating this operations gives useful information in all ## contexts. Therefore, the result will carry a @code{trv} decoration at best. ## ## @example ## @group ## powrev1 (infsupdec (2, 5), infsupdec (3, 6)) ## @result{} ans ⊂ [1.2457, 2.4495]_trv ## @end group ## @end example ## @seealso{@@infsupdec/pow} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = powrev1 (b, c, x) if (nargin < 2 || nargin > 3) print_usage (); return endif if (nargin < 3) x = infsupdec (-inf, inf); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif if (not (isa (c, "infsup"))) c = infsupdec (c); endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif ## inverse power is not a point function result = infsupdec (powrev1 (b.infsup, c.infsup, x.infsup), "trv"); result.dec(isnai (x) | isnai (b) | isnai (c)) = _ill (); endfunction %!# from the documentation string %!assert (isequal (powrev1 (infsupdec (2, 5), infsupdec (3, 6)), infsupdec ("[0x1.3EE8390D43955, 0x1.3988E1409212Fp1]_trv"))); interval-2.1.0/inst/@infsupdec/powrev2.m0000644000000000000000000000437013031036767016315 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{Y} =} powrev2 (@var{A}, @var{C}, @var{Y}) ## @deftypemethodx {@@infsupdec} {@var{Y} =} powrev2 (@var{A}, @var{C}) ## ## Compute the reverse power function for the second parameter. ## ## That is, an enclosure of all @code{y ∈ @var{Y}} where ## @code{pow (a, y) ∈ @var{C}} for any @code{a ∈ @var{A}}. ## ## Accuracy: The result is a valid enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## No one way of decorating this operations gives useful information in all ## contexts. Therefore, the result will carry a @code{trv} decoration at best. ## ## @example ## @group ## powrev2 (infsupdec (2, 5), infsupdec (3, 6)) ## @result{} ans ⊂ [0.6826, 2.585]_trv ## @end group ## @end example ## @seealso{@@infsupdec/pow} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = powrev2 (a, c, y) if (nargin < 2 || nargin > 3) print_usage (); return endif if (nargin < 3) y = infsupdec (-inf, inf); endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (c, "infsupdec"))) c = infsupdec (c); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif ## inverse power is not a point function result = infsupdec (powrev2 (a.infsup, c.infsup, y.infsup), "trv"); result.dec(isnai (y) | isnai (a) | isnai (c)) = _ill (); endfunction %!# from the documentation string %!assert (isequal (powrev2 (infsupdec (2, 5), infsupdec (3, 6)), infsupdec ("[0x1.5D7E8F22BA886p-1, 0x1.4AE00D1CFDEB5p1]_trv"))); interval-2.1.0/inst/@infsupdec/precedes.m0000644000000000000000000000322113031036767016475 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} precedes (@var{A}, @var{B}) ## ## Evaluate precedes comparison on intervals. ## ## True, if @var{A} is left of @var{B}. The intervals may touch. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsupdec/eq, @@infsupdec/le, @@infsupdec/lt, @@infsupdec/gt, @@infsupdec/strictprecedes, @@infsupdec/subset, @@infsupdec/interior, @@infsupdec/disjoint} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = precedes (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif result = precedes (a.infsup, b.infsup); result(isnai (a) | isnai (b)) = false; endfunction %!assert (precedes (infsupdec (1, 2), infsupdec (2, 3))); %!assert (not (precedes (infsupdec (1, 2.1), infsupdec (1.9, 3)))); interval-2.1.0/inst/@infsupdec/prepad.m0000644000000000000000000000463413031036767016167 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} prepad (@var{X}, @var{L}) ## @defmethodx {@@infsupdec} prepad (@var{X}, @var{L}, @var{C}) ## @defmethodx {@@infsupdec} prepad (@var{X}, @var{L}, @var{C}, @var{DIM}) ## ## Prepend the scalar interval value @var{C} to the interval vector @var{X} ## until it is of length @var{L}. If @var{C} is not given, a value of 0 is ## used. ## ## If @code{length (@var{X}) > L}, elements from the beginning of @var{X} are ## removed until an interval vector of length @var{L} is obtained. ## ## If @var{X} is an interval matrix, elements are prepended or removed from ## each row or column. ## ## If the optional argument DIM is given, operate along this dimension. ## ## @example ## @group ## prepad (infsupdec (1 : 3), 5, 42) ## @result{} ans = 1×5 interval vector ## [42]_com [42]_com [1]_com [2]_com [3]_com ## @end group ## @end example ## @seealso{@@infsupdec/reshape, @@infsup/cat, @@infsupdec/postpad, @@infsupdec/resize} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-19 function x = prepad (x, len, c, dim) if (nargin < 2 || nargin > 4) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (nargin < 3) c = infsupdec (0); elseif (not (isa (c, "infsupdec"))) c = infsupdec (c); endif if (nargin < 4) if (isvector (x.dec) && not (isscalar (x.dec))) dim = find (size (x.dec) ~= 1, 1); else dim = 1; endif endif x.infsup = prepad (x.infsup, len, c.infsup, dim); x.dec = prepad (x.dec, len, c.dec, dim); endfunction %!assert (isequal (prepad (infsupdec (2:4), 4, 1), infsupdec (1:4))); %!assert (isequal (prepad (infsupdec (0:2), 2, 1), infsupdec (1:2))); interval-2.1.0/inst/@infsupdec/private/_com.m0000644000000000000000000000201513031036767017272 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defvr Constant _com ## Return numeric representation of the common decoration ## @end defvr ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-18 function d = _com () ## See IEEE Std 1788-2015 14.4 Interchange representations and encodings persistent d = uint8 (16); endfunction interval-2.1.0/inst/@infsupdec/private/_dac.m0000644000000000000000000000203513031036767017245 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defvr Constant _dac ## Return numeric representation of the defined-and-continuous decoration ## @end defvr ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-18 function d = _dac () ## See IEEE Std 1788-2015 14.4 Interchange representations and encodings persistent d = uint8 (12); endfunction interval-2.1.0/inst/@infsupdec/private/_def.m0000644000000000000000000000201513031036767017252 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defvr Constant _def ## Return numeric representation of the defined decoration ## @end defvr ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-18 function d = _def () ## See IEEE Std 1788-2015 14.4 Interchange representations and encodings persistent d = uint8 (8); endfunction interval-2.1.0/inst/@infsupdec/private/_ill.m0000644000000000000000000000202013031036767017270 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defvr Constant _ill ## Return numeric representation of the ill-formed decoration ## @end defvr ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-18 function d = _ill () ## See IEEE Std 1788-2015 14.4 Interchange representations and encodings persistent d = uint8 (0); endfunction interval-2.1.0/inst/@infsupdec/private/_trv.m0000644000000000000000000000201513031036767017327 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defvr Constant _trv ## Return numeric representation of the trivial decoration ## @end defvr ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-18 function d = _trv () ## See IEEE Std 1788-2015 14.4 Interchange representations and encodings persistent d = uint8 (4); endfunction interval-2.1.0/inst/@infsupdec/prod.m0000644000000000000000000000334013031036767015651 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} prod (@var{X}) ## @defmethodx {@@infsupdec} prod (@var{X}, @var{DIM}) ## ## Product of elements along dimension @var{DIM}. If @var{DIM} is omitted, it ## defaults to the first non-singleton dimension. ## ## Accuracy: The result is a valid enclosure. ## ## @example ## @group ## prod (infsupdec (1 : 4)) ## @result{} ans = [24]_com ## @end group ## @end example ## @seealso{@@infsupdec/sum} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-10-24 function result = prod (x, dim) if (nargin > 2) print_usage (); return endif if (nargin < 2) ## Try to find non-singleton dimension dim = find (size (x.dec) > 1, 1); if (isempty (dim)) dim = 1; endif endif result = newdec (prod (x.infsup, dim)); if (not (isempty (x.dec))) warning ("off", "Octave:broadcast", "local"); result.dec = min (result.dec, min (x.dec, [], dim)); endif endfunction %!# from the documentation string %!assert (prod (infsupdec (1 : 4)) == 24); interval-2.1.0/inst/@infsupdec/psi.m0000644000000000000000000000556213031036767015510 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} psi (@var{X}) ## ## Compute the digamma function, also known as the psi function. ## ## @tex ## $$ ## {\rm psi} (x) = \int_0^\infty \left( {{\exp(-t)} \over t} - {{\exp (-xt)} \over {1 - \exp (-t)}} \right) dt ## $$ ## @end tex ## @ifnottex ## @group ## @verbatim ## ∞ ## / exp (-t) exp (-xt) ## psi (x) = | ---------- - -------------- dt ## / t 1 - exp (-t) ## 0 ## @end verbatim ## @end group ## @end ifnottex ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## psi (infsupdec (1)) ## @result{} ans ⊂ [-0.57722, -0.57721]_com ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-28 function result = psi (x) if (nargin ~= 1) print_usage (); return endif if (isnai (x)) result = x; return endif result = newdec (psi (x.infsup)); ## psi is continuous where it is defined undefined = (inf (x) <= 0 & fix (inf (x)) == inf (x)) | ... (sup (x) <= 0 & fix (sup (x)) == sup (x)) | ... (inf (x) < 0 & ceil (inf (x)) <= floor (sup (x))); result.dec(undefined) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!assert (isempty (psi (infsupdec (0)))); %!assert (isempty (psi (infsupdec (-1)))); %!assert (isempty (psi (infsupdec (-2)))); %!assert (isempty (psi (infsupdec (-3)))); %!assert (isequal (psi (infsupdec (pow2 (-1074), inf)), infsupdec ("[Entire]_dac"))); %!assert (isequal (psi (infsupdec (0, inf)), infsupdec ("[Entire]_trv"))); %!assert (isequal (psi (infsupdec (-inf, -43.23)), infsupdec ("[Entire]_trv"))); %!assert (isequal (psi (infsupdec (-1, 0)), infsupdec ("[Entire]_trv"))); %!assert (isequal (psi (infsupdec (-2, -1)), infsupdec ("[Entire]_trv"))); %!assert (isequal (psi (infsupdec (-eps, eps)), infsupdec ("[Entire]_trv"))); %!assert (isequal (psi (infsupdec (-1-eps, -1+eps)), infsupdec ("[Entire]_trv"))); %!assert (isequal (psi (infsupdec (-4.1, -3.9)), infsupdec ("[Entire]_trv"))); %!# from the documentation string %!assert (isequal (psi (infsupdec (1)), infsupdec ("[-0x1.2788CFC6FB619p-1, -0x1.2788CFC6FB618p-1]_com"))); interval-2.1.0/inst/@infsupdec/rdivide.m0000644000000000000000000000377413031036767016346 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} rdivide (@var{X}, @var{Y}) ## @defopx Operator {@@infsupdec} {@var{X} ./ @var{Y}} ## ## Divide all numbers of interval @var{X} by all numbers of @var{Y}. ## ## For @var{X} = 1 compute the reciprocal of @var{Y}. Thus this function can ## compute @code{recip} as defined by IEEE Std 1788-2015. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsupdec (2, 3); ## y = infsupdec (1, 2); ## x ./ y ## @result{} ans = [1, 3]_com ## @end group ## @end example ## @seealso{@@infsupdec/mtimes} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = rdivide (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif result = newdec (rdivide (x.infsup, y.infsup)); divisionbyzero = ismember (0, y); if (not (size_equal (x.dec, y.dec))) divisionbyzero = divisionbyzero & true (size (x.dec)); endif result.dec(divisionbyzero) = _trv (); result.dec = min (result.dec, min (x.dec, y.dec)); endfunction %!# from the documentation string %!assert (isequal (infsupdec (2, 3) ./ infsupdec (1, 2), infsupdec (1, 3))); %!assert (1 ./ infsupdec (1, 4) == infsupdec (0.25, 1));interval-2.1.0/inst/@infsupdec/realsqrt.m0000644000000000000000000000321313031036767016541 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} realsqrt (@var{X}) ## ## Compute the square root (for all non-negative numbers). ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## realsqrt (infsupdec (-6, 4)) ## @result{} ans = [0, 2]_trv ## @end group ## @end example ## @seealso{@@infsupdec/sqr, @@infsupdec/rsqrt, @@infsupdec/pow, @@infsupdec/cbrt, @@infsupdec/nthroot} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = realsqrt (x) if (nargin ~= 1) print_usage (); return endif result = newdec (realsqrt (x.infsup)); ## realsqrt is continuous everywhere, but defined for x >= 0 only persistent domain = infsup (0, inf); defined = subset (x.infsup, domain); result.dec(not (defined)) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (realsqrt (infsupdec (-6, 4)), infsupdec (0, 2, "trv"))); interval-2.1.0/inst/@infsupdec/reshape.m0000644000000000000000000000415213031036767016336 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} reshape (@var{A}, @var{M}, @var{N}) ## @defmethodx {@@infsupdec} reshape (@var{X}, [@var{M} @var{N}]) ## ## Return an interval matrix with the specified dimensions (M, N) whose ## elements are taken from the interval matrix @var{A}. The elements of the ## matrix are accessed in column-major order (like Fortran arrays are stored). ## ## Note that the total number of elements in the original matrix ## (@code{prod (size (@var{A}))}) must match the total number of elements in ## the new matrix (@code{prod ([@var{M} @var{N}])}). ## ## @example ## @group ## reshape (infsupdec (1 : 6), 2, 3) ## @result{} ans = 2×3 interval matrix ## [1]_com [3]_com [5]_com ## [2]_com [4]_com [6]_com ## @end group ## @end example ## @seealso{@@infsupdec/resize, @@infsup/cat, @@infsupdec/postpad, @@infsupdec/prepad} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-19 function x = reshape (x, m, n) if (not (isa (x, "infsupdec"))) print_usage (); return endif switch nargin case 2 x.infsup = reshape (x.infsup, m); x.dec = reshape (x.dec, m); case 3 x.infsup = reshape (x.infsup, m, n); x.dec = reshape (x.dec, m, n); otherwise print_usage (); return endswitch endfunction %!assert (isequal (reshape (infsupdec (1 : 6), 2, 3), infsupdec (reshape (1 : 6, 2, 3)))); interval-2.1.0/inst/@infsupdec/resize.m0000644000000000000000000000474113031036767016214 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} resize (@var{X}, @var{M}) ## @defmethodx {@@infsupdec} resize (@var{X}, @var{M}, @var{N}) ## @defmethodx {@@infsupdec} resize (@var{X}, [@var{M} @var{N}]) ## ## Resize interval matrix @var{X} cutting off elements as necessary. ## ## In the result, element with certain indices is equal to the corresponding ## element of @var{X} if the indices are within the bounds of @var{X}; ## otherwise, the element is set to zero. ## ## If only @var{M} is supplied, and it is a scalar, the dimension of the result ## is @var{M}-by-@var{M}. If @var{M} and @var{N} are all scalars, then the ## dimensions of the result are @var{M}-by-@var{N}. If given a vector as ## input, then the dimensions of the result are given by the elements of that ## vector. ## ## @example ## @group ## resize (infsupdec (magic (3)), 4, 2) ## @result{} ans = 4×2 interval matrix ## [8]_com [1]_com ## [3]_com [5]_com ## [4]_com [9]_com ## [0]_com [0]_com ## @end group ## @end example ## @seealso{@@infsupdec/reshape, @@infsup/cat, @@infsupdec/postpad, @@infsupdec/prepad} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-19 function x = resize (x, m, n) if (not (isa (x, "infsupdec"))) print_usage (); return endif x.dec(x.dec == 0) = uint8 (255); switch nargin case 2 x.infsup = resize (x.infsup, m); x.dec = resize (x.dec, m); case 3 x.infsup = resize (x.infsup, m, n); x.dec = resize (x.dec, m, n); otherwise print_usage (); return endswitch x.dec(x.dec == 0) = _com (); # any new elements are [0]_com x.dec(x.dec == uint8 (255)) = uint8 (0); endfunction %!assert (isequal (resize (infsupdec (magic (3)), 4, 2), infsupdec([8, 1; 3, 5; 4, 9; 0, 0]))); interval-2.1.0/inst/@infsupdec/round.m0000644000000000000000000000662713031036767016047 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} round (@var{X}) ## ## Round each number in interval @var{X} to the nearest integer. Ties are ## rounded away from zero (towards +Inf or -Inf depending on the sign). ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## round (infsupdec (2.5, 3.5)) ## @result{} ans = [3, 4]_def ## round (infsupdec (-0.5, 5)) ## @result{} ans = [-1, +5]_def ## @end group ## @end example ## @seealso{@@infsupdec/floor, @@infsupdec/ceil, @@infsupdec/roundb, @@infsupdec/fix} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = round (x) if (nargin ~= 1) print_usage (); return endif result = newdec (round (x.infsup)); ## Round is like a scaled fix function discontinuous = not (issingleton (result)); result.dec(discontinuous) = min (result.dec(discontinuous), _def ()); onlyrestrictioncontinuous = issingleton (result) & not (... (sup (x) >= 0 | ... fix (sup (x)) == sup (x) | fix (sup (x) * 2) / 2 ~= sup (x)) & ... (inf (x) <= 0 | ... fix (inf (x)) == inf (x) | fix (inf (x) * 2) / 2 ~= inf (x))); result.dec(onlyrestrictioncontinuous) = ... min (result.dec(onlyrestrictioncontinuous), _dac ()); result.dec = min (result.dec, x.dec); endfunction %!# Empty interval %!assert (isequal (round (infsupdec ()), infsupdec ())); %!# Singleton intervals %!assert (isequal (round (infsupdec (0)), infsupdec (0))); %!assert (isequal (round (infsupdec (0.5)), infsupdec (1, "dac"))); %!assert (isequal (round (infsupdec (0.25)), infsupdec (0))); %!assert (isequal (round (infsupdec (0.75)), infsupdec (1))); %!assert (isequal (round (infsupdec (-0.5)), infsupdec (-1, "dac"))); %!# Bounded intervals %!assert (isequal (round (infsupdec (-0.5, 0)), infsupdec (-1, 0, "def"))); %!assert (isequal (round (infsupdec (0, 0.5)), infsupdec (0, 1, "def"))); %!assert (isequal (round (infsupdec (0.25, 0.5)), infsupdec (0, 1, "def"))); %!assert (isequal (round (infsupdec (-1, 0)), infsupdec (-1, 0, "def"))); %!assert (isequal (round (infsupdec (-1, 1)), infsupdec (-1, 1, "def"))); %!assert (isequal (round (infsupdec (-realmin, realmin)), infsupdec (0))); %!assert (isequal (round (infsupdec (-realmax, realmax)), infsupdec (-realmax, realmax, "def"))); %!# Unbounded intervals %!assert (isequal (round (infsupdec (-realmin, inf)), infsupdec (0, inf, "def"))); %!assert (isequal (round (infsupdec (-realmax, inf)), infsupdec (-realmax, inf, "def"))); %!assert (isequal (round (infsupdec (-inf, realmin)), infsupdec (-inf, 0, "def"))); %!assert (isequal (round (infsupdec (-inf, realmax)), infsupdec (-inf, realmax, "def"))); %!assert (isequal (round (infsupdec (-inf, inf)), infsupdec (-inf, inf, "def"))); interval-2.1.0/inst/@infsupdec/roundb.m0000644000000000000000000000674013031036767016205 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} roundb (@var{X}) ## ## Round each number in interval @var{X} to the nearest integer. Ties are ## rounded towards the nearest even integer. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## roundb (infsupdec (2.5, 3.5)) ## @result{} ans = [2, 4]_def ## roundb (infsupdec (-0.5, 5.5)) ## @result{} ans = [0, 6]_def ## @end group ## @end example ## @seealso{@@infsupdec/floor, @@infsupdec/ceil, @@infsupdec/round, @@infsupdec/fix} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = roundb (x) if (nargin ~= 1) print_usage (); return endif result = newdec (roundb (x.infsup)); discontinuous = not (issingleton (result)); result.dec(discontinuous) = min (result.dec(discontinuous), _def ()); onlyrestrictioncontinuous = issingleton (result) & not (... (rem (inf (result), 2) ~= 0 | ... ((fix (sup (x)) == sup (x) | fix (sup (x) * 2) / 2 ~= sup (x)) & ... (fix (inf (x)) == inf (x) | fix (inf (x) * 2) / 2 ~= inf (x))))); result.dec(onlyrestrictioncontinuous) = ... min (result.dec(onlyrestrictioncontinuous), _dac ()); result.dec = min (result.dec, x.dec); endfunction %!# Empty interval %!assert (isequal (roundb (infsupdec ()), infsupdec ())); %!# Singleton intervals %!assert (isequal (roundb (infsupdec (0)), infsupdec (0))); %!assert (isequal (roundb (infsupdec (0.5)), infsupdec (0, "dac"))); %!assert (isequal (roundb (infsupdec (0.25)), infsupdec (0))); %!assert (isequal (roundb (infsupdec (0.75)), infsupdec (1))); %!assert (isequal (roundb (infsupdec (1.5)), infsupdec (2, "dac"))); %!assert (isequal (roundb (infsupdec (-0.5)), infsupdec (0, "dac"))); %!assert (isequal (roundb (infsupdec (-1.5)), infsupdec (-2, "dac"))); %!# Bounded intervals %!assert (isequal (roundb (infsupdec (-0.5, 0)), infsupdec (0, "dac"))); %!assert (isequal (roundb (infsupdec (0, 0.5)), infsupdec (0, "dac"))); %!assert (isequal (roundb (infsupdec (0.25, 0.5)), infsupdec (0, "dac"))); %!assert (isequal (roundb (infsupdec (-1, 0)), infsupdec (-1, 0, "def"))); %!assert (isequal (roundb (infsupdec (-1, 1)), infsupdec (-1, 1, "def"))); %!assert (isequal (roundb (infsupdec (-realmin, realmin)), infsupdec (0))); %!assert (isequal (roundb (infsupdec (-realmax, realmax)), infsupdec (-realmax, realmax, "def"))); %!# Unbounded intervals %!assert (isequal (roundb (infsupdec (-realmin, inf)), infsupdec (0, inf, "def"))); %!assert (isequal (roundb (infsupdec (-realmax, inf)), infsupdec (-realmax, inf, "def"))); %!assert (isequal (roundb (infsupdec (-inf, realmin)), infsupdec (-inf, 0, "def"))); %!assert (isequal (roundb (infsupdec (-inf, realmax)), infsupdec (-inf, realmax, "def"))); %!assert (isequal (roundb (infsupdec (-inf, inf)), infsupdec (-inf, inf, "def"))); interval-2.1.0/inst/@infsupdec/rsqrt.m0000644000000000000000000000307113031036767016061 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} rsqrt (@var{X}) ## ## Compute the reciprocal square root (for all positive numbers). ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## rsqrt (infsupdec (-6, 4)) ## @result{} ans = [0.5, Inf]_trv ## @end group ## @end example ## @seealso{@@infsupdec/realsqrt} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function result = rsqrt (x) if (nargin ~= 1) print_usage (); return endif result = newdec (rsqrt (x.infsup)); ## rsqrt is continuous everywhere, but defined for x > 0 only persistent domain_hull = infsup (0, inf); result.dec(not (interior (x.infsup, domain_hull))) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (rsqrt (infsupdec (-6, 4)), infsupdec (.5, inf, "trv"))); interval-2.1.0/inst/@infsupdec/sec.m0000644000000000000000000000320313031036767015455 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} sec (@var{X}) ## ## Compute the secant in radians, that is the reciprocal cosine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sec (infsupdec (1)) ## @result{} ans ⊂ [1.8508, 1.8509]_com ## @end group ## @end example ## @seealso{@@infsupdec/cos, @@infsupdec/csc, @@infsupdec/cot} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function result = sec (x) if (nargin ~= 1) print_usage (); return endif result = newdec (sec (x.infsup)); ## Because sec (nextdown (pi/2)) < realmax, we can simple check for ## a singularity by comparing the result with entire. domain = not (isentire (result)); result.dec(not (domain)) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (sec (infsupdec (1)), infsupdec ("[0x1.D9CF0F125CC29, 0x1.D9CF0F125CC2A]_com"))); interval-2.1.0/inst/@infsupdec/sech.m0000644000000000000000000000301113031036767015622 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} sech (@var{X}) ## ## Compute the hyperbolic secant, that is the reciprocal hyperbolic cosine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sech (infsupdec (1)) ## @result{} ans ⊂ [0.64805, 0.64806]_com ## @end group ## @end example ## @seealso{@@infsupdec/cosh, @@infsupdec/csch, @@infsupdec/coth} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-15 function result = sech (x) if (nargin ~= 1) print_usage (); return endif result = newdec (sech (x.infsup)); ## sech is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (sech (infsupdec (1)), infsupdec ("[0x1.4BCDC50ED6BE7p-1, 0x1.4BCDC50ED6BE8p-1]_com"))); interval-2.1.0/inst/@infsupdec/setdiff.m0000644000000000000000000000421713031036767016335 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} setdiff (@var{A}, @var{B}) ## ## Build the relative complement of interval @var{B} in interval @var{A}. ## ## Accuracy: The result is a tight enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## The function is a set operation and the result carries the @code{trv} ## decoration at best. ## ## @example ## @group ## x = infsupdec (1, 3); ## y = infsupdec (2, 4); ## setdiff (x, y) ## @result{} ans = [1, 2]_trv ## @end group ## @end example ## @seealso{@@infsupdec/intersect, @@infsupdec/union, @@infsupdec/setxor} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-03 function result = setdiff (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif result = infsupdec (setdiff (a.infsup, b.infsup), "trv"); result.dec(isnai (a) | isnai (b)) = _ill (); endfunction %!assert (isempty (setdiff (infsupdec (), infsupdec (1, 4)))); %!assert (setdiff (infsupdec (1, 3), infsupdec ()) == infsupdec (1, 3)); %!assert (isempty (setdiff (infsupdec (1, 3), infsupdec (-inf, inf)))); %!assert (isempty (setdiff (infsupdec (1, 3), infsupdec (1, 4)))); %!assert (setdiff (infsupdec (-inf, inf), infsupdec (1, 4)) == infsupdec (-inf, inf)); %!# from the documentation string %!assert (setdiff (infsupdec (1, 3), infsupdec (2, 4)) == infsupdec (1, 2)); interval-2.1.0/inst/@infsupdec/setxor.m0000644000000000000000000000635313031036767016240 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {} setxor (@var{A}, @var{B}) ## @deftypemethodx {@@infsupdec} {[@var{C}, @var{C1}, @var{C2}] =} setxor (@var{A}, @var{B}) ## ## Build the symmetric difference of intervals @var{A} and @var{B}. ## ## With three output arguments, return intervals @var{C1} and @var{C2} such ## that @var{C1} and @var{C2} are enclosures of disjoint sets whose union is ## enclosed by interval @var{C}. ## ## Accuracy: The result is a tight enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## The function is a set operation and the result carries the @code{trv} ## decoration at best. ## ## @example ## @group ## x = infsupdec (1, 3); ## y = infsupdec (2, 4); ## [z, z1, z2] = setxor (x, y) ## @result{} ## z = [1, 4]_trv ## z1 = [1, 2]_trv ## z2 = [3, 4]_trv ## @end group ## @end example ## @seealso{@@infsupdec/intersect, @@infsupdec/union, @@infsupdec/setdiff} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-04-03 function [c, c1, c2] = setxor (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif if (nargout > 1) [c, c1, c2] = setxor (a.infsup, b.infsup); c1 = infsupdec (c1, "trv"); c2 = infsupdec (c2, "trv"); c1.dec(isnai (a) | isnai (b)) = c2.dec(isnai (a) | isnai (b)) = _ill (); else c = setxor (a.infsup, b.infsup); endif c = infsupdec (c, "trv"); c.dec(isnai (a) | isnai (b)) = _ill (); endfunction %!test %! [z, z1, z2] = setxor (infsupdec (), infsupdec ()); %! assert (isempty (z)); %! assert (isempty (z1)); %! assert (isempty (z2)); %!test %! [z, z1, z2] = setxor (infsupdec (-inf, inf), infsupdec ()); %! assert (isentire (z)); %! assert (isentire (z1)); %! assert (isempty (z2)); %!test %! [z, z1, z2] = setxor (infsupdec (-inf, inf), infsupdec (2)); %! assert (isentire (z)); %! assert (z1 == infsupdec (-inf, 2)); %! assert (z2 == infsupdec (2, inf)); %!test %! [z, z1, z2] = setxor (infsupdec (2, 3), infsupdec (2)); %! assert (z == infsupdec (2, 3)); %! assert (z1 == infsupdec ()); %! assert (z2 == infsupdec (2, 3)); %!test %! [z, z1, z2] = setxor (infsupdec (2, 3), infsupdec (2, 2.5)); %! assert (z == infsupdec (2.5, 3)); %! assert (z1 == infsupdec ()); %! assert (z2 == infsupdec (2.5, 3)); %!test %! # from the documentation string %! [z, z1, z2] = setxor (infsupdec (1, 3), infsupdec (2, 4)); %! assert (z == infsupdec (1, 4)); %! assert (z1 == infsupdec (1, 2)); %! assert (z2 == infsupdec (3, 4)); interval-2.1.0/inst/@infsupdec/sign.m0000644000000000000000000000373213031036767015652 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} sign (@var{X}) ## ## Compute the signum function for each number in interval @var{X}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sign (infsupdec (2, 3)) ## @result{} ans = [1]_com ## sign (infsupdec (0, 5)) ## @result{} ans = [0, 1]_def ## sign (infsupdec (-17)) ## @result{} ans = [-1]_com ## @end group ## @end example ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = sign (x) if (nargin ~= 1) print_usage (); return endif result = newdec (sign (x.infsup)); ## sign is defined everywhere and continuous for x ~= 0 discontinuous = not (issingleton (result)); result.dec(discontinuous) = min (result.dec(discontinuous), _def ()); onlyrestrictioncontinuous = inf (x) == 0 & sup (x) == 0; result.dec(onlyrestrictioncontinuous) = ... min (result.dec(onlyrestrictioncontinuous), _dac ()); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (sign (infsupdec (2, 3)), infsupdec (1))); %!assert (isequal (sign (infsupdec (0)), infsupdec (0, "dac"))); %!assert (isequal (sign (infsupdec (0, 5)), infsupdec (0, 1, "def"))); %!assert (isequal (sign (infsupdec (-17)), infsupdec (-1))); interval-2.1.0/inst/@infsupdec/sin.m0000644000000000000000000000272213031036767015501 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} sin (@var{X}) ## ## Compute the sine in radians. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sin (infsupdec (1)) ## @result{} ans ⊂ [0.84147, 0.84148]_com ## @end group ## @end example ## @seealso{@@infsupdec/asin, @@infsupdec/csc, @@infsupdec/sinh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = sin (x) if (nargin ~= 1) print_usage (); return endif result = newdec (sin (x.infsup)); ## sin is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (sin (infsupdec (1)), infsupdec ("[0x1.AED548F090CEEp-1, 0x1.AED548F090CEFp-1]"))); interval-2.1.0/inst/@infsupdec/sinh.m0000644000000000000000000000274413031036767015655 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} sinh (@var{X}) ## ## Compute the hyperbolic sine. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sinh (infsupdec (1)) ## @result{} ans ⊂ [1.1752, 1.1753]_com ## @end group ## @end example ## @seealso{@@infsupdec/asinh, @@infsupdec/csch, @@infsupdec/cosh, @@infsupdec/tanh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = sinh (x) if (nargin ~= 1) print_usage (); return endif result = newdec (sinh (x.infsup)); ## sinh is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (sinh (infsupdec (1)), infsupdec ("[0x1.2CD9FC44EB982, 0x1.2CD9FC44EB983]"))); interval-2.1.0/inst/@infsupdec/sinrev.m0000644000000000000000000000402513031036767016214 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{X} =} sinrev (@var{C}, @var{X}) ## @deftypemethodx {@@infsupdec} {@var{X} =} sinrev (@var{C}) ## ## Compute the reverse sine function. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{sin (x) ∈ @var{C}}. ## ## Accuracy: The result is a valid enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## No one way of decorating this operations gives useful information in all ## contexts. Therefore, the result will carry a @code{trv} decoration at best. ## ## @example ## @group ## sinrev (infsupdec (-1), infsupdec (0, 6)) ## @result{} ans ⊂ [4.7123, 4.7124]_trv ## @end group ## @end example ## @seealso{@@infsupdec/sin} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = sinrev (c, x) if (nargin > 2) print_usage (); return endif if (nargin < 2) x = infsupdec (-inf, inf); endif if (not (isa (c, "infsupdec"))) c = infsupdec (c); endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif result = infsupdec (sinrev (c.infsup, x.infsup), "trv"); result.dec(isnai (c) | isnai (x)) = _ill (); endfunction %!# from the documentation string %!assert (isequal (sinrev (infsupdec (-1), infsupdec (0, 6)), infsupdec ("[0x1.2D97C7F3321D2p2, 0x1.2D97C7F3321D3p2]_trv"))); interval-2.1.0/inst/@infsupdec/sqrrev.m0000644000000000000000000000371313031036767016233 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{X} =} sqrrev (@var{C}, @var{X}) ## @deftypemethodx {@@infsupdec} {@var{X} =} sqrrev (@var{C}) ## ## Compute the reverse square function. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{sqr (x) ∈ @var{C}}. ## ## Accuracy: The result is a tight enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## No one way of decorating this operations gives useful information in all ## contexts. Therefore, the result will carry a @code{trv} decoration at best. ## ## @example ## @group ## sqrrev (infsupdec (-2, 1)) ## @result{} ans = [-1, +1]_trv ## @end group ## @end example ## @seealso{@@infsupdec/sqr} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = sqrrev (c, x) if (nargin > 2) print_usage (); return endif if (nargin < 2) x = infsupdec (-inf, inf); endif if (not (isa (c, "infsupdec"))) c = infsupdec (c); endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif result = infsupdec (sqrrev (c.infsup, x.infsup), "trv"); result.dec(isnai (c) | isnai (x)) = _ill (); endfunction %!# from the documentation string %!assert (isequal (sqrrev (infsupdec (-2, 1)), infsupdec (-1, 1, "trv"))); interval-2.1.0/inst/@infsupdec/strictprecedes.m0000644000000000000000000000327413031036767017736 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} strictprecedes (@var{A}, @var{B}) ## ## Evaluate strict precedes comparison on intervals. ## ## True, if @var{A} is strictly left of @var{B}. The intervals may not touch. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsupdec/eq, @@infsupdec/le, @@infsupdec/lt, @@infsupdec/gt, @@infsupdec/precedes, @@infsupdec/subset, @@infsupdec/interior, @@infsupdec/disjoint} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = strictprecedes (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif result = strictprecedes (a.infsup, b.infsup); result(isnai(a) | isnai (b)) = false; endfunction %!assert (strictprecedes (infsupdec (1, 1.9), infsupdec (2.1, 3))); %!assert (not (strictprecedes (infsupdec (1, 2), infsupdec (2, 3)))); interval-2.1.0/inst/@infsupdec/strictsubset.m0000644000000000000000000000437313031036767017452 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} strictsubset (@var{A}, @var{B}) ## ## Evaluate strict subset comparison on intervals. ## ## True, if all numbers from @var{A} are also contained in @var{B} and @var{B} ## contains a number that is not in @var{A}. ## False, if @var{A} contains a number which is not a member in @var{B} or if ## @var{A} and @var{B} are equal. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsupdec/subset, @@infsupdec/eq, @@infsupdec/interior} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-05-16 function result = strictsubset (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif result = strictsubset (a.infsup, b.infsup); result(isnai (a) | isnai (b)) = false; endfunction %!assert (strictsubset (infsupdec (1, 2), infsupdec (1, 3))); %!assert (strictsubset (infsupdec (2, 3), infsupdec (1, 3))); %!assert (not (strictsubset (infsupdec (1, 2), infsupdec (1, 2)))); %!assert (not (strictsubset (infsupdec (1, 3), infsupdec (1, 2)))); %!assert (strictsubset (infsupdec (), infsupdec (1, 3))); %!assert (not (strictsubset (infsupdec (), infsupdec ()))); %!assert (strictsubset (infsupdec (), infsupdec (-inf, inf))); %!assert (strictsubset (infsupdec (0, inf), infsupdec (-inf, inf))); %!assert (strictsubset (infsupdec (-inf, 0), infsupdec (-inf, inf))); %!assert (not (strictsubset (infsupdec (-inf, inf), infsupdec (-inf, inf)))); interval-2.1.0/inst/@infsupdec/subsasgn.m0000644000000000000000000000411013031036767016526 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} subsasgn (@var{A}, @var{IDX}, @var{RHS}) ## @defopx Operator {@@infsupdec} {@var{A}(@var{SUBS}) = @var{RHS}} ## ## Perform the subscripted assignment operation according to the subscript ## specified by @var{IDX}. ## ## The subscript @var{IDX} is expected to be a structure array with fields ## @code{type} and @code{subs}. Only valid value for @var{type} is ## @code{"()"}. The @code{subs} field may be either @code{":"} or a cell array ## of index values. ## @seealso{@@infsupdec/subsref} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-11-02 function A = subsasgn (A, S, B) if (nargin ~= 3) print_usage (); return endif if (not (isa (A, "infsupdec"))) A = infsupdec (A); endif if (not (isa (B, "infsupdec"))) B = infsupdec (B); endif A.infsup = subsasgn (A.infsup, S, B.infsup); A.dec(A.dec == 0) = uint8 (255); B.dec(B.dec == 0) = uint8 (255); A.dec = subsasgn (A.dec, S, B.dec); A.dec(A.dec == 0) = _com (); # any new elements are [0]_com A.dec(A.dec == uint8 (255)) = uint8 (0); endfunction %!test %! A = infsupdec (magic (3)); %! A(4, 4) = 42; %! assert (inf (A), [magic(3),[0;0;0];0,0,0,42]); %! assert (sup (A), [magic(3),[0;0;0];0,0,0,42]); %! assert (decorationpart (A), {"com", "com", "com", "com"; "com", "com", "com", "com"; "com", "com", "com", "com"; "com", "com", "com", "com"}); interval-2.1.0/inst/@infsupdec/subset.m0000644000000000000000000000305713031036767016217 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} subset (@var{A}, @var{B}) ## ## Evaluate subset comparison on intervals. ## ## True, if all numbers from @var{A} are also contained in @var{B}. ## False, if @var{A} contains a number which is not a member in @var{B}. ## ## Evaluated on interval matrices, this functions is applied element-wise. ## ## @seealso{@@infsupdec/eq, @@infsupdec/interior, @@infsupdec/disjoint} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = subset (a, b) if (nargin ~= 2) print_usage (); return endif if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif result = subset (a.infsup, b.infsup); result(isnai (a) | isnai (b)) = false; endfunction %!assert (subset (infsupdec (1, 2), infsupdec (1, 3))); interval-2.1.0/inst/@infsupdec/subsref.m0000644000000000000000000000572313031036767016365 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} subsref (@var{A}, @var{IDX}) ## @defopx Operator {@@infsupdec} {@var{A}(@var{I})} ## @defopx Operator {@@infsupdec} {@var{A}(@var{I1}, @var{I2})} ## @defopx Operator {@@infsupdec} {@var{A}.@var{P}} ## ## Select property @var{P} or elements @var{I} from interval matrix @var{A}. ## ## The index @var{I} may be either @code{:} or an index matrix. ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## The property @var{P} may correspond to any unary method of the interval's ## class, but usually is either @code{inf}, @code{sup} or ## @code{decorationpart}. ## ## @example ## @group ## x = infsupdec (magic (3), magic (3) + 1); ## x (1) ## @result{} ans = [8, 9]_com ## x (:, 2) ## @result{} ans = 3×1 interval vector ## [1, 2]_com ## [5, 6]_com ## [9, 10]_com ## x.inf ## @result{} ans = ## 8 1 6 ## 3 5 7 ## 4 9 2 ## @end group ## @end example ## @seealso{@@infsupdec/subsasgn} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-11-02 function A = subsref (A, S) if (nargin ~= 2) print_usage (); return endif switch (S (1).type) case "()" A.infsup = subsref (A.infsup, S(1)); A.dec = subsref (A.dec, S(1)); case "{}" error ("interval cannot be indexed with {}") case "." if (any (strcmp (S(1).subs, methods ("infsupdec")))) functionname = ["@infsupdec", filesep(), S(1).subs]; elseif (any (strcmp (S(1).subs, methods ("infsup")))) functionname = ["@infsup", filesep(), S(1).subs]; else error (["interval property ‘", S(1).subs, "’ is unknown"]) endif if (nargin (functionname) ~= 1) error (["‘", S(1).subs, "’ is not a valid interval property"]) endif A = feval (S(1).subs, A); otherwise error ("invalid subscript type") endswitch if (numel (S) > 1) A = subsref (A, S(2 : end)); endif endfunction %!assert (isequal (infsupdec (magic (3))([1, 2, 3]), infsupdec (magic (3)([1, 2, 3])))); %!# from the documentation string %!test %! x = infsupdec (magic (3), magic (3) + 1); %! assert (x(1) == infsupdec (8, 9)); %! assert (x(:, 2) == infsupdec ([1; 5; 9], [2; 6; 10])); %! assert (x.inf, magic (3)); interval-2.1.0/inst/@infsupdec/sum.m0000644000000000000000000000357013031036767015516 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} sum (@var{X}) ## @defmethodx {@@infsupdec} sum (@var{X}, @var{DIM}) ## ## Sum of elements along dimension @var{DIM}. If @var{DIM} is omitted, it ## defaults to the first non-singleton dimension. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## sum ([infsupdec(1), pow2(-1074), -1]) ## @result{} ans ⊂ [4.9406e-324, 4.9407e-324]_com ## infsupdec (1) + pow2 (-1074) - 1 ## @result{} ans ⊂ [0, 2.2205e-16]_com ## @end group ## @end example ## @seealso{@@infsupdec/plus} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-01-31 function result = sum (x, dim) if (nargin > 2) print_usage (); return endif if (nargin < 2) ## Try to find non-singleton dimension dim = find (size (x.dec) > 1, 1); if (isempty (dim)) dim = 1; endif endif result = newdec (sum (x.infsup, dim)); if (not (isempty (x.dec))) warning ("off", "Octave:broadcast", "local"); result.dec = min (result.dec, min (x.dec, [], dim)); endif endfunction %!# from the documentation string %!assert (isequal (sum ([infsupdec(1), pow2(-1074), -1]), infsupdec (pow2 (-1074)))); interval-2.1.0/inst/@infsupdec/sup.m0000644000000000000000000000317113031036767015516 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} sup (@var{X}) ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## ## Get the (least) upper boundary for all numbers of interval @var{X}. ## ## If @var{X} is empty, @code{sup (@var{X})} is negative infinity. If @var{X} ## is NaI, @code{sup (@var{X})} is NaN. ## ## Accuracy: The result is exact. ## ## @example ## @group ## sup (infsupdec (2.5, 3.5)) ## @result{} ans = 3.5000 ## @end group ## @end example ## @seealso{@@infsupdec/inf, @@infsup/mid} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-09-18 function result = sup (x) if (nargin ~= 1) print_usage (); return endif result = sup (x.infsup); result(isnai (x)) = nan; endfunction %!assert (sup (infsupdec (2.5, 3.5)), 3.5); %!assert (sup (infsupdec ()), -inf); %!assert (sup (infsupdec ("[nai]")), nan); %!warning id=interval:UndefinedOperation %! assert (sup (infsupdec (3, 2)), nan); interval-2.1.0/inst/@infsupdec/tan.m0000644000000000000000000000312413031036767015467 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} tan (@var{X}) ## ## Compute the tangent in radians. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## tan (infsupdec (1)) ## @result{} ans ⊂ [1.5574, 1.5575]_com ## @end group ## @end example ## @seealso{@@infsupdec/atan, @@infsupdec/tanh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = tan (x) if (nargin ~= 1) print_usage (); return endif result = newdec (tan (x.infsup)); ## Because tan (nextdown (pi / 2)) < realmax, we can simple check for ## a singularity by comparing the result with entire. domain = not (isentire (result)); result.dec(not (domain)) = _trv (); result.dec = min (result.dec, x.dec); endfunction %!# from the documentation string %!assert (isequal (tan (infsupdec (1)), infsupdec ("[0x1.8EB245CBEE3A5, 0x1.8EB245CBEE3A6]"))); interval-2.1.0/inst/@infsupdec/tanh.m0000644000000000000000000000276513031036767015651 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} tanh (@var{X}) ## ## Compute the hyperbolic tangent. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## tanh (infsupdec (1)) ## @result{} ans ⊂ [0.76159, 0.7616]_com ## @end group ## @end example ## @seealso{@@infsupdec/atanh, @@infsupdec/coth, @@infsupdec/sinh, @@infsupdec/cosh} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = tanh (x) if (nargin ~= 1) print_usage (); return endif result = newdec (tanh (x.infsup)); ## tanh is defined and continuous everywhere result.dec = min (result.dec, x.dec); endfunction %!test "from the documentation string"; %! assert (isequal (tanh (infsupdec (1)), infsupdec ("[0x1.85EFAB514F394p-1, 0x1.85EFAB514F395p-1]"))); interval-2.1.0/inst/@infsupdec/tanrev.m0000644000000000000000000000376113031036767016213 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypemethod {@@infsupdec} {@var{X} =} tanrev (@var{C}, @var{X}) ## @deftypemethodx {@@infsupdec} {@var{X} =} tanrev (@var{C}) ## ## Compute the reverse tangent function. ## ## That is, an enclosure of all @code{x ∈ @var{X}} where ## @code{tan (x) ∈ @var{C}}. ## ## Accuracy: The result is a valid enclosure. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## No one way of decorating this operations gives useful information in all ## contexts. Therefore, the result will carry a @code{trv} decoration at best. ## ## @example ## @group ## tanrev (infsupdec (0), infsupdec (2, 4)) ## @result{} ans ⊂ [3.1415, 3.1416]_trv ## @end group ## @end example ## @seealso{@@infsupdec/tan} ## @end deftypemethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-19 function result = tanrev (c, x) if (nargin > 2) print_usage (); return endif if (nargin < 2) x = infsupdec (-inf, inf); endif if (not (isa (c, "infsupdec"))) c = infsupdec (c); endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif result = infsupdec (tanrev (c.infsup, x.infsup), "trv"); result.dec(isnai (c) | isnai (x)) = _ill (); endfunction %!# from the documentation string %!assert (isequal (tanrev (infsupdec (0), infsupdec (2, 4)), infsupdec ("pi", "trv"))); interval-2.1.0/inst/@infsupdec/times.m0000644000000000000000000000326313031036767016032 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} times (@var{X}, @var{Y}) ## @defopx Operator {@@infsupdec} {@var{X} .* @var{Y}} ## ## Multiply all numbers of interval @var{X} by all numbers of @var{Y}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## x = infsupdec (2, 3); ## y = infsupdec (1, 2); ## x .* y ## @result{} ans = [2, 6]_com ## @end group ## @end example ## @seealso{@@infsupdec/mrdivide} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = times (x, y) if (nargin ~= 2) print_usage (); return endif if (not (isa (x, "infsupdec"))) x = infsupdec (x); endif if (not (isa (y, "infsupdec"))) y = infsupdec (y); endif result = newdec (times (x.infsup, y.infsup)); ## times is defined and continuous everywhere result.dec = min (result.dec, min (x.dec, y.dec)); endfunction %!# from the documentation string %!assert (isequal (infsupdec (2, 3) .* infsupdec (1, 2), infsupdec (2, 6))); interval-2.1.0/inst/@infsupdec/transpose.m0000644000000000000000000000310213031036767016717 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} transpose (@var{X}) ## @defopx Operator {@@infsupdec} {@var{X}.'} ## ## Return the transpose of interval matrix or vector @var{X}. ## ## @example ## @group ## infsupdec (zeros (1, 3), ones (1, 3)) .' ## @result{} ans = 3×1 interval vector ## [0, 1]_com ## [0, 1]_com ## [0, 1]_com ## @end group ## @end example ## @seealso{@@infsupdec/ctranspose} ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-11-02 function x = transpose (x) if (nargin ~= 1) print_usage (); return endif x.infsup = transpose (x.infsup); x.dec = transpose (x.dec); endfunction %!assert (isequal (transpose (infsupdec (magic (3))), infsupdec (magic (3).'))); %!# from the documentation string %!assert (isequal (transpose (infsupdec (zeros (1, 3), ones (1, 3))), infsupdec (zeros (3, 1), ones (3, 1)))); interval-2.1.0/inst/@infsupdec/tril.m0000644000000000000000000000464213031036767015665 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} tril (@var{A}) ## @defmethodx {@@infsup} tril (@var{A}, @var{k}) ## @defmethodx {@@infsup} tril (@var{A}, @var{k}, "pack") ## Return a new matrix formed by extracting the lower triangular part of the ## matrix @var{A}, and setting all other elements to zero. ## ## The second argument is optional, and specifies how many diagonals above or ## below the main diagonal should also be set to zero. ## ## If the option @option{pack} is given as third argument, the extracted ## elements are not inserted into a matrix, but rather stacked column-wise one ## above other. ## ## @seealso{@@infsupdec/triu, @@infsupdec/diag} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-08-04 function A = tril (A, varargin) if (nargin > 3) print_usage (); return endif if (nargin >= 2 && isa (varargin{1}, 'infsup')) error ('tril: invalid second argument; it must not be an interval'); endif if (nargin >= 3 && isa (varargin{2}, 'infsup')) error ('tril: invalid third argument; it must not be an interval'); endif A.infsup = tril (A.infsup, varargin{:}); A.dec(A.dec == 0) = uint8 (255); A.dec = tril (A.dec, varargin{:}); A.dec(A.dec == 0) = _com (); # any new elements are [0]_com A.dec(A.dec == uint8 (255)) = uint8 (0); endfunction %!assert (tril (infsupdec (magic (10))) == tril (magic (10))); %!assert (tril (infsupdec (magic (10)), 1) == tril (magic (10), 1)); %!assert (tril (infsupdec (magic (10)), -1) == tril (magic (10), -1)); %!assert (tril (infsupdec (magic (10)), 0, "pack") == tril (magic (10), 0, "pack")); %!test %! A = infsupdec (zeros (3), "trv"); %! assert (decorationpart (tril (A)), {"trv", "com", "com"; "trv", "trv", "com"; "trv", "trv", "trv"}); interval-2.1.0/inst/@infsupdec/triu.m0000644000000000000000000000464213031036767015676 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsup} triu (@var{A}) ## @defmethodx {@@infsup} triu (@var{A}, @var{k}) ## @defmethodx {@@infsup} triu (@var{A}, @var{k}, "pack") ## Return a new matrix formed by extracting the upper triangular part of the ## matrix @var{A}, and setting all other elements to zero. ## ## The second argument is optional, and specifies how many diagonals above or ## below the main diagonal should also be set to zero. ## ## If the option @option{pack} is given as third argument, the extracted ## elements are not inserted into a matrix, but rather stacked column-wise one ## above other. ## ## @seealso{@@infsupdec/tril, @@infsupdec/diag} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-08-04 function A = triu (A, varargin) if (nargin > 3) print_usage (); return endif if (nargin >= 2 && isa (varargin{1}, 'infsup')) error ('triu: invalid second argument; it must not be an interval'); endif if (nargin >= 3 && isa (varargin{2}, 'infsup')) error ('triu: invalid third argument; it must not be an interval'); endif A.infsup = triu (A.infsup, varargin{:}); A.dec(A.dec == 0) = uint8 (255); A.dec = triu (A.dec, varargin{:}); A.dec(A.dec == 0) = _com (); # any new elements are [0]_com A.dec(A.dec == uint8 (255)) = uint8 (0); endfunction %!assert (triu (infsupdec (magic (10))) == triu (magic (10))); %!assert (triu (infsupdec (magic (10)), 1) == triu (magic (10), 1)); %!assert (triu (infsupdec (magic (10)), -1) == triu (magic (10), -1)); %!assert (triu (infsupdec (magic (10)), 0, "pack") == triu (magic (10), 0, "pack")); %!test %! A = infsupdec (zeros (3), "trv"); %! assert (decorationpart (triu (A)), {"trv", "trv", "trv"; "com", "trv", "trv"; "com", "com", "trv"}); interval-2.1.0/inst/@infsupdec/uminus.m0000644000000000000000000000260413031036767016227 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defop Method {@@infsupdec} uminus (@var{X}) ## @defopx Operator {@@infsupdec} {-@var{X}} ## ## Negate all numbers in the interval. ## ## Accuracy: The result is exact. ## ## @example ## @group ## x = infsupdec (2, 3); ## -x ## @result{} ans = [-3, -2]_com ## @end group ## @end example ## @end defop ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = uminus (x) if (nargin ~= 1) print_usage (); return endif ## uminus is defined and continuous everywhere result = newdec (uminus (x.infsup)); result.dec = x.dec; endfunction %!# from the documentation string %!assert (isequal (-infsupdec (2, 3), infsupdec (-3, -2))); interval-2.1.0/inst/@infsupdec/union.m0000644000000000000000000000510513031036767016036 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defmethod {@@infsupdec} union (@var{A}) ## @defmethodx {@@infsupdec} union (@var{A}, @var{B}) ## @defmethodx {@@infsupdec} union (@var{A}, [], @var{DIM}) ## ## Build the interval hull of the union of intervals. ## ## With two arguments the union is built pair-wise. Otherwise the union is ## computed for all interval members along dimension @var{DIM}, which defaults ## to the first non-singleton dimension. ## ## Accuracy: The result is exact. ## ## @comment DO NOT SYNCHRONIZE DOCUMENTATION STRING ## The function is a set operation and the result carries the @code{trv} ## decoration at best. ## ## @example ## @group ## x = infsupdec (1, 3); ## y = infsupdec (2, 4); ## union (x, y) ## @result{} ans = [1, 4]_trv ## @end group ## @end example ## @seealso{hull, @@infsupdec/intersect, @@infsupdec/setdiff, @@infsupdec/setxor} ## @end defmethod ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-13 function result = union (a, b, dim) if (not (isa (a, "infsupdec"))) a = infsupdec (a); endif switch (nargin) case 1 result = infsupdec (union (a.infsup), "trv"); result.dec = min (result.dec, min (a.dec)); case 2 if (not (isa (b, "infsupdec"))) b = infsupdec (b); endif result = infsupdec (union (a.infsup, b.infsup), "trv"); warning ("off", "Octave:broadcast", "local"); result.dec = min (result.dec, min (a.dec, b.dec)); case 3 if (not (builtin ("isempty", b))) warning ("union: second argument is ignored"); endif result = infsupdec (union (a.infsup, [], dim), "trv"); result.dec = min (result.dec, min (a.dec, [], dim)); otherwise print_usage (); return endswitch endfunction %!# from the documentation string %!assert (isequal (union (infsupdec (1, 3), infsupdec (2, 4)), infsupdec (1, 4, "trv"))); interval-2.1.0/inst/__check_crlibm__.m0000644000000000000000000000330113031036767016023 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defun __check_crlibm__ () ## Check whether crlibm is available and working. ## @end defun ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2016-12-06 function result = __check_crlibm__ () if (exist ("crlibm_function") != 3) ## oct file not in the path result = false; endif persistent use_crlibm = verify_crlibm (); result = use_crlibm; endfunction function works = verify_crlibm () arithmetic_test_suite = fullfile (... fileparts (file_in_loadpath ("__check_crlibm__.m")), ... "test", ... "crlibm.tst"); if (exist (arithmetic_test_suite) == 0) ## test suite missing: assume that a package maintainer has removed it to ## save some space after having verified that the test suite passes. works = true; return endif works = test (arithmetic_test_suite, "quiet"); if (!works) warning ("interval:crlibm", ... "crlibm is not working properly, using MPFR as a fallback"); endif endfunction %!assert (__check_crlibm__ ()); interval-2.1.0/inst/__print_mesa__.m0000644000000000000000000000756613031036767015600 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defun __print_mesa__ (@var{H}, @var{FILENAME}) ## Render the OpenGL scene into an image file (internal function). ## ## This function can be used as an replacement of the @code{print} function, ## but will generously modify the figure. The figure should be closed after ## calling this function. ## ## Kludge alert: The export of patch objects within figures is somewhat broken, ## especially for 3D plots. This function renders the OpenGL scene without ## using @command{gl2ps}, which basically produces a screen shot of the figure. ## ## This function requires an Octave version of at least 4.0.0. ## @end defun ## Author: Oliver Heimlich ## Keywords: kludge ## Created: 2015-05-20 function __print_mesa__ (h, filename) if (not (exist ('__osmesa_print__'))) warning (['__print_mesa__ requires Octave >= 4.0.0, ' ... 'falling back to builtin print function']) builtin ('print', h, filename); return endif ## hide figure (for __osmesa_print__ to work) set (h, 'visible', 'off'); screensize = get (h, 'position') (3 : 4); ## print exports raster graphics with 150 dpi exportsize = 150 .* get (h, 'paperposition') (3 : 4); ## __osmesa_print__ seems to apply no anti-aliasing. ## Thus, we apply a FXAA filter ourself. Since this would make the image pretty ## small, we have to increase the figure size. rendersize = 2 .* exportsize; set (h, 'position', [0, 0, rendersize]); resizefactor = mean (rendersize ./ screensize); ## The greater figure size together with the FXAA filter effectively increase ## the image's resolution. In order to get readable text and visible lines, ## we must also increase font sizes, line widths and dot sizes. ## ## FIXME The following code might not increase the size of all relevant objects ## in the figure, but works quite well for everything that can be encountered ## in the interval package. a = allchild (h); a = a (strcmp (get (a, 'type'), 'axes')); # axis and legend for obj = a' set (obj, 'fontsize', resizefactor * get (obj, 'fontsize'), ... 'linewidth', resizefactor * get (obj, 'linewidth')); endfor l = allchild (a); if (iscell (l)) l = vertcat (l {:}); endif t = l (strcmp (get (l, 'type'), 'text')); for obj = t' set (obj, 'fontsize', resizefactor * get (obj, 'fontsize')); endfor l = l (strcmp (get (l, 'type'), 'line') | strcmp (get (l, 'type'), 'patch')); for obj = l' set (obj, 'linewidth', resizefactor * get (obj, 'linewidth')); endfor g = allchild (a); if (iscell (g)) g = vercat (g {:}); endif g = g (strcmp (get (g, 'type'), 'hggroup')); # markers from scatter plots p = allchild (g); if (iscell (p)) p = vertcat (p {:}); endif p = p (strcmp (get (p, 'type'), 'patch')); for obj = p' set (obj, 'markersize', resizefactor * get (obj, 'markersize')); endfor ## Capture OpenGL scene (without gl2ps) warning ('off', 'Octave:GraphicsMagic-Quantum-Depth', 'local'); img = __osmesa_print__ (h); ## Apply FXAA img = uint16 (img); img = img (1:2:end, :, :) + img (2:2:end, :, :); img = img (:, 1:2:end, :) + img (:, 2:2:end, :); img = uint8 (img / 4); ## Save to file imwrite (img, filename); endfunction %!# This function cannot be tested -- it would also fail on Octave < 3.8.2 %!assert (1); interval-2.1.0/inst/__split_interval_literals__.m0000644000000000000000000002207613031036767020366 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defun __split_interval_literals__ (@var{S}) ## ## Split string @var{S} into a cell array of interval literals. ## ## This is an internal function of the interval package and should not be used ## directly. ## @end defun ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-06-13 function result = __split_interval_literals__ (s) if (isempty (s)) result = { s }; return endif ## Split into rows, ## using newline characters, semicolon and rows in 2D strings as delimiters row = transpose (ostrsplit (s, ";\n")); ## Normalize delimiters between intervals within the same row row = strrep (row, "\t", ' '); row = strrep (row, '[', "\t["); # start of interval literals row = regexprep (row, '(](_\w*)?)\s*', "$1\t"); # end of interval literals ## Bare numbers “1 2, 3 4” shall be split into columns by spaces or commas [bare_numbers.s, bare_numbers.e] = regexp (row, '(^|\t)[^\t\[]+($|\t)'); for i = 1 : numel (row) for j = 1 : numel (bare_numbers.s {i}) select = bare_numbers.s {i} (j) : bare_numbers.e {i} (j); row {i} (select) = strrep (strrep (row {i} (select), ' ', "\t"), ... ',', "\t"); endfor endfor ## Separate columns within each row row = cellfun (@(s) strsplit (strtrim (s), "\t"), row, "UniformOutput", false); ## Fill short rows with empty columns cols = cellfun ('numel', row); max_cols = max (cols); for i = find (cols < max_cols)' row {i} = horzcat (row {i}, {"[Empty]"} (ones (1, max_cols - cols (i)))); endfor ## Build a 2D cell array from a cell array of cell arrays result = vertcat (row {:}); endfunction %!assert (__split_interval_literals__ (""), {""}); %!assert (__split_interval_literals__ (","), {""}); %!assert (__split_interval_literals__ ("1"), {"1"}); %!assert (__split_interval_literals__ ("1?"), {"1?"}); %!assert (__split_interval_literals__ ("1?u"), {"1?u"}); %!assert (__split_interval_literals__ ("1?u3"), {"1?u3"}); %!assert (__split_interval_literals__ ("[Empty]"), {"[Empty]"}); %!assert (__split_interval_literals__ ("[Entire]"), {"[Entire]"}); %!assert (__split_interval_literals__ ("[]"), {"[]"}); %!assert (__split_interval_literals__ ("[,]"), {"[,]"}); %!assert (__split_interval_literals__ ("[1]"), {"[1]"}); %!assert (__split_interval_literals__ ("[1,2]"), {"[1,2]"}); %!assert (__split_interval_literals__ ("1 2"), {"1", "2"}); %!assert (__split_interval_literals__ ("1, , , , , , ,2"), {"1", "2"}); %!assert (__split_interval_literals__ ("1;;2"), {"1"; ""; "2"}); %!assert (__split_interval_literals__ ("1; ;2"), {"1"; ""; "2"}); %!assert (__split_interval_literals__ ("[1,2] [3,4]"), {"[1,2]", "[3,4]"}); %!assert (__split_interval_literals__ ("[1,2],[3,4]"), {"[1,2]", "[3,4]"}); %!assert (__split_interval_literals__ ("[1,2], [3,4]"), {"[1,2]", "[3,4]"}); %!assert (__split_interval_literals__ ("[1,2]\n[3,4]"), {"[1,2]"; "[3,4]"}); %!assert (__split_interval_literals__ ("[1,2];[3,4]"), {"[1,2]"; "[3,4]"}); %!assert (__split_interval_literals__ ("[1,2]; [3,4]"), {"[1,2]"; "[3,4]"}); %!assert (__split_interval_literals__ (["[1,2]"; "[3,4]"]), {"[1,2]"; "[3,4]"}); %!assert (__split_interval_literals__ ("1 [3,4]"), {"1", "[3,4]"}); %!assert (__split_interval_literals__ ("1,[3,4]"), {"1", "[3,4]"}); %!assert (__split_interval_literals__ ("1, [3,4]"), {"1", "[3,4]"}); %!assert (__split_interval_literals__ ("1\n[3,4]"), {"1"; "[3,4]"}); %!assert (__split_interval_literals__ ("1;[3,4]"), {"1"; "[3,4]"}); %!assert (__split_interval_literals__ ("1; [3,4]"), {"1"; "[3,4]"}); %!assert (__split_interval_literals__ (["1"; "[3,4]"]), {"1"; "[3,4]"}); %!assert (__split_interval_literals__ ("[1,2] 3"), {"[1,2]", "3"}); %!assert (__split_interval_literals__ ("[1,2],3"), {"[1,2]", "3"}); %!assert (__split_interval_literals__ ("[1,2], 3"), {"[1,2]", "3"}); %!assert (__split_interval_literals__ ("[1,2]\n3"), {"[1,2]"; "3"}); %!assert (__split_interval_literals__ ("[1,2];3"), {"[1,2]"; "3"}); %!assert (__split_interval_literals__ ("[1,2]; 3"), {"[1,2]"; "3"}); %!assert (__split_interval_literals__ (["[1,2]"; "3"]), {"[1,2]"; "3"}); %!assert (__split_interval_literals__ ("1 3"), {"1", "3"}); %!assert (__split_interval_literals__ ("1,3"), {"1", "3"}); %!assert (__split_interval_literals__ ("1, 3"), {"1", "3"}); %!assert (__split_interval_literals__ ("1\n3"), {"1"; "3"}); %!assert (__split_interval_literals__ ("1;3"), {"1"; "3"}); %!assert (__split_interval_literals__ ("1; 3"), {"1"; "3"}); %!assert (__split_interval_literals__ (["1"; "3"]), {"1"; "3"}); %!assert (__split_interval_literals__ ("[1,2] [3,4] [5,6]"), {"[1,2]", "[3,4]", "[5,6]"}); %!assert (__split_interval_literals__ ("[1,2],[3,4],[5,6]"), {"[1,2]", "[3,4]", "[5,6]"}); %!assert (__split_interval_literals__ ("[1,2], [3,4], [5,6]"), {"[1,2]", "[3,4]", "[5,6]"}); %!assert (__split_interval_literals__ ("[1,2]\n[3,4];[5,6]"), {"[1,2]"; "[3,4]"; "[5,6]"}); %!assert (__split_interval_literals__ ("[1,2];[3,4] [5,6]"), {"[1,2]", "[Empty]"; "[3,4]", "[5,6]"}); %!assert (__split_interval_literals__ ("[1,2] [3,4];[5,6]"), {"[1,2]", "[3,4]"; "[5,6]", "[Empty]"}); %!assert (__split_interval_literals__ ("1 [3,4] [5,6]"), {"1", "[3,4]", "[5,6]"}); %!assert (__split_interval_literals__ ("1,[3,4],[5,6]"), {"1", "[3,4]", "[5,6]"}); %!assert (__split_interval_literals__ ("1, [3,4], [5,6]"), {"1", "[3,4]", "[5,6]"}); %!assert (__split_interval_literals__ ("1\n[3,4];[5,6]"), {"1"; "[3,4]"; "[5,6]"}); %!assert (__split_interval_literals__ ("1;[3,4] [5,6]"), {"1", "[Empty]"; "[3,4]", "[5,6]"}); %!assert (__split_interval_literals__ ("1 [3,4];[5,6]"), {"1", "[3,4]"; "[5,6]", "[Empty]"}); %!assert (__split_interval_literals__ ("[1,2] 3 [5,6]"), {"[1,2]", "3", "[5,6]"}); %!assert (__split_interval_literals__ ("[1,2],3,[5,6]"), {"[1,2]", "3", "[5,6]"}); %!assert (__split_interval_literals__ ("[1,2], 3, [5,6]"), {"[1,2]", "3", "[5,6]"}); %!assert (__split_interval_literals__ ("[1,2]\n3;[5,6]"), {"[1,2]"; "3"; "[5,6]"}); %!assert (__split_interval_literals__ ("[1,2];3 [5,6]"), {"[1,2]", "[Empty]"; "3", "[5,6]"}); %!assert (__split_interval_literals__ ("[1,2] 3;[5,6]"), {"[1,2]", "3"; "[5,6]", "[Empty]"}); %!assert (__split_interval_literals__ ("[1,2] [3,4] 5"), {"[1,2]", "[3,4]", "5"}); %!assert (__split_interval_literals__ ("[1,2],[3,4],5"), {"[1,2]", "[3,4]", "5"}); %!assert (__split_interval_literals__ ("[1,2], [3,4], 5"), {"[1,2]", "[3,4]", "5"}); %!assert (__split_interval_literals__ ("[1,2]\n[3,4];5"), {"[1,2]"; "[3,4]"; "5"}); %!assert (__split_interval_literals__ ("[1,2];[3,4] 5"), {"[1,2]", "[Empty]"; "[3,4]", "5"}); %!assert (__split_interval_literals__ ("[1,2] [3,4];5"), {"[1,2]", "[3,4]"; "5", "[Empty]"}); %!assert (__split_interval_literals__ ("1 [3,4] 5"), {"1", "[3,4]", "5"}); %!assert (__split_interval_literals__ ("1,[3,4],5"), {"1", "[3,4]", "5"}); %!assert (__split_interval_literals__ ("1, [3,4], 5"), {"1", "[3,4]", "5"}); %!assert (__split_interval_literals__ ("1\n[3,4];5"), {"1"; "[3,4]"; "5"}); %!assert (__split_interval_literals__ ("1;[3,4] 5"), {"1", "[Empty]"; "[3,4]", "5"}); %!assert (__split_interval_literals__ ("1 [3,4];5"), {"1", "[3,4]"; "5", "[Empty]"}); %!assert (__split_interval_literals__ ("1 3 [5,6]"), {"1", "3", "[5,6]"}); %!assert (__split_interval_literals__ ("1,3,[5,6]"), {"1", "3", "[5,6]"}); %!assert (__split_interval_literals__ ("1, 3, [5,6]"), {"1", "3", "[5,6]"}); %!assert (__split_interval_literals__ ("1\n3;[5,6]"), {"1"; "3"; "[5,6]"}); %!assert (__split_interval_literals__ ("1;3 [5,6]"), {"1", "[Empty]"; "3", "[5,6]"}); %!assert (__split_interval_literals__ ("1 3;[5,6]"), {"1", "3"; "[5,6]", "[Empty]"}); %!assert (__split_interval_literals__ ("[1,2] 3 5"), {"[1,2]", "3", "5"}); %!assert (__split_interval_literals__ ("[1,2],3,5"), {"[1,2]", "3", "5"}); %!assert (__split_interval_literals__ ("[1,2], 3, 5"), {"[1,2]", "3", "5"}); %!assert (__split_interval_literals__ ("[1,2]\n3;5"), {"[1,2]"; "3"; "5"}); %!assert (__split_interval_literals__ ("[1,2];3 5"), {"[1,2]", "[Empty]"; "3", "5"}); %!assert (__split_interval_literals__ ("[1,2] 3;5"), {"[1,2]", "3"; "5", "[Empty]"}); %!assert (__split_interval_literals__ ("1 3 5"), {"1", "3", "5"}); %!assert (__split_interval_literals__ ("1,3,5"), {"1", "3", "5"}); %!assert (__split_interval_literals__ ("1, 3, 5"), {"1", "3", "5"}); %!assert (__split_interval_literals__ ("1\n3;5"), {"1"; "3"; "5"}); %!assert (__split_interval_literals__ ("1;3 5"), {"1", "[Empty]"; "3", "5"}); %!assert (__split_interval_literals__ ("1 3;5"), {"1", "3"; "5", "[Empty]"}); interval-2.1.0/inst/ctc_intersect.m0000644000000000000000000001112313031036767015454 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defun ctc_intersect (@var{C1}, @var{Y1}, @var{C2}, @var{Y2}) ## @defunx ctc_intersect (@var{C1}, @var{C2}) ## ## Return a contractor function for the intersection of two sets. ## ## Functions @var{C1} and @var{C2} define two sets @code{S1 = @{@var{x} | ## @var{C1} (@var{x}) ∈ @var{Y1}@}} and @code{S2 = @{@var{x} | ## @var{C2} (@var{x}) ∈ @var{Y2}@}}. The return value is a contractor function ## for the set @code{S1 ∩ S2 = @{@var{x} | @var{C1} (@var{x}) ∈ @var{Y1} and ## @var{C2} (@var{x}) ∈ @var{Y2}@}}. ## ## Parameters @var{C1} and @var{C2} must be function handles and must accept ## the same number of parameters. See @command{@@infsup/fsolve} for how to ## define contractor functions. The user manual also contains an example on ## how to use this function. ## ## Instead of solving @code{@var{C1} (@var{x}) ∈ @var{Y1}} and ## @code{@var{C2} (@var{x}) ∈ @var{Y2}} separately and then compute an ## intersection of the result, you can solve ## @code{ctc_intersect (@var{C1}, @var{Y1}, @var{C2}, @var{Y2}) = 0}. ## ## @seealso{@@infsup/fsolve, ctc_union} ## @end defun ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-12-20 function c = ctc_intersect (ctc1, y1, ctc2, y2) ## Reorder parameters switch (nargin) case 2 ctc2 = y1; y1 = y2 = 0; case 3 if (is_function_handle (y1)) y2 = ctc2; ctc2 = y1; y1 = 0; else y2 = 0; endif case 4 ... otherwise print_usage (); endswitch ## Check parameters if (not (isa (y1, "infsup"))) y1 = infsup (y1); endif if (not (isa (y2, "infsup"))) y2 = infsup (y2); endif if (not (is_function_handle (ctc1)) && not (ischar (ctc1))) error ("interval:InvalidOperand", ... "ctc_intersect: Parameter C1 is no function handle") endif if (not (is_function_handle (ctc2)) && not (ischar (ctc2))) error ("interval:InvalidOperand", ... "ctc_intersect: Parameter C2 is no function handle") endif c = @(varargin) ctc_intersect_eval (ctc1, y1, ctc2, y2, varargin{:}); endfunction function varargout = ctc_intersect_eval (ctc1, y1, ctc2, y2, varargin) y = varargin{1}; x = varargin(2 : end); ## Evaluate each contractor function fval_and_contractions1 = nthargout (1 : nargout, ctc1, y1, x{:}); fval_and_contractions2 = nthargout (1 : nargout, ctc2, y2, x{:}); ## Compute fval = y if either function value is inside of its constraints fval1 = fval_and_contractions1{1}; fval2 = fval_and_contractions2{1}; fval1 = y + y_dist (y1, fval1); fval2 = y + y_dist (y2, fval2); varargout{1} = union (fval1, fval2); ## Both contractors must produce a subset of y. varargout{1}(disjoint (fval1, y) | disjoint (fval2, y)) = infsup (); ## Combine the contractions for i = 2 : nargout varargout{i} = intersect (fval_and_contractions1{i}, ... fval_and_contractions2{i}); endfor endfunction function d = y_dist (y, fval) d = infsup (idist (y, fval), hdist (y, fval)); d(subset (fval, y) & not (isempty (fval))) = 0; if (columns (y) == 1) d = sum (d, 1); elseif (rows (y) == 1) d = sum (d, 2); else d = sum (sum (d)); endif endfunction %!function [fval, x] = ctc_abs (y, x) %! fval = abs (x); %! x = absrev (intersect (fval, y), x); %!endfunction %!shared c %! c = ctc_intersect (@ctc_abs, "[0, 2]", @ctc_abs, "[1, 3]"); %!test %! [fval, x] = c (infsup (0), infsup ("[1, 3]")); %! assert (ismember (0, fval) && 0 != fval); %! assert (x == infsup ("[1, 2]")); %!test %! [fval, x] = c (infsup (0), infsup ("[1, 2]")); %! assert (0 == fval); %! assert (x == infsup ("[1, 2]")); %!test %! [fval, x] = c (infsup (0), infsup ("[entire]")); %! assert (ismember (0, fval) && 0 != fval); %! assert (x == infsup ("[-2, 2]")); %!test %! [fval, x] = c (infsup (0), infsup ("[0, inf]")); %! assert (ismember (0, fval) && 0 != fval); %! assert (x == infsup ("[1, 2]")); interval-2.1.0/inst/ctc_union.m0000644000000000000000000001136113031036767014610 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defun ctc_union (@var{C1}, @var{Y1}, @var{C2}, @var{Y2}) ## @defunx ctc_union (@var{C1}, @var{C2}) ## ## Return a contractor function for the union of two sets. ## ## Functions @var{C1} and @var{C2} define two sets @code{S1 = @{@var{x} | ## @var{C1} (@var{x}) ∈ @var{Y1}@}} and @code{S2 = @{@var{x} | ## @var{C2} (@var{x}) ∈ @var{Y2}@}}. The return value is a contractor function ## for the set @code{S1 ∪ S2 = @{@var{x} | @var{C1} (@var{x}) ∈ @var{Y1} or ## @var{C2} (@var{x}) ∈ @var{Y2}@}}. ## ## Parameters @var{C1} and @var{C2} must be function handles and must accept ## the same number of parameters. See @command{@@infsup/fsolve} for how to ## define contractor functions. The user manual also contains an example on ## how to use this function. ## ## Instead of solving @code{@var{C1} (@var{x}) ∈ @var{Y1}} and ## @code{@var{C2} (@var{x}) ∈ @var{Y2}} separately and then compute an union of ## the result, you can solve @code{ctc_union (@var{C1}, @var{Y1}, @var{C2}, ## @var{Y2}) = 0}. ## ## @seealso{@@infsup/fsolve, ctc_intersect} ## @end defun ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-12-20 function c = ctc_union (ctc1, y1, ctc2, y2) ## Reorder parameters switch (nargin) case 2 ctc2 = y1; y1 = y2 = 0; case 3 if (is_function_handle (y1)) y2 = ctc2; ctc2 = y1; y1 = 0; else y2 = 0; endif case 4 ... otherwise print_usage (); endswitch ## Check parameters if (not (isa (y1, "infsup"))) y1 = infsup (y1); endif if (not (isa (y2, "infsup"))) y2 = infsup (y2); endif if (not (is_function_handle (ctc1)) && not (ischar (ctc1))) error ("interval:InvalidOperand", ... "ctc_union: Parameter C1 is no function handle") endif if (not (is_function_handle (ctc2)) && not (ischar (ctc2))) error ("interval:InvalidOperand", ... "ctc_union: Parameter C2 is no function handle") endif c = @(varargin) ctc_union_eval (ctc1, y1, ctc2, y2, varargin{:}); endfunction function varargout = ctc_union_eval (ctc1, y1, ctc2, y2, varargin) y = varargin{1}; x = varargin(2 : end); ## Evaluate each contractor function fval_and_contractions1 = nthargout (1 : nargout, ctc1, y1, x{:}); fval_and_contractions2 = nthargout (1 : nargout, ctc2, y2, x{:}); ## Compute fval = y if either function value is inside of its constraints fval1 = fval_and_contractions1{1}; fval2 = fval_and_contractions2{1}; fval1 = y + y_dist (y1, fval1); fval2 = y + y_dist (y2, fval2); varargout{1} = union (fval1, fval2); ## It suffices, if one contractor is a subset of y. varargout{1}(fval1 == y | fval2 == y) = y; ## Unite the contractions for i = 2 : nargout varargout{i} = union (fval_and_contractions1{i}, ... fval_and_contractions2{i}); endfor endfunction function d = y_dist (y, fval) d = infsup (idist (y, fval), hdist (y, fval)); d(subset (fval, y) & not (isempty (fval))) = 0; if (columns (y) == 1) d = sum (d, 1); elseif (rows (y) == 1) d = sum (d, 2); else d = sum (sum (d)); endif endfunction %!function [fval, cx] = ctc_sin (y, x) %! fval = sin (x); %! y = intersect (y, fval); %! cx = sinrev (y, x); %!endfunction %!function [fval, cx] = ctc_cos (y, x) %! fval = cos (x); %! y = intersect (y, fval); %! cx = cosrev (y, x); %!endfunction %!shared c %! c = ctc_union (@ctc_sin, 0, @ctc_cos, 0); %!test %! x = infsup (0); %! y = infsup (0); %! [fval, cx] = c (y, x); %! assert (fval == 0); %! assert (cx == 0) %!test %! x = infsup ("pi") / 2; %! y = infsup (0); %! [fval, cx] = c (y, x); %! assert (fval == "[0, 1]"); %! assert (cx == x); %!test %! x = infsup ("pi") / 4; %! y = infsup (0); %! [fval, cx] = c (y, x); %! assert (fval > 0); %! assert (isempty (cx)); %!test %! x = infsup (0, eps); %! y = infsup (0); %! [fval, cx] = c (y, x); %! assert (fval == "[0, 1]"); %! assert (cx == 0); %!test %! x = infsup ("[0, pi]") / 2; %! y = infsup (0); %! [fval, cx] = c (y, x); %! assert (fval == "[0, 1]"); %! assert (cx == x); interval-2.1.0/inst/empty.m0000644000000000000000000000461113031036767013765 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defun empty () ## @defunx empty (@var{N}) ## @defunx empty (@var{N}, @var{M}) ## ## Return the empty interval. ## ## With additional parameters, create an interval vector/matrix, which ## comprises empty interval entries. ## ## The empty interval [Empty] contains no real numbers. All interval functions ## return an empty result if the input is either empty or outside of the ## function's domain. ## ## The empty interval carries the trivial @code{trv} decoration, which denotes ## that the empty interval cannot be the result of a function evaluation for ## a nonempty subset of its domain. ## ## Accuracy: The representation of the empty interval is exact. ## ## @example ## @group ## x = empty () ## @result{} x = [Empty]_trv ## inf (x) ## @result{} ans = Inf ## sup (x) ## @result{} ans = -Inf ## @end group ## @end example ## @seealso{@@infsup/isempty, entire} ## @end defun ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-27 function result = empty (varargin) if (nargin > 2) print_usage (); return endif persistent scalar_empty_interval = infsupdec (); if (nargin == 0) result = scalar_empty_interval; else result = subsref (scalar_empty_interval, ... substruct ("()", {ones(varargin{:})})); endif endfunction %!assert (inf (empty ()), inf); %!assert (sup (empty ()), -inf); %!assert (decorationpart (empty ()), {"trv"}); %!assert (inf (empty (5)), inf (5)); %!assert (sup (empty (5)), -inf (5)); %!assert (strcmp (decorationpart (empty (5)), "trv"), true (5)); %!assert (inf (empty (5, 6)), inf (5, 6)); %!assert (sup (empty (5, 6)), -inf (5, 6)); %!assert (strcmp (decorationpart (empty (5, 6)), "trv"), true (5, 6)); interval-2.1.0/inst/entire.m0000644000000000000000000000527413031036767014123 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defun entire () ## @defunx entire (@var{N}) ## @defunx entire (@var{N}, @var{M}) ## ## Return the entire set of real numbers. ## ## With additional parameters, create an interval vector/matrix, which ## comprises entire interval entries. ## ## The entire set of real numbers [Entire] is a closed interval. If used as ## an enclosure for a certain value, it represents a state of minimum ## constraints. An interval function which evaluates to [Entire] yields no ## information at all if no interval decoration is present. ## ## The special floating-point values -Inf and Inf represent boundaries of the ## entire set of real numbers. However, they are not members of the interval. ## ## The result of this function carries the defined and continuous @code{dac} ## decoration, which denotes that the interval is not bounded and therefore is ## no common interval. ## ## Accuracy: The representation of the entire set of real numbers is exact. ## ## @example ## @group ## x = entire () ## @result{} x = [Entire]_dac ## inf (x) ## @result{} ans = -Inf ## sup (x) ## @result{} ans = Inf ## @end group ## @end example ## @seealso{@@infsup/isentire, empty} ## @end defun ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-09-27 function result = entire (varargin) if (nargin > 2) print_usage (); return endif persistent scalar_entire_interval = infsupdec (-inf, inf); if (nargin == 0) result = scalar_entire_interval; else result = subsref (scalar_entire_interval, ... substruct ("()", {ones(varargin{:})})); endif endfunction %!assert (inf (entire ()), -inf); %!assert (sup (entire ()), inf); %!assert (decorationpart (entire ()), {"dac"}); %!assert (inf (entire (5)), -inf (5)); %!assert (sup (entire (5)), inf (5)); %!assert (strcmp (decorationpart (entire (5)), "dac"), true (5)); %!assert (inf (entire (5, 6)), -inf (5, 6)); %!assert (sup (entire (5, 6)), inf (5, 6)); %!assert (strcmp (decorationpart (entire (5, 6)), "dac"), true (5, 6)); interval-2.1.0/inst/exacttointerval.m0000644000000000000000000000560513031036767016047 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defun exacttointerval (@var{S}) ## @defunx exacttointerval (@var{L}, @var{U}) ## @defunx exacttointerval (@var{M}) ## ## Create a bare interval. Fail, if the interval cannot exactly represent the ## input. ## ## Typically, this function operates on interval literals @var{S}. It is also ## possible to pass lower and upper boundaries @var{L} and @var{U}, or create a ## point-interval with a midpoint @var{M}. ## ## All valid input formats of the @code{infsup} class constructor are allowed. ## If this function creates an interval matrix, all interval boundaries must be ## representable with binary64 numbers. ## ## Accuracy: The equation ## @code{@var{X} == exacttointerval (intervaltoexact (@var{X}))} holds for all ## intervals. ## ## @example ## @group ## w = exacttointerval ("[ ]") ## @result{} w = [Empty] ## x = exacttointerval ("[2, 3]") ## @result{} x = [2, 3] ## y = exacttointerval ("[,]") ## @result{} y = [Entire] ## z = exacttointerval ("[21e-1]") ## @print{} ??? exacttointerval: interval wouldn't be exact ## @end group ## @end example ## @seealso{@@infsup/intervaltoexact, @@infsup/infsup} ## @end defun ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-10-01 function result = exacttointerval (varargin) switch (nargin) case 0 [result, exactconversion] = infsup (); case 1 [result, exactconversion] = infsup (varargin {1}); case 2 [result, exactconversion] = infsup (varargin {1}, varargin {2}); otherwise print_usage (); return endswitch if (not (exactconversion)) error ("interval:UndefinedOperation", ... "exacttointerval: interval wouldn't be exact") endif endfunction %!assert (isempty (exacttointerval ("[Empty]"))); %!assert (isentire (exacttointerval ("[Entire]"))); %!test "common interval"; %! y = exacttointerval ("[0, 1]"); %! assert (inf (y), 0); %! assert (sup (y), 1); %!test "point interval"; %! y = exacttointerval ("[42]"); %! assert (inf (y), 42); %! assert (sup (y), 42); %!test "unbound interval"; %! y = exacttointerval ("[-4, Infinity]"); %! assert (inf (y), -4); %! assert (sup (y), inf); %!error exacttointerval ("[0, 0.1]"); %!error exacttointerval ("[1, 0]"); interval-2.1.0/inst/hull.m0000644000000000000000000001665313031036767013604 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defun hull (@var{X1}, @var{X2}, …) ## ## Create an interval enclosure for a list of parameters. ## ## Parameters can be simple numbers, intervals or interval literals as strings. ## Scalar values or scalar intervals do broadcast if combined with matrices or ## interval matrices. ## ## NaNs represent missing values and are treated like empty intervals. Inf and ## -Inf can be used to create unbound intervals, but note that these values ## will not be members of the interval. In particular, it is not possible to ## create an interval with @code{hull (inf)}. ## ## The result is equivalent to ## @code{union (infsupdec (@var{X1}), union (infsupdec (@var{X2}), …))}, but ## computed in a more efficient way. In contrast to the union function, this ## function is not considered a set operation and the result carries the best ## possible decoration, which is allowed by the input parameters. ## ## Warning: This function is not defined by IEEE Std 1788-2015 and shall not be ## confused with the standard's convexHull function, which is implemented by ## @code{union}. ## ## Accuracy: The result is a tight enclosure. ## ## @example ## @group ## hull (1, 4, 3, 2) ## @result{} ans = [1, 4]_com ## hull (empty, entire) ## @result{} ans = [Entire]_trv ## hull ("0.1", "pi", "e") ## @result{} ans ⊂ [0.099999, 3.1416]_com ## hull ("[0, 3]", "[4, 7]") ## @result{} ans = [0, 7]_com ## @end group ## @end example ## @seealso{@@infsupdec/union} ## @end defun ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-02 function result = hull (varargin) if (isempty (varargin)) result = infsupdec (); return endif l = u = cell (size (varargin)); ## Floating point numbers can be used without conversion floats = cellfun (@isfloat, varargin); l(floats) = u(floats) = varargin(floats); ## Convert everything else to interval, if necessary decoratedintervals = cellfun ("isclass", varargin, "infsupdec"); to_convert = not (decoratedintervals | floats); ## Use infsupdec constructor for conversion, because it can handle decorated ## interval literals. Also, it will trigger an interval:ImplicitPromote ## warning if necessary. varargin(to_convert) = cellfun (@infsupdec, varargin(to_convert), ... "UniformOutput", false ()); decoratedintervals = not (floats); ## Extract inf and sup matrices for remaining elements of l and u. l(decoratedintervals) = cellfun (@inf, varargin(decoratedintervals), ... "UniformOutput", false ()); u(decoratedintervals) = cellfun (@sup, varargin(decoratedintervals), ... "UniformOutput", false ()); ## Broadcast nonsingleton dimensions (otherwise cat would throw an error below) sizes1 = cellfun ("size", l, 1); sizes2 = cellfun ("size", l, 2); targetsize = [max(sizes1) max(sizes2)]; if ((targetsize(1) ~= 1 && min (sizes1 (sizes1 ~= 1)) ~= targetsize(1)) || (targetsize(2) ~= 1 && min (sizes2 (sizes2 ~= 1)) ~= targetsize(2))) error ("hull: dimension mismatch") endif if (any (targetsize ~= [1 1])) to_broadcast = sizes1 ~= targetsize(1) ... | sizes2 ~= targetsize(2); if (any (to_broadcast)) for i = find (to_broadcast) if (size (l{i}, 1) ~= targetsize(1)) ## Broadcast 1st dimension l{i} = l{i} (ones (targetsize(1), 1), :); u{i} = u{i} (ones (targetsize(1), 1), :); endif if (size (l{i}, 2) ~= targetsize(2)) ## Broadcast 2nd dimension l{i} = l{i} (:, ones (targetsize(2), 1)); u{i} = u{i} (:, ones (targetsize(2), 1)); endif endfor endif endif ## Compute min and max of inf and sup matrices, NaNs would be ignored and must ## be considered nans = false (targetsize); l = cat (3, l{:}); nans(any (isnan (l), 3)) = true; l = min (l, [], 3); u = cat (3, u{:}); nans(any (isnan (u), 3)) = true; u = max (u, [], 3); ## Compute best possible decoration dec = cell (targetsize); dec(:) = "com"; dec(not (isfinite (l) & isfinite (u))) = "dac"; dec(nans) = "trv"; ## Consider input decorations if (any (decoratedintervals)) dec = mindec (dec, cellfun (@decorationpart, ... varargin(decoratedintervals), ... "UniformOutput", false ())); endif nairesult = strcmp (dec, "ill"); emptyresult = isnan (l) | isnan (u) | l > u | nairesult; l(emptyresult) = u(emptyresult) = 0; dec(nairesult) = "com"; result = infsupdec (l, u, dec); result(emptyresult) = empty (); result(nairesult) = nai (); endfunction function decoration = mindec (decoration, decorations) ## Determine and apply the minimum decoration for i = 1 : length (decorations) if (iscell (decorations{i}) && not (isempty (decorations{i}))) otherdecoration = decorations{i}{1}; else otherdecoration = decorations{i}; endif ## Only check distinct elements for n = find (not (strcmp (decoration, decorations{i})))(:)' if (iscell (decorations{i}) && not (isscalar (decorations{i}))) otherdecoration = decorations{i}{n}; else ## Scalars broadcast into the whole cell array. The value is set ## once before the inner for loop. endif ## Because of the simple propagation order com > dac > def > trv, we ## can use string comparison order. if (!strcmp (decoration{n}, "ill") && ... (strcmp (otherdecoration, "ill") || ... sign ((decoration{n}) - otherdecoration) * [4; 2; 1] < 0)) decoration{n} = otherdecoration; endif endfor endfor endfunction %!assert (isnai (hull (nai))); %!assert (isempty (hull (nan))); %!assert (isequal (hull (2, nan, 3, 5), infsupdec (2, 5, "trv"))); %!assert (isequal (hull ([1, 2, 3], [5; 0; 2]), infsupdec ([1, 2, 3; 0, 0, 0; 1, 2, 2], [5, 5, 5; 1, 2, 3; 2, 2, 3], "com"))); %!assert (isequal (hull (magic (3), 10), infsupdec (magic (3), 10 (ones (3)), "com"))); %!assert (isequal (hull (2, magic (3), [nan, 2, 3; nan, 1, 1; 99, 100, nan]), infsupdec ([2, 1, 2; 2, 1, 1; 2, 2, 2], [8, 2, 6; 3, 5, 7; 99, 100, 2], {"trv", "com", "com"; "trv", "com", "com"; "com", "com", "trv"}))); %!assert (isnai (hull ([nai, 2])), logical ([1 0])); %!assert (isnai (hull ([nai, 2], [nai, 3])), logical ([1 0])); %!assert (isnai (hull ([nai, 2], nai)), logical ([1 1])); %!assert (isnai (hull ([nai, 2], [2, nai])), logical ([1 1])); %!test "from the documentation string"; %! assert (isequal (hull (1, 2, 3, 4), infsupdec (1, 4, "com"))); %! assert (isequal (hull (empty, entire), infsupdec (-inf, inf, "trv"))); %! assert (isequal (hull ("0.1", "pi", "e"), infsupdec (0.1 - eps / 16, pi + eps * 2, "com"))); %! assert (isequal (hull ("[0, 3]", "[4, 7]"), infsupdec ("[0, 7]_com"))); interval-2.1.0/inst/interval_bitpack.m0000644000000000000000000000634313031036767016154 0ustar 00000000000000## Copyright 2014-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defun interval_bitpack (@var{X}) ## ## Decode an interval from its interchange format. ## ## The input must either be a matrix of n × 128 bits for n bare intervals, or a ## matrix of n × 136 bits for n decorated intervals. Bits are in increasing ## order. Byte order depends on the system's endianness. First 8 bytes are ## used for the lower interval boundary, next 8 bytes are used for the upper ## interval boundary, (optionally) last byte is used for the decoration. ## ## The result is a row vector of intervals. ## ## Accuracy: For all valid interchange encodings the following equation holds: ## @code{@var{X} == bitunpack (interval_bitpack (@var{X}))}. ## ## @seealso{@@infsup/bitunpack, @@infsupdec/bitunpack} ## @end defun ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2014-12-23 function result = interval_bitpack (x) if (nargin ~= 1) print_usage (); return endif if (not (islogical (x))) ## Built-in function bitpack will fail on other data types error ("interval:InvalidOperand", ... ['interval_bitpack: parameter must be a bool matrix, ' ... 'was: ' typeinfo(x)]) endif switch size (x, 2) case 128 # (inf, sup) l = bitpack (x (:, 1 : 64)' (:), 'double'); u = bitpack (x (:, 65 : 128)' (:), 'double'); result = infsup (l, u); case 136 # (inf, sup, dec) l = bitpack (x (:, 1 : 64)' (:), 'double'); u = bitpack (x (:, 65 : 128)' (:), 'double'); d = bitpack (x (:, 129 : 136)' (:), 'uint8'); dec = cell (size (x, 1), 1); dec (d == 4) = 'trv'; dec (d == 8) = 'def'; dec (d == 12) = 'dac'; dec (d == 16) = 'com'; result = infsupdec (l, u, dec); otherwise error ("interval:InvalidOperand", ... ['interval_bitpack: invalid bit-length, ' ... 'expected: 128 or 136, ' ... 'was: ' num2str(size (x, 2))]) endswitch endfunction %!test "bare"; %! littleendian = bitunpack (uint16 (1))(1); %! b = zeros (1, 128); %! if (littleendian) %! b([52, 63, 117, 127]) = 1; %! else %! b([7, 12, 71, 77]) = 1; %! endif %! decoded = interval_bitpack (logical (b)); %! assert (eq (decoded, infsup (3, 4))); %!test "decorated"; %! littleendian = bitunpack (uint16 (1))(1); %! b = zeros (1, 136); %! if (littleendian) %! b([52, 63, 117, 127, 133]) = 1; %! else %! b([7, 12, 71, 77, 133]) = 1; %! endif %! decoded = interval_bitpack (logical (b)); %! assert (eq (decoded, infsupdec (3, 4))); interval-2.1.0/inst/midrad.m0000644000000000000000000001442113031036767014067 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypefun {@var{I} =} midrad (@var{M}, @var{R}) ## @deftypefunx {@var{I} =} midrad (@var{M}) ## @deftypefunx {@var{I} =} midrad () ## @deftypefunx {[@var{M}, @var{R}] =} midrad (@var{I}) ## ## Create an interval enclosure @var{I} for [@var{M}-@var{R}, @var{M}+@var{R}]. ## ## With two output arguments, compute a rigorous midpoint @var{M} and ## radius @var{R} for interval @var{I}. ## ## Without input parameters, return the empty interval. With only one input ## parameter, the radius @var{R} defaults to zero. ## ## Parameters can be simple numbers, intervals or interval literals as strings. ## Scalar values or scalar intervals do broadcast if combined with matrices or ## interval matrices. ## ## The result is not guaranteed to be tightest if parameters are given as ## strings. This is due to intermediate results. The infsupdec constructor ## with interval literals in uncertain form @code{m?ruE} can instead be used to ## create tight enclosures of decimal numbers with a radius. ## ## Accuracy (with one output argument): The result is an accurate enclosure. ## The result is tightest if @var{M} and @var{R} are floating-point numbers or ## intervals. ## ## Accuracy (with two output arguments): @var{M} is the interval's midpoint ## in binary64 precision, rounded to nearest and ties to even. The returned ## radius @var{R} will make a tight enclosure of the interval together with ## @var{M}. That is, @var{R} is the smallest binary64 number, which will make ## [@var{M}-@var{R}, @var{M}+@var{R}] enclose the interval @var{I}. ## ## @example ## @group ## midrad (42, 3) ## @result{} ans = [39, 45]_com ## midrad (0, inf) ## @result{} ans = [Entire]_dac ## midrad ("1.1", "0.1") ## @result{} ans ⊂ [0.99999, 1.2001]_com ## midrad ("25", "3/7") ## @result{} ans ⊂ [24.571, 25.429]_com ## @end group ## @end example ## @seealso{@@infsupdec/infsupdec, hull, @@infsupdec/mid, @@infsupdec/rad} ## @end deftypefun ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-03-06 function [m, r] = midrad (m, r) if (nargout > 1) warning ("off", "id=interval:ImplicitPromote", "local"); endif switch nargin case 0 i = infsupdec (); case 1 if (nargout == 2 && isa (m, "infsup")) i = m; else i = infsupdec (m); endif case 2 if (isfloat (m) && isreal (m) && ... isfloat (r) && isreal (r)) ## Simple case: m and r are binary64 numbers l = mpfr_function_d ('minus', -inf, m, r); u = mpfr_function_d ('plus', +inf, m, r); i = infsupdec (l, u); else ## Complicated case: m and r are strings or other types m = infsupdec (m); if (not (isa (r, "infsup"))) ## [-inf, r] should make a valid interval, unless r == -inf ## Intersection with non-negative numbers ensures that we ## return [Empty] if r < 0. if (isfloat (r)) r(r == -inf) = nan; endif r = intersect (infsupdec (-inf, r), infsupdec (0, inf)); ## Fix decoration, since intersect would return “trv” at best. legal_radius = not (isempty (r)); r(legal_radius) = newdec (intervalpart (r(legal_radius))); endif if (isa (r, "infsupdec")) dec_r = decorationpart (r); else dec_r = {"com"}; endif sup_r = sup (r); sup_r(sup_r < 0) = -inf; r = infsupdec (-sup_r, sup_r, dec_r); i = m + r; endif otherwise print_usage (); endswitch switch nargout case {0, 1} m = i; case 2 m = mid (i); ## The midpoint is rounded to nearest and the radius ## must cover both boundaries r1 = mpfr_function_d ('minus', +inf, m, inf (i)); r2 = mpfr_function_d ('minus', +inf, sup (i), m); r = max (r1, r2); otherwise print_usage (); endswitch endfunction %!assert (isempty (midrad ())); %!warning id=interval:UndefinedOperation %! assert (isnai (midrad (0, -inf))); %!warning id=interval:UndefinedOperation %! assert (isnai (midrad (0, -.1))); %!warning id=interval:UndefinedOperation %! assert (isnai (midrad (0, "-.1"))); %!warning id=interval:UndefinedOperation %! assert (isnai (midrad (0, infsup("-.1")))); %!assert (isequal (midrad ("pi"), infsupdec ("pi"))); %!warning id=interval:ImplicitPromote %! assert (isequal (midrad (infsup (2), 2), infsupdec (0, 4))); %!assert (isequal (midrad (2, infsup (2)), infsupdec (0, 4))); %!warning id=interval:ImplicitPromote %! assert (isequal (midrad (infsup (2), infsup (2)), infsupdec (0, 4))); %!assert (isequal (midrad (2, infsupdec (2)), infsupdec (0, 4))); %!assert (isequal (midrad (infsupdec (2), 2), infsupdec (0, 4))); %!warning id=interval:ImplicitPromote %! assert (isequal (midrad (infsup (2), infsupdec (2)), infsupdec (0, 4))); %!assert (isequal (midrad (infsupdec (2), infsup (2)), infsupdec (0, 4))); %!assert (isequal (midrad (infsupdec (2), infsupdec (2)), infsupdec (0, 4))); %!assert (isequal (midrad (1, magic (3)), infsupdec ([-7, 0, -5; -2, -4, -6; -3, -8, -1], [9, 2, 7; 4, 6, 8; 5, 10, 3]))); %!assert (isequal (midrad (magic (3), 1), infsupdec ([7, 0, 5; 2, 4, 6; 3, 8, 1], [9, 2, 7; 4, 6, 8; 5, 10, 3]))); %!# from the documentation string %!assert (isequal (midrad (42, 3), infsupdec (39, 45))); %!assert (isequal (midrad (0, inf), entire ())); %!assert (isequal (midrad ("1.1", "0.1"), infsupdec (1 - eps, "1.2"))); interval-2.1.0/inst/nai.m0000644000000000000000000000410613031036767013375 0ustar 00000000000000## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @defun nai () ## @defunx nai (@var{N}) ## @defunx nai (@var{N}, @var{M}) ## ## Return the ill-formed decorated interval, called NaI (Not an Interval). ## ## Ill-formed intervals are the result of an illegal interval creation, e.g. ## @code{[3, 2]}. They occur if the @code{infsupdec} constructor is called ## with an invalid input and survive through interval arithmetic computations. ## Boolean comparisons on NaIs return @code{false}, i.e. @code{[NaI] == [NaI]} ## is false. ## ## The interval part of NaI is undefined. The decoration part of NaI is ## @code{ill}. ## ## The infsup constructor will not produce NaIs, but a warning instead. ## ## @example ## @group ## x = nai () ## @result{} x = [NaI] ## x + 42 ## @result{} ans = [NaI] ## @end group ## @end example ## @seealso{@@infsupdec/infsupdec} ## @end defun ## Author: Oliver Heimlich ## Keywords: interval ## Created: 2015-02-22 function result = nai (varargin) if (nargin > 2) print_usage (); return endif persistent scalar_nai_interval = infsupdec ("[nai]"); if (nargin == 0) result = scalar_nai_interval; else result = subsref (scalar_nai_interval, ... substruct ("()", {ones(varargin{:})})); endif endfunction %!assert (isnai (nai ())); %!assert (isnai (nai (2)), true (2)); %!assert (isnai (nai (3, 4)), true (3, 4)); %!assert (decorationpart (nai ()), {"ill"}); interval-2.1.0/inst/test/crlibm.mat0000644000000000000000000316525313031036767015420 0ustar 00000000000000Octave-1-Lacos_rd scalar structinputmatrix!???.?$??:?x?G????.?$??:?x?G????.?#??:?x?G???outputmatrix!-DT!?-DT!?-DT! @'?mw,C?&w(?[i`?+I?k?;?oZ? ?cXݢ?'?lw,C?&w(?[i`?+I?k?;?oZ? ?cXݢ?'?mw,C?'w(?[i`?+I?k?;?oZ?! ?cXݢ?acos_rn scalar structinputmatrixn???.?$??:?x?G????.?$??:?x?G????.?#??:?x?G???aŗ?͘?4?j.4?P ??q??{. ?.H??6F?-???? 3??@c?SM;?>?=??+? ??vt֪?5P)[3?az?C1?39?4)?xV?-?BR c?TB?{%u$?5?i?;A? 'S?v[W?W#G?iTG?}xI?}J?C}3?>3+`(?#e 5(?ik[?ډ ?R ?Z-O5?dhw>Ê>z6k>50J>\+>:(2H>C)h>ser>c1r>T|Կ>1-}>-Lc=>~>01ge>-1usn>?74o`R? ?#q? S*e?Rv?rVw?sքx?4f?outputmatrixn-DT!?-DT!?-DT! @'?mw,C?'w(?[i`?+I?k?;?oZ? ?cXݢ?'?mw,C?'w(?[i`?+I?k?;?oZ? ?cXݢ?'?nw,C?'w(?[i`?+I?k?;?oZ?! ?cXݢ?Hxm? |QlyP?pX?'ę[?GjH?!?E=/?F3x?a?k?O ?L(%>z J>lE($>h x>@> ry>>rϗtc>d?cL?~j>KnO>.Z->wd0>SVcEJ->YaD+l>+=Jx? "4?Z?ά}?6&yٺ? ?U㲏? ?v(G?{1?Y?~Pgt?dJ^4u?NX`?NwU6?icN?o-??D?Oz?g ?HR8!?9!?|֖!?6@!?a!?u!?`!?lw!?1n!?!?~.!?K 1!?()G!?~-!?! !?V!?dL!?ͱg&!?'E$6!?TI!?]M E!?O?­[w?f&$u?.?jz0?#^ ?qye= ?h!tv ?q?acos_ru scalar structinputmatrix!???.?$??:?x?G????.?$??:?x?G????.?#??:?x?G???outputmatrix!-DT!?-DT!?-DT! @'?nw,C?'w(?[i`?+I?k?;?oZ? ?cXݢ?'?mw,C?'w(?[i`?+I?k?;?oZ? ?cXݢ?'?nw,C?(w(?[i`?+I?k?;?oZ?" ?cXݢ?acos_rz scalar structinputmatrix`???.?$??:?x?G????.?$??:?x?G????.?#??:?x?G???B??np? %?t?=Z??V??j?[??"B?J? ?dI@??.??0?????KS#?a? O?|?u!-?>|?$RdԹ?KU?D]I?9rbH?L>4?5X ?KC>hYT>4k>?>Ki>)|[>#򡚶>eh=>f${>d;*>_J>(eڣ>楑U>vQ> Qc>#L$>L#WԌ>L ?oSǓ?SyR?A d?Iˀ?x-uI0?~D/p?q?+k?<lm?outputmatrix`-DT!?-DT!?-DT! @'?mw,C?&w(?[i`?+I?k?;?oZ? ?cXݢ?'?lw,C?&w(?[i`?+I?k?;?oZ? ?cXݢ?'?mw,C?'w(?[i`?+I?k?;?oZ?! ?cXݢ??AxC?/{gBQ?Y{+F=?x*??&_Ν?+KJ ?q>m>-F. >!g>Ey}>n>K&~> >->H`>0YT?EE~>!V>+u٩>ZaD+،>Bl?W>bnv>[$\x>;ff>Te%?a?̉p?'y?TDd? o?$q?oRc?~4A?b?Ud ?!||!?\!?A!?r!?J4Y!? !?P!?p!?vi0!?Etw>paÌy~0>LfW/PH?ֻT8xee''9r9Z}> (zʸN3Zծ?}:Vi>HׯDn=;嘒>Fvx^,>]zƿ/>?zł䢿D C>4>\?u޿?इ(?%?[QӮJRCRӑ> QӾXPJC>ʄ>|2>.'bF:?]>U]A; 0__~rI$cd?Klk? %sg/Hp>M/QrٛB៙>,:5S#eg sg&+иȻ?0Y? Xjj5ڲ@ ~ޠ6?M,? #~g?j|~?tg>c2IϾzQNgE?5r>e&C>B%^: w߿Pb>mҾ #Po?Etw>Xjz>dBuD^!z(Qg>>~?]>t-Yjzaztw!QS>p8>+V?yr `L(?IV!?yjzQ R]>aÌuH>J,?~!sy~0>Xؿ{4?\86, ?skC@>%(Dsk>+Lqm? Λ>+(T?kpٿY>2?6mXI:X`?Z i?驳fӿ\߅|t,C׀#4NlS,=(]PriIzٛEVs>Hf$78Uj>>-" 3!N۾u_/pg?j%CͿ?v7:'2#BRe?>4>دt. r?u>VG믾i(tgP~Zjj}Xjj>O>µ]K>Cp>:YgL?`qQ>T?"k.?ugbZ&9Qg$,޵G?m\ UB#D?1L{ľqGJe}twQk?OuMW|oLfW/PH?(wf^䯈?JY?&wlCb׿I zBk֟]>b@+U&?K濋x\R쾮'/c MަQoa*L " J܆ee>d}97> 1?0vM?xzy쾲ؘ'PSf>PTRX)uJq7+! )Wvxrp>ֻT8>>x*:x8ox`VS?OQo>*}?'5Ƈ'Tiݪ}>L.v?x܎jR>Ai44hz(n>p Pd&T>٠:rI?ߣWһ Xp*vJwܽ?eF>L >4^> T^S;km-YJ> 1> >\$x&+Nվ^0D*?0yl$?Pb7>Mio?2/?8R|4!?bݱn>6l*f%> 3>p*&?83I,?7>>{_{%Pbڗ?G}g\?|[ďQ@>@R>W#>V>>y??S!-?*m-1ؼQo>5hSTNX?y@u-aC%1lhòCf %^E?9Dm?EOla?Js4'Ⱦa*ECr?7I=f@iܾ]!@?Gw>:X?C5Zjj>1K‡5!1֬{ǿd: w>%QotèJx#:?MWV?7|@ _V~?,nP\6C:Z}*-tB|p2ܿ -nJ6?#`mžg~p2Xjj>s:rͅ?&p ?opӣuDy]&;˭ǾF DF> K*?0) mW*K(ՈyJ?>!X >Şj?D?d)>W>p> ~`?&, ?~6 Ѿa@ߓ=>TzuΜhvi'J,?_+rxb#"0Yľͳ]FCPb2_8 Lܯ2>v4=.KBh;Zx>ofK¾ 8I?C!ּ4&[m> FVDп( g:ؑ{[u4W ?>Wjj>Sa:5?JW'Xjjgs2h>(8Lid^E/see'bkuj?/pnjg?[ǿ:t?U 0INȿAai*L}?*⤦ kE? 0[X.۾6&ܿTŝPb~G?JIiuK>C<Ą?+wrFh]xpK>\ϿB[ys>BJj"Oj6Nپ^yX $ac ݪ}>)!_*<UPb> '޾ڌ/*0Gp?(ʥ->_FX_U8ݪ>EkXjjq?@(@>uVſǑh\>ԭ>RQ+.߿O1΅zj?.5Jc ?9sx?"{?ț@A>8W1?$$hŮ>K fH?d`{O-?,>Ų]>(Ů-N?Ij*>舭Gt8)ڳK>?^0(~G*Ӗʝ"?o( PbuI?>Ez'9r9ʪl ?Hoٴ}?na?ͺs_ N^?U+%Pb>5ՠ{n$J ,{u$`Yc>N&> tpʆͺs+zo?,"?hA>2?)q񢿁>Lrȿ(޾.,[>>hXxQ>^od˾![ؾ/H>W>L%U>ߚ㍂?͎tg>+>R2VptzVK߸a_?=#GygMxj¿,A@TaFǿPb>R ?#5b3?W+ߖ8>HH.*>bC E`e?՘3?Z}>eY#犿aotg>? "(?ϙ~O[]__c<%e l2>kOOھș*Pb_[|5Xh>](Dݪ>kYiӿ{L˳?zǴB?aPb>5jz;+uhNjUI}`P?̟0eGcĕ:-! ?4ȿ8@ ܃Re{'eF>&vpt_Ɉa)>)ݽm׼>"41 3v(e1̾{x-7i'Р7?7= 8,(/:Pbݨ_^'?GU?~\þ~ah{?-IPb'nuj_;wD?gȿ1O?ͫ}sw>+ivdك(FS?_{R|>8?|Cj"DϞ>O&3?@r?y#kѿ,1US ?[A￾?t?.M&O?"e ;ړ_4> |rҾK0j>xBq??K!g~>%Ϥ?ܛ*P?9'>aQ&`+pr?[2-[?S?y?3œ3Yjj>Džp?K"&gO6?(s\ͿIpp ?W;2]3c],XjjW]>lp 7X>gKIw3?Fw>`?*/!6? >䆂?#>#  Ŀ9?aF>\{N>''tɬE?@,!/>LR3!{>}հ@>-Gf:FTvR??:x>8W>>bJ2_^oWƯ TS?0Fq? k> Pb!JÿCR> (zʸN[o;outputmatrixSmsg?: w߿Pb>#Etw>K p:bÌ}y~0>|/PH?X77žT8mx i:e'9r9ّZ}>:fʸN7ծ?wVi>7ׯD=;嘒>Fvм^,>&{ƿ[/>?S墿QC>4>A.)ĭ?c3㤇(?J}%?XJRBCRӑ>% QӾUJC>х>+2>q,2R:?>U]F< 0'__~rbcd?ȡ`lk? %sgcKp>ȩ;Qfn9}!1|>ȅ?9GtV'>d>|S#8" sg~ֻVY? Xjj6Aڲ@ ޠ6?,?q<%~g?=:|~?tg>Ϸ2IϾIڟNgE?5r> ~'tζC>U%^: w߿Pb>3 ܉?#Etw>Xjz>PuD^! g>>~?]>t-YjzaztwRS>K p'+M?R%(`L}*_?V!?1Q ]>:bÌ+>J,?``Q}y~0>]$$31ٿEw 6?J286, ?ۢkC@>%g,Dsk>@Lڈ?Б Λ>\~?oꅡ*ڿ+!?ܨ6J:^?w5I i?3*ӿփCEm?#Gk4N^9T,=(]PriIzٛ`Vs>yà78ۏUj>;" 3N۾'^Trg?~JC8??iv7:\yB?>4>B r?ᴾ>d[G믾k(tgT~Zjj}Xjj>vP>_K>Cp>7yY?qQ}>T?A+!?x`lZ&9 Sai$G?ƙJ,v? 1L{ľGJe}tw- ?͙MO}Oo|/PH?۽1wĩW?+H?w׿u zBk֟]>@4+U&?jhk|\Rc9c MަQo&L " nee>~97>?G/ ?|zy[SPWf>r:QRXS9Gj! TXxrp>X77žT8,>d:x8ox6i?SQo>ш&?'5Ƈ8Tiݪ}> ?mxjR>ej5ŁYn>1Ud&T>D Y?w Xp+v(97?F>cL >L^>իS˿m YJ>j> >!&ox&+Nվn43D*?l$?Pbŧ7>sioR0?8R$!?n>Γ*f%>h?p*&?uc7I,?7>B|_{%Pb(?R}-g\?C|[Q>མR>. %>V>6x?ذ[{?eN"-?hA?y@v-6Y)1lܾòC%^E? y?qµrla?JʍJ)84'ȾBoGr?7֙c=f-uAiܾmS!@?Gw>:X?F5Zjj>ȇ5q?1#x"8ǿ$> w>*Qoèx#:?eWV?x@ ~?R@W\6_:Z*-ecؖݿ@uJ6?X`mž ä~p2Xjj>388ͅ?N%?[ԣvDy] <˭Ǿ DF>~N+?@%qmW*ёNzyJ?>=g_ >Tf ?D?d">Z>p>+NzuΜ$2di^?Sperx)౶"0Iľγ]HCPb2`8 kܯ2>y9=. t]x>"0 "fK¾D8I?[)OM$kE^m>ɧFLпFuؑY$%X ?@Wjj>C@5?JW'Xjjs2h>#Dvid`3s i:e'iL?SSj6q}?9gǿ-Xft?gLtȿ;W#cPr]}?@"h[w&kE?M \X.۾RݿVŝPb80y/?wiuK>$CoQd?ɍ+Oh]|ptaK>UϿbiys>ƕlOj6NپY $ac ݪ}>!_*<UPb>&'޾3*3up?ͥ->-+*HX_CU8ݪ>HkXjj2;?l(@>'!ſʡh\>i ԭ>.#-A1V*j1΅TLs?`fJRd ?WPCsx?x3?ɛ@A>Wc#W1?M)$hŮ>nZH?<'{O-?,>Ų]>7|dmU?ƲIj*>Gtg=p).1r?p. G*"?q( PbpH?F%>7˵z9r9l ?Zc޶'}? b?ͺs N^?U+%Pb>ތ֠@n$0{u`Yc>N&>~pʆͺszo?="?~E>2?n_rt'>[j:ȿ޾70[>hXxQ>d˾?[ؾR1>W>;V>ݗG?͎tg>(0 >2̻zVibR?$x.Gyf{¿M@pT2"ǿPb>  ?!##xO<Q?+ߖ8>SH.*bC*H`ۋe?I3?ّZ}>犿cotg> "(?XSԙ~e[]r'mc.POھʙ*PbT_[Q}J7Y h>]0)Dݪ> qӿ4E?iB?aPb>{&6jz/RiuhjU O`P?aeĕ:(oK?8 ȿiN ɣK|'eF>jypt1a)>#)ݽm׼>1 Pnv(Ve1̾x-7#(0Р7?Ro)8,*/:PbKN_^'?<g?\þ[dJЬ~2\Y?-IPb S,nΕk_;$D?ƅ0ȿNwaB?ի}swՁğ+ZuvdxFS?e{R|>őL?WCj/DϞ>t԰&3?Qr?M.fѿp ?f b8? ?Ӱ&O?SZ;_4>rҾlj>I]aK?!g~>2fϤ?K*P?R>>T&`\tr?[?X}Ky?ǜ3Yjj>kʅp?'&gjl?ΨοIp4?X;2]c],XjjW]>nI 7X>Nw3?G;zx>`?3EU?5 >Z{q4?1>{|@Ŀv~9? F>(N>'Otۉ?A,!/>XR3!{>ٰ@>@f:F_ R??u>8W>> N2K|^Cp0:!Z?q?k> PbXTÿ+R>:fʸNH[o;asin_rn scalar structinputmatrix??.>?.??G??.??x?G????.??:?x?G???ǿ.ӿ$ٿ߿:xGǿ.ӿ$ٿ߿:xGǿ.ӿ#ٿ߿:xG$?:?x???$?:?#?RYN?O |K?Q8u̦]?d2#N?cb}3?\ptV4?A)}L ?np#?Gc"?PDNn?[e?+Kٛ?ZUᣆ?ܒ6e^>Ix> }>_o?g1?xK>Ӓ|> _}>~>Qh>4CGd>+TvMa?P?q{ǵ?7Kf?!rh?<[o|? Uo?._?#Qf5?؆x@?,Sa|?dBg?ˍ?|1?g(x?oZRtB?f} Vh˾րԹ6rt](g ճ>/?>L7?Dz`>yu0>S:l<߿nɹдjvVFȔ>ҟɺsABšpy޿qCW?dSp? ުT$?ch̶4e{u߾8,?ÿ=#mg$?d~ >sCy>{@? G!tWNz4&q2PϧϿ̱cX{U)y?Z p?oZRtB?Uj1(Ʋ"u?C[Tڲ>alMx`?T ٿ?Tǒ_?s-x?7~S2Qߎ@Y?&?r}R4!,A?ok??_A ?C"VbNJ)>0I;N$?Z30:-vWt '??VӃxX?\O+H7WS FS\U>Ql?XtW>3l^r]*([>K40>`A?m/?x+kqJu?–/$բkӄ_k2ǷƾR>z@x/bp?J*0Zz ('5>hG?L՚$=>qg{?4D,(:?:Ll[EV?~Xjm$y?yKA>Ik#cZ?b[LHdvՔg,P?(wGd>V~+ ?5jQ>jUӠi?16=ҿ1xO@qI⾅|*ɾb-@sFoOeAn%gAdeO6q?^s{>Ϝj?"z|Q) >MTeZ0W>:\+5 JM?:'x?m y{SC\cۚ~?Yh?lrd?跛5 րԹZݖ_E*_ހf*t+-o?5ZM5}?IVJTGv(>F <|Uzt?݁{S?O'B&5NEV ?Njiw ;Q>ҴzWh"|>,\g>PY?wU?;>^>-CG0to?k-Ls?Τ2>r,R/j8@{W>28q;a f?eO{L?G` ?"͎ؾ@S߿{>>h>5 j?o^M>Fְlh{>f 7>w)(ۡ?}4$>l=>}ʲ 7N>O:;w:xE-Z? Ă 3U? *^gr&ÿuQFOTKh>߄-cV+?1'>Hr& OȾ m#>+̕ċD/_?9W`eP?>-H>{PId6rt](HuSZѹ?umJ6S?g ճ>yP>$8F@?\sRūg^bw` ݾ>PBtJ^aSOԍdI2UE$>\PNvjxG,h>P h`?"Mh?m!5kd, ?cL(Us!0>!SNC54 f6^oƿ,I_ KO.Y?rj}So?ԬJU?Z(B[Yҿk~?]b!>=ǴK>QA/B>~T!?~`>H Hl?+[`\r8\XW}`QPվuW>SД]"oDds?N$t#-RH1\׾{Mh>= pٿ>s&ޢ?k>P/y >Ǽƙpd;e>>L7?I 3Dz`>A^Vd?p=fEi'?W/6?bOy>o19\y{,۾iHd5>/aj>_bQ?$@wτ8mRxW>pWyu0>na,O>&聡?RwQPIYG?~lgǓyl\?,/g&?V|PHȬ>4ndZa?'lQ?O1ʥWS:l<߿q 9ljqf?}K(z"kS=%þ}p? r{݊>#h>D#>&~)E˭ tETZ ?t%c+E)$>=Jk?%>7&/_?ripùy#J "d>B+D>ipb{?L&WI?up?rgQ8> d.!rW ?OD>Ɠ䋾H>6s?`в{*?ñ ђ?̅N?erC s @>[?^ez˾Z\>= ݇ԥCnW>$ ?Uҿ 2fþy?'Um2mՉP?%D|G^>->nɹдl D(jA=x{?Ll;^? _}>=a3?4?WС][?_i?+!h>d+>D4H8۾jۗ?id:eΤ}XG} )zs>G8-?蠄q>[_V">`>>bJ2ڿZYgI࿝Whh?'$'Ѿ쓷?jvVFȔ>uGd{kĿ 5-.ӿڒEXw)#}8]t>*?K0ZDCL ?qFA%߾V3Į>@kH;s?sۥ38l*K_N5?W{~g_>^?wjɂL˾|7\^ ac{H>re"gnrȣi?$!7pu&ؙU/Ծeq>[y?eF?ES+wKF&>0֘f>u q^e?jl?4z8?螱 ֻF)%#Hd28`濚ҟ TLC*'?*J5!bY"[pcHGm><ϡn>s?0i7Ef@+;Z?L}ׯ,=ŰM>(]e&uԾ!ഖ׿J>>h\nY}2?hs<ʾp߰ԿϐZ*TJt5O=>D>aN.,lE0Zx d?.R8wP6Y+/(0K~ s>,PJȻCANb?NT@? b?#sY>?y7s?!(>S?^4?g==]# ;c0?ir7~g?gD>uH ?ɺsABX)ÁG!; !Luua>S ۿ> mZ>?Gƾc[?oZ\M?&8ZشpZtčx?3ܯْ?k- 0Ir]ݾ6l~>#pW󮾿X>_}[>T?М劼wpP+? >|樳 Ծm-tcx̾ QP>t?pW>Sf!Y>;`uW>Q4ӎbT?!Xh[+e&?špy޿m?/AqO="}:B ?U"m~h>!&QR(d\lId>™RY?nE뮿aQьWr?qCW??lpA~]f ?%ªLX3ܤ&II k?tF__w3)@>dSp? ުT$?hj= >9&&xP(>_Ek?:&>>V%wҾIL: >{/.?pӚQo"!>[?EcF?Eρ[,d:?ӏ'?rmW>ݨ$N{G%?ʼbOAԇ?pRi+]0 o ˾3k=VE}#Ii;>*3+QX;?p)9ch;rCy޾e=f>̶4e{𹤗jsH?I+{3e*p?i YVb>cEIq]H?DX2k>Vy"?Gư;?V?AgJ!Wv$]bz@+r? s8c8 Ԩo:?H}?: I8DA?u ( > ay?[ ϮlCZ7)^z!Ǽn? P7kϢ?%Q Z0-9 s>>NsWx\(l%,7?z/?-6^\V??{ "bn5?۔ 6>f☑Fd>,R߿n5&L?ul3?13:{?c4?bnN8?vl3?13:{?d4?bHκ5?dnN8?On?!$P?tl3?13:{?c4?/?[e?_Hκ5?anN8?On?$P?ul3ǿ13:{ӿw2Jڿc4/?[eaHκ5bnN8On $Pvl3ǿ13:{ӿw2Jڿd4/?[ebHκ5dnN8On!$Ptl3ǿ13:{ӿw2Jڿc4/?[e_Hκ5anN8On$Pw2J?/?[e?aHκ5?On? $P?w2J?/?[e?w2J?!0?;?Ȅͦ]?<7#N?u}3?b7vtV4?J|~L ?#?@mc"?ZOn?4N}e?mdKٛ?G/?Ay:e^>Vy>a }>9/%q;?{ۜl?w{0a> yK>Ӓ|> _}>~>Qh>4CGd>+TvR} ?.D?&:ε?0]m?C\o?_Ep9?hHZp?sq0?% 6?7yA?-{|?Y?oKYˍ?V1?(x?B? Vh˾{~S߹st](m ճ>yn?>l 7?Q{`>0>;8P n&AKiRB:߿kW?Ms?)%aS?Yh,9Be{.u߾ Qÿk1Qg$? >sCy>'A? G!tWU4Pz4&yqϿ̶;cX({UY?y?p?B?nϮ3(kXy?\Tڲ>Fral2x`?H8?R*_?ȵx?mS2*ߎ@!yS7?Ơ+?ZRaCvm? VS?F^l?YtW>Y= ]*([>j0>l?r/?W ?[kiju?i4h$ڢkӄ_ks=2ǷƾlSN? pG?vkq>4>x/AJ-?8*07 (*5>o?L՚=>4l?[(:?!N oE?Z!= Vh˾ G]VT% 2$~IP>r:y?兰KA>ak?d[LHdE4stP?(wGd>1 + ?GjQ>{UӠ 8H?ԦhҿOzI|*ɾ~[.|DsFExHn%k]I ?ܶO;*M?Bs{>}s K"zrR) >ܷ e12W>i\+hn0MJM?Qx?{ y{&$7-ܚB t?yh?Ie?J 5 {~S߹ݖh@X_E*_ހE# f*$d,-o?BF}?dJUv(>ҴzWh"|>,\\pq?R6?mA^>[[sL0t<ɜ?t-Ldi>7|?Ѵ2>[/j8@{W>28q? f!?gREL?)( ?1oؾ )}]࿼{>>h>B:o|?o_M>gV@˘f{>^ 7>0b(ۡ?Q6$>s=>}F! 7N>}K;w:QXF-Z? GU?3X4+^Wb[Ŀ\SHOTKh>"0cV+?ӗ'>#wr{' OȾ q#>=0̕%:_?UW`-P?Г>2H>P|PIdst](̿Iu蹄?#`?m ճ>dMyP>EsF@?2ˊȫAu^b` ݾ>d7_a,OP$F>IE$>PNnxG,h>@3b!h`?Oh?kd{/?alQLEs!0>!SNP764 ?c0ƿ,Ib ӨZ?rj*?pH)x>(dXCְ䌕Hx?CA?Nyn?> P$o?!Y?F俑e`Vߜҿ&t;?0b!>>ǴK>-/B>z?!?,~`>H H T?+[9\X3}`QPվuW>]"aMIds?~x#-vH1\׾{Mh>.)ڿNΓ>?k>R/y >ܷup7w;e>>l 7?f 3Q{`>ZFWd?hEi~ &?3N6?(y>o19\y{ ۾kHd>aj>5Zd?y(ٔdZmRxW>pW0>r,O>;1iz?QPI8ͻ?\ >ȓl\?,ɤ(?dhՊ]THȬ>zGeZa?Q?YʥW;8P\9z@$s?/f./4kS=%þ5 ~p?;r{݊>#h>m#>`ϭ^EH ?%c+I)$>u Mk?4%>2&/4<0?88䜸1]")+$J "d> B+D>-؎?Xs?a?.gQ8>] .!rWղ?wE>?Ɠ䋾}>`s?A~*?"_ђ?E̅N?J/DÝ s @>M?^ez˾\>j ݇ԥCnW>>$ ?c;ӿEfþVYmWs?܁|G^>鲽> #L&5??ࢪ]6?G}R?+!h>d+>4H8۾3uغ\斂?oV :e}'}ƧrW}J )zs>F8-?蠄q>mV">g`>>.UdۿpVO*h?\\$'Ѿ쓷?vVFȔ>dexG39Ŀf]zӿ(ڒEID)#8]t>fLB8:DCp ?,졀;B%߾3Į>Ck>Z#%?VO#7迂X I^?ɂL˾,t[\^Ώac{#H>&gnSqˣi?(ru&ٙU/Ծ8u>ۆ?= ?]S+wK&>f>)q^e?eIJl?g?~J(ֻFn+%#Hdfdh&A4JTLT!(?#*#+!bYH{n>xϡn>+s? Fi,q@2B?`A-zŰM>"f~Zt&uԾc)'ؿ J>h\xw}2?s<ʾԿϐZ JtfO=>B*D>$N.Ԛ[Zx d?ʃ8wPi\+2(0K~ s>^PJ({dA9Isn7?/,(>ce? n.z?EbZK-"Ac0?~⌒¶_?6vD>H ?KiRBh ۿ>=mZ>L?Gƾ[?oo M?ٽ&8f-۴pC*?ْ?n!0 0r]ݾbl~>hV'ᨻwpWp.X>Jϔ}['>T?劼hBo? >樳 Ծ?-tcx̾8QP> : ?pW>5ef!Y><`uW>bT?XV͟"_+e/?:߿h o?|DO=C֚B ?1U$m~h>&^~SR(f\lId>)RY?gZ8r@ <)x1?kW?W?8lpͪ]:!?PMg5ܤ&=L k?H_\<4)E@>Ms?)%aS?MҸ=A >V'&x#P(>=ٗ%wҾOL: >/& ?ӚQY>[?ݟcF? 0ρz[,v3 ;?$'?rmW>hݨ$Njl&?:߰OwAԇ#㢇?=PZa09! o ˾ {=ĠW$Ii;>:dn+QX;?d6M9Yh;rCy8w=f>,9Be{mfhjsdH?[j6Ÿ6*p?ZVb>B1~oq]H?DX2k>O"?9ƠlF {l'?|` ϮpCZ?_ּK*y?x@En?tƘZ5-9 s>>NsW18-,7?}z/?Y\<|ˁ ?"bu(BH8?۔ 6>YWFd>UGt~h߄5&L?Y?veo޾.u߾9Ö[4?gڝVdѿ@?8asin_ru scalar structinputmatrixF sP?$?:?x???$?:?#??.??G??.??x?G????.??:?x?G???ǿ.ӿ$ٿ߿:xGǿ.ӿ$ٿ߿:xGǿ.ӿ#ٿ߿:xG: w߿Pb>Etw>paÌy~0>LfW/PH?ֻT8xee''9r9Z}> (zʸN3Zծ?}:Vi>HׯDn=;嘒>Fvx^,>]zƿ/>?zł䢿D C>4>\?u޿?इ(?%?[QӮJRCRӑ> QӾXPJC>ʄ>|2>.'bF:?]>U]A; 0__~rI$cd?Klk? %sg/Hp>M/QrٛB៙>,:5S#eg sg&+иȻ?0Y? Xjj5ڲ@ ~ޠ6?M,? #~g?j|~?tg>c2IϾzQNgE?5r>e&C>B%^: w߿Pb>mҾ #Po?Etw>Xjz>dBuD^!z(Qg>>~?]>t-Yjzaztw!QS>p8>+V?yr `L(?IV!?yjzQ R]>aÌuH>J,?~!sy~0>Xؿ{4?\86, ?skC@>%(Dsk>+Lqm? Λ>+(T?kpٿY>2?6mXI:X`?Z i?驳fӿ\߅|t,C׀#4NlS,=(]PriIzٛEVs>Hf$78Uj>>-" 3!N۾u_/pg?j%CͿ?v7:'2#BRe?>4>دt. r?u>VG믾i(tgP~Zjj}Xjj>O>µ]K>Cp>:YgL?`qQ>T?"k.?ugbZ&9Qg$,޵G?m\ UB#D?1L{ľqGJe}twQk?OuMW|oLfW/PH?(wf^䯈?JY?&wlCb׿I zBk֟]>b@+U&?K濋x\R쾮'/c MަQoa*L " J܆ee>d}97> 1?0vM?xzy쾲ؘ'PSf>PTRX)uJq7+! )Wvxrp>ֻT8>>x*:x8ox`VS?OQo>*}?'5Ƈ'Tiݪ}>L.v?x܎jR>Ai44hz(n>p Pd&T>٠:rI?ߣWһ Xp*vJwܽ?eF>L >4^> T^S;km-YJ> 1> >\$x&+Nվ^0D*?0yl$?Pb7>Mio?2/?8R|4!?bݱn>6l*f%> 3>p*&?83I,?7>>{_{%Pbڗ?G}g\?|[ďQ@>@R>W#>V>>y??S!-?*m-1ؼQo>5hSTNX?y@u-aC%1lhòCf %^E?9Dm?EOla?Js4'Ⱦa*ECr?7I=f@iܾ]!@?Gw>:X?C5Zjj>1K‡5!1֬{ǿd: w>%QotèJx#:?MWV?7|@ _V~?,nP\6C:Z}*-tB|p2ܿ -nJ6?#`mžg~p2Xjj>s:rͅ?&p ?opӣuDy]&;˭ǾF DF> K*?0) mW*K(ՈyJ?>!X >Şj?D?d)>W>p> ~`?&, ?~6 Ѿa@ߓ=>TzuΜhvi'J,?_+rxb#"0Yľͳ]FCPb2_8 Lܯ2>v4=.KBh;Zx>ofK¾ 8I?C!ּ4&[m> FVDп( g:ؑ{[u4W ?>Wjj>Sa:5?JW'Xjjgs2h>(8Lid^E/see'bkuj?/pnjg?[ǿ:t?U 0INȿAai*L}?*⤦ kE? 0[X.۾6&ܿTŝPb~G?JIiuK>C<Ą?+wrFh]xpK>\ϿB[ys>BJj"Oj6Nپ^yX $ac ݪ}>)!_*<UPb> '޾ڌ/*0Gp?(ʥ->_FX_U8ݪ>EkXjjq?@(@>uVſǑh\>ԭ>RQ+.߿O1΅zj?.5Jc ?9sx?"{?ț@A>8W1?$$hŮ>K fH?d`{O-?,>Ų]>(Ů-N?Ij*>舭Gt8)ڳK>?^0(~G*Ӗʝ"?o( PbuI?>Ez'9r9ʪl ?Hoٴ}?na?ͺs_ N^?U+%Pb>5ՠ{n$J ,{u$`Yc>N&> tpʆͺs+zo?,"?hA>2?)q񢿁>Lrȿ(޾.,[>>hXxQ>^od˾![ؾ/H>W>L%U>ߚ㍂?͎tg>+>R2VptzVK߸a_?=#GygMxj¿,A@TaFǿPb>R ?#5b3?W+ߖ8>HH.*>bC E`e?՘3?Z}>eY#犿aotg>? "(?ϙ~O[]__c<%e l2>kOOھș*Pb_[|5Xh>](Dݪ>kYiӿ{L˳?zǴB?aPb>5jz;+uhNjUI}`P?̟0eGcĕ:-! ?4ȿ8@ ܃Re{'eF>&vpt_Ɉa)>)ݽm׼>"41 3v(e1̾{x-7i'Р7?7= 8,(/:Pbݨ_^'?GU?~\þ~ah{?-IPb'nuj_;wD?gȿ1O?ͫ}sw>+ivdك(FS?_{R|>8?|Cj"DϞ>O&3?@r?y#kѿ,1US ?[A￾?t?.M&O?"e ;ړ_4> |rҾK0j>xBq??K!g~>%Ϥ?ܛ*P?9'>aQ&`+pr?[2-[?S?y?3œ3Yjj>Džp?K"&gO6?(s\ͿIpp ?W;2]3c],XjjW]>lp 7X>gKIw3?Fw>`?*/!6? >䆂?#>#  Ŀ9?aF>\{N>''tɬE?@,!/>LR3!{>}հ@>-Gf:FTvR??:x>8W>>bJ2_^oWƯ TS?0Fq? k> Pb!JÿCR> (zʸN[o;outputmatrixnsg?w2J?/?[e?aHκ5?On? $P?w2J?/?[e?w2J?vl3?13:{?d4?cnN8?wl3?13:{?d4?cHκ5?dnN8?On?"$P?ul3?13:{?c4?/?[e?`Hκ5?anN8?On?$P?ul3ǿ13:{ӿw2Jڿc4/?[e`Hκ5bnN8On$Pvl3ǿ13:{ӿw2Jڿc4/?[ebHκ5cnN8On!$Ptl3ǿ13:{ӿw2Jڿb4/?[e_Hκ5`nN8On$P; w߿Pb>$Etw>K p9bÌ~y~0>|/PH?W77žT8mx i:e'9r9ڑZ}>9fʸN7ծ?wVi>7ׯD=;嘒>Fvм^,>&{ƿ[/>?S墿QC>4>A.)ĭ?d3㤇(?K}%?WJRCCRӑ>$ QӾVJC>х>+2>p,2R:?>U]E< 0&__~rbcd?ɡ`lk? %sgdKp>ǩ;Qfn9}!1}>ȅ?9GtW'>d>{S#8" sg~ֻWY? Xjj6Aڲ@ ޠ6?,?r<%~g?>:|~?tg>η2IϾIڟNgE?5r> ~'uζC>U%^; w߿Pb>3 ܉?$Etw>Xjz>PuD^! g>>~@]>t-YjzaztwRS>K p(+M?Q%(`L~*_?V!?1Q ]>9bÌ+>J,?``Q~y~0>]$$31ٿFw 6?K286, ?ۢkC@>%f,Dsk>?Lڈ?ё Λ>\~?o酡*ڿ+!?ܨ6J:^?x5I i?3*ӿՃCEm?#Gk4N]9T,=(]PriIzٛaVs>yà78ۏUj>;" 3N۾ '^Trg?~JC9??hv7:[yB?>4>B r?ⴾ>c[G믾j(tgS~Zjj}Xjj>wP>_K>Cp>8yY?qQ}>T?B+!?w`lZ&9 Sai$G?řJ,v?1L{ľGJe}tw- ?͙MN}Oo|/PH?۽1wĩW?+H?w׿u zBk֟]>A4+U&?jhk|\Rb9c MަQo&L " nee>~97>?H/ ?|zy[SPWf>r:QRXR9Gj! TXxrp>W77žT8->d:x8ox6i?TQo>ш&?'5Ƈ9Tiݪ}> ?mxjR>ej5ŁYn>1Ud&T>E Y?w Xp+v(97?F>dL >L^>իS˿mYJ>j> > &nx&+Nվo43D*?l$?Pbŧ7>rioS0?8R$!?n>Γ*f%>h?p*&? uc7I,?7>A|_{%Pb(?R}-g\?C|[Q>὘R>/ %>V>6x?ٰ[{?eN"-?hB?y@v-6Y)1lܾòC%^E? y?pµsla?IʍJ(84'ȾCoGr?7ՙc=f,uAiܾmS!@?Gw>:X?G5Zjj>ȇ5q?1"x"8ǿ%> w>)Qoèx#:?eWV?x@ ~?Q@W\6_:Z*-ebؖݿAuJ6?W`mžä~p2Xjj>388ͅ?N%?[ԣuDy] <˭Ǿ DF>~N+??%pmW*ёNzyJ?>>g_ >Uf ?D?c">[>p>,MzuΜ#2di_?Rperx(౶"0Hľͳ]GCPb1`8 kܯ2>y9=. t]x>"0 "fK¾D8I?Z)OM$kE_m>ȧFLпFuؑX$%X ?AWjj>C@5?JW'Xjjs2h>"Dvid`3s i:e'iL?SSj6q}?8gǿ-Xft?gLtȿ:W#cQr]}??"h\w&kE?L \X.۾RݿUŝPb80y/?xiuK>#CpQd?ȍ+Oh]{puaK>UϿbiys>ŕlOj6NپY $ac ݪ}>!_*=UPb>&'޾3*4up?ͥ->-+*HX_DU8ݪ>GkXjj2;?m(@>'!ſˡh\>j ԭ>.#-@1V*i1΅TLs?`fJRd ?WPCsx?w3?ɛ@A>Wc#W1?N)$hŮ>oZH?='{O-?,>Ʋ]>7|dmU?ƲIj*>Gtf=p).1r?o. G*"?p( PbqH?G%>7˵z9r9l ?[c޶'}? b?ͺs N^?V+%Pb>ތ֠?n$0{u`Yc>N&>~pʆͺszo?="?~E>2?m_ru'> [j:ȿ޾80[>hXxQ>d˾>[ؾS1>W>;V>ݗG?͎tg>)0 >2̻zVjbR?$x.Gyf{¿M@oT2"ǿPb>  ? ##xO<Q?+ߖ8>SH.*bC)H`܋e?I3?ڑZ}>犿dotg> "(?WSԙ~d[]q'mc<@z l2>-POھə*PbS_[P}J7Y h>]1)Dݪ> qӿ4E?iB?aPb>z&6jz.RiuhjU O`P?aeĕ:(oK?8 ȿhN ȣJ|'eF>iypt1a)>")ݽm׼>1 Onv(Ve1̾x-7$(0Р7?Qo)8,)/:PbLN_^'?=g?\þZdJЬ~2\Y?-IPb S,nΕk_;$D?Ņ0ȿOwaB?ԫ}swԁğ+YuvdxFS?e{R|>őL?VCj0DϞ>t԰&3?Qr?M.fѿp ?f b8? ?԰&O?SZ;_4>rҾlj>J]aK?!g~>2fϤ?L*P?R>>T&`\tr?[?X}Ky?ǜ3Yjj>kʅp?'&gjl?ΨοIp4?W;2]c],XjjW]>nJ 7X>Nw3?G;zx>`?3EU?6 >[{q4?2>z|@Ŀw~9?F>(N>'Ntۉ?A,!/>YR3!{>ٰ@>@f:F` R??v>8W>>N2K|^Bp0:!Z?q?k> PbXTÿ+R>9fʸNH[o;asin_rz scalar structinputmatrixyF sP?ԁJ?v\J8?׊V?׭ [?_5?0#?]Hs?X$v?MKܳJ ?| /x>T> >j>uM>8n?^59?\?^?F sP?kܸ>7i>pMu=>~8G>p<>ܦ>ϓ>Yaeͺs>Pb>%~[?4L? Ť ?ˤ?I%{ǯ?ݎZr?6F+jt? $c?PS i?3i?̝n?: w߿Pb>Etw>paÌy~0>LfW/PH?ֻT8xee''9r9Z}> (zʸN3Zծ?}:Vi>HׯDn=;嘒>Fvx^,>]zƿ/>?zł䢿D C>4>\?u޿?इ(?%?[QӮJRCRӑ> QӾXPJC>ʄ>|2>.'bF:?]>U]A; 0__~rI$cd?Klk? %sg/Hp>M/QrٛB៙>,:5S#eg sg&+иȻ?0Y? Xjj5ڲ@ ~ޠ6?M,? #~g?j|~?tg>c2IϾzQNgE?5r>e&C>B%^: w߿Pb>mҾ #Po?Etw>Xjz>dBuD^!z(Qg>>~?]>t-Yjzaztw!QS>p8>+V?yr `L(?IV!?yjzQ R]>aÌuH>J,?~!sy~0>Xؿ{4?\86, ?skC@>%(Dsk>+Lqm? Λ>+(T?kpٿY>2?6mXI:X`?Z i?驳fӿ\߅|t,C׀#4NlS,=(]PriIzٛEVs>Hf$78Uj>>-" 3!N۾u_/pg?j%CͿ?v7:'2#BRe?>4>دt. r?u>VG믾i(tgP~Zjj}Xjj>O>µ]K>Cp>:YgL?`qQ>T?"k.?ugbZ&9Qg$,޵G?m\ UB#D?1L{ľqGJe}twQk?OuMW|oLfW/PH?(wf^䯈?JY?&wlCb׿I zBk֟]>b@+U&?K濋x\R쾮'/c MަQoa*L " J܆ee>d}97> 1?0vM?xzy쾲ؘ'PSf>PTRX)uJq7+! )Wvxrp>ֻT8>>x*:x8ox`VS?OQo>*}?'5Ƈ'Tiݪ}>L.v?x܎jR>Ai44hz(n>p Pd&T>٠:rI?ߣWһ Xp*vJwܽ?eF>L >4^> T^S;km-YJ> 1> >\$x&+Nվ^0D*?0yl$?Pb7>Mio?2/?8R|4!?bݱn>6l*f%> 3>p*&?83I,?7>>{_{%Pbڗ?G}g\?|[ďQ@>@R>W#>V>>y??S!-?*m-1ؼQo>5hSTNX?y@u-aC%1lhòCf %^E?9Dm?EOla?Js4'Ⱦa*ECr?7I=f@iܾ]!@?Gw>:X?C5Zjj>1K‡5!1֬{ǿd: w>%QotèJx#:?MWV?7|@ _V~?,nP\6C:Z}*-tB|p2ܿ -nJ6?#`mžg~p2Xjj>s:rͅ?&p ?opӣuDy]&;˭ǾF DF> K*?0) mW*K(ՈyJ?>!X >Şj?D?d)>W>p> ~`?&, ?~6 Ѿa@ߓ=>TzuΜhvi'J,?_+rxb#"0Yľͳ]FCPb2_8 Lܯ2>v4=.KBh;Zx>ofK¾ 8I?C!ּ4&[m> FVDп( g:ؑ{[u4W ?>Wjj>Sa:5?JW'Xjjgs2h>(8Lid^E/see'bkuj?/pnjg?[ǿ:t?U 0INȿAai*L}?*⤦ kE? 0[X.۾6&ܿTŝPb~G?JIiuK>C<Ą?+wrFh]xpK>\ϿB[ys>BJj"Oj6Nپ^yX $ac ݪ}>)!_*<UPb> '޾ڌ/*0Gp?(ʥ->_FX_U8ݪ>EkXjjq?@(@>uVſǑh\>ԭ>RQ+.߿O1΅zj?.5Jc ?9sx?"{?ț@A>8W1?$$hŮ>K fH?d`{O-?,>Ų]>(Ů-N?Ij*>舭Gt8)ڳK>?^0(~G*Ӗʝ"?o( PbuI?>Ez'9r9ʪl ?Hoٴ}?na?ͺs_ N^?U+%Pb>5ՠ{n$J ,{u$`Yc>N&> tpʆͺs+zo?,"?hA>2?)q񢿁>Lrȿ(޾.,[>>hXxQ>^od˾![ؾ/H>W>L%U>ߚ㍂?͎tg>+>R2VptzVK߸a_?=#GygMxj¿,A@TaFǿPb>R ?#5b3?W+ߖ8>HH.*>bC E`e?՘3?Z}>eY#犿aotg>? "(?ϙ~O[]__c<%e l2>kOOھș*Pb_[|5Xh>](Dݪ>kYiӿ{L˳?zǴB?aPb>5jz;+uhNjUI}`P?̟0eGcĕ:-! ?4ȿ8@ ܃Re{'eF>&vpt_Ɉa)>)ݽm׼>"41 3v(e1̾{x-7i'Р7?7= 8,(/:Pbݨ_^'?GU?~\þ~ah{?-IPb'nuj_;wD?gȿ1O?ͫ}sw>+ivdك(FS?_{R|>8?|Cj"DϞ>O&3?@r?y#kѿ,1US ?[A￾?t?.M&O?"e ;ړ_4> |rҾK0j>xBq??K!g~>%Ϥ?ܛ*P?9'>aQ&`+pr?[2-[?S?y?3œ3Yjj>Džp?K"&gO6?(s\ͿIpp ?W;2]3c],XjjW]>lp 7X>gKIw3?Fw>`?*/!6? >䆂?#>#  Ŀ9?aF>\{N>''tɬE?@,!/>LR3!{>}հ@>-Gf:FTvR??:x>8W>>bJ2_^oWƯ TS?0Fq? k> Pb!JÿCR> (zʸN[o;outputmatrixymsg?3_N@?&/?PV?Ľ[?}"_5?:/Z#? p,^Hs?d$v?/zܳJ ?'`/x>u/>p>m>\>zT ?xe ?0?msg?ukܸ>{7i>zMu=>;G>‰p<>«>dϓ>]aeͺs>Pb>u n?K{|I?-ʕ0?(Eͤ?,%̯?r?Ţjt?*>%c? i?g3i?Son?: w߿Pb>#Etw>K p9bÌ}y~0>|/PH?W77žT8mx i:e'9r9ّZ}>9fʸN7ծ?wVi>7ׯD=;嘒>Fvм^,>&{ƿ[/>?S墿QC>4>A.)ĭ?c3㤇(?J}%?WJRBCRӑ>$ QӾUJC>х>+2>p,2R:?>U]E< 0&__~rbcd?ȡ`lk? %sgcKp>ǩ;Qfn9}!1|>ȅ?9GtV'>d>{S#8" sg~ֻVY? Xjj6Aڲ@ ޠ6?,?q<%~g?=:|~?tg>η2IϾIڟNgE?5r> ~'tζC>U%^: w߿Pb>3 ܉?#Etw>Xjz>PuD^! g>>~?]>t-YjzaztwRS>K p'+M?Q%(`L}*_?V!?1Q ]>9bÌ+>J,?``Q}y~0>]$$31ٿEw 6?J286, ?ۢkC@>%f,Dsk>?Lڈ?Б Λ>\~?o酡*ڿ+!?ܨ6J:^?w5I i?3*ӿՃCEm?#Gk4N]9T,=(]PriIzٛ`Vs>yà78ۏUj>;" 3N۾'^Trg?~JC8??hv7:[yB?>4>B r?ᴾ>c[G믾j(tgS~Zjj}Xjj>vP>_K>Cp>7yY?qQ}>T?A+!?w`lZ&9 Sai$G?řJ,v?1L{ľGJe}tw- ?͙MN}Oo|/PH?۽1wĩW?+H?w׿u zBk֟]>@4+U&?jhk|\Rb9c MަQo&L " nee>~97>?G/ ?|zy[SPWf>r:QRXR9Gj! TXxrp>W77žT8,>d:x8ox6i?SQo>ш&?'5Ƈ8Tiݪ}> ?mxjR>ej5ŁYn>1Ud&T>D Y?w Xp+v(97?F>cL >L^>իS˿m YJ>j> > &nx&+Nվn43D*?l$?Pbŧ7>rioR0?8R$!?n>Γ*f%>h?p*&?uc7I,?7>A|_{%Pb(?R}-g\?C|[Q>མR>. %>V>6x?ذ[{?eN"-?hA?y@v-6Y)1lܾòC%^E? y?pµrla?IʍJ(84'ȾBoGr?7ՙc=f,uAiܾmS!@?Gw>:X?F5Zjj>ȇ5q?1"x"8ǿ$> w>)Qoèx#:?eWV?x@ ~?Q@W\6_:Z*-ebؖݿ@uJ6?W`mžä~p2Xjj>388ͅ?N%?[ԣuDy] <˭Ǿ DF>~N+??%pmW*ёNzyJ?>=g_ >Tf ?D?c">Z>p>+MzuΜ#2di^?Rperx(౶"0Hľͳ]GCPb1`8 kܯ2>y9=. t]x>"0 "fK¾D8I?Z)OM$kE^m>ȧFLпFuؑX$%X ?@Wjj>C@5?JW'Xjjs2h>"Dvid`3s i:e'iL?SSj6q}?8gǿ-Xft?gLtȿ:W#cPr]}??"h[w&kE?L \X.۾RݿUŝPb80y/?wiuK>#CoQd?ȍ+Oh]{ptaK>UϿbiys>ŕlOj6NپY $ac ݪ}>!_*<UPb>&'޾3*3up?ͥ->-+*HX_CU8ݪ>GkXjj2;?l(@>'!ſʡh\>i ԭ>.#-@1V*i1΅TLs?`fJRd ?WPCsx?w3?ɛ@A>Wc#W1?M)$hŮ>nZH?<'{O-?,>Ų]>7|dmU?ƲIj*>Gtf=p).1r?o. G*"?p( PbpH?F%>7˵z9r9l ?Zc޶'}? b?ͺs N^?U+%Pb>ތ֠?n$0{u`Yc>N&>~pʆͺszo?="?~E>2?m_rt'> [j:ȿ޾70[>hXxQ>d˾>[ؾR1>W>;V>ݗG?͎tg>(0 >2̻zVibR?$x.Gyf{¿M@oT2"ǿPb>  ? ##xO<Q?+ߖ8>SH.*bC)H`ۋe?I3?ّZ}>犿cotg> "(?WSԙ~d[]q'mc-POھə*PbS_[P}J7Y h>]0)Dݪ> qӿ4E?iB?aPb>z&6jz.RiuhjU O`P?aeĕ:(oK?8 ȿhN ȣJ|'eF>iypt1a)>")ݽm׼>1 Onv(Ve1̾x-7#(0Р7?Qo)8,)/:PbKN_^'?<g?\þZdJЬ~2\Y?-IPb S,nΕk_;$D?Ņ0ȿNwaB?ԫ}swԁğ+YuvdxFS?e{R|>őL?VCj/DϞ>t԰&3?Qr?M.fѿp ?f b8? ?Ӱ&O?SZ;_4>rҾlj>I]aK?!g~>2fϤ?K*P?R>>T&`\tr?[?X}Ky?ǜ3Yjj>kʅp?'&gjl?ΨοIp4?W;2]c],XjjW]>nI 7X>Nw3?G;zx>`?3EU?5 >Z{q4?1>z|@Ŀv~9? F>(N>'Ntۉ?A,!/>XR3!{>ٰ@>@f:F_ R??u>8W>>N2K|^Bp0:!Z?q?k> PbXTÿ+R>9fʸNH[o;atan_rd scalar structinputmatrixp@>0 v' v&EQKHR cz _B:LS?_X׎AF*AAg e_(Bx S@>v~@.BU@5Cc{ k53 'U@mUs<@Tq ZĆ&@JFVB'!'ΏBx@kdyk9\Bd)+@ܜ0B`lB4/AhBׂ -‚Esvz>T季€7 -d}3?9^-5!Ѧ}I,]SAwFAZ@P} @hl@nrA?6tœxRXBBD"E@ñ@g$ `EC &JxA~ 1 hB~S/$%8TL@@:>&A#<^a@\ϻ8Bƣ @9f8JoW`41«Jh:©)ڦ|-[?STG2>+=Y>dTy8iUZCٰ./ژ1?"07@A9nܡޤ=/X4hp[\c@ g>“5ڪ^A@ $>Qv@ _BqBKfXQ?9A^oO:>\2AxĤ{1zZ@~Ƞ8r_B{7(]N/?M(K3AT?pAGCO@SY*w7Bs@ }06u2r#AB+A/|5GAQgWA Eg\O ArKDq:g @[|@w$Amw kAy,lX?Y^fT BBhA %4|AP\@7Z*uuv?CM/T=P8C?)C- ֮5AEOɆUP) 9%\<2濻L]a`A;] zh@ik=~ʿ,ogI@,țBH]^«ڷuZBt[ڷ~3)vB^?_Ѵ5?K@^sѿmT3Aл,țBsz =VAswN@lB7+"A ZFA'L"2%G@3țB#r@Af%G;6Ae+IKc mR@hVƊp~T~8+IKB*Lf-țBY߿tz# G@bkLf /&…1% Rw,AQ~$[@G1 /QABL:')@{FʁUlbN,oAE+IK.R=5EP\خ[WelB$/J׹4&Bv᱗X5/@>ņ AvNH2ſ`l93AT!8BݣwvAL @J j5 4?`Ax##[mM@O!*[@;o*µث+IKPlBXmaL֯KDyrR6a&r֤E03:q !}&d9!*DT!?"?mf9T!?!?ۜCT!?fw/!Q&!` M?R!?൱!:b@T!?f?󯍯?+DT!?-Nj!S]?8ڏ?y'DT!٢ud3? CT!?)DT!?SG ?#DT!&DT!?[Nw!?9@T!?JDT!?BDT!?CT!XQ!y+DT!nS! U?j)DT!nS!eK!qS!S!o!?v0!?f?B g?4k?X DT!8,DT!?|*j۴!?-DT!U!.S!?S=T!?@BT!ǘ!?BBP?AT!n!?J!?g DT!)DT!?Šb??Zpe`!=CT!}!,DT!-DT!k Ade*!2!ڔ f/!?#DT!-DT!?T!I?%!?tq,DT!+!D? CT!42!?0T!?(DT!?f5T!? -DT!?CT!-DT!i.-:RHL0S!?!3J!?|G!?~#DT!?|.T!? |??DT!$T!?-DT!?_"?3T!c+DT![?DT!?2bi?'hS!ƫ?BT!?-DT!>'!?r^#Y1z!?~4T!zT5Gvt DT!?]>?I!?XDT!Bul?:@T!?$x?! -DT!ǚS!!? k-!?!?B-T!?sDT!O[!?E!d?y!?TA!?Q?2!-DT!?eS!?0K!?J:Y!?LN!w ?f5!Hݘ#Q -DT!?;T!VnS!?,DT!$z;>_wvU>|J3>Nͮ^>yʓ>9gTA)Ҍ>lp,#,>md:>sc3q>@u>:ݪm>_aeͺc>w?x? +m~?&:?!B靅?6xy?v)a?wlga?F wb?B)vc/BBo@CRDԃC'@h?Kbc?0?4?|`?x? +m~?w?l(?ҡ9%AC,.A?GK6@+6A4Aj?At ;A_DmFAU{/NAـ mAz`oAfwA %A'A%MQ&qA|\?"AYW"@="@u8nD$@ǧ)ı(@C8?*@!*@3s'>AгA^nGA]BwB%BL)B`j7B9fV~=Ba{oDB5gOB`dOBm(ؕPB"-J CTB:hFeYBu@v3_BO ifBf>/4@:@lPpBQg'wB2EqB*HQBN23 B<׵B)Bk Bʼ 'I@A:Z@9) ct@5X?]u @&?hycARᒠ4NkHtˉ9 Bggil{B4 ÖzUc&j7"Bi.@cP嵮@DOA<)!V@Q6R6QB2aĜ.BϰVEN>t@+¾yQcBH "Z ]¶|QrA츲BJz[ʥI6ɛWB7%d︸8@N6u=yDm( )CYzWLT1Aa1/l@2{QH@4=e^L5e3M\@uBUI:r :V84C2i忔0Z˟4C !.DB !PXx@h!Rh+ôU Cݖ4UAZ?(Acrj &q\xI/A jA>cfBOs.$LvMLݝMB@DB3Kti$Kԧ?tcG"ä}:.AU&uB{L&~zF9ꨊ9sB%T+%ܻ8<\}A4A{D@ȻvBvLPA/mӛAriU ?Ae90TN~ǻmA>ڎQŝJkALA#*1'Ahi.SB>+v y`ASEAMafd55GBrapVlBe90^Unt) {Y4C_xx6Av 3B:xú!5 @AGa {g?AzV\ &eLmAf k@ }=Ggq,mKE6N%j ۥۿrOQWQ*] `w+ALͿw8#x MA6HC¼'<rNQ­#N#d*,LABDh⊰Aǯ"bBhfcA"Ð>ov`l~ADEO#d4@K8("kk.Bz59I,88^|?¬;7~X8O +نhA(c:"B|!?ƒv{ m9L?ЊeAK 廒c}xY/B$AԴ@L@,2Lq5Gc4S@&4 VB8J䉷 BZԿi2sBl֮R@jbtkdRB^+>.LzB4/XN C<;A|#0)?H}b|ĵAH$ MB@t œK2hVM?_5nBZw@Õ_=?xzt54AhYr^@O?ūS?t}@[YC8yU ApVYmB* $#L)8&V@@RBC $GaVGRzBRuSBr|Az@ #bA>$̽Pv@=sV8:=Vsl-'`Bϣ*2@js?hcBס+|DJ#z`Av{Q22HA2/4%٪A&GH;s΁Bp9)oBB,N g+N ҘYcoݗ1kBaW|۸b% A`}=$bB8@7K̓C@u?X*a @Iq5“reD)џ. \4Cc,N \4C{H`Pv:;O&brB4PzBL%Oʰ1kB`]I@p#f@Pb@e \4CN˱e?QDeh"CBKD|L?z@€轿'k@"2*uM̓C{GvPeX%3ALzB't]AquBmM%O{3?vAߖͦ@@ }B7U)>5i B>@ˋ\Yn@ʼOڄ;~P%OѓrɫtQ%OE˱6|CXAbOx#>/MO1>7=> s@J>J~w#>1tC>F)>ri;+d w7ɗpd533[L.D[d4R!>Ktѧ=i?d?T?۠m6h?f`Y?v;?S?m?Aqؿ|> _/×ῡG#ܿg3<@  ɏGAd 20 ǭ|ב?#?DPl?C?)'vO?wJ?K%|?\u?ib翉p\!(<۝vGdb[ G|ؿD6鿞&4Fտ׿V*i.@6z ??@ja(@5Q(M@-_˯#@STj?\}.@yK%}> z=zs-U*# yB_/#~ ?{= ArP3@Zy6@^c5@q8<@g355cX5jR50s,2~CAfKC#CYF?o!? q?Gz5 kXҦ, \P(+ῄv0^ڿQ?ԿϿVEKǿT&V¿@+E@E<ǟ[@[*@C@5hה@A/ @i`~@.쨁s@fnnh@q@̕@6@Mk@( @3,6@k@9yl@@_@4K!@||@*㸲@"_u@+dVk@tc/a@"mn W@ep L@CUB@ 8@|.@d$@T@zQ@)K`G@4ã@.Į@G@{^J@;@mF@A)@Z1O@S,y@9Kr@0Ⱦۙ@֩]{@&& O@ <|@U=r@g`i@$ul_@U@=L@E3pB@=}8@63/@߉?%@֡@eZx@f@mhf@3љt@V3rf@޷C@hPw@D-@Q@^080@Sqe̳@@Ql@v|@>g丗@Uhe@-c@Qv{@ܦr@Q;Bi@l`@9V@GѓM@DZ{bD@Lk@}b@]kZ@m1QR@Ͱ J@8NѼA@ JBx9@uq71@^(@Ύ @]f@~Y@`M+@4̬@k@2@S@F%%{@Ac@|@u~1@Y (@K7j@"@2_ @)!@㋏&@dQ/@3;@,K@h_w@(Fvo@%Őg@Bg_@mW@ș3O@O"H@K@@G{8@350@:SN(@;l !@_@RQ@S` @YE.@yz@X@y@f>t@%@I+@ ̬@l\z@."Y@q3Vĵ@ 3@+[I@ƃU@A듗@,XZ@2J0@k@X y@Xc $r@Ddpj@2Bc@+S[@mT@~yM@JeئE@#aH>@C1@6@ t/@.@(@ @N@JuW@m: @K@WM?.?vm(?Ϻ?TMS?tX+?y?$sE??|w?!fqi?E%8[?EgM?Ɍq!>?0?%ʑ"?^8x?٪ e?Ÿ:X?vPQ?;Q?W?ud?1ew?!F~?V?Ո?;F{?`;4m?Ql_?+BQ?rC?3.;6?nX(??djB ?:sWڦ?p?[?+?fmt?f&?%?X?f룓???z1+x?aak?=4^?JP?0=C?,!`6?K %)?+64?E ?:<ř?v?-~,Z?IC?mMT2?EεI'?='"?= 9"?x*)?6?-1yH? R`r?k~e?^X?xK?>?Kc12?l%?hoz?/ ?s@??r?WH??sɡ?/-냳?çp?}r?wt?} x?#o<u?sh?2F#*\?-?O?IhC?@7?Pv*?7n?@ &?3l?n? _/ep?m.>?\?ߞ?aʼ?f?|D9_?׬3?A|?cv?.ut?Xzh?Lg\?,SAP?D?']*8?44,?) !?V?i5?#Uke ? ?+?N ?Ɉ[?f?T?lm?Y&K?j~?q?}@?Tƃ4?oʻ?r8D?x2 h?! "??,a?/?x?/m?e7˼b?+ͱW?2L?}A?7^6?`8+?o\ ?+@1?[ ? 3 ?7T-?'OT?<׼?vB?I M?3ij?i^?~G? ?u8?M?T8E~?L}[>t?SQCi?Ä_?.~oT?5UI?3UR??4?T iI*?d}?ZR?` ? yo?e?h9?s=?[%?bP?$Sg+6?V?\]`坭?IX?YB?2h܎?v1?wNrz?Dp?eEf?9~[?K=uXQ?úG?zã=?:T3?Pɸt)?"z?8\u?F u ?jy?5:?2^?*c?+?N?y?J=?Ȅ=?%j?񌭛? |Cє?zH ?SeI?sw?m?xrd?V2oZ?ݡP?G?ecz=?;93?ϚA*?ܥ ??Tw ??mU? <?e-q?8 ? c?~I*?|v#?Y?NS?z?݋@?Q?Cv?ȻL?3w?aw0m?~d?B[?b) R?4^iH?dń=??,{6?^KnT-?!@1$?~4?J??T ?rtkC?̴?Hn?C%?xw?г?i@?j˷?oTݮ?}l?7n?',?θNUN?n5t?ڹy?[vp?Pg?GN5_?swoV?icM?oD?`5?C?sJ?1p? ޱ?N?¢?n9?i߭?c2?ahs?Nwn9}?յu?RLMn?=f?:<*o_?X?=P?8:I?-)A?Z$}:?{>$3?P/{+?3:{$?KHF,?#?=hO?Җ|Q?O^?g.?y)?!?N?Eh?=Y⍩?S/7?d?#A~?|WZp?56b?_S?E?`x7?Bkbfj)?J M?!s7 ?ؙ'?? 1?C+?`Ć'? [7?B\M?Cʡi??Yۮ?>s?Zf?FVX?wJJ?V ?,Q)h?*?fU+/?x?Hߡ2?q&??C-?R?mS?f?E ?XS? ?Ic?ըK?E\娥?m ?Fzs?_@?=Sw?\k?ԯ5G`?T?aPI?)k=?Zo2?-RP'??r*C?oŐm??-yE?n/?W?J-u?:?:*?2AԪ?+?с?.`?]C~? ,s?YWzh?&J ]?mR?[F?c]28?Q].?k$.Q%? D?Y.?R鹣?:? ?s)??5gJ.?7H?fP?<?f⃳?#?F;Ƞ?pѦT&?fRb?Wk?OV/\ ?O޻?QYt??R?qa??CK??_E?J.Ƕ?-fN? Oإ?vgf??1ru?n#(?Ka{?afs?sM~ k?|Lj:b?b쁽`Z?R?}I?k|A? tm89?70?Q-ú(?^N ?yVL?~E8:?W߈%?M-?*y?<x?TX?ꥌ-=?f#9%?<?5MbO?U??*)P?]A?W?;O??5Գ9?z<?&w!w? 9o?J.Sg?hXm)r_?W?k^O?obۚG?1@?6T?8?0s0?5b:4(?&X ?p.#?/%d? 5 ?Ev?a? |u6?V ,\/?:c(?3!V ?Ri?*?5 ?.4?wQ?N,?9ָ?XkK?#?s,?jR*?^Z֓?O_?GOzCw?ei?}-XRZ?JL?yj>?[~D0?pɽ$"?m&] ?ؑ_?y?7x?a?x?6w? ?'D%?8D?%j?M)z?l? j_?whAQ?ӐC?_5?A#(?yi{?rI ?k=?5;%??cDP?" ??,,?6w!?k-TXe?Jq?X?Q\iK?qc>?1?Wy %?#K?M( ?3?ة0?mj!?ij? J?b䳿?2"?妝?]O?? ?-A?ˁ_t?w4h?I[?]$fO?qzC? -B6?)O]*?_?$? ?&m9I?R?x? b?'΍?kl?hs'Q?6>$;?kan*?\VE??=NMt?s5yh??)\?~9P?gND?%Ri8?7C,?? ?`?.\ ?@?{?"V?H ?K?(,3?5?,L?S;?-q?Ȱ|?tFW|?jEaq?Z \e?1%=[Z?̋SN?&IjC?fq7?wƍ,?/G'!??`i ? ?#9?ot?Ej,??a)l?&t?f@?od?r?׈\Ŏ? LR?GQx?rLWwm?bgb?M@Wo\W?|VL?| BUA?8bY6?Bb+?ȱp ?g_t?;S ? #??\?\,?ϥ\?:̾?mvc ?­fO?_nZF?>#I?+OG8?^#~?5s?ѳBMi?p ^?CT?F*?V!?\Ď2?`$l?5?zK?.a??'`?e|W?C5n?ql?I;d?b??X? H??i?&If?k?8.W`6?ғ?AP5?CC??pSz? Y?̣z?9|?%u?+n?E9f?\5_?k W?uDeP?I?ELȡA?#E:?GQ2?Rו+?=.C$?\?ͧ?p_? V?R?iQL1?FL(?KI?(U?yt{? ?"|Ț?Qyx?).~?\ o?BJa?m$yS?lIE?O" 7?6A(?)?4 ??E? ?,,??#B˸?;?/&?(!?!iJ?Mzs? mFe?As7W?&2.J?>x?fCYk?.=z^?EQ?D?8?o[=:+?@Gx?7?Ѕ:|?V?؞r?)@?Gx[g?#?)!:?u?CaI#?F?I;#? 6z?as:n?ca?тy>hU?5(bI?( ?"J2?%Gm&? 2?)9?k?`/?]m?/?D ?ggAF?=?? )O?dⱙ?,6d?K?IOv?qk?_ _? pT?tG`H?W\=?2?Kխ&?!<J?gsAS?dDȋ?^i=?'?c?^??A?h@섮?}?8{}CR?%l+?f> ?8#}? Ybr? kg?\?\?Q?cߪF?J{;?|@0?حߢ%?(?-?\ ?]V'g?xB?Mk? ]?j~? ?(A?O?'ɣ?nS4?eGme?4)}?[ay?sn? ~c?8>Y?gKN?D?X@Ŷ9?¯//?#4k$?h?3%?Z+f-?U?=U޾X?e_a?a-?=?`?>oD?Yp|?p5l߸?s{?vp>r?)Fbh? JJ^?δ*6)U?3K?GA?:8?ϩў.?g)%?d^s??@Z?Qϯ?8Q?~?b#nZ?LD?{@dt? ?:jt?vHna;?A(۩?׬?!(?ҴbՍ??8;{?cq?Ah?8IK0u_??0N;V?UyM?nC?:?pqz}1?iX(?6}7?e?ٴ ?@;}?)-u??x?FL[?x%M?MQ?jh?3ܻ?vI?Ҹ?˜ M?Mş5?[U?Wz? }?t?{{k?JT3c?T4lZ?"@Q?TH?x-@?m`Ou7?lҞy.?Vq&?I be?Ө?o~x ?aEy?Z?rmD??;v??9 ?Lڄ?8?k? ?\?D%?atH? 3~M?*?5x㤄{?\6%s?/j?c8sb?Fyu Z? Q?I?DA?[c0?g/w?9?حU? `?П?&y?]4ڰq?4`q>j?qHgb??8c[?TlS?37xL?e4E?U'6=?`ʫ{6?$/?l'?6~ ?61?w(?gٟ ?X\?aV7?^M?:@Iۿ?̿?,Xu?_Zm.?qĆ?gD^h?k{?uv?6PǕh?m\Z?^Ӫ)L?(C=?F/?k!?3??tFJ?i:y?qy۾?(Q$;??M^? 򹣾?;ٕ?/?;h,z?)_l?! ^?#9P? }C?KQBh5?_O'??/$Up ??GTD???&ֽ?jP4ǣȽ?2 &?(Q?G\??Ԓ?3p? .޸x?gpLj?ef]?ȭP?˨?B?5?"ПY(?ȌM%?_ ?3Ŗ?.,?࠵?m.yټ?tMh̼?S]?zY?k?)_Qk1?+)b$?}/?Ĺ/ ?L|?')?l'?~wػ?:˻?gR?Am?6?tI?1?ɷ?y?B/^?!?*3E?tk?J"户?@-=~?Vs?5Ch?Da^?7S? P;I?>?}7)4?QE$)?)?OC?333330x k,箥)b0bw&i:I#f *ϜJMq#,`j?|O (SU Ϡd(m-Eq(V4ؼ N.~)_tZA4ŬE7t<TK=G\^ʱ9}s핧!8w6sS޾}4-3zbٮyq.,9mbqf^Jk/,N~Ə?PSJq&pD|+<`dLf65}?x!><9*6{_3"0 s-]cg*vc$\'kLPQ$[F!n<H:V3R-*o!S44' sᜢ ekJ Ѝuz||XISĪǷr260SanfB&C ͞%G3!jdbj20}M,Gؽ> dۺ-BcC6e"HWI kbR~FEq<A',5R0#): #CۦA%N_PqXc+oϿzR˼7|kٓyɨv*Ss>,p7lm jVj#g7d'xb;ֽ_Wj(\r8~9YJV̰\S#oPgӁM $JиgGLD3AHbH>*ea;`9%6V<30R0si-e[*ì&A'$?$>!U)p81pKUB/fu @   ! gG$j$lw/M`lr@l5ݪ7>  AVM,:Njloٿם I3\eB<gԊuαj~ы9h;3$Ϡ:K Ykr9.Ծ3± J<g5sf2 }L꺠 kpr<f܂hrᔒ8~Qs@RaD>JWqxWĹ?\ U~f|o5yRev㇖sdpb?m*z*k/V\hues»fb>*_ap)];]Z;BW!TQԀ1O gLVe?(IH؋FJ D vCA{>f߳; '84T%6"_30l"-(κ + H(%A̿"V;h8<IuM+,4/.l`:Y 4 a*|~iK5TDL2+6Qm g@yIG:3%vK 0#aA .;'(Ubʘ(җokGGld;z!s9lkEt)=8Jfȕ sLp0-ytyR(Ƨw@.*w`{5vdS)J%kBet|80sb i،|)wzy˄ !o6|2JnzghwfZtlF-^rfdo" ~l#nj#dgXd,$bnnf_o\qZhlWTcRAuOL!z(J,WGs\WDMѭ&7B6 ?zbj<A&I: \!7Zň5ecL^2l/r'-Xv*1M'fk13%d|"MU]pQpu=MߒrEj!5kv J d[pM^!vml-YfcM Gk);w|#~ڡdmmHJq:CI@}ީkLu 4ڌKuU[sYh4&-aXlLoGG(̳Xٸ 4卺zzii=ײVFTج$8>_Ik^tVY,"ț9!?L3 vwC $i;x'$Isf`>ՄU@~I%F(4}zzJ!x~u s; pp} 0m8Hvk.^hqgfecU-"ZaT^L $N\ Y뭈CW8迾TMO:R-7O"x2MJ&:I,H^ME3z!&Cle@;#>b;! 9|C6|I41Ic /,/"*D'q' Z%%,t"S) '"/K >Dȯ7|86(Z?ݶI 9 B!U$\Ea=3ozWp@kUT! pGq+~בɵw8 @ZkU?+wlHiFlEQ#F "+r+3*G=x@dBcDs /S2K ¸*S E v3U\}9G-zf>!-TD9pD{3F;Vf9[m174Qjyw2yx&0!-rb+N ^)ԃ&!Q$k!0"r4Bw3/6;}{T2-oU F} }&@gffy##cp:xK#J:@ɵyF5%d"~ǠR*D)l8Nt3ɼFK^iaƅ> (9b$L,7\"ɕ Z@pp2=I"Ds}L I9f/lDTP s;#qB)U%&v8iwۭW8s9 G=~Pr䳤5:pjXD!&hٝ;Xo~I<U,4sqI6-\_}NlPdH[yc>ܔЄg)sG.~(ؿ{`\|yȉ,09wStTƳrMqpAJ/n϶VkNƵiދ\kg?*eحUb~H`j^7UM+\'Y2QWnUqҐ0S P\^ N"wLʆ:JZGE4j?CF,IAŝi?C<}k:9]8}#6!31Bv/A=-{c+J(&(&t \$jdT%"%3&zF޴pJj`HzX/v 6ito?O77 un XF;jxou<)| rȭtUsIBe~ZANPP`9,JV{ 禖*Rcħl$ocPKG9b8B./S`4 ^N:rVP<#7~hp~Jf:Az"gvWCLBrhimf{ܟiP͈Oe=f` E\9bXAK$T1OV$VyK%-Gc 5B 2>1L:m6Rڵ1q-:P()$K БTTkmݝD0[}y@ ,3&d׺5x7쭎4Pu$Vk6DkT?U|L#?ʋ,Q"=ݾYˤlp4m9eǩ3{J[&Yt؋]aTY dc'8;R{waewkQ6s|oGj*fbnS^'ZCtUevQ0M_ :IQIwVEkF.A7V=c8N!4 090cŐm,.{I(6'~$$^H `8#p̙'pxW Vl7K۳C C%^aM/]Mʞ.}e I .LHmeEUۂm'nROݗjgSYr>KKs)|_F:Kۤ%ɠ*ty߄2@ p ғvobgظY JLmj>|aT2xO&t Gpl:hcҌ_[?W)%S;O>K ^GZCS׉?q F;>Mt7e3!;ɮ/o,+67'A#M ٩#]#jY& HLY#S|&ھDm>.Bkew.Rz7h['t" ͨFT:V+lJ~7\91D ]nQ87_mGg|bϋ^*›?ezGcQΜ[]̌qP,.s(CqX֔Yn}ؾhGiq𢝫JGuNM3уROhxh^Y4"+sʃo2{kN-'|ͺx?K"tv @q$ƗpmCWi;\fzNb!G_x!*}[QWXI4ATȽP. xMǥiI$E-~2B^D>lO:*b7B݃3&[/0P2, ()Bf%Eī!\8heɢ{b &fwv^'*:N 0Y'y1 8A(q M_Op Ⱦ .蘭 #tkvٶ=;gOZQ4M?} k60 ?!3IN ҄`Q Mtmpeg'ߨ-xY/(zӡS I]NM)ɚ@Ej&>3 i9_`$67_~"5{odw6tʷptTl9m.hiΎ>f 1bj D_[*FMX^BT,OƸWQ[XMn%dJi|F*XrCB1?1RJQJ$e; ޗb5Fu}Oz [w( a[{KH|Mi˩WV KY0MDx6LEl5X 'p+WjlX{-2 hJɨ5~s Pl[D%!5R^E P@SF9)M'oĥ=bn`ԭje=ܔO|.g杽^p^Nv[Z褢21>E}Ny0Ջv/s4Do,ylipi:_e4aTjb|j_\[K`XY mUȏQEZNWdKǧHGuWDKAe,=D# Y:N87Y3`0G -2r̻)vTUj&KRR# Q1x)L1+mQ<~ n3UϳTt<9p.%s7qFA퍤U2˴2JOelr$jˊ;OO) iwwL8~wk9 N o+mK*:}(N Txcd 3,#1bh i6b\N"L dDpv-g׻)UvH XDsg7RJwMm`L|N yuf` rNpho'0l hS "eᏔbDxU_Fxd\XNǵUCnRuMOV Lb! HbnE=\HBz}P?L<;Yv8bF5:N2s^/TKy/,g)[_%kߤ"|w 1*Jp,X1J%զ }we׬p 7cF 6z0Mv?"åwy "QW*LgCV[b0#ޑ4N lY~ Hr#N M&ҹWSAu؜`S -i2gZH)]ѽ]౺XiВssaYyr?*3)%j G4䶘ۅyh+Ăɬ9.Օ|[Myin1ivVSsҰ?>prmi)m?2jg0bpcIAK`]@DZgcWGT`QZ]KGpNs`KiMOPH@E2Bj#?sj<į9ͫ|5Rd2Ҷ yFc;I5x8uqԎ5& 524/@),єR)@'Z[$X83!O M *fjzH|[$o 8e $VA0D^Y1|nYu"Bx*4TS]dz5ڟVv dtn H,"=> ylPC]Bfi)!N5C%j;䞐'c޶!v7h.(~Wqw7ǩ|i#ӥ#˞Y# (SnM~ .D ֔y8|jXR/+\` )#)5`R|D~st{̎xFIuJsȆ6p$$Hgmynj?IgPdU1bd_\$`ʲYW5AW'16TQkQJZ9NPK IDF*{C>@߁=uj#; \8AΕ5-V2tM? 0C-z: 6~*C'[Jj$O#0"lFh:wGG#G1EaK\ Q@[ Lı{svlܓ\MYհU.wM !JcuĊG,sp7z-'Fl==Ƃ f?rfGT~󿺛d΋#*rx1@ zKt7޼)Ųsluc 04UJ+BL4 7:󿅙Kԡߐ"ꐘpm Q\,?󿃒]C7AΓuM|7p#ZAA߉1}:~.7|Ԋy,/v󿢁1tq? rnbB"D/l tif4 /d^<16aW^󿏬 3\y`BY!V݊;TV͘Q.#pNkn)H͓󿂩nKhysu] x숝q k917>hS5_@bǷ'j+-M&>#2[ V( =~yT_^Y{R.u^򿊺i^/ieB=O$s 1#~YƌU$= `.򿛀R̋`򿴟JFvPG3LRJY,i0ԟmkC`D*$B#]3:/@v=GUr;H9񿽟lW6ܶ.Z4YY1&֠/ED-x*@(? 2&,&# |!gSV"kkzn%׻ǗG{cwW KO\ ͭ 6*ZavIVdptÁX7TZVB{U\mrC 1YQQ-8h𿸥ی_o>/ k*(˺3h%Ô uJw,z$#+𿼶^-N4(%BbbG݈G𿀌]eH8¿𿣗%uF2)9ݸԁ RfEhR,Sd𿎏dMy}Шs цgu=;R&jX`Ә#拖JD:WXc3qۊL5+bpYrQ7HW[0i`CR;RG}FJ{=\ yąAv7t>r]om"ykV 57if3NdTubRS,5`nQF]r[\wYJ9WTAReRRd~PkxDANALaCI4M7G𿘃ME=Cl2@8rc͚>"/_<>g$:kv7 zJ5"3nv3K<1U?k/ 6O,GT *GqY(!&b #䅲!g{ߗD`Ѥ57RalvD7 h n M d Oi)1𿥒E3%zs&!(4e~aS.>;2x￨>Ow+o￦VXV^;k; /￬`>tSA%Xɶt%nY@SX@p/X@* QX@xX@ ZW@!&W@5epW@1b9W@JmW@T'V@Z9L[V@ǧ¡UbV@h-V@}U@*U@7{ U@riMm`U@z64eA.U@ =T@8IT@2<{T@ᦎ jT@x6:T@yDV T@L8aS@cS@)V0~S@2'QS@wO{#S@R@SbR@3KHR@gJrR@=FJGR@ 6cR@e*Q@[8Q@TK Q@tQ@CkܷKQ@;.#Q@VaO;P@" P@$5P@A,%pP@W]P@B7P@oY3P@qO@AO@035BO@aʃN@-F@>gE@&PR-E@DϨkmE@Lc!;E@l`M E@PpD@ D@3mTvD@s^FD@y!D@C@ C@brÊC@b7\C@ as/C@#&lC@ -B@B@}B@qfRB@|+f'B@6A@dA@@RLA@VO;VA@-A@tV9A@H G@@N@@xuz@@zg@@ZA@@O@@ ?V?@*In?@U!6U?@+ ?@Bi>@uz>@A:3>@S`2=@A=@>nb`=@ o=@<@ۉn<@$%]P<@Y- <@;@NkRӊ;@6.J;@tK'" ;@:@Mʋ:@an|M:@_:@b 9@G9@j7Y9@yIm9@T8y8@ȵ@8@.o8@58@M$7@ 7@D7@*`U7@t_7@a6@ڲ6@-m}6@viBH6@4@oՏ4@z@4@}R4@5 S"#4@pSY3@B 3@/q3@Jh3@h1@L_z1@;- 1@g&`1@71@'1@Ft^0@q0ڿ0@$+0@sq0@rJ0@ $0@/@hx4/@bYUAh/@(E/@V .@=>Db#.@inE.@Wb-@G-@tq=r-@k!--@zЦ,@"Rͤ,@'a,@1_,@|+@gC+@Z+@ȩݑ+@h *@<6*@xy]*@MEvN*@_H)@c]_W)@M$Vi)@/;-)@ (@b (@r~(@D(@, (@('@\='@q=c'@ڡ,'@B.&@F֦&@ *?@&@oVV&@l2!&@=%@o%@o|%@|6T%@A~"%@JTL$@\.>%$@)q$@0_$@]_/$@$@#.?#@ݸ󩌢#@=wt#@TF#@Ӱ#@"@*`FQ"@N"@ 񥩳h"@s~="@-p"@7hD!@w =!@d!@\eUk!@,=sB!@=º !@+ @=X @ h @[cO{ @rT @1M-. @ix @D5@7̟PY{@VMu1@?@@\,)W@RQ@Ox/@a?#@7/=>@6g9@ѣ6@jr@QEE0@tZ@9EbaY@IAfk@ +@̀G@@z;m@sy/@?@ (J@$@x@4=@(@'@0hTE@jMS@:#5@6l.@?T@Er@a;@D@n{@b@"[c@j^/@YmL@׼@ @da@Z8/@D@~N@_a@֍%:k@;@C( @@`|@}bJ@;R@I,%@P<@I6@#N@]FWs@sYCH@ԫ@*o'@Z0@,2$H@6O2u@tL@h?;V$@֥@ڜ=@Y@]>@0C^@Kh8@G.рV@mR<@L|@jmkD@j%\ @4 S@aGj@0I"@) @ݢg @L ;;P @n @!$ @3 @^S,0A @ygn @в+ @| @P$J; @ @G}P @Lq} @c@d? @< @.嶿 @ԼD @S[:XL @D @[V#@!؛@ob@:r(@q(@SJ@>uN@ p&I@@;InX@ذ@0q@{DJO<@U@x^M@þ<촡@c|n@Cס<@@ @Lg@zNx@"w@_"G@`W@w.@jr@INQ%@.zD^@1>P0@@i6$@ff@[L @ЀkS@|rI(@WW@@խb@u*@)?uW@K].@m@{ox@dk@%=yD@fh@#~dDB@u@[-?rꪡ?n*mW?wY ?! .?o`|?j65?QaeP?ȱ?vb?_å~?-q!)?2s?|Ge]R? H?T =?M3ƌ? L?8S ?K:?E?ZXO? {?xfYi?D(ʗ?T`[?zw4 ?7PET?&$?KsjH?Kp?['??am j?%6y?*?|ƈ?ݘUl~?!֕?cӐl?ǫC?+&&?H,?9?92Σ?N|?V?@ 3/?SB3Ϲ ?)+?Ѕd}?/73?3wo?qZ?MEY?߷B? I)?ǣ%:?(r@?!F?>?5#t?U 2?V?;}N?Vm?U ,?]a/?\-?Ԁ/^o?!ES1??>}?$uz?:>?W?J?I*ը?U?ٌ:@?g=T?RC? ȕs?$ȼ?|2u?Z:XI?3U? ''l?.n?H?D)??~7>(w?V*N?c%?EN?jf[n?Q֣?-lƆ?~贳_?9?Lp݇y?XR|?4? F?`~\:?M~?N$nl?u%?G4F?*z,?4gR?PB ??L_^"?0C?^Pw?Y!?w/~?1l|=?P_+?94?:Ȏmp?9׋?A?ɠ?U?|W?'yU"N?X?ky?$D?_Mc?*?1A?l;?!f ?JϷJ?W ?[oe?QK?,;әs?uoRl>? 8 ?@}?_ܡ?5 F ?Ȓ?,G?6 ny?vv`I?[_?z?@GHػ?o!I?V 3_?#*2?sa)?<_>y?>?L@/j?2tIT?W)?'S&V?W?~?>?:ZƁ?KFX?A/???X,`?#(Ґ?H'i?dsjC?Є-??ݞC?6磿?,z Y??V)Ǿ? "r~?MlY7?tTcn?)? !d?ލ?>s 3ۼ? Uy?*^T?:R'?YLϻ?<𸎻?HXY N? ?.vκ?uՋ?cT&5Q?p?]=ֹ??&']?tѺ!?V?%AŌ?H }r?a;B9?ϙh?|ȷ?g B?HX?#"=("?cE?X??9À?|mK?]?X?^љc?&|}?-} K?#Q?3??@}?j?\ U?0%?Aұ?Rdz?Ozi?xik?=?8?S4?&=՗?&۩?h"`?vS)F5?@~F ?H ߱?r?-pgj?:c?Yxk:?4?/??9°?7㚰?Fs?dMM? '?l}!?(W#?1)l?^ht"?zT7wٮ?Mu?kxvI?JQ?ͥ2?Uhv?LA1?CX9?kڨ?'e?40"?.O?h?y?Q>X^? Zg?ު?(?.s4a?.&އJ#?f)?6K)?Tl?sѶB1?d&,("?zt\_?r?j G?~?֧?O)딞? (u%g? 80?x̪?]æ?+p?FY?#cߗ %?7?uԒ?ؼM?㽉W?gn%?B?6ä?0d|>Z?)b?pj;2?m?$Kӣ?! S?Q7w?H b3I?1C?usi?w¢?:?NuNk?7#@?Z5>?V!?2ο?'.?(IiXm?VhD?tzy\?%}3?4Ji̠? ?UV}?Fi;f6W?q:N0?5L: ?jʟ?⾠?xr5?*J?`X5 ?s? \?JO?6<31EΝ?cfvP?(*C?S?E F?av?9B 4?%?dC?NlmGo? .?v=2?L ௚?սz=q?1T-3?]?r¸?Euc|?)@?|N?}"ʘ?&ne?pkV? +1Ҟ?92? fj?(A_u?j 5P>?(?~і?&?b g?2?,h?H'ʕ??Le?.%d?lW2?,?sԳϔ?Sw۞?ܖun?d݁>?mh?vߓ?PE?ֲ ?AU?&4'?/?`Β?: v?HY+K?t< ?V/G?eˑ?pơ?dx?icO?#&?K?^o.֐?3?U79?C8%a?+ѳ:??ݏ?> R?LuH?k?Y骶?n?c('??D~kD?O T?vi?m ˌ?Ih'?>de0E??Ԃyp?3M?mi??hb>v??}AP?>6C?:Rw?Ieȉ?ዉ?_O?a ?gو?9T?ҴIe?+>PG,?C?ףT?;h? qL?(?y߆?L婆?tt?u?? ' ? ؅?:j1sĤ?/|%q?1+??j ?p7Z܄?ß Kd?outputmatrix-DT!?-DT!P?ZuVQ?7zQ?K.T?NU?頬^?"5UC?c;?z"?'xƼr?s?c*?yt? l ?H w&>\;>}wvU>"3>ͮ^>yʓ>8gTp(Ҍ>n,#,>Ykd:>sc3q>@u>:ݪm>]aeͺc>۩n?L{Ek?3|]? b}9?ߦ?Ruy?BJ)a?Tea?IZ: wb?-DT!?-DT!?-DT!?-DT!?Yr.Q?2x??]a?w?L{Ek?3|]?۩n?7?u?2?n4l?}t5?Dm?^ ?} J!?Q\ !?W!?F!?>.=!?g!?|p!?Ye!?!?ID!?/D!?;9?=R!?!?6!?r!?*!?cj!?l)B!?[D!?\I!?S!?S!?S!?S!?eLUe?{so? ? ?l-}?%?Q"T!?pT!?~,T!?\@T!?BT!?BT!?-~CT!?8CT!?CT!?,CT!?CT!?ZCT!?CT!?DT!?G DT!?DT!?^ 2?W?DK?,DT!?@"DT!?q(DT!?n*DT!?(+DT!?S,DT!?u,DT!?,DT!?@?RN?қm?p:? 0?8T!?ݴN!-DT!n,DT!?#DT!?-DT!CT!Z!&zBT!?15I?F ?„R!?H?,DT!?;+DT!?1DT!7!ħ￯njCT!+DT!DT!?Ȋ! DT!JF!?=,DT!?o,/!gS!DT!?S!+??r!E.{!-DT!?Jg!?7PK?w!n2!YCT!AT!?P'-DT!?<˻-DT!?-DT!?%\w?,DT! @,!-DT!?k/T!? !?e[P+DT![IP!?S!?DT!?w3)H|5 -DT!?-DT!?{HQ!ʗeϧ?{\:-DT!}S!?G!DT!?$DT!̪R!DT!?`:T!,DT!T!?T!?-DT!X|ÿ-DT!,DT!?SE!?1 T!?^)IR׿'L?4P,DT!?d?7T!?a^@T!?'DT!?.6T!?,DT!U*DT!?!J!fCT!-yZ?,DT!&$T+z-DT!+?!?-DT!ΫCT!2!:vfu?CT!?*+DT!-DT!?-DT!?d;T!?7?S!?)DT!??T!T!{!gV˿,DT!?%b?֨K5?v!?uX%?;iF$?>T!-DT!?!S!?DT!??!.P(ʟ?>CT!?-DT!?Xw5#U-DT!?"+DT!?0o;?5R!?D _? -DT!=!-DT!?&,K@?DT!?[fFF15!?P!!?NQ!?u!=T!?cl *DT!?-DT!-DT!3(!DDT!?t,DT!fI!?֏*T!=ΰ9 ?-DT!?a(*:?JЁk?nCT!;:T!x!-DT!?-DT!-DT!?7_D!7x  BT!?-DT!?,DT!DDT!?oD\??_!?-DT!?7&?G?!WCT!?$82/!,Q?s,!?xŽRK j?V-DT!?WP!T:T!?-DT!?ͷGK!R!?B!DT!?,DT!L`T!?ZRe!?BCT!DDT!?Q!8CT!-DT!?CT!?0T!N!mGϿ-DT!?-DT!?-DT!?-DT!?-DT!?ꃳ!?-DT!?*2?"rE?)?֙`!m4!?ۢ&;? AT!? qU!o?T!?N3b?ĢR!TyZ?CT!T&z,DT!pG!,DT!J^S!59T!?;drIT!j?T!?B!DT!?DS!?-j!\!?!%S!PLB!DT!?kiF ˿_{_E!Za̿$?!?ΓK!?CT!o^:!?Vo?!Ox#>/MO1>7=> s@J>J~w#>1tC>F)>ri;+d w7ɗpd533[L.D[d4R!>Ktѧ=(>4?W?};;?z:Fy?ĕ>?~zQ?!=k?S2l?F׿':YbrCsڿh^zR(q=>s7f$)?q?MO?&V<#?pQ?zT$?&,?d/?B@y2ܲ{Nޏ&뿌ljY?Xc׿9|ZFԿȢֿ~t?D ٤?ukifd?:L(?$e?Zm4I?FvZFk?oU[?9eX]J =l@ ǀe"xלq~vTeO>o}{N?@]zm?)L:e?VR?TI[gE!A8_e@b. +-DT!?-DT!?-DT!?-DT!?-DT!-DT!-DT!-DT!-DT!-DT!?-DT!?-DT!?-DT!?-DT!?-DT!?-DT!?-DT!?-DT!-DT!-DT!-DT!-DT!-DT!-DT!ħZ*?Kk!?G]??MS:?dt? e?+VÆ?]HrQ?X mT_%tfi 迶&H8保4d ;ۿMտ]UѿOK-˿>7Z;ſ'2^ ?'2^ ?lāc? ?:FyG?]~'?][?Ĉm ?Bx?ccL?'2^ W[,}I!{뿽?TR翙rpǑ> ߿o3tݐٿ ދӿ_ ο`ǿgh`6¿s#?Ð!?d?|?wl[?M3 w9?@"^?\Y3?I?fͩ?(?t4E] ??a~5 ? ?B?{ Ǻ?#f 0?bd?f)8?\\ ?F?.i?G?'zO?I}*?:_?T?}њ?݇S?_u̩?^P?hy؋?P;K{?@C?h ?m?1LV?or"[?V?B@?0,T?63f?&?ZA?"?gd?"?V޼?3֚?.V?^a?kɳ?ٵ?⑫:?Bz?!y-?rAx]?5`]w?gƣ?M{y?+?ݯ`ݜ?A?ur=?!?Z_?oH??r(jc?6 qL?)m?y?H?A?rqԎ~?=|?_A y?AXw?s+u?+vmer?J pp?in?Yk?U Ri?JHwf?yd?;;,b?j(_?Id]?{4Z?X?`KvB2V?RdS?/p)bQ?U~N?5q̎L?sI#J?+G?~KE?FB?٥fp@?g>? L;?ܒE 9?Z 96?>K<4?ų1?M{U/?^@,?4w]k*?nZ'?,~%??-#?_[ ? Ƿ?2C???$?Fx;?:Z(?i&K ?;L) ?7^?:&?d?V ?ƛ?o)?"g?rK\ ?W?{_?afp?~?h'r[?|q?C?fY2?4@(?\ ?< ?Yx?>(?9T?x?-? !?={?k0m?$?A>=?T?Br ?|p?Gյ?Thg9?SL??oy0`??Y ?Lz?\ݠ?g:?T`? ?|M? 姓?#?:9zY?c ?Lg?`]?P/Ͳ?8Q?6_Z~?}2{?Kx?C-x Pv?-:s?|p?+ )>n?`k?Gh?b3$f?7pc?`?X^?>0M[?6X?"ElU?te"S?ehP?+*M?vJ?}@4H?vE?ZB???M M8=?Epw:?R 7?U;u4?%F02?I7k/?h),?W <&)?"'?GQ"S$?~m!?YV?j4 ?tg-?G,a?H?ܟ?( ?{&, ?\?YM?Ϡu6?.3Q?K?C?on?6?j? l?G?Q>bF=?*d?B?Pf?.A ?u?O)?uF?֏z ;?F8?n|t"5?y2?4/??e,?`D)?:&?dXU#?L> ?(h?N!z?#k?N_l[?舘J?9?3& ?׹?)?Xq?.1?n6?"?9 ?Wy?4`? PG?jM,??F?>J{?%K6?7?g?`?}*?? ?uu?PJ(?w)1$? i?o?iFJ?$?0qe?װ?rh%?]v?h]?g2?6?g[ܝ?@?5 ?XV?A'?ߍ]?nH=Ɋ?瘇?xg?u-6?f1~?+ z?B[w?䅄ht?f3q?ݛm?~#j?01g?ٟ.Xd?a?FĨ]?'Z?sD6rW?7T?}]\;P?D?M?4sJ?ooCG?.TD?F-36@?lo=?:pF:??r7?Le33?jӀ0?\l`=-?3")?Pҵ&?yp#? F+ ?n‰ ?x+?kfԪV?2?(k?\| ?$T2 ? ?Qe?dA?s@?m?Sr??>\5?2__?(?.?W??rY3?o?2}ɵ?1W#?ѭ{?=1ҡ?GWǬ(?lg}?Ѝ?p(N#?E|t?^M~y?^Ts?`l?-e?r^? CX?3Q?J? D?֌VS`=?Kˤ6?M"/?AW*)? mk"??d?S=?dS'??d?rJ?5??0zWL?y,??jN?%/I?o5U0"?4.U?Ȇ?t{??:?#=C?uo?vQ#,?œ?O?}J?[>?dx?)-q?݄qj?Ec?\?/4V?uߗv5O?TH?.sA?O:?_3?ǒ,?[%?G?9?+?OFB ?gHW?l?oC?+'?T?~$ܵ??e?z550?yd{?%? _?#?ȳ?̊%?e-?ʘ4?0:?N.@?B*D?VHx?gM$Kq?ZbMj??9Nc?N\?| MU? RLN?,[lJG?RlG@?*pC9?!?2?am9+?3ld3$?e,?^$?,_U??k?x?]< ?i?r_?]?p?;Ŭ?l??޺]z?vv!h? .U?+dA?/-?4G$?@5i?9?ԁ?O#z?s?۵l?Oqe?ntW^?Jpg?vi ?K?#?Y8=1x?rl?q?VwNj?*^c?kEso\?G>LU?N?ngȧG?nm@?9?~2?e>j,?dx%?f1?H;L?!㈐g?(uރ ?ꊠ&?,j?:?ݴ?/`$ ?&`B?xe?q[݉?L= ?Fg?"?%?KqaN?jx?r 2?\1Л?IQ.?O,?Z^\? j ?C̾y?vr?%l??(uZe?^?W?NP?/%9J?{WsC? ; ?KC8?r31?*+?;fM$?-Kս?qe?i?LpH ?L*?Q0?r?()b?˄J?B?".?:?S?k ;?8?~`?M݊?)e;? ꔨ? ?A?q%-?T(踎?5B;E?9֠ҁ?a{?|8=t?n?" h?$i*\a?8*A[?|5T?jpN?:.A H?ܱA?$AB;?[J14? .?\{0 (?^A!?&e?AN ?İ?zbX?ue?h>ͫ?)V5W?$?LĦn?Lsc?.?5L?!{?nJ)1??P F?'&H8[?>z?>dө??ptLQ?jh?Wn2Ԑ??)`^?(B%~?涗w?O`q?91k?NOe?u-v_?DtX?h\'R?ZzL?_dF?0:@?$:?Si3?z-?׫Tܞ'?; {!?,Z?9?&:?'_n ?V?'D?I^?=g`l0?`?zǓ? #)?+~”?c_u?NY?Ǿ??pyU)?{ t?h?[?dO?~-BC?j-7?Г%+?^=+?{gA?G*g?^? ?,A?0?U)3H??2? &?>۫?'e?`@?=?+y_T? $?K?+o_?*T? ?&)4?z ?$CZ?*Ƀ?;x?ĠC1l?~A)a?8K[U?2$J?7>? j+3?̳'? }\??W? `?R -? ?e)?I? Ҥi? ?4&T?8-b?VT?DÓ?4;kx?j0}?N\q?4w(f?[fG,m[?= h2P? D?fp9?Xt.?禗g#?<?PI ?{1a?%q??i?̨G??m?S\?cdN?xD?А=?9?Q K9?j<}?\wBr?PnCKg?W\?̓gQ?EۅzF?vʐ;?פP0?%?W%?Jt ?:1?G]Z?yk?զU?MN?#"?d ]?-}?v3ۮ?0?'rf?B*? [?uOy?9 8n?c?YVY?N?ƝiD?({9?g+,..?Z{N$?l?.?\??غ8?7?!=~?QH?_?4?7Isð?Q&V?}3#?}h?˼!?x|?z&dr?%[ h?y]?, bS?/TI?=>? |4?M6*?/[O??y ?#PO@?. ??]?@s5T~?2 V?{1??Z?bt?ե?Ȱn?v]c?ܣJ?i!}?hs?=:wi?Os_?xGrU?WjuK?i{A??7?ac-? #?!aƲ?;?`I??e?0*%B?]ch?p?9V?B?᥄s#?jVZ? ۋ?Vlљ??hV?:ܝ|?Ώ`r?M)6i?7_?؉U?3rP 3L?B?8?ԴzM/?;8%?>?"ݟ2??.AOe?kA?jtR?y?j9L?E?S?WGܼ?}g??Zv{/?I[?DJ$\?8PS?̈5z?q?͈,:h?SЍ^?WvU?D?L?]qB?,p9?i`0?aw '?Þ? b?ҷ>ge ?u;.?i?g??.?<[s?k4M?w g)?2 ??G(8?qO٬?~+|?g#?%͓?gz?z*?_z?Qr?+1OMj?l b? l&Y?Q?kJJQI?YvA?ZA8?gB0?/Ud(?`S[ ?rQ3?J]?#lhw?H?;"ѱ? ?[?p? a?vT?)vJ?I5`D?sU@?M|2g@?'B?kH?.~Q?A'"\?f:Wk?F|?Xw?ĄCo?a`g?_?6X?D%P?׫0~LH?}Kv@?8?tV0?:2)?W |:!?7s?촉? dT ?D|.?fSr? K?m?' Q?I*7?a4n?X/IK?4??::p_?D(}?^&?ah?&?֥f? lׇ?J?x.bx?ꑾ:q?i?'446b?>,zLZ?L=S?!Y4K?nPD? pV?ᅍI?-3q!=?vQX0?!#??C ?Yf?&H?n ?Fg?߶ ?t@G-?uH?0(?W\{?}.?V ot?SSlr?jf?*[Z?JM?b];A?q4?nrV{(?Tt"?M.?NTH?n8?:?ʄ?A5z?veE?&OK?|7{3?ġ??V 놉?e,o}?l]q?Ԕ!Pe?ѶKHY? EM?v+FA?llM5?rY)?Aύi?!<?+e?Ӱ?S1?\?=4?f?T8?yAS۲?2~(?aN?2??-'?a?(?8h?3(7?9pr?G Y?T?Ŏ?Є`0?m.ִ?ߛˁ? @1?V?V?=3vF]|?b1q?dq=e?AZ?n` O?5+SYD?ˑZ]39?.?rl"?^9"n?(Ym ?׃]?(dH?ҫ??|f?C&? З?S]h?k>?2?@F?Ԉ?U?4ML?ao:??dQۄ?X逊?DqD9?˶Ʌv?*l?`Ĥb?/X?HnN?3)D?0^o:? >A1?`B'?(m?w?J ?+2? <4A?#@?A:??3ǝ ?GW? o?!?8UqT?Ruన?PZm?v?ދ?OK?[x?y1o?e?օ(\?X ]R?6}.I?h??iE6? ,?gUl#?W@(?L?h_E?<?j?}NNB? (?"?u?,[?Ķ?PZ?bC|?.:bm}s?mBbj?-Ka?[l8X?"=)O?HF?E=?y$ 4?vj+?~ީ"?.)4?Es+? ;?FO?ߗf? -?M[b?Tj?E??'mD?Q\v?ìͬ?+?"NZ$?֢e?e?[I?0@z?V|Oq?h?h=`?^=^W?&N? \F?=?x-5?,? Sd7$??D?b>z ?1?)B?OV?-:?#?N ?|M?k]?܃?KL(?۹ͭ?\v?e#?(Ӕ?Ɉ?lͿ??z#{?(ls?łzk?G @c?)0 [?b&R?fb⬧J?A4{B?E:cS:?e.2?FH *?}ʈ!?P?(Ǟ?pq ?{WǛ??gE?΁?:b#??`@??C??jlY!?Ӿթ?yj?P ?!n@.?ϣJR?lz?Kz?Fr?PRk?6;c?籠t[?B۰S?rO|K?|k3D?77y?X? ?aKջ?ɻ? ?k# {$?(c5p?pIG?ኻ?YK~?6&r?ve?lqY?q5M?v9x@?w4?b8v(?G.9A?N?8Jn?? 9/?ߺ?dMjtӺ?ceǺ? [?7~`V?!rmW?&F\?ulBh?]x?IͰs?oԩg?<}>[?FGO?rD?hsK8?錨q,?] ? g?-@ ?sM?BV?絎n.?Dڹ?YDι?YnKù?Q??2#?Fɖ?f2?^U?eF~?nQr?kr%g?r [?DNP?̳$OD?59?2^/3.?x;"?rf9?P{D ?O \??@?Y_.?eM߸?Ը?.ȸ?Eǽ?3 ?1͆?yAn?}s$[?GWL?. tB{? fz=p?a~f=e?6BZ?<@KO?]»{ZD?)m9?t8.?^#?N\?6/ ?%C?#OH?}?P-?*׷?Xk6:ͷ?V·?/cϷ?|!?0Wx?' ԗ??4?o 0?hx?;qm? 8Qb?\X?zǒM?YC?ؕd8?j.?6#??&by%?:?d9N0'^͂'09'Ŭ/y* t6,:pS!5E^jeПe [V󿽿󿯷:iO$b >R&C:@b.F$}:6~U([MyUM8ɾmf?jH63} [N ٫LQ4KU6;֛%du;h)ڵSW*_y & :ɳq4guH&UHAh#:߬P -n?W|tʪ=(kug)՘QNL韦şjʱ;iyԌ.ףjy$z_rۿD PĚZIݧH,1n+B󿊿5G -ܜg)u󿡍0š󿟪L󿌬[jn|w=%@=󿼺3܃j"m.qO-4~,fI2,h;s+d* y)iz6)Ziw(mD'Ct &-<9&xbz%w$Bk#T;#'|" h!D U$< )T|NG- lZ<|kt$OL:OyP=/m=JkHS!>cwW&tU=ʨxnhC~>l5FI-\yh TBfNކIP[ÊW⣇1L8lEqۚ 'JNNXTs4ۼ6;s7֫gU!:^*T͢[ [5 Ƀ3`3k0+ȢGI۴򿯈AIӥY맸3z4% \֜nSp0Y7vn?p۽YHӹT~Sz2ی% ~owVPo¶wZe-Zb)u_hiͲ򿂓(\8"mV ׮ p)pA,[C:v򿶼ߪ!$qcH\= }Da򿇈:&M,ﵣ>v 򿝐E2]Qx3,S;9tRأ/OdWt%ĂxRLQDw򿤍K ׺yUP܂P&]#9ٜx9Lr`~f%tFtia;F2@x򿙼۲Uۊ*< ,\>.boOlg4U҆˦4=eT.>sǂ}?|(򿃏;Yκ0~W}tt}dBK|M{{P zB3^yR y @;xlVkw1v 1uw6tw`O*tQYs rτkqeɣpp~SEo=)Dtn߬ģmG֜lealo0k^j!p=iB`hc~gz7lgFf򿾪te򿁣/dvc򿁘b}d,btZaihF`\_d}^`H^ӵg>]k\&[6Z#UYi0a YzW_V򿼱Uk{Ub-T`YS> R2JjQqP=p P57O'cN^&M>"L4Kč#K(d>JXjItM#Hob Gg(pF1FCE3Y0nD򿱡JC}iQBaDALq%AoD@$ o?)/T>]9=+i<(u@!dw7h 4򿞽#]8.& V^(}E+JTo ]#B7?ic l-Ag7@PY߾ep3 D'H '^Ebj0UXR?/6`^ kV"FCgkL@ԏGo-a5t'Pn DhDZ^|⏰tORz񿫖)??bm*W&,Ö^uy 5ݓXt${2'qԘAvǿπ8s)񿒑tKUWmX񿆁Uc"{񿋡 M{:tU\񿿚~ҟ񿳾fud%g/%E,DGf hYdڪ=C# T.B`O\pG.7~,0(,Ձf92HORr~%\:z~Z`ú2XQɘ#q]!,s EϺ(L_񿹓$ wZ,K%KjUѯ^񿥎*dz S#n"R&DA7¬_/}񿂨#f=I񿱥\ثx\Ϙ[J%2qO@(m-(IűڨYƤfh䠘 WhA;UX-u2zϒtОܓ̜Z*<"񿂖@?+[j(xىJ>hǰj(̔j2+I(!M=IXTtضc)񿳶onj y}@5?xJP'jgkkczOqv\`.j8׃q񿮎\ vR' TAJ]\>\v~ }w.f|X@{˻z+$y!JyX A-x0GwRavl{uTt o9stmcr1#qK|pޔ`p!p,o_ Fn0._m:-xlA(k+j(>i^th@goj g+%fr.=exUd$õ@ncòxb< a*`OgA_-R^^]jiO]@r .\}'|E[QG]ZQYtY ٭=XlʝW񿹱VE(UZRTzأjTpS*ee.R񿰱GEQIRp\PűrOv҃NHMϘLLK񿫦ЃJLI0UInH&HDe~u+=g[@ֿL݁Vt'aWÖp^̕6֔j؍ߓƥA+ @m1~lG,M &B𿽃'_']0`v9/BvHJ e3SZ[„) d^l𿽭^t>;|@/P no,.{~u}K_|ɐ>{{j.z 'yccxqw9Yv\uotQsWrq q ] pҰounyg!m*(lP.kM[5jHDj$=ns(<;*,;𿖝/: j39i68m:7"`=6R3A5OD4q[G3J21q$N1{5Q03T/`W. >Y-\,~_+q2b*>5d)Upmg(ti'𿬍kl&/&n%1-q$kws#1u"brw!7y y | ~XM)ہCrͭw|qy% ʈlja𿟈OĸafˎO|&$rdίS4ޓ 𿾞 K l6 5z 3<?5̀"P XDkZ;A> >`r>￶u >L>ՠh>{hL>Q=+g=t<^, <5;#q@:[.9Z7w6{J5Ae!3SN"2ۋc0샙.￀,y*~qG(%zU#ￋ3Z!ք`e=41~. ;U:ݫZ￳`d{P￱6~g? Wvۤￒ]עҌ:ҠָC͞ￇT0ȜmÚￒTP4Ͳ￴/Etￜrￒgpu￧/ￕ΂￾R|ZXŹu￞o~W6h|RoEKazϩDZx΋"SvCNKt4Drreh=pʅ5nNC-lݧ&jf3h￝ځ6f+dsPKb?[_;1]a[￫ YￋyPWw!ryUￎχSս'{QbSOkMaWK>:IڈGȳUEￜN0~C￷{LtAMj?Љ4`=zV;K98RHA7RwG65ա%,3.|hl!1@/ￔIW -ʍ+GM~(ￖ@&￨$F v"5 ? Bh9⤤￯^ž7kitru/t￡_GgtX[N VB R5ￗ?q(￝;wvaB'3F9^> =Wv=ƽ,N:Q}nW w㏍i$r*[(GЭL >zh/ Hd:?}y5BH>J9T37D5¥3p0pQ#.r_h?,#E*3(et }&|Ve$OkxN"v 7 LdwA˦|u 鬨3代2xسVN` C/H 9ğ/  'wHvG$8F5f.hDniĞEPW`7 9N4FXw.W>qy-ijiO%65r5Fl5Uoką愜|2bK8G#64I,DY]P+0?42-_AEW~nmbfQ|~J)6_Jg,~||}7 ~y6kw qDuY s @wqHXYo:mXk1h% fLDdCGlb<`Vc^HmD\(SF%Z(b X lU{#]S h.QaOhM WpIKW)Ix GAH֚De BF3@Pq>]o=i<H:8ќ(8 '06U3e I1''y/D- d+aD);`s)#'_&%"# Z#Rc}~?\Tƒ:u $xNz5H uip T;xN 8t,Z_ ,7vcJDz쿋UU7^=Ud<쿘/,;Cv쿕cӎ쿷>kvH쿏n%쿒2‰쿗g]FTƈ쿭MuRkȊ.Z 쿵ELe }{+YW"3tyГ&f_~>;1~I~Z쿎,6ɨ ~d|~:ȳ쿦x((O޴~'Yk4{g쿍) >Ťb| W{1nV뻆0[8 UA(/⒈쿠-tO쿩X(G)f쿔#v݈5u쿐9eDkEJ ~쿟h{n>&ywc\8u쿓^sf|9 8q)^olbWjjh`ͯvf/Od_ (b쿤J`]쿂r[쿛JY쿮cWe]N6afL񓝶vJNNH&*'FQMNCPcA-6i?$?a==J_;\$795v7 ƭ44\2쿑I0쿗m.쿒E,쿆3ˇ*'쿾vG%H#4>y!IfP/Fs(Tn.H`2QU(sMU~jZܟ1wqt鳊% %Vȵ 쿊g] b:^9쿜w+)u-z߯hd]? =7 EF Fsn9뿌mroBt0g2Ԃ+cd4뿆ؙqpo뿳Diӧxj%UM:Jm4x@yܖmMV4Xp ,'O뿆iӉ`26<z뿎rNɿ![{Ɂ~Bv|ccz 8ox뿟TaCv`rctvqKvּo뿆]}mΉckR06i9 g6d%9`)b뿣Xa`܊T^\T'\0[YFW뿾-U]rS뿮K @EQOj\L뿎ۼJOH뿅6aFm64DcpB뿴?aD=뿪V4};Q=bO9m!7mD4뿧72R0뿇i.U â;,׎* *i'뿼>%뿫~J #CT!$]&h3gI%Ctm뿐Dُ>뿍l2 סW 뿾ꚲU x'fwCMo4ÚUk+=2UqEAP (Q꿘JR28;#꿕Z"dوؕ꿊f1#l7G)꿐' gq.zaJ꿆]꿝jlڮZ]%-*)wTSzמ꿻"okf?TZ`߼꿘3]h'yDP;5Y bIg꿭Yn꿕Vmd`y]U0ͭ=꿖(Ф꿆/$oiԘ?꿎a]꿱qLߙѮRk~5*N꿸fV臌꿮O\꿸+꿮XQyʁ. 꿫9Ji}꿙ߨ8{ y-RvtC urY!Ep(FZn`&kzi꿪[݁g/|Pe[ c>*`꿷a#8^쇺?\(hA\Zз6=+X03Ua`#S Q꿶fO꿌֛5M K|~H꿳4MFqD꿁Z?B꿠F@}4O=꿳;꿆$z98YI75@2qB_40꿢fȃ.꿇c_WR,XU *uSf'd%a# Z!cjI),m4WmCbF^:1꿙B6- uj mV8 y꿢_3jWq^t?G ݅:B= [x鿈^uFE鿾'JV|Jx~ȗLdBm r7鿥{0R38 Sْp +W鿝e:XUM&-"N@}ԃy]kI+鿐@֎ %'ڦS jb%դ+0>[˵鿺Bj] _ gD"4zv@3$Ъ鿭Xϝ鿔pwk鿏9鿔 bԟ!Xoј8=鿌 鿔 ^fؔtB{{s A鿣mCݡ3܉ XDwU=&Dc M׳~鿿&P|鿐zz鿨‡KHxve@s$~q鿶/~o鿼6Km^2ki@h4]>f鿁Ojd鿛`Nb*F`uꨲ]g[kY<{4QWCJWU鿒;R鿪$PC%NdTL鿋>Q"J.۳G鿱*E_vCWA鿎R7%?鿡<鿀:MkT8DwZ6t (4鿘qm1iv/07'-r]+鿎*)鿎W<&vy$鿮!"鿴{P` }-d<+e鿟5f=cm{0B鿇u5ݰ 8e V{P3n鿲X鿢o|hd(26^="-?ƺ?޳bB?;-?r|?뤳?4?]K?Q5?l{?ϸa??WdiN?t b?F?U36?^~[?l0OX?5`0?{1G?5H??z$\?K>?IϜ"?Xhv>?@G?1?6K9?@9?R$?bҩB?Z;ھ?cf4 ?61s ?z]?"Nr?T?-](?=8z? Ԗ.?l  ?m qH?vi?ޱ??۹E?I?4Cl_5?^E?~N?P?Q9K?0j@?{T -?]T\?r1w?%a?2Y?%1ca? "?(qۺ?J.?R77?tWyٰ?U|Ws?/c?I}萦?yY_?3Է? ?N1i?lV*?fPjN?Ge?(_o?Ҿk?gZ?b"M?]#}W?P_8?v? pTae?G0?&;Ư?ILgݧ?:T?dؗ??=?Sga4?♹/?*0??y|?`?O=[?|!6?ko;?$B܋?Z%6?&E? r@?~wRZ?mpS5?ںB?{B"?_?-?Xj{?9nV?S0?u ? ?zV?j'6A?}?d餢u?ˍrO?Cd)? $O8??ٸ?f$?4{mm?q:G?-DT!?MA?% ?/!Ѱ?V?tAͭke?9dY??#?g5s?p?Ҧ*B?2q?1^?k}8?H??\溋?z@?i~?EX?W鬳3?ߗ?0?&5? bڟ?Ubr{? \V?1?8/ ?L rѸ?X? '?i{?!H}W?w3?x&?G?#Ee? Ф?G?W? 87]?P4:?Qś?G|?;?;.?N?Ii?ojG?`)%?~ ?>?쵀7??d?0{?7RZ?2<9?&9?}?*ED? ?nt?Bۤt?hT?TS4?Cg?GE?L2 ?gf'k?tՓ,?xoR?#"~wd? ?r?Y֢5?ˤő? ?*^+?0,C?{2.??~t?PIORW?T?'?"ӕ?p[p?HѪy7?uQ?RCE?r ;?d@dW?~= ?pVn??$/|?AfG?A5 ?N?1N(ߧ?[~s?Av?? ?=~q?}jt?wւr?+@?v? ?`0? |Q?y?A g?2è?@R?`}?NlF?En^H˙?]? ?(TUL?P$?5l|o?8T5?p?H|?:+ʉ??Q?W??ϫ?;3u?:~??A ?6S?BI٠?f\ l?{?@9?'"?Їm?9{-?xK\o?˓ =??n ?*|?:ܨ_?WW|?MgM?pw'???la?7"s!g?,F:?m ? ?J \?NŠ?_?pyqK5?J ?ӸlT?n?3q֎?ڀ#f?\=??C-?ܒ5%?9j?xay?ɗu4"S?ЪaD:-?{/{?CĿ?m {?,D1?Ba?򅡾?qVNZ?&"P?Mͽ?}2q?\?C?ut?ⲝ&?;KDy?י6?J§I?.?)7]+s?\ϡ3?;2TX?6(?`Mw? <9?$?SNI*뿹?K⃹?Q9cH?T an ? Ӹ?|#A?vc_?U~&?9E?]g?Iؿ O?9 wH?LjŮ?Y !Aܶ?,W⦶?l1q?I=?0 ?c*ֵ?;$^)?̨+ѝp?}>>? ?ß۴?z<'?wKz?Ѥ[J?qZ_?J~M_?4.<̽?3/?o4a?:2!V4?'*v?Zv3.۲?Y|?ݐZb?m X?io~,-?S?mOUoر?9q>Ů? f?^-g\??3?ay ?e3?[?+?#+"n?G?L\!?!?GƬ? `b?d4$?+TЮ?rb.?@?~*?p?Wbn?倹,)?Fl$?)4?V^&^??sؔ?}xFi?8\>?g~Q?ڱ(?.?#ΈO?ݗuul?Kb7C?XG?Fם?8Xʠ?N{?[hu|?29uU? z/?_ ?Jǟ??B}?.@f3?u7?4γ?7 RY?'?*̝?o8?j@@?c|W?՜X?wt?|p82??ȱ?^-lm?AYA-? ?rU?F z?iU? ܫ?oqfRt?~J=?1L?E2 Ж?F)6?)+f?%ϝ1?C= ?Jdɕ?ēiҖ? f*d?1?S>?h#Δ?$?D:m?Y=? OV?˧Fߓ?I󥰓?sPr?Ab T?O'?Ҙ]? {͒?Oϵ?tݡu?GpJ?R?:Hҝ8?xˑ?4CT?ؘqw?nyN?x Z&?=L?;p;֐?R?菖?`?^Z:?lF?}5ݏ? gO?9H?i??8lJn?|&?4\zߍ?S?ꤥFT?r? @ˌ? s?Ө D?;d??Q?-W??9@?U3?~VH?pB?!? ȉ?O#?ǀO?k}1?z!Wو?d}D?eqU>e?V~+?]WC?k?R.]?R/L?Xᾂ?`&V߆??$:&yt?)l??_(Bx S@>v~@.BU@5Cc{ k53 'U@mUs<@Tq ZĆ&@JFVB'!'ΏBx@kdyk9\Bd)+@ܜ0B`lB4/AhBׂ -‚Esvz>T季€7 -d}3?9^-5!Ѧ}I,]SAwFAZ@P} @hl@nrA?6tœxRXBBD"E@ñ@g$ `EC &JxA~ 1 hB~S/$%8TL@@:>&A#<^a@\ϻ8Bƣ @9f8JoW`41«Jh:©)ڦ|-[?STG2>+=Y>dTy8iUZCٰ./ژ1?"07@A9nܡޤ=/X4hp[\c@ g>“5ڪ^A@ $>Qv@ _BqBKfXQ?9A^oO:>\2AxĤ{1zZ@~Ƞ8r_B{7(]N/?M(K3AT?pAGCO@SY*w7Bs@ }06u2r#AB+A/|5GAQgWA Eg\O ArKDq:g @[|@w$Amw kAy,lX?Y^fT BBhA %4|AP\@7Z*uuv?CM/T=P8C?)C- ֮5AEOɆUP) 9%\<2濻L]a`A;] zh@ik=~ʿ,ogI@,țBH]^«ڷuZBt[ڷ~3)vB^?_Ѵ5?K@^sѿmT3Aл,țBsz =VAswN@lB7+"A ZFA'L"2%G@3țB#r@Af%G;6Ae+IKc mR@hVƊp~T~8+IKB*Lf-țBY߿tz# G@bkLf /&…1% Rw,AQ~$[@G1 /QABL:')@{FʁUlbN,oAE+IK.R=5EP\خ[WelB$/J׹4&Bv᱗X5/@>ņ AvNH2ſ`l93AT!8BݣwvAL @J j5 4?`Ax##[mM@O!*[@;o*µث+IKPlBXmaL֯KDyrR6a&r֤E03#DT!-DT!?T!J?%!?tq,DT!+!D?CT!42!?0T!?(DT!?g5T!? -DT!?CT!-DT!h.-:RIL0S!?"3J!?{G!?#DT!?|.T!?!|?>DT!$T!?-DT!?_"?3T!b+DT!\?DT!?2bi?&hS!ƫ?BT!?-DT!>'!?r^$Y1z!?}4T!yT5Fvt DT!?]>?I!?WDT!Bul?:@T!?$x?! -DT!ƚS!!?k-!?!?B-T!?rDT!O[!?E!d?z!?TA!?Q?2!-DT!?eS!?0K!?K:Y!?KN!w ?e5!Gݘ#Q -DT!?;T!WnS!?,DT!#z|E[>I>9>e@>hk™>>[>+SΉ>WVsZ>B}>)IS>US`B>1<&2>Ѩ.~>?Itw>Ay>EBE>+TvEl?Պ@7 r@ԡ@y@$8~@%uV@ئ%@0[@Ii@f8@A߱@yTЇ @''gX@?2giճA^h A* Amd1l1Ad6@DyP@iX`0AWfX7A]l9AbOjAKjAb{A%;A3(0AxK0HGA OAdAbAl A%An oAEy*@-LSAA ƼWAA[ BЅ@lB'ҬaW B%#?Bԣ\B-RMHB@lD" Bgb@Bߜ@Bj>0PB׭"o6@㸤;@tD]>@OKkzB +B :B5'sBW0B#k\2|BB@B%B[TRƂB˟B[1BVB~B`DPrB8h8Bg>^BmXWb9M@vSW@;W@ Iz3r@lZts@b4@,Œ@k{d$Ն@0 v' v&EQKHR cz _B:LS?_X׎AF*AAg e_(Bx S@>v~@.BU@5Cc{ k53 'U@mUs<@Tq ZĆ&@JFVB'!'ΏBx@kdyk9\Bd)+@ܜ0B`lB4/AhBׂ -‚Esvz>T季€7 -d}3?9^-5!Ѧ}I,]SAwFAZ@P} @hl@nrA?6tœxRXBBD"E@ñ@g$ `EC &JxA~ 1 hB~S/$%8TL@@:>&A#<^a@\ϻ8Bƣ @9f8JoW`41«Jh:©)ڦ|-[?STG2>+=Y>dTy8iUZCٰ./ژ1?"07@A9nܡޤ=/X4hp[\c@ g>“5ڪ^A@ $>Qv@ _BqBKfXQ?9A^oO:>\2AxĤ{1zZ@~Ƞ8r_B{7(]N/?M(K3AT?pAGCO@SY*w7Bs@ }06u2r#AB+A/|5GAQgWA Eg\O ArKDq:g @[|@w$Amw kAy,lX?Y^fT BBhA %4|AP\@7Z*uuv?CM/T=P8C?)C- ֮5AEOɆUP) 9%\<2濻L]a`A;] zh@ik=~ʿ,ogI@,țBH]^«ڷuZBt[ڷ~3)vB^?_Ѵ5?K@^sѿmT3Aл,țBsz =VAswN@lB7+"A ZFA'L"2%G@3țB#r@Af%G;6Ae+IKc mR@hVƊp~T~8+IKB*Lf-țBY߿tz# G@bkLf /&…1% Rw,AQ~$[@G1 /QABL:')@{FʁUlbN,oAE+IK.R=5EP\خ[WelB$/J׹4&Bv᱗X5/@>ņ AvNH2ſ`l93AT!8BݣwvAL @J j5 4?`Ax##[mM@O!*[@;o*µث+IKPlBXmaL֯KDyrR6a&r֤E03`E[>F$>P>?>LTk™>r>>PΉ>"VsZ>}>uIS>%LS`B>]<&2>Q.~>>Itw>Ay>EBE>+Tvi?X?oب?._?| D?"h:?9럂?E*e|?(29`?-DT!?-DT!?^?]‘m?)ǚM?zɆ?T''?롢?N|?6C ?)V ?C ?֯ ?=ڠ ? m!?EA!?xg!?s !? 5!?lP!?IU!?s`!?2|!?OXW!?Fķ!?y`!?1|]v?Y? /`!?"ͤ!?G!?z@!?#DT!-DT!?T!I?%!?tq,DT!+!D?CT!42!?0T!?(DT!?f5T!? -DT!?CT!-DT!h.-:RHL0S!?!3J!?{G!?~#DT!?|.T!? |?>DT!$T!?-DT!?_"?3T!b+DT![?DT!?2bi?&hS!ƫ?BT!?-DT!>'!?r^#Y1z!?}4T!yT5Fvt DT!?]>?I!?WDT!Bul?:@T!?$x?! -DT!ƚS!!? k-!?!?B-T!?rDT!O[!?E!d?y!?TA!?Q?2!-DT!?eS!?0K!?J:Y!?KN!w ?e5!Gݘ#Q -DT!?;T!VnS!?,DT!#zMW=ChdgaL@$},cba\ԜnejQކLcW |i@F&nhEg+9w_L[Ei8ϱ'xx=_G l% _C4+k& @9qXD xof0{YC<>WLQdʙ_7su,ٜqZBV+xI`3`1l^H+wgǑ96yeG+/&Pa7Abun$f ]5*/ 5S8$bgN0g N,Gn BeCdіBaZ63U'JGf>`sKV@Z1} K'QBOyÏ_Jeǖ h{⍑=FV y^86d^@"kxՂYPݵV@|lyBMoPli0a헫N2v +܂8K/k2E6&goyKSD'H$bFE=wP[ǞnIw/cʫlLHk~ՃJ[sf [}~ݴ,n܎#_)+i+ BdpH,x}"w³uQ/M4~r_gO7j.s#KZ@$_OlIG nmoۄ@֦ySfy_aI팀$Þg(:M1W4n e!ww \B UʑVfM_jzgB>\'J9Tb)B|#MRZTO*e!$_+Wú6p uU _TB_.'Dx] d|"`X_ 9dl|+w^`|OjgTu__/|! V/XT'/w׷~4Lc+Kj`ꨅ7F̋5A*0b?q/P4ab[T!XvZEr,ʶS\1fp2\z g| c{4{HISozߓSECİoSR eIA-46J}i4,X!+&CSfs0#J4Y0P̈ +,rn BzO"]i#5d6PjKYW27ziN3Vve#xsjLȞϑShb0WOh9H Mti~6vuGVKmR)|O5I!R PADHkk[r)Ǜ5Xl!%wXKJݨd7h甙_,} BdiǤ>CA/q!s[|qn "3礠eDA7kb? fCRoc}|tϒB=OKmk6=N,.H [j,@" ^Vvw|e89/|2ܜvZlNfXsz  _a'w A+[S6Lvxgxz(Ioy[9N{E~qZMɢ!FbEP\^caf;6GEgpo/ONPg ڋynt_;dy,sE4:O@`[lP Y zO >nzQAIh\v%vYIit85DʤYjgF!ltӫw٬6Ao/OybJu͙_vQoMchmϺM7XBl y;DzF7cT[ 'ݧa U4C[ae0l#yj)B)Xd 3&m$ pbjtEn]4K~=PMO n9/gjIe(uCA?ZCC?$ Uk?{9g? Q?$΢?kf?rh_$ѤIe?3wnżڿs7G1 ?I_uL?A)a'V~S6׿CTRڿV)p%JD?oDٿ!47k ?,U}}j?b>?{ 1?YN?B￦ c+?ET ￁}69?vyiI4b?+p6?P-EL7?^:?~P?']c1?3C=]?.?.'c=?>!o,`߿< ^?Ga?P-( ? ?fWh1?guBx?FEa?EҨ(d0?qZ?lz?ōnٖ?x^L￧̭ɗk?AdX ?!˘?!6տ Maܿ C?Nf!~TNܿPd?}Թ?עSLbʿ~>I?hO\K[DFwڿ)ZͿK&7q_Ko?\m\?Ȃ41?ڿ?ʨc>9㿘 k{iBX?4\?<.[?HoӰl?`Ar?r@JHVֿ%ҿԿYpV|ٿQGިPBظ?;?~gB?ۿ9_M?GKiA0ڿ5?뎩?㱇gɿg6ɼz&!1O.Bt?63E&@vO˿{xsbM濵.qԿuJZ<[? ATu/c <ￔyjڿSQp'f.%忓?pb꿊Vq})濟)ῼ6 2dT ?qx4D9Vk5zY`9RFпed9`v?0a+1?F[?_?x`0\tסi?C{4X\=޿,￟@4￞x\!뿼iGTl(?N.Vɬ?~Ա?o+(?F a?H 2>пP'?gݿ2e%N{;6*?Ɩ/=濏$F?w'lx|}㿖.? ѿ8?58f忁iFu;HGO[?AҖ?H=|1ҏeοP n￤$zZz})L>wُcos_rn scalar structinputmatrix&*eG?vȵ\?˽äV? ڋV?m8+1B?4?Z2)?yG?%A?馠cC?Bx >:j>sj>9I>Xn>a6b>=+`~>QGǔ>fgȤ?> >r] R^>2>dP%>/,P> a>oNl>J*kO&>ٱӍ>Z$\h>"?XA? #&=?pp?~w?F? f8??ssA?,V˯?kht?R??hk?EYO.?]N?|6x?+}wt`?9Bwn?qM??MC ?{Q ?*wzN ?4U ?g c!?֘!?J!?M!?D!?;>h!?lpC!?S!?Y!?50O!?(ȅ!?$!?Kv!?!?!?o:F!?z?VX~?u_9=n?._ <_?a?Sx·?"?V4?_'?(?>v?爺s?zJ6x?Kn?ZHv?[^ؤ&Wȗ'iq]2G uF0 dlA{> 7aA89Sͫ\3맛}ٚtPuN97b€b\fUa#bB#@UTўjc+9 e?ⶻw\DQqt,i͑͠ I_BEt93( Z]9Qxu@qndz,&6!Xvf=Z7NIJSH2|$)fk=C1hruC۲RH: $)FJKAMw֒6 (޶y0DE?25f' _IT]dw@.6R [Ejv$uyS,8Vx)*6ٿ٠jƟeMgEwF#k w5t)\/jH.h{iAkñ fYmj}#|{٧?KQ٩ɪmEʎr~sgl_e0 \yJFS.k}oaq{\vEH+B I;}O3Z`$>ԻͲ$Wzxrˬ{ۺ ;%𠄖T(}aW dw}x#RK:uLGVMJLur4Txuq^^C:b&Z:Xݚ+ӲzCHOc]n ɀk_8n?p\qV0"d |ZoȫFߍyB;ɂwr*ʠti_ By(VqzhՠK/7HLFDGD 4߰A~(x'Z7p9`E4|.sW FfW8K +AK5 !<)aY>dR$H2Tto!õ8ƣSKyS_4u0 ,/ ]4}_VpTT7u] `|G5鐤1󍁮2c^MfXXWi8 IÉ;^}$SCMv7ȑl>{a05'8~dZv>OsAil,NkF Pw fIlTlxgUu:l(/Dm@*O9ʑۨ E\J6E[2!x64IQ0)u2$-ٓe0R':: xٮڗ`{g[!ߤǨLe5c>yLƹ6NHv ]5vYЋ%eV$Q-ڧH]*hM(hm]rC"!\ ʞ /6C%;QXC/">C-=W7ӽ}?tQ1݊A@{plkIQrX\}|~%:oFZ'Ox>Xֆ, ߀.L-TUPʃxx0K0lh'ms[nǸ<&ќ b=P̹*meb\I_^??z|X? ?\?D"V?\(;S?V܄^?j®`?$Po?}g?bk͆f?i\nn?I f?@Ha?Q&K6a?9g?i.zk? Tes?1.: t? ˹Wp?cp?[}? 2b{?dCpz?h~?y$|}?R6x?ni?#??=T? $?(7?6<()֏?-}ނ?3o؊?|ʈ܆?\ʓ?(0? ?ōa{?b1?e9In?4p?CS[?{3? P?%?@n ?+?}!?|>)? ? ?pH?.ka`?v&6? cѷ8?߹G?95?BpH?IRF&?,?׆ ?oY?G8ҷ?NgE?skSW?^6Y?Hj ?bט8R?Fȩ}@㩅k@K @y @Z@/:a7@:8@{ W@B@ԧh@82r&@6zp@,ga@0@Fv׃ @bv )@N0n!@u`,@si$@&(&et|#@*|)@#-@\,@z7$@I Ct(@X^Z?@*~2@rѐ0@tFkK5@P:@b?@S6@q "5@.B<@؎<@6YY:hJ@a mN@L@$5TK@LLn#3F@5I@ۦϨA@T-AF@i%E@PI@=h^@kW@fh0Y@gH&R@z3vV@)YθS@q`}X@`!`fT@N[ZS@q_@<ZDm@,`@Irb@-1l,k@M둡a@Y=%k@:Ei@z`@0[@n@x&Ro|@L|@7/iw@ p@&@t@e`'9~@C8|~@hXw@-Cw@(b@ӵp@@;?*@Y݂@^Q$@z_K@*@6B@RBw@>:@GB.v@y4r@.NqxӘ@fG@BA@!U۱@_@i@rv|@S@ @Z=4@@͋(@Эi@@Iz1@+@:>ƭ@ܵ؏$@ 4w@T6@ bҪ@c*‘Z@bW@Na@jo@ҵ@-=Ia@l@U@2M@L@*AZ @.r@At@wz49u@v"@앸5@S@- sH@[G*@Zd_@P@z@Z@`YRl@'D~ @s@$@$>&@}|x@ǹ@bbP@\v^@nIB @iTc@\@fqS@0@|#@4Tʺ@Rv$b@2Ȧ@:@;C@:H˸@<@\@)j@rD.@/P{@@<ѱO" Az8̅A0JAi AJoUAQ^]BA29)3A'A%tA AiPB;Am|A\* ADBA6UjA™sEAAA.7T|AC uÑA,hB^#AOIB"AGr%AJ^$&AN]-Az`܇n-Ay*:r#A6 A|yA$ACS'P'A?JV;2A,-MA&DAtR.fDARVLMA 'HA]*+YeLA9XEATr~JA+IA;r^A{.ǡzXA'+PA~aISAO8"/PAe5$ZA(eԶXA]"5TA ;nQAԕRAܟ&tfAa̠:dAcA?TbAj6$RIaAFFchA}%`A"hAa S=iAcAċnc~A,s$tA;)lwAWz!gsA^ci}A2gY}A+0wAQM@pAD|<| sAEe,+xqA送ֿASẢJ[̋A؁A{HSA*'ARKU؍A"ˍAJ/uAYtAxßAFE-MAħ6A8NbCA=A 1A} A8\AAAu)An\gv(A]g,QA[AOa0KAx/g\An5LnAN{hARH/AU"% AE\KA<~XAPAgCFAeOѵAA<>A RAUAQAOA蓷JrA4{eA t~MAĩC+Ab:dKA#+Ahl.AUQAqѲjAjDAf As~AxAALWAW A>nAr(AQɑAQlCAR@%A #7AQ%A_&}:A|lAG}BJAJ=ėyA|6AXԕAA|A\Air AcA{ްTArgA); Amש{Aj/A㴪;AY A(eApuBROlzBL/ B)BdVEBBs{8B~5ƚ! B фBxMBx{B)C BBYPB cBxfB%WB.B\hmB`giB%t4#B\qd%B规3 B*Oq@&B{ͰqW -Bӈ,B,_'BÊ,BƜ(BcE(!BDI(9BqNb:B>P)Є=B9w n1BuB _k3BU'\<8BQ16B>9/=B9+9B&Y9;D>B ;GB'WDBf) wLB WNB+WČBRB3 B">rBkMB9 cyBVEm BjBtsBlB.gB&ָٜBa]BsBf< B3]BZ0.BʢQSB+B> Bh%B;dzBf;=BKJF¼BSB`G.B@&4WBk"5BۋB$eBtB GBFĄBnYs B,a~B;EiBbBب?tUB B)6MB_BL(SB,v!B#YBX BUQP:Bq27QBYBC^!Bc[H(m8B|9B\~(BEB(Ǎ+RB 2[JB sjBSB[B'aD7B$rdBn_ݨBqB B8B#p B1RBϜ BjL/oB0BoB) XB3C̚>[kCvC{gd C l' C3 %[ CUI Cy7=;Cp|} C\`XwCpRjCÐbCi3ƈC<#QC?!CRvCﺪCw"TCFC-}mCާ>#C̤+C (W,C<0!C@E|$C<+C{|*/CJyn&Ce?+}/CZC.CCM9Cq/9C=/&:0C-q:CbEA3Ct5J3Cܼ3CM4Y>CIo6Cp@Cɠ:CRle@CKCasvXGCqrEC,np5DCx.LCĀӣ)CC:^(ICd4CC>wAC>3QC$*^CH-bPC;^CfrB_CpWC%f+SCsc_C.}GTC Vܽ]CnNS5-gC6mC(E鄶iC?)?TiC[DlC6kC 4GEulC@玃jC, aC: dC +wC}orCДҼ}Cy;Q}{C"CvCfyCz zCwhNkvCV"/F|C\2dpvCՙ-C@4U%CXhC12hC}C"C+Q;r?vC!j7C6C.QjC| ؓCC "ZCfCsC(2C!qbC½ZpC*"CWjUFCs'CDsYhC KkխC)k6C*CC,w6jDC[߰C0V(C<Cf8xCΚ&Cq|C?C`JC.OCE/C8ӥ C\Cj?G0CeC] CER%C6b7Cc_TCJэCkU:C:[CJfCz; ~C]y1CխCQ;ChC;b4ZCmS?Cb{ʔCNC#TC xDODKNDC玌y DD$mwRqD5hLDYeDjD+ DiD:=XD[_DI1 DϰqDCND5sDDdtD -AdDSD`@6,D|cd*D^+Dҟ/D! &D6(V&D4/Djx49$D}p~%D3 ؁#Dһc;D0990Dڌ)"6Dm0D N'5D?D f:DC0ݕB9DIؾ(=DwT9Dc4&DD}ؙMD%\FD׷BDmKDBrq@DEx@DlhpLD KDMKDil^DXDIOvUD-g [D%().QDFUDxRDŠ;o[D1oUDfuYDͳٙoD͑}7ص`DAdDb[рeD)`hDR XmDr)a `D:9>SaDNZQgDZ[5lDĴ+yDb~DӡEfsD#~-xD>Q+cyD ]sD!ݚ&qD'sDDY 3DQ2d@9D2^DD$WyD8C D Ja.D5^_D@3Dz̢Dz<"'DfLDJ D\DED!_D0DDñDSUDWI}D;YY@oDe~QI D'DCDu|KD<nDJO:DoU6{+DB·EDbfDLDޫP'UkD.gDsKD$`DTɃbDK}0DFS"[D,mDnlDygނD!ßoD͆%E I$E"|^EV EbsuEz_ ECaEc.EK:Ed|/9EzٻED%LBEkȲE8O[ EпaE<+PbEe$E_iEl3:sEs{E/n*EJ7 -E܈-E΢D"E%0,E xU$E`|T"Ev9@)Eiȥ~+E5>'EI~:EP r|< tEΌRvEl EoE#ȏEWݵ9 Eͦ_E@S'E6˻E.M&EAZDk1E>aʀEtEfN*ElEu>Ei^E^?ȗE][l"EmE)=dE'.Ec> E" EblEhE8]{Eg&xEJ;z)E/REf@IvOEcHMEEU#KWE<VE):E pEXU$EaELyh.E:F<)EFE/RE&0~E(+E ZEbESEbEvI$3E~};E"E[ eEJȶYEmWEښ)EbES-EXR\ElYEF@8" EAE"T FHFiF)BFF@CTF92FF_YW~F|W FFFd> FNF?F6F OFOFX{F~hߕFBMVF< F5%FNg.F#Ae$FؼqF);F-Pb5F"V7F_s3a5F\i>S:FRU/?FHF`6F CT4n1Ft2w>F/"%s@F%X GF&|7NF*%SFF~zCOFBo,]oMFY^;1AFЖ aJFf5FF  S\FF$!YF ,`F YYz``F|IaŶoFEfF2VwFFI#qF3?wFU}F eNrFh#P{F~HzFCtFF<řЎF5lʋFݰFDc/$FteFkŔfFǍFS&#\FfF_3F(cF 0 FBFp[hF"RVF>Z2_FG{YS(FdV2F`Q"iFF˄ FJsFSFdMCFgśFd^[r2Fx,jhFkP$ F/d{FٹtT(F!F,Fw> F3Fzl?z!F&FjEF**d6F_hF!h&xF;/6FBXQFX<&F}ӭPFLF pv{}FJF?\FGOC_F%F7vI.GT-.G@a\*GK-GLTl#Gbʣ-Gio-GoNH/G[7G}q:GSB6G1I=G櫛b4G6GNh7GL/;p{G,BqyGYp-qG~VQvGGC~zGDvGvՐ>rG%NzGUv&G<3.ۉGȫۣwG=ܟ`G8࿇GH ӍG+mGyE]lrƅG,T$GN. G QA\Gw]MGJJGLiޚGBiɚGK~9GG>徵GVn_G$֤9GL4gGB53GZ}-qGt=G樧ȍ٢G(bǥ GHG?KGVRG1vzGؽG r[G-hcGelGJ6G޼GawGѭOGMaRϵG/dzGhͫssG*H Gh8QGt<~GIG+CoGG֙OG/U|UG^m]+GMtG, 6GlGɝGqmA@GG#IΊGbQ!IG/6 f=GpR ,GƠKGWhG̫2Gn3>GԔ.oG6QXvGOGoUjGs%EGƗ G/؆WGjlc(Gd!G ?GRHG)fG(=G$HP6H0-H~J *SHmHv.H[O`H{4+HXw)HX)HE=R'H)/Hu 1.H6v`.Hȿ>N(Hrݮ(H$s7/HR%V1HR7 H2H}g,&=H9,,2HW5H z7HAԈ7Hk;HNyoB>H52#4Ha$BH>0 FHG@ FH FAHpBBH!j7DH7CoNH WLH^~|AFHpʘEHEdXIRH‘A]HУ%.RH@܀ TH_Hݔ[Hlm^sYQH1#Ӈ[H6;kSH1V^SH8dH蚿jH!`HO+ ]nHVa}iH¿-iHp>`aH%yWp[oHNxlH$,gbH.Hڌ+9xH B}H :(#{H+i}H>6]pH^IRYZsH9ӏxH.,{Hw˷zHVjނHHλHn7HGH}huH~y HIemH_%oV ijH73 [H+֍H1H12:H6HM5H RH X H,H B+]H9HHnHy}LZHܤЖH6>zHf/HthHMH2aFHfaH7cs&Ho HKgSH3aץHx]H2v%5Hx;Hz.H<[H\w/H,_'KHiikHZKAJHcCqHʂϷ5%HZjH{ Hb&8H3oFHs&nH`H(+H 3HvHY gHED~H&دH:QIъI0<IS?IlI I4?N IcqIg7 IDOҖ,Ij}%gIq @ItK IVAjXI I"G I2\^ͳI!CICWI[2IIXC4/IPBoP,IE(Ik"I IDv?,I"f-I?}5/Ig5"IGR@'I&I BIAno=hMI`fOCIUTOHEIrf ȕMIx;KI(lDIWGDI 49{@I-.$nKI1 ]I8XIȋZI.+XIE!RI2QIBxYIZU_I,6^̨_I j;oRI6akITR_mIсn@FaIsoWhaI`I[0qkIH]/nI&$QhIۼfI8LZlI8\{IZzIȗpINF>[wICqI|"qIlȓxIBSuIXgIzI~}IdxUI>R"pI+t#II|#I7⑸I=9I.I¡IbfIt# I vI{,WI~ I uGXLI? }I(TA8|IY2)I,Ig IUL=$Iu[IDNPI{ܥ}I qIKI듇l.Ib?gI1I8AhgI|$ IB2Iz _IҘI3D@I>yQIä&JJwP9*J"2JK[pJs~@JK,Ju07)JJdN$H J&wJ2^8YJ9|JG1JoܞJ%U>J6xJ.NsJvbJOx݈J5S'J-Jt.J7|b)JUeD(J+韱-JN"(/JX:&J, Jt%+J7J49J8lK4J~= 5JP'ME0J*jF6J63K68J+OdGcJ0}(>wmJ_ZfJ:kiJd.LܕnJ+IxJ-Η;xJP{M!xJF yJmlfqJ$YzpJ2'WwJh U㢾{Jb}rJN`ZpJbXJJ1KćJTl,խJ:Ӆ̀JhxiJ}JmeJ$݂|J~J. J LJEOÔJ!zfFJ+\*X;J ncJ"ΟJr}JoRNJFp6&PJd%5JAoJf|'GJj"eJl(J:A]mJ|JH0Jȝp)JDxJsX\sJ6$lJ( նJР^Jw J6PžJ{N%XꟶJ'J9J7JN#;aJv:UJJ?Þ~Jwa6J J޷LJBBJ|J4߆J>SJ>2@JiJ\1J}vJ^JZVGJ5-Jft-JsNJ-J\Jog-Jl5HMJ )oJuJ4yOsJ)XkJ$4\Jj( J28JJtJ㾌4J-JJ -|JFJ>ŅJp5J:8J+eJo K xamrKǎ KTKY9K dEK\⊴ Kk_8Kl K3m0K#;5KHyK KZMz:KׅGKh/@]KT S HKc߿K*v{K|9KE9:#K?T~=/K{Ql*Kx _!K/K!X.T/Kѷu"K#KV#U_&K\N(/KLj;K(ԋʟ:K2~C?Kȅ6_D#4KuH3K3߶.8KV,x:K=L5K* mL5Kq2K9MCKkыGKSLKJIUMKFK HK:#7{EKF:Fmp%LKG_@K`,K^SKHkHKQnK8Kl'K]תKiO0KsD)DKh=K#VKK]_ɮKn5AK%BK#KVmAKZKAL4K w K`FYKOKeKOvKKr|}K=(K!cKeG^BK~JuAKwKƶKq|K`KVSK4K Kt`ZTKE `KZ[K= K@HKkhKx#tK":KaKRtKs3 MK>K% ?K\Z7K KXvKC;K廹7K\|brK@v*Klp#KKAؤKYZKcBKpUMKWt LI&LOL s0 L:j L*ש#c L.} 3Lc>LL`L;2L7EL=ioQLLڊ)L'LK6l*#L@ oKL/V|L5hLͪML;XX,LM%Lz5 .Lf^o-Lp L/y"L>#L\*L}q8#LDm'LLOť=L8*#Y5Lxˉ?LD|}ݪKLUM`@L>{CLD՛HL4@Lةڊx@JLpvX0\L#o]L`-SXLb]L (VL; TLHAP*VLʠ \L;UL6{YRLNiL^WgL?6dLARkLؙ<`L[9dtcLemLiECiLg^mLi"iiL8PuL~L wxxLdzOyLtLUƉlpLntL^?yL{|Ln &yLCvL>s6o[L10 L:&|bLULfL/L{cL\~m\%LhT@LDJElLO'ŠОLV-ЕLTLKV6'tLs(+^6L 8L R@L.?Lp9ϞL2E7OLҜ ͫLJ%ϤLb ^LdL㰮LOP bL*#C[LS9|hLRwL;<ML[cLS/HкL^y4WLA:"L@ L?|L;ClL.+LrGxLqw\ҷQLN2LyL}yL$u3L3tL)yLōЅ9L"niL 2(L,Ldt$LMW /LdYNXL< L`#L搴LRL=;,l#LU3a>L~?Ll%&L0sVL,g$Ls̞Ln8LL W(kL2OL(.*L͘MfLs:L(wzLF"~sLR}L1 MY}j M -aTM_yz M^lgEM$ 6HM|P:MQNMԏBIM9 MW֢MLuqM7z:M}0M8b;dhM[ EG=Mk:\<MCML5_Mnk.M~/M=Ζa(M#!M B(Mz% MZ>)+ip#M 0"Mr8t/M*+MZop)M&M-1MY!d:M} X7M Q8MPWP8Mdeh:ML1M?VF;Mݒw;M\nq9M9rCM$CMƻkzMMj-^޶JM`谜JMpʺCMd.5FM&FMh$LM&+KMSMр\VMOMZWMa\Mf C]^[MדRM0x[M"F_MQXM'OM$ӿnMm}M4"<߽Mc^бMM zMSF*Mջ GM1`.M#VMDPmMrxM{MJM 4HMn/ի[Mk\Mod!iM:bMZ8M1RMuB7MMm͚YM4gM ^ZM\t`M%\Mu>ZMzTHMFNDMa R]-Mɯ*MJ dMD;SM=]M+MYZMBHeM{Y]gMP&M'MsDhM:1O6M-MOSMP"LM,;MKN+) N{i/mN{e N6GuPN)^*48 N6Y- NOp!΂NZNJ_J NL6wNJ*N(N?NHN[UqNAENlp.ZNΒNaoNiN6H"N͝/N?g5+NGS/,NW9qM!Nd#N͌y,Nrű.N- *Np*Nk`2N 1N3No98Nx7Nl6:Nt]8Nך5N,8N#8:NT:4E4NV$o3кLN3dAN.'GN+lON4.ZONU@NP4ENBWOHNHNYD@NxVN=TNZO%XNn(B-YN471XN+1^N TOTN>PN?OtȉYN PGPNd jNg8deN>#u/jN4R,)!oN.SeN"r0oN*w6^nNd uפmN.@hNkDjNeXjqN.x䅈{N@_L~NY~Nģ2rNc9xNDyN9=ʴuN\HzNlT)}NXb b N=휐NWaNķ~:NrkN8ANhCpN%EقN)N8KNkzN&Y,Nmm Nl)J>NMAIeNNQg*ҁNLNʅtFN*ۙN-ΥNdf[fN",+N Nr]hKNRFyNB˶N4quN--N¦2FNddN߆.N$m)i N#d]N` Sh0N8%ZȦN|IwNfJNT A5Np%'_NuPN:"NӱkNicm{)NMN2NqN`յNhN,O|Ui0 Of9FbC O  OnzO =mFOV OX''%j Oee O~׉>DO`ZOL<OzOAIROn|x[O7z8Ogր0O>ZLOv{7O6)#O\:(zOڸU!OvkYX'Ok0+OB&O31)+O=ǎ!*O W+On/c<&O`_(O~+O.p?77O]v2On0O4BfL.>ORFq:OjC0ODj4Ozi4O տ=6O[h5O[=?@O~a]LO:UJO9:BO?CO䝆DOնJOi$IO^d]IOodjoMOl}UO:rSUO8QOZfIl[OXxe-SOZROsN\O*ѱ-RO w&UbVO[KdYOFըbO~bOZEgOliOOjOsRtdOO wnO||aO|`VZnOy'JfOF"xJtOU{OvҽsOW&~OAgXk|OurZO8zqOL1)tO/\pOGPqO .\O$x݅OwpۏO~zOmO,T}(O%eoO.6O*O O:I O>i,|;8O9-OXO-8җO3 >ҝO,܃sO}簾[O9{_şO {ROYK~OuYIOo* cO+:O"pi˯O.Oȑ OǦOɿtAOխ'CORF2pO @O=hO9³OcYOW[O`OnshkO6ڰOq;kOqYxO_LkO馎SOgvOp O3 bO.6POZt(# OU߱O Z>OhXj P`K*Pv P.oPe PijI P!R Pha|Pr] P-PGŒPEqǟPN}P.eP_뙱 PmHP?P4~9Ps{P|"PhyſD,P6gJg(Pu@n#Pp"/PLК^|"PM{pO*PG0m#P'{OR-Pwڒt^-PVnI4*P"uaC2Pi7PhdA=P`J*4P2a5P2P1P76Ph4v;P'NP.|DP| APZ"NMPB*X4#DP&:+OP=BPINBPNP&IP\P1͚[+\PVUPI`*jPX^aPpLdP\~LlP_ePQRcP ziPm(yP qyxPk5NxP@EyqPE2?tP쇒wPGvPM uPKb/zP~~4k]}PSPdɯ-PꠂpQεz{>Qҝ1k6QԮX=:Q7M1v:QNn3QnDM`fJIQ:ۿHNQaaJQ2KQ P"YMNQ1ZNQci3PFQkrMQ|$$IQL6HQFulXQiB\QЪMDN[Q1)PQ2+WQt-\QƭRQ{uRQ8GYQ<?PQfghQ-3q7nQ'6%bQ9qiQaaQHuhQnkXEdQaNFwlQ5,2nQ:CmQxQhh0}xQN:;JyQcR#==zQ^T {Q* wQluvzQf?E~Qӣ)֑pQ9B'xQqW`ӆQ6XQSdo Q~jQjGDQcjQ7 EQɀ#:QX0Q|MPQqQYZxQ6jQ.QyQ პQtB2Qkq?Q\QO4RR0R`ʧq8Rؼv0Rb`-}n{=Rd>g9R` b4R834R# |^R7j]R\=[R^)QVYR \9]R^`QR쭕cRӽ`Rl`R){mR$7[gRwPAܢ`R+KdRnbRέkkR 'EekRժvRΈ qR(sRs8¾uR~OLRr}uwRswR-+wpR#dzR~JtR=.R?(vRRq?WPR9TcRRᤥ8R ܤRfiX։RQxRɩB>RD-)1R\R; ԥR3t)RnP4RpڻR@@RtORQ7RaR8LɦR?RS/TդR |RB/fR cËRųϦeRϓ١RbaRJR> R R|'R$R5OR b9ҲR2ԿRPewSiRH8R^"]RscR}[6R# mR RJA*(ҪR~ăR؞"RRYeGRrfR4N[TzRDpeR"YnRauRS<R``.R̷osRPRHaJ3R܌(~RnRB1>$Ri&JpR};RoRXKqRP&jR KR%mlgRg 8,hR[ck R)R ڈR/n9RU >WR+(xR4R$Q ?R:R.@xRȳ)R 7f Sb5L3 S9S&pySutC S-S\7S(^w SgCS ||iStX>ZS_o^ESFib<^Sg^S{Sx侑)S :S%)S JlSkC]3)SSb*1SmSR0SߦRl=3S_'O:Sjt;SuUwsBSp}GSMɞDSOASh+a7MS*K`ISnpZ/kIS6UGStlHSb 2-PISnq=4ZS 4YSAx}KWS(s^S]'}_S#jVS#c&%5QS7[SvvVSo\SXliQaSSSkS6zaoSЊeSARCoSX| cS,a-jSDrl aSY)KoSNqWfcSyS&5pzSZ_bxS$p)4zSVs-{S vSy"$rS}rtS4d~S }qS"S):U S WQSPC/SkSQ,lS'U^S1פqS!XYSSuS~STڞS{vS{[WS$@qSx{' ՘SV|T̑S$<AS?ቒSNOSh7EP[S|9GS(}lS/NScS\Hpc&S(Sn^qSL,aSB bЎS=XĻS:@SnגSBqҶSD!8_S_ݾSH'?SѬ5Sk]HSjoDS !Sv`SԏyS|}b` ,S|) Sđ\S(ZS#PS7r-T*A$TTAWT ۺT^dZTinT&@ Tr5YTfXT .[+T[y0T!T%G#Tx;T5\T ΁T~Ta:mTNw{TQh.Tƅ6Tǖ}T)/GT TuT@G=pTĈ/mTҔ ToXTi;JZT ÔgT T;(hTs3T#T! T\l=hTB{*Tk*TC[ȓST0nT/Ӥ%T@:Tl|T;NkTvwpT 8G[T5UK Ut[U .ѵ Uo1zF U$X.yUL [W U8UcqURa: UeiU^U0>U@kdU;q'Uy[ZIU=PU󘚊U*U/'U8Mu>&Um-U'Uv1U+UN$UY,U ;3K%Uv4B<)UMu Uq .'U4 :Uڞz`2;UU&8=3U8כ1Uj?U#M:8U;+UwYJUNcUkBHUȟ1E^HU?/#eYMU qNUIUڇOUwVDUW|1LUd^NU4OPUYOU 3Ue%WUKBU?JU sUx$^Uꖆ U/- sUJ7Uv3Uy=NU EUKc1xUpa*ՓU$lU"$Ut>UTgU^;Ug| U/lU/`UU[0*U+2I9U|U-N/IU<+BtUSKUԥU k";V#1 VzkVMB V=%VVDdV20OT VF$ V3ƍVpSVivxV~O·V忕V V41y.VGqVNf"V7): V^&V$p~Vr,~)V@\%V3</( VDVډ."V,Vt,m)V&#VO =+V%V+$V5Vb)1Vn:1O7Vc-65V/q6VG;?V#7V:D2V"@>Vջ80VD ۏ<5V=_JV>%wIVb|EHVnHJV =MV̜3FVɓ@r IV'/`EVS}8sbMVXNAVF;b)YV9>LWVt0}^Vu̮8[V-=ŪVV|l ӮXVWVVXj:~XVR_V]VbV=6iV\`jV S+yaVQw#gVB;gfVƹ0mV>IcVGm\noV$<"d<8bVڇnipVbOd{VDG~V|ߦ&qVXF zVJXyVSMtVXsVҌ5{VgG!fuV[8ޅV*CVL($VSՌVe |,VkDQV6aHV"(TVra5=V_VVʟV*V/8}VMJV֗ %VȈk(V4^VCC>Vۯ V>IV VTa3kVGo\V8LV)5[Vӟ1V(VLR7VIV"L%V;z>øVp IwVLqN#]VrU切VI۸V=V$V#LF+V96VY_VRVJv VVSV>Z:gV NVV | V)OVXVe~ؽVJskV@z;VbŨV%V:KVy rVܣ9ԌyVnVEZV(ZPzxVNy)Vu^2VUB?ݻVV5/7Vڇ4VOg~XW4kQWۏł\W6̮!QWdjWQjc6jWl$gW«7fWu.CbWTvdWɄpHfWaaW֥L´oWnUO$3lWXv7|Wp "xuWPrpuWOC qW0}WcrWzjzsWsL!sWMqW7~qWew0 WְW(DWAjK6Wwj`}W'q]WPW$hn2W RW8HWcGZW]W@TqW4.93vWS@|>Wz5W7 TW ;W7bWm[ڋW /ǞWW2QW4(WKR1W^[BWvWdOAW/;WWܕWDW SW&n @Wh@g#W&@,hsWYiWOBwW­Q /W&W_>W)=軸W|LW2),ZCWAl‚EWKbWz&7yWPW@dWJ4XYgHX̻ X\)P5fXr]ĽX1Xsh1X$&@Xwb]XݯZXpXk$LXpߤP^Xs).Xs61XH҅NXqXF3TXfu̞!XTF%X%Ǭ$Xո%(X+lE8)X:2Ul)X\+X- ^yw'X v B*X?{(S#Xj): .X(]XvVCXt{ RX(cXؠX:XiX{WœX.x勜XޫXnoX7XC45XKX9$ ^XnX=ϤX$l"%XTp\XX86թXbXɻbX炙pXrLB Xt* hX1XgXZޡ XIQ͸XMK $;XCrfXV@XySXCXWܰXŶX Xi:aX!XM+XJkX )9__Xx Xp3OwXSd{sXGHMX{UoX3IڤXKX_(K|Xz[%X\dX TKaX9aHX;UvzXFt"XlUX5Y"XL X2XK;X XBXYՕ41YIҍ2Y,C4Yp]#2Y40Yµ^LY~6eLY4[idFOYIBYtnGY(~=MY 6_FY?^^gGYЭtHYDOY*PQY νŊ[Y/JTY&_NZY&vRYOQYZ*TY34gR]Y,jVYYsXRYd[gY7MhYzmY1/nY\DhYKLD+lYڽfoYd/TbLgYDlY)]yRYݣrY;mYsoYQb5&YB)YlXYZSYsYVY(C@YάrYli=Y=n9mZ%Z{oPq Z,4Z,OZι[yZdŤ Z OZZhhCZZ3ZAkV;Z_7Z.nxL. 4ZGUvEZA4)tBZ{EZ>sMZ0"PMZXvnCNZ*tGZN,9JZ8}IZP@Z7PZoy:HtTZJ|[ZcATZ6;g…XZM)^Z$NRZT9^ZoJ4VZ`hOSZX4IUkZogZ \˧eZY bZfZ);ZxZMmعyZ?ROIZ~fZa5ZUZ#fZDaZ! iNZ]{ZaJcRrZdZb #Z@%giBZ;]4Z'u>Z|ZamZVSZmPZo?_Z5dZ HHZrgZi.\D*ZBlšigZ՘ZGWHp\[̤i[' 4[3f̣[v3c[Njt[g[*q>[Q-00q [@[HH[[a ss [F [7 v[r;?[tݦ[>*[8uDW[x70[a3Z['{ψ'[$^,[g![.![N7L""[t&v#[ @˓y ![)\+[P~ $[Կ!%[)9[7[D@9[NO/g>[(<[Bdf9[-8[1>[ AVC>[zL6[C[K^I[p]D[ڿqD[bI[htN[CDA[%I[9Z+neL[7MJ[hNY[^ý>}U[88tT[%/Q[ybfS[Z[jځ]^[WV[Z&fR[ jt mW[}Z; m[%bTi[\9Tb[ny) f[2Jn[Ϙe[R<"e[Ƴ%l[ R*g[8c[c>k~[(KSsT}[H8y[PZw[)?%L~[G:r[ri^r[@R >{[7{[TWp[} [ʊ[&C!2[d[̯pM[3LNׅ[ɇ[oq^Ћ[J̌[Etqfh[ [G6[[:V[[XD[G[AJ[Ö[[1Ȗ[,Uz[ fK[$*[a^A[pOk[}[FݏS[yA+[z&OI[Ϊ?![J[>45[6P'[ nXX[Ȭd|[%FU[6Ƴ[k{'ߺ[>dr2[DG[jeD[/>Ur[Y 0[F"[n[r5:[z].[I_[:`>#[m[.K["Xh[ <` [{Q[PX['sfV[ԡO[([.p![L$WW[ zߔ[D[B )[zvE[s|n;[YE^[O['/d7[aW[[!U[*hdd[Qy[{m[l17([ޤe[f27[@r[K5F[R[֢S[p4\1q:\8Fn\v8 \\`y\6s\\YPPb \\RW~\Z{I\rT\!f\am U[\(Sb \R*5\Ԏojg\wF\nY]Z\&ߝ4.\kgR)\TZ+\[`qm\)\ s .\fP#\A}9S:w&\Č5 \nF,\!-HC.\Em<\J~=\$:\Y?2\6,m4\]@:1\mry1\Tb4\x^9\6\uTOC\#3 K\FߚTH\I(O\NP8K\,zN\DK\K*>M\h @\H\à,DZ\ qk_\!iS\a 펥 Y\l8ֿT\`[^ Q\сjT\sP\NbZ\:I[\ f\]vwb\>|f\x,m\0k\%$B.a\[^g\הf\0h\ʼpFi\S$xr\teuu\ֵt\bpx\n-s\Z:Xv\Ye3p\WBXr\M{\S¤N2s\B\[\ڎ[E\]c\bN6$Ή\bl\xϘ\ \ZU}$X\m)ԓ\%!\uf-z\u:!˘\N3E\.[W \aꙕ\&\]H\|\N燐\EƘ+\:a{\7a\}X+/\ O\O\;/\-[˹沦\GrYL\ I\͕c]*G]*X]g ]dtE{] ]M՞]92 ] e%n]L(o]V.D] Z]AŽ܌]jqA]<<]STL]ä]Жm2f]Mm ]U,]ZI$]]ʋ$]d*P%]ٓ&]PG"*] nj*!]^*][(] ^,]Tr"5]j<]/e9]U5]DTck9] hX4]=Y4]_;4]8y&:]c=]&K]#AH]G_D]04G]mo1rJ]-C] ZtH] DOG]OGtJ]vH]0Q]=3cO\]O9_]-W]J.\][]1=\W]Rc&%Y]cwaP](*Z]Lmnn]KZ|l]DЦl]RP1h]Wlo] dg]_Gf]Zy3Ő^i]}dnj]iwrc]T&O}]/.wx]sAq]u]Y&:s]K3d}t]MQ+q] &s2v](&Us]02ly]ۅ]:d:\]NV ]2oj6] WĶ]8ރ]V]*f]ԇ]mӁ]3%]O]sV8]i;5]]]3(Ý]#] Q]`Ex»]IU"rm]g7܆]h2Ξ9] >y4d]bQ9u]ףJ]c^άR]<|' ]5$]gL"]!q]]j]Н] ]ľ]Z߽]]Ra]xEm] ]f7]6QFO]N;k]d]F3n]Q]]9#],]]0P ;]ݒ]`>]},Oq]m@]tpHG]ev]nl']6[WD]#Fb]LC]LmK]p&] X]\=]aQm]T{ z9]d]Z=]}]ʻ:,]G]&~:]E1Y]0,]ž],C,8]]cK]ð7]"9]]$o]L:]U^ Za$B^i%^ox^1^^aC^hX^U *9^`r^˜o0^pN^ ?1a|^(`^>ch^ o^݊qa(U^ZX^FUڌE_^ \^I;^u!^g=H-^'^K{_'^?Nd/^#-^Z'/^*^}u/^3Ƚ%^Z Sa+?^l4^:$5,=^}6GE7^q6:^ 52^:ZH7V5^/ݑ=^"O:^n& /?2^`1AA^"eBG^膙IH^ZH^UF^&N^̈́K^guM^"H^C^M$J^M P^~dR^}bam\^XHf\^T"R^ 8pkS^E״/Z^i_V^e["V^\C[[^_@\`^] 9i^֍o^:Xc^īVk^2ic^i^KB?h^'ͯh^* Ʊh^pKh^UT%tp^/z^6`u^qǕw^ Z}^E i{^f}0t^Uw^ .^M_I}^h^{W^O]2^S^[t6^mH^p]x^U7^Q#͹^O*l^WM=6֣^i^!lϩ^e^Եά^9^goO^x>!0^~*zs剽^u4^ª̾^鞿^މs^`5?̽^&* ^t-^<^S֓^G.^DZ4^3 ^( jY^{DL2^N^KPl_^T ^"Wa i^ҚO^JE^m^?^^13^t6@8^oXj&^!婉^{fI^΄u^.Z^6?'^f^^^o^M#A^n^sN^Cc8*^F5^i^Z^;H^pc^3)8^4^v糱^pFm^%В^]^1(^Ck:^ o(_H˙_x-R _`o}__F_ _ǵ2_(1< _"t _7pe_HaEA_g_\ _d~[_ #__\M*M_@E__КT-@r_Ժdh/_.}CZ'_b]1,_rN -_`xd|#_3G-_F&X,_(5&_|V%_iV'_?_Zϭʈ5_M 7__*~1_ADK13_=_]63_0_(2_3sdhj5_\I mL_`6(@_%9;bE_yl{C_%BݒLA_+(#H_,XC_O4J_=BZI_XTc'pO_J]__f__җB __] \_~\_0W_@.%Z_(D@\V_YwLX_'f}]_[`_1kn_(=}k_SŠhl_bnrd_qO㐛e_(56m_Ƙf_qe_f݃Jl_r_s_ R~_Qꌞ|_hH:_7GItiw_q_4v_}2/r_Wu_;_@Y!Y_ga@_5oGj*5_J%:_PQ*_pT$C_U^_R7ͣB_y~_&T4Pd_JM"_IF53_j _T0_B_HC*%_² _|TŘ__Ck_upz_oz5_1u_ ߦ_5"ה_^M_`@1u_E pV_^&_@%婏_[:_Nf姷_x.Qҵ_1<_UR')_Ei˷_|_ _i?Ӧ_M^B$_@j_0Z(_Qs;_R9_y걌_ym_/C_͝}_1_vgB_1֍u_\Srh_=AD_ ωp=_΢_;_PRB_dy_jϢHli_D_U`_tSҨr_lq~_s_ߗ_Bz.k_(z_w](4_Q0͞_0j_{__ѓ}l_n_[_q;Y_?_̂?%_V_RZ `p= `8WϞ`&5`iÎ> `\u` ڌ.`pJ`J `bYL `H{$`M [`䲝Γ`tS)c/`A2.`X< `x `>*\[`Ӆ7j``+o*`M*` `܇^F,``;f;%` A%`_o$`+`6}%(`BY'`??`Ŷ63`A6`?`a8`;;<`g:`i f9`ȅi5`QU=`_6`R4y@K`Rl@A`B F`6H`PgQO`2JL`}һB`WBD`E`UagK` 2X`JןT`~п[`Z,Q`)JW`jה.D[`c֬Y`v}'Y`Byg]`̱Y`; n`ط~j`,{j`s4c`-{ d`dvb`dh`{Ch`) mdo`Wcn`Cѭyu`0ĠiGw`4^sp^v`ot`#Ӓy`8Fr`N+2t`Ӹu`Mp]y`}rOX)q`o"ل`l_ӫ`K`X`jd6`Zf`go`dgrN` C`˔C`EpW6`$O`ҍkUR`xa3`i`;ʘ`sծ`ɥ/`[`rh&`$ө`'_`qB`tiHj`ٷ8ͨ`!*dS`|`UΥ`#p`F/``CP``odb `Hhu`6\e`.=`' ?`EC`*bƲ` `&`9`!˴`^"\`$`(S{` lX`"u[`xxQ/`a`2k`p#`X,`+IĘ8 `2 D$`Z6;`4)|c`iuE/]`j*F`wnI`5ӖA`# #`|r׋q`e%`Ii+`Uf<`O^;`]`[@`uO`5`V+`#T%`Q` `E`sY+`W`#>.`\`j5 aM!Y a> a>-:) aN auqN a)83aSwfa(w'zaDYtuaJtha\<-aSm"a qKD}aA$ma tBaŽ9 a -'a ŝka -a+#,<+a컮$+a b8!ale:(%aƒ0[#a".<*--a$cH)a%*+aKf%av!aNX2aSd6uG3ay/1ah>aˊpB?a(f$;8a(T9af=L?a]_n=aX`24aMa?300MaxLaJafkBat1Ma|VzEahf4Oaq.Oab$0YHaw̕Ua@g3UasPa(SVaJLXa(uUa~@Tap(V;]aK9Ra_(PaCBcaٕQlaba@ha4la| !caz,ma$da> `ga .8˼%aaqoga6d(}afUE3ta/qaS-]sayatCcrad-ܘabX&-#|ava|H푆aZixuaz؟aܥp3aS[󢂔axjjbaf aʂaRVU&a棟Mƛa|?>a_aNatelpAaa3)aF<ۡa9awpa֜Za>'\aSYR3aZ+TaI'a~Saf."a`mila\;MaaXQa]aO-maa45ua.HSaӡ)_a}ia7 #aL&0a{KӟaIYacI0aB5aط9ɫa+֔a\q0aѼaںIa oOaOau \ba|ׂNva $a̓K9aFkKa $"a=aRa&Ohaa a;5a]}~aŐraEl^a/kdaUǹaҔwa-#a6"aF|=a3ӛa5#b1Z|! bH7b]bvem:bWb7-Cb%" b~a bJĄ b]|h}|b7*zb}{xbh+buBhxb b޽+ԩbVټ~b: Sbf'b$mbbR,bЫg'$bI!b? b-{%bB*b.4'b@#%bd=j"bwޏ#b8T58bRd9b'f8bzb,Sb7TbQmb#Xbbf_2LbZybh+~ƒb({'yb-$̙b\ bGbb4חbƴ`hb4Ћ*9Ѥbߡbq[8^b!B|݆b9fb`9b򹈪bA] 侤bbE9gbQjb@ɺbE#ћbvkTtbbnbZb"]9bMb\a^b{(#b{^I+b74өb)ȂbΏGbtxbhBb<4ab zbH ٽb8ibB.-Rbʭ\byk_ob*+b%lHNbBvbbp*b "bj bd$vbҔ>]bc2bk(mbi[%b  b,=#db  2b 3<b/;b SbZk5bWpRb|ο\b{ybАb<ݮub {b beb@~bL į cWYcl)cQxEcJ\v c@w`Bc.cx}c<lc-k\ )chf]c6B>WcR7v*c:}^^cLCcaMcHcic`4cLEtc{{;z c6*cx.cK#.cOvk͵&cv% R-c &cG,cXY,c*#{@$c->c;6cSMNH9caq̢J4c-lޤ=c=xAR:ce@lyxWcc'Bc3+zpc"{uc הcMEcVcc24Zcd'V͜c_xyc8c=cc<cZ|Qc6ဲwc9m)&cnO ФcO5cX]'c f{+c͠c¥?cYVciitcFcoRc#cZc[cBcf9cGh`cqCʛcyc>ch5ΔmcW,c&hcFRc`yctRrcV"x cH8(>cQcӋcXccZКcG|nc ܼc[+6Kc2/H%c|:bcr^zddFdjJ d4 dv_dxd~k d|dudTXO@/dorJ/d{Xe$d"%.d=5-d*{*-dW*d+Њg+d~N$dښϙ.d"+q2>dߌ>G?d._1dLS4dXT5dxE0=d:ă:;dƈvf]1dQhK;d<.?dAGdKqdNdOMMId*Adp(ǏIdi̐cYBd3VB[Ad#NDdAfLd!Id GoZdy_d|`yVd2#R]dK_QdtЄCRdKjXd&'QdlϺWd`+_d:idɨMxd QsdRd`Tdf70ds-dnm0d Pd4tӆd:|dw1ldBd}q/jdN#Pd:iKdb_RdEg]dOdidZd SSud3gUd!\d9d:RmdXu,davDd7̧WBdpw 줯d,*fˡd1KD1d3Z͠d q#dT:dy 6dF. d_cӶdgedޙdd`6dJ&d,ɩld,|f+d]T5gd<΋'dRdށr!d3U|dcex*e+ eg eKpAejTefe,ed8re ?ef6<emea#eKeՑe)-eMʓS+e*^P,ep;nP-eh! ,e&<$e~k* efR!eBe},eq,'e@U5enGk$q5e 5O:96e,eַje;eϳ@hSe20^e_eweˈ^eYSPe\"Ve-?Xe$4[^eUVe:Mele4h#leսke_tڀ`eileѬ\&kep$ge.f Rnene-ee\wqGfeBD~ez @}e;yQreA6Dte{we`sehseLV{e1[+ebE|eVwdm"Dдe@5qheMYle0.Eeye/K]e6sje^˫&ePGeg47eMAekeUeZeRe|e >e3 ^GeiLepxKLeB1e6 \eL3ve%e^͞MeCt7eg%eqQ%eibe efnl8eBݕeoeJ2Ke6e7Oe>fWs>fti1fobA5f"+~9fOMH5fŪ֘f:fўذ3fJ:f|x?fXxBf:LiZLfKGfYΟ%Gf0ZkLfڟ_NfUĨ]Af$cEGfV1 fwf7jxfiZͣfBkf}(fĺr}9fA8fa.nzfȚfffY)kfN1߻f%t~f0ffbfՍf&,1f #fI?Tf"fr#fX!f(7U+f/1WZRfXRCfКfLtBfȵ?YDfNxf+رfy䵽!fP&f~4f.YfJHNfm+5=fn!faf Z]f70ّ f@ >f3f@ff@fWCfy|Pf]8f)*fFL5fff!]Df\[Z\f{E!fB6.ft-jf`#fPkg27M'g}؟g7Lg9 gn[gWٙgVѓ%mgУ? gnT g! ge#8"gURs[gi[gp)g; hgzFg hDg"J<gS@gɢ$>,PD'gS5*gO)giOQ&gM/g-Zk)g# co3"g~0oc,%gB&j$g0ɾ=g09g5Vt(G6g3&W;gHy':gj敲7g3[Һ3gW09gK\0uo?g7:g.V Hg tMg*aFgA $EgST$BgvsEgr{pQNg4@gD`+Fgd)FIg$ycXg+4XgyZg3t?LYgKWgl1gTgc_gǫ tWgiϾmWgo2eTgVGjguigbhmg7.kg]7dg8Lmgsjg}ogV:og:%jgXl5j{g~rh%vgej,Ȅ}g`g#M+lglZ'tg2~YgvpS{g }göXRrgg,)g40goWg&f=g ևp/gXigGwykgEbҮgwJNg%gSu¹gXxHg.AFgKx3Ogz}}zgKBo:gNz'gxX˟`ga  gJD-glkN+agg>~G^g܃gvSrg4 hg:pg'cUgKgV3g֠jgPւag W gh]ggJS{g Rgu+4g,८g#`gb~ngT$.gx)bg˷:g'<&KgCtg% ׀g:SiY1g<*pNgtW^g9g[agJ[g.NgTg gt`g8|c3g2hlA]nph4hn:0uh.x h֩R h&#UbhMD ? hkHh hVTh|Ah@dhhi8hT\2h},+hVh+h$) hhHP.zRheDL)'h$h 5L7-h(=|/hՠc"h9ŵ!ht)hs!hz{^( hپ*hLG!A6h. U۲2hiP#4ho~6hv[6?h @?h̕U*9h&U>h35hl3s1h.S!.-AhH7-QGh?t\AGh~cLhD?JhNhJhx[Ihrg?JhLhLGZhA嫤Uh^{ThMKXh@_h0,YPhz_+^hqU3]hP=, Xh &Ph@0%ehfhO7;#khpN.Cjh5Ԙ mhihOlBhhi}sgmh |8.mh~~Ijhlrʙ|hד`_vh]n$rh/1YtwhpoY8}hĘth9lzh:qzhuGsh16uhoqh@bh(khHԍhcJጄhkb5h_Bg-oh>hbhhZ_h hBhI[)hP~a&hfo}Meh,Z,>hLh[Y{ hLPhY`.HhaĈh.E(iCɿ1( iNxOi + iy iGSix循i5 inf| i # iT(;Nigi,/oi)LWi\@iiIwFi,i@QiI Bi'$i,:}/i>cf#i!`ۡ`D$iR= Tn!it&i.4D$i6#i>Z ,iÑm(iP|Gf9i̍~5iM =iʞk:i&W0in|W7iAL38iXׅo0i2ȘU[?i`0iRUpJi$%g1Mi;!Ci2Ci4%Gi{w9pMiBf"IiQwAid@i2Ho KiXjyn^iRsXi;Ti0(=QiyYib0Qi Hb_iZiZxRi1CGK]i(H-}oi$toi˃? cij?!lic&c8 `iќbJjei2;di^ 4di+&~`i^lfki9КsibWBDriuiTCvi6 ^vi9G{xiϨ5ri43^tiGSr{ia1btiDbDiD#i+i ޝ&i`zNiܚPȇiE3#iL 1@ٝi]Iiy9YJib~1iсRnBirE{riw[^Ti0^%i#ؔih~izb0i~,_`iN"i8ii7x٪iâĕinWA`/iHQi7XQliT88icSѮi4fioki=GiOYii+ ei{ָid,ri8FsiXkiKWiӼpai5i>xiJ|i}i Ơi#iGiZbCiaibi8aiXܩi{%i]pi[+,i^Ai0̆iق!ti4#ibnioąܕidoiZiu*i@Bi.cܑi%zPiD\~i,vi;֡i iGH]ih_Oi~(5=iiyiz ߏpMi@1i-Ӊ`i~7[zii#li{Oj9njнjDdj\Aj@VЌ jD3j5XjT)ਫ਼ j]Xޞ j>jjВo(je0޳jf ,jέ=7j~j<ڞjI Trj^\$jt68 vn'j/-=t*jM,9#jeEv jgqFVq&jҚ#jOa@A#jfm2/j ]!jj7B ,jK`9jSTC?jfxzj`Lj6SLjm^8Jjm[?@j+lA@jH=ՎĥMj~:YEjc6ziFj@J_Bj @Cj vSj X]j}]jB\oZj/Uj SjhVZjїsQjyIiUj1WjְCdkjMɩugj|CRojcyGcj* 7bj-p)2mj)?nj:i'?njLmw\mjbt$54hj8-sj+b`ZjÍrj j uj,M[ xj p{jȆ@xyj6twj귩dxj*/ jQ1ejWjed jAj\JhjA[]jq[ujM3jFj\M?H*jbj" Еj'ĝj$mh졕jEKjԣLIjFMTj(N\jڻlj ~ykj(Xjefkj2j^jG>9]j>Yj"I)jx]$juj{{j!3ڰj !jsjv;yYjx0j|'¤zj.@c`j jP*jUij9țj_j<.Xj.)Vj.x'j+ vjqDLjΉ[jn\&]jW\jԤTjqjHj8'}jB=j~j e4Wj!j !j* hjP Hjbjr]2 lj(qpjzg9jy`!jNj?T jzj]VŤjH->,jPaNj0UhjCqjԬÂ*j5&^j\)j[|djXj 3j&˘ krfk8f? k-t" kkhA/ k3k k k8ъk3}N*k8;Fk^bhTkGS k11g7k˜k6k$)k0{B4kP^K0kvM,k6-m#kV|p;.kIG%kbZ"` H%k}+kVKu+%kiArU*k\S0u-kf*,k&^30k*TRkBC4EV:0kf<6kK&`6k_L IkAkSeMkLk+'DkTdEkQ\`POk.(Kkv*Iv@kigGkk3>_k?9e=XkҠ8L^kPkqWk؇|Uk7Rk12/J_k^_R[kTy ^k}lkF^lk"kk kk#jbjkCEfakjղbkXd.nk?iZokZmnk\nK%zkF?skX-Luk{|kdĵKwkЍpk}_Ipk>{pk@59vvk&h;uk* rZHk_k(BkDkHu ~kck kqukl98k,3ߝk "@,k&șkO_kǡܑk_$kMkA-k$hqkgu kHrkܼɯk&ްk_IBk,#$LkT@MkBSkpUkhohkk :Kk еkTk,jkjek`,Hkh]tkk\#kB?v@kGM7k8AkS7/kn(Dk0k؎`Dk=IkkNzRkqOkBh.kcᐕ/kbllA S!=bl!nxxal!HgliXy~lPȚul yl,ۯ${l q}l~xl;/v@rlX%crl3qlR zldQtl#䫪lPklZLK߀lv\KlP>Ώl`ebwblk2Ulj"҉lH2lXlFkrl.K`>Pl1;l쥨lw[lb0l)<;ԫlvwl֣l-ulkUlP#l+DHlh7lDY>l#lϥlIqlTѐ኷l!|aQewlBylx_5l?P-lek÷l^P=]l2f/flǽHlhtl6q>JlSrql ѹlMCp-lv]l ЍlB l%l.o l „w:%lI6qQYl(ZMlT3 l2lUn6lll&lp(l2 lYU_hli`rl6 lSr(ly$.=l'<lCulolXֈl GlҦl6{7IlF|l.{ɿHl`].lL+llTh^m6 6mD 6mϼmb)m'+mutm7,;wm=mA,mҿ- m*W]m\-m|nPmڻZQm7jm!lfm=m~FGmV?]m*"7m#B1>#m\ mݒ$mϞ/m7b(mV^S#m$*%mlv˶'mw<_>(mZQ.m7-p5mRcq8m"Ka|V8ml+!>mz+3m1W6mGUt6m5ݗ;6m-1mA;m< 9Im&pOImnO`FEmpNmȫJKm[KmBC~CLmUuHAm MCmYNm噡^m7;Um/,]mWiRmfpWm Ym[w]m̢l\mQ[aoVmahVmgmma`Ϙjme[lhm{cmFCfmޑ;emɳblmbӯ8`m0]AsRhm:ZemKL`]xmAܘSntm@o?Asmums4ޓsm.P#{mAICx{mRH! |m`(m{!PT_tmz5{mKPmrm6 pmGmULrm~AmxEm YrmF m<&m.;“mjml5S"m;4mnʳmpZAmTmJMm`ۖ^Sm9Fm6hHZm4Y<m -EmnxmaĩmsT[*%߫mE#1m.kqcm8Msm r ;m χxm>m͐mUSsDmP)m|Tm뷺ѵmYmg̙ԵmMˇmzfm2iFmflm1mHR3mxGm#m\m%Wl4maǸJvmM wm}ٕmJKRgmo#@'mm.S(ma>Dm?P!|mzm*omB}m.Qm+mPI0m1?m6| Sm0 qfumBXN2mb^mmhb$mbmVmJmX9mT {nf:G nr-3|Cn~'; n4˺a$nt npOY nOUYR nlT* nX[ā nb.nRn.{ln~ә{n0nn#~n%pn<0nin؋nͤ -n/}n-n.nbh)nf[&ni*n9vx0m/n7+a%n}V%n nJuK#nZ;nzTZ>n~{x1n><2n Ē5n %n2dyO|n ;0nLn>K^>nn#jn0En%{n >n2>n8bnĈbL2n|nD>nI#gn]`Ƈn9nju vn`pynE9neYJnv ɦ*n@P#-FnLYn<źgPnp%"nG5fpn bn`P?;nLu:g^n_ncnN}yn7An/SˈfnnwNuotc o oԩRo/M o*oF?Poؙ*odM8oqCP!oožo(*OosJX8ppFg5(pV|MO)pJ0BQX; p(pp'pH*p\ݫI$p@a"p_$p6 +pt *8pJ78f5pmL4pa*S1pd@>pLF02pO5p1M3pz&3p5v!9pFp :-Hp %.MpdpW8KpwQcE@pBBLpHp@poY bOpOJpD.Zp<Up_p| RpZӒ d[pX%#}Zp:0[!ZYpVG^pJqr]pv!ɽ]p^\Yjp߆jpj-fpopvѻlnp_( ]aph{2Jfpj<#thp,!fpf٬mpeatp"V\Lgkqygq1rq8)qeq9"q)B[%q?0%| )qV]+qh()q}+qbir&q !3.q V"q?>'qJ7S9q 'Wd;qҲ<9q',>q,*jP0q8KI 7qRl@=qIIIu2q賣29q@8J;3q;zBq@|9]HqKgHq/&!Wt AqRvNJ[Hq޻2fLq9R,L(BqCj0IIq:Ork^Aq6 A]N"GqFQqT1^qLUZq8ec[quPq神Yq(ީZqĒEXq(WnPqINePqP-p.nqD[ӷcqXdqkrm@gq[kqFd3dqLeqR\@Yeq-;YcqFE_4`q%ӽsq99.~qguqCtq/;rq¯rq gxqH].uqA H3xqn\vq{S'jq'*q q?pXaWqwxCqeLuqqImG BqQ3CǏqv_~q)-R񡟙qr-q*n1jq+Vȧq痺;q} q*8q [qRHZUq2ݷӖq^ʶ>qulimqO 'q~eqxK q!oYy9qFѧdԧqE?qȃ qrz~q)]kq{޴qm* qGGqR^q_6qF$/~qBhq#S9lq-?_qrh2qOsq,q"%ybqPw\vqP q~bĸq$rq՞3 q?KqqP\q8qtGsEqfqdEqƐwAq:,kqjrx}1qN\q+PzjqЁZqsgqJq(oqyq$qq׶Nxq6qqqnFxq xdqPqa{&qS<qhK,$q-q6bq%sq% rILcZrb0r؊+y%rl , r r# r500{r @1ErJ+r:[r)M3r frIrtr trOrU mrHNt1rSbrżdI-rr)#rB/+r]7y+r8[n/rIpf/,rm]c.rlq: rDf:#rx$r|6rCSGܞ;rؚurvnr'RrJ69@ r.r9p7rwryr(Nr2a'r}jlsJr:&rB?"Ir&FNrXޚrr85]Ցrը-rP3@*r Xݽr&CJ-rCOiriW-r:K#ir﹜;r^rBr;loƲr\q纹rJrrurgXzrQr1תN0r˥;rީ<rE}r,SPRrsgur[!ܮr&J.Mzr5Sr`ur\r+X@r+r@*|rH#rqJCrکO^@r"=^r0xM r&r.irrr>^\r$lrIrdrl=rЖbr#l?r8\Gr Frr<Mr¨_.r㇭rJقyr朵,]rd׋rqExr0 rqMjre5r$nrΟrjs\k=sysF~hs*LsojsbO+WsJUAs6si sF sTjޫ&s2kBsNj˘sO{s+Tcs+LV8si](7sZ}Rsd sDuC)s+3!sL^w?@'s`I).sOAWv#s_y'R(s2\'s(P`E&s `"sT.!pI#sݢm7s2s49s@?s T 6saFC3seZt 56sZ ?sЅ )2s_o_*2s_9=3BsӋhvHsTb8Ks(+@s6}xAsCNsoN>,@s/r*mCs6Ms@LsL8Wsd,@Qs5P uRs/aWs3^Ss?[sWnRsfXs#WNQsD0ܷ]sho8estis*o}g@fs]"gs"B `fs 4pbnsa"jsJ>Nbs'Qes5uv`sܵپps>+_.}sb~`usN ~ٚ}sokxsPJO@vs\UT1~sIdqs,Wss&-/utsSsK쇭s];sA6s5#1s|frs\:_vsҟ^susNnGsr̫Y-s rRskЌ@s*H"s.af sN" s,3asEz]s"ߐsUלsBsx Hsv;s\=s&sypsirYisspfdsLye]s=s/zslSscnﳣs̩ŷs.s]yEs/esĐs걡s&YfsE_ Ls$r͋sZ_Qs|ݱs :^sOlJsH,A(xsˁyssn3sw[sJ4s ZFS;sOos3H#ss4u@Ts*s֫_s(ƍsrSsOqsPQTfsߠBbshsBbcs*(uKsjas/lpsE\@s6c.(sK.tLs49t^dmP=t MXW6t V >tF#4tDžF5 =t52;t+6t>0G:t'=\3tpiPMtz8jL@t0HIt Jt-KtDlJHt*MEtˊy/Ity]Ht(ޕ@t&~^@Qtg@Tt~5VtVMWXṯTtb,lVtHXsUTt4Ut3 R*_t"Z_Pt jet\eatSultL#gthjBhtS'`t(?ft8ht'Lftv;bt_S/~txpt8xtSosyt|ttJ]zty+utg|X.vt,stQE|tp8s[tKjo$tÃt%h tH;ыtzt7\}tAt6N=rtܕt AM t3nt6ջMtҔqt;i t-CtÞ t^I=yyt"7@t(݄t Jt)aWt$1Rt.qb̫tWӮQ6tt߀Jt/I|t"Տty˸tȠpɶtvd%ĺt@tt#̺t6d9tMpVtn2W't_*tt)^/ t sUtأ,t Odt9tGnNtbS,tf]򛼐t|t:7t`-t>CqtTtkD]tחt <&t.}tkD t_|P6Icty/ytqΡt# t,3TFt~Zht_.n$ta`jtCtīotY2t([ tEft9tpWtV%kt˽tFtsdtiϐ[t%']tntgBu zuL65u $/ uuVu}aH^uف: u[cbuCbTuK u kCu6aau1eubs AuF[uE!uFE$?uرtuJpuln5u&c2uR'0uyo4ux"5d;u00ubZ"-(9uvSYJu L8K@u9;Fuy<ɍ'EurFu+Cuվ$CEu ALu*JjGuq>jiCu_%Ru Yuj-!XuqˁQuW¸TTu46Wu34gPuJXu<:JQuڼSu_S`ugiJ`u -4lumkhu:cizkhuq`uY `ueu̶mu"[guëaZ4ru|s>\quGrumG|u@A"!+}uw=puC4Fyud"0pu|u6E9susڈub uxut5i&usueu7uuY7Åu'uuJ'iuTBmDuF JuquuP͜uAw Đu}BHLu~Zƞu?xuu*euuqʤubnu%u1sƣu66u^(+u(u  un…u!یMu ~yu#)uËDEsuƷu&l"u2*{lFu)@u iu uniAuF5u\u`$bujqu5~tEuu(cxkuT=u`ru{/_W\u^9Sju [6u(.uFkuC,usL1u֖u&u˪uckVMKuYXԆu$)__u[g5ʻuQ4uƟ1ug_Lu|u!u/)FuG88ujuٶo^u3suR`uRitu,u@uWU6=vb7tvS\Ev0ܪ@vYFvEኁv%CT(vcʔ vAECv,0v# v m.vJvR>vVϣBv[nvzvp{v(<v4Av2[$v_*.&v"v5L )v#?-vh,vN/.vMs/v2ەTa(vM_&v f!3vm'?vWQQ3vr7vO: 6v,*57vDHV8v&R?v| t>vrIbSvB+v5$ v~pqv&҇vQv{vv`̎#vZ;}ޟvBѕvw*_23wk:9wY4wv /q9wMS;:wD6wL7wGLd+2w\DLwPUIw<֖Mwl6Aw4fIwR6^bFwCFwyg2GwtNJwKHyFwߕEWw;c^wx{^P\wXz_wboWwRyRw!Uwg- UPwWwmQw  aw;4`wEew&>hww cw/`wKNow8nwxdj1hwRfmgw~zdzxwxtnuwPGvwOΑ{wl-rw.wwetxwH 1 zwJhtwt9fWzw۽ wB~www2Iww~jwvwoͭ_w[gPwпRw_ѡwӸwn`iw+a!wNyw췚wrg!wvЇi$דwU͐w4*sjws&\7w;DKwoOk٤wbI wU}w<^w(>wǁCwvz|w~h60tw8?1wmw \w@0m%w.臯wYw_7w wƯwZsDw?m)wc܅w&8ewww "fwlwXnwVD(wPXM+Aw1\w2 U wp"w1pwKwNBwI>uw}Ew$g]w&bhw 0mw)6weiw9qBw2cHyw~WA:vwNXwC۸ws+x.x%x ;x?.x$4x\Z:xhx_z x&v)x Xpxnojxaơݴx+2o%mx6D"xx& x[O_x!NoB#x1}xn(,)x@%[P,x}Ӽ)xb(xr*x :> xlB/xʣe!x)xp+xM30xGNj=x¼4x*5Z9xM\azxEь—pxq%~qx}uxR3$jsx'Cwx{kx x+0~xBjdd tx:7x?,/x|Hi7xRxCQM x nWxGx.)]x8Wrxļ@axtzc֙x7 3Wrxerk1xwDx#9xPGxT͕êx;bɧxvF/ƃx KcFͫx ܯxߙtx3 {>xέPx9$x`.xslxOxWnƗxޙM8"x*:™x.Dx=x˲ xw'_xQ1Ŀx/CxW2xF x+x=敕|xҭΨix%ixb$9PkxD7x+#^Ȩxܡ!3xBh!xe<Οxx8?|nxxd_xLGx_dx94 x7Tjxh)kxPxE(H%2xQ^x.:xؽxy8`x/xeb#xiבxxY0|?x:WxOxPxܙbx*Mx>a]xBhKx1oj#ykxyWGy2ڕ@ySC mynTUA y-lO y[6y>yG-T y4sy,yܠ^Ty&ʈy Vry/aHyӘƴ9y ޝyY+"RyV 6y}SN'y?w/yz /yX)y'&yՑ*ydxr+yFA y;().y'.y@%n>y8?yDE[16ygؾ?y-A7y=y_U;yEXfr9yo1ɑ`(by2dy8|RyyCazyi,Ouy;qqyS8=wy뢎vyy`H~yyBSyՇky ay]lWy?ifyHayy$ y̗ypTz#JezP{@zn z.6ezd铛z SC+zg" z6;V"z˝mC&zby@/z׏a-z_coA*z}wB+zbxU$zUBF#zO"2z57z Gm:z'|9z^m7s2zA?zRN,>z"p;zvS?zAvW4zMFzER$5pMzx)eHzޠn Az15@zUqDz۟lS@z]y>LzNLzڽ$MzRzA5GzZz}uPzMhXz!JYz\@>yXz\@YzW@nZz&xG9yUzPcYzb%nz+Zozv_kzħ`lzdzwǔdz|]5bSbzmWhz8A3z5haz|ǘz AI$z7z}.0z-|0DzM\3zB5zbdzzfǢz5dzZVzMzVk`Nz!0\zE A弿zb'·z֊(z> `zWJ'bzGzT.0PzHxlzc z)E4Uzj|z}qz2_zVކozXz+IGzT,ez^=n-z3~Pz~I>z~ $9zy XEz Vy#d {6s{#n {p(c{Sb{~@f{az{t {׺0;{(> {{w{ so{( d"{=&e{GiO9{P N_{Xy{w5R{ 1,{' ='o.{g(f.{#x){F~\g-{ʈ;P-{@%){Ea9f({lq'{*~2*{l]+ٙW&{ry3{<0{$4a)r5{P9{&՛ۡ0{U *4{vAu3{p5 w9{E(#2{ ->{6)lG{knC{?=B{eNI{B{%3N{ xCoJ{9K{%:YNG{h-#AI{)~^AY{UO*]{P{4S%'W{\"3a3\{Vܧ.7N^{iJ=-V{x={pK C{߇{[lY{^|{yX{0G=߈{tO{O{S+{a+g{&{&{βfPB{>o{qT{ҍh{#_{v~{ ,{r{>5fd{*{>,{}Ao{?a{Rc{L4M=X{>`sp{nbY{l~{s:5}l{ U {Xf{!m)J{drt{VG.6{Elv{ӷz{x,|O;4v |Rn3&R|*;&|d6>|q |(9S=|[^Cܸ|>L|ʡ.^|J k|3>-|s"|B?(|w1$|&r*|Xah(|y1/|_G%/|~+ܗ"|$f&|: 5|(8|¸j;|ܔ$e$2|F*T;|N ,43|fa9|<֚4|wT>|t+ 2|R;ZL|8sv.L|pmxA|N9yM|yn~%CA| E(B|v-GE|wMvQE|F|;WI|"s-LR|9q_|=1^|ҹŖ_|'%!o˅P|7pQ|t̉3uR|\SQ|\F_yU|xRS|f7Fe|WuW? d|>"b|D3`|9r fj|h'\b|rGo|:BQ|{|߾s|Z|GE1|iP3'|r?f3|TS|@1|hE|m|Pp|,)r|i|a|m d8|C=4 }p]1 }LCp} (4S}@-0H }^#ɒ}P; }xϩ}42!}f}S}Sw}`}Tp }("}_!R}Gam:}) }-}v-}0 }ex#}t8!}ׯ́'}N> }l\C)}!e/}6z "}PûP&}FKu)}oOZH:}Ծ1}Z"Ӆ<}Km!:}4V 2}j{J2}!W-;}aH9}.J^3}?0}̓y}jet}.6iUfq}=ds}iO|}fm}v)}V(΀}(} |W }\}3e:}l+}QO}Х-p})bc}~}~2}&<}զ,!}$U#9m}LS}E73+}z=}#HE|}n;}R֮,}]Pͩ}3\a}SX1}ſ`})}ƽ8$S} 7}k}KyQ}Zrퟺ}K7};FB䇲}@j }b8:}(%q}X%}m};J}K[}ك}N }"}n8}b}4E}|R^}tYC}R$N}Yώ~}He0}zݘA}fhwV}@'8}K}<5A}'I}8-8}m-:Y}!}H_Jb}*)Sc}XϿ}}\}ܟvΫ}L_J}#'O}v-|M}(p} 6}V}m}Ӕ2}8^X}lY}B+,zR}p"}L~z~$L VL~5Vk_~b+u~~G),~A~V~ q ~>(~毾:~PV{I~5~;~΄~'$}B~is)~I=F~!k~m l~| $)~E$~y'~Fy.~0L,%~ dCY,~ _#~z(Qz(~Jj.~hF2J/~INt8~VE4~2~#|_4~Bd5>~Ba8F83~<]Y<~u9~R5$p3~J%@1~[UM~EpYC~{N~p5evA~4߼@~+=D~[M~PQM~OsBG~/_%D~pDY~i⫒)hV~<3"8R~|мY~d|8&'W~hW_~NnqT~`JP~sY~ܺS~'Uk~`~NB#!zl~26j~ewb~Pb~\k~Ӻ(s h~* Mn~$:;Sb~,r~fJ 9s~ Or~搃"~z~[2 Lq~y'|~lu~ Uy~P;As~. %~A9~݄O~Jdi~!r܌~l1 ~Z??~ ˫Վ~qC~5͊b1~ F ~_\d~Hu~jK]~Q/Ey~dh ~b?~+)K ~ט~~ [F~y~E%'~;G~w4~TOB~@쌣~X$~-s6R~%IJ~6`~8aG~$Tpg~G4A~,+~B>{~tTÀ@~Ƕ~~ÇXK5~盢A~DA>p\~гHH~?(c~w _~Fǜ~%n~5{~(G~~y~J͢1~r ,o~NV5bw+~JP[~篕5~rZb>~b"8~Rbg~.ʩ~ѕ*M.~nT~+w~b~4=~Z? ~ WW~M_D~tU$~&Lߦ~ҢByZ~ f;~/p~~}6 @~@r~f~Th~ 3~ۡT~nn=~k~Cb?vs vb kwD#]] ˠ<ΐwHݒ MR4,UٓY@!:ҫeT}JxʩmL^`ImMQ[s)ίQ\3MEedҙ/^ɥIX)T+`Gտ/&~ .(z/&*}d# ֟qT-RHk"h|6Kzh("k;hz );ֶ C=;dƱ2.=#ʥ3KXg_04&6 ]H<Z56,HxSGtG3NQ-\O7+gAͫ:P@^()0H_w/sI׸hDʍI~I߫Pk]3S7N]]W]UVa(+VStO=W$ve_m;yb7lAYQk(gc &dig  m! hOpcaw`~hNRPrK{j.c z.!t4p`otNHE_|RvJ8hy0Q:mYJ|G}MM"}+48 ^yܝzr{AԫLf.mZ٤J K"q;? v85 ͽ_ܣp./MxrS ;#B*olq=P7%WU$YPRWbY8R|^#'B0h[ڹOdk?^?N? RV]?Q?XN>r/҃>t[>o/A>5$~>4% &>秷>YO>ZPȼ>ψ&<>䤑__> L#[>/1Rj>[Ԯ?HSr?Du?"i D?W/J?C?Swшz?Vac?eģ?PR:p?+{?¨G{?nRr}?mҤFl?$Eil?wnXe?-i/˱(?un  &@?(i?;l ֿuʿ9l%2^ ;3߿?d]?G]s?䩻`? p?-ሽ?mￒZ" ?=߰N5qdӿݿa)Sl)?4|.￤Է?ku ҿfe?cR?$F?^?_B-=Q [?x?kx3?~ Cm˰?xB? ?jEؿ!c0?_3Ë9D0?JG*Qx*$鿮f:?N7??n?)HlN 5r,uG^?3eￛ  & :?\޿oƿ(sTx?wk?TO ~LM?w6}ſáy;?D Mۿ*/*s G?ߠ?9.'俦"!]쿟 K;?߼ֿ^e ?4^yHZ??y.?z ؿ ܌&I̷ƿ (?cs?иC Ҽ%;vs5$?xݿ!"G֥? 5տ: Bv?U)?ȏ7?MyK?I%uL߿ K7wͿ?AD7-,`K?4?a p?~śת7?ߩ5DF$*_ ?VNQ0ho￢Æd?tcD׿ӔK۬Rf̙MG[8ۻ?@ho?#I?>?W?󛌝?p*3 K3}ܿ9q{?mAț?C @t?). F(}qٿ,B!د)J\/~'ܿd H%4/R Q}S ￥f?-{Gѿ?hv?ѠuP|P*? F h?y`+?3juEݿx?2^bXEȿLݷ?IO Xҿѣ;ut?= -?Д?'D?9K?b? D?$? ~?ԯ??J[?ZӜ?Qf? U? Li?K?}?.?>N?/?%7?X#+?b ?\?e? l??,K?+?y2G?{?/?Ҧ`?A6?5e?}?JT?^?S?3?-"?:o&?ެN?U6?ʣ?`$?Z8P?;85? F?gKZ?/Q?j^?y_?D?'?K%G?idS}?Ď. ^}_nN@@fZBڱ%޿Z޿,m QEvqՑ?Pf+|?@?.? Z9[?qs?i ^?*0?PT7?v {^sɿz2kO\W?Cm뿜Ð7WV=:(dY϶W?5ڿ<Կ"X=?t?̸?vo6#az(ƹ.?e˕濭^#PҚW߈bhߠM꿃Al¿G>߂D?șU?濑?9X ?ٿ;/ۿe ;߿tT?Vi>>1ۃU`Fh}LaLԿ ՛ʊJF.l l= ?)οy8&?䵣׿B,v,?WA?ՠ A%-%?p;7f?p]p;4q-Ǡ?`[|?[E0}kNk?}-?rS^?'}$.?4?fl?gx? psdy?\{?ѪV?*w(⿎l@#=N?K.ޠ8Z;6w?ֺ?1ۭG?bdY#?G\k*9?܃UN7H?i.f￯?Dވ?r԰?h.70ſ=?pZ52?7 ?$N?^D^2п']h?nhH?g(?lD?o?˨TA?Gqҿr}ῼ.Oi߮?TTƿ*?|K 0~Lt-0?5ο_@?6u5ֱ?aO$?M;?.[?c+.Ax? b;"N?Ȩ^ܧ?!Uc?S'?2?%}o, ?u˕Ǘ h%[?yٟ:F?ymr?"'D?رD_?EM~�՝]z޿ͨIbX?? |k;?miE?g}6(KQL ?EPV7)?Բ%~&\￈rF? [;? ??nfￊЩM?/Jn3?|Դ?(?(l?~ٖ?b?-;&g?<(?[.Txￃzau?[ؠc5+0 $?_o#J˿h@b*&iVy?Q-ip?})ծZb쿸(Ng B俫` DWpTſB¯|?$Q?8#Gc?[?UdK˿1ȓd ͸ gkݔ?(UOg: \ãŞj~ӿkI?￸?f+?ZKٿDbv? AϿQ HyauɆ?H͊忏\濚 peFP>Ź?QF ؿ;ܿӥΥ?qβ? W?^C?OѿZ俓"h"?k؉?kӹ b*v?DWbؿn6y^?P0m?Hc/V?-od>c#"z?,)+hw@K?r7?b]0ZǪF˿EVX?cK ?g`?j$Yȿ#Q?zLG?LM?$J?=?; bN75?yUMfx|G^z?x zh?!?VCu ?,*?)4)?0!⿢i>??QmC?8 sԿ]D#'ɺ?U~]ˤ>hwrп9UQxi`8E?TVor? /k?]SP^T?ʔ:m?cf?btVZN?tZ׿[ёG8ſ㿎5xZ?U[g/?@+{?6EN?5K??&X?+9Uҽ-c?t|b#пNj???ǞS+S PeK?}:  M'[-X迵qZiѿҵo?[v.$?J@KՂ?eP+迅xW?J[?_?>1{deґE<'z=6W?lRr?J 2L?M="? LJ?_7pKЅTC?DjE1 ?5s࿼sVr .nF{ݿ-Ayȍc;$?%㿒O ?7?Ѷ/?Ou?*?Kp?u-w?c P2㿸q{`?M? {AG>??$xT?*嫖-tbD?m_\-71*?@H?Ń.?B2u +5E?;G?V|?WS͈cjyV?]?-"l7?FX:q?ZЮQD)O?g`?"W:C?"}ؿ`9?U|w[?Բ?c~?UD3࿌j_?LX? ?J#[??K3öɿsN/?;X o?JCl'}?SF?1&?C?fpCxVĿ.h˽?J?J?`EpF1@_?{ ,Ͽ-r9?ILJ/?:+"l%ɿŻ?.Zi4'C z?ɿl?|?3="p@ѿC??IQ?|.]~?o ^ #b?־$^3H࿞f?^?*,?鏯7P,–pGy6N|?_EGle?lz?aIS9K?#~;mX8? 2I?:?y~ѿ 뿊U*?zl֤?sO`d?dk%A?50˹7D9?l? Cu:+ϫrrKfi?{8&aӿع￿i{ 0pj?'/C?EUF?v1A?ƪ?,6Βmѯ?t\aR/?Yu"?K"#Y0"?(N>T?G?M-/JݿCԩz}?\&{G /÷0)?-: !ԑ:/?D.? 2e{b࿐as?8ڿeؿ=vp;@X8y?cؼLNHu4xYwY俘epe6MPvyQt["U u? ?j'0ݏB?ۂO?})￧I?8a J俈+X? *<'?$BٿXѥ? QO뿞-@ ?MZ7?xAe$w?eP}?^&]?]$?|E?pd˿p)ݿh,ҿ ? BG0?^￡) "oʂ?zˢ%?@!濑>?T׿~+Rz?HF+p-;NyHXrwU>?xɦ޿2}Q?8kP? ri?"qԿ)w?)T?t^$(n$?:?"?(%?Kk5"翅ٿjϏ4?nAf?GK?adǿ ,$޿á*hr\`?Vm\?j?kgͿF?rc?މ…ʡA?ר3iϿD[?HEY0?~]Cpanɬs>\?ſjRn? Л"?zLGؿ&$пŀ,?j?ܿ)hO?׋菏?^{??#Xr$??jǏ?s'Q?y\h#_?nC 迳VL?~_NiRe=?=ߴ?6?Mz㿥C3vH?忳{E?l]? A|j?ŹcsӐOǿ?ڞ?[S:3a?.f) '$g$?H)H˿lv? LXq?[PvFrI?/'Ʋ1?{Ԥ$?:LkZOyX# 2᧥ $?꟞7ۿ 鿆ӻ俸s8?ʂTɾ?u='?0Šg?W%#?!'PS?^?bv1迊;?4.￵\ҿ?M?ٙ+?d῿ T?vlTMj=@UI? 7 ؿq|I? tǥ?*nXӿS0?׌I%?{?E+ֿHcju5?-Nv? ‹ ?6 ?пߊ?p{IOݿ=\$C??%+ ҿ=?c?H:,?zRӄ?"2!?fPDÿ3hR2?h ռ4?v ?i?lP?SbC?HYKU࿏m>Y?$´'[޿az⿠+\?7uO?eCc?ѿ4Zq?E;.?`?;gqLk?0G?HⰣ?fyt࿖sYZ@uIj?r翁}덓?*D ?.lW?ݮϰп!aSF?v&6^?z?|~;$8ֿ%jqc4>@,ￋ~>?5f=俉cMsl?S׊?0 ?NS`q\?dI}r&?%UW?r&zgX?SڷLJ6֗f ʿ#^T3?H2z6#R`"?km&?d?>Fy? -Bj_[?djeڿj*? 6ݞM3?ɑM׿&[9/|^ٿ=y :^jlv?>q?r3ԙq? Kf(6?璑Hd~'v8տ\:ￒg?ntSBĿ+M0Щu?8s_ǿ@? E?wD㿀>>?+? K9Po֒￬VI?svHK㿁0y뿨 '? hub?5g?)3쿒FEfG@?T?`է1s ؿ‰9?!wtY?; m^ۿ0+}?FAbr?͝B9?f+`r?#hm?2 ?u*ydKKg?'nw뿟a6￑4ƿlE˿ɗq?@n9A?@G2?V Ǧm a?j鿏?qw?bS$翬X%ƿ*_? :Γ|D?_c|?2o8J`?Ӎؿ𱎱tؿkj1?mk٤!8?|U?٦[ 'd鿌Nz?/S5?,_ud￲t Wt˿F.iFlW? Cvw6Hʨ?b5?IJ?ypo?"CΙҢrH?>='?O!I?s QJͿln9w?0G!*4?UVKR]h?axtP3_?5?n%E鿱/Kh? $+AY?wDRz?!ٿip^?'f@?9ui?G7X?@ h?U??enpI?q.u j?3m&O?%J~ &p^?Q&k4ET3``j ?0#Y?A'?W0-@?zs=?oG?-P\9,ӿ m㿒ס ֿ //?|? ݬho?apf'翏Tv?"1?!i$c Q.f ؿw[[cٿ(?ϨXQ.X}&~|wg忆Ms"?6?&X.?fb뿔ŝm?JHJ/?4NCC[?;A?浵S? àk?U?fq)5LοFuS<ޔ 迥^YZ#ڗטٹ^?#jǚ¿} ;K?UL/Q&f5gS?Жq?K'?̏?Zο=?%Oз??}]8":ѡ?"K?i$Q~6?y/,Z!M?ݺ0@?>￨]+迆 ?gB?sV"=￘-E?;U!?j!ʒf?6?pZ޹f3?\,ޤm\?w51g+"ݿ_?Sh?5IqAL?AB?X2hL5?3ߵg i{$' 8f>~`?;)OI V dc?ezDOWſi1m?Wb?x@ȿIBٿk%?mpojۿ[o9f俲B7$hWJ?鰭i?^`c҆\`?#?{(?8IF+߷u~Ci׿GA?>Jm}?l*D^$N;=L? 07?KKtppR'?3A qK5Vn9?e`?س??"3fĿxk'd?Կ5fQ?0?/U dRF?0 ?wibǿ'J?`W?ڙe? n?[YSAS]? ]򮽖?N\>ɿBwƯ?k?|t;??%R?ZMp?Yj9?@n;V,?thP?0L?b7K?ۨȳ?2c?iع=d?\ӿL>K?b,*8޿8*?n kc?qLqM$?D"޿63v)=LZR:{ɿAʃ!=0Ͽo?z8?H!ￍyi?-R˿-fֿ.r? @pT?,uG[?V_JAa?sץ?H:jU\k`P`쒲"j'`;Lq?O?E݈ZUпv\t(?O$Ux+8!忊$)ῑ,۾?KÔ?+4,f"7۹d̮ ?+?R俟K s?hOŐ?4M?}K?a=?b'-ǀ?_i ?;i{8T*i￲)տX/<&drS?I*+ƿzc^?SD|M ZSɿn5&?Sa%.?BN( ݿ? ?9BP^;UM ~IdտXAh;DϿcL?jKk?35Ds|nQC<Ŏ;f _|CGAG!DL?炏s\?V!2?蹰?2o?˯?4 G?r>m;b?Ճ&[YC׿F[i?w?R??w{?WL?Y5?Qȟ/.}?ֲᩩ?c~}.0??H>dӵ@SￊB#?Ku4:?Q>G٢?]j̿[ҿILK?T?e?>>v?3G7`xe9?a)*ڿ=>&g}g1Ӫ?끻G?V ?L]fI?Tvq?ST%?قH ?|7r-}f?C̥g`HU?@୉￭rHb?BNA&x?ذ0ܿ0wNƩ?~v Ad-?*½֫bB ?u?]=?jo??`a?ډ'?."G?a >xP݅c/JD z?iQM1g[!ҿ40׿Y$4e?qV*t+T ?vck㶿htG|?4?#m?Fؿm)ο>\sܿI]??!-?5cʻXx?Dp ̢ ]?ҿg/?.=ǿ۴`I"?F}R>?n4rҿ?_tG#9UNs￈ֿ)xaA ߿!?{ ^߿p8(￐ ?8hs?F2꿑sEF.]翞Ml?lT)F\rL (q?[8ؿf0p5<ܮ{?`?Ӟj? ɭt?$6? "ʉK0Zl?ZQ쿸\Ŀp,??_3ܿC{o?ǿ23?Hߒ7YY￣Moz?[rW?@?B$p ??N ):?C?A !?f~"Da?|?=fL?ۉ`ٿa-Z0?]=D?oR+u?f\?8od hA? Y' [$ѿ8о{݈Կ%CG?ZVdC?9 ?OzQN?`zi?s 1qN=a?`Ah̿R8la?t ƣ?J? M ⿈ӈ5?W|$4?9N8S?4|??n ?qf?"H R80IA:w n䢐B&;jv(?sGa*?B5>Txy?)f{U?I.׿튖ʏ꿖W5ￛT\?;οאo?тW?$$翿96A?-rx?iB/GnSzgǔ?XG?l迃;D j쿥 f?;S@? QU?"b@?sijNUy<޿W?VUe74>.m?:?4$o?O%z?T*pu2Ss?9z?o{?oRڿ* ?sa?+iۿif6? ^?v8&}`߿;I/?=CU?IZ?+鿳kǢWgMs,Pp'U?6ؖ?勍&?3|?ByF#g￩. J?R>K?κv5?)ݠKs?0dC?M?!$)?(nI?{fz?O?=qқ+˿O￬dgk3Ͽ6Sw\?2I$?ϙE{s?ޘ0P?Ĭ\?'￸9߿q:6z 꿰I;וڿlI}ܿE9M4\0?Ek K^?㬙￮H?v)PTFڿ9~dJ߿bь[OqlUпߪN]XLUqC8Cٿ H= pz0S} ܆?\%xW?]xg? 7ſXCb|^3?FD?%? &`ÿ#`~?>$Sn?Ynt ѿZMA?"}ǿON ?Fd?qG˘!1j9*r?n=8(ϑ,!s?t%TwF>Lg?؎h& ~0??3"?ATϧGп/䷉Ϳ >Z??{?? H#k?YSb&W*_Iug |i?r)_>忌k9cG̀O?o{?2wf޿J{Vῲ!P8?k?MZr4{}Q?kî?.7ӣԛ?eH(LxD쿱z? C?f^„u^?G}?ОmK{J￙$pO: v5?ِ?ٚ?t@ѿd|?b2{p4JץWr?®p@O?>&?Z5klޠRI,bxSRS@ Q;]?g\?g$ԿC%N?_eGyοky?hcȸ]ziH?l/+D VĿ<]ſXvOB޿?s?(l?7f]@?RO?׌6nF迨>?8?Hv?o8Z쿤#GH?17yX?Ld?BJe3࿴X6'b"}dv@?Y??7X?KvTDg?lՐM? C ?]?4? Gܿ/pvE:?b"۫PHe.ǿ+ϱƿv!F[T?|>kܛ??y{n°?u~LgDmT?^Lb6A?Pt?DULVҿUXÜ￯w?ɦF  ׿8h?*n(t?pZD࿌4_տHYly?}?ޗJ?6 9?mbX￲L=쿪OEmQLHտw?HJ8% ,?H?>u"%X?AZ=)P?9uUĒ;?fD3?L3y?  []ٿ9hI?![m?e/WZ?D3뿞W߿BHT?YAE`FLk+)r~ &05 ?-KwRڿ{Y$o?4Щ˦vX?|&$wv=?=?~b=& ?Iҿ^w?Ȣz?nU;1bcЄ?=1?VO-b?sZJ?AЯC?Ah@S?U?7Z1׿ʒ?VOxǿQ濸B]?6p ;?Rbù\V?#!PP?=^Dg?EE8{m%;?E`oֿC2y\drq޿&{:\ AgEdԿxh D깽aH?V"Ms{DC%r?a*￱?X0?UR {i-0ȿ f!?Gm{Fm8?>ӿprQￌwn?޸7?Rnj1Oy* _C@@d?g{￯-? \a?>*?:*EȿfI?ߏ6)?Lt?)Y?5?b>?Z{#`.?DGߤ"޿SJ ?vtQ?`W3ǿ;ĿrC^A @Ďo:𢡊?8B꿜iA8-? ^ΆYb?(-鿦8{?NگӺ5A?aj!ʿw._Z|6r?:یZ?Tz?d3?V0o(?LӪԘ?Z9?] s m??8dֿFsm9?j3l㿍J?FN7ji8|UY Gŭd}@?C‰ڿAE,V?/ܿ _?L]CD+$B?sbzֿFc#?ʕ矿9?vH*?6$? ok;G]X{ލaw iTh?C`@пU@Ja?Hok+?V;Gi\C ?l?,t¿*:iUMڿVѮҋo'?`c?tsaM?9<տy߿e ?T +? Ec?Cb?}?f3ￍ7O ?JX˝ʿtzB*P?9?PV r´￴d^Ee k6?Љe濔g-~J]b?g"6Nv]?\€U ?٤g9?aOc?g!,mmP?u?ǶUՒ?SE?B!Fl: ?gmhUTm~Ҕ 濪:?!%?9^"#?Nȿ廻_NUe߿kl?*%?2=jX(?:kD?=FP?>.?&?jc /?-B ?5tt4k(D)?=D >D?ٌԿ+H0ȌB?M{?zs<)D?6ܔ?<鿠G+ɱ?Ùc?߄Y7 bF/s߿*4 ? ￦!;=[BՁߞPK?N+?F7?FEۿFj= ?|a~yԿ3m5?B(U?L^~?Wqgt?`M?1R?AE??//KK?эL&f?޽=.(쿫Y5C쿒 ?cPN2+=?8￑x@۳y￱rEOiP?mbWpￖ JO#}U;g?=?4-9=?~7cԚS?*7&{d9?vL?CݿҖ}u?jh???.z>?pu:?TBtP!c7忪Ӑ? %\ L6b{??ͅtp?+DD濉G?Gɿ*,?/+x$5?xп} h? /?a]_E?D9{,?׸X.j?l3w˿B׀Ĺ?bR?;ƽm Q?7@5cL3?39HP?k:h뿻ksry\FY￐O?%|??JE0|캿~?V(;\?*/]?j8i?U|o r?iڿHI?=u¿d|4y:U?jA?Z)IWr?r?l+Y[s3ð?sRmOАbp?⣎$> `$쿬#˿܀j?$ H?@⊚忣6]2ĿѹfE?{ * 'ܿLсH׳w?MiD迈ܸſ:a._˧ϑًE$]^CL Ywql?￤Hۿ 7?L7ῡ]޷zS=B?ԏ? tTH2fO?)j4?!?)a?Ē5?B7S$⿕7s??఼Ͽ(`k̿@~Ͽ0 1?6:?kц vJ?1 E ?C-&`ο,ܬ?乜ɑTտU*?7&3?C?uBo-ҿa,ǿ-QRտq1翯8f'6׿!迫U쿺?1Sƿ夓MJxIQ?5c??:ۑ?d=_?$5?U$8#^ؿuMￏ?q?￴-R{i׿}0?cƘ{`0^P6}?/e?k$5ORzƿe5$?3迡?+]}Pz?.sUTf§ؿ{:ӣtѧӿ~Yա-?\iߘ$@?)LS|g?/lB?GR4F.?f?$n y'} |?p ?UTn^ND݀g?=?k)yl?oP}b>g1ڿ`%/5+TA_j?J.)v]A￨'?3o?,C7?4ܿLfD￟GU?kC^ؿAE*]?l.uސοv5濏(\z?҆W|[ҿ,濪?A?0ս?4Ok~?hz{ݰhv`IÿVѫ9q޿pw?jpT%?1D?-y?YZ㈷ʿ3о?hBƱ$? DdCkҿmP޿}2Yg濧ZIٟ?0c#[׿*-}'^心׸?nP? ~?AM?-hMӿte?X?7*GտT-cEѿ]S?G Iө?"yˏ='lܜA$.\6?T3?m*?gڿov-!?,?/͙f?~ xؿs?2q￷|do?ֳjL,?a? MVW?9MZ?D?r0?}al. @?& ?Ɵ̕? x?%}?"w(cٿ鉶L?FlIom?M#濑kE6쿻II?E;/m!?ɥlBVq%wǿXp??kȆb?6O#c俬<̿e꿍^Iￎӄ~ud?ZC#?ڼRז6l}?77H̿Sw?21 %]ɚￆD^'?cg|Z$̿k22?|u#_+RGuտ;=~?~䲿W0g?O+ń$ ?j0>?C?3:ҿNJ?&G,?bpY迁Mۿמ8Y쿮m?՜R?93i?G?ͨ?`!F]忈 Y% Ӡ ?yʒ}?Pn`?t@t+?A*_FC@?]cG ?<r*?NcXء?Pdb?G˴p?[J?uQXp翓8!?Gk(ܠӿWʒ?Dt4{+?;?eq￢O2?Űz?ba?Fl{@ￃp nma8?,$~WXo? <ؿf;|3ڿb?@Or?=?8։n?k3ￓL[?0?٭/?&o-=[,)#Y?c??~SYp7Щ??MAI?8濢f)d<~ b! {?ӭӐ翢L?^(pU?~jѷ4? ӿ?aտUh$:%LW?@濋+f?|=i/?gϢI?N=?65j>Y}rƞZ;?H?sHw?m%Lr6Ei8ֿ8mjѿ[D?g|n'2?8c叿ЃB?OU?&|Tf?f8m5s?Hd*qӍ ?Mޫ?ش;>y?pcM뿲/~￱c1"&@ ~.EAuJԿFпSMi)$TO% 06?sdY￰>.1̿~??9Tn?.gV?p: 7?<&f =?? rEJ?8`?0}?;+Q?_1f?(@8?Xh?$J=l 3V.e࿇ 6С?SG2Sڿ.: l?F?eϿ\�* 1M?@~E?_H?^!#?ՉPeyXsK ¿?Ag(?LoѠ[ݿ0-c/W?ì5?&a@?wŤ?F,0?>[*?%ؗa?o#;?+5-}f&;? O05[]m?Nt*J??}?dϻD"%?% {NKf? ܈*D?Esgӿr(?x@o?n^뿐p-\>v?S2׿p{?AMȆ ?i_ٳR/ۿBS׿ٿU}f5v>??G|?,F89;w?N۰?ahd?j??4^yI?BӣR5`?9;bS~??f[`?bN9?~r!S?lNӆ?!h˿";M?s@ϿcIגԎWT?>H/?46 %8E￨8 x[?A6?x| ?==ƔÒ?=ن)ѿBjo?ń"lha_?*..QS?-v]?҅r`Ss;? >(򩿬9bO?AD$Q??9g? ةu)$hۿ{ӿ}O~ x￈Ϝ?iar? qa?qZ"Z?%_?%L;}a;*?$0?T?a`7n>?+ɿ~/Za>o'D)Nad?n2W3?h? Y!.]GPm?T[꿢1ָP?o?-J?̵g^㿚:<(Oޡr?|¢0da?ZW_?׿Tlx?<,? "g6 x?ΰ?AU F?Zd?$7܊?S̿::]'c{?ǧV?Lnￆ\?IJo?Ae!ӿ_k*{U\#5)d4u?Bݒ9?2=dͿlrO?lIy>i忾m jDw? :h´V1?nDߎoeK￤?1쿛Yo:+?ׇdWWqp鿸r?Hl+!\ܗ?1c5?^45ʿPF*?[6=7wk+<{?Q{Nkÿ"h3|eK|?ȗPi?0p!&L"q?=JT`J)p-c1*?2nHdž濙pQ迵܊VA=ߟ߿=@:?$+ QBܕ?!?=w׿I?z4 ? ?tE+(!L#ժxw3?Zզ !x?Uj&"Z?f,c?fOotC俻:_?V/k?_+/nNv ڿiR@%?qe3?K^JP MP[Ӑ¿+?ت0җ?9L?Nƿ9~￢"?A=|?NވtyW?|9MfԿ;Zr2k2zj)x?+es%{Uu. ѿ*&?tPXRxG?H9ڿɔi_?+h? yq)޿\"? 64Co?/jEO:ۼ)?Wx?|v ſ;?5a??uam7?+S}˿ٴʓw F|?`)?2"?OOhѿ96Vvۿ͡?Tn _t~XNMCC*=?eK .]?NcￕhaHѿ3=Oۿ(uϿ8ީKG翮`4d?R8l?q{ _'#? MJ?qKʿeXzY?=kw?m?gPqݴ+J5?$ ? )Ƶ?T/濙Q7 'BCzX™˿HewF?wW?{fS7ο_= {?DㄟͿ5iտ@aw?#r L˛-Rjr]Ö?,pܗ?з2+nKK#qܿа>?|⿁{`VxI?rsD пc<{i?qHѿ7?)ad4?_5rd~ￊy0Mb{M+ SͿ.ʣ?FvzB?4}心GvUb׿{ 1ֿS?Qk$?`ݿܢ#m?#hSkBeyRk,*ڴӿ&$?*k?ؓ?7mT>(t 2?r*y信gfĬTy^p?-gW@?J|?/<&Jo?vJݳH5a(w{ ?+?)+;?F]?RY(?pPcm^?!)Lr?FL1? Q"5}.˔Y v?[`?4?]ؿmR ¿>?rX?x[&n?bέRKߥ^*xܛtֿY]?; V 쬕￪?X?Uc_?"SA? "w;? ÿ+P?|?, yߑN?+8j￠SW1ni0ܔn￡ƒ]]?p„ &A?۞śݿ(@￮ ?@29 Oe;=eDCrT?L{?[$]7O/kukT(ҿq3k l:?4Mkb࿄SZ?h_ 2#?V&r?T<|v`|Z6?3"C<ԿF&_ϞdX?WE??ʸ?=Q?NPFF7:?X?B?15^D#rv6܆T[? wF?Y`ܿe-?{)?Z?;?)\?̃;RV1?, ;19a?E+Ny\?l3Q?4?>?[c0?IE"?~?L zܿ(?oK?,\t>K1yS|e?fl?8?[Y?h_GL?g&yڿ2J? ?NK?grOfLRwVH?E/8?{jڠֲ;F?9 hv2?I"8?("R?$$wÿ'wp.5jxݿ?0qP? ]ſM?F0=ݿW~{j8O?^?5?D 6??)%?%ϫ?]R_ٿn{?ՀKL? }X?"-UH|?d\NYULWxD g@e?I`LǿwSXҿšqYnK?ӗ,?NO%ɇ;?*W>?~?xY8?HShps?P\ſ}￨jnxq?sZ1z?s_d?V?hN?&?/K运M-?p?8ǺZI?bzm ?Lk=I?:@1%?WOc(?DqοVS8?}_.7?l^?Pا8}0?뿮tWHЕ?Ap׿{bHgg/d?g?V98.mJf ?? :eK?ֆcHk"e7?q?#A?-X=?BzڿsN<`3@^?~╂f(_?QhD'ءű} 4/?TS?y|@Tv?:?kLי?^3? cvTr?Tw)c 쐿,.J%c̿ӸIbN&?VޤW?T=n$ ?1 ܀D?&5쿪A,ֿUҺ??A6`5J[A?t`?+ OʿiSq!ͣ%￴>?UVDp&r1?ݦm?j3?!06nhKMʊP ?Y俟 ?lbj~}MPζ˿_/P? $"5?ƺ\.?ha9&ÿEMoZ?fa${?|'? r9?$JbZ-? 0H'M?3')J*ʿw`?%?X#5رuv ? %W?`Zg?x?|?@?#s?@8$?IEĩ߿D?cj?O[B?F$6G%v0Ʉ=׿\?o5ѧ?EKTy9o?7?PFп|N4bCc> rÅo?%&ϿWQˋ??\T ?/y(Fb?Z8ӿ$a}?*TL?i6_?fgnW?4 οg^7d5C¿l.fϿ0 WqP%nl:?3?J@?T`?2ֿg\UVvؿpN^?[{ￃ14~Rӿm.Y?ss!?ޢҦ??¿ơoy?dg?A?w;ؕٿ5j-ٿႈUq?EtW_WF]￿Z࿉҃^? 7I?wRs [ L ?H5H~p:R??NABֿy@?R]?m{?.?yVޤ)?TuR{x?uO7X￤<?{wa[>?ko{?EKF?:<8?QS?&c)? t?p?E? T.ʿ_^EʣۿYT?;dK?#$HH꿢l+D?{Ű?>鿵G #Zfڣj]?6GJ?_д?q?D뿀z_?J5?ӓ[}(?QOO[?w+W?+e+FM뿾?u2(3/?,?h5bW?|w+'Cj?m2H%[t?y ?ɽQ4KZ?S ?Ʒͭg?% /_ ?~݌\v|97P? rdٿ½濌hq?.6A? P*U"?R?k]aWۿasO?,M!ͿKHaT6&?J;saUrV꬇}V?\ҤB꿶(D?uYB$Wӿi,IMԇ=ڳSN˿I?]i׿Ŗ_쿲KE?I<qpČ7V x? f">Fؿ7R鿉e1Q~ῲg|)?b?CiXd?˵v?'o?Ϊ?8%m/?#)?CЍ?*Tjr$ _ 4?ʁr:? ZSֿXοmd?Wѿ+!1ܗ?)%)  ?[sr?` ?0X?>%.H)? Jɯڿ;=:9$?}?me?p4?n m1cHӐ??G"ؿ୕տa#l?[L?:V[| [e; փ{|.z?qֿ|?.i)WqA wˮ?ڽ9<ѿ=$T#?rs` @5?;~?HF?H2Ѯɿ)?(p?tg^n [Hۿhś?VZ"?{l?]Bc}?pU?vw_ο1ؾ?gF/c?!0£?PXz a:P:H߿)22Ş?:fxPv?ARD˿$؆b?:e?@Ó2?Mf٦D￑X(h?"$?:L(f?J)?x?!N*+)пO?z?X?\D? V*3?To?(č?2>{ɿYǁg>X_ ?:࿢10n⿦E ?JmZO?wo ~3;տw?fX?r8SfGj?jBݿcP 꿥\k?Y￨](BnazA?S@{W?3ο\b?V]4?霠 ?˿W"i??֗)i*F@ￆ P?MC!} ^_޿P'yaN?GxD\ߦ׿TvՇ?Q5hۿ5O8WԿ{ v?Qkʿ .n?Q0B?1?nqݿ6l?| ZUN]=zjI???^VVܐ{ -￷Vr}?'̙$?,zh鿕6b!꿄zɡ ??:>ÿ7:+9h?0j[0?#M�PǙ?xq$Kg?n4A?\޿jyБ?6?ƿۑ0o?%h?o;:ֿcd?Q}0?[*z߿'WP?"qu+x5b"?ktQ'ٲ?E{?-hrۿcA޿:q-l?Uf\J?8",οE\\{I?JW?Դk?xSￗ#^f꿃3Xs?$3]]?r?PSMݿ  9? w7Fӿ3P?Lah'?z?m:\ܿ,)OZ?>p55q?Si}R?H O?$*u?gg^^oL>?l~z6s1J?#Mݿge" ?cp?h}Ա?>?? ѭP~Yim￥%7" ?fڠ@ۉ@K޿G\ǿ $翿kJ?뗿 Rnx?b~Ԋ?տk!?kD<뿑C~%yv?X mS?iRXA w?},FK&S=?zοtVD?M|P)`qc[?2b远Tl?`?.?PWL/?el'/ڿ{l?]:v ?gz?NkK?0ҫi?g6^x?"D{"ſ(ѵ?=j\3ֿEh0?Al#?N￉"+?$cԿ}^?}\|࿨:=鲲}⿀-3?k$`&!]YWaf`Lu;?)`Ei꿫Q`?2%?U/{G?䗯Ϳb4j!?9Q*? 3!#rF3,MӿqBKzӿIDSvƿ5z`Z?MT)7`?8 H?E Fe-?G+=X7?`¿RX?əa?]տ3If*'wy?G@ϺHNٿvZht?}ku? 8y?￁/oh޿0_F#Կȷ?t09?_=?=!&Tؿvл?`0!ڿfb6?Xgj?'`Nُ.3?67\?.{|O^d?#f̿` q"̿=ۄ?D_kNP￦L:o?L y?f<1 M?T`غ Dq6? %xdп}li3|u?)pH?;_gc+翰:U d2?-I8ۿ.S?]Ceuh?ā)d:ʿt9K::4?Cr ￟T/ڼ?U^*D2?e?DGng?s%ǻ? НFU?ۿ/&zm~_Vu?Ы6?Ip?eUÕ?u=Ͽ`tT4?4пHx}@?BEډK?r%{?6E?3BD?O;ǽ&ֿ ?_?(^~?&)`O5?J￰;z? _2?!A?"B7?/?8/‹?5ȐW?Hiȿ:TDzͩ{v;%?,Jf@91N:V翴J?QL q[ޓ?].|?/L_?{ ,涿WPпDpdk׿qyuOu_%Q|濌vm 7?TA?f%ݿԬsts+k*ע^M5ڿ5rYxOM?>(FI?/&4?$@p<3:y?nƁ -?[>?b]^Ƙ?a!?H?`Dqw? ݿޜ?k?A?̂49W@mqvU?LOmп?L$[|?L0`^?P "9#ߚ{?eܬ? {Jy?CV?ٮ5ԿXF?t꿭%6\p /ſ%U{y3N\?@庬??[.=c?;??2Rڿ3)ֱ?^_I-nݿh?莁_n/?R?-\'g?Z"?bƑ}$?ٰ8#m?yFv￞(6 ޿iDl!?4+?9ʠ ]翀e/@?Yy࿥wb0i;/̿2-*?~ց?q:+az? !}[Z11fW* YRIQkE?P0LG/ƿ3:‚?%$yܿҁ#KSϿ*I?73Y%1S?D?7jZTY?E`LE?kWDnY#O6bF?mC,!.?ڵy7?bv5  N?I!2tWDvd:?C,?tjW?K`E/㿭-֋ĿXn?}?T}PYW?e^:QCT ɢ?ͭf῍>ݿ==')?^.2?;1޿$mbW7?:}?d3?V1VB?ų&gA48?r4a,4! c"..YMٿnp-?`4 ?uLhc)?V?'VEQd$?c+G ?EJL~?<`?mU s ?ޱl?r.>߿>LIdܗ?Xݿ͝hL3N?ƊxKCqaD=6 e?P$(KAuCYp}S?GT.?is!?|\߿#4w1(?L o?d1Х?fQ=mҿv?s4?!,"E?vEWſ,./m?~lؿ3dK?:e';w?s?h֐O?c?:1H}ٿ!J,�0 +?"o迻"Uο"T'￡ { }?uz?_~?zV*;s7 ?+` {W?m c2ӿ7cBG8B?Ce`xT~տDO?-?CUp?9R)PI߿D[LNrb囘?X?)ϷR?ؓ t?<쑎6;OC{ ??Z'? ͓o-K2aO?ܶa#Dz|p쿯y&n1N {?p$~ ¿4g?2Dl ޿/X#b3?Z@?eI|C￰8?ZɜqǙ翹ve?yB ؿ?Iǒ8?ƿNAh?p:tWĿ !?#i[?}ij?] S?@ ߿KVؿބYc?G?E*d?/N?Z51RA狤쿖;jT?.46j貜?Aoޘ?3 X??"@1?6?"Mu*$ߠ\M?ϰ?"է?O?u 7鿴>h*|`?Q,?@6"{8?7);?/ Pп?Tդ뿪lj?:ʕG?. wD_,?iA ,xLK&?84 p?P0e?P6*?]g?e %B?hИ? M˿ Y'?X]?_Ko迾#Lk?t`]?<4ܿ)xޡ??!?h]B?Úo+?h'۲?xDX69?yјN!?Zg"H?8%ѳ?Icu?QCHq(?3E?9!þ?s<#?H3|7?0VNS|?ѧQ࿊u̿@z_<$%??G`׉ۿjV G@"??U })r?@lB Z`%v￴$kgPn֯jn?kaee?Կ0c1u?U3'迉rwyJRk ?Z\#8?<?b?PXZ8b-Գ?T 0 ʢ<9t϶|v?bYK?^O_w?&h^?GlE 8?q?(\PeFZ߿WSJI?lj??ƢgL?. bJlc?Np?~)j?f!?RTHOxd?Y?4crL#[j-?_3睙=2 x kGPnAOX8?AT޿K7gw{ճSmv/2׿B5G쿼)pqѿ?ZKLֿtl^94tk?yWd?T ?~L̿x\?$Oh?sT?!?Sww?~F?A6:}'쿎 ?o N ?q4D*?ar~뿉ؒa@"?\+Ts?틮yŒb?pFM?pEe#/'?Q?#J]Uv*lz)68?{}?he^?tX jп7>"Y?? ?6?}(}9? V?Ԛh?Bp@ ⿑-nrmٿςVFDÛ?@zc|?6//?`xV`B_j:ʟoMօֿ\qyr޿+FϿƪq ?DoQ2?4ѿK<迶oC*Q?w2?0O-㿃fi>￾Z]B¿V?i-~7pt,q lQ?7<(8?ZK's?[ ?qeӧrj)ſ^A4?ºN?O; ܿ3U[?CS;L?AD*տN.ɿ D?'cWސja?Y1$'%5ҿBx ?3)݃l薐?MJ6?tA?l_k?I{fxQҿMH? Q3?!?ʿ!r{?7i? RCby?P7?c $n,d?liV ?i؏?xؿba?ȿIGΞfܿS#w( :"꿔U?Xa?v[5K^ ?Sz)Xc?F$'5yϿ#?Xv?`I')'HT;4tiʿO+ +?O꿫Hǡ?nAyI'?qUΜ?XS1ȿRSދF߿?)gjspؿ!%`Xu6 ?g?+j{k??t (?&FEWNpvzBfU?7 7׿!?*e3nu˿ɼп>+٭?PB l?w?= Wr?L?o /jʿH7N߿9|?gM"^¿(jg9JtF?+vQ? x]0j"`进 b0 꿩e\su)￮t:ӓ a?nZǘ?g`i?,i ?Zmî"Lj?M1NVr̿`?(T4rH=?ֽA?&?d):鿄x%NF?n:8(5?S޿P?Gz?*a}Љ?\kPͫ߿ eBؿlIdo>?m0s?E$A?/+De$q'?m]r6!NpƿID<?PdJ}Oxοox?zQ١u3Y6/?$og?"l?{,b?\b<ۿnR !|>bFl `)/ؿU<?om?$!???OÎ?bn4)k*Do}AL-??9[?ID،?ՍQp (բտ'A?$4;f) ?8y-fu?]e(*`pZa?Nќ'Xe~ ?ݜY6ݿQy%V?"ay\?9B޿z/C#]`?.K?￰V-n俚gm獿?0Hjm?MkT~Ö?1>$??G?b_￶:? r?6eR9G *D?_);Ы?N  &?~Y?d l2l^ݿOÖ?64}&[׿FȽa=6?t+߿z₣z+~ￊ@)ϚQ?yf?ui?n=ƃaϿβ?S|Y?]?V?ފS^"k?åUm?_/?7Zҿ4sG0?tѹ׿qyT[}?$?E\s߿h?Z,]~EWￔ15? rLC}?i-iwi :?<꿯Nm"[Diҿ BDp?aͅDjc$?՛*~㿗D3ÿP@?i&q?魴?ˠyOѿgts0t?/5 ?"Ç?z]?BV?="h?<3!RB~οЯ[˿ޘ?ܠ92}?ikcVV\ϐsK-7?ϿF)ֿ^+zX4(n 7ſlF?*&c EԺ9?kzb?|rycWQ? ?)Jb?+7?}0Rm?"D1ѿ?%C ?*Pv?bXE?ru+m`)?5C? %_?o?!>hʿ,VJ?<1_o?$?0w *I2|%Jm$$RQ蕐)׮?6V/%~J`1ȿљCSLyl_X]6W=?ވQ?tH&}eKVʇĄӿ [@5?f{!9f8l?~]gῷ;+<? 01G*@?6N?ǫZln!m?!/W?(= ?Qп)? ?|.?AN 俛=.?xkrD{5f T}?'(1?~OU,?x_.=Y){iޤ60:7F=?xډ]?#8~_?.q N^?}?fkѿ*Pk:Tz? D ?ғsڿ32DIvEC,3?'?0؜ږ?%p?whӿ@[)ͿJř?P~{ҿgЙG0ī?yB8TE?=?ΚI-?wܿ!a?y,,׿ N0OY?E'KU?L?u'?YM?e$=?'쿏m&Zܭ_d?)5o/2=Ͽڈ8?ԡ:m?Y8T5?~39^?z㿓L?Kdi㿎}rb'߃?}F5d~[NqT C`P?[jlXֿĿ?\O?,Cy9C'_޿7 q?Nx?k 6 ?.F)j?Aۈc?uaV9]+mYF>?&!M?*U*̿yk| q%?澞wX[?Vg13? FlFcE*Muxÿ В y뿵i oe?a q?t@ֿp`PIοH- ؿ~%쿨&Rt?mv ?aB%?cdDZnvￚX? ?Mnah?v=-i"_:|S/--?\̏M)c?S)y?QV-4?"? a:[?ۿnWT?@`w6S-?h;lT?&+?=h{?txtF0#70?l"?mP}3? Ot@mF?}(r?6e 4F}?<:'`?'B?YￖYs?>ã?L 8?0?;2?Au!ǿQjā|?M?=cV-|c߿5 ?*m?Ilpt0i5<|\?nJ;?f꿄/(?ATDaU׿t`=Ɍ0v>DB԰5'n?ѿqXs?'xD?FaĿ蓻ޱ?zdpԿa9ٴo?'U )q?/ҽ%ʿyNg4Վ=C?" 2Ϳf[cb6?dQ܄f&RA?fRh)?G'*&.#'?)w$?M[Pܿ!ῢ@$ٿja?ܿ]O?Θ]?g};'E=gDCJ?%7?5- пՔݽ?1vHiw?1Vk6?dž?ggп?E7?|N5 ?uӫ?U~]Z%?m{_^*IRҿ7Aؿ?c؇&Q??xI?cۿ#LͿC-D?&i䑜?KfU\׿,tȻA?8i?*K+u?%3}?l?.?( tտyX;ſp~׿uI?2n (5? |@ӿۥ?|Bw#?ith9?hP"RT?{?'Y ܴnD?:':?"h*?_=N?l?d*Cqտ׭/j[Isy&޿߱S?xJCS쿽H5rYVvB?4c?o0?ћ* ?qEÿWk?6zj? ںC~0̀L?3x?+!};-׿p+7uȍ?HT;8C?b5MMxK%I\?؂';?xN0G{AưT π?ba@9??#kܸOM%?͢g?b};!&6j?jr?)<7"-ҿ޿w^(?̅ ^ąx?Zԩ?Q-w n?}gV:}пWCl,hU?w%|ڿ<6{$?T owHԿ0[￳jw!J?ļ[ӱ0F0 ?TBC?.O߿90bIy.HOy㾫οP)Ojeп͊࿘P쿡vܛES\?&f?YZ3쿸 !⿺,2? gmG?Կas{ֿΊ[ -"??X2Q1I??߂?g{?vKLZ޿3?pBU!쿒2l?o?)q ?I)sҿ<kh?Pk?C=?_O6ݿ+?AcY&? O A3?\?x F?%הT?n?[-ܿ}4A?KJ?l׸I̿*pp?RVFK?V7Bd⿉U4;|ￄCt]?M?oY+MLI~Ro?S@f??>K jW?^%W?_*ݿpNQ?08ٿi! ׿4Ʒ߿ݡkz{?H(a6￐K졿_}Uɿ̅,0?6m?. ~-?Nٵ"ԑCp(s a?&?!i.?] I2z5L?_ݿA?U?H;(Կ [?U?!MJuȿ?8ծ?`??Smi?T*3],?M?}鿴]?O`w?wb.?ûƿ<]Z%濛FcQ?Kj1?'F?f"*hҋKW"?vՈ? ?/I?Ѭn?Cm>4=Ӏ( Izh,߿߳4uj?O㰁Mdϑ'r$ȿ kk?l?HNڿL9ο;O/o?(?Kx??c[aY^m1?ѿ@26l?#?K1gĴs-,U?uD4뿰N3?lO˿pC}`2BտxY? "쿐FM?cý?2UiC?ғ5R7cxￍq?ߘF9?B^-ￂ ڗs?,V=AyfL?6oc'>Dt?7a?^/c? N῅js0￞??¿S??(?UR?1\4?JI3\E`lț?J.?e҂^ٿ]?4?uݿϴ?4@[?o2 ɿp}S0пo%ѿǫ?_4`Bпrّ?]FV޿@ 0?j 1οje꺿jr?Q%&x)O;c%ԿE$곡avkt} :ʻ?]?Di6jΌԿA?\C3æ?dky?.{On:R??L \o?wL?O~$? [{B?z֣ozӿ͗ >P??l3]7ۿwn.?.t1 Gg?j}E?l'T_?#҈`΂?b~?WG:ݿk]|7װ?:Fҽ?A쥊8?\ƿy#?3g*'?如.? _?kdVyY17?+Qh!ڱɑU?yj)忿iL?47$Z|ɿ0/?9oTfefX? ly ?P &?'t?᪔a?EAD{?R7Eh_7HҿfSA?jFj?z?y.eYֿ9u1&?I3 Fb?m? m߿<6篞?v ߙ` ¿Y*'bп$P&?u[@?Fx@?~߿NY0鿓.rÿ9U #H?/dq?a\I?.J?$9&0G?@5=@脤ݛ?i,?uC{?ۺh?x^B.1?ҿb#? GC￁:%)G?a ZqS8H?gR?ֲ￷dZ,¿Sl?EZ Aѿ!tʡ?BBοq$#?EZ?+p.ld]M sr?AuۿM6>y I?`?@^翳s?Y? ?KZ?ټ t￩PQ:?X(￈AU必[ucz?o`ot S꿠โ?z#vqF[?Z:;ڵ ?geN"-쿷 ( ֿk,ؿͅe1k Q|JcrrɃ?#ATȡ?)yXuϿ7Zv?ÌV?2B,Tӿ×r?R0G8GϿt?~?!?k~Jy?L>sN I?׿}cP5qbp @/K6$wV??˵3lr!HB?xw?vEd73P濱[5,?DA5?F{M$qCYsÔG?p0g?[3鞶ѿ} 71+?/C*?n6A%?U3ِ?Sa9nC'Cv5 ?5?{?;L?uEpF/ɿP迵D6?tcGVdi!mLg,Q&;3P?/m?5r῁~y?d = Q?E?/ ? x`M5J? ??/H9D(?b b6 u?fg;,??hd4`*?@ ?yBn7!< cd?mh?H7ҿR6Y%6j(&¶Uڿ۲_-ֿ傁)sSś6?v]?G]?cG@ eot?wˆpοƿnѿ1 옏?=k*?)0ds5?kKѿx1ĿYH޿_ ͬ#*w?1?9׿?c?D#sY?$*$?~]=C׍?[b+_h?:%6&r?~Z￶OK_r?]2E&? gG 0ĿN|ϘEw N ?K?|qӺ?=¦?AT#o?3O2ĒUeHL?}V?ѣ@ ?Y>|?ؿ %{xfUR)ٿÿn{*߿ʏ&Xo?sf?[[f?cEп5 g?xڦX)sh?j71I?Yd8?@?Dm:￵H~?δb?A]]<ĿL,¿ž͞俜 ?x NӞ-p-!--￷qfD1k&?l{?;e+￉l,̱?<{?MښĿ \z?^/E?}h?  ,?U?[!?5دi쿎4KO?濮/X?pRwp0;?Ge)?.?]GՎ?sZZ_?)H?a/ ?|Q;?XϬH UBӀ!#?Pzs?jp￾(+? E?D5Sￌ@ Sx{[?rcLOpvi?)y T[)?*?L^T1翔:2Ȃ?h k㓿rp- O?:Tb?h"?ZuW?:S?u})Lje̚¿Yk??XTyyL?M$DcNT?psr?;8/ThY;:?_Mܿ Rl?W?RNtF3,??G=ݿ$?|%\ѿY? ̢2a@R?QFI?f RK`?><}?ZFJѿI J?$X?H ?c¼‡,? ?}K!ٝz[?SjYiʤ\ށ,<$A?6뿒,:p쿪XG>Ϳ9y\H,`ؿ|3~pΤl礣?{gm kֿ(7?W?Ix?b 3?}Sdi쿞F`￉gȻ?I&ܬ?[,?k~hqn?Id?K8~LԿ$Y(!?N?1mѿ+]g߿yGM" ?mq}?=q翃mPAxƯa@?%:s7? ?Tz$pG7x,?:Iɥv̿E %P4?W^Q2?ęc?L[俖Rs?c9ܿ;td.?, 4G?pL!?JMDT"XzG;?%B?zc@¿o>￯Bʿ!TilѿmjSsY?'E?2?c?W2?6V]9~(0GFYv?IQU Y;ￍk^ʰ?B\?q)? P?(RSl5b׿^ſ41]ͣu΋H{b?)2?ZK?Ƹ}*3nF]?3?ocܗeӿarg?}~#i7P?ݱ$?jF-?A8+?V?/e~?Cޖ Կ+V&9 z^?MVuq?2 $?P?5u?yޖҿҹ߿ 6 ?J{p?je; ٿf?z 3a?×?38俚Hp9z^?T(f*?-2b:rxֿxC(T?)?@,U??c>G!Z5WTᘀOC? ?ￄ o_?VHy ? }9?m?E;f tҿYt$uuͼ뿼_࿵澆_NA!Sʹ?4ҿ㭻;\p=R￘"Dc̆o?(EU? ӲYV ?_.?Jtǿ"?xD?6?`z׬?{:?)+=9?Ah)\@?*kǿ?p;?@M ?rν?;w)ɟE?? ̓8Wρ? ￤SPy4j9P?(u?jd(?PMۿK$)΅q??t;™x?CBN? J?o7V?޿U]?"ݩ?w^o?K?w^?J:5Z?i3<ݿJj|u?~⿋n+;H ["?p )?X$YI7 - ?U9?.{Sr?귭Ƚӿv?y;?M@Ly?zn?:z翐{U2o?#?gU3#8㿧 ?$-% )7i?4:?KK/?//yȿG) _T?M-vJ??T|~, k%s?~ל4yD?ć]B4ظm?'k Yz3p?ɸ?^ؿQVz?ݿh?Gu\1 俷0HOMqW?I®戆ʿU6MH?33K%\￶だݿ 4"?yo>I{?i֙Ă?>(<鿴ׯ*ӝ?8G4?9-%2:?3ܲb+9??^V|ya5Ͽ f;g?%ӱ?x}5RAT?of1*?(-I=?&c-濛 dBG=ZGU? a뿹K ?MfŻ-߿FN;ֿw?)CE?S6濼a7@'/ȿl=?`V@쿈+aпŵ)J@⿊?^6 B?cn:GZl.ccA㿛nFIyFrſ T?^c?Z8:iH|w'?-{ˌ2>$G?.=v?ștٿ95꿌H _?=Bb!MA?N0gZlԿ Av?8ݿי&lIr?mV?C)ojv yʐjÐE6⿆e4b뿐0!c`Jmۿ:yٜ? $Y?3fP?7z퉿w4? j?ާ%D?Q3^뿱[kQ!ȿ? 7?خ?ks?Q!u?0}5B?eVej?_ΙK?r*?@w *X9\wf0jv] O?*`?\Tӗ jzۿ[HϘw@ҿ_K?oqG/?x"?`iz^㣿F$cIE5~Cÿ̹&{!dɿ?'UC`?~ߘ?8z]5N?ՊҬ?NXM&δ8]ms*ѫIكZOj^?߄ L?=r5:?ˆ+?I(ӗzb?YLi忻tt;?TFw e?8Kտ _$Hxgs?'clpnav?}E?O<6?\?g @tQ忈l f?{K c*?u㤕?8R$q v?EAoa?3꿝1s?0r]0w迤_7\n?:]2t?Ri\v㿎cVڑ?}m&!޿Jqh"ٿ4P@<Ybc5bٳ?8B?DH^?(ETa+6ȟٿ1o?6̿ql?3e yv?#ּ}WfV ?,'[Q}©]?&??ֺAoavEd?(k?Onn̙P&T:{>"?a~3?suC?b"B ?C־H^O?<Lw-ڿ.-/mQx¿Ю}E&￪q0 PK?#BAS?/ Ө迥)w~?b*?ᵉe*0L?Sȵjʰ@aҿM\\s?uKy?@ƫf(h?h9p?(m?1 ?6}i??myBҿ1O{ x뿙-\?ۿ*dB;vd?{~hG?_z??P??ߢe+U{?$]m{￬Ə:j?+g]9`c?i䳍˴?fn?Zuݿ"jY?BB9?z￳6*{ӿ>{*޿OgO?eYy?hڜO?RTǿL[ ##?I)Lw?93?/Lx?HW ? ׋?Xki?=?-Ec?RTA?Xzɚ?xb? zv?w￁ ,6?Ġc|[~S-?I&zF쿜,?wܨ"ῆ/Ӷ?7?(?U<*¿fQRpw?E,=8=DQ/,?~@Zo ?|s?{ ?!GO#| ~W?pe1'f?Yuޒ/[i?s?C<<YC95W?S(?%P?_D῏/b8 x?{?rň&(?$+p?f{?SE?~ECFп+:?z3 ?k߿rkUH,?%x?fHi?lIsؿ.N`?uoz?}[[ol#?eFZK?^~.qL ?")z iO8AĿR)$?Uh@fov?Ϥ}?l_Ia(o>?׃̅rmsH?onl/C}gB{L&?4??'ro￳阐?IR̥?(qC￁~N,? I~ {qM&R$B?H ?~ѿ3z?2c]ݿ; 4M?jcTcd?ZOrL??T(De^?)86H? . :aB#P?( ?H>?<Ɯ+ſ5A7M; sB '63B#?);?p)hԾT#\2먫??~?_Rw?vFگˏ*?_k?bs9?l?J4t?۠Ѕ}%*U1ZXO`4:#Z"? ?d뿁uv?( E?%x￾t?×]9o{俾n n?lty?Nx|q?T^??ҷY+?}Yjս?V 翐NٓKm?e\m?G\?r#0Կބ:⿝h]?U? ?6 ?$*?aS?Gj?ڇ ?Ȫފm{"? ?D?+?Xh?=â1?:)?HTֿ[0b?@Ƙ{?V#sz?jXs$YIw̭tjx<Կ!4']NÿRA͔пi&J \?H'ǿY:=<ϿdFe_o?g&;?|e?FIL+paCE(!FgUԿݺ8hg9?f79#0?'?L lf@b?rӿ4?E;p?9h?ֿ}~?U4?K>Ʈ?8?]>qe:L3?u0?^r_? 2c ?￧~*{CTh޿/zs:=4쿏]6n-?7ʳ?>l? RJl?ӄ8쿼;?@k!ք?.n|?2A?j?L̿͞j ?~?B0l]?Wc!-?F!e` m?H05濝A XPofNpܸ8Ѷп#= (?Xd7I?Ho=o*wnr$ܝd?wSg6zI?~:/5T4?c4ݣIɷ?t+BA-T`P?^ŁW?K#YJHZӨ?Um￈+?:LY?ig4lƠ5)FWdп9DvŸ/?QAIwTk?R?EAtm?XJ6ۿg8]z?%tN[>:?+~;?Q&3?>\ 'V¿K?%~jgN?hk?zCԣ8߿FO?8? ]0aָￃhڝ?r+d-+`MY~`ۿ-9Eύ ZՇ~_ſZf?YGM޿Ml`80?\ǁL9h?Dۮ?^kiD[7W+Zx?S'!?&sAy?2$俱Ĕ?$6x ?2CBZ0B@P2ʧ?T9pW?/?X `~( F߿>E7Z))Ö?H ?Ic]i?%/;򆍣?q?KBSSK ῌU PϿ-{N տ|/Կ'X[?Neh?/ڎ?`_?`0݆Ŷ:xr꿂)E}?yHֿ_gCt?sQb(P-:i1?AQ:Yw ￠L#?#_ж?'K{(?t"_GTBB?c\M+; 8^֤Q|9?W$'mU8]p2쿍KdRL:LA?̟Ac?ڿ Կl:W?ʆf.忨jy?B4)8̷ ?, ?mV?i'2ṽ??+'?UhƝ8¿Vj?VɃ ns?1 ?ˠތ??A?e{nwj?o~}4?6b?ŭq`n-r?H {AV?-l%?M?:KJ?#q&l? ̿o+r7R 鿨?Z ϐ꿮ߨz~Fvʰ,4|? =?Pic8Կ y ]NWGp +|x} Oă?.b]?͟<׿/.?r!1a=?+E`Uu.Õ ]?':pq!\w?i7Hn,?N$9߿?EU+=qMM?j8F6+?'b-w7K~?a.(?oR?8wg}s.F?6EG c:A:E*^[?2z혘Քg ,?$?)]OҿXDZ?F?ԃǿβ& 5T\Sￚ]T?9ɿD=4?q=t)p"3\H U?v ?K68&و?!n+2?db?? yWkO?=#ￕYA?tŽ7Q?U1 ?CAr?5?ȴ4bb)r\F3# %a?d׿ |%{=9}?>{鿕/=`giRɘ˨.fB?O?Qe'P?>5ar?GIf޻[9? ԿrG{kbh]U^qW¶T]?L j?F??nKlb3WK?!B?z]_x3rv?S"*ZW?T~?'G&lHu'({i?*Yؿ]j?W¿ O*uw?4S?ׅz?}\l{KA?C?}&Ĵ?_Mֿe??W>,%8~??yB-ӿz9I?bqid?^G?u?Uѿa@?#A?5ی?jK!!Խ[y?}P$?ڝqx%?hU7?&nҿ>YÂ??}s3?Cyc-_?O8ȿ;o43E!}?\ЯLqX?+\f':05ڿ0ky?m3?#/"ܿ&/N]+ҫa?Z?] ?Zl4/ؿNq9&?aϿIssx￸Jc?avX?籌?DT+?5.ƭֿ?kzܱ?a_迹Gڿ3hٿƯ(P^?,_a?yY2'4n6<4?^W!^?6?]vn?(??Y>`إ̓?uGEi\V ʿ o?]ŲQ?_-T7i?(wԿM$J_8?wv?|pQ?c\K\qɿT$DKZ?_@s)k,f `? Q-[O޿=>of?)x7g?6.Zl? f ?3І?ʊFǿu t?%'Ψؿ%Q(῎M*?Cғۿ;w?ڿ׿,?iۆp]Α.h?M_lO鿲O{t?(3ʷ?7`?և"tsjQ ?=>l$?Ù6ʠn?ݦH?&7GҿM?k:'?s?Ak&׿6s׿ޭ-?4kMQi Mk\?a$_یݿ5}(:뿊7p?ق><ogD׿}`D+{P?l,/6? ._?wXٿΝx?il?Xʡ?W/"?įO?ɤ\(av?g?C߯꠱Q?"=qHbj￝oՍ^?~lIis+u?ڠn,?zѿ[\h ? пPN?[%'?E8?]Oj?o<:D??WͭW⿹O7- D翃(T@ҿx u$F>?g+r?g꿵-b.?_ȡj"v?aA8YqP}rVf:3gw?ڿ:'ڿ88?>? mJ?V]2ſ|Yѿ+l*?^kPj?l꿇e\ߚ 7?$dx?zY*x$ J?PN￥jJ?1';|J8??}?MBAy' ?6Iѝl?9Jy`? ˅쿹Re}m&^?Ŋk? hb`忝a?;ȩ?!?W [ ݾ+>݊o忕ﳐ忢"e?i?Llm?* ~?"Ϳ3MXۿ`f _?lêۿǗ*ￍ)!p? v& ܿOￓK?<@b瘿8ӧQoIԿ=VD?#b,54ݿ?@|A0,WC vg }^+!?|'z^{ڿ?bIƿ#_?Qm!?jҫ?v"ۿυj?i89Qa?yI3b'/;?dH'ݿ+7?V ^~?Ci?.9v?"Z"?ôe??(jؿE7;W ? YHտzaF'?듈w¶K Wb3׳r.?]e!ܿԘm$?巇?(K5t.2v6n?n?:/Y)ѿfh߿3*?jW>weZ{xh$쿡 y& SMdz" ?ۘ%v ?`1ɿ?u]i?>U?jg|Z>?hG ܔО[-濗̊ￖq?:dٿ,bu醿 rܬRR?gP ?`s'.?'"TڊQpϿ\O?e?0bJc R{п))-pA)?+K::l h.I忉[׿JB|?WdDNvaC]z ?eUH=?{-9?yN+b?+`l{? R˩Կ}(忼'Ey*?twe [6M?/".{j?Q7[lw#R*y?,?ɔNJV?6R? :5QϿE##ʖݿ)7tũs?av?z?r[? ?PCٿ=+=?[m-O)_G?d =*L%Jm) .迨IԎ쿂zH7?1Jrֿi9 O̿>?31i?SￆD[?"f[DܿzS,"ܿx?/6}?Zږ?c.Z154RzuT9Lz7? ҦA?ЗB ?>>?m:GJ%?¹!?b}?ؔpM-տ[ ?wT'o?S?M?p5o?{dH8#J7(_?&ۿ6JbN?>{3?C*hۊ? j￢XG-?jS^ￄq8)?Z?95࿀@P"aMؿd4oO{y?.Ł?ʈj?XPj࿞ѯ:?{k#6?^havտvSmV5Yv?MW?dN?ZOiV?O;ￌwΖ,i?2$L?# ?} `?cy2?kb隣?9R-AlÿT. ?K`A*uŶa ӿI/۸㿋gֿgʇC?دg/H*pŵb.ԿWؿ25pֿg_?یJM?E*$S߿^0G4V?r?<ne￝yMF?7pĿ,U'J?A9?؀7/~׏Go+q?p 4 ?d@L%ۿD䎉V)!g?B?44#忂Gzw?Œ(濐qɀ?L??9?g\޿?o g=9 D?.(!?^LgￖRX?^ v?.yc?p81\;?xKfx??yG?j?7 ?7O￷4? Z#^&1>4? #? A1?eo?o=k?7j?:WS)-I :]<翣S?p==$?I?ap? ˿м̿fa_俒+?nUqD#?CV3~Bwnf?G['sԗrq?xW?pwT2?CI?O#~%׿l12e?E~|?\L?;qV?X(I@?~)D>m?1%?v;?X\?Ԕ~濤37ST֖ ӦB⿛.?7it?ߩ ?|&?%O\I?cP?Qp(?@8kNY/h?w0jϱ??1hAhs΅C濻|t?2AkM?aw\Ϳ ֿLW?24?:?J?B?u;+"xۙQ;&5?(.R޿vKֿv9hʄP? Es4ڿ?X3$?"rK@Tl>?+`4hA"7ֿZOnRMLI+2${?ƞ!wZ޿4`Hn?\L%:)ELܙAIn?&ŶCݿ1|nafr?VJ?fÀ?G!?7?c;? ;_ٿ.*%̵?2f]? WE~?q·bX? %{!?eZf?ik꿍? JBZ}$#?-NU0N1.[?࿭EH86}Jw>D#mRv?%%K? l9˿?,4L99?'R|?a>J1?!o tT?o?X?-TaM?R(L?+?6?>d?Mʅ#Ĥ?B)ݿt&?!W`F&쿵1ԦӿF 7?cVӧ?Ubw^<\qD׿q,?j?8E$MYb7wĿ(6ixӿKY,fȿͬϟ?]=ￓC?DI^]?a9[U?3AB?"9n`?arWI?N ?﹏,?Ӂ5쿲~?_Ue?S)t?)?@/[Z3EyB?T6pI҃<&5H#?<ɒ3?qdBx?1Țݿ-t?O?Zmj?XJ??LZ? OϿ3u?B Z-^?E_s??d) ?_&r?0W%xd) C?k=&8?x0W 翅V4_JVa?axO=x?+⿱єx3X ?ƕ;?rﱿڦ?)vT?+~տ34Sz#?iJ࿦ ?6pAc? D?o,;v%#?r#鿬o?wǚ?H u N?_ wA%ο]P&?2?T4?TNcѿG,? ^Ip}PVO>Cxgh׿O[Dz~쿴f*x~?6jYj$2)̿2KI*C{}?kA#?sݿٯv"8￙0r?)߿ykM_ؿ`ʹrW?5h|?+t{? zN?( ӑK?)I?^8뿼EfL-%=̈?#tݿ _M?ZA俏>tNԿjrX.|ڐ:?v 4x 뿲MU꿝Ao?7D뿰.=Ϳ$服P "V2R{I?`ϊp1?r9vA?]?/?TP/3?$2mJ?۽ڸo?Wk(ס;ԿvCԞl+?seZ￳`G׿6$Bք?԰\?W6˿5`9迮?俽& f߿2T0?*U?㿗7vVu鿍rҿ| Ys-?+ſ I?Lش?)?g/Uc"|2?Iz?yLȪz/% ?.jYBп hUJ?r?] jt?Xʫʻ?C—XW$oQ8A"=` D~Ff?zOd,;1?{??f4>A޿\9~ƿB?Z?DVQ2뿇OL?zPF?=Nds?_=;?`U/?x eT?93$cҿSR'w2翣r,?y3l u9x/X?(-?94ΰv62?4q/9k&2^wп[I5ο@4x?yuzej?y7?Zb$=ےھg7k_ ?5H?~6x^?@sPGg翗l?hCl?˄A?0r?oe Oֿ#п0lR2DL{Ѫ޿K7c8+?aC ? Fs~ڿBf O?M2a yJ?}I2?Q>E+_п=܊?_8W?#hBn?%7?cos_ru scalar structinputmatrixaB$]Q< :H{]5ğGV -;vf7_anmi|- :YN25Ӷ-MW=ChdgaL@$},cba\ԜnejQކLcW |i@F&nhEg+9w_L[Ei8ϱ'xx=_G l% _C4+k& @9qXD xof0{YC<>WLQdʙ_7su,ٜqZBV+xI`3`1l^H+wgǑ96yeG+/&Pa7Abun$f ]5*/ 5S8$bgN0g N,Gn BeCdіBaZ63U'JGf>`sKV@Z1} K'QBOyÏ_Jeǖ h{⍑=FV y^86d^@"kxՂYPݵV@|lyBMoPli0a헫N2v +܂8K/k2E6&goyKSD'H$bFE=wP[ǞnIw/cʫlLHk~ՃJ[sf [}~ݴ,n܎#_)+i+ BdpH,x}"w³uQ/M4~r_gO7j.s#KZ@$_OlIG nmoۄ@֦ySfy_aI팀$Þg(:M1W4n e!ww \B UʑVfM_jzgB>\'J9Tb)B|#MRZTO*e!$_+Wú6p uU _TB_.'Dx] d|"`X_ 9dl|+w^`|OjgTu__/|! V/XT'/w׷~4Lc+Kj`ꨅ7F̋5A*0b?q/P4ab[T!XvZEr,ʶS\1fp2\z g| c{4{HISozߓSECİoSR eIA-46J}i4,X!+&CSfs0#J4Y0P̈ +,rn BzO"]i#5d6PjKYW27ziN3Vve#xsjLȞϑShb0WOh9H Mti~6vuGVKmR)|O5I!R PADHkk[r)Ǜ5Xl!%wXKJݨd7h甙_,} BdiǤ>CA/q!s[|qn "3礠eDA7kb? fCRoc}|tϒB=OKmk6=N,.H [j,@" ^Vvw|e89/|2ܜvZlNfXsz  _a'w A+[S6Lvxgxz(Ioy[9N{E~qZMɢ!FbEP\^caf;6GEgpo/ONPg ڋynt_;dy,sE4:O@`[lP Y zO >nzQAIh\v%vYIit85DʤYjgF!ltӫw٬6Ao/OybJu͙_vQoMchmϺM7XBl y;DzF7cT[ 'ݧa U4C[ae0l#yj)B)Xd 3&m$ pbjtEn]4K~=PMO n9/gjIe(uCA?ZCC?% Uk?|9g?!Q?$΢?kf?rh_%ѤIe?3wnżڿs7H1 ?I_uL?A)a&V}S6׿CTRڿW)p%JD?nDٿ!47k ?+U}}k?b>?| 1?YN?A￥ c+?DT ￂ}69?uyiI4b?,p6?Q-EL7?^:?~P?(]c1?3C=]?.?/'c=?=!o,`߿= ^?Ha?Q-( ? ?fWh1?huBx?GEa?EҨ)d0?qZ?lz?ōnٖ?x^L￨̭ɗk?BdX ?!˘?!6տ Maܿ C?Nf ~TNܿPd?~Թ?֢RLbʿ~>I?gO\KZDFwڿ)ZͿJ&7q_Kp?\m\?ɂ41?ڿ?ɨc>9㿗 k{jBX?5\?<.[?IoӰl?`Ar?q@JHVֿ$ҿԿYpV|ٿQGިPBظ?;?}gB?ۿ;Kf翈xa?ߚ̝?!=Z鿺kv??(O'z/Vyp*8h,H?c?Zǡ?+9?uڻX˿:S>:_M?GKiA0ڿƹ?v?wY4~??WNBQ gmVￖΉ~?1kƷFBw?췺?!8Ao?Zlr޿9/?}*7?>c+,? [? ݨBD?>*gY?A߁OFj-情?0>5?뎩?ⱇgɿg6ȼz%!1O.Bt?63E&@vO˿zxsbM濴.qԿuJY<[? ATu.c <ￓyjڿRQp'f.%忔?ob꿉Vq})濞)Ώ6 2dT ?qx4C9Uk5zY`8RFпed9`v?0b+1?F[?_?w`0\uסi?C{4W\=޿,￞@4￝x\!뿻iHTl(?M.Vɬ?~Ա?o+(?F a?G 2?пP'?fݿ1e%N{;6*?Ŗ/=濐$F?w'lx|}㿗.? ѿ8?58f忀iFu;HGO[?AҖ?H<|0ҏeοO n￣$yZz|)L>wُcos_rz scalar structinputmatrix)#2?2C?aS?uhT?H^I2^?@?9v@?[**;?x*??ѝ?/?/?e?lpO>Z><>=M>v>>ML>>@>>0>V>K&~>L>?͙>zrt^6>EE~>rTUX>Ѻc:>>Wy>g^>>$>٨hu>;ff>Te%?pj?"7?=?̉p?sDn?g2u?C,=|?$51?9p?7i?'y?M0q{?TDd?m?ϛڥl?E)?<?pOz?Ѽvp??b?wRt ?*(w ?W{ ?YN!?ץ!?ve!?^w!?2M!?J4Y!?zx!?MW=ChdgaL@$},cba\ԜnejQކLcW |i@F&nhEg+9w_L[Ei8ϱ'xx=_G l% _C4+k& @9qXD xof0{YC<>WLQdʙ_7su,ٜqZBV+xI`3`1l^H+wgǑ96yeG+/&Pa7Abun$f ]5*/ 5S8$bgN0g N,Gn BeCdіBaZ63U'JGf>`sKV@Z1} K'QBOyÏ_Jeǖ h{⍑=FV y^86d^@"kxՂYPݵV@|lyBMoPli0a헫N2v +܂8K/k2E6&goyKSD'H$bFE=wP[ǞnIw/cʫlLHk~ՃJ[sf [}~ݴ,n܎#_)+i+ BdpH,x}"w³uQ/M4~r_gO7j.s#KZ@$_OlIG nmoۄ@֦ySfy_aI팀$Þg(:M1W4n e!ww \B UʑVfM_jzgB>\'J9Tb)B|#MRZTO*e!$_+Wú6p uU _TB_.'Dx] d|"`X_ 9dl|+w^`|OjgTu__/|! V/XT'/w׷~4Lc+Kj`ꨅ7F̋5A*0b?q/P4ab[T!XvZEr,ʶS\1fp2\z g| c{4{HISozߓSECİoSR eIA-46J}i4,X!+&CSfs0#J4Y0P̈ +,rn BzO"]i#5d6PjKYW27ziN3Vve#xsjLȞϑShb0WOh9H Mti~6vuGVKmR)|O5I!R PADHkk[r)Ǜ5Xl!%wXKJݨd7h甙_,} BdiǤ>CA/q!s[|qn "3礠eDA7kb? fCRoc}|tϒB=OKmk6=N,.H [j,@" ^Vvw|e89/|2ܜvZlNfXsz  _a'w A+[S6Lvxgxz(Ioy[9N{E~qZMɢ!FbEP\^caf;6GEgpo/ONPg ڋynt_;dy,sE4:O@`[lP Y zO >nzQAIh\v%vYIit85DʤYjgF!ltӫw٬6Ao/OybJu͙_vQoMchmϺM7XBl y;DzF7cT[ 'ݧa U4C[ae0l#yj)B)Xd 3&m$ pbjtEn]4K~=PMO n9/gjIe(uCA?>ǿM[>?>a[^>f${>bs>^Ayz>W9>Y(Zp>ߣ>`ݭ>契U>Ln>L#WԌ>01ge>.1|=,i>;.?PV?d蝪?SyR?=ץ=?,"~qp?s?Ȯ0z?Frm??U￶G4OlG6+Vl)ЈiyjQ)@?)A {пߛީp?1u;z;܄㿪^3?~vtqyt+T`gۿ&5?}JE? 9ҿ6Fs?Wy|V?PHۿT?ɱ-?iX08:f׿P7&?ȱ?9W$61?^HC6b?}Iy_H?н??La"B?c?Fh?I[:ݿ#%+?w^F?H0%)u?Ӵ-ؿAqkAhή `?:8Т?F~k?_!Ϣȿ? Hڻ]u?u.?PϰKt޿QH?IX鿒Ȱ?'a~ɿ/:n+ WԚ]j lC?BS?͑AU˱ZI*{d?DHK9^uxO?jc"$3ᡕ꿓; ?}W@-?Ydۈ>ZCC?$ Uk?{9g? Q?$΢?kf?rh_$ѤIe?3wnżڿs7G1 ?I_uL?A)a&V}S6׿CTRڿV)p%JD?nDٿ!47k ?+U}}j?b>?{ 1?YN?A￥ c+?DT ￁}69?uyiI4b?+p6?P-EL7?^:?~P?']c1?3C=]?.?.'c=?=!o,`߿< ^?Ga?P-( ? ?fWh1?guBx?FEa?EҨ(d0?qZ?lz?ōnٖ?x^L￧̭ɗk?AdX ?!˘?!6տ Maܿ C?Nf ~TNܿPd?}Թ?֢RLbʿ~>I?gO\KZDFwڿ)ZͿJ&7q_Ko?\m\?Ȃ41?ڿ?ɨc>9㿗 k{iBX?4\?<.[?HoӰl?`Ar?q@JHVֿ$ҿԿYpV|ٿQGިPBظ?;?}gB?ۿ;Kf翇xa?ߚ̝￸?!=Z鿹kv??(O'z/Vyp*7h,H?c?Zǡ?+9?uڻX˿:S>9_M?GKiA0ڿ5?뎩?ⱇgɿg6ȼz%!1O.Bt?63E&@vO˿zxsbM濴.qԿuJY<[? ATu.c <ￓyjڿRQp'f.%忓?ob꿉Vq})濞)Ώ6 2dT ?qx4C9Uk5zY`8RFпed9`v?0a+1?F[?_?w`0\tסi?C{4W\=޿,￞@4￝x\!뿻iGTl(?M.Vɬ?~Ա?o+(?F a?G 2>пP'?fݿ1e%N{;6*?Ŗ/=濏$F?w'lx|}㿖.? ѿ8?58f忀iFu;HGO[?AҖ?H<|0ҏeοO n￣$yZz|)L>wُcosh_rd scalar structinputmatrix@@@~3@}3@~3}3SJ)R@A,́n3?龍o ڿt1k/R=!fdIU:'z?-z8㥨If?,Edh?B׋"ds:.ֿRdBPW?0 p?%,X`窧eep?ܣʜ?H%A+U,'z@siN?5\@jr }!T*f@+2@F/KH=a?( g?ȿњ?u:L69bGpz5?o hU?'T@i#s?E*0"@ϴtu|_ej2FLD2Jk=]?0r޷My?O^H?8?NA ;uXۀCIjLjx $@?bx?n B !'@ms[t]@ϐ:Y}?m.K@4` )Sc4Ɏ5d$q`rtH]|)Ń@͂? rYȇLZ@T k@.+,pH3BTX0?`g<}H>@e7D8s@1Bd?̰$b-H@"*!osg>4|ڳf@k*. ?bCi?"t>EEOOοv -p?6@ q?>$i@{[ſ$@Ӷi@M o V4`uLOg ܿva?WjV>m@o?{?ɉ{޿S.1ae? ,?^J?35?uG(Z VB`9^@@6ܿϹimrMV̎?^ 9俹Iv̹[?߄C(ɿGVD?NEJF4cUԟ]58&b]]ڲA`_@4YP1Mj8'?xs;h8_Ҳc@Ҩltu?269@ 7Cc @8ͷf?+0ћ[@"=AIyu[\bjU8Ex]*lB(kAv`j-Cm@8ob@N'? wL7 䆿fe,Q?d&T%m @g9% ?GA 󏃿3οm@k)8@L &D_K8gYcǿÿ0s?xV F{W!?y> @T()FA"gd@е?ۘ L?т0Q/l?!O0+p?ȭʬX?JS@avk`:?UI?BBw|H"Rg5?ӱ̜|"A:><ȺPWI;?¿Q/*SoiU Z@^3@#IN|)@&@B-XKj~E?#=â?ТMe@%`SR?oK[۝@7y @on@%IK?SkҢ?6_*~@Ŕg?PT`.??:؟$9֙-7r} ?k[2?炓TI@iSIh?mQ/sSҿe<,\ >@>aSe#j@/c7(>۞oǩвzNz@)qu@{*;@Ƴ9(@( @SnĚ7V?K @Ix{ `f6'lI&+@oa#W?5%7m|Zg@?F?XU3 4!@exH^(@ ^/T8b?!KI5HԽB@CD @qؐѬ'm$տF0U3Kѳ3ek]27~+?ʁ04ˎ]@fm{sEzt?N xs'?@V#BE!2NIM'bh3wLkrcy>aWlDiϟ:,G@6\WW?>c6 Ʉ4c?9gNP-ҀLi"OJe~c6'?' 8@ y;γ!LIP"-_QJ^?yT?7Њ@?A<obya#^?^_?L:%?RLN@@Uaӟ[ _B@3xi?<{gH@6u+y@ڏ??C?K#: x)N2 |m]}~?EB?daan1@{lUe=rݮ@ ī?g?M^_|?J9?![Cp?5L?{m8@/n&:?=;?{D7 ?ċ!Mu? Pb>n?Wz%_@.qL(N?O}@? A UqLAF9??yn?*:M?.Y1>ݰ?M~jB).h0C/@?vR?uT2&S@Eԡx?G #YENQy@q?Qq@&/-k?4 @֭?JOG)@2"E AWl/-Ce1@/i@FYq}@Y lI4u?4Л?u-?z!@2-D'f}hVX? \]8@>T?0لCn]m>??t ?z+A?$80?Du!ES\?7n_@[#G' @h<,ZPB~! pR)8N?6,ep@+W ?_ w|@蘻@v.vJ#]:YE@l!?omdD#4?bs ?pNx&E@ۤ1?**JSgx. ,@A{T2[I9n XS6`XGVd?@< 5VPn̶9@T??A?msS?ohB?K&gTzV2@lK?n/?O(rQkB*zC'T6?o 3D?&ax\  ?qԘ0?=m?58?GO[3@u_@LrKr@ۖN`!@|P?i4?Q?Yױ?3.?ds@4?߃'F @)L?;%8[?ddqhrj'Qe쵝?+?+8Bi-E+n~ ?Mb(??BŤG:l毁FIӞAoƊhj6@3ћQ@`xɠ)?iW,,?8$ qD s#"?Y>+5?=??'@ɣB_׋ԹRP2mbSʾB:f1?9Cfy ^?j]B ָ:@Ye @JY?|w4@߃S?RSA?9,?GX?6Wn0Pm^?=y@ޠ j@p@ۖ?FZi?E臡{cDXcX@CJWP)@[(?UF @~XTB8/?ݧ ?']F QUB%t1Q@FMW3 ?Е*?gT4Do&&@q45 6@jE!8?S1έ?@ED-ʅ7J@`_"DRL?m^b?^H =D4-GW?^?yWIgEB[?U} ?aJXY?%$Td>MBI@=Y@"))Bray?r,mJ? tbhB+W?H7?#[S?6 ?]?^X?V<?PW(@7KwBZv}?dF? @8D{B?uC ?39@ 1U >@}r?,iv?ͧv?7$?דPb?\ ke2@/~dTAE΁& Aun`@@jM)&EX@)?EVDD6U5?VH(@{-?}U<@OI?,pqdDl?m={@bP?l1?:@x;BbiQ,?\a6pK@T?S3hZlBp ͪ@d?؛[?,< !AnzAF,`m?CÈv?-`JN?, Y,sftp3 ?ppb%7 kV"@,b@WS-H?r14D.,w@SH @0VpET6]?zpLOgC8g: D+`[?qM?NX?n&7At© @oLMk'?]I] B.DxTb?e?Ӌ%? W?`"ނ?m?ErK?O??w,bESDaY@y@M7@0C\nT?tWED4P@YX?N&R@?U ?=6'?\#F{ E!g9@4P/?[_?O)eUE4F@f'D?@?\eA/O)?rkY?ʑ@9?<-?5)~; @~_ͪ&@ff< Z 4'd@\+pB`o?(S/@*F, ?e!hdK?kwENs1%DȭK?cosh_rn scalar structinputmatrix%@@@~3@}3@~3}3uTo@K?~֖.:?wNn?(>:CEIp> S>B^b?zl? {? >p>̾I>;&e$>tJؠ>M=>XE>k+)>Ў>f~p>bnv>Tr>7cTx>g>3orj>YaD+l>NOn>{!=?Y?zS ?l?rqwXۭ?:eR\?():4? xM@2!fꟿPZ?du?+,YjLx?SYͿlBcQa?,0:ET?!##)V3>P@KXX{f\DI ?7<֜s,lq?唥 _$E* dbN>oϿirۗڿ_?N>@|I?̥rcc?Yd@_zQ?F|XDVǿiU)@7_.Lv k?=f o@0\g#԰s@Wꥇ+2?oAh/$ɿ3ּC@7Av j㶈qm~ThB@w&D%NB\p>p?f t?[()f?ՒI?GQfHVIk?C*V?%uy}/@A0@kHtD"tC n^?G&@ƂYBUkJaP+U!N?d|ܖb}n]?^?VkU?莿/dp۟B7nZ!>o?V$ƮHAMmR@e"?eZn? QuuUǏ?ZofB~cQ"q?6s/? ^7ڗct@'^ ⿵jv[ˎ5U3J I? ۴Q@xZy\ Sm q?`b@L@Fom?ңv6Of?x!j09RVMomGxeѡ9nmD+ٰ˿ [}_wu?.It@1a|@ƥ\@rQWR0h~!@%S@vz iYMZ[aBW6^z@ e5cGĤhE?%ek?%RZ@s!67@ ?7pǶw@D[/'gk(|@:٣n@Y=ſrhl?ŭ&YA_5 b@6ch;d7Bs?v~Zh?\mS\?мѿs\:@ ܯ.?f%u@VX?-@ yp`}?y@${#TkĿoX2⸿[+ +Ttˈ\p?l=Ү?&phz)@&FU7?9[ R? 4J?@3X0;#I%_?s(@q~Ta@Fǜ{@m_W?w'i ӆ?OϭL?܇V 9[꫑@Gό>;ZiHT@6"hF+!|E7ؽB{N2@T)@_V]?--F/'lǿ]?V'2xUMUqRb@<̎?w.ߟ^UM0ls,l6n@"W2\Q@?`c邹??yz @ 4`AQ?ηBǔ_@A-=6 `?NE?m?ԇ /}@3Ucuyl 7@6 z9vPi" ;?]?&]DtuFK@:Fl>`npޝJo]1zAMTq#[H gZ ԁ@A9AJU4s?PU?+H7@!`@ϥ?47?[JeO,";jb|6L@-s}T[\\¿ =(  #@ZIofd@'}?2-7f׿<?Z 4v?2p$.^@@JGm ,@܈ R}LX*?*Z7MX@^p:?r}.ĿE cvsq?mI@SRmXHn fOMBz@mQXw3?xf?!6@q)Oޜǿw s?b0׿c?Pr{$$f@\;QeP"u߿z:jA·?5W:?LPGT*5^OE@y"?Ђ~~?LXN r?Q:PiNii! @hY0W?l]J*@Iܳg>#Mp@iV8?D~DQ\[!9j!0{jΜ prn;7?1a?Y.޻Vg?*'_o ^ \s2r]y?tb%ztyIF?{"r@*vt}!@3[2&Fv$u@u̿vvF@g ,vHh ]e[ ?wܦ\~=v1r5?#c@ݔ#f_]P~m%Rd@6@<3O{S8 -?x˰E?/Ė~0U@|K.#?8bL@{U@l`N0$@Ȍu@ ?$[yn嗞33@h@@dG:L:9 F?'d?yknCQ0?t9?sd$>N~ 5/M@[ \ {@fz?b^? 08?]N^W?n!ܿ(ʂ@ DS-Ϳ?Ms,k@jqrI}3 h '8d&!dZ?;Ý?outputmatrix%????;;3E_?a ?˛J?K?*?I?H?By b?jN?????7????"??? ??????<g?o*?bM?~ol? J{ ?8?m[5?e?j>?c?7{??8=@$c@r)jO05@KxPAiARA1/=BEtEAͶ B/cDwE *pS0FI*{]L.'BeYlm+01\gGV?oYtte"@ ?nϮ?!6?rREI@^ `[?Pb$?E[; ?̭s?B R??|r?n[\"8@j;'| k~@w8'??~A/:E0+?H}5@ bwA1]P@r|ID@7.5@Ȭ} ?d@?F)@Vph wCnKh?h.?Pg ?ߓ?n?8?PkY:?iP7E;X?0dh?a/O4?<:?IO*9G#?3(l?,I@z ~?!k?|V&PAYwrE d?@җ@ ?ͺ?s'?-HOH?O?ј)|?L7m?A O?iZ3B>C?Q ?5EñbNh.?T~CD?} )A{ ?@?zjCV[G@rO`G\ʨE?ꃨ>?/a 4Q3"O?WnCSS5y*d @:q"@[D ?1]?@}e?/ ?sV?H'Z[?Z C?~?(D?WQEG_ hOA]qeAJ7&?aC0?g9uL@hSG WLg!A!72C?aQxT?B%?\?Ȋ?Fnw?r3nNn" Y:COQ@}@?ECD @b 9F+(9?,=?ұ 6^V1O?8:C^&Y?[?2?5 @,W졅]Wi?x-?Et?A}?*Q?d@9FLBpk?C ?"6= ?[,'nQ@ n?x4K4\@l+{S@Xl<4?,q]?il]?R\l?zVoZ AOvoQ?CM?2?y$?Vs??O &wڣm-`LC(F%h2F9%@cIk?["A?'a{ ?DxB?f H`d?]+J0su5SBLp0GҮA !}A=KLEA_IYTAhB$@X ODw?e4I? ?ӜM||?Ϝ{?Q!@?15<΃@N eU D7@F"FD6?SS ?ME&@} ?`?̹?.lj|K~??^?}jsZ! @jZ[PBxx\q0BJ@A?$eD?}܎Dk|x:B\0 @ ,?-]PV|E y@eЯR%E`?? i^CDƝ\? RsR?@W-iJfY#lb`m?_ג\H@@"|QP| ?Xur-N;dAJ/?]?uk?[th3GG?W DP+&\GKs@S^gf7?<-G/UEB5S@gIR@,s{LD;a0?i'? $?[~+@{8ZA?l M?!.@"(@=`@zEf);1@; ?[L?`蘭@뱱 ?3ӑ?i 2v_gvV*p?p8 ?˂yw?l_vB@O*A('+@ cB E?I6?sII:p\<LEx ;^Dc g?Muv9*3@qZ ?".?"JVN ?Hf@8\w@O\|up@PY? 1?ɂw?? ?z|A>܍B>AGl;? fOj?B:PYŅ;?ꊱ?'@e?vUHG} .CjƮ?PC@NaT#SD=P$@Ժ A]?XupNnBgҲ^@c{qDӚ0ħBfy@P9Q?j??Σƈ?JQTC<0JgcT6!A)!?k?6/WT:?@LW5t?? qeM@&1?H-??퀡#?*\So?iaM ?̤?ZA, @kA?)!`?`?0ܢ ? SV?9@2E)O~={B'wKCpPrx?袬-GZ; @cAZ?d#?lDg?/U?M??$FBy5N@~I!x?=4o?cosh_ru scalar structinputmatrix@@@~3@}3@~3}3SJ)R@A,́n3?龍o ڿt1k/R=!fdIU:'z?-z8㥨If?,Edh?B׋"ds:.ֿRdBPW?0 p?%,X`窧eep?ܣʜ?H%A+U,'z@siN?5\@jr }!T*f@+2@F/KH=a?( g?ȿњ?u:L69bGpz5?o hU?'T@i#s?E*0"@ϴtu|_ej2FLD2Jk=]?0r޷My?O^H?8?NA ;uXۀCIjLjx $@?bx?n B !'@ms[t]@ϐ:Y}?m.K@4` )Sc4Ɏ5d$q`rtH]|)Ń@͂? rYȇLZ@T k@.+,pH3BTX0?`g<}H>@e7D8s@1Bd?̰$b-H@"*!osg>4|ڳf@k*. ?bCi?"t>EEOOοv -p?6@ q?>$i@{[ſ$@Ӷi@M o V4`uLOg ܿva?WjV>m@o?{?ɉ{޿S.1ae? ,?^J?35?uG(Z VB`9^@@6ܿϹimrMV̎?^ 9俹Iv̹[?߄C(ɿGVD?NEJF4cUԟ]58&b]]ڲA`_@4YP1Mj8'?xs;h8_Ҳc@Ҩltu?269@ 7Cc @8ͷf?+0ћ[@"=AIyu[\bjU8Ex]*lB(kAv`j-Cm@8ob@N'? wL7 䆿fe,Q?d&T%m @g9% ?GA 󏃿3οm@k)8@L &D_K8gYcǿÿ0s?xV F{W!?y> @T()FA"gd@е?ۘ L?т0Q/l?!O0+p?ȭʬX?JS@avk`:?UI?BBw|H"Rg5?ӱ̜|"A:><ȺPWI;?¿Q/*SoiU Z@^3@#IN|)@&@B-XKj~E?#=â?ТMe@%`SR?oK[۝@7y @on@%IK?SkҢ?6_*~@Ŕg?PT`.??:؟$9֙-7r} ?k[2?炓TI@iSIh?mQ/sSҿe<,\ >@>aSe#j@/c7(>۞oǩвzNz@)qu@{*;@Ƴ9(@( @SnĚ7V?K @Ix{ `f6'lI&+@oa#W?5%7m|Zg@?F?XU3 4!@exH^(@ ^/T8b?!KI5HԽB@CD @qؐѬ'm$տF0U3Kѳ3ek]27~+?ʁ04ˎ]@fm{sEzt?N xs'?@V#BE!2NIM'bh3wLkrcy>aWlDiϟ:,G@6\WW?>c6 Ʉ4c?9gNP-ҀLi"OJe~c6'?' 8@ y;γ!LIP"-_QJ^?yT?7Њ@?A<obya#^?^_?L:%?RLN@@Uaӟ[ _B@3xi?<{gH@6u+y@ڏ??C?K#: x)N2 |m^}~?EB?eaan1@{lUe>rݮ@ ī?g?N^_|?K9?"[Cp?5L?{m8@0n&:?=;?|D7 ?ŋ!Mu? Pb?n?Wz%_@/qL(N?P}@? A UqLAF9?@yn?+:M?/Y1>ݰ?N~jB).h0C/@?vR?vT2&S@Fԡx?G #YENQy@r?Qq@'/-k?4 @֭?JOG)@2"E AWl/-Ce1@0i@FYq}@Y lI4u?5Л?u-?z!@2-D(f}hVX? \]8@?T?1لCo]m???t ?z+A?%80?Eu!ES\?8n_@\#G' @i<,ZPB ~! pS)8N?7,ep@+W ?_ w|@阻@v.vJ$]:YE@m!?omdD#4?bs ?pNy&E@ܤ1?**JSgx/ ,@B{T2[I:n XS6`XGVd?#3?UER?$?X&'$zO}Óo:@XLw,;\J +5QK8r/ Eӌ ?.~5:B 0@al?Ή; ?$B@< 5VPn̶9@T??A?msS?phB?L&gTzV2@mK?o/?O(rQkB*zC'T6?p 3D?&ax\  ?rԘ0?>m?58?HO[3@u_@MrKr@ۖNa!@}P?i4?R?Yױ?3.?ds@4?'F @)L?;%8[?ddqh rj'Qf쵝?+?+8Bi-E,n~ ?Mb(??BŤG;l毁FIӞApƊhj6@3ћQ@axɠ)?jW,,?8$ qD s#"?Z>+5?=??'@ɣB_׋ԹRQ2mbSʾB:f1?:Cfz ^?j]B ָ:@Ze @KY?}w4@S?SSA@9,?GX?6Wn0Pm^?>y@ߠ j@ p@ܖ?GZi?F臡{cDYcX@CJWQ)@[(?VF @~XTB8/?ݧ ?(]F QUB%t1Q@GMW3 ?ѕ*?hT4Dp&&@q45 6@jE!8?T1έ?@ED-ʅ7J@`_"DRL?m^b?_H =D4-GX?^?yWIgEB[?U} ?aJXY?&$Td>MBI@=Y@#))Bsay?s,mJ? tbhB,W?H7?#[S?7 ?^?_X?W<?PW(@7KwB[v}?eF? @8D{B?uC ?39@1U >@~r?,iv?ͧv?7$?דPb?] ke2@0~dTAEρ& Avn`@@kM)&EX@)?FVDD6U5?WH(@|-?}U<@OI?,pqdDl?n={@cP?m1?:@x;BbjQ,?\a6pK@T?S3hZmBp ͪ@e?ٛ[?-< !AnzAF,`m?CÈv?-`JO?- Y,sftp3 ?ppb&7 kV"@,b@WS-H?s14D.,w@SH @1VpEU6]?{pLOgC8g: D,`[?qM?NX?o&7At© @oLMl'?^I] B.DxTb?e?Ӌ%? W?`"ނ?m?ErK?P??w,bESDaY@z@N7@0C]nT?uWED4P@YX?N&R@?U ?>6'?]#F{ E!g9@4P/?\_?O)eUF4F@f'D?A?\eA/O)?skY?ʑ@9?=-?6)~; @_ͪ&@gf< Z 4'd@\+pBao?(S/@+F, ?f!hdK?kwEOs1%DɭK?cosh_rz scalar structinputmatrix6@@@~3@}3@~3}3SJ)R@߆G7?_1`?vj"R?CiA?9ŽD? r}3?59#?M[#?:Ӽ#?um_)?Q9:*?QV?-坦?4$ЕS?c&p ?dMh>TF4z>檳ιS>5>>Y>p>>^>>k>O>h&s?ۋm{?>u>}ј>ێ2_>qv\>v=> 6?> H>z9B.Ȅ>Ļ>Ef˩>/_eet> H|>R[:XLi>eeF?#}?7l,^0?N\?=?ē?L8D?oa?/>?ixᶁ?h4+y?p6?EoBWr?dq`?bl?@S'qK7@*@p2>@hG%II@oN@4^g@S4Do@gLhr@j^r@ !|b2u@Sr|@?:A@ @A,́n3?龍o ڿt1k/R=!fdIU:'z?-z8㥨If?,Edh?B׋"ds:.ֿRdBPW?0 p?%,X`窧eep?ܣʜ?H%A+U,'z@siN?5\@jr }!T*f@+2@F/KH=a?( g?ȿњ?u:L69bGpz5?o hU?'T@i#s?E*0"@ϴtu|_ej2FLD2Jk=]?0r޷My?O^H?8?NA ;uXۀCIjLjx $@?bx?n B !'@ms[t]@ϐ:Y}?m.K@4` )Sc4Ɏ5d$q`rtH]|)Ń@͂? rYȇLZ@T k@.+,pH3BTX0?`g<}H>@e7D8s@1Bd?̰$b-H@"*!osg>4|ڳf@k*. ?bCi?"t>EEOOοv -p?6@ q?>$i@{[ſ$@Ӷi@M o V4`uLOg ܿva?WjV>m@o?{?ɉ{޿S.1ae? ,?^J?35?uG(Z VB`9^@@6ܿϹimrMV̎?^ 9俹Iv̹[?߄C(ɿGVD?NEJF4cUԟ]58&b]]ڲA`_@4YP1Mj8'?xs;h8_Ҳc@Ҩltu?269@ 7Cc @8ͷf?+0ћ[@"=AIyu[\bjU8Ex]*lB(kAv`j-Cm@8ob@N'? wL7 䆿fe,Q?d&T%m @g9% ?GA 󏃿3οm@k)8@L &D_K8gYcǿÿ0s?xV F{W!?y> @T()FA"gd@е?ۘ L?т0Q/l?!O0+p?ȭʬX?JS@avk`:?UI?BBw|H"Rg5?ӱ̜|"A:><ȺPWI;?¿Q/*SoiU Z@^3@#IN|)@&@B-XKj~E?#=â?ТMe@%`SR?oK[۝@7y @on@%IK?SkҢ?6_*~@Ŕg?PT`.??:؟$9֙-7r} ?k[2?炓TI@iSIh?mQ/sSҿe<,\ >@>aSe#j@/c7(>۞oǩвzNz@)qu@{*;@Ƴ9(@( @SnĚ7V?K @Ix{ `f6'lI&+@oa#W?5%7m|Zg@?F?XU3 4!@exH^(@ ^/T8b?!KI5HԽB@CD @qؐѬ'm$տF0U3Kѳ3ek]27~+?ʁ04ˎ]@fm{sEzt?N xs'?@V#BE!2NIM'bh3wLkrcy>aWlDiϟ:,G@6\WW?>c6 Ʉ4c?9gNP-ҀLi"OJe~c6'?' 8@ y;γ!LIP"-_QJ^?yT?7Њ@?A<obya#^?^_?L:%?RLN@@Uaӟ[ _B@3xi?<{gH@6u+y@ڏ??C?K#: x)N2 |m]}~?EB?daan1@{lUe=rݮ@ ī?g?M^_|?J9?![Cp?5L?{m8@/n&:?=;?{D7 ?ċ!Mu? Pb>n?Wz%_@.qL(N?O}@? A UqLAF9??yn?*:M?.Y1>ݰ?M~jB).h0C/@?vR?uT2&S@Eԡx?G #YENQy@q?Qq@&/-k?4 @֭?JOG)@2"E AWl/-Ce1@/i@FYq}@Y lI4u?4Л?u-?z!@2-D'f}hVX? \]8@>T?0لCn]m>??t ?z+A?$80?Du!ES\?7n_@[#G' @h<,ZPB~! pR)8N?6,ep@+W ?_ w|@蘻@v.vJ#]:YE@l!?omdD#4?bs ?pNx&E@ۤ1?**JSgx. ,@A{T2[I9n XS6`XGVd?@< 5VPn̶9@T??A?msS?ohB?K&gTzV2@lK?n/?O(rQkB*zC'T6?o 3D?&ax\  ?qԘ0?=m?58?GO[3@u_@LrKr@ۖN`!@|P?i4?Q?Yױ?3.?ds@4?߃'F @)L?;%8[?ddqhrj'Qe쵝?+?+8Bi-E+n~ ?Mb(??BŤG:l毁FIӞAoƊhj6@3ћQ@`xɠ)?iW,,?8$ qD s#"?Y>+5?=??'@ɣB_׋ԹRP2mbSʾB:f1?9Cfy ^?j]B ָ:@Ye @JY?|w4@߃S?RSA?9,?GX?6Wn0Pm^?=y@ޠ j@p@ۖ?FZi?E臡{cDXcX@CJWP)@[(?UF @~XTB8/?ݧ ?']F QUB%t1Q@FMW3 ?Е*?gT4Do&&@q45 6@jE!8?S1έ?@ED-ʅ7J@`_"DRL?m^b?^H =D4-GW?^?yWIgEB[?U} ?aJXY?%$Td>MBI@=Y@"))Bray?r,mJ? tbhB+W?H7?#[S?6 ?]?^X?V<?PW(@7KwBZv}?dF? @8D{B?uC ?39@ 1U >@}r?,iv?ͧv?7$?דPb?\ ke2@/~dTAE΁& Aun`@@jM)&EX@)?EVDD6U5?VH(@{-?}U<@OI?,pqdDl?m={@bP?l1?:@x;BbiQ,?\a6pK@T?S3hZlBp ͪ@d?؛[?,< !AnzAF,`m?CÈv?-`JN?, Y,sftp3 ?ppb%7 kV"@,b@WS-H?r14D.,w@SH @0VpET6]?zpLOgC8g: D+`[?qM?NX?n&7At© @oLMk'?]I] B.DxTb?e?Ӌ%? W?`"ނ?m?ErK?O??w,bESDaY@y@M7@0C\nT?tWED4P@YX?N&R@?U ?=6'?\#F{ E!g9@4P/?[_?O)eUE4F@f'D?@?\eA/O)?rkY?ʑ@9?<-?5)~; @~_ͪ&@ff< Z 4'd@\+pB`o?(S/@*F, ?e!hdK?kwENs1%DȭK?exp_rd scalar structinputmatrix 9B.@9B.@Ҽz+#Ӽz+#qmDCqmDCoutputmatrix ????*{{exp_rn scalar structinputmatrix9B.@9B.@Q0-IR0-IҼz+#Ӽz+#k%?E\ ?Nk?587?ZB7?{Zz?ce@; &@״7>&@Kqǖ'@Ng3/;J@K O@ḰQ@Y*IWt@[mky@@.&1߿_=Ͽ͇ÿټ ``%`&01;<DPLY_eppuޫ}?Ztz:?k%?E\ ?<?.mI?T`+?w?3v? ԅ"?:?θ?:L迓bC3" [+$ɯ[ OM0Z @ ]آ"#Ú @Pվ@0@[C]3#@a$)@ z#@.33~*Uy 91?@`Mr:@\.MF@P9C@[em@4a@ Rn@E Me@Yxcn@@Mq}oP}@ vx.rL'")|@_rh}@v}@ P>Bu@2Ԉ1yXBtRWT?^?u ?& J=??%?lF!oC /1]"?(Gu4-S^o2?c#:?Ec/\CX N3~ DM&)H??amzHÿ'XɿYuKϿ8ʿŻĿsĤտ#;Z;MV??ZMɌ0ׁ@~$ , @8RWw@Mp0@߁.@! g!@_*@yiϥ+O!@()ڴ?@CDNK<0Dz6@HP]W>@kas9@T{25>pQ.>@;iF@A@BE(aMόaڛMsA_FLֺC@5rt7:coA?>1Bz^zSG?ywN?CHIGP&tP$ \?aU=@Vn7Y?" lW?RQ@t}?aŷa?Qn.g}o?zu?~}[|:p]1騮p?YJ z tq?__?xY? N?נ/?I8~?%BOaK ?- ?X[?zl)z-ߨnᎸ?붲/*޸?4C`[37@.1FJɿP?Y.`7?rΘ=?͈60ӿd6+?R?/$'?raE?Ƥ0?ǽ?( B% @Rr @@5$@s"V@8 @rSx| @];j@a[@Xn@h @HԸ-e )Mo&Rc;] @ьH(@أv"@ Ę!yOES$@2@?8@u~01}8X6E؛K3@*s8JIՓ sBZmG@7BBuHEucQ_]@Jc=yZ@2CbIFc@6{Jkv*?8?V %+bX d?7)1;?o{>&T: (E+?GIk]/?8i)qa >?IBGE?VP>E ;K?PǗ_ޯiz_]+Lf?Ж m  f? Ao?]V.f9a3u?Dx?)Q2x? K=~p>L))ȿZu?[?Hz࿮Rr?[?+w5bBC?Ad/@ @(: SE.< C(\] @h3"xf@vB+p[X@W~@jB9;*@b=5(@k "YW6@K0<@ټ t;êhE@jWB@_f[HA,@qT@c_=p)P l.P@w뢎k s[P9brr8}Lx@ ?z?扰?8( ?70%K$6H?^#r??iSe4S ?A"?T(?<$(Z9C`"?^vk;?:_?\T?鷫l1?M8?tFz0A(JJmwH?mq\AO?V>eX?W^e;IXQn?m 1f' w?lްf09DjFG?*CT?.ו?فd#jwR?mʮ?Yi梿J~dB\-Me>?Ľ'Y]??& C?M勜? ?S5Kؿ;m?anԿ_0Pտ'?D=7ￊ|R࿕FɬCa?d2v|?vIJ'Pp9q0D4?),|B#)>@0Ho @UH|hň N3(Jm^OS@|S( C0( @{]9.wy! [,@T"=0Z3uS1@ɭ45Z99vCc=3rD:8d@vY[D@fNr$_DE#9#iMꬁ]2bdZziؖb''fz2eoso@A#kl@;Opa}bu@Q|upt[")[M ,?_%c$g tQ ?m*#'Db#5?>yS?X3vӺ?R/LF*n>Zc'?hEU#?fKi"!?>2_1~SrE?~u[S_m «X@<]?TX?*mV?N=N[_.mtlITb?i`9Gj?;euv?b1[zIR&psRed&?aR?M s?Kxmd.*;l,?;*qm?|@j$?$L?f?4cVˬ?=\X䩸@ ?὿꯺fوV<ȯʿMNp9A?r$.?m}J\ ,vp̿U>pĿJi`?t{HۿG? տgCiۿ3NEpܿC Q?Apv濵V- r,wY{ Ӟ?ٮ?_u俋V 8c|Ռo?Hsү 恕"@Ԙkާ@ay: `ĸ% @e@@Me56(@V !эE#'xzK4@ $C9Hq%3@:6@}:@@JC@pq٨=[O@Nܕ(E@n&NNF0Y@uyǤR@"X]@m@U`pYkܐ*f@?r@wyg;k?Ѐ% ?xO(?U!?fz)G>G-KDl;)?G%JP0?\4 2Iɠ)>p\ tZ1WW\DiQ?οT,Mc nhOhrd="}?s΄ĵ6InN\(#$F?x6?1w생?Wq?07$r HdF?r?C|?Nr?r?4t)kی"?'ư?H9?Pd]?͖(?b ]?#97c?4̯)6뿯S_}A?ܫ' 濤8C1rHͦ,鿘5n?jc>swq~O- @%? @{ {@WrtԵ@Js4q@GPU-@MU,Jy%@%w =|+@׸^ 8h<*Y>@5jA7 o>@G0d)10MX@EwJJȓL@_vA(U8xR肦5{Vb m@_v#ÆW_vO8EGr? 66ı.nM&dvO{Oj( ڊe߅׳Yم( ԅfa΅?ܵȅ3 ÅJc]a2ıx|гYU.n=U ڊQ0lxzGEGr~^jMyuasгYmQIhQIb[ A\48EW 0Q(K-[ AFD*@[r:rK=5$/e)48$ίa4;pΈ *?A 0Xܵoxz,QI*(ܵ|ڄ|ԄSt$τ'h"lxɄ>AcÄU[ lSt]KȲ,C~:pW2ġ0* h"l 6$; hRniGrz Actn iū_c܄|г]]KX 7[R!鷯L8鷯GO†WAfU;}t$5MS0&†*~$_vO.ned]K5=ULjMc8EGz=4z,CSt$,C?ۃ Ճσ2~:ʃIjMă`C⾃w6ڊΈޭW2Ӏ&†Yڜ3ı. /a֋F0*]~tpΈzI&u"lxzo:pi h"d_v^WX`vOS,9EGrMC?GZ6Bqı.n<&6vO1Oj+( % ڊeY)( @fa W?ܵn c]2ı|гYU.n܂=Uւ& Ђ=ڊʂTQłklxzEGrjMaгYީQIQI \ A#58E:0Q(톂h[ A*{ruK=p$jed48_ Y S7b4NN;pΈHe?B| 0=ܵ71xz,,QI&* (ݵ|4|KSt$ bh"lxyAc[ St]Kե,C~:pX2܁1*ׁ1 h"lсH6ˁ_Ɓv hnGr Ac鷩 _|г.^KE7[\鷯s鷯†W|Uvt$pMSk&†e~__vOZ+.nTBeNYd]KIp=UCjM=8EG8=2̡4,z,C'St$!-C(?? V m~:jMC6ڊΈW2&†݀%Z׀<3ı.ҀS ̀jaƀ0*~pΈҵI&"lxz:pΤ h""_v9WʓP`vOg9EGr~?Ƃ6}ı.nwÝ&qvOlOjf) `[6ۊeUMYOd( J{faD?ܵ> 9c]32ı-(}гY"V3/nJ=Ua xڊQLJz=,ԚBg2T`:@jq|a2QڃF@xt3U0*maЗzVI.!K,?Ziq4`)Biw@)~~n|a~k ~?W[~JY~&:~TV0*~Q~k ~l ~ H~:D~~hǘs~5@h~\~򙻖Q~ LY8F~Nu:~|e/~b2U0$~D~m4 ~4y $(~b+}Fx}}A}o}H}vX[} g}Ҽ}o4}.!o_}\o_z} On}7>Wc}H.W}L}BN OA}p"5}*}d]F}}(ɘ}V{6>|-Ԛ|q|z6|Di|Q {lzkz1*zǘz$eczRHx zgz>W[z^Fz z6z8&Szfuz'SvzJkz_z>,ԚTzLBIzzg=zT2z:'z@z2kqz`|a2zQy@y3U0*yyFzytJ.!yɵyЮiqy`y,yZBiyw}y)~qy|afyk [y@@W[OynJYDy:9yV0*-yQ"y&k yTm yHyDxރǘx 6@x:xhxLY8xuxex c2U0xND؎x|m4xy $(xx+lxFxax4VxbBJxo?x4xX[(x gxHxvo4x!o_wo_w Ow.8>Ww\H.wwN Ow"w잠wBe]Fwpwɘ~w{6>sw-Ԛgw(q\wVz6QwDiEwJY:wH./w[8#w< $(~wj& wq_w#uv՚v"8vP:mv~svvPevM v6svdgc]v&SvByv}a2Unv0!bvJWvx:MLvF@vu5vD*v0]v^Ov<vsu%(~um4uDc]ur<Mu<,uΠ<,ԸuR|u*x $uX˖uisuQutukiu>2*^ulǘRuecGuHx W[%uR_Fuz6u&Suut (St8Jtft>,ԚtBtgtUtL:tz@tkqt|a2{tQot2@dt`4U0*YtMtzBtJ.!7t+tFiq ttat tBisws,*~sZ|ask s@W[sJYs:s@W0*sn Qsk sm sHvs&DjsTǘ_s6@TsHsޚ=s MY82s:u&shesc2U0sDsm4r z $(rN,r|FxrrBror4rbY[r grro4|r"o_qrHo_frv OZr8>WOrH.Cr8r.O O-r\"!rre]F rqʘqB|6>qp.Ԛqqq̒z6qDi޻q(JYqVH.q[8֙q $(~q&qr_wq<$ulqj֚aq8Uq:mJqs?q"3qPQe(q~M qsqgc]q&Sp6Bpd~a2Up0!pp:MpGpJupxDp]pOp<~p0trp^&(~gpm4\pc]Pp<MEp<,:pD<,.prS|#px $pη pisp?5^ozo\JoMo-opwhoۣp=vo(@O_o/HoV-2ovjآj4+jkfffjϡEjH4$ijVRjS;j\a$jʡEj*ipA`i|?5i(WiԜi/$if(fi;Of@ve2e|?eT(\e_d;ߟe ğ/eh(~reČ[e QEe|Un.eعve4Ve?5^dzdHKdMd-d\xhxdܣp=bdAOKdp/4d V-d(n|dc6cı.[w;pθ[*б.n[ݘ( ^[a0[C*jM[(Z猨Z\z,{ZMcMZh"l Zu Y(UYo]KY8CjYAڊ=Y0*YWXZ[jX $ X ZXsQI-X&~WFpΈW(W?]KwW hJWiKWX2†V 8EGVïVq&†gV$U&:V? VeU=UwxzU@8EWUV f)U ܵTSt$Toc2ġT",ActTGT.nT;,CSNSST h"dS&6Sqa Sm:nR aR[ ARSR9]I&R%[ Q6QR_Q$pQHUCQk?QڈPѢ~PkvOP74 `Pc]3PڊPDݓO@zOҸ Ovc FNjNBNoM\CZMt:J{L7¤L@]%uJLAK oKr9KآhJ>4?JŶb)J W߾Ip\sIy=I< mV}HZӼcH.HPHn5;GP#J{SG:ǺFsCF9CFl=yE'ǺE872EJ7D܏1w}Djm}"Dj+C6X5mC!F%uC3BhD!\B3B4gsA镲LA@fŏ1@̬ q<@? >e/4>6R~=ur<ؗM<( ^;z猨:K 9#ڊ=9E 8hpΈ7K7`&†g615ܵ4G493u\n2FI&2$p1~0ڊ0l .Z"5-X+_*+E(>q'න&g$$BH#ƇԚ!h͊r pl (ElH(r(\  *v99Ԉ9?A9?WPk?Gr=a?ź@9 @ƺr@/H@>@D@@rk @`t!@;o"@#@QE%@UJ &@"(@.$)@oyx&*@3(\,@+ +-@U-2/@Dr0@F!e(1@uӚ1@g2@ӸH3@Bi3@1sg4@`Pki5@-6@ m6@7@o?8@KD8@ziq9@\_:@9s;@;@6u<@e!5=@Fx=@Ëk >@hzV?@ q<@@ď1@@;\@@镲LA@o9sA@ 3B@!\B@=3B@E%uC@qbX5mC@ j+C@?}"D@?1w}D@7D@s72E@ ƺE@h=yE@A9CF@ECF@uǺF@##J{SG@5;G@CHPH@nZӼcH@wlV}H@L=I@\sI@E)߾I@ߗb)J@y?J@uhJ@9K@GRoK@AK@{/%uJL@7¤L@ J{L@I{\CZM@nM@}XN@ǓjN@5 FN@K O@zO@ݓO@^AJ*P@xͪWP@' P@EPkP@:P@U+ Q@,L:Q@yVgQ@^LQ@3٬Q@`jq Q@\mR@؃JR@G -xR@G!R@~cR@.NS@{1-S@$'[S@\DioS@bͪϵS@V/S@-T@I9io=T@pPkT@{T@04T@}uqT@M U@1NU@d):{U@{U@*Z@n):Z@Pk'[@Q٬T[@cZ[@K/[@8uq[@{ \@7\@)6]@䃞]@!Rm*^@n_X^@H^@^@U/^@f _@N@;_@<-h_@ _@C@a_@#{T_@:bs`@w $`@<,.`@&5ME`@m4\`@nlr`@O`@D`@Z?`@ڜ`@va2U`@F&S`@sa@Ie(a@2s?a@ր8Ua@zula@&a@S8֙a@fJYa@ z6a@&Ԛa@R˜a@]]F b@!!b@>8b@0>WOb@o_fb@*h4|b@gb@rb@;b@Fxb@^r $(b@Dc@ec@JEY82c@Hc@|ǘ_c@6Hvc@ڳk c@~O0*c@"JYc@Ɔk c@j"~c@Bic@Yd@V+d@zBd@,U0*Yd@BQod@cqd@:d@.gd@6,Ԛd@vJd@nd@ z6e@b>W[%e@Ax sg@g@R잠g@F Og@H.g@>~ Og@o_g@h@*Q[(h@o?h@rVh@$lh@m4h@^[2U0h@uh@h@J.@h@Dh@e i@6Q"i@ڜ:9i@~8W[Oi@"|afi@o}i@j i@iqi@B.!i@Vi@y@i@|a2j@B@j@L2j@BIj@._j@Svj@v&Sj@WFj@gj@becj@**j@j@Nask@w $,k@<,Bk@:4MYk@m4pk@kk@&Ok@ʢDk@n>k@ڜk@ua2Uk@Z&Sl@s%l@HeWcm@o_zm@>g4m@gm@m@*:m@Fxm@rq $(n@ Dn@e/n@^DY8Fn@\n@{ǘsn@JHn@k n@N0*n@6JYn@څk n@~!~n@"Bio@X)o@j?o@zVo@+U0*mo@VQڃo@bqo@:o@Bgo@5,Ԛo@Jo@m Ǻp@?[)p@hp@%p@DP1p@ qf?s@!1w-Ks@ٓVs@'as@uX5ms@iúxs@;s@ _=s@߬镚s@Cs@H Fs@Us@'j+s@1;Ns@/Ls@͑\s@olVs@AiV}t@ t@^t@R}"t@߾.t@[Af9t@-<߾Dt@Pt@ho[t@%ft@us-!rt@G1w}t@Aψt@\TR't@bt@sתt@aF{/t@3ݓt@?t@/7t@}ŏt@{ft@M?t@g+u@u@Hu@PR''u@g72u@9HP>u@ :yXIu@݇hUu@=yX`u@#ku@Sqwu@%d`u@ Ǻu@Z)u@hu@mu@?DPu@ qu@u@-w-!u@{=yu@Y;Nu@+^)u@do v@ϲbv@ŏ1!v@sN',v@E7v@9Cv@7NёNv@Yv@Aev@_!upv@1o{v@9#Jv@ 3v@XCv@y`TRv@Kdv@B%uv@Zv@镲v@+L v@eybv@7Ǻv@ sw@bjw@7w@&w@QLs1w@#^)|@A%uJ|@yZU|@K镲`|@+L l|@xbw|@Ǻ|@s|@ebj|@77¤|@ |@Ks|@^)|@9#|@Q5#J{|@#Z|@j+|@J{|@l }@k3}@=q!}@VӼ,}@5;8}@ݓC}@?N}@W\CZ}@)۾e}@(!p}@v/L|}@?}@qHP}@C``T}@ q}@n}@Iё\}@3}@]啲 }@/3d}@ZӼ}@μ}@l~@wj~@I~@F%u&~@S51~@ F%=~@lV}H~@c=fS~@51w-_~@ٓj~@&u~@tX5~@}º~@O~@!^=~@镮~@C~@G F~@i~@;j+~@ 1;N~@~/L~@̑\~@lV @UhV}@' @^+@Q}6@߾B@oAfM@A;߾X@d@hoo@$z@r-!@[1w@-AϜ@[TR'@ѩb@s׾@uE{/@Gݓ@?@.7@|ŏ@Q@ڊ@ @n=U@W,n@@S@)zгY"@(@2ı-@c]3@ 9@<ܵ>@caD@( J@qYO@Z؊eU@C[@,& `@Mjf@sOl@皀&q@.nw@6}@?Ƃ@6EGr@t]vO@]Wʓ@F_v@/ h"@:pΤ@ lxz@F&@mΈҵ@~@0*@aƀ@w ̀@`0ı.Ҁ@IW׀@2~&†݀@W2@̈@ڊ@6@@@gM@~:@z @c @L?@5*C@Qt$!@x,C'@4,@=2@8EG8@jM=@:UC@}a]KI@feN@O.nT@8_vOZ@!~_@ $†e@JSk@q$p@ŘUv@W|@淯@ 鷯@i4[@R[K@;|г@$_@ @鷩@Ac@Dr@k@ h@Ɓ@l6ˁ@Uh"lс@>.*ׁ@'U2܁@|:p@,C@]K@St@[ @>c@e"lx@oSt$ @X|@Aڵ|@*(@( @NI&@uz,,@Μ1@ܵ7@ 0=@?B@r8pΈH@[_4N@DS@-Y@48_@ed@!j@H=p@ou@*{@[ A@u(톂@^ 0@G28E@0Y A@QI@QI@ͳY@a@jM@BGr@ixz@xQł@aڊʂ@J Ђ@3=Uւ@,n܂@S@yгY@נ@2ı@c]@ @{<ܵ@dca @M( @6Y@؊e@ @% %@Lj+@sO1@&6@.n<@~6B@g?G@P6EGrM@9]vOS@"WX@ _v^@ h"d@:pi@lxzo@F&u@mΈz@~@j0*@Sa֋@< @%0ı.@Wڜ@}&†@W2@ˈޭ@ڊ@6@@⾃@mgMă@V~:ʃ@?σ@( Ճ@?ۃ@)C@Pt$@w,C@4@=@8EG@pjM@Y:U@Ba]K@+e@.n@_vO@~$@#†*@JS0@q$5@U;@sWA@\淯G@E 鷯L@.4[R@[KX@|г]@騭_c@ i@n@Act@Drz@vk@_ h@H@16@h"l@.*@T2ġ@{:p@,C@]KȲ@St@y[ @b>cÄ@Ke"lxɄ@4St$τ@|Ԅ@ڵ|ڄ@(@'@NI@uz,@@|ܵ@e 0@N?@78pΈ @ _4@ @@48$@e)@!/@H=5@o:@h*@@Q[ AF@:(K@# 0Q@ 28EW@X A\@QIb@ǦQIh@ͳYm@as@jMy@kBGr~@Tixz@=Q@&ڊ@ @=U@+n@R@yгY@@2ı@nc]@W Å@@<ܵȅ@)ca΅@( ԅ@Yم@׊e߅@@% @Lj@sO@q&@Z.n@C6@,? @6EGr@\vO@烧W@Ъ_v#@@fgP({K9Ps߉YJA t H:3P>@0G+=MB:Բ+;^#S)@ 0@NZ1@\%9@x:@zR&5=@ZfA@g\S {F@vF@8ߡPG@# V/ W 0: _/ ͪ Pk  !yG!JgDio!yX!H!}8!0'"5X7"d_"F"1"" ]m"O &#~N#sFv#%䃞# ؁s#:c#i$Ǡ1f$R!$%4$T$io% -%ͪU%H}%?2殥%n䃞%!%H}&\mE&*\m&Y_L&6<&+&uq '( 5'Dڬ\'sJ'>٬''#'/U$(^_L(t(kw(8g(V(IsF)x46<)%d)֘L)K)4)c%*a+*aS*{*x*N*:*}ׁ*uq+@aC+ Pk+9N@+hW/+ +ƻ' ,m2,$ cZ,Sނ,ͪ,6<,٬,w"->MJ-m{r-Pk-cZ-J-)):.Xz):.,eb. .吠.C>.C/ry)/YQ/ y/R/.p/]"u/+e0TA08gDi040H#0wO@0 1ճ{01fX13р1bT1|1.1- 2H2MEiop2|_2N2[B>2 -38}83gr `3$3V33#;3R/'4ͪO4Qkw4 4y4=hDi4lX5H?5~8g50'5(X5W5G61.6V6^m~6B 6q¨6tF6&7؁sF7-cn7\=R7ZB717S!8468G^8vjo8 8Ϊ8H823%9a僞M9!u9I}9\m9\9L`L:{6<=:+e:vq:) :7۬:fJ;?,;T;#|;"V;Q_;;lw<8gD< Vl<YB6ׁBeyǩBZB BR!C!qICP#uqC+eCTC9gDC 4D;#9DjP@aDDȴ{DfD&EUT(E}PE/xE-EE@FioEo_FN@F\B>hF-F+}FZs F%GV/GWG<GE/GtͪGRkG HyGH0iDioH_XHHH8H1'IX7IJ_IyHI1I׬I_mI5 &JdèNJuFvJ'䃞JفsJ cJO>RK~ZB>K1fKT!K 4K:KikoL -LϪULH}L%4殥LT惞L!LJ}M\mEM\mM?aLMn6|):Um.ebU U˒UD>U)VXy)V[QV yVRVrVC$uVr+eWTAW:gDiW4W.#W]Q@W X{0XgXXрXHTXw~X0X- YHY3GiopYb_YNY]B>Y-Z}8ZMt `Z|&ZVZڊZ =Z8/'[gͪO[Skw[ [y[#jDi[RX\H?\8g\2'\X\=\lI]1.]ʭV]_m~]( ]WĨ]vF](^ځsF^cn^B?R^qZB^1^U!_46_-^_\lo_ _Ъ_H_5%`G烞M`v!u`K}`\m`\`2bLaa6<=a+eaxqa* aݬaLJb{A,bTb٥#|bXb7 _bfbnwc 8gDcVlc"sFcQ76c%cL dM4d [d<%dkdӫdaddz#e'-:KeVׁseuqeCaePeN@fAZ/;fp cf'fpf"cf,g[*g9YiׁiKyǩiz\iiR!jsIj6%uqje+ejTj;gDj4k!#9kPR@akk{khk l;T(ljPl1xl-ll&HiolU_mN@m^B>hm-m}m@u mo'nV/n͋Wn=n+/nZͪnTkn o縦yGokDiooEXotHo8o3'pX7p0_p_Jp1pp`mp &qJŨNqywFvq)䃞qہsqcq5@RrdZB>r1frV!r4r rOmos~ -sѪUs܃H}s 6殥s:胞si!sL}t\mEt\mt%cLtT6|}>y)}m]Q}y}R}s})&u}X+e~TA~耆-}83v `b(V쯁ׁ>/'MͪO|Ukw ڹyǂ lDi8XgH?8g4'X#߃RK1.Vam~ =ƨ΄lxF*܁sFcn(ARWZB1慆W! 46^Bnoq ୆ҪՆτH6%-郞M\!uM}\mŇ\퇆dLG6<=v+ezq, ߬܈2JaC,T#|Y _̉L{pw"8gDVlsF796f%䊆L O4["%䃋QfӫaӋ|# /:K<ׁskuqEaÌP댆N@'\/;Vc'r$cڍA*p;Yׁ1yǩ`^ѐR!tI'uqK+ezT=gD鑆4#96T@ae{򰒆jؒ!T(PP3x-ݗȓ Jio;_jN@`B>h-}&w U)V/W?/@ͪϕoVk ͺyGlDio+XZH8疆5'X7_ELt1殗֗bm &0ǨN_yFv+䃞݁sƘcBRJZB>y1fX! 4ޙ5ood! -ӪU…H}7殥 ꃞ͚O!~N}]mEܲ\m eL:6٣$y)S_QyRuɤ(u>+emTA>gDi4#)U@᥆X {0kXрTCЦr4- ИHJiop._]NaB>视-}8x `H*wV쯨ר@/'3ͪObWkw yǩmDi渚 XMH?|8g6'X ߪ8Mg1.Vcm~ #ȨΫRzF,ށsFߐcnCR=ZBl1欆Y! 46^(poW" ୭ԪխH8%냞MB!uqO}]mŮϳ\eL-6<=\+e|q. ܯJGE,vT#|[_̰2arw$8gDVlsF;6L%䱆{L Q4[%䃲7hӫfaӲ~#0:K"ׁsQuqGaóP볆ޫN@ ^/;<ck't&cڴ'*V=YׁyǩF`ѷuR!vI)uq1+e`T?gD鸆4#9V@aKz{򰹆lعT(6Pe5x-ÙȺKio!_PN@bB>h-} y ໆ;+jV/WA/&ͪϼUXk yGnDio!X@Ho8罆7'X7_+NZ2殾־dm &ɨNE{Fvt-䃞߁sƿґcDR0ZB>_1fZ! 4qoJ# -yժUH}9殥샞5!dP}†]mE†´\m†fL† 6<†O+†~}q Æ/ 5Æ\Æ JÆ:F٬ÆiÆ#Æ\$Ć_LĆ%tĆTswĆ%8gĆVĆsFņ<6<ņ?%dņnLņRņņ%Ɔ*i+ƆYaSƆ{ƆƆ1:ƆׁƆDuqdžsHaCdžPkdžѬN@dž_/dž/dž^' Ȇu2Ȇ'cZȆނȆͪȆI><Ȇx٬Ȇw"ɆTJɆ{rɆ4PkɆckZɆJɆ):ʆ):ʆ4ebʆN ʆ}ʆJ>ʆˆ y)ˆ9aQˆhyˆRˆwˆ)uˆ$+ĕSTĂ@gDĭ4̆ढ#̆W@̆>  ͆m{0͆mX͆р͆T͆)͆X6͆- ΆHΆLiopΆ_ΆCNΆrcB>Ά-φ}8φy `φ.,φ]VφφBφ/'ІͪOІHYkwІw ІyІoDiІ"Xц3H?цb8gц8'цXццO҆M2.҆|V҆em~҆ ҆ ʨ҆8|F҆g.ӆsFӆŒcnӆDRӆ#ZBӆR1ӆ[!Ԇ 46Ԇ߿^ԆroԆ=$ Ԇl֪ԆHԆ:%Ն샞MՆ(!uՆWQ}Ն]mՆ\ՆgLֆ6<=ֆB+eֆq~qֆ0 ֆֆJ׆-G,׆\T׆#|׆]׆_׆׆Gtw؆v&8gD؆Vl؆ԊsF؆=6؆2%؆aL نS4ن[ن%نjӫنLaن{ن#چ2:Kچׁsچ7uqچfIaچPچĭN@ۆ_/;ۆ"cۆQ'ۆvۆ(cۆ܆ *܆Yކׁކyǩކ,bކ[ކR!߆xI߆*uq߆+e߆FT߆uAgD߆4ӥ#9X@a1 `{n T(PK7xz-Mio_6N@edB>h-}z !-PV/WC/ ͪ;Zkj yGpDio"X&HU89'X7_P@2ofm &ʨN+}FvZ/䃞scERZB>E1ft\!4so0% -_תUH};殥탞!JR}y]mE\mhL6<5+dq 1 5\J H٬O~#^$_L t:uwi'8gVNjsF=6<%%dTLT%k+?aSn{3:ׁ*uqYJaCPkN@`/D' sw2)cZނͪ/@<^٬w"VJ{rPkImZxJ):փ):6eb4 cL>y)cQNy}Ry+u +e9TAhBgDi4Ʀ#X@$  S{0oX!рT>8m- HNiop_)NXeB>-}8{ `.CVrD/'ͪO.[kw] yqDi#XH?H8gw:'X՞Q32.bVgm~ ˨~FM0|sFcnFR ZB81g]!46^so#& RتH<%M!u=S}l]m\iL6<=(+eWq2 JI,BTq#|__-vw\(8gDVlsF>6%GL vU4[Թ%lӫ2aa#4:KׁsuqLKa{PN@a/;c7'fx*c*"AYׁyǩdApR!zI,uq+e,T[CgD4#9Y@a F{up"T(P19x`-Oio_ N@ KfB>h z- } | / 6V/ eW E / ͪ !\k P  yG rDio $X H ;8 j;' X7 ȟ_ Q &2 U hm  & ̨N Fv @1䃞 os c GRZB>+1fZ^!4to' -E٪UtH}=殥!0T}_]mE\mjL6<+Jq y3 5\חJJ٬5d#`$_Lt wwO)8g~VsF?6< %d:LiVǺ%l+%aST{5:ׁuq?LaCnPkN@b/*' Yy2+cZނ揞ͪB<D٬sw"XJ {rPk/oZ^!J):):7eb IxN>ֲy)eQ4ycR{-u+eTANDgDi}4#Z@  9{0hqX#рT$:S- HPiop_N>gB>m-}8} `/)VXF/'ͪO]kwC rysDi%XH?.8g]<'XR 2. HV wim~  ͨ F 32!bsF!cn!HR!ZB!1!M_!"|46"^"uo" ( "8ڪ"gH">%#M#!u##U}#R]m#\#kL$6<=$+e$=q$l4 $$ʘJ%J,%(T%W#|%a%_%%xw&B*8gD&qVl&sF&@6&%&-L '\W4' ['%'mӫ' a'G'v#(6:K(ׁs(uq(2Ma(aP(N@)c/;)c)')Lz){,c)*ِ**CY,ׁ,ɳyǩ,e,',VR!-|I-.uq-+e-T-AEgD-p4.#9.[@a. .,{.[r.$/T(/P/;x/F-/u/Qio/_0N@01hB>h0`-0}0~ 001V/1KW1zG1/1ثͪ1^k16 2e¦yG2tDio2&X2H2!82P='3X73_3S3 23;3jjm3 &4ΨN4Fv4&3䃞4Us4c4IR5ZB>51f5@`!5o455vo6( -6+۪U6ZH}6?殥66!6V}7E]mE7t\m7lL76<7+70q 8_5 58\8J8K٬88J#8yb$9_L9t9yw95+8g9dV9sF:A6<:%d: L:OX:~ :%;n+; !aS;:{;i;7:;ׁ;uq<%NaCZJ> {r>Pk>qZ>D#J>s):?):?9eb? ?/?^P>?@y)@fQ@y@IR@x}@/u@+eATAA4FgDiAc4A#A\@A B{0BNsXB}%рBTBۉB CS-D}8D `D1DVD>DmHD/'EˬͪOE^kwE) EXæyEuDiE'XFH?F8gFC>'FrXFFTG2.G.VG]km~G GϨGFG4HHsFHwcnHJRHZBH1H3a!Ib46I^IwoI) IܪIMHI|@%JMJڤ!uJ W}J8 ]mJg\JmLK6<=K+eK#qKR6 KKJLL,LTL=#|LlcL_LLywM(,8gDMWVlMsFMB6M%ML NBY4Nq [N%NoӫN!aN-N\#O8:KOׁsOuqOOaOGPOvN@Pe/;PcP'P2|Pa.cPQ*QDYSׁSyǩSgS ShWF-Wu}W Woutputmatrix????*||=e?y]B?pK.|@a1@BLjZ@W׬W@^~SfW@4m@\Xu @A-A/cDE *pS@FI*{]L.'B(eYlnᤤ?߳?En?????????c?b?R?Q?E?;?+?#??? ?8g?Gш?=e?y]B???'?)?,?@?I?Q?p?~??????????] b%?]C'?y%6?QdTX9?n?P?G`d?Q?Rj?GA>?B+?Uw?Q}?J?hi?&?.?"?ۺ?f?̩팓?^@/6?[a<?I%E?aA@?HJI?{Ϝ) ?azQ?wr ?; ?.BZ ?jǾv?N;?mz?+g? 9e?PZDQ?wCU?g%x%?'x;?S;s?>]5H?{?f8k?tʒ#$?2`vs?L $}A?ɮ~vI?Ҧ>?C2n?j&?8)pE?@?\Nc?L?r?l*c?h@ J?v?Do?,է"?B&0s?I 0?T+r8@ N?T]}L;@W/b B@@:x@>ޯ@O(A?XF@7>/wB3лRQB[D\R{Cϑ.}U! h2HL6jVǪP$!O-(WU.d A!44kϹYl<k*oS%C#@hԐhm%w i`.j&oeLAA_涩ln9"1h0?LCQ?֣??Ɔc?ZG?Г?6&?\4H?y?r*?–)?6 ?>'% ?[Eo%?d?&6??6?u?C?B?k? ?B ?8rH%?v(? 10C1?Z3?H2+?YOA`?S?U-`?/i?(?e҈sn?cV?Krx?0HxU?+jwX@|tBLZN b=^&A7!!BaCl*6\=BSܝ[5=$Bq@D<d!C^@ O:::|X:} %@tC{<_v8F^"H9]Ҹd6;Q+V7v*$$G XX(0`*"vc@ c!us' L%? b\5?eI/?D2f(?)?O2?l?5ŝ@?`ĐS?Lww?"Zj?TAD?v D?e-?D5y?W?p ?JeA?M??iv)??*>.?Vy?l-?.U?H}?L?(Ϡ?ojg1?[?xhl? &??O'?ZV?@&?$9Ա?F0W?mz?~oN?}Q^?yW?+9%?0B ׆6?0Um?^)NJ5?y@x x?o%i?~x?Ԝf!^?o?9rOKt?ܙO?Tc?O(2?ߓd? '?Au?A!j?=^?`4?Q|(??l)$x?KW-}?nj5>w?E(b ?:G@Esˆ?| _;@r .%?P?c?~h?*8G;@ %@3g5 ?yOě@4eLS>ɃC%>5V@fA! @ss h"?3A@,=v0vA\X BP&t=ւK,=}MWA"%?=rA;ܽ6j+"ٵ?n0?r`ĽB@H?S7?m0χ\@ANi:^g?FB \@X߰>bm@imPAz A jC? 2̩A?eg>Z.BGXu=$t!CV[HGCE`p;~/a9OGrҿv4r98ɘ FFU,_F2E&R%Ҙct3?Ru??I<3%?R4?3(:V?[?H?Am?Dt?4?(U?g?v͖~?}?"اֶ?@?α??zڽ?ʌY?y??p΁V?e?CkE?lo?4`?C^M?d?%?~<\?`UƇ=?Mk m?EͦLX?3Ph??aUW?,?l\?)M:?˂9%=?$^ ?aD-?9xL?`?>4>+?*{C8?PO?;+?gEz?tWB'A?|??7 ?cVP6?@;?F ?'*@cS?1S3f?ZK@j?'?re?3r\tH@ Ceh>@6U䑢?/.P? ]S?igP c9@tJ>W*Q3Aըe?PB¬z>SS#Aι؟><|d=;RrQ=aI=HCTva:&c ;IRiG:DeAnJ5 ~i6%߅2tvwi0*VDQ+\T#9TuW(H4P^BEer"ԏұ?'\ٻ?Y ?qc?/?t+3?F(,?E5?Lw?5?=H?;F?>Gx?cX?8??CY?,筪?o~"?'S?C?$R?Tyuo?b C?gz?[Z[?a ?B", ?Yt?ܞ( ?%/?Bj?]z?f?to'?WT?,RG?Hv"Z? X?6k$b?KŪv?N?5 ?z9Jx? .QZ~?}>?u?̌~D@_LuR@)e?Bo(?]9?)@@@?D3Q#?me׹0@_3dH?{]%@j>?Z^<@PICa@R-I;@Z617?\SÞ A ce#?.+>= ?~}> 5mCAHnjYm=[pAČp!^BIEͬUBxDiC[>EzRC7:#97I뽒F]Y|7y3_XwUM"R4wSU+_ sOwh{ 0[?U???=;?9??MB`?>*z+?4?UpG? ?Ǎ??!?IH[?=?3V?_R?=V9:g?NY}?eli? S?axr?f?Mɚ?^7]?#w8?'?$ B?{.T?gjOS?nNL?m}w?d?o`;K?2/?= ?,yOf?U;G X?&m?AQq?wx?:?hGXL?Q@?u6?ڍD?z?oa@?@+.?W?W͝[N?>Ch?1@^}"2?i>?n#]$?(õ"@If?ֆH? a^_:@A@@h>F@'BST?M. h%@@$6?wg@I7\DA͊1>b@J|'AShиI=ĒC(`=!kBHG=n;@B鈴Zpb>eߠv< Ȅ;PzyE2M8vg9B#7$âRU>mL!=1Y*D/k_ .@U9pPw`7s'EVO(GNT8N2L%ky -5/wfk+.ޔ>;^MLDŽ\@&7m'騮}.s(riE@ t+}n I,8T2c`$\mc^L1jмuZi&s6)},"G6΀Ww1gBx~ޥ) j"q*5ٹg9B!o _ ƃ;LfE lmp'J, Lx l|#w j5k. if> kffO I_ J4p g1w #9T %l (D M# V< B oDe ~9' am "LK# ۘh93 iC $cKw;T Gd ?Pt 1}.8 : ʚ+ Y!@ GE̛ b+qG ]&9>V pҴ O ;y X( u2C9 ƽeI `ocZ oGھ ~j blz e6X ?cț Dܯ^ : 昶 ;A" Ͼ J  b' i` F\~0~G@7mˮPMBZU`Z3&qbWδ3מCj&0ilzX$aPA`6V<<$|#R$+74GtE]2DPU0euzYf/ *rpFT.18=L_DOJm_ b7q 0*i%͛:iSKf.ZA]4imõ-v*emT׍`YC%@ ָy30|d;%A(^kQ//aqC?DI Mƭx~9ۢ}\(gvQ+XRg=nSliB=g% V5 xFƜrV4;f8(O+wyŊ=~LQ rOݏR<{*<_*n(NKŮ q'~+<TyL>yI \&[UedmBɚJ}!bVk'Ҟ@PP Hѿ5Q)k8ԅ&8|8}%g~!7016BrYR^b$b%;(froO=anܣ^-ѥ#X)lU5Ai)d5a>IɵG1&&hK6aFGlL4WPh#3hxJ': ̈kz1u 6-W`=kUpvYNE_==kJe& AAq<mp<:#eX)LU/j9 %Iix;Zy[hjS{r<ႋatDkeټwOC!tA`hpѶ/;!iǢ^0 bN`@r!KP[`€,qkv\r:nW!JQL6Q+fN7:{0 ~7*_r$#w4}hlEoqU-e_)!v=,_|YWZؖ :*5FZ)^6s^A7WU= ɺC"݀ _$l:Y*j5K:P2K Sš[Wl|&,QFpc8J3cY|ő%A^f1~tx0r gW\V0&?A dh=YQ^C^ aCqr;t`oN >m,FdAߔ҃ Z63w+ y  YjJb2 % |/5 X:F }5V 6wf T nOw X:  vr Wָ 2(< ֧c 7C yNv > !\Q!T+!tT2[r#? $X#t`-#:%)#w #D#EhMۻo##8bQ $;$Ί;-$G*o=$:,:,N$ ^$Ʊs%o$ `ܤ$Ku'$T$6O$Pjv$l $ #˜f$˭$%N%Pr?%v;"%ƣ2%n~v #C%:n iqS%8]c%&Dt%6Sc%LA% % b%Mjk%.o%Hl%~wt% `%&>V&c@'&YFF8&U;H&AuY&9 Nti&Cy&̧ڜF& b&E/&V&~Bp>#(? 3(@I(D(zT(Jd(#u(2$ z(<ѕ(;8}/8+(Q煶(1 (x/?(tA[(bC@87(PI(0h )WbV)!8-)t䳻v=)NcvBM):Ai^)g<n)^xd) =)y3)1ru)jfP)A͹)[y ;C)hU֟؉)ah*z*B˟d"*WƯ2*j6B*Q$\IS*ǘc*ys*DTVc:*]"*.33*1I6*)^d*0 ܍*O)G ?* !*t1+~T+{ '+?:8+5%mwH+톻%X+);h2Ai+Qy+/эv+Gl|+#(p+zVƂV+laeʄoN-p$×-IN$-vWX-%-x_-9@n-a-|o/.X.}Kl(.ߜ]9.i QI.nhl.Z.,~? יj.Vȧ{.o5u.u‡. UW.˼.Y^`A.R& .lq2.,,O*.~+/o%-/l\0/3t=+X@/vAP/`/)&#q/5dj//K[R/E/#@:C/T/Ϥ5b/k:&/ιiJu/B I0FO0C?g$0kd402E0sY\fU00Ce0v02q0FzÁ͖06E*0.-m0jN0gqK0":K0$v0"= z 1$igA1$!*#L*18P :1%K1|w [1op`=l1xw|11&t:b1+nfVmڭ1VĢ2"{2rb+s<29/$2GV2|O,2{z~2lxR36 '3ܦXd~%3D|>P53=7ؤ/F3VfV3lf3 vIDw3e>'v3(3ff3+6ʸ3{Þ/3ɥ3'CR3i3{ 4]pE|C4-g+4tRQ$<49URpL4ڨe ]4#9f47قv4o47N49Ӿ4:<4*Xq4_U4)<:4N 49+ 5u58+A*5)O;5$oK5Vp0\5+oCl5ɂ,m}5{`v5f 5T*TE5nn5cvͬ5ܽd5/ݭF7ң W7;'hg7 w7()7BJˌ7$@87 G @W7J'7lT:(7SR:7B97D/hbn 88=JΙP,8sʩ^m<8:M8}]8WN!+n8y~8ۈ#8ȯM8AW\8톲/T838ʚ58o8ue9h|9-Yn:!9!>29sTRB9 %R9D/"c9+\Rtps9oN99?Ub9Q<9! 9̖8 a9R9r4Y9lŞk:%U:ӝ$':*SQڴ1:bϭHA: *TFR:2%Pb:/r:p-*:#,y:LVȣ::mk:\:*g:wޡj:Mt=;ͷrj?;1yu&;[Zt6;FC.G;{i纍W;gW{g;~1Ox;Vl;Pw;pl;;Sk;[bQ;B  ;>`1k*;M0 ;xdr <A-d'}<,4,<[h=<牜bM4z >RVB+>NT;>ē#L>P\>؀&Ǯ m>g}>Ḭ6>H)5u>,זu>} q>K>D+:>B;&|>c?{˜?*J!?|ِ1?Wxe>?(:xO?[B_?>>0=p?S_??1VÐ?>7v?ud ?(Ǚ4?Jй~X?ΐ*U?չ&}{?zn@{ @D<@b-]-@m@e>@>\N@VJ_@ۦ8o@GL@UDQE@IdqN@z>Z@vh@B@$':BSʶBV)+BOa?B`B˯&1CU C양"*/Ch?CIߑPCvs]W`C3-6pC JY ހC2IMV #CC:iCsCt~CNTBC fCiCrqE&DQ}UtD g`#Dk4D4fDDG_TD)eDO6OeuDױԼDM#DOHpD7l˶Dn_")D~+KD(!D&|IDLHEK]d:E.x)E9E{JJE6eZEHv6#kE$S1į{EtzE<vEbE¥#nEH8E2dI"EӥtE%,SF4VF[D9s%Fv5F7y$FFX 3VF@Q9fFlLcZ8wFA43F9FlFZF%彸F#F ]F @gF!O\F3a G7/5G%y?+G1VHHD 5H͋HkITI(5$|=IE(Av&I] 6I|@RGIri5WIpo 6$hIגuxIߌوI6Y+U?IZwI>I?%zI8VtIc|~TI?/SJI `5 JƒFJȎ4-JD7Ԣ=JfqNJ:^JZjoJqJ$z1JEDJ=>JiJػJ=VUJA=Jm!qGKXw-KJݤw"K}E_2Knv CKg^SKEVUcKc[sK~YzKKވSfK֫KfHK7;ݑK<2K V/KK4"Kl*L2}jLC//LYX @LȩpOPLlx6^`L٨(pLuaL5aLlQLQXRL9c9L13BLӰLlqL%kMpSMQDH $MF]4MNDM_ 7UML3[eMQuM4'R MeM(4M:g1ML"6|MMtl|t>M_MCHb N}lNF2)N;l>:NǩJNd{[Nw.kN?{NԌhNOܜN RN`#AʽN)lZ&DNNb[X>N/qa'N^, O, la O40O@OJ?s=.QO$(taOčZqO"wOj +NOLS5 OŽ !O l2OTVO4vͻO$!O= %tP$]UP%P*/s5PѩEPA=$VP^#h~fP6vPi''8P"PP+YP@:`IPf|"P^*NPgP}[ Q[$sQŶD5+Q7sl;QRBLQa\Q]@lQs}Q`$KPQ׵yfQ2SQJn naQ)Q52QmW[tQșMR RfdA!RO1RjeAR-$RRibbRn#rR2XR~GR<ږR'Rbf8RRU$&RR&4RiESŃfS.(q<&Sߟ6SӘSFS:RWS+2:gS~-pxSxuS?v@٘Su7>SRS.,S{~ySqfSS3lSSH Tfc.5Tx,,Tөg=Tج|MT ^TzdۈnT)Tn]'T>TxvKDT-.ֆTjqT˟ TTT[TΛUcU^N]-"UklK_w2Uqm^BU:rSUx]cUv$t٬sUXUUOU\I.U'U? WLUKvU.U:UUFVV 9V~HVGrVRWViXTVjVM` WKjTWPL2*Whb/:W|ɂ KW rx[Ẃ kW5[|W74όWS*EWu/ɼWj o6WR'WX|/W̌ʡ(WgdOPbXGg9ZX X8^0XXo&AXqwsFlQXh싳aXZFqXa<*EXSDX[S<4ܢX⛲Z)X 4rwXy_X_=HX {jXwYYh i%Y45YFY#!PtVY2)fYo/-wYH"OYPY~a -NY\ڙYz~"`YU o>}YYt޼qOY ' Zj(Ze:ς+Zw;a[?.V[ݣ[X|.[h[8NJ[k*[G[&\{o2\0;&\m&P|6\U6GG\H|!oW\4-h\h%xix\T͈\o2\Xۉݙ\-\A+I5l\3f{\KF\Iy~\=' ]H]YYN -]g=]QŒM]0oz^]=an]du]J4y]|/v<]S ]Nh]~%]9L]T`}]˃c^:so$^~sRn"^R 2^TC^^Ǽ{TS^4pUMc^sXSs^ jE^녁o^?^EWGB^<$>^!f^\K^hh^0\86__8Ya_'_v+g$)"8_8H_N~.X_R6`Oi_˂y_d)X_7ک_A<_yOe_V_qyG_h (_}0_M `;ah!`E7P.`n?`xO`. ``Np`G`c,TՐ`p0`_d&``iC:`Lip`pk8`Y`-aaА0j#aw웹3a(L DavF\Tada% v.ua&Za4! a< a^XedaYa6&TaUV'{a0na B=b/?)ojbh')bqSk9b̂||IbYްO"=Zb?wjbog{bS$Ob|PbE;gbwjikۼbvQb]$ebQ >Cb:/a b<cjXc "%50c'I&(a@c&#(Pc;`c\At!e-qc ]Xasc? cRdȔc1EMch #c%3c< fz1c8cpEOdZ$:' dy#s$d.!4dEd!rUdvXed[w"vddU.}dRٖd7d'dtd`k|zXd&dK <@!doz e! <}em8Z*evCg:eRAL3Ke("&`5[eClee |eh)eYGbre ej9eeX4 ev&_e*j:ehǻO1f8vˌsf ض fI80fL@AfdFBQff afDJrf[saf>4_f#ifGf;$tf^Սf(jg7f[<f!IYguG(|3g'6%gR5g!= ;FgD ˖VgX2fglQwgnmugg]g sgJ d׸gv\x=g giO gӝ^71xgC:Qx hXzRha>+h˛3Yi;"Ni3L}*i[5i߀JKixBfij1\Tj&;)&jr 7jPCkGj` Wjoo]d,hjCFxjOjT-Yjh<̃jM*j0TqjJ"j(qjg};jjxXvS k^@VkJƆ=-k֤ ^=k%x..Nk~Ч^k,'ok_Za*kɈ>kUk\#kwk/1p!k!&r.gkxz/kKl l_o@li\M2"l|x 2l$ClfnǫkrSl-!cl|9f$tl}3dlI(Ula lnR4cl񕆱l-l:Omlpll:&mkݛmA'mBG8m(!.۪HmaYm:Gvim>=oymBHmXO ųmC mH~m'RmEsm}jLm7Ȍ]m I nf)w&Nn*n';nuGg'KnF\nYlĦylnTA"|n*5mqPx~qdqKx;tqwYkqƷ;qJ 8~q@*qc5[;qhgKrLISrƲ筂!r#2ri>mBrkQ RrqjcrZSsr%rerlp\Dr0lr*Nʧrs-yNFs?aK t ?/tioN-t>t''Nt UZ_txQSot6ḏd tLH} Nt3:Rt)Կ԰t_Yt#K_t[tt[K|7ud5ouM'"u^3uJ~<} U~3<8%~썒S6~ F~B8 W~rjg~/Rw~e/4+~tU3~*~aX~k-?~0b')~V~~g W~ک,o 1'P1  RR,x<s#c;MxX4]y,nf͕!~ӟ%"ÑBq2ЯPTV.×A,39t[iu9$;p;[\.0=Ҵ')N=P=ʍn>/wri ? TA<\aA"&1oAErrp3B[YTVBT DBKQ!C*+Cx)DwT#D I;,0 XX@Q)iDVK*}zNwDY=uw~W_I#pgHb9z lVP-ݮvqWuar)0[ j3T 54: Cm!MJ5Z@N܌3D&%c r5 ]u Afj2 ⯔ 솗 r L5 +Dg r ha oJ c 7 l~-u xq 2=> sZ D t?= zy (J n  >7{ߕ(89ɫmOD&C$O!}(|: fnŨ]Zu/6]1th۬+!SOX@C0j]YyJ?U`+8 @}!)  ݴU!p+*|faA?GA'-YLw2z䳕 껔֚;X9mM2W)bB3)S-[SSԋk mސnU -v;AuX8k[ߒf4v]opH^bcHy9NY =e-R#lA16;idi@G3i‡MRA۪uټY,1wEkk&zu__1rSi`9H,.<Z1 '\ObDyaVJ?DD/xIM1ol)Uag  *ubHWV(],K Z`l|(u Wm_fܠ_`h9YϝAkRn-e cK'a]F_o][u 5Y= XO|lVˈTpxʴSwʃQrO؜eN۽ L eKP8IH[:R1GdYE1adD,1ؽC'Ae@h^C?NW<td֪; ݃:!b9WF8]$h07b@6"D5_ 4X$ 3-(2zh1kj%02Q7/{V}N.i-,l+*q<*/1)e(748';i\&kpnI&G]%91$!#:-K^>#yW""D!Vڔ=!~^ !6O*ZH+ʎ+'ԼT0pϧ1Z@Nzr4M$Ly]əDT3 fe5H:J6-՝+:e;4Qj+>)dկjoBYA8R(̈́ A)Xx.ylwY!e|Yyj' T g[v!<=Rť>_wd21] S!o. +K _H s ]jYˉ EK 9 }h @. W_ nb' V> CF+ G2# 'I!Q yu{  \ pn } Su[ w홂- Sv# ӟp36}?S<*^>Jv%S%Bjg]PCPAh&!1Kȩ>L̷;Xv{zVM}6dgA({\cd+7k PwN6)3B}kiT{fjKu_=wձ4*|5]oжcсXNLnLSA!j5&*lCrG 51u 3>)ZTpw. Ͼuڿ4Axtjg 4?P?.f!j)[wp@dįibđ[rPT=FNG"}ApG;X 15 8/ZƓ])M#?HwPns z /Ioli4iî#R 2Ri0svm+WCLlXU^kr69lFj(@2t\>qwISr1@ ;7FP_ӵoElP;h͋~U{E+WCy4vjtoM8ZK=yJe I%XTG<>FUDMmCGs@Bi@Y)?κ|>G=&<s:(g9ū82t7ꥃ6=-&v5bm4j3azl2y3s1^~0/: .O-0, p+[#+!N*- })m(WF'~#"'`&Ӣ%Vz$m%M2$[#4" #"z!{ B*3 rPs^Gd5?ca߃R~_3[S{F]Z"Ё2ؑvR ې:lWkPaTOO*'dy/ℾJFPC@p/_n-E=rAf]U]X Uy.2 s- c gl}! j S {b J4B% #7 T ƕt ; oj N o 'd 0 g  m dZm .o> *` |&ތbC%9~(%/NuܫPخ,z K/S[ia5B(E#\\+v^ņMVuF8ZP@eZ&5B uq4Rnɔ$~T$g&R\<'K %cro*`џm-.֙|"]kuZI)ş9-)h  DBvmG8^]$Z;0 ^X e`tl=hrW\p̫P+9Ex:ە.3$Q>; Ej@kT]ӱzXr;r,E.光;uՖxz@)s[k5d^OWP7.JDCR&=Jk7g1 +E%4 .}W#o /J?hKLqB}q~;s3slBQ! dO~N$~ۦĜyS`fPVS[oDUK6 i ~t~|2"z'wwuO2spSnl|jѺ~h$zfdʴb1y`L^ \v)[+fYܬWumU\RTRQɇOM@ }LKCI0i$HÿFbE DB pA9-@Y>Ѹ=<r\;6:197,654Oz3v2~c1 *0/..K--N,s+R* )1v('0(+j'Q&:%W,% u$F##b"!!̊n 50Ɩ`eAk0KP$6~+PPo+E^4NGcKhdH O@ (_Yylez`d dScήH9Lu(l=pe\LZ n_| !9 lR 3 nRy ʧ; . 0 |P b t Qw vC   E j~ zO s! ]P qrOH]b5C5MV2^U9 s[msM.8ַ֑dI/g5jf6$<lpZ D/|#ZQ1ɦԻWq`1O@?B/Q,Qw^u+>:]%xMl`TiI>d3&(d|zB.NeES€z<)[2}unwg `YSL#F?93<-'b "P[ ,l8OmTK)-^%D>Ln3AEX/=_^0]ФrorʀȏHVlmMp}.{xOvt%qonmQkl?i7g8esDcYaqx_x][ ZNXVTIS?QrPqN M;KJrH;BGEzD5CjA@d?*>O<;W:y94d8mM7<6/5(4'3<*2<21?0P/f.8-C,+J** G)z(ڲ'&".&bq%G$$P##"!O!Y  ~j/6]|Sh[YarFs:Et`Ks2)%R0JΑDZSf > R = S 7R M e 2- V e# G ` J2  =WW.<V1kG#;Lby`Y95jbnSj9Cl,Ŏ=x$byL87a" >VxfVEc5%-ޣЖv}'qe=YM>B7 ,c! fw+C6xBq j"cG\UN|H%B;5/)7$ J .r@gHxE̢ҐH^ՀX~{y*wtrdp9nljgec b(`M^{\ZX:WUSERPOMLJ/IGcFECcBA?>h=8<;9876543210/.-,,:+e*)('6'u&%$E$#"6"! D oE&  )Gl5oTJNa: k ( i , { B j 6  r C  g=yU0 eE&y^C)jT?*~m\L;+ vi^RF;0%{tmf_XQKD>82,&! }zxvsqomkigeca_][ZXVTSQPNMKJHGFDCB@?>=;:9876543210/.-,,+*)(''&%%$#""!  exp_ru scalar structinputmatrix~9B.@9B.@Ҽz+#Ӽz+#Q0-I2 [A ?iuk?GG ?w;@H5?Q/ {? 4OL rlAC#?X'6.)?MKFl7Ί?%uz~nF[a\{H~#򿓬]G>#M1E 3q{" KȒ mSB (< @&@MAfYXJ> ТIZ4/@ے$5 v$i?M}5?*:moו??Z^xĐ?uD㬿` ?"WNY\S?l=}ʿCRoƿrI"?M]_?u1>?t&VпAǥ׿^?Gߪ~?kd\L?l4)1x̘>s?#c/l@V0bV@Eu!#ݟ+r-%#G(@Y @ੀ+8mZ"iTv!9{u)D$@ 8dk&2B;f3@:@?_4ANVv$B@PFȂWX5rp[pJ^R@Vn97H3Z@oL}aAGPQccӞm7j@ww@H?mp@< y9v raȎfzg1-?5/Iu%??5&v?i0?39K?gMqWqTZW?~cSGZ?GpZlQ?A `_?ije@o?H!Md_Zil?n jg{?! {?Bot?BX}ڱ0sv/mNbqS݂?jPy0u?}U??M&tq \R% Yv H*.7Zm"bk跿6Rm 3?t[8?8#=oFhI?ũF?mLP 8{bT[2\?\з_[-$1R?({ P?%*:j?oZz/r?`ᾷ1v?b)E+!S6 jO8? (FV?Ԑ!?ɧ?8fm?}oopq.;t?/?AC?uIE$? P;Ol?FTg?pR?E ?0k?Jb?eXſ#AU?,?Lg Ϳ{οy.ҿhL߿|׿?%֚eQ&Ph￵r;@?Fs?a?97Z@l @YS;@{ R@1n43@r(@S/x]E!@1UF.@>mu%X$ NǪL+5Ъ4ͷ05@` 1 4@@=;O@:hWF5UR@R#bC]@LV#R@vUU}V@idS`A;5b02X+p@e}|Ifkq@r1oEg|/#-w@%93t@Ʒy@zȥ|wgiBu :~s=?BpɭR?jL!x4?Yſ븫7I?޿„}ҿ -ֿ$+cW῝ :8?wPn\-?z)3SW?ݻ￤ ?  ErÑ?!?b= 7 sa U9lpC&l͛@ jhSЫ)8(|A)@Ta=@үk >@^dM@A@p6y 5BARJ @@O^(V@6ew:c@O=LbEhYa kY29~8Dap@!y_x5n 0}@gP/|@ ?a| AZdoXa?eo?f?>m5 +?ӿ}.?"b,,?1OU'\5"?:D>/?::?/>0?29:?܁D?-D JwDTIKlZ=v*[?H|Wx>/5UK13_?r_T?r~|lD\('wi?U/Hh?Vj7mDe?^[iX*Eu(|x|?V˒??N?|P. u 6>97>И?v.}ȦX1 A4Q?SnưD?$JſhʿmIC&̿ܿg_+4#?W߿5œt?\?3I\]?!o?"6?IuTnuŚ?Pp?[`ho>*oFW ~x.7z@j+@+;vPi@:4O @.G@E,q&g";p 3Vk7u2S0@Vy34.O@TpEWTVUK\C WP@c|V(o\@-B^@way=mjsBj@$S |o~`xPp@PN}P 3rlOn e ф.?:6 ?4- ,Cd*T4?gB3E=E@oJ>D+F@=|JN@ئե<_outputmatrix~????+||z?Wb9?"2%?e77?bQ?)k?IY?Gu>?򗹟?ݲ"?v~?5v?M?L٬?amcp?Ԭ.J?2P"?Q'(?=>+v?嘤? re? ??nO?jv;?3~m*?*e$w?:k|? J2D? Յe? :f^i?f~V;5? .pm?,~?M?P~W={ף!Az^FN>hua\>%9aAAIAQ}1;.B<'DHT:WBIMYq K*(T{mx.I.[AO/4P (J%l 52z/[l7 *X?D1?Bw%?3? 9?ʸq?,Y?FA?E\Ya?ag?L~?ɉ? D?EbB?P@??ཀ?aK?/ &?W,?L?{]?Z?@?5?6Ciڿ?ᓧN@?rb? ? ?4?a?b&?)89c?M?I?8L5?a?a"&?A=? ]?g?{YU?d"ru?9]DZ?!R?Uxy AsB y)@U3L\>1Ĩ?wYd9 ?<]Ò@C%L>ϯA̎,WBaZ W>1)I"X:8SC\"p; 6*6`*FTbIZxQ36ph02'@}*Z2SAmrӢW=߈?I«??ry?#-t?gWH?#R?*?xy?yZ ?M$y??;ZI?(!a?:P.?[?5?AE?#z0?d1T?w?eE=?͛#?8B|?HD{?29?m$?(|%? I7?.w;B?N"TͰ?2봒?qȦ@$A)q?OS?@f@s@sJA<&ɶ?hre@ ژs:=oVAex%v;i[B(Ys/:F;lx;vYD E` gD5mF(8FG)9)>7-virD_]hYk:f;̶Mbo!h?HHj2%?Rܠ?"σ?W'10Q@ȷp@2#?"bM?^~a?atp?am?co?0@)H"@w|#?@?M}X?ڮ%L€?v8aJ?KH?b)7"ق@QD}?ΐt~>Z-HS7AH >BwwQBRE;5-CXh< 쟏$;{/@BW t4dcG)McSSQ2 %k35˥m,{`TN&W-se$Ti)-%h!/?" ? {,?2_}?K?2?y ??-@?_su?ɵo?m?ڕ?5w?t௣??? ,H~?Ӷ;?Ec?FR?"C? f?gނ?03IN? ? ?S( ?G?n ? FJq?Ӑ?&?k""%?î[X>Yȃ>)db |==x!6>HGko=u ,5qA)> sڥEGB<{Rx<8ye59pHEStw7d :JT镼J953b*PQ~FS1 yşI3ڧm*%\h)?Td? #ʐ?G] ?5?HZI?3]?ax?%0G?2IX?<d?7"C}?` ~V?7C+? f?xa?BVCD@E@?&@C ?҂J;bGC?vqe?`ܦ>^_|AV%)?Ndu@@S3A>m]cA+l7>* B"᳝{8@@hG%II@oN@4^g@S4Do@gLhr@ !|b2u@j^r@Sr|@?:A@ @|ڿ/#̿yd ¿̼ @0 1 2@ 3 '() *`67@HO V@\ bhmx}@ 2./?zr?<<<<=== = ==?===?==?==== = ="="=$=_%=_&=v'=g(=R_*=5,=3,=2 [A ?iuk?GG ?w;@H5?Q/ {? 4OL rlAC#?X'6.)?MKFl7Ί?%uz~nF[a\{H~#򿓬]G>#M1E 3q{" KȒ mSB (< @&@MAfYXJ> ТIZ4/@ے$5 v$i?M}5?*:moו??Z^xĐ?uD㬿` ?"WNY\S?l=}ʿCRoƿrI"?M]_?u1>?t&VпAǥ׿^?Gߪ~?kd\L?l4)1x̘>s?#c/l@V0bV@Eu!#ݟ+r-%#G(@Y @ੀ+8mZ"iTv!9{u)D$@ 8dk&2B;f3@:@?_4ANVv$B@PFȂWX5rp[pJ^R@Vn97H3Z@oL}aAGPQccӞm7j@ww@H?mp@< y9v raȎfzg1-?5/Iu%??5&v?i0?39K?gMqWqTZW?~cSGZ?GpZlQ?A `_?ije@o?H!Md_Zil?n jg{?! {?Bot?BX}ڱ0sv/mNbqS݂?jPy0u?}U??M&tq \R% Yv H*.7Zm"bk跿6Rm 3?t[8?8#=oFhI?ũF?mLP 8{bT[2\?\з_[-$1R?({ P?%*:j?oZz/r?`ᾷ1v?b)E+!S6 jO8? (FV?Ԑ!?ɧ?8fm?}oopq.;t?/?AC?uIE$? P;Ol?FTg?pR?E ?0k?Jb?eXſ#AU?,?Lg Ϳ{οy.ҿhL߿|׿?%֚eQ&Ph￵r;@?Fs?a?97Z@l @YS;@{ R@1n43@r(@S/x]E!@1UF.@>mu%X$ NǪL+5Ъ4ͷ05@` 1 4@@=;O@:hWF5UR@R#bC]@LV#R@vUU}V@idS`A;5b02X+p@e}|Ifkq@r1oEg|/#-w@%93t@Ʒy@zȥ|wgiBu :~s=?BpɭR?jL!x4?Yſ븫7I?޿„}ҿ -ֿ$+cW῝ :8?wPn\-?z)3SW?ݻ￤ ?  ErÑ?!?b= 7 sa U9lpC&l͛@ jhSЫ)8(|A)@Ta=@үk >@^dM@A@p6y 5BARJ @@O^(V@6ew:c@O=LbEhYa kY29~8Dap@!y_x5n 0}@gP/|@ ?a| AZdoXa?eo?f?>m5 +?ӿ}.?"b,,?1OU'\5"?:D>/?::?/>0?29:?܁D?-D JwDTIKlZ=v*[?H|Wx>/5UK13_?r_T?r~|lD\('wi?U/Hh?Vj7mDe?^[iX*Eu(|x|?V˒??N?|P. u 6>97>И?v.}ȦX1 A4Q?SnưD?$JſhʿmIC&̿ܿg_+4#?W߿5œt?\?3I\]?!o?"6?IuTnuŚ?Pp?[`ho>*oFW ~x.7z@j+@+;vPi@:4O @.G@E,q&g";p 3Vk7u2S0@Vy34.O@TpEWTVUK\C WP@c|V(o\@-B^@way=mjsBj@$S |o~`xPp@PN}P 3rlOn e ф.?:6 ?4- ,Cd*T4?gB3E=E@oJ>D+F@=|JN@ئե<_outputmatrix????*#Ҩ2? BN`?]oD,@{y-E@4JT#d^@WYĪmA9= `BPvDO4,AYEjPeY\%}V2=}yY:^go}"[ ghh0=Fm)|ٱ7pB?0?0????????????r?p?o?m?Y?X?J?@?6?.?&? ?????? BN`?#Ҩ2?????'?*?.?4?8?=?E?L?W?X?f?i?t?{??????????????z?Vb9?"2%?d77?bQ?(k?IY?Fu>?񗹟?ݲ"?v~?4v?L?K٬?`mcp?Ӭ.J?2P"?Q'(?<>+v?嘤? re? ??mO?jv;?2~m*?*e$w?9k|? J2D? Յe?:f^i?e~V;5? .pm?,~?M?P~W=zף!Ay^FN>gua\>%9aA@IAQ}1;.B<'DHT:WBILYq K*(T{mx.I.ZAO/4P (J%l 52y/[l6 *X?D1?Aw%?3? 9?ʸq?,Y?FA?E\Ya?ag?L~?ȉ? D?DbB?O@??߽?aK?. &?W,?K?z]?Z?@?5?5Ciڿ?N@?qb? ? ?3?a?a&?(89c?M?I?7L5?a?`"&?@=? ]?f?zYU?c"ru?9]DZ?!R?Txy ArB y)@U3L\>0Ĩ?wYd9 ?<]Ò@C%L>ϯA̎,WB`Z W>1)I"X:8SC\"p; 6*6_*FTbIZxQ35ph02&@}*Z2SAmrӢW=߈?~I«??ry?"-t?fWH?#R?*?wy?yZ ?M$y??;ZI?(!a?9P.?[?4?@E? #z0?d1T?w?eE=?̛#?7B|?GD{?19?m$?'|%? I7?-w;B?M"TͰ?2봒?qȦ@#A)q?NS??f@s@sJA;&ɶ?hre@ ژs:= oVAex%v;i[B'Ys/:F;kx;uYD E_ gD5mF(8FG)9)>7-virD_]hXk:f;̶Mbn!h;W~?'?s8?6;oO?@?Ӈ??g?ѼU?x8$?im0??y߷?˼?Kgdd?8-:?ďyu?渶?K?-N@?&L.?a%?EE?ԫY ? 8:?6:?^ ?_ d?76?.?|Ә4?j`g?f*b?;"'i?ijF?Ҫ2?,Yb?r1? *B?km?GBA?}c?Li?œo?X?SoX?櫠%k?5?4C?C[,?^%?.V#?ޮ?T5 t+?ܫ\X?U1@6jq@]E@7S?$< D@eI C +@Uki@˘@?7? A:@="3JA;7`q?YBW>dy|+>-Ax\*q f>EBbǤE,~7LAvd'F(e}J@ yF /{p*HkyH-X&3i2qBWK=$ԗYxxT$&"S_a:@*]Ye ǹ ?m[+?C?i}\?:`o?Ǚt?_R?A1A?-s?oOt ? n?խ?ڞ4?@?-i?\?b  ?H_aT?U ?Hփ?{~|C?I&?nt?}Qs?~ϲ?0[?= ? ?pf?"??gdd?Uo? F??ʒG?cjo?sNx??Vc 3?t6?׃Z4?@Lr?A\?&@4?(%%_?r? ?+?9ӎ?/g?޲D?jE?5u? )b?n0b? ?TVL>?GHj2%?Rܠ?"σ?V'10Q@ȷp@2#?!bM?]~a?atp?~am?co?0@)H"@w|#?@?L}X?ٮ%L€?u8aJ?KH?b)7"ق@PD}?ΐt~>Y-HS7AG >BvwQBRE:5-CXh< 쟏$;{/@BW t4dcG)MbSSQ2 %k34˥m,z`TN&W,se$Ti)-%h /?" ? {,?1_}?K?2?y ??,@?^su?ȵo?l?ڕ?4w?t௣??? ,H~?Ҷ;?Ec?ER?"C? f?fނ?/3IN? ? ?R( ?G?n ? FJq?Ӑ?&?k""%?îZX>Xȃ>(db |==x!6>HGko=u ,5qA)>sڥEGB?xa?AVCD@D@?&@B ?тJ;bGC?uqe?`ܦ>]_|AU%)?Mdu@@S3A>l]cA*l7>* B"᳝Y0l>H%>T,~>n>Zr {>H&>V"ʐ>,T>4D>D^\>/v`q>*h>H T> #1>):֤q>-%w>x3!o> y W>VK>|u9>ς$?Zu>>[>(bXy==+=ir=ܫ7"p=e q=8E=âYS=uՒx2=%u=Z=5-_=^`=kwF = =CN匑=(̓=}}8=k=ϸ:?Sv=myv=E ӝl==9PKi= ]\NQ= zBvX=*%]A=3ϲ-=/7 R=Bq;L=GEϨ=:S=&@Kqǖ'@w _E6,⿹5 迤9Lc_PRnX𸇂Z /0`v2FLO2_Mm6xFLs4pN61 J?;`rP(- \}>B%PMZBa.p`ܖWnMEl1Ue֡پ"ھ}R־;ؾB_¾X5k!|Wѿ58%IW;^ ,wM\K0/ű>ר_(K|{Y&*YY@~fZg6C6g>C!A" 'ϲ-*#L=2A A ʱ d'p!ؼ.! üssyJ)_B@fԚ/]Jr __k k APxɝAm-KAxaLAF%Aft?@4@Nr@Ap^@pȗFA@T=@$jB8@<2!@7E @Hk8@U1@R@w@\$ׄ? qQ??b ?a?^ք?ڮ~?3ۨT?wS? %N?'G?Y.C?[3?&W2?outputmatrix**<<<<<dgY d?܃\?IM1?G?WBZь>N >կ_>M٣t>},{>J#>g>A/'U>&$D>E]>q>q*i>V+ T>!cN1>}פq>oH%w>k)X,!o>9Wy W>S&YK>Tv9>`@'z?xu>G>-[>Xy=f+=.m s=9"p=" q=E=Z`S=גx2=X$v=Z=2-_=J`= 4xF == CN匑=@)̓=Cǂ}8=jk=چ?Sv=)nyv=R ӝl=='9PKi=s_\NQ=~BvX=X%]A=ϲ-=07 R=uq;L=GEϨ=x:S= < ci3<<f{F? H?*YX@weZg6C6g>C!! 'ϲ-)#L2A mA dp!׼-! üiq;,}3{:o] rڀ4[O4[O￶￩￧￥￡￐￐￁vgWJGC"!expm1_ru scalar structinputmatrix"9B.@9B.@9B.@9B.@O+oBPB #B #B #B<<<<<<k?~)?Nk?QE?Z?ۉj>±k>\+/ư>NXhV>d7>(>8p|>$ G>@>VҲ>Tw>g>Ztz:?ޫ}?{:v>5Ags>u碦>jg8>^ a>H>>P>,>6Y؉p>i9tt>z> 8x>ظ&l>łzm>KzDo>T_T[>Z~I>ϯQvN>> 1>q;>i><>~4{[;>7⭣?>G<8h&>1?>>)3þ=*=J=P=U==ݐ=5f={=P=jo=}T==59w=&=!=t/=%G=Q= g=E=t=:=Ps=@?==_=O==P=-W== 5'=@=m7=]W=\A=b@r;=R=NO===9?==z#/=:=*=( ==(===N=ڨ=(z= .o==m=H=(==g=h'==?=Jo=h _=O=_=z/===ZrO===*߳=(==_==hq?=^=Eߠ===_=P=o=?=}_=?=4==e==@=U߯=߬===4==(=\=tWJ==z?==T==P =u?==P=T=*p= s=hz=]K=w=)z==v`d=Mn=$S=W=]=xB%=RD0d=ҩ*{8@@}aP44I(x=4U5P8 b, 4~" sV n|p%QNF{输C 1h@NѾq;³ݾZ-ľ|ڿ.&1߿vs"K.&7♂Y*`l̃n~Fc1?wYgf&lq[p%\mfyT`U`sG:ƇK~0N͡OKt;yd ¿:Cÿ͇ÿ[̘D˿/#̿_=Ͽ#V4VxtഡX нҽѽ Խ&WֽXӽҽ ҽ`;ս_0޽n`r+۽ٽt׽6ؽfPܽ`۽pڽ`:@ݽ؅ ߽\^igr½0u½~ý;pĽL`Ž0Ƚƽpǽ@ʽ `Ƚ̽c0˽ŽPƽ0@ǽPɽkʽ+˽ͽ ̽3ý̍Ľl ɽ˽C(ͽ ?ν,νRϽNϽ0;ν3`?y༽]ԑ&L`Z@6i }`Aغ S#`,"@( 7੽,@0֪/#IRT88@X f'@ X)`g8JPG5s黿`A2apxFvP}V ` ~Vzв1`=) gc'#PE-3N +<"x8)K./_ee R;f6ҭYaD+$SiD1>憎ʛ鮿LXzۼT[:XLټK?hݼ+x: W(KFctt2ryg$fp)Zko=xMo=xMQ'AC,bn@p[@Oɀ>@!<@:@3@++@Ή6!@xU@4#@Ǜ@;ħ?鳪 ?&?+Q?4?gj?fv?pl?d?GE?J+'8?>93?w2?outputmatrix**<<<<<Y d?܃\?IM1?G?WBZu>A>zwʰ>_>3m57E> :>S͘>,M G>煮4>W8> qz>(>*5?;pf?M;v>@6s>O8碦>f> a>gt8>ע$>>V> }>p>ǩFtt>7[+z>ˬEJx>V&l>Հ~zm>?e( Eo>lbT[>0~I>OUvN>wf> 1>,;><>5{[;>s䭣?>ɵh&>f?ļ>"(3þ=G= J=_ =U==E=3=W=_=*p=W==x==W=0=H=\=Eh=u==W=_ =E@=_`=P=x=_=OX==(==u$8=EQ=!gA= Lr;=Z =bP=+=@=+= 0=A== ====K=b=K=  =p==k$=o== =0=/=:=t@=kp=/`=,P=/`= 0=v=/=KP=V =k=== =`==/@=B =u/=3=:=%L`=_?=\ԑ=Z@=c`=r@=S=_T=5i =Ճ =y=U==F=====²=WJ=N= -@=<=W ==lP =@= =P=W)=p=s=/{=>|K= x=)z==`d=r\n=p$S=X=^=xB%=%SD0d=ҩ*q/`sGI ȄK,NYO;8B "O>A KBlZqBdvC3 EREH[82I`6Z5LIdq;U7?]$tU-?^\Y0UÂ`듟֓J\nҳa(gUj|8x[pC|(U_?榱?W[?gyX?6JGqU)Uw') H#}mY`?N[`0M.RNeSr\9$ҴpU4az["8k@@S7;Ŷy<щ[ViGrJKX)ҙCAPvc):$HQeQmbrs_ {!ej3Lf?;/Ht%9hT~kV/\A?]2[VEaBb_h?Dy???Mv?b;A?p$_O?p`k?$W ?~Y%F?|Z?N˜?F czw((CL)=>続])B/D% YC-RڋK] @Eke{lSS?){IJ?@,33333@5??6aG?.@AP@?v|lK?~N6U?yE|?_?/ͨ9?U. s?F]c?/?h[?|E?+q\,?2?ev?hD?bkF ?"?I?țj?Tr᫴?5Ui?3M.P?y(?a9?9n?a9tT?DugiQ?Av@/,?1?1?Ii?6˥?a<=?Rp>?b+5zu3yR^ u௞ tX@(obEnV$;nx<,n{hwny? nǗ¤mWsmFmtZ.]1m:W'm[*ѮL mHOFlwUvlCmll'cPlwp)l4vkXЁѭk]R+54k3rrk&k~CRk|26RHkij jA>j**vZTj/IiKjaBN%jwJ۔' ji^;6sisBh朱=h ,e$6gA6|-gyfQf$ o!f HMeheͥa}e eAgdR&++daČ d铆c vG=[cyecoH\c=5tcժbUַU}Z4UjSz+UN "URr'T|MTꨅ/$T{T7-Sz9 S1(> "rS'K+÷F9SoقuRycXMR9R)aRżWR Vf'ERTQ(R H| R QQN"-Q9Q/f6„vQ؞,ZQ\+Q+Q7"Q_2P#!)Pss}AP {3jPا!OiOUOc+6+ O= N45 N8\NxN^PŭNOtMn+MMyL(qL.4l^LkAL)G7LTFLLK֧Z|K/1,uiKuwK\ch"KF%qJnԻJ(ygZJ=N_ J"OJrT*J,E6Iz,{I^WNJIu7=wIFejI\I3n%HMkHuzH oqHS+THesKHL_ 5Geۊ-WG];GFCSF`ilcFFimF1mecFwIF9UE@Er.\D?,Dm)[D;eGD$EΫ `DχƗBD}Ֆ479DDUiD>e D-gC:$)C) CWC 40j CTbkB|B-B@l4B1HuBbT7 mBфʨQBQ|"BF$68B3(APۙATNA>xpA7rrAAݑ<7A?(j3s?[D{k?t~Ţ^?{hu??ZT V=?d`0?O.?s^&?0?GlÇQ?#\-??,Q!=?P(F?Xvc+?3$)?wyX ?cn??hx?6GJ?w?cDt?[m?{Vyk?b($d?+>b?wkT?H@OO??^H?"''&;?C9d6?[1?q+??`}r?; ?PvΕ?%7+??u8?x? k|? 0?%E?.(P??#m? Ci?W?9X^N?&+)?}7tp.?{g?c?}?X?6ҙ? XY=?(e??xZN?\1 J?d?I?jhH?U? e?n? s?{l?7j?_h?i@P?>tH?!85??Ko=?KTa5?h?G  ?LU$?.5?P?ܹ ?(8? ?Ah?E< ќ?S?j?9r?H6?f}}?Ӣkw?c^u?%7jXe?ްLc?6_?:+]?sfN?E5B?=Ѩ>?( aH&?v\f\7 ?,?g" ?WU?Q?Q?;%?KE ?w9?SDGE?{?s3?h|?z\6v?̱|0r?F@o?sqp[?$!>|Y?PgS?%̹O?*?Փ(?I #?y'_-?ӮYr? g6d?}a?0*?ƭ`? v?hG??#=[?pA7?P?U?9? u??z?x-}?fU&ly?2+n?4h?rca?14_?spV]?e%R?\jJ?>M8?-T2?ܟ.?i%? ΁!?'6?xv?XU?rGt!?Y k?PL@?o^j?*d?Ӽ?7Ʈ?:()?D?п?/'?R?7UY?!!? U?e|?C@ǚz?b'h?OPmjf?-*e?·q_?YG ^? V?۴;^S?kԟDL?6VgC?I^ESBA5?RW?ڗ$K?UA?=??eSJ?$|al?? r5?oˈ̼?k?E ?⏓?$?Vtc/?M]}?ry?:VV?kDQ?{GGH?˾ZC?Myi@?aKJ1?k<'?75Ԗ%?|03?ҳ0?~p?;8?"Ay?G?fC?zMF?'?!+x?7^H?yn*?<(??V(?VÜ? T:?də?qI?sU?;1y?{ْ?ώ9?Q:?B?܃Az?gLDo?< X l?J7g?+c?}._?7YY=(W?;YR? "$?.(2 ?/\#?6?P[ݢ?4 ?f̹?N:?E'By?'Qf?hI`?$?+[f?K??rn#?M?V!?KH?UpǯJ?A=-?:Rh?;W?>/[?`?.s?H1i^?3:{I?Z5?Z?iD ?@`?$ C-?̦G?vP? }?!e?qb?۝aN?jL? ưI?PE?W:?]1?mȹ+?ͼ9'?:%?W ?r7?u)\?H.?]X E?$5?_SQ?t-?qq?&6?tb3?9]?1G?qL:?q"?2P?mחӲ|?o?jOn??T?M4=K?e&.=?({\"?oC? ?e *?4\?F?O s?:?Ўs??|?3{w?O`YQp\_>vz^6J&X`]<_f[.&\B[6aN"[6[ۨ$Z[cZecY^sXTXe=XhV>9 V⡶pU[~Ul/T`lT4ZSR^RY$R5%TOt6sO19DO N:5uN&("VMsK -L評XL+{M8L}HKMUF9KfѢ>4d{p(> R'dxp/'hP& 0EG%u$5ֲU*S$Lk#>m"3#au"={bv!BF!^r VJ 5X D=K8 3e\~:`#`?ٰ[^ewJ~o@EP~ɀ_0!L@CP{qPZCPe0}j|Q`!B bB܄Nѯeh[?dG}:睸hɦ+Ey}9 l{ELJ1 2EA.ND:$[._CuJj Ӱѐ6F ) r9wr3R50 2ymxX 4 ~R/Y KاY W D)P|: >oW xVϞ7 r\ Ǧ xں/outputmatrix]qmDCx?0_aG?h ?ru?"<~ߵ@=22@X-Д@n\*g'@mFh0@,4@7@c`1@2:@O&@@(cD@NOL@JĕW@1 Y@Kh#Y@kņm@OˇHm@Js@K?v@v rt@#,w@\#d}@UjȀ@f;%ׄ@~7U~8c#,?x? Zy)&@Jp-dKwV@! N@HFd@+fKi@g~1k@ H48RQ,hVv%hCw@S~@֍(}Xg7!LAQ(dfs@* s@S.n"kz؞#+g@quL,X5h@,d`w@8smu>J a^1GzIZr _3,o@LXt@7(1whPjP@jx@mBK?N悿dqOTc?G-MF?50tUax@}UG ps{vb)@T@@Rgtq@iwh.t@:B ~@w4@.? ?Ͻ8? R1  ? Bƃ?~^]ZǸ?CR;]?u?lג'>?? v9x?#e? ? [T?@Yw?>?tx?7?Lߞ)q?IW?Zy%D?)[7UA?q{o8?g1-6??S!?M͌?o ?E}?GA?M<?b8g?S%?k-v? Ks?L?J5ћ-?5?? jб?<`?O?I =?,?{}[|?v?Drs?h?2je?xT?.O'R?ڌ;?ۏ4E8?:43?>f;-?{*??J]ik?)?3b? X`?Ir@81@@]o@Qg@ad@IJ]@ҾQ0@pt @?-@b@M̓~@@轊z@6ބ@j& k췄@sh@9_@s]f@{!R!@89Vp@k4i@*0Rc@$+\@r22@@=-@,f׃@[%ԃ@kDbʃ@4Ã@Zcⵛ@yZ@Ӭ@4L@HԜ@j=@Џ@%܊u@E[́h@Slm{K@b(k:H@shD@V*@eB @$"@g @Z7c@2@M$[@_ς@[Ƃ@ j O@R@֫F@$h@ B@XZY@@f׸t@awq@p6n@,j@Jδg@S.T@kJ@ӟC@ @r@@2d}@n {O@rK@Kl[@BP|@Iu9@4p@h)+z@6W'v@3B@r 5@hK@% @P@݀@H/@最@d@Ԉ#@M@Xvy@Vb[@_`X@THGYN@sTLH@~8PA@#M>@OBD.@{Y)&@@*X@AԹ^@7X@2±D@/K@N"ę @n<@X~@g~@(9U~@~|iZ~@"^ a@~@A9~@a!P]3~@(~@#P ~@;8a}@[ٻ<}@4}@Tcsc}@t n\}@\B}@Q^(O /}@/A}@J|@,Q|@]>q){@o9{@n3{@MLz@SqNz@4jvz@CdOOz@A"-u@Eꥆ u@.Tt@6t@ Uxrt@Kont@dؓ"Ot@s JIt@!{g(t@A>"t@It@5t@T,s@ǣs@v ys@rrs@shDs@?Ro$s@pDs@*B͵r@'ἁr@p6nr@rq@=o q@7bq@p]q@Yx Gxq@":\q@3Bq@S*Wtuk@l?k@w\@$k@Db k@+bJj@\.cj@u i@ZXi@ii@i@ ki@SDi@Rzi@0Dh@Ȧh@Fth@Zh@Mh@Xp|&h@g&hg@=dg@XH}g@6PODpg@)f@&ykf@?e@6e@UCܞZe@O̓~d@ Uxrd@s]fd@HdVK^d@89Vpd@C{_c@thDc@_7c@qDc@;c@Pb@#3b@dca@ս`Va@T*W"D@2,})B@)˼MB@"iUtA@\IA@-;@@w˵Q?@)>@2T>@l?;@ f2p:@Ig8@{_W"0/7@b'~5@>. 3@;SM3@+0@EaI-@UYx,@*@~&@>B͵"@?B^x ؿX@!Z[=ѿ.(PֿBn.X! в0_P4mxgtLuepy76|뽢rg~m5ņP#u} 6Pwy0#:]9ݷBæiԟJ)tͧbKƯ؛*b[bN#';|#édꎬ$F-Ug᷿Iɠ,~+4ou{]4-=gt8)߱{2p23zcBj) ʼ?bSɿF'hʿz7ʿ$0˿I5+˿`˿4 _˿V6˿ ~ '̿/xBI̿"w_̰̿c̿:̿M)lͿU߀Ϳ& ͿtJο]!οۍ οur +Ͽ#CMϿ 5ϿmϿφϿPϿѐϿA#пK }2п Tп >_пAKnjп΀п``eL/п@ п^nIпHej9ѿIP3Jѿ0qOѿ]ӿ>1 tӿU7ӿp_ӿ!ӿ`xӿԓ@)ӿ>Fӿ!RӿO" ԿhCԿQԿvs!Կg@uHԿOE-jԿט]uԿ=NԿgGԿ&~wԿԿOI1տ(t*ZDտIlK|տ2"-տ/_Gտ.ܳP)ֿ\4ֿ"D@gֿ22}ֿehֿ3ʤֿޢTֿg*ֿֿm~ֿeV| ׿G׿b?c~׿߲׿% yW׿=׿:׿/Z׿y?׿^;]ؿs^^Bؿ@j~[HؿN̾Sؿ9TdؿLؿ7ᥲؿpf\>ؿ[Y-ٿ4eIOٿh}yZٿ3FrvٿGXf |ٿ:ٿi{g˨ٿ ǓٿGzHٿJhٿ@È$ٿmIٿ90ڿ Kڿ l[ڿRfڿh4 MڿR(ڿxXڿڿrڿ'+ ڿUsP; ۿ!s1d0ۿiN3ۿ}6hۿ%VۿbJvۿ%7)ܿam ܿVභ&ܿ1ܿJ9$R7ܿxHܿMܿwڸJSܿF;ܿikԐܿ[ܿX{]ܿ ܿ$ܿVܿbDݿH ݿ[^G"ݿjS?>ݿgTݿ(_ݿkݿ<ҡݿ_X{ݿݿۖCtݿ c ޿$#޿S&}޿;gO޿Ō^I9޿˩޿|߿l LW߿6Ds߿t~߿~Ν߿ƁO߿jY.߿j+Tbɸ&t64࿵I=࿵UjB࿒\[ֳ)[lK;krow n}ո҅࿹+ kˡ06:-Ľ࿖oL=Xވ'K࿤].E }/إOῼ_aLov"ῷ\8ῃUTَ$WW;[_tmbeῨdh/!0kΊzr{B5EX"cwKG}%jӁῇ/64TijFGe{Vd)؟v.JĖ4Y֦`7ܽ,:L< C)HOh'M!!dCQo}(z 8N}@hx~)&Bz_TF/Y⿰ ⿳JADl濴*QoJ2 }8i 濙n6 rYu&@jt@fci@\^@,@á0@>@dv~@$w@{:i܂@ߑP[Ƃ@}[T@Z*y@ƒX@M@p@m{@(-0@Pad @to@z@g@]}@ \@1;@lW @m@tuB@=>@ K~@k2ay~@ЛXwk~@%P~@,;:~@V( ~@Z.>}@T}@Qcj}@GsHG|@f<{@]Ъh{@&lLb{@ɳ/ {@Ez@O%rz@֖z@C\Cz@;eRy@\}y@#-y@ox@He^x@ J2x@= kw@}*w@Ȳ=Ov@vu@Qu~Zu@gt@1M%s@Qr@gr@z}r@f Ϯr@qġVr@"9E`q@)gMq@"!q@Wc8 q@Uo@Dm6Uo@jnan@zl!n@)˘m@GBKl@Nt'gl@;Vj@.Lg*j@ݗri@df@Ge@v*Kd@eYINd@du"d@y9Nƕb@E1rb@ïf4a@^a@{qp@,`@O_@*u[@"jYjZ@}X@%|րkX@V/IX@7éU@P_R@v!7R@%EeL@қ!yK@t E@"0G\EE@T:@:<Ϭ-@(r1+@e-Y2p(@"@w1z@[ +n8H.? dCyD7kD^KۦG3re M@ nOXOڻW{^XKJtCbjl[d?fVGUlfJQh 4idN)ikWEiB|6jP)#?k+pwkalHw;d| %9Wji ΀ ـj@ MzcG,^,jˁ4) fӜ#9{EτՍͲy"Hulog_ru scalar structinputmatrix?孾/q*M ̌G4K @&ϰ Zml":C˨՞&VAB3p4iΕvL]~m'})iOH}&::73s9)};O,v#Ԟ!Ozs,fZjviIzi !_]outputmatrixqmDCdx4Xb@$s^Ònx 8r@qD@Ȍv)<(1_ÁYzz*o@g`RP"X2?8vNM?T?LwV?4^"r]?"A,)F?CN9J?e\\K?Z%?!d{*? ;{?G6?hg?1(?p>}#y>֘D-?c)=?%y>AuI"">rjv>4'5>a)>g>"Æ>a2q>\赺z>Ccx>/E~>nPZV>ݯɲY>kYeD>v%% C>jvN>FJmy-:>p#>oܸ?~_h>. *>1i>fѝ1=0ǻ=oq-=7$U=V===[<= =s=~=K==[H=Kx=\h=Sq=sm(=%8=SX=R===>fg=-|2=4ڭy='VM=E&|=q2W=!sٺ=[>׹="ݪ?f??3@q= x= :QK|=XUa= K88a=3Jk=M ;n=+T=fT=V=IkY=cY=>tV)=29&5==9B.׹Fr8Jxr?z%u-?}; IkY}Q>!ȌώwH [p wu.w9B.hdEbn/_ee(h0orڼNO޼YaD+ܼ.! üP[:XLɼG?hͼ8*|SQΙddƂ)P6\q@8Yr +v̘{ŠjvlXfV g4Viщ)Evoutputmatrix3̶y>eO>BwC0?k@}D?i->Hy>Ũ!">[TLv>3'5>{z>3M>P1Æ>#2q>&ҵz>/Lx>jVV>AɲY>WeD>k$ C>aN>اy-:>l!p#>_?ذ_h>0 *>^1i>Ɲ1==adq-=.)$U=T=?*= @==#=G=@{=ێ= ~=G=pw=Qg=W=G'=#7=W1W=V=?==;xg=2=@cڭy=aTM=|=2W=fZٺ=F;>׹=v!?4g??q=x=9QK|=Pa=#F88a=+(Jk=> ;n=Ύ+T=]fT=V= IkY=OY=?>tV)=8&5=={9B.p@o/ @k,:&@$u"D%@d=p4@HU~ME@=IeH@M=K@)}НL@)K P@,m%@_0%Vt@(6Ga AXAr4rˊMJ0U6㷏@3yI :u!h%:5`cTqU$>'8Ѿʖj:̾2\+h1q-U츾1^[RT{biemApetv msx!\$fv'i*unH)`/[ XeD"y-:Ce"8(H3͘1"g_˿  *KD7{, ݁.E @k&Mc_ w\.sǃ2ݕֽ Wڠ{|<(= q&`*S)DHP>׹ GB8Jxr-@zu@}SIkY蔃QS>!Ȍ Ў,wFH p Nwu.9B.hdEbn/_ee,^'Ӥ5orڼNO޼YaD+ܼ0! üR[:XLɼK?hͼYҹ"'؇)'|-eqh`srZC0v~g+{ĻjiSfύ`i08lnlog1p_ru scalar structinputmatrixoutputmatrixlog1p_rz scalar structinputmatrixWu6?JOQ?VKR T?(e}Z?71~7?uFķ ?`0n+?k }+?K'љF?Z P? @>wo׌>q~e>@`>zwʰ>9_|>XmwC>!)]>2@>;pf?M;v>^]䲝>A6s> a>܎_> }>;Cə>Fv>egb>ҙLu>~>fL=yHh>4pek>Td i>> RS> A><>5{[;>>=>ɵh&>})u>g#q=R&OU=v8==(=`<===g=ؖ=i=/P=V'=Yp==@=``=f=!gA=Lr;=k=lp=LP=0`=V0="@==,=,==|=LI===0=(/8K=l= =+===p==`===P=F+0=`@=`h@=vp=KP=XF =0`=b=X=0=ؤ ====F==`=V=P=$=+=n=f=I=`v==ٺ=/=`-=F8`=v/=:=XD@=ٺ=c`=r@=o=Q =S=`=`T=փ =X=V=`=F=F===&=jzв1=q>׹=WJ=&'#=lP =U=PX8?T׬պ?B9_mL?[ Sq=0 u=Ks}t=?|K=)z=|=)`f=r\n=R=)*/yR=^=a@=*Z5=/y8)=ڨh=}*: = =me9`(ߛ >Y 8l?9JQ?`T?1m?wZ?v_C }7?Go ?M3eKtm+?d+?Z蹀F?O?J>Fp"t>< H>K>A>\+/ư>Kxq>DC>2%ց(]>UT,>ݫ}?{:v>QE>5Ags>^ a>M^>,>mɊə>zv>Smb>dA>u>[(~>k14yHh>ӛYk>Ԙd i>6BS>|A>h><>~4{[;>gX>=>F<8h&>y(f)u>Wޚf>ĩ#q=ʳ3U=E7==w'=a====L=4=}K=4hO=U=o==@/?=О_=̓= \A=b@r;=J=J5o=ZO=_=/=?==j=ja=A=Z== ==V0K=J==j=-=t=o=@=t_=%=@=O=]j/=Pw?=K?=to= ZO=\=g_=N= =׹=sWJ='#=P =݄=pc?l?92? Sq=ht=r>s}t=]K=)z=|=Wf=Mn=(Q=o'/yR=]=`@= *Z5=x8)=٨h=Q*: =<>vh?<-! @z#@\r`x-@RFCQ0@77==@={8@@vt _J\N^FͰ_J4 [7f:F[TJ€nz1L^ 1 U5P8.'Pf s>{e9=*9`(%pc>Y xd ¿[̘D˿.#̿tbο4(#qjཪVkpὺ^8r(Ks/ὂ/`rkKPRq彂,p2|Z<˗P㽪㽺 㽿"@+F佋V0彯 /a`彿@罢m`r+۽^ZZepi/u½p`½0Žƽ˽pǽ+ɽ@ʽ `ȽJȽb0˽$ͽ+ ƽŽȽPɽʽͽ ̽R̽2ýJǽR|Pý@ĽˍĽ ?νZ7ν+νJϽRϽP$!3}`Aغjzв1ٺ䣽e @!_4Zzв1Z Se톽_Jt;tl K88q_rXUqEvy_ ~ Sa=) g`[DELj9J.ҩ*bn6ҭN?h20! Ӽ;fּS[:XLټ;fƼLXz˼(N* ?~@N@Y眿 W(KtQv$f8e0c8e0clog2_rd scalar structinputmatrixkV36^Q)u0n2 $J-D8q;ծuXR1PCZ+J(H vU!kF1ν:2[|Uwze^ww%h qE +1@ъĕhG4P+ 5"p|k9 S$t)J,ದ{CI4n(&r\>'HGO#nMrewS[VeڄKyЋSPfL>S21v>\kC0_5}$jj}&H#A|iB!`/@+@#*,Q~LAtN.p;>bJ!|s i \LMi+F-ׯ*dfy>r*W‹"dvo#?7fQ#Ga*} ;`:aK~PvNJ.yR|.> kT'YAAɮN~ѽ_!eP?Y4񀇓0t;~ ) A" `ۢE>:JEMgNj/.)Ypv4CD/.c9Q| ܻNMl'IX* Dо FX"xl/S "JNBoutputmatrixk{ w@q@'8}A^^BzP@JmVp@ytGt]:G @%mPmi{@F/b{\.vz@@ߡ^ƈmƾP@?qr,q6'_@j>u4(~@f70!<f@e}eL@+@b{b΀KZ\@@1v@9Ǵ1<,g@|-dp@/Ɉ5f':Ne%i@@bԀv2m@}cu@y °a@N3F@,'B@}h@%qt@b'P`iρ@$y&Ņ@Bp@<06{Yj@Ba@)cc@o^݃1v6_@38V@ǫPBX2pl SȆN[~Et|&S:Hh@ :l!:@b]DqJ@**`@۾ D@\KE@j@?KMtnSmʸO?YuQ!R@Op@D=AɌt9G-&@uguw@骑(:@W3Baaq|_@kh_P>ԹY0@P!@17q GaF\\@Z湖:@mz7~m@4K`@,Xwp@Of5soB7(u}#u% VѨi/@1h`@ Upd}r=$Wl@-CHk@`@5"%ͽRx@6ADM PO^80B:|-!vJ+r;7fPHn-<itBZXl}=3-f 6gg64"_j?mEuK]/fo5Jb,(m*0 -G4QIJA>rY1ijv#S_FXONQK+h&%UWf<bh=F(sFV#@I%}N:I邿Jd{Z~ uU^*{ !f@*jf2لE?i][5PZbFL,SwY19t%0S eWHƩl0pwؠ ^/+A\^byt9WfJ&wbԕf~!A!KtN/F%R+x׀`W=qEPuZ{7^}nF/+ rFL"hOD#)6PP#;3\(!)_W!c: sZū[e+ lZgp7 C  i-ږ@+m@~뇤pKoutputmatrixh?vb+A9g)bRo{Z`8?`8?0ʁn?ӜR^?&@{KK@l-CDw~mK`p{@YoJc@8$^@'s@-F60^nf\@â{y@Sm@D2_}@;d @[@ut@h'mO@) P%Ԋ4obut6~S!҃ď1N@9w `@!4VB@$"f~O`@|B,e@)vȆ݁ZxOkُ0,زh,KЄe@ꦲ (o@!&t@Mm@ )[Gz<}džd V@ڛ1ަz@G6@$TCe<@@3vC 3x#ah1IuL#vDx#~5PTɩ{@bzf@#-.eJ$ޗ[W+}rN!M(@Xg@log2_ru scalar structinputmatrixkV36^Q)u0n2 $J-D8q;ծuXR1PCZ+J(H vU!kF1ν:2[|Uwze^ww%h qE +1@ъĕhG4P+ 5"p|k9 S$t)J,ದ{CI4n(&r\>'HGO#nMrewS[VeڄKyЋSPfL>S21v>\kC0_5}$jj}&H#A|iB!`/@+@#*,Q~LAtN.p;>bJ!|s i \LMi+F-ׯ*dfy>r*W‹"dvo#?7fQ#Ga*} ;`:aK~PvNJ.yR|.> kT'YAAɮN~ѽ_!eP?Y4񀇓0t;~ ) A" `ۢE>:JEMgNj/.)Ypv4CD/.c9Q| ܻNMl'IX* Dо FX"xl/S "JNBoutputmatrixk| w@q@&8}A^^BzP@JmWp@xtGt^:G @%mPmi{@E/bz\.vz@@ޡ^ƈmƾO@?qr,r6'_@j>u5(~@e70!<f@f}eL@+@a{c΀KZ\@@1v@:Ǵ1<,g@|-dp@.Ɉ5f':Oe%i@@bԀv2m@~cu@z °a@O3F@,'B@}h@%qt@a'P`iρ@$z&Ņ@Bp@<06{Yj@Ba@*cc@o^݃1v6_@38V@ƫPBX2plSȆM[~Et|'S:Hh@ :l!:@c]DqJ@**`@ܾ D@]KE@j@?KMtnSmɸO?ZuQ!R@Pp@D=AɌs9F-&@uguw@ꪑ(:@W3Baar|_@kh_P?ԹY0@Q!@17q GaF\\@[湖:@nz7~m@5K`@-Xwp@Of5soA7'u}"u% VҨi/@2h`@ Upd}r=$Wl@.CHk@_@5#%ͽRx@5ADM'HGO#nMrewS[VeڄKyЋSPfL>S21v>\kC0_5}$jj}&H#A|iB!`/@+@#*,Q~LAtN.p;>bJ!|s i \LMi+F-ׯ*dfy>r*W‹"dvo#?7fQ#Ga*} ;`:aK~PvNJ.yR|.> kT'YAAɮN~ѽ_!eP?Y4񀇓0t;~ ) A" `ۢE>:JEMgNj/.)Ypv4CD/.c9Q| ܻNMl'IX* Dо FX"xl/S "JNBoutputmatrixq#|&o?o?OUӧ??cm.@{ w@q@&8}A^^BzP@JmVp@xtGt]:G @%mPmi{@E/bz\.vz@@ޡ^ƈmƾO@?qr,q6'_@j>u4(~@e70!<f@e}eL@+@a{b΀KZ\@@1v@9Ǵ1<,g@|-dp@.Ɉ5f':Ne%i@@bԀv2m@}cu@y °a@N3F@,'B@}h@%qt@a'P`iρ@$y&Ņ@Bp@<06{Yj@Ba@)cc@o^݃1v6_@38V@ƫPBX2plSȆM[~Et|&S:Hh@ :l!:@b]DqJ@**`@۾ D@\KE@j@?KMtnSmɸO?YuQ!R@Op@D=AɌs9F-&@uguw@骑(:@W3Baaq|_@kh_P>ԹY0@P!@17q GaF\\@Z湖:@mz7~m@4K`@,Xwp@Of5soA7'u}"u% VѨi/@1h`@ Upd}r=$Wl@-CHk@_@5"%ͽRx@5ADMPT!!hɜGs҈-ţ=mbmF;Q˔AkFLI\R<'Ψy#65Cr}KTG\^ltrNTw9P:KՎW?>.C#/;vӨC_D日b9lH+RX8>N(SufK*oL{I}]x֘#@YvX7xu!JO/sxsqp"] @&{}֡#lldJ?J~`g Vk[8ei^zgVʑ,!EkHk,O; 0-X=Mn[3>Y &Dž%ɘOө0k9;Xg\ωC_.Ë݄dV6  웬tu%(m%/j,]hHӨX;kԈp7ٛM7{:΢*}-Y[HWFNu9 Ҩv^1D\LX\fc%outputmatrix$]C?\-濿6[ʁ?[rӿϓ-%*$c[?0l?ȸ(1ƿlD&! -J꿾1jw?B!S6?#(ۿnQP;ŸdA(RK?9ME:]ҿ%@rӿS% ;ۿiZY?J=(_H??:/fבҿ A?5$G N?$dV:[?g8￬4?ȘM?=]Y#^ZK ???l+E8?ĞQW?8Dz?Dj^rw',b? /m?[W?zaII h?$?t.WL? kĶ+hg?q dEa? nIX?޿ss7?A￡N⿊N:, p? S�`=?Iܿ8+Aٿ+od1y@? %4?fVψAk<4X-b@?q ?Ué H8 H@5q?|.P=?QdN6ԫV>?3dvM?vFc[ѿq>Bfſ>gپ?WgcqgB?"\k1?:hA#?v F?MA? }(?+!H$$2/H&4v?CF\ ?zUC?2JGȿ N$? ￐ܕ?ߒZ¿ߞ?<̿||ￋk?1"w?E?=BI:1ٿܣn?+]i?G:s sL?0?߷?೺꿝XFݿt%5w?ԫ??;L>?쿮]p?Ͷ dd!?S+t?Ō<_鸿ݖտ\sin_rn scalar structinputmatrix%)5K?Y?X?U\?Ͳ`\?BۻF?ڜej8?,(!?&`?fXӗ?A1?ݩ9?@Z>&Z>=Z#>'M.>$d+>kD[>bp8>Y==?zqj>b](}>qG>פ >+TvY=?ݑ?dLF?~kVˢ?8 ֑??DwÔ?ԅF?cFGh?9r?^b@MJ֚HixRClm6\FBjX|uI%f(] Hup4Ic]xn\ٕb7m}qQU^djgê6Aϒ!Mm_nU QQT {ȅA,} 4 U>6]l?rGx# oFY]_P.!]dQuA: OJ0 _ vVk:tېcܐjePzH3^s9۾RsDŰ(A[2q3-_aEH4TMyj!HzUg{dB=]?QrnsquwQLfs&}ۄ(sR"鄉ۇ,T?:rO“&Xqx û?dnp%uH=-^gZlbBGjrT'f[L0pj«wMm?mqS/_.ijH={Y>[B\Wvq[:D˾c{}x:6x=CgyAlyCsEcY܈b G'ү@~yqXX;@u7Lj͚LueՕ TF}9i=f՚dx6xkm]j`[sX, 2GmcvѤ<ƑuH$Sqd%wFxAi|$ Ճ{ C[q-Z%'8aȴgg-H[VvBL y$]S}a.KH3)TG}۟>E%M_>눲|q7\JyNdDP$ k(422bvgPDGh s p;ϧg8wWs[7%dFϖ@[_DR=DLE6Cq=?*,gA;? &}<{e?Ifm?239^~?4?\.E?[| ?X" ?1q__?қ48?7R?"+ƕ??!@V?'{P?nj:j?`1?0To)B?uUX??u16o?kL?3?@]?^ؤ?R͔ro?56=??ʈW?JiL3?L`@ ?5?9$;5?v^]mW?Q1|?7~?UR?J#?,ʣ:O? D2? "?<|j ??^O?g0X?g?]֊?MWN?>y?:'?蕾?(U"? u?}@_?JZv?RZx?S17?o}v?>?s:n*? R?R=+?8ӏS?ڗZ֧?]#ܕ?]&9?No?4)5?y?Q?&? 0?|6b?|t?By?Fz8F?\6w?΍ ?U Kzh?~?S`r @-. j@!~" @B@fh@deO @+ @@f:ѳ@)y5@zZv@d%@0@+Z@-e@\Ug8@0$t@n"]@ΒFJ@1ϑ@UQ˲L]@-MB)@s9"@k!@ٕ^.@ >,@ɛ=#@pt+@NK~$@Fڙ,@t/Y1-@,H8@c67@M̔8@&\>\!4@= 3@vC-9@Coߥ01@M;@WX4@ؠ)$j0@V;.5I@}@>G@4L@}KxOC@)GO@WkO@5vH@i60G@WB@ TF@ g_@Ƨ#P@BWٖS@B]^@Rg[@>bJ]@xuReT@ׂC\@A:@W@ 3]]@{`@=Rb@Ŀ zb@zrπm@tj@ud@Ph@̇@n@z-Wb@ma@{Rt@u@ZaUp@:k+VB@E}x@+|x@.Paz@wWq@ ,ju@}(jxB|@ ҅@>Ta*<@%aF @|@8I@S݂@@n@y乮@RSnN@at4@$1ț@Pr @f:@"MÑ@߮(@Nl@1U`@P_զ$@G@¤T&@jI1!@( ޯ@8v@_!@}qS@eYx@`@.@w@ t@t.+c@`"@C9@,F[@ioOL@B#p@8@<@ԅaa~@fRN :@WF@=Q@9_q}@N%1b@ +@Ǣ @g_@)mX*'@z@16+#M@&"YmO@@l@y@he8@ R{>@N@h>ҾQ@p\c@:TɎ@!wb f@Y@ i&@&+_@Xs(@y^W@b. @Ӎ@H@ n@|@51@V@Fgc@*L@&@bO٣Љ@IX@d?R@MX2@JUAFCrFA!k;Ad;JǁAcA7N\ADxAeZAxmA gpA(JWAfC^A֣spA0k$A|M*AC,AӁ%A9(Ӂ'AlKˆ$AI.Ap,Az%#7.A>W.+Az"3Aj?A*A;A\18Ab/=AHς#}A`E3vAc zxA/ĔN0}A8'?uAq%XpA~Qf{AqzAT9 A AЖmAQ cҀA:> fAͼ(WkAOV6͈A9AL:AOAYADžAөA^f|rAMt-A?bDA@H8A_fAJכA>PHqAXZ3wA.\8dAҡbA bk RArAƓ!YAA3iCaA)iBARF>A+rAxTAp6mA;ABe␸AFfmtǸA24$A~}MA;A?.5ӺAyqA~A,f-A8fqyAzAbӟoNKAP^A oABuey[A!:fA\64[A0sAhA",tA A 8 &A~TA1bAyrAb<%A,v)A"Ø`AA;I,AB޻0B%rBQg EBW|0!B3R7BĵSBIB|m2BJ8̩BZbB8c%B\b '[&B0];,Bҿy@'B"O|ϗ.BO.o*BGMd!B);Aj.B T,B&"+<$%B/–@B ̚B<+ BРcB|V8zhB߄VEBk9B,XUB6[B#p&B:-iBIB?QmBʗςBY? BBU8BDdNFraB(zBJTˌB\!BNIB TUBMwBm0C_mmcC%Y62CdWCҶ{J9CC$iC0C[_6C vkCW}&OC4$C"UM&C]f'C$Cҁ/C;A%'CwɅ#CF&qt-C C'y"CQl,>CgkVο9C/ia;CrU0CZ>噵l:CR 5C#$4Ch35C1K;C뜀nE;4Cא*=zKCдDiACAEFC ^ CCiKMCB#@LC+nAC4kNCqHOC.KC+Й[C!{XCIo\CϙRCw^VC,ӛ%ZCruymL]Cƍ [QCpH,YC$fS[C1Tî*aC/_lC%fKcC{ `Ch$PbCų(bCBT섪lC[4LoC7akCQC01oClrC?ƍqtC۴-m[sC2qC`#pCyyCm N||CH@vCZ֜|C+e~C(+φC526COװaCg !C& 껼C֒CpoL9C|ZxCHC6%C6⢳CXRC@0q\C$CLD|C@ ޏC \rCY ߒCu*Cn?CdǎC!(CB*$Cj\CxePCUէC/CoUq9<=Cہ3C=r$CiKǸC`LxbCIC WfCNϷCG8hC01lCz}C/2fC XCzIhC(yVSC)@CFCODž-C C91C,C;(|C,_j=C4ZOC2CP"CRx@_CM7.C\Ca<Cw_BC(3SC5 hɹC۲vCwC{CM _C!ǔC2Y7C4iԃCܚ[CnVCD CfTCf2C.]CZZ\C WC_qWC!NNC$XC:f)Cp@8Cv/vQCH> C* D9 Dwd-; D%BD +D\S DGD;Ɋ]D0!D,Q DwDDhuD<[|eDe+=D wo.DX=VDxKD.DoWDLdD5m.+D3b .DUx D䓮p#DMu!D\'_c.DA."D-~3 D>$Deܛ#DJl3D&+jJ6D E<1D܉Q4DA[2D>vJUD~7qTDeg [Dr ZDegWD7iJeDt-cjDմdD1yg"bDklZoD? `D jaDeOgD fVnDIn~zGcDi #yDDZ7{DWuDxHuD)%JpDHSJtzD"o|DXեrD~ QtD5 {D+"u)[DUDk!Do ->D1"?D=pD ȱzDUZփD”րD^"Y3DTF;D3\AhDF%D|vD;ɞD DsDCTwD~.֜D׻Dw+sKD;$KfDn:nѦDxn`D\ ,+Db%i"DDI!GD* (*D(]6kED?2)DyD1֙Z$DtSYO D\-9DDc!T޵D.8\oDtD">oDL $CD\f9DwDZDHDuFjzDFPD:NkDŋ5D,DOKs#D+D+ ^D`XٵD)\_D/k,=D|XBLDи(D!mD'z.D8 \!ýDuDoDyD}tq:D+1lD/@gYDlj#lD-ͪWD0`D)DrpID9L mDsnD%wD ڿDTs]0E Uv8EEMS+Ep+іEkOEb_ EͲyEXU E"{`EB"sIE2 0EDED"ExQAEˬEt`QETm3EH>EkekLqEZE٠)ERݒ;!$E "x)E*iD(E0꣏'EHZ-EtRr9F&E"aw.EtO]'E?0[$Em%?E4 AE:E|[ :EI?E!5E\ 5Ep\ '?E:!W7EW6Eĝ!?E~.C,bFE,Dj+KEe@E0="JEFϩKE/_˕OE IEII/ 4BEӅvLEbmLEխ5UEؔ]E^ۍV8^EODĮ]Eh;?TE*/{_E|eYE`T~RE uWEv&SE[z1u$fE TknEϤjEL8hET3t]eEӟecEb V.dE.5=jE9A2+#nEvQoEW$qE8{wE/lNhUpE4(xE pE|y.[wEn!wxEA7{Em7tEXS* {E־4¾)EEɫE2F#WE)]}Ef_6ELXQE ׍E &\ċEηaEΠQE@xuSEʏEd EPgԹEsދ\E6ٕEbEx9hʤEC'mE¥$EVC٦E_EfEI5(ٍE&՟ȳEo"MS E'EUoEtնE LIE,oE7; qE>EEER(LEE`|7EXp[4E(:e EJ6Ex6ًEd.ZEC-ZEEh̕EV,T`{E%i}Est EjUEf`^FE2%zE!L+E\+yEgYf%EUv0EK 'S.EqNrE-9mq=E=O~E\(EuO_>EAWͳ,QEbER.VEdEU={4E{yNE07rEzR qJEO`@)Er-EPEնEF\ F(<%F>* FX4{FxSl F~ FWЫkFF2FpF'vF= JFQF=~FA_ݷFVFisR>F~FGa1(FBN?Fd)^)!Fl+1s&Fݵ4'FI3/FسR,F*tAn(FvUK#FR&T FP$F7l/*F}ܯ{f>Fbژ3F2 ߃=4F80Q>F֍8FYY7Fo>;F*9F,'C?F8З4FԓBLFQMFfT%MFFfOF>m|hNF73&@GFjFmIFcN^DFGF걘GF !3RFЦRFOyFrܞF2mF_QFNZ|F0^RѭFKBF T1/GF -cFFsFH,n^FRVo0YF?YFXFkDyMqF3WkFuHFH`PFSFW2FCF_F\F'FOxF> uF+>1FGCFa FsO FӥFmFOFh?FVW^Fs~GTUfDG\euG K Gdn1 G ${Gp GBGν GGL;G̿pGuyG?'(EGݠ{GnaG.#G<=GG*GG=A%G ,GR@H5-Gy%}))G)[-G,G#nxi&G}(G0-G ~/'Ge|)2Gi^2G+ 9G@^u?GM(0Gl_Z9GD2G,1GB et0Gnઐ6GZ4"/HG%:LJGRTKG0:JG<,GGT)CG{a+AG~EGyOGACG\dR[G0`_G9YGe]jUGP VG˪$RG$/XGrHֽ^GT;L]GzJ0SGf_`GCbGP KfG_=dG}LkG&z+,`G,yeG8OeGa H=`G%qaG?Q~zG47]qGH%"rG.}GwePrGs:XuGrGN`vGdV}G XxGI(G_Gǂ?G~%hIGkIV\نG/ȯGf|8Gt4_GssGb?GڶҼG,O G@G GUGO#NG{P'GfmGrLlŝGjOG0 GwG:p36ʧGG}mVV G٭G-ZN8G*SGf鹳;GP Gj(G;FR?GݞGdj棺Gk',AG EOpG Ghm GD(G}NTg6Gn7dvۻGT`GH}$>Hzm(w6Hb;3;HgR MHXF!bNH`4fHIHsOJH;`wHX-GH5"HCHҰ մHjF"H4mH@wHi_mHj 9HEˁ+H(bHЄEH{yrTHt!H3H<)pUH)H6S&HL'`-HS(Q*HW~$T>H HY-H8 Hx? NH[ =;H $SHl'H8~],H a4H EGHi^yH"Hh HXxpHOH1NTHb0HOT^pHMH H IJ̢Iwi I/*I Jg Ij0%Iw{I㫺u#Igs IGG I</IDw SI:QI$SCIV0I`ޅILIWzIAJI.![feI}+%I H!I@/e/IL-I[޵%It[iH)IR+I&yM!I!I;8%IpUC!09IT.UN1Iݾ! w1IK)j3Ip8I_*5IcaUS:]I-~2UI`=l]I qלYI@ cIC7>dI@MlI$M UlI3fI7WoIPB)hIMjIT%aBaIu`I;{I(X=?4wIr|IWβpI5"V0}I'tIvpItKwIL+zI~~~IPX?Id~:IwMŎIqdI9CI̧ޅIN7IΤIJ߉IIP"I0i$XGIWcNIY~I>=&I؟ԓIR3RI%Iϝj(IAIz RvI 1I/IUUFIU[ Iq=IMeI~OvpۤI۸IBTߥI+qlNI_IڸHIrYuIVI~ayICKj*IlԸI}WuֲIОdv\I4L0aIIqIv*I<?IFOI[/mKI0#I˨:I_E2[I| yI@IK͟IpR(IFIN'0IBsI~aI r$`NI2?nI_إ FI0'I/I[USYIly4Ip!4Il؅-I-ASrIط8INGfNI,b܌I@&IXQI6Iͳd*I+GBI`Æ:IVnZI tI|aIyJHIpIbnN J~J JrJZϚgJ}N1 Jq4#Jh q~ JbbL J9ߑcJK=J_JDQdJ"JOzJr'UJQoJ3JQx+JG+јJ"SQJIv{"JĮ׊-Jڙ+J {.u,J|yJ&JZ&22JM8J2H9J!>JHщ_4JTXsN;Jz_<=Jabj_DJZ9FJ:?eEJ)CJ籖 EJ[a CJӲц^Jt_w_J^VR^JZ죈PJ3=kVJqqnRJr_dm-WJ/^m^J7grWJGҫYJjHzkJvWlJv/kjJMKXG!dJ o`J,(+hJ/jJӿlgJypЬ`JDe)nJ vJ> 3uJBbkVxJ7g uJ}JK{Jzt wpJ=-yJ7KvJCz!uJ%rćJj7gJ=TJo4JGbnJ//[JǸRx~JZ}JK dJc79Jni11⟿JHJh!%JRJA`)J?HJrvCƬDJJdJ:^J*%JYJcJt0J. bJJXqOJTJ9vDJ0)۟J2`^JGV1Juu#Jt8. KyXn+Kŵ>[ K6KLnCKw Klª K;~$x\ KXK0=t K04%KN|hK䒯~K^KăD]K6؟T7KfyPKU"KlFRKfMEKim K甹L-K j!K,Kao!Kn&K𙭪U%KRNW*Kfg$!K"Km1GUr?K~䞹7KȖ1K>|w#+V2KN;ha=KP|G4KB0K؉Km>K G kK0&7KdKa%@K@_fK#K`*v(K TK5{gK?7Em~KYMKwV_Kq[J8KבݴK; @2K)wIK2K~=2Kr:hK\Lp23Lv#2L[4L(L{0LB+1F0L?LIoڒ8LbyN9Lcf%jL d&eLPX'fLb~pgL*:oLawnL)_gL=ri})jL>|-gL`dLT4uuL{$vL2+1qg{Lpu5uLtU^qLLj߅~LVtLڔ+xLmd&LnY|6tLT9ryLSC5L׀LT?u2LdpvL%VDdŎLa"dċLV1VmLR˷L/Fպ LC0 LHmU4= Le]n{vLA2>L0+ML?؝L{/ LZr+L%$õLO16L.ԯL QcLEoL3*bL&[LX]BL D _Lt͕7Ls}芅3L\༉L,mU҄L8vLUxqL*#˸L<La^LpWc@L8uFLH@L˜L L-_ c:L1OzLXGLRi`oYLfŖ.L7Hbp`LUzLDr'dLóC[L~gLVP GrLgQLR].L@-c{L~ULXbAYLy%}8L3YLه4L>gLmWLQ.Lު1KLلt#L7#tEL>LEd\LA}Ls~HLf]LL\LnjL|E$ƹLhƛL&+5 ?Lml|L^۔L\?L #\L˂bE M 4|M`; MH'촇MJ`E Mm JIMFIM! MQM׋ MGM&/M8#Mx!zdM A1MPM*u{rlMXENMu~R<MTMt' ~t(M4YX M Tq/M\ 7+MqٵU$M4&M/X*M#eK+M8Q#M( =$Mp-:My=MY8T6MWE 0M0lX84MX?MC$>2M81N4M6M7MfOM |LMe[IMh$YDMw:NMќhJM&OzaGM+GM8~~P LM>'}CMqǮ_TMϭڕdRMU!PMV6m UM=U7UMy D RM(oPM\߹ XM?ϽQMh`!YM_@sfM/yBfMF)hMb|fdneM5I;bMHM|[hM-σjM˓y bMm~N1iM͊E)aMz#M5ϣ {McmUwM)&4~Mψ%WHxMPl5"}M ѴvM#^6|MpCɬ`pM|MHdȸLM*0MkWM)E/Mສ∌M~xMM!M#M Է MG>^ PMj(I8 MVۨM^,$MM)S3McDMY?4Mv2IWMX~KMÍM WzM"XMg(̈́M'?NtſN!B N$l Nj`N ^ N*m;NCǾ Nr6NԵ_ N2.3NlTIN= [ uNn?5mNbخxN ڠ1N|ЈN,*NtZNN'D+N̨ ܗ*Nզkr&Ns$NU1$N $N$3~&N5-i)*N50"NV8J-N'>&N, 4NKIŬP8NN|,^q0N$k?N xoXd8NG&K;Nl#q=NM:h#0NJm.;N-ܕ05N/GN.jENKHN@Nݪ=yFNA dDN:ENp[FNk-_LNDn3f@N-HzWN~Ǥ:YN*k0SN \N*Y\NA]NF l8YN)CnQNLjYN2#`^N˶ɓbNdCFiN80(nN4d} dNNQhN"׫!mN6q7-kN,m(1gN҂>=CdNfNAtN8OQT3~N jG.vN=}Np؄wNu]xNL~vN.b'zN 2tqN%^zN~LǁN/Nri5߁NNuNGBNO N*S$*lN.@N]@[NJXNd֣NNL%N6fG(N*/+NlhNQf)^N =DN 6NAūNAzS8NﱦPNI(>NSVVN+NڼN@BN?+NbLNE 5INygNEN~ARNئ87]NS\&N kN\b CNLꌣNDN: ̳NuNZ-NzjNNN{NJ/XN݀eNJl9N19NZ7w5NNoNSYN8PFdNnْNpN{bNNO"NT]sN58N_ +N"2NI &N)mNѼ|Np^ NXNI7 -NʮNN&A OK  OY IOl(+ OtCO먮YO/a gVO8''$Oma@G OC`=Oh#G.O iO)R@;O*UmOfPO,aYO]pO2PORt*O%}lO+X*O(H2\!/O8c'+Ov-O IP)OPe(h O,y."OB x$OG,/OXRӀ*O% =OL:O^?O 0:OXM?OÃh5OФ5O7O 0>>O:=O9AOOO?BO֔v!LOr-HOs?ENOĩf/NO&IO }LO$;KOJl_OGXO^ONcTObSOl YOX?RO9g8]OZqXOHu]Ok UOoInOgCeOU'2heO)F:NcORE {lO.)%}mOriO'#GaO -AgOkO45s[yOӹxO /ߋyO&54}O j|}OlUspOϑQOwOlAOˬ%5ƫO`7VߣOg'gOX>FnOڟO)d0OgO2NOJՠOI%OtG5O#yO1#imfOЄz~aO!xi}OA^OAږfOGC.BORO"ܽO>OOXO)LOC,bONx)OO O!O`+DOwRO'>O[Ovo7Odr+%P-r0.P",/PtjS(P|F-P`#Ir'P!D2VS.P3B-*P.26PUI>PʑL9PF52/|P$n9Pכ;PqFQ5PcDD5PFbUHPNj3EP 0w!MPdX!KAP{?3OP<*LkIP/uNP`JPxNPgYDP #VP\oi]PP:UP1LWSPz fQP}\P%R&)TP|sUPʩ PG[P*2XWPզ,nP);lPzUlcPM=eP.u¼iPػhPZ5FdP WnP'.gP6I!aPK6|P(y|Pvm>QsP a{Pnp}PWo{pP1/yPNiAuP9xP?t#N|P[jP\Ʀ:P}T!PoiXP0"P{:Z0tPĭLP4ōP+8Pr`шPޅ3P[hjP:*mPIO ]2qPj_䕕P+pړPa4*Py2PXQq&|PÖ86`PP+X@PxΰP,&UPPP՗D(P¡#}P#PmNP {A9PIXyPPPUP?7P$\ P\~_PU#P ptvP'}AP+CP`5D.PZP@EP3_gTPlPμ0P\H#P@іPƲOkP_ Ph\̮PLB3P fPLy5?+PRLNPS~PlAlP8vхP6]극 PMfQt=5Qb2Q>!f QNO2 Q:| QNشC" Qh^ QBM7Qэ2CyQ^TQɠ_Q!Q@YQ\-QyQ('QkQ} r]Q Qh(Q6U*QH*%/Q/pR*Q| Q"'0c.Q6Kz}-Qx)QѼ<&q/Qd')Q|u95 2QHD3Q̞B22QGR{8Q9Q1a8QSmZY5;Q֟Q;QǸg;Qᚁ5Q&e%@QpO!NQ8EQRnNQў>J4hAQ.g;NDQ R8HQeIQLMQ7ZdOQQQ&pGXQ $YQ"HUQ/k?YQ0^QΒJ[QJ_QHXQ#9QQSaQI5fQ/kzhQN.eQ}Ε cQC^HBlmQPMKڂiQdkpKziQ=-#QhLOQ{ L_QCbtQk>Q-eٹQQ]pQӨ>QxXaHIQľّQ}QƨRr`R,w R#zK0Rĵ ~ RH R$+ RpLokR jtR7K7-Ru' RyXrRq&RsORYr6Rk?SR8R#R E?V`5R?KtkRdV&R|))y.Rq,.Rӗ Ru+R{M,!R؏#&RNZf !R`}#R\W&Rrb u<9R2{9Rd0R64RK*8R*&sy:R&9RELRP|HRIFARȠ4FRw GRxLR׊IR=~AR LH@R a.BR,CVRAlyYR3WRӜ;kXRhZR"TZd]R!AT6QRYiPR_ǻZR ;)]R|LxeR#jRj~blRNI"bR։DdR1hRvc`RD$a`R jB`jRHgRږ/rRpxRcfwruRKY}R_~R7G`JqRho na}RuR3 uRȈ4dvRiO;JRGUR:QR2*cA܅R0oiMR%Ͱ R}rBRB랋R"YR)v{ЏRcRb7uRR%3 AR8BRvϨR@ظ ҠRr֭ER$2RV%R$ [6=RG+;ƽ*R jCR:.R?83R3RC碝R9zR RX"{RbY|R[BRN$R8jS9RHS RR<mm:Sa'4SAbp1SYv=Sq?d6S;k1S[~4S=DIS~o;nNSe(Ʋ@SBJS' Z[SOjS oS֒?oSޠlSxd`SV9M!=dSkeSR=+qbSf>?JgS>kF}`SƒȭrSH9!ySw5ٖzSOe:tSy5!rS`OV}S"ϝsS^qSȟE{SfsSܑvS#OYNS~ISuG~SPϽSE( puSεBnbSc@bՆS"zSk+SKS"N/S)ؔSZIfS]7קaS=:* SyOSES=(|S8&)٥SPxSn9>Sp:3Sf[wWS3ES>eaS7 t> ŪS+miSpPSfMSGȑS g%(S.kSSCPaS:TzSJ{S GvS~ SE/BSSZ&\SO'S̅2Sd:S4NSnS4S?oSASJǚShJFSRySjlSSAH> SK5SSXT5SCw2S,UbS[$$SuGSMK!S#*'S$ mS) SczL+SSisSPo<\S푪 S/S7H|S?TS`ySuBTS؆6Q4SR*+T:ϭTE£-Tk={Tb^ TdT3 W` T+630T*zpT71,I Tр2AT @TuuN:T1GOT)gT%H4T9;$]l>T`_i,9TPr=T=7Tgm3Tm'11T]u2IT8Uc{KTc*6sDTNDT&:KTH}>(ITktySETG.OLTB9~+MTό(OHTj\T~r PTXXmXTgUT4\g[T/!UTXT]_TPG%STEo&bPTElTn5٠oT fT*gTnT̞xhT$ES:oT1p:aT" eT*(=hTnbUa~TCe}T˪yTA" 2xT]R wTzT&Œ|T.XvkV}Tʙ%{T13pTg*TIԮ>T<|TGc^|Tb`KT:TWT}CT!>+ThK8aT2=TP"SnTӥޕTUwT/cT{l4T&@V}TmTq TÒTuTȈHTIT)7MTwA]Tv2TtԺiTBBT'}BT-@EƺT VJt7T.T>=ǭoTkk &tTuqAT/TpP4T3HTq,TS1TRTկrT675gT"pRT<TTrPđT긤JOT/##TTJ1֯T vdT9oTSp됟T {$ZTVA7T pT']'*cT(ۃnT)vRxϻTzTzH-T֏ _T 4ӮT=̈́TBTJ-t(T"\@STbT{ TLF~ToTT3/ Um4Ue-UuUqk%UA U- UUfRoTU- BUVζ]U(nUƏfU0ōU&rEU ,[Uz 3U7^UZU3U:k7@&U<%U Q U1R 'U@kt U7=&Uω+Umd.Uyv)fU[0hkUOukUbzlUYi imUZuU"8|UuUwU]]WsUIRvUvGxU}l|UV^yUZyqUUޅ3XUv_Uc5Hb\UfCKvUa-҂U|BU/2AU(ߝUbU'-ZTUу{(YU5U`!UCI~IޙUmcU(UtUr- U5Urx0cUyU gU}GUρU֐sPUe[nU.@UT pUO6U/% U7WGUfU)UPzU!ICUy:|U4^&U4<Un2#TKU]VUm 7JU mU_JfU$ٷL`UMUl=JUoU˾Ug£Ubi!:UwUᒰC U0 + V̂ VJ=VbVg/߇V1VF|V̌jV^"@VP"RVJI VgVūOVƛ;-VJ8ZzE.VJ~,VЪs n)V//C#VJm?<,'V.`-Vm'_'VI V_7#VJh,3V=V#0V 5VB#76Vbx8V"jH4Vub>VG[5VK8@7V\\dGVVzDVT+EVPޭNV2 gJVwh/AV蝫BV0[IV7#h+BVcJFVBL|PVЭ?RVOfTVEEXV hYV$]V!,߮^Vtt UV2eBOQV>a¢TVVcV 1lV(2FkVPփnlVPeV$bVlP[doVTaVl˾lVkCqnVAmuVE@sV\(VJ?(vV|a;-}Vj'qpV R;TrVfޤ~Vȁ} }VN}tV?4b)[V9]]V3qP>Vr m,ǧVu)NVLrƪV1V×J@V;$6TV%hԍVD~ViV= ) V mVT^ *V`ښVrJV*y VZlVFrV4pWOj`W}w-W4WWG|ZMW$曶WwWv-o)W(B,XWՐK~WuPW gWYe(W|xWnM#WP.2WY%NWD1DWP\WٔW>]W>2W}W I"Wv}"}WBvW2#S}WCPW|psW2Z9 gWۅpWYW^TXoW"{W*GWn0=OFXC)}NX,NNX&X4MXYMXpMX=.FXaD5BXAPGCXzztۄRX}mWXYjis^Xn Ú'XX~qm,QXmRXSbn6\TX~3r4^X3O_X8TQX tFlX}JX mXkT|fXn#`XXLU 9gXggXЈOClX3v3aX*ia&mX^ lX] }X0l[$yX9JRyXOpXNRyX{A2,y|Xd1{XޣaErXJ>5{X.ܩxX؀X.~X*j_XIYMXA~XG_Xtv:X}ˆX5=DX2VXid&vXIXfhXi/TSXUKX>ULX?0SXN؜X^PגXZX?Xdu%XHXĦg$h¦XXOX'ЯOXvdXirXI{@XL}?XDXX󣡻XHvX"?zeX58·X&nXYh)X~XUulXW[HXȄݹX.@X@X'tgXpzXmlXXN 6XAE"XdNrX)aQX'ZX~lX>cD@AXU4|UXXN /X|f;swXZ~Ћ=Xsٞ8X>hdڋXXԿXCU~X\^KX JX 2֦[XRXp}XXj#UX@ XFA]XpS@<X~Z>XᮊX:BX 3Xv/YfߛUY{NY3&+ЀY YV [Yۓ)|YYSlY2g0bYɦqY܎bYMvYZXYx/ dYJLY|LtYE+-MYv=)JYm.|Y,A&YOb, $YG'Y0*YX%Y(,Y;:l$Y_ޓ.Y, (Y߷+/YnU^:Y)uK*7Ywb>Y-DYCGY\.FYd=jzCYY8NYRVFYX-DmIYN6]Y4,#\Y`\Y !RY5hDRY Lo_Y/̟5ZY RYa>]YJEIlPY@n[hY: [bY'7djaY`YoYNnYX = mY"3kYVGrjY"bY{jY.;~Y`#ڥxYxzYdY{9|Y = v|Y"{sYWfrYP8sY&űV8YXVKY8rYJ!DY?Ӑ+Y _ Y|+4Yz{Yx10YsY|WYzYYYn8[Y@5ȍ`Y!ӯ2YC/ ۉY䳯YDZYԼ^WYtNk׭Ys\.ΡY $>ZYߠYY]ϢY+ Y*{YdcW5Y!YND\/Y BYB% )ܾY eI rYS'Z^ɱr:8Z 9`!`ZXc{ZDc pZ`@ Z3|ZM`">ZZ?bgsZ вyZĺ-"yZ ~6}ZU݉ZX<1ZxZTDjZiZ.U#ХZ0جZ4&L Zb@ Z E`3ZBZ&Y^&ZOGZꈢɍZh-Zx(Z~;\>,ZrK 1ZG@fuZuZZ!Z?QʣZ;ZDZ4RZ*uZt՗Z"=EZГuZv\!Z 1i2vZ@踳ZfQ.OZ-Z43/Z *ZB^ťZF'Z@qZ`k>cjZ6 Z A7Z`$;ZGZ?Z*ڦZI%ۓpZIZNZ -Z>ZL Zs*ZoZ"!ZEsDiZEtZ%5DZ_ch;ZzsZrZ7gTZLғZ&- Z`Z1Z9\erZRNR}Z ]3Zt 8Z:Bu0*Z2x Z袢nZհZ}Nr.ZmZ7iZ~&Z4ZN}&Zrm6~Zg*qZj7G ~ZhZ{M[lP[Bh.}T [$Oݖr[0 [+Hk[$of[7E8&[5\Mr [!&[TX[[U[ܙ$[ [xښ[t[8S[ G[OB ][Q[fSL.[)!4|([hX$([`,Y#[I})[("[ *%[q ![=qUk'[|"[l8[ 09[!-4:[9[ ?[mSVI0[_੯23[:=[xH$C<;['K1[\2l`O[whpO[@RώH[1@[S׶D[e)whK[uuLrBH[ >'J[46G[,=XA[vQnR[=_["0S[(_[-X-T[TX[,MAZ[>yR[9,½2][ڡ#VKT[ bj[qQ1Il[CW+n[ .ud[sh)5f[G n[:K i[s- n[ynDrj["b[X {v[ E|[%a#u[f~[z[~r$x[|tm|[Oz[2~VLr[Vv{[,u[^UA[SO[X` [:N_b[5N^[A {y[[sD[O=F([6xG3[A#[hxS[x]L@[0!GIz[TR[x䄞[Fܒ'7[2*[F3y[O%6[9[$Χ [.+[i;o[t[Zg^è[X[R&ݮ[$^bߡԧ[֠_\[|$ֵ[汵[I;[Ph.][[[\ȷ[FБ^[lO[k ,[RI [&Sא[]:x[w+[knvIW[愠(+@[tj[4I][zQA[Ȟ@[gT[[?[/[* [eώ[&[%4t[s^v[>Mi[84E[FL[ s /[R-x[ks?Z[j6r[ [ia[6AcY[6c[Z[~0 [\[AD6[\_zCV\dM{\rc)\GS\U'*W{w\ӡw-\ 7"\S \&1 &\& q'\Wx/\34#\+o!\l#|C/\'quc%\p.H4\chx#0\}9\XdP;\8O;\C+|2\O=1\q18c:\f5\D{0\2KI}F\ąN\t/u|K\do '*tM\zG:L\4UG\66@\M G\ N\07C\tNS\7KV\R#o.0X\,ToZ\HFsT\DHmV\P:GV\VؿX\IUY"nT\AkhSW\+Sj\v@(Ud\7u#)m\IW;e\V2jg\l|=zf\ g\hLd\mK`\\+vj\<^y\g}\pͯor\w0 L{\pux{\0֏?yy\~Jy\p%Fv\٠Uڳty\x\j\P-5 \Bawy\9bn\R#Et\>߭\K\v/q1\E\`ڀ\ʳ$a\ç&\rj-͚\v;}\`p4h\:Wܚ\p-\b`F\(B \PX}]-\D\wZ\P*ح\,\b\ ,\XP\=%\\4\B,Z\I;n\|Bͻ\D/D\ܰ\L/Z\,RQ\Y!\bszߵ\cb\䡴\S`4|\8 \v~ߒ\}m\V=z\TߺJI\C)Y\\Έp\oM>\*3\^Ag= g\{%v\ܳ\A=)\\_\2M}\uRp\/ Q\ʏ6\hyɞ1\a\ u;\s{[\F,~\TZ]o\] u\ej-\d'I\9N\lF&\4ǻG\G|\qrL\4Oe\3U\XSэ\0 fk\t\*MG ]yz2] ]T0%d2 ]n ]m=].]=p: ]*]*]m_0]5;L9]Sb]R35]jDD*]Hr]Jc]3Jw] E:]R]É%]f%=#]&,,]x@S/])]*9 w%]:SF .]EԆ']iʰ*]V3+]ÓÈ1]Îlb>](i}8]*E~*<]UML=]ŭ%2].iS7]14:f:]>Xabj0]L9]ڴ@E]A-.hM]?~LI]F*`8xG]XQL]VȎJ]Qj#,H]jA%|NH]20 @]Q5I]n7]]iMjnZ]}]]$[]8T:0u]ٳ`]b$]vEW ]AWX][[]JfT] 5]Z>M]b]߭]z]LgN7]6F]-u]Z]/ף]C]MVx]~.s]/]|Ly~]ռD];B]^]͖"^~^$Bkq^ا`^%.((^% ^bGl@^گ) ^pN֐ ^=J _^KBk^04j^mg^?TϷ^nrn^&'Q^`Hj^,)^7~Q^֥- ^,qꅠ,^ #^Tj7Mv%^y)^ ~S*^;5SF%^?sd ^ ;c.^~@8^虴~=^9Jha0^ !$8^6 \ɔC^/HڡG^sI^-8J^UԅkC^GyM^bA^B0\B^]B^ǚM^kxU^x}KV^;X^FV^cfpY^oXAP^ks_^y;!R^b?^^\YLT^N&Jd^3=a^O+vh^>Vb^%g&v^TFAw#u^&)|JGx^=Bx^ijVIs^Vb+x^3D~v^|fѐ~^'^qIt^[ COK^ "CB^6"6^ ۑ&^*5/^Ci^z6^w^ȟ @^~Bz^ef_^ /v^HaX3^ݚ'^2O ^˷5͐^ȵ#)4^^38^huƙ^_m^i0^YDg^"_^f@ ^Hܣ^et^^\_ȡ^Nsڦ^Dh^Q *h^^**x^C^% Fܿ^N(^: R^!^P3Hu^w^n^Ӷ +^i/^g^${1}^sT[^C&\o^:'^\_^@A^zy|^!^pB^B^4O^l^gf e^V#̎^*Ƴ^X“^!@_8V8_ !*wO_v%:%E_ӶlB_etJ_,VM_Uc\'G_0kM_  K_TC__0H_u~3kyGW_H#kZ_ޫ6]_QY_]CeS_0NMY_4e'pY_<@vT_S&)5:__E>SR_yBf_WIo_ENb_:Teo_5rl_ l_b_l7<i_Eyh~i_;:e_Nl_fƎ){_'q Bt_VKuw_/E}_3N>{_Sx_LD3]r_gpp_>J|_+yq_Vs_6)_|稧_+ _C _ )_R_(Uܺ_꼼_d$" _o1;)_A z _t-_";-Ia_-_`l_6_VHv_3a_!ʫ_ϛ$T_ 4 _\X_Bٟ(_*[ϔ _l_dV_z`,us` Zy `87;t`jrt`H_ ` Sw`Xr`}}Tq`|Gp`:F9`@`k1d)`t `.>K`:gGE``\#˅`=%$`X-!`Jj`OCH`N)`wг` #rӟ`vy=`QA`4˔`OQ`|D6`Π`h ` y@`>R98`{$`c(F``ب`L7LA`o݈m`D>֢`&^`O8`2?2`K?̾` akñ`lB(Y`NB,`5⧻`Ώ܅`DUk`P{d`U`>}l`y`@ `^y6``&D`qĜ`,&A`~U`F$#`&P)`8%*`Jva`e9`=fY`$`e`=`[nm`qC`]sQ`%}2`hi@]`B'`*8A`Cj` EJ`$`d`[9`I`^=`27``٥iI`>g`T`;! `]`ޚ`Y a{n. a oa$Uaڈl ahWF a^aI/9Wa\iajH꥜aLZGa3ޖTa.%b-Gaѷlˎa9NaŇ a$!a|Ӟa8~d a8 eS4ab/an *a[|ٍ,aLul(aDJ ar &a?[~wU&aU'aH8-a Qҋ(aḦufaG.,8a~@s6a_<2aP8aXթ;aXg9;aUSž6a}b!]0awk\AabivNaM̻ BaaIa_TN)Ga[Fa.1"ފ&LaeeIa_y;DaHX3VHa8_EG[ah(6Ta/&R[aA&ZVa{Xa;]Sa[0r9]abo{\aZ6\a`kҀ!W\ar1oa#oaBwP`aK{ ka FHaa-r,baT}Ƽjawna|OgaFEda?$p{atisipar]=paoqa82wav~xya_,qwaVa|?atjʺa aƊa $a&1QAaؿ"za,a`saa\qainXaY.aJg{a!ac ai9-aLk[ՠa6a.%}aHan#Da(~Nta4aMuPa HWaQrDa"AaxRa{Gan?alQa2aڷ6a ba.ȬO|avAza6!8a3Bۮa?ax(av@|a N&La1!a3aj.7a\<Ca7a)cXaa!acaWav޼aШa Dia^Vaxz=RacJa͟4 aaZa8SakVp bPyb& bL7ObcOb{n4bYbޥb*%, b{.Gf b7ŗͧbnOb❌b? D¤bCxb,.Zb}bTUۻwbib`fgpObd bN~&&brLRS*b`lG#bH_)bZ/bxcV%bV7L'bDʩX,buq(b>|Gz:b" T5b#=b 2oE:b|,' 0bB;6B;bNv8bfN>΂6bper8b宸s4b6;4FbWncAbNBb>dsHbwS@b^AbБsLbD3NbvHbtmԫLb6R,]b"~ BZb\qSb rUbd~p`]b4+xXbB*Wb u^b>A%Vb"Ȗ_@Xbtn 1hbcb(f&cb^lYebB{٧mabw/Ikb&0QPbb&/ޢmbҊfbm( ?hbI,0Zb m^yb ,9b9tb#P}b &^wb6$>jK{b%{tbv՜tbL{b@-b"~@bCbFqb܄&ſbf1Pb3уb QW`b!btZbۇ"pbL=5bmNIbޞb{O×b #HޚbMwebQޝbv!'b1Lb bdVc{br] JQb,{˴b ↝bƢoҦb?2_Ab #b%ATb5:bhؾbpաb#^bhb͗+FbdSby bSRbsb1*5b^Aq~b)C.b7FmbfQUnbҫ ȭbobbZrWb^eSGbcVbUXbl&\bZ1b/յbL3dF?bbsby%3bjJVb*b^3SkbLb~ bf*=ڙbxbUm#b{b(`fPb,bb_]dbxb6^Wb@8bլpbIbUbzsbábҭiboAbZrpb9bAbN X b bop.o`c奇<c6-5 c=f c?|K(0 co. cZ3c%cYYoc\cHdccqm;cYwcO#Pc=c5^@^)cTjcM}ac252c%o&c2®\!cpm1a)cF&c%cZAɒ-cJ8d1(c|/m*cNɍI29$c5`.e>#cv̓ջ>c*28cnx9c0I1cF{uHcb(v7ccm8>cd>cܙV?c^1;Ac[1Fc? LcX>MLcC>pKcCDFcl|Kc Nc1-Fc80UMcvpZcfu0Tcxb "Pc1=_c8FVcom%\c@̉=\c,A^c[W}YcBBVcDڤjcG&cv]^c$hHcg^cx4clcVƝc(`Vcމ:`cb'c&ƎϚcj3ȟccVcPQcM lc0՞c'Zc!%ůc}cGCOvcMYukcx߉OcLUɮcRc&C2clvc c00&OceccLcǵkc~/Gcac93)cwc` Hc[vAdgB؛d=d*.b id5|g+d).%d O ?'dmE!dU,d|( d| s$d~9I-dDX"d"q)d/l1dw5hO6d:6 79dGM?dpAQ9dcB _2d:-4d>5dNS?d f?dltqNdmTIdbnEd%7AdzpcnjFdn [rSGdƸ Ld:yGdfQv̿Ld g8jHdRYdFez]df`Ud>eT#Zd곶H}Sd.d~7Pdx['[dih\dHzoXd\8Ud nd#Vod_ odհ݁6odGXodXsuhd*0ffd ad£?h3jdcECUbdPSQ'krdsS1d`@vѩtdeAX{dˀ?dwdӚ~#udaFd@|d pdvMDtdl$czdYCʜdjyadh+ird)2d*yOdӵFrd ,dM#d d8!rseݠ, eڷ%e?eYyXe^Zer e'R46+eC ݤeJ IT<eO]ve9~݁etl&e"Uؘe : e NQ|e9q#e޴cYe$֎eoFoeq$ePz@r,e K*ep4ЗVT#ei@/ee/eld!eCF #e#e #JV9+e3#У1e0k7>eNe_2eO4egę4ez70e z E 2eD7r.6eP&`F5e cG2eBGLe&jylHeHAeV7GeG]Ce:Be0\Aer=_wDe͘ӸEe[Fe?FVe4%TTec%:Xe(5qYeGVXe4;Q Ve UeƐpReaVeVWerrhe@i^meCje keSd-feT+ǃ(iemnge+8neog1Siel=oe8V@yed-pD5ze~L|e'ye (Bq~eKȯxe_Nrze.8׸we%D|eJ@*+ue`3Fe1eTeWֈecJݙe6;[e3XleY2YheSTe-; esex2Me7(ed:ob Ve,ekttﲑe^1MjeAee.6XweQ=]ev^teyĭec# 8DeTMaeBQ)b0eZZeoeYfe,菩ecO\/Ee+KEe?Cae9,'eԡc+e.@e ?e1er[et0C%.eJGeK&e5$&e>e?Ze ЛeTVmCee @{eA˭xe>Xe-Te!Geo-`=e \xeU e"ȏ e$uj^eCcsYe+ne(~I#2e|};Ee zelPf}e(k&̈epqO]YeGa魬eטDePee](e53e% Me1ɨe,@c emTeIep^e#eȉev5Te_Dkf fE` fdfE} f"xflf͋:#`f.⣋fUn7֧fKgfrN=HEf.rffJf";g7f׶dfhGwI+fQ*1(fwffzS fTf&-QfVu[f2Vf OXXf f?VefzdfC%kfM Xkf@4gfBPdf$dmfWnfWcQbf#}cfY+vfiu Gpfzfu}f@ KP-~fyg#yf$|fb6 NfhP9~fQ˰}f$x녉f 5$f^iܪf'k+ׄft诌frVPf`vfҼPf^~9i:fRUf@f޼fBmf ffO4x$ fFafֹf\|ؚf05MfM6f@gfbYyfO.f*Ԋ'pf,fotTfZ3Ȧfj.f_f4zfqAӑf]Mby㺱fpdfrVf\Pf~6R`fߪ$&fU2Gnɞff6zf""PfŤ4ݎf.fH)fW{fiUg qfQ9mfǚ)8fG1 \}ff-JfU5fSf bbfD y'ff#df1F`f#Q\f߿ffd1 fÞ xf蔫M+f@^xAfEufϸXf y=fOf3kwfJ(>14fg2fĬkfD]f2f~ j$f3Դcf&f@֢IfRf*5'fbg0Zj g㽲JvgZjgC@g5K gbEgFB\<g6Uy gg\9g|t4gxw4g4=_fDg}GgKDg:puIg XFgV(Lg#mNg1FgܚnKgYnHgWeXg4ךSgTGSܓVgZWXgqWg79TgzTgǠ.SgZ!cUg[6WgA&|hg6UQngp3dg>mgxahg'8eg6nqbg(| lgA _>`gEog\*z,wgM}gH.>zg M賸zg*~} sg Dj2qgtwg|qg\KsxgDXЩvg`h!g\PwgAU&>gBg_ߌgqg6R:pgY#gΰfK2gHRg uge=tJۚgA,U]gRg[igg"vgRٜgf̔gwjg `(VQg= _?g+Rxg!NgbgڍHgֱgFagrwg"|\}gOgْTaLgLz'g2@n^1gs&gVt@-*g bSgeB|g8.goB3*g]DItg o+gIo/gOsSgڃOg%{/g*KgDj­g=Ρ9gOgm 9gggxJgcEg{BzjgbhՆ6Ahff2hڕr hx(p¾hAàh> h S6h0lh&h2OhyFh}kS:hضShv"h:qa6h$.9hp0@w6hC9:1h?RvI:h}:h&= 'A>h< x0h5jFNhb7nHh!¿Ch>cILhUhLho XKhlNh,ZJKhSJP*Dh;@h.QhL\Zhl <[hԧ2RhlVhY0EXh2 /\hfWh[2j^hă !ZhS쉭P`h >ahA_jhLZx`h~/e`hlh.2^lhy"chcehchn$xhT%thj*M%rh @euhuy;+sh#k37zh.Xuh,4}h|^rhaf3eh hiIhznqh뢣یhs h>ƒhr"{يhU`hxnzz=h#.;h!z8Xhh)hқ\h#;hjCw hSӼ2h&A2khK&hYeT-h`E٫hpRhǎ7 ihv/`h1ձh0hF2hI׸"ߥhU+SIhN2h,A"hR3BiDf bMi,;Ai &>PiRWi]iXb5x_iPgUi`SmZix`wA%Zi3%Qioz\i}cQiHʯx`i nSaig`ixWTniйmiAUli`X}oi$inimfsii@jiaϿxi/q??riь>|iX2vyi,GCzi&Ryiv=~iScJ~ifp}i$Mo~iҠEňij.k_i`i%.{i;i iX]Ozi>;i 1hiW0iSiThiNit8hpi\niϝi?}ifif/}ki=@63i(/isQi֕$7i'&is xi}iDei$A5ik/>i~`iQ;iK(PWisiC]٬i>,ib#)id jiYVYDinLivPi9637i /i=3iB3:ViJ,+=iє&jL{ j&d j.l̃j!\Xmjp:(j5Gbq j{Xj 2aj(t*Jjat6jujIj0'~j15j2j-}jbj qj[pśYj+ !je /j"-jOfT;/j#&,jPr],jr_.j4C"j&xr/jw,i.j'1jh$|=j5Rkf5j;6j^߸?jCny$7j@20jEM1jQkE0jE:S!7jpQhAjhKjjxCj pKj\~AjXH=.ijbejYoj:lƼۘljYlkjD'y{jOn5pjSJ2uitj= Btj^V{{jMZdtjE[6zjJ~|j`wj&j8 qjjP?/݉j֎jp;j&j$j(ǚj"FFij$+ggaj(gjZb2jKkEtj֤8 Ûjrz%jvN|jD뜒j8JOWjlJ j3 PRjj,yjM0Τ~jE1j_8\n6jn$ j㉬ 0j7 ׿jYjҿTj4&j<ڒjCjJ aj&9j~1Ntj䶁Vkj"(8ߴjKj2pajV;tjtdjTuԬj[*j`WBj1ůyj>'hjpmdjźujojH 2Ij~༬j%ãnj˞ jjy&֪rjL&YjЫW*EjZy\j)GjQAQj8jL)j""Tjuz?j~/+j{ˠj'%jr8)5j-jgHxj@ j|xjjLyjq<Ö aj"jjB]+j^ ֋cju5jΟIrk.9dk$)k 7BN7kB9g5 k&ÞkkLk_ k#=.v2k _k_EklhUky jk{Wkfk+Sk3Fkk?R k-ITkߛzv!k*w;"kP;qmtkPpk?Fvk3bqkܔy:rk5 oskt56x؈k<G,kx1"k3$~kwBkс5ckɾck^|kR;fkH-zЃk6`kMUEk~|kmcɗkĜsk3LkR+#drk/=k\iNyykkVqkfy@k4okQpk17 >@k64kCw{kp/ߐOEkEksYW8kÛk6hi߿k ϸ8k8Zu%Sk#S5k|^fk@Ck2-)kTh k,zEkkeCkW~l>kOFXkkܻkF٧k=1kKiKQMk\v徖kݝCk,kc"IZkdHkb$Qk0&keM?k’ΑRkr-`k%ky)kp!wk'퍰k?SY3k0Vk4pk3Zkk8kd2k Nk0eB3k,ok̠k.ykPgUWlG1ltE+B 47l>l8|3lwZh07l,+=l?ly8Hlˈ}MlAD&וGl8Dl&uBlCkG@lmAl8Jlr#Gc%JIl.xMl+Xl qTl!|]l?WHWl.C\l7ߜ Ul ]la Tl_6*IRl OUl;7LhlT`'kl ]cl:`lknp`l$;fl ll ]p=*bl)jilfя+iloRzlMylȜcul yl{ڏplk%xl;SI, ~l&Qvlr{x|lxl3ҢlVŏlRTElZ #l}ڏl7(l([SنllR?|:lt(7ol"Il!FlWal Wl^`Al簛l9lL՛lWa+&lA2nC-lLQlBX.lr.Rl+7:䳤lt|b׫l> Hl;ϫlDQlT/qlݤϡl8r)llaLlO l]Vjlµez l,=۹ld/LUl}dLlX*''la|$l^ %lK}l' wlFՏy7l̋`l6lƀ-lF l(UHl $Ql5l=Sl(*Rl硻l|lglPm-ldtpwEl)y?lxlh{ls mfIY meJW$s mу%Nm mo DmIamXZ4mem`.+' m'ǮzmW(mEmBm-#K1mkmdmmMg mmWjŷ*mSqFt;%m욠K%mNG"m,h鴁 m Q%m3 4#m u),m?Fe*m>>6 m$P3m8yq7m Z3mB9tU5;mQ:mC?m:meʜ9m `[0m%C0mO#@mbGm>i8Im#DSJm:RNmOdئGmigf@mJDnGmpyOCm*c[mA7]m *z&_mT߱aXmj_Tm?S(`^mޘr__m~1Zimpam܀IcmNomU б.bm3q%[mm"!L>cm?OhmݾS[bm ȘkmacQtmI+mr\x~mA. ymzzmpxxm_![mlsmOymIqmkYam8zA9mӏm |mMomْ m4ׁmru m]ym>qm@6mx0%.*mxfԦDm Em32{m> hmZbm)8/AEm` RmetqmaQ Ȩm]mi|ZmECbm8gmEmH44U"0mR0vum%˭m넠mmm̿m nvD޴mڣa}mFgmj퉵mեC5`w*^QmX!Ȃm FMm(%lms,km 8 nh&a(nf(n!n n<*N+n[BB_)ny$(n24c5*n( k$ny+nEuҫ.nԌgd?nhF%"$5nJ=)1 6nlpZ.Hnx㿙Fn>Un(CnNbCLn\~HoBnJkOn*?klKn Knd9~En\ư]nKHZn:&6SnT\$Unx !Y\nRmSnn[n28z]nKYntCOZn/genƚRln"linʠpHinWUenҗ^hnWIan )oƱanJ37neonS!qNnCp%nrW:Qno(7>o)>F";o@g0?o4M^A2o}/6.8o$4oy0K0obZUNo21OOoƬMo>oGo#RbCopgEoJNo]1Lo<AoYy @ou%Q\oPo~99Q[oz0U?RoK\\otGSok,QoOIPor:qo]oTT^ono{ioϱ2l"ooE&~os\So\{o5ohKgPo$oo@. oo#qo/A8o@e pJRM p yp>)Ejr p~2pxp隫t ppw p܆w@>phsrp3,'pyWDXpQ!)pp_[pxWJ}p<^p6]ѷ=%pb3L&pM>}*pV+@4'p\XGx%pZ=!p4pNH)pyE,pYͪV#p.4Ä:'p7p<L)pq=pbKC9p~~kg=p3$a6pf3BpFǨEp+Ap(Cp@"]pSp TBUpCpp^|pGzp%Ctp zpBpkůUpapY_.p؆xэpXrpFMZX *p@䅈ppp VFpF՚pZ+Bop䓉fp!dd1p 7rpX#dpf pKezpߎ1eps*p&ap-L;p>[#0pC pàpip^/p2Ap6m`gpOp$prpo!pBaGp;pDp&IXp35ppp; pN4p8pޢ3pɊ&PpQOUp  %p}y] ip%&#p"1_q:EqHqSJ) q?=PW q0`5qʰq0qqmq(/q vq 2|q!q~7M(:qR7McqwFUq$b9BqSDB(q1(L&q5I $qQB6$qmiC(q2B_$>&qd~#qu1&q҈Uj'q e/q(MO:>qG1q[TH9qgOTV6qXU)?qt˺tnq)+oq5K:qqhe}qGJtqUyuqtq[&|qxqk}qpqP[zqEq[k+wtq/aQq%~Oqӥq(i`q}QOqe:fq oqP8uq+q2E7qk`i*q:]qɒq ҨqSSӜ̗qGq6Q寗q{=q4q8q\q2s|K5q-5q_~Rq2sXqvN%ݫqU_q*HHSqqm$q|fq.GLqrXq%Nq=俻qjʏqQ2qɿqg.q8Eq CIqdiqۻqX60kq֯5qe?ګqh)?Cq~Wq~cW.\qXTq2qWUiqC3nLqSIdqtÞ qo9)qd"qdg\q *_qqb@;Uq +kq1YqIzq Iq-Bq9q&Rhdq^3qqT@qk&@qSquCq&1qU~qiEq!ՃqqzqtVrr_ r3r9K>rdHrn r rrTJr>7_s+rCrm#rNrV>.]r\ ~rQr,W:6r ,r;jlrXGr E'r@K!rHfI&r4c$r4NX=D,rnJlk'r44c&rts&rZ`(rl< rA!8rDeY=r2>y>rӾV1r{(0rƇ[{N2rs%9r#x.[F0rUf;r ;rv?BrJr. Fr~BjJr'Frt@r&FrSEK;Ir`Nr )n@r݄RrP9Xrp,<^r\NTrT Xro)^r:hUrk WrԜeUrBWr+-gr_jcr6@ar@L{mrG`rD 9lrCPs[{TcrƇirO GirGkrg5&trK&|r Ezr}r6 ?Ewr(x sr;r6tr|urnct;srR-}r$}Pro'r38rfpن}r8\l2rՉr0)rBrARΒărl#u[rurtLrrQ<wr8ardsUNrT70r䇞ܖr(>rkr\{r>&ݲ=rN$ެr#mLȧrOp r` Zr܋hwr:D߮r[΃r rjrL}rHYrrsѶr;֢er2JrFmmr[0rVr~y`rw;ZrpyrX4rsFHor; rVJ crsrQebr;5b-r=0rfؔqF0r[A rprLr5d̔rXrlr mxyrrѓMr($s,?bq/s9#"s)h#-svC*#s1#s膿u-s7&sJ&6sl/Zv 8sTlt^Qhs⚽Mns=SsLcsdXfspT١osBmsl}bsdcsֺ^ns8̠ ~sws)hwsDX(rs2Qܖys@AL_{sDHysY0}8s_\uyqs|CGqsOCRs`Qsȶs츀Vsu= ᄘsNNasZb"s<9]sXspsllۤbs>lxs5ss5s`}sUΟp(sZ5(s꣋s4ItsWVVsj sEcVsBԇNs=k0ǰsM*zs"G?Ӻs;Uis@̖Ns|3εs {02^s sP*oڌGs=s &[sMYm/s L4s s&os׷-9sՋvss8ts=si<~s!sۮKsߣ>sn}s\pmSsv~sQWs2;7 s:⻟rsK@S@s=PsНWss4WsysGqs@AsDNw%s6}s7%;s>G&sssG4 (s5 sšTM{s1RQsg)p*t yZ tI 6tt8t ϞtvC ttt&oV tvTtCtT Htq&vttNnt-]Wt?HtAutG+tNSt1_n $ t;hs1t(toeTm-tJ#&)tTwiI t&K ,tR*t;$2,t' <ɿ"tX}ZV%t^;tI>tߋ*9>t0;;tsW6tqr6t}'Z>W?tՓLF&;t)R7:t2Z9t"OkCt޿`It~pEtj @t`[lqqJt oKtGbDt\|Mt @tMt"WTtW_t8X[Xtx-=,]tSd}Rt‹p]t$pYt-*|]tn7 Rt\zQRtaWmbtgft gtH>ktyektEltM3`~gt)1ktB=:.wgt6gtTj Wrt` wt(;<qtX?5t햬vt GrtWҧt(xt쥝Z"~t2U7ztYt}7t<0t0,݋tlʂt27t[c*ftD/͌tNztp3ژt>&K}8tMQ Ltx t{qt3 Zt t:tktt}OДtVtt t~utK%tBtX׸t.C t*ʦt4YtZt˦t)7oaоt[ t؊?Ͷttn?t)@HtbDti#ct\$1-tzQ^:t%-mtt} futFu霳uoH_u'Ϸ!u$Gu:X\#Uu$( uRucfuɌ>TuTaB(up4g.u>i~\x'uə5$u uw[{ u9`%u5hQs'uw)uiلx(u~W8uEXx:3ud17up~dx;uiCl0uͬ&Y:uT[$0u C*D-"6u`:s?u,YG9u ^ FuyhP @uĺCu1F)\DuʌkJu: KuKuP0y]4 Nud@cHutlUGuBfTu\̓TudFVubMߧYuD-dzXuoi77UuX1?[uuf[u޿\ugKZ5^u֢ubuϸDxaude44cuRduzaAkul;auiSguYEnu)duϝ_fu}W}u6<_L ufXd}uq?e4ru%{R7ru$f|uIŠ>xudDpuSso$tuKjipuzJu+g>u!d/uoJku;x'u}u=uvGuكuיX3uk.,E,u[Eju?uj: Tu`cuf_u>ux"3̒uC?uav਴uUGu ^-!ᷗu}Q#Wutc}ڧumVuPDuͺFlإu6buvFXuB#Ux2.u\KEu'g!ʬu7u0Z(u`#YuvֳuEuOButku vu0j'u(.uzVduupkuT uبuj֘guC- ?u0#-luEb>ulOu̧^ ouu\wlu(.u#>,hufuLLThu*u&QuOI_u5uiNu=`u4T5uS@u"c! u'R.uLu֙cu݋tyuvFuhuQ!BSuz/uuv54a2u /uͺ:2KueO]O8uQ,:5uԟubT1jru!;z+v6v5%"Pv }vvEvhv0AWnvd+iCvbVvH!\vZ,/8vu+Z'vzjn v8卺v̔$<v"{6vQ3vWּ vXSnv>{vF3#vO#vUn)v~`/vO$&v('Q#v6qLa+vi!v*ۇ&va v|;bii1vT@3v<=u=vT7vn%tTvV؛vvH0wv avXvj\vfv*pv dvcvv㵺îvQvk=Kevv8ZTvRTv!tHvrovov evJUv VrvRL(vܾ?GvG>wv;wԤN5Sw VaVw.&&o w=wEwݛw˅K wf^1wnRK*vw`M|w ~8w{u@wڑwRpQw{yw5wnTow~ LEw~7?w`w;+w9C'wB?Y#wo RM@"w "ww*`5w>P:Wwϩ1wB8w'["6wy|T7w/|2w1y7w6Iw8N@wUOw2&+Gw`YFwȄKwP/D Jw`>(FwlC((8Fw$dIw0 [wH+K]wKXw.Z?j_wyLfRTwE1Qw1~Zw qF_wbmXXwy[Uwucw>Iמcw$㖼kw@v>cw0ʆQnwWHebwc}7mw(UjwGyKjwgLTcwW g|w9 qwr-{3rwgkEqwhwwEAWwwHyw^Ţwe*\ w7wԪ;wZ(w(K~Ɓew> J;wjHwq(wwe PXww vw&\t )wbڇEwHwʴw)ͮw2lEwȣ4QwHu2bwuحwX5w&w0\wܨiw>wL)fwJפhwG6Uw}, w"d=w/~ײww]d"!wUDwu:}Jsw44ymw>swagɧw zw5w:wJ(1wtxQwaw1u,@w.)K,wȶw&_oN0wOk!wq?w^ 3x}sx xʼxG9xڐx["u xP9ZxiXxH xHx~-xץsxT@ix'Z. :xqnx<`t#xUiExG[DxnzxtT,x! 3!xZ[&x')x3slx!xV+$]/xOü'x3~5 x]L%xAL=d(x!45x_[q9x $?xщ=2x=':;x ALV9xx˿G;x+k7xb;xܧM57xbX8Axz:z Jx3 GxNxGSBx2KxFž-Ix,GxgECx^vLx@NOVxyXd&V_x߀fETxʁX\xx0?Zxeg\Qx4Ϟ|RxUwZxmv\x ڈXxpVixlbxW;scxèqoxv`xV.qF~ix!U_lx?QkxJyBox.9?axEGisx^ l#~xG[DGpx`wx&t5Axxkh4~xϣUtsx}x sqxDrxq|KhxTTx2#xx Ɍx_0jxځPW x7u$&x#?BxpJx-x csx^dHUxJxx >txbi,KxT͏x-QS+ƤxCX xB,x@QZx I=YxB±xtcsO/xj1x6Rxx$P4 xa/x6 UxWyey+`_y71%k0 y,L1yU1yE/Jy:P@ y~  y1QY y`ǘygyR^]y{%y2ܩyupyh?t'eyvyw~y0LVIyeH>yF w%y"+yrI5l$yE(y[f@-y~4 yt$y=w)y:=4z4"yƩ=v)yjD2yA=ylH=y?yB4y1 \9y_ 5y[b35y?W-[=y0B:y-*Hy$yTydvSy nHy/Z0iy\)¦UyYyDg2y⫁'y  yW3y!yB9xAyè˹y6 ayf@c.y։oӗyI>yb"$Iy41YyDƣҵyNڟLy}+yyhK#byωWyZyضy6JVy.yBy3йMybE߹zΰIe z'z> z8SEz^T z\-c)a" zlg zb: zinMzbA~zN zhs٩zgW@zXGJOz G<zgdz8^4 pz&z& >z$z򧥔z3W.z9L(zL,z[> [ zi[1,ziU!z -z 4-z Z<5 >(zPlP)zkV9z6?zn&6zƄ:zzHq9z}Z7zt9}3zTO6Sz)PA2z_8SOzJ&Y HzF Izy#zCJzj_RAz l UJzƽLtHzˤ܆Cz&d&Ezv]׎mJzX"'\z*D@SXz@(#YzZY9[z9Rz,սPz ( Szj{UzI"eSzESzN>Qaz^`z҂ :czCLP`zxS7?dzR|mz*יdzs31ez䙛zz\# z)zcz>CAz.h2z:lz%Hٺze+zxf_zh62rzf]CzDz 8r'z>$fzLMzfNz?W1qz(‰합zI4Wz #zÈLzM*Lz@xЫz'C'ez^%ztӦBz+5z҃zI1zlx] z (-zh0q8zZ*,qUz h^ܶzCᖿz#5Ƒ6z1tnz̪qzU#zlHz nSz YzbZ/vz߰Ϻz Yz*5z:Elz}d5 {]^,'#{{T&{ήV {M1{D {{wTV{4 {:ѧ{Vu{{9g{RifDs?{ "qJ{/;)YZ{90{b9{+DC{RrCG{{SNu"'{e +{-*{LͰ!%{T8,#{h.{~/{&{f gi)){Gd)({f/8{={ܙי81{P֨e 6{ 3 T4{lⲶN5{ N&7{n>{vwΣ 7{b:Zhi4{M֜@{")DpA{>*K{2@{ ݕC{.C]kN{5vlD{)I{ȧG{3DL{l3^[U{ʀY{LV{N (f`R{Od@P{Mr6KT{a &^R{kyY{,F U{~0VP{U,a{ҎcKn{ k{ΔAd{. f{kb{uc{v9c{ K b{HW$i{܊wn{Ty{!&() r{WI}{"h¤~x{ryޮv{uRu{ȖAѱ{U>Up{>F}{Ps-{K=@{TfZ~{p͊{|k! { ۖln{벏{Y{>0p3{E{PUʑ{Z4D|{i{{N{yP/4{iD7{[We{A{K{ H{ ~{b{;Ѯq{? {z1{yr{~{-l٧{R_{{^{#( e{Z*/{fk{i2`{lϺ{.Vվ{^{;5?{ \zа{77{ѡQ{H5|{eQI{IL{,!YB{L'{&z{W{cG{. A;{ŃIr{sjgs{JHMF!{w':M{ ٺ{V{i{Tg(k{u<#C{FV{8"Ϲ{ad{{ { i&L{1|S{:pv{hJt{s{t%{xB{Sebr{V5{pBlC{{3N.+{t{I+yX{=F{$] F{vx(B{"Q |I6}|^B |lv(x|5_,|f+x|_'|F@GU |YЩx |J ܾ |֛F|=:|v>7|k|Y| { |i!mZ|eX|Tڊ Q|N3m|XZVe|r j| -Mo|:˄u`|$ `|[-I/l|i:l|L+} b|MA}0}i|>]i r|=P\)s|֧pBy|N2_8x|hxu|ODct|Jy{}|ߥ`s|.iCiz|r| ;|h>| |||ȍ|U_M|$tm4!|34|)yU|T|E.mԁ|rGLw|--|x􃹰|cgA|lR֛|A`|,|lOd|&l,|EܡJ|tmB͡|ݫ|Z%|1ω%|˼*} W.}N^!.}Z)f&}M*}*>f/}Hb)B2,} pO,}QX))}Έ Z<9}+4}^]\G9}7`z6} p?}Vh#>:}Js 3}^̷$o=}Ux43}ʭ:}ԺF}D}!+C}h*@}U O},'hB} ,E}6{kK}taN}Y.pzA}~p/Q}dz>ЃS}ϔeD\}NI}O]}BgT}">tR}v̜f,W}zms_} P_}pU}zPš}y}b[\}wX}}x4}K&q}@ ar}᱘O}(Bg}j}6}.9䀼}+2}&3F}w?=b@}}H_Ǵ}.tRRc}̫A߰}-2}+}-ND}֝5}Lx}dW}ȓj}|<,}(1-}&b}Gޯ}ڒ͵}p?}w"T}}Uw}/}ъ#i}]t2}V01[}b)'}#} u<}<\}T }KM}$VP}r9}+|}6<}Ew>}]+G [e}j"}U]v&}}$ }3(@"}C8}}m}b@&}2~> h~Ca~Ro$~ /~X#~Ȗ~iy ~~27~z֓q?~,1~|П<1~ZL1~ ٜ>~‰2~SqܣL~BRUN~@M~]Y5O~umB~C)duG~L1uJ~p=GH~#aD~_E~JP~{A͟ ]~~mҐ~ uK~sK,~Nٜc~^= ~jpQT~~Sl9;~qu~ͥO~.gnՎ~"~p"U~ 쐽W'UͰRC3C YԭM;*QNf"M6(d,Z$[u%dyȃF)6RWm%>:C-+6.#۳&} #|jQHH%tp8,+x Kf=c=M"6߅4lD9j<o'd,>\A82n9EV6tG_ZNn+ĨN\JNƭׯH]c2 UIX"2IiDoʻQOe[%ñQX)՝\nJ iRl(Z._tP*h1RUtPTˎXG]x@m~m0x3oA#_Q`oH&o8:Onb)o"zoaM酹9hݤUsm cC?2jM86.2\-!wadUϺ,ݶ}ƶ{-D vLv;R}ahjp/1?nblK+WGh eoutputmatrix%)}A6?} Y?CLˊU\?~`\?BnF?p j8?`'!??/Wӗ?Hۀ1? 9?lZ>ТZ>+>'M.>Sd+>gGD[>F+p8>%1?Etqj>.\(}>aqG>/פ >+Tv]!p??Bm2Ԝ?շAʢ?AHeՑ?BD?;.Ô?`g3F?dGh?8N?,5x?1c? TdZ?F?VYI? S?9 X?"I?,Nz?Z,Ň{-AUt? ԥf1?K<.E!쿝 _IniӿB4鿥ڃJh?!7R-(Bک忔sja$Ql\W%~⿈B7]?Bgɿ[uöfx?O տ]Pm=@?/Ay?tￄSSs?Y #x+H׿ #*I?M-?l,?3п?O$~?_;9Z?\L? 5G?x翬 dKؿ~U0y;F?X7|R?3J3 '>?o~?{?q\ *?GPb:@?E48濱1?3~?7D*5 eec?NH΋?)D¡"1u^ y?𸷽>+p*Z?tޟC8n#n￩j.'u?e?;A0Ϳd(s;~_?D8S8Vx?̽LQ뿶$-?o}0`ݿ{_ Y(C"m?LI1GL?"%"b?s7?Ɓ? OwM`a?uOҜa+&2JտDпrE?4G$?hr̳d",?!㿎Ba=?F+dZA;?F9&뱻B? H?QJ?>a)h7@?g|9F?,gB?r;HM?wBV?})]?3#X?gQ?`?&,@j?_|)wc?U ۙi?3m?k h?yzk?BԨ`h?}:{e?{bm?{hK~? G;Hw?`[~?4Zhq?  ~?6?tv|?pw|?|!hr?z,.Ez? h;A]?~P?w1?!T?U ?u>4?TE?2B՝?o5 ?_ ;?R:7?8Q?b4ŕ?;O+?9,!cV?㸏?k=?f?aA?5.X?#p?lm?I? eL?[@2\?%a~פ?:Dj?7tg?p|M?>?W_O ?\-!? +JK?z?(. ?H?bV?T4I/?Ԓ`?,L^??f?DA?Y1f?Xtn?fV?`]7k?|Re?WVA?G0?SĿbex]?IG9RyԿ?j?`YڿiӮǿ+RQ- ?_ ?~:?9?˔?P?s??G>,?1ht鿊S?q?@=ӤQkLl?̨?| <2? @?}E?6ȿsc3ep?<-A p[?J?VO¿EtI9,7@"c2?e?*W?>nGf??ʫ}?F ?-?Q=:~?vH5?gq?J!J"[?w?bF?0{Т?wXFU0D?bȩ{8&"1鿾N?8O*勵?\gהw-&gy?{Dݴ￢y); %TDٿhOl1/~,QD?E鿵 >+bF[?;)fk?<풅h? .ܿr @ ?U⿰ak}?UNw?V>?y$] }ͿtqI?61@;KRcÿ1r? f=?-οN?=-忦wMjA YTG?K?w\EkIҺڿοm+?Ę(?xU?k^ݿU%޿qzM(ZA?t?sￋRNy¿tIx`c,?#?tIAb0;? ])E?Z ݿd?FY~h-YȘZ࿏O?Rٱ4kM}JL?𶚺t#,?`ϵ=E*?=?OQ=X?"P(?8EY?)R?[ё?>[hJCԿn%4e~/L%m~j?`դV.Ps?׬~sؿ/W￵M7?m?/Zۿ ~|="z٪Kp?d1?s4A迚D&{'[B呃?Wʊ?ॖn˫#Ŷe?CZ?p ;xɿXs=y~`?"?M?']z??dٕݿ@?m-1?xjP%X?k{꿠=?] ?M b鿰u;?۴?2s0?3;.ܿ|=iRu? ?hR-96?7~/ђ?'G_?y'#?5e?O;MA?BjfϿ??^][ￂ1Y5?Fopy࿹rn.?w 翞WBp? tx?:ѿ$ jhr}?K@??nPaf=Z뿸E^l(hW?doFג͊4?X^G]?-A@ָ *? E俹4[ѿRui&?Mug? ?! _[ ݞѷ?jdԿ$?:,k/ݿ0?I?ă?c,V?ItD?K忺,+?/5z?-^2?QB昘Y{`ݿ ?+H1?[y>(u ?WT?;IL?H?~{jSՋ0-;w]ҿɾ迄V?&?ya_ ?p?D?_A?[tLS( x?{Œ!dL?j~?Gi߿^ʢ ￱K?&و?9)Q翶c}ҿj?dPRW? o*g9?DP%?{SNJؿn<5?WMi?P??[&?)__GFܿ??t?!迣? iܽ3N+/m#ԿT[A?Sjipe$!?FT?.׿pY~¿e 뿋+??H꿿;xIÿًU~濱=Ȝ_L!7m7?gjCѩt?~MӐ?i/?}?UpG?`?HUAuVglUG?x&?dξnBP?9?R{jￜ{޿ O 0' ~ÈL忟u 5Xe*?>p?wDi}Aݿk7Sgekg-?HP{!CN^8?$א5W3X?]=?ڌի?n/n?j4Ήi?ת2qR'9q⿡F6?G>?:$?5ɚC?;h?H2??k`ՙ<+I￰Ghb e|'ˀ& B?d#4<$?t6n?XM.bKL꿌@?r9??'ۿ/3ȿ3F?Srl5YUٿ ̰{˿b$);?-aP Jￊ)s;ſ?̃d\9)D3D?a ?/N?oOK?Q n8?Fw<*X?9??92K~ .>??lHwؿt>'?Zr?3c$0\0Jpq 2EڿpR?e@"/R׿ot#^?{0nѿHJ?DOXۿEFwt``xPE??> e?g?nUځk?8&e?)??v?%JI?v"?@-Cd??ۘ-?3qK?Ny8a?hԇ̤t ?I_?KW<+?>GfݿA/?U#X?u?y&a?,?\Q?+մ?i'Ϟ!1?П2Jcʩ?# D#2*Iy+?ԑ>?9俰*/}VX@K?p:?7Eɐٿl&DXQ?έҚ?k3P):O{k?!;ppnֿz O<%g?P0? [￈`j2\?Bp~ܛ`?&Mￖ{-0Ŀeh?;4?62z?Ez?V$q￀]4]=̢?$I=g쿺к\3ؿ2}T6?<{Av?Iz2˿,wH-?WWe?=s??aj߿Y޿N.2?w9;?CH ?K!ҿItf뿋1J?s$f?=;!*jIJUڿLwOO2ￓ'쿢 Ku: ??i?ZBUtX?V?A6i;?U,[իdq Vhj??}orG?"Wk,EfNBL?"`.?r15?nT{hH5\zkֿ'5}]8￀>Ok?-^Ԛl۰;9繘Ԋa?[e'ĿH뿢+?a_ſrKDY?30?b3Pdze뽮ףrƌW㿠Д-?H?$N?M_kG?L%*￑{lۿOQC뿅*~I?eAU?3cS]?\Qr$S翆k|"??ᴏ8?[BտHZyR5?Rῠ"]|Nѿ+ ?g?'K 迉:h_ؿ @3w?ܮ)?{c!qJʿwпK<ë? ֗?yAN&ZwE)ƒS7?}??=͕?G6a鿎9 ̧?؊og5G￞0Ozü?W?g?cS?ޮ$?򋿡4J? fPI?b5?tcL忮^p̨0H=?Q? =yG?t=Y?0ǼkܿIn?ĩԚ翁?!I:?YJ܎$^)￬|ￒ=I?#dK=:ƿAA~r"?ޙ?Tk7fBi?O"Л45ҿ @@; K}2׿ wPS q:)ٿs3f+!3a9Qڭ?U ̲鿀 ?#9}`Pq?5E K 4?ǁK?R?K@:.^˲{?E#?C ?|W7c?Khn·J`K'h?эH3( ?`[+ڿܴv2aJ ̍?}̳? ?*3+?Ǐ*N+8?ݫm@M?4w?,:qp?eN?FC&^@?g~l c H WQ&޿z_ȕV?oT۲^?,7܃ʿٰe?Ֆ?:?N15=??ZD>31 .?{㵗?1&?l*&/zS6>x.RֿZ oW7?l%Ѝӿs)ۿRZ|l0d?ea?A߶.n:XZ #Y{ت鿺 ?>hF5?86:V̻s?`|[?{Ā-?w?s2O˧?߳OܿvC;5?vHc4??f忛Jٿk~꿒$>5?NxtwCٿuL;?Q0GF)?7?ŏj?á%mtRd꿐Z4)7?K?٧ LX8UZUԿ8*ػ?OmBk pܿQd" ?߃?ysD2B9O&տk?2~?&=_?yo6?uS?2?R4e_ $":?BJPꎕ?6 ^4?΄:=c板6Bqv#?~O#?EtcW?a?+?#߿U?J)S?ir?Inߡ+/? TN?ža]({ ?֣翘 o?щ/ǿ~]Pdr?;[I?Z]$hm?i}No?g3?s7+M͡pD?V-=K ?f0 mIտ\g ?o!.uA |?nhJݿtI ]_| v-?\jz?6)+Tm鿋E4} E? ?~G?xxZ?%*@?GD?YYPӋڿlxh?WD5?r))ֿr?2yϋ? Vҿu߿xQcAj?r?&ҿ0??rr׬n保 #ￋuZ[?ZOJLٿĭ!?Han߳(?*$'R[00B?ȣ 0?(.-Eu/?nF]?tt M9NǶ?=@;?$bl{V￳qrb?th(пw-]5Q?GR+忋,7c?ߛ%6?N4? #iӿmD迳~~8b;r Ȱ{?3#ￗk(E<#?8@o?WD|?& It4v ("\hٿY?~U[?,O?2)d?{Ita ?Id-5?)뤻b?޿,~ ?{X&?JZ?8q<ؿ2nǜ¿ǰ4F忻j$? j?Yi:̿Y@*?Ldt翲 j0"?OĄHah,-q?ۀۿQXO8HBCsJjn\oÉ?/g|?/{cvmz?~~ӈw{{]PiRA E??[[R@?}WԿyu῾Ǣ^ￏ +Go? =H@.￈V1`俛@7`V? :2?MD/kj?E$7?`1c0?y&uv6?[^9akLʿ!=m`ƿWJ? M ?Ʃ}-H?%?c,4c)xN]п6c?>?ǔM!?/1gek? 2G?vAHq?N(Uݿ;e~$?wa+V㒸?n:LYؿ?z> ?aǂۿ ?ז)?O1^;B(7?i?-4Z?d{L4*|?翏,e? ?ct%?Mmw mĿo*EqZ?Aȗ?j;r?G$<. a;?)F^+ڳߓ?2B?㾳:ۿ-?4k`Gwû?Pn6(o*ˌ￾@(?lc?"u?6'Y[￬aN2|.5?KxH׿ ?]c?dvR?0̿R?a?!?exￔЫ?W҂)?/?ɺ)0S?BRا?P{>E?k7 ?B2T?GWF4}i7/٦ ^4dh$?,u*#?cj2ܿ|Tr濲@ٿz'N?1@y޿ [1:)+Ohh?'K?+6¨п/ #?gr 뿎ey'?(? c?JG#?DҴ̤ѿ+nf?ƿ ?1ܠ0tʿ)0HC?NcD"t'S q忣?sW$hY=azz-?ua}|%Ys?S?-*{?b'2,YQ迻1R3Nc?o1:PQ dÿ n&ڿ`?R 0Y?eH7EXM YrXy:/PB?ހ(?;vnￒU ɿ?rD6F)2pdzv? ʝ!{?@jlp*q?,/a?.yￅ?|bۿ,'@=`w?S꿈F?S4h?GI.4?q'J{?H>?;eֿ*wzaffM/+.?W1/뿝6?Y?ˉ[?wNN,ٿvgw?:F?W.ٿ,cP ?=<^_z]ؽ?wԿ˿s\O':࿤/I?WQ2Ͽߕ?Z53ǿ+K%U?^c/,?/"VnG*z?`?.OY?AL?Xiea뿦X`J;qm'?mXZjR?_翈m? ¿l,?<p?ԖJdVܟ)hr?DL¿ԗk# 6|(_^忽0=KVпjYT>)?ʉpmiƼ?\#Jϼ)"S?28?kX&E}?mO?e?vYаz?Νkſ9E#㿦,P׿ֿȣ)?nG+?"6\ k\b<%{?Ox?\wY?d2\ տ4C#]?.q׋?^5goN?^iYnf4?U%Y?NЧc޿=` Ƚ,+q}Q?B<뿀QL?7K2ݿ--ò?B߿֔Db?qW鿰w!G?:Id>:?[:Isexۿ$ӕ6ſI?G G8R?̫G!?L2yc#?hMn'Q῞۵XTb0pV'q޿D` @?Yē3 ?هˑ}?SV?qjٿSϾgpOTu ?^8?> {¿LulYaR9U?ڵԢ῍rmڿkپ?b\ҿRC?G|?r$5?fZQտ1ZV?dnҿV4 $A?eCbԿs&?Cs9?)rE}σ?6wml@M?|툚P#>?ʟ,?$֕3S!xEzDr;9?Y UA?8BZ? S/dlmIY0#|?L?6^俆e;?ö4?~?Ԏ+I&пl?Su? .)0,dw0%(b8w#p?p%ݿ Xcw?9m2`1?@Dr?pod?%UٟB쿩jkMBHtͿ6ٗdѿ~%Hg̿ykOܿxA aQ￞zпf=翖Q.?^ڿns?hx1%)`>?/\F?f-y?>kɸ?1G_27KB-?X_ z?"K ^ESRѿnN59?O>E@?r1c?οEru?\9B?8ſ4p?>?b`={7!:g?/o8Јÿ?42X2뿼e׳YH/r?Gcî?4Wu>?р?W7r?@Dsi翄7ٴ`? Aj)Կ1fɈ?M%*G>?\ *࿃V%K?}Eӏ]?qQDt?=2p.~??1Eq^`?LZ'9?y7Ѧ?Ͻ*;^Ԥۼ-T#@?o}h?ב7?Юl`LR?= ?wt9!5pm￿Z1?aޅ6s~Ե뿆W}?(8M?#n-?Aÿ$32? W?U ?tSY\0 ?j.n꿲cKiprޱKw;?xF6? 6+2??ֶ?w?HC `ء* ? ?15Ml応5lm?76Iy?h lɿ?:Xq?c習fw.?`yyίӿI`ٻ[?rCÿl۴῞U_ ȿHbk?Td?ݜv'˿o4G꿥A漄}?-J|ԝ?s,׿86-!X?!A?rL?ӈCAr?Y?oc?S^c?^oدy?ʠE?XO\t ۿ4U?ThտbM6$}[y͹Zxk`n``I|؊?@N%?ketF4xž3pq?21W?EY?j? ԸƸ?h޲y3?u|?% 2?3X?e;NB?9g"QGￋߌqk?,(? C?CZ-t?BXA{yHH'dIG󂵒ܿL6Ժ?v+VO?G= (?,V_m8c犚xϿX[0?/fƿofh?"0 ed@3?Ru: ?p8@Inpd?.,F!?4"5?{ Η޿kI=u?-׏[޿K*Y?5rh?/ҘI?!f?pArl/[ Vտ\Rkb(9?lWyۿǮ>??!Qrh>?Xr?'xD޿eN?FUu( 8XWoݿbӭoGkCB%Vy?=2> #?U ?WORnYE\PMտrv5ד?ׯ'Ŀ[Gv鿀m1{ӿ3N?+翻oWe?S6?NZq?3vٿG?/?۝c?Q[MPo?;7?{,R?(3?qiճ!?~]?@& ܑx M85^p?)# Xm￈?Ar"j۸|SP??Cw4?3)S?Ug9jRfSF=HH?y&?0,x?:4?]P?&z+W>? u?͍[m?<B?F dZ ȍB?Os>SYԿ˽ 꿎 7?71~Х/ )Jdѿq ?dUÿEd?=[B?=ٶRڿsO+tPfɿxYQ t6Cxx?Ho*?R0A鰎2 ղ?xƔH&?ƞ)?9}?gxԃ翣=|j_׿8mֿ9ܵ?93?^ ?>/:g@5[z? ? ?Κ.4 [BvQ?,6Ԏ9I?)Tg1?Se?wKy?7??z ?b+Kgk닭?Ĉ S觙QV=VFQ".k!:*Mk7|)?u~?5o|QL,ￒK*?+Mſr[uŲ?JAiEE? AW)`=WG7}犸X?3?7ZmO5?k?IB?%?#lM?UJ?/Zxn\bޤ+?NJhw￲w?8<֘? ?e8X뿹g"0TpRĿ5R"ſ:!hrI?ޙ?|jE?U: \r?8?S-qC]uJܫx?Bq=Ϳ!K?iOq??nw迁앒 s4? wKV;KBoￂˮ՜?˽?:ΐq*犿&xk$?A+tN? a^?h%?? ?KF*F ?pʿa0?}A:п s?"?\?@ ?NmxF?8 >Z?̬m$?H_ E?މ0&Trſԯy?-!? wD?=??%|-X`o?9}TN?Ѻ+k*{,9yﺐa׿MX(￭<>??~U?s"j?zG信bAy$v?*$q4Y=?8ѭz?Sf?:/M9kοVCmLV?"=0ܿ s?!'Eͽx;?'={迡?⭞]w?a?o?T΢_|פ胍?/I$?x )??'#Z ѿZGῐ?0?(ob#OD?B .?}i&z?'5@&yz?t媀}6l?K*@_$C(?s0*忧1n6sÑ?6?{?~+Ӈݿ*.u6[L&?Ёic@AP?0CL)>?R=4? -f̿0~ٿθ(?pf11?+[?\Ug?NX??ّh#�;ԏ?Ԃ?D[m'W=?w*)K-DDInݿt9!R_}?B\ sy?b8$}?iYqQ <ݳ?Yh}'։ֿv)ߡٿM<7+?EX5P܉ҭ>ؿDH 7̕b??%+]'6}1?Uc>2kE?3.$?zdI.?hݴy8V~f? p"/_?r9?mH-￙p { ?9;W=jȣgI#tb?wVFQ(xV%o@|^3Za?O_cH:JG?K2I?Ur ?Q?tr;o-?g?7n=¿s@|9,Lq߿lrGſT3%?zgI X?  ܿ)!C?B8 '#?`t#CG_{?V| 2!`LyK̿!$Vտ˧ۮɼċￛI2?J?7?'$uu?MY'U?b6h"濽ſcmvHֿ0?Iݿ>o?1E˰3?=~| C?m? N/?+nk(q)C}3?7/8$!?pbrݿ}T@@U?)u >JR8%#f‘?Ž&M7?O?uJ eoݍ쿓LKk n.?TDL??u|}YԲۿF > ߎ?}/?>?굸?;Z?NAn?2[?{)¿b U̿`B*a:ڴ?S ;_{+?24, ?v͖?1з?b0)M^ ԿTUL?,,?OТȿij>sӱ?qM??NJ#?[H6?Fx?C!l?U?T? U/c￝D(?z[[̿G`yŚ߿?39!B?iRl?uR?|C?lz迸 T?CԹؿ\ {5“?{bXĿO޿/??Mt ?I'O?t}ͼt?j2A￾dFg-ݝٿh߶"q?uf3ܜѿ' Tsr#IbJE#gG}0?Ԉ0?)Xea7?tq?r?m{x?鯮BTr? C ڿZqr?ŴF04Udf꿨8 пrՐֿuI|6燊dWɷ?-G1ſKH@r ?9V?OJ}X?n'?81g%? Dpe?Sa,3ۿ<榾/|u·J0?)0쿵MֵAͿ/??!ؿ'gj? 2? b?+&N4z4ֶ"?={?9C?+_?#4?|?{ōVK&Q8+$Ȫu? 1쿁{Y֧?MQ?@ !a? ￷k?:#ÿ:SW翨2? &?!ҋdB?9+qԴRJ5 ?:￡-U?tɾ΁c{?Dӿu°>"?T`Ş ɹ? ta?OX?1js?;El?,i?(?MEX'@kYK&xV5˓k[Oevk$bx?03V5V?*4 Yp}?_?K??ppݿ>?Gnq|̳쿩׮?kNx?4?sS?O}?YYH3D?,4*Ů 0??WCF)?[KT?#̋MZ쿁i|)?dR# ?YF7ѿx"Z5i,?Bl?yڿ=??ćjNU/2hU0.?zhoƿ0& ?.`X?M:<?ă02]He;77yڔ\np-??f^:NￒbŭX?Є(4Fa}nٿ)*봿 @ ?G1?u5_ ts6?%?Puz?Z03 ?jʻ?F7X.[V Si?0p^BYr?)`j"_'?lA?C[?H?L:2_?!4[)X\??oz 7 ??$`g/?!6.J tŸf?9%ilڿJK?ׁv?&?;LV2-׿!1?JW?VN?Uaό'-Ie%?H 违uxڳ޿~kKYPyKly?)?ܢ?D`?LQ ?a\킁r?zje1?c ?lsռ?࿗ĿT?hf;?쭱@俫:7D?.e>݋r!? -?a9?bckRiȿ v?`Q*Y`Is#s?`}ry~￁|R[￦P}?G F?U6O 6X=ڿ:[?ykk?dܠ0?]+?# ?D\ϤLgO5S?4TF+?lx?2a迚 ˿1=?,?"5?UhkV66rK0?5(׿>?g[?ˌEbL?WX N [ֿJ$?s\]?x?heW翟z?T?? Y|i<6-i俠F1?tn󖺿ՈȺW?EU? ]Ŧ}j )?nViDx(f?yF?pؿ C)t!?`w5⿄0?{v?psa￵ٿI ]08E[?aL汃r#쿏GDP?(?f4b?|C? x{??`!F1 ~Ɨ?/6??5ϿЄ鸿DPq)?Y Yݿy?_Y!uא.?r￑hud6?{ա?8}?/ѿr?DL֬Ϳӯ^m[?'?G>?q?sxu(\:￿SRR?t)zÿ#>?9m(fb1i;?ҷ/_??,뭑?;&5`X?X:a?O?h~пW| 5??+R^5?AImz쿤@*?^?y͚+u远ܙ4?xݽ?ȵWq"?Ծ?Tʿ>?4a1?$=Uyʿo?["F?mvn9壨hqIOv+?*ʢ>пR??U?f ?$ &?͌?!^BH>XῈlLK!]$?'I?Wnr?lԖ%-?.o"XI$[+B{up?OaC?S02Í㫬?-Ƭ:?+IUɿ| ?L?R.;,RBѿ0ݮ,?hffyv爗?#`2?ʶj2?~.0D?:@:cOf0?r G?549w?~QD?/Dd3?G(ۿyl?\?0^%?ºO*tֿk?"$տ'{?|n=٦ܿf(?n׶џ#YΜeￍ7࿘Fڻw ?}pH?H{B[ĈKc￉4Hx08?eu?MTſL((쿕G]ܿ_2z ?~4o{?+sJR6?v?axөNo ޿&࿌'`տɑѿMn`v? hK5-i?3LF࿓$N?:w?d(?f(g?\: S FtbeM??Oa ySC|eM⿇x8:п:hrۿUTqݿ]H쿿ΈI?coq ?ۡnۿ[K=y?'¾ҿ#5(]D6?jA}Wv?8գ?}sￊeb/Xm`2Hq3,lOĪFoWλm?=;?iN(&6<@; ?t?Hyٿ0s?>S "?V)?qL$prf鿒M俶*5=? =X(?eLIݿ,?@mӿ$kYǑaK%տ<n?'1u*,tￇR;ƿ?{/U?ee?#G?z:g?Up?k ?.-??:G?4c޿SeKH9o!g7?G?㿈9Tb0Wy= ?PKX2o8g!-?bb첿r\ο1,F\Ow+_ࣥ3ȿh3z(?ɻׯ>b?ӗ1’-?,"MZZޘK(? TYf?KY+J￥u?Snl3?M5￭?g!|4W޿zLr?hDY&?C͜}(ￎhtjq?Pإk ^D2߿[J?|b?ҦVx6:i꿒h?=nHtNP?W#uQG?Ӹ #Eoر3;?WE<)E!n̿ 3?y )$H#S?K‘? 8羿igK Pv|\`$.?zPW_y_{>W[ ?LiпlES $Fdȿ04kXп ?8#a?;mV ?p7/N?'@g?sÊ ?r>k?Χn?jczU@!?;8_(zۿSG?)nzϿmx1(? ?;[?6zu=/?vy￢fG鿌gf _?\e˴?D#! \ٮܿjϭQ5GGP3EgN7?W ܿyb'ڿV??$e꿖?i5#[?e87j?H*')>뿟!!6K$ TO?T'D?L?ړׅ9a d-EQ??RM^4'?_lӿ>|?` yM?ŗ^-ҿOEh#"gr?Ve+?G 8?ȅ?LW=X.1*?E_8?iS{6Įє?,?|{:\ܿJp BNH?3?ƾ ?( t?X0?FZ_?/e)?`Pֿb_= ?dk ӿNc/Ǝ?Y_Nݿ 7?S}?mbD xt?o«?"ϒA?p{C4nF?V6b7)Tֿ?h}Sm[6-hFq $?Ef u?%F5?t=5?ĥ"sͿ֔翀Dq?4=lZ 9!#b3%˿%Ĵ?zv?z8J`[xkܰFw^W?xUj?kaL?md|>P)c?:F;0Os忶+sk?-? a[d*{?`?4M㿄ؘ`?@k47\ 0?EGh?%vUJ SKh=w|??kyk?ёJ.?GЍ޿*5濙34 vlγ?E?=ǿ~Bx??UK9 D? ݚ??:r%;+GￍxՈۈU4?5L?L5D￿ul!?Dq翪Ȏ?Xƽ?ºԝ.L2?tuݰ?"x?kzx?@;Կs@8u?x[η:/?S?x}v ?'4<;6G?T ?ӔI*>Eҿ\Q?gR%C??5?֩?I>7O?h ??c?X^ bE?U "*??`ǶY?UvHy{Gѡ? H!'-mW 9}B+y￡\w?]PY۸?*M?ο }?RJLJ?Ȼ8w@n&?r~b?E߇SBd?Z?]ABп3;#yk#?f{tIEs2|*濝"lRD?O9 ૷U*? H?>?&301Fɭ?UXⒿFRzw66ؿx)?w'p?n?[FɿsA+?Ga>ӿڐc%?:(i?F?gE꿩Ox?k?G?g8 =xóxۿru]հȒ? 27~?m#a?zٶ/?K?U8%X&5?m`3?n߱ؿ?׶C<SjQW?RΎ־ʯZ׿U0?ܛaR{ѿ M)̼#N]?tnu?&y?C/?Zs5+?9b㿀M??׌?noñ?7D>oK?m-?^?3r޿S_¿F?[RKR7E?e ֽJx?P%v?k.ؿyAU?M.18?b$ws志-S yͿ07Y ?:~ʀ?GKQڿ fW?/K࿋ʜ% c?c~|?.?Q]ҿ[3>!?vDK߿́/ݿ11sd:%w˂?$&m)7T?m\/J?չƲ&?Fw?ƴy=W=-?cX|<+?X?|(u?cwn\?k? 2?h?8~z,~)aj?TY?5?g}X 쿠c^gX?Ӯ=|?* 3ڿP-?3YP~Q?[a 쿜cX(?10o˿EeB?ds4Q]G? qt.ش?."?1"뿝J_YWe` kӿ<;?wuS? 鿮'A_E;}]?hbZzf ̿:f7-9lj?ل=^9tv ?*?(B?\ۿ ?7⿾+-y?VP;?lOE?<{%@?:g?Lkםqڻ0@~)Vܿ=u+Kr\?CR&?!w?zчￊin(V:F^~Gt㿼*׿36 Am;yeο(׺CXￒJ?&Կ[J Lֿŀ9?ɑxV?Ɔ}7w? *?h?e`?rss8[?&(!ΰj/??Nȋ4R{?Q|?.']?Ry?GbR8FHbߊ?eMe#?qٿ=V翺pU*?:u Z?N ࿙:N?1Ŝ\5࿝RTpj܄bפ?9"?FVrտp%3?0Կ][׿JP ='-?#I]?CcʾF?Y;u?aۿX*e?MMh?` s.oM~ڿU?Vdz#ؿ` ?f_{ArX?'Ubv?i3?{և쿃;Q?xhXkW(?&?YCаGؿa_2iF\¾MoLB $2wrmR꿢fv?V*T ?ށ^ m=Jw?h e濦Y̧?xѬxeU?F%O]M?RJAT??\$fמ пE&?B0ϕ?/D~="b?b[t?d_O?g f?D FD?V[?A7?o_1~HKq?͈7ϋZ?-?}bm쿷ami*ο'm#?1?i@=?'<,?tgV?elɿ)뉕%?䧼?`m{ ;?B^I\ؿg?G5yaLH?)꿆Z@X~FĮ??z5.mJE?,l{ƿT?Z_ 忰.?ef^>?> Y.D?vE?\п :?zsO9?ge&?*;?k_2?b>?ex?*z:ݿ qￍ CCt]N?f~>쀍 my?ߦ +?t.迏nT?LQEʣ?GN_Q!}x?q;S͉D?Kv-?VwmO&?xzU?뿃62? 43rۿ{Hk?Ό㱰?[b?3 jJZW?C(KSz?Ķο?m?>/B Tɿo  kx?샀V N??+qQ18yV?? ~6zf?Ca 51$nN¿O 5?'t< i6N³.M? YEK;\l?x{n\ :77?s?Usmؿg+z῅H.{?GUd?/\뿉y _, NX+F[6Jeӿa?|JG[[wB ]`WJ12?d3տ-US+ ?u^֑_?{C"D?IV I࿴UƧ?TNq:?,fAM? !SEMB?Is?W翠_Cw PvTѿ#7࿹0*C忎ܾk?PIa?4Q@_em?Y9?*s7ȡ,Fſ<[-/ Qo?~xҿ/J}?]?ؿܾlNưXO6)[?`<_ٿ%#M@?>YH ?$??86Ef? 6Qp?ZW YEtwI?\l(՞btS3V&Iɥ%XzI?@y92k $?k?H? %yj'?,-Cb̿j"?Y&?l(q\?`9k;~?䧴 ?i?֙=y?6}?L"Fy?B-1@Ӻi?jY#T\?B{Ŀ[|ҿ91$뿊4~nٿ ߿g al]ؿ`Ok^¿è{%?N?.|꿱_1@Cm?a?Ƽ?j{ 忟~0k='zK?ۆi&?AP)ڸMKE?\p̿ 4/I9?e?hn?,SP*a? 6bؿ8ῡ^ &/߳?sntڪyF?_?-Y?D=B(?i.M?XOȎ+2?zi$U"?P&Ԕdڿ̥q?޶}=!3wGͿь1y??ΗB ?Vh |.?VN? m9[_Ec(?+3sȬ返3X?cοb d4FguCi`g?'~\=R@K?1=?ss?RӿlUyY@B&KD,? }͝쿢%޿7VpEֿ[6cVb??`sk??(?Un݂ 㿾 #-(?e(rͿǗcC?;ĐL?M/ ?]޿}w?144ױS- oￖ;>ۓLٿ9էrVI~KL&BݿrZO?| Oа ށ?9Pڽ?J,1|~?*{?I׿a鳿zMPޤ:wK?jM?"\-Gp/FSlʿ_ ￌS[?mxG#UZd$W?N5m US=xd?y῱?-wD?U~?%?UE?>o? Tá?c8Ν? :Û UU 1Udp n'¿54iq࿙LoῬ s翸2/Vt~:?8ù￣p?턠Sz??S?q!(?z-jXwtv_&?"fb@?#lbPkbC࿼F[0g?laJ?K7rI?⺆5(?) w¿?C_a?3mהU9 ➃+?p[՜ٿA>l?`$f?;umvg.dZ-^= ??jLXݿ>JX? ,޿RdAg?+e⿌?S噣?NqῂdI}鿘Zwj(jJuA?Ǫ\uOX￵ǀ[GP/?._?أȿa?Lba⿿y?2<? ?( ^?pp?\?C?6ￒoV8]\鿨4ʺO_N-俁;O:^ B/R#?wePRq?An￵#=濮AjV?jV?3NHDFByN KOkcΎ?< ^?vw*'#)O?)U(c?.5z@-4?,ʗѿ{5<]?yOp8:Ip0iٿ;bw2:VL￙r}?6MZ翐H ?zr _?2,7Ŀ7'?聭nȘMlPd?,^?ƍz?#U?()MH1I?"QC?$!;? mY|7_Ώ?`~ؐ7p?L(,I?T^ 3?}u?qɐ GP*Dr?#eRr9͟)#D?t꿀>|p?sz3'x? 24?, y?wiD׿I_ ?Urڞ:^ڳ/uX ]0eVr?'x[?=6?Y-$ ܎2?s 4{Hݿ6z"U+44?Z $q4T 8o?ݤW?9z?p Nۿ2#?sֲQO%~/i?bo/E쿂w?~Ts10ɿ45忆 h?ɗ,^\]@?a?FS?'9?,'D(?ڞH?ɀdž&?Jq8m:?aLT?:݀ ?͸ H7?ɅpI4vNd9e7?W {뿀sx?Ԩn߿Ś>~{O6? ~Ղ?M@BR 还3*O; ?QH{?$y ;ϿTc %?!-}?I:6ɚH}P4:?bVUҿiʼn2翕&?|xBR?6g?(-?˦r?d[+LQ@?O~?,*?,̘Aj?R4?"5#ӿ6KW?[iӿb>Q=Կa?GA?ٱK ?io?@ʫқ?;:<Uw"6HZ{0Vq-:Xp?GIM[7Ldi述!?s[?Z4 x$Ey?S ?? Զ!ʲ￸i񠰽wdEzI ?:Jr1S?=faNͿXpE?Xq￮3-?}¹KGro?%uޓmXK ,Q6eTT.?S;Ǡ?>&&ac4?H<\I? N" b? U/6^ZE ?u ?J?o?'Bpd?QO?'/|N7NA濳/,?Gg￲B8mͿiS0c%4?F~?WPЫ9&@@?+?ɧIE\7@?0?O|azڿZ3UVl` ?V"t?! =T?;5t?죯 b&rּd?gWڛ3R9C7Ώ?N连 6*˙(a?7'$?1f,?t(Diq?ݟǐ},?6! 5"K?rܿ5$>% P?&3YcsNL+WQ?b|?oFF&m\T￱z?쉎r-?Bs?=8?? MU Σʿeѿ|?JI޾?y sc?Eu9pZ5?9 G?*i=IdpS$3?Rc"?6EQ-޿2wdǿ> $?o=` iSpͿ|h[56?9kdΜͿcms~֝? 0?hn'A?/")1Aq VN?&6$X-e=?W u ?_.CLkg漊ۿk J?C\Aϖa?<-p>λG?2.?){99ڿ`^o?ݪYA!?BAc(|}s/ݽc?"?TiΝNZ ÿS|? w{3rz빿<&N.?|?掔\h4J:ʴ? >s)Z ?DXZҿ #Zs' <?9kVv?ub ?t)r(?Q"^9?DNi?B y0m?WV G?dￕ]y}?xJHඥ迉P3ld:?n)LM¿3Df?]迶 KǞjӌ?8?P;Q?V_?,YV8 mٿJ9&(? [q2?8YG?Oq#efpm?$rZ(}$$N׿Dh?13.$DK[l]m? w׏??7-w$Vhڿ,/ 5A?;=6#s?}D"桋?1d?;皗xJm0|K濯Q?Ĭ?'mf?KO? ￩п$8 ?`$WÿOf.?)x?JѰ>?$cdj=忉hpBa?NVt?)w;￿8%?CTK? _??Jpd\ȿ"J~l ?@/{?wh`]Y?ga&? ?=c4?]#pￄɷ?{ z;v@mh?D:v4l/8α?t??ݜe(2J?`e2?uK?Gk$UiӒ?-vc( ]?2ÿ6Ǿ.Ί?3?:>N?8)wbzI$࿇On@LHտ>?D@1? S\㿼cw^E!ο}?N~[h?*?:s鿧JR̿f?GK()w?R0 mɫ뿣~1ǨSɁ7ῡEy0?uI?6! ?ow?rہb?os[!ӿZI?I35&?>c?O^"l?{ Өu?;?SY8?"4W?u+?[5?(1?8f9$3࿙i?F‹f&cￒ1 0￩؊e1YC^5?[.E]/翏~?J)?TP=V:&|J4?KpX??ax+濻4zS?]fAϿ̇ë@ȳ˿{co?kOPؿy?`??D?T?_wu?B7ڿT2Tk?z?i*55?( sW?mP>$NϿQ?!F鿃t\Cf ? ?9w! 꿞Lְ?{h<ڿ"֑߂?:g*?n?})G6@~XZ4|?/  .U0]?!~߿9Ք-?;$p?K?PGￊaf}jkEϾMgֿa-#)qv鿮I.濲 y?ꪙl[`ו??bL pg)<[UuAk+ PY* F U:Y.?l9?Mx?xK ?Q$?~0zl￰eKd(r"dAMR8 ?jx@^п*նj??qoNe뿣! s￬i?!b?g|wu6aǡ?„0XۿZiU? ;߭+??0+n￵,%IWￖK`f?)5s? O`y}?EnD-TJ㿋(b}x?FwQ翟~ec?遌 o?*V% 뿹Bxv?3[|;Xw￑u}pj? o*s6t?^<8H2c?kCNݿ^97*Cp?fu?fp5('?R,@ƿjֿ~n:w?ք~?ӎ??1sy@뿵9+Jq2#?L?K0?I.2I?4y?=Ty<5ֿ/Qдh?q X$h?J&>?^>ѿ@< Q]?@ѽ_*<;8T?.!?YY??֮·1VImUv)E 뿠6c9?\p1?O?`GN?'O￩[1fϫ.O薩cO-??$ͻ￦=ȿg=(?,`λvu?C>"7N?>?Rٿ+nUa.?0,t?<#[.R(&2/t?: ?-ԡZ} ~?Nu2?Ke?`2bgݔB^?ރ~ iL俦T]?d?}^ Ϳ8Rb.޿%^?t?Vſk.E q7y? ?k[PI s+?d"￸ n?XF?@'i￪cB?0l_?p{ￒtĬ9߸K? x?Y:۪`WPn?b̛Cǿ\Y՚2?JL쿉]} ٿ25@׿֚i?CQ_?A?e)櫭տ+1jI<ʰ鿭 ?Ú>l߿6;?azyۛ;dVb|?&f-*Heӿ$(d'gۿ52ý?3GCD^鿉k*?}P{b)U?m^+Ffпiti?9:G2G>J%?nMja <)Oaze?]n迼d ?EirI过,&?+c^?V.'?\ρ?j4sƑo?.jQ{[N4CخNv)m?tB`?klT??1cXW ׿sE3.*Q 0:@\?@K(¿?h~S?(+S\R6!?6;FοlU.kPֿfmR?C#ؿSA5?Zu)迋> jտ0*7zI?Pvٿ?w?ￏޯhɍ?p? \?cw??M5?&SFӿ#?~?Ct?I~Px1?۵P?׊?A8&?⧠쿴>RлZ?g@ 濄k,x0F PG쿅 7]뿼xпHs+$x>e?7MA?/p?4C)|?EB]oHoTS=L?}! ?VN̿/Pob4wd￣H?m[>?ֶ/>NW//yt駌;ҿ`8N?#6¿rA\~e?q.ȿ֟h,տ X:P1ܿFu3`0Ӷ?FR)5?$,oWzR 㿅Do?\b=T.w?rU ?dM=?\LgM?Q]d?A鿈&L?E ?)6?11װ8KԿ`fF?R+?6?SÛ?dpܿ6|[ڿf߿z[ۿqx}S_ P׿BLb?8xb?HFۿ m?jK=?uow? 3׿}Rީ?޿ uy?`22?_Os ?:0ʻ_2^?)beְvI3? @g|A?1Ś?V?˞?'U8?l-LM(*? k俵 @b?_?K9?9mF@?/`u5`?BJ/ui쿩v:?R.oܿq@?TbE ?S??e Hzￎ!){3?AHR=ݿ]ۿ qK m`TￓrD?^:u͕N̿F.O?1P?VH&i?^M?LֿCj?+C4?CMz] $?}?-}D?9ԿЙ4? A K?$翐[?w%i ?غ)I4?~Eb("Ry87?;E Jխ?c[?B_?Ժ&W ?V[.C̚Z?tNؿH Կ<鿷e促ng?T$@7!꿜ڿn(Ϳc#u?=<ݫ$xֿd?l@¿F9?"?xѶuH?8^ӂ꿈Gr?y؍א ӿ_#?qrGؿM?07Ě係uu??{E=Pz}no?w;֧?0?ԅs~_ֿ~*?=1{ۿbc;K>S >I5hiph,ݿ|N?|fX9x#x?T..;#r߶??i,ReQfbF TaU\?Ywݖ)?SP)Fm=ۓ?klhϿ#S\ￔ5^v62?vY߿T?5|S?lr\濌6A?RTZ@ HῧQM?޿b?=*Vj?Ƅ??.zܶIusъ<W˿9Q4q?ہjuCſ`?}3vޜ?Ez`/?~氲?[9?ҋ"?ɒbx?}?ې^5?M/xK?2S?X[??w vk3WƿAX?煰Կ?FP-?ￖLeCk*࿪f.8Vd,KnLuó?R)?d׿ƉE?4:?V|]'?Q#DOWXz?F r/Ŀ̈FW;?doP0[޿s ?^~NE?vts*h&¿ AF?Cɡ^? me￰VCj쿐tn EK?繳kѿVL7?0DaUZrDnῐ=w?Y-2?{"i\q?rR09@ҿsĦ?fgO?:D;?ɁUD?S(ΏqMݿp O?eG?]ٱTo?r\?W?F#g?5KDZcHye?435.f׿?$v@?]-i?>!?IxiޮS@eC;$?;`_7&|ȿiեtS`? P4PN?em쿘Hýƶ"?SV? -1AlՑ?t~.?rLnِj-꿂Md ?k?tD2gh?#?^?v2t? ?j[Ȍ?;*?fb忙b?r1Ȕ??2Û2?`9ާ4;Z?W?؁Bڿ"m 2ZvhSo-_Z(-CTLvҿRgF>3?.?~ϬXV#?l`ҿʗly꿖ä￬pMe?1NMF?!?t-M?/W?npΪ?c?n$c?`I?=c 6G] !?AhBFb>K鿾?@BHvÿ;&L ?5X?TJ :9_ ,`mu?<.AYX_(֡r?_}oq޿tͿ[yc?ztsF~ҿ9eDirN0?rȋ?v۱xmA?}ڊԤ¿r/,`\)p-my1?zx?@?y?<:W߿?v࿨t?fp4}?x GſaP3?9 ?@?uQGl?gy8?*i?;?s ?I~ ]?n"e1?JUZ?ʸO?4㳎$?5dU?W?rￃ[i¿)??ԉlm?J~M@hyXҗގ?vKDƿԀ7-jؿNL-??VU:W?p9Io)?/#яv0(]?{[n?pta j}{Ѕ]?`Dʴ/?NLɶ?5ſDR[M? ]RXͿ#dd?jP?F:Y &N?j%G.?M3GS&?5񶉑F 9J߿*?O?77~Ԭuٲ?W'w?z-]*㾛U?KA/忡䰨B?({z?7\_[ ÿϑ?(n&@?LwN VI]A7aQ?%N$ſKZK?K)ￌb?P9`\zο?(],H\AQ?!$Aod?a?c;Wq)TS?uI2ٿv\=쿹<~~&ǰ?<ߢObՐAc%(?h{G{j?uaaڿZb2;@Ugazݿl,gq!D%w?%?ڿEh?k)NJ? |`T?!Gr?(?>?~2`O?#2T#!A)? `q fj޿p=ɍ R⿋$W(?pJa?͍Nѿ&x? ͊?4t f{U/?QPȺ忯*CLLο`.rԿ:D~^},?*迂샩?, 9F̿gϿeHXۣG7aR 4?[vLPѿ@`v˵?T4!^j_*?7& KbCF q_5%r??e7Dnfٿ1{B?jFMÝ<M?!Hknћ?P-?).[b?c9,>"Ӈ?$@cQؿ/}p?J\?-g?shxb{ҿe -AvB(j2߿-+-p%KϿ')?ՠjY?D !6^cѢ5j?c28i8+뿖RkJ;)?B*k?d"@~Pu{i?/^u[u:q ܿ*UN?XH?1L2￟K? ?Aw`Zֿ~_5.\?[XE?TI?F5'?@a$ @]?g|?)׺9￲R5~?:这*?F쿰]п1`O#?C烤nq"??|0?AےM 鰮￸+6==?ZރcK?`/G*~qk?hPJ!?6LTb)?#S?L/$?/ ֿ #?GtZIο͚) lG]n ?t#|U?N⿐"ѯT|[49?}i0E(?_U2Ϳt`??Z)Ie?$P?953*gCb|89?d4h5?x˵?wx(D?j?S? ':?{&?bxO?eo`?ܗ.O?D4O2?}0(￐UmN?H?zLL?y3P?xJ?k'eK| <ڻ<0>Ib?'~O-pU?`=[?.Eۿ@r:?B?ޯ?*)?vIG .Cɿ464y݌<9dʆ?ÌJ^̿T;- X^/JP TyMg0y"G4?]AT4c? ?J}~O ? nN.?Uj?VA?5tw?w ?5bG\.505ῠbZ?AV? uￖj{Cؿ(e?Q?>2?k0o?_d)?JwHڿIx鿾G)h?U ]7XT?=!v^࿳ jP?2C??qdb?hjN?B?x#([?a۴tĿ$6a翎M?.H\ͿY?veuT?yT)z/ÍSg?2aAٿ7V?0Bd?7;FM y?sPӇWC ?If)j޿r2ѿYyۿa9xÍiBhk??K?G%yj+?%?U3f?f?.?Mo5?/翂kY~g￡P?IZ?kk'6?}㿁.{9࿡0ܿ-vr0K?D\?aյ2{ÿxq)ￔ] J?vy#翌$:-2LD5?UDNŸԾҺY?w?42n?#?E]WG?(z ~߿6?2͋xjj3*^R.?fZZMпoF?7רpi׿mt"R JQ?m?o|wۿNL?|퇿?_y?&?kWM?k+ `?2_ʩ8(?2 ?1?18&ZؿsNￔȱN?{lɿv{(,ܿΜm2?>ԥ뿧DMD뿐̮atNEus??0Cwzk?ҳ߽J8￞OjӘTh ?zidￃήOoܿ+l{?SC;|_m?y<޿!Rp ? a?^WVܿ?rnR) 8Sӿb ¿nYTWI02?͇?m]?pF?0i*GƿnBG?!YV?_ĒrI߿哖L?A2- t.?"?>#?6ގWmJiտ:u]Cs?Yo?YUݿGǡB}H?cQ?"]忒 C8꿇WVݿHq=ox뿍rg?tY?O 24~Ŀh}?]K' Tܿ,CVܿHv2`ք׿?Q2I"I6? >̿?+e ?~ڿXr?N ?5韠?VN?Wpֿpئ?W?Ncؿ邮?sɑTԆ?n?鏮ܲ(7@ʟȱs׿yrc }iut\?bfL+?]<ￋJlN?I?r?N[UwQtt?}½K? 4u?eeqӿW"a꿾Pc<?K[쿮0IۂȽ1$WL応 :;?Ւ|{ӿSI]?5?JByV?]!?+?eOPjdM ?"t?aC6Kٿ;N?+G]"?><׿uݸ?dq?$dGѿ:wȃ#!bݝ?0Vv?(<}?Ϯ9~\=x鿭bgK?H?2(B1??ljC?{[߿rBD?bFv9lѿE8[ ?]b?7_XPT?CKLڿpr?lT?X|P0뿛9heTO(1?'r:?=ڻb??oޝD'u3Ϳ@Kڿn *@`lR¿jSh+إSX[DfZ?`?GzJM?$U2?~A LE"տS- H?mޖAmxؿ ߣп r 꿈l?*T@4A?޿Pפ?wA1t?):Uݿ( NMv?­ϭ}-$?c|!9[?#K`?Ϙ,?z[?I|ƿ^QFwx??G3w ?3JHGݿm?R>&6?0ttbqQ~iNɅڿOIڐ?r['1g9.?u?vng?>d?:"鿊ljن?y?fg_?` hm ?^?fҔQ? ʓ`ɓW+2 ѿ&f(g?Ȗ4?!ݯƻ?s5t!.?0qi8?([B*?!'e?Ԝ.S]ƿ Cc}/D?*+7?[??{Lڿ_ ?v(r5nJ$OyNʫy?b@?p ?K?0bNթ? pYc(?߱ݚHL/ʿCEߵ?|fNef?LOX?uO/x6'gBIBC?P?Ko[?Z=?% Ӑbr,￱l Y?3?qO{?ViGS?)bk?~?r"XbsݿhtZn*?͹ߤI?$$!&￠sEdпhJw2?(t&?v%K%lY[oGۿ9f8m7?v'Y?"wA?~Й-[x쿃BJt?2X??i^m% H?EZcq7?,U Կ Y\쿋=yq5h#?/)Kb]?c5X%u]6?>@'?|E?qd)PyZE7}?tJCv 忡;?k&-xZOVп|Q^}2?ͯP&࿘TֿUqڰl?[R*?!B忪ie?N=㿴@stӿb5uݿD/<,Sg3?xP̧X9AP|x0?SM?/+޳?m[!¿_?Ήնƿa힅 !L?g''?^p_?wymnwԿG,u?QT뿂X򻲠ٿ_]/?^ ?ɳ82cnJkE׾?œY&??ݒ?1J^8Yoq?!ik>k!S!ofLm ?Ӑ[?.z]?Ai??|Ν1E?'Yxʸ?tYao?1S?{h`?UbpC?[Q?HZT?Zb? Ϲ?*7Ψ/T?-Z5?8#?ty=?nkԅ#?Op|kbLw~ܾ i-#?$f激IaSZ*\.?w>;StTs?}xh?rI7c?O[]?X$JU׿vb^Zٿ^1|_]cSg8we.7迀O0?1 ?ęￒs鿅7t>b?6%Xu<꿲r?6 w?ʯ Ŀ쩑#z\?O\? ?is1?u>?_jwD鿔945?9lN?#(?ʧ$Z?F(eP㿗K?js5?Ox쿝6G%?0濰D?oG?nGU?$ N?v+ ?~d?o ,g?0 `9?0md?t}H??12`PGdw?h$@HJֿS[A?hB? c?95U=XStI?|[@u￞,R^y?#mq^Β]#)?H DKqF8=4gk?s=?%'ɿQO?'y7?J@濮`?brR?JZ`c-C?{ťU{CyQN?Js}?$ z>?5ўd".I7?%V?2^?Sdy"XoJD\=Txѿ[o WJ}(m?J?9xZݿN3\\|6>0Q_vi?ɛ qe?=&?-Y?w '?ܺ?Xw￀=_?}ߟ@l? -[?'3?̯{?<H"0?T/@ ?@f?e#AZi?lL߿+ꞅfDܭ1"v+x?u{?D?{Uw?? F?^Uؿ?6r^7?)F"I?ײ%Z:޿@#ɻ:?q??l2o%ֿFk?Jv:E-Ƣ S$&IU+? ߽(H?=U{?+BK޿0qi??7U NC{?~^?Sl吢_c?YqO?$T'|K述Գk?ݿ'$?\\k\״?{+j~^߿竾S?Jei?]Q? yῪ;1X? I~?=? ;x ۿͣd￷Bx)῀?пv?%?\ÿ~k?;ltp[Lҿ:YX`? ضm֟ҥj?*Ǣ/?<@_%O?q˿ o?qo;}#?k!Bb=?&)Ռ[?hB" B`YW?G'Eix.~?@ֿq?鍉x.?L6b #? m ,?Gg?ehCU{eJPO?SFIr$?Ut>@{VǿT%t 00%?VkK ? Ov?ߙB?L/&`$&;/<4R< ̿悎fC?b_:+T?Snx%i "?stDdNؿz>?It?3GVs߿\l?F?7v?;[de꿘u?a ?Bu*U?M ?-? An?^};4?wSB?ljQȉiT ſ]lRzϿ<]8?7SN78G?￲?b8="cU҂Ahﵝ~?;nD?>ӉO?9A>?b?oN03??,?XƫdnK`|jQDN- ?_UCf? ?Bi<^Z?v?)^K?N@hMfaۤf?oZ?ac翵S=A?~P?S=]ڿQ<9?),b?:_p?6x?;?|R?V[+%w4?uV'0?*U~_?b0|^⿩ٽr0gT濟 t?I"a͝.Q?/{76GUm?jm|"ة0㿇;s?L ˿^VQ?-uN?Rk' xZaￋqT?ֿE{G?;l]W?5h\~ ?b!ҿTd?\a2UVƌy@?WqEZӚ?x\e?[Ԣ?uxxe￫s\?B=*M*H]忠yG}?J7˜D-k.뿾~}?QyￇS8l%D?aTї?@5)N kY?:6Q￣l ENֿK?( K? ?&Ӛ|WY樮a2{I?l*{?V ?#drPɿLu6?DeTbￚxg%?,dҴ1ѿ`{B@ }55?daĿ{пٗ⿴B ?ZKT?ݱŐ&ҿ=R?bω￣])?B?d 5r?>Q?f۷;8(?,"aSx?۪P\?Sr@?b¹A?!4?se5쿙 /*ؿ $(z.5*YY?89TￎϒιU?sd9$?,񰓌?{?6U9a!kڅ ?$[5f߿Ffￕ0,VͿ2 \޿b?/_ 2?S[ؼ0} >TIά?=XT?[E1?u̯Bϩ!ݿ?ʾ-?}?T +ٿuֿXCB?dXkinq w8?JpV"i^s?iqiտhp8Ux6C?^;1~.?a ? rI? v*5n?GKS@?ӟ?ƞ?Y?#?ScJ[%yֿ[Շ.?P?*?$^ۧ?+NL?lDkpjеkJʹ뿡+?!??B^E`fѵ3?ٶC?bW[/LЦo?ABi'?uձY;ῢbNOaX?e/bqZJ-"Pay?2y?}"y?e: 鿲b追O؃Қ?>0?@55A*:y?1߿\6\oT(}Z<쿒?b>:)b?@?*d?9L?Q'?aX{B|?fJ忂O,߰ ?a((($edz?\tU?: Ɨ׿#{?f:?Cۿ?=?B (ä3oֿkqi5ӿ猤Կ^AORNߪ?쌱yp+ibe쿇[Lٿ?ln?8]vQ~?g JiQ?gN俋dM?nC?l޿+Gƿ8uXҿ?)nA迏4c)+/bx]X?hZ먳ęM?tߌ+*J?3Xś[y ?ڝpп; >JK?# ;Ǿ? :H0ɿgu.ֻ?ݨs$?Jjw2%C3?]4J?ŭ|@(y?e~߃?\&=?;&ٷ̥qc|ZaXп%?&?v-u>Dm%Êֿ…W*ӿgm K?%Mʙ? C?ʼ翈ۥL?q: o ??Y$?p?x!?Uￋ?(?WWj￙G&c{.A!|?{i?Jl뿑u,ֿ َI?8}G?͊C?$וQ?$?uD-͚追k? 4]xZ=VHK f(?qp~)_h?e=)i'?!~¿HF??K{r?4+km:習x ,? ?gT"t"p'G虿R"j?iѪ핿`fDߩvR쿘!J?\E? ?o?+F@:~? E[b; ,ٿ$ZHה?] Jvcr?sQ ?Iaiÿ.Zp?5krU?i?c࿯,ϔ ޿ k"?xlރqٲ/+ ?W9ӿE% ?Z<.? P? ؄@|Ft??#8 ڿ-?k0J?] .m^#?;c~?̔K ?e~?o?>KPjԿ+v$޿ެ -?@0a .忴p졩޿$=?"Gk?>dob?N+鿓ۍϺ?7D=Q`kq#?7I=%пyb?w_?뿮@?[>տȃxXM?SL3ҨFI;K0 J?gݮF5lȠ? j_Yv_a" 7?6T΅B?czo?x_ @~}J￩8,Z?>aijܺӝ?¿m﵂Կxd&jS`tĐ~r߲??ۙ:5Dx @?;N?ǧq?̥:?Ӌg?T^?ǎ'c˿~UHX?)Hrnh'?b5z?8t?K;}ӿ]uƀ?7ڙpX?{ȿ0qK_ �js?a/@?mǀb]X M?o=Q?멿D?7h%0#?'87ܿb +?W?Ǵ:Cv?K!?Gwˌ?I(7ɵ@`%y?\IPMcl ӿuSϿ9{Y"俞1п&Rbпu̥d?j#â?qS+\V?gN^R?!")@?[￱^d¿ (#?E6?[s2dYcӿ| kćڿ͛?j?Y~?/^? -l`QCR5׿f?/ή%^Sa?~߿h*hr"'?Z~F?c?87:).?R[?ޏƨؿ K׿5m(׿Z[,?Gw˯xѐ@{8?7ub= p/`"^9x@?-ů8pI?8:I,D|翂t?[Pm? _??igAcO￧oIt(⿅N3AW?MK!H?=¿3vKy)Ƚg׿N#|J#?sA_es?d(OYndix?9+$xBCIc!࿾NQmzҿ2?)`]dP?,y?0i?`FR<~迂f꿉J?fYgg?*e}q?:?fh&0?. nu~F?Y*a?]E?A%ￔ!'̿hQ?\1?5Dc󞽿DUv?iM ޸?Li࿎4Ё?#p۪1F!̰P|}#?Zt4J?̊?ᘞ?Vב?4?B7?AYEsÚo?q:a;WA:ͺ#qޟ?E[?9m?t翻$W,?\+#lyI./{=v>`S?/ֲ&?UYoۿەC9,? d?K%j?m7鿩)15C)ƣ?rFIe޿JMS?R'(,?z׭Z?Dف&?k U0 j-"oпᱝ￩u`? +1?[!Ṡ)Kv>NZ?чvb?o3Sh?Q똌 -ſ̙y?޿^t/?ƕ?[ 1i쿋8u҃ZI￫:$ץ@?A`kqƿY:?Lm?QX#ǩ^nW??  ?!pօi߿7Bu?[O@2?.n#?G=?Ֆ?D?^$?y5?MWV?8?aUҿ0_ 0ZAQؿJ.\K7u?7)?o/Ҩ?>yzXF$~U ?8?"3"|[p\@4Ybk? L|˿NP?HdO"[76K=i?'c$?odR-ۿzVZJ?P >p?)_#1~ֿ|*:X?@1 ?烇?6 TY?ZMÿJBKI?ῗe_=Odڿ}(]?Bi f1Mݿ_Ms=>ZSo?OrUtɿ}¿568~m俶]? ?Esa8l?Rd俒)´#ۿ~+;?h ՚࿕@5?\0f:/\oV?93:d 俞֧?rd2>J$4>?%xɩ~?8a軿ܼ?CUy?}=쿎vvj?+-׿C xí?y? ,_? O?NTx q ?] a|m+)ؿ̉.6^N?qYEJM׿gK}?SNN,Ga ?+*?ɸ>?6a_ɿ ;￶6<`+q?rDpc_Y.?P|ۿ;Nɿ_ns?Lj{~r?9guQc=? ʁѿ.1?F?^ 3?܁-V?_N? a?58m޿06׿9VҠ,-}R`k￶cYd}?RA?P$ESC%Emv?Oh-?T|cNs+Q?̐1͜?0?IW\?#}2M?`7,i`r j_zK/2M޿6KY?!Q^迱ݿyOOǿb1ؿePb?*6??O??eNXd >N#?;V7ٝa?kh ?;@ Al_s?\>^/ľF?7W`俗Z2, ?|oh @ￂl!ÿ^Z^忘][ʶa"Y￥'i?G&Hz ?QPH^ߑ4ÿ?'t3򄿞Ut$gڷ?= k/j"ցby ʿvlO?% ?}TSGMݿuƿ ;X5 s6?bt?9??8G+?'5?Q )}~7?9U?~f濨M޿<}"Ā?Sڳ?uUM={Z?:`|?wտ/?C+.cKXҿ7Iqտ;5[t? H?hJ+'?LE?Lz*oȗ9?uH /z- f5xL࿼b?"9?,gͿѬ`6)J0|*#?J„ۿWk($6(?] ,?o?F’%#f쿒A0#B?ntxLп!ͭn?ə2 B^?r.Wqt%I%Z?:23kDH?c?!?ӊ_V㿅sԿ; ul;?1AhǗ?5*?06?x"!b?LO?͉<]￰`ջ?*W?vj-< ?A PY?q]?E[?D*οM ad(?t́?$Δ?LWq,ƿ@E}Gg"?-1[cE?T?M~Z?(>ￚWf}"c = yyrh? ra??2?j%:m޿mkLyֲ\`+\}ҿ `?_=$@6?!!PB)?JI"? O8{?m ~?=?^r*ￍ￠@fO߿e$3VBl迻B?J]\l-?}p"[鿪 3ZBP?c]!￀?Wb|.dXf￞*P+!2ؿ=ռD+ſ#8\k9a$?1LvУ$?_X/|O8K^쿐 $ѩ7?+%i?OYz8ykwcT R+?a>w}}??߸?T⿚`܍5?9ѿ7El?wƊеt?պbq?@-vw?XQ3ZRߐ?K,++?kK￣7%?.2;?P =Qg={Yzѿ !+?3ܿBB2O?)r8꿢ٚ?AĿEKU:忏PAf̿360i￀Dn?gUfЇ?!d?U~ ?|`?ve?Bo4ǿݿQfATƿ!Lr?7nga1?x&?m~s[?!>b׿vf2j NHz)ֿ/0:Sݿ>?޿E~?G-l79s?wfGlq ?'N-H vyl^LԧF??^f?)( #?N Z￶އT㿌"?+,?+',ĿއBE?VhO?y#nac?^N!?c%r[vat\1ֿoP侷㿐88=?CD?iJ],F<ؿ3q?Ts ?:v f#T:?S~񥋸Gؿv*lb7?'pܿ*2a?`oPÿ;lՇ{꿺W71 ￦fm>?-뿶B? 1?!2 Z|￞Y?e?p1@wS iqT釘)xi5ʿJ6'5?kG?Яj&Ӑ,ѿnY? &}C뿵z2פ̿mE&,?ow-`?'l5"ֿX?'ez#E)3hIܿ5\Gi?^W?x1zkh^޿WB*?eP?i?biI=Q8x뿓ӿ2G? /?ܶz ZABC?V7)L-$ֿ]d4?$G3wu0Q?1/?_e?{8?!mGj.8?3#b߿oVBxz?BпSwGx?ZQ?.e,4!s?n86I?a0?W2"?kjsM? +c?z% LdcӋJ+X jmw1SJ?]T߿Jￍ}￲m?\T4ԿKQo?u"҈!?iq6ӿ[,l!?$Vٿ?,u)ٻ!?yM&mDգYvOA]T;v?ɳ]?F[ءMK2K*h4~xʏܿ3x>ATz/3?({A?|P\?/sh?6gǫ'%7?wt.?X &?|?fް& ?T% ?mBu~?AU?vdه!?( ہIY?˓?H ??gSl?t{y&oKkO?I"y?A*;aB8w?'T ?8m-?:Fx8O q)V?~+x?\~-q '],?wye㿢7s?56!9}**:ɬcFHyecև}?R?|V,@?gߞb?J؈?5,^Ċٷ7@⿉4).ɿ(/8}ia?T7~'~GJX=L鿬d&𹿕]?5S&??? ?FU57#]]3?v;w迤 ?SFFXa?s>?՗L=?q->;ؿ<"vt?R//W;?帥\?%+G?3+N?P¡W?]4~(Bп4zտ]п`21$ Gl1ж?0@?^h￀m];sPJ=x9ῲPҍ?kb?y?'\pyc΋}Z? 4z?I«?eh/j?%?I? ,47K?jQ"u1 o?X?Png?K6'?KCX?1&Կ{"y(??z(|ɿFP1ܽmw?ګpￂ?#/Ly޿=ϐԴA迉??QoJj2?]Yr?+c#p8? 3῱%Oʿ  ݿ2bb%d Pӿ)ݿ2#F{d0e!6a?EGv,?e Շ?M迼 s~I׎?@n]@?`Q,V?dk?}?W?ikƿW6#_?. EֿBHLi"g;f^P-eJ㽰$OlFrĜ?0?a~ ?Q+hD?lD>@/[ͿaӿxD??:"4? p?O?ڡ&?Ih$4?|k3?)uMҿ 0pH?Q9쿋b5F,?}X6n7?Wv翏 &LԿy?$Go?N?u ?ߌ+8?MJc!?! {ӿ ˅Z? Hhݭin"a?%"d8޿U,O0k:ME?xLۓ?3?(?})6?>Om#]?>YnZd^ƿ(hFɿıN?`54Wo?}ڴ?k7x?!FΓr6s?7!?z]j׿Ϊ?ہ-7?0#HI쿥n/}O?:TXS6;|( 迗}ҖTƥn?Tw%?Ϳfzj6fۿTd.1^:MĻ_0?JƲŖ?HW+?.t?~Sk?zo ?UOD$S?'x(4\V?ZlISHE1Xt??￲?.7F"*c%?ÀWKPh}pe\?;?DզhAҺzl$ڿbQ￶$a9翗"ƮqW?@AcG^ۿno*=?=_p?S\xGŭrn`?E~c׿ ?'Q5?Fbv?%U^άmѫT1iɶ6Y?(j+?G]?a-VF`h$ äYc?.HSڿ@q?4n5}dX?cdB?Rsw?Mk)J?[\?0P?L?+T? 8~?Ѽvod $?_?pܨvjnM;6?_F ҿp*?\??ĿӞT&5Fz׿'Ar? 9ֿ*6;?I?dm?*?V?9sCſ|pР(Ìhvʙ?XOX|뿮Τ"*nM}fͲ?v/?w￁8ht]P:`? 0^˿2a4~?W"r{%<$?L1?c翾u~?GSP"%jӿ*$`?zrQٿؿY 3?Xk0 A?C?-;P:y1Bk̦vnthj?cWgt8?;m?%||<*ܾUN?WO&#뿄[[翑zUX?(Bgzn?P%zk""?|JP*$?D*1?ެp?,F9kK?6z?OF\?G꿤'TNBͿ/}*u XBg|\M߿rٻ?ʈ?9K(?3'^$+M&4d8?{4?r^K?q?tQGѿK;աNK?@D?зn{ݜJￆW(?Rv%?qa_g2. 17ѭiMwNʰſ̠?]鬿DkTI/?OS?KL2堊M)gƵGxg7?1'xiS ?٥R]?M޿D-8MbnʿCs]&}?x̿N`?pXH濱ʧKz8?DggDCK#Կ%{pn>??sin_ru scalar structinputmatrix>2 ,Aq+R `wCV5܃oc]}am aZԷ&2 8rq*OUy帒9že1̺#cnpF\LySH9SuOL0H&Y4ooڣH Pmu#$ #n|MC|DI; w:*qF&_f.Ynu[yVOe^WFo͆9%pa#/G0P*Vmna0b?Q'eM8d . zk:eط=ex/3pAeHVm|!ibWUɎ2s*<ڠϫL=q]oa#芴:VeZX{[>PT!!hɜGs҈-ţ=mbmF;Q˔AkFLI\R<'Ψy#65Cr}KTG\^ltrNTw9P:KՎW?>.C#/;vӨC_D日b9lH+RX8>N(SufK*oL{I}]x֘#@YvX7xu!JO/sxsqp"] @&{}֡#lldJ?J~`g Vk[8ei^zgVʑ,!EkHk,O; 0-X=Mn[3>Y &Dž%ɘOө0k9;Xg\ωC_.Ë݄dV6  웬tu%(m%/j,]hHӨX;kԈp7ٛM7{:΢*}-Y[HWFNu9 Ҩv^1D\LX\fc%outputmatrix%]C?\-濿6[ʁ?ZrӿΓ-%+$c[?0l?Ǹ(1ƿlD%!-J꿿1jw?B!T6?"(ۿmPP;ŸcA(RK?9ME:]ҿ%@rӿS% ;ۿiZY?I=(_H??:/f֑ҿA?5$G N?$dW:[?g8￭4?ǘ M?=]Y$^ZK ???l,E8?ŞQW?8Dz?Cj ^rx',b?/m?[W?zaJI h?$?u.WL? kĶ,hg?r dEa? nIX?޿ts7?힢A￠N⿉N:, p?S`=?Iܿ7+Aٿ+od1y@? %4?fVΈAk;4X-c@?r ?Ué H7 H@6q?|.P=?PdN5ԫV>?4dvM?vFc[ѿq>Bfſ>gپ?WgdqgB?#\k1?;hA#?v F?NA? }(?*!H#$2/H'4v?CF\ ?{UC?1JGȿ N$? ￑ܕ?ߒZ¿ߞ?߷<̿{|ￌk?1"w?E?<BI:1ٿݣn?,]i?F:s� sL?0? ߷?߳꿜XFݿs%6w?ի??;L>?쿯]p?Ͷ dd!?T+t?Č<_鸿ݖտ\sin_rz scalar structinputmatrix{MX?tL\? HFMFD?ZO?؍Kc>?eb5"?>(#h(?g_R?'`/x>^.\Ď>v/>p>8>aMA8>\>]jd>rS%ZB>{T ?ZË? ?ƾ>hWJɷ>G ݺ>턕N,>;G>A߿}&>/ʟѯ>951Ε>F>^aeͺs>>Itg>ճI?v^md?)?/.Bτ?7VqH7m?/,? sO-'?q+R `wCV5܃oc]}am aZԷ&2 8rq*OUy帒9že1̺#cnpF\LySH9SuOL0H&Y4ooڣH Pmu#$ #n|MC|DI; w:*qF&_f.Ynu[yVOe^WFo͆9%pa#/G0P*Vmna0b?Q'eM8d . zk:eط=ex/3pAeHVm|!ibWUɎ2s*<ڠϫL=q]oa#芴:VeZX{[>PT!!hɜGs҈-ţ=mbmF;Q˔AkFLI\R<'Ψy#65Cr}KTG\^ltrNTw9P:KՎW?>.C#/;vӨC_D日b9lH+RX8>N(SufK*oL{I}]x֘#@YvX7xu!JO/sxsqp"] @&{}֡#lldJ?J~`g Vk[8ei^zgVʑ,!EkHk,O; 0-X=Mn[3>Y &Dž%ɘOө0k9;Xg\ωC_.Ë݄dV6  웬tu%(m%/j,]hHӨX;kԈp7ٛM7{:΢*}-Y[HWFNu9 Ҩv^1D\LX\fc%outputmatrixMX?GznL\?7FD?ҥO?\ec>? a5"?Ku&#h(?vR?{ /x>+\Ď>T> >8>MA8>tM>+Cjd>%ZB>8n?xe7#?T?ƾ>`WJɷ>/ݺ>?yN,>~8G>1=߿}&>C*ʟѯ>~951Ε>F>Yaeͺs>>Itg>h?~c?o?*τ?$]pD7m?p$b?/ʥ?$]C?\-濿6[ʁ?ZrӿΓ-%*$c[?0l?Ǹ(1ƿlD%!-J꿾1jw?B!S6?"(ۿmPP;ŸcA(RK?9ME:]ҿ%@rӿS% ;ۿiZY?I=(_H??:/f֑ҿ A?5$G N?$dV:[?g8￬4?ǘM?=]Y#^ZK ???l+E8?ĞQW?8Dz?Cj ^rw',b? /m?[W?zaII h?$?t.WL? kĶ+hg?q dEa? nIX?޿ss7?힢A￠N⿉N:, p?S`=?Iܿ7+Aٿ+od1y@? %4?fVΈAk;4X-b@?q ?Ué H7 H@5q?|.P=?PdN5ԫV>?3dvM?vFc[ѿq>Bfſ>gپ?WgcqgB?"\k1?:hA#?v F?MA? }(?*!H#$2/H&4v?CF\ ?zUC?1JGȿ N$? ￐ܕ?ߒZ¿ߞ?߷<̿{|ￋk?1"w?E?<BI:1ٿܣn?+]i?F:s sL?0?߷?߳꿜XFݿs%5w?ԫ??;L>?쿮]p?Ͷ dd!?S+t?Č<_鸿ݖտ\sinh_rd scalar structinputmatrixd@@@DF @>`ͤ`?t1k@7 ?9? ?#?¶?cg)/hjq@%,X`窧eep]%D 9?qo?aYU,'z@j$5`:?RmG8֘L˜V?5\@Kzҿjr }B6(տ9aѿa_!@UC6m?(7o/֭WxI!"\@oJjz?m G+l@H֏fOc@Uu!y@B?bfDuϿ~\?0fg?r.'@;5A&IozJd@?e8?N5Xx; zgWAz[ }k?(K.t?gW?\&? 91 8/y?);1@+/72s?Է0I? 1xEu ٿ 4Q*Y?y̳L?C%뿡L@kej@u:L6<)? #lD{@4,_y+) ?\:Y_`l?`N@6@7mӿnBwL@qjrtRB@7UB@MR#ԇ4@9ʇ?+/̭i+KfzZ@AL%Q?.}K޿ <$W)4úJ61@9bGpz5?o8F"? οl{}p?=?d*?ɐ,E*0"@虿>0?bPq?m.K@loֳc=MHοpbԬ?ʸ`?j+U-?e`fE4Ɏ5dg)?rYȇLZ@EZ?T k@.+,pPURη?Xo $j?A>?ߊ`g<}H>@e7D8s@1B̰$b-H@žW){ο"t}@FǷdac >EBj^>$i@$@(>Ӷi@4`uLWjV>m@T 䛖R?Z@qh@.^]$<< Y @oJG??y|Hҿbez'T?}>@#N݅_/?OA2 k8w؅eb?e@ -οzuG(Z VB`9^@ Q"@ϹimbcR?MW@ ٱ @wcw¯ڿG[?YhlοNEJԟ]5{ #?8&b]]ڲA`_@4YP1MJն4?/j^mP_ b^w?ћ[@Pszp?u[( '@ϝd b?HP\?kAv`aR\ӿr^q?8o1dr̩SK/[d&T%mH]Xc?3οm@*K J@L &D3hq2=TY`a?ÿ0sozS:V-cv{?ui1'-V7ؿ:[nkOB8Nھ?&ai?#b9Es?FA"gd@=<ȺPna[2@T&~@/@ſb9<m?ʴRA-@5nG4oiU Z@#IN|{H{Z b\l2O(~T?<Vf?6ׅb:l?3?Î1ТMe@If}?on@= 1kXi?:rtcK6&@ʸ_?36_*~@2q?Ǭe"jr?KTYq-ʖrÈ Z?(/@炓TI@w=ID|?5aw|IR}Բ?K?,:11迍\?~Ǩ?m˿Uؠ*B`/Mv? >@>aSe#j@rif@/c7(>вzNz@V툿- )c?IYDlp?)qu@{*;@2!݌?;LYZ?ӌZJxj ?A0tsY?n?͜e5%7m|Zg@ʙ"dr@8gT|?!KI5HԽB@i?CD @rN`ƁAn?]?A?`ɏ?)CB?Q(ߋ1h:D@AHS294 loq٣=8a&4 }?6Tco?qaYa$%*fcs?gK }SØV?SlRAJHS;׻Eӿ-]mܓ@ֿoѿkdg:@ :m?d`\Rb6 WI=9@xSYL?e&)ĀJ*Wrw@aefZN꡽G e0j?N#ϿѷCB?n6fg?SeW@pu=p֜[W>)NaKc?'YĠ?2Xx2 |)Uz{lUu^}k?Vο>!$H^?o;@+N }@IjRz?UzE߹U?~X?5-m? f,~5:y? (CyAd17s?'Q|? PE uڿMB*Y?\O?R]@.uSkˋ L@N~jJ?).h=)*._~/?G9Ic`l?G #YEXMwӿ!W2"E-N[܇?TpݿѠ7?omdDɊYcXϿ[(uHج?g<`?q?IFEpHY-@뮟3**r]/iSgx4ܞ?A{T2[I2ݲ#h?9n XS6`I׷?Bc Z?l3OU?@b[iu)H͙B<'[KudrE8H;D@_ T=F!!{?w3 wٿYZnk,Fp?C"i?eb=Es?LrKr@ۖNi9{?0 qDe9WD|?%x~R}vj{?ء(Ĭ;`|?Hʨ?Нq˿ӳ"Mv?ɣB_׋ԹRfv@Q2bSʾ9Cfe6툿J)c?x;Glp?y ^?j]B`݌?;:]_?0!\ ?fz sY?5 l?p6Wn0PS?6,I@5T|?F臡{cXcX@Cgi?JW3{?~XTBmʳ?|V?(]F QUnq^7?[!ho@؀,#?G޽#Aj@D?G/LL-TZ1h@1ֿd-j?hT4jExk;0?1N,>>#O#?17Z?mK_9?֘]/ >?my>V q>y >)ެ >~>~ s>Tn]t>K?'?4y??C\?&+o?j<^|?3m?IU6O8?[1`n?xi?3z5W?ox?) a??6a?Rѯl?1O?Q%b@S,u6@Z3̂<@Ng3/;J@K O@ḰQ@Y*IWt@[mky@@ʄr¡s@4 =N]ۿEѐ׿6 b-j\?9mH?3;Z@`Ҥ!vqiNw'_==?-d{G_?1@ !i@W48o~@'fM13mɿa;| uXᶕe?aS׮?зkd'Q6@vO?H4f?OZk@5.څ]FȄ xM@^-)&/{vse?+,Yu%#@8g,nqY @V3>P@yɟd?\l!@}a?H#Šg?XOvݯ=]?kl%ں?N>@aNοm 鿸Yd@tilB/?0p\dҿ=f o@,V@f%?@2=?#԰s@ٮUFk?oAh3ּC@7Av jThB@x`lè?-֙+@td@M;gPaGؿ bb%uD"tC*H',_ƂYBUkJamwa=R8QX?٫D5Mʠ|?G`?9CZs62$Љ&ׁ},քUvB2ř;ܦ3@X A~3s /|?3~(@/dp۟BPDn?[k37(@ 6k'hX]7-._AMmR@6gLأ}c? Quuw0MBĊd?ZofBR @ޥya+M?K²ɿfl'9?&#&LҜ[?"@7ڗct@S0qWܿ7M^ ?ӣ]?Bf-Bn6ט?`Ͽ@ ."TD$ I@ŬNJο.M l? ۴Q@xZy\`b@w)V2?@9nm+3Z'ϿT"pA5.It@1a|@-GHMſƥ\@<_$1@@)ؿjvTDrQWR#з??SVۑJ~pϻ?0hEǍSn?z iYMZ[aBW6^z@o8MP-£Կ^X'? ?峹QcGĤhEa vo?#u"`%RZ@7pǶw@$q,_#v޿D[/'gk(|@z2?ŭ&YA BQ4G ?]2>%?_5 b@6chtڿ=>):+@v~Z8J+3\?f]Y殿\m@fhR4@@b)V&c@K |0ܷ%Zlq?fh[+ +㾆:Y?&p?۫OZb&F `T@l*6,?ܮr+s(@xc.?Nuaq~Ta@Fǜ{@) >}Ŀ]6ٍ?XJIM:6 eŰPKL}ſLZe?P͑%!@zT^l?܇V 5ӿϞ@&wi?꫑@Gό>;ZiHT@K{{"--FI`@r"2lm7?Rb@j"Ҩ͋r?;W7?O?evYTi?]jϲ~^,l6n@"W2\Q@ f?!?}ǿ.a֚;5Vb?Bǔ_@ԇ /}@ /iY3s?6 z9uFK@" >:Fl>!QV' &k qd$TPSѿsKү?ozAM#[HZ? ԁ@nlG4wyZ?AJ}Lnl@Pt~[J6L@<_緔`0ZIofd@ÔaD}|?c͊1ٲu=%2 @=")~?@JG]t,k $^ֿNk7*Z7MX@E cvsT*r?q?mI@60ϟY;3sd?mXHz]43пn 1?oMK8)Dmt?Mm]äZHkw?%<-f?Oxs֚YPr{$$f@r?\;QePFݔ&?z:jZv13@?eb%="r㛲?%/ ;0?!cJU?IwN ?}6U-?@]roγe#j'҃q?;\? nKLQ:PiNi!?>#Mp@?D~DQ\[b/]п!9jDk#@;7?%nE^?N$t"@ӌcCu%ztyIF?{"r@*vt3[2&F~LU R,>Q>5;{k?4d?i}?BE?1sy>V q>Ѕy >)ެ >~>~ s>Tn]t>fC??P5R/?} F?Z,:?~?)? RKn?5H#?~An?6 ?sNEOW?(N&zx?6p3 a?цa?+l?~AD?]ڇ#@ SN9Ai|;qB/cDwE *pS0FI*{]L.'BeYlm+01\$E\(\!ܿ<]Hؿ 7]q 2j\?LX)?rREIԿ73e`XqK_pT P?vL=?ɂ2tAcro j;'| k~A/:HhײɿhYNUsQӳqge?{tܮ?奥zJ;|AQ[?If?Vph wT&;{K] iP7E?CHQVqv N?<:?đ/򿎸ygyz@@YwrEv"U?@K@DO Ǣ?g?ig⯿>]?`@iZ3B?rO`G\P5Ik?/a 4чWnCS:q j?w9By AtCK@ΠjgP)ؿ- WQEGa6\b,_hG W̺X;V8QX?pLqˠذH`?b~יZsW!;]2@ք)SKݻ7jAJn3sm/|?dmu@r3nn" Y:ˀ)[?J#y\!@D`.8f_b 9FIWձ~c?ұ 6ލzŊd?8:ü*@f P?dHS""ʿ՗ 3@c)&T%J@,W졅] oTVFݿzo?A)7?*zBn4?Ͽk!x2L"T\RB\R&@fy B0ϿPz*$l?d@9F0@3.~?I__#6ʡw,kFlֿ=%O};GɅ7Hy.B ֑*r?QKV}Dm^?ϟY,1x?VxwLYLվpfѿ1֜C1?'s9}7M?6(sguŤZ@..f?*[U"ךY#nKOoq?),?`c,#ϙA!TzH?~iJ?bG"r-'# ?haaswMLe ?x|tJU??yeNpA5͉B9 mro6(ϚcQwڀQ?g&@`4G@!jS'h6IIwȹҷg[;?1pW*Ǐ?8/JNѿsEq@Aj#!oE^?!q3۳@)jCub{ĖjWZG Iñ22bJfY#lbK$sM}BR@"|QXur-NOB%?sinh_ru scalar structinputmatrixd@@@DF @>`ͤ`?t1k@7 ?9? ?#?¶?cg)/hjq@%,X`窧eep]%D 9?qo?aYU,'z@j$5`:?RmG8֘L˜V?5\@Kzҿjr }B6(տ9aѿa_!@UC6m?(7o/֭WxI!"\@oJjz?m G+l@H֏fOc@Uu!y@B?bfDuϿ~\?0fg?r.'@;5A&IozJd@?e8?N5Xx; zgWAz[ }k?(K.t?gW?\&? 91 8/y?);1@+/72s?Է0I? 1xEu ٿ 4Q*Y?y̳L?C%뿡L@kej@u:L6<)? #lD{@4,_y+) ?\:Y_`l?`N@6@7mӿnBwL@qjrtRB@7UB@MR#ԇ4@9ʇ?+/̭i+KfzZ@AL%Q?.}K޿ <$W)4úJ61@9bGpz5?o8F"? οl{}p?=?d*?ɐ,E*0"@虿>0?bPq?m.K@loֳc=MHοpbԬ?ʸ`?j+U-?e`fE4Ɏ5dg)?rYȇLZ@EZ?T k@.+,pPURη?Xo $j?A>?ߊ`g<}H>@e7D8s@1B̰$b-H@žW){ο"t}@FǷdac >EBj^>$i@$@(>Ӷi@4`uLWjV>m@T 䛖R?Z@qh@.^]$<< Y @oJG??y|Hҿbez'T?}>@#N݅_/?OA2 k8w؅eb?e@ -οzuG(Z VB`9^@ Q"@ϹimbcR?MW@ ٱ @wcw¯ڿG[?YhlοNEJԟ]5{ #?8&b]]ڲA`_@4YP1MJն4?/j^mP_ b^w?ћ[@Pszp?u[( '@ϝd b?HP\?kAv`aR\ӿr^q?8o1dr̩SK/[d&T%mH]Xc?3οm@*K J@L &D3hq2=TY`a?ÿ0sozS:V-cv{?ui1'-V7ؿ:[nkOB8Nھ?&ai?#b9Es?FA"gd@=<ȺPna[2@T&~@/@ſb9<m?ʴRA-@5nG4oiU Z@#IN|{H{Z b\l2O(~T?<Vf?6ׅb:l?3?Î1ТMe@If}?on@= 1kXi?:rtcK6&@ʸ_?36_*~@2q?Ǭe"jr?KTYq-ʖrÈ Z?(/@炓TI@w=ID|?5aw|IR}Բ?K?,:11迍\?~Ǩ?m˿Uؠ*B`/Mv? >@>aSe#j@rif@/c7(>вzNz@V툿- )c?IYDlp?)qu@{*;@2!݌?;LYZ?ӌZJxj ?A0tsY?n?͜e5%7m|Zg@ʙ"dr@8gT|?!KI5HԽB@i?CD )NaKc?(YĠ?1Xx2 |)Uz{lUu^}k?Vο=!$H^?p;@+N }@JjRz?TzE߹U?~X?5-m? f,5:y? (CyA d17s?(Q|? PD uڿMB*Y?\O?R]@.uSlˋ L@M~jJ?).h<)*._~/?H9Ic`l?G #YEXMwӿ!W2"E,O[܇?TpݿѠ7?omdDȊYcXϿ\(uHج?h<`?r?IFEpIY-@ꮟ3**r]/iSgx4ܞ?B{T2[I3ݲ#h?:n XS6`J׷?Cc Z?m3OU??b[ju)H͙B<'[JudrE9H;D@_ @J3,@vwۿc?BkοW&'$zOWLv?+;\ʧ +5QK7r/ dy2?OXx#JqGEY?-yIͱ]zp?cHBI-8x$@ye b?TK\?#&PCABӿaV@< 5\=ϩ [K&gzvn?O(rK)u@*z ҀE-迼qa?&axa˒6~>T<F!!{?w3 wٿXZnk-Fp?D"i?fb=Es?MrKr@ۖNj9{?0 qDe9WD|?$x~R}vj{?ס(Ĭ;a|?Hʨ?Нq˿Գ"Mv?ɣB_׋ԹRfv@P2bSʾ:Cfe6툿J)c?x;Glp?z ^?j]B`݌?<:]_?0!] ?gz sY?6 l?p6Wn0PT?6,I@5T|?E臡{cYcX@Cgi?JW3{?~XTBmʳ?|V?']F QUoq^7?\!ho@؀,$?G޽#Ak@D?F/LL,TZ1h@1ֿe-j?gT4jEwk;0;c0 ??s@KX@E92.A}0Yp?`_"-@ @Y=!ܹ_H =Dsinh_rz scalar structinputmatrix@@@.Ac?`I?\W%t?~_|7]?ݦ]^?v[DZE? UD}??Aj0*!?v ??#bQ?6N?2=K?yڒ>Li>>&?>0F>>l*>{>8Ô? ?7gk?AVٕv>- >QOx> mpM>1v>뚭F>Ǡ`>>Itg>{0^Xjj>~ m>U7 Qo>h}2Đ?=Ap?~8n+~?,qLQb?3#aul?|0ghn?Vk?#(V?xs?)?R_ @A>@qaϟ<@6@hG%II@oN@4^g@S4Do@gLhr@j^r@ !|b2u@Sr|@?:A@ @DF @>`ͤ`?t1k@7 ?9? ?#?¶?cg)/hjq@%,X`窧eep]%D 9?qo?aYU,'z@j$5`:?RmG8֘L˜V?5\@Kzҿjr }B6(տ9aѿa_!@UC6m?(7o/֭WxI!"\@oJjz?m G+l@H֏fOc@Uu!y@B?bfDuϿ~\?0fg?r.'@;5A&IozJd@?e8?N5Xx; zgWAz[ }k?(K.t?gW?\&? 91 8/y?);1@+/72s?Է0I? 1xEu ٿ 4Q*Y?y̳L?C%뿡L@kej@u:L6<)? #lD{@4,_y+) ?\:Y_`l?`N@6@7mӿnBwL@qjrtRB@7UB@MR#ԇ4@9ʇ?+/̭i+KfzZ@AL%Q?.}K޿ <$W)4úJ61@9bGpz5?o8F"? οl{}p?=?d*?ɐ,E*0"@虿>0?bPq?m.K@loֳc=MHοpbԬ?ʸ`?j+U-?e`fE4Ɏ5dg)?rYȇLZ@EZ?T k@.+,pPURη?Xo $j?A>?ߊ`g<}H>@e7D8s@1B̰$b-H@žW){ο"t}@FǷdac >EBj^>$i@$@(>Ӷi@4`uLWjV>m@T 䛖R?Z@qh@.^]$<< Y @oJG??y|Hҿbez'T?}>@#N݅_/?OA2 k8w؅eb?e@ -οzuG(Z VB`9^@ Q"@ϹimbcR?MW@ ٱ @wcw¯ڿG[?YhlοNEJԟ]5{ #?8&b]]ڲA`_@4YP1MJն4?/j^mP_ b^w?ћ[@Pszp?u[( '@ϝd b?HP\?kAv`aR\ӿr^q?8o1dr̩SK/[d&T%mH]Xc?3οm@*K J@L &D3hq2=TY`a?ÿ0sozS:V-cv{?ui1'-V7ؿ:[nkOB8Nھ?&ai?#b9Es?FA"gd@=<ȺPna[2@T&~@/@ſb9<m?ʴRA-@5nG4oiU Z@#IN|{H{Z b\l2O(~T?<Vf?6ׅb:l?3?Î1ТMe@If}?on@= 1kXi?:rtcK6&@ʸ_?36_*~@2q?Ǭe"jr?KTYq-ʖrÈ Z?(/@炓TI@w=ID|?5aw|IR}Բ?K?,:11迍\?~Ǩ?m˿Uؠ*B`/Mv? >@>aSe#j@rif@/c7(>вzNz@V툿- )c?IYDlp?)qu@{*;@2!݌?;LYZ?ӌZJxj ?A0tsY?n?͜e5%7m|Zg@ʙ"dr@8gT|?!KI5HԽB@i?CD K? ڒ>z>>@>]yU{>YٷF>%>qe>d{>"|?yxy?@"?3DVٕv>- >Ox>?mpM>1v>F>hǠ`>>Itg>}0^Xjj> m>Z7 Qo>cNĐ?S p?'H+~?5qMQb?g !ul?>khn??~KZk?uV?@O @*yY @xs0@E[~@iuReB,KAPvoDO4,AIEjPeY\%mV2=}yYgo}[:s^ ghh0=Fl)|ٱ'p tك@c`?Z=@rN`ƁAn?]?A?`ɏ?)CB?P(ߋ1h:D@AHR294loq٣=8a&4 }?6Tco?qaYa$%*fcs?gK }SØV?SlRAJGS;׻Eӿ-]mܓ@ֿnѿkdg:@ :m?d`\Ra6 WI=9@xSYL?e&)ĀJ*Wrw@aefZN꡽G e0j?N#ϿѷCB?n6fg?SeW@ou=p֜[W>)NaKc?'YĠ?1Xx2 |)Uz{lUu^}k?Vο=!$H^?o;@+N }@IjRz?TzE߹U?~X?5-m? f,~5:y? (CyAd17s?'Q|? PD uڿMB*Y?\O?R]@.uSkˋ L@M~jJ?).h<)*._~/?G9Ic`l?G #YEXMwӿ!W2"E,N[܇?TpݿѠ7?omdDȊYcXϿ[(uHج?g<`?q?IFEpHY-@ꮟ3**r]/iSgx4ܞ?A{T2[I2ݲ#h?9n XS6`I׷?Bc Z?l3OU??b[iu)H͙B<'[JudrE8H;D@_ T<F!!{?w3 wٿXZnk,Fp?C"i?eb=Es?LrKr@ۖNi9{?0 qDe9WD|?$x~R}vj{?ס(Ĭ;`|?Hʨ?Нq˿ӳ"Mv?ɣB_׋ԹRfv@P2bSʾ9Cfe6툿J)c?x;Glp?y ^?j]B`݌?;:]_?0!\ ?fz sY?5 l?p6Wn0PS?6,I@5T|?E臡{cXcX@Cgi?JW3{?~XTBmʳ?|V?']F QUnq^7?[!ho@؀,#?G޽#Aj@D?F/LL,TZ1h@1ֿd-j?gT4jEwk;0;c0 ??s@KX@E82.A|0Yp?`_",@ @Y=!ܹ^H =Dtan_rd scalar structinputmatrix]ex0Vyy۽yOp3+;Ʊ t0³@NEUy݇|0)b4&\"eQc}?3IfV[Va-_ƟCN9}uT}nAe#Yp|qg.O+~rzU޾cP^ƕhh5 VG: n&XduC9&g5CGG mӏ`BگɌP*R;o=m[4ԇ&rN=y vnPo |#|C//vnzskĄNDS.WH̛Z4ɂ`W.QT_XRb] 7t@),Uqjs(aN~|msC/SOYR=+pҔi"49º "=ebix32-]ExvOP~_eC,FOQ2KBm 4ֺfh)-5۱}4cB)f- `ǔWx ^f2S`E8^NfTSChŸy@GU|elHȹiq5[+ҕ>u˽o+0{U"NX9TWHގbf&kWMG*4dKmE0%x($dIq#hax> EF?OWXy"c-ƆYqb6 UZDAdDyI j^;ҪF˗$paDwBR?k+L)0cPlJ!c}jgp2lP0.yr7cZvsglA|ދЀWubEVh. NfyݸPD hpOFFN:^fFaE BKOaBYs+VY j @hЏX "sT%iޗi(%D*wPu+ ^!h }w,4G:%Z 6~FohOk jZhqb7X zX3WX%NK^;{5$J[Nʮux=@alYߡܡy&9Ih}heb;f*h((rb|j,;@l&7FToW$qxu^G b.$s\ޣ”T-DAуnA׸\W:_xChH}N M?iaH?dO8ޥKzx6@a`oN}LڕtE C??Qy'…Y$ĢgN~'g=4z j ],VENtBg &yIfz k Vth.ɓo }Q $s2d35Xfegp ᷮ`NnͻVNo/6o ʵÖ|S'O =LϮ qb%wulcL*p7m|rFnse>'\A~&YbϺ=~`̩* źfxfhP`8e_2azJ0Z Ŕ5li)s8B HI@hɟvhMm}I9v U"ʑ8`voQSiïKf@R 50Sq,D OelbN8d]P٬kt@[JQK\C6ƸC|)_ Nc$DRoutputmatrix]l?- )eg|%ք?^c  b ȿY0`ҿB`>?**e?]f!t?Agh} 숟,K ?\;#@2! |[@2\ yٿ3xNҿ󾿪sֿZL?!@Qq=%`K{]/ȿ%?A??G.?g/wZ ִ^?T?F?MNmF|?mݪ @hUV CHrX@YM߆{@ j(E6u@?M[}r%`@ d9 ?HBܰ? ?TTę$]WC?i:p?b*& @{07?%#|J(?{\?>S~љ?s9^?HɎ?'y(?>y.Wҿ[&O1M .?Qoh+?b֩?8M ?f.?$ACq@DDɲ? m^5{&bJket?50G?]/ 0?j޶._8i?і'?ѿIO濐Gycz?ԓ_s %Iȩ*@LUiq)gj?t?d; ?6𩩍?ъڿ`T[ @H? ?Lsn@A uxK {5?ROc)@`=?YpǨۿܲ󿌽:>7H?ghlAAKe] ν@|%?wFB&J.r3g;@O ࣿ=pܿ4{ImYy\z $lklő<̟M! Ŋզrg[Wc<@1+9?\ͳh?'*v0d\J,Ԥc?41e|c@$䤿FտYxf/P̆?`|F?VeIN?(!?7uĿx:&tB׿\~?T?ZR?0ۿ'w@ǁU.$?2~ٸ]?tdY@?ډ7 п}or8\JῲLu?ܑnCf>d/7`g #(@N3L%?noKΖCq{Ὶ^G?^}YĆFpٵ?2ʻ""$m'@&bdobЀ!h-ʞ%1?*cWkz;D>u?^뿽$\࿃lgvh@{k?"u?#*P?h!H?ZE4$rL@9"p宴$?C2pƧa?o?uUM\俽xJ?O= ?uĉkĿ`6ֿ=ٿu 7@#?*/>#{?ldS"?|JӲ'ҿNj@2i@KA ?9?/C‹?+ڂot?빅CT?tan_rn scalar structinputmatrix[&ɋS?k 'q]?8(L?"Z0?es&?dd&?4 N*?NA}?]ɦ?ZV?L/bӸ>>>&q1,>%(oT>2q>`c>eJt>FA>@Ƕ>&+[>>"n>>Xw?Yp4յ?^1asϣ?>XqA?:8?tD?E$/?P%h?χlh?A^l?_^2i?@\!?%u?r? Rρ?`? #?~C=?\Q3N?x1G?Yp4յ?Xw?t?,??? ?E ?}-!?8I!?)_z!?ʜ!?!?Y!?Ic!?0#2!?K\>!?+͡!?ڍ!?G!?(Xy!?!?37!?~h!?yA?"*!? !?,!?gZ*!?58!?;!?nCK!?N!?&| P!?BR!?$S!?&S!?wS!?1S!?CYS!?,S!?31T!?9T!?$;T!?[yFW&I"O RWo+hdɉaaJ7|x W+h;Hf򚛯+'@7a"yzqA?%E@B8+I.3U@XfpA9tL;N]1"sk⹤c4Q0(-_إ85 }3x9Y1Z޺ͮ䵑;vUޛ? '2xK+dSK]sVD|@)`~ɴa?Byp{(2llgH3cpm^YM2;bCBӃ2 ʘtŚh0N"4s(I]h)-kA<]pIfAm}帨vPZC&~2!xTHSfX'Q.\y.lΛ׌bM$L_KӤgG .ĕHG4e!|ʰ`H !|}2Ա2l!qĩO#]\W@6mqF17Uf5XA) /WAD"d~@R{sD7W?s$ljOu̷rgJxR¿瑰ˠ+P$bd\kV?RQ"w(wS!U {_ dZuvf`+~f- Z+c$ȺSq}mJ%5LwV"Gl g4JaM'ˮDp6OC¿+̏I5 =E3`bߕjSE|Ü-rb^lYgLhJp,QSwwr*2ocKW2\?@ouguV_D( MɭPzO ^G*_KV;<䭡Vڢr}գRwbbR-ЬI{aB5/_a+\s(vU,O!@"ª+Fbz9#nsK+s-G@/2QoYxsw)?XTF?MZz:H,|r6XܔMDJQNsEao8nzGz8sҌcܪ%k#'uuzO˯4> V>XV _㋃fAW^R!N Z \nK%Ό(-zͣF:9sJ-8!CBiK9gKF54S\d庺M7шA<niHNw[~k 2pz0oӤŗB1i$:jOR'B%&O+XPN`H^؝-3Ep4ϳ1YPn,SnMO$woPs8%']BΒ}2 r6r Rtͯg1N1ػJ$ά5eyF ֓ZA{Xr(yTlِQ<#ǿeׅIbi PhcчǍ$`S[?4WtqxY5+=۹{((Ǝŭ]rY7?M64@`7 5AoMV>K<@ʮ7>v?QxF>$n`a>9sqa?G?j,aEq?}oA' V@@En{@ܞzl@;4i@'˴#A5>&4f@D(Y>>?w\? { ~A鷓f%@a?3OT@^NAwA&\SEbQA 7NAVA࢕@@[@3=`a=@4Ƅ?zd?Z>ʶ_Ng'AO`?T87? |*'AfgU>u,>PjPA_+-a@PU?T|@!fk@2 E+XG%A))K3HvDGo9gfII40B $IުC*e/|L3Ҟ.}#8B2"- \ F!0Ѥؿ==ᔿl^SR&̨ϑhf a/o~Ӝ9w=\N7ɰ4-DLl#nU!̐'6ciREl BEXP& l9S!.dcP3BMcai՞3a{k.63I{yBH<8䣕:C;PA25l`+OWJާA#@IHb=?#@|C"@b[eUk!@O6A @2,)W@J֢e]Q@z;m@=:@D@ܡ4{@C( @؛@O2u@)K@aGj@5Jb @5q} @@@kK7fC@KW@Z @u*@zU@o`|?GTs?WE?a[?s ?Z?%$?`a?d,?%yh_?ML?! ?TF\ϝ?q1?0R.?x?ot0?F?!֕?F\i?_Z?v?^\-??ȼ?0 V}?oV)Ǿ?lB?.vκ?/qk?HX?ثʵ?2 U?A4@?:r? \?S7wٮ?_&-`ʬ?>ު?J? (u%g?zXCץ?b?$[?1ο?л"h?l*J?8ܜ?g:2?D"?dA_u?.?Ӗun?J+Y?eˑ?>#Uz?k??^b>v?&2?4h??t<7fUz42㒻TbtrTNNo%&sKpa5#@;5@a4=@C( @mR<@I[:XL @KW@[-?J`[?%$?v#@@3@E4=@C( @3jR<@\Y:XL @YW@[-?`[?#$?S<7~C\ax~lqUMzFkϾUn^ce._̗ڌԪX=ٮR5cbiLn_(n@~bNn@:n@PYn@_$Lyn@M] ^n@hDn@Jt*n@ZKn@Zjm@hWm@檇8m@ym@/m@Yqktm@zZm@]zMAm@^'m@Bćm@`.El@j,l@#L:l@)l@wYl@\Dxl@ƅ_l@zFl@#@\G.l@;ql@S_k@H~( k@`k@G١k@k@ʈk@I?lk@Tk@9A=k@[%k@*1 k@!?j@j@|[Atj@I`N-j@3^j@f ܁j@=jj@ᨴ'Sj@xܯ[Ig@3sg@Ɓ/r_g@5!Kg@{66g@hnF-"g@z|g@?bMf@}cf@f@Myվf@wo"f@,[f@,布f@}&pf@\f@nm5If@I45f@#"f@݄Jf@6e@Ie@=e@+e@h1e@7e /7e@yme@Dwe@f@ ee@&UtrRe@U{?e@Lq-e@Ee@]e@"gd@/X8/d@and@Emd@gL'd@=Ɏd@Vd@ /&xd@^hM[fd@b9}Td@Bd@|>W1d@+6d@ Kd@זc@>}c@,c@7c@hbJc@(1ᔦc@e(c@]Izc@N.6sc@+bc@?Qc@)C@c@p90c@Xc@x*Hc@ [b@DX-Lb@}'eb@BOb@sVb@U^b@7#b@w+b@zK{b@Kkb@k[b@aKb@R%Z;b@6 ,b@2Ab@< b@Ja@AR0a@Ea@a@zÙa@"K`5-a@hΟa@F|a@7a@Xra@^ba@\(عSa@BS1Da@5a@8[&a@sa@~ a@:[g`@Ʊ]`@`@xK`@te`@Q^ eְ`@~ST`@ޓ`@*&u`@uw`@Uhh`@VOKZ`@AOL`@MY$>`@20`@H!`@ :`@n`@9_@ -K_@at_@ _@@_@,B0f_@;'?J_@[/_@uO_@[c9^@ך^@fUl^@a'^@k^@Aus^@ڌdY^@ݻ?^@F$^@OKŰ ^@og]@Ta]@Fr]@NT]@Xֈ]@s}*o]@EU]@Ls<]@)="]@iX ]@܆\@62\@sͺ\@r \@Qx\@8N0s\@ewvZ\@}|A\@n@)\@ou\@/Aa[@pA[@ޑc[@3ʕ[@-5ş[@|ߣ[@QӼg[@޽O[@,8[@ [@؟[@foZ@ďVbZ@}5LZ@ jZ@;Z@u!}Z@G%'fZ@>/(OZ@qoJ8Z@`~!Z@Z; Z@F&Y@;Y@xTY@d.4Y@>^Y@RY@PJHmmY@oWY@+4iAY@f(+Y@KY@b )Y@Z\nX@^TX@*0X@(X@>X@~X@ iX@7]TX@)0c7?X@p:$*X@Af#X@U(4X@parWW@xތW@]W@E-W@5a TW@:W@#إoW@!wF[W@VoFW@p{2W@W@\{ W@bDsV@<1~V@IԙV@ZƺV@V@&?TV@: V@ 4&lV@p4XV@z^'AQ@ǣ2Q@r٢#Q@5Q@^%gQ@P@aXP@.P@TP@׽GhP@h'ܭP@1\P@P@{P@í)tP@AYeP@5tWP@CfIP@ 0>;P@("-P@HsXP@nP@P@I}[O@O@O@)u> jO@?{O@P`O@Ix+PEO@7I!*O@ِ O@TƧ N@lq#N@-rSN@WN@UwN@uѽmnN@5SN@Ül9N@TWN@R((N@VM@%M@5G$M@ ;eH@]}PH@T_e:H@%H@6TMAH@8G@ZG@9LG@#jG@[G@`.wcG@y"G@|OzwkG@P"WG@33gBG@sqO.G@sG@ i^G@]W<[F@y iF@fEF@4YF@>~kF@JCMF@/6{F@g5&hF@0TF@CAF@]-F@v{F@lF@FE@v1E@rO,E@,8E@TE@5ÆE@' lʾE@T&- pE@ii]E@rJE@eРU8E@(%E@yʁE@#/E@D@!ℙA@ꋺ8A@UyzA@SkA@n5\A@Y΋MA@ׅ>A@èP/A@! A@ˉA@mA@Pf1R@@]T@@<@@/@@rk@@r@@U 4e@@BuaA@@{@@kC:q@@|b@@p"T@@)F@@ѩZY8@@v51@*@@f3@@*&E>2@@5=@@&B?@?@z)P?@ SǑ?@nkVv?@m^Z?@n??@ $?@AB ?@Z2a>@<>@r׸>@e#>@>@Xyh>@N>@F94>@ >@H=@P%M=@x=@b߿:ױ=@V&=@Ak+5N~=@NFd=@P K=@A/1=@eG=@Z*N<@~u[<@<@>y<@е%<@ݚҁ<@( i<@,:YP<@Gļ7<@ 05<@<@pg;@ ;@4;@*bХ;@"wȍ;@ku;@{];@I,F;@8rw.;@s;;@RGK:@:@@p:@!:@׈q:@3F":@9Ss:@A2а\:@ftE:@o.:@́.:@=$v:@uҔ9@/Y]9@s9@+L9@2<9@P={9@Ҵd9@lN9@ݐ S89@"9@e 9@/)?8@J8@0 8@W]8@+a!K8@>@y8@ %$v8@Ni`8@&'-K8@:ڑ68@!8@g6 8@]Ť7@z7@*%.W 7@Mi9[7@g^7@5 .7@^%{7@Jg7@Y9R7@6ێ>7@e\w*7@rͳT7@GC7@96OMC6@oHT6@Bpw6@`p6@\6@F6@qrw6@n&d6@"bP6@rJ=6@Q)6@D6@Y~6@ H\5@PcJ5@(9I5@EX5@ew5@;5@$=n~5@l'9l5@oY5@UC G5@]45@p"5@ aG5@Qp4@=14@U4@-N(4@ʘԴ4@t$Ԣ4@~ݒ4@iH{4@tP3m4@`r[4@sqI4@}84@!r&4@w74@~4@y;t,3@Z 3@૎3@kUV3@U$.,3@i3@;3@) z3@(g(i3@Ķ63@>%3@ˠw1@.h1@'RY1@k5uJ1@b5n;1@ys,1@1@]Uk1@v0@{ 0@C6Q0@"0@0@Z5p0@E0@n0@ 2=0@s|0@}_Kn0@es%`0@9UQ0@qC0@Mt50@RQ|]'0@eI]cS0@ U 0@m /@,=u/@q\tE/@RT/@J%/@p/@1keU/@R>):/@VB/@-/@:'y.@}kE#.@hl\.@٬.@{Zky~.@< 7c.@Q.(I.@..@+[.@s-@jld-@&@l-@0-@y( -@ K y-@l_-@[E-@RSr,-@Z*-@t6m,@ꙿ,@`>Ƈ,@\,@f,@A|,@wc,@Z/LK,@;2,@Ȅj1,@=,@Lk+@((+@+@ZJ+@!ވ+@Kp+@AOY+@.]COA+@6d)+@0U+@C\z*@ *@0%*@]*@/'*@_*@Nn*@87W*@^A*@$D**@s^*@4)@D)@i)@ϓR)@.F)@4q(@S\(@ ̢ZG(@Q@2(@7(@A(@/ t9^'@'@t6'@O'@h:W'@е'@'0w'@ %9c'@N'@|y:'@򄁮U&'@NBY6'@ɰ(&@S,&@SA&@JUg&@|ܞ&@&@?sA&@7$es&@\(`&@r{IL&@K S9&@&&@'&G&@|%@W_r%@?#c%@jte%@[x%@7%@Q΍%@\{%@fh%@P`U%@?C%@z!#0%@jX%@Jo %@ $@lv$@.XJ$@/$@"$@b&$@9$@1I\{$@i$@ײW$@+'!F$@B4$@(m"$@/zq$@rIdrY[nIr2;C vrfbrer/OrQZ= p֐Op\pryp׮EhpGWpB9@Fp= }5pۮ%D%pTp&"pX%U+ o5oyWo5Uo+siibonAoCe!o>on>nn%nm$|an3KAnW[X"n@OEnH1mm 93mFmmG(hmR@JmQk+mQ;>z mmklclP?zl l xlNyZlx =lutᙼll@Qyk{$bk:^>k`k .\rkWUk ŀ9kvo?kpkju)j\\j8j/MvjZjWG?j*Y $j Sj5i#iT*i;yi.iuhhi Ni$3i ^̝i1$hqh0l7h ` hBihl~h=lueh)-7#Lh]I2h.ŸhȬ*h$ gLBg5%ZggL:gx5Hlg#TgM;J`֘ekele4UeR?e6 )e*eydaO, d<AVdtg۹dH3dCđdj|dj'gd.oQdGV ba\%ka$Ua}Mal!ܲaę}aUL1ai{aSBia.WaOEa~,3aWa!aH0asz`WTZ`CF`ƛ`h`ҵZ`>`0O`"Հ`/ \s` Ib`GQ`J? X@`z/`݆` aj `RW_$q`_?[Q_ɼe_H(v_VU_gm5_o˪ _;1^Nt^祴^6RGǔ^8׺ u^;mU^odT5^9-6^_[]*2zA]IG]iLm]R({] lV]][H>]E ] ]b\\_)\#W\ml\F)7O\{co1\y\9fm[=f[}[4f/[d`[ݐUTwg[)xK[ .[`{[*ZbZ2}QfZSZB)CŢZ* ZrkZfw+PZd4Z}yUĨZhґYQYt*YkV;YNY/fxY R^YICYU)YcYXq>DX}LX@;=XX=G(uXs[X 3}BXвr P)XԆC<XBW^gbWhWl[WU]WvXy{W]cWn1>KWo,3WEsWq|Wi*VTUVqˤVA V njVg%uV%R]VCnFV:B/VyV|V׳URsULUjgU]CUA=yUKԼcUZdMUuH7UIJC!UUT Ul}TT <Tej~TîQTTHtT$w0_TjqIT4TTI… T֤F1Sc*ySS&jISqңSoS$g"{S\7fScRS>S;A=*SU+:}Sc Sm'NRXUʧRFI!R'>ȖR@*,R֍RݴДzR8fgR LTR( FAR3NT.R~yuR%]ROQrNQzQp?Q\i|իQQ*~Q9Q\uQbQxPQN2>QN,QRl+Qrtj QPPP5L3P̆JP9WPS0cP "Pj7}P_:lP[PQyJP99Pc5 )PwTGP*ܒP,wOזOSiO3֯VۊO݈bjO3hIOfE )O_kײO<r|N&hNQ!iuNoNA|hN3_nbIN+c")NJv NpIvM8yhM|zM?|hMSmoM{9rQMC3M3kMRuLpS_wL)L3gLmIL8ɼoaL"CLY&Ll LjESKWKk@zK[W}K\yK۳BZ\KP<0@KFU#KE'PKeDJpqWJ^iJrW{^2J|JuaJ\EJgt*JɻMLJQ@IOIT{I٭ãIFZ&I3YnI7‡@TIy9III,HYHEHHڼaKsHŮH4>skH0iRH: u8HH ˮH?nGIMGݼ,G"}NG]^G"&~rGS;ZGAG˦U:)GV3Gy/F#hF EFl?FnF6F ;lF[ۙLTF1=Fg&FFxYFaҍE -E)JED#S`E$E#ED$[qE [EGDE^.ELElbTEՒr+D0JG3sDD \>FD# ZіD WӺrDI*lD)bVDS5AD?$,DNąD  DeDC %C*C;uCJ$CҫC\UfsC]Dw6_CAuCKC`7Cm_##CiFCH~Bn@jBR+B_nB>|)B2kǙBv0"yBKp>sB(:`Bj,MBu:B'BG_EBAoB;ҡiAQ4A_x A 4A ѤA A(DAWsnAQ3\AIAQ 8A+KI-&A^T3aATYA74Y@Zi@m@~u@g@a!ʙ@5@%4fw@ ;Of@Y^IU@$UD@]%8s3@fU"@L@t5@R@͠2??n'??U~?^Ig٥]?ht =?X? `>H7>.50>")SI>_}i|>P \>̒\=>->.u=O?ƨ=G,=H4*޲=ru=HGPd=YE=i{l'=3* =/bb<_9/8w%8f %7 -?74s7R7~'7^-Pɨ7Ci7nVP7ªS87|6 7@~76v6&096tKٛ6dMQ62h2z6 cTc6TL6pvS466W6)35ݨP5XиP5 5 <$5u|#(5uZh5R5{1~<5s&5x5VH$44N&-4 4_VrU484*,Ny4d4hN4x94V%$4u,M4HK3w~Z3B-r3*i!3Y3K O=3`!3kk3"ʮƅW34ՙrC3AƎ*t/3_퇊3+3-2ߐKI2MDԱ2,.2!п2e2`af{2xҪk2/&,X2rFTE2LU?22ޅ2*#h 2[11<,10W1a,1sН1X@ɇ1Qy1om/g1ɪU1C!C1re711!_1w 1xM:a0֫NE0+=0 ;0'_е0ly0`30Q0rQp0Ż`_0ޭN0?=0ی" -0!;0 05r/ǍҊ/Bmc/WV>/?q/s D2Q/(0/kQ/7.Da.S.H\".0(i*%(.U0 (S$9'7#+''[X'Krdɐ'8fSx'_'9G'e/'h!z'7G&pt&&:k1&p&G?( &q&?/qZ&|=C&,",&S:&3%?~.`%a>%?%Ts%Fx%v%*WٕX`%Rp(J%&X4%%~4%hY8#%-N$:f$RPb$dY$Ƌߛ$ {$f$.q$[[$vͺ F$r1$Y?*$-w$YV)#Ut#NN# KpK#uZ֠#w#nAe-x#IRhGc##O#<;#Fn'##'#o" l"|L;"꿱"rTX"}v"8lw";d"w>Q"~^>"Б+"``C"+"q%8!lW!.C !Xq!͗&! DҖ!S!%=0br!~F`!Ֆ=N!=cjG;c*!!qOdm!@H[]( _ᤎ ?0 t . ݝ e F \q{ e7Uj TLY Qi`TH n7 P<&  f# iAn ]hj YeDqkO$(}W\:lΣI'RTd!Df_%15i7}0kk]L1$.K!wyb*c.]z@# ]1?Ա^"3L+ݓ6/Op=xF2M ~t^aoX9VN <,2*gz(aۯ6(:8ْx!d]sA{&*W y3O\cҏs1ߟt0FXj{EhPv5"6iB =W0AN-Z'&-+guiN+rfM/5JWs2n+ ,G4JŽσn:vϿoZ`TV'w>܎6W&+ PꓓbڌGV)_,`*7o|W.ށnh|rQyZg:s=U#n[ ##xp/XXEQ_.}ܚoU`HBnz}0W$5Ab8+$ ^EңRIxb檾9"H]H"bU~_iPҎSh>: ))V@#@{4#@R9p#@gW #@pG#@wM#@j#@#@W1i#@^z%Ֆ#@{H#@o-#@ QBt#@6h#@PW]#@vķQ#@F#@T*;#@ GM/#@$#@J9#@EGF #@#@5&"@r+U"@`x,"@3訁 "@x"@Aڿ"@g6˴"@l%ĩ"@ͼž"@xsP ȓ"@/Tӈ"@Ѭ}"@5hnr"@?oh"@B]"@nR"@nG"@v<"@Ld2"@޼!]'"@D"@."@tdS"@=!@!@ת!@!@ hj!@?ύ!@rk!@!@M!@!@H;!@q[!@ݪ!@fPt!@z}hj!@ꩯ#`!@0חU!@鮦K!@xA!@^L7!@d/%-!@SBU#!@ t!@:!@L!@ @b @Z( @jm @"~^ @)o @ @S" @ H @es @oH @&܍ @J @\n|\z @^p @M[f @9U `G] @ VS @aHJ @tთe@ @W6 @@ v@- @ȶ# @F}r2 @f @`: @@ vM/@:Y_@ @UYa@l;g@. @:sx@7e@`S@%(@@˸Iz.@w|H@_ @Rq@Qw8/@@BZo@)d@͸@n@gw@q%x@Y>rf@ȉWT@*͹B@0@X@\`Q @~/@9@m5G@)*@+%@q @u`t~ @H@"]Ko@~48]@L@7W;@P*@(P@9@J@b0͍@r@@?@hٝ@A撿@:|@To@]U^@#M@t;<@JC,@JV@N @MBp@m @w#@o)@ ϨƸ@eP|m@@QuXه@} evw@cl&kg@ZpecBW@~'#G@-m 7@j/'@rJh@`@P&@7.@}|Q@O0}@}<@Y@3b;:@T-@.Mx@t0Ji@ڊaGY@pA-J@:@M{55+@P~B@d$b @(@t<ܲ@ch@A'@>}@b9@?F@Y.{}@$;i@\]t@֚b[e@AaV@5y@ԏ7jk@]߃]@ 1N@*uQ@@BΝ2@5#@E$6@ P@wa%@п@<@\@e1@ -ʲ@3MФ@0Mߖ@h@6G{@A+u=m@dm_@l#ڤQ@˿C@0<$,6@Ce|(@-@Gю;5 @M|{@@ @U@A@֥Iu@C@o@qݣV@@Y9@ey@\6%l@zp^@ uQ@JBD@u%p7@0EW*@?&E@b :@GHO8@=h=@X 5(J@v^@bRz@Sx'@7 Xɵ@@TƋg6@뺒=x@0@C-ov@[|ji@/U\@`*1P@߼lrC@47@=4)*@]J@$@p"8@r@u@B@E @NĖه@G@ @U\@ۢ@1@&J,@Zao~@ںYr@4Kf@SCZ@ywCN@z9JB@JC X6@?l*@ Ȉ@,@;@ڊ t@~J>@y}@[@l@ذb@R^@UN@)Ɇ@zM@ Uٌk@&e%z@ko@qArc@{;X@wCM@RpA@ya6@S +@1@GH%y@\8 @drfZ@d@w Y @ׇDz@[@# pB@X0@Hg$@@U,!@Md)@ Dc7@ XLy@*gn@)Xc@%wX@wlM@V&*C@W~7"P8@=Խ-@A"@,'@)| @la@PS8@G0@D ] @mbs@lk@+E{@[@Y@!@ Rۺ@+Y@̯6@>쎪z@[p@J/3f@g[@[饶Q@@``^G@.=@/ 3@p(@?@P@;T @⶯ډ@*(N@w @7@@P@ @]ڮ׺@D;@ژ"@+0P@{ع@iv@){@j6Cv@53l@3}b@2U5Y@gEtO@BE@X)Z<@2@3B:)@{@*61@-2 @Z=@pE@WN@,@ 5@ح#@o/ԕ@q<4@mEp@^C^@/K@V܀"9@Ѻ&@fLZ@-ڲ@@@ L@T $@ M@7/+@L@Pjp@q ^@!PM@2;@U_)@NK@9b@((# @Dz @B0 @e=E @~Is @W9Q; @BPŊ @ _Yy @^mg @ҧV @k7TE @e4 @" @8ë @˧ @sm @ޫ] @W @H\ @PBj @ 'vr @ @<ȴx @6h @FW @ٞ\uF @j5 @_A% @o @8 @:AԔ @yk @? @V? @i @K @kNfA @oD @Pkp @,D#` @z07euP @v,Z@ @TrH0 @H#G2@ @~^fA @i L @aڰ` @σ} @P @XIv @坜 @~RP @d @ @HPr @_cb @k +Z)S @(v}C @(&4 @6k4$ @LH @SH] @l @? @,lK @3Y @-6 @{\ @aG: @f"! @"J} @}n @= _ @y TP @='A @hBB2 @K|dqg# @=5T @ @g @H\[P@@Y @&hY[@ŭ@N7@k貐@IZ66@Ws@fWe@6V@x VH@_4I:@({>+@(@-%|@V@oj].@İx@o_q@@-J@ @Т7@p@Q@X>u@nsδig@ UĜY@K@,]H>@jHf0@\3"@ @]^y@3P@*X@p{2E@ϬW@=k@Lv@@ O@@d0`@u @ϴs@)if@N?[Y@:.L@M?@v!1@ݰ$@'K@' @@<䛾@'@@fj/@F @[`4@~b@ײט@.R֖@sT@g}@-ػp@AuQd@H?zW@/J@ fV>@ݰ1@{+P%@" @Kjg @R @ӷ@.nCA@ q@O@7 \@C@:{@W$2@r@b)p@YbVy@M]Cm@68a@b3U@Tt6I@0@=@/GdP1@Wh%@ @R~ @U@%$@]H@U @VAA@"@x;y@uwX֯@:@J!Z@f@>@uv@pj@gh"_@?JOS@/:6QH@Qm<@^?+Y1@pFH&@l=@u /@|@[E@̮@:@z+<@ά@C7@*G@ͳ~@2v|@^@L@k@t@l[Mi@e^@li6!T@yekRI@?bn>@͵13@6 )@V@hi@喰@. {\@NξB@L*@x@r@c͍@Ʉ@:'ә@+X)@ߍ@'Z@Ff@^@.Qv@a4l@^a@˨W@0EM@7 C@(T8@ό.@wš$@~@Ti@1.Y@鈢4O@>&K@PQM@T@}]b@Ƕu@Om1@^@.r_Ӭ@"/@d.@51e@\@I{@W*r@"\xh@Ր{^@\O$U@rӂK@A@vFP8@vf.@ʎ5%@W@%}0@@>?3h'?g?!p ?P?:?u?lu]{?؞Bh?uGV?FccC?Ç]1?K?= ?۾2P? ?D?fz?bp#? ?Fof?TW?X4XS{?qZi?iWkW?|E?(t׭3?%x!?t?f_?3H?N ?vZ-p?߷?nY?CEݔ?V Wl?(r?^pA<`?B UO?O >?]},?6=?Mp ?0P?l5(";?ru/?{Z-?*>6?BH?U e?f?Msq?O`? a9P?N??-.?^A?՟ˬ ?uk!?G8f?)?MX ?W X?T?n`D?Hf?{ч(z?ni?|)Y?@I?0ۖ9?|&)?t?ͺ/h?L0|&\?^" %P?jb*D?g78?|)K,?ߖAe ?(?eh?#&S?,?^T?]e??f{e7?D??hW?^mœ?oy:?%|?x8q?ɐe?lQZ?eN?ҏZC?f)8?G$,?XՐ!?vy=?$,g ??"ɍ? d`?cr9? T^?=?xʕ?N߱?QO^٦?1Yڛ?JJC?M?0g{{?/[p?mw=e?RqdZ?u1O?&JD??:?S@/?/χ$?|?޾(???:?I?;ɵ?(?\^ѡ?k#6'!?WS?}5c2?k}6Bĥ?i;G\?8Kp?c?^I|?#6"q?%g?_l]?52t/S?+H?f>? 4?hv*?#W ?0=?6}* ?.??. ?(a?ƚ"?7ui2?DH?eud??U?v{sڞ? ?/XF?yJI?w?pHan?t:cd? Z?qY KQ?4uG?4=?1 H4?}V*?Q w1!??$l_1?n?⻸T?X?#x?oƯ%?ym?G?pkQ?Vs?n1`?RIg|N?`[?'&?d?Fݩ?Agwȗ?u>R?O@оs?y5(a?겜O?=?j*,?_?pȟ?? ?J´>??ӂm?wS{?? Q$?|?'Vv'j?ٌYY?Q, H?m6?^w%?.]?g)|7??n+g ?G?x?Bl4?s(?IkI?W s{?oj?Y? /I?܍A,8?!'?$B?;m?=+?ή?;?l?b=r?K?Jϓ?s?;#7Ss?eo#c?2R?U{B?<6D2?hm"? *A?/Wi?le? ?BF ?b`N? X?FGȣ?/?Af?t?۪**e?\KU? ocF?>6?<'?ceW?P?՜?#?ȥ~^?V?L7?}2Ɖ?D#ϙ?\?8m?{dp?~ca?{lR?40~C?!}4?:k%?3ḡ? $?}Y??I9IG?uE?j?c?VP??,X{?v?wbg?t`6Y?a1J?YC͇?7a3?(?_y[?gA~?b???u?Kp?&?^ ?,j?mPS?3qfC?-Z9?M:6?m>d9?C?#S?}ֱiv?D.k?`?htNU?/K? Ӱ:@?qw5?R*?⤈ ?wT?l9 ?rY:?kj??aB?Y?J3?$Ě?e=?y ̫?I߂`?.q?vܛ?YgB?1w?Fm?o|[c?EY?i?N?zwD?H+|:?/T0?QTTU1&?@?&?ͭz? ?)??z?c%???߾:?'o^??ut?? h5)?>e;j}?3vs?^bi? O`?V?IM?xPhC?kڑ9? 3@0?̏x&?_.?,?3 ?=?gr??о?`d@?NnS?"BI?A\?H~?@/k?u/Y?F?3A4?Tv/!?j?=.?һ?F,ɭ?_}?cW?`c?® R?>@? k/?qM?y! ?u, ?⢝?v v?C?Fy߷?;~?); ?gR/? ߊJ^t?CsBc?zR?j?X%B?'|1?A#= ?6 F?;̹?97?`qc?GCO?%?zq?~;?svs?`N|?>l?"}S\?*nD1L?fPJ?v&t?PĦ?sig?D]m'?rov?F]2}?ȮZ0/n?S:md^?ܬ& O?QY??X0? ?_5?GR?ϗ?d4?$%>?f?6?W.Z?嗬:?9C,#?{y?6j?5f[?/: L?w5=?; S.?OQz?]?,C1?G6#?ȳGl?nn"Q?S`\? ~?V?:_?q܌?Sb~?"Go?GX[a?!'S?D??ΨCS?ԇ#o?ݔq?22c?$U?:~4H?y:?B,? 0&?Tz?f$?kiTN??A?Ӈ?Y/U?%?cB?!-?-uڊ?ހ}?Lp?><)c?rSU?+H?R\Ў;?*Űr.?K^!?N^Q?\ƠL?lAQO?uGY?fwk?>F?5?OϹ?-??ǡ7?'Cw?}f?¿ z?)Ibm?`?$T?AG?;?^'.?ڲ"?,?aW ?:d?jAHV?~w?? ϩa??U?sD?‚?\Z?Mɥ;?#v?j?QZ ^?R?p!)X F?:?{).?6ƸGC"?c?s9 ?^'^?-?-,?܅+p?x? ?ԎBd?֐cì?u#`)?m(3?| ?UQ~?*s?g?g\?~P?39NE?Km79?^.?}IK#?ЕU?S3 ?9i`?|dNWO?u ?ke??׷!?. ?_?JG?eN0?WX??Z{Ǹ|?cv q?r f?:p\?"]DQ?BwF?;?##0?C6&?`?-[?Ψ-?9d?Vw?ن'^?q?1?R<}?Ss?@Li?Ҝ_?vWT?z@ J?fj_@?E36?<Ɇ ,?ώQ!??;3; ?} w?/?[38?z?JzG?ot?O0}?G`?ŭ?F8?8d? f"?P|ό?DZ ?~:2Py?Nco? Ne?<\?=ER?n9JH?cʍ\??TY5?-1\9,?`"?r2{F,?D;'?ۡ5?om`c?%UƧ?V ?'?4[]??2~\? ?ӷrv?V!ec?I"bQ?GM>?s ~,?B?~D?–y?`\28?I?sվ?kC??55?v? Yzd?9_R?ݯ@?A.?)?h ?6?_?VIa?N/?u;?w7???I~?Ӝkm?\?J?ҏW{9?CF@(?z?]? Ve?/Q?iVN?TW?Ze? sϟ?{?rw~?={aaJm?3\?}K?y;?ўx*?C?=_K ?u,?EXoD?n?d?M??]?-?F`@u?2Ae?r.?$7z0?,7"?@i?ڗb??l}?ggqc? R?[ZI??ō.?鰊?&6È?Yi?x?X޺?-lκ?+iN ?U{Y[?s?Q,쏺?|{B?A^p?d a?ý|Q? A?'$|2?z{ #?]-\?uª??RV?0 ?\Tֹ?'͗ǹ?~;xE巹?_?m! wM ٖ"X^"dE 9"s(x]q+Hƒx2M3"1G{ c v1 $_,`"*?BtUu,0aL4+8ʸ’#V53v]3Dr9mue {͙Gn [C^G 03E8 Rnn Wβ5Gźυ@ aC"NLGmZsoFhy`yMu&+):E9(D_h ;nT jH u.7H\ !yp]{^;]L5s;$'CH)3N;gdw;q^M+T PuX Q,d"PËPnz\ji.1UX־iNGaV6n%/2Bh"E@ ϔ_z 0}^Wk;NT=Y׏RD/f9o^xNз>ֵ .x|j=ݵI!*Z Q<21ޱw!Kmʿ+S⪶݉àik8rvbv]]S[KPD2S-5;8W+%}DڗdzC&Gn15h^t)ѦoL\{*kǂ2?t&&zevUW$|>&Hq=:@fsV,7z *ccyN]]S?mxpVw I:[-Z@{$+kvp  {`iŷ4O˼h2ˁf ,0L-kׅ1E2FCwTc Ȍ qa!jyMy_jNEW+4‰}/wX/G d^ B"uyڿ`&{G| /?9ݘ@t%xNX$ẄqjB<3.jjlR:`"v (vp&J'>rMHŔt|AN`}l1f' N晡7 Lۚ C\! \iBb`ϗiIWjwTھ.,>{8:'|7Sp6F5A @K^ː^Ux;zFjcTM8+x=#o hȱP! >QiޤC1 JR{^fp,.R@X؈=_[) NRja1|#Mv?Kү HۛL=NE t ]`6LZ 9sP|%ԕbyq6|jY)EZrk%ׇ_uxȢ]܏efR0?@6B-F:6  l &YTc+""jY_e·;u:"4cא>Q^ ?h._oQ̞ ˱C.uAgX󿖓m8$wSAe?~6jr<2K3i n '\Ȧ/0'~!XtLPZcNh)Rb 8ݶўUj^# yjc?G{EC,￤#{g|>1S܎P[%p?h|Z鿊%\.D鿹 -鿢Cwx80^v$迻8wk&*i迬(~=7i迭cSIlR>(Q) IJ$C!j9^G eC|~1Ԫ.}k9lDW&TC翨4. ד0i翧-%}εfΪ! G699Y<濍RDkWxy濃ĕ/e#yQ wU>9A*?ߍ濎9fnnL念o0忥LT忬ڸ(?np}Oj忔(W忝bEø %M2`忣u  5 X-^fnrxnS. qמi gu6z>hÉEVwMٸDg.2m5!c1ch(/I#OA㿧U!¥Kۃ]㿆7ծO$փG;r)Vqa㿭Q8|P㿌KR}?㿼m?.)~`gy k ۠X=UB]>Y tZ; GTWVP⿑[x%'Tg⿹ǝWhG"ӳQ7⿬rI'⿪MO⿍/8c&yT Ύ:>OJ JS"*Tt]bDUz d<%kN}[῾LkO=e#.iYc) &û`࿺LG1࿿-ۓai0鞶+/[9r{g ߿6s߿5)j߿My߿Mf߿6eQj߿vmݿ4SݿU<l9ݿk ݿ weݿܿdܿ ܿKIܿ↋ܿ;Tonܿ¾iUܿy<ܿ[#ܿ)-S ܿ-ۿA%Dۿ6_kۿJ$ۿ]Mۿޕ xۿ cs_ۿHGۿ(Dڿڗ -ڿ>|*ڿ ٿU*ٿ}]ٿ&F~ٿTl~ٿlnٿy7vٿWA͇`ٿ 2Jٿ5 3ٿDٿUٿc?ؿ i+ؿCiؿaؿaBؿ|LhؿFoؿ"Yؿy5Dؿ앵.ؿAd<tؿ0>ؿ)׿ z ׿Kv ׿J ׿ÌG׿׿+pq׿#waA*]׿mR%H׿1H"4׿S-U(׿Ι'V ׿|Dֿgֿ+^ֿ>eIֿrֿU"ֿdU:~ֿkֿPJWֿ-Cֿa0ֿ3Łֿ ֿ տ o?jSտd/տ޻տZF%տ#տ C讂տeoտub\տ7MJտhX7տt1f$տ տ"D<Կe) Կ)@ϿJmϿL6#Ͽ [z]rϿX^IVϿg;ϿX/˞ϿO`:Ͽ6)οXȹοNAqοGο,B|οgHAaοdzGοBQft,οUοhnͿtNͿx)PͿfr딨Ϳ=zͿ]C6wtͿ JZͿx+@Ϳ6)&Ϳ`>M Ϳ!|9̿룫 A̿ L̿:捧̿F/U̿g3u̿z(\̿OHC2C̿8OSvR*̿̿Rv˿6˿z_n˿oW:˿Oܖ˿E~˿<af˿$mDN˿0<6˿]{I˿-N k˿ʿ/ ʿ.%Nʿ jħʿ>Nʿ"xʿ33aʿ;iJʿmE3ʿ!Lj6ʿ\{;ʿVUɿ@䅂ɿɿs隺ɿPIɿ7q}ɿ:fɿ06Pɿ9ɿ#ɿa뼛 ɿ0^ȿ ιȿl(ïȿ۴eݵȿBȿ>qȿ7tȿI߷Q_ȿHgIȿ}4ȿ"sX0ȿPy ȿJHǿlȫǿ&洴ǿF0ĵǿѨǿ$j`ǿ`wǿƹbǿ|($NǿA 9ǿ)q 1%ǿ]3ǿHƿi:Jƿ ƿvY{ ƿIƿ/Xwƿ,ƿ=[pƿjP\ƿHƿM\Ŀ(oMrĿN`Ŀm_NĿ+c<Ŀ<*ĿxyĿ.UAĿXàÿ½ÿRÿ?sÿ2?ÿՍeÿN2E!ÿ.{ÿք=jÿcYÿޭHÿ_®7ÿeQ&ÿRmÿ,ÿRV`¿ޝ¿ι¿һd¿?¿kSl¿Ɔ^#¿u`̀¿[9tp¿[H`¿= P¿z?¿/¿3'¿,+¿Hc‹¿VX;Y8rBl斖yfShաQZ- l@7Ɲ8zHἿ~m0ǼXK_1!{eb:>Iy1ֶ6VC|Ɉ滿)AJλrѵTnmBKcOl0T_()Z0?es&?d&?#N*?@}?d?I=[V?uqӸ>U>M1,>voT>Kq>xc>_t>FA> JǶ>/+[>Q>"n>>e?l|?<ѣ?D2ŒD?nZ?!V?wS?3&h?}Z!h?n^l?8W?Mps}?*i? bL?R ?S}0?;DI?#S?>8He?IS?l|?e?q?G?@T@m~@`4ű@.g@2-ÿ@*'y@(@BOm@͇cV@-O4n@WBD,U@DK@nEk0@8,쥝AҥNALyAgOAB A왎/@Wk:AGXKAZLYAUBtnXAya)bAN eA,Vmo|AC IAe}sYAyE CA FAWɜIոA'[IAl֭A t+ oA4AuCTAz+^yA>iXA \U_BZ[ BwTBYoB?\È #B}l:B|8BdMj FBa=a]\B1`BtH*~fB2=>@]+s7BPTB3BqJBMBFqBpB;XB@dGQ@ ?8C&T@O81Q_@8+l@;~2m@t./|@#m^@<o{XƓ!@8ĝ! w{ (NP{?&b?N$'si%?Gr7cs?ox!߄!?3pB蓕3?OϚ}Y-{?,_J?*?:XQ?),Q}忽&޿Ӟ?p?j?P~Gh桿%*? d @ Q?3Iޑ $)1r"-[r 8f&_aq ws?Nɨ׿o5V5c濵?6e?$@WH#")?ڮb[oDs_@0Î|? _y\7P(@t}?ݿɒ @Q!?Dt=?֍>$x:@|G?6%.ٿx?5e?Oh@&vs@'eVU=#@s ߿uf,Ƌh?Ye/?-1W񱻡?Dcq @ e-? @eɚ8R̡r8+ȹ?Lh!@:J>}3?"~4@Wb;e7#9o gͦ%>'&;?{x?l?BK }l^f'*Ђ1=`?2H??Yz\"k?GWBTqŊ;@{fҿdD@=hUѷտ[2 #/?^Y+Ӥ4 4J@G4;ƿݓΆ̟'J'?GsGh̰׿3`c?SRWw> t p?f Q?M9l?ݼN?I/t[|?+ @\3D?֋55+ݹCi?C;`##by:>NC!@}u oT5w^W3?05ٓ0<@}R @.!@KpS">@}N@IrK:|5|߿܆$8x{]q?׬?r0k%{ֿ?FY pBc="9ML]@۩Xpzg¿ #Q?t?J׿|$,FSC0V@v3DJ*8?p(e<:@8[q7@n K jf?J'&>??6~ GN翄Jh?Z*_"?Íh%L>?#@x7?{C? ?N9?J4ZyfSX?t9⿷&xBĸ /.l>wY7?PuZe? .޿GoMV>ab}س7>i ?xF>&n`a>~$?l:G?wDhEq?R=\`⿠Qh )@$#|@g Н3>?4T,@ CWW@5>\(.}>>?k\?AW_;?VSMa?* dRf_3 c?}0b?>bcc?;fgU>k,>i$@wXn.uFk?a>v6@HF@0"VW? E+/CAe0=Ke' YGo9[ ;0UG# 0B $IpGp?߲Ҟ.}DN ?y3#-  ì!m"Lٿ,üᔿ0KgeLoAѨb%lf$s ~Ӝ9>C\v?3匣??M?-lk?A3|Q?ioA?`?l~J_?jMgb?0??cZw?h5W?i[tq?*ѦMu?$Ef?%1?-ؔ?cX?Fؼ?$i?E%?PHi?%׵?Ɂ0`?jxu+?[";???掠p?Ҭ?ٙ?ʂ,_?z3~Rk?%2ڥ?(d?GL?EJ¡?I㒠?Bנ?_J-ޜ?ks$?7*$?PAlv?d?ϓ'o?T{?"nˑ?,Oٛ?0D?=IA?[?bz2?:,l僇?i?r{[0tdg5Sa]K?@c׿0) @ .dB̀=?b^@>Dn354_?H&0V&:?B _ F?v%O9/?ڹ8Q05kד/QkV@4_?I&0V&5k?Q_ u?$O9/?8Q5k/QJ@T tֿ/aԿ{x?k&r?p4^?Hy`G? y׿0?2*pq?@_k.@ ]?a*?n<+n? :Q7?>2;X?V"$k? z;3Jl?0%?@F~N?Ye $?BSF@&?""= ࿿*(*V!x? ؿ%mT=B??ud̿̿с>XfAڍ?)^ TM~{`@n([I?~G`2%We_@3Oj??)sW俻,P2uzU?* ҿ-Y= q&?|LCH?' b8 @? t:(%u*ℾd0?굡Gɿ^~%JyC@+M_?v/뿡E:@ I2l?ZuѿtFsptڄ\?wQ?R v@꿛] x~`l}?_Vȿv<|'LB@uz?$C1m⿍O:?)bH?Y?#) Kd,t%@խNd`?&LX˿TG\i@&p?a\vܿ>T}GJ`hd?O!?+ @I忡ܢ1-?RG? f?:aKRש1, P3?,?78ￚj-ww_@?w [[74"r+QA@6K?lӗ{FJ3qѹa@yA)?,?հ\foHь1*v?B/ۺ?|M?f>H$?@ؒ!?δ/>:E W[J@?8vw;ֿMR偏~?$@fp?ۭqZh#!3Ǚ%3C?g:P:?ZPaQ* eG@/]M?^"ҿ2&cr[ 'A"@=y@p?cQ{Uړ>鿮+w#u@@f@h?7iѝ@ÿ!bt)! ? k?P οd0q>1̩J~?(+?kPѿ}_t5F?+? Bп1;fC*?V&o[c?>?]jƿ  @yK? ੿$q5#)aZu @9?o:)ev"?5߿}8e0@ "y?F `t?;N{^kͿIS𿕖*++0>pR@.F'?cO9-?GQῡ2=AEWO0@ \?mnr?9u4ſWz W] ۋP@'s*?SL!^?ff3'տ/yӪ>u*`**@@rd?0 8?ۿ1#d@#۰?K̟?F&emݿo8qz$<9@g͓6?JLm?ʤ[TڿZV3]P7C%w*@&Rv+@nY]P?vİ@?2}Eݿ: _abzYar+@~ M?_Z\???*Xطt࿆yNj]sZ! @{Z\o?a!?Ӱ4*?!(u|Teg̠ki8nNDc@G@>?P?OYU?GH9O˿D!俵z^[:@4/@>@2⁃?>X]?;9?caOȿ>^&\m{䕧bBXe @7 Q?I0ő?Љ ?嚔x?Ȃ-ۿ9"ع}7kh:j@3m???{"l?s? ǿ"HI*3-gE2Zd/!g@=Bc?5*!}?ƆC{?"&a`?)hSȿ9GV#j$Ҽ.|%9O2s@dKi@ =? ? ?t58_ٿ[Jk3$Zv( #5y[Un @ 7›??<@?"]?l?<ƿ*4߿zRS3хںN9=zA@oD}b@xF?.??f?y?iܕKBܿ$NIq_.X/?F[41 bI@L.O*>?n!?dw_?fT?/?DhoпjqҀ⿎L+: 蓃PS`@ReФ @=YX?T-4?}'u?Q$fe?Rp:Td?[o,пn7ῚA|#;۹?EH* J1 tE@Z5@ؾ٘:?s>A?a{ ?lM?o5&U V]׿~qcLf%v%n6$@>|@ u2?@g?u2?Au$?E?.B,RD92տq3*|V,.qg9pHk6%'w(Eo@_VRf|@5C^?f?WU\-?P'?l l?A9]rĿE^fٿ10tTg_ǵDY ]H {(28@H'@s??UTX?,>p?v?&ѳe [UӿYAG73:>0 <3גShvġ@M~O@@q$^#?dWg?%?ɤ{]??@7/kgƚҿfL9y$":2͹TTPdm!+:mijv <Џm&@Miai@^t?fqJ]?3:l??^d?鿀?@lp?xhcӿK Ɋ$$҂'KO,@!@@m2X?0?!G?E8H?oi?DRl?=0tf"?)[Y4 A̹ҿ_Ld޿pV忊(Y\gϥVNSX͗Tq]o'śAa4@G @]}H@rI5?z?Y? ?~RQL?վg?7_RZk? E ͿKؿLdN24jB:[%9JWnGI _xARǑ=!@wR.@t @&M[f?Ee ?W?J Ƌk?ỹ?K834?~Q?r["?Ec#$m9οٓT ٿ\ZZ-P?迡7{= Q PˊzMEB"RE@]g |Y@N @4@?e'`?EM?URJ ?Ƌ_oφcI<꿐/Dj,g@#MD<̨JRտS.d:_0n~3pG4@Gc@߽ȶy*@ 2@kH{@+{j?|?aA*?n)?S? 崝?%?DF?S|X??KH??4Րÿh3пW>ֿ+gݿׇ⿤蚔* ]*|w2i%g'D.Rs .54k!2uI~,@3fy9@؄^@/@|Hf@ N?޾?A?TZ?r?a.R?KHd?W?7,;[{3?A?>?eh2߶?UVrl?H[Y  wſe%BuпtBc]ֿܿqgGpCTj鿒.D! ]lhH[+75:ˣ2R!# k` п O_,Կ ׿)M3ۿ[" l߿c1 o JWa(濢gI;v۟bvXd) ۙ S-" \l jٖ$^UYp*]y<4 TO I pA*]0NU"l11FLAY3Rw5:@Ob32'@ 1@;'@0@ LB @=@>6@T@hd @Bud?Pok?ZtI?f+"?F =?G?(?_LX@?%Ǫ?e-6X?*8&?Mx?0s)?x¿sS?pŒh(?4W;y+?z?n|?݄dx?=N?8BP?IT?;0?E D(R? |L.sfQsFRt6ƿ[uHv̿DCQ8ѿ.R9ӿ88ֿ (5ٿA(ݿөH9.࿄)Jsq)`yZPOjKw鿊ƽ6_>܋g>YiMr9" )X4ZxW"hu) 7Q:D:RMۚCv16:U]< ,} J:s2!NA_)&'W8/myrq=b=@E. ,@>Mn"@ZÃHb@K@}}jg@mQxB4@?ƿwf_KSoSOGxJ0@W˸*ǹ ?NŢ=N@YΖ&I-+?~1A!C~Lտw;C?. *zPr?bVPԡb?F].@+BA?l @Rgii?q*Q@ǧH*?j?=@P^,o[S#O?a9 @)Q U©?do@e +￙ǔ9:{?>pbʮ @ic&?))>@lWt𐗎?<"b?i#с[hsĿ D??*sú1V.ؿO|hg?9q@_k}bf?$L @nx?B\?#u4ѿj;x?WPvv`?P@po'Z~Yx ?K q!]$x?ݿh@rXw`V~X¿ 7A?rSuk8Jǻ|gb?ہA ?~^xӎ{ ׿&t2?g[@D f&yƶT {?O.|7Jb!@+뿺E ?~)?"OZA@ ֗@_?5?`㔼޿n ?`=@r*=y dqڿ0W?h2@dBFU 4ڿEGb? M'p@ +oݿh6In?cR ? _h vgr.s??;Pn?l>E?pٟ?hds>@@t$:\3 iJ?0ri@J%}ڿa?1?p)1꿥xcṰ vג?/r?-G@,e^G>*P̿fré?c?V4@.fgfԿzˡ?[; ?3i@@ M|$*En] ɿX?-Ub-?{;6/@X{Cÿ(?6??y@';w뿡ȿSE!B?/qbt?J8z ۥ@&! Ԥ}Љ(^ӿbe*x?MV ?!rCX@;]"Jw88Bk2X?F4?Cߩ9?5M( @מΝ2E;dѿZz?B6?գ.@r}7)O ՍH7{¿o?e?[0@wݾv!XA27u:In?x<?%H@L$Z>ʫvDſͱY?.?k?@i8EZ@s%n 8; 쿫է'Կvu??H;L*?}IJ@S nQy WNH ?`H ?^u @?sq,@ :.?$2Ý#9޿ pL٦"'Yd?ăS=r?p16@|oG6@jRXnVIC߿̩1N3t%r?y?ܻla?lou @-.R\ g俤$'gɿ%6fr?evO?0> ?|abS @5e,҈K&[-=SGjܿH}n&d6l?—߱w?PemK?fT@fXes!I ?9%t>ڿH-椿ac?KG?t )8V;?06@F(<%_cL7ZjE23@tyGo?KNə?>9Dk?nIe@^xS0@"Q=h ͮ(m)PM6?~˝ֿ? 9\)?4?M͏?G@V@@ fzQ2U\Jeֿ \?R~? ?ǖ~Y?HdQ@Yk&@ B'pJ% uJƿ E0?&q?G59?DSb?ic˥ @N|߄!ϐ; hwEX 4Ҵ/acݿy7{'ÿ1??O?F. p?L(P2A>?~'O@l |DIn3@c2-1k5⿗#EL;ѿ,Bv?,;?Deq'?ݠ?wV!y'?>5n@T" uE?` PoL{x JΈdQпzf?H2?yl"y?}?kC?[-q @mڞ'2@Lg+2ty`9h[, r7|ڿx_w@ÿ].?ۡVF?j??D?&?ɤ? @zNc&7@i5jv-kmVQ鿂-%i޿ŶП˿vZ?+/?DSIu?>q_?2pf?ҼT@+"@h$_x?>vS>6󿼅f!ݿM̿3}X?6|\? 8?@??"P v?_8?WnI| @+@Ql6ҰO?Z zVҲؾ 33ڿ=Cȿc`,l?F%V?c8?f!?_q&e? ["?x1U\@jp@jҠ42VdWfE#TرXaIgg(tx\׿ۄ1)ÿu.ek? Z`?o-S?3H?] 6_?]n?\o~9@lg@*yfB@?w}P**ý~ %1P$fLjªg5տ¿H?!N,?O?OC?=+*%?<?ĭ4;.?2 @ai]{O@hor6 fиhvqiTwX'(e;rCpvֿ{bg ƿq`?1wI?uB]U@?g?cpo/ ??v(:ֿ ޏʿ6)峿:w!?#NR?ZA?`x[?|?-ԝ?@q?Bn?u_j?1]6@R @H}@ȜC9A@_sDy%AGsQ9 rilw wWBl 11y⿾ /ۿ<殷VӿȵlIƿ_!쯿ys?RD?󻟉x?Bؤ??=V?bJ?Igz?>c?NZ1j?r5@q>uT @@u*.@u̳7wokn{SWTGe@|^Yz| ￑_;S<1.8,Ru$࿭mVؿڢd9ѿF,QFĿ?W{^?@??'44a?Iw?%?i̴?rh?`,?=Qj 4?kUI? dͦ?wmO@ؕb@^nC@"!)@EzU8@b2Qgtl?ypWwrJ3} l鿓t?Wڀr,pڿa]9ԿI\b ̿bI+WGTEn5.S?&TU?W5?7]$?ІV?Z `@?t ?YD? +vK(?8%TX?9uuN?ϢZ+?H5T7? @0z.>.s @dVJ@*. @B%%2@k'ߓ@|@!0N/\h0 #r(_(Ai_``ᴝSݮinۛ@>4U迃ۯ&?\ *EK@Nܿ ǁVֿKCпX)u]ǿ=Z𐺿,^4Y˚?:j?SU? 102?%21Η??ط^b?|X?m+Ak?9D?$z?MG?,@j?o@(+@eryT @MMݕ<@ @4|2@ _n@N¹e'6ϛen5l@)@Y RWvN@-te 2*w|A$fhG(IW((j#⿲9.+jA;ۿT{{VlֿNhѿ!ʿJa¿#-V!l^ )M?s?yGi{?U0B2?^N?Ycf?A ??澹?Ɵ? mp?i,%?+vR?J?}d?[?r ?8f` ? fM?؏C\ @Ndr^@]u @~ RG@2H@A@緔I-@8H[@w-1 4x !"/_q iɉR q15.>+w:=l|a`Ɓ(ercnK򿺇gWwn df翌f忽^ePK1[Bʮ8ܿd[ؿtRkտD3lѿ"a˿&^<Ŀ^=\SS5;x %?U"?&뉢?JIE?Ŭ?qTs?v/?0?3]k?ȇ0/?77B?AJ|s?? 5F?ix?~"U?ڭ4?e|?P?#B9J?x|?Y#z?va( ?F@ab@6@#K@X @:Y@VP@E1H@ )&@htZ5@jHF@U63fp&6a:#ɾr ˦\[ۛ --3 <~ȵ? h!"%xd@< _ $AbW5;Z í蛓6 {X#h翠Ku忯m6`῭&[;~EnLݿBڿY7}aT׿7 9Կ/%˾ѿti ο6#bȿ1cÿ(5\g^Ɖ6U90V?$MY#C?@?t? `a?ƽy? W?ڑZ;h??RG?9M?M=i??M}?+l?}.~`?Mg?1{W?y##?B!+E?l{4?&?2GI?59 ?)qq:?bi壤?W/?S?G I? ʓ?  !?)a@w)Df@j`n@(oc@,\-@&4 @@J9rX)@ @-0Jl@ @9%@o0@C cCB@}9h>gA#;-wO$-\yr#%<Xm[zȒx9Rh=(2 4vX"x )W-jw&2'U YR\8o-be5\q#!aČ>;/tbe񿂺s%j𿿵 9pG+obbDÈMA翤y?6^?~Ӑ%?c+j?x?^lT?ˢMB?YGZG?TH?ٵfl? Jn?bR?iM\U`"q M}Q^iSUĿ$ǿ_=ɿ̿k"f.Ͽ-ꑱHѿkҿͱ,6ԿypտY݁5׿$ؿi.HڿB&ۿ!Rrݿo'߿rB\732$T@j 5⿜CС-ƽ2R6 #yT`k鿲Po꿼n^ 0 ;KHw^X_էhv !sˆ&sx#t3a)t@@wL|)2C6xtʠrXM 4fp@})78ƈ0ABY~ɏܣ # $O ͤ=I?*$'zw1ݙ? B!h\$ 袹"d a1 '4@-m&3ξ4m?w{mQRdk@;ix)F@ͽ8@YA 1@ Pys*@뺃%@_!@F;@?y:@g@j@oT?1?m;?ʮZNl?#j)Ƚj?g^q?HM?vj?ԟw?(i ?f?U+f@0?k$0e?2D?)ve1?? !?i i?]et?kLr??rX?})J? ?/(9&g? ӎ?`T?"Y ?A??Cɣ?}?H%_? ƑlE?2H.?Kq?g ?X:?=S'?#?.P?9?S?2a??j5?<"?|?.ӣ 1 ?8'=?` \n?լ ?vI?ް?Hb9? P?Zh.?ʹ~?W9|wdX'Z_P]n)]@Q﷿4w.P^*Zÿs5ſ}ǿ~ȿ( ?ʿa@2s̿(ߎο|#xb9пG(,ѿA(!ҿjeuӿN]ԿFտZ?ֿ!9@ֿ?׿p1ؿWUٿۿE03 ܿ -ݿ@;.!޿M0߿W//!+ë࿹B7ῇqD?PUe^⿄ Rz,,⋿uD};AM"Ƴc|Xo:翶7Ai6dA拢D,(oU#뿽)vYkSaXaH('QzeK)בu(tΞ4;j1|n9H٥i3dZx@E֙;QG%gE^txtLFb}ײuF.*]A/f܌ ݭҢ!2ι#v)[%ٲ!)-X"0W1[,o5d62$@1<@JL@r4@t`` @2d @_<.d @ P( @7 @c@9@;x*@/" n@Ֆx@8@MQu@iO@vdP@ٻ"@g/1%G@[Ī@U@X@ey@}V@[/ۘ^?`r??E"9??]W?ЯO?TS?ص0%???hƭ ?o?TI?cS#?]?"??)?9Ժ?b̅N?\~?9;*A?؈? X?KՔ[?s!?SF?$L?-?s䙢?˫jZP?D?V/?Sd?}$e?e2q? ?nlu~?p` ?u&o]oj?'JH?1z`?jz@?~3`?RrZ? xh?ml?gJy?&?桑?; ?7(? xC?}h?Rel?FF+?tN|?t̑9p6?xD?r>wn?Cu ?1?R0Z4L?cU.?" b?^p4?.Kf?ǚ4'?' h&?߲?m@"0x?`M:"?_Fn?]?ҏ ?vK?ib?r_EH?7a?.5r? Gz,"?)g? 6?TsO?g=f? ?ng-?fLcݿ,ӂݿ[ v:\޿h\޿.XfpV߿a9߿Z&#)IOiYXk!࿎p)gj῏}:Zy-?7o[~Cfk#N6QQyQ@]XjEaDsňd gO*K&X} 3S忊U+a+Gbr2I|IOiɒݜE.xf%hpWafKY鿼Y8+Q 0Kʝ鿈ݡv57꿘LCn"l@r뿚N뿿t?zu\7dfM퀰c^b[ʣ4q_,Yrx5.:_5\>!ڴ~i3?L`D}9˩𿦂aHM'Ax('%[K,.U yq;@mmb4rU;b>_h:Q0"nY/󊗻,",@bFßR0~=4,cA(%=4b -dFlPj$ȍY jYJ27Os[ CJ=wP9ј8O5sjyѸGd(eA.56>cS)y8cd fEDmhw_ )rZxwL'@a ':Ls7DC V"+U#pϬ{՛"^fbz̦2g|NJpCJdKn5 PqNט\nN_! Ҟ5{f7ʳt{" Xo , >lO yx @% W 2Z| n5 0q 9 2UbPuK2ߪi) ( !W;1C` kEE CY 7h1`LdW+& ˖q. G\H:ح?0Y6@{+&aV.=R"lQJD>hq"u`^X*zϘ lOշ#axj7]]ϗ/ y% Jd:K!*!(ԍ"6ٙ@#G$Q$$UR%u&v4ɩ'Շ(*썆b+>c,&7.)480o"F1`>sz2Ģ3T>ys5kP7hWMX9J5&)HcR^M,RʳY#,/ dZqy:u@ j@KT)]@]38T@2P@$J@!lj E@*5=\B@gۻ@@6 A\7=@gJ) ;@ m8@kX6@xX5@WYޒ3@ǃƱP2@D51@ki;0@|.@١^*-@=R+@sSd{*@.IQ)@M B(@|njH'@9ub&@z%@EF$@Y$@+ g#@:l"@+?B^2"@F=E!@jr"!@w{ @mh1 @r@B=@Th^@0@E}@#e@E0@@ðr@ V7s@@Zi@aX@v|u@Ǚ@B2@)@'h@pa@@gg@ ZM@[s_@~^@s;]/U@Q d@?Ӡ/y@gt@d>.@rUR@ @;g@6z)@"Rj@Kl C@@cx@@@yO @@*)D@gdz@@  @I͂ @puh @^#9m @/Wι @嵷0e @(OG @x @^Pt @Q_P' @Eqg @)} @tHK @[e @y/2 @P-| @ *: @/@N[x@la%l|@}*ړ?@8@@ Zn@w#@(W@ Ɩ @_@_.@}@207M@s:|U@ @g8i"G@G+@W-'Z@{,@?$@Xg@8!>@ {@up/Q@m~[u'@/]9f@wf1@H.9@?@?B`@xOt:@Q6@Hg@7&@Zqn@è_=@ҋ'b@ۨ0d@@!@de[@cԾ@1@+ɮ@@l?P#@#7q @l?"?E8x?E?/=?1!'?nP8?w?o{z_S?Y&$?ȴ[P?:?Ke?*h!n?ҾܸB??] <???\? @l?~WݧC?p:6?/)W]?OuX_?O[΢?{?_+T?.r.??q&;?(^Eq?J4/?at? WP?^x-?K ?䚈?G)?u?_?`OM^?WJ=?M"?}4m[?e_? r?;#3?tT{?ɢ֊\? =??-#SM??g(?>_Y{?>? CCm?3=P?@,4?]q?@?`q!?3a(?L_?ɁW?>>s?xRZX?ɑ?>?!p{$?AOY. ?@?/Oc`?fl?߰'?%?3oys?g[??ŁB?\*??tJ ?`?!-?n5?Qy ?G>?Đfp?Y5*Z? C?G-???d@#??h?mlV?؂?t~?2??Dm?m @,oY? x E? {0??LHik?sW?‹K=?l۲?KOK?MC?{T?|"?3Mn?lxC[?ӼFH?y\'6?(`#?|d'?k?gnk?v?? ` !?D/?Y.?{9?r!m:r?ۗśa?6LtkP?& ?? }/?Ua`?]Q ?HR8e?5?GN?ej?IVo?ջ?-]?=k*)?/VӅ}?;cDm??݆^?tSa+O?*+?? @0?㚩%!? ?6˿?R?JjIk?."?Ax@?"u?_OX?;?N>B?ݹT=?/rp?J?Gu?^!y?=|w?0w\?ش|A?rqv&?f ?S'? LK?:ݻ?1?G癟q?Uśrm?(ԗS? 9?ŶM ?է ?Aː?6f?MRѥ^?x?L紉?>uq? ^AX?$1@?Pq'?ZH?8C?0,?N4?ę[?I=??\?A?]??Pۧ?.$#?d+$?l?c`Y?`+F?h(AF2?Ģ?3L ?pF?C?sǃ?݆?prn?C؛?d+X?՟v?_d?g(B#TR?@*&@? (.? ?-*/ ?/Ng=?.u?G?(?(On?TL?3?H4^}?M2l?Z?!DvI?T8b8?El'?)}.?]X#?1c?@?K.?jj??g1?-_?,Y?eq?,a?IzոQ?+A?X 1?,0!?d&a?x c?ۇ?Q/D?c%V$?m?襴?~I? ?ئ?bAw?Jth?v r=fY?fJ?݌v;?9G,? q?Cv?Ls L?0i?M_?݆?" ?0??C?G~?Ec?N~?,[p?Cb?g:T?ȍ>F?_pP8?ZQo*?>;@??a?s#s?K ?HT D?#?7նH?ޯ?/N?)j0? ׀?rz?m?b)ek`?M+YS?}?;J^?Jy?lyd?#"O?79?`$?? |?7"?>?$}?AՈ?2I"?4s ?XVt?,?}?'?Px?[Ijy???nx?]e?4-S?ğMA?e/?D;?-~? ?x?R8j??NGv?|?ùBe?="?Sƨ?1n?1ok\? K?x:?e2T)?2??Gܨ6?FP;?T M?/^k?5e?}Yв?1Qs?&Fi?eȀ?5p?x_?Z˿3O?R>?Pd.?x?s ?@VHϋ?N\?9?\H&"?LMf?rr?u1O&?v??Gpe}?0m?hnSh]?vFϵN?AIr>?Ľ.? 8T@?%֝?4ʈ<?S ?g? ??|?M\E?{??r,v?ym]hg?MIX?UBI?1\J:?T,?GVL?8>F?"#??8m?(5Br?mcc>?W?a0F:?5L!ș?ԻZ`?_j{}?U[n?h`?*R?[tC?5?*X'?[W6? ?h۟?Hͭ?\ּ?(?`@?['?(c?u ??٤R?Hns?d[#f?*SX?K?HUN=?7?90?yD"?s}?бu.?׋?4Cg?ley?[O?s /?N?KP ??SbƔ ?>9?̔/x?'P5Ok?i y^?T}bQ?9D?+8?r>ax+?)?x-? x?|?)??q?wnO!? ?Zp;c?A?ViǕ?*Z[?B~ M}?)q?SDd?J|)X?״xL?'*@?7D84?#ԙ(?0?"~2,?+V? \?>?y?q\u?mۧ@?̀o?\ ?x?_u?3c?"l2Q?1Rz@?c@.?t?f ?V~?.W?B?%?](?|Or?&&? +?B?{Q~?M] l?Aթ[?efJ?R.9?mh3(?yR? 2?Mwb?Ͻ?z2?i(?:C?Q(?7^?Kr~?f{m?j+A]?L?r? ??/?NT ?xS#??n]A?})?)YA?-[?)Ķ? 3֧? `w??qC{?8{l?m=ͻ]?O?neX@?NZ1?ƒ#?Vj?EL??X?0I ?kF?H*=?ּL?÷E?/I?ՠ ?SfsdԄ?*qv? P@h?'fZ?QATL?1fcJ>?W6BVI0?25Q"?[a?dz?fӜ???gp6?y{?/ȳ?μ?Tb|??D0S}?eo?dqKb?a>T?uweG?lp9?ͦ:,?mgK?|g?L ?@ K|?ZtG?ӎ?z|?ǯ?ȵ?=#?G-?0kԽ?qwʁ?Uqt?\gg?mUT![?@NN?<'A? 4?@(?䃁Q?)?ё?f?d? K>F?bUq?=F?乡Ѷ?L{d?+?{?K?sBx? l?yw`??T?xH?_>Z;?P_/?eta#?q~?” ? z?, q?k@f????4c|4?%V}?l]H?ac?-]?㓇?t+S}?(q?qf?CLgZ?0N?ů4CC? ٻ7?i;,?Gl ?HQP?HnB ?~:? 5$?-?~?/7? k?)M?<G?~[?>қ:6?Zd|?ɒ?Dyw?uT+l?n|a?AV?Ԟ-K?C̍@?!6?i4+?X ?zD?V ?;?CzS.?0s6t?AY?0?:m?s|LͿ?`3?UQ?Ow?s??bs?ߘ9"v?y朶k?NPa?V?{''L?M"$DB?/7?E3-?q#?fX7?-?1??l?Qs?ΝR_?(d?'fYz?6A>?cs?JoIx?o?@kM0Ce?6O}[?QbQ?2dH?²QO>?M&4?xP_*?M>xV!?]?f:#?=E]??J"?5п?iS?`)?uM?lʆ|?K1q? ^?feNL?9?X'?h4?5? k?ŴW#ݾ?] qʾ?jn? %?擾?RW?)o?T $m]?ZK?-S9?V'? d? ?~?F&?QV߽?k ν?h{O?O4?m?1\?Uu?ʟEd?UR?tYA?ŗ/?Kp嶖?PME ?r\?d??G̏ټ?hȼ?AwJ?'7?0b7/?A0?kY?UXI?i$b:?sRW*?I.oE?7Bv ?tO?0ߣ?љz}ݹ? p"ι?!о?jB>6? ?(iFy?4O6?)R?hpy|?wx?W1??@R?ܝ[T?w*?(J^?+`?O?2j?~&?> ?uR_v?[ ?BM3)?f?` x?58?o]I?P?^t?TrT?լ? q?5b? o>?*~{?@u?\aD'?0&?#r?OsWqA?}#,?:mQ?\Da?w"?m+?s ?'W D?g\??s,Y2;?b`?ծ?*1Z?λ?&sQ?c?$^? E?R)A?G6'S?\0,u?ǘ?MQC?[&??>?^? K'V?M'2?;B1?fa?5ٖ??`W?Td?Z'Oh?QF?L3S?5S?=%*DC?d?ς8?A?ӯ2d4?C]g?&T5?:5?% ?Apv[b??U o?e1?ˏx?:??ER ?XDS?pL?`?Uv8?>G?g:j?ԍJ(?Mҳ{?m?h7|$?G^z?زn?Ɯ,?`?Be?۝?bC?kӻ?8D?*i?NM?aD#7?{?]W?=z|? 1?'2DK`??,ҎN? '?; sF?˕? bJ?]?{Z? q?ڑM<@n@3w@禇@ɓ @5p@OS@3@N@vdn@ W@^8C#@k!R@@r>;H@(¢-ɯ@V'@X4@R@~jPsp@-'@ ?h@٘~|@LVq@75@  @jvi& @Z` @ #Nf @|G @,Jh @.)z @^@x'`X@HUz@uou @[!@, |"@u)ى#@l*$@v&@{fR'@%v9)@7K.+@oP@}t-@:0@QI@1@M͛3@C6@&29@4'=@R]`A@`Q@|E@hȵqL@y$HT@Rx)b@ٮmk@lάoQ&Z9k Q[HUƱC4dKH@ \;^,884iz5dQTL3VBO1R0 3P-| +NO)EXx(}R&hn%  Q$d*P#`h"b"!&2 grF$ |P}eyF>'fHP'H6c% da0UCb#u6Zt6G+?.|a㱁!Xx =ۘߤ.^ؽCDR1\\}i+NmYe){7a(D -ñ!9Vmӫ\ Lo vC ,Cm y6 k| + b _2 m~$0 ]< hjSd ;Xu > ^uAlID|v82Z*F{Б^C-B7X]7) {ym|KC6I WTFkjNspS 2lcҊ|ظ'>J/\~L"vL8EM`  Ch2m&JƤ:v2 Ҷ15rGM?Zx+cJ dxYqoc5{i3=AmqlqXyIE3 !'D2`PZKwL} H(}jP9R|{ϯMq7nl{,+̽b0 }dlp:d.UĶ$|ᏻoB]$o 'Ǭ=FnYizM[dlZJ.?6F8%0hBSK``YF/Ungȿo[,TAdXm̖Q꼏Cvq.j4cm8j`D8λU6J!hfIkCd?Ngd1X>E'wQi`+ф<6u7|IfKg8е#09kOJHxUE)=jL󿲴OY8Dj9SK$[-󿾎>0͆]0bD 1/,򿁮~mwb58`Ffl4C+KrYd?(ƿY_ 3'rUqnxpXuO9?Ǎ?&aE tcj!ut׬u:𿮍g}p4faO]xw8`X"ȷ 𿞔v_�X!￝ h閫&>ywSe￶#￣VrOm DHB&v(8Qi&5-x?}0 3|VsAg̞ '{.FT8YΝ6뿨J\zH1꿤?ѯ'B꿦sm}w+M?W,꿸 [@鿋aPnͯ}͔>C@7ohP{f1-@Wr`(I还TUkӗ迮]|8ZRI~kɟa迣D_'@ab f 翯1hBjin=i!K*7d@IH0H翓n-K Ag{̪f_X/k$%h+ Qu濈>[OBt(S&#Awˁaw/(\iׯPgWKSŞ{wFc%Ku3:c忰յxc- +係W\7&俏,8_F.z/(c俀ߧ-M5b6s 保" F㿉V+u @Mi?ij?[&[9s㿶q^XI?!5;r  uk⿪d`W⿑⿥vI$B`+gt9|p)s#`R2u$N,bΈTPo>/,ڲ}&8 ͪY9mbkE~࿰Ao̱c?/(ȗk~ޓPxm\8]9\Fw!K׮";t0G*%1࿍ru Zi߿0߿y߿B?߿/q߿G@EGQ߿(>1߿Z߿޿G:޿޿=!޿Ov޿YW޿<ƚ9޿ķp޿sI!ݿPsݿIݿ0"ݿyt?ݿ_Օgݿ9Jݿ)Nf-ݿYݿbܿ.ܿ8>Bܿ;9ܿAܿ ӕRdܿR2^1HܿwF2,ܿ*GaTܿ~&ۿۿ:̂ۿk, ^)ۿuۿ(ZkۿI^Pۿn56ۿMۿ Djۿ]B:ڿ/ڿ[ڿ%tyڿѯt}ڿṥcڿkaIڿ}e>0ڿ=iڿ Mٿu'|ٿyaٿrj_ٿd˘ٿ}J|ٿFy7gٿ-Nٿ}?"6ٿmAguٿӄ`ٿ?Q?0ؿ`ؿA!ؿחGCؿsؿ&?uؿفH^ؿ/Fؿ{/ؿ#z<ؿߟ<ؿ2t ׿ ׿2A׿F7-׿aݎ׿u2Qx׿Y㣴a׿VZ1K׿Ӏ@5׿fC׿w` ׿iCh ֿ(,ֿ$cֿBֿvֿ9ꗆֿJ-qֿ=t[ֿȞFֿ#y1ֿ\~lֿR{tֿS;wտտ@lտ yտZտMտ0&wտK8bտJNտxv:տ!/ϒ&տF2{տ B]Կm"YԿ)PTԿ:2(Կq2ԿpԿ0݌cԿvԿ;pbԿm.WOԿey7<Կ )ԿjԿ*q Կ7PӿlӿӿLРӿ ӿĔӿA|ӿ/iVfFpӿ#^ӿ!-Lӿk^J0:ӿ s+(ӿͻ9Sӿjӿ̯ҿFҩ8ҿ$ҿ%3v,ҿ1NVҿ1hҿ: ҿ{dxҿzgҿVҿ=EҿJ4ҿ#ҿk̇ҿK'ZҿI˻ѿ:ѿhƎѿѿ)bѿzQѿP ѿr~ѿwsnѿcV^ѿjNѿw X>ѿյ.ѿ_?ѿmѿcпSпݒ&пCп(пtFMɿп|nCfп4^@]пCпcϷtпQeȮeпzVп|^Gп{V 8п)пFп+ п1MϿϿrϿH$g`Ͽ5ŏjϿ[hsiϿ&gLϿ$`40ϿYϿGοοɾοomοԮο;TMjοV)Oο$q3οl%οաqͿRͿǩͿ畻ͿD彳Ϳ& h-tͿtYͿ?>k9?Ϳ#$Ϳha ͿI!x̿%V̿rL̿̿ ɒ̿ćy m̿{g6S̿@{9̿]t̿_EO̿9˿ZX˿K4{E˿_n˿`4 ˿68)o˿3q6V˿tn=˿ y$˿Γ& ˿#ʿ[o;ʿ̇ʿġ:ʿ;ʿFwC~zʿupbʿqJʿ52ʿͶ0ʿ-ʿ3kɿ鬢ɿĨFJɿTE ɿvݎɿeR8wɿBC`ɿ¶Iɿń 3ɿ3LɿCɿȿ Gȿ(ȿ\իȿYzȿV#lȿ2Xiȿ#WXSȿ9m=ȿj{Ė'ȿȿM@y'ǿ/yǿ ǿvJjUǿ=ǿ |ǿ{ǿB0fǿu\QǿW ݚ<ǿ3'ǿz.ǿO٠ &ƿ5~{ƿ^x2ƿ)`ƿG:Pƿ\ǎƿ= FƿoƿQS1ZƿئFƿ2ƿJƿw ƿ_41Jſzſfſ9uaſ ſ8vſW({ſ)KnſZ=[ſDkxyHſ{f5ſ3Pe"ſSvſp:}Ŀj]#Ŀ 4Ŀ4ݟgĿRϱĿ);HĿIҌĿikmzĿxhĿӤUĿ`CĿ9`^1ĿrĿs~~s Ŀ܃ÿ/4ÿGÿEÿ kÿyݿ΢ÿ]AÿT1 ÿ^4~Xnÿ)pU\ÿ,xEKÿq r:ÿ ۱E)ÿC(ÿDÿH_&¿3t/¿P¿7d¿IH²¿fk¿ ͙q¿W߀¿r\p¿j_¿[O¿$=M/?¿/h.¿?5}¿_Q¿yo[d>Gqg%1z8|͚SiʮTSt* p[` ^Qi> AcNG2p6"lӳ~MW>1N30Jދ5v@xnEeb퍛Gfpƌ7b ~_oe`b,\.RNmC15?y&V]jF Ǭ?ۿ+G쾿`.ГjE|N(2&J{qM,7l߾AC*zľGN#Į捾 r W:N<!!NL5v콿0~Gѽx>hbIpFΆhkNt2f4H z&T漿x?ͼP C[Aŭ7SրcO>YgnWN0<:55ŭ3{}Cgפ#j껿3ѻY &gcpƤㇻT>xof"4$W>?{&t|ˬ޺/!ͩƺt5]2-'M!h⧸7Q?V9ui"W^] H IEŜIݹ/^ƹtan_ru scalar structinputmatrix]ex0Vyy۽yOp3+;Ʊ t0³@NEUy݇|0)b4&\"eQc}?3IfV[Va-_ƟCN9}uT}nAe#Yp|qg.O+~rzU޾cP^ƕhh5 VG: n&XduC9&g5CGG mӏ`BگɌP*R;o=m[4ԇ&rN=y vnPo |#|C//vnzskĄNDS.WH̛Z4ɂ`W.QT_XRb] 7t@),Uqjs(aN~|msC/SOYR=+pҔi"49º "=ebix32-]ExvOP~_eC,FOQ2KBm 4ֺfh)-5۱}4cB)f- `ǔWx ^f2S`E8^NfTSChŸy@GU|elHȹiq5[+ҕ>u˽o+0{U"NX9TWHގbf&kWMG*4dKmE0%x($dIq#hax> EF?OWXy"c-ƆYqb6 UZDAdDyI j^;ҪF˗$paDwBR?k+L)0cPlJ!c}jgp2lP0.yr7cZvsglA|ދЀWubEVh. NfyݸPD hpOFFN:^fFaE BKOaBYs+VY j @hЏX "sT%iޗi(%D*wPu+ ^!h }w,4G:%Z 6~FohOk jZhqb7X zX3WX%NK^;{5$J[Nʮux=@alYߡܡy&9Ih}heb;f*h((rb|j,;@l&7FToW$qxu^G b.$s\ޣ”T-DAуnA׸\W:_xChH}N M?iaH?dO8ޥKzx6@a`oN}LڕtE C??Qy'…Y$ĢgN~'g=4z j ],VENtBg &yIfz k Vth.ɓo }Q $s2d35Xfegp ᷮ`NnͻVNo/6o ʵÖ|S'O =LϮ qb%wulcL*p7m|rFnse>'\A~&YbϺ=~`̩* źfxfhP`8e_2azJ0Z Ŕ5li)s8B HI@hɟvhMm}I9v U"ʑ8`voQSiïKf@R 50Sq,D OelbN8d]P٬kt@[JQK\C6ƸC|)_ Nc$DRoutputmatrix]l?, )eg|%ք?^c b ȿY0`ҿB`>?+*e?^f!t?@gh} 눟,L ?\;#@2! |[@1\ yٿ3xNҿ󾿩sֿZL?!@Pq=%`J{]/ȿ%?A?@G.?f/wZ ִ^?T?F?MNmG|?mݪ @gUV BHrW@YN߆{@ k(E6u@?M[~r%`@ d9 ?IBܰ? ?TTę$]WC?i:p?b*& @{07?&#|J(?{\?=S~ҙ? s9^?GɎ?(y(?>y.Wҿ[&O1M .?Qoh+?c֩?9M ?f.?%AR?7]:,R+SK?BzR@b?NO :լy '?l8?u@&'o/D@G?ܙ۝?RBN] *@@L&R/a E鿡 ?jÿ>Dq@EDɲ? m]5z&bJket?50G?]/ 0?j޶/_8i?Ж'?ѿHO濏Gycz?ӓ_s %Iȩ*@LUir)gj?t?e; ?7𩩍?ъڿ`T[ @H? ?Msn@@ uxK {5?ROc)@`=?YpǨۿܲ󿍽:>7H?gR@Y(+!*v$=?BhSU4FQ@8,y?740ո?E75쿶%'@8؈}[w?ޅ2?>hl@AKd] ν@{%?wFB&J.s3g;@O ࣿ=pܿ3{ImXy\z $kklđ<̟M! Ċզsg[Wc<@0+9?\ͳh?'*v0c\J-Ԥc?31e|c@#䤿FտYxg/P̆?a|F?WeIN?(!?6uĿx:&tB׿]~?T?[R?0ۿ'w@ǁU.$?3~ٸ]?udY@?ډ7 п|or8\IῳLu?ܑnCf=d/7`g #(@O3L%?noK͖Cq{Ί^G?^}YĆFpٵ?1ʻ""#m&@&bcobЀ!h-˞%1?)cVkzu?^뿼$\࿄lgvh@|k?#u?#*P?h!H?YE4$rL@9"p宴$?C3pƧa?o?tUM\俾xJ?O= ?tĉkĿ`6ֿ=ٿu 7@#?)/>#{?ldS"?|JҲ'ҿNj@2i@KA ?9?0C‹?,ڂot?칅CT?tan_rz scalar structinputmatrix7-S?N]s\?CJ?AXi4M?kE1JMM?jfAN?O끸? >k)?K<.?· ?;Ci?$Yx>>F$>P>?>wH+k>V~W3>rB>m!K>Xua>`f_>biz*נ>6HRP>Yc>q?BdӜ>.6N>5k[@>dt [?5qS?4`BP?'Tު@?K@?罞ET?._?YDm?GOF؍?& z?>E-Md?=֊?*3?gOcS9J?dt [?5qS?T''?9bM ?!P?#j?{o ?;N!?na@_!?6a!?A:^!?ӯ!? m!?s !?#vY!?Qm!?ѿU!?B!?+!?Z!?}"!?^=ebix32-]ExvOP~_eC,FOQ2KBm 4ֺfh)-5۱}4cB)f- `ǔWx ^f2S`E8^NfTSChŸy@GU|elHȹiq5[+ҕ>u˽o+0{U"NX9TWHގbf&kWMG*4dKmE0%x($dIq#hax> EF?OWXy"c-ƆYqb6 UZDAdDyI j^;ҪF˗$paDwBR?k+L)0cPlJ!c}jgp2lP0.yr7cZvsglA|ދЀWubEVh. NfyݸPD hpOFFN:^fFaE BKOaBYs+VY j @hЏX "sT%iޗi(%D*wPu+ ^!h }w,4G:%Z 6~FohOk jZhqb7X zX3WX%NK^;{5$J[Nʮux=@alYߡܡy&9Ih}heb;f*h((rb|j,;@l&7FToW$qxu^G b.$s\ޣ”T-DAуnA׸\W:_xChH}N M?iaH?dO8ޥKzx6@a`oN}LڕtE C??Qy'…Y$ĢgN~'g=4z j ],VENtBg &yIfz k Vth.ɓo }Q $s2d35Xfegp ᷮ`NnͻVNo/6o ʵÖ|S'O =LϮ qb%wulcL*p7m|rFnse>'\A~&YbϺ=~`̩* źfxfhP`8e_2azJ0Z Ŕ5li)s8B HI@hɟvhMm}I9v U"ʑ8`voQSiïKf@R 50Sq,D OelbN8d]P٬kt@[JQK\C6ƸC|)_ Nc$DRoutputmatrixz(.S?&=s\?} J?mj4M?7<:wKMM?=ϒN?on?u3Ck)?+E.?9S?AkCi?Q[Yx>>I>9>d@>`H+k>eW3>sB>P!K>8va>`f_>jz*נ>LRP>s¸Yc>d?BdӜ>I6N>k[@>bo?tkrq?&ٜ?yA?zQ?PPV?Z?]6 ?_Dٍ?z?d/Md?'d9?uv??ˍ`?bo?tkrq?2N?-iX@ȄQB}@#U (@v@/w@qY@Tr!Z@~d@8o87@hW2 @%uV@Ii@tRQ@2x:AP16SAܤAo8A:wueAp*Av@2AͷN6A+P;>A}"#dCAb&DA %bA5'"jA-5|A A3(0AXBAVA!A\Z*A̓b $@Ey*@-LSAԧes BC"r BÓ,B>L1BsQKHBG;U4@gz">@tD]>@5%;3sBn!TBF"EB8B󩮪B"[B_r9B=M ƷBsyxB'tNBB\tQ B0v1B7VBxB8h8BB1BqQ B;W@n\@d.a@,LnXk@_raw@a4@5/H(@l?, )eg|%ք?^c b ȿY0`ҿB`>?**e?]f!t?@gh} 눟,K ?\;#@2! |[@1\ yٿ3xNҿ󾿩sֿZL?!@Pq=%`J{]/ȿ%?A??G.?f/wZ ִ^?T?F?MNmF|?mݪ @gUV BHrW@YM߆{@ j(E6u@?M[}r%`@ d9 ?HBܰ? ?TTę$]WC?i:p?b*& @{07?%#|J(?{\?=S~љ?s9^?GɎ?'y(?>y.Wҿ[&O1M .?Qoh+?b֩?8M ?f.?$ACq@DDɲ? m]5z&bJket?50G?]/ 0?j޶._8i?Ж'?ѿHO濏Gycz?ӓ_s %Iȩ*@LUiq)gj?t?d; ?6𩩍?ъڿ`T[ @H? ?Lsn@@ uxK {5?ROc)@`=?YpǨۿܲ󿌽:>7H?ghl@AKd] ν@{%?wFB&J.r3g;@O ࣿ=pܿ3{ImXy\z $kklđ<̟M! Ċզrg[Wc<@0+9?\ͳh?'*v0c\J,Ԥc?31e|c@#䤿FտYxf/P̆?`|F?VeIN?(!?6uĿx:&tB׿\~?T?ZR?0ۿ'w@ǁU.$?2~ٸ]?tdY@?ډ7 п|or8\IῲLu?ܑnCf=d/7`g #(@N3L%?noK͖Cq{Ὶ^G?^}YĆFpٵ?1ʻ""#m&@&bcobЀ!h-ʞ%1?)cVkz;D>u?^뿼$\࿃lgvh@{k?"u?#*P?h!H?YE4$rL@9"p宴$?C2pƧa?o?tUM\俽xJ?O= ?tĉkĿ`6ֿ=ٿu 7@#?)/>#{?ldS"?|JҲ'ҿNj@2i@KA ?9?/C‹?+ڂot?빅CT?interval-2.1.0/inst/test/crlibm.tst0000644000000000000000000000750613031036767015442 0ustar 00000000000000## Copyright 2016 Oliver Heimlich ## ## 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 . ## crlibm.mat has been created from crlibm's /test/*.testdata and is ## Copyright 2005-2007 F. de Dinechin, Ch. Q. Lauter, and V. Lefevre. ## Conversion into Octave's binary .mat format has been done by Oliver Heimlich. %!shared testdata %! # We have to lookup the .mat file to load it. %! testdata = load (fullfile (... %! fileparts (file_in_loadpath ("__check_crlibm__.m")), ... %! "test", ... %! "crlibm.mat")); %!function verify (fname, rnd, data) %! assert (crlibm_function (fname, rnd, data.input), data.output); %!endfunction %!test verify ("acos", -inf, testdata.acos_rd); %!test verify ("acos", +inf, testdata.acos_ru); %!test verify ("acos", 0.5, testdata.acos_rn); %!test verify ("acos", 0, testdata.acos_rz); %!test verify ("asin", -inf, testdata.asin_rd); %!test verify ("asin", +inf, testdata.asin_ru); %!test verify ("asin", 0.5, testdata.asin_rn); %!test verify ("asin", 0, testdata.asin_rz); %!test verify ("atan", -inf, testdata.atan_rd); %!test verify ("atan", +inf, testdata.atan_ru); %!test verify ("atan", 0.5, testdata.atan_rn); %!test verify ("atan", 0, testdata.atan_rz); %!test verify ("cos", -inf, testdata.cos_rd); %!test verify ("cos", +inf, testdata.cos_ru); %!test verify ("cos", 0.5, testdata.cos_rn); %!test verify ("cos", 0, testdata.cos_rz); %!test verify ("cosh", -inf, testdata.cosh_rd); %!test verify ("cosh", +inf, testdata.cosh_ru); %!test verify ("cosh", 0.5, testdata.cosh_rn); %!test verify ("cosh", 0, testdata.cosh_rz); %!test verify ("exp", -inf, testdata.exp_rd); %!test verify ("exp", +inf, testdata.exp_ru); %!test verify ("exp", 0.5, testdata.exp_rn); %!test verify ("exp", 0, testdata.exp_rz); %!test verify ("expm1", -inf, testdata.expm1_rd); %!test verify ("expm1", +inf, testdata.expm1_ru); %!test verify ("expm1", 0.5, testdata.expm1_rn); %!test verify ("expm1", 0, testdata.expm1_rz); %!test verify ("log", -inf, testdata.log_rd); %!test verify ("log", +inf, testdata.log_ru); %!test verify ("log", 0.5, testdata.log_rn); %!test verify ("log", 0, testdata.log_rz); %!test verify ("log10", -inf, testdata.log10_rd); %!test verify ("log10", +inf, testdata.log10_ru); %!test verify ("log10", 0.5, testdata.log10_rn); %!test verify ("log10", 0, testdata.log10_rz); %!test verify ("log1p", -inf, testdata.log1p_rd); %!test verify ("log1p", +inf, testdata.log1p_ru); %!test verify ("log1p", 0.5, testdata.log1p_rn); %!test verify ("log1p", 0, testdata.log1p_rz); %!test verify ("log2", -inf, testdata.log2_rd); %!test verify ("log2", +inf, testdata.log2_ru); %!test verify ("log2", 0.5, testdata.log2_rn); %!test verify ("log2", 0, testdata.log2_rz); %!test verify ("sin", -inf, testdata.sin_rd); %!test verify ("sin", +inf, testdata.sin_ru); %!test verify ("sin", 0.5, testdata.sin_rn); %!test verify ("sin", 0, testdata.sin_rz); %!test verify ("sinh", -inf, testdata.sinh_rd); %!test verify ("sinh", +inf, testdata.sinh_ru); %!test verify ("sinh", 0.5, testdata.sinh_rn); %!test verify ("sinh", 0, testdata.sinh_rz); %!test verify ("tan", -inf, testdata.tan_rd); %!test verify ("tan", +inf, testdata.tan_ru); %!test verify ("tan", 0.5, testdata.tan_rn); %!test verify ("tan", 0, testdata.tan_rz); interval-2.1.0/inst/vereigback.m0000644000000000000000000000731513031036767014735 0ustar 00000000000000## Copyright 2008 Jiří Rohn ## Copyright 2016 Oliver Heimlich ## ## This program is derived from vereigback in VERSOFT, published on ## 2016-07-26, which is distributed under the terms of the Expat license, ## a.k.a. the MIT license. Original Author is Jiří Rohn. Migration to Octave ## code has been performed by Oliver Heimlich. ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypefun {[@var{lambda}, @var{X}, @var{ep}] =} vereigback (@var{A}) ## Verified backward error analysis of eigenpairs. ## ## For a square complex (or real) matrix @var{A}, this function computes a ## vector of eigenvalues @var{lambda} and a matrix of eigenvectors @var{X} ## in the usual Octave way ## @display ## @code{[X, L] = eig (A); lambda = diag (L);} ## @end display ## and additionally a vector @var{ep} with the following property: for each ## @var{i} there exists a matrix, say @var{A}[@var{i}], verified to satisfy ## @code{max (max (abs (A - A[i]))) <= ep(i)} such that ## @code{(lambda(i), X(:, i))} is verified to be an @emph{exact} eigenpair ## of @var{A}[@var{i}]. If @var{A}, @code{lambda(i)}, and @code{X(:, i)} are ## real then @var{A}[@var{i}] can be taken real, otherwise it is complex in ## general. The maximal value of @code{ep(i)} is usually very small (of order ## 1e-013 to 1e-016), which shows that Octave computes eigenvalues and ## eigenvectors with great accuracy. ## ## Based on the inequality (3.13) in J. Rohn, A Handbook of Results on Interval ## Linear Problems, posted at @url{http://www.cs.cas.cz/~rohn}, which also ## holds for complex eigenpairs (unpublished). ## ## This work was supported by the Czech Republic National Research ## Program “Information Society”, project 1ET400300415. ## @seealso{eig} ## @end deftypefun ## Author: Jiří Rohn ## Keywords: interval ## Created: 2008 function [lambda, X, ep] = vereigback (A) warning ("on", "vereigback:complex", "local") if (nargin ~= 1) print_usage (); return endif [m, n] = size (A); [X, L] = eig (A); # A*X=X*L lambda = diag (L); I = eye (n); ep = inf (n, 1); if (nargout > 2) for i = 1 : n ll = lambda (i); xx = X(:, i); if (~isreal (ll) || ~isreal (xx)) warning ("vereigback:complex", ... "vereigback: complex eigenvalues / eigenvectors not supported") ## issue warning only once per function call warning ("off", "vereigback:complex", "local") endif ll = infsup (ll); xx = infsup (xx); epi = norm ((A - ll .* I) * xx, "inf") ./ norm (xx, 1); # main formula ep(i) = epi.sup; end endif endfunction %!test %! [lambda, X, ep] = vereigback (eye (2)); %! assert (lambda, [1; 1]); %! assert (X, eye (2)); %! assert (ep, zeros (2, 1)); %!test %! [lambda, X, ep] = vereigback ([2 1; 1 2]); %! assert (lambda, [1; 3]); %! assert (X, [-1 1; 1 1] ./ sqrt (2), eps); %! assert (ep, zeros (2, 1)); %!test %! [lambda, X, ep] = vereigback ([2 0 0; 0 3 4; 0 4 9]); %! assert (lambda, [1; 2; 11]); %! assert (ep, zeros (3, 1)); %!test %! [lambda, X, ep] = vereigback ([1 2 3; 0 1 2; 1 1 1]); %! assert (max (ep) < 1e-14); interval-2.1.0/inst/vereigvec.m0000644000000000000000000001614613031036767014614 0ustar 00000000000000## Copyright 2007 Jiří Rohn ## Copyright 2016 Oliver Heimlich ## ## This program is derived from vereigvec in VERSOFT, published on ## 2016-07-26, which is distributed under the terms of the Expat license, ## a.k.a. the MIT license. Original Author is Jiří Rohn. Migration to Octave ## code has been performed by Oliver Heimlich. ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypefun {[@var{evc}, @var{lambda}, @var{As}] =} vereigvec (@var{A}, @var{x}) ## Verified real eigenvector of an interval matrix. ## ## For a square interval matrix @var{A} and a @emph{real} vector @var{x}, this ## function verifies @var{x} to be an eigenvector of some matrix in @var{A}, or ## not to be an eigenvector of any matrix in @var{A}, or yields no verified ## result (unfortunately, complex eigenvectors cannot be handled yet): ## ## @table @asis ## @item @var{evc} = 1 ## @var{x} is verified to be an eigenvector of some matrix in @var{A}, ## @var{lambda} is an interval number such that for each ## @var{lambda0} ∈ @var{lambda}, @var{A} is verified to contain a matrix having ## (@var{lamda0}, @var{x}) as an eigenpair, ## @var{As} is a very tight interval matrix verified to contain ## a matrix having (mid (@var{lambda}), @var{x}) as an eigenpair, ## ## @item @var{evc} = 0 ## @var{x} is verified not to be an eigenvector of any matrix in @var{A}, ## @var{lambda} and @var{As} consist of empty intervals, ## ## @item @var{evc} = -1 ## no verified result (data may be wrong). ## @end table ## ## Based on the section “Real eigenvectors” in ## J. Rohn, A handbook of results on interval linear problems, ## posted at @url{http://www.cs.cas.cz/~rohn}. ## ## This work was supported by the Czech Republic National Research ## Program “Information Society”, project 1ET400300415. ## ## @seealso{eig} ## @end deftypefun ## Author: Jiří Rohn ## Keywords: interval ## Created: 2007 function [evc, lambda, As] = vereigvec (A, x) if (nargin ~= 2) print_usage (); return endif x = x(:); p = length(x); [m, n] = size (A); if (m ~= n) error ("vereigvec: matrix is not square"); elseif (n ~= p) error ("vereigvec: sizes do not match"); elseif (~isreal (x) || isequal (x, zeros (p, 1))) error ("vereigvec: wrong data"); endif if (~isa (A, "infsup")) if (~isreal (A)) error ("vereigvec: wrong data"); endif A = infsup (A); # allows for real input endif ## checking the basic inequality [ac, Delta] = rad (A); z = sgn (x); x1 = infsup (x); # x double, x1 intval Tz = infsup (diag (z)); left = Tz * (ac - Tz * Delta * Tz) * x1 * x1' * Tz; # left-hand side of the inequality right = Tz * x1 * x1' * (ac + Tz * Delta * Tz)' * Tz; # right-hand side of the inequality ## inequality verified not to be satisfied if (any ((right.sup < left.inf)(:))) ## verified not to be an eigenvector evc = 0; lambda = infsup (); As = repmat (infsup (), n, n); return endif ## inequality verified to be satisfied if (all (all (left.sup <= right.inf))) # verified to be an eigenvector; Rohn, SIMAX 1993, Thm. 4.1 B = find (x ~= 0); denleft = (Tz * ac * Tz - Delta) * abs (x); denright = (Tz * ac * Tz + Delta) * abs (x); num = abs (x); denleft = denleft(B); denright = denright(B); num = num(B); left = denleft ./ num; # left ratio right = denright ./ num; # right ratio lambdal = max (left.sup); # verified lower bound of lambda lambdau = min (right.inf); # verified upper bound of lambda if (lambdal > lambdau) ## bounds contradict: no verified solution evc = -1; lambda = infsup (); As = repmat (infsup (), n, n); return endif lambda = infsup (lambdal, lambdau); # lambda lambdam = mid (lambda); # midpoint of lambda ## finding a matrix with eigenpair (lambdam, x) A1 = A - lambdam .* eye (n); AAs = versingnull (A1, x); # enclosure of a singular matrix in A1 having x as a null vector if (isempty (AAs(1, 1))) # no enclosure outputted: no verified solution evc = -1; lambda = infsup (); As = repmat (infsup (), n, n); return endif AAs = AAs + lambdam .* eye (n); # back to A if (subset (AAs, A)) # AAs part of A ## (lambdam, x) is an eigenpair of a matrix in As; Rohn, SIMAX 1993, proof of Thm. 4.1 evc = 1; As=AAs; return endif ## AAs not a part of A: no verified result evc = -1; lambda = infsup (); As = repmat (infsup (), n, n); return endif ## no verified result evc = -1; lambda = infsup (); As = repmat (infsup (), n, n); endfunction function As = versingnull (A, x) ## VERSINGNULL Verified singular matrix in A having x as a null vector. ## ## ~isempty (As(1, 1)): As is a tight interval matrix verified to be a part ## of A and to contain a singular matrix having x ## as a null vector ## isempty (As(1, 1)): no result [m, n] = size (A); assert (m == n); z = sgn (x); xi = infsup (x); [Ac, Delta] = rad (A); oeprl = abs (Ac * xi); # Oettli-Prager inequality, left side oeprr = Delta * abs (xi); # Oettli-Prager inequality, right side if (all (oeprl.sup <= oeprr.inf)) # Oettli-Prager inequality satisfied, singularity of A verified y = (Ac * xi) ./ oeprr; y(isempty (y)) = infsup (1, 1); # case of both numerator and denominator being zero As = Ac - (diag (y) * Delta) * diag (z); # construction of singular As ... As = intersect (As, A); # ... in A if (~any (any (isempty (As)))) # intersection nowhere empty return # with output As endif ## with As of [Empty]'s, but still verified singular (this fact not used here) endif As = repmat (infsup (), n, n); endfunction function z = sgn (x) # signum of x for real n = length (x); z = ones (n, 1); z(x < 0) = -1; endfunction %!test %! A = [1 0 0; 0 1 1; 0 0 1]; %! assert (vereigvec (A, [1; 0; 0]), 1); %! assert (vereigvec (A, [0; 1; 0]), 1); %! assert (vereigvec (A, [0; 0; 1]), 0); %!test %! A = magic (3); %! [evc, lambda] = vereigvec (A, [1 1 1]); %! assert (evc, 1); %! assert (lambda == 15); %! assert (vereigvec (A, [1; 0; 0]), 0); %! assert (vereigvec (A, [0; 1; 0]), 0); %! assert (vereigvec (A, [0; 0; 1]), 0); %!test %! A = magic (3) + infsup ("[-5, 5]"); %! [evc, lambda, As] = vereigvec (A, [1 0 0]); %! assert (evc, 1); %! assert (lambda == "[3, 13]"); %! assert (ismember ([8 1 6; 0 2 4; 0 5 -2], As)); %! assert (max (max (wid (As))) < 1e-14); interval-2.1.0/inst/verintlinineqs.m0000644000000000000000000001454413031036767015707 0ustar 00000000000000## Copyright 2007-2008 Jiří Rohn ## Copyright 2016 Oliver Heimlich ## ## This program is derived from verintlinineqs in VERSOFT, published on ## 2016-07-26, which is distributed under the terms of the Expat license, ## a.k.a. the MIT license. Original Author is Jiří Rohn. Migration to Octave ## code has been performed by Oliver Heimlich. ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypefun {[@var{x}, @var{As}] =} verintlinineqs (@var{A}, @var{b}) ## Verified strong solution of interval linear inequalities. ## ## For a rectangular interval matrix @var{A} and a matching interval ## vector @var{b}, this function either computes a strong solution @var{x} to ## @display ## @var{A} * @var{x} @leq{} b ## @end display ## (i. e., a real vector @var{x} verified to satisfy ## @var{Ao} * @var{x} @leq{} @var{bo} for each @var{Ao} in @var{A} and @var{bo} ## in @var{b}), or verifies nonexistence of such a solution, or yields no ## verified result: ## ## @table @asis ## @item ~isnan (@var{x}) ## @var{x} is a verified strong solution of @var{A} * @var{x} @leq{} @var{b}, ## and @var{As} is an interval matrix of empty intervals, ## ## @item ~isempty (@var{As}) ## @var{As} is a very right (“almost thin”) interval matrix verified to contain ## a real matrix @var{Ao} such that the system ## @var{Ao} * @var{x} @leq{} @var{b}.inf has no solution (which proves that no ## strong solution exists), and @var{x} is a vector of NaNs, ## ## @item otherwise ## no verified output. ## @end table ## ## A theoretical result [1] asserts that if each system ## @var{Ao} * @var{x} @leq{} @var{bo}, where @var{Ao} in @var{A} and @var{bo} ## in @var{b}, has a solution (depending generally on @var{Ao} and @var{bo}), ## then there exists a vector @var{x} satisfying ## @var{Ao} * @var{x} @leq{} @var{bo} for @emph{each} @var{Ao} in @var{A} and ## @var{bo} in @var{b}. Such a vector @var{x} is called a strong solution of ## the system @var{A} * @var{x} @leq{} @var{b}. ## ## [1] J. Rohn and J. Kreslova, Linear Interval Inequalities, LAMA 38 (1994), ## 79–82. ## ## Based on Section 2.13 in M. Fiedler, J. Nedoma, J. Ramik, J. Rohn and ## K. Zimmermann, Linear Optimization Problems with Inexact Data, ## Springer-Verlag, New York 2006. ## ## This work was supported by the Czech Republic National Research Program ## “Information Society”, project 1ET400300415. ## ## @seealso{} ## @end deftypefun ## Author: Jiří Rohn ## Keywords: interval ## Created: 2007-02-22 function [x, As] = verintlinineqs (A, b) if (nargin ~= 2) print_usage (); return endif b = vec (b); [m, n] = size (A); x = nan (n, 1); As = repmat (infsup (), m, n); if (m ~= length (b)) error ("verintlinineqs: nonconformant arguments") endif if (not (isa (A, "infsup"))) # allows for real input A = infsup (A); endif if (not (isa (b, "infsup"))) b = infsup (b); endif ## the bounds Al = inf (A); Au = sup (A); bl = inf (b); ## matrix of the system; see Fiedler et al., (2.89) Ao = [Au -Al]; ## finds verified nonnegative solution of Ao*x<=bl [xx, y] = verlinineqnn (Ao, bl); if (not (isnan (xx(1)))) # solution found xxi = infsup (xx); xxi = xxi(1:n) - xxi(n+1:2*n); # interval vector of the original size ## noninterval vectors; candidates for strong solution X = [xx(1:n)-xx(n+1:2*n) xxi.inf xxi.mid xxi.sup]; [Ac, Delta] = rad (A); [bc, delta] = rad (b); for x1 = X left = Ac * infsup (x1) - bc; right = -Delta * infsup (abs(x1)) - delta; if (all (left.sup <= right.inf)) ## Fiedler et al., (2.94); strong solution found x = x1; # verified strong solution return endif endfor ## no result return end if (not (isnan (y(1)))) # Ao*x<=bl verified not to have a nonnegative solution As = vernull(A', y); # Fiedler et al., proof of Thm. 2.23 if (not (isempty (As(1,1)))) As = As'; # Ao*x<=bl unsolvable for some Ao in As which is a part of A return endif ## no result return end ## no result endfunction function As = vernull (A, x) # VERNULL Verified matrix in A having x as a null vector. # # ~isempty(As(1,1)): As is a tight interval matrix verified to be a part of A # and to contain a thin matrix Ao having x as a null vector # (i.e., Ao*x=0), # # isempty(As(1,1)): no result. # [m, n] = size (A); p = length (x); As = repmat (infsup (), m, n); assert (n == p); assert (nargin == 2); assert (isa (A, "infsup")); assert (not (isa (x, "infsup"))); assert (all (not (isnan (x)))); z = sgn (x); xi = infsup (x); [Ac, Delta] = rad (A); oeprl = abs (Ac * xi); % Oettli-Prager inequality, left side oeprr = Delta * abs (xi); % Oettli-Prager inequality, right side if (all (oeprl.sup <= oeprr.inf)) % Oettli-Prager inequality satisfied, x verified null vector of A y = (Ac * xi) ./ oeprr; y(isempty (y)) = 1; % case of both numerator and denominator being zero As = Ac - (diag (y) * Delta) * diag(z); % construction of As ... As = intersect (As, A); % ... in A if (not (any (any (isempty(As))))) % intersection nowhere empty return % with output As else As = repmat (infsup (), m, n); return % with As of [Empty]'s, but x still verified null vector of A endif endif endfunction function z = sgn (x) # signum of x for real n = length (x); z = ones (n, 1); z(x < 0) = -1; endfunction %!test %! A = [-2, -3; -2, -1]; %! b = [-1500; -1000]; %! [x, As] = verintlinineqs (A, b); %! assert (x, [375; 250], 1e-9); %! assert (all (x >= [375; 250])); %! assert (all (all (isempty (As)))); interval-2.1.0/inst/verinvnonneg.m0000644000000000000000000000753513031036767015355 0ustar 00000000000000## Copyright 2008 Jiří Rohn ## Copyright 2016 Oliver Heimlich ## ## This program is derived from verinvnonneg in VERSOFT, published on ## 2016-07-26, which is distributed under the terms of the Expat license, ## a.k.a. the MIT license. Original Author is Jiří Rohn. Migration to Octave ## code has been performed by Oliver Heimlich. ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypefun {[nonneg, As] =} verinvnonneg (@var{A}) ## Verified nonnegative invertibility of an interval matrix. ## ## For a square interval (or real) matrix @var{A}, this function verifies ## inverse nonnegativity of @var{A}, or not-inverse-nonnegativity of @var{A}, ## or yields no verified result: ## ## @table @asis ## @item @var{nonneg} = 1 ## @var{A} verified inverse nonnegative, ## ## @item @var{nonneg} = 0 ## @var{A} verified not to be inverse nonnegative; @var{As} is a matrix in ## @var{A} (always one of the two bounds) which is verified not to be inverse ## nonnegative, ## ## @item @var{nonneg = -1} ## no verified result. ## @end table ## ## Based on the result by Kuttler, Math. of Computation 1971; see also J. Rohn, ## A Handbook of Results on Interval Linear Problems, posted at ## @url{http://www.cs.cas.cz/~rohn}, Section 3.9. ## ## This work was supported by the Czech Republic National Research ## Program “Information Society”, project 1ET400300415. ## ## @seealso{inv} ## @end deftypefun ## Author: Jiří Rohn ## Keywords: interval ## Created: 2008 function [nonneg, As] = verinvnonneg (A) if (nargin ~= 1) print_usage (); return endif [m, n] = size (A); nonneg = -1; As = repmat (infsup, m, n); if (m ~= n) error ("verinvnonneg: matrix not square"); endif if (~isa (A, "infsup")) A = infsup (A); # allows for real input endif if (any (isempty (A)(:))) # matrix is empty interval: no inverse nonneg = 0; return endif Al = infsup (inf (A), max (-realmax, inf (A))); Bl = inv (Al); if (all (all (issingleton (A)))) Au = Al; Bu = Bl; else Au = infsup (min (realmax, sup (A)), sup (A)); Bu = inv (Au); endif if (any ((isempty (Bl) | isempty (Bu))(:))) # empty inverse: no inverse exists nonneg = 0; return endif if (all (all (Bl.inf >= 0)) && all (all (Bu.inf >= 0))) # verified inverse nonnegative; Kuttler, Math. of Comp. 1971 nonneg = 1; return endif if (any ((Bl.sup < 0)(:))) nonneg = 0; As=Al; # A.inf verified not inverse nonnegative return endif if (any ((Bu.sup < 0)(:))) nonneg = 0; As = Au; # A.sup verified not inverse nonnegative return end endfunction %!assert (verinvnonneg (eye (1)), 1) %!assert (verinvnonneg (eye (2)), 1) %!assert (verinvnonneg (eye (3)), 1) %!assert (verinvnonneg (eye (4)), 1) %!assert (verinvnonneg (eye (5)), 1) %!assert (verinvnonneg (eye (6)), 1) %!assert (verinvnonneg (eye (7)), 1) %!assert (verinvnonneg (eye (8)), 1) %!assert (verinvnonneg (zeros (1)), 0) %!assert (verinvnonneg (zeros (2)), 0) %!assert (verinvnonneg (zeros (3)), 0) %!assert (verinvnonneg (zeros (4)), 0) %!assert (verinvnonneg (zeros (5)), 0) %!assert (verinvnonneg (zeros (6)), 0) %!assert (verinvnonneg (zeros (7)), 0) %!assert (verinvnonneg (zeros (8)), 0) %!assert (verinvnonneg (magic (7)), 0) %!assert (verinvnonneg (infsup (-inf, inf)), -1) interval-2.1.0/inst/verlinineqnn.m0000644000000000000000000001153413031036767015341 0ustar 00000000000000## Copyright 2008 Jiří Rohn ## Copyright 2016 Oliver Heimlich ## ## This program is derived from verlinineqnn in VERSOFT, published on ## 2016-07-26, which is distributed under the terms of the Expat license, ## a.k.a. the MIT license. Original Author is Jiří Rohn. Migration to Octave ## code has been performed by Oliver Heimlich. ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypefun {[@var{x}, @var{y}] =} verlinineqnn (@var{A}, @var{b}) ## Verified nonnegative solution of a system of linear inequalities. ## ## For a rectangular real matrix @var{A} and a matching real vector @var{b}, ## this function either computes a verified solution of the system of linear ## inequalities ## @display ## @var{A} * @var{x} @leq{} b, @* ## @var{x} @geq{} 0, ## @end display ## or verifies nonexistence of a solution, or yields no verified result. ## ## Possible outputs: ## @itemize @bullet ## @item ## Either @var{x} is a real vector verified to satisfy both inequalities and ## @var{y} is a vector of NaN's, ## ## @item ## or @var{y} is a real vector verified to satisfy ## @display ## @var{A}' * @var{y} @geq{} 0, @* ## @var{y} @geq{} 0, @* ## @var{b}' * @var{y} @leq{} -1 ## @end display ## (which by Farka's lemma implies nonexistence of a solution to the original ## inequalities), and @var{x} is a vector of NaN's, ## ## @item ## or both @var{x} and @var{y} are NaN's. In this case no verified result could ## be found. ## @end itemize ## ## This work was supported by the Czech Republic National Research Program ## “Information Society”, project 1ET400300415. ## ## @seealso{linprog} ## @end deftypefun ## Author: Jiří Rohn ## Keywords: interval ## Created: 2008-01-05 function [x, y] = verlinineqnn (A, b) if (nargin ~= 2) print_usage (); return endif b = b(:); [m, n] = size (A); if (m ~= length(b) || ~isreal (A) || ~isreal (b)) error ("verlinineqnn: Parameters must be real and of matching size"); endif if (~issparse (A)) A = sparse (A); endif x = verlinineqnninner (A, b); if (~isnan (x(1)) || nargout < 2) y = nan (m, 1); return endif Ao = [-A'; -speye(m, m); b']; bo = [zeros(1, n + m), -1]'; y = verlinineqnninner (Ao, bo); endfunction function x = verlinineqnninner (A, b) ## inner subroutine of verlinineqnn ## finds a verified solution to A*x<=b, x>=0, or yields a vector of NaN's ## additive and multiplicative perturbation used [m, n] = size (A); ep = max (1e-10, max ([m n 100]) * max ([norm(A, inf) norm(b, inf)]) * eps); e = ones (n, 1); Ao = [A; -speye(n, n)]; bo = [b' zeros(n, 1)']'; # Ao*x<=bo is equivalent to A*x<=b, x>=0 # additive perturbation bo = bo - ep .* ones (m + n, 1); x = lpprocedure (e, Ao, bo); # solves min e'*x subject to Ao*x<=bo left = A * infsup (x); # interval quantity if (all (left.sup <= b) && all (x >= 0)) # verified solution return endif # multiplicative perturbation bo = bo - ep .* abs (bo) - ep .* (bo == 0); x = lpprocedure (e, Ao, bo); # solves min e'*x subject to Ao*x<=bo left = A * infsup (x); # interval quantity if (all (left.sup <= b) && all (x >= 0)) # verified solution return endif # no verified solution x = nan (n, 1); endfunction function x = lpprocedure (c, A, b) ## solves linear programming problem min c'*x subject to A*x<=b ## x should be always assigned (unverified optimal solution, or something else; ## the result is checked afterwards) ## placed separately so that a different linear programming procedure might ## also be used persistent GLP_MSG_OFF = 0; [m, n] = size (A); x = glpk (c, A, b, ... [], [], ... # 0 <= x <= inf repmat ("U", 1, m), ... # inequality constraint with an upper bound b repmat ("C", 1, n), ... # continuous variable x 1, ... # minimization struct ("msglev", GLP_MSG_OFF)); endfunction %!test %! A = [-2, -3; -2, -1]; %! b = [-1500; -1000]; %! [x, y] = verlinineqnn (A, b); %! assert (x, [375; 250], 1e-9); %! assert (all (x >= [375; 250])); %! assert (isnan (y)); %!test %! A = [1, 2; 3, 4]; %! b = [-1; 0]; %! [x, y] = verlinineqnn (A, b); %! assert (y, [1; 0], 1e-9); %! assert (all (y >= [1; 0])); %! assert (isnan (x)); %!test %! A = [1, 2; 3, 4]; %! b = [1; 1]; %! [x, y] = verlinineqnn (A, b); %! assert (x, [0; 0]); %! assert (isnan (y)); interval-2.1.0/inst/verlinprog.m0000644000000000000000000002116513031036767015021 0ustar 00000000000000## Copyright 2007 Jiří Rohn ## Copyright 2016 Oliver Heimlich ## ## This program is derived from verlinprog in VERSOFT, published on ## 2016-07-26, which is distributed under the terms of the Expat license, ## a.k.a. the MIT license. Original Author is Jiří Rohn. Migration to Octave ## code has been performed by Oliver Heimlich. ## ## 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 . ## -*- texinfo -*- ## @documentencoding UTF-8 ## @deftypefun {[@var{flag}, @var{x}, @var{y}, @var{h}] =} verlinprog (@var{A}, @var{b}, @var{c}) ## Verified linear programming. ## ## For a real matrix @var{A} (full or sparse) and matching real vectors ## @var{b}, @var{c}, this function either computes verified optimal solution ## @var{x}, verified dual optimal solution @var{y} and verified optimal value ## @var{h} of the linear programming problem ## @display ## min @var{c}' * @var{x} subject to @var{A} * @var{x} = @var{b}, x @geq{} 0, ## @end display ## or verifies (in)feasibility, or verifies unboundedness, or yields no ## verified result. The respective outcome is always described verbally in the ## variable @var{flag}. ## ## Possible values of @var{flag}: ## @table @option ## @item verified optimum ## @var{x} is verified to enclose a primal optimal solution, ## @var{y} is verified to enclose a dual optimal solution, ## @var{h} is verified to enclose the optimal value, ## ## @item verified unbounded ## @var{x} is verified to enclose a primal feasible solution @var{xo}, and ## @var{y} is verified to enclose a vector @var{yo} such that the objective ## tends to -Inf along the feasible half-line ## @{@var{xo} + @var{t} * @var{yo} | @var{t} @geq{} 0@}, ## @var{h} is empty, ## ## @item verified feasible ## @var{x} is verified to enclose a primal feasible solution ## (neither optimality nor unboundedness could be verified), ## @var{y}, @var{h} are empty, ## ## @item verified infeasible ## @var{y} is verified to enclose a Farkas vector @var{yo} satisfying ## @var{A}' * @var{yo} @geq{} 0, @var{b}' * @var{yo} < 0 ## (whose existence proves primal infeasibility), ## @var{x}, @var{h} are empty, ## ## @item no verified result ## @var{x}, @var{y}, and @var{h} are empty (no verified result could be found). ## @end table ## ## Complexity: The algorithm solves at most four linear programming problems ## (independently of the size of the original problem) and uses a verification ## procedure which runs approximately in O(@var{m}³) time, where ## @var{m} = rows (@var{A}). ## ## This work was supported by the Czech Republic National Research ## Program “Information Society”, project 1ET400300415. ## @seealso{linprog} ## @end deftypefun ## Author: Jiří Rohn ## Keywords: interval ## Created: 2007 function [flag, x, y, h] = verlinprog (A, b, c) if (nargin ~= 3) print_usage (); return endif b = b(:); c = c(:); [m, n] = size(A); p = length (b); q = length (c); flag = "no verified result"; x = repmat (infsup, n, 1); y = repmat (infsup, m, 1); h = infsup; if (~(m == p && n == q) || (m > n)) error ("verlinprog: sizes do not match"); endif if (~isreal (A) || ~isreal (b) || ~isreal (c)) error("verlinprog: data not real"); endif if issparse (b) b = full (b); end if issparse (c) c = full (c); end # verifying infeasibility yi = verinfeas (A, b); if (~isempty(yi(1))) # verified Farkas vector found y = yi; flag = "verified infeasible"; return endif # verifying feasibility xf = veropt (A, b, ones (n, 1)); if (isempty (xf(1))) # verified feasible solution not found flag = "no verified result"; return endif # verifying unboundedness yu = verunbound (A, c); if (~isempty (yu(1))) # verified descent direction found x = xf; y = yu; flag = "verified unbounded"; return endif # verifying optimality [xo, B, N] = veropt (A, b, c); if (isempty (xo(1))) % verified feasible primal solution with basis B not found x = xf; # previous feasible solution outputted flag = "verified feasible"; return endif AB = A(:, B); if (issparse (AB)) AB = full (AB); # only the square submatrix taken full endif yB = mldivide (infsup (AB'), infsup (c(B))); if (isempty (yB(1))) # verified feasible dual solution not found x = xo; # candidate for optimum outputted as feasible solution flag = "verified feasible"; return endif c = infsup (c); A = infsup (A); crit = c' - yB' * A; # criterial row (dual feasibility) crit = crit(N); # nonbasic part of it if (~all (crit.inf >= 0)) # verified feasible dual solution not found x = xo; % candidate for optimum outputted as feasible solution flag = "verified feasible"; return endif # verified quantities # verified primal and dual feasible solutions found x = xo; # x is a verified primal optimal solution y = yB; # y is a verified dual optimal solution if (nargout >= 3) h1 = c' * x; h2 = b' * y; h = intersect (h1, h2); # h is a verified optimal value (duality theorem) if (isempty (h)) h = h1; end endif flag = "verified optimum"; endfunction function [x, B, N] = veropt (A, b, c) ## B is the "basis index set" of an optimal solution of the LP problem ## min c'*x subject to A*x=b, x>=0, ## x is a verified basic feasible solution with this basis ## N is the set of nonbasic indices persistent GLP_MSG_OFF = 0; [m, n] = size (A); x = repmat(infsup, n, 1); B = nan (m, 1); N = nan (n, 1); [xopt, ~, exitflag] = glpk (c, A, b, ... [], [], ... # 0 <= x <= inf repmat ("S", 1, m), ... # equality constraints Ax = b repmat ("C", 1, n), ... # continuous variable x 1, ... # minimization struct ("msglev", GLP_MSG_OFF)); if (exitflag ~= 0) return endif [xx, J] = sort (xopt); B = J(n - m + 1 : n); # B is set of "basic" indices, N = J(1 : n - m); # N of "nonbasic" ones AB = A(:, B); if (issparse (AB)) AB = full (AB); # only the square submatrix taken full (because of mldivide) endif xB = mldivide (infsup (AB), infsup (b)); if (isempty (xB(1)) || ~all (xB.inf >= 0)) # verified "optimal" solution not found return endif # verified "optimal" solution found x = infsup (zeros (n, 1)); x(B) = xB; endfunction function y = verinfeas (A, b) # y verified to enclose a Farkas vector yo (i.e., satisfying A'*yo>=0, b'*yo<0) # its existence implies infeasibility of A*x=b [m, n] = size (A); y = repmat(infsup, m, 1); ep = max (1e-08, max ([m n 100]) * max ([norm(A, inf) norm(b, inf)]) * eps); Afv = [A' -A' -eye(n) zeros(n,1); # Afv is (n+1)x(2*m+n+1) b' -b' zeros(1,n) 1]; bfv = [zeros(n, 1)' -1]'; # bfv is (n+1)x1 # perturbation to compensate roundoff errors (so that A'*y>=0) bfv = bfv + ep * [ones(1, n) -1]'; yf = veropt (Afv, bfv, ones (2 * m + n + 1, 1)); % system: A'*y>=0, b'*y<=-1, y written as y=y1-y2 if (~isempty (yf(1))) yf = mid (yf); y1 = yf(1 : m); y2 = yf(m + 1 : 2 * m); yf = y1 - y2; # would-be Farkas vector A = infsup (A); b = infsup (b); yf = infsup (yf); # (i.e., should satisfy A'*y>=0, b'*y<0) alpha = A' * yf; beta = b' * yf; if (all (alpha.inf >= 0)) && (beta.sup < 0) # infeasibility verified y=yf; # Farkas vector outputted endif endif endfunction function y = verunbound (A, c) # y verified to enclose a vector yo satisfying A*yo=0, yo>=0, c'*yo<=-1 # under feasibility its existence implies unboundedness [m, n] = size (A); y = repmat (infsup, n, 1); Aunb = [A zeros(m, 1); # Aunb is (m+1)x(n+1) c' 1]; bunb = [zeros(1, m) -1]'; # bunb is (m+1)x1 yunb = veropt (Aunb, bunb, ones (n + 1, 1)); # yunb is (n+1)x1 if (~isempty (yunb(1))) # y satisfies A*y=0, y>=0, c'*y=-1 y = yunb(1:n); return endif endfunction %!test %! A = [-2, -3; -2, -1]; %! b = [-1500, -1000]; %! c = [1; 1]; %! [flag, x, y, h] = verlinprog (A, b, c); %! assert (flag, "verified optimum"); %! assert (ismember ([375; 250], x)); %! assert (wid (x) < 1e-12); %! assert (ismember ([-0.25; -0.25], y)); %! assert (wid (y) < 1e-16); %! assert (ismember (625, h)); %! assert (wid (h) < 1e-12); interval-2.1.0/octave-interval.metainfo.xml0000644000000000000000000000760113031036767017124 0ustar 00000000000000 octave-interval www.octave.org-octave.desktop Interval Real-valued interval arithmetic Reellwertige Intervallarithmetik Arithmétique d'intervalles à valeurs réelles

The interval package for real-valued interval arithmetic allows one to evaluate functions over subsets of their domain. All results are verified, because interval computations automatically keep track of any errors.

These concepts can be used to handle uncertainties, estimate arithmetic errors and produce reliable results. Also it can be applied to computer-assisted proofs, constraint programming, and verified computing.

The implementation is based on interval boundaries represented by binary64 numbers and is conforming to IEEE Std 1788-2015, IEEE standard for interval arithmetic.

Das Intervall-Paket für rellwertige Intervallarithmetik kann Funktionen über Teilmengen ihres Definitionsbereichs auszuwerten. Alle Ergebnisse werden durch Rechnung mit Intervallschranken nachgewiesen, wobei sämtliche Fehler automatisch mitgeführt werden.

Mit diesen Konzepten lassen sich ungewisse Messwerte behandeln, arithmetische Fehler abschätzen und zuverlässige Ergebnisse erzeugen. Es kann auch für rechnergestützte Beweise, Constraintprogrammierung oder verifiziertes Rechnen angewandt werden.

Die Intervallschranken werden im Zahlenformat binary64 geführt und die Umsetzung ist standardkonform zu IEEE Std 1788-2015, dem IEEE-Standard für Intervallarithmetik.

Le paquet arithmétique d'intervalles à valeurs réelles permet d'évaluer des fonctions sur des sous-ensembles de leurs domaines. Tous les résultats sont garantis car les calculs par intervalles permettent un suivi automatique des erreurs.

Ces concepts peuvent être utilisés pour prendre en compte les incertitudes, estimer les erreurs arithmétiques, et générer des résultats fiables. Ils peuvent également être appliqués à des preuves assistées par ordinateur, à la programmation par contraintes et à des calculs garantis.

Cette implantation est basée sur des bornes d'intervalles sous forme de nombres réels 64 bits et se conforme au standard IEEE 1788-2015, standard IEEE pour l'arithmétique d'intervalles.

 interval arithmetic interval analysis interval computation parameter estimation rounding error measurement error numerical error scientific computing result verification verified result set arithmetic finite precision range interval tolerance uncertainty preimage constraint enclosure bisection http://octave.sourceforge.net/interval/ https://savannah.gnu.org/bugs/?group=octave FSFAP GPL-3.0+ Octave-Forge Community octave-maintainers@gnu.org interval-2.1.0/src/Makefile0000644000000000000000000000434613031036767013730 0ustar 00000000000000## This is part of the GNU Octave Interval Package. ## Copyright 2015-2016 Oliver Heimlich ## Copyright 2016 Mike Miller ## See the file COPYING for copying conditions. SHELL = /bin/sh OBJ = crlibm_function.oct \ mpfr_function_d.oct \ mpfr_linspace_d.oct \ mpfr_matrix_mul_d.oct \ mpfr_matrix_sqr_d.oct \ mpfr_to_string_d.oct \ mpfr_vector_sum_d.oct \ mpfr_vector_dot_d.oct \ __setround__.oct LDFLAGS_MPFR =-lmpfr ## Use important flags in XTRA_CFLAGS for OpenMP (workaround for bug #45280) CFLAG_OPENMP =$(findstring -fopenmp,$(shell $(MKOCTFILE) -p XTRA_CFLAGS)) all: $(OBJ) ## crlibm api oct-file crlibm_function.oct: crlibm_function.o crlibm/crlibm_private.o $(MKOCTFILE) -o $@ $< crlibm/*.o crlibm/scs_lib/*.o crlibm_function.o: crlibm_function.cc $(MKOCTFILE) --compile -o $@ $< ## bundled crlibm library ## ## Note to redistributors: ## If you can't compile this library for a particular platform ## or `__check_crlibm__` throws a warning in Octave, you can safely ## omit the crlibm library from a redistributed binary package, ## (you must keep __check_crlibm__.m). ## However, please inform the package maintainer of the error. crlibm/crlibm_private.o: crlibm/crlibm_config.h $(MAKE) -C crlibm CFLAGS+="$(shell $(MKOCTFILE) -p CPICFLAG) -Wno-div-by-zero -Wno-unused-variable -Wno-unused-but-set-variable" crlibm/crlibm_config.h: (cd crlibm && ./configure --disable-dependency-tracking --enable-sse2) ## GNU MPFR api oct-files mpfr_matrix_mul_d.oct mpfr_matrix_sqr_d.oct : mpfr_%.oct: mpfr_%.cc mpfr_commons.cc $(MKOCTFILE) -o $@ $(LDFLAGS_MPFR) $(CFLAG_OPENMP) $< mpfr_%.oct: mpfr_%.cc mpfr_commons.cc $(MKOCTFILE) -o $@ $(LDFLAGS_MPFR) $< ## api oct-file ## ## Note to redistributors: ## If you can't compile this function for a particular platform ## or `test @infsup/mtimes` throws a warning in Octave, you can safely ## omit the __setround__ function from a redistributed binary package. ## However, please inform the package maintainer of the error. __setround__.oct: __setround__.cc $(MKOCTFILE) -o $@ $< clean: $(MAKE) -C crlibm $@ $(RM) *.oct *.o .PHONY: all clean interval-2.1.0/src/__setround__.cc0000644000000000000000000000516313031036767015234 0ustar 00000000000000/* Copyright 2015 Kai T. Ohlhus (Original version for C++11) Copyright 2015-2016 Oliver Heimlich (Compatibility with C99 and different parameter semantics for compatibility with the Octave fenv package) 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 . */ #include #include #pragma STDC FENV_ACCESS ON DEFUN_DLD (__setround__, args, nargout, "-*- texinfo -*-\n" "@defun __setround__ (@var{rnd})\n" "\n" "Changes the floating-point rounding direction for the current thread and " "any new threads which will be spawned from the current thread.\n" "\n" "@table @option\n" "@item @var{rnd} = -inf\n" "switch rounding downwards (towards -inf)\n" "@item @var{rnd} = 0.5\n" "switch rounding to nearest (default rounding mode)\n" "@item @var{rnd} = +inf\n" "switch rounding upwards (towards +inf)\n" "@end table\n" "@end defun" ) { const int nargin = args.length (); if (nargin != 1) { print_usage (); return octave_value_list (); } const double rnd = args(0).scalar_value (); int mode = 0; if (rnd == -INFINITY) mode = FE_DOWNWARD; else if (rnd == +INFINITY) mode = FE_UPWARD; else if (rnd == 0.5) mode = FE_TONEAREST; else // No other rounding modes might be supported // (depends on the C implementation) error ("__setround__: Unsupported rounding mode, please use -inf, +inf " "or 0.5"); if (error_state) return octave_value_list (); if (fesetround (mode) != 0) error ("__setround__: Unable to change rounding mode"); return octave_value_list (); } /* %!test %! __setround__ (+inf); %! assert (1 + realmin > 1, true); %! assert (1 - realmin == 1, true); %! __setround__ (0.5); %!test %! __setround__ (-inf); %! assert (1 + realmin == 1, true); %! assert (1 - realmin < 1, true); %! __setround__ (0.5); %!test %! __setround__ (0.5); %! assert (1 + realmin == 1, true); %! assert (1 - realmin == 1, true); %!shared %! __setround__ (0.5); */ interval-2.1.0/src/crlibm/AUTHORS0000644000000000000000000000017113031036767014600 0ustar 00000000000000David Defour, Catherine Daramy, Florent de Dinechin, Matthieu Gallet, Nicolas Gast, Christoph Lauter, Jean-Michel Muller interval-2.1.0/src/crlibm/CMakeLists.txt0000644000000000000000000001056213031036767016275 0ustar 00000000000000PROJECT(CRLIBM C) MESSAGE("Trying to build crlibm on a " ${CMAKE_SYSTEM_PROCESSOR} " under " ${CMAKE_SYSTEM_NAME} ", compiler is "${CMAKE_C_COMPILER}) ADD_LIBRARY(crlibm SHARED crlibm.h crlibm_private.h crlibm_private.c triple-double.h exp-td.h exp-td.c exp-td-standalone.c expm1-standalone.c exp_accurate.h exp_accurate.c expm1.h expm1.c log-td.c log-td.h log1p.c log10-td.h log10-td.c log2-td.h log2-td.c rem_pio2_accurate.h rem_pio2_accurate.c trigo_fast.c trigo_fast.h trigo_accurate.c trigo_accurate.h asin-td.h asin-td.c acos-td.h acos-td.c atan_fast.c atan_fast.h atan_accurate.h atan_accurate.c csh_fast.h csh_fast.c scs_lib/scs_private.c scs_lib/addition_scs.c scs_lib/division_scs.c scs_lib/print_scs.c scs_lib/double2scs.c scs_lib/zero_scs.c scs_lib/multiplication_scs.c scs_lib/scs2double.c scs_lib/tests/tbx_timing.h ) ADD_DEFINITIONS(-DSCS_NB_WORDS=8 -DSCS_NB_BITS=30) ADD_SUBDIRECTORY(tests) ENABLE_TESTING() ADD_TEST(exp tests/blind_test tests/exp.testdata) ADD_TEST(log tests/blind_test tests/log.testdata) ADD_TEST(sin tests/blind_test tests/sin.testdata) ADD_TEST(cos tests/blind_test tests/cos.testdata) ADD_TEST(tan tests/blind_test tests/tan.testdata) ADD_TEST(atan tests/blind_test tests/atan.testdata) ADD_TEST(sinh tests/blind_test tests/sinh.testdata) ADD_TEST(cosh tests/blind_test tests/cosh.testdata) # Define all the variables that were defined by the configure scripts # We define them by -D flags, not by config.h # First check the host processor IF(CMAKE_SYSTEM_PROCESSOR MATCHES i*86|k6|k7|pentium*|athlon*) ADD_DEFINITIONS(-DCRLIBM_TYPECPU_X86) ENDIF(CMAKE_SYSTEM_PROCESSOR MATCHES i*86|k6|k7|pentium*|athlon*) IF(CMAKE_SYSTEM_PROCESSOR MATCHES alpha) ADD_DEFINITIONS(-DCRLIBM_TYPECPU_ALPHA) ENDIF(CMAKE_SYSTEM_PROCESSOR MATCHES alpha) IF(CMAKE_SYSTEM_PROCESSOR MATCHES powerpc*) ADD_DEFINITIONS(-DCRLIBM_TYPECPU_POWERPC) ENDIF(CMAKE_SYSTEM_PROCESSOR MATCHES powerpc*) IF(CMAKE_SYSTEM_PROCESSOR MATCHES sparc) ADD_DEFINITIONS(-DCRLIBM_TYPECPU_SPARC) ENDIF(CMAKE_SYSTEM_PROCESSOR MATCHES sparc) IF(CMAKE_SYSTEM_PROCESSOR MATCHES x86_64|amd64) ADD_DEFINITIONS(-DCRLIBM_TYPECPU_AMD64) ENDIF(CMAKE_SYSTEM_PROCESSOR MATCHES x86_64|amd64) IF(CMAKE_SYSTEM_PROCESSOR MATCHES ia64) ADD_DEFINITIONS(-DCRLIBM_TYPECPU_ITANIUM) ENDIF(CMAKE_SYSTEM_PROCESSOR MATCHES ia64) FIND_PATH(INTTYPES_H inttypes.h /usr/include/ /usr/local/include/ DOC "C99 file that defines int32_t, int64_t, etc" ) IF(INTTYPES_H) ADD_DEFINITIONS(-DHAVE_INTTYPES_H) ENDIF(INTTYPES_H) # Now look for libraries # MPFR FIND_PATH(MPFR_H mpfr.h /usr/include/ /usr/local/include/ DOC "Path of mpfr.h, the include file for GNU MPFR library, useful only for testing and developing crlibm" ) FIND_LIBRARY(MPFR_LIB NAMES mpfr PATH /usr/lib/ /usr/local/lib/ DOC "Directory of the GNU MPFR library, useful for testing and developing crlibm") # for compatibility with configure IF(MPFR_H AND MPFR_LIB) ADD_DEFINITIONS(-DHAVE_MPFR_H) INCLUDE_DIRECTORIES(${MPFR_H}) # add include files LINK_DIRECTORIES(${MPFR_LIB}) # add link dir and link flag SET(LIBMPFR mpfr) SET(LIBGMP gmp) # variables used in tests/CMakeList.txt ENDIF(MPFR_H AND MPFR_LIB) # IBM's Libultim FIND_PATH(IBM_H MathLib.h /usr/include/ /usr/local/include/ DOC "Path of Mathlib.h, the include file for IBM's libultim, for comparison purpose" ) FIND_LIBRARY(IBM_LIB NAMES ultim PATH /usr/lib/ /usr/local/lib/ DOC "Directory of IBM's libultim, for comparison purpose") # for compatibility with configure IF(IBM_H AND IBM_LIB) ADD_DEFINITIONS(-DHAVE_MATHLIB_H) INCLUDE_DIRECTORIES(${IBM_H}) # add include files LINK_DIRECTORIES(${IBM_LIB}) # add link dir and link flag SET(LIBIBM ultim) ENDIF(IBM_H AND IBM_LIB) # Sun's libmcr FIND_PATH(MCR_H mcr.h /usr/include/ /usr/local/include/ DOC "Path of mcr.h, the include file for Sun's libmcr, for comparison purpose" ) FIND_LIBRARY(MCR_LIB NAMES mcr PATH /usr/lib/ /usr/local/lib/ DOC "Directory of Sun's libmcr, for comparison purpose") # for compatibility with configure IF(MCR_H AND MCR_LIB) ADD_DEFINITIONS(-DHAVE_MCR_H) INCLUDE_DIRECTORIES(${MCR_H}) # add include files LINK_DIRECTORIES(${MCR_LIB}) # add link dir and link flag SET(LIBMCR mcr) ENDIF(MCR_H AND MCR_LIB) interval-2.1.0/src/crlibm/COPYING0000644000000000000000000004312713031036767014573 0ustar 00000000000000 GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 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) 19yy 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 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) 19yy 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. interval-2.1.0/src/crlibm/COPYING.LIB0000644000000000000000000006346513031036767015207 0ustar 00000000000000 GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, 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 and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, 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 library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete 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 distribute a copy of this License along with the Library. 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 Library or any portion of it, thus forming a work based on the Library, 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) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, 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 Library, 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 Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you 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. If distribution of 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 satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be 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. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library 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. 9. 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 Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library 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 with this License. 11. 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 Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library 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 Library. 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. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library 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. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library 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 Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, 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 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. 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 LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), 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 Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. 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 library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! interval-2.1.0/src/crlibm/ChangeLog0000644000000000000000000001065213031036767015307 0ustar 00000000000000Summary of changes between version 1.0beta1 and version 0.18beta1 ========================================================== Large performance improvement in asin and acos, now in asincos.c Added asinpi and acospi Summary of changes between version 0.18beta1 and version 0.17beta1 ========================================================== Added atanpi Summary of changes between version 0.17beta1 and version 0.14beta1 ========================================================== Added sinpi, cospi, tanpi Added power, currently unproven Summary of changes between version 0.14beta1 and version 0.13beta1 ========================================================== Added log1p Added tests/computemd5list.sh Documentation updates, added more worst cases Interval functions for exp and log (in the CVS, not yet in the release) Summary of changes between version 0.13beta1 (never released) and version 0.11beta1 ========================================================== Added expm1, acos Corrected small possible bug in asin Summary of changes between version 0.11beta1 and version 0.10beta ========================================================== Added asin More Gappa Correction of a serious bug (found by Paul Zimmermann) in the computation of rounding constants. (Fortunately the bug was in the proof, the code was OK) More Gappa proofs Summary of changes between version 0.10beta and version 0.8 ========================================================== Added log2 and log10 using triple double (log2-td.*, log10-td.*) Triple-double versions of exp and log (exp-td.*, log-td.*) log-de, using double-extended, much faster on IA32 and IA64 Cleaning up, autotoolization of the new functions Proofs using the Gappa tool Summary of changes between version 0.8 and version 0.8beta4 ========================================================== Cleaning up and fixes to improve portability Finished proofs of trigonometric functions Some cleaning up and documentation improvement Fixed bug for large arguments to sinh and cosh Added crlibm.spec (to build RPMs) Summary of changes between version 0.8beta4 and version 0.8beta3 ========================================================== Added crlibm_generate_test_vectors Added test vectors to all functions, including some of Lefevre/Muller worst cases Cleant up the accurate trig functions, now in trigo.c Cleant up cosh and sinh Added Gappa input file to assist the proof of the trig functions Added AMD64 architecture to autoconf stuff Improved timings on x86 Summary of changes between version 0.8beta3 and version 0.8beta2 ========================================================== Added crlibm_blindtest and automatic testsuite Consequently corrected quite a few bugs in extreme cases Cleant up cosh and sinh Summary of changes between version 0.8beta2 and version 0.8beta ========================================================== Rewritten faster trigonometric functions Added crlibm_blindtest and automatic testsuite Added crlibm_exit() crlibm_init() now returns the old processor status flag Proof for the trigonometric functions in progress Added crlibm.spec file to build rpms to the CVS Summary of changes between version 0.8beta and version 0.2: ========================================================== Added functions : sin cos tan Added function atan Added function atan specialized for pentium (atan-pentium.c) Added functions sinh cosh Changed Maple files from .mw and .mws to .mpl Added FMA support in crlibm_private.h Added polish to some of the proofs Improved performance tests for tighter timing, Fairer speed comparison to mpfr: We now compare to mpfr with 53-bit mantissa, although this doesnot provide correct rounding if the result is a denormal (double rounding). Previously we compared to 150-bit mpfr. Version 0.2 : exp and log interval-2.1.0/src/crlibm/Makefile.am0000644000000000000000000001205713031036767015572 0ustar 00000000000000## Process this file with automake to produce Makefile.in lib_LIBRARIES = libcrlibm.a # shared libraries need libtool. We'll do it later. #lib_LTLIBRARIES = libcrlibm.la # Note that at the moment, asking for intervals disables double-extended if USE_HARDWARE_DE libcrlibm_a_SOURCES = \ crlibm.h crlibm_private.h crlibm_private.c double-extended.h\ triple-double.h triple-double.c\ exp-td.h exp-td.c exp-td-standalone.c expm1-standalone.c \ expm1.h expm1.c \ log-de.c log-de.h \ log1p.c \ log10-td.h log10-td.c \ log2-td.h log2-td.c \ rem_pio2_accurate.h rem_pio2_accurate.c \ trigo_fast.c trigo_fast.h trigo_accurate.c trigo_accurate.h \ trigpi.c trigpi.h \ asincos.h asincos.c \ pow.h pow.c\ atan_fast.c atan_fast.h atan_accurate.h atan_accurate.c \ csh_fast.h csh_fast.c else libcrlibm_a_SOURCES = \ crlibm.h crlibm_private.h crlibm_private.c \ triple-double.h triple-double.c\ exp-td.h exp-td.c exp-td-standalone.c expm1-standalone.c \ expm1.h expm1.c \ log.c log.h \ log1p.c \ rem_pio2_accurate.h rem_pio2_accurate.c \ trigo_fast.c trigo_fast.h trigo_accurate.c trigo_accurate.h \ trigpi.c trigpi.h \ asincos.h asincos.c \ pow.h pow.c\ atan_fast.c atan_fast.h atan_accurate.h atan_accurate.c \ csh_fast.h csh_fast.c endif # add all the scs_lib useful functions libcrlibm_a_LIBADD = scs_lib/scs_private.o scs_lib/addition_scs.o \ scs_lib/division_scs.o scs_lib/print_scs.o\ scs_lib/double2scs.o scs_lib/zero_scs.o\ scs_lib/multiplication_scs.o scs_lib/scs2double.o include_HEADERS = crlibm.h SUBDIRS = scs_lib . # Add your compiler here. Default is assumed to be gcc. if COMPILER_ICC # mp means maintain precision. Should be useless with std=c99, this is an ICC bug AM_CFLAGS = -std=c99 -mp -Qoption,cpp,--extended_float_types -IPF_fp_speculationsafe else # default assumed to be gcc if USE_SSE2 AM_CFLAGS = -std=c99 -Wall -msse2 -mfpmath=sse else AM_CFLAGS = -std=c99 -Wall -O3 endif endif tripledoubleprocedures.pdf: docs/latex/tripledoubleprocedures.tex cd docs/latex; \ pdflatex tripledoubleprocedures; bibtex tripledoubleprocedures; \ pdflatex tripledoubleprocedures; pdflatex tripledoubleprocedures;\ mv tripledoubleprocedures.pdf .. crlibm.pdf: docs/latex/crlibm.tex cd docs/latex; pdflatex crlibm; bibtex crlibm; pdflatex crlibm; pdflatex crlibm;\ mv crlibm.pdf .. doc: crlibm.pdf tripledoubleprocedures.pdf EXTRA_DIST = VERSION TODO\ maple/common-procedures.mpl \ maple/double-extended.mpl maple/triple-double.mpl\ maple/exp-td.mpl maple/csh.mpl \ maple/log-td.mpl maple/log-de.mpl \ maple/log2-td.mpl maple/log10-td.mpl \ maple/trigo.mpl maple/atan.mpl maple/atan-pentium.mpl \ maple/asin-td.mpl maple/acos-td.mpl \ maple/sqrt.mpl \ maple/expm1.mpl \ maple/gal.mpl \ maple/pow.mpl \ maple/atan-itanium.mpl \ gappa/trigos/SinCosCase3.gappa gappa/trigos/TanCase2.gappa \ gappa/trigos/TanCase2.gappa \ gappa/trigos/SinCosCase3.gappa gappa/trigos/TanCase2.gappa \ gappa/sqrt12.gappa gappa/sqrt13.gappa gappa/sqrt-proof.sh gappa/sqrt.sed \ gappa/log-de/log-de-acc-index0-E0.gappa gappa/log-de/log-de-index0-E0.gappa \ gappa/log-de/log-de-acc-index0-E1N.gappa gappa/log-de/log-de-index0-E1N.gappa \ gappa/log-de/log-de-acc-index1N-E0.gappa gappa/log-de/log-de-index1N-E0N.gappa \ gappa/log-de/log-de-acc-index1N-E1N.gappa gappa/log-de/README \ gappa/log-td/log-td.gappa gappa/log-td/log-td-E0.gappa \ gappa/log-td/log-td-E0-logir0.gappa gappa/log-td/log-td-accurate.gappa \ gappa/log-td/log-td-accurate-E0.gappa gappa/log-td/log-td-accurate-E0-logir0.gappa \ gappa/exp-td/exp-td-accurate1.gappa gappa/exp-td/exp-td-accurate2.gappa \ gappa/exp-td/exp-td-accurate3.gappa gappa/exp-td/exp-td-accurate4.gappa \ gappa/exp-td/exp-td-proof.sh \ gappa/trigpi/cospi-accurate.gappa gappa/trigpi/cospi-quick.gappa \ gappa/trigpi/sinpi-accurate.gappa gappa/trigpi/sinpi-quick.gappa \ gappa/asin/asinAccuR0.gappa gappa/asin/asinAccuR1.gappa \ gappa/asin/asinAccuR2.gappa gappa/asin/asinAccuR3.gappa \ gappa/asin/asinAccuR4.gappa gappa/asin/asinAccuR5.gappa \ gappa/asin/asinAccuR6.gappa gappa/asin/asinAccuR7.gappa \ gappa/asin/asinAccuR8.gappa gappa/asin/asinAccuR9.gappa \ gappa/asin/asinQuickR0.gappa gappa/asin/asinQuickR1.gappa \ gappa/asin/asinQuickR2.gappa gappa/asin/asinQuickR3.gappa \ gappa/asin/asinQuickR4.gappa gappa/asin/asinQuickR5.gappa \ gappa/asin/asinQuickR6.gappa gappa/asin/asinQuickR7.gappa \ gappa/asin/asinQuickR8.gappa gappa/asin/asinQuickR9.gappa \ docs/latex/crlibm.tex \ docs/latex/0_intro.tex docs/latex/0_getting-started.tex\ docs/latex/1_common.tex docs/latex/sqrt.tex \ docs/latex/exp.tex docs/latex/expm1.tex \ docs/latex/log.tex docs/latex/log1p.tex docs/latex/log2.tex docs/latex/log10.tex\ docs/latex/asin.tex docs/latex/acos.tex docs/latex/atan.tex \ docs/latex/csh.tex docs/latex/trigo.tex docs/latex/trigpi.tex \ docs/latex/pow.tex \ docs/latex/fig_scs docs/latex/fig_exp\ docs/latex/elem-fun.bib\ docs/latex/tripledoubleprocedures.tex \ scs_lib/tests/tbx_timing.h \ tests/testperfs.sh\ triple-double.h double-extended.h \ log-de.c log-de.h log-td.c log-td.h\ atan-pentium.c atan-itanium.c interval-2.1.0/src/crlibm/NEWS0000644000000000000000000000000013031036767014216 0ustar 00000000000000interval-2.1.0/src/crlibm/README0000644000000000000000000000156213031036767014415 0ustar 00000000000000cr-libm, a portable, efficient, correctly rounded mathematical library. To compile: ./configure; make; (for options see ./configure --help) To run the selftest: make check; Beta release note: This version contains one state-of-the-art implementation. The log comes in two versions, log-td (portable) and log-de (optimised for processors with double-extended hardware). The ./configure should enable the one that is best for your system, except on Itanium: see below. There is no known bug, but several shortcomings are listed in the TODO file. Note for Itanium systems: Out-of-the box it should compile and selftest on Linux under both gcc and icc (feedback on HPUX is welcome). However, optimised versions of log and atan are disabled. They currently require icc 8.1 or later. See the beginning of log-de.c and atan-itanium.c for instructions on how to enable them. interval-2.1.0/src/crlibm/README.DEV0000644000000000000000000000100213031036767015017 0ustar 00000000000000 To compile crlibm after a cvs checkout, type ./prepare make or, if you want to perform accuracy tests against the MPFR library, ./prepare --enable-mpfr --with-gmp=/usr/local make (if necessary replace /usr/local/ with the actual location of the MPFR source) The prepare script requires to be invoked only once. After that, use: ./configure The prepare script ends with a call to ./configure, and the options to prepare are the options of configure. For a list of these options, type ./configure --help interval-2.1.0/src/crlibm/TODO0000644000000000000000000000372013031036767014223 0ustar 00000000000000TODO before 1.0 final release Serious bugs ------------ No known serious bug left so far. Exception raising should be improved. New functions ------------- Document the cases on which power is guaranteed correctly rounded values. Possibly write 2^x and 10^x (in harmonious combination with power) Proof stuff ----------- Update chapter asin and write chapter acos. Add the scripts generating the polynomials. Write Gappa proofs for log2-td, log10-td, expm1, log1p Check all the existing .gappa against last version of Gappa + set the paths right (where there are paths). Write proper proofs of the DE integer rounding tests, or remove DE altogether. Cleaning up stuff ----------------- Check .mpl with underscored variables (some versions of Maple don't like them) Purge obsolete .mpl Ensure compilation on icc9 and SunStudio11 Solution: check recent icc first. Then add FMADE macros everywhere FMA intended add make timings Autotest stuff -------------- Add worst cases for all which are currently written TODO A lot of the Lefevre worst cases are still missing You never have enough test cases. In particular asin and acos More cases around the various boundaries would be welcome. Optim stuff ----------- Remove remaining SCS: in atan, in trigo. Replace the current test for non-IEEE subnormal (on x86) in the code with a test taking into account that x86-64 is OK Minor improvements to atanpi as mentionned in the doc. Fuse atan-pentium and atan-itanium into atan-de, and add in atanpi. Or maybe remove all the DE stuff altogether for cleaning up. =========================================================================== TODO some day for a later release New functions ------------- Write inverse hyperbolic functions Optimisation stuff ------------------ Write TD versions of: trigo Write DE versions of: most functions Use technique in paper by Karp and Markstein for sqrt12 and sqrt13 Interval stuff -------------- Write interval functions for each CR functioninterval-2.1.0/src/crlibm/VERSION0000644000000000000000000000001013031036767014570 0ustar 000000000000001.0beta5interval-2.1.0/src/crlibm/acos-td.c0000644000000000000000000011532613031036767015237 0ustar 00000000000000/* * Correctly rounded arccosine * * Author : Christoph Lauter (ENS Lyon) * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" #include "acos-td.h" #define AVOID_FMA 1 void acos_accurate_lower(double *acosh, double *acosm, double *acosl, double x, double xSqh, double xSql, double sign) { double highPoly; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l; double tt1h, tt1l; double t8h, t8m, t8l, t9h, t9m, t9l, t10h, t10m, t10l, t11h, t11m, t11l, t12h, t12m, t12l; double tt8h, tt8m, tt8l, tt9h, tt9m, tt9l, tt10h, tt10m, tt10l, tt11h, tt11m, tt11l, tt12h, tt12m, tt12l; double xCubeh, xCubem, xCubel, tt13h, tt13m, tt13l, t13h, t13m, t13l, polyh, polym, polyl; double tt11hover, tt11mover, tt11lover; double zw1h, zw1m, zw1l, acoshover, acosmover, acoslover; #if EVAL_PERF crlibm_second_step_taken++; #endif /* Evaluate the polynomial of degree 37 Its coefficients start at tbl[0] p(x) = x + x * x^2 * (c3 + x^2 * (c5 + ... We receive x^2 as xSqh + xSql = x * x (exactly) in argument |x| <= 0.185 = 2^(-2.43) Compute monomials 27 to 37 in double precision monomials 13 to 25 in double-double and 1 to 11 in triple-double precision in a modified Horner form */ /* Double computations */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(tbl[33],xSqh,tbl[32]),xSqh,tbl[31]),xSqh,tbl[30]),xSqh,tbl[29]),xSqh,tbl[28]); #else highPoly = tbl[28] + xSqh * (tbl[29] + xSqh * (tbl[30] + xSqh * (tbl[31] + xSqh * (tbl[32] + xSqh * tbl[33])))); #endif /* Double-double computations */ Mul12(&tt1h,&tt1l,xSqh,highPoly); Add22(&t1h,&t1l,tbl[27],0,tt1h,tt1l); MulAdd22(&t2h,&t2l,tbl[25],tbl[26],xSqh,xSql,t1h,t1l); MulAdd22(&t3h,&t3l,tbl[23],tbl[24],xSqh,xSql,t2h,t2l); MulAdd22(&t4h,&t4l,tbl[21],tbl[22],xSqh,xSql,t3h,t3l); MulAdd22(&t5h,&t5l,tbl[19],tbl[20],xSqh,xSql,t4h,t4l); MulAdd22(&t6h,&t6l,tbl[17],tbl[18],xSqh,xSql,t5h,t5l); MulAdd22(&t7h,&t7l,tbl[15],tbl[16],xSqh,xSql,t6h,t6l); /* Triple-double computations */ Mul23(&tt8h,&tt8m,&tt8l,xSqh,xSql,t7h,t7l); /* 149 - 48/53 */ Add33(&t8h,&t8m,&t8l,tbl[12],tbl[13],tbl[14],tt8h,tt8m,tt8l); /* 145 - 43/53 */ Mul233(&tt9h,&tt9m,&tt9l,xSqh,xSql,t8h,t8m,t8l); /* 139 - 39/53 */ Add33(&t9h,&t9m,&t9l,tbl[9],tbl[10],tbl[11],tt9h,tt9m,tt9l); /* 136 - 34/53 */ Mul233(&tt10h,&tt10m,&tt10l,xSqh,xSql,t9h,t9m,t9l); /* 130 - 30/53 */ Add33(&t10h,&t10m,&t10l,tbl[6],tbl[7],tbl[8],tt10h,tt10m,tt10l); /* 127 - 25/53 */ Mul233(&tt11hover,&tt11mover,&tt11lover,xSqh,xSql,t10h,t10m,t10l); /* 121 - 21/53 */ Renormalize3(&tt11h,&tt11m,&tt11l,tt11hover,tt11mover,tt11lover); /* infty - 52/53 */ Add33(&t11h,&t11m,&t11l,tbl[3],tbl[4],tbl[5],tt11h,tt11m,tt11l); /* 149 - 47/53 */ Mul233(&tt12h,&tt12m,&tt12l,xSqh,xSql,t11h,t11m,t11l); /* 143 - 43/53 */ Add33(&t12h,&t12m,&t12l,tbl[0],tbl[1],tbl[2],tt12h,tt12m,tt12l); /* 140 - 38/53 */ Mul123(&xCubeh,&xCubem,&xCubel,x,xSqh,xSql); /* 154 - 47/53 */ Mul33(&tt13h,&tt13m,&tt13l,xCubeh,xCubem,xCubel,t12h,t12m,t12l); /* 136 - 34/53 */ Add133(&t13h,&t13m,&t13l,x,tt13h,tt13m,tt13l); /* 138 - 32/53 */ Renormalize3(&polyh,&polym,&polyl,t13h,t13m,t13l); /* infty - 52/53 */ /* Reconstruction: - Multiply by the inverted sign - Add Pi/2 in triple-double - Renormalize */ zw1h = -sign * polyh; zw1m = -sign * polym; zw1l = -sign * polyl; Add33(&acoshover,&acosmover,&acoslover,PIHALFH,PIHALFM,PIHALFL,zw1h,zw1m,zw1l); Renormalize3(acosh,acosm,acosl,acoshover,acosmover,acoslover); } void acos_accurate_middle(double *acosh, double *acosm, double *acosl, double z, int i, double sign) { double highPoly; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, t8h, t8l, t9h, t9l; double t10h, t10m, t10l, t11h, t11m, t11l, t12h, t12m, t12l, t13h, t13m, t13l, t14h, t14m, t14l; double t15h, t15m, t15l, t16h, t16m, t16l; double tt1h, tt1l; double tt10h, tt10m, tt10l, tt11h, tt11m, tt11l, tt12h, tt12m, tt12l; double tt13h, tt13m, tt13l, tt14h, tt14m, tt14l, tt15h, tt15m, tt15l, tt16h, tt16m, tt16l; double polyh, polym, polyl, tt13hover, tt13mover, tt13lover; double zw1h, zw1m, zw1l, acoshover, acosmover, acoslover; #if EVAL_PERF crlibm_second_step_taken++; #endif /* Evaluate the polynomial of degree 35 Its coefficients start at tbl[i+1] Evaluate degrees 35 to 20 in double precision, degrees 20 to 7 in double-double precision and finally degrees 6 to 1 in triple-double. The constant coefficient is a double-double, the computations are nevertheless in triple-double */ /* Double computations */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[i+58] ,z,tbl[i+57]),z,tbl[i+56]),z,tbl[i+55]),z,tbl[i+54]),z, tbl[i+53]),z,tbl[i+52]),z,tbl[i+51]),z,tbl[i+50]),z,tbl[i+49]),z, tbl[i+48]),z,tbl[i+47]),z,tbl[i+46]),z,tbl[i+45]),z,tbl[i+44]),z, tbl[i+43]),z,tbl[i+42]),z,tbl[i+41]),z,tbl[i+40]),z,tbl[i+39]); #else highPoly = tbl[i+39] + z * (tbl[i+40] + z * (tbl[i+41] + z * (tbl[i+42] + z * ( tbl[i+43] + z * (tbl[i+44] + z * (tbl[i+45] + z * (tbl[i+46] + z * ( tbl[i+47] + z * (tbl[i+48] + z * (tbl[i+49] + z * (tbl[i+50] + z * ( tbl[i+51] + z * (tbl[i+52] + z * (tbl[i+53] + z * (tbl[i+54] + z * ( tbl[i+55] + z * (tbl[i+56] + z * (tbl[i+57] + z * tbl[i+58])))))))))))))))))); #endif /* Double-double computations */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[i+37],tbl[i+38],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[i+35],tbl[i+36],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[i+33],tbl[i+34],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[i+31],tbl[i+32],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[i+29],tbl[i+30],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[i+27],tbl[i+28],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[i+25],tbl[i+26],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[i+23],tbl[i+24],z,t7h,t7l); MulAdd212(&t9h,&t9l,tbl[i+21],tbl[i+22],z,t8h,t8l); /* Triple-double computations */ Mul123(&tt10h,&tt10m,&tt10l,z,t9h,t9l); /* 154 - 47/53 */ Add33(&t10h,&t10m,&t10l,tbl[i+18],tbl[i+19],tbl[i+20],tt10h,tt10m,tt10l); /* 144 - 42/53 */ Mul133(&tt11h,&tt11m,&tt11l,z,t10h,t10m,t10l); /* 142 - 38/53 */ Add33(&t11h,&t11m,&t11l,tbl[i+15],tbl[i+16],tbl[i+17],tt11h,tt11m,tt11l); /* 136 - 33/53 */ Mul133(&tt12h,&tt12m,&tt12l,z,t11h,t11m,t11l); /* 133 - 28/53 */ Add33(&t12h,&t12m,&t12l,tbl[i+12],tbl[i+13],tbl[i+14],tt12h,tt12m,tt12l); /* 125 - 23/53 */ Mul133(&tt13hover,&tt13mover,&tt13lover,z,t12h,t12m,t12l); /* 123 - 18/53 */ Renormalize3(&tt13h,&tt13m,&tt13l,tt13hover,tt13mover,tt13lover); /* infty - 52/53 */ Add33(&t13h,&t13m,&t13l,tbl[i+9],tbl[i+10],tbl[i+11],tt13h,tt13m,tt13l); /* 149 - 47/53 */ Mul133(&tt14h,&tt14m,&tt14l,z,t13h,t13m,t13l); /* 147 - 42/53 */ Add33(&t14h,&t14m,&t14l,tbl[i+6],tbl[i+7],tbl[i+8],tt14h,tt14m,tt14l); /* 139 - 37/53 */ Mul133(&tt15h,&tt15m,&tt15l,z,t14h,t14m,t14l); /* 137 - 32/53 */ Add33(&t15h,&t15m,&t15l,tbl[i+3],tbl[i+4],tbl[i+5],tt15h,tt15m,tt15l); /* 129 - 28/53 */ Mul133(&tt16h,&tt16m,&tt16l,z,t15h,t15m,t15l); /* 128 - 23/53 */ Add233(&t16h,&t16m,&t16l,tbl[i+1],tbl[i+2],tt16h,tt16m,tt16l); /* 126 - 19/53 */ Renormalize3(&polyh,&polym,&polyl,t16h,t16m,t16l); /* infty - 52/53 */ /* Reconstruction: - Multiply by the inverted sign - Add Pi/2 in triple-double - Renormalize */ zw1h = -sign * polyh; zw1m = -sign * polym; zw1l = -sign * polyl; Add33(&acoshover,&acosmover,&acoslover,PIHALFH,PIHALFM,PIHALFL,zw1h,zw1m,zw1l); Renormalize3(acosh,acosm,acosl,acoshover,acosmover,acoslover); } void acos_accurate_higher(double *acosh, double *acosm, double *acosl, double z, double sign) { double highPoly; double tt1h, tt1l; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, t8h, t8l; double tt10h, tt10m, tt10l, tt11h, tt11m, tt11l, tt12h, tt12m, tt12l, tt13h, tt13m, tt13l; double tt14h, tt14m, tt14l, tt15h, tt15m, tt15l, tt16h, tt16m, tt16l, tt17h, tt17m, tt17l; double t9h, t9l, t10h, t10m, t10l, t11h, t11m, t11l, t12h, t12m, t12l, t13h, t13m, t13l; double t14h, t14m, t14l, t15h, t15m, t15l, t16h, t16m, t16l, t17h, t17m, t17l; double tt18h, tt18m, tt18l, polyh, polym, polyl; double sqrtzh, sqrtzm, sqrtzl, twoZ, pTimesSh, pTimesSm, pTimesSl; double allh, allm, alll; double tt13hover, tt13mover, tt13lover, tt16hover, tt16mover, tt16lover; double polyhover, polymover, polylover; #if EVAL_PERF crlibm_second_step_taken++; #endif /* We evaluate acos(x) with x > 0 as acos(x) = -1 * f(z) * sqrt(2*z) with z = 1 - x and f(z) = (asin(z) - Pi/2) / sqrt(2*z) f(z) is approximated by p(z) The polynomial p(z) is of degree 29 Its coefficients start at tbl[TBLIDX10] Coefficients for degrees 29 to 18 are in double precision, for degrees 17 to 9 in double-double precision and finally for degrees 8 to 1 in triple-double. The constant coefficient (-1) is not stored in the table, the computations are nevertheless in triple-double We evaluate the monomials in the precision in which the correspondant coefficients are stored The coefficients' values decrease very quickly so even with |z| < 2^-2.18 we can compute degree 18 already in double precision Compute than sqrt(2*z) as a triple-double multiply in triple-double. */ /* Double computations */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[TBLIDX10+53] ,z,tbl[TBLIDX10+52]),z,tbl[TBLIDX10+51]),z, tbl[TBLIDX10+50]),z,tbl[TBLIDX10+49]),z,tbl[TBLIDX10+48]),z, tbl[TBLIDX10+47]),z,tbl[TBLIDX10+46]),z,tbl[TBLIDX10+45]),z, tbl[TBLIDX10+44]),z,tbl[TBLIDX10+43]),z,tbl[TBLIDX10+42]); #else highPoly = tbl[TBLIDX10+42] + z * (tbl[TBLIDX10+43] + z * (tbl[TBLIDX10+44] + z * ( tbl[TBLIDX10+45] + z * (tbl[TBLIDX10+46] + z * (tbl[TBLIDX10+47] + z * ( tbl[TBLIDX10+48] + z * (tbl[TBLIDX10+49] + z * (tbl[TBLIDX10+50] + z * ( tbl[TBLIDX10+51] + z * (tbl[TBLIDX10+52] + z * tbl[TBLIDX10+53])))))))))); #endif /* Double-double computations */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[TBLIDX10+40],tbl[TBLIDX10+41],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[TBLIDX10+38],tbl[TBLIDX10+39],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[TBLIDX10+36],tbl[TBLIDX10+37],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[TBLIDX10+34],tbl[TBLIDX10+35],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[TBLIDX10+32],tbl[TBLIDX10+33],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[TBLIDX10+30],tbl[TBLIDX10+31],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[TBLIDX10+28],tbl[TBLIDX10+29],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[TBLIDX10+26],tbl[TBLIDX10+27],z,t7h,t7l); MulAdd212(&t9h,&t9l,tbl[TBLIDX10+24],tbl[TBLIDX10+25],z,t8h,t8l); /* Triple-double computations */ Mul123(&tt10h,&tt10m,&tt10l,z,t9h,t9l); /* 154 - 47/53 */ Add33(&t10h,&t10m,&t10l,tbl[TBLIDX10+21],tbl[TBLIDX10+22],tbl[TBLIDX10+23],tt10h,tt10m,tt10l); /* 144 - 42/53 */ Mul133(&tt11h,&tt11m,&tt11l,z,t10h,t10m,t10l); /* 142 - 37/53 */ Add33(&t11h,&t11m,&t11l,tbl[TBLIDX10+18],tbl[TBLIDX10+19],tbl[TBLIDX10+20],tt11h,tt11m,tt11l); /* 134 - 32/53 */ Mul133(&tt12h,&tt12m,&tt12l,z,t11h,t11m,t11l); /* 132 - 27/53 */ Add33(&t12h,&t12m,&t12l,tbl[TBLIDX10+15],tbl[TBLIDX10+16],tbl[TBLIDX10+17],tt12h,tt12m,tt12l); /* 124 - 22/53 */ Mul133(&tt13hover,&tt13mover,&tt13lover,z,t12h,t12m,t12l); /* 122 - 17/53 */ Renormalize3(&tt13h,&tt13m,&tt13l,tt13hover,tt13mover,tt13lover); /* infty - 52/53 */ Add33(&t13h,&t13m,&t13l,tbl[TBLIDX10+12],tbl[TBLIDX10+13],tbl[TBLIDX10+14],tt13h,tt13m,tt13l); /* 149 - 47/53 */ Mul133(&tt14h,&tt14m,&tt14l,z,t13h,t13m,t13l); /* 147 - 42/53 */ Add33(&t14h,&t14m,&t14l,tbl[TBLIDX10+9],tbl[TBLIDX10+10],tbl[TBLIDX10+11],tt14h,tt14m,tt14l); /* 139 - 37/53 */ Mul133(&tt15h,&tt15m,&tt15l,z,t14h,t14m,t14l); /* 137 - 32/53 */ Add33(&t15h,&t15m,&t15l,tbl[TBLIDX10+6],tbl[TBLIDX10+7],tbl[TBLIDX10+8],tt15h,tt15m,tt15l); /* 129 - 27/53 */ Mul133(&tt16hover,&tt16mover,&tt16lover,z,t15h,t15m,t15l); /* 127 - 22/53 */ Renormalize3(&tt16h,&tt16m,&tt16l,tt16hover,tt16mover,tt16lover); /* infty - 52/53 */ Add33(&t16h,&t16m,&t16l,tbl[TBLIDX10+3],tbl[TBLIDX10+4],tbl[TBLIDX10+5],tt16h,tt16m,tt16l); /* 149 - 47/53 */ Mul133(&tt17h,&tt17m,&tt17l,z,t16h,t16m,t16l); /* 147 - 42/53 */ Add33(&t17h,&t17m,&t17l,tbl[TBLIDX10+0],tbl[TBLIDX10+1],tbl[TBLIDX10+2],tt17h,tt17m,tt17l); /* 139 - 37/53 */ Mul133(&tt18h,&tt18m,&tt18l,z,t17h,t17m,t17l); /* 137 - 32/53 */ Add133(&polyhover,&polymover,&polylover,-1,tt18h,tt18m,tt18l); /* 136 - 30/53 */ Renormalize3(&polyh,&polym,&polyl,polyhover,polymover,polylover); /* infty - 52/53 */ /* Compute sqrt(2*z) as a triple-double */ twoZ = 2 * z; Sqrt13(&sqrtzh,&sqrtzm,&sqrtzl,twoZ); /* 146 - 52/53 */ /* Multiply p(z) by sqrt(2*z) */ Mul33(&pTimesSh,&pTimesSm,&pTimesSl,polyh,polym,polyl,sqrtzh,sqrtzm,sqrtzl); /* 139 - 48/53 */ /* Reconstruction: If the sign of x in acos(x) was positive: - Multiply pTimesSh + pTimesSm + pTimesSl approx f(x) * sqrt(2 * z) by -1 - Renormalize - Return Otherwise: - Add Pi in triple-double to pTimesSh + pTimesSm + pTimesSl approx f(x) * sqrt(2 * z) - Renormalize - Return */ if (sign > 0) { allh = -1.0 * pTimesSh; allm = -1.0 * pTimesSm; alll = -1.0 * pTimesSl; /* 139 - 48/53 */ } else { Add33(&allh,&allm,&alll,PIH,PIM,PIL,pTimesSh,pTimesSm,pTimesSl); /* 130 - 43/53 */ } Renormalize3(acosh,acosm,acosl,allh,allm,alll); /* infty - 52/53 */ } double acos_rn(double x) { db_number xdb; double sign, z, acosh, acosm, acosl; int i; double xSqh, xSql; double tt1h, tt1l; double tt6h, tt6l; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l; double t7h, t7l, t8h, t8l, polyh, polyl, twoZ, sqrtzh, sqrtzl; double pTimesSh, pTimesSl, highPoly, xCubeh, xCubel; double tmp1, tmp2, tmp3, tmp4, tmp5; double zw1h, zw1l; /* #if CRLIBM_REQUIRES_ROUNDING_MODE_CHANGE SAVE_STATE_AND_SET_RNDOUBLE #endif */ /* Transform the argument into integer */ xdb.d = x; /* Special case handling */ /* Exact algebraic case x = 1, acos(1) = 0 */ if (x == 1.0) return 0.0; /* Strip off the sign of argument x */ if (xdb.i[HI] & 0x80000000) sign = -1; else sign = 1; xdb.i[HI] &= 0x7fffffff; /* acos is defined on -1 <= x <= 1, elsewhere it is NaN */ if ((xdb.i[HI] > 0x3ff00000) || ((xdb.i[HI] == 0x3ff00000) && (xdb.i[LO] != 0x00000000))) { return (x-x)/0.0; /* return NaN */ } /* If |x| < 2^(-120) we have round(acos(x)) = round(pi/2) So we can decide the rounding without any computation */ if (xdb.i[HI] < 0x38700000) { return PIHALFDOUBLERN; } /* Recast x */ x = xdb.d; /* Find correspondant interval and compute index to the table We start by filtering the two special cases around 0 and 1 */ if (xdb.i[HI] < BOUND1) { /* Special interval 0..BOUND1 The polynomial has no even monomials We must prove extra accuracy in the interval 0..sin(2^(-18)) */ /* Quick phase starts */ /* Compute square of x for both quick and accurate phases */ Mul12(&xSqh,&xSql,x,x); tmp4 = tbl[3]; tmp5 = tbl[4]; t4h = tmp4; t4l = tmp5; if (xdb.i[HI] > EXTRABOUND) { /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(tbl[23],xSqh,tbl[21]),xSqh,tbl[19]),xSqh,tbl[17]),xSqh,tbl[15]); #else highPoly = tbl[15] + xSqh * (tbl[17] + xSqh * (tbl[19] + xSqh * (tbl[21] + xSqh * tbl[23]))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,xSqh,highPoly); Add22(&t1h,&t1l,tbl[12],tbl[13],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[9],tbl[10],xSqh,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[6],tbl[7],xSqh,t2h,t2l); MulAdd22(&t4h,&t4l,tmp4,tmp5,xSqh,xSql,t3h,t3l); } MulAdd22(&t5h,&t5l,tbl[0],tbl[1],xSqh,xSql,t4h,t4l); Mul122(&xCubeh,&xCubel,x,xSqh,xSql); Mul22(&tt6h,&tt6l,xCubeh,xCubel,t5h,t5l); Add12(tmp1,tmp2,x,tt6h); tmp3 = tmp2 + tt6l; Add12(polyh,polyl,tmp1,tmp3); /* Reconstruction: - Multiply by the inverted sign - Add Pi/2 in double-double precision */ zw1h = -sign * polyh; zw1l = -sign * polyl; Add22(&acosh,&acosm,PIHALFH,PIHALFM,zw1h,zw1l); /* Rounding test The RN rounding constant is at tbl[34] */ if(acosh == (acosh + (acosm * tbl[34]))) return acosh; /* Launch accurate phase */ acos_accurate_lower(&acosh,&acosm,&acosl,x,xSqh,xSql,sign); ReturnRoundToNearest3(acosh,acosm,acosl); } if (xdb.i[HI] >= BOUND9) { /* Special interval BOUND9..1 We use an asymptotic development of arcsin in sqrt(1 - x) */ /* Argument reduction for quick and accurate phase z = 1 - x The operation is exact as per Sterbenz' lemma */ z = 1 - x; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[TBLIDX10+42] ,z,tbl[TBLIDX10+40]),z,tbl[TBLIDX10+38]),z, tbl[TBLIDX10+36]),z,tbl[TBLIDX10+34]),z,tbl[TBLIDX10+32]),z, tbl[TBLIDX10+30]),z,tbl[TBLIDX10+28]),z,tbl[TBLIDX10+26]),z, tbl[TBLIDX10+24]); #else highPoly = tbl[TBLIDX10+24] + z * (tbl[TBLIDX10+26] + z * (tbl[TBLIDX10+28] + z * ( tbl[TBLIDX10+30] + z * (tbl[TBLIDX10+32] + z * (tbl[TBLIDX10+34] + z * ( tbl[TBLIDX10+36] + z * (tbl[TBLIDX10+38] + z * (tbl[TBLIDX10+40] + z * tbl[TBLIDX10+42])))))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[TBLIDX10+21],tbl[TBLIDX10+22],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[TBLIDX10+18],tbl[TBLIDX10+19],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[TBLIDX10+15],tbl[TBLIDX10+16],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[TBLIDX10+12],tbl[TBLIDX10+13],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[TBLIDX10+9],tbl[TBLIDX10+10],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[TBLIDX10+6],tbl[TBLIDX10+7],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[TBLIDX10+3],tbl[TBLIDX10+4],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[TBLIDX10+0],tbl[TBLIDX10+1],z,t7h,t7l); MulAdd212(&polyh,&polyl,-1,0,z,t8h,t8l); /* Compute sqrt(2*z) as a double-double */ twoZ = 2 * z; sqrt12(&sqrtzh,&sqrtzl,twoZ); /* Multiply p(z) by sqrt(2*z) and add Pi/2 */ Mul22(&pTimesSh,&pTimesSl,polyh,polyl,sqrtzh,sqrtzl); /* Reconstruction: If the sign of x in acos(x) was positive: - Multiply pTimesSh + pTimesSl approx f(x) * sqrt(2 * z) by -1 - Return Otherwise: - Add Pi in triple-double to pTimesSh + pTimesSl approx f(x) * sqrt(2 * z) - Return */ if (sign > 0) { acosh = -1.0 * pTimesSh; acosm = -1.0 * pTimesSl; } else { Add22(&acosh,&acosm,PIH,PIM,pTimesSh,pTimesSl); } /* Rounding test The RN rounding constant is at tbl[TBLIDX10+54] */ if(acosh == (acosh + (acosm * tbl[TBLIDX10+54]))) return acosh; /* Launch accurate phase */ acos_accurate_higher(&acosh,&acosm,&acosl,z,sign); ReturnRoundToNearest3(acosh,acosm,acosl); } /* General 8 main intervals We can already suppose that BOUND1 <= x <= BOUND9 */ if (xdb.i[HI] < BOUND5) { if (xdb.i[HI] < BOUND3) { if (xdb.i[HI] < BOUND2) i = TBLIDX2; else i = TBLIDX3; } else { if (xdb.i[HI] < BOUND4) i = TBLIDX4; else i = TBLIDX5; } } else { if (xdb.i[HI] < BOUND7) { if (xdb.i[HI] < BOUND6) i = TBLIDX6; else i = TBLIDX7; } else { if (xdb.i[HI] < BOUND8) i = TBLIDX8; else i = TBLIDX9; } } /* Argument reduction i points to the interval midpoint value in the table */ z = x - tbl[i]; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[i+35] ,z,tbl[i+33]),z,tbl[i+31]),z,tbl[i+29]),z, tbl[i+27]),z,tbl[i+25]),z,tbl[i+23]),z,tbl[i+21]); #else highPoly = tbl[i+21] + z * (tbl[i+23] + z * (tbl[i+25] + z * ( tbl[i+27] + z * (tbl[i+29] + z * (tbl[i+31] + z * ( tbl[i+33] + z * tbl[i+35])))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[i+18],tbl[i+19],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[i+15],tbl[i+16],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[i+12],tbl[i+13],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[i+9],tbl[i+10],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[i+6],tbl[i+7],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[i+3],tbl[i+4],z,t5h,t5l); MulAdd212(&polyh,&polyl,tbl[i+1],tbl[i+2],z,t6h,t6l); /* Reconstruction: - Multiply by the inverted sign - Add Pi/2 in double-double precision */ zw1h = -sign * polyh; zw1l = -sign * polyl; Add22(&acosh,&acosm,PIHALFH,PIHALFM,zw1h,zw1l); /* Rounding test The RN rounding constant is at tbl[i+59] */ if(acosh == (acosh + (acosm * tbl[i+59]))) return acosh; /* Launch accurate phase */ acos_accurate_middle(&acosh,&acosm,&acosl,z,i,sign); ReturnRoundToNearest3(acosh,acosm,acosl); } double acos_ru(double x) { db_number xdb; double sign, z, acosh, acosm, acosl; int i; double xSqh, xSql; double tt1h, tt1l; double tt6h, tt6l; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l; double t7h, t7l, t8h, t8l, polyh, polyl, twoZ, sqrtzh, sqrtzl; double pTimesSh, pTimesSl, highPoly, xCubeh, xCubel; double tmp1, tmp2, tmp3, tmp4, tmp5; double zw1h, zw1l; /* Transform the argument into integer */ xdb.d = x; /* Special case handling */ /* Exact algebraic case x = 1, acos(1) = 0 */ if (x == 1.0) return 0.0; /* Strip off the sign of argument x */ if (xdb.i[HI] & 0x80000000) sign = -1; else sign = 1; xdb.i[HI] &= 0x7fffffff; /* acos is defined on -1 <= x <= 1, elsewhere it is NaN */ if ((xdb.i[HI] > 0x3ff00000) || ((xdb.i[HI] == 0x3ff00000) && (xdb.i[LO] != 0x00000000))) { return (x-x)/0.0; /* return NaN */ } /* If |x| < 2^(-120) we have round(acos(x)) = round(pi/2) So we can decide the rounding without any computation */ if (xdb.i[HI] < 0x38700000) { return PIHALFDOUBLERU; } /* Recast x */ x = xdb.d; /* Find correspondant interval and compute index to the table We start by filtering the two special cases around 0 and 1 */ if (xdb.i[HI] < BOUND1) { /* Special interval 0..BOUND1 The polynomial has no even monomials We must prove extra accuracy in the interval 0..sin(2^(-18)) */ /* Quick phase starts */ /* Compute square of x for both quick and accurate phases */ Mul12(&xSqh,&xSql,x,x); tmp4 = tbl[3]; tmp5 = tbl[4]; t4h = tmp4; t4l = tmp5; if (xdb.i[HI] > EXTRABOUND) { /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(tbl[23],xSqh,tbl[21]),xSqh,tbl[19]),xSqh,tbl[17]),xSqh,tbl[15]); #else highPoly = tbl[15] + xSqh * (tbl[17] + xSqh * (tbl[19] + xSqh * (tbl[21] + xSqh * tbl[23]))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,xSqh,highPoly); Add22(&t1h,&t1l,tbl[12],tbl[13],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[9],tbl[10],xSqh,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[6],tbl[7],xSqh,t2h,t2l); MulAdd22(&t4h,&t4l,tmp4,tmp5,xSqh,xSql,t3h,t3l); } MulAdd22(&t5h,&t5l,tbl[0],tbl[1],xSqh,xSql,t4h,t4l); Mul122(&xCubeh,&xCubel,x,xSqh,xSql); Mul22(&tt6h,&tt6l,xCubeh,xCubel,t5h,t5l); Add12(tmp1,tmp2,x,tt6h); tmp3 = tmp2 + tt6l; Add12(polyh,polyl,tmp1,tmp3); /* Reconstruction: - Multiply by the inverted sign - Add Pi/2 in double-double precision */ zw1h = -sign * polyh; zw1l = -sign * polyl; Add22(&acosh,&acosm,PIHALFH,PIHALFM,zw1h,zw1l); /* Rounding test The RU rounding constant is at tbl[35] */ TEST_AND_RETURN_RU(acosh, acosm, tbl[35]); /* Launch accurate phase */ acos_accurate_lower(&acosh,&acosm,&acosl,x,xSqh,xSql,sign); ReturnRoundUpwards3(acosh,acosm,acosl); } if (xdb.i[HI] >= BOUND9) { /* Special interval BOUND9..1 We use an asymptotic development of arcsin in sqrt(1 - x) */ /* Argument reduction for quick and accurate phase z = 1 - x The operation is exact as per Sterbenz' lemma */ z = 1 - x; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[TBLIDX10+42] ,z,tbl[TBLIDX10+40]),z,tbl[TBLIDX10+38]),z, tbl[TBLIDX10+36]),z,tbl[TBLIDX10+34]),z,tbl[TBLIDX10+32]),z, tbl[TBLIDX10+30]),z,tbl[TBLIDX10+28]),z,tbl[TBLIDX10+26]),z, tbl[TBLIDX10+24]); #else highPoly = tbl[TBLIDX10+24] + z * (tbl[TBLIDX10+26] + z * (tbl[TBLIDX10+28] + z * ( tbl[TBLIDX10+30] + z * (tbl[TBLIDX10+32] + z * (tbl[TBLIDX10+34] + z * ( tbl[TBLIDX10+36] + z * (tbl[TBLIDX10+38] + z * (tbl[TBLIDX10+40] + z * tbl[TBLIDX10+42])))))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[TBLIDX10+21],tbl[TBLIDX10+22],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[TBLIDX10+18],tbl[TBLIDX10+19],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[TBLIDX10+15],tbl[TBLIDX10+16],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[TBLIDX10+12],tbl[TBLIDX10+13],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[TBLIDX10+9],tbl[TBLIDX10+10],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[TBLIDX10+6],tbl[TBLIDX10+7],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[TBLIDX10+3],tbl[TBLIDX10+4],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[TBLIDX10+0],tbl[TBLIDX10+1],z,t7h,t7l); MulAdd212(&polyh,&polyl,-1,0,z,t8h,t8l); /* Compute sqrt(2*z) as a double-double */ twoZ = 2 * z; sqrt12(&sqrtzh,&sqrtzl,twoZ); /* Multiply p(z) by sqrt(2*z) and add Pi/2 */ Mul22(&pTimesSh,&pTimesSl,polyh,polyl,sqrtzh,sqrtzl); /* Reconstruction: If the sign of x in acos(x) was positive: - Multiply pTimesSh + pTimesSl approx f(x) * sqrt(2 * z) by -1 - Return Otherwise: - Add Pi in triple-double to pTimesSh + pTimesSl approx f(x) * sqrt(2 * z) - Return */ if (sign > 0) { acosh = -1.0 * pTimesSh; acosm = -1.0 * pTimesSl; } else { Add22(&acosh,&acosm,PIH,PIM,pTimesSh,pTimesSl); } /* Rounding test The RU rounding constant is at tbl[TBLIDX10+55] */ TEST_AND_RETURN_RU(acosh, acosm, tbl[TBLIDX10+55]); /* Launch accurate phase */ acos_accurate_higher(&acosh,&acosm,&acosl,z,sign); ReturnRoundUpwards3(acosh,acosm,acosl); } /* General 8 main intervals We can already suppose that BOUND1 <= x <= BOUND9 */ if (xdb.i[HI] < BOUND5) { if (xdb.i[HI] < BOUND3) { if (xdb.i[HI] < BOUND2) i = TBLIDX2; else i = TBLIDX3; } else { if (xdb.i[HI] < BOUND4) i = TBLIDX4; else i = TBLIDX5; } } else { if (xdb.i[HI] < BOUND7) { if (xdb.i[HI] < BOUND6) i = TBLIDX6; else i = TBLIDX7; } else { if (xdb.i[HI] < BOUND8) i = TBLIDX8; else i = TBLIDX9; } } /* Argument reduction i points to the interval midpoint value in the table */ z = x - tbl[i]; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[i+35] ,z,tbl[i+33]),z,tbl[i+31]),z,tbl[i+29]),z, tbl[i+27]),z,tbl[i+25]),z,tbl[i+23]),z,tbl[i+21]); #else highPoly = tbl[i+21] + z * (tbl[i+23] + z * (tbl[i+25] + z * ( tbl[i+27] + z * (tbl[i+29] + z * (tbl[i+31] + z * ( tbl[i+33] + z * tbl[i+35])))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[i+18],tbl[i+19],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[i+15],tbl[i+16],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[i+12],tbl[i+13],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[i+9],tbl[i+10],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[i+6],tbl[i+7],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[i+3],tbl[i+4],z,t5h,t5l); MulAdd212(&polyh,&polyl,tbl[i+1],tbl[i+2],z,t6h,t6l); /* Reconstruction: - Multiply by the inverted sign - Add Pi/2 in double-double precision */ zw1h = -sign * polyh; zw1l = -sign * polyl; Add22(&acosh,&acosm,PIHALFH,PIHALFM,zw1h,zw1l); /* Rounding test The RU rounding constant is at tbl[i+60] */ TEST_AND_RETURN_RU(acosh, acosm, tbl[i+60]); /* Launch accurate phase */ acos_accurate_middle(&acosh,&acosm,&acosl,z,i,sign); ReturnRoundUpwards3(acosh,acosm,acosl); } double acos_rd(double x) { db_number xdb; double sign, z, acosh, acosm, acosl; int i; double xSqh, xSql; double tt1h, tt1l; double tt6h, tt6l; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l; double t7h, t7l, t8h, t8l, polyh, polyl, twoZ, sqrtzh, sqrtzl; double pTimesSh, pTimesSl, highPoly, xCubeh, xCubel; double tmp1, tmp2, tmp3, tmp4, tmp5; double zw1h, zw1l; /* Transform the argument into integer */ xdb.d = x; /* Special case handling */ /* Exact algebraic case x = 1, acos(1) = 0 */ if (x == 1.0) return 0.0; /* Strip off the sign of argument x */ if (xdb.i[HI] & 0x80000000) sign = -1; else sign = 1; xdb.i[HI] &= 0x7fffffff; /* acos is defined on -1 <= x <= 1, elsewhere it is NaN */ if ((xdb.i[HI] > 0x3ff00000) || ((xdb.i[HI] == 0x3ff00000) && (xdb.i[LO] != 0x00000000))) { return (x-x)/0.0; /* return NaN */ } /* If |x| < 2^(-120) we have round(acos(x)) = round(pi/2) So we can decide the rounding without any computation */ if (xdb.i[HI] < 0x38700000) { return PIHALFDOUBLERD; } /* Recast x */ x = xdb.d; /* Find correspondant interval and compute index to the table We start by filtering the two special cases around 0 and 1 */ if (xdb.i[HI] < BOUND1) { /* Special interval 0..BOUND1 The polynomial has no even monomials We must prove extra accuracy in the interval 0..sin(2^(-18)) */ /* Quick phase starts */ /* Compute square of x for both quick and accurate phases */ Mul12(&xSqh,&xSql,x,x); tmp4 = tbl[3]; tmp5 = tbl[4]; t4h = tmp4; t4l = tmp5; if (xdb.i[HI] > EXTRABOUND) { /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(tbl[23],xSqh,tbl[21]),xSqh,tbl[19]),xSqh,tbl[17]),xSqh,tbl[15]); #else highPoly = tbl[15] + xSqh * (tbl[17] + xSqh * (tbl[19] + xSqh * (tbl[21] + xSqh * tbl[23]))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,xSqh,highPoly); Add22(&t1h,&t1l,tbl[12],tbl[13],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[9],tbl[10],xSqh,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[6],tbl[7],xSqh,t2h,t2l); MulAdd22(&t4h,&t4l,tmp4,tmp5,xSqh,xSql,t3h,t3l); } MulAdd22(&t5h,&t5l,tbl[0],tbl[1],xSqh,xSql,t4h,t4l); Mul122(&xCubeh,&xCubel,x,xSqh,xSql); Mul22(&tt6h,&tt6l,xCubeh,xCubel,t5h,t5l); Add12(tmp1,tmp2,x,tt6h); tmp3 = tmp2 + tt6l; Add12(polyh,polyl,tmp1,tmp3); /* Reconstruction: - Multiply by the inverted sign - Add Pi/2 in double-double precision */ zw1h = -sign * polyh; zw1l = -sign * polyl; Add22(&acosh,&acosm,PIHALFH,PIHALFM,zw1h,zw1l); /* Rounding test The RD rounding constant is at tbl[35] */ TEST_AND_RETURN_RD(acosh, acosm, tbl[35]); /* Launch accurate phase */ acos_accurate_lower(&acosh,&acosm,&acosl,x,xSqh,xSql,sign); ReturnRoundDownwards3(acosh,acosm,acosl); } if (xdb.i[HI] >= BOUND9) { /* Special interval BOUND9..1 We use an asymptotic development of arcsin in sqrt(1 - x) */ /* Argument reduction for quick and accurate phase z = 1 - x The operation is exact as per Sterbenz' lemma */ z = 1 - x; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[TBLIDX10+42] ,z,tbl[TBLIDX10+40]),z,tbl[TBLIDX10+38]),z, tbl[TBLIDX10+36]),z,tbl[TBLIDX10+34]),z,tbl[TBLIDX10+32]),z, tbl[TBLIDX10+30]),z,tbl[TBLIDX10+28]),z,tbl[TBLIDX10+26]),z, tbl[TBLIDX10+24]); #else highPoly = tbl[TBLIDX10+24] + z * (tbl[TBLIDX10+26] + z * (tbl[TBLIDX10+28] + z * ( tbl[TBLIDX10+30] + z * (tbl[TBLIDX10+32] + z * (tbl[TBLIDX10+34] + z * ( tbl[TBLIDX10+36] + z * (tbl[TBLIDX10+38] + z * (tbl[TBLIDX10+40] + z * tbl[TBLIDX10+42])))))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[TBLIDX10+21],tbl[TBLIDX10+22],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[TBLIDX10+18],tbl[TBLIDX10+19],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[TBLIDX10+15],tbl[TBLIDX10+16],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[TBLIDX10+12],tbl[TBLIDX10+13],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[TBLIDX10+9],tbl[TBLIDX10+10],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[TBLIDX10+6],tbl[TBLIDX10+7],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[TBLIDX10+3],tbl[TBLIDX10+4],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[TBLIDX10+0],tbl[TBLIDX10+1],z,t7h,t7l); MulAdd212(&polyh,&polyl,-1,0,z,t8h,t8l); /* Compute sqrt(2*z) as a double-double */ twoZ = 2 * z; sqrt12(&sqrtzh,&sqrtzl,twoZ); /* Multiply p(z) by sqrt(2*z) and add Pi/2 */ Mul22(&pTimesSh,&pTimesSl,polyh,polyl,sqrtzh,sqrtzl); /* Reconstruction: If the sign of x in acos(x) was positive: - Multiply pTimesSh + pTimesSl approx f(x) * sqrt(2 * z) by -1 - Return Otherwise: - Add Pi in triple-double to pTimesSh + pTimesSl approx f(x) * sqrt(2 * z) - Return */ if (sign > 0) { acosh = -1.0 * pTimesSh; acosm = -1.0 * pTimesSl; } else { Add22(&acosh,&acosm,PIH,PIM,pTimesSh,pTimesSl); } /* Rounding test The RD rounding constant is at tbl[TBLIDX10+55] */ TEST_AND_RETURN_RD(acosh, acosm, tbl[TBLIDX10+55]); /* Launch accurate phase */ acos_accurate_higher(&acosh,&acosm,&acosl,z,sign); ReturnRoundDownwards3(acosh,acosm,acosl); } /* General 8 main intervals We can already suppose that BOUND1 <= x <= BOUND9 */ if (xdb.i[HI] < BOUND5) { if (xdb.i[HI] < BOUND3) { if (xdb.i[HI] < BOUND2) i = TBLIDX2; else i = TBLIDX3; } else { if (xdb.i[HI] < BOUND4) i = TBLIDX4; else i = TBLIDX5; } } else { if (xdb.i[HI] < BOUND7) { if (xdb.i[HI] < BOUND6) i = TBLIDX6; else i = TBLIDX7; } else { if (xdb.i[HI] < BOUND8) i = TBLIDX8; else i = TBLIDX9; } } /* Argument reduction i points to the interval midpoint value in the table */ z = x - tbl[i]; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[i+35] ,z,tbl[i+33]),z,tbl[i+31]),z,tbl[i+29]),z, tbl[i+27]),z,tbl[i+25]),z,tbl[i+23]),z,tbl[i+21]); #else highPoly = tbl[i+21] + z * (tbl[i+23] + z * (tbl[i+25] + z * ( tbl[i+27] + z * (tbl[i+29] + z * (tbl[i+31] + z * ( tbl[i+33] + z * tbl[i+35])))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[i+18],tbl[i+19],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[i+15],tbl[i+16],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[i+12],tbl[i+13],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[i+9],tbl[i+10],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[i+6],tbl[i+7],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[i+3],tbl[i+4],z,t5h,t5l); MulAdd212(&polyh,&polyl,tbl[i+1],tbl[i+2],z,t6h,t6l); /* Reconstruction: - Multiply by the inverted sign - Add Pi/2 in double-double precision */ zw1h = -sign * polyh; zw1l = -sign * polyl; Add22(&acosh,&acosm,PIHALFH,PIHALFM,zw1h,zw1l); /* Rounding test The RD rounding constant is at tbl[i+60] */ TEST_AND_RETURN_RD(acosh, acosm, tbl[i+60]); /* Launch accurate phase */ acos_accurate_middle(&acosh,&acosm,&acosl,z,i,sign); ReturnRoundDownwards3(acosh,acosm,acosl); } interval-2.1.0/src/crlibm/acos-td.h0000644000000000000000000015462413031036767015250 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" /* File generated by maple/acos-td.mpl */ /* High order words of interval bounds (low order word is 0) */ #define BOUND1 0x3FC7AE14 #define BOUND2 0x3FD32E91 #define BOUND3 0x3FD9CA24 #define BOUND4 0x3FDF90B3 #define BOUND5 0x3FE23ADC #define BOUND6 0x3FE4781D #define BOUND7 0x3FE647BB #define BOUND8 0x3FE7BC81 #define BOUND9 0x3FE8F5C2 #define EXTRABOUND 0x3F500000 /* Pi/2 as a triple-double*/ #define PIHALFH 1.57079632679489655799898173427209258079528808593750e+00 #define PIHALFM 6.12323399573676603586882014729198302312846062338790e-17 #define PIHALFL -1.49738490485916983294350817710599200835275047616952e-33 /* Pi as a triple-double*/ #define PIH 3.14159265358979311599796346854418516159057617187500e+00 #define PIM 1.22464679914735320717376402945839660462569212467758e-16 #define PIL -2.99476980971833966588701635421198401670550095233904e-33 #define PIHALFDOUBLERN 1.57079632679489655799898173427209258079528808593750e+00 #define PIHALFDOUBLERU 1.57079632679489678004358665930340066552162170410156e+00 #define PIHALFDOUBLERD 1.57079632679489655799898173427209258079528808593750e+00 /* Indices to the following table */ #define TBLIDX2 36 #define TBLIDX3 97 #define TBLIDX4 158 #define TBLIDX5 219 #define TBLIDX6 280 #define TBLIDX7 341 #define TBLIDX8 402 #define TBLIDX9 463 #define TBLIDX10 524 /* Table with midpoints and polynomial coefficients */ static const double tbl[580] = { 1.66666666666666657414808128123695496469736099243164e-01, /* 0, accPolyLowC3h, quickPolyLowC3h */ 9.25185853854297065661561206416060845590588197735272e-18, /* 1, accPolyLowC3m, quickPolyLowC3l */ 5.13580782192052290146917464639635163327575367072527e-34, /* 2, accPolyLowC3l */ 7.49999999999999972244424384371086489409208297729492e-02, /* 3, accPolyLowC5h, quickPolyLowC5h */ 2.77555756156289150513347472120591902572823540679419e-18, /* 4, accPolyLowC5m, quickPolyLowC5l */ -1.43929408167863119589461549455410834291155585333144e-34, /* 5, accPolyLowC5l */ 4.46428571428571438484134148438897682353854179382324e-02, /* 6, accPolyLowC7h, quickPolyLowC7h */ -9.91270557701064540788749549275225920938048550224136e-19, /* 7, accPolyLowC7m, quickPolyLowC7l */ 3.33748090721822991762574824757600091731436462508019e-35, /* 8, accPolyLowC7l */ 3.03819444444444440589503386718206456862390041351318e-02, /* 9, accPolyLowC9h, quickPolyLowC9h */ 3.85494105812324030564107341625454073114449944250081e-19, /* 10, accPolyLowC9m, quickPolyLowC9l */ -1.43865090242821346711405668429425189868490718470116e-36, /* 11, accPolyLowC9l */ 2.23721590909090918553037141691675060428678989410400e-02, /* 12, accPolyLowC11h, quickPolyLowC11h */ -9.46212831143868745925658651601400487408631908148174e-19, /* 13, accPolyLowC11m, quickPolyLowC11l */ 2.71756033709005426155900473576766627205226477546134e-36, /* 14, accPolyLowC11l */ 1.73527644230769238775646812200648128055036067962646e-02, /* 15, accPolyLowC13h, quickPolyLowC13h */ -8.00631194349979385750725428497500824341216859291999e-19, /* 16, accPolyLowC13m */ 1.39648437500000006938893903907228377647697925567627e-02, /* 17, accPolyLowC15h, quickPolyLowC15h */ -6.96640576418186252434826298980545123112053091491650e-19, /* 18, accPolyLowC15m */ 1.15518008961397068007359578700743441004306077957153e-02, /* 19, accPolyLowC17h, quickPolyLowC17h */ -4.10583074045422929898575008733550170923265860856307e-19, /* 20, accPolyLowC17m */ 9.76160952919401074534544449079476180486381053924561e-03, /* 21, accPolyLowC19h, quickPolyLowC19h */ 3.58257464358998522024321439568214748872569190564464e-19, /* 22, accPolyLowC19m */ 8.39033580962353364718353532225592061877250671386719e-03, /* 23, accPolyLowC21h, quickPolyLowC21h */ 7.09494992486164270601178799400238696830257336508353e-20, /* 24, accPolyLowC21m */ 7.31252587309846099200560942676929698791354894638062e-03, /* 25, accPolyLowC23h */ 3.10147942381298802750887889395221073583507364742961e-19, /* 26, accPolyLowC23m */ 6.44721034012319445943850482194648066069930791854858e-03, /* 27, accPolyLowC25h */ 5.74003646399263555560876781669321644585579633712769e-03, /* 28, accPolyLowC27h */ 5.15334845775329911110596015078044729307293891906738e-03, /* 29, accPolyLowC29h */ 4.65922376559379288613049752143524528946727514266968e-03, /* 30, accPolyLowC31h */ 4.25648267385331235956869022629689425230026245117188e-03, /* 31, accPolyLowC33h */ 3.70384206863821549560178425508638611063361167907715e-03, /* 32, accPolyLowC35h */ 4.76149788232017000255691385746104060672223567962646e-03, /* 33, accPolyLowC37h */ 1.01858540186370637827710736169938902993812548606460e+00, /* 34, RN rounding constant quick poly low*/ 9.99456520626465193846360776661410034560333454445527e-19, /* 35, RD rounding constant quick poly low*/ 2.42358565330489938993707710324088111519813537597656e-01, /* 36, midpoint in interval 2*/ 2.44796158322043572175275016888917889446020126342773e-01, /* 37, accPolyMid2C0h, quickPolyMid2C0h */ -7.80764437719474476036120943295127199090063761923808e-18, /* 38, accPolyMid2C0m, quickPolyMid2C0l */ 1.03072939530366736171629327145637944340705871582031e+00, /* 39, accPolyMid2C1h, quickPolyMid2C1h */ -8.85738929015520959086405013050480695702241994387953e-17, /* 40, accPolyMid2C1m, quickPolyMid2C1l */ -3.43332793693232296155057781643135490790330671255580e-33, /* 41, accPolyMid2C1l */ 1.32697384480218755209435244069027248769998550415039e-01, /* 42, accPolyMid2C2h, quickPolyMid2C2h */ -3.05519908299053827321743308736081906443885446585898e-18, /* 43, accPolyMid2C2m, quickPolyMid2C2l */ 1.84968471282800310046349200266639560111473343387153e-34, /* 44, accPolyMid2C2l */ 2.16675601140875473404889817174989730119705200195312e-01, /* 45, accPolyMid2C3h, quickPolyMid2C3h */ -1.09855192148394476119822843562855651270724326884774e-18, /* 46, accPolyMid2C3m, quickPolyMid2C3l */ 1.30965185306611444030805369954695892224998714815939e-35, /* 47, accPolyMid2C3l */ 1.16730419643667523987851097899692831560969352722168e-01, /* 48, accPolyMid2C4h, quickPolyMid2C4h */ 4.87619704882669077472238320833491156897798846867617e-18, /* 49, accPolyMid2C4m, quickPolyMid2C4l */ 2.44421677078199513698242322477237313066476585423275e-34, /* 50, accPolyMid2C4l */ 1.45667026718228842518954024853883311152458190917969e-01, /* 51, accPolyMid2C5h, quickPolyMid2C5h */ 5.36594969153474426628449995112694156468179831261122e-19, /* 52, accPolyMid2C5m, quickPolyMid2C5l */ 8.48516201835513020738766305454795330663195678132569e-36, /* 53, accPolyMid2C5l */ 1.22401266966440255834491779296513414010405540466309e-01, /* 54, accPolyMid2C6h, quickPolyMid2C6h */ -2.20822551943355103564859204431825679093840107651564e-19, /* 55, accPolyMid2C6m, quickPolyMid2C6l */ -8.07441439403117291580512089023909180599052269668925e-36, /* 56, accPolyMid2C6l */ 1.41642750696223979067767118067422416061162948608398e-01, /* 57, accPolyMid2C7h, quickPolyMid2C7h */ 8.52401858052517523392878261510621535534995050169401e-18, /* 58, accPolyMid2C7m, quickPolyMid2C7l */ 1.42861418735328621343327881731966044753789901733398e-01, /* 59, accPolyMid2C8h, quickPolyMid2C8h */ -1.33006668328318919665132697553096363383321713310227e-17, /* 60, accPolyMid2C8m */ 1.63718343060216098283632391030550934374332427978516e-01, /* 61, accPolyMid2C9h, quickPolyMid2C9h */ 6.13394557799256408251130704849071363459255390907063e-18, /* 62, accPolyMid2C9m */ 1.79592723769284340340490757625957485288381576538086e-01, /* 63, accPolyMid2C10h, quickPolyMid2C10h */ -1.30198260064097970981442998070110461849845662150849e-17, /* 64, accPolyMid2C10m */ 2.07951828711086583734157784419949166476726531982422e-01, /* 65, accPolyMid2C11h, quickPolyMid2C11h */ -1.26159975996932877835486818675875580593424383227469e-17, /* 66, accPolyMid2C11m */ 2.38247271379822073145149374795437324792146682739258e-01, /* 67, accPolyMid2C12h, quickPolyMid2C12h */ 6.62361216505959744828122635016705548667940611263800e-18, /* 68, accPolyMid2C12m */ 2.79893913215572998076652311283396556973457336425781e-01, /* 69, accPolyMid2C13h, quickPolyMid2C13h */ -2.24149827195062967543013296493616902343167004009288e-17, /* 70, accPolyMid2C13m */ 3.28958991769599307097848850389709696173667907714844e-01, /* 71, accPolyMid2C14h, quickPolyMid2C14h */ -1.05211249452308945191032281708802957418482198191124e-17, /* 72, accPolyMid2C14m */ 3.91766249806127564436764032507198862731456756591797e-01, /* 73, accPolyMid2C15h */ -2.02194096713130520849748106020797136930683180643846e-17, /* 74, accPolyMid2C15m */ 4.68246642053942785377529389734263531863689422607422e-01, /* 75, accPolyMid2C16h */ 5.64148787932559847568825261987512931227684020996094e-01, /* 76, accPolyMid2C17h */ 6.82488400757435664800709673727396875619888305664062e-01, /* 77, accPolyMid2C18h */ 8.30182127559316640486031246837228536605834960937500e-01, /* 78, accPolyMid2C19h */ 1.01367533043020308092252435017144307494163513183594e+00, /* 79, accPolyMid2C20h */ 1.24281078928695176699648072826676070690155029296875e+00, /* 80, accPolyMid2C21h */ 1.52877587404435177909078902303008362650871276855469e+00, /* 81, accPolyMid2C22h */ 1.88667637664635656769007709954166784882545471191406e+00, /* 82, accPolyMid2C23h */ 2.33494551765288571587575461308006197214126586914062e+00, /* 83, accPolyMid2C24h */ 2.89749244536000327698843648249749094247817993164062e+00, /* 84, accPolyMid2C25h */ 3.60426450740106130155027130967937409877777099609375e+00, /* 85, accPolyMid2C26h */ 4.49361107526955017021919047692790627479553222656250e+00, /* 86, accPolyMid2C27h */ 5.61406255377128715622347954194992780685424804687500e+00, /* 87, accPolyMid2C28h */ 7.02754870503224271516273802262730896472930908203125e+00, /* 88, accPolyMid2C29h */ 8.81280667340759649164283473510295152664184570312500e+00, /* 89, accPolyMid2C30h */ 1.10704407960507111852166417520493268966674804687500e+01, /* 90, accPolyMid2C31h */ 1.39282518419665830577969245496205985546112060546875e+01, /* 91, accPolyMid2C32h */ 1.75308292529565719064521545078605413436889648437500e+01, /* 92, accPolyMid2C33h */ 2.21169075633838900785121950320899486541748046875000e+01, /* 93, accPolyMid2C34h */ 2.93386309556562245859367976663634181022644042968750e+01, /* 94, accPolyMid2C35h */ 1.01683357072532350635299322879618933637376890680614e+00, /* 95, RN rounding constant quick poly middle 2*/ 9.05249299973766985475925981961240072045593429326050e-19, /* 96, RD rounding constant quick poly middle 2*/ 3.51339936256424290039745983449392952024936676025391e-01, /* 97, midpoint in interval 3*/ 3.59001896704258527392994437832385301589965820312500e-01, /* 98, accPolyMid3C0h, quickPolyMid3C0h */ 7.25234535377983806008993135801969933842904099082037e-20, /* 99, accPolyMid3C0m, quickPolyMid3C0l */ 1.06809311097735548656828541425056755542755126953125e+00, /* 100, accPolyMid3C1h, quickPolyMid3C1h */ 8.06569140638077604165107730077659782400969546746483e-17, /* 101, accPolyMid3C1m, quickPolyMid3C1l */ -5.04406564603486171676187418521136112402329884904383e-33, /* 102, accPolyMid3C1l */ 2.14054747447713134000935042422497645020484924316406e-01, /* 103, accPolyMid3C2h, quickPolyMid3C2h */ 9.76056255097027764696827253384241478483311533093656e-18, /* 104, accPolyMid3C2m, quickPolyMid3C2l */ -7.76857615284538540734861101748988881714638362963881e-35, /* 105, accPolyMid3C2l */ 2.88880884175958529969108212753781117498874664306641e-01, /* 106, accPolyMid3C3h, quickPolyMid3C3h */ 2.22181200821645624650165429361546283225838059740631e-17, /* 107, accPolyMid3C3m, quickPolyMid3C3l */ -1.14368045348414878337189405350442917783836545775590e-33, /* 108, accPolyMid3C3l */ 2.26134851489718013972662902233423665165901184082031e-01, /* 109, accPolyMid3C4h, quickPolyMid3C4h */ -8.04753534970505104224953947907869405284151781535028e-18, /* 110, accPolyMid3C4m, quickPolyMid3C4l */ 4.22557384286705919324956002465313457843707737945963e-34, /* 111, accPolyMid3C4l */ 2.75196923580072527748541233449941501021385192871094e-01, /* 112, accPolyMid3C5h, quickPolyMid3C5h */ -1.17338666986909136966078634618924264888220762222419e-18, /* 113, accPolyMid3C5m, quickPolyMid3C5l */ -4.68757737099062213529607300203132104484914350463871e-35, /* 114, accPolyMid3C5l */ 3.03044495521890500100425924756564199924468994140625e-01, /* 115, accPolyMid3C6h, quickPolyMid3C6h */ -2.27411416594910816511289518687103845115091724313899e-17, /* 116, accPolyMid3C6m, quickPolyMid3C6l */ 2.34762544350785348445971766662785127027332739123595e-34, /* 117, accPolyMid3C6l */ 3.77749573081396394780284708758699707686901092529297e-01, /* 118, accPolyMid3C7h, quickPolyMid3C7h */ 7.89247891096042648893247867692397394548591651092283e-18, /* 119, accPolyMid3C7m, quickPolyMid3C7l */ 4.68287147615184806692667507377336733043193817138672e-01, /* 120, accPolyMid3C8h, quickPolyMid3C8h */ 1.75668374099909928545987828472120658936175220036884e-17, /* 121, accPolyMid3C8m */ 6.06111063535901939403061078337486833333969116210938e-01, /* 122, accPolyMid3C9h, quickPolyMid3C9h */ 1.72730090011832304135009947489517024111046794620020e-17, /* 123, accPolyMid3C9m */ 7.92895790821915635859795656870119273662567138671875e-01, /* 124, accPolyMid3C10h, quickPolyMid3C10h */ 4.98295614974968378037947765656866085023078681863398e-17, /* 125, accPolyMid3C10m */ 1.05810730062141522545005045685684308409690856933594e+00, /* 126, accPolyMid3C11h, quickPolyMid3C11h */ 8.05577049603995800072512132781137905047707942749781e-17, /* 127, accPolyMid3C11m */ 1.42745521004660447239587028889218345284461975097656e+00, /* 128, accPolyMid3C12h, quickPolyMid3C12h */ -4.55985728468522936328504707804310204497673421624067e-17, /* 129, accPolyMid3C12m */ 1.94854789175488596342233904579188674688339233398438e+00, /* 130, accPolyMid3C13h, quickPolyMid3C13h */ 3.84783704422594121999348237839996274693704597202448e-17, /* 131, accPolyMid3C13m */ 2.68312408725385909136207374103832989931106567382812e+00, /* 132, accPolyMid3C14h, quickPolyMid3C14h */ -3.56068007836116005017028996147996121343986693197868e-17, /* 133, accPolyMid3C14m */ 3.72473732217660824517224682494997978210449218750000e+00, /* 134, accPolyMid3C15h */ -5.87298986037438700709055565377465605786708153319628e-17, /* 135, accPolyMid3C15m */ 5.20573944915823361156981263775378465652465820312500e+00, /* 136, accPolyMid3C16h */ 7.31989734855592644180433126166462898254394531250000e+00, /* 137, accPolyMid3C17h */ 1.03473141302088169624084912356920540332794189453125e+01, /* 138, accPolyMid3C18h */ 1.46964937699531184023271634941920638084411621093750e+01, /* 139, accPolyMid3C19h */ 2.09624579630017748854697856586426496505737304687500e+01, /* 140, accPolyMid3C20h */ 3.00147629377676423700904706493020057678222656250000e+01, /* 141, accPolyMid3C21h */ 4.31254748908798717366153141483664512634277343750000e+01, /* 142, accPolyMid3C22h */ 6.21591110441626426563743734732270240783691406250000e+01, /* 143, accPolyMid3C23h */ 8.98523523311889533715657307766377925872802734375000e+01, /* 144, accPolyMid3C24h */ 1.30228138287161243624723283573985099792480468750000e+02, /* 145, accPolyMid3C25h */ 1.89208159704443204418566892854869365692138671875000e+02, /* 146, accPolyMid3C26h */ 2.75520543663640125942038139328360557556152343750000e+02, /* 147, accPolyMid3C27h */ 4.02045721388318213485035812482237815856933593750000e+02, /* 148, accPolyMid3C28h */ 5.87814144421144646912580356001853942871093750000000e+02, /* 149, accPolyMid3C29h */ 8.60974558223577218996069859713315963745117187500000e+02, /* 150, accPolyMid3C30h */ 1.26323081508058703548158518970012664794921875000000e+03, /* 151, accPolyMid3C31h */ 1.85633061099108476810215506702661514282226562500000e+03, /* 152, accPolyMid3C32h */ 2.72831792235129523760406300425529479980468750000000e+03, /* 153, accPolyMid3C33h */ 4.02017366871190233723609708249568939208984375000000e+03, /* 154, accPolyMid3C34h */ 6.26169941241203287063399329781532287597656250000000e+03, /* 155, accPolyMid3C35h */ 1.01852226987326804088489911214053254620571040933433e+00, /* 156, RN rounding constant quick poly middle 3*/ 9.96061507703610851328544443284249848383807032724405e-19, /* 157, RD rounding constant quick poly middle 3*/ 4.48084712028450460330475380033021792769432067871094e-01, /* 158, midpoint in interval 4*/ 4.64621784296265272207193675058078952133655548095703e-01, /* 159, accPolyMid4C0h, quickPolyMid4C0h */ 5.46463478154141631687941857567549378870836612391668e-19, /* 160, accPolyMid4C0m, quickPolyMid4C0l */ 1.11857936563137916330390453367726877331733703613281e+00, /* 161, accPolyMid4C1h, quickPolyMid4C1h */ -7.52084787570938032181667127523977366268049041253541e-17, /* 162, accPolyMid4C1m, quickPolyMid4C1l */ -2.09600667283052949148765250630641631769479132030207e-33, /* 163, accPolyMid4C1l */ 3.13567137932624417917537584798992611467838287353516e-01, /* 164, accPolyMid4C2h, quickPolyMid4C2h */ -4.41710443385272069717070263863657699262849649693148e-18, /* 165, accPolyMid4C2m, quickPolyMid4C2l */ -1.66857777421172326251970639278136259133415308172276e-34, /* 166, accPolyMid4C2l */ 4.09066962553200574870260197712923400104045867919922e-01, /* 167, accPolyMid4C3h, quickPolyMid4C3h */ -1.77243968292023797220078441566237340174840093946990e-17, /* 168, accPolyMid4C3m, quickPolyMid4C3l */ 1.04993340346633219191766382762445818927028795922212e-33, /* 169, accPolyMid4C3l */ 4.17460970109683637829789404349867254495620727539062e-01, /* 170, accPolyMid4C4h, quickPolyMid4C4h */ 1.39418041407988360348752433713233257018150500547568e-17, /* 171, accPolyMid4C4m, quickPolyMid4C4l */ 1.44515287253394191526867297316859284672731580248765e-33, /* 172, accPolyMid4C4l */ 5.57995436127318722441259524202905595302581787109375e-01, /* 173, accPolyMid4C5h, quickPolyMid4C5h */ 4.36037702989507667583407786816694605825360677277616e-17, /* 174, accPolyMid4C5m, quickPolyMid4C5l */ -1.19172250052693786129959971158569652849573416545361e-33, /* 175, accPolyMid4C5l */ 7.47841169204912281642805282899644225835800170898438e-01, /* 176, accPolyMid4C6h, quickPolyMid4C6h */ -6.76313448015089834151929838334258544557222273487418e-18, /* 177, accPolyMid4C6m, quickPolyMid4C6l */ -3.47721914174083040302762713955940912153154957518196e-34, /* 178, accPolyMid4C6l */ 1.07444730844797153856973181973444297909736633300781e+00, /* 179, accPolyMid4C7h, quickPolyMid4C7h */ 7.55340134261966180374112563614849022138812950329448e-17, /* 180, accPolyMid4C7m, quickPolyMid4C7l */ 1.58041645549890685806815326941432431340217590332031e+00, /* 181, accPolyMid4C8h, quickPolyMid4C8h */ 4.80894355381610072868748091065730787867334028863435e-17, /* 182, accPolyMid4C8m */ 2.39169226022640657447482226416468620300292968750000e+00, /* 183, accPolyMid4C9h, quickPolyMid4C9h */ 1.26753183127964275508490032426937968441812593935712e-16, /* 184, accPolyMid4C9m */ 3.68572936227336489523054297023918479681015014648438e+00, /* 185, accPolyMid4C10h, quickPolyMid4C10h */ -1.41660589025860946857878120315437315934718409357086e-16, /* 186, accPolyMid4C10m */ 5.77285150262833735013145997072570025920867919921875e+00, /* 187, accPolyMid4C11h, quickPolyMid4C11h */ -2.16740363176565772841534018366824459554498708631527e-16, /* 188, accPolyMid4C11m */ 9.15766592727227646264509530737996101379394531250000e+00, /* 189, accPolyMid4C12h, quickPolyMid4C12h */ 4.37180613264180824186691777532090455983551321485214e-16, /* 190, accPolyMid4C12m */ 1.46862422532599090629901184001937508583068847656250e+01, /* 191, accPolyMid4C13h, quickPolyMid4C13h */ 7.89614550363306335166404831558856161121412865593061e-16, /* 192, accPolyMid4C13m */ 2.37692237950290667924946319544687867164611816406250e+01, /* 193, accPolyMid4C14h, quickPolyMid4C14h */ -3.50255834101571646092598176937562449597971181913456e-16, /* 194, accPolyMid4C14m */ 3.87753699929054533868111320771276950836181640625000e+01, /* 195, accPolyMid4C15h */ 5.67060321723933067329766411373458413340348986762113e-16, /* 196, accPolyMid4C15m */ 6.36909499334141528947839105967432260513305664062500e+01, /* 197, accPolyMid4C16h */ 1.05248620915111246176820714026689529418945312500000e+02, /* 198, accPolyMid4C17h */ 1.74851057791898000459696049802005290985107421875000e+02, /* 199, accPolyMid4C18h */ 2.91864013611726591079786885529756546020507812500000e+02, /* 200, accPolyMid4C19h */ 4.89259682748188197365379892289638519287109375000000e+02, /* 201, accPolyMid4C20h */ 8.23309003242859603233227971941232681274414062500000e+02, /* 202, accPolyMid4C21h */ 1.39025484827954846878128591924905776977539062500000e+03, /* 203, accPolyMid4C22h */ 2.35504246227568182803224772214889526367187500000000e+03, /* 204, accPolyMid4C23h */ 4.00090205201026492431992664933204650878906250000000e+03, /* 205, accPolyMid4C24h */ 6.81504309301592911651823669672012329101562500000000e+03, /* 206, accPolyMid4C25h */ 1.16369648030766729789320379495620727539062500000000e+04, /* 207, accPolyMid4C26h */ 1.99154708390699779556598514318466186523437500000000e+04, /* 208, accPolyMid4C27h */ 3.41546126991757555515505373477935791015625000000000e+04, /* 209, accPolyMid4C28h */ 5.86883344113872444722801446914672851562500000000000e+04, /* 210, accPolyMid4C29h */ 1.01027682393336552195250988006591796875000000000000e+05, /* 211, accPolyMid4C30h */ 1.74209975080082920612767338752746582031250000000000e+05, /* 212, accPolyMid4C31h */ 3.00874278784890950191766023635864257812500000000000e+05, /* 213, accPolyMid4C32h */ 5.19633023773909430019557476043701171875000000000000e+05, /* 214, accPolyMid4C33h */ 8.99866392232198733836412429809570312500000000000000e+05, /* 215, accPolyMid4C34h */ 1.65235977806337876245379447937011718750000000000000e+06, /* 216, accPolyMid4C35h */ 1.01865623563637326825520446919499828081810155036594e+00, /* 217, RN rounding constant quick poly middle 4*/ 1.00326570788492020170486150590740535840759810902416e-18, /* 218, RD rounding constant quick poly middle 4*/ 5.31445860862679642089290155126946046948432922363281e-01, /* 219, midpoint in interval 5*/ 5.60306504963744567149319664167705923318862915039062e-01, /* 220, accPolyMid5C0h, quickPolyMid5C0h */ -1.08630439217163180480513733763948654678554607776160e-20, /* 221, accPolyMid5C0m, quickPolyMid5C0l */ 1.18050895658762322604218297783518210053443908691406e+00, /* 222, accPolyMid5C1h, quickPolyMid5C1h */ -3.44936676454714048889716658635127499762917269870727e-17, /* 223, accPolyMid5C1m, quickPolyMid5C1l */ -2.49069456197248953275668118371299181194287558355700e-33, /* 224, accPolyMid5C1l */ 4.37156452058995781406736114149680361151695251464844e-01, /* 225, accPolyMid5C2h, quickPolyMid5C2h */ 4.12350542001181384975859432610288269290340424486530e-18, /* 226, accPolyMid5C2m, quickPolyMid5C2l */ 2.73553164822567581206451159459555826955342358406517e-34, /* 227, accPolyMid5C2l */ 5.97961581435785594074161508615361526608467102050781e-01, /* 228, accPolyMid5C3h, quickPolyMid5C3h */ 1.15786235462823532242451850040378867919657187923266e-17, /* 229, accPolyMid5C3m, quickPolyMid5C3l */ 6.70476163820618923333949946465040969013104876616743e-34, /* 230, accPolyMid5C3l */ 7.56654591443305823972309553937520831823348999023438e-01, /* 231, accPolyMid5C4h, quickPolyMid5C4h */ 5.63361768523770903650379304980880430544181403662856e-18, /* 232, accPolyMid5C4m, quickPolyMid5C4l */ 3.52518369310847108975654467573884198459173315811765e-35, /* 233, accPolyMid5C4l */ 1.15954888868330963092034835426602512598037719726562e+00, /* 234, accPolyMid5C5h, quickPolyMid5C5h */ -2.13088606479945404910718732635657047999226786224539e-17, /* 235, accPolyMid5C5m, quickPolyMid5C5l */ 1.01155988751211667735165829625236622533486662424891e-33, /* 236, accPolyMid5C5l */ 1.85057068266552660062984614341985434293746948242188e+00, /* 237, accPolyMid5C6h, quickPolyMid5C6h */ -4.13756595773451122099466439202037064387337671566669e-18, /* 238, accPolyMid5C6m, quickPolyMid5C6l */ 3.02843501360506226132120912500822054694900989592884e-34, /* 239, accPolyMid5C6l */ 3.11563743870884257702869035711046308279037475585938e+00, /* 240, accPolyMid5C7h, quickPolyMid5C7h */ -5.06302300821373603583774676357699499992045551579126e-17, /* 241, accPolyMid5C7m, quickPolyMid5C7l */ 5.40761322601296168244289219728671014308929443359375e+00, /* 242, accPolyMid5C8h, quickPolyMid5C8h */ 2.97487923575735998744301300115136435889001285861472e-16, /* 243, accPolyMid5C8m */ 9.62995354897343425193412258522585034370422363281250e+00, /* 244, accPolyMid5C9h, quickPolyMid5C9h */ 4.55607422255092503960684830342258039056296500032145e-16, /* 245, accPolyMid5C9m */ 1.74836661195630966858516330830752849578857421875000e+01, /* 246, accPolyMid5C10h, quickPolyMid5C10h */ 1.43590320985440421817158000882140332196152266840822e-15, /* 247, accPolyMid5C10m */ 3.22483723360128990975681517738848924636840820312500e+01, /* 248, accPolyMid5C11h, quickPolyMid5C11h */ -3.34403568343416729924334128939506733422536740966968e-15, /* 249, accPolyMid5C11m */ 6.02553715792408368656651873607188463211059570312500e+01, /* 250, accPolyMid5C12h, quickPolyMid5C12h */ 3.10919444878682139369989784864394611534570535618660e-15, /* 251, accPolyMid5C12m */ 1.13813051318643047693512926343828439712524414062500e+02, /* 252, accPolyMid5C13h, quickPolyMid5C13h */ -1.71698317353737059559128975443274184793142084909379e-15, /* 253, accPolyMid5C13m */ 2.16961936728312849709254805929958820343017578125000e+02, /* 254, accPolyMid5C14h, quickPolyMid5C14h */ 8.27079867974059458294192504441253562124411295719550e-15, /* 255, accPolyMid5C14m */ 4.16880179488225451223115669563412666320800781250000e+02, /* 256, accPolyMid5C15h */ -2.58735460985196142054738964992050729251298751831811e-14, /* 257, accPolyMid5C15m */ 8.06537874996876666955358814448118209838867187500000e+02, /* 258, accPolyMid5C16h */ 1.56984649251497876321082003414630889892578125000000e+03, /* 259, accPolyMid5C17h */ 3.07188686658870074097649194300174713134765625000000e+03, /* 260, accPolyMid5C18h */ 6.03970064736507720226654782891273498535156250000000e+03, /* 261, accPolyMid5C19h */ 1.19254227020427806564839556813240051269531250000000e+04, /* 262, accPolyMid5C20h */ 2.36373073951149926870130002498626708984375000000000e+04, /* 263, accPolyMid5C21h */ 4.70144622759458434302359819412231445312500000000000e+04, /* 264, accPolyMid5C22h */ 9.38077422737224260345101356506347656250000000000000e+04, /* 265, accPolyMid5C23h */ 1.87716130978103727102279663085937500000000000000000e+05, /* 266, accPolyMid5C24h */ 3.76631599838992522563785314559936523437500000000000e+05, /* 267, accPolyMid5C25h */ 7.57518066926909843459725379943847656250000000000000e+05, /* 268, accPolyMid5C26h */ 1.52703698454281571321189403533935546875000000000000e+06, /* 269, accPolyMid5C27h */ 3.08471154002460883930325508117675781250000000000000e+06, /* 270, accPolyMid5C28h */ 6.24343584097426943480968475341796875000000000000000e+06, /* 271, accPolyMid5C29h */ 1.26595813738393746316432952880859375000000000000000e+07, /* 272, accPolyMid5C30h */ 2.57133891378295645117759704589843750000000000000000e+07, /* 273, accPolyMid5C31h */ 5.23093272367429584264755249023437500000000000000000e+07, /* 274, accPolyMid5C32h */ 1.06415184183835312724113464355468750000000000000000e+08, /* 275, accPolyMid5C33h */ 2.17067016530691206455230712890625000000000000000000e+08, /* 276, accPolyMid5C34h */ 4.69394759797544836997985839843750000000000000000000e+08, /* 277, accPolyMid5C35h */ 1.01546394178491537056416717033435295842436071964172e+00, /* 278, RN rounding constant quick poly middle 5*/ 8.45008379631082379626014328492746516799371469048044e-19, /* 279, RD rounding constant quick poly middle 5*/ 6.04673624038476131836716831458033993840217590332031e-01, /* 280, midpoint in interval 6*/ 6.49356027282211423212743284238968044519424438476562e-01, /* 281, accPolyMid6C0h, quickPolyMid6C0h */ -1.25840412187919035681267493345871686399113240956856e-20, /* 282, accPolyMid6C0m, quickPolyMid6C0l */ 1.25553477869155938329015498311491683125495910644531e+00, /* 283, accPolyMid6C1h, quickPolyMid6C1h */ 5.00523898265236280615595780032763663310079252366513e-17, /* 284, accPolyMid6C1m, quickPolyMid6C1l */ 2.70452092654099855316456962656407597917508288905533e-33, /* 285, accPolyMid6C1l */ 5.98380278107774499218862729321699589490890502929688e-01, /* 286, accPolyMid6C2h, quickPolyMid6C2h */ 3.73915919375620074681511372815883902051293891666555e-18, /* 287, accPolyMid6C2m, quickPolyMid6C2l */ 1.02836809807342008154037540277599096854529496615931e-34, /* 288, accPolyMid6C2l */ 9.00232892880871604646131345361936837434768676757812e-01, /* 289, accPolyMid6C3h, quickPolyMid6C3h */ -1.70995008965645412422671790545314082452432030961170e-17, /* 290, accPolyMid6C3m, quickPolyMid6C3l */ 1.26596066229657064182610642365044212709535948254084e-33, /* 291, accPolyMid6C3l */ 1.38703629702026587366958665370475500822067260742188e+00, /* 292, accPolyMid6C4h, quickPolyMid6C4h */ 3.98819447215487913236315415179165676291502931117595e-17, /* 293, accPolyMid6C4m, quickPolyMid6C4l */ -6.55797179513908183565792353381331895988112885430413e-34, /* 294, accPolyMid6C4l */ 2.48954277308397298185127510805614292621612548828125e+00, /* 295, accPolyMid6C5h, quickPolyMid6C5h */ 9.74092851599686234698415065747156883706428073441651e-17, /* 296, accPolyMid6C5m, quickPolyMid6C5l */ 1.56743989943601791748641837689163542493404742470630e-33, /* 297, accPolyMid6C5l */ 4.72562522409656082800211152061820030212402343750000e+00, /* 298, accPolyMid6C6h, quickPolyMid6C6h */ 6.88679830761278595465306080986277758416307765996557e-18, /* 299, accPolyMid6C6m, quickPolyMid6C6l */ -9.47395090301458455484031652124848364407920780715874e-35, /* 300, accPolyMid6C6l */ 9.41432957016690785678747488418594002723693847656250e+00, /* 301, accPolyMid6C7h, quickPolyMid6C7h */ 8.62157085484702984705473460305131094967840256568931e-16, /* 302, accPolyMid6C7m, quickPolyMid6C7l */ 1.93709907584273430813937011407688260078430175781250e+01, /* 303, accPolyMid6C8h, quickPolyMid6C8h */ -1.40839418808440953673043657798045432960211596437085e-16, /* 304, accPolyMid6C8m */ 4.08734031574560177091370860580354928970336914062500e+01, /* 305, accPolyMid6C9h, quickPolyMid6C9h */ -2.98667469102598629922297846034715799734023919430673e-16, /* 306, accPolyMid6C9m */ 8.79464044588732321017232607118785381317138671875000e+01, /* 307, accPolyMid6C10h, quickPolyMid6C10h */ 3.61512961738881992095483091045503569454095245351219e-16, /* 308, accPolyMid6C10m */ 1.92241339189846911494896630756556987762451171875000e+02, /* 309, accPolyMid6C11h, quickPolyMid6C11h */ 6.61037281166591217605498682969545683054486597679533e-15, /* 310, accPolyMid6C11m */ 4.25700873706194784062972757965326309204101562500000e+02, /* 311, accPolyMid6C12h, quickPolyMid6C12h */ -6.48144847243744916328196408044704617877580310816854e-15, /* 312, accPolyMid6C12m */ 9.52958531675870517574367113411426544189453125000000e+02, /* 313, accPolyMid6C13h, quickPolyMid6C13h */ -3.41559781098088121115265032630996540232080319228480e-15, /* 314, accPolyMid6C13m */ 2.15300037043921429358306340873241424560546875000000e+03, /* 315, accPolyMid6C14h, quickPolyMid6C14h */ -4.69254271757335955512545725611899433103182087412275e-14, /* 316, accPolyMid6C14m */ 4.90290875724837587767979130148887634277343750000000e+03, /* 317, accPolyMid6C15h */ -4.54544125910656089453646656943432828883091406657613e-13, /* 318, accPolyMid6C15m */ 1.12422266608999743766617029905319213867187500000000e+04, /* 319, accPolyMid6C16h */ 2.59341556033402121101971715688705444335937500000000e+04, /* 320, accPolyMid6C17h */ 6.01463753209276546840555965900421142578125000000000e+04, /* 321, accPolyMid6C18h */ 1.40155647347781836288049817085266113281250000000000e+05, /* 322, accPolyMid6C19h */ 3.27990517748617625329643487930297851562500000000000e+05, /* 323, accPolyMid6C20h */ 7.70511269948243047110736370086669921875000000000000e+05, /* 324, accPolyMid6C21h */ 1.81638100581354671157896518707275390625000000000000e+06, /* 325, accPolyMid6C22h */ 4.29545835214607417583465576171875000000000000000000e+06, /* 326, accPolyMid6C23h */ 1.01875211922164466232061386108398437500000000000000e+07, /* 327, accPolyMid6C24h */ 2.42259292905952110886573791503906250000000000000000e+07, /* 328, accPolyMid6C25h */ 5.77502706188629567623138427734375000000000000000000e+07, /* 329, accPolyMid6C26h */ 1.37977551882563471794128417968750000000000000000000e+08, /* 330, accPolyMid6C27h */ 3.30348046445899784564971923828125000000000000000000e+08, /* 331, accPolyMid6C28h */ 7.92463843911740779876708984375000000000000000000000e+08, /* 332, accPolyMid6C29h */ 1.90447027047677397727966308593750000000000000000000e+09, /* 333, accPolyMid6C30h */ 4.58479383261657714843750000000000000000000000000000e+09, /* 334, accPolyMid6C31h */ 1.10545369624155406951904296875000000000000000000000e+10, /* 335, accPolyMid6C32h */ 2.66385731955786666870117187500000000000000000000000e+10, /* 336, accPolyMid6C33h */ 6.43976383194783477783203125000000000000000000000000e+10, /* 337, accPolyMid6C34h */ 1.66775070729799957275390625000000000000000000000000e+11, /* 338, accPolyMid6C35h */ 1.02865713098129091896393402230525290748739350993607e+00, /* 339, RN rounding constant quick poly middle 6*/ 1.54107813388901044122294580378974284123051351850249e-18, /* 340, RD rounding constant quick poly middle 6*/ 6.67959213256959061233430929860332980751991271972656e-01, /* 341, midpoint in interval 7*/ 7.31463137281961883751080222282325848937034606933594e-01, /* 342, accPolyMid7C0h, quickPolyMid7C0h */ 8.54719742452471207894475172794621662948903828511743e-18, /* 343, accPolyMid7C0m, quickPolyMid7C0l */ 1.34372862717732943771409281907835975289344787597656e+00, /* 344, accPolyMid7C1h, quickPolyMid7C1h */ -9.37080278359462608557638680730489336344772507156678e-17, /* 345, accPolyMid7C1m, quickPolyMid7C1l */ -3.73014429525577422762683976038701673929582903516469e-33, /* 346, accPolyMid7C1l */ 8.10316454021746457314634426438715308904647827148438e-01, /* 347, accPolyMid7C2h, quickPolyMid7C2h */ 2.83724520944754281479328686665519600224801269794297e-17, /* 348, accPolyMid7C2m, quickPolyMid7C2l */ 5.82045706927347254178829289360700371297572159541923e-34, /* 349, accPolyMid7C2l */ 1.38167386397960734178980146680260077118873596191406e+00, /* 350, accPolyMid7C3h, quickPolyMid7C3h */ 2.02013329353188582679931981349209152232167295906717e-17, /* 351, accPolyMid7C3m, quickPolyMid7C3l */ 6.40114855650846168897999343294667085370954557070054e-34, /* 352, accPolyMid7C3l */ 2.57070122683855739609271040535531938076019287109375e+00, /* 353, accPolyMid7C4h, quickPolyMid7C4h */ -1.97101208773651620042078427599655545421327570922328e-16, /* 354, accPolyMid7C4m, quickPolyMid7C4l */ -5.16498810795509657208158829628186048443297866770160e-33, /* 355, accPolyMid7C4l */ 5.46327133150128840810566543950699269771575927734375e+00, /* 356, accPolyMid7C5h, quickPolyMid7C5h */ 4.46002282634806142830756936399426613343260291679165e-17, /* 357, accPolyMid7C5m, quickPolyMid7C5l */ 1.00630542800586945033209683978834296850153546719007e-33, /* 358, accPolyMid7C5l */ 1.23592045140328163910226066946052014827728271484375e+01, /* 359, accPolyMid7C6h, quickPolyMid7C6h */ -6.31168277706663387163074158423931222709606927382536e-16, /* 360, accPolyMid7C6m, quickPolyMid7C6l */ -2.86577343636081880556771704346742846876298657614067e-32, /* 361, accPolyMid7C6l */ 2.92955857889283457495821494376286864280700683593750e+01, /* 362, accPolyMid7C7h, quickPolyMid7C7h */ 1.68044477586948138119056363287999050823887212287311e-15, /* 363, accPolyMid7C7m, quickPolyMid7C7l */ 7.17613428086569200559097225777804851531982421875000e+01, /* 364, accPolyMid7C8h, quickPolyMid7C8h */ 6.23119826880857970524569208326049427014155061843592e-15, /* 365, accPolyMid7C8m */ 1.80247733513940403327069361694157123565673828125000e+02, /* 366, accPolyMid7C9h, quickPolyMid7C9h */ 5.02375884230076452151557056132473497202104361844532e-15, /* 367, accPolyMid7C9m */ 4.61706463186508131002483423799276351928710937500000e+02, /* 368, accPolyMid7C10h, quickPolyMid7C10h */ 1.87384815286128587607402694756722954854896712184598e-14, /* 369, accPolyMid7C10m */ 1.20148795335111071835854090750217437744140625000000e+03, /* 370, accPolyMid7C11h, quickPolyMid7C11h */ 2.60459063066423653270039910766913797650205005668189e-14, /* 371, accPolyMid7C11m */ 3.16745162323707290852325968444347381591796875000000e+03, /* 372, accPolyMid7C12h, quickPolyMid7C12h */ -2.76092355337723539107271551080313829589234133482512e-14, /* 373, accPolyMid7C12m */ 8.44145526317249823478050529956817626953125000000000e+03, /* 374, accPolyMid7C13h, quickPolyMid7C13h */ -2.33235416338613018856460888065680920494017469568604e-13, /* 375, accPolyMid7C13m */ 2.27054147369064739905297756195068359375000000000000e+04, /* 376, accPolyMid7C14h, quickPolyMid7C14h */ -3.76196185348520617410321355221587231933578349130087e-13, /* 377, accPolyMid7C14m */ 6.15579784849813586333766579627990722656250000000000e+04, /* 378, accPolyMid7C15h */ -5.34885488214934542022410271185570626302323293810304e-13, /* 379, accPolyMid7C15m */ 1.68046954551722796168178319931030273437500000000000e+05, /* 380, accPolyMid7C16h */ 4.61530358172978565562516450881958007812500000000000e+05, /* 381, accPolyMid7C17h */ 1.27435135728149255737662315368652343750000000000000e+06, /* 382, accPolyMid7C18h */ 3.53543876571432314813137054443359375000000000000000e+06, /* 383, accPolyMid7C19h */ 9.85027146846828423440456390380859375000000000000000e+06, /* 384, accPolyMid7C20h */ 2.75499693650120757520198822021484375000000000000000e+07, /* 385, accPolyMid7C21h */ 7.73223713417402952909469604492187500000000000000000e+07, /* 386, accPolyMid7C22h */ 2.17703077316092193126678466796875000000000000000000e+08, /* 387, accPolyMid7C23h */ 6.14725288059689402580261230468750000000000000000000e+08, /* 388, accPolyMid7C24h */ 1.74040800223112154006958007812500000000000000000000e+09, /* 389, accPolyMid7C25h */ 4.93950269498267459869384765625000000000000000000000e+09, /* 390, accPolyMid7C26h */ 1.40506579253189964294433593750000000000000000000000e+10, /* 391, accPolyMid7C27h */ 4.00515555251962203979492187500000000000000000000000e+10, /* 392, accPolyMid7C28h */ 1.14389701296316925048828125000000000000000000000000e+11, /* 393, accPolyMid7C29h */ 3.27296809500310974121093750000000000000000000000000e+11, /* 394, accPolyMid7C30h */ 9.38089913584087280273437500000000000000000000000000e+11, /* 395, accPolyMid7C31h */ 2.69293079636161279296875000000000000000000000000000e+12, /* 396, accPolyMid7C32h */ 7.72833097677600292968750000000000000000000000000000e+12, /* 397, accPolyMid7C33h */ 2.22444558194129648437500000000000000000000000000000e+13, /* 398, accPolyMid7C34h */ 6.82401753565838359375000000000000000000000000000000e+13, /* 399, accPolyMid7C35h */ 1.01768360014066378266267100775040494087129736780625e+00, /* 400, RN rounding constant quick poly middle 7*/ 9.50960845417677113226513686606015976666256457529322e-19, /* 401, RD rounding constant quick poly middle 7*/ 7.19008445739778290217714129539672285318374633789062e-01, /* 402, midpoint in interval 8*/ 8.02374569969830475635319544380763545632362365722656e-01, /* 403, accPolyMid8C0h, quickPolyMid8C0h */ -5.57232596267891548198947769768214754835408022265973e-18, /* 404, accPolyMid8C0m, quickPolyMid8C0l */ 1.43884615807450622071428369963541626930236816406250e+00, /* 405, accPolyMid8C1h, quickPolyMid8C1h */ 3.59501817700961691698905527113737832717163932379732e-17, /* 406, accPolyMid8C1m, quickPolyMid8C1l */ 1.42139791223330171535988185118707169939451756100115e-33, /* 407, accPolyMid8C1l */ 1.07089546798848767039658014255110174417495727539062e+00, /* 408, accPolyMid8C2h, quickPolyMid8C2h */ 7.12234409493595206110752393915421282220770659974638e-18, /* 409, accPolyMid8C2m, quickPolyMid8C2l */ 4.88803415361541961399074298884647415525574790319603e-34, /* 410, accPolyMid8C2l */ 2.09054748952818103546746897336561232805252075195312e+00, /* 411, accPolyMid8C3h, quickPolyMid8C3h */ -4.76201670474478458619338404030121517580491201111076e-17, /* 412, accPolyMid8C3m, quickPolyMid8C3l */ 9.85965711757934088944524691800382507878970211803297e-34, /* 413, accPolyMid8C3l */ 4.62886640680389760404978005681186914443969726562500e+00, /* 414, accPolyMid8C4h, quickPolyMid8C4h */ -6.26076461255283992652654162871089011104493903198467e-17, /* 415, accPolyMid8C4m, quickPolyMid8C4l */ -3.79525038577018957662309046851941714013728344004132e-33, /* 416, accPolyMid8C4l */ 1.15940096700862280698629547259770333766937255859375e+01, /* 417, accPolyMid8C5h, quickPolyMid8C5h */ 5.00344758332442110044971487490682364429618307708619e-16, /* 418, accPolyMid8C5m, quickPolyMid8C5l */ 5.05400641998677592107699970650218041381398322944134e-33, /* 419, accPolyMid8C5l */ 3.09983076631741454320945194922387599945068359375000e+01, /* 420, accPolyMid8C6h, quickPolyMid8C6h */ -1.68695534318490565671111852385917462817518447859219e-16, /* 421, accPolyMid8C6m, quickPolyMid8C6l */ 6.85050661529605157727571454320758800953682098824324e-34, /* 422, accPolyMid8C6l */ 8.67969690247392975379625568166375160217285156250000e+01, /* 423, accPolyMid8C7h, quickPolyMid8C7h */ -5.77909319686569076564604963233208513019264259552576e-15, /* 424, accPolyMid8C7m, quickPolyMid8C7l */ 2.51207737556061232453430420719087123870849609375000e+02, /* 425, accPolyMid8C8h, quickPolyMid8C8h */ -2.34229223147066395573123458231502220325151528840246e-15, /* 426, accPolyMid8C8m */ 7.45516108151238086065859533846378326416015625000000e+02, /* 427, accPolyMid8C9h, quickPolyMid8C9h */ 5.42429462463291658149197032428663192617240449908134e-15, /* 428, accPolyMid8C9m */ 2.25637900900536169501719996333122253417968750000000e+03, /* 429, accPolyMid8C10h, quickPolyMid8C10h */ 1.04118075698860813774916020354956791986217497225642e-13, /* 430, accPolyMid8C10m */ 6.93796098101582811068510636687278747558593750000000e+03, /* 431, accPolyMid8C11h, quickPolyMid8C11h */ 8.59862281333229161222916847764065622815798321104674e-15, /* 432, accPolyMid8C11m */ 2.16119867410615115659311413764953613281250000000000e+04, /* 433, accPolyMid8C12h, quickPolyMid8C12h */ 1.06661614083783310365636876324959361083581990681246e-13, /* 434, accPolyMid8C12m */ 6.80579130650992592563852667808532714843750000000000e+04, /* 435, accPolyMid8C13h, quickPolyMid8C13h */ 6.62014084472278982961475227363418833651659278771717e-12, /* 436, accPolyMid8C13m */ 2.16307061102022911654785275459289550781250000000000e+05, /* 437, accPolyMid8C14h, quickPolyMid8C14h */ -2.44881501957370731470213892899278376432195547529602e-12, /* 438, accPolyMid8C14m */ 6.92960027312710066325962543487548828125000000000000e+05, /* 439, accPolyMid8C15h */ -5.66500973206806599245652257405055779448943553688878e-11, /* 440, accPolyMid8C15m */ 2.23531716476973146200180053710937500000000000000000e+06, /* 441, accPolyMid8C16h */ 7.25429400587130710482597351074218750000000000000000e+06, /* 442, accPolyMid8C17h */ 2.36685600768156014382839202880859375000000000000000e+07, /* 443, accPolyMid8C18h */ 7.75916356685774326324462890625000000000000000000000e+07, /* 444, accPolyMid8C19h */ 2.55452232123835593461990356445312500000000000000000e+08, /* 445, accPolyMid8C20h */ 8.44254469674954175949096679687500000000000000000000e+08, /* 446, accPolyMid8C21h */ 2.79994093996573638916015625000000000000000000000000e+09, /* 447, accPolyMid8C22h */ 9.31537507532041358947753906250000000000000000000000e+09, /* 448, accPolyMid8C23h */ 3.10820362568210334777832031250000000000000000000000e+10, /* 449, accPolyMid8C24h */ 1.03985438377022964477539062500000000000000000000000e+11, /* 450, accPolyMid8C25h */ 3.48737110205060913085937500000000000000000000000000e+11, /* 451, accPolyMid8C26h */ 1.17221005601944750976562500000000000000000000000000e+12, /* 452, accPolyMid8C27h */ 3.94841085036352832031250000000000000000000000000000e+12, /* 453, accPolyMid8C28h */ 1.33255264873973789062500000000000000000000000000000e+13, /* 454, accPolyMid8C29h */ 4.50540615593679062500000000000000000000000000000000e+13, /* 455, accPolyMid8C30h */ 1.52590744626434593750000000000000000000000000000000e+14, /* 456, accPolyMid8C31h */ 5.17610884067860062500000000000000000000000000000000e+14, /* 457, accPolyMid8C32h */ 1.75591888512180650000000000000000000000000000000000e+15, /* 458, accPolyMid8C33h */ 5.97247050283681300000000000000000000000000000000000e+15, /* 459, accPolyMid8C34h */ 2.15157732956128240000000000000000000000000000000000e+16, /* 460, accPolyMid8C35h */ 1.01164858801777814945850739843488049838102483351729e+00, /* 461, RN rounding constant quick poly middle 8*/ 6.36522991537283605877265237263241827159525525595558e-19, /* 462, RD rounding constant quick poly middle 8*/ 7.60880231857352207214262307388707995414733886718750e-01, /* 463, midpoint in interval 9*/ 8.64668552766275078091950945236021652817726135253906e-01, /* 464, accPolyMid9C0h, quickPolyMid9C0h */ 2.22107768610709483983000348580034922276618040094248e-19, /* 465, accPolyMid9C0m, quickPolyMid9C0l */ 1.54108768708640897493467036838410422205924987792969e+00, /* 466, accPolyMid9C1h, quickPolyMid9C1h */ 3.32820103504311843280112118328828427349507594590859e-17, /* 467, accPolyMid9C1m, quickPolyMid9C1l */ 1.00469319336666835386896691703426687648516206509999e-33, /* 468, accPolyMid9C1l */ 1.39241392226891269601196654548402875661849975585938e+00, /* 469, accPolyMid9C2h, quickPolyMid9C2h */ -7.78438411380474954824767774215038405507043967534661e-17, /* 470, accPolyMid9C2m, quickPolyMid9C2l */ -2.75498989204243544757760916231818015864525586405625e-34, /* 471, accPolyMid9C2l */ 3.12616775988369477445871780219022184610366821289062e+00, /* 472, accPolyMid9C3h, quickPolyMid9C3h */ -1.83136634474213254639590598215495010130375003296228e-16, /* 473, accPolyMid9C3m, quickPolyMid9C3l */ -1.37039877493057234685308732075670776376976824689825e-33, /* 474, accPolyMid9C3l */ 8.16374541867330982825023966142907738685607910156250e+00, /* 475, accPolyMid9C4h, quickPolyMid9C4h */ 6.61331422381139448266729896007647878117248843327786e-16, /* 476, accPolyMid9C4m, quickPolyMid9C4l */ -2.34411228408683938039171677313602417735464237635307e-32, /* 477, accPolyMid9C4l */ 2.39942774487262227012251969426870346069335937500000e+01, /* 478, accPolyMid9C5h, quickPolyMid9C5h */ 3.56709659583669727593018389598696746405922754956722e-16, /* 479, accPolyMid9C5m, quickPolyMid9C5l */ 1.92887188784617492937549821774446261489627075560113e-32, /* 480, accPolyMid9C5l */ 7.53789452793380974071624223142862319946289062500000e+01, /* 481, accPolyMid9C6h, quickPolyMid9C6h */ -4.89236491033052363530754653203901634957086880239885e-15, /* 482, accPolyMid9C6m, quickPolyMid9C6l */ 1.86966182047363315238712995890702987106854589421809e-31, /* 483, accPolyMid9C6l */ 2.47970017761763045882617007009685039520263671875000e+02, /* 484, accPolyMid9C7h, quickPolyMid9C7h */ -5.49773113276874172897358146458574130047619382341550e-15, /* 485, accPolyMid9C7m, quickPolyMid9C7l */ 8.43239639560233626980334520339965820312500000000000e+02, /* 486, accPolyMid9C8h, quickPolyMid9C8h */ 4.61444619149467756136937751706191309842186761003280e-14, /* 487, accPolyMid9C8m */ 2.94042238989191673681489191949367523193359375000000e+03, /* 488, accPolyMid9C9h, quickPolyMid9C9h */ -6.26529947434876144165574723786618699307871677151027e-14, /* 489, accPolyMid9C9m */ 1.04570596262470262445276603102684020996093750000000e+04, /* 490, accPolyMid9C10h, quickPolyMid9C10h */ 4.33811913399171164864172764349193352065910816994787e-13, /* 491, accPolyMid9C10m */ 3.77816423278584625222720205783843994140625000000000e+04, /* 492, accPolyMid9C11h, quickPolyMid9C11h */ -4.21825155017599752908316500880066660420734253600372e-14, /* 493, accPolyMid9C11m */ 1.38292932619114842964336276054382324218750000000000e+05, /* 494, accPolyMid9C12h, quickPolyMid9C12h */ -2.02223055949190022685968858135129700521678830504868e-12, /* 495, accPolyMid9C12m */ 5.11733514125351735856384038925170898437500000000000e+05, /* 496, accPolyMid9C13h, quickPolyMid9C13h */ -2.25025523408315347550056625257165819446736332309911e-11, /* 497, accPolyMid9C13m */ 1.91116705355792236514389514923095703125000000000000e+06, /* 498, accPolyMid9C14h, quickPolyMid9C14h */ -6.92308947161053801527502899602797403061371639410027e-11, /* 499, accPolyMid9C14m */ 7.19450694938360899686813354492187500000000000000000e+06, /* 500, accPolyMid9C15h */ -3.25836107774239441972945896739397887709177581427866e-10, /* 501, accPolyMid9C15m */ 2.72708481033120900392532348632812500000000000000000e+07, /* 502, accPolyMid9C16h */ 1.03997450389555335044860839843750000000000000000000e+08, /* 503, accPolyMid9C17h */ 3.98720516462098360061645507812500000000000000000000e+08, /* 504, accPolyMid9C18h */ 1.53596677859462237358093261718750000000000000000000e+09, /* 505, accPolyMid9C19h */ 5.94220454070446586608886718750000000000000000000000e+09, /* 506, accPolyMid9C20h */ 2.30771902569618682861328125000000000000000000000000e+10, /* 507, accPolyMid9C21h */ 8.99354036055935974121093750000000000000000000000000e+10, /* 508, accPolyMid9C22h */ 3.51604905808161804199218750000000000000000000000000e+11, /* 509, accPolyMid9C23h */ 1.37859673609756665039062500000000000000000000000000e+12, /* 510, accPolyMid9C24h */ 5.41968316905909179687500000000000000000000000000000e+12, /* 511, accPolyMid9C25h */ 2.13586334787060429687500000000000000000000000000000e+13, /* 512, accPolyMid9C26h */ 8.43635735241271562500000000000000000000000000000000e+13, /* 513, accPolyMid9C27h */ 3.33923015327480937500000000000000000000000000000000e+14, /* 514, accPolyMid9C28h */ 1.32429009755987925000000000000000000000000000000000e+15, /* 515, accPolyMid9C29h */ 5.26147664189654100000000000000000000000000000000000e+15, /* 516, accPolyMid9C30h */ 2.09399836831170720000000000000000000000000000000000e+16, /* 517, accPolyMid9C31h */ 8.34692893106752000000000000000000000000000000000000e+16, /* 518, accPolyMid9C32h */ 3.32762568376608000000000000000000000000000000000000e+17, /* 519, accPolyMid9C33h */ 1.33003631888338841600000000000000000000000000000000e+18, /* 520, accPolyMid9C34h */ 5.62235923730283212800000000000000000000000000000000e+18, /* 521, accPolyMid9C35h */ 1.01058279621692383521501837291497341253743085794782e+00, /* 522, RN rounding constant quick poly middle 9*/ 5.78284088727747938003347592934948079832502681677348e-19, /* 523, RD rounding constant quick poly middle 9*/ -8.33333333333333287074040640618477482348680496215820e-02, /* 524, accPolyHighC1h, quickPolyHighC1h */ -4.62592926927148532830780603208030422795294098867636e-18, /* 525, accPolyHighC1m, quickPolyHighC1l */ -2.56790659251636222413745757067544746896901530409675e-34, /* 526, accPolyHighC1l */ -1.87499999999999993061106096092771622352302074432373e-02, /* 527, accPolyHighC2h, quickPolyHighC2h */ -6.93889390390722876283368680301479756432058851698546e-19, /* 528, accPolyHighC2m, quickPolyHighC2l */ 3.85185989241340205035888971870941307651344283492079e-35, /* 529, accPolyHighC2l */ -5.58035714285714298105167685548622102942317724227905e-03, /* 530, accPolyHighC3h, quickPolyHighC3h */ 1.23908819712629071293959090145008148963025205053831e-19, /* 531, accPolyHighC3m, quickPolyHighC3l */ 6.87827508933260239532125196237951282993345739214379e-36, /* 532, accPolyHighC3l */ -1.89887152777777775368439616698879035538993775844574e-03, /* 533, accPolyHighC4h, quickPolyHighC4h */ -2.40933816107889860849364897504182511872549009826894e-20, /* 534, accPolyHighC4m, quickPolyHighC4l */ -1.31413379554614650822698366533512762375439292005686e-36, /* 535, accPolyHighC4l */ -6.99129971590909120478241067786484563839621841907501e-04, /* 536, accPolyHighC5h, quickPolyHighC5h */ 2.95691501586955672658426997372092637662516651210484e-20, /* 537, accPolyHighC5m, quickPolyHighC5l */ 1.93248831638054158509225332576516713663708940033800e-36, /* 538, accPolyHighC5l */ -2.71136944110576935586948144063512700085993856191635e-04, /* 539, accPolyHighC6h, quickPolyHighC6h */ 1.25100250671414776773311485375106982275955017737813e-20, /* 540, accPolyHighC6m, quickPolyHighC6l */ -2.41797324682937785630481140742729367728409168219340e-37, /* 541, accPolyHighC6l */ -1.09100341796875005421010862427522170037264004349709e-04, /* 542, accPolyHighC7h, quickPolyHighC7h */ 5.42101086231091719294416952538483743258993211884145e-21, /* 543, accPolyHighC7m, quickPolyHighC7l */ 9.55338141209871258458343868890229946241110412925982e-38, /* 544, accPolyHighC7l */ -4.51242222505457229141112573955751940957270562648773e-05, /* 545, accPolyHighC8h, quickPolyHighC8h */ -3.18882990973711044045301474516264873522265001897356e-21, /* 546, accPolyHighC8m, quickPolyHighC8l */ 1.26912673390128847048400261536391292203355395300755e-37, /* 547, accPolyHighC8l */ -1.90656436117071843741425929419364138084347359836102e-05, /* 548, accPolyHighC9h, quickPolyHighC9h */ -1.06993691223935686411543055030763865855410413408366e-21, /* 549, accPolyHighC9m, quickPolyHighC9l */ -8.19368731407892096011823940271412425317976158112288e-06, /* 550, accPolyHighC10h, quickPolyHighC10h */ -4.03323388732262270981356256138402986149007425086112e-22, /* 551, accPolyHighC10m */ -3.57056927421818625395413641931963155684570665471256e-06, /* 552, accPolyHighC11h, quickPolyHighC11h */ 1.64796270839759047485693620137778762426170587507193e-22, /* 553, accPolyHighC11m */ -1.57402595505118377679448869038703051614902506116778e-06, /* 554, accPolyHighC12h, quickPolyHighC12h */ 1.03140748281100284102117735554826521589797225638379e-22, /* 555, accPolyHighC12m */ -7.00688192241446386609332076800260580284884781576693e-07, /* 556, accPolyHighC13h, quickPolyHighC13h */ 1.64297063257073230214010320767916245637133227760945e-23, /* 557, accPolyHighC13m */ -3.14533061665020903893046425037205438002274604514241e-07, /* 558, accPolyHighC14h, quickPolyHighC14h */ -1.57714454767442613704253788250439912924415496806915e-23, /* 559, accPolyHighC14m */ -1.42216292935838748302118661470672122959513217210770e-07, /* 560, accPolyHighC15h, quickPolyHighC15h */ 3.70163506723718792079998292841186813204562291235770e-24, /* 561, accPolyHighC15m */ -6.47111067734723877623606537110023673164960200665519e-08, /* 562, accPolyHighC16h, quickPolyHighC16h */ 1.96959302136511249382763415085950224265202199251341e-24, /* 563, accPolyHighC16m */ -2.96094098107419582578099602043070204260288846853655e-08, /* 564, accPolyHighC17h, quickPolyHighC17h */ -1.33210241793138800698071276025711826265682121011801e-25, /* 565, accPolyHighC17m */ -1.36154377785683810553931313304908135020099280154682e-08, /* 566, accPolyHighC18h, quickPolyHighC18h */ -6.28864412480332248702787563995712794007175716615166e-09, /* 567, accPolyHighC19h */ -2.91615151940413698643198065114674061293342788303562e-09, /* 568, accPolyHighC20h */ -1.35724329813454494662594037565671659106847357634251e-09, /* 569, accPolyHighC21h */ -6.33321170158103043923636695899503229467697451582353e-10, /* 570, accPolyHighC22h */ -2.98137047522453658533318439889463723202478462326326e-10, /* 571, accPolyHighC23h */ -1.35174910337425390381481209427921852395115820399951e-10, /* 572, accPolyHighC24h */ -7.57694791124210735879864558660150546803846438592700e-11, /* 573, accPolyHighC25h */ -1.19244777215077355372683280351504137017926154840097e-11, /* 574, accPolyHighC26h */ -4.08879979855917754145740023360966995669141255120849e-11, /* 575, accPolyHighC27h */ 1.75342081019476863949528641668112755730435381451571e-11, /* 576, accPolyHighC28h */ -1.60530246587119583502980643958298338953849526689055e-11, /* 577, accPolyHighC29h */ 1.00010073610227913567190400341090722191910177379040e+00, /* 578, RN rounding constant quick poly high*/ 5.59129439367752644847269214347219849204178767344215e-21, /* 579, RD rounding constant quick poly high*/ }; interval-2.1.0/src/crlibm/asin-td.c0000644000000000000000000012701513031036767015242 0ustar 00000000000000/* * Correctly rounded arcsine * * Author : Christoph Lauter (ENS Lyon) * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" #include "asin-td.h" #define AVOID_FMA 1 void asin_accurate_lower(double *asinh, double *asinm, double *asinl, double x, double xSqh, double xSql, double sign) { double highPoly; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l; double tt1h, tt1l; double t8h, t8m, t8l, t9h, t9m, t9l, t10h, t10m, t10l, t11h, t11m, t11l, t12h, t12m, t12l; double tt8h, tt8m, tt8l, tt9h, tt9m, tt9l, tt10h, tt10m, tt10l, tt11h, tt11m, tt11l, tt12h, tt12m, tt12l; double xCubeh, xCubem, xCubel, tt13h, tt13m, tt13l, t13h, t13m, t13l, polyh, polym, polyl; double tt11hover, tt11mover, tt11lover; #if EVAL_PERF crlibm_second_step_taken++; #endif /* Evaluate the polynomial of degree 37 Its coefficients start at tbl[0] p(x) = x + x * x^2 * (c3 + x^2 * (c5 + ... We receive x^2 as xSqh + xSql = x * x (exactly) in argument |x| <= 0.185 = 2^(-2.43) Compute monomials 27 to 37 in double precision monomials 13 to 25 in double-double and 1 to 11 in triple-double precision in a modified Horner form */ /* Double computations */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(tbl[33],xSqh,tbl[32]),xSqh,tbl[31]),xSqh,tbl[30]),xSqh,tbl[29]),xSqh,tbl[28]); #else highPoly = tbl[28] + xSqh * (tbl[29] + xSqh * (tbl[30] + xSqh * (tbl[31] + xSqh * (tbl[32] + xSqh * tbl[33])))); #endif /* Double-double computations */ Mul12(&tt1h,&tt1l,xSqh,highPoly); Add22(&t1h,&t1l,tbl[27],0,tt1h,tt1l); MulAdd22(&t2h,&t2l,tbl[25],tbl[26],xSqh,xSql,t1h,t1l); MulAdd22(&t3h,&t3l,tbl[23],tbl[24],xSqh,xSql,t2h,t2l); MulAdd22(&t4h,&t4l,tbl[21],tbl[22],xSqh,xSql,t3h,t3l); MulAdd22(&t5h,&t5l,tbl[19],tbl[20],xSqh,xSql,t4h,t4l); MulAdd22(&t6h,&t6l,tbl[17],tbl[18],xSqh,xSql,t5h,t5l); MulAdd22(&t7h,&t7l,tbl[15],tbl[16],xSqh,xSql,t6h,t6l); /* Triple-double computations */ Mul23(&tt8h,&tt8m,&tt8l,xSqh,xSql,t7h,t7l); /* 149 - 48/53 */ Add33(&t8h,&t8m,&t8l,tbl[12],tbl[13],tbl[14],tt8h,tt8m,tt8l); /* 145 - 43/53 */ Mul233(&tt9h,&tt9m,&tt9l,xSqh,xSql,t8h,t8m,t8l); /* 139 - 39/53 */ Add33(&t9h,&t9m,&t9l,tbl[9],tbl[10],tbl[11],tt9h,tt9m,tt9l); /* 136 - 34/53 */ Mul233(&tt10h,&tt10m,&tt10l,xSqh,xSql,t9h,t9m,t9l); /* 130 - 30/53 */ Add33(&t10h,&t10m,&t10l,tbl[6],tbl[7],tbl[8],tt10h,tt10m,tt10l); /* 127 - 25/53 */ Mul233(&tt11hover,&tt11mover,&tt11lover,xSqh,xSql,t10h,t10m,t10l); /* 121 - 21/53 */ Renormalize3(&tt11h,&tt11m,&tt11l,tt11hover,tt11mover,tt11lover); /* infty - 52/53 */ Add33(&t11h,&t11m,&t11l,tbl[3],tbl[4],tbl[5],tt11h,tt11m,tt11l); /* 149 - 47/53 */ Mul233(&tt12h,&tt12m,&tt12l,xSqh,xSql,t11h,t11m,t11l); /* 143 - 43/53 */ Add33(&t12h,&t12m,&t12l,tbl[0],tbl[1],tbl[2],tt12h,tt12m,tt12l); /* 140 - 38/53 */ Mul123(&xCubeh,&xCubem,&xCubel,x,xSqh,xSql); /* 154 - 47/53 */ Mul33(&tt13h,&tt13m,&tt13l,xCubeh,xCubem,xCubel,t12h,t12m,t12l); /* 136 - 34/53 */ Add133(&t13h,&t13m,&t13l,x,tt13h,tt13m,tt13l); /* 138 - 32/53 */ Renormalize3(&polyh,&polym,&polyl,t13h,t13m,t13l); /* infty - 52/53 */ *asinh = sign * polyh; *asinm = sign * polym; *asinl = sign * polyl; } void asin_accurate_middle(double *asinh, double *asinm, double *asinl, double z, int i, double sign) { double highPoly; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, t8h, t8l, t9h, t9l; double t10h, t10m, t10l, t11h, t11m, t11l, t12h, t12m, t12l, t13h, t13m, t13l, t14h, t14m, t14l; double t15h, t15m, t15l, t16h, t16m, t16l; double tt1h, tt1l; double tt10h, tt10m, tt10l, tt11h, tt11m, tt11l, tt12h, tt12m, tt12l; double tt13h, tt13m, tt13l, tt14h, tt14m, tt14l, tt15h, tt15m, tt15l, tt16h, tt16m, tt16l; double polyh, polym, polyl, tt13hover, tt13mover, tt13lover; #if EVAL_PERF crlibm_second_step_taken++; #endif /* Evaluate the polynomial of degree 35 Its coefficients start at tbl[i+1] Evaluate degrees 35 to 20 in double precision, degrees 20 to 7 in double-double precision and finally degrees 6 to 1 in triple-double. The constant coefficient is a double-double, the computations are nevertheless in triple-double */ /* Double computations */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[i+58] ,z,tbl[i+57]),z,tbl[i+56]),z,tbl[i+55]),z,tbl[i+54]),z, tbl[i+53]),z,tbl[i+52]),z,tbl[i+51]),z,tbl[i+50]),z,tbl[i+49]),z, tbl[i+48]),z,tbl[i+47]),z,tbl[i+46]),z,tbl[i+45]),z,tbl[i+44]),z, tbl[i+43]),z,tbl[i+42]),z,tbl[i+41]),z,tbl[i+40]),z,tbl[i+39]); #else highPoly = tbl[i+39] + z * (tbl[i+40] + z * (tbl[i+41] + z * (tbl[i+42] + z * ( tbl[i+43] + z * (tbl[i+44] + z * (tbl[i+45] + z * (tbl[i+46] + z * ( tbl[i+47] + z * (tbl[i+48] + z * (tbl[i+49] + z * (tbl[i+50] + z * ( tbl[i+51] + z * (tbl[i+52] + z * (tbl[i+53] + z * (tbl[i+54] + z * ( tbl[i+55] + z * (tbl[i+56] + z * (tbl[i+57] + z * tbl[i+58])))))))))))))))))); #endif /* Double-double computations */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[i+37],tbl[i+38],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[i+35],tbl[i+36],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[i+33],tbl[i+34],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[i+31],tbl[i+32],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[i+29],tbl[i+30],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[i+27],tbl[i+28],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[i+25],tbl[i+26],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[i+23],tbl[i+24],z,t7h,t7l); MulAdd212(&t9h,&t9l,tbl[i+21],tbl[i+22],z,t8h,t8l); /* Triple-double computations */ Mul123(&tt10h,&tt10m,&tt10l,z,t9h,t9l); /* 154 - 47/53 */ Add33(&t10h,&t10m,&t10l,tbl[i+18],tbl[i+19],tbl[i+20],tt10h,tt10m,tt10l); /* 144 - 42/53 */ Mul133(&tt11h,&tt11m,&tt11l,z,t10h,t10m,t10l); /* 142 - 38/53 */ Add33(&t11h,&t11m,&t11l,tbl[i+15],tbl[i+16],tbl[i+17],tt11h,tt11m,tt11l); /* 136 - 33/53 */ Mul133(&tt12h,&tt12m,&tt12l,z,t11h,t11m,t11l); /* 133 - 28/53 */ Add33(&t12h,&t12m,&t12l,tbl[i+12],tbl[i+13],tbl[i+14],tt12h,tt12m,tt12l); /* 125 - 23/53 */ Mul133(&tt13hover,&tt13mover,&tt13lover,z,t12h,t12m,t12l); /* 123 - 18/53 */ Renormalize3(&tt13h,&tt13m,&tt13l,tt13hover,tt13mover,tt13lover); /* infty - 52/53 */ Add33(&t13h,&t13m,&t13l,tbl[i+9],tbl[i+10],tbl[i+11],tt13h,tt13m,tt13l); /* 149 - 47/53 */ Mul133(&tt14h,&tt14m,&tt14l,z,t13h,t13m,t13l); /* 147 - 42/53 */ Add33(&t14h,&t14m,&t14l,tbl[i+6],tbl[i+7],tbl[i+8],tt14h,tt14m,tt14l); /* 139 - 37/53 */ Mul133(&tt15h,&tt15m,&tt15l,z,t14h,t14m,t14l); /* 137 - 32/53 */ Add33(&t15h,&t15m,&t15l,tbl[i+3],tbl[i+4],tbl[i+5],tt15h,tt15m,tt15l); /* 129 - 28/53 */ Mul133(&tt16h,&tt16m,&tt16l,z,t15h,t15m,t15l); /* 128 - 23/53 */ Add233(&t16h,&t16m,&t16l,tbl[i+1],tbl[i+2],tt16h,tt16m,tt16l); /* 126 - 19/53 */ Renormalize3(&polyh,&polym,&polyl,t16h,t16m,t16l); /* infty - 52/53 */ *asinh = sign * polyh; *asinm = sign * polym; *asinl = sign * polyl; } void asin_accurate_higher(double *asinh, double *asinm, double *asinl, double z, double sign) { double highPoly; double tt1h, tt1l; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, t8h, t8l; double tt10h, tt10m, tt10l, tt11h, tt11m, tt11l, tt12h, tt12m, tt12l, tt13h, tt13m, tt13l; double tt14h, tt14m, tt14l, tt15h, tt15m, tt15l, tt16h, tt16m, tt16l, tt17h, tt17m, tt17l; double t9h, t9l, t10h, t10m, t10l, t11h, t11m, t11l, t12h, t12m, t12l, t13h, t13m, t13l; double t14h, t14m, t14l, t15h, t15m, t15l, t16h, t16m, t16l, t17h, t17m, t17l; double tt18h, tt18m, tt18l, polyh, polym, polyl; double sqrtzh, sqrtzm, sqrtzl, twoZ, pTimesSh, pTimesSm, pTimesSl; double allhover, allmover, alllover, allh, allm, alll; double tt13hover, tt13mover, tt13lover, tt16hover, tt16mover, tt16lover; #if EVAL_PERF crlibm_second_step_taken++; #endif /* We evaluate asin(x) as asin(x) = f(z) * sqrt(2*z) + Pi/2 with z = 1 - x and f(z) = (asin(z) - Pi/2) / sqrt(2*z) f(z) is approximated by p(z) The polynomial p(z) is of degree 29 Its coefficients start at tbl[TBLIDX10] Coefficients for degrees 29 to 18 are in double precision, for degrees 17 to 9 in double-double precision and finally for degrees 8 to 1 in triple-double. The constant coefficient (-1) is not stored in the table, the computations are nevertheless in triple-double We evaluate the monomials in the precision in which the correspondant coefficients are stored The coefficients' values decrease very quickly so even with |z| < 2^-2.18 we can compute degree 18 already in double precision Compute than sqrt(2*z) as a triple-double multiply in triple-double and add Pi/2 We will cancel no bit in the addition since f(z) < 0.5 * Pi/2 */ /* Double computations */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[TBLIDX10+53] ,z,tbl[TBLIDX10+52]),z,tbl[TBLIDX10+51]),z, tbl[TBLIDX10+50]),z,tbl[TBLIDX10+49]),z,tbl[TBLIDX10+48]),z, tbl[TBLIDX10+47]),z,tbl[TBLIDX10+46]),z,tbl[TBLIDX10+45]),z, tbl[TBLIDX10+44]),z,tbl[TBLIDX10+43]),z,tbl[TBLIDX10+42]); #else highPoly = tbl[TBLIDX10+42] + z * (tbl[TBLIDX10+43] + z * (tbl[TBLIDX10+44] + z * ( tbl[TBLIDX10+45] + z * (tbl[TBLIDX10+46] + z * (tbl[TBLIDX10+47] + z * ( tbl[TBLIDX10+48] + z * (tbl[TBLIDX10+49] + z * (tbl[TBLIDX10+50] + z * ( tbl[TBLIDX10+51] + z * (tbl[TBLIDX10+52] + z * tbl[TBLIDX10+53])))))))))); #endif /* Double-double computations */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[TBLIDX10+40],tbl[TBLIDX10+41],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[TBLIDX10+38],tbl[TBLIDX10+39],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[TBLIDX10+36],tbl[TBLIDX10+37],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[TBLIDX10+34],tbl[TBLIDX10+35],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[TBLIDX10+32],tbl[TBLIDX10+33],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[TBLIDX10+30],tbl[TBLIDX10+31],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[TBLIDX10+28],tbl[TBLIDX10+29],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[TBLIDX10+26],tbl[TBLIDX10+27],z,t7h,t7l); MulAdd212(&t9h,&t9l,tbl[TBLIDX10+24],tbl[TBLIDX10+25],z,t8h,t8l); /* Triple-double computations */ Mul123(&tt10h,&tt10m,&tt10l,z,t9h,t9l); /* 154 - 47/53 */ Add33(&t10h,&t10m,&t10l,tbl[TBLIDX10+21],tbl[TBLIDX10+22],tbl[TBLIDX10+23],tt10h,tt10m,tt10l); /* 144 - 42/53 */ Mul133(&tt11h,&tt11m,&tt11l,z,t10h,t10m,t10l); /* 142 - 37/53 */ Add33(&t11h,&t11m,&t11l,tbl[TBLIDX10+18],tbl[TBLIDX10+19],tbl[TBLIDX10+20],tt11h,tt11m,tt11l); /* 134 - 32/53 */ Mul133(&tt12h,&tt12m,&tt12l,z,t11h,t11m,t11l); /* 132 - 27/53 */ Add33(&t12h,&t12m,&t12l,tbl[TBLIDX10+15],tbl[TBLIDX10+16],tbl[TBLIDX10+17],tt12h,tt12m,tt12l); /* 124 - 22/53 */ Mul133(&tt13hover,&tt13mover,&tt13lover,z,t12h,t12m,t12l); /* 122 - 17/53 */ Renormalize3(&tt13h,&tt13m,&tt13l,tt13hover,tt13mover,tt13lover); /* infty - 52/53 */ Add33(&t13h,&t13m,&t13l,tbl[TBLIDX10+12],tbl[TBLIDX10+13],tbl[TBLIDX10+14],tt13h,tt13m,tt13l); /* 149 - 47/53 */ Mul133(&tt14h,&tt14m,&tt14l,z,t13h,t13m,t13l); /* 147 - 42/53 */ Add33(&t14h,&t14m,&t14l,tbl[TBLIDX10+9],tbl[TBLIDX10+10],tbl[TBLIDX10+11],tt14h,tt14m,tt14l); /* 139 - 37/53 */ Mul133(&tt15h,&tt15m,&tt15l,z,t14h,t14m,t14l); /* 137 - 32/53 */ Add33(&t15h,&t15m,&t15l,tbl[TBLIDX10+6],tbl[TBLIDX10+7],tbl[TBLIDX10+8],tt15h,tt15m,tt15l); /* 129 - 27/53 */ Mul133(&tt16hover,&tt16mover,&tt16lover,z,t15h,t15m,t15l); /* 127 - 22/53 */ Renormalize3(&tt16h,&tt16m,&tt16l,tt16hover,tt16mover,tt16lover); /* infty - 52/53 */ Add33(&t16h,&t16m,&t16l,tbl[TBLIDX10+3],tbl[TBLIDX10+4],tbl[TBLIDX10+5],tt16h,tt16m,tt16l); /* 149 - 47/53 */ Mul133(&tt17h,&tt17m,&tt17l,z,t16h,t16m,t16l); /* 147 - 42/53 */ Add33(&t17h,&t17m,&t17l,tbl[TBLIDX10+0],tbl[TBLIDX10+1],tbl[TBLIDX10+2],tt17h,tt17m,tt17l); /* 139 - 37/53 */ Mul133(&tt18h,&tt18m,&tt18l,z,t17h,t17m,t17l); /* 137 - 32/53 */ Add133(&polyh,&polym,&polyl,-1,tt18h,tt18m,tt18l); /* 136 - 30/53 */ /* Compute sqrt(2*z) as a triple-double */ twoZ = 2 * z; Sqrt13(&sqrtzh,&sqrtzm,&sqrtzl,twoZ); /* 146 - 52/53 */ /* Multiply p(z) by sqrt(2*z) and add Pi/2 */ Mul33(&pTimesSh,&pTimesSm,&pTimesSl,polyh,polym,polyl,sqrtzh,sqrtzm,sqrtzl); /* 128 - 26/53 */ Add33(&allhover,&allmover,&alllover,PIHALFH,PIHALFM,PIHALFL,pTimesSh,pTimesSm,pTimesSl); /* 126 - 21/53 */ /* Renormalize and multiply by sign */ Renormalize3(&allh,&allm,&alll,allhover,allmover,alllover); /* infty - 52/53 */ *asinh = sign * allh; *asinm = sign * allm; *asinl = sign * alll; } double asin_rn(double x) { db_number xdb; double sign, z, asinh, asinm, asinl; int i; double xSqh, xSql; double tt1h, tt1l; double tt6h, tt6l; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l; double t7h, t7l, t8h, t8l, polyh, polyl, twoZ, sqrtzh, sqrtzl; double pTimesSh, pTimesSl, allh, alll, highPoly, xCubeh, xCubel; double tmp1, tmp2, tmp3, tmp4, tmp5; /* Transform the argument into integer */ xdb.d = x; /* Special case handling */ /* Strip off the sign of argument x */ if (xdb.i[HI] & 0x80000000) sign = -1; else sign = 1; xdb.i[HI] &= 0x7fffffff; /* asin is defined on -1 <= x <= 1, elsewhere it is NaN */ if ((xdb.i[HI] > 0x3ff00000) || ((xdb.i[HI] == 0x3ff00000) && (xdb.i[LO] != 0x00000000))) { return (x-x)/0.0; /* return NaN */ } /* If |x| < 2^(-28) we have arcsin(x) = x * ( 1 + xi ) with 0 <= xi < 2^(-55) So we can decide the rounding without any computation */ if (xdb.i[HI] < 0x3e300000) { return x; } /* Recast x */ x = xdb.d; /* Find correspondant interval and compute index to the table We start by filtering the two special cases around 0 and 1 */ if (xdb.i[HI] < BOUND1) { /* Special interval 0..BOUND1 The polynomial has no even monomials We must prove extra accuracy in the interval 0..sin(2^(-18)) */ /* Quick phase starts */ /* Compute square of x for both quick and accurate phases */ Mul12(&xSqh,&xSql,x,x); tmp4 = tbl[3]; tmp5 = tbl[4]; t4h = tmp4; t4l = tmp5; if (xdb.i[HI] > EXTRABOUND) { /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(tbl[23],xSqh,tbl[21]),xSqh,tbl[19]),xSqh,tbl[17]),xSqh,tbl[15]); #else highPoly = tbl[15] + xSqh * (tbl[17] + xSqh * (tbl[19] + xSqh * (tbl[21] + xSqh * tbl[23]))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,xSqh,highPoly); Add22(&t1h,&t1l,tbl[12],tbl[13],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[9],tbl[10],xSqh,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[6],tbl[7],xSqh,t2h,t2l); MulAdd22(&t4h,&t4l,tmp4,tmp5,xSqh,xSql,t3h,t3l); } MulAdd22(&t5h,&t5l,tbl[0],tbl[1],xSqh,xSql,t4h,t4l); Mul122(&xCubeh,&xCubel,x,xSqh,xSql); Mul22(&tt6h,&tt6l,xCubeh,xCubel,t5h,t5l); Add12(tmp1,tmp2,x,tt6h); tmp3 = tmp2 + tt6l; Add12(polyh,polyl,tmp1,tmp3); /* Multiply by sign */ asinh = sign * polyh; asinm = sign * polyl; /* Rounding test (on polyh+polyl, equivalently to asinh+asinm) The RN rounding constant is at tbl[34] */ if(polyh == (polyh + (polyl * tbl[34]))) return asinh; /* Launch accurate phase */ asin_accurate_lower(&asinh,&asinm,&asinl,x,xSqh,xSql,sign); ReturnRoundToNearest3(asinh,asinm,asinl); } if (xdb.i[HI] >= BOUND9) { /* Special interval BOUND9..1 We use an asymptotic development of arcsin in sqrt(1 - x) */ /* Argument reduction for quick and accurate phase z = 1 - x The operation is exact as per Sterbenz' lemma */ z = 1 - x; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[TBLIDX10+42] ,z,tbl[TBLIDX10+40]),z,tbl[TBLIDX10+38]),z, tbl[TBLIDX10+36]),z,tbl[TBLIDX10+34]),z,tbl[TBLIDX10+32]),z, tbl[TBLIDX10+30]),z,tbl[TBLIDX10+28]),z,tbl[TBLIDX10+26]),z, tbl[TBLIDX10+24]); #else highPoly = tbl[TBLIDX10+24] + z * (tbl[TBLIDX10+26] + z * (tbl[TBLIDX10+28] + z * ( tbl[TBLIDX10+30] + z * (tbl[TBLIDX10+32] + z * (tbl[TBLIDX10+34] + z * ( tbl[TBLIDX10+36] + z * (tbl[TBLIDX10+38] + z * (tbl[TBLIDX10+40] + z * tbl[TBLIDX10+42])))))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[TBLIDX10+21],tbl[TBLIDX10+22],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[TBLIDX10+18],tbl[TBLIDX10+19],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[TBLIDX10+15],tbl[TBLIDX10+16],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[TBLIDX10+12],tbl[TBLIDX10+13],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[TBLIDX10+9],tbl[TBLIDX10+10],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[TBLIDX10+6],tbl[TBLIDX10+7],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[TBLIDX10+3],tbl[TBLIDX10+4],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[TBLIDX10+0],tbl[TBLIDX10+1],z,t7h,t7l); MulAdd212(&polyh,&polyl,-1,0,z,t8h,t8l); /* Compute sqrt(2*z) as a double-double */ twoZ = 2 * z; sqrt12(&sqrtzh,&sqrtzl,twoZ); /* Multiply p(z) by sqrt(2*z) and add Pi/2 */ Mul22(&pTimesSh,&pTimesSl,polyh,polyl,sqrtzh,sqrtzl); Add22(&allh,&alll,PIHALFH,PIHALFM,pTimesSh,pTimesSl); /* Multiply by sign */ asinh = sign * allh; asinm = sign * alll; /* Rounding test The RN rounding constant is at tbl[TBLIDX10+54] */ if(allh == (allh + (alll * tbl[TBLIDX10+54]))) return asinh; /* Launch accurate phase */ asin_accurate_higher(&asinh,&asinm,&asinl,z,sign); ReturnRoundToNearest3(asinh,asinm,asinl); } /* General 8 main intervals We can already suppose that BOUND1 <= x <= BOUND9 */ if (xdb.i[HI] < BOUND5) { if (xdb.i[HI] < BOUND3) { if (xdb.i[HI] < BOUND2) i = TBLIDX2; else i = TBLIDX3; } else { if (xdb.i[HI] < BOUND4) i = TBLIDX4; else i = TBLIDX5; } } else { if (xdb.i[HI] < BOUND7) { if (xdb.i[HI] < BOUND6) i = TBLIDX6; else i = TBLIDX7; } else { if (xdb.i[HI] < BOUND8) i = TBLIDX8; else i = TBLIDX9; } } /* Argument reduction i points to the interval midpoint value in the table */ z = x - tbl[i]; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[i+35] ,z,tbl[i+33]),z,tbl[i+31]),z,tbl[i+29]),z, tbl[i+27]),z,tbl[i+25]),z,tbl[i+23]),z,tbl[i+21]); #else highPoly = tbl[i+21] + z * (tbl[i+23] + z * (tbl[i+25] + z * ( tbl[i+27] + z * (tbl[i+29] + z * (tbl[i+31] + z * ( tbl[i+33] + z * tbl[i+35])))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[i+18],tbl[i+19],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[i+15],tbl[i+16],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[i+12],tbl[i+13],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[i+9],tbl[i+10],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[i+6],tbl[i+7],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[i+3],tbl[i+4],z,t5h,t5l); MulAdd212(&polyh,&polyl,tbl[i+1],tbl[i+2],z,t6h,t6l); /* Multiply by sign */ asinh = sign * polyh; asinm = sign * polyl; /* Rounding test The RN rounding constant is at tbl[i+59] */ if(polyh == (polyh + (polyl * tbl[i+59]))) return asinh; /* Launch accurate phase */ asin_accurate_middle(&asinh,&asinm,&asinl,z,i,sign); ReturnRoundToNearest3(asinh,asinm,asinl); } double asin_ru(double x) { db_number xdb; double sign, z, asinh, asinm, asinl; int i; double xSqh, xSql; double tt1h, tt1l; double tt6h, tt6l; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l; double t7h, t7l, t8h, t8l, polyh, polyl, twoZ, sqrtzh, sqrtzl; double pTimesSh, pTimesSl, allh, alll, highPoly, xCubeh, xCubel; double tmp1, tmp2, tmp3, tmp4, tmp5; /* Transform the argument into integer */ xdb.d = x; /* Special case handling */ /* Strip off the sign of argument x */ if (xdb.i[HI] & 0x80000000) sign = -1; else sign = 1; xdb.i[HI] &= 0x7fffffff; /* asin is defined on -1 <= x <= 1, elsewhere it is NaN */ if ((xdb.i[HI] > 0x3ff00000) || ((xdb.i[HI] == 0x3ff00000) && (xdb.i[LO] != 0x00000000))) { return (x-x)/0.0; /* return NaN */ } /* If |x| < 2^(-28) we have arcsin(x) = x * ( 1 + xi ) with 0 <= xi < 2^(-55) So we can decide the rounding without any computation */ if (xdb.i[HI] < 0x3e300000) { /* If x == 0 then we got the algebraic result arcsin(0) = 0 If x < 0 then the truncation rest is negative but less than 1 ulp; we round upwards by returning x */ if (x <= 0) return x; /* Otherwise the rest is positive, less than 1 ulp and the image is not algebraic We return x + 1ulp */ xdb.l++; return xdb.d; } /* Recast x */ x = xdb.d; /* Find correspondant interval and compute index to the table We start by filtering the two special cases around 0 and 1 */ if (xdb.i[HI] < BOUND1) { /* Special interval 0..BOUND1 The polynomial has no even monomials We must prove extra accuracy in the interval 0..sin(2^(-18)) */ /* Quick phase starts */ /* Compute square of x for both quick and accurate phases */ Mul12(&xSqh,&xSql,x,x); tmp4 = tbl[3]; tmp5 = tbl[4]; t4h = tmp4; t4l = tmp5; if (xdb.i[HI] > EXTRABOUND) { /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(tbl[23],xSqh,tbl[21]),xSqh,tbl[19]),xSqh,tbl[17]),xSqh,tbl[15]); #else highPoly = tbl[15] + xSqh * (tbl[17] + xSqh * (tbl[19] + xSqh * (tbl[21] + xSqh * tbl[23]))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,xSqh,highPoly); Add22(&t1h,&t1l,tbl[12],tbl[13],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[9],tbl[10],xSqh,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[6],tbl[7],xSqh,t2h,t2l); MulAdd22(&t4h,&t4l,tmp4,tmp5,xSqh,xSql,t3h,t3l); } MulAdd22(&t5h,&t5l,tbl[0],tbl[1],xSqh,xSql,t4h,t4l); Mul122(&xCubeh,&xCubel,x,xSqh,xSql); Mul22(&tt6h,&tt6l,xCubeh,xCubel,t5h,t5l); Add12(tmp1,tmp2,x,tt6h); tmp3 = tmp2 + tt6l; Add12(polyh,polyl,tmp1,tmp3); /* Multiply by sign */ asinh = sign * polyh; asinm = sign * polyl; /* Rounding test The RU rounding constant is at tbl[35] */ TEST_AND_RETURN_RU(asinh, asinm, tbl[35]); /* Launch accurate phase */ asin_accurate_lower(&asinh,&asinm,&asinl,x,xSqh,xSql,sign); ReturnRoundUpwards3(asinh,asinm,asinl); } if (xdb.i[HI] > BOUND9) { /* Special interval BOUND9..1 We use an asymptotic development of arcsin in sqrt(1 - x) */ /* Argument reduction for quick and accurate phase z = 1 - x The operation is exact as per Sterbenz' lemma */ z = 1 - x; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[TBLIDX10+42] ,z,tbl[TBLIDX10+40]),z,tbl[TBLIDX10+38]),z, tbl[TBLIDX10+36]),z,tbl[TBLIDX10+34]),z,tbl[TBLIDX10+32]),z, tbl[TBLIDX10+30]),z,tbl[TBLIDX10+28]),z,tbl[TBLIDX10+26]),z, tbl[TBLIDX10+24]); #else highPoly = tbl[TBLIDX10+24] + z * (tbl[TBLIDX10+26] + z * (tbl[TBLIDX10+28] + z * ( tbl[TBLIDX10+30] + z * (tbl[TBLIDX10+32] + z * (tbl[TBLIDX10+34] + z * ( tbl[TBLIDX10+36] + z * (tbl[TBLIDX10+38] + z * (tbl[TBLIDX10+40] + z * tbl[TBLIDX10+42])))))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[TBLIDX10+21],tbl[TBLIDX10+22],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[TBLIDX10+18],tbl[TBLIDX10+19],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[TBLIDX10+15],tbl[TBLIDX10+16],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[TBLIDX10+12],tbl[TBLIDX10+13],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[TBLIDX10+9],tbl[TBLIDX10+10],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[TBLIDX10+6],tbl[TBLIDX10+7],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[TBLIDX10+3],tbl[TBLIDX10+4],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[TBLIDX10+0],tbl[TBLIDX10+1],z,t7h,t7l); MulAdd212(&polyh,&polyl,-1,0,z,t8h,t8l); /* Compute sqrt(2*z) as a double-double */ twoZ = 2 * z; sqrt12(&sqrtzh,&sqrtzl,twoZ); /* Multiply p(z) by sqrt(2*z) and add Pi/2 */ Mul22(&pTimesSh,&pTimesSl,polyh,polyl,sqrtzh,sqrtzl); Add22(&allh,&alll,PIHALFH,PIHALFM,pTimesSh,pTimesSl); /* Multiply by sign */ asinh = sign * allh; asinm = sign * alll; /* Rounding test The RU rounding constant is at tbl[TBLIDX10+55] */ TEST_AND_RETURN_RU(asinh, asinm, tbl[TBLIDX10+55]); /* Launch accurate phase */ asin_accurate_higher(&asinh,&asinm,&asinl,z,sign); ReturnRoundUpwards3(asinh,asinm,asinl); } /* General 8 main intervals We can already suppose that BOUND1 <= x <= BOUND9 */ if (xdb.i[HI] < BOUND5) { if (xdb.i[HI] < BOUND3) { if (xdb.i[HI] < BOUND2) i = TBLIDX2; else i = TBLIDX3; } else { if (xdb.i[HI] < BOUND4) i = TBLIDX4; else i = TBLIDX5; } } else { if (xdb.i[HI] < BOUND7) { if (xdb.i[HI] < BOUND6) i = TBLIDX6; else i = TBLIDX7; } else { if (xdb.i[HI] < BOUND8) i = TBLIDX8; else i = TBLIDX9; } } /* Argument reduction i points to the interval midpoint value in the table */ z = x - tbl[i]; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[i+35] ,z,tbl[i+33]),z,tbl[i+31]),z,tbl[i+29]),z, tbl[i+27]),z,tbl[i+25]),z,tbl[i+23]),z,tbl[i+21]); #else highPoly = tbl[i+21] + z * (tbl[i+23] + z * (tbl[i+25] + z * ( tbl[i+27] + z * (tbl[i+29] + z * (tbl[i+31] + z * ( tbl[i+33] + z * tbl[i+35])))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[i+18],tbl[i+19],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[i+15],tbl[i+16],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[i+12],tbl[i+13],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[i+9],tbl[i+10],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[i+6],tbl[i+7],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[i+3],tbl[i+4],z,t5h,t5l); MulAdd212(&polyh,&polyl,tbl[i+1],tbl[i+2],z,t6h,t6l); /* Multiply by sign */ asinh = sign * polyh; asinm = sign * polyl; /* Rounding test The RU rounding constant is at tbl[i+60] */ TEST_AND_RETURN_RU(asinh, asinm, tbl[i+60]); /* Launch accurate phase */ asin_accurate_middle(&asinh,&asinm,&asinl,z,i,sign); ReturnRoundUpwards3(asinh,asinm,asinl); } double asin_rd(double x) { db_number xdb; double sign, z, asinh, asinm, asinl; int i; double xSqh, xSql; double tt1h, tt1l; double tt6h, tt6l; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l; double t7h, t7l, t8h, t8l, polyh, polyl, twoZ, sqrtzh, sqrtzl; double pTimesSh, pTimesSl, allh, alll, highPoly, xCubeh, xCubel; double tmp1, tmp2, tmp3, tmp4, tmp5; /* Transform the argument into integer */ xdb.d = x; /* Special case handling */ /* Strip off the sign of argument x */ if (xdb.i[HI] & 0x80000000) sign = -1; else sign = 1; xdb.i[HI] &= 0x7fffffff; /* asin is defined on -1 <= x <= 1, elsewhere it is NaN */ if ((xdb.i[HI] > 0x3ff00000) || ((xdb.i[HI] == 0x3ff00000) && (xdb.i[LO] != 0x00000000))) { return (x-x)/0.0; /* return NaN */ } /* If |x| < 2^(-28) we have arcsin(x) = x * ( 1 + xi ) with 0 <= xi < 2^(-55) So we can decide the rounding without any computation */ if (xdb.i[HI] < 0x3e300000) { /* If x == 0 then we got the algebraic result arcsin(0) = 0 If x > 0 then the truncation rest is positive but less than 1 ulp; we round downwards by returning x */ if (x >= 0) return x; /* Otherwise the rest is negative, less than 1 ulp and the image is not algebraic We return x - 1ulp We stripped off the sign, so we add 1 ulp to -x (in xdb.d) and multiply by -1 */ xdb.l++; return -1 * xdb.d; } /* Recast x */ x = xdb.d; /* Find correspondant interval and compute index to the table We start by filtering the two special cases around 0 and 1 */ if (xdb.i[HI] < BOUND1) { /* Special interval 0..BOUND1 The polynomial has no even monomials We must prove extra accuracy in the interval 0..sin(2^(-18)) */ /* Quick phase starts */ /* Compute square of x for both quick and accurate phases */ Mul12(&xSqh,&xSql,x,x); tmp4 = tbl[3]; tmp5 = tbl[4]; t4h = tmp4; t4l = tmp5; if (xdb.i[HI] > EXTRABOUND) { /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(tbl[23],xSqh,tbl[21]),xSqh,tbl[19]),xSqh,tbl[17]),xSqh,tbl[15]); #else highPoly = tbl[15] + xSqh * (tbl[17] + xSqh * (tbl[19] + xSqh * (tbl[21] + xSqh * tbl[23]))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,xSqh,highPoly); Add22(&t1h,&t1l,tbl[12],tbl[13],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[9],tbl[10],xSqh,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[6],tbl[7],xSqh,t2h,t2l); MulAdd22(&t4h,&t4l,tmp4,tmp5,xSqh,xSql,t3h,t3l); } MulAdd22(&t5h,&t5l,tbl[0],tbl[1],xSqh,xSql,t4h,t4l); Mul122(&xCubeh,&xCubel,x,xSqh,xSql); Mul22(&tt6h,&tt6l,xCubeh,xCubel,t5h,t5l); Add12(tmp1,tmp2,x,tt6h); tmp3 = tmp2 + tt6l; Add12(polyh,polyl,tmp1,tmp3); /* Multiply by sign */ asinh = sign * polyh; asinm = sign * polyl; /* Rounding test The RD rounding constant is at tbl[35] */ TEST_AND_RETURN_RD(asinh, asinm, tbl[35]); /* Launch accurate phase */ asin_accurate_lower(&asinh,&asinm,&asinl,x,xSqh,xSql,sign); ReturnRoundDownwards3(asinh,asinm,asinl); } if (xdb.i[HI] > BOUND9) { /* Special interval BOUND9..1 We use an asymptotic development of arcsin in sqrt(1 - x) */ /* Argument reduction for quick and accurate phase z = 1 - x The operation is exact as per Sterbenz' lemma */ z = 1 - x; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[TBLIDX10+42] ,z,tbl[TBLIDX10+40]),z,tbl[TBLIDX10+38]),z, tbl[TBLIDX10+36]),z,tbl[TBLIDX10+34]),z,tbl[TBLIDX10+32]),z, tbl[TBLIDX10+30]),z,tbl[TBLIDX10+28]),z,tbl[TBLIDX10+26]),z, tbl[TBLIDX10+24]); #else highPoly = tbl[TBLIDX10+24] + z * (tbl[TBLIDX10+26] + z * (tbl[TBLIDX10+28] + z * ( tbl[TBLIDX10+30] + z * (tbl[TBLIDX10+32] + z * (tbl[TBLIDX10+34] + z * ( tbl[TBLIDX10+36] + z * (tbl[TBLIDX10+38] + z * (tbl[TBLIDX10+40] + z * tbl[TBLIDX10+42])))))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[TBLIDX10+21],tbl[TBLIDX10+22],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[TBLIDX10+18],tbl[TBLIDX10+19],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[TBLIDX10+15],tbl[TBLIDX10+16],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[TBLIDX10+12],tbl[TBLIDX10+13],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[TBLIDX10+9],tbl[TBLIDX10+10],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[TBLIDX10+6],tbl[TBLIDX10+7],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[TBLIDX10+3],tbl[TBLIDX10+4],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[TBLIDX10+0],tbl[TBLIDX10+1],z,t7h,t7l); MulAdd212(&polyh,&polyl,-1,0,z,t8h,t8l); /* Compute sqrt(2*z) as a double-double */ twoZ = 2 * z; sqrt12(&sqrtzh,&sqrtzl,twoZ); /* Multiply p(z) by sqrt(2*z) and add Pi/2 */ Mul22(&pTimesSh,&pTimesSl,polyh,polyl,sqrtzh,sqrtzl); Add22(&allh,&alll,PIHALFH,PIHALFM,pTimesSh,pTimesSl); /* Multiply by sign */ asinh = sign * allh; asinm = sign * alll; /* Rounding test The RD rounding constant is at tbl[TBLIDX10+55] */ TEST_AND_RETURN_RD(asinh, asinm, tbl[TBLIDX10+55]); /* Launch accurate phase */ asin_accurate_higher(&asinh,&asinm,&asinl,z,sign); ReturnRoundDownwards3(asinh,asinm,asinl); } /* General 8 main intervals We can already suppose that BOUND1 <= x <= BOUND9 */ if (xdb.i[HI] < BOUND5) { if (xdb.i[HI] < BOUND3) { if (xdb.i[HI] < BOUND2) i = TBLIDX2; else i = TBLIDX3; } else { if (xdb.i[HI] < BOUND4) i = TBLIDX4; else i = TBLIDX5; } } else { if (xdb.i[HI] < BOUND7) { if (xdb.i[HI] < BOUND6) i = TBLIDX6; else i = TBLIDX7; } else { if (xdb.i[HI] < BOUND8) i = TBLIDX8; else i = TBLIDX9; } } /* Argument reduction i points to the interval midpoint value in the table */ z = x - tbl[i]; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[i+35] ,z,tbl[i+33]),z,tbl[i+31]),z,tbl[i+29]),z, tbl[i+27]),z,tbl[i+25]),z,tbl[i+23]),z,tbl[i+21]); #else highPoly = tbl[i+21] + z * (tbl[i+23] + z * (tbl[i+25] + z * ( tbl[i+27] + z * (tbl[i+29] + z * (tbl[i+31] + z * ( tbl[i+33] + z * tbl[i+35])))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[i+18],tbl[i+19],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[i+15],tbl[i+16],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[i+12],tbl[i+13],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[i+9],tbl[i+10],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[i+6],tbl[i+7],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[i+3],tbl[i+4],z,t5h,t5l); MulAdd212(&polyh,&polyl,tbl[i+1],tbl[i+2],z,t6h,t6l); /* Multiply by sign */ asinh = sign * polyh; asinm = sign * polyl; /* Rounding test The RD rounding constant is at tbl[i+60] */ TEST_AND_RETURN_RD(asinh, asinm, tbl[i+60]); /* Launch accurate phase */ asin_accurate_middle(&asinh,&asinm,&asinl,z,i,sign); ReturnRoundDownwards3(asinh,asinm,asinl); } double asin_rz(double x) { db_number xdb; double sign, z, asinh, asinm, asinl; int i; double xSqh, xSql; double tt1h, tt1l; double tt6h, tt6l; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l; double t7h, t7l, t8h, t8l, polyh, polyl, twoZ, sqrtzh, sqrtzl; double pTimesSh, pTimesSl, allh, alll, highPoly, xCubeh, xCubel; double tmp1, tmp2, tmp3, tmp4, tmp5; /* Transform the argument into integer */ xdb.d = x; /* Special case handling */ /* Strip off the sign of argument x */ if (xdb.i[HI] & 0x80000000) sign = -1; else sign = 1; xdb.i[HI] &= 0x7fffffff; /* asin is defined on -1 <= x <= 1, elsewhere it is NaN */ if ((xdb.i[HI] > 0x3ff00000) || ((xdb.i[HI] == 0x3ff00000) && (xdb.i[LO] != 0x00000000))) { return (x-x)/0.0; /* return NaN */ } /* If |x| < 2^(-28) we have arcsin(x) = x * ( 1 + xi ) with 0 <= xi < 2^(-55) So we can decide the rounding without any computation */ if (xdb.i[HI] < 0x3e300000) { /* If x == 0 the result is algebraic and equal to 0 If x < 0 the truncation rest is negative and less than 1 ulp, we return x If x > 0 the truncation rest is positive and less than 1 ulp, we return x */ return x; } /* Recast x */ x = xdb.d; /* Find correspondant interval and compute index to the table We start by filtering the two special cases around 0 and 1 */ if (xdb.i[HI] < BOUND1) { /* Special interval 0..BOUND1 The polynomial has no even monomials We must prove extra accuracy in the interval 0..sin(2^(-18)) */ /* Quick phase starts */ /* Compute square of x for both quick and accurate phases */ Mul12(&xSqh,&xSql,x,x); tmp4 = tbl[3]; tmp5 = tbl[4]; t4h = tmp4; t4l = tmp5; if (xdb.i[HI] > EXTRABOUND) { /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(tbl[23],xSqh,tbl[21]),xSqh,tbl[19]),xSqh,tbl[17]),xSqh,tbl[15]); #else highPoly = tbl[15] + xSqh * (tbl[17] + xSqh * (tbl[19] + xSqh * (tbl[21] + xSqh * tbl[23]))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,xSqh,highPoly); Add22(&t1h,&t1l,tbl[12],tbl[13],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[9],tbl[10],xSqh,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[6],tbl[7],xSqh,t2h,t2l); MulAdd22(&t4h,&t4l,tmp4,tmp5,xSqh,xSql,t3h,t3l); } MulAdd22(&t5h,&t5l,tbl[0],tbl[1],xSqh,xSql,t4h,t4l); Mul122(&xCubeh,&xCubel,x,xSqh,xSql); Mul22(&tt6h,&tt6l,xCubeh,xCubel,t5h,t5l); Add12(tmp1,tmp2,x,tt6h); tmp3 = tmp2 + tt6l; Add12(polyh,polyl,tmp1,tmp3); /* Multiply by sign */ asinh = sign * polyh; asinm = sign * polyl; /* Rounding test The RZ rounding constant is at tbl[35] */ TEST_AND_RETURN_RZ(asinh, asinm, tbl[35]); /* Launch accurate phase */ asin_accurate_lower(&asinh,&asinm,&asinl,x,xSqh,xSql,sign); ReturnRoundTowardsZero3(asinh,asinm,asinl); } if (xdb.i[HI] > BOUND9) { /* Special interval BOUND9..1 We use an asymptotic development of arcsin in sqrt(1 - x) */ /* Argument reduction for quick and accurate phase z = 1 - x The operation is exact as per Sterbenz' lemma */ z = 1 - x; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[TBLIDX10+42] ,z,tbl[TBLIDX10+40]),z,tbl[TBLIDX10+38]),z, tbl[TBLIDX10+36]),z,tbl[TBLIDX10+34]),z,tbl[TBLIDX10+32]),z, tbl[TBLIDX10+30]),z,tbl[TBLIDX10+28]),z,tbl[TBLIDX10+26]),z, tbl[TBLIDX10+24]); #else highPoly = tbl[TBLIDX10+24] + z * (tbl[TBLIDX10+26] + z * (tbl[TBLIDX10+28] + z * ( tbl[TBLIDX10+30] + z * (tbl[TBLIDX10+32] + z * (tbl[TBLIDX10+34] + z * ( tbl[TBLIDX10+36] + z * (tbl[TBLIDX10+38] + z * (tbl[TBLIDX10+40] + z * tbl[TBLIDX10+42])))))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[TBLIDX10+21],tbl[TBLIDX10+22],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[TBLIDX10+18],tbl[TBLIDX10+19],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[TBLIDX10+15],tbl[TBLIDX10+16],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[TBLIDX10+12],tbl[TBLIDX10+13],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[TBLIDX10+9],tbl[TBLIDX10+10],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[TBLIDX10+6],tbl[TBLIDX10+7],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[TBLIDX10+3],tbl[TBLIDX10+4],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[TBLIDX10+0],tbl[TBLIDX10+1],z,t7h,t7l); MulAdd212(&polyh,&polyl,-1,0,z,t8h,t8l); /* Compute sqrt(2*z) as a double-double */ twoZ = 2 * z; sqrt12(&sqrtzh,&sqrtzl,twoZ); /* Multiply p(z) by sqrt(2*z) and add Pi/2 */ Mul22(&pTimesSh,&pTimesSl,polyh,polyl,sqrtzh,sqrtzl); Add22(&allh,&alll,PIHALFH,PIHALFM,pTimesSh,pTimesSl); /* Multiply by sign */ asinh = sign * allh; asinm = sign * alll; /* Rounding test The RZ rounding constant is at tbl[TBLIDX10+55] */ TEST_AND_RETURN_RZ(asinh, asinm, tbl[TBLIDX10+55]); /* Launch accurate phase */ asin_accurate_higher(&asinh,&asinm,&asinl,z,sign); ReturnRoundTowardsZero3(asinh,asinm,asinl); } /* General 8 main intervals We can already suppose that BOUND1 <= x <= BOUND9 */ if (xdb.i[HI] < BOUND5) { if (xdb.i[HI] < BOUND3) { if (xdb.i[HI] < BOUND2) i = TBLIDX2; else i = TBLIDX3; } else { if (xdb.i[HI] < BOUND4) i = TBLIDX4; else i = TBLIDX5; } } else { if (xdb.i[HI] < BOUND7) { if (xdb.i[HI] < BOUND6) i = TBLIDX6; else i = TBLIDX7; } else { if (xdb.i[HI] < BOUND8) i = TBLIDX8; else i = TBLIDX9; } } /* Argument reduction i points to the interval midpoint value in the table */ z = x - tbl[i]; /* Quick phase starts */ /* Double precision evaluation */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(FMA(FMA(FMA( tbl[i+35] ,z,tbl[i+33]),z,tbl[i+31]),z,tbl[i+29]),z, tbl[i+27]),z,tbl[i+25]),z,tbl[i+23]),z,tbl[i+21]); #else highPoly = tbl[i+21] + z * (tbl[i+23] + z * (tbl[i+25] + z * ( tbl[i+27] + z * (tbl[i+29] + z * (tbl[i+31] + z * ( tbl[i+33] + z * tbl[i+35])))))); #endif /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[i+18],tbl[i+19],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[i+15],tbl[i+16],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[i+12],tbl[i+13],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[i+9],tbl[i+10],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[i+6],tbl[i+7],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[i+3],tbl[i+4],z,t5h,t5l); MulAdd212(&polyh,&polyl,tbl[i+1],tbl[i+2],z,t6h,t6l); /* Multiply by sign */ asinh = sign * polyh; asinm = sign * polyl; /* Rounding test The RZ rounding constant is at tbl[i+60] */ TEST_AND_RETURN_RZ(asinh, asinm, tbl[i+60]); /* Launch accurate phase */ asin_accurate_middle(&asinh,&asinm,&asinl,z,i,sign); ReturnRoundTowardsZero3(asinh,asinm,asinl); } interval-2.1.0/src/crlibm/asin-td.h0000644000000000000000000015366713031036767015263 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" /* File generated by maple/asin-td.mpl */ /* High order words of interval bounds (low order word is 0) */ #define BOUND1 0x3FC7AE14 #define BOUND2 0x3FD32E91 #define BOUND3 0x3FD9CA24 #define BOUND4 0x3FDF90B3 #define BOUND5 0x3FE23ADC #define BOUND6 0x3FE4781D #define BOUND7 0x3FE647BB #define BOUND8 0x3FE7BC81 #define BOUND9 0x3FE8F5C2 #define EXTRABOUND 0x3F500000 /* Pi/2 as a triple-double*/ #define PIHALFH 1.57079632679489655799898173427209258079528808593750e+00 #define PIHALFM 6.12323399573676603586882014729198302312846062338790e-17 #define PIHALFL -1.49738490485916983294350817710599200835275047616952e-33 /* Indices to the following table */ #define TBLIDX2 36 #define TBLIDX3 97 #define TBLIDX4 158 #define TBLIDX5 219 #define TBLIDX6 280 #define TBLIDX7 341 #define TBLIDX8 402 #define TBLIDX9 463 #define TBLIDX10 524 /* Table with midpoints and polynomial coefficients */ static const double tbl[580] = { 1.66666666666666657414808128123695496469736099243164e-01, /* 0, accPolyLowC3h, quickPolyLowC3h */ 9.25185853854297065661561206416060845590588197735272e-18, /* 1, accPolyLowC3m, quickPolyLowC3l */ 5.13580782192052290146917464639635163327575367072527e-34, /* 2, accPolyLowC3l */ 7.49999999999999972244424384371086489409208297729492e-02, /* 3, accPolyLowC5h, quickPolyLowC5h */ 2.77555756156289150513347472120591902572823540679419e-18, /* 4, accPolyLowC5m, quickPolyLowC5l */ -1.43929408167863119589461549455410834291155585333144e-34, /* 5, accPolyLowC5l */ 4.46428571428571438484134148438897682353854179382324e-02, /* 6, accPolyLowC7h, quickPolyLowC7h */ -9.91270557701064540788749549275225920938048550224136e-19, /* 7, accPolyLowC7m, quickPolyLowC7l */ 3.33748090721822991762574824757600091731436462508019e-35, /* 8, accPolyLowC7l */ 3.03819444444444440589503386718206456862390041351318e-02, /* 9, accPolyLowC9h, quickPolyLowC9h */ 3.85494105812324030564107341625454073114449944250081e-19, /* 10, accPolyLowC9m, quickPolyLowC9l */ -1.43865090242821346711405668429425189868490718470116e-36, /* 11, accPolyLowC9l */ 2.23721590909090918553037141691675060428678989410400e-02, /* 12, accPolyLowC11h, quickPolyLowC11h */ -9.46212831143868745925658651601400487408631908148174e-19, /* 13, accPolyLowC11m, quickPolyLowC11l */ 2.71756033709005426155900473576766627205226477546134e-36, /* 14, accPolyLowC11l */ 1.73527644230769238775646812200648128055036067962646e-02, /* 15, accPolyLowC13h, quickPolyLowC13h */ -8.00631194349979385750725428497500824341216859291999e-19, /* 16, accPolyLowC13m */ 1.39648437500000006938893903907228377647697925567627e-02, /* 17, accPolyLowC15h, quickPolyLowC15h */ -6.96640576418186252434826298980545123112053091491650e-19, /* 18, accPolyLowC15m */ 1.15518008961397068007359578700743441004306077957153e-02, /* 19, accPolyLowC17h, quickPolyLowC17h */ -4.10583074045422929898575008733550170923265860856307e-19, /* 20, accPolyLowC17m */ 9.76160952919401074534544449079476180486381053924561e-03, /* 21, accPolyLowC19h, quickPolyLowC19h */ 3.58257464358998522024321439568214748872569190564464e-19, /* 22, accPolyLowC19m */ 8.39033580962353364718353532225592061877250671386719e-03, /* 23, accPolyLowC21h, quickPolyLowC21h */ 7.09494992486164270601178799400238696830257336508353e-20, /* 24, accPolyLowC21m */ 7.31252587309846099200560942676929698791354894638062e-03, /* 25, accPolyLowC23h */ 3.10147942381298802750887889395221073583507364742961e-19, /* 26, accPolyLowC23m */ 6.44721034012319445943850482194648066069930791854858e-03, /* 27, accPolyLowC25h */ 5.74003646399263555560876781669321644585579633712769e-03, /* 28, accPolyLowC27h */ 5.15334845775329911110596015078044729307293891906738e-03, /* 29, accPolyLowC29h */ 4.65922376559379288613049752143524528946727514266968e-03, /* 30, accPolyLowC31h */ 4.25648267385331235956869022629689425230026245117188e-03, /* 31, accPolyLowC33h */ 3.70384206863821549560178425508638611063361167907715e-03, /* 32, accPolyLowC35h */ 4.76149788232017000255691385746104060672223567962646e-03, /* 33, accPolyLowC37h */ 1.01829039548491739886060258868383243680000305175781e+00, /* 34, RN rounding constant quick poly low*/ 9.99456520626465193846360776661410034560333454445527e-19, /* 35, RD rounding constant quick poly low*/ 2.42358565330489938993707710324088111519813537597656e-01, /* 36, midpoint in interval 2*/ 2.44796158322043572175275016888917889446020126342773e-01, /* 37, accPolyMid2C0h, quickPolyMid2C0h */ -7.80764437719474476036120943295127199090063761923808e-18, /* 38, accPolyMid2C0m, quickPolyMid2C0l */ 1.03072939530366736171629327145637944340705871582031e+00, /* 39, accPolyMid2C1h, quickPolyMid2C1h */ -8.85738929015520959086405013050480695702241994387953e-17, /* 40, accPolyMid2C1m, quickPolyMid2C1l */ -3.43332793693232296155057781643135490790330671255580e-33, /* 41, accPolyMid2C1l */ 1.32697384480218755209435244069027248769998550415039e-01, /* 42, accPolyMid2C2h, quickPolyMid2C2h */ -3.05519908299053827321743308736081906443885446585898e-18, /* 43, accPolyMid2C2m, quickPolyMid2C2l */ 1.84968471282800310046349200266639560111473343387153e-34, /* 44, accPolyMid2C2l */ 2.16675601140875473404889817174989730119705200195312e-01, /* 45, accPolyMid2C3h, quickPolyMid2C3h */ -1.09855192148394476119822843562855651270724326884774e-18, /* 46, accPolyMid2C3m, quickPolyMid2C3l */ 1.30965185306611444030805369954695892224998714815939e-35, /* 47, accPolyMid2C3l */ 1.16730419643667523987851097899692831560969352722168e-01, /* 48, accPolyMid2C4h, quickPolyMid2C4h */ 4.87619704882669077472238320833491156897798846867617e-18, /* 49, accPolyMid2C4m, quickPolyMid2C4l */ 2.44421677078199513698242322477237313066476585423275e-34, /* 50, accPolyMid2C4l */ 1.45667026718228842518954024853883311152458190917969e-01, /* 51, accPolyMid2C5h, quickPolyMid2C5h */ 5.36594969153474426628449995112694156468179831261122e-19, /* 52, accPolyMid2C5m, quickPolyMid2C5l */ 8.48516201835513020738766305454795330663195678132569e-36, /* 53, accPolyMid2C5l */ 1.22401266966440255834491779296513414010405540466309e-01, /* 54, accPolyMid2C6h, quickPolyMid2C6h */ -2.20822551943355103564859204431825679093840107651564e-19, /* 55, accPolyMid2C6m, quickPolyMid2C6l */ -8.07441439403117291580512089023909180599052269668925e-36, /* 56, accPolyMid2C6l */ 1.41642750696223979067767118067422416061162948608398e-01, /* 57, accPolyMid2C7h, quickPolyMid2C7h */ 8.52401858052517523392878261510621535534995050169401e-18, /* 58, accPolyMid2C7m, quickPolyMid2C7l */ 1.42861418735328621343327881731966044753789901733398e-01, /* 59, accPolyMid2C8h, quickPolyMid2C8h */ -1.33006668328318919665132697553096363383321713310227e-17, /* 60, accPolyMid2C8m */ 1.63718343060216098283632391030550934374332427978516e-01, /* 61, accPolyMid2C9h, quickPolyMid2C9h */ 6.13394557799256408251130704849071363459255390907063e-18, /* 62, accPolyMid2C9m */ 1.79592723769284340340490757625957485288381576538086e-01, /* 63, accPolyMid2C10h, quickPolyMid2C10h */ -1.30198260064097970981442998070110461849845662150849e-17, /* 64, accPolyMid2C10m */ 2.07951828711086583734157784419949166476726531982422e-01, /* 65, accPolyMid2C11h, quickPolyMid2C11h */ -1.26159975996932877835486818675875580593424383227469e-17, /* 66, accPolyMid2C11m */ 2.38247271379822073145149374795437324792146682739258e-01, /* 67, accPolyMid2C12h, quickPolyMid2C12h */ 6.62361216505959744828122635016705548667940611263800e-18, /* 68, accPolyMid2C12m */ 2.79893913215572998076652311283396556973457336425781e-01, /* 69, accPolyMid2C13h, quickPolyMid2C13h */ -2.24149827195062967543013296493616902343167004009288e-17, /* 70, accPolyMid2C13m */ 3.28958991769599307097848850389709696173667907714844e-01, /* 71, accPolyMid2C14h, quickPolyMid2C14h */ -1.05211249452308945191032281708802957418482198191124e-17, /* 72, accPolyMid2C14m */ 3.91766249806127564436764032507198862731456756591797e-01, /* 73, accPolyMid2C15h */ -2.02194096713130520849748106020797136930683180643846e-17, /* 74, accPolyMid2C15m */ 4.68246642053942785377529389734263531863689422607422e-01, /* 75, accPolyMid2C16h */ 5.64148787932559847568825261987512931227684020996094e-01, /* 76, accPolyMid2C17h */ 6.82488400757435664800709673727396875619888305664062e-01, /* 77, accPolyMid2C18h */ 8.30182127559316640486031246837228536605834960937500e-01, /* 78, accPolyMid2C19h */ 1.01367533043020308092252435017144307494163513183594e+00, /* 79, accPolyMid2C20h */ 1.24281078928695176699648072826676070690155029296875e+00, /* 80, accPolyMid2C21h */ 1.52877587404435177909078902303008362650871276855469e+00, /* 81, accPolyMid2C22h */ 1.88667637664635656769007709954166784882545471191406e+00, /* 82, accPolyMid2C23h */ 2.33494551765288571587575461308006197214126586914062e+00, /* 83, accPolyMid2C24h */ 2.89749244536000327698843648249749094247817993164062e+00, /* 84, accPolyMid2C25h */ 3.60426450740106130155027130967937409877777099609375e+00, /* 85, accPolyMid2C26h */ 4.49361107526955017021919047692790627479553222656250e+00, /* 86, accPolyMid2C27h */ 5.61406255377128715622347954194992780685424804687500e+00, /* 87, accPolyMid2C28h */ 7.02754870503224271516273802262730896472930908203125e+00, /* 88, accPolyMid2C29h */ 8.81280667340759649164283473510295152664184570312500e+00, /* 89, accPolyMid2C30h */ 1.10704407960507111852166417520493268966674804687500e+01, /* 90, accPolyMid2C31h */ 1.39282518419665830577969245496205985546112060546875e+01, /* 91, accPolyMid2C32h */ 1.75308292529565719064521545078605413436889648437500e+01, /* 92, accPolyMid2C33h */ 2.21169075633838900785121950320899486541748046875000e+01, /* 93, accPolyMid2C34h */ 2.93386309556562245859367976663634181022644042968750e+01, /* 94, accPolyMid2C35h */ 1.01656637119000103908206256164703518152236938476562e+00, /* 95, RN rounding constant quick poly middle 2*/ 9.05249299973766985475925981961240072045593429326050e-19, /* 96, RD rounding constant quick poly middle 2*/ 3.51339936256424290039745983449392952024936676025391e-01, /* 97, midpoint in interval 3*/ 3.59001896704258527392994437832385301589965820312500e-01, /* 98, accPolyMid3C0h, quickPolyMid3C0h */ 7.25234535377983806008993135801969933842904099082037e-20, /* 99, accPolyMid3C0m, quickPolyMid3C0l */ 1.06809311097735548656828541425056755542755126953125e+00, /* 100, accPolyMid3C1h, quickPolyMid3C1h */ 8.06569140638077604165107730077659782400969546746483e-17, /* 101, accPolyMid3C1m, quickPolyMid3C1l */ -5.04406564603486171676187418521136112402329884904383e-33, /* 102, accPolyMid3C1l */ 2.14054747447713134000935042422497645020484924316406e-01, /* 103, accPolyMid3C2h, quickPolyMid3C2h */ 9.76056255097027764696827253384241478483311533093656e-18, /* 104, accPolyMid3C2m, quickPolyMid3C2l */ -7.76857615284538540734861101748988881714638362963881e-35, /* 105, accPolyMid3C2l */ 2.88880884175958529969108212753781117498874664306641e-01, /* 106, accPolyMid3C3h, quickPolyMid3C3h */ 2.22181200821645624650165429361546283225838059740631e-17, /* 107, accPolyMid3C3m, quickPolyMid3C3l */ -1.14368045348414878337189405350442917783836545775590e-33, /* 108, accPolyMid3C3l */ 2.26134851489718013972662902233423665165901184082031e-01, /* 109, accPolyMid3C4h, quickPolyMid3C4h */ -8.04753534970505104224953947907869405284151781535028e-18, /* 110, accPolyMid3C4m, quickPolyMid3C4l */ 4.22557384286705919324956002465313457843707737945963e-34, /* 111, accPolyMid3C4l */ 2.75196923580072527748541233449941501021385192871094e-01, /* 112, accPolyMid3C5h, quickPolyMid3C5h */ -1.17338666986909136966078634618924264888220762222419e-18, /* 113, accPolyMid3C5m, quickPolyMid3C5l */ -4.68757737099062213529607300203132104484914350463871e-35, /* 114, accPolyMid3C5l */ 3.03044495521890500100425924756564199924468994140625e-01, /* 115, accPolyMid3C6h, quickPolyMid3C6h */ -2.27411416594910816511289518687103845115091724313899e-17, /* 116, accPolyMid3C6m, quickPolyMid3C6l */ 2.34762544350785348445971766662785127027332739123595e-34, /* 117, accPolyMid3C6l */ 3.77749573081396394780284708758699707686901092529297e-01, /* 118, accPolyMid3C7h, quickPolyMid3C7h */ 7.89247891096042648893247867692397394548591651092283e-18, /* 119, accPolyMid3C7m, quickPolyMid3C7l */ 4.68287147615184806692667507377336733043193817138672e-01, /* 120, accPolyMid3C8h, quickPolyMid3C8h */ 1.75668374099909928545987828472120658936175220036884e-17, /* 121, accPolyMid3C8m */ 6.06111063535901939403061078337486833333969116210938e-01, /* 122, accPolyMid3C9h, quickPolyMid3C9h */ 1.72730090011832304135009947489517024111046794620020e-17, /* 123, accPolyMid3C9m */ 7.92895790821915635859795656870119273662567138671875e-01, /* 124, accPolyMid3C10h, quickPolyMid3C10h */ 4.98295614974968378037947765656866085023078681863398e-17, /* 125, accPolyMid3C10m */ 1.05810730062141522545005045685684308409690856933594e+00, /* 126, accPolyMid3C11h, quickPolyMid3C11h */ 8.05577049603995800072512132781137905047707942749781e-17, /* 127, accPolyMid3C11m */ 1.42745521004660447239587028889218345284461975097656e+00, /* 128, accPolyMid3C12h, quickPolyMid3C12h */ -4.55985728468522936328504707804310204497673421624067e-17, /* 129, accPolyMid3C12m */ 1.94854789175488596342233904579188674688339233398438e+00, /* 130, accPolyMid3C13h, quickPolyMid3C13h */ 3.84783704422594121999348237839996274693704597202448e-17, /* 131, accPolyMid3C13m */ 2.68312408725385909136207374103832989931106567382812e+00, /* 132, accPolyMid3C14h, quickPolyMid3C14h */ -3.56068007836116005017028996147996121343986693197868e-17, /* 133, accPolyMid3C14m */ 3.72473732217660824517224682494997978210449218750000e+00, /* 134, accPolyMid3C15h */ -5.87298986037438700709055565377465605786708153319628e-17, /* 135, accPolyMid3C15m */ 5.20573944915823361156981263775378465652465820312500e+00, /* 136, accPolyMid3C16h */ 7.31989734855592644180433126166462898254394531250000e+00, /* 137, accPolyMid3C17h */ 1.03473141302088169624084912356920540332794189453125e+01, /* 138, accPolyMid3C18h */ 1.46964937699531184023271634941920638084411621093750e+01, /* 139, accPolyMid3C19h */ 2.09624579630017748854697856586426496505737304687500e+01, /* 140, accPolyMid3C20h */ 3.00147629377676423700904706493020057678222656250000e+01, /* 141, accPolyMid3C21h */ 4.31254748908798717366153141483664512634277343750000e+01, /* 142, accPolyMid3C22h */ 6.21591110441626426563743734732270240783691406250000e+01, /* 143, accPolyMid3C23h */ 8.98523523311889533715657307766377925872802734375000e+01, /* 144, accPolyMid3C24h */ 1.30228138287161243624723283573985099792480468750000e+02, /* 145, accPolyMid3C25h */ 1.89208159704443204418566892854869365692138671875000e+02, /* 146, accPolyMid3C26h */ 2.75520543663640125942038139328360557556152343750000e+02, /* 147, accPolyMid3C27h */ 4.02045721388318213485035812482237815856933593750000e+02, /* 148, accPolyMid3C28h */ 5.87814144421144646912580356001853942871093750000000e+02, /* 149, accPolyMid3C29h */ 8.60974558223577218996069859713315963745117187500000e+02, /* 150, accPolyMid3C30h */ 1.26323081508058703548158518970012664794921875000000e+03, /* 151, accPolyMid3C31h */ 1.85633061099108476810215506702661514282226562500000e+03, /* 152, accPolyMid3C32h */ 2.72831792235129523760406300425529479980468750000000e+03, /* 153, accPolyMid3C33h */ 4.02017366871190233723609708249568939208984375000000e+03, /* 154, accPolyMid3C34h */ 6.26169941241203287063399329781532287597656250000000e+03, /* 155, accPolyMid3C35h */ 1.01822826558956558429258620890323072671890258789062e+00, /* 156, RN rounding constant quick poly middle 3*/ 9.96061507703610851328544443284249848383807032724405e-19, /* 157, RD rounding constant quick poly middle 3*/ 4.48084712028450460330475380033021792769432067871094e-01, /* 158, midpoint in interval 4*/ 4.64621784296265272207193675058078952133655548095703e-01, /* 159, accPolyMid4C0h, quickPolyMid4C0h */ 5.46463478154141631687941857567549378870836612391668e-19, /* 160, accPolyMid4C0m, quickPolyMid4C0l */ 1.11857936563137916330390453367726877331733703613281e+00, /* 161, accPolyMid4C1h, quickPolyMid4C1h */ -7.52084787570938032181667127523977366268049041253541e-17, /* 162, accPolyMid4C1m, quickPolyMid4C1l */ -2.09600667283052949148765250630641631769479132030207e-33, /* 163, accPolyMid4C1l */ 3.13567137932624417917537584798992611467838287353516e-01, /* 164, accPolyMid4C2h, quickPolyMid4C2h */ -4.41710443385272069717070263863657699262849649693148e-18, /* 165, accPolyMid4C2m, quickPolyMid4C2l */ -1.66857777421172326251970639278136259133415308172276e-34, /* 166, accPolyMid4C2l */ 4.09066962553200574870260197712923400104045867919922e-01, /* 167, accPolyMid4C3h, quickPolyMid4C3h */ -1.77243968292023797220078441566237340174840093946990e-17, /* 168, accPolyMid4C3m, quickPolyMid4C3l */ 1.04993340346633219191766382762445818927028795922212e-33, /* 169, accPolyMid4C3l */ 4.17460970109683637829789404349867254495620727539062e-01, /* 170, accPolyMid4C4h, quickPolyMid4C4h */ 1.39418041407988360348752433713233257018150500547568e-17, /* 171, accPolyMid4C4m, quickPolyMid4C4l */ 1.44515287253394191526867297316859284672731580248765e-33, /* 172, accPolyMid4C4l */ 5.57995436127318722441259524202905595302581787109375e-01, /* 173, accPolyMid4C5h, quickPolyMid4C5h */ 4.36037702989507667583407786816694605825360677277616e-17, /* 174, accPolyMid4C5m, quickPolyMid4C5l */ -1.19172250052693786129959971158569652849573416545361e-33, /* 175, accPolyMid4C5l */ 7.47841169204912281642805282899644225835800170898438e-01, /* 176, accPolyMid4C6h, quickPolyMid4C6h */ -6.76313448015089834151929838334258544557222273487418e-18, /* 177, accPolyMid4C6m, quickPolyMid4C6l */ -3.47721914174083040302762713955940912153154957518196e-34, /* 178, accPolyMid4C6l */ 1.07444730844797153856973181973444297909736633300781e+00, /* 179, accPolyMid4C7h, quickPolyMid4C7h */ 7.55340134261966180374112563614849022138812950329448e-17, /* 180, accPolyMid4C7m, quickPolyMid4C7l */ 1.58041645549890685806815326941432431340217590332031e+00, /* 181, accPolyMid4C8h, quickPolyMid4C8h */ 4.80894355381610072868748091065730787867334028863435e-17, /* 182, accPolyMid4C8m */ 2.39169226022640657447482226416468620300292968750000e+00, /* 183, accPolyMid4C9h, quickPolyMid4C9h */ 1.26753183127964275508490032426937968441812593935712e-16, /* 184, accPolyMid4C9m */ 3.68572936227336489523054297023918479681015014648438e+00, /* 185, accPolyMid4C10h, quickPolyMid4C10h */ -1.41660589025860946857878120315437315934718409357086e-16, /* 186, accPolyMid4C10m */ 5.77285150262833735013145997072570025920867919921875e+00, /* 187, accPolyMid4C11h, quickPolyMid4C11h */ -2.16740363176565772841534018366824459554498708631527e-16, /* 188, accPolyMid4C11m */ 9.15766592727227646264509530737996101379394531250000e+00, /* 189, accPolyMid4C12h, quickPolyMid4C12h */ 4.37180613264180824186691777532090455983551321485214e-16, /* 190, accPolyMid4C12m */ 1.46862422532599090629901184001937508583068847656250e+01, /* 191, accPolyMid4C13h, quickPolyMid4C13h */ 7.89614550363306335166404831558856161121412865593061e-16, /* 192, accPolyMid4C13m */ 2.37692237950290667924946319544687867164611816406250e+01, /* 193, accPolyMid4C14h, quickPolyMid4C14h */ -3.50255834101571646092598176937562449597971181913456e-16, /* 194, accPolyMid4C14m */ 3.87753699929054533868111320771276950836181640625000e+01, /* 195, accPolyMid4C15h */ 5.67060321723933067329766411373458413340348986762113e-16, /* 196, accPolyMid4C15m */ 6.36909499334141528947839105967432260513305664062500e+01, /* 197, accPolyMid4C16h */ 1.05248620915111246176820714026689529418945312500000e+02, /* 198, accPolyMid4C17h */ 1.74851057791898000459696049802005290985107421875000e+02, /* 199, accPolyMid4C18h */ 2.91864013611726591079786885529756546020507812500000e+02, /* 200, accPolyMid4C19h */ 4.89259682748188197365379892289638519287109375000000e+02, /* 201, accPolyMid4C20h */ 8.23309003242859603233227971941232681274414062500000e+02, /* 202, accPolyMid4C21h */ 1.39025484827954846878128591924905776977539062500000e+03, /* 203, accPolyMid4C22h */ 2.35504246227568182803224772214889526367187500000000e+03, /* 204, accPolyMid4C23h */ 4.00090205201026492431992664933204650878906250000000e+03, /* 205, accPolyMid4C24h */ 6.81504309301592911651823669672012329101562500000000e+03, /* 206, accPolyMid4C25h */ 1.16369648030766729789320379495620727539062500000000e+04, /* 207, accPolyMid4C26h */ 1.99154708390699779556598514318466186523437500000000e+04, /* 208, accPolyMid4C27h */ 3.41546126991757555515505373477935791015625000000000e+04, /* 209, accPolyMid4C28h */ 5.86883344113872444722801446914672851562500000000000e+04, /* 210, accPolyMid4C29h */ 1.01027682393336552195250988006591796875000000000000e+05, /* 211, accPolyMid4C30h */ 1.74209975080082920612767338752746582031250000000000e+05, /* 212, accPolyMid4C31h */ 3.00874278784890950191766023635864257812500000000000e+05, /* 213, accPolyMid4C32h */ 5.19633023773909430019557476043701171875000000000000e+05, /* 214, accPolyMid4C33h */ 8.99866392232198733836412429809570312500000000000000e+05, /* 215, accPolyMid4C34h */ 1.65235977806337876245379447937011718750000000000000e+06, /* 216, accPolyMid4C35h */ 1.01836010491198658556299960764590650796890258789062e+00, /* 217, RN rounding constant quick poly middle 4*/ 1.00326570788492020170486150590740535840759810902416e-18, /* 218, RD rounding constant quick poly middle 4*/ 5.31445860862679642089290155126946046948432922363281e-01, /* 219, midpoint in interval 5*/ 5.60306504963744567149319664167705923318862915039062e-01, /* 220, accPolyMid5C0h, quickPolyMid5C0h */ -1.08630439217163180480513733763948654678554607776160e-20, /* 221, accPolyMid5C0m, quickPolyMid5C0l */ 1.18050895658762322604218297783518210053443908691406e+00, /* 222, accPolyMid5C1h, quickPolyMid5C1h */ -3.44936676454714048889716658635127499762917269870727e-17, /* 223, accPolyMid5C1m, quickPolyMid5C1l */ -2.49069456197248953275668118371299181194287558355700e-33, /* 224, accPolyMid5C1l */ 4.37156452058995781406736114149680361151695251464844e-01, /* 225, accPolyMid5C2h, quickPolyMid5C2h */ 4.12350542001181384975859432610288269290340424486530e-18, /* 226, accPolyMid5C2m, quickPolyMid5C2l */ 2.73553164822567581206451159459555826955342358406517e-34, /* 227, accPolyMid5C2l */ 5.97961581435785594074161508615361526608467102050781e-01, /* 228, accPolyMid5C3h, quickPolyMid5C3h */ 1.15786235462823532242451850040378867919657187923266e-17, /* 229, accPolyMid5C3m, quickPolyMid5C3l */ 6.70476163820618923333949946465040969013104876616743e-34, /* 230, accPolyMid5C3l */ 7.56654591443305823972309553937520831823348999023438e-01, /* 231, accPolyMid5C4h, quickPolyMid5C4h */ 5.63361768523770903650379304980880430544181403662856e-18, /* 232, accPolyMid5C4m, quickPolyMid5C4l */ 3.52518369310847108975654467573884198459173315811765e-35, /* 233, accPolyMid5C4l */ 1.15954888868330963092034835426602512598037719726562e+00, /* 234, accPolyMid5C5h, quickPolyMid5C5h */ -2.13088606479945404910718732635657047999226786224539e-17, /* 235, accPolyMid5C5m, quickPolyMid5C5l */ 1.01155988751211667735165829625236622533486662424891e-33, /* 236, accPolyMid5C5l */ 1.85057068266552660062984614341985434293746948242188e+00, /* 237, accPolyMid5C6h, quickPolyMid5C6h */ -4.13756595773451122099466439202037064387337671566669e-18, /* 238, accPolyMid5C6m, quickPolyMid5C6l */ 3.02843501360506226132120912500822054694900989592884e-34, /* 239, accPolyMid5C6l */ 3.11563743870884257702869035711046308279037475585938e+00, /* 240, accPolyMid5C7h, quickPolyMid5C7h */ -5.06302300821373603583774676357699499992045551579126e-17, /* 241, accPolyMid5C7m, quickPolyMid5C7l */ 5.40761322601296168244289219728671014308929443359375e+00, /* 242, accPolyMid5C8h, quickPolyMid5C8h */ 2.97487923575735998744301300115136435889001285861472e-16, /* 243, accPolyMid5C8m */ 9.62995354897343425193412258522585034370422363281250e+00, /* 244, accPolyMid5C9h, quickPolyMid5C9h */ 4.55607422255092503960684830342258039056296500032145e-16, /* 245, accPolyMid5C9m */ 1.74836661195630966858516330830752849578857421875000e+01, /* 246, accPolyMid5C10h, quickPolyMid5C10h */ 1.43590320985440421817158000882140332196152266840822e-15, /* 247, accPolyMid5C10m */ 3.22483723360128990975681517738848924636840820312500e+01, /* 248, accPolyMid5C11h, quickPolyMid5C11h */ -3.34403568343416729924334128939506733422536740966968e-15, /* 249, accPolyMid5C11m */ 6.02553715792408368656651873607188463211059570312500e+01, /* 250, accPolyMid5C12h, quickPolyMid5C12h */ 3.10919444878682139369989784864394611534570535618660e-15, /* 251, accPolyMid5C12m */ 1.13813051318643047693512926343828439712524414062500e+02, /* 252, accPolyMid5C13h, quickPolyMid5C13h */ -1.71698317353737059559128975443274184793142084909379e-15, /* 253, accPolyMid5C13m */ 2.16961936728312849709254805929958820343017578125000e+02, /* 254, accPolyMid5C14h, quickPolyMid5C14h */ 8.27079867974059458294192504441253562124411295719550e-15, /* 255, accPolyMid5C14m */ 4.16880179488225451223115669563412666320800781250000e+02, /* 256, accPolyMid5C15h */ -2.58735460985196142054738964992050729251298751831811e-14, /* 257, accPolyMid5C15m */ 8.06537874996876666955358814448118209838867187500000e+02, /* 258, accPolyMid5C16h */ 1.56984649251497876321082003414630889892578125000000e+03, /* 259, accPolyMid5C17h */ 3.07188686658870074097649194300174713134765625000000e+03, /* 260, accPolyMid5C18h */ 6.03970064736507720226654782891273498535156250000000e+03, /* 261, accPolyMid5C19h */ 1.19254227020427806564839556813240051269531250000000e+04, /* 262, accPolyMid5C20h */ 2.36373073951149926870130002498626708984375000000000e+04, /* 263, accPolyMid5C21h */ 4.70144622759458434302359819412231445312500000000000e+04, /* 264, accPolyMid5C22h */ 9.38077422737224260345101356506347656250000000000000e+04, /* 265, accPolyMid5C23h */ 1.87716130978103727102279663085937500000000000000000e+05, /* 266, accPolyMid5C24h */ 3.76631599838992522563785314559936523437500000000000e+05, /* 267, accPolyMid5C25h */ 7.57518066926909843459725379943847656250000000000000e+05, /* 268, accPolyMid5C26h */ 1.52703698454281571321189403533935546875000000000000e+06, /* 269, accPolyMid5C27h */ 3.08471154002460883930325508117675781250000000000000e+06, /* 270, accPolyMid5C28h */ 6.24343584097426943480968475341796875000000000000000e+06, /* 271, accPolyMid5C29h */ 1.26595813738393746316432952880859375000000000000000e+07, /* 272, accPolyMid5C30h */ 2.57133891378295645117759704589843750000000000000000e+07, /* 273, accPolyMid5C31h */ 5.23093272367429584264755249023437500000000000000000e+07, /* 274, accPolyMid5C32h */ 1.06415184183835312724113464355468750000000000000000e+08, /* 275, accPolyMid5C33h */ 2.17067016530691206455230712890625000000000000000000e+08, /* 276, accPolyMid5C34h */ 4.69394759797544836997985839843750000000000000000000e+08, /* 277, accPolyMid5C35h */ 1.01534217846377439187222080363426357507705688476562e+00, /* 278, RN rounding constant quick poly middle 5*/ 8.45008379631082379626014328492746516799371469048044e-19, /* 279, RD rounding constant quick poly middle 5*/ 6.04673624038476131836716831458033993840217590332031e-01, /* 280, midpoint in interval 6*/ 6.49356027282211423212743284238968044519424438476562e-01, /* 281, accPolyMid6C0h, quickPolyMid6C0h */ -1.25840412187919035681267493345871686399113240956856e-20, /* 282, accPolyMid6C0m, quickPolyMid6C0l */ 1.25553477869155938329015498311491683125495910644531e+00, /* 283, accPolyMid6C1h, quickPolyMid6C1h */ 5.00523898265236280615595780032763663310079252366513e-17, /* 284, accPolyMid6C1m, quickPolyMid6C1l */ 2.70452092654099855316456962656407597917508288905533e-33, /* 285, accPolyMid6C1l */ 5.98380278107774499218862729321699589490890502929688e-01, /* 286, accPolyMid6C2h, quickPolyMid6C2h */ 3.73915919375620074681511372815883902051293891666555e-18, /* 287, accPolyMid6C2m, quickPolyMid6C2l */ 1.02836809807342008154037540277599096854529496615931e-34, /* 288, accPolyMid6C2l */ 9.00232892880871604646131345361936837434768676757812e-01, /* 289, accPolyMid6C3h, quickPolyMid6C3h */ -1.70995008965645412422671790545314082452432030961170e-17, /* 290, accPolyMid6C3m, quickPolyMid6C3l */ 1.26596066229657064182610642365044212709535948254084e-33, /* 291, accPolyMid6C3l */ 1.38703629702026587366958665370475500822067260742188e+00, /* 292, accPolyMid6C4h, quickPolyMid6C4h */ 3.98819447215487913236315415179165676291502931117595e-17, /* 293, accPolyMid6C4m, quickPolyMid6C4l */ -6.55797179513908183565792353381331895988112885430413e-34, /* 294, accPolyMid6C4l */ 2.48954277308397298185127510805614292621612548828125e+00, /* 295, accPolyMid6C5h, quickPolyMid6C5h */ 9.74092851599686234698415065747156883706428073441651e-17, /* 296, accPolyMid6C5m, quickPolyMid6C5l */ 1.56743989943601791748641837689163542493404742470630e-33, /* 297, accPolyMid6C5l */ 4.72562522409656082800211152061820030212402343750000e+00, /* 298, accPolyMid6C6h, quickPolyMid6C6h */ 6.88679830761278595465306080986277758416307765996557e-18, /* 299, accPolyMid6C6m, quickPolyMid6C6l */ -9.47395090301458455484031652124848364407920780715874e-35, /* 300, accPolyMid6C6l */ 9.41432957016690785678747488418594002723693847656250e+00, /* 301, accPolyMid6C7h, quickPolyMid6C7h */ 8.62157085484702984705473460305131094967840256568931e-16, /* 302, accPolyMid6C7m, quickPolyMid6C7l */ 1.93709907584273430813937011407688260078430175781250e+01, /* 303, accPolyMid6C8h, quickPolyMid6C8h */ -1.40839418808440953673043657798045432960211596437085e-16, /* 304, accPolyMid6C8m */ 4.08734031574560177091370860580354928970336914062500e+01, /* 305, accPolyMid6C9h, quickPolyMid6C9h */ -2.98667469102598629922297846034715799734023919430673e-16, /* 306, accPolyMid6C9m */ 8.79464044588732321017232607118785381317138671875000e+01, /* 307, accPolyMid6C10h, quickPolyMid6C10h */ 3.61512961738881992095483091045503569454095245351219e-16, /* 308, accPolyMid6C10m */ 1.92241339189846911494896630756556987762451171875000e+02, /* 309, accPolyMid6C11h, quickPolyMid6C11h */ 6.61037281166591217605498682969545683054486597679533e-15, /* 310, accPolyMid6C11m */ 4.25700873706194784062972757965326309204101562500000e+02, /* 311, accPolyMid6C12h, quickPolyMid6C12h */ -6.48144847243744916328196408044704617877580310816854e-15, /* 312, accPolyMid6C12m */ 9.52958531675870517574367113411426544189453125000000e+02, /* 313, accPolyMid6C13h, quickPolyMid6C13h */ -3.41559781098088121115265032630996540232080319228480e-15, /* 314, accPolyMid6C13m */ 2.15300037043921429358306340873241424560546875000000e+03, /* 315, accPolyMid6C14h, quickPolyMid6C14h */ -4.69254271757335955512545725611899433103182087412275e-14, /* 316, accPolyMid6C14m */ 4.90290875724837587767979130148887634277343750000000e+03, /* 317, accPolyMid6C15h */ -4.54544125910656089453646656943432828883091406657613e-13, /* 318, accPolyMid6C15m */ 1.12422266608999743766617029905319213867187500000000e+04, /* 319, accPolyMid6C16h */ 2.59341556033402121101971715688705444335937500000000e+04, /* 320, accPolyMid6C17h */ 6.01463753209276546840555965900421142578125000000000e+04, /* 321, accPolyMid6C18h */ 1.40155647347781836288049817085266113281250000000000e+05, /* 322, accPolyMid6C19h */ 3.27990517748617625329643487930297851562500000000000e+05, /* 323, accPolyMid6C20h */ 7.70511269948243047110736370086669921875000000000000e+05, /* 324, accPolyMid6C21h */ 1.81638100581354671157896518707275390625000000000000e+06, /* 325, accPolyMid6C22h */ 4.29545835214607417583465576171875000000000000000000e+06, /* 326, accPolyMid6C23h */ 1.01875211922164466232061386108398437500000000000000e+07, /* 327, accPolyMid6C24h */ 2.42259292905952110886573791503906250000000000000000e+07, /* 328, accPolyMid6C25h */ 5.77502706188629567623138427734375000000000000000000e+07, /* 329, accPolyMid6C26h */ 1.37977551882563471794128417968750000000000000000000e+08, /* 330, accPolyMid6C27h */ 3.30348046445899784564971923828125000000000000000000e+08, /* 331, accPolyMid6C28h */ 7.92463843911740779876708984375000000000000000000000e+08, /* 332, accPolyMid6C29h */ 1.90447027047677397727966308593750000000000000000000e+09, /* 333, accPolyMid6C30h */ 4.58479383261657714843750000000000000000000000000000e+09, /* 334, accPolyMid6C31h */ 1.10545369624155406951904296875000000000000000000000e+10, /* 335, accPolyMid6C32h */ 2.66385731955786666870117187500000000000000000000000e+10, /* 336, accPolyMid6C33h */ 6.43976383194783477783203125000000000000000000000000e+10, /* 337, accPolyMid6C34h */ 1.66775070729799957275390625000000000000000000000000e+11, /* 338, accPolyMid6C35h */ 1.02820225588634994728920446505071595311164855957031e+00, /* 339, RN rounding constant quick poly middle 6*/ 1.54107813388901044122294580378974284123051351850249e-18, /* 340, RD rounding constant quick poly middle 6*/ 6.67959213256959061233430929860332980751991271972656e-01, /* 341, midpoint in interval 7*/ 7.31463137281961883751080222282325848937034606933594e-01, /* 342, accPolyMid7C0h, quickPolyMid7C0h */ 8.54719742452471207894475172794621662948903828511743e-18, /* 343, accPolyMid7C0m, quickPolyMid7C0l */ 1.34372862717732943771409281907835975289344787597656e+00, /* 344, accPolyMid7C1h, quickPolyMid7C1h */ -9.37080278359462608557638680730489336344772507156678e-17, /* 345, accPolyMid7C1m, quickPolyMid7C1l */ -3.73014429525577422762683976038701673929582903516469e-33, /* 346, accPolyMid7C1l */ 8.10316454021746457314634426438715308904647827148438e-01, /* 347, accPolyMid7C2h, quickPolyMid7C2h */ 2.83724520944754281479328686665519600224801269794297e-17, /* 348, accPolyMid7C2m, quickPolyMid7C2l */ 5.82045706927347254178829289360700371297572159541923e-34, /* 349, accPolyMid7C2l */ 1.38167386397960734178980146680260077118873596191406e+00, /* 350, accPolyMid7C3h, quickPolyMid7C3h */ 2.02013329353188582679931981349209152232167295906717e-17, /* 351, accPolyMid7C3m, quickPolyMid7C3l */ 6.40114855650846168897999343294667085370954557070054e-34, /* 352, accPolyMid7C3l */ 2.57070122683855739609271040535531938076019287109375e+00, /* 353, accPolyMid7C4h, quickPolyMid7C4h */ -1.97101208773651620042078427599655545421327570922328e-16, /* 354, accPolyMid7C4m, quickPolyMid7C4l */ -5.16498810795509657208158829628186048443297866770160e-33, /* 355, accPolyMid7C4l */ 5.46327133150128840810566543950699269771575927734375e+00, /* 356, accPolyMid7C5h, quickPolyMid7C5h */ 4.46002282634806142830756936399426613343260291679165e-17, /* 357, accPolyMid7C5m, quickPolyMid7C5l */ 1.00630542800586945033209683978834296850153546719007e-33, /* 358, accPolyMid7C5l */ 1.23592045140328163910226066946052014827728271484375e+01, /* 359, accPolyMid7C6h, quickPolyMid7C6h */ -6.31168277706663387163074158423931222709606927382536e-16, /* 360, accPolyMid7C6m, quickPolyMid7C6l */ -2.86577343636081880556771704346742846876298657614067e-32, /* 361, accPolyMid7C6l */ 2.92955857889283457495821494376286864280700683593750e+01, /* 362, accPolyMid7C7h, quickPolyMid7C7h */ 1.68044477586948138119056363287999050823887212287311e-15, /* 363, accPolyMid7C7m, quickPolyMid7C7l */ 7.17613428086569200559097225777804851531982421875000e+01, /* 364, accPolyMid7C8h, quickPolyMid7C8h */ 6.23119826880857970524569208326049427014155061843592e-15, /* 365, accPolyMid7C8m */ 1.80247733513940403327069361694157123565673828125000e+02, /* 366, accPolyMid7C9h, quickPolyMid7C9h */ 5.02375884230076452151557056132473497202104361844532e-15, /* 367, accPolyMid7C9m */ 4.61706463186508131002483423799276351928710937500000e+02, /* 368, accPolyMid7C10h, quickPolyMid7C10h */ 1.87384815286128587607402694756722954854896712184598e-14, /* 369, accPolyMid7C10m */ 1.20148795335111071835854090750217437744140625000000e+03, /* 370, accPolyMid7C11h, quickPolyMid7C11h */ 2.60459063066423653270039910766913797650205005668189e-14, /* 371, accPolyMid7C11m */ 3.16745162323707290852325968444347381591796875000000e+03, /* 372, accPolyMid7C12h, quickPolyMid7C12h */ -2.76092355337723539107271551080313829589234133482512e-14, /* 373, accPolyMid7C12m */ 8.44145526317249823478050529956817626953125000000000e+03, /* 374, accPolyMid7C13h, quickPolyMid7C13h */ -2.33235416338613018856460888065680920494017469568604e-13, /* 375, accPolyMid7C13m */ 2.27054147369064739905297756195068359375000000000000e+04, /* 376, accPolyMid7C14h, quickPolyMid7C14h */ -3.76196185348520617410321355221587231933578349130087e-13, /* 377, accPolyMid7C14m */ 6.15579784849813586333766579627990722656250000000000e+04, /* 378, accPolyMid7C15h */ -5.34885488214934542022410271185570626302323293810304e-13, /* 379, accPolyMid7C15m */ 1.68046954551722796168178319931030273437500000000000e+05, /* 380, accPolyMid7C16h */ 4.61530358172978565562516450881958007812500000000000e+05, /* 381, accPolyMid7C17h */ 1.27435135728149255737662315368652343750000000000000e+06, /* 382, accPolyMid7C18h */ 3.53543876571432314813137054443359375000000000000000e+06, /* 383, accPolyMid7C19h */ 9.85027146846828423440456390380859375000000000000000e+06, /* 384, accPolyMid7C20h */ 2.75499693650120757520198822021484375000000000000000e+07, /* 385, accPolyMid7C21h */ 7.73223713417402952909469604492187500000000000000000e+07, /* 386, accPolyMid7C22h */ 2.17703077316092193126678466796875000000000000000000e+08, /* 387, accPolyMid7C23h */ 6.14725288059689402580261230468750000000000000000000e+08, /* 388, accPolyMid7C24h */ 1.74040800223112154006958007812500000000000000000000e+09, /* 389, accPolyMid7C25h */ 4.93950269498267459869384765625000000000000000000000e+09, /* 390, accPolyMid7C26h */ 1.40506579253189964294433593750000000000000000000000e+10, /* 391, accPolyMid7C27h */ 4.00515555251962203979492187500000000000000000000000e+10, /* 392, accPolyMid7C28h */ 1.14389701296316925048828125000000000000000000000000e+11, /* 393, accPolyMid7C29h */ 3.27296809500310974121093750000000000000000000000000e+11, /* 394, accPolyMid7C30h */ 9.38089913584087280273437500000000000000000000000000e+11, /* 395, accPolyMid7C31h */ 2.69293079636161279296875000000000000000000000000000e+12, /* 396, accPolyMid7C32h */ 7.72833097677600292968750000000000000000000000000000e+12, /* 397, accPolyMid7C33h */ 2.22444558194129648437500000000000000000000000000000e+13, /* 398, accPolyMid7C34h */ 6.82401753565838359375000000000000000000000000000000e+13, /* 399, accPolyMid7C35h */ 1.01740290807493916069859096751315519213676452636719e+00, /* 400, RN rounding constant quick poly middle 7*/ 9.50960845417677113226513686606015976666256457529322e-19, /* 401, RD rounding constant quick poly middle 7*/ 7.19008445739778290217714129539672285318374633789062e-01, /* 402, midpoint in interval 8*/ 8.02374569969830475635319544380763545632362365722656e-01, /* 403, accPolyMid8C0h, quickPolyMid8C0h */ -5.57232596267891548198947769768214754835408022265973e-18, /* 404, accPolyMid8C0m, quickPolyMid8C0l */ 1.43884615807450622071428369963541626930236816406250e+00, /* 405, accPolyMid8C1h, quickPolyMid8C1h */ 3.59501817700961691698905527113737832717163932379732e-17, /* 406, accPolyMid8C1m, quickPolyMid8C1l */ 1.42139791223330171535988185118707169939451756100115e-33, /* 407, accPolyMid8C1l */ 1.07089546798848767039658014255110174417495727539062e+00, /* 408, accPolyMid8C2h, quickPolyMid8C2h */ 7.12234409493595206110752393915421282220770659974638e-18, /* 409, accPolyMid8C2m, quickPolyMid8C2l */ 4.88803415361541961399074298884647415525574790319603e-34, /* 410, accPolyMid8C2l */ 2.09054748952818103546746897336561232805252075195312e+00, /* 411, accPolyMid8C3h, quickPolyMid8C3h */ -4.76201670474478458619338404030121517580491201111076e-17, /* 412, accPolyMid8C3m, quickPolyMid8C3l */ 9.85965711757934088944524691800382507878970211803297e-34, /* 413, accPolyMid8C3l */ 4.62886640680389760404978005681186914443969726562500e+00, /* 414, accPolyMid8C4h, quickPolyMid8C4h */ -6.26076461255283992652654162871089011104493903198467e-17, /* 415, accPolyMid8C4m, quickPolyMid8C4l */ -3.79525038577018957662309046851941714013728344004132e-33, /* 416, accPolyMid8C4l */ 1.15940096700862280698629547259770333766937255859375e+01, /* 417, accPolyMid8C5h, quickPolyMid8C5h */ 5.00344758332442110044971487490682364429618307708619e-16, /* 418, accPolyMid8C5m, quickPolyMid8C5l */ 5.05400641998677592107699970650218041381398322944134e-33, /* 419, accPolyMid8C5l */ 3.09983076631741454320945194922387599945068359375000e+01, /* 420, accPolyMid8C6h, quickPolyMid8C6h */ -1.68695534318490565671111852385917462817518447859219e-16, /* 421, accPolyMid8C6m, quickPolyMid8C6l */ 6.85050661529605157727571454320758800953682098824324e-34, /* 422, accPolyMid8C6l */ 8.67969690247392975379625568166375160217285156250000e+01, /* 423, accPolyMid8C7h, quickPolyMid8C7h */ -5.77909319686569076564604963233208513019264259552576e-15, /* 424, accPolyMid8C7m, quickPolyMid8C7l */ 2.51207737556061232453430420719087123870849609375000e+02, /* 425, accPolyMid8C8h, quickPolyMid8C8h */ -2.34229223147066395573123458231502220325151528840246e-15, /* 426, accPolyMid8C8m */ 7.45516108151238086065859533846378326416015625000000e+02, /* 427, accPolyMid8C9h, quickPolyMid8C9h */ 5.42429462463291658149197032428663192617240449908134e-15, /* 428, accPolyMid8C9m */ 2.25637900900536169501719996333122253417968750000000e+03, /* 429, accPolyMid8C10h, quickPolyMid8C10h */ 1.04118075698860813774916020354956791986217497225642e-13, /* 430, accPolyMid8C10m */ 6.93796098101582811068510636687278747558593750000000e+03, /* 431, accPolyMid8C11h, quickPolyMid8C11h */ 8.59862281333229161222916847764065622815798321104674e-15, /* 432, accPolyMid8C11m */ 2.16119867410615115659311413764953613281250000000000e+04, /* 433, accPolyMid8C12h, quickPolyMid8C12h */ 1.06661614083783310365636876324959361083581990681246e-13, /* 434, accPolyMid8C12m */ 6.80579130650992592563852667808532714843750000000000e+04, /* 435, accPolyMid8C13h, quickPolyMid8C13h */ 6.62014084472278982961475227363418833651659278771717e-12, /* 436, accPolyMid8C13m */ 2.16307061102022911654785275459289550781250000000000e+05, /* 437, accPolyMid8C14h, quickPolyMid8C14h */ -2.44881501957370731470213892899278376432195547529602e-12, /* 438, accPolyMid8C14m */ 6.92960027312710066325962543487548828125000000000000e+05, /* 439, accPolyMid8C15h */ -5.66500973206806599245652257405055779448943553688878e-11, /* 440, accPolyMid8C15m */ 2.23531716476973146200180053710937500000000000000000e+06, /* 441, accPolyMid8C16h */ 7.25429400587130710482597351074218750000000000000000e+06, /* 442, accPolyMid8C17h */ 2.36685600768156014382839202880859375000000000000000e+07, /* 443, accPolyMid8C18h */ 7.75916356685774326324462890625000000000000000000000e+07, /* 444, accPolyMid8C19h */ 2.55452232123835593461990356445312500000000000000000e+08, /* 445, accPolyMid8C20h */ 8.44254469674954175949096679687500000000000000000000e+08, /* 446, accPolyMid8C21h */ 2.79994093996573638916015625000000000000000000000000e+09, /* 447, accPolyMid8C22h */ 9.31537507532041358947753906250000000000000000000000e+09, /* 448, accPolyMid8C23h */ 3.10820362568210334777832031250000000000000000000000e+10, /* 449, accPolyMid8C24h */ 1.03985438377022964477539062500000000000000000000000e+11, /* 450, accPolyMid8C25h */ 3.48737110205060913085937500000000000000000000000000e+11, /* 451, accPolyMid8C26h */ 1.17221005601944750976562500000000000000000000000000e+12, /* 452, accPolyMid8C27h */ 3.94841085036352832031250000000000000000000000000000e+12, /* 453, accPolyMid8C28h */ 1.33255264873973789062500000000000000000000000000000e+13, /* 454, accPolyMid8C29h */ 4.50540615593679062500000000000000000000000000000000e+13, /* 455, accPolyMid8C30h */ 1.52590744626434593750000000000000000000000000000000e+14, /* 456, accPolyMid8C31h */ 5.17610884067860062500000000000000000000000000000000e+14, /* 457, accPolyMid8C32h */ 1.75591888512180650000000000000000000000000000000000e+15, /* 458, accPolyMid8C33h */ 5.97247050283681300000000000000000000000000000000000e+15, /* 459, accPolyMid8C34h */ 2.15157732956128240000000000000000000000000000000000e+16, /* 460, accPolyMid8C35h */ 1.01155686685228385357504521380178630352020263671875e+00, /* 461, RN rounding constant quick poly middle 8*/ 6.36522991537283605877265237263241827159525525595558e-19, /* 462, RD rounding constant quick poly middle 8*/ 7.60880231857352207214262307388707995414733886718750e-01, /* 463, midpoint in interval 9*/ 8.64668552766275078091950945236021652817726135253906e-01, /* 464, accPolyMid9C0h, quickPolyMid9C0h */ 2.22107768610709483983000348580034922276618040094248e-19, /* 465, accPolyMid9C0m, quickPolyMid9C0l */ 1.54108768708640897493467036838410422205924987792969e+00, /* 466, accPolyMid9C1h, quickPolyMid9C1h */ 3.32820103504311843280112118328828427349507594590859e-17, /* 467, accPolyMid9C1m, quickPolyMid9C1l */ 1.00469319336666835386896691703426687648516206509999e-33, /* 468, accPolyMid9C1l */ 1.39241392226891269601196654548402875661849975585938e+00, /* 469, accPolyMid9C2h, quickPolyMid9C2h */ -7.78438411380474954824767774215038405507043967534661e-17, /* 470, accPolyMid9C2m, quickPolyMid9C2l */ -2.75498989204243544757760916231818015864525586405625e-34, /* 471, accPolyMid9C2l */ 3.12616775988369477445871780219022184610366821289062e+00, /* 472, accPolyMid9C3h, quickPolyMid9C3h */ -1.83136634474213254639590598215495010130375003296228e-16, /* 473, accPolyMid9C3m, quickPolyMid9C3l */ -1.37039877493057234685308732075670776376976824689825e-33, /* 474, accPolyMid9C3l */ 8.16374541867330982825023966142907738685607910156250e+00, /* 475, accPolyMid9C4h, quickPolyMid9C4h */ 6.61331422381139448266729896007647878117248843327786e-16, /* 476, accPolyMid9C4m, quickPolyMid9C4l */ -2.34411228408683938039171677313602417735464237635307e-32, /* 477, accPolyMid9C4l */ 2.39942774487262227012251969426870346069335937500000e+01, /* 478, accPolyMid9C5h, quickPolyMid9C5h */ 3.56709659583669727593018389598696746405922754956722e-16, /* 479, accPolyMid9C5m, quickPolyMid9C5l */ 1.92887188784617492937549821774446261489627075560113e-32, /* 480, accPolyMid9C5l */ 7.53789452793380974071624223142862319946289062500000e+01, /* 481, accPolyMid9C6h, quickPolyMid9C6h */ -4.89236491033052363530754653203901634957086880239885e-15, /* 482, accPolyMid9C6m, quickPolyMid9C6l */ 1.86966182047363315238712995890702987106854589421809e-31, /* 483, accPolyMid9C6l */ 2.47970017761763045882617007009685039520263671875000e+02, /* 484, accPolyMid9C7h, quickPolyMid9C7h */ -5.49773113276874172897358146458574130047619382341550e-15, /* 485, accPolyMid9C7m, quickPolyMid9C7l */ 8.43239639560233626980334520339965820312500000000000e+02, /* 486, accPolyMid9C8h, quickPolyMid9C8h */ 4.61444619149467756136937751706191309842186761003280e-14, /* 487, accPolyMid9C8m */ 2.94042238989191673681489191949367523193359375000000e+03, /* 488, accPolyMid9C9h, quickPolyMid9C9h */ -6.26529947434876144165574723786618699307871677151027e-14, /* 489, accPolyMid9C9m */ 1.04570596262470262445276603102684020996093750000000e+04, /* 490, accPolyMid9C10h, quickPolyMid9C10h */ 4.33811913399171164864172764349193352065910816994787e-13, /* 491, accPolyMid9C10m */ 3.77816423278584625222720205783843994140625000000000e+04, /* 492, accPolyMid9C11h, quickPolyMid9C11h */ -4.21825155017599752908316500880066660420734253600372e-14, /* 493, accPolyMid9C11m */ 1.38292932619114842964336276054382324218750000000000e+05, /* 494, accPolyMid9C12h, quickPolyMid9C12h */ -2.02223055949190022685968858135129700521678830504868e-12, /* 495, accPolyMid9C12m */ 5.11733514125351735856384038925170898437500000000000e+05, /* 496, accPolyMid9C13h, quickPolyMid9C13h */ -2.25025523408315347550056625257165819446736332309911e-11, /* 497, accPolyMid9C13m */ 1.91116705355792236514389514923095703125000000000000e+06, /* 498, accPolyMid9C14h, quickPolyMid9C14h */ -6.92308947161053801527502899602797403061371639410027e-11, /* 499, accPolyMid9C14m */ 7.19450694938360899686813354492187500000000000000000e+06, /* 500, accPolyMid9C15h */ -3.25836107774239441972945896739397887709177581427866e-10, /* 501, accPolyMid9C15m */ 2.72708481033120900392532348632812500000000000000000e+07, /* 502, accPolyMid9C16h */ 1.03997450389555335044860839843750000000000000000000e+08, /* 503, accPolyMid9C17h */ 3.98720516462098360061645507812500000000000000000000e+08, /* 504, accPolyMid9C18h */ 1.53596677859462237358093261718750000000000000000000e+09, /* 505, accPolyMid9C19h */ 5.94220454070446586608886718750000000000000000000000e+09, /* 506, accPolyMid9C20h */ 2.30771902569618682861328125000000000000000000000000e+10, /* 507, accPolyMid9C21h */ 8.99354036055935974121093750000000000000000000000000e+10, /* 508, accPolyMid9C22h */ 3.51604905808161804199218750000000000000000000000000e+11, /* 509, accPolyMid9C23h */ 1.37859673609756665039062500000000000000000000000000e+12, /* 510, accPolyMid9C24h */ 5.41968316905909179687500000000000000000000000000000e+12, /* 511, accPolyMid9C25h */ 2.13586334787060429687500000000000000000000000000000e+13, /* 512, accPolyMid9C26h */ 8.43635735241271562500000000000000000000000000000000e+13, /* 513, accPolyMid9C27h */ 3.33923015327480937500000000000000000000000000000000e+14, /* 514, accPolyMid9C28h */ 1.32429009755987925000000000000000000000000000000000e+15, /* 515, accPolyMid9C29h */ 5.26147664189654100000000000000000000000000000000000e+15, /* 516, accPolyMid9C30h */ 2.09399836831170720000000000000000000000000000000000e+16, /* 517, accPolyMid9C31h */ 8.34692893106752000000000000000000000000000000000000e+16, /* 518, accPolyMid9C32h */ 3.32762568376608000000000000000000000000000000000000e+17, /* 519, accPolyMid9C33h */ 1.33003631888338841600000000000000000000000000000000e+18, /* 520, accPolyMid9C34h */ 5.62235923730283212800000000000000000000000000000000e+18, /* 521, accPolyMid9C35h */ 1.01049946711285376643729705392615869641304016113281e+00, /* 522, RN rounding constant quick poly middle 9*/ 5.78284088727747938003347592934948079832502681677348e-19, /* 523, RD rounding constant quick poly middle 9*/ -8.33333333333333287074040640618477482348680496215820e-02, /* 524, accPolyHighC1h, quickPolyHighC1h */ -4.62592926927148532830780603208030422795294098867636e-18, /* 525, accPolyHighC1m, quickPolyHighC1l */ -2.56790659251636222413745757067544746896901530409675e-34, /* 526, accPolyHighC1l */ -1.87499999999999993061106096092771622352302074432373e-02, /* 527, accPolyHighC2h, quickPolyHighC2h */ -6.93889390390722876283368680301479756432058851698546e-19, /* 528, accPolyHighC2m, quickPolyHighC2l */ 3.85185989241340205035888971870941307651344283492079e-35, /* 529, accPolyHighC2l */ -5.58035714285714298105167685548622102942317724227905e-03, /* 530, accPolyHighC3h, quickPolyHighC3h */ 1.23908819712629071293959090145008148963025205053831e-19, /* 531, accPolyHighC3m, quickPolyHighC3l */ 6.87827508933260239532125196237951282993345739214379e-36, /* 532, accPolyHighC3l */ -1.89887152777777775368439616698879035538993775844574e-03, /* 533, accPolyHighC4h, quickPolyHighC4h */ -2.40933816107889860849364897504182511872549009826894e-20, /* 534, accPolyHighC4m, quickPolyHighC4l */ -1.31413379554614650822698366533512762375439292005686e-36, /* 535, accPolyHighC4l */ -6.99129971590909120478241067786484563839621841907501e-04, /* 536, accPolyHighC5h, quickPolyHighC5h */ 2.95691501586955672658426997372092637662516651210484e-20, /* 537, accPolyHighC5m, quickPolyHighC5l */ 1.93248831638054158509225332576516713663708940033800e-36, /* 538, accPolyHighC5l */ -2.71136944110576935586948144063512700085993856191635e-04, /* 539, accPolyHighC6h, quickPolyHighC6h */ 1.25100250671414776773311485375106982275955017737813e-20, /* 540, accPolyHighC6m, quickPolyHighC6l */ -2.41797324682937785630481140742729367728409168219340e-37, /* 541, accPolyHighC6l */ -1.09100341796875005421010862427522170037264004349709e-04, /* 542, accPolyHighC7h, quickPolyHighC7h */ 5.42101086231091719294416952538483743258993211884145e-21, /* 543, accPolyHighC7m, quickPolyHighC7l */ 9.55338141209871258458343868890229946241110412925982e-38, /* 544, accPolyHighC7l */ -4.51242222505457229141112573955751940957270562648773e-05, /* 545, accPolyHighC8h, quickPolyHighC8h */ -3.18882990973711044045301474516264873522265001897356e-21, /* 546, accPolyHighC8m, quickPolyHighC8l */ 1.26912673390128847048400261536391292203355395300755e-37, /* 547, accPolyHighC8l */ -1.90656436117071843741425929419364138084347359836102e-05, /* 548, accPolyHighC9h, quickPolyHighC9h */ -1.06993691223935686411543055030763865855410413408366e-21, /* 549, accPolyHighC9m, quickPolyHighC9l */ -8.19368731407892096011823940271412425317976158112288e-06, /* 550, accPolyHighC10h, quickPolyHighC10h */ -4.03323388732262270981356256138402986149007425086112e-22, /* 551, accPolyHighC10m */ -3.57056927421818625395413641931963155684570665471256e-06, /* 552, accPolyHighC11h, quickPolyHighC11h */ 1.64796270839759047485693620137778762426170587507193e-22, /* 553, accPolyHighC11m */ -1.57402595505118377679448869038703051614902506116778e-06, /* 554, accPolyHighC12h, quickPolyHighC12h */ 1.03140748281100284102117735554826521589797225638379e-22, /* 555, accPolyHighC12m */ -7.00688192241446386609332076800260580284884781576693e-07, /* 556, accPolyHighC13h, quickPolyHighC13h */ 1.64297063257073230214010320767916245637133227760945e-23, /* 557, accPolyHighC13m */ -3.14533061665020903893046425037205438002274604514241e-07, /* 558, accPolyHighC14h, quickPolyHighC14h */ -1.57714454767442613704253788250439912924415496806915e-23, /* 559, accPolyHighC14m */ -1.42216292935838748302118661470672122959513217210770e-07, /* 560, accPolyHighC15h, quickPolyHighC15h */ 3.70163506723718792079998292841186813204562291235770e-24, /* 561, accPolyHighC15m */ -6.47111067734723877623606537110023673164960200665519e-08, /* 562, accPolyHighC16h, quickPolyHighC16h */ 1.96959302136511249382763415085950224265202199251341e-24, /* 563, accPolyHighC16m */ -2.96094098107419582578099602043070204260288846853655e-08, /* 564, accPolyHighC17h, quickPolyHighC17h */ -1.33210241793138800698071276025711826265682121011801e-25, /* 565, accPolyHighC17m */ -1.36154377785683810553931313304908135020099280154682e-08, /* 566, accPolyHighC18h, quickPolyHighC18h */ -6.28864412480332248702787563995712794007175716615166e-09, /* 567, accPolyHighC19h */ -2.91615151940413698643198065114674061293342788303562e-09, /* 568, accPolyHighC20h */ -1.35724329813454494662594037565671659106847357634251e-09, /* 569, accPolyHighC21h */ -6.33321170158103043923636695899503229467697451582353e-10, /* 570, accPolyHighC22h */ -2.98137047522453658533318439889463723202478462326326e-10, /* 571, accPolyHighC23h */ -1.35174910337425390381481209427921852395115820399951e-10, /* 572, accPolyHighC24h */ -7.57694791124210735879864558660150546803846438592700e-11, /* 573, accPolyHighC25h */ -1.19244777215077355372683280351504137017926154840097e-11, /* 574, accPolyHighC26h */ -4.08879979855917754145740023360966995669141255120849e-11, /* 575, accPolyHighC27h */ 1.75342081019476863949528641668112755730435381451571e-11, /* 576, accPolyHighC28h */ -1.60530246587119583502980643958298338953849526689055e-11, /* 577, accPolyHighC29h */ 1.00010072995346011026640553609468042850494384765625e+00, /* 578, RN rounding constant quick poly high*/ 5.59129439367752644847269214347219849204178767344215e-21, /* 579, RD rounding constant quick poly high*/ }; interval-2.1.0/src/crlibm/asincos.c0000644000000000000000000030435013031036767015341 0ustar 00000000000000/* * Correctly rounded arcsine and arccosine * * Copyright (c) 2007 Christoph Lauter (ENS Lyon), * with Sylvain Chevillard (ENS Lyon) for the polynomials * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" #include "asincos.h" static inline void p0_quick(double *p_resh, double *p_resm, double x, int32_t xhi) { double p_x_0_pow2h, p_x_0_pow2m; double p_t_1_0h; double p_t_2_0h; double p_t_3_0h; double p_t_4_0h; double p_t_5_0h; double p_t_6_0h; double p_t_7_0h; double p_t_8_0h; double p_t_9_0h; double p_t_10_0h; double p_t_11_0h; double p_t_12_0h; double p_t_13_0h; double p_t_14_0h; double p_t_15_0h; double p_t_16_0h; double p_t_17_0h, p_t_17_0m; double p_t_18_0h, p_t_18_0m; double p_t_19_0h, p_t_19_0m; double p_t_20_0h, p_t_20_0m; if (xhi < EXTRABOUND2) { double t1, t2, t3; t2 = p0_quick_coeff_3h * x; t1 = x * x; t3 = t1 * t2; Add12(*p_resh,*p_resm,x,t3); return; } Mul12(&p_x_0_pow2h,&p_x_0_pow2m,x,x); p_t_15_0h = p0_quick_coeff_5h; if (xhi > EXTRABOUND) { p_t_1_0h = p0_quick_coeff_19h; p_t_2_0h = p_t_1_0h * p_x_0_pow2h; p_t_3_0h = p0_quick_coeff_17h + p_t_2_0h; p_t_4_0h = p_t_3_0h * p_x_0_pow2h; p_t_5_0h = p0_quick_coeff_15h + p_t_4_0h; p_t_6_0h = p_t_5_0h * p_x_0_pow2h; p_t_7_0h = p0_quick_coeff_13h + p_t_6_0h; p_t_8_0h = p_t_7_0h * p_x_0_pow2h; p_t_9_0h = p0_quick_coeff_11h + p_t_8_0h; p_t_10_0h = p_t_9_0h * p_x_0_pow2h; p_t_11_0h = p0_quick_coeff_9h + p_t_10_0h; p_t_12_0h = p_t_11_0h * p_x_0_pow2h; p_t_13_0h = p0_quick_coeff_7h + p_t_12_0h; p_t_14_0h = p_t_13_0h * p_x_0_pow2h; p_t_15_0h = p_t_15_0h + p_t_14_0h; } p_t_16_0h = p_t_15_0h * p_x_0_pow2h; Add12(p_t_17_0h,p_t_17_0m,p0_quick_coeff_3h,p_t_16_0h); Mul122(&p_t_18_0h,&p_t_18_0m,x,p_x_0_pow2h,p_x_0_pow2m); Mul22(&p_t_19_0h,&p_t_19_0m,p_t_17_0h,p_t_17_0m,p_t_18_0h,p_t_18_0m); Add122(&p_t_20_0h,&p_t_20_0m,x,p_t_19_0h,p_t_19_0m); *p_resh = p_t_20_0h; *p_resm = p_t_20_0m; } static inline void p_quick(double *p_resh, double *p_resm, double x, int index) { double p_t_1_0h; double p_t_2_0h; double p_t_3_0h; double p_t_4_0h; double p_t_5_0h; double p_t_6_0h; double p_t_7_0h; double p_t_8_0h; double p_t_9_0h; double p_t_10_0h; double p_t_11_0h; double p_t_12_0h; double p_t_13_0h; double p_t_14_0h; double p_t_15_0h; double p_t_16_0h; double p_t_17_0h; double p_t_18_0h; double p_t_19_0h; double p_t_20_0h; double p_t_21_0h, p_t_21_0m; double p_t_22_0h, p_t_22_0m; double p_t_23_0h, p_t_23_0m; p_t_1_0h = p_quick_coeff_12h; p_t_2_0h = p_t_1_0h * x; p_t_3_0h = p_quick_coeff_11h + p_t_2_0h; p_t_4_0h = p_t_3_0h * x; p_t_5_0h = p_quick_coeff_10h + p_t_4_0h; p_t_6_0h = p_t_5_0h * x; p_t_7_0h = p_quick_coeff_9h + p_t_6_0h; p_t_8_0h = p_t_7_0h * x; p_t_9_0h = p_quick_coeff_8h + p_t_8_0h; p_t_10_0h = p_t_9_0h * x; p_t_11_0h = p_quick_coeff_7h + p_t_10_0h; p_t_12_0h = p_t_11_0h * x; p_t_13_0h = p_quick_coeff_6h + p_t_12_0h; p_t_14_0h = p_t_13_0h * x; p_t_15_0h = p_quick_coeff_5h + p_t_14_0h; p_t_16_0h = p_t_15_0h * x; p_t_17_0h = p_quick_coeff_4h + p_t_16_0h; p_t_18_0h = p_t_17_0h * x; p_t_19_0h = p_quick_coeff_3h + p_t_18_0h; p_t_20_0h = p_t_19_0h * x; Add12(p_t_21_0h,p_t_21_0m,p_quick_coeff_2h,p_t_20_0h); MulAdd212(&p_t_22_0h,&p_t_22_0m,p_quick_coeff_1h,p_quick_coeff_1m,x,p_t_21_0h,p_t_21_0m); MulAdd212(&p_t_23_0h,&p_t_23_0m,p_quick_coeff_0h,p_quick_coeff_0m,x,p_t_22_0h,p_t_22_0m); *p_resh = p_t_23_0h; *p_resm = p_t_23_0m; } static inline void p9_quick(double *p_resh, double *p_resm, double x) { double p_t_1_0h; double p_t_2_0h; double p_t_3_0h; double p_t_4_0h; double p_t_5_0h; double p_t_6_0h; double p_t_7_0h; double p_t_8_0h; double p_t_9_0h; double p_t_10_0h; double p_t_11_0h; double p_t_12_0h; double p_t_13_0h; double p_t_14_0h; double p_t_15_0h; double p_t_16_0h; double p_t_17_0h; double p_t_18_0h; double p_t_19_0h; double p_t_20_0h; double p_t_21_0h, p_t_21_0m; double p_t_22_0h, p_t_22_0m; double p_t_23_0h, p_t_23_0m; p_t_1_0h = p9_quick_coeff_11h; p_t_2_0h = p_t_1_0h * x; p_t_3_0h = p9_quick_coeff_10h + p_t_2_0h; p_t_4_0h = p_t_3_0h * x; p_t_5_0h = p9_quick_coeff_9h + p_t_4_0h; p_t_6_0h = p_t_5_0h * x; p_t_7_0h = p9_quick_coeff_8h + p_t_6_0h; p_t_8_0h = p_t_7_0h * x; p_t_9_0h = p9_quick_coeff_7h + p_t_8_0h; p_t_10_0h = p_t_9_0h * x; p_t_11_0h = p9_quick_coeff_6h + p_t_10_0h; p_t_12_0h = p_t_11_0h * x; p_t_13_0h = p9_quick_coeff_5h + p_t_12_0h; p_t_14_0h = p_t_13_0h * x; p_t_15_0h = p9_quick_coeff_4h + p_t_14_0h; p_t_16_0h = p_t_15_0h * x; p_t_17_0h = p9_quick_coeff_3h + p_t_16_0h; p_t_18_0h = p_t_17_0h * x; p_t_19_0h = p9_quick_coeff_2h + p_t_18_0h; p_t_20_0h = p_t_19_0h * x; Add12(p_t_21_0h,p_t_21_0m,p9_quick_coeff_1h,p_t_20_0h); Mul122(&p_t_22_0h,&p_t_22_0m,x,p_t_21_0h,p_t_21_0m); Add122(&p_t_23_0h,&p_t_23_0m,p9_quick_coeff_0h,p_t_22_0h,p_t_22_0m); *p_resh = p_t_23_0h; *p_resm = p_t_23_0m; } static void p0_accu(double *p_resh, double *p_resm, double *p_resl, double x) { double p_x_0_pow2h, p_x_0_pow2m; Mul12(&p_x_0_pow2h,&p_x_0_pow2m,x,x); double p_t_1_0h; double p_t_2_0h; double p_t_3_0h; double p_t_4_0h; double p_t_5_0h; double p_t_6_0h; double p_t_7_0h, p_t_7_0m; double p_t_8_0h, p_t_8_0m; double p_t_9_0h, p_t_9_0m; double p_t_10_0h, p_t_10_0m; double p_t_11_0h, p_t_11_0m; double p_t_12_0h, p_t_12_0m; double p_t_13_0h, p_t_13_0m; double p_t_14_0h, p_t_14_0m; double p_t_15_0h, p_t_15_0m; double p_t_16_0h, p_t_16_0m; double p_t_17_0h, p_t_17_0m; double p_t_18_0h, p_t_18_0m; double p_t_19_0h, p_t_19_0m; double p_t_20_0h, p_t_20_0m; double p_t_21_0h, p_t_21_0m; double p_t_22_0h, p_t_22_0m; double p_t_23_0h, p_t_23_0m; double p_t_24_0h, p_t_24_0m; double p_t_25_0h, p_t_25_0m; double p_t_26_0h, p_t_26_0m; double p_t_27_0h, p_t_27_0m; double p_t_28_0h, p_t_28_0m, p_t_28_0l; double p_t_29_0h, p_t_29_0m, p_t_29_0l; double p_t_30_0h, p_t_30_0m, p_t_30_0l; double p_t_31_0h, p_t_31_0m, p_t_31_0l; double p_t_32_0h, p_t_32_0m, p_t_32_0l; double p_t_33_0h, p_t_33_0m, p_t_33_0l; double p_t_34_0h, p_t_34_0m, p_t_34_0l; double p_t_35_0h, p_t_35_0m, p_t_35_0l; p_t_1_0h = p0_accu_coeff_37h; p_t_2_0h = p_t_1_0h * p_x_0_pow2h; p_t_3_0h = p0_accu_coeff_35h + p_t_2_0h; p_t_4_0h = p_t_3_0h * p_x_0_pow2h; p_t_5_0h = p0_accu_coeff_33h + p_t_4_0h; p_t_6_0h = p_t_5_0h * p_x_0_pow2h; Add12(p_t_7_0h,p_t_7_0m,p0_accu_coeff_31h,p_t_6_0h); Mul22(&p_t_8_0h,&p_t_8_0m,p_t_7_0h,p_t_7_0m,p_x_0_pow2h,p_x_0_pow2m); Add122(&p_t_9_0h,&p_t_9_0m,p0_accu_coeff_29h,p_t_8_0h,p_t_8_0m); Mul22(&p_t_10_0h,&p_t_10_0m,p_t_9_0h,p_t_9_0m,p_x_0_pow2h,p_x_0_pow2m); Add122(&p_t_11_0h,&p_t_11_0m,p0_accu_coeff_27h,p_t_10_0h,p_t_10_0m); Mul22(&p_t_12_0h,&p_t_12_0m,p_t_11_0h,p_t_11_0m,p_x_0_pow2h,p_x_0_pow2m); Add122(&p_t_13_0h,&p_t_13_0m,p0_accu_coeff_25h,p_t_12_0h,p_t_12_0m); Mul22(&p_t_14_0h,&p_t_14_0m,p_t_13_0h,p_t_13_0m,p_x_0_pow2h,p_x_0_pow2m); Add122(&p_t_15_0h,&p_t_15_0m,p0_accu_coeff_23h,p_t_14_0h,p_t_14_0m); Mul22(&p_t_16_0h,&p_t_16_0m,p_t_15_0h,p_t_15_0m,p_x_0_pow2h,p_x_0_pow2m); Add122(&p_t_17_0h,&p_t_17_0m,p0_accu_coeff_21h,p_t_16_0h,p_t_16_0m); Mul22(&p_t_18_0h,&p_t_18_0m,p_t_17_0h,p_t_17_0m,p_x_0_pow2h,p_x_0_pow2m); Add122(&p_t_19_0h,&p_t_19_0m,p0_accu_coeff_19h,p_t_18_0h,p_t_18_0m); Mul22(&p_t_20_0h,&p_t_20_0m,p_t_19_0h,p_t_19_0m,p_x_0_pow2h,p_x_0_pow2m); Add122(&p_t_21_0h,&p_t_21_0m,p0_accu_coeff_17h,p_t_20_0h,p_t_20_0m); Mul22(&p_t_22_0h,&p_t_22_0m,p_t_21_0h,p_t_21_0m,p_x_0_pow2h,p_x_0_pow2m); Add122(&p_t_23_0h,&p_t_23_0m,p0_accu_coeff_15h,p_t_22_0h,p_t_22_0m); MulAdd22(&p_t_24_0h,&p_t_24_0m,p0_accu_coeff_13h,p0_accu_coeff_13m,p_x_0_pow2h,p_x_0_pow2m,p_t_23_0h,p_t_23_0m); MulAdd22(&p_t_25_0h,&p_t_25_0m,p0_accu_coeff_11h,p0_accu_coeff_11m,p_x_0_pow2h,p_x_0_pow2m,p_t_24_0h,p_t_24_0m); MulAdd22(&p_t_26_0h,&p_t_26_0m,p0_accu_coeff_9h,p0_accu_coeff_9m,p_x_0_pow2h,p_x_0_pow2m,p_t_25_0h,p_t_25_0m); Mul22(&p_t_27_0h,&p_t_27_0m,p_t_26_0h,p_t_26_0m,p_x_0_pow2h,p_x_0_pow2m); Add23(&p_t_28_0h,&p_t_28_0m,&p_t_28_0l,p0_accu_coeff_7h,p0_accu_coeff_7m,p_t_27_0h,p_t_27_0m); Mul233(&p_t_29_0h,&p_t_29_0m,&p_t_29_0l,p_x_0_pow2h,p_x_0_pow2m,p_t_28_0h,p_t_28_0m,p_t_28_0l); Add233(&p_t_30_0h,&p_t_30_0m,&p_t_30_0l,p0_accu_coeff_5h,p0_accu_coeff_5m,p_t_29_0h,p_t_29_0m,p_t_29_0l); Mul233(&p_t_31_0h,&p_t_31_0m,&p_t_31_0l,p_x_0_pow2h,p_x_0_pow2m,p_t_30_0h,p_t_30_0m,p_t_30_0l); Add233(&p_t_32_0h,&p_t_32_0m,&p_t_32_0l,p0_accu_coeff_3h,p0_accu_coeff_3m,p_t_31_0h,p_t_31_0m,p_t_31_0l); Mul233(&p_t_33_0h,&p_t_33_0m,&p_t_33_0l,p_x_0_pow2h,p_x_0_pow2m,p_t_32_0h,p_t_32_0m,p_t_32_0l); Add133(&p_t_34_0h,&p_t_34_0m,&p_t_34_0l,p0_accu_coeff_1h,p_t_33_0h,p_t_33_0m,p_t_33_0l); Mul133(&p_t_35_0h,&p_t_35_0m,&p_t_35_0l,x,p_t_34_0h,p_t_34_0m,p_t_34_0l); Renormalize3(p_resh,p_resm,p_resl,p_t_35_0h,p_t_35_0m,p_t_35_0l); } static void p_accu(double *p_resh, double *p_resm, double *p_resl, double x, int index) { double p_t_1_0h; double p_t_2_0h; double p_t_3_0h; double p_t_4_0h; double p_t_5_0h; double p_t_6_0h; double p_t_7_0h; double p_t_8_0h; double p_t_9_0h; double p_t_10_0h; double p_t_11_0h; double p_t_12_0h; double p_t_13_0h; double p_t_14_0h; double p_t_15_0h; double p_t_16_0h; double p_t_17_0h, p_t_17_0m; double p_t_18_0h, p_t_18_0m; double p_t_19_0h, p_t_19_0m; double p_t_20_0h, p_t_20_0m; double p_t_21_0h, p_t_21_0m; double p_t_22_0h, p_t_22_0m; double p_t_23_0h, p_t_23_0m; double p_t_24_0h, p_t_24_0m; double p_t_25_0h, p_t_25_0m; double p_t_26_0h, p_t_26_0m; double p_t_27_0h, p_t_27_0m; double p_t_28_0h, p_t_28_0m; double p_t_29_0h, p_t_29_0m; double p_t_30_0h, p_t_30_0m; double p_t_31_0h, p_t_31_0m; double p_t_32_0h, p_t_32_0m; double p_t_33_0h, p_t_33_0m; double p_t_34_0h, p_t_34_0m; double p_t_35_0h, p_t_35_0m, p_t_35_0l; double p_t_36_0h, p_t_36_0m, p_t_36_0l; double p_t_37_0h, p_t_37_0m, p_t_37_0l; double p_t_38_0h, p_t_38_0m, p_t_38_0l; double p_t_39_0h, p_t_39_0m, p_t_39_0l; p_t_1_0h = p_accu_coeff_22h; p_t_2_0h = p_t_1_0h * x; p_t_3_0h = p_accu_coeff_21h + p_t_2_0h; p_t_4_0h = p_t_3_0h * x; p_t_5_0h = p_accu_coeff_20h + p_t_4_0h; p_t_6_0h = p_t_5_0h * x; p_t_7_0h = p_accu_coeff_19h + p_t_6_0h; p_t_8_0h = p_t_7_0h * x; p_t_9_0h = p_accu_coeff_18h + p_t_8_0h; p_t_10_0h = p_t_9_0h * x; p_t_11_0h = p_accu_coeff_17h + p_t_10_0h; p_t_12_0h = p_t_11_0h * x; p_t_13_0h = p_accu_coeff_16h + p_t_12_0h; p_t_14_0h = p_t_13_0h * x; p_t_15_0h = p_accu_coeff_15h + p_t_14_0h; p_t_16_0h = p_t_15_0h * x; Add12(p_t_17_0h,p_t_17_0m,p_accu_coeff_14h,p_t_16_0h); Mul122(&p_t_18_0h,&p_t_18_0m,x,p_t_17_0h,p_t_17_0m); Add122(&p_t_19_0h,&p_t_19_0m,p_accu_coeff_13h,p_t_18_0h,p_t_18_0m); Mul122(&p_t_20_0h,&p_t_20_0m,x,p_t_19_0h,p_t_19_0m); Add122(&p_t_21_0h,&p_t_21_0m,p_accu_coeff_12h,p_t_20_0h,p_t_20_0m); Mul122(&p_t_22_0h,&p_t_22_0m,x,p_t_21_0h,p_t_21_0m); Add122(&p_t_23_0h,&p_t_23_0m,p_accu_coeff_11h,p_t_22_0h,p_t_22_0m); Mul122(&p_t_24_0h,&p_t_24_0m,x,p_t_23_0h,p_t_23_0m); Add122(&p_t_25_0h,&p_t_25_0m,p_accu_coeff_10h,p_t_24_0h,p_t_24_0m); Mul122(&p_t_26_0h,&p_t_26_0m,x,p_t_25_0h,p_t_25_0m); Add122(&p_t_27_0h,&p_t_27_0m,p_accu_coeff_9h,p_t_26_0h,p_t_26_0m); MulAdd212(&p_t_28_0h,&p_t_28_0m,p_accu_coeff_8h,p_accu_coeff_8m,x,p_t_27_0h,p_t_27_0m); MulAdd212(&p_t_29_0h,&p_t_29_0m,p_accu_coeff_7h,p_accu_coeff_7m,x,p_t_28_0h,p_t_28_0m); MulAdd212(&p_t_30_0h,&p_t_30_0m,p_accu_coeff_6h,p_accu_coeff_6m,x,p_t_29_0h,p_t_29_0m); MulAdd212(&p_t_31_0h,&p_t_31_0m,p_accu_coeff_5h,p_accu_coeff_5m,x,p_t_30_0h,p_t_30_0m); MulAdd212(&p_t_32_0h,&p_t_32_0m,p_accu_coeff_4h,p_accu_coeff_4m,x,p_t_31_0h,p_t_31_0m); MulAdd212(&p_t_33_0h,&p_t_33_0m,p_accu_coeff_3h,p_accu_coeff_3m,x,p_t_32_0h,p_t_32_0m); Mul122(&p_t_34_0h,&p_t_34_0m,x,p_t_33_0h,p_t_33_0m); Add23(&p_t_35_0h,&p_t_35_0m,&p_t_35_0l,p_accu_coeff_2h,p_accu_coeff_2m,p_t_34_0h,p_t_34_0m); Mul133(&p_t_36_0h,&p_t_36_0m,&p_t_36_0l,x,p_t_35_0h,p_t_35_0m,p_t_35_0l); Add233(&p_t_37_0h,&p_t_37_0m,&p_t_37_0l,p_accu_coeff_1h,p_accu_coeff_1m,p_t_36_0h,p_t_36_0m,p_t_36_0l); Mul133(&p_t_38_0h,&p_t_38_0m,&p_t_38_0l,x,p_t_37_0h,p_t_37_0m,p_t_37_0l); Add233(&p_t_39_0h,&p_t_39_0m,&p_t_39_0l,p_accu_coeff_0h,p_accu_coeff_0m,p_t_38_0h,p_t_38_0m,p_t_38_0l); Renormalize3(p_resh,p_resm,p_resl,p_t_39_0h,p_t_39_0m,p_t_39_0l); } static void p9_accu(double *p_resh, double *p_resm, double *p_resl, double x) { double p_t_1_0h; double p_t_2_0h; double p_t_3_0h; double p_t_4_0h; double p_t_5_0h; double p_t_6_0h; double p_t_7_0h; double p_t_8_0h; double p_t_9_0h; double p_t_10_0h; double p_t_11_0h; double p_t_12_0h; double p_t_13_0h; double p_t_14_0h; double p_t_15_0h; double p_t_16_0h; double p_t_17_0h, p_t_17_0m; double p_t_18_0h, p_t_18_0m; double p_t_19_0h, p_t_19_0m; double p_t_20_0h, p_t_20_0m; double p_t_21_0h, p_t_21_0m; double p_t_22_0h, p_t_22_0m; double p_t_23_0h, p_t_23_0m; double p_t_24_0h, p_t_24_0m; double p_t_25_0h, p_t_25_0m; double p_t_26_0h, p_t_26_0m; double p_t_27_0h, p_t_27_0m; double p_t_28_0h, p_t_28_0m; double p_t_29_0h, p_t_29_0m; double p_t_30_0h, p_t_30_0m; double p_t_31_0h, p_t_31_0m; double p_t_32_0h, p_t_32_0m; double p_t_33_0h, p_t_33_0m, p_t_33_0l; double p_t_34_0h, p_t_34_0m, p_t_34_0l; double p_t_35_0h, p_t_35_0m, p_t_35_0l; p_t_1_0h = p9_accu_coeff_20h; p_t_2_0h = p_t_1_0h * x; p_t_3_0h = p9_accu_coeff_19h + p_t_2_0h; p_t_4_0h = p_t_3_0h * x; p_t_5_0h = p9_accu_coeff_18h + p_t_4_0h; p_t_6_0h = p_t_5_0h * x; p_t_7_0h = p9_accu_coeff_17h + p_t_6_0h; p_t_8_0h = p_t_7_0h * x; p_t_9_0h = p9_accu_coeff_16h + p_t_8_0h; p_t_10_0h = p_t_9_0h * x; p_t_11_0h = p9_accu_coeff_15h + p_t_10_0h; p_t_12_0h = p_t_11_0h * x; p_t_13_0h = p9_accu_coeff_14h + p_t_12_0h; p_t_14_0h = p_t_13_0h * x; p_t_15_0h = p9_accu_coeff_13h + p_t_14_0h; p_t_16_0h = p_t_15_0h * x; Add12(p_t_17_0h,p_t_17_0m,p9_accu_coeff_12h,p_t_16_0h); Mul122(&p_t_18_0h,&p_t_18_0m,x,p_t_17_0h,p_t_17_0m); Add122(&p_t_19_0h,&p_t_19_0m,p9_accu_coeff_11h,p_t_18_0h,p_t_18_0m); Mul122(&p_t_20_0h,&p_t_20_0m,x,p_t_19_0h,p_t_19_0m); Add122(&p_t_21_0h,&p_t_21_0m,p9_accu_coeff_10h,p_t_20_0h,p_t_20_0m); Mul122(&p_t_22_0h,&p_t_22_0m,x,p_t_21_0h,p_t_21_0m); Add122(&p_t_23_0h,&p_t_23_0m,p9_accu_coeff_9h,p_t_22_0h,p_t_22_0m); Mul122(&p_t_24_0h,&p_t_24_0m,x,p_t_23_0h,p_t_23_0m); Add122(&p_t_25_0h,&p_t_25_0m,p9_accu_coeff_8h,p_t_24_0h,p_t_24_0m); MulAdd212(&p_t_26_0h,&p_t_26_0m,p9_accu_coeff_7h,p9_accu_coeff_7m,x,p_t_25_0h,p_t_25_0m); MulAdd212(&p_t_27_0h,&p_t_27_0m,p9_accu_coeff_6h,p9_accu_coeff_6m,x,p_t_26_0h,p_t_26_0m); MulAdd212(&p_t_28_0h,&p_t_28_0m,p9_accu_coeff_5h,p9_accu_coeff_5m,x,p_t_27_0h,p_t_27_0m); MulAdd212(&p_t_29_0h,&p_t_29_0m,p9_accu_coeff_4h,p9_accu_coeff_4m,x,p_t_28_0h,p_t_28_0m); MulAdd212(&p_t_30_0h,&p_t_30_0m,p9_accu_coeff_3h,p9_accu_coeff_3m,x,p_t_29_0h,p_t_29_0m); MulAdd212(&p_t_31_0h,&p_t_31_0m,p9_accu_coeff_2h,p9_accu_coeff_2m,x,p_t_30_0h,p_t_30_0m); Mul122(&p_t_32_0h,&p_t_32_0m,x,p_t_31_0h,p_t_31_0m); Add23(&p_t_33_0h,&p_t_33_0m,&p_t_33_0l,p9_accu_coeff_1h,p9_accu_coeff_1m,p_t_32_0h,p_t_32_0m); Mul133(&p_t_34_0h,&p_t_34_0m,&p_t_34_0l,x,p_t_33_0h,p_t_33_0m,p_t_33_0l); Add233(&p_t_35_0h,&p_t_35_0m,&p_t_35_0l,p9_accu_coeff_0h,p9_accu_coeff_0m,p_t_34_0h,p_t_34_0m,p_t_34_0l); Renormalize3(p_resh,p_resm,p_resl,p_t_35_0h,p_t_35_0m,p_t_35_0l); } double asin_rn(double x) { db_number xdb, zdb; double sign, z, zp; int index; double asinh, asinm, asinl; double asinhover, asinmover, asinlover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double asin; double xabs; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-28) we have arcsin(x) = x * ( 1 + xi ) with 0 <= xi < 2^(-55) So we can decide the rounding without any computation */ if (xdb.i[HI] < ASINSIMPLEBOUND) { return x; } /* asin is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return PIHALFH; } if (x == -1.0) { return - PIHALFH; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); /* Rounding test */ if(asinh == (asinh + (asinm * RNROUNDCST))) return asinh; /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); /* Final rounding */ RoundToNearest3(&asin,asinh,asinm,asinl); return asin; } /* Strip off the sign of argument x */ sign = 1.0; if (x < 0.0) sign = -sign; index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); p9h = -p9h; p9m = -p9m; sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); Add22(&asinh,&asinm,PIHALFH,PIHALFM,t1h,t1m); /* Rounding test */ if(asinh == (asinh + (asinm * RNROUNDCST))) return sign * asinh; /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); p9h = -p9h; p9m = -p9m; p9l = -p9l; Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); Add33(&asinhover,&asinmover,&asinlover,PIHALFH,PIHALFM,PIHALFL,t1h,t1m,t1l); Renormalize3(&asinh,&asinm,&asinl,asinhover,asinmover,asinlover); /* Final rounding */ RoundToNearest3(&asin,asinh,asinm,asinl); return sign * asin; } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); /* Rounding test */ if(asinh == (asinh + (asinm * RNROUNDCST))) return sign * asinh; /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p_accu(&asinh, &asinm, &asinl, z, index); /* Final rounding */ RoundToNearest3(&asin,asinh,asinm,asinl); return sign * asin; } double asin_ru(double x) { db_number xdb, zdb; double sign, z, zp; int index; double asinh, asinm, asinl; double asinhover, asinmover, asinlover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double xabs; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-28) we have arcsin(x) = x * ( 1 + xi ) with 0 <= xi < 2^(-55) So we can decide the rounding without any computation */ if (xdb.i[HI] < ASINSIMPLEBOUND) { /* If x == 0 then we got the algebraic result arcsin(0) = 0 If x < 0 then the truncation rest is negative but less than 1 ulp; we round upwards by returning x */ if (x <= 0.0) return x; /* Otherwise the rest is positive, less than 1 ulp and the image is not algebraic We return x + 1ulp */ xdb.l++; return xdb.d; } /* asin is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return PIHALFRU; } if (x == -1.0) { return - PIHALFH; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); /* Rounding test */ TEST_AND_RETURN_RU(asinh, asinm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); /* Final rounding */ ReturnRoundUpwards3(asinh,asinm,asinl); } /* Strip off the sign of argument x */ sign = 1.0; if (x < 0.0) sign = -sign; index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); p9h = -p9h; p9m = -p9m; sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); Add22(&asinh,&asinm,PIHALFH,PIHALFM,t1h,t1m); /* Rounding test */ asinh *= sign; asinm *= sign; TEST_AND_RETURN_RU(asinh, asinm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); p9h = -p9h; p9m = -p9m; p9l = -p9l; Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); Add33(&asinhover,&asinmover,&asinlover,PIHALFH,PIHALFM,PIHALFL,t1h,t1m,t1l); Renormalize3(&asinh,&asinm,&asinl,asinhover,asinmover,asinlover); /* Final rounding */ asinh *= sign; asinm *= sign; asinl *= sign; ReturnRoundUpwards3(asinh,asinm,asinl); } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); /* Rounding test */ asinh *= sign; asinm *= sign; TEST_AND_RETURN_RU(asinh, asinm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif if (x == ASINBADCASEX) return ASINBADCASEYRU; p_accu(&asinh, &asinm, &asinl, z, index); /* Final rounding */ asinh *= sign; asinm *= sign; asinl *= sign; ReturnRoundUpwards3(asinh,asinm,asinl); } double asin_rd(double x) { db_number xdb, zdb; double sign, z, zp; int index; double asinh, asinm, asinl; double asinhover, asinmover, asinlover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double xabs; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-28) we have arcsin(x) = x * ( 1 + xi ) with 0 <= xi < 2^(-55) So we can decide the rounding without any computation */ if (xdb.i[HI] < ASINSIMPLEBOUND) { /* If x == 0 then we got the algebraic result arcsin(0) = 0 If x > 0 then the truncation rest is positive but less than 1 ulp; we round downwards by returning x */ if (x >= 0) return x; /* Otherwise the rest is negative, less than 1 ulp and the image is not algebraic We return x - 1ulp We stripped off the sign, so we add 1 ulp to -x (in xdb.d) and multiply by -1 */ xdb.l++; return -1 * xdb.d; } /* asin is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return PIHALFH; } if (x == -1.0) { return - PIHALFRU; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); /* Rounding test */ TEST_AND_RETURN_RD(asinh, asinm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); /* Final rounding */ ReturnRoundDownwards3(asinh,asinm,asinl); } /* Strip off the sign of argument x */ sign = 1.0; if (x < 0.0) sign = -sign; index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); p9h = -p9h; p9m = -p9m; sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); Add22(&asinh,&asinm,PIHALFH,PIHALFM,t1h,t1m); /* Rounding test */ asinh *= sign; asinm *= sign; TEST_AND_RETURN_RD(asinh, asinm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); p9h = -p9h; p9m = -p9m; p9l = -p9l; Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); Add33(&asinhover,&asinmover,&asinlover,PIHALFH,PIHALFM,PIHALFL,t1h,t1m,t1l); Renormalize3(&asinh,&asinm,&asinl,asinhover,asinmover,asinlover); /* Final rounding */ asinh *= sign; asinm *= sign; asinl *= sign; ReturnRoundDownwards3(asinh,asinm,asinl); } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); /* Rounding test */ asinh *= sign; asinm *= sign; TEST_AND_RETURN_RD(asinh, asinm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif if (x == ASINBADCASEX) return ASINBADCASEYRD; p_accu(&asinh, &asinm, &asinl, z, index); /* Final rounding */ asinh *= sign; asinm *= sign; asinl *= sign; ReturnRoundDownwards3(asinh,asinm,asinl); } double asin_rz(double x) { db_number xdb, zdb; double sign, z, zp; int index; double asinh, asinm, asinl; double asinhover, asinmover, asinlover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double xabs; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-28) we have arcsin(x) = x * ( 1 + xi ) with 0 <= xi < 2^(-55) So we can decide the rounding without any computation */ if (xdb.i[HI] < ASINSIMPLEBOUND) { /* If x == 0 the result is algebraic and equal to 0 If x < 0 the truncation rest is negative and less than 1 ulp, we return x If x > 0 the truncation rest is positive and less than 1 ulp, we return x */ return x; } /* asin is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return PIHALFH; } if (x == -1.0) { return - PIHALFH; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); /* Rounding test */ TEST_AND_RETURN_RZ(asinh, asinm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); /* Final rounding */ ReturnRoundTowardsZero3(asinh,asinm,asinl); } /* Strip off the sign of argument x */ sign = 1.0; if (x < 0.0) sign = -sign; index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); p9h = -p9h; p9m = -p9m; sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); Add22(&asinh,&asinm,PIHALFH,PIHALFM,t1h,t1m); /* Rounding test */ asinh *= sign; asinm *= sign; TEST_AND_RETURN_RZ(asinh, asinm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); p9h = -p9h; p9m = -p9m; p9l = -p9l; Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); Add33(&asinhover,&asinmover,&asinlover,PIHALFH,PIHALFM,PIHALFL,t1h,t1m,t1l); Renormalize3(&asinh,&asinm,&asinl,asinhover,asinmover,asinlover); /* Final rounding */ asinh *= sign; asinm *= sign; asinl *= sign; ReturnRoundTowardsZero3(asinh,asinm,asinl); } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); /* Rounding test */ asinh *= sign; asinm *= sign; TEST_AND_RETURN_RZ(asinh, asinm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif if (x == ASINBADCASEX) return ASINBADCASEYRD; p_accu(&asinh, &asinm, &asinl, z, index); /* Final rounding */ asinh *= sign; asinm *= sign; asinl *= sign; ReturnRoundTowardsZero3(asinh,asinm,asinl); } double acos_rn(double x) { db_number xdb, zdb; double z, zp; int index; double asinh, asinm, asinl; double acosh, acosm, acosl; double acoshover, acosmover, acoslover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double xabs; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-28) we have arccos(x) = (double-double(pi/2) - x) * ( 1 + xi ) with 0 <= xi < 2^(-87) From 2^(-27) we have no bad rounding case longer than 5 bits more than the ulp of x, thus the approximation suffices. */ if (xdb.i[HI] < ACOSSIMPLEBOUND) { Add212(&acosh,&acosm,PIHALFH,PIHALFM,-x); return acosh; } /* acos is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return 0.0; } if (x == -1.0) { return PIH; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); /* Recompose acos No cancellation possible because |asin(x)| <= 0.264 for |x| <= 0.26 */ asinh = - asinh; asinm = - asinm; Add22(&acosh,&acosm,PIHALFH,PIHALFM,asinh,asinm); /* Rounding test */ if(acosh == (acosh + (acosm * RNROUNDCST))) return acosh; /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); /* Recompose acos */ asinh = -asinh; asinm = -asinm; asinl = -asinl; Add33(&acoshover,&acosmover,&acoslover,PIHALFH,PIHALFM,PIHALFL,asinh,asinm,asinl); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); /* Final rounding */ ReturnRoundToNearest3(acosh,acosm,acosl); } index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); if (x > 0.0) { acosh = t1h; acosm = t1m; } else { /* arccos(-x) = Pi - arccos(x) */ t1h = - t1h; t1m = - t1m; Add22(&acosh,&acosm,PIH,PIM,t1h,t1m); } /* Rounding test */ if(acosh == (acosh + (acosm * RNROUNDCST))) return acosh; /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); if (x > 0.0) { Renormalize3(&acosh,&acosm,&acosl,t1h,t1m,t1l); } else { /* arccos(-x) = Pi - arccos(x) */ t1h = - t1h; t1m = - t1m; t1l = - t1l; Add33(&acoshover,&acosmover,&acoslover,PIH,PIM,PIL,t1h,t1m,t1l); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); } /* Final rounding */ ReturnRoundToNearest3(acosh,acosm,acosl); } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); /* Recompose acos(x) out of asin(abs(x)) In the case of a substraction, we will cancel not more than 1 bit. */ if (x > 0.0) { asinh = - asinh; asinm = - asinm; } Add22Cond(&acosh,&acosm,PIHALFH,PIHALFM,asinh,asinm); /* Rounding test */ if(acosh == (acosh + (acosm * RNROUNDCST))) return acosh; /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p_accu(&asinh, &asinm, &asinl, z, index); /* Recompose acos(x) out of asin(abs(x)) In the case of a substraction, we will cancel not more than 1 bit. */ if (x > 0.0) { asinh = - asinh; asinm = - asinm; asinl = - asinl; } Add33Cond(&acoshover,&acosmover,&acoslover,PIHALFH,PIHALFM,PIHALFL,asinh,asinm,asinl); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); /* Final rounding */ ReturnRoundToNearest3(acosh,acosm,acosl); } double acos_ru(double x) { db_number xdb, zdb, acoshdb; double z, zp; int index; double asinh, asinm, asinl; double acosh, acosm, acosl; double acoshover, acosmover, acoslover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double xabs; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-28) we have arccos(x) = (double-double(pi/2) - x) * ( 1 + xi ) with 0 <= xi < 2^(-87) From 2^(-27) we have no bad rounding case longer than 5 bits more than the ulp of x, thus the approximation suffices. */ if (xdb.i[HI] < ACOSSIMPLEBOUND) { Add212(&acosh,&acosm,PIHALFH,PIHALFM,-x); /* acosh is the round-to-nearest of acos(x) in this domain acosm is a at least 20 bit exact correction of the rounding error of this round-to-nearest rounding. If acosh is the rounded up result of acos(x), the correction is negative and vice-versa. */ if (acosm < 0.0) return acosh; /* Here the correction acosm is positive, acosh is therefore the rounded down result of acos(x). We add thus one ulp. */ acoshdb.d = acosh; acoshdb.l++; return acoshdb.d; } /* acos is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return 0.0; } if (x == -1.0) { return PIRU; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); /* Recompose acos No cancellation possible because |asin(x)| <= 0.264 for |x| <= 0.26 */ asinh = - asinh; asinm = - asinm; Add22(&acosh,&acosm,PIHALFH,PIHALFM,asinh,asinm); /* Rounding test */ TEST_AND_RETURN_RU(acosh, acosm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); /* Recompose acos */ asinh = -asinh; asinm = -asinm; asinl = -asinl; Add33(&acoshover,&acosmover,&acoslover,PIHALFH,PIHALFM,PIHALFL,asinh,asinm,asinl); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); /* Final rounding */ ReturnRoundUpwards3(acosh,acosm,acosl); } index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); if (x > 0.0) { acosh = t1h; acosm = t1m; } else { /* arccos(-x) = Pi - arccos(x) */ t1h = - t1h; t1m = - t1m; Add22(&acosh,&acosm,PIH,PIM,t1h,t1m); } /* Rounding test */ TEST_AND_RETURN_RU(acosh, acosm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); if (x > 0.0) { Renormalize3(&acosh,&acosm,&acosl,t1h,t1m,t1l); } else { /* arccos(-x) = Pi - arccos(x) */ t1h = - t1h; t1m = - t1m; t1l = - t1l; Add33(&acoshover,&acosmover,&acoslover,PIH,PIM,PIL,t1h,t1m,t1l); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); } /* Final rounding */ ReturnRoundUpwards3(acosh,acosm,acosl); } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); /* Recompose acos(x) out of asin(abs(x)) In the case of a substraction, we will cancel not more than 1 bit. */ if (x > 0.0) { asinh = - asinh; asinm = - asinm; } Add22Cond(&acosh,&acosm,PIHALFH,PIHALFM,asinh,asinm); /* Rounding test */ TEST_AND_RETURN_RU(acosh, acosm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p_accu(&asinh, &asinm, &asinl, z, index); /* Recompose acos(x) out of asin(abs(x)) In the case of a substraction, we will cancel not more than 1 bit. */ if (x > 0.0) { asinh = - asinh; asinm = - asinm; asinl = - asinl; } Add33Cond(&acoshover,&acosmover,&acoslover,PIHALFH,PIHALFM,PIHALFL,asinh,asinm,asinl); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); /* Final rounding */ ReturnRoundUpwards3(acosh,acosm,acosl); } double acos_rd(double x) { db_number xdb, zdb, acoshdb; double z, zp; int index; double asinh, asinm, asinl; double acosh, acosm, acosl; double acoshover, acosmover, acoslover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double xabs; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-28) we have arccos(x) = (double-double(pi/2) - x) * ( 1 + xi ) with 0 <= xi < 2^(-87) From 2^(-27) we have no bad rounding case longer than 5 bits more than the ulp of x, thus the approximation suffices. */ if (xdb.i[HI] < ACOSSIMPLEBOUND) { Add212(&acosh,&acosm,PIHALFH,PIHALFM,-x); /* acosh is the round-to-nearest of acos(x) in this domain acosm is a at least 20 bit exact correction of the rounding error of this round-to-nearest rounding. If acosh is the rounded up result of acos(x), the correction is negative and vice-versa. */ if (acosm > 0.0) return acosh; /* Here the correction acosm is negative, acosh is therefore the rounded up result of acos(x). We subtract thus one ulp. */ acoshdb.d = acosh; acoshdb.l--; return acoshdb.d; } /* acos is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return 0.0; } if (x == -1.0) { return PIH; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); /* Recompose acos No cancellation possible because |asin(x)| <= 0.264 for |x| <= 0.26 */ asinh = - asinh; asinm = - asinm; Add22(&acosh,&acosm,PIHALFH,PIHALFM,asinh,asinm); /* Rounding test */ TEST_AND_RETURN_RD(acosh, acosm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); /* Recompose acos */ asinh = -asinh; asinm = -asinm; asinl = -asinl; Add33(&acoshover,&acosmover,&acoslover,PIHALFH,PIHALFM,PIHALFL,asinh,asinm,asinl); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); /* Final rounding */ ReturnRoundDownwards3(acosh,acosm,acosl); } index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); if (x > 0.0) { acosh = t1h; acosm = t1m; } else { /* arccos(-x) = Pi - arccos(x) */ t1h = - t1h; t1m = - t1m; Add22(&acosh,&acosm,PIH,PIM,t1h,t1m); } /* Rounding test */ TEST_AND_RETURN_RD(acosh, acosm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); if (x > 0.0) { Renormalize3(&acosh,&acosm,&acosl,t1h,t1m,t1l); } else { /* arccos(-x) = Pi - arccos(x) */ t1h = - t1h; t1m = - t1m; t1l = - t1l; Add33(&acoshover,&acosmover,&acoslover,PIH,PIM,PIL,t1h,t1m,t1l); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); } /* Final rounding */ ReturnRoundDownwards3(acosh,acosm,acosl); } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); /* Recompose acos(x) out of asin(abs(x)) In the case of a substraction, we will cancel not more than 1 bit. */ if (x > 0.0) { asinh = - asinh; asinm = - asinm; } Add22Cond(&acosh,&acosm,PIHALFH,PIHALFM,asinh,asinm); /* Rounding test */ TEST_AND_RETURN_RD(acosh, acosm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p_accu(&asinh, &asinm, &asinl, z, index); /* Recompose acos(x) out of asin(abs(x)) In the case of a substraction, we will cancel not more than 1 bit. */ if (x > 0.0) { asinh = - asinh; asinm = - asinm; asinl = - asinl; } Add33Cond(&acoshover,&acosmover,&acoslover,PIHALFH,PIHALFM,PIHALFL,asinh,asinm,asinl); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); /* Final rounding */ ReturnRoundDownwards3(acosh,acosm,acosl); } double acospi_rn(double x) { db_number xdb, zdb; double z, zp; int index; double asinh, asinm, asinl; double asinpih, asinpim, asinpil; double acosh, acosm, acosl; double acoshover, acosmover, acoslover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double t2h, t2m, t2l; double xabs; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-54) we have arccos(x)/pi = 1/2 * (1 + xi) with 0 <= xi < 2^(-54) So arcospi(x) = 0.5 in this case. */ if (xdb.i[HI] < ACOSPISIMPLEBOUND) { return 0.5; } /* acospi is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return 0.0; } if (x == -1.0) { return 1.0; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); /* Recompose acos/pi We have arccos(x)/pi = 1/2 + (-1/pi) * arcsin(x) No cancellation possible because |asin(x)/pi| <= 0.0837 for |x| <= 0.26 */ Mul22(&asinpih,&asinpim,MRECPRPIH,MRECPRPIM,asinh,asinm); Add122(&acosh,&acosm,0.5,asinpih,asinpim); /* Rounding test */ if(acosh == (acosh + (acosm * RNROUNDCST))) return acosh; /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); /* Recompose acos/pi */ Mul33(&asinpih,&asinpim,&asinpil,MRECPRPIH,MRECPRPIM,MRECPRPIL,asinh,asinm,asinl); Add133(&acoshover,&acosmover,&acoslover,0.5,asinpih,asinpim,asinpil); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); /* Final rounding */ ReturnRoundToNearest3(acosh,acosm,acosl); } index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); Mul22(&t2h,&t2m,RECPRPIH,RECPRPIM,t1h,t1m); if (x > 0.0) { acosh = t2h; acosm = t2m; } else { /* arccos(-x)/pi = 1 - arccos(x)/pi */ t2h = - t2h; t2m = - t2m; Add122(&acosh,&acosm,1.0,t2h,t2m); } /* Rounding test */ if(acosh == (acosh + (acosm * RNROUNDCST))) return acosh; /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); Mul33(&t2h,&t2m,&t2l,RECPRPIH,RECPRPIM,RECPRPIL,t1h,t1m,t1l); if (x > 0.0) { Renormalize3(&acosh,&acosm,&acosl,t2h,t2m,t2l); } else { /* arccos(-x)/pi = 1 - arccos(x)/pi */ t2h = - t2h; t2m = - t2m; t2l = - t2l; Add133(&acoshover,&acosmover,&acoslover,1.0,t2h,t2m,t2l); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); } /* Final rounding */ ReturnRoundToNearest3(acosh,acosm,acosl); } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); /* Recompose acos(x)/pi out of asin(abs(x)) In the case of a substraction, we will cancel not more than 1 bit. */ if (x > 0.0) { asinh = - asinh; asinm = - asinm; } Mul22(&asinpih,&asinpim,RECPRPIH,RECPRPIM,asinh,asinm); Add122Cond(&acosh,&acosm,0.5,asinpih,asinpim); /* Rounding test */ if(acosh == (acosh + (acosm * RNROUNDCST))) return acosh; /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p_accu(&asinh, &asinm, &asinl, z, index); /* Recompose acos(x) out of asin(abs(x)) In the case of a substraction, we will cancel not more than 1 bit. */ if (x > 0.0) { asinh = - asinh; asinm = - asinm; asinl = - asinl; } Mul33(&asinpih,&asinpim,&asinpil,RECPRPIH,RECPRPIM,RECPRPIL,asinh,asinm,asinl); Add133Cond(&acoshover,&acosmover,&acoslover,0.5,asinpih,asinpim,asinpil); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); /* Final rounding */ ReturnRoundToNearest3(acosh,acosm,acosl); } double acospi_rd(double x) { db_number xdb, zdb; double z, zp; int index; double asinh, asinm, asinl; double asinpih, asinpim, asinpil; double acosh, acosm, acosl; double acoshover, acosmover, acoslover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double t2h, t2m, t2l; double xabs; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-54) we have arccos(x)/pi = 1/2 * (1 + xi) with 0 <= xi < 2^(-54) Thus we have acospi(x) = (i) 0.5 if x <= 0 (ii) 0.5 - 1/2 ulp(0.5) if x > 0 */ if (xdb.i[HI] < ACOSPISIMPLEBOUND) { if (x <= 0.0) return 0.5; return HALFMINUSHALFULP; } /* acospi is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return 0.0; } if (x == -1.0) { return 1.0; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); /* Recompose acos/pi We have arccos(x)/pi = 1/2 + (-1/pi) * arcsin(x) No cancellation possible because |asin(x)/pi| <= 0.0837 for |x| <= 0.26 */ Mul22(&asinpih,&asinpim,MRECPRPIH,MRECPRPIM,asinh,asinm); Add122(&acosh,&acosm,0.5,asinpih,asinpim); /* Rounding test */ TEST_AND_RETURN_RD(acosh, acosm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); /* Recompose acos/pi */ Mul33(&asinpih,&asinpim,&asinpil,MRECPRPIH,MRECPRPIM,MRECPRPIL,asinh,asinm,asinl); Add133(&acoshover,&acosmover,&acoslover,0.5,asinpih,asinpim,asinpil); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); /* Final rounding */ ReturnRoundDownwards3(acosh,acosm,acosl); } index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); Mul22(&t2h,&t2m,RECPRPIH,RECPRPIM,t1h,t1m); if (x > 0.0) { acosh = t2h; acosm = t2m; } else { /* arccos(-x)/pi = 1 - arccos(x)/pi */ t2h = - t2h; t2m = - t2m; Add122(&acosh,&acosm,1.0,t2h,t2m); } /* Rounding test */ TEST_AND_RETURN_RD(acosh, acosm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); Mul33(&t2h,&t2m,&t2l,RECPRPIH,RECPRPIM,RECPRPIL,t1h,t1m,t1l); if (x > 0.0) { Renormalize3(&acosh,&acosm,&acosl,t2h,t2m,t2l); } else { /* arccos(-x)/pi = 1 - arccos(x)/pi */ t2h = - t2h; t2m = - t2m; t2l = - t2l; Add133(&acoshover,&acosmover,&acoslover,1.0,t2h,t2m,t2l); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); } /* Final rounding */ ReturnRoundDownwards3(acosh,acosm,acosl); } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); /* Recompose acos(x)/pi out of asin(abs(x)) In the case of a substraction, we will cancel not more than 1 bit. */ if (x > 0.0) { asinh = - asinh; asinm = - asinm; } Mul22(&asinpih,&asinpim,RECPRPIH,RECPRPIM,asinh,asinm); Add122Cond(&acosh,&acosm,0.5,asinpih,asinpim); /* Rounding test */ TEST_AND_RETURN_RD(acosh, acosm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p_accu(&asinh, &asinm, &asinl, z, index); /* Recompose acos(x) out of asin(abs(x)) In the case of a substraction, we will cancel not more than 1 bit. */ if (x > 0.0) { asinh = - asinh; asinm = - asinm; asinl = - asinl; } Mul33(&asinpih,&asinpim,&asinpil,RECPRPIH,RECPRPIM,RECPRPIL,asinh,asinm,asinl); Add133Cond(&acoshover,&acosmover,&acoslover,0.5,asinpih,asinpim,asinpil); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); /* Final rounding */ ReturnRoundDownwards3(acosh,acosm,acosl); } double acospi_ru(double x) { db_number xdb, zdb; double z, zp; int index; double asinh, asinm, asinl; double asinpih, asinpim, asinpil; double acosh, acosm, acosl; double acoshover, acosmover, acoslover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double t2h, t2m, t2l; double xabs; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-54) we have arccos(x)/pi = 1/2 * (1 + xi) with 0 <= xi < 2^(-54) Thus we have acospi(x) = (i) 0.5 if x >= 0 (ii) 0.5 + 1 ulp(0.5) if x < 0 */ if (xdb.i[HI] < ACOSPISIMPLEBOUND) { if (x >= 0.0) return 0.5; return 0.50000000000000011102230246251565404236316680908203125; } /* acospi is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return 0.0; } if (x == -1.0) { return 1.0; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); /* Recompose acos/pi We have arccos(x)/pi = 1/2 + (-1/pi) * arcsin(x) No cancellation possible because |asin(x)/pi| <= 0.0837 for |x| <= 0.26 */ Mul22(&asinpih,&asinpim,MRECPRPIH,MRECPRPIM,asinh,asinm); Add122(&acosh,&acosm,0.5,asinpih,asinpim); /* Rounding test */ TEST_AND_RETURN_RU(acosh, acosm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); /* Recompose acos/pi */ Mul33(&asinpih,&asinpim,&asinpil,MRECPRPIH,MRECPRPIM,MRECPRPIL,asinh,asinm,asinl); Add133(&acoshover,&acosmover,&acoslover,0.5,asinpih,asinpim,asinpil); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); /* Final rounding */ ReturnRoundUpwards3(acosh,acosm,acosl); } index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); Mul22(&t2h,&t2m,RECPRPIH,RECPRPIM,t1h,t1m); if (x > 0.0) { acosh = t2h; acosm = t2m; } else { /* arccos(-x)/pi = 1 - arccos(x)/pi */ t2h = - t2h; t2m = - t2m; Add122(&acosh,&acosm,1.0,t2h,t2m); } /* Rounding test */ TEST_AND_RETURN_RU(acosh, acosm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); Mul33(&t2h,&t2m,&t2l,RECPRPIH,RECPRPIM,RECPRPIL,t1h,t1m,t1l); if (x > 0.0) { Renormalize3(&acosh,&acosm,&acosl,t2h,t2m,t2l); } else { /* arccos(-x)/pi = 1 - arccos(x)/pi */ t2h = - t2h; t2m = - t2m; t2l = - t2l; Add133(&acoshover,&acosmover,&acoslover,1.0,t2h,t2m,t2l); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); } /* Final rounding */ ReturnRoundUpwards3(acosh,acosm,acosl); } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); /* Recompose acos(x)/pi out of asin(abs(x)) In the case of a substraction, we will cancel not more than 1 bit. */ if (x > 0.0) { asinh = - asinh; asinm = - asinm; } Mul22(&asinpih,&asinpim,RECPRPIH,RECPRPIM,asinh,asinm); Add122Cond(&acosh,&acosm,0.5,asinpih,asinpim); /* Rounding test */ TEST_AND_RETURN_RU(acosh, acosm, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p_accu(&asinh, &asinm, &asinl, z, index); /* Recompose acos(x) out of asin(abs(x)) In the case of a substraction, we will cancel not more than 1 bit. */ if (x > 0.0) { asinh = - asinh; asinm = - asinm; asinl = - asinl; } Mul33(&asinpih,&asinpim,&asinpil,RECPRPIH,RECPRPIM,RECPRPIL,asinh,asinm,asinl); Add133Cond(&acoshover,&acosmover,&acoslover,0.5,asinpih,asinpim,asinpil); Renormalize3(&acosh,&acosm,&acosl,acoshover,acosmover,acoslover); /* Final rounding */ ReturnRoundUpwards3(acosh,acosm,acosl); } double asinpi_rn(double x) { db_number xdb, zdb, asinhdb, tempdb; double sign, z, zp; int index; double asinh, asinm, asinl; double asinpih, asinpim, asinpil; double asinpihover, asinpimover, asinpilover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double t2h, t2m, t2l; double asinpi; double xabs; double xScaled; double xPih, xPim, xPil; double xPihover, xPimover, xPilover; double deltatemp, deltah, deltal; double temp1, temp2h, temp2l, temp3; double miulp; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-60) we have arcsin(x)/pi = x * triple-double(1/pi) * ( 1 + xi ) with 0 <= xi < 2^(-122) We have no bad case worser than 112 bits for asinpi(x) for |x| > 2^(-58) and the order 3 term of asinpi is still more far away. */ if (xdb.i[HI] < ASINPISIMPLEBOUND) { /* For a faster path for the exact case, we check first if x = 0 */ if (x == 0.0) return x; /* We want a relatively fast path for values where neither the input nor the output is subnormal because subnormal rounding is expensive. Since abs(double(asin(x)/pi)) <= 2^(-860) for abs(x) <= 2^(-858), we filter for this (normal) value. */ if (xdb.i[HI] >= ASINPINOSUBNORMALBOUND) { /* Here abs(x) >= 2^(-858). The result is therefore clearly normal and the double precision numbers in the triple-double representation of TD(1/pi) * x are all normal, too. For speed, we use a two-step approach. We know that || x*DD(1/pi)/(asin(x)/pi) - 1 ||_[-2^(-60);2^(-60)]^\infty <= 2^(-107.8) <= 2^(-80) */ Mul122(&xPih,&xPim,x,RECPRPIH,RECPRPIM); if(xPih == (xPih + (xPim * RNROUNDCSTASINPI))) return xPih; Mul133(&xPihover,&xPimover,&xPilover,x,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&xPih,&xPim,&xPil,xPihover,xPimover,xPilover); ReturnRoundToNearest3(xPih,xPim,xPil); } /* Here abs(x) < 2^(-858) Because of subnormals and especially because of the fact that 1/pi < 1, we must scale x appropriately. We compute hence: asinpi(x) = round( ((x * 2^(1000)) * triple-double(1/pi)) * 2^(-1000)) where the rounding procedure works temporarily on the scaled intermediate. */ xScaled = x * TWO1000; Mul133(&xPihover,&xPimover,&xPilover,xScaled,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&xPih,&xPim,&xPil,xPihover,xPimover,xPilover); /* Produce a (possibly) subnormal intermediate rounding */ asinhdb.d = xPih * TWOM1000; #if defined(CRLIBM_TYPECPU_AMD64) || defined(CRLIBM_TYPECPU_X86) tempdb.i[HI] = asinhdb.i[HI]; tempdb.i[LO] = asinhdb.i[LO]; asinhdb.i[LO] = tempdb.i[LO]; asinhdb.i[HI] = tempdb.i[HI]; #else tempdb.d = asinhdb.d; #endif /* Rescale the result */ temp1 = asinhdb.d * TWO1000; /* Compute the scaled error, the operation is exact by Sterbenz' lemma */ deltatemp = xPih - temp1; /* Sum up the errors, representing them on a double-double This is exact for the normal rounding case and the error is neglectable in the subnormal rounding case. */ Add12Cond(temp2h,temp2l,deltatemp,xPim); temp3 = temp2l + xPil; Add12(deltah,deltal,temp2h,temp3); /* Compute now a scaled 1/2 ulp of the intermediate result in the direction of delta */ if ((x >= 0.0) ^ (deltah >= 0.0)) tempdb.l--; else tempdb.l++; miulp = TWO999 * (tempdb.d - asinhdb.d); /* We must correct the intermediate rounding if the error on deltah + deltal is greater in absolute value than miulp = 1/2 ulp in the right direction. */ if (ABS(deltah) < ABS(miulp)) { /* deltah is less than miulp, deltal is less than 1/2 the ulp of deltah. Thus deltah + deltal is less than miulp. We do not need to correct the intermediate rounding. */ return asinhdb.d; } if (ABS(deltah) > ABS(miulp)) { /* deltah is greater than miulp and deltal cannot correct it. We must correct the rounding. tempdb.d (= asinhdb.d +/- 1 ulp) is the correct rounding. */ return tempdb.d; } /* Here deltah and miulp are equal in absolute value We must correct the intermediate rounding iff the sign of deltal and deltah are the same. */ if ((deltah >= 0.0) ^ (deltal >= 0.0)) { /* Here the sign is different, we return the intermediate rounding asinhdb.d */ return asinhdb.d; } /* Return the corrected result tempdb.d */ return tempdb.d; } /* asinpi is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return 0.5; } if (x == -1.0) { return - 0.5; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); Mul22(&asinpih,&asinpim,asinh,asinm,RECPRPIH,RECPRPIM); /* Rounding test */ if(asinpih == (asinpih + (asinpim * RNROUNDCST))) return asinpih; /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); Mul33(&asinpihover,&asinpimover,&asinpilover,asinh,asinm,asinl,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&asinpih,&asinpim,&asinpil,asinpihover,asinpimover,asinpilover); /* Final rounding */ ReturnRoundToNearest3(asinpih,asinpim,asinpil); } /* Strip off the sign of argument x */ sign = 1.0; if (x < 0.0) sign = -sign; index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); p9h = -p9h; p9m = -p9m; sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); Mul22(&t2h,&t2m,t1h,t1m,RECPRPIH,RECPRPIM); Add122(&asinpih,&asinpim,0.5,t2h,t2m); /* Rounding test */ if(asinpih == (asinpih + (asinpim * RNROUNDCST))) return sign * asinpih; /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); p9h = -p9h; p9m = -p9m; p9l = -p9l; Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); Mul33(&t2h,&t2m,&t2l,t1h,t1m,t1l,RECPRPIH,RECPRPIM,RECPRPIL); Add133(&asinpihover,&asinpimover,&asinpilover,0.5,t2h,t2m,t2l); Renormalize3(&asinpih,&asinpim,&asinpil,asinpihover,asinpimover,asinpilover); /* Final rounding */ RoundToNearest3(&asinpi,asinpih,asinpim,asinpil); return sign * asinpi; } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); Mul22(&asinpih,&asinpim,asinh,asinm,RECPRPIH,RECPRPIM); /* Rounding test */ if(asinpih == (asinpih + (asinpim * RNROUNDCST))) return sign * asinpih; /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p_accu(&asinh, &asinm, &asinl, z, index); Mul33(&asinpihover,&asinpimover,&asinpilover,asinh,asinm,asinl,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&asinpih,&asinpim,&asinpil,asinpihover,asinpimover,asinpilover); /* Final rounding */ RoundToNearest3(&asinpi,asinpih,asinpim,asinpil); return sign * asinpi; } double asinpi_rd(double x) { db_number xdb, zdb, asinhdb; double sign, z, zp; int index; double asinh, asinm, asinl; double asinpih, asinpim, asinpil; double asinpihover, asinpimover, asinpilover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double t2h, t2m, t2l; double asinpi; double xabs; double xScaled; double xPih, xPim, xPil; double xPihover, xPimover, xPilover; #if defined(CRLIBM_TYPECPU_AMD64) || defined(CRLIBM_TYPECPU_X86) db_number tempdb; #endif double deltatemp, deltah, deltal; double temp1, temp2h, temp2l, temp3; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-60) we have arcsin(x)/pi = x * triple-double(1/pi) * ( 1 + xi ) with 0 <= xi < 2^(-122) We have no bad case worser than 112 bits for asinpi(x) for |x| > 2^(-58) and the order 3 term of asinpi is still more far away. */ if (xdb.i[HI] < ASINPISIMPLEBOUND) { /* For a faster path for the exact case, we check first if x = 0 */ if (x == 0.0) return x; /* We want a relatively fast path for values where neither the input nor the output is subnormal because subnormal rounding is expensive. Since abs(double(asin(x)/pi)) <= 2^(-860) for abs(x) <= 2^(-858), we filter for this (normal) value. */ if (xdb.i[HI] >= ASINPINOSUBNORMALBOUND) { /* Here abs(x) >= 2^(-858). The result is therefore clearly normal and the double precision numbers in the triple-double representation of TD(1/pi) * x are all normal, too. For speed, we use a two-step approach. We know that || x*DD(1/pi)/(asin(x)/pi) - 1 ||_[-2^(-60);2^(-60)]^\infty <= 2^(-107.8) <= 2^(-80) */ Mul122(&xPih,&xPim,x,RECPRPIH,RECPRPIM); TEST_AND_RETURN_RD(xPih, xPim, RDROUNDCSTASINPI); Mul133(&xPihover,&xPimover,&xPilover,x,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&xPih,&xPim,&xPil,xPihover,xPimover,xPilover); ReturnRoundDownwards3(xPih,xPim,xPil); } /* Here abs(x) < 2^(-858) Because of subnormals and especially because of the fact that 1/pi < 1, we must scale x appropriately. We compute hence: asinpi(x) = round( ((x * 2^(1000)) * triple-double(1/pi)) * 2^(-1000)) where the rounding procedure works temporarily on the scaled intermediate. */ xScaled = x * TWO1000; Mul133(&xPihover,&xPimover,&xPilover,xScaled,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&xPih,&xPim,&xPil,xPihover,xPimover,xPilover); /* Produce a (possibly) subnormal intermediate rounding */ asinhdb.d = xPih * TWOM1000; #if defined(CRLIBM_TYPECPU_AMD64) || defined(CRLIBM_TYPECPU_X86) tempdb.i[HI] = asinhdb.i[HI]; tempdb.i[LO] = asinhdb.i[LO]; asinhdb.i[LO] = tempdb.i[LO]; asinhdb.i[HI] = tempdb.i[HI]; #endif /* Rescale the result */ temp1 = asinhdb.d * TWO1000; /* Compute the scaled error, the operation is exact by Sterbenz' lemma */ deltatemp = xPih - temp1; /* Sum up the errors, representing them on a double-double This is exact for the normal rounding case and the error is neglectable in the subnormal rounding case. */ Add12Cond(temp2h,temp2l,deltatemp,xPim); temp3 = temp2l + xPil; Add12(deltah,deltal,temp2h,temp3); /* We are doing directed rounding. Thus we must correct the rounding if the sign of the error is not correct RD -> sign must be positive for correct rounding RU -> sign must be negative for correct rounding RZ -> sign must be positive for positive x and negative for negative x */ if (deltah >= 0.0) { /* The sign is correct, return the intermediate rounding */ return asinhdb.d; } /* The sign is not correct RD -> subtract 1 ulp RU -> add 1 ulp RZ -> subtract 1 ulp if x positive, add 1 ulp if x negative */ if (x < 0.0) asinhdb.l++; else asinhdb.l--; return asinhdb.d; } /* asinpi is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return 0.5; } if (x == -1.0) { return - 0.5; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); Mul22(&asinpih,&asinpim,asinh,asinm,RECPRPIH,RECPRPIM); /* Rounding test */ TEST_AND_RETURN_RD(asinpih, asinpim, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); Mul33(&asinpihover,&asinpimover,&asinpilover,asinh,asinm,asinl,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&asinpih,&asinpim,&asinpil,asinpihover,asinpimover,asinpilover); /* Final rounding */ ReturnRoundDownwards3(asinpih,asinpim,asinpil); } /* Strip off the sign of argument x */ sign = 1.0; if (x < 0.0) sign = -sign; index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); p9h = -p9h; p9m = -p9m; sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); Mul22(&t2h,&t2m,t1h,t1m,RECPRPIH,RECPRPIM); Add122(&asinpih,&asinpim,0.5,t2h,t2m); /* Rounding test */ asinpih *= sign; asinpim *= sign; TEST_AND_RETURN_RD(asinpih, asinpim, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); p9h = -p9h; p9m = -p9m; p9l = -p9l; Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); Mul33(&t2h,&t2m,&t2l,t1h,t1m,t1l,RECPRPIH,RECPRPIM,RECPRPIL); Add133(&asinpihover,&asinpimover,&asinpilover,0.5,t2h,t2m,t2l); Renormalize3(&asinpih,&asinpim,&asinpil,asinpihover,asinpimover,asinpilover); /* Final rounding */ RoundDownwards3(&asinpi,asinpih,asinpim,asinpil); return sign * asinpi; } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); Mul22(&asinpih,&asinpim,asinh,asinm,RECPRPIH,RECPRPIM); /* Rounding test */ asinpih *= sign; asinpim *= sign; TEST_AND_RETURN_RD(asinpih, asinpim, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p_accu(&asinh, &asinm, &asinl, z, index); Mul33(&asinpihover,&asinpimover,&asinpilover,asinh,asinm,asinl,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&asinpih,&asinpim,&asinpil,asinpihover,asinpimover,asinpilover); /* Final rounding */ RoundDownwards3(&asinpi,asinpih,asinpim,asinpil); return sign * asinpi; } double asinpi_ru(double x) { db_number xdb, zdb, asinhdb; double sign, z, zp; int index; double asinh, asinm, asinl; double asinpih, asinpim, asinpil; double asinpihover, asinpimover, asinpilover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double t2h, t2m, t2l; double asinpi; double xabs; double xScaled; double xPih, xPim, xPil; double xPihover, xPimover, xPilover; #if defined(CRLIBM_TYPECPU_AMD64) || defined(CRLIBM_TYPECPU_X86) db_number tempdb; #endif double deltatemp, deltah, deltal; double temp1, temp2h, temp2l, temp3; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-60) we have arcsin(x)/pi = x * triple-double(1/pi) * ( 1 + xi ) with 0 <= xi < 2^(-122) We have no bad case worser than 112 bits for asinpi(x) for |x| > 2^(-58) and the order 3 term of asinpi is still more far away. */ if (xdb.i[HI] < ASINPISIMPLEBOUND) { /* For a faster path for the exact case, we check first if x = 0 */ if (x == 0.0) return x; /* We want a relatively fast path for values where neither the input nor the output is subnormal because subnormal rounding is expensive. Since abs(double(asin(x)/pi)) <= 2^(-860) for abs(x) <= 2^(-858), we filter for this (normal) value. */ if (xdb.i[HI] >= ASINPINOSUBNORMALBOUND) { /* Here abs(x) >= 2^(-858). The result is therefore clearly normal and the double precision numbers in the triple-double representation of TD(1/pi) * x are all normal, too. For speed, we use a two-step approach. We know that || x*DD(1/pi)/(asin(x)/pi) - 1 ||_[-2^(-60);2^(-60)]^\infty <= 2^(-107.8) <= 2^(-80) */ Mul122(&xPih,&xPim,x,RECPRPIH,RECPRPIM); TEST_AND_RETURN_RU(xPih, xPim, RDROUNDCSTASINPI); Mul133(&xPihover,&xPimover,&xPilover,x,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&xPih,&xPim,&xPil,xPihover,xPimover,xPilover); ReturnRoundUpwards3(xPih,xPim,xPil); } /* Here abs(x) < 2^(-858) Because of subnormals and especially because of the fact that 1/pi < 1, we must scale x appropriately. We compute hence: asinpi(x) = round( ((x * 2^(1000)) * triple-double(1/pi)) * 2^(-1000)) where the rounding procedure works temporarily on the scaled intermediate. */ xScaled = x * TWO1000; Mul133(&xPihover,&xPimover,&xPilover,xScaled,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&xPih,&xPim,&xPil,xPihover,xPimover,xPilover); /* Produce a (possibly) subnormal intermediate rounding */ asinhdb.d = xPih * TWOM1000; #if defined(CRLIBM_TYPECPU_AMD64) || defined(CRLIBM_TYPECPU_X86) tempdb.i[HI] = asinhdb.i[HI]; tempdb.i[LO] = asinhdb.i[LO]; asinhdb.i[LO] = tempdb.i[LO]; asinhdb.i[HI] = tempdb.i[HI]; #endif /* Rescale the result */ temp1 = asinhdb.d * TWO1000; /* Compute the scaled error, the operation is exact by Sterbenz' lemma */ deltatemp = xPih - temp1; /* Sum up the errors, representing them on a double-double This is exact for the normal rounding case and the error is neglectable in the subnormal rounding case. */ Add12Cond(temp2h,temp2l,deltatemp,xPim); temp3 = temp2l + xPil; Add12(deltah,deltal,temp2h,temp3); /* We are doing directed rounding. Thus we must correct the rounding if the sign of the error is not correct RD -> sign must be positive for correct rounding RU -> sign must be negative for correct rounding RZ -> sign must be positive for positive x and negative for negative x */ if (deltah <= 0.0) { /* The sign is correct, return the intermediate rounding */ return asinhdb.d; } /* The sign is not correct RD -> subtract 1 ulp RU -> add 1 ulp RZ -> subtract 1 ulp if x positive, add 1 ulp if x negative */ if (x < 0.0) asinhdb.l--; else asinhdb.l++; return asinhdb.d; } /* asinpi is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return 0.5; } if (x == -1.0) { return - 0.5; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); Mul22(&asinpih,&asinpim,asinh,asinm,RECPRPIH,RECPRPIM); /* Rounding test */ TEST_AND_RETURN_RU(asinpih, asinpim, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); Mul33(&asinpihover,&asinpimover,&asinpilover,asinh,asinm,asinl,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&asinpih,&asinpim,&asinpil,asinpihover,asinpimover,asinpilover); /* Final rounding */ ReturnRoundUpwards3(asinpih,asinpim,asinpil); } /* Strip off the sign of argument x */ sign = 1.0; if (x < 0.0) sign = -sign; index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); p9h = -p9h; p9m = -p9m; sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); Mul22(&t2h,&t2m,t1h,t1m,RECPRPIH,RECPRPIM); Add122(&asinpih,&asinpim,0.5,t2h,t2m); /* Rounding test */ asinpih *= sign; asinpim *= sign; TEST_AND_RETURN_RU(asinpih, asinpim, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); p9h = -p9h; p9m = -p9m; p9l = -p9l; Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); Mul33(&t2h,&t2m,&t2l,t1h,t1m,t1l,RECPRPIH,RECPRPIM,RECPRPIL); Add133(&asinpihover,&asinpimover,&asinpilover,0.5,t2h,t2m,t2l); Renormalize3(&asinpih,&asinpim,&asinpil,asinpihover,asinpimover,asinpilover); /* Final rounding */ RoundUpwards3(&asinpi,asinpih,asinpim,asinpil); return sign * asinpi; } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); Mul22(&asinpih,&asinpim,asinh,asinm,RECPRPIH,RECPRPIM); /* Rounding test */ asinpih *= sign; asinpim *= sign; TEST_AND_RETURN_RU(asinpih, asinpim, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p_accu(&asinh, &asinm, &asinl, z, index); Mul33(&asinpihover,&asinpimover,&asinpilover,asinh,asinm,asinl,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&asinpih,&asinpim,&asinpil,asinpihover,asinpimover,asinpilover); /* Final rounding */ RoundUpwards3(&asinpi,asinpih,asinpim,asinpil); return sign * asinpi; } double asinpi_rz(double x) { db_number xdb, zdb, asinhdb; double sign, z, zp; int index; double asinh, asinm, asinl; double asinpih, asinpim, asinpil; double asinpihover, asinpimover, asinpilover; double p9h, p9m, p9l, sqrh, sqrm, sqrl; double t1h, t1m, t1l; double t2h, t2m, t2l; double asinpi; double xabs; double xScaled; double xPih, xPim, xPil; double xPihover, xPimover, xPilover; #if defined(CRLIBM_TYPECPU_AMD64) || defined(CRLIBM_TYPECPU_X86) db_number tempdb; #endif double deltatemp, deltah, deltal; double temp1, temp2h, temp2l, temp3; /* Start already computations for argument reduction */ zdb.d = 1.0 + x * x; xdb.d = x; /* Special case handling */ /* Remove sign of x in floating-point */ xabs = ABS(x); xdb.i[HI] &= 0x7fffffff; /* If |x| < 2^(-60) we have arcsin(x)/pi = x * triple-double(1/pi) * ( 1 + xi ) with 0 <= xi < 2^(-122) We have no bad case worser than 112 bits for asinpi(x) for |x| > 2^(-58) and the order 3 term of asinpi is still more far away. */ if (xdb.i[HI] < ASINPISIMPLEBOUND) { /* For a faster path for the exact case, we check first if x = 0 */ if (x == 0.0) return x; /* We want a relatively fast path for values where neither the input nor the output is subnormal because subnormal rounding is expensive. Since abs(double(asin(x)/pi)) <= 2^(-860) for abs(x) <= 2^(-858), we filter for this (normal) value. */ if (xdb.i[HI] >= ASINPINOSUBNORMALBOUND) { /* Here abs(x) >= 2^(-858). The result is therefore clearly normal and the double precision numbers in the triple-double representation of TD(1/pi) * x are all normal, too. For speed, we use a two-step approach. We know that || x*DD(1/pi)/(asin(x)/pi) - 1 ||_[-2^(-60);2^(-60)]^\infty <= 2^(-107.8) <= 2^(-80) */ Mul122(&xPih,&xPim,x,RECPRPIH,RECPRPIM); TEST_AND_RETURN_RZ(xPih, xPim, RDROUNDCSTASINPI); Mul133(&xPihover,&xPimover,&xPilover,x,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&xPih,&xPim,&xPil,xPihover,xPimover,xPilover); ReturnRoundTowardsZero3(xPih,xPim,xPil); } /* Here abs(x) < 2^(-858) Because of subnormals and especially because of the fact that 1/pi < 1, we must scale x appropriately. We compute hence: asinpi(x) = round( ((x * 2^(1000)) * triple-double(1/pi)) * 2^(-1000)) where the rounding procedure works temporarily on the scaled intermediate. */ xScaled = x * TWO1000; Mul133(&xPihover,&xPimover,&xPilover,xScaled,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&xPih,&xPim,&xPil,xPihover,xPimover,xPilover); /* Produce a (possibly) subnormal intermediate rounding */ asinhdb.d = xPih * TWOM1000; #if defined(CRLIBM_TYPECPU_AMD64) || defined(CRLIBM_TYPECPU_X86) tempdb.i[HI] = asinhdb.i[HI]; tempdb.i[LO] = asinhdb.i[LO]; asinhdb.i[LO] = tempdb.i[LO]; asinhdb.i[HI] = tempdb.i[HI]; #endif /* Rescale the result */ temp1 = asinhdb.d * TWO1000; /* Compute the scaled error, the operation is exact by Sterbenz' lemma */ deltatemp = xPih - temp1; /* Sum up the errors, representing them on a double-double This is exact for the normal rounding case and the error is neglectable in the subnormal rounding case. */ Add12Cond(temp2h,temp2l,deltatemp,xPim); temp3 = temp2l + xPil; Add12(deltah,deltal,temp2h,temp3); /* We are doing directed rounding. Thus we must correct the rounding if the sign of the error is not correct RD -> sign must be positive for correct rounding RU -> sign must be negative for correct rounding RZ -> sign must be positive for positive x and negative for negative x */ if ((x > 0.0) ^ (deltah < 0.0)) { /* The sign is correct, return the intermediate rounding */ return asinhdb.d; } /* The sign is not correct RD -> subtract 1 ulp RU -> add 1 ulp RZ -> subtract 1 ulp if x positive, add 1 ulp if x negative */ asinhdb.l--; return asinhdb.d; } /* asinpi is defined on -1 <= x <= 1, elsewhere it is NaN */ if (xdb.i[HI] >= 0x3ff00000) { if (x == 1.0) { return 0.5; } if (x == -1.0) { return - 0.5; } return (x-x)/0.0; /* return NaN */ } /* Argument reduction: We have 10 intervals and 3 paths: - interval 0 => path 1 using p0 - interval 1-8 => path 2 using p - interval 9 => path 3 using p9 */ index = (0x000f0000 & zdb.i[HI]) >> 16; /* 0 <= index <= 15 index approximates roughly x^2 Map indexes to intervals as follows: 0 -> 0 1 -> 1 ... 8 -> 8 9 -> 9 ... 15 -> 9 For this mapping, filter first the case 0 -> 0 In consequence, 1 <= index <= 15, i.e. 0 <= index - 1 <= 14 with the mapping index - 1 -> interval as 0 -> 1 ... 7 -> 8 8 -> 9 ... 15 -> 9 Thus it suffices to check the 3rd bit of index - 1 after the first filter. */ if (index == 0) { /* Path 1 using p0 */ p0_quick(&asinh, &asinm, x, xdb.i[HI]); Mul22(&asinpih,&asinpim,asinh,asinm,RECPRPIH,RECPRPIM); /* Rounding test */ TEST_AND_RETURN_RZ(asinpih, asinpim, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p0_accu(&asinh, &asinm, &asinl, x); Mul33(&asinpihover,&asinpimover,&asinpilover,asinh,asinm,asinl,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&asinpih,&asinpim,&asinpil,asinpihover,asinpimover,asinpilover); /* Final rounding */ ReturnRoundTowardsZero3(asinpih,asinpim,asinpil); } /* Strip off the sign of argument x */ sign = 1.0; if (x < 0.0) sign = -sign; index--; if ((index & 0x8) != 0) { /* Path 3 using p9 */ /* Do argument reduction using a MI_9 as a midpoint value for the polynomial and compute exactly zp = 2 * (1 - x) for the asymptotical approximation using a square root. */ z = xabs - MI_9; zp = 2.0 * (1.0 - xabs); /* Polynomial approximation and square root extraction */ p9_quick(&p9h, &p9m, z); p9h = -p9h; p9m = -p9m; sqrt12_64_unfiltered(&sqrh,&sqrm,zp); /* Reconstruction */ Mul22(&t1h,&t1m,sqrh,sqrm,p9h,p9m); Mul22(&t2h,&t2m,t1h,t1m,RECPRPIH,RECPRPIM); Add122(&asinpih,&asinpim,0.5,t2h,t2m); /* Rounding test */ asinpih *= sign; asinpim *= sign; TEST_AND_RETURN_RZ(asinpih, asinpim, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p9_accu(&p9h, &p9m, &p9l, z); p9h = -p9h; p9m = -p9m; p9l = -p9l; Sqrt13(&sqrh,&sqrm,&sqrl,zp); /* Reconstruction */ Mul33(&t1h,&t1m,&t1l,sqrh,sqrm,sqrl,p9h,p9m,p9l); Mul33(&t2h,&t2m,&t2l,t1h,t1m,t1l,RECPRPIH,RECPRPIM,RECPRPIL); Add133(&asinpihover,&asinpimover,&asinpilover,0.5,t2h,t2m,t2l); Renormalize3(&asinpih,&asinpim,&asinpil,asinpihover,asinpimover,asinpilover); /* Final rounding */ RoundTowardsZero3(&asinpi,asinpih,asinpim,asinpil); return sign * asinpi; } /* Path 2 using p */ /* Do argument reduction using a table value for the midpoint value */ z = xabs - mi_i; p_quick(&asinh, &asinm, z, index); Mul22(&asinpih,&asinpim,asinh,asinm,RECPRPIH,RECPRPIM); /* Rounding test */ asinpih *= sign; asinpim *= sign; TEST_AND_RETURN_RZ(asinpih, asinpim, RDROUNDCST); /* Rounding test failed, launch accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif p_accu(&asinh, &asinm, &asinl, z, index); Mul33(&asinpihover,&asinpimover,&asinpilover,asinh,asinm,asinl,RECPRPIH,RECPRPIM,RECPRPIL); Renormalize3(&asinpih,&asinpim,&asinpil,asinpihover,asinpimover,asinpilover); /* Final rounding */ RoundTowardsZero3(&asinpi,asinpih,asinpim,asinpil); return sign * asinpi; } interval-2.1.0/src/crlibm/asincos.h0000644000000000000000000015473613031036767015361 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" #define RNROUNDCST 1.00277296776935912123020172797003775857085744686284e+00 #define RDROUNDCST 1.53329341668337408143884997262066747209318683475599e-19 #define RNROUNDCSTASINPI 1.00000001500000000000000000000000000000000000000000e+00 #define RDROUNDCSTASINPI 0.827180612553027674871408692069962853565812110900878906e-24 #define ASINSIMPLEBOUND 0x3e300000 #define ACOSSIMPLEBOUND 0x3e400000 #define ASINPISIMPLEBOUND 0x3c300000 #define ACOSPISIMPLEBOUND 0x3c900000 #define ASINPINOSUBNORMALBOUND 0xa5000000 #define EXTRABOUND 0x3f500000 #define EXTRABOUND2 0x3f020000 #define PIHALFH 1.57079632679489655799898173427209258079528808593750e+00 #define PIHALFM 6.12323399573676603586882014729198302312846062338790e-17 #define PIHALFL -1.49738490485916983294350817710599200835275047616952e-33 #define PIHALFRU 0.15707963267948967800435866593034006655216217041015625e1 #define PIRU 0.3141592653589793560087173318606801331043243408203125e1 #define PIH 0.3141592653589793115997963468544185161590576171875e1 #define PIM 0.12246467991473532071737640294583966046256921246775800638e-15 #define PIL -0.29947698097183396658870163542119840167055009523390379678e-32 #define RECPRPIH 0.318309886183790691216444201927515678107738494873046875 #define RECPRPIM -0.19678676675182485881895190914091814184147410411859432932679681016452e-16 #define RECPRPIL -0.10721436282893004003289965208411408821619722030338845557662168511367e-32 #define MRECPRPIH -0.318309886183790691216444201927515678107738494873046875 #define MRECPRPIM 0.19678676675182485881895190914091814184147410411859432932679681016452e-16 #define MRECPRPIL 0.10721436282893004003289965208411408821619722030338845557662168511367e-32 #define HALFPLUSULP 0.50000000000000011102230246251565404236316680908203125 #define HALFMINUSHALFULP 0.499999999999999944488848768742172978818416595458984375 #define TWO1000 0.107150860718626732094842504906000181056140481170553360744e302 #define TWOM1000 0.933263618503218878990089544723817169617091446371708024622e-301 #define TWO999 0.535754303593133660474212524530000905280702405852766803722e301 #define ASINBADCASEX 0.47810755953933303796787868122919462621212005615234375 #define ASINBADCASEYRU 0.49849878588087548347829169870237819850444793701171875 #define ASINBADCASEYRD 0.498498785880875427967140467444551177322864532470703125 #define p0_quick_coeff_19h 1.28394578033992016324882357025671808514744043350219726562500000000000000000000000e-02 #define p0_quick_coeff_17h 1.11230171262417399519195626567125145811587572097778320312500000000000000000000000e-02 #define p0_quick_coeff_15h 1.39970189350021451124561622236797120422124862670898437500000000000000000000000000e-02 #define p0_quick_coeff_13h 1.73513233791185925158906400156411109492182731628417968750000000000000000000000000e-02 #define p0_quick_coeff_11h 2.23721986984502102524530187110940460115671157836914062500000000000000000000000000e-02 #define p0_quick_coeff_9h 3.03819437875142428495678359468001872301101684570312500000000000000000000000000000e-02 #define p0_quick_coeff_7h 4.46428571490314687886247213555179769173264503479003906250000000000000000000000000e-02 #define p0_quick_coeff_5h 7.49999999999713951037705328417359851300716400146484375000000000000000000000000000e-02 #define p0_quick_coeff_3h 1.66666666666666712925959359381522517651319503784179687500000000000000000000000000e-01 #define p0_quick_coeff_1h 1.00000000000000000000000000000000000000000000000000000000000000000000000000000000e+00 #define mi_i asinPolyQuickMiddleTbl[16 * index + 0] #define p_quick_coeff_0h asinPolyQuickMiddleTbl[16 * index + 1] #define p_quick_coeff_0m asinPolyQuickMiddleTbl[16 * index + 2] #define p_quick_coeff_1h asinPolyQuickMiddleTbl[16 * index + 3] #define p_quick_coeff_1m asinPolyQuickMiddleTbl[16 * index + 4] #define p_quick_coeff_2h asinPolyQuickMiddleTbl[16 * index + 5] #define p_quick_coeff_3h asinPolyQuickMiddleTbl[16 * index + 6] #define p_quick_coeff_4h asinPolyQuickMiddleTbl[16 * index + 7] #define p_quick_coeff_5h asinPolyQuickMiddleTbl[16 * index + 8] #define p_quick_coeff_6h asinPolyQuickMiddleTbl[16 * index + 9] #define p_quick_coeff_7h asinPolyQuickMiddleTbl[16 * index + 10] #define p_quick_coeff_8h asinPolyQuickMiddleTbl[16 * index + 11] #define p_quick_coeff_9h asinPolyQuickMiddleTbl[16 * index + 12] #define p_quick_coeff_10h asinPolyQuickMiddleTbl[16 * index + 13] #define p_quick_coeff_11h asinPolyQuickMiddleTbl[16 * index + 14] #define p_quick_coeff_12h asinPolyQuickMiddleTbl[16 * index + 15] #define MI_9 0.87500000000078237416545334781403653323650360107421875 #define p9_quick_coeff_0h 1.01072102056824553173441927356179803609848022460937500000000000000000000000000000e+00 #define p9_quick_coeff_1h -8.82981536812866424357437722392205614596605300903320312500000000000000000000000000e-02 #define p9_quick_coeff_2h 2.10353760393442237863759203264635289087891578674316406250000000000000000000000000e-02 #define p9_quick_coeff_3h -6.65063923819934552095212154654291225597262382507324218750000000000000000000000000e-03 #define p9_quick_coeff_4h 2.40768516599235756631136595729003602173179388046264648437500000000000000000000000e-03 #define p9_quick_coeff_5h -9.43873142704901193882072174545783127541653811931610107421875000000000000000000000e-04 #define p9_quick_coeff_6h 3.89946181164527888064752492169873221428133547306060791015625000000000000000000000e-04 #define p9_quick_coeff_7h -1.67200190558221219085804909454395783541258424520492553710937500000000000000000000e-04 #define p9_quick_coeff_8h 7.37040535228812338126858083597880977322347462177276611328125000000000000000000000e-05 #define p9_quick_coeff_9h -3.32003992244226181431050737291599261880037374794483184814453125000000000000000000e-05 #define p9_quick_coeff_10h 1.53656152855036036170705004977321550541091710329055786132812500000000000000000000e-05 #define p9_quick_coeff_11h -7.04415207421768136802344914548790200115035986527800559997558593750000000000000000e-06 #define p0_accu_coeff_1h 1.00000000000000000000000000000000000000000000000000000000000000000000000000000000e+00 #define p0_accu_coeff_3h 1.66666666666666657414808128123695496469736099243164062500000000000000000000000000e-01 #define p0_accu_coeff_3m 9.25185853854296757512770104458324356634117384146900539554358999794203555211424828e-18 #define p0_accu_coeff_5h 7.49999999999999972244424384371086489409208297729492187500000000000000000000000000e-02 #define p0_accu_coeff_5m 2.77555756157123848551244900139306363413139848179272961559149734966922551393508911e-18 #define p0_accu_coeff_7h 4.46428571428571438484134148438897682353854179382324218750000000000000000000000000e-02 #define p0_accu_coeff_7m -9.91270564650888671257031422999640405542600950171395167431764861021292745135724545e-19 #define p0_accu_coeff_9h 3.03819444444444440589503386718206456862390041351318359375000000000000000000000000e-02 #define p0_accu_coeff_9m 3.85497067132392282371332994114988395042540962791093560324551248186253360472619534e-19 #define p0_accu_coeff_11h 2.23721590909090918553037141691675060428678989410400390625000000000000000000000000e-02 #define p0_accu_coeff_11m -9.46970190235819944882493359250540536388374860744029243297958942093828227370977402e-19 #define p0_accu_coeff_13h 1.73527644230769238775646812200648128055036067962646484375000000000000000000000000e-02 #define p0_accu_coeff_13m -6.73286913315360860061003796178520710524664576113391175476996508564297982957214117e-19 #define p0_accu_coeff_15h 1.39648437499999850813781065994589880574494600296020507812500000000000000000000000e-02 #define p0_accu_coeff_17h 1.15518008961409714141499449624461703933775424957275390625000000000000000000000000e-02 #define p0_accu_coeff_19h 9.76160952911427071132521859908592887222766876220703125000000000000000000000000000e-03 #define p0_accu_coeff_21h 8.39033581342360154642356917520373826846480369567871093750000000000000000000000000e-03 #define p0_accu_coeff_23h 7.31252573485535913022648202286291052587330341339111328125000000000000000000000000e-03 #define p0_accu_coeff_25h 6.44721419032266533644115469314783695153892040252685546875000000000000000000000000e-03 #define p0_accu_coeff_27h 5.73995473599474108350459999883241835050284862518310546875000000000000000000000000e-03 #define p0_accu_coeff_29h 5.15465255859299739671364193327462999150156974792480468750000000000000000000000000e-03 #define p0_accu_coeff_31h 4.64401037031901206542094939777598483487963676452636718750000000000000000000000000e-03 #define p0_accu_coeff_33h 4.37957744519422778606276835944299818947911262512207031250000000000000000000000000e-03 #define p0_accu_coeff_35h 3.08318270558301894476715965254243201343342661857604980468750000000000000000000000e-03 #define p0_accu_coeff_37h 6.23791382502981474333925149267088272608816623687744140625000000000000000000000000e-03 #define p_accu_coeff_0h asinPolyAccuMiddleTbl[32 * index + 0] #define p_accu_coeff_0m asinPolyAccuMiddleTbl[32 * index + 1] #define p_accu_coeff_1h asinPolyAccuMiddleTbl[32 * index + 2] #define p_accu_coeff_1m asinPolyAccuMiddleTbl[32 * index + 3] #define p_accu_coeff_2h asinPolyAccuMiddleTbl[32 * index + 4] #define p_accu_coeff_2m asinPolyAccuMiddleTbl[32 * index + 5] #define p_accu_coeff_3h asinPolyAccuMiddleTbl[32 * index + 6] #define p_accu_coeff_3m asinPolyAccuMiddleTbl[32 * index + 7] #define p_accu_coeff_4h asinPolyAccuMiddleTbl[32 * index + 8] #define p_accu_coeff_4m asinPolyAccuMiddleTbl[32 * index + 9] #define p_accu_coeff_5h asinPolyAccuMiddleTbl[32 * index + 10] #define p_accu_coeff_5m asinPolyAccuMiddleTbl[32 * index + 11] #define p_accu_coeff_6h asinPolyAccuMiddleTbl[32 * index + 12] #define p_accu_coeff_6m asinPolyAccuMiddleTbl[32 * index + 13] #define p_accu_coeff_7h asinPolyAccuMiddleTbl[32 * index + 14] #define p_accu_coeff_7m asinPolyAccuMiddleTbl[32 * index + 15] #define p_accu_coeff_8h asinPolyAccuMiddleTbl[32 * index + 16] #define p_accu_coeff_8m asinPolyAccuMiddleTbl[32 * index + 17] #define p_accu_coeff_9h asinPolyAccuMiddleTbl[32 * index + 18] #define p_accu_coeff_10h asinPolyAccuMiddleTbl[32 * index + 19] #define p_accu_coeff_11h asinPolyAccuMiddleTbl[32 * index + 20] #define p_accu_coeff_12h asinPolyAccuMiddleTbl[32 * index + 21] #define p_accu_coeff_13h asinPolyAccuMiddleTbl[32 * index + 22] #define p_accu_coeff_14h asinPolyAccuMiddleTbl[32 * index + 23] #define p_accu_coeff_15h asinPolyAccuMiddleTbl[32 * index + 24] #define p_accu_coeff_16h asinPolyAccuMiddleTbl[32 * index + 25] #define p_accu_coeff_17h asinPolyAccuMiddleTbl[32 * index + 26] #define p_accu_coeff_18h asinPolyAccuMiddleTbl[32 * index + 27] #define p_accu_coeff_19h asinPolyAccuMiddleTbl[32 * index + 28] #define p_accu_coeff_20h asinPolyAccuMiddleTbl[32 * index + 29] #define p_accu_coeff_21h asinPolyAccuMiddleTbl[32 * index + 30] #define p_accu_coeff_22h asinPolyAccuMiddleTbl[32 * index + 31] #define p9_accu_coeff_0h 1.01072102056824553173441927356179803609848022460937500000000000000000000000000000e+00 #define p9_accu_coeff_0m 1.39129934510313097947345056199237890632902839379463674068793110905062349047511816e-20 #define p9_accu_coeff_1h -8.82981536812866424357437722392205614596605300903320312500000000000000000000000000e-02 #define p9_accu_coeff_1m 2.41792724167186006978828150786347532734726726246399404474107797113902051933109760e-18 #define p9_accu_coeff_2h 2.10353760393441266418612656252662418410181999206542968750000000000000000000000000e-02 #define p9_accu_coeff_2m 1.08336737333055412851633739558643005025128690376628494418387305131545872427523136e-18 #define p9_accu_coeff_3h -6.65063923820143239329372164547748980112373828887939453125000000000000000000000000e-03 #define p9_accu_coeff_3m -3.26520170221686406454105223534078119197675928213141878161951403569673857418820262e-19 #define p9_accu_coeff_4h 2.40768516606927433787443959545271354727447032928466796875000000000000000000000000e-03 #define p9_accu_coeff_4m -1.97265146971483602383336920707508202998297784121844945705998020102356349525507540e-19 #define p9_accu_coeff_5h -9.43873142126153748948658162021274620201438665390014648437500000000000000000000000e-04 #define p9_accu_coeff_5m -1.00627526920533400945274389592272919368733418903938436114037235924456581415142864e-20 #define p9_accu_coeff_6h 3.89946159535203471478703729502512942417524755001068115234375000000000000000000000e-04 #define p9_accu_coeff_6m -1.68716106145871574328060887792714981312318371720271803146373734705321112414821982e-21 #define p9_accu_coeff_7h -1.67200258171404256496775375673280450428137555718421936035156250000000000000000000e-04 #define p9_accu_coeff_7m 1.19784970040097203700724589956273625590162416200800595011445592863452702658833005e-20 #define p9_accu_coeff_8h 7.37067653300902520495385683574340873747132718563079833984375000000000000000000000e-05 #define p9_accu_coeff_9h -3.31971960015731878111157338029357788400375284254550933837890625000000000000000000e-05 #define p9_accu_coeff_10h 1.52100265651915579552836896293221968790021492168307304382324218750000000000000000e-05 #define p9_accu_coeff_11h -7.06684216556374468498364499469133193088055122643709182739257812500000000000000000e-06 #define p9_accu_coeff_12h 3.32174016771150049044582924784307920162973459810018539428710937500000000000000000e-06 #define p9_accu_coeff_13h -1.57676504579047108034364592377141178758392925374209880828857421875000000000000000e-06 #define p9_accu_coeff_14h 7.54770805302124936124669781628560016883966454770416021347045898437500000000000000e-07 #define p9_accu_coeff_15h -3.63931772276869473623270951831432107326236291555687785148620605468750000000000000e-07 #define p9_accu_coeff_16h 1.76596931693785619791949872102454488498324280953966081142425537109375000000000000e-07 #define p9_accu_coeff_17h -8.61593313016896376739609539688324879591618810081854462623596191406250000000000000e-08 #define p9_accu_coeff_18h 4.22538400682347749169000988064132107169257324130740016698837280273437500000000000e-08 #define p9_accu_coeff_19h -2.12414533709850257115170054159070112120843987213447690010070800781250000000000000e-08 #define p9_accu_coeff_20h 1.04941939883081181921218176284101020190320241454173810780048370361328125000000000e-08 static const double asinPolyQuickMiddleTbl[128] = { 0.30177669529663886383019644199521280825138092041015625, // mi_1 3.06555683602418194144689778113388456404209136962890625000000000000000000000000000e-01, // p_coeff_0h 1.37864228855288786229514205458277346294726855883500333047053665325165638932958245e-19, // p_coeff_0m 1.04890120337530645677759366662940010428428649902343750000000000000000000000000000e+00, // p_coeff_1h -1.03997489957388085277493589447823941146606896923035995294881672634801361709833145e-16, // p_coeff_1m 1.74124328129031780143520791170885786414146423339843750000000000000000000000000000e-01, // p_coeff_2h 2.50143932843980842939402009506011381745338439941406250000000000000000000000000000e-01, // p_coeff_3h 1.67670575222466200493443011509953066706657409667968750000000000000000000000000000e-01, // p_coeff_4h 2.01779349315375722273557812513899989426136016845703125000000000000000000000000000e-01, // p_coeff_5h 1.98874061108935212827120153633586596697568893432617187500000000000000000000000000e-01, // p_coeff_6h 2.35900184842710441968094414733059238642454147338867187500000000000000000000000000e-01, // p_coeff_7h 2.67930172148400869147621961019467562437057495117187500000000000000000000000000000e-01, // p_coeff_8h 3.24866122351198272077965611970284953713417053222656250000000000000000000000000000e-01, // p_coeff_9h 3.92983759990528369598905555903911590576171875000000000000000000000000000000000000e-01, // p_coeff_10h 4.95395034513885057503301823089714162051677703857421875000000000000000000000000000e-01, // p_coeff_11h 6.17581482281306048953695153613807633519172668457031250000000000000000000000000000e-01, // p_coeff_12h 0.393283046242751843646345832894439809024333953857421875, // mi_2 4.04199666960039116769820566332782618701457977294921875000000000000000000000000000e-01, // p_coeff_0h -7.29414577305862355348006038497258990002592122212580672446953500287492033749003895e-21, // p_coeff_0m 1.08764522696446319649510314775398001074790954589843750000000000000000000000000000e+00, // p_coeff_1h 7.18002807945845121967809924279486007735232949667977808694274699519155547022819519e-17, // p_coeff_1m 2.53009602569167157959384439891437068581581115722656250000000000000000000000000000e-01, // p_coeff_2h 3.32153251441154206968775497443857602775096893310546875000000000000000000000000000e-01, // p_coeff_3h 2.92932692232720115477206945797661319375038146972656250000000000000000000000000000e-01, // p_coeff_4h 3.67616411036137902268450261544785462319850921630859375000000000000000000000000000e-01, // p_coeff_5h 4.41363028117747802081538566199014894664287567138671875000000000000000000000000000e-01, // p_coeff_6h 5.81535898184487698436839764326578006148338317871093750000000000000000000000000000e-01, // p_coeff_7h 7.75300865782017067928677533927839249372482299804687500000000000000000000000000000e-01, // p_coeff_8h 1.06930850499925678143142704357160255312919616699218750000000000000000000000000000e+00, // p_coeff_9h 1.49812947255186612594002326659392565488815307617187500000000000000000000000000000e+00, // p_coeff_10h 2.15844993342769164712535712169483304023742675781250000000000000000000000000000000e+00, // p_coeff_11h 3.06928679300128992579743680835235863924026489257812500000000000000000000000000000e+00, // p_coeff_12h 0.466506350946100212251366201599012129008769989013671875, // mi_3 4.85336867180323261461438733022077940404415130615234375000000000000000000000000000e-01, // p_coeff_0h 2.48687685471405101032185714779683260767432502103446885499682394993214984424412251e-18, // p_coeff_0m 1.13055943592368102201817237073555588722229003906250000000000000000000000000000000e+00, // p_coeff_1h 8.31884808460703843039094509953103826114589262451931572783792034897487610578536987e-17, // p_coeff_1m 3.37060423475326498277127029723487794399261474609375000000000000000000000000000000e-01, // p_coeff_2h 4.41819848339723264540879199557821266353130340576171875000000000000000000000000000e-01, // p_coeff_3h 4.72912200341658373048403518623672425746917724609375000000000000000000000000000000e-01, // p_coeff_4h 6.48901300732837138518505071260733529925346374511718750000000000000000000000000000e-01, // p_coeff_5h 9.02760918994661598624418274994241073727607727050781250000000000000000000000000000e-01, // p_coeff_6h 1.33957799576799718721531462506391108036041259765625000000000000000000000000000000e+00, // p_coeff_7h 2.03975089767692541187216193065978586673736572265625000000000000000000000000000000e+00, // p_coeff_8h 3.19221018967622649498139253410045057535171508789062500000000000000000000000000000e+00, // p_coeff_9h 5.09007693218536960699793780804611742496490478515625000000000000000000000000000000e+00, // p_coeff_10h 8.32900562875201266876956651685759425163269042968750000000000000000000000000000000e+00, // p_coeff_11h 1.35684931403507018643495030119083821773529052734375000000000000000000000000000000e+01, // p_coeff_12h 0.52950849718750470085382175966515205800533294677734375, // mi_4 5.58021066268902909968119274708442389965057373046875000000000000000000000000000000e-01, // p_coeff_0h 9.12034392087434999453497016043152989309974709890359127750780743326686206273734570e-20, // p_coeff_0m 1.17882180572684136521388609253335744142532348632812500000000000000000000000000000e+00, // p_coeff_1h 2.42941652280796864299660766500640409154688815034626482580737416583360754884779453e-18, // p_coeff_1m 4.33698001053000381510571514809271320700645446777343750000000000000000000000000000e-01, // p_coeff_2h 5.92141175601994751431789154594298452138900756835937500000000000000000000000000000e-01, // p_coeff_3h 7.45525652675174788086565058620180934667587280273437500000000000000000000000000000e-01, // p_coeff_4h 1.13828091051635160724231354834046214818954467773437500000000000000000000000000000e+00, // p_coeff_5h 1.80888030356391027453355491161346435546875000000000000000000000000000000000000000e+00, // p_coeff_6h 3.03311161272506835118178969423752278089523315429687500000000000000000000000000000e+00, // p_coeff_7h 5.24261669742490976631188459577970206737518310546875000000000000000000000000000000e+00, // p_coeff_8h 9.29745896553562900521683332044631242752075195312500000000000000000000000000000000e+00, // p_coeff_9h 1.68115356121078072249019896844401955604553222656250000000000000000000000000000000e+01, // p_coeff_10h 3.11875660002322234731764183379709720611572265625000000000000000000000000000000000e+01, // p_coeff_11h 5.76621480399203818478781613521277904510498046875000000000000000000000000000000000e+01, // p_coeff_12h 0.58569471503532011258386091867578215897083282470703125, // mi_5 6.25736902820868912122875826753443107008934020996093750000000000000000000000000000e-01, // p_coeff_0h 1.09771341515678393197247834713042073087550408801910172083143857335585380496922880e-20, // p_coeff_0m 1.23375797792237640315704538807040080428123474121093750000000000000000000000000000e+00, // p_coeff_1h -1.59140559577392273960428308971385735880640476257478696520131222769123269245028496e-17, // p_coeff_1m 5.49960162399266483390647408668883144855499267578125000000000000000000000000000000e-01, // p_coeff_2h 8.03296584298027416259913024987326934933662414550781250000000000000000000000000000e-01, // p_coeff_3h 1.17423627321739276752055047836620360612869262695312500000000000000000000000000000e+00, // p_coeff_4h 2.01583293591475243289323771023191511631011962890625000000000000000000000000000000e+00, // p_coeff_5h 3.64900021733109003463368935626931488513946533203125000000000000000000000000000000e+00, // p_coeff_6h 6.93854486506604661855135418591089546680450439453125000000000000000000000000000000e+00, // p_coeff_7h 1.36226794507666699729497850057668983936309814453125000000000000000000000000000000e+01, // p_coeff_8h 2.74281125080204652988413727143779397010803222656250000000000000000000000000000000e+01, // p_coeff_9h 5.63049247624184658889134880155324935913085937500000000000000000000000000000000000e+01, // p_coeff_10h 1.18700353964991606403600599151104688644409179687500000000000000000000000000000000e+02, // p_coeff_11h 2.55076107485252919104823376983404159545898437500000000000000000000000000000000000e+02, // p_coeff_12h 0.636905131730956863833625902771018445491790771484375, // mi_6 6.90477178468776764397318856936180964112281799316406250000000000000000000000000000e-01, // p_coeff_0h 3.39469506786599975391257859730058491397981612722623695477253136232320684939622879e-18, // p_coeff_0m 1.29711412734153253012436834978871047496795654296875000000000000000000000000000000e+00, // p_coeff_1h -4.95712225725049321877947559927504147795821978121980078135777603165479376912117004e-17, // p_coeff_1m 6.94991224248453054457286270917393267154693603515625000000000000000000000000000000e-01, // p_coeff_2h 1.10848340356457941702217340207425877451896667480468750000000000000000000000000000e+00, // p_coeff_3h 1.87458354117332537391860114439623430371284484863281250000000000000000000000000000e+00, // p_coeff_4h 3.65157801390048675216348783578723669052124023437500000000000000000000000000000000e+00, // p_coeff_5h 7.55165652847091450894367881119251251220703125000000000000000000000000000000000000e+00, // p_coeff_6h 1.63735362549250531571942701702937483787536621093750000000000000000000000000000000e+01, // p_coeff_7h 3.66799061204043113093575811944901943206787109375000000000000000000000000000000000e+01, // p_coeff_8h 8.42542910813925374213795294053852558135986328125000000000000000000000000000000000e+01, // p_coeff_9h 1.97368592013039233279414474964141845703125000000000000000000000000000000000000000e+02, // p_coeff_10h 4.75165552896886765665840357542037963867187500000000000000000000000000000000000000e+02, // p_coeff_11h 1.14668095983602756859909277409315109252929687500000000000000000000000000000000000e+03, // p_coeff_12h 0.68427230447631171017519591259770095348358154296875, // mi_7 7.53605330605588874526290510402759537100791931152343750000000000000000000000000000e-01, // p_coeff_0h -6.81399026788433814240085924387948818667013384621768622671778015131849315366707742e-20, // p_coeff_0m 1.37131588394733516800272354885237291455268859863281250000000000000000000000000000e+00, // p_coeff_1h 5.75522635997281408409017033924079017806689197384387157718776961701223626732826233e-17, // p_coeff_1m 8.82290262843787198576706032326910644769668579101562500000000000000000000000000000e-01, // p_coeff_2h 1.56510752146510800919543271447764709591865539550781250000000000000000000000000000e+00, // p_coeff_3h 3.07048550645086359978108703217003494501113891601562500000000000000000000000000000e+00, // p_coeff_4h 6.85588913497096008597964100772514939308166503906250000000000000000000000000000000e+00, // p_coeff_5h 1.63125257116160859993669873801991343498229980468750000000000000000000000000000000e+01, // p_coeff_6h 4.06593958002900990322814323008060455322265625000000000000000000000000000000000000e+01, // p_coeff_7h 1.04739642911711854367240448482334613800048828125000000000000000000000000000000000e+02, // p_coeff_8h 2.76645653402371124229830456897616386413574218750000000000000000000000000000000000e+02, // p_coeff_9h 7.45184231247284060373203828930854797363281250000000000000000000000000000000000000e+02, // p_coeff_10h 2.06663648786018939063069410622119903564453125000000000000000000000000000000000000e+03, // p_coeff_11h 5.75344088930418638483388349413871765136718750000000000000000000000000000000000000e+03, // p_coeff_12h 0.7285533905932444209696541292942129075527191162109375, // mi_8 8.16207699480864135033186812506755813956260681152343750000000000000000000000000000e-01, // p_coeff_0h 1.13998759014226814082709277093003596330685011160153518976201336698750310461036861e-20, // p_coeff_0m 1.45987741598546749699494284868706017732620239257812500000000000000000000000000000e+00, // p_coeff_1h 1.00585284375539824516783136958955684505754068277117579954804682529356796294450760e-16, // p_coeff_1m 1.13339308477403566399743795045651495456695556640625000000000000000000000000000000e+00, // p_coeff_2h 2.27840492593358323603069948148913681507110595703125000000000000000000000000000000e+00, // p_coeff_3h 5.22734481752265178755578745040111243724822998046875000000000000000000000000000000e+00, // p_coeff_4h 1.35483951828855158083797505241818726062774658203125000000000000000000000000000000e+01, // p_coeff_5h 3.74970966332361186346133763436228036880493164062500000000000000000000000000000000e+01, // p_coeff_6h 1.08680173096203162685924326069653034210205078125000000000000000000000000000000000e+02, // p_coeff_7h 3.25593435218005822662235004827380180358886718750000000000000000000000000000000000e+02, // p_coeff_8h 1.00013553235534163832198828458786010742187500000000000000000000000000000000000000e+03, // p_coeff_9h 3.13330209627358499346883036196231842041015625000000000000000000000000000000000000e+03, // p_coeff_10h 1.01324957719780304614687338471412658691406250000000000000000000000000000000000000e+04, // p_coeff_11h 3.27393534650766232516616582870483398437500000000000000000000000000000000000000000e+04 // p_coeff_12h }; static const double asinPolyAccuMiddleTbl[258] = { 3.06555683602418194144689778113388456404209136962890625000000000000000000000000000e-01, // p_coeff_0h 1.38398751617026410180086928097698669616246328887899420551771401122209681489039212e-19, // p_coeff_0m 1.04890120337530645677759366662940010428428649902343750000000000000000000000000000e+00, // p_coeff_1h -1.03082627287649058162739898016810705246384011505786371110104937542928382754325867e-16, // p_coeff_1m 1.74124328129031780143520791170885786414146423339843750000000000000000000000000000e-01, // p_coeff_2h -1.22415542219236523063144722572481689558635471916500300770813680628634756430983543e-17, // p_coeff_2m 2.50143932843971239510239001901936717331409454345703125000000000000000000000000000e-01, // p_coeff_3h -4.13151149720064821141736364751386140320745355927365902171111144980386598035693169e-18, // p_coeff_3m 1.67670575222510526147701170884829480201005935668945312500000000000000000000000000e-01, // p_coeff_4h 9.08471320692536034881317437634606200189439625594786317797080243963137036189436913e-18, // p_coeff_4m 2.01779349344123004605933147104224190115928649902343750000000000000000000000000000e-01, // p_coeff_5h -2.81327768912778086871203966934740276353563377312707108335310124402894871309399605e-18, // p_coeff_5m 1.98874061057130652185875874238263349980115890502929687500000000000000000000000000e-01, // p_coeff_6h 4.84208641776008377910230190635861197948724910162295737015014651660749223083257675e-18, // p_coeff_6m 2.35900148032034129297329627661383710801601409912109375000000000000000000000000000e-01, // p_coeff_7h -7.70265627820459694705350308676046582995139915634938421185040624550310894846916199e-18, // p_coeff_7m 2.67930188076546671460675952403107658028602600097656250000000000000000000000000000e-01, // p_coeff_8h -1.74203278137786025999080009256505191287370077696727496685547009747097035869956017e-17, // p_coeff_8m 3.24889007694808218396076426870422437787055969238281250000000000000000000000000000e-01, // p_coeff_9h 3.92992300726306809099952488395501859486103057861328125000000000000000000000000000e-01, // p_coeff_10h 4.88578374389609604300233058893354609608650207519531250000000000000000000000000000e-01, // p_coeff_11h 6.11426267619878727188620359811466187238693237304687500000000000000000000000000000e-01, // p_coeff_12h 7.76087253732093085289989176089875400066375732421875000000000000000000000000000000e-01, // p_coeff_13h 9.92362795771243533238248346606269478797912597656250000000000000000000000000000000e-01, // p_coeff_14h 1.28020190849177639691447438963223248720169067382812500000000000000000000000000000e+00, // p_coeff_15h 1.66202082783864191206646410137182101607322692871093750000000000000000000000000000e+00, // p_coeff_16h 2.17134697355479078240136914246249943971633911132812500000000000000000000000000000e+00, // p_coeff_17h 2.85144941725608758176235824066679924726486206054687500000000000000000000000000000e+00, // p_coeff_18h 3.76113082197504100534501958463806658983230590820312500000000000000000000000000000e+00, // p_coeff_19h 4.98320258065187005058760405518114566802978515625000000000000000000000000000000000e+00, // p_coeff_20h 6.83567147351494863727339179604314267635345458984375000000000000000000000000000000e+00, // p_coeff_21h 9.17671174961649249723905086284503340721130371093750000000000000000000000000000000e+00, // p_coeff_22h 4.04199666960039116769820566332782618701457977294921875000000000000000000000000000e-01, // p_coeff_0h -6.46825370068901234687011200856515476665908008275043725957432344531028434175823350e-21, // p_coeff_0m 1.08764522696446319649510314775398001074790954589843750000000000000000000000000000e+00, // p_coeff_1h 7.20122509204450857334003577729908463703780203035882678808121681868215091526508331e-17, // p_coeff_1m 2.53009602569167157959384439891437068581581115722656250000000000000000000000000000e-01, // p_coeff_2h -2.62855515233500204494953653812414612827096270443634484781370019845780916512012482e-17, // p_coeff_2m 3.32153251441150376699340540653793141245841979980468750000000000000000000000000000e-01, // p_coeff_3h -2.17141385535786665092496720426544052591009587195721927677105611564911669120192528e-17, // p_coeff_3m 2.92932692232876656923679092869861051440238952636718750000000000000000000000000000e-01, // p_coeff_4h -2.54506532782342113657805222827712812531223364242776927013345300565561046823859215e-17, // p_coeff_4m 3.67616411055874059421455513074761256575584411621093750000000000000000000000000000e-01, // p_coeff_5h -6.76970835849273256879417289105284614692988316998734608931354017613557516597211361e-18, // p_coeff_5m 4.41363027759851866971274603201891295611858367919921875000000000000000000000000000e-01, // p_coeff_6h -2.90651996480231385490406350336172813253854649135862232844917940610685036517679691e-18, // p_coeff_6m 5.81535855061384165942683921457501128315925598144531250000000000000000000000000000e-01, // p_coeff_7h 2.15506151894707480118506866417280461854749969158187919426872269923478597775101662e-17, // p_coeff_7m 7.75301235143548206352193119528237730264663696289062500000000000000000000000000000e-01, // p_coeff_8h -5.09980429509694427469186543286592667631136122693286116813737862685229629278182983e-17, // p_coeff_8m 1.06935418322891551135001009242841973900794982910156250000000000000000000000000000e+00, // p_coeff_9h 1.49796852292175275422891900234390050172805786132812500000000000000000000000000000e+00, // p_coeff_10h 2.13528146071462776589555687678512185811996459960937500000000000000000000000000000e+00, // p_coeff_11h 3.08095882478763538614430217421613633632659912109375000000000000000000000000000000e+00, // p_coeff_12h 4.49525762116327154416239864076487720012664794921875000000000000000000000000000000e+00, // p_coeff_13h 6.61832853156151212914437564904801547527313232421875000000000000000000000000000000e+00, // p_coeff_14h 9.82196882969892293147040618350729346275329589843750000000000000000000000000000000e+00, // p_coeff_15h 1.46763291696545170594845330924727022647857666015625000000000000000000000000000000e+01, // p_coeff_16h 2.20625545956168913619421800831332802772521972656250000000000000000000000000000000e+01, // p_coeff_17h 3.33428595472074320582578366156667470932006835937500000000000000000000000000000000e+01, // p_coeff_18h 5.06298287402715487814930384047329425811767578125000000000000000000000000000000000e+01, // p_coeff_19h 7.72361044088683854624832747504115104675292968750000000000000000000000000000000000e+01, // p_coeff_20h 1.19605340680796203400859667453914880752563476562500000000000000000000000000000000e+02, // p_coeff_21h 1.80182167313889749493682757019996643066406250000000000000000000000000000000000000e+02, // p_coeff_22h 4.85336867180323261461438733022077940404415130615234375000000000000000000000000000e-01, // p_coeff_0h 2.48711731548431450339898686061161136444646421020973452165048200868113781325519085e-18, // p_coeff_0m 1.13055943592368102201817237073555588722229003906250000000000000000000000000000000e+00, // p_coeff_1h 8.33253077521152707672020411779329031688034814541986283753516318029141984879970551e-17, // p_coeff_1m 3.37060423475326498277127029723487794399261474609375000000000000000000000000000000e-01, // p_coeff_2h -1.06567668725757610844479862637418971752325776427227331522029629695680341683328152e-17, // p_coeff_2m 4.41819848339719767338351630314718931913375854492187500000000000000000000000000000e-01, // p_coeff_3h 1.00442163349492148002936541754087371062381994416120786772772532913222676143050194e-17, // p_coeff_3m 4.72912200341745858622743980959057807922363281250000000000000000000000000000000000e-01, // p_coeff_4h 4.32579192702017095690398912101462577298397752038590716172627992364141391590237617e-18, // p_coeff_4m 6.48901300757961929654982213833136484026908874511718750000000000000000000000000000e-01, // p_coeff_5h 5.53173550473638312502352924376368778723557407693469517573348070982319768518209457e-17, // p_coeff_5m 9.02760918723618410730580308154458180069923400878906250000000000000000000000000000e-01, // p_coeff_6h 1.83127184204758972652773042458306136013081307308989972848500826785311801359057426e-17, // p_coeff_6m 1.33957791852745100591448590421350672841072082519531250000000000000000000000000000e+00, // p_coeff_7h -8.08660441258249393782142982707336982340679568071958871477988850529072806239128113e-17, // p_coeff_7m 2.03975126091931757699171612330246716737747192382812500000000000000000000000000000e+00, // p_coeff_8h 1.39326386720348649025304457272644525059897659732127683795965822355356067419052124e-16, // p_coeff_8m 3.19232532691492343346340021525975316762924194335937500000000000000000000000000000e+00, // p_coeff_9h 5.08990447700057480062696413369849324226379394531250000000000000000000000000000000e+00, // p_coeff_10h 8.24681325581985547046315332408994436264038085937500000000000000000000000000000000e+00, // p_coeff_11h 1.35339383861901847438957702252082526683807373046875000000000000000000000000000000e+01, // p_coeff_12h 2.24533939052931295066173333907499909400939941406250000000000000000000000000000000e+01, // p_coeff_13h 3.75945346965856899146274372469633817672729492187500000000000000000000000000000000e+01, // p_coeff_14h 6.34457878603441614018265681806951761245727539062500000000000000000000000000000000e+01, // p_coeff_15h 1.07811054823829493898301734589040279388427734375000000000000000000000000000000000e+02, // p_coeff_16h 1.84306463662936579339657328091561794281005859375000000000000000000000000000000000e+02, // p_coeff_17h 3.16759786376428792209480889141559600830078125000000000000000000000000000000000000e+02, // p_coeff_18h 5.47025706678748861122585367411375045776367187500000000000000000000000000000000000e+02, // p_coeff_19h 9.49215135261129944410640746355056762695312500000000000000000000000000000000000000e+02, // p_coeff_20h 1.66325303120893772756971884518861770629882812500000000000000000000000000000000000e+03, // p_coeff_21h 2.81005886721817250872845761477947235107421875000000000000000000000000000000000000e+03, // p_coeff_22h 5.58021066268902909968119274708442389965057373046875000000000000000000000000000000e-01, // p_coeff_0h 9.14056635248981946291334736807400951779846267656755277007663007537985322414897382e-20, // p_coeff_0m 1.17882180572684136521388609253335744142532348632812500000000000000000000000000000e+00, // p_coeff_1h 2.57506761959083747975269601591872190204330911429892510960959484123122820165008307e-18, // p_coeff_1m 4.33698001053000381510571514809271320700645446777343750000000000000000000000000000e-01, // p_coeff_2h -1.13987489167043526825762332057111190978471845558278249810335580605169525370001793e-17, // p_coeff_2m 5.92141175601989977472783266421174630522727966308593750000000000000000000000000000e-01, // p_coeff_3h 1.51434599074934130528344780896022003291074232766760462864930047999223461374640465e-17, // p_coeff_3m 7.45525652675293803994804875401314347982406616210937500000000000000000000000000000e-01, // p_coeff_4h -4.95666529120828261720386639182573717908098482969568576717023233868530951440334320e-17, // p_coeff_4m 1.13828091056041680317889586149249225854873657226562500000000000000000000000000000e+00, // p_coeff_5h 6.30476130024642952826684347359752494928069360322596403900519135277136228978633881e-17, // p_coeff_5m 1.80888030309746783430568939365912228822708129882812500000000000000000000000000000e+00, // p_coeff_6h 6.53471855925770582546264336577217040248932212759963578108113324560690671205520630e-17, // p_coeff_6m 3.03311143845375674743536364985629916191101074218750000000000000000000000000000000e+00, // p_coeff_7h -2.14585117370534459252749227343052173552538040022033549725222201232099905610084534e-16, // p_coeff_7m 5.24261747644370590393236852833069860935211181640625000000000000000000000000000000e+00, // p_coeff_8h -5.46512862978737750269761176067830595023185492192796530730447557289153337478637695e-17, // p_coeff_8m 9.29779331096978367554584110621362924575805664062500000000000000000000000000000000e+00, // p_coeff_9h 1.68111140106672962701850337907671928405761718750000000000000000000000000000000000e+01, // p_coeff_10h 3.08802874723923395094971056096255779266357421875000000000000000000000000000000000e+01, // p_coeff_11h 5.74616531317601229034153220709413290023803710937500000000000000000000000000000000e+01, // p_coeff_12h 1.08089434897446437844337197020649909973144531250000000000000000000000000000000000e+02, // p_coeff_13h 2.05202846011656902192044071853160858154296875000000000000000000000000000000000000e+02, // p_coeff_14h 3.92662709897826516680652275681495666503906250000000000000000000000000000000000000e+02, // p_coeff_15h 7.56557048606022931380721274763345718383789062500000000000000000000000000000000000e+02, // p_coeff_16h 1.46649727257876816111092921346426010131835937500000000000000000000000000000000000e+03, // p_coeff_17h 2.85782276299161503629875369369983673095703125000000000000000000000000000000000000e+03, // p_coeff_18h 5.59751274793538505036849528551101684570312500000000000000000000000000000000000000e+03, // p_coeff_19h 1.10145801644146959006320685148239135742187500000000000000000000000000000000000000e+04, // p_coeff_20h 2.15676400725272833369672298431396484375000000000000000000000000000000000000000000e+04, // p_coeff_21h 4.10662669419021476642228662967681884765625000000000000000000000000000000000000000e+04, // p_coeff_22h 6.25736902820868912122875826753443107008934020996093750000000000000000000000000000e-01, // p_coeff_0h 1.03044861946200352361105560063972534424839340803290894401332555840866689322865568e-20, // p_coeff_0m 1.23375797792237640315704538807040080428123474121093750000000000000000000000000000e+00, // p_coeff_1h -1.56943153280384722085732805658465945105123195556662968330741136924189049750566483e-17, // p_coeff_1m 5.49960162399266483390647408668883144855499267578125000000000000000000000000000000e-01, // p_coeff_2h 4.77724544586887245869366226653936105958167895554379589473370515406713820993900299e-17, // p_coeff_2m 8.03296584298018756520320948766311630606651306152343750000000000000000000000000000e-01, // p_coeff_3h 8.24298592592304193429233278946371287822415169276122487440616737330856267362833023e-18, // p_coeff_3m 1.17423627321674173273891028657089918851852416992187500000000000000000000000000000e+00, // p_coeff_4h 6.51885136427795249608596859127055587343811181939758764292136561380175407975912094e-18, // p_coeff_4m 2.01583293601212298895575258939061313867568969726562500000000000000000000000000000e+00, // p_coeff_5h -1.74898605368430358273924263609101302050140983100449953990818130478146485984325409e-16, // p_coeff_5m 3.64900022085783248826373892370611429214477539062500000000000000000000000000000000e+00, // p_coeff_6h 1.43304714197470670030886399120078425706334125872346008101487768726656213402748108e-16, // p_coeff_6m 6.93854439566079062018388867727480828762054443359375000000000000000000000000000000e+00, // p_coeff_7h -3.60750117305009285790273957823616258349535174413877380850124154676450416445732117e-16, // p_coeff_7m 1.36226702672788579917551032849587500095367431640625000000000000000000000000000000e+01, // p_coeff_8h 5.62980642478103599614115253967152086402971956392848884576096679666079580783843994e-16, // p_coeff_8m 2.74292117002245703361040796153247356414794921875000000000000000000000000000000000e+01, // p_coeff_9h 5.63167951919359666135278530418872833251953125000000000000000000000000000000000000e+01, // p_coeff_10h 1.17466533739617389642262423876672983169555664062500000000000000000000000000000000e+02, // p_coeff_11h 2.48208400271530678082854137755930423736572265625000000000000000000000000000000000e+02, // p_coeff_12h 5.30187120971580611694662366062402725219726562500000000000000000000000000000000000e+02, // p_coeff_13h 1.14298685390676246242946945130825042724609375000000000000000000000000000000000000e+03, // p_coeff_14h 2.48365898527212812041398137807846069335937500000000000000000000000000000000000000e+03, // p_coeff_15h 5.43413912381613681645831093192100524902343750000000000000000000000000000000000000e+03, // p_coeff_16h 1.19616511180501001945231109857559204101562500000000000000000000000000000000000000e+04, // p_coeff_17h 2.64708277570606114750262349843978881835937500000000000000000000000000000000000000e+04, // p_coeff_18h 5.88376889385143513209186494350433349609375000000000000000000000000000000000000000e+04, // p_coeff_19h 1.31386216977166535798460245132446289062500000000000000000000000000000000000000000e+05, // p_coeff_20h 3.03303368112601048778742551803588867187500000000000000000000000000000000000000000e+05, // p_coeff_21h 6.82215743360355845652520656585693359375000000000000000000000000000000000000000000e+05, // p_coeff_22h 6.90477178468776764397318856936180964112281799316406250000000000000000000000000000e-01, // p_coeff_0h 3.39466231816613032388245073452427079551490712938188829689289960356290976051241159e-18, // p_coeff_0m 1.29711412734153253012436834978871047496795654296875000000000000000000000000000000e+00, // p_coeff_1h -4.91536443957924304285159601199758593586250555616465329755726543226046487689018250e-17, // p_coeff_1m 6.94991224248453054457286270917393267154693603515625000000000000000000000000000000e-01, // p_coeff_2h 4.14055567174545404801311585696815622965502227300336503257316422832445823587477207e-18, // p_coeff_2m 1.10848340356455987709693999931914731860160827636718750000000000000000000000000000e+00, // p_coeff_3h 4.16266958244922006708243033738862584564114206709881105261672473716316744685173035e-17, // p_coeff_3m 1.87458354117322345544494055502582341432571411132812500000000000000000000000000000e+00, // p_coeff_4h 1.01371418047977543599188915056692109774560397669751488081146817421540617942810059e-16, // p_coeff_4m 3.65157801416010441286630339163821190595626831054687500000000000000000000000000000e+00, // p_coeff_5h 1.26536476346012852031977695308463633490816727090143289924384362166165374219417572e-16, // p_coeff_5m 7.55165652946598697781155351549386978149414062500000000000000000000000000000000000e+00, // p_coeff_6h -2.14190464475496048348382959343551268818198527301224776131505223020212724804878235e-16, // p_coeff_6m 1.63735347750204702776954945875331759452819824218750000000000000000000000000000000e+01, // p_coeff_7h 1.51055732062479748503833695277300766424363764363347772956558401347137987613677979e-15, // p_coeff_7m 3.66799013891310394797073968220502138137817382812500000000000000000000000000000000e+01, // p_coeff_8h -1.96467879903428952233615671924270070336884016354295212636316136922687292098999023e-15, // p_coeff_8m 8.42583880764557306974893435835838317871093750000000000000000000000000000000000000e+01, // p_coeff_9h 1.97380229224487067085647140629589557647705078125000000000000000000000000000000000e+02, // p_coeff_10h 4.69729422521515630251087713986635208129882812500000000000000000000000000000000000e+02, // p_coeff_11h 1.13246616901346669692429713904857635498046875000000000000000000000000000000000000e+03, // p_coeff_12h 2.76004978747814584494335576891899108886718750000000000000000000000000000000000000e+03, // p_coeff_13h 6.78908667818280082428827881813049316406250000000000000000000000000000000000000000e+03, // p_coeff_14h 1.68324374222143451333977282047271728515625000000000000000000000000000000000000000e+04, // p_coeff_15h 4.20216193300401428132317960262298583984375000000000000000000000000000000000000000e+04, // p_coeff_16h 1.05540980227414402179419994354248046875000000000000000000000000000000000000000000e+05, // p_coeff_17h 2.66494483142128563486039638519287109375000000000000000000000000000000000000000000e+05, // p_coeff_18h 6.76009364551451755687594413757324218750000000000000000000000000000000000000000000e+05, // p_coeff_19h 1.72216034198046685196459293365478515625000000000000000000000000000000000000000000e+06, // p_coeff_20h 4.49188704440361727029085159301757812500000000000000000000000000000000000000000000e+06, // p_coeff_21h 1.15993861480669919401407241821289062500000000000000000000000000000000000000000000e+07, // p_coeff_22h 7.53605330605588874526290510402759537100791931152343750000000000000000000000000000e-01, // p_coeff_0h -6.86303578932659590324882262388685086010663787564085999357010869914574868744239211e-20, // p_coeff_0m 1.37131588394733516800272354885237291455268859863281250000000000000000000000000000e+00, // p_coeff_1h 5.85729819349925155946752593741546617096794483808830378279708384070545434951782227e-17, // p_coeff_1m 8.82290262843787198576706032326910644769668579101562500000000000000000000000000000e-01, // p_coeff_2h 5.16377114572074856584788281695076928068533622922381409736658497422467917203903198e-17, // p_coeff_2m 1.56510752146505316417801623174455016851425170898437500000000000000000000000000000e+00, // p_coeff_3h -4.39163602371923391288987498767894166026634554891340533888666186612681485712528229e-17, // p_coeff_3m 3.07048550644979600932060748164076358079910278320312500000000000000000000000000000e+00, // p_coeff_4h -1.10182145686314872930592860300828689006905830376995686359364867712429258972406387e-16, // p_coeff_4m 6.85588913581356962367863161489367485046386718750000000000000000000000000000000000e+00, // p_coeff_5h 4.35622325486244782178679451752414705321823684735019210911843856592895463109016418e-16, // p_coeff_5m 1.63125257206586802283254655776545405387878417968750000000000000000000000000000000e+01, // p_coeff_6h -1.42810985056358952027816317128163090933704222357941704402151117392349988222122192e-16, // p_coeff_6m 4.06593902603693564401510229799896478652954101562500000000000000000000000000000000e+01, // p_coeff_7h 1.26451118649566617072575681437226509832616233499485991487176761438604444265365601e-15, // p_coeff_7m 1.04739604506448415577324340119957923889160156250000000000000000000000000000000000e+02, // p_coeff_8h -4.21355762035756719251654947961735015460869348269401513107368373312056064605712891e-16, // p_coeff_8m 2.76663345345012544385099317878484725952148437500000000000000000000000000000000000e+02, // p_coeff_9h 7.45270800399650397594086825847625732421875000000000000000000000000000000000000000e+02, // p_coeff_10h 2.03955855522386173106497153639793395996093750000000000000000000000000000000000000e+03, // p_coeff_11h 5.65453975726426688197534531354904174804687500000000000000000000000000000000000000e+03, // p_coeff_12h 1.58480736247709683084394782781600952148437500000000000000000000000000000000000000e+04, // p_coeff_13h 4.48292577388124118442647159099578857421875000000000000000000000000000000000000000e+04, // p_coeff_14h 1.27817476628451069700531661510467529296875000000000000000000000000000000000000000e+05, // p_coeff_15h 3.66953462486772332340478897094726562500000000000000000000000000000000000000000000e+05, // p_coeff_16h 1.05988028936582896858453750610351562500000000000000000000000000000000000000000000e+06, // p_coeff_17h 3.07766344983369577676057815551757812500000000000000000000000000000000000000000000e+06, // p_coeff_18h 8.97598008321647346019744873046875000000000000000000000000000000000000000000000000e+06, // p_coeff_19h 2.63006417766936272382736206054687500000000000000000000000000000000000000000000000e+07, // p_coeff_20h 7.97293238009131550788879394531250000000000000000000000000000000000000000000000000e+07, // p_coeff_21h 2.35266135040413618087768554687500000000000000000000000000000000000000000000000000e+08, // p_coeff_22h 8.16207699480864135033186812506755813956260681152343750000000000000000000000000000e-01, // p_coeff_0h 1.10010191397663675140086054218782967355131241568134164879148861881930088202352636e-20, // p_coeff_0m 1.45987741598546749699494284868706017732620239257812500000000000000000000000000000e+00, // p_coeff_1h 1.03784174873658842691949705484313598874177727812186111666648002938018180429935455e-16, // p_coeff_1m 1.13339308477403566399743795045651495456695556640625000000000000000000000000000000e+00, // p_coeff_2h 6.19984751477578508212901866489819694255822369395765580879498202193644829094409943e-17, // p_coeff_2m 2.27840492593338828086757530400063842535018920898437500000000000000000000000000000e+00, // p_coeff_3h 1.29623917002581965214107410636027293901696556366158474826733026930014602839946747e-16, // p_coeff_3m 5.22734481752082214001120519242249429225921630859375000000000000000000000000000000e+00, // p_coeff_4h -3.48196612292005370465186545711763157537164151090688934964134659821866080164909363e-16, // p_coeff_4m 1.35483951862735629845246876357123255729675292968750000000000000000000000000000000e+01, // p_coeff_5h -4.53291289318611746967298644014774748053833951222640202827207644986629020422697067e-17, // p_coeff_5m 3.74970966548151878328098973724991083145141601562500000000000000000000000000000000e+01, // p_coeff_6h 3.16809448186690022670167104047109366061463187579094746837427010177634656429290771e-15, // p_coeff_6m 1.08680147858936038574029225856065750122070312500000000000000000000000000000000000e+02, // p_coeff_7h -6.36137089188991992639408248982314785589906210028221522634339635260403156280517578e-15, // p_coeff_7m 3.25593310030335430838022148236632347106933593750000000000000000000000000000000000e+02, // p_coeff_8h 1.91287227671501587672951512619431386699611966073497626439348096027970314025878906e-14, // p_coeff_8m 1.00022684509519501716567901894450187683105468750000000000000000000000000000000000e+03, // p_coeff_9h 3.13368188220144656952470541000366210937500000000000000000000000000000000000000000e+03, // p_coeff_10h 9.97418849150001005909871309995651245117187500000000000000000000000000000000000000e+03, // p_coeff_11h 3.21620985996262825210578739643096923828125000000000000000000000000000000000000000e+04, // p_coeff_12h 1.04841470601619919762015342712402343750000000000000000000000000000000000000000000e+05, // p_coeff_13h 3.44929702756780723575502634048461914062500000000000000000000000000000000000000000e+05, // p_coeff_14h 1.14386293806761899031698703765869140625000000000000000000000000000000000000000000e+06, // p_coeff_15h 3.81954181095832167193293571472167968750000000000000000000000000000000000000000000e+06, // p_coeff_16h 1.28314429144318234175443649291992187500000000000000000000000000000000000000000000e+07, // p_coeff_17h 4.33370274414261654019355773925781250000000000000000000000000000000000000000000000e+07, // p_coeff_18h 1.46996088810462892055511474609375000000000000000000000000000000000000000000000000e+08, // p_coeff_19h 5.00961200009291708469390869140625000000000000000000000000000000000000000000000000e+08, // p_coeff_20h 1.77139381348167872428894042968750000000000000000000000000000000000000000000000000e+09, // p_coeff_21h 6.08314919055301284790039062500000000000000000000000000000000000000000000000000000e+09 // p_coeff_22h }; interval-2.1.0/src/crlibm/atan-itanium.c0000644000000000000000000010003713031036767016265 0ustar 00000000000000/* *this function computes a correctly rounded atan using double-extended arithmetic, FMAs and other dirty tricks * * Author : Nicolas Gast, Florent de Dinechin * nicolas.gast@ens.fr * WARNING : This code is dirty and experimental, and remains here for history. A cleaner, portable version using double-extended arithmetic will be available some day as atan-de.c For this reason there is only atan_rn so it fails the "make check" for all the other rounding modes To test within crlibm: (tested with Intel icc compiler version 8.1) icc -Qoption,cpp,--extended_float_types -IPF_fp_speculationsafe -c atan-itanium.c; mv atan-itanium.o atan_fast.o; make This file is completely self-contained so that we can change the crlibm infrastructure without bothering maintaining it. */ /* WARNING Due to some quantum effect not understood so far, turning debugging on may change the result */ #define DEBUG 0 typedef __int64 INT64; typedef signed __int64 SINT64; typedef unsigned __int64 UINT64; /* FP register type */ typedef __fpreg L_FLOAT_TYPE; /* Almost the same as the previous, except exponent field smaller, and morally in memory */ typedef long double LC_FLOAT_TYPE; /* The double-double-ext type, using registers */ typedef struct __X_FLOAT_TYPE_TAG { L_FLOAT_TYPE hi,lo; /* order is critical! */ } X_FLOAT_TYPE; /* The double-double-ext type, in memory */ typedef struct __XC_FLOAT_TYPE_TAG { LC_FLOAT_TYPE hi,lo; /* order is critical! */ } XC_FLOAT_TYPE; /* For debugging */ typedef union { int i[3]; long double d; } db_ext_number; typedef enum { _PC_S = 1 /* single .s */ ,_PC_D = 2 /* double .d */ ,_PC_NONE = 3 /* dynamic */ } _Asm_pc; /* Table 1-22: legal getf/setf floating-point register access completers */ typedef enum { _FR_S = 1 /* single form .s */ ,_FR_D = 2 /* double form .d */ ,_FR_EXP = 3 /* exponent form .exp */ ,_FR_SIG = 4 /* significand form .sig */ } _Asm_fr_access; /* Table 1-24: legal floating-point FPSR status field completers (.sf) */ typedef enum { _SF0 = 0 /* FPSR status field 0 .s0 */ ,_SF1 = 1 /* FPSR status field 1 .s1 */ ,_SF2 = 2 /* FPSR status field 2 .s2 */ ,_SF3 = 3 /* FPSR status field 3 .s3 */ } _Asm_sf; #define print_debug(msg, _z) {\ db_ext_number dbg;\ dbg.d=_z;\ printf(msg);\ printf(" %08x %08x %08x \n", (dbg.i[2]<<16)>>16, dbg.i[1], dbg.i[0]);\ } #define Add12_ext(s, r, a, b) \ { L_FLOAT_TYPE _z, _a, _b, _s; \ _a= (a); _b=(b); \ s = (_a + _b); \ _z= ( a - s ); \ r = (_b + _z); } #define Add22_ext(zh,zl,xh,xl,yh,yl) \ do {\ L_FLOAT_TYPE r,s;\ r = (xh)+(yh);\ s = (xh)-r;\ s+= (yh);\ s+= (yl);\ s+= (xl);\ zh = r+s;\ zl = r - (zh);\ zl+= s;\ } while(0) #define Mul12_ext(_rh,_rl,_u,_v) \ { \ _rh = _u*_v; \ _rl = _Asm_fms( 3/*_PC_NONE*/, _u, _v, _rh, 1/*_SF1*/ );\ } #define Mul22_ext(zh,zl, xh,xl, yh,yl) \ { \ L_FLOAT_TYPE ph, pl; \ ph = (xh)*(yh); \ pl = _Asm_fms( 3/*_PC_NONE*/, xh, yh, ph, 1/*_SF1*/ );; \ pl = (xh)*(yl) + pl; \ pl = (xl)*(yh) + pl; \ zh = ph+pl; \ zl = ph - zh; \ zl += pl; \ } #define Div22_ext(zh,zl,xh,xl,yh,yl) \ { \ L_FLOAT_TYPE _ch,_cl,_uh,_ul; \ _ch=(xh)/(yh); \ Mul12_ext(_uh,_ul,_ch,(yh)); \ _cl=(xh)-_uh; \ _cl -= _ul; \ _cl += (xl); \ _cl -= _ch*(yl); \ _cl /= (yh); \ zh = _ch + _cl; \ zl=(_ch-(zh)); zl += _cl; \ } #define ULL(bits) 0x##bits##uLL #if (!defined(EM64T) && defined(__linux__) && defined(IA32)) # define LDOUBLE_ALIGN 12 /* IA32 Linux: 12-byte alignment */ #else # define LDOUBLE_ALIGN 16 /* EM64T, IA32 Win or IPF Win/Linux: 16-byte alignm\ ent */ #endif #if (LDOUBLE_ALIGN == 16) #define _XPD_ ,0x0000,0x0000,0x0000 #else /*12*/ #define _XPD_ ,0x0000 #endif #define LDOUBLE_HEX(w4,w3,w2,w1,w0) 0x##w0,0x##w1,0x##w2,0x##w3,0x##w4 _XPD_ /*LITTLE_ENDIAN*/ double dde_atan_rn(double x) { return 0; } double atan_rd(double x) { return 0; } double atan_ru(double x) { return 0; } double atan_rz(double x) { return 0; } static const double HALFPI = 1.57079632679489655799898173427209258079528808593750e+00; #define MIN_REDUCTION_NEEDED ULL(3F89FDF8BCCE533D) #define A 0 #define B 1 #define ATAN_BHI 0 #define ATAN_BLO 1 #define epsilon 2.04221581890623872536809598138553304900554884091659e-19 #define epsilon_no_red 1.56771350764719825686165002299335165493769973908433e-19 #define TWO_M_64 5.42101086242752217003726400434970855712890625000000e-20 #define TWO_10 1.02400000000000000000000000000000000000000000000000e+03 __declspec(align(16)) static const struct{long long int a; double b;} ab_table[62] = { { /*a[0] ~= 1.26914436930661800408e-02 */ ULL(3F89FDF8BCCE533D), /*b[0] = */ 2.53869765124364009378776785297304741106927394866943e-02}, { /*a[1] ~= 3.80906929270782388369e-02 */ ULL(3FA3809F90CEBC31), /*b[1] = */ 5.08066978456951506837313559117319528013467788696289e-02}, { /*a[2] ~= 6.35391122156262234502e-02 */ ULL(3FB0441968FBA526), /*b[2] = */ 7.62920780032335793530151590857713017612695693969727e-02}, { /*a[3] ~= 8.90697640843219481662e-02 */ ULL(3FB6CD46ABCDFA25), /*b[3] = */ 1.01876371166982934712841313285025535151362419128418e-01}, { /*a[4] ~= 1.14716138034642060814e-01 */ ULL(3FBD5E096D2EA546), /*b[4] = */ 1.27593346472767293908745500630175229161977767944336e-01}, { /*a[5] ~= 1.40512327929006382604e-01 */ ULL(3FC1FC4ED691E891), /*b[5] = */ 1.53477468508642272970732278736250009387731552124023e-01}, { /*a[6] ~= 1.66493216120905490981e-01 */ ULL(3FC54FA6531F610B), /*b[6] = */ 1.79564085612852891715718328669026959687471389770508e-01}, { /*a[7] ~= 1.92694666476959805056e-01 */ ULL(3FC8AA380550EAF1), /*b[7] = */ 2.05889628199359991933548030829115305095911026000977e-01}, { /*a[8] ~= 2.19153728611415840590e-01 */ ULL(3FCC0D3AB8975BD9), /*b[8] = */ 2.32491819536184141092860500066308304667472839355469e-01}, { /*a[9] ~= 2.45908855876056406352e-01 */ ULL(3FCF79F0FEE46885), /*b[9] = */ 2.59409901651160901270287695297156460583209991455078e-01}, { /*a[10] ~= 2.73000139926648314534e-01 */ ULL(3FD178D5943274CA), /*b[10] = */ 2.86684879348826082701151563014718703925609588623047e-01}, { /*a[11] ~= 3.00469565029600954026e-01 */ ULL(3FD33AE4B2CFB5F7), /*b[11] = */ 3.14359785700871030567071784389554522931575775146484e-01}, { /*a[12] ~= 3.28361285690481766972e-01 */ ULL(3FD503DF0DD40A5B), /*b[12] = */ 3.42479972833279300292730340515845455229282379150391e-01}, { /*a[13] ~= 3.56721931693259067415e-01 */ ULL(3FD6D4883998DD14), /*b[13] = */ 3.71093432391343347465095803272561170160770416259766e-01}, { /*a[14] ~= 3.85600945252912822931e-01 */ ULL(3FD8ADAF964ABFA5), /*b[14] = */ 4.00251150738601846335029676993144676089286804199219e-01}, { /*a[15] ~= 4.15050955725992373816e-01 */ ULL(3FDA9031E241114E), /*b[15] = */ 4.30007504761513281721363455289974808692932128906250e-01}, { /*a[16] ~= 4.45128198220858643198e-01 */ ULL(3FDC7CFAFB78B41D), /*b[16] = */ 4.60420705138676944478959285333985462784767150878906e-01}, { /*a[17] ~= 4.75892983535655022698e-01 */ ULL(3FDE7507D82B9DC6), /*b[17] = */ 4.91553295129659728601723145402502268552780151367188e-01}, { /*a[18] ~= 5.07410228170177493351e-01 */ ULL(3FE03CB45FF4B2AB), /*b[18] = */ 5.23472714391912563591802154405741021037101745605469e-01}, { /*a[19] ~= 5.39750054761637805872e-01 */ ULL(3FE145A1E826E4EA), /*b[19] = */ 5.56251939105489867642972967587411403656005859375000e-01}, { /*a[20] ~= 5.72988475252136329570e-01 */ ULL(3FE255EBED462BAC), /*b[20] = */ 5.89970211851368997457711884635500609874725341796875e-01}, { /*a[21] ~= 6.07208171494496387417e-01 */ ULL(3FE36E3FD4CDD9AC), /*b[21] = */ 6.24713877348479162954220100800739601254463195800781e-01}, { /*a[22] ~= 6.42499390954343656748e-01 */ ULL(3FE48F5AE1FB2991), /*b[22] = */ 6.60577343433393693317157158162444829940795898437500e-01}, { /*a[23] ~= 6.78960978813340497734e-01 */ ULL(3FE5BA0C5FE86E27), /*b[23] = */ 6.97664190728041089251121320558013394474983215332031e-01}, { /*a[24] ~= 7.16701572306941533027e-01 */ ULL(3FE6EF3822C19A5D), /*b[24] = */ 7.36088459496464064812926153535954654216766357421875e-01}, { /*a[25] ~= 7.55840988781748695010e-01 */ ULL(3FE82FD970F967BD), /*b[25] = */ 7.75976148518263131315109148999908939003944396972656e-01}, { /*a[26] ~= 7.96511846049556065643e-01 */ ULL(3FE97D0669351A0D), /*b[26] = */ 8.17466968767843527032823658373672515153884887695312e-01}, { /*a[27] ~= 8.38861462565995493716e-01 */ ULL(3FEAD7F3FE730FCD), /*b[27] = */ 8.60716404767067566616844942473107948899269104003906e-01}, { /*a[28] ~= 8.83054096327761096527e-01 */ ULL(3FEC41FAAA0A733E), /*b[28] = */ 9.05898149317818313086547732382314279675483703613281e-01}, { /*a[29] ~= 9.29273595909162105525e-01 */ ULL(3FEDBC9BFAEEEADF), /*b[29] = */ 9.53206993785724487899813084368361160159111022949219e-01}, { /*a[30] ~= 9.77726555752981254442e-01 */ ULL(3FEF498933AC790A), /*b[30] = */ 1.00286227737052557884567249857354909181594848632812e+00}, { /*a[31] ~= 1.02864609206350806308e+00 */ ULL(3FF075559AC922B4), /*b[31] = */ 1.05511202646791502068879253783961758017539978027344e+00}, { /*a[32] ~= 1.08229638730567912228e+00 */ ULL(3FF151160440E8D3), /*b[32] = */ 1.11023795151925819268967643438372761011123657226562e+00}, { /*a[33] ~= 1.13897819300824741364e+00 */ ULL(3FF23941329D3DD8), /*b[33] = */ 1.16856151675095110142876819736557081341743469238281e+00}, { /*a[34] ~= 1.19903553596580987055e+00 */ ULL(3FF32F3FE2DB7094), /*b[34] = */ 1.23045136228081597451478046423289924860000610351562e+00}, { /*a[35] ~= 1.26286394722716532198e+00 */ ULL(3FF434B0D38A35D7), /*b[35] = */ 1.29633244442242001603915468876948580145835876464844e+00}, { /*a[36] ~= 1.33092063388866265448e+00 */ ULL(3FF54B736F41F96D), /*b[36] = */ 1.36669737760087572908673791971523314714431762695312e+00}, { /*a[37] ~= 1.40373715148086145849e+00 */ ULL(3FF675B5165CA5E1), /*b[37] = */ 1.44212062317890032936418265308020636439323425292969e+00}, { /*a[38] ~= 1.48193532552453321547e+00 */ ULL(3FF7B601D0DEA3C6), /*b[38] = */ 1.52327639603630871079076314345002174377441406250000e+00}, { /*a[39] ~= 1.56624743831976717041e+00 */ ULL(3FF90F5979506F51), /*b[39] = */ 1.61096147803441858137318831722950562834739685058594e+00}, { /*a[40] ~= 1.65754207708184630948e+00 */ ULL(3FFA854AD74CF791), /*b[40] = */ 1.70612458293084490179580825497396290302276611328125e+00}, { /*a[41] ~= 1.75685758736121174681e+00 */ ULL(3FFC1C16B3972246), /*b[41] = */ 1.80990457885083300126893846027087420225143432617188e+00}, { /*a[42] ~= 1.86544587781964938190e+00 */ ULL(3FFDD8DDC6DB1831), /*b[42] = */ 1.92368085119253517945026032975874841213226318359375e+00}, { /*a[43] ~= 1.98483051718814034750e+00 */ ULL(3FFFC1DDA4F6D032), /*b[43] = */ 2.04914055707593512067887786542996764183044433593750e+00}, { /*a[44] ~= 2.11688487740990979279e+00 */ ULL(4000EF6156AEFAF2), /*b[44] = */ 2.18836977316091063627823132264893501996994018554688e+00}, { /*a[45] ~= 2.26393888595347935033e+00 */ ULL(40021C8BFD9A80C1), /*b[45] = */ 2.34397906437763481335423421114683151245117187500000e+00}, { /*a[46] ~= 2.42892740222016626128e+00 */ ULL(40036E717D67269C), /*b[46] = */ 2.51927965826279764982587039412464946508407592773438e+00}, { /*a[47] ~= 2.61560046981161264128e+00 */ ULL(4004ECBFF069F1E4), /*b[47] = */ 2.71853573297491069027387311507482081651687622070312e+00}, { /*a[48] ~= 2.82882779840766906527e+00 */ ULL(4006A170780169B7), /*b[48] = */ 2.94733416149008720097413061012048274278640747070312e+00}, { /*a[49] ~= 3.07505072362971616974e+00 */ ULL(400899B4319C3F02), /*b[49] = */ 3.21314087722892072207514502224512398242950439453125e+00}, { /*a[50] ~= 3.36297230191158715455e+00 */ ULL(400AE75E05B0834A), /*b[50] = */ 3.52616384863255349912947167467791587114334106445312e+00}, { /*a[51] ~= 3.70464601821196143254e+00 */ ULL(400DA31D739BD0E3), /*b[51] = */ 3.90073973345466518125590482668485492467880249023438e+00}, { /*a[52] ~= 4.11726034471856573100e+00 */ ULL(401078131886BC57), /*b[52] = */ 4.35765668014056828383218089584261178970336914062500e+00}, { /*a[53] ~= 4.62619989820137847648e+00 */ ULL(4012813A8BCE2241), /*b[53] = */ 4.92824409985376998832862227573059499263763427734375e+00}, { /*a[54] ~= 5.27059285056349616385e+00 */ ULL(401515164ACECE78), /*b[54] = */ 5.66202526987798027136022938066162168979644775390625e+00}, { /*a[55] ~= 6.11406930017863578891e+00 */ ULL(401874CE9526FAB9), /*b[55] = */ 6.64216890962962569489036468439735472202301025390625e+00}, { /*a[56] ~= 7.26750136287798241547e+00 */ ULL(401D11EBE094C913), /*b[56] = */ 8.01990986231011859786121931392699480056762695312500e+00}, { /*a[57] ~= 8.94284159107796650204e+00 */ ULL(4021E2BC220DFA19), /*b[57] = */ 1.01020964280653942068965989165008068084716796875000e+01}, { /*a[58] ~= 1.16023240149353498339e+01 */ ULL(40273463D0337C49), /*b[58] = */ 1.36206610885392880305744256475009024143218994140625e+01}, { /*a[59] ~= 1.64826377753716631495e+01 */ ULL(40307B8E26350916), /*b[59] = */ 2.08587363260064613257327437167987227439880371093750e+01}, { /*a[60] ~= 2.83859754493341325216e+01 */ ULL(403C62CF497BF2F2), /*b[60] = */ 4.43908820444562195461912779137492179870605468750000e+01}, { /*a[61] ~= 1.01699461607316896213e+02 */ ULL(40596CC3FA9E0EF4), /*b[61] = */ 8.27932424540746438879068591631948947906494140625000e+01} }; #define atanb_table ((const XC_FLOAT_TYPE *)_atanb_table) __declspec(align(16)) static const unsigned short _atanb_table[] = { /*atan_b[0] ~= 2.5381524664e-02*/ LDOUBLE_HEX(3FF9, CFEC, EA4B, 4FCB, 5DFD), LDOUBLE_HEX(BFB7, CBBA, 8342, F523, 8BE7), /*atan_b[1] ~= 5.0763049304e-02*/ LDOUBLE_HEX(3FFA, CFEC, EA49, B131, 647C), LDOUBLE_HEX(3FB6, D38B, A5E1, 4DEF, A6BD), /*atan_b[2] ~= 7.6144573921e-02*/ LDOUBLE_HEX(3FFB, 9BF1, AFB6, 0F03, 5D53), LDOUBLE_HEX(3FB8, EF7C, 871F, DC70, BCA9), /*atan_b[3] ~= 1.0152609851e-01*/ LDOUBLE_HEX(3FFB, CFEC, EA46, 78CC, AECA), LDOUBLE_HEX(BFB7, DCB7, 3BED, 3BD7, 633C), /*atan_b[4] ~= 1.2690762308e-01*/ LDOUBLE_HEX(3FFC, 81F4, 126B, 0C0A, B24C), LDOUBLE_HEX(3FB8, 9C93, 50C6, 8748, 202B), /*atan_b[5] ~= 1.5228914763e-01*/ LDOUBLE_HEX(3FFC, 9BF1, AFB2, 77C1, F1F3), LDOUBLE_HEX(BFBB, 9D89, 6B54, 2B43, C3D3), /*atan_b[6] ~= 1.7767067216e-01*/ LDOUBLE_HEX(3FFC, B5EF, 4CF9, 8121, 27D9), LDOUBLE_HEX(BFBB, D8AB, 134C, C337, 1424), /*atan_b[7] ~= 2.0305219666e-01*/ LDOUBLE_HEX(3FFC, CFEC, EA40, 29FE, 3D0C), LDOUBLE_HEX(BFBA, 964C, 23A5, 78A9, 286C), /*atan_b[8] ~= 2.2843372114e-01*/ LDOUBLE_HEX(3FFC, E9EA, 8786, 746E, CBDE), LDOUBLE_HEX(3FBB, 95CE, 8C74, D4B3, 3D3D), /*atan_b[9] ~= 2.5381524560e-01*/ LDOUBLE_HEX(3FFD, 81F4, 1266, 3163, 58ED), LDOUBLE_HEX(3FBB, B292, B8DC, 903F, C86D), /*atan_b[10] ~= 2.7919677004e-01*/ LDOUBLE_HEX(3FFD, 8EF2, E108, FBCB, 4839), LDOUBLE_HEX(BFBC, C5E3, D3F8, 42F0, A001), /*atan_b[11] ~= 3.0457829447e-01*/ LDOUBLE_HEX(3FFD, 9BF1, AFAB, 9AD5, 051A), LDOUBLE_HEX(3FBC, BE9C, AF21, 45D0, CBC5), /*atan_b[12] ~= 3.2995981887e-01*/ LDOUBLE_HEX(3FFD, A8F0, 7E4E, 1002, FE3F), LDOUBLE_HEX(3FB9, ACDF, 4585, 84D5, 7EE8), /*atan_b[13] ~= 3.5534134325e-01*/ LDOUBLE_HEX(3FFD, B5EF, 4CF0, 5CF3, 3B2F), LDOUBLE_HEX(BFB9, DAF1, E542, E461, 5C3F), /*atan_b[14] ~= 3.8072286762e-01*/ LDOUBLE_HEX(3FFD, C2EE, 1B92, 835E, 5241), LDOUBLE_HEX(3FBC, F450, E872, E8D5, 5B89), /*atan_b[15] ~= 4.0610439197e-01*/ LDOUBLE_HEX(3FFD, CFEC, EA34, 8516, 3E60), LDOUBLE_HEX(BFBC, 91DD, F6E6, 0680, E8AD), /*atan_b[16] ~= 4.3148591630e-01*/ LDOUBLE_HEX(3FFD, DCEB, B8D6, 6405, 31AA), LDOUBLE_HEX(BFBC, 8502, E09D, 5663, 1B39), /*atan_b[17] ~= 4.5686744062e-01*/ LDOUBLE_HEX(3FFD, E9EA, 8778, 222C, 48BB), LDOUBLE_HEX(BFBB, F51E, C2F3, 5A3E, F53D), /*atan_b[18] ~= 4.8224896492e-01*/ LDOUBLE_HEX(3FFD, F6E9, 5619, C1A2, 5014), LDOUBLE_HEX(BFBB, E1E1, FABB, 35B7, 64D8), /*atan_b[19] ~= 5.0763048922e-01*/ LDOUBLE_HEX(3FFE, 81F4, 125D, A249, 1B96), LDOUBLE_HEX(BFBB, FEB6, 20F5, A80E, ABD8), /*atan_b[20] ~= 5.3301201350e-01*/ LDOUBLE_HEX(3FFE, 8873, 79AE, 569C, E82C), LDOUBLE_HEX(BFBD, 9333, CB85, 3253, A31F), /*atan_b[21] ~= 5.5839353776e-01*/ LDOUBLE_HEX(3FFE, 8EF2, E0FE, FEF4, 22DF), LDOUBLE_HEX(3FBD, FBF4, E487, 2960, 19F2), /*atan_b[22] ~= 5.8377506202e-01*/ LDOUBLE_HEX(3FFE, 9572, 484F, 9C7E, 4569), LDOUBLE_HEX(BFBD, ED41, 6021, 317B, 1548), /*atan_b[23] ~= 6.0915658627e-01*/ LDOUBLE_HEX(3FFE, 9BF1, AFA0, 3071, E801), LDOUBLE_HEX(3FBD, C46B, 95C4, B736, D8A5), /*atan_b[24] ~= 6.3453811052e-01*/ LDOUBLE_HEX(3FFE, A271, 16F0, BC0B, F541), LDOUBLE_HEX(3FBD, E479, 64B6, 873E, E8BE), /*atan_b[25] ~= 6.5991963475e-01*/ LDOUBLE_HEX(3FFE, A8F0, 7E41, 408E, DDC6), LDOUBLE_HEX(3FBD, C200, D1A3, 7D02, 9DAA), /*atan_b[26] ~= 6.8530115898e-01*/ LDOUBLE_HEX(3FFE, AF6F, E591, BF41, BD98), LDOUBLE_HEX(3FBC, AB83, 86B7, DBD3, 49B9), /*atan_b[27] ~= 7.1068268321e-01*/ LDOUBLE_HEX(3FFE, B5EF, 4CE2, 396F, 887A), LDOUBLE_HEX(3FB9, 93C0, 6F69, 2472, DD13), /*atan_b[28] ~= 7.3606420743e-01*/ LDOUBLE_HEX(3FFE, BC6E, B432, B066, 2617), LDOUBLE_HEX(BFBD, C5F2, 72DA, A216, 8845), /*atan_b[29] ~= 7.6144573166e-01*/ LDOUBLE_HEX(3FFE, C2EE, 1B83, 2575, A17C), LDOUBLE_HEX(3FBA, FC52, 25AC, D135, 67B0), /*atan_b[30] ~= 7.8682725588e-01*/ LDOUBLE_HEX(3FFE, C96D, 82D3, 99EF, 4753), LDOUBLE_HEX(3FBC, E6CB, 9CE5, F7DC, 32EF), /*atan_b[31] ~= 8.1220878010e-01*/ LDOUBLE_HEX(3FFE, CFEC, EA24, 0F24, C5A3), LDOUBLE_HEX(BFBB, 9F94, 64A4, 0D49, 77DA), /*atan_b[32] ~= 8.3759030433e-01*/ LDOUBLE_HEX(3FFE, D66C, 5174, 8667, 5086), LDOUBLE_HEX(BFBC, E480, 36A7, 98A0, E416), /*atan_b[33] ~= 8.6297182855e-01*/ LDOUBLE_HEX(3FFE, DCEB, B8C5, 0106, C115), LDOUBLE_HEX(BFBB, AE5E, 111C, 0925, 5FC1), /*atan_b[34] ~= 8.8835335278e-01*/ LDOUBLE_HEX(3FFE, E36B, 2015, 8050, B874), LDOUBLE_HEX(BFBC, 8DD3, E1A9, 67EE, B236), /*atan_b[35] ~= 9.1373487702e-01*/ LDOUBLE_HEX(3FFE, E9EA, 8766, 058F, C400), LDOUBLE_HEX(BFBD, 994E, 5D94, 7944, 5BF2), /*atan_b[36] ~= 9.3911640126e-01*/ LDOUBLE_HEX(3FFE, F069, EEB6, 920A, 8756), LDOUBLE_HEX(BFBD, F0FC, 830B, 5639, 9FED), /*atan_b[37] ~= 9.6449792552e-01*/ LDOUBLE_HEX(3FFE, F6E9, 5607, 2702, D403), LDOUBLE_HEX(BFBD, B0EF, D9DB, FF7A, BBF3), /*atan_b[38] ~= 9.8987944978e-01*/ LDOUBLE_HEX(3FFE, FD68, BD57, C5B4, F372), LDOUBLE_HEX(BFBD, 9706, 5831, 4248, 656E), /*atan_b[39] ~= 1.0152609740e+00*/ LDOUBLE_HEX(3FFF, 81F4, 1254, 37AB, 59C4), LDOUBLE_HEX(3FBE, C83B, C3BE, 8160, FE56), /*atan_b[40] ~= 1.0406424983e+00*/ LDOUBLE_HEX(3FFF, 8533, C5FC, 928B, 5DCD), LDOUBLE_HEX(3FBE, C025, 7DA6, 5435, CDA0), /*atan_b[41] ~= 1.0660240226e+00*/ LDOUBLE_HEX(3FFF, 8873, 79A4, F40D, D390), LDOUBLE_HEX(BFBE, BB70, CBE8, FB3B, AA03), /*atan_b[42] ~= 1.0914055469e+00*/ LDOUBLE_HEX(3FFF, 8BB3, 2D4D, 5CC1, ADB6), LDOUBLE_HEX(3FBE, 8161, 18FB, A932, 136B), /*atan_b[43] ~= 1.1167870712e+00*/ LDOUBLE_HEX(3FFF, 8EF2, E0F5, CD31, 1F80), LDOUBLE_HEX(BFBC, BD96, 57B0, 5730, 7576), /*atan_b[44] ~= 1.1421685956e+00*/ LDOUBLE_HEX(3FFF, 9232, 949E, 45E1, 3E02), LDOUBLE_HEX(BFBD, CDB1, 87A1, 5D56, 06EC), /*atan_b[45] ~= 1.1675501199e+00*/ LDOUBLE_HEX(3FFF, 9572, 4846, C751, B4C7), LDOUBLE_HEX(BFBD, A1AB, 140B, 2B49, DF68), /*atan_b[46] ~= 1.1929316443e+00*/ LDOUBLE_HEX(3FFF, 98B1, FBEF, 51FC, 635A), LDOUBLE_HEX(3FBE, CA64, 3ADC, 86D5, FB02), /*atan_b[47] ~= 1.2183131687e+00*/ LDOUBLE_HEX(3FFF, 9BF1, AF97, E655, 1527), LDOUBLE_HEX(3FBE, CA1D, 3262, C2F9, D84C), /*atan_b[48] ~= 1.2436946931e+00*/ LDOUBLE_HEX(3FFF, 9F31, 6340, 84C9, 33A7), LDOUBLE_HEX(3FBD, AF23, 2B16, BE75, 8B87), /*atan_b[49] ~= 1.2690762175e+00*/ LDOUBLE_HEX(3FFF, A271, 16E9, 2DBF, 7CA7), LDOUBLE_HEX(3FBE, FDDA, 7599, 4DA2, 0F86), /*atan_b[50] ~= 1.2944577420e+00*/ LDOUBLE_HEX(3FFF, A5B0, CA91, E197, C307), LDOUBLE_HEX(BFBC, D265, 9307, D567, 08BE), /*atan_b[51] ~= 1.3198392664e+00*/ LDOUBLE_HEX(3FFF, A8F0, 7E3A, A0AA, A7E2), LDOUBLE_HEX(3FBE, BE3C, 4D06, 7D11, 0641), /*atan_b[52] ~= 1.3452207909e+00*/ LDOUBLE_HEX(3FFF, AC30, 31E3, 6B49, 6713), LDOUBLE_HEX(BFBE, B9DD, 9D13, C459, 6F6C), /*atan_b[53] ~= 1.3706023154e+00*/ LDOUBLE_HEX(3FFF, AF6F, E58C, 41BD, 9EA8), LDOUBLE_HEX(BFBD, 802F, 2153, DC49, 3698), /*atan_b[54] ~= 1.3959838399e+00*/ LDOUBLE_HEX(3FFF, B2AF, 9935, 2449, 1D44), LDOUBLE_HEX(3FBE, CAFC, 43E2, 3F23, 5075), /*atan_b[55] ~= 1.4213653645e+00*/ LDOUBLE_HEX(3FFF, B5EF, 4CDE, 1325, B93A), LDOUBLE_HEX(BFBA, 9155, 4FBC, 9598, FA3D), /*atan_b[56] ~= 1.4467468891e+00*/ LDOUBLE_HEX(3FFF, B92F, 0087, 0E85, 296B), LDOUBLE_HEX(3FBE, C76A, DB5B, 6055, 9EA6), /*atan_b[57] ~= 1.4721284137e+00*/ LDOUBLE_HEX(3FFF, BC6E, B430, 1690, E405), LDOUBLE_HEX(3FBA, A6CB, 4564, 7FF8, 4121), /*atan_b[58] ~= 1.4975099383e+00*/ LDOUBLE_HEX(3FFF, BFAE, 67D9, 2B6A, 02AA), LDOUBLE_HEX(BFBD, B0AE, B984, 420B, 761D), /*atan_b[59] ~= 1.5228914629e+00*/ LDOUBLE_HEX(3FFF, C2EE, 1B82, 4D29, 2EBE), LDOUBLE_HEX(BFBE, 9CBD, 26E8, 9FF8, E917), /*atan_b[60] ~= 1.5482729876e+00*/ LDOUBLE_HEX(3FFF, C62D, CF2B, 7BDE, 8EE3), LDOUBLE_HEX(BFBE, AF45, EFD8, 2A64, 49A5), /*atan_b[61] ~= 1.5587186337e+00*/ LDOUBLE_HEX(3FFF, C784, 1799, 9E5D, D2A5), LDOUBLE_HEX(BFBE, A231, BD90, F170, 34A5), }; static const long double coef_poly[9][2] = { { -3.33333333333333333342368351437379203616728773340583e-01L, 9.03501810404587028364033466367082415937499719525463e-21L}, { 2.00000000000000000002710505431213761085018632002175e-01L, -2.71050543121376108505536620063805076318847614178820e-21L}, { -1.42857142857142857140921067549133027796415262855589e-01L, -1.93607530800982934641564128836546985281459293443700e-21L}, { 1.11111111111111111109605274760436799397211871109903e-01L, 1.50583635067431171387883211317314321885579450456211e-21L}, { -9.09090909090909090933731867556488737136533018201590e-02L, 0}, { 7.69230769230769230779655790120052927250071661546826e-02L, 0}, { -6.66666666666666666698289230030827212658550706692040e-02L, 0}, { 5.88235294117647058825522430464127765503690170589834e-02L, 0}, { -5.26315789473684210515616425929419364138084347359836e-02L, 0}, }; extern double atan_rn(double xd) { unsigned int hx; double sign; double u; double comp; int i, i1, m; UINT64 x_val,x_abs,sign_mask; L_FLOAT_TYPE xe, tmp, bi, atanbhi, xred, xred2,q; L_FLOAT_TYPE res,reshi,reslo,rn_constant,test; L_FLOAT_TYPE xred4,tmp2; L_FLOAT_TYPE a,b,e0,e1,e2,e3,q0,q1,q2,y0,y1,y2,xred2coarse; L_FLOAT_TYPE C3,C5,C7,C9 ; x_val = _Asm_getf( _FR_D, xd ); x_abs = (x_val & ULL(7fffffffffffffff)); sign_mask = ((SINT64)x_val >> 63); /* either 00..00 or 11...11 */ /* cast x to a DE register */ if(sign_mask) xe=-xd; else xe=xd; /* Filter cases */ if (__builtin_expect( x_abs >= ULL(4350000000000000), 0)) { /* x >= 2^54 */ if (xd!=xd ) return xd+xd; /* NaN */ else {/* atan(x) = +/- Pi/2 */ if(sign_mask) return -HALFPI; else return HALFPI; } } else if (__builtin_expect( x_abs < ULL(3E40000000000000), 0)) /* TODO Add stuff to raise inexact flag */ return xd; /* x<2^-27 then atan(x) =~ x */ /* Now there is something to compute*/ /* load polynomial coeffs */ C3=coef_poly[0][0]; C5=coef_poly[1][0]; C7=coef_poly[2][0]; C9=coef_poly[3][0]; if (__builtin_expect(x_abs > MIN_REDUCTION_NEEDED, 0)) /* test if reduction is necessary : */ { /* 1) Argument reduction : */ /* This constant was found by dichotomy. I am very ashamed */ rn_constant = 1.002; /* compute i so that a[i] < x < a[i+1] */ if (x_abs>ab_table[61].a) i=61; else { i=31; if (x_abs < ab_table[i].a) i-= 16; else i+=16; if (x_abs < ab_table[i].a) i-= 8; else i+= 8; if (x_abs < ab_table[i].a) i-= 4; else i+= 4; if (x_abs < ab_table[i].a) i-= 2; else i+= 2; if (x_abs < ab_table[i].a) i-= 1; else i+= 1; if (x_abs < ab_table[i].a) i-= 1; } bi= ab_table[i].b; atanbhi = atanb_table[i].hi; /* the dividend and the divisor for the argument reduction */ a = xe-bi; b = 1 + xe * bi; #if 1 /* now we want to compute (xe - bi )/b as a DE, but we will need the accurate quotient only later on, we can start the computation of the polynomial with a much coarser approximation. Saves 12 cycles. */ /* Algo 8.11 in Markstein book */ _Asm_frcpa(&y0, a, b, _SF1); e0 = 1 - b*y0; q0 = a*y0; e2 = e0 + e0*e0; e1 = e0*e0; e3 = e0 + e1*e1; q1 = q0+q0*e2; xred = q0 + q1*e3; xred2coarse = q1*q1; /* 62 bits in xred, more than enough */ xred2 = xred*xred; xred4 = xred2coarse*xred2coarse; /*polynom evaluation */ tmp2 = C7 + xred2coarse * C9 ; /* here we need xred2, xred2coarse loses a lot of precision to win 3 cycles. */ tmp = C3 + xred2 * C5; q = tmp + xred4 * tmp2; #else xred=a/b; xred2=xred*xred; xred4=xred2*xred2; tmp2 = C7 + xred2 * C9 ; tmp = C3 + xred2 * C5; q = tmp + xred4 * tmp2; #endif tmp = 1+q*xred2; /* reconstruction : atan(x) = atan(b[i]) + atan(x) */ res = atanbhi+xred*tmp; /* atan = atanbhi + tmp; with round to double */ reshi = _Asm_fma( _PC_D, xred, tmp, atanbhi, _SF0 ); } else /* no reduction needed */ { /* Polynomial evaluation */ xred2 = xe*xe; /*poly eval */ xred4=xred2*xred2; tmp2 = C7 + xred2 * C9 ; tmp = C3 + xred2 * C5; q = tmp + xred4 * tmp2; q *= xred2; /* compute q*xe+xe with round to double */ res = _Asm_fma( _PC_NONE, q, xe, xe, _SF1 ); reshi = _Asm_fma( _PC_D, q, xe, xe, _SF0 ); } #if 0 /* To time the first step only */ if(sign_mask) return -reshi; else return reshi; #endif #if 1 i1 = _Asm_getf( _FR_SIG, res); m = i1 & (0xff<<3); if(__builtin_expect((m!=(0x7f<<3) && m!=(0x80<<3)), 1+1==2)) { if(sign_mask) return -reshi; else return reshi; } #else /* ROUNDING TEST la Ziv */ /* This constant was found by dichotomy. I am very ashamed */ rn_constant = 1.01; reslo = res - reshi; test=_Asm_fma( _PC_D, reslo, rn_constant, reshi, _SF0 ); if (__builtin_expect(reshi == test, 1+1==2)) { if(sign_mask) return -reshi; else return reshi; } #endif else { /******************************************************************/ /* Double-double-extended */ L_FLOAT_TYPE tmphi, tmplo, x0hi, x0lo, xmBihi, xmBilo, Xredhi, Xredlo, Xred2, qhi,qlo, q, Xred2hi,Xred2lo, atanhi,atanlo; int j; #if EVAL_PERF crlibm_second_step_taken++; #endif #if DEBUG printf("Toto\n"); #endif if (__builtin_expect(x_abs > MIN_REDUCTION_NEEDED, 0)) {/* test if reduction is necessary : */ if(i==61){ Add12_ext( xmBihi , xmBilo , xe , -ab_table[61].b); } else { xmBihi = xe-ab_table[i].b; xmBilo = 0.0; } Mul12_ext(tmphi,tmplo, xe, (ab_table[i].b)); if (xe > 1) /* TODO remplacer par xabs */ Add22_ext(x0hi,x0lo,tmphi,tmplo, 1.0,0.0); else { Add22_ext(x0hi , x0lo , 1.0,0.0,tmphi,tmplo); } #if 1 Div22_ext(Xredhi, Xredlo, xmBihi , xmBilo , x0hi,x0lo); #else Xredhi=1; Xredlo=0; /* to time the Div22*/ #endif #if DEBUG printf("i=%d, num=%1.15e den=%1.15e\n",i, (double)xmBihi, (double)x0hi); printf("Xred=%1.15e\n", (double)Xredhi); #endif Xred2 = Xredhi*Xredhi; Mul22_ext(Xred2hi,Xred2lo,Xredhi,Xredlo,Xredhi, Xredlo); /*poly eval */ q = (coef_poly[4][0]+Xred2* (coef_poly[5][0]+Xred2* (coef_poly[6][0]+Xred2* (coef_poly[7][0]+ (Xred2*coef_poly[8][0]))))); Mul12_ext(qhi, qlo, q, Xred2); for(j=3;j>=0;j--) { Add22_ext(qhi,qlo, (coef_poly[j][0]), (coef_poly[j][1]), qhi,qlo); Mul22_ext(qhi,qlo, qhi,qlo, Xred2hi,Xred2lo); } Mul22_ext(qhi,qlo, Xredhi,Xredlo, qhi,qlo); Add22_ext(qhi,qlo, Xredhi,Xredlo, qhi,qlo); /* reconstruction : atan(x) = atan(b[i]) + atan(x) */ Add22_ext(atanhi,atanlo, atanb_table[i].hi, atanb_table[i].lo, qhi,qlo); } else /* no reduction needed */ { #if DEBUG printf("Tata\n"); #endif /* Polynomial evaluation */ Mul12_ext( Xred2hi,Xred2lo,xe,xe); /*poly eval - don't take risks, keep plain Horner */ q = coef_poly[8][0]; q = coef_poly[7][0]+Xred2hi*q; q = coef_poly[6][0]+Xred2hi*q; q = coef_poly[5][0]+Xred2hi*q; Add12_ext(qhi,qlo, coef_poly[4][0], Xred2hi*q); #if DEBUG printf(" qhi+ql = %1.50Le + %1.50Le\n",(long double)qhi, (long double)qlo); print_debug("qhi", qhi); print_debug("qlo", qlo); #endif Mul22_ext(qhi,qlo, qhi,qlo, Xred2hi,Xred2lo); #if DEBUG printf(" Xred2 = %1.50Le + %1.50Le\n",(long double)Xred2hi, (long double)Xred2lo); printf(" qhi+ql = %1.50Le + %1.50Le\n",(long double)qhi, (long double)qlo); print_debug("qhi", qhi); print_debug("qlo", qlo); #endif for(j=3;j>=0;j--) { Add22_ext(qhi,qlo, (coef_poly[j][0]), (coef_poly[j][1]), qhi,qlo); Mul22_ext(qhi,qlo, qhi,qlo, Xred2hi,Xred2lo); } Mul22_ext (qhi,qlo, xe,0, qhi,qlo); #if DEBUG printf(" qhi+ql = %1.50Le + %1.50Le\n",(long double)qhi, (long double)qlo); print_debug("qhi", qhi); print_debug("qlo", qlo); #endif /* Now comes the addition sequence proven in the TOMS paper */ Add12_ext(atanhi,atanlo,xe,qhi); #if DEBUG print_debug("atanhi", atanhi); printf(" atan hi+lo %1.50Le + %1.50Le\n",(long double)atanhi, (long double)atanlo); #endif atanlo += qlo; } #if DEBUG printf(" atan hi+lo %1.50Le + %1.50Le\n",(long double)atanhi, (long double)atanlo); printf(" %1.50e + %1.50e\n",(double)atanhi,(double) atanlo); printf(" %1.50Le\n",(long double)(atanhi + atanlo)); printf(" "); #endif if(sign_mask) res= -(double) (atanhi+atanlo); else res= (double) (atanhi+atanlo); return res; } } interval-2.1.0/src/crlibm/atan-pentium.c0000644000000000000000000001604313031036767016303 0ustar 00000000000000/* * THIS CODE IS BROKEN. DO NOT USE. this function computes atan correctly rounded to the nearest, using experimental techniques based on double-extended arithmetic It used to work, honest, but changes in the crlibm framework have broken it. It should be merged some day with atan-itanium, but this is not high on the agenda. * * Author : Nicolas Gast, Florent de Dinechin * nicolas.gast@ens.fr * To have it replace the crlibm atan, do: gcc -DHAVE_CONFIG_H -I. -fPIC -O2 -c atan-pentium.c; mv atan-pentium.o atan_fast.o; make */ #include #include #include #include #include #define debug 0 /*Warning : turning debugging on seems to change the final result */ #define DEBUG 0 #define NICOLASTEST 0 #ifdef HAVE_FENV_H #include #endif /* The following seems perfectly harmless */ #ifdef FENV_H #pragma STDC FENV_ACCESS ON #endif #include "atan-pentium.h" #include /* Dummy functions to compile OK */ extern double atan_rd(double x) {return 0;} extern double atan_ru(double x) {return 0;} extern double atan_rz(double x) {return 0;} extern double atan_rn(double x) { db_number x_db; unsigned int hx; double sign; double u; double comp; double atanhi, atanlo, atanlo_u; long double Xred; long double Xred2; long double q; long double atan; long double eps; int i; if(x>=0) sign = 1; else {sign = -1; x=-x;} x_db.d = x; hx = x_db.i[HI] & 0x7FFFFFFF; /* Filter cases */ if ( hx >= 0x43500000) /* x >= 2^54 */ { if ( (x_db.i[LO] == 0) && (hx & 0x000fffff) == 0x00080000) return x+x; /* NaN */ else return sign*HALFPI.d; /* atan(x) = Pi/2 */ } else if ( hx < 0x3E400000 ) {return sign*x;} /* x<2^-27 then atan(x) =~ x */ DOUBLE_EXTENDED_MODE; if (x > MIN_REDUCTION_NEEDED) /* test if reduction is necessary : */ { /* 1) Argument reduction : */ /* compute i so that a[i] < x < a[i+1] */ if (x>arctan_table[61][A]) i=61; else { i=31; if (x < arctan_table[i][A]) i-= 16; else i+=16; if (x < arctan_table[i][A]) i-= 8; else i+= 8; if (x < arctan_table[i][A]) i-= 4; else i+= 4; if (x < arctan_table[i][A]) i-= 2; else i+= 2; if (x < arctan_table[i][A]) i-= 1; else i+= 1; if (x < arctan_table[i][A]) i-= 1; } Xred = (x - arctan_table[i][B] )/(1.0L + x * arctan_table[i][B] ); Xred2 = Xred*Xred; /* Polynomial evaluation */ q = Xred2*(coef_poly[0][0]+Xred2* (coef_poly[1][0]+Xred2* (coef_poly[2][0]+Xred2* (coef_poly[3][0])))); /* reconstruction : atan(x) = atan(b[i]) + atan(x) */ atan = arctan_table[i][ATAN_BHI] + (Xred + q*Xred); atanhi = (double) atan; atanlo = atan-atanhi; } else // no reduction needed { Xred2 = x*x; /* Polynomial evaluation */ q = Xred2*(coef_poly[0][0]+Xred2* (coef_poly[1][0]+Xred2* (coef_poly[2][0]+Xred2* (coef_poly[3][0])))); atan = q*x + x; } /* We do not use the macro of double-extended.h because we want to compute in parallel the rounding test and the product sign*atan */ #if 1 DE_TEST_AND_RETURN_RN(sign*atan, ACCURATE_TO_62_BITS); #else { db_ext_number _z; double _yd, retval; int _lo; int _mask=ACCURATE_TO_62_BITS; _z.d = atan; retval= sign*atan; _yd = (double) atan; _lo = _z.i[DE_MANTISSA_LO] &(_mask); if((_lo!=(0x3ff&(_mask))) && (_lo!= (0x400&(_mask)))) { BACK_TO_DOUBLE_MODE; return retval; } } #endif { /*Second step, double-double */ long double tmphi, tmplo; long double x0hi, x0lo; long double xmBihi, xmBilo; long double Xredhi, Xredlo; long double Xred2; long double qhi,qlo; /* q = polynomial */ long double q; long double Xred2hi,Xred2lo; long double atanhi,atanlo; int j; #if EVAL_PERF crlibm_second_step_taken++; #endif if (x > MIN_REDUCTION_NEEDED) /* test if reduction is necessary : */ { /* 1) Argument reduction : */ if (i==61) { Add12_ext( &xmBihi , &xmBilo , x , -arctan_table[61][B]); } else { xmBihi = x-arctan_table[i][B]; xmBilo = 0.0; } Mul12_ext(&tmphi,&tmplo, x, arctan_table[i][B]); if (x > 1) Add22_ext(&x0hi,&x0lo,tmphi,tmplo, 1.0,0.0); else {Add22_ext( &x0hi , &x0lo , 1.0,0.0,tmphi,tmplo);} Div22_ext( Xredhi, Xredlo, xmBihi , xmBilo , x0hi,x0lo); Xred2 = Xredhi*Xredhi; Mul22_ext( &Xred2hi,&Xred2lo,Xredhi,Xredlo,Xredhi, Xredlo); /*poly eval */ q = (coef_poly[4][0]+Xred2* (coef_poly[5][0]+Xred2* (coef_poly[6][0]+Xred2* (coef_poly[7][0]+ (Xred2*coef_poly[8][0]))))); Mul12_ext( &qhi, &qlo, q, Xred2); for(j=3;j>=0;j--) { Add22_ext(&qhi,&qlo, coef_poly[j][0], coef_poly[j][1], qhi,qlo); Mul22_ext(&qhi,&qlo, qhi,qlo, Xred2hi,Xred2lo); } Mul22_ext(&qhi,&qlo, Xredhi,Xredlo, qhi,qlo); Add22_ext(&qhi,&qlo, Xredhi,Xredlo, qhi,qlo); /* reconstruction : atan(x) = atan(b[i]) + atan(x) */ Add22_ext(&atanhi,&atanlo, arctan_table[i][ATAN_BHI], arctan_table[i][ATAN_BLO], qhi,qlo); } else // no reduction needed { /* Polynomial evaluation */ Mul12_ext( &Xred2hi,&Xred2lo,x,x); /*poly eval */ q = Xred2hi*(coef_poly[5][0]+Xred2hi* (coef_poly[6][0]+Xred2hi* (coef_poly[7][0]+Xred2hi* (coef_poly[8][0])))); Add12_ext(&qhi,&qlo, coef_poly[4][0],q); #if debug printf(" xred2 = %1.50Le + %1.50Le\n", Xred2hi, Xred2lo); printf(" qhi+qlo0= %1.50Le + %1.50Le\n",qhi, qlo); #endif Mul22_ext(&qhi,&qlo, qhi,qlo, Xred2hi,Xred2lo); for(j=3;j>=0;j--) { Add22_ext(&qhi,&qlo, coef_poly[j][0], coef_poly[j][1], qhi,qlo); Mul22_ext(&qhi,&qlo, qhi,qlo, Xred2hi,Xred2lo); } Mul22_ext (&qhi,&qlo, x,0, qhi,qlo); #if debug printf(" qhi+qlo = %1.50Le + %1.50Le\n",qhi, qlo); #endif /* The sequence in the TOMS paper */ Add12_ext (&atanhi,&atanlo,x,qhi); atanlo += qlo; } #if debug printf(" %1.50Le + %1.50Le\n",atanhi, atanlo); printf(" %1.50Le\n",atanhi + atanlo); #endif BACK_TO_DOUBLE_MODE; return sign*((double) (atanhi+atanlo)); } } interval-2.1.0/src/crlibm/atan-pentium.h0000644000000000000000000004602413031036767016312 0ustar 00000000000000/* file generated by atan_ext.mpl*/ #include "double-extended.h" #ifdef WORDS_BIGENDIAN static const db_number HALFPI = {{0x3FF921FB,0x54442D18}}; #else static const db_number HALFPI = {{0x54442D18,0x3FF921FB}}; #endif #define MIN_REDUCTION_NEEDED 0.01269144369306618004077670910586377580133132772550 #define A 0 #define B 1 #define ATAN_BHI 2 #define ATAN_BLO 3 #define EPSILON 2.04221581890623872536809598138553304900554884091659e-19 #define EPSILON_NO_RED 1.56771350764719825686165002299335165493769973908433e-19 #define TWO_M_64 5.42101086242752217003726400434970855712890625000000e-20 #define TWO_10 1.02400000000000000000000000000000000000000000000000e+03 static long double const arctan_table[62][4] = { { /*a[0] */ 1.26914436930661800407767091058637758013313277255025e-02L , /*b[0] : */ 2.53869765124364010090284460990917025924318295437843e-02L , /*atan_b[0]*/ 2.53815246637655720121743178549489350359635864151642e-02L,-3.82867671985365148296195510993062067276578228375704e-22L , } ,{ /*a[1] */ 3.80906929270782389081071355032096219670426556476096e-02L , /*b[1] : */ 5.08066978456951537364380978162303748035810713190585e-02L , /*atan_b[1]*/ 5.07630493039637822849077710557486042830532824154943e-02L,-9.08476246908274392997382820602430859506166364517308e-22L , } ,{ /*a[2] */ 6.35391122156262265073608708121557700191864542424734e-02L , /*b[2] : */ 7.62920780032335878368971587848434978695877362042665e-02L , /*atan_b[2]*/ 7.61445739207162224570710207238732891710242256522179e-02L,-8.68282459278828642628371257575800957271427290973051e-22L , } ,{ /*a[3] */ 8.90697640843219566678833329168019764753902351477774e-02L , /*b[3] : */ 1.01876371166982943013764196377168858020922925788909e-01L , /*atan_b[3]*/ 1.01526098514204888296065358577191517497340100817382e-01L,2.45769122345174324242177208623096072189462913881225e-21L , } ,{ /*a[4] */ 1.14716138034642069137320417229771403756391587930350e-01L , /*b[4] : */ 1.27593346472767313573462404086011900972152943722904e-01L , /*atan_b[4]*/ 1.26907623084671710832899149679064976226072758436203e-01L,-2.78816905606569560493152971332904010388470569035556e-21L , } ,{ /*a[5] */ 1.40512327929006402335609329563511567374816039056592e-01L , /*b[5] : */ 1.53477468508642290209546821255770510106231085956097e-01L , /*atan_b[5]*/ 1.52289147632417933012007223159134383649870869703591e-01L,5.68472586734099921502541679282214217956262541061124e-21L , } ,{ /*a[6] */ 1.66493216120905508290155447580666771977220433369075e-01L , /*b[6] : */ 1.79564085612852898464876852391292061383865075185895e-01L , /*atan_b[6]*/ 1.77670672157803333676934047502538049911890993826091e-01L,2.87836193526503867133275526409685067962483884000160e-22L , } ,{ /*a[7] */ 1.92694666476959811837109742880645880397828687778289e-01L , /*b[7] : */ 2.05889628199360004388320487256347490756525075994432e-01L , /*atan_b[7]*/ 2.03052196661245300563923728287551995208559674210846e-01L,6.51289679452996937811343386488447297822880946308131e-21L , } ,{ /*a[8] */ 2.19153728611415853112422718806867132089178565966211e-01L , /*b[8] : */ 2.32491819536184162126382646285094324412057176232338e-01L , /*atan_b[8]*/ 2.28433721143217755085073027154773939173537655733526e-01L,-3.99672208045526890632745378555235922768746788959726e-21L , } ,{ /*a[9] */ 2.45908855876056427513150499868929834361055540260207e-01L , /*b[9] : */ 2.59409901651160933037411349122436377001577056944370e-01L , /*atan_b[9]*/ 2.53815245604249931191424491383479278283630264922976e-01L,7.56455309308095037743734018000284139150046029645800e-21L , } ,{ /*a[10] */ 2.73000139926648346516383602081188127403848190278175e-01L , /*b[10] : */ 2.86684879348826103653358546297091891119634965434670e-01L , /*atan_b[10]*/ 2.79196770044925012070049716306208154037449276074767e-01L,-2.52115788641577571295756044335677296592687943925995e-21L , } ,{ /*a[11] */ 3.00469565029600975134893331013376561555834254185520e-01L , /*b[11] : */ 3.14359785700871038210697100412360782684118021279573e-01L , /*atan_b[11]*/ 3.04578294465878627494048389023895140326203545555472e-01L,2.91230434592492772694189684967968754208118542272081e-22L , } ,{ /*a[12] */ 3.28361285690481774678262393368066760807466830418924e-01L , /*b[12] : */ 3.42479972833279288854397420793773676450655329972506e-01L , /*atan_b[12]*/ 3.29959818867797216379112237860660172827920177951455e-01L,9.30919107029496230740423735124228172173872279217061e-21L , } ,{ /*a[13] */ 3.56721931693259055874505029587211651856214717987120e-01L , /*b[13] : */ 3.71093432391343328410242621839820742479787440970540e-01L , /*atan_b[13]*/ 3.55341343251416258219388746852906990625342587009072e-01L,1.05238591424673141000163053238160966240559825585058e-21L , } ,{ /*a[14] */ 3.85600945252912803692499039003231191720641179521153e-01L , /*b[14] : */ 4.00251150738601814323960534358626262019242858514190e-01L , /*atan_b[14]*/ 3.80722867617518378200239248521086210530484095215797e-01L,-1.21945811870033495672278691057491669776578154458509e-20L , } ,{ /*a[15] */ 4.15050955725992341472273957165949013751986760007989e-01L , /*b[15] : */ 4.30007504761513240142210140470879764507117215543985e-01L , /*atan_b[15]*/ 4.06104391966931330934563806889237014274840475991368e-01L,2.65998962597399045630215293174401738151071787628836e-21L , } ,{ /*a[16] */ 4.45128198220858601154729507448273565784681133190970e-01L , /*b[16] : */ 4.60420705138676883411271920087948217314988141879439e-01L , /*atan_b[16]*/ 4.31485916300525867999758264370591120950848562642932e-01L,-5.15731898573788000867228224617550054933376770292499e-21L , } ,{ /*a[17] */ 4.75892983535654960900184477034957958538394330627699e-01L , /*b[17] : */ 4.91553295129659681411823587970921778378396993502975e-01L , /*atan_b[17]*/ 4.56867440619213494398158717513247495389805408194661e-01L,-1.17767132157456183414344600410550075200279622028076e-20L , } ,{ /*a[18] */ 5.07410228170177445558907530181202563476000281365126e-01L , /*b[18] : */ 5.23472714391912459942074464791517129924613982439041e-01L , /*atan_b[18]*/ 4.82248964923944120283556130646118731419846881181002e-01L,7.19228812371825763087471157928804601190451351795533e-21L , } ,{ /*a[19] */ 5.39750054761637700814449941371777322570256912129319e-01L , /*b[19] : */ 5.56251939105489768655314619660856578775565139949322e-01L , /*atan_b[19]*/ 5.07630489215703613835577873159010664494417142122984e-01L,1.95729185540933029018896909629355663993263278227122e-20L , } ,{ /*a[20] */ 5.72988475252136229153362345470036573847020634274658e-01L , /*b[20] : */ 5.89970211851368934573985880476243437442462891340256e-01L , /*atan_b[20]*/ 5.33012013495511261082417803214283935631101485341787e-01L,1.19136600379842308834059395767709777186646606458244e-20L , } ,{ /*a[21] */ 6.07208171494496323570585450136999928494042072413638e-01L , /*b[21] : */ 6.24713877348479113026710057843260415211261715739965e-01L , /*atan_b[21]*/ 5.58393537764417140017384616479390047061315272003412e-01L,1.60618754495076238470882310232850107535836684871974e-21L , } ,{ /*a[22] */ 6.42499390954343606010936791107363164108340977746831e-01L , /*b[22] : */ 6.60577343433393635583391473309333719043934252113104e-01L , /*atan_b[22]*/ 5.83775062023499415216325897359794794283516239374876e-01L,4.35252648168202510134394817934791829596865136622329e-21L , } ,{ /*a[23] */ 6.78960978813340439010418458717160717274973479682160e-01L , /*b[23] : */ 6.97664190728041029999472594225196075967687647789717e-01L , /*atan_b[23]*/ 6.09156586273861560165872319760893560669501312077045e-01L,1.16980357484588651119506030046331492746458861536954e-20L , } ,{ /*a[24] */ 7.16701572306941472702660857359560926553184289676267e-01L , /*b[24] : */ 7.36088459496464051585659649212800559325842186808586e-01L , /*atan_b[24]*/ 6.34538110516629514322711064222559684822044800966978e-01L,1.04271379790869044477776255742912246791868144138838e-20L , } ,{ /*a[25] */ 7.55840988781748681529424123295264811121247558513562e-01L , /*b[25] : */ 7.75976148518263165846948342663225162141316104680300e-01L , /*atan_b[25]*/ 6.59919634752948782276463224327756051934557035565376e-01L,-1.49707000168437254867185968448020110086938384414132e-21L , } ,{ /*a[26] */ 7.96511846049556100870729410829982316343265859222562e-01L , /*b[26] : */ 8.17466968767843598319116499295589051143906544893980e-01L , /*atan_b[26]*/ 6.85301158983981482551370301159465725504560396075249e-01L,2.26378453363027050436135458770294067540690440344722e-20L , } ,{ /*a[27] */ 8.38861462565995566516507125655143945180189448200243e-01L , /*b[27] : */ 8.60716404767067592908747625246590473579999525099993e-01L , /*atan_b[27]*/ 7.10682683210903353798835319077298322554270271211863e-01L,-2.05816942072267395453305456292103819891300383499067e-20L , } ,{ /*a[28] */ 8.83054096327761123407402015796301185982961275018315e-01L , /*b[28] : */ 9.05898149317818312002345559896809845668030902743340e-01L , /*atan_b[28]*/ 7.36064207434900725319712466721000510005978867411613e-01L,-2.01495891478093883255259057095598284567266076155582e-20L , } ,{ /*a[29] */ 9.29273595909162104414831936686333705299409223136150e-01L , /*b[29] : */ 9.53206993785724477057791359513316820084583014249802e-01L , /*atan_b[29]*/ 7.61445731657167461023643512119107867874845396727324e-01L,1.47965126934808321509456759477582856707733884056372e-20L , } ,{ /*a[30] */ 9.77726555752981243330808011822410329661495519093198e-01L , /*b[30] : */ 1.00286227737052556691944860123300031773396767675877e+00L , /*atan_b[30]*/ 7.86827255878901883601704569937140831825672648847103e-01L,-2.49482501517232918872374648277419736886605467025447e-20L , } ,{ /*a[31] */ 1.02864609206350805084140161862944784564808293337947e+00L , /*b[31] : */ 1.05511202646791504811910750172287976056395564228296e+00L , /*atan_b[31]*/ 8.12208780101303686881249188633802305048448033630848e-01L,1.96461905827059736765985245197019056188424880993332e-20L , } ,{ /*a[32] */ 1.08229638730567915046224506841117525832899403036327e+00L , /*b[32] : */ 1.11023795151925827769112675724727523629553616046906e+00L , /*atan_b[32]*/ 8.37590304325570845578666223651964628515997901558876e-01L,4.77668553328124723447016157387373681394230124469672e-21L , } ,{ /*a[33] */ 1.13897819300824750110026713455197322166401899613175e+00L , /*b[33] : */ 1.16856151675095125820440233876951197089510969817638e+00L , /*atan_b[33]*/ 8.62971828552896528467374553938995518365118186920881e-01L,2.55195648839450962773383050246911687940245767371150e-20L , } ,{ /*a[34] */ 1.19903553596581003210823783418146470970525164116258e+00L , /*b[34] : */ 1.23045136228081621770132775273154379647166933864355e+00L , /*atan_b[34]*/ 8.88353352784466024664664085541687654767883941531181e-01L,1.41663860918952637119424194776437812752208835503398e-20L , } ,{ /*a[35] */ 1.26286394722716557298308552637571192753133513841112e+00L , /*b[35] : */ 1.29633244442242035832178054244323561761120799928904e+00L , /*atan_b[35]*/ 9.13734877021453689705226403061644191438972484320402e-01L,1.35938158484232369531731558502252718011660684187715e-20L , } ,{ /*a[36] */ 1.33092063388866300837157174273995154222416258004689e+00L , /*b[36] : */ 1.36669737760087601715925514911376126292452681809664e+00L , /*atan_b[36]*/ 9.39116401265019920129202557479430879538995213806629e-01L,2.59014288448756031532855884942098995887757875539126e-20L , } ,{ /*a[37] */ 1.40373715148086175686920053249645601637145483857833e+00L , /*b[37] : */ 1.44212062317890074136100819757189128722529858350754e+00L , /*atan_b[37]*/ 9.64497925516308163957322763248924957224517129361629e-01L,2.26449827804982598409987486349767644635807688391558e-20L , } ,{ /*a[38] */ 1.48193532552453364304137000542447266699467290887996e+00L , /*b[38] : */ 1.52327639603630905871124029404839461676601786166430e+00L , /*atan_b[38]*/ 9.89879449776441974696763320684667064597306307405233e-01L,-2.05144805536593178229841247027644547853640074453000e-20L , } ,{ /*a[39] */ 1.56624743831976753224512371327739997328623336583318e+00L , /*b[39] : */ 1.61096147803441905560321856238914506320725195109844e+00L , /*atan_b[39]*/ 1.01526097404652211662976629691357288720610085874796e+00L,1.55023677688950991064710439859627109422709756104447e-21L , } ,{ /*a[40] */ 1.65754207708184680379297330985407381999685675116978e+00L , /*b[40] : */ 1.70612458293084534295767223932571710065531078726053e+00L , /*atan_b[40]*/ 1.04064249832762372913706749866236123125418089330196e+00L,-2.04790285052346263108315613096497455796579459366338e-20L , } ,{ /*a[41] */ 1.75685758736121220779123774339350281513663381064643e+00L , /*b[41] : */ 1.80990457885083358467812747472081014166178647428751e+00L , /*atan_b[41]*/ 1.06602402262079355645292555454517469115671701729298e+00L,1.35761391457454697238630079551792662430377488900508e-20L , } ,{ /*a[42] */ 1.86544587781964999316146180453643112839113228663557e+00L , /*b[42] : */ 1.92368085119253588136274679687431898855720646679401e+00L , /*atan_b[42]*/ 1.09140554692704725130852905223832749470602720975876e+00L,-4.99912973600412204300099687136900356413053111793263e-20L , } ,{ /*a[43] */ 1.98483051718814108510073200565874404907343358553592e+00L , /*b[43] : */ 2.04914055707593576686337266679061031027231365442276e+00L , /*atan_b[43]*/ 1.11678707124736675761374204984832658738014288246632e+00L,3.10946302324418261534220010195063618443711756432142e-20L , } ,{ /*a[44] */ 2.11688487740991047405177746304945089925532521933200e+00L , /*b[44] : */ 2.18836977316091156413845053574362964354804717004299e+00L , /*atan_b[44]*/ 1.14216859558269778155553675347277930995915085077286e+00L,1.40640078849491175132740694767582500364133325443408e-20L , } ,{ /*a[45] */ 2.26393888595348033211664828855751235332413889868857e+00L , /*b[45] : */ 2.34397906437763570955574998766479666301165707409382e+00L , /*atan_b[45]*/ 1.16755011993394735431150976978642574977129697799683e+00L,-3.65632431589086661411806107644207364740664894984231e-20L , } ,{ /*a[46] */ 2.42892740222016721343601364411619003865374618991270e+00L , /*b[46] : */ 2.51927965826279850135825666423983193453750573098660e+00L , /*atan_b[46]*/ 1.19293164430198149548578018253053301123145502060652e+00L,4.73277414284342449192776814622229467942243084497994e-20L , } ,{ /*a[47] */ 2.61560046981161355013387674598293220046878570571436e+00L , /*b[47] : */ 2.71853573297491153746945069524798554994049482047558e+00L , /*atan_b[47]*/ 1.21831316868762298247143988083607268890773411840200e+00L,-3.32698220688116567699867573421587503115973351391857e-20L , } ,{ /*a[48] */ 2.82882779840766997424337148646633655837718719950330e+00L , /*b[48] : */ 2.94733416149008806183065556361100334470393136143684e+00L , /*atan_b[48]*/ 1.24369469309164922975110417757704794894380029290915e+00L,-1.68084377873484618069695715707321800300036208288904e-20L , } ,{ /*a[49] */ 3.07505072362971709895160078641983571814943843203348e+00L , /*b[49] : */ 3.21314087722892193746578037849559450478409416973591e+00L , /*atan_b[49]*/ 1.26907621751479028680918009763800569089653436094522e+00L,4.38792946241904218827598608948466154796821458517843e-20L , } ,{ /*a[50] */ 3.36297230191158847569456390937866319039822318494439e+00L , /*b[50] : */ 3.52616384863255472514528832128632984677096828818321e+00L , /*atan_b[50]*/ 1.29445774195772695714951733281239398820616770535707e+00L,-3.76594892854190752512165708240508698224814967846662e-20L , } ,{ /*a[51] */ 3.70464601821196277634078130355925061867935789919545e+00L , /*b[51] : */ 3.90073973345466671345041498319972106401110067963600e+00L , /*atan_b[51]*/ 1.31983926642108904373103250851073653393541462719440e+00L,-1.42201047639732182814773447172854731688387282967153e-20L , } ,{ /*a[52] */ 4.11726034471856742723635875546283846965135299824434e+00L , /*b[52] : */ 4.35765668014057021934989921696512737980810925364494e+00L , /*atan_b[52]*/ 1.34522079090545372721809957994310025242157280445099e+00L,-3.03025789161007606745201605098058359973216476112863e-20L , } ,{ /*a[53] */ 4.62619989820138064559978332787477354097622698462263e+00L , /*b[53] : */ 4.92824409985377215716664811573366478114621713757515e+00L , /*atan_b[53]*/ 1.37060231541134407834674896475846139765053521841764e+00L,-7.07054719690683194328303436662645365432934240975534e-21L , } ,{ /*a[54] */ 5.27059285056349863215309743877271992636756004729045e+00L , /*b[54] : */ 5.66202526987798314059285864630055584711953997612000e+00L , /*atan_b[54]*/ 1.39598383993922771069504801255689585559593979269266e+00L,-9.10562671648253215988230309564473943324088366141305e-21L , } ,{ /*a[55] */ 6.11406930017863912016759088682326676363852737284111e+00L , /*b[55] : */ 6.64216890962962991200313478401540123741142451763153e+00L , /*atan_b[55]*/ 1.42136536448951557570080650449995118833612650632858e+00L,7.52628100149995238564921704233583060300504688449482e-21L , } ,{ /*a[56] */ 7.26750136287798744557578279291351829750470434026984e+00L , /*b[56] : */ 8.01990986231012476740526162544142607657704502344131e+00L , /*atan_b[56]*/ 1.44674688906256090415499565571266771257796790450811e+00L,-4.76166414128333839459064144083355125451074263289874e-20L , } ,{ /*a[57] */ 8.94284159107797415028212824375737065074638836862153e+00L , /*b[57] : */ 1.01020964280654031866926723104427310317987576127052e+01L , /*atan_b[57]*/ 1.47212841365865829579718387920550526359875220805407e+00L,-2.94511141270828048641690533512857277905398719218800e-20L , } ,{ /*a[58] */ 1.16023240149353616510359287691089007792909044742814e+01L , /*b[58] : */ 1.36206610885393049918332120107322680269135162234306e+01L , /*atan_b[58]*/ 1.49750993827804296080769691501544116363220382481813e+00L,-4.91079244887503652449167717983894414693145750621499e-20L , } ,{ /*a[59] */ 1.64826377753716879452100734158101774215127233018738e+01L , /*b[59] : */ 2.08587363260064998487369747337538683495949953794479e+01L , /*atan_b[59]*/ 1.52289146292089011330492254181478983809938654303551e+00L,5.06637296145401718980478181281990081396813033880353e-20L , } ,{ /*a[60] */ 2.83859754493342037894536299710691579018801830357118e+01L , /*b[60] : */ 4.43908820444563916793323521403635822935029864311218e+01L , /*atan_b[60]*/ 1.54827298758731452064246747468700959871057420969009e+00L,-6.87408573264970738043205172896303636687514563517111e-21L , } ,{ /*a[61] */ 1.01699461607317799313064417304063275580797148199765e+02L , /*b[61] : */ 8.27932424540746422086945344176456273999065160751343e+01L , /*atan_b[61]*/ 1.55871863366040360279231313800352154430584050714970e+00L,4.59787536942001704904414526825329883423547987397342e-20L , } , }; /*File generated by atan_exp.mpl*/ static const long double coef_poly[9][2] = { { -3.33333333333333333342368351437379203616728773340583e-01L, 9.03501810404587028364033466367082415937499719525463e-21L}, { 2.00000000000000000002710505431213761085018632002175e-01L, -2.71050543121376108505536620063805076318847614178820e-21L}, { -1.42857142857142857140921067549133027796415262855589e-01L, -1.93607530800982934641564128836546985281459293443700e-21L}, { 1.11111111111111111109605274760436799397211871109903e-01L, 1.50583635067431171387883211317314321885579450456211e-21L}, { -9.09090909090909090933731867556488737136533018201590e-02L, 0}, { 7.69230769230769230779655790120052927250071661546826e-02L, 0}, { -6.66666666666666666698289230030827212658550706692040e-02L, 0}, { 5.88235294117647058825522430464127765503690170589834e-02L, 0}, { -5.26315789473684210515616425929419364138084347359836e-02L, 0}, }; interval-2.1.0/src/crlibm/atan_accurate.c0000644000000000000000000001611413031036767016472 0ustar 00000000000000/* * Correctly rounded arctangent * * Author : Nicolas Gast (Ecole Normale Superieure), Florent de Dinechin * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include #include #include "crlibm_private.h" #include "atan_accurate.h" #include "atan_fast.h" /* * WHAT WE CAN DO : * * 1) Range reduction * * x > 0 because atan(-x) = - atan(x) * * we have built 50 intervals I(i), associated to a b(i) so that : * * For every x : * * we find the interval I(i) , as atan(x) = atan(b(i)) + atan( (x - b(i)) / (1 + x * b(i)) ) * * so that X = (x - b(i)) / (1 + x * b(i)) be in interval [ -2^(-6) , 2^(-6) ] * There is no cancellation because : * for every x in [ -2^(-6) , 2^(-6) ], * * atan(x) <= 0.01562372862 in binary 0.000001111111111 * AND for the smallest b(i) atan(b(i)) = 0.04687118592 in binary 0.00001011111111 * * * 2) Polynomial evaluation of atan(X), atan(b(i)) is tabulated. * * (-???) * Approximation error: |err| < 2^ * * * 3) Reconstruction: * * atan(x) = atan(b(i)) + atan(X) * * * 4) Rounding: * * when |x| is too big, the result is always sign(x) * Pi/2, * because Pi/2 is appromated by the biggest value smallest than Pi/2, * in order not to have an atan > Pi/2. */ static void scs_atan(scs_ptr res_scs, scs_ptr x){ scs_t X_scs, denom1_scs, denom2_scs, poly_scs, X2; scs_t atanbhihi,atanbhilo, atanblo, atanbhi, atanb; scs_t bsc_ptr; db_number db; double test; int k, i=31; scs_get_d(&db.d, x); #if EVAL_PERF crlibm_second_step_taken++; #endif /* test if x as to be reduced */ if (db.d > MIN_REDUCTION_NEEDED) { /* Compute i so that x E [a[i],a[i+1]] */ if (db.d < arctan_table[i][A].d) i-= 16; else i+=16; if (db.d < arctan_table[i][A].d) i-= 8; else i+= 8; if (db.d < arctan_table[i][A].d) i-= 4; else i+= 4; if (db.d < arctan_table[i][A].d) i-= 2; else i+= 2; if (db.d < arctan_table[i][A].d) i-= 1; else if (i<61) i+= 1; if (db.d < arctan_table[i][A].d) i-= 1; /* evaluate X = (x - b(i)) / (1 + x*b(i)) */ scs_set_d(bsc_ptr, arctan_table[i][B].d); scs_mul(denom1_scs,bsc_ptr,x); scs_add(denom2_scs,denom1_scs,SCS_ONE); scs_sub(X_scs,x,bsc_ptr); scs_div(X_scs,X_scs,denom2_scs); scs_get_d(&test,X_scs); /* Polynomial evaluation of atan(X) , X = (x-b(i)) / (1+ x*b(i)) */ scs_square(X2, X_scs); scs_set(res_scs, constant_poly_ptr[0]); for(k=1; k < 10; k++) { /* we use Horner expression */ scs_mul(res_scs, res_scs, X2); scs_add(res_scs, constant_poly_ptr[k], res_scs); } scs_mul(poly_scs, res_scs, X_scs); /* reconstruction : */ /* 1st we load atan ( b[i] ) in a scs*/ scs_set_d( atanbhihi , arctan_table[i][ATAN_BHI].d); scs_set_d( atanbhilo , arctan_table[i][ATAN_BLO].d); scs_set_d( atanblo , atan_blolo[i].d); scs_add(atanbhi,atanbhihi,atanbhilo); scs_add(atanb,atanbhi,atanblo); scs_add(res_scs,atanb, poly_scs); return; } else { /* no reduction needed */ /* Polynomial evaluation of atan(x) */ scs_square(X2, x); scs_set(res_scs, constant_poly_ptr[0]); for(k=1; k < 10; k++) { /* we use Horner expression */ scs_mul(res_scs, res_scs, X2); scs_add(res_scs, constant_poly_ptr[k], res_scs); } scs_mul(res_scs, res_scs, x); return; } } static void scs_atanpi(scs_ptr res, scs_ptr x){ scs_t at; scs_atan(at, x); scs_mul(res, at, InvPiSCS_ptr); } double scs_atan_rn(double x){ /* This function does NOT compute atan(x) correctly if it isn't * called in atan_rn() */ scs_t sc1; scs_t res_scs; db_number res; int sign =1; res.d = x; if (x < 0){ sign = -1; x *= -1; } scs_set_d(sc1, x); scs_atan(res_scs, sc1); scs_get_d(&res.d, res_scs); res.d *= sign; return res.d; } double scs_atan_rd(double x){ scs_t sc1; scs_t res_scs; db_number res; int sign = 1; res.d = x; /* Filter cases */ if (x < 0){ sign = -1; x *= -1; } scs_set_d(sc1, x); scs_atan(res_scs, sc1); if (sign == -1){ scs_get_d_pinf(&res.d, res_scs); res.d *= -1; return res.d; } else{ scs_get_d_minf(&res.d, res_scs); return res.d; } } double scs_atan_ru(double x){ scs_t sc1; scs_t res_scs; db_number res; int sign = 1; res.d = x; /* Filter cases */ if (x < 0){ sign = -1; x *= -1; } scs_set_d(sc1, x); scs_atan(res_scs, sc1); if (sign == -1){ scs_get_d_minf(&res.d, res_scs); res.d *= -1; return res.d; } else{ scs_get_d_pinf(&res.d, res_scs); return res.d; } } /************************************************************/ /******** AtanPi *******************************************/ double scs_atanpi_rn(double x){ /* This function does NOT compute atanpi(x) correctly if it isn't * called in atanpi_rn() */ scs_t sc1; scs_t res_scs; db_number res; int sign =1; res.d = x; if (x < 0){ sign = -1; x *= -1; } scs_set_d(sc1, x); scs_atanpi(res_scs, sc1); scs_get_d(&res.d, res_scs); res.d *= sign; return res.d; } double scs_atanpi_rd(double x){ scs_t sc1; scs_t res_scs; db_number res; int sign = 1; res.d = x; /* Filter cases */ if (x < 0){ sign = -1; x *= -1; } scs_set_d(sc1, x); scs_atanpi(res_scs, sc1); if (sign == -1){ scs_get_d_pinf(&res.d, res_scs); res.d *= -1; return res.d; } else{ scs_get_d_minf(&res.d, res_scs); return res.d; } } /************************************************************* ************************************************************* * ROUNDED TOWARD +INFINITY ************************************************************* *************************************************************/ double scs_atanpi_ru(double x){ scs_t sc1; scs_t res_scs; db_number res; int sign = 1; res.d = x; /* Filter cases */ if (x < 0){ sign = -1; x *= -1; } scs_set_d(sc1, x); scs_atanpi(res_scs, sc1); if (sign == -1){ scs_get_d_minf(&res.d, res_scs); res.d *= -1; return res.d; } else{ scs_get_d_pinf(&res.d, res_scs); return res.d; } } interval-2.1.0/src/crlibm/atan_accurate.h0000644000000000000000000002355213031036767016503 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" #include "atan_fast.h" /*File generated by maple/atan.mpl */ static const scs constant_poly [10]= /* ~-5.26315789473684210526315789473684210526315789473684e-02 */ {{{0x035e50d7, 0x250d7943, 0x179435e5, 0x035e50d7, 0x250d7943, 0x179435e5, 0x035e50d7, 0x250d7943}, DB_ONE, -1, -1 } , /* ~5.88235294117647058823529411764705882352941176470588e-02 */ {{0x03c3c3c3, 0x30f0f0f0, 0x3c3c3c3c, 0x0f0f0f0f, 0x03c3c3c3, 0x30f0f0f0, 0x3c3c3c3c, 0x0f0f0f0f}, DB_ONE, -1, 1 } , /* ~-6.66666666666666666666666666666666666666666666666667e-02 */ {{0x04444444, 0x11111111, 0x04444444, 0x11111111, 0x04444444, 0x11111111, 0x04444444, 0x11111111}, DB_ONE, -1, -1 } , /* ~7.69230769230769230769230769230769230769230769230769e-02 */ {{0x04ec4ec4, 0x3b13b13b, 0x04ec4ec4, 0x3b13b13b, 0x04ec4ec4, 0x3b13b13b, 0x04ec4ec4, 0x3b13b13b}, DB_ONE, -1, 1 } , /* ~-9.09090909090909090909090909090909090909090909090909e-02 */ {{0x05d1745d, 0x05d1745d, 0x05d1745d, 0x05d1745d, 0x05d1745d, 0x05d1745d, 0x05d1745d, 0x05d1745d}, DB_ONE, -1, -1 } , /* ~1.11111111111111111111111111111111111111111111111111e-01 */ {{0x071c71c7, 0x071c71c7, 0x071c71c7, 0x071c71c7, 0x071c71c7, 0x071c71c7, 0x071c71c7, 0x071c71c7}, DB_ONE, -1, 1 } , /* ~-1.42857142857142857142857142857142857142857142857143e-01 */ {{0x09249249, 0x09249249, 0x09249249, 0x09249249, 0x09249249, 0x09249249, 0x09249249, 0x09249249}, DB_ONE, -1, -1 } , /* ~2.00000000000000000000000000000000000000000000000000e-01 */ {{0x0ccccccc, 0x33333333, 0x0ccccccc, 0x33333333, 0x0ccccccc, 0x33333333, 0x0ccccccc, 0x33333333}, DB_ONE, -1, 1 } , /* ~-3.33333333333333333333333333333333333333333333333333e-01 */ {{0x15555555, 0x15555555, 0x15555555, 0x15555555, 0x15555555, 0x15555555, 0x15555555, 0x15555555}, DB_ONE, -1, -1 } , /* ~1.00000000000000000000000000000000000000000000000000e+00 */ {{0x00000001, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 } }; #define constant_poly_ptr (scs_ptr)&constant_poly static const scs InvPiSCS= {{0x145f306d, 0x327220a9, 0x13f84eaf, 0x28fa9a6e, 0x381b6c52, 0x2cc9e21c, 0x2083fca2, 0x31d5ef5d}, DB_ONE, -1, 1 } ; #define InvPiSCS_ptr (scs_ptr)(& InvPiSCS) #ifdef WORDS_BIGENDIAN static const db_number atan_blolo[62] = { /* 0 */ {{0xB8D1C5F3,0xA947CCE9}} /* -5.3484426395e-35 */, /* 1 */ {{0xB8B05943,0x3C749846}} /* -1.2299381479e-35 */, /* 2 */ {{0x38FC2F2A,0x267751FB}} /* +3.3925541143e-34 */, /* 3 */ {{0x38D44E61,0xDDA4249D}} /* +6.1106690132e-35 */, /* 4 */ {{0xB906FBFA,0xA5B245C8}} /* -5.5332673453e-34 */, /* 5 */ {{0xB8DE1E98,0x67CABE65}} /* -9.0637612563e-35 */, /* 6 */ {{0x38BD7B8F,0x45D13048}} /* +2.2180284354e-35 */, /* 7 */ {{0xB9049436,0x23AD369B}} /* -4.9542022687e-34 */, /* 8 */ {{0xB8F98586,0xF6BB1DB7}} /* -3.0720497269e-34 */, /* 9 */ {{0xB89BC985,0xCB4D6219}} /* -5.2261910438e-36 */, /* 10 */ {{0xB8C4002C,0x9C3884F4}} /* -3.0093679582e-35 */, /* 11 */ {{0x3910CBC4,0x893058D9}} /* +8.0869642604e-34 */, /* 12 */ {{0xB8F5408B,0xFF010BB5}} /* -2.5581328396e-34 */, /* 13 */ {{0xB908570F,0xB5813578}} /* -5.8596619457e-34 */, /* 14 */ {{0x39155B89,0x7E967248}} /* +1.0283294335e-33 */, /* 15 */ {{0xB8CD159A,0x2031F115}} /* -4.3761315763e-35 */, /* 16 */ {{0xB8E8D9C6,0x0FC3C81C}} /* -1.4956458040e-34 */, /* 17 */ {{0x38C0AC30,0x8219F20D}} /* +2.5086163140e-35 */, /* 18 */ {{0x38B36506,0x32EDCB95}} /* +1.4590894790e-35 */, /* 19 */ {{0xB8FD57B0,0x5932E7C2}} /* -3.5319791285e-34 */, /* 20 */ {{0x38C73827,0x91A2D916}} /* +3.4936600564e-35 */, /* 21 */ {{0xB92FE60D,0x9EC5116C}} /* -3.0717278111e-33 */, /* 22 */ {{0x3903AADF,0x6A3B8AE2}} /* +4.7347715466e-34 */, /* 23 */ {{0xB88D6A01,0x71B87C3C}} /* -2.7660872166e-36 */, /* 24 */ {{0xB8E17427,0xEA5AC8E8}} /* -1.0504584084e-34 */, /* 25 */ {{0x38F4ED52,0xF776B005}} /* +2.5190016806e-34 */, /* 26 */ {{0xB9265B23,0x75D2B05C}} /* -2.1528054385e-33 */, /* 27 */ {{0xB8DA45DA,0xAFEAB282}} /* -7.9062036715e-35 */, /* 28 */ {{0x3912EF75,0xBD16D3D4}} /* +9.1170587963e-34 */, /* 29 */ {{0x390AB3D7,0xE904B022}} /* +6.4283962392e-34 */, /* 30 */ {{0xB8EE688B,0x3F9F468B}} /* -1.8301374849e-34 */, /* 31 */ {{0xB9225DF6,0x71A98823}} /* -1.7686817787e-33 */, /* 32 */ {{0xB8CC82B0,0x522BE0F8}} /* -4.2897836993e-35 */, /* 33 */ {{0xB912AFE0,0x88BB6A0B}} /* -8.9974727841e-34 */, /* 34 */ {{0x38D4DC99,0x8640FAE5}} /* +6.2778447830e-35 */, /* 35 */ {{0xB9016FC6,0x406A343B}} /* -4.1977132916e-34 */, /* 36 */ {{0x3909804C,0x126FC74C}} /* +6.1391811422e-34 */, /* 37 */ {{0x39051033,0xE5B0956F}} /* +5.0708030720e-34 */, /* 38 */ {{0xB910CADC,0x203B114C}} /* -8.0852567814e-34 */, /* 39 */ {{0x38EFCAC7,0xF97ED36B}} /* +1.9134182531e-34 */, /* 40 */ {{0xB92464C0,0xB51D77B4}} /* -1.9638289218e-33 */, /* 41 */ {{0x391157F3,0x2D4A03DE}} /* +8.3506176591e-34 */, /* 42 */ {{0xB92BD929,0x136A8DDE}} /* -2.6816921082e-33 */, /* 43 */ {{0x390F1514,0x035DF6B3}} /* +7.4828003563e-34 */, /* 44 */ {{0xB92606EC,0x19DB7E3B}} /* -2.1211268072e-33 */, /* 45 */ {{0x393B104B,0xCDA1B51D}} /* +5.2122706777e-33 */, /* 46 */ {{0x3935FB01,0xF88A520C}} /* +4.2332900876e-33 */, /* 47 */ {{0xB9189ED1,0x1940944D}} /* -1.1854280852e-33 */, /* 48 */ {{0xB914E8F2,0x38D4794B}} /* -1.0067772791e-33 */, /* 49 */ {{0xB93DF07A,0x73581CF5}} /* -5.7661126209e-33 */, /* 50 */ {{0xB939C22F,0x727CE10C}} /* -4.9609136744e-33 */, /* 51 */ {{0xB8EF37D2,0x26E1A810}} /* -1.8788680655e-34 */, /* 52 */ {{0x391A4251,0x45155DAA}} /* +1.2643273919e-33 */, /* 53 */ {{0xB9126D2F,0xA42D0A9A}} /* -8.8720409776e-34 */, /* 54 */ {{0xB93CAF8B,0x3DFAFFA5}} /* -5.5246684074e-33 */, /* 55 */ {{0x3919C170,0xA9A35831}} /* +1.2400882522e-33 */, /* 56 */ {{0xB924C2B3,0xAE51E4B3}} /* -1.9991686511e-33 */, /* 57 */ {{0xB8DEFB7D,0x0DE98917}} /* -9.3234199178e-35 */, /* 58 */ {{0xB916EC39,0x1ABE373B}} /* -1.1036900898e-33 */, /* 59 */ {{0x391C5BA4,0x4135ADBE}} /* +1.3653868341e-33 */, /* 60 */ {{0xB9112692,0xD7179E60}} /* -8.2577511316e-34 */, /* 61 */ {{0x392F96B5,0xBCC93753}} /* +3.0418821818e-33 */, }; #else static const db_number atan_blolo[62] = { /* 0 */ {{0xA947CCE9,0xB8D1C5F3}} /* -5.3484426395e-35 */, /* 1 */ {{0x3C749846,0xB8B05943}} /* -1.2299381479e-35 */, /* 2 */ {{0x267751FB,0x38FC2F2A}} /* +3.3925541143e-34 */, /* 3 */ {{0xDDA4249D,0x38D44E61}} /* +6.1106690132e-35 */, /* 4 */ {{0xA5B245C8,0xB906FBFA}} /* -5.5332673453e-34 */, /* 5 */ {{0x67CABE65,0xB8DE1E98}} /* -9.0637612563e-35 */, /* 6 */ {{0x45D13048,0x38BD7B8F}} /* +2.2180284354e-35 */, /* 7 */ {{0x23AD369B,0xB9049436}} /* -4.9542022687e-34 */, /* 8 */ {{0xF6BB1DB7,0xB8F98586}} /* -3.0720497269e-34 */, /* 9 */ {{0xCB4D6219,0xB89BC985}} /* -5.2261910438e-36 */, /* 10 */ {{0x9C3884F4,0xB8C4002C}} /* -3.0093679582e-35 */, /* 11 */ {{0x893058D9,0x3910CBC4}} /* +8.0869642604e-34 */, /* 12 */ {{0xFF010BB5,0xB8F5408B}} /* -2.5581328396e-34 */, /* 13 */ {{0xB5813578,0xB908570F}} /* -5.8596619457e-34 */, /* 14 */ {{0x7E967248,0x39155B89}} /* +1.0283294335e-33 */, /* 15 */ {{0x2031F115,0xB8CD159A}} /* -4.3761315763e-35 */, /* 16 */ {{0x0FC3C81C,0xB8E8D9C6}} /* -1.4956458040e-34 */, /* 17 */ {{0x8219F20D,0x38C0AC30}} /* +2.5086163140e-35 */, /* 18 */ {{0x32EDCB95,0x38B36506}} /* +1.4590894790e-35 */, /* 19 */ {{0x5932E7C2,0xB8FD57B0}} /* -3.5319791285e-34 */, /* 20 */ {{0x91A2D916,0x38C73827}} /* +3.4936600564e-35 */, /* 21 */ {{0x9EC5116C,0xB92FE60D}} /* -3.0717278111e-33 */, /* 22 */ {{0x6A3B8AE2,0x3903AADF}} /* +4.7347715466e-34 */, /* 23 */ {{0x71B87C3C,0xB88D6A01}} /* -2.7660872166e-36 */, /* 24 */ {{0xEA5AC8E8,0xB8E17427}} /* -1.0504584084e-34 */, /* 25 */ {{0xF776B005,0x38F4ED52}} /* +2.5190016806e-34 */, /* 26 */ {{0x75D2B05C,0xB9265B23}} /* -2.1528054385e-33 */, /* 27 */ {{0xAFEAB282,0xB8DA45DA}} /* -7.9062036715e-35 */, /* 28 */ {{0xBD16D3D4,0x3912EF75}} /* +9.1170587963e-34 */, /* 29 */ {{0xE904B022,0x390AB3D7}} /* +6.4283962392e-34 */, /* 30 */ {{0x3F9F468B,0xB8EE688B}} /* -1.8301374849e-34 */, /* 31 */ {{0x71A98823,0xB9225DF6}} /* -1.7686817787e-33 */, /* 32 */ {{0x522BE0F8,0xB8CC82B0}} /* -4.2897836993e-35 */, /* 33 */ {{0x88BB6A0B,0xB912AFE0}} /* -8.9974727841e-34 */, /* 34 */ {{0x8640FAE5,0x38D4DC99}} /* +6.2778447830e-35 */, /* 35 */ {{0x406A343B,0xB9016FC6}} /* -4.1977132916e-34 */, /* 36 */ {{0x126FC74C,0x3909804C}} /* +6.1391811422e-34 */, /* 37 */ {{0xE5B0956F,0x39051033}} /* +5.0708030720e-34 */, /* 38 */ {{0x203B114C,0xB910CADC}} /* -8.0852567814e-34 */, /* 39 */ {{0xF97ED36B,0x38EFCAC7}} /* +1.9134182531e-34 */, /* 40 */ {{0xB51D77B4,0xB92464C0}} /* -1.9638289218e-33 */, /* 41 */ {{0x2D4A03DE,0x391157F3}} /* +8.3506176591e-34 */, /* 42 */ {{0x136A8DDE,0xB92BD929}} /* -2.6816921082e-33 */, /* 43 */ {{0x035DF6B3,0x390F1514}} /* +7.4828003563e-34 */, /* 44 */ {{0x19DB7E3B,0xB92606EC}} /* -2.1211268072e-33 */, /* 45 */ {{0xCDA1B51D,0x393B104B}} /* +5.2122706777e-33 */, /* 46 */ {{0xF88A520C,0x3935FB01}} /* +4.2332900876e-33 */, /* 47 */ {{0x1940944D,0xB9189ED1}} /* -1.1854280852e-33 */, /* 48 */ {{0x38D4794B,0xB914E8F2}} /* -1.0067772791e-33 */, /* 49 */ {{0x73581CF5,0xB93DF07A}} /* -5.7661126209e-33 */, /* 50 */ {{0x727CE10C,0xB939C22F}} /* -4.9609136744e-33 */, /* 51 */ {{0x26E1A810,0xB8EF37D2}} /* -1.8788680655e-34 */, /* 52 */ {{0x45155DAA,0x391A4251}} /* +1.2643273919e-33 */, /* 53 */ {{0xA42D0A9A,0xB9126D2F}} /* -8.8720409776e-34 */, /* 54 */ {{0x3DFAFFA5,0xB93CAF8B}} /* -5.5246684074e-33 */, /* 55 */ {{0xA9A35831,0x3919C170}} /* +1.2400882522e-33 */, /* 56 */ {{0xAE51E4B3,0xB924C2B3}} /* -1.9991686511e-33 */, /* 57 */ {{0x0DE98917,0xB8DEFB7D}} /* -9.3234199178e-35 */, /* 58 */ {{0x1ABE373B,0xB916EC39}} /* -1.1036900898e-33 */, /* 59 */ {{0x4135ADBE,0x391C5BA4}} /* +1.3653868341e-33 */, /* 60 */ {{0xD7179E60,0xB9112692}} /* -8.2577511316e-34 */, /* 61 */ {{0xBCC93753,0x392F96B5}} /* +3.0418821818e-33 */, }; #endif /* WORDS_BIGENDIAN */ interval-2.1.0/src/crlibm/atan_fast.c0000644000000000000000000002651313031036767015644 0ustar 00000000000000/* * Correctly rounded arctangent * * Author : Nicolas Gast (Ecole Normale Superieure), Florent de Dinechin * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "atan_fast.h" extern double scs_atan_rn(double); extern double scs_atan_rd(double); extern double scs_atan_ru(double); extern double scs_atanpi_rn(double); extern double scs_atanpi_rd(double); extern double scs_atanpi_ru(double); static void atan_quick(double *atanhi,double *atanlo, int *index_of_e, double x) { double tmphi,tmplo, x0hi,x0lo; double q,Xred2,x2; double Xredhi,Xredlo; double xmBihi, xmBilo, tmphi2, tmplo2, atanlolo; int i; if (x > MIN_REDUCTION_NEEDED) /* test if reduction is necessary : */ { /* * 1) Argument reduction : * * tan(x) = tan( b(i) ) + tan ( (x-b(i)) / (1+x*b(i))) * * 6.3 * we choose 62 b(i) so that (x-b(i)) / (1+x*b(i)) < 2^ */ if (x > arctan_table[61][B].d) { i=61; Add12( xmBihi , xmBilo , x , -arctan_table[61][B].d); } else { /* compute i so that a[i] < x < a[i+1] */ i=31; if (x < arctan_table[i][A].d) i-= 16; else i+=16; if (x < arctan_table[i][A].d) i-= 8; else i+= 8; if (x < arctan_table[i][A].d) i-= 4; else i+= 4; if (x < arctan_table[i][A].d) i-= 2; else i+= 2; if (x < arctan_table[i][A].d) i-= 1; else i+= 1; if (x < arctan_table[i][A].d) i-= 1; xmBihi = x-arctan_table[i][B].d; xmBilo = 0.0; } /* we now compute Xred = ( x-b[i] ) / ( 1 + x*b[i] ) * * def : x0 := 1+x*b[i] * * 1st we compute an approximation of y = 1/x0 * then we compute a better approx x' = y*(2-x0*y) * we can proove that : * if y = 1/x0*(1+e) * then x' = 1/x0 * (1-e^2) * */ Mul12(&tmphi,&tmplo, x, arctan_table[i][B].d); if (x > 1) Add22(&x0hi,&x0lo,tmphi,tmplo, 1.0,0.0); else {Add22( &x0hi , &x0lo , 1.0,0.0,tmphi,tmplo);} Div22( &Xredhi, &Xredlo, xmBihi , xmBilo , x0hi,x0lo); /* Polynomial evaluation : * * 1rt compute Q(x^2) = (1 - x^2/3 + ...) * then P(x) = x * Q(x^2) * */ Xred2 = Xredhi*Xredhi; q = Xred2*(coef_poly[3]+Xred2* (coef_poly[2]+Xred2* (coef_poly[1]+Xred2* coef_poly[0]))) ; /* reconstruction : atan(x) = atan(b[i]) + atan(x) */ atanlolo = (Xredlo + arctan_table[i][ATAN_BLO].d); atanlolo += Xredhi*q; Add12( tmphi2, tmplo2, arctan_table[i][ATAN_BHI].d, Xredhi); Add12( *atanhi, *atanlo, tmphi2, (tmplo2+atanlolo)); if (i<10) *index_of_e = 0; else *index_of_e = 1; } else // no reduction needed { /* Polynomial evaluation : * * 1rt compute Q(x^2) = (1 - x^2/3 + ...) * then P(x) = x * Q(x^2) * */ x2 = x*x; q = x2*(coef_poly[3]+x2* (coef_poly[2]+x2* (coef_poly[1]+x2* coef_poly[0]))) ; Add12(*atanhi,*atanlo, x , x*q); *index_of_e = 2; } } extern double atan_rn(double x) { double atanhi,atanlo; int index_of_e; double sign; db_number x_db; int absxhi; x_db.d = x; absxhi = x_db.i[HI] & 0x7fffffff; if(x_db.i[HI] & 0x80000000){ x_db.i[HI] = absxhi; sign =-1; } else sign=1; /* Filter cases */ if ( absxhi >= 0x43500000) /* x >= 2^54 */ { if ((absxhi > 0x7ff00000) || ((absxhi == 0x7ff00000) && (x_db.i[LO] != 0))) return x+x; /* NaN */ else return sign*HALFPI.d; /* atan(+/-infty) = +/- Pi/2 */ } if ( absxhi < 0x3E400000 ) return x; /* x<2^-27 then atan(x) =~ x */ atan_quick(&atanhi, &atanlo,&index_of_e , x_db.d); if (atanhi == (atanhi + (atanlo*rncst[index_of_e]))) return sign*atanhi; else { /* more accuracy is needed , lauch accurate phase */ return sign*scs_atan_rn(x_db.d); } } extern double atan_rd(double x) { double atanhi,atanlo; int index_of_e; double maxepsilon; db_number x_db; int absxhi; int sign; x_db.d = x; absxhi = x_db.i[HI] & 0x7FFFFFFF; if(x_db.i[HI] & 0x80000000){ x_db.i[HI] = absxhi; sign =-1; } else sign=1; /* Filter cases */ if ( absxhi >= 0x43500000) /* x >= 2^54 */ { if ((absxhi > 0x7ff00000) || ((absxhi == 0x7ff00000) && (x_db.i[LO] != 0))) return x+x; /* NaN */ else{ if (sign>0) return HALFPI.d; else return -HALFPI_TO_PLUS_INFINITY.d; /* atan(x) = Pi/2 */ } } else if ( absxhi < 0x3E400000 ) {if (sign>0) {if(x==0) return x; else x_db.l--; return x_db.d; } else return x; } atan_quick(&atanhi, &atanlo,&index_of_e, x_db.d); maxepsilon = epsilon[index_of_e]; atanhi = sign*atanhi; atanlo = sign*atanlo; /* Rounding test to - infinity */ TEST_AND_RETURN_RD(atanhi, atanlo, maxepsilon); /* if the previous block didn't return a value, launch accurate phase */ return scs_atan_rd(sign*x_db.d); } extern double atan_ru(double x) { double atanhi,atanlo; int index_of_e; int sign; double maxepsilon; db_number x_db; int absxhi; x_db.d = x; absxhi = x_db.i[HI] & 0x7FFFFFFF; if (x_db.i[HI] & 0x80000000){ sign = -1; x_db.i[HI] = absxhi; } else sign = 1; /* Filter cases */ if ( absxhi >= 0x43500000) /* x >= 2^54 */ { if ((absxhi > 0x7ff00000) || ((absxhi == 0x7ff00000) && (x_db.i[LO] != 0))) return x+x; /* NaN */ else { if (sign>0) return HALFPI_TO_PLUS_INFINITY.d; else return -HALFPI.d; /* atan(x) = Pi/2 */ } } if ( absxhi < 0x3E400000 ){ if(x==0) return x; if (sign<0) { x_db.l--; return -x_db.d; } else return x; } /* x<2^-27 then atan(x) =~ x */ atan_quick(&atanhi, &atanlo, &index_of_e, x_db.d); maxepsilon = epsilon[index_of_e]; atanhi = sign*atanhi; atanlo = sign*atanlo; TEST_AND_RETURN_RU(atanhi, atanlo, maxepsilon); /* if the previous block didn't return a value, launch accurate phase */ return scs_atan_ru(x); } extern double atan_rz(double x) { if (x>0) return atan_rd(x); else return atan_ru(x); } /************************************************************* ************************************************************* * AtanPi * ************************************************************* *************************************************************/ extern double atanpi_rn(double x) { double atanhi,atanlo,atanpihi,atanpilo; int index_of_e; double sign; db_number x_db; int absxhi; x_db.d = x; absxhi = x_db.i[HI] & 0x7fffffff; if(x_db.i[HI] & 0x80000000){ x_db.i[HI] = absxhi; sign =-1; } else sign=1; /* Filter cases */ if ( absxhi >= 0x43500000) /* x >= 2^54 */ { if ((absxhi > 0x7ff00000) || ((absxhi == 0x7ff00000) && (x_db.i[LO] != 0))) return x+x; /* NaN */ else return sign*0.5; /* atan(+/-infty) = +/- Pi/2 */ } if ( absxhi < 0x3E400000 ) return sign*scs_atanpi_rn(x_db.d); /* TODO optim here */ atan_quick(&atanhi, &atanlo,&index_of_e , x_db.d); Mul22(&atanpihi,&atanpilo, INVPIH, INVPIL, atanhi,atanlo); if (atanpihi == (atanpihi + (atanpilo*rncst[index_of_e]))) return sign*atanpihi; else /* more accuracy is needed , lauch accurate phase */ return sign*scs_atanpi_rn(x_db.d); } extern double atanpi_rd(double x) { double atanhi,atanlo,atanpihi,atanpilo; int index_of_e; double maxepsilon; db_number x_db; int absxhi; int sign; x_db.d = x; absxhi = x_db.i[HI] & 0x7FFFFFFF; if(x_db.i[HI] & 0x80000000){ x_db.i[HI] = absxhi; sign =-1; } else sign=1; /* Filter cases */ if ( absxhi >= 0x43500000) /* x >= 2^54 */ { if ((absxhi > 0x7ff00000) || ((absxhi == 0x7ff00000) && (x_db.i[LO] != 0))) return x+x; /* NaN */ else{ if (sign>0) return 0.5; /* Or should it be 0.4999999999999999444888487687421729788184165954589843750; nextdown(0.5) */ else return -0.5; /* atan(infty) = Pi/2 */ } } else if ( absxhi < 0x3E400000 ) { if(x==0.0) return x; /* signed */ else return scs_atanpi_rd(sign*x_db.d); /* TODO optim here */ } atan_quick(&atanhi, &atanlo,&index_of_e, x_db.d); Mul22(&atanpihi,&atanpilo, INVPIH, INVPIL, atanhi,atanlo); maxepsilon = epsilon[index_of_e]; atanpihi = sign*atanpihi; atanpilo = sign*atanpilo; /* Rounding test to - infinity */ TEST_AND_RETURN_RD(atanpihi, atanpilo, maxepsilon); /* if the previous block didn't return a value, launch accurate phase */ return scs_atanpi_rd(sign*x_db.d); } extern double atanpi_ru(double x) { double atanhi,atanlo,atanpihi,atanpilo; int index_of_e; int sign; double maxepsilon; db_number x_db; int absxhi; x_db.d = x; absxhi = x_db.i[HI] & 0x7FFFFFFF; if (x_db.i[HI] & 0x80000000){ sign = -1; x_db.i[HI] = absxhi; } else sign = 1; /* Filter cases */ if ( absxhi >= 0x43500000) /* x >= 2^54 */ { if ((absxhi > 0x7ff00000) || ((absxhi == 0x7ff00000) && (x_db.i[LO] != 0))) return x+x; /* NaN */ else { if (sign>0) return 0.5; else return - 0.5; } } if ( absxhi < 0x3E400000 ) { if(x==0.0) return x; /* signed */ else return scs_atanpi_ru(x); } atan_quick(&atanhi, &atanlo, &index_of_e, x_db.d); Mul22(&atanpihi,&atanpilo, INVPIH, INVPIL, atanhi,atanlo); maxepsilon = epsilon[index_of_e]; atanpihi = sign*atanpihi; atanpilo = sign*atanpilo; TEST_AND_RETURN_RU(atanpihi, atanpilo, maxepsilon); /* if the previous block didn't return a value, launch accurate phase */ return scs_atanpi_ru(x); } extern double atanpi_rz(double x) { if (x>0) return atanpi_rd(x); else return atanpi_ru(x); } interval-2.1.0/src/crlibm/atan_fast.h0000644000000000000000000010160113031036767015641 0ustar 00000000000000 /*File generated by maple/atan.mpl */ #ifndef _ATAN_FAST_H #define _ATAN_FAST_H #include "crlibm.h" #include "crlibm_private.h" #ifdef WORDS_BIGENDIAN static const db_number HALFPI = {{0x3FF921FB,0x54442D18}};static const db_number HALFPI_TO_PLUS_INFINITY = {{0x3FF921FB,0x54442D19}}; #else static const db_number HALFPI = {{0x54442D18,0x3FF921FB}};static const db_number HALFPI_TO_PLUS_INFINITY = {{0x54442D19,0x3FF921FB}}; #endif #define MIN_REDUCTION_NEEDED 0.01269144369306618004077670910586377580133132772550 #define INVPIH 0.31830988618379069121644420192751567810773849487305 #define INVPIL -0.00000000000000001967867667518248588189519091409181 #define nb_of_ai 62 #define nb_of_bi 62 static const double rncst[4] ={ 1.00108178765940960655050071055243374002677613873338 , /* i<10 */ 1.00005232457100223306383112145248847898875939835839 , /* i>10 */ 1.00177430465884899885886845639867196876576265849646 , /* e > 2^-10 */ 1.00001038174963923723172604569348623337721036178939 , /* e < 2^-10 */ }; static const double epsilon[4] ={ 5.98811545469121308132334292226294391299405661608483e-20 , 2.85148356343799927177205125935801754271662806490715e-21 , 9.82484875894815915914535124879847312836985338769278e-20 , 5.23355329168770007392834621113547073694289911517614e-22 , }; #define DEGREE 4 static double const coef_poly[4] = { /* coef for degree 9 */ 0.11111111111111110494320541874913033097982406616211, /* coef for degree 7 */ -0.14285714285714284921269268124888185411691665649414, /* coef for degree 5 */ 0.20000000000000001110223024625156540423631668090820, /* coef for degree 3 */ -0.33333333333333331482961625624739099293947219848633, }; #define A 0 #define B 1 #define ATAN_BHI 2 #define ATAN_BLO 3 #ifdef WORDS_BIGENDIAN /* limits of the intervals [a[i],b[i]] */ static db_number const arctan_table[62][4] = { { /*a[0] */ {{0x3F89FDF8,0xBCCE533D}} /* +1.2691443693e-02 */ , /*b[0] : */ {{0x3F99FF0B,0x27760007}} /* +2.5386976512e-02 */ , /*atan_b[0]*/ {{0x3F99FD9D,0x4969F96C}} /* +2.5381524664e-02 */,{{0xBC301997,0x750685EA}} /* -8.7278097631e-19 */ , } ,{ /*a[1] */ {{0x3FA3809F,0x90CEBC31}} /* +3.8090692927e-02 */ , /*b[1] : */ {{0x3FAA0355,0xE3547CC2}} /* +5.0806697846e-02 */ , /*atan_b[1]*/ {{0x3FA9FD9D,0x4936262D}} /* +5.0763049304e-02 */,{{0xBC4C1F96,0x3A2D0F59}} /* -3.0491436238e-18 */ , } ,{ /*a[2] */ {{0x3FB04419,0x68FBA526}} /* +6.3539112216e-02 */ , /*b[2] : */ {{0x3FB387E0,0xABF7BFB9}} /* +7.6292078003e-02 */ , /*atan_b[2]*/ {{0x3FB37E35,0xF6C1E06C}} /* +7.6144573921e-02 */,{{0xBC556710,0x8378E024}} /* -4.6409481568e-18 */ , } ,{ /*a[3] */ {{0x3FB6CD46,0xABCDFA25}} /* +8.9069764084e-02 */ , /*b[3] : */ {{0x3FBA1491,0xE265B8AB}} /* +1.0187637117e-01 */ , /*atan_b[3]*/ {{0x3FB9FD9D,0x48CF1996}} /* +1.0152609851e-01 */,{{0xBC4360DC,0xB73BED3C}} /* -2.1010068528e-18 */ , } ,{ /*a[4] */ {{0x3FBD5E09,0x6D2EA546}} /* +1.1471613803e-01 */ , /*b[4] : */ {{0x3FC054FA,0x9124D46B}} /* +1.2759334647e-01 */ , /*atan_b[4]*/ {{0x3FC03E82,0x4D618156}} /* +1.2690762308e-01 */,{{0x3C62604E,0x49A86344}} /* +7.9694040325e-18 */ , } ,{ /*a[5] */ {{0x3FC1FC4E,0xD691E891}} /* +1.4051232793e-01 */ , /*b[5] : */ {{0x3FC3A526,0x51F57043}} /* +1.5347746851e-01 */ , /*atan_b[5]*/ {{0x3FC37E35,0xF64EF83E}} /* +1.5228914763e-01 */,{{0x3C5F2B13,0xB4A55EA6}} /* +6.7585410867e-18 */ , } ,{ /*a[6] */ {{0x3FC54FA6,0x531F610B}} /* +1.6649321612e-01 */ , /*b[6] : */ {{0x3FC6FBF4,0xB99F2601}} /* +1.7956408561e-01 */ , /*atan_b[6]*/ {{0x3FC6BDE9,0x9F302425}} /* +1.7767067216e-01 */,{{0xBC23B62A,0xC4D330CE}} /* -5.3428372026e-19 */ , } ,{ /*a[7] */ {{0x3FC8AA38,0x0550EAF1}} /* +1.9269466648e-01 */ , /*b[7] : */ {{0x3FCA5A97,0x61D9D63D}} /* +2.0588962820e-01 */ , /*atan_b[7]*/ {{0x3FC9FD9D,0x48053FC8}} /* +2.0305219666e-01 */,{{0xBC67A12C,0x98474AF1}} /* -1.0247699700e-17 */ , } ,{ /*a[8] */ {{0x3FCC0D3A,0xB8975BD9}} /* +2.1915372861e-01 */ , /*b[8] : */ {{0x3FCDC24A,0xBCBF6ABC}} /* +2.3249181954e-01 */ , /*atan_b[8]*/ {{0x3FCD3D50,0xF0CE8DD9}} /* +2.2843372114e-01 */,{{0x3C6EF257,0x3A31D353}} /* +1.3420967238e-17 */ , } ,{ /*a[9] */ {{0x3FCF79F0,0xFEE46885}} /* +2.4590885588e-01 */ , /*b[9] : */ {{0x3FD09A2B,0xFCF66B85}} /* +2.5940990165e-01 */ , /*atan_b[9]*/ {{0x3FD03E82,0x4CC62C6B}} /* +2.5381524560e-01 */,{{0x3C5DA594,0x95C6E482}} /* +6.4286246635e-18 */ , } ,{ /*a[10] */ {{0x3FD178D5,0x943274CA}} /* +2.7300013993e-01 */ , /*b[10] : */ {{0x3FD2590B,0x8943E603}} /* +2.8668487935e-01 */ , /*atan_b[10]*/ {{0x3FD1DE5C,0x211F7969}} /* +2.7919677004e-01 */,{{0x3C3C4E87,0x0B01EF44}} /* +1.5345118889e-18 */ , } ,{ /*a[11] */ {{0x3FD33AE4,0xB2CFB5F7}} /* +3.0046956503e-01 */ , /*b[11] : */ {{0x3FD41E78,0x81B0D1DF}} /* +3.1435978570e-01 */ , /*atan_b[11]*/ {{0x3FD37E35,0xF5735AA1}} /* +3.0457829447e-01 */,{{0xBC772D05,0x8D437AE9}} /* -2.0101859382e-17 */ , } ,{ /*a[12] */ {{0x3FD503DF,0x0DD40A5B}} /* +3.2836128569e-01 */ , /*b[12] : */ {{0x3FD5EB31,0x1EB6A659}} /* +3.4247997283e-01 */ , /*atan_b[12]*/ {{0x3FD51E0F,0xC9C20060}} /* +3.2995981887e-01 */,{{0xBC6C0F53,0x20BA7A7B}} /* -1.2169025414e-17 */ , } ,{ /*a[13] */ {{0x3FD6D488,0x3998DD14}} /* +3.5672193169e-01 */ , /*b[13] : */ {{0x3FD7BFFE,0xAAF865B1}} /* +3.7109343239e-01 */ , /*atan_b[13]*/ {{0x3FD6BDE9,0x9E0B9E67}} /* +3.5534134325e-01 */,{{0x3C797792,0x870D5E8E}} /* +2.2089170409e-17 */ , } ,{ /*a[14] */ {{0x3FD8ADAF,0x964ABFA5}} /* +3.8560094525e-01 */ , /*b[14] : */ {{0x3FD99DB7,0x00A6F44E}} /* +4.0025115074e-01 */ , /*atan_b[14]*/ {{0x3FD85DC3,0x72506BCA}} /* +3.8072286762e-01 */,{{0x3C720BD1,0x43A1CBA3}} /* +1.5652550322e-17 */ , } ,{ /*a[15] */ {{0x3FDA9031,0xE241114E}} /* +4.1505095573e-01 */ , /*b[15] : */ {{0x3FDB853E,0x327F0E90}} /* +4.3000750476e-01 */ , /*atan_b[15]*/ {{0x3FD9FD9D,0x4690A2C8}} /* +4.0610439197e-01 */,{{0xBC6A048E,0xEFB73034}} /* -1.1283424731e-17 */ , } ,{ /*a[16] */ {{0x3FDC7CFA,0xFB78B41D}} /* +4.4512819822e-01 */ , /*b[16] : */ {{0x3FDD7788,0x67BE333A}} /* +4.6042070514e-01 */ , /*atan_b[16]*/ {{0x3FDB9D77,0x1ACC80A6}} /* +4.3148591630e-01 */,{{0x3C6A9BD7,0xE8FB154D}} /* +1.1539711581e-17 */ , } ,{ /*a[17] */ {{0x3FDE7507,0xD82B9DC6}} /* +4.7589298354e-01 */ , /*b[17] : */ {{0x3FDF759B,0xF3B4AACC}} /* +4.9155329513e-01 */ , /*atan_b[17]*/ {{0x3FDD3D50,0xEF044589}} /* +4.5686744062e-01 */,{{0x3C575857,0x09E8652E}} /* +5.0621568797e-18 */ , } ,{ /*a[18] */ {{0x3FE03CB4,0x5FF4B2AB}} /* +5.0741022817e-01 */ , /*b[18] : */ {{0x3FE0C049,0xD9952BEF}} /* +5.2347271439e-01 */ , /*atan_b[18]*/ {{0x3FDEDD2A,0xC338344A}} /* +4.8224896492e-01 */,{{0x3C23C787,0x81513292}} /* +5.3612202011e-19 */ , } ,{ /*a[19] */ {{0x3FE145A1,0xE826E4EA}} /* +5.3975005476e-01 */ , /*b[19] : */ {{0x3FE1CCD0,0xDDD96DE0}} /* +5.5625193911e-01 */ , /*atan_b[19]*/ {{0x3FE03E82,0x4BB44923}} /* +5.0763048922e-01 */,{{0x3C8CAF01,0x49DF0A58}} /* +4.9758137561e-17 */ , } ,{ /*a[20] */ {{0x3FE255EB,0xED462BAC}} /* +5.7298847525e-01 */ , /*b[20] : */ {{0x3FE2E109,0x35B0819C}} /* +5.8997021185e-01 */ , /*atan_b[20]*/ {{0x3FE10E6F,0x35CAD39D}} /* +5.3301201350e-01 */,{{0x3C45DB33,0x0D1EB36B}} /* +2.3696591272e-18 */ , } ,{ /*a[21] */ {{0x3FE36E3F,0xD4CDD9AC}} /* +6.0720817149e-01 */ , /*b[21] : */ {{0x3FE3FDA7,0xF51235D9}} /* +6.2471387735e-01 */ , /*atan_b[21]*/ {{0x3FE1DE5C,0x1FDFDE84}} /* +5.5839353776e-01 */,{{0x3C86FBEF,0xD3921CA6}} /* +3.9871106783e-17 */ , } ,{ /*a[22] */ {{0x3FE48F5A,0xE1FB2991}} /* +6.4249939095e-01 */ , /*b[22] : */ {{0x3FE52373,0x18D0CCB0}} /* +6.6057734343e-01 */ , /*atan_b[22]*/ {{0x3FE2AE49,0x09F38FC9}} /* +5.8377506202e-01 */,{{0xBC84BBB5,0x058084C6}} /* -3.5966422408e-17 */ , } ,{ /*a[23] */ {{0x3FE5BA0C,0x5FE86E27}} /* +6.7896097881e-01 */ , /*b[23] : */ {{0x3FE65343,0xDA588D41}} /* +6.9766419073e-01 */ , /*atan_b[23]*/ {{0x3FE37E35,0xF4060E3D}} /* +6.0915658627e-01 */,{{0x3BF6235C,0xAE25B9B7}} /* +7.5006911959e-20 */ , } ,{ /*a[24] */ {{0x3FE6EF38,0x22C19A5D}} /* +7.1670157231e-01 */ , /*b[24] : */ {{0x3FE78E09,0x629002BC}} /* +7.3608845950e-01 */ , /*atan_b[24]*/ {{0x3FE44E22,0xDE17817F}} /* +6.3453811052e-01 */,{{0xBC85F46E,0x1A6D25E3}} /* -3.8085515717e-17 */ , } ,{ /*a[25] */ {{0x3FE82FD9,0x70F967BD}} /* +7.5584098878e-01 */ , /*b[25] : */ {{0x3FE8D4CB,0xEE8B9555}} /* +7.7597614852e-01 */ , /*atan_b[25]*/ {{0x3FE51E0F,0xC82811DC}} /* +6.5991963475e-01 */,{{0xBC81CCF7,0xFCB9720C}} /* -3.0879221028e-17 */ , } ,{ /*a[26] */ {{0x3FE97D06,0x69351A0D}} /* +7.9651184605e-01 */ , /*b[26] : */ {{0x3FEA28B0,0x7D0D616A}} /* +8.1746696877e-01 */ , /*atan_b[26]*/ {{0x3FE5EDFC,0xB237E838}} /* +6.8530115898e-01 */,{{0xBC833EA8,0xF8F29048}} /* -3.3384347049e-17 */ , } ,{ /*a[27] */ {{0x3FEAD7F3,0xFE730FCD}} /* +8.3886146257e-01 */ , /*b[27] : */ {{0x3FEB8AFD,0x21335E3D}} /* +8.6071640477e-01 */ , /*atan_b[27]*/ {{0x3FE6BDE9,0x9C472DF1}} /* +7.1068268321e-01 */,{{0x3C5E8127,0x80DED249}} /* +6.6146109909e-18 */ , } ,{ /*a[28] */ {{0x3FEC41FA,0xAA0A733E}} /* +8.8305409633e-01 */ , /*b[28] : */ {{0x3FECFD1E,0x1D9A7669}} /* +9.0589814932e-01 */ , /*atan_b[28]*/ {{0x3FE78DD6,0x86560CC5}} /* +7.3606420743e-01 */,{{0xBC7E962F,0x9396D511}} /* -2.6529701578e-17 */ , } ,{ /*a[29] */ {{0x3FEDBC9B,0xFAEEEADF}} /* +9.2927359591e-01 */ , /*b[29] : */ {{0x3FEE80AB,0xF41419E7}} /* +9.5320699379e-01 */ , /*atan_b[29]*/ {{0x3FE85DC3,0x7064AEB4}} /* +7.6144573166e-01 */,{{0x3C77C0FC,0x5225ACD1}} /* +2.0603180716e-17 */ , } ,{ /*a[30] */ {{0x3FEF4989,0x33AC790A}} /* +9.7772655575e-01 */ , /*b[30] : */ {{0x3FF00BB9,0x50BB2D02}} /* +1.0028622774e+00 */ , /*atan_b[30]*/ {{0x3FE92DB0,0x5A733DE9}} /* +7.8682725588e-01 */,{{0xBC6598C9,0xA318D041}} /* -9.3661305872e-18 */ , } ,{ /*a[31] */ {{0x3FF07555,0x9AC922B4}} /* +1.0286460921e+00 */ , /*b[31] : */ {{0x3FF0E1BD,0x25F4BC57}} /* +1.0551120265e+00 */ , /*atan_b[31]*/ {{0x3FE9FD9D,0x4481E499}} /* +8.1220878010e-01 */,{{0xBC82E89F,0x9464A40D}} /* -3.2801339756e-17 */ , } ,{ /*a[32] */ {{0x3FF15116,0x0440E8D3}} /* +1.0822963873e+00 */ , /*b[32] : */ {{0x3FF1C388,0xDEC8DA1A}} /* +1.1102379515e+00 */ , /*atan_b[32]*/ {{0x3FEACD8A,0x2E90CCEA}} /* +8.3759030433e-01 */,{{0x3C60B8DB,0xFE4AC33B}} /* +7.2520578222e-18 */ , } ,{ /*a[33] */ {{0x3FF23941,0x329D3DD8}} /* +1.1389781930e+00 */ , /*b[33] : */ {{0x3FF2B26D,0x8F9CF3AD}} /* +1.1685615168e+00 */ , /*atan_b[33]*/ {{0x3FEB9D77,0x18A020D8}} /* +8.6297182855e-01 */,{{0x3C714EA3,0x43DDC7EE}} /* +1.5011584621e-17 */ , } ,{ /*a[34] */ {{0x3FF32F3F,0xE2DB7094}} /* +1.1990355360e+00 */ , /*b[34] : */ {{0x3FF3AFED,0xC485093A}} /* +1.2304513623e+00 */ , /*atan_b[34]*/ {{0x3FEC6D64,0x02B00A17}} /* +8.8835335278e-01 */,{{0x3C5CF722,0xC1E56981}} /* +6.2808643065e-18 */ , } ,{ /*a[35] */ {{0x3FF434B0,0xD38A35D7}} /* +1.2628639472e+00 */ , /*b[35] : */ {{0x3FF4BDC7,0x16D89BC7}} /* +1.2963324444e+00 */ , /*atan_b[35]*/ {{0x3FED3D50,0xECC0B1F8}} /* +9.1373487702e-01 */,{{0x3C8FFD9A,0xC689AE1B}} /* +5.5494919315e-17 */ , } ,{ /*a[36] */ {{0x3FF54B73,0x6F41F96D}} /* +1.3309206339e+00 */ , /*b[36] : */ {{0x3FF5DDFE,0x11C53212}} /* +1.3666973776e+00 */ , /*atan_b[36]*/ {{0x3FEE0D3D,0xD6D24151}} /* +9.3911640126e-01 */,{{0xBC654F0F,0xC830B564}} /* -9.2412338910e-18 */ , } ,{ /*a[37] */ {{0x3FF675B5,0x165CA5E1}} /* +1.4037371515e+00 */ , /*b[37] : */ {{0x3FF712ED,0x13170C5B}} /* +1.4421206232e+00 */ , /*atan_b[37]*/ {{0x3FEEDD2A,0xC0E4E05B}} /* +9.6449792552e-01 */,{{0xBC8FEAC3,0xBF676FFE}} /* -5.5367254830e-17 */ , } ,{ /*a[38] */ {{0x3FF7B601,0xD0DEA3C6}} /* +1.4819353255e+00 */ , /*b[38] : */ {{0x3FF85F57,0x11FBEA40}} /* +1.5232763960e+00 */ , /*atan_b[38]*/ {{0x3FEFAD17,0xAAF8B69E}} /* +9.8987944978e-01 */,{{0x3C8B8DA3,0xE69F3AF7}} /* +4.7797325436e-17 */ , } ,{ /*a[39] */ {{0x3FF90F59,0x79506F51}} /* +1.5662474383e+00 */ , /*b[39] : */ {{0x3FF9C67F,0x8AF460DF}} /* +1.6109614780e+00 */ , /*atan_b[39]*/ {{0x3FF03E82,0x4A86F56B}} /* +1.0152609740e+00 */,{{0x3C8C4641,0xDE1DF40B}} /* +4.9048339280e-17 */ , } ,{ /*a[40] */ {{0x3FFA854A,0xD74CF791}} /* +1.6575420771e+00 */ , /*b[40] : */ {{0x3FFB4C49,0x4A696F14}} /* +1.7061245829e+00 */ , /*atan_b[40]*/ {{0x3FF0A678,0xBF92516C}} /* +1.0406424983e+00 */,{{0xBC9194FF,0x6A0966AF}} /* -6.0999893718e-17 */ , } ,{ /*a[41] */ {{0x3FFC1C16,0xB3972246}} /* +1.7568575874e+00 */ , /*b[41] : */ {{0x3FFCF55E,0x80F0B83E}} /* +1.8099045788e+00 */ , /*atan_b[41]*/ {{0x3FF10E6F,0x349E81BA}} /* +1.0660240226e+00 */,{{0x3C9C7D12,0x3CD05C13}} /* +9.8839546037e-17 */ , } ,{ /*a[42] */ {{0x3FFDD8DD,0xC6DB1831}} /* +1.8654458778e+00 */ , /*b[42] : */ {{0x3FFEC765,0x927D039C}} /* +1.9236808512e+00 */ , /*atan_b[42]*/ {{0x3FF17665,0xA9AB9836}} /* +1.0914055469e+00 */,{{0xBC924DFA,0x7B9C115B}} /* -6.3506850178e-17 */ , } ,{ /*a[43] */ {{0x3FFFC1DD,0xA4F6D032}} /* +1.9848305172e+00 */ , /*b[43] : */ {{0x400064A3,0xCDEC630C}} /* +2.0491405571e+00 */ , /*atan_b[43]*/ {{0x3FF1DE5C,0x1EB9A624}} /* +1.1167870712e+00 */,{{0xBC7002F6,0x595EC15D}} /* -1.3887824475e-17 */ , } ,{ /*a[44] */ {{0x4000EF61,0x56AEFAF2}} /* +2.1168848774e+00 */ , /*b[44] : */ {{0x400181C8,0x02FA3F97}} /* +2.1883697732e+00 */ , /*atan_b[44]*/ {{0x3FF24652,0x93C8BC28}} /* +1.1421685956e+00 */,{{0xBC8FE336,0xC61E8575}} /* -5.5316089441e-17 */ , } ,{ /*a[45] */ {{0x40021C8B,0xFD9A80C1}} /* +2.2639388860e+00 */ , /*b[45] : */ {{0x4002C078,0x188015C0}} /* +2.3439790644e+00 */ , /*atan_b[45]*/ {{0x3FF2AE49,0x08D8EA37}} /* +1.1675501199e+00 */,{{0xBC99C943,0x56281657}} /* -8.9463796524e-17 */ , } ,{ /*a[46] */ {{0x40036E71,0x7D67269C}} /* +2.4289274022e+00 */ , /*b[46] : */ {{0x4004277C,0x17EDBBF3}} /* +2.5192796583e+00 */ , /*atan_b[46]*/ {{0x3FF3163F,0x7DEA3F8C}} /* +1.1929316443e+00 */,{{0x3C9AD329,0x90EB721B}} /* +9.3067404471e-17 */ , } ,{ /*a[47] */ {{0x4004ECBF,0xF069F1E4}} /* +2.6156004698e+00 */ , /*b[47] : */ {{0x4005BF8F,0xA99113B9}} /* +2.7185357330e+00 */ , /*atan_b[47]*/ {{0x3FF37E35,0xF2FCCAA3}} /* +1.2183131687e+00 */,{{0xBC96C4D7,0x8B3674F4}} /* -7.8995539059e-17 */ , } ,{ /*a[48] */ {{0x4006A170,0x780169B7}} /* +2.8288277984e+00 */ , /*b[48] : */ {{0x40079423,0xEECFDE39}} /* +2.9473341615e+00 */ , /*atan_b[48]*/ {{0x3FF3E62C,0x68109926}} /* +1.2436946931e+00 */,{{0x3C9D395E,0x46562D7D}} /* +1.0139144652e-16 */ , } ,{ /*a[49] */ {{0x400899B4,0x319C3F02}} /* +3.0750507236e+00 */ , /*b[49] : */ {{0x4009B483,0x34491C9A}} /* +3.2131408772e+00 */ , /*atan_b[49]*/ {{0x3FF44E22,0xDD25B7F0}} /* +1.2690762175e+00 */,{{0xBC9AC408,0x96299AC9}} /* -9.2862370643e-17 */ , } ,{ /*a[50] */ {{0x400AE75E,0x05B0834A}} /* +3.3629723019e+00 */ , /*b[50] : */ {{0x400C3595,0x6451B6E9}} /* +3.5261638486e+00 */ , /*atan_b[50]*/ {{0x3FF4B619,0x523C32F8}} /* +1.2944577420e+00 */,{{0x3C98372D,0x9A6CF82B}} /* +8.4014530055e-17 */ , } ,{ /*a[51] */ {{0x400DA31D,0x739BD0E3}} /* +3.7046460182e+00 */ , /*b[51] : */ {{0x400F34B7,0x088B2A13}} /* +3.9007397335e+00 */ , /*atan_b[51]*/ {{0x3FF51E0F,0xC7541555}} /* +1.3198392664e+00 */,{{0xBC4DA0E1,0xD97CC177}} /* -3.2123225727e-18 */ , } ,{ /*a[52] */ {{0x40107813,0x1886BC57}} /* +4.1172603447e+00 */ , /*b[52] : */ {{0x40116E3D,0x8D819944}} /* +4.3576566801e+00 */ , /*atan_b[52]*/ {{0x3FF58606,0x3C6D692D}} /* +1.3452207909e+00 */,{{0xBC7DAB9D,0xD9D13C46}} /* -2.5734950076e-17 */ , } ,{ /*a[53] */ {{0x4012813A,0x8BCE2241}} /* +4.6261998982e+00 */ , /*b[53] : */ {{0x4013B685,0x9F0E4EBF}} /* +4.9282440999e+00 */ , /*atan_b[53]*/ {{0x3FF5EDFC,0xB18837B4}} /* +1.3706023154e+00 */,{{0xBC858200,0xBC854F71}} /* -3.7310126753e-17 */ , } ,{ /*a[54] */ {{0x40151516,0x4ACECE78}} /* +5.2705928506e+00 */ , /*b[54] : */ {{0x4016A5E9,0xF3CD0189}} /* +5.6620252699e+00 */ , /*atan_b[54]*/ {{0x3FF655F3,0x26A48924}} /* +1.3959838399e+00 */,{{0xBC95DCD4,0x0EF07703}} /* -7.5851168241e-17 */ , } ,{ /*a[55] */ {{0x401874CE,0x9526FAB9}} /* +6.1140693002e+00 */ , /*b[55] : */ {{0x401A9194,0xBA057809}} /* +6.6421689096e+00 */ , /*atan_b[55]*/ {{0x3FF6BDE9,0x9BC264B7}} /* +1.4213653645e+00 */,{{0x3C839FB7,0x555821B5}} /* +3.4042024747e-17 */ , } ,{ /*a[56] */ {{0x401D11EB,0xE094C913}} /* +7.2675013629e+00 */ , /*b[56] : */ {{0x40200A31,0xA01EFACA}} /* +8.0199098623e+00 */ , /*atan_b[56]*/ {{0x3FF725E0,0x10E1D0A5}} /* +1.4467468891e+00 */,{{0x3C86B63B,0x56DADB03}} /* +3.9398767140e-17 */ , } ,{ /*a[57] */ {{0x4021E2BC,0x220DFA19}} /* +8.9428415911e+00 */ , /*b[57] : */ {{0x40243445,0xFBA72898}} /* +1.0102096428e+01 */ , /*atan_b[57]*/ {{0x3FF78DD6,0x8602D21D}} /* +1.4721284137e+00 */,{{0xBC9FD7D6,0x4D2EA6E0}} /* -1.1047799388e-16 */ , } ,{ /*a[58] */ {{0x40273463,0xD0337C49}} /* +1.1602324015e+01 */ , /*b[58] : */ {{0x402B3DC7,0x4A4A5A1D}} /* +1.3620661089e+01 */ , /*atan_b[58]*/ {{0x3FF7F5CC,0xFB256D40}} /* +1.4975099383e+00 */,{{0x3C954E9E,0xA28CF77C}} /* +7.3923881174e-17 */ , } ,{ /*a[59] */ {{0x40307B8E,0x26350916}} /* +1.6482637775e+01 */ , /*b[59] : */ {{0x4034DBD6,0x24D415BF}} /* +2.0858736326e+01 */ , /*atan_b[59]*/ {{0x3FF85DC3,0x7049A526}} /* +1.5228914629e+00 */,{{0xBC8424E5,0xE9374500}} /* -3.4944500702e-17 */ , } ,{ /*a[60] */ {{0x403C62CF,0x497BF2F2}} /* +2.8385975449e+01 */ , /*b[60] : */ {{0x40463208,0x6C3EC43C}} /* +4.4390882044e+01 */ , /*atan_b[60]*/ {{0x3FF8C5B9,0xE56F7BD2}} /* +1.5482729876e+00 */,{{0xBC81D57A,0x2F7EC153}} /* -3.0936877458e-17 */ , } ,{ /*a[61] */ {{0x40596CC3,0xFA9E0EF4}} /* +1.0169946161e+02 */ , /*b[61] : */ {{0x4054B2C4,0x7BFF8329}} /* +8.2793242454e+01 */ , /*atan_b[61]*/ {{0x3FF8F082,0xF333CBBA}} /* +1.5587186337e+00 */,{{0x3C952577,0x3909BC3A}} /* +7.3366141099e-17 */ , } , }; #else /* limits of the intervals [a[i],b[i]] */ static db_number const arctan_table[62][4] = { { /*a[0] */ {{0xBCCE533D,0x3F89FDF8}} /* +1.2691443693e-02 */ , /*b[0] : */ {{0x27760007,0x3F99FF0B}} /* +2.5386976512e-02 */ , /*atan_b[0]*/ {{0x4969F96C,0x3F99FD9D}} /* +2.5381524664e-02 */,{{0x750685EA,0xBC301997}} /* -8.7278097631e-19 */ , } ,{ /*a[1] */ {{0x90CEBC31,0x3FA3809F}} /* +3.8090692927e-02 */ , /*b[1] : */ {{0xE3547CC2,0x3FAA0355}} /* +5.0806697846e-02 */ , /*atan_b[1]*/ {{0x4936262D,0x3FA9FD9D}} /* +5.0763049304e-02 */,{{0x3A2D0F59,0xBC4C1F96}} /* -3.0491436238e-18 */ , } ,{ /*a[2] */ {{0x68FBA526,0x3FB04419}} /* +6.3539112216e-02 */ , /*b[2] : */ {{0xABF7BFB9,0x3FB387E0}} /* +7.6292078003e-02 */ , /*atan_b[2]*/ {{0xF6C1E06C,0x3FB37E35}} /* +7.6144573921e-02 */,{{0x8378E024,0xBC556710}} /* -4.6409481568e-18 */ , } ,{ /*a[3] */ {{0xABCDFA25,0x3FB6CD46}} /* +8.9069764084e-02 */ , /*b[3] : */ {{0xE265B8AB,0x3FBA1491}} /* +1.0187637117e-01 */ , /*atan_b[3]*/ {{0x48CF1996,0x3FB9FD9D}} /* +1.0152609851e-01 */,{{0xB73BED3C,0xBC4360DC}} /* -2.1010068528e-18 */ , } ,{ /*a[4] */ {{0x6D2EA546,0x3FBD5E09}} /* +1.1471613803e-01 */ , /*b[4] : */ {{0x9124D46B,0x3FC054FA}} /* +1.2759334647e-01 */ , /*atan_b[4]*/ {{0x4D618156,0x3FC03E82}} /* +1.2690762308e-01 */,{{0x49A86344,0x3C62604E}} /* +7.9694040325e-18 */ , } ,{ /*a[5] */ {{0xD691E891,0x3FC1FC4E}} /* +1.4051232793e-01 */ , /*b[5] : */ {{0x51F57043,0x3FC3A526}} /* +1.5347746851e-01 */ , /*atan_b[5]*/ {{0xF64EF83E,0x3FC37E35}} /* +1.5228914763e-01 */,{{0xB4A55EA6,0x3C5F2B13}} /* +6.7585410867e-18 */ , } ,{ /*a[6] */ {{0x531F610B,0x3FC54FA6}} /* +1.6649321612e-01 */ , /*b[6] : */ {{0xB99F2601,0x3FC6FBF4}} /* +1.7956408561e-01 */ , /*atan_b[6]*/ {{0x9F302425,0x3FC6BDE9}} /* +1.7767067216e-01 */,{{0xC4D330CE,0xBC23B62A}} /* -5.3428372026e-19 */ , } ,{ /*a[7] */ {{0x0550EAF1,0x3FC8AA38}} /* +1.9269466648e-01 */ , /*b[7] : */ {{0x61D9D63D,0x3FCA5A97}} /* +2.0588962820e-01 */ , /*atan_b[7]*/ {{0x48053FC8,0x3FC9FD9D}} /* +2.0305219666e-01 */,{{0x98474AF1,0xBC67A12C}} /* -1.0247699700e-17 */ , } ,{ /*a[8] */ {{0xB8975BD9,0x3FCC0D3A}} /* +2.1915372861e-01 */ , /*b[8] : */ {{0xBCBF6ABC,0x3FCDC24A}} /* +2.3249181954e-01 */ , /*atan_b[8]*/ {{0xF0CE8DD9,0x3FCD3D50}} /* +2.2843372114e-01 */,{{0x3A31D353,0x3C6EF257}} /* +1.3420967238e-17 */ , } ,{ /*a[9] */ {{0xFEE46885,0x3FCF79F0}} /* +2.4590885588e-01 */ , /*b[9] : */ {{0xFCF66B85,0x3FD09A2B}} /* +2.5940990165e-01 */ , /*atan_b[9]*/ {{0x4CC62C6B,0x3FD03E82}} /* +2.5381524560e-01 */,{{0x95C6E482,0x3C5DA594}} /* +6.4286246635e-18 */ , } ,{ /*a[10] */ {{0x943274CA,0x3FD178D5}} /* +2.7300013993e-01 */ , /*b[10] : */ {{0x8943E603,0x3FD2590B}} /* +2.8668487935e-01 */ , /*atan_b[10]*/ {{0x211F7969,0x3FD1DE5C}} /* +2.7919677004e-01 */,{{0x0B01EF44,0x3C3C4E87}} /* +1.5345118889e-18 */ , } ,{ /*a[11] */ {{0xB2CFB5F7,0x3FD33AE4}} /* +3.0046956503e-01 */ , /*b[11] : */ {{0x81B0D1DF,0x3FD41E78}} /* +3.1435978570e-01 */ , /*atan_b[11]*/ {{0xF5735AA1,0x3FD37E35}} /* +3.0457829447e-01 */,{{0x8D437AE9,0xBC772D05}} /* -2.0101859382e-17 */ , } ,{ /*a[12] */ {{0x0DD40A5B,0x3FD503DF}} /* +3.2836128569e-01 */ , /*b[12] : */ {{0x1EB6A659,0x3FD5EB31}} /* +3.4247997283e-01 */ , /*atan_b[12]*/ {{0xC9C20060,0x3FD51E0F}} /* +3.2995981887e-01 */,{{0x20BA7A7B,0xBC6C0F53}} /* -1.2169025414e-17 */ , } ,{ /*a[13] */ {{0x3998DD14,0x3FD6D488}} /* +3.5672193169e-01 */ , /*b[13] : */ {{0xAAF865B1,0x3FD7BFFE}} /* +3.7109343239e-01 */ , /*atan_b[13]*/ {{0x9E0B9E67,0x3FD6BDE9}} /* +3.5534134325e-01 */,{{0x870D5E8E,0x3C797792}} /* +2.2089170409e-17 */ , } ,{ /*a[14] */ {{0x964ABFA5,0x3FD8ADAF}} /* +3.8560094525e-01 */ , /*b[14] : */ {{0x00A6F44E,0x3FD99DB7}} /* +4.0025115074e-01 */ , /*atan_b[14]*/ {{0x72506BCA,0x3FD85DC3}} /* +3.8072286762e-01 */,{{0x43A1CBA3,0x3C720BD1}} /* +1.5652550322e-17 */ , } ,{ /*a[15] */ {{0xE241114E,0x3FDA9031}} /* +4.1505095573e-01 */ , /*b[15] : */ {{0x327F0E90,0x3FDB853E}} /* +4.3000750476e-01 */ , /*atan_b[15]*/ {{0x4690A2C8,0x3FD9FD9D}} /* +4.0610439197e-01 */,{{0xEFB73034,0xBC6A048E}} /* -1.1283424731e-17 */ , } ,{ /*a[16] */ {{0xFB78B41D,0x3FDC7CFA}} /* +4.4512819822e-01 */ , /*b[16] : */ {{0x67BE333A,0x3FDD7788}} /* +4.6042070514e-01 */ , /*atan_b[16]*/ {{0x1ACC80A6,0x3FDB9D77}} /* +4.3148591630e-01 */,{{0xE8FB154D,0x3C6A9BD7}} /* +1.1539711581e-17 */ , } ,{ /*a[17] */ {{0xD82B9DC6,0x3FDE7507}} /* +4.7589298354e-01 */ , /*b[17] : */ {{0xF3B4AACC,0x3FDF759B}} /* +4.9155329513e-01 */ , /*atan_b[17]*/ {{0xEF044589,0x3FDD3D50}} /* +4.5686744062e-01 */,{{0x09E8652E,0x3C575857}} /* +5.0621568797e-18 */ , } ,{ /*a[18] */ {{0x5FF4B2AB,0x3FE03CB4}} /* +5.0741022817e-01 */ , /*b[18] : */ {{0xD9952BEF,0x3FE0C049}} /* +5.2347271439e-01 */ , /*atan_b[18]*/ {{0xC338344A,0x3FDEDD2A}} /* +4.8224896492e-01 */,{{0x81513292,0x3C23C787}} /* +5.3612202011e-19 */ , } ,{ /*a[19] */ {{0xE826E4EA,0x3FE145A1}} /* +5.3975005476e-01 */ , /*b[19] : */ {{0xDDD96DE0,0x3FE1CCD0}} /* +5.5625193911e-01 */ , /*atan_b[19]*/ {{0x4BB44923,0x3FE03E82}} /* +5.0763048922e-01 */,{{0x49DF0A58,0x3C8CAF01}} /* +4.9758137561e-17 */ , } ,{ /*a[20] */ {{0xED462BAC,0x3FE255EB}} /* +5.7298847525e-01 */ , /*b[20] : */ {{0x35B0819C,0x3FE2E109}} /* +5.8997021185e-01 */ , /*atan_b[20]*/ {{0x35CAD39D,0x3FE10E6F}} /* +5.3301201350e-01 */,{{0x0D1EB36B,0x3C45DB33}} /* +2.3696591272e-18 */ , } ,{ /*a[21] */ {{0xD4CDD9AC,0x3FE36E3F}} /* +6.0720817149e-01 */ , /*b[21] : */ {{0xF51235D9,0x3FE3FDA7}} /* +6.2471387735e-01 */ , /*atan_b[21]*/ {{0x1FDFDE84,0x3FE1DE5C}} /* +5.5839353776e-01 */,{{0xD3921CA6,0x3C86FBEF}} /* +3.9871106783e-17 */ , } ,{ /*a[22] */ {{0xE1FB2991,0x3FE48F5A}} /* +6.4249939095e-01 */ , /*b[22] : */ {{0x18D0CCB0,0x3FE52373}} /* +6.6057734343e-01 */ , /*atan_b[22]*/ {{0x09F38FC9,0x3FE2AE49}} /* +5.8377506202e-01 */,{{0x058084C6,0xBC84BBB5}} /* -3.5966422408e-17 */ , } ,{ /*a[23] */ {{0x5FE86E27,0x3FE5BA0C}} /* +6.7896097881e-01 */ , /*b[23] : */ {{0xDA588D41,0x3FE65343}} /* +6.9766419073e-01 */ , /*atan_b[23]*/ {{0xF4060E3D,0x3FE37E35}} /* +6.0915658627e-01 */,{{0xAE25B9B7,0x3BF6235C}} /* +7.5006911959e-20 */ , } ,{ /*a[24] */ {{0x22C19A5D,0x3FE6EF38}} /* +7.1670157231e-01 */ , /*b[24] : */ {{0x629002BC,0x3FE78E09}} /* +7.3608845950e-01 */ , /*atan_b[24]*/ {{0xDE17817F,0x3FE44E22}} /* +6.3453811052e-01 */,{{0x1A6D25E3,0xBC85F46E}} /* -3.8085515717e-17 */ , } ,{ /*a[25] */ {{0x70F967BD,0x3FE82FD9}} /* +7.5584098878e-01 */ , /*b[25] : */ {{0xEE8B9555,0x3FE8D4CB}} /* +7.7597614852e-01 */ , /*atan_b[25]*/ {{0xC82811DC,0x3FE51E0F}} /* +6.5991963475e-01 */,{{0xFCB9720C,0xBC81CCF7}} /* -3.0879221028e-17 */ , } ,{ /*a[26] */ {{0x69351A0D,0x3FE97D06}} /* +7.9651184605e-01 */ , /*b[26] : */ {{0x7D0D616A,0x3FEA28B0}} /* +8.1746696877e-01 */ , /*atan_b[26]*/ {{0xB237E838,0x3FE5EDFC}} /* +6.8530115898e-01 */,{{0xF8F29048,0xBC833EA8}} /* -3.3384347049e-17 */ , } ,{ /*a[27] */ {{0xFE730FCD,0x3FEAD7F3}} /* +8.3886146257e-01 */ , /*b[27] : */ {{0x21335E3D,0x3FEB8AFD}} /* +8.6071640477e-01 */ , /*atan_b[27]*/ {{0x9C472DF1,0x3FE6BDE9}} /* +7.1068268321e-01 */,{{0x80DED249,0x3C5E8127}} /* +6.6146109909e-18 */ , } ,{ /*a[28] */ {{0xAA0A733E,0x3FEC41FA}} /* +8.8305409633e-01 */ , /*b[28] : */ {{0x1D9A7669,0x3FECFD1E}} /* +9.0589814932e-01 */ , /*atan_b[28]*/ {{0x86560CC5,0x3FE78DD6}} /* +7.3606420743e-01 */,{{0x9396D511,0xBC7E962F}} /* -2.6529701578e-17 */ , } ,{ /*a[29] */ {{0xFAEEEADF,0x3FEDBC9B}} /* +9.2927359591e-01 */ , /*b[29] : */ {{0xF41419E7,0x3FEE80AB}} /* +9.5320699379e-01 */ , /*atan_b[29]*/ {{0x7064AEB4,0x3FE85DC3}} /* +7.6144573166e-01 */,{{0x5225ACD1,0x3C77C0FC}} /* +2.0603180716e-17 */ , } ,{ /*a[30] */ {{0x33AC790A,0x3FEF4989}} /* +9.7772655575e-01 */ , /*b[30] : */ {{0x50BB2D02,0x3FF00BB9}} /* +1.0028622774e+00 */ , /*atan_b[30]*/ {{0x5A733DE9,0x3FE92DB0}} /* +7.8682725588e-01 */,{{0xA318D041,0xBC6598C9}} /* -9.3661305872e-18 */ , } ,{ /*a[31] */ {{0x9AC922B4,0x3FF07555}} /* +1.0286460921e+00 */ , /*b[31] : */ {{0x25F4BC57,0x3FF0E1BD}} /* +1.0551120265e+00 */ , /*atan_b[31]*/ {{0x4481E499,0x3FE9FD9D}} /* +8.1220878010e-01 */,{{0x9464A40D,0xBC82E89F}} /* -3.2801339756e-17 */ , } ,{ /*a[32] */ {{0x0440E8D3,0x3FF15116}} /* +1.0822963873e+00 */ , /*b[32] : */ {{0xDEC8DA1A,0x3FF1C388}} /* +1.1102379515e+00 */ , /*atan_b[32]*/ {{0x2E90CCEA,0x3FEACD8A}} /* +8.3759030433e-01 */,{{0xFE4AC33B,0x3C60B8DB}} /* +7.2520578222e-18 */ , } ,{ /*a[33] */ {{0x329D3DD8,0x3FF23941}} /* +1.1389781930e+00 */ , /*b[33] : */ {{0x8F9CF3AD,0x3FF2B26D}} /* +1.1685615168e+00 */ , /*atan_b[33]*/ {{0x18A020D8,0x3FEB9D77}} /* +8.6297182855e-01 */,{{0x43DDC7EE,0x3C714EA3}} /* +1.5011584621e-17 */ , } ,{ /*a[34] */ {{0xE2DB7094,0x3FF32F3F}} /* +1.1990355360e+00 */ , /*b[34] : */ {{0xC485093A,0x3FF3AFED}} /* +1.2304513623e+00 */ , /*atan_b[34]*/ {{0x02B00A17,0x3FEC6D64}} /* +8.8835335278e-01 */,{{0xC1E56981,0x3C5CF722}} /* +6.2808643065e-18 */ , } ,{ /*a[35] */ {{0xD38A35D7,0x3FF434B0}} /* +1.2628639472e+00 */ , /*b[35] : */ {{0x16D89BC7,0x3FF4BDC7}} /* +1.2963324444e+00 */ , /*atan_b[35]*/ {{0xECC0B1F8,0x3FED3D50}} /* +9.1373487702e-01 */,{{0xC689AE1B,0x3C8FFD9A}} /* +5.5494919315e-17 */ , } ,{ /*a[36] */ {{0x6F41F96D,0x3FF54B73}} /* +1.3309206339e+00 */ , /*b[36] : */ {{0x11C53212,0x3FF5DDFE}} /* +1.3666973776e+00 */ , /*atan_b[36]*/ {{0xD6D24151,0x3FEE0D3D}} /* +9.3911640126e-01 */,{{0xC830B564,0xBC654F0F}} /* -9.2412338910e-18 */ , } ,{ /*a[37] */ {{0x165CA5E1,0x3FF675B5}} /* +1.4037371515e+00 */ , /*b[37] : */ {{0x13170C5B,0x3FF712ED}} /* +1.4421206232e+00 */ , /*atan_b[37]*/ {{0xC0E4E05B,0x3FEEDD2A}} /* +9.6449792552e-01 */,{{0xBF676FFE,0xBC8FEAC3}} /* -5.5367254830e-17 */ , } ,{ /*a[38] */ {{0xD0DEA3C6,0x3FF7B601}} /* +1.4819353255e+00 */ , /*b[38] : */ {{0x11FBEA40,0x3FF85F57}} /* +1.5232763960e+00 */ , /*atan_b[38]*/ {{0xAAF8B69E,0x3FEFAD17}} /* +9.8987944978e-01 */,{{0xE69F3AF7,0x3C8B8DA3}} /* +4.7797325436e-17 */ , } ,{ /*a[39] */ {{0x79506F51,0x3FF90F59}} /* +1.5662474383e+00 */ , /*b[39] : */ {{0x8AF460DF,0x3FF9C67F}} /* +1.6109614780e+00 */ , /*atan_b[39]*/ {{0x4A86F56B,0x3FF03E82}} /* +1.0152609740e+00 */,{{0xDE1DF40B,0x3C8C4641}} /* +4.9048339280e-17 */ , } ,{ /*a[40] */ {{0xD74CF791,0x3FFA854A}} /* +1.6575420771e+00 */ , /*b[40] : */ {{0x4A696F14,0x3FFB4C49}} /* +1.7061245829e+00 */ , /*atan_b[40]*/ {{0xBF92516C,0x3FF0A678}} /* +1.0406424983e+00 */,{{0x6A0966AF,0xBC9194FF}} /* -6.0999893718e-17 */ , } ,{ /*a[41] */ {{0xB3972246,0x3FFC1C16}} /* +1.7568575874e+00 */ , /*b[41] : */ {{0x80F0B83E,0x3FFCF55E}} /* +1.8099045788e+00 */ , /*atan_b[41]*/ {{0x349E81BA,0x3FF10E6F}} /* +1.0660240226e+00 */,{{0x3CD05C13,0x3C9C7D12}} /* +9.8839546037e-17 */ , } ,{ /*a[42] */ {{0xC6DB1831,0x3FFDD8DD}} /* +1.8654458778e+00 */ , /*b[42] : */ {{0x927D039C,0x3FFEC765}} /* +1.9236808512e+00 */ , /*atan_b[42]*/ {{0xA9AB9836,0x3FF17665}} /* +1.0914055469e+00 */,{{0x7B9C115B,0xBC924DFA}} /* -6.3506850178e-17 */ , } ,{ /*a[43] */ {{0xA4F6D032,0x3FFFC1DD}} /* +1.9848305172e+00 */ , /*b[43] : */ {{0xCDEC630C,0x400064A3}} /* +2.0491405571e+00 */ , /*atan_b[43]*/ {{0x1EB9A624,0x3FF1DE5C}} /* +1.1167870712e+00 */,{{0x595EC15D,0xBC7002F6}} /* -1.3887824475e-17 */ , } ,{ /*a[44] */ {{0x56AEFAF2,0x4000EF61}} /* +2.1168848774e+00 */ , /*b[44] : */ {{0x02FA3F97,0x400181C8}} /* +2.1883697732e+00 */ , /*atan_b[44]*/ {{0x93C8BC28,0x3FF24652}} /* +1.1421685956e+00 */,{{0xC61E8575,0xBC8FE336}} /* -5.5316089441e-17 */ , } ,{ /*a[45] */ {{0xFD9A80C1,0x40021C8B}} /* +2.2639388860e+00 */ , /*b[45] : */ {{0x188015C0,0x4002C078}} /* +2.3439790644e+00 */ , /*atan_b[45]*/ {{0x08D8EA37,0x3FF2AE49}} /* +1.1675501199e+00 */,{{0x56281657,0xBC99C943}} /* -8.9463796524e-17 */ , } ,{ /*a[46] */ {{0x7D67269C,0x40036E71}} /* +2.4289274022e+00 */ , /*b[46] : */ {{0x17EDBBF3,0x4004277C}} /* +2.5192796583e+00 */ , /*atan_b[46]*/ {{0x7DEA3F8C,0x3FF3163F}} /* +1.1929316443e+00 */,{{0x90EB721B,0x3C9AD329}} /* +9.3067404471e-17 */ , } ,{ /*a[47] */ {{0xF069F1E4,0x4004ECBF}} /* +2.6156004698e+00 */ , /*b[47] : */ {{0xA99113B9,0x4005BF8F}} /* +2.7185357330e+00 */ , /*atan_b[47]*/ {{0xF2FCCAA3,0x3FF37E35}} /* +1.2183131687e+00 */,{{0x8B3674F4,0xBC96C4D7}} /* -7.8995539059e-17 */ , } ,{ /*a[48] */ {{0x780169B7,0x4006A170}} /* +2.8288277984e+00 */ , /*b[48] : */ {{0xEECFDE39,0x40079423}} /* +2.9473341615e+00 */ , /*atan_b[48]*/ {{0x68109926,0x3FF3E62C}} /* +1.2436946931e+00 */,{{0x46562D7D,0x3C9D395E}} /* +1.0139144652e-16 */ , } ,{ /*a[49] */ {{0x319C3F02,0x400899B4}} /* +3.0750507236e+00 */ , /*b[49] : */ {{0x34491C9A,0x4009B483}} /* +3.2131408772e+00 */ , /*atan_b[49]*/ {{0xDD25B7F0,0x3FF44E22}} /* +1.2690762175e+00 */,{{0x96299AC9,0xBC9AC408}} /* -9.2862370643e-17 */ , } ,{ /*a[50] */ {{0x05B0834A,0x400AE75E}} /* +3.3629723019e+00 */ , /*b[50] : */ {{0x6451B6E9,0x400C3595}} /* +3.5261638486e+00 */ , /*atan_b[50]*/ {{0x523C32F8,0x3FF4B619}} /* +1.2944577420e+00 */,{{0x9A6CF82B,0x3C98372D}} /* +8.4014530055e-17 */ , } ,{ /*a[51] */ {{0x739BD0E3,0x400DA31D}} /* +3.7046460182e+00 */ , /*b[51] : */ {{0x088B2A13,0x400F34B7}} /* +3.9007397335e+00 */ , /*atan_b[51]*/ {{0xC7541555,0x3FF51E0F}} /* +1.3198392664e+00 */,{{0xD97CC177,0xBC4DA0E1}} /* -3.2123225727e-18 */ , } ,{ /*a[52] */ {{0x1886BC57,0x40107813}} /* +4.1172603447e+00 */ , /*b[52] : */ {{0x8D819944,0x40116E3D}} /* +4.3576566801e+00 */ , /*atan_b[52]*/ {{0x3C6D692D,0x3FF58606}} /* +1.3452207909e+00 */,{{0xD9D13C46,0xBC7DAB9D}} /* -2.5734950076e-17 */ , } ,{ /*a[53] */ {{0x8BCE2241,0x4012813A}} /* +4.6261998982e+00 */ , /*b[53] : */ {{0x9F0E4EBF,0x4013B685}} /* +4.9282440999e+00 */ , /*atan_b[53]*/ {{0xB18837B4,0x3FF5EDFC}} /* +1.3706023154e+00 */,{{0xBC854F71,0xBC858200}} /* -3.7310126753e-17 */ , } ,{ /*a[54] */ {{0x4ACECE78,0x40151516}} /* +5.2705928506e+00 */ , /*b[54] : */ {{0xF3CD0189,0x4016A5E9}} /* +5.6620252699e+00 */ , /*atan_b[54]*/ {{0x26A48924,0x3FF655F3}} /* +1.3959838399e+00 */,{{0x0EF07703,0xBC95DCD4}} /* -7.5851168241e-17 */ , } ,{ /*a[55] */ {{0x9526FAB9,0x401874CE}} /* +6.1140693002e+00 */ , /*b[55] : */ {{0xBA057809,0x401A9194}} /* +6.6421689096e+00 */ , /*atan_b[55]*/ {{0x9BC264B7,0x3FF6BDE9}} /* +1.4213653645e+00 */,{{0x555821B5,0x3C839FB7}} /* +3.4042024747e-17 */ , } ,{ /*a[56] */ {{0xE094C913,0x401D11EB}} /* +7.2675013629e+00 */ , /*b[56] : */ {{0xA01EFACA,0x40200A31}} /* +8.0199098623e+00 */ , /*atan_b[56]*/ {{0x10E1D0A5,0x3FF725E0}} /* +1.4467468891e+00 */,{{0x56DADB03,0x3C86B63B}} /* +3.9398767140e-17 */ , } ,{ /*a[57] */ {{0x220DFA19,0x4021E2BC}} /* +8.9428415911e+00 */ , /*b[57] : */ {{0xFBA72898,0x40243445}} /* +1.0102096428e+01 */ , /*atan_b[57]*/ {{0x8602D21D,0x3FF78DD6}} /* +1.4721284137e+00 */,{{0x4D2EA6E0,0xBC9FD7D6}} /* -1.1047799388e-16 */ , } ,{ /*a[58] */ {{0xD0337C49,0x40273463}} /* +1.1602324015e+01 */ , /*b[58] : */ {{0x4A4A5A1D,0x402B3DC7}} /* +1.3620661089e+01 */ , /*atan_b[58]*/ {{0xFB256D40,0x3FF7F5CC}} /* +1.4975099383e+00 */,{{0xA28CF77C,0x3C954E9E}} /* +7.3923881174e-17 */ , } ,{ /*a[59] */ {{0x26350916,0x40307B8E}} /* +1.6482637775e+01 */ , /*b[59] : */ {{0x24D415BF,0x4034DBD6}} /* +2.0858736326e+01 */ , /*atan_b[59]*/ {{0x7049A526,0x3FF85DC3}} /* +1.5228914629e+00 */,{{0xE9374500,0xBC8424E5}} /* -3.4944500702e-17 */ , } ,{ /*a[60] */ {{0x497BF2F2,0x403C62CF}} /* +2.8385975449e+01 */ , /*b[60] : */ {{0x6C3EC43C,0x40463208}} /* +4.4390882044e+01 */ , /*atan_b[60]*/ {{0xE56F7BD2,0x3FF8C5B9}} /* +1.5482729876e+00 */,{{0x2F7EC153,0xBC81D57A}} /* -3.0936877458e-17 */ , } ,{ /*a[61] */ {{0xFA9E0EF4,0x40596CC3}} /* +1.0169946161e+02 */ , /*b[61] : */ {{0x7BFF8329,0x4054B2C4}} /* +8.2793242454e+01 */ , /*atan_b[61]*/ {{0xF333CBBA,0x3FF8F082}} /* +1.5587186337e+00 */,{{0x3909BC3A,0x3C952577}} /* +7.3366141099e-17 */ , } , }; #endif #endif /* def _ATAN_FAST_H */ interval-2.1.0/src/crlibm/configure.ac0000644000000000000000000002614513031036767016027 0ustar 00000000000000dnl Process this file with autoconf to produce a configure script. AC_INIT crlibm_version=`cat $srcdir/VERSION` dnl For Automake AM_INIT_AUTOMAKE(crlibm, $crlibm_version) AC_CONFIG_HEADERS([crlibm_config.h]) AC_SUBST(VERSION) ISODATE=`date +%Y-%m-%d` AC_SUBST(ISODATE) dnl Check for system information AC_CANONICAL_HOST case $host_os in hpux*) AC_DEFINE_UNQUOTED(CRLIBM_TYPEOS_HPUX,1,[OS type]);; *cygwin* | *mingw* | *uwin* | *djgpp | *emx*) AC_DEFINE_UNQUOTED(CRLIBM_TYPEOS_CYGWIN,1,[OS type]);; freebsd*|netbsd*|darwin*) AC_DEFINE_UNQUOTED(CRLIBM_TYPEOS_BSD,1,[OS type]);; esac; case $host_cpu in alpha) AC_DEFINE_UNQUOTED(CRLIBM_TYPECPU_ALPHA,1,[Processor type]) ;; sparc) AC_DEFINE_UNQUOTED(CRLIBM_TYPECPU_SPARC,1,[Processor type]) ;; powerpc*) AC_DEFINE_UNQUOTED(CRLIBM_TYPECPU_POWERPC,1,[Processor type]);; i*86|k6|k7|pentium*|athlon*) AC_DEFINE_UNQUOTED(CRLIBM_TYPECPU_X86,1,[Processor type]) has_ia32_de=true;; x86_64|amd64) AC_DEFINE_UNQUOTED(CRLIBM_TYPECPU_AMD64,1,[Processor type]) has_ia32_de=true;; ia64) AC_DEFINE_UNQUOTED(CRLIBM_TYPECPU_ITANIUM,1,[Processor type]) has_ia64_de=true;; esac; AC_CONFIG_SRCDIR([crlibm.h]) AC_PROG_MAKE_SET dnl Check for compiler AC_PROG_CC(gcc icc cc) # Try to set compiler flags to get floating point arithmetics # to work. This is an old heritage and should become useless within 30 years # if test "${GCC}" != "yes" ; then case "${build}" in *-*-hpux* ) AM_CFLAGS="${AM_CFLAGS} -Wp,-H30000" ;; *-dec-osf* ) AM_CFLAGS="${AM_CFLAGS} -ieee" ;; *-apple-darwin* ) AM_CFLAGS="${AM_CFLAGS} -fno-common" ;; *-sgi-irix* ) ;; esac else case "${CC}" in *icc* ) # -Wall causes relocation errors with icc. AM_CFLAGS="${AM_CFLAGS} -wd269" ;; * ) case "${build}" in *-dec-osf* ) AM_CFLAGS="${AM_CFLAGS} -mieee -Wall" ;; *alpha*-*-linux* ) AM_CFLAGS="${AM_CFLAGS} -mieee -Wall" ;; *alpha*-*-freebsd* ) AM_CFLAGS="${AM_CFLAGS} -mieee -Wall" ;; *-apple-darwin* ) AM_CFLAGS="${AM_CFLAGS} -fno-common -Wall" ;; * ) AM_CFLAGS="${AM_CFLAGS} -Wall" ;; esac ;; esac fi dnl send this information to automake to set up compilation flags dnl (add your compiler here) AM_CONDITIONAL(COMPILER_ICC, test x$CC = xicc) dnl Checks for programs. AC_PROG_INSTALL AC_PROG_RANLIB AC_PROG_LN_S dnl Checks for standard C stuff. AC_HEADER_STDC AC_C_CONST AC_C_INLINE AC_CHECK_FUNCS([sqrt]) AC_CHECK_HEADERS([fenv.h]) AC_CHECK_HEADERS([float.h]) AC_CHECK_HEADER(fpu_control.h, has_fpu_control=yes, has_fpu_control=no) dnl Send this information to automake AM_CONDITIONAL(HAS_FPU_CONTROL, test x$has_fpu_control = xyes) if test x$has_fpu_control = xyes ; then AC_DEFINE_UNQUOTED(CRLIBM_HAS_FPU_CONTROL,1,[architecture- and system-specific FPU control header file]) fi dnl adds -lm AC_CHECK_LIB([m], [log]) dnl Other checks AC_C_BIGENDIAN(,,) dnl defines WORDS_BIGENDIAN, or not AC_C_LONG_DOUBLE dnl defines HAVE_LONG_DOUBLE, or not AC_CHECK_SIZEOF(int) dnl defines SIZEOF_INT to be the size in bytes of int dnl All the rest is related to MPFR and to Ziv's lib, useful for testing. dnl Sometimes the following function is provided by aclocal, sometimes not. dnl Copying it here is probably a bad way of managing this problem AC_DEFUN([AC_ADD_PATH_LIBS], [ if ` test "$1" ` then AC_MSG_CHECKING($2 library) if test -r "$1/lib$2.a" -o -r "$1/lib$2.so" then LDFLAGS="$LDFLAGS -L$1" LIBS ="$LIBS -l$2" else AC_MSG_ERROR($2 not found) fi AC_MSG_RESULT(yes) else AC_CHECK_LIB($2, main, , AC_MSG_ERROR($2 not found)) fi ] ) dnl Command-line arguments to ./configure: dnl switch for SSE2 AC_ARG_ENABLE(sse2, [ --enable-sse2 forces the use of sse2 arith [[default=no]]], [case $enableval in yes) AC_DEFINE_UNQUOTED(HAS_SSE2,1,[Use the sse2 operators ]);; no) ;; *) AC_MSG_ERROR([bad value $enableval for --enable-sse2, need yes or no]) ;; esac], [enable_sse2=no]) dnl Send this information to automake AM_CONDITIONAL(USE_SSE2, test x$enable_sse2 = xyes ) dnl switch for compiling the interval functions AC_ARG_ENABLE(interval-functions, [ --enable-interval-functions enables filib-compatible interval functions (DOES NOT WORK YET) [[default=no]]], [case $enableval in yes) AC_DEFINE_UNQUOTED(BUILD_INTERVAL_FUNCTIONS,1,[Compile the filib-compatible interval functions]);; no) ;; *) AC_MSG_ERROR([bad value $enableval for --enable-interval-functions, need yes or no]) ;; esac], [enable_interval_functions=no]) dnl Send this information to automake AM_CONDITIONAL(USE_INTERVAL_FUNCTIONS, test x$enable_interval_functions = xyes ) dnl A switch to disable use of double-extended optimised version AC_ARG_ENABLE(double-extended, [ --enable-double-extended enable double-extended optimised versions of functions if hardware supports it [[default=yes]]], [case $enableval in yes|no) ;; *) AC_MSG_ERROR([bad value $enableval for --enable-double-extended, need yes or no]) ;; esac], [enable_double_extended=yes]) dnl following line needs a little bit more work on log-de.c and double-extended.h dnl AM_CONDITIONAL(USE_HARDWARE_DE, test x$has_ia32_de = xtrue -a x$enable_double_extended = xyes -a x$has_fpu_control=xyes -o x$has_ia64_de = xtrue -a x$CC = xicc -a x$enable_double_extended = xyes ) AM_CONDITIONAL(USE_HARDWARE_DE, test x$has_ia32_de = xtrue -a x$has_fpu_control = xyes -a x$enable_double_extended = xyes -a x$enable_interval_functions = xno ) dnl Note that at the moment, enabling intervals disables double-extended dnl If at some point we wish to include SPARC optimization back, dnl the default should take the value 10 and 25 in this case dnl for around 200 bits of precision AC_ARG_ENABLE(nbdigits, [ --enable-nbdigits=N set the number of digits in the SCS structure to N [[default=8]] ], [case $enableval in *[[0-9]]) AC_DEFINE_UNQUOTED(SCS_NB_WORDS, $enableval, [Number of digits in the SCS structure]);; *) AC_MSG_ERROR([bad value $enableval for --enable-nbdigits, number expected]) ;; esac], [AC_DEFINE_UNQUOTED(SCS_NB_WORDS, 8, [Number of digits in the SCS structure])] ) AC_ARG_ENABLE(digitsize, [ --enable-digitsize=N set the size of a digit to N bits [[default=30]] ], [case $enableval in *[[0-9]]) AC_DEFINE_UNQUOTED(SCS_NB_BITS, $enableval, [Size of an SCS digit]);; *) AC_MSG_ERROR([bad value $enableval for --enable-digitsize, number expected]) ;; esac], [AC_DEFINE_UNQUOTED(SCS_NB_BITS, 30, [Size of an SCS digit])] ) dnl ... for MPFR AC_ARG_ENABLE(mpfr, [ --enable-mpfr enable MPFR function [[default=no]]], [case $enableval in yes|no) ;; *) AC_MSG_ERROR([bad value $enableval for --enable-mpfr, need yes or no]) ;; esac], [enable_mpfr=no]) dnl ... for GMP AC_ARG_ENABLE(gmp, [ --enable-gmp enable GMP function [[default=no]]], [case $enableval in yes|no) ;; *) AC_MSG_ERROR([bad value $enableval for --enable-gmp, need yes or no]) ;; esac], [enable_gmp=no]) dnl ... for IBM Accurate Portable Library AC_ARG_ENABLE(ultim, [ --enable-ultim enable comparison with libultim, IBM's Accurate Portable Math Library [[default=no]]], [case $enableval in yes|no) ;; *) AC_MSG_ERROR([bad value $enableval for --enable-ultim, need yes or no]) ;; esac], [enable_ultim=no]) dnl ... for Sun's libmcr AC_ARG_ENABLE(mcr, [ --enable-mcr enable comparison with Sun's LIBMCR [[default=no]]], [case $enableval in yes|no) ;; *) AC_MSG_ERROR([bad value $enableval for --enable-mcr, need yes or no]) ;; esac], [enable_mcr=no]) dnl Now consider the result of the previous to set directories: dnl ... for GMP if test "$enable_gmp" = "yes" -o "$enable_mpfr" = "yes"; then AC_ARG_WITH(gmp_include, [ --with-gmp-include=DIR GMP include directory ], with_gmp_include=$withval) AC_ARG_WITH(gmp_lib, [ --with-gmp-lib=DIR GMP lib directory ], with_gmp_lib=$withval) AC_ARG_WITH(gmp, [ --with-gmp=DIR GMP directory ], with_gmp_include=$withval/include with_gmp_lib=$withval/lib) if test -d "$with_gmp_include"; then CPPFLAGS="$CPPFLAGS -I$with_gmp_include" else with_gmp_include= fi AC_ADD_PATH_LIBS($with_gmp_lib, gmp) dnl If gmp.h is found, #defines HAVE_GMP_H AC_CHECK_HEADERS([gmp.h]) dnl If libgmp is found, adds -lgmp to LIBS dnl correct in theory: AC_CHECK_LIB([gmp], [__gmp_fprintf]) AC_CHECK_LIB([gmp], [main]) dnl end of test for gmp fi dnl and for MPFR if test "$enable_mpfr" = "yes"; then AC_ARG_WITH(mpfr_include, [ --with-mpfr-include=DIR MPFR include directory ], with_mpfr_include=$withval) AC_ARG_WITH(mpfr_lib, [ --with-mpfr-lib=DIR MPFR lib directory ], with_mpfr_lib=$withval) AC_ARG_WITH(mpfr, [ --with-mpfr=DIR MPFR directory ], with_mpfr_include=$withval/include with_mpfr_lib=$withval/lib) if test -d "$with_mpfr_include"; then CPPFLAGS="$CPPFLAGS -I$with_mpfr_include" else with_mpfr_include= fi AC_ADD_PATH_LIBS($with_mpfr_lib, mpfr) dnl If mpfr.h is found, #defines HAVE_MPFR_H dnl this line should be dnl AC_CHECK_HEADERS([mpfr.h], [], [], [#if HAVE_GMP_H #include #endif]) dnl but it doesn't work properly so we assume that gmp is installed on the system dnl is mpfr is !!! AC_CHECK_HEADERS([mpfr.h], [], [], [#include]) dnl If MPFR is found, adds -lmpfr to LIBS dnl correct in theory: AC_CHECK_LIB([mpfr], [mpfr_init2]) AC_CHECK_LIB([mpfr], [main]) dnl end of test for mpfr fi dnl ... for IBM if test "$enable_ultim" = "yes"; then AC_ARG_WITH(ultim_include, [ --with-ultim-include=DIR ULTIM include directory ], with_ultim_include=$withval) AC_ARG_WITH(ultim_lib, [ --with-ultim-lib=DIR ULTIM lib directory ], with_ultim_lib=$withval) AC_ARG_WITH(ultim, [ --with-ultim=DIR ULTIM directory ], with_ultim_include=$withval/include with_ultim_lib=$withval/lib) if test -d "$with_ultim_include"; then CPPFLAGS="$CPPFLAGS -I$with_ultim_include" else with_ultim_include= fi AC_ADD_PATH_LIBS($with_ultim_lib, ultim) AC_CHECK_HEADERS([MathLib.h]) AC_CHECK_LIB([ultim], [main]) dnl end of test for IBM libultim fi dnl ... for SUN if test "$enable_mcr" = "yes"; then AC_ARG_WITH(mcr_include, [ --with-mcr-include=DIR LIBMCR include directory ], with_mcr_include=$withval) AC_ARG_WITH(mcr_lib, [ --with-mcr-lib=DIR LIBMCR lib directory ], with_mcr_lib=$withval) AC_ARG_WITH(mcr, [ --with-mcr=DIR LIBMCR directory ], with_mcr_include=$withval/include with_mcr_lib=$withval/lib) if test -d "$with_mcr_include"; then CPPFLAGS="$CPPFLAGS -I$with_mcr_include" else with_mcr_include= fi AC_ADD_PATH_LIBS($with_mcr_lib, mcr) AC_CHECK_HEADERS([libmcr.h]) AC_CHECK_LIB([mcr], [main]) dnl end of test for IBM libultim fi #AC_CONFIG_SUBDIRS([scs_lib]) AC_CONFIG_FILES([Makefile scs_lib/Makefile]) AC_OUTPUT interval-2.1.0/src/crlibm/crlibm.h0000644000000000000000000001540013031036767015152 0ustar 00000000000000/* * Author : David Defour, Catherine Daramy, Florent de Dinechin, Christoph Lauter * Contact : David.Defour@ens-lyon.fr, catherine_daramy@ens-lyon.fr * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #ifndef CRLIBM_H #define CRLIBM_H #if defined (__cplusplus) extern "C" { #endif /* An init function which sets FPU flags when needed (mostly on Intel architectures with default double extended) */ extern unsigned long long crlibm_init(void); /* An exit function which restores FPU flags when needed (mostly on Intel architectures with default double extended) */ extern void crlibm_exit(unsigned long long); /* Finished functions */ /* These functions are computed in two steps and have an average execution time comparable to that of a standard libm */ /* exponential */ extern double exp_rn(double); /* to nearest */ extern double exp_rd(double); /* toward -inf */ extern double exp_ru(double); /* toward +inf */ #define exp_rz exp_rd /* toward zero */ /* logarithm */ extern double log_rn(double); /* to nearest */ extern double log_rd(double); /* toward -inf */ extern double log_ru(double); /* toward +inf */ extern double log_rz(double); /* toward zero */ /* cosine */ extern double cos_rn(double); /* to nearest */ extern double cos_rd(double); /* toward -inf */ extern double cos_ru(double); /* toward +inf */ extern double cos_rz(double); /* toward zero */ /* sine */ extern double sin_rn(double); /* to nearest */ extern double sin_rd(double); /* toward -inf */ extern double sin_ru(double); /* toward +inf */ extern double sin_rz(double); /* toward zero */ /* tangent */ extern double tan_rn(double); /* to nearest */ extern double tan_rd(double); /* toward -inf */ extern double tan_ru(double); /* toward +inf */ extern double tan_rz(double); /* toward zero */ /* cosine of pi times x */ extern double cospi_rn(double); /* to nearest */ extern double cospi_rd(double); /* toward -inf */ extern double cospi_ru(double); /* toward +inf */ extern double cospi_rz(double); /* toward zero */ /* sine of pi times x */ extern double sinpi_rn(double); /* to nearest */ extern double sinpi_rd(double); /* toward -inf */ extern double sinpi_ru(double); /* toward +inf */ extern double sinpi_rz(double); /* toward zero */ /* tangent of pi times x */ extern double tanpi_rn(double); /* to nearest */ extern double tanpi_rd(double); /* toward -inf */ extern double tanpi_ru(double); /* toward +inf */ extern double tanpi_rz(double); /* toward zero */ /* /\* cotangent *\/ */ /* extern double cotan_rn(double); /\* to nearest *\/ */ /* extern double cotan_rd(double); /\* toward -inf *\/ */ /* extern double cotan_ru(double); /\* toward +inf *\/ */ /* extern double cotan_rz(double); /\* toward zero *\/ */ /* arctangent */ extern double atan_rn(double); /* to nearest */ extern double atan_rd(double); /* toward -inf */ extern double atan_ru(double); /* toward +inf */ extern double atan_rz(double); /* toward zero */ /* arctangentPi */ extern double atanpi_rn(double); /* to nearest */ extern double atanpi_rd(double); /* toward -inf */ extern double atanpi_ru(double); /* toward +inf */ extern double atanpi_rz(double); /* toward zero */ /* hyperbolic cosine*/ extern double cosh_rn(double); /* to nearest */ extern double cosh_rd(double); /* toward -inf */ extern double cosh_ru(double); /* toward +inf */ extern double cosh_rz(double); /* toward zero */ /* hyperbolic sine */ extern double sinh_rn(double); /* to nearest */ extern double sinh_rd(double); /* toward -inf */ extern double sinh_ru(double); /* toward +inf */ extern double sinh_rz(double); /* toward zero */ /* base 2 logarithm */ extern double log2_rn(double); /* to nearest */ extern double log2_rd(double); /* toward -inf */ extern double log2_ru(double); /* toward +inf */ extern double log2_rz(double); /* towards zero */ /* base 10 logarithm */ extern double log10_rn(double); /* to nearest */ extern double log10_rd(double); /* toward -inf */ extern double log10_ru(double); /* toward +inf */ extern double log10_rz(double); /* towards zero */ /* arcsine */ extern double asin_rn(double); /* to nearest */ extern double asin_rd(double); /* toward -inf */ extern double asin_ru(double); /* toward +inf */ extern double asin_rz(double); /* toward zero */ /* arccosine */ extern double acos_rn(double); /* to nearest */ extern double acos_rd(double); /* toward -inf */ extern double acos_ru(double); /* toward +inf */ #define acos_rz acos_rd /* toward zero */ /* arcsine/PI */ extern double asinpi_rn(double); /* to nearest */ extern double asinpi_rd(double); /* toward -inf */ extern double asinpi_ru(double); /* toward +inf */ extern double asinpi_rz(double); /* toward zero */ /* arccosine/PI */ extern double acospi_rn(double); /* to nearest */ extern double acospi_rd(double); /* toward -inf */ extern double acospi_ru(double); /* toward +inf */ #define acospi_rz acospi_rd /* toward zero */ /* expm1 = e^x -1 */ extern double expm1_rn(double); /* to nearest */ extern double expm1_rd(double); /* toward -inf */ extern double expm1_ru(double); /* toward +inf */ extern double expm1_rz(double); /* toward zero */ /* log1p = log(1 + x) */ extern double log1p_rn(double); /* to nearest */ extern double log1p_rd(double); /* toward -inf */ extern double log1p_ru(double); /* toward +inf */ extern double log1p_rz(double); /* toward zero */ /* Unfinished functions */ /* These functions provide correct rounding but are very slow (typically 100 times slower that the standard libm) */ extern double exp2_rn(double); /* to nearest */ extern double exp2_rd(double); /* toward -inf */ extern double exp2_ru(double); /* toward +inf */ /* pow */ /* ATTENTION: THIS FUNCTION IS UNDER DEVELOPMENT AND CURRENTLY NOT PROVEN CORRECTLY ROUNDED FOR ALL CASES See the documentation */ extern double pow_rn(double, double); /* fi_lib-compatible interval functions (EXPERIMENTAL) */ #ifdef BUILD_INTERVAL_FUNCTIONS #include "interval.h" interval j_log(interval x); interval j_exp(interval x); #endif /* BUILD_INTERVAL_FUNCTIONS */ #if defined (__cplusplus) } #endif #endif /* ifdef CRLIBM_H*/ interval-2.1.0/src/crlibm/crlibm.spec0000644000000000000000000000145313031036767015660 0ustar 00000000000000Summary: cr-libm, a portable, efficient, correctly rounded mathematical library. Name: crlibm Version: 0.8 Release: 1 License: GNU LESSER GENERAL PUBLIC LICENSE Group: System/Mathematics URL: http://lipforge.ens-lyon.fr/projects/crlibm Source0: %{name}-%{version}.tar.gz BuildRoot: %{_tmppath}/%{name}-%{version}-%{release}-buildroot %description The goal of the crlibm project is to design a mathematical library which offers proven correct rounding, with performance and memory usage comparable to current libraries. %prep %setup -q %build %configure make %install rm -rf $RPM_BUILD_ROOT %makeinstall %clean rm -rf $RPM_BUILD_ROOT %files %defattr(-,root,root,-) %{_bindir}/* %{_libdir}/* %{_includedir}/* %changelog * Thu Oct 28 2004 Philippe Defert - Initial build. interval-2.1.0/src/crlibm/crlibm_private.c0000644000000000000000000002446413031036767016711 0ustar 00000000000000/** * Variables and common functions shared by many functions * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include #include #include "crlibm.h" #include "crlibm_private.h" /* I wish I could use C99 fenv.h, but as of 2004 it doesn't specify anything about precision, only rounding direction. */ #ifdef HAVE_FENV_H #include #endif /* Tell the compiler that we're going to mess with FP status register */ #ifdef FENV_H #pragma STDC FENV_ACCESS ON #endif /* TODO proper init and exit functions - for Itanium, sf0 is set to RNDouble, sf1 to RNdoubleExt, set sf2 and/or sf3 for directed functions, one should be kept for saving the fpsr when speculating, study operating systems) - for PowerPC: nothing to do usually, however if for some reason the CPU was not in the default state then crlibm won't work */ /* An init function which sets FPU flags when needed */ unsigned long long crlibm_init() { #ifndef CRLIBM_TYPEOS_BSD #if defined(CRLIBM_HAS_FPU_CONTROL) && (defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)) unsigned short oldcw, cw; #if 1 /* gcc */ /* save old state */ _FPU_GETCW(oldcw); /* Set FPU flags to use double, not double extended, with rounding to nearest */ cw = (_FPU_DEFAULT & ~_FPU_EXTENDED)|_FPU_DOUBLE; _FPU_SETCW(cw); return (unsigned long long) oldcw; #else /* Sun Studio */ __asm__ ("movw $639, -22(%ebp)"); __asm__ ("fldcw -22(%ebp)"); #endif #elif defined(CRLIBM_TYPECPU_ITANIUM) /* On Itanium we assume that SF2 is used fo speculation, and use only SF3 */ unsigned long long int old_fpsr; #if defined(__INTEL_COMPILER) _Asm_fsetc( 0x00, 0x28, 3 /*_SF3*/ ); /* sf3 = round up, double-precision */ // _Asm_mov_to_ar(40, // (old_fpsr & 0xfd000000FFFFFFFFULL) || ((0x18ULL<<32) + (0x28ULL<<45)) ); #elif defined(__GNUC__) __asm__ ("fsetc.s3 0, 40\n"); #endif /* defined(__INTEL_COMPILER) */ old_fpsr = 0 ; /* TODO */ return old_fpsr; #else return 0; #endif /* CRLIBM_TYPECPU_X86 || CRLIBM_TYPECPU_AMD64 */ #else return 0; #endif } /* An exit function which sets FPU flags to initial value */ void crlibm_exit(unsigned long long int oldcw) { #ifndef CRLIBM_TYPEOS_BSD #if defined(CRLIBM_HAS_FPU_CONTROL) && (defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)) /* Set FPU flags to use double, not double extended, with rounding to nearest */ unsigned short t = (unsigned short)oldcw; _FPU_SETCW(t); #endif #endif } #if ADD22_AS_FUNCTIONS /* * computes double-double addition: zh+zl = xh+xl + yh+yl * relative error is smaller than 2^-103 */ void Add22Cond(double *zh, double *zl, double xh, double xl, double yh, double yl) { double r,s; r = xh+yh; if ((ABS(xh)) > (ABS(yh))) {s= ((((xh-r)+yh)+yl)+xl); } else {s=((((yh-r)+xh)+xl)+yl);} *zh = r+s; *zl = r - (*zh) + s; } /* * computes double-double addition: zh+zl = xh+xl + yh+yl * knowing that xh>yh * relative error is smaller than 2^-103 */ void Add22(double *zh, double *zl, double xh, double xl, double yh, double yl) { double r,s; r = xh+yh; s = xh-r+yh+yl+xl; *zh = r+s; *zl = r - (*zh) + s; } #endif /*ADD22_AS_FUNCTIONS*/ #if DEKKER_AS_FUNCTIONS && (!defined PROCESSOR_HAS_FMA) /* else it is defined in crlibm_private.h */ /* * computes rh and rl such that rh + rl = a * b with rh = a @* b exactly * under the conditions : a < 2^970 et b < 2^970 */ void Mul12(double *rh, double *rl, double u, double v){ const double c = 134217729.; /* 1+2^27 */ double up, u1, u2, vp, v1, v2; up = u*c; vp = v*c; u1 = (u-up)+up; v1 = (v-vp)+vp; u2 = u-u1; v2 = v-v1; *rh = u*v; *rl = (((u1*v1-*rh)+(u1*v2))+(u2*v1))+(u2*v2); } /* * Computes rh and rl such that rh + rl = a * b and rh = a @* b exactly */ void Mul12Cond(double *rh, double *rl, double a, double b){ const double two_970 = 0.997920154767359905828186356518419283e292; const double two_em53 = 0.11102230246251565404236316680908203125e-15; const double two_e53 = 9007199254740992.; double u, v; if (a>two_970) u = a*two_em53; else u = a; if (b>two_970) v = b*two_em53; else v = b; Mul12(rh, rl, u, v); if (a>two_970) {*rh *= two_e53; *rl *= two_e53;} if (b>two_970) {*rh *= two_e53; *rl *= two_e53;} } /* * computes double-double multiplication: zh+zl = (xh+xl) * (yh+yl) * under the conditions : xh < 2^970 et xl < 2^970 * relative error is smaller than 2^-102 */ void Mul22(double *zh, double *zl, double xh, double xl, double yh, double yl) { double mh, ml; const double c = 134217729.; /* 0x41A00000, 0x02000000 */ double up, u1, u2, vp, v1, v2; up = xh*c; vp = yh*c; u1 = (xh-up)+up; v1 = (yh-vp)+vp; u2 = xh-u1; v2 = yh-v1; mh = xh*yh; ml = (((u1*v1-mh)+(u1*v2))+(u2*v1))+(u2*v2); ml += xh*yl + xl*yh; *zh = mh+ml; *zl = mh - (*zh) + ml; } /* * computes double-double division: pzh+pzl = (xh+xl) / (yh+yl) * relative error is smaller than 2^-104 */ void Div22(double* pzh, double* pzl, double xh, double xl, double yh, double yl){ double _ch,_cl,_uh,_ul; _ch=(xh)/(yh); Mul12(&_uh,&_ul,_ch,(yh)); _cl=(((((xh)-_uh)-_ul)+(xl))-_ch*(yl))/(yh); *pzh=_ch+_cl; *pzl=(_ch-(*pzh))+_cl; } #endif /* DEKKER_AS_FUNCTIONS && (!defined PROCESSOR_HAS_FMA) */ #if SQRT_AS_FUNCTIONS /* Computes sqrt(x) with a result in double-double precision Should be provable to be exact to at least 100 bits. Only handles the following special cases: - x == 0 - subnormal x The following cases are not handled: - x < 0 - x = +/-Infty, NaN */ void sqrt12(double *resh, double *resl, double x) { db_number xdb; int E; double m, r0, r1, r2, r3h, r3l, r4h, r4l, srtmh, srtml; double r2PHr2h, r2PHr2l, r2Sqh, r2Sql; double mMr2h, mMr2l, mMr2Ch, mMr2Cl; double MHmMr2Ch, MHmMr2Cl; double r3Sqh, r3Sql, mMr3Sqh, mMr3Sql; /* Special case x = 0 */ if (x == 0) { *resh = x; *resl = 0; } else { E = 0; /* Convert to integer format */ xdb.d = x; /* Handle subnormal case */ if (xdb.i[HI] < 0x00100000) { E = -52; xdb.d *= ((db_number) ((double) SQRTTWO52)).d; /* make x a normal number */ } /* Extract exponent E and mantissa m */ E += (xdb.i[HI]>>20)-1023; xdb.i[HI] = (xdb.i[HI] & 0x000fffff) | 0x3ff00000; m = xdb.d; /* Make exponent even */ if (E & 0x00000001) { E++; m *= 0.5; /* Suppose now 1/2 <= m <= 2 */ } /* Construct sqrt(2^E) = 2^(E/2) */ xdb.i[HI] = (E/2 + 1023) << 20; xdb.i[LO] = 0; /* Compute initial approximation to r = 1/sqrt(m) */ r0 = SQRTPOLYC0 + m * (SQRTPOLYC1 + m * (SQRTPOLYC2 + m * (SQRTPOLYC3 + m * SQRTPOLYC4))); /* Iterate two times on double precision */ r1 = 0.5 * r0 * (3 - m * (r0 * r0)); r2 = 0.5 * r1 * (3 - m * (r1 * r1)); /* Iterate two times on double-double precision */ Mul12(&r2Sqh, &r2Sql, r2, r2); Add12(r2PHr2h, r2PHr2l, r2, 0.5 * r2); Mul12(&mMr2h, &mMr2l, m, r2); Mul22(&mMr2Ch, &mMr2Cl, mMr2h, mMr2l, r2Sqh, r2Sql); MHmMr2Ch = -0.5 * mMr2Ch; MHmMr2Cl = -0.5 * mMr2Cl; Add22(&r3h, &r3l, r2PHr2h, r2PHr2l, MHmMr2Ch, MHmMr2Cl); Mul22(&r3Sqh, &r3Sql, r3h, r3l, r3h, r3l); Mul22(&mMr3Sqh, &mMr3Sql, m, 0, r3Sqh, r3Sql); /* To prove: mMr3Sqh = 1.0 in each case */ Mul22(&r4h, &r4l, r3h, r3l, 1, -0.5 * mMr3Sql); /* Multiply obtained reciprocal square root by m */ Mul22(&srtmh,&srtml,m,0,r4h,r4l); /* Multiply componentwise by sqrt(2^E), which is an integer power of 2 that may not produce a subnormal */ *resh = xdb.d * srtmh; *resl = xdb.d * srtml; } /* End: special case 0 */ } #endif /* SQRT_AS_FUNCTIONS */ #if EVAL_PERF==1 /* counter of calls to the second step (accurate step) */ int crlibm_second_step_taken; #endif /* A debug functions */ void printHexa(char* s, double x) { db_number xdb; xdb.d = x; printf("%s = %08x%08x (%1.8e) exponent = %d exponent of ulp = %d\n", s, xdb.i[HI], xdb.i[LO], x, ((xdb.i[HI] & 0x7ff00000) >> 20) - 1023, ((xdb.i[HI] & 0x7ff00000) >> 20) - 1023 - 52); } #ifdef SCS_TYPECPU_SPARC const scs /* 0 */ scs_zer ={{0x00000000, 0x00000000, 0x00000000, 0x00000000}, {{0, 0}}, 0, 1 }, /* 1/2 */ scs_half={{0x02000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, -1, 1 }, /* 1 */ scs_one ={{0x00000001, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 }, /* 2 */ scs_two ={{0x00000002, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 }, /* ~1.666667e-01 */ scs_sixinv ={{0x0aaaaaaa, 0x2aaaaaaa, 0x2aaaaaaa, 0x2aaaaaaa}, DB_ONE, -1, 1 }; #else const struct scs /* 0 */ scs_zer ={{0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, {{0, 0}}, 0, 1 }, /* 1/2 */ scs_half={{0x20000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, -1, 1 }, /* 1 */ scs_one ={{0x00000001, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 }, /* 2 */ scs_two ={{0x00000002, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 }, /* 0.166666*/ scs_sixinv ={{0x0aaaaaaa, 0x2aaaaaaa, 0x2aaaaaaa, 0x2aaaaaaa, 0x2aaaaaaa, 0x2aaaaaaa, 0x2aaaaaaa, 0x2aaaaaaa}, DB_ONE, -1, 1 }; #endif interval-2.1.0/src/crlibm/crlibm_private.h0000644000000000000000000015035613031036767016716 0ustar 00000000000000/* * crlibm_private.h * * This file contains useful tools and data for the crlibm functions. * */ #ifndef CRLIBM_PRIVATE_H #define CRLIBM_PRIVATE_H 1 #include "scs_lib/scs.h" #include "scs_lib/scs_private.h" #ifdef HAVE_CONFIG_H #include "crlibm_config.h" #endif /* otherwise CMake is used, and defines all the useful variables using -D switch */ #ifdef HAVE_INTTYPES_H #include #endif #if (defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)) # ifdef CRLIBM_HAS_FPU_CONTROL # include # ifndef _FPU_SETCW # define _FPU_SETCW(cw) __asm__ ("fldcw %0" : : "m" (*&cw)) # endif # ifndef _FPU_GETCW # define _FPU_GETCW(cw) __asm__ ("fnstcw %0" : "=m" (*&cw)) # endif # endif #endif /* 64 bit arithmetic may be standardised, but people still do what they want */ #ifdef HAVE_INTTYPES_H #define ULL(bits) 0x##bits##uLL #elif defined(_WIN32) /* Windows garbage there */ typedef long long int int64_t; typedef unsigned long long int uint64_t; #define ULL(bits) 0x##bits##i64 /* Default, hoping it works, hopefully less and less relevant */ #else typedef long long int int64_t; typedef unsigned long long int uint64_t; #define ULL(bits) 0x##bits##uLL #endif #ifndef SCS_DEF_INT64 #define SCS_DEF_INT64 #ifdef CRLIBM_TYPEOS_HPUX #ifndef __LP64__ /* To solve the problem with 64 bits integer on HPPA */ typedef long long int64_t; typedef unsigned long long uint64_t; #define ULL(bits) 0x##bits##uLL #endif #endif #endif /* The Add22 and Add22 functions, as well as double-double multiplications of the Dekker family may be either defined as functions, or as #defines. Which one is better depends on the processor/compiler/OS. As #define has to be used with more care (not type-safe), the two following variables should be set to 1 in the development/debugging phase, until no type warning remains. */ #define ADD22_AS_FUNCTIONS 0 #define DEKKER_AS_FUNCTIONS 0 #define SQRT_AS_FUNCTIONS 0 /* The conditional version of the Add12 can be implemented either using 3 floating point additions, a absolute value test and a branch or using 6 floating point additions but no branch. The Add22 sequence is similar. The branchless versions might be faster on some systems. The function versions of Add12Cond and Add22Cond are not implemented in branchless versions. */ #define AVOID_BRANCHES 1 /* setting the following variable adds variables and code for monitoring the performance. Note that sometimes only round to nearest is instrumented */ #define EVAL_PERF 1 #if EVAL_PERF==1 /* counter of calls to the second step (accurate step) */ extern int crlibm_second_step_taken; #endif /* The prototypes of the second steps */ /* extern void exp_SC(scs_ptr res_scs, double x);*/ /* * i = d in rounding to nearest The constant added is 2^52 + 2^51 */ #define DOUBLE2INT(_i, _d) \ {db_number _t; \ _t.d = (_d+6755399441055744.0); \ _i = _t.i[LO];} /* Same idea but beware: works only for |_i| < 2^51 -1 */ #define DOUBLE2LONGINT(_i, _d) \ { \ db_number _t; \ _t.d = (_d+6755399441055744.0); \ if (_d >= 0) /* sign extend */ \ _i = _t.l & ULL(0007FFFFFFFFFFFF); \ else \ _i = (_t.l & ULL(0007FFFFFFFFFFFF)) | (ULL(FFF8000000000000)); \ } /* Macros for the rounding tests in directed modes */ /* After Evgeny Gvozdev pointed out a bug in the rounding procedures I decided to centralize them here Note that these tests launch the accurate phase when yl=0, in particular in the exceptional cases when the image of a double is a double. See the chapter about the log for an example All this does not work for denormals, of course */ #define TEST_AND_RETURN_RU(__yh__, __yl__, __eps__) \ { \ db_number __yhdb__, __yldb__, u53; int yh_neg, yl_neg; \ __yhdb__.d = __yh__; __yldb__.d = __yl__; \ yh_neg = (__yhdb__.i[HI] & 0x80000000); \ yl_neg = (__yldb__.i[HI] & 0x80000000); \ __yhdb__.l = __yhdb__.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ __yldb__.l = __yldb__.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ u53.l = (__yhdb__.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ if(__yldb__.d > __eps__ * u53.d){ \ if(!yl_neg) { /* The case yl==0 is filtered by the above test*/ \ /* return next up */ \ __yhdb__.d = __yh__; \ if(yh_neg) __yhdb__.l--; else __yhdb__.l++; /* Beware: fails for zero */ \ return __yhdb__.d ; \ } \ else return __yh__; \ } \ } #define TEST_AND_RETURN_RD(__yh__, __yl__, __eps__) \ { \ db_number __yhdb__, __yldb__, u53; int yh_neg, yl_neg; \ __yhdb__.d = __yh__; __yldb__.d = __yl__; \ yh_neg = (__yhdb__.i[HI] & 0x80000000); \ yl_neg = (__yldb__.i[HI] & 0x80000000); \ __yhdb__.l = __yhdb__.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ __yldb__.l = __yldb__.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ u53.l = (__yhdb__.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ if(__yldb__.d > __eps__ * u53.d){ \ if(yl_neg) { /* The case yl==0 is filtered by the above test*/ \ /* return next down */ \ __yhdb__.d = __yh__; \ if(yh_neg) __yhdb__.l++; else __yhdb__.l--; /* Beware: fails for zero */ \ return __yhdb__.d ; \ } \ else return __yh__; \ } \ } #define TEST_AND_RETURN_RZ(__yh__, __yl__, __eps__) \ { \ db_number __yhdb__, __yldb__, u53; int yh_neg, yl_neg; \ __yhdb__.d = __yh__; __yldb__.d = __yl__; \ yh_neg = (__yhdb__.i[HI] & 0x80000000); \ yl_neg = (__yldb__.i[HI] & 0x80000000); \ __yhdb__.l = __yhdb__.l & ULL(7fffffffffffffff); /* compute the absolute value*/\ __yldb__.l = __yldb__.l & ULL(7fffffffffffffff); /* compute the absolute value*/\ u53.l = (__yhdb__.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ if(__yldb__.d > __eps__ * u53.d){ \ if(yl_neg!=yh_neg) { \ __yhdb__.d = __yh__; \ __yhdb__.l--; /* Beware: fails for zero */ \ return __yhdb__.d ; \ } \ else return __yh__; \ } \ } #define TEST_AND_COPY_RU(__cond__, __res__, __yh__, __yl__, __eps__) \ { \ db_number __yhdb__, __yldb__, u53; int yh_neg, yl_neg; \ __yhdb__.d = __yh__; __yldb__.d = __yl__; \ yh_neg = (__yhdb__.i[HI] & 0x80000000); \ yl_neg = (__yldb__.i[HI] & 0x80000000); \ __yhdb__.l = __yhdb__.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ __yldb__.l = __yldb__.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ u53.l = (__yhdb__.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ __cond__ = 0; \ if(__yldb__.d > __eps__ * u53.d){ \ __cond__ = 1; \ if(!yl_neg) { /* The case yl==0 is filtered by the above test*/ \ /* return next up */ \ __yhdb__.d = __yh__; \ if(yh_neg) __yhdb__.l--; else __yhdb__.l++; /* Beware: fails for zero */ \ __res__ = __yhdb__.d ; \ } \ else { \ __res__ = __yh__; \ } \ } \ } #define TEST_AND_COPY_RD(__cond__, __res__, __yh__, __yl__, __eps__) \ { \ db_number __yhdb__, __yldb__, u53; int yh_neg, yl_neg; \ __yhdb__.d = __yh__; __yldb__.d = __yl__; \ yh_neg = (__yhdb__.i[HI] & 0x80000000); \ yl_neg = (__yldb__.i[HI] & 0x80000000); \ __yhdb__.l = __yhdb__.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ __yldb__.l = __yldb__.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ u53.l = (__yhdb__.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ __cond__ = 0; \ if(__yldb__.d > __eps__ * u53.d){ \ __cond__ = 1; \ if(yl_neg) { /* The case yl==0 is filtered by the above test*/ \ /* return next down */ \ __yhdb__.d = __yh__; \ if(yh_neg) __yhdb__.l++; else __yhdb__.l--; /* Beware: fails for zero */ \ __res__ = __yhdb__.d ; \ } \ else { \ __res__ = __yh__; \ } \ } \ } #define TEST_AND_COPY_RZ(__cond__, __res__, __yh__, __yl__, __eps__) \ { \ db_number __yhdb__, __yldb__, u53; int yh_neg, yl_neg; \ __yhdb__.d = __yh__; __yldb__.d = __yl__; \ yh_neg = (__yhdb__.i[HI] & 0x80000000); \ yl_neg = (__yldb__.i[HI] & 0x80000000); \ __yhdb__.l = __yhdb__.l & ULL(7fffffffffffffff); /* compute the absolute value*/\ __yldb__.l = __yldb__.l & ULL(7fffffffffffffff); /* compute the absolute value*/\ u53.l = (__yhdb__.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ __cond__ = 0; \ if(__yldb__.d > __eps__ * u53.d){ \ if(yl_neg!=yh_neg) { \ __yhdb__.d = __yh__; \ __yhdb__.l--; /* Beware: fails for zero */ \ __res__ = __yhdb__.d ; \ __cond__ = 1; \ } \ else { \ __res__ = __yh__; \ __cond__ = 1; \ } \ } /* If the processor has a FMA, use it ! **/ /* All this probably works only with gcc. See Markstein book for the case of HP's compiler */ #if defined(CRLIBM_TYPECPU_POWERPC) && defined(__GNUC__) #define PROCESSOR_HAS_FMA 1 #define FMA(a,b,c) /* r = a*b + c*/ \ ({ \ double _a, _b,_c,_r; \ _a=a; _b=b;_c=c; \ __asm__ ("fmadd %0, %1, %2, %3\n ;;\n" \ : "=f"(_r) \ : "f"(_a), "f"(_b), "f"(_c) \ ); \ _r; \ }) #define FMS(a,b,c) /* r = a*b - c*/ \ ({ \ double _a, _b,_c,_r; \ _a=a; _b=b;_c=c; \ __asm__ ("fmsub %0, %1, %2, %3\n ;;\n" \ : "=f"(_r) \ : "f"(_a), "f"(_b), "f"(_c) \ ); \ _r; \ }) #endif /* defined(CRLIBM_TYPECPU_POWERPC) && defined(__GCC__) */ /* On the Itanium 1 / gcc3.2 we lose 10 cycles when using the FMA !?! It probably breaks the scheduling algorithms somehow... To test again with higher gcc versions */ #if defined(CRLIBM_TYPECPU_ITANIUM) && defined(__GNUC__) && !defined(__INTEL_COMPILER) && 0 #define PROCESSOR_HAS_FMA 1 #define FMA(a,b,c) /* r = a*b + c*/ \ ({ \ double _a, _b,_c,_r; \ _a=a; _b=b;_c=c; \ __asm__ ("fma %0 = %1, %2, %3\n ;;\n" \ : "=f"(_r) \ : "f"(_a), "f"(_b), "f"(_c) \ ); \ _r; \ }) #define FMS(a,b,c) /* r = a*b - c*/ \ ({ \ double _a, _b, _c, _r; \ _a=a; _b=b;_c=c; \ __asm__ ("fms %0 = %1, %2, %3\n ;;\n" \ : "=f"(_r) \ : "f"(_a), "f"(_b), "f"(_c) \ ); \ _r; \ }) #endif /* defined(CRLIBM_TYPECPU_ITANIUM) && defined(__GCC__) && !defined(__INTEL_COMPILER) */ #if defined(CRLIBM_TYPECPU_ITANIUM) && defined(__INTEL_COMPILER) #define PROCESSOR_HAS_FMA 1 #if 0 /* Commented out because it shouldn't be there: There should be a standard #include doing all this, but as of april 2005 it doesn't exist, say intel people). Leave it as documentation, though, until it is replaced by #include */ /* Table 1-17: legal floating-point precision completers (.pc) */ typedef enum { _PC_S = 1 /* single .s */ ,_PC_D = 2 /* double .d */ ,_PC_NONE = 3 /* dynamic */ } _Asm_pc; /* Table 1-22: legal getf/setf floating-point register access completers */ typedef enum { _FR_S = 1 /* single form .s */ ,_FR_D = 2 /* double form .d */ ,_FR_EXP = 3 /* exponent form .exp */ ,_FR_SIG = 4 /* significand form .sig */ } _Asm_fr_access; /* Table 1-24: legal floating-point FPSR status field completers (.sf) */ typedef enum { _SF0 = 0 /* FPSR status field 0 .s0 */ ,_SF1 = 1 /* FPSR status field 1 .s1 */ ,_SF2 = 2 /* FPSR status field 2 .s2 */ ,_SF3 = 3 /* FPSR status field 3 .s3 */ } _Asm_sf; #endif #define FMA(a,b,c) /* r = a*b + c*/ \ _Asm_fma( 2/*_PC_D*/, a, b, c, 0/*_SF0*/ ); #define FMS(a,b,c) /* r = a*b - c*/ \ _Asm_fms( 2/*_PC_D*/, a, b, c, 0/*_SF0*/); #endif /*defined(CRLIBM_TYPECPU_ITANIUM) && defined(__INTEL_COMPILER)*/ #ifdef WORDS_BIGENDIAN #define DB_ONE {{0x3ff00000, 0x00000000}} #else #define DB_ONE {{0x00000000 ,0x3ff00000}} #endif extern const scs scs_zer, scs_half, scs_one, scs_two, scs_sixinv; #define SCS_ZERO (scs_ptr)(&scs_zer) #define SCS_HALF (scs_ptr)(&scs_half) #define SCS_ONE (scs_ptr)(&scs_one) #define SCS_TWO (scs_ptr)(&scs_two) #define SCS_SIXINV (scs_ptr)(&scs_sixinv) #if defined(__GNUC__) #define ABS(x) (__builtin_fabs((x))) #else #define ABS(x) (((x)>0) ? (x) : (-(x))) #endif /* * In the following, when an operator is preceded by a '@' it means that we * are considering the IEEE-compliant machine operator, otherwise it * is the mathematical operator. * */ /* * computes s and r such that s + r = a + b, with s = a @+ b exactly */ #if AVOID_BRANCHES #define Add12Cond(s, r, a, b) \ { \ double _u1, _u2, _u3, _u4; \ double _a=a, _b=b; \ \ s = _a + _b; \ _u1 = s - _a; \ _u2 = s - _u1; \ _u3 = _b - _u1; \ _u4 = _a - _u2; \ r = _u4 + _u3; \ } #else #define Add12Cond(s, r, a, b) \ {double _z, _a=a, _b=b; \ s = _a + _b; \ if (ABS(a) > ABS(b)){ \ _z = s - _a; \ r = _b - _z; \ }else { \ _z = s - _b; \ r = _a - _z;}} #endif /* * computes s and r such that s + r = a + b, with s = a @+ b exactly * under the condition a >= b */ #define Add12(s, r, a, b) \ {double _z, _a=a, _b=b; \ s = _a + _b; \ _z = s - _a; \ r = _b - _z; } /* * computes r1, r2, r3 such that r1 + r2 + r3 = a + b + c exactly */ #define Fast3Sum(r1, r2, r3, a, b, c) \ {double u, v, w; \ Fast2Sum(u, v, b, c); \ Fast2Sum(r1, w, a, u); \ Fast2Sum(r2, r3, w, v); } /* * Functions to computes double-double addition: zh+zl = xh+xl + yh+yl * knowing that xh>yh * relative error is smaller than 2^-103 */ #if ADD22_AS_FUNCTIONS extern void Add22(double *zh, double *zl, double xh, double xl, double yh, double yl); extern void Add22Cond(double *zh, double *zl, double xh, double xl, double yh, double yl); #else /* ADD22_AS_FUNCTIONS */ #if AVOID_BRANCHES #define Add22Cond(zh,zl,xh,xl,yh,yl) \ do { \ double _v1, _v2, _v3, _v4; \ \ Add12Cond(_v1, _v2, (xh), (yh)); \ _v3 = (xl) + (yl); \ _v4 = _v2 + _v3; \ Add12((*(zh)),(*(zl)),_v1,_v4); \ } while (2+2==5) #else #define Add22Cond(zh,zl,xh,xl,yh,yl) \ do { \ double _r,_s; \ _r = (xh)+(yh); \ _s = ((ABS(xh)) > (ABS(yh)))? ((xh)-_r+(yh)+(yl)+(xl)) : ((yh)-_r+(xh)+(xl)+(yl)); \ *zh = _r+_s; \ *zl = (_r - (*zh)) + _s; \ } while(2+2==5) #endif #define Add22(zh,zl,xh,xl,yh,yl) \ do { \ double _r,_s; \ _r = (xh)+(yh); \ _s = ((((xh)-_r) +(yh)) + (yl)) + (xl); \ *zh = _r+_s; \ *zl = (_r - (*zh)) + _s; \ } while(0) #endif /* ADD22_AS_FUNCTIONS */ #ifdef PROCESSOR_HAS_FMA /* One of the nice things with the fused multiply-and-add is that it greatly simplifies the double-double multiplications : */ #define Mul12(rh,rl,u,v) \ { \ *rh = u*v; \ *rl = FMS(u,v, *rh); \ } #define Mul22(pzh,pzl, xh,xl, yh,yl) \ { \ double ph, pl; \ ph = xh*yh; \ pl = FMS(xh, yh, ph); \ pl = FMA(xh,yl, pl); \ pl = FMA(xl,yh,pl); \ *pzh = ph+pl; \ *pzl = ph - (*pzh); \ *pzl += pl; \ } /* besides we don't care anymore about overflows in the mult */ #define Mul12Cond Mul12 #define Mul22cond Mul22 #else /* ! PROCESSOR_HAS_FMA */ #if DEKKER_AS_FUNCTIONS extern void Mul12(double *rh, double *rl, double u, double v); extern void Mul12Cond(double *rh, double *rl, double a, double b); extern void Mul22(double *zh, double *zl, double xh, double xl, double yh, double yl); #else /* if DEKKER_AS_FUNCTIONS */ /* * computes rh and rl such that rh + rl = a * b with rh = a @* b exactly * under the conditions : a < 2^970 et b < 2^970 */ #if 1 #define Mul12(rh,rl,u,v) \ { \ const double c = 134217729.; /* 2^27 +1 */ \ double up, u1, u2, vp, v1, v2; \ double _u=u, _v=v; \ up = _u*c; vp = _v*c; \ u1 = (_u-up)+up; v1 = (_v-vp)+vp; \ u2 = _u-u1; v2 = _v-v1; \ \ *rh = _u*_v; \ *rl = (((u1*v1-*rh)+(u1*v2))+(u2*v1))+(u2*v2);\ } #else /* This works but is much slower. Problem: SSE2 instructions are two-address, and intrinsincs are 3-address */ #include #define Mul12(rh,rl,u,v) \ { \ const double c = 134217729.; /* 2^27 +1 */ \ __m128d _u_v = _mm_set_pd (u,v); \ __m128d c2=_mm_set1_pd(c); \ c2 = _mm_mul_pd(c2, _u_v); \ __m128d u1v1 = _mm_sub_pd(_u_v, c2); \ u1v1 = _mm_add_pd(u1v1, c2); \ __m128d u2v2 = _mm_sub_pd(_u_v, u1v1); \ __m128d _v_u = _mm_shuffle_pd(_u_v, _u_v, _MM_SHUFFLE2 (0,1)); \ __m128d rhrh = _mm_mul_pd(_v_u, _u_v); \ _mm_store_sd (rh, rhrh); \ __m128d v2u2 = _mm_shuffle_pd(u2v2, u2v2, _MM_SHUFFLE2 (0,1)); \ __m128d u1v2u2v1 = _mm_mul_pd(u1v1, v2u2); \ __m128d u2v1u1v2 = _mm_shuffle_pd(u1v2u2v1, u1v2u2v1, _MM_SHUFFLE2 (0,1)); \ __m128d uvmed = _mm_add_pd(u1v2u2v1, u2v1u1v2); \ __m128d u1u2 = _mm_shuffle_pd(u1v1, u2v2, _MM_SHUFFLE2 (1,1)); \ __m128d v1v2 = _mm_shuffle_pd(u1v1, u2v2, _MM_SHUFFLE2 (0,0)); \ __m128d u1v1u2v2 = _mm_mul_pd(u1u2, v1v2); \ __m128d tmp = _mm_sub_pd(u1v1u2v2, rhrh); \ tmp = _mm_add_pd(tmp, uvmed); \ __m128d u2v2u2v2 = _mm_mul_pd(u2v2, v2u2); \ tmp = _mm_add_pd(tmp, u2v2u2v2); \ _mm_store_sd (rl, tmp); \ } #endif /* double _u =u, _v=v; \ __m128d _u_v = _mm_set_pd(_u, _v); \ */ \ /* * Computes rh and rl such that rh + rl = a * b and rh = a @* b exactly */ #define Mul12Cond(rh, rl, a, b) \ {\ const double two_em53 = 1.1102230246251565404e-16; /* 0x3CA00000, 0x00000000 */\ const double two_e53 = 9007199254740992.; /* 0x43400000, 0x00000000 */\ double u, v; \ db_number _a=a, _b=b; \ \ if (_a.i[HI]>0x7C900000) u = _a*two_em53; \ else u = _a; \ if (_b.i[HI]>0x7C900000) v = _b*two_em53; \ else v = _b; \ \ Mul12(rh, rl, u, v); \ \ if (_a.i[HI]>0x7C900000) {*rh *= two_e53; *rl *= two_e53;} \ if (_b.i[HI]>0x7C900000) {*rh *= two_e53; *rl *= two_e53;} \ } /* * computes double-double multiplication: zh+zl = (xh+xl) * (yh+yl) * relative error is smaller than 2^-102 */ #define Mul22(zh,zl,xh,xl,yh,yl) \ { \ double mh, ml; \ \ const double c = 134217729.; \ double up, u1, u2, vp, v1, v2; \ \ up = (xh)*c; vp = (yh)*c; \ u1 = ((xh)-up)+up; v1 = ((yh)-vp)+vp; \ u2 = (xh)-u1; v2 = (yh)-v1; \ \ mh = (xh)*(yh); \ ml = (((u1*v1-mh)+(u1*v2))+(u2*v1))+(u2*v2); \ \ ml += (xh)*(yl) + (xl)*(yh); \ *zh = mh+ml; \ *zl = mh - (*zh) + ml; \ } #endif /* DEKKER_AS_FUNCTIONS */ #endif /* PROCESSOR_HAS_FMA */ /* Additional double-double operators */ /* Eps Mul122 <= 2^-102 */ #define Mul122(resh,resl,a,bh,bl) \ { \ double _t1, _t2, _t3, _t4; \ \ Mul12(&_t1,&_t2,(a),(bh)); \ _t3 = (a) * (bl); \ _t4 = _t2 + _t3; \ Add12((*(resh)),(*(resl)),_t1,_t4); \ } /* Eps MulAdd212 <= 2^-100 for |a * (bh + bl)| <= 1/4 * |ch + cl| */ #define MulAdd212(resh,resl,ch,cl,a,bh,bl) \ { \ double _t1, _t2, _t3, _t4, _t5, _t6, _t7, _t8; \ \ Mul12(&_t1,&_t2,(a),(bh)); \ Add12(_t3,_t4,(ch),_t1); \ _t5 = (bl) * (a); \ _t6 = (cl) + _t2; \ _t7 = _t5 + _t6; \ _t8 = _t7 + _t4; \ Add12((*(resh)),(*(resl)),_t3,_t8); \ } /* Eps MulAdd212 <= 2^-100 for |(ah + bh) * (bh + bl)| <= 1/4 * |ch + cl| */ #define MulAdd22(resh,resl,ch,cl,ah,al,bh,bl) \ { \ double _t1, _t2, _t3, _t4, _t5, _t6, _t7, _t8; \ double _t9, _t10; \ \ Mul12(&_t1,&_t2,(ah),(bh)); \ Add12(_t3,_t4,(ch),_t1); \ _t5 = (ah) * (bl); \ _t6 = (al) * (bh); \ _t7 = _t2 + (cl); \ _t8 = _t4 + _t7; \ _t9 = _t5 + _t6; \ _t10 = _t8 + _t9; \ Add12((*(resh)),(*(resl)),_t3,_t10); \ } #define Add122(resh,resl,a,bh,bl) \ { \ double _t1, _t2, _t3; \ \ Add12(_t1,_t2,(a),(bh)); \ _t3 = _t2 + (bl); \ Add12((*(resh)),(*(resl)),_t1,_t3); \ } #define Add122Cond(resh,resl,a,bh,bl) \ { \ double _t1, _t2, _t3; \ \ Add12Cond(_t1,_t2,(a),(bh)); \ _t3 = _t2 + (bl); \ Add12((*(resh)),(*(resl)),_t1,_t3); \ } #define Add212(resh,resl,ah,al,b) \ { \ double _t1, _t2, _t3; \ \ Add12(_t1,_t2,(ah),b); \ _t3 = _t2 + (al); \ Add12((*(resh)),(*(resl)),_t1,_t3); \ } /* In the following the one-line computation of _cl was split so that icc(8.1) would compile it properly. It's a bug of icc */ #if DEKKER_AS_FUNCTIONS extern void Div22(double *z, double *zz, double x, double xx, double y, double yy); #else #define Div22(pzh,pzl,xh,xl,yh,yl) { \ double _ch,_cl,_uh,_ul; \ _ch=(xh)/(yh); Mul12(&_uh,&_ul,_ch,(yh)); \ _cl=((xh)-_uh); \ _cl -= _ul; \ _cl += (xl); \ _cl -= _ch*(yl); \ _cl /= (yh); \ *pzh=_ch+_cl; *pzl=(_ch-(*pzh))+_cl; \ } #endif /* DEKKER_AS_FUNCTIONS */ /* Coefficients for 1/sqrt(m) with 1/2 < m < 2 The corresponding relative polynomial approximation error is less than eps < 2^(-8.3127) (cf. Maple file) The Itanium instruction frsqrta is slightly more accurate; it can therefore easily replace the polynomial evaluation. */ #define SQRTPOLYC0 2.50385236695888790947606139525305479764938354492188e+00 #define SQRTPOLYC1 -3.29763389114324168005509818613063544034957885742188e+00 #define SQRTPOLYC2 2.75726076139124520736345402838196605443954467773438e+00 #define SQRTPOLYC3 -1.15233725777933848632983426796272397041320800781250e+00 #define SQRTPOLYC4 1.86900066679800969104974228685023263096809387207031e-01 #define SQRTTWO52 4.50359962737049600000000000000000000000000000000000e+15 #if SQRT_AS_FUNCTIONS extern void sqrt12(double *resh, double *resl, double x); #else /* Concerning special case handling see crlibm_private.h */ #define sqrt12(resh, resl, x) { \ db_number _xdb; \ int _E; \ double _m, _r0, _r1, _r2, _r3h, _r3l, _r4h, _r4l, _srtmh, _srtml; \ double _r2PHr2h, _r2PHr2l, _r2Sqh, _r2Sql; \ double _mMr2h, _mMr2l, _mMr2Ch, _mMr2Cl; \ double _MHmMr2Ch, _MHmMr2Cl; \ double _r3Sqh, _r3Sql, _mMr3Sqh, _mMr3Sql; \ double _half; \ \ /* Special case x = 0 */ \ if ((x) == 0.0) { \ (*(resh)) = (x); \ (*(resl)) = 0.0; \ } else { \ \ _E = 0; \ \ /* Convert to integer format */ \ _xdb.d = (x); \ \ /* Handle subnormal case */ \ if (_xdb.i[HI] < 0x00100000) { \ _E = -52; \ _xdb.d *= ((db_number) ((double) SQRTTWO52)).d; \ /* make x a normal number */ \ } \ \ /* Extract exponent E and mantissa m */ \ _E += (_xdb.i[HI]>>20)-1023; \ _xdb.i[HI] = (_xdb.i[HI] & 0x000fffff) | 0x3ff00000; \ _m = _xdb.d; \ \ _half = 0.5; \ /* Make exponent even */ \ if (_E & 0x00000001) { \ _E++; \ _m *= _half; /* Suppose now 1/2 <= m <= 2 */ \ } \ \ /* Construct sqrt(2^E) = 2^(E/2) */ \ _xdb.i[HI] = (_E/2 + 1023) << 20; \ _xdb.i[LO] = 0; \ \ /* Compute initial approximation to r = 1/sqrt(m) */ \ \ _r0 = SQRTPOLYC0 + \ _m * (SQRTPOLYC1 + _m * (SQRTPOLYC2 + _m * (SQRTPOLYC3 + _m * SQRTPOLYC4))); \ \ /* Iterate two times on double precision */ \ \ _r1 = _half * _r0 * (3.0 - _m * (_r0 * _r0)); \ _r2 = _half * _r1 * (3.0 - _m * (_r1 * _r1)); \ \ /* Iterate two times on double-double precision */ \ \ Mul12(&_r2Sqh, &_r2Sql, _r2, _r2); \ Add12(_r2PHr2h, _r2PHr2l, _r2, (_half * _r2)); \ Mul12(&_mMr2h, &_mMr2l, _m, _r2); \ Mul22(&_mMr2Ch, &_mMr2Cl, _mMr2h, _mMr2l, _r2Sqh, _r2Sql); \ \ _MHmMr2Ch = -_half * _mMr2Ch; \ _MHmMr2Cl = -_half * _mMr2Cl; \ \ Add22(&_r3h, &_r3l, _r2PHr2h, _r2PHr2l, _MHmMr2Ch, _MHmMr2Cl); \ \ Mul22(&_r3Sqh, &_r3Sql, _r3h, _r3l, _r3h, _r3l); \ Mul22(&_mMr3Sqh, &_mMr3Sql, _m, 0.0, _r3Sqh, _r3Sql); \ /* To prove: mMr3Sqh = 1.0 in each case */ \ \ Mul22(&_r4h, &_r4l, _r3h, _r3l, 1.0, (-_half * _mMr3Sql)); \ \ /* Multiply obtained reciprocal square root by m */ \ \ Mul22(&_srtmh,&_srtml,_m,0.0,_r4h,_r4l); \ \ /* Multiply componentwise by sqrt(2^E) */ \ /* which is an integer power of 2 that may not produce a subnormal */ \ \ (*(resh)) = _xdb.d * _srtmh; \ (*(resl)) = _xdb.d * _srtml; \ \ } /* End: special case 0 */ \ } #define sqrt12_64(resh, resl, x) { \ db_number _xdb; \ int _E; \ double _m, _r0, _r1, _r2, _r3h, _r3l, _r4h, _r4l, _srtmh, _srtml; \ double _r2PHr2h, _r2PHr2l, _r2Sqh, _r2Sql; \ double _mMr2h, _mMr2l, _mMr2Ch, _mMr2Cl; \ double _MHmMr2Ch, _MHmMr2Cl; \ double _r3Sqh, _r3Sql, _mMr3Sqh, _mMr3Sql; \ double _half; \ \ /* Special case x = 0 */ \ if ((x) == 0.0) { \ (*(resh)) = (x); \ (*(resl)) = 0.0; \ } else { \ \ _E = 0.0; \ \ /* Convert to integer format */ \ _xdb.d = (x); \ \ /* Handle subnormal case */ \ if (_xdb.i[HI] < 0x00100000) { \ _E = -52; \ _xdb.d *= ((db_number) ((double) SQRTTWO52)).d; \ /* make x a normal number */ \ } \ \ /* Extract exponent E and mantissa m */ \ _E += (_xdb.i[HI]>>20)-1023; \ _xdb.i[HI] = (_xdb.i[HI] & 0x000fffff) | 0x3ff00000; \ _m = _xdb.d; \ \ _half = 0.5; \ /* Make exponent even */ \ if (_E & 0x00000001) { \ _E++; \ _m *= _half; /* Suppose now 1/2 <= m <= 2 */ \ } \ \ /* Construct sqrt(2^E) = 2^(E/2) */ \ _xdb.i[HI] = (_E/2 + 1023) << 20; \ _xdb.i[LO] = 0; \ \ /* Compute initial approximation to r = 1/sqrt(m) */ \ \ _r0 = SQRTPOLYC0 + \ _m * (SQRTPOLYC1 + _m * (SQRTPOLYC2 + _m * (SQRTPOLYC3 + _m * SQRTPOLYC4))); \ \ /* Iterate two times on double precision */ \ \ _r1 = _half * _r0 * (3.0 - _m * (_r0 * _r0)); \ _r2 = _half * _r1 * (3.0 - _m * (_r1 * _r1)); \ \ /* Iterate once on double-double precision */ \ \ Mul12(&_r2Sqh, &_r2Sql, _r2, _r2); \ Add12(_r2PHr2h, _r2PHr2l, _r2, (_half * _r2)); \ Mul12(&_mMr2h, &_mMr2l, _m, _r2); \ Mul22(&_mMr2Ch, &_mMr2Cl, _mMr2h, _mMr2l, _r2Sqh, _r2Sql); \ \ _MHmMr2Ch = -_half * _mMr2Ch; \ _MHmMr2Cl = -_half * _mMr2Cl; \ \ Add22(&_r3h, &_r3l, _r2PHr2h, _r2PHr2l, _MHmMr2Ch, _MHmMr2Cl); \ \ /* Multiply obtained reciprocal square root by m */ \ \ Mul22(&_srtmh,&_srtml,_m,0.0,_r3h,_r3l); \ \ /* Multiply componentwise by sqrt(2^E) */ \ /* which is an integer power of 2 that may not produce a subnormal */ \ \ (*(resh)) = _xdb.d * _srtmh; \ (*(resl)) = _xdb.d * _srtml; \ \ } /* End: special case 0 */ \ } /* sqrt12_64_unfiltered = sqrt(x) * (1 + eps) where abs(eps) <= 2^(-64) if x is neither subnormal nor 0 */ #define sqrt12_64_unfiltered(resh, resl, x) { \ db_number _xdb; \ int _E; \ double _m, _r0, _r1, _r2, _r3h, _r3l, _srtmh, _srtml; \ double _r2PHr2h, _r2PHr2l, _r2Sqh, _r2Sql; \ double _mMr2h, _mMr2l, _mMr2Ch, _mMr2Cl; \ double _MHmMr2Ch, _MHmMr2Cl; \ double _half; \ \ \ \ /* Convert to integer format */ \ _xdb.d = (x); \ \ \ /* Extract exponent E and mantissa m */ \ _E = (_xdb.i[HI]>>20)-1023; \ _xdb.i[HI] = (_xdb.i[HI] & 0x000fffff) | 0x3ff00000; \ _m = _xdb.d; \ \ _half = 0.5; \ /* Make exponent even */ \ if (_E & 0x00000001) { \ _E++; \ _m *= _half; /* Suppose now 1/2 <= m <= 2 */ \ } \ \ /* Construct sqrt(2^E) = 2^(E/2) */ \ _xdb.i[HI] = (_E/2 + 1023) << 20; \ _xdb.i[LO] = 0; \ \ /* Compute initial approximation to r = 1/sqrt(m) */ \ \ _r0 = SQRTPOLYC0 + \ _m * (SQRTPOLYC1 + _m * (SQRTPOLYC2 + _m * (SQRTPOLYC3 + _m * SQRTPOLYC4))); \ \ /* Iterate two times on double precision */ \ \ _r1 = _half * _r0 * (3.0 - _m * (_r0 * _r0)); \ _r2 = _half * _r1 * (3.0 - _m * (_r1 * _r1)); \ \ /* Iterate once on double-double precision */ \ \ Mul12(&_r2Sqh, &_r2Sql, _r2, _r2); \ Add12(_r2PHr2h, _r2PHr2l, _r2, (_half * _r2)); \ Mul12(&_mMr2h, &_mMr2l, _m, _r2); \ Mul22(&_mMr2Ch, &_mMr2Cl, _mMr2h, _mMr2l, _r2Sqh, _r2Sql); \ \ _MHmMr2Ch = -_half * _mMr2Ch; \ _MHmMr2Cl = -_half * _mMr2Cl; \ \ Add22(&_r3h, &_r3l, _r2PHr2h, _r2PHr2l, _MHmMr2Ch, _MHmMr2Cl); \ \ /* Multiply obtained reciprocal square root by m */ \ \ Mul122(&_srtmh,&_srtml,_m,_r3h,_r3l); \ \ /* Multiply componentwise by sqrt(2^E) */ \ /* which is an integer power of 2 that may not produce a subnormal */ \ \ (*(resh)) = _xdb.d * _srtmh; \ (*(resl)) = _xdb.d * _srtml; \ \ } #endif /*SQRT_AS_FUNCTIONS*/ /* Declaration of the debug function */ void printHexa(char* s, double x); #endif /*CRLIBM_PRIVATE_H*/ interval-2.1.0/src/crlibm/csh_fast.c0000644000000000000000000005372513031036767015503 0ustar 00000000000000/* * Correctly rounded hyperbolic sine and cosine * * Author : Matthieu Gallet, Florent de Dinechin * * This file is part of the crlibm library, developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "csh_fast.h" #include "triple-double.h" void exp13(int *exponent, double *exp_h, double *exp_m, double *exp_l, double x); void expm1_13(double *exp_h, double *exp_m, double *exp_l, double x); /* switches on various printfs. Default 0 */ #define DEBUG 0 static const double largest_double = 0x1.fffffffffffffp1023; static const double tiniest_double = 0x1.0p-1074; enum{RN,RD,RU,RZ}; static void do_cosh(double x, double* preshi, double* preslo){ int k; db_number y; double ch_hi, ch_lo, sh_hi, sh_lo;/* cosh(x) = (ch_hi + ch_lo)*(cosh(k*ln(2)) + (sh_hi + sh_lo)*(sinh(k*ln(2))) */ db_number table_index_float; int table_index; double temp_hi, temp_lo, temp;/* some temporary variables */ double b_hi, b_lo,b_ca_hi, b_ca_lo, b_sa_hi, b_sa_lo; double ca_hi, ca_lo, sa_hi, sa_lo; /*will be the tabulated values */ double tcb_hi, tsb_hi; /*results of polynomial approximations*/ double square_b_hi; double ch_2_pk_hi, ch_2_pk_lo, ch_2_mk_hi, ch_2_mk_lo; double sh_2_pk_hi, sh_2_pk_lo, sh_2_mk_hi, sh_2_mk_lo; db_number two_p_plus_k, two_p_minus_k; /* 2^(k-1) + 2^(-k-1) */ /* First range reduction*/ DOUBLE2INT(k, x * inv_ln_2.d) if (k != 0){ /* b_hi+b_lo = x - (ln2_hi + ln2_lo) * k */ temp_hi = x - ln2_hi.d * k; temp_lo = -ln2_lo.d * k; Add12Cond(b_hi, b_lo, temp_hi, temp_lo); } else { b_hi = x; b_lo = 0.; } /*we'll construct 2 constants for the last reconstruction */ two_p_plus_k.i[LO] = 0; two_p_plus_k.i[HI] = (k-1+1023) << 20; two_p_minus_k.i[LO] = 0; two_p_minus_k.i[HI] = (-k-1+1023) << 20; /* at this stage, we've done the first range reduction : we have b_hi + b_lo between -ln(2)/2 and ln(2)/2 */ /* now we can do the second range reduction */ /* we'll get the 8 leading bits of b_hi */ table_index_float.d = b_hi + two_43_44.d; /*this add do the float equivalent of a rotation to the right, since -0.5 <= b_hi <= 0.5*/ table_index = table_index_float.i[LO];/* -89 <= table_index <= 89 */ table_index_float.d -= two_43_44.d; table_index += bias; /* to have only positive values */ b_hi -= table_index_float.d;/* to remove the 8 leading bits*/ /* since b_hi was between -2^-1 and 2^1, we now have b_hi between -2^-9 and 2^-9 */ y.d = b_hi; /* first, y */ square_b_hi = b_hi * b_hi; /* effective computation of the polynomial approximation */ if (((y.i[HI])&(0x7FFFFFFF)) < (two_minus_30.i[HI])) { tcb_hi = 0; tsb_hi = 0; } else { /* second, cosh(y) = y * (1/2 + y * (1/24 + y * 1/720)) */ tcb_hi = (square_b_hi)* (c2.d + square_b_hi * (c4.d + square_b_hi * c6.d)); tsb_hi = square_b_hi * (s3.d + square_b_hi * (s5.d + square_b_hi * s7.d)); } if( table_index != bias) { /* we get the tabulated the tabulated values */ ca_hi = cosh_sinh_table[table_index][0].d; ca_lo = cosh_sinh_table[table_index][1].d; sa_hi = cosh_sinh_table[table_index][2].d; sa_lo = cosh_sinh_table[table_index][3].d; /* first reconstruction of the cosh (corresponding to the second range reduction) */ Mul12(&b_sa_hi,&b_sa_lo, sa_hi, b_hi); temp = ((((((ca_lo + (b_hi * sa_lo)) + b_lo * sa_hi) + b_sa_lo) + (b_sa_hi * tsb_hi)) + ca_hi * tcb_hi) + b_sa_hi); Add12Cond(ch_hi, ch_lo, ca_hi, temp); /* first reconstruction for the sinh (corresponding to the second range reduction) */ } else { Add12Cond(ch_hi, ch_lo, (double) 1, tcb_hi); } if(k != 0) { if( table_index != bias) { /* first reconstruction for the sinh (corresponding to the second range reduction) */ Mul12(&b_ca_hi , &b_ca_lo, ca_hi, b_hi); temp = (((((sa_lo + (b_lo * ca_hi)) + (b_hi * ca_lo)) + b_ca_lo) + (sa_hi*tcb_hi)) + (b_ca_hi * tsb_hi)); Add12(temp_hi, temp_lo, b_ca_hi, temp); Add22Cond(&sh_hi, &sh_lo, sa_hi, (double) 0, temp_hi, temp_lo); } else { Add12Cond(sh_hi, sh_lo, b_hi, tsb_hi * b_hi + b_lo); } if((k < 35) && (k > -35) ) { ch_2_pk_hi = ch_hi * two_p_plus_k.d; ch_2_pk_lo = ch_lo * two_p_plus_k.d; ch_2_mk_hi = ch_hi * two_p_minus_k.d; ch_2_mk_lo = ch_lo * two_p_minus_k.d; sh_2_pk_hi = sh_hi * two_p_plus_k.d; sh_2_pk_lo = sh_lo * two_p_plus_k.d; sh_2_mk_hi = - sh_hi * two_p_minus_k.d; sh_2_mk_lo = - sh_lo * two_p_minus_k.d; Add22Cond(preshi, preslo, ch_2_mk_hi, ch_2_mk_lo, sh_2_mk_hi, sh_2_mk_lo); Add22Cond(&ch_2_mk_hi, &ch_2_mk_lo , sh_2_pk_hi, sh_2_pk_lo, *preshi, *preslo); Add22Cond(preshi, preslo, ch_2_pk_hi, ch_2_pk_lo, ch_2_mk_hi, ch_2_mk_lo); } else if (k >= 35) { ch_2_pk_hi = ch_hi * two_p_plus_k.d; ch_2_pk_lo = ch_lo * two_p_plus_k.d; sh_2_pk_hi = sh_hi * two_p_plus_k.d; sh_2_pk_lo = sh_lo * two_p_plus_k.d; Add22Cond(preshi, preslo, ch_2_pk_hi, ch_2_pk_lo, sh_2_pk_hi, sh_2_pk_lo); } else /* if (k <= -35) */ { ch_2_mk_hi = ch_hi * two_p_minus_k.d; ch_2_mk_lo = ch_lo * two_p_minus_k.d; sh_2_mk_hi = - sh_hi * two_p_minus_k.d; sh_2_mk_lo = - sh_lo * two_p_minus_k.d; Add22Cond(preshi, preslo, ch_2_mk_hi, ch_2_mk_lo, sh_2_mk_hi, sh_2_mk_lo); } } else { *preshi = ch_hi; *preslo = ch_lo; } return; } static void do_cosh_accurate(int* pexponent, double* presh, double* presm, double* presl, double x){ double exph, expm, expl; double expph, exppm, exppl; int exponentm, deltaexponent; db_number expmh, expmm, expml; #if EVAL_PERF==1 crlibm_second_step_taken++; #endif if(x<0) x=-x; if (x > 40.0) { /* then exp(-x) < 2^-118 exp(x) */ exp13(pexponent, presh, presm, presl, x); } else { exp13(pexponent, &expph, &exppm, &exppl, x); exp13(&exponentm, &(expmh.d), &(expmm.d), &(expml.d), -x); /* align the mantissas. The exponent is increased but stays well below overflow threshold */ deltaexponent = exponentm - *pexponent ; expmh.i[HI] += (deltaexponent) << 20; expmm.i[HI] += (deltaexponent) << 20; expml.i[HI] += (deltaexponent) << 20; Add33(&exph, &expm, &expl, expph, exppm, exppl, expmh.d, expmm.d, expml.d); Renormalize3(presh,presm,presl, exph, expm, expl); } } double cosh_rn(double x){ db_number y; int hx; double rh, rl; y.d = x; hx = y.i[HI] & 0x7FFFFFFF; /* Filter special cases */ if (hx > max_input_csh.i[HI]) { /* strictly greater, implies x > max_input_csh */ if (hx >= 0x7ff00000){ /* Infty or NaN */ if (((hx&0x000fffff)|y.i[LO])!=0) return x+x; /* Nan */ else {/* otherwise the result should be +infty */ y.i[HI] = 0x7FF00000; return (y.d); } } } if (x >= max_input_csh.d || x <= -max_input_csh.d) return largest_double * largest_double; /* overflow */ if (hx<0x3e500000) { if(x==0) return 1.0; /* exact */ else return (1.0+tiniest_double); /* to raise inexact flag */ } do_cosh(x, &rh, &rl); if (rh == (rh + (rl * round_cst_csh))) return rh; else{ int exponent; db_number res; double resh, resm, resl; do_cosh_accurate(&exponent, &resh,&resm, &resl, x); RoundToNearest3(&(res.d), resh, resm, resl); /* Now we have to set the exponent of res as exponent -1 (division by 2). However, as res may sometimes end up infinite, we first set the exponent to exponent -11 and then multiply by 2^10, which will cater for overflow */ res.i[HI] += (exponent-11) << 20; return 1024. * res.d; } } double cosh_ru(double x){ db_number y; int hx; double rh, rl; y.d = x; hx = y.i[HI] & 0x7FFFFFFF; if (hx > max_input_csh.i[HI]) { /* if NaN, return it */ if (((hx&0x7FF00000) == 0x7FF00000) && (((y.i[HI] & 0x000FFFFF)!=0) || (y.i[LO]!=0)) ) return x; else {/* otherwise the result should be +infty */ y.i[LO] = 0; y.i[HI] = 0x7FF00000; return (y.d); } } if (x >= max_input_csh.d || x <= -max_input_csh.d) return largest_double * largest_double; /* overflow */ if (hx<0x3e500000) { /* return the successor of 1 */ if(x==0.) return 1.0; else{ y.l = 0x3ff0000000000001LL; return y.d; } } do_cosh(x, &rh, &rl); TEST_AND_RETURN_RU(rh, rl, maxepsilon_csh); /* if the previous block didn't return a value, launch accurate phase */ { int exponent; db_number res; double resh, resm, resl; do_cosh_accurate(&exponent, &resh,&resm, &resl, x); RoundUpwards3(&(res.d), resh,resm,resl); /* Now we have to set the exponent of res as exponent -1 (division by 2). However, as res may sometimes end up infinite, we first set the exponent to exponent -11 and then multiply by 2^10, which will cater for overflow */ res.i[HI] += (exponent-11) << 20; return 1024. * res.d; } } double cosh_rd(double x){ db_number y; int hx; double rh, rl; y.d = x; hx = y.i[HI] & 0x7FFFFFFF; if (hx > max_input_csh.i[HI]) { if (hx >= 0x7FF00000) { /*particular cases : QNaN, SNaN, +- oo*/ if (((hx&0x7FF00000) == 0x7FF00000) && (((y.i[HI] & 0x000FFFFF)!=0) || (y.i[LO]!=0)) ) return x; /* NaN */ else { /* infinity */ y.i[HI] = hx; return (y.d); } } } if (y.d >= max_input_csh.d || y.d <= - max_input_csh.d) { /* out of range */ y.i[LO] = 0xFFFFFFFF; y.i[HI] = 0x7FEFFFFF ; return (y.d); } if (hx<0x3e500000) return (1.0); do_cosh(x, &rh, &rl); TEST_AND_RETURN_RD(rh, rl, maxepsilon_csh); /* if the previous block didn't return a value, launch accurate phase */ { int exponent; db_number res; double resh, resm, resl; do_cosh_accurate(&exponent, &resh,&resm, &resl, x); RoundDownwards3(&(res.d), resh,resm,resl); /* Now we have to set the exponent of res as exponent -1 (division by 2). However, as res may sometimes end up infinite, we first set the exponent to exponent -11 and then multiply by 2^10, which will cater for overflow */ res.i[HI] += (exponent-11) << 20; return 1024. * res.d; } } double cosh_rz(double x){ return(cosh_rd(x));/* cosh is always positive, so rounding to -infinite is equivalent to rounding to zero */ } static void do_sinh(double x, double* prh, double* prl){ int k; db_number y; double temp1; double ch_hi, ch_lo, sh_hi, sh_lo;/* cosh(x) = (sh_hi + sh_lo)*(cosh(k*ln(2)) + (ch_hi + ch_lo)*(sinh(k*ln(2))) */ db_number table_index_float; int table_index; double ch_2_pk_hi, ch_2_pk_lo, ch_2_mk_hi, ch_2_mk_lo; double sh_2_pk_hi, sh_2_pk_lo, sh_2_mk_hi, sh_2_mk_lo; double b_hi, b_lo; double ca_b_hi, ca_b_lo, temp_hi, temp_lo, sa_b_hi, sa_b_lo; double ca_hi, ca_lo, sa_hi, sa_lo; /*tabulated values */ double tcb_hi, tsb_hi; /*results of polynomial approximations*/ db_number two_p_plus_k, two_p_minus_k; /* 2^(k-1) + 2^(-k-1) */ double square_y_hi; /* Now we can do the first range reduction*/ DOUBLE2INT(k, x * inv_ln_2.d) if (k != 0){ /* b_hi + b_lo = x - (ln2_hi + ln2_lo) * k */ temp_hi = x - ln2_hi.d * k; temp_lo = -ln2_lo.d * k; Add12Cond(b_hi, b_lo, temp_hi, temp_lo); } else { b_hi = x; b_lo = 0.; } /*we'll construct 2 constants for the last reconstruction */ two_p_plus_k.i[LO] = 0; two_p_plus_k.i[HI] = (k-1+1023) << 20; two_p_minus_k.i[LO] = 0; two_p_minus_k.i[HI] = (-k-1+1023) << 20; /* at this stage, we've done the first range reduction : we have b_hi + b_lo between -ln(2)/2 and ln(2)/2 */ /* now we can do the second range reduction */ /* we'll get the 8 leading bits of r_hi */ table_index_float.d = b_hi + two_43_44.d; /*this add do the float equivalent of a rotation to the right, since -0.5 <= b_hi <= 0.5*/ table_index = table_index_float.i[LO];/* -89 <= table_index <= 89 */ table_index_float.d -= two_43_44.d; table_index += bias; /* to have only positive values */ b_hi -= table_index_float.d;/* to remove the 8 leading bits*/ /* since b_hi was between -2^-1 and 2^1, we now have b_hi between -2^-9 and 2^-9 */ y.d = b_hi; /* first, y = square_y_hi + square_y_lo */ square_y_hi = b_hi * b_hi; /* effective computation of the polyomial approximation */ if (((y.i[HI])&(0x7FFFFFFF)) <= (two_minus_30.i[HI])) { tsb_hi = 0; tcb_hi = 0; } else { tsb_hi = square_y_hi * (s3.d + square_y_hi * (s5.d + square_y_hi * s7.d)); /* second, cosh(y) = y * (1/2 + y * (1/24 + y * 1/720)) */ tcb_hi = (square_y_hi)* (c2.d + square_y_hi * (c4.d + square_y_hi * c6.d)); } if( table_index != bias) { /* we get the tabulated the tabulated values*/ ca_hi = cosh_sinh_table[table_index][0].d; ca_lo = cosh_sinh_table[table_index][1].d; sa_hi = cosh_sinh_table[table_index][2].d; sa_lo = cosh_sinh_table[table_index][3].d; /* first reconstruction for the sinh (corresponding to the second range reduction) */ temp1 = sa_lo; temp1 += b_lo * ca_hi; temp1 += b_hi * ca_lo; Mul12(&ca_b_hi, &ca_b_lo, ca_hi, b_hi); temp1 += ca_b_lo; temp1 += sa_hi * tcb_hi; temp1 += ca_b_hi * tsb_hi; Add12Cond(temp_hi, temp_lo, ca_b_hi, temp1); Add22Cond(&sh_hi, &sh_lo, sa_hi, (double) 0, temp_hi, temp_lo); /* first reconstruction of the cosh (corresponding to the second range reduction) */ temp1 = ca_lo; Mul12(&sa_b_hi,&sa_b_lo, sa_hi, b_hi); temp1 += b_hi * sa_lo; temp1 += b_lo * sa_hi; temp1 += sa_b_lo; temp1 += sa_b_hi * tsb_hi; temp1 += ca_hi * tcb_hi; temp1 += sa_b_hi; Add12Cond(ch_hi, ch_lo, ca_hi, temp1); } else { Add12Cond(sh_hi, sh_lo, b_hi, tsb_hi * b_hi + b_lo); Add12Cond(ch_hi, ch_lo, (double) 1, tcb_hi); } if(k != 0) { if( (k < 35) && (k > -35) ) { ch_2_pk_hi = ch_hi * two_p_plus_k.d; ch_2_pk_lo = ch_lo * two_p_plus_k.d; ch_2_mk_hi = - ch_hi * two_p_minus_k.d; ch_2_mk_lo = - ch_lo * two_p_minus_k.d; sh_2_pk_hi = sh_hi * two_p_plus_k.d; sh_2_pk_lo = sh_lo * two_p_plus_k.d; sh_2_mk_hi = sh_hi * two_p_minus_k.d; sh_2_mk_lo = sh_lo * two_p_minus_k.d; Add22Cond(prh, prl, ch_2_mk_hi, ch_2_mk_lo, sh_2_mk_hi, sh_2_mk_lo); Add22Cond(&ch_2_mk_hi, &ch_2_mk_lo , sh_2_pk_hi, sh_2_pk_lo, *prh, *prl); Add22Cond(prh, prl, ch_2_pk_hi, ch_2_pk_lo, ch_2_mk_hi, ch_2_mk_lo); } else if (k >= 35) { ch_2_pk_hi = ch_hi * two_p_plus_k.d; ch_2_pk_lo = ch_lo * two_p_plus_k.d; sh_2_pk_hi = sh_hi * two_p_plus_k.d; sh_2_pk_lo = sh_lo * two_p_plus_k.d; Add22Cond(prh, prl, ch_2_pk_hi, ch_2_pk_lo, sh_2_pk_hi, sh_2_pk_lo); } else { ch_2_mk_hi = - ch_hi * two_p_minus_k.d; ch_2_mk_lo = - ch_lo * two_p_minus_k.d; sh_2_mk_hi = sh_hi * two_p_minus_k.d; sh_2_mk_lo = sh_lo * two_p_minus_k.d; Add22Cond(prh, prl, ch_2_mk_hi, ch_2_mk_lo, sh_2_mk_hi, sh_2_mk_lo); } } else { *prh = sh_hi; *prl = sh_lo; } } static void do_sinh_accurate(int* pexponent, double* presh, double* presm, double* presl, double x){ double exph, expm, expl; double expph, exppm, exppl, expmh, expmm, expml; #if EVAL_PERF==1 crlibm_second_step_taken++; #endif if(x > 40.0) { /* then exp(-x) < 2^-129 exp(x) */ exp13(pexponent, presh, presm, presl, x); return; } if(x < -40.0) { /* then exp(x) < 2^-129 exp(-x) */ exp13(pexponent, presh, presm, presl, -x); *presh = -*presh; *presm = -*presm; *presl = -*presl; return; } /* Otherwise we are between -40 and 40, and we also know that |x| > 2^-25 */ if(x>0.0) { expm1_13(&expph, &exppm, &exppl, x); expm1_13(&expmh, &expmm, &expml, -x); /* The following is OK because expph and -expmh have the same sign */ Add33(&exph, &expm, &expl, expph, exppm, exppl, -expmh, -expmm, -expml); Renormalize3(presh,presm,presl, exph, expm, expl); *pexponent=0; return; } else { /* x<0 */ expm1_13(&expph, &exppm, &exppl, x); expm1_13(&expmh, &expmm, &expml, -x); /* The following is OK because expph and -expmh have the same sign */ Add33(&exph, &expm, &expl, -expmh, -expmm, -expml, expph, exppm, exppl); Renormalize3(presh,presm,presl, exph, expm, expl); *pexponent=0; return; } } double sinh_rn(double x){ db_number y; int hx; double rh, rl; y.d = x; hx = y.i[HI] & 0x7FFFFFFF; /* Filter special cases */ if (hx > max_input_csh.i[HI]) { /* strictly greater, implies x > max_input_csh */ if (hx >= 0x7ff00000){ /* infinity or NaN */ if (((hx&0x000fffff)|y.i[LO])!=0) return x+x; /* NaN */ else {/* otherwise the result should be +infty */ return (y.d); } } if (x > max_input_csh.d) return largest_double * largest_double; /* overflow */ if (x < -max_input_csh.d) return -largest_double * largest_double; /* overflow */ } if (hx<0x3e500000) { return x; /* exact, we should find some way of raising the inexact flag */ } do_sinh(x, &rh, &rl); if (rh == (rh + (rl * round_cst_csh))) return rh; else{ int exponent; db_number res; double resh, resm, resl; do_sinh_accurate(&exponent, &resh,&resm, &resl, x); RoundToNearest3(&(res.d), resh, resm, resl); /* Now we have to set the exponent of res as exponent -1 (division by 2). However, as res may sometimes end up infinite, we first set the exponent to exponent -11 and then multiply by 2^10, which will cater for overflow */ res.i[HI] += (exponent-11) << 20; return 1024. * res.d; } } double sinh_ru(double x){ db_number y; double rh, rl; y.d = x; y.i[HI] = y.i[HI] & 0x7FFFFFFF; /* to get the absolute value of the input */ if ((y.i[HI] & 0x7FF00000) >= (0x7FF00000)) { /*particular cases : QNaN, SNaN, +- oo*/ return (x); } if (y.d > max_input_csh.d) { /* out of range */ if(x>0) { y.i[LO] = 0; y.i[HI] = 0x7FF00000; return (y.d); } else { y.i[LO] = 0xFFFFFFFF; y.i[HI] = 0xFFEFFFFF ; return (y.d); } } if(y.i[HI] < 0x3e500000) /* 2^(-26) */ { /* Add one ulp if x positive */ if(x>0) { y.l++; return y.d; } else return x; } do_sinh(x, &rh, &rl); TEST_AND_RETURN_RU(rh, rl, maxepsilon_csh); /* if the previous block didn't return a value, launch accurate phase */ { int exponent; db_number res; double resh, resm, resl; do_sinh_accurate(&exponent, &resh,&resm, &resl, x); RoundUpwards3(&(res.d), resh,resm,resl); /* Now we have to set the exponent of res as exponent -1 (division by 2). However, as res may sometimes end up infinite, we first set the exponent to exponent -11 and then multiply by 2^10, which will cater for overflow */ res.i[HI] += (exponent-11) << 20; return 1024. * res.d; } } double sinh_rd(double x){ db_number y; double rh, rl; y.d = x; y.i[HI] = y.i[HI] & 0x7FFFFFFF; /* to get the absolute value of the input */ if ((y.i[HI] & 0x7FF00000) >= (0x7FF00000)) { /*particular cases : QNaN, SNaN, +- oo*/ y.d = x; return (y.d); } if (y.d > max_input_csh.d) { /* out of range */ if(x>0) { y.i[LO] = 0xFFFFFFFF; y.i[HI] = 0x7FEFFFFF ; return (y.d); } else { y.i[LO] = 0; y.i[HI] = 0xFFF00000; return (y.d); } } if(y.i[HI] < 0x3e500000) /* 2^(-26) */ { /* Add one ulp and restore the sign if x negative */ if(x<0){ y.l = (y.l+1); return -y.d; } else return x; } do_sinh(x, &rh, &rl); TEST_AND_RETURN_RD(rh, rl, maxepsilon_csh); /* if the previous block didn't return a value, launch accurate phase */ { int exponent; db_number res; double resh, resm, resl; do_sinh_accurate(&exponent, &resh,&resm, &resl, x); RoundDownwards3(&(res.d), resh,resm,resl); /* Now we have to set the exponent of res as exponent -1 (division by 2). However, as res may sometimes end up infinite, we first set the exponent to exponent -11 and then multiply by 2^10, which will cater for overflow */ res.i[HI] += (exponent-11) << 20; return 1024. * res.d; } } double sinh_rz(double x){ if( x > 0) { return(sinh_rd(x)); } else { return(sinh_ru(x)); } } interval-2.1.0/src/crlibm/csh_fast.h0000644000000000000000000013102113031036767015472 0ustar 00000000000000 /* File generated by maple/csh.mpl */ static double maxepsilon_csh = 7.691977781471974651029816959786e-19 ; static double round_cst_csh = 1.014076581900344724984466743033e+00 ; #ifdef WORDS_BIGENDIAN static db_number const inv_ln_2 = {{0x3FF71547,0x652B82FE}}; /*1.4426950409e+00*/ static db_number const ln2_hi = {{0x3FE62E42,0xFEFA3800}}; /*6.9314718056e-01*/ static db_number const ln2_lo = {{0x3D2EF357,0x93C76730}}; /*5.4979230187e-14*/ static db_number const two_43_44 = {{0x42B80000,0x00000000}}; /*2.6388279067e+13*/ static db_number const two_minus_30 = {{0x3D700000,0x00000000}}; /*9.0949470177e-13*/ static int const bias = 89 ; /* some bounds */ static db_number const max_input_csh = {{0x408633CE,0x8FB9F87E}}; /*7.1047586007e+02*/ static const db_number cosh_sinh_table[179][4] = { {{{0x3FF0FA08, 0xD2F35F97}}, {{0x3C9B39D1, 0x9DAB3AF1}}, {{0xBFD6B36F, 0xBB84C928}}, {{0xBC68DAF8, 0xFEFE1E5F}}}, {{{0x3FF0F464, 0x73177841}}, {{0xBC97DF60, 0x29551C51}}, {{0xBFD66F92, 0xE6A06FC9}}, {{0x3C70A785, 0xD9A66B42}}}, {{{0x3FF0EED1, 0x07A16DB4}}, {{0x3C988108, 0xD3E071F5}}, {{0xBFD62BCC, 0x8150DBAB}}, {{0xBC7700BD, 0xF95D00CA}}}, {{{0x3FF0E94E, 0x8AFDD406}}, {{0xBC9330CB, 0xB0B14F49}}, {{0xBFD5E81C, 0x47CFA1DB}}, {{0x3C791EC5, 0x4E7B2C63}}}, {{{0x3FF0E3DC, 0xF7AA2E1B}}, {{0x3C9C05BD, 0xF7FB3140}}, {{0xBFD5A481, 0xF66C8331}}, {{0xBC6E8E0C, 0xCFF78DD1}}}, {{{0x3FF0DE7C, 0x4834E82E}}, {{0xBC877BEC, 0x5F430E44}}, {{0xBFD560FD, 0x498D28AA}}, {{0x3C4F07B3, 0xCCEA8A26}}}, {{{0x3FF0D92C, 0x773D5255}}, {{0xBC84956C, 0x3D5D1DA2}}, {{0xBFD51D8D, 0xFDACDFC5}}, {{0x3C419F0E, 0x98966B86}}}, {{{0x3FF0D3ED, 0x7F739B28}}, {{0xBC99722F, 0xEA8A9ED5}}, {{0xBFD4DA33, 0xCF5C5703}}, {{0xBC7B1F07, 0x7BE71FBE}}}, {{{0x3FF0CEBF, 0x5B98CA6C}}, {{0x3C9E8080, 0x09B9F220}}, {{0xBFD496EE, 0x7B415A78}}, {{0x3C51C3BA, 0xBDFE61F1}}}, {{{0x3FF0C9A2, 0x067EBBDA}}, {{0x3C813CD8, 0x803D61F3}}, {{0xBFD453BD, 0xBE16906C}}, {{0xBC78D781, 0x45D8536E}}}, {{{0x3FF0C495, 0x7B0819E9}}, {{0x3C9A26E0, 0x6E52BA24}}, {{0xBFD410A1, 0x54AB361D}}, {{0x3C78DCB6, 0xCF7DA2E8}}}, {{{0x3FF0BF99, 0xB42858B8}}, {{0xBC67AD83, 0x0B1F30A5}}, {{0xBFD3CD98, 0xFBE2DC86}}, {{0x3C7D0A5E, 0x269038FC}}}, {{{0x3FF0BAAE, 0xACE3B0FC}}, {{0xBC93292F, 0x75521E77}}, {{0xBFD38AA4, 0x70B52549}}, {{0x3C67F94B, 0x0B01B8A6}}}, {{{0x3FF0B5D4, 0x604F1B07}}, {{0x3C732C14, 0x07EECFA5}}, {{0xBFD347C3, 0x702D7FA4}}, {{0xBC7435BE, 0x701422C8}}}, {{{0x3FF0B10A, 0xC99049DE}}, {{0xBC617C2D, 0x610FCC2E}}, {{0xBFD304F5, 0xB76AE57E}}, {{0x3C75EB09, 0x42E4CA9C}}}, {{{0x3FF0AC51, 0xE3DDA65B}}, {{0x3C9B22C0, 0x9DACA977}}, {{0xBFD2C23B, 0x039F9881}}, {{0xBC577301, 0x9B082732}}}, {{{0x3FF0A7A9, 0xAA7E4A68}}, {{0x3C71B296, 0x281520E0}}, {{0xBFD27F93, 0x1210DF54}}, {{0x3C6EF999, 0x502A1E59}}}, {{{0x3FF0A312, 0x18C9FC41}}, {{0x3C885259, 0x09E044C2}}, {{0xBFD23CFD, 0xA016C2D9}}, {{0x3C500762, 0x449D986B}}}, {{{0x3FF09E8B, 0x2A2929D1}}, {{0xBC9EE5F5, 0x535446B4}}, {{0xBFD1FA7A, 0x6B1BCB8A}}, {{0xBC50621A, 0x5A4CB636}}}, {{{0x3FF09A14, 0xDA14E415}}, {{0xBC965668, 0x233B29C8}}, {{0xBFD1B809, 0x309CBEE1}}, {{0xBC6E5B16, 0xBBB1CB75}}}, {{{0x3FF095AF, 0x2416DA9A}}, {{0x3C8024A0, 0x39DC7749}}, {{0xBFD175A9, 0xAE285CD6}}, {{0x3C3DB749, 0xC4496E39}}}, {{{0x3FF0915A, 0x03C95705}}, {{0x3C78A8A6, 0x0BD1CD00}}, {{0xBFD1335B, 0xA15F1D6C}}, {{0x3C53CE0F, 0x341ED7B6}}}, {{{0x3FF08D15, 0x74D738AC}}, {{0xBC984BD5, 0xC4A8C043}}, {{0xBFD0F11E, 0xC7F2EE53}}, {{0xBC75BADF, 0xC5355AFC}}}, {{{0x3FF088E1, 0x72FBF041}}, {{0xBC9DE12F, 0x0D55140F}}, {{0xBFD0AEF2, 0xDFA6F09B}}, {{0x3C414E60, 0xA7827088}}}, {{{0x3FF084BD, 0xFA037B8F}}, {{0xBC7D97E2, 0xE3C5EBFC}}, {{0xBFD06CD7, 0xA64F3673}}, {{0xBC6370BA, 0x839871E4}}}, {{{0x3FF080AB, 0x05CA6146}}, {{0xBC723216, 0xFC66378F}}, {{0xBFD02ACC, 0xD9D08102}}, {{0x3C5998B3, 0x20C03715}}}, {{{0x3FF07CA8, 0x923DACD6}}, {{0xBC9653A7, 0xE736D67A}}, {{0xBFCFD1A4, 0x703FFC8F}}, {{0xBC59EA3B, 0xA8860819}}}, {{{0x3FF078B6, 0x9B5AEA5C}}, {{0xBC8880D6, 0x6B6D819B}}, {{0xBFCF4DCE, 0xFE860E28}}, {{0xBC6883D4, 0xC6A2C678}}}, {{{0x3FF074D5, 0x1D3022A1}}, {{0x3C9E93F8, 0x2426EF93}}, {{0xBFCECA18, 0xDA9DBA19}}, {{0x3C36D470, 0x491D8A98}}}, {{{0x3FF07104, 0x13DBD729}}, {{0x3C766560, 0xCA5328ED}}, {{0xBFCE4681, 0x80D0D17F}}, {{0x3C605627, 0x658D0660}}}, {{{0x3FF06D43, 0x7B8CFE4D}}, {{0xBC73ADF7, 0xD1025E7E}}, {{0xBFCDC308, 0x6D87EF96}}, {{0x3C6C0BD9, 0x2A97B34C}}}, {{{0x3FF06993, 0x5082FF6E}}, {{0x3C7685C4, 0xD7395A9F}}, {{0xBFCD3FAD, 0x1D49F620}}, {{0x3C5DE851, 0x26ECE4F0}}}, {{{0x3FF065F3, 0x8F0DAF34}}, {{0xBC7821B3, 0xAF1520A9}}, {{0xBFCCBC6F, 0x0CBB89ED}}, {{0xBC4B40A0, 0x51092884}}}, {{{0x3FF06264, 0x338D4BDC}}, {{0xBC90000F, 0xF34422A4}}, {{0xBFCC394D, 0xB89E8F7F}}, {{0xBC646F77, 0x52292D2D}}}, {{{0x3FF05EE5, 0x3A727999}}, {{0x3C92512F, 0x6647668D}}, {{0xBFCBB648, 0x9DD1A7CC}}, {{0x3C234425, 0x3ED3824D}}}, {{{0x3FF05B76, 0xA03E3F07}}, {{0x3C7CA615, 0x2B52E765}}, {{0xBFCB335F, 0x394FAD1B}}, {{0xBC47F257, 0x34B51ACE}}}, {{{0x3FF05818, 0x618201A8}}, {{0xBC8BFA98, 0x5A557953}}, {{0xBFCAB091, 0x082F3002}}, {{0x3C4B6626, 0x60BF022C}}}, {{{0x3FF054CA, 0x7ADF8277}}, {{0x3C89C0C1, 0x377A9F8C}}, {{0xBFCA2DDD, 0x87A1F479}}, {{0xBC67E5CE, 0xF07409B2}}}, {{{0x3FF0518C, 0xE908DA8C}}, {{0x3C987D18, 0x25A535E2}}, {{0xBFC9AB44, 0x34F46F10}}, {{0xBC1274BC, 0x57573053}}}, {{{0x3FF04E5F, 0xA8C077CC}}, {{0xBC9D8190, 0xECF07BF2}}, {{0xBFC928C4, 0x8D8D4236}}, {{0xBC556048, 0x370EDF81}}}, {{{0x3FF04B42, 0xB6D919A9}}, {{0xBC9F2338, 0x92AA0A0B}}, {{0xBFC8A65E, 0x0EECBBA5}}, {{0x3C6339DB, 0x0663DF15}}}, {{{0x3FF04836, 0x1035CDFA}}, {{0xBC9E50AA, 0xBBC5EC1C}}, {{0xBFC82410, 0x36AC51DD}}, {{0xBC5A42DC, 0xDF8CB355}}}, {{{0x3FF04539, 0xB1C9EDDA}}, {{0x3C8D2224, 0xC7598281}}, {{0xBFC7A1DA, 0x827E21C3}}, {{0xBC6CB79F, 0x06D46085}}}, {{{0x3FF0424D, 0x98991A9F}}, {{0x3C66BB23, 0xA130683D}}, {{0xBFC71FBC, 0x702C6C4F}}, {{0xBC6BAA2A, 0x00C832DD}}}, {{{0x3FF03F71, 0xC1B73AD9}}, {{0xBC885168, 0xA8202E85}}, {{0xBFC69DB5, 0x7D991458}}, {{0x3C69321C, 0x97B08BD2}}}, {{{0x3FF03CA6, 0x2A487769}}, {{0xBC9585FD, 0xB95A2E63}}, {{0xBFC61BC5, 0x28BD1C73}}, {{0x3C625559, 0x2267ECEB}}}, {{{0x3FF039EA, 0xCF8138A4}}, {{0x3C8ACC0C, 0x8FE6098D}}, {{0xBFC599EA, 0xEFA824F1}}, {{0x3C5F28E7, 0x2B9BA1A8}}}, {{{0x3FF0373F, 0xAEA6238A}}, {{0xBC73E9A1, 0x72989A92}}, {{0xBFC51826, 0x507FE9EB}}, {{0x3C6AC219, 0x6946DA28}}}, {{{0x3FF034A4, 0xC50C1706}}, {{0xBC8A9076, 0x7ECC2F29}}, {{0xBFC49676, 0xC97FC168}}, {{0x3C6B5D13, 0x93C07384}}}, {{{0x3FF0321A, 0x10182946}}, {{0x3C88FA5C, 0xFE5F3FF1}}, {{0xBFC414DB, 0xD8F81999}}, {{0x3C3E1438, 0x0B2260AC}}}, {{{0x3FF02F9F, 0x8D3FA521}}, {{0xBC58A44A, 0x88A18235}}, {{0xBFC39354, 0xFD4DF72A}}, {{0xBC4EAAC2, 0x64EC3B0C}}}, {{{0x3FF02D35, 0x3A080789}}, {{0xBC907780, 0xF6C7E6F8}}, {{0xBFC311E1, 0xB4FA73A6}}, {{0x3C61065E, 0x4C87081D}}}, {{{0x3FF02ADB, 0x1406FD12}}, {{0x3C969329, 0x720D8336}}, {{0xBFC29081, 0x7E8A3BEF}}, {{0x3C65A4E2, 0x8F21151D}}}, {{{0x3FF02891, 0x18E25F8B}}, {{0xBC9A7DA4, 0x524ABA66}}, {{0xBFC20F33, 0xD89D0ECD}}, {{0x3C6557F7, 0x55A9198D}}}, {{{0x3FF02657, 0x4650339C}}, {{0xBC31EC5D, 0x0688DD52}}, {{0xBFC18DF8, 0x41E53B8C}}, {{0xBC49852D, 0x50E682BB}}}, {{{0x3FF0242D, 0x9A16A685}}, {{0xBC7352FD, 0x295277DB}}, {{0xBFC10CCE, 0x392720B0}}, {{0xBC55A291, 0x1E4C8E28}}}, {{{0x3FF02214, 0x120C0BDE}}, {{0xBC9456D2, 0x6B72974E}}, {{0xBFC08BB5, 0x3D38AAB7}}, {{0xBC60FB6D, 0xD37D3177}}}, {{{0x3FF0200A, 0xAC16DB6F}}, {{0xBC809B4F, 0x99576FC1}}, {{0xBFC00AAC, 0xCD00D2F1}}, {{0x3C53EA29, 0x146349DE}}}, {{{0x3FF01E11, 0x662DAF18}}, {{0xBC833F82, 0x3120653C}}, {{0xBFBF1368, 0xCEEE3CC9}}, {{0x3C5213E7, 0x7BD924AB}}}, {{{0x3FF01C28, 0x3E5740C5}}, {{0x3C95D295, 0x9EC02117}}, {{0xBFBE1197, 0x17463991}}, {{0xBC5E1FCA, 0x410E61A9}}}, {{{0x3FF01A4F, 0x32AA6878}}, {{0x3C833FDA, 0x67BCC8B5}}, {{0xBFBD0FE3, 0x7137CF18}}, {{0x3C4AE71D, 0x698E234C}}}, {{{0x3FF01886, 0x414E1A5C}}, {{0x3C4976C5, 0xE0B191DA}}, {{0xBFBC0E4C, 0xDB0F41D4}}, {{0x3C586525, 0xC9BFC58B}}}, {{{0x3FF016CD, 0x687964EF}}, {{0xBC9D38AB, 0x209297AD}}, {{0xBFBB0CD2, 0x5335E625}}, {{0xBC480157, 0xFBDC145A}}}, {{{0x3FF01524, 0xA6736F36}}, {{0x3C930803, 0xC450FC30}}, {{0xBFBA0B72, 0xD8311EBE}}, {{0xBC507AA8, 0x50193D71}}}, {{{0x3FF0138B, 0xF993770A}}, {{0xBC7502E0, 0xB809A4D7}}, {{0xBFB90A2D, 0x68A15B27}}, {{0xBC5B1BE3, 0x7F556554}}}, {{{0x3FF01203, 0x6040CF67}}, {{0x3C9847C0, 0x422FB0BC}}, {{0xBFB80901, 0x03411660}}, {{0xBC5DD342, 0x10739476}}}, {{{0x3FF0108A, 0xD8F2DEDB}}, {{0x3C93DC21, 0x53B40698}}, {{0xBFB707EC, 0xA6E3D59B}}, {{0x3C5030B2, 0xF456FFFF}}}, {{{0x3FF00F22, 0x62311DF8}}, {{0x3C99322E, 0xA7C410F3}}, {{0xBFB606EF, 0x5275270D}}, {{0x3C56910E, 0xE6EE4DC3}}}, {{{0x3FF00DC9, 0xFA9315DF}}, {{0xBC84D0E2, 0x602B4C56}}, {{0xBFB50608, 0x04F7A0DD}}, {{0xBC239FF7, 0xEDAF37D2}}}, {{{0x3FF00C81, 0xA0C05ED4}}, {{0xBC7736A7, 0x7A57AC2E}}, {{0xBFB40535, 0xBD83E026}}, {{0x3C4B9B73, 0x5F0B8AC5}}}, {{{0x3FF00B49, 0x53709EEA}}, {{0xBC9DF4D4, 0xF8CDACD0}}, {{0xBFB30477, 0x7B47880C}}, {{0xBC517BE5, 0x3B77E1B2}}}, {{{0x3FF00A21, 0x116B88B6}}, {{0xBC71D458, 0xAAAEC5A4}}, {{0xBFB203CC, 0x3D8440EF}}, {{0x3C1EF162, 0x41B5A4E1}}}, {{{0x3FF00908, 0xD988DA1B}}, {{0x3C9519B1, 0x94C96CA5}}, {{0xBFB10333, 0x038EB7A7}}, {{0x3C044B95, 0x317BAEA7}}}, {{{0x3FF00800, 0xAAB05B20}}, {{0xBC936EB9, 0x9FEBDB21}}, {{0xBFB002AA, 0xCCCD9CDD}}, {{0x3C53A7FD, 0xFAC9C47C}}}, {{{0x3FF00708, 0x83D9DCD5}}, {{0xBC9EC747, 0x430DE399}}, {{0xBFAE0465, 0x317148DD}}, {{0x3C4B5DB1, 0x7929765A}}}, {{{0x3FF00620, 0x640D384F}}, {{0xBC97FCBC, 0x170FB049}}, {{0xBFAC0392, 0xCDAF09CF}}, {{0x3C2B59CD, 0x7D4F7337}}}, {{{0x3FF00548, 0x4A624DAE}}, {{0x3C5D0575, 0x23E9C180}}, {{0xBFAA02DC, 0x6D81EE12}}, {{0x3C2A5E3B, 0x7E00BA39}}}, {{{0x3FF00480, 0x36010336}}, {{0xBC89227D, 0x10BEB244}}, {{0xBFA80240, 0x10336ABF}}, {{0x3C4941AF, 0xC229B627}}}, {{{0x3FF003C8, 0x26214474}}, {{0xBC4AE17A, 0x45DFB29B}}, {{0xBFA601BB, 0xB526F7CF}}, {{0x3C39422F, 0x2DA1796B}}}, {{{0x3FF00320, 0x1A0B0179}}, {{0x3C9FA45B, 0xD21A4C9A}}, {{0xBFA4014D, 0x5BD80F80}}, {{0xBC45A2E6, 0xA4813A5B}}}, {{{0x3FF00288, 0x11162E22}}, {{0x3C6F0E22, 0x2A930764}}, {{0xBFA200F3, 0x03D82DD0}}, {{0xBC4BE9EF, 0x0CBDB96B}}}, {{{0x3FF00200, 0x0AAAC16C}}, {{0x3C88618F, 0x578DDD8D}}, {{0xBFA000AA, 0xACCCD00D}}, {{0xBBFD9E59, 0x1EFF67C8}}}, {{{0x3FF00188, 0x0640B4E1}}, {{0x3C7FB10F, 0x8827C989}}, {{0xBF9C00E4, 0xACDAE8F4}}, {{0xBBE94741, 0x22A0BAC6}}}, {{{0x3FF00120, 0x0360040D}}, {{0xBC884C57, 0x402EAB5F}}, {{0xBF980090, 0x01033411}}, {{0xBC37E141, 0xDD340191}}}, {{{0x3FF000C8, 0x01A0AC06}}, {{0xBC7BD6C4, 0x673A2EEE}}, {{0xBF940053, 0x55BD803E}}, {{0xBBD1997B, 0xCA73460D}}}, {{{0x3FF00080, 0x00AAAB06}}, {{0xBC93E2BE, 0x2ABAD90D}}, {{0xBF90002A, 0xAACCCCDA}}, {{0x3C293021, 0x3AC1711C}}}, {{{0x3FF00048, 0x00360010}}, {{0x3C899AE6, 0xDB8F0A40}}, {{0xBF880024, 0x00103337}}, {{0x3C250734, 0xAF88B300}}}, {{{0x3FF00020, 0x000AAAAC}}, {{0x3C76C186, 0x1862ADFD}}, {{0xBF80000A, 0xAAACCCCD}}, {{0xBBBA01FC, 0x9193923E}}}, {{{0x3FF00008, 0x0000AAAB}}, {{0xBC93E93E, 0x8D68D67B}}, {{0xBF700002, 0xAAAACCCD}}, {{0x3C093193, 0x17BFB4DB}}}, {{{0x3FF00000, 0x00000000}}, {{0x00000000, 0x00000000}}, {{0x00000000, 0x00000000}}, {{0x00000000, 0x00000000}}}, {{{0x3FF00008, 0x0000AAAB}}, {{0xBC93E93E, 0x8D68D67B}}, {{0x3F700002, 0xAAAACCCD}}, {{0xBC093193, 0x17BFB4DB}}}, {{{0x3FF00020, 0x000AAAAC}}, {{0x3C76C186, 0x1862ADFD}}, {{0x3F80000A, 0xAAACCCCD}}, {{0x3BBA01FC, 0x9193923E}}}, {{{0x3FF00048, 0x00360010}}, {{0x3C899AE6, 0xDB8F0A40}}, {{0x3F880024, 0x00103337}}, {{0xBC250734, 0xAF88B300}}}, {{{0x3FF00080, 0x00AAAB06}}, {{0xBC93E2BE, 0x2ABAD90D}}, {{0x3F90002A, 0xAACCCCDA}}, {{0xBC293021, 0x3AC1711C}}}, {{{0x3FF000C8, 0x01A0AC06}}, {{0xBC7BD6C4, 0x673A2EEE}}, {{0x3F940053, 0x55BD803E}}, {{0x3BD1997B, 0xCA73460D}}}, {{{0x3FF00120, 0x0360040D}}, {{0xBC884C57, 0x402EAB5F}}, {{0x3F980090, 0x01033411}}, {{0x3C37E141, 0xDD340191}}}, {{{0x3FF00188, 0x0640B4E1}}, {{0x3C7FB10F, 0x8827C989}}, {{0x3F9C00E4, 0xACDAE8F4}}, {{0x3BE94741, 0x22A0BAC6}}}, {{{0x3FF00200, 0x0AAAC16C}}, {{0x3C88618F, 0x578DDD8D}}, {{0x3FA000AA, 0xACCCD00D}}, {{0x3BFD9E59, 0x1EFF67C8}}}, {{{0x3FF00288, 0x11162E22}}, {{0x3C6F0E22, 0x2A930764}}, {{0x3FA200F3, 0x03D82DD0}}, {{0x3C4BE9EF, 0x0CBDB96B}}}, {{{0x3FF00320, 0x1A0B0179}}, {{0x3C9FA45B, 0xD21A4C9A}}, {{0x3FA4014D, 0x5BD80F80}}, {{0x3C45A2E6, 0xA4813A5B}}}, {{{0x3FF003C8, 0x26214474}}, {{0xBC4AE17A, 0x45DFB29B}}, {{0x3FA601BB, 0xB526F7CF}}, {{0xBC39422F, 0x2DA1796B}}}, {{{0x3FF00480, 0x36010336}}, {{0xBC89227D, 0x10BEB244}}, {{0x3FA80240, 0x10336ABF}}, {{0xBC4941AF, 0xC229B627}}}, {{{0x3FF00548, 0x4A624DAE}}, {{0x3C5D0575, 0x23E9C180}}, {{0x3FAA02DC, 0x6D81EE12}}, {{0xBC2A5E3B, 0x7E00BA39}}}, {{{0x3FF00620, 0x640D384F}}, {{0xBC97FCBC, 0x170FB049}}, {{0x3FAC0392, 0xCDAF09CF}}, {{0xBC2B59CD, 0x7D4F7337}}}, {{{0x3FF00708, 0x83D9DCD5}}, {{0xBC9EC747, 0x430DE399}}, {{0x3FAE0465, 0x317148DD}}, {{0xBC4B5DB1, 0x7929765A}}}, {{{0x3FF00800, 0xAAB05B20}}, {{0xBC936EB9, 0x9FEBDB21}}, {{0x3FB002AA, 0xCCCD9CDD}}, {{0xBC53A7FD, 0xFAC9C47C}}}, {{{0x3FF00908, 0xD988DA1B}}, {{0x3C9519B1, 0x94C96CA5}}, {{0x3FB10333, 0x038EB7A7}}, {{0xBC044B95, 0x317BAEA7}}}, {{{0x3FF00A21, 0x116B88B6}}, {{0xBC71D458, 0xAAAEC5A4}}, {{0x3FB203CC, 0x3D8440EF}}, {{0xBC1EF162, 0x41B5A4E1}}}, {{{0x3FF00B49, 0x53709EEA}}, {{0xBC9DF4D4, 0xF8CDACD0}}, {{0x3FB30477, 0x7B47880C}}, {{0x3C517BE5, 0x3B77E1B2}}}, {{{0x3FF00C81, 0xA0C05ED4}}, {{0xBC7736A7, 0x7A57AC2E}}, {{0x3FB40535, 0xBD83E026}}, {{0xBC4B9B73, 0x5F0B8AC5}}}, {{{0x3FF00DC9, 0xFA9315DF}}, {{0xBC84D0E2, 0x602B4C56}}, {{0x3FB50608, 0x04F7A0DD}}, {{0x3C239FF7, 0xEDAF37D2}}}, {{{0x3FF00F22, 0x62311DF8}}, {{0x3C99322E, 0xA7C410F3}}, {{0x3FB606EF, 0x5275270D}}, {{0xBC56910E, 0xE6EE4DC3}}}, {{{0x3FF0108A, 0xD8F2DEDB}}, {{0x3C93DC21, 0x53B40698}}, {{0x3FB707EC, 0xA6E3D59B}}, {{0xBC5030B2, 0xF456FFFF}}}, {{{0x3FF01203, 0x6040CF67}}, {{0x3C9847C0, 0x422FB0BC}}, {{0x3FB80901, 0x03411660}}, {{0x3C5DD342, 0x10739476}}}, {{{0x3FF0138B, 0xF993770A}}, {{0xBC7502E0, 0xB809A4D7}}, {{0x3FB90A2D, 0x68A15B27}}, {{0x3C5B1BE3, 0x7F556554}}}, {{{0x3FF01524, 0xA6736F36}}, {{0x3C930803, 0xC450FC30}}, {{0x3FBA0B72, 0xD8311EBE}}, {{0x3C507AA8, 0x50193D71}}}, {{{0x3FF016CD, 0x687964EF}}, {{0xBC9D38AB, 0x209297AD}}, {{0x3FBB0CD2, 0x5335E625}}, {{0x3C480157, 0xFBDC145A}}}, {{{0x3FF01886, 0x414E1A5C}}, {{0x3C4976C5, 0xE0B191DA}}, {{0x3FBC0E4C, 0xDB0F41D4}}, {{0xBC586525, 0xC9BFC58B}}}, {{{0x3FF01A4F, 0x32AA6878}}, {{0x3C833FDA, 0x67BCC8B5}}, {{0x3FBD0FE3, 0x7137CF18}}, {{0xBC4AE71D, 0x698E234C}}}, {{{0x3FF01C28, 0x3E5740C5}}, {{0x3C95D295, 0x9EC02117}}, {{0x3FBE1197, 0x17463991}}, {{0x3C5E1FCA, 0x410E61A9}}}, {{{0x3FF01E11, 0x662DAF18}}, {{0xBC833F82, 0x3120653C}}, {{0x3FBF1368, 0xCEEE3CC9}}, {{0xBC5213E7, 0x7BD924AB}}}, {{{0x3FF0200A, 0xAC16DB6F}}, {{0xBC809B4F, 0x99576FC1}}, {{0x3FC00AAC, 0xCD00D2F1}}, {{0xBC53EA29, 0x146349DE}}}, {{{0x3FF02214, 0x120C0BDE}}, {{0xBC9456D2, 0x6B72974E}}, {{0x3FC08BB5, 0x3D38AAB7}}, {{0x3C60FB6D, 0xD37D3177}}}, {{{0x3FF0242D, 0x9A16A685}}, {{0xBC7352FD, 0x295277DB}}, {{0x3FC10CCE, 0x392720B0}}, {{0x3C55A291, 0x1E4C8E28}}}, {{{0x3FF02657, 0x4650339C}}, {{0xBC31EC5D, 0x0688DD52}}, {{0x3FC18DF8, 0x41E53B8C}}, {{0x3C49852D, 0x50E682BB}}}, {{{0x3FF02891, 0x18E25F8B}}, {{0xBC9A7DA4, 0x524ABA66}}, {{0x3FC20F33, 0xD89D0ECD}}, {{0xBC6557F7, 0x55A9198D}}}, {{{0x3FF02ADB, 0x1406FD12}}, {{0x3C969329, 0x720D8336}}, {{0x3FC29081, 0x7E8A3BEF}}, {{0xBC65A4E2, 0x8F21151D}}}, {{{0x3FF02D35, 0x3A080789}}, {{0xBC907780, 0xF6C7E6F8}}, {{0x3FC311E1, 0xB4FA73A6}}, {{0xBC61065E, 0x4C87081D}}}, {{{0x3FF02F9F, 0x8D3FA521}}, {{0xBC58A44A, 0x88A18235}}, {{0x3FC39354, 0xFD4DF72A}}, {{0x3C4EAAC2, 0x64EC3B0C}}}, {{{0x3FF0321A, 0x10182946}}, {{0x3C88FA5C, 0xFE5F3FF1}}, {{0x3FC414DB, 0xD8F81999}}, {{0xBC3E1438, 0x0B2260AC}}}, {{{0x3FF034A4, 0xC50C1706}}, {{0xBC8A9076, 0x7ECC2F29}}, {{0x3FC49676, 0xC97FC168}}, {{0xBC6B5D13, 0x93C07384}}}, {{{0x3FF0373F, 0xAEA6238A}}, {{0xBC73E9A1, 0x72989A92}}, {{0x3FC51826, 0x507FE9EB}}, {{0xBC6AC219, 0x6946DA28}}}, {{{0x3FF039EA, 0xCF8138A4}}, {{0x3C8ACC0C, 0x8FE6098D}}, {{0x3FC599EA, 0xEFA824F1}}, {{0xBC5F28E7, 0x2B9BA1A8}}}, {{{0x3FF03CA6, 0x2A487769}}, {{0xBC9585FD, 0xB95A2E63}}, {{0x3FC61BC5, 0x28BD1C73}}, {{0xBC625559, 0x2267ECEB}}}, {{{0x3FF03F71, 0xC1B73AD9}}, {{0xBC885168, 0xA8202E85}}, {{0x3FC69DB5, 0x7D991458}}, {{0xBC69321C, 0x97B08BD2}}}, {{{0x3FF0424D, 0x98991A9F}}, {{0x3C66BB23, 0xA130683D}}, {{0x3FC71FBC, 0x702C6C4F}}, {{0x3C6BAA2A, 0x00C832DD}}}, {{{0x3FF04539, 0xB1C9EDDA}}, {{0x3C8D2224, 0xC7598281}}, {{0x3FC7A1DA, 0x827E21C3}}, {{0x3C6CB79F, 0x06D46085}}}, {{{0x3FF04836, 0x1035CDFA}}, {{0xBC9E50AA, 0xBBC5EC1C}}, {{0x3FC82410, 0x36AC51DD}}, {{0x3C5A42DC, 0xDF8CB355}}}, {{{0x3FF04B42, 0xB6D919A9}}, {{0xBC9F2338, 0x92AA0A0B}}, {{0x3FC8A65E, 0x0EECBBA5}}, {{0xBC6339DB, 0x0663DF15}}}, {{{0x3FF04E5F, 0xA8C077CC}}, {{0xBC9D8190, 0xECF07BF2}}, {{0x3FC928C4, 0x8D8D4236}}, {{0x3C556048, 0x370EDF81}}}, {{{0x3FF0518C, 0xE908DA8C}}, {{0x3C987D18, 0x25A535E2}}, {{0x3FC9AB44, 0x34F46F10}}, {{0x3C1274BC, 0x57573053}}}, {{{0x3FF054CA, 0x7ADF8277}}, {{0x3C89C0C1, 0x377A9F8C}}, {{0x3FCA2DDD, 0x87A1F479}}, {{0x3C67E5CE, 0xF07409B2}}}, {{{0x3FF05818, 0x618201A8}}, {{0xBC8BFA98, 0x5A557953}}, {{0x3FCAB091, 0x082F3002}}, {{0xBC4B6626, 0x60BF022C}}}, {{{0x3FF05B76, 0xA03E3F07}}, {{0x3C7CA615, 0x2B52E765}}, {{0x3FCB335F, 0x394FAD1B}}, {{0x3C47F257, 0x34B51ACE}}}, {{{0x3FF05EE5, 0x3A727999}}, {{0x3C92512F, 0x6647668D}}, {{0x3FCBB648, 0x9DD1A7CC}}, {{0xBC234425, 0x3ED3824D}}}, {{{0x3FF06264, 0x338D4BDC}}, {{0xBC90000F, 0xF34422A4}}, {{0x3FCC394D, 0xB89E8F7F}}, {{0x3C646F77, 0x52292D2D}}}, {{{0x3FF065F3, 0x8F0DAF34}}, {{0xBC7821B3, 0xAF1520A9}}, {{0x3FCCBC6F, 0x0CBB89ED}}, {{0x3C4B40A0, 0x51092884}}}, {{{0x3FF06993, 0x5082FF6E}}, {{0x3C7685C4, 0xD7395A9F}}, {{0x3FCD3FAD, 0x1D49F620}}, {{0xBC5DE851, 0x26ECE4F0}}}, {{{0x3FF06D43, 0x7B8CFE4D}}, {{0xBC73ADF7, 0xD1025E7E}}, {{0x3FCDC308, 0x6D87EF96}}, {{0xBC6C0BD9, 0x2A97B34C}}}, {{{0x3FF07104, 0x13DBD729}}, {{0x3C766560, 0xCA5328ED}}, {{0x3FCE4681, 0x80D0D17F}}, {{0xBC605627, 0x658D0660}}}, {{{0x3FF074D5, 0x1D3022A1}}, {{0x3C9E93F8, 0x2426EF93}}, {{0x3FCECA18, 0xDA9DBA19}}, {{0xBC36D470, 0x491D8A98}}}, {{{0x3FF078B6, 0x9B5AEA5C}}, {{0xBC8880D6, 0x6B6D819B}}, {{0x3FCF4DCE, 0xFE860E28}}, {{0x3C6883D4, 0xC6A2C678}}}, {{{0x3FF07CA8, 0x923DACD6}}, {{0xBC9653A7, 0xE736D67A}}, {{0x3FCFD1A4, 0x703FFC8F}}, {{0x3C59EA3B, 0xA8860819}}}, {{{0x3FF080AB, 0x05CA6146}}, {{0xBC723216, 0xFC66378F}}, {{0x3FD02ACC, 0xD9D08102}}, {{0xBC5998B3, 0x20C03715}}}, {{{0x3FF084BD, 0xFA037B8F}}, {{0xBC7D97E2, 0xE3C5EBFC}}, {{0x3FD06CD7, 0xA64F3673}}, {{0x3C6370BA, 0x839871E4}}}, {{{0x3FF088E1, 0x72FBF041}}, {{0xBC9DE12F, 0x0D55140F}}, {{0x3FD0AEF2, 0xDFA6F09B}}, {{0xBC414E60, 0xA7827088}}}, {{{0x3FF08D15, 0x74D738AC}}, {{0xBC984BD5, 0xC4A8C043}}, {{0x3FD0F11E, 0xC7F2EE53}}, {{0x3C75BADF, 0xC5355AFC}}}, {{{0x3FF0915A, 0x03C95705}}, {{0x3C78A8A6, 0x0BD1CD00}}, {{0x3FD1335B, 0xA15F1D6C}}, {{0xBC53CE0F, 0x341ED7B6}}}, {{{0x3FF095AF, 0x2416DA9A}}, {{0x3C8024A0, 0x39DC7749}}, {{0x3FD175A9, 0xAE285CD6}}, {{0xBC3DB749, 0xC4496E39}}}, {{{0x3FF09A14, 0xDA14E415}}, {{0xBC965668, 0x233B29C8}}, {{0x3FD1B809, 0x309CBEE1}}, {{0x3C6E5B16, 0xBBB1CB75}}}, {{{0x3FF09E8B, 0x2A2929D1}}, {{0xBC9EE5F5, 0x535446B4}}, {{0x3FD1FA7A, 0x6B1BCB8A}}, {{0x3C50621A, 0x5A4CB636}}}, {{{0x3FF0A312, 0x18C9FC41}}, {{0x3C885259, 0x09E044C2}}, {{0x3FD23CFD, 0xA016C2D9}}, {{0xBC500762, 0x449D986B}}}, {{{0x3FF0A7A9, 0xAA7E4A68}}, {{0x3C71B296, 0x281520E0}}, {{0x3FD27F93, 0x1210DF54}}, {{0xBC6EF999, 0x502A1E59}}}, {{{0x3FF0AC51, 0xE3DDA65B}}, {{0x3C9B22C0, 0x9DACA977}}, {{0x3FD2C23B, 0x039F9881}}, {{0x3C577301, 0x9B082732}}}, {{{0x3FF0B10A, 0xC99049DE}}, {{0xBC617C2D, 0x610FCC2E}}, {{0x3FD304F5, 0xB76AE57E}}, {{0xBC75EB09, 0x42E4CA9C}}}, {{{0x3FF0B5D4, 0x604F1B07}}, {{0x3C732C14, 0x07EECFA5}}, {{0x3FD347C3, 0x702D7FA4}}, {{0x3C7435BE, 0x701422C8}}}, {{{0x3FF0BAAE, 0xACE3B0FC}}, {{0xBC93292F, 0x75521E77}}, {{0x3FD38AA4, 0x70B52549}}, {{0xBC67F94B, 0x0B01B8A6}}}, {{{0x3FF0BF99, 0xB42858B8}}, {{0xBC67AD83, 0x0B1F30A5}}, {{0x3FD3CD98, 0xFBE2DC86}}, {{0xBC7D0A5E, 0x269038FC}}}, {{{0x3FF0C495, 0x7B0819E9}}, {{0x3C9A26E0, 0x6E52BA24}}, {{0x3FD410A1, 0x54AB361D}}, {{0xBC78DCB6, 0xCF7DA2E8}}}, {{{0x3FF0C9A2, 0x067EBBDA}}, {{0x3C813CD8, 0x803D61F3}}, {{0x3FD453BD, 0xBE16906C}}, {{0x3C78D781, 0x45D8536E}}}, {{{0x3FF0CEBF, 0x5B98CA6C}}, {{0x3C9E8080, 0x09B9F220}}, {{0x3FD496EE, 0x7B415A78}}, {{0xBC51C3BA, 0xBDFE61F1}}}, {{{0x3FF0D3ED, 0x7F739B28}}, {{0xBC99722F, 0xEA8A9ED5}}, {{0x3FD4DA33, 0xCF5C5703}}, {{0x3C7B1F07, 0x7BE71FBE}}}, {{{0x3FF0D92C, 0x773D5255}}, {{0xBC84956C, 0x3D5D1DA2}}, {{0x3FD51D8D, 0xFDACDFC5}}, {{0xBC419F0E, 0x98966B86}}}, {{{0x3FF0DE7C, 0x4834E82E}}, {{0xBC877BEC, 0x5F430E44}}, {{0x3FD560FD, 0x498D28AA}}, {{0xBC4F07B3, 0xCCEA8A26}}}, {{{0x3FF0E3DC, 0xF7AA2E1B}}, {{0x3C9C05BD, 0xF7FB3140}}, {{0x3FD5A481, 0xF66C8331}}, {{0x3C6E8E0C, 0xCFF78DD1}}}, {{{0x3FF0E94E, 0x8AFDD406}}, {{0xBC9330CB, 0xB0B14F49}}, {{0x3FD5E81C, 0x47CFA1DB}}, {{0xBC791EC5, 0x4E7B2C63}}}, {{{0x3FF0EED1, 0x07A16DB4}}, {{0x3C988108, 0xD3E071F5}}, {{0x3FD62BCC, 0x8150DBAB}}, {{0x3C7700BD, 0xF95D00CA}}}, {{{0x3FF0F464, 0x73177841}}, {{0xBC97DF60, 0x29551C51}}, {{0x3FD66F92, 0xE6A06FC9}}, {{0xBC70A785, 0xD9A66B42}}}, {{{0x3FF0FA08, 0xD2F35F97}}, {{0x3C9B39D1, 0x9DAB3AF1}}, {{0x3FD6B36F, 0xBB84C928}}, {{0x3C68DAF8, 0xFEFE1E5F}}}, }; /* the coefficients for the cosh-approximations */ static const db_number c0 = {{0x3FF00000,0x00000000}}; /*1.0000000000e+00*/ static const db_number c2 = {{0x3FE00000,0x00000000}}; /*5.0000000000e-01*/ static const db_number c4 = {{0x3FA55555,0x55555555}}; /*4.1666666667e-02*/ static const db_number c6 = {{0x3F56C16C,0x16C16C17}}; /*1.3888888889e-03*/ static const db_number c8 = {{0x3EFA01A0,0x1A01A01A}}; /*2.4801587302e-05*/ /* the coefficients for the sinh-approximations */ static const db_number s1 = {{0x3FF00000,0x00000000}}; /*1.0000000000e+00*/ static const db_number s3 = {{0x3FC55555,0x55555555}}; /*1.6666666667e-01*/ static const db_number s5 = {{0x3F811111,0x11111111}}; /*8.3333333333e-03*/ static const db_number s7 = {{0x3F2A01A0,0x1A01A01A}}; /*1.9841269841e-04*/ #else static db_number const inv_ln_2 = {{0x652B82FE,0x3FF71547}}; /*1.4426950409e+00*/ static db_number const ln2_hi = {{0xFEFA3800,0x3FE62E42}}; /*6.9314718056e-01*/ static db_number const ln2_lo = {{0x93C76730,0x3D2EF357}}; /*5.4979230187e-14*/ static db_number const two_43_44 = {{0x00000000,0x42B80000}}; /*2.6388279067e+13*/ static db_number const two_minus_30 = {{0x00000000,0x3D700000}}; /*9.0949470177e-13*/ static int const bias = 89 ; /* some bounds */ static db_number const max_input_csh = {{0x8FB9F87E,0x408633CE}}; /*7.1047586007e+02*/ static const db_number cosh_sinh_table[179][4] = { {{{0xD2F35F97, 0x3FF0FA08}}, {{0x9DAB3AF1, 0x3C9B39D1}}, {{0xBB84C928, 0xBFD6B36F}}, {{0xFEFE1E5F, 0xBC68DAF8}}}, {{{0x73177841, 0x3FF0F464}}, {{0x29551C51, 0xBC97DF60}}, {{0xE6A06FC9, 0xBFD66F92}}, {{0xD9A66B42, 0x3C70A785}}}, {{{0x07A16DB4, 0x3FF0EED1}}, {{0xD3E071F5, 0x3C988108}}, {{0x8150DBAB, 0xBFD62BCC}}, {{0xF95D00CA, 0xBC7700BD}}}, {{{0x8AFDD406, 0x3FF0E94E}}, {{0xB0B14F49, 0xBC9330CB}}, {{0x47CFA1DB, 0xBFD5E81C}}, {{0x4E7B2C63, 0x3C791EC5}}}, {{{0xF7AA2E1B, 0x3FF0E3DC}}, {{0xF7FB3140, 0x3C9C05BD}}, {{0xF66C8331, 0xBFD5A481}}, {{0xCFF78DD1, 0xBC6E8E0C}}}, {{{0x4834E82E, 0x3FF0DE7C}}, {{0x5F430E44, 0xBC877BEC}}, {{0x498D28AA, 0xBFD560FD}}, {{0xCCEA8A26, 0x3C4F07B3}}}, {{{0x773D5255, 0x3FF0D92C}}, {{0x3D5D1DA2, 0xBC84956C}}, {{0xFDACDFC5, 0xBFD51D8D}}, {{0x98966B86, 0x3C419F0E}}}, {{{0x7F739B28, 0x3FF0D3ED}}, {{0xEA8A9ED5, 0xBC99722F}}, {{0xCF5C5703, 0xBFD4DA33}}, {{0x7BE71FBE, 0xBC7B1F07}}}, {{{0x5B98CA6C, 0x3FF0CEBF}}, {{0x09B9F220, 0x3C9E8080}}, {{0x7B415A78, 0xBFD496EE}}, {{0xBDFE61F1, 0x3C51C3BA}}}, {{{0x067EBBDA, 0x3FF0C9A2}}, {{0x803D61F3, 0x3C813CD8}}, {{0xBE16906C, 0xBFD453BD}}, {{0x45D8536E, 0xBC78D781}}}, {{{0x7B0819E9, 0x3FF0C495}}, {{0x6E52BA24, 0x3C9A26E0}}, {{0x54AB361D, 0xBFD410A1}}, {{0xCF7DA2E8, 0x3C78DCB6}}}, {{{0xB42858B8, 0x3FF0BF99}}, {{0x0B1F30A5, 0xBC67AD83}}, {{0xFBE2DC86, 0xBFD3CD98}}, {{0x269038FC, 0x3C7D0A5E}}}, {{{0xACE3B0FC, 0x3FF0BAAE}}, {{0x75521E77, 0xBC93292F}}, {{0x70B52549, 0xBFD38AA4}}, {{0x0B01B8A6, 0x3C67F94B}}}, {{{0x604F1B07, 0x3FF0B5D4}}, {{0x07EECFA5, 0x3C732C14}}, {{0x702D7FA4, 0xBFD347C3}}, {{0x701422C8, 0xBC7435BE}}}, {{{0xC99049DE, 0x3FF0B10A}}, {{0x610FCC2E, 0xBC617C2D}}, {{0xB76AE57E, 0xBFD304F5}}, {{0x42E4CA9C, 0x3C75EB09}}}, {{{0xE3DDA65B, 0x3FF0AC51}}, {{0x9DACA977, 0x3C9B22C0}}, {{0x039F9881, 0xBFD2C23B}}, {{0x9B082732, 0xBC577301}}}, {{{0xAA7E4A68, 0x3FF0A7A9}}, {{0x281520E0, 0x3C71B296}}, {{0x1210DF54, 0xBFD27F93}}, {{0x502A1E59, 0x3C6EF999}}}, {{{0x18C9FC41, 0x3FF0A312}}, {{0x09E044C2, 0x3C885259}}, {{0xA016C2D9, 0xBFD23CFD}}, {{0x449D986B, 0x3C500762}}}, {{{0x2A2929D1, 0x3FF09E8B}}, {{0x535446B4, 0xBC9EE5F5}}, {{0x6B1BCB8A, 0xBFD1FA7A}}, {{0x5A4CB636, 0xBC50621A}}}, {{{0xDA14E415, 0x3FF09A14}}, {{0x233B29C8, 0xBC965668}}, {{0x309CBEE1, 0xBFD1B809}}, {{0xBBB1CB75, 0xBC6E5B16}}}, {{{0x2416DA9A, 0x3FF095AF}}, {{0x39DC7749, 0x3C8024A0}}, {{0xAE285CD6, 0xBFD175A9}}, {{0xC4496E39, 0x3C3DB749}}}, {{{0x03C95705, 0x3FF0915A}}, {{0x0BD1CD00, 0x3C78A8A6}}, {{0xA15F1D6C, 0xBFD1335B}}, {{0x341ED7B6, 0x3C53CE0F}}}, {{{0x74D738AC, 0x3FF08D15}}, {{0xC4A8C043, 0xBC984BD5}}, {{0xC7F2EE53, 0xBFD0F11E}}, {{0xC5355AFC, 0xBC75BADF}}}, {{{0x72FBF041, 0x3FF088E1}}, {{0x0D55140F, 0xBC9DE12F}}, {{0xDFA6F09B, 0xBFD0AEF2}}, {{0xA7827088, 0x3C414E60}}}, {{{0xFA037B8F, 0x3FF084BD}}, {{0xE3C5EBFC, 0xBC7D97E2}}, {{0xA64F3673, 0xBFD06CD7}}, {{0x839871E4, 0xBC6370BA}}}, {{{0x05CA6146, 0x3FF080AB}}, {{0xFC66378F, 0xBC723216}}, {{0xD9D08102, 0xBFD02ACC}}, {{0x20C03715, 0x3C5998B3}}}, {{{0x923DACD6, 0x3FF07CA8}}, {{0xE736D67A, 0xBC9653A7}}, {{0x703FFC8F, 0xBFCFD1A4}}, {{0xA8860819, 0xBC59EA3B}}}, {{{0x9B5AEA5C, 0x3FF078B6}}, {{0x6B6D819B, 0xBC8880D6}}, {{0xFE860E28, 0xBFCF4DCE}}, {{0xC6A2C678, 0xBC6883D4}}}, {{{0x1D3022A1, 0x3FF074D5}}, {{0x2426EF93, 0x3C9E93F8}}, {{0xDA9DBA19, 0xBFCECA18}}, {{0x491D8A98, 0x3C36D470}}}, {{{0x13DBD729, 0x3FF07104}}, {{0xCA5328ED, 0x3C766560}}, {{0x80D0D17F, 0xBFCE4681}}, {{0x658D0660, 0x3C605627}}}, {{{0x7B8CFE4D, 0x3FF06D43}}, {{0xD1025E7E, 0xBC73ADF7}}, {{0x6D87EF96, 0xBFCDC308}}, {{0x2A97B34C, 0x3C6C0BD9}}}, {{{0x5082FF6E, 0x3FF06993}}, {{0xD7395A9F, 0x3C7685C4}}, {{0x1D49F620, 0xBFCD3FAD}}, {{0x26ECE4F0, 0x3C5DE851}}}, {{{0x8F0DAF34, 0x3FF065F3}}, {{0xAF1520A9, 0xBC7821B3}}, {{0x0CBB89ED, 0xBFCCBC6F}}, {{0x51092884, 0xBC4B40A0}}}, {{{0x338D4BDC, 0x3FF06264}}, {{0xF34422A4, 0xBC90000F}}, {{0xB89E8F7F, 0xBFCC394D}}, {{0x52292D2D, 0xBC646F77}}}, {{{0x3A727999, 0x3FF05EE5}}, {{0x6647668D, 0x3C92512F}}, {{0x9DD1A7CC, 0xBFCBB648}}, {{0x3ED3824D, 0x3C234425}}}, {{{0xA03E3F07, 0x3FF05B76}}, {{0x2B52E765, 0x3C7CA615}}, {{0x394FAD1B, 0xBFCB335F}}, {{0x34B51ACE, 0xBC47F257}}}, {{{0x618201A8, 0x3FF05818}}, {{0x5A557953, 0xBC8BFA98}}, {{0x082F3002, 0xBFCAB091}}, {{0x60BF022C, 0x3C4B6626}}}, {{{0x7ADF8277, 0x3FF054CA}}, {{0x377A9F8C, 0x3C89C0C1}}, {{0x87A1F479, 0xBFCA2DDD}}, {{0xF07409B2, 0xBC67E5CE}}}, {{{0xE908DA8C, 0x3FF0518C}}, {{0x25A535E2, 0x3C987D18}}, {{0x34F46F10, 0xBFC9AB44}}, {{0x57573053, 0xBC1274BC}}}, {{{0xA8C077CC, 0x3FF04E5F}}, {{0xECF07BF2, 0xBC9D8190}}, {{0x8D8D4236, 0xBFC928C4}}, {{0x370EDF81, 0xBC556048}}}, {{{0xB6D919A9, 0x3FF04B42}}, {{0x92AA0A0B, 0xBC9F2338}}, {{0x0EECBBA5, 0xBFC8A65E}}, {{0x0663DF15, 0x3C6339DB}}}, {{{0x1035CDFA, 0x3FF04836}}, {{0xBBC5EC1C, 0xBC9E50AA}}, {{0x36AC51DD, 0xBFC82410}}, {{0xDF8CB355, 0xBC5A42DC}}}, {{{0xB1C9EDDA, 0x3FF04539}}, {{0xC7598281, 0x3C8D2224}}, {{0x827E21C3, 0xBFC7A1DA}}, {{0x06D46085, 0xBC6CB79F}}}, {{{0x98991A9F, 0x3FF0424D}}, {{0xA130683D, 0x3C66BB23}}, {{0x702C6C4F, 0xBFC71FBC}}, {{0x00C832DD, 0xBC6BAA2A}}}, {{{0xC1B73AD9, 0x3FF03F71}}, {{0xA8202E85, 0xBC885168}}, {{0x7D991458, 0xBFC69DB5}}, {{0x97B08BD2, 0x3C69321C}}}, {{{0x2A487769, 0x3FF03CA6}}, {{0xB95A2E63, 0xBC9585FD}}, {{0x28BD1C73, 0xBFC61BC5}}, {{0x2267ECEB, 0x3C625559}}}, {{{0xCF8138A4, 0x3FF039EA}}, {{0x8FE6098D, 0x3C8ACC0C}}, {{0xEFA824F1, 0xBFC599EA}}, {{0x2B9BA1A8, 0x3C5F28E7}}}, {{{0xAEA6238A, 0x3FF0373F}}, {{0x72989A92, 0xBC73E9A1}}, {{0x507FE9EB, 0xBFC51826}}, {{0x6946DA28, 0x3C6AC219}}}, {{{0xC50C1706, 0x3FF034A4}}, {{0x7ECC2F29, 0xBC8A9076}}, {{0xC97FC168, 0xBFC49676}}, {{0x93C07384, 0x3C6B5D13}}}, {{{0x10182946, 0x3FF0321A}}, {{0xFE5F3FF1, 0x3C88FA5C}}, {{0xD8F81999, 0xBFC414DB}}, {{0x0B2260AC, 0x3C3E1438}}}, {{{0x8D3FA521, 0x3FF02F9F}}, {{0x88A18235, 0xBC58A44A}}, {{0xFD4DF72A, 0xBFC39354}}, {{0x64EC3B0C, 0xBC4EAAC2}}}, {{{0x3A080789, 0x3FF02D35}}, {{0xF6C7E6F8, 0xBC907780}}, {{0xB4FA73A6, 0xBFC311E1}}, {{0x4C87081D, 0x3C61065E}}}, {{{0x1406FD12, 0x3FF02ADB}}, {{0x720D8336, 0x3C969329}}, {{0x7E8A3BEF, 0xBFC29081}}, {{0x8F21151D, 0x3C65A4E2}}}, {{{0x18E25F8B, 0x3FF02891}}, {{0x524ABA66, 0xBC9A7DA4}}, {{0xD89D0ECD, 0xBFC20F33}}, {{0x55A9198D, 0x3C6557F7}}}, {{{0x4650339C, 0x3FF02657}}, {{0x0688DD52, 0xBC31EC5D}}, {{0x41E53B8C, 0xBFC18DF8}}, {{0x50E682BB, 0xBC49852D}}}, {{{0x9A16A685, 0x3FF0242D}}, {{0x295277DB, 0xBC7352FD}}, {{0x392720B0, 0xBFC10CCE}}, {{0x1E4C8E28, 0xBC55A291}}}, {{{0x120C0BDE, 0x3FF02214}}, {{0x6B72974E, 0xBC9456D2}}, {{0x3D38AAB7, 0xBFC08BB5}}, {{0xD37D3177, 0xBC60FB6D}}}, {{{0xAC16DB6F, 0x3FF0200A}}, {{0x99576FC1, 0xBC809B4F}}, {{0xCD00D2F1, 0xBFC00AAC}}, {{0x146349DE, 0x3C53EA29}}}, {{{0x662DAF18, 0x3FF01E11}}, {{0x3120653C, 0xBC833F82}}, {{0xCEEE3CC9, 0xBFBF1368}}, {{0x7BD924AB, 0x3C5213E7}}}, {{{0x3E5740C5, 0x3FF01C28}}, {{0x9EC02117, 0x3C95D295}}, {{0x17463991, 0xBFBE1197}}, {{0x410E61A9, 0xBC5E1FCA}}}, {{{0x32AA6878, 0x3FF01A4F}}, {{0x67BCC8B5, 0x3C833FDA}}, {{0x7137CF18, 0xBFBD0FE3}}, {{0x698E234C, 0x3C4AE71D}}}, {{{0x414E1A5C, 0x3FF01886}}, {{0xE0B191DA, 0x3C4976C5}}, {{0xDB0F41D4, 0xBFBC0E4C}}, {{0xC9BFC58B, 0x3C586525}}}, {{{0x687964EF, 0x3FF016CD}}, {{0x209297AD, 0xBC9D38AB}}, {{0x5335E625, 0xBFBB0CD2}}, {{0xFBDC145A, 0xBC480157}}}, {{{0xA6736F36, 0x3FF01524}}, {{0xC450FC30, 0x3C930803}}, {{0xD8311EBE, 0xBFBA0B72}}, {{0x50193D71, 0xBC507AA8}}}, {{{0xF993770A, 0x3FF0138B}}, {{0xB809A4D7, 0xBC7502E0}}, {{0x68A15B27, 0xBFB90A2D}}, {{0x7F556554, 0xBC5B1BE3}}}, {{{0x6040CF67, 0x3FF01203}}, {{0x422FB0BC, 0x3C9847C0}}, {{0x03411660, 0xBFB80901}}, {{0x10739476, 0xBC5DD342}}}, {{{0xD8F2DEDB, 0x3FF0108A}}, {{0x53B40698, 0x3C93DC21}}, {{0xA6E3D59B, 0xBFB707EC}}, {{0xF456FFFF, 0x3C5030B2}}}, {{{0x62311DF8, 0x3FF00F22}}, {{0xA7C410F3, 0x3C99322E}}, {{0x5275270D, 0xBFB606EF}}, {{0xE6EE4DC3, 0x3C56910E}}}, {{{0xFA9315DF, 0x3FF00DC9}}, {{0x602B4C56, 0xBC84D0E2}}, {{0x04F7A0DD, 0xBFB50608}}, {{0xEDAF37D2, 0xBC239FF7}}}, {{{0xA0C05ED4, 0x3FF00C81}}, {{0x7A57AC2E, 0xBC7736A7}}, {{0xBD83E026, 0xBFB40535}}, {{0x5F0B8AC5, 0x3C4B9B73}}}, {{{0x53709EEA, 0x3FF00B49}}, {{0xF8CDACD0, 0xBC9DF4D4}}, {{0x7B47880C, 0xBFB30477}}, {{0x3B77E1B2, 0xBC517BE5}}}, {{{0x116B88B6, 0x3FF00A21}}, {{0xAAAEC5A4, 0xBC71D458}}, {{0x3D8440EF, 0xBFB203CC}}, {{0x41B5A4E1, 0x3C1EF162}}}, {{{0xD988DA1B, 0x3FF00908}}, {{0x94C96CA5, 0x3C9519B1}}, {{0x038EB7A7, 0xBFB10333}}, {{0x317BAEA7, 0x3C044B95}}}, {{{0xAAB05B20, 0x3FF00800}}, {{0x9FEBDB21, 0xBC936EB9}}, {{0xCCCD9CDD, 0xBFB002AA}}, {{0xFAC9C47C, 0x3C53A7FD}}}, {{{0x83D9DCD5, 0x3FF00708}}, {{0x430DE399, 0xBC9EC747}}, {{0x317148DD, 0xBFAE0465}}, {{0x7929765A, 0x3C4B5DB1}}}, {{{0x640D384F, 0x3FF00620}}, {{0x170FB049, 0xBC97FCBC}}, {{0xCDAF09CF, 0xBFAC0392}}, {{0x7D4F7337, 0x3C2B59CD}}}, {{{0x4A624DAE, 0x3FF00548}}, {{0x23E9C180, 0x3C5D0575}}, {{0x6D81EE12, 0xBFAA02DC}}, {{0x7E00BA39, 0x3C2A5E3B}}}, {{{0x36010336, 0x3FF00480}}, {{0x10BEB244, 0xBC89227D}}, {{0x10336ABF, 0xBFA80240}}, {{0xC229B627, 0x3C4941AF}}}, {{{0x26214474, 0x3FF003C8}}, {{0x45DFB29B, 0xBC4AE17A}}, {{0xB526F7CF, 0xBFA601BB}}, {{0x2DA1796B, 0x3C39422F}}}, {{{0x1A0B0179, 0x3FF00320}}, {{0xD21A4C9A, 0x3C9FA45B}}, {{0x5BD80F80, 0xBFA4014D}}, {{0xA4813A5B, 0xBC45A2E6}}}, {{{0x11162E22, 0x3FF00288}}, {{0x2A930764, 0x3C6F0E22}}, {{0x03D82DD0, 0xBFA200F3}}, {{0x0CBDB96B, 0xBC4BE9EF}}}, {{{0x0AAAC16C, 0x3FF00200}}, {{0x578DDD8D, 0x3C88618F}}, {{0xACCCD00D, 0xBFA000AA}}, {{0x1EFF67C8, 0xBBFD9E59}}}, {{{0x0640B4E1, 0x3FF00188}}, {{0x8827C989, 0x3C7FB10F}}, {{0xACDAE8F4, 0xBF9C00E4}}, {{0x22A0BAC6, 0xBBE94741}}}, {{{0x0360040D, 0x3FF00120}}, {{0x402EAB5F, 0xBC884C57}}, {{0x01033411, 0xBF980090}}, {{0xDD340191, 0xBC37E141}}}, {{{0x01A0AC06, 0x3FF000C8}}, {{0x673A2EEE, 0xBC7BD6C4}}, {{0x55BD803E, 0xBF940053}}, {{0xCA73460D, 0xBBD1997B}}}, {{{0x00AAAB06, 0x3FF00080}}, {{0x2ABAD90D, 0xBC93E2BE}}, {{0xAACCCCDA, 0xBF90002A}}, {{0x3AC1711C, 0x3C293021}}}, {{{0x00360010, 0x3FF00048}}, {{0xDB8F0A40, 0x3C899AE6}}, {{0x00103337, 0xBF880024}}, {{0xAF88B300, 0x3C250734}}}, {{{0x000AAAAC, 0x3FF00020}}, {{0x1862ADFD, 0x3C76C186}}, {{0xAAACCCCD, 0xBF80000A}}, {{0x9193923E, 0xBBBA01FC}}}, {{{0x0000AAAB, 0x3FF00008}}, {{0x8D68D67B, 0xBC93E93E}}, {{0xAAAACCCD, 0xBF700002}}, {{0x17BFB4DB, 0x3C093193}}}, {{{0x00000000, 0x3FF00000}}, {{0x00000000, 0x00000000}}, {{0x00000000, 0x00000000}}, {{0x00000000, 0x00000000}}}, {{{0x0000AAAB, 0x3FF00008}}, {{0x8D68D67B, 0xBC93E93E}}, {{0xAAAACCCD, 0x3F700002}}, {{0x17BFB4DB, 0xBC093193}}}, {{{0x000AAAAC, 0x3FF00020}}, {{0x1862ADFD, 0x3C76C186}}, {{0xAAACCCCD, 0x3F80000A}}, {{0x9193923E, 0x3BBA01FC}}}, {{{0x00360010, 0x3FF00048}}, {{0xDB8F0A40, 0x3C899AE6}}, {{0x00103337, 0x3F880024}}, {{0xAF88B300, 0xBC250734}}}, {{{0x00AAAB06, 0x3FF00080}}, {{0x2ABAD90D, 0xBC93E2BE}}, {{0xAACCCCDA, 0x3F90002A}}, {{0x3AC1711C, 0xBC293021}}}, {{{0x01A0AC06, 0x3FF000C8}}, {{0x673A2EEE, 0xBC7BD6C4}}, {{0x55BD803E, 0x3F940053}}, {{0xCA73460D, 0x3BD1997B}}}, {{{0x0360040D, 0x3FF00120}}, {{0x402EAB5F, 0xBC884C57}}, {{0x01033411, 0x3F980090}}, {{0xDD340191, 0x3C37E141}}}, {{{0x0640B4E1, 0x3FF00188}}, {{0x8827C989, 0x3C7FB10F}}, {{0xACDAE8F4, 0x3F9C00E4}}, {{0x22A0BAC6, 0x3BE94741}}}, {{{0x0AAAC16C, 0x3FF00200}}, {{0x578DDD8D, 0x3C88618F}}, {{0xACCCD00D, 0x3FA000AA}}, {{0x1EFF67C8, 0x3BFD9E59}}}, {{{0x11162E22, 0x3FF00288}}, {{0x2A930764, 0x3C6F0E22}}, {{0x03D82DD0, 0x3FA200F3}}, {{0x0CBDB96B, 0x3C4BE9EF}}}, {{{0x1A0B0179, 0x3FF00320}}, {{0xD21A4C9A, 0x3C9FA45B}}, {{0x5BD80F80, 0x3FA4014D}}, {{0xA4813A5B, 0x3C45A2E6}}}, {{{0x26214474, 0x3FF003C8}}, {{0x45DFB29B, 0xBC4AE17A}}, {{0xB526F7CF, 0x3FA601BB}}, {{0x2DA1796B, 0xBC39422F}}}, {{{0x36010336, 0x3FF00480}}, {{0x10BEB244, 0xBC89227D}}, {{0x10336ABF, 0x3FA80240}}, {{0xC229B627, 0xBC4941AF}}}, {{{0x4A624DAE, 0x3FF00548}}, {{0x23E9C180, 0x3C5D0575}}, {{0x6D81EE12, 0x3FAA02DC}}, {{0x7E00BA39, 0xBC2A5E3B}}}, {{{0x640D384F, 0x3FF00620}}, {{0x170FB049, 0xBC97FCBC}}, {{0xCDAF09CF, 0x3FAC0392}}, {{0x7D4F7337, 0xBC2B59CD}}}, {{{0x83D9DCD5, 0x3FF00708}}, {{0x430DE399, 0xBC9EC747}}, {{0x317148DD, 0x3FAE0465}}, {{0x7929765A, 0xBC4B5DB1}}}, {{{0xAAB05B20, 0x3FF00800}}, {{0x9FEBDB21, 0xBC936EB9}}, {{0xCCCD9CDD, 0x3FB002AA}}, {{0xFAC9C47C, 0xBC53A7FD}}}, {{{0xD988DA1B, 0x3FF00908}}, {{0x94C96CA5, 0x3C9519B1}}, {{0x038EB7A7, 0x3FB10333}}, {{0x317BAEA7, 0xBC044B95}}}, {{{0x116B88B6, 0x3FF00A21}}, {{0xAAAEC5A4, 0xBC71D458}}, {{0x3D8440EF, 0x3FB203CC}}, {{0x41B5A4E1, 0xBC1EF162}}}, {{{0x53709EEA, 0x3FF00B49}}, {{0xF8CDACD0, 0xBC9DF4D4}}, {{0x7B47880C, 0x3FB30477}}, {{0x3B77E1B2, 0x3C517BE5}}}, {{{0xA0C05ED4, 0x3FF00C81}}, {{0x7A57AC2E, 0xBC7736A7}}, {{0xBD83E026, 0x3FB40535}}, {{0x5F0B8AC5, 0xBC4B9B73}}}, {{{0xFA9315DF, 0x3FF00DC9}}, {{0x602B4C56, 0xBC84D0E2}}, {{0x04F7A0DD, 0x3FB50608}}, {{0xEDAF37D2, 0x3C239FF7}}}, {{{0x62311DF8, 0x3FF00F22}}, {{0xA7C410F3, 0x3C99322E}}, {{0x5275270D, 0x3FB606EF}}, {{0xE6EE4DC3, 0xBC56910E}}}, {{{0xD8F2DEDB, 0x3FF0108A}}, {{0x53B40698, 0x3C93DC21}}, {{0xA6E3D59B, 0x3FB707EC}}, {{0xF456FFFF, 0xBC5030B2}}}, {{{0x6040CF67, 0x3FF01203}}, {{0x422FB0BC, 0x3C9847C0}}, {{0x03411660, 0x3FB80901}}, {{0x10739476, 0x3C5DD342}}}, {{{0xF993770A, 0x3FF0138B}}, {{0xB809A4D7, 0xBC7502E0}}, {{0x68A15B27, 0x3FB90A2D}}, {{0x7F556554, 0x3C5B1BE3}}}, {{{0xA6736F36, 0x3FF01524}}, {{0xC450FC30, 0x3C930803}}, {{0xD8311EBE, 0x3FBA0B72}}, {{0x50193D71, 0x3C507AA8}}}, {{{0x687964EF, 0x3FF016CD}}, {{0x209297AD, 0xBC9D38AB}}, {{0x5335E625, 0x3FBB0CD2}}, {{0xFBDC145A, 0x3C480157}}}, {{{0x414E1A5C, 0x3FF01886}}, {{0xE0B191DA, 0x3C4976C5}}, {{0xDB0F41D4, 0x3FBC0E4C}}, {{0xC9BFC58B, 0xBC586525}}}, {{{0x32AA6878, 0x3FF01A4F}}, {{0x67BCC8B5, 0x3C833FDA}}, {{0x7137CF18, 0x3FBD0FE3}}, {{0x698E234C, 0xBC4AE71D}}}, {{{0x3E5740C5, 0x3FF01C28}}, {{0x9EC02117, 0x3C95D295}}, {{0x17463991, 0x3FBE1197}}, {{0x410E61A9, 0x3C5E1FCA}}}, {{{0x662DAF18, 0x3FF01E11}}, {{0x3120653C, 0xBC833F82}}, {{0xCEEE3CC9, 0x3FBF1368}}, {{0x7BD924AB, 0xBC5213E7}}}, {{{0xAC16DB6F, 0x3FF0200A}}, {{0x99576FC1, 0xBC809B4F}}, {{0xCD00D2F1, 0x3FC00AAC}}, {{0x146349DE, 0xBC53EA29}}}, {{{0x120C0BDE, 0x3FF02214}}, {{0x6B72974E, 0xBC9456D2}}, {{0x3D38AAB7, 0x3FC08BB5}}, {{0xD37D3177, 0x3C60FB6D}}}, {{{0x9A16A685, 0x3FF0242D}}, {{0x295277DB, 0xBC7352FD}}, {{0x392720B0, 0x3FC10CCE}}, {{0x1E4C8E28, 0x3C55A291}}}, {{{0x4650339C, 0x3FF02657}}, {{0x0688DD52, 0xBC31EC5D}}, {{0x41E53B8C, 0x3FC18DF8}}, {{0x50E682BB, 0x3C49852D}}}, {{{0x18E25F8B, 0x3FF02891}}, {{0x524ABA66, 0xBC9A7DA4}}, {{0xD89D0ECD, 0x3FC20F33}}, {{0x55A9198D, 0xBC6557F7}}}, {{{0x1406FD12, 0x3FF02ADB}}, {{0x720D8336, 0x3C969329}}, {{0x7E8A3BEF, 0x3FC29081}}, {{0x8F21151D, 0xBC65A4E2}}}, {{{0x3A080789, 0x3FF02D35}}, {{0xF6C7E6F8, 0xBC907780}}, {{0xB4FA73A6, 0x3FC311E1}}, {{0x4C87081D, 0xBC61065E}}}, {{{0x8D3FA521, 0x3FF02F9F}}, {{0x88A18235, 0xBC58A44A}}, {{0xFD4DF72A, 0x3FC39354}}, {{0x64EC3B0C, 0x3C4EAAC2}}}, {{{0x10182946, 0x3FF0321A}}, {{0xFE5F3FF1, 0x3C88FA5C}}, {{0xD8F81999, 0x3FC414DB}}, {{0x0B2260AC, 0xBC3E1438}}}, {{{0xC50C1706, 0x3FF034A4}}, {{0x7ECC2F29, 0xBC8A9076}}, {{0xC97FC168, 0x3FC49676}}, {{0x93C07384, 0xBC6B5D13}}}, {{{0xAEA6238A, 0x3FF0373F}}, {{0x72989A92, 0xBC73E9A1}}, {{0x507FE9EB, 0x3FC51826}}, {{0x6946DA28, 0xBC6AC219}}}, {{{0xCF8138A4, 0x3FF039EA}}, {{0x8FE6098D, 0x3C8ACC0C}}, {{0xEFA824F1, 0x3FC599EA}}, {{0x2B9BA1A8, 0xBC5F28E7}}}, {{{0x2A487769, 0x3FF03CA6}}, {{0xB95A2E63, 0xBC9585FD}}, {{0x28BD1C73, 0x3FC61BC5}}, {{0x2267ECEB, 0xBC625559}}}, {{{0xC1B73AD9, 0x3FF03F71}}, {{0xA8202E85, 0xBC885168}}, {{0x7D991458, 0x3FC69DB5}}, {{0x97B08BD2, 0xBC69321C}}}, {{{0x98991A9F, 0x3FF0424D}}, {{0xA130683D, 0x3C66BB23}}, {{0x702C6C4F, 0x3FC71FBC}}, {{0x00C832DD, 0x3C6BAA2A}}}, {{{0xB1C9EDDA, 0x3FF04539}}, {{0xC7598281, 0x3C8D2224}}, {{0x827E21C3, 0x3FC7A1DA}}, {{0x06D46085, 0x3C6CB79F}}}, {{{0x1035CDFA, 0x3FF04836}}, {{0xBBC5EC1C, 0xBC9E50AA}}, {{0x36AC51DD, 0x3FC82410}}, {{0xDF8CB355, 0x3C5A42DC}}}, {{{0xB6D919A9, 0x3FF04B42}}, {{0x92AA0A0B, 0xBC9F2338}}, {{0x0EECBBA5, 0x3FC8A65E}}, {{0x0663DF15, 0xBC6339DB}}}, {{{0xA8C077CC, 0x3FF04E5F}}, {{0xECF07BF2, 0xBC9D8190}}, {{0x8D8D4236, 0x3FC928C4}}, {{0x370EDF81, 0x3C556048}}}, {{{0xE908DA8C, 0x3FF0518C}}, {{0x25A535E2, 0x3C987D18}}, {{0x34F46F10, 0x3FC9AB44}}, {{0x57573053, 0x3C1274BC}}}, {{{0x7ADF8277, 0x3FF054CA}}, {{0x377A9F8C, 0x3C89C0C1}}, {{0x87A1F479, 0x3FCA2DDD}}, {{0xF07409B2, 0x3C67E5CE}}}, {{{0x618201A8, 0x3FF05818}}, {{0x5A557953, 0xBC8BFA98}}, {{0x082F3002, 0x3FCAB091}}, {{0x60BF022C, 0xBC4B6626}}}, {{{0xA03E3F07, 0x3FF05B76}}, {{0x2B52E765, 0x3C7CA615}}, {{0x394FAD1B, 0x3FCB335F}}, {{0x34B51ACE, 0x3C47F257}}}, {{{0x3A727999, 0x3FF05EE5}}, {{0x6647668D, 0x3C92512F}}, {{0x9DD1A7CC, 0x3FCBB648}}, {{0x3ED3824D, 0xBC234425}}}, {{{0x338D4BDC, 0x3FF06264}}, {{0xF34422A4, 0xBC90000F}}, {{0xB89E8F7F, 0x3FCC394D}}, {{0x52292D2D, 0x3C646F77}}}, {{{0x8F0DAF34, 0x3FF065F3}}, {{0xAF1520A9, 0xBC7821B3}}, {{0x0CBB89ED, 0x3FCCBC6F}}, {{0x51092884, 0x3C4B40A0}}}, {{{0x5082FF6E, 0x3FF06993}}, {{0xD7395A9F, 0x3C7685C4}}, {{0x1D49F620, 0x3FCD3FAD}}, {{0x26ECE4F0, 0xBC5DE851}}}, {{{0x7B8CFE4D, 0x3FF06D43}}, {{0xD1025E7E, 0xBC73ADF7}}, {{0x6D87EF96, 0x3FCDC308}}, {{0x2A97B34C, 0xBC6C0BD9}}}, {{{0x13DBD729, 0x3FF07104}}, {{0xCA5328ED, 0x3C766560}}, {{0x80D0D17F, 0x3FCE4681}}, {{0x658D0660, 0xBC605627}}}, {{{0x1D3022A1, 0x3FF074D5}}, {{0x2426EF93, 0x3C9E93F8}}, {{0xDA9DBA19, 0x3FCECA18}}, {{0x491D8A98, 0xBC36D470}}}, {{{0x9B5AEA5C, 0x3FF078B6}}, {{0x6B6D819B, 0xBC8880D6}}, {{0xFE860E28, 0x3FCF4DCE}}, {{0xC6A2C678, 0x3C6883D4}}}, {{{0x923DACD6, 0x3FF07CA8}}, {{0xE736D67A, 0xBC9653A7}}, {{0x703FFC8F, 0x3FCFD1A4}}, {{0xA8860819, 0x3C59EA3B}}}, {{{0x05CA6146, 0x3FF080AB}}, {{0xFC66378F, 0xBC723216}}, {{0xD9D08102, 0x3FD02ACC}}, {{0x20C03715, 0xBC5998B3}}}, {{{0xFA037B8F, 0x3FF084BD}}, {{0xE3C5EBFC, 0xBC7D97E2}}, {{0xA64F3673, 0x3FD06CD7}}, {{0x839871E4, 0x3C6370BA}}}, {{{0x72FBF041, 0x3FF088E1}}, {{0x0D55140F, 0xBC9DE12F}}, {{0xDFA6F09B, 0x3FD0AEF2}}, {{0xA7827088, 0xBC414E60}}}, {{{0x74D738AC, 0x3FF08D15}}, {{0xC4A8C043, 0xBC984BD5}}, {{0xC7F2EE53, 0x3FD0F11E}}, {{0xC5355AFC, 0x3C75BADF}}}, {{{0x03C95705, 0x3FF0915A}}, {{0x0BD1CD00, 0x3C78A8A6}}, {{0xA15F1D6C, 0x3FD1335B}}, {{0x341ED7B6, 0xBC53CE0F}}}, {{{0x2416DA9A, 0x3FF095AF}}, {{0x39DC7749, 0x3C8024A0}}, {{0xAE285CD6, 0x3FD175A9}}, {{0xC4496E39, 0xBC3DB749}}}, {{{0xDA14E415, 0x3FF09A14}}, {{0x233B29C8, 0xBC965668}}, {{0x309CBEE1, 0x3FD1B809}}, {{0xBBB1CB75, 0x3C6E5B16}}}, {{{0x2A2929D1, 0x3FF09E8B}}, {{0x535446B4, 0xBC9EE5F5}}, {{0x6B1BCB8A, 0x3FD1FA7A}}, {{0x5A4CB636, 0x3C50621A}}}, {{{0x18C9FC41, 0x3FF0A312}}, {{0x09E044C2, 0x3C885259}}, {{0xA016C2D9, 0x3FD23CFD}}, {{0x449D986B, 0xBC500762}}}, {{{0xAA7E4A68, 0x3FF0A7A9}}, {{0x281520E0, 0x3C71B296}}, {{0x1210DF54, 0x3FD27F93}}, {{0x502A1E59, 0xBC6EF999}}}, {{{0xE3DDA65B, 0x3FF0AC51}}, {{0x9DACA977, 0x3C9B22C0}}, {{0x039F9881, 0x3FD2C23B}}, {{0x9B082732, 0x3C577301}}}, {{{0xC99049DE, 0x3FF0B10A}}, {{0x610FCC2E, 0xBC617C2D}}, {{0xB76AE57E, 0x3FD304F5}}, {{0x42E4CA9C, 0xBC75EB09}}}, {{{0x604F1B07, 0x3FF0B5D4}}, {{0x07EECFA5, 0x3C732C14}}, {{0x702D7FA4, 0x3FD347C3}}, {{0x701422C8, 0x3C7435BE}}}, {{{0xACE3B0FC, 0x3FF0BAAE}}, {{0x75521E77, 0xBC93292F}}, {{0x70B52549, 0x3FD38AA4}}, {{0x0B01B8A6, 0xBC67F94B}}}, {{{0xB42858B8, 0x3FF0BF99}}, {{0x0B1F30A5, 0xBC67AD83}}, {{0xFBE2DC86, 0x3FD3CD98}}, {{0x269038FC, 0xBC7D0A5E}}}, {{{0x7B0819E9, 0x3FF0C495}}, {{0x6E52BA24, 0x3C9A26E0}}, {{0x54AB361D, 0x3FD410A1}}, {{0xCF7DA2E8, 0xBC78DCB6}}}, {{{0x067EBBDA, 0x3FF0C9A2}}, {{0x803D61F3, 0x3C813CD8}}, {{0xBE16906C, 0x3FD453BD}}, {{0x45D8536E, 0x3C78D781}}}, {{{0x5B98CA6C, 0x3FF0CEBF}}, {{0x09B9F220, 0x3C9E8080}}, {{0x7B415A78, 0x3FD496EE}}, {{0xBDFE61F1, 0xBC51C3BA}}}, {{{0x7F739B28, 0x3FF0D3ED}}, {{0xEA8A9ED5, 0xBC99722F}}, {{0xCF5C5703, 0x3FD4DA33}}, {{0x7BE71FBE, 0x3C7B1F07}}}, {{{0x773D5255, 0x3FF0D92C}}, {{0x3D5D1DA2, 0xBC84956C}}, {{0xFDACDFC5, 0x3FD51D8D}}, {{0x98966B86, 0xBC419F0E}}}, {{{0x4834E82E, 0x3FF0DE7C}}, {{0x5F430E44, 0xBC877BEC}}, {{0x498D28AA, 0x3FD560FD}}, {{0xCCEA8A26, 0xBC4F07B3}}}, {{{0xF7AA2E1B, 0x3FF0E3DC}}, {{0xF7FB3140, 0x3C9C05BD}}, {{0xF66C8331, 0x3FD5A481}}, {{0xCFF78DD1, 0x3C6E8E0C}}}, {{{0x8AFDD406, 0x3FF0E94E}}, {{0xB0B14F49, 0xBC9330CB}}, {{0x47CFA1DB, 0x3FD5E81C}}, {{0x4E7B2C63, 0xBC791EC5}}}, {{{0x07A16DB4, 0x3FF0EED1}}, {{0xD3E071F5, 0x3C988108}}, {{0x8150DBAB, 0x3FD62BCC}}, {{0xF95D00CA, 0x3C7700BD}}}, {{{0x73177841, 0x3FF0F464}}, {{0x29551C51, 0xBC97DF60}}, {{0xE6A06FC9, 0x3FD66F92}}, {{0xD9A66B42, 0xBC70A785}}}, {{{0xD2F35F97, 0x3FF0FA08}}, {{0x9DAB3AF1, 0x3C9B39D1}}, {{0xBB84C928, 0x3FD6B36F}}, {{0xFEFE1E5F, 0x3C68DAF8}}}, }; /* the coefficients for the cosh-approximations */ static const db_number c0 = {{0x00000000,0x3FF00000}}; /*1.0000000000e+00*/ static const db_number c2 = {{0x00000000,0x3FE00000}}; /*5.0000000000e-01*/ static const db_number c4 = {{0x55555555,0x3FA55555}}; /*4.1666666667e-02*/ static const db_number c6 = {{0x16C16C17,0x3F56C16C}}; /*1.3888888889e-03*/ static const db_number c8 = {{0x1A01A01A,0x3EFA01A0}}; /*2.4801587302e-05*/ /* the coefficients for the sinh-approximations */ static const db_number s1 = {{0x00000000,0x3FF00000}}; /*1.0000000000e+00*/ static const db_number s3 = {{0x55555555,0x3FC55555}}; /*1.6666666667e-01*/ static const db_number s5 = {{0x11111111,0x3F811111}}; /*8.3333333333e-03*/ static const db_number s7 = {{0x1A01A01A,0x3F2A01A0}}; /*1.9841269841e-04*/ #endif interval-2.1.0/src/crlibm/docs/latex/0_getting-started.tex0000644000000000000000000002512513031036767021651 0ustar 00000000000000\section{What is \crlibm?} The \crlibm\ project aims at developing a portable, proven, correctly rounded, and efficient mathematical library (\texttt{libm}) for double precision. \begin{description} \item[correctly rounded] Current \texttt{libm} implementation do not always return the floating-point number that is closest to the exact mathematical result. As a consequence, different \texttt{libm} implementation will return different results for the same input, which prevents full portability of floating-point applications. In addition, few libraries support but the round-to-nearest mode of the IEEE754/IEC 60559 standard for floating-point arithmetic (hereafter usually referred to as the IEEE-754 standard). \crlibm\ provides the four rounding modes: To nearest, to $+\infty$, to $-\infty$ and to zero. \item[portable] \crlibm\ is written in C and will be compiled by any compiler fulfilling basic requirements of the ISO/IEC 9899:1999 (hereafter referred to as C99) standard. This is the case of \texttt{gcc} version 3 and higher which is available on most computer systems. It also requires a floating-point implementation respecting the IEEE-754 standard, which is also available on most modern systems. \crlibm\ has been tested on a large range of systems. \item[proven] Other libraries attempt to provide correctly-rounded result. For theoretical and practical reasons, this behaviour is difficult to prove, and in extreme cases termination is not even guaranteed. \crlibm\ intends to provide a comprehensive proof of the theoretical possibility of correct rounding, the algorithms used, and the implementation, assuming C99 and IEEE-754 compliance. \item[efficient] performance and resource usage of \crlibm\ should be comparable to existing \texttt{libm} implementations, both in average and in the worst case. In contrast, other correctly-rounded libraries have worst case performance and memory consumption several order of magnitude larger than standard \texttt{libm}s. \end{description} The ultimate goal of the \crlibm\ project is to push towards the standardization of correctly-rounded elementary functions. \section{Compilation and installation} See the \texttt{INSTALL} file in the main directory. This library is developed using the GNU autotools, and can therefore be compiled on most Unix-like systems by \texttt{./configure; make}. The command \texttt{make check} will launch the selftest. For more advanced testing you will need to have MPFR installed (see \url{www.mpfr.org}) and to pass the \texttt{--enable-mpfr} flag to \texttt{configure}. For other flags, see \texttt{./configure --help} . \section{Using \texttt{crlibm} functions in your program} Currently \texttt{crlibm} functions have different names from the standard \texttt{math.h} functions. For example, for the sine function (\texttt{double sin(double)} in the standard \texttt{math.h}), you have four different functions in \texttt{crlibm} for the four different rounding modes. These functions are named \texttt{sin\_rn}, \texttt{sin\_ru}, \texttt{sin\_rd} and \texttt{sin\_rz} for round to the nearest, round up, round down and round to zero respectively. These functions are declared in the C header file \texttt{crlibm.h}. The \texttt{crlibm} library relies on double-precision IEEE-754 compliant floating-point operations. For some processors and some operating systems (most notably IA32 and IA64 processors under GNU/Linux), the default precision is set to double-extended. On such systems you will need to call the \texttt{crlibm\_init()} function before using any \texttt{crlibm} function to ensure such compliance. This has the effect of setting the processor flags to IEEE-754 double-precision with rounding to the nearest mode. This function returns the previous processor status, so that previous mode can be restored using the function \texttt{crlibm\_exit()}. Note that you probably only need one call to \texttt{crlibm\_init()} at the beginning of your program, not one call before each call to a mathematical function. Here is a non-exhaustive list of systems on which \texttt{crlibm\_init()} is NOT needed, and which can therefore use \crlibm\ as a transparent replacement of the standard \texttt{libm}: \begin{itemize} \item Most Power/PowerPC based systems, including those from Apple or from IBM; \item All the 64-bit Linux versions: the reason is that all x86-compatible processors (by AMD and Intel) supporting 64-bit addressing also feature SSE2 FP instructions, which are cleaner and more efficient than the legacy x87 FPU. On such systems, SSE2 is therefore used by default by \texttt{gcc} for double-precision FP computing. \item On recent 32-bit x86 processors also featuring SSE2 extensions (including pentium 4 and later, and generally most processors produced after 2005), you can try to force the use of SSE2 instructions using \texttt{configure --enable-sse2}. Beware, the code produced will not run on older hardware. \end{itemize} Here's an example function named \texttt{compare.c} using the cosine function from \texttt{crlibm} library. \begin{lstlisting}[label={chap0:lst:prog_example},caption={compare.c},firstnumber=1] #include #include #include int main(void){ double x, res_libm, res_crlibm; printf("Enter a floating point number: "); scanf("%lf", &x); res_libm = cos(x); crlibm_init(); /* no need here to save the old processor state returned by crlibm_init() */ res_crlibm = cos_rn(x); printf("\n x=%.25e \n", x); printf("\n cos(x) with the system : %.25e \n", res_libm); printf("\n cos(x) with crlibm : %.25e \n", res_crlibm); return 0; } \end{lstlisting} This example will be compiled with \texttt{gcc compare.c -lm -lcrlibm -o compare} \section{Currently available functions} The currently available functions are summarized in Table~\ref{tab:currentstate}. \begin{table}[t] \begin{center} \renewcommand{\arraystretch}{1.2} \begin{tabular}{|c|c|c|c|c||c|c|} \hline & \multicolumn{4}{c||}{\crlibm\ name} &\multicolumn{2}{c|}{State of the proof} \\ \cline{2-7} \raisebox{5pt}{C99} & to nearest & to $+ \infty$ & to $- \infty$ & to zero & Worst cases & Proof of the code \\ \hline\hline exp & exp\_rn & exp\_ru & exp\_rd & exp\_rz & complete& complete (formal)\\ \hline expm1 & expm1\_rn & expm1\_ru & expm1\_rd & expm1\_rz & complete & partial\\ \hline log & log\_rn & log\_ru & log\_rd & log\_rz & complete& complete\\ \hline log1p & log1p\_rn & log1p\_ru & log1p\_rd & log1p\_rz & complete& partial \\ \hline log2 & log2\_rn & log2\_ru & log2\_rd & log2\_rz & complete& partial\\ \hline log10 & log10\_rn & log10\_ru & log10\_rd & log10\_rz& complete& partial \\ \hline sin & sin\_rn & sin\_ru & sin\_rd & sin\_rz & $[-\pi, \pi]$& complete (paper+formal)\\ \hline cos & cos\_rn & cos\_ru & cos\_rd & cos\_rz & $[-\pi/2, \pi/2]$& complete (paper+formal)\\ \hline tan & tan\_rn & tan\_ru & tan\_rd & tan\_rz & $[-\pi/2, \pi/2]$& complete (paper+formal)\\ \hline asin & asin\_rn & asin\_ru & asin\_rd & asin\_rz & complete & partial \\ \hline acos & acos\_rn & acos\_ru & acos\_rd & acos\_rz & complete & partial\\ \hline atan & atan\_rn & atan\_ru & atan\_rd & atan\_rz & complete & complete (paper)\\ \hline sinh & sinh\_rn & sinh\_ru & sinh\_rd & sinh\_rz & complete & complete (paper)\\ \hline cosh & cosh\_rn & cosh\_ru & cosh\_rd & cosh\_rz & complete & complete (paper)\\ \hline sinpi & sinpi\_rn & sinpi\_ru & sinpi\_rd & sinpi\_rz & complete & complete (formal)\\ \hline cospi & cospi\_rn & cospi\_ru & cospi\_rd & cospi\_rz & complete & complete (formal)\\ \hline tanpi & tanpi\_rn & tanpi\_ru & tanpi\_rd & tanpi\_rz & $[2^{-25},2^{-5}]$& complete (formal)\\ \hline % asinpi & asinpi\_rn & asinpi\_ru & asinpi\_rd & asinpi\_rz & complete & partial \\ \hline % acospi & acospi\_rn & acospi\_ru & acospi\_rd & acospi\_rz & complete & partial\\ \hline atanpi & atanpi\_rn & atanpi\_ru & atanpi\_rd & atanpi\_rz & $[\tan(2^{-25}\pi),\tan(2^{-5}\pi)]$ & complete (paper)\\ \hline pow & pow\_rn & & & & see chapter \ref{chap:pow} & see chapter \ref{chap:pow}\\ \hline \end{tabular} \end{center} \caption{Current state of \crlibm.} \label{tab:currentstate} \end{table} Here are some comments on this table: \begin{itemize} \item Every function takes a double-precision number and returns a double-precision number. \item For trigonometric functions the angles are expressed in radian. \item The two last columns describe the state of the proof: \begin{itemize} \item The first indicates the state of the search for worst cases for correct rounding \cite{LMT98,Lef2000}. If it indicates ``complete'', it means that the function is guaranteed to return correct rounding on its whole floating-point input range. Otherwise, it mentions the interval on which the function is guaranteed to return correct rounding. Note that \crlibm\ is designed in such a way that there is a very high probability that it is correctly rounded everywhere, however this is not yet proven formally. This question is explained in details in section \ref{section:crlibm-presentation}. \item The second indicates the state of the proof of the code itself. Some (older) functions have a lengthy paper proof in this document, some other have a partial or complete formal proof using the Gappa proof assistant \cite{Melqu05,DinLauMel2005}. \end{itemize} \end{itemize} \section{Writing portable floating-point programs} Here are some rules to help you design programs which have to produce exactly the same results on different architectures and different operating systems. \begin{itemize} \item Try to use the same compiler on all the systems. \item Demand C99 compliance (pass the \texttt{-C99}, \texttt{-std=c99}, or similar flag to the compiler). For Fortran, demand F90 compliance. \item Call \texttt{crlibm\_init()} before you begin floating-point computation. This ensures that the computations will all be done in IEEE-754 double-precision with round to nearest mode, which is the largest precision well supported by most systems. On IA32 processors, problems may still occur for extremely large or extremely small values. \item Do not hesitate to rely heavily on parentheses (the compiler should respect them according to the standards, although of course some won't). Many times, wondering where the parentheses should go in an expression like \texttt{a+b+c+d} will even help you improve the accuracy of your code. \item Use \texttt{crlibm} functions in place of \texttt{math.h} functions. \end{itemize} %%% Local Variables: %%% mode: latex %%% TeX-master: "crlibm" %%% End: interval-2.1.0/src/crlibm/docs/latex/0_intro.tex0000644000000000000000000006424613031036767017706 0ustar 00000000000000 \section{Correct rounding and elementary functions} \label{sect:intro} The need for accurate elementary functions is important in many critical programs. Methods for computing these functions include table-based methods\cite{Far81,Tan91}, polynomial approximations and mixed methods\cite{DauMor2k}. See the books by Muller\cite{Muller97} or Markstein\cite{Markstein2000} for recent surveys on the subject. The IEEE-754 standard for floating-point arithmetic\cite{IEEE754} defines the usual floating-point formats (single and double precision). It also specifies the behavior of the four basic operators ($+,-,\times,\div$) and the square root in four rounding modes (to the nearest, towards $+\infty$, towards $-\infty$ and towards $0$). Its adoption and widespread use have increased the numerical quality of, and confidence in floating-point code. In particular, it has improved \emph{portability} of such code and allowed construction of \emph{proofs} on its numerical behavior. Directed rounding modes (towards $+\infty$, $-\infty$ and $0$) also enabled efficient \emph{interval arithmetic}\cite{Moore66,KKLRW93}. However, the IEEE-754 standard specifies nothing about elementary functions, which limits these advances to code excluding such functions. Currently, several options exist: on one hand, one can use today's mathematical libraries that are efficient but without any warranty on the correctness of the results. To be fair, most modern libraries are \emph{accurate-faithful}: trying to round to nearest, they return a number that is one of the two FP numbers surrounding the exact mathematical result, and indeed return the correctly rounded result most of the time. This behaviour is sometimes described using phrases like \emph{99\% correct rounding} or \emph{0.501 ulp accuracy}. When stricter guarantees are needed, some multiple-precision packages like MPFR \cite{MPFRweb} offer correct rounding in all rounding modes, but are several orders of magnitude slower than the usual mathematical libraries for the same precision. Finally, there are are currently three attempts to develop a correctly-rounded \texttt{libm}. The first was IBM's \texttt{libultim}\cite{IBMlibultimweb} which is both portable and fast, if bulky, but lacks directed rounding modes needed for interval arithmetic. The second was Ar\'enaire's \texttt{crlibm}, which was first distributed in 2003. The third is Sun correctly-rounded mathematical library called \texttt{libmcr}, whose first beta version appeared in 2004. These libraries are reviewed in \ref{section:lib-overview}. The goal of the \crlibm\ project is to build on a combination of several recent theoretical and algorithmic advances to design a proven correctly rounded mathematical library, with an overhead in terms of performance and resources acceptable enough to replace existing libraries transparently. More generally, the \crlibm\ project serves as an open-source framework for research on software elementary functions. As a side effect, it may be used as a tutorial on elementary function development. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{A methodology for efficient correctly-rounded functions} \label{section:methodology} \subsection{The Table Maker's Dilemma} With a few exceptions, the image $\hat{y}$ of a floating-point number $x$ by a transcendental function $f$ is a transcendental number, and can therefore not be represented exactly in standard numeration systems. The only hope is to compute the floating-point number that is closest to (resp. immediately above or immediately below) the mathematical value, which we call the result \emph{correctly rounded} to the nearest (resp. towards $+\infty$ or towards $-\infty$). It is only possible to compute an approximation ${y}$ to the real number $\hat{y}$ with precision $\maxeps{}$. This ensures that the real value $\hat{y}$ belongs to the interval $[{y}(1-\maxeps{}) , {y}(1+\maxeps{})]$. Sometimes however, this information is not enough to decide correct rounding. For example, if $[{y}(1-\maxeps{}) , {y}(1+\maxeps{})]$ contains the middle of two consecutive floating-point numbers, it is impossible to decide which of these two numbers is the correctly rounded to the nearest of $\hat{y}$. This is known as the Table Maker's Dilemma (TMD). For example, if we consider a numeration system in radix $2$ with $n$-bit mantissa floating point number and $m$ the number of significant bit in $y$ such that $\maxeps{} \leq 2^m$, then the TMD occurs: \begin{itemize} \item for rounding toward $+\infty$, $-\infty$, $0$, when the result is of the form: $$\overbrace{\underbrace{1.xxx...xx}_{n~bits}111111...11}^{m~bits}xxx...$$ or: $$\overbrace{\underbrace{1.xxx...xx}_{n~bits}000000...00}^{m~bits}xxx...$$ \item for rounding to nearest, when the result is of the form: $$\overbrace{\underbrace{1.xxx...xx}_{n~bits}011111...11}^{m~bits}xxx...$$ or : $$\overbrace{\underbrace{1.xxx...xx}_{n~bits}100000...00}^{m~bits}xxx...$$ \end{itemize} \subsection{The onion peeling strategy} A method described by Ziv \cite{Ziv91} is to increase the precision $\maxeps$ of the approximation until the correctly rounded value can be decided. Given a function $f$ and an argument $x$, the value of $f(x)$ is first evaluated using a quick approximation of precision $\maxeps_1$. Knowing $\maxeps_1$, it is possible to decide if rounding is possible, or if more precision is required, in which case the computation is restarted using a slower approximation of precision $\maxeps_2$ greater than $\maxeps_1$, and so on. This approach makes sense even in terms of average performance, as the slower steps are rarely taken. However there was until recently no practical bound on the termination time of such an algorithm. This iteration has been proven to terminate, but the actual maximal precision required in the worst case is unknown. This might prevent using this method in critical application. \section{The Correctly Rounded Mathematical Library} \label{section:crlibm-presentation} Our own library, called \crlibm\ for \emph{correctly rounded mathematical library}, is based on the work of Lef\`evre and Muller \cite{LMT98,Lef2000} who computed the worst-case $\maxeps$ required for correctly rounding several functions in double-precision over selected intervals in the four IEEE-754 rounding modes. For example, they proved that 157 bits are enough to ensure correct rounding of the exponential function on all of its domain for the four IEEE-754 rounding modes. \subsection{Two steps are enough} Thanks to such results, we are able to guarantee correct rounding in two iterations only, which we may then optimize separately. The first of these iterations is relatively fast and provides between 60 and 80 bits of accuracy (depending on the function), which is sufficient in most cases. It will be referred throughout this document as the \quick\ phase of the algorithm. The second phase, referred to as the \accurate\ phase, is dedicated to challenging cases. It is slower but has a reasonably bounded execution time, tightly targeted at Lef\`evre's worst cases. Having a proven worst-case execution time lifts the last obstacle to a generalization of correctly rounded transcendentals. Besides, having only two steps allows us to publish, along with each function, a proof of its correctly rounding behavior. \subsection{Portable IEEE-754 FP for a fast first step} The computation of a tight bound on the approximation error of the first step ($\maxeps_1$) is crucial for the efficiency of the onion peeling strategy: overestimating $\maxeps_1$ means going more often than needed through the second step, as will be detailed below in \ref{sec:error-accuracy-perf}. As we want the proof to be portable as well as the code, our first steps are written in strict IEEE-754 arithmetic. On some systems, this means preventing the compiler/processor combination to use advanced floating-point features such as fused multiply-and-add or extended double precision. It also means that the performance of our portable library will be lower than optimized libraries using these features (see \cite{DinErshGast2005} for recent research on processor-specific correct-rounding). To ease these proofs, our first steps make wide use of classical, well proven results like Sterbenz' lemma or other floating-point theorems. When a result is needed in a precision higher than double precision (as is the case of $y_1$, the result of the first step), it is represented as as the sum of two floating-point numbers, also called a \emph{double-double} number. There are well-known algorithms for computing on double-doubles, and they are presented in the next chapter. An advantage of properly encapsulating double-double arithmetic is that we can actually exploit fused multiply-and-add operators in a transparent manner (this experimental feature is currently available for the Itanium and PowerPC platforms, when using the \texttt{gcc} compiler). At the end of the \quick\ phase, a sequence of simple tests on $y_1$ knowing $\maxeps_1$ allows to decide whether to go for the second step. The sequence corresponding to each rounding mode is shared by most functions and is also carefully proven in the next chapter. \subsection{Ad-hoc, fast multiple precision for accurate second step} For the second step, we may use two specific multiple-precision libraries: \begin{itemize} \item We first designed an ad-hoc multiple-precision library called Software Carry-Save library \emph{(scslib)} which is lighter and faster than other available libraries for this specific application \cite{DefDin2002,DinDef2003}. This choice is motivated by considerations of code size and performance, but also by the need to be independent of other libraries: Again, we need a library on which we may rely at the proof level. This library is included in \crlibm, but also distributed separately \cite{SCSweb}. This library is described in more details in \ref{sec:SCSLib}. \item More recently, we have been using redundant triple-double arithmetic for the second step. This approach is lighter, about ten times faster, and has the advantage of making it easier to reuse information from the fast step in the accurate one. The drawback is that it is more difficult to master. The basic triple-double procedures, and associated usage theorems, are described in a separate document (\texttt{tripledoubleprocedures.pdf}) also available in this distribution. \end{itemize} \subsection{Relaxing portability} The \crlibm\ framework has been used to study the performance advantage of using double-extended (DE) arithmetic when available. More specifically, the first case may be implemented fully in DE precision, and the second step may be implemented fully in double-DE arithmetic. Experiments have been performed on the logarithm and arctangent functions \cite{DinErshGast2005}. On some systems (mostly Linux on an IA32 processor) the logarithm will by default use this technology. Another useful, non-portable hardware feature is the fused multiply-and-add available on Power/PowerPC and Itanium. The \crlibm\ code does its best to use it when available. \subsection{Proving the correct rounding property} Throughout this document, what we call ``proving'' a function mostly means proving a tight bound on the total relative error of our evaluation scheme. The actual proof of the correct rounding property is then dependent on the availability of an actual worst-case accuracy for correctly rounding this function, as computed by Lef\`evre and Muller. Three cases may happen: \begin{itemize} \item The worst case have been computed over the whole domain of the function. In this case the correct rounding property for this function is fully proven. The state of this search for worst cases is described in Table~\ref{tab:currentstate} page~\pageref{tab:currentstate}. \item The worst cases have been computed only over a subdomain of the function. Then the correct rounding property is proven on this subdomain. Outside of this domain \texttt{crlibm} offers ``astronomical confidence'' that the function is correctly rounded: to the best of current knowledge \cite{Gal86, DinErshGast2005}, the probability of the existence of a misrounded value in the function's domain is lower than $2^{-40}$. This is the case of the trigonometric functions, for instance. The actual domain on which the proof is complete is mentionned in the respective chapter of this document, and summed up in Table~\ref{tab:currentstate}. \item The search for worst cases hasn't begun yet. \end{itemize} We acknowledge that the notion of astronomical confidence breaks the objective of guaranteed correct rounding, and we sidestep this problem by publishing along with the library (in this document) the domain of full confidence, which will only expand as time goes. Such behaviour has been proposed as a standard in \cite{DefHanLefMulRevZim2004}. The main advantage of this approach is that it ensures bounded and consistent worst-case execution time (within a factor 100 of that of the best available faithful \texttt{libm}s), which we believe is crucial to the generalization of correctly rounded functions. The alternative to our approach would be to implement a multi-layer onion-peeling strategy, as do GNU MPFR and Sun's \texttt{libmcr}. There are however many drawbacks to this approach, too: \begin{itemize} \item One may argue that, due to the finite nature of computers, it only pushes the bounds of astronomy a little bit further. \item The multilayer approach is only proven to terminate on elementary functions: the termination proof needs a theorem stating for example that the image of a rational by the function (with some well-known exceptions) will not be a rational. For other library functions like special functions, we have no such theorem. For these functions, we prefer take the risk of a misrounded value than the risk of an infinite loop. \item Similarly, the multilayer approach has potentially unbounded execution time and memory consumption which make it unsuitable for real-time or safety-critical applications, whereas crlibm will only be unsuitable if the safety depends on correct rounding, which is much less likely. \item Multilayer code is probably much more complex and error prone. One important problem is that it contains code that, according all probabilities, will never be run. Therefore, testing this code can not be done on the final production executable, but on a different executable in which previous layers have been disabled. This introduces the possibility of undetected bugs in the final production executable. \end{itemize} In the future, we will add, to those \texttt{crlibm} functions for which the required worst-case accuracy is unknown, a misround detection test at the end of the second step. This test will either print out on standard error a lengthy warning inviting to report this case, or launch MPFR computation, depending on a compilation switch. % TODO \subsection{Error analysis and the accuracy/performance tradeoff \label{sec:error-accuracy-perf}} As there are two steps on the evaluation, the proof also usually consists of two parts. The code of the second, accurate step is usually very simple and straightforward: \begin{itemize} \item Performance is not that much of an issue, since this step is rarely taken. \item All the special cases have already been filtered by the first step. \item The \texttt{scslib} library provides an overkill of precision. \end{itemize} Therefore, the error analysis of the second step, which ultimately proves the correct rounding property, is not very difficult. For the first step, however, things are more complicated: \begin{itemize} \item We have to handle special cases (infinities, NaNs, signed zeroes, over- and underflows). \item Performance is a primary concern, sometimes leading to ``dirty tricks'' obfuscating the code. \item We have to compute a \emph{tight} error bound, as explained below. \end{itemize} Why do we need a tight error bound? Because the decision to launch the second step is taken by a \emph{rounding test} depending on \begin{itemize} \item the approximation $y_h+y_l$ computed in the first step, and \item this error bound $\maxeps_1$, which is computed statically. \end{itemize} The various rounding tests are detailed and proven in \ref{section:testrounding}. The important notion here is that \emph{the probability of launching the second, slower step will be proportional to the error bound $\maxeps_1$ computed for the first step}. This defines the main performance tradeoff one has to manage when designing a correctly-rounded function: The average evaluation time will be \begin{equation} T_{\mbox{\small avg}} = T_1 + p_2T_2 \label{eq:Tavg} \end{equation} where $T_1$ and $T_2$ are the execution time of the first and second phase respectively (with $T_2\approx 100T_1$ in \crlibm), and $p_2$ is the probability of launching the second phase (typically we aim at $p_2=1/1000$ so that the average cost of the second step is less than $10\%$ of the total. As $p_2$ is almost proportional to $\maxeps_1$, to minimise the average time, we have to \begin{itemize} \item balance $T_1$ and $p_2$: this is a performance/precision tradeoff (the faster the first step, the less accurate) \item and compute a tight bound on the overall error $\maxeps_1$. \end{itemize} Computing this tight bound is the most time-consuming part in the design of a correctly-rounded elementary function. The proof of the correct rounding property only needs a proven bound, but a loose bound will mean a larger $p_2$ than strictly required, which directly impacts average performance. Compare $p_2=1/1000$ and $p_2=1/500$ for $T_2=100T_1$, for instance. As a consequence, when there are multiple computation paths in the algorithm, it makes sense to precompute different values of $\maxeps_1$ on these different paths (see for instance the arctangent and the logarithm). Apart from these considerations, computing the errors is mostly textbook science. Care must be taken that only \emph{absolute} error terms (noted $\delta$) can be added, although some error terms (like the rounding error of an IEEE operation) are best expressed as \emph{relative} (noted $\epsilon$). Remark also that the error needed for the theorems in \ref{section:testrounding} is a \emph{relative} error. Managing the relative and absolute error terms is very dependent on the function, and usually involves keeping upper and lower bounds on the values manipulated along with the error terms. Error terms to consider are the following: \begin{itemize} \item approximation errors (minimax or Taylor), \item rounding error, which fall into two categories: \begin{itemize} \item roundoff errors in values tabulated as doubles or double-doubles (with the exception of roundoff errors on the coefficient of a polynomial, which are counted in the appproximation error), \item roundoff errors in IEEE-compliant operations. \end{itemize} \end{itemize} \section{An overview of other available mathematical libraries\label{section:lib-overview}} Many high-quality mathematical libraries are freely available and have been a source of inspiration for this work. Most mathematical libraries do not offer correct rounding. They can be classified as \begin{itemize} \item portable libraries assuming IEEE-754 arithmetic, like \emph{fdlibm}, written by Sun\cite{FDLIBMweb}; \item Processor-specific libraries, by Intel\cite{HarKubStoTan99,IntelOpenSource} and HP\cite{Markstein2000,Markstein2001} among other. \end{itemize} Operating systems often include several mathematical libraries, some of which are derivatives of one of the previous. To our knowledge, three libraries currently offer correct rounding: \begin{itemize} \item The \emph{libultim} library, also called MathLib, is developed at IBM by Ziv and others \cite{IBMlibultimweb}. It provides correct rounding, under the assumption that 800 bits are enough in all case. This approach suffers two weaknesses. The first is the absence of proof that 800 bits are enough: all there is is a very high probability. The second is that, as we will see in the sequel, for challenging cases, 800 bits are much of an overkill, which can increase the execution time up to 20,000 times a normal execution. This will prevent such a library from being used in real-time applications. Besides, to prevent this worst case from degrading average performance, there is usually some intermediate levels of precision in MathLib's elementary functions, which makes the code larger, more complex, and more difficult to prove (and indeed this library is scarcely documented). In addition this library provides correct rounding only to nearest. This is the most used rounding mode, but it might not be the most important as far as correct rounding is concerned: correct rounding provides a precision improvement over current mathematical libraries of only a fraction of a {unit in the last place} \emph{(ulp)}. Conversely, the three other rounding modes are needed to guarantee intervals in interval arithmetic. Without correct rounding in these directed rounding modes, interval arithmetic looses up to one \emph{ulp} of precision in each computation. \item \emph{MPFR} is a multiprecision package safer than \emph{libultilm} as it uses arbitrary multiprecision. It provides most of elementary functions for the four rounding modes defined by the IEEE-754 standard. However this library is not optimized for double precision arithmetic. In addition, as its exponent range is much wider than that of IEEE-754, the subtleties of subnormal numbers are difficult to handle properly using such a multiprecision package. \item The \texttt{libmcr} library, by K.C. Ng, Neil Toda and others at Sun Microsystems, had its first beta version published in december 2004. Its purpose is to be a reference implementation for correctly rounded functions in double precision. It has very clean code, offers arbitrary multiple precision unlike \texttt{libultim}, at the expense of slow performance (due to, for example dynamic allocation of memory). It offers the directed rounding modes, and rounds in the mode read from the processor status flag. \end{itemize} \section{Various policies in \crlibm} \subsection{Naming the functions} Current \crlibm\ doesn't by default replace your existing \texttt{libm}: the functions in \crlibm\ have the C99 name, suffixed with \texttt{\_rn}, \texttt{\_ru}, \texttt{\_rd}, and \texttt{\_rz} for rounding to the nearest, up, down and to zero respectively. They require the processor to be in round to nearest mode. Starting with version 0.9 we should provide a compile-time flag which will overload the default \texttt{libm} functions with the crlibm ones with rounding to nearest. It is interesting to compare this to the behaviour of Sun's library: First, Sun's \texttt{libmcr} provides only one function for each C99 function instead of four in \crlibm, and rounds according to the processor's current mode. This is probably closer to the expected long-term behaviour of a correctly-rounded mathematical library, but with current processors it may have a tremendous impact on performance. Besides, the notion of ``current processor rounding mode'' is no longer relevant on recent processors like the Itanium family, which have up to four different modes at the same time. A second feature of \texttt{libmcr} is that it overloads by default the system \texttt{libm}. The policy implemented in current \crlibm\ intends to provide best performance to the two classes of users who will be requiring correct rounding: Those who want predictible, portable behaviour of floating-point code, and those who implement interval arithmetic. Of course, we appreciate any feedback on this subject. \subsection{Policy concerning IEEE-754 flags} Currently, the \crlibm\ functions try to raise the Overflow and Underflow flags properly. Raising the other flags (especially the Inexact flag) is possible but considered too costly for the expected use, and will usually not be implemented. We also appreciate feedback on this subject. \subsection{Policy concerning conflicts between correct rounding and expected mathematical properties} As remarked in \cite{DefHanLefMulRevZim2004}, it may happen that the requirement of correct rounding conflicts with a basic mathematical property of the function, such as its domain and range. A typical example is the arctangent of a very large number which, rounded up, will be a number larger than $\pi/2$ (fortunately, $\round(\pi/2) < \pi/2$). The policy that will be implemented in \crlibm\ will be \begin{itemize} \item to give priority to the mathematical property in round to nearest mode (so as not to hurt the innocent user who may expect such a property to be respected), and \item to give priority to correct rounding in the directed rounding modes, in order to provide trustful bounds to interval arithmetic. \end{itemize} Again, this policy is open to discussion. \section{Organization of the source code} For recent functions implemented using triple-double arithmetic, both quick and accurate phase are provided in a single source file, \emph{e.g.} \texttt{exp-td.c}. For older functions using the SCS library, each function is implemented as two files, one with the \texttt{\_accurate} suffix (for instance \texttt{trigo\_accurate.c}), the other named with the \texttt{\_fast} suffix (for instance \texttt{trigo\_fast.c}). The \emph{software carry-save} multiple-precision library is contained in a subdirectory called \texttt{scs\_lib}. The common C routines that are detailed in Chapter~\ref{chap:common} of this document are defined in \texttt{crlibm\_private.c} and \texttt{crlibm\_private.h}. Many of the constants used in the C code have been computed thanks to Maple procedures which are contained in the \texttt{maple} subdirectory. Some of these procedures are explained in Chapter~\ref{chap:common}. For some functions, a Maple procedure mimicking the C code, and used for debugging or optimization purpose, is also available. The code also includes programs to test the \texttt{crlibm} functions against MPFR, \texttt{libultim} or \texttt{libmcr}, in terms of correctness and performance. They are located in the \texttt{tests} directory. Gappa proof scripts are located in the \texttt{gappa} directory. %%% Local Variables: %%% mode: latex %%% TeX-master: "crlibm" %%% End: interval-2.1.0/src/crlibm/docs/latex/1_common.tex0000644000000000000000000024750113031036767020041 0ustar 00000000000000% Common notations, theorems and procedures \section{Notations\label{section:notations}} The following notations will be used throughout this document: \begin{itemize} \item $+$, $-$ and $\times$ denote the usual mathematical operations. \item $\oplus$, $\ominus$ and $\otimes$ denote the corresponding floating-point operations in IEEE-754 double precision, in the IEEE-754 \emph{round to nearest} mode. \item $\round(x)$, $\roundup(x)$ and $\rounddown(x)$ denote the value of $x$ rounded to the nearest, resp. rounded up and down. \item $\epsilon$ (usually with some index) denotes a relative error, $\delta$ denotes an absolute error. Upper bounds on the absolute value of these errors will be denoted $\maxeps$ and $\maxdelta$. \item $\maxeps_{-k}$ -- with a negative index -- represents an error $e$ such that $|e| \leq 2^{-k}$. \item For a floating-point number $x$, the value of the least significant bit of its mantissa is classically denoted $\ulp(x)$. \end{itemize} \section{Common C procedures for double-precision numbers\label{section:commonCdouble}} \subsection{Sterbenz Lemma \label{sec:sterbenz}} \begin{theorem}[Sterbenz Lemma~\cite{Ste74,Gol91}] \label{sterbenz} If $x$ and $y$ are floating-point numbers, and if ${y}/{2} \leq x \leq 2y$ then $x\ominus y$ is computed exactly, without any rounding error. \end{theorem} \subsection{Double-precision numbers in memory\label{section:memory}} A double precision floating-point number uses $64$ bits. The unit of memory in most current architectures is a 32-bit word. The order in which the two $32$ bits words of a double are stored in memory depends on the architecture. An architecture is said \emph{Little Endian} if the lower part of the number is stored in memory at the smallest address; It is the case of the x86 processors. Conversely, an architecture with the high part of the number stored in memory at the smallest address is said \emph{Big Endian}; It is the case of the PowerPC processors. In \crlibm, we extract the higher and lower parts of a double by using an union in memory: the type \texttt{db\_number}. The following code extracts the upper and lower part from a double precision number $x$. \begin{lstlisting}[label={chap0:lst:endian}, caption={Extract upper and lower part of a double precision number $x$},firstnumber=1] /* HI and LO are defined automatically by autoconf/automake. */ db_number xx; int x_hi, x_lo; xx.d = x; x_hi = xx.i[HI] x_lo = xx.i[LO] \end{lstlisting} \subsection{Conversion from floating-point to integer \label{sec:double2int}} \begin{theorem}[Conversion floating-point to integer] The following algorithm, taken from \cite{AMDoptim2001}, converts a double-precision floating-point number $d$ into a 32-bit integer $i$ with rounding to nearest mode. It works for all the doubles whose nearest integer fits on a 32-bit machine signed integer. \begin{lstlisting}[label={chap0:lst:conversion2},caption={Conversion from FP to int},firstnumber=1] #define DOUBLE2INT(i, d) \ {double t=(d+6755399441055744.0); i=LO(t);} \end{lstlisting} \end{theorem} This algorithm adds the constant $2^{52}+2^{51}$ to the floating-point number to put the integer part of $x$, in the lower part of the floating-point number. We use $2^{52}+2^{51}$ and not $2^{52}$, because the value $2^{51}$ is used to contain possible carry propagations with negative numbers. \subsection{Conversion from floating-point to 64-bit integer \label{sec:double2longint}} \begin{theorem}[Conversion floating-point to a long long integer] The following algorithm, is derived from the previous. It works for any double whose nearest integer is smaller than $2^{51} -1$. \begin{lstlisting}[label={chap0:lst:conversion3},caption={Conversion from FP to long long int},firstnumber=1] #define DOUBLE2LONGINT(i, d) \ { \ db_number t; \ t.d = (d+6755399441055744.0); \ if (d >= 0) /* sign extend */ \ i = t.l & 0x0007FFFFFFFFFFFFLL; \ else \ i = (t.l & 0x0007FFFFFFFFFFFFLL) | (0xFFF8000000000000LL); \ } \end{lstlisting} \end{theorem} \subsection{Methods to raise IEEE-754 flags} The IEEE standard imposes, in certain cases, to raise flags and/or exceptions for the $4$ operators ($+$, $\times$, $\div$, $\sqrt{~}$). Therefore, it is legitimate to require the same for elementary functions. In ISO C99, the following instructions raise exceptions and flags: \begin{itemize} \item {\bf underflow} : the multiplication $\pm smallest \times smallest$ where $smallest$ correspond to the smallest subnormal number, \item {\bf overflow} : the multiplication $\pm largest \times largest$ where $largest$ correspond to the largest normalized number, \item {\bf division by zero} : the division $\pm 1.0/0.0$, \item {\bf inexact} : the addition $(x + smallest) - smallest$ where $x$ is the result and $smallest$ the smallest subnormal number, \item {\bf invalid} : the division $\pm 0.0/0.0$. \end{itemize} \section{Common C procedures for double-double arithmetic\label{section:commonCdoubledouble}} Hardware operators are usualy limited to double precision. To perform operations with more precision, then software solutions need to be used. One among them is to represent a floating point number as the sum of two non-overlapping floating-point numbers (or \emph{double-double} numbers). The algorithms are given as plain C functions, but it may be preferable, for performance issue, to implement them as macros, as in \texttt{libultim}. The code offers both versions, selected by the \texttt{DEKKER\_AS\_FUNCTIONS} constant which is set by default to 1 (functions). A more recent proof is available in \cite{Lauter2005LIP:tripledouble}. \subsection{Exact sum algorithm {Add12}} This algorithm is also known as the Fast2Sum algorithm in the litterature. \begin{theorem}[Exact sum~\cite{Knu73, Boldo2001}] Let $a$ and $b$ be floating-point numbers, then the following method computes two floating-point numbers $s$ and $r$, such that $s+r = a+b$ exactly, and $s$ is the floating-point number which is closest to $a+b$. \begin{lstlisting}[label={lst:Add12Cond},caption={Add12Cond},firstnumber=1] void Add12Cond(double *s, double *r, a, b) { double z; s = a + b; if (ABS(a) > ABS(b)){ z = s - a; r = b - z; }else { z = s - b; r = a - z; } } \end{lstlisting} Here ABS is a macro that returns the absolute value of a floating-point number. This algorithm requires $4$ floating-point additions and $2$ floating point tests (some of which are hidden in the ABS macro). Note that if it is more efficient on a given architecture, the test can be replaced with a test on the exponents of $a$ and $b$. \end{theorem} If we are able to prove that the exponent of $a$ is always greater than that of $b$, then the previous algorithm to perform an exact addition of 2 floating-point numbers becomes : \begin{lstlisting}[label={lst:Add12},caption={Add12},firstnumber=1] void Add12(double *s, double *r, a, b) { double z; s = a + b; z = s - a; r = b - z; } \end{lstlisting} The cost of this algorithm is $3$ floating-point additions. \subsection{Exact product algorithm {Mul12}} This algorithm is sometimes also known as the Dekker algorithm \cite{Dek71}. It was proven by Dekker but the proof predates the IEEE-754 standard and is difficult to read. An easier proof is available in \cite{Gol91} (see Th. 14). \begin{theorem}[Restricted exact product] Let $a$ and $b$ be two double-precision floating-point numbers, with 53 bits of mantissa. Let $c=2^{\lceil\frac{ 53}{2} \rceil}+1$. Assuming that $a<2^{970}$ and $b<2^{970}$, the following procedure computes the two floating-point numbers $rh$ and $rl$ such that $rh + rl = a + b$ with $rh = a \otimes b$: \begin{lstlisting}[label={lst:Mul12},caption={Mul12},firstnumber=1] void Mul12(double *rh, double *rl, double u, double v){ const double c = 134217729.; /* 1+2^27 */ double up, u1, u2, vp, v1, v2; up = u*c; vp = v*c; u1 = (u-up)+up; v1 = (v-vp)+vp; u2 = u-u1; v2 = v-v1; *rh = u*v; *rl = (((u1*v1-*rh)+(u1*v2))+(u2*v1))+(u2*v2); } \end{lstlisting} \end{theorem} The cost of this algorithm is $10$ floating-point additions and $7$ floating-point multiplications. The condition $a<2^{970}$ and $b<2^{970}$ prevents overflows when multiplying by $c$. If it cannot be proved statically, then we have to first test $a$ and $b$, and prescale them so that the condition is true. \begin{theorem}[Exact product] Let $a$ and $b$ be two double-precision floating-point numbers, with 53 bits of mantissa. Let $c=2^{\lceil\frac{ 53 }{2}\rceil}+1$. The following procedure computes the two floating-point numbers $rh$ and $rl$ such that $rh + rl = a + b$ with $rh = a \otimes b$: \begin{lstlisting}[label={lst:Mul12Cond},caption={Mul12Cond},firstnumber=1] void Mul12Cond(double *rh, double *rl, double a, double b){ const double two_970 = 0.997920154767359905828186356518419283e292; const double two_em53 = 0.11102230246251565404236316680908203125e-15; const double two_e53 = 9007199254740992.; double u, v; if (a>two_970) u = a*two_em53; else u = a; if (b>two_970) v = b*two_em53; else v = b; Mul12(rh, rl, u, v); if (a>two_970) {*rh *= two_e53; *rl *= two_e53;} if (b>two_970) {*rh *= two_e53; *rl *= two_e53;} }\end{lstlisting} \end{theorem} The cost in the worst case is then $4$ tests over integers, $10$ floating-point additions and $13$ floating-point multiplications. Finally, note that a fused multiply-and-add provides the Mul12 and Mul12Cond in only two instructions \cite{CorneaHarrisonTang2002}. Here is the example code for the Itanium processor. \begin{lstlisting}[label={lst:Mul12CondFMA},caption={Mul12 on the Itanium},firstnumber=1] #define Mul12Cond(rh,rl,u,v) \ { \ *rh = u*v; \ /* The following means: *rl = FMS(u*v-*rh) */ \ __asm__ __volatile__("fms %0 = %1, %2, %3\n ;;\n" \ : "=f"(*rl) \ : "f"(u), "f"(v), "f"(*rh) \ ); \ } #define Mul12 Mul12Cond \end{lstlisting} The \crlibm\ distribution attempts to use the FMA for systems on which it is availables (currently Itanium and PowerPC). \subsection{Double-double addition {Add22}} This algorithm, also due to Dekker \cite{Dek71}, computes the sum of two double-double numbers as a double-double, with a relative error smaller than $2^{-103}$ (there is a proof in \cite{Dek71}, a more recent one can be found in in \cite{Lauter2005LIP:tripledouble}). \begin{lstlisting}[label={Add22Cond},caption={Add22Cond},firstnumber=1] void Add22Cond(double *zh, double *zl, double xh, double xl, double yh, double yl) { double r,s; r = xh+yh; s = (ABS(xh) > ABS(yh))? (xh-r+yh+yl+xl) : (yh-r+xh+xl+yl); *zh = r+s; *zl = r - (*zh) + s; } \end{lstlisting} Here ABS is a macro that returns the absolute value of a floating-point number. Again, if this test can be resolved at compile-time, we get the faster \texttt{Add22} procedure: \begin{lstlisting}[label={Add22},caption={Add22},firstnumber=1] void Add22(double *zh, double *zl, double xh, double xl, double yh, double yl) { double r,s; r = xh+yh; s = xh-r+yh+yl+xl; *zh = r+s; *zl = r - (*zh) + s; } \end{lstlisting} \subsection{Double-double multiplication {Mul22}} This algorithm, also due to Dekker \cite{Dek71}, computes the product of two double-double numbers as a double-double, with a relative error smaller than $2^{-102}$, under the condition $x_h<2^{970}$ and $y_h<2^{970}$ (there is a proof in \cite{Dek71}, a more recent one can be found in in \cite{Lauter2005LIP:tripledouble}). \begin{lstlisting}[label={Mul22},caption={Mul22},firstnumber=1] void Mul22(double *zh, double *zl, double xh, double xl, double yh, double yl) { double mh, ml; const double c = 134217729.; /* 0x41A00000, 0x02000000 */ double up, u1, u2, vp, v1, v2; up = xh*c; vp = yh*c; u1 = (xh-up)+up; v1 = (yh-vp)+vp; u2 = xh-u1; v2 = yh-v1; mh = xh*yh; ml = (((u1*v1-mh)+(u1*v2))+(u2*v1))+(u2*v2); ml += xh*yl + xl*yh; *zh = mh+ml; *zl = mh - (*zh) + ml; } \end{lstlisting} Note that the bulk of this algorithm is a \texttt{Mul12(mh,ml,xh,yh)}. Of course there is a conditional version of this procedure but we have not needed it so far. %Our algorithms will sometimes need to multiply a double by a %double-double. In this case we use \texttt{Mul22} with one of the %arguments set to zero, which only performs one useless multiplication %by zero and one useless addition: a specific procedure is not needed. \subsection{The multiplication procedure \MuldDD} \begin{algorithm}[\MuldDD] \label{muldDDref} ~ \\ {\bf In:} a double precision number $a$ and a double-double number $b_\hi + b_\lo$ \\ {\bf Out:} a double-double number $r_\hi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert b_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert b_\hi \right \vert \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{60mm} $\left( t_1, t_2 \right) \gets \mMul\left( a, b_\hi \right)$ \\ $t_3 \gets a \otimes b_\lo$ \\ $t_4 \gets t_2 \oplus t_3$ \\ $\left( r_\hi, r_\lo \right) \gets \mAdd\left( t_1, t_4 \right)$ \\ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{muldDDref} \MuldDD] ~ \\ Let be $a$ and $b_\hi + b_\lo$ the values taken by the arguments of algorithm \ref{muldDDref} \MuldDD \\ So the following holds for the values returned $r_\hi$ and $r_\lo$: $$r_\hi + r_\lo = \left( a \cdot \left( b_\hi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded as follows: $$\left \vert \epsilon \right \vert \leq 2^{-102}$$ The values returned $r_\hi$ and $r_\lo$ will not overlap at all. \end{theorem} \subsection{Double-double Horner step procedures\label{sec:double-double-horner}} \subsubsection{The multiply-and-add operator \MulAddDdD} \begin{algorithm}[\MulAddDdD] \label{MulAddDdDref} ~ \\ {\bf In:} a double-double number $c_\hi + c_\lo$, a double precision number $a$ and a double-double number $b_\hi + b_\lo$ \\ {\bf Out:} a double-double number $r_\hi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert b_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert b_\hi \right \vert \\ \left \vert c_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert c_\hi \right \vert \\ \left \vert a \cdot \left( b_\hi + b_\lo \right) \right \vert & \leq & 2^{-2} \cdot \left \vert c_\hi + c_\lo \right \vert \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{50mm} $\left(t_1, t_2 \right) \gets \mMul\left( a , b_\hi \right)$ \\ $\left(t_3, t_4 \right) \gets \mAdd\left( c_\hi , t_1 \right)$ \\ $t_5 \gets b_\lo \otimes a$ \\ $t_6 \gets c_\lo \oplus t_2$ \\ $t_7 \gets t_5 \oplus t_6$ \\ $t_8 \gets t_7 \oplus t_4$ \\ $\left(r_\hi, r_\lo \right) \gets \mAdd\left( t_3 , t_8 \right)$ \\ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{MulAddDdDref} \MulAddDdD\label{theoMulAddDdDref}] ~ \\ Let be $c_\hi + c_\lo$, $a$ and $b_\hi + b_\lo$ the arguments of algorithm \ref{MulAddDdDref} \MulAddDdD~ verifying the given preconditions.\\ So the following egality will hold for the returned values $r_\hi$ and $r_\lo$ $$r_\hi + r_\lo = \left( \left( c_\hi + c_\lo \right) + a \cdot \left( b_\hi + b_\lo \right) \right) \cdot \left( 1 + \epsilon \right)$$ where $\epsilon$ is bounded by: $$\left \vert \epsilon \right \vert \leq 2^{-100}$$ The returned values $r_\hi$ and $r_\lo$ will not overlap at all. \end{theorem} \subsubsection{The multiply-and-add operator \MulAddDD} \begin{algorithm}[\MulAddDD] \label{MulAddDDref} ~ \\ {\bf In:} three double-double numbers $c_\hi + c_\lo$, $a_\hi + a_\lo$ and $b_\hi + b_\lo$ \\ {\bf Out:} a double-double number $r_\hi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert a_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert a_\hi \right \vert \\ \left \vert b_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert b_\hi \right \vert \\ \left \vert c_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert c_\hi \right \vert \\ \left \vert \left( a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\lo \right) \right \vert & \leq & 2^{-2} \cdot \left \vert c_\hi + c_\lo \right \vert \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{50mm} $\left(t_1, t_2 \right) \gets \mMul\left( a_\hi , b_\hi \right)$ \\ $\left(t_3, t_4 \right) \gets \mAdd\left( c_\hi , t_1 \right)$ \\ $t_5 \gets a_\hi \otimes b_\lo$ \\ $t_6 \gets a_\lo \otimes b_\hi$ \\ $t_7 \gets t_2 \oplus c_\lo$ \\ $t_8 \gets t_4 \oplus t_7$ \\ $t_9 \gets t_5 \oplus t_6$ \\ $t_{10} \gets t_8 \oplus t_9$ \\ $\left(r_\hi, r_\lo \right) \gets \mAdd\left( t_3 , t_{10} \right)$ \\ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{MulAddDDref} \MulAddDD\label{theoMulAddDDref}] ~ \\ Let be $c_\hi + c_\lo$, $a_\hi + a_\lo$ and $b_\hi + b_\lo$ the arguments of algorithm \ref{MulAddDDref} \MulAddDD~ verifying the given preconditions.\\ So the following egality will hold for the returned values $r_\hi$ and $r_\lo$ $$r_\hi + r_\lo = \left( \left( c_\hi + c_\lo \right) + \left( a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\lo \right) \right) \cdot \left( 1 + \epsilon \right)$$ where $\epsilon$ is bounded by: $$\left \vert \epsilon \right \vert \leq 2^{-100}$$ The returned values $r_\hi$ and $r_\lo$ will not overlap at all. \end{theorem} \subsection{Multiplication of a double-double by an integer} Use Cody and Waite algorithm. See for instance the $\log$ and the trigonometric argument reduction (chapter \ref{chap:log}, p. \pageref{chap:log}). \section{Common C procedures for triple-double arithmetic\label{section:commonCtripledouble}} These procedures are used to reach accuracies of about 150 bits. They are detailed and proven in \cite{Lauter2005LIP:tripledouble}. \begin{algorithm}[Renormalization] \label{renormalg}~\\ {\bf In: $a_\hi, a_\mi, a_\lo \in \F$} verifying the following preconditions:\\ {\bf Preconditions: } \begin{itemize} \item None of the numbers $a_\hi, a_\mi, a_\lo$ is subnormal \item $a_\hi$ et $a_\mi$ do not overlap in more than $51$ bits \item $a_\mi$ et $a_\lo$ do not overlap in more than $51$ bits \end{itemize} which means formally: \begin{eqnarray*} \left \vert a_\mi \right \vert & \leq & 2^{-2} \cdot \left \vert a_\hi \right \vert \\ \left \vert a_\lo \right \vert & \leq & 2^{-2} \cdot \left \vert a_\mi \right \vert \\ \left \vert a_\lo \right \vert & \leq & 2^{-4} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} {\bf Out: $r_\hi, r_\mi, r_\lo \in \F$} \begin{eqnarray*} \left(t_{1\hi}, t_{1\lo}\right) & \gets & \mAdd\left(a_\mi,a_\lo\right) \\ \left(r_\hi, t_{2\lo}\right) & \gets & \mAdd\left(a_\hi, t_{1\hi}\right) \\ \left(r_\mi, r_\lo\right) & \gets & \mAdd\left(t_{2\lo}, t_{1\lo}\right) \end{eqnarray*} \end{algorithm} \begin{theorem}[Correctness of the renormalization algorithm \ref{renormalg} \Renormalize] ~\\ For all arguments verifying the preconditions of procedure \Renormalize, the values returned $r_\hi$, $r_\mi$ and $r_\lo$ will not overlap unless they are all equal to $0$ and their sum will be exactly the sum of the values in argument $a_\hi$, $a_\mi$ et $a_\lo$. This implies: $$\left \vert r_\mi \right \vert \leq 2^{-52} \cdot \left \vert r_\hi \right \vert$$ $$\left \vert r_\lo \right \vert \leq 2^{-53} \cdot \left \vert r_\mi \right \vert$$ \end{theorem} \subsection{The addition operator \AddTT} \begin{algorithm}[\AddTT] \label{addTTref} ~ \\ {\bf In:} two triple-double numbers, $a_\hi + a_\mi + a_\lo$ and $b_\hi + b_\mi + b_\lo$ \\ {\bf Out:} a triple-double number $r_\hi + r_\mi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert b_\hi \right \vert & \leq & \frac{3}{4} \cdot \left \vert a_\hi \right \vert \\ \left \vert a_\mi \right \vert & \leq & 2^{-\alpha_o} \cdot \left \vert a_\hi \right \vert \\ \left \vert a_\lo \right \vert & \leq & 2^{-\alpha_u} \cdot \left \vert a_\mi \right \vert \\ \left \vert b_\mi \right \vert & \leq & 2^{-\beta_o} \cdot \left \vert b_\hi \right \vert \\ \left \vert b_\lo \right \vert & \leq & 2^{-\beta_u} \cdot \left \vert b_\mi \right \vert \\ \alpha_o & \geq & 4 \\ \alpha_u & \geq & 1 \\ \beta_o & \geq & 4 \\ \beta_u & \geq & 1 \\ \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{50mm} $\left(r_\hi, t_1 \right) \gets \mAdd\left( a_\hi, b_\hi \right)$ \\ $\left(t_2, t_3 \right) \gets \mAdd\left( a_\mi, b_\mi \right)$ \\ $\left(t_7, t_4 \right) \gets \mAdd\left( t_1, t_2 \right)$ \\ $t_6 \gets a_\lo \oplus b_\lo$ \\ $t_5 \gets t_3 \oplus t_4$ \\ $t_8 \gets t_5 \oplus t_6$ \\ $\left( r_\mi, r_\lo \right) \gets \mAdd\left( t_7, t_8 \right)$ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{addTTref} \AddTT\label{theoAddTT}] ~ \\ Let be $a_\hi + a_\mi + a_\lo$ and $b_\hi + b_\mi + b_\lo$ the triple-double arguments of algorithm \ref{addTTref} \AddTT~ verifying the given preconditions.\\ So the following egality will hold for the returned values $r_\hi$, $r_\mi$ and $r_\lo$ $$r_\hi + r_\mi + r_\lo = \left(\left(a_\hi + a_\mi + a_\lo \right) + \left( b_\hi + b_\mi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded by: $$\left \vert \epsilon \right \vert \leq 2^{-\min\left(\alpha_o + \alpha_u,\beta_o + \beta_u\right) - 47} + 2^{-\min\left( \alpha_o, \beta_o\right) - 98}$$ The returned values $r_\mi$ and $r_\lo$ will not overlap at all and the overlap of $r_\hi$ and $r_\mi$ will be bounded by the following expression: $$\left \vert r_\mi \right \vert \leq 2^{-\min\left( \alpha_o, \beta_o \right) + 5} \cdot \left \vert r_\hi \right \vert$$ \end{theorem} \subsection{The addition operator \AddDTT} \begin{algorithm}[\AddDTT] \label{addDTTref} ~ \\ {\bf In:} a double-double number $a_\hi + a_\lo$ and a triple-double number $b_\hi + b_\mi + b_\lo$ \\ {\bf Out:} a triple-double number $r_\hi + r_\mi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert b_\hi \right \vert & \leq & 2^{-2} \cdot \left \vert a_\hi \right \vert \\ \left \vert a_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert a_\hi \right \vert \\ \left \vert b_\mi \right \vert & \leq & 2^{-\beta_o} \cdot \left \vert b_\hi \right \vert \\ \left \vert b_\lo \right \vert & \leq & 2^{-\beta_u} \cdot \left \vert b_\mi \right \vert \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{50mm} $\left( r_\hi, t_1 \right) \gets \mAdd\left( a_\hi, b_\hi \right)$ \\ $\left( t_2, t_3 \right) \gets \mAdd\left( a_\lo, b_\mi \right)$ \\ $\left( t_4, t_5 \right) \gets \mAdd\left( t_1, t_2 \right)$ \\ $t_6 \gets t_3 \oplus b_\lo$ \\ $t_7 \gets t_6 \oplus t_5$ \\ $\left( r_\mi, r_\lo \right) \gets \mAdd\left( t_4, t_7 \right)$ \\ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{addDTTref} \AddDTT] ~ \\ Let be $a_\hi + a_\lo$ and $b_\hi + b_\mi + b_\lo$ the values taken in argument of algorithm \ref{addDTTref} \AddDTT. Let the preconditions hold for this values.\\ So the following holds for the values returned by the algorithm $r_\hi$, $r_\mi$ and $r_\lo$ $$r_\hi + r_\mi + r_\lo = \left(\left(a_\hi + a_\mi + a_\lo \right) + \left( b_\hi + b_\mi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded by $$\left \vert \epsilon \right \vert \leq 2^{-\beta_o - \beta_u - 52} + 2^{-\beta_o - 104} + 2^{-153}$$ The values $r_\mi$ and $r_\lo$ will not overlap at all and the overlap of $r_\hi$ and $r_\mi$ will be bounded by: $$\left \vert r_\mi \right \vert \leq 2^{-\gamma} \cdot \left \vert r_\hi \right \vert$$ with $$\gamma \geq \min\left( 45, \beta_o - 4, \beta_o + \beta_u - 2 \right)$$ \end{theorem} \subsection{The addition operator \AdddTT} \begin{algorithm}[\AdddTT] \label{adddTTref} ~ \\ {\bf In:} a double precision number $a$ and a triple-double number $b_\hi + b_\mi + b_\lo$ \\ {\bf Out:} a triple-double number $r_\hi + r_\mi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert b_\hi \right \vert & \leq & 2^{-2} \cdot \left \vert a \right \vert \\ \left \vert b_\mi \right \vert & \leq & 2^{-\beta_o} \cdot \left \vert b_\hi \right \vert \\ \left \vert b_\lo \right \vert & \leq & 2^{-\beta_u} \cdot \left \vert b_\mi \right \vert \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{50mm} $\left( r_\hi, t_1 \right) \gets \mAdd\left( a, b_\hi \right)$ \\ $\left( t_2, t_3 \right) \gets \mAdd\left( t_1, b_\mi \right)$ \\ $t_4 \gets t_3 \oplus b_\lo$ \\ $\left( r_\mi, r_\lo \right) \gets \mAdd\left( t_2, t_4 \right)$ \\ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{adddTTref} \AdddTT] ~ \\ Let be $a$ and $b_\hi + b_\mi + b_\lo$ the values taken in argument of algorithm \ref{adddTTref} \AdddTT. Let the preconditions hold for this values.\\ So the following holds for the values returned by the algorithm $r_\hi$, $r_\mi$ and $r_\lo$ $$r_\hi + r_\mi + r_\lo = \left(a + \left( b_\hi + b_\mi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded by $$\left \vert \epsilon \right \vert \leq 2^{-\beta_o - \beta_u - 52} + 2^{-154}$$ The values $r_\mi$ and $r_\lo$ will not overlap at all and the overlap of $r_\hi$ and $r_\mi$ will be bounded by: $$\left \vert r_\mi \right \vert \leq 2^{-\gamma} \cdot \left \vert r_\hi \right \vert$$ with $$\gamma \geq \min\left( 47, \beta_o - 2, \beta_o + \beta_u - 1 \right)$$ \end{theorem} \subsection{The multiplication procedure \MulTT} \begin{algorithm}[\MulTT] \label{mulTTref} ~ \\ {\bf In:} two triple-double numbers $a_\hi + a_\mi + a_\lo$ and $b_\hi + b_\mi + b_\lo$ \\ {\bf Out:} a triple-double number $r_\hi + r_\mi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert a_\mi \right \vert & \leq & 2^{-\alpha_o} \cdot \left \vert a_\hi \right \vert \\ \left \vert a_\lo \right \vert & \leq & 2^{-\alpha_u} \cdot \left \vert a_\mi \right \vert \\ \left \vert b_\mi \right \vert & \leq & 2^{-\beta_o} \cdot \left \vert b_\hi \right \vert \\ \left \vert b_\lo \right \vert & \leq & 2^{-\beta_u} \cdot \left \vert b_\mi \right \vert \end{eqnarray*} with \begin{eqnarray*} \alpha_o & \geq & 2 \\ \alpha_u & \geq & 2 \\ \beta_o & \geq & 2 \\ \beta_u & \geq & 2 \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{60mm} $\left( r_\hi, t_1 \right) \gets \mMul\left( a_\hi, b_\hi \right)$ \\ $\left( t_2, t_3 \right) \gets \mMul\left( a_\hi, b_\mi \right)$ \\ $\left( t_4, t_5 \right) \gets \mMul\left( a_\mi, b_\hi \right)$ \\ $\left( t_6, t_7 \right) \gets \mMul\left( a_\mi, b_\mi \right)$ \\ $t_8 \gets a_\hi \otimes b_\lo$ \\ $t_9 \gets a_\lo \otimes b_\hi$ \\ $t_{10} \gets a_\mi \otimes b_\lo$ \\ $t_{11} \gets a_\lo \otimes b_\mi$ \\ $t_{12} \gets t_8 \oplus t_9$ \\ $t_{13} \gets t_{10} \oplus t_{11}$ \\ $\left( t_{14}, t_{15} \right) \gets \mAdd\left( t_1, t_6 \right)$ \\ $t_{16} \gets t_7 \oplus t_{15}$ \\ $t_{17} \gets t_{12} \oplus t_{13}$ \\ $t_{18} \gets t_{16} \oplus t_{17}$ \\ $\left( t_{19}, t_{20} \right) \gets \mAdd\left( t_{14}, t_{18} \right)$ \\ $\left( t_{21}, t_{22} \right) \gets \mAddDD\left( t_2, t_3, t_4, t_5 \right)$ \\ $\left( r_\mi, r_\lo \right) \gets \mAddDD\left( t_{21}, t_{22}, t_{19}, t_{20} \right)$ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{mulTTref} \MulTT] ~ \\ Let be $a_\hi + a_\mi + a_\lo$ and $b_\hi + b_\mi + b_\lo$ the values taken by the arguments of algorithm \ref{mulTTref} \MulTT \\ So the following holds for the values returned $r_\hi$, $r_\mi$ and $r_\lo$: $$r_\hi + r_\mi + r_\lo = \left(\left(a_\hi + a_\mi + a_\lo \right) \cdot \left( b_\hi + b_\mi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded as follows: \begin{eqnarray*} \left \vert \epsilon \right \vert & \leq & 2^{-151} \\ & + & 2^{-99-\alpha_o} \\ & + & 2^{-99-\beta_o} \\ & + & 2^{-49-\alpha_o-\alpha_u} \\ & + & 2^{-49-\beta_o-\beta_u} \\ & + & 2^{-50-\alpha_o-\beta_o-\beta_u} \\ & + & 2^{-50-\alpha_o-\alpha_u-\beta_o} \\ & + & 2^{-101-\alpha_o-\beta_o} \\ & + & 2^{-52-\alpha_o-\alpha_u-\beta_o-\beta_u} \end{eqnarray*} The values returned $r_\mi$ and $r_\lo$ will not overlap at all and the overlap of $r_\hi$ and $r_\mi$ will be bounded as follows: $$\left \vert r_\mi \right \vert \leq 2^{-\gamma_o} \cdot \left \vert r_\hi \right \vert$$ with $$\gamma_o \geq \min\left( 48, \alpha_o-4, \beta_o-4,\alpha_o+\alpha_u-4,\beta_o+\beta_u-4,\alpha_o+\alpha_o-4 \right)$$ \end{theorem} \subsection{The multiplication procedure \MulDT} \begin{algorithm}[\MulDT] \label{mulDTref} ~ \\ {\bf In:} two double-double numbers $a_\hi + a_\lo$ and $b_\hi + b_\lo$ \\ {\bf Out:} a triple-double number $r_\hi + r_\mi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert a_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert a_\hi \right \vert \\ \left \vert b_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert b_\hi \right \vert \\ \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{50mm} $\left( r_\hi, t_1 \right) \gets \mMul\left( a_\hi, b_\hi \right)$ \\ $\left( t_2, t_3 \right) \gets \mMul\left( a_\hi, b_\lo \right)$ \\ $\left( t_4, t_5 \right) \gets \mMul\left( a_\lo, b_\hi \right)$ \\ $t_6 \gets a_\lo \otimes b_\lo$ \\ $\left( t_7, t_8 \right) \gets \mAddDD\left( t_2, t_3, t_4, t_5 \right)$ \\ $\left( t_9, t_{10} \right) \gets \mAdd\left( t_1, t_6 \right)$ \\ $\left( r_\mi, r_\lo \right) \gets \mAddDD\left( t_7, t_8, t_9, t_{10} \right)$ \\ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{mulDTref} \MulDT] ~ \\ Let be $a_\hi + a_\lo$ and $b_\hi + b_\lo$ the values taken by arguments of algorithm \ref{mulDTref} \MulDT \\ So the following holds for the values returned $r_\hi$, $r_\mi$ and $r_\lo$: $$r_\hi + r_\mi + r_\lo = \left(\left(a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded as follows: $$\left \vert \epsilon \right \vert \leq 2^{-149}$$ The values returned $r_\mi$ and $r_\lo$ will not overlap at all and the overlap of $r_\hi$ and $r_\mi$ will be bounded as follows: $$\left \vert r_\mi \right \vert \leq 2^{-48} \cdot \left \vert r_\hi \right \vert$$ \end{theorem} \subsection{The multiplication procedure \MulDTT} \begin{algorithm}[\MulDTT] \label{mulDTTref} ~ \\ {\bf In:} a double-double number $a_\hi + a_\lo$ and a triple-double number $b_\hi + b_\mi + b_\lo$ \\ {\bf Out:} a triple-double number $r_\hi + r_\mi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert a_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert a_\hi \right \vert \\ \left \vert b_\mi \right \vert & \leq & 2^{-\beta_o} \cdot \left \vert b_\hi \right \vert \\ \left \vert b_\lo \right \vert & \leq & 2^{-\beta_u} \cdot \left \vert b_\mi \right \vert \end{eqnarray*} with \begin{eqnarray*} \beta_o & \geq & 2 \\ \beta_u & \geq & 1 \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{60mm} $\left( r_\hi, t_1 \right) \gets \mMul\left( a_\hi, b_\hi \right)$ \\ $\left( t_2, t_3 \right) \gets \mMul\left( a_\hi, b_\mi \right)$ \\ $\left( t_4, t_5 \right) \gets \mMul\left( a_\hi, b_\lo \right)$ \\ $\left( t_6, t_7 \right) \gets \mMul\left( a_\lo, b_\hi \right)$ \\ $\left( t_8, t_9 \right) \gets \mMul\left( a_\lo, b_\mi \right)$ \\ $t_{10} \gets a_\lo \otimes b_\lo$ \\ $\left( t_{11}, t_{12} \right) \gets \mAddDD\left( t_2, t_3, t_4, t_5 \right)$ \\ $\left( t_{13}, t_{14} \right) \gets \mAddDD\left( t_6, t_7, t_8, t_9 \right)$ \\ $\left( t_{15}, t_{16} \right) \gets \mAddDD\left( t_{11}, t_{12}, t_{13}, t_{14} \right)$ \\ $\left( t_{17}, t_{18} \right) \gets \mAdd\left( t_1, t_{10} \right)$ \\ $\left( r_\mi, r_\lo \right) \gets \mAddDD\left( t_{17}, t_{18}, t_{15}, t_{16} \right)$ \\ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{mulDTTref} \MulDTT] ~ \\ Let be $a_\hi + a_\lo$ and $b_\hi + b_\mi + b_\lo$ the values in argument of algorithm \ref{mulDTTref} \MulDTT~ such that the given preconditions hold.\\ So the following will hold for the values $r_\hi$, $r_\mi$ and $r_\lo$ returned $$r_\hi + r_\mi + r_\lo = \left(\left(a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\mi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded as follows: $$\left \vert \epsilon \right \vert \leq \frac{2^{-99 - \beta_o} + 2^{-99 - \beta_o - \beta_u} + 2^{-152}} {1 - 2^{-53} - 2^{-\beta_o + 1} - 2^{-\beta_o - \beta_u + 1}} \leq 2^{-97 - \beta_o} + 2^{-97 - \beta_o - \beta_u} + 2^{-150}$$ The values $r_\mi$ and $r_\lo$ will not overlap at all and the following bound will be verified for the overlap of $r_\hi$ and $r_\mi$: $$\left \vert r_\mi \right \vert \leq 2^{-\gamma} \cdot \left \vert r_\hi \right \vert$$ where $$\gamma \geq \min\left( 48, \beta_o - 4, \beta_o + \beta_u - 4 \right)$$ \end{theorem} \subsection{The multiplication procedure \MuldTT} \begin{algorithm}[\MuldTT] \label{muldTTref} ~ \\ {\bf In:} a double number $a$ and a triple-double number $b_\hi + b_\mi + b_\lo$ \\ {\bf Out:} a triple-double number $r_\hi + r_\mi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert b_\mi \right \vert & \leq & 2^{-\beta_o} \cdot \left \vert b_\hi \right \vert \\ \left \vert b_\lo \right \vert & \leq & 2^{-\beta_u} \cdot \left \vert b_\mi \right \vert \end{eqnarray*} with \begin{eqnarray*} \beta_o & \geq & 2 \\ \beta_u & \geq & 2 \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{60mm} $\left( r_\hi, t_2 \right) \gets \mMul\left( a, b_\hi \right)$ \\ $\left( t_3, t_4 \right) \gets \mMul\left( a, b_\mi \right)$ \\ $t_5 \gets a \otimes b_\lo$ \\ $\left( t_9, t_7 \right) \gets \mAdd\left( t_2, t_3 \right)$ \\ $t_8 \gets t_4 \oplus t_5$ \\ $t_{10} \gets t_7 \oplus t_8$ \\ $\left( r_\mi, r_\lo \right) \gets \mAdd\left( t_9, t_{10} \right)$ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{muldTTref} \MuldTT] ~ \\ Let be $a$ and $b_\hi + b_\mi + b_\lo$ the values in argument of algorithm \ref{muldTTref} \MuldTT~ such that the given preconditions hold.\\ So the following will hold for the values $r_\hi$, $r_\mi$ and $r_\lo$ returned $$r_\hi + r_\mi + r_\lo = \left( a \cdot \left( b_\hi + b_\mi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded as follows: $$\left \vert \epsilon \right \vert \leq 2^{-101 - \beta_o} + 2^{-49 - \beta_o - \beta_u} + 2^{-156}$$ The values $r_\mi$ and $r_\lo$ will not overlap at all and the following bound will be verified for the overlap of $r_\hi$ and $r_\mi$: $$\left \vert r_\mi \right \vert \leq 2^{-\gamma} \cdot \left \vert r_\hi \right \vert$$ where $$\gamma \geq \min\left( 47, \beta_o - 5, \beta_o + \beta_u - 5 \right)$$ \end{theorem} \subsection{The multiplication procedure \MuldDT} \begin{algorithm}[\MuldDT] \label{muldDTref} ~ \\ {\bf In:} a double number $a$ and a double-double number $b_\hi + b_\lo$ \\ {\bf Out:} a triple-double number $r_\hi + r_\mi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert b_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert b_\hi \right \vert \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{60mm} $\left( r_\hi, t_1 \right) \gets \mMul\left( a, b_\hi \right)$ \\ $\left( t_2, t_3 \right) \gets \mMul\left( a, b_\lo \right)$ \\ $\left( t_5, t_4 \right) \gets \mAdd\left( t_1, t_2 \right)$ \\ $t_6 \gets t_3 \otimes t_4$ \\ $\left( r_\mi, r_\lo \right) \gets \mAdd\left( t_5, t_6 \right)$ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{muldDTref} \MuldDT] ~ \\ Let be $a$ and $b_\hi + b_\lo$ the values in argument of algorithm \ref{muldDTref} \MuldDT~ such that the given preconditions hold.\\ So the following will hold for the values $r_\hi$, $r_\mi$ and $r_\lo$ returned $$r_\hi + r_\mi + r_\lo = \left( a \cdot \left( b_\hi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded as follows: $$\left \vert \epsilon \right \vert \leq 2^{-154}$$ The values $r_\mi$ and $r_\lo$ will not overlap at all and the following bound will be verified for the overlap of $r_\hi$ and $r_\mi$: $$\left \vert r_\mi \right \vert \leq 2^{-\gamma} \cdot \left \vert r_\hi \right \vert$$ where $$\gamma \geq 47$$ \end{theorem} \subsection{Final rounding to the nearest even} \begin{algorithm}[Final rounding to the nearest (even)] \label{algarrpres} ~ \\ {\bf In:} a triple-double number $x_\hi + x_\mi + x_\lo$ \\ {\bf Out:} a double precision number $x^\prime$ returned by the algorithm \\ {\bf Preconditions on the arguments:} \begin{itemize} \item $x_\hi$ and $x_\mi$ as well as $x_\mi$ and $x_\lo$ do not overlap \item $x_\mi = \circ \left( x_\mi + x_\lo \right)$ \item $x_\hi \not = 0$, $x_\mi \not = 0$ and $x_\lo \not = 0$ \item $\circ \left( x_\hi + x_\mi \right) \not \in \left \lbrace x_\hi^-, x_\hi, x_\hi^+ \right \rbrace \Rightarrow \left \vert \left( x_\hi + x_\mi \right) - \circ\left( x_\hi + x_\mi \right) \right \vert \not = \frac{1}{2} \cdot \mUlp\left( \circ \left( x_\hi + x_\mi \right) \right)$ \end{itemize} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{80mm} $t_1 \gets x_\hi^-$ \\ $t_2 \gets x_\hi \ominus t_1$ \\ $t_3 \gets t_2 \otimes \frac{1}{2}$ \\ $t_4 \gets x_\hi^+$ \\ $t_5 \gets t_4 \ominus x_\hi$ \\ $t_6 \gets t_5 \otimes \frac{1}{2}$ \\ ~ \\ {\bf if} $\left( x_\mi \not = -t_3 \right)$ {\bf and} $\left( x_\mi \not = t_6 \right)$ {\bf then} \vspace{-2.4mm} \begin{center} \begin{minipage}[b]{70mm} \vspace{-2.4mm} {\bf return } $\left( x_\hi \oplus x_\mi \right)$ \end{minipage} \end{center} \vspace{-2.4mm} {\bf else} \vspace{-2.4mm} \begin{center} \begin{minipage}[b]{70mm} {\bf if} $\left( x_\mi \otimes x_\lo > 0.0 \right)$ {\bf then} \vspace{-2.4mm} \begin{center} \begin{minipage}[b]{60mm} {\bf if} $\left( x_\hi \otimes x_\lo > 0.0 \right)$ {\bf then} \vspace{-2.4mm} \begin{center} \begin{minipage}[b]{50mm} \vspace{-2.4mm} {\bf return } $x_\hi^+ $ \end{minipage} \end{center} \vspace{-2.4mm} {\bf else} \vspace{-2.4mm} \begin{center} \begin{minipage}[b]{50mm} \vspace{-2.4mm} {\bf return } $x_\hi^- $ \end{minipage} \end{center} \vspace{-2.4mm} {\bf end if} \end{minipage} \end{center} \vspace{-2.4mm} {\bf else} \vspace{-2.4mm} \begin{center} \begin{minipage}[b]{60mm} \vspace{-2.4mm} {\bf return } $x_\hi $ \end{minipage} \end{center} \vspace{-2.4mm} {\bf end if} \end{minipage} \end{center} \vspace{-2.4mm} {\bf end if} \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Correctness of the final rounding procedure \ref{algarrpres}]\label{corralgpluspres} ~\\ Let be {\bf A} the algorithm \ref{algarrpres} said `` Final rounding to the nearest (even)''. Let be $x_\hi + x_\mi + x_\lo$ triple-double number for which the preconditions of algorithm {\bf A} hold. Let us notate $x^\prime$ the double precision number returned by the procedure. \\ So $$x^\prime = \circ \left( x_\hi + x_\mi + x_\lo \right)$$ i.e. {\bf A} is a correct rounding procedure for round-to-nearest-ties-to-even mode. \end{theorem} \subsection{Final rounding for the directed modes} \begin{theorem}[Directed final rounding of a triple-double number] \label{arrdir} ~ \\ Let be $x_\hi + x_\mi + x_\lo \in \F + \F + \F$ a non-overlapping triple-double number. \\ Let be $\diamond$ a directed rounding mode.\\ Let be {\bf A} the following instruction sequence: \begin{center} \begin{minipage}[b]{50mm} $\left( t_1, t_2 \right) \gets \mAdd\left( x_\hi, x_\mi \right)$ \\ $t_3 \gets t_2 \oplus x_\lo$ \\ {\bf return } $\diamond\left( t_1 + t_3 \right)$ \end{minipage} \end{center} So {\bf A} is a correct rounding procedure for the rounding mode $\diamond$. \end{theorem} \section{Horner polynomial approximations \label{sec:Horner}} Most function evaluation schemes include some kind of polynomial evaluation over a small interval. Classically, we use the Horner scheme, which is the best suited in this case. For a polynomial of degree $d$, noting $c_i$ its coefficients, the Horner scheme consists in computing $S_0$ using the following recursion: $$ \left\{ \begin{array}{rl} S_d(x) &\ = \ c_d\\ S_k(x) &\ =\ c_k+xS_{k+1}(x) \quad \mathrm{for}\quad 0\le k \maxeps y$. By definition of the \ulp\ of a positive normal number, we have $y_h \in [2^{52}u, (2^{53}-1)u]$. \end{minipage} & \begin{minipage}[t]{7.5cm} To prove that $y_h = \round(y)$, it is enough to prove that $|y_h-y|\le u/4$. As $y_l\le 0$, we have $y\le y_h$ and $|y_h-y| = y-y_h$. From fourth hypothesis, it is enough to prove that $u/4 + y_l > \maxeps y$. By our definition of the \ulp\ of a normal number, we have $y_h = 2^{52}u$ in this case. \end{minipage} \end{tabular}\\ \begin{tabular}{c||c} \begin{minipage}[t]{7.5cm} From the first hypothesis we have \begin{equation} y_l\le\frac{1}{2}u \label{eq:prooftest1} \end{equation} Therefore $y_h+y_l \le (2^{53}-1)u + \frac{1}{2}u$, and\\ $y < (y_h+y_l)/(1-\maxeps)$. Hence \\ $y <\ \dfrac{2^{53}-\frac{1}{2}}{1-\maxeps} u$ As a consequence, since $\maxeps \le 2^{-56}$, \begin{equation} y < 2^{53} u \label{eq:prooftest3} \end{equation} \end{minipage} & \begin{minipage}[t]{7.5cm} We have $y_h = 2^{52}u$ and $y_l\le 0$, therefore\\ $y_h+y_l \le 2^{52}u$, and \begin{equation} y < \frac{2^{52}u}{1-\maxeps} \label{eq:prooftest3p2} \end{equation} \end{minipage} \end{tabular}\\ \begin{tabular}{c||c} \begin{minipage}[t]{7.5cm} The easy case is when we have $y_h = \round(y)$ regardless of the result of the test. This is true as soon as $y_l$ is sufficiently distant from $u/2$. More specifically, if $0 \le y_l < \left(\frac{1}{2} - 2^{-k}\right)u$, we combine (\ref{eq:prooftest3}) with the fifth hypothesis to get $\maxeps y < 2^{-k}u$. From $y_l < \left(\frac{1}{2} - 2^{-k}\right)u$ we deduce\\ $u/2 -y_l > 2^{-k}u > \maxeps y$, which proves that $y_h=\round(y)$. \end{minipage} & \begin{minipage}[t]{7.5cm} The easy case is when we have $y_h = \round(y)$ regardless of the result of the test. This is true as soon as $y_l$ is sufficiently distant from $-u/4$. More specifically, if $ - \left(\frac{1}{4} - \frac{2^{-k-1}}{1-\maxeps}\right)u < y_l \le 0 $, after combining (\ref{eq:prooftest3p2}) with the fifth hypothesis to get $\maxeps y < \frac{2^{-k-1} u}{1-\maxeps}$, we deduce\\ $y_l + \frac{u}{4}> \frac{2^{-k-1}}{1-\maxeps}u > \maxeps y$, which proves that $y_h=\round(y)$. \end{minipage} \end{tabular}\\ \begin{tabular}{c||c} \begin{minipage}[t]{7.5cm} Now consider the case when $y_l \ge \left(\frac{1}{2} - 2^{-k}\right)u$. The condition $|y_h|\ge 2^{-1022+54}$ ensures that $u/4$ is a normal number, and now $y_l > u/4$, so in this case $y_l$ is a normal number. As $1 u/8$, so in this case $y_l$ is a normal number. As $1 __eps__ * u53.d){ \ if(!yl_neg) { /* The case yl==0 is filtered by the above test*/ \ /* return next up */ \ yh.d = __yh__; \ if(yh_neg) yh.l--; else yh.l++; /* Beware: Fails for zero */ \ return yh.d ; \ } \ else return __yh__; \ } \ } \end{lstlisting} \end{theorem} \begin{proof} The first lines compute $|y_h|$, $|y_l|$, boolean values holding the sign information of $y_h$ and $y_l$, and $u_{53}=2^{53}\ulp(y_h)$. Here we use integer 64-bit arithmetic for readability, but other implementations may be more efficient on some systems. Note that these computations don't work for infinities, zeroes or subnormals. As previously, by definition of the \ulp, we have $y<2^{53}u$. The main test which determines whether correct rounding is possible is line 10. If this test is true, then $y_l>(2^{53}u)\otimes\maxeps = 2^{53}\maxeps u $ (the multiplication by $u_{53}$, a power of two, is exact), hence $y_l>\maxeps y$ so we are in an easy case for directed rounding. The remaining computations and tests (lines 11 and following) compute \texttt{nextafter(yh,inf)} in an efficient way since an integer representation of $y_h$ is already available. For the other directed rounding modes, only these lines change in a straightforward way. \end{proof} \paragraph*{Notes} \begin{itemize} \item Rounding down and to zero are identical to the previous, except for the computation of the rounded value itself. \item These tests launch the accurate phase when yl=0, in particular in the exceptional cases when the image of a double is a double. See the chapter \ref{chap:log} % (page \pageref{pageref:log_of_one}) % TODO: still true? for an example where it may introduce a misround. \item These tests don't work if $y_h$ is a subnormal. If one cannot prove statically that this case doesn't appear, a sensible solution is to test for subnormals and launch the accurate phase. \item Finally, remark that for some functions, the tests on the sign of $y_h$ are statically predictable to be true because the function is always positive. We shall use this macro anyway for safety. Tanks to branch predictor logic in modern processors, it will make little difference from a performance point of view. \end{itemize} \section{The Software Carry Save library \label{sec:SCSLib}} The software carry-save internal representation of multiple-precision numbers was designed specifically for simple and fast implementations of addition and multiplication in the 100-500 bit precision range, as required by the \accurate\ phase of our algorithms. More details on software carry-save are available in \cite{DefDin2002,DinDef2003}. The parameters of \scslib\ are set up so that all the operators offer a relative error better than $2^{-208}$. This is a large overkill for all the functions in \crlibm, as the worst cases computed by Lefevre never require more than 158 bits of accuracy. This enables simple proofs for the second steps, assuming the operators in \scslib\ are correct. Another feature that makes accuracy proofs simple when using \scslib\ is the following: The range of SCS numbers includes the range of IEEE double-precision numbers, including subnormals and exceptional cases. Conversions between SCS format and IEEE-754 doubles, as well as arithmetic operations, follow the IEEE rules concerning the exceptional cases. SCS doesn't ensure correct rounding, but provides conversions to doubles in the four IEEE-754 rounding modes, which is enough for the purpose of \crlibm. However, a formal proof of correctness of the \scslib\ operators remains to be done. Currently there is nothing more than good confidence based on the simplicity of the code. \subsection{The SCS format} A MP number is represented in the proposed format as a \emph{Software Carry Save} (SCS) structure $R$, depicted on Figure~\ref{fig:scsrepresentation} and composed of the following fields: \begin{description} \item[\emph{R.digits[$n_r$]}] A table of $n_r$ digits with $m_r$ bits of precision. These digits can in principle be either integer or FP machine numbers, however integer is always faster and simpler. We will not mention FP digits anymore here, the interested reader is referred to \cite{DefDin2002,DinDef2003}. \item[\emph{R.index}] An integer storing the index of the first digit in the range of representable numbers, as depicted on Figure~\ref{fig:scsrepresentation}; \item[\emph{R.sign}] A sign information. \end{description} \begin{figure}[h] \begin{center} \includegraphics[width=0.7\textwidth]{fig_scs/exponent_representation} % image file name \caption{The proposed format \label{fig:scsrepresentation}} \end{center} \end{figure} In other words, the value $x$ of a representation $R$ is: \begin{equation} \label{eqn4} x = R.sign \times \sum_{j=1}^{n_r} R.digits[j] \times 2^{m_r * (R.index - j)} \end{equation} In such a \emph{normal} SCS number $R$, the bits from $m_I$ to $m_r$ of the $R.digits$ fields are thus set to zero. They will be exploited by the algorithms to store temporary \emph{carry} information, and are therefore called \emph{carry-save} bits. An SCS number where these bits are non-zero is said to be non-normal. The values of the parameters for use in \crlibm\ is $n_r=8$ digits of $m_i=30$ bits stored on $m_r=32$-bit words. The worst-case precision that this format may hold is when the most significant digit is equal to $1$, meaning that an SCS numbers holds only $1+7\times 30=211$ significant digits. \subsection{Arithmetic operations\label{sec:ops}} \subsubsection{Conversion from double to SCS} A first method for converting a double precision floating point number $d$ into an SCS representation is to extract the exponent $d_{exp}$ from $d$, and then determine the corresponding $R.index$ as the integer part of $\frac{d_{exp}}{2^{m_r}}$. Another method uses a variable number of multiplications by $2^{m_r}$ or $2^{-m_r}$. This method is faster than the previous one when the exponent of $d$ is close to $0$. After testing both methods in \crlibm, the first method was preferred. \subsubsection{Addition and subtraction} The addition of two SCS numbers of the same sign consists in aligning, then adding digits of the same order. Thanks to the carry-save bits, all these additions will be \emph{exact} and \emph{independent}. However the result will usually not be a normal SCS number: the sums will have overflown in the carry-save bits. A \emph{renormalization} procedure is presented in section \ref{renorm} to propagate these carry bits and get again a normal SCS number. However, the advantage of SCS representation is that many SCS numbers can be summed before needing to perform this expensive step (up to 7 with the choice of parameters made in \crlibm). The subtraction (addition of two numbers of opposite signs) is very similar to the addition algorithm. It may also classically lead to a cancellation, which may need an update of the index of the result. However, as in other floating-point formats, a subtraction involving a a cancellation is exact. Although all the digit operations are exact, the addition or subtraction of two numbers also classically involves a rounding error, due to aligning the digits of same magnitude. For performance reason this rounding is a truncation, so the worst-case relative error is one ulp of the least accurate representable number, or $2^{-211}$. %---------------- % MULTIPLICATION %---------------- \subsubsection{Multiplication} The multiplication of two normal SCS numbers involves the operations depicted on the Figure \ref{fig:scsmultiplication}: The partial products are computed (in parallel) and summed in columns. The parameters are set up so that none of these operation overflow. Again, the result is not a normal SCS number, and a renormalization procedure (described below) has to be applied to empty the carry bits. However, a few additions may follow a multiplication before this renormalization, which allows for further optimization of algorithms using SCS arithmetic. For instance, a polynomial evaluation can be implemented with a renormalization after one multiplication and one addition. \begin{figure}[h] \begin{center} \includegraphics[width=0.7\textwidth]{fig_scs/multiplication} \caption{SCS multiplication \label{fig:scsmultiplication}} \end{center} \end{figure} Here also, a rounding error is involved when two $n_r$-digit numbers are multiplied if the result is to fit on $n_r$ digits. The actual implementation tests if the most significant digit ($z_1$ on Figure~\ref{fig:scsmultiplication}) is null, in which case the index of the result is that of $z_2$. If the whole of the computations of Figure~\ref{fig:scsmultiplication} are implemented, the worst case for relative accuracy is again $2^{-211}$. However a further optimization is to avoid computing the columns of lower magnitude, at the expense of an increase in the rounding error. More specifically, we compute 9 columns instead of 16. The wors case is now when $z_1$ is null, in which case the relative error correspond to the truncation of the 8 leftmost columns, whose maximum value is smaller than 3 ulps of the SCS result. Therefore the relative error of the multiplication is bounded by $2^{-208}$ with this optimization, which is still a large overkill for the purpose of \crlibm. This optimization is therefore implemented if the loop are hand-unrolled. If they are not, the increased control complexity actually degrades performance. \subsubsection{Renormalization (carry propagation) \label{renorm}} Renormalization is a carry propagation from the low order to high order digits: Starting with an initially null carry, at each step, the previous carry is added to the current digit, and this sum is then split into two parts using masks. The low $m_r$ bits are a digit of the normalized result, and the upper part is the next carry. The actual algorithm is a little bit more complex. The initial non-normal number may not be representable exactly as a normal SCS number, therefore the index of the normalized result may have to be increased by one or two. Normalization thus again involves a rounding error. Note that this error was already taken into account in the previous discussions of addition and multiplication. %----------------- % CONVERSION BACK %----------------- \subsubsection{Conversion from SCS to floating-point} A few (4 in the worst case) multiplications and additions suffice to get the FP number closest to a SCS number. For instance, for $m_I=53$ and $m_r=26$, we need to compute $d = A.sign \times 2^{A.index \times m_r} \times ( A.digits[0]+ 2^{-m_r} \times A.digits[1]+ 2^{-2.m_r} \times A.digits[2]+ 2^{-3.m_r} \times A.digits[3])$. The number $2^{A.index \times m_r}$ is build using integer masks. The actual implementation of this formula is slightly less simple, but this conversion is still very fast. \subsubsection{Mixed 32- and 64-bit arithmetics} An improvement implemented in \scslib\ was the combined use of integer 32- and 64-bit arithmetics as follows: \begin{itemize} \item MP digits are stored as 32-bit numbers where only a few bits are reserved for carries. This removes the main problem of the initial implementation \cite{DefDin2002}, namely its memory inefficiency. \item Addition uses 32-bit arithmetic. \item In the MP multiplication, the partial products are products of two 32-bit digits, which are 64-bit numbers. The column sums need thus to be computed using 64-bit arithmetic. This can be expressed in the C language in a non-ISO-C99, but de-facto standard way, as follows: 32-bit numbers have the \texttt{unsigned int} type; 64-bit numbers have the \texttt{unsigned long long int} type. When multiplying two digits, one is first cast into this 64-bit type. For UltraSPARC architectures (detected at build time) the conversion is to floating-point, but we will not detail this peculiarity further. \end{itemize} This works well because all modern processors either have 64-bit integer units, or offer instructions which store the 64-bit product of two 32-bit integers into two 32-bit registers. The compiler does the rest well, because it is conceptually simple: casting unsigned 32-bit into unsigned 64-bit is trivial; 64-bit addition is translated straightforwardly into one 32-bit \emph{add} followed by one 32-bit \emph{add-with carry}. \subsubsection{Implementation considerations} For portability purposes, the implemention uses C as defined by the ISO C99 standard, and tries to use a recent version of \texttt{gcc}. We could not exhibit a case where a native compiler from the processor vendor (Intel or Sun) gave significantly better results than \texttt{gcc}, which is probably a consequence of the simplicity of our code. However, when tuning for performance, we observed that the same code which was efficient on one processor could lead to very poor results on another. Usually, this difference can be traced down to the capabilities of the processor itself. The typical example is the knowingly poor integer multiplication on UltraSPARC II. Sometimes however, the processor should be able to perform well, and it is the processor-specific backend of the compiler which is to blame, which can be checked by observing the assembly code produced. A typical example is the casting of 32-bits digits to 64-bit arithmetic (or to an FP number in the case of the UltraSPARC) in the multiplication algorithm. In these cases we tried to change the programming style in a way that works well on all processors. Sometimes it wasn't possible, in which case the code contains, along with a generic version, several processor-specific tricky versions of the problematic operation, selected at compile time thanks to the GNU \texttt{automake/autoconf} tools. More surprisingly, we were disappointed by the higher-level capabilities of the compilers, especially at unrolling loops. Our code exhibits many small \texttt{for} loops whose size is known at compile-time (usually $n$). This is the ideal situation for loop unrolling, a technique well known and described in most textbooks on compiler design. Options exist in most compilers to turn on this optimisation. Unfortunately, leaving loop unrolling to the compiler gives very poor results, even when compared to the non-unrolled case. Since unrolling the loops by hand in the C code takes a few minutes, we did it for the version of the library which we use ($m=30$, $n=8$). It marginally increases the code sizes for this small $n$, and sometimes provides a twofold improvement on speed, depending of the processor. Of course, this is not satisfactory: We don't want to do it for all values of $n$, nor do we want to study for each processor the tradeoffs involved as $n$ increase. We expect however future compilers to handle unrolling better, and we were surprised that no compiler had a clear edge on the other in this respect. Some argue, however, that this issue is pointless, as superscalarity, along with register renaming and branch prediction inside modern processors, sum up to the equivalent of dynamic unrolling of the code. In our tests (in 2003), it doesn't: unrolling does bring a speed-up. \section{Common Maple procedures \label{section:commonMaple}} \subsection{Conversions} Procedure \texttt{ieeedouble} returns the sign, the exponent and the mantissa of the IEEE-754 double-precision number closest to input value \texttt{x}. \begin{lstlisting}[caption={ieeedouble},firstnumber=1] ieeedouble:=proc(xx) local x, sgn, logabsx, exponent, mantissa, infmantissa,powermin,powermax,expmin,expmax,expmiddle,powermiddle; Digits := 100; x := evalf(xx); if (x=0) then sgn, exponent, mantissa := 1, -1022, 0 else if (x < 0) then sgn := -1 else sgn := 1 fi: x := abs(x); if x >= 2^(1023)*(2-2^(-53)) then mantissa := infinity; exponent := 1023 else if x <= 2^(-1075) then mantissa := 0; exponent := -1022 else if x <= 2^(-1022) then exponent := -1022 else # x is between 2^(-1022) and 2^(1024) powermin := 2^(-1022); expmin := -1022; powermax := 2^1024; expmax := 1024; while (expmax-expmin > 1) do expmiddle := round((expmax+expmin)/2); powermiddle := 2^expmiddle; if x >= powermiddle then powermin := powermiddle; expmin := expmiddle else powermax := powermiddle; expmax := expmiddle fi od; # now, expmax - expmin = 1 and powermin <= x < powermax, # powermin = 2^expmin and powermax = 2^expmax, so expmin is the exponent of x exponent := expmin; fi; infmantissa := x*2^(52-exponent); if frac(infmantissa) <> 0.5 then mantissa := round(infmantissa) else mantissa := floor(infmantissa); if type(mantissa,odd) then mantissa := mantissa+1 fi fi; mantissa := mantissa*2^(-52); fi; fi; fi; sgn,exponent,mantissa; end: \end{lstlisting} Procedure \texttt{ieeehexa} returns the hexadecimal representation of the nearest double to its input \texttt{x}. \begin{lstlisting}[caption={ieeehexa},firstnumber=1] ieeehexa:= proc(x) local hex2, xx, longint, expo, sgn, frac, resultat; if(x=0) then resultat:=["00000000","00000000"]; elif(x=-0) then resultat:=["80000000","00000000"]; # nice try else xx:=ieeedouble(x); sgn:=xx[1]: expo:=xx[2]: frac:=xx[3]: if (expo = -1023) then longint := (frac)*2^51 ; # subnormal else longint := (frac-1)*2^52 + (expo+1023)*2^52; fi: if (sgn=-1) then longint := longint + 2^63; fi: longint := longint + 2^64: # to get all the hexadecimal digits when we'll convert to string hex2:=convert(longint, hex); hex2:=convert(hex2, string): resultat:=[substring(hex2,2..9), substring(hex2,10..18)]: fi: resultat; end proc: \end{lstlisting} Procedure \texttt{hexa2ieee} performs the reciprocal conversion. Procedure \texttt{hi\_lo} returns two IEEE-double numbers $x\_hi$ and $x\_lo$ so that $x = x\_hi + x\_lo + \epsilon_{-103}$. \begin{lstlisting}[caption={hi\_lo},firstnumber=1] hi_lo:= proc(x) local x_hi, x_lo, res: x_hi:= nearest(evalf(x)): res:=x-x_hi: if (res = 0) then x_lo:=0: else x_lo:=nearest(evalf(res)): end if; x_hi,x_lo; end: \end{lstlisting} \vspace{0.5cm} Procedure \texttt{showHowDifficultToRound} takes a real number, and prints the bits after the 53th of its nearest IEEE floating-point number. \begin{lstlisting}[caption={showHowDifficultToRound},firstnumber=1] showHowDifficultToRound:=proc(x) local xb,xs,s,e,m: Digits:=200: s,e,m := ieeedouble(x): xb:=convert(evalf(x*2^(-e)),binary): xs:=convert(xb, string): substring(xs,55..153) end proc: \end{lstlisting} \subsection{Procedures for polynomial approximation} Procedure \texttt{Poly\_exact2} takes in arguments a polynomial \texttt{P} and a integer \texttt{n}. It returns a truncated polynomial, of which coefficients are exactly IEEE-double numbers. The \texttt{n} first coefficients are written over 2 IEEE-double numbers. \begin{lstlisting}[caption={poly\_exact2},firstnumber=1] poly_exact2:=proc(P,n) local deg,i, coef, coef_hi, coef_lo, Q: Q:= 0: convert(Q, polynom): deg:=degree(P,x): for i from 0 to deg do coef :=coeff(P,x,i): coef_hi, coef_lo:=hi_lo(coef): Q:= Q + coef_hi*x^i: if(i0) then p:=100: else p:=53: fi: if coeff(poly,x, 0) = 0 then deltap, Smin, Smax := compute_abs_rounding_error(poly/x,xmax, n-1): rho := (2^(-p)*(Smax+deltap) +deltap ) / Smin : else deltap, Smin, Smax := compute_abs_rounding_error(poly,xmax, n): rho := deltap / Smin: fi: rho; end proc: \end{lstlisting} \vspace{0.5cm} Procedures \texttt{compute\_abs\_rounding\_error\_firstmult} and \texttt{compute\_abs\_rounding\_error\_firstmult} are similar to the previous, but in the case when the first double-double operation is a multiplication. \subsection{Rounding} Procedure \texttt{compute\_rn\_constant} computes a good constant for the round-to-nearest test of Theorem~\ref{th:roundingRN1}. Its input is a bound of the overall relative error of the approximation scheme. \subsection{Using double-extended} The file \texttt{maple/double-extended.mpl} contains procedures similar to those previously described to handle double-extended precision (64 bits of mantissa and 15 bits of exponent). This is currently used in experimental code only: The \crlibm\ CVS repository at \url{http://lipforge.ens-lyon.fr/} contains such code for exponential and arctangent on Itanium, and arctangent on IA32 processors. For more details see \cite{DinDefLau2004LIP,DinErshGast2005}. %%% Local Variables: %%% mode: latex %%% TeX-master: "crlibm" %%% End: interval-2.1.0/src/crlibm/docs/latex/acos.tex0000644000000000000000000000033513031036767017246 0ustar 00000000000000TODO. This function was completely rewritten using machine-generated polynomials. Gappa proofs were automatically generated, too, and are available in the \texttt{gappa/asin} directory. This chapter will be updated soon. interval-2.1.0/src/crlibm/docs/latex/asin.tex0000644000000000000000000013006213031036767017254 0ustar 00000000000000This chapter is contributed by Ch. Q. Lauter. WARNING: This chapter is out-of-sync with the code. The function was completely rewritten using machine-generated polynomials. Gappa proofs were automatically generated, too, and are available in the \texttt{gappa/asin} directory. This chapter will be updated soon. \section{Overview of the algorithm\label{sec:asin-overview}} The arcsine $\arcsin\left( x \right) = \sum\limits_{i=0}^{\infty} \frac{\left( 2i - 1 \right)!!}{\left(2i+1\right) \cdot \left( 2i \right)!!} \cdot x^{2i+1}$ is defined on the domain $x \in \left[ -1; 1 \right]$. It is a odd function: $\arcsin\left(-x\right) = -\arcsin\left( x \right)$. Its value in $0$ is $\arcsin\left( 0 \right) = 0$. Its derivative tends to infinity when $x$ tends to $1$: $\lim\limits_{x \rightarrow 1} \left( \frac{d}{dx} \arcsin \right)\left(x\right) = \infty$; the function's value in $1$ is nevertheless finite: $\arcsin\left( 1 \right) = \frac{\pi}{2}$. There is no simple additive or multiplicative decomposition of this function. A correctly rounded implementation of $\arcsin$ must provide an accuracy of at least $126$ bits for $\left \vert x \right \vert \leq 2^{-18}$ and of at least $118$ bits for the rest of the definition domain in the accurate phase \cite{DinDefLau2004LIP}. The algorithm chosen principally consists of a piecewise polynomial approximation either of the function itself or of a asymptotic development of the function. More precisely, the following is done: \begin{itemize} \item Special cases, such as $\left \vert x \right \vert > 1$, $x = \pm \infty$, $x = \nan$, are handled. \item The sign of the argument $x$ is stripped off because $\arcsin\left(x\right) = \sgn\left(x\right) \cdot \arcsin\left( \left \vert x \right \vert \right)$. We will suppose in the following, that $x$ stands for a positive argument, $x \geq 0$. \item The argument is classified in one of $10$ subdomains of $\left[ 0; 1 \right]$. This means an integer $i \in \left[0\dots9\right]$ is computed such that $x \in I_i$ where $$\bigcup\limits_{i=0}^9 I_i = \left[0; 1 \right]$$ $$i \not= j \Rightarrow I_i \cap I_j = \emptyset$$ $$i < j \Rightarrow \forall x_i \in I_i, x_j \in I_j \mbox{ . } x_i < x_j$$ \item If $i = 0$, $\arcsin$ is directly approximated as $$\arcsin\left( x \right) \approx x + x^3 \cdot p_0\left( x^2 \right)$$ \item If $1 \leq i \leq 8$, an interval midpoint value $m_i \approx \frac{\inf I_i + \sup I_i}{2}$ is read in a table. The function is then approximated as $$\arcsin\left( x \right) \approx \arcsin\left( m_i \right) + \left(x - m_i \right) \cdot p_i\left( x - m_i \right)$$ \item If $i = 9$, $\arcsin$ is approximated as $$\arcsin\left( x \right) \approx p_9\left( 1 - x \right) \cdot \sqrt{2 - 2\cdot x} + \frac{\pi}{2}$$ \end{itemize} The polynomials $p_i$, $1 \leq i \leq 8$, for the middle intervals are all of the same degree and, loaded from a table, can be evaluated in the same computation path. The polynomials $p_0$ and $p_9$ are of different degree. So there are three distinct paths in the code. In the following, they are referred to as the low, middle and high path. Concerning the quick and accurate phase of the implementation, it must mentioned that code and cache size considerations do not allow for using different coefficient tables for the quick phase polynomials $p_{i\mbox{\tiny ~quick}}$ as for the accurate phase polynomials $p_{i\mbox{\tiny ~accurate}}$ that are obviously longer and must contain more accurately stored coefficients. So the quick phase polynomials are simply the accurate phase polynomials truncated to some degree and simplified by omitting low significance components of the coefficients. The double precision midpoint values $m_i \in \F$ for the middle path intervals $I_i$, $1 \leq i \leq 8$, are chosen such that a double-double approximation $asinm_{i\hi} + asinm_{i\lo}$ of $\arcsin\left( m_i \right)$ is accurate to at least $121$ bits. This allows for saving up memory in the tables used. The intervals $I_i$ are not uniformly distributed. This has the disadvantage that the computation of $i$ cannot be done by simple bitmasks on the arcsine's argument $x$ but that a dichotomy must be performed. On the other hand, this is the only way of using polynomials for the same degree for all middle intervals without wasting accuracy for the lower ones. In fact, the derivative of $\arcsin$ grows over-polynomially, which means that the polynomial degrees must increase for equally sized reduced arguments in order to achieve the same approximation error. The decomposition of the domain $\left[0;1\right]$ into the $I_i$s is relatively ad-hoc. The given implementation uses: $$I_i = \left[bound_i;bound_{i+1}\right]$$ with \begin{eqnarray*} bound_0 & = & 0 \\ bound_1 & = & 0.184999942779541015625 \\ bound_2 & = & 0.2997171878814697265625 \\ bound_3 & = & 0.40296268463134765625 \\ bound_4 & = & 0.4932067394256591796875 \\ bound_5 & = & 0.5696849822998046875 \\ bound_6 & = & 0.639662265777587890625 \\ bound_7 & = & 0.696256160736083984375 \\ bound_8 & = & 0.741760730743408203125 \\ bound_9 & = & 0.77999973297119140625 \\ bound_{10} & = & 1 \end{eqnarray*} One remarks that in order to simplify the dichotomy for computing $i$, the bounds of the intervals are chosen all such that the low order word of the double precision numbers they are stored in are $0$. See \ref{sec:asinargred}, page \pageref{sec:asinargred} for more precise considerations on that subject. Let be $$z_i = \left \lbrace \begin{array}{ll} x & \mbox{ if } i = 0 \\ x - m_i & \mbox{ if } 1 \leq i \leq 8 \\ 1 - x & \mbox{ if } i = 9 \end{array} \right.$$ This value $z_i$ is the argument to the polynomial $p_i$. With the given interval bounds, it is bounded by $$\left \vert z_1 \right \vert \leq 2^{-2.434403}$$ $$\left \vert z_2 \right \vert \leq 2^{-4.123846}$$ $$\left \vert z_3 \right \vert \leq 2^{-4.275849}$$ $$\left \vert z_4 \right \vert \leq 2^{-4.470024}$$ $$\left \vert z_5 \right \vert \leq 2^{-4.708807}$$ $$\left \vert z_6 \right \vert \leq 2^{-4.836970}$$ $$\left \vert z_7 \right \vert \leq 2^{-5.143210}$$ $$\left \vert z_8 \right \vert \leq 2^{-5.457845}$$ $$\left \vert z_9 \right \vert \leq 2^{-5.708811}$$ $$\left \vert z_{10} \right \vert \leq 2^{-2.184423}$$ The degrees of the polynomials $p_i$ and the number of double (D), double-double (DD) and triple-double (TD) coefficients stored in the table are listed below. Here the degree of the polynomial is the highest exponent of the monomial whose coefficient is not equal to $0$. We repeat that the $p_i$ are such that $$\arcsin\left( x \right) \approx x + x^3 \cdot p_0\left( x^2 \right)$$ $$\arcsin\left( x \right) \approx \arcsin\left( m_i \right) + \left(x - m_i \right) \cdot p_i\left( x - m_i \right), \mbox{~~} 1 \leq i \leq 8$$ $$\arcsin\left( x \right) \approx p_9\left( 1 - x \right) \cdot \sqrt{2 - 2\cdot x} + \frac{\pi}{2}$$ \begin{center} \begin{tabular}{|l|l|l|l|l|l|l|l|} \hline $i$ & quick phase & accurate phase & D quick & DD quick & D accur. & DD accur. & TD accur. \\ \hline \hline $0$ & 8 & 17 & 5 & 4 & 7 & 6 & 5 \\ \hline $1\dots8$ & 13 & 34 & 8 & 6 & 20 & 9 & 6 \\ \hline $9$ & 18 & 28 & 10 & 8 & 12 & 9 & 8 \\ \hline \end{tabular} \end{center} Remark that the listing does not account neither for the $8$ double-double values representing approximations to $\arcsin\left( m_i \right)$ nor for the $8$ double precision numbers $m_i$. Taking into account also these values, the overall table size for both quick and accurate phase is 4640 bytes. Some additional values, for example the triple-double $PiHalf_\hi + PiHalf_\mi + PiHalf_\lo \approx \frac{\pi}{2}$, interval bounds or table indices, are directly compiled into the code. Their overall size is 100 bytes. \section{Special case handling, interval discrimination and argument reduction}\label{sec:asinargred} As already mentioned, $\arcsin$ is only defined on the domain $\left[ -1; 1 \right]$. For other arguments, including $\pm \infty$ and $\nan$, $\nan$ must be returned. This is implemented in the code as follows: the sign of $x$ is stripped off by integer computations and stored in variable {\tt sign}. Than, $\left \vert x \right \vert$ is compared to $1$ by integer comparisons. \begin{lstlisting}[caption={Handling special cases - definition domain},firstnumber=1] /* Transform the argument into integer */ xdb.d = x; /* Special case handling */ /* Strip off the sign of argument x */ if (xdb.i[HI] & 0x80000000) sign = -1; else sign = 1; xdb.i[HI] &= 0x7fffffff; /* asin is defined on -1 <= x <= 1, elsewhere it is NaN */ if ((xdb.i[HI] > 0x3ff00000) || ((xdb.i[HI] == 0x3ff00000) && (xdb.i[LO] != 0x00000000))) { return (x-x)/0.0; /* return NaN */ } \end{lstlisting} Concerning subnormals in argument and in result of the function, the following is to be mentioned. The Taylor series of $\arcsin$ developed in $0$ is $$\arcsin\left( x \right) = x \cdot \left( 1 + \frac{1}{6} \cdot x^2 + \sum\limits_{n=2}^\infty \frac{\left( 2n - 1 \right)!!}{\left(2n\right)!! \cdot \left( 2n + 1 \right)} \cdot x^{2n}\right)$$ It is easy to check that $\sum\limits_{n=2}^\infty \frac{\left( 2n - 1 \right)!!}{\left(2n\right)!! \cdot \left( 2n + 1 \right)} \cdot x^{2n} < \frac{1}{3} \cdot x^2$ for $\left \vert x \right \vert < \frac{1}{2}$. So for $\left \vert x \right \vert \leq 2^{-28}$, one gets $\arcsin\left( x \right) \leq x \cdot \left( 1 + \frac{1}{2} \cdot x^2 \right) \leq x \cdot \left( 1 + 2^{-57} \right) < x + \frac{1}{2} \mUlp\left(x\right)$. So the rounding can be decided without even computing the cubic term of the Taylor development. Thus subnormals in argument and in result can be avoided by performing a simple test on the absolute value of $x$. In particular, since $\sum\limits_{n=1}^\infty \frac{\left( 2n - 1 \right)!!}{\left(2n\right)!! \cdot \left( 2n + 1 \right)} \cdot x^{2n}$ is an even function, the sign of the truncation rest is known, which allows for simplifications in the directed rounding modes. Here, only some special care is needed for the case where $x$ is exactly equal to $0$. The test and the rounding are implemented as follows. Let us first consider the round-to-nearest case: \begin{lstlisting}[caption={Handling special cases - rounding (to nearest)},firstnumber=1] if (xdb.i[HI] < 0x3e300000) { return x; } \end{lstlisting} In the round-upward case, a correction of $x$ is potentially necessary. We implement: \begin{lstlisting}[caption={Handling special cases - rounding (upwards)},firstnumber=1] /* If x == 0 then we got the algebraic result arcsin(0) = 0 If x < 0 then the truncation rest is negative but less than 1 ulp; we round upwards by returning x */ if (x <= 0) return x; /* Otherwise the rest is positive, less than 1 ulp and the image is not algebraic We return x + 1ulp */ xdb.l++; return xdb.d; \end{lstlisting} The other directed rounding cases are analogous to the round-upwards case. For the discrimination of the argument $\left \vert x \right \vert$ in the 10 possible approximation intervals $I_i$, the following technique is used. The intervals at the definition domain borders $I_0$ and $I_9$ are first filtered out by tests checking the high order word of $x$ against the corresponding bounds. If $x$ is found to be in one of these two intervals, the function is approximated in quick and if needed in accurate phase and the correctly rounded value is returned. In any case, the two intervals have particular properties in comparison to the other 8 middle intervals, so this technique should not be considered as a performance disadvantage. The polynomial coefficients' indices in the main coefficient table are fixed in this case and directly compiled into the code via macros. If $x$ does not fall in one of the both border intervals $I_0$ and $I_9$, the corresponding interval $I_i$, $1 \leq i \leq 8$ is computed by a 3-level dichotomy on the bounds $bound_2 \dots bound_8$. Its result is not a number $i$ in $1 \leq i \leq 8$ but an index {\tt i} to the main coefficient table. Beginning at the point indexed, the table reads the midpoint value $m_i$ and the polynomial coefficients for the corresponding interval $I_i$. The correponding code is the following: \begin{lstlisting}[caption={Interval discrimination},firstnumber=1] /* Recast x */ x = xdb.d; /* Find correspondant interval and compute index to the table We start by filtering the two special cases around 0 and 1 */ if (xdb.i[HI] < BOUND1) { (*@-- Compute quick and potentially accurate phase polynomial approximation $p_0$ and return --@*) } if (xdb.i[HI] > BOUND9) { (*@-- Reduce the argument, compute quick and potentially accurate phase approximation using $p_9$, reconstruct and return --@*) } /* General 8 main intervals We can already suppose that BOUND1 <= x <= BOUND9 */ if (xdb.i[HI] < BOUND5) { if (xdb.i[HI] < BOUND3) { if (xdb.i[HI] < BOUND2) i = TBLIDX2; else i = TBLIDX3; } else { if (xdb.i[HI] < BOUND4) i = TBLIDX4; else i = TBLIDX5; } } else { if (xdb.i[HI] < BOUND7) { if (xdb.i[HI] < BOUND6) i = TBLIDX6; else i = TBLIDX7; } else { if (xdb.i[HI] < BOUND8) i = TBLIDX8; else i = TBLIDX9; } } (*@-- Reduce the argument, compute quick and potentially accurate~ phase polynomial approximation $p_i$ and return --@*) \end{lstlisting} In the case of $x$ being classified in either the middle or the higher intervals $I_i$, $1 \leq i \leq 9$, an argument reduction is to be performed. Let us consider it first for the high path interval $I_9$ and then for the middle path intervals $I_i$, $1 \leq i \leq 8$. In both cases, we will show that the argument reduction is mathematically exact and that it may not produce a subnormal different from $0$. In the high path, we know that $1 \geq x > bound_9 > 0.77$. The argument reduction to be performed is $z = 1 - x$. Since $\frac{1}{2} \leq x \leq 2$ is verified, we can implement it exactly thanks to Sterbenz' lemma. If $x$ is exactly equal to $1$ is produces exactly $0$. Otherwise, it may not produce a subnormal, because $x \leq 1 - \frac{1}{2} \cdot \mUlp\left( 1 \right) \leq 1 - 2^{-53}$. Thus $z = 1 - x > 2^{-53} > 2^{-1021}$. In the middle path intervals, the argument reduction to be performed is $z_i = x - m_i$. Since $\left \vert z \right \vert \leq 0.058$ and $x \geq 0.18$, Sterbenz' lemma is verified in each interval $I_i$ and we can still implement the argument reduction exactly in double precision arithmetic. Since, $x > 0.18 > \frac{1}{8}$, a similar argument as the one given above shows that the result of the reduction is either exactly $0$ or a non-subnormal double precision number. The value $m_i$ is read in the main table at the index {\tt i} computed by the interval discrimination phase. We implement thus: \begin{lstlisting}[caption={Argument reduction},firstnumber=1] /* Argument reduction i points to the interval midpoint value in the table */ z = x - tbl[i]; \end{lstlisting} Concerning the higher path interval $I_9$ where $\arcsin$ is approximated as $$\arcsin\left( x \right) \approx p_9\left( 1 - x \right) \cdot \sqrt{2 - 2\cdot x} + \frac{\pi}{2}$$ let us remark that $2 - 2\cdot x = 2 \cdot z$ can also be computed exactly. Trivially, since $z$ less than $2^{1023}$, the multiplication by a positive integer power of $2$ is errorfree. If $z$ is not exactly $0$, its result may not be subnormal because $z$ cannot. Since the argument reduction has been shown to be exact, its result can clearly be reused in the accurate phase. \section{Polynomial approximation and reconstruction}\label{sec:asinpolynomial} \subsection{Quick phase polynomial approximation and reconstruction}\label{subsec:asinquickpolynomial} As already mentioned, the quick phase polynomials $p_{i\mbox{\tiny ~quick}}$ are truncated versions of the accurate phase polynomials $p_{i\mbox{\tiny ~accurate}}$ with coefficients rounded from triple-double to double-double or from double-double to double. This means simply that not all coefficients are read and used. \subsubsection{Low path - interval $I_0$} The polynomial $p_{0\mbox{\tiny ~quick}}$ approximates $\arcsin$ in the interval $I_0$ as follows: $$\arcsin\left( x \right) \approx x + x^3 \cdot p_{0\mbox{\tiny ~quick}}\left( x^2 \right)$$ It is of degree $8$ with $5$ double-double and $4$ double precision coefficients. For arguments $\left \vert x \right \vert \leq 2^{-10}$, the polynomial needs not be evaluated fully to provide enough accuracy. Here, only its constant and linear term are evaluated. So we get in this case $$\arcsin\left( x \right) \approx x + x^3 \cdot \left( \left( c_{0\hi} + c_{0\lo} \right) + x^2 \cdot \left( c_{1\hi} + c_{1\lo} \right) \right)$$ This special path yields to a significant performance gain on average. In fact, since floating point numbers are not equispaced but distributed logarithmatically around $0$, speeding up a function for low arguments is worth it. The square of $x$, $x^2$ can be computed exactly by use of a \Mul~ sequence, which will produce a double-double $xSq_\hi + xSq_\lo = x^2$. The polynomial $p_{0\mbox{\tiny ~quick}}\left( xSq_\hi + xSq_\lo \right)$ is evaluated using Horner's scheme and neglecting $xSq_\lo$ for the $8$ higher degree coefficients if these need to be evaluated. The double-double precision Horner steps are implemented the double-double multiply-and-add macros \MulAddDD~ and \MulAddDdD~ (see section \ref{sec:double-double-horner}, page \pageref{sec:double-double-horner}). It is easy to check that the preconditions on the arguments of these macros are verified: $x^2$ is bounded by $x^2 \leq \left(2^{-2.434403}\right)^2 \leq 2^{-4}$ in this path. Further, in the order of the Horner evaluation, the coefficients $c_i$ of the polynomial are stricly increasing in magnitude and all less than $1$. Concerning the accuracy of this operations, see section \ref{subsec:asinquickphaseaccu}, page \pageref{subsec:asinquickphaseaccu}. Including the test $\left \vert x \right \vert \stackrel{?}{\leq} 2^{-10}$, the code computing an approximation $t_{5\hi} + t_{5\lo} \approx p_{0\mbox{\tiny ~quick}}\left( x^2 \right)$ reads: \begin{lstlisting}[caption={Low path quick phase polynomial approximation (higher degrees)},firstnumber=1] Mul12(&xSqh,&xSql,x,x); tmp4 = tbl[3]; tmp5 = tbl[4]; t4h = tmp4; t4l = tmp5; if (xdb.i[HI] > EXTRABOUND) { /* Double precision evaluation */ highPoly = tbl[15] + xSqh * (tbl[17] + xSqh * (tbl[19] + xSqh * (tbl[21] + xSqh * tbl[23]))); /* Double-double precision evaluation */ Mul12(&tt1h,&tt1l,xSqh,highPoly); Add22(&t1h,&t1l,tbl[12],tbl[13],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[9],tbl[10],xSqh,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[6],tbl[7],xSqh,t2h,t2l); MulAdd22(&t4h,&t4l,tmp4,tmp5,xSqh,xSql,t3h,t3l); } MulAdd22(&t5h,&t5l,tbl[0],tbl[1],xSqh,xSql,t4h,t4l); \end{lstlisting} Once $t_{5\hi} + t_{5\lo}$ are computed, they must be multiplied by $x^3$ and the result must be added to $x$. The value $x^3$ is computed approximatively as a double-double $xCube_\hi + xCube_\lo$ by multiplying $x$ by $xSq_\hi + xSq_\lo = x^2$. This value $xCube_\hi + xCube_\lo$ is than multiplied by $t_{5\hi} + t_{5\lo}$, yielding to $tt_{6\hi} + tt_{6\lo}$. The last addition implying $x$ and $tt_{6\hi} + tt_{6\lo}$ is implemented in an ad-hoc way by means of two exact additions and a double precision addition on the lower part of the addition of the higher significant parts. The code reads: \begin{lstlisting}[caption={Low path quick phase polynomial approximation (lower degrees)},firstnumber=1] Mul122(&xCubeh,&xCubel,x,xSqh,xSql); Mul22(&tt6h,&tt6l,xCubeh,xCubel,t5h,t5l); Add12(tmp1,tmp2,x,tt6h); tmp3 = tmp2 + tt6l; Add12(polyh,polyl,tmp1,tmp3); \end{lstlisting} The obtained polynomial approximation value is then multiplied by the sign of $x$ the argument reduction had stripped off and the rounding test is performed. If it fails, the accurate phase is launched; see section \ref{sec:asinacculowpath}, page \pageref{sec:asinacculowpath}, for its implementation. The code for the last steps in round-to-nearest mode is given below. The code for the direct rounding modes is analogous. One remarks that the rounding test constants, computed by the corresponding Maple scripts in function of the relative error bounds to be shown in section \ref{subsec:asinquickphaseaccu}, page \pageref{subsec:asinquickphaseaccu}, are stored also in double precision and also read from the main table. \begin{lstlisting}[caption={Low path quick phase rounding test},firstnumber=1] /* Multiply by sign */ asinh = sign * polyh; asinm = sign * polyl; /* Rounding test The RN rounding constant is at tbl[34] */ if(asinh == (asinh + (asinm * tbl[34]))) return asinh; /* Launch accurate phase */ \end{lstlisting} \subsubsection{Middle path - interval $I_i$, $1 \leq i \leq 8$} In the quick phase middle path, i.e. for arguments $x \in I_i$, $1 \leq i \leq 8$, $\arcsin$ is approximated by the polynomial $p_{i\mbox{\tiny ~quick}}$ as follows: $$\arcsin\left( x \right) \approx \arcsin\left( m_i \right) + z_i \cdot p_{i\mbox{\tiny ~quick}}\left( z_i \right)$$ where $z_i = x - m_i$ is a double precision number. Further an approximation $asm_{i\hi} + asm_{i\lo}$ to $\arcsin\left( m_i \right)$ is used. It is read in the main table at {\tt tbl[i+1]} and {\tt tbl[i+2]} where {\tt i} is the index computed at the interval discrimination phase. The polynomial $p_{i\mbox{\tiny ~quick}}$ is of degree $13$ with $6$ double-double and $8$ double coefficients. It is always evaluated completely by means of Horner's scheme. Once again, the \MulAddDdD~ operator allows for evaluating the $5$ last double-double steps. The first double-double step is evaluated in a more ad-hoc way because of the entering only double precision current intermediate result. The preconditions for the \MulAddDdD~ operator can again be checked easily: $z_i$ is bounded in magnitude by $2^{-4.123846}$, the coefficients increase in the order of Horner's scheme evaluation and are all less than $1$. So in each step, the product of $z_i$ and the current value is less than $\frac{1}{4}$ the next coefficient as asked for by the precondition. The multiplication of the result of the polynomial $p_{i\mbox{\tiny ~quick}}$ by $z_i$ and the addition of $asm_{i\hi} + asm_{i\lo}$ can also be considered as a Horner step and are therefore implemented using the \MulAddDdD~ macro, too. The corresponding evaluation code reads thus: \begin{lstlisting}[caption={Middle path quick phase polynomial approximation},firstnumber=1] highPoly = tbl[i+21] + z * (tbl[i+23] + z * (tbl[i+25] + z * ( tbl[i+27] + z * (tbl[i+29] + z * (tbl[i+31] + z * ( tbl[i+33] + z * tbl[i+35])))))); Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[i+18],tbl[i+19],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[i+15],tbl[i+16],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[i+12],tbl[i+13],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[i+9],tbl[i+10],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[i+6],tbl[i+7],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[i+3],tbl[i+4],z,t5h,t5l); MulAdd212(&polyh,&polyl,tbl[i+1],tbl[i+2],z,t6h,t6l); \end{lstlisting} One remarks that in this case, since the polynomial evaluation code is the same for all intervals $I_i$, $1 \leq i \leq 8$, the coefficients read in the table are not at fixed indices but indexed by {\tt i}, value computed in the interval discrimination phase. The result of this approximation whose accuracy will be analysed in section \ref{subsec:asinquickphaseaccu}, page \pageref{subsec:asinquickphaseaccu}, is then multiplied by the sign of the the original argument and submitted to the rounding test whose rounding constant is read in the main table dependingly on the interval $I_i$. The corresponding code for round-to-nearest is given below. The directed rounding cases are analogous. \begin{lstlisting}[caption={Middle path quick phase rounding test},firstnumber=1] asinh = sign * polyh; asinm = sign * polyl; /* Rounding test The RN rounding constant is at tbl[i+59] */ if(asinh == (asinh + (asinm * tbl[i+59]))) return asinh; /* Launch accurate phase */ \end{lstlisting} \subsubsection{High path - interval $I_9$} In the high path $\arcsin$ is approximated as $$\arcsin\left( x \right) \approx p_{9\mbox{\tiny ~quick}}\left( z \right) \cdot \sqrt{2 \cdot z} + \frac{\pi}{2}$$ Herein, $z = 1 - x$ is the exactly computed double precision reduced argument. The constant $\frac{\pi}{2}$ is approximated by the double-double number $PiHalf_\hi + PiHalf_\mi = \frac{\pi}{2} \cdot \left( 1 + \epsilon \right)$ with $\left \vert \epsilon \right \vert \leq 2^{-109}$. It has already been shown that $z$ and $twoZ = 2 \cdot z$ can be computed exactly. The square root $\sqrt{2 \cdot z}$ is approximated in double-double precision using the \SqrtD~ macro operator described in section \ref{subsection:sqrt}, page \pageref{subsection:sqrt}. The polynomial $p_{9\mbox{\tiny ~quick}}$ has degree $18$ with $9$ double-double and $10$ double precision coefficients. Its constant term is exactly $-1$, so this coefficient is not stored in the table. It is always evaluated completely. Horner's scheme is used and implemented by means of the \MulAddDdD~ operator whose precodnitions can once again easily be verified by an analogous argument as the one given above for low and middle paths. The corresponding code reads: \begin{lstlisting}[caption={High path quick phase polynomial approximation},firstnumber=1] highPoly = tbl[TBLIDX10+24] + z * (tbl[TBLIDX10+26] + z * (tbl[TBLIDX10+28] + z * ( tbl[TBLIDX10+30] + z * (tbl[TBLIDX10+32] + z * (tbl[TBLIDX10+34] + z * ( tbl[TBLIDX10+36] + z * (tbl[TBLIDX10+38] + z * (tbl[TBLIDX10+40] + z * tbl[TBLIDX10+42])))))))); Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[TBLIDX10+21],tbl[TBLIDX10+22],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[TBLIDX10+18],tbl[TBLIDX10+19],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[TBLIDX10+15],tbl[TBLIDX10+16],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[TBLIDX10+12],tbl[TBLIDX10+13],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[TBLIDX10+9],tbl[TBLIDX10+10],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[TBLIDX10+6],tbl[TBLIDX10+7],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[TBLIDX10+3],tbl[TBLIDX10+4],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[TBLIDX10+0],tbl[TBLIDX10+1],z,t7h,t7l); MulAdd212(&polyh,&polyl,-1,0,z,t8h,t8l); \end{lstlisting} The result $poly_\hi + poly_\lo$ of the polynomial approximation is multiplied by $sqrtz_\hi + sqrtz_\lo$, the double-double approximation of $\sqrt{2 \cdot z}$ by the double-double multiplication operator \MulDD~ and then added to $PiHalf_\hi + PiHalf_\mi$ using the double-double addition operator \AddDD. In this addition no catastrophic cancellation can occur: since $x > 0.78 > \frac{\sqrt{2}}{2}$ in this interval, the result of the addition, a good approximation to $\arcsin\left( x \right)$ will always be greater than $\frac{\pi}{4}$ as per the monotony of arcsine. So $pTimesS_\hi + pTimesS_\lo \approx p_{9\mbox{\tiny ~quick}}\left( z \right) \cdot \sqrt{2 \cdot z}$ will always be less than $\frac{1}{2} \cdot \left( PiHalf_\hi + PiHalf_\mi \right)$. In this argumentation, approximation errors can be neglected since the bound to be shown is not tight at all. The corresponding implementation is the following: \begin{lstlisting}[caption={High path: square root extraction and reconstruction},firstnumber=1] twoZ = 2 * z; sqrt12(&sqrtzh,&sqrtzl,twoZ); /* Multiply p(z) by sqrt(2*z) and add Pi/2 */ Mul22(&pTimesSh,&pTimesSl,polyh,polyl,sqrtzh,sqrtzl); Add22(&allh,&alll,PIHALFH,PIHALFM,pTimesSh,pTimesSl); \end{lstlisting} In this path, too, the obtained result is multiplied by the sign which had stripped off from the function's argument $x$ and submitted to the rounding test using a rounding constant read in the main table. The code reads for round-to-nearest mode: \begin{lstlisting}[caption={Multiplication of the function's sign, rounding test (round-to-nearest)},firstnumber=1] asinh = sign * allh; asinm = sign * alll; /* Rounding test The RN rounding constant is at tbl[TBLIDX10+54] */ if(asinh == (asinh + (asinm * tbl[TBLIDX10+54]))) return asinh; /* Launch accurate phase */ \end{lstlisting} \subsection{Accurate phase polynomial approximation and reconstruction}\label{subsec:asinaccupolynomial} As already mentioned, in the accurate phase, the polynomials $p_{i\mbox{\tiny ~accurate}}$ for the different intervals $I_i$ whose coefficient are stored in the main table, are evaluated completely. This evaluation is done in double, double-double and triple-double precision using mainly Horner's scheme. The accurate phase is implemented in three different {\tt C} functions corresponding to the low, middle and high paths. These functions return a triple-double approximate $asin_\hi + asin_\mi + asin_\lo$ to $\arcsin$ which is accurate enough that the correct rounded result for $\arcsin$ is obtained when rounding the approximate. The final rounding for itself is implemented in the four functions containing the quick phase code and the call to the accurate phase for the four possible rounding modes. In round-to-nearest mode, for the high path the code reads: \begin{lstlisting}[caption={Final rounding of the accurate phase result (RN)},firstnumber=1] /* Launch accurate phase */ asin_accurate_higher(&asinh,&asinm,&asinl,z,sign); ReturnRoundToNearest3(asinh,asinm,asinl); \end{lstlisting} For the other rounding modes and evaluation paths the code is completely analogous. \subsubsection{Low path - interval $I_0$\label{sec:asinacculowpath}} For the low path, the polynomial $p_{0\mbox{\tiny ~accurate}}$ approximates $\arcsin$ as follows: $$\arcsin\left( x \right) \approx x + x^3 \cdot p_{0\mbox{\tiny ~accurate}}\left( x^2 \right)$$ is of degree $17$ with $7$ double precision coefficients and Horner steps, $6$ double-double coefficients and steps and $5$ triple-double coefficients and steps. It reuses the value $xSq_\hi + xSq_\lo = x^2$ which has already been computed in the quick phase. The lower significant term $xSq_\lo$ is neglected for the first $8$ double precision (and early double-double precision) steps. The double-double Horner steps are implemented using the \MulAddDD~ sequence. The triple-double steps used separate \AddTT~ and \MulTT~ macros. The value $x^3$ is computed out of $x$ and $x^2$ in triple-double precision using the \MuldDT~ operator. It is multiplied by the polynomial's result in triple-double by a \MulTT. The resulting triple-double is added to $x$ using the \AdddTT~ macro. In addition to the final renormalization which is needed before correct rounding to double precision is performed, one intermediate renormalization is necessary. Otherwise overlap in the triple-double intermediate values would deteriorate the accuracy to much. See section \ref{subsec:asinaccuratephaseaccu}, page \pageref{subsec:asinaccuratephaseaccu} for the overlap bounding. The code of the low path accurate phase polynomial approximation is the following: \begin{lstlisting}[caption={Low path accurate phase polynomial approximation},firstnumber=1] highPoly = tbl[28] + xSqh * (tbl[29] + xSqh * (tbl[30] + xSqh * (tbl[31] + xSqh * (tbl[32] + xSqh * tbl[33])))); /* Double-double computations */ Mul12(&tt1h,&tt1l,xSqh,highPoly); Add22(&t1h,&t1l,tbl[27],0,tt1h,tt1l); MulAdd22(&t2h,&t2l,tbl[25],tbl[26],xSqh,xSql,t1h,t1l); MulAdd22(&t3h,&t3l,tbl[23],tbl[24],xSqh,xSql,t2h,t2l); MulAdd22(&t4h,&t4l,tbl[21],tbl[22],xSqh,xSql,t3h,t3l); MulAdd22(&t5h,&t5l,tbl[19],tbl[20],xSqh,xSql,t4h,t4l); MulAdd22(&t6h,&t6l,tbl[17],tbl[18],xSqh,xSql,t5h,t5l); MulAdd22(&t7h,&t7l,tbl[15],tbl[16],xSqh,xSql,t6h,t6l); /* Triple-double computations */ Mul23(&tt8h,&tt8m,&tt8l,xSqh,xSql,t7h,t7l); Add33(&t8h,&t8m,&t8l,tbl[12],tbl[13],tbl[14],tt8h,tt8m,tt8l); Mul233(&tt9h,&tt9m,&tt9l,xSqh,xSql,t8h,t8m,t8l); Add33(&t9h,&t9m,&t9l,tbl[9],tbl[10],tbl[11],tt9h,tt9m,tt9l); Mul233(&tt10h,&tt10m,&tt10l,xSqh,xSql,t9h,t9m,t9l); Add33(&t10h,&t10m,&t10l,tbl[6],tbl[7],tbl[8],tt10h,tt10m,tt10l); Mul233(&tt11hover,&tt11mover,&tt11lover,xSqh,xSql,t10h,t10m,t10l); Renormalize3(&tt11h,&tt11m,&tt11l,tt11hover,tt11mover,tt11lover); Add33(&t11h,&t11m,&t11l,tbl[3],tbl[4],tbl[5],tt11h,tt11m,tt11l); Mul233(&tt12h,&tt12m,&tt12l,xSqh,xSql,t11h,t11m,t11l); Add33(&t12h,&t12m,&t12l,tbl[0],tbl[1],tbl[2],tt12h,tt12m,tt12l); Mul123(&xCubeh,&xCubem,&xCubel,x,xSqh,xSql); Mul33(&tt13h,&tt13m,&tt13l,xCubeh,xCubem,xCubel,t12h,t12m,t12l); Add133(&t13h,&t13m,&t13l,x,tt13h,tt13m,tt13l); Renormalize3(&polyh,&polym,&polyl,t13h,t13m,t13l); *asinh = sign * polyh; *asinm = sign * polym; *asinl = sign * polyl; \end{lstlisting} \subsubsection{Middle path - interval $I_i$, $1 \leq i \leq 8$} For the middle path for $x \in I_i$, $1 \leq i \leq 8$, we use the following polynomial approximation by $p_{i \mbox{\tiny ~accurate}}$: $$\arcsin\left( x \right) \approx \left( asm_{i\hi} + asm_{i\lo} \right) + z_i \cdot p_{i \mbox{\tiny ~accurate}}\left( z_i\right)$$ where $z_i = x - m_i$ and $asm_{i\hi} + asm_{i\lo} = \arcsin\left( m_i \right) \cdot \left( 1 + \epsilon \right)$ with $\left \vert \epsilon \right \vert \leq 2^{-121}$ by construction of $m_i$. The polynomial $p_{i \mbox{\tiny ~accurate}}$ is of degree $34$. In order of decreasing monomial degrees, its coefficients are stored on $20$ double precision numbers, $9$ double-double precision numbers and $6$ triple-double precision numbers. It is completely evaluated using Horner's scheme using the same intermediate precision for the computation as the one used for the coefficients. The last multiplication by $z$ and the addition of $asm_{i\hi} + asm_{i\lo}$ can be considered as an additional Horner step and is of course performed in triple-double precision. The double-double precision steps are implemented using the \MulAddDdD~ macro. The triple-double steps use separate addition and multiplication operators. In particular, \AddTT~ and \MuldTT~ come at hand. Overall, two triple-double renormalizations are necessary: one before final rounding can be performed and one other for avoiding a too great overlap in the components of the intermediate triple-double values. See section \ref{subsec:asinaccuratephaseaccu}, page \pageref{subsec:asinaccuratephaseaccu} for the overlap bounding. The coefficients of the polynomial $p_{i \mbox{\tiny ~accurate}}$ and the value $asm_{i\hi} + asm_{i\lo}$ are read in the main table using the index {\tt i} computated at the interval discrimination phase. The reduced argument $z_i$ has already been computed exactly at the quick phase and can be reused. The implementation of the accurate phase middle path polynomial approximation reads: \begin{lstlisting}[caption={Middle path accurate phase polynomial approximation},firstnumber=1] highPoly = tbl[i+39] + z * (tbl[i+40] + z * (tbl[i+41] + z * (tbl[i+42] + z * ( tbl[i+43] + z * (tbl[i+44] + z * (tbl[i+45] + z * (tbl[i+46] + z * ( tbl[i+47] + z * (tbl[i+48] + z * (tbl[i+49] + z * (tbl[i+50] + z * ( tbl[i+51] + z * (tbl[i+52] + z * (tbl[i+53] + z * (tbl[i+54] + z * ( tbl[i+55] + z * (tbl[i+56] + z * (tbl[i+57] + z * tbl[i+58])))))))))))))))))); /* Double-double computations */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[i+37],tbl[i+38],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[i+35],tbl[i+36],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[i+33],tbl[i+34],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[i+31],tbl[i+32],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[i+29],tbl[i+30],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[i+27],tbl[i+28],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[i+25],tbl[i+26],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[i+23],tbl[i+24],z,t7h,t7l); MulAdd212(&t9h,&t9l,tbl[i+21],tbl[i+22],z,t8h,t8l); /* Triple-double computations */ Mul123(&tt10h,&tt10m,&tt10l,z,t9h,t9l); Add33(&t10h,&t10m,&t10l,tbl[i+18],tbl[i+19],tbl[i+20],tt10h,tt10m,tt10l); Mul133(&tt11h,&tt11m,&tt11l,z,t10h,t10m,t10l); Add33(&t11h,&t11m,&t11l,tbl[i+15],tbl[i+16],tbl[i+17],tt11h,tt11m,tt11l); Mul133(&tt12h,&tt12m,&tt12l,z,t11h,t11m,t11l); Add33(&t12h,&t12m,&t12l,tbl[i+12],tbl[i+13],tbl[i+14],tt12h,tt12m,tt12l); Mul133(&tt13hover,&tt13mover,&tt13lover,z,t12h,t12m,t12l); Renormalize3(&tt13h,&tt13m,&tt13l,tt13hover,tt13mover,tt13lover); Add33(&t13h,&t13m,&t13l,tbl[i+9],tbl[i+10],tbl[i+11],tt13h,tt13m,tt13l); Mul133(&tt14h,&tt14m,&tt14l,z,t13h,t13m,t13l); Add33(&t14h,&t14m,&t14l,tbl[i+6],tbl[i+7],tbl[i+8],tt14h,tt14m,tt14l); Mul133(&tt15h,&tt15m,&tt15l,z,t14h,t14m,t14l); Add33(&t15h,&t15m,&t15l,tbl[i+3],tbl[i+4],tbl[i+5],tt15h,tt15m,tt15l); Mul133(&tt16h,&tt16m,&tt16l,z,t15h,t15m,t15l); Add233(&t16h,&t16m,&t16l,tbl[i+1],tbl[i+2],tt16h,tt16m,tt16l); Renormalize3(&polyh,&polym,&polyl,t16h,t16m,t16l); *asinh = sign * polyh; *asinm = sign * polym; *asinl = sign * polyl; \end{lstlisting} \subsubsection{High path - interval $I_9$} On the high path interval $I_9$, computing the approximation for $\arcsin$ means evaluating the polynomial $p_{9 \mbox{\tiny~accurate}}\left( z \right)$ and calculating a triple-double approximation to $\sqrt{2 \cdot z}$ where $z$ is the reduced argument. The function can then be reconstructed as follows: $$\arcsin\left( x \right) \approx p_{9 \mbox{\tiny~accurate}}\left( z \right) \cdot \sqrt{2\cdot z} + \left( PiHalf_\hi + PiHalf_\mi + PiHalf_\lo \right)$$ where $PiHalf_\hi + PiHalf_\mi + PiHalf_\lo = \frac{\pi}{2} \cdot \left( 1 + \epsilon \right)$, $\left \vert \epsilon \right \vert \leq 2^{-164}$ The polynomial $p_{9 \mbox{\tiny~accurate}}\left( z \right)$ is of degree $28$ with $12$ double precision, $9$ double-double precision and $8$ triple-double precision coefficients. The intermediate precisions used correspond to the precision the coefficients are stored in. The polynomial is completely evaluated in Horner's scheme. Once again, for doing so, the \MulAddDdD~ macro is used for the double-double steps whilst the triple-double stage is implemented by means of separate additions and multiplications mainly expressed with \AddTT~ and \MuldTT~ operators. The square root extraction yielding to the triple-double approximate $sqrtz_\hi + sqrtz_\mi + sqrtz_\lo = \sqrt{2 \cdot z } \cdot \left( 1 + \epsilon \right)$ is implemented using the \SqrtT~ macro. Unfortunately, this means recomputing some steps of the square root extraction already computed in the quick phase in the \SqrtD~ macro. The choice made is motivated by implementatory reasons. The multiplication of the polynomial's value and of the square root is performed in triple-double precision by means of the \MulTT~ macro. The following addition with the triple-double approximate of $\frac{\pi}{2}$ is implemented using the \AddTT~ operator. Overall, three renormalizations are needed. One of them renormalizes the final result, two allow for sufficient overlap bounding. Remark that the square root extraction by \SqrtT~ comprises an additional renormalization; see section \ref{subsection:sqrt}, page \pageref{subsection:sqrt} for further details. The overlap bounds will be given in section \ref{subsec:asinaccuratephaseaccu}, page \pageref{subsec:asinaccuratephaseaccu}. The code implementing this accurate phase path is the following: \begin{lstlisting}[caption={High path accurate phase polynomial approximation},firstnumber=1] highPoly = tbl[TBLIDX10+42] + z * (tbl[TBLIDX10+43] + z * (tbl[TBLIDX10+44] + z * ( tbl[TBLIDX10+45] + z * (tbl[TBLIDX10+46] + z * (tbl[TBLIDX10+47] + z * ( tbl[TBLIDX10+48] + z * (tbl[TBLIDX10+49] + z * (tbl[TBLIDX10+50] + z * ( tbl[TBLIDX10+51] + z * (tbl[TBLIDX10+52] + z * tbl[TBLIDX10+53])))))))))); /* Double-double computations */ Mul12(&tt1h,&tt1l,z,highPoly); Add22(&t1h,&t1l,tbl[TBLIDX10+40],tbl[TBLIDX10+41],tt1h,tt1l); MulAdd212(&t2h,&t2l,tbl[TBLIDX10+38],tbl[TBLIDX10+39],z,t1h,t1l); MulAdd212(&t3h,&t3l,tbl[TBLIDX10+36],tbl[TBLIDX10+37],z,t2h,t2l); MulAdd212(&t4h,&t4l,tbl[TBLIDX10+34],tbl[TBLIDX10+35],z,t3h,t3l); MulAdd212(&t5h,&t5l,tbl[TBLIDX10+32],tbl[TBLIDX10+33],z,t4h,t4l); MulAdd212(&t6h,&t6l,tbl[TBLIDX10+30],tbl[TBLIDX10+31],z,t5h,t5l); MulAdd212(&t7h,&t7l,tbl[TBLIDX10+28],tbl[TBLIDX10+29],z,t6h,t6l); MulAdd212(&t8h,&t8l,tbl[TBLIDX10+26],tbl[TBLIDX10+27],z,t7h,t7l); MulAdd212(&t9h,&t9l,tbl[TBLIDX10+24],tbl[TBLIDX10+25],z,t8h,t8l); /* Triple-double computations */ Mul123(&tt10h,&tt10m,&tt10l,z,t9h,t9l); Add33(&t10h,&t10m,&t10l,tbl[TBLIDX10+21],tbl[TBLIDX10+22],tbl[TBLIDX10+23],tt10h,tt10m,tt10l); Mul133(&tt11h,&tt11m,&tt11l,z,t10h,t10m,t10l); Add33(&t11h,&t11m,&t11l,tbl[TBLIDX10+18],tbl[TBLIDX10+19],tbl[TBLIDX10+20],tt11h,tt11m,tt11l); Mul133(&tt12h,&tt12m,&tt12l,z,t11h,t11m,t11l); Add33(&t12h,&t12m,&t12l,tbl[TBLIDX10+15],tbl[TBLIDX10+16],tbl[TBLIDX10+17],tt12h,tt12m,tt12l); Mul133(&tt13h,&tt13m,&tt13l,z,t12h,t12m,t12l); Add33(&t13hover,&t13mover,&t13lover, tbl[TBLIDX10+12],tbl[TBLIDX10+13],tbl[TBLIDX10+14],tt13h,tt13m,tt13l); Renormalize3(&t13h,&t13m,&t13l,t13hover,t13mover,t13lover); Mul133(&tt14h,&tt14m,&tt14l,z,t13h,t13m,t13l); Add33(&t14h,&t14m,&t14l,tbl[TBLIDX10+9],tbl[TBLIDX10+10],tbl[TBLIDX10+11],tt14h,tt14m,tt14l); Mul133(&tt15h,&tt15m,&tt15l,z,t14h,t14m,t14l); Add33(&t15h,&t15m,&t15l,tbl[TBLIDX10+6],tbl[TBLIDX10+7],tbl[TBLIDX10+8],tt15h,tt15m,tt15l); Mul133(&tt16h,&tt16m,&tt16l,z,t15h,t15m,t15l); Add33(&t16h,&t16m,&t16l,tbl[TBLIDX10+3],tbl[TBLIDX10+4],tbl[TBLIDX10+5],tt16h,tt16m,tt16l); Mul133(&tt17hover,&tt17mover,&tt17lover,z,t16h,t16m,t16l); Renormalize3(&tt17h,&tt17m,&tt17l,tt17hover,tt17mover,tt17lover); Add33(&t17h,&t17m,&t17l,tbl[TBLIDX10+0],tbl[TBLIDX10+1],tbl[TBLIDX10+2],tt17h,tt17m,tt17l); Mul133(&tt18h,&tt18m,&tt18l,z,t17h,t17m,t17l); Add133(&polyh,&polym,&polyl,-1,tt18h,tt18m,tt18l); /* Compute sqrt(2*z) as a triple-double */ twoZ = 2 * z; sqrt13(&sqrtzh,&sqrtzm,&sqrtzl,twoZ); /* Multiply p(z) by sqrt(2*z) and add Pi/2 */ Mul33(&pTimesSh,&pTimesSm,&pTimesSl,polyh,polym,polyl,sqrtzh,sqrtzm,sqrtzl); Add33(&allhover,&allmover,&alllover,PIHALFH,PIHALFM,PIHALFL,pTimesSh,pTimesSm,pTimesSl); /* Renormalize and multiply by sign */ Renormalize3(&allh,&allm,&alll,allhover,allmover,alllover); *asinh = sign * allh; *asinm = sign * allm; *asinl = sign * alll; \end{lstlisting} \section{Accuracy bounds}\label{sec:asinaccuracy} \subsection{Quick phase accuracy}\label{subsec:asinquickphaseaccu} TODO: see possibly available Gappa files meanwhile \subsection{Accurate phase accuracy}\label{subsec:asinaccuratephaseaccu} TODO: see possibly available Gappa files meanwhile \section{Timings and memory consumption}\label{sec:asintimingmemory} The given implementation of the arcsine uses tables and constants that consume 4740 bytes of memory. This values are fully shared between quick and accurate phase. The code size, including the tables, is about 22 kbytes when compiled to PowerPC machine code. The quick phase code for one rounding mode needs about 1.5 kbytes without the table. This means that there are about 12 kbytes of code for the accurate phase, which is shared between all rounding modes. Concerning the timing, we compare our implementation to IBM's {\tt libultim} and to MPFR. The values are given in arbitrary units and obtained on a IBM Power 5 processor with gcc 3.3.3 on a Linux Kernel 2.6.5. The timings on other systems are comparable. \begin{center} \begin{tabular}{|l|r|r|} \hline Library & avg time & max time \\ \hline \hline \texttt{MPFR} & 6322 & 83415 \\ \hline \texttt{crlibm} portable using triple-double & 45 & 300 \\ \hline default \texttt{libm} (IBM's {\tt libultim}) & 23 & 206239 \\ \hline \end{tabular} \end{center} It is worth mentioning that IBM's library uses about 20 kbytes of tables for its mere quick phase. %%% Local Variables: %%% mode: latex %%% TeX-master: "crlibm" %%% End: interval-2.1.0/src/crlibm/docs/latex/atan.tex0000644000000000000000000004742713031036767017261 0ustar 00000000000000This chapter is contributed by Nicolas Gast under the supervision of F. de~Dinechin. \newcommand{\xred}{X_{\mathrm{red}}} \newcommand{\xredhi}{{\mathrm{Xredhi}}} \newcommand{\xredlo}{{\mathrm{Xredlo}}} \section{Overview} For the arctangent, the quick phase has a precision of 64 bits, and the accurate phase computes to a precision of 136 bits. \subsubsection{Definition interval and exceptional cases} The inverse tangent is defined over all real numbers. \begin{itemize} \item If $x = NaN$ , then $\arctan(x)$ should return $NaN$ \item If $x = \pm\infty$ , then $\arctan(x)$ should return $\pm\round(\pi/2) = \pm\rounddown(\pi/2)$ in rounding to nearest mode. In directed rounding modes, we may return $\pm\roundup(\pi/2)$ which invalidates the inequation $|\arctan(x)|<\frac{\pi}{2}$ but respects the rounding. \item For $2^{54}<|x|<+\infty$ we choose to return $\pm\round(\pi/2)$ in all rounding modes. \item For $|x|<2^{-27}$ we have $|\arctan(x)-x|<2^{-53}x$ and $|\arctan(x)|<|x|$, which allows to decide to return either $x$ or the FP number next to $x$ towards zero. \end{itemize} \section{Quick phase} The code of the quick phase is organized in five functions. The function (\texttt{atan\_quick}) returns two doubles ($atanhi$ and $atanlo$) that represent $\arctan(x)$ with a precision of about 64 bits. Four other functions compute the correct rounding : \texttt{atan\_rn}, \texttt{atan\_ru}, \texttt{atan\_rd} and \texttt{atan\_rz}. \subsection{Overview of the algorithm for the quick phase.} This phase is computed in double or double-double. There are two steps in the algorithm: an argument reduction and a polynomial approximation with a polynomial of degree 9. We compute $\arctan(x)$ as \begin{equation} \arctan(x) = \arctan( b_i ) + \arctan(\frac{x-b_i}{1+x.b_i}) \label{eq:arctan_redu} \end{equation} The $b_i$ are exact doubles and the $\arctan(b_i)$ are stored in double-double. We define $\xred = \dfrac{x-b_i}{1+x.b_i}$ for the rest of this chapter. We tabulate intervals bounds $a_i$ and values $b_i$ such that \begin{equation} x \in [a_i;a_{i+1}] \Rightarrow \dfrac{x-b_i}{1+x.b_i} < e \quad . \label{atan_ineq_interval} \end{equation} The $i$ such that $x \in [a_i;a_{i+1}]$ will be found by dichotomy. Therefore we choose a power of two for the number of intervals: 64 intervals ensure $e=2^{-6.3}$. Then we use a polynomial of degree 9 for the approximation of $\arctan(\xred)$ which ensures 66 bits of precision: \begin{equation} \begin{split} \arctan(x)& \approx x - \dfrac{1}{3} .x^3 + \frac{1}{5}.x^5 - \frac{1}{7}.x^7 + \frac{1}{9}.x^9 \nonumber \\ & \approx x . + x.Q(x^2) \end{split} \label{eq:poly_eval1} \end{equation} Q is evaluated thanks to a Horner scheme: $ Q(z) = z. (-\frac{1}{3} + z.(\frac{1}{5} + z.(-\frac{1}{7} + z.\frac{1}{9}))) $ where each operation is computed in double. As $|z| \leq e$, $Q(z) \leq e^2$ At the end, the reconstruction implements equation (\ref{eq:poly_eval1}) and (\ref{eq:arctan_redu}) in double-double arithmetic. \subsection{Error analysis on atan\_quick} We choose four rounding constant: two when there is a argument reduction, two in the other case. For each case, we use two constants on order to improve performances. The error analysis presented here is implemented in \texttt{maple/atan.mpl} \paragraph{Notes on $b_i$, $a_i$ and $\arctan(b_i)$} The $b_i$ and $a_i$ are computed thanks to the \texttt{allbi} maple procedure (see \texttt{maple/atan.mpl}). There is no approximation error on the $b_i$ since we chose them to be FP numbers. The $\arctan (b_i)$ are stored in double-double so there is an approximation of $2^{-105}$ on them. The value of $e$ is fixed, then the $a_i$ are also chosen as FP numbers such that inequation (\ref{atan_ineq_interval}) is true. \subsubsection{Argument reduction} \begin{lstlisting}[caption={Reduction part 1},firstnumber=1] if (x > MIN_REDUCTION_NEEDED) /* test if reduction is necessary : */ { double xmBIhi,xmBIlo; if (x > arctan_table[61][B].d) { i=61; Add12( xmBihi , xmBilo , x , -arctan_table[61][B].d); } else { /* compute i so that a[i] < x < a[i+1] */ i=31; if (x < arctan_table[i][A].d) i-= 16; else i+=16; if (x < arctan_table[i][A].d) i-= 8; else i+= 8; if (x < arctan_table[i][A].d) i-= 4; else i+= 4; if (x < arctan_table[i][A].d) i-= 2; else i+= 2; if (x < arctan_table[i][A].d) i-= 1; else i+= 1; if (x < arctan_table[i][A].d) i-= 1 xmBihi = x-arctan_table[i][B].d; xmBilo = 0.0; } \end{lstlisting} \begin{tabular}{ll} Lines 1 & test if $x > 2^{-6.3}$ and so need to be reduced\\ Line 5 & test if $x>b[61]$ because when $i \in [0;60] : b_i/2 < x < b_i$ (or $ x/2 < b_i < x$) and then \\&$x-b_i$ is computed exactly thanks to Sterbenz lemma.\\ Line 10...21 & compute $i$ so that $\frac{x-b_i}{1+x.b_i} < 2^{-6.3} $\\ Line 7 and 23 & compute $xmBIhi + xmBIlo = x - b_i$ \end{tabular} We have no rounding error in the computation of $x-b_i$. \begin{lstlisting}[caption={Reduction part 2},firstnumber=1] Mul12(&tmphi,&tmplo, x, arctan_table[i][B].d); if (x > 1) Add22(&x0hi,&x0lo,tmphi,tmplo, 1.0,0.0); else {Add22( &x0hi , &x0lo , 1.0,0.0,tmphi,tmplo);} Div22( &Xredhi, &Xredlo, xmBihi , xmBilo , x0hi,x0lo); \end{lstlisting} \begin{tabular}{ll} Line 1 & compute $x.b_i$ exactly as a double-double\\ Line 3-5 & We need to have a Add22Comp but as we know that $x.b_i > 0$ (so $tmphi>0$), we test if\\& $tmphi$ is greater than 1 in order to be faster. The Add22 makes an error of $\epsilon_{Add22}=\epsilon_{103}$\\ Line 7 & We compute $\xred = \dfrac{x-b_i}{1+x.b_i}$. The Div22 makes $\epsilon_{104}$ (according to Ziv \cite{Ziv91}) error so we have : \end{tabular} \bigskip \begin{equation} \begin{split} \round\big(\xred\big) & = \frac{(x-b_i).(1+\epsilon_{105})}{(1+x.b_i).(1+\epsilon_{105}) .(1+\epsilon_{105}) )}.(1+\epsilon_{105}) \\ & = \frac{x-b_i}{1+x.b_i}.(1+\epsilon_{105})(1+\epsilon_{105}+\epsilon_{105}+\epsilon_{104})\\ & = \xred . (1+\epsilon_{101.9})\nonumber \end{split} \end{equation} So: \begin{equation} \epsilon_{\xred} = \epsilon_{102.6} \label{eps:equation} \end{equation} \subsubsection{Polynomial evaluation} The error due to the polynomial approximation is $\delta_{approx} = \infnorm{ \arctan(x) - x.(1+q)}= \delta_{72.38}$ \begin{lstlisting}[caption={Polynomial Evaluation},firstnumber=1] Xred2 = Xredhi*Xredhi; q = Xred2*(coef_poly[3]+Xred2* (coef_poly[2]+Xred2* (coef_poly[1]+Xred2* coef_poly[0]))) ; \end{lstlisting} \begin{tabular}{ll} Line 1 & The error between $\mathrm{Xred2}$ and the ideal value of $\xred^2$ comes from\\ & $\bullet$~ the error $\epsilon_{\xred}$ on $\xredhi+\xredlo$\\ & $\bullet$~ the truncation of $\xredlo$ adds $\epsilon_{53}$\\ & $\bullet$~ then the FP multiplication squares this term and adds a rounding error of $\epsilon_{53}$\\ & which sum up to $\epsilon_\mathrm{Xred2} = ((1+2^{-53}+2^{-105})^2)(1+2^{-53}) \approx \epsilon_{51.4}$ \\ Line 3 & Horner approximation with error on $\mathrm{Xred2}$: Maple computes an error around $\epsilon_{50.7}$\\ & or $\delta_{q}=\delta_{63.3}$\\ \end{tabular} \subsubsection{Reconstruction} The reconstruction adds $\arctan(b_i)$ (read as a double-double from a table) to $\arctan(\xred)$ (approximated by $(\xredhi+\xredlo)(1+q)$). The terms of this developed product are depicted in the following figure. \begin{center} \small \setlength{\unitlength}{3ex} \framebox{ \begin{picture}(22,3.5)(-3,-4.15) \put(9.5,-0.5){\line(0,-1){4}} \put(9,-1){$\epsilon$} \put(4,-2){$\arctan(b_i)_{hi}$} \put(0.05,-2.15){\framebox(7.9,0.7){}} \put(12,-2){$\arctan(b_i)_{lo}$} \put(8.05,-2.15){\framebox(7.9,0.7){}} \put(4,-3){$\xredhi$} \put(0.55,-3.15){\framebox(7.9,0.7){}} \put(12,-3){$\xredlo$} \put(8.55,-3.15){\framebox(7.9,0.7){}} \put(5,-4){$\xredhi.q$} \put(2.05,-4.15){\framebox(7.9,0.7){}} \put(13,-4){$\xredlo.q$} \put(10.05,-4.15){\framebox(7.9,0.7){}} \end{picture} } \end{center} Here the $\epsilon$ bar represents the target accuracy of $2^{-64}$. One can see that the term $\xredlo.q$ can be truncated. As $\xredlo < \xredhi.2^{-53}$ and $q 10$ the relative error is $\epsilon_{68.24}$ that leads to a rounding constant of $1.000068$. \subsubsection{Error when there is no reduction} \begin{lstlisting}[caption={No reduction},firstnumber=1] x2 = x*x; q = x2*(coef_poly[3]+x2* (coef_poly[2]+x2* (coef_poly[1]+x2* coef_poly[0]))) ; Add12(atanhi,atanlo, x , x*q); \end{lstlisting} The code is very simple so there are few error terms: \begin{tabular}{ll} Line 1 & $\epsilon_{53}$ \\ Line 2 & The Maple procedure to compute Horner approximation gives $\epsilon_{51}$\\ Line 3 & $\delta_{no\_reduction} = \epsilon_{105}.x + \epsilon_q.x^3 + \epsilon_{x.q}.x^3 + |arctan(x) - x.(1+q)| $ \end{tabular} When $x>2^{-10}$ the relative error is $\epsilon_{62.9}$. The constant is $1.0024$. When $x<2^{-10}$ the relative error is $\epsilon_{70.4}$. The constant is $1.000005$. \bigskip \subsection{Exceptional cases and rounding} \subsubsection{Rounding to nearest} \begin{lstlisting}[caption={Exceptional cases : rounding to nearest},firstnumber=1] db_number x_db; x_db.d = x; unsigned int hx = x_db.i[HI] & 0x7FFFFFFF; /* Filter cases */ if ( hx >= 0x43500000) /* x >= 2^54 */ { if ((hx > 0x7ff00000) || ((hx == 0x7ff00000) && (x_db.i[LO] != 0))) return x+x; /* NaN */ else return HALFPI.d; /* \arctan(x) = Pi/2 */ } else if ( hx < 0x3E400000 ) {return x; /* x<2^-27 then \arctan(x) =~ x */} \end{lstlisting} \begin{tabular}{ll} Lines 3 & Test if x is greatear than $2^{54}$, $\infty$ or $NaN$. \\ Line 5,6 & return $\arctan(NaN) = NaN$\\ Line 8 & \texttt{HALFPI} is the greatest double smaller than $\frac{\pi}{2}$ in order not to have $\arctan(x) > \dfrac{pi}{2}$ \\ Line 11 & When $x<2^{-27}$ : $x^2 < 2^{-54}$ so $o(\arctan(x)) = x$ \end{tabular} \\ \textbf{Proof} we know that $\arctan(x) = \displaystyle {\sum_{i=0}^{\infty} \frac{x^{2i+1}}{2i+1}(-1)^i}$. So: \begin{equation} \begin{split} \Big| \frac{\arctan(x)-x}{x} \Big| & = \Bigg|\frac{ \displaystyle {\sum_{i=0}^{\infty} \Big( \frac{x^{2i+1}}{2i+1}(-1)^i} \Big) - x}{x} \Bigg| \nonumber\\ & = \Big|\displaystyle {\sum_{i=1}^{\infty}} \frac{x^{2i}}{2i+1}(-1)^i\Big|\nonumber \\ & < \frac{x^2}{3}\nonumber \\ & < 2^{-54} \nonumber \end{split} \end{equation} Then : $\arctan(x) \approx x $ \bigskip \subsubsection{Rounding toward $-\infty$} \begin{lstlisting}[caption={Exceptional cases : rounding down},firstnumber=1] if ( hx >= 0x43500000) /* x >= 2^54 */ { if ((hx > 0x7ff00000) || ((hx == 0x7ff00000) && (x_db.i[LO] != 0))) return x+x; /* NaN */ else if (x>0) return HALFPI.d; else return -HALFPI_TO_PLUS_INFINITY.d; /* atan(x) = Pi/2 */ } else if ( hx < 0x3E400000 ) {if (sign>0) {if(x==0) {x_db.i[HI] = 0x80000000; x_db.i[LO] = 0;} else x_db.l--; return x_db.d; } else return x; } \end{lstlisting} The differences with rounding to nearest mode are for $frac{pi}{2}$ for $x<2^(-27)$. \begin{lstlisting}[caption={Test for rounding down},firstnumber=1] absyh.d=atanhi; absyl.d=atanlo; absyh.l = absyh.l & 0x7fffffffffffffffLL; absyl.l = absyl.l & 0x7fffffffffffffffLL; u53.l = (absyh.l & 0x7ff0000000000000LL) + 0x0010000000000000LL; u.l = u53.l - 0x0350000000000000LL; if(absyl.d > roundcst*u53.d){ if(atanlo<0.) {atanhi -= u.d;} return atanhi; } else { return scs_atan_rd(sign*x); } \end{lstlisting} \subsubsection{Rounding toward $-\infty$} \begin{lstlisting}[caption={Exceptional cases : rounding up},firstnumber=1] if ( hx >= 0x43500000) /* x >= 2^54 */ { if ((hx > 0x7ff00000) || ((hx == 0x7ff00000) && (x_db.i[LO] != 0))) return x+x; /* NaN */ else if (x>0) return HALFPI.d; else return -HALFPI_TO_PLUS_INFINITY.d; /* atan(x) = Pi/2 */ } else if ( hx < 0x3E400000 ) {if (sign<0) {x_db.l--; return -x_db.d; } else if(x==0) return 0; return x; } \end{lstlisting} There are the same differences for rounding down. \subsubsection{Rounding to zero} This function is quite simple: it call one of the two function defineded before. \begin{lstlisting}[caption={Rounding to zero},firstnumber=1] extern double atan_rz(double x) { if (x>0) return atan_rd(x); else return atan_ru(x); } \end{lstlisting} \subsubsection{Test if rounding is possible} This test use the theorem \ref{th:roundingRN1}. The code is the same than in the theorem except that we have 4 rounding constants : \begin{itemize} \item 1.0047 when $i<10$ \item 1.000068 when $i\geq10$ \item 1.0024 when $x>2^{-10}$ \item 1.0000132 when $x<2^{-10}$ \end{itemize} \section{Accurate phase} The accurate phase is the same as the quick phase, except that number are scs and not double. The intervals are the same as in quick phase. The only difference is that $\arctan(b_i)$ as a third double to improve the precision of $\arctan(b_i)$ to 150 bits. Then we use less memory, that is why we can use the same intervals as in the quick phase. The polynomial degree is 19 in order to have 136 bits of precision. \begin{equation} \arctan(x) \approx x-\frac{1}{3}.x^3+\frac{1}{5}.x^5-\frac{1}{7}.x^7+\frac{1}{9}.x^9-\frac{1}{11}.x^{11}+\frac{1}{13}.x^{13}-\frac{1}{15}.x^{15}+\frac{1}{17}.x^{17}-\frac{1}{19}.x^{19} \label{eq:arctan_scspoly} \end{equation} \section{Analysis of the performance} \subsection{Speed} Table \ref{tbl:arctan_abstime} (produced by the \texttt{crlibm\_testperf} executable) gives absolute timings for a variety of processors. The test computed 50000 atan in rounding to nearest mode. The second step of \texttt{crlibm} was taken 1 time on 50000. \begin{table}[!htb] \begin{center} \renewcommand{\arraystretch}{1.2} \begin{tabular}{|l|r|r|r|} \hline \hline \multicolumn{4}{|c|}{Pentium 4 Xeon / Linux Debian / gcc 2.95} \\ \hline & min time & max time & avg time \\ \hline & min time & max time & avg time \\ \hline \texttt{libm} & 180 & 344 & 231 \\ \hline \texttt{mpfr} & 417016 & 3956992 & 446362 \\ \hline \texttt{libultim} & 48 & 257616 & 189 \\ \hline \texttt{crlibm} & 36 & 46428 & 381 \\ \hline \hline \multicolumn{4}{|c|}{PowerPC G4 / MacOS X / gcc2.95} \\ \hline & min time & max time & avg time \\ \hline \texttt{libm} & 6 & 11 & 9 \\ \hline \texttt{mpfr} & 35291 & 303019 & 37022 \\ \hline \texttt{libultim} & 7 & 13251 & 14 \\ \hline \texttt{crlibm} & 5 & 1037 & 19 \\ \hline \hline \end{tabular} \end{center} \caption{Absolute timings for the inverse tangent (arbitrary units) \label{tbl:arctan_abstime}} \end{table} \subsection{Memory requirements} Table size is \begin{itemize} \item for the \quick\ phase, $62\times (1+1+2) \times8=1984$ bytes for the 62 $a_i$, $b_i$, $\arctan(b_i)$ (hi and lo), plus another $8$ bytes for the rounding constant, plus $4\times8$ for the polynomial, $8$ bytes for $\frac{\pi}{2}$ and $64$ for the rounding constants or $2096$ bytes in total. \item for the \accurate\ phase, we just have $10$ SCS constants for the polynomial, and 62 other double for $\arctan(b_i)_{lo_{lo}}$. If we add all : $10*11*8 + 62*8 = 1376$ \end{itemize} If we add the fast phase and the acurate one, we have a total of 3472 bytes. \section{Conclusion and perspectives} Our $\arctan$ is reasonably fast. Libultim is faster but requires ten times more memory (241 polynomials of degree 7 and 241 of degree 16 that represents more than 40KB !). Instead, our argument reduction performs a division, which is an expensive operation. To improve performances we could inline the code of \texttt{atan\_quick}, but we prefer to keep it as it is in order to ease the evolution of the algorithm. The main problem of our $\arctan$ is the worst case time which is about 100 times slower than the average time. Thus to improve performances we could try to use double-extended. A double-extended has a mantissa of 64 bits which could transform all double-double operation in double-extended operation. This format number is present in most of the Intel recent processors. %%% Local Variables: %%% mode: latex %%% TeX-master: "crlibm" %%% End: interval-2.1.0/src/crlibm/docs/latex/crlibm.tex0000644000000000000000000002152113031036767017571 0ustar 00000000000000\documentclass[a4paper,pdftex]{book} \usepackage{fullpage} %\usepackage{isolatin1} \usepackage{graphicx} \usepackage{mathpazo} \usepackage{listings} \usepackage{longtable} %pour les preuves des programmes \usepackage{lscape} % pour le mode landscape \usepackage{makeidx} \usepackage{color} \usepackage{amstext,url,latexsym,amsfonts,amssymb,amsmath,amsthm} \usepackage{hyperref} \newtheorem{example}{Example} \newtheorem{theorem}{Theorem} \newtheorem{algorithm}{Algorithm} \newtheorem{propriete}{Property} \DeclareMathOperator{\sinpi}{sinpi} \DeclareMathOperator{\cospi}{cospi} \DeclareMathOperator{\tanpi}{tanpi} \DeclareMathOperator{\asinpi}{asinpi} \DeclareMathOperator{\acospi}{acospi} \DeclareMathOperator{\atanpi}{atanpi} \DeclareMathOperator{\arccosh}{arccosh} \newcommand{\pref}[1]{$<$\ref{#1}$>$} \newcommand{\quick}{{quick}} \newcommand{\accurate}{{accurate}} \newcommand{\ulp}{\mbox{ulp}} \newcommand{\crlibm}{\texttt{crlibm}} \newcommand{\scslib}{\texttt{scslib}} \renewcommand{\epsilon}{\varepsilon} \newcommand{\round}{\circ} \newcommand{\roundup}{\bigtriangleup} \newcommand{\rounddown}{\bigtriangledown} \newcommand{\intpart}[1]{\left\lceil #1 \right\rfloor} \newcommand{\maxv}[1]{{\overline{#1}}} \newcommand{\maxx}{\maxv{x}} \newcommand{\maxeps}{\maxv{\epsilon}} \newcommand{\maxdelta}{\maxv{\delta}} \newcommand{\maxz}{{\overline{z}}} \newcommand{\maxs}[1]{\overline{s}_{#1}} \newcommand{\mins}[1]{\underline{s}_{#1}} \newcommand{\maxp}{\overline{|P|}} \newcommand{\minp}{\underline{|P|}} \newcommand{\infnorm}[1]{||{#1}||^{\infty}} \newcommand{\abserr}[1]{\delta_{\mathrm{#1}}} \newcommand{\relerr}[1]{\epsilon_{\mathrm{#1}}} \newcommand{\maxabserr}[1]{\maxv{\delta}_{\mathrm{#1}}} \newcommand{\maxrelerr}[1]{\maxv{\epsilon}_{\mathrm{#1}}} \newcommand{\N}{\ensuremath{\mathbb {N}}} \newcommand{\Z}{\ensuremath{\mathbb {Z}}} \newcommand{\F}{\ensuremath{\mathbb {F}}} \newcommand{\R}{\ensuremath{\mathbb {R}}} \newcommand{\hi}{\ensuremath{\mathit{h}}} \newcommand{\mi}{\ensuremath{\mathit{m}}} \newcommand{\lo}{\ensuremath{\mathit{l}}} \newcommand{\E}{\ensuremath{\mathcal{E}}} \newcommand{\Add}{{\bf Add12}} \newcommand{\AddDD}{{\bf Add22}} \newcommand{\AddDTT}{{\bf Add233}} \newcommand{\AddDTTCond}{{\bf Add233Cond}} \newcommand{\AdddTT}{{\bf Add133}} \newcommand{\AddTT}{{\bf Add33}} \newcommand{\MulDT}{{\bf Mul23}} \newcommand{\Mul}{{\bf Mul12}} \newcommand{\MulDD}{{\bf Mul22}} \newcommand{\MulDTT}{{\bf Mul233}} \newcommand{\MuldTT}{{\bf Mul133}} \newcommand{\MuldDD}{{\bf Mul122}} \newcommand{\MuldDT}{{\bf Mul123}} \newcommand{\MulTT}{{\bf Mul33}} \newcommand{\MulAddDdD}{{\bf MulAdd212}} \newcommand{\MulAddDD}{{\bf MulAdd22}} \newcommand{\SqrtD}{{\bf sqrt12}} \newcommand{\SqrtT}{{\bf sqrt13}} \newcommand{\Renormalize}{{\bf Renormalize3}} \newcommand{\mAdd}{\ensuremath{\mathbf{Add12}}} \newcommand{\mAddDD}{\ensuremath{\mathbf{Add22}}} \newcommand{\mAddDTT}{\ensuremath{\mathbf{Add233}}} \newcommand{\mAddDTTCond}{\ensuremath{\mathbf{Add233Cond}}} \newcommand{\mAdddTT}{\ensuremath{\mathbf{Add133}}} \newcommand{\mAddTT}{\ensuremath{\mathbf{Add33}}} \newcommand{\mMul}{\ensuremath{\mathbf{Mul12}}} \newcommand{\mMulDD}{\ensuremath{\mathbf{Mul22}}} \newcommand{\mMulDT}{\ensuremath{\mathbf{Mul23}}} \newcommand{\mMulDTT}{\ensuremath{\mathbf{Mul233}}} \newcommand{\mMuldTT}{\ensuremath{\mathbf{Mul133}}} \newcommand{\mMuldDD}{\ensuremath{\mathbf{Mul122}}} \newcommand{\mMuldDT}{\ensuremath{\mathbf{Mul123}}} \newcommand{\mMulAddDdD}{\ensuremath{\mathbf{MulAdd212}}} \newcommand{\mMulAddDD}{\ensuremath{\mathbf{MulAdd22}}} \newcommand{\mUlp}{\ensuremath{\mathrm{ulp}}} \newcommand{\nan}{\ensuremath{\mathrm{NaN}}} \newcommand{\sgn}{\ensuremath{\mathrm{sgn}}} \renewcommand{\succ}{\ensuremath{\mathrm{succ}}} \newcommand{\pred}{\ensuremath{\mathrm{pred}}} \newcommand{\xor}{\ensuremath{\mbox{ }\mathrm{XOR}\mbox{ }}} \newcommand{\Ord}{\ensuremath{\mathcal{O}}} %\newcommand{\deltapprox}{\delta_{\mathrm{approx}}} %\newcommand{\deltaround}{\delta_{\mathrm{round}}} % Environnement pour disposer de proprit `` la leslie lamport'' \newcounter{propexp} % reset propexp chaque chapitre \newenvironment{prop} {\begin{trivlist}\refstepcounter{propexp}\item[\hbox to 0pt{\spring {\bf $<$\arabic{propexp}$>$}}]} {\ifvmode\smallskip\fi$\bullet$\end{trivlist}} % Dfinition de l'environnement proof \def\spring{\hskip 0pt minus 1fil} \def\@yproof[#1]{\@proof{ #1}} \def\@proof#1{\begin{trivlist}\item[\hbox to 0pt{\spring $\diamond$}] \emph{Proof#1. }} \newenvironment{preuve} {\@proof{}}{\hfill\null\hfill$\square$\end{trivlist}} % Definition des options pour le packages listings \lstset{numbers=left, numberstyle=\tiny, stepnumber=1, numbersep=5pt, lineskip=-1pt, extendedchars=true, basicstyle=\footnotesize, breaklines, showstringspaces=false, frame=single, language={[ANSI]C}, firstnumber=last, escapeinside={(*@}{@*)} } \title{CR-LIBM\\A library of correctly rounded elementary functions in double-precision} \author{\mbox{Catherine Daramy-Loirat}, \mbox{David Defour}, \mbox{Florent~de~Dinechin},\\ \mbox{Matthieu Gallet}, \mbox{Nicolas Gast}, \mbox{Christoph Quirin Lauter}, \mbox{Jean-Michel Muller}} %% \abstract{ %% CRLibm is a mathematical library with correct rounding in %% double-precision in the four IEEE-754 rounding modes. This report %% explains the code and proves the correct rounding property. %% } %% \RRIresume{% %% CRLibm est une bibliothque mathmatique offrant l'arrondi correct %% en double prcision selon les quatre modes d'arrondi. Ce rapport %% dtaille les algorithmes utiliss et prouve fonction par fonction la %% proprit d'arrondi correct. %% }% %% \RRIkeywords{elementary functions, correct rounding, IEEE-754, double precision} %% \RRImotscles{fonctions lmentaires, arrondi correct, IEEE-754, double prcision} %% \RRItheme{2} %% \RRIprojet{Arnaire} %% \RRIinria{\RRnote{% %% This text is also available as a research report of the %% Laboratoire de l'Informatique du Paralllisme {\tt %% http://www.ens-lyon.fr/LIP}. %% }}% \begin{document} \maketitle \section*{Important warning} This report describes and proves version \input{../../VERSION} of the \texttt{crlibm} library. It may therefore not correspond to the latest version. An up-to-date version will always be distributed along with the code. \vfill \section*{Many thanks to...} \begin{itemize} \item Vincent Lef\`evre, from \textsc{Inria}-Lorraine, without whom this project would't have started, and who has since then lended a helpful hand in more than 17 occasions; \item The Ar\'enaire project at ENS-Lyon, especially Marc Daumas, Sylvie Boldo, Guillaume Melquiond, Nathalie Revol and Arnaud Tisserand; \item Guillaume Melquiond for Gappa and its first-class hotline; \item The MPFR developers, and especially the \textsc{Inria} \textsc{Spaces} project; \item The Intel Nizhniy-Novgorod Lab, especially Andrey Naraikin, Sergei Maidanov and Evgeny Gvozdev; \item The contributors of bits and pieces, Phil Defert and Eric McIntosh from CERN, Patrick Pelissier from \textsc{Inria}; \item All the people who have reported bugs, hoping that they continue until they have to stop: Evgeny Gvozdev from Intel with special thanks, Christoph Lauter from TUM\"unchen (before he joined the project), Eric McIntosh from CERN, Patrick Pelissier and Paul Zimmermann from \textsc{Inria} Lorraine; \item William Kahan at UCBerkeley, Peter Markstein at HP, Neil Toda at Sun, Shane Story at Intel, and many others for interesting and sometimes heated discussions; \item Serge Torres for LIPForge. \end{itemize} This work was partly funded by the \textsc{Inria}, the ENS-Lyon and the Universit\'e de Perpignan. \tableofcontents \addtocounter{chapter}{-1} \chapter{Getting started with crlibm} \input{0_getting-started.tex} \chapter{Introduction: Goals and methods \label{chap:intro}} \input{0_intro.tex} \chapter{Common notations, theorems and procedures \label{chap:common}} \input{1_common.tex} \chapter{The natural logarithm \label{chap:log}} \input{log.tex} \chapter{The logarithm in base 2 \label{chap:log2}} \input{log2.tex} \chapter{The logarithm in base 10 \label{chap:log10}} \input{log10.tex} \chapter{The exponential \label{chap:exp}} \input{exp.tex} \chapter{The \texttt{expm1} function\label{chap:expm1}} \input{expm1.tex} \chapter{The \texttt{log1p} function\label{chap:log1p}} \input{log1p.tex} \chapter{The trigonometric functions \label{chap:trigo}} \input{trigo.tex} \chapter{The arcsine \label{chap:asin}} \input{asin.tex} \chapter{The arccosine \label{chap:acos}} \input{acos.tex} \chapter{The arctangent \label{chap:atan}} \input{atan.tex} \chapter{The trig-of-$\pi x$ functions \label{chap:trigpi}} \input{trigpi.tex} \chapter{The hyperbolic sine and cosine \label{chap:csh}} \input{csh.tex} \chapter{The power function \label{chap:pow}} \input{pow.tex} \appendix \bibliographystyle{plain} \bibliography{elem-fun} \end{document} interval-2.1.0/src/crlibm/docs/latex/csh.tex0000644000000000000000000007041613031036767017105 0ustar 00000000000000This chapter was initially contributed by Matthieu Gallet under the supervision of F. de~Dinechin. The accurate phase was rewritten by Ch. Q. Lauter and F. de~Dinechin. \section{Overview} Like the algorithms for others elementary functions, we will compute our hyperbolic cosine and sine in one or two steps. The first one, which is called 'fast step' is always executed and provides a precision of about 63 bits. This is a sufficient precision in most cases, but sometimes more precision is needed, and then we enter the second step using the SCS library. \subsection{Definition interval and exceptional cases} The hyperbolic cosine and the hyperbolic sine are defined for all real numbers, and then for all floating point numbers. These functions are divergent toward $+\infty$ and $-\infty$, so for $|x| > 710.47586007$, $\cosh(x)$ and $\sinh(x)$ should return $+\infty$ or the greatest representable number (depending ot the choosen rounding mode). \begin{itemize} \item If $x = NaN$ , then $\sin(x)$ and $\cosh(x)$ should return $NaN$ \item If $x = +\infty$ , then $\cosh(x)$ and $\sinh(x)$ should return $+\infty$. \item If $x = -\infty$ , then $\cosh(x)$ should return $+\infty$. \item If $x = -\infty$ , then $\sinh(x)$ should return $-\infty$. \end{itemize} This is true in all rounding modes. Concerning subnormals, $\cosh(x) \geq 1$, so $\cosh(x)$ can't return subnormal numbers, even for subnormal inputs. For small inputs ($|x| \leq 2^{-26}$), we have $\sinh(x) = x$ with 80 bits of precision, so we can return a result without any computation on subnormals. \subsection{Relation between $\cosh(x)$, $\sinh(x)$ and $e^x$} The hyperbolic sine and cosine are defined by $$\sinh(x) = \frac{e^x - e^{-x}}{2}$$ and $$\cosh(x) = \frac{e^x + e^{-x}}{2}$$ respectively. For large arguments, we will be able to neglect the smaller term. \begin{itemize} \item $e^{-x}<2^{-65}e^x$ as soon as $x>23$ (this is the target precision of the first step) \item $e^{-x}<2^{-115}e^x$ as soon as $x>40$ (this is the target precision of the second step) \end{itemize} Note that this has been used in the search for worst cases, too: knowing that correct rounding of \texttt{exp} requires at most $2^{-113}$ accuracy for $x>2^{-30}$, and the division by 2 being exact, we deduce that the worst cases for $\sinh$ and $\cosh$ will be those of the exponential for all the input values greater than 40. However, due to the division by 2, the domain of $\sinh$ and $\cosh$ is slightly larger than that of exp, so there is a little additional search to do (precisely between 709.78 and 710.75). For the same reason, this additional search gives worst cases for both $\sinh$ and $\cosh$. \subsection{Worst cases for correct rounding} The search for the worst-case accuracy required for correct rounding the hyperbolic sine and cosine and their inverses is completed. The $\cosh$ function require a relative accuracy of $2^{-142}$ in the worst case, while $\sinh$ requires $2^{-126}$. However, for $x>2^{-12}$, both functions require only $2^{-111}$. \section{Quick phase} \subsection{Overview of the algorithm} The algorithm consists of two argument reduction using classical formulae of hyperbolic trigonometry, followed by a polynomial evaluation using a Taylor polynom of degree $6$ (for $\cosh$) and $7$ (for $\sinh$). These formulaes are: \begin{itemize} \item $\sinh(x + y) = \sinh(x) \cosh(y) + \sinh(y) \cosh(x)$ \item $\cosh(x + y) = \cosh(x) \cosh(y) + \sinh(x) \sinh(y)$ \item $\cosh(k\ln(2)) = 2^{k-1} + 2^{-k-1}$ \item $\sinh(k\ln(2)) = 2^{k-1} - 2^{-k-1}$ \end{itemize} After having treated special cases ($NaN$, $+\infty$, $-\infty$), we do a first range reduction to reduce the argument between $\frac{-ln(2)}{2}$ and $\frac{ln(2)}{2}$. So, we write $x = k\ln(2) + y$, where k is given by rounding to the nearest integer $x \frac{1}{ln(2)}$. Now, $\frac{-ln(2)}{2} \leq y \leq \frac{ln(2)}{2}$, but it is even too large to have a sufficient precision during polynomial evaluation with small polynoms, and we do a second range reduction, by writing $y = a + b$, where $a = index . 2^{-8}$ (index is an integer) and $|b| \leq 2^{-9}$. Mathematically, we have: $$\sinh(x) = (2^{k-1} + 2^{-k-1})\sinh(y) + (2^{k-1} - 2^{-k-1}) \cosh(y)$$ and $$\cosh(x) = (2^{k-1} + 2^{-k-1})\cosh(y) + (2^{k-1} - 2^{-k-1}) \sinh(y)$$ The second range reduction allows to compute $\sinh(y)$ and $\cosh(y)$ as $\sinh(y) = \sinh(a) \cosh(b) + \sinh(b) \cosh(a)$ and $\cosh(y) = \cosh(a) \cosh(b) + \sinh(a) \sinh(b)$. In the C code, we have $ch\_hi + ch\_lo \approx \cosh(y)$ and $sh\_hi + sh\_lo \approx \sinh(y)$. A quick computation shows that $-89 \leq index \leq 89$, and we can pre-compute so few values of $\sinh(a)$ and $\cosh(a)$ and store them in a table as double-doubles. The constants $2^{k-1}$ and $2^{-k-1}$ are constructed by working directly on their binary representation. $\cosh(b)$ and $\sinh(b)$ are computed with Taylor polynoms. It's well-known that $$\cosh(b) = \sum_{n \geq 0}{\frac{x^{2n}}{(2n)!}}$$ and $$\sinh(b) = \sum_{n \geq 0}{\frac{x^{2n+1}}{(2n+1)!}}$$ For our needs, a degree $6$ polynom for cosh and a degree $7$ polynom for sinh give enough accuracy. We write $\cosh(b) = 1 + tcb$ and $\sinh(b) = b(1 + tsb)$, where $$tcb = b^{2} (\frac{1}{2} + b^{2}(\frac{1}{24} + b^{2} \frac{1}{720}))$$ $$tsb = b^{2} (\frac{1}{6} + b^{2} (\frac{1}{120} + b^{2} \frac{1}{5040}))$$ We use the Horner scheme for the evaluation of the polynoms, with all the coefficients being coded on double-precision numbers. If the input is very small (i.e. $|b| \leq 2^{-40}$), $tsb$ and $tcb$ are not calculated but directly set to $0$, to avoid any problem with subnormal numbers. At this stage, we have computed all the needed sub-terms before the final reconstruction, which is done in two steps, corresponding to the two-step range-reduction. The reconstruction is computed in double-double arithmetic. In the first reconstruction, some sub-terms can be ignored without any loss of precision, due to their very small relative values. For this step, it exists a particular case, when $index = 0$, since it is the only case where $|\sinh(a)| < 2^{-9}$ ($\sinh(a) = 0$). Now we have the definitive values of $\cosh(y)$ and $\sinh(y)$. In the second reconstruction, we begin by computing all needed products before adding their results (i.e. $2^{k-1}\cosh(y)$, $2^{k-1}\sinh(y)$,...). Computations are also done using double double arithmetics, with the Add22 function. \subsection{Error analysis} Many of the previous computations can introduce some error. \begin{itemize} \item{First range reduction} We have to consider two different cases: \begin{itemize} \item{$|x| \leq \frac{ln(2)}{2}$} We have $k = 0$, and there is no reduction, and no term of error. \item{$|x| > \frac{ln(2)}{2}$} We have $k \neq 0$, and we must compute the term of error introduced by the range reduction. Since $k$ is an integer, we can assume that there is no error on it. $ln(2)$ is a constant which is stored in the function in double-double, and we have $ln(2) = ln2_{hi} + ln2_{lo} + \maxabserr{repr\_ln2}$, where $|\maxabserr{repr ln2}| \leq 1.94e-31$. The total absolute error of this reduction is $\maxabserr{range\_reduc} = 3.437e-27$, so the maximum relative error is $\maxrelerr{range\_reduc} = 9.9e-27$ (we have $|x| \geq 0.36$), and that represents about $86.38$ bits of precision. \end{itemize} \item{Second range reduction} This range reduction is exact (we only cut y in two parts, with no multiplication nor division), so no new term of error is introduced. \item{Error in tabulation} Since $\cosh(a)$ and $\sinh(a)$ are stored as double-doubles, and since they are transcendental numbers (when $a \neq 0$), some error is done on their approximation. A simple Maple procedure can compute this error, which is about $\maxabserr{ca} = 6.08e-33$ for cosh and $\maxabserr{sa} = 1.47e-33$ for sinh. That is large overkill compared to precision on other values. \item{Error in polynomial approximations} We use the $errlist\_quickphase$ and $compute\_horner\_rounding\_error$ Maple procedures to compute thes errors on $tcb$ and $tsb$, which are $\maxabserr{rounding\_cosh} = 6.35e-22$ and $\maxabserr{rounding\_sinh} = 1.94e-22$. Then there is the approximation error. The sum of theses errors gives $\maxabserr{tcb} = 6.35e-22$ and $\maxabserr{tsb} = 1.11e-21$. \item{First reconstruction} This reconstruction is done by adding all the pre-calculated terms ($tcb$, $tsb$, $ca = \cosh(a)$, $sa = \sinh(a)$), in an order which try to minimize the total error.$\maxabserr{sh} = 2.10e-25$. Maple scripts are used to compute the error, since there are many terms. There are 2 different cases: \begin{itemize} \item{$a = 0$} $ch_{hi}+ch_{lo} = \widehat{\cosh(\widehat{y})} + \abserr{cosh0}$, where $|\abserr{cosh0}| \leq \maxabserr{cosh0} = 6.35e-22$, and $\sinh(y) = \widehat{\sinh(\widehat{y})} + \abserr{sinh0}$, where $|\abserr{sinh0}| \leq \maxabserr{sinh0} = 5.4e-20$. \item{$a \neq 0$} $ch_{hi}+ch_{lo} = \widehat{\cosh(\widehat{y})} + \abserr{cosh1}$, where $|\abserr{cosh1}| \leq \maxabserr{cosh1} = 2.39e-20$, and $\sinh(y) = \widehat{\sinh(\widehat{y})} + \abserr{sinh1}$, where $|\abserr{sinh1}| \leq \maxabserr{sinh1} = 1.09e-22$. \end{itemize} \item{Second reconstruction} This reconstruction is based on multiplying the obtained results before adding them. The products are exact since each product has a factor which a power of 2. We have to leave absolute errors for relative errors, since the range of values returned by $\cosh$ is too large. We will distinguish three different cases: \begin{itemize} \item{$|k| \leq 35$} All terms must be computed. We have $ch_{hi} + ch_{lo} = \widehat{\cosh(\widehat{x})}(1+\relerr{ch})$, where $|\relerr{ch}| \leq \maxrelerr{ch} = 7.66e-19$ \item{$k > 35$} In this case, the terms corresponding to $e^{-x}$ are neglected, with an error smaller than $2^{-68}$. We have $ch_{hi} + ch_{lo} = \widehat{\cosh(\widehat{x})}(1+\relerr{ch})$, where $|\relerr{ch}| \leq \maxrelerr{ch} = 7.69e-19$ \item{$k < -35$} This case is symmetric to the previous one, we just have to remplace k by -k. \end{itemize} \end{itemize} \subsection{Details of computer program} The procedures \texttt{cosh\_quick} and \texttt{sinh\_quick} contain the computation respectively shared by the functions \texttt{cosh\_rn}, \texttt{cosh\_ru}, \texttt{cosh\_rd} and \texttt{cosh\_rz} in one hand, and by the functions \texttt{sinh\_rn}, \texttt{sinh\_ru}, \texttt{sinh\_rd} and \texttt{sinh\_rz} in the other hand. The eight functions \texttt{cosh\_rX} and \texttt{sinh\_rX} call \texttt{cosh\_quick} or \texttt{sinh\_quick} with an integer which represent the choosen rounding mode. We will begin to prove the cosh function, and then we will prove the sinh function. Since both functions share a lot a code, only the different part between cosh and sinh will be proven for the sinh. \subsubsection{Exceptional cases and argument reduction} This part is shown for \texttt{cosh\_rn}, but it is quite identical for the three other functions. \begin{lstlisting}[caption={Exceptional cases},firstnumber=1] double cosh_rn(double x){ db_number y; y.d = x; y.i[HI] = y.i[HI] & 0x7FFFFFFF; /* to get the absolute value of the input */ if (y.d > max_input_ch.d) { /* out of range */ y.i[LO] = 0; y.i[HI] = 0x7FF00000; return (y.d); } if ((y.i[HI] & 0x7FF00000) >= (0x7FF00000)) { /*particular cases : QNaN, SNaN, +- oo*/ return (y.d); } return(cosh_quick(x, RN)); } \end{lstlisting} \begin{tabular}{ll} Lines 3 & Initialize y\\ Line 4 & Get the absolute value of y by removing the first bit.\\ Line 5 & Test if $\cosh(|x|) = \cosh(x)$ is representable as a double.\\ Line 6 & If this test is true, we must return $\infty$.\\ Line 8 & Test if $|x|$ is a special case, like NaN or $\infty$\\ Line 9 & If this test is true, we must return $|x|$ \\ Line 11 & $x$ is a correct input, we can return cosh\_quick. \\ \end{tabular} \subsubsection{Procedure cosh\_quick} \begin{lstlisting}[caption={Procedure \texttt{cosh\_quick} - variables},firstnumber=1] double cosh_quick(double x, int rounding_mode){ /*some variable declarations */ int k; db_number y; double res_hi, res_lo; double ch_hi, ch_lo, sh_hi, sh_lo;/* cosh(x) = (ch_hi + ch_lo)*(cosh(k*ln(2)) + (sh_hi + sh_lo)*(sinh(k*ln(2))) */ db_number table_index_float; int table_index; double temp_hi, temp_lo, temp;/* some temporary variables */ double b_hi, b_lo,b_ca_hi, b_ca_lo, b_sa_hi, b_sa_lo; double ca_hi, ca_lo, sa_hi, sa_lo; /*will be the tabulated values */ double tcb_hi, tsb_hi; /*results of polynomial approximations*/ double square_y_hi; double ch_2_pk_hi, ch_2_pk_lo, ch_2_mk_hi, ch_2_mk_lo; double sh_2_pk_hi, sh_2_pk_lo, sh_2_mk_hi, sh_2_mk_lo; db_number two_p_plus_k, two_p_minus_k; /* 2^(k-1) + 2^(-k-1) */ db_number absyh, absyl, u53, u; \end{lstlisting} Here there are all the variables which will be used in the code. \subsubsection{First range reduction} \begin{lstlisting}[caption={Procedure \texttt{cosh\_quick} - first range reduction},firstnumber=19] /* Now we can do the first range reduction*/ DOUBLE2INT(k, x * inv_ln_2.d) if (k != 0){ /* b_hi+b_lo = x - (ln2_hi + ln2_lo) * k */ temp_hi = x - ln2_hi.d * k; temp_lo = -ln2_lo.d * k; Add12Cond(b_hi, b_lo, temp_hi, temp_lo); } else { b_hi = x; b_lo = 0.; } \end{lstlisting} \begin{tabular}{ll} Line 20 & Put in k the closest integer of x * inv\_ln\_2. \\ & We use the property of DOUBLE2INT that convert a floating-point number in rouding to nearest mode. \\ & By its definition, $k$ satisfies the following properties:\\ & $\lfloor x \times inv\_ln2 \rfloor \leq k \leq \lceil x \times inv\_ln2\rceil$ \\ & $|k| \leq \frac{x}{2} \times inv\_ln2$ \\ & since $|x| \leq 710.475...$, we have $|k| \leq 1025$, so $k$ is coded on at most 11 bits. \\ Line 21 & First case : $k \neq 0$ \\ & We have by contruction : $ln2_{hi} + ln2_{lo} = \ln(2) + \abserr{repr\_ln2}$, where $|\abserr{repr\_ln2}| \leq \maxabserr{repr\_ln2} = 1.95e-31$.\\ & the last 11 bits of $ln_{hi}$ are set to zero by its construction \\ Line 22 & the $ln2_{hi} k$ product is exact since $k$ is coded on at most 11 bits and the last 11 bits of $ln2_{hi}$ are zeros \\ & we have to use the properties verified by $k$: $x inv\_ln2 - 1 \leq k \leq x inv\_ln2 + 1$\\ & if $x \geq 0$ \\ & we have $ k \geq 1$ and then $x \geq \frac{\ln(2)}{2}$, so $(x inv\_ln2 + 1)ln2_{hi} \leq 2 x$\\ & since $|k| \leq \frac{x}{2} \times inv\_ln2$, we have $\frac{x}{2} \leq (x inv\_ln2 - 1)ln2_{hi}$\\ & and then we have $\frac{x}{2} \leq k ln2_{hi} \leq 2 x$\\ & we can apply the Sterbenz theorem to prove that the result of this line is exact\\ & if $x \leq 0$\\ & we can use the same reasoning and then apply the Sterbenz theorem\\ & and this line of code is always exact. \\ Line 23 & this product is not exact, we can loose at most 11 bits of precision\\ & there is an error of $\abserr{round}$ which satisfies $|\abserr{round}|\leq \maxabserr{round} = 3.15e-30$ on $ln2_{lo}$ \\ & so a bound to the maximal absolute error is $k_{max} \maxabserr{round}$\\ Line 24 & We do an Add12 to have well-aligned double doubles in $b_{hi}$ and $b_{lo}$\\ & The conditionnal version is used since temp\_hi can be zero if $x$ is very close to $k ln(2)$.\\ & The total absolute error is bounded by $\maxabserr{b} = 3.43e-27$ \\ Line 27 & We have $k = 0$. We needn't to do any reduction, so $b_{hi} + b_{lo} = x$ exactly.\\ \end{tabular} At this stage, we have $b_{hi} + b_{lo} = \widehat{y} + \abserr{b}$, where $|\abserr{b}| \leq \maxabserr{b} = 3.43e-24$. Now we will write $y = a + b$, where $a = 2^{-8} index$. \subsubsection{Second range reduction} \begin{lstlisting}[caption={Procedure \texttt{cosh\_quick} - second range reduction},firstnumber=29] /*we'll construct 2 constants for the last reconstruction */ two_p_plus_k.i[LO] = 0; two_p_plus_k.i[HI] = (k-1+1023) << 20; two_p_minus_k.i[LO] = 0; two_p_minus_k.i[HI] = (-k-1+1023) << 20; /* at this stage, we've done the first range reduction : we have b_hi + b_lo between -ln(2)/2 and ln(2)/2 */ /* now we can do the second range reduction */ /* we'll get the 8 leading bits of b_hi */ table_index_float.d = b_hi + two_43_44.d; /*this add do the float equivalent of a rotation to the right, since -0.5 <= b_hi <= 0.5*/ table_index = LO(table_index_float.d);/* -89 <= table_index <= 89 */ table_index_float.d -= two_43_44.d; table_index += bias; /* to have only positive values */ b_hi -= table_index_float.d;/* to remove the 8 leading bits*/ /* since b_hi was between -2^-1 and 2^1, we now have b_hi between -2^-9 and 2^-9 */ \end{lstlisting} \begin{tabular}{ll} Line 30-33 & Put in \texttt{two\_p\_plus\_k} and \texttt{two\_p\_minus\_k} the exact values of $2^{k-1}$ and $2^{-k-1}$.\\ Line 38-44 & The goal of the second range reduction is to write $y$ as $y = index 2^{-8} + b$ \\ & We have $|y| \leq \frac{ln(2)}{2} \leq \frac{1}{2}$ \\ & so $2^{44} \leq 2^{44} + 2^{43} + y \leq 2^{44} + 2^{43} + 2^{42}$ \\ & since the mantissa counts 53 bits, only the part above $2^{-8}$ si kept in table\_index\_float\\ & It is easy to show that we have $-89 \leq table\_index \leq 89$ \\ & so we can add $bias = 89$ to $table\_index$ to have only positive values. \\ & then we remove this bits of $y$ to obtain the final $b = b_{hi} + b_{lo}$ \\ & all these operations are exact, so the final absolute error doesn't increase \\ \end{tabular} \subsubsection{Polynomial evaluation - First reconstruction} \begin{lstlisting}[caption={Procedure \texttt{cosh\_quick} - polynomial evaluation - first reconstruction},firstnumber=45] y.d = b_hi; /* first, y */ square_b_hi = b_hi * b_hi; /* effective computation of the polynomial approximation */ if (((y.i[HI])&(0x7FFFFFFF)) < (two_minus_30.i[HI])) { tcb_hi = 0; tsb_hi = 0; } else { /* second, cosh(b) = b * (1/2 + b * (1/24 + b * 1/720)) */ tcb_hi = (square_b_hi)* (c2.d + square_b_hi * (c4.d + square_b_hi * c6.d)); tsb_hi = square_b_hi * (s3.d + square_b_hi * (s5.d + square_b_hi * s7.d)); } if( table_index != bias) { /* we get the tabulated the tabulated values */ ca_hi = cosh_sinh_table[table_index][0].d; ca_lo = cosh_sinh_table[table_index][1].d; sa_hi = cosh_sinh_table[table_index][2].d; sa_lo = cosh_sinh_table[table_index][3].d; /* first reconstruction of the cosh (corresponding to the second range reduction) */ Mul12(&b_sa_hi,&b_sa_lo, sa_hi, b_hi); temp = ((((((ca_lo + (b_hi * sa_lo)) + b_lo * sa_hi) + b_sa_lo) + (b_sa_hi * tsb_hi)) + ca_hi * tcb_hi) + b_sa_hi); Add12Cond(ch_hi, ch_lo, ca_hi, temp); /* first reconstruction for the sinh (corresponding to the second range reduction) */ } else { Add12Cond(ch_hi, ch_lo, (double) 1, tcb_hi); } \end{lstlisting} \begin{tabular}{ll} Line 45 & Put in $y$ the value of $b_{hi}$, so we can use its hexadecimal aspect \\ Line 47 & Put $b^2$ in $square\_b_{hi}$. We have $square\_b_{hi} = \widehat{b} + \abserr{square\_b}$, where $|\abserr{square\_b}| \leq \maxabserr{square\_b} = 4.23e-22$ \\ Line 50 & Match $b_{hi}$ and then $b$ with $2^{-40}$\\ Line 51-52 & If $|b| \leq 2^{-40}$, we will have $|tcb|,[tsb| \leq \maxabserr{square\_b}$, so we can directly set $tcb$ and $tsb$ to zero: \\ & converning the mathematical values, we have $|\widehat{tcb}|, |\widehat{tsb}| \leq 2^{-24}$. \\ & We can avoid by this way any problem with subnormal numbers. \\ Line 55-56 & Polynomial evaluation of $\cosh(x)-1$ and $\frac{\sinh(x)}{x}-1$, following the Hrner scheme. \\ & A maple procedure is used to compute the error on this computations\\ & There are 2 reasons for the total error :\\ & the effective computations, since all operations are done with 53 bits of precision.\\ & the mathematical approximation, since we use polynoms \\ & finally, we have $tcb = \widehat{\cosh(\widehat{b}-1)} + \abserr{tcb}$, where $|\abserr{tcb}| \leq \maxabserr{tcb} = 6.35e-22$, \\ & and $tsb = \widehat{(\frac{\sinh(\widehat{b})}{\widehat{b}}-1)} + \abserr{tsb}$, where $|\abserr{tsb}| \leq \maxabserr{tsb} = 1.11e-21$ \\ Line 60 & If $y$ is very close to $0$, we have the 8 bits of the second range reduction which are null \\ Line 62-65 & We get tabulated values for $\cosh(a)$ and $\sinh(a)$. They are tabulated as double doubles: \\ & we have $ca_{hi} + ca_{lo} = \widehat{\cosh(\widehat{a})} + \abserr{ca}$, where $|\abserr{ca}| \leq \maxabserr{ca} = 6.08e-33$, \\ & and $sa_{hi} + sa_{lo} = \widehat{\sinh(\widehat{a})} + \abserr{sa}$, where $|\abserr{sa}| \leq \maxabserr{sa} = 1.47e-33$, \\ Line 68 & $b\_sa_{hi} + b\_sa_{lo} = sa_{hi} b_{hi}$. This product is exact. \\ Line 69-70 & it is the reconstruction : $\cosh(y) = \cosh(a)(1+tcb) + \sinh(a)b(1+tsb)$ \\ & A maple procedure is used to compute the error done in this reconstruction. \\ & We have $ch_{hi}+ch_{lo} = \widehat{\cosh(\widehat{y})} + \abserr{cosh1}$, where $|\abserr{cosh1}| \leq \maxabserr{cosh1} = 2.39e-20$\\ Line 75 & If $y$ is very close to $0$, we have $a = 0$ and $\cosh(y) = \cosh(b) = 1 + tcb$. \\ & This addition is exact, so no error is introduced. \\ & We have $ch_{hi}+ch_{lo} = \widehat{\cosh(\widehat{y})} + \abserr{cosh0}$, where $|\abserr{cosh0}| \leq \maxabserr{cosh0} = 6.35e-22$\\ \end{tabular} \subsubsection{Second reconstruction} \begin{lstlisting}[caption={Procedure \texttt{cosh\_quick} - reconstruction},firstnumber=77] if(k != 0) { if( table_index != bias) { /* first reconstruction for the sinh (corresponding to the second range reduction) */ Mul12(&b_ca_hi , &b_ca_lo, ca_hi, b_hi); temp = (((((sa_lo + (b_lo * ca_hi)) + (b_hi * ca_lo)) + b_ca_lo) + (sa_hi*tcb_hi)) + (b_ca_hi * tsb_hi)); Add12(temp_hi, temp_lo, b_ca_hi, temp); Add22Cond(&sh_hi, &sh_lo, sa_hi, (double) 0, temp_hi, temp_lo); } else { Add12Cond(sh_hi, sh_lo, b_hi, tsb_hi * b_hi + b_lo); } if((k < 35) && (k > -35) ) { ch_2_pk_hi = ch_hi * two_p_plus_k.d; ch_2_pk_lo = ch_lo * two_p_plus_k.d; ch_2_mk_hi = ch_hi * two_p_minus_k.d; ch_2_mk_lo = ch_lo * two_p_minus_k.d; sh_2_pk_hi = sh_hi * two_p_plus_k.d; sh_2_pk_lo = sh_lo * two_p_plus_k.d; sh_2_mk_hi = -1 * sh_hi * two_p_minus_k.d; sh_2_mk_lo = -1 * sh_lo * two_p_minus_k.d; Add22Cond(&res_hi, &res_lo, ch_2_mk_hi, ch_2_mk_lo, sh_2_mk_hi, sh_2_mk_lo); Add22Cond(&ch_2_mk_hi, &ch_2_mk_lo , sh_2_pk_hi, sh_2_pk_lo, res_hi, res_lo); Add22Cond(&res_hi, &res_lo, ch_2_pk_hi, ch_2_pk_lo, ch_2_mk_hi, ch_2_mk_lo); } else if (k >= 35) { ch_2_pk_hi = ch_hi * two_p_plus_k.d; ch_2_pk_lo = ch_lo * two_p_plus_k.d; sh_2_pk_hi = sh_hi * two_p_plus_k.d; sh_2_pk_lo = sh_lo * two_p_plus_k.d; Add22Cond(&res_hi, &res_lo, ch_2_pk_hi, ch_2_pk_lo, sh_2_pk_hi, sh_2_pk_lo); } else /* if (k <= -35) */ { ch_2_mk_hi = ch_hi * two_p_minus_k.d; ch_2_mk_lo = ch_lo * two_p_minus_k.d; sh_2_mk_hi = -1 * sh_hi * two_p_minus_k.d; sh_2_mk_lo = -1 * sh_lo * two_p_minus_k.d; Add22Cond(&res_hi, &res_lo, ch_2_mk_hi, ch_2_mk_lo, sh_2_mk_hi, sh_2_mk_lo); } } else { res_hi = ch_hi; res_lo = ch_lo; } \end{lstlisting} \begin{tabular}{ll} Line 77 & Test if $k = 0$ or not \\ Line 78-87 & We have $k \neq 0$, so we must compute $\sinh(y)$ \\ & This computation is done like the computation of $\cosh(h)$ \\ & We can use an Add12 (instead of Add12Cond) since $b_{hi} ca_{hi} \geq temp$ \\ & A maple script gives $\sinh(y) = \widehat{\sinh(\widehat{y})} + \abserr{sinh1}$, where $|\abserr{sinh1}| \leq \maxabserr{sinh1} = 1.09e-22$ \\ & and $|\abserr{sinh1}| \leq \maxabserr{sinh0} = 5.4e-20$ (when $\sinh(a) = 0$) \\ Line 89 & We have $k\neq 0$, and $|k| \leq 35$ \\ Line 91-98 & we multiply $\sinh(y)$ and $\cosh(y)$ by powers of 2, so these products are exact \\ Line 100-102 & A maple script is used to compute the error: \\ & We have $ch_{hi} + ch_{lo} = \widehat{\cosh(\widehat{x})}(1+\relerr{ch})$, where $|\relerr{ch}| \leq \maxrelerr{ch} = 7.66e-19$ \\ Line 104 & $k \geq 35$ \\ Line 106-109 & we multiply $\sinh(y)$ and $\cosh(y)$ by powers of 2, so these products are exact \\ & Some terms are not computed, since they are too little \\ Line 110 & A maple script is used to compute the error: \\ & We have $ch_{hi} + ch_{lo} = \widehat{\cosh(\widehat{x})}(1+\relerr{ch})$, where $|\relerr{ch}| \leq \maxrelerr{ch} = 7.69e-19$ \\ Line 112 & $k \leq -35$ \\ Line 114-118 & this case is symmetric to the previous one. \\ & We also have $ch_{hi} + ch_{lo} = \widehat{\cosh(\widehat{x})}(1+\relerr{ch})$, where $|\relerr{ch}| \leq \maxrelerr{ch} = 7.69e-19$ \\ Line 121 & we now have $k = 0$ \\ & Since we have $1 \leq \cosh(x)$, we have $\maxrelerr{ch} \leq max(\maxabserr{cosh0},\maxabserr{cosh1}) = 2.39e-20$ \\ \end{tabular} At this, stage, we have $ch_{hi} + ch_{lo} = \widehat{\cosh(\widehat{x})}(1+\relerr{ch})$, where $|\relerr{ch}| \leq \maxrelerr{ch} = 7.69e-19 = 2^{-60.17}$ . \subsection{Rounding} \subsubsection{Rounding to the nearest} The code for rounding is strictly identical to that of Theorem~\ref{th:roundingRN1}. The condition to this theorem that $\mathtt{res\_hi}\ge 2^{-1022+53}$ is ensured by the image domain of the $\cosh$, since $\cosh(x) \geq 1$. The rounding constant \subsection{Directed rounding} Here again, the code is strictly identical to that of Theorem~\ref{th:roundingDirected}, and the conditions to this theorem are ensured by the image domain of the cosh. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{Accurate phase} It is reminded that correct rounding requires an intermediate accuracy of $2^{-142}$ for $\cosh$ and $2^{-126}$ for $\sinh$. The triple-double exponential function in \texttt{crlibm} is sufficiently accurate for computing the $\cosh$, using the equation $$\cosh(x) = \frac{e^x + e^{-x}}{2}\quad.$$ For $\sinh$, we use the \texttt{expm1} triple-double implementation: This is more accurate around $0$, as the following equation shows: $$\sinh(x) = \frac{e^x - e^{-x}}{2}\quad = \frac{(e^x-1) - (e^{-x}-1)}{2}\quad .$$ As already noted, the $e^{-x}$ term is optimised out for large arguments. Indeed, for $|x|>40$ we have $e^{-x}<2^{-115}e^x$, therefore the relative error due to neglecting $e^{-x}$ is much smaller than the worst case accuracy required to decide rounding, which is smaller than $2^{-111}$ for both functions in this range. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \section{Analysis of cosh performance} \label{section:cosh_results} The input numbers for the performance tests given here are random positive double-precision numbers with a normal distribution on the exponents. More precisely, we take random 63-bit integers and cast them into double-precision numbers. In average, the second step is taken in 0.13\% of the calls. \subsection{Speed} Table \ref{tbl:cosh_abstime} (produced by the \texttt{crlibm\_testperf} executable) gives absolute timings for a variety of processors and operating systems. \begin{table}[!htb] \begin{center} \renewcommand{\arraystretch}{1.2} \begin{tabular}{|l|r|r|r|} \hline \multicolumn{4}{|c|}{Pentium III / Linux 2.6 / gcc 4.0} \\ \hline \hline & min time & avg time & max time \\ \hline default \texttt{libm} & 242 & 272 & 304 \\ \hline \texttt{crlibm} & 212 & 344 & 2639 \\ \hline \hline \end{tabular} \end{center} \caption{Absolute timings for the hyperbolic cosine \label{tbl:cosh_abstime}} \end{table} Contributions to this table for new processors/OS/compiler combinations are welcome. %%% Local Variables: %%% mode: latex %%% TeX-master: "crlibm" %%% End: interval-2.1.0/src/crlibm/docs/latex/elem-fun.bib0000644000000000000000000012717713031036767020003 0ustar 00000000000000 @BOOK{Baker75, author = {A. Baker}, year = 1975, title = {Transcendental Number Theory}, publisher = {Cambridge University Press} } @Article{Ng1992, author = "K. C. Ng", title = "Argument Reduction for Huge Arguments: Good to the Last Bit", journal = "SunPro", day = "13", month = jul, year = "1992", bibdate = "Thu Sep 1 10:16:08 1994", bibsource = "ftp://garbo.uwasa.fi/pc/doc-soft/fpbibl18.zip", note = "Work in progress." } @TechReport{AMDoptim2001, author = {AMD}, title = {{AMD} Athlon Processor {x86} Code Optimization Guide}, institution = {Advanced Micro Devices,inc}, year = 2001 } @article{Car59, author = {Carr, J. W. }, journal = {Communications of the ACM}, number = 5, pages = {10-16}, title = {Error analysis in floating point arithmetic}, volume = 2, year = 1959, url = {http://delivery.acm.org/10.1145/370000/368329/p10-carr.pdf} } @InCollection{Gal86, author = {S. Gal}, title = {Computing elementary functions: A new approach for achieving high accuracy and good performance}, booktitle = {Accurate Scientific Computations, LNCS 235}, pages = {1-16}, publisher = {Springer Verlag}, year = 1986 } @ARTICLE{KarOfm62, author = {Karatsuba, A. and Ofman, Y.}, JOURNAL = {Doklady Akademii Nauk SSSR}, TITLE = {Multiplication of multidigit numbers on automata}, NUMBER = {2}, PAGES = {293-294}, VOLUME = {145}, YEAR = {1962}, CRINDEX = {Traduit} } @ARTICLE{Brent78, AUTHOR = {Richard P. Brent}, JOURNAL = {ACM Transactions on Mathematical Software}, NUMBER = 1, PAGES = {57-70}, TITLE = {A {Fortran} multiple-precision arithmetic package}, VOLUME = 4, YEAR = 1978 } @Article{Bernstein86, AUTHOR = {R. Bernstein}, TITLE = {Multiplication by Integer Constants}, JOURNAL = {Software -- Practice and Experience}, VOLUME = {16}, NUMBER = {7}, PAGES = {641--652}, MONTH = jul, YEAR = {1986} } @ARTICLE{DM94, AUTHOR = {Das Sarma, D. and Matula, D. W.}, JOURNAL = {IEEE Transactions on Computers}, MONTH = Aug, NUMBER = {8}, PAGES = {932-940}, TITLE = {Measuring the Accuracy of {ROM} Reciprocal Tables}, VOLUME = {43}, YEAR = {1994}, KEYWORDS = {division} } @ARTICLE{Bailey95, author = {David H. Bailey}, JOURNAL = {ACM Transactions on Mathematical Software}, NUMBER = {4}, PAGES = {379-387}, TITLE = {A {Fortran}-90 based multiprecision system}, VOLUME = {21}, YEAR = {1995}, CRINDEX = {Fichier}, url = {http://science.nas.nasa.gov/Pubs/TechReports/RNRreports/dbailey/RNR-94-013/RNR-94-013.ps} } @Misc{GMPweb, title = {{GMP}, the {GNU} Multi-Precision Library}, key = {GMP}, howpublished = {{\tt http://swox.com/gmp/}} } @Misc{MPFRweb, title = {{MPFR}}, key = {MPFR}, howpublished = {{\tt http://www.mpfr.org/}} } @Misc{IBMlibultimweb, title = {{IBM} {Accurate} {Portable} {Math.} {Library}}, key = {LibUltim}, howpublished = {{\tt http://oss.software.ibm.com/mathlib/}} } @Misc{FDLIBMweb, title = {Sun {Freely Distributable LIBM}}, howpublished = {{\tt http://www.netlib.org/fdlibm/}} } @Misc{IntelOpenSource, title = {Open Source from {Intel}}, howpublished = {{\tt http://www.intel.com/software/products/opensource/}} } @inproceedings{Daumas98, author = {Marc Daumas}, title = {Expansions: lightweight multiple precison arithmetic}, booktitle = {Architecture and Arithmetic Support for Multimedia}, address = {Dagstuhl, Germany}, year = {1998}, url = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR98/RR98-39.ps.Z} } @ARTICLE{DauFin99a, AUTHOR = {Marc Daumas and Claire Finot}, NUMBER = {6}, VOLUME = {5}, PAGES = {323-338}, JOURNAL = {Journal of Universal Computer Science}, TITLE = {Division of floating point expansions with an application to the computation of a determinant}, YEAR = {1999}, CRINDEX = {Fichier}, LOCATION = {http://www.iicm.edu/jucs_5_6/division_of_floating_point/paper.pdf} } @INPROCEEDINGS{DauMor2K, AUTHOR = {Marc Daumas and Claire Moreau-Finot}, ADDRESS = {Dagstuhl, Germany}, BOOKTITLE = {Real Numbers and Computers}, PAGES = {61-74}, TITLE = {Exponential: implementation trade-offs for hundred bit precision}, CRINDEX = {Livre, Fichier}, YEAR = {2000} } @TECHREPORT{DefDinMul01, author = {D. Defour and F. de~Dinechin and J.M. Muller}, month = {July}, year = 2001, title = {Correctly Rounded Exponential Function in Double Precision Arithmetic}, number = {RR2001-26}, note = {Available at ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2001/RR2001-26.ps.Z}, institution = {LIP, \'Ecole Normale Sup\'erieure de Lyon}, } @TECHREPORT{Defour02, author = {D. Defour}, month = oct, year = 2002, title = {Cache-Optimised Methods for the Evaluation of Elementary Functions}, number = {RR2002-38}, note = {Available at ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2002/RR2002-38.ps.Z}, institution = {LIP, \'Ecole Normale Sup\'erieure de Lyon}, } @ARTICLE{Dek71, AUTHOR = {Theodorus J. Dekker}, JOURNAL = {Numerische Mathematik}, NUMBER = {3}, PAGES = {224-242}, TITLE = {A floating point technique for extending the available precision}, VOLUME = {18}, YEAR = {1971}, CRINDEX = {Classeur} } @INPROCEEDINGS{Far81, author = {P.~M. Farmwald}, editor = {K.~S. Trivedi and D.~E. Atkins}, year = 1981, title = {High Bandwidth Evaluation of Elementary Functions}, booktitle = {Proceedings of the 5th IEEE Symposium on Computer Arithmetic}, publisher = {IEEE Computer Society Press, Los Alamitos, CA}, key = {Far81} } @ARTICLE{Gol91, author = {D. Goldberg}, month = Mar, year = 1991, title = {What every computer scientist should know about floating-point arithmetic}, journal = {ACM Computing Surveys}, volume = 23, number = 1, pages = {5-47}, keywords = {floating-point arithmetic} } @techreport{Markstein2001, author = {R.-C. Li and P. Markstein and J. P. Okada and J. W. Thomas}, title = {The Libm library and floating-point arithmetic for {HP-UX} on {I}tanium}, institution = {{H}ewlett-{P}ackard company}, year = {2001}, month = {april} } @ARTICLE{HarKubStoTan99, author = {J. Harrison and T. Kubaska and S. Story and P.T.P. Tang}, year = 1999, title = {The Computation of Transcendental Functions on the {IA}-64 Architecture}, journal = {Intel Technology Journal}, volume = {Q4} } @INPROCEEDINGS{Hassler95, AUTHOR = {Hassler, H. and Takagi, N.}, ADDRESS = {Bath, UK}, BOOKTITLE = {12th IEEE Symposium on Computer Arithmetic}, EDITOR = {S. Knowles and W.H. McAllister}, PAGES = {10--16}, PUBLISHER = {IEEE Computer Society Press}, TITLE = {Function Evaluation by Table Look-up and Addition}, YEAR = {1995} } @BOOK{Hwang79, AUTHOR = {K. Hwang}, PUBLISHER = {Wiley, New York}, TITLE = {Computer Arithmetic Principles, Architecture and Design}, YEAR = {1979} } @BOOK{Knu73, author = {D. Knuth}, year = 1973, title = {The Art of Computer Programming}, volume = 2, publisher = {Addison Wesley, Reading, MA} } @BOOK{Kor93, AUTHOR = {I. Koren}, PUBLISHER = {Prentice-Hall}, TITLE = {Computer arithmetic algorithms}, YEAR = {1993}, KEYWORDS = {accuracy control,addition,cordic,division,elementary functions,exponential,floating-point arithmetic,logarithm,multiplication,number systems,redundant number systems,residue number systems,shift-and-add algorithms,square root,survey on computer arithmetic,trigonometric functions} } @INPROCEEDINGS{Arnold89, author = {Arnold, M.G. and Bailey, T.A. and Cowles, J.R. and Cupal, J.J.}, title = {Redundant Logarithmic Number Systems}, month = sep, year = 1989, booktitle = {Proceedings of the 9th IEEE Symposium on Computer Arithmetic}, editor = {Avizienis, Ercegovac and Swartzlander}, pages = {144-151}, publisher = {IEEE Computer Society Press}, address = {Santa Monica} } @INPROCEEDINGS{Lewis89, author = {Lewis, D.M. and Yu, L.K.}, title = {Algorithm Design for a 30 bit Integrated Logarithmic Processor}, month = sep, year = 1989, booktitle = {Proceedings of the 9th IEEE Symposium on Computer Arithmetic}, editor = {Avizienis, Ercegovac and Swartzlander}, pages = {192-199}, publisher = {IEEE Computer Society Press}, address = {Santa Monica} } @PHDTHESIS{Lef2000, author = {V.~Lefvre}, year = 2000, title = {Moyens arithm\'etiques pour un calcul fiable}, school = {\'Ecole Normale Sup\'erieure de Lyon, Lyon, France} } @INPROCEEDINGS{LefMul2000, author = {V. Lefvre and J.M. Muller}, month = aug, year = 2000, title = {On-the-Fly Range Reduction}, booktitle = {{SPIE's} International Symposium on Optical Science and Technology}, address = {San Diego} } @Article{LMT98, AUTHOR = {V. Lef\`evre and J.M. Muller and A. Tisserand}, JOURNAL = {IEEE Transactions on Computers}, MONTH = nov, NUMBER = {11}, PAGES = {1235--1243}, TITLE = {Towards Correctly Rounded Transcendentals}, VOLUME = {47}, YEAR = {1998}, KEYWORDS = {table maker's dilemma,elementary functions,rounding,floating-point arithmetic} } @Article{Lewis94, AUTHOR = {Lewis, D.M.}, JOURNAL = {IEEE Transactions on Computers}, MONTH = aug, NUMBER = {8}, PAGES = {974-982}, TITLE = {Interleaved Memory Function Interpolators with Application to an Accurate {LNS} Arithmetic Unit}, VOLUME = {43}, YEAR = {1994} } @TechReport{Lefevre99b, AUTHOR = {V. Lef\`evre}, TITLE = {Multiplication by an Integer Constant}, ADDRESS = {Lyon, France}, INSTITUTION = {Laboratoire d'Informatique du Parall\'elisme}, TYPE = {{LIP} research report}, NUMBER = {RR1999-06 (\texttt{ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR1999/RR1999-06.ps.Z})}, YEAR = {1999}, KEYWORDS = {multiplication,addition chains} } @BOOK{Map91, author = {B.~W. Char and K.~O. Geddes and G.~H. Gonnet and B.~L. Leong and M.~B. Monagan and S.~M. Watt}, year = 1991, title = {Maple V Library Reference Manual}, publisher = {Springer Verlag}, address = {Berlin, Germany}, key = {Map91}, issn_isbn = {3-540-97592-6} } @INPROCEEDINGS{Mehendale95, AUTHOR = {Mahesh Mehendale and S. D.Sherlekar and G. Venkatesh }, TITLE = {Synthesis of multiplier-less {FIR} filters with minimum number of additions}, BOOKTITLE = {IEEE/ACM International Conference on Computer-Aided Design}, PAGES = {668-671}, ADDRESS = {San Jose, CA USA}, MONTH = nov, YEAR = {1995} } @INPROCEEDINGS{Mehendale96, AUTHOR = {Mahesh Mehendale and G. Venkatesh and S.D.Sherleka}, TITLE = {Optimized code generation of multiplication-free linear transforms}, BOOKTITLE = {ACM IEEE Design Automation Conference }, PAGES = {41}, ADDRESS = {Las Vegas, NV USA}, MONTH = nov, YEAR = {1996} } @INPROCEEDINGS{Potkonjak94, AUTHOR = {M. Potkonjak and M.B. Srivastava and A. Chandrakasan}, TITLE = {Efficient substitution of multiple constant multiplications by shifts and additions using iterative pairwise matching}, BOOKTITLE = {ACM IEEE Design Automation Conference }, PAGES = {189-194}, ADDRESS = {San Diego, CA USA}, MONTH = jun, YEAR = {1994} } @INPROCEEDINGS{Pri91, author = {D.~M. Priest}, editor = {P. Kornerup and D.~W. Matula}, month = {June}, year = 1991, title = {Algorithms for arbitrary precision floating point arithmetic}, booktitle = {Proceedings of the 10th IEEE Symposium on Computer Arithmetic (Arith-10)}, pages = {132-144}, publisher = {IEEE Computer Society Press, Los Alamitos, CA}, address = {Grenoble, France}, keywords = {accuracy control,floating-point arithmetic}, location = {} } @INPROCEEDINGS{SS97, AUTHOR = {M.J. Schulte and J.E. Stine}, BOOKTITLE = {Proceedings of the 13th IEEE Symposium on Computer Arithmetic}, LOCATION = {Asilomar, CA}, EDITOR = {T. Lang and J.M. Muller and N. Takagi}, KEY = {SS97}, PUBLISHER = {IEEE Computer Society Press}, TITLE = {Symmetric Bipartite Tables for Accurate Function Approximation}, PAGES = {175-183}, YEAR = {1997} } @Article{SS99sbtm, AUTHOR = {M.J. Schulte and J.E. Stine}, JOURNAL = {IEEE Transactions on Computers}, MONTH = aug, NUMBER = {8}, PAGES = {842-847}, TITLE = {Approximating Elementary Functions with Symmetric Bipartite Tables}, VOLUME = {48}, YEAR = {1999} } @ARTICLE{SS99stam, author = { J.E. Stine and M.J. Schulte}, year = 1999, title = {The Symmetric Table Addition Method for Accurate Function Approximation}, journal = {Journal of VLSI Signal Processing}, number = 2, volume = 21, pages = {167-177} } @INPROCEEDINGS{She97, AUTHOR = {Jonathan R. Shewchuk}, BOOKTITLE = {Discrete and Computational Geometry}, PAGES = {305-363}, TITLE = {Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates}, VOLUME = {18}, YEAR = {1997}, CRINDEX = {Fichier}, LOCATION = {http://link.springer.de/link/service/journals/00454/papers97/18n3p305.pdf}, LOCATION.ALT = {http://www.cs.cmu.edu/afs/cs/project/quake/public/papers/robust-arithmetic.ps} } @BOOK{Ste74, author = {P.~H. Sterbenz}, year = 1974, title = {Floating point computation}, publisher = {Prentice-Hall}, address = {Englewood Cliffs, NJ}, keywords = {floating-point arithmetic} } @INPROCEEDINGS{StoTan99, author = {Shane Story and Ping Tak Peter Tang}, month = {April}, year = 1999, title = {New Algorithms for Improved Transcendental Functions on {IA}-64}, booktitle = {Proceedings of the 14th {IEEE} Symposium on Computer Arithmetic, Adelaide, Australia}, pages = {4---11}, publisher = {IEEE Computer Society Press} } @ARTICLE{Tang89, author = {P.~T.~P.~Tang}, month = jun, year = 1989, title = {Table-Driven Implementation of the Exponential Function in {IEEE} Floating-Point Arithmetic}, journal = {ACM Transactions on Mathematical Software}, volume = 15, number = 2, pages = {144--157}, key = {Tan89}, keywords = {Elementary functions, exponential} } @ARTICLE{Dunham90, author = {Dunham, C. B.}, month = oct, year = 1990, title = {Feasability of "perfect" function evaluation}, journal = {{SIGNUM} Newsletter}, volume = 25, number = 4, pages = {25-26} } @INPROCEEDINGS{Tan91, author = {P.~T.~P. Tang}, editor = {P. Kornerup and D.~W. Matula}, month = {June}, year = 1991, title = {Table lookup algorithms for elementary functions and their error analysis}, booktitle = {Proceedings of the 10th IEEE Symposium on Computer Arithmetic}, pages = {232-236}, publisher = {IEEE Computer Society Press, Los Alamitos, CA}, address = {Grenoble, France}, keywords = {accuracy control,elementary functions,table lookup algorithms}, location = {Grenoble, France} } @ARTICLE{Tan92, author = {Tang, P.T.P.}, month = jun, year = 1992, title = {Table-Driven Implementation of the Exponential Function in {IEEE} Floating-Point Arithmetic}, journal = {{ACM} Transactions on Mathematical Software}, volume = 18, number = 2, pages = {211--222}, key = {Tan92} } @book{ErcegovacLang94, author={Ercegovac, M. D. and Lang, T.}, title={Division and Square Root: Digit-Recurrence Algorithms and Implementations}, publisher={Kluwer Academic Publishers, Boston}, year= 1994 } @ARTICLE{WG94, author = {Wong, W. F. and Goto, E.}, month = mar, year = 1994, title = {Fast Hardware-Based Algorithms for Elementary Function Computations Using Rectangular Multipliers}, journal = {IEEE Transactions on Computers}, volume = 43, number = 3, pages = {278--294}, key = {WG94} } @ARTICLE{WG95, AUTHOR = {Wong, W.F. and Goto, E.}, JOURNAL = {IEEE Transactions on Computers}, MONTH = mar, NUMBER = {3}, PAGES = {453--457}, TITLE = {Fast Evaluation of the Elementary Functions in Single Precision}, VOLUME = {44}, YEAR = {1995} } @ARTICLE{Ziv91, author = {A.~Ziv}, month = sep, year = 1991, title = {Fast evaluation of elementary mathematical functions with correctly rounded last bit}, journal = {ACM Transactions on Mathematical Software}, volume = 17, number = 3, pages = {410--423} } @Article{HsiLauDel2000, author = "Shen-Fu Hsiao and Chun-Yi Lau and Jean-Marc Delosme", month = jun, year = "2000", title = "Redundant Constant-Factor Implementation of Multi-Dimensional {CORDIC} and Its Application to Complex {SVD}", journal = "Journal of VLSI Signal Processing Systems", volume = "25", number = "2", pages = "155--166", } @Book{Parhami2000, author = {Parhami, B.}, title = {Computer Arithmetic, Algorithms and Hardware Designs}, year = 2000, publisher = {Oxford University Press} } @Article{Coleman2000, AUTHOR = {Coleman, J. N. and Chester, E. I.}, JOURNAL = {IEEE Transactions on Computers}, TITLE = {Arithmetic on the European Logarithmic Microprocessor}, MONTH = jul, YEAR = {2000}, VOLUME = {49}, NUMBER = {7}, PAGES = {702--715} } @InProceedings{Pineiro2001, author = {Pi\~neiro, J. A. and Bruguera, J. D. and Muller, J.-M.}, title = {Faithful Powering Computation Using Table Look-Up and a Fused Accumulation Tree}, booktitle = {15th {IEEE} Symposium on Computer Arithmetic}, editor = {Neil Burgess and Luigi Ciminiera}, year = 2001, address = {Vail, Colorado}, month = Jun, pages = {40-47} } @InProceedings{CaoWeiCheng2001, author = {J. Cao and Wei, B.W.Y. and J. Cheng}, title = {High-Performance Architectures for Elementary Function Generation}, booktitle = {15th {IEEE} Symposium on Computer Arithmetic}, editor = {Neil Burgess and Luigi Ciminiera}, year = 2001, address = {Vail, Colorado}, month = Jun } @InProceedings{Pineiro2001b, author = {Pi\~neiro, J.A. and Bruguera, J.D. and Muller, J.-M.}, title = {{FPGA} Implementation of a Faithful Polynomial Approximation for Powering Function Computation}, booktitle = {EuroMicro DSD}, year = 2001, address = {Warszawa, Poland} } @InProceedings{Bailey2001, author = {Hida, Yozo and Li, Xiaoye S. and Bailey, David H.}, title = {Algorithms for Quad-Double Precision Floating-Point Arithmetic}, booktitle = {15th {IEEE} Symposium on Computer Arithmetic}, editor = {Neil Burgess and Luigi Ciminiera}, year = 2001, address = {Vail, Colorado}, month = Jun, pages = {155-162} } @inproceedings{Lee2002, author = {Lee, B. and Burgess, N.}, title = {Parameterisable Floating-Point Operators on {FPGA}s}, booktitle = {36th Asilomar Conference on Signals, Systems, and Computers}, pages = {1064-1068}, address = {Pacific Grove, California}, year = 2002 } @InProceedings{Pineiro2001b, author = {Pi\~neiro, J. A. and Bruguera, J. D. and Muller, J.-M.}, title = {{FPGA} Implementation of a Faithful Polynomial Approximation for Powering Function Computation}, booktitle = {EuroMicro DSD}, year = 2001, address = {Warszawa, Poland} } @InProceedings{Liddicoat2001, author = {Liddicoat, A. A. and Flynn, M. J. }, title = {High-Performance Floating Point Divide}, booktitle = {Euromicro Symposium on Digital System Design}, year = 2001, address = {Warsaw, Poland}, month = Sep, pages = {354-361} } @PhdThesis{liddicoat-thesis, author = {Liddicoat, A.A.}, title = {High-performance arithmetic for division and the elementary functions}, school = {Stanford University}, year = 2002 } @Misc{Briggs2002, author = {Briggs, K.}, year = 2002, title = {Doubledouble floating point arithmetic}, url = {{\tt http://members.lycos.co.uk/keithmbriggs/doubledouble.html}} } @InProceedings{MencerBoullisLukStyles2001, author = {O. Mencer and N. Boullis and W. Luk and H. Styles}, title = {Parametrized Function Evaluation on FPGAs}, booktitle = {Field-Programmable Logic and Applications}, year = 2001, address = {Belfast}, month = Sep } @InProceedings{Matousek2002, author = {R. Matou\v sek and M. Tich\' y and Z. Pohl and J. Kadlec and C. Softley and N. Coleman}, title = {Logarithmic Number System and Floating-Point Arithmetics on {FPGA}}, booktitle = {Field-Programmable Logic and Applications}, year = 2002, address = {Montpellier}, month = Sep, pages = {627-636} } @InProceedings{Arnold2002, author = {M. Arnold}, title = {21st Century Slide Rules with Logarithmic Arithmetic: High-Speed, Low-Cost, Low-Power Alternative to Fixed Point Arithmetic}, booktitle = {Online Symposium for Electronics Engineers (\texttt{http://www.osee.net})}, year = 2002, month = Feb } @InProceedings{Lee2003, author = {B. Lee and N. Burgess}, title = {A Dual-Path Logarithmic Number System Addition/Subtraction Scheme for {FPGA}}, booktitle = {Field-Programmable Logic and Applications}, year = 2003, address = {Lisbon}, month = Sep } @Article{Taylor88, AUTHOR = {Taylor, F. J. and Gill, R. and Joseph, J. and Radke, J.}, JOURNAL = {IEEE Transactions on Computers}, TITLE = {A 20 Bit Logarithmic Number System Processor}, YEAR = {1988}, MONTH = feb, VOLUME = {37}, NUMBER = {2}, PAGE = {190-199} } @Article{Lewis90, AUTHOR = {Lewis, D. M.}, JOURNAL = {IEEE Transactions on Computers}, TITLE = {An Architecture for Addition and Subtraction of Long Word Length Numbers in the Logarithmic Number System}, YEAR = {1990}, MONTH = nov, VOLUME = {39}, NUMBER = {11}, PAGE = {1325-1336} } @Book{Flynn2001, author = {Flynn, M. J. and Oberman, S. F.}, title = {Advanced Computer Arithmetic Design}, year = 2001, publisher = {Wiley-Interscience} } @Article{Lefevre2001, AUTHOR = {Defour, D. and Muller, J.M.}, JOURNAL = {R\'eseaux et syst\`emes r\'epartis, calculateurs parall\`eles}, TITLE = {\'Evaluation des fonctions \'el\'ementaires}, YEAR = {2001}, VOLUME = {13}, NUMBER = {4-5}, PAGE = {449-464} } @book{Markstein2000, author = {P. Markstein}, title = {{IA-64} and Elementary Functions : Speed and Precision}, publisher = {Prentice Hall}, year = {2000}, series = {Hewlett-Packard Professional Books}, note = {ISBN: 0130183482} } @Book{CorneaHarrisonTang2002, author = {M. Cornea and J. Harrison and Tang, P.T.P}, title = {Scientific Computing on Itanium-based Systems}, publisher = {Intel Press}, year = 2002 } @Misc{IEEE754, author = {ANSI/IEEE}, title = {Standard 754-1985 for Binary Floating-Point Arithmetic}, year = 1985 } @BOOK{KKLRW93, AUTHOR = {Klatte, R. and Kulisch, U. and Lawo, C. and Rauch, M. and Wiethoff, A.}, PUBLISHER = {Springer Verlag}, TITLE = {{C-XSC a C++ class library for extended scientific computing}}, YEAR = {1993} } @BOOK{Moore66, AUTHOR = {Moore, R.E.}, PUBLISHER = {Prentice Hall}, TITLE = {Interval analysis}, YEAR = {1966} } @book{ErcegovacLang2003, author={Ercegovac, M. D. and Lang, T.}, title={Digital Arithmetic}, publisher={Morgan Kaufmann}, year= 2003 } @Article{Vassiliadis2000, author = {S. Vassiliadis and M. Zhang and Delgado-Frias, J. G. }, title = {Elementary Function Generators for Neural-Network Emulators}, journal = {{IEEE} transactions on neural networks}, year = 2000, volume = 11, number = 6, pages = {1438-1449}, month = {nov} } @InProceedings{LeeLuk2003, author = {Lee, D-U and W. Luk and J. Villasenor and P. Cheung}, title = {Hierarchical Segmentation Schemes for Function Evaluation}, booktitle = {{IEEE} Conference on Field-Programmable Technology}, year = 2003, address = {Tokyo}, month = {dec} } @book{Muller89, AUTHOR = {Muller, Jean-Michel}, TITLE = {Arithm\'etique des ordinateurs, operateurs et fonctions \'el\'ementaires}, PUBLISHER = {Masson}, YEAR = 1989 } @BOOK{Muller97, AUTHOR = {Muller, J.-M.}, PUBLISHER = {Birkhauser}, ADDRESS = {Boston}, TITLE = {Elementary Functions, Algorithms and Implementation}, YEAR = {1997}, ISSN_ISBN = {ISBN 0-8176-3990-X} } @ARTICLE{Mul99, author = {Muller, J.-M. }, year = 1999, title = {A Few Results on Table-Based Methods}, journal = {Reliable Computing}, volume = 5, number = 3, pages = {279-288} } @ARTICLE{DefHanLefMulRevZim2004, AUTHOR = {Defour, D. and Hanrot, G. and Lef\`evre, V. and Muller, J.-M. and Revol, N. and Zimmermann, P.}, JOURNAL = {Numerical algorithms}, VOLUME = 37, NUMBER = {1-4}, PAGES = {367-375}, TITLE = {Proposal for a Standardization of Mathematical function Implementations in Floating-Point Arithmetic}, MONTH = jan, YEAR = 2004 } @inproceedings{Boldo2001, author = {Boldo, S. and Daumas, M.}, title = {A mechanically validated technique for extending the available precision}, PUBLISHER = {IEEE Computer Society Press}, booktitle = {35th Asilomar Conference on Signals, Systems, and Computers}, address = {Pacific Grove, California}, url = {http://www.ens-lyon.fr/~daumas/SoftArith/BolDau01b.pdf}, year = 2001 } @InProceedings{LefMulTis1997a, AUTHOR = {V. Lef\`evre and Muller, J.-M. and A. Tisserand}, ADDRESS = {Asilomar, USA}, BOOKTITLE = {Proceedings of the 13th IEEE Symposium on Computer Arithmetic}, PUBLISHER = {IEEE Computer Society Press, Los Alamitos, CA}, TITLE = {Towards Correctly Rounded Transcendentals}, YEAR = {1997}, KEYWORDS = {table maker's dilemma,elementary functions,rounding,floating-point arithmetic} } @TechReport{Lef1997a, AUTHOR = {V. Lef\`evre}, TITLE = {An Algorithm that Computes a Lower Bound on the Distance Between a Segment and $\mathbb{Z}^2$}, ADDRESS = {Lyon, France}, INSTITUTION = {Laboratoire de l'Informatique du Paralllisme}, TYPE = rr, NUMBER = {RR1997-18}, YEAR = {1997}, KEYWORDS = {elementary functions,floating-point arithmetic,rounding}, ABSTRACT-URL = {http://www.ens-lyon.fr/LIP/research_reports.us.html}, URL = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR1997/RR1997-18.ps.Z} } @InProceedings{ELMT98, author = {M.D. Ercegovac and T. Lang and Muller, J.-M. and A. Tisserand}, title = {Reciprocation, square root, inverse square root, and some elementary functions using small multipliers}, booktitle = {International Symposium on Optical Science, Engineering and Instrumentation}, year = 1998, editor = {SPIE}, month = jun, note = {San Diego, U.S.A} } @TechReport{LefMulTis1998a, AUTHOR = {V. Lef\`evre and Muller, J.-M. and A. Tisserand}, TITLE = {The Table Maker's Dilemma}, ADDRESS = {Lyon, France}, INSTITUTION = {Laboratoire de l'Informatique du Paralllisme}, TYPE = rr, NUMBER = {RR1998-12}, YEAR = {1998}, KEYWORDS = {table maker's dilemma,elementary functions,rounding,floating-point arithmetic}, ABSTRACT-URL = {http://www.ens-lyon.fr/LIP/research_reports.us.html}, URL = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR1998/RR1998-12.ps.Z} } @Article{ELMT2000, author = {M.D. Ercegovac and T. Lang and Muller, J.-M. and A. Tisserand}, title = {Reciprocation, square root, inverse square root, and some elementary functions using small multipliers}, JOURNAL = {{IEEE} Transactions on Computers}, year = 2000, MONTH = jul, NUMBER = {7}, PAGES = {628--637}, VOLUME = {49} } @Article{LefMulTis1998b, AUTHOR = {V. Lef\`evre and Muller, J.-M. and A. Tisserand}, JOURNAL = {{IEEE} Transactions on Computers}, MONTH = nov, NUMBER = {11}, PAGES = {1235--1243}, TITLE = {Towards Correctly Rounded Transcendentals}, VOLUME = {47}, YEAR = {1998}, KEYWORDS = {table maker's dilemma,elementary functions,rounding,floating-point arithmetic} } @Article{MST98, author = { Muller, J.-M. and A. Scherbyna and A. Tisserand}, title = {Semi-Logarithmic Number Systems}, journal = {IEEE Transactions on Computers}, year = 1998, volume = 47, number = 2, pages = {145--151}, month = {feb}, annote = {ISSN 0018-9340} } @Book{RALIP99, author = {{Laboratoire d'Informatique du Paralllisme}}, title = {Rapport d'activit 1999}, publisher = {ENS Lyon}, year = {1999}, URL = {http://www.ens-lyon.fr/LIP/Rapport99-WEB/} } @ARTICLE{BajKlaMul94, AUTHOR = {Jean-Claude Bajard and Sylvanus Kla and Jean-Michel Muller}, JOURNAL = {IEEE Transactions on Computers}, NUMBER = {8}, PAGES = {955-963}, TITLE = {{BKM}: a new hardware algorithm for complex elementary functions}, VOLUME = {43}, YEAR = {1994}, CRINDEX = {Non rfrenc} } @InProceedings{TMP99b, author = {A. Tisserand and P. Marchal and C. Piguet}, title = {An On-Line Arithmetic based FPGA for Low-Power Custom Computing}, booktitle = {9th International Workshop on Field Programmable Logic and Applications (FPL99)}, pages = {264--273}, year = 1999, number = 1673, series = {LNCS}, address = {Denver, Colorado}, month = {sep} } @Article{DTHL99, author = {M. Dimmler and A. Tisserand and U. Holmberg and R. Longchamp}, title = {On-Line Arithmetic for Real-Time Control of Microsystems}, journal = {IEEE/ASME Transactions on Mechatronics}, year = 1999, volume = 4, number = 2, pages = {213--217}, month = {jun}, annote = {ISSN 1083-4435} } @InCollection{Lef1999a, AUTHOR = {V. Lef\`evre}, TITLE = {An Algorithm that Computes a Lower Bound on the Distance Between a Segment and $\mathbb{Z}^2$}, BOOKTITLE = {Developments in Reliable Computing}, YEAR = {1999}, PUBLISHER = {Kluwer}, ADDRESS = {Dordrecht, Netherlands}, PAGES = {203--212}, KEYWORDS = {elementary functions,floating-point arithmetic,rounding} } @TechReport{Lef1999b, AUTHOR = {V. Lef\`evre}, TITLE = {Multiplication by an Integer Constant}, ADDRESS = {Lyon, France}, INSTITUTION = {Laboratoire de l'Informatique du Paralllisme}, TYPE = rr, NUMBER = {RR1999-06}, YEAR = {1999}, KEYWORDS = {multiplication,addition chains}, ABSTRACT-URL = {http://www.ens-lyon.fr/LIP/research_reports.us.html}, URL = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR1999/RR1999-06.ps.Z} } @InProceedings{LefMul1999a, AUTHOR = {V. Lef\`evre and Muller, J.-M.}, TITLE = {Table Methods for the Elementary Functions}, BOOKTITLE = {Proceedings of the SPIE --- The International Society for Optical Engineering}, EDITOR = {F.T. Luk}, ADDRESS = {Denver, Colorado}, PAGES = {43--49}, VOLUME = {3807}, YEAR = {1999} } @PhDThesis{Lef2000a, AUTHOR = {V. Lef\`evre}, TITLE = {Moyens arithmtiques pour un calcul fiable}, SCHOOL = {cole Normale Suprieure de Lyon}, ADDRESS = {Lyon, France}, YEAR = {2000}, MONTH = jan, URL = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/PhD/PhD2000/PhD2000-02.ps.Z} } @PhdThesis{Defour-thesis, author = {Defour, David}, title = {Fonctions \'el\'ementaires: algorithmes et impl\'ementations efficaces pour l'arrondi correct en double pr\'ecision}, school = {\'Ecole Normale Sup\'erieure de Lyon}, year = 2003, ADDRESS = {Lyon, France}, month = sep, URL = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/PhD/PhD2003/PhD2003-01.ps.gz} } @techreport{Lauter2003lip, author = {C. Lauter}, title = {A correctly rounded implementation of the exponential function on the {Intel} {Itanium} architecture}, institution = {{LIP}, \'Ecole Normale Sup\'erieure de Lyon}, year = 2003, number = {2003-54}, month = nov, note = {Available at ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2003/RR2003-54.ps.gz} } @TECHREPORT{Lauter2003inria, author = {C. Lauter}, title = {A correctly rounded implementation of the exponential function on the {Intel} {Itanium} architecture}, institution= {{INRIA}}, NUMBER = {RR-5024}, MONTH = nov, YEAR = {2003}, note = {Available at http://www.inria.fr/rrrt/rr-5024.html} } @InProceedings{BIT:spie03, author = { Beuchat, J.-L. and L. Imbert and A. Tisserand}, title = {Comparison of Modular Multipliers on {FPGA}s}, BOOKTITLE = {Proceedings of the SPIE --- The International Society for Optical Engineering}, year = {2003} } @InProceedings{BM:sympaaa2003, author = {Jean-Luc Beuchat and Jean-Michel Muller}, title = {Multiplication-addition modulaire: algorithmes it\'eratifs et implantations sur {FPGA}}, booktitle = {Actes de RenPar'15, CFSE'3 et SympAAA'2003}, editor = {M. Auguin and F. Baude and D. Lavenier and M. Riveill}, year = {2003}, pages = {235--242}, month = oct } @Article{BT:tsisympa8, author = {Jean-Luc Beuchat and Arnaud Tisserand}, title = {Evaluation polynomiale en-ligne de fonctions \'el\'ementaires sur {FPGA}}, journal = {Technique et science informatiques}, year = {\aparaitre} } @InProceedings{Beuchat:asap03, author = {Jean-Luc Beuchat}, title = {Modular Multiplication for {FPGA} Implementation of the {IDEA} Block Cipher}, booktitle = {Proceedings of the 14th IEEE International Conference on Application-Specific Systems, Architectures, and Processors}, pages = {412--422}, year = {2003}, editor = {E. Deprettere and S. Bhattacharyya and J. Cavallaro and A. Darte and L. Thiele}, publisher = {IEEE Computer Society} } @InProceedings{Beuchat:fpl2003, author = {Jean-Luc Beuchat}, title = {{FPGA} Implementations of the {RC6} Block Cipher}, booktitle = {Field-Programmable Logic and Applications}, pages = {101--110}, year = {2003}, editor = {P. Y. K. Cheung and G. A. Constantinides and J. T. de Sousa}, number = {2778}, series = {Lecture Notes in Computer Science}, publisher = {Springer} } @InProceedings{Beuchat:raw03, author = {Jean-Luc Beuchat}, title = {Some Modular Adders and Multipliers for Field Programmable Gate Arrays}, booktitle = {Proceedings of the 17th International Parallel \& Distributed Processing Symposium}, year = {2003}, publisher = {IEEE Computer Society} } @InProceedings{BouTis03-arith16, author = {N. Boullis and A. Tisserand}, title = {Some Optimizations of Hardware Multiplication by Constant Matrices}, booktitle = {ARITH 16}, pages = {20--27}, year = 2003 } @INPROCEEDINGS{BouTis02sympa, AUTHOR = {Boullis, N. and Tisserand, A.}, ADDRESS = {Hamamet, Tunisie}, BOOKTITLE = {8\`eme SYMPosium en Architectures nouvelles de machines}, MONTH = apr, PAGES = {283--290}, TITLE = {G\'en\'eration automatique d'architectures de calcul pour des op\'erations lin\'eaires~: application \`a l'{IDCT} sur {FPGA}}, YEAR = {2002} } @misc{LefMul2004, author = {Lef\`evre, V. and Muller, J.-M}, title = {Worst Cases for Correct Rounding of the Elementary Functions in Double Precision}, institution = {LIP/ENS-Lyon}, year = 2004, howpublished = {http://perso.ens-lyon.fr/jean-michel.muller/Intro-to-TMD.htm} } @InProceedings{DefDinMul2001, author = {D. Defour and F. de~Dinechin and J.M. Muller}, title = {Correctly Rounded Exponential Function in Double Precision Arithmetic}, booktitle = {Advanced Signal Processing Algorithms, Architectures, and Implementations X (SPIE'2000)}, editor = {}, year = 2001, volume = {}, address = {San Diego, California}, month = Aug, note = {Also available as LIP research report 2001-26} } @InProceedings{DefDin2002, author = {Defour, D. and de~Dinechin, F.}, title = {Software carry-save for fast multiple-precision algorithms}, booktitle = {35th International Congress of Mathematical Software}, year = 2002, address = {Beijing, China}, note = {Updated version of LIP research report 2002-08} } @InProceedings{DinDef2003, author = {de Dinechin, F. and Defour, D.}, title = {Software Carry-Save: A case study for instruction-level parallelism}, booktitle = {Seventh International Conference on Parallel Computing Technologies}, year = 2003, month = Sep, address = {Nizhny Novgorod, Russia} } @techreport{DarDefDinMul03, author = {C. Daramy and D. Defour and F. de~Dinechin and J.M. Muller}, title = {{CR-LIBM}: The evaluation of the exponential}, institution = {LIP, \'Ecole Normale Sup\'erieure de Lyon}, year = 2003, number = {RR2003-37}, month = jul, note = {Available at ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/RR/RR2003/RR2003-37.ps.gz} } @misc{SCSweb, title = {{SCS}, {S}oftware {C}arry-{S}ave multiprecision library}, url = {http://www.ens-lyon.fr/LIP/Arenaire/News/SCSLib/} } @techreport{DinDefLau2004LIP, author = {de~Dinechin, F. and D. Defour and C. Lauter}, title = {Fast correct rounding of elementary functions in double precision using double-extended arithmetic}, institution = {LIP, \'Ecole Normale Sup\'erieure de Lyon}, year = 2004, number = {2004-10}, month = mar, note = {Available at http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2004/RR2004-10.pdf} } @techreport{DinGast2004LIP, author = { de~Dinechin, F. and Gast, N.}, title = {Towards the post-ultimate \texttt{libm}}, institution = {LIP, \'Ecole Normale Sup\'erieure de Lyon}, year = 2004, number = {2004-47}, month = nov, note={Submitted to Arith' 17}, anote = {available at \url{http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2004/RR2004-47.pdf}} } @InProceedings{DinErshGast2005, author = {de~Dinechin, F. and Ershov, A. and Gast, N.}, title = {Towards the post-ultimate libm}, booktitle = {17th Symposium on Computer Arithmetic}, year = 2005, nolocation = {Cape Cod, Massachussets}, PUBLISHER = {IEEE Computer Society Press}, month = jun, pages = {288-295}, url = {http://perso.ens-lyon.fr/florent.de.dinechin/recherche/publis/2005-Arith.pdf} } @TechReport{Lauter2005LIP:tripledouble, author = {Lauter, Ch. Q.}, title = {Basic building blocks for a triple-double intermediate format}, institution = {LIP}, year = {2005}, month = sep, number = {RR2005-38}, location = {http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2005/RR2005-38.pdf} } @inproceedings{BroMelPio03, author = {H. Br{\"o}nnimann and G. Melquiond and S. Pion}, title = {The {B}oost interval arithmetic library}, booktitle = {Proceedings of the 5th Conference on Real Numbers and Computers}, pages = {65--80}, location = {Lyon, France}, year = {2003}, url = {http://perso.ens-lyon.fr/guillaume.melquiond/doc/03-rnc5-article.ps.gz} } @inproceedings{DauMelMun05, author = {M. Daumas and G. Melquiond and C. Mu{\~n}oz}, title = {Guaranteed proofs using interval arithmetic}, booktitle = {Proceedings of the 17th IEEE Symposium on Computer Arithmetic}, Noeditor = {Paolo Montuschi and Eric Schwarz}, pages = {188--195}, address = {Cape Cod, Massachusetts, USA}, year = {2005}, url = {http://perso.ens-lyon.fr/guillaume.melquiond/doc/05-arith17-article.pdf} } @inproceedings{MelPio05, author = {G. Melquiond and S. Pion}, title = {Formal certification of arithmetic filters for geometric predicates}, booktitle = {Proceedings of the 15th IMACS World Congress on Computational and Applied Mathematics}, location = {Paris, France}, year = {2005}, url = {http://perso.ens-lyon.fr/guillaume.melquiond/doc/05-imacs17_2-article.ps.gz} } @misc{Melqu05, title = {Gappa - G\'en\'eration automatique de preuves de propri\'et\'es arithm\'etiques}, author = {G. Melquiond}, howpublished = {Available at \url{http://lipforge.ens-lyon.fr/www/gappa/}} } @PhdThesis{Finot-thesis, author = {Finot-Moreau, Claire}, title = {Preuves et algorithmes utilisant l'arithm\'etique flottante normalis\'ee IEEE}, school = {\'Ecole Normale Sup\'erieure de Lyon}, year = 2001, ADDRESS = {Lyon, France}, month = jul, URL = {ftp://ftp.ens-lyon.fr/pub/LIP/Rapports/PhD/PhD2001/PhD2001-03.ps.Z} } @techreport{Muller05INRIA, author = {Muller, Jean-Michel}, title = {On the definition of ulp$(x)$}, institution = {INRIA}, year = 2005, number = {RR 5504}, month = feb, note = {Available at ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5504.pdf} } @Misc{crlibmweb, title = {{CR-Libm}, A library of correctly rounded elementary functions in double-precision}, howpublished = {\url{http://lipforge.ens-lyon.fr/www/crlibm/}} } @InProceedings{DinLauMel2005, author = {de~Dinechin, F. and Lauter, Ch. Q. and Melquiond, G.}, title = {Assisted verification of elementary functions using {Gappa}}, booktitle = {ACM{ }Symposium on Applied Computing}, note = {Extended version available as LIP research report RR2005-43, \url{http://www.ens-lyon.fr/LIP/Pub/Rapports/RR/RR2005/RR2005-43.pdf}}, year = 2006 } @PhdThesis{Stehle-thesis, author = {Damien Stehl\'e}, title = {Algorithmique de la rduction de rseaux et application la recherche de pires cas pour l'arrondi de fonctions mathmatiques}, school = {LORIA}, year = 2006, URL = {http://perso.ens-lyon.fr/damien.stehle/these.html} } @techreport{LauterLefevre2007, author = {Ch. Lauter and V. Lef{\`e}vre}, institution = {Laboratoire de l'Informatique du Parall{\'e}lisme}, number = {RR-2007-36}, title = {An efficient rounding boundary test for pow(x,y) in double precision}, type = {Technical Report}, year = {2007}, url = {http://prunel.ccsd.cnrs.fr/ensl-00169409/}, note = {To appear in IEEE Transactions on Computers} } @techreport{KorLauLefLouvMul2008, author = {P. Kornerup and Ch. Lauter and V. Lef{\`e}vre and N. Louvet and J.-M. Muller}, title = {Computing Correctly Rounded Integer Powers in Floating-Point Arithmetic}, number = {RR 2008-15}, institution = {SDU, Odense, Denmark et LIP, CNRS/ENS Lyon/INRIA/Universit de Lyon, Lyon, France}, year = {2008}, month = may, note = {To appear in ACM Transactions on Mathematical Software} } interval-2.1.0/src/crlibm/docs/latex/exp.tex0000644000000000000000000015433713031036767017131 0ustar 00000000000000This chapter is contributed by Ch. Q. Lauter. \section{Overview of the algorithm} The exponential function allows for additive argument reduction with multiplicative reconstruction: $e^{a + b} = e^a \cdot e^b$. In particular, the following equation is useful in developing an argument reduction: $$e^x = e^{E \cdot \ln\left(2\right) + z} = \left(e^{\ln\left( 2 \right)}\right)^E \cdot e^z = 2^E \cdot e^z$$ Here, $E$ can be considered to be a signed integer, $E \in \Z$ and $z$ to be a reduced argument such that $\left \vert z \right \vert < \ln\left(2\right)$. One remarks that the use of such an argument reduction implies a multiplication with a transcendental constant, $\ln\left( 2 \right)$. This means that the reduced argument will not be exact. The corresponding error bound will be given in section \ref{sec:expargred}. A reduced argument obtained by the reduction shown above is generally still to great for polynomial approximation. By use of tabulation methods, the following argument reduction can be employed and yields to smaller reduced arguments. \begin{eqnarray*} k & = & \left \lfloor x \cdot \frac{2^l}{\ln\left(2 \right)} \right \rceil \\ \hat{r} & = & x - k \cdot \frac{\ln\left( 2 \right)}{2^l} \\ k & = & 2^l \cdot M + 2^{w_1} \cdot i_2 + i_1 \end{eqnarray*} where $\hat{r}$ is the reduced argument, $k, M \in \N$ are intermediate integers, and $w_1, w_2 \in \N$, $l = w_1 + w_2$, are the widths of the indices to the two tables. The corresponding reconstruction phase is $$e^x = 2^M \cdot 2^{\frac{i_2}{2^{w_1}}} \cdot 2^{\frac{i_1}{2^l}} \cdot e^{\hat{r}} = 2^M \cdot t_1 \cdot t_2 \cdot e^{\hat{r}}$$ with the table values $t_1 = 2^{\frac{i_2}{2^{w_1}}}$ and $t_2 = 2^{\frac{i_1}{2^l}}$. The argument reduction ensures that $\left \vert \hat{r} \right \vert \leq \frac{\ln\left( 2 \right)}{2^l} < 2^{-l}$. This magnitude is small enough for allowing for polynomial approximation. In the case of the given algorithm, we use $l = 12$ and $w_1 = w_2 = 6$. The subtraction $\hat{r} = x - k \cdot \round \left(\frac{\ln\left( 2 \right)}{2^l}\right)$ can be implemented exactly but leads to catastrophic cancellation that amplifies the absolute error of the potentially exact multiplication of $k$ by the approximated $\frac{\ln\left( 2 \right)}{2^l}$. Is is nevertheless not of such an issue, as will be shown in section \ref{sec:expaccuracy}. % ATTENTION: CHANGER EVTL LA MARQUE \section{Special case handling}\label{sec:expspecial} The exponential function $e^x$, which is monotone increasing, produces results that are representable in a floating point format for arguments $$x \in \left[ \mbox{\small \it underflowBound}; \mbox{\small \it overflowBound} \right]$$ Herein the following values are observed for double precision: $$\mbox{\small \it underflowBound} = \round \left( \ln\left(2^{-1075} \right) \right) \approx -745.13$$ and $$\mbox{\small \it overflowBound} = \round \left( \ln\left(2^{1024} \cdot \left( 1 - 2^{-53} \right) \right) \right) \approx 709.78$$ Its double precision result is gradually underflowed in the argument domain $$x \in \left[\mbox{\small \it underflowBound}; \mbox{\small \it denormBound} \right]$$ where $$\mbox{\small \it denormBound} = \round\left( \ln\left( 2^{-1022} \right) \right) \approx -708.40$$ for double precision. No special case can therefore occur for arguments $x$ such that $$\left \vert x \right \vert \leq \min \left( \left \vert \mbox{\small \it underflowBound} \right \vert, \left \vert \mbox{\small \it overflowBound} \right \vert, \left \vert \mbox{\small \it denormBound} \right \vert \right) \approx 708.40$$ This provides us a very efficient filter for the greatest part of the definition domain. Since also some arguments are filtered out that actually do not represent a special case, additional tests are made in the body of the main special handling sequence launched by the filter. Particular cases like $x=\pm \infty$, $x = \nan$ are handled as follows: \begin{itemize} \item The result for $x = \nan$ is $\nan$. \item The result for $x = + \infty$ is $+ \infty$. \item The result for $x = - \infty$ is $0$, even in round-upwards mode. \end{itemize} If the result is clearly underflowed, $0$ is returned with the inexact flag set for round-to-nearest and round-downwards, $0^+$ is returned for round-upwards. The ordering of double precision numbers is compatible with the integer ordering of the signed 64 bit integers the floating point numbers can be read in memory as. Further the ordering on numbers is equal to the lexicographic ordering of its digits. So if the higher order word of $\left \vert x \right \vert$ is less than the higher order word of $\mbox{\small \it overUnderDenormBound} = \min \left( \left \vert \mbox{\small \it underflowBound} \right \vert, \left \vert \mbox{\small \it overflowBound} \right \vert, \left \vert \mbox{\small \it denormBound} \right \vert \right)$, no underflow, gradual underflow or overflow can occur. In the other cases, special handling in the reconstruction step may be necessary. A flag \texttt{mightBeDenorm} is set for possible subnormals. Cases where intermediate results are not representable because of overflow but where the final result is representable can be overcome by replacing the corresponding floating point multiplication by an integer manipulation. This will be shown below. Since $e^{x} = 1 + x + \Ord\left( x^2 \right)$ for small $\left \vert x \right \vert$, underflowed arguments $x$ ($\left \vert x \right \vert \leq 2^{-1022}$) can be handled as follows: \begin{itemize} \item In round-to-nearest mode, $1$ can be returned since $\round \left( 1 + x \right) = 1$ for $\left \vert x \right \vert \leq 2^{-54}$. \item In round-upwards mode, $1$ must be returned for $x = 0$. For $x < 0$, $1$ can be returned, too, because $\roundup \left( 1 - \left \vert x \right \vert \right) = 1$. If $x > 0$, $1^+$ must be returned. \item Round-downwards mode is analogous to round-upwards mode, but the signs are inverted. \item Round-towards-zero mode is equivalent to round-downwards mode since $e^x > 0 \mbox{~~} \forall x \in \R$. \end{itemize} The following sequence realizes the special case handling for round-to-nearest. The sequences for the other rounding modes are straightforward and will not be shown here. The constants\\ \texttt{OVRUDRFLWSMPLBOUND}, \texttt{OVRFLWBOUND} and \texttt{DENORMBOUND} are computed by the corresponding Maple script that realizes the equations given above. \begin{lstlisting}[caption={Handling special cases},firstnumber=1] /* Special cases tests */ xIntHi = xdb.i[HI]; mightBeDenorm = 0; /* Test if argument is a denormal or zero */ if ((xIntHi & 0x7ff00000) == 0) { /* We are in the RN case, return 1.0 in all cases */ return 1.0; } /* Test if argument is greater than approx. 709 in magnitude */ if ((xIntHi & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) { /* If we are here, the result might be overflowed, underflowed, inf, or NaN */ /* Test if +/- Inf or NaN */ if ((xIntHi & 0x7fffffff) >= 0x7ff00000) { /* Either NaN or Inf in this case since exponent is maximal */ /* Test if NaN: mantissa is not 0 */ if (((xIntHi & 0x000fffff) | xdb.i[LO]) != 0) { /* x = NaN, return NaN */ return x + x; } else { /* +/- Inf */ /* Test sign */ if ((xIntHi & 0x80000000)==0) /* x = +Inf, return +Inf */ return x; else /* x = -Inf, return 0 */ return 0; } /* End which in NaN, Inf */ } /* End NaN or Inf ? */ /* If we are here, we might be overflowed, denormalized or underflowed in the result but there is no special case (NaN, Inf) left */ /* Test if actually overflowed */ if (x > OVRFLWBOUND) { /* We are actually overflowed in the result */ return LARGEST * LARGEST; } /* Test if surely underflowed */ if (x <= UNDERFLWBOUND) { /* We are actually sure to be underflowed and not denormalized any more So we return 0 and raise the inexact flag */ return SMALLEST * SMALLEST; } /* Test if possibly denormalized */ if (x <= DENORMBOUND) { /* We know now that we are not sure to be normalized in the result We just set an internal flag for a further test */ mightBeDenorm = 1; } } /* End might be a special case */ \end{lstlisting} \section{Argument reduction}\label{sec:expargred} Mathematically, the argument reduction used for quick and accurate phase is the same. The reduced argument is nevertheless different for the both phases because the reduction is inexact. It is therefore implemented in two or three phases: First, $k$ corresponding to $\left \lfloor x \cdot \frac{2^{12}}{\ln\left(2 \right)} \right \rceil$ is computed in both integer and floating point (double) representation. Herein $\frac{2^{12}}{\ln\left(2 \right)}$ is represented in double precision and the multiplication by $x$ is performed in double precision, too. Then the nearest integer $k$ to the number obtained is computed. This computational problem is principally subject to the Table Maker's Dilemma: $x \cdot \frac{2^{12}}{\ln\left(2 \right)}$ is transcendental for all $x \not = \ln\left(2 \right)$ and the to-nearest-integer operation is equivalent to a rounding to the nearest. It is not possible to guarantee that the computed $k$ is really the integer nearest to $x \cdot \frac{2^{12}}{\ln\left(2 \right)}$. Nevertheless, this is not a problem. The following argument reduction steps, as $\hat{r} = x - k \cdot \frac{\ln\left(2\right)}{2^{12}}$, and the reconstruction are mathematically correct for any $k$. So computing the wrong $k$ only leads to a slight enlargement of the interval of the reduced argument $\hat{r}$, as one can see with the following argument: The function's argument's value $x$ is bounded in magnitude by $2^{10}$. So, $x \cdot \frac{2^{12}}{\ln\left(2 \right)}$ is bounded in magnitude by $2^{22}$. Since the accuracy of the value $xMultLog2InvMult2L = \round \left( x \cdot \round \left( \frac{2^{12}}{\ln\left(2 \right)} \right) \right)$ with respect to the exact value $x \cdot \frac{2^{12}}{\ln\left(2 \right)}$ is at least $51$ bits, an error is made not earlier than at the $19$th bit following the integer-fractional point. Thus $$\left \vert \frac{k - x \cdot \frac{2^{12}}{\ln\left(2 \right)}}{x \cdot \frac{2^{12}}{\ln\left(2 \right)}} \right \vert \leq \frac{1}{2} + 2^{-19}$$ Therefore $\hat{r}^\prime$ is actually bounded by $\left \vert \hat{r}^\prime \right \vert \leq \frac{\ln\left( 2 \right)}{2^{12}} \cdot \left( \frac{1}{2} + 2^{-19} \right)$ instead of $\left \vert \hat{r} \right \vert \leq \frac{\ln\left( 2 \right)}{2^{12}} \cdot \frac{1}{2}$. This difference can be taken into account in the error computation, and we may safely assume that its effects will be negligible. Note further that $k$ is computed exactly ($k = 0$) for $\left \vert x \right \vert \leq 2^{-14}$ because no Table Maker's Dilemma can no longer occur. This first step is performed by the following code sequence: \begin{lstlisting}[caption={Argument reduction - first step},firstnumber=1] xMultLog2InvMult2L = x * log2InvMult2L; shiftedXMult = xMultLog2InvMult2L + shiftConst; kd = shiftedXMult - shiftConst; shiftedXMultdb.d = shiftedXMult; k = shiftedXMultdb.i[LO]; \end{lstlisting} Here, \texttt{k} and \texttt{kd} represent $k$ in integer and floating point (double) format. The technique for computing $\left \lfloor z \right \rceil$ out of $z$ is explained in section \ref{sec:double2int}, page \pageref{sec:double2int}. In the second step of the argument reduction, an arithmetical approximation to $\hat{r} = x - k \cdot \frac{\ln\left( 2 \right)}{2^{12}}$, $r_\hi + r_\mi = \hat{r} + \delta_{\mbox{\tiny argred}}$, is computed using a double-double approximation to $\frac{\ln\left( 2 \right)}{2^{12}}$ and double-double precision for computations. We will consider its absolute error $\delta_{\mbox{\tiny argredquick}} = r_\hi + r_\mi - \hat{r}$ and the resulting relative error on the exponential function $\epsilon_{\mbox{\tiny argredquick}} = \frac{e^{\hat{r} + \delta} - e^{\hat{r}}}{e^{\hat{r}}}$ below. This argument reduction step is implemented as follows: \begin{lstlisting}[caption={Argument reduction - second step},firstnumber=1] Mul12(&s1,&s2,msLog2Div2Lh,kd); s3 = kd * msLog2Div2Lm; s4 = s2 + s3; s5 = x + s1; Add12Cond(rh,rm,s5,s4); \end{lstlisting} Here, \texttt{msLog2Div2Lh} and \texttt{msLog2Div2Lm} are a double-double representing $-\frac{\ln\left( 2 \right)}{2^{12}}$ with an relative error $\left \vert \epsilon_{\mbox{\tiny logconstquick}} \right \vert = \left \vert \frac{msLog2Div2L_\hi + msLog2Div2L_\mi + 2^{-12} \cdot \ln\left( 2 \right)}{-2^{-12} \cdot \ln\left( 2 \right)} \right \vert \leq 2^{-109}$. Further, $\left \vert msLog2Div2L_\mi \right \vert \leq 2^{-54} \cdot \left \vert msLog2Div2L_\hi \right \vert$. Let us now show first a bound on the absolute round-off error of the given sequence. We know that the multiplication $s_1 + s_2 = kd \cdot msLog2Div2h$ and the final addition $r_\hi + r_\mi = s_5 + s_4$ are exact. Further, the addition $s_5 = x \oplus s_1$ is exact as per Sterbenz' lemma. In fact, since $$\left \vert x - \left \lfloor x \cdot \frac{2^{12}}{\ln\left(2\right)} \right \rceil \cdot \frac{\ln\left(2\right)}{2^{12}} \right \vert \leq 2^{-12}$$ and $$s_1 = - \left \lfloor x \cdot \frac{2^{12}}{\ln\left(2\right)} \right \rceil \cdot \frac{\ln\left(2\right)}{2^{12}} \cdot \left( 1 + \epsilon^\prime \right)$$ with $\left \vert \epsilon^\prime \right \vert \leq 2^{-50}$, it is trivial to see that $$\frac{1}{2} \cdot \left \vert s_1 \right \vert \leq \left \vert x \right \vert \leq 2 \cdot \left \vert s_1 \right \vert$$ In addition, $s_1$ and $x$ are clearly of opposed sign. So, noting $$s_3 = k \cdot msLog2Div2L_\mi \cdot \left( 1 + \epsilon_1 \right)$$ and $$s_4 = \left( s_2 + s_3 \right) \cdot \left( 1 + \epsilon_2 \right)$$ with $\left \vert \epsilon_1 \right \vert \leq 2^{-53}$ and $\left \vert \epsilon_2 \right \vert \leq 2^{-53}$, we get $$r_\hi + r_\mi = x + k \cdot \left( msLog2Div2L_\hi + msLog2Div2L_\mi \right) + \delta^\prime$$ with $$\left \vert \delta^\prime \right \vert \leq \left \vert \epsilon_1 \right \vert \cdot \left \vert k \cdot msLog2Div2L_\mi \right \vert + \left \vert \epsilon_2 \right \vert \cdot \left \vert s_2 + s_3 \right \vert$$ We have $$\left \vert s_2 \right \vert \leq 2^{-53} \cdot \left \vert s_1 \right \vert \leq 2^{-53} \cdot \left \vert \round \left( k \cdot msLog2Div2L_\hi \right) \right \vert \leq 2^{-52} \cdot \left \vert k \cdot msLog2Div2L_\hi \right \vert$$ and further $$\left \vert s_3 \right \vert \leq \left \vert k \cdot msLog2Div2L_\mi \left( 1 + \epsilon_1 \right) \right \vert \leq \left \vert k \cdot msLog2Div2L_\mi \right \vert + \left \vert \epsilon_1 \right \vert \cdot \left \vert k \cdot msLog2Div2L_\mi \right \vert$$ So one can easily check that $$\left \vert \delta^\prime \right \vert \leq 2^{-104} \cdot \left \vert k \cdot msLog2Div2Lh \right \vert$$ In consequence using the fact that $\left \vert msLog2Div2L_\hi \right \vert = \left \vert \round \left( \frac{\ln\left( 2 \right)}{2^{12}} \right) \right \vert \leq 2 \cdot \left \vert \frac{\ln\left( 2 \right)}{2^{12}} \right \vert$ and the bound for $k$, one obtains $$\left \vert \delta^\prime \right \vert \leq \left \vert \left( x \cdot \frac{2^{12}}{\ln\left( 2 \right)} + \frac{1}{2} + 2^{-19} \right) \cdot \frac{\ln\left( 2 \right)}{2^{12}} \right \vert$$ Since $\left \vert x \right \vert \leq 746$ after filtering out the special cases, we obtain $\left \vert \delta^\prime \right \vert \leq 2^{-103} \cdot 2^{10} = 2^{-93}$. To this round-off error adds the approximation error comitted by rounding $\frac{\ln\left( 2 \right)}{2^{12}}$ to a double-double. We can note $$r_\hi + r_\mi = x - k \cdot \frac{\ln\left( 2 \right)}{2^{12}} \cdot \left( 1 + \epsilon_{\mbox{\tiny logconstquick}} \right) + \delta^\prime$$ This gives us $$r_\hi + r_\mi = \hat{r} + \delta$$ with $\left \vert \delta \right \vert \leq \left \vert k \cdot \frac{\ln\left( 2 \right)}{2^{12}} \cdot \epsilon_{\mbox{\tiny logconstquick}} \right \vert + \left \vert \delta^\prime \right \vert$. One can easily check that one obtains thus finally $\left \vert \delta \right \vert \leq 2^{-92}$. This absolute error $\delta$ in the reduced argument $\hat{r}$ translates to a relative error $\epsilon_{\mbox{\tiny argredquick}}$ in the function $e^{\hat{r}}$ as follows: \begin{eqnarray*} e^r & = & e^{\hat{r} + \delta} \\ & = & e^{\hat{r}} \cdot e^{\delta} \\ & = & e^{\hat{r}} \cdot \sum\limits_{i=0}^{\infty} \frac{1}{i!} \cdot \delta^i \\ & = & e^{\hat{r}} \cdot \left( 1 + \sum\limits_{i=1}^{\infty} \frac{1}{i!} \cdot \delta^i \right) \\ & = & e^{\hat{r}} \cdot \left( 1 + \epsilon_{\mbox{\tiny argredquick}} \right) \end{eqnarray*} with $\epsilon_{\mbox{\tiny argredquick}} = \sum\limits_{i=1}^{\infty} \frac{1}{i!} \cdot \delta^i = \delta \cdot \sum\limits_{i=0}^{\infty} \frac{1}{\left(i + 1 \right)!} \cdot \delta^i$. Since $\left \vert \delta \right \vert < \frac{1}{2}$, we get $$\forall i \geq 0 \mbox{ . } \left \vert \frac{1}{\left( i + 1 \right)!} \cdot \delta^i \right \vert \leq \left( \frac{1}{2} \right)^i$$ In consequence, $\sum\limits_{i=0}^{\infty} \frac{1}{\left(i + 1 \right)!} \cdot \delta^i \leq \sum\limits_{i=0}^{\infty} \left( \frac{1}{2} \right)^i = 2$. Thus we get $\left \vert \epsilon_{\mbox{\tiny argredquick}} \right \vert \leq 2 \cdot \left \vert \delta \right \vert \leq 2^{-91}$. Still in the second step of the argument reduction, the values $M$, $i_1$ and $i_2$ are computed exactly in integer computation as follows: \begin{lstlisting}[caption={Argument reduction - second step (cont'd)},firstnumber=1] M = k >> L; index1 = k & INDEXMASK1; index2 = (k & INDEXMASK2) >> LHALF; \end{lstlisting} Here \texttt{L} is equal to $12$ and \texttt{LHALF} is equal to $6$. The values \texttt{INDEXMASK1} and \texttt{INDEXMASK2} are masks to the lowest 6 bits and respectively to bits 6 through 15 of an 32 bit word. If ever the accurate phase must be launched, a third argument reduction phase is performed. It computes a triple-double $r_\hi + r_\mi + r_\lo = \hat{r} + \delta$ such that the resulting relative error on the exponential function $\epsilon_{\mbox{\tiny argredaccurate}} = \frac{e^{\hat{r} + \delta} - e^{\hat{r}}}{e^{\hat{r}}}$ is bounded by $\left \vert \epsilon_{\mbox{\tiny argredaccurate}} \right \vert \leq 2^{-140}$ as will be shown below. This step uses a triple-double approximation to $\frac{\ln\left( 2 \right)}{2^{12}}$ with a relative error $$\left \vert \epsilon_{\mbox{\tiny logconstaccurate}} \right \vert = \left \vert \frac{msLog2Div2L_\hi + msLog2Div2L_\mi + msLog2Div2L_\lo + 2^{-12} \cdot \ln\left( 2 \right)}{-2^{-12} \cdot \ln\left( 2 \right)} \right \vert \leq 2^{-163}$$ It is implemented as follows: \begin{lstlisting}[caption={Argument reduction - third step},firstnumber=1] Mul133(&msLog2Div2LMultKh,&msLog2Div2LMultKm,&msLog2Div2LMultKl,kd,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1 = x + msLog2Div2LMultKh; Add12Cond(rh,t2,t1,msLog2Div2LMultKm); Add12Cond(rm,rl,t2,msLog2Div2LMultKl); \end{lstlisting} The values for $k$, $M$, $i_1$ and $i_2$ that have been exactly computed already at the second argument reduction step can of course be reused. All operation but the first \texttt{Mul133} operator are exact: the last two by their general properties, the addition $t_1 = x \oplus msLog2Div2LMultK_\hi$ as per Sterbenz' lemma analogously as in the second argument reduction step. So one can note $$r_\hi + r_\mi + r_\lo = x - k \cdot \left( msLog2Div2L_\hi + msLog2Div2L_\mi + msLog2Div2L_\lo \right) \cdot \left( 1 + \epsilon_1 \right)$$ where $\epsilon_1$ is the relative error bound of the \texttt{Mul133} operator, for instance $\left \vert \epsilon_1 \right \vert \leq 2^{-153}$. Integrating also the rounding error in the constant, we get $$r_\hi + r_\mi + r_\lo = x - k \cdot \frac{\ln\left( 2 \right)}{2^{12}} + \delta$$ with $\left \vert \delta \right \vert \leq \left \vert k \cdot \frac{\ln\left( 2 \right)}{2^{12}} \right \vert \cdot \left( 2^{-163} + 2^{-153} \right) \leq 2^{-152} \cdot \left \vert k \cdot \frac{\ln\left( 2 \right)}{2^{12}} \right \vert \leq 2^{-141}$. One checks the previous upper bounds by using analogous arguments as the ones given for the second argument reduction step. Once again, this absolute error $\delta$ translates to a relative error $\epsilon_{\mbox{\tiny argredaccurate}} = \frac{e^{\hat{r} + \delta} - e^{\hat{r}}}{e^{\hat{r}}}$ in a similar way as mentioned above. We get $$\left \vert \epsilon_{\mbox{\tiny argredaccurate}} \right \vert \leq 2^{-140}$$ which is the bound to prove. Let us still remark that argument reduction is exact for arguments $x$ such that $\left \vert x \right \vert \leq \frac{\ln\left( 2 \right)}{2^{13}} < 2^{-13}$. In fact, in this case, $k = 0$ which implies that all multiplications of $k$ by the constants for $\frac{\ln\left( 2 \right)}{2^{12}}$ are exact. According to their uses either in quick or accurate phase, the table values $t_1 = e^{\frac{i_1}{2^{12}}}$ and $t_2 = e^{\frac{i_1}{2^{12}}}$ for $i_1, i_2 \in \left \lbrace 0 \dots 63 \right \rbrace$ are read as a double-double or as a triple-double. By construction, the double-double values have a relative error $\epsilon_{\mbox{\tiny tablequick}} = \frac{tbl_{i\hi} + tbl_{i\mi} - t_i}{t_i}$ bounded by $\left \vert \epsilon_{\mbox{\tiny tablequick}} \right \vert \leq 2^{-106}$. The triple-double values with $\epsilon_{\mbox{\tiny tableaccurate}} = \frac{tbl_{i\hi} + tbl_{i\mi} + tbl_{i\lo} - t_i}{t_i}$ verify $\left \vert \epsilon_{\mbox{\tiny tableaccurate}} \right \vert \leq 2^{-159}$. For $i_1 = 0$ and $i_2 = 0$ both errors are equal to $0$, so both argument reduction and reconstruction steps are exact for argument $x$ that verify $\left \vert x \right \vert \leq 2^{-13}$. \section{Polynomial approximation and reconstruction}\label{sec:exppolynomial} In both quick and accurate phase, the reduced argument $r_\hi + r_\mi$ respectively $r_\hi + r_\mi + r_\lo$ corresponding to their mathematical equivalent $\hat{r}$ are bounded by $\left \vert \hat{r} \right \vert \leq \frac{\ln\left( 2 \right)}{2^{12}} \cdot \left( 2^{-1} + 2^{-19} \right) + \delta < 2^{-13}$. After simplification by $e^{r_\hi + r_\mi + r_\lo} = e^{r_\hi} \cdot e^{r_\mi} \cdot e^{r_\lo}$, $e^{r_\hi} - 1$ is approximated by a polynomial of degree 4 or 7. The functions $e^{r_\mi} - 1$ and potentially $e^{r_\lo} - 1$ are both approximated linearly by $r_\mi$ or, respectively, $r_\lo$. Concerning the approximation errors for $e^{r_\mi}$ and $e^{r_\lo}$, one can note that $\left \vert r_\mi \right \vert \leq 2^{-52} \cdot 2^{-13} \leq 2^{-65}$ and $\left \vert r_\lo \right \vert \leq 2^{-105} \cdot 2^{-13} \leq 2^{-118}$. In consequence $\epsilon_{\mbox{\tiny approxargmiddle}} = \frac{r_\mi - \left( e^{r_\mi} - 1 \right)}{\left( e^{r_\mi} - 1 \right)}$ and $\epsilon_{\mbox{\tiny approxarglower}} = \frac{r_\lo - \left( e^{r_\lo} - 1 \right)}{\left( e^{r_\lo} - 1 \right)}$ are bounded by $\left \vert \epsilon_{\mbox{\tiny approxargmiddle}} \right \vert \leq 2^{-66}$ and $\left \vert \epsilon_{\mbox{\tiny approxarglower}} \right \vert \leq 2^{-119}$. \subsection{Quick phase polynomial approximation and reconstruction} In quick phase $e^{r_\hi} - 1$ is approximated by a polynomial $p\left( r_\hi \right)$ of the following form $$p\left( r_\hi \right) = r_\hi + \frac{1}{2} \cdot r_\hi^2 + c_3 \cdot r_\hi^3 + c_4 \cdot r_\hi^4$$ The coefficients $c_3$ and $c_4$ are stored in double precision, $\frac{1}{2}$ is exactly representable. For $r_\hi$ bounded as indicated above, the relative approximation error $\epsilon_{\mbox{\tiny approxarghighquick}} = \frac{p\left( r_\hi \right) - e^{r_\hi} + 1}{e^{r_\hi} - 1}$ is bounded by $\left \vert \epsilon_{\mbox{\tiny approxarghighquick}} \right \vert \leq 2^{-62}$. The polynomial $p\left(r_\hi \right) - r_\hi = \frac{1}{2} \cdot r_\hi^2 + c_3 \cdot r_\hi^3 + c_4 \cdot r_\hi^4$ is evaluated in double precision using the following scheme: \begin{enumerate} \item In the beginning, an approximation to $r_\hi^2$, $rhSquare$, is computed. Concurrently, $c_3$ is multiplied by $r_\hi$ yielding to $rhC3 = c_3 \cdot r_\hi \cdot \left( 1 + \epsilon \right)$. \item At the first step, the squared argument $rhSquare$ is multiplied by $\frac{1}{2}$ yielding to the approximation $rhSquareHalf$. At the same time, it is multiplied by $rhC3$ which results in $monomialCube$ approximating now $c_3 \cdot r_\hi^3$. Still in the same moment, it is squared once again yielding to $rhFour$ which approximates thus $r_\hi^4$. \item At the next dependency top, $rhFour$ is multiplied by $c_4$. This results in $monomialFour$ -- a value corresponding to $c_4 \cdot r_\hi^4$. \item In the next moment, $monomialCube$ and $monomialFour$ are added together. This gives a value approximating $c_3 \cdot r_\hi^3 + c_4 \cdot r_\hi^4$. \item Finally, $rhSquareHalf$ is added to the value obtained at the previous step yielding to an arithmetical approximation of $\frac{1}{2} \cdot r_\hi + c_3 \cdot r_\hi^3 + c_4 \cdot r_\hi^4$, stored in $highPolyWithSquare$. \end{enumerate} This scheme does not completely exploit the possible parallelism for purpose of not deteriorating too much the final accuracy. It is implemented as follows: \begin{lstlisting}[caption={Quick phase polynomial evaluation - high order terms},firstnumber=1] rhSquare = rh * rh; rhC3 = c3 * rh; rhSquareHalf = 0.5 * rhSquare; monomialCube = rhC3 * rhSquare; rhFour = rhSquare * rhSquare; monomialFour = c4 * rhFour; highPoly = monomialCube + monomialFour; highPolyWithSquare = rhSquareHalf + highPoly; \end{lstlisting} The following steps must still add the linear term $r_\hi$ of the polynomial ($p\left( r_\hi \right) = r_\hi + highPolyWithSquare$) and reconstruct the exponential as $$e^{x} = 2^M \cdot \left( tbl_{1\hi} + tbl_{1\mi} \right) \cdot \left( tbl_{2\hi} + tbl_{2\mi} \right) \cdot \left( 1 + r_\hi + highPolyWithSquare \right) \cdot \left( 1 + r_\mi \right) + \delta$$ In order to allow for increasing speed by approximating different terms, they are implemented as this: \begin{enumerate} \item The two table values $tbl_{1\hi} + tbl_{1\mi}$ and $tbl_{2\hi} + tbl_{2\mi}$ are multiplied using a double-double multiplication operator yielding to $tables_\hi + tables_\lo = \left( tbl_{1\hi} + tbl_{1\mi} \right) \cdot \left( tbl_{2\hi} + tbl_{2\mi} \right) \cdot \left( 1 + \epsilon \right)$. \item The term \\ $\left( 1 + r_\hi + highPolyWithSquare \right) \cdot \left( 1 + r_\mi \right) =$ \\ $1 + r_\hi + highPolyWithSquare + r_\mi + r_\hi \cdot r_\mi + highPolyWithSquare \cdot r_\mi$ \\ is approximated by neglecting the quadratic terms. First $r_\hi$ and $highPolyWithSquare$ are added together in double precision. Their sum is then added to $r_\hi$ in double precision, too. This yields to the intermediate value $t_9$. The addition with $1$ is not explicited. \item The multiplication $\left( tables_\hi + tables_\lo \right) \cdot \left( 1 + t_9 \right)$ is approximated by $tables_\hi + tables_\lo + tables_\hi \cdot t_9$. The multiplication $tables_\hi \cdot t_9$ is performed in double precision. It produces $t_{10}$. \item The addition $tables_\hi + tables_\lo + t_{10}$ is carried out in double-double precision. Its result $polyTbl_\hi + polyTbl_\mi$ approximates finally $$polyTbl_\hi + polyTbl_\mi = \left( tbl_{1\hi} + tbl_{1\mi} \right) \cdot \left( tbl_{2\hi} + tbl_{2\mi} \right) \cdot \left( 1 + p\left( r_\hi \right) \right) \cdot \left( 1 + r_\mi \right) \cdot \left( 1 + \epsilon \right)$$ for some relative error $\epsilon$. \end{enumerate} The steps explained above are implemented in the code as follows: \begin{lstlisting}[caption={Quick phase reconstruction},firstnumber=1] Mul22(&tablesh,&tablesl,tbl1h,tbl1m,tbl2h,tbl2m); t8 = rm + highPolyWithSquare; t9 = rh + t8; t10 = tablesh * t9; Add12(t11,t12,tablesh,t10); t13 = t12 + tablesl; Add12(polyTblh,polyTblm,t11,t13); \end{lstlisting} The final result for the exponential is $e^x \approx 2^M \cdot \left( polyTbl_\hi + polyTbl_\mi \right)$. On this value, a rounding test would have to be performed. Since gradual underflow is excluded by special case handling, the multiplication by $2^M$ is exact. In consequence, it is possible to do the rounding test on $polyTbl_\hi + polyTbl_\mi$ and to multiply then by $2^M$. This is the way chosen in the given implementation. See section \ref{sec:expfinalround}, page \pageref{sec:expfinalround}, for further details. \subsection{Accurate phase polynomial approximation and reconstruction} In accurate phase, $e^{r_\hi} - 1$ is approximated by a polynomial $p\left( r_\hi \right)$ of degree $7$. It has the following form: $$p\left( r_\hi \right) = r_\hi + \frac{1}{2} \cdot r_\hi^2 + r_\hi^3 \cdot \left( \left( c_{3\hi} + c_{3\lo} \right) + r_\hi \cdot \left( \left( c_{4\hi} + c_{4\lo} \right) + r_\hi \cdot \left( c_5 + r_\hi \cdot \left( c_6 + r_\hi \cdot c_7 \right) \right) \right) \right)$$ Coefficients $c_{3\hi} + c_{3\lo}$ and $c_{4\hi} + c_{4\lo}$ are stored as double-double numbers, coefficients $c_5$ through $c_7$ are stored in double precision. For $r_\hi$ bounded by $\left \vert r_\hi \right \vert \leq 2^{-13}$, the relative approximation error $\epsilon_{\mbox{\tiny approxarghighaccu}} = \frac{p\left( r_\hi \right) - e^{r_\hi} + 1}{e^{r_\hi} - 1}$ is bounded by $\left \vert \epsilon_{\mbox{\tiny approxarghighaccu}} \right \vert \leq 2^{-113}$. For $r_\hi$ such that $\left \vert r_\hi \right \vert \leq 2^{-30}$, $\epsilon_{\mbox{\tiny approxarghighaccu}}$ is bounded by $\left \vert \epsilon_{\mbox{\tiny approxarghighaccu}} \right \vert \leq 2^{-160}$. The polynomial $p\left( r_\hi \right)$ is evaluated as follows: \begin{enumerate} \item The high order terms of $p\left( r_\hi \right)$, $c_5 + r_\hi \cdot \left( c_6 + r_\hi \cdot c_7 \right)$ are evaluated in double precision using Horner's scheme. The result of this evaluation is stored in $highPoly \approx c_5 + r_\hi \cdot \left( c_6 + r_\hi \cdot c_7 \right)$. \item The multiplication $r_\hi \cdot highPoly$ is implemented using an exact operator and yields to a double-double $t_{1\hi} + t_{1\lo}$. The following steps leading to $t_{4\hi} + t_{4\lo} \approx \left( c_{3\hi} + c_{3\lo} \right) + r_\hi \cdot \left( \left( c_{4\hi} + c_{4\lo} \right) + \left( t_{1\hi} + t_{1\lo} \right) \right)$ are implemented using double-double computations and Horner's scheme. \item The sum of the low order terms $r_\hi + \frac{1}{2} \cdot r_\hi^2$, stored in a non-overlapped triple-double $lowPoly_\hi + lowPoly_\mi + lowPoly_\lo$, is computed exactly as follows: first $r_\hi$ is squared exactly using an exact multiplication operator producing $rhSquare_\hi + rhSquare_\lo = r_\hi \cdot r_\hi$. Since for arguments $x$ to the exponential function such that $\left \vert x \right \vert \leq 2^{-55}$ rounding is trivial in all rounding modes, we can suppose that $\left \vert x \right > 2^{-55}$. In consequence, since $x$ is a double precision number, the reduced argument $r_\hi$ is either equal to $0$ or greater in magnitude than $2^{-58}$. So both $rhSquare_\hi$ and $rhSquare_\lo$ are either exactly $0$ or greater in magnitude than $\left( 2^{-58} \right)^2 \cdot 2^{-53} = 2^{-169}$. They are thus never subnormal. Therefore the pairwise multiplication of $rhSquare_\hi + rhSquare_\lo$ by $\frac{1}{2}$ yielding to $rhSquareHalf_\hi + rhSquareHalf_\lo = \frac{1}{2} \cdot r_\hi^2$ is exact. Since $r_\hi$ is such that $\left \vert r_\hi \right \vert \leq 2^{-13}$, $r_\hi + rhSquareHalf_\hi + rhSquareHalf_\lo$ can be considered as a partially overlapped triple-double number. The overlap bound is such that $\left \vert rhSquareHalf_\hi \right \vert \leq 2^{-12} \cdot \left \vert r_\hi \right \vert$ and $\left \vert rhSquareHalf_\lo \right \vert \leq 2^{-53} \cdot \left \vert rhSquareHalf_\hi \right \vert$. Thus it is possible to use the \Renormalize~ sequence \cite{Lauter2005LIP:tripledouble} to obtain a non-overlapped triple-double $lowPoly_\hi + lowPoly_\mi + lowPoly_\lo$ which is exactly equal to $r_\hi + \frac{1}{2} \cdot r_\hi^2$ because the renormalization operator is exact and all preceeding operations have been, too. \item An triple-double approximation to $r_\hi^3$, stored in $rhCube_\hi + rhCube_\mi + rhCube_\lo$ is computed by multiplying $r_\hi$ by the exact $rhSquare_\hi + rhSquare_\lo$ computed in the previous step. For this operation the \MulDT~ sequence is used. \item The approximation of the high order terms of the polynomial, $t_{4\hi} + t_{4\lo}$ is then multiplied by $rhCube_\hi + rhCube_\mi + rhCube_\lo$ using a triple-double multiplication operator. The result of this operation is added to $lowPoly_\hi + lowPoly_\mi + lowPoly_\lo$ in order to obtain a potentially overlapped triple-double $p_\hi + p_\mi + p_\lo$ approximating $p\left( r_\hi \right)$. \end{enumerate} All this steps are implemented by the following code: \begin{lstlisting}[caption={Accurate phase polynomial approximation},firstnumber=1] highPoly = accPolyC5 + rh * (accPolyC6 + rh * accPolyC7); Mul12(&t1h,&t1l,rh,highPoly); Add22(&t2h,&t2l,accPolyC4h,accPolyC4l,t1h,t1l); Mul22(&t3h,&t3l,rh,0,t2h,t2l); Add22(&t4h,&t4l,accPolyC3h,accPolyC3l,t3h,t3l); Mul12(&rhSquareh,&rhSquarel,rh,rh); Mul23(&rhCubeh,&rhCubem,&rhCubel,rh,0,rhSquareh,rhSquarel); rhSquareHalfh = 0.5 * rhSquareh; rhSquareHalfl = 0.5 * rhSquarel; Renormalize3(&lowPolyh,&lowPolym,&lowPolyl,rh,rhSquareHalfh,rhSquareHalfl); Mul233(&highPolyMulth,&highPolyMultm,&highPolyMultl,t4h,t4l,rhCubeh,rhCubem,rhCubel); Add33(&ph,&pm,&pl,lowPolyh,lowPolym,lowPolyl,highPolyMulth,highPolyMultm,highPolyMultl); \end{lstlisting} For reconstructing $e^x$ out of the polynomial approximation of $e^{r_\hi}-1$, $e^{r_\mi}-1$, $e^{r_\lo}-1$ and the table values $tbl_{1\hi} + tbl_{1\mi} + tbl_{1\lo}$ and $tbl_{2\hi} + tbl_{2\mi} + tbl_{2\lo}$ the following term must be approximated: $$e^x \approx 2^M \cdot \left( tbl_{1\hi} + tbl_{1\mi} + tbl_{1\lo} \right) \cdot \left( tbl_{2\hi} + tbl_{2\mi} + tbl_{2\lo} \right) \cdot \left( 1 + \left( p_\hi + p_\mi + p_\lo \right) \right) \cdot \left( 1 + r_\mi \right) \cdot \left( 1 + r_\lo \right)$$ First, the following approximation is possible $$\left( 1 + \left( p_\hi + p_\mi + p_\lo \right) \right) \cdot \left( 1 + r_\mi \right) \cdot \left( 1 + r_\lo \right) \approx 1 + \left( p_\hi + p_\mi + p_\lo + r_\mi + r_\lo + \left( r_\mi + r_\lo \right) \cdot \left( p_\hi + p_\mi \right) \right)$$ First an arithmetical approximation $fullPoly_\hi + fullPoly_\mi + fullPoly_\lo$ to $p_\hi + p_\mi + p_\lo + r_\mi + r_\lo + \left( r_\mi + r_\lo \right) \cdot \left( p_\hi + p_\mi \right)$ is computed as follows: \begin{enumerate} \item By means of an exact, unconditional addition, $p_\hi$ and $p_\mi$, which may be potentially overlapped because of being the higher significant parts of an overlapped triple-double, are renormalized. \item They are then multiplied by the non-overlapping $r_\mi + r_\lo$ using a double-double multiplication operator. The result of this product is added to $r_\mi + r_\lo$ in double-double precision. \item The result of this addition, $q_\hi + q_\lo$, approximates thus $r_\mi + r_\lo + \left( r_\mi + r_\lo \right) \cdot \left( p_\hi + p_\mi \right)$. \item The triple-double addition operator \AddDTT~ allows then for adding $p_\hi + p_\mi + p_\lo$ to $q_\hi + q_\lo$ resulting in $fullPoly_\hi + fullPoly_\mi + fullPoly_\lo$. \end{enumerate} Then $1$ is added to $fullPoly_\hi + fullPoly_\mi + fullPoly_\lo$ by the following code sequence: \begin{lstlisting}[caption={Addition with $1$},firstnumber=1] Add12(polyAddOneh,t5,1,fullPolyh); Add12Cond(polyAddOnem,t6,t5,fullPolym); polyAddOnel = t6 + fullPolyl; \end{lstlisting} Since the \Add~ operator is exact, the round-off error of this adding of $1$ is equal to the round-off error in the last addition $polyAddOne_\lo = t_6 \oplus fullPoly_\lo$. In absolute value, it is always less than $2^{-53} \cdot \left \vert t_6 + fullPoly_\lo \right \vert$. Since $\left \vert r_\hi \right \vert \leq 2^{-12}$, one checks that $\frac{1}{2} < polyAddOne_\hi < 2$. So the relative error of this addition with $1$, $\epsilon_{\mbox{\tiny addOne}}$ is in magnitude less than $2^{-52} \cdot \left \vert t_6 + fullPoly_\lo \right \vert$. This is particularly important when considering high critical precision worst cases, see section \ref{sec:expaccuracy}, page \pageref{sec:expaccuracy}. The result of the polynomial approximation, $$polyWithOne_\hi + polyWithOne_\mi + polyWithOne_\lo \approx e^{r_\hi} \cdot e^{r_\mi} \cdot e^{r_\lo}$$ is then multiplied in two steps first by $tbl_{1\hi} + tbl_{1\mi} + tbl_{2\lo}$ and then by $tbl_{2\hi} + tbl_{2\mi} + tbl_{2\lo}$ using each time the triple-double multiplication operator \MulTT. Remark that these multiplications are exact for arguments $\left \vert x \right \vert \leq 2^{-14}$ because in this case, $k=0$, $i_1 = 0$ and $i_2 = 0$ which implies that $tbl_{1\hi} = 1$, $tbl_{2\hi} = 1$ and $tbl_{i\mi} = 0$ and $tbl_{i\lo} = 0$. In fact machine multiplications by $1$ are always exact. The final product of this multiplications may be overlapped and is therefore renormalized using the \Renormalize~ sequence. This yields to the non-overlapped triple-double $polyTbl_\hi + polyTbl_\mi + polyTbl_\lo$ approximating $\frac{e^x}{2^M}$. All these steps are implemented by the following code sequence: \begin{lstlisting}[caption={Accurate phase reconstruction},firstnumber=1] Add12(phnorm,pmnorm,ph,pm); Mul22(&rmlMultPh,&rmlMultPl,rm,rl,phnorm,pmnorm); Add22(&qh,&ql,rm,rl,rmlMultPh,rmlMultPl); Add233Cond(&fullPolyh,&fullPolym,&fullPolyl,qh,ql,ph,pm,pl); Add12(polyAddOneh,t5,1,fullPolyh); Add12Cond(polyAddOnem,t6,t5,fullPolym); polyAddOnel = t6 + fullPolyl; Mul33(&polyWithTbl1h,&polyWithTbl1m,&polyWithTbl1l,tbl1h,tbl1m,tbl1l,polyAddOneh,polyAddOnem,polyAddOnel); Mul33(&polyWithTablesh,&polyWithTablesm,&polyWithTablesl, tbl2h,tbl2m,tbl2l, polyWithTbl1h,polyWithTbl1m,polyWithTbl1l); Renormalize3(polyTblh,polyTblm,polyTbll,polyWithTablesh,polyWithTablesm,polyWithTablesl); \end{lstlisting} The multiplication of $polyTbl_\hi + polyTbl_\mi + polyTbl_\lo$ by $2^M$ and the final rounding will be discussed in the next section. \section{Final rounding}\label{sec:expfinalround} For both quick and accurate phase, final rounding is simple when the result cannot be underflowed. In this case, the final multiplication of $t_1 \cdot t_2 \cdot e^r$ by $2^M$ only affects the exponent of $t_1 \cdot t_2 \cdot e^r$. So the rounding test and the final rounding (in quick and accurate phase) can be done on $t_1 \cdot t_2 \cdot e^r$ before this value is multiplied by $2^M$. This rounding is a standard \crlibm~ rounding of respectively a double-double or a triple-double. Since $M$ might be as great as $M = 1024$ (whilst $t_1 \cdot t_2 \cdot e^r < 1$ in this case, because overflow in the final result has been filtered out), $2^M$ may not be representable. Nevertheless it is possible not to representate $2^M$ explicitely in a variable and to replace the operation by the following sequence. We suppose that $polyTbl_\hi = \round \left( t_1 \cdot t_2 \cdot e^r + \delta \right)$. \begin{lstlisting}[caption={Final multiplication by $2^M$},firstnumber=1] polyTblhdb.d = polyTblh; polyTblhdb.i[HI] += M << 20; return polyTblhdb.d; \end{lstlisting} If the result might be gradually underflowed but is not completely underflowed (i.e. not equal to $0$ or $0^+$ depending on the rounding mode), the quick phase is not used and the accurate phase is launched in any case. This does not sensibly affect performance. The triple-double result of the accurate phase, \texttt{polyTblh}, \texttt{polyTblm} and \texttt{polyTbll}, where $polyTbl_\hi + polyTbl_\mi + polyTbl_\lo \approx t_1 \cdot t_2 \cdot e^r$, is multiplied by $2^M$ and rounded to double precision as follows: \begin{itemize} \item $polyTbl_\hi$ is multiplied by $2^M$ in two steps: $2^M$ is not representable in double precision but $2^{-1000}$ and $2^{M+1000}$ are. This multiplication generates a subnormal $t_4$, which prevents us from replacing it by an integer sequence manipulating the exponent of the numbers involved. We have $t_4 = \round \left( 2^M \cdot polyTbl_\hi\right) = 2^M polyTbl_\hi + \delta$ with $\left \vert \delta \right \vert \leq \frac{1}{2} \cdot \mUlp\left( \mbox{\small \it denorm} \right) = 2^{-1075}$. \item The obtained value $t_4$ is remultiplied by $2^{-M}$, once again in $2$ steps. This multiplication produces a normal number and is therefore exact: $t_6 = 2^{-M} \cdot \round\left( 2^M \cdot polyTbl_\hi \right) = polyTbl_\hi + 2^{-M} \cdot \delta$. \item Since $\left \vert M \right \vert \leq 1075$ and $\left \vert polyTbl_\hi \right \vert \leq 2$, one checks that $$\frac{1}{2} \cdot polyTbl_\hi \leq t_6 \leq 2 \cdot polyTbl_\hi$$ is verified. So the arithmetical substraction $t_7 = polyTbl_\hi \ominus t_6$ is exact by Sterbenz' lemma and one obtains: $$t_7 = 2^{-M} \cdot \left( 2^M \cdot polyTbl_\hi - \round \left( 2^M \cdot polyTbl_\hi \right) \right)$$ We obtain therefore $$t_4 + 2^M \cdot \left( t_7 + polyTbl_\mi + polyTbl_\lo \right) = 2^M \cdot \left( polyTbl_\hi + polyTbl_\mi + polyTbl_\lo \right)$$ Further, since the triple-double number $polyTbl_\hi + polyTbl_\mi + polyTbl_\lo$ is non-overlapping, we know that $$t_4 \in \left \lbrace r^-, r, r^+\right \rbrace$$ with $r = \round \left( polyTbl_\hi + polyTbl_\mi + polyTbl_\lo \right)$. In addition, since the precision of a denormal is maximally $52$ bits and that of a normal (like $polyTbl_\hi$) is $53$ bits, $t_7$ is either $0$ or greater in magnitude than $polyTbl_\mi + polyTbl_\lo$. If this were not the case, the triple-double would overlap. Thus $2^M \cdot \left( t_7 + polyTbl_\mi + polyTbl_\lo \right)$ corresponds to the part of the high accuracy mantissa that is rounded off when rounding to the subnormal and if $t_7$ is not zero, it contains at least the first bit that is rounded off. \end{itemize} The arithmetical steps mentioned are performed by the following code sequence: \begin{lstlisting}[caption={Underflowed final multiplication and rounding},firstnumber=1] /* Final rounding and multiplication with 2^M We first multiply the highest significant byte by 2^M in two steps and adjust it then depending on the lower significant parts. We cannot multiply directly by 2^M since M is less than -1022. We first multiply by 2^(-1000) and then by 2^(M+1000). */ t3 = polyTblh * twoPowerM1000; /* Form now twoPowerM with adjusted M */ twoPowerMdb.i[LO] = 0; twoPowerMdb.i[HI] = (M + 2023) << 20; /* Multiply with the rest of M, the result will be denormalized */ t4 = t3 * twoPowerMdb.d; /* For x86, force the compiler to pass through memory for having the right rounding */ t4db.d = t4; /* Do not #if-ify this line, we need the copy */ #if defined(CRLIBM_TYPECPU_AMD64) || defined(CRLIBM_TYPECPU_X86) t4db2.i[HI] = t4db.i[HI]; t4db2.i[LO] = t4db.i[LO]; t4 = t4db2.d; #endif /* Remultiply by 2^(-M) for manipulating the rounding error and the lower significant parts */ M *= -1; twoPowerMdb.i[LO] = 0; twoPowerMdb.i[HI] = (M + 23) << 20; t5 = t4 * twoPowerMdb.d; t6 = t5 * twoPower1000; t7 = polyTblh - t6; \end{lstlisting} One remarks that on $x86$ platforms, it is necessary to write $t_4$ to memory and to reread it from there in order to to overcome the inexistence of pseudosubnormals in the underlying $80$ bit register format. Depending on the rounding mode, $t_4$ is then adjusted to the correct rounding of \\$2^M \cdot \left( polyTbl_\hi + polyTbl_\mi + polyTbl_\lo \right)$ as follows: \begin{itemize} \item In round-to-nearest mode, the rounding decision when rounding to a subnormal is made at a constant value $\frac{1}{2} \cdot \mUlp\left( \mbox{\small \it denorm}\right) = 2^{-1075}$. Rounding is simple for round-to-nearest when the mantissa does not contain a one following the last mantissa bit of the rounded result. In this case, the rounding downwards and thus equivalent to a truncation. Truncation to different lengths is associative. Omitting $polyTbl_\mi + polyTbl_\lo$ is a truncation. The rounding of $2^M \cdot polyTbl_\hi$ to a subnormal is correct as per the use of a IEEE 754 operation. So $t_4$ already is equal to $\round\left( polyTbl_\hi + polyTbl_\mi + polyTbl_\lo \right)$. If the first bit following the last mantissa bit of the rounded result is a one, two cases must be considered: if the TMD's case is such that the next following mantissa one is contained in the bits of $polyTbl_\hi$ that are rounded of, the rounding $\round \left( 2^M \cdot polyTbl_\hi \right)$ is equivalent to the rounding $\round \left( 2^M \cdot \left( polyTbl_\hi + polyTbl_\mi + polyTbl_\lo \right) \right)$ because both roundings are upwards. So in this case, too, $t_4$ already contains the correct result. In contrast, if the the TMD's case is such that the next following mantissa one (after the first one following the rounded mantissa) is only contained in $polyTbl_\mi + polyTbl_\lo$, the rounding direction of $\round \left( 2^M \cdot polyTbl_\hi \right)$ and $\round \left( 2^M \cdot \left( polyTbl_\hi + polyTbl_\mi + polyTbl_\lo \right) \right)$ may be different. As $t_7$ is the (scaled) correction of the roundoff of $\round \left( 2^M \cdot polyTbl_\hi \right)$ and greater in magnitude than $polyTbl_\mi + polyTbl_\lo$, its sign determines the rounding direction of the rounding $t_4 = \round \left( 2^M \cdot polyTbl_\hi \right)$. The sign of $polyTbl_\mi = \round \left( polyTbl_\hi + polyTbl_\lo \right)$ determines then that of the direction of \\$\round \left( 2^M \cdot \left( polyTbl_\hi + polyTbl_\mi + polyTbl_\lo \right) \right)$ and such whether $t_4$ must be adjusted by $\pm 1 \mUlp$. The algorithm is thus the following: $2^M \cdot t_7$ is compared to $\frac{1}{2} \cdot \mUlp\left( \mbox{\small \it denorm}\right)$ by comparing $t_7$ to $2^{-1075-M}$. This determines whether the rounding is easy and $t_4$ can be returned or whether an adjustment must be made. If the latter is the case, the signs of $t_7$ and $polyTbl_\hi$ are examined and $t_4$ is adjusted. Since $e^x > 0 \mbox{~~} \forall x \in \R$, the adjustment of $t_4$ by $\pm \mUlp$ can be simplified. The code sequence below implements this: \begin{lstlisting}[caption={Rounding adjustment in round-to-nearest},firstnumber=1] /* The rounding decision is made at 1/2 ulp of a denormal, i.e. at 2^(-1075) We construct this number and by comparing with it we get to know whether we are in a difficult rounding case or not. If not we just return the known result. Otherwise we continue with further tests. */ twoPowerMdb.i[LO] = 0; twoPowerMdb.i[HI] = (M - 52) << 20; if (ABS(t7) != twoPowerMdb.d) return t4; /* If we are here, we are in a difficult rounding case */ /* We have to adjust the result iff the sign of the error on rounding 2^M * polyTblh (which must be an ulp of a denormal) and polyTblm +arith polyTbll is the same which means that the error made was greater than an ulp of an denormal. */ polyTblm = polyTblm + polyTbll; if (t7 > 0.0) { if (polyTblm > 0.0) { t4db.l++; return t4db.d; } else return t4; } else { if (polyTblm < 0.0) { t4db.l--; return t4db.d; } else return t4; } \end{lstlisting} \item In round-upwards mode, the rounding~~ $\roundup \left( polyTbl_\hi + polyTbl_\mi + polyTbl_\lo \right)$ is determined by $\round\left( polyTbl_\hi \right)$ and the rounding rest $2^M \cdot \left( t_7 + polyTbl_\mi + polyTbl_\lo \right)$. If $t_7$ not equal to $0$, it is greater in magnitude than $polyTbl_\mi + polyTbl_\lo$. Thus the rounding direction of the to-nearest rounding $\round\left( polyTbl_\hi \right)$ is downwards if $t_7 + polyTbl_\mi + polyTbl_\lo$ is positive. In this case, an adjustment of $+ 1 \mUlp$ must be made on $t_4$. If $t_7$ is equal to $0$, the rounding $\round\left( polyTbl_\hi \right)$ was errorless and $t_4 = 2^M \cdot polyTbl_\hi$. So we get $$\roundup\left( 2^M \cdot \left( polyTbl_\hi + polyTbl_\mi + polyTbl_\lo \right) \right) = \roundup\left( t_4 + 2^M \cdot \left( polyTbl_\mi + polyTbl_\lo \right) \right)$$ Clearly, $2^M \cdot \left( polyTbl_\mi + polyTbl_\lo \right)$ is less than $\mUlp\left( t_4 \right)$ because $polyTbl_\hi + polyTbl_\mi + polyTbl_\lo$ is non-overlapping. One can show that $$\roundup\left( x + \mu \right) = \roundup\left( x + \nu \right)$$ if $x \in \F$ and $\sgn\left( \mu \right) = \sgn\left( \nu \right)$, $\left \vert \mu \right \vert, \left \vert \nu \right \vert < \mUlp\left( x \right)$ and $\mu, \nu \in \R$ \cite{Lauter2005LIP:tripledouble}. Since the algebraic images of double arguments have been filtered out, it is thus possible to find $\mu \in \R$ such that with $\nu = 2^M \cdot \left( polyTbl_\mi + polyTbl_\lo \right)$ respectively $\nu = \mUlp\left(t_4\right) + 2^M \cdot \left( polyTbl_\mi + polyTbl_\lo \right)$ the following can be verified: $$\roundup \left( t_4 + 2^M \cdot \left( polyTbl_\mi + polyTbl_\lo \right) \right) = \left \lbrace \begin{array}{ll} t_4 & \mbox{ if } polyTbl_\mi + polyTbl_\lo < 0 \\ t_4^+ & \mbox{ otherwise} \end{array} \right.$$ So it suffices to add $t_7$ and $polyTbl_\mi = \round\left( polyTbl_\mi + polyTbl\lo \right)$ together and to check for the sign of this sum. The rounding error of this operation may not affect the sign of its result. If the sign is positive, $+1 \mUlp$ is added to $t_4$. The following code sequence realizes this: \begin{lstlisting}[caption={Rounding adjustment in round-upwards},firstnumber=1] /* The rounding can be decided using the sign of the arithmetical sum of the round-to-nearest-error (i.e. t7) and the lower part(s) of the final result. We add first the lower parts and add the result to the error in t7. We have to keep in mind that everything is scaled by 2^(-M). t8 can never be exactly 0 since we filter out the cases where the image of the function is algebraic and the implementation is exacter than the TMD worst case. */ polyTblm = polyTblm + polyTbll; t8 = t7 + polyTblm; /* Since we are rounding upwards, the round-to-nearest-rounding result in t4 is equal to the final result if the rounding error (i.e. the error plus the lower parts) is negative, i.e. if the rounding-to-nearest was upwards. */ if (t8 < 0.0) return t4; /* If we are here, we must adjust the final result by +1ulp Relying on the fact that the exponential is always positive, we can simplify this adjustment */ t4db.l++; return t4db.d; \end{lstlisting} \item Round-downwards mode is analogous to round-upwards mode with signs inverted. \item Round-towards-zero is equivalent to rounding downwards. \end{itemize} \section{Accuracy bounds}\label{sec:expaccuracy} In this section we give an overview on the error bound computation. The actual error bound proof is implemented using the Gappa tool. An implementation of the exponential function in double precision can be considered to be correctly rounding if the accuracy of the accurate phase is at least $113$ bits for arguments $x$ such that $\left \vert x \right \vert \geq 2^{-30}$ and at least $158$ bits for $2^{-54} \leq \left \vert x \right \vert < 2^{-30}$ -- provided that the rounding test after the quick phase is correct \cite{DinDefLau2004LIP}. In order to give a first error estimate, one can consider \begin{eqnarray*} \mbox{\tt exp(x)} & = & 2^M \cdot tbl_1 \cdot tbl_2 \cdot \left( 1 + p\left( r_\hi \right) \right) \cdot \left( 1 + r_\mi \right) \cdot \left( 1 + r_\lo \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny arith}} \right) \\ & = & 2^M \cdot t_1 \cdot \left( 1 + \epsilon_{\mbox{\tiny tbl1}} \right) \cdot t_2 \left( 1 + \epsilon_{\mbox{\tiny tbl1}} \right) \cdot \\ & & \cdot \left( 1 + \left( e^{r_\hi} - 1 \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny approxhigh}} \right) \right) \cdot \\ & & \cdot \left( 1 + \left( e^{r_\mi} - 1 \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny approxmiddle}} \right) \right) \cdot \\ & & \cdot \left( 1 + \left( e^{r_\lo} - 1 \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny approxlower}} \right) \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny arith}} \right) \\ & = & 2^M \cdot t_1 \cdot t_2 \cdot e^{r_\hi + r_\mi + r_\lo} \cdot \\ & & \cdot \left( 1 + \epsilon_{\mbox{\tiny tbl1}} \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny tbl2}} \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny approxhigh}}^\prime \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny approxmiddle}}^\prime \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny approxlower}}^\prime \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny arith}} \right) \\ & = & 2^M \cdot t_1 \cdot t_2 \cdot e^{\hat{r}} \cdot \\ & & \cdot \left( 1 + \epsilon_{\mbox{\tiny tbl1}} \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny tbl2}} \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny approxhigh}}^\prime \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny approxmiddle}}^\prime \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny approxlower}}^\prime \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny arith}} \right) \cdot \left( 1 + \epsilon_{\mbox{\tiny argred}} \right) \\ & = & e^x \cdot \left( 1 + \epsilon \right) \end{eqnarray*} where $\epsilon_{\mbox{\tiny approxhigh}}^\prime = \epsilon_{\mbox{\tiny approxhigh}} - \frac{\epsilon_{\mbox{\tiny approxhigh}}}{e^{r_\hi}}$, $\epsilon_{\mbox{\tiny approxmiddle}}^\prime = \epsilon_{\mbox{\tiny approxmiddle}} - \frac{\epsilon_{\mbox{\tiny approxmiddle}}}{e^{r_\mi}}$ and $\epsilon_{\mbox{\tiny approxlower}}^\prime = \epsilon_{\mbox{\tiny approxlower}} - \frac{\epsilon_{\mbox{\tiny approxlower}}}{e^{r_\lo}}$. The Gappa proof files integrate all these errors and allow for evaluating the relative arithmetical round-off error $\epsilon_{\mbox{\tiny arith}}$. %TODO: inserer les valeurs obtenues en Gappa pour les deux phases \section{Timings}\label{sec:exptiming} For evaluating the timings of the triple-double based implementation of the exponential function $e^x$, in comparison with other correctly rounded functions. ``{\tt crlibm} portable using {\tt scslib}'' still stands for a logarithm implementation in {\tt crlibm} before the work on triple-double. The values are given in arbitrary units and obtained on a IBM Power 5 processor with gcc 3.3.3 on a Linux Kernel 2.6.5. The timings on other systems are comparable. \begin{center} \begin{tabular}{|l|r|r|} \hline Library & avg time & max time \\ \hline \hline \texttt{MPFR} & 2128 & 4908 \\ \hline \texttt{crlibm} portable using \texttt{scslib} & 44 & 1976 \\ \hline \texttt{crlibm} portable using triple-double & 39 & 258 \\ \hline default \texttt{libm} (IBM's {\tt libultim}) & 34 & 221062 \\ \hline \end{tabular} \end{center} On average, our triple-double based implementation wins about $12\%$ speed-up in comparison with the SCS based implementation. It is however slightly less performant than Ziv's library. Concerning worst case timing, the results are more striking and confirm the general results concering triple-double: the use of triple-double arithmetic instead of the SCS format allows for a speed-up of a factor of about $7.65$. In comparison with IBM's {\tt libultim} a performance gain of a factor $857$ is achieved. The timing difference between average and worst-case is decreased to a factor of about $6.6$. %%% Local Variables: %%% mode: latex %%% TeX-master: "crlibm" %%% End: interval-2.1.0/src/crlibm/docs/latex/expm1.tex0000644000000000000000000000007113031036767017350 0ustar 00000000000000 Todo. In between, see files expm1-td.\{h,c,mpl,gappa\}. interval-2.1.0/src/crlibm/docs/latex/fig_exp/reconstruction.fig0000644000000000000000000005667113031036767023006 0ustar 00000000000000#FIG 3.2 Portrait Center Metric A4 24.00 Single -2 1200 2 0 32 #ffffff 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 12558 69 747 542 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 12558 69 747 542 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 10393 2362 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 10393 2362 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 14173 7086 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 14173 7086 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 17952 8503 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 17952 8503 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 14173 1417 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 14173 1417 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 14173 -5669 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 14173 -5669 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 17952 2834 944 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 17952 2834 944 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 17952 0 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 17952 0 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 21732 -2834 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 21732 -2834 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 19370 -1417 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 19370 -1417 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 22204 9921 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 22204 9921 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 25511 -1417 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 25511 -1417 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 21732 -9921 944 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 21732 -9921 944 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 25511 -7086 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 25511 -7086 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 26456 -4724 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 26456 -4724 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 27401 -944 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 27401 -944 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 31181 472 944 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 31181 472 944 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 34960 -4724 944 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 34960 -4724 944 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 38740 -944 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 38740 -944 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 38740 -7559 944 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 38740 -7559 944 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 42519 -3307 472 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 42519 -3307 472 472 0 0 0 0 1 1 0 3 32 32 0 0 20 31.496 1 0.0000 46299 -5669 944 472 0 0 0 0 1 1 0 3 0 -1 0 0 -1 31.496 1 0.0000 46299 -5669 944 472 0 0 0 0 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 10059 2028 10727 2696 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 10059 2696 10727 2028 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 9448 944 10393 944 10393 1889 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 9448 3779 10393 3779 10393 2834 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 11338 1417 13228 1417 13228 2362 11338 2362 11338 1417 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 11338 1417 13228 1417 13228 2362 11338 2362 11338 1417 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 13839 6752 14507 7420 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 13839 7420 14507 6752 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 13228 1889 13228 2362 14173 2362 14173 6614 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 13228 8031 14173 8031 14173 7559 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 10866 2362 11338 2362 11338 1889 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 15118 6141 17007 6141 17007 7086 15118 7086 15118 6141 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 15118 6141 17007 6141 17007 7086 15118 7086 15118 6141 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 14645 7086 15118 7086 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 17618 8169 18286 8838 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 17618 8838 18286 8169 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 17007 7086 17952 7086 17952 8031 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 17007 9921 17952 9921 17952 8976 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 19370 7559 21259 7559 21259 8503 19370 8503 19370 7559 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 19370 7559 21259 7559 21259 8503 19370 8503 19370 7559 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 13839 1083 14507 1751 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 13839 1751 14507 1083 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 14173 1889 14173 2362 13228 2362 13228 1889 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 13306 69 13306 0 14173 0 14173 944 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 15118 472 17007 472 17007 1417 15118 1417 15118 472 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 15118 472 17007 472 17007 1417 15118 1417 15118 472 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 14645 1417 15118 1417 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 13839 -6003 14507 -5335 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 13839 -5335 14507 -6003 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 13228 -7086 14173 -7086 14173 -6141 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 13228 -4251 14173 -4251 14173 -5196 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 18897 -6614 20787 -6614 20787 -5669 18897 -5669 18897 -6614 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 18897 -6614 20787 -6614 20787 -5669 18897 -5669 18897 -6614 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 14645 -5669 18897 -5669 18897 -6141 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 17007 4251 17284 4251 17284 3168 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 17007 1417 17284 1417 17284 2500 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 18897 472 20787 472 20787 1417 18897 1417 18897 472 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 18897 472 20787 472 20787 1417 18897 1417 18897 472 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 18897 3307 20787 3307 20787 4251 18897 4251 18897 3307 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 18897 3307 20787 3307 20787 4251 18897 4251 18897 3307 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 18897 1417 18620 1417 18620 2500 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 18897 4251 18620 4251 18620 3168 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 17952 -472 17952 472 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 17480 0 18425 0 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 17007 -1889 17007 -1417 17952 -1417 17952 -472 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 17007 1417 17952 1417 17952 472 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 17007 -4724 17007 -4251 19370 -4251 19370 -1889 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 18425 0 19370 0 19370 -944 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 21732 -3307 21732 -2362 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 21259 -2834 22204 -2834 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 20787 -6141 20787 -5669 21732 -5669 21732 -3307 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 19842 -1417 21732 -1417 21732 -2362 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 19036 -1751 19704 -1083 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 19036 -1083 19704 -1751 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 22677 -3779 24566 -3779 24566 -2834 22677 -2834 22677 -3779 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 22677 -3779 24566 -3779 24566 -2834 22677 -2834 22677 -3779 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 22204 -2834 22677 -2834 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 21870 9587 22538 10255 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 21870 10255 22538 9587 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 23149 8976 25039 8976 25039 9921 23149 9921 23149 8976 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 23149 8976 25039 8976 25039 9921 23149 9921 23149 8976 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 21259 8503 22204 8503 22204 9448 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 21259 11338 22204 11338 22204 10393 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 22677 9921 23149 9921 23149 9448 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 25511 -1889 25511 -944 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 25039 -1417 25984 -1417 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 24566 -2834 25511 -2834 25511 -1889 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 20787 1417 25511 1417 25511 -944 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 20787 -11338 21064 -11338 21064 -10255 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 20787 -8976 20787 -8503 21064 -8503 21064 -9587 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 22677 -12283 24566 -12283 24566 -11338 22677 -11338 22677 -12283 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 22677 -12283 24566 -12283 24566 -11338 22677 -11338 22677 -12283 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 22677 -9448 24566 -9448 24566 -8503 22677 -8503 22677 -9448 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 22677 -9448 24566 -9448 24566 -8503 22677 -8503 22677 -9448 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 22677 -11338 22400 -11338 22400 -10255 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 22677 -8976 22677 -8503 22400 -8503 22400 -9587 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 25511 -7559 25511 -6614 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 25039 -7086 25984 -7086 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 24566 -8976 24566 -8503 25511 -8503 25511 -6614 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 24566 -6141 24566 -5669 25511 -5669 25511 -7559 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 26456 -5196 26456 -4251 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 25984 -4724 26929 -4724 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 25984 -7086 26456 -7086 26456 -5196 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 26456 -4251 26456 -1417 25984 -1417 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 27401 -1417 27401 -472 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 26929 -944 27874 -944 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 25039 9921 27401 9921 27401 -472 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 26929 -4724 27401 -4724 27401 -1417 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 28346 -1889 30236 -1889 30236 -944 28346 -944 28346 -1889 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 28346 -1889 30236 -1889 30236 -944 28346 -944 28346 -1889 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 27874 -944 27874 -911 28346 -911 28346 -1417 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 30236 -1417 30236 -944 30512 -944 30512 138 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 20787 4251 30512 4251 30512 806 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 32125 -1889 34015 -1889 34015 -944 32125 -944 32125 -1889 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 32125 -1889 34015 -1889 34015 -944 32125 -944 32125 -1889 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 32125 944 34015 944 34015 1889 32125 1889 32125 944 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 32125 944 34015 944 34015 1889 32125 1889 32125 944 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 32125 -944 31849 -944 31849 138 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 32125 1417 32125 1889 31849 1889 31849 806 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 35905 -7086 37795 -7086 37795 -6141 35905 -6141 35905 -7086 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 35905 -7086 37795 -7086 37795 -6141 35905 -6141 35905 -7086 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 35905 -4251 37795 -4251 37795 -3307 35905 -3307 35905 -4251 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 35905 -4251 37795 -4251 37795 -3307 35905 -3307 35905 -4251 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 35905 -6614 35905 -6141 35628 -6141 35628 -5058 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 35905 -3307 35628 -3307 35628 -4390 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 34015 -1417 34015 -944 34292 -944 34292 -4390 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 24566 -11338 34292 -11338 34292 -5058 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 38740 -1417 38740 -472 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 38267 -944 39212 -944 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 34015 1417 34015 1889 38740 1889 38740 -472 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 37795 -3307 38740 -3307 38740 -1417 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 39685 -1889 41574 -1889 41574 -944 39685 -944 39685 -1889 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 39685 -1889 41574 -1889 41574 -944 39685 -944 39685 -1889 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 39212 -944 39685 -944 39685 -1417 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 39685 -9921 41574 -9921 41574 -8976 39685 -8976 39685 -9921 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 39685 -9921 41574 -9921 41574 -8976 39685 -8976 39685 -9921 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 39685 -7086 41574 -7086 41574 -6141 39685 -6141 39685 -7086 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 39685 -7086 41574 -7086 41574 -6141 39685 -6141 39685 -7086 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 39685 -8976 39408 -8976 39408 -7893 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 39685 -6614 39685 -6141 39408 -6141 39408 -7224 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 41574 -6614 41580 -6120 42520 -6122 42519 -3779 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 37795 -8976 38072 -8976 38072 -7893 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 37795 -6614 37795 -6141 38072 -6141 38072 -7224 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 42519 -3779 42519 -2834 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 42047 -3307 42992 -3307 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 41574 -1417 41574 -944 42519 -944 42519 -2834 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 43464 -4251 45354 -4251 45354 -3307 43464 -3307 43464 -4251 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 43464 -4251 45354 -4251 45354 -3307 43464 -3307 43464 -4251 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 42992 -3307 43464 -3307 43464 -3779 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 47244 -8031 49133 -8031 49133 -7086 47244 -7086 47244 -8031 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 47244 -8031 49133 -8031 49133 -7086 47244 -7086 47244 -8031 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 47244 -7559 47244 -7086 46967 -7086 46967 -6003 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 47244 -4251 46967 -4251 46967 -5335 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 3 41574 -8976 45631 -8976 45631 -6003 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 4 45354 -3779 45354 -3307 45631 -3307 45631 -5335 2 1 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 2 19370 8503 18425 8503 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 11340 -7110 13230 -7110 13230 -6165 11340 -6165 11340 -7110 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 47244 -5196 49133 -5196 49133 -4251 47244 -4251 47244 -5196 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 47244 -5196 49133 -5196 49133 -4251 47244 -4251 47244 -5196 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 15120 -1440 17010 -1440 17010 -495 15120 -495 15120 -1440 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 11340 -4275 13230 -4275 13230 -3330 11340 -3330 11340 -4275 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 15120 -4275 17010 -4275 17010 -3330 15120 -3330 15120 -4275 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 15120 1395 17010 1395 17010 2340 15120 2340 15120 1395 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 11340 2340 13230 2340 13230 3285 11340 3285 11340 2340 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 15120 4230 17010 4230 17010 5175 15120 5175 15120 4230 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 7560 945 9450 945 9450 1890 7560 1890 7560 945 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 7560 3780 9450 3780 9450 4725 7560 4725 7560 3780 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 11340 8010 13230 8010 13230 8955 11340 8955 11340 8010 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 15120 7065 17010 7065 17010 8010 15120 8010 15120 7065 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 15120 9900 17010 9900 17010 10845 15120 10845 15120 9900 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 19372 11340 21240 11340 21240 12262 19372 12262 19372 11340 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 19372 8505 21240 8505 21240 9429 19372 9429 19372 8505 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 23130 9900 25020 9900 25020 10845 23130 10845 23130 9900 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 18900 4230 20790 4230 20790 5175 18900 5175 18900 4230 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 18900 1395 20790 1395 20790 2340 18900 2340 18900 1395 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 18900 -5670 20790 -5670 20790 -4725 18900 -4725 18900 -5670 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 22680 -5670 24570 -5670 24570 -4725 22680 -4725 22680 -5670 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 22680 -2835 24570 -2835 24570 -1890 22680 -1890 22680 -2835 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 18900 -8505 20790 -8505 20790 -7560 18900 -7560 18900 -8505 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 22680 -8505 24570 -8505 24570 -7560 22680 -7560 22680 -8505 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 22680 -11340 24570 -11340 24570 -10395 22680 -10395 22680 -11340 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 18900 -11340 20790 -11340 20790 -10395 18900 -10395 18900 -11340 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 28350 -945 30240 -945 30240 0 28350 0 28350 -945 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 32130 -945 34020 -945 34020 0 32130 0 32130 -945 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 32130 1890 34020 1890 34020 2835 32130 2835 32130 1890 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 35910 -3330 37800 -3330 37800 -2385 35910 -2385 35910 -3330 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 39690 -945 41580 -945 41580 0 39690 0 39690 -945 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 39690 -6165 41580 -6165 41580 -5220 39690 -5220 39690 -6165 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 39690 -9000 41580 -9000 41580 -8055 39690 -8055 39690 -9000 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 35910 -6165 37800 -6165 37800 -5220 35910 -5220 35910 -6165 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 35910 -9000 37800 -9000 37800 -8055 35910 -8055 35910 -9000 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 43470 -3330 45360 -3330 45360 -2385 43470 -2385 43470 -3330 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 47250 -4275 49140 -4275 49140 -3330 47250 -3330 47250 -4275 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 47250 -7110 49140 -7110 49140 -6165 47250 -6165 47250 -7110 2 3 0 3 32 32 0 -1 20 31.496 0 0 0 0 0 5 39909 8709 41798 8709 41798 9654 39909 9654 39909 8709 2 3 0 3 0 0 0 0 -1 31.496 0 0 0 0 0 5 39909 8709 41798 8709 41798 9654 39909 9654 39909 8709 2 2 0 3 0 7 50 -1 -1 0.000 0 0 -1 0 0 5 39915 9630 41805 9630 41805 10575 39915 10575 39915 9630 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 7560 0 9450 0 9450 945 7560 945 7560 0 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 7560 2835 9450 2835 9450 3780 7560 3780 7560 2835 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 15120 -2385 17010 -2385 17010 -1440 15120 -1440 15120 -2385 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 11340 7065 13230 7065 13230 8010 11340 8010 11340 7065 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 11340 -5220 13230 -5220 13230 -4275 11340 -4275 11340 -5220 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 18900 -12285 20790 -12285 20790 -11340 18900 -11340 18900 -12285 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 18900 -9450 20790 -9450 20790 -8505 18900 -8505 18900 -9450 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 11340 -8055 13230 -8055 13230 -7110 11340 -7110 11340 -8055 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 15120 -5220 17010 -5220 17010 -4275 15120 -4275 15120 -5220 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 15120 3285 17010 3285 17010 4230 15120 4230 15120 3285 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 15120 8955 17010 8955 17010 9900 15120 9900 15120 8955 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 19350 10395 21240 10395 21240 11340 19350 11340 19350 10395 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 35910 -9945 37800 -9945 37800 -9000 35910 -9000 35910 -9945 2 2 0 3 0 3 50 -1 20 0.000 0 0 -1 0 0 5 22680 -6615 24570 -6615 24570 -5670 22680 -5670 22680 -6615 4 1 0 0 0 12 23 0.0000 4 270 630 12558 173 1/2\001 4 1 0 0 0 2 28 0.0000 4 375 990 8503 3307 rp_hi\001 4 1 0 0 0 2 28 0.0000 4 375 990 8503 472 rp_hi\001 4 1 0 0 0 2 28 0.0000 4 285 510 12283 1889 R1\001 4 1 0 0 0 2 28 0.0000 4 375 990 12283 7559 rp_hi\001 4 1 0 0 0 2 28 0.0000 4 375 1170 16062 6614 crp_hi\001 4 1 0 0 0 2 28 0.0000 4 330 645 16062 9448 P_r\001 4 1 0 0 0 2 28 0.0000 4 285 510 20314 8031 R2\001 4 1 0 0 0 2 28 0.0000 4 285 510 16062 944 R1\001 4 1 0 0 0 2 28 0.0000 4 330 960 12283 -7559 ex_hi\001 4 1 0 0 0 2 28 0.0000 4 375 960 12283 -4724 rp_lo\001 4 1 0 0 0 2 28 0.0000 4 285 510 19842 -6141 R4\001 4 1 0 0 0 2 28 0.0000 4 330 960 16062 3779 ex_hi\001 4 1 0 0 0 12 20 0.0000 4 180 990 17952 2834 Dekker\001 4 1 0 0 0 2 28 0.0000 4 330 1050 19842 944 R5_lo\001 4 1 0 0 0 2 28 0.0000 4 330 1080 19842 3779 R5_hi\001 4 1 0 0 0 2 28 0.0000 4 375 990 16062 -1889 rp_hi\001 4 1 0 0 0 2 28 0.0000 4 330 930 16062 -4724 ex_lo\001 4 1 0 0 0 2 28 0.0000 4 285 510 23622 -3307 R6\001 4 1 0 0 0 2 28 0.0000 4 330 960 20314 10866 ex_hi\001 4 1 0 0 0 2 28 0.0000 4 285 510 24094 9448 R7\001 4 1 0 0 0 2 28 0.0000 4 375 990 19842 -11811 rp_hi\001 4 1 0 0 0 2 28 0.0000 4 330 960 19842 -8976 ex_hi\001 4 1 0 0 0 12 20 0.0000 4 180 990 21732 -9921 Dekker\001 4 1 0 0 0 2 28 0.0000 4 330 1050 23622 -11811 R3_lo\001 4 1 0 0 0 2 28 0.0000 4 330 1050 23622 -8976 R3_lo\001 4 1 0 0 0 2 28 0.0000 4 330 930 23622 -6141 ex_lo\001 4 1 0 0 0 2 28 0.0000 4 285 510 29291 -1417 R7\001 4 1 0 0 0 12 20 0.0000 4 180 1320 31181 472 Fast2Sum\001 4 1 0 0 0 2 28 0.0000 4 285 510 33070 -1417 R9\001 4 1 0 0 0 2 28 0.0000 4 285 510 33070 1417 R8\001 4 1 0 0 0 12 20 0.0000 4 180 1320 34960 -4724 Fast2Sum\001 4 1 0 0 0 2 28 0.0000 4 285 720 36850 -6614 R10\001 4 1 0 0 0 2 28 0.0000 4 360 720 36850 -3779 tmp\001 4 1 0 0 0 2 28 0.0000 4 285 510 40629 -1417 R8\001 4 1 0 0 0 2 28 0.0000 4 330 960 36850 -9448 ex_hi\001 4 1 0 0 0 12 20 0.0000 4 180 1320 38740 -7559 Fast2Sum\001 4 1 0 0 0 2 28 0.0000 4 285 720 40629 -9448 R11\001 4 1 0 0 0 2 28 0.0000 4 360 720 40629 -6614 tmp\001 4 1 0 0 0 2 28 0.0000 4 285 510 44409 -3779 R8\001 4 1 0 0 0 12 20 0.0000 4 180 1320 46299 -5669 Fast2Sum\001 4 1 0 0 0 2 28 0.0000 4 285 720 48188 -7559 R11\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 23490 10305 $2^{-30}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 11745 -6570 $2^{-1}$\001 4 1 0 0 0 2 28 0.0000 4 285 510 48188 -4724 R8\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 11655 -3690 $2^{-63}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 15480 -3690 $2^{-55}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 15570 -900 $2^{-9}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 11790 2925 $2^{-9}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 15525 1935 $2^{-19}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 15570 4815 $2^{-1}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 7965 1440 $2^{-9}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 7965 4320 $2^{-9}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 11745 8595 $2^{-9}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 15525 10440 $2^{-2}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 15525 7560 $2^{-27}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 19755 11880 $2^{-1}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 19710 9045 $2^{-29}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 19260 1935 $2^{-20}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 19260 4815 $2^{-74}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 19215 -5130 $2^{-64}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 22995 -5130 $2^{-55}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 23040 -2295 $2^{-62}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 19260 -10800 $2^{-9}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 23085 -10800 $2^{-10}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 19305 -7965 $2^{-1}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 23040 -7965 $2^{-64}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 28665 -405 $2^{-29}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 32445 -405 $2^{-19}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 32490 2430 $2^{-73}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 40045 -5618 $2^{-53}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 36315 -8415 $2^{-1}$\001 4 0 0 0 -1 0 20 0.0000 2 270 945 40185 -8460 $2^{0}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 36360 -5580 $2^{-9}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 36270 -2790 $2^{-63}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 40050 -405 $2^{-62}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 43785 -2745 $2^{-53}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1170 47565 -3690 $2^{-53}$\001 4 0 0 0 -1 0 20 0.0000 2 270 1035 47610 -6570 $2^{-1}$\001 4 1 0 0 0 2 28 0.0000 4 285 300 40860 9315 A\001 4 1 0 0 0 2 28 0.0000 4 300 1965 43020 9315 Variable A\001 4 1 0 0 -1 0 20 0.0000 2 240 765 40860 10215 $max$\001 4 0 0 0 -1 0 20 0.0000 2 270 1620 42120 10260 $|A| \\leq max$\001 interval-2.1.0/src/crlibm/docs/latex/fig_exp/reconstruction.pstex0000644000000000000000000007071013031036767023372 0ustar 00000000000000%!PS-Adobe-2.0 EPSF-2.0 %%Title: /home/ddefour/ens/Personnel/these/fig_chap4/reconstruction.fig %%Creator: fig2dev Version 3.2 Patchlevel 4 %%CreationDate: Tue Jun 24 14:20:21 2003 %%For: ddefour@pecheresse (David Defour) %%BoundingBox: 0 0 630 373 %%Magnification: 0.2400 %%EndComments /$F2psDict 200 dict def $F2psDict begin $F2psDict /mtrx matrix put /col-1 {0 setgray} bind def /col0 {0.000 0.000 0.000 srgb} bind def /col1 {0.000 0.000 1.000 srgb} bind def /col2 {0.000 1.000 0.000 srgb} bind def /col3 {0.000 1.000 1.000 srgb} bind def /col4 {1.000 0.000 0.000 srgb} bind def /col5 {1.000 0.000 1.000 srgb} bind def /col6 {1.000 1.000 0.000 srgb} bind def /col7 {1.000 1.000 1.000 srgb} bind def /col8 {0.000 0.000 0.560 srgb} bind def /col9 {0.000 0.000 0.690 srgb} bind def /col10 {0.000 0.000 0.820 srgb} bind def /col11 {0.530 0.810 1.000 srgb} bind def /col12 {0.000 0.560 0.000 srgb} bind def /col13 {0.000 0.690 0.000 srgb} bind def /col14 {0.000 0.820 0.000 srgb} bind def /col15 {0.000 0.560 0.560 srgb} bind def /col16 {0.000 0.690 0.690 srgb} bind def /col17 {0.000 0.820 0.820 srgb} bind def /col18 {0.560 0.000 0.000 srgb} bind def /col19 {0.690 0.000 0.000 srgb} bind def /col20 {0.820 0.000 0.000 srgb} bind def /col21 {0.560 0.000 0.560 srgb} bind def /col22 {0.690 0.000 0.690 srgb} bind def /col23 {0.820 0.000 0.820 srgb} bind def /col24 {0.500 0.190 0.000 srgb} bind def /col25 {0.630 0.250 0.000 srgb} bind def /col26 {0.750 0.380 0.000 srgb} bind def /col27 {1.000 0.500 0.500 srgb} bind def /col28 {1.000 0.630 0.630 srgb} bind def /col29 {1.000 0.750 0.750 srgb} bind def /col30 {1.000 0.880 0.880 srgb} bind def /col31 {1.000 0.840 0.000 srgb} bind def /col32 {0.996 0.996 0.996 srgb} bind def end save newpath 0 373 moveto 0 0 lineto 630 0 lineto 630 373 lineto closepath clip newpath -113.8 185.9 translate 1 -1 scale /cp {closepath} bind def /ef {eofill} bind def /gr {grestore} bind def /gs {gsave} bind def /sa {save} bind def /rs {restore} bind def /l {lineto} bind def /m {moveto} bind def /rm {rmoveto} bind def /n {newpath} bind def /s {stroke} bind def /sh {show} bind def /slc {setlinecap} bind def /slj {setlinejoin} bind def /slw {setlinewidth} bind def /srgb {setrgbcolor} bind def /rot {rotate} bind def /sc {scale} bind def /sd {setdash} bind def /ff {findfont} bind def /sf {setfont} bind def /scf {scalefont} bind def /sw {stringwidth} bind def /tr {translate} bind def /tnt {dup dup currentrgbcolor 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb} bind def /shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul 4 -2 roll mul srgb} bind def /reencdict 12 dict def /ReEncode { reencdict begin /newcodesandnames exch def /newfontname exch def /basefontname exch def /basefontdict basefontname findfont def /newfont basefontdict maxlength dict def basefontdict { exch dup /FID ne { dup /Encoding eq { exch dup length array copy newfont 3 1 roll put } { exch newfont 3 1 roll put } ifelse } { pop pop } ifelse } forall newfont /FontName newfontname put newcodesandnames aload pop 128 1 255 { newfont /Encoding get exch /.notdef put } for newcodesandnames length 2 idiv { newfont /Encoding get 3 1 roll put } repeat newfontname newfont definefont pop end } def /isovec [ 8#055 /minus 8#200 /grave 8#201 /acute 8#202 /circumflex 8#203 /tilde 8#204 /macron 8#205 /breve 8#206 /dotaccent 8#207 /dieresis 8#210 /ring 8#211 /cedilla 8#212 /hungarumlaut 8#213 /ogonek 8#214 /caron 8#220 /dotlessi 8#230 /oe 8#231 /OE 8#240 /space 8#241 /exclamdown 8#242 /cent 8#243 /sterling 8#244 /currency 8#245 /yen 8#246 /brokenbar 8#247 /section 8#250 /dieresis 8#251 /copyright 8#252 /ordfeminine 8#253 /guillemotleft 8#254 /logicalnot 8#255 /hyphen 8#256 /registered 8#257 /macron 8#260 /degree 8#261 /plusminus 8#262 /twosuperior 8#263 /threesuperior 8#264 /acute 8#265 /mu 8#266 /paragraph 8#267 /periodcentered 8#270 /cedilla 8#271 /onesuperior 8#272 /ordmasculine 8#273 /guillemotright 8#274 /onequarter 8#275 /onehalf 8#276 /threequarters 8#277 /questiondown 8#300 /Agrave 8#301 /Aacute 8#302 /Acircumflex 8#303 /Atilde 8#304 /Adieresis 8#305 /Aring 8#306 /AE 8#307 /Ccedilla 8#310 /Egrave 8#311 /Eacute 8#312 /Ecircumflex 8#313 /Edieresis 8#314 /Igrave 8#315 /Iacute 8#316 /Icircumflex 8#317 /Idieresis 8#320 /Eth 8#321 /Ntilde 8#322 /Ograve 8#323 /Oacute 8#324 /Ocircumflex 8#325 /Otilde 8#326 /Odieresis 8#327 /multiply 8#330 /Oslash 8#331 /Ugrave 8#332 /Uacute 8#333 /Ucircumflex 8#334 /Udieresis 8#335 /Yacute 8#336 /Thorn 8#337 /germandbls 8#340 /agrave 8#341 /aacute 8#342 /acircumflex 8#343 /atilde 8#344 /adieresis 8#345 /aring 8#346 /ae 8#347 /ccedilla 8#350 /egrave 8#351 /eacute 8#352 /ecircumflex 8#353 /edieresis 8#354 /igrave 8#355 /iacute 8#356 /icircumflex 8#357 /idieresis 8#360 /eth 8#361 /ntilde 8#362 /ograve 8#363 /oacute 8#364 /ocircumflex 8#365 /otilde 8#366 /odieresis 8#367 /divide 8#370 /oslash 8#371 /ugrave 8#372 /uacute 8#373 /ucircumflex 8#374 /udieresis 8#375 /yacute 8#376 /thorn 8#377 /ydieresis] def /Courier /Courier-iso isovec ReEncode /Times-Bold /Times-Bold-iso isovec ReEncode /Times-Roman /Times-Roman-iso isovec ReEncode /DrawEllipse { /endangle exch def /startangle exch def /yrad exch def /xrad exch def /y exch def /x exch def /savematrix mtrx currentmatrix def x y tr xrad yrad sc 0 0 1 startangle endangle arc closepath savematrix setmatrix } def /$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def /$F2psEnd {$F2psEnteredState restore end} def $F2psBegin 10 setmiterlimit 0 slj 0 slc 0.01512 0.01512 sc % % Fig objects follow % % % here starts figure with depth 50 % Polyline 30.000 slw n 11340 -7110 m 13230 -7110 l 13230 -6165 l 11340 -6165 l cp gs col0 s gr % Polyline n 15120 -1440 m 17010 -1440 l 17010 -495 l 15120 -495 l cp gs col0 s gr % Polyline n 11340 -4275 m 13230 -4275 l 13230 -3330 l 11340 -3330 l cp gs col0 s gr % Polyline n 15120 -4275 m 17010 -4275 l 17010 -3330 l 15120 -3330 l cp gs col0 s gr % Polyline n 15120 1395 m 17010 1395 l 17010 2340 l 15120 2340 l cp gs col0 s gr % Polyline n 11340 2340 m 13230 2340 l 13230 3285 l 11340 3285 l cp gs col0 s gr % Polyline n 15120 4230 m 17010 4230 l 17010 5175 l 15120 5175 l cp gs col0 s gr % Polyline n 7560 945 m 9450 945 l 9450 1890 l 7560 1890 l cp gs col0 s gr % Polyline n 7560 3780 m 9450 3780 l 9450 4725 l 7560 4725 l cp gs col0 s gr % Polyline n 11340 8010 m 13230 8010 l 13230 8955 l 11340 8955 l cp gs col0 s gr % Polyline n 15120 7065 m 17010 7065 l 17010 8010 l 15120 8010 l cp gs col0 s gr % Polyline n 15120 9900 m 17010 9900 l 17010 10845 l 15120 10845 l cp gs col0 s gr % Polyline n 19372 11340 m 21240 11340 l 21240 12262 l 19372 12262 l cp gs col0 s gr % Polyline n 19372 8505 m 21240 8505 l 21240 9429 l 19372 9429 l cp gs col0 s gr % Polyline n 23130 9900 m 25020 9900 l 25020 10845 l 23130 10845 l cp gs col0 s gr % Polyline n 18900 4230 m 20790 4230 l 20790 5175 l 18900 5175 l cp gs col0 s gr % Polyline n 18900 1395 m 20790 1395 l 20790 2340 l 18900 2340 l cp gs col0 s gr % Polyline n 18900 -5670 m 20790 -5670 l 20790 -4725 l 18900 -4725 l cp gs col0 s gr % Polyline n 22680 -5670 m 24570 -5670 l 24570 -4725 l 22680 -4725 l cp gs col0 s gr % Polyline n 22680 -2835 m 24570 -2835 l 24570 -1890 l 22680 -1890 l cp gs col0 s gr % Polyline n 18900 -8505 m 20790 -8505 l 20790 -7560 l 18900 -7560 l cp gs col0 s gr % Polyline n 22680 -8505 m 24570 -8505 l 24570 -7560 l 22680 -7560 l cp gs col0 s gr % Polyline n 22680 -11340 m 24570 -11340 l 24570 -10395 l 22680 -10395 l cp gs col0 s gr % Polyline n 18900 -11340 m 20790 -11340 l 20790 -10395 l 18900 -10395 l cp gs col0 s gr % Polyline n 28350 -945 m 30240 -945 l 30240 0 l 28350 0 l cp gs col0 s gr % Polyline n 32130 -945 m 34020 -945 l 34020 0 l 32130 0 l cp gs col0 s gr % Polyline n 32130 1890 m 34020 1890 l 34020 2835 l 32130 2835 l cp gs col0 s gr % Polyline n 35910 -3330 m 37800 -3330 l 37800 -2385 l 35910 -2385 l cp gs col0 s gr % Polyline n 39690 -945 m 41580 -945 l 41580 0 l 39690 0 l cp gs col0 s gr % Polyline n 39690 -6165 m 41580 -6165 l 41580 -5220 l 39690 -5220 l cp gs col0 s gr % Polyline n 39690 -9000 m 41580 -9000 l 41580 -8055 l 39690 -8055 l cp gs col0 s gr % Polyline n 35910 -6165 m 37800 -6165 l 37800 -5220 l 35910 -5220 l cp gs col0 s gr % Polyline n 35910 -9000 m 37800 -9000 l 37800 -8055 l 35910 -8055 l cp gs col0 s gr % Polyline n 43470 -3330 m 45360 -3330 l 45360 -2385 l 43470 -2385 l cp gs col0 s gr % Polyline n 47250 -4275 m 49140 -4275 l 49140 -3330 l 47250 -3330 l cp gs col0 s gr % Polyline n 47250 -7110 m 49140 -7110 l 49140 -6165 l 47250 -6165 l cp gs col0 s gr % Polyline n 39915 9630 m 41805 9630 l 41805 10575 l 39915 10575 l cp gs col0 s gr % Polyline n 7560 0 m 9450 0 l 9450 945 l 7560 945 l cp gs col3 1.00 shd ef gr gs col0 s gr % Polyline n 7560 2835 m 9450 2835 l 9450 3780 l 7560 3780 l cp gs col3 1.00 shd ef gr gs col0 s gr % Polyline n 15120 -2385 m 17010 -2385 l 17010 -1440 l 15120 -1440 l cp gs col3 1.00 shd ef gr gs col0 s gr % Polyline n 11340 7065 m 13230 7065 l 13230 8010 l 11340 8010 l cp gs col3 1.00 shd ef gr gs col0 s gr % Polyline n 11340 -5220 m 13230 -5220 l 13230 -4275 l 11340 -4275 l cp gs col3 1.00 shd ef gr gs col0 s gr % Polyline n 18900 -12285 m 20790 -12285 l 20790 -11340 l 18900 -11340 l cp gs col3 1.00 shd ef gr gs col0 s gr % Polyline n 18900 -9450 m 20790 -9450 l 20790 -8505 l 18900 -8505 l cp gs col3 1.00 shd ef gr gs col0 s gr % Polyline n 11340 -8055 m 13230 -8055 l 13230 -7110 l 11340 -7110 l cp gs col3 1.00 shd ef gr gs col0 s gr % Polyline n 15120 -5220 m 17010 -5220 l 17010 -4275 l 15120 -4275 l cp gs col3 1.00 shd ef gr gs col0 s gr % Polyline n 15120 3285 m 17010 3285 l 17010 4230 l 15120 4230 l cp gs col3 1.00 shd ef gr gs col0 s gr % Polyline n 15120 8955 m 17010 8955 l 17010 9900 l 15120 9900 l cp gs col3 1.00 shd ef gr gs col0 s gr % Polyline n 19350 10395 m 21240 10395 l 21240 11340 l 19350 11340 l cp gs col3 1.00 shd ef gr gs col0 s gr % Polyline n 35910 -9945 m 37800 -9945 l 37800 -9000 l 35910 -9000 l cp gs col3 1.00 shd ef gr gs col0 s gr % Polyline n 22680 -6615 m 24570 -6615 l 24570 -5670 l 22680 -5670 l cp gs col3 1.00 shd ef gr gs col0 s gr % here ends figure; % % here starts figure with depth 0 % Ellipse 30.000 slw n 12558 69 747 542 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 12558 69 747 542 0 360 DrawEllipse gs col0 s gr % Ellipse n 10393 2362 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 10393 2362 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 14173 7086 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 14173 7086 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 17952 8503 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 17952 8503 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 14173 1417 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 14173 1417 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 14173 -5669 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 14173 -5669 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 17952 2834 944 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 17952 2834 944 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 17952 0 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 17952 0 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 21732 -2834 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 21732 -2834 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 19370 -1417 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 19370 -1417 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 22204 9921 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 22204 9921 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 25511 -1417 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 25511 -1417 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 21732 -9921 944 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 21732 -9921 944 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 25511 -7086 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 25511 -7086 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 26456 -4724 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 26456 -4724 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 27401 -944 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 27401 -944 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 31181 472 944 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 31181 472 944 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 34960 -4724 944 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 34960 -4724 944 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 38740 -944 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 38740 -944 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 38740 -7559 944 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 38740 -7559 944 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 42519 -3307 472 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 42519 -3307 472 472 0 360 DrawEllipse gs col0 s gr % Ellipse n 46299 -5669 944 472 0 360 DrawEllipse gs col32 1.00 shd ef gr gs col32 s gr % Ellipse n 46299 -5669 944 472 0 360 DrawEllipse gs col0 s gr % Polyline n 10059 2028 m 10727 2696 l gs col0 s gr % Polyline n 10059 2696 m 10727 2028 l gs col0 s gr % Polyline n 9448 944 m 10393 944 l 10393 1889 l gs col0 s gr % Polyline n 9448 3779 m 10393 3779 l 10393 2834 l gs col0 s gr % Polyline n 11338 1417 m 13228 1417 l 13228 2362 l 11338 2362 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 11338 1417 m 13228 1417 l 13228 2362 l 11338 2362 l cp gs col0 s gr % Polyline n 13839 6752 m 14507 7420 l gs col0 s gr % Polyline n 13839 7420 m 14507 6752 l gs col0 s gr % Polyline n 13228 1889 m 13228 2362 l 14173 2362 l 14173 6614 l gs col0 s gr % Polyline n 13228 8031 m 14173 8031 l 14173 7559 l gs col0 s gr % Polyline n 10866 2362 m 11338 2362 l 11338 1889 l gs col0 s gr % Polyline n 15118 6141 m 17007 6141 l 17007 7086 l 15118 7086 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 15118 6141 m 17007 6141 l 17007 7086 l 15118 7086 l cp gs col0 s gr % Polyline n 14645 7086 m 15118 7086 l gs col0 s gr % Polyline n 17618 8169 m 18286 8838 l gs col0 s gr % Polyline n 17618 8838 m 18286 8169 l gs col0 s gr % Polyline n 17007 7086 m 17952 7086 l 17952 8031 l gs col0 s gr % Polyline n 17007 9921 m 17952 9921 l 17952 8976 l gs col0 s gr % Polyline n 19370 7559 m 21259 7559 l 21259 8503 l 19370 8503 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 19370 7559 m 21259 7559 l 21259 8503 l 19370 8503 l cp gs col0 s gr % Polyline n 13839 1083 m 14507 1751 l gs col0 s gr % Polyline n 13839 1751 m 14507 1083 l gs col0 s gr % Polyline n 14173 1889 m 14173 2362 l 13228 2362 l 13228 1889 l gs col0 s gr % Polyline n 13306 69 m 13306 0 l 14173 0 l 14173 944 l gs col0 s gr % Polyline n 15118 472 m 17007 472 l 17007 1417 l 15118 1417 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 15118 472 m 17007 472 l 17007 1417 l 15118 1417 l cp gs col0 s gr % Polyline n 14645 1417 m 15118 1417 l gs col0 s gr % Polyline n 13839 -6003 m 14507 -5335 l gs col0 s gr % Polyline n 13839 -5335 m 14507 -6003 l gs col0 s gr % Polyline n 13228 -7086 m 14173 -7086 l 14173 -6141 l gs col0 s gr % Polyline n 13228 -4251 m 14173 -4251 l 14173 -5196 l gs col0 s gr % Polyline n 18897 -6614 m 20787 -6614 l 20787 -5669 l 18897 -5669 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 18897 -6614 m 20787 -6614 l 20787 -5669 l 18897 -5669 l cp gs col0 s gr % Polyline n 14645 -5669 m 18897 -5669 l 18897 -6141 l gs col0 s gr % Polyline n 17007 4251 m 17284 4251 l 17284 3168 l gs col0 s gr % Polyline n 17007 1417 m 17284 1417 l 17284 2500 l gs col0 s gr % Polyline n 18897 472 m 20787 472 l 20787 1417 l 18897 1417 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 18897 472 m 20787 472 l 20787 1417 l 18897 1417 l cp gs col0 s gr % Polyline n 18897 3307 m 20787 3307 l 20787 4251 l 18897 4251 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 18897 3307 m 20787 3307 l 20787 4251 l 18897 4251 l cp gs col0 s gr % Polyline n 18897 1417 m 18620 1417 l 18620 2500 l gs col0 s gr % Polyline n 18897 4251 m 18620 4251 l 18620 3168 l gs col0 s gr % Polyline n 17952 -472 m 17952 472 l gs col0 s gr % Polyline n 17480 0 m 18425 0 l gs col0 s gr % Polyline n 17007 -1889 m 17007 -1417 l 17952 -1417 l 17952 -472 l gs col0 s gr % Polyline n 17007 1417 m 17952 1417 l 17952 472 l gs col0 s gr % Polyline n 17007 -4724 m 17007 -4251 l 19370 -4251 l 19370 -1889 l gs col0 s gr % Polyline n 18425 0 m 19370 0 l 19370 -944 l gs col0 s gr % Polyline n 21732 -3307 m 21732 -2362 l gs col0 s gr % Polyline n 21259 -2834 m 22204 -2834 l gs col0 s gr % Polyline n 20787 -6141 m 20787 -5669 l 21732 -5669 l 21732 -3307 l gs col0 s gr % Polyline n 19842 -1417 m 21732 -1417 l 21732 -2362 l gs col0 s gr % Polyline n 19036 -1751 m 19704 -1083 l gs col0 s gr % Polyline n 19036 -1083 m 19704 -1751 l gs col0 s gr % Polyline n 22677 -3779 m 24566 -3779 l 24566 -2834 l 22677 -2834 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 22677 -3779 m 24566 -3779 l 24566 -2834 l 22677 -2834 l cp gs col0 s gr % Polyline n 22204 -2834 m 22677 -2834 l gs col0 s gr % Polyline n 21870 9587 m 22538 10255 l gs col0 s gr % Polyline n 21870 10255 m 22538 9587 l gs col0 s gr % Polyline n 23149 8976 m 25039 8976 l 25039 9921 l 23149 9921 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 23149 8976 m 25039 8976 l 25039 9921 l 23149 9921 l cp gs col0 s gr % Polyline n 21259 8503 m 22204 8503 l 22204 9448 l gs col0 s gr % Polyline n 21259 11338 m 22204 11338 l 22204 10393 l gs col0 s gr % Polyline n 22677 9921 m 23149 9921 l 23149 9448 l gs col0 s gr % Polyline n 25511 -1889 m 25511 -944 l gs col0 s gr % Polyline n 25039 -1417 m 25984 -1417 l gs col0 s gr % Polyline n 24566 -2834 m 25511 -2834 l 25511 -1889 l gs col0 s gr % Polyline n 20787 1417 m 25511 1417 l 25511 -944 l gs col0 s gr % Polyline n 20787 -11338 m 21064 -11338 l 21064 -10255 l gs col0 s gr % Polyline n 20787 -8976 m 20787 -8503 l 21064 -8503 l 21064 -9587 l gs col0 s gr % Polyline n 22677 -12283 m 24566 -12283 l 24566 -11338 l 22677 -11338 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 22677 -12283 m 24566 -12283 l 24566 -11338 l 22677 -11338 l cp gs col0 s gr % Polyline n 22677 -9448 m 24566 -9448 l 24566 -8503 l 22677 -8503 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 22677 -9448 m 24566 -9448 l 24566 -8503 l 22677 -8503 l cp gs col0 s gr % Polyline n 22677 -11338 m 22400 -11338 l 22400 -10255 l gs col0 s gr % Polyline n 22677 -8976 m 22677 -8503 l 22400 -8503 l 22400 -9587 l gs col0 s gr % Polyline n 25511 -7559 m 25511 -6614 l gs col0 s gr % Polyline n 25039 -7086 m 25984 -7086 l gs col0 s gr % Polyline n 24566 -8976 m 24566 -8503 l 25511 -8503 l 25511 -6614 l gs col0 s gr % Polyline n 24566 -6141 m 24566 -5669 l 25511 -5669 l 25511 -7559 l gs col0 s gr % Polyline n 26456 -5196 m 26456 -4251 l gs col0 s gr % Polyline n 25984 -4724 m 26929 -4724 l gs col0 s gr % Polyline n 25984 -7086 m 26456 -7086 l 26456 -5196 l gs col0 s gr % Polyline n 26456 -4251 m 26456 -1417 l 25984 -1417 l gs col0 s gr % Polyline n 27401 -1417 m 27401 -472 l gs col0 s gr % Polyline n 26929 -944 m 27874 -944 l gs col0 s gr % Polyline n 25039 9921 m 27401 9921 l 27401 -472 l gs col0 s gr % Polyline n 26929 -4724 m 27401 -4724 l 27401 -1417 l gs col0 s gr % Polyline n 28346 -1889 m 30236 -1889 l 30236 -944 l 28346 -944 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 28346 -1889 m 30236 -1889 l 30236 -944 l 28346 -944 l cp gs col0 s gr % Polyline n 27874 -944 m 27874 -911 l 28346 -911 l 28346 -1417 l gs col0 s gr % Polyline n 30236 -1417 m 30236 -944 l 30512 -944 l 30512 138 l gs col0 s gr % Polyline n 20787 4251 m 30512 4251 l 30512 806 l gs col0 s gr % Polyline n 32125 -1889 m 34015 -1889 l 34015 -944 l 32125 -944 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 32125 -1889 m 34015 -1889 l 34015 -944 l 32125 -944 l cp gs col0 s gr % Polyline n 32125 944 m 34015 944 l 34015 1889 l 32125 1889 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 32125 944 m 34015 944 l 34015 1889 l 32125 1889 l cp gs col0 s gr % Polyline n 32125 -944 m 31849 -944 l 31849 138 l gs col0 s gr % Polyline n 32125 1417 m 32125 1889 l 31849 1889 l 31849 806 l gs col0 s gr % Polyline n 35905 -7086 m 37795 -7086 l 37795 -6141 l 35905 -6141 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 35905 -7086 m 37795 -7086 l 37795 -6141 l 35905 -6141 l cp gs col0 s gr % Polyline n 35905 -4251 m 37795 -4251 l 37795 -3307 l 35905 -3307 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 35905 -4251 m 37795 -4251 l 37795 -3307 l 35905 -3307 l cp gs col0 s gr % Polyline n 35905 -6614 m 35905 -6141 l 35628 -6141 l 35628 -5058 l gs col0 s gr % Polyline n 35905 -3307 m 35628 -3307 l 35628 -4390 l gs col0 s gr % Polyline n 34015 -1417 m 34015 -944 l 34292 -944 l 34292 -4390 l gs col0 s gr % Polyline n 24566 -11338 m 34292 -11338 l 34292 -5058 l gs col0 s gr % Polyline n 38740 -1417 m 38740 -472 l gs col0 s gr % Polyline n 38267 -944 m 39212 -944 l gs col0 s gr % Polyline n 34015 1417 m 34015 1889 l 38740 1889 l 38740 -472 l gs col0 s gr % Polyline n 37795 -3307 m 38740 -3307 l 38740 -1417 l gs col0 s gr % Polyline n 39685 -1889 m 41574 -1889 l 41574 -944 l 39685 -944 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 39685 -1889 m 41574 -1889 l 41574 -944 l 39685 -944 l cp gs col0 s gr % Polyline n 39212 -944 m 39685 -944 l 39685 -1417 l gs col0 s gr % Polyline n 39685 -9921 m 41574 -9921 l 41574 -8976 l 39685 -8976 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 39685 -9921 m 41574 -9921 l 41574 -8976 l 39685 -8976 l cp gs col0 s gr % Polyline n 39685 -7086 m 41574 -7086 l 41574 -6141 l 39685 -6141 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 39685 -7086 m 41574 -7086 l 41574 -6141 l 39685 -6141 l cp gs col0 s gr % Polyline n 39685 -8976 m 39408 -8976 l 39408 -7893 l gs col0 s gr % Polyline n 39685 -6614 m 39685 -6141 l 39408 -6141 l 39408 -7224 l gs col0 s gr % Polyline n 41574 -6614 m 41580 -6120 l 42520 -6122 l 42519 -3779 l gs col0 s gr % Polyline n 37795 -8976 m 38072 -8976 l 38072 -7893 l gs col0 s gr % Polyline n 37795 -6614 m 37795 -6141 l 38072 -6141 l 38072 -7224 l gs col0 s gr % Polyline n 42519 -3779 m 42519 -2834 l gs col0 s gr % Polyline n 42047 -3307 m 42992 -3307 l gs col0 s gr % Polyline n 41574 -1417 m 41574 -944 l 42519 -944 l 42519 -2834 l gs col0 s gr % Polyline n 43464 -4251 m 45354 -4251 l 45354 -3307 l 43464 -3307 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 43464 -4251 m 45354 -4251 l 45354 -3307 l 43464 -3307 l cp gs col0 s gr % Polyline n 42992 -3307 m 43464 -3307 l 43464 -3779 l gs col0 s gr % Polyline n 47244 -8031 m 49133 -8031 l 49133 -7086 l 47244 -7086 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 47244 -8031 m 49133 -8031 l 49133 -7086 l 47244 -7086 l cp gs col0 s gr % Polyline n 47244 -7559 m 47244 -7086 l 46967 -7086 l 46967 -6003 l gs col0 s gr % Polyline n 47244 -4251 m 46967 -4251 l 46967 -5335 l gs col0 s gr % Polyline n 41574 -8976 m 45631 -8976 l 45631 -6003 l gs col0 s gr % Polyline n 45354 -3779 m 45354 -3307 l 45631 -3307 l 45631 -5335 l gs col0 s gr % Polyline n 19370 8503 m 18425 8503 l gs col0 s gr % Polyline n 47244 -5196 m 49133 -5196 l 49133 -4251 l 47244 -4251 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 47244 -5196 m 49133 -5196 l 49133 -4251 l 47244 -4251 l cp gs col0 s gr % Polyline n 39909 8709 m 41798 8709 l 41798 9654 l 39909 9654 l cp gs col32 1.00 shd ef gr gs col32 s gr % Polyline n 39909 8709 m 41798 8709 l 41798 9654 l 39909 9654 l cp gs col0 s gr /Courier-iso ff 345.00 scf sf 12558 173 m gs 1 -1 sc (1/2) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 8503 3307 m gs 1 -1 sc (rp_hi) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 8503 472 m gs 1 -1 sc (rp_hi) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 12283 1889 m gs 1 -1 sc (R1) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 12283 7559 m gs 1 -1 sc (rp_hi) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 16062 6614 m gs 1 -1 sc (crp_hi) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 16062 9448 m gs 1 -1 sc (P_r) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 20314 8031 m gs 1 -1 sc (R2) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 16062 944 m gs 1 -1 sc (R1) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 12283 -7559 m gs 1 -1 sc (ex_hi) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 12283 -4724 m gs 1 -1 sc (rp_lo) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 19842 -6141 m gs 1 -1 sc (R4) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 16062 3779 m gs 1 -1 sc (ex_hi) dup sw pop 2 div neg 0 rm col0 sh gr /Courier-iso ff 300.00 scf sf 17952 2834 m gs 1 -1 sc (Dekker) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 19842 944 m gs 1 -1 sc (R5_lo) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 19842 3779 m gs 1 -1 sc (R5_hi) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 16062 -1889 m gs 1 -1 sc (rp_hi) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 16062 -4724 m gs 1 -1 sc (ex_lo) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 23622 -3307 m gs 1 -1 sc (R6) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 20314 10866 m gs 1 -1 sc (ex_hi) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 24094 9448 m gs 1 -1 sc (R7) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 19842 -11811 m gs 1 -1 sc (rp_hi) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 19842 -8976 m gs 1 -1 sc (ex_hi) dup sw pop 2 div neg 0 rm col0 sh gr /Courier-iso ff 300.00 scf sf 21732 -9921 m gs 1 -1 sc (Dekker) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 23622 -11811 m gs 1 -1 sc (R3_lo) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 23622 -8976 m gs 1 -1 sc (R3_lo) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 23622 -6141 m gs 1 -1 sc (ex_lo) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 29291 -1417 m gs 1 -1 sc (R7) dup sw pop 2 div neg 0 rm col0 sh gr /Courier-iso ff 300.00 scf sf 31181 472 m gs 1 -1 sc (Fast2Sum) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 33070 -1417 m gs 1 -1 sc (R9) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 33070 1417 m gs 1 -1 sc (R8) dup sw pop 2 div neg 0 rm col0 sh gr /Courier-iso ff 300.00 scf sf 34960 -4724 m gs 1 -1 sc (Fast2Sum) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 36850 -6614 m gs 1 -1 sc (R10) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 36850 -3779 m gs 1 -1 sc (tmp) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 40629 -1417 m gs 1 -1 sc (R8) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 36850 -9448 m gs 1 -1 sc (ex_hi) dup sw pop 2 div neg 0 rm col0 sh gr /Courier-iso ff 300.00 scf sf 38740 -7559 m gs 1 -1 sc (Fast2Sum) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 40629 -9448 m gs 1 -1 sc (R11) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 40629 -6614 m gs 1 -1 sc (tmp) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 44409 -3779 m gs 1 -1 sc (R8) dup sw pop 2 div neg 0 rm col0 sh gr /Courier-iso ff 300.00 scf sf 46299 -5669 m gs 1 -1 sc (Fast2Sum) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 48188 -7559 m gs 1 -1 sc (R11) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 48188 -4724 m gs 1 -1 sc (R8) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 40860 9315 m gs 1 -1 sc (A) dup sw pop 2 div neg 0 rm col0 sh gr /Times-Bold-iso ff 420.00 scf sf 43020 9315 m gs 1 -1 sc (Variable A) dup sw pop 2 div neg 0 rm col0 sh gr % here ends figure; $F2psEnd rs showpage interval-2.1.0/src/crlibm/docs/latex/fig_exp/reconstruction.pstex_t0000644000000000000000000001275413031036767023721 0ustar 00000000000000\begin{picture}(0,0)% \includegraphics{fig_exp/reconstruction.pstex}% \end{picture}% \setlength{\unitlength}{994sp}% % \begingroup\makeatletter\ifx\SetFigFont\undefined% \gdef\SetFigFont#1#2#3#4#5{% \reset@font\fontsize{#1}{#2pt}% \fontfamily{#3}\fontseries{#4}\fontshape{#5}% \selectfont}% \fi\endgroup% \begin{picture}(41646,24613)(7528,-11456) \put(23491,-9466){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-30}$}% }}}} \put(11746,7409){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-1}$}% }}}} \put(11656,4529){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-63}$}% }}}} \put(15481,4529){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-55}$}% }}}} \put(15571,1739){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-9}$}% }}}} \put(11791,-2086){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-9}$}% }}}} \put(15526,-1096){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-19}$}% }}}} \put(15571,-3976){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-1}$}% }}}} \put(7966,-601){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-9}$}% }}}} \put(7966,-3481){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-9}$}% }}}} \put(11746,-7756){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-9}$}% }}}} \put(15526,-9601){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-2}$}% }}}} \put(15526,-6721){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-27}$}% }}}} \put(19756,-11041){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-1}$}% }}}} \put(19711,-8206){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-29}$}% }}}} \put(19261,-1096){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-20}$}% }}}} \put(19261,-3976){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-74}$}% }}}} \put(19216,5969){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-64}$}% }}}} \put(22996,5969){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-55}$}% }}}} \put(23041,3134){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-62}$}% }}}} \put(19261,11639){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-9}$}% }}}} \put(23086,11639){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-10}$}% }}}} \put(19306,8804){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-1}$}% }}}} \put(23041,8804){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-64}$}% }}}} \put(28666,1244){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-29}$}% }}}} \put(32446,1244){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-19}$}% }}}} \put(32491,-1591){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-73}$}% }}}} \put(40046,6457){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-53}$}% }}}} \put(36316,9254){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-1}$}% }}}} \put(40186,9299){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{0}$}% }}}} \put(36361,6419){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-9}$}% }}}} \put(36271,3629){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-63}$}% }}}} \put(40051,1244){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-62}$}% }}}} \put(43786,3584){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-53}$}% }}}} \put(47566,4529){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-53}$}% }}}} \put(47611,7409){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$2^{-1}$}% }}}} \put(40861,-9376){\makebox(0,0)[b]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$max$}% }}}} \put(42121,-9421){\makebox(0,0)[lb]{\smash{{\SetFigFont{5}{6.0}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$|A| \leq max$}% }}}} \end{picture}% interval-2.1.0/src/crlibm/docs/latex/fig_exp/rnd_to_nearest.fig0000644000000000000000000001136013031036767022715 0ustar 00000000000000#FIG 3.2 Landscape Center Metric A4 41.00 Single -2 1200 2 6 15975 1125 18000 1350 4 0 0 50 -1 0 20 0.0000 4 195 210 15975 1350 X\001 4 0 0 50 -1 0 20 0.0000 4 30 180 16875 1350 ...\001 4 0 0 50 -1 0 20 0.0000 4 195 210 17775 1350 X\001 4 0 0 50 -1 0 20 0.0000 4 195 210 17550 1350 X\001 -6 6 1313 2580 8228 3210 4 1 0 50 -1 0 20 0.0000 2 270 6915 4770 2790 $R8 > 0 \\mbox{~~~et~~~} R11\\_err=\\frac{1}{2}ulp(R12)$\001 4 1 0 50 -1 0 20 0.0000 0 255 675 4770 3150 cas a)\001 -6 6 9900 1350 13725 2025 2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 4 9900 1440 9900 1665 13725 1665 13725 1440 4 0 0 50 -1 0 20 0.0000 4 195 465 11475 1890 R11\001 -6 6 10538 2580 17543 3210 4 1 0 50 -1 0 20 0.0000 2 270 7005 14040 2790 $R8 < 0 \\mbox{~~~et~~~} R11\\_err=-\\frac{1}{2}ulp(R12)$\001 4 1 0 50 -1 0 20 0.0000 0 255 675 14040 3150 cas b)\001 -6 2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 4 9900 -135 9900 90 18000 90 18000 -135 2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 4 675 990 675 1215 2025 1215 2025 990 2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 4 2250 990 2250 1215 4500 1215 4500 990 2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 4 675 1440 675 1665 4500 1665 4500 1440 2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 4 4950 1215 4950 1440 8775 1440 8775 1215 2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 4 11437 982 11437 1207 13725 1215 13725 990 2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 4 9900 990 9900 1215 11340 1215 11340 990 2 1 0 1 0 7 50 -1 -1 0.000 0 0 -1 0 0 4 14175 1215 14175 1440 18000 1440 18000 1215 4 0 0 50 -1 0 20 0.0000 4 30 180 12375 1125 ...\001 4 0 0 50 -1 0 20 0.0000 4 195 135 14175 1350 0\001 4 0 0 50 -1 0 20 0.0000 4 195 135 14400 1350 0\001 4 0 0 50 -1 0 20 0.0000 4 195 135 15300 1350 0\001 4 0 0 50 -1 0 20 0.0000 4 195 210 9900 0 X\001 4 0 0 50 -1 0 20 0.0000 4 30 180 10575 0 ...\001 4 0 0 50 -1 0 20 0.0000 4 195 135 11475 0 1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 11700 0 1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 11925 0 1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 12150 0 1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 12375 0 1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 12600 0 1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 12825 0 1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 13050 0 1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 13275 0 1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 13500 0 1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 15075 0 1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 14850 0 1\001 4 0 0 50 -1 0 20 0.0000 4 30 180 14175 0 ...\001 4 0 0 50 -1 0 20 0.0000 4 195 210 15975 0 X\001 4 0 0 50 -1 0 20 0.0000 4 30 180 16875 0 ...\001 4 0 0 50 -1 0 20 0.0000 4 195 210 17775 0 X\001 4 0 0 50 -1 0 20 0.0000 4 195 210 17550 0 X\001 4 0 0 50 -1 0 20 0.0000 4 195 210 15750 0 X\001 4 0 0 50 -1 0 20 0.0000 4 30 180 12375 1125 ...\001 4 0 0 50 -1 0 20 0.0000 4 30 180 12375 1125 ...\001 4 0 0 50 -1 0 20 0.0000 4 195 225 15525 1350 -1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 15525 0 0\001 4 0 0 50 -1 0 20 0.0000 4 195 135 15300 0 1\001 4 0 0 50 -1 0 20 0.0000 4 195 210 675 1125 X\001 4 0 0 50 -1 0 20 0.0000 4 195 210 900 1125 X\001 4 0 0 50 -1 0 20 0.0000 4 195 210 1800 1125 X\001 4 0 0 50 -1 0 20 0.0000 4 195 135 2250 1125 1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 2475 1125 0\001 4 0 0 50 -1 0 20 0.0000 4 195 135 4275 1125 0\001 4 0 0 50 -1 0 20 0.0000 4 195 135 4050 1125 0\001 4 0 0 50 -1 0 20 0.0000 4 195 135 2700 1125 0\001 4 0 0 50 -1 0 20 0.0000 4 30 180 3150 1125 ...\001 4 0 0 50 -1 0 20 0.0000 4 195 135 4950 1350 0\001 4 0 0 50 -1 0 20 0.0000 4 195 135 5175 1350 0\001 4 0 0 50 -1 0 20 0.0000 4 30 180 5625 1350 ...\001 4 0 0 50 -1 0 20 0.0000 4 195 135 6075 1350 0\001 4 0 0 50 -1 0 20 0.0000 4 195 135 6300 1350 1\001 4 0 0 50 -1 0 20 0.0000 4 195 210 6525 1350 X\001 4 0 0 50 -1 0 20 0.0000 4 195 210 6750 1350 X\001 4 0 0 50 -1 0 20 0.0000 4 30 180 7650 1350 ...\001 4 0 0 50 -1 0 20 0.0000 4 195 210 8550 1350 X\001 4 0 0 50 -1 0 20 0.0000 4 195 210 8325 1350 X\001 4 0 0 50 -1 0 20 0.0000 4 195 465 1125 1440 R12\001 4 0 0 50 -1 0 20 0.0000 4 255 930 2925 1440 R11_err\001 4 0 0 50 -1 0 20 0.0000 4 195 465 2250 1890 R11\001 4 0 0 50 -1 0 20 0.0000 4 195 330 6525 1890 R8\001 4 0 0 50 -1 0 20 0.0000 4 30 180 14850 1350 ...\001 4 0 0 50 -1 0 20 0.0000 4 195 135 11925 1125 0\001 4 0 0 50 -1 0 20 0.0000 4 195 225 11475 1125 -1\001 4 0 0 50 -1 0 20 0.0000 4 195 135 13500 1125 0\001 4 0 0 50 -1 0 20 0.0000 4 195 135 13275 1125 0\001 4 0 0 50 -1 0 20 0.0000 4 255 930 12150 1440 R11_err\001 4 0 0 50 -1 0 20 0.0000 4 195 465 10350 1440 R12\001 4 0 0 50 -1 0 20 0.0000 4 195 210 10125 1125 X\001 4 0 0 50 -1 0 20 0.0000 4 195 210 9900 1125 X\001 4 0 0 50 -1 0 20 0.0000 4 30 180 10575 1132 ...\001 4 0 0 50 -1 0 20 0.0000 4 195 285 11025 1125 +1\001 4 0 0 50 -1 0 20 0.0000 4 195 210 10125 0 X\001 4 0 0 50 -1 0 20 0.0000 4 195 1095 13275 450 R11 + R8\001 4 0 0 50 -1 0 20 0.0000 4 195 210 11025 0 X\001 4 0 0 50 -1 0 20 0.0000 4 195 330 15750 1890 R8\001 interval-2.1.0/src/crlibm/docs/latex/fig_exp/rnd_to_nearest.pstex0000644000000000000000000002622713031036767023323 0ustar 00000000000000%!PS-Adobe-2.0 EPSF-2.0 %%Title: rnd_to_nearest.fig %%Creator: fig2dev Version 3.2 Patchlevel 4 %%CreationDate: Mon Jun 30 21:34:50 2003 %%For: ddefour@pecheresse (David Defour) %%BoundingBox: 0 0 449 89 %%Magnification: 0.4100 %%EndComments /$F2psDict 200 dict def $F2psDict begin $F2psDict /mtrx matrix put /col-1 {0 setgray} bind def /col0 {0.000 0.000 0.000 srgb} bind def /col1 {0.000 0.000 1.000 srgb} bind def /col2 {0.000 1.000 0.000 srgb} bind def /col3 {0.000 1.000 1.000 srgb} bind def /col4 {1.000 0.000 0.000 srgb} bind def /col5 {1.000 0.000 1.000 srgb} bind def /col6 {1.000 1.000 0.000 srgb} bind def /col7 {1.000 1.000 1.000 srgb} bind def /col8 {0.000 0.000 0.560 srgb} bind def /col9 {0.000 0.000 0.690 srgb} bind def /col10 {0.000 0.000 0.820 srgb} bind def /col11 {0.530 0.810 1.000 srgb} bind def /col12 {0.000 0.560 0.000 srgb} bind def /col13 {0.000 0.690 0.000 srgb} bind def /col14 {0.000 0.820 0.000 srgb} bind def /col15 {0.000 0.560 0.560 srgb} bind def /col16 {0.000 0.690 0.690 srgb} bind def /col17 {0.000 0.820 0.820 srgb} bind def /col18 {0.560 0.000 0.000 srgb} bind def /col19 {0.690 0.000 0.000 srgb} bind def /col20 {0.820 0.000 0.000 srgb} bind def /col21 {0.560 0.000 0.560 srgb} bind def /col22 {0.690 0.000 0.690 srgb} bind def /col23 {0.820 0.000 0.820 srgb} bind def /col24 {0.500 0.190 0.000 srgb} bind def /col25 {0.630 0.250 0.000 srgb} bind def /col26 {0.750 0.380 0.000 srgb} bind def /col27 {1.000 0.500 0.500 srgb} bind def /col28 {1.000 0.630 0.630 srgb} bind def /col29 {1.000 0.750 0.750 srgb} bind def /col30 {1.000 0.880 0.880 srgb} bind def /col31 {1.000 0.840 0.000 srgb} bind def end save newpath 0 89 moveto 0 0 lineto 449 0 lineto 449 89 lineto closepath clip newpath -17.1 83.3 translate 1 -1 scale /cp {closepath} bind def /ef {eofill} bind def /gr {grestore} bind def /gs {gsave} bind def /sa {save} bind def /rs {restore} bind def /l {lineto} bind def /m {moveto} bind def /rm {rmoveto} bind def /n {newpath} bind def /s {stroke} bind def /sh {show} bind def /slc {setlinecap} bind def /slj {setlinejoin} bind def /slw {setlinewidth} bind def /srgb {setrgbcolor} bind def /rot {rotate} bind def /sc {scale} bind def /sd {setdash} bind def /ff {findfont} bind def /sf {setfont} bind def /scf {scalefont} bind def /sw {stringwidth} bind def /tr {translate} bind def /tnt {dup dup currentrgbcolor 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb} bind def /shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul 4 -2 roll mul srgb} bind def /reencdict 12 dict def /ReEncode { reencdict begin /newcodesandnames exch def /newfontname exch def /basefontname exch def /basefontdict basefontname findfont def /newfont basefontdict maxlength dict def basefontdict { exch dup /FID ne { dup /Encoding eq { exch dup length array copy newfont 3 1 roll put } { exch newfont 3 1 roll put } ifelse } { pop pop } ifelse } forall newfont /FontName newfontname put newcodesandnames aload pop 128 1 255 { newfont /Encoding get exch /.notdef put } for newcodesandnames length 2 idiv { newfont /Encoding get 3 1 roll put } repeat newfontname newfont definefont pop end } def /isovec [ 8#055 /minus 8#200 /grave 8#201 /acute 8#202 /circumflex 8#203 /tilde 8#204 /macron 8#205 /breve 8#206 /dotaccent 8#207 /dieresis 8#210 /ring 8#211 /cedilla 8#212 /hungarumlaut 8#213 /ogonek 8#214 /caron 8#220 /dotlessi 8#230 /oe 8#231 /OE 8#240 /space 8#241 /exclamdown 8#242 /cent 8#243 /sterling 8#244 /currency 8#245 /yen 8#246 /brokenbar 8#247 /section 8#250 /dieresis 8#251 /copyright 8#252 /ordfeminine 8#253 /guillemotleft 8#254 /logicalnot 8#255 /hyphen 8#256 /registered 8#257 /macron 8#260 /degree 8#261 /plusminus 8#262 /twosuperior 8#263 /threesuperior 8#264 /acute 8#265 /mu 8#266 /paragraph 8#267 /periodcentered 8#270 /cedilla 8#271 /onesuperior 8#272 /ordmasculine 8#273 /guillemotright 8#274 /onequarter 8#275 /onehalf 8#276 /threequarters 8#277 /questiondown 8#300 /Agrave 8#301 /Aacute 8#302 /Acircumflex 8#303 /Atilde 8#304 /Adieresis 8#305 /Aring 8#306 /AE 8#307 /Ccedilla 8#310 /Egrave 8#311 /Eacute 8#312 /Ecircumflex 8#313 /Edieresis 8#314 /Igrave 8#315 /Iacute 8#316 /Icircumflex 8#317 /Idieresis 8#320 /Eth 8#321 /Ntilde 8#322 /Ograve 8#323 /Oacute 8#324 /Ocircumflex 8#325 /Otilde 8#326 /Odieresis 8#327 /multiply 8#330 /Oslash 8#331 /Ugrave 8#332 /Uacute 8#333 /Ucircumflex 8#334 /Udieresis 8#335 /Yacute 8#336 /Thorn 8#337 /germandbls 8#340 /agrave 8#341 /aacute 8#342 /acircumflex 8#343 /atilde 8#344 /adieresis 8#345 /aring 8#346 /ae 8#347 /ccedilla 8#350 /egrave 8#351 /eacute 8#352 /ecircumflex 8#353 /edieresis 8#354 /igrave 8#355 /iacute 8#356 /icircumflex 8#357 /idieresis 8#360 /eth 8#361 /ntilde 8#362 /ograve 8#363 /oacute 8#364 /ocircumflex 8#365 /otilde 8#366 /odieresis 8#367 /divide 8#370 /oslash 8#371 /ugrave 8#372 /uacute 8#373 /ucircumflex 8#374 /udieresis 8#375 /yacute 8#376 /thorn 8#377 /ydieresis] def /Times-Roman /Times-Roman-iso isovec ReEncode /$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def /$F2psEnd {$F2psEnteredState restore end} def $F2psBegin 10 setmiterlimit 0 slj 0 slc 0.02583 0.02583 sc % % Fig objects follow % % % here starts figure with depth 50 /Times-Roman-iso ff 300.00 scf sf 15975 1350 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 16875 1350 m gs 1 -1 sc (...) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 17775 1350 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 17550 1350 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 4770 3150 m gs 1 -1 sc (cas a\)) dup sw pop 2 div neg 0 rm col0 sh gr % Polyline 7.500 slw n 9900 1440 m 9900 1665 l 13725 1665 l 13725 1440 l gs col0 s gr /Times-Roman-iso ff 300.00 scf sf 11475 1890 m gs 1 -1 sc (R11) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 14040 3150 m gs 1 -1 sc (cas b\)) dup sw pop 2 div neg 0 rm col0 sh gr % Polyline n 9900 -135 m 9900 90 l 18000 90 l 18000 -135 l gs col0 s gr % Polyline n 675 990 m 675 1215 l 2025 1215 l 2025 990 l gs col0 s gr % Polyline n 2250 990 m 2250 1215 l 4500 1215 l 4500 990 l gs col0 s gr % Polyline n 675 1440 m 675 1665 l 4500 1665 l 4500 1440 l gs col0 s gr % Polyline n 4950 1215 m 4950 1440 l 8775 1440 l 8775 1215 l gs col0 s gr % Polyline n 11437 982 m 11437 1207 l 13725 1215 l 13725 990 l gs col0 s gr % Polyline n 9900 990 m 9900 1215 l 11340 1215 l 11340 990 l gs col0 s gr % Polyline n 14175 1215 m 14175 1440 l 18000 1440 l 18000 1215 l gs col0 s gr /Times-Roman-iso ff 300.00 scf sf 12375 1125 m gs 1 -1 sc (...) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 14175 1350 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 14400 1350 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 15300 1350 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 9900 0 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 10575 0 m gs 1 -1 sc (...) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 11475 0 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 11700 0 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 11925 0 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 12150 0 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 12375 0 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 12600 0 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 12825 0 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 13050 0 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 13275 0 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 13500 0 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 15075 0 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 14850 0 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 14175 0 m gs 1 -1 sc (...) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 15975 0 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 16875 0 m gs 1 -1 sc (...) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 17775 0 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 17550 0 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 15750 0 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 12375 1125 m gs 1 -1 sc (...) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 12375 1125 m gs 1 -1 sc (...) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 15525 1350 m gs 1 -1 sc (-1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 15525 0 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 15300 0 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 675 1125 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 900 1125 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 1800 1125 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 2250 1125 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 2475 1125 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 4275 1125 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 4050 1125 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 2700 1125 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 3150 1125 m gs 1 -1 sc (...) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 4950 1350 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 5175 1350 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 5625 1350 m gs 1 -1 sc (...) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 6075 1350 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 6300 1350 m gs 1 -1 sc (1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 6525 1350 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 6750 1350 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 7650 1350 m gs 1 -1 sc (...) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 8550 1350 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 8325 1350 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 1125 1440 m gs 1 -1 sc (R12) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 2925 1440 m gs 1 -1 sc (R11_err) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 2250 1890 m gs 1 -1 sc (R11) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 6525 1890 m gs 1 -1 sc (R8) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 14850 1350 m gs 1 -1 sc (...) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 11925 1125 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 11475 1125 m gs 1 -1 sc (-1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 13500 1125 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 13275 1125 m gs 1 -1 sc (0) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 12150 1440 m gs 1 -1 sc (R11_err) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 10350 1440 m gs 1 -1 sc (R12) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 10125 1125 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 9900 1125 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 10575 1132 m gs 1 -1 sc (...) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 11025 1125 m gs 1 -1 sc (+1) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 10125 0 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 13275 450 m gs 1 -1 sc (R11 + R8) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 11025 0 m gs 1 -1 sc (X) col0 sh gr /Times-Roman-iso ff 300.00 scf sf 15750 1890 m gs 1 -1 sc (R8) col0 sh gr % here ends figure; $F2psEnd rs showpage interval-2.1.0/src/crlibm/docs/latex/fig_exp/rnd_to_nearest.pstex_t0000644000000000000000000000133213031036767023634 0ustar 00000000000000\begin{picture}(0,0)% \includegraphics{fig_exp/rnd_to_nearest.pstex}% \end{picture}% \setlength{\unitlength}{1699sp}% % \begingroup\makeatletter\ifx\SetFigFont\undefined% \gdef\SetFigFont#1#2#3#4#5{% \reset@font\fontsize{#1}{#2pt}% \fontfamily{#3}\fontseries{#4}\fontshape{#5}% \selectfont}% \fi\endgroup% \begin{picture}(17349,3421)(664,-2387) \put(4771,-1951){\makebox(0,0)[b]{\smash{{\SetFigFont{8}{9.6}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$R8 > 0 \mbox{~~~et~~~} R11\_err=\frac{1}{2}ulp(R12)$}% }}}} \put(14041,-1951){\makebox(0,0)[b]{\smash{{\SetFigFont{8}{9.6}{\familydefault}{\mddefault}{\updefault}{\color[rgb]{0,0,0}$R8 < 0 \mbox{~~~et~~~} R11\_err=-\frac{1}{2}ulp(R12)$}% }}}} \end{picture}% interval-2.1.0/src/crlibm/docs/latex/fig_scs/exponent_representation.eps0000644000000000000000000003310713031036767024712 0ustar 00000000000000%!PS-Adobe-2.0 EPSF-2.0 %%Title: exponent_representation2.eps %%Creator: fig2dev Version 3.2 Patchlevel 3d %%CreationDate: Tue Apr 2 18:10:36 2002 %%For: ddefour@reena (David Defour) %%BoundingBox: 0 0 712 300 %%Magnification: 1.0000 %%EndComments /$F2psDict 200 dict def $F2psDict begin $F2psDict /mtrx matrix put /col-1 {0 setgray} bind def /col0 {0.000 0.000 0.000 srgb} bind def /col1 {0.000 0.000 1.000 srgb} bind def /col2 {0.000 1.000 0.000 srgb} bind def /col3 {0.000 1.000 1.000 srgb} bind def /col4 {1.000 0.000 0.000 srgb} bind def /col5 {1.000 0.000 1.000 srgb} bind def /col6 {1.000 1.000 0.000 srgb} bind def /col7 {1.000 1.000 1.000 srgb} bind def /col8 {0.000 0.000 0.560 srgb} bind def /col9 {0.000 0.000 0.690 srgb} bind def /col10 {0.000 0.000 0.820 srgb} bind def /col11 {0.530 0.810 1.000 srgb} bind def /col12 {0.000 0.560 0.000 srgb} bind def /col13 {0.000 0.690 0.000 srgb} bind def /col14 {0.000 0.820 0.000 srgb} bind def /col15 {0.000 0.560 0.560 srgb} bind def /col16 {0.000 0.690 0.690 srgb} bind def /col17 {0.000 0.820 0.820 srgb} bind def /col18 {0.560 0.000 0.000 srgb} bind def /col19 {0.690 0.000 0.000 srgb} bind def /col20 {0.820 0.000 0.000 srgb} bind def /col21 {0.560 0.000 0.560 srgb} bind def /col22 {0.690 0.000 0.690 srgb} bind def /col23 {0.820 0.000 0.820 srgb} bind def /col24 {0.500 0.190 0.000 srgb} bind def /col25 {0.630 0.250 0.000 srgb} bind def /col26 {0.750 0.380 0.000 srgb} bind def /col27 {1.000 0.500 0.500 srgb} bind def /col28 {1.000 0.630 0.630 srgb} bind def /col29 {1.000 0.750 0.750 srgb} bind def /col30 {1.000 0.880 0.880 srgb} bind def /col31 {1.000 0.840 0.000 srgb} bind def end save newpath 0 300 moveto 0 0 lineto 712 0 lineto 712 300 lineto closepath clip newpath 426.6 384.1 translate 1 -1 scale /cp {closepath} bind def /ef {eofill} bind def /gr {grestore} bind def /gs {gsave} bind def /sa {save} bind def /rs {restore} bind def /l {lineto} bind def /m {moveto} bind def /rm {rmoveto} bind def /n {newpath} bind def /s {stroke} bind def /sh {show} bind def /slc {setlinecap} bind def /slj {setlinejoin} bind def /slw {setlinewidth} bind def /srgb {setrgbcolor} bind def /rot {rotate} bind def /sc {scale} bind def /sd {setdash} bind def /ff {findfont} bind def /sf {setfont} bind def /scf {scalefont} bind def /sw {stringwidth} bind def /tr {translate} bind def /tnt {dup dup currentrgbcolor 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add 4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb} bind def /shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul 4 -2 roll mul srgb} bind def /reencdict 12 dict def /ReEncode { reencdict begin /newcodesandnames exch def /newfontname exch def /basefontname exch def /basefontdict basefontname findfont def /newfont basefontdict maxlength dict def basefontdict { exch dup /FID ne { dup /Encoding eq { exch dup length array copy newfont 3 1 roll put } { exch newfont 3 1 roll put } ifelse } { pop pop } ifelse } forall newfont /FontName newfontname put newcodesandnames aload pop 128 1 255 { newfont /Encoding get exch /.notdef put } for newcodesandnames length 2 idiv { newfont /Encoding get 3 1 roll put } repeat newfontname newfont definefont pop end } def /isovec [ 8#055 /minus 8#200 /grave 8#201 /acute 8#202 /circumflex 8#203 /tilde 8#204 /macron 8#205 /breve 8#206 /dotaccent 8#207 /dieresis 8#210 /ring 8#211 /cedilla 8#212 /hungarumlaut 8#213 /ogonek 8#214 /caron 8#220 /dotlessi 8#230 /oe 8#231 /OE 8#240 /space 8#241 /exclamdown 8#242 /cent 8#243 /sterling 8#244 /currency 8#245 /yen 8#246 /brokenbar 8#247 /section 8#250 /dieresis 8#251 /copyright 8#252 /ordfeminine 8#253 /guillemotleft 8#254 /logicalnot 8#255 /hyphen 8#256 /registered 8#257 /macron 8#260 /degree 8#261 /plusminus 8#262 /twosuperior 8#263 /threesuperior 8#264 /acute 8#265 /mu 8#266 /paragraph 8#267 /periodcentered 8#270 /cedilla 8#271 /onesuperior 8#272 /ordmasculine 8#273 /guillemotright 8#274 /onequarter 8#275 /onehalf 8#276 /threequarters 8#277 /questiondown 8#300 /Agrave 8#301 /Aacute 8#302 /Acircumflex 8#303 /Atilde 8#304 /Adieresis 8#305 /Aring 8#306 /AE 8#307 /Ccedilla 8#310 /Egrave 8#311 /Eacute 8#312 /Ecircumflex 8#313 /Edieresis 8#314 /Igrave 8#315 /Iacute 8#316 /Icircumflex 8#317 /Idieresis 8#320 /Eth 8#321 /Ntilde 8#322 /Ograve 8#323 /Oacute 8#324 /Ocircumflex 8#325 /Otilde 8#326 /Odieresis 8#327 /multiply 8#330 /Oslash 8#331 /Ugrave 8#332 /Uacute 8#333 /Ucircumflex 8#334 /Udieresis 8#335 /Yacute 8#336 /Thorn 8#337 /germandbls 8#340 /agrave 8#341 /aacute 8#342 /acircumflex 8#343 /atilde 8#344 /adieresis 8#345 /aring 8#346 /ae 8#347 /ccedilla 8#350 /egrave 8#351 /eacute 8#352 /ecircumflex 8#353 /edieresis 8#354 /igrave 8#355 /iacute 8#356 /icircumflex 8#357 /idieresis 8#360 /eth 8#361 /ntilde 8#362 /ograve 8#363 /oacute 8#364 /ocircumflex 8#365 /otilde 8#366 /odieresis 8#367 /divide 8#370 /oslash 8#371 /ugrave 8#372 /uacute 8#373 /ucircumflex 8#374 /udieresis 8#375 /yacute 8#376 /thorn 8#377 /ydieresis] def /Times-Roman /Times-Roman-iso isovec ReEncode /Helvetica /Helvetica-iso isovec ReEncode /$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def /$F2psEnd {$F2psEnteredState restore end} def $F2psBegin 10 setmiterlimit 0.06299 0.06299 sc % % Fig objects follow % /Times-Roman-iso ff 270.00 scf sf -2925 3825 m gs 1 -1 sc (2) col0 sh gr /Times-Roman-iso ff 210.00 scf sf -2475 3660 m gs 1 -1 sc (r) col0 sh gr /Times-Roman-iso ff 225.00 scf sf -2835 3600 m gs 1 -1 sc (2.m) col0 sh gr /Times-Roman-iso ff 270.00 scf sf -4275 3825 m gs 1 -1 sc (2) col0 sh gr /Times-Roman-iso ff 210.00 scf sf -3825 3660 m gs 1 -1 sc (r) col0 sh gr /Times-Roman-iso ff 225.00 scf sf -4185 3600 m gs 1 -1 sc (3.m) col0 sh gr /Times-Roman-iso ff 225.00 scf sf -1350 3600 m gs 1 -1 sc (m) col0 sh gr /Times-Roman-iso ff 210.00 scf sf -1125 3660 m gs 1 -1 sc (r) col0 sh gr /Times-Roman-iso ff 225.00 scf sf 1222 3592 m gs 1 -1 sc (-m) col0 sh gr /Times-Roman-iso ff 210.00 scf sf 1522 3652 m gs 1 -1 sc (r) col0 sh gr /Times-Roman-iso ff 225.00 scf sf 2572 3592 m gs 1 -1 sc (-2.m) col0 sh gr /Times-Roman-iso ff 210.00 scf sf 3037 3652 m gs 1 -1 sc (r) col0 sh gr /Helvetica-iso ff 300.00 scf sf -2925 1800 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -1575 1800 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -2025 1800 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -675 1800 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf 675 1800 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf 1800 1800 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf 225 1800 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -2475 1800 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -900 1800 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -3375 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -3150 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -2700 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -2250 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -1800 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -1350 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -450 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -1125 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -225 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 0 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 450 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 900 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 1125 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 1575 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 1350 1800 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 0 1800 m gs 1 -1 sc (,) col0 sh gr % Polyline 7.500 slw n -4620 1350 m -4725 1350 -4725 1920 105 arcto 4 {pop} repeat -4725 2025 2145 2025 105 arcto 4 {pop} repeat 2250 2025 2250 1455 105 arcto 4 {pop} repeat 2250 1350 -4620 1350 105 arcto 4 {pop} repeat cp gs col0 s gr /Helvetica-iso ff 300.00 scf sf -4500 1800 m gs 1 -1 sc (X = ) col0 sh gr % Polyline n -3945 4500 m -4050 4500 -4050 4845 105 arcto 4 {pop} repeat -4050 4950 -2805 4950 105 arcto 4 {pop} repeat -2700 4950 -2700 4605 105 arcto 4 {pop} repeat -2700 4500 -3945 4500 105 arcto 4 {pop} repeat cp gs col0 s gr % Polyline n -2550 4500 m -2655 4500 -2655 4845 105 arcto 4 {pop} repeat -2655 4950 -1455 4950 105 arcto 4 {pop} repeat -1350 4950 -1350 4605 105 arcto 4 {pop} repeat -1350 4500 -2550 4500 105 arcto 4 {pop} repeat cp gs col0 s gr % Polyline n -1200 4500 m -1305 4500 -1305 4845 105 arcto 4 {pop} repeat -1305 4950 -105 4950 105 arcto 4 {pop} repeat 0 4950 0 4605 105 arcto 4 {pop} repeat 0 4500 -1200 4500 105 arcto 4 {pop} repeat cp gs col0 s gr % Polyline n 150 4500 m 45 4500 45 4845 105 arcto 4 {pop} repeat 45 4950 1245 4950 105 arcto 4 {pop} repeat 1350 4950 1350 4605 105 arcto 4 {pop} repeat 1350 4500 150 4500 105 arcto 4 {pop} repeat cp gs col0 s gr % Polyline n 1500 4500 m 1395 4500 1395 4845 105 arcto 4 {pop} repeat 1395 4950 2595 4950 105 arcto 4 {pop} repeat 2700 4950 2700 4605 105 arcto 4 {pop} repeat 2700 4500 1500 4500 105 arcto 4 {pop} repeat cp gs col0 s gr /Helvetica-iso ff 300.00 scf sf -2895 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -1545 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -1995 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -645 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf 705 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf 1830 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf 255 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -2445 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -870 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -3345 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -3120 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -2670 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -2220 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -1770 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -1320 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -420 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -1095 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf -195 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 30 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 480 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 930 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 1155 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 1605 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 1380 4830 m gs 1 -1 sc (1) col0 sh gr /Helvetica-iso ff 300.00 scf sf 2055 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf 2280 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf 2505 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -4020 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -3795 4830 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 300.00 scf sf -3570 4830 m gs 1 -1 sc (0) col0 sh gr % Polyline 15.000 slw n -5520 4275 m -5625 4275 -5625 5970 105 arcto 4 {pop} repeat -5625 6075 3045 6075 105 arcto 4 {pop} repeat 3150 6075 3150 4380 105 arcto 4 {pop} repeat 3150 4275 -5520 4275 105 arcto 4 {pop} repeat cp gs col0 s gr /Helvetica-iso ff 300.00 scf sf -5355 4800 m gs 1 -1 sc (R.digits =) col0 sh gr /Helvetica-iso ff 240.00 scf sf -1350 5850 m gs 1 -1 sc (Software Carry Save Structure \(SCSS\)) col0 sh gr /Helvetica-iso ff 300.00 scf sf -5340 5745 m gs 1 -1 sc (R.sign = 1 ) col0 sh gr /Helvetica-iso ff 300.00 scf sf -5355 5295 m gs 1 -1 sc (R.index = 3 ) col0 sh gr % Polyline n -5175 3150 m 2925 3150 l gs col0 s gr % Polyline n 0 2925 m 0 3375 l gs col0 s gr % Polyline n 1350 2925 m 1350 3375 l gs col0 s gr % Polyline n 2700 2925 m 2700 3375 l gs col0 s gr % Polyline n -1350 2925 m -1350 3375 l gs col0 s gr % Polyline n -2700 2925 m -2700 3375 l gs col0 s gr % Polyline [90] 0 sd n 2925 3150 m 4500 3150 l gs col0 s gr [] 0 sd % Polyline [90] 0 sd n -6750 3150 m -5175 3150 l gs col0 s gr [] 0 sd % Polyline n -4050 2925 m -4050 3375 l gs col0 s gr % Polyline n -2700 2925 m -2700 3375 l gs col0 s gr % Polyline 7.500 slw [15 45] 45 sd n -2700 1350 m -2700 4950 l gs col0 s gr [] 0 sd % Polyline [15 45] 45 sd n -1350 1350 m -1350 4950 l gs col0 s gr [] 0 sd % Polyline [15 45] 45 sd n 0 1350 m 0 4950 l gs col0 s gr [] 0 sd % Polyline [15 45] 45 sd n 1350 1350 m 1350 4950 l gs col0 s gr [] 0 sd % Polyline [15 45] 45 sd n -4050 1350 m -4050 4950 l gs col0 s gr [] 0 sd /Times-Roman-iso ff 270.00 scf sf 2475 3825 m gs 1 -1 sc (2) col0 sh gr /Times-Roman-iso ff 270.00 scf sf -225 3825 m gs 1 -1 sc (2) col0 sh gr /Times-Roman-iso ff 270.00 scf sf 1125 3825 m gs 1 -1 sc (2) col0 sh gr /Times-Roman-iso ff 270.00 scf sf -1575 3825 m gs 1 -1 sc (2) col0 sh gr /Helvetica-iso ff 270.00 scf sf -3435 2925 m gs 1 -1 sc (3) col0 sh gr /Helvetica-iso ff 270.00 scf sf -2085 2925 m gs 1 -1 sc (2) col0 sh gr /Helvetica-iso ff 270.00 scf sf -765 2925 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 270.00 scf sf 570 2925 m gs 1 -1 sc (-1) col0 sh gr /Helvetica-iso ff 270.00 scf sf 1890 2925 m gs 1 -1 sc (-2) col0 sh gr /Times-Roman-iso ff 225.00 scf sf -75 3653 m gs 1 -1 sc (0) col0 sh gr /Helvetica-iso ff 270.00 scf sf -5415 2910 m gs 1 -1 sc (Index =) col0 sh gr /Helvetica-iso ff 270.00 scf sf -5430 3825 m gs 1 -1 sc (Value =) col0 sh gr $F2psEnd rs interval-2.1.0/src/crlibm/docs/latex/fig_scs/exponent_representation.pdf0000644000000000000000000001101413031036767024665 0ustar 00000000000000%PDF-1.3 %쏢 6 0 obj <> stream xXn7W(ir%F9Z#bYQ0Zdٚ)> Zb+*?0}?wn$l vns1"Nx!C)7ElNd[8IIn0m瑴,MVMEXK:+(&/ 1@31vJ.Fc1lWbY; ˲5hc €6I,5FhLrj隤g5D+"jҧ:?D}!*>ˇu\S4W!KRbJ29@$1LTv3CR)k*ro'BzS>r= rt5MNA''gd?cTGH09:M+l4"w6[n/آ&\ ?\no~1Rk . zL׮V?>Bl.}?wyټ{ue./ b\\ĘAqV2\TU/ha, B'오Q"|rkȾ Q Vˌ_ň,U^UZhZ Z4v-F_Ex԰ti~청YZIM{ ܶuiEK|uOֲ]RsZǮŠE)@> ZT䱩G9>Th"m-hRU-$РYH1 (@[Uh8TSm>(irpU5-v ;endstream endobj 7 0 obj 1385 endobj 12 0 obj <> endobj 13 0 obj <> endobj 5 0 obj <> /Contents 6 0 R >> endobj 3 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 1 0 obj <> endobj 4 0 obj <> endobj 8 0 obj <> endobj 9 0 obj <> endobj 14 0 obj <> endobj 10 0 obj <> endobj 11 0 obj <> endobj 15 0 obj <> endobj 2 0 obj <>endobj xref 0 16 0000000000 65535 f 0000001771 00000 n 0000004170 00000 n 0000001712 00000 n 0000001819 00000 n 0000001561 00000 n 0000000015 00000 n 0000001470 00000 n 0000001888 00000 n 0000001949 00000 n 0000003028 00000 n 0000003088 00000 n 0000001490 00000 n 0000001520 00000 n 0000002970 00000 n 0000004112 00000 n trailer << /Size 16 /Root 1 0 R /Info 2 0 R >> startxref 4222 %%EOF interval-2.1.0/src/crlibm/docs/latex/fig_scs/multiplication.eps0000644000000000000000000006363313031036767022774 0ustar 00000000000000%!PS-Adobe-3.0 %%Pages: (atend) %%BoundingBox: 0 0 373 234 %%HiResBoundingBox: 0.000000 0.000000 372.082007 233.460010 %......................................... %%Creator: GNU Ghostscript 707 (pswrite) %%CreationDate: 2004/04/07 15:40:39 %%DocumentData: Clean7Bit %%LanguageLevel: 2 %%EndComments %%BeginProlog % This copyright applies to everything between here and the %%EndProlog: % Copyright (C) 2003 artofcode LLC, Benicia, CA. All rights reserved. %%BeginResource: procset GS_pswrite_2_0_1001 /GS_pswrite_2_0_1001 80 dict dup begin /PageSize 2 array def/setpagesize{ PageSize aload pop 3 index eq exch 4 index eq and{ pop pop pop}{ PageSize dup 1 5 -1 roll put 0 4 -1 roll put dup null eq {false} {dup where} ifelse{ exch get exec} { pop/setpagedevice where { pop 1 dict dup /PageSize PageSize put setpagedevice} { /setpage where{ pop PageSize aload pop pageparams 3 {exch pop} repeat setpage}if}ifelse}ifelse}ifelse} bind def /!{bind def}bind def/#{load def}!/N/counttomark # /rG{3{3 -1 roll 255 div}repeat setrgbcolor}!/G{255 div setgray}!/K{0 G}! /r6{dup 3 -1 roll rG}!/r5{dup 3 1 roll rG}!/r3{dup rG}! /w/setlinewidth #/J/setlinecap # /j/setlinejoin #/M/setmiterlimit #/d/setdash #/i/setflat # /m/moveto #/l/lineto #/c/rcurveto # /p{N 2 idiv{N -2 roll rlineto}repeat}! /P{N 0 gt{N -2 roll moveto p}if}! /h{p closepath}!/H{P closepath}! /lx{0 rlineto}!/ly{0 exch rlineto}!/v{0 0 6 2 roll c}!/y{2 copy c}! /re{4 -2 roll m exch dup lx exch ly neg lx h}! /^{3 index neg 3 index neg}! /f{P fill}!/f*{P eofill}!/s{H stroke}!/S{P stroke}! /q/gsave #/Q/grestore #/rf{re fill}! /Y{P clip newpath}!/Y*{P eoclip newpath}!/rY{re Y}! /|={pop exch 4 1 roll 3 array astore cvx exch 1 index def exec}! /|{exch string readstring |=}! /+{dup type/nametype eq{2 index 7 add -3 bitshift 2 index mul}if}! /@/currentfile #/${+ @ |}! /B{{2 copy string{readstring pop}aload pop 4 array astore cvx 3 1 roll}repeat pop pop true}! /Ix{[1 0 0 1 11 -2 roll exch neg exch neg]exch}! /,{true exch Ix imagemask}!/If{false exch Ix imagemask}!/I{exch Ix image}! /Ic{exch Ix false 3 colorimage}! /F{/Columns counttomark 3 add -2 roll/Rows exch/K -1/BlackIs1 true>> /CCITTFaxDecode filter}!/FX{<LV-6=/W1KIbcNP~> , 3238 1822 50 67 /2A $C ,@^]Qs8W,uC_a_a7U1gtpYWIK\)6(]^Mi"Yhf%D$hnK''hnK'(IJ\GRhZ!8a^$kE7~> , 3323 1850 62 69 /6T $C 0GKEKD(GKUh-Flo]"1qoF`aaglKMMYe^Cn7l_SGKInJEqrfsjlHF80)^:.9mVd7[UmZ[ODh'_qg \kcPZFIot=kr2sDd^m/^V0.2F>GV+5[f~> , 3380 1822 2A , 2784 1794 6P , 2841 1765 2A , 2388 1737 6P , 2444 1709 2A , 2047 1652 2A , 2501 1737 6T , 1991 1680 6P , 2104 1680 6T , 2169 1652 26 67 /2E $C .E2>es8W-!s8W-!s89Y\s3/915WE`O^AI[~> , 2062.92 1651.96 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c f* 2062.92 1651.96 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c h S 2898 1794 6T , 3182.25 2162.18 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.46 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S 2785.42 2162.18 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.45 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S 2954 1763 49 69 /6X $C ,6?_R_@@-!*BJ:.%e,&5-L!IemF(mtmB?Ols/fANX , 1254.76 1765.34 0 -113.38 S 1198.07 1708.65 113.38 0 S 2558 1709 50 67 /2I $C 2@A?VnfY,aqgRDhgV^L/fPoZ%@D`SmL>dmsfPoV)%GQZIDqi%[iEuWRs)kp=^=ldqBl#)(KWJ1S , 2841 1537 6X , 2388 1510 6P , 2444 1480 6X , 1991.74 2162.18 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.46 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S 2047 1423 6X , 1594 1397 6P , 1651 1367 6X , 2898 1567 6T , 2954 1539 2A , 2501 1510 6T , 2558 1480 6X , 2784 1567 6P , 2161 1425 2I , 1707 1397 6T , 1772 1369 2E , 2062.92 1538.58 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c f* 2062.92 1538.58 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c h S 2062.92 1425.2 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.48 14.48 14.48 c 8 0 14.49 -6.48 14.49 -14.48 c f* 2062.92 1425.2 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.48 14.48 14.48 c 8 0 14.49 -6.48 14.49 -14.48 c h S 2388.58 2162.18 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.45 0 p 31.31 0 56.7 25.38 56.7 56.69 c 0 0 p 0 31.31 -25.39 56.69 -56.7 56.69 c h S 3323 2049 2A , 3266 2077 6P , 2926 2047 6X , 2869 2077 6P , 1991 1454 6P , 461.08 1198.43 0 -113.38 S 404.39 1141.74 113.38 0 S 2388 1283 6P , 2444 1255 2I , 1991 1227 6P , 2047 1198 2I , 1594 1170 6P , 1651 1142 2I , 2104 1454 6T , 1254 1085 2I , 2501 1283 6T , 2558 1255 2A , 2104 1227 6T , 2161 1196 6X , 1707 1170 6T , 1764 1142 2I , 1310 1113 6T , 1375 1085 2E , 2062.92 1311.81 m 0 -8 -6.49 -14.48 -14.49 -14.48 c -8 0 -14.48 6.48 -14.48 14.48 c 0 8.01 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.48 14.49 -14.49 c f* 2062.92 1311.81 m 0 -8 -6.49 -14.48 -14.49 -14.48 c -8 0 -14.48 6.48 -14.48 14.48 c 0 8.01 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.48 14.49 -14.49 c h S 2062.92 1198.43 m 0 -8 -6.49 -14.48 -14.49 -14.48 c -8 0 -14.48 6.48 -14.48 14.48 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c f* 2062.92 1198.43 m 0 -8 -6.49 -14.48 -14.49 -14.48 c -8 0 -14.48 6.48 -14.48 14.48 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c h S 2529 2049 2I , 2473 2077 6P , 2140 2049 2E , 801.23 1425.2 113.38 0 S 2076 2077 6P , 2055 972 2E , 1594 943 6P , 1659 915 2E , 1197 887 6P , 1262 858 2E , 800 830 6P , 865 802 2E , 914 830 6T , 978 802 2E , 1310 887 6T , 1367 858 2I , 1707 943 6T , 1764 913 6X , 2104 1000 6T , 2161 972 2A , 2062.92 971.67 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c f* 2062.92 971.67 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c h S 1666.08 914.98 m 0 -8 -6.48 -14.49 -14.48 -14.49 c -8.01 0 -14.49 6.49 -14.49 14.49 c 0 8 6.48 14.49 14.49 14.49 c 8 0 14.48 -6.49 14.48 -14.49 c f* 1666.08 914.98 m 0 -8 -6.48 -14.49 -14.48 -14.49 c -8.01 0 -14.49 6.49 -14.49 14.49 c 0 8 6.48 14.49 14.49 14.49 c 8 0 14.48 -6.49 14.48 -14.49 c h S 1269.25 858.29 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.49 6.49 -14.49 14.49 c 0 8 6.49 14.49 14.49 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c f* 1269.25 858.29 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.49 6.49 -14.49 14.49 c 0 8 6.49 14.49 14.49 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c h S 28.3455 w 1594.91 2218.87 -141.73 -141.73 S 1453.18 2218.87 141.73 -141.73 S 3323 2219 2A , 1197 1113 6P , 255 G 404.39 404.76 m -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 -31.31 25.38 -56.69 56.69 -56.69 c 680.3 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 31.31 -25.38 56.69 -56.69 56.69 c f* 4.72425 w K 404.39 404.76 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 680.3 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S 3266 2247 6T , 2926 2217 6X , 2869 2247 6T , 255 G 404.39 404.76 m -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 -31.31 25.38 -56.69 56.69 -56.69 c 680.3 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 31.31 -25.38 56.69 -56.69 56.69 c f* K 404.39 404.76 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 680.3 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S 2529 2219 2I , 2473 2247 6T , 2140 2219 2E , 885 318 65 72 /7B $C +@1f-%I4-:+Qtd[SN7n)*^l_NG&5J;2fJ$%3!<5X0Os8W-!hgbOlgEOLapAU>l CMpShd^HS$9+3D)"KYV(:t.1mKa]C4#Cl~> , 950 291 2E , 1282 374 7B , 1339 348 2I , 1679 431 7B , 1736 403 6X , 2076 488 7B , 2132 461 2A , 857.92 1481.89 0 -113.38 S 2076 2247 6T , 1991 1000 6P , 885 36 56 69 /2M $C 2?]ZPaASo&hfeDAp?gVKmG#,;gUDUc[r:$1DYpn\hm[LZpMSg%DV_qmh7I , 942 8 2I , 1282 36 2M , 1339 6 6X , 1679 36 2M , 1736 8 2A , 488 36 2M , 553 8 2E , 801.23 121.3 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.46 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S 1198.07 121.3 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.45 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S 1594.91 121.3 -0.01 0 P -31.3 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.39 -56.69 56.7 -56.69 c 283.45 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S [ 37.794 ] 0 d 1991.74 121.3 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.46 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S 2388.58 121.3 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.45 0 p 31.31 0 56.7 25.38 56.7 56.69 c 0 0 p 0 31.31 -25.39 56.69 -56.7 56.69 c h S 2785.42 121.3 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.45 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S 3182.25 121.3 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.46 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S [ ] 0 d 404.39 121.3 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.46 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S 64.25 914.98 0 -113.38 S 7.56 858.29 113.38 0 S 1269.25 1085.05 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.49 6.49 -14.49 14.49 c 0 8 6.49 14.49 14.49 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c f* 1269.25 1085.05 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.49 6.49 -14.49 14.49 c 0 8 6.49 14.49 14.49 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c h S 1269.25 971.67 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.49 6.49 -14.49 14.49 c 0 8 6.49 14.49 14.49 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c f* 1269.25 971.67 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.49 6.49 -14.49 14.49 c 0 8 6.49 14.49 14.49 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c h S 1254.76 1085.05 0 -113.38 S 1666.08 1141.74 m 0 -8 -6.48 -14.49 -14.48 -14.49 c -8.01 0 -14.49 6.49 -14.49 14.49 c 0 8 6.48 14.49 14.49 14.49 c 8 0 14.48 -6.49 14.48 -14.49 c f* 1666.08 1141.74 m 0 -8 -6.48 -14.49 -14.48 -14.49 c -8.01 0 -14.49 6.49 -14.49 14.49 c 0 8 6.48 14.49 14.49 14.49 c 8 0 14.48 -6.49 14.48 -14.49 c h S 1666.08 1028.36 m 0 -8 -6.48 -14.49 -14.48 -14.49 c -8.01 0 -14.49 6.49 -14.49 14.49 c 0 8 6.48 14.49 14.49 14.49 c 8 0 14.48 -6.49 14.48 -14.49 c f* 1666.08 1028.36 m 0 -8 -6.48 -14.49 -14.48 -14.49 c -8.01 0 -14.49 6.49 -14.49 14.49 c 0 8 6.48 14.49 14.49 14.49 c 8 0 14.48 -6.49 14.48 -14.49 c h S 1651.6 1141.74 0 -113.38 S 2062.92 1198.43 m 0 -8 -6.49 -14.48 -14.49 -14.48 c -8 0 -14.48 6.48 -14.48 14.48 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c f* 2062.92 1198.43 m 0 -8 -6.49 -14.48 -14.49 -14.48 c -8 0 -14.48 6.48 -14.48 14.48 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c h S 2062.92 1085.05 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c f* 2062.92 1085.05 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c h S 2048.43 1198.43 0 -113.38 S 1666.08 1368.51 m 0 -8.01 -6.48 -14.49 -14.48 -14.49 c -8.01 0 -14.49 6.48 -14.49 14.49 c 0 8 6.48 14.48 14.49 14.48 c 8 0 14.48 -6.48 14.48 -14.48 c f* 1666.08 1368.51 m 0 -8.01 -6.48 -14.49 -14.48 -14.49 c -8.01 0 -14.49 6.48 -14.49 14.49 c 0 8 6.48 14.48 14.49 14.48 c 8 0 14.48 -6.48 14.48 -14.48 c h S 1666.08 1255.12 m 0 -8 -6.48 -14.48 -14.48 -14.48 c -8.01 0 -14.49 6.48 -14.49 14.48 c 0 8 6.48 14.49 14.49 14.49 c 8 0 14.48 -6.49 14.48 -14.49 c f* 1666.08 1255.12 m 0 -8 -6.48 -14.48 -14.48 -14.48 c -8.01 0 -14.49 6.48 -14.49 14.48 c 0 8 6.48 14.49 14.49 14.49 c 8 0 14.48 -6.49 14.48 -14.49 c h S 1651.6 1368.51 0 -113.39 S 2062.92 1425.2 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.48 14.48 14.48 c 8 0 14.49 -6.48 14.49 -14.48 c f* 2062.92 1425.2 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.48 14.48 14.48 c 8 0 14.49 -6.48 14.49 -14.48 c h S 2062.92 1311.81 m 0 -8 -6.49 -14.48 -14.49 -14.48 c -8 0 -14.48 6.48 -14.48 14.48 c 0 8.01 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.48 14.49 -14.49 c f* 2062.92 1311.81 m 0 -8 -6.49 -14.48 -14.49 -14.48 c -8 0 -14.48 6.48 -14.48 14.48 c 0 8.01 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.48 14.49 -14.49 c h S 2048.43 1425.2 0 -113.39 S 2062.92 1651.96 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c f* 2062.92 1651.96 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c h S 2062.92 1538.58 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c f* 2062.92 1538.58 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.48 6.49 -14.48 14.49 c 0 8 6.48 14.49 14.48 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c h S 2048.43 1651.96 0 -113.38 S 872.41 801.6 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.49 6.49 -14.49 14.49 c 0 8 6.49 14.49 14.49 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c f* 872.41 801.6 m 0 -8 -6.49 -14.49 -14.49 -14.49 c -8 0 -14.49 6.49 -14.49 14.49 c 0 8 6.49 14.49 14.49 14.49 c 8 0 14.49 -6.49 14.49 -14.49 c h S 2388.58 2332.25 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.45 0 p 31.31 0 56.7 25.38 56.7 56.69 c 0 0 p 0 31.31 -25.39 56.69 -56.7 56.69 c h S 2785.42 2332.25 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.45 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S 3182.25 2332.25 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.46 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S 1991.74 2332.25 0 0 P -31.31 0 -56.69 -25.38 -56.69 -56.69 c 0 0 p 0 -31.31 25.38 -56.69 56.69 -56.69 c 283.46 0 p 31.31 0 56.69 25.38 56.69 56.69 c 0 0 p 0 31.31 -25.38 56.69 -56.69 56.69 c h S 28.3455 w 1311.45 1992.11 2409.37 0 S Q q 0 2340 0 -2340 3750 0 ^ H 2025.13 565.38 47.24 0 0.63 62.36 -23.94 -47.24 -23.3 47.24 Y* K 2048.43 971.67 0 -396.84 f* 4.72425 w 2048.43 971.67 0 -396.84 S Q q 0 0 3750 0 0 2340 ^ Y K 2025.76 627.74 23.3 -47.24 23.94 47.24 -47.24 0 f* 4.72425 w 2025.76 627.74 23.3 -47.24 23.94 47.24 -47.24 0 H S Q q 0 2340 0 -2340 3750 0 ^ H 1628.29 508.69 47.24 0 0.63 62.36 -23.93 -47.24 -23.31 47.24 Y* K 1651.6 914.98 0 -396.84 f* 4.72425 w 1651.6 914.98 0 -396.84 S Q q 0 0 3750 0 0 2340 ^ Y K 1628.92 571.05 23.31 -47.24 23.93 47.24 -47.24 0 f* 4.72425 w 1628.92 571.05 23.31 -47.24 23.93 47.24 -47.24 0 H S Q q 0 2340 0 -2340 3750 0 ^ H 1231.45 452 47.25 0 0.62 62.36 -23.93 -47.24 -23.31 47.24 Y* K 1254.76 858.29 0 -396.84 f* 4.72425 w 1254.76 858.29 0 -396.84 S Q q 0 0 3750 0 0 2340 ^ Y K 1232.08 514.36 23.31 -47.24 23.93 47.24 -47.24 0 f* 4.72425 w 1232.08 514.36 23.31 -47.24 23.93 47.24 -47.24 0 H S Q q 0 2340 0 -2340 3750 0 ^ H 834.62 395.31 47.24 0 0.63 62.36 -23.94 -47.24 -23.31 47.24 Y* K 857.92 801.6 0 -396.84 f* 4.72425 w 857.92 801.6 0 -396.84 S Q q 0 0 3750 0 0 2340 ^ Y K 835.25 457.67 23.31 -47.24 23.94 47.24 -47.24 0 f* 4.72425 w 835.25 457.67 23.31 -47.24 23.94 47.24 -47.24 0 H S 28.3455 w 291.01 234.69 2551.1 0 S [ 9.4485 28.3455 ] 28.3455 d 4.72425 w 744.54 404.76 0 -340.15 S 1141.38 518.14 0 -453.53 S 1538.21 574.83 0 -510.22 S 1935.05 631.52 0 -566.91 S 347.7 348.07 0 -283.46 S cleartomark end end pagesave restore showpage %%PageTrailer %%Trailer %%Pages: 1 %%EOF interval-2.1.0/src/crlibm/docs/latex/fig_scs/multiplication.pdf0000644000000000000000000001405613031036767022751 0ustar 00000000000000%PDF-1.3 %쏢 6 0 obj <> stream x]ˎ$WQP uؑ9@3Zd AN܃QYUR AqG|8X^O~gOqY02M6\uXy ېc<t~=Ő<+GSP)Ms{"ȶ =rDJ.`74B~=waVxҔGOiX8_N_N1u#wi qXSH:B@hʗF8ú炼bLN~AXJ3@.Rz@.LR304CeG.LI89ѴB8KDT1I3AiGʮ]Z=QjQ"z@)M$LX']B6ȅȴJ(94SEWk}Q=Aj1!j07(O Rд [^u@PXR()ʲ$W\"r(cP*[ĺ| ڃ"v|5:g гz'Ij$[sf{e  s˓sfC83qV-cb#d4ve)3HByMuRI3jc,o&ǚI= 4Rr[$k0YXM_VRj98*g|nǧm "_%_0%"#,J !G\ 838T6bC Lr|A; iS}V[)z բ40[x= ᘅia.wÒ7ewŀ4*CcINȯC)qk ;wrB{T[%=.(l0.lҮDZGwEEy )c#}cL|Tժq"d#._TɩQ+ǿ>~FvsE:[y= nD5W &cG\9_qXM,snUe7 QSI&s;MTߨӹ~Aڥڸ]1DV+ d=rqȼ4,xP*[z~J NʴChZm'|V6>~FJQeX'f{ʎ \c4u0pXTNȴbj=FJ*0m3_TeM:meC dv=r1$΍C9KG_8+8"Bʖ1t}(^ ,] db"MB(>f1=BɧOQX95=QN9I!nIL?Vvxͤlj),%mez6/KhFpOƎn.[M2?,''}U)L?Rϧ___Oӆ{_vj%+ ie[z͟O RJ픗ןN/%iJo˹<\zKOv/MW}/I5-Xß@Fc #THkP/S( `Kdj[aVk "zY8'd@CZY!d_e5u4+VmEa+uz%-Xr&iV,R *QJ#e)$1@%8az[25 ,(lPxv`t*{b@3lTޟUd",3lR'ck{]c0X}I]|*Ot&B>Ց@Oa;TtQF*abU,VKr2)-gz_>hꝓ:eũGlb ]LħO󓲕DqҾ }7v,Dw!uD5~{aQZXR{R"P5:wzyS#ϼH*jًD!c&os[];בҖidܬgR~|B62PƖ"S;}CJ5Mv`ιmDιIhM2CdPA |Rj-^T1> `=W~sK:[;T6J6ZuM5 kuQ9Erܑ QFxܪ$ ᶶֽ tD-Q)2ekpBmksOdnをg{hA9j;e9$[w0`.aF_}\ݽO}~bAC7ߜkݮ}TDz9W%y,,BdOb *ہp"6yu2GUlɞJbTBg}x 4ZfTBs£]xt7e|RlF[<ȫn _Ƅ[y!?k9{,^TKd0lQ fsӢMp?#}4s1M.;rmZlŏvb9W" {-B.Agm3o3[0Y 6AÊmS0_a!v#Agm3oytO?X!NEGJa'smƵ *w Rk(eزpdp.)#l'ƠGD %z>0[ ^>ܣ>>J%Q}[Ѱ=&HRr6B\jhsmh>d2C<反@E9of}nQPvNCڭJ;˼MtSmDܞ$# x=c釷NԹ6ޛڻS3'v2@FlH뽍Y'`%~?9>L0NLj Svl5Tt fS-D=9 QmihKv]Z%'U9nWMdlx=ct%Qiq¿W>v>f|zEme~SmGP`v~9mvh7\,[鵧:9t^V2m۶@~=SYNe*uC jJynyPvGʶØ?E?Ex^,)eI1?ĝ8SMR"=pRvp7hU+!04a=RNzZ%](vExr ;z]S}]x# 04a=RNzZ-Jâ;2ޠJbؕ| wPK2mwKCNZVp+h_l(UDK-ı@Jӯiigʾvԟ.BG):!scT$H(-8srcd3q 翳c'Pbv 3/4^M:{[;߁{B#˽&[L(e&d!sCr,kuK٢{8ܱ EJou4]81 6qsE l,Is[ERL;Yqu;T[oݗ^4h~olg![옘im[r"A)6r4[ T.cWi4g12Zm3/_2ܽ ߉t߱]c]b:Ŗ5Rve#'gnp-/`"] wY)ob{ S ڮ/v~9߿7Wendstream endobj 7 0 obj 5198 endobj 10 0 obj <> endobj 11 0 obj <> endobj 5 0 obj <> /Contents 6 0 R >> endobj 3 0 obj << /Type /Pages /Kids [ 5 0 R ] /Count 1 >> endobj 1 0 obj <> endobj 4 0 obj <> endobj 9 0 obj <> endobj 8 0 obj <> endobj 2 0 obj <>endobj xref 0 12 0000000000 65535 f 0000005573 00000 n 0000005820 00000 n 0000005514 00000 n 0000005621 00000 n 0000005363 00000 n 0000000015 00000 n 0000005283 00000 n 0000005761 00000 n 0000005690 00000 n 0000005303 00000 n 0000005333 00000 n trailer << /Size 12 /Root 1 0 R /Info 2 0 R >> startxref 5872 %%EOF interval-2.1.0/src/crlibm/docs/latex/log.tex0000644000000000000000000017002613031036767017107 0ustar 00000000000000There are two versions of the logarithm. \begin{itemize} \item The first relies on 80-bit double-extended arithmetic, and is well suited to IA32 and IA64 architectures which have hardware support for such arithmetic. It computes the quick step in double-extended arithmetic, and the accurate step in double-double-extended arithmetic. \item The second relies only on double-precision arithmetic, and is portable. It uses double-double for the quick step, and triple-double for the accurate step. \end{itemize} Both implementations use the same algorithm, which is detailed in \ref{sec:logoutline}. Sections \ref{sec:logdeproof} and \ref{sec:logtdproof} detail the proof of both implementations, and \ref{sec:logperf} give some performance results. \section{General outline of the algorithm\label{sec:logoutline}} The algorithm used is mainly due to Wong and Goto\cite{WG94} and has been discussed further in \cite{Muller97}. In the case we are given here, both quick and accurate phase use principally the same algorithm however optimized for different accuracies. The function's argument $x \in \F$ is first checked for special cases, such as $x\leq0$, $+\infty$, $\nan$ etc. These checks are mainly implemented using integer arithmetics and will be further explained in section \ref{subsec:reduction}. Then, the argument is reduced using integer arithmetics as follows: $$x = 2^{E^\prime} \cdot m$$ where $E^\prime$ is the exponent of $x$ and $m$ a double corresponding to the mantissa of $x$. This decomposition is done such that in any case, i.e. even if $x$ is subnormal, $1 \leq m < 2$. In the subnormal case, the exponent of $x$ is adjusted accordingly. This first argument reduction corresponds to the equality $$\log\left( x \right) = E^\prime \cdot \log\left(2\right) + \log\left(m \right)$$ Using this term directly would lead to catastrophic cancellation in the case where $E^\prime = -1$ and $m \approx 2$. To overcome this difficulty, a second adjustment is done as follows: \begin{center} \begin{tabular}{cc} \begin{minipage}{50mm} $$E = \left \lbrace \begin{array}{lcl} E^\prime & \mbox{ if } & m \leq \sqrt{2} \\ E^\prime +1 & \mbox{ if } & m > \sqrt{2} \end{array} \right.$$ \end{minipage} & \begin{minipage}{50mm} $$y = \left \lbrace \begin{array}{lcl} m & \mbox{ if } & m \leq \sqrt{2} \\ \frac{m}{2} & \mbox{ if } & m > \sqrt{2} \end{array} \right.$$ \end{minipage} \end{tabular} \end{center} The decision whether $m \leq \sqrt{2}$ or not is performed using integer arithmetics on the high order bits of the mantissa $m$. The test is therefore not completely exact which is no disadvantage since, in any case, the bound $\sqrt{2}$ is somewhat arbitrary.\par All the previous reduction steps can be implemented exactly as they consist mainly in decompositions of a floating point number, multiplications by powers of $2$ and integer additions on the corresponding exponent value. All this leads to the following equation $$\log\left( x \right) = E \cdot \log\left( 2 \right) + \log\left( y \right)$$ where $$-\frac{1}{2} \cdot \log\left( 2 \right) \leq \log\left( y \right) \leq \frac{1}{2} \cdot \log\left( 2 \right)$$ The magnitude of $y$ is thus still too great for allowing for a direct polynomial approximation of $\log\left(y\right)$. Therefore, a second argument reduction step is performed using a table of $128$ entries as follows: using the high order bits of $y$ as an index $i$, a tabulated value $r_i$ is looked up which approximated very well $\frac{1}{y}$. Setting $z = y \cdot r_i - 1$, one obtains $$\log\left( y \right) = \log\left( 1 + z \right) - \log\left( r_i \right)$$ Since $y = \frac{1}{r_i} + \delta$ the magnitude of $z$ is finally small enough (typically $\left \vert z \right \vert < 2^{-8}$) for approximating $\log\left(1+z\right)$ by a Remez polynomial $p\left(z\right)$. The values for $\log\left(r_i\right)$ are of course also tabulated. It is important to notice that the reduction step $$z = y \cdot r_i - 1$$ can be implemented exactly which eases the correctness proof of the algorithm. This property will be proven in section \ref{subsec:reduction}. The reduced argument $z$ will be represented as a double-double number $z_\hi + z_\lo$ that will be fed into the polynomial approximation algorithms of both quick and accurate phase. Each of these phases will take into account the lower significant value $z_\lo$ for more or less higher monomial degrees. Both phases will finally reconstruct the function's value as follows: $$\log\left( x \right) \approx E \cdot \log\left( 2 \right) + p\left( z \right) - \log\left( r_i \right)$$ using a double (respectively a triple for the accurate phase) double value for each $\log\left( 2 \right)$ and $-\log\left( r_i \right)$. The computations necessary for performing this reconstruction are carried out in double-double arithmetics for the quick phase and triple-double for the accurate phase. The quick phase uses a modified Remez polynomial of degree $7$ of the form $$p\left( z \right) = z - \frac{1}{2} \cdot z^2 + z^3 \cdot \left( c_3 + z \cdot \left( c_4 + z \cdot \left( c_5 + z \cdot \left( c_6 + z \cdot c_7 \right) \right) \right) \right)$$ with $c_i \in \F$. This polynomial is evaluated as indicated by the parenthesis in the following term: $$p\left( z_\hi + z_\lo \right) \approx \left( \left(z_\hi + z_\lo \right) - \frac{1}{2} \cdot z_\hi^2\right) + \left( \left( - z_\hi \cdot z_\lo \right) + \left(z_\hi^2 \cdot z_\hi \right) \cdot \left( c_3 + z_\hi \cdot \left( c_4 + z_\hi \cdot \left( c_5 + z_\hi \cdot \left( c_6 + z_\hi \cdot c_7 \right) \right) \right) \right) \right)$$ The mathematical relative approximation error of the polynomial $p\left( z \right)$ defined as $$\epsilon_{\mbox{\tiny meth}} = \frac{p\left( z \right) - \log\left( 1 + z \right)}{\log\left(1 + z \right)}$$ is bounded by $$\left \vert \epsilon_{\mbox{\tiny meth}} \right \vert \leq 2^{-62.99}$$ This methodical error is joined by the arithmetical error induced by the evaluation of $p\left( z \right)$ and by the rounding of the constants $\log\left( 2 \right)$ and $\log\left( r_i \right)$. As will be shown in section \ref{subsec:quickphase}, the overall error of the quick phase defined as $$\epsilon_{\mbox{\tiny quick}} = \frac{\left(log_\hi + log_\lo\right) - \log\left(x\right)}{\log\left(x\right)}$$ is bounded by $$\left \vert \epsilon_{\mbox{\tiny quick}} \right \vert \leq 5 \cdot 2^{-65} \leq 2^{-62.6}$$ ~ \par After the computation of the quick phase double-double value $\left( log_\hi + log_\lo \right)$ a rounding test is performed using the rounding constants according to \ref{th:roundingRN1}. If the rounding cannot be decided, the accurate phase is launched. \par The accurate phase performs all its computations on the same reduced argument $z = z_\hi + z_\lo$ which will be shown to be exact. An approximation polynomial of degree $14$ is used. It is once again a modified Remez polynomial and has the following form: $$p\left( z \right) = z + \frac{1}{2} \cdot z + z^3 \cdot q\left( z \right)$$ where $$q\left( z \right) = c^\prime_3 + z \cdot \left( c^\prime_4 + z \cdot \left( c^\prime_5 + z \cdot \left( c^\prime_6 + z \cdot \left( c^\prime_7 + z \cdot \left( c^\prime_8 + z \cdot \left( c^\prime_9 + z \cdot r\left( z \right) \right) \right) \right) \right) \right) \right)$$ with $c^\prime_i = c_{i\hi} + c_{i\lo} \in \F + \F$ and $$r\left( z \right) = c_{10} + z \cdot \left( c_{11} + z \cdot \left( c_{12} + z \cdot \left( c_{13} + z \cdot c_{14} \right) \right) \right)$$ with $c_i \in \F$. The mathematical relative error $$\epsilon_{\mbox{\tiny meth}} = \frac{p\left( z \right) - \log\left( 1 + z \right)}{\log\left( 1 + z \right)}$$ is bounded by $$\left \vert \epsilon_{\mbox{\tiny meth}} \right \vert \leq 2^{-125}$$ The polynomial is evaluated using double precision for $r\left( z \right)$, double-double arithmetic for $q\left( z \right)$ and a triple-double representation for $p\left( z \right)$ and the final reconstruction. The overall error $$\epsilon_{\mbox{\tiny accurate}} = \frac{\left( log_\hi + log_\mi + log_\lo \right) - \log\left( x \right)}{\log\left( x \right)}$$ is bounded by $$\left \vert \epsilon_{\mbox{\tiny accurate}} \right \vert \leq 5735 \cdot 2^{-132} \leq 2^{-119.5}$$ as will be shown in section \ref{subsec:accuratephase}. Here $\left( log_\hi + log_\mi + log_\lo \right)$ are obtained by reconstructing the logarithm as indicated by the parenthesis in the following term: $$log_\hi + log_\mi + log_\lo = \left(E \cdot \left( log2_\hi + log2_\mi + log2_\lo \right) \right) + \left( \left( p_\hi + p_\mi + p_\lo \right) + \left(logi_\hi + logi_\mi + logi_\lo \right) \right)$$ where $log2_\hi + log2_\mi + log2_\lo \approx \log\left( 2 \right)$ and $logi_\hi + logi_\mi + logi_\lo \approx -\log\left(r_i \right)$. Since the critical accuracy of the double precision $\log$ function is $118$ bits according to \cite{DinDefLau2004LIP}, rounding $\log_\hi + log_\mi + log_\lo \approx \log\left( x \right)$ to double precision is equivalent to rounding the infinite precision value $\log\left( x \right)$ to double precision. Using the final rounding sequences presented in \cite{Lauter2005LIP:tripledouble}, which are supposed to be correct, the double precision value returned by the function is the correctly rounded double precision value of $\log\left( x \right)$. \section{Proof of correctness of the triple-double implementation \label{sec:logtdproof}} Proving that an implementation of an elementary function is correctly rounded means mainly proving two bounds on the relative error $\epsilon_{\mbox{\tiny quick}}$ and $\epsilon_{\mbox{\tiny accurate}}$, using the appropriate lemma for proving the correctness of the rounding test and conluding by means of the theorem stating the critical accuracy of the function considered. The computation of the error bounds will be done mainly using the Gappa tool\cite{Melqu05} but some parts of the proof are still based on paper or Maple computations. These parts will be shown in sections \ref{subsec:reduction}, \ref{subsec:quickphase} and \ref{subsec:accuratephase} and mainly comprise the following: \begin{itemize} \item the demonstration that all special cases are handled correctly, \item a proof that $z_\hi + z_\lo = r_i \cdot y - 1$ exactly, \item the bounds for the mathematical approximation errors for the polynoms, \item a proof of the exactness of some multiplications in the code, \item the proof for the accuracy of all basic addition and multiplication code sequences on double-double and triple-double numbers, \item the correctness proof of the final rounding sequences for rounding triple-double numbers to double precision and \item the mathematical equality of the term rewriting hints in the Gappa code. \end{itemize} The proofs for the accuracy of the basic operation bricks and the correctness proof of the final rounding sequences are somewhat lengthy and are not given here; they can be found in \cite{Lauter2005LIP:tripledouble}. \subsection{Exactness of the argument reduction\label{subsec:reduction}} In this section, we will show that all special cases are handled correctly and that the reduced argument consisting in $E$ and $z_\hi + z_\lo$ is exact, which means that we have the mathematically exact equation $$\log\left( x \right) = E \cdot \log\left( 2 \right) + \log\left( 1 + \left( z_\hi + z_\lo \right) \right) - \log\left( r_i \right)$$ This part of the algorithm is performed by the following code sequences which we will analyse line by line: \begin{lstlisting}[caption={Handling of special cases and table access},firstnumber=1] E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= ((db_number) ((double) two52)).d; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Do argument reduction */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; index = index & INDEXMASK; ed = (double) E; ri = argredtable[index].ri; logih = argredtable[index].logih; logim = argredtable[index].logim; \end{lstlisting} Analysis of the code: {\renewcommand{\labelenumi}{} \begin{enumerate} \item line 1 and 2: Initialization of integer $E$ and {\tt db\_number} {\tt xdb} which is now equal to $x$. \item line 5: As the integer ordering and the ordering on floating point numbers are compatible, $x < +2^{-1022}$, i.e. negative, negative infinite, equal to zero or a subnormal. \item line 6: {\tt xdb.i[HI] \& 0x7fffffff} is the high order word of $x$ without the sign bit. If the test is true, $\left \vert x \right \vert = 0$. As the logarithm of $0$ is not defined but as the limit $-\infty$ is known, returning $-1.0 / 0.0$ is correct. \item line 9: Since the integer ordering and the ordering on floating point numbers are compatible, {\tt xdb.i[HI] < 0} implies $x < 0$. The logarithm is not defined for negative numbers, so the result must be $\nan$. $0.0 / 0.0$ leads to a $\nan$; one uses $\left(x - x\right) / 0.0$ in order to overcome the static tests of the compiler. \item line 13 and 14: if this code lines are reached, $x$ is a subnormal. Since $E$ equals $0$ at this point, setting it to $-52$ and multipliying {\tt xdb} by $2^{-52}$ means bringing {\tt xdb} to the normal number range and rescaling the internal representation $x = 2^E \cdot m = 2^E \cdot${\tt xdb} in consequence. \item line 17: As the integer ordering and the ordering on floating point numbers are compatible and as {\tt 0x7fefffff ffffffff} is the greatest normal, the test being true implies that $x$ is equal to $+\infty$ or $\nan$. In the case of $x=+\infty$, $+\infty$ must be returned which is done. In the other case, $\nan$ must be returned which is still assured by $x + x$. \item line 23: At this point of the code, the most significant bit of the high order word of {\tt xdb} must be $0$ as the case where $x < 0$ is already filtered out. So {\tt xdb.i[HI] > > 20} is equal to the biased exponent of {\tt xdb} because a double number consists in $1$ sign bit, $11$ exponent bits and the word bit length is supposed to be $32$. Subtracting $1023$ yields to the unbiased exponent which is written to $E$. \item line 24 and 25: Since a double number consists in $1$ sign bit and $11$ exponent bits, the operation {\tt xdb.i[HI] \& 0x000fffff} masks out the mantissa bits in the higher order word of {\tt xdb}. Rewriting {\tt xdb.i[HI] = index | 0x3ff00000} means setting the exponent of {\tt xdb} to $0$ because {\tt 0x3ff}$ - 1023 = 0$. \item line 26: Before execution of this line of code, {\tt index} contains the high order bits of the normalized mantissa of $x$ stored as a double in {\tt xdb.d} and verifying thus $1 \leq m < 2$. The second argument reduction step will slice this intervall in $128$ intervalls for each of which we dispose of a table entry. For reasons of possible cancellation in the reconstruction step on the operation $p\left( z \right) - \log\left( r_i \right)$, we want the small intervalls to be centered around $1$. That means e.g. for the intervall around $1$ and a table indexed by $7$ bits that mantissas (as doubles) with the high order word {\tt 0x3fefffff} through {\tt 0x3ff00fff} must be mapped to $0$. The decision is therefore made at the $7+1$th bit of the mantissa part of the double depending on whether this bit is $0$ -- in which case the value falls in the lower intervall -- or $1$ -- in which case the value goes to the next higher intervall. So adding $1$ to the $\left(20 - 7 - 1\right)$ rightmost bit ($L = 7$) increases the index value by $1$ iff this bit is $1$. So after execution of the line, {\tt index} contains the number of the intervall for the second argument reduction step centered in $1$. \item line 29 through 31: The second adjustment to be made on $E^\prime$ and $m$ is the decision whether $m > \sqrt{2}$ as indicated in section \ref{sec:logoutline}. The high order word of $\sqrt{2}$ rounded to a double is {\tt 0x3ff6a09e}. As one can simply verify, the value for {\tt index} calculated for this value is $53$. As the integer ordering and the ordering of floating point numbers are compatible and as the computations for computing {\tt index} are monotone, {\tt index} being greater or equal than $53$ implies that the (normalized) mantissa of $x$ is greater than $\sqrt{2} + \delta$ with a neglectable error $\delta$. As {\tt MAXINDEX} is equal to $53$, the test will be true iff the adjustment on $E^\prime$ leading to $E$ and $m$ yielding $y$ is to be made. It is trivial to see that the code in the {\tt if}'s body implements the adjustment correctly. \item lines 33 and 34: the final value of the reduced argument $y$ -- still stored in {\tt xdb.d} -- is copied to a {\tt double} variable (or register) named {\tt y}. The final index value is masked out by means of an {\tt INDEXMASK} which is equal to $127 = 2^7-1$. \item lines 36: The integer value of the exponent $E$ stored in {\tt E} is cast to a {\tt double ed}. \item lines 38 through 41: The table is indexed by {\tt index} and values {\tt ri}$=r_i$ and {\tt logih}$=logi_\hi$ and {\tt logim}$=logi_\mi$ are read. Since the latter form a double-double precision value, we know that $logi_\hi + logi_\mi = \log\left( r_i \right) \cdot \left( 1 + \epsilon \right)$ with $\left \vert \epsilon \right \vert \leq 2^{-106}$. The value {\tt ri} is stored as a single precision variable and a Maple procedure assures that for each value $y$ the following inegality is verified: $$\left \vert z \right \vert = \left \vert y \cdot r_i - 1 \right \vert \leq 2^{-8}$$ \end{enumerate} } Let us show now that the following line calculate $z_\hi$ and $z_\lo$ such that for each $y$ and corresponding $r_i$, we obtain exactly $$z_\hi + z_\lo = y \cdot r_i - 1$$ \begin{lstlisting}[caption={Argument reduction},firstnumber=42] Mul12(&yrih, &yril, y, ri); th = yrih - 1.0; Add12Cond(zh, zl, th, yril); \end{lstlisting} We know that we can suppose that the multiplication and addition sequences \Mul~ and \Add~ used at lines 42 and 44 are exact. Thus, it suffices to show that $$yri_\hi - 1.0 = yri_\hi \ominus 1.0$$ because in that case, we can note $$z_\hi + z_\lo = th + yri_\lo = yri_\hi \ominus 1.0 + yri_\lo = y \cdot r_i - 1.0$$ We will show this property using Sterbenz' lemma. It suffices thus to prove that $$\frac{1}{2} \leq yri_\hi \leq 2$$ We know that \begin{eqnarray*} yri_\hi & = & \circ\left( y \cdot r_i \right) \\ & \leq & \circ \left( 1 + 2^{-8} \right) \\ & = & 1 + 2^{-8} \\ & < & 2 \end{eqnarray*} since the rounding function $\circ$ is monotonic and the accuracy of the format is greater than $9$ bits. The other way round, we get \begin{eqnarray*} yri_\hi & = & \circ \left( y \cdot r_i \right) \\ & \geq & \circ \left( 1 - 2^{-8} \right) \\ & = & 1 - 2^{-8} \\ & > & \frac{1}{2} \end{eqnarray*} for the same reasons. Thus $z_\hi + z_\lo = y \cdot r_i$ exactly. Since the previous phases of the argument reduction were all exact, the reduced argument verifies $x = 2^{E} \cdot y$ exactly. Still in this section, let us show that neither the reduced argument of the logarithm function nor its result may be a sub-normal double number. The first property has already been assured by special case handling as shown above. The latter can be proven as follows: the $\log\left( x \right)$ function has one zero for $x = 1$ and only one. As it is monotone, for $x = 1 \pm 1 \mUlp = 1 \pm 2^{-52}$ we will obtain $\log\left( 1 \pm 2^{-52} \right) = 0 \pm 2^{-52} + \delta$ with $\left \vert \delta \right \vert \leq 2^{-103}$. As $0 \pm 2^{-1022}$ is the least normal, the result of the logarithm function will always be a normal. Further, in both double-double and triple-double representations for the final intermediate result for the function, as its critical accuracy is $118$, the least significant double in the representation will still be a normal as $52 + 106 = 158 < 1022$. \subsection{Accuracy proof of the quick phase\label{subsec:quickphase}} As already mentionned, the accuracy proof of the quick phase is mainly based on the Gappa tool. To prove the desired accuracy bound defined as $$\epsilon_{\mbox{\tiny quick}} = \frac{\left(log_\hi + log_\lo\right) - \log\left(x\right)}{\log\left(x\right)}$$ and given by $$\left \vert \epsilon_{\mbox{\tiny quick}} \right \vert \leq 5 \cdot 2^{-65} \leq 2^{-62.6}$$ three different Gappa proof files are necessary depending on the following cases: \begin{itemize} \item for $E \geq 1$ and all indexes to the table $0 \leq i \leq 127$, a general proof file named {\tt log-td.gappa} is used \item for $E = 0$ and all indexes to the table except $0$, i.e. $1 \leq i \leq 127$, a proof file named {\tt log-td-E0.gappa} comes to hand and \item for $E = 0$ and the table index $i = 0$, a proof file called {\tt log-td-E0-logir0.gappa} is employed. This latter file uses relative error computations in opposition to the other two cases where absolute error estimates suffice. This is necessary because in this case and in this one only, the logarithm function has a zero in the intervall considered. \end{itemize} In each of the three proof files, we will ask the Gappa tool to verify the accuracy bound expressed in its syntax as follows: \begin{lstlisting}[caption={Accuracy bound to prove},firstnumber=109] -> ((logh + logm) - Log) / Log in [-5b-65,5b-65] \end{lstlisting} Still in any proof file, some hypothesis are made on the correctness of one multiplication sequence and the accuracy of the constants and resting operations carried out in double-double arithmetic. These hypothesis are the following: \begin{itemize} \item The operations in the following code sequence are exact since the constants are stored with enough trailing zeros: \begin{lstlisting}[caption={Multiplication by $E$},firstnumber=50] Add12(log2edh, log2edl, log2h * ed, log2m * ed); \end{lstlisting} This means that $log2ed_\hi + log2ed_\lo = E \cdot \left( log2_\hi + log2_\lo \right)$ exactly. \item The operations in the following code sequence are exact since multiplications with a power of $2$ are exact as long as the result is not underflowed: \begin{lstlisting}[caption={Multiplication by $-0.5$},firstnumber=60] zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; \end{lstlisting} i.e. $zhSquareHalf_\hi + zhSquareHalf_\lo = -0.5 \cdot \left( zhSquare_\hi + zhSquare_\lo \right)$. \item The following hypothesis on the accuracy bounds, expressed here in Gappa syntax, are verified: \begin{lstlisting}[caption={Gappa hypothesis},firstnumber=100] (T2hl - T2) / T2 in [-1b-103,1b-103] /\ (Phl - PE) / PE in [-1b-103,1b-103] /\ (LogTabPolyhl - LogTabPoly) / LogTabPoly in [-1b-103,1b-103] /\ (Loghm - LogE) / LogE in [-1b-103,1b-103] /\ (Log2hm - Log2) / Log2 in [-1b-84,1b-84] /\ (Logihm - Logir) / Logir in [-1b-106,1b-106] /\ Z in [_zmin,_zmax] /\ (P - Log1pZ) / Log1pZ in [-_epsilonApproxQuick,_epsilonApproxQuick] /\ ((logh + logm) - Loghm) / Loghm in [-1b-106,1b-106] \end{lstlisting} Here, {\tt \_zmin}, {\tt \_zmax} and {\tt \_epsilonApproxQuick} are replaced by Maple calculated values, typically $-zmin = zmax = 2^{-8}$ and $epsilonApproxQuick = 2^{-62.99}$. \end{itemize} Let us now show each of this hypothesises. \begin{enumerate} \item The operations yielding {\tt log2edh} and {\tt log2edl} are all exact because the \Add~ sequence is supposed to be exact in any case and because the constants {\tt log2h} and {\tt log2m} are calculated by the following Maple code and have in consequence at least 11 trailing zeros and {\tt ed} $=E$ is less than $1024$ in magnitude since $1024$ is the maximum exponent value for double precision. \begin{lstlisting}[caption={Maple code for computing {\tt log2h} and {\tt log2m}},firstnumber=21,label={list:maplelog2}] log2acc := log(2): log2h := round(log2acc * 2**(floor(-log[2](abs(log2acc))) + (53 - 11))) / 2**(floor(-log[2](abs(log2acc))) + (53 - 11)): log2m := round((log2acc - log2h) * 2**(floor(-log[2](abs((log2acc - log2h)))) + (53 - 11))) / 2**(floor(-log[2](abs((log2acc - log2h)))) + (53 - 11)): \end{lstlisting} \item To show that $zhSquareHalf_\hi + zhSquareHalf_\lo = -0.5 \cdot \left( zhSquare_\hi + zhSquare_\lo \right)$ we just have to show that both values $zhSquare_\hi$ and $zhSquare_\lo$ are either equal to $0$ or greater than $2$ times the smallest normal. Let us first give the definitions of both values: \begin{eqnarray*} zhSquare_\hi & = & \circ \left( z_\hi \cdot z_\hi \right) \\ zhSquare_\lo & = & z_\hi \cdot z_\hi - zhSquare_\hi \end{eqnarray*} where $z_\hi = \circ \left( z \right)$. Let us suppose that $z \not = 0$. Otherwise all values are equal to $0$ and we can conclude. Let us first show that $\left \vert zhSquare_\hi \right \vert$ is greater than $2^{54}$ times the smallest normal. Let us therefore suppose that this is not the case, i.e. $\left \vert zhSquare_\hi \right \vert < 2^{-948}$. Since the rounding function is monotonic, this implies that $\left \vert z_\hi \right \vert \leq 2^{-424}$. For the same reason, we can note that $\left \vert z \right \vert \leq 2^{-424}$. As we have $z = y \cdot r_i - 1$, clearly neither $y$ nor $r_i$ can be exactly $1$. If this were the case for both, we would obtain $z=0$ which we excluded; if there were one of them only that was exactly $1$, the other being a floating point number in the intervall $\left[ 0.5; 1.5 \right]$, the resulting inegality $\left \vert z \right \vert \geq 2^{-53}$ which would be contradictory. Otherwise, since we know that $1 - 2^{-8} \leq y \cdot r_i \leq 1 + 2^{-8}$ and since the precision of all formats used is greater than $9$, the hypothesis that $1 - 2^{-424} \leq y \cdot r_i \leq 1 + 2^{-424}$ and $y \cdot r_i \not = 0$ would imply that the infinite precision mantissa of $y \cdot r_i$ contains a $1$ weighted with $2^0$ and a $1$ weighted with less than $2^{-424}$. So its length would be greater than $423$ bits. As it is the product of two floating point numbers which have $52$ and $23$ significant bits, there cannot be a $1$ weighted with less than $76$ if there is a $1$ weighted with $2^0$ which is the case. Contradiction. So $-0.5 \cdot zhSquare_\hi$ is not underflowed. Additionally, with a similar argument, since {\tt zh} is a double precision number, $zhSquare_\lo$ is either $0$ or greater in magnitude than $2^{-53} \cdot \left \vert zhSquare_\hi \right \vert$ which is $2^{52}$ times greater in magnitude than the smallest normal. So $zhSquare_\lo$ is either $0$ or $2$ times greater in magnitude than the smallest normal. So, the floating point multiplication of $zhSquare_\hi$ and $zhSquare_\lo$ with $-0.5$ can be considered to be exact. \item {\tt (T2hl - T2) / T2 in [-1b-103,1b-103]} which means that $$\left \vert \frac{T2hl - T2}{T2} \right \vert \leq 2^{-103}$$ is verified as $T2hl$ and $T2$ are defined as follows: $$T2hl = t2_\hi + t2_\lo \gets \mAddDD \left( z_\hi, z_\lo, zhSquareHalf_\hi, zhSquareHalf_\lo \right)$$ $$T2 = \left( z_\hi + z_\lo \right) + \left( zhSquareHalf_\hi + zhSquareHalf_\lo \right)$$ The given bound is thus just the accuracy bound of the \AddDD~ sequence for which a proof can be found in \cite{Lauter2005LIP:tripledouble}. \item {\tt (Phl - PE) / PE in [-1b-103,1b-103]} is verified for the same reason; let us just recall the definitions $$Phl = p_\hi + p_\lo \gets \mAddDD \left( t2_\hi, t2_\lo, t1_\hi, t1_\lo \right)$$ $$PE = \left( t2_\hi + t2_\lo\right) + \left( t1_\hi + t1_\lo \right)$$ \item {\tt (LogTabPolyhl - LogTabPoly) / LogTabPoly in [-1b-103,1b-103]} falls still into the same case with $$LogTabPolyhl = logTabPoly_\hi + logTabPoly_\lo \gets \mAddDD \left( logi_\hi, logi_\mi, p_\hi, p_\lo \right)$$ $$LogTabPoly = \left( logi_\hi, + logi_\mi \right) + \left( p_\hi + p_\lo \right)$$ \item And finally, {\tt (Loghm - LogE) / LogE in [-1b-103,1b-103]} which is also just the accuracy bound of the \AddDD~ sequence for $$Loghm = log_\hi + log_\mi \gets \mAddDD \left( log2ed_\hi, log2ed_\lo, logTabPoly_\hi, logTabPoly_\lo \right)$$ $$LogE = \left( log2ed_\hi + log2ed_\lo \right) + \left( logTabPoly_\hi + logTabPoly_\lo \right)$$ \item {\tt (Log2hm - Log2) / Log2 in [-1b-84,1b-84]} is verified since $log2_\hi$ and $log2_\mi$ are computed as already indicated in listing \ref{list:maplelog2}. This means that at least $11$ trailing zeros are stored in each in the doubles in this (pseudo-)double-double number, so it is exact to $2^{-106-2 \cdot 11} = 2^{-84}$. \item {\tt (Logihm - Logir) / Logir in [-1b-106,1b-106]} which means $$\left \vert \frac{\left( logi_\hi + logi_\mi \right) - \log\left( r_i \right)}{\log\left( r_i \right)} \right \vert \leq 2^{-106}$$ is verified by construction as $logi_\hi$ and $logi_\mi$ are computed by the following Maple code: \begin{lstlisting}[caption={Maple code for computing $logi_\hi$ and $logi_\mi$},firstnumber=35] (logih[i], logim[i], logil[i]) := hi_mi_lo(evalf(-log(r[i]))): \end{lstlisting} where {\tt hi\_mi\_lo} is the procedure for rounding an arbitrary precision number to a triple-double number the higher significant numbers of which form a double-double number. \item The hypothesis {\tt Z in [\_zmin,\_zmax]} simply recalls the bounds for $z$ as calculated by Maple. \item The same can be said on the hypothesis \\ {\tt (P - Log1pZ) / Log1pZ in [-\_epsilonApproxQuick,\_epsilonApproxQuick]} \\ which gives the mathematical approximation error of the polynomial. This bound is computed by Maple using the following instructions: \begin{lstlisting}[caption={Maple code for computing the relative error of the polynomial},firstnumber=129] epsilonApproxQuick := numapprox[infnorm]( 1-polyQuick/log(1+x), x=zminmin..zmaxmax) \end{lstlisting} \item Finally, Gappa's hypothesis {\tt ((logh + logm) - Loghm) / Loghm in [-1b-106,1b-106]} simply restates the fact that a double-double precision number is exact to at least $2^{-106}$ in terms of its relative error. \end{enumerate} The Gappa tool itself is not capable of proving the final accuracy bound it is asked for a complex algorithm as the one given here. Its user must provide hints to help it to rewrite the interval arithmetics terms it encounters in the program. These hints are generally given in the form {\tt $\alpha$ -> $\beta$} where $\beta$ is an expression we want the tool to rewrite the expression $\alpha$ by. Generally speaking, the idea behind each hint is one of the following: \begin{itemize} \item For computing intervall bounds on differences like $\alpha = a - A$ where both $a$ and $A$ are sums of terms like $a = c + C$ and $B = d + D$, it is often useful to rewrite $\alpha$ by $\beta = \left(c - d \right) + \left( C - D \right)$. \item An intervall bound can often be easier found for a term $A$ representing an exact mathematical value that for $a$ which is its arithmetical equivalent. So it is useful to rewrite $a$ by $A \cdot \left( 1 + \frac{a - A}{A} \right)$ when an intervall for $\frac{a - A}{A}$ is known. \item Fractional left hand sides like $\frac{a}{b}$ where both expressions $a$ and $b$ are functions in a common argument $x$ that can be written like $a = a\left( x \right) = x^n \cdot a^\prime\left( x \right)$ and $b = b\left( x \right) = x^m \cdot b^\prime\left( x \right)$ should usually be rewritten as follows: $$\frac{a\left(x\right)}{b\left( x \right)} = \frac{x^n \cdot a^\prime\left( x \right)}{x^m \cdot b^\prime\left( x \right)} = x^{n - m} \cdot \frac{a^\prime\left( x \right)}{b^\prime\left( x \right)}$$ In particular, this kind of hint is needed when an intervall for the denominator of a fractional left-hand-side comprises $0$. \item Fractional left-hand-sides of the form $\frac{a - A}{A}$ with an unknown $A$ can easily be written like $$\frac{a - A}{A} = \frac{a - B}{B} + \frac{B - A}{A} + \frac{a - B}{B} \cdot \frac{B - A}{A}$$ We can show this equivalence like this \begin{eqnarray*} \frac{a - A}{A} & = & \frac{a - B + B - A}{A} \\ & = & \frac{a - B}{A} + \frac{B - A}{A} \\ & = & \frac{a - B}{B} \cdot \frac{B}{A} + \frac{B - A}{A} \\ & = & \frac{a - B}{B} \cdot \left( 1 + \frac{B - A}{A} \right) + \frac{B - A}{A} \\ & = & \frac{a - B}{B} + \frac{B - A}{A} + \frac{a - B}{B} \cdot \frac{B - A}{A} \end{eqnarray*} This is particularly useful when a bound on the relative error of some term $a$ with regard to $B$ should be extended to the next approximation level. \end{itemize} Clearly, the left-hand-side $A$ and right-hand-side $B$ of an hint must be mathematically equivalent to provide a correct result. The Gappa tool checks for this equivalence and sometimes is able to prove it. If not, it emits a warning indicating that the formal proof it is generating for the accuracy bound computations is valid only under the hypothesis that both sides of the rewriting hint are mathematically equivalent. Further, it prints out the difference $A - B$ of both sides $A$ and $B$ which it has already reduced using the equivalences given in the Gappa code. It is relatively simple to verify that all this differences are equal to $0$ modulo the definitions given in the Gappa code by means of Maple-scripts. This work can even been done automatically. Thus, we refrain from giving a paper proof of each hint in the Gappa files used for proving the logarithm function but just give the exhaustive list of the hints in files {\tt log-td.gappa} and {\tt log-td-E0-logir0.gappa}: \begin{lstlisting}[caption={Gappa term rewriting hints in file {\tt log-td.gappa}},firstnumber=115] T2hl - T2 -> ((T2hl - T2) / T2) * T2; T2hl -> (T2hl - T2) + T2; Phl - PE -> ((Phl - PE) / PE) * PE; Phl -> (Phl - PE) + PE; LogTabPolyhl -> (LogTabPolyhl - LogTabPoly) + LogTabPoly; Loghm -> (Loghm - LogE) + LogE; Log2 -> Log2hm * (1 / (((Log2hm - Log2) / Log2) + 1)); Logir -> Logihm * (1 / (((Logihm - Logir) / Logir) + 1)); LogTabPolyhl - LogTabPoly -> ((LogTabPolyhl - LogTabPoly) / LogTabPoly) * LogTabPoly; HZZsimp -> (-0.5 * zh * zh) - (0.5 * zl * zl); T2hl - ZpHZZsimp -> (0.5 * zl * zl) + delta1; zhCube - ZZZ -> (Z * (zhSquareh - Z * Z)) - (zl * zhSquareh); polyUpper - ZZZPhigher -> ZZZ * (polyHorner - Phigher) + polyHorner * delta3 + delta2; ZpHZZ + ZZZPhigher -> ZpHZZsimp + ZZZPhigherPzhzl; Phl - P -> (T2hl - ZpHZZsimp) + (T1hl - ZZZPhigherPzhzl) + delta4; Log1pZ -> P * (1 / (((P - Log1pZ) / Log1pZ) + 1)); P - Log1pZ -> ((P - Log1pZ) / Log1pZ) * Log1pZ; Phl - Log1pZ -> (Phl - P) + delta6; LogTabPolyhl - Log1pZpTab -> (Logihm - Logir) + (Phl - Log1pZ) + delta7; Loghm - Log -> (Log2edhm - Log2E) + (LogTabPolyhl - Log1pZpTab) + delta5; (logh + logm) - Loghm -> (((logh + logm) - Loghm) / Loghm) * Loghm; (logh + logm) - Log -> ((logh + logm) - Loghm) + (Loghm - Log); \end{lstlisting} \begin{lstlisting}[caption={Gappa term rewriting hints in file {\tt log-td-E0-logir0.gappa}},firstnumber=81] T2hl - T2 -> ((T2hl - T2) / T2) * T2; T2hl -> (T2hl - T2) + T2; Phl - PE -> ((Phl - PE) / PE) * PE; Phl -> (Phl - PE) + PE; (ZhSquarehl - ZZ) / ZZ -> 2 * ((zh - Z) / Z) + ((zh - Z) / Z) * ((zh - Z) / Z); (zhSquareh - ZZ) / ZZ -> ((ZhSquarehl - ZZ) / ZZ) + ((zhSquareh - ZhSquarehl) / ZZ); (zhSquareh - ZhSquarehl) / ZZ -> ((zhSquareh - ZhSquarehl) / ZhSquarehl) * (ZhSquarehl / ZZ); ZhSquarehl / ZZ -> ((ZhSquarehl - ZZ) / ZZ) + 1; (ZhCube - ZZZ) / ZZZ -> (((zh * zhSquareh) - ZZZ) / ZZZ) + ((ZhCube - (zh * zhSquareh)) / ZZZ); ((zh * zhSquareh) - ZZZ) / ZZZ -> (1 + ((zh - Z) / Z)) * (1 + ((zhSquareh - ZZ) / ZZ)) - 1; ((ZhCube - (zh * zhSquareh)) / ZZZ) -> ((ZhCube - (zh * zhSquareh)) / (zh * zhSquareh)) * (((zh - Z) / Z) + 1) * (((zhSquareh - ZZ) / ZZ) + 1); polyHorner / Phigher -> ((polyHorner - Phigher) / Phigher) + 1; (polyUpper - ZZZPhigher) / ZZZPhigher -> ((polyHorner - Phigher) / Phigher) + ((ZhCube - ZZZ) / ZZZ) * (polyHorner / Phigher) + + ((polyUpper - (polyHorner * ZhCube)) / (polyHorner * ZhCube)) * (polyHorner / Phigher) + + ((ZhCube - ZZZ) / ZZZ) * ((polyUpper - (polyHorner * ZhCube)) / (polyHorner * ZhCube)) * (polyHorner / Phigher); ((ZhSquareHalfhl - (zh * zl)) - HZZ) / HZZ -> - ((zh - Z) / Z) * ((zh - Z) / Z); (ZhSquareHalfhl - HZZ) / HZZ -> (ZhSquarehl - ZZ) / ZZ; ((T2hl - (zh * zl)) - ZpHZZ) / ZpHZZ -> ((HZ * (((ZhSquareHalfhl - (zh * zl)) - HZZ) / HZZ)) + ((T2hl - T2) / T2) + (HZ * ((T2hl - T2) / T2)) + (HZ * ((ZhSquareHalfhl - HZZ) / HZZ) * ((T2hl - T2) / T2))) / (1 + HZ); (PE - P) / P -> (((1 + HZ) * (((T2hl - (zh * zl)) - ZpHZZ) / ZpHZZ)) + ((1 + ((zh - Z) / Z)) * (Z * ((zh - Z) / Z)) * ((Flzhzl - (zh * zl)) / (zh * zl))) + (ZZ * Phigher * ((polyUpper - ZZZPhigher) / ZZZPhigher))) / (1 + HZ + ZZ * Phigher); (Phl - P) / P -> ((PE - P) / P) + ((((PE - P) / P) + 1) * ((Phl - PE) / PE)); (Loghm - Log) / Log -> ((Loghm - P) / P) + ((P - Log) / Log) + ((Loghm - P) / P) * ((P - Log) / Log); (((logh + logm) - Log) / Log) -> (((logh + logm) - Loghm) / Loghm) + ((Loghm - Log) / Log) + (((logh + logm) - Loghm) / Loghm) * ((Loghm - Log) / Log); \end{lstlisting} For the reasons mentionned, we can consider the accuracy proof of the quick phase to be correct. \subsection{Accuracy proof of the accurate phase\label{subsec:accuratephase}} The accuracy proof of the accurate phase is also based mainly on the use of the Gappa tool. Nevertheless, since the tool is currently not directly supporting triple-double representations, some additional hand-proven accuracy bound results for the main addition and multiplication operators are needed. They can be found in \cite{Lauter2005LIP:tripledouble}. Since all these accuracy bounds are parameterized by the maximal overlap bound for the triple-double numbers along the computations, before being able to give a numerical value for these error bounds understood by the Gappa tool, it is necessary to do a maximal overlap bound analysis using the theorems given in \cite{Lauter2005LIP:tripledouble}.\par Eventually, since not an overlapped triple-double intermediate result is to be returned by the logarithm function but a double precision number that is the correct rounding according to the rounding mode chosen, the algorithm effectuates a renormalizing operation on the final result and rounds this non-overlapped result down to a double using an appropriate rounding sequence. All this renormalization and rounding sequences are exact and have been shown to be correct in \cite{Lauter2005LIP:tripledouble}. The same way, all properties shown in section \ref{subsec:reduction} concerning the special case handling and exactness argument reduction can be reused because the algorithm implemented in the accurate phase uses the same reduced argument and is substantially the same as for the quick phase. \par We will thus rely on all these properties and simply show the following accuracy bound $$\epsilon_{\mbox{\tiny accurate}} = \frac{\left( log_\hi + log_\mi + log_\lo \right) - \log\left( x \right)}{\log\left( x \right)}$$ is bounded by $$\left \vert \epsilon_{\mbox{\tiny accurate}} \right \vert \leq 5735 \cdot 2^{-132} \leq 2^{-119.5}$$ which will be expressed in Gappa syntax as follows: \begin{lstlisting}[caption={Accuracy bound to prove for the accurate phase},firstnumber=165] -> ((logh + logm + logl) - MLog) / MLog in [-5735b-132,5735b-132] \end{lstlisting} The Gappa proof files still make the hypothesis that two of the multiplications in the accurate phase code can be considered to be exact. This property must therefore be shown in a paper proof in the following. The first of these multiplications is the following sequence: \begin{lstlisting}[caption={Multiplication of triple-double $\circ\left( Z \cdot Z \right)$ by $-\frac{1}{2}$},firstnumber=99] zSquareHalfh = zSquareh * -0.5; zSquareHalfm = zSquarem * -0.5; zSquareHalfl = zSquarel * -0.5; \end{lstlisting} As it will be shown below, the relative error $\epsilon_{ZSquare}$ defined as $$\epsilon_{ZSquare} = \frac{\left( zSquare_\hi + zSquare_\mi + zSquare_\lo \right) - Z^2}{Z^2}$$ is bounded by $\left \vert \epsilon_{ZSquare} \right \vert \leq 2^{-149}$. Using the same argument as the one given in section \ref{subsec:quickphase}, one can show that $Z$ is either $0$ or greater in magnitude than at least $2^{-77}$. So the following is true $$Z^2 = 0 \lor \left \vert Z^2 \right \vert \geq 2^{-154}$$ If $Z^2=0$, $ZSquarehml = zSquare_\hi + zSquare_\mi + zSquare_\lo$ trivially is $0$, too, and the multiplication is with $-\frac{1}{2}$ is therefore exact. Since we can note $ZSquarehml = Z^2 \cdot \left( 1 + \epsilon_{ZSquare} \right)$, we know that in the other case, $$\left \vert ZSquarehml \right \vert \geq 2^{-155}$$ We can suppose that in the triple-double number $zSquare_\hi + zSquare_\mi + zSquare_\lo$, $zSquare_\mi$ and $zSquare_\lo$ are not overlapped at all (since $zSquare_\mi = \circ \left( zSquare_\mi + zSquare_\lo \right)$) and that $zSquare_\hi$ and $zSquare_\mi$ are not fully overlapped. So we can note $\left \vert zSquare_\mi \right \vert \leq 2^{-\beta_o} \cdot \left \vert zSquare_\hi \right \vert$ and $\left \vert zSquare_\lo \right \vert \leq 2^{-\beta_u} \cdot \left \vert zSquare_\mi \right \vert$ with $\beta_o \geq 1$ and $\beta_u \geq 53$. We will show this property below we are just supposing here. So we can verify the following \begin{eqnarray*} \left \vert ZSquarehml \right \vert & = & \left \vert zSquare_\hi + zSquare_\mi + zSquare_\lo \right \vert \\ & \leq & \left \vert zSquare_\hi \right \vert + \left \vert zSquare_\mi \right \vert + \left \vert zSquare_\lo \right \vert \\ & \leq & \left \vert zSquare_\hi \right \vert + 2^{-\beta_o} \cdot \left \vert zSquare_\hi \right \vert + 2^{-\beta_o} \cdot 2^{-\beta_u} \cdot \left \vert zSquare_\hi \right \vert \\ & \leq & 2 \cdot \left \vert zSquare_\hi \right \vert \end{eqnarray*} In consequence, we obtain $$\left \vert zSquare_\hi \right \vert \geq \frac{1}{2} \cdot \left \vert ZSquarehml \right \vert$$ and thus $$\left \vert zSquare_\hi \right \vert \geq 2^{-156}$$ under the hypothesis that it is not exactly zero. So $zSquareHalf_\hi = -\frac{1}{2} \cdot zSquare_\hi$ will never be underflowed. Let us now show first that the operations for computing $zSquareHalf_\mi$ and $zSquareHalf_\lo$ cannot both be inexact. We will use the fact that $\left \vert zSquare_\lo \right \vert \leq 2^{-53} \cdot \left \vert zSquare_\mi \right \vert$. Suppose first that $$zSquareHalf_\mi \gets - \frac{1}{2} \otimes zSquare_\mi$$ is inexact. So $\left \vert zSquare_\mi \right \vert < 2^{-1022}$ and in consequence $\left \vert zSquare_\lo \right \vert < 2^{-1022-53}$. Note that the inegality is strict. Since the least (in magnitude) representable denormalized double precision floating point number is $2^{-52} \cdot 2^{-1023}$, $zSquare_\lo = 0$ in this case. So $$zSquareHalf_\lo \gets - \frac{1}{2} \otimes zSquare_\lo$$ is exact because trivially, a multiplication with $0$ is exact. Suppose now that $$zSquareHalf_\lo \gets - \frac{1}{2} \otimes zSquare_\lo$$ is inexact. So $\left \vert zSquare_\lo \right \vert < 2^{-1022}$. Further, the least significant bit of the mantissa of $zSquare_\lo$ is $1$ because otherwise, a bit-shift in its mantissa by 1 would be an exact operation. Thus $\left \vert zSquare_\lo \right \vert \geq 2^{-52} \cdot 2^{-1023}$ and $\left \vert zSquare_\mi \right \vert \geq 2^{-1022}$. So $$zSquareHalf_\mi \gets - \frac{1}{2} \otimes zSquare_\mi$$ cannot be inexact because in this case we would have $\left \vert zSquare_\mi \right \vert < 2^{-1022}$. So, in any case, if ever $zSquareHalf_\mi + zSquareHalf_\lo$ are not exactly $-\frac{1}{2} \cdot \left( zSquare_\mi + zSquare_\lo \right)$, the error made will be $\frac{1}{2} \cdot d$ in magnitude, where $d = 0^+$ is the smallest representable denormalized non-zero double. So we can note down in this case $$zSquareHalf_\hi + zSquareHalf_\mi + zSquareHalf_\lo = - \frac{1}{2} \cdot \left( zSquare_\hi + zSquare_\mi + zSquare_\lo \right) + \delta$$ with $\left \vert \delta \right \vert \leq 2^{-1075}$. Since we know that $\left \vert - \frac{1}{2} \cdot \left( zSquare_\hi + zSquare_\mi + zSquare_\lo \right) \right \vert \geq 2^{-156}$, we can give the following bound $$\left \vert \frac{\delta}{-\frac{1}{2} \cdot \left( zSquare_\hi + zSquare_\mi + zSquare_\lo \right)} \right \vert \leq \frac{2^{-1075}}{2^{-156}} = 2^{-919}$$ So we get $$ZSquareHalfhml = - \frac{1}{2} \cdot ZSquarehml \cdot \left(1 + \epsilon\right)$$ with $\left \vert \epsilon \right \vert \leq 2^{-919}$ In contrast, since we know that $\left \vert Z \right \vert \leq 2^{-8}$ thus that $\left \vert Z^2 \right \vert \leq 2^{-16}$ but that $\left \vert Z^2 \right \vert \geq 2^{-154}$, we can assume that the infinite precision mantissa of $Z^2$ can always be written exactly with at most $154 - 16 = 138 < 149$ bits. As we can show that $\frac{1}{2} \cdot \left \vert ZSquarehml \right \vert \leq \left \vert zSquare_\hi \right \vert \leq 2 \cdot \left \vert ZSquarehml \right \vert$ we know that if ever one of $zSquare_\mi$ or $zSquare_\lo$ is such that the multiplication with $-\frac{1}{2}$ is not exact, the error made has already been accounted for in the error bound for $ZSquarehml$ with regard to $Z^2$. So the operation computing $ZSquareHalfhml$ out of $ZSquarehml$ can be considered to be exact. \par Let us now analyse the following sequence \begin{lstlisting}[caption={Multiplication of triple-double $Log2hml$ by $E$},firstnumber=126] log2edhover = log2h * ed; log2edmover = log2m * ed; log2edlover = log2l * ed; \end{lstlisting} Similar to the argumentation that has been given in section \ref{subsec:quickphase}, since $E=ed$ is bound in magnitude by $1024=2^{10}$ and since $log2_\hi$, $log2_\mi$ are stored with at least $11$ trailing bits at zero, the multiplications in these components are exact. The constant $log2_\lo$ is not stored with $11$ trailing bits at zero but it could be because we will be just supposing the bound $\left \vert \epsilon_{Log2hml} \right \vert \leq 2^{-3 \cdot 53 + 33} = 2^{-126}$ for $$\epsilon_{Log2hml} = \frac{log2_\hi + log2_\mi + log2_\lo - \log\left( 2 \right)}{\log\left( 2 \right)}$$ So the multiplication is not exact in itself but the final result is exacter than the bound we are using for it. Let us finally just recall the Maple code for computing the constants: \begin{lstlisting}[caption={Maple code for computing $Log2hml$},firstnumber=21] log2acc := log(2): log2h := round(log2acc * 2**(floor(-log[2](abs(log2acc))) + (53 - 11))) / 2**(floor(-log[2](abs(log2acc))) + (53 - 11)): log2m := round((log2acc - log2h) * 2**(floor(-log[2](abs((log2acc - log2h)))) + (53 - 11))) / 2**(floor(-log[2](abs((log2acc - log2h)))) + (53 - 11)): log2l := log2acc - (log2h + log2m): \end{lstlisting} So the multiplication can be considered to be exact as long the less accurate bound for $\epsilon_{Log2hml}$ is used. Let us know analyse the bounds that we can give for the maximal overlap of the components of the triple-double numbers in the logarithm implementation. For doing this, we will assign each triple-double number in the code an overlap bound as follows. Call the number in consideration e.g. $a_\hi + a_\mi + a_\lo$. So we will give the bounds expressed like this: \begin{eqnarray*} \left \vert a_\mi \right \vert & \leq & 2^{-\alpha_o} \cdot \left \vert a_\hi \right \vert \\ \left \vert a_\lo \right \vert & \leq & 2^{-\alpha_u} \cdot \left \vert a_\mi \right \vert \end{eqnarray*} where $\alpha_o, \alpha_u \geq 2$. We will then propagate this information following the flow of control in the implementation and using the overlap bound theorems given in \cite{Lauter2005LIP:tripledouble}. Here, we understand by ``propagating'' checking a system of constraints of the bounds under the limitations provided by the theorems. As the control-flow-graph of our implementation is completely linear, this check is linear, too. The theorems mentionned can be summarized as follows: \begin{center} \begin{tabular}{|l|ll|ll|ll|} \hline Operation & 1st arg. & 2nd arg. & result high & result low \\ \hline \AddTT & $\alpha_o \geq 4$, $\alpha_u \geq 1$ & $\beta_o \geq 4$, $\beta_u \geq 1$ & $\gamma_o \geq \min\left( \alpha_o, \beta_o \right) - 5$ & $\gamma_u \geq 53$ \\ \hline \AddDTT & - & $\beta_o \geq 2$, $\beta_u \geq 1$ & $\gamma_o \geq \min\left( 45, \beta_o - 4, \beta_o + \beta_u - 2 \right)$ & $\gamma_u \geq 53$ \\ \hline \MulDT & - & - & $\gamma_o \geq 48$ & $\gamma_u \geq 53$ \\ \hline \MulDTT & - & $\beta_o \geq 2$, $\beta_u \geq 1$ & $\gamma_o \geq \min\left( 48, \beta_o - 4, \beta_o + \beta_u - 4 \right)$ & $\gamma_u \geq 53$ \\ \hline \end{tabular} \end{center} So let us analyse the following code: \begin{lstlisting}[caption={Triple-double computations},firstnumber=90,label={list:tripledouble}] Mul23(&zSquareh, &zSquarem, &zSquarel, zh, zl, zh, zl); Mul233(&zCubeh, &zCubem, &zCubel, zh, zl, zSquareh, zSquarem, zSquarel); Mul233(&higherPolyMultZh, &higherPolyMultZm, &higherPolyMultZl, t14h, t14l, zCubeh, zCubem, zCubel); zSquareHalfh = zSquareh * -0.5; zSquareHalfm = zSquarem * -0.5; zSquareHalfl = zSquarel * -0.5; Add33(&polyWithSquareh, &polyWithSquarem, &polyWithSquarel, zSquareHalfh, zSquareHalfm, zSquareHalfl, higherPolyMultZh, higherPolyMultZm, higherPolyMultZl); Add233(&polyh, &polym, &polyl, zh, zl, polyWithSquareh, polyWithSquarem, polyWithSquarel); Add33(&logyh, &logym, &logyl, logih, logim, logil, polyh, polym, polyl); log2edhover = log2h * ed; log2edmover = log2m * ed; log2edlover = log2l * ed; log2edh = log2edhover; log2edm = log2edmover; log2edl = log2edlover; Add33(&loghover, &logmover, &loglover, log2edh, log2edm, log2edl, logyh, logym, logyl); \end{lstlisting} This code will finally generate triple-double numbers respecting the following overlap bounds as will be shown below: \begin{center} \begin{tabular}{|l|l|l|l|} \hline Variable & Line(s) & $\alpha_o \geq$ & $\alpha_u \geq$ \\ \hline $ZSquarehml$ & 90 & $48$ & $53$ \\ \hline $ZCubehml$ & 91 & $44$ & $53$ \\ \hline $HigherPolyMultZhml$ & 92 & $40$ & $53$ \\ \hline $ZSquareHalfhml$ & 93-95 & $48$ & $53$ \\ \hline $PolyWithSquarehml$ & 96-98 & $35$ & $53$ \\ \hline $Polyhml$ & 99 & $31$ & $53$ \\ \hline $Logyhml$ & 100 & $26$ & $53$ \\ \hline $Log2edhml$ & 101-106 & $40$ & $40$ \\ \hline $Logoverhml$ & 107 & $21$ & $53$ \\ \hline \end{tabular} \end{center} So let us verify exemplarily some of these bounds: \begin{itemize} \item At line 90, $ZSquarehml$ is computed out of the double-double number $z_\hi + z_\lo$ by use of the \MulDT~ sequence. Since the inputs of this function are not triple-double, the overlap bound is just the bound provided by the sequence itself, i.e. $\alpha_o \geq 48$, $\alpha_u \geq 53$. \item $ZCubehml$ is the result of a \MulDTT~ sequence at line 91. Its overlap bound depends therefore on the one for $ZSquarehml$, which is the second argument of the function. Since we know the bound for this variable, we easily verify the one for $ZCubehml$ which is $\alpha_o \geq 44$ and $\alpha_u \geq 53$. \item $Log2edhml$ is the exact pairwise product of the triple-double constant $Log2hml$ and double $E$. Since $E$ may be as small as $0$ in magnitude and further, since the multiplication is pairwise, the overlap bound we dispose of for $Log2edhml$ is the same as for $Log2hml$ which is stored with at least $11$ bit trailing zeros. So an appropriate bound is $\alpha_o \geq 52 - 11 \geq 40$ and $\alpha_u \geq 40$. \end{itemize} All other bounds can be verified the same way using the theorems given in \cite{Lauter2005LIP:tripledouble} and indicated above. \par Since we have computed the overlap bounds for the different triple-double operands in the code, we can now calculate the accuracy bounds for the operations. Doing this is only possible with the knowledge of the overlap of the operations because all accuracy bound theorems given in \cite{Lauter2005LIP:tripledouble} are parameterized with this overlap expressions. Let us first give a list of the accuracy of the different basic operations which is not exhaustive with regard to its lack of listing almost all preconditions on the sequences required for theorems to hold. We refrain from explicitely verifying each of this preconditions in this document as this is only fastidious work but not of special interest. \begin{center} \begin{tabular}{|l|l|l|l|} \hline Operation & Overlap 1st arg. & Overlap 2nd arg. & Relative error $\epsilon$ \\ \hline \AddDD & - & - & $\left \vert \epsilon \right \vert \leq 2^{-103.5} \leq 2^{-103}$ \\ \hline \MulDD & - & - & $\left \vert \epsilon \right \vert \leq 2^{-102}$\\ \hline \AddTT & $\alpha_o \geq 4$, $\alpha_u \geq 1$ & $\beta_o \geq 4$, $\beta_u \geq 1$ & $\left \vert \epsilon \right \vert \leq 2^{-\min\left( \alpha_o + \alpha_u, \beta_o + \beta_u \right) -47} + 2^{-\min\left( \alpha_o, \beta_o \right) - 98}$ \\ \hline \AddDTT & - & $\beta_o \geq 2$, $\beta_u \geq 1$ & $\left \vert \epsilon \right \vert \leq 2^{-\beta_o - \beta_u - 52} + 2^{-\beta_o-104} + 2^{-153}$ \\ \hline \MulDT & - & - & $\left \vert \epsilon \right \vert \leq 2^{-149}$ \\ \hline \MulDTT & - & $\beta_o \geq 2$, $\beta_u \geq 1$ & $\left \vert \epsilon \right \vert \leq 2^{-97-\beta_o} + 2^{-97-\beta_o-\beta_u} + 2^{-150}$ \\ \hline \end{tabular} \end{center} Still analyzing the following double-double computations code and the code given at listing \ref{list:tripledouble}, one can now easily check the bounds for the relative error of the different operations listed in the table below. We define here the relative error of an operation $\ast$ and its arithmetical equivalent $\circledast$ as follows: $$\epsilon = \frac{\left(a \circledast b \right) - \left(a \ast b\right)}{\left(a \ast b \right)}$$ \begin{lstlisting}[caption={Double-double computations in accurate phase},firstnumber=73,label={list:doubledouble}] Mul12(&t1h, &t1l, zh, highPoly); Add22(&t2h, &t2l, accPolyC9h, accPolyC9l, t1h, t1l); Mul22(&t3h, &t3l, zh, zl, t2h, t2l); Add22(&t4h, &t4l, accPolyC8h, accPolyC8l, t3h, t3l); Mul22(&t5h, &t5l, zh, zl, t4h, t4l); Add22(&t6h, &t6l, accPolyC7h, accPolyC7l, t5h, t5l); Mul22(&t7h, &t7l, zh, zl, t6h, t6l); Add22(&t8h, &t8l, accPolyC6h, accPolyC6l, t7h, t7l); Mul22(&t9h, &t9l, zh, zl, t8h, t8l); Add22(&t10h, &t10l, accPolyC5h, accPolyC5l, t9h, t9l); Mul22(&t11h, &t11l, zh, zl, t10h, t10l); Add22(&t12h, &t12l, accPolyC4h, accPolyC4l, t11h, t11l); Mul22(&t13h, &t13l, zh, zl, t12h, t12l); Add22(&t14h, &t14l, accPolyC3h, accPolyC3l, t13h, t13l); \end{lstlisting} \begin{center} \begin{tabular}{|l|l|l|l|} \hline Result & Line(s) & Operation & Relative error $\epsilon$ \\ \hline $T1hl$ through $T14hl$ & 73 - 86 & \AddDD~ / \MulDD & $\left \vert \epsilon \right \vert \leq 2^{-103}$ / $\left \vert \epsilon \right \vert \leq 2^{-102}$ \\ \hline $ZSquarehml$ & 90 & \MulDT & $\left \vert \epsilon \right \vert \leq 2^{-149}$ \\ \hline $ZCubehml$ & 91 & \MulDTT & $\left \vert \epsilon \right \vert \leq 2^{-144}$ \\ \hline $HigherPolyMultZhml$ & 92 & \MulDTT & $\left \vert \epsilon \right \vert \leq 2^{-141}$ \\ \hline $PolyWithSquarehml$ & 96-98 & \AddTT & $\left \vert \epsilon \right \vert \leq 2^{-137}$ \\ \hline $Polyhml$ & 99 & \AddDTT & $\left \vert \epsilon \right \vert \leq 2^{-134}$ \\ \hline $Logyhml$ & 100 & \AddTT & $\left \vert \epsilon \right \vert \leq 2^{-128}$ \\ \hline $Logoverhml$ & 107 & \AddTT & $\left \vert \epsilon \right \vert \leq 2^{-123}$ \\ \hline \end{tabular} \end{center} Let us just explicitely check the bound for one of the operations for sake of an example. Let us take therefore the \AddTT~ sequence at lines 96-98 computing $PolyWithSquarehml$ out of $ZSquareHalfhml$ and $HigherPolyMultZhml$. We have already obtained to following overlap bounds: \begin{eqnarray*} \left \vert zSquareHalf_\mi \right \vert & \leq & 2^{-48} \cdot \left \vert zSquareHalf_\hi \right \vert \\ \left \vert zSquareHalf_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert zSquareHalf_\mi \right \vert \\ \left \vert higherPolyMultZ_\mi \right \vert & \leq & 2^{-40} \cdot \left \vert higherPolyMultZ_\hi \right \vert \\ \left \vert higherPolyMultZ_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert higherPolyMultZ_\mi \right \vert \end{eqnarray*} Feeding now this bounds into the theorem on the accuracy of \AddTT, we get $$\left \vert \epsilon \right \vert \leq 2^{-\min\left( 48 + 53, 40 + 53 \right) - 47} + 2^{-\min \left( 48, 40 \right) - 98} \leq 2^{-140} + 2^{-138} \leq 2^{-137}$$ All other error bounds can be verified in a similar way. They are finally expressed in Gappa syntax as follows: \begin{lstlisting}[caption={Relative error bounds in Gappa code},firstnumber=139] (T2hl - T2) / T2 in [-1b-103,1b-103] /\ (T3hl - T3) / T3 in [-1b-102,1b-102] /\ (T4hl - T4) / T4 in [-1b-103,1b-103] /\ (T5hl - T5) / T5 in [-1b-102,1b-102] /\ (T6hl - T6) / T6 in [-1b-103,1b-103] /\ (T7hl - T7) / T7 in [-1b-102,1b-102] /\ (T8hl - T8) / T8 in [-1b-103,1b-103] /\ (T9hl - T9) / T9 in [-1b-102,1b-102] /\ (T10hl - T10) / T10 in [-1b-103,1b-103] /\ (T11hl - T11) / T11 in [-1b-102,1b-102] /\ (T12hl - T12) / T12 in [-1b-103,1b-103] /\ (T13hl - T13) / T13 in [-1b-102,1b-102] /\ (T14hl - T14) / T14 in [-1b-103,1b-103] /\ (ZSquarehml - ZSquare) / ZSquare in [-1b-149,1b-149] /\ (ZCubehml - ZCube) / ZCube in [-1b-144,1b-144] /\ (HigherPolyMultZhml - HigherPolyMultZ) / HigherPolyMultZ in [-1b-141,1b-141] /\ (PolyWithSquarehml - PolyWithSquare) / PolyWithSquare in [-1b-137,1b-137] /\ (Polyhml - Poly) / Poly in [-1b-134,1b-134] /\ (Logyhml - Logy) / Logy in [-1b-128,1b-128] /\ (Loghml - Logover) / Logover in [-1b-123,1b-123] /\ (Log2hml - MLog2) / MLog2 in [-1b-126,1b-126] /\ (Logihml - MLogi) / MLogi in [-1b-159,1b-159] /\ (MPoly - MLog1pZ) / MLog1pZ in [-_epsilonApproxAccurate,_epsilonApproxAccurate] /\ Z in [_zmin,_zmax] /\ ((logh + logm + logl) - Loghml) / Loghml in [-1b-159,1b-159] \end{lstlisting} Concerning the Gappa proofs for accurate phase, in a similar way as for the quick phase, three different proof files are used. They reflect once again the three main cases for the argument of the logarithm function: \begin{itemize} \item For cases where after argument reduction $\left \vert E \right \vert \geq 1$, the file {\tt log-td-accurate.gappa} is used. In this case, absolute error computations are sufficient for the final relative error bound to be calculable because $\left \vert \log\left( x \right) \right \vert \geq \frac{1}{2} \log\left( 2 \right)$ in this case. \item For the case where after argument reduction, $E = 0$ and $i \not = 0$, the file {\tt log-td-accurate-E0.gappa} is used. The same way here, we have a preponderant constant term so absolute error computations suffice. \item For the other case, where $E=0$ and $i=0$ the file {\tt log-td-accurate-E0-logir0.gappa} provides the accuracy bound proof. In contrast to the other cases, we obliged to relative error estimations since the beginning since the function $\log\left( x \right)$ has a zero in this intervall. \end{itemize} Once again, several term rewriting hints are needed in the Gappa proof files for enabling the Gappa tool to generate a proof for the accuracy bounds. In a similar way, the hints which cannot directly be checked for their mathematical correctness by the tool itself are verified by semi-automatic Maple scripts.\par By the existence of an accuracy proof for a final relative error of $\left \vert \epsilon_{\mbox{\tiny accurate}} \right \vert \leq 2^{-119.5}$ and by the use of the critical accuracy of the double precision natural logarithm function which is $118$ bits\cite{DinDefLau2004LIP}, we can consider the implementation to be correctly rounding under the hypothesis that the final rounding sequence used is exact and correct. Since we suppose this -- a correctness proof can be found in \cite{Lauter2005LIP:tripledouble} -- the correctly rounding property is verified. \section{Proof of correctness of the double-extended implementation \label{sec:logdeproof}} \section{Performance results\label{sec:logperf}} The given implementation of the natural logarithm function aims at being both portable and more performant than the previous implementations using the SCS libary for the accurate phase. This goal is acheived in terms of memory consumption (if the code sizes for {\tt scslib} are taken into account) and in terms of speed performance. The reason for this is mainly the possibility of reusing all values computed in the argument reduction phase and the tables for the accurate phase directly. \subsection{Memory requirements} \subsection{Timings} %%% Local Variables: %%% mode: latex %%% TeX-master: "crlibm" %%% End: interval-2.1.0/src/crlibm/docs/latex/log10.tex0000644000000000000000000002445013031036767017247 0ustar 00000000000000This chapter is contributed by Ch. Q. Lauter. \section{Main considerations, critical accuracy bounds}\label{subsec:criticalboundslog10} If one wants to guarantee that an implementation of the logarithm in base $10$, $\log_{10}\left( x \right)$, in double precision is correctly rounded, one has to ensure that the final intermediate approximation before rounding to double precision has a relative error of less than $2^{-122}$. An implementation of $\log_{10}\left(x\right)$ can also be derived from an implementation of the natural logarithm $\ln\left(x\right)$ using the formula: \begin{equation} \log_{10}\left( x \right) = \frac{1}{\ln\left( 10 \right)} \cdot \ln\left( x \right)\label{eq:log10} \end{equation} When doing so, one must ensure that the constant $\mathit{log10inv} = \frac{1}{\ln\left(10\right)}$ is stored with enough accuracy, that the approximation for $\ln\left( x \right)$ is exact enough and that the multiplication sequence does not introduce too great an error. As we will see in the next section \ref{subsec:outlinelog10}, this implies slight changes to the code for the natural logarithm with regard to what has been presented in Chapter \ref{chap:log}. With regard to final rounding, the elementary function $\log_{10}$ presents a particular issue that is somewhat singular amongst all considered elementary functions: There exist a large set of input double-precision numbers $x$ such that $\log_{10}(x)$ is a rational and is representable as a double-precision number. For such cases, a final directed rounding will be correct only if the approximation error is exactly $0$. Indeed, the rounding $\diamond\left( f\left( x \right) \right)$ of the exactly representably value $f\left(x\right) \in \F$ is trivially $\diamond\left( f\left( x \right) \right) = f\left( x \right)$ \cite{IEEE754}. In contrast, $\diamond\left( f\left( x \right) + \delta \right) \not = f\left( x \right) \in \F$ holds for all $\left \vert \delta \right \vert > 0$. As it is impossible to achieve an approximation error exactly equal to zero, it is preferable to filter out such cases and handle them separately. Other functions described so far had only one such argument ($x=1$ for $\log$, x=0 for the trigs). $\log_2$ has a set of such cases ($x = 2^k$, $k \in \Z$) which is equally trivial to handle in binary floating point. For $f = \log_{10}$, filtering much more difficult. In fact, $y = \log\left( x \right)$ is algebraic for exactly all $x = 10^k$, $k \in \Z$ \cite{Baker75}. Filtering means thus testing whether an input $x$ can be written $x = 10^k$ with an integer $k \in \Z$. This is equivalent to testing if $\log_{10}\left( x \right)$ an integer, i.e. $\log_{10}\left( x \right) \in \Z$. However, since $\log_{10}\left( x \right)$ can only be approximated, filtering this way is impossible. One possibility is the following approach. In floating point arithmetic, in order to be in a situation of difficult rounding, not only $\log_{10}\left( x \right)$ must be algebraic but also the corresponding $x = 10^k$, $k \in \Z$, must be representable in floating point. To start with eliminating cases, we can argue that this impossible for all $k < 0$. Indeed, since $2 \nmid 5$, there exist no $m \in \N$ and $e \in \Z$ for any $k \in \Z^-$ such that $10^k = 2^e \cdot m$ \cite{Muller97}. So we have reduced the range of cases to filter to all $x = 10^k$, $k \in \N \cup \left \lbrace 0\right \rbrace$. Further in double precision, the mantissa's length is $53$. So $10^k = 2^k \cdot 5^k = 2^e \cdot m$ is exactly representable in double precision only for values $k \in \N \cup \left \lbrace 0 \right \rbrace$ such that $5^k \leq 2^{53}$. This yields to $k \leq 53 \cdot \frac{\ln\left( 2 \right)}{\ln\left( 5 \right)} \approx 22.82$; hence $0 \leq k \leq 22$. In consequence, it would be possible to filter out the $23$ arguments $x = 10^k$ with $k \in \left \lbrace 0 \dots 22 \right \rbrace$. Nevertheless, this approach would be relatively costly. It is not the way that has been chosen for the implementation presented here. Our approach uses the critical worst case accuracy of the elementary function $\log_{10}\left( x \right)$. As already mentioned, it is $2^{-122}$. Under the condition that we can provide an approximation to the function that is exact to at least $2^{-123}$, we can decide the directed rounding using a modified final rounding sequence: We know that a $1$ after a long series of $0$s (respectively a $0$ after a long series of $1$s) must be present at least at the $122$th bit of the intermediate mantissa. If it is not, we can consider a potentially present $1$ after the $122$th bit to be an approximation error artefact. In fact this means neglecting $\delta$s relatively less than $2^{-122}$ when rounding $\diamond \left( f\left( x \right) + \delta \right)$ instead of $\diamond \left( f\left( x \right) \right)$. One shortcoming of this approach is that the accurate phase is launched for arguments where the quick phase's accuracy would suffice to return the correct result. As such arguments are extremely rare ($p = \frac{23}{2^{63}} \approx 2.5 \cdot 10^{-18}$~!), this is not of an issue. The modification of the final rounding sequence is relatively lightweight: merely one floating point multiplication, two integer masks and one integer comparison have to be added to handle the case. One remarks this approach is only possible because the critical worst case accuracy of the function is known by Lef{\`e}vre's works. Ziv's oignon peeling strategy without the filtering of the $23$ possible cases in input and without any accuracy limitation for intermediate computations yields to nontermination of the implementation of the function on such arguments $x = 10^k$. An earlier \crlibm\ implementation of the $\log_{10}\left(x\right)$ function based on the SCS format did not handle the problem and returned incorrectly rounded results for inputs $x = 10^k$ in the directed rounding modes. \section{General outline of the algorithm and accuracy estimates}\label{subsec:outlinelog10} % 1/2 page % % - Multiply by the right constant, this time using a triple double for the constant => Mul33 which is costly % - Tell about the need to gain some bits in the log for the worst case => renormalize at some point in the code % - Analyse the issue of integer powers of 10 => give explanation that there are only 17 cases % - Indicate the way the final rounding sequence for triple double can be modified => additional costs % - Mention that we launch the accurate phase even for results where the quick phase result suffices (10^n), % analyse the problem and mention that it is unique for log10 (in the usual list of elementary functions) % but that it is quasi impossible to get around it (tell that log10 in SCS did not correctly treat the problem) The quick phase of the implementation of the $\log_{10}\left( x \right)$ follows exactly the scheme depicted by equation (\ref{eq:log10}) above. Similarly to the logarithm in base $2$, the natural logarithm's intermediate double-double result is multiplied by a double-double precision approximation of $\mathit{log10inv}$. The rounding test is slightly modified in order to ensure safe rounding or launching the accurate phase. Concerning the accurate phase, some modifications in the natural logarithm's code are necessary because of the tighter accuracy bound needed for the worst case. The natural logarithms accurate phase polynomial approximation relative error has already been less than $2^{-125}$ which is exact enough for $\log_{10}\left( x \right)$. The fact that the complete triple-double implementation is exact to only $119$ bits, is mainly due to the inexactness of the operators used in reconstruction phase. In turn, this inexactness is caused by the relatively high overlap in the triple-double numbers handled. By adding two additional renormalisations the triple-double operators become exact enough. The constant $\mathit{log10inv}$ cannot be stored in double-double precision with an accuracy of $124$ bits. A triple-double approximation is therefore used. Its relative approximation error is smaller than $2^{-159}$. The final multiplication of the triple-double constant representing $\mathit{log10inv}$ and the triple-double natural logarithm result is performed by a \MulTT. The relative error of this operator on non-overlapping triple-doubles is not greater than $2^{-140}$. This last operation therefore offers a large accuracy overkill. TODO The combination of the previous errors should be verified in Gappa. \section{Timings}\label{subsec:timingslog10} We compare \crlibm's portable triple-double implementation for $\log_{10}\left( x \right)$ to other correctly rounded and not-correctly rounded implementations. ``\crlibm\ portable using \scslib'' is the timing for the earlier implementation in {\tt crlibm}, which has been superseded by the one depicted here since version 0.10$\beta$. This earlier implementation was completely based on the SCS format and did not contain a quick phase implemented in double precision arithmetic. The values are given in arbitrary units and obtained on a IBM Power 5 processor with gcc 3.3.3 on a Linux Kernel 2.6.5. \begin{table}[h] \begin{center} \begin{tabular}{|l|r|r|} \hline Library & avg time & max time \\ \hline \hline \multicolumn{3}{|c|}{Power5 / Linux-2.6 / gcc-3.3} \\ \hline \texttt{MPFR} & 9490 & 84478 \\ \hline \crlibm\ portable using \texttt{scslib} & 2624 & 2744 \\ \hline \crlibm\ portable using triple-double & 60 & 311 \\ \hline default \texttt{libm} (not correctly rounded) & 66 & 71 \\ \hline \hline \multicolumn{3}{|c|}{PentiumM / Linux-2.6 / gcc-4.0} \\ \hline \crlibm\ portable using triple-double & 304 & 1529 \\ \hline default \texttt{libm} (not correctly rounded) & 153 & 1904 \\ \hline \hline \end{tabular} \end{center} \caption{Log10 timings on Power5 and PentiumM architectures} \label{Log10timings} \end{table} On average, our triple-double based implementation is even $10\%$ faster than its incorrectly rounding counterpart on Power. On Pentium, we observe the usual factor 2 with respect to an implementation using double-extended arithmetic. Worst case timings are acceptable in both cases. %%% Local Variables: %%% mode: latex %%% TeX-master: "crlibm" %%% End: interval-2.1.0/src/crlibm/docs/latex/log1p.tex0000644000000000000000000000007113031036767017340 0ustar 00000000000000 Todo. In between, see files log1p-td.\{h,c,mpl,gappa\}. interval-2.1.0/src/crlibm/docs/latex/log2.tex0000644000000000000000000000007013031036767017160 0ustar 00000000000000 Todo. In between, see files log2-td.\{h,c,mpl,gappa\}. interval-2.1.0/src/crlibm/docs/latex/pow.tex0000644000000000000000000000531313031036767017127 0ustar 00000000000000This chapter is contributed by Ch. Q. Lauter and F. de Dinechin. \section{Work in progress} Here is the status of the current implementation of pow in CRLibm: \begin{itemize} \item Exact and mid-point cases are handled properly \cite{LauterLefevre2007}. This is especially important because an exact case would mean an infinite Ziv iteration. \item Worst cases are not known for the full input range. This is a deep theoretical issue. Recent research has focussed on $x^n$ for integer $n$. At the time of release, it has been proved computationally that that an intermediate precision of $2^{-118}$ is enough to round correctly $x^n$ for all integer $n$ between -180 and +1338. In addition, specific algorithms have been studied for the computation of $x^n$ \cite{KorLauLefLouvMul2008}. \item Due to lack of time, only round-to-nearest is implemented. Directed rounding requires additional work, in particular in subnormal handling and in exact case management. There are more exact cases in directed rounding modes, therefore the performance should also be inferior. \item The current implementation computes two Ziv iterations, to $2^{-61}$ then to $2^{-120}$. With current technology, there is little hope to find all the worst cases for the full range of the power function. Should an input require more than $2^{-120}$ happen (to our knowledge none has been exhibited so far), current implementation will not necessarily return the correctly rounded result. Options are: \begin{itemize} \item Ignore silently the problem (this is the current option). \item perform a second rounding test at the end of the accurate step. If the test fails (with a probability smaller that $2^{-120}$), \begin{itemize} \item an arbitrary precision computation could be launched, for example MPFR. This requires adding a dependency to MPFR only for this highly improbable case. \item launch a high, but not arbitrary precision third step (say, accurate to $2^{-3000}$. Variations of the SLZ algorithm \cite{Stehle-thesis} could provide, at an acceptable computational cost, a certificate that there is no worst case requiring a larger precision. This is the only fully satisfactory solution that seems at reach, but this idea remains to be explored. \item (in addition to the previous) a message on the standard error could be written, including the corresponding inputs, and inviting anyone who reads it to send us a mail. Considering the probability, we might wait several centuries before getting the first mail. \end{itemize} \end{itemize} \end{itemize} %%% Local Variables: %%% mode: latex %%% TeX-master: "crlibm" %%% End: interval-2.1.0/src/crlibm/docs/latex/sqrt.tex0000644000000000000000000003600513031036767017315 0ustar 00000000000000Some of \crlibm's functions need high precision square roots. They are not intended to be used outside \crlibm. In particular, we do currently not guarantee the correct rounding of their results because this property is not needed for our purposes. Their implementation does not handle all possible special cases ($x < 0$, $\nan$, $\infty$ etc.) neither. We currently provide two C macros computing the square root of a double precision argument either in double-double precision with at least $100$ correct bits (in faithful rounding) or in triple-double precision with an accuracy of at least $146$ bits (in faithful rounding). The corresponding macros are called \SqrtD~ and \SqrtT. The implementation of these macros was guided by the following principles: \begin{itemize} \item no dependency on other \texttt{libm}s, so avoidance of bootstrapping a Newton iteration by a double precision square root implemented elsewhere, \item high efficiency, \item a small memory footprint, \item the possible use of hardware support on some platforms in the future. \end{itemize} \subsubsection{Overview of the algorithm} The algorithm uses a combination of polynomial approximation and Newton iteration. After handling some special cases, the argument $x = 2^{E^\prime} \cdot m^\prime$ is reduced into its exponent $E^\prime$ stored in integer and its fractional part $m^\prime$ stored as a double precision number. This argument reduction is obviously exact. The two values are then adjusted as follows: \vspace{-3mm} \begin{center} \begin{tabular}{cc} \begin{minipage}{60mm} $$E = \left \lbrace \begin{array}{ll} E^\prime & \mbox{ if } \exists n \in \N \mbox{ . } E^\prime = 2n\\ E^\prime +1 & \mbox{ otherwise} \end{array} \right.$$ \end{minipage} & \begin{minipage}{60mm} $$m = \left \lbrace \begin{array}{ll} m^\prime & \mbox{ if } \exists n \in \N \mbox{ . } E^\prime = 2n \\ \frac{m^\prime}{2} & \mbox{ otherwise } \end{array} \right.$$ \end{minipage} \end{tabular} \end{center} One easily checks that $\frac{1}{2} \leq m \leq 2$ and that $E$ is always even. Thus $$\sqrt{x} = \sqrt{2^E \cdot m} = 2^{\frac{E}{2}} \cdot \sqrt{m} = 2^{\frac{E}{2}} \cdot m \cdot \frac{1}{\sqrt{m}}$$ The algorithm therefore approximates $\hat{r} = \frac{1}{\sqrt{m}}$ and reconstructs the square root by multiplying by $m$ and exactly by $2^{\frac{E}{2}}$. The reciprocal square root $\hat{r}$ is approximated in two steps. First, a polynomial approximation yields to $r_0 = \hat{r} \cdot \left( 1 + \epsilon_1 \right)$, which is exact to about $8$ bits. In a second step, this approximation is refined by a Newton iteration that approximately doubles its accuracy at each step. So for a double-double result, $4$ iterations are needed and for a triple-double result $5$. The initial polynomial approximation is less exact than the one provided by Itanium's \texttt{} operation, which allows for using this hardware assistance in the future. \subsubsection{Special case handling} The square root of a double precision number can never be subnormal. In fact, if $\sqrt{x} \leq 2^{-1021}$, $x = \sqrt{x}^2 \leq 2^{-1042441}$, a value that is is not representable in double precision. Concerning subnormals in argument, it to be mentioned that still $E^\prime$ and $m^\prime$ can be found such that $x = 2^{E^\prime} \cdot m$ exactly and $1 \leq m^\prime \leq 2$. Only the extraction sequence must be modified: $x$ is first multiplied by $2^{52}$ where $E^\prime$ is set to $-52$. The double number $x$ is thus no longer a subnormal an integer handling can extract its mantissa easily. The extraction of the exponent takes into account the preceeding bias of $E^\prime$. The case $x = 0$ is filtered out before. Obviously $\sqrt{0} = 0$ is returned for this argument. The special cases $x < 0$, $x = \pm \infty$ and $x = \nan$ are not handled since they can be easily excluded by the code using the square root macros. Special case handling is implemented as follows: \begin{lstlisting}[caption={Special case handling},firstnumber=1] /* Special case x = 0 */ if (x == 0) { *resh = x; *resl = 0; } else { E = 0; /* Convert to integer format */ xdb.d = x; /* Handle subnormal case */ if (xdb.i[HI] < 0x00100000) { E = -52; xdb.d *= ((db_number) ((double) SQRTTWO52)).d; /* make x a normal number */ } /* Extract exponent E and mantissa m */ E += (xdb.i[HI]>>20)-1023; xdb.i[HI] = (xdb.i[HI] & 0x000fffff) | 0x3ff00000; m = xdb.d; /* Make exponent even */ if (E & 0x00000001) { E++; m *= 0.5; /* Suppose now 1/2 <= m <= 2 */ } /* Construct sqrt(2^E) = 2^(E/2) */ xdb.i[HI] = (E/2 + 1023) << 20; xdb.i[LO] = 0; \end{lstlisting} \subsubsection{Polynomial approximation} The reciprocal square root $\hat{r} = \frac{1}{\sqrt{m}}$ is approximated in the domain $m \in \left[ \frac{1}{2}; 2 \right]$ by a polynomial $p\left( m \right) = \sum\limits_{i=0}^4 c_i \cdot m^i$ of degree $4$. The polynomial's coefficients $c_0$ through $c_4$ are stored in double precision. The following values are used: \begin{eqnarray*} c_0 & = & 2.50385236695888790947606139525305479764938354492188 \\ c_1 & = & -3.29763389114324168005509818613063544034957885742188 \\ c_2 & = & 2.75726076139124520736345402838196605443954467773438 \\ c_3 & = & -1.15233725777933848632983426796272397041320800781250 \\ c_4 & = & 0.186900066679800969104974228685023263096809387207031 \end{eqnarray*} The relative approximation error $\epsilon_{\mbox{\tiny approx}} = \frac{p\left( m\right) - \hat{r}}{\hat{r}}$ is bounded by $\left \vert \epsilon_{\mbox{\tiny approx}} \right \vert \leq 2^{-8.32}$ for $m \in \left[ \frac{1}{2}; 2 \right]$. The polynomial is evaluated in double precision using Horner's scheme. There may be some cancellation in the different steps but the relative arithmetical error $\epsilon_{\mbox{\tiny arithpoly}}$ is always less in magnitude than $2^{-30}$. This will be shown in more detail below. The code implementing the polynomial approximation reads: \begin{lstlisting}[caption={Polynomial approximation},firstnumber=1] r0 = SQRTPOLYC0 + m * (SQRTPOLYC1 + m * (SQRTPOLYC2 + m * (SQRTPOLYC3 + m * SQRTPOLYC4))); \end{lstlisting} So 4 double precision multiplications and 4 additions are needed for computing the initial approximation. They can be replaced by 4 FMA instructions, if available. \subsubsection{Double and double-double Newton iteration} The polynomial approximation is then refined using the following iteration scheme: $$r_{i+1} = \frac{1}{2} \cdot r_i \cdot (3 - m \cdot r_i^2)$$ If the arithmetic operations were exact, one would obtain the following error estimate: \begin{eqnarray*} \epsilon_{i+1} & = & \frac{r_i - \hat{r}}{\hat{r}} \\ & = & \frac{\frac{1}{2} \cdot r_i \cdot \left(3 - m \cdot r_i^2\right) - \hat{r}}{\hat{r}} \\ & = & \frac{\frac{1}{2} \cdot \hat{r} \cdot \left( 1 + \epsilon_i \right) \cdot \left( 3 - m \cdot \hat{r}^2 \cdot \left( 1 + \epsilon_i \right)^2 \right) - \hat{r}}{\hat{r}} \\ & = & \frac{1}{2} \cdot \left( 1 + \epsilon_i \right) \cdot \left( 3 - m \cdot \frac{1}{m} \cdot \left( 1 + \epsilon_i\right)^2 \right) - 1 \\ & = & \frac{1}{2} \cdot \left( 1 + \epsilon_i \right) \cdot \left( 3 - 1 - 2 \cdot \epsilon_i - \epsilon_i^2 \right) - 1 \\ & = & \left( 1 + \epsilon_i \right) \cdot \left( 1 - \epsilon_i - \frac{1}{2} \cdot \epsilon_i^2 \right) - 1 \\ & = & 1 - \epsilon_i - \frac{1}{2} \cdot \epsilon_i^2 + \epsilon_i - \epsilon_i^2 - \frac{1}{2} \cdot \epsilon_i^3 - 1\\ & = & - \frac{3}{2} \cdot \epsilon_i^2 - \frac{1}{2} \cdot \epsilon_i^3 \end{eqnarray*} So the accuracy of the approximation of the reciprocal square root is doubled at each step. Since the initial accuracy is about $8$ bits, it is possible to iterate two times on pure double precision without any considerable loss of accuracy. After the two iterations about $31$ bits will be correct. The macro implements therefore: \begin{lstlisting}[caption={Newton iteration - double precision steps},firstnumber=1] r1 = 0.5 * r0 * (3 - m * (r0 * r0)); r2 = 0.5 * r1 * (3 - m * (r1 * r1)); \end{lstlisting} For these two iterations, 8 double precision multiplications and 2 additions are needed. The next iteration steps must be performed in double-double precision because the $53$ bit mantissa of a double cannot contain the about $60$ bit exact value $m \cdot r_2^2 \approx 1$ before cancellation in the substraction with $3$ and the multiplication by $r_2$. In order to exploit maximally the parallelism in the iteration equation, we rewrite it as \begin{eqnarray*} r_{3} & = & \frac{1}{2} \cdot r_2 \cdot \left( 3 - m \cdot r_2^2 \right) \\ & = & \left( r_2 + \frac{1}{2} \cdot r_2 \right) - \frac{1}{2} \cdot \left( m \cdot r_2 \right) \cdot \left( r_2 \cdot r_2 \right) \end{eqnarray*} Since multiplications by integer powers of $2$ are exact, it is possible to compute $r_2 + \frac{1}{2} \cdot r_2$ exactly as a double-double. Concurrently it is possible to compute $m \cdot r_2$ and $r_2 \cdot r_2$ exactly as double-doubles by means of an exact multiplication. The multiplication $\left( m \cdot r_2 \right) \cdot \left( r_2 \cdot r_2 \right)$ is then implemented as a double-double multiplication. The multiplication by $\frac{1}{2}$ of the value obtained is exact and can be performed pairwise on the double-double. A final double-double addition leads to $r_3 = \left( r_2 + \frac{1}{2} \cdot r_2 \right) - \frac{1}{2} \cdot \left( m \cdot r_2 \right) \cdot \left( r_2 \cdot r_2 \right)$. Here, massive cancellation is no longer possible since the values added are approximately $\frac{3}{2} \cdot r_2$ and $\frac{1}{2} \cdot r_2$. These steps are implemented as follows: \begin{lstlisting}[caption={Newton iteration - first double-double step},firstnumber=1] Mul12(&r2Sqh, &r2Sql, r2, r2); Add12(r2PHr2h, r2PHr2l, r2, 0.5 * r2); Mul12(&mMr2h, &mMr2l, m, r2); Mul22(&mMr2Ch, &mMr2Cl, mMr2h, mMr2l, r2Sqh, r2Sql); MHmMr2Ch = -0.5 * mMr2Ch; MHmMr2Cl = -0.5 * mMr2Cl; Add22(&r3h, &r3l, r2PHr2h, r2PHr2l, MHmMr2Ch, MHmMr2Cl); \end{lstlisting} The next iteration step provides enough accuracy for a double-double result. We rewrite the basic iteration equation once again as: \begin{eqnarray*} r_4 & = & \frac{1}{2} \cdot r_3 \cdot \left( 3 - m \cdot r_3^2 \right) \\ & = & r_3 \cdot \left( \frac{3}{2} - \frac{1}{2} \cdot m \cdot r_3^2 \right) \\ & = & r_3 \cdot \left( \frac{3}{2} - \frac{1}{2} \cdot \left( \left( m \cdot r_3^2 - 1 \right) + 1 \right) \right) \\ & = & r_3 \cdot \left( 1 - \frac{1}{2} \cdot \left( m \cdot r_3^2 - 1 \right) \right) \end{eqnarray*} Further, we know that $r_3$, stored as a double-double, verifies $r_3 = \hat{r} \cdot \left( 1 + \epsilon_3 \right)$ with $\left \vert \epsilon_3 \right \vert \leq 2^{-60}$. So we check that $$m \cdot r_3^2 = m \cdot \hat{r}^2 \cdot \left( 1 + \epsilon_3 \right)^2 = 1 + 2 \cdot \epsilon_3 + \epsilon_3^2$$ Clearly, $\left \vert 2 \cdot \epsilon_3 + \epsilon_3^2 \right \vert < \frac{1}{2} \mUlp\left( 1 \right)$. So when squaring $r_{3\hi} + r_{3\lo}$ in double-double precision and multiplying it in double-double precision by $m$ produces a double-double $mMr3Sq_\hi + mMr3Sq_\lo = m \cdot \left( r_{3\hi} + r_{3\lo} \right)^2 \cdot \left( 1 + \epsilon \right)$, $\left \vert \epsilon \right \vert \leq 2^{-100}$ such that $mMr3Sq_\hi = 1$ in all cases. So we can implement the iteration equation $$r_4 = r_3 \cdot \left( 1 - \frac{1}{2} \cdot \left( m \cdot r_3^2 - 1 \right) \right)$$ as follows: \begin{lstlisting}[caption={Newton iteration - second double-double step},firstnumber=1] Mul22(&r3Sqh, &r3Sql, r3h, r3l, r3h, r3l); Mul22(&mMr3Sqh, &mMr3Sql, m, 0, r3Sqh, r3Sql); Mul22(&r4h, &r4l, r3h, r3l, 1, -0.5 * mMr3Sql); \end{lstlisting} We since get $r_{4\hi} + r_{4\lo} = \hat{r} \cdot \left( 1 + \epsilon_4 \right)$ with $\left \vert \epsilon_4 \right \vert \leq 2^{-102}$, the accuracy being limited by the accuracy of the last double-double multiplication operator. This approximation is than multiplied by $m$ in double-double precision, leading to an approximation $srtm_\hi + srtm_\lo = \sqrt{m} \cdot \left( 1 + \epsilon \right)$ with $\left \vert \epsilon \right \vert \leq 2^{-100}$. Out of this value, the square root of the initial argument can be reconstructed by multiplying by $2^{\frac{E}{2}}$, which has already been stored in $xdb.d$. This multiplication is exact because it cannot produce a subnormal. These two steps are implemented as shown below: \begin{lstlisting}[caption={Multiplication $m \cdot \hat{r}$, reconstruction},firstnumber=1] Mul22(&srtmh,&srtml,m,0,r4h,r4l); /* Multiply componentwise by sqrt(2^E), which is an integer power of 2 that may not produce a subnormal */ *resh = xdb.d * srtmh; *resl = xdb.d * srtml; \end{lstlisting} \subsubsection{Triple-double Newton iteration} For producing a triple-double approximate to $\hat{r}$ with an accuracy of at least $147$ bits, one more Newton iteration is needed. We apply the same equation as in the last double-double step, which reads: $$r_5 = r_4 \cdot \left( 1 - \frac{1}{2} \cdot \left( m \cdot r_4^2 - 1 \right) \right)$$ Once again, the first component of the triple-double number holding an approximation to $m \cdot r_4^2$ is exactly equal to $1$. So by neglecting this component, we substract $1$ from it. Unfortunately, a renormalization step is needed after the multiplications for squaring $r_4$ and by $m$ because the values computed might be overlapped which would prevent us form substracting $1$ by neglecting a component. We implement thus: \begin{lstlisting}[caption={Newton iteration - triple-double step},firstnumber=1] Mul23(&r4Sqh, &r4Sqm, &r4Sql, r4h, r4l, r4h, r4l); Mul133(&mMr4Sqhover, &mMr4Sqmover, &mMr4Sqlover, m, r4Sqh, r4Sqm, r4Sql); Renormalize3(&mMr4Sqh, &mMr4Sqm, &mMr4Sql, mMr4Sqhover, mMr4Sqmover, mMr4Sqlover); HmMr4Sqm = -0.5 * mMr4Sqm; HmMr4Sql = -0.5 * mMr4Sql; Mul233(&r5h,&r5m,&r5l,r4h,r4l,1,HmMr4Sqm,HmMr4Sql); \end{lstlisting} This approximation $r_{5\hi} + r_{5\mi} + r_{5\lo} = \hat{r} \cdot \left( 1 + \epsilon_5 \right)$, where $\left \vert \epsilon_5 \right \vert \leq 2^{-147}$ is then multiplied by $m$ in order to obtain a triple-double approximation of $\sqrt{m}$. Once renormalized result is exactly multiplied by $2^{\frac{E}{2}}$ stored in $xdb.d$. We implement: \begin{lstlisting}[caption={Newton iteration - triple-double step},firstnumber=1] Mul133(&srtmhover, &srtmmover, &srtmlover,m,r5h,r5m,r5l); Renormalize3(&srtmh,&srtmm,&srtml,srtmhover,srtmmover,srtmlover); (*(resh)) = xdb.d * srtmh; (*(resm)) = xdb.d * srtmm; (*(resl)) = xdb.d * srtml; \end{lstlisting} \subsubsection{Accuracy bounds} TODO: see possibly available Gappa files meanwhile interval-2.1.0/src/crlibm/docs/latex/trigo.tex0000644000000000000000000017365313031036767017463 0ustar 00000000000000This chapter is contributed by F. de~Dinechin with assistance of C. Daramy-Loirat and D. Defour. \section*{Introduction} This chapter describes the implementations of sine, cosine and tangent, as they share much of their code. The proof sketch below is supported by the Maple script \texttt{maple/trigo.mpl} and the Gappa scripts \texttt{gappa/trigoSinCosCase3.gappa} and \texttt{gappa/trigoTanCase2.gappa} of the \crlibm\ distribution. These scripts implement the computations of error bounds and validity bounds for the various algorithmic paths described here. \section{Overview of the algorithms} \subsection{Exceptional cases} The three trigonometric functions return NaN for infinite and NaN arguments, and are defined otherwise. An argument based on continued fractions to find the worst cases for range reduction may also be used to show that the sine and cosine of a floating-point number outside of $[-1,1]$ is always larger than $2^{-150}$, and therefore never flushes to zero nor to subnormal (see \cite{Muller97} p. 151 and following). Therefore $\tan(x)=\sin(x)/\cos(x)$ also remains larger than $2^{-150}$. This has two important consequences: \begin{itemize} \item as the output a trigonometric function is never a subnormal except for inputs around zero (for which the value to return is trivial anyway), we can safely use the rounding tests from Section \ref{section:testrounding} p.~\pageref{section:testrounding}. \item as the cosine never flushes to zero, the tangent of a floating-point number is never an infinity, and does not even come close, so again we may safely use the rounding tests from Section \ref{section:testrounding}. \end{itemize} For very small arguments, \begin{itemize} \item $\sin(x) = x-x^3/6 + O(x^5) = x(1-x^2/6) + O(x^5)$ where $O(x^5)$ has the sign of $x$. Therefore $\sin(x)$ is rounded to $x$ or one of its floating-point neighbours as soon as $|x|<2^{-26}$. \item $\cos(x) = 1-x^2/2 + O(x^4)$ where $O(x^4)$ is positive. Therefore $\cos(x)$ is rounded to $1$ in RN and RU mode if $x<\sqrt{2^{-53}}$. In RD and RZ modes, we have $\cos(0)=1$ and $\cos(x)=1-2^{-53}$ for $|x|<2^{-26}$. \item $\tan(x) = x+x^3/3 + O(x^5) = x(1+x^2/3) + O(x^5)$ where $O(x^5)$ has the sign of $x$. Therefore $\tan(x)$ is rounded to $x$ or one of its neighbours for all the rounding modes if $|x|<2^{-27}$. \end{itemize} \subsection{Range reduction} Most implementations of the trigonometric functions have two steps of range reduction: \begin{itemize} \item first the input number $x$ is reduced to $y\in [-\frac{\pi}{4}, \frac{\pi}{4}]$, with reconstruction using periodicity and symmetry properties, \item then the reduced argument is further broken down as $y=a+z$, with reconstruction using the formula for $\sin(a+z)$ and $\cos(a+z)$, using tabulated values of $\sin(a)$ and $\cos(a)$ \end{itemize} We chose to implement range reduction in one step only, which computes an integer $k$ and a reduced argument y such that \begin{equation} x = k\frac{\pi}{256} + y\label{eq:trigoargred} \end{equation} where $k$ is an integer and $ |y| \leq {\pi}/{512}$. This step computes $y$ as a double-double: $y\approx y_h+y_l$. In the following we note $$a=k\pi/256.$$ Then we read off a table $$sa_h+sa_l \approx sin(a)$$ $$ca_h+ca_l \approx cos(a)$$ Only 64 quadruples $(sa_h,sa_l,ca_h,ca_l)$ are tabulated (amounting to $64\times 8 \times 4 = 2048$ bytes), the rest is obtained by periodicity and symmetry, implemented as masks and integer operations on the integer $k$. For instance, $a \mod 2\pi$ is implemented by $k \mod 512$, $\pi/2-a$ is implemented as $128-k$, etc. Then we use the reconstruction steps: \begin{equation} \sin(x) = \sin(a + y) = \cos(a) \sin(y) + \sin(a) \cos(y) \label{eq:sinapy} \end{equation} \begin{equation} \cos(x) = \cos(a + y) = \cos(a) \cos(y) - \sin(a) \sin(y) \label{eq:cosapy} \end{equation} \begin{equation} tan(x) = \frac{\sin(x)}{\cos(x)} \label{eq:tanapy} \end{equation} \subsection{Polynomial evaluation} To implement the previous equations, $\cos(y)$ and $\sin(y)$ are computed as unevaluated $1+t_c$ and $(y_h+y_l)(1+t_s)$ respectively, where $t_c$ and $t_s$ are doubles computed using a polynomial approximation of small degree: \begin{itemize} \item $t_s = y^2(s_3 + y^2(s_5 + y^2s_7)))$ with $s3$, $s5$ and $s7$ the Taylor coefficients. \item $t_c = y^2(c_2 + y^2(c_4 + y^2c_6))$ with $c2$, $c4$ and $c6$ the Taylor coefficients (or a more accurate minimax approximation). \end{itemize} \subsection{Reconstruction} \subsubsection{Sine} According to equation (\ref{eq:sinapy}), we have to compute: \begin{eqnarray*} \sin(a+y) &=& \sin(a) \cos(y) + \cos(a)\sin(y) \\ & \approx& (sa_h+sa_l)(1+t_c) + (ca_h+ca_l)(y_h+y_l)(1+t_s) \end{eqnarray*} Figure~\ref{fig:sine-reconstruction} shows the worst-case respective orders of magnitude of the terms of this sum. The terms completely to the right of the vertical bar will be neglected, and a bound on the error thus entailed is computed in the following. Note that the term $ca_hy_h$ has to be computed exactly by a Mul12. Finally the reconstruction consists of adding together the lower-order terms in increasing order of magnitude, and computing the double-double result by an Add12. \begin{figure}[htbp] \begin{center} \small \setlength{\unitlength}{3ex} \framebox{ \begin{picture}(22,9)(-3,-4.2) \put(9.5,4){\line(0,-1){8}} %\put(9,4){$\epsilon$} \put(4,3.2){$sa_h$} \put(0.05,3){\framebox(7.9,0.7){}} \put(12,3.2){$sa_l$} \put(8.05,3){\framebox(7.9,0.7){}} \put(6,2.2){$sa_ht_c$} \put(2.05,2){\framebox(7.9,0.7){}} \put(14,2.2){$sa_lt_c$} \put(10.05,2){\framebox(7.9,0.7){}} \put(4.5,1.2){$ca_hy_h$} \put(0.55,1){\framebox(7.9,0.7){}} \put(12.5,1.2){$ca_hy_h$} \put(8.55,1){\framebox(7.9,0.7){}} \put(11.5,0.2){$ca_hy_l $} \put(7.55,0){\framebox(7.9,0.7){}} \put(11.5,-0.8){$ca_ly_h $} \put(7.55,-1){\framebox(7.9,0.7){}} \put(6.5,-1.8){$ca_hy_ht_s$} \put(2.55,-2){\framebox(7.9,0.7){}} \put(13.5,-2.8){$ca_hy_lt_s $} \put(9.55,-3){\framebox(7.9,0.7){}} \put(13.5,-3.8){$ca_ly_ht_s $} \put(9.55,-4){\framebox(7.9,0.7){}} \end{picture} } \end{center} \caption{The sine reconstruction} \label{fig:sine-reconstruction} \end{figure} \subsubsection{Cosine} According to equation (\ref{eq:cosapy}), we have to compute in double-double precision: \begin{eqnarray*} \cos(a+y) &=& \cos(a) \cos(y) - \sin(a)\sin(y) \\ & \approx& (ca_h+ca_l)(1+t_c) - (sa_h+sa_l)(y_h+y_l)(1+t_s) \end{eqnarray*} This is similar to the case of the sine, and the respective orders of magnitude are given by Figure~\ref{fig:sine-reconstruction}. \begin{figure}[htbp] \begin{center} \small \setlength{\unitlength}{3ex} \framebox{ \begin{picture}(22,9)(-3,-4.2) \put(9.5,4){\line(0,-1){8}} % \put(9,4){$\epsilon$} \put(4,3.2){$ca_h$} \put(0.05,3){\framebox(7.9,0.7){}} \put(12,3.2){$ca_l$} \put(8.05,3){\framebox(7.9,0.7){}} \put(6,2.2){$ca_ht_c$} \put(2.05,2){\framebox(7.9,0.7){}} \put(14,2.2){$ca_lt_c$} \put(10.05,2){\framebox(7.9,0.7){}} \put(4.5,1.2){$-sa_hy_h$} \put(0.55,1){\framebox(7.9,0.7){}} \put(12.5,1.2){$-sa_hy_h$} \put(8.55,1){\framebox(7.9,0.7){}} \put(11.5,0.2){$-sa_hy_l $} \put(7.55,0){\framebox(7.9,0.7){}} \put(11.5,-0.8){$-sa_ly_h $} \put(7.55,-1){\framebox(7.9,0.7){}} \put(6.5,-1.8){$-sa_hy_ht_s$} \put(2.55,-2){\framebox(7.9,0.7){}} \put(13.5,-2.8){$-sa_hy_lt_s $} \put(9.55,-3){\framebox(7.9,0.7){}} \put(13.5,-3.8){$-sa_ly_ht_s $} \put(9.55,-4){\framebox(7.9,0.7){}} \end{picture} } \end{center}\centering \caption{The cosine reconstruction} \label{fig:cosine-reconstruction} \end{figure} \subsubsection{Tangent} The tangent is obtained by the division of the sine by the cosine, using the \texttt{Div22} procedure which is accurate to $2^{-104}$. \subsection{Precision of this scheme} As we have $|y|<2^{-7}$, this scheme computes these functions accurately to roughly $2^{53+13}$ bits, so these first steps are very accurate. \subsection{Organisation of the code} The code for range reduction is shared by the three trigonometric functions. It is detailed and proven in Section~\ref{trigo:argred}. Then there are four procedures (currently implemented as macros for efficiency), respectively called \texttt{DoSinZero}, \texttt{DoCosZero}, \texttt{DoSinNotZero} and \texttt{DoCosNotZero} which do the actual computation after range reduction as per Figures~\ref{fig:sine-reconstruction} and \ref{fig:cosine-reconstruction}. The tangent function is computed by dividing the sine by the cosine. These procedures are studied in section \ref{trigo:auxiliary}. Finally, each of the three trigonometric functions comes in four variants for the four rounding modes. These four variants differ in the beginning (special cases) and in the end (rounding), but share the bulk of the computation. The shared computation is called \verb!compute_trig_with_argred!. \section{Details of range reduction \label{trigo:argred}} \subsection{Which accuracy do we need for range reduction?} The additive reduction consists in adding or removing $N$ times a certain constant $C$ from the input argument. For trigonometric function this constant is usually equal to $\pi/2$ or $\pi/4$, in our case it is $\pi/128$. A naive range reduction based on machine precision for trigonometric function would be implemented as : \begin{equation} \begin{array}{rcl} k &=& \lfloor \frac{x}{C} \rfloor \\ x^* &=& x-kC. \\ \end{array} \label{chap6:eqn:rangereduction} \end{equation} Obviously, this subtraction cancels all the bits common to $x$ and $kC$: \begin{itemize} \item The absolute accuracy of $x^*$ with respect to the exact value of $x-kC$ depends only on the precision used to compute the subtraction and the product in $x-kC$ ($x$ is considered exact as it is the input to the function). \item However, the relative accuracy of $x^*$ with respect to the exact value of $x-kC$ also depends on this exact value. For a given precision of the operations used in computing $x-kC$, the closer $x$ to $kC$, the smaller the exact value of $x-kC$, and the worse the relative accuracy (or, in less formal terms, the more bits of the results are lost to cancellation). \end{itemize} As the theorems for correct rounding of Section~\ref{section:testrounding} p.~\pageref{section:testrounding} depend on the relative accuracy of the evaluation (and therefore on the relative accuracy of the reduced argument), we have to prove bounds on the relative accuracy of range reduction. Formulated in simpler terms, how many bits can be lost in the subtraction $x-kC$ ? This number is related to the knowledge of the closest input number $x$ to a multiple of $C$. There exists an algorithm due to Kahan/Douglas and based on continued fraction to compute this number and therefore the number of bit lost (see \cite{Muller97} p. 151 and following). We used a Maple version from \cite{Muller97} to determine than up to 62 bits may be cancelled during range reduction for a ieee double precision number. This Maple procedure is implemented as function \texttt{WorstCaseForAdditiveRangeReduction} in \texttt{maple/common-procedures.mpl}. One advantage of having $C=\pi/128$, however, is that this is only a concern when $x$ is close to a multiple of $\pi/2$ (that is, $k \mod 128=0$): in the other cases (i.e. in the general, most frequent case) the reconstruction will add some tabulated non-zero value, so the error to consider in the range reduction is the absolute error. Only in the cases when $k \mod 128=0$ do we need to have 62 extra bits to compute with. This is ensured by using a slower, more accurate range reduction. As a compensation, in this case when $k \mod 128=0$, there is no table to read and no reconstruction to perform: a simple polynomial approximation to the function suffices. \subsection{Details of the used scheme} We have 4 possible range reductions, depending on the magnitude of the input number (and the previous considerations): \begin{itemize} \item Cody and Waite with 2 constants (the fastest), \item Cody and Waite with 3 constants (almost as fast), \item Cody and Waite with 3 constants in double-double and $k$ a 64-bit int, and \item Payne and Hanek, implemented in SCS (the slowest). \end{itemize} Each of these range reductions except Payne and Hanek is valid for $x$ smaller than some bound. The computation of these bounds is detailed below. Section \ref{trigo:structargred} details the organization of this multi-level range reduction, and is followed by a detailed proof of each level. \subsection{Structure of the range reduction \label{trigo:structargred}} The complete code is detailed below. To provide a complete picture to the reader it actually also includes the reconstruction. \begin{lstlisting}[caption={Multilevel range reduction \label{lst:trig:argred}},firstnumber=1] struct rrinfo_s {double rh; double rl; double x; int absxhi; int function;} ; typedef struct rrinfo_s rrinfo; #define changesign function /* saves one int in the rrinfo structure */ static void ComputeTrigWithArgred(rrinfo *rri){ double sah,sal,cah,cal, yh, yl, yh2, ts,tc, kd; double kch_h,kch_l, kcm_h,kcm_l, th, tl,sh,sl,ch,cl; int k, quadrant, index; long long int kl; if (rri->absxhi < XMAX_CODY_WAITE_3) { /* Compute k, deduce the table index and the quadrant */ DOUBLE2INT(k, rri->x * INV_PIO256); kd = (double) k; quadrant = (k>>7)&3; index=(k&127)<<2; if((index == 0)) { /* Here a large cancellation on yh+yl would be a problem, so use double-double RR */ /* all this is exact */ Mul12(&kch_h, &kch_l, kd, RR_DD_MCH); Mul12(&kcm_h, &kcm_l, kd, RR_DD_MCM); Add12 (th,tl, kch_l, kcm_h) ; /* only rounding error in the last multiplication and addition */ Add22 (&yh, &yl, (rri->x + kch_h) , (kcm_l - kd*RR_DD_CL), th, tl) ; goto computeZero; } else { /* index <> 0, don't worry about cancellations on yh+yl */ if (rri->absxhi < XMAX_CODY_WAITE_2) { /* CW 2: all this is exact but the rightmost multiplication */ Add12 (yh,yl, (rri->x - kd*RR_CW2_CH), (kd*RR_CW2_MCL) ) ; } else { /* CW 3: all this is exact but the rightmost multiplication */ Add12Cond(yh,yl, (rri->x - kd*RR_CW3_CH) - kd*RR_CW3_CM, kd*RR_CW3_MCL); } } goto computeNotZero; } else if ( rri->absxhi < XMAX_DDRR ) { /* x sufficiently small for a Cody and Waite in double-double */ DOUBLE2LONGINT(kl, rri->x*INV_PIO256); kd=(double)kl; quadrant = (kl>>7)&3; index=(kl&127)<<2; if(index == 0) { /* Here again a large cancellation on yh+yl would be a problem, so we do the accurate range reduction */ RangeReductionSCS(); /*recomputes k, index, quadrant, and yh and yl*/ /* Now it may happen that the new k differs by 1 of kl, so check that */ if(index==0) /* no surprise */ goto computeZero; else goto computeNotZero; } else { /* index<>0 : double-double range reduction*/ /* all this is exact */ Mul12(&kch_h, &kch_l, kd, RR_DD_MCH); Mul12(&kcm_h, &kcm_l, kd, RR_DD_MCM); Add12 (th,tl, kch_l, kcm_h) ; /* only rounding error in the last multiplication and addition */ Add22 (&yh, &yl, (rri->x + kch_h) , (kcm_l - kd*RR_DD_CL), th, tl) ; goto computeNotZero; } } /* closes if ( absxhi < XMAX_DDRR ) */ else { /* Worst case : x very large, sin(x) probably meaningless, we return correct rounding but do't mind taking time for it */ RangeReductionSCS(); quadrant = (k>>7)&3; if(index == 0) goto computeZero; else goto computeNotZero; } computeZero: switch(rri->function) { case SIN: if (quadrant&1) DoCosZero(&rri->rh, &rri->rl); else DoSinZero(&rri->rh, &rri->rl); rri->changesign=(quadrant==2)||(quadrant==3); return; case COS: if (quadrant&1) DoSinZero(&rri->rh, &rri->rl); else DoCosZero(&rri->rh, &rri->rl); rri->changesign= (quadrant==1)||(quadrant==2); return; case TAN: rri->changesign = quadrant&1; if (quadrant&1) { DoSinZero(&ch, &cl); DoCosZero(&sh, &sl); } else { DoSinZero(&sh, &sl); DoCosZero(&ch, &cl); } Div22(&rri->rh, &rri->rl, sh, sl, ch, cl); return; } computeNotZero: if(index<=(64<<2)) { sah=sincosTable[index+0].d; /* sin(a), high part */ sal=sincosTable[index+1].d; /* sin(a), low part */ cah=sincosTable[index+2].d; /* cos(a), high part */ cal=sincosTable[index+3].d; /* cos(a), low part */ }else { /* cah <= sah */ index=(128<<2) - index; cah=sincosTable[index+0].d; /* cos(a), high part */ cal=sincosTable[index+1].d; /* cos(a), low part */ sah=sincosTable[index+2].d; /* sin(a), high part */ sal=sincosTable[index+3].d; /* sin(a), low part */ } yh2 = yh*yh ; ts = yh2 * (s3.d + yh2*(s5.d + yh2*s7.d)); tc = yh2 * (c2.d + yh2*(c4.d + yh2*c6.d )); switch(rri->function) { case SIN: if (quadrant&1) DoCosNotZero(&rri->rh, &rri->rl); else DoSinNotZero(&rri->rh, &rri->rl); rri->changesign=(quadrant==2)||(quadrant==3); return; case COS: if (quadrant&1) DoSinNotZero(&rri->rh, &rri->rl); else DoCosNotZero(&rri->rh, &rri->rl); rri->changesign=(quadrant==1)||(quadrant==2); return; case TAN: rri->changesign = quadrant&1; if (quadrant&1) { DoSinNotZero(&ch, &cl); DoCosNotZero(&sh, &sl); } else { DoSinNotZero(&sh, &sl); DoCosNotZero(&ch, &cl); } Div22(&rri->rh, &rri->rl, sh, sl, ch, cl); return; } } \end{lstlisting} Here are some comments on the structure of this code (the details on actual range reduction come in the following sections). \begin{itemize} \item The DOUBLETOINT macro at line 13 is called only if $x<\verb!XMAX_CODY_WAITE_3!$ (line 11). This constant is defined (see Listing~\ref{trigo:lst:cw3maple} below) such that the conditions for this macro to work (see Section~\ref{sec:double2int}) are fullfilled. \item Similarly for the DOUBLETOLONGINT macro (see Section~\ref{sec:double2longint}) at line 43, which is called for inputs smaller than \verb!XMAX_DDR! defined in Listing \ref{trigo:lst:cwddrmaple} below. \item There is one subtlety at lines 51 and following. There we take the decision of computing a more accurate range reduction depending on the value of $\mathit{index}=k\mod 256$. However, in the case when $x\times\frac{256}{\pi}$ is very close to the middle between two integers, it may happen (very rarely) that the value of $k\mod 256$ computed by this second range reduction differs from the first by $\pm 1$. In such cases, both values will provide different but equally valid reduced arguments, but we have to ensure that $k$ and the reduced value match, hence the test line 52. \end{itemize} \subsection{Cody and Waite range reduction with two constants} Here we split $C$ into two floating-point constants $C_h$ and $C_l$ such that $C_h$ holds 21 bits of the mantissa of $C$ (the rest being zeroes), and $C_l=\round(C-C_h)$. The following gives the Maple code that computes these constants, and then computes the bound on which this range reduction is valid. \begin{lstlisting}[caption={Maple script for computing constants for Cody and Waite 2}, firstnumber=1, language={sh}, numbers=none]% of course it's maple %Skip a line here, I don't know why, otherwise latex eats the first line bitsCh_0:=32: # ensures at least 53+11 bits # 1/2 <= C/2^(expC+1) <1 Ch:= round(evalf( C * 2^(bitsCh_0-expC-1))) / (2^(bitsCh_0-expC-1)): # recompute bitsCh in case we are lucky (and we are for bitsCh_0=32) bitsCh:=1+log2(op(2,ieeedouble(Ch)[3])) : # this means the log of the denominator Cl:=nearest(C - Ch): # Cody and Waite range reduction will work for |k| 2^(-67); # In these cases we use the double-double range reduction, for |k|=0x7ff00000) return x-x; else if (absxhi < XMAX_SIN_CASE2){ /* CASE 1 : x small enough sin(x)=x */ if (absxhi =0x7ff00000) return x-x; if (absxhi < XMAX_SIN_CASE2){ /* CASE 1 : x small enough, return x suitably rounded */ if (absxhi =0.) return x; else { x_split.l --; return x_split.d; } } \end{lstlisting} \subsection{Exceptional cases in RD mode} \begin{lstlisting}[caption={Exceptional cases for sine RD},firstnumber=1] /* SPECIAL CASES: x=(Nan, Inf) sin(x)=Nan */ if (absxhi>=0x7ff00000) return x-x; if (absxhi < XMAX_SIN_CASE2){ /* CASE 1 : x small enough, return x suitably rounded */ if (absxhi =0x7ff00000) return x-x; if (absxhi < XMAX_SIN_CASE2){ /* CASE 1 : x small enough, return x suitably rounded */ if (absxhi =0x7ff00000) { /* was : return x-x; but it's optimized out by Intel compiler (bug reported). Who cares to be slow in this case anyway... */ x_split.l=0xfff8000000000000LL; return x_split.d-x_split.d; } if (rri.absxhi < XMAX_COS_CASE2){ /* CASE 1 : x small enough cos(x)=1. */ if (rri.absxhi =0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_COS_CASE2){ /* CASE 1 : x small enough cos(x)=1. */ if (rri.absxhi =0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_COS_CASE2){ if (x==0) return 1; /* CASE 1 : x small enough cos(x)=1. */ if (rri.absxhi =0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_COS_CASE2){ if (x==0) return 1; /* CASE 1 : x small enough cos(x)=1. */ if (rri.absxhi =0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_TAN_CASE2){ if (rri.absxhi < XMAX_RETURN_X_FOR_TAN) return x; /* Dynamic computation of the rounding constant */ rndcst.i[HI] = 0x3ff00000 + (((rri.absxhi & 0x000fffff)+0x00100000) >> (0x3ff+2 - (rri.absxhi>>20))) ; rndcst.i[LO] =0xffffffff; /* Fast Taylor series */ x2 = x*x; p5 = t5.d + x2*(t7.d + x2*(t9.d + x2*t11.d)); tt = x2*(t3h.d + (t3l.d +x2*p5)); Add12(rri.rh, rri.rl, x, x*tt); /* Test if round to nearest achieved */ if(rri.rh == (rri.rh + (rri.rl * rndcst.d))) return rri.rh; else return scs_tan_rn(x); } else { /* Otherwise : Range reduction then standard evaluation */ rri.x=x; rri.function=TAN; ComputeTrigWithArgred(&rri); /* Test if round to nearest achieved */ if(rri.rh == (rri.rh + (rri.rl * RN_CST_TAN_CASE3))) if(rri.changesign) return -rri.rh; else return rri.rh; else return scs_tan_rn(x); } } \end{lstlisting} There is a peculiarity in lines 19 and 20: We compute the rounding constant dynamically, out of the value of $x$. The idea here is that in the neighborhood of zero, both $tan$ and its approximation are equivalent to $x$ with no order-2 term, therefore the relative error $\maxeps$ is equivalent to $x^2$ and therefore $\maxeps/x$ will vanish as $x\rightarrow 0$ (of course, in the presence of rounding error this has to be proven more rigorously - we will use Gappa below). As the error constant is computed out of $\maxeps$ (see Theorem~\ref{th:roundingRN1} page~\pageref{th:roundingRN1}), for $x$ sufficiently small we can compute $e$ out of $x$ and get a finer rounding constant, hence a lower probability of going through the accurate phase. The lines 19-20 implement $$\mathtt{rndcst} \approx 1 + 2^{-2}|x|$$ with $$\mathtt{rndcst} \ge 1 + 2^{-2}|x|$$ ensured by line 20. To prove that that this rounding constant is correct, we just have to check that it fulills the requirements of Theorem \ref{th:roundingRN1}. Let us note $\maxeps_{TanCase2}$ simply $\maxeps$ in this section. First, we compute in Gappa (file\\ \texttt{maple/trigoTanCase2.gappa} below), using the same constants (produced by the same Maple) as in the C code, a bound $M$ on $\dfrac{\maxeps}{|x|}$. We find that, for $x<2^{-4}$, we have $$\maxeps_{TanCase2} < 2^{-60.9} $$ (hence the $k$ of Theorem \ref{th:roundingRN1} may be chosen as $k=7$) and $$\dfrac{\maxeps}{|x|} < M=2^{-56.5} .$$ Or, $$|x| > \maxeps/M$$ Therefore, $$\mathtt{rndcst} > 1 + 2^{-2}/M\maxeps$$. It is now trivial to check that $2^{-2}/M > \dfrac{2^{54}}{(1-2^{-7})(1-2^{-53})}$, therefore for any $x$ the value of $\mathtt{rndcst}$ thus computed allows to determine correct rounding according to Theorem \ref{th:roundingRN1}. Note that the computation of the rounding constant, although complex, is performed in integer arithmetic and independently of the evaluation of the polynomial. Therefore both computations may be carried out in parallel in a superscalar processor. The input to Gappa is as follows. Note that it needs a bound on $\dfrac{p(x)-\tan(x)}{x \tan(x)}$ which has been computed as an infinite norm in Maple. \lstinputlisting[caption={Gappa input file to prove the previous bounds on $\maxeps_{TanCase2}$ and $\maxeps_{TanCase2}/x$}, language={sh}, numbers=none]{../../gappa/trigos/TanCase2.gappa} \subsection{RU mode} \begin{lstlisting}[caption={Exceptional cases for tangent RU},firstnumber=1] double tan_ru(double x){ double epsilon, p5, tt, x2; db_number x_split; rrinfo rri; x_split.d=x; rri.absxhi = x_split.i[HI] & 0x7fffffff; /* SPECIAL CASES: x=(Nan, Inf) cos(x)=Nan */ if (rri.absxhi>=0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_TAN_CASE2){ if (rri.absxhi < XMAX_RETURN_X_FOR_TAN) { if(x<=0.) return x; else { x_split.l ++; return x_split.d; } } else { /* Fast Taylor series */ x2 = x*x; p5 = t5.d + x2*(t7.d + x2*(t9.d + x2*t11.d)); tt = x2*(t3h.d + (t3l.d +x2*p5)); Add12(rri.rh, rri.rl, x, x*tt); /* TODO dynamic computation of error constant */ TEST_AND_RETURN_RU(rri.rh, rri.rl, EPS_TAN_CASE2); /* if the previous block didn't return a value, launch accurate phase */ return scs_tan_ru(x); } } else { /* Normal case: Range reduction then standard evaluation */ rri.x=x; rri.function=TAN; ComputeTrigWithArgred(&rri); epsilon=EPS_TAN_CASE3; if(rri.changesign) { rri.rh= -rri.rh; rri.rl=-rri.rl; } } TEST_AND_RETURN_RU(rri.rh, rri.rl, epsilon); /* if the previous block didn't return a value, launch accurate phase */ return scs_tan_ru(x); } \end{lstlisting} \subsection{RD mode} \begin{lstlisting}[caption={Exceptional cases for tangent RD},firstnumber=1] double tan_rd(double x){ double epsilon, p5, tt, x2; rrinfo rri; db_number x_split; x_split.d=x; rri.absxhi = x_split.i[HI] & 0x7fffffff; /* SPECIAL CASES: x=(Nan, Inf) cos(x)=Nan */ if (rri.absxhi>=0x7ff00000){ x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_TAN_CASE2){ if (rri.absxhi < XMAX_RETURN_X_FOR_TAN) { if(x>=0.) return x; else { x_split.l ++; return x_split.d; } } /* Fast Taylor series */ x2 = x*x; p5 = t5.d + x2*(t7.d + x2*(t9.d + x2*t11.d)); tt = x2*(t3h.d + (t3l.d +x2*p5)); Add12(rri.rh, rri.rl, x, x*tt); TEST_AND_RETURN_RD(rri.rh, rri.rl, EPS_TAN_CASE2); /* if the previous block didn't return a value, launch accurate phase */ return scs_tan_rd(x); } else { /* normal case: Range reduction then standard evaluation */ rri.x=x; rri.function=TAN; ComputeTrigWithArgred(&rri); epsilon=EPS_TAN_CASE3; if(rri.changesign) { rri.rh= -rri.rh; rri.rl=-rri.rl; } } TEST_AND_RETURN_RD(rri.rh, rri.rl, epsilon); /* if the previous block didn't return a value, launch accurate phase */ return scs_tan_rd(x); } \end{lstlisting} \subsection{RZ mode} \begin{lstlisting}[caption={Exceptional cases for tangent RZ},firstnumber=1] double tan_rz(double x){ double epsilon, p5, tt, x2; rrinfo rri; db_number x_split; x_split.d=x; rri.absxhi = x_split.i[HI] & 0x7fffffff; /* SPECIAL CASES: x=(Nan, Inf) cos(x)=Nan */ if (rri.absxhi>=0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_TAN_CASE2){ if (rri.absxhi < XMAX_RETURN_X_FOR_TAN) { return x; } else{ /* Fast Taylor series */ x2 = x*x; p5 = t5.d + x2*(t7.d + x2*(t9.d + x2*t11.d)); tt = x2*(t3h.d + (t3l.d +x2*p5)); Add12(rri.rh, rri.rl, x, x*tt); TEST_AND_RETURN_RZ(rri.rh, rri.rl, EPS_TAN_CASE2); /* if the TEST_AND_RETURN block didn't return a value, launch accurate phase */ return scs_tan_rz(x); } } else { /* Normal case: Range reduction then standard evaluation */ rri.x=x; rri.function=TAN; ComputeTrigWithArgred(&rri); epsilon=EPS_TAN_CASE3; if(rri.changesign) { rri.rh = -rri.rh; rri.rl = -rri.rl; } } TEST_AND_RETURN_RZ(rri.rh, rri.rl, epsilon); /* if the previous block didn't return a value, launch accurate phase */ return scs_tan_rz(x); } \end{lstlisting} \section{Accurate phase} For simplicity, the accurate phase (in file \texttt{trigo\_accurate.c}) always computes a Payne and Hanek range reduction to $[-\pi/4, \pi/4]$, then a polynomial evaluation using a Taylor formula. The results of the search for worst cases are the following so far: \begin{center} \begin{tabular}{|c|c|c|} \hline Function & interval & worst-case accuracy \\ \hline \hline $\sin(x)$ & $|x|< 2^{-17}$ & $2^{-126}$ \\ & $ 2^{-17} \le |x| \le 2+\frac{4675}{8192}$& $2^{-119}$ \\ \hline $\cos(x)$ & $2^{-25} \le |x| \le 2^{-22}$ & $2^{-142}$ \\ & $2^{-22} \le |x| \le 2^{-18}$ & $2^{-136}$ \\ & $2^{-18} \le |x| \le 2^{-17}$ & $2^{-114}$ \\ & $2^{-17} \le |x| \le \frac{12867}{8192}$ & $2^{-112}$ \\ \hline $\tan(x)$ & $2^{-25} \le |x| \le 2^{-18}$ & $2^{-132}$ \\ & $2^{-18} \le |x| \le \arctan(2)$ & $2^{-111}$ \\ \hline \end{tabular} \end{center} The polynomials used are Pade approximation computed in \texttt{maple/trigo.mpl}. This maple script produces the \texttt{trigo.h} file, and also prints out the approximation error, as follows. \begin{itemize} \item of degree 25 for sine, with an approximation error lower than $2^{-125}$ on $[-\pi/4, \pi/4]$, and lower than $2^{-158}$ for $|x|< 2^{-17}$, \item of degree 26 for cosine, with an approximation error lower than $2^{-132}$ on $[-\pi/4, \pi/4]$, and lower than $2^{-168}$ for $|x|< 2^{-18}$, \item of degree 69 for the tangent, with an approximation error lower than $2^{-30}$ on $[-\pi/4, \pi/4]$, and lower than $2^{-163}$ for $|x|< 2^{-18}$. \end{itemize} The polynomial evaluation is an Horner scheme in SCS, ensuring better than $2^{-200}$ accumulated roundoff errors. Therefore, the overall evaluation error for the accurate phase is lower than the worst case accuracy for each function on each interval of the previous table. This Maple script, and \crlibm\ in general, are designed to allow easy increase of the accuracy, should cases worst than those of this table be found in the future. \section{Performance results} Table~\ref{tbl:sine_abstime} gives performance results for input numbers with random mantissa and exponents uniformely distributed between -20 and 40, by the command:\\ \verb!tests/crlibm_testperf sin RN 10000!. In this case the second step was taken 3 times out of 10000. Which input interval should be used to measure the performance of trigonometric functions is an open question for us. For larger exponents, \texttt{libultim} is faster than \texttt{crlibm}. \begin{table}[!htb] \begin{center} \renewcommand{\arraystretch}{1.2} \begin{tabular}{|l|r|r|r|} \hline \multicolumn{4}{|c|}{Pentium III / Linux Debian sarge / gcc 3.3} \\ \hline & min time & avg time & max time \\ \hline \texttt{libm} & 108 & 118 & 142 \\ \hline \texttt{mpfr} & 16715 & 67153 & 186925 \\ \hline \texttt{libultim} & 91 & 300 & 1294619 \\ \hline \texttt{crlibm} & 81 & 229 & 13616 \\ \hline \end{tabular} \end{center} \caption{Absolute timings for the sine (arbitrary units) \label{tbl:sine_abstime}} \end{table} Results for the cosine are very similar. The tangent leaves more room for improvement, as Table~\ref{tbl:tan_abstime} shows. The culprit is the Div22 procedure, which is very expensive. Directed rounding mode have a penalty of about 50 cycles on a Pentium III, due to the heavy use of integer 64-bit arithmetic. \begin{table}[!htb] \begin{center} \renewcommand{\arraystretch}{1.2} \begin{tabular}{|l|r|r|r|} \hline \multicolumn{4}{|c|}{Pentium III / Linux Debian sarge / gcc 3.3} \\ \hline & min time & avg time & max time \\ \hline \texttt{libm} & 158 & 167 & 183 \\ \hline \texttt{mpfr} & 22759 & 80108 & 222550 \\ \hline \texttt{libultim} & 113 & 428 & 1357592 \\ \hline \texttt{crlibm} & 105 & 367 & 33830 \\ \hline \end{tabular} \end{center} \caption{Absolute timings for the tangent (arbitrary units) \label{tbl:tan_abstime}} \end{table} %%% Local Variables: %%% mode: latex %%% TeX-master: "crlibm" %%% End: interval-2.1.0/src/crlibm/docs/latex/trigpi.tex0000644000000000000000000002565313031036767017631 0ustar 00000000000000This chapter is contributed by F. de Dinechin. \section{Overview} The trigpi functions are defined as follows: \begin{eqnarray} \sinpi(x) &=& sin(\pi x) \\ \cospi(x) &=& cos(\pi x) \\ \tanpi(x) &=& tan(\pi x) \end{eqnarray} These functions are similar to the trigonometric functions, with two main differences: \begin{itemize} \item Their first argument reduction is exact, and relatively easy: It consists in removing the integer part of $x$, as e.g. $\sinpi(x+n)=\pm \sinpi(x)$ for $n\in\N$. As an important consequence, their worst-case critical accuracy is known on $\F$ as soon as it is known on the interval $[0 1]$. \item Their Taylor expansion, on the other hand, has irrational coefficients, which requires more careful handling around zero. \end{itemize} Apart from these two differences, we use the same secondary argument reduction as for the trigonometric functions in chapter \ref{chap:trigo}. Indeed, we even use the same tabulated values: first, decompose the input value as follows: \begin{equation} \pi x = k\frac{\pi}{256} + \pi y\label{eq:trigpiargred} \end{equation} where $k$ is an integer and $ |y| \leq {1}/{512}$. Contrary to the usual trig functions, $y$ so defined is an exact double: this second argument reduction is errorless, too. Actually, it is performed in the same operations that compute the first. Then, denoting $a=k\pi/256$, we read off a table the following triple-double values: $$sa_h+sa_m+sa_l \approx sin(a)$$ $$ca_h+ca_m+ca_l \approx cos(a)$$ Only 64 pairs of triple-doubles are tabulated (amounting to $64\times 8 \times 6 = 3$ Kbytes), the rest is obtained by periodicity and symmetry, implemented as masks and integer operations on the integer $k$. For instance, $a\mod 2\pi$ is implemented by $k\mod 512$, $\pi/2-a$ is implemented as $128-k$, etc. Then we use the reconstruction steps: \begin{equation} \sinpi(x) = \sin(a + \pi y) = \cos(a) \sinpi(y) + \sin(a) \cospi(y) \label{eq:sinpiapy} \end{equation} \begin{equation} \cospi(x) = \cos(a + \pi y) = \cos(a) \cospi(y) - \sin(a) \sinpi(y) \label{eq:cospiapy} \end{equation} \begin{equation} tanpi(x) = \frac{\sinpi(x)}{\cospi(x)} \label{eq:tanpiapy} \end{equation} \section{Special cases for $\cos(\pi x)$ } $\cospi$ should return a NaN on infinities and NaN. In all the rounding modes, we have $\cospi(x)=1$ for all the even integer values of $|x|$, and $\cospi(x)=-1$ for all the odd integer values of $|x|$. In all the rounding modes, we have $\cospi(x)=1$ for all the even integer values of $|x|$, and $\cospi(x)=-1$ for all the odd integer values of $|x|$. We have $\cospi(x)=+0$ for all the half-integer values of $x$. One could discuss whether having alternate $+0$ and $-0$ would not be better, but there will be a conflict between $\cos(\pi+x)=-\cos(x)$ and $\cos(-x)=\cos(x)$ for e.g. $x=0.5\pi$. Our choice ($+0$ only) is inspired by the LIA2 standard. Concerning small inputs, we have the Taylor expansion: \begin{equation} \cos(\pi x) = 1-(\pi x)^2/2 + O(x^4)\label{eq:cospiTaylor} \end{equation} where $O(x^4)$ is positive. Therefore $\cos(\pi x)$ is rounded to $1$ in RN and RU mode if $(\pi x)^2<{2^{-53}}$. We test this with a constant $C$ which is defined as the upper 32 bits of $\sqrt(2^{-53})/4$. In RD and RZ modes, we have $\cospi(0)=1$ and $\cospi(x)=1-2^{-53}$ for $0<|x| 2^{-52} \cdot \left \vert x_\hi \right \vert$.\\ So we get the following inequality $$2^{-52} \cdot \left \vert x_\hi \right \vert < \mUlp\left( x_\hi \right)$$ Without loss of generality, let us suppose now that $x_\hi > 0$ and that $x_\hi^+ \not = + \infty$ where $x_\hi^+$ is the successor of $x_\hi$ in the ordered set of floating point numbers.\\ So we know by the definition of non-subnormal floating point number in double precision that there exists $m \in \N$ and $e \in \Z$ such that $x_\hi = 2^e \cdot m$ with $2^{52} \leq m < 2^{53}$. Anyway, one can check that $$x_\hi^+ = \left \lbrace \begin{array}{lll} 2^e \cdot \left(m + 1 \right) & \mbox{ if } & m+1 < 2^{53} \\ 2^{e+1} \cdot 2^{52} & \mbox{ otherwise} & \end{array} \right.$$ So 2 cases must be treated separately:\\~\\ {\bf 1st case: $x_\hi^+ = 2^e \cdot \left( m + 1 \right)$} \\ So we get \begin{eqnarray*} 2^e \cdot \left( m + 1 \right) - 2^e \cdot m & > & 2^{-52} \cdot 2^e \cdot m \\ 1 & > & 2^{-52} \cdot m \end{eqnarray*} In contrast, $m \geq 2^{52}$, so we obtain the strict inequality $1 > 1$ which contradicts the hypotheses. \\~\\ {\bf 2nd case: $x_\hi^+ = 2^{e+1} \cdot 2^{52}$} \\ In this case, we know that $m=2^{53} - 1$. \\ We can deduce that \begin{eqnarray*} 2^{e+1} \cdot 2^{52} - 2^e \cdot \left( 2^{53} - 1\right) & > & 2^{-52} \cdot 2^e \cdot \left( 2^{53} - 1 \right) \\ 1 & > & 2 - 2^{-52} \end{eqnarray*} This last inequality is a direct contradiction with the hypotheses.\qed \end{proof} \begin{lemma}[Commutativity of the $x^+$ and $x^-$ operators with unary $-$] \label{commut} ~ \\ Let be $x \in \F$ a positive floating point number.\\ So, $$\left( - x\right)^+ = -\left(x^+\right)$$ and $$\left( - x\right)^- = -\left(x^-\right)$$ \end{lemma} \begin{proof} ~ \\ Since the set of the floating point numbers is symmetrical around $0$, we get $$\left( -x\right)^+ = \pred\left( -x \right) = -\succ\left( x \right) = - \left(x^+\right)$$ and $$\left( -x\right)^- = \succ\left( -x \right) = -\pred\left( x \right) = - \left(x^-\right)$$\qed \end{proof} \begin{lemma}[$x^+$ and $x^-$ for an integer power of $2$] \label{poweroftwo} ~ \\ Let be $x \in \F$ a non-subnormal floating point number such that it exists $e \in \Z$ such that $$x=\pm2^e \cdot 2^p$$ where $p \geq 2$ is the format's precision.\\ So, $$x - x^-= \frac{1}{2} \cdot \left( x^+ - x \right)$$ \end{lemma} \begin{proof} ~\\ If $x > 0$, we get $$x - x^- = 2^e \cdot 2^p - 2^{e-1} \cdot \left( 2^{p+1} - 1 \right) = 2^{e-1}$$ and $$x^+ - x = 2^e \cdot \left( 2^p + 1 \right) - 2^e \cdot 2^p = 2^e$$ If $x$ is negative it suffices to apply lemma \ref{commut}.\qed \end{proof} \begin{lemma}[$x^+$ and $x^-$ for a float different from an integer power of $2$] \label{notpoweroftwo} ~\\ Let be $x \in \F$ a non-subnormal floating point number such that it does not exist any $e \in \Z$ such that $$x=\pm2^e \cdot 2^p$$ where $p \geq 2$ is the format's precision.\\ So, $$x - x^- = x^+ - x$$ \end{lemma} \begin{proof} ~ \\ If $x > 0$ we know that there exist $e \in \Z$ and $m \in \N$ such that $$x = 2^e \cdot m$$ with $$2^p < m < 2^{p-1}$$ because $x$ is not exactly an integer power of $2$. \\ Further, one checks that $$x^+ = 2^e \cdot \left( m + 1 \right)$$ even if $m = 2^{p-1} -1$ and that $$x^- = 2^e \cdot \left( m - 1 \right)$$ because the lower bound given for $m$ is strict. \\ So one gets \begin{eqnarray*} x - x^- & = & 2^e \cdot m - 2^e \cdot \left(m - 1 \right) \\ & = & 2^e \\ & = & 2^e \cdot \left( m + 1 \right) - 2^e \cdot m \\ & = & x^+ - x \end{eqnarray*} If $x$ is negative it suffices to apply lemma \ref{commut}.\qed \end{proof} \begin{lemma}[Factorized integer powers of $2$ and the operators $x^+$ and $x^-$] \label{multhalf} ~\\ Let be $x \in \F$ a non-subnormal floating point number such that $\frac{1}{2} \cdot x$ is still not subnormal.\\ So, $$\left(\frac{1}{2} \cdot x \right)^+ = \frac{1}{2} \cdot x^+$$ and $$\left(\frac{1}{2} \cdot x \right)^- = \frac{1}{2} \cdot x^-$$ \end{lemma} \begin{proof} ~ \\ Without loss of generality let us suppose that $x$ is positive. Otherwise we easily apply lemma \ref{commut}. \\ So, if $x$ can be written $x = 2^e \cdot m$ with $m + 1 \leq 2^{p+1}$ where $p$ is the precision then $$\left( \frac{1}{2} \cdot x \right)^+ = \left( 2^{e-1} \cdot m \right)^+ = 2^{e-1} \cdot \left(m+1\right) = \frac{1}{2} \cdot x^+$$ Otherwise, $$\left( \frac{1}{2} \cdot x \right)^+ = \left( 2^{e-1} \cdot \left( 2^{p+1} -1 \right) \right)^+ = 2^{e-1+1} \cdot 2^p = \frac{1}{2} \cdot x^+$$ One can check that one obtains a completely analogous result for $x^-$.\qed \end{proof} \begin{lemma}[Factor $3$ of an integer power of $2$ in argument of the $x^+$ operator] \label{succtroisfoispuissdeux} ~ \\ Let be $x \in \F$ a positive floating point number such that $x$ is not subnormal, $x^+$ and $\left( 3 \cdot x \right)^+$ are different from $+\infty$, and that $\exists e \in \Z \mbox{ . } x = 2^e \cdot 2^p$ where $p \geq 3$ is the precision of the format $\F$.\\ So the following equation holds $$\left( 3 \cdot x \right)^+ + \mUlp\left( x \right) = 3 \cdot x^+$$ \end{lemma} \begin{proof} ~ \\ We can easily check the following \begin{eqnarray*} \left( 3 \cdot x \right)^+ + \mUlp\left( x \right) & = & \left( 3 \cdot x \right) + \left( x^+ - x \right) \\ & = & \left( 3 \cdot 2^e \cdot 2^p \right)^+ + \left( 2^e \cdot 2^p \right)^+ - 2^e \cdot 2^p \\ & = & \left( \left( 2 + 1 \right) \cdot 2^e \cdot 2^p \right)^+ + 2^e \cdot \left( 2^p + 1 \right) - 2^e \cdot 2^p \\ & = & \left( 2 \cdot 2^e \cdot 2^p + 2 \cdot \frac{1}{2} \cdot 2^e \cdot 2^p \right)^+ + 2^e \\ & = & \left( 2^{e+1} \cdot \left( 2^p + 2^{p-1} \right) \right)^+ + 2^e \\ & = & 2^{e+1} \cdot \left( 2^p + 2^{p-1} + 1 \right) + 2^e \\ & = & 2^{e+1} \cdot \left( 2^p + 2^{p-1} \right) + 2^{e+1} + 2^e \\ & = & 2^{e+1} \cdot \left( 2^p + 2^{p-1} \right) + 3 \cdot 2^e \\ & = & 3 \cdot 2^e \cdot 2^p + 3 \cdot 2^e \\ & = & 3 \cdot 2^e \cdot \left( 2^p + 1 \right) \\ & = & 3 \cdot \left( 2^e \cdot 2^p \right)^+ \\ & = & 3 \cdot x^+ \end{eqnarray*} \qed \end{proof} \begin{lemma}[Monotony of the $\mUlp$ function] \label{ulpmonoton} ~ \\ The $\mUlp$ function is monotonic for non-subnormal positive floating point numbers and it is monotonic for non-subnormal negative floating point numbers, i.e. $$\forall x,y \in \F \mbox{ . } denorm < x \leq y \Rightarrow \mUlp\left( x \right) \leq \mUlp\left( y \right)$$ $$\lor$$ $$\forall x,y \in \F \mbox{ . } x \leq y < -denorm \Rightarrow \mUlp\left( x \right) \geq \mUlp\left( y \right)$$ where $denorm$ is the greatest positive subnormal. \end{lemma} \begin{proof} ~ \\ As a matter of fact it suffices to show that the $\mUlp$ function is monotonic for non-subnormal floating point numbers and to apply its definition \ref{defulp} for the negative case.\\ Let us suppose so that we have two floating point numbers $x, y \in \F$ such that $denorm < x < y$. Without loss of generality we suppose that $x^+ \not = + \infty$ and that $y^+ \not = + \infty$. Otherwise we apply definition \ref{defulp} of the $\mUlp$ function and lemma \ref{multhalf}.\\ So we get $$\mUlp\left( y \right) - \mUlp\left( x \right) = y^+ - y - x^+ + x$$ It suffices now to show that $$y^+ - x^+ - y + x \geq 0$$ We can suppose that we would have \begin{eqnarray*} x & = & 2^{e_x} \cdot m_x \\ y & = & 2^{e_y} \cdot m_y \end{eqnarray*} with $e_x, e_y \in \Z$, $2^p \leq m_x, m_y < 2^{p+1} - 1$.\\ Since $y > x$, we clearly see that $$\left( e_y, m_y \right) \geq_{\mbox{lex}} \left( e_x, m_x \right)$$ \\ So four different cases are possible: \begin{enumerate} \item \begin{eqnarray*} x^+ & = & 2^{e_x} \cdot \left( m_x + 1 \right) \\ y^+ & = & 2^{e_y} \cdot \left( m_y + 1 \right) \end{eqnarray*} Hence \begin{eqnarray*} y^+ - x^+ - y + x & = & 2^{e_y} \cdot \left( m_y + 1 \right) - 2^{e_x} \cdot \left( m_x + 1 \right) - 2^{e_y} \cdot m_y + 2^{e_x} \cdot m_x \\ & = & 2^{e_y} - 2^{e_x} \\ & \geq & 0 \end{eqnarray*} \item \begin{eqnarray*} x^+ & = & 2^{e_x} \cdot \left( m_x + 1 \right) \\ y^+ & = & 2^{e_y+1} \cdot 2^p \end{eqnarray*} which yields to \begin{eqnarray*} y^+ - x^+ - y + x & = & 2^{e_y+1} \cdot 2^p - 2^{e_x} \cdot \left( m_x + 1 \right) - 2^{e_y} \cdot \left( 2^{p+1} - 1 \right) + 2^{e_x} \cdot m_x \\ & = & 2^{e_y} - 2^{e_x} \\ & \geq & 0 \end{eqnarray*} \item \begin{eqnarray*} x^+ & = & 2^{e_x+1} \cdot 2^p \\ y^+ & = & 2^{e_y} \cdot \left( m_y + 1 \right) \end{eqnarray*} One checks that \begin{eqnarray*} y^+ - x^+ - y + x & = & 2^{e_y} \cdot \left( m_y + 1 \right) - 2^{e_x+1} \cdot 2^p - 2^{e_y} \cdot m_y + 2^{e_x} \cdot \left( 2^{p+1} - 1 \right) \\ & = & 2^{e_y} - 2^{e_x} \\ & \geq & 0 \end{eqnarray*} \item \begin{eqnarray*} x^+ & = & 2^{e_x+1} \cdot 2^p \\ y^+ & = & 2^{e_y+1} \cdot 2^p \end{eqnarray*} Thus \begin{eqnarray*} y^+ - x^+ - y + x & = & 2^{e_y+1} \cdot 2^p - 2^{e_x+1} \cdot 2^p - 2^{e_y} \cdot \left( 2^{p+1} - 1 \right) + 2^{e_x} \cdot \left( 2^{p-1} - 1\right) \\ & = & 2^{e_y} - 2^{e_x} \\ & \geq & 0 \end{eqnarray*} \end{enumerate} This finishes the proof.\qed \end{proof} \section{A normal form and renormalization procedures} Let us now analyse a renormalization algorithm. We will prove its correctness be a series of lemmas and a final theorem. \\ Let be the following procedure: \begin{algorithm}[Renormalization] \label{renorm}~\\ {\bf In: $a_\hi, a_\mi, a_\lo \in \F$} verifying the following preconditions:\\ {\bf Preconditions: } \begin{itemize} \item None of the numbers $a_\hi, a_\mi, a_\lo$ is subnormal \item $a_\hi$ and $a_\mi$ do not overlap in more than $51$ bits \item $a_\mi$ and $a_\lo$ do not overlap in more than $51$ bits \end{itemize} which means formally: \begin{eqnarray*} \left \vert a_\mi \right \vert & \leq & 2^{-2} \cdot \left \vert a_\hi \right \vert \\ \left \vert a_\lo \right \vert & \leq & 2^{-2} \cdot \left \vert a_\mi \right \vert \\ \left \vert a_\lo \right \vert & \leq & 2^{-4} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} {\bf Out: $r_\hi, r_\mi, r_\lo \in \F$} \begin{eqnarray*} \left(t_{1\hi}, t_{1\lo}\right) & \gets & \mAdd\left(a_\mi,a_\lo\right) \\ \left(r_\hi, t_{2\lo}\right) & \gets & \mAdd\left(a_\hi, t_{1\hi}\right) \\ \left(r_\mi, r_\lo\right) & \gets & \mAdd\left(t_{2\lo}, t_{1\lo}\right) \end{eqnarray*} \end{algorithm} Consult also \cite{Finot-thesis} on the subject of this algorithm. Let us give now some lemmas on the properties of the values returned by algorithm \ref{renorm} and on the intermediate ones. \begin{lemma}[Exact sum] \label{exact} ~\\ For each triple-double number $a_\hi + a_\mi + a_\lo$, algorithm \ref{renorm} returns a triple-double number $r_\hi + r_\mi + r_\lo$ such that $$a_\hi + a_\mi + a_\lo = r_\hi + r_\mi + r_\lo$$ \end{lemma} \begin{proof} ~\\ This fact is a trivial consequence of the properties of the \Add~ algorithm. \qed \end{proof} \begin{lemma}[Rounding of the middle component] \label{properties}~\\ For each triple-double number $a_\hi + a_\mi + a_\lo$, algorithm \ref{renorm} returns a triple-double number $r_\hi + r_\mi + r_\lo$ such that $$r_\mi = \circ \left( r_\mi + r_\lo \right)$$ The same way, the intermediate and final value will verify the following properties: \begin{eqnarray*} t_{1\hi} & = & \circ \left( a_\mi + a_\lo \right) \\ r_\hi & = & \circ \left( a_\hi + t_{1\hi} \right) \\ \left \vert t_{1\lo} \right \vert & \leq & 2^{-53} \cdot \left \vert t_{1\hi} \right \vert \\ \left \vert t_{2\lo} \right \vert & \leq & 2^{-53} \cdot \left \vert r_\hi \right \vert \\ \end{eqnarray*} In particular, $r_\mi$ will not be equal to $0$ if $r_\lo$ is not equal to $0$. \end{lemma} \begin{proof} ~\\ This fact is a trivial consequence of the properties of the \Add~ algorithm. \qed \end{proof} \begin{lemma}[Upper bounds] \label{major}~\\ For all arguments of algorithm \ref{renorm}, the intermediate and final values $t_{1\hi}$, $t_{1\lo}$, $t_{2\lo}$ and $r_\mi$ can be bounded upwards as follows: \begin{eqnarray*} \left \vert t_{1\hi} \right \vert & \leq & 2^{-1} \cdot \left \vert a_\hi \right \vert \\ \left \vert t_{1\lo} \right \vert & \leq & 2^{-54} \cdot \left \vert a_\hi \right \vert \\ \left \vert t_{2\lo} \right \vert & \leq & 2^{-52} \cdot \left \vert a_\hi \right \vert \\ \left \vert t_\mi \right \vert & \leq & 2^{-51} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} \end{lemma} \begin{proof} ~\\ \begin{enumerate} \item {\bf Upper bound for $\left \vert t_{1\hi} \right \vert$:}\\ We have supposed that \begin{eqnarray*} \left \vert a_\mi \right \vert & \leq & 2^{-2} \cdot \left \vert a_\hi \right \vert \\ \left \vert a_\lo \right \vert & \leq & 2^{-4} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} So we can check that \begin{eqnarray*} \left \vert t_{1\hi} \right \vert & \leq & \left \vert a_\mi \right \vert + \left \vert a_\lo \right \vert + 2^{-54} \cdot \left \vert a_\hi \right \vert\\ & \leq & 2^{-2} \cdot \left \vert a_\hi \right \vert + 2^{-4} \cdot \left \vert a_\hi \right \vert + 2^{-54} \cdot \left \vert a_\hi \right \vert \\ & \leq & 2^{-1} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} \item {\bf Upper bound for $\left \vert t_{1\lo} \right \vert$:}\\ Using the properties of the \Add~ algorithm we can get to know that $$\left \vert t_{1\lo} \right \vert \leq 2^{-53} \cdot \left \vert t_{1\hi} \right \vert$$ which yields finally to $$\left \vert t_{1\lo} \right \vert \leq 2^{-54} \cdot \left \vert a_\hi \right \vert$$ \item {\bf Upper bound for $\left \vert t_{2\lo} \right \vert$:} \begin{eqnarray*} \left \vert t_{2\lo} \right \vert & \leq & 2^{-53} \cdot \left \vert r_\hi \right \vert \\ & \leq & 2^{-53} \cdot \circ \left( \left \vert a_\hi \right \vert + \left \vert t_{1\hi} \right \vert \right) \\ & \leq & 2^{-53} \cdot \left \vert a_\hi \right \vert + 2^{-53} \cdot \left \vert t_{1\hi} \right \vert + 2^{-106} \cdot \left \vert a_\hi \right \vert + 2^{-106} \cdot \left \vert t_{1\hi} \right \vert \\ & \leq & 2^{-53} \cdot \left \vert a_\hi \right \vert + 2^{-54} \cdot \left \vert a_\hi \right \vert + 2^{-106} \cdot \left \vert a_\hi \right \vert + 2^{-107} \cdot \left \vert a_\hi \right \vert \\ & \leq & 2^{-52} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} \item {\bf Upper bound for $\left \vert r_\mi \right \vert$:} \begin{eqnarray*} \left \vert r_\mi \right \vert & \leq & \left \vert t_{2\lo} \oplus t_{1\lo} \right \vert \\ & \leq & \left \vert t_{2\lo} \right \vert + \left \vert t_{1\lo} \right \vert + 2^{-53} \cdot \left \vert t_{2\lo} + t_{1\lo} \right \vert \\ & \leq & 2^{-52} \cdot \left \vert a_\hi \right \vert + 2^{-54} \cdot \left \vert a_\hi \right \vert + 2^{-105} \cdot \left \vert a_\hi \right \vert + 2^{-107} \cdot \left \vert a_\hi \right \vert \\ & \leq & 2^{-51} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} \end{enumerate} ~ \qed \end{proof} \begin{lemma}[Special case for $r_\hi = 0$] \label{specialcaseinzero}~\\ For all arguments verifying the preconditions of algorithm \ref{renorm}, $r_\hi$ will not be equal to $0$ if $r_\mi$ is not equal to $0$. \\ Formally: $$r_\hi = 0 \Rightarrow r_\mi = 0$$ \end{lemma} \begin{proof} ~\\ Let us suppose that $r_\hi = 0$ and that $r_\mi \not = 0$. So we get \begin{eqnarray*} \left \vert r_\hi \right \vert & = & \left \vert \circ \left( a_\hi + t_{1\hi} \right) \right \vert \\ & \geq & \left \vert \circ \left( 2^{-1} \cdot a_\hi \right) \right \vert \\ & = & 2^{-1} \left \vert a_\hi \right \vert \end{eqnarray*} because we have already shown that $$\left \vert t_{1\hi} \right \vert \leq 2^{-1} \cdot \left \vert a_\hi \right \vert$$ So for $r_\hi$ being equal to $0$, $a_\hi$ must be equal to $0$.\\ In contrast, this yields to $t_{1\hi} = 0$ because $$r_\hi = \circ \left( 0 + t_{1\hi} \right) = t_{1\hi}$$ This implies that $t_{1\lo} = 0$ because of the properties of the \Add~ procedure. The same way, we get $t_{2\lo} = 0$.\\ We can deduce from this that $$0 \not = r_\mi = \circ \left( 0 + 0 \right) = 0$$ which is a contradiction.\qed \end{proof} \begin{lemma}[Lower bound for $\left \vert r_\hi \right \vert$] \label{minor}~\\ For all arguments verifying the preconditions of algorithm \ref{renorm}, the final result $r_\hi$ can be bounded in magnitude as follows: $$\left \vert r_\hi \right \vert \geq 2^{-1} \cdot \left \vert a_\hi \right \vert$$ \end{lemma} \begin{proof} ~\\ We have that $$r_\hi = a_\hi \oplus t_{1\hi}$$ Clearly, if $a_\hi$ and $t_{1\hi}$ have the same sign, we get $$\left \vert r_\hi \right \vert \geq \left \vert a_\hi \right \vert \geq 2^{-1} \cdot \left \vert a_\hi \right \vert$$ Otherwise - $a_\hi$ and $t_{1\hi}$ are now of the opposed sign - we have already seen that $$\left \vert t_{1\hi} \right \vert \leq 2^{-1} \cdot \left \vert a_\hi \right \vert$$ So, in this case, too, we get $$\left \vert r_\hi \right \vert \geq 2^{-1} \cdot \left \vert a_\hi \right \vert$$ \qed \end{proof} \begin{corollary}[Additional property on the \Add~procedure] \label{addsupp} ~\\ Let be $r_\hi$ and $r_\lo$ two double precision floating point numbers returned by the \Add~ procedure. \\ So $$\left \vert r_\lo \right \vert \leq \frac{1}{2} \cdot \mUlp\left( r_\hi \right)$$ \end{corollary} \begin{proof} ~\\ By the definition \ref{adddef} of the \Add~ procedure, we have $r_\hi + r_\lo = x + y$ and $r_\hi = \circ \left( x + y \right)$ and $r_\lo = x+y -r_\lo$. Thus the number $r_\lo = \left( x + y \right) - \circ \left( x + y \right) = \left( x + y \right) - \left( x \oplus y \right)$ is the absolute error of correctly rounded IEEE 754 addition. It is bounded by $\frac{1}{2} \cdot \mUlp\left( r_\hi \right)$ which gives us the desired result.\qed \end{proof} \begin{theorem}[Correctness of the renormalization algorithm \ref{renorm}] ~\\ For all arguments verifying the preconditions of procedure \ref{renorm}, the values returned $r_\hi$, $r_\mi$ and $r_\lo$ will not overlap unless they are all equal to $0$ and their sum will be exactly the sum of the values in argument $a_\hi$, $a_\mi$ and $a_\lo$. \end{theorem} \begin{proof} ~ \\ The fact that the sum of the values returned is exactly equal to the sum of the values in argument has already been proven by lemma \ref{exact}.\\ Without loss of generality, we will now suppose that neither $r_\hi$ nor $r_\mi$ will be $0$ in which case all values returned would be equal to $0$ as we have shown it by lemmas \ref{specialcaseinzero} and \ref{properties}.\\ Using lemma \ref{properties}, we know already that $r_\mi$ and $r_\lo$ do not overlap. Let us show now that $r_\hi$ and $r_\mi$ do not overlap by proving that the following inequality is true $$\left \vert r_\mi \right \vert \leq \frac{3}{4} \cdot \mUlp\left( r_\hi \right) < \mUlp\left( r_\hi \right)$$ There are two different cases to be treated. \\ ~ \\ {\bf 1st case: $t_{2\lo} = 0$} \\ We know that $$r_\mi = \circ \left( t_{2\lo} + t_{1\lo} \right) = \circ \left( 0 + t_{1\lo} \right) = t_{1\lo}$$ When showing lemma \ref{major}, we have already proven that $$\left \vert t_{1\lo} \right \vert \leq 2^{-54} \cdot \left \vert a_\hi \right \vert$$ Using lemma \ref{minor}, we therefore know that $$\left \vert r_\mi \right \vert \leq 2^{-53} \cdot \left \vert r_\hi \right \vert$$ which is the result we wanted to prove.\\ ~ \\ {\bf 2nd case: $t_{2\lo} \not = 0$} \\ Still using lemma \ref{major}, we have shown that $$\left \vert t_{1\hi} \right \vert \leq 2^{-1} \cdot \left \vert a_\hi \right \vert$$ In consequence, when the IEEE 754 \cite{IEEE754} addition $r_\hi = a_\hi \oplus t_{1\hi}$ is ported out, the rounding will be done at a bit of weight heigher than one $\mUlp\left(t_{1\hi} \right)$ because $t_{2\lo}$ is strictly greater than $0$ and because $a_\hi$ and $t_{1\hi}$ do not completely overlap. Therefore we can check that $$\left \vert t_{2\lo} \right \vert \geq \mUlp\left( t_{1\hi} \right)$$ With the result of lemma \ref{major} we already mentioned, we can deduce that $$\left \vert t_{2\lo} \right \vert \leq \frac{1}{2} \cdot \mUlp\left( t_{1\hi} \right) \leq \frac{1}{2} \cdot \left \vert t_{2\lo} \right \vert$$ So one can verify the following upper bound using among others lemma \ref{addsupp}: \begin{eqnarray*} \left \vert r_\mi \right \vert & = & \left \vert \circ \left(t_{2\lo} + t_{1\lo} \right) \right \vert \\ & \leq & \circ \left( \frac{3}{2} \cdot \left \vert t_{2\lo} \right \vert \right) \\ & \leq & \circ \left( \frac{3}{4} \cdot \mUlp \left( r_\hi \right) \right) \\ & = & \frac{3}{4} \cdot \mUlp \left( r_\hi \right) \end{eqnarray*} One remarks that the last simplification is correct here because $\mUlp$ is always equal to an integer power of $2$ and because the precision of a double is greater than $4$ bits.\qed \end{proof} \section{Operators on double-double numbers} Since we dispose now of a renormalization procedure which is effective and proven, we can now consider the different addition and multiplication operators we need. They will surely work finally on expansions of size $3$, but the double-double format \cite{Dek71} must be analysed, too, because it is at the base of the triple-double format. We already mentioned that on definition and analysis of this operators, we need not care such a lot of the overlap in the components of a triple-double number any more: as long as the overlap does not make us loose a too much of the final accuracy because several bits of the \ouvguill significand\fermguill~ are represented twice, overlap is not of an issue for intermediate values. At the end of triple-double computations, it will be sufficient to apply once the renormalization procedure. In order to measure the consequences of an overlap in the operands on final accuracy and in order to be able to follow the increase of the overlap during computations in triple-double, we will indicate for each operator which produces a triple double result or which takes a triple-double operand not only a bound for relative and absolute rounding errors but also a bound for the maximal overlap of the values returned. All this bounds will be parameterised by a variable representing the maximal overlap of the triple-double arguments. \subsection{The addition operator \AddDD} Let us analyse first the following addition procedure: \begin{algorithm}[\AddDD] \label{addDDref} ~ \\ {\bf In:} two double-double numbers, $a_\hi + a_\lo$ and $b_\hi + b_\lo$ \\ {\bf Out:} a double-double number $r_\hi + r_\lo$ \\ {\bf Preconditions on the arguments:} $$\left \vert a_\lo \right \vert \leq 2^{-53} \cdot \left \vert a_\hi \right \vert$$ $$\left \vert b_\lo \right \vert \leq 2^{-53} \cdot \left \vert b_\hi \right \vert$$ {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{50mm} $t_1 \gets a_\hi \oplus b_\hi$ \\ {\bf if} $\left \vert a_\hi \right \vert \geq \left \vert b_\hi \right \vert$ {\bf then} \begin{center} \begin{minipage}[b]{40mm} $t_2 \gets a_\hi \ominus t_1$ \\ $t_3 \gets t_2 \oplus b_\hi$ \\ $t_4 \gets t_3 \oplus b_\lo$ \\ $t_5 \gets t_4 \oplus a_\lo$ \end{minipage} \end{center} {\bf else} \begin{center} \begin{minipage}[b]{40mm} $t_2 \gets b_\hi \ominus t_1$ \\ $t_3 \gets t_2 \oplus a_\hi$ \\ $t_4 \gets t_3 \oplus a_\lo$ \\ $t_5 \gets t_4 \oplus b_\lo$ \end{minipage} \end{center} {\bf end if} \\ $\left( r_\hi, r_\lo \right) \gets \mAdd\left( t_1, t_5 \right)$ \end{minipage} \end{center} \end{algorithm} Compare \cite{crlibmweb} concerning algorithm \ref{addDDref}. \begin{theorem}[Relative error of algorithm \ref{addDDref} \AddDD~ without occurring of cancellation\label{theoAddDDref}] ~ \\ Let be $a_\hi + a_\lo$ and $b_\hi + b_\lo$ the double-double arguments of algorithm \ref{addDDref} \AddDD.\\ If $a_\hi$ and $b_\hi$ have the same sign, so we know that $$r_\hi + r_\lo = \left(\left(a_\hi + a_\lo \right) + \left( b_\hi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded as follows: $$\left \vert \epsilon \right \vert \leq 2^{-103,5}$$ \end{theorem} \begin{proof} \label{AddDDpreuve} ~ \\ Since the algorithm \AddDD~ ends by a call to the \Add~ procedure, it suffices to show that $$t_1 + t_5 = \left(\left(a_\hi + a_\lo \right) + \left( b_\hi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ Further, since the two branches of the algorithm are symmetrical, we can suppose that $\left \vert a_\hi \right \vert \geq \left \vert b_\hi \right \vert$ and consider only one branch without loss of generality. Finally, we remark that the following lines of the \AddDD~ procedure constitute a non-conditional \Add~ with arguments $a_\hi$ and $b_\hi$ and the result $t_1 + t_3$: \begin{center} \begin{minipage}[b]{50mm} $t_1 = a_\hi \oplus b_\hi$ \\ $t_2 = a_\hi \ominus t_1$ \\ $t_3 = t_2 \oplus b_\hi$ \end{minipage} \end{center} Thus, we get \begin{eqnarray*} t_5 & = & t_4 \oplus a_\lo \\ & = & \left( t_4 + a_\lo \right) \cdot \left( 1 + \epsilon_1 \right) \\ & = & \left( \left( t_3 + bl \right) \cdot \left( 1 + \epsilon_2 \right) + a_\lo \right) \cdot \left( 1 + \epsilon_1 \right) \\ & = & t_3 + a_\lo + b_\lo + \delta \end{eqnarray*} with $$\delta = t_3\cdot\epsilon_2 + b_\lo\cdot\epsilon_2 + t_3\cdot\epsilon_1 + b_\lo\cdot\epsilon_1 + t_3\cdot\epsilon_2\cdot\epsilon_2 + b_\lo\cdot\epsilon_2\cdot\epsilon_2 + a_\lo\cdot\epsilon_1$$ For giving an upper bound for $\left \vert \delta \right \vert$, let us first give an upper bound for $\left \vert t_3 \right \vert$, $\left \vert a_\lo \right \vert$ and $b_\lo$ as function of $\left \vert a_\hi + b_\hi \right \vert$ using the following bounds that we know already: \begin{eqnarray*} \left \vert a_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert a_\hi \right \vert \\ \left \vert b_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert b_\hi \right \vert \\ \left \vert t_3 \right \vert & \leq & 2^{-53} \cdot \left \vert t_1 \right \vert \end{eqnarray*} We get therefore \begin{eqnarray*} \left \vert t_3 \right \vert & \leq & 2^{-53} \cdot \left \vert t_1 \right \vert \\ & = & 2^{-53} \cdot \left \vert a_\hi \oplus b_\hi \right \vert \\ & \leq & 2^{-53} \cdot \left \vert a_\hi + b_\hi \right \vert + 2^{-106} \cdot \left \vert a_\hi + b_\lo \right \vert \end{eqnarray*} and than \begin{eqnarray*} \left \vert a_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert a_\hi \right \vert \\ & \leq & 2^{-53} \cdot \left \vert a_\hi + b_\hi \right \vert \end{eqnarray*} The last bound is verified because we suppose that $a_\hi$ and $b_\hi$ have the same sign. \\ Finally, since $\left \vert a_\hi \right \vert \geq \left \vert b_\hi \right \vert$, \begin{eqnarray*} \left \vert b_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert b_\hi \right \vert \\ & \leq & 2^{-53} \cdot \left \vert a_\hi \right \vert \\ & \leq & 2^{-53} \cdot \left \vert a_\hi + b_\hi \right \vert \end{eqnarray*} Thus we get for $\left \vert \delta \right \vert$: \begin{eqnarray*} \left \vert \delta \right \vert & \leq & \left \vert a_\hi + b_\hi \right \vert \cdot \left( 2^{-106} + 2^{-159} + 2^{-106} + 2^{-106} + 2^{-159} + 2^{-106} + 2^{-159} + 2^{-212} + 2^{-212} + 2^{-106} \right) \\ & \leq & \left \vert a_\hi + b_\hi \right \vert \cdot \left( 2^{-104} + 2^{-106} + 2^{-158} + 2^{-159} + 2^{-211} \right) \end{eqnarray*} Let us now give a lower bound for $\left \vert a_\hi + a_\lo + b_\hi + b_\lo \right \vert$ as a function of $\left \vert a_\hi + b_\hi \right \vert$ in order to be able to give a relative error bound for the procedure \AddDD. We have that \begin{eqnarray*} \left \vert a_\lo + b_\lo \right \vert & \leq & \left \vert a_\lo \right \vert + \left \vert b_\lo \right \vert \\ & \leq & 2^{-53} \cdot \left \vert a_\hi \right \vert + 2^{-53} \cdot \left \vert b_\hi \right \vert \\ & \leq & 2^{-52} \cdot \left \vert a_\hi \right \vert \\ & \leq & 2^{-52} \cdot \left \vert a_\hi + b_\hi \right \vert \end{eqnarray*} So we can check that $$\left \vert a_\hi + a_\lo + b_\hi + b_\lo \right \vert \geq \left( 1 - 2^{-52} \right) \cdot \left \vert a_\hi + b_\hi \right \vert$$ Concerning $\left \vert \delta \right \vert$, this yields to $$\left \vert \delta \right \vert \leq \left \vert a_\hi + a_\lo + b_\hi + b_\lo \right \vert \cdot \frac{1}{1-2^{-52}} \cdot \left( 2^{-104} + 2^{-106} + 2^{-158} + 2^{-159} + 2^{-211} \right)$$ One easily checks that $$ \frac{1}{1-2^{-52}} \cdot \left( 2^{-104} + 2^{-106} + 2^{-158} + 2^{-159} + 2^{-211} \right) \leq 2^{-103,5}$$ from which one trivially deduces the affirmation.\qed \end{proof} \begin{theorem}[Relative error of algorithm \ref{addDDref} \AddDD~ with a bounded cancellation\label{theoAddDDrefborn}] ~ \\ Let be $a_\hi + a_\lo$ and $b_\hi + b_\lo$ the double-double arguments of \ref{addDDref} \AddDD.\\ If $a_\hi$ and $b_\hi$ are of different sign and if one can check that $$\left \vert b_\hi \right \vert \leq 2^{-\mu} \cdot \left \vert a_\hi \right \vert$$ for $\mu \geq 1$ \\ so the returned result will verify $$r_\hi + r_\lo = \left(\left(a_\hi + a_\lo \right) + \left( b_\hi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded as follows: $$\left \vert \epsilon \right \vert \leq 2^{-103}\cdot \frac{1-2^{-\mu - 1}}{1-2^{-\mu}-2^{-52}} \leq 2^{-102}$$ \end{theorem} \begin{proof} ~ \\ Let us reuse the results obtained at the proof \ref{AddDDpreuve} and let us start by giving an upper bound for $\left \vert b_\lo \right \vert$ as a function of $\left \vert a_\hi \right \vert$: $$\left \vert b_\lo \right \vert \leq 2^{-53} \cdot \left \vert b_\hi \right \vert \leq 2^{-53-\mu} \cdot \left \vert a_\hi \right \vert$$ Let us now continue with a lower bound for $\left \vert a_\hi + b_\hi \right \vert$ still as a function of $\left \vert a_\hi \right \vert$: $$\left \vert a_\hi + b_\hi \right \vert \geq \left \vert a_\hi \right \vert \cdot \left( 1 - 2^{-\mu} \right)$$ We get in consequence $$\left \vert a_\lo \right \vert \leq \frac{2^{-53}}{1-2^{-\mu}} \cdot \left \vert a_\hi + b_\hi \right \vert$$ and $$\left \vert b_\lo \right \vert \leq \frac{2^{-53-\mu}}{1-2^{-\mu}} \cdot \left \vert a_\hi + b_\hi \right \vert$$ Thus we can check that $$\left \vert \delta \right \vert \leq \left \vert a_\hi + b_\hi \right \vert \cdot 2^{-103} \cdot \frac{1-2^{-\mu-1}}{1-2^{-\mu}}$$ Once again, we must give a lower bound for $\left \vert a_\hi + a_\lo + b_\hi + b_\lo \right \vert$ with regard to $\left \vert a_\hi + b_\hi \right \vert$: We know that \begin{eqnarray*} \left \vert a_\lo + b_\lo \right \vert & \leq & \left \vert a_\lo \right \vert + \left \vert b_\lo \right \vert \\ & \leq & 2^{-52} \cdot \left \vert a_\hi \right \vert \\ & \leq & \frac{2^{-52}}{1-2^{-\mu}} \cdot \left \vert a_\hi + b_\hi \right \vert \end{eqnarray*} So $$\left \vert a_\hi + a_\lo + b_\hi + b_\lo \right \vert \geq \left \vert a_\hi + b_\hi \right \vert \cdot \frac{1-2^{-\mu}-2^{-52}}{1-2^{-\mu}}$$ Thus we get for $\left \vert \delta \right \vert$ \begin{eqnarray*} \left \vert \delta \right \vert & \leq & \left \vert a_\hi + a_\lo + b_\hi + b_\lo \right \vert \cdot \frac{1-2^{-\mu}}{1-2^{-\mu}-2^{-52}} \cdot 2^{-103} \cdot \frac{1-2^{-\mu-1}}{1-2^{-\mu}} \\ & = & \left \vert a_\hi + a_\lo + b_\hi + b_\lo \right \vert \cdot 2^{-103} \cdot \frac{1-2^{-\mu-1}}{1-2^{-\mu}-2^{-52}} \end{eqnarray*} So finally the following inequality is verified for the relative error $\epsilon$: $$\left \vert \epsilon \right \vert \leq 2^{-103} \cdot \frac{1-2^{-\mu-1}}{1-2^{-\mu}-2^{-52}}$$ We can still give a less exact upper bound for this term by one that does not depend on $\mu$ because $\mu \geq 1$: $$\frac{1-2^{-\mu-1}}{1-2^{-\mu}-2^{-52}}\leq\frac{\frac{3}{4}}{\frac{1}{2}-2^{-52}}\leq 2$$ so $$\left \vert \epsilon \right \vert \leq 2^{-102}$$\qed \end{proof} \begin{theorem}[Absolute error of algorithm \ref{addDDref} \AddDD~ (general case)\label{addDDerrabs}] ~ \\ Let be $a_\hi + a_\lo$ and $b_\hi + b_\lo$ the double-double arguments of algorithm \ref{addDDref} \AddDD.\\ The result $r_\hi + r_\lo$ returned by the algorithm verifies $$r_\hi + r_\lo = \left(a_\hi + a_\lo \right) + \left( b_\hi + b_\lo \right) + \delta$$ where $\delta$ is bounded as follows: $$\left \vert \delta \right \vert \leq \max\left( 2^{-53} \cdot \left \vert a_\lo + b_\lo \right \vert, 2^{-102} \cdot \left \vert a_\hi + a_\lo + b_\hi + b_\lo \right \vert \right)$$ \end{theorem} \begin{proof} ~ \\ Without loss of generality, we can now suppose that $$\frac{1}{2} \cdot \left \vert a_\hi \right \vert \leq \left \vert b_\hi \right \vert \leq \left \vert a_\hi \right \vert$$ and that $a_\hi$ and $b_\hi$ have different signs because for all other cases, the properties we have to show are a direct consequence of theorems \ref{theoAddDDref} and \ref{theoAddDDrefborn}.\\ So we have $$\frac{1}{2} \cdot \left \vert a_\hi \right \vert \leq \left \vert b_\hi \right \vert \leq 2 \cdot \left \vert a_\hi \right \vert$$ and $$\frac{1}{2} \cdot \left \vert b_\hi \right \vert \leq \left \vert a_\hi \right \vert \leq 2 \cdot \left \vert b_\hi \right \vert$$ So the floating point operation $$t_1 = a_\hi \oplus b_\hi$$ is exact by Sterbenz' lemma \cite{Ste74}. In consequence, $t_3$ will be equal to $0$ because, as we have already mentioned, the operations computing $t_1$ and $t_3$ out of $a_\hi$ and $b_\hi$ constitute a \Add~ whose properties assure that $$t_3 = a_\hi + b_\hi - t_1$$ We can deduce that $$t_4 = t_3 \oplus b_\lo = b_\lo$$ and can finally check that $$t_5 = t_4 \oplus a_\lo = \left( t_4 + a_\lo \right) \cdot \left( 1 + \epsilon^* \right)$$ with $$\left \vert \epsilon^* \right \vert \leq 2^{-53}$$ So we get $$r_\hi + r_\lo = t_1 + t_5 = \left( a_\hi + a_\lo + b_\hi + b_\lo \right) + \delta$$ with $$\left \vert \delta \right \vert \leq 2^{-53} \cdot \left \vert a_\lo + b_\lo \right \vert$$ which yields to the bound to be proven $$\left \vert \delta \right \vert = \max\left( 2^{-53} \cdot \left \vert a_\lo + b_\lo \right \vert, 2^{-102} \cdot \left \vert a_\hi + a_\lo + b_\hi + b_\lo \right \vert \right)$$ \qed \end{proof} \begin{theorem}[Output overlap of algorithm \ref{addDDref} \AddDD] ~ \\ Let be $a_\hi + a_\lo$ and $b_\hi + b_\lo$ the double-double arguments of algorithm \ref{addDDref} \AddDD.\\ So the values $r_\hi$ and $r_\lo$ returned by the algorithm will not overlap at all and will verify $$\left \vert r_\lo \right \vert \leq 2^{-53} \cdot \left \vert r_\hi \right \vert$$ \end{theorem} \begin{proof} ~\\ The proof of the affirmed property is trivial because the procedure \AddDD~ ends by a call to sequence \Add~ which assures it.\qed \end{proof} \subsection{The multiplication operator \MulDD} Let us now consider the multiplication operator \MulDD: \begin{algorithm}[\MulDD] \label{mulDDref} ~ \\ {\bf In:} two double-double numbers, $a_\hi + a_\lo$ and $b_\hi + b_\lo$ \\ {\bf Out:} a double-double number $r_\hi + r_\lo$ \\ {\bf Preconditions on the arguments:} $$\left \vert a_\lo \right \vert \leq 2^{-53} \cdot \left \vert a_\hi \right \vert$$ $$\left \vert b_\lo \right \vert \leq 2^{-53} \cdot \left \vert b_\hi \right \vert$$ {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{50mm} $\left( t_1, t_2 \right) \gets \mMul\left( a_\hi, b_\hi \right)$ \\ $t_3 \gets a_\hi \otimes b_\lo$ \\ $t_4 \gets a_\lo \otimes b_\hi$ \\ $t_5 \gets t_3 \oplus t_4$ \\ $t_6 \gets t_2 \oplus t_5$ \\ $\left(r_\hi, r_\lo \right) \gets \mAdd\left( t_1, t_6 \right)$\\ \end{minipage} \end{center} \end{algorithm} Compare also to \cite{crlibmweb} concerning algorithm \ref{mulDDref}. \begin{theorem}[Relative error of algorithm \ref{mulDDref} \MulDD] ~ \\ Let be $a_\hi + a_\lo$ and $b_\hi + b_\lo$ the double-double arguments of algorithm \ref{mulDDref} \MulDD.\\ So the values returned $r_\hi$ and $r_\lo$ verify $$r_\hi + r_\lo = \left(\left(a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded as follows: $$\left \vert \epsilon \right \vert \leq 2^{-102}$$ Further $r_\hi$ and $r_\lo$ will not overlap at all and verify $$\left \vert r_\lo \right \vert \leq 2^{-53} \cdot \left \vert r_\hi \right \vert$$ \end{theorem} \begin{proof} ~ \\ Since algorithm \ref{mulDDref} ends by a call to the \Add~ procedure, the properties of the latter yield to the fact that $r_\hi$ and $r_\lo$ do not overlap at all and that $\left \vert r_\lo \right \vert \leq 2^{-53} \cdot \left \vert r_\hi \right \vert$.\\ In order to give upper bounds for the relative and absolute error of the algorithm, let us express $t_6$ as a function of $t_2$, $a_\hi$, $a_\lo$, $b_\hi$ and $b_\lo$ joined by the error term $\delta$.\\ We get \begin{eqnarray*} t_6 & = & t_2 \oplus \left( a_\hi \otimes b_\lo \oplus a_\lo \otimes b_\hi \right) \\ & = & \left( t_2 + \left(a_\hi \cdot b_\lo \cdot \left( 1 + \epsilon_1 \right) + a_\lo \cdot b_\hi \cdot \left( 1 + \epsilon_2 \right) \right) \cdot \left(1 + \epsilon_3 \right) \right)\cdot \left( 1 + \epsilon_4 \right) \end{eqnarray*} where $\left \vert \epsilon_i \right \vert \leq 2^{-53}$, $i=1,2,3,4$.\\ Simplifying this expression, we van verify that $$t_6 = t_2 + a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + \delta$$ with \begin{eqnarray*} \left \vert \delta \right \vert & \leq & \left \vert a_\lo \cdot b_\lo + a_\hi \cdot b_\lo \cdot \epsilon_1 + a_\lo \cdot b_\hi \cdot \epsilon_2 + a_\hi \cdot b_\lo \cdot \epsilon_3 + a_\hi \cdot b_\lo \cdot \epsilon_1 \cdot \epsilon_3 + a_\lo \cdot b_\hi \cdot \epsilon_3 + a_\lo \cdot b_\hi \cdot \epsilon_1 \cdot \epsilon_3 \right.\\ & & \left. + a_\hi \cdot b_\lo \cdot \epsilon_4 + a_\lo \cdot b_\hi \cdot \epsilon_4 + a_\hi \cdot b_\lo \cdot \epsilon_1 \cdot \epsilon_4 + a_\lo \cdot b_\hi \cdot \epsilon_2 \cdot \epsilon_4 + a_\hi \cdot b_\lo \cdot \epsilon_3 \cdot \epsilon_4 \right. \\ & & \left. + a_\hi \cdot b_\lo \cdot \epsilon_1 \cdot \epsilon_3 \cdot \epsilon_4 + a_\lo \cdot b_\hi \cdot \epsilon_3 \cdot \epsilon_4 + a_\lo \cdot b_\hi \cdot \epsilon_2 \cdot \epsilon_3 \cdot \epsilon_4 \right \vert \\ & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 7 \cdot 2^{-106} + 6 \cdot 2^{-159} + 2^{-211} \right) \\ & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot 2^{-103} \end{eqnarray*} For checking the given bound, we have supposed the following inequalities: $$\left \vert a_\lo \right \vert \leq 2^{-53} \cdot \left \vert a_\hi \right \vert$$ and $$\left \vert a_\lo \right \vert \leq 2^{-53} \cdot \left \vert a_\hi \right \vert$$ Let us now give a lower bound for $\left \vert \left( a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\lo \right)\right \vert$ as a function of $\left \vert a_\hi \cdot b_\hi \right \vert$. For doing so, we give an upper bound for $\left \vert a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\lo \right \vert$. \\ We verify since: \begin{eqnarray*} \left \vert a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\lo \right \vert & \leq & \left \vert a_\hi \cdot b_\lo \right \vert + \left \vert a_\lo \cdot b_\hi \right \vert + \left \vert a_\lo \cdot b_\lo \right \vert \\ & \leq & 2^{-53} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-53} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-106} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \\ & \leq & 2^{-51} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \end{eqnarray*} This yields to \begin{eqnarray*} \left \vert \left( a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\lo \right) \right \vert & \geq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left(1 - 2^{-51} \right) \\ & \geq & \frac{1}{2} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \end{eqnarray*} from which we deduce that $$\left \vert \delta \right \vert \leq 2^{-102} \cdot \left \vert \left( a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\lo \right) \right \vert$$ which gives us as an bound for the relative error $$r_\hi + r_\lo = \left( a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\lo \right) \cdot \left(1 + \epsilon \right)$$ with $\left \vert \epsilon \right \vert \leq 2^{-102}$. \qed \end{proof} \section{Addition operators for triple-double numbers} \subsection{The addition operator \AddTT} We are going to consider now the addition operator \AddTT. We will only analyse a simplified case where the arguments' values verify some bounds statically known. \begin{algorithm}[\AddTT] \label{addTTref} ~ \\ {\bf In:} two triple-double numbers, $a_\hi + a_\mi + a_\lo$ and $b_\hi + b_\mi + b_\lo$ \\ {\bf Out:} a triple-double number $r_\hi + r_\mi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert b_\hi \right \vert & \leq & \frac{3}{4} \cdot \left \vert a_\hi \right \vert \\ \left \vert a_\mi \right \vert & \leq & 2^{-\alpha_o} \cdot \left \vert a_\hi \right \vert \\ \left \vert a_\lo \right \vert & \leq & 2^{-\alpha_u} \cdot \left \vert a_\mi \right \vert \\ \left \vert b_\mi \right \vert & \leq & 2^{-\beta_o} \cdot \left \vert b_\hi \right \vert \\ \left \vert b_\lo \right \vert & \leq & 2^{-\beta_u} \cdot \left \vert b_\mi \right \vert \\ \alpha_o & \geq & 4 \\ \alpha_u & \geq & 1 \\ \beta_o & \geq & 4 \\ \beta_u & \geq & 1 \\ \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{50mm} $\left(r_\hi, t_1 \right) \gets \mAdd\left( a_\hi, b_\hi \right)$ \\ $\left(t_2, t_3 \right) \gets \mAdd\left( a_\mi, b_\mi \right)$ \\ $\left(t_7, t_4 \right) \gets \mAdd\left( t_1, t_2 \right)$ \\ $t_6 \gets a_\lo \oplus b_\lo$ \\ $t_5 \gets t_3 \oplus t_4$ \\ $t_8 \gets t_5 \oplus t_6$ \\ $\left( r_\mi, r_\lo \right) \gets \mAdd\left( t_7, t_8 \right)$ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{addTTref} \AddTT\label{theoAddTT}] ~ \\ Let be $a_\hi + a_\mi + a_\lo$ and $b_\hi + b_\mi + b_\lo$ the triple-double arguments of algorithm \ref{addTTref} \AddTT~ verifying the given preconditions.\\ So the following egality will hold for the returned values $r_\hi$, $r_\mi$ and $r_\lo$ $$r_\hi + r_\mi + r_\lo = \left(\left(a_\hi + a_\mi + a_\lo \right) + \left( b_\hi + b_\mi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded by: $$\left \vert \epsilon \right \vert \leq 2^{-\min\left(\alpha_o + \alpha_u,\beta_o + \beta_u\right) - 47} + 2^{-\min\left( \alpha_o, \beta_o\right) - 98}$$ The returned values $r_\mi$ and $r_\lo$ will not overlap at all and the overlap of $r_\hi$ and $r_\mi$ will be bounded by the following expression: $$\left \vert r_\mi \right \vert \leq 2^{-\min\left( \alpha_o, \beta_o \right) + 5} \cdot \left \vert r_\hi \right \vert$$ \end{theorem} \begin{proof} ~ \\ The procedure \ref{addTTref} ends by a call to the \Add~ sequence. One can trivially deduce that $r_\mi$ and $r_\lo$ do not overlap at all and verify $$\left \vert r_\lo \right \vert \leq 2^{-53} \cdot \left \vert r_\mi \right \vert$$ Further, it suffices that the bounds given at theorem \ref{theoAddTT} hold for $t_7$ and $t_8$ because the last addition computing $r_\mi$ and $r_\lo$ will be exact. The same way, one can deduce the following inequalities out of the properties of the \Add~ procedure. They will become useful during this proof. $$\left \vert t_1 \right \vert \leq 2^{-53} \cdot \left \vert r_\hi \right \vert$$ $$\left \vert t_3 \right \vert \leq 2^{-53} \cdot \left \vert t_2 \right \vert$$ $$\left \vert t_4 \right \vert \leq 2^{-53} \cdot \left \vert t_7 \right \vert$$ Let us start the proof by giving bounds for the magnitude of $r_\hi$ with regard to $a_\hi$:\\ We have on the one hand \begin{eqnarray*} \left \vert r_\hi \right \vert & = & \left \vert \circ\left( a_\hi + b_\hi \right) \right \vert \\ & = & \circ \left( \left \vert a_\hi + b_\hi \right \vert \right) \\ & \leq & \circ \left( \left \vert a_\hi \right \vert + \left \vert b_\hi \right \vert \right) \\ & \leq & \circ \left( \left \vert a_\hi \right \vert + \frac{3}{4} \cdot \left \vert a_\hi \right \vert \right) \\ & \leq & \circ \left( 2 \cdot \left \vert a_\hi \right \vert \right) \\ & = & 2 \cdot \left \vert a_\hi \right \vert \end{eqnarray*} and on the other \begin{eqnarray*} \left \vert r_\hi \right \vert & = & \circ \left( \left \vert a_\hi + b_\hi \right \vert \right) \\ & \geq & \circ \left( \frac{1}{4} \cdot \left \vert a_\hi \right \vert \right) \\ & = & \frac{1}{4} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} So we know that $\frac{1}{4} \cdot \left \vert a_\hi \right \vert \leq \left \vert r_\hi \right \vert \leq 2 \cdot \left \vert a_\hi \right \vert$.\\ It is now possible to give the following upper bounds for $\left \vert t_1 \right \vert$, $\left \vert t_2 \right \vert$, $\left \vert t_3 \right \vert$, $\left \vert t_7 \right \vert$, $\left \vert t_4 \right \vert$, $\left \vert t_6 \right \vert$ and $\left \vert t_6 \right \vert$: \begin{eqnarray*} \left \vert t_1 \right \vert & \leq & 2^{-53} \cdot \left \vert r_\hi \right \vert \\ & \leq & 2^{-53} \cdot 2^2 \cdot \left \vert a_\hi \right \vert \\ & = & 2^{-51} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} \begin{eqnarray*} \left \vert t_2 \right \vert & \leq & \circ \left( \left \vert a_\mi + b_\mi \right \vert \right) \\ & \leq & \circ \left( \left \vert a_\mi \right \vert + \left \vert b_\mi \right \vert \right) \\ & \leq & \circ \left( 2^{-\alpha_o} \cdot \left \vert a_\hi \right \vert + 2^{-\beta_o} \cdot \left \vert b_\hi \right \vert \right) \\ & \leq & \circ \left( 2^{-\alpha_o} \cdot \left \vert a_\hi \right \vert + 2^{-\beta_o} \cdot \frac{3}{4} \cdot \left \vert a_\hi \right \vert \right) \\ & \leq & \circ \left( 2^{-\min\left(\alpha_o,\beta_o\right) + 1} \cdot \left \vert a_\hi \right \vert \right) \\ & = & 2^{-\min\left(\alpha_o,\beta_o\right) + 1} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} \begin{eqnarray*} \left \vert t_3 \right \vert & \leq & 2^{-53} \cdot \left \vert t_2 \right \vert \\ & \leq & 2^{-53} \cdot 2^{-\min\left(\alpha_o,\beta_o\right) + 1} \cdot \left \vert a_\hi \right \vert \\ & = & 2^{-\min\left(\alpha_o,\beta_o\right)-52} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} \begin{eqnarray*} \left \vert t_7 \right \vert & \leq & \circ \left( \left \vert t_1 + t_2 \right \vert \right) \\ & \leq & \circ \left( \left \vert t_1 \right \vert + \left \vert t_2 \right \vert \right) \\ & \leq & \circ \left( 2^{-51} \cdot \left \vert a_\hi \right \vert + 2^{-\min\left(\alpha_o,\beta_o\right) + 1} \cdot \left \vert a_\hi \right \vert \right) \\ & \leq & \circ \left( 2^{-\min\left(\alpha_o,\beta_o\right) + 2} \cdot \left \vert a_\hi \right \vert \right) \\ & = & 2^{-\min\left(\alpha_o,\beta_o\right) + 2} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} \begin{eqnarray*} \left \vert t_4 \right \vert & \leq & 2^{-53} \cdot \left \vert t_7 \right \vert \\ & \leq & 2^{-53} \cdot 2^{-\min\left(\alpha_o,\beta_o\right)+2} \cdot \left \vert a_\hi \right \vert \\ & = & 2^{-\min\left(\alpha_o,\beta_o\right) -51} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} \begin{eqnarray*} \left \vert t_6 \right \vert & \leq & \circ \left( \left \vert a_\lo \right \vert + \left \vert b_\lo \right \vert \right) \\ & \leq & \circ \left( 2^{-\alpha_o} \cdot 2^{-\alpha_u} \cdot \left \vert a_\hi \right \vert + 2^{-\beta_o} \cdot 2^{-\beta_u} \cdot \frac{3}{4} \cdot \left \vert a_\hi \right \vert \right) \\ & \leq & \circ \left( 2^{-\min\left(\alpha_o + \alpha_u,\beta_o + \beta_u\right) + 1} \cdot \left \vert a_\hi \right \vert \right) \\ & = & 2^{-\min\left(\alpha_o + \alpha_u,\beta_o + \beta_u\right) + 1} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} and finally \begin{eqnarray*} \left \vert t_5 \right \vert & \leq & \circ \left( \left \vert t_3 \right \vert + \left \vert t_4 \right \vert \right) \\ & \leq & \circ \left( 2^{-\min\left(\alpha_o,\beta_o\right) -52} \cdot \left \vert a_\hi \right \vert + 2^{-\min\left(\alpha_o,\beta_o\right)-51} \cdot \left \vert a_\hi \right \vert \right) \\ & \leq & \circ \left( 2^{-\min\left(\alpha_o,\beta_o\right) -50} \cdot \left \vert a_\hi \right \vert \right) \\ & = & 2^{-\min\left(\alpha_o,\beta_o\right)-50} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} Using the fact that the addition \Add~ is exact, it is easy to show that we have exactly $$r_\hi + t_7 + t_3 + t_4 = a_\hi + a_\mi + b_\hi + b_\mi$$ Further, we can check \begin{eqnarray*} t_8 & = & \left( t_3 \oplus_2 t_4 \right) \oplus_1 \left( a_\lo \oplus_3 b_\lo \right) \\ & = & t_3 + t_4 + a_\lo + b_\lo + \delta \end{eqnarray*} with \begin{eqnarray*} \left \vert \delta \right \vert & \leq & \left \vert t_3 \right \vert \cdot \epsilon_3 + \left \vert t_4 \right \vert \cdot \epsilon_2 + \left \vert a_\lo \right \vert \cdot \epsilon_3 + \left \vert b_\lo \right \vert \cdot \epsilon_3 + \left \vert t_3 \right \vert \cdot \epsilon_1 + \left \vert t_4 \right \vert \cdot \epsilon_1 + \left \vert t_3 \right \vert \cdot \epsilon_1 \cdot \epsilon_2 \\ & & + \left \vert t_4 \right \vert \cdot \epsilon_1 \cdot \epsilon_2 + \left \vert a_\lo \right \vert \cdot \epsilon_1 + \left \vert b_\lo \right \vert \cdot \epsilon_2 + \left \vert a_\lo \right \vert \cdot \epsilon_1 \cdot \epsilon_3 + \left \vert b_\lo \right \vert \cdot \epsilon_1 \cdot \epsilon_3 \end{eqnarray*} where for $i\in\left\lbrace 1,2,3 \right\rbrace$, $\epsilon_i$ is the relative error bound of the floating point addition $\oplus_i$ and verifies $$\left \vert \epsilon_i \right \vert \leq 2^{-53}$$ So we get immediately $$r_\hi + r_\mi + r_\lo = r_\hi + t_7 + t_8 = \left( a_\hi + a_\mi + a_\lo \right) + \left( b_\hi + b_\mi + b_\lo \right) + \delta$$ Let us now express $\left \vert \left( a_\hi + a_\mi + a_\lo \right) + \left( b_\hi + b_\mi + b_\lo \right) \right \vert$ as a function of $\left \vert a_\hi \right \vert$: \begin{eqnarray*} \left \vert a_\hi + a_\mi + a_\lo \right \vert & \leq & \left \vert a_\hi \right \vert + \left \vert a_\mi \right \vert + \left \vert a_\lo \right \vert \\ & \leq & \left \vert a_\hi \right \vert + 2^{-\alpha_o} \cdot \left \vert a_\hi \right \vert + 2^{-\alpha_o-\alpha_u} \cdot \left \vert a_\hi \right \vert \\ & \leq & 2 \cdot \left \vert a_\hi \right \vert \end{eqnarray*} and, the same way round, \begin{eqnarray*} \left \vert b_\hi + b_\mi + b_\lo \right \vert & \leq & 2 \cdot \left \vert b_\hi \right \vert \\ & \leq & \frac{3}{2} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} which allows for noting $$\left \vert \left( a_\hi + a_\mi + a_\lo \right) + \left( b_\hi + b_\mi + b_\lo \right) \right \vert \leq 2^2 \cdot \left \vert a_\hi \right \vert$$ In order to give a lower bound for this term, let us prove an upper bound for $\left \vert b_\hi + a_\mi + b_\mi + a_\lo + b_\lo \right \vert$ as follows \begin{eqnarray*} \left \vert b_\hi + a_\mi + b_\mi + a_\lo + b_\lo \right \vert & \leq & \left \vert b_\hi \right \vert + \left \vert a_\mi \right \vert + \left \vert b_\mi \right \vert + \left \vert a_\lo \right \vert + \left \vert b_\lo \right \vert \\ & \leq & \frac{3}{4} \cdot \left \vert a_\hi \right \vert + 2^{-\alpha_o} \cdot \left \vert a_\hi \right \vert + 2^{-\beta_o} \cdot \frac{3}{4} \cdot \left \vert a_\hi \right \vert + 2^{-\alpha_o-\alpha_u} \cdot \left \vert a_\hi \right \vert \\ & & + 2^{-\beta_o-\beta_u} \cdot \frac{3}{4} \cdot \left \vert a_\hi \right \vert \\ & \leq & \frac{7}{8} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} So we get $$\left \vert \left( a_\hi + a_\mi + a_\lo \right) + \left( b_\hi + b_\mi + b_\lo \right) \right \vert \geq \frac{1}{8} \cdot \left \vert a_\hi \right \vert$$ Using this bounds, we can give upper bounds for the absolute error $\left \vert \delta \right \vert$ first as a function of $\left \vert a_\hi \right \vert$ and than as a function of $\left \vert \left( a_\hi + a_\mi + a_\lo \right) + \left( b_\hi + b_\mi + b_\lo \right) \right \vert$ for deducing finally a bound for the relative error. \\ So we get \begin{eqnarray*} \left \vert \delta \right \vert & \leq & \left \vert t_3 \right \vert \cdot \epsilon_3 + \left \vert t_4 \right \vert \cdot \epsilon_2 + \left \vert a_\lo \right \vert \cdot \epsilon_3 + \left \vert b_\lo \right \vert \cdot \epsilon_3 + \left \vert t_3 \right \vert \cdot \epsilon_1 + \left \vert t_4 \right \vert \cdot \epsilon_1 + \left \vert t_3 \right \vert \cdot \epsilon_1 \cdot \epsilon_2 \\ & & + \left \vert t_4 \right \vert \cdot \epsilon_1 \cdot \epsilon_2 + \left \vert a_\lo \right \vert \cdot \epsilon_1 + \left \vert b_\lo \right \vert \cdot \epsilon_2 + \left \vert a_\lo \right \vert \cdot \epsilon_1 \cdot \epsilon_3 + \left \vert b_\lo \right \vert \cdot \epsilon_1 \cdot \epsilon_3 \\ & \leq & \left \vert a_\hi \right \vert \cdot \epsilon^\prime \end{eqnarray*} with \begin{eqnarray*} \epsilon^\prime & \leq & 2^{-53} \cdot 2^{-\min\left(\alpha_o,\beta_o\right)-52} \\ & + & 2^{-53} \cdot 2^{-\min\left(\alpha_o,\beta_o\right)-51} \\ & + & 2^{-53} \cdot 2^{-\alpha_o-\alpha_u} \\ & + & 2^{-53} \cdot 2^{-\beta_o-\beta_u} \\ & + & 2^{-53} \cdot 2^{-\min\left(\alpha_o,\beta_o\right)-52} \\ & + & 2^{-53} \cdot 2^{-\min\left(\alpha_o,\beta_o\right)-51} \\ & + & 2^{-106} \cdot 2^{-\min\left(\alpha_o,\beta_o\right)-52} \\ & + & 2^{-106} \cdot 2^{-\min\left(\alpha_o,\beta_o\right)-51} \\ & + & 2^{-53} \cdot 2^{-\alpha_o-\alpha_u} \\ & + & 2^{-53} \cdot 2^{-\beta_o-\beta_u} \\ & + & 2^{-106} \cdot 2^{-\alpha_o-\alpha_u} \\ & + & 2^{-106} \cdot 2^{-\beta_o-\beta_u} \\ & \leq & 2^{-\min\left(\alpha_o,\beta_o\right)-101} + 2^{-\min\left(\alpha_o+\alpha_u,\beta_o+\beta_u\right)-50} \end{eqnarray*} This yields to $$r_\hi + r_\mi + r_\lo = \left( \left( a_\hi + a_\mi + a_\lo \right) + \left( b_\hi + b_\mi + b_\lo \right) \right) \cdot \left(1 + \epsilon \right)$$ with $$\left \vert \epsilon \right \vert \leq 2^{-\min\left(\alpha_o,\beta_o\right)-98} + 2^{-\min\left(\alpha_o+\alpha_u,\beta_o+\beta_u\right)-47}$$ In order to finish the prove, it suffices now to give an upper bound for the maximal overlap between $r_\hi$ and $r_\mi$ because we have already shown that $r_\mi$ and $r_\lo$ do not overlap at all.\\ So we can check \begin{eqnarray*} \left \vert r_8 \right \vert & \leq & \circ \left( \left \vert t_5 \right \vert + \left \vert t_6 \right \vert \right) \\ & \leq & \circ \left( 2^{-\min\left(\alpha_o,\beta_o\right)-50} \cdot \left \vert a_\hi \right \vert + 2^{-\min\left(\alpha_o+\alpha_u,\beta_o+\beta_u\right)+1} \cdot \left \vert a_\hi \right \vert \right)\\ & \leq & \circ \left( 2^{-\min\left(\alpha_o,\beta_o\right)-48} \cdot \left \vert r_\hi \right \vert + 2^{-\min\left(\alpha_o+\alpha_u,\beta_o+\beta_u\right)+3} \cdot \left \vert r_\hi \right \vert \right) \end{eqnarray*} and continue by giving the following upper bound \begin{eqnarray*} \left \vert r_\mi \right \vert & = & \circ \left( \left \vert t_7 + t_8 \right \vert \right) \\ & \leq & \circ \left( \left \vert t_7 \right \vert + \left \vert t_8 \right \vert \right) \\ & \leq & \circ \left( 2^{-\min\left(\alpha_o,\beta_o\right)+4} \cdot \left \vert r_\hi \right \vert + \circ \left( 2^{-\min\left(\alpha_o,\beta_o\right)-48} \cdot \left \vert r_\hi \right \vert + 2^{-\min\left(\alpha_o+\alpha_u,\beta_o+\beta_u\right)+3} \cdot \left \vert r_\hi \right \vert \right) \right) \\ & \leq & \circ \left( \left \vert r_\hi \right \vert \cdot \left( 2^{-\min\left(\alpha_o,\beta_u\right)+4} + 2^{-\min\left(\alpha_o,\beta_o\right)-48} + 2^{-\min\left(\alpha+\alpha_u,\beta_o+\beta_u\right)+3} + \right. \right. \\ & & \left. \left. 2^{-\min\left(\alpha_o,\beta_o\right) -101} + 2^{-\min\left(\alpha_o+\alpha_u,\beta_o+\beta_u\right)-50} \right) \right) \\ & \leq & 2^{-\min\left(\alpha_o,\beta_o\right)+5} \cdot \left \vert r_\hi \right \vert \end{eqnarray*} This is the maximal overlap bound we were looking for; the proof is therefore finished.\qed \end{proof} \begin{theorem}[Special case of algorithm \ref{addTTref} \AddTT] ~ \\ Let be $a_\hi + a_\mi + a_\lo$ and $b_\hi + b_\mi + b_\lo$ the triple-double arguments of algorithm \ref{addTTref} \AddTT~ such that $$a_\hi = a_\mi = a_\lo = 0$$ So the values $r_\hi$, $r_\mi$ and $r_\lo$ returned will be exactly equal to $$r_\hi + r_\mi + r_\lo = b_\hi + b_\mi + b_\lo$$ The values $r_\mi$ and $r_\lo$ will not overlap at all. The overlap of $r_\hi$ and $r_\mi$ must still be evaluated. \end{theorem} \begin{proof} ~\\ We will suppose that the \Add~ procedure is exact for $a_\hi=a_\mi=a_\lo=0$ if even we are using its unconditional version. Under this hypothesis, we get thus: \begin{eqnarray*} r_\hi & = & \circ \left( 0 + b_\hi \right) = b_\hi \\ t_1 & = & 0 + b_\hi - b_\hi = 0 \\ t_2 & = & b_\mi \\ t_3 & = & 0 \\ t_7 & = & \circ \left( 0 + b_\mi \right) = b_\mi \\ t_4 & = & 0 \\ t_6 & = & 0 \oplus b_\lo = b_\lo \\ t_5 & = & 0 \oplus 0 = 0 \\ t_8 & = & 0 \oplus b_\lo = b_\lo \\ r_\mi + r_\lo & = & b_\mi + b_\lo \end{eqnarray*} In consequence, the following holds for the values returned: $$r_\hi + r_\mi + r_\lo = b_\hi + b_\mi + b_\lo$$ Clearly $r_\mi$ and $r_\lo$ do not overlap because the \Add~ procedure the algorithm calls at its last line assures this property.\qed \end{proof} \subsection{The addition operator \AddDTT} Let us consider now the addition operator \AddDTT. We will only analyse a simplified case where the arguments of the algorithm verify statically known bounds. \begin{algorithm}[\AddDTT] \label{addDTTref} ~ \\ {\bf In:} a double-double number $a_\hi + a_\lo$ and a triple-double number $b_\hi + b_\mi + b_\lo$ \\ {\bf Out:} a triple-double number $r_\hi + r_\mi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert b_\hi \right \vert & \leq & 2^{-2} \cdot \left \vert a_\hi \right \vert \\ \left \vert a_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert a_\hi \right \vert \\ \left \vert b_\mi \right \vert & \leq & 2^{-\beta_o} \cdot \left \vert b_\hi \right \vert \\ \left \vert b_\lo \right \vert & \leq & 2^{-\beta_u} \cdot \left \vert b_\mi \right \vert \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{50mm} $\left( r_\hi, t_1 \right) \gets \mAdd\left( a_\hi, b_\hi \right)$ \\ $\left( t_2, t_3 \right) \gets \mAdd\left( a_\lo, b_\mi \right)$ \\ $\left( t_4, t_5 \right) \gets \mAdd\left( t_1, t_2 \right)$ \\ $t_6 \gets t_3 \oplus b_\lo$ \\ $t_7 \gets t_6 \oplus t_5$ \\ $\left( r_\mi, r_\lo \right) \gets \mAdd\left( t_4, t_7 \right)$ \\ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{addDTTref} \AddDTT] ~ \\ Let be $a_\hi + a_\lo$ and $b_\hi + b_\mi + b_\lo$ the values taken in argument of algorithm \ref{addDTTref} \AddDTT. Let the preconditions hold for this values.\\ So the following holds for the values returned by the algorithm $r_\hi$, $r_\mi$ and $r_\lo$ $$r_\hi + r_\mi + r_\lo = \left(\left(a_\hi + a_\mi + a_\lo \right) + \left( b_\hi + b_\mi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded by $$\left \vert \epsilon \right \vert \leq 2^{-\beta_o - \beta_u - 52} + 2^{-\beta_o - 104} + 2^{-153}$$ The values $r_\mi$ and $r_\lo$ will not overlap at all and the overlap of $r_\hi$ and $r_\mi$ will be bounded by: $$\left \vert r_\mi \right \vert \leq 2^{-\gamma} \cdot \left \vert r_\hi \right \vert$$ with $$\gamma \geq \min\left( 45, \beta_o - 4, \beta_o + \beta_u - 2 \right)$$ \end{theorem} \begin{proof} ~ \\ We know using the properties of the \Add~ procedure that \begin{eqnarray*} r_\hi + t_1 & = & a_\hi + b_\hi \\ t_2 + t_3 & = & a_\lo + b_\mi \\ t_4 + t_5 & = & t_1 + t_2 \\ r_\mi + r_\lo = t_4 + t_7 \end{eqnarray*} Supposing that we dispose already of a term of the following form $$t_7 = t_5 + t_3 + b_\lo + \delta$$ with a bounded $\left \vert \delta \right \vert$, we can note that $$r_\hi + r_\mi + r_\lo = \left( a_\hi + a_\lo \right) + \left( b_\hi + b_\mi + b_\lo \right) + \delta$$ Let us now express $t_7$ by $t_5$, $t_3$ and $b_\lo$: \begin{eqnarray*} t_7 & = & t_5 \oplus t_6 \\ & = & t_5 \oplus \left( t_3 \oplus b_\lo \right) \\ & = & \left( t_5 + \left( t_3 + b_\lo \right) \cdot \left( 1 + \epsilon_1 \right) \right) \cdot \left( 1 + \epsilon_2 \right) \end{eqnarray*} with $\left \vert \epsilon_1 \right \vert \leq 2^{-53}$ and $\left \vert \epsilon_2 \right \vert \leq 2^{-53}$.\\ We get in consequence $$t_7 = t_5 + t_3 + b_\lo + t_3 \cdot \epsilon_1 + b_\lo \cdot \epsilon_1 + t_5 \cdot \epsilon_2 + t_3 \cdot \epsilon_2 + b_\lo \cdot \epsilon_2 + t_3 \cdot \epsilon_1 \cdot \epsilon_2 + b_\lo \cdot \epsilon_1 \cdot \epsilon_2$$ and we can verify that the following upper bound holds for the absolute error $\delta$: \begin{eqnarray*} \left \vert \delta \right \vert & = & \left \vert t_3 \cdot \epsilon_1 + b_\lo \cdot \epsilon_1 + t_5 \cdot \epsilon_2 + t_3 \cdot \epsilon_2 + b_\lo \cdot \epsilon_2 + t_3 \cdot \epsilon_1 \cdot \epsilon_2 + b_\lo \cdot \epsilon_1 \cdot \epsilon_2 \right \vert \\ & \leq & 2^{-53} \cdot \left \vert t_3 \right \vert + 2^{-53} \cdot \left \vert b_\lo \right \vert + 2^{-53} \cdot \left \vert t_5 \right \vert + 2^{-53} \cdot \left \vert b_\lo \right \vert + 2^{-106} \cdot \left \vert t_3 \right \vert + 2^{-106} \cdot \left \vert b_\lo \right \vert \\ & \leq & 2^{-52} \cdot \left \vert t_3 \right \vert + 2^{-51} \cdot \left \vert b_\lo \right \vert + 2^{-53} \cdot \left \vert t_5 \right \vert \end{eqnarray*} Let us get now some bounds for $\left \vert t_3 \right \vert$, $\left \vert b_\lo \right \vert$ and $\left \vert t_5 \right \vert$, all as a function of $\left \vert a_\hi \right \vert$: $$\left \vert b_\lo \right \vert \leq 2^{-\beta_o-\beta_u} \cdot \left \vert b_\hi \right \vert \leq 2^{-\beta_o-\beta_u-2} \cdot \left \vert a_\hi \right \vert$$ which can be obtained using the preconditions' hypotheses. Further \begin{eqnarray*} \left \vert t_3 \right \vert & \leq & 2^{-53} \cdot \left \vert t_2 \right \vert \\ & = & 2^{-53} \cdot \left \vert \circ \left( a_\lo + b_\mi \right) \right \vert \\ & \leq & 2^{-52} \cdot \left \vert a_\lo + b_\mi \right \vert \\ & \leq & 2^{-52} \cdot \left \vert a_\lo \right \vert + 2^{-52} \cdot \left \vert b_\mi \right \vert \\ & \leq & 2^{-105} \cdot \left \vert a_\hi \right \vert + 2^{-\beta_o-52} \cdot \left \vert b_\hi \right \vert \\ & \leq & 2^{-105} \cdot \left \vert a_\hi \right \vert + 2^{-\beta_o-54} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} and finally \begin{eqnarray*} \left \vert t_5 \right \vert & \leq & 2^{-53} \cdot \left \vert t_4 \right \vert \\ & = & 2^{-53} \cdot \left \vert \circ \left( t_1 + t_2 \right) \right \vert \\ & \leq & 2^{-52} \cdot \left \vert t_1 + t_2 \right \vert \\ & \leq & 2^{-52} \cdot \left \vert t_1 \right \vert + 2^{-52} \cdot \left \vert t_2 \right \vert \\ & \leq & 2^{-105} \cdot \left \vert r_\hi \right \vert + 2^{-52} \cdot \left \vert \circ \left( a_\lo + b_\mi \right) \right \vert \\ & \leq & 2^{-105} \cdot \left \vert \circ \left( a_\hi + b_\hi \right) \right \vert + 2^{-51} \cdot \left \vert a_\lo + b_\mi \right \vert \\ & \leq & 2^{-104} \cdot \left \vert a_\hi + b_\hi \right \vert + 2^{-51} \cdot \left \vert a_\lo \right \vert + 2^{-51} \cdot \left \vert b_\mi \right \vert \\ & \leq & 2^{-104} \cdot \left \vert a_\hi \right \vert + 2^{-106} \cdot \left \vert a_\hi \right \vert + 2^{-104} \cdot \left \vert a_\hi \right \vert + 2^{-\beta_o-53} \cdot \left \vert a_\hi \right \vert \\ & \leq & \left \vert a_\hi \right \vert \cdot \left( 2^{-102} + 2^{-\beta_o -53} \right) \end{eqnarray*} So we have \begin{eqnarray*} \left \vert \delta \right \vert & \leq & \left \vert a_\hi \right \vert \cdot \left( 2^{-157} + 2^{-\beta_o-106} + 2^{-\beta_o-\beta_u-53} + 2^{-155} + 2^{-\beta_o-106} \right) \\ & \leq & \left \vert a_\hi \right \vert \cdot \left( 2^{-\beta_o-\beta_u-53} + 2^{-\beta_o-105} + 2^{-154} \right) \end{eqnarray*} Let us now give a lower bound for $\left \vert \left( a_\hi + a_\lo \right) + \left( b_\hi + b_\mi + b_\lo \right) \right \vert$ as a function of $\left \vert a_\hi \right \vert$ by getting out an upper bound for $\left \vert a_\lo + b_\hi + b_\mi + b_\lo \right \vert$ as such a function: \begin{eqnarray*} \left \vert a_\lo + b_\hi + b_\mi + b_\lo \right \vert & \leq & \left \vert a_\lo \right \vert + \left \vert b_\hi \right \vert + \left \vert b_\mi \right \vert + \left \vert b_\lo \right \vert \\ & \leq & \left \vert a_\hi \right \vert \cdot \left( 2^{-53} + 2^{-2} + 2^{-\beta_o-2} + 2^{-\beta_o-\beta_u-2} \right) \end{eqnarray*} Since $\beta_o \geq 1$, $\beta_u \geq 1$ we can check that $$\left \vert a_\lo + b_\hi + b_\mi + b_\lo \right \vert \leq 2^{-1} \cdot \left \vert a_\hi \right \vert$$ In consequence $$\left \vert a_\hi + \left( a_\lo + b_\hi + b_\mi + b_\lo \right) \right \vert \geq \frac{1}{2} \cdot \left \vert a_\hi \right \vert$$ Using this lower bound, we can finally give an upper bound for the relative error $\epsilon$ of the considered procedure: $$r_\hi + r_\mi + r_\lo = \left( \left( a_\hi + a_\lo \right) + \left( b_\hi + b_\mi + b_\lo \right) \right) \cdot \left( 1 + \epsilon \right)$$ with $$\left \vert \epsilon \right \vert \leq 2^{-\beta_o-\beta_u-52} + 2^{-\beta_o-104} + 2^{-153}$$ Last but not least, let us now analyse the additional overlaps generated by the procedure. It is clear that $r_\mi$ and $r_\lo$ do not overlap at all because they are computed by the \Add~ procedure. Let us merely examine now the overlap of $r_\hi$ and $r_\mi$. \\ We begin by giving a lower bound for $r_\hi$ as a function of $a_\hi$: \begin{eqnarray*} \left \vert r_\hi \right \vert & = & \left \vert \circ \left( a_\hi + b_\hi \right) \right \vert \\ & \geq & \circ \left( \left \vert a_\hi + b_\hi \right \vert \right) \\ & \geq & \circ \left( \frac{3}{4} \cdot \left \vert a_\hi \right \vert \right) \\ & \geq & \circ \left( \frac{1}{2} \cdot \left \vert a_\hi \right \vert \right) \\ & = & \frac{1}{2} \cdot \left \vert a_\hi \right \vert \end{eqnarray*} Let us then find an upper bound for $\left \vert r_\mi \right \vert$ using also here a term which is a function of $\left \vert a_\hi \right \vert$: \begin{eqnarray*} \left \vert r_\mi \right \vert & = & \left \vert \circ \left( r_\mi + r_\lo \right) \right \vert \\ & \leq & 2 \cdot \left \vert r_\mi + r_\lo \right \vert \\ & = & 2 \cdot \left \vert t_4 + t_7 \right \vert \\ & \leq & 2 \cdot \left \vert t_4 \right \vert + 2 \cdot \left \vert t_5 + t_3 + b_\lo + \delta \right \vert \\ & \leq & 2 \cdot \left \vert t_4 \right \vert + 2 \cdot \left \vert t_5 \right \vert + 2 \cdot \left \vert t_3 \right \vert + 2 \cdot \left \vert b_\lo \right \vert + 2 \cdot \left \vert \delta \right \vert \\ & \leq & 2 \cdot \left \vert t_4 \right \vert + \left \vert a_\hi \right \vert \cdot \left( 2^{-101} + 2^{-\beta_o-52} \right) \\ & & + \left \vert a_\hi \right \vert \cdot \left( 2^{-104} + 2^{-\beta_o-53} \right) + \left \vert a_\hi \right \vert \cdot 2^{-\beta_o-\beta_u-1} \\ & & + \left \vert a_\hi \right \vert \cdot \left( 2^{-\beta_o-\beta_u-52} + 2^{-\beta_o-104} + 2^{-153}\right) \end{eqnarray*} By bounding finally still $\left \vert t_4 \right \vert$ by a term that is function of $\left \vert a_\hi \right \vert$ \begin{eqnarray*} \left \vert t_4 \right \vert & = & \left \vert \circ \left( t_1 + t_2 \right) \right \vert \\ & \leq & 2 \cdot \left \vert t_1 \right \vert + 2 \cdot \left \vert t_2 \right \vert \\ & \leq & 2^{-52} \cdot \left \vert r_\hi \right \vert + 2 \cdot \left \vert \circ \left( a_\lo + b_\mi \right) \right \vert \\ & \leq & 2^{-51} \cdot \left \vert a_\hi + b_\hi \right \vert + 4 \cdot \left \vert a_\lo + b_\mi \right \vert \\ & \leq & \left \vert a_\hi \right \vert \cdot \left( 2^{-\beta_o} + 2^{-49} \right) \end{eqnarray*} we obtain \begin{eqnarray*} \left \vert r_\hi \right \vert & \leq & \left \vert a_\hi \right \vert \cdot \left( 2^{-48} \right. \\ & & + 2^{-\beta_o+1} \\ & & + 2^{-101} \\ & & + 2^{-\beta_o-52} \\ & & + 2^{-104} \\ & & + 2^{-\beta_o-53} \\ & & + 2^{-\beta_o-\beta_u-1} \\ & & + 2^{-\beta_o-\beta_u-52} \\ & & + 2^{-\beta_o-104} \\ & & \left. + 2^{-153} \right) \\ & \leq & \left \vert a_\hi \right \vert \cdot \left( 2^{-47} + 2^{-\beta_o+2} + 2^{-\beta_o-\beta_u} \right) \end{eqnarray*} We finally check that we have $$\left \vert r_\mi \right \vert \leq \left \vert r_\hi \right \vert \cdot \left( 2^{-46} + 2^{-\beta_o+3} + 2^{-\beta_o-\beta_u+1} \right)$$ from which we can deduce the following bound $$\left \vert r_\mi \right \vert \leq 2^{-\gamma} \cdot \left \vert r_\hi \right \vert$$ with $$\gamma \geq \min\left( 45, \beta_o-4, \beta_o+\beta_u-2 \right)$$ This finishes the proof.\qed \end{proof} \section{Triple-double multiplication operators} \subsection{The multiplication procedure \MulDT} Let us go on with an analysis of the multiplication procedure \MulDT. \begin{algorithm}[\MulDT] \label{mulDTref} ~ \\ {\bf In:} two double-double numbers $a_\hi + a_\lo$ and $b_\hi + b_\lo$ \\ {\bf Out:} a triple-double number $r_\hi + r_\mi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert a_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert a_\hi \right \vert \\ \left \vert b_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert b_\hi \right \vert \\ \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{50mm} $\left( r_\hi, t_1 \right) \gets \mMul\left( a_\hi, b_\hi \right)$ \\ $\left( t_2, t_3 \right) \gets \mMul\left( a_\hi, b_\lo \right)$ \\ $\left( t_4, t_5 \right) \gets \mMul\left( a_\lo, b_\hi \right)$ \\ $t_6 \gets a_\lo \otimes b_\lo$ \\ $\left( t_7, t_8 \right) \gets \mAddDD\left( t_2, t_3, t_4, t_5 \right)$ \\ $\left( t_9, t_{10} \right) \gets \mAdd\left( t_1, t_6 \right)$ \\ $\left( r_\mi, r_\lo \right) \gets \mAddDD\left( t_7, t_8, t_9, t_{10} \right)$ \\ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{mulDTref} \MulDT] ~ \\ Let be $a_\hi + a_\lo$ and $b_\hi + b_\lo$ the values taken by arguments of algorithm \ref{mulDTref} \MulDT \\ So the following holds for the values returned $r_\hi$, $r_\mi$ and $r_\lo$: $$r_\hi + r_\mi + r_\lo = \left(\left(a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded as follows: $$\left \vert \epsilon \right \vert \leq 2^{-149}$$ The values returned $r_\mi$ and $r_\lo$ will not overlap at all and the overlap of $r_\hi$ and $r_\mi$ will be bounded as follows: $$\left \vert r_\mi \right \vert \leq 2^{-48} \cdot \left \vert r_\hi \right \vert$$ \end{theorem} \begin{proof} ~ \\ Since algorithm \ref{mulDTref} is relatively long, we will proceed by analysing sub-sequences. So let us consider first the following sequence: \begin{center} \begin{minipage}[b]{50mm} $\left( t_2, t_3 \right) \gets \mMul\left( a_\hi, b_\lo \right)$ \\ $\left( t_4, t_5 \right) \gets \mMul\left( a_\lo, b_\hi \right)$ \\ $\left( t_7, t_8 \right) \gets \mAddDD\left( t_2, t_3, t_4, t_5 \right)$ \end{minipage} \end{center} Clearly $t_7$ and $t_8$ will not overlap. The same way $t_2$ and $t_3$ and $t_4$ and $t_5$ will not overlap and we know that we have exactly the following egalities \begin{eqnarray*} t_2 + t_3 & = & a_\hi \cdot b_\lo \\ t_4 + t_5 & = & b_\hi \cdot a_\lo \end{eqnarray*} Further we can check that \begin{eqnarray*} \left \vert t_3 \right \vert & \leq & 2^{-53} \cdot \left \vert \circ \left( a_\hi \cdot b_\lo \right) \right \vert \\ & \leq & 2^{-52} \cdot \left \vert a_\hi \cdot b_\lo \right \vert \end{eqnarray*} and similarly $$\left \vert t_5 \right \vert \leq 2^{-52} \cdot \left \vert b_\hi \cdot a_\lo \right \vert$$ So we have on the one side \begin{eqnarray*} 2^{-53} \cdot \left \vert t_3 + t_5 \right \vert & \leq & 2^{-53} \cdot \left \vert t_3 \right \vert + 2^{-53} \cdot \left \vert t_5 \right \vert \\ & \leq & 2^{-105} \cdot \left \vert a_\hi \cdot b_\lo \right \vert + 2^{-105} \cdot \left \vert b_\hi \cdot a_\lo \right \vert \end{eqnarray*} and on the other \begin{eqnarray*} 2^{-102} \cdot \left \vert t_2 + t_3 + t_4 + t_5 \right \vert & \leq & 2^{-102} \cdot \left \vert b_\hi \cdot a_\lo + a_\hi \cdot b_\lo \right \vert \\ & \leq & 2^{-102} \cdot \left \vert b_\hi \cdot a_\lo \right \vert + 2^{-102} \cdot \left \vert a_\hi \cdot b_\lo \right \vert \end{eqnarray*} Using theorem \ref{addDDerrabs} it is possible to note $$t_7 + t_8 = a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + \delta_1$$ with $$\left \vert \delta_1 \right \vert \leq 2^{-102} \cdot \left \vert a_\hi \cdot b_\lo \right \vert + 2^{-102} \cdot \left \vert a_\lo \cdot b_\hi \right \vert$$ Let us now consider the following sub-sequence of algorithm \ref{mulDTref}: \begin{center} \begin{minipage}[b]{50mm} $\left( r_\hi, t_1 \right) \gets \mMul\left( a_\hi, b_\hi \right)$ \\ $t_6 \gets a_\lo \otimes b_\lo$ \\ $\left( t_9, t_{10} \right) \gets \mAdd\left( t_1, t_6 \right)$ \end{minipage} \end{center} Trivially $t_9$ and $t_{10}$ do not overlap. Additionally, one sees that we have exactly $$r_\hi + t_1 = a_\hi \cdot b_\hi$$ and, exactly too, $$t_9 + t_{10} = t_1 + t_6$$ So using $$t_6 = a_\lo \otimes b_\lo = a_\lo \cdot b_\lo \cdot \left( 1 + \epsilon \right)$$ where $\left \vert \epsilon \right \vert \leq 2^{-53}$ we get \begin{eqnarray*} r_\hi + t_9 + t_{10} & = & r_\hi + t_1 + t_6 \\ & = & a_\hi \cdot b_\hi + t_6 \\ & = & a_\hi \cdot b_\hi + a_\lo \cdot b_\lo + \delta_2 \end{eqnarray*} with $$\left \vert \delta_2 \right \vert \leq 2^{-53} \cdot \left \vert a_\lo \cdot b_\lo \right \vert$$ Let us now bound $\left \vert t_9 \right \vert$ with regard to $\left \vert a_\hi \cdot b_\hi \right \vert$:\\ We have \begin{eqnarray*} \left \vert t_9 \right \vert & \leq & \circ \left( \left \vert t_1 \right \vert + \left \vert t_6 \right \vert \right) \\ & \leq & \circ \left( \left \vert t_1 \right \vert + \circ \left( \left \vert a_\lo \cdot b_\lo \right \vert \right) \right) \\ & \leq & \circ \left( \left \vert t_1 \right \vert + \circ \left( 2^{-106} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \right) \right) \\ & \leq & \circ \left( 2^{-53} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-105} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \right) \\ & \leq & 2^{-51} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \end{eqnarray*} With inequalities given, we can bound now the absolute and relative error of algorithm \MulDT~ \ref{mulDTref}. \\ We know already that $$t_7 + t_8 = a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + \delta_1$$ where $$\left \vert \delta_1 \right \vert \leq 2^{-102} \cdot \left \vert a_\hi \cdot b_\lo \right \vert + 2^{-102} \cdot \left \vert b_\hi \cdot a_\lo \right \vert$$ and $$r_\hi + t_9 + t_{10} = a_\hi \cdot b_\hi + a_\lo \cdot b_\lo + \delta_2$$ where $$\left \vert \delta_2 \right \vert \leq 2^{-53} \cdot \left \vert a_\lo \cdot b_\lo \right \vert$$ One remarks that \begin{eqnarray*} \left \vert t_8 \right \vert & \leq & 2^{-53} \cdot \left \vert t_7 \right \vert \\ \left \vert t_{10} \right \vert & \leq & 2^{-53} \cdot \left \vert t_9 \right \vert \end{eqnarray*} and easily checks that $$2^{-53} \cdot \left \vert t_{10} + t_8 \right \vert \leq 2^{-101} \cdot \left \vert t_9 \right \vert + 2^{-101} \cdot \left \vert t_7 \right \vert$$ and that $$2^{-102} \cdot \left \vert t_9 + t_{10} + t_7 + t_8 \right \vert \leq 2^{-101} \cdot \left \vert t_9 \right \vert + 2^{-101} \cdot \left \vert t_7 \right \vert$$ So by means of the theorem \ref{addDDerrabs}, we obtain that $$r_\mi + r_\lo = t_9 + t_{10} + t_7 + t_8 + \delta_3$$ where $$\left \vert \delta_3 \right \vert \leq 2^{-101} \cdot \left \vert t_9 \right \vert + 2^{-101} \cdot \left \vert t_7 \right \vert$$ So finally we get $$r_\hi + r_\mi + r_\lo = a_\hi \cdot b_\hi + a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\lo + \delta$$ where \begin{eqnarray*} \left \vert \delta \right \vert & = & \left \vert \delta_1 + \delta_2 + \delta_3 \right \vert \\ & \leq & \left \vert \delta_1 \right \vert + \left \vert \delta_2 \right \vert + \left \vert \delta_3 \right \vert \\ & \leq & 2^{-102} \cdot \left \vert a_\lo \cdot b_\hi \right \vert \\ & & + 2^{-102} \cdot \left \vert a_\hi \cdot b_\lo \right \vert \\ & & + 2^{-53} \cdot \left \vert a_\lo \cdot b_\lo \right \vert \\ & & + 2^{-152} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \\ & & + 2^{-101} \cdot \left \vert t_7 \right \vert \end{eqnarray*} And for $\left \vert t_7 \right \vert$ we obtain the following inequalities \begin{eqnarray*} \left \vert t_7 \right \vert & \leq & \circ \left( \left \vert t_7 + t_8 \right \vert \right) \\ & \leq & 2 \cdot \left \vert t_7 + t_8 \right \vert \\ & \leq & 2 \cdot \left(\left \vert a_\hi \cdot b_\lo \right \vert + \left \vert a_\lo \cdot b_\hi \right \vert + 2^{-102} \cdot \left \vert a_\lo \cdot b_\hi \right \vert + 2^{-102} \cdot \left \vert a_\hi \cdot b_\lo \right \vert \right) \\ & \leq & 8 \cdot \left \vert a_\hi \cdot b_\lo \right \vert \end{eqnarray*} In consequence we can check $$\left \vert \delta \right \vert \leq 2^{-150} \cdot \left \vert a_\hi \cdot b_\hi \right \vert$$ Let us give now an upper bound for $\left \vert a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\lo \right \vert$ as a function of $\left \vert a_\hi \cdot b_\hi \right \vert$:\\ We have \begin{eqnarray*} \left \vert a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\lo \right \vert & \leq & \left \vert a_\hi \cdot b_\lo \right \vert + \left \vert a_\lo \cdot b_\hi \right \vert + \left \vert a_\lo \cdot b_\lo \right \vert \\ & \leq & 2^{-51} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \end{eqnarray*} from which we deduce that \begin{eqnarray*} \left \vert a_\hi \cdot b_\hi + \left( a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\lo \right) \right \vert & \geq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 1 - 2^{-51} \right) \\ & \geq & \frac{1}{2} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \end{eqnarray*} Thus $$\left \vert \delta \right \vert \leq 2^{-149} \cdot \left \vert a_\hi \cdot b_\hi + a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\lo \right \vert$$ So we can finally give an upper bound for the relative error $\epsilon$ of the multiplication procedure \MulDT~ defined by algorithm \ref{mulDTref}: $$r_\hi + r_\mi + r_\lo = \left( a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\lo \right) \cdot \left( 1 + \epsilon \right)$$ with $$\left \vert \epsilon \right \vert \leq 2^{-149}$$ Before concluding, we must still analyse the overlap of the different components of the triple-double number returned by the algorithm. It is clear that $r_\mi$ and $r_\lo$ do not overlap because the \AddDD~ brick ensures this. Let us now consider the magnitude of $r_\mi$ with regard to the one of $r_\hi$.\\ We give first a lower bound for $\left \vert r_\hi \right \vert$: \begin{eqnarray*} \left \vert r_\hi \right \vert & = & \left \vert \circ \left( a_\hi \cdot b_\hi \right) \right \vert \\ & \geq & \circ \left( \left \vert a_\hi \cdot b_\hi \right \vert \right) \\ & \geq & \frac{1}{2} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \end{eqnarray*} and then an upper bound for $\left \vert r_\mi \right \vert$: \begin{eqnarray*} \left \vert r_\mi \right \vert & \leq & \circ \left( \left \vert r_\mi + r_\lo \right \vert \right) \\ & \leq & \circ \left( \left \vert t_7 + t_8 \right \vert + \left \vert t_9 + t_{10} \right \vert + \delta_3 \right) \\ & \leq & \circ \left( \left \vert a_\hi \cdot b_\lo \right \vert + \left \vert a_\lo \cdot b_\hi \right \vert + \delta_1 + \left \vert t_9 \right \vert + \left \vert t_{10} \right \vert + \delta_3 \right) \\ & \leq & \circ \left( \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-53} + 2^{-53} + 2^{-155} + 2^{-155} + 2^{-51} + 2^{-104} + 2^{-152} + 2^{-151} \right) \right) \\ & \leq & 2^{-49} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \end{eqnarray*} From this we can deduce the final bound $$\left \vert r_\mi \right \vert \leq 2^{-48} \cdot \left \vert r_\hi \right \vert$$\qed \end{proof} \subsection{The multiplication procedure \MulDTT} Let us concentrate now on the multiplication sequence \MulDTT. \begin{algorithm}[\MulDTT] \label{mulDTTref} ~ \\ {\bf In:} a double-double number $a_\hi + a_\lo$ and a triple-double number $b_\hi + b_\mi + b_\lo$ \\ {\bf Out:} a triple-double number $r_\hi + r_\mi + r_\lo$ \\ {\bf Preconditions on the arguments:} \begin{eqnarray*} \left \vert a_\lo \right \vert & \leq & 2^{-53} \cdot \left \vert a_\hi \right \vert \\ \left \vert b_\mi \right \vert & \leq & 2^{-\beta_o} \cdot \left \vert b_\hi \right \vert \\ \left \vert b_\lo \right \vert & \leq & 2^{-\beta_u} \cdot \left \vert b_\mi \right \vert \end{eqnarray*} with \begin{eqnarray*} \beta_o & \geq & 2 \\ \beta_u & \geq & 1 \end{eqnarray*} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{60mm} $\left( r_\hi, t_1 \right) \gets \mMul\left( a_\hi, b_\hi \right)$ \\ $\left( t_2, t_3 \right) \gets \mMul\left( a_\hi, b_\mi \right)$ \\ $\left( t_4, t_5 \right) \gets \mMul\left( a_\hi, b_\lo \right)$ \\ $\left( t_6, t_7 \right) \gets \mMul\left( a_\lo, b_\hi \right)$ \\ $\left( t_8, t_9 \right) \gets \mMul\left( a_\lo, b_\mi \right)$ \\ $t_{10} \gets a_\lo \otimes b_\lo$ \\ $\left( t_{11}, t_{12} \right) \gets \mAddDD\left( t_2, t_3, t_4, t_5 \right)$ \\ $\left( t_{13}, t_{14} \right) \gets \mAddDD\left( t_6, t_7, t_8, t_9 \right)$ \\ $\left( t_{15}, t_{16} \right) \gets \mAddDD\left( t_{11}, t_{12}, t_{13}, t_{14} \right)$ \\ $\left( t_{17}, t_{18} \right) \gets \mAdd\left( t_1, t_{10} \right)$ \\ $\left( r_\mi, r_\lo \right) \gets \mAddDD\left( t_{17}, t_{18}, t_{15}, t_{16} \right)$ \\ \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Relative error of algorithm \ref{mulDTTref} \MulDTT] ~ \\ Let be $a_\hi + a_\lo$ and $b_\hi + b_\mi + b_\lo$ the values in argument of algorithm \ref{mulDTTref} \MulDTT~ such that the given preconditions hold.\\ So the following will hold for the values $r_\hi$, $r_\mi$ and $r_\lo$ returned $$r_\hi + r_\mi + r_\lo = \left(\left(a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\mi + b_\lo \right)\right) \cdot \left(1 + \epsilon\right)$$ where $\epsilon$ is bounded as follows: $$\left \vert \epsilon \right \vert \leq \frac{2^{-99 - \beta_o} + 2^{-99 - \beta_o - \beta_u} + 2^{-152}} {1 - 2^{-53} - 2^{-\beta_o + 1} - 2^{-\beta_o - \beta_u + 1}} \leq 2^{-97 - \beta_o} + 2^{-97 - \beta_o - \beta_u} + 2^{-150}$$ The values $r_\mi$ and $r_\lo$ will not overlap at all and the following bound will be verified for the overlap of $r_\hi$ and $r_\mi$: $$\left \vert r_\mi \right \vert \leq 2^{-\gamma} \cdot \left \vert r_\hi \right \vert$$ where $$\gamma \geq \min\left( 48, \beta_o - 4, \beta_o + \beta_u - 4 \right)$$ \end{theorem} \begin{proof} ~ \\ During this proof we will once again proceed by basic bricks that we will assemble in the end.\\ Let us therefore start by the following one: \begin{center} \begin{minipage}[b]{60mm} $\left( t_2, t_3 \right) \gets \mMul\left( a_\hi, b_\mi \right)$ \\ $\left( t_4, t_5 \right) \gets \mMul\left( a_\hi, b_\lo \right)$ \\ $\left( t_{11}, t_{12} \right) \gets \mAddDD\left( t_2, t_3, t_4, t_5 \right)$ \end{minipage} \end{center} Since we have the exact egalities $$t_2 + t_3 = a_\hi \cdot b_\mi$$ and $$t_4 + t_5 = a_\hi \cdot b_\lo$$ and since we know that $t_2$ and $t_3$ and $t_4$ and $_5$ do not overlap, it suffices to apply the bound proven at theorem \ref{addDDerrabs}. So we can check on the one hand \begin{eqnarray*} 2^{-53} \cdot \left \vert t_3 + t_5 \right \vert & \leq & 2^{-53} \cdot \left \vert t_3 \right \vert + 2^{-53} \cdot \left \vert t_5 \right \vert \\ & \leq & 2^{-106} \cdot \left \vert t_2 \right \vert + 2^{-106} \cdot \left \vert t_4 \right \vert \\ & \leq & 2^{-105} \cdot \left \vert a_\hi \cdot b_\mi \right \vert + 2^{-105} \cdot \left \vert a_\hi \cdot b_\lo \right \vert \\ & \leq & 2^{-105-\beta_o} \cdot \left \vert a_\hi \cdot b_\mi \right \vert + 2^{-105-\beta_o-\beta_u} \cdot \left \vert a_\hi \cdot b_\lo \right \vert \end{eqnarray*} and on the other \begin{eqnarray*} 2^{-102} \cdot \left \vert t_2 + t_3 + t_4 + t_5 \right \vert & = & 2^{-102} \cdot \left \vert a_\hi \cdot b_\mi + a_\hi \cdot b_\lo \right \vert \\ & \leq & 2^{-102} \cdot \left \vert a_\hi \cdot b_\mi \right \vert + 2^{-102} \cdot \left \vert a_\hi \cdot b_\lo \right \vert \\ & \leq & 2^{-102-\beta_o} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-102-\beta_o-\beta_u} \cdot \left \vert a_\hi \cdot b_\lo \right \vert \end{eqnarray*} In consequence, using the mentioned theorem, we obtain $$t_{11} + t_{12} = a_\hi \cdot b_\mi + a_\hi \cdot b_\lo + \delta_1$$ with $$\left \vert \delta_1 \right \vert \leq 2^{-102-\beta_o} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-102-\beta_o-\beta_u} \cdot \left \vert a_\hi \cdot b_\lo \right \vert$$ Let us continue with the following part of the algorithm: \begin{center} \begin{minipage}[b]{60mm} $\left( t_6, t_7 \right) \gets \mMul\left( a_\lo, b_\hi \right)$ \\ $\left( t_8, t_9 \right) \gets \mMul\left( a_\lo, b_\mi \right)$ \\ $\left( t_{13}, t_{14} \right) \gets \mAddDD\left( t_6, t_7, t_8, t_9 \right)$ \end{minipage} \end{center} We have \begin{eqnarray*} 2^{-53} \cdot \left \vert t_7 + t_9 \right \vert & \leq & 2^{-53} \cdot \left \vert t_7 \right \vert + 2^{-53} \cdot \left \vert t_9 \right \vert \\ & \leq & 2^{-106} \cdot \left \vert t_6 \right \vert + 2^{-106} \cdot \left \vert t_8 \right \vert \\ & \leq & 2^{-105} \cdot \left \vert a_\lo \cdot b_\hi \right \vert + 2^{-105} \cdot \left \vert a_\lo \cdot b_\mi \right \vert \\ & \leq & 2^{-158} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-158-\beta_o} \cdot \left \vert a_\hi b_\hi \right \vert \end{eqnarray*} and \begin{eqnarray*} 2^{-102} \cdot \left \vert t_6 + t_7 + t_8 + t_9 \right \vert & = & 2^{-102} \cdot \left \vert a_\lo \cdot b_\hi + a_\lo \cdot b_\mi \right \vert \\ & \leq & 2^{-102} \cdot \left \vert a_\lo \cdot b_\hi \right \vert + 2^{-102} \cdot \left \vert a_\lo \cdot b_\mi \right \vert \\ & \leq & 2^{-155} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-155-\beta_o} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \end{eqnarray*} So we get $$t_{13} + t_{14} = a_\lo \cdot b_\hi + a_\lo \cdot b_\mi + \delta_2$$ with $$\left \vert \delta_2 \right \vert \leq 2^{-155} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-155-\beta_o} \cdot \left \vert a_\hi \cdot b_\hi \right \vert$$ Let us now consider the brick that produces $t_{15}$ and $t_{16}$ out of the values in argument. By the properties of the \AddDD~ procedure, $t_{11}$ and $t_{12}$ and $t_{13}$ and $t_{14}$ do not overlap at all and verify thus the preconditions of the next \AddDD~ brick that will compute $t_{15}$ and $t_{16}$. So it suffices to apply once again the absolute error bound of this procedure for obtaining $$t_{15} + t_{16} = t_{11} + t_{12} + t_{13} + t_{14} + \delta_3$$ with $\left \vert \delta_3 \right \vert$ which remains to be estimated.\\ So we have on the one hand \begin{eqnarray*} 2^{-53} \cdot \left \vert t_{12} + t_{14} \right \vert & \leq & 2^{-53} \cdot \left \vert t_{12} \right \vert + 2^{-53} \cdot \left \vert t_{14} \right \vert \\ & \leq & 2^{-106} \cdot \left \vert t_{11} \right \vert + 2^{-106} \cdot \left \vert t_{13} \right \vert \end{eqnarray*} -- which is an upper bound that can still be estimated by \begin{eqnarray*} \left \vert t_{11} \right \vert & = & \left \vert \circ \left( t_{11} + t_{12} \right) \right \vert \\ & \leq & \left \vert \left( t_{11} + t_{12} \right) \cdot \left( 1 + 2^{-53} \right) \right \vert \\ & \leq & 2 \cdot \left \vert t_{11} + t_{12} \right \vert \\ & \leq & 2 \cdot \left \vert a_\hi \cdot b_\mi + a_\hi \cdot b_\lo + \delta_1 \right \vert \\ & \leq & 2 \cdot \left( \left \vert a_\hi \cdot b_\mi \right \vert + \left \vert a_\hi \cdot b_\lo \right \vert + \left \vert \delta_1 \right \vert \right) \\ & \leq & 2 \cdot \left( 2^{-\beta_o} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-\beta_o-\beta_u} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-\beta_o-102} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-\beta_o-\beta_u-102} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \right) \\ & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-\beta_o+2} + 2^{-\beta_o-\beta_u+2} \right) \end{eqnarray*} which means, using also the following inequalities that \begin{eqnarray*} \left \vert t_{13} \right \vert & = & \left \vert \circ \left( t_{13} + t_{14} \right) \right \vert \\ & \leq & 2 \cdot \left \vert t_{13} + t_{14} \right \vert \\ & \leq & 2 \cdot \left \vert a_\lo \cdot b_\hi + a_\lo \cdot b_\mi + \delta_2 \right \vert \\ & \leq & 2 \cdot \left( \left \vert a_\lo \cdot b_\hi \right \vert + \left \vert a_\lo \cdot b_\mi \right \vert + \left \vert \delta_2 \right \vert \right) \\ & \leq & 2 \cdot \left( 2^{-53} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-53-\beta_o} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-155} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-155-\beta_o} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \right) \\ & \leq & 2^{-50} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \end{eqnarray*} we can finally check that we have on the one side $$2^{-53} \cdot \left \vert t_{12} + t_{14} \right \vert \leq \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-\beta_o-104} + 2^{-\beta_o-\beta_u-104} + 2^{-156} \right)$$ And on the other \begin{eqnarray*} 2^{-102} \cdot \left \vert t_{11} + t_{12} + t_{13} + t_{14} \right \vert & \leq & 2^{-102} \cdot \left \vert a_\hi \cdot b_\mi + a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\mi + \delta_1 + \delta_2 \right \vert \\ & \leq & 2^{-102} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \cdot \\ & & \left( 2^{-\beta_o} \right. \\ & & + 2^{-\beta_o-\beta_u} \\ & & + 2^{-53} \\ & & + 2^{-\beta_o-53} \\ & & + 2^{-\beta_o-102} \\ & & + 2^{-\beta_o-\beta_u-102} \\ & & + 2^{-155} \\ & & \left. + 2^{-\beta_o-155} \right) \\ & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-\beta_o-101} + 2^{-\beta_o-\beta_u-101} + 2^{-154} \right) \end{eqnarray*} So we know that $$t_{15} + t_{16} = t_{11} + t_{12} + t_{13} + t_{14} + \delta_3$$ with $$\left \vert \delta_3 \right \vert \leq \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-\beta_o-101} + 2^{-\beta_o-\beta_u-101} + 2^{-154} \right)$$ With this result we can note now $$t_{15} + t_{16} = a_\hi \cdot b_\mi + a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\mi + \delta_4$$ with \begin{eqnarray*} \left \vert \delta_4 \right \vert & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \\ & & \left( 2^{-\beta_o-102} \right. \\ & & + 2^{-\beta_o-\beta_u-102} \\ & & + 2^{-155} \\ & & + 2^{-\beta_o-155} \\ & & + 2^{-\beta_o-101} \\ & & \left. + 2^{-\beta_o-\beta_u-101} \right) \\ & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-\beta_o-100} + 2^{-\beta_o-\beta_u-100} + 2^{-155} \right) \end{eqnarray*} Let us give now an upper bound for $\delta_5$ defined by the following expression: $$r_\mi + r_\lo = t_1 + a_\lo \cdot b_\lo + t_{15} + t_{16} + \delta_5$$ It is clear that $t_{17}$ and $t_{18}$ do not overlap. In contrast the \Add~ operation which adds $t_1$ to $t_{10}$ is necessary because $t_1$ and $t_{10}$ can overlap and even \ouvguill overtake\fermguill~ each other: $$\left \vert t_1 \right \vert \geq 2^{-106} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \lor t_1 = 0$$ and $$\left \vert t_{10} \right \vert \leq 2^{-\beta_o-\beta_u-52} \cdot \left \vert a_\hi \cdot b_\hi \right \vert$$ The same argument tells us that the \Add~ must be conditional. \\ So we have $$t_{17} + t_{18} = t_1 + t_{10}$$ and $$t_{10} = a_\lo \cdot b_\lo + \delta^\prime$$ with $$\left \vert \delta^\prime \right \vert \leq 2^{-106-\beta_o-\beta_u} \cdot \left \vert a_\hi \cdot b_\hi \right \vert$$ Let us apply once again the bound for the absolute error of the \AddDD~ procedure:\\ So we have on the one hand \begin{eqnarray*} 2^{-53} \cdot \left \vert t_{18} + t_{16} \right \vert & \leq & 2^{-53} \cdot \left \vert t_{18} \right \vert + 2^{-53} \cdot \left \vert t_{18} \right \vert \\ & \leq & 2^{-106} \cdot \left \vert t_{17} \right \vert + 2^{-106} \cdot \left \vert t_{15} \right \vert \end{eqnarray*} We can estimate this by \begin{eqnarray*} \left \vert t_{17} \right \vert & \leq & \left \vert \circ \left( t_1 + t_{10} \right) \right \vert \\ & \leq & 2 \cdot \left \vert t_1 + t_{10} \right \vert \\ & \leq & 2 \cdot \left \vert t_1 \right \vert + 2 \cdot \left \vert t_{10} \right \vert \\ & \leq & 2^{-52} \cdot \left \vert r_\hi \right \vert + 2 \cdot \left \vert \circ \left( a_\lo \cdot b_\lo \right) \right \vert \\ & \leq & 2^{-52} \cdot \left \vert \circ \left( a_\hi \cdot b_\hi \right) \right \vert + 2^2 \cdot \left \vert a_\lo \cdot b_\lo \right \vert \\ & \leq & 2^{-51} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-51-\beta_o-\beta_u} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \end{eqnarray*} and by \begin{eqnarray*} \left \vert t_{15} \right \vert & = & \left \vert \circ \left( t_{15} + t_{16} \right) \right \vert \\ & \leq & 2 \cdot \left \vert t_{15} + t_{16} \right \vert \\ & \leq & 2 \cdot \left \vert a_\hi \cdot b_\mi + a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\mi + \delta_4 \right \vert \\ & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-\beta_o+1} + 2^{-\beta_o-\beta_u+1} + 2^{-52} + 2^{-\beta_o-52} + 2^{-\beta_o-99} + 2^{-\beta_o-\beta_u-99} + 2^{-154} \right) \\ & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-\beta_o+2} + 2^{-\beta_o-\beta_u+2} + 2^{-51} \right) \end{eqnarray*} So finally, we have on the one hand \begin{eqnarray*} 2^{-53} \cdot \left \vert t_{18} + t_{16} \right \vert & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-157} + 2^{-157-\beta_o-\beta_u} + 2^{-104-\beta_o} + 2^{-104-\beta_o-\beta_u} + 2^{-157} \right) \\ & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-\beta_o-104} + 2^{-\beta_o-\beta_u-103} + 2^{-156} \right) \end{eqnarray*} And on the other \begin{eqnarray*} 2^{-102} \cdot \left \vert t_{17} + t_{18} + t_{15} + t_{16} \right \vert & \leq & 2^{-102} \cdot \left \vert t_1 + a_\lo \cdot b_\lo + \delta^\prime + a_\hi \cdot b_\mi + a_\hi \cdot b_\lo + a_\lo \cdot b_\hi \right. \\ & & \left. + a_\lo \cdot b_\mi + \delta_4 \right \vert \\ & \leq & 2^{-102} \cdot \left( 2^{-53} \cdot \left \vert r_\hi \right \vert \right. \\ & & + 2^{-53-\beta_o-\beta_u} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \\ & & + 2^{-\beta_o} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \\ & & + 2^{-\beta_o-\beta_u} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \\ & & + 2^{-53} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \\ & & + 2^{-53-\beta_o} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \\ & & + 2^{-106-\beta_o-\beta_u} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \\ & & \left. + \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-100-\beta_o} + 2^{-100-\beta_o-\beta_u} + 2^{-155} \right) \right) \\ & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-101-\beta_o} + 2^{-101-\beta_o-\beta_u} + 2^{-153} \right) \end{eqnarray*} which means that we finally obtain the following $$r_\mi + r_\lo = t_1 + a_\lo \cdot b_\lo + a_\hi \cdot b_\mi + a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\mi + \delta_6$$ with $$\left \vert \delta_6 \right \vert \leq \left \vert \delta_4 + \delta_5 \right \vert$$ where $$\left \vert \delta_5 \right \vert \leq \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-101-\beta_o} + 2^{-101-\beta_o-\beta_u} + 2^{-153} \right)$$ Thus we can check that \begin{eqnarray*} \left \vert \delta_6 \right \vert & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-100-\beta_o} + 2^{-100-\beta_o-\beta_u} + 2^{-155} + 2^{-101-\beta_o} + 2^{-101-\beta_o-\beta_u} + 2^{-153} \right) \\ & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-99-\beta_o} + 2^{-99-\beta_o-\beta_u} + 2^{-152} \right) \end{eqnarray*} Let us now integrate the different intermediate results:\\ Since we know that the following egality is exact $$r_\hi + t_1 = a_\hi \cdot b_\hi$$ we can check that $$r_\hi + r_\mi + r_\lo = \left( a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\mi + b_\lo \right) + \delta_6$$ We continue by giving a lower bound for $\left \vert \left( a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\mi + b_\lo \right) \right \vert$ using a term which is a function of $\left \vert a_\hi \cdot b_\hi \right \vert$. We do so for being able to give a relative error bound. We first bound $$\left \vert a_\hi \cdot b_\mi + a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\mi + a_\lo \cdot b_\lo \right \vert$$ by such a term.\\ We have \begin{eqnarray*} \left \vert a_\hi \cdot b_\mi + a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\mi + a_\lo \cdot b_\lo \right \vert & \leq & \left \vert a_\hi \cdot b_\mi \right \vert + \left \vert a_\hi \cdot b_\lo \right \vert + \left \vert a_\lo \cdot b_\hi \right \vert + \left \vert a_\lo \cdot b_\mi \right \vert + \left \vert a_\lo \cdot b_\lo \right \vert \\ & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-\beta_o} + 2^{-\beta_o-\beta_u} + 2^{-53} \right. \\ & & \left. + 2^{-\beta_o-53} + 2^{-\beta_o-53} \right) \\ & \leq & 2^{-\beta_o+1} \cdot \left \vert a_\hi \cdot b_\hi \right \vert + 2^{-\beta_o-\beta_u+1} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \\ & & + 2^{-53} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \end{eqnarray*} and we get $$\left \vert \left( a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\mi + b_\lo \right) \right \vert \geq \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 1 - 2^{-53} - 2^{-\beta_o+1} -2^{-\beta_o-\beta_u+1} \right)$$ from which we deduce (since $\beta_o \geq 2$, $\beta_u \geq 1$) $$\left \vert a_\hi \cdot b_\hi \right \vert \leq \frac{1}{1 - 2^{-53} - 2^{-\beta_o+1} -2^{-\beta_o-\beta_u+1}} \cdot \left \vert \left( a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\mi + b_\lo \right) \right \vert$$ Using this inequality we can finally give a bound for the relative error $\epsilon$ as follows: $$r_\hi + r_\mi + r_\lo = \left( a_\hi + a_\lo \right) \cdot \left( b_\hi + b_\mi + b_\lo \right) \cdot \left( 1 + \epsilon \right)$$ with $$\left \vert \epsilon \right \vert \leq \frac{2^{-99-\beta_o} + 2^{-99-\beta_o-\beta_u} + 2^{-152}}{1 - 2^{-53} - 2^{-\beta_o+1} -2^{-\beta_o-\beta_u+1}}$$ Let us recall that for this inequality, $\beta_o \geq 2$, $\beta_u \geq 1$ must hold which is the case.\\ It is certainly possible to estimate $\left \vert \epsilon \right \vert$ by a term which is slightly less exact: $$\left \vert \epsilon \right \vert \leq 2^{-97 - \beta_o} + 2^{-97 - \beta_o - \beta_u} + 2^{-150}$$ because $$1 - 2^{-53} - 2^{-\beta_o+1} -2^{-\beta_o-\beta_u+1} \geq \frac{1}{4}$$ for $\forall \beta_o \geq 2, \beta_u \geq 1$.\\~\\ In order to finish this proof, we must still give an upper bound for the maximal overlap generated by the algorithm \ref{mulDTTref} \MulDTT. Clearly $r_\mi$ and $r_\lo$ do not overlap because of the properties of the basic brick \AddDD. Let us give an upper bound for the overlap between $r_\hi$ and $r_\mi$ giving a term of the following form: $$\left \vert r_\mi \right \vert \leq 2^{-\gamma} \cdot \left \vert r_\hi \right \vert$$ where we constate a lower bound for $\gamma$ using a term in $\beta_o$ and $\beta_u$.\\ Let us start by giving a lower bound for $r_\hi$ as a function of $\left \vert a_\hi \cdot b_\hi \right \vert$.\\ We have \begin{eqnarray*} \left \vert r_\hi \right \vert & = & \left \vert \circ \left( a_\hi \cdot b_\hi \right) \right \vert \\ & \geq & \frac{1}{2} \cdot \left \vert a_\hi \cdot b_\hi \right \vert \end{eqnarray*} Then, let us give an upper bound for $\left \vert r_\mi \right \vert$ using a function of $\left \vert a_\hi \cdot b_\hi \right \vert$: \begin{eqnarray*} \left \vert r_\mi \right \vert & \leq & \left \vert \circ \left( r_\mi + r_\lo \right) \right \vert \\ & \leq & 2 \cdot \left \vert r_\mi + r_\lo \right \vert \\ & \leq & 2 \cdot \left \vert t_1 + a_\lo \cdot b_\lo + a_\hi \cdot b_\mi + a_\hi \cdot b_\lo + a_\lo \cdot b_\hi + a_\lo \cdot b_\mi + \delta_6 \right \vert \\ & \leq & 2 \cdot \left \vert a_\hi \cdot b_\hi \right \vert \cdot \\ & & \cdot \left( 2^{-52} + 2^{-\beta_o-\beta_u-53} + 2^{-\beta_o} + 2^{-\beta_o-\beta_u} + 2^{-53} + 2^{-\beta_o-53} + \right. \\ & & \left. 2^{-\beta_o-99} + 2^{-\beta_o-\beta_u-99} + 2^{-152} \right) \\ & \leq & \left \vert a_\hi \cdot b_\hi \right \vert \cdot \left( 2^{-50} + 2^{-\beta_o-2} + 2^{-\beta_o-\beta_u+2} \right) \end{eqnarray*} This implies that \begin{eqnarray*} \left \vert r_\mi \right \vert & \leq & 2 \cdot \left \vert r_\hi \right \vert \cdot \left( 2^{-50} + 2^{-\beta_o-2} + 2^{-\beta_o-\beta_u+2} \right) \\ & \leq & \left \vert r_\hi \right \vert \cdot \left( 2^{-49} + 2^{-\beta_o-3} + 2^{-\beta_o-\beta_u+3} \right) \end{eqnarray*} From which we can deduce $$\left \vert r_\mi \right \vert \leq 2^{-\gamma} \cdot \left \vert r_\hi \right \vert$$ with $$\gamma \geq \min \left( 48, \beta_o - 4, \beta_o -\beta_u -4 \right)$$ This result finishes the proof.\qed \end{proof} \section{Final rounding procedures} The renormalisation sequence and all computational basic operators on triple-double numbers have been presented only for one reason: allowing for implementing efficiently elementary functions in double precision \cite{Defour-thesis, crlibmweb, DinDefLau2004LIP}. For obtaining this goal we are still lacking an important basic brick: the final rounding of a triple-double number into a double precision number. This rounding must be possible in each of the $4$ known rounding modes \cite{IEEE754}. In particular, we will distinguish between the round-to-nearest sequence and the ones for the directed rounding modes.\\ Let us start this discussion by introducing some notations:\\ We will notate \begin{itemize} \item $\circ \left( x \right) \in \F$ the rounding to the nearest double precision number of a real number $x \in \R$, \item $\vartriangle \left( x \right) \in \F$ the rounding towards $+\infty$ of a real $x \in \R$ into double precision, \item $\triangledown \left( x \right) \in \F$ the rounding towards $-\infty$ of a real $x \in \R$ into double precision and \item $\diamond \left( x \right) \in \F$ the rounding towards $0$ of a real number $x \in \R$ into a double pr\'ecision number. \end{itemize} Since the directed rounding modes behave all in a similar fashion we will make a slight abuse of our notations. An unspecified directed rounding mode will be notated also $\diamond \left( x \right)$. \begin{definition}[Correct rounding procedure] \label{defprocarrcorr} ~ \\ Let be {\bf A} a procedure taking a non-overlapping triple-double number $x_\hi + x_\mi + x_\lo$ as argument. This number be such that $x_\mi = \circ \left( x_\mi + x_\lo \right)$. Let the procedure {\bf A} return a double precision number $x^\prime$.\\ So we will say that {\bf A} is a correct rounding procedure for round-to-nearest-ties-to-even mode iff for all possible entries $$x^\prime = \circ \left( x_\hi + x_\mi + x_\lo \right)$$ The same way {\bf A} is a correct rounding procedure for a directed rounding mode iff for all possible entries $$x^\prime = \diamond \left( x_\hi + x_\mi + x_\lo \right)$$ \end{definition} In the sequel we will present two algorithms for final rounding -- one for round-to-nearest mode, the other one for the directed modes -- and we will prove their correctness with regard to definition \ref{defprocarrcorr}. \subsection{Final rounding to the nearest even} \begin{lemma}[Generation of half an $\mUlp$ or a quarter of an $\mUlp$] \label{genmiquartulp} ~\\ Let be $x$ a non-subnormal floating point number different from $\pm 0$, $\pm \infty$ and $\nan$ and such that $x^-$ is not a subnormal number. \\ Given the following instruction sequence: \begin{center} $t_1 \gets x^-$ \\ $t_2 \gets x \ominus t_1$ \\ $t_3 \gets t_2 \otimes \frac{1}{2}$ \end{center} we know that \begin{itemize} \item if it exists a $k \in \Z$ such that $x=2^k$ exactly so $$\left \vert t_3 \right \vert = \frac{1}{4} \cdot \mUlp \left( x \right)$$ \item if it does not exist any $k \in \Z$ such that $x=2^k$ exactly so $$\left \vert t_3 \right \vert = \frac{1}{2} \cdot \mUlp \left( x \right)$$ \end{itemize} \end{lemma} \begin{proof} ~\\ Without loss of generality, we can suppose that $x$ is positive because the definition of $x^-$ and all floating point operations are symmetrical with regard to the sign \cite{IEEE754} and because the egalities to be proven ignore it. Additionally since the floating point multiplication by an integer power of $2$ is always exact, it suffices to show that $t_2 = \frac{1}{2} \cdot \mUlp \left( x \right)$ if $x$ is exactly an integer power of $2$ and that $t_2 = \mUlp\left( x \right)$ otherwise.\\ Let us begin by showing that we have the exact equation $$t_2 = x - x^-$$ which means that the floating point substraction is exact. This is the case by Sterbenz' lemma \cite{Ste74} if $$\frac{1}{2} \cdot x \leq x^- \leq 2 \cdot x$$ So let us show this inequality. \\ Since $x \not = 0$ and since it is not subnormal we know already that $x^- \not = 0$. Additionally $x^- > 0$ because $x > 0$ and $x^-$ is its direct predecessor with regard to $<$. Further by definition \ref{predsuccdef}, it is trivial to see that $\forall y \in \F.\left( y^- \right)^+ = y = \left( y^+ \right)^-$.\\ Since $x$ is positive and since $x^-$ is therefore its predecessor with regard to $<$ we have $$x^- < x < 2 \cdot x$$ Let us suppose now that $$x^- < \frac{1}{2} \cdot x$$ Since $x$ is not subnormal and since it is positive, there exist $e \in \Z$ and $m \in \N$ such that $$x = 2^e \cdot m$$ with $$2^{p-1} \leq m < 2^p$$ where $p \geq 2$ is the format's precision; in particular, for double precision, $p=53$.\\ Given that $x^-$ is not subnormal neither and positive, too, it is the predecessor of $x$ and verifies $$x^- = \left \lbrace \begin{array}{lll} 2^e \cdot \left(m - 1 \right) & \mbox{ if } & m-1 \geq 2^{p-1} \\ 2^{e-1} \cdot \left( 2^p - 1 \right) & \mbox{ otherwise} & \end{array} \right.$$ So two cases must be treated separately:\\~\\ {\bf 1st case: $x^- = 2^e \cdot \left( m -1 \right)$ } \\ ~ \\ We get here with the hypotheses supposed \begin{eqnarray*} x^- & < & \frac{1}{2} \cdot x \\ 2^e \cdot \left( m - 1 \right) & < & \frac{1}{2} \cdot 2^e \cdot m \\ m-1 & < & \frac{1}{2} \cdot m \\ m & < & 2 \end{eqnarray*} In contrast $m \geq 2^{p-1}$ and $p\geq2$; so we have contradiction in this case. \\ ~ \\ {\bf 2nd case: $x^- = 2^{e-1} \cdot \left( 2^p -1 \right)$ } \\ ~ \\ We can check \begin{eqnarray*} x^- & < & \frac{1}{2} \cdot x \\ 2^{e-1} \cdot \left( 2^{p-1} - 1 \right) & < & \frac{1}{2} \cdot 2^e \cdot m \\ 2^{e-1} \cdot \left( 2^{p-1} - 1 \right) & < & 2^{e-1} \cdot m \\ 2^p - 1 < m \end{eqnarray*} In contrast $m<2^p$, thus $2^p - 1 < m < 2^p$. This is a contradiction because the inequalities are strict and $m \in \N$. \\ ~ \\ So Sterbenz' lemma \cite{Ste74} can be applied and we get the exact equation $$t_2 = x - x^-$$ It is now important to see that $$x^+ = \left \lbrace \begin{array}{lll} 2^e \cdot \left(m + 1 \right) & \mbox{ if } & m+1 < 2^p \\ 2^{e+1} \cdot 2^{p-1} & \mbox{ otherwise} & \end{array} \right.$$ Further, without loss of generality, we can suppose that $x^+ \not = + \infty$ and that therefore $$\mUlp \left( x \right) = x^+ - x$$ If ever we could not suppose this, it would suffice to apply definition \ref{defulp} of the $\mUlp$ function which would only change the exponent $e$ by $1$ in the sequel.\\ So at this stage of the proof, two different cases are to be treated: $x$ is or is not exactly an integer power of $2$. \\ ~ \\ {\bf 1st case: $x$ is not exactly an integer power of $2$ } \\ ~ \\ So we get $x=2^e \cdot m$ with $2^{p-1} < m < 2^p$ from which we deduce that $m-1 \geq 2^{p-1}$ and that, finally, $$x^- = 2^e \cdot \left(m - 1 \right)$$ So still two sub-cases present themselves: \\ ~ \\ {\bf case a): $x^+ = 2^e \cdot \left( m + 1 \right)$} \\ ~ \\ We can check that \begin{eqnarray*} \mUlp \left( x \right) & = & x^+ - x \\ & = & 2^e \cdot \left( m + 1 \right) - 2^e \cdot m \\ & = & 2^e \cdot \left(m + 1 - m \right) \\ & = & 2^e \end{eqnarray*} and \begin{eqnarray*} t_2 & = & x - x^- \\ & = & 2^e \cdot m - 2^e \cdot \left( m - 1 \right) \\ & = & 2^e \cdot \left( m - m + 1 \right) \\ & = & 2^e \end{eqnarray*} So we know that $$t_2 = \mUlp \left( x \right)$$ ~ \\ {\bf case b): $x^+ = 2^e \cdot \left( m + 1 \right)$} \\ ~ \\ So in order to get $x^+$ being equal to $2^e \cdot \left( m + 1 \right)$, we must have $m+1 \geq 2^p$. \\ In contrast we can show that $m+1 \leq 2^p$ as follows: \\ Let us suppose that $m+1 > 2^p$. Since $m < 2^p$ because $x$ is not subnormal we get $$2^p - 1 < m < 2^p$$ In contrast, the inequalities are strict and $m \in \N$, thus contradiction. \\ We therefore know that $$m=2^p - 1$$ So we get \begin{eqnarray*} \mUlp \left( x \right) & = & x^+ - x \\ & = & 2^{e+1} \cdot 2^{p-1} - 2^e \cdot \left( 2^p - 1 \right) \\ & = & 2^e \cdot 2^p - 2^e \cdot 2^p + 2^e \\ & = & 2^e \end{eqnarray*} and \begin{eqnarray*} t_2 & = & x - x^- \\ & = & 2^e \cdot \left( 2^p - 1 \right) - 2^e \cdot \left( 2^p - 2 \right) \\ & = & 2^e \cdot 2^p - 2^e - 2^e \cdot 2^p + 2 \cdot 2^e \\ & = & 2^e \end{eqnarray*} Thus we have still $$t_2 = \mUlp \left( x \right)$$ ~ \\ {\bf 2nd case: $x$ is exactly an integer power of $2$ } \\ ~ \\ So in this case we verify that $$x=2^e \cdot 2^{p-1}$$ and therefore $m=2^{p-1}$. \\ In consequence, $$x^+ = 2^e \cdot \left(2^{p-1} + 1 \right)$$ because we got $2^{p-1} + 1 < 2^p$ since $p \geq 2$. \\ The same way $$x^- = 2^{e-1} \cdot \left(2^p - 1 \right)$$ because, trivially, $2^{p-1} - 1 < 2^{p-1}$.\\ So we get \begin{eqnarray*} \mUlp \left( x \right) & = & x^+ - x \\ & = & 2^e \cdot \left( 2^{p-1} + 1 \right) - 2^e \cdot 2^{p-1} \\ & = & 2^e \cdot 2^{p-1} + 2^e - 2^e \cdot 2^{p-1} \\ & = & 2^e \end{eqnarray*} and \begin{eqnarray*} t_2 & = & x - x^- \\ & = & 2^e \cdot 2^{p-1} - 2^{e-1} \cdot \left( 2^p - 1 \right) \\ & = & 2^e \cdot 2^{p-1} - 2^{e-1} \cdot 2^p + 2^{e-1} \\ & = & 2^{e-1} \\ & = & \frac{1}{2} \cdot 2^e \end{eqnarray*} Thus we can check that $$t_2 = \frac{1}{2} \cdot \mUlp \left( x \right)$$ \qed \end{proof} \begin{lemma}[Generation of half an $\mUlp$] \label{genmiulp} ~\\ Let be $x$ a non-subnormal floating point number different from $\pm 0$, $\pm\infty$ and $\nan$.\\ Let be the following instruction sequence: \begin{center} $t_1 \gets x^+$ \\ $t_2 \gets t_1 \ominus x$ \\ $t_3 \gets t_2 \otimes \frac{1}{2}$ \end{center} So the following holds $$\left \vert t_3 \right \vert = \frac{1}{2} \cdot \mUlp \left( x \right)$$ and one knows that \begin{center} $x > 0$ iff $t_3 > 0$ \end{center} \end{lemma} \begin{proof} ~ \\ In the beginning we will show the first equation; the equivalence of the signs will be shown below. So, without loss of generality, we can suppose that $x$ is positive because the definition of $x^+$ and all floating point operations are symmetrical with regard to the sign \cite{IEEE754} and because the equation to be shown ignorates it. Further since the floating point multiplication by an integer power of $2$ is always exact, it suffices to show that $t_2 = \frac{1}{2} \cdot \mUlp \left( x \right)$.\\ Let us still start the proof by showing that the substraction $$t_2 \gets t_1 \ominus x$$ is exact by Sterbenz' lemma \cite{Ste74}. We must therefore show that $$\frac{1}{2} \cdot x \leq x^+ \leq 2 \cdot x$$ Since $x$ is positive and since $x^+$ is its direct successor in the ordered set of the floating point numbers, we know already that $x < x^+$. So trivially, we get $$\frac{1}{2} \cdot x < x < x^+$$ Let us suppose now that $$x^+ > 2 \cdot x$$ Since $x$ is not subnormal and since it is positive, there exist $e \in \Z$ and $m \in \N$ such that $$x = 2^e \cdot m$$ with $$2^{p-1} \leq m < 2^p$$ where $p\geq 2$ is the precision of the format.\\ Further we know that $$x^+ = \left \lbrace \begin{array}{lll} 2^e \cdot \left(m + 1 \right) & \mbox{ if } & m+1 < 2^p \\ 2^{e+1} \cdot 2^{p-1} & \mbox{ otherwise} & \end{array} \right.$$ So two different cases show up: \\ ~ \\ {\bf 1st case: $x^+ = 2^e \cdot \left( m + 1 \right)$} \\ ~ \\ We have \begin{eqnarray*} x^+ & > & 2 \cdot x \\ 2^e \cdot \left( m + 1 \right) & > & 2 \cdot 2^e \cdot m \\ m+1 & > & 2 \cdot m \\ 1 & > & m \end{eqnarray*} In contrast, $m \geq 2^{p-1}$ and $p \geq 2$, thus contradiction. \\ ~ \\ {\bf 2nd case: $x^+ = 2^{e+1} \cdot 2^{p-1}$} \\ ~ \\ So in this case, we have $m+1\geq 2^p$ and therefore $m=2^p - 1$ because $m \leq 2^p - 1$ holds since $x$ is not subnormal.\\ We get thus \begin{eqnarray*} x^+ & > & 2 \cdot x \\ 2^{e+1} \cdot 2^{p-1} & > & 2 \cdot 2^e \cdot \left( 2^p - 1 \right) \\ 2^e \cdot 2^p & > & 2 \cdot 2^e \cdot 2^p - 2 \cdot 2^e \\ 2^p & > & 2 \cdot 2^p - 2 \\ 2 > 2^p \end{eqnarray*} In contrast $p\geq2$ which is contradictory.\\ So we can apply Sterbenz' lemma \cite{Ste74} and we get immediately that $$t_2 = x^+ - x = \mUlp \left( x \right)$$ by the definition of the $\mUlp$ function \\ Let us show now that $$x > 0 \mbox{ iff } t_3 > 0$$ Let us suppose that $x$ is positive. In consequence $x^+$ is its successor with regard to $<$ and we get $$x^+ - x > 0$$ which means that \begin{eqnarray*} t_2 & = & x^+ \ominus x \\ & = & \circ \left( x^+ - x \right) \\ & > & 0 \end{eqnarray*} because the rounding function is monotonic for positive numbers.\\ In contrast, if $x$ is negative $x^+$ is its predecessor with regard to $<$ and we get thus $x^+ - x < 0$. \\ We conclude in this case in the same way.\qed \end{proof} \begin{lemma}[Signs of the generated values] \label{gensigne} ~\\ Let be $x \in \F$ a non-subnormal floating point number different from $0$.\\ Given the following instruction sequence \begin{center} $t_1 \gets x^-$ \\ $t_2 \gets x \ominus t_1$ \\ $t_3 \gets t_2 \otimes \frac{1}{2}$ \\ $t_4 \gets x^+$ \\ $t_5 \gets t_4 \ominus x$ \\ $t_6 \gets t_5 \otimes \frac{1}{2}$ \end{center} the values $t_3$ and $t_6$ have the same sign. \end{lemma} \begin{proof} ~\\ It is clear that it suffices to show that $t_2$ and $t_5$ have the same sign. Because of definition \ref{predsuccdef} of $x^+$ and $x^-$, we are obliged to treat two different cases which depend on whether $x$ is positive or not.\\ ~ \\ {\bf 1st case: $x>0$} \\ ~ \\ So $x^+$ is the successor of $x$ with regard to the order $<$ on the floating point numbers and $x^-$ is its predecessor. Formally we have $$x^- < x < x^+$$ Thus \begin{eqnarray*} x - x^- & > & 0 \\ x^+ - x & > & 0 \end{eqnarray*} Due to the monotony of the rounding function, we obtain \begin{eqnarray*} \circ \left( x - x^- \right) & > & \circ \left( 0 \right) \\ \circ \left( x^+ - x \right) & > & \circ \left( 0 \right) \end{eqnarray*} and thus, since $0$ is exactly representable, \begin{eqnarray*} x \ominus x^- & > & 0 \\ x^+ \ominus x & > & 0 \end{eqnarray*} which is the fact to be shown. \\ ~ \\ {\bf 2nd case: $x<0$} \\ ~ \\ We get in this case that $x^+ < x < x^-$ and we finish the proof in a complete analogous way to the 1st case.\qed \end{proof} In the sequel, we will use the sign function $\sgn\left( x \right)$ which we define as follows: $$\forall x \in \R\mbox{ . }\sgn\left( x \right) = \left \lbrace \begin{array}{cl} -1 & \mbox{ if } x < 0 \\ 0 & \mbox{ if } x = 0 \\ 1 & \mbox{ otherwise} \end{array} \right.$$ \begin{lemma}[Equivalence between a $\xor$ and a floating point multiplication] \label{equivxormult} ~ \\ Let be $x, y \in \F$ two floating point numbers such that $x \not = 0$, $y \not = 0$. \\ So, \vspace{-5mm} \begin{center} $$x \otimes y \geq 0$$ implies $$x > 0 \xor y > 0$$ \end{center} \end{lemma} \begin{proof} ~ \\ Clearly $x \otimes y \geq 0$ implies $\circ \left( x \cdot y \right) \geq 0$. By monotony of the rounding function, this yields to $x \cdot y \geq 0$. Trivially one sees that this means that $x \geq 0 \xor y \geq 0$. Since the equations are not possible by hypothesis, we can conclude.\qed \end{proof} \begin{lemma}[Round-to-nearest-ties-to-even of the lower significance parts] \label{arrpairfaible} ~ \\ Let be $x_\mi$ and $x_\lo$ two non-subnormal floating point numbers such that $\exists e \in \Z \mbox{ . } 2^e = t$ such that $x_\mi = t^-$ and that $x_\lo = \frac{1}{4} \cdot \mUlp\left( t \right)$. \\ So, $$x_\mi \not = \circ \left( x_\mi + x_\lo \right)$$ Similar, let be $x_\mi$ and $x_\lo$ two non-subnormal floating point numbers such that $\exists e \in \Z \mbox{ . } 2^e = t$ such that $x_\mi = t^+$ and that $x_\lo = \frac{1}{2} \cdot \mUlp\left( t \right)$. \\ So, $$x_\mi \not = \circ \left( x_\mi - x_\lo \right)$$ \end{lemma} \begin{proof} ~\\ In both cases $t$ is representable as a floating point number because $x_\mi$ is not subnormal. Since $t$ is an integer power of $2$, the significand of $t$ is even. Therefore the significand of $x_\mi$ is odd in both cases because $x_\mi$ is either the direct predecessor or the direct successor of $t$. \\ Let us show now that $\left \vert x_\lo \right \vert = \frac{1}{2} \cdot \mUlp\left(x_\mi \right)$. If $x_\mi = t^-$ then we can deduce \begin{eqnarray*} \frac{1}{2} \cdot \mUlp\left( x_\mi \right) & = & \frac{1}{2} \cdot \left( x_\mi^+ - x_\mi \right) \\ & = & \frac{1}{2} \cdot \left( t - t^- \right) \\ & = & - \frac{1}{4} \cdot \left( t^+ - t \right) \\ & = & - \frac{1}{4} \cdot \mUlp\left( t \right) \\ & = & - x_\lo \end{eqnarray*} using amongst others lemma \ref{poweroftwo}. If $x_\mi = t^+$ then we know that $x_\mi$ is not an integer power of $2$ because $t$ is one and we are supposing that the format's precision $p$ is greater than $2$ bits. So it exists $e \in \Z$ and $m = 2^p$ such that $t = 2^e \cdot m$ \begin{eqnarray*} \frac{1}{2} \cdot \mUlp\left( x_\mi \right) & = & \frac{1}{2} \cdot \left( x_\mi^+ - x_\mi \right) \\ & = & \frac{1}{2} \cdot \left( 2^e \cdot \left( m + 2 \right) - 2^e \cdot \left( m + 1 \right) \right) \\ & = & \frac{1}{2} \cdot \left( 2^e \cdot \left( m + 1 \right) - 2^e \cdot m \right) \\ & = & \frac{1}{2} \cdot \mUlp\left( t \right) \\ & = & x_\lo \end{eqnarray*} So, in both cases, $x_\mi + x_\lo$ is located exactly at the middle of two floating point numbers that can be expressed with the exponent of $x_\mi$ or its successor and its predecessor. Since $x_\mi$ has an odd significand the rounding with done away from it.\qed \end{proof} \begin{algorithm}[Final rounding to the nearest (even)] \label{algarrpres} ~ \\ {\bf In:} a triple-double number $x_\hi + x_\mi + x_\lo$ \\ {\bf Out:} a double precision number $x^\prime$ returned by the algorithm \\ {\bf Preconditions on the arguments:} \begin{itemize} \item $x_\hi$ and $x_\mi$ as well as $x_\mi$ and $x_\lo$ do not overlap \item $x_\mi = \circ \left( x_\mi + x_\lo \right)$ \item $x_\hi \not = 0$, $x_\mi \not = 0$ and $x_\lo \not = 0$ \item $\circ \left( x_\hi + x_\mi \right) \not \in \left \lbrace x_\hi^-, x_\hi, x_\hi^+ \right \rbrace \Rightarrow \left \vert \left( x_\hi + x_\mi \right) - \circ\left( x_\hi + x_\mi \right) \right \vert \not = \frac{1}{2} \cdot \mUlp\left( \circ \left( x_\hi + x_\mi \right) \right)$ \end{itemize} {\bf Algorithm:} \\ \begin{center} \begin{minipage}[b]{80mm} $t_1 \gets x_\hi^-$ \\ $t_2 \gets x_\hi \ominus t_1$ \\ $t_3 \gets t_2 \otimes \frac{1}{2}$ \\ $t_4 \gets x_\hi^+$ \\ $t_5 \gets t_4 \ominus x_\hi$ \\ $t_6 \gets t_5 \otimes \frac{1}{2}$ \\ ~ \\ {\bf if} $\left( x_\mi \not = -t_3 \right)$ {\bf and} $\left( x_\mi \not = t_6 \right)$ {\bf then} \vspace{-2.4mm} \begin{center} \begin{minipage}[b]{70mm} \vspace{-2.4mm} {\bf return } $\left( x_\hi \oplus x_\mi \right)$ \end{minipage} \end{center} \vspace{-2.4mm} {\bf else} \vspace{-2.4mm} \begin{center} \begin{minipage}[b]{70mm} {\bf if} $\left( x_\mi \otimes x_\lo > 0.0 \right)$ {\bf then} \vspace{-2.4mm} \begin{center} \begin{minipage}[b]{60mm} {\bf if} $\left( x_\hi \otimes x_\lo > 0.0 \right)$ {\bf then} \vspace{-2.4mm} \begin{center} \begin{minipage}[b]{50mm} \vspace{-2.4mm} {\bf return } $x_\hi^+ $ \end{minipage} \end{center} \vspace{-2.4mm} {\bf else} \vspace{-2.4mm} \begin{center} \begin{minipage}[b]{50mm} \vspace{-2.4mm} {\bf return } $x_\hi^- $ \end{minipage} \end{center} \vspace{-2.4mm} {\bf end if} \end{minipage} \end{center} \vspace{-2.4mm} {\bf else} \vspace{-2.4mm} \begin{center} \begin{minipage}[b]{60mm} \vspace{-2.4mm} {\bf return } $x_\hi $ \end{minipage} \end{center} \vspace{-2.4mm} {\bf end if} \end{minipage} \end{center} \vspace{-2.4mm} {\bf end if} \end{minipage} \end{center} \end{algorithm} \begin{theorem}[Correctness of the final rounding procedure \ref{algarrpres}]\label{corralgpluspres} ~\\ Let be {\bf A} the algorithm \ref{algarrpres} said \ouvguill Final rounding to the nearest (even)\fermguill. Let be $x_\hi + x_\mi + x_\lo$ triple-double number for which the preconditions of algorithm {\bf A} hold. Let us notate $x^\prime$ the double precision number returned by the procedure. \\ So $$x^\prime = \circ \left( x_\hi + x_\mi + x_\lo \right)$$ i.e. {\bf A} is a correct rounding procedure for round-to-nearest-ties-to-even mode. \end{theorem} \begin{proof} ~ \\ During this proof we will proceed as follows: one easily sees that the presented procedure can only return four different results which are $x_\hi \oplus x_\mi$, $x_\hi$, $x_\hi^+$ and $x_\hi^-$. The choices made by the branches of the algorithm imply for each of this results additional hypotheses on the arguments' values. It will therefore suffice to show for each of this four choices that the rounding of the arguments is equal to the result returned under this hypotheses. In contrast, the one that can be easily deduced from the tests on the branches, which use a floating point multiplication in fact, are not particularly adapted to what is needed in the proof. Using amongst others lemma \ref{equivxormult}, one sees that $9$ different simply analysable cases are possible out of which one is a special one and $8$ have a very regular form: \begin{enumerate} \item If the first branch is taken, we know that $$x_\mi \not = \sgn\left( x_\hi \right) \cdot \frac{1}{2} \cdot \mUlp \left( x_\hi \right)$$ and that $$x_\mi \not = - \sgn\left( x_\hi \right) \cdot \left \lbrace \begin{array}{ll} \frac{1}{4} \cdot \mUlp \left( x_\hi \right) & \mbox{ if } \exists e \in \Z \mbox{ . } 2^e = x_\hi \\ \frac{1}{2} \cdot \mUlp \left( x_\hi \right) & \mbox{ otherwise} \end{array} \right.$$ as per lemmas \ref{genmiquartulp}, \ref{genmiulp} and \ref{gensigne}. In this case $x_\hi \oplus x_\mi$ will be returned. \item If the first branch is not taken, we know already very well the absolute value of $x_\mi$: we can therefore suppose that $$\left \vert x_\mi \right \vert = \left \lbrace \begin{array}{ll} \frac{1}{4} \cdot \mUlp \left( x_\hi \right) & \mbox{ if } \exists e \in \Z \mbox{ . } 2^e = x_\hi \\ \frac{1}{2} \cdot \mUlp \left( x_\hi \right) & \mbox{ otherwise} \end{array} \right.$$ It is thus natural that $x_\mi$ does not play any role in the following computations of the value to be returned but by its sign. Using \ref{equivxormult} we know that the two tests that follow are equivalent to {{\bf if} $x_\mi > 0 \xor x_\lo > 0$} and to {{\bf if} $x_\hi > 0 \xor x_\lo > 0$}. It is easy to check that the values returned depending on the signs of $x_\hi$, $x_\mi$ and $x_\lo$ obey to this scheme: \begin{center} \begin{tabular}{l|ccc|cc|c|c} Case & $x_\hi$ & $x_\mi$ & $x_\lo$ & $x_\mi \xor x_\lo$ & $x_\hi \xor x_\lo$ & Return val. $x^\prime$ & Interpreted val. $x^\prime$ \\ \hline a.) & + & + & + & + & + & $x_\hi^+$ & $\succ\left( x_\hi \right)$ \\ b.) & + & + & - & - & - & $x_\hi$ & $x_\hi$ \\ c.) & + & - & + & - & + & $x_\hi$ & $x_\hi$ \\ d.) & + & - & - & + & - & $x_\hi^-$ & $\pred\left( x_\hi \right)$ \\ e.) & - & + & + & + & - & $x_\hi^-$ & $\succ\left( x_\hi \right)$ \\ f.) & - & + & - & - & + & $x_\hi$ & $x_\hi$ \\ g.) & - & - & + & - & - & $x_\hi$ & $x_\hi$ \\ h.) & - & - & - & + & + & $x_\hi^+$ & $\pred\left( x_\hi \right)$ \end{tabular} \end{center} We see now that the returned value $x^\prime$ expressed as $x_\hi$, $\succ\left(x_\hi\right)$ or $\pred\left(x_\hi\right)$ in cases a.) through d.) are equivalent to cases h.) through e.). We will consider them thus equivalently; of course, doing so, we will not any longer be able to suppose anything concerning the magnitude and the sign of $x_\hi$. \end{enumerate} Let us start the proof by showing the correctness of the first case. Since $x_\hi$ and $x_\mi$ do not overlap by hypothesis, we know by definition \ref{defoverlap} that $$\left \vert x_\mi \right \vert < \mUlp\left( x_\hi \right)$$ So we can notate the following $$x_\mi \in I^\prime_1 \cup I^\prime_2 \cup I^\prime_3 \cup I^\prime_4 \cup I^\prime_5 \cup I^\prime_6$$ with \begin{eqnarray*} I^\prime_1 & = & \left] - \mUlp\left( x_\hi \right) ; -\frac{3}{4} \cdot \mUlp\left(x_\hi \right) \right] \\ I^\prime_2 & = & \left] -\frac{3}{4} \cdot \mUlp\left(x_\hi \right) ; - \frac{1}{2} \cdot \mUlp\left(x_\hi \right) \right[ \\ I^\prime_3 & = & \left[ - \frac{1}{2} \cdot \mUlp\left(x_\hi \right); -\tau \right[ \\ I^\prime_4 & = & \left] -\tau ; 0 \right] \\ I^\prime_5 & = & \left[ 0; \frac{1}{2} \cdot \mUlp\left(x_\hi\right) \right[ \\ I^\prime_6 & = & \left ] \frac{1}{2} \cdot \mUlp\left( x_\hi \right) ; \mUlp\left( x_\hi \right) \right [ \end{eqnarray*} where $$\tau = \left \lbrace \begin{array}{ll} \frac{1}{4} \cdot \mUlp \left( x_\hi \right) & \mbox{ if } \exists e \in \Z \mbox{ . } 2^e = x_\hi \\ \frac{1}{2} \cdot \mUlp \left( x_\hi \right) & \mbox{ otherwise} \end{array} \right.$$ This is equivalent to claiming $$x_\mi \in I_1 \cup I_2 \cup I_3 \cup I_4 \cup I_5 \cup I_6$$ where \begin{eqnarray*} I_1 & = & \left [ \left( -\mUlp\left( x_\hi \right) \right)^- ; \left( -\frac{3}{4} \cdot \mUlp\left(x_\hi \right) \right)^+ \right] \\ I_2 & = & \left [ \left( \frac{3}{4} \cdot \mUlp\left( x_\hi \right) \right)^- ; \left(- \frac{1}{2} \cdot \mUlp\left(x_\hi \right)\right)^+ \right] \\ I_3 & = & \left [ \left( -\frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right)^- ; \left( -\tau \right)^+ \right] \\ I_4 & = & \left [ \left( -\tau \right)^- ; 0 \right] \\ I_5 & = & \left [ 0 ; \left( \frac{1}{2} \cdot \mUlp\left(x_\hi\right) \right)^- \right] \\ I_6 & = & \left [ \left(\frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right)^+ ; \left( \mUlp\left( x_\hi \right) \right)^- \right ] \end{eqnarray*} because $x_\mi$ is a floating point number and because all bounds of the intervals are floating point numbers, too. So we can express their predecessors and successors by $z^+$ and $z^-$. Thus $\forall i=1,\dots,6 \mbox{ . } I^\prime_i = I_i$. It is clear that the set of floating point numbers $I_3$ is empty if $\tau = \frac{1}{2} \cdot \mUlp\left( x_\hi \right)$.\\ Further we know that $x_\mi$ and $x_\lo$ do not overlap and that $x_\mi = \circ \left( x_\mi + x_\lo \right)$ by hypothesis. This means that $$\left \vert x_\lo \right \vert \leq \frac{1}{2} \cdot \mUlp \left( x_\mi \right) \leq \frac{1}{2} \cdot \mUlp\left( \mUlp \left( x_\hi \right) \right)$$ and we can write $$x_\mi + x_\lo \in \left( J_1 \cup J_2 \cup J_3 \cup J_4 \cup J_5 \cup J_6\right) \backslash U$$ with \begin{eqnarray*} J_1 & = & \left [ \left( -\mUlp\left( x_\hi \right) \right)^- - \frac{1}{2} \cdot \mUlp\left( \mUlp \left( x_\hi \right) \right) ; \left( - \frac{3}{4} \cdot \mUlp\left( x_\hi \right) \right)^+ + \frac{1}{2} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right) \right] \\ J_2 & = & \left[ \left( - \frac{3}{4} \cdot \mUlp\left( x_\hi \right) \right)^- - \frac{1}{2} \cdot \mUlp \left( \mUlp\left( x_\hi \right) \right) ; \left(-\frac{1}{2} \cdot \mUlp\left(x_\hi \right)\right)^+ + \frac{1}{2} \cdot \mUlp\left( \mUlp \left( x_\hi \right) \right) \right] \\ J_3 & = & \left [ \left(- \frac{1}{2} \cdot \mUlp\left(x_\hi \right)\right)^- - \frac{1}{2} \cdot \mUlp\left( \xi_1 \right) ; \left( -\tau \right)^+ + \frac{1}{2} \cdot \mUlp\left( \xi_1 \right) \right] \\ J_4 & = & \left [ \left( -\tau \right)^- - \frac{1}{2} \cdot \mUlp\left( \xi_2 \right) ; 0 \right] \\ J_5 & = & \left [ 0; \left( \frac{1}{2} \cdot \mUlp\left(x_\hi\right) \right)^- + \frac{1}{2} \cdot \mUlp\left( \xi_3 \right) \right] \\ J_6 & = & \left [ \left(\frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right)^+ - \frac{1}{2} \cdot \mUlp\left( \mUlp \left( x_\hi \right) \right); \left( \mUlp\left( x_\hi \right) \right)^- + \frac{1}{2} \cdot \mUlp\left( \mUlp \left( x_\hi \right) \right) \right ] \end{eqnarray*} where \begin{eqnarray*} \xi_1 & = & \frac{1}{2} \cdot \mUlp\left(x_\hi\right) \in I_3 \\ \xi_2 & = & \tau \in I_4 \\ \xi_3 & = & \frac{1}{2} \cdot \mUlp\left(x_\hi\right) \in I_5 \end{eqnarray*} and where $U$ is the set of the impossible cases for $x_\mi + x_\lo$. The word \ouvguill impossible\fermguill~ refers here to the facts caused by the property that $x_\mi = \circ \left( x_\mi + x_\lo \right)$. \\ Let us still remark that the intervals $J_3$, $J_4$ and $J_5$ are well defined as per lemma \ref{ulpmonoton} and that it is important to see that it does not suffice to estimate their bounds by the less exact inequality that follows: $$\mUlp \left( x_\mi \right) \leq \mUlp\left( \mUlp \left( x_\hi \right) \right)$$ which would mean that $$\xi_i = \mUlp\left( x_\hi \right)$$ Since the images of the $\mUlp$ function are always integer powers of $2$, the difference of their predecessors and themselves can be as small as half an $\mUlp$ of an $\mUlp$ of $x_\hi$ which would be a too inexact estimate. \\ Let us continue now with the simplification of the bounds of the intervals $J_i$. The purpose of this will be showing that $x_\mi + x_\lo$ are always intervals such that one can decide the rounding $\circ \left( x_\hi + \left( x_\mi + x_\lo \right) \right)$ without using the rule of even rounding. Let us remark already that we know that $\forall i=1,\dots,6 \mbox{ . } I_i \subseteq J_i$.\\ Since $\mUlp\left( x_\hi \right)$ is a non-subnormal floating point number that is positive and equal to an integer power of $2$, we get using lemmas \ref{commut} and \ref{poweroftwo} that \begin{eqnarray*} \left( - \mUlp\left( x_\hi \right) \right)^- - \frac{1}{2} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right) & = & - \mUlp\left( x_\hi \right)^- - \frac{1}{2} \cdot \left( \mUlp\left( x_\hi \right)^+ - \mUlp\left( x_\hi \right) \right) \\ & = & - \mUlp\left( x_\hi \right) + \left( \mUlp\left( x_\hi \right) - \mUlp\left( x_\hi \right)^- \right) \\ & & - \frac{1}{2} \cdot \left( \mUlp\left( x_\hi \right)^+ - \mUlp\left( x_\hi \right) \right) \\ & = & - \mUlp\left( x_\hi \right) \end{eqnarray*} and similarly \begin{eqnarray*} \mUlp\left( x_\hi \right)^- + \frac{1}{2} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right) & = & \mUlp\left( x_\hi \right)^- + \frac{1}{2} \cdot \left( \mUlp\left( x_\hi \right)^+ - \mUlp\left( x_\hi \right) \right) \\ & = & \mUlp\left( x_\hi \right)^- + \left( \mUlp\left( x_\hi \right) - \mUlp\left( x_\hi \right)^- \right) \\ & = & \mUlp\left( x_\hi \right) \end{eqnarray*} Further, still analogously to the previous cases and using lemma \ref{multhalf}, \begin{eqnarray*} \left( \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right)^- + \frac{1}{2} \cdot \mUlp\left( \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right) & = & \frac{1}{2} \cdot \mUlp\left( x_\hi \right)^- + \frac{1}{4} \mUlp\left( \mUlp\left( x_\hi \right) \right) \\ & = & \frac{1}{2} \cdot \left( \mUlp\left( x_\hi \right)^- + \frac{1}{2} \cdot \left( \mUlp\left( x_\hi \right)^+ - \mUlp\left( x_\hi \right) \right) \right) \\ & = & \frac{1}{2} \cdot \left( \mUlp\left( x_\hi \right)^- + \mUlp\left( x_\hi \right) - \mUlp\left( x_\hi \right)^- \right) \\ & = & \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \end{eqnarray*} and \begin{eqnarray*} \left( \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right)^+ - \frac{1}{2} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right) & = & \frac{1}{2} \cdot \mUlp\left( x_\hi \right)^+ - \frac{1}{2} \cdot \left( \mUlp\left( x_\hi \right)^+ - \mUlp\left( x_\hi \right) \right) \\ & = & \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \end{eqnarray*} Then \begin{eqnarray*} \left( - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right)^- - \frac{1}{2} \cdot \mUlp\left( \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right) & = & - \frac{1}{2} \cdot \mUlp\left( x_\hi \right)^- - \frac{1}{4} \cdot \left( \mUlp\left( x_\hi \right)^+ - \mUlp\left( x_\hi \right) \right) \\ & = & \frac{1}{2} \cdot \left( - \mUlp\left( x_\hi \right)^- - \left( \mUlp\left( x_\hi \right) - \mUlp\left( x_\hi \right)^- \right) \right) \\ & = & - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \end{eqnarray*} further, using also lemma \ref{succtroisfoispuissdeux}, \begin{eqnarray*} \left( - \frac{3}{4} \cdot \mUlp\left( x_\hi \right) \right)^+ + \frac{1}{2} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right) & = & - \frac{1}{4} \cdot \left( 3 \cdot \mUlp\left( x_\hi \right) \right)^+ + \frac{1}{2} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right) \\ & = & - \frac{1}{4} \cdot \left( 3 \cdot \mUlp\left( x_\hi \right)^+ - \mUlp\left( \mUlp\left( x_\hi \right)\right)\right) \\ & & + \frac{1}{2} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right) \\ & = & - \frac{3}{4} \cdot \mUlp\left( x_\hi \right)^+ + \frac{3}{4} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right) \\ & = & \frac{3}{4}\cdot\left( \mUlp\left( x_\hi \right)^+ -\mUlp\left( x_\hi\right) -\mUlp\left( x_\hi \right)^+ \right) \\ & = & -\frac{3}{4} \cdot \mUlp\left( x_\hi \right) \end{eqnarray*} and, still with the same lemmas, \begin{eqnarray*} \left( - \frac{3}{4} \cdot \mUlp\left( x_\hi \right) \right)^- - \frac{1}{2} \cdot \mUlp \left( \mUlp\left( x_\hi \right) \right) & = & \frac{1}{4} \left( - 3 \mUlp\left( x_\hi \right) \right)^- - \frac{1}{2} \mUlp\left( \mUlp\left( x_\hi \right) \right) \\ & = & \frac{1}{4} \cdot \left( 3 \cdot \mUlp\left( x_\hi \right) - \left( 3 \cdot \mUlp\left( x_\hi \right) \right)^- - 3 \cdot \mUlp\left( x_\hi \right) \right) \\ & & - \frac{1}{2} \cdot \mUlp \left( \mUlp \left( x_\hi \right) \right) \\ & = & \frac{1}{4} \cdot \left( \left( 3 \cdot \mUlp\left( x_\hi \right) \right)^+ - 6 \cdot \mUlp\left( x_\hi \right) \right) - \frac{1}{2} \cdot \mUlp \left( \mUlp \left( x_\hi \right) \right) \\ & = & \frac{1}{4} \cdot \left( 3 \cdot \mUlp\left( x_\hi \right) \right)^+ - \frac{3}{2} \cdot \mUlp\left( x_\hi \right) - \frac{1}{2} \cdot \mUlp \left( \mUlp \left( x_\hi \right) \right) \\ & = & \frac{1}{4} \cdot \left( 3 \cdot \mUlp\left( x_\hi \right)^+ - \mUlp\left(\mUlp\left(x_\hi\right)\right) \right)\\ & & - \frac{3}{2} \cdot \mUlp\left( x_\hi \right) - \frac{1}{2} \cdot \mUlp \left( \mUlp\left( x_\hi \right) \right) \\ & = & \frac{3}{4} \cdot \left( \mUlp\left( x_\hi \right)^+ - 2 \cdot \mUlp\left( x_\hi \right) - \mUlp\left( \mUlp \left( x_\hi \right) \right) \right) \\ & = & \frac{3}{4} \cdot \left( \mUlp\left( x_\hi \right)^+ - 2 \cdot \mUlp\left( x_\hi \right) - \mUlp\left( x_\hi\right)^+ + \mUlp\left( x_\hi \right) \right) \\ & = & - \frac{3}{4} \cdot \mUlp\left( x_\hi \right) \end{eqnarray*} and finally \begin{eqnarray*} \left( - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right)^+ + \frac{1}{2} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right) & = & \frac{1}{2} \cdot \left( - \mUlp\left( x_\hi \right)^+ + \mUlp\left( x_\hi \right)^+ - \mUlp\left( x_\hi \right) \right) \\ & = & - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \end{eqnarray*} For each bound that depends on $\tau$ we are obliged to treat two different cases.\\ Let us suppose first that $$\tau = \frac{1}{4} \cdot \mUlp \left( x_\hi \right) $$ So we get \begin{eqnarray*} \left( - \frac{1}{4} \cdot \mUlp\left( x_\hi \right) \right)^- - \frac{1}{2} \cdot \mUlp\left( \frac{1}{4} \cdot \mUlp\left( x_\hi \right) \right) & = & \frac{1}{4} \cdot \left( - \mUlp\left( x_\hi \right)^- - \frac{1}{2} \cdot \left( \mUlp\left( x_\hi \right)^+ - \mUlp\left( x_\hi \right) \right) \right) \\ & = & \frac{1}{4} \cdot \left( - \mUlp\left( x_\hi \right)^- - \left( \mUlp\left( x_\hi \right)^- - \mUlp\left( x_\hi \right) \right) \right) \\ & = & \frac{1}{4} \cdot \left( - \mUlp\left( x_\hi \right)^- - \mUlp\left( x_\hi \right)^- + \mUlp\left( x_\hi \right) \right) \\ & = & \frac{1}{4} \cdot \mUlp\left( x_\hi \right) \end{eqnarray*} and \begin{eqnarray*} \left( - \frac{1}{4} \cdot \mUlp\left( x_\hi \right) \right)^+ + \frac{1}{2} \cdot \mUlp\left( \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right) & = & \frac{1}{4} \cdot \left( - \mUlp\left( x_\hi \right)^+ + \mUlp\left( x_\hi \right)^+ - \mUlp\left( x_\hi \right) \right) \\ & = & - \frac{1}{4} \cdot \mUlp\left( x_\hi \right) \end{eqnarray*} Let us suppose now $$\tau = \frac{1}{2} \cdot \mUlp \left( x_\hi \right) $$ We get thus \begin{eqnarray*} \left( - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right)^- - \frac{1}{2} \cdot \mUlp\left( \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right) & = & \frac{1}{2} \cdot \left( - \mUlp\left( x_\hi \right)^- - \frac{1}{2} \cdot \left( \mUlp\left( x_\hi \right)^+ - \mUlp\left( x_\hi \right) \right) \right) \\ & = & \frac{1}{2} \cdot \left( - \mUlp\left( x_\hi \right)^- - \left( \mUlp\left( x_\hi \right)^- - \mUlp\left( x_\hi \right) \right) \right) \\ & = & \frac{1}{2} \cdot \left( - \mUlp\left( x_\hi \right)^- - \mUlp\left( x_\hi \right)^- + \mUlp\left( x_\hi \right) \right) \\ & = & \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \end{eqnarray*} and \begin{eqnarray*} \left( - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right)^+ + \frac{1}{2} \cdot \mUlp\left( \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right) & = & \left(- \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right)^+ + \frac{1}{4} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right) \\ & \leq & \left(- \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right)^+ + \frac{1}{2} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right) \\ & = & -\frac{1}{2} \cdot \mUlp\left( x_\hi \right) \end{eqnarray*} Finally, for all cases, we observe the following intervals: $$x_\mi + x_\lo \in \left( J_1 \cup J_2 \cup J_3 \cup J_4 \cup J_5 \cup J_6 \right) \backslash U$$ with \begin{eqnarray*} J_1 & = & \left[ - \mUlp\left( x_\hi \right) ; - \frac{3}{4} \cdot \mUlp\left( x_\hi \right) \right] \\ J_2 & = & \left[ - \frac{3}{4} \cdot \mUlp\left( x_\hi \right) ; - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right] \\ J_3 & = & \left[ - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) ; - \tau \right] \\ J_4 & = & \left[ - \tau ; 0 \right] \\ J_5 & = & \left[ 0 ; \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right] \\ J_6 & = & \left[ \frac{1}{2} \cdot \mUlp\left( x_\hi \right) ; \mUlp\left( x_\hi \right) \right] \end{eqnarray*} Let us now consider more precisely the set $U$ if impossible cases due to the property that $x_\mi = \circ \left( x_\mi + x_\lo \right)$ and due to the fact that $x_\lo \not = 0$: \\ Let us show that $\frac{1}{2} \cdot \mUlp\left( x_\hi \right) \in U$, i.e. $$x_\mi + x_\lo \not = \frac{1}{2} \cdot \mUlp\left( x_\hi \right)$$ Let us suppose that this would not be the case. We would get $$x_\mi + x_\lo = \frac{1}{2} \cdot \mUlp\left( x_\hi \right)$$ As $x_\mi \not = \frac{1}{2} \cdot \mUlp\left( x_\hi \right)$ as per hypothesis in this branch of the algorithm and because $x_\lo \not = 0$, there must exist a number $\mu \in \R \backslash \left \lbrace 0 \right \rbrace$ such that $x_\mi = \frac{1}{2} \cdot \mUlp\left( x_\hi \right) + \mu$ and that $x_\lo = -\mu$. \\ Since $x_\lo = \mu$ must hold, $\mu$ must be a floating point number. Further $$\left \vert \mu \right \vert = \left \vert x_\lo \right \vert \leq \frac{1}{2} \cdot \mUlp\left( x_\mi \right)$$ must be justified. So there exist two floating point numbers $\frac{1}{2} \cdot \mUlp\left( x_\hi \right)$ and $x_\mi$ such that their difference verifies \begin{eqnarray*} \left \vert x_\mi - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right \vert & = & \left \vert \frac{1}{2} \cdot \mUlp\left( x_\hi \right) + \mu - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right \vert \\ & = & \left \vert \mu \right \vert \\ & \leq & \frac{1}{2} \cdot \mUlp\left( x_\mi \right) \end{eqnarray*} which is possible only if $x_\mi$ is exactly an integer power of $2$. In contrast, as $\frac{1}{2} \cdot \mUlp\left( x_\hi \right)$ is the only one in the interval that is possible for $x_\mi$, which is by the way $\left] \frac{1}{4} \cdot \mUlp\left( x_\hi \right) ; \mUlp\left( x_\hi \right) \right[$, we obtain a contradiction. \\ Using a completely analogous argument, one sees further that $$-\tau \in U$$ Clearly $0 \in U$ because $x_\lo \not = 0$ and it is less in magnitude than $x_\mi$. \\ Let us show finally that $-\mUlp\left( x_\hi \right) \in U$ and that $\mUlp\left( x_\hi \right) \in U$.\\ Let us suppose that we would have $$\left \vert x_\mi + x_\lo \right \vert = \mUlp\left( x_\hi \right)$$ In contrast we know that $\left \vert x_\mi \right \vert < \mUlp\left( x_\hi \right)$. Since $x_\mi$ is a floating point number, this means that $$\left \vert x_\mi \right \vert \leq \mUlp\left( x_\hi \right)^-$$ which yields to \begin{eqnarray*} \left \vert x_\lo \right \vert & \geq & \mUlp\left( x_\hi \right) - \mUlp\left( x_\hi \right)^- \\ & = & \frac{1}{2} \cdot \left( \mUlp\left(x_\hi \right)^+ - \mUlp\left( x_\hi \right) \right) \\ & = & \frac{1}{2} \cdot \mUlp \left( \mUlp \left( x_\hi \right) \right) \end{eqnarray*} Further we know that $\left \vert x_\mi \right \vert \leq \mUlp\left( x_\hi \right)^-$ and that $\left \vert x_\lo \right \vert \leq \frac{1}{2} \cdot \mUlp\left( x_\mi \right)$. So we can check that \begin{eqnarray*} \left \vert x_\lo \right \vert & \leq & \frac{1}{2} \cdot \mUlp\left( x_\mi \right) \\ & = & \frac{1}{2} \cdot \left( \left( \mUlp\left( x_\hi \right)^- \right)^+ - \mUlp\left( x_\hi \right)^+ \right) \\ & = & \frac{1}{2} \cdot \left( \mUlp\left( x_\hi \right) - \mUlp\left( x_\hi \right)^- \right) \\ & = & \frac{1}{4} \cdot \mUlp \left( \mUlp \left( x_\hi \right) \right) \end{eqnarray*} We have thus obtained a contradiction to the hypothesis that says that $-\mUlp\left( x_\hi \right) \not \in U$ and that $\mUlp\left( x_\hi \right) \not \in U$. \\ Let us still show that in the case where $x_\hi$ is an integer power of $2$, i.e. $\exists e \in \Z \mbox{ . } x_\hi = 2^e$, $-\frac{3}{4} \cdot \mUlp\left( x_\hi \right) \in U$. Since $x_\lo \not = 0$, using a similar argument as the one given above, the problem can be reduced to showing that $x_\mi = - \frac{3}{4} \cdot \mUlp \left( x_\hi \right)$ is impossible if $x_\hi$ is an integer power of $2$. Let us suppose the contrary. Since $x_\hi$ is an integer power of $2$, its significand is even. In consequence the significand of $x_\hi^-$ is odd and the one of $x_\hi^{--}$ is again even. So $\circ\left( x_\hi + x_\mi \right) = x_\hi^{--}$ because $x_\hi + x_\mi$ is at the exact middle between $x_\hi^{--}$ and $x_\hi^{-}$ and the significand of $x_\hi^{--}$ is even. It follows that $\left( x_\hi + x_\mi \right) - \circ\left( x_\hi + x_\mi \right) = \frac{1}{2} \cdot \mUlp \left( \circ\left( x_\hi + x_\mi \right) \right)$ which is impossible as per hypothesis. \par Having shown which numbers are in $U$, we can rewrite our intervals as follows $$x_\mi + x_\lo \in J^\prime_1 \cup J^\prime_2 \cup J^\prime_3 \cup J^\prime_4 \cup J^\prime_5 \cup J^\prime_6$$ with \begin{eqnarray*} J^\prime_1 & = & \left] - \mUlp\left( x_\hi \right) ; - \frac{3}{4} \cdot \mUlp\left( x_\hi \right) \right] \\ J^\prime_2 & = & \left] - \frac{3}{4} \cdot \mUlp\left( x_\hi \right) ; - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right[ \\ J^\prime_3 & = & \left] - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) ; - \tau \right[ \\ J^\prime_4 & = & \left] - \tau ; 0 \right] \\ J^\prime_5 & = & \left[ 0 ; \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \right[ \\ J^\prime_6 & = & \left] \frac{1}{2} \cdot \mUlp\left( x_\hi \right) ; \mUlp\left( x_\hi \right) \right[ \end{eqnarray*} One can trivially check that the rounding $\circ \left( x_\hi + \left( x_\mi + x_\lo \right) \right)$ can be decided without using the rule for even rounding. In particular the cases present themselves as follows \cite{IEEE754}: $$\circ \left( x_\hi + \left( x_\mi + x_\lo\right) \right) = \left \lbrace \begin{array}{ll} x_\hi^{--} & \mbox{ if } x_\mi + x_\lo \in J^\prime_1 \land \exists e \in \Z \mbox{ . } 2^e = x_\hi \\ x_\hi^- & \mbox{ if } x_\mi + x_\lo \in J^\prime_1 \land \lnot \exists e \in \Z \mbox{ . } 2^e = x_\hi \\ x_\hi^- & \mbox{ if } x_\mi + x_\lo \in J^\prime_2\\ x_\hi^- & \mbox{ if } x_\mi + x_\lo \in J^\prime_3\\ x_\hi & \mbox{ if } x_\mi + x_\lo \in J^\prime_4 \\ x_\hi & \mbox{ if } x_\mi + x_\lo \in J^\prime_5\\ x_\hi^+ & \mbox{ if } x_\mi + x_\lo \in J^\prime_6\\ \end{array} \right.$$ which can be compared to $$\circ \left( x_\hi + x_\mi \right) = \left \lbrace \begin{array}{ll} x_\hi^{--} & \mbox{ if } x_\mi \in I^\prime_1 \land \exists e \in \Z \mbox{ . } 2^e = x_\hi \\ x_\hi^- & \mbox{ if } x_\mi \in I^\prime_1 \land \lnot \exists e \in \Z \mbox{ . } 2^e = x_\hi \\ x_\hi^- & \mbox{ if } x_\mi \in I^\prime_2\\ x_\hi^- & \mbox{ if } x_\mi \in I^\prime_3\\ x_\hi & \mbox{ if } x_\mi \in I^\prime_4 \\ x_\hi & \mbox{ if } x_\mi \in I^\prime_5\\ x_\hi^+ & \mbox{ if } x_\mi \in I^\prime_6\\ \end{array} \right.$$ Additionally we check that $$\forall i=1, \dots ,6 \mbox{ . } J^\prime_i \subseteq I^\prime_i$$ We would therefore get an immediate contradiction if we supposed that $$\circ \left( x_\hi + \left( x_\mi + x_\lo \right) \right) \not = \circ \left( x_\hi + x_\mi \right)$$ This finishes the proof for the first case.\\ ~ \\ Let us consider now subcases a.) through d.) of the second main case of the proof. We have already shown that the subcases h.) through e.) are equal to the first ones. Without loss of generality we will only analyse the case where $x_\hi > 0$. The set of the floating point numbers as well as the rounding function $\circ \left( \hat{x} \right)$ are symmetrical around $0$. We can therefore suppose that $$x_\mi = - \left \lbrace \begin{array}{ll} \frac{1}{4} \cdot \mUlp\left(x_\hi \right) & \mbox{if } \exists e \in \Z \mbox{ . } 2^e = x_\hi \\ \frac{1}{2} \cdot \mUlp\left(x_\hi \right) & \mbox{otherwise} \end{array} \right.$$ or that $$x_\mi = \frac{1}{2} \cdot \mUlp\left(x_\hi \right)$$ depending on whether $x_\mi$ is negative or positive.\\ It is clear that one can suppose that $$\left \vert x_\mi + x_\lo \right \vert < \mUlp\left( x_\hi \right)$$ because otherwise we would have $\left \vert x_\lo \right \vert \geq \frac{1}{2} \cdot \mUlp\left( x_\hi \right)$ whilst $\left \vert x_\lo \right \vert \leq 2^{-53} \cdot \mUlp\left( x_\hi \right)$.\\ Let us treat now the four cases one after another: { \renewcommand{\labelenumi}{\alph{enumi}.)} \begin{enumerate} \item We can suppose in this case that $x_\mi > 0$ and that $x_\lo > 0$: \\ So $$\mUlp\left( x_\hi \right) > x_\mi + x_\lo > \frac{1}{2} \cdot \mUlp\left(x_\hi \right)$$ Thus since the inequalities are strict $$\circ \left( x_\hi + \left( x_\mi + x_\lo \right) \right) = x_\hi^+ = \succ\left( x_\hi \right)$$ which is the number returned by the algorithm. \item We have here $x_\mi > 0$ and $x_\lo < 0$: \\ So the same way, we know that $$x_\mi + x_\lo < \frac{1}{2} \cdot \mUlp\left(x_\hi \right)$$ Additionally, we know that $x_\lo \geq -2^{-53} \cdot \mUlp\left(x_\hi \right) > -\frac{1}{4} \cdot \mUlp\left( x_\hi \right)$. This yields thus to $$\circ \left( x_\hi + \left( x_\mi + x_\lo \right) \right) = x_\hi$$ The correctness of the algorithm is therefore verified also in this case. \item In this case one knows that $x_\mi < 0$ and $x_\lo > 0$. In consequence $$x_\mi = - \tau$$ with $$\tau = \left \lbrace \begin{array}{ll} \frac{1}{4} \cdot \mUlp\left(x_\hi \right) & \mbox{if } \exists e \in \Z \mbox{ . } 2^e = x_\hi \\ \frac{1}{2} \cdot \mUlp\left(x_\hi \right) & \mbox{otherwise} \end{array} \right.$$ Thus we get $$\frac{1}{4} \cdot \mUlp\left( x_\hi \right) > 2^{-53} \cdot \mUlp \left( x_\hi \right) > x_\mi + x_\lo > -\tau$$ mentioning analogous arguments as the ones given above. This yields to $$\circ \left( x_\hi + \left( x_\mi + x_\lo \right) \right) = x_\hi$$ which is the number returned by the algorithm. \item Finally if $x_\mi < 0$ and $x_\lo < 0$ one checks that $$-2 \cdot \tau < x_\mi + x_\lo < -\tau$$ The lower bound given for $x_\mi + x_\lo$ can be explained as follows. If $\tau = \frac{1}{2} \cdot \mUlp\left( x_\hi \right)$, it trivially holds due to the bound: $$\left \vert x_\mi + x_\lo \right \vert < \mUlp\left( x_\hi \right)$$ We have already indicated this bound. Otherwise we know that $\tau = \frac{1}{4} \cdot \mUlp\left( x_\hi \right)$ and that $x_\mi = -\tau$. Since $\left \vert x_\lo \right \vert \leq 2^{-53} \cdot \left \vert x_\mi \right \vert$, one gets $$x_\mi + x_\lo > - \left( \frac{1}{4} + 2^{-55} \right) \cdot \mUlp\left( x_\hi \right) > -2 \cdot \tau$$ Thus the bounds obtained for $x_\mi + x_\lo$ imply always that $$\circ \left( x_\hi + \left( x_\mi + x_\lo \right) \right) = x_\hi^- = \pred\left( x_\hi \right)$$ Thus in this subcase, too, and therefore in all cases, the algorithm returns a floating point number $x^\prime$ which is equal to $\circ \left( x_\hi + x_\mi + x_\lo \right)$. \end{enumerate} } By this final statement we have finished the proof.\qed \end{proof} \subsection{Final rounding for the directed modes} As we have already mentioned, the three directed rounding modes behave all in a similar fashion. On the one hand we have $$\forall \hat{x} \in \R \mbox{ . } \diamond \left( \hat{x} \right) = \left \lbrace \begin{array}{ll} \triangledown \left( \hat{x} \right) & \mbox{ if } \hat{x} < 0 \\ \vartriangle \left( \hat{x} \right) & \mbox{ otherwise} \end{array} \right. $$ On the other hand, one can check that $$\forall \hat{x} \in \R \mbox{ . } \vartriangle \left( \hat{x} \right) = - \triangledown \left( - \hat{x} \right)$$ The given equations are also verified on the set of the floating point numbers $\F$ \cite{Defour-thesis, IEEE754}. We will therefore refrain from treating each directed rounding mode separately but we will consider them all in common. So slightly deriving from our notations, we will notate $\diamond$ the rounding function of all possible three directed rounding modes.\par Further we suppose that we dispose of a correct rounding procedure for each directed rounding mode capable of rounding a double number $x_\hi + x_\lo$. This procedure will return in fact $\diamond \left( x_\hi + x_\lo \right)$ \cite{crlibmweb, Defour-thesis}. For constructing a correct rounding procedure for triple-double precision, we will try to give a reduction procedure for reducing a triple-double number into a double-double number such that the directed rounding of both triple-double and double-double numbers be equal. \begin{lemma}[Directed rounding decision] \label{decarrdir} ~ \\ Let be $x \in \F$ a floating point number. \\ Let be $\mu, \nu \in \R$ two real numbers such that $\left \vert \mu \right \vert < \mUlp\left( x \right)$ and $\left \vert \nu \right \vert < \mUlp\left( x \right)$ and that $$\sgn\left( \mu \right) = \sgn\left( \nu \right)$$ So the following equation holds $$\diamond \left( x + \mu \right) = \diamond\left( x + \nu \right)$$ \end{lemma} \begin{proof} ~ \\ We know by definition of the rounding mode, e.g. by the one of rounding $\vartriangle$ towards $+\infty$ that $$\forall y \in \F, \mu \in \R, \left \vert \mu \right \vert < \mUlp\left( y \right) \mbox{ . } \vartriangle \left( y + \rho \right) = \left \lbrace \begin{array}{ll} \succ\left(y\right) & \mbox{ if } \rho > 0 \\ y & \mbox{ otherwise} \end{array} \right. $$ In fact, the rounding result $\vartriangle\left( y + \rho \right)$ is the smallest floating point number greater or equal to $y + \rho$. \\ Since $x$ is a floating point number and as $\pred\left( x \right) < x + \mu < \succ\left( x \right)$ and $\pred\left( x \right) < x + \mu < \succ\left( x \right)$ because $\left \vert \mu \right \vert < \mUlp\left( x \right)$ and $\left \vert \mu \right \vert < \mUlp\left( x \right)$, supposing that $\diamond \left( x + \mu \right) \not = \diamond \left( x + \nu \right)$ would yield to an immediate contradiction.\qed \end{proof} \begin{lemma}[Disturbed directed rounding] \label{arrdirper} ~ \\ Let be $\hat{x} \in \R$ a real number and $x = \circ\left( \hat{x} \right) \in \F$ the (even) floating point number nearest to $\hat{x}$. Let be $\xi\left(\hat{x}\right) = \hat{x} - x$. \\ Let be $\delta \in \R$ such that $$\left \vert \delta \right \vert < \left \vert \xi\left(\hat{x}\right) \right \vert$$ So the following equation holds $$\diamond \left( \hat{x} \right) = \diamond \left( \hat{x} + \delta \right)$$ \end{lemma} Let us remark still that the inequality in hypothesis -- $\left \vert \delta \right \vert < \left \vert \xi\left( \hat{x} \right) \right \vert$ -- must be assured to be strict. \begin{proof} ~ \\ We know already that $$\diamond \left( \hat{x} + \delta \right) = \diamond \left( x + \xi\left( \hat{x} \right) + \delta \right)$$ Let us show now that $\xi\left( \hat{x} \right)$ and $\xi\left( \hat{x} \right) + \delta$ have the same sign. Let us therefore suppose that this would not be the case. Without loss of generality, it suffices to consider the case where $\xi\left( \hat{x} \right)$ is positive; the inverse case can be treated completely analogously. \\ Thus $$\xi\left( \hat{x} \right) \geq 0$$ and $$\xi\left( \hat{x} \right) + \delta < 0$$ In consequence $$\xi\left( \hat{x} \right) < - \delta$$ On the other hand $$\left \vert \delta \right \vert < \left \vert \xi\left( \hat{x} \right) \right \vert$$ Thus $$0 \leq \xi\left( \hat{x} \right) < \xi\left( \hat{x} \right)$$ which yields to $$\xi\left( \hat{x} \right) = 0$$ In this case we know that $$\delta = 0$$ as per the hypotheses of the theorem. Thus contradiction and we know that $\xi\left( \hat{x} \right)$ and $\xi\left( \hat{x} \right) + \delta$ have really the same sign.\\ It is clear that $\xi\left( \hat{x} \right) \leq \frac{1}{2} \cdot \mUlp\left( x \right)$ because the rounding of $\hat{x}$ towards $x$ is done to the nearest floating point number. In consequence, since $\delta < \xi\left( \hat{x} \right)$ we obtain $$\xi\left( \hat{x} \right) + \delta < \mUlp\left( x \right)$$ As $x$ is a floating point number it suffices thus to conclude using lemma \ref{decarrdir} by putting $\mu = \xi\left( \hat{x} \right)$ and $\nu = \xi\left( \hat{x} \right) + \delta$.\qed \end{proof} \begin{lemma}[Reduction of a triple-double into a double-double -- simple case] \label{moinsquunmiulp} ~ \\ Let be $x_\hi + x_\mi + x_\lo \in \F + \F + \F$ a non-overlapping triple-double number such that $x_\lo$ is not subnormal, such that $x_\mi = \circ \left( x_\mi + x_\lo \right)$ and such that $\left \vert x_\mi \right \vert < \tau$ where $$\tau = \left \lbrace \begin{array}{ll} \frac{1}{4} \cdot \mUlp\left( x_\hi \right) & \mbox{ if } \exists e \in \Z \mbox{ . } 2^e = \left \vert x_\hi \right \vert \land \sgn\left( x_\mi \right) = -\sgn\left( x_\hi \right)\\ \frac{1}{2} \cdot \mUlp\left( x_\hi \right) & \mbox{ otherwise} \end{array} \right.$$ Given the instruction sequence below: \begin{center} \begin{minipage}[b]{50mm} $\left( t_1, t_2 \right) \gets \mAdd\left( x_\hi, x_\mi \right)$ \\ $t_3 \gets t_2 \oplus x_\lo$ \end{minipage} \end{center} the following equation holds after the execution of the sequence $$\diamond\left( t_1 + t_3 \right) = \diamond\left( x_\hi + x_\mi + x_\lo \right)$$ \end{lemma} \begin{proof} ~ \\ Due to the hypothesis that $\left \vert x_\mi \right \vert < \tau$ we can suppose that $x_\hi = \circ \left( x_\hi + x_\mi \right)$. In consequence, using the properties of the \Add~ procedure, we know that we have exactly $$t_1 = \circ \left( x_\hi + x_\mi \right) = x_\hi$$ and $$t_2 = x_\hi + x_\mi - t_1 = x_\mi$$ So since as per hypothesis we have $x_\mi = \circ \left( x_\mi + x_\lo \right)$, we know also that $t_3$ verifies exactly $$t_3 = x_\mi \oplus x_\lo = \circ\left( x_\mi + x_\lo \right) = x_\mi$$ Let us put now $$\delta = x_\lo$$ and $$\hat{x} = t_1 + t_3$$ Clearly we get \begin{eqnarray*} \xi\left( \hat{x} \right) & = & \hat{x} - \circ\left( \hat{x} \right) \\ & = & t_1 + t_3 - \circ\left( t_1 + t_3 \right) \\ & = & x_\hi + x_\mi - \circ\left( x_\hi + x_\mi \right) \\ & = & x_\hi + x_\mi - x_\hi \\ & = & x_\mi \end{eqnarray*} Let us show now that $$\left \vert \delta \right \vert < \left \vert \xi\left( \hat{x} \right) \right \vert$$ Amongst other by the lemma's hypotheses and due to the fact that $x_\mi \not = 0$, we can check that \begin{eqnarray*} \left \vert \xi\left( \hat{x} \right) \right \vert & = & \left \vert x_\mi \right \vert \\ & > & 2^{-53} \cdot \left \vert x_\mi \right \vert \\ & \geq & \left \vert x_\lo \right \vert \end{eqnarray*} The inequality the lemma \ref{arrdirper} asks for in hypothesis is well verified.\\ So as per the same lemma \ref{arrdirper} we know that $$\diamond \left( \hat{x} + \delta \right) = \diamond\left( \hat{x} \right)$$ This means that $$\diamond \left( x_\hi + x_\mi + x_\lo \right) = \diamond\left( t_1 + t_3 \right)$$ which is the equation that was to be shown.\qed \end{proof} \begin{lemma}[Reduction of a triple-double into a double-double -- difficult case] \label{plusdunmiulp} ~ \\ Let be $x_\hi + x_\mi + x_\lo \in \F + \F + \F$ a non-overlapping triple-double number such that $x_\lo$ is not subnormal, such that $x_\mi = \circ \left( x_\mi + x_\lo \right)$ and that $\left \vert x_\mi \right \vert \geq \tau$ where $$\tau = \left \lbrace \begin{array}{ll} \frac{1}{4} \cdot \mUlp\left( x_\hi \right) & \mbox{ if } \exists e \in \Z \mbox{ . } 2^e = \left \vert x_\hi \right \vert \land \sgn\left( x_\mi \right) = -\sgn\left( x_\hi \right)\\ \frac{1}{2} \cdot \mUlp\left( x_\hi \right) & \mbox{ otherwise} \end{array} \right.$$ Given the instruction sequence below \begin{center} \begin{minipage}[b]{50mm} $\left( t_1, t_2 \right) \gets \mAdd\left( x_\hi, x_\mi \right)$ \\ $t_3 \gets t_2 \oplus x_\lo$ \end{minipage} \end{center} the following equation holds after the execution of the sequence $$\diamond\left( t_1 + t_3 \right) = \diamond\left( x_\hi + x_\mi + x_\lo \right)$$ \end{lemma} \begin{proof} ~ \\ Without loss of generality, let us suppose in the sequel that $x_\hi > 0$. This is legitime because the set of the floating point numbers is symmetrical around $0$. In fact it suffices to apply lemma \ref{commut} and definition \ref{defulp} in order to obtain a proof for each case.\\ In what follows we will proceed as that: we will decompose the problem in several cases and subcases that we will treat one after another. For each of this subcases we will show either directly the desired result or the fact that $\left \vert t_2 \right \vert \geq \left \vert x_\lo \right \vert$. In the end we will prove that this fact yields to the correctness of the lemma in each case.\\ Let us start by considering the case where $\tau = \frac{1}{2} \cdot \mUlp\left( x_\hi \right)$. Thus $x_\hi$ is not an exact integer power of $2$.\\ We therefore get $$\frac{1}{2} \leq \left \vert x_\mi \right \vert < \mUlp\left( x_\hi \right)$$ which is equivalent to $$\frac{1}{2} \leq \left \vert x_\mi \right \vert \leq \mUlp\left( x_\hi \right)^-$$ because $x_\mi$ is a floating point number.\\ We can check now that $$t_1 = \circ \left( x_\hi + x_\mi \right) = \left \lbrace \begin{array}{ll} x_\hi^+ & \mbox{ if } x_\mi > 0 \\ x_\hi & \mbox{ if } x_\mi = \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \mbox{ and the significand of } x_\hi \mbox{ is even} \\ x_\hi^- & \mbox{ if } x_\mi < 0 \end{array} \right.$$ This implies the handling of three different subcases. \\ Let as treat first the case where $t_1 = x_\hi$: \\ We get here \begin{eqnarray*} t_2 & = & x_hi + x_\mi - t_1 \\ & = & x_\hi + x_\mi - x_\hi \\ & = & x_\mi \end{eqnarray*} and further \begin{eqnarray*} t_3 & = & t_2 \oplus x_\lo \\ & = & x_\mi \oplus x_\lo \\ & = & \circ \left( x_\mi + x_\lo \right) \\ & = & x_\mi \end{eqnarray*} as per the hypothesis on the arguments. \\ So let us put \begin{eqnarray*} \hat{x} & = & t_1 + t_3 \\ \delta & = & x_\lo \end{eqnarray*} Thus \begin{eqnarray*} \hat{x} & = & x_\hi + x_\mi \\ \xi\left( \hat{x} \right) & = & \circ \left( \hat{x} \right) \\ & = & \circ \left( t_1 + t_2 \right) \\ & = & t_2 \\ & = & t_3 \end{eqnarray*} and $$\left \vert \delta \right \vert < \left \vert \xi\left( \hat{x} \right) \right \vert$$ because $$\left \vert x_\lo \right \vert \leq 2^{-53} \cdot \left \vert x_\mi \right \vert$$ et $$x_\mi \not = 0$$ Applying lemma \ref{arrdirper} we thus obtain $$\diamond \left( t_1 + t_3 \right) = \diamond \left( x_\hi + x_\mi + x_\lo \right)$$ Let us continue with the case where $t_1 = x_\hi^+$: \\ We get here \begin{eqnarray*} t_2 & = & x_\hi + x_\mi + t_1 \\ & = & x_\hi + x_\mi - x_\hi^+ \\ & = & - \left( x_\hi^+ - x_\hi \right) + x_\mi \\ & = & - \mUlp\left( x_\hi \right) + x_\mi \\ & \leq & -\mUlp\left( x_\hi \right) + \mUlp\left( x_\hi \right)^- \\ & = & - \left( \mUlp\left( x_\hi \right) - \mUlp\left( x_\hi \right)^- \right) \\ & = & - \frac{1}{2} \cdot \left( \mUlp\left( x_\hi \right)^+ - \mUlp\left( x_\hi \right) \right) \\ & = & - \frac{1}{2} \cdot \mUlp\left( \mUlp \left( x_\hi \right) \right) \end{eqnarray*} Thus $$\left \vert t_2 \right \vert \geq \frac{1}{2} \cdot \mUlp\left( \mUlp \left( x_\hi \right) \right)$$ In contrast $\left \vert x_\lo \right \vert \leq \frac{1}{2} \cdot \mUlp\left( \mUlp \left( x_\hi \right) \right)$ as per hypothesis which implies $$\left \vert t_2 \right \vert \geq \left \vert x_\lo \right \vert$$ Let us finally check the properties to be show for the third and last subcase, supposing now that $t_1 = x_\hi^-$. \\ Since $x_\hi$ is not exactly an integer power of $2$, we can check the following applying amongst other lemma \ref{notpoweroftwo}: \begin{eqnarray*} t_2 & = & x_\hi + x_\mi - t_1 \\ & = & x_\hi + x_\mi - x_\hi^- \\ & = & x_\hi^+ - x_\hi + x_\mi \\ & = & \mUlp\left( x_\hi \right) + x_\mi \\ & \geq & \mUlp\left( x_\hi \right) - \mUlp\left( x_\hi \right)^- \\ & = & \frac{1}{2} \cdot \mUlp\left( \mUlp \left( x_\hi \right) \right) \end{eqnarray*} We therefore still get $$\left \vert t_2 \right \vert \geq \left \vert x_\lo \right \vert$$ using the same argument as the one given above. \\ ~ \\ Let us handle now the case where $\tau = \frac{1}{4} \cdot \mUlp\left( x_\hi \right)$: \\ We can suppose in this case that $x_\hi$ is an exact integer power of $2$ and that $x_\mi$ is negative because we had already supposed that $x_\hi$ is positive and because we know that $\sgn\left( x_\hi \right) = -\sgn\left( x_\mi \right)$. We get further the following bounds for $x_\mi$: $$\frac{1}{4} \cdot \mUlp\left( x_\hi \right) \leq \left \vert x_\mi \right \vert \leq \mUlp\left( x_\hi \right)^-$$ which means that $$-\mUlp\left( x_\hi \right)^- \leq x_\mi \leq -\frac{1}{4} \cdot \mUlp\left( x_\hi \right)$$ still because $x_\mi$ is a floating point number. \\ Since $x_\hi$ is an integer power of $2$ and as for this reason, its significand is even, one can check that $$t_1 = \circ \left( x_\hi + x_\mi \right) = \left \lbrace \begin{array}{ll} x_\hi & \mbox{ if } x_\mi = -\frac{1}{4} \cdot \mUlp\left( x_\hi \right) \\ x_\hi^- & \mbox{ if } -\frac{1}{2} \cdot \mUlp\left( x_\hi \right) < x_\mi < -\frac{1}{4} \cdot \mUlp\left( x_\hi \right) \\ x_\hi^- & \mbox{ if } x_\mi = -\frac{1}{2} \cdot \mUlp\left( x_\hi \right) \\ x_\hi^- & \mbox{ if } -\frac{3}{4} \cdot \mUlp\left( x_\hi \right) < x_\mi < -\frac{1}{2} \cdot \mUlp\left( x_\hi \right) \\ x_\hi^{--} & \mbox{ if } -\mUlp\left( x_\hi \right)^- \leq x_\mi \leq -\frac{3}{4} \cdot \mUlp\left( x_\hi \right) \end{array} \right. $$ The assertion that $t_1 = x_\hi^-$ if $x_\mi = -\frac{1}{2} \cdot \mUlp\left( x_\hi \right)$ can be explained as follows:\\ We have \begin{eqnarray*} x_\hi + x_\mi & = & x_\hi - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \\ & = & x_\hi - \frac{1}{2} \cdot \left( x_\hi^+ - x_\hi \right) \\ & = & x_\hi - \left( x_\hi - x_\hi^- \right) \\ & = & x_\hi^- \end{eqnarray*} Thus $$\circ \left( x_\hi + x_\mi \right) = \circ \left( x_\hi^- \right) = x_\hi^-$$ because $x_\hi^-$ is clearly a floating point number. Let us consider now first the cases where we have equations, i.e. the cases where $x_\mi = -\frac{1}{4} \cdot \mUlp\left( x_\hi \right)$ and $x_\mi = - \frac{1}{2} \cdot \mUlp\left( x_\hi \right)$: \\ Let us commence by the case where $x_\mi = -\frac{1}{4} \cdot \mUlp\left( x_\hi \right)$: \\ We get here \begin{eqnarray*} t_2 & = & x_\hi + x_\mi - t_1 \\ & = & x_\hi + x_\mi - x_\hi \\ & = & x_\mi \end{eqnarray*} and we can check that the following holds by the hypotheses on the arguments \begin{eqnarray*} t_3 & = & x_\mi \oplus x_\lo \\ & = & \circ \left( x_\mi + x_\lo \right) \\ & = & x_\mi \end{eqnarray*} Let us put now \begin{eqnarray*} \hat{x} & = & t_1 + t_3 \\ \delta & = & x_\lo \\ \xi\left( \hat{x} \right) & = & \circ\left( \hat{x} \right) - \hat{x} = t_3 \end{eqnarray*} So by applying lemma \ref{arrdirper}, we get $$\diamond \left( t_1 + t_3 \right) = \diamond \left( x_\hi + x_\mi + x_\lo \right)$$ because $$\left \vert x_\lo \right \vert \leq 2^{-53} \cdot \left \vert x_\mi \right \vert$$ and $x_\mi \not = 0$ which is a hypothesis of the lemma to prove. \\ Let us now handle the second of these particular cases, i.e. the cases where $x_\mi = -\frac{1}{2} \cdot \mUlp\left( x_\hi \right)$: \\ We get \begin{eqnarray*} t_2 & = & x_\hi + x_\mi - t_1 \\ & = & x_\hi + x_\mi - x_\hi^- \\ & = & \frac{1}{2} \cdot \mUlp\left( x_\hi \right) + x_\mi \\ & = & \frac{1}{2} \cdot \mUlp\left( x_\hi \right) - \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \\ & = & 0 \end{eqnarray*} So in consequence we have \begin{eqnarray*} t_3 & = & t_2 \oplus x_\lo \\ & = & 0 \oplus x_\lo \\ & = & x_\lo \end{eqnarray*} And we thus obtain finally \begin{eqnarray*} \diamond \left( x_\hi + x_\mi + x_\lo \right) & = & \diamond \left( t_1 + t_2 + x_\lo \right) \\ & = & \diamond \left( t_1 + 0 + x_\lo \right) \\ & = & \diamond \left( t_1 + t_3 \right) \end{eqnarray*} Let us now analyse the other principal cases, starting with the case where $$-\frac{1}{2} \cdot \mUlp\left( x_\hi \right) < x_\mi < -\frac{1}{4} \cdot \mUlp\left( x_\hi \right)$$ This inequality bounding $x_\mi$ is in fact equivalent to the following one because $x_\mi$ is a floating point number: $$-\frac{1}{2} \cdot \mUlp\left( x_\hi \right)^- \leq x_\mi \leq -\frac{1}{4} \cdot \mUlp\left( x_\hi \right)^+$$ So we can check \begin{eqnarray*} t_2 & = & x_\hi + x_\mi - t_1 \\ & = & x_\hi + x_\mi - x_\hi^- \\ & = & \frac{1}{2} \cdot \mUlp\left( x_\hi \right) + x_\mi \\ & \geq & \frac{1}{2} \cdot \mUlp\left( x_\hi \right) - \frac{1}{2} \cdot \mUlp\left( x_\hi \right)^- \\ & = & \frac{1}{2} \cdot \left( \mUlp\left( x_\hi \right) - \mUlp\left( x_\hi \right)^- \right) \\ & = & \frac{1}{4} \mUlp\left( \mUlp\left( x_\hi \right) \right) \end{eqnarray*} In contrast we know that $$\left \vert x_\lo \right \vert \leq \frac{1}{2} \cdot \mUlp \left( x_\mi \right)$$ Since in the currently treated case the following holds $$\left \vert x_\mi \right \vert \leq \frac{1}{2} \cdot \mUlp\left( x_\hi \right)$$ we get as per lemma \ref{multhalf} $$\left \vert x_\lo \right \vert \leq \frac{1}{4} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right)$$ which yields to $$\left \vert t_2 \right \vert \geq \left \vert x_\lo \right \vert$$ Let us now consider the second and one but not least case. We suppose here that $$-\frac{3}{4} \cdot \mUlp\left( x_\hi \right) < x_\mi < -\frac{1}{2} \cdot \mUlp\left( x_\hi \right)$$ which is equivalent to $$-\left(\frac{3}{4} \cdot \mUlp\left( x_\hi \right)\right)^- \leq x_\mi < -\frac{1}{2} \cdot \mUlp\left( x_\hi \right)^+$$ We therefore get \begin{eqnarray*} t_2 &= & x_\hi + x_\mi - t_1 \\ & = & x_\hi + x_\mi - x_\hi^- \\ & = & \frac{1}{2} \cdot \mUlp\left( x_\hi \right) + x_\mi \\ & \leq & \frac{1}{2} \cdot \mUlp\left( x_\hi \right) - \frac{1}{2} \cdot \mUlp\left( x_\hi \right)^+ \\ & = & -\frac{1}{2} \cdot \left( \mUlp\left( x_\hi \right)^+ - \mUlp\left( x_\hi \right) \right) \\ & = & -\frac{1}{2} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right) \end{eqnarray*} which gives us $$\left \vert t_2 \right \vert \geq \frac{1}{2} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right)$$ We can deduce from that, still using the argument that $\left \vert x_\lo \right \vert \leq \frac{1}{2} \cdot \mUlp\left( \mUlp \left( x_\hi \right) \right)$, that $$\left \vert t_2 \right \vert \geq \left \vert x_\lo \right \vert $$ Let us finally handle the last case where $-\mUlp\left( x_\hi \right)^- \leq x_\mi \leq - \frac{3}{4} \cdot \mUlp\left( x_\hi \right)$: \\ Using the property that $x_\hi^-$ is an exact integer power of $2$ and using further lemma \ref{notpoweroftwo}, we can check now that \begin{eqnarray*} t_2 & = & x_\hi + x_\mi - t_1 \\ & = & x_\hi + x_\mi - x_\hi^{--} \\ & = & x_\hi + x_\mi - x_\hi^{--} + x_\hi^- - x_\hi^- \\ & = & x_\hi - x_\hi^- + x_\mi + x_\hi^- - x_\hi^{--} \\ & = & \frac{1}{2} \cdot \mUlp\left( x_\hi \right) + x_\mi + \left( x_\hi^- \right)^+ - x_\hi^- \\ & = & \frac{1}{2} \cdot \mUlp\left( x_\hi \right) + x_\mi + x_\hi - x_\hi^- \\ & = & \frac{1}{2} \cdot \mUlp\left( x_\hi \right) + x_\mi + \frac{1}{2} \cdot \mUlp\left( x_\hi \right) \\ & = & \mUlp\left( x_\hi \right) + x_\mi \\ & \geq & \mUlp\left( x_\hi \right) + \mUlp\left( x_\hi \right)^- \\ & = & \frac{1}{2} \cdot \mUlp\left( \mUlp\left( x_\hi \right) \right) \end{eqnarray*} In consequence we still get the same upper bound for $\left \vert x_\lo \right \vert$, i.e. $$\left \vert t_2 \right \vert \geq \left \vert x_\lo \right \vert$$ Since we have now treated all the cases that have been showing up, it suffices now to show that the upper bound already mentioned yields to the property to be proven. Once again, we decompose the problem in cases and subcases.\\ Let us start by showing the property for the equation $\left \vert t_2 \right \vert = \left \vert x_\lo \right \vert$: \\ If $\sgn\left( t_2 \right) = \sgn\left( x_\lo \right)$ we get \begin{eqnarray*} t_3 & = & t_2 \oplus x_\lo \\ & = & x_\lo \oplus x_\lo \\ & = & \circ \left( 2 \cdot x_\lo \right) \\ & = & 2 \cdot x_\lo \end{eqnarray*} So we have exactly $$t_1 + t_3 = x_\hi + x_\mi + x_\lo$$ and thus $$\diamond \left( t_1 + t_3 \right) = \diamond \left( x_\hi + x_\mi + x\lo \right)$$ Otherwise, we have $\sgn\left( t_2 \right) = -\sgn\left( x_\lo \right)$ and get \begin{eqnarray*} t_3 & = & t_2 \oplus x_\lo \\ & = & - x_\lo \oplus x_\lo \\ & = & 0 \end{eqnarray*} exactly. This means finally that \begin{eqnarray*} \diamond \left( t_1 + t_3 \right) & = & \diamond \left( t_1 \right) \\ & = & \diamond \left( t_1 + t_2 - t_2 \right) \\ & = & \diamond \left( x_\hi + x_\mi + x_\lo \right) \end{eqnarray*} In the end let us consider the case where one can suppose that $\left \vert t_2 \right \vert > \left \vert x_\lo \right \vert$: \\ We can suppose here \begin{eqnarray*} t_3 & = & t_2 \oplus x_\lo \\ & = & t_2 + x_\lo + \delta \end{eqnarray*} with $$\left \vert \delta \right \vert \leq 2^{-53} \cdot \left \vert t_2 + x_\lo \right \vert$$ Let us show now that $t_2$ and $t_3$ have the same sign. For doing so let us suppose that this would not be true.\\ Clearly, $t_2$ and $t_2 + x_\lo$ have the same sign because we know that $\left \vert t_2 \right \vert > \left \vert x_\lo \right \vert$. \\ So in order to have $\sgn\left( t_2 \right) = -1 \cdot \sgn\left( t_3 \right)$ to hold, we must have $$\left \vert \delta \right \vert > \left \vert t_2 + x_\lo \right \vert$$ Thus we would obtain $$2^{-53} \cdot \left \vert t_2 + x_\lo \right \vert > \left \vert t_2 + x_\lo \right \vert$$ which is not true because $$t_2 + x_\lo = 0$$ This would yield to $\left \vert t_2 \right \vert = \left \vert x_\lo \right \vert$ which is excluded by hypotheses. Thus, contradiction. \\ The values $t_2$ and $t_3$ have therefore the same sign. By applying lemma \ref{decarrdir}, we get: $$\diamond \left( t_1 + t_2 \right) = \diamond \left( t_1 + t_3 \right)$$ Let us show now that $$\diamond \left( t_1 + t_2 \right) = \diamond \left( x_\hi + x_\mi + x_\lo \right)$$ in order to be able to conclude. \\ For doing so, let us put \begin{eqnarray*} \hat{x} & = & t_1 + t_2 \\ \delta^\prime & = & x_\lo \\ \xi\left( \hat{x} \right) & = & t_2 \end{eqnarray*} and let us check that \begin{eqnarray*} \left \vert \delta^\prime \right \vert & = & \left \vert x_\lo \right \vert \\ & < & \left \vert t_2 \right \vert \\ & = & \left \vert \xi\left(\hat{x}\right) \right \vert \end{eqnarray*} We can now apply lemma \ref{arrdirper} and obtain: $$\diamond \left( t_1 + t_3 \right) = \diamond \left( x_\hi + x_\mi + x_\lo \right)$$ This is the equation to be shown.\qed \end{proof} \begin{theorem}[Directed final rounding of a triple-double number] \label{arrdir} ~ \\ Let be $x_\hi + x_\mi + x_\lo \in \F + \F + \F$ a non-overlapping triple-double number. \\ Let be $\diamond$ a directed rounding mode.\\ Let be {\bf A} the following instruction sequence: \begin{center} \begin{minipage}[b]{50mm} $\left( t_1, t_2 \right) \gets \mAdd\left( x_\hi, x_\mi \right)$ \\ $t_3 \gets t_2 \oplus x_\lo$ \\ {\bf return } $\diamond\left( t_1 + t_3 \right)$ \end{minipage} \end{center} So {\bf A} is a correct rounding procedure for the rounding mode $\diamond$. \end{theorem} \begin{proof} ~\\ Trivial as per lemmas \ref{moinsquunmiulp} and \ref{plusdunmiulp}.\qed \end{proof} \bibliographystyle{plain} \bibliography{elem-fun.bib} \end{document} interval-2.1.0/src/crlibm/double-extended.h0000644000000000000000000005325613031036767016765 0ustar 00000000000000#ifndef __DOUBLE_EXTENDED_H #define __DOUBLE_EXTENDED_H #if (defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)) #include typedef long double double_ext; #endif #if defined(CRLIBM_TYPECPU_ITANIUM) && defined(__INTEL_COMPILER) typedef __fpreg double_ext; #endif /* For debugging */ typedef union { int i[3]; long double d; } db_ext_number; #define DE_EXP 2 #define DE_MANTISSA_HI 1 #define DE_MANTISSA_LO 0 #define print_ext(_s, _y) {\ db_ext_number _yy; _yy.d=_y; \ printf("%s %04x %08x %08x \n",_s, 0xffff&_yy.i[DE_EXP], _yy.i[DE_MANTISSA_HI], _yy.i[DE_MANTISSA_LO]); \ } /**************************************************************************************/ /*********************************Rounding tests***************************************/ /**************************************************************************************/ /* These test work by observing the bits of your double-extended after the 53rd. mask should be 7ff if you trust your 64 bits (hum) 7fe if you trust 63 (if you have proven that maxepsilon<2^(-63) ) 7fc 62 7f8 61 7f0 60 etc */ /* Mask constants for rounding test */ #define ACCURATE_TO_64_BITS 0x7ff #define ACCURATE_TO_63_BITS 0x7fe #define ACCURATE_TO_62_BITS 0x7fc #define ACCURATE_TO_61_BITS 0x7f8 #define ACCURATE_TO_60_BITS 0x7f0 #define ACCURATE_TO_59_BITS 0x7e0 #if (defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)) static const unsigned short RN_Double = (_FPU_DEFAULT & ~_FPU_EXTENDED)|_FPU_DOUBLE; static const unsigned short RN_DoubleDown = (_FPU_DEFAULT & ~_FPU_EXTENDED & ~_FPU_RC_NEAREST)|_FPU_DOUBLE | _FPU_RC_DOWN; static const unsigned short RN_DoubleUp = (_FPU_DEFAULT & ~_FPU_EXTENDED & ~_FPU_RC_NEAREST)|_FPU_DOUBLE | _FPU_RC_UP; static const unsigned short RN_DoubleExt = _FPU_DEFAULT; #define DOUBLE_EXTENDED_MODE _FPU_SETCW(RN_DoubleExt) #define DOUBLE_UP_MODE _FPU_SETCW(RN_DoubleUp) #define DOUBLE_DOWN_MODE _FPU_SETCW(RN_DoubleDown) #define BACK_TO_DOUBLE_MODE _FPU_SETCW(RN_Double) /* Two rounding tests to the nearest. On Pentium 3, gcc3.3, the second is faster by 12 cycles (and also improves the worst-case time by 60 cycles since it doesn't switch processor rounding mode in this case). However it uses a coarser error estimation. */ #define DE_TEST_AND_RETURN_RN_ZIV(y,rncst) \ { double yh, yl; \ yh = (double) y; \ yl = y-yh; \ BACK_TO_DOUBLE_MODE; \ if(yh==yh + yl*rncst) return yh; \ DOUBLE_EXTENDED_MODE; \ } #define DE_TEST_AND_RETURN_RN(_y, _mask) \ { \ db_ext_number _z; double _yd; \ int _lo; \ _z.d = _y; \ _yd = (double) _y; \ _lo = _z.i[DE_MANTISSA_LO] &(_mask); \ if((_lo!=(0x3ff&(_mask))) && (_lo!= (0x400&(_mask)))) { \ BACK_TO_DOUBLE_MODE; \ return _yd; \ } \ } #define DE_TEST_AND_RETURN_RD(_y, _mask) \ { \ double _result; int _bits; \ db_ext_number _z; \ _z.d = _y; \ DOUBLE_DOWN_MODE; \ _bits = _z.i[DE_MANTISSA_LO] &(_mask); \ _result = (double)(_y); \ if( (_bits != (0xfff&(_mask))) && (_bits != (0x000&(_mask))) ) { \ BACK_TO_DOUBLE_MODE; \ return _result; \ } \ DOUBLE_EXTENDED_MODE; \ } #define DE_TEST_AND_RETURN_RU(_y, _mask) \ { \ double _result; int _bits; \ db_ext_number _z; \ _z.d = _y; \ DOUBLE_UP_MODE; \ _bits = _z.i[DE_MANTISSA_LO] &(_mask); \ _result = (double)(_y); \ if( (_bits != (0xfff&(_mask))) && (_bits != (0x000&(_mask))) ) { \ BACK_TO_DOUBLE_MODE; \ return _result; \ } \ DOUBLE_EXTENDED_MODE; \ } /* Use this one if you want a final computation step to overlap with the rounding test. Examples: multiplication by a sign or by a power of 2 */ #define DE_TEST_AND_RETURN_RN2(_ytest, _yreturn, _mask) \ { \ db_ext_number _z; double _y_return_d; \ int _bits; \ _z.d = _ytest; \ _y_return_d = (double) (_yreturn); \ _bits = _z.i[DE_MANTISSA_LO] &(_mask); \ if((_bits!=(0x3ff&(_mask))) && (_bits!= (0x400&(_mask)))) {\ BACK_TO_DOUBLE_MODE; \ return _y_return_d; \ } \ } /* Slow macros with two changes of precision, but who cares, they are used at the end of the second step */ #define RETURN_SUM_ROUNDED_DOWN(_rh, _rl) {\ double _result; \ DOUBLE_DOWN_MODE; \ _result = (_rh+_rl); \ BACK_TO_DOUBLE_MODE; \ return _result; \ } #define RETURN_SUM_ROUNDED_UP(_rh, _rl) {\ double _result; \ DOUBLE_UP_MODE; \ _result = (_rh+_rl); \ BACK_TO_DOUBLE_MODE; \ return _result; \ } #else /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ #if !defined(CRLIBM_TYPECPU_ITANIUM) #error "This file should be compiled only for IA32 or IA64 architecture " #endif /* TODO Add what it takes to compile under HP-UX */ #if !defined(__INTEL_COMPILER) #error "Use icc, version 8.1 or higher to compile for IA64 architecture" #endif #define DOUBLE_EXTENDED_MODE {} #define BACK_TO_DOUBLE_MODE {} #define DE_TEST_AND_RETURN_RN(_y, _mask) \ { uint64_t _mantissa, _bits; double _yd; \ _yd = _Asm_fma(2/*_FR_D*/, 1.0, _y, 0.0, 0/*SF0*/); \ _mantissa = _Asm_getf(4/*_FR_SIG*/, _y); \ _bits = _mantissa & (0x7ff&(_mask)); \ if(__builtin_expect( \ (_bits!=(0x3ff&(_mask))) && (_bits != (0x400&(_mask))), \ 1+1==2)) \ return _yd; \ } /* Slower by 5 cycles as of 2005... Let us keep it, you never know */ #define DE_TEST_AND_RETURN_RN_ZIV(y,rncst) \ { double yh, yl; \ yh = (double) y; \ yl = y-yh; \ if(__builtin_expect(yh == yh + yl*rncst, 1+1==2)) return yh; \ } /* Use this one if you want a final computation step to overlap with the rounding test. Examples: multiplication by a sign or by a power of 2 */ #define DE_TEST_AND_RETURN_RN2(_ytest, _yreturn, _mask) \ { uint64_t _mantissa, _bits; \ _mantissa = _Asm_getf(4/*_FR_SIG*/, _ytest); \ _bits = _mantissa & (0x7ff&(_mask)); \ if(__builtin_expect( \ (_bits!=(0x3ff&(_mask))) && (_bits != (0x400&(_mask))), \ 1+1==2)) \ return _yreturn; \ } #define DE_TEST_AND_RETURN_RD(_y, _mask) \ { uint64_t _mantissa, _bits; double _yd; \ _yd = _Asm_fma(2/*_FR_D*/, -1.0, _y, 0.0, 3/*SF3*/); \ _mantissa = _Asm_getf(4/*_FR_SIG*/, _y); \ _bits = _mantissa & (0x7ff&(_mask)); \ if(__builtin_expect( \ (_bits!=(0x000&(_mask))) && (_bits != (0x7ff&(_mask))), \ 1+1==2)) \ return -_yd; \ } #define DE_TEST_AND_RETURN_RU(_y, _mask) \ { uint64_t _mantissa, _bits; double _yd; \ _yd = _Asm_fma(2/*_FR_D*/, 1.0, _y, 0.0, 3/*SF3*/); \ _mantissa = _Asm_getf(4/*_FR_SIG*/, _y); \ _bits = _mantissa & (0x7ff&(_mask)); \ if(__builtin_expect( \ (_bits!=(0x000&(_mask))) && (_bits != (0x7ff&(_mask))), \ 1+1==2)) \ return _yd; \ } #define RETURN_SUM_ROUNDED_DOWN(_rh, _rl) \ return -_Asm_fma(2/*_FR_D*/, -1.0, _rh, -_rl, 3/*SF3*/); #define RETURN_SUM_ROUNDED_UP(_rh, _rl) \ return _Asm_fma(2/*_FR_D*/, 1.0, _rh, _rl, 3/*SF3*/); #if 0 /* This test doesn'use SF2 and SF3 Kept as a model for Pentium implementation, to erase afterwards */ #define DE_TEST_AND_RETURN_RU(_y, _mask) \ { \ db_ext_number _z; double _yd; \ unsigned long int _mantissa, _y_double, _isNegative ,_wasRoundedUp, _bits; \ _yd=(double) _y; \ _mantissa = _Asm_getf(4/*_FR_SIG*/, _y); \ _y_double = _Asm_getf(2/*_FR_D*/, _yd); \ _bits = _mantissa & (0x7ff&(_mask)); \ _wasRoundedUp = ((_mantissa >>11) & 1) != (_y_double & 1); \ _bits = _mantissa & (0x7ff&(_mask)); \ _isNegative = _y_double >> 63; \ if(_isNegative) { \ if(_wasRoundedUp) { /* RN was RD */ \ if( _bits != (0x7ff&(_mask)) ) { \ _y_double--; \ return (double) _Asm_setf(2/*_FR_D*/, _y_double); \ } /* else launch accurate phase */ \ } \ else{ /* RN was RU, so need to check */ \ if( _bits != (0x000&(_mask)) ) { \ return _yd; \ } /* else launch accurate phase */ \ } \ } \ else{ /* Positive number */ \ if(_wasRoundedUp) { /* RN was RU */ \ if( _bits != (0x7ff&(_mask)) ) { \ return _yd; \ } /* else launch accurate phase */ \ } \ else{ /* RN was RD, */ \ if( _bits != (0x000&(_mask)) ) { \ _y_double++; /* beware, does not work for -0 */ \ return (double) _Asm_setf(2/*_FR_D*/, _y_double); \ } /* else launch accurate phase */ \ } \ } \ } #define DE_TEST_AND_RETURN_RD(_y, _mask) \ { \ db_ext_number _z; double _yd; \ unsigned long int _mantissa, _y_double, _isNegative ,_wasRoundedUp, _bits; \ _yd=(double) _y; \ _mantissa = _Asm_getf(4/*_FR_SIG*/, _y); \ _y_double = _Asm_getf(2/*_FR_D*/, _yd); \ _bits = _mantissa & (0x7ff&(_mask)); \ _wasRoundedUp = ((_mantissa >>11) & 1) != (_y_double & 1); \ _bits = _mantissa & (0x7ff&(_mask)); \ _isNegative = _y_double >> 63; \ if(_isNegative) { \ if(_wasRoundedUp) { /* RN was RD */ \ if( _bits != (0x7ff&(_mask)) ) { \ return (double) _y; \ } /* else launch accurate phase */ \ } \ else{ /* RN was RU */ \ if( _bits != (0x000&(_mask)) ) { \ _y_double++; \ return (double) _Asm_setf(2/*_FR_D*/, _y_double); \ } /* else launch accurate phase */ \ } \ } \ else{ /* Positive number */ \ if(_wasRoundedUp) { /* RN was RU */ \ if( _bits != (0x7ff&(_mask)) ) { \ _y_double--; \ return (double) _Asm_setf(2/*_FR_D*/, _y_double); \ } /* else launch accurate phase */ \ } \ else{ /* RN was RD, */ \ if( _bits != (0x000&(_mask)) ) { \ return (double) _y; \ } /* else launch accurate phase */ \ } \ } \ } #endif /* 0 */ #endif /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ /**************************************************************************************/ /************************Double double-extended arithmetic*****************************/ /**************************************************************************************/ #define Add12_ext(prh, prl, a, b) \ { \ double_ext _z, _a, _b; \ _a = a; _b = b; \ *prh = _a + _b; \ _z = *prh - _a; \ *prl = _b - _z; \ } #if (defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)) #define Mul12_ext(prh,prl,u,v) \ { \ const double_ext _c = 4294967297.L; /* 2^32 +1 */ \ double_ext _up, _u1, _u2, _vp, _v1, _v2; \ double_ext _u =u, _v=v; \ \ _up = _u*_c; _vp = _v*_c; \ _u1 = (_u-_up)+_up; _v1 = (_v-_vp)+_vp; \ _u2 = _u-_u1; _v2 = _v-_v1; \ \ *prh = _u*_v; \ *prl = _u1*_v1 - *prh; \ *prl = *prl + _u1*_v2; \ *prl = *prl + _u2*_v1; \ *prl = *prl + _u2*_v2; \ } #define Mul22_ext(prh,prl, ah,al, bh,bl) \ { \ double_ext mh, ml; \ Mul12_ext(&mh,&ml,(ah),(bh)); \ ml += (ah)*(bl) + (al)*(bh); \ Add12_ext(prh,prl, mh,ml); \ } #define FMA22_ext(prh,prl, ah,al, bh,bl, ch,cl) \ { \ Mul22_ext(prh,prl, (ah),(al), (bh),(bl)); \ Add22_ext(prh,prl, ch,cl, *prh, *prl); \ } #else /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ #define Mul12_ext( prh,prl, a, b ) \ { \ *prh = (a) * (b); \ *prl = _Asm_fms( 3/*_PC_NONE*/, (a), (b), *prh, 1 ); \ } #if 0 /* transcription of Alexey's */ #define Mul22_ext( prh,prl, ah,al, bh,bl ) \ { \ double_ext _t1,_t2,_t3; \ *prh = (ah) * (bh); \ _t1 = (ah)*(bl); \ _t2 = _Asm_fms( 3/*_PC_NONE*/, (ah), (bh), *prh, 1 ); \ _t3 = (al) * (bh) + _t1; \ *prl = (_t2 + _t3); \ } #else #define Mul22_ext( prh,prl, ah,al, bh,bl ) \ { \ double_ext ph, pl; \ ph = (ah)*(bh); \ pl = _Asm_fms( 3/*_PC_NONE*/, ah, bh, ph, 1/*_SF1*/ ); \ pl = (ah)*(bl) + pl; \ pl = (al)*(bh) + pl; \ Add12_ext(prh,prl, ph,pl); \ } #endif /* res = a*b + c, assume |a*b| <= |c| * res, a and b in X format * c in L format */ #if 0 #define FMA22_ext(prh,prl, ah,al, bh,bl, ch,cl) \ { \ Mul22_ext(prh,prl, (ah),(al), (bh),(bl)); \ Add22_ext(prh,prl, ch,cl, *prh, *prl); \ } #else #define FMA22_ext( prh,prl, ah,al, bh,bl, ch,cl) \ { \ double_ext __xfmagxxx_r_hi__,__xfmagxxx_r_lo__, \ __xfmagxxx_t1__,__xfmagxxx_t2__, \ __xfmagxxx_t3__,__xfmagxxx_t4__; \ __xfmagxxx_r_hi__ = ah * bh + ch; \ __xfmagxxx_t1__ = al * bh + cl; \ __xfmagxxx_t2__ = __xfmagxxx_r_hi__ - ch; \ __xfmagxxx_t3__ = ah * bl + __xfmagxxx_t1__; \ __xfmagxxx_t4__ = _Asm_fms( 3/*_PC_NONE*/, ah, bh, __xfmagxxx_t2__, 1/*_SF1*/ ); \ __xfmagxxx_r_lo__ = (__xfmagxxx_t3__ + __xfmagxxx_t4__); \ *prh = __xfmagxxx_r_hi__; *prl = __xfmagxxx_r_lo__; \ } #endif #endif /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ #define Div22_ext(prh,prl,xh,xl,yh,yl) \ { \ double_ext ch,cl,uh,ul; \ ch = (xh)/(yh); \ Mul12_ext(&uh,&ul,ch,(yh)); \ cl = (xh)-uh; \ cl = cl - ul; \ cl = cl + (xl); \ cl = cl - ch*(yl); \ cl = cl / (yh); \ Add12(prh,prl, ch, cl) ; \ } #define Add22_ext(prh,prl,xh,xl,yh,yl) \ do { \ double_ext _r,_s; \ _r = (xh)+(yh); \ _s = (xh)-_r; \ _s = _s + (yh); \ _s = _s + (yl); \ _s = _s + (xl); \ Add12_ext(prh,prl,_r,_s); \ } while(0) #endif /* ifndef __DOUBLE_EXTENDED_H*/ interval-2.1.0/src/crlibm/exp-itanium.c0000644000000000000000000016714013031036767016146 0ustar 00000000000000/* file: exp_itanium.c Author Florent de Dinechin, ENS-Lyon Heavily inspired by code from Alexey V.Ershov, intel and Christoph Lauter, Technische Universitaet Muenchen WARNING : This code is dirty and experimental, and remains here for history. A cleaner, portable version of an exponential using double-extended arithmetic will be available as exp-de.c To test within crlibm: (tested with Intel icc compiler version 8.1) icc -mcpu=itanium -Qoption,cpp,--extended_float_types \ -IPF_fp_speculationsafe -c exp-itanium.c;\ mv exp-itanium.o exp_fast.o; make icc -mcpu=itanium2 -Qoption,cpp,--extended_float_types \ -IPF_fp_speculationsafe -c exp-itanium.c; mv exp-itanium.o exp_fast.o; make This file is completely self-contained so that we can change the crlibm infrastructure without bothering maintaining it. */ typedef __int64 INT64; typedef signed __int64 SINT64; typedef unsigned __int64 UINT64; /* FP register type */ typedef __fpreg L_FLOAT_TYPE; /* Almost the same as the previous, except exponent field smaller, and morally in memory */ typedef long double LC_FLOAT_TYPE; /* The double-double-ext type, using registers */ typedef struct __X_FLOAT_TYPE_TAG { L_FLOAT_TYPE hi,lo; /* order is critical! */ } X_FLOAT_TYPE; /* The double-double-ext type, in memory */ typedef struct __XC_FLOAT_TYPE_TAG { LC_FLOAT_TYPE hi,lo; /* order is critical! */ } XC_FLOAT_TYPE; /* Table 1-17: legal floating-point precision completers (.pc) */ typedef enum { _PC_S = 1 /* single .s */ ,_PC_D = 2 /* double .d */ ,_PC_NONE = 3 /* dynamic */ } _Asm_pc; /* Table 1-22: legal getf/setf floating-point register access completers */ typedef enum { _FR_S = 1 /* single form .s */ ,_FR_D = 2 /* double form .d */ ,_FR_EXP = 3 /* exponent form .exp */ ,_FR_SIG = 4 /* significand form .sig */ } _Asm_fr_access; /* Table 1-24: legal floating-point FPSR status field completers (.sf) */ typedef enum { _SF0 = 0 /* FPSR status field 0 .s0 */ ,_SF1 = 1 /* FPSR status field 1 .s1 */ ,_SF2 = 2 /* FPSR status field 2 .s2 */ ,_SF3 = 3 /* FPSR status field 3 .s3 */ } _Asm_sf; #define ULL(bits) 0x##bits##uLL #if (!defined(EM64T) && defined(__linux__) && defined(IA32)) # define LDOUBLE_ALIGN 12 /* IA32 Linux: 12-byte alignment */ #else # define LDOUBLE_ALIGN 16 /* EM64T, IA32 Win or IPF Win/Linux: 16-byte alignm\ ent */ #endif #if (LDOUBLE_ALIGN == 16) #define _XPD_ ,0x0000,0x0000,0x0000 #else /*12*/ #define _XPD_ ,0x0000 #endif #define LDOUBLE_HEX(w4,w3,w2,w1,w0) 0x##w0,0x##w1,0x##w2,0x##w3,0x##w4 _XPD_ /*LITTLE_ENDIAN*/ /* Load XC constant data and convert to X format */ #define __X_CONVERT_XC2X( __x__, __xc__ ) \ (((__x__).hi = (__xc__).hi), ((__x__).lo = (__xc__).lo)) /* res = a*a * res and a in X format */ #define __X_SQR_X( __resx__, __x_a__ ) \ { \ L_FLOAT_TYPE __xsqrx_r_hi__,__xsqrx_r_lo__,__xsqrx_t__,__xsqrx_two__; \ __xsqrx_r_hi__ = (__x_a__).hi * (__x_a__).hi; \ __xsqrx_t__ = (__x_a__).hi * (__x_a__).lo; \ __xsqrx_r_lo__ = _Asm_fms( _PC_NONE, (__x_a__).hi, (__x_a__).hi, __xsqrx_r_hi__, _SF1 ); \ __xsqrx_two__ = _Asm_setf( _FR_EXP, 0xffff + 1 ); \ __xsqrx_r_lo__ = __xsqrx_two__ * __xsqrx_t__ + __xsqrx_r_lo__; \ (__resx__).hi = __xsqrx_r_hi__; (__resx__).lo = __xsqrx_r_lo__; \ } /* res = a*a * res in X format * a in L format */ #define __X_SQR_L( __resx__, __l_a__ ) \ { \ L_FLOAT_TYPE __xsqrl_r_hi__,__xsqrl_r_lo__; \ __xsqrl_r_hi__ = (__l_a__) * (__l_a__); \ __xsqrl_r_lo__ = _Asm_fms( _PC_NONE, (__l_a__), (__l_a__), __xsqrl_r_hi__, _SF1 ); \ (__resx__).hi = __xsqrl_r_hi__; (__resx__).lo = __xsqrl_r_lo__; \ } /* res = a*b * res, a and b in X format */ #define __X_MUL_XX( __resx__, __x_a__, __x_b__ ) \ { \ L_FLOAT_TYPE __xmulxx_r_hi__,__xmulxx_r_lo__; \ L_FLOAT_TYPE __xmulxx_t1__,__xmulxx_t2__,__xmulxx_t3__; \ __xmulxx_r_hi__ = (__x_a__).hi * (__x_b__).hi; \ __xmulxx_t1__ = (__x_a__).hi * (__x_b__).lo; \ __xmulxx_t2__ = _Asm_fms( _PC_NONE, (__x_a__).hi, (__x_b__).hi, __xmulxx_r_hi__, _SF1 ); \ __xmulxx_t3__ = (__x_a__).lo * (__x_b__).hi + __xmulxx_t1__; \ __xmulxx_r_lo__ = (__xmulxx_t2__ + __xmulxx_t3__); \ (__resx__).hi = __xmulxx_r_hi__; (__resx__).lo = __xmulxx_r_lo__; \ } /* res = a*b + c, assume |a*b| <= |c| * res, a, b and c in X format */ #define __X_FMA_GREATER_XXX( __resx__, __x_a__, __x_b__, __x_c__ ) \ { \ L_FLOAT_TYPE __xfmagxxx_r_hi__,__xfmagxxx_r_lo__; \ L_FLOAT_TYPE __xfmagxxx_t1__,__xfmagxxx_t2__; \ L_FLOAT_TYPE __xfmagxxx_t3__,__xfmagxxx_t4__; \ __xfmagxxx_r_hi__ = (__x_a__).hi * (__x_b__).hi + (__x_c__).hi; \ __xfmagxxx_t1__ = (__x_a__).lo * (__x_b__).hi + (__x_c__).lo; \ __xfmagxxx_t2__ = (__xfmagxxx_r_hi__ - (__x_c__).hi); \ __xfmagxxx_t3__ = (__x_a__).hi * (__x_b__).lo + __xfmagxxx_t1__; \ __xfmagxxx_t4__ = _Asm_fms( _PC_NONE, (__x_a__).hi, (__x_b__).hi, __xfmagxxx_t2__, _SF1 ); \ __xfmagxxx_r_lo__ = (__xfmagxxx_t3__ + __xfmagxxx_t4__); \ (__resx__).hi = __xfmagxxx_r_hi__; (__resx__).lo = __xfmagxxx_r_lo__; \ } /* res = a*b + c, assume |a*b| <= |c| * res, b and c in X format * a in L format */ #define __X_FMA_GREATER_LXX( __resx__, __l_a__, __x_b__, __x_c__ ) \ { \ L_FLOAT_TYPE __xfmaglxx_r_hi__,__xfmaglxx_r_lo__; \ L_FLOAT_TYPE __xfmaglxx_t2__; \ L_FLOAT_TYPE __xfmaglxx_t3__,__xfmaglxx_t4__; \ __xfmaglxx_r_hi__ = (__l_a__) * (__x_b__).hi + (__x_c__).hi; \ __xfmaglxx_t2__ = (__xfmaglxx_r_hi__ - (__x_c__).hi); \ __xfmaglxx_t3__ = (__l_a__) * (__x_b__).lo + (__x_c__).lo; \ __xfmaglxx_t4__ = _Asm_fms( _PC_NONE, (__l_a__), (__x_b__).hi, __xfmaglxx_t2__, _SF1 ); \ __xfmaglxx_r_lo__ = (__xfmaglxx_t3__ + __xfmaglxx_t4__); \ (__resx__).hi = __xfmaglxx_r_hi__; (__resx__).lo = __xfmaglxx_r_lo__; \ } /* res = a*b + c, assume |a*b| <= |c| * res, a and b in X format * c in L format */ #define __X_FMA_GREATER_XXL( __resx__, __x_a__, __x_b__, __l_c__ ) \ { \ L_FLOAT_TYPE __xfmagxxl_r_hi__,__xfmagxxl_r_lo__; \ L_FLOAT_TYPE __xfmagxxl_t1__,__xfmagxxl_t2__; \ L_FLOAT_TYPE __xfmagxxl_t3__,__xfmagxxl_t4__; \ __xfmagxxl_r_hi__ = (__x_a__).hi * (__x_b__).hi + (__l_c__); \ __xfmagxxl_t1__ = (__x_a__).lo * (__x_b__).hi; \ __xfmagxxl_t2__ = (__xfmagxxl_r_hi__ - (__l_c__)); \ __xfmagxxl_t3__ = (__x_a__).hi * (__x_b__).lo + __xfmagxxl_t1__; \ __xfmagxxl_t4__ = _Asm_fms( _PC_NONE, (__x_a__).hi, (__x_b__).hi, __xfmagxxl_t2__, _SF1 ); \ __xfmagxxl_r_lo__ = (__xfmagxxl_t3__ + __xfmagxxl_t4__); \ (__resx__).hi = __xfmagxxl_r_hi__; (__resx__).lo = __xfmagxxl_r_lo__; \ } /* T1[i1] = 2^(i1/(K^1)) i1 = [-L/2..L/2] * T2[i2] = 2^(i2/(K^2)) i2 = [-L/2..L/2] */ #define TX ((const XC_FLOAT_TYPE *)_TXL) __declspec(align(16)) static const unsigned short _TXL[] = { /* -64*/ LDOUBLE_HEX(3ffe,b504,f333,f9de,6484),LDOUBLE_HEX(3fbd,b2fb,1366,ea95,7d3e) /* ~0.70710678118654752438189403651591646848828531801700 T1[ 0] hi,lo */ /* -64*/ ,LDOUBLE_HEX(3ffe,ff4e,cb59,511e,c8a5),LDOUBLE_HEX(3fbc,c06e,885f,bc63,75f1) /* ~0.99729605608547012624747266085201147234329255297780 T2[ 0] hi,lo */ /* -63*/ ,LDOUBLE_HEX(3ffe,b600,93a8,5ed5,f76c),LDOUBLE_HEX(bfbd,9566,7ff0,b0cc,0214) /* ~0.71094630108458277992049267890450892082299105823040 T1[ 1] hi,lo */ /* -63*/ ,LDOUBLE_HEX(3ffe,ff51,8f3a,34cb,1c70),LDOUBLE_HEX(3fbd,d414,fb77,db11,52bc) /* ~0.99733824893045803280239303134635520109441131353378 T2[ 1] hi,lo */ /* -62*/ ,LDOUBLE_HEX(3ffe,b6fd,91e3,28d1,7791),LDOUBLE_HEX(3fb9,e2cb,e1bb,aa83,4b3f) /* ~0.71480666919598500561603207636984791406575823202729 T1[ 2] hi,lo */ /* -62*/ ,LDOUBLE_HEX(3ffe,ff54,5322,c329,f86f),LDOUBLE_HEX(3fba,e9b1,4513,ba49,7f30) /* ~0.99738044356050881746869260502386111966188764199614 T2[ 2] hi,lo */ /* -61*/ ,LDOUBLE_HEX(3ffe,b7fb,efca,8ca4,1e7c),LDOUBLE_HEX(3fbc,fc36,9e7c,4277,ff37) /* ~0.71868799872449116278826097836684994035749696195125 T1[ 3] hi,lo */ /* -61*/ ,LDOUBLE_HEX(3ffe,ff57,1712,fc50,9e7f),LDOUBLE_HEX(3fbd,8700,fef5,d3b7,14da) /* ~0.99742263997569800127026770630855878607690101489424 T2[ 3] hi,lo */ /* -60*/ ,LDOUBLE_HEX(3ffe,b8fb,af47,62fb,9ee9),LDOUBLE_HEX(3fbb,dc3c,bbc2,b35b,2d0d) /* ~0.72259040348852331001267348953298608194018015637993 T1[ 4] hi,lo */ /* -60*/ ,LDOUBLE_HEX(3ffe,ff59,db0a,e054,50ba),LDOUBLE_HEX(3fbb,f679,bcc2,0658,8201) /* ~0.99746483817610110853783128570526628209336195141077 T2[ 4] hi,lo */ /* -59*/ ,LDOUBLE_HEX(3ffe,b9fc,d245,2c0b,9deb),LDOUBLE_HEX(bfbb,d96c,65d5,3b9f,5478) /* ~0.72651399792452628242879139608412231154943583533167 T1[ 5] hi,lo */ /* -59*/ ,LDOUBLE_HEX(3ffe,ff5c,9f0a,6f4a,5174),LDOUBLE_HEX(bfbd,b0bf,02f2,53a4,00e8) /* ~0.99750703816179366674628259392676454808679409325122 T2[ 5] hi,lo */ /* -58*/ ,LDOUBLE_HEX(3ffe,baff,5ab2,133e,45fb),LDOUBLE_HEX(3fbd,e9aa,33a4,8b27,0718) /* ~0.73045889709032349430091121678110255288629559800028 T1[ 6] hi,lo */ /* -58*/ ,LDOUBLE_HEX(3ffe,ff5f,6311,a947,e33b),LDOUBLE_HEX(bfbc,a528,cf59,14b2,d1a3) /* ~0.99754923993285120651470718189379738305433420464396 T2[ 6] hi,lo */ /* -57*/ ,LDOUBLE_HEX(3ffe,bc03,4a7e,f2e9,fb0d),LDOUBLE_HEX(bfbc,a3fa,fef4,e9a8,9a84) /* ~0.73442521666849096343950356602370277414593147113919 T1[ 7] hi,lo */ /* -57*/ ,LDOUBLE_HEX(3ffe,ff62,2720,8e62,48da),LDOUBLE_HEX(bfbd,d1c7,8694,72f5,3da0) /* ~0.99759144348934926176900722660789710971585009247064 T2[ 7] hi,lo */ /* -56*/ ,LDOUBLE_HEX(3ffe,bd08,a39f,580c,36bf),LDOUBLE_HEX(bfbd,aefd,c093,25e0,a10c) /* ~0.73841307296974965571198165625865783567860489711165 T1[ 8] hi,lo */ /* -56*/ ,LDOUBLE_HEX(3ffe,ff64,eb37,1eae,c555),LDOUBLE_HEX(bfbc,e4bf,fcf3,e4d6,86d6) /* ~0.99763364883136336952506109665428368771245004609227 T2[ 8] hi,lo */ /* -55*/ ,LDOUBLE_HEX(3ffe,be0f,6809,8609,93e2),LDOUBLE_HEX(3fbd,9334,4593,7562,b2dd) /* ~0.74242258293637625025680054635657256767444778233766 T1[ 9] hi,lo */ /* -55*/ ,LDOUBLE_HEX(3ffe,ff67,af55,5a42,9bec),LDOUBLE_HEX(3fbc,dd7f,3c8d,5596,1f78) /* ~0.99767585595896907005135367807469037870760075747966 T2[ 9] hi,lo */ /* -54*/ ,LDOUBLE_HEX(3ffe,bf17,99b6,7a73,1083),LDOUBLE_HEX(bfbb,bf51,7aa1,a07a,3d7b) /* ~0.74645386414563242460538591838137278955400688573718 T1[ 10] hi,lo */ /* -54*/ ,LDOUBLE_HEX(3ffe,ff6a,737b,4133,101b),LDOUBLE_HEX(bfbd,a2df,4f03,c8fb,22c7) /* ~0.99771806487224190686897637436736374638712732121348 T2[ 10] hi,lo */ /* -53*/ ,LDOUBLE_HEX(3ffe,c021,3aa1,f0d0,8db0),LDOUBLE_HEX(3fbd,de67,649a,354e,a707) /* ~0.75050703481321276010901355491000686015468090772628 T1[ 11] hi,lo */ /* -53*/ ,LDOUBLE_HEX(3ffe,ff6d,37a8,d395,6596),LDOUBLE_HEX(bfbb,c802,1a75,cc6d,fa67) /* ~0.99776027557125742653478667198996276965772267431020 T2[ 11] hi,lo */ /* -52*/ ,LDOUBLE_HEX(3ffe,c12c,4cca,6670,9456),LDOUBLE_HEX(3fbd,f88a,fab3,4a01,0f6b) /* ~0.75458221379671136985669427366119066391547676175832 T1[ 12] hi,lo */ /* -52*/ ,LDOUBLE_HEX(3ffe,ff6f,fbde,117e,e04f),LDOUBLE_HEX(bfbd,de6d,fc11,1a38,5732) /* ~0.99780248805609117896666879210521017284918343648314 T2[ 12] hi,lo */ /* -51*/ ,LDOUBLE_HEX(3ffe,c238,d231,1e3d,6673),LDOUBLE_HEX(bfbd,d094,6839,bf6a,c8f1) /* ~0.75867952059910734942697538296663140044984174892306 T1[ 13] hi,lo */ /* -51*/ ,LDOUBLE_HEX(3ffe,ff72,c01a,fb04,c470),LDOUBLE_HEX(3fbd,a44f,1ba6,a6fe,09f6) /* ~0.99784470232681871711827303883524109551217406988143 T2[ 13] hi,lo */ /* -50*/ ,LDOUBLE_HEX(3ffe,c346,ccda,2497,6407),LDOUBLE_HEX(3fbc,83b2,1584,a2e0,e90a) /* ~0.76279907537226915341865493558337618651421507820487 T1[ 14] hi,lo */ /* -50*/ ,LDOUBLE_HEX(3ffe,ff75,845f,903c,5662),LDOUBLE_HEX(bfbc,df95,80fe,a0cf,dc67) /* ~0.99788691838351559735848655963152964432083535939455 T2[ 14] hi,lo */ /* -49*/ ,LDOUBLE_HEX(3ffe,c456,3ecc,5334,cb33),LDOUBLE_HEX(bfbd,cf43,20d2,b162,9ed8) /* ~0.76694099892047800092224549284303236618143273517489 T1[ 15] hi,lo */ /* -49*/ ,LDOUBLE_HEX(3ffe,ff78,48ab,d13a,dac5),LDOUBLE_HEX(bfbd,f1ee,64ae,cf61,1403) /* ~0.99792913622625737903775247628068711946980329230427 T2[ 15] hi,lo */ /* -48*/ ,LDOUBLE_HEX(3ffe,c567,2a11,5506,dadd),LDOUBLE_HEX(3fbc,f8ab,4325,9376,7cde) /* ~0.77110541270397041179298150415100110421917634084820 T1[ 16] hi,lo */ /* -48*/ ,LDOUBLE_HEX(3ffe,ff7b,0cff,be15,9675),LDOUBLE_HEX(3fbb,db1c,1100,661d,aecd) /* ~0.99797135585511962475912042802583812317607225850224 T2[ 16] hi,lo */ /* -47*/ ,LDOUBLE_HEX(3ffe,c679,90b5,aa24,5f79),LDOUBLE_HEX(3fbd,aa1c,d161,c55d,84aa) /* ~0.77529243884249997954350233642095702180085936561226 T1[ 17] hi,lo */ /* -47*/ ,LDOUBLE_HEX(3ffe,ff7d,d15b,56e1,ce8b),LDOUBLE_HEX(3fba,a4a7,c651,158b,a410) /* ~0.99801357727017790043245668019089578137936769053339 T2[ 17] hi,lo */ /* -46*/ ,LDOUBLE_HEX(3ffe,c78d,74c8,abb9,b15d),LDOUBLE_HEX(bfbc,fb17,471a,24ff,6207) /* ~0.77950220011891848353015668782184377505473094061017 T1[ 18] hi,lo */ /* -46*/ ,LDOUBLE_HEX(3ffe,ff80,95be,9bb4,c859),LDOUBLE_HEX(bfbc,b742,b767,0074,c32e) /* ~0.99805580047150777505760368968346085694065550342202 T2[ 18] hi,lo */ /* -45*/ ,LDOUBLE_HEX(3ffe,c8a2,d85c,8ffe,2c45),LDOUBLE_HEX(3fbc,c368,d3ed,6e1c,0385) /* ~0.78373481998277644652211096354399444408045383170247 T1[ 19] hi,lo */ /* -45*/ ,LDOUBLE_HEX(3ffe,ff83,5a29,8ca3,c96c),LDOUBLE_HEX(bfbb,a438,6792,f0f4,537c) /* ~0.99809802545918482083280032224337219304288737475872 T2[ 19] hi,lo */ /* -44*/ ,LDOUBLE_HEX(3ffe,c9b9,bd86,6e2f,27a3),LDOUBLE_HEX(bfbd,fe3c,0dab,f5dd,2d04) /* ~0.78799042255394324325455321367250860475905938073992 T1[ 20] hi,lo */ /* -44*/ ,LDOUBLE_HEX(3ffe,ff86,1e9c,29c4,178d),LDOUBLE_HEX(bfbc,db63,47ba,fee3,03cb) /* ~0.99814025223328461320889196106698193489137338474392 T2[ 20] hi,lo */ /* -43*/ ,LDOUBLE_HEX(3ffe,cad2,265e,4290,774e),LDOUBLE_HEX(bfbd,b7c9,6a5f,0390,8383) /* ~0.79226913262624686507939325563754096037882845848798 T1[ 21] hi,lo */ /* -43*/ ,LDOUBLE_HEX(3ffe,ff88,e316,732a,f8bf),LDOUBLE_HEX(bfbc,9a27,1ddb,a851,3860) /* ~0.99818248079388273078091028955860508631303673610091 T2[ 21] hi,lo */ /* -42*/ ,LDOUBLE_HEX(3ffe,cbec,14fe,f272,7c5d),LDOUBLE_HEX(bfba,b6f8,370b,a140,9231) /* ~0.79657107567113344897104590391911926872126059606671 T1[ 22] hi,lo */ /* -42*/ ,LDOUBLE_HEX(3ffe,ff8b,a798,68ed,b341),LDOUBLE_HEX(bfbd,f2fb,91eb,2cdf,6fb7) /* ~0.99822471114105475539649350857906995315715903416275 T2[ 22] hi,lo */ /* -41*/ ,LDOUBLE_HEX(3ffe,cd07,8b86,503d,cdd2),LDOUBLE_HEX(bfbd,ef64,73b9,8c84,14e6) /* ~0.80089637784134667692226977608882521053601521998643 T1[ 23] hi,lo */ /* -41*/ ,LDOUBLE_HEX(3ffe,ff8e,6c22,0b21,8d8b),LDOUBLE_HEX(3fbc,dbab,2022,5186,afc9) /* ~0.99826694327487627199325601057289247819426236674189 T2[ 23] hi,lo */ /* -40*/ ,LDOUBLE_HEX(3ffe,ce24,8c15,1f84,80e4),LDOUBLE_HEX(bfbb,ee53,e383,5069,c895) /* ~0.80524516597462715409606881511450637844973243772983 T1[ 24] hi,lo */ /* -40*/ ,LDOUBLE_HEX(3ffe,ff91,30b3,59db,ce53),LDOUBLE_HEX(3fbd,9ced,2076,73bc,c0c0) /* ~0.99830917719542286886983892268965234961797250434756 T2[ 24] hi,lo */ /* -39*/ ,LDOUBLE_HEX(3ffe,cf43,18cf,1919,18c1),LDOUBLE_HEX(3fbc,994f,1cc9,8dc0,21f2) /* ~0.80961756759743187464176475409693978235736722126603 T1[ 25] hi,lo */ /* -39*/ ,LDOUBLE_HEX(3ffe,ff93,f54c,5531,bc88),LDOUBLE_HEX(3fbc,badb,2327,d830,4c8e) /* ~0.99835141290277013741485956366261689254315569996833 T2[ 25] hi,lo */ /* -38*/ ,LDOUBLE_HEX(3ffe,d063,33da,ef2b,2595),LDOUBLE_HEX(bfbc,a4ae,8e6a,996c,abf8) /* ~0.81401371092867388343282744611606460694019915536046 T1[ 26] hi,lo */ /* -38*/ ,LDOUBLE_HEX(3ffe,ff96,b9ec,fd38,9f54),LDOUBLE_HEX(3fbc,deab,3cf6,1b93,876b) /* ~0.99839365039699367221533166105729151240666396915912 T2[ 26] hi,lo */ /* -37*/ ,LDOUBLE_HEX(3ffe,d184,df62,5169,9ac6),LDOUBLE_HEX(3fba,b8fb,b86d,56aa,3fd1) /* ~0.81843372488348224388140378371403471646772231906652 T1[ 27] hi,lo */ /* -37*/ ,LDOUBLE_HEX(3ffe,ff99,7e95,5205,be1d),LDOUBLE_HEX(bfbc,de71,2326,2868,54d2) /* ~0.99843588967816907111087545989569491666770773008465 T2[ 27] hi,lo */ /* -36*/ ,LDOUBLE_HEX(3ffe,d2a8,1d91,f12a,e45a),LDOUBLE_HEX(3fbb,9124,72be,1ef2,0143) /* ~0.82287773907698242225553647566371751054248306900262 T1[ 28] hi,lo */ /* -36*/ ,LDOUBLE_HEX(3ffe,ff9c,4345,53ae,6082),LDOUBLE_HEX(3fbc,fe9f,77a5,1aa2,3b01) /* ~0.99847813074637193503108739678353344970673788338899 T2[ 28] hi,lo */ /* -35*/ ,LDOUBLE_HEX(3ffe,d3cc,f099,859a,c379),LDOUBLE_HEX(3fbd,dfb2,b158,f1a9,8797) /* ~0.82734588382809719876243362279844006934581557288765 T1[ 29] hi,lo */ /* -35*/ ,LDOUBLE_HEX(3ffe,ff9f,07fd,0247,ce60),LDOUBLE_HEX(bfb8,da60,27f4,240a,2f75) /* ~0.99852037360167786826659064303157720132730901241302 T2[ 29] hi,lo */ /* -34*/ ,LDOUBLE_HEX(3ffe,d4f3,5aab,cfed,fa1f),LDOUBLE_HEX(3fbd,b243,bdff,4c4c,58b5) /* ~0.83183829016336821750429372790414106475509470328688 T1[ 30] hi,lo */ /* -34*/ ,LDOUBLE_HEX(3ffe,ffa1,ccbc,5de7,4fcc),LDOUBLE_HEX(3fbd,be96,9b04,c127,0421) /* ~0.99856261824416247814377445291000867655384354293346 T2[ 30] hi,lo */ /* -33*/ ,LDOUBLE_HEX(3ffe,d61b,5dfe,9f9b,ce07),LDOUBLE_HEX(bfbc,8d32,b9db,3407,1837) /* ~0.83635508982079828681687957980805947499902686104178 T1[ 31] hi,lo */ /* -33*/ ,LDOUBLE_HEX(3ffe,ffa4,9183,66a2,2d19),LDOUBLE_HEX(bfbc,d9f7,dc7c,8136,fec5) /* ~0.99860486467390137535005481539407412583386758342385 T2[ 31] hi,lo */ /* -32*/ ,LDOUBLE_HEX(3ffe,d744,fcca,d69d,6af4),LDOUBLE_HEX(3fbc,e69a,2ee6,40b4,ff78) /* ~0.84089641525371454301891749327779734812793321907520 T1[ 32] hi,lo */ /* -32*/ ,LDOUBLE_HEX(3ffe,ffa7,5652,1c8d,aed2),LDOUBLE_HEX(bfbd,c18b,c96e,08d6,74ee) /* ~0.99864711289097017360861380241843221483577508479356 T2[ 32] hi,lo */ /* -31*/ ,LDOUBLE_HEX(3ffe,d870,394c,6db3,2c84),LDOUBLE_HEX(3fbc,8559,bf8d,ed94,1cbc) /* ~0.84546239963465259097986914671452041147858835756778 T1[ 33] hi,lo */ /* -31*/ ,LDOUBLE_HEX(3ffe,ffaa,1b28,7fbf,1dbe),LDOUBLE_HEX(3fbd,8eb4,6838,bb56,a087) /* ~0.99868936289544448989524000337425491125031840056180 T2[ 33] hi,lo */ /* -30*/ ,LDOUBLE_HEX(3ffe,d99d,15c2,78af,d7b6),LDOUBLE_HEX(bfb7,bc61,09ae,0f6a,2a20) /* ~0.85005317685926173475099293375123465921205934137105 T1[ 34] hi,lo */ /* -30*/ ,LDOUBLE_HEX(3ffe,ffac,e006,904b,c2e1),LDOUBLE_HEX(3fbc,b14f,99ba,f83d,8dd4) /* ~0.99873161468739994449253863373350270649098092690110 T2[ 34] hi,lo */ /* -29*/ ,LDOUBLE_HEX(3ffe,dacb,946f,2ac9,cc72),LDOUBLE_HEX(bfbc,efdd,dd36,f187,1d1c) /* ~0.85466888155023141356459587258953547461715061217546 T1[ 35] hi,lo */ /* -29*/ ,LDOUBLE_HEX(3ffe,ffaf,a4ec,4e48,e778),LDOUBLE_HEX(bfbd,8671,6e2d,8219,1444) /* ~0.99877386826691216077309110055182372889248654246330 T2[ 35] hi,lo */ /* -28*/ ,LDOUBLE_HEX(3ffe,dbfb,b797,daf2,3755),LDOUBLE_HEX(3fbc,f610,356a,78a6,a991) /* ~0.85930964906123895780164570479264796176721574738621 T1[ 36] hi,lo */ /* -28*/ ,LDOUBLE_HEX(3ffe,ffb2,69d9,b9cb,d4fa),LDOUBLE_HEX(3fbd,d84d,2ee6,e8d4,d3b8) /* ~0.99881612363405676525366511109282896541117224842309 T2[ 36] hi,lo */ /* -27*/ ,LDOUBLE_HEX(3ffe,dd2d,8185,0832,4c20),LDOUBLE_HEX(3fbd,cb3c,6af5,b47f,2972) /* ~0.86397561548091878110000596535655859042890369892120 T1[ 37] hi,lo */ /* -27*/ ,LDOUBLE_HEX(3ffe,ffb5,2ece,d2e9,d51d),LDOUBLE_HEX(bfbd,994c,52bb,c51e,a42f) /* ~0.99885838078890938786626521594946837012685136869549 T2[ 37] hi,lo */ /* -26*/ ,LDOUBLE_HEX(3ffe,de60,f482,5e0e,9124),LDOUBLE_HEX(bfbc,8be1,7498,5ee6,5e9c) /* ~0.86866691763685312450450626275966214961954392492771 T1[ 38] hi,lo */ /* -26*/ ,LDOUBLE_HEX(3ffe,ffb7,f3cb,99b8,31cd),LDOUBLE_HEX(3fbb,8b13,c75c,9907,9d08) /* ~0.99890063973154566147024183142555386893945978954434 T2[ 38] hi,lo */ /* -25*/ ,LDOUBLE_HEX(3ffe,df96,12de,b8f0,4420),LDOUBLE_HEX(3fbd,8d70,2518,e344,9fa0) /* ~0.87338369309958447002373294054677899111993610858917 T1[ 39] hi,lo */ /* -25*/ ,LDOUBLE_HEX(3ffe,ffba,b8d0,0e4c,3535),LDOUBLE_HEX(3fba,bff0,5a1f,2fe7,8cc7) /* ~0.99894290046204122234018221715423635487240971997380 T2[ 39] hi,lo */ /* -24*/ ,LDOUBLE_HEX(3ffe,e0cc,deec,2a94,e111),LDOUBLE_HEX(3fb9,cb12,a091,ba66,7944) /* ~0.87812608018664974155473648687042498295340919867157 T1[ 40] hi,lo */ /* -24*/ ,LDOUBLE_HEX(3ffe,ffbd,7ddc,30bb,29b9),LDOUBLE_HEX(3fbc,c13b,06cc,24fb,adcf) /* ~0.99898516298047170984064982435235435787035385146737 T2[ 40] hi,lo */ /* -23*/ ,LDOUBLE_HEX(3ffe,e205,5aff,fe83,d369),LDOUBLE_HEX(bfbd,b207,df0e,7d75,ac99) /* ~0.88289421796663641054054086354518915413791546598076 T1[ 41] hi,lo */ /* -23*/ ,LDOUBLE_HEX(3ffe,ffc0,42f0,011a,59f9),LDOUBLE_HEX(3fbb,9baa,d16f,ffef,fe31) /* ~0.99902742728691276658881462169325970990030327811837 T2[ 41] hi,lo */ /* -22*/ ,LDOUBLE_HEX(3ffe,e33f,8972,be8a,5a51),LDOUBLE_HEX(3fba,9bfe,9079,5980,eecf) /* ~0.88768824626326062627321503151200943193543935194611 T1[ 42] hi,lo */ /* -22*/ ,LDOUBLE_HEX(3ffe,ffc3,080b,7f7f,10cf),LDOUBLE_HEX(3fbd,a67d,211d,b089,b842) /* ~0.99906969338144003834603287805826710155088221654295 T2[ 42] hi,lo */ /* -21*/ ,LDOUBLE_HEX(3ffe,e47b,6ca0,373d,a88d),LDOUBLE_HEX(3fbd,cbc4,8805,c442,ddb5) /* ~0.89250830565946749005053553749355899071815656498074 T1[ 43] hi,lo */ /* -21*/ ,LDOUBLE_HEX(3ffe,ffc5,cd2e,abfe,9952),LDOUBLE_HEX(bfbd,d27c,2e60,9c60,e59f) /* ~0.99911196126412917418047748840947974713344592601060 T2[ 43] hi,lo */ /* -20*/ ,LDOUBLE_HEX(3ffe,e5b9,06e7,7c83,48a8),LDOUBLE_HEX(3fbb,f2f4,7a52,76dd,8765) /* ~0.89735453750155359320742065598608405707636848092079 T1[ 44] hi,lo */ /* -20*/ ,LDOUBLE_HEX(3ffe,ffc8,9259,86ae,3ed1),LDOUBLE_HEX(bfbd,e1f3,4d80,330a,7c7d) /* ~0.99915423093505582619608743066841327618021750822663 T2[ 44] hi,lo */ /* -19*/ ,LDOUBLE_HEX(3ffe,e6f8,5aaa,ee1f,ce22),LDOUBLE_HEX(3fbd,f895,8fac,51be,5160) /* ~0.90222708390331194012751875321853844980068970471620 T1[ 45] hi,lo */ /* -19*/ ,LDOUBLE_HEX(3ffe,ffcb,578c,0fa3,4cd8),LDOUBLE_HEX(bfba,85a0,3df0,1bbe,480e) /* ~0.99919650239429564980361830883737184194615110754966 T2[ 45] hi,lo */ /* -18*/ ,LDOUBLE_HEX(3ffe,e839,6a50,3c4b,dc68),LDOUBLE_HEX(3fbd,f22f,21a1,58e1,8fbc) /* ~0.90712608775019937809927506044971323717618361115455 T1[ 46] hi,lo */ /* -18*/ ,LDOUBLE_HEX(3ffe,ffce,1cc6,46f3,0f2f),LDOUBLE_HEX(bfbd,d11c,79ec,fe71,2113) /* ~0.99923877564192430366643224437517289970855927094817 T2[ 46] hi,lo */ /* -17*/ ,LDOUBLE_HEX(3ffe,e97c,3840,6c4f,8c57),LDOUBLE_HEX(bfba,f6e3,3b0a,efed,259d) /* ~0.91205169270352665550133028360413334212353220209479 T1[ 47] hi,lo */ /* -17*/ ,LDOUBLE_HEX(3ffe,ffd0,e208,2cb2,d1d6),LDOUBLE_HEX(3fbd,822a,581b,5246,bdac) /* ~0.99928105067801744948365744170004631996562238782644 T2[ 47] hi,lo */ /* -16*/ ,LDOUBLE_HEX(3ffe,eac0,c6e7,dd24,392f),LDOUBLE_HEX(bfbc,bf4a,2932,3e46,ac15) /* ~0.91700404320467123175366838672140090693574165925383 T1[ 48] hi,lo */ /* -16*/ ,LDOUBLE_HEX(3ffe,ffd3,a751,c0f7,e10c),LDOUBLE_HEX(bfbc,b118,1d47,fb41,07e6) /* ~0.99932332750265075236965894855956094033899717032909 T2[ 48] hi,lo */ /* -15*/ ,LDOUBLE_HEX(3ffe,ec07,18b6,4c1c,bddc),LDOUBLE_HEX(3fbc,9f3a,0910,0bf0,97d9) /* ~0.92198328447931296252514099531794045105925761163234 T1[ 49] hi,lo */ /* -15*/ ,LDOUBLE_HEX(3ffe,ffd6,6ca3,03d7,8947),LDOUBLE_HEX(3fbc,eeaf,9a2f,a3c1,3789) /* ~0.99936560611589988042035778703642279197083553299307 T2[ 49] hi,lo */ /* -14*/ ,LDOUBLE_HEX(3ffe,ed4f,301e,d994,2b84),LDOUBLE_HEX(3fbd,c01a,5b6d,4c97,f624) /* ~0.92698956254169278417588684337857785067171789705753 T1[ 50] hi,lo */ /* -14*/ ,LDOUBLE_HEX(3ffe,ffd9,31fb,f567,173b),LDOUBLE_HEX(3fbd,e5f8,d3c8,1e5c,b0b2) /* ~0.99940788651784050509270171391840165142639307305216 T2[ 50] hi,lo */ /* -13*/ ,LDOUBLE_HEX(3ffe,ee99,0f98,0da3,025b),LDOUBLE_HEX(3fbd,95de,3c06,30a3,9321) /* ~0.93202302419889452238894664293233915941527811810374 T1[ 51] hi,lo */ /* -13*/ ,LDOUBLE_HEX(3ffe,ffdb,f75c,95bb,d7d7),LDOUBLE_HEX(bfbd,fbb3,2c62,3fb8,60df) /* ~0.99945016870854830104203489482550537559291115030646 T2[ 51] hi,lo */ /* -12*/ ,LDOUBLE_HEX(3ffe,efe4,b99b,dcda,f5cb),LDOUBLE_HEX(3fbd,8cac,39ed,291b,7226) /* ~0.93708381705514995065010516728243317174928961321711 T1[ 52] hi,lo */ /* -12*/ ,LDOUBLE_HEX(3ffe,ffde,bcc4,e4eb,1842),LDOUBLE_HEX(bfbd,fe9c,0372,21ba,c7cf) /* ~0.99949245268809894595946757833715423657849896699190 T2[ 52] hi,lo */ /* -11*/ ,LDOUBLE_HEX(3ffe,f132,30a7,ad09,4509),LDOUBLE_HEX(3fbc,ec3f,42f5,b4c8,cfcf) /* ~0.94217208951616722483130353382740906909020850434899 T1[ 53] hi,lo */ /* -11*/ ,LDOUBLE_HEX(3ffe,ffe1,8234,e30a,25e1),LDOUBLE_HEX(bfbd,d44f,a015,3fba,570a) /* ~0.99953473845656812089713674773783225191436940804123 T2[ 53] hi,lo */ /* -10*/ ,LDOUBLE_HEX(3ffe,f281,773c,59ff,b13a),LDOUBLE_HEX(bfbb,bb3f,ab19,b85c,2da7) /* ~0.94728799079348282067506575865323270591034088283777 T1[ 54] hi,lo */ /* -10*/ ,LDOUBLE_HEX(3ffe,ffe4,47ac,902e,4e53),LDOUBLE_HEX(bfb9,db28,c775,3bab,3e53) /* ~0.99957702601403151005136568651998629775334848091006 T2[ 54] hi,lo */ /* -9*/ ,LDOUBLE_HEX(3ffe,f3d2,8fde,3a64,1a5b),LDOUBLE_HEX(bfbd,b74d,7cdc,8798,a758) /* ~0.95243167090883710184474539306442864017299143597483 T1[ 55] hi,lo */ /* -9*/ ,LDOUBLE_HEX(3ffe,ffe7,0d2b,ec6c,df73),LDOUBLE_HEX(bfba,cdc3,3c89,4bd3,b790) /* ~0.99961931536056480087108419563257655227062059566378 T2[ 55] hi,lo */ /* -8*/ ,LDOUBLE_HEX(3ffe,f525,7d15,2486,cc2c),LDOUBLE_HEX(3fbd,f73a,18f5,db30,1f87) /* ~0.95760328069857364691012946433801289458642713725566 T1[ 56] hi,lo */ /* -8*/ ,LDOUBLE_HEX(3ffe,ffe9,d2b2,f7db,2756),LDOUBLE_HEX(bfbc,8838,b5d7,21d6,f1ce) /* ~0.99966160649624368394940837623252605226298328489065 T2[ 56] hi,lo */ /* -7*/ ,LDOUBLE_HEX(3ffe,f67a,416c,733f,846e),LDOUBLE_HEX(bfbd,fced,046b,6310,b9e0) /* ~0.96280297181806246450529868097234498236502986401319 T1[ 57] hi,lo */ /* -7*/ ,LDOUBLE_HEX(3ffe,ffec,9841,b28e,744c),LDOUBLE_HEX(3fbc,97cc,e653,acf3,2bde) /* ~0.99970389942114385307785073830899591484921984374523 T2[ 57] hi,lo */ /* -6*/ ,LDOUBLE_HEX(3ffe,f7d0,df73,0ad1,3bb9),LDOUBLE_HEX(bfb7,b795,b494,f824,8a8b) /* ~0.96803089674614722529933166783600029248191276565194 T1[ 58] hi,lo */ /* -6*/ ,LDOUBLE_HEX(3ffe,ffef,5dd8,1c9c,14e1),LDOUBLE_HEX(3fbd,94dc,70ee,035c,489a) /* ~0.99974619413534100530053030930766055917047196999192 T2[ 58] hi,lo */ /* -5*/ ,LDOUBLE_HEX(3ffe,f929,59bb,5dd4,ba74),LDOUBLE_HEX(3fbc,d2df,86c7,21a9,8d5b) /* ~0.97328720878961664316093849169675422672298736870288 T1[ 59] hi,lo */ /* -5*/ ,LDOUBLE_HEX(3ffe,fff2,2376,3619,57dc),LDOUBLE_HEX(bfbc,873d,93df,ba07,4a3e) /* ~0.99978849063891084085996252550643248468986712396144 T2[ 59] hi,lo */ /* -4*/ ,LDOUBLE_HEX(3ffe,fa83,b2db,722a,033a),LDOUBLE_HEX(3fbd,f84b,7628,62ba,ff99) /* ~0.97857206208770013448287189428143051372899208217859 T1[ 60] hi,lo */ /* -4*/ ,LDOUBLE_HEX(3ffe,fff4,e91b,ff1b,8c3e),LDOUBLE_HEX(bfbd,ef98,e3e2,81af,6b64) /* ~0.99983078893192906314284912339118704949214588850736 T2[ 60] hi,lo */ /* -3*/ ,LDOUBLE_HEX(3ffe,fbdf,ed6c,e5f0,9c49),LDOUBLE_HEX(bfbd,c4b4,018d,426a,3a32) /* ~0.98388561161658788907719355720793430464254925027489 T1[ 61] hi,lo */ /* -3*/ ,LDOUBLE_HEX(3ffe,fff7,aec9,77b8,0143),LDOUBLE_HEX(3fb9,87ed,a7ba,da2f,9976) /* ~0.99987308901447137873428824828003769198403460904955 T2[ 61] hi,lo */ /* -2*/ ,LDOUBLE_HEX(3ffe,fd3e,0c0c,f486,c175),LDOUBLE_HEX(bfbd,f581,8b4d,9c3e,23fa) /* ~0.98922801319397548415511892128115789546427549794316 T1[ 62] hi,lo */ /* -2*/ ,LDOUBLE_HEX(3ffe,fffa,747e,a004,0664),LDOUBLE_HEX(3fbc,8e3e,4bde,4901,6016) /* ~0.99991539088661349752619467157188637429499067366123 T2[ 62] hi,lo */ /* -1*/ ,LDOUBLE_HEX(3ffe,fe9e,115c,7b8f,884c),LDOUBLE_HEX(bfbd,a45b,4cd4,30c5,a1ed) /* ~0.99459942348363317566987962248248322794097475707530 T1[ 63] hi,lo */ /* -1*/ ,LDOUBLE_HEX(3ffe,fffd,3a3b,7814,eb54),LDOUBLE_HEX(bfbc,ca27,58a3,c057,ba57) /* ~0.99995769454843113255466946487359791717608459293842 T2[ 63] hi,lo */ /* 0*/ ,LDOUBLE_HEX(3fff,8000,0000,0000,0000),LDOUBLE_HEX(0000,0000,0000,0000,0000) /* 1.0 T1[ 64] hi,lo */ /* 0*/ ,LDOUBLE_HEX(3fff,8000,0000,0000,0000),LDOUBLE_HEX(0000,0000,0000,0000,0000) /* 1.0 T2[ 64] hi,lo */ /* 1*/ ,LDOUBLE_HEX(3fff,80b1,ed4f,d999,ab6c),LDOUBLE_HEX(3fbd,94cd,5c66,db9b,f480) /* ~1.00542990111280282133562891111466797156026586890220 T1[ 65] hi,lo */ /* 1*/ ,LDOUBLE_HEX(3fff,8001,62e6,1bed,4a49),LDOUBLE_HEX(bfbc,bd9e,8f2d,ce5c,6131) /* ~1.00004230724139581934929027484670882586215157061815 T2[ 65] hi,lo */ /* 2*/ ,LDOUBLE_HEX(3fff,8164,d1f3,bc03,0773),LDOUBLE_HEX(3fbe,f7ca,ca4f,7a29,bde9) /* ~1.01088928605170045996793776188482638644927646964788 T1[ 66] hi,lo */ /* 2*/ ,LDOUBLE_HEX(3fff,8002,c5d0,0fdc,fcb7),LDOUBLE_HEX(bfbe,9353,2b4e,7f6e,83c2) /* ~1.00008461627269431323383058751730345647956710308790 T2[ 66] hi,lo */ /* 3*/ ,LDOUBLE_HEX(3fff,8218,af43,73fc,25ec),LDOUBLE_HEX(bfbe,c706,5df2,5b81,9130) /* ~1.01637831491095303798263826955405875196447595953941 T1[ 67] hi,lo */ /* 3*/ ,LDOUBLE_HEX(3fff,8004,28bd,dbd9,bf99),LDOUBLE_HEX(3fbb,d289,3e85,affc,a646) /* ~1.00012692709397120742909753632332581219088751822710 T2[ 67] hi,lo */ /* 4*/ ,LDOUBLE_HEX(3fff,82cd,8698,ac2b,a1d7),LDOUBLE_HEX(3fbd,f8a9,1d6d,1948,2ffd) /* ~1.02189714865411667820815216911611855721275787800550 T1[ 68] hi,lo */ /* 4*/ ,LDOUBLE_HEX(3fff,8005,8baf,7fee,3b5d),LDOUBLE_HEX(3fbc,e38c,59c7,2a4e,5c9a) /* ~1.00016923970530223107159445428138155875785741955041 T2[ 68] hi,lo */ /* 5*/ ,LDOUBLE_HEX(3fff,8383,594e,efb6,ee37),LDOUBLE_HEX(bfbc,eff1,589e,1360,4be1) /* ~1.02744594911876369655156365778836402569140773266553 T1[ 69] hi,lo */ /* 5*/ ,LDOUBLE_HEX(3fff,8006,eea4,fc25,188e),LDOUBLE_HEX(bfbe,be51,bfd6,da9c,50ec) /* ~1.00021155410676311644201097461603922056383453309535 T2[ 69] hi,lo */ /* 6*/ ,LDOUBLE_HEX(3fff,843a,28c3,acde,4046),LDOUBLE_HEX(3fbc,d7c9,7650,9fe8,ac10) /* ~1.03302487902122842248868461734190304923686198890209 T1[ 70] hi,lo */ /* 6*/ ,LDOUBLE_HEX(3fff,8008,519e,5088,ffd3),LDOUBLE_HEX(bfbc,ddbf,fb2a,c38e,3196) /* ~1.00025387029842959885680281351127973721304442733526 T2[ 70] hi,lo */ /* 7*/ ,LDOUBLE_HEX(3fff,84f1,f656,379c,1a29),LDOUBLE_HEX(3fbb,f030,62c2,6b5b,a5d1) /* ~1.03863410196137879060607894787793270552356261759996 T1[ 71] hi,lo */ /* 7*/ ,LDOUBLE_HEX(3fff,8009,b49b,7d24,99f3),LDOUBLE_HEX(bfbe,8364,adc5,5d2d,55af) /* ~1.00029618828037741710187263910469823713356163352727 T2[ 71] hi,lo */ /* 8*/ ,LDOUBLE_HEX(3fff,85aa,c367,cc48,7b15),LDOUBLE_HEX(bfbd,e8da,91cf,7aac,f938) /* ~1.04427378242741384034662083246658426105568651109933 T1[ 72] hi,lo */ /* 8*/ ,LDOUBLE_HEX(3fff,800b,179c,8202,8fd1),LDOUBLE_HEX(bfbe,d743,563a,a3ce,1a20) /* ~1.00033850805268231299888920249330226397432852536439 T2[ 72] hi,lo */ /* 9*/ ,LDOUBLE_HEX(3fff,8664,915b,923f,ba04),LDOUBLE_HEX(bfbd,91f4,8ed8,4742,eaa7) /* ~1.04994408580068726609749174549790495802881196141242 T1[ 73] hi,lo */ /* 9*/ ,LDOUBLE_HEX(3fff,800c,7aa1,5f2d,8a6d),LDOUBLE_HEX(3fbe,b45d,df92,07f3,cad6) /* ~1.00038082961542003151370755498206222000590059906244 T2[ 73] hi,lo */ /* 10*/ ,LDOUBLE_HEX(3fff,871f,6196,9e8d,1010),LDOUBLE_HEX(3fbd,e85c,9f15,ed4a,a559) /* ~1.05564517836055715878373906235765389283187687397003 T1[ 74] hi,lo */ /* 10*/ ,LDOUBLE_HEX(3fff,800d,ddaa,14b0,32e8),LDOUBLE_HEX(bfbe,dbf5,ee63,a474,2c9a) /* ~1.00042315296866632119004991707811313972342759370803 T2[ 74] hi,lo */ /* 11*/ ,LDOUBLE_HEX(3fff,87db,357f,f698,d792),LDOUBLE_HEX(bfbe,df6e,2275,ebd9,aeb2) /* ~1.06137722728926208099788086602899284116574563086032 T1[ 75] hi,lo */ /* 11*/ ,LDOUBLE_HEX(3fff,800f,40b6,a295,327b),LDOUBLE_HEX(3fbe,9a11,8af4,78f3,787d) /* ~1.00046547811249693317372372325380069923994597047567 T2[ 75] hi,lo */ /* 12*/ ,LDOUBLE_HEX(3fff,8898,0e80,92da,8527),LDOUBLE_HEX(3fbe,bbf1,aed9,318c,eac6) /* ~1.06714040067682361812972241521535465835768263787031 T1[ 76] hi,lo */ /* 12*/ ,LDOUBLE_HEX(3fff,8010,a3c7,08e7,3282),LDOUBLE_HEX(3fbd,ae5b,58b5,4705,681e) /* ~1.00050780504698762240524401168073609369457699358463 T2[ 76] hi,lo */ /* 13*/ ,LDOUBLE_HEX(3fff,8955,ee03,618e,5fdd),LDOUBLE_HEX(bfbe,d452,cdb2,971d,08d9) /* ~1.07293486752597555142999669053338607227487955242395 T1[ 77] hi,lo */ /* 13*/ ,LDOUBLE_HEX(3fff,8012,06db,47b0,dc73),LDOUBLE_HEX(3fbe,bb24,d6a1,6ac0,de44) /* ~1.00055013377221414664405146899284204664581920951604 T2[ 77] hi,lo */ /* 14*/ ,LDOUBLE_HEX(3fff,8a14,d575,496e,fd9a),LDOUBLE_HEX(3fbb,80ca,1d92,c368,0c22) /* ~1.07876079775711979373727100739444040300440974533557 T1[ 78] hi,lo */ /* 14*/ ,LDOUBLE_HEX(3fff,8013,69f3,5efc,d9e4),LDOUBLE_HEX(bfbe,ba91,a929,afe6,0b3f) /* ~1.00059246428825226711903373377765547047602012753486 T2[ 78] hi,lo */ /* 15*/ ,LDOUBLE_HEX(3fff,8ad4,c645,2c72,8924),LDOUBLE_HEX(3fba,d573,dd56,13bf,92a3) /* ~1.08461836221330923781328015031988343253033235669136 T1[ 79] hi,lo */ /* 15*/ ,LDOUBLE_HEX(3fff,8014,cd0f,4ed5,d485),LDOUBLE_HEX(3fbe,95d6,5430,ec64,68fa) /* ~1.00063479659517774787800409308502480598690453916788 T2[ 79] hi,lo */ /* 16*/ ,LDOUBLE_HEX(3fff,8b95,c1e3,ea8b,d6e7),LDOUBLE_HEX(bfba,8373,af14,eb58,6dfd) /* ~1.09050773266525765920875040704274283598351757973432 T1[ 80] hi,lo */ /* 16*/ ,LDOUBLE_HEX(3fff,8016,302f,1746,7628),LDOUBLE_HEX(3fbd,da43,7f91,3447,4021) /* ~1.00067713069306635665506322041551356960553675889968 T2[ 80] hi,lo */ /* 17*/ ,LDOUBLE_HEX(3fff,8c57,c9c4,646f,4dde),LDOUBLE_HEX(bfba,8f46,5c3d,afa3,6840) /* ~1.09642908181637682338803452264386351089342497289180 T1[ 81] hi,lo */ /* 17*/ ,LDOUBLE_HEX(3fff,8017,9352,b859,68ba),LDOUBLE_HEX(bfbd,a49b,73de,ad19,46f2) /* ~1.00071946658199386411165765498054724957910366356372 T2[ 81] hi,lo */ /* 18*/ ,LDOUBLE_HEX(3fff,8d1a,df5b,7e5b,a9e6),LDOUBLE_HEX(bfbe,9670,96d2,e37c,a594) /* ~1.10238258330784094358827107651421783884870819747447 T1[ 82] hi,lo */ /* 18*/ ,LDOUBLE_HEX(3fff,8018,f67a,3219,5645),LDOUBLE_HEX(3fbd,b854,8436,4510,af0d) /* ~1.00076180426203604405342023619951419277640525251626 T2[ 82] hi,lo */ /* 19*/ ,LDOUBLE_HEX(3fff,8ddf,0420,22e6,9cd6),LDOUBLE_HEX(bfbe,e18d,4bbd,81ca,0653) /* ~1.10836841172367863805718612990602878198842518031597 T1[ 83] hi,lo */ /* 19*/ ,LDOUBLE_HEX(3fff,801a,59a5,8490,e8f3),LDOUBLE_HEX(bfbd,bfde,9abb,c89b,4566) /* ~1.00080414373326867375543075544541693489009048789739 T2[ 83] hi,lo */ /* 20*/ ,LDOUBLE_HEX(3fff,8ea4,398b,45cd,53c0),LDOUBLE_HEX(3fbd,b700,5132,1e0f,5317) /* ~1.11438674259589253628943694707231770735234022140502 T1[ 84] hi,lo */ /* 20*/ ,LDOUBLE_HEX(3fff,801b,bcd4,afca,cb09),LDOUBLE_HEX(bfbc,ee2b,3ca1,60ce,c87d) /* ~1.00084648499576753342011486980211998343293089419603 T2[ 84] hi,lo */ /* 21*/ ,LDOUBLE_HEX(3fff,8f6a,8117,e6c8,e5c4),LDOUBLE_HEX(3fbb,cffb,0890,e8f2,826a) /* ~1.12043775240960668442349867923724104912253096699714 T1[ 85] hi,lo */ /* 21*/ ,LDOUBLE_HEX(3fff,801d,2007,b3d1,a6eb),LDOUBLE_HEX(3fbc,e24f,a3f1,8819,c368) /* ~1.00088882804960840661092497105855159134080167859792 T2[ 85] hi,lo */ /* 22*/ ,LDOUBLE_HEX(3fff,9031,dc43,1466,b1dc),LDOUBLE_HEX(3fbe,eeb0,2950,929d,0fc5) /* ~1.12652161860824189974425446614247903198702260851860 T1[ 86] hi,lo */ /* 22*/ ,LDOUBLE_HEX(3fff,801e,833e,90b0,271b),LDOUBLE_HEX(bfbd,df0c,d686,c810,ce9e) /* ~1.00093117289486708014391996846015331357193645089864 T2[ 86] hi,lo */ /* 23*/ ,LDOUBLE_HEX(3fff,90fa,4c8b,eee4,b12b),LDOUBLE_HEX(bfbe,d02d,6d6b,424b,49e1) /* ~1.13263851959871922803115701361420519788225647062063 T1[ 87] hi,lo */ /* 23*/ ,LDOUBLE_HEX(3fff,801f,e679,4670,f637),LDOUBLE_HEX(bfbd,f4b1,1157,9a3c,c09c) /* ~1.00097351953161934387092485421177912030543666332960 T2[ 87] hi,lo */ /* 24*/ ,LDOUBLE_HEX(3fff,91c3,d373,ab11,c336),LDOUBLE_HEX(3fbb,fd6d,8e0a,e5ac,9d82) /* ~1.13878863475669165369712210189589995934511534869670 T1[ 88] hi,lo */ /* 24*/ ,LDOUBLE_HEX(3fff,8021,49b7,d51e,befb),LDOUBLE_HEX(3fbe,f7b7,5b79,1115,d652) /* ~1.00101586795994099089637113797479628374276217073202 T2[ 88] hi,lo */ /* 25*/ ,LDOUBLE_HEX(3fff,928e,727d,9531,f9ac),LDOUBLE_HEX(3fbc,aadf,7a7a,5204,6a72) /* ~1.14497214443180421938536794890239889355143532156944 T1[ 89] hi,lo */ /* 25*/ ,LDOUBLE_HEX(3fff,8022,acfa,3cc4,2c43),LDOUBLE_HEX(bfbb,9803,679c,fccf,bd52) /* ~1.00105821817990781779413728136418626490922179073095 T2[ 89] hi,lo */ /* 26*/ ,LDOUBLE_HEX(3fff,935a,2b2f,13e6,e92c),LDOUBLE_HEX(bfbd,b319,afc5,89b6,c463) /* ~1.15118922995298270583672262112884254747768864035606 T1[ 90] hi,lo */ /* 26*/ ,LDOUBLE_HEX(3fff,8024,1040,7d6b,e905),LDOUBLE_HEX(bfbd,d992,0edb,1ae2,6862) /* ~1.00110057019159562395702739445724205324950162321329 T2[ 90] hi,lo */ /* 27*/ ,LDOUBLE_HEX(3fff,9426,ff0f,ab1c,04b6),LDOUBLE_HEX(3fbe,f15c,f03c,a096,7fdb) /* ~1.15744007363375102956197515435832201546872965991497 T1[ 91] hi,lo */ /* 27*/ ,LDOUBLE_HEX(3fff,8025,738a,9720,a056),LDOUBLE_HEX(3fbd,8031,e4e2,c90f,b56a) /* ~1.00114292399508021213887232203632038363139145076274 T2[ 91] hi,lo */ /* 28*/ ,LDOUBLE_HEX(3fff,94f4,efa8,fef7,0961),LDOUBLE_HEX(3fbd,ba2b,eb44,9547,7951) /* ~1.16372485877757751379386191858955612588033545762300 T1[ 92] hi,lo */ /* 28*/ ,LDOUBLE_HEX(3fff,8026,d6d8,89ec,fd6a),LDOUBLE_HEX(bfbe,8df6,8809,7e58,ba93) /* ~1.00118527959043738845452964358884173634578473865985 T2[ 92] hi,lo */ /* 29*/ ,LDOUBLE_HEX(3fff,95c3,fe86,d6cc,7fef),LDOUBLE_HEX(bfbb,adcd,6381,aa3b,dde8) /* ~1.17004376968325018808485954435738563006452750414609 T1[ 93] hi,lo */ /* 29*/ ,LDOUBLE_HEX(3fff,8028,3a2a,55db,ab90),LDOUBLE_HEX(bfbc,bd1b,9f76,51ee,96be) /* ~1.00122763697774296194620280431308856350369751453399 T2[ 93] hi,lo */ /* 30*/ ,LDOUBLE_HEX(3fff,9694,2d37,2018,5a00),LDOUBLE_HEX(3fbe,91d5,36d0,7538,458a) /* ~1.17639699165028127625376441756088752299547195434570 T1[ 94] hi,lo */ /* 30*/ ,LDOUBLE_HEX(3fff,8029,9d7f,faf7,5637),LDOUBLE_HEX(bfbe,d236,fdc3,f478,d426) /* ~1.00126999615707274512554220136095750603999476879835 T2[ 94] hi,lo */ /* 31*/ ,LDOUBLE_HEX(3fff,9765,7d49,f17a,b08e),LDOUBLE_HEX(3fbe,a0f4,5d52,3833,af61) /* ~1.18278471098434102989037375319725242661661468446254 T1[ 95] hi,lo */ /* 31*/ ,LDOUBLE_HEX(3fff,802b,00d9,794a,a8e9),LDOUBLE_HEX(3fbe,856f,102a,5311,acd9) /* ~1.00131235712850255343154409759520717670966405421495 T2[ 95] hi,lo */ /* 32*/ ,LDOUBLE_HEX(3fff,9837,f051,8db8,a96f),LDOUBLE_HEX(3fbe,8d5a,4630,5c85,eded) /* ~1.18920711500272106668756738612202639160386752337217 T1[ 96] hi,lo */ /* 32*/ ,LDOUBLE_HEX(3fff,802c,6436,d0e0,4f51),LDOUBLE_HEX(bfb6,e62d,6b30,d098,6397) /* ~1.00135471989210820588107192508076082049228716641664 T2[ 96] hi,lo */ /* 33*/ ,LDOUBLE_HEX(3fff,990b,87e2,66c1,89aa),LDOUBLE_HEX(bfbd,c61c,79fe,e0f2,443a) /* ~1.19566439203982737460481289293312556765158660709857 T1[ 97] hi,lo */ /* 33*/ ,LDOUBLE_HEX(3fff,802d,c798,01c2,f534),LDOUBLE_HEX(3fbe,ee14,9ecb,14b8,e2d1) /* ~1.00139708444796552430991476434485321078682318329811 T2[ 97] hi,lo */ /* 34*/ ,LDOUBLE_HEX(3fff,99e0,4593,20b7,fa65),LDOUBLE_HEX(bfbc,de7b,c9a6,5a50,1a8c) /* ~1.20215673145270314210817513833617908858286682516336 T1[ 98] hi,lo */ /* 34*/ ,LDOUBLE_HEX(3fff,802f,2afd,0bfd,4678),LDOUBLE_HEX(bfbc,b751,8633,d8a0,aeca) /* ~1.00143945079615033413172886511688375321682542562484 T2[ 98] hi,lo */ /* 35*/ ,LDOUBLE_HEX(3fff,9ab6,2afc,94ff,864a),LDOUBLE_HEX(3fbd,c468,ec6e,75e7,1adb) /* ~1.20868432362658157733399655331396616020356304943561 T1[ 99] hi,lo */ /* 35*/ ,LDOUBLE_HEX(3fff,8030,8e65,ef99,ef1d),LDOUBLE_HEX(3fbd,b09f,c1fc,23b2,9fab) /* ~1.00148181893673846357909612558856338182522449642419 T2[ 99] hi,lo */ /* 36*/ ,LDOUBLE_HEX(3fff,9b8d,39b9,d54e,5539),LDOUBLE_HEX(bfbe,baaf,d0ba,b867,81c2) /* ~1.21524735998046887815605271443430979161348659545183 T1[100] hi,lo */ /* 36*/ ,LDOUBLE_HEX(3fff,8031,f1d2,aca3,9b44),LDOUBLE_HEX(bfbe,a4c4,911a,dfc4,d295) /* ~1.00152418886980574446246561315376766287954524159431 T2[100] hi,lo */ /* 37*/ ,LDOUBLE_HEX(3fff,9c65,7368,2ec3,2c2d),LDOUBLE_HEX(3fbe,9cb0,d9be,d0c8,53bd) /* ~1.22184603297275751687071126960759670510014984756708 T1[101] hi,lo */ /* 37*/ ,LDOUBLE_HEX(3fff,8033,5543,4324,f728),LDOUBLE_HEX(3fbe,e415,5eab,b7e1,f081) /* ~1.00156656059542801141121204366868369106668978929519 T2[101] hi,lo */ /* 38*/ ,LDOUBLE_HEX(3fff,9d3e,d9a7,2cff,b751),LDOUBLE_HEX(bfbd,86da,cc3e,bc59,93d4) /* ~1.22848053610687000570828725232175315795757342129945 T1[102] hi,lo */ /* 38*/ ,LDOUBLE_HEX(3fff,8034,b8b7,b328,af26),LDOUBLE_HEX(3fbc,ac57,aea7,6d92,1bde) /* ~1.00160893411368110274099751944021363669889979064464 T2[102] hi,lo */ /* 39*/ ,LDOUBLE_HEX(3fff,9e19,6e18,9d47,2420),LDOUBLE_HEX(3fb7,f914,5ac7,9bba,f035) /* ~1.23515106393693330569250043993179133394733071327209 T1[103] hi,lo */ /* 39*/ ,LDOUBLE_HEX(3fff,8036,1c2f,fcb9,6fb5),LDOUBLE_HEX(bfbd,cfaa,e2c6,1949,76e1) /* ~1.00165130942464085958640979123757119850779417902231 T2[103] hi,lo */ /* 40*/ ,LDOUBLE_HEX(3fff,9ef5,3260,91a1,11ae),LDOUBLE_HEX(bfbe,bedd,c1ec,288c,045d) /* ~1.24185781207348404863409496723392066996893845498561 T1[104] hi,lo */ /* 40*/ ,LDOUBLE_HEX(3fff,8037,7fac,1fe1,e56a),LDOUBLE_HEX(3fbe,c39a,17ff,af9f,8d06) /* ~1.00169368652838312633464312728648337724735029041767 T2[104] hi,lo */ /* 41*/ ,LDOUBLE_HEX(3fff,9fd2,2825,6400,dd06),LDOUBLE_HEX(bfba,8fe5,5be7,cd04,73e3) /* ~1.24860097718920473662367054412669631346943788230419 T1[105] hi,lo */ /* 41*/ ,LDOUBLE_HEX(3fff,8038,e32c,1cac,bcfa),LDOUBLE_HEX(3fbd,ed51,9851,d0d3,59b7) /* ~1.00173606542498375084233874776629136249539442360401 T2[105] hi,lo */ /* 42*/ ,LDOUBLE_HEX(3fff,a0b0,510f,b971,4fc2),LDOUBLE_HEX(3fbc,c96e,3cf6,d87e,cd4c) /* ~1.25538075702469108956872700932905217996449209749698 T1[106] hi,lo */ /* 42*/ ,LDOUBLE_HEX(3fff,803a,46af,f324,a335),LDOUBLE_HEX(3fbe,ac3c,8131,843a,6e57) /* ~1.00177844611451858389348373856719831564987543970346 T2[106] hi,lo */ /* 43*/ ,LDOUBLE_HEX(3fff,a18f,aeca,8544,b6e4),LDOUBLE_HEX(bfbe,fbbc,6bef,3313,7e1e) /* ~1.26219735039425070806731743466855277802096679806709 T1[107] hi,lo */ /* 43*/ ,LDOUBLE_HEX(3fff,803b,aa37,a354,450a),LDOUBLE_HEX(3fbe,9180,bea1,677e,0605) /* ~1.00182082859706347963309192028447114353184588253498 T2[107] hi,lo */ /* 44*/ ,LDOUBLE_HEX(3fff,a270,4303,0c49,6819),LDOUBLE_HEX(bfbe,c90b,f620,fe60,42b1) /* ~1.26905095719173322259699238090391304467630106955766 T1[108] hi,lo */ /* 44*/ ,LDOUBLE_HEX(3fff,803d,0dc3,2d46,4f85),LDOUBLE_HEX(3fbe,868a,dee3,72d5,ffa8) /* ~1.00186321287269429535036341372133961158397141844034 T2[108] hi,lo */ /* 45*/ ,LDOUBLE_HEX(3fff,a352,0f68,e802,bb93),LDOUBLE_HEX(bfbe,ed0b,a6dd,6268,20c0) /* ~1.27594177839639210043139877504003720787295605987310 T1[109] hi,lo */ /* 45*/ ,LDOUBLE_HEX(3fff,803e,7152,9105,6fd0),LDOUBLE_HEX(3fbb,f7f1,9404,a7bf,1165) /* ~1.00190559894148689158710485713754678727127611637115 T2[109] hi,lo */ /* 46*/ ,LDOUBLE_HEX(3fff,a435,15ae,09e6,809e),LDOUBLE_HEX(3fbb,d1db,4831,781e,1eec) /* ~1.28287001607877828072111492385687370187952183187007 T1[110] hi,lo */ /* 46*/ ,LDOUBLE_HEX(3fff,803f,d4e5,ce9c,5332),LDOUBLE_HEX(3fbc,8ac0,9487,d439,3b90) /* ~1.00194798680351713202930918900079859668039716780185 T2[110] hi,lo */ /* 47*/ ,LDOUBLE_HEX(3fff,a519,5786,be9e,f339),LDOUBLE_HEX(3fbe,d8bc,f46f,9586,461e) /* ~1.28983587340666581218685121656974956749763805419206 T1[111] hi,lo */ /* 47*/ ,LDOUBLE_HEX(3fff,8041,387c,e615,a710),LDOUBLE_HEX(3fbe,8e4c,645a,3a8a,6df3) /* ~1.00199037645886088361557586523531426792033016681671 T2[111] hi,lo */ /* 48*/ ,LDOUBLE_HEX(3fff,a5fe,d6a9,b151,38ea),LDOUBLE_HEX(3fbc,e5eb,fb10,b883,80d9) /* ~1.29683955465100966592158215906493978764046914875507 T1[112] hi,lo */ /* 48*/ ,LDOUBLE_HEX(3fff,8042,9c17,d77c,18ed),LDOUBLE_HEX(3fbe,93f9,0835,f753,878b) /* ~1.00203276790759401653711085922182633112242911010980 T2[112] hi,lo */ /* 49*/ ,LDOUBLE_HEX(3fff,a6e5,94cf,eee8,6b1e),LDOUBLE_HEX(bfbe,c910,e561,f33b,7b4e) /* ~1.30388126519193589861710103061653853728785179555416 T1[113] hi,lo */ /* 49*/ ,LDOUBLE_HEX(3fff,8043,ffb6,a2da,5669),LDOUBLE_HEX(3fbe,9bfa,bd93,3942,b72a) /* ~1.00207516114979240412930644454903017503966111689805 T2[113] hi,lo */ /* 50*/ ,LDOUBLE_HEX(3fff,a7cd,93b4,e965,356a),LDOUBLE_HEX(bfbe,c274,9655,f8c1,1aa2) /* ~1.31096121152476434196416932298490110042621381580829 T1[114] hi,lo */ /* 50*/ ,LDOUBLE_HEX(3fff,8045,6359,483b,0d42),LDOUBLE_HEX(3fbd,8ab1,e480,8fb1,67b1) /* ~1.00211755618553192298016141226213449044735170900821 T2[114] hi,lo */ /* 51*/ ,LDOUBLE_HEX(3fff,a8b6,d516,7b32,0e09),LDOUBLE_HEX(bfbe,d0ad,37b2,7dde,6f19) /* ~1.31807960126606399473437464253677831038658041507005 T1[115] hi,lo */ /* 51*/ ,LDOUBLE_HEX(3fff,8046,c6ff,c7a8,eb53),LDOUBLE_HEX(3fbd,cd04,05c3,2637,6be1) /* ~1.00215995301488845282186085361431082674243953078985 T2[115] hi,lo */ /* 52*/ ,LDOUBLE_HEX(3fff,a9a1,5ab4,ea7c,0ef8),LDOUBLE_HEX(3fbe,a83c,49d8,6a63,f4e6) /* ~1.32523664315974129459391184227001758699771016836166 T1[116] hi,lo */ /* 52*/ ,LDOUBLE_HEX(3fff,8048,2aaa,212e,9e96),LDOUBLE_HEX(bfbe,f210,9561,2774,6f44) /* ~1.00220235163793787674761659456379447874496690928936 T2[116] hi,lo */ /* 53*/ ,LDOUBLE_HEX(3fff,aa8d,2652,ec90,7629),LDOUBLE_HEX(3fbe,ec62,0243,4ca6,7264) /* ~1.33243254708316144930158736459091528558928985148668 T1[117] hi,lo */ /* 53*/ ,LDOUBLE_HEX(3fff,8049,8e58,54d6,d520),LDOUBLE_HEX(bfbd,fa6c,16d0,f9cb,b862) /* ~1.00224475205475608077798632677968271309509873390197 T2[117] hi,lo */ /* 54*/ ,LDOUBLE_HEX(3fff,ab7a,39b5,a93e,d337),LDOUBLE_HEX(3fbe,cb00,4764,eb3c,00f3) /* ~1.33966752405330300531704351696404842186893802136182 T1[118] hi,lo */ /* 54*/ ,LDOUBLE_HEX(3fff,804a,f20a,62ac,3d26),LDOUBLE_HEX(3fbd,8b1b,de3c,962c,ab75) /* ~1.00228715426541895440297469388468698525684885680675 T2[118] hi,lo */ /* 55*/ ,LDOUBLE_HEX(3fff,ac68,96a4,be3f,e929),LDOUBLE_HEX(3fbe,bc2b,7343,bcf2,ec93) /* ~1.34694178623294583574832722350222979912359733134508 T1[119] hi,lo */ /* 55*/ ,LDOUBLE_HEX(3fff,804c,55c0,4ab9,84fb),LDOUBLE_HEX(bfbe,ef50,9f43,e508,28a0) /* ~1.00232955827000239036519285695803205271658953279256 T2[119] hi,lo */ /* 56*/ ,LDOUBLE_HEX(3fff,ad58,3eea,42a1,4ac6),LDOUBLE_HEX(3fbe,9301,5191,eb34,5d89) /* ~1.35425554693689272826688518858162524338695220649242 T1[120] hi,lo */ /* 56*/ ,LDOUBLE_HEX(3fff,804d,b97a,0d09,5b0c),LDOUBLE_HEX(3fbe,d93e,3efa,3df9,fcd1) /* ~1.00237196406858228422617762554125420138007029891014 T2[120] hi,lo */ /* 57*/ ,LDOUBLE_HEX(3fff,ae49,3452,ca35,b80e),LDOUBLE_HEX(3fbd,9637,02d3,0d44,07b1) /* ~1.36160902063822475556963131904097963342792354524135 T1[121] hi,lo */ /* 57*/ ,LDOUBLE_HEX(3fff,804f,1d37,a9a6,6de9),LDOUBLE_HEX(bfbc,c1d5,6430,8a2f,e68c) /* ~1.00241437166123453534217341287515523617912549525499 T2[121] hi,lo */ /* 58*/ ,LDOUBLE_HEX(3fff,af3b,78ad,690a,4375),LDOUBLE_HEX(bfbd,8367,bf8c,d132,bf35) /* ~1.36900242297459061194351420676085240302199963480234 T1[122] hi,lo */ /* 58*/ ,LDOUBLE_HEX(3fff,8050,80f9,209b,6c3b),LDOUBLE_HEX(bfbe,a036,e851,2e22,bdf0) /* ~1.00245678104803504577993006341429804706422146409749 T2[122] hi,lo */ /* 59*/ ,LDOUBLE_HEX(3fff,b02f,0dcb,b6e0,4584),LDOUBLE_HEX(bfbe,90a6,d5b7,91c4,cb15) /* ~1.37643597075453010024695399415861629677237942814826 T1[123] hi,lo */ /* 59*/ ,LDOUBLE_HEX(3fff,8051,e4be,71f3,04ca),LDOUBLE_HEX(3fbc,cada,b8ef,31ad,ee75) /* ~1.00249919222905972096722415631830926940892823040485 T2[123] hi,lo */ /* 60*/ ,LDOUBLE_HEX(3fff,b123,f581,d2ac,2590),LDOUBLE_HEX(bfbe,f05f,902d,25bd,44e3) /* ~1.38390988196383195492356055211757848155684769153594 T1[124] hi,lo */ /* 60*/ ,LDOUBLE_HEX(3fff,8053,4887,9db7,e67d),LDOUBLE_HEX(3fbc,b8f5,8e77,78e8,f943) /* ~1.00254160520438446969285900545187928400991950184106 T2[124] hi,lo */ /* 61*/ ,LDOUBLE_HEX(3fff,b21a,31a6,6618,fe3b),LDOUBLE_HEX(3fbe,f871,4c4e,d9a4,e410) /* ~1.39142437577192618709722576886278488927928265184164 T1[125] hi,lo */ /* 61*/ ,LDOUBLE_HEX(3fff,8054,ac54,a3f4,c057),LDOUBLE_HEX(3fbd,ec30,98f2,c3d2,f4bb) /* ~1.00258401997408520378140400763911088688473682850599 T2[125] hi,lo */ /* 62*/ ,LDOUBLE_HEX(3fff,b311,c412,a911,2489),LDOUBLE_HEX(3fbd,fb3c,5371,e629,4670) /* ~1.39897967253831114018292752776417842142109293490648 T1[126] hi,lo */ /* 62*/ ,LDOUBLE_HEX(3fff,8056,1025,84b4,417a),LDOUBLE_HEX(bfbe,9388,2575,b35d,d384) /* ~1.00262643653823783841845529440917061947402544319629 T2[126] hi,lo */ /* 63*/ ,LDOUBLE_HEX(3fff,b40a,aea2,654b,9841),LDOUBLE_HEX(bfbc,ea37,6118,3363,e500) /* ~1.40657599381901544249601904157387366467446554452180 T1[127] hi,lo */ /* 63*/ ,LDOUBLE_HEX(3fff,8057,73fa,4001,1923),LDOUBLE_HEX(3fbe,b2a6,1fe1,eb6f,b480) /* ~1.00266885489691829171695486300208699503855314105749 T2[127] hi,lo */ /* 64*/ ,LDOUBLE_HEX(3fff,b504,f333,f9de,6484),LDOUBLE_HEX(3fbe,b2fb,1366,ea95,7d3e) /* ~1.41421356237309504876378807303183293697657063603401 T1[128] hi,lo */ /* 64*/ ,LDOUBLE_HEX(3fff,8058,d7d2,d5e5,f6b1),LDOUBLE_HEX(bfbe,d654,ec13,ee23,6abc) /* ~1.00271127505020248547613209710860360246442724019289 T2[128] hi,lo */ }; #define L 7 /* # bits in table index (i1,i2) */ #define K 128 /* table size = 2^L */ #define L_EXPAND (((K/2) << L) + (K/2)) #define L_MASK ((1 << L)-1) #define constants_80 ((const LC_FLOAT_TYPE *)_constants_80) # define _DE2IntCst (constants_80[ 0]) # define _K2byLog2 (constants_80[ 1]) # define _Log2byK2Hi (constants_80[ 2]) # define _Log2byK2Med (constants_80[ 3]) # define _p3_HI (constants_80[ 4]) # define _p5 (constants_80[ 5]) # define _p4 (constants_80[ 6]) # define _p3_LO (constants_80[ 7]) # define _Log2byK2Lo (constants_80[ 8]) # define _p6 (constants_80[ 9]) __declspec(align(16)) static const unsigned short _constants_80[] = { LDOUBLE_HEX(403e,c000,0000,0000,0000) /* 0 DE2IntCst = 1.5*2^63 */ ,LDOUBLE_HEX(400d,b8aa,3b29,5c17,f0bc) /* 1 K2byLog2 = K^2/log(2) ~ 23637.11554992 */ ,LDOUBLE_HEX(bff0,b172,17f7,d1cf,79ac) /* 2 Log2byK2Hi ~ -4.23063464697232244524347213247665588919943502332898e-05 */ ,LDOUBLE_HEX(3fae,d871,319f,f000,0000) /* 3 Log2byK2Med ~ 6.99362349047620977408942987412840832949912800870764e-25 */ ,LDOUBLE_HEX(3ffc,aaaa,aaaa,aaaa,aaab) /* 4 p3_HI ~ 1.66666666666666666671184175718689601808364386670291e-01 */ ,LDOUBLE_HEX(3ff8,8888,8888,91d5,7943) /* 5 p5 ~ 8.33333333346550207291141649720844775117711833445355e-03 */ ,LDOUBLE_HEX(3ffa,aaaa,aaaa,aaaa,aaab) /* 6 p4 ~ 4.16666666666666666677960439296724004520910966675728e-02 */ ,LDOUBLE_HEX(bfbb,ab70,78a8,ae65,09cf) /* 7 p3_LO ~ -4.53796157421198095955516441874944572386592208568553e-21 */ ,LDOUBLE_HEX(3f84,d095,0bf0,cbcd,98d6) /* 8 Log2byK2Lo ~ 1.53242008494748302860112907643687641670519495734080e-37 */ ,LDOUBLE_HEX(3ff5,b60b,60b6,1286,f983) /* 9 p6 ~ 1.38888888890158889343717346078962981970050805102800e-03 */ }; //============================================================================================ double exp_rn( double xd ) { UINT64 x_val,x_abs,sign_mask,range,x_exp; SINT64 m,n,i1,i2,xsign,yesno; X_FLOAT_TYPE xx, rx, r2x, tp0x, tp1x, tpxx, tt1x, tt2x, tptx, resx; L_FLOAT_TYPE DE2IntCst,K2byLog2,Log2byK2Hi,Log2byK2Med,Log2byK2Lo; X_FLOAT_TYPE p3; L_FLOAT_TYPE p2,p4,p5,p6; L_FLOAT_TYPE tmp,w,mr,tmp1,tmp5,tmp6,tmp7,res,ef,rx2,x4,inf_d,minnorm_d,maxnorm_d; L_FLOAT_TYPE sc; // Don't know if it wouldn't be better as a double double resd; double volatile exception; /* load constants */ DE2IntCst = _DE2IntCst; //DE2IntCst = _Asm_setf(_FR_D, 0x43e8000000000000); /* 1 cycle slower */ K2byLog2 = _K2byLog2; Log2byK2Hi = _Log2byK2Hi; Log2byK2Med = _Log2byK2Med; p3.hi = _p3_HI; p2 = _Asm_setf(_FR_EXP, 0xfffe); /* 0.5 */ p5 = _p5; p4 = _p4; p3.lo = _p3_LO; /* get and classify input value; obtain range value */ /* 40862e42fefa39ef (+) overflow range * 40874910d52d3051 (-) underflow range * 000167522bd709be (^) */ x_val = _Asm_getf( _FR_D, xd ); sign_mask = ((SINT64)x_val >> 63); x_exp = _Asm_extr_u( x_val, 52, 11 ); x_abs = (x_val & ULL(7fffffffffffffff)); range = ULL(40862e42fefa39ef) ^ (sign_mask & ULL(000167522bd709be)); /* filter out special cases */ if (__builtin_expect( x_exp < 0x3eb, 0 )) { /* |x| < 2^(-20) */ if (__builtin_expect( x_exp < 0x3c8, 0 )) { /* |x| < 2^(-55) */ return _Asm_fma( _PC_D, xd, 1, 1, _SF0 ); } /* 2^(-55) <= |x| < 2^(-20) */ // printf("\nToto %1.30e\n", xd); tmp = p5*xd + p4; __X_SQR_L( r2x, xd ); tmp = p6*r2x.hi + tmp; tp1x.hi = p2; tp1x.lo = tmp*r2x.hi; __X_FMA_GREATER_LXX( tp0x, xd, p3, tp1x ); /* tp0 = xd * p3 + tp1 */ __X_FMA_GREATER_XXL( tpxx, r2x, tp0x, xd ); /* tpx = r2 * tp0 + xd*/ /* res = (tpxx.lo + tpxx.hi) + 1; */ res = _Asm_fma( _PC_D, tpxx.hi, 1, 1, _SF1 ); tmp = (1 - res); tmp = (tmp + tpxx.hi); tmp = (tmp + tpxx.lo); res = _Asm_fma( _PC_D, res, 1, tmp, _SF0 ); return res; } if (__builtin_expect( x_abs > range, 0 )) { /* nan, inf, large finite */ /* NaNs */ if (x_abs > ULL(7ff0000000000000)) { if (x_abs <= ULL(7ff7ffffffffffff)) { inf_d = _Asm_setf( _FR_D, ULL(7ff0000000000000) ); exception = _Asm_fma( _PC_D, inf_d, 0, 0, _SF0 ); } return _Asm_fma( _PC_D, xd, 1, 0, _SF0 ); } /* INFs */ if (x_abs == ULL(7ff0000000000000)) { if (sign_mask) /* -inf */ return 0; else /* +inf */ return xd; } /* large finite */ if (sign_mask) { /* underflow */ minnorm_d = _Asm_setf( _FR_D, ULL(0010000000000000) ); return _Asm_fma( _PC_D, minnorm_d, minnorm_d, 0, _SF0 ); } else { /* overflow */ maxnorm_d = _Asm_setf( _FR_D, ULL(7fefffffffffffff) ); return _Asm_fma( _PC_D, maxnorm_d, maxnorm_d, 0, _SF0 ); } } /* main path: 2^(-55) <= |x| < range */ /* reduction: x = m*log(2)/(K^2) + r; m = n*K^2 + i1*K + i2; |r|=[0..log(2)/(2*K^2)] */ w = xd * K2byLog2 + DE2IntCst; /* Double2Int on a doubledouble */ mr = (w - DE2IntCst); m = _Asm_getf( _FR_SIG, w ) + L_EXPAND; /* add L/2 to i1,i2 (make it unsigned table offset) */ rx.hi = mr * Log2byK2Hi + xd; i1 = (m >> L) & L_MASK; i2 = m & L_MASK; // was: n = _Asm_extr( m, 2*L, 16 ); The compiler seems to get it n = m >> 2*L; sc = _Asm_setf( _FR_EXP, 0xffff + n ); /* build 2^n */ //sc = _Asm_setf( _FR_D, ULL(3ff0000000000000) + (n<<52) ); /* build 2^n */ /* First step */ /* Compute e^xred as 1+p(xred) Then compute T*e^xred as T+T*p(xred) */ /* table lookup and reconstruction: T = T1[i1]*T2[i2]*2^n */ /* We read both vlues but it isn't slower */ __X_CONVERT_XC2X( tt1x, TX[i1*2+0] ); /* load T1[i1] */ __X_CONVERT_XC2X( tt2x, TX[i2*2+1] ); /* load T2[i2] */ tptx.hi = tt2x.hi * tt1x.hi ; /* degree 3 polynomial evaluation: */ rx2=rx.hi*rx.hi; tmp = p2 + p3.hi*rx.hi; // We're not adding a correcting term to rx.hi, we're multiplying the final exp by (1+f) rx.hi = rx.hi + mr * Log2byK2Med; //ef = 1.0 + mr * Log2byK2Med; tmp = rx.hi +rx2*tmp; /* tmp = x+x^2/2 + ...*/ /* Final reconstruction and rounding test */ res = tmp*tptx.hi + tptx.hi; resd = res*sc; /* do the scaling now, saves a few cycles */ #if 0 /* to time the first step alone */ return resd; #endif #if 0 // test a la Ziv /* This test is 3 cycles slower */ L_FLOAT_TYPE reshi,reslo,test,rn_constant; reshi = _Asm_fma( _PC_D, tmp, tptx.hi, tptx.hi, _SF0 ); /* tmp*tptx.hi + tptx.hi, round to double */ rn_constant = 1.005; reslo = res - reshi; test=_Asm_fma( _PC_D, reslo, rn_constant, reshi, _SF0 ); if(__builtin_expect( reshi==test, 1+1==2) ) { return resd; /* do the scaling now, saves a few cycles */ } #else // else test a la Ziv i1 = _Asm_getf( _FR_SIG, res); m = i1 & (0xff<<3); if(__builtin_expect((m!=(0x7f<<3) && m!=(0x80<<3)), 1+1==2)) { return resd; } #endif // end test a la Ziv else { /***************************************************************************************************/ /**************************************** second step **********************************************/ /***************************************************************************************************/ #if EVAL_PERF crlibm_second_step_taken++; #endif Log2byK2Lo = _Log2byK2Lo; p6 = _p6; // Cut from the first step tmp1 = mr * Log2byK2Med; tmp7 = mr * Log2byK2Hi + xd; tmp6 = _Asm_famax( tmp7, tmp1, _SF1 ); tmp5 = _Asm_famin( tmp1, tmp7, _SF1 ); rx.lo = (tmp6 - rx.hi); rx.lo = (tmp5 + rx.lo); rx.lo = (mr * Log2byK2Lo + rx.lo); /* table lookup and reconstruction: T = T1[i1]*T2[i2]*2^n */ __X_MUL_XX( tptx, tt1x, tt2x ); /* T = T1[i1]*T2[i2] */ tptx.hi *= sc; /* scale T' = T*2^n */ tptx.lo *= sc; /* polynomial evaluation: px = P(r)*r */ tmp = p5*rx.hi + p4; __X_SQR_X( r2x, rx ); tmp = p6*r2x.hi + tmp; tp1x.hi = p2; tp1x.lo = tmp*r2x.hi; __X_FMA_GREATER_XXX( tp0x, rx, p3, tp1x ); __X_FMA_GREATER_XXX( tpxx, r2x, tp0x, rx ); /* final reconstruction: res = (P(r)*r + 1)*T*2^n */ __X_FMA_GREATER_XXX( resx, tptx, tpxx, tptx ); /* convert and return result */ return (double)( resx.hi + resx.lo ); } } /* Just to compile OK within crlibm */ double exp_ru(double x) { return exp_rn(x); } double exp_rd(double x) { return exp_rn(x); } double exp_rz(double x) { return exp_rn(x); } interval-2.1.0/src/crlibm/exp-td-standalone.c0000644000000000000000000000470013031036767017225 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" #include "exp-td.h" #define AVOID_FMA 0 extern void exp_td_accurate(double *polyTblh, double *polyTblm, double *polyTbll, double rh, double rm, double rl, double tbl1h, double tbl1m, double tbl1l, double tbl2h, double tbl2m, double tbl2l); /* Function exp13 Computes exp(x) with an accuracy of 113 bits as 2^exponent * (exph + expm + expl) \approx exp(x) Unless the subnormal case for x, no special cases are handled. The triple-double exph + expm + expl is non-overlapping. The domain for exph + expm + expl is 1/2..2 The integer exponent is in the range -1024..1024. The value 2^(exponent) may therefore be non-representable whereas 2^exponent * (exph + expm + expl) is. */ void exp13(int *exponent, double *exph, double *expm, double *expl, double x) { double rh, rm, rl, tbl1h, tbl1m, tbl1l; double tbl2h, tbl2m, tbl2l; double xMultLog2InvMult2L, shiftedXMult, kd; double msLog2Div2LMultKh, msLog2Div2LMultKm, msLog2Div2LMultKl; double t1, t2; db_number shiftedXMultdb, xdb; int k, M, index1, index2, xIntHi; /* Argument reduction and filtering for special cases */ /* Compute k as a double and as an int */ xdb.d = x; xMultLog2InvMult2L = x * log2InvMult2L; shiftedXMult = xMultLog2InvMult2L + shiftConst; kd = shiftedXMult - shiftConst; shiftedXMultdb.d = shiftedXMult; /* Special cases tests */ xIntHi = xdb.i[HI]; /* Test if argument is a denormal or zero */ if ((xIntHi & 0x7ff00000) == 0) { /* We are in the RN case, return 1.0 in all cases */ *exph = 1.0; *expm = 0.0; *expl = 0.0; return; } k = shiftedXMultdb.i[LO]; M = k >> L; index1 = k & INDEXMASK1; index2 = (k & INDEXMASK2) >> LHALF; /* Table reads */ tbl1h = twoPowerIndex1[index1].hi; tbl1m = twoPowerIndex1[index1].mi; tbl2h = twoPowerIndex2[index2].hi; tbl2m = twoPowerIndex2[index2].mi; tbl1l = twoPowerIndex1[index1].lo; tbl2l = twoPowerIndex2[index2].lo; /* Argument reduction */ Mul133(&msLog2Div2LMultKh,&msLog2Div2LMultKm,&msLog2Div2LMultKl,kd,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1 = x + msLog2Div2LMultKh; Add12Cond(rh,t2,t1,msLog2Div2LMultKm); Add12Cond(rm,rl,t2,msLog2Div2LMultKl); /* Polynomial approximation and reconstruction: factorized code */ exp_td_accurate(exph, expm, expl, rh, rm, rl, tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l); *exponent = M; } interval-2.1.0/src/crlibm/exp-td.c0000644000000000000000000013511013031036767015077 0ustar 00000000000000/* * This function computes exp, correctly rounded, * using experimental techniques based on triple double arithmetics THIS IS EXPERIMENTAL SOFTWARE * * Author : Christoph Lauter * christoph.lauter at ens-lyon.fr * To have it replace the crlibm exp, do: gcc -DHAVE_CONFIG_H -I. -fPIC -O2 -c exp-td.c; mv exp-td.o exp_fast.o; make */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" #include "exp-td.h" #ifdef BUILD_INTERVAL_FUNCTIONS #include "interval.h" #endif #define AVOID_FMA 0 #define EVAL_PERF 1 void exp_td_accurate(double *polyTblh, double *polyTblm, double *polyTbll, double rh, double rm, double rl, double tbl1h, double tbl1m, double tbl1l, double tbl2h, double tbl2m, double tbl2l) { double highPoly, highPolyMulth, highPolyMultm, highPolyMultl; double rhSquareh, rhSquarel, rhSquareHalfh, rhSquareHalfl; double rhCubeh, rhCubem, rhCubel; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5, t6; double lowPolyh, lowPolym, lowPolyl; double ph, pm, pl, phnorm, pmnorm, rmlMultPh, rmlMultPl; double qh, ql, fullPolyh, fullPolym, fullPolyl; double polyWithTbl1h, polyWithTbl1m, polyWithTbl1l; double polyAddOneh,polyAddOnem,polyAddOnel; double polyWithTablesh, polyWithTablesm, polyWithTablesl; #if EVAL_PERF crlibm_second_step_taken++; #endif #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(accPolyC7,rh,accPolyC6),rh,accPolyC5); #else highPoly = accPolyC5 + rh * (accPolyC6 + rh * accPolyC7); #endif Mul12(&t1h,&t1l,rh,highPoly); Add22(&t2h,&t2l,accPolyC4h,accPolyC4l,t1h,t1l); Mul22(&t3h,&t3l,rh,0,t2h,t2l); Add22(&t4h,&t4l,accPolyC3h,accPolyC3l,t3h,t3l); Mul12(&rhSquareh,&rhSquarel,rh,rh); Mul23(&rhCubeh,&rhCubem,&rhCubel,rh,0,rhSquareh,rhSquarel); rhSquareHalfh = 0.5 * rhSquareh; rhSquareHalfl = 0.5 * rhSquarel; Renormalize3(&lowPolyh,&lowPolym,&lowPolyl,rh,rhSquareHalfh,rhSquareHalfl); Mul233(&highPolyMulth,&highPolyMultm,&highPolyMultl,t4h,t4l,rhCubeh,rhCubem,rhCubel); Add33(&ph,&pm,&pl,lowPolyh,lowPolym,lowPolyl,highPolyMulth,highPolyMultm,highPolyMultl); Add12(phnorm,pmnorm,ph,pm); Mul22(&rmlMultPh,&rmlMultPl,rm,rl,phnorm,pmnorm); Add22(&qh,&ql,rm,rl,rmlMultPh,rmlMultPl); Add233Cond(&fullPolyh,&fullPolym,&fullPolyl,qh,ql,ph,pm,pl); Add12(polyAddOneh,t5,1,fullPolyh); Add12Cond(polyAddOnem,t6,t5,fullPolym); polyAddOnel = t6 + fullPolyl; Mul33(&polyWithTbl1h,&polyWithTbl1m,&polyWithTbl1l,tbl1h,tbl1m,tbl1l,polyAddOneh,polyAddOnem,polyAddOnel); Mul33(&polyWithTablesh,&polyWithTablesm,&polyWithTablesl, tbl2h,tbl2m,tbl2l, polyWithTbl1h,polyWithTbl1m,polyWithTbl1l); Renormalize3(polyTblh,polyTblm,polyTbll,polyWithTablesh,polyWithTablesm,polyWithTablesl); } /************************************************************* ************************************************************* * ROUNDED TO NEAREST * ************************************************************* *************************************************************/ double exp_rn(double x){ double rh, rm, rl, tbl1h, tbl1m, tbl1l; double tbl2h, tbl2m, tbl2l; double xMultLog2InvMult2L, shiftedXMult, kd; double msLog2Div2LMultKh, msLog2Div2LMultKm, msLog2Div2LMultKl; double t1, t2, t3, t4, polyTblh, polyTblm, polyTbll; db_number shiftedXMultdb, twoPowerMdb, xdb, t4db, t4db2, polyTblhdb, resdb; int k, M, index1, index2, xIntHi, mightBeDenorm; double t5, t6, t7, t8, t9, t10, t11, t12, t13; double rhSquare, rhSquareHalf, rhC3, rhFour, monomialCube; double highPoly, highPolyWithSquare, monomialFour; double tablesh, tablesl; double s1, s2, s3, s4, s5; double res; /* Argument reduction and filtering for special cases */ /* Compute k as a double and as an int */ xdb.d = x; xMultLog2InvMult2L = x * log2InvMult2L; shiftedXMult = xMultLog2InvMult2L + shiftConst; kd = shiftedXMult - shiftConst; shiftedXMultdb.d = shiftedXMult; /* Special cases tests */ xIntHi = xdb.i[HI]; mightBeDenorm = 0; /* Test if argument is a denormal or zero */ if ((xIntHi & 0x7ff00000) == 0) { /* We are in the RN case, return 1.0 in all cases */ return 1.0; } /* Test if argument is greater than approx. 709 in magnitude */ if ((xIntHi & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) { /* If we are here, the result might be overflowed, underflowed, inf, or NaN */ /* Test if +/- Inf or NaN */ if ((xIntHi & 0x7fffffff) >= 0x7ff00000) { /* Either NaN or Inf in this case since exponent is maximal */ /* Test if NaN: mantissa is not 0 */ if (((xIntHi & 0x000fffff) | xdb.i[LO]) != 0) { /* x = NaN, return NaN */ return x + x; } else { /* +/- Inf */ /* Test sign */ if ((xIntHi & 0x80000000)==0) /* x = +Inf, return +Inf */ return x; else /* x = -Inf, return 0 */ return 0; } /* End which in NaN, Inf */ } /* End NaN or Inf ? */ /* If we are here, we might be overflowed, denormalized or underflowed in the result but there is no special case (NaN, Inf) left */ /* Test if actually overflowed */ if (x > OVRFLWBOUND) { /* We are actually overflowed in the result */ return LARGEST * LARGEST; } /* Test if surely underflowed */ if (x <= UNDERFLWBOUND) { /* We are actually sure to be underflowed and not denormalized any more So we return 0 and raise the inexact flag */ return SMALLEST * SMALLEST; } /* Test if possibly denormalized */ if (x <= DENORMBOUND) { /* We know now that we are not sure to be normalized in the result We just set an internal flag for a further test */ mightBeDenorm = 1; } } /* End might be a special case */ /* If we are here, we are sure to be neither +/- Inf nor NaN nor overflowed nor denormalized in the argument but we might be denormalized in the result We continue the argument reduction for the quick phase and table reads for both phases */ #if 0 Mul12(&s1,&s2,msLog2Div2Lh,kd); s3 = kd * msLog2Div2Lm; s4 = s2 + s3; s5 = x + s1; Add12Cond(rh,rm,s5,s4); #else /* Cody and Waite like, accurate to 2^-84 */ double Log2h= 0xb.17217f8p-16 ; double Log2l= -0x2.e308654361c4cp-48 ; Add12Cond(rh,rm, x-kd*Log2h, -kd*Log2l); #endif k = shiftedXMultdb.i[LO]; M = k >> L; index1 = k & INDEXMASK1; index2 = (k & INDEXMASK2) >> LHALF; /* Table reads */ tbl1h = twoPowerIndex1[index1].hi; tbl1m = twoPowerIndex1[index1].mi; tbl2h = twoPowerIndex2[index2].hi; tbl2m = twoPowerIndex2[index2].mi; /* Test now if it is sure to launch the quick phase because no denormalized result is possible */ if (mightBeDenorm == 1) { /* The result might be denormalized, we launch the accurate phase in all cases */ /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh,&msLog2Div2LMultKm,&msLog2Div2LMultKl,kd,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1 = x + msLog2Div2LMultKh; Add12Cond(rh,t2,t1,msLog2Div2LMultKm); Add12Cond(rm,rl,t2,msLog2Div2LMultKl); /* Table reads for accurate phase */ tbl1l = twoPowerIndex1[index1].lo; tbl2l = twoPowerIndex2[index2].lo; /* Call accurate phase */ exp_td_accurate(&polyTblh, &polyTblm, &polyTbll, rh, rm, rl, tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l); /* Final rounding and multiplication with 2^M We first multiply the highest significant byte by 2^M in two steps and adjust it then depending on the lower significant parts. We cannot multiply directly by 2^M since M is less than -1022. We first multiply by 2^(-1000) and then by 2^(M+1000). */ t3 = polyTblh * twoPowerM1000; /* Form now twoPowerM with adjusted M */ twoPowerMdb.i[LO] = 0; twoPowerMdb.i[HI] = (M + 2023) << 20; /* Multiply with the rest of M, the result will be denormalized */ t4 = t3 * twoPowerMdb.d; /* For x86, force the compiler to pass through memory for having the right rounding */ t4db.d = t4; /* Do not #if-ify this line, we need the copy */ #if defined(CRLIBM_TYPECPU_AMD64) || defined(CRLIBM_TYPECPU_X86) t4db2.i[HI] = t4db.i[HI]; t4db2.i[LO] = t4db.i[LO]; t4 = t4db2.d; #endif /* Remultiply by 2^(-M) for manipulating the rounding error and the lower significant parts */ M *= -1; twoPowerMdb.i[LO] = 0; twoPowerMdb.i[HI] = (M + 23) << 20; t5 = t4 * twoPowerMdb.d; t6 = t5 * twoPower1000; t7 = polyTblh - t6; /* The rounding decision is made at 1/2 ulp of a denormal, i.e. at 2^(-1075) We construct this number and by comparing with it we get to know whether we are in a difficult rounding case or not. If not we just return the known result. Otherwise we continue with further tests. */ twoPowerMdb.i[LO] = 0; twoPowerMdb.i[HI] = (M - 52) << 20; if (ABS(t7) != twoPowerMdb.d) return t4; /* If we are here, we are in a difficult rounding case */ /* We have to adjust the result iff the sign of the error on rounding 2^M * polyTblh (which must be an ulp of a denormal) and polyTblm +arith polyTbll is the same which means that the error made was greater than an ulp of an denormal. */ polyTblm = polyTblm + polyTbll; if (t7 > 0.0) { if (polyTblm > 0.0) { t4db.l++; return t4db.d; } else return t4; } else { if (polyTblm < 0.0) { t4db.l--; return t4db.d; } else return t4; } } /* End accurate phase launched as there might be a denormalized result */ /* No more underflow nor denormal is possible. There may be the case where M is 1024 and the value 2^M is to be multiplied may be less than 1 So the final result will be normalized and representable by the multiplication must be made in 2 steps */ /* Quick phase starts here */ rhSquare = rh * rh; rhC3 = c3 * rh; rhSquareHalf = 0.5 * rhSquare; monomialCube = rhC3 * rhSquare; rhFour = rhSquare * rhSquare; monomialFour = c4 * rhFour; highPoly = monomialCube + monomialFour; highPolyWithSquare = rhSquareHalf + highPoly; Mul22(&tablesh,&tablesl,tbl1h,tbl1m,tbl2h,tbl2m); t8 = rm + highPolyWithSquare; t9 = rh + t8; t10 = tablesh * t9; Add12(t11,t12,tablesh,t10); t13 = t12 + tablesl; Add12(polyTblh,polyTblm,t11,t13); /* Rounding test Since we know that the result of the final multiplication with 2^M will always be representable, we can do the rounding test on the factors and multiply only the final result. We implement the multiplication in integer computations to overcome the problem of the non-representability of 2^1024 if M = 1024 */ if(polyTblh == (polyTblh + (polyTblm * ROUNDCST))) { polyTblhdb.d = polyTblh; polyTblhdb.i[HI] += M << 20; return polyTblhdb.d; } else { /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh,&msLog2Div2LMultKm,&msLog2Div2LMultKl,kd,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1 = x + msLog2Div2LMultKh; Add12Cond(rh,t2,t1,msLog2Div2LMultKm); Add12Cond(rm,rl,t2,msLog2Div2LMultKl); /* Table reads for accurate phase */ tbl1l = twoPowerIndex1[index1].lo; tbl2l = twoPowerIndex2[index2].lo; /* Call accurate phase */ exp_td_accurate(&polyTblh, &polyTblm, &polyTbll, rh, rm, rl, tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l); /* Since the final multiplication is exact, we can do the final rounding before multiplying We overcome this way also the cases where the final result is not underflowed whereas the lower parts of the intermediate final result are. */ RoundToNearest3(&res,polyTblh,polyTblm,polyTbll); /* Final multiplication with 2^M We implement the multiplication in integer computations to overcome the problem of the non-representability of 2^1024 if M = 1024 */ resdb.d = res; resdb.i[HI] += M << 20; return resdb.d; } /* Accurate phase launched after rounding test*/ } /************************************************************* ************************************************************* * ROUNDED UPWARDS * ************************************************************* *************************************************************/ double exp_ru(double x) { double rh, rm, rl, tbl1h, tbl1m, tbl1l; double tbl2h, tbl2m, tbl2l; double xMultLog2InvMult2L, shiftedXMult, kd; double msLog2Div2LMultKh, msLog2Div2LMultKm, msLog2Div2LMultKl; double t1, t2, t3, t4, polyTblh, polyTblm, polyTbll; db_number shiftedXMultdb, twoPowerMdb, xdb, t4db, t4db2, resdb; int k, M, index1, index2, xIntHi, mightBeDenorm, roundable; double t5, t6, t7, t8, t9, t10, t11, t12, t13; double rhSquare, rhSquareHalf, rhC3, rhFour, monomialCube; double highPoly, highPolyWithSquare, monomialFour; double tablesh, tablesl; double s1, s2, s3, s4, s5; double res; /* Argument reduction and filtering for special cases */ /* Compute k as a double and as an int */ xdb.d = x; xMultLog2InvMult2L = x * log2InvMult2L; shiftedXMult = xMultLog2InvMult2L + shiftConst; kd = shiftedXMult - shiftConst; shiftedXMultdb.d = shiftedXMult; /* Special cases tests */ xIntHi = xdb.i[HI]; mightBeDenorm = 0; /* Test if argument is a denormal or zero */ if ((xIntHi & 0x7ff00000) == 0) { /* If the argument is exactly zero, we just return 1.0 which is the mathematical image of the function */ if (x == 0.0) return 1.0; /* If the argument is a negative denormal, we must return 1.0 and raise the inexact flag. */ if (x < 0.0) return 1.0 + SMALLEST; /* Otherwise, we return 1.0 + 1ulp since exp(greatest denorm) < 1.0 + 1ulp We must do the addition dynamically for raising the inexact flag. */ return 1.0 + twoM52; } /* Test if argument is greater than approx. 709 in magnitude */ if ((xIntHi & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) { /* If we are here, the result might be overflowed, underflowed, inf, or NaN */ /* Test if +/- Inf or NaN */ if ((xIntHi & 0x7fffffff) >= 0x7ff00000) { /* Either NaN or Inf in this case since exponent is maximal */ /* Test if NaN: mantissa is not 0 */ if (((xIntHi & 0x000fffff) | xdb.i[LO]) != 0) { /* x = NaN, return NaN */ return x + x; } else { /* +/- Inf */ /* Test sign */ if ((xIntHi & 0x80000000)==0) /* x = +Inf, return +Inf */ return x; else /* x = -Inf, return 0 (even in RU!) */ return 0; } /* End which in NaN, Inf */ } /* End NaN or Inf ? */ /* If we are here, we might be overflowed, denormalized or underflowed in the result but there is no special case (NaN, Inf) left */ /* Test if actually overflowed */ if (x > OVRFLWBOUND) { /* We are actually overflowed in the result */ return LARGEST * LARGEST; } /* Test if surely underflowed */ if (x <= UNDERFLWBOUND) { /* We are actually sure to be underflowed and not denormalized any more (at least where computing makes sense); since we are in the round upwards case, we return the smallest denormal possible. */ return SMALLEST; } /* Test if possibly denormalized */ if (x <= DENORMBOUND) { /* We know now that we are not sure to be normalized in the result We just set an internal flag for a further test */ mightBeDenorm = 1; } } /* End might be a special case */ /* If we are here, we are sure to be neither +/- Inf nor NaN nor overflowed nor denormalized in the argument but we might be denormalized in the result We continue the argument reduction for the quick phase and table reads for both phases */ #if 0 Mul12(&s1,&s2,msLog2Div2Lh,kd); s3 = kd * msLog2Div2Lm; s4 = s2 + s3; s5 = x + s1; Add12Cond(rh,rm,s5,s4); #else /* Cody and Waite like, accurate to 2^-84 */ double Log2h= 0xb.17217f8p-16 ; double Log2l= -0x2.e308654361c4cp-48 ; Add12Cond(rh,rm, x-kd*Log2h, -kd*Log2l); #endif k = shiftedXMultdb.i[LO]; M = k >> L; index1 = k & INDEXMASK1; index2 = (k & INDEXMASK2) >> LHALF; /* Table reads */ tbl1h = twoPowerIndex1[index1].hi; tbl1m = twoPowerIndex1[index1].mi; tbl2h = twoPowerIndex2[index2].hi; tbl2m = twoPowerIndex2[index2].mi; /* Test now if it is sure to launch the quick phase because no denormalized result is possible */ if (mightBeDenorm == 1) { /* The result might be denormalized, we launch the accurate phase in all cases */ /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh,&msLog2Div2LMultKm,&msLog2Div2LMultKl,kd,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1 = x + msLog2Div2LMultKh; Add12Cond(rh,t2,t1,msLog2Div2LMultKm); Add12Cond(rm,rl,t2,msLog2Div2LMultKl); /* Table reads for accurate phase */ tbl1l = twoPowerIndex1[index1].lo; tbl2l = twoPowerIndex2[index2].lo; /* Call accurate phase */ exp_td_accurate(&polyTblh, &polyTblm, &polyTbll, rh, rm, rl, tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l); /* Final rounding and multiplication with 2^M We first multiply the highest significant byte by 2^M in two steps and adjust it then depending on the lower significant parts. We cannot multiply directly by 2^M since M is less than -1022. We first multiply by 2^(-1000) and then by 2^(M+1000). */ t3 = polyTblh * twoPowerM1000; /* Form now twoPowerM with adjusted M */ twoPowerMdb.i[LO] = 0; twoPowerMdb.i[HI] = (M + 2023) << 20; /* Multiply with the rest of M, the result will be denormalized */ t4 = t3 * twoPowerMdb.d; /* For x86, force the compiler to pass through memory for having the right rounding */ t4db.d = t4; /* Do not #if-ify this line, we need the copy */ #if defined(CRLIBM_TYPECPU_AMD64) || defined(CRLIBM_TYPECPU_X86) t4db2.i[HI] = t4db.i[HI]; t4db2.i[LO] = t4db.i[LO]; t4 = t4db2.d; #endif /* Remultiply by 2^(-M) for manipulating the rounding error and the lower significant parts */ M *= -1; twoPowerMdb.i[LO] = 0; twoPowerMdb.i[HI] = (M + 23) << 20; t5 = t4 * twoPowerMdb.d; t6 = t5 * twoPower1000; t7 = polyTblh - t6; /* The rounding can be decided using the sign of the arithmetical sum of the round-to-nearest-error (i.e. t7) and the lower part(s) of the final result. We add first the lower parts and add the result to the error in t7. We have to keep in mind that everything is scaled by 2^(-M). t8 can never be exactly 0 since we filter out the cases where the image of the function is algebraic and the implementation is exacter than the TMD worst case. */ polyTblm = polyTblm + polyTbll; t8 = t7 + polyTblm; /* Since we are rounding upwards, the round-to-nearest-rounding result in t4 is equal to the final result if the rounding error (i.e. the error plus the lower parts) is negative, i.e. if the rounding-to-nearest was upwards. */ if (t8 < 0.0) return t4; /* If we are here, we must adjust the final result by +1ulp Relying on the fact that the exponential is always positive, we can simplify this adjustment */ t4db.l++; return t4db.d; } /* End accurate phase launched as there might be a denormalized result */ /* No more underflow nor denormal is possible. There may be the case where M is 1024 and the value 2^M is to be multiplied may be less than 1 So the final result will be normalized and representable by the multiplication must be made in 2 steps */ /* Quick phase starts here */ rhSquare = rh * rh; rhC3 = c3 * rh; rhSquareHalf = 0.5 * rhSquare; monomialCube = rhC3 * rhSquare; rhFour = rhSquare * rhSquare; monomialFour = c4 * rhFour; highPoly = monomialCube + monomialFour; highPolyWithSquare = rhSquareHalf + highPoly; Mul22(&tablesh,&tablesl,tbl1h,tbl1m,tbl2h,tbl2m); t8 = rm + highPolyWithSquare; t9 = rh + t8; t10 = tablesh * t9; Add12(t11,t12,tablesh,t10); t13 = t12 + tablesl; Add12(polyTblh,polyTblm,t11,t13); /* Rounding test Since we know that the result of the final multiplication with 2^M will always be representable, we can do the rounding test on the factors and multiply only the final result. We implement the multiplication in integer computations to overcome the problem of the non-representability of 2^1024 if M = 1024 */ TEST_AND_COPY_RU(roundable,res,polyTblh,polyTblm,RDROUNDCST); if (roundable) { resdb.d = res; resdb.i[HI] += M << 20; return resdb.d; } else { /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh,&msLog2Div2LMultKm,&msLog2Div2LMultKl,kd,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1 = x + msLog2Div2LMultKh; Add12Cond(rh,t2,t1,msLog2Div2LMultKm); Add12Cond(rm,rl,t2,msLog2Div2LMultKl); /* Table reads for accurate phase */ tbl1l = twoPowerIndex1[index1].lo; tbl2l = twoPowerIndex2[index2].lo; /* Call accurate phase */ exp_td_accurate(&polyTblh, &polyTblm, &polyTbll, rh, rm, rl, tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l); /* Since the final multiplication is exact, we can do the final rounding before multiplying We overcome this way also the cases where the final result is not underflowed whereas the lower parts of the intermediate final result are. */ RoundUpwards3(&res,polyTblh,polyTblm,polyTbll); /* Final multiplication with 2^M We implement the multiplication in integer computations to overcome the problem of the non-representability of 2^1024 if M = 1024 */ resdb.d = res; resdb.i[HI] += M << 20; return resdb.d; } /* Accurate phase launched after rounding test*/ } /************************************************************* ************************************************************* * ROUNDED DOWNWARDS * ************************************************************* *************************************************************/ double exp_rd(double x) { double rh, rm, rl, tbl1h, tbl1m, tbl1l; double tbl2h, tbl2m, tbl2l; double xMultLog2InvMult2L, shiftedXMult, kd; double msLog2Div2LMultKh, msLog2Div2LMultKm, msLog2Div2LMultKl; double t1, t2, t3, t4, polyTblh, polyTblm, polyTbll; db_number shiftedXMultdb, twoPowerMdb, xdb, t4db, t4db2, resdb; int k, M, index1, index2, xIntHi, mightBeDenorm, roundable; double t5, t6, t7, t8, t9, t10, t11, t12, t13; double rhSquare, rhSquareHalf, rhC3, rhFour, monomialCube; double highPoly, highPolyWithSquare, monomialFour; double tablesh, tablesl; double s1, s2, s3, s4, s5; double res; /* Argument reduction and filtering for special cases */ /* Compute k as a double and as an int */ xdb.d = x; xMultLog2InvMult2L = x * log2InvMult2L; shiftedXMult = xMultLog2InvMult2L + shiftConst; kd = shiftedXMult - shiftConst; shiftedXMultdb.d = shiftedXMult; /* Special cases tests */ xIntHi = xdb.i[HI]; mightBeDenorm = 0; /* Test if argument is a denormal or zero */ if ((xIntHi & 0x7ff00000) == 0) { /* If the argument is exactly zero, we just return 1.0 which is the mathematical image of the function */ if (x == 0.0) return 1.0; /* If the argument is a positive denormal, we must return 1.0 and raise the inexact flag. */ if (x > 0.0) return 1.0 + SMALLEST; /* Otherwise, we return 1.0 - 1ulp since exp(-greatest denorm) > 1.0 - 1ulp We must do the addition dynamically for raising the inexact flag. */ return 1.0 + mTwoM53; } /* Test if argument is greater than approx. 709 in magnitude */ if ((xIntHi & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) { /* If we are here, the result might be overflowed, underflowed, inf, or NaN */ /* Test if +/- Inf or NaN */ if ((xIntHi & 0x7fffffff) >= 0x7ff00000) { /* Either NaN or Inf in this case since exponent is maximal */ /* Test if NaN: mantissa is not 0 */ if (((xIntHi & 0x000fffff) | xdb.i[LO]) != 0) { /* x = NaN, return NaN */ return x + x; } else { /* +/- Inf */ /* Test sign */ if ((xIntHi & 0x80000000)==0) /* x = +Inf, return +Inf */ return x; else /* x = -Inf, return 0 */ return 0; } /* End which in NaN, Inf */ } /* End NaN or Inf ? */ /* If we are here, we might be overflowed, denormalized or underflowed in the result but there is no special case (NaN, Inf) left */ /* Test if actually overflowed */ if (x > OVRFLWBOUND) { /* We would be overflowed but as we are rounding downwards the nearest number lesser than the exact result is the greatest normal. In any case, we must raise the inexact flag. */ return LARGEST * (1.0 + SMALLEST); } /* Test if surely underflowed */ if (x <= UNDERFLWBOUND) { /* We are actually sure to be underflowed and not denormalized any more (at least where computing makes sense); since we are in the round upwards case, we return the smallest denormal possible. */ return SMALLEST * SMALLEST; } /* Test if possibly denormalized */ if (x <= DENORMBOUND) { /* We know now that we are not sure to be normalized in the result We just set an internal flag for a further test */ mightBeDenorm = 1; } } /* End might be a special case */ /* If we are here, we are sure to be neither +/- Inf nor NaN nor overflowed nor denormalized in the argument but we might be denormalized in the result We continue the argument reduction for the quick phase and table reads for both phases */ #if 0 Mul12(&s1,&s2,msLog2Div2Lh,kd); s3 = kd * msLog2Div2Lm; s4 = s2 + s3; s5 = x + s1; Add12Cond(rh,rm,s5,s4); #else /* Cody and Waite like, accurate to 2^-84 */ double Log2h= 0xb.17217f8p-16 ; double Log2l= -0x2.e308654361c4cp-48 ; Add12Cond(rh,rm, x-kd*Log2h, -kd*Log2l); #endif k = shiftedXMultdb.i[LO]; M = k >> L; index1 = k & INDEXMASK1; index2 = (k & INDEXMASK2) >> LHALF; /* Table reads */ tbl1h = twoPowerIndex1[index1].hi; tbl1m = twoPowerIndex1[index1].mi; tbl2h = twoPowerIndex2[index2].hi; tbl2m = twoPowerIndex2[index2].mi; /* Test now if it is sure to launch the quick phase because no denormalized result is possible */ if (mightBeDenorm == 1) { /* The result might be denormalized, we launch the accurate phase in all cases */ /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh,&msLog2Div2LMultKm,&msLog2Div2LMultKl,kd,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1 = x + msLog2Div2LMultKh; Add12Cond(rh,t2,t1,msLog2Div2LMultKm); Add12Cond(rm,rl,t2,msLog2Div2LMultKl); /* Table reads for accurate phase */ tbl1l = twoPowerIndex1[index1].lo; tbl2l = twoPowerIndex2[index2].lo; /* Call accurate phase */ exp_td_accurate(&polyTblh, &polyTblm, &polyTbll, rh, rm, rl, tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l); /* Final rounding and multiplication with 2^M We first multiply the highest significant byte by 2^M in two steps and adjust it then depending on the lower significant parts. We cannot multiply directly by 2^M since M is less than -1022. We first multiply by 2^(-1000) and then by 2^(M+1000). */ t3 = polyTblh * twoPowerM1000; /* Form now twoPowerM with adjusted M */ twoPowerMdb.i[LO] = 0; twoPowerMdb.i[HI] = (M + 2023) << 20; /* Multiply with the rest of M, the result will be denormalized */ t4 = t3 * twoPowerMdb.d; /* For x86, force the compiler to pass through memory for having the right rounding */ t4db.d = t4; /* Do not #if-ify this line, we need the copy */ #if defined(CRLIBM_TYPECPU_AMD64) || defined(CRLIBM_TYPECPU_X86) t4db2.i[HI] = t4db.i[HI]; t4db2.i[LO] = t4db.i[LO]; t4 = t4db2.d; #endif /* Remultiply by 2^(-M) for manipulating the rounding error and the lower significant parts */ M *= -1; twoPowerMdb.i[LO] = 0; twoPowerMdb.i[HI] = (M + 23) << 20; t5 = t4 * twoPowerMdb.d; t6 = t5 * twoPower1000; t7 = polyTblh - t6; /* The rounding can be decided using the sign of the arithmetical sum of the round-to-nearest-error (i.e. t7) and the lower part(s) of the final result. We add first the lower parts and add the result to the error in t7. We have to keep in mind that everything is scaled by 2^(-M). t8 can never be exactly 0 since we filter out the cases where the image of the function is algebraic and the implementation is exacter than the TMD worst case. */ polyTblm = polyTblm + polyTbll; t8 = t7 + polyTblm; /* Since we are rounding downwards, the round-to-nearest-rounding result in t4 is equal to the final result if the rounding error (i.e. the error plus the lower parts) is positive, i.e. if the rounding-to-nearest was downwards. */ if (t8 > 0.0) return t4; /* If we are here, we must adjust the final result by +1ulp Relying on the fact that the exponential is always positive, we can simplify this adjustment */ t4db.l--; return t4db.d; } /* End accurate phase launched as there might be a denormalized result */ /* No more underflow nor denormal is possible. There may be the case where M is 1024 and the value 2^M is to be multiplied may be less than 1 So the final result will be normalized and representable by the multiplication must be made in 2 steps */ /* Quick phase starts here */ rhSquare = rh * rh; rhC3 = c3 * rh; rhSquareHalf = 0.5 * rhSquare; monomialCube = rhC3 * rhSquare; rhFour = rhSquare * rhSquare; monomialFour = c4 * rhFour; highPoly = monomialCube + monomialFour; highPolyWithSquare = rhSquareHalf + highPoly; Mul22(&tablesh,&tablesl,tbl1h,tbl1m,tbl2h,tbl2m); t8 = rm + highPolyWithSquare; t9 = rh + t8; t10 = tablesh * t9; Add12(t11,t12,tablesh,t10); t13 = t12 + tablesl; Add12(polyTblh,polyTblm,t11,t13); /* Rounding test Since we know that the result of the final multiplication with 2^M will always be representable, we can do the rounding test on the factors and multiply only the final result. We implement the multiplication in integer computations to overcome the problem of the non-representability of 2^1024 if M = 1024 */ TEST_AND_COPY_RD(roundable,res,polyTblh,polyTblm,RDROUNDCST); if (roundable) { resdb.d = res; resdb.i[HI] += M << 20; return resdb.d; } else { /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh,&msLog2Div2LMultKm,&msLog2Div2LMultKl,kd,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1 = x + msLog2Div2LMultKh; Add12Cond(rh,t2,t1,msLog2Div2LMultKm); Add12Cond(rm,rl,t2,msLog2Div2LMultKl); /* Table reads for accurate phase */ tbl1l = twoPowerIndex1[index1].lo; tbl2l = twoPowerIndex2[index2].lo; /* Call accurate phase */ exp_td_accurate(&polyTblh, &polyTblm, &polyTbll, rh, rm, rl, tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l); /* Since the final multiplication is exact, we can do the final rounding before multiplying We overcome this way also the cases where the final result is not underflowed whereas the lower parts of the intermediate final result are. */ RoundDownwards3(&res,polyTblh,polyTblm,polyTbll); /* Final multiplication with 2^M We implement the multiplication in integer computations to overcome the problem of the non-representability of 2^1024 if M = 1024 */ resdb.d = res; resdb.i[HI] += M << 20; return resdb.d; } /* Accurate phase launched after rounding test*/ } #ifdef BUILD_INTERVAL_FUNCTIONS interval j_exp(interval x) { interval res; double x_inf, x_sup; double rh_sup, rm_sup, rl_sup, tbl1h_sup, tbl1m_sup, tbl1l_sup; double tbl2h_sup, tbl2m_sup, tbl2l_sup; double xMultLog2InvMult2L_sup, shiftedXMult_sup, kd_sup; double msLog2Div2LMultKh_sup, msLog2Div2LMultKm_sup, msLog2Div2LMultKl_sup; double t1_sup, t2_sup, polyTblh_sup, polyTblm_sup, polyTbll_sup; db_number shiftedXMultdb_sup, xdb_sup, resdb_sup; int k_sup, M_sup, index1_sup, index2_sup, xIntHi_sup, mightBeDenorm_sup, roundable; double t8_sup, t9_sup, t10_sup, t11_sup, t12_sup, t13_sup; double rhSquare_sup, rhSquareHalf_sup, rhC3_sup, rhFour_sup, monomialCube_sup; double highPoly_sup, highPolyWithSquare_sup, monomialFour_sup; double tablesh_sup, tablesl_sup; double s1_sup, s2_sup, s3_sup, s4_sup, s5_sup; double res_sup; double rh_inf, rm_inf, rl_inf, tbl1h_inf, tbl1m_inf, tbl1l_inf; double tbl2h_inf, tbl2m_inf, tbl2l_inf; double xMultLog2InvMult2L_inf, shiftedXMult_inf, kd_inf; double msLog2Div2LMultKh_inf, msLog2Div2LMultKm_inf, msLog2Div2LMultKl_inf; double t1_inf, t2_inf, polyTblh_inf, polyTblm_inf, polyTbll_inf; db_number shiftedXMultdb_inf, xdb_inf, resdb_inf; int k_inf, M_inf, index1_inf, index2_inf, xIntHi_inf, mightBeDenorm_inf; double t8_inf, t9_inf, t10_inf, t11_inf, t12_inf, t13_inf; double rhSquare_inf, rhSquareHalf_inf, rhC3_inf, rhFour_inf, monomialCube_inf; double highPoly_inf, highPolyWithSquare_inf, monomialFour_inf; double tablesh_inf, tablesl_inf; double s1_inf, s2_inf, s3_inf, s4_inf, s5_inf; double res_inf; double res_simple_inf, res_simple_sup; int infDone=0; int supDone=0; x_inf=LOW(x); x_sup=UP(x); /* Argument reduction and filtering for special cases */ /* Compute k as a double and as an int */ xdb_sup.d = x_sup; xdb_inf.d = x_inf; xMultLog2InvMult2L_sup = x_sup * log2InvMult2L; xMultLog2InvMult2L_inf = x_inf * log2InvMult2L; shiftedXMult_sup = xMultLog2InvMult2L_sup + shiftConst; shiftedXMult_inf = xMultLog2InvMult2L_inf + shiftConst; kd_sup = shiftedXMult_sup - shiftConst; kd_inf = shiftedXMult_inf - shiftConst; shiftedXMultdb_sup.d = shiftedXMult_sup; shiftedXMultdb_inf.d = shiftedXMult_inf; /* Special cases tests */ xIntHi_sup = xdb_sup.i[HI]; mightBeDenorm_sup = 0; /* Special cases tests */ xIntHi_inf = xdb_inf.i[HI]; mightBeDenorm_inf = 0; if ( __builtin_expect( ((xIntHi_sup & 0x7ff00000) == 0) || (((xIntHi_sup & 0x7ff00000) == 0) && (x_sup == 0.0)) || (((xIntHi_sup & 0x7ff00000) == 0) && (x_sup < 0.0)) || (((xIntHi_sup & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) && ((xIntHi_sup & 0x7fffffff) >= 0x7ff00000)) || (((xIntHi_sup & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) && ((xIntHi_sup & 0x7fffffff) >= 0x7ff00000) && (((xIntHi_sup & 0x000fffff) | xdb_sup.i[LO]) != 0)) || (((xIntHi_sup & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) && ((xIntHi_sup & 0x7fffffff) >= 0x7ff00000) && ((xIntHi_sup & 0x80000000)==0)) || (((xIntHi_sup & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) && (x_sup > OVRFLWBOUND)) || (((xIntHi_sup & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) && (x_sup <= UNDERFLWBOUND)) || (((xIntHi_sup & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) && (x_sup <= DENORMBOUND)) || ((xIntHi_inf & 0x7ff00000) == 0) || (((xIntHi_inf & 0x7ff00000) == 0) && (x_inf == 0.0)) || (((xIntHi_inf & 0x7ff00000) == 0) && (x_inf > 0.0)) || (((xIntHi_inf & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) && ((xIntHi_inf & 0x7fffffff) >= 0x7ff00000)) || (((xIntHi_inf & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) && ((xIntHi_inf & 0x7fffffff) >= 0x7ff00000) && (((xIntHi_inf & 0x000fffff) | xdb_inf.i[LO]) != 0)) || (((xIntHi_inf & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) && ((xIntHi_inf & 0x7fffffff) >= 0x7ff00000) && ((xIntHi_inf & 0x80000000)==0)) || (((xIntHi_inf & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) && (x_inf > OVRFLWBOUND)) || (((xIntHi_inf & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) && (x_inf <= UNDERFLWBOUND)) || (((xIntHi_inf & 0x7fffffff) >= OVRUDRFLWSMPLBOUND) && (x_inf <= DENORMBOUND)) ,FALSE)) { ASSIGN_LOW(res,exp_rd(LOW(x))); ASSIGN_UP(res,exp_ru(UP(x))); return res; } /* Test if argument is a denormal or zero */ /* If we are here, we are sure to be neither +/- Inf nor NaN nor overflowed nor denormalized in the argument but we might be denormalized in the result We continue the argument reduction for the quick phase and table reads for both phases */ Mul12(&s1_sup,&s2_sup,msLog2Div2Lh,kd_sup); Mul12(&s1_inf,&s2_inf,msLog2Div2Lh,kd_inf); s3_sup = kd_sup * msLog2Div2Lm; s3_inf = kd_inf * msLog2Div2Lm; s4_sup = s2_sup + s3_sup; s4_inf = s2_inf + s3_inf; s5_sup = x_sup + s1_sup; s5_inf = x_inf + s1_inf; Add12Cond(rh_sup,rm_sup,s5_sup,s4_sup); Add12Cond(rh_inf,rm_inf,s5_inf,s4_inf); k_sup = shiftedXMultdb_sup.i[LO]; k_inf = shiftedXMultdb_inf.i[LO]; M_sup = k_sup >> L; M_inf = k_inf >> L; index1_sup = k_sup & INDEXMASK1; index1_inf = k_inf & INDEXMASK1; index2_sup = (k_sup & INDEXMASK2) >> LHALF; index2_inf = (k_inf & INDEXMASK2) >> LHALF; /* Table reads */ tbl1h_sup = twoPowerIndex1[index1_sup].hi; tbl1h_inf = twoPowerIndex1[index1_inf].hi; tbl1m_sup = twoPowerIndex1[index1_sup].mi; tbl1m_inf = twoPowerIndex1[index1_inf].mi; tbl2h_sup = twoPowerIndex2[index2_sup].hi; tbl2h_inf = twoPowerIndex2[index2_inf].hi; tbl2m_sup = twoPowerIndex2[index2_sup].mi; tbl2m_inf = twoPowerIndex2[index2_inf].mi; /* No more underflow nor denormal is possible. There may be the case where M is 1024 and the value 2^M is to be multiplied may be less than 1 So the final result will be normalized and representable by the multiplication must be made in 2 steps */ /* Quick phase starts here */ rhSquare_sup = rh_sup * rh_sup; rhSquare_inf = rh_inf * rh_inf; rhC3_sup = c3 * rh_sup; rhC3_inf = c3 * rh_inf; rhSquareHalf_sup = 0.5 * rhSquare_sup; rhSquareHalf_inf = 0.5 * rhSquare_inf; monomialCube_sup = rhC3_sup * rhSquare_sup; monomialCube_inf = rhC3_inf * rhSquare_inf; rhFour_sup = rhSquare_sup * rhSquare_sup; rhFour_inf = rhSquare_inf * rhSquare_inf; monomialFour_sup = c4 * rhFour_sup; monomialFour_inf = c4 * rhFour_inf; highPoly_sup = monomialCube_sup + monomialFour_sup; highPoly_inf = monomialCube_inf + monomialFour_inf; highPolyWithSquare_sup = rhSquareHalf_sup + highPoly_sup; highPolyWithSquare_inf = rhSquareHalf_inf + highPoly_inf; Mul22(&tablesh_sup,&tablesl_sup,tbl1h_sup,tbl1m_sup,tbl2h_sup,tbl2m_sup); Mul22(&tablesh_inf,&tablesl_inf,tbl1h_inf,tbl1m_inf,tbl2h_inf,tbl2m_inf); t8_sup = rm_sup + highPolyWithSquare_sup; t8_inf = rm_inf + highPolyWithSquare_inf; t9_sup = rh_sup + t8_sup; t9_inf = rh_inf + t8_inf; t10_sup = tablesh_sup * t9_sup; t10_inf = tablesh_inf * t9_inf; Add12(t11_sup,t12_sup,tablesh_sup,t10_sup); Add12(t11_inf,t12_inf,tablesh_inf,t10_inf); t13_sup = t12_sup + tablesl_sup; t13_inf = t12_inf + tablesl_inf; Add12(polyTblh_sup,polyTblm_sup,t11_sup,t13_sup); Add12(polyTblh_inf,polyTblm_inf,t11_inf,t13_inf); /* Rounding test Since we know that the result of the final multiplication with 2^M will always be representable, we can do the rounding test on the factors and multiply only the final result. We implement the multiplication in integer computations to overcome the problem of the non-representability of 2^1024 if M = 1024 */ if (infDone==1) res_inf=res_simple_inf; if (supDone==1) res_sup=res_simple_sup; // TEST_AND_COPY_RDRU_EXP(roundable,infDone,supDone,res_inf,polyTblh_inf,polyTblm_inf,res_sup,polyTblh_sup,polyTblm_sup,RDROUNDCST); db_number yh_inf, yl_inf, u53_inf, yh_sup, yl_sup, u53_sup; int yh_inf_neg, yl_inf_neg, yh_sup_neg, yl_sup_neg; int rd_ok, ru_ok; double save_res_inf=res_inf; double save_res_sup=res_sup; yh_inf.d = polyTblh_inf; yl_inf.d = polyTblm_inf; yh_inf_neg = (yh_inf.i[HI] & 0x80000000); yl_inf_neg = (yl_inf.i[HI] & 0x80000000); yh_inf.l = yh_inf.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ yl_inf.l = yl_inf.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ u53_inf.l = (yh_inf.l & ULL(7ff0000000000000)) + ULL(0010000000000000); yh_sup.d = polyTblh_sup; yl_sup.d = polyTblm_sup; yh_sup_neg = (yh_sup.i[HI] & 0x80000000); yl_sup_neg = (yl_sup.i[HI] & 0x80000000); yh_sup.l = yh_sup.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ yl_sup.l = yl_sup.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ u53_sup.l = (yh_sup.l & ULL(7ff0000000000000)) + ULL(0010000000000000); roundable = 0; rd_ok=(yl_inf.d > RDROUNDCST * u53_inf.d); ru_ok=(yl_sup.d > RDROUNDCST * u53_sup.d); if(yl_inf_neg) { /* The case yl==0 is filtered by the above test*/ /* return next down */ yh_inf.d = polyTblh_inf; if(yh_inf_neg) yh_inf.l++; else yh_inf.l--; /* Beware: fails for zero */ res_inf = yh_inf.d; } else { res_inf = polyTblh_inf; } if(!yl_sup_neg) { /* The case yl==0 is filtered by the above test*/ /* return next up */ yh_sup.d = polyTblh_sup; if(yh_sup_neg) yh_sup.l--; else yh_sup.l++; /* Beware: fails for zero */ res_sup = yh_sup.d; } else { res_sup = polyTblh_sup; } if(infDone) res_inf=save_res_inf; if(supDone) res_sup=save_res_sup; if(rd_ok && ru_ok){ roundable=3; } else if (rd_ok){ roundable=1; } else if (ru_ok){ roundable=2; } resdb_inf.d = res_inf; resdb_sup.d = res_sup; if (roundable==3) { if (infDone==0){ resdb_inf.i[HI] += M_inf << 20; } ASSIGN_LOW(res,resdb_inf.d); if (supDone==0){ resdb_sup.i[HI] += M_sup << 20; } ASSIGN_UP(res,resdb_sup.d); return res; } if(roundable==1) { if(infDone==0){ resdb_inf.i[HI] += M_inf << 20; } ASSIGN_LOW(res,resdb_inf.d); if(supDone==0){ /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh_sup,&msLog2Div2LMultKm_sup,&msLog2Div2LMultKl_sup,kd_sup,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1_sup = x_sup + msLog2Div2LMultKh_sup; Add12Cond(rh_sup,t2_sup,t1_sup,msLog2Div2LMultKm_sup); Add12Cond(rm_sup,rl_sup,t2_sup,msLog2Div2LMultKl_sup); /* Table reads for accurate phase */ tbl1l_sup = twoPowerIndex1[index1_sup].lo; tbl2l_sup = twoPowerIndex2[index2_sup].lo; /* Call accurate phase */ exp_td_accurate(&polyTblh_sup, &polyTblm_sup, &polyTbll_sup, rh_sup, rm_sup, rl_sup, tbl1h_sup, tbl1m_sup, tbl1l_sup, tbl2h_sup, tbl2m_sup, tbl2l_sup); /* Since the final multiplication is exact, we can do the final rounding before multiplying We overcome this way also the cases where the final result is not underflowed whereas the lower parts of the intermediate final result are. */ RoundUpwards3(&res_sup,polyTblh_sup,polyTblm_sup,polyTbll_sup); /* Final multiplication with 2^M We implement the multiplication in integer computations to overcome the problem of the non-representability of 2^1024 if M = 1024 */ resdb_sup.d = res_sup; resdb_sup.i[HI] += M_sup << 20; } ASSIGN_UP(res,resdb_sup.d); return res; } /* Accurate phase launched after rounding test*/ if (roundable==2) { if (infDone==0){ /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh_inf,&msLog2Div2LMultKm_inf,&msLog2Div2LMultKl_inf,kd_inf,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1_inf = x_inf + msLog2Div2LMultKh_inf; Add12Cond(rh_inf,t2_inf,t1_inf,msLog2Div2LMultKm_inf); Add12Cond(rm_inf,rl_inf,t2_inf,msLog2Div2LMultKl_inf); /* Table reads for accurate phase */ tbl1l_inf = twoPowerIndex1[index1_inf].lo; tbl2l_inf = twoPowerIndex2[index2_inf].lo; /* Call accurate phase */ exp_td_accurate(&polyTblh_inf, &polyTblm_inf, &polyTbll_inf, rh_inf, rm_inf, rl_inf, tbl1h_inf, tbl1m_inf, tbl1l_inf, tbl2h_inf, tbl2m_inf, tbl2l_inf); /* Since the final multiplication is exact, we can do the final rounding before multiplying We overcome this way also the cases where the final result is not underflowed whereas the lower parts of the intermediate final result are. */ RoundDownwards3(&res_inf,polyTblh_inf,polyTblm_inf,polyTbll_inf); /* Final multiplication with 2^M We implement the multiplication in integer computations to overcome the problem of the non-representability of 2^1024 if M = 1024 */ resdb_inf.d = res_inf; resdb_inf.i[HI] += M_inf << 20; } ASSIGN_LOW(res,resdb_inf.d); if(supDone==0){ resdb_sup.i[HI] += M_sup << 20; } ASSIGN_UP(res,resdb_sup.d); return res; } /* Accurate phase launched after rounding test*/ if(roundable==0) { if(supDone==0){ /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh_sup,&msLog2Div2LMultKm_sup,&msLog2Div2LMultKl_sup,kd_sup,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1_sup = x_sup + msLog2Div2LMultKh_sup; Add12Cond(rh_sup,t2_sup,t1_sup,msLog2Div2LMultKm_sup); Add12Cond(rm_sup,rl_sup,t2_sup,msLog2Div2LMultKl_sup); /* Table reads for accurate phase */ tbl1l_sup = twoPowerIndex1[index1_sup].lo; tbl2l_sup = twoPowerIndex2[index2_sup].lo; /* Call accurate phase */ exp_td_accurate(&polyTblh_sup, &polyTblm_sup, &polyTbll_sup, rh_sup, rm_sup, rl_sup, tbl1h_sup, tbl1m_sup, tbl1l_sup, tbl2h_sup, tbl2m_sup, tbl2l_sup); /* Since the final multiplication is exact, we can do the final rounding before multiplying We overcome this way also the cases where the final result is not underflowed whereas the lower parts of the intermediate final result are. */ RoundUpwards3(&res_sup,polyTblh_sup,polyTblm_sup,polyTbll_sup); /* Final multiplication with 2^M We implement the multiplication in integer computations to overcome the problem of the non-representability of 2^1024 if M = 1024 */ resdb_sup.d = res_sup; resdb_sup.i[HI] += M_sup << 20; } ASSIGN_UP(res,resdb_sup.d); if (infDone==0){ /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh_inf,&msLog2Div2LMultKm_inf,&msLog2Div2LMultKl_inf,kd_inf,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1_inf = x_inf + msLog2Div2LMultKh_inf; Add12Cond(rh_inf,t2_inf,t1_inf,msLog2Div2LMultKm_inf); Add12Cond(rm_inf,rl_inf,t2_inf,msLog2Div2LMultKl_inf); /* Table reads for accurate phase */ tbl1l_inf = twoPowerIndex1[index1_inf].lo; tbl2l_inf = twoPowerIndex2[index2_inf].lo; /* Call accurate phase */ exp_td_accurate(&polyTblh_inf, &polyTblm_inf, &polyTbll_inf, rh_inf, rm_inf, rl_inf, tbl1h_inf, tbl1m_inf, tbl1l_inf, tbl2h_inf, tbl2m_inf, tbl2l_inf); /* Since the final multiplication is exact, we can do the final rounding before multiplying We overcome this way also the cases where the final result is not underflowed whereas the lower parts of the intermediate final result are. */ RoundDownwards3(&res_inf,polyTblh_inf,polyTblm_inf,polyTbll_inf); /* Final multiplication with 2^M We implement the multiplication in integer computations to overcome the problem of the non-representability of 2^1024 if M = 1024 */ resdb_inf.d = res_inf; resdb_inf.i[HI] += M_inf << 20; } ASSIGN_LOW(res,resdb_inf.d); return res; } /* Accurate phase launched after rounding test*/ return res; } #endif interval-2.1.0/src/crlibm/exp-td.h0000644000000000000000000011303113031036767015102 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" /*File generated by maple/exp-td.mpl*/ #define L 12 #define LHALF 6 #define log2InvMult2L 5.90927888748119403317105025053024291992187500000000e+03 #define msLog2Div2Lh -1.69225385878892892145206050535932718048570677638054e-04 #define msLog2Div2Lm -5.66173538536694228129338642508144915789549786200850e-21 #define msLog2Div2Ll -1.39348350547270802387134479195513221596886344528448e-37 #define shiftConst 6.75539944105574400000000000000000000000000000000000e+15 #define INDEXMASK1 0x0000003f #define INDEXMASK2 0x00000fc0 #define OVRUDRFLWSMPLBOUND 0x4086232b #define OVRFLWBOUND 7.09782712893383973096206318587064743041992187500000e+02 #define LARGEST 1.79769313486231570814527423731704356798070567525845e+308 #define SMALLEST 4.94065645841246544176568792868221372365059802614325e-324 #define DENORMBOUND -7.08396418532264078748994506895542144775390625000000e+02 #define UNDERFLWBOUND -7.45133219101941222106688655912876129150390625000000e+02 #define twoPowerM1000 9.33263618503218878990089544723817169617091446371708e-302 #define twoPower1000 1.07150860718626732094842504906000181056140481170553e+301 #define ROUNDCST 1.00097751710654947574476244840271277078237100388308e+00 #define RDROUNDCST 5.42101086242752217003726400434970855712890625000000e-20 #define twoM52 2.22044604925031308084726333618164062500000000000000e-16 #define mTwoM53 -1.11022302462515654042363166809082031250000000000000e-16 #define c3 1.66666666696497128841158996692684013396501541137695e-01 #define c4 4.16666666766101478902584176466916687786579132080078e-02 #define accPolyC3h 1.66666666666666657414808128123695496469736099243164e-01 #define accPolyC3l 9.25185853854303382711778796549658869198239876296876e-18 #define accPolyC4h 4.16666666666666643537020320309238741174340248107910e-02 #define accPolyC4l 2.31256737763466047834406500740034679807274635559840e-18 #define accPolyC5 8.33333333333333321768510160154619370587170124053955e-03 #define accPolyC6 1.38888888911084160647513296993338371976278722286224e-03 #define accPolyC7 1.98412698447204637443655461659375305316643789410591e-04 typedef struct tPi_t_tag {double hi; double mi; double lo;} tPi_t; static const tPi_t twoPowerIndex1[64] = { { 1.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex1hi[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex1mi[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex1lo[0] */ } , { 1.00016923970530213772178740327944979071617126464844e+00, /* twoPowerIndex1hi[1] */ 9.33618533547846199388179470637929281332443150415515e-17, /* twoPowerIndex1mi[1] */ 3.77297954885090084710073756456287936644477196404411e-33, /* twoPowerIndex1lo[1] */ } , { 1.00033850805268231809463941317517310380935668945312e+00, /* twoPowerIndex1hi[2] */ -5.14133393131895706530678267769194263660821897510018e-18, /* twoPowerIndex1mi[2] */ 3.65532984508913994275805274025238001612209382982528e-34, /* twoPowerIndex1lo[2] */ } , { 1.00050780504698755279946453811135143041610717773438e+00, /* twoPowerIndex1hi[3] */ 6.96242402202057255168575283120383384543281723609229e-17, /* twoPowerIndex1mi[3] */ 5.20646484360987194687938744912769762301408608274186e-34, /* twoPowerIndex1lo[3] */ } , { 1.00067713069306640782940576173132285475730895996094e+00, /* twoPowerIndex1hi[4] */ -5.11512329768566763581175858027414623025077801052578e-17, /* twoPowerIndex1mi[4] */ 6.98198098827029289611306311409722598417652045670746e-34, /* twoPowerIndex1lo[4] */ } , { 1.00084648499576744917760606767842546105384826660156e+00, /* twoPowerIndex1hi[5] */ 8.42299002458648658027371639395540881533737558365359e-17, /* twoPowerIndex1mi[5] */ 2.36970468083963275494383447607242933566525306383712e-33, /* twoPowerIndex1lo[5] */ } , { 1.00101586795994101919404783984646201133728027343750e+00, /* twoPowerIndex1hi[6] */ -2.82452207477616780689379931990767172214919031737312e-17, /* twoPowerIndex1mi[6] */ -1.95728551891328398835983018867545661396300096090192e-33, /* twoPowerIndex1lo[6] */ } , { 1.00118527959043746022871346212923526763916015625000e+00, /* twoPowerIndex1hi[7] */ -7.18042456559213166577815896739695813826899291527385e-17, /* twoPowerIndex1mi[7] */ -4.76259460142737667571053552520587169925041399888400e-33, /* twoPowerIndex1lo[7] */ } , { 1.00135471989210822485460994357708841562271118164062e+00, /* twoPowerIndex1hi[8] */ -1.89737284167929933536294189134998232481318340155287e-17, /* twoPowerIndex1mi[8] */ -1.14644761608474571162584330231223616391499645510675e-34, /* twoPowerIndex1lo[8] */ } , { 1.00152418886980565382316399336559697985649108886719e+00, /* twoPowerIndex1hi[9] */ 9.06044106726912172835402556659442028244667434824268e-17, /* twoPowerIndex1mi[9] */ -9.28795936877474030548429956901821606468166518236870e-34, /* twoPowerIndex1lo[9] */ } , { 1.00169368652838319810882694582687690854072570800781e+00, /* twoPowerIndex1hi[10] */ -7.17327634990031997530849131951948428542423257707819e-17, /* twoPowerIndex1mi[10] */ 6.07647560689104755979568262152596670382288431776872e-33, /* twoPowerIndex1lo[10] */ } , { 1.00186321287269430868605013529304414987564086914062e+00, /* twoPowerIndex1hi[11] */ -1.33071962467226606689858482393149015112554043251841e-17, /* twoPowerIndex1mi[11] */ -3.85443386097781554341108465500150047004226523597749e-34, /* twoPowerIndex1lo[11] */ } , { 1.00203276790759399084151937131537124514579772949219e+00, /* twoPowerIndex1hi[12] */ 2.57269259432211179649018725316354562817431777421067e-17, /* twoPowerIndex1mi[12] */ 6.79751255613789265201334995370535043187556454092516e-34, /* twoPowerIndex1lo[12] */ } , { 1.00220235163793791599573523853905498981475830078125e+00, /* twoPowerIndex1hi[13] */ -3.92993778548451720552933864302152846562830407163222e-17, /* twoPowerIndex1mi[13] */ 2.22740945016647607963332576015739728975193247400334e-33, /* twoPowerIndex1lo[13] */ } , { 1.00237196406858219965840817167190834879875183105469e+00, /* twoPowerIndex1hi[14] */ 8.46137724799471749932697856411684097253648908880386e-17, /* twoPowerIndex1mi[14] */ -1.15795350476069740873680647805085951983720786847012e-33, /* twoPowerIndex1lo[14] */ } , { 1.00254160520438451165148308064090088009834289550781e+00, /* twoPowerIndex1hi[15] */ -4.19488324163994025318330321149973224973566383682287e-17, /* twoPowerIndex1mi[15] */ -1.10867727371575753136248480661711257993643946476249e-33, /* twoPowerIndex1lo[15] */ } , { 1.00271127505020252179690487537300214171409606933594e+00, /* twoPowerIndex1hi[16] */ -3.63661592869226394431650732319448247819940912156384e-17, /* twoPowerIndex1mi[16] */ -6.58076018413558386665763067745208065096307047224855e-34, /* twoPowerIndex1lo[16] */ } , { 1.00288097361089523218424801598303020000457763671875e+00, /* twoPowerIndex1hi[17] */ -2.61094406324393831074545742903203024867557691172893e-17, /* twoPowerIndex1mi[17] */ 1.20560913995705683042979390390212408639703633013464e-33, /* twoPowerIndex1lo[17] */ } , { 1.00305070089132231103690173767972737550735473632812e+00, /* twoPowerIndex1hi[18] */ 1.75307847798233211014008193947934807324617806015147e-17, /* twoPowerIndex1mi[18] */ 1.13393213893456062969952574781413432615748154285102e-33, /* twoPowerIndex1lo[18] */ } , { 1.00322045689634431475667497579706832766532897949219e+00, /* twoPowerIndex1hi[19] */ 5.75392352562826744411122442879351687879645730521252e-17, /* twoPowerIndex1mi[19] */ -2.67723202763627633853056570968049475423332897231238e-33, /* twoPowerIndex1lo[19] */ } , { 1.00339024163082268792379636579426005482673645019531e+00, /* twoPowerIndex1hi[20] */ -8.68492200511795617368964392061338881522209699276521e-18, /* twoPowerIndex1mi[20] */ -3.48402050975972235345434529928044249018150775634918e-34, /* twoPowerIndex1lo[20] */ } , { 1.00356005509961931920770439319312572479248046875000e+00, /* twoPowerIndex1hi[21] */ 9.49003543098177759384527648244793376993805358019830e-17, /* twoPowerIndex1mi[21] */ -2.72838479693459377473949067074824993718971708464416e-34, /* twoPowerIndex1lo[21] */ } , { 1.00372989730759765159007201873464509844779968261719e+00, /* twoPowerIndex1hi[22] */ -8.71038060581842237129503222771273097866222639659196e-17, /* twoPowerIndex1mi[22] */ 1.08618280977421918449964280592134822915254002216492e-33, /* twoPowerIndex1lo[22] */ } , { 1.00389976825962090600796727812848985195159912109375e+00, /* twoPowerIndex1hi[23] */ 3.49589169585715450145113080496294928974704413200507e-17, /* twoPowerIndex1mi[23] */ -2.94144759791575889018758341844218078845293410867033e-33, /* twoPowerIndex1lo[23] */ } , { 1.00406966796055407975529760733479633927345275878906e+00, /* twoPowerIndex1hi[24] */ 9.75378754984024099793268477195846557070899843396028e-17, /* twoPowerIndex1mi[24] */ 5.64300142720863839874652371486135387544215443970822e-33, /* twoPowerIndex1lo[24] */ } , { 1.00423959641526283625978521740762516856193542480469e+00, /* twoPowerIndex1hi[25] */ -1.05762211962928569325595987354393790031696252155330e-16, /* twoPowerIndex1mi[25] */ 5.83707943855262433756426258532402998630656838432942e-33, /* twoPowerIndex1lo[25] */ } , { 1.00440955362861283894915231940103694796562194824219e+00, /* twoPowerIndex1hi[26] */ 4.20918873812712592966120368574870018412444102186114e-17, /* twoPowerIndex1mi[26] */ 2.17971061415864797757688538084764343153482363480001e-33, /* twoPowerIndex1lo[26] */ } , { 1.00457953960547174965256544965086504817008972167969e+00, /* twoPowerIndex1hi[27] */ -1.67001668575547876279593068362269006396955075031486e-17, /* twoPowerIndex1mi[27] */ 8.56552273127180632250100064178508499726804497630949e-34, /* twoPowerIndex1lo[27] */ } , { 1.00474955435070723019919114449294283986091613769531e+00, /* twoPowerIndex1hi[28] */ -1.62314635541245143576050143734168865049382925451905e-17, /* twoPowerIndex1mi[28] */ 9.28530603331304279248127378347521992965436217888846e-35, /* twoPowerIndex1lo[28] */ } , { 1.00491959786918805264122056541964411735534667968750e+00, /* twoPowerIndex1hi[29] */ 2.30285392780281171183781407072193459566423534757738e-17, /* twoPowerIndex1mi[29] */ -4.94345170697772961451844215454960159293576885861471e-34, /* twoPowerIndex1lo[29] */ } , { 1.00508967016578387720926457404857501387596130371094e+00, /* twoPowerIndex1hi[30] */ 1.64180469767730323539044065876968510741128671646342e-17, /* twoPowerIndex1mi[30] */ -1.40120338097898451052996285664279342840562084008057e-34, /* twoPowerIndex1lo[30] */ } , { 1.00525977124536503026774880709126591682434082031250e+00, /* twoPowerIndex1hi[31] */ 3.72669843182841367415839881731427710949489409371967e-17, /* twoPowerIndex1mi[31] */ -6.47401139805376556406832921347318553328966160972009e-34, /* twoPowerIndex1lo[31] */ } , { 1.00542990111280272635951860138447955250740051269531e+00, /* twoPowerIndex1hi[32] */ 9.49918653545503175702165599813853704096085691656846e-17, /* twoPowerIndex1mi[32] */ 2.69197614795285565383714012654266434015814803945559e-33, /* twoPowerIndex1lo[32] */ } , { 1.00560005977296929025044391892151907086372375488281e+00, /* twoPowerIndex1hi[33] */ -8.68093131444458156819420437418787120833640771986467e-17, /* twoPowerIndex1mi[33] */ 1.70120132411898592857823454488038166970266621441155e-33, /* twoPowerIndex1lo[33] */ } , { 1.00577024723073704670639472169568762183189392089844e+00, /* twoPowerIndex1hi[34] */ 4.00054749103011688253297776917861866454998331259826e-17, /* twoPowerIndex1mi[34] */ 1.31925963209617013098908877209722537258440391267352e-33, /* twoPowerIndex1lo[34] */ } , { 1.00594046349098009685008037195075303316116333007812e+00, /* twoPowerIndex1hi[35] */ 7.19049911150997399545071999536183023264065701084941e-17, /* twoPowerIndex1mi[35] */ 5.87388840736458866162752231275781178461761843642826e-33, /* twoPowerIndex1lo[35] */ } , { 1.00611070855857298589342008199309930205345153808594e+00, /* twoPowerIndex1hi[36] */ -1.39080686710657830063564897325456873924612265621065e-17, /* twoPowerIndex1mi[36] */ -1.04608842475341479042763417006066485614641577765254e-33, /* twoPowerIndex1lo[36] */ } , { 1.00628098243839092518214783922303467988967895507812e+00, /* twoPowerIndex1hi[37] */ -8.14020864257304964668281784838729787981918541118695e-17, /* twoPowerIndex1mi[37] */ 9.81687621053626949463979101287162593669867055078380e-34, /* twoPowerIndex1lo[37] */ } , { 1.00645128513531001424041733116609975695610046386719e+00, /* twoPowerIndex1hi[38] */ -5.76215104374953424938341851527793234314721266620465e-17, /* twoPowerIndex1mi[38] */ -2.57074696660737495074482007072094547944536206743811e-33, /* twoPowerIndex1lo[38] */ } , { 1.00662161665420724077080194547306746244430541992188e+00, /* twoPowerIndex1hi[39] */ 6.74527847731045679518854873240614524466814727371618e-17, /* twoPowerIndex1mi[39] */ 3.78807035520293397050945635744099720111701312971531e-33, /* twoPowerIndex1lo[39] */ } , { 1.00679197699996070269889969495125114917755126953125e+00, /* twoPowerIndex1hi[40] */ 1.89985572403462958330039110072328316553950667129559e-17, /* twoPowerIndex1mi[40] */ -9.63431595756658515104002497950853752466876076619761e-34, /* twoPowerIndex1lo[40] */ } , { 1.00696236617744894203951844247058033943176269531250e+00, /* twoPowerIndex1hi[41] */ -9.63743003231640715845365699595418727819327585110316e-17, /* twoPowerIndex1mi[41] */ 5.37739172125896523173793245498965828230574349410153e-34, /* twoPowerIndex1lo[41] */ } , { 1.00713278419155116694128082599490880966186523437500e+00, /* twoPowerIndex1hi[42] */ -1.25286544624539788678561179100718466970708089928402e-17, /* twoPowerIndex1mi[42] */ 6.73461401738595970431440883296934068477066941591536e-34, /* twoPowerIndex1lo[42] */ } , { 1.00730323104714791782043903367593884468078613281250e+00, /* twoPowerIndex1hi[43] */ 3.02057888784369419361601396858156577301726732087163e-17, /* twoPowerIndex1mi[43] */ 2.28748779695564659338938424768062274005093770790899e-33, /* twoPowerIndex1lo[43] */ } , { 1.00747370674912040122706002875929698348045349121094e+00, /* twoPowerIndex1hi[44] */ -4.86939425860856490657306074829518805252629724182687e-17, /* twoPowerIndex1mi[44] */ -2.15005825118530979132585793750524459885823808259600e-33, /* twoPowerIndex1lo[44] */ } , { 1.00764421130235026780042062455322593450546264648438e+00, /* twoPowerIndex1hi[45] */ 5.22402993768745316546273304631524097955173932918745e-17, /* twoPowerIndex1mi[45] */ 1.56859855755260687389551771821040360984576895950448e-33, /* twoPowerIndex1lo[45] */ } , { 1.00781474471172072249203210958512499928474426269531e+00, /* twoPowerIndex1hi[46] */ -9.36154355147845590745647945463041972879607082944076e-17, /* twoPowerIndex1mi[46] */ 2.73525232969860711971224663796949142049450209755900e-33, /* twoPowerIndex1lo[46] */ } , { 1.00798530698211497025340577238239347934722900390625e+00, /* twoPowerIndex1hi[47] */ -8.65251323306194956904999437269495581443314540350323e-17, /* twoPowerIndex1mi[47] */ 3.95202635576858744637745517221782298786195221857564e-33, /* twoPowerIndex1lo[47] */ } , { 1.00815589811841754830368245166027918457984924316406e+00, /* twoPowerIndex1hi[48] */ -3.25205875608430806088583499076669170064325943797327e-17, /* twoPowerIndex1mi[48] */ 2.46355206137317856028163445564386882918089954604456e-33, /* twoPowerIndex1lo[48] */ } , { 1.00832651812551388204042268625926226377487182617188e+00, /* twoPowerIndex1hi[49] */ -9.91723226806091428304981281566311898208154515630026e-17, /* twoPowerIndex1mi[49] */ -5.54888559019883709197982155449053331751526019176611e-33, /* twoPowerIndex1lo[49] */ } , { 1.00849716700828984095039686508243903517723083496094e+00, /* twoPowerIndex1hi[50] */ -7.13604740416252276802131825807759910735798752142063e-17, /* twoPowerIndex1mi[50] */ 4.98539917129953776836361552714923793985513981224277e-33, /* twoPowerIndex1lo[50] */ } , { 1.00866784477163240474340000218944624066352844238281e+00, /* twoPowerIndex1hi[51] */ -1.72686837122432199045769102324975071816159176955755e-17, /* twoPowerIndex1mi[51] */ 1.49699250027049460850618457278328039699137666243513e-33, /* twoPowerIndex1lo[51] */ } , { 1.00883855142042944130764681176515296101570129394531e+00, /* twoPowerIndex1hi[52] */ -6.61995469367394011396161169543794432105455894234207e-17, /* twoPowerIndex1mi[52] */ -1.37180394060118324236386341775148249159351409372011e-33, /* twoPowerIndex1lo[52] */ } , { 1.00900928695956926262056185805704444646835327148438e+00, /* twoPowerIndex1hi[53] */ 3.56545690151302037529536411250390721695546928174132e-17, /* twoPowerIndex1mi[53] */ -3.04973969952342772070810129193852120178103073824881e-33, /* twoPowerIndex1lo[53] */ } , { 1.00918005139394151292719925550045445561408996582031e+00, /* twoPowerIndex1hi[54] */ 3.71731001370881785990046067286312459291233468170260e-17, /* twoPowerIndex1mi[54] */ 2.33846700487585833881864340821781209486455210644683e-33, /* twoPowerIndex1lo[54] */ } , { 1.00935084472843628056182296859333291649818420410156e+00, /* twoPowerIndex1hi[55] */ 7.06257240682552768409771521622687712943771198652841e-17, /* twoPowerIndex1mi[55] */ -2.69254581845265407066861039619808678678301305791490e-33, /* twoPowerIndex1lo[55] */ } , { 1.00952166696794476408172158699017018079757690429688e+00, /* twoPowerIndex1hi[56] */ -1.43214123034288192889278157016818203958577074101904e-17, /* twoPowerIndex1mi[56] */ 1.18343254028162625925516501493235924385911429505127e-33, /* twoPowerIndex1lo[56] */ } , { 1.00969251811735860613339355040807276964187622070312e+00, /* twoPowerIndex1hi[57] */ 1.56681880131341096294393603553275561732689802958880e-17, /* twoPowerIndex1mi[57] */ -7.81531085085694011629938080711347719818453468652371e-34, /* twoPowerIndex1lo[57] */ } , { 1.00986339818157078163096684875199571251869201660156e+00, /* twoPowerIndex1hi[58] */ -1.10436957803936884179513517801130489140214758906396e-16, /* twoPowerIndex1mi[58] */ 2.26009746193166539328485913376118607218426838997178e-33, /* twoPowerIndex1lo[58] */ } , { 1.01003430716547448753317439695820212364196777343750e+00, /* twoPowerIndex1hi[59] */ -5.76731742716039801926309676866051407637690838590278e-17, /* twoPowerIndex1mi[59] */ -2.78217177127226696492717790709599913537289113429847e-33, /* twoPowerIndex1lo[59] */ } , { 1.01020524507396425306637866015080362558364868164062e+00, /* twoPowerIndex1hi[60] */ 4.83548497844038273903057565303994337100835235326315e-18, /* twoPowerIndex1mi[60] */ 2.61454310671247390892899439237254056446677108734060e-34, /* twoPowerIndex1lo[60] */ } , { 1.01037621191193527359075687854783609509468078613281e+00, /* twoPowerIndex1hi[61] */ 7.01512128971544209746870624992521939688820868468409e-17, /* twoPowerIndex1mi[61] */ -5.58161827166019262256128049263563333632096890407031e-33, /* twoPowerIndex1lo[61] */ } , { 1.01054720768428363264490599249256774783134460449219e+00, /* twoPowerIndex1hi[62] */ 7.16180287361957384315239192590148379997244337618299e-17, /* twoPowerIndex1mi[62] */ -2.02563561553844543425647289447795720504633264470840e-34, /* twoPowerIndex1lo[62] */ } , { 1.01071823239590607990123771742219105362892150878906e+00, /* twoPowerIndex1hi[63] */ 1.05046591340840499506734116899577087874840087102554e-16, /* twoPowerIndex1mi[63] */ 2.18415845005431430458109722226729544983351542501345e-33, /* twoPowerIndex1lo[63] */ } }; static const tPi_t twoPowerIndex2[64] = { { 1.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex2hi[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex2mi[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex2lo[0] */ } , { 1.01088928605170047525518839393043890595436096191406e+00, /* twoPowerIndex2hi[1] */ -1.52347786033685771762884896542837070154735103108242e-17, /* twoPowerIndex2mi[1] */ -1.20527773363982029579667170059568717373235495431222e-33, /* twoPowerIndex2lo[1] */ } , { 1.02189714865411662714222984504885971546173095703125e+00, /* twoPowerIndex2hi[2] */ 5.10922502897344389358977529484899213711118891193073e-17, /* twoPowerIndex2mi[2] */ 7.88422656496927442160138555121324022911581088833303e-34, /* twoPowerIndex2lo[2] */ } , { 1.03302487902122841489926940994337201118469238281250e+00, /* twoPowerIndex2hi[3] */ 7.60083887402708848935418174694583720224989620170520e-18, /* twoPowerIndex2mi[3] */ 4.17547660336499599627565312970423748685953776150432e-34, /* twoPowerIndex2lo[3] */ } , { 1.04427378242741375480306942336028441786766052246094e+00, /* twoPowerIndex2hi[4] */ 8.55188970553796489217080231819249267647451456689049e-17, /* twoPowerIndex2mi[4] */ -4.33079108057472301914865017639792677602990877842667e-33, /* twoPowerIndex2lo[4] */ } , { 1.05564517836055715704901558638084679841995239257812e+00, /* twoPowerIndex2hi[5] */ 1.75932573877209198413667791203269037000656546957040e-18, /* twoPowerIndex2mi[5] */ -1.30396724977978376996223394717384715710429730879060e-34, /* twoPowerIndex2lo[5] */ } , { 1.06714040067682369716806078940862789750099182128906e+00, /* twoPowerIndex2hi[6] */ -7.89985396684158212226333428391940791349522867645719e-17, /* twoPowerIndex2mi[6] */ 2.48773924323047906697979838020484860096229450391065e-33, /* twoPowerIndex2lo[6] */ } , { 1.07876079775711986030728439800441265106201171875000e+00, /* twoPowerIndex2hi[7] */ -6.65666043605659260344452997720816205593857378631714e-17, /* twoPowerIndex2mi[7] */ -3.65812580131923690564246115619834327696213789275798e-33, /* twoPowerIndex2lo[7] */ } , { 1.09050773266525768967483145388541743159294128417969e+00, /* twoPowerIndex2hi[8] */ -3.04678207981247114696551170541257032193091359539676e-17, /* twoPowerIndex2mi[8] */ 2.01705487848848619150139275849815038703452970938356e-33, /* twoPowerIndex2lo[8] */ } , { 1.10238258330784089089604549371870234608650207519531e+00, /* twoPowerIndex2hi[9] */ 5.26603687157069438656191942579725322612448063343618e-17, /* twoPowerIndex2mi[9] */ 6.45805397536721410708490440561131106837447579889036e-34, /* twoPowerIndex2lo[9] */ } , { 1.11438674259589243220602838846389204263687133789062e+00, /* twoPowerIndex2hi[10] */ 1.04102784568455709549461912557590544266030834754874e-16, /* twoPowerIndex2mi[10] */ 1.47570167344000313963428137759389241586071635800536e-33, /* twoPowerIndex2lo[10] */ } , { 1.12652161860824184813623105583246797323226928710938e+00, /* twoPowerIndex2hi[11] */ 5.16585675879545673703180814711785602957687143067887e-17, /* twoPowerIndex2mi[11] */ -5.65916686170716220063974592097473710424342945964456e-34, /* twoPowerIndex2lo[11] */ } , { 1.13878863475669156457570352358743548393249511718750e+00, /* twoPowerIndex2hi[12] */ 8.91281267602540777782023808215740339330966556723006e-17, /* twoPowerIndex2mi[12] */ -2.00741463283249448727846279877956608996968961458494e-33, /* twoPowerIndex2lo[12] */ } , { 1.15118922995298267331065744656370952725410461425781e+00, /* twoPowerIndex2hi[13] */ 3.25071021886382721197741051783883831627922464835734e-17, /* twoPowerIndex2mi[13] */ 8.89091931637927159755660842958283684863470887791663e-34, /* twoPowerIndex2lo[13] */ } , { 1.16372485877757747552152522985124960541725158691406e+00, /* twoPowerIndex2hi[14] */ 3.82920483692409349872159816102110059722238312159091e-17, /* twoPowerIndex2mi[14] */ 7.19709831987676327409679245188515478735702972651365e-34, /* twoPowerIndex2lo[14] */ } , { 1.17639699165028122074261318630306050181388854980469e+00, /* twoPowerIndex2hi[15] */ 5.55420325421807896276684328889766000203735373777665e-17, /* twoPowerIndex2mi[15] */ -1.48842929343368511961710849782815827921712348302943e-33, /* twoPowerIndex2lo[15] */ } , { 1.18920711500272102689734765590401366353034973144531e+00, /* twoPowerIndex2hi[16] */ 3.98201523146564611098029654755651628169309930562261e-17, /* twoPowerIndex2mi[16] */ 1.14195965688545340101163692105448367710482873511510e-33, /* twoPowerIndex2lo[16] */ } , { 1.20215673145270307564658196497475728392601013183594e+00, /* twoPowerIndex2hi[17] */ 6.64498149925230124489270286991048474954122885069094e-17, /* twoPowerIndex2mi[17] */ -3.85685255336907654452995968372311171004938395576078e-33, /* twoPowerIndex2lo[17] */ } , { 1.21524735998046895524282717815367504954338073730469e+00, /* twoPowerIndex2hi[18] */ -7.71263069268148813091257203929615917892526180720328e-17, /* twoPowerIndex2mi[18] */ 4.71720614288499816545262331753743129502653902881319e-33, /* twoPowerIndex2lo[18] */ } , { 1.22848053610687002468182527081808075308799743652344e+00, /* twoPowerIndex2hi[19] */ -1.89878163130252995311948719658078062677878185721429e-17, /* twoPowerIndex2mi[19] */ 6.18469453652103848424687212656185051850860290411013e-34, /* twoPowerIndex2lo[19] */ } , { 1.24185781207348400201340155035723000764846801757812e+00, /* twoPowerIndex2hi[20] */ 4.65802759183693679122616767654141683800114091774588e-17, /* twoPowerIndex2mi[20] */ -2.31439910378785985764079190411324307370918857557275e-33, /* twoPowerIndex2lo[20] */ } , { 1.25538075702469109629078047873917967081069946289062e+00, /* twoPowerIndex2hi[21] */ -6.71138982129687841852821870522008036246320680675952e-18, /* twoPowerIndex2mi[21] */ -5.76846264325028352862497671463784812858487529613818e-35, /* twoPowerIndex2lo[21] */ } , { 1.26905095719173321988648694969015195965766906738281e+00, /* twoPowerIndex2hi[22] */ 2.66793213134218609522998616502989391061315227839969e-18, /* twoPowerIndex2mi[22] */ -5.01723570938719050333027020376949013774930719140568e-35, /* twoPowerIndex2lo[22] */ } , { 1.28287001607877826359072059858590364456176757812500e+00, /* twoPowerIndex2hi[23] */ 1.71359491824356096814175768900864730928374054987756e-17, /* twoPowerIndex2mi[23] */ 7.25131491282819461838977871983760669047046080773478e-34, /* twoPowerIndex2lo[23] */ } , { 1.29683955465100964055125132290413603186607360839844e+00, /* twoPowerIndex2hi[24] */ 2.53825027948883149592910250791940344234383392801619e-17, /* twoPowerIndex2mi[24] */ 1.68678246461832500334243039646153124282288438904092e-34, /* twoPowerIndex2lo[24] */ } , { 1.31096121152476441373835314152529463171958923339844e+00, /* twoPowerIndex2hi[25] */ -7.18153613551945385697245613605196258733040544776187e-17, /* twoPowerIndex2mi[25] */ -2.12629266743969557140434977160228094057588798528197e-34, /* twoPowerIndex2lo[25] */ } , { 1.32523664315974132321684919588733464479446411132812e+00, /* twoPowerIndex2hi[26] */ -2.85873121003886137327027220806882812126373511580572e-17, /* twoPowerIndex2mi[26] */ 7.62021406397260431456821182703024347950927217409368e-34, /* twoPowerIndex2lo[26] */ } , { 1.33966752405330291608720472140703350305557250976562e+00, /* twoPowerIndex2hi[27] */ 8.92728259483173198426255486589831591472085466011828e-17, /* twoPowerIndex2mi[27] */ -7.69657983531899254540849298389093495155758992415150e-34, /* twoPowerIndex2lo[27] */ } , { 1.35425554693689265128853094211081042885780334472656e+00, /* twoPowerIndex2hi[28] */ 7.70094837980298946162338224151128414915778826123523e-17, /* twoPowerIndex2mi[28] */ -2.24074836437395028882100810844688282941385619430371e-33, /* twoPowerIndex2lo[28] */ } , { 1.36900242297459051599162194179370999336242675781250e+00, /* twoPowerIndex2hi[29] */ 9.59379791911884877255545693637832999511204427845953e-17, /* twoPowerIndex2mi[29] */ -4.88674958784947176959607858061848292445663702071206e-33, /* twoPowerIndex2lo[29] */ } , { 1.38390988196383202257777611521305516362190246582031e+00, /* twoPowerIndex2hi[30] */ -6.77051165879478628715737183479431151106043475381389e-17, /* twoPowerIndex2mi[30] */ 5.25954134785524271676320971772030766300829615286373e-34, /* twoPowerIndex2lo[30] */ } , { 1.39897967253831123635166022722842171788215637207031e+00, /* twoPowerIndex2hi[31] */ -9.61421320905132307233280072508933760749140842467170e-17, /* twoPowerIndex2mi[31] */ 3.97465190077505680357285219692652769985214754647576e-33, /* twoPowerIndex2lo[31] */ } , { 1.41421356237309514547462185873882845044136047363281e+00, /* twoPowerIndex2hi[32] */ -9.66729331345291345105469972976694765012981670542977e-17, /* twoPowerIndex2mi[32] */ 4.13867530869941356271900493210877889450985709540127e-33, /* twoPowerIndex2lo[32] */ } , { 1.42961333839197002326670826732879504561424255371094e+00, /* twoPowerIndex2hi[33] */ -1.20316424890536551791763281075597751007148682598677e-17, /* twoPowerIndex2mi[33] */ 3.96492532243389364766543780399018506300743370884771e-35, /* twoPowerIndex2lo[33] */ } , { 1.44518080697704665027458759141154587268829345703125e+00, /* twoPowerIndex2hi[34] */ -3.02375813499398731939978948265280760393682335269040e-17, /* twoPowerIndex2mi[34] */ -1.77301195820250091791088617662298487007284882395542e-33, /* twoPowerIndex2lo[34] */ } , { 1.46091779418064704465507475106278434395790100097656e+00, /* twoPowerIndex2hi[35] */ -5.60037718607521580013156831807759453639536208267684e-17, /* twoPowerIndex2mi[35] */ -4.80948804890004400970317146361816382779746350931714e-33, /* twoPowerIndex2lo[35] */ } , { 1.47682614593949934622685304930200800299644470214844e+00, /* twoPowerIndex2hi[36] */ -3.48399455689279579579151031868718147769491495422105e-17, /* twoPowerIndex2mi[36] */ -1.21157704523090580028169713170353136148082368354920e-34, /* twoPowerIndex2lo[36] */ } , { 1.49290772829126483500772337720263749361038208007812e+00, /* twoPowerIndex2hi[37] */ 1.41929201542840357707378184476885202767753055101956e-17, /* twoPowerIndex2mi[37] */ 2.77326329344780505247628358108799734324783290873618e-34, /* twoPowerIndex2lo[37] */ } , { 1.50916442759342284141155232646269723773002624511719e+00, /* twoPowerIndex2hi[38] */ -1.01645532775429503910501990740249618370059871055172e-16, /* twoPowerIndex2mi[38] */ 2.04191706967403438352422808603561166583202022922508e-34, /* twoPowerIndex2lo[38] */ } , { 1.52559815074453841710067081294255331158638000488281e+00, /* twoPowerIndex2hi[39] */ -1.10249417123425609363148008789604625195179292613569e-16, /* twoPowerIndex2mi[39] */ -2.99382882637137806007903782085057425945683820190483e-33, /* twoPowerIndex2lo[39] */ } , { 1.54221082540794074411394376511452719569206237792969e+00, /* twoPowerIndex2hi[40] */ 7.94983480969762085616103882937991564856794389991833e-17, /* twoPowerIndex2mi[40] */ -9.15995637410036729585390444224530830478731117122757e-34, /* twoPowerIndex2lo[40] */ } , { 1.55900440023783692922165755589958280324935913085938e+00, /* twoPowerIndex2hi[41] */ 3.78120705335752750188190562589679090842557793649900e-17, /* twoPowerIndex2mi[41] */ 5.94230221045385633407443935898656310894518533675204e-35, /* twoPowerIndex2lo[41] */ } , { 1.57598084510788649659218663146020844578742980957031e+00, /* twoPowerIndex2hi[42] */ -1.01369164712783039807957177429288269249745537889645e-17, /* twoPowerIndex2mi[42] */ 5.43913851556220712785038586461119929989856637311730e-34, /* twoPowerIndex2lo[42] */ } , { 1.59314215134226699888131406623870134353637695312500e+00, /* twoPowerIndex2hi[43] */ -1.00944065423119637216151952902063201612012779755882e-16, /* twoPowerIndex2mi[43] */ 4.60848399034962572477662350836868643017178368092553e-33, /* twoPowerIndex2lo[43] */ } , { 1.61049033194925428347232809755951166152954101562500e+00, /* twoPowerIndex2hi[44] */ 2.47071925697978878522451183466139791436957933053447e-17, /* twoPowerIndex2mi[44] */ 1.06968477888935897586507304780358756526593706030066e-33, /* twoPowerIndex2lo[44] */ } , { 1.62802742185734783397776936908485367894172668457031e+00, /* twoPowerIndex2hi[45] */ -6.71295508470708408629558620522800193343463268850872e-17, /* twoPowerIndex2mi[45] */ 1.86124288813399584090278118171650158752835667500490e-33, /* twoPowerIndex2lo[45] */ } , { 1.64575547815396494577555586147354915738105773925781e+00, /* twoPowerIndex2hi[46] */ -1.01256799136747726037875241569662212149731136230039e-16, /* twoPowerIndex2mi[46] */ -6.73838498803664271467304077725442401461793880458369e-34, /* twoPowerIndex2lo[46] */ } , { 1.66367658032673637613640948984539136290550231933594e+00, /* twoPowerIndex2hi[47] */ 5.89099269671309967045155789620226639428173542900082e-17, /* twoPowerIndex2mi[47] */ 2.37785299276765025315795732233641105960161859663372e-33, /* twoPowerIndex2lo[47] */ } , { 1.68179283050742900407215074665145948529243469238281e+00, /* twoPowerIndex2hi[48] */ 8.19901002058149652012724391042374107310082144797238e-17, /* twoPowerIndex2mi[48] */ 5.10351519472809316392686812760480457926425713861784e-33, /* twoPowerIndex2lo[48] */ } , { 1.70010635371852347752508194389520213007926940917969e+00, /* twoPowerIndex2hi[49] */ -8.02371937039770024588528464451482959960563128920877e-18, /* twoPowerIndex2mi[49] */ 4.50894675051846528463958043437010583905518288996850e-34, /* twoPowerIndex2lo[49] */ } , { 1.71861929812247793414314855908742174506187438964844e+00, /* twoPowerIndex2hi[50] */ -1.85138041826311098821086356969536380719870481925638e-17, /* twoPowerIndex2mi[50] */ 6.41562962530571009881963439719259893730039269925891e-34, /* twoPowerIndex2lo[50] */ } , { 1.73733383527370621735030908894259482622146606445312e+00, /* twoPowerIndex2hi[51] */ 3.16438929929295694659064288262436215220581330791541e-17, /* twoPowerIndex2mi[51] */ 2.46812086524635182684409036079744664142196277491485e-33, /* twoPowerIndex2lo[51] */ } , { 1.75625216037329945351075366488657891750335693359375e+00, /* twoPowerIndex2hi[52] */ 2.96014069544887330703087179323550026749650613893620e-17, /* twoPowerIndex2mi[52] */ 1.23348227448930022362949427574612725745479960698002e-33, /* twoPowerIndex2lo[52] */ } , { 1.77537649252652118825324123463360592722892761230469e+00, /* twoPowerIndex2hi[53] */ 6.42973179655657203395602172161574258202382771355994e-17, /* twoPowerIndex2mi[53] */ -3.05903038196122316059732104267589318807211463677414e-33, /* twoPowerIndex2lo[53] */ } , { 1.79470907500310716820024481421569362282752990722656e+00, /* twoPowerIndex2hi[54] */ 1.82274584279120867697625715862678123206602563412216e-17, /* twoPowerIndex2mi[54] */ 1.42176433874694971095041068746172287320972847635154e-33, /* twoPowerIndex2lo[54] */ } , { 1.81425217550039885594514998956583440303802490234375e+00, /* twoPowerIndex2hi[55] */ -9.96953153892034881983229632097342495877571562964276e-17, /* twoPowerIndex2mi[55] */ -5.86224914377491774994695195482808191103744720514440e-33, /* twoPowerIndex2lo[55] */ } , { 1.83400808640934243065601094713201746344566345214844e+00, /* twoPowerIndex2hi[56] */ 3.28310722424562720351405816760294702167288526703081e-17, /* twoPowerIndex2mi[56] */ -6.42508934795304248095271046696049734574532048424330e-34, /* twoPowerIndex2lo[56] */ } , { 1.85397912508338547077357816306175664067268371582031e+00, /* twoPowerIndex2hi[57] */ 9.76188749072759353840331670682321086158335176176729e-17, /* twoPowerIndex2mi[57] */ 4.61481577205566482307976345637533484680898060020057e-33, /* twoPowerIndex2lo[57] */ } , { 1.87416763411029996255763307999586686491966247558594e+00, /* twoPowerIndex2hi[58] */ -6.12276341300414256163658402373731493255704994623650e-17, /* twoPowerIndex2mi[58] */ 5.28588559402507397372575432425046614667899080733482e-33, /* twoPowerIndex2lo[58] */ } , { 1.89457598158696560730618330126162618398666381835938e+00, /* twoPowerIndex2hi[59] */ 3.40340353521652967060147928999507962708632290832738e-17, /* twoPowerIndex2mi[59] */ 1.72475099549343225430579028439403217279441019556785e-33, /* twoPowerIndex2lo[59] */ } , { 1.91520656139714740007207183225546032190322875976562e+00, /* twoPowerIndex2hi[60] */ -1.06199460561959626376283195555328606320260702029334e-16, /* twoPowerIndex2mi[60] */ -3.05776975679132548538006102719337626149343902119718e-33, /* twoPowerIndex2lo[60] */ } , { 1.93606179349229434727419629780342802405357360839844e+00, /* twoPowerIndex2hi[61] */ 1.03323859606763257447769151803649788699571393339738e-16, /* twoPowerIndex2mi[61] */ 6.05301367682062275405664830597304146844867569493449e-33, /* twoPowerIndex2lo[61] */ } , { 1.95714412417540017941064434126019477844238281250000e+00, /* twoPowerIndex2hi[62] */ 8.96076779103666776760155050762912042076490756639488e-17, /* twoPowerIndex2mi[62] */ -9.63267661361827588458686334472185443533033181828620e-34, /* twoPowerIndex2lo[62] */ } , { 1.97845602638795092786949680885300040245056152343750e+00, /* twoPowerIndex2hi[63] */ 4.03887531092781665749784154795462589642365074083484e-17, /* twoPowerIndex2mi[63] */ 3.58120371667786223934924900740488031476290303118010e-34, /* twoPowerIndex2lo[63] */ } }; interval-2.1.0/src/crlibm/exp_build_coeffs/exp_fast_table.c0000644000000000000000000000532013031036767022155 0ustar 00000000000000#include #include #include /* * This program builds the tables used in the first step of the exponential * Auteur : David Defour in a hurry Date : 15/06/2003 * * build command: gcc -I/usr/local/include/ -L/usr/local/lib/ exp_firststep_table.c -o exp_firststep_table -lgmp -lmpfr */ /* don't forget to check that */ #define LITTLE_ENDIAN #ifdef LITTLE_ENDIAN #define HI(x) *(1+(int*)&x) #define LO(x) *(int*)&x #else #define HI(x) *(int*)&x #define LO(x) *(1+(int*)&x) #endif /* This is the number of bits considered to address the table. It can be changed by the command-line second argument, but should stay to 8 for the exp as distributed */ int PREC=8; #define CC_MPFR(d1, d2, a, res, rest, f, A, B){ \ mpfr_exp(res, a, GMP_RNDN); \ d1 = mpfr_get_d(res, GMP_RNDN);\ mpfr_set_d(rest, d1, GMP_RNDN);\ mpfr_sub(res, res, rest, GMP_RNDN);\ d2 = mpfr_get_d(res, GMP_RNDN); \ fprintf(f,"\t {{{0x%.8x, 0x%.8x}}, {{0x%.8x, 0x%.8x}}}", A(d1), B(d1), A(d2), B(d2));} void compute(FILE *f){ mpfr_t a, b, step, res, rest; double d, d1, d2; int i, end; /* Memory allocation */ mpfr_init2(a, 300); mpfr_init2(b, 300); mpfr_init2(res, 300); mpfr_init2(rest,300); mpfr_init2(step,300); /* Set step to 2^-PREC */ mpfr_set_ui(step, 1, GMP_RNDN); mpfr_div_2ui(step, step, PREC, GMP_RNDN); /* Compute bound of the interval [a, b] */ mpfr_set_ui(res, 2, GMP_RNDN); mpfr_log(a, res, GMP_RNDN); mpfr_div_2ui(a, a, 1, GMP_RNDN); mpfr_mul_2ui(a, a, PREC, GMP_RNDN); mpfr_round(a, a); d = mpfr_get_d(a, GMP_RNDN); mpfr_div_2ui(a, a, PREC, GMP_RNDN); mpfr_neg(a, a, GMP_RNDN); mpfr_set(b, a, GMP_RNDN); end = (2 * d) + 1; /* +1 because this range is centered in 0 and '0' need to be taken into account */ fprintf(f,"static const scs_db_number tab_exp[%d][2] = { \n",end); fprintf(f,"#ifdef WORDS_BIGENDIAN\n"); for(i=0; i<(end-1) ; i++){ CC_MPFR(d1, d2, a, res, rest, f, HI, LO); fprintf(f,", \n"); mpfr_add(a, a, step, GMP_RNDN); } CC_MPFR(d1, d2, a, res, rest, f, HI, LO); fprintf(f,"\n#else \n"); mpfr_set(a, b, GMP_RNDN); for(i=0; i<(end-1) ; i++){ CC_MPFR(d1, d2, a, res, rest, f, LO, HI); fprintf(f,", \n"); mpfr_add(a, a, step, GMP_RNDN); } CC_MPFR(d1, d2, a, res, rest, f, LO, HI); fprintf(f,"\n#endif \n}; \n\n"); mpfr_clear(a); mpfr_clear(b); mpfr_clear(res); mpfr_clear(rest); mpfr_clear(step); } int main (int argc, char *argv[]) { FILE *f; if (argc == 3) PREC = atoi(argv[2]); f = fopen (argv[1], "w"); if (f== NULL){ fprintf(stderr," Cannot open file %s \n", argv[1]); exit(1); } compute(f); fclose(f); return 0; } interval-2.1.0/src/crlibm/expm1-standalone.c0000644000000000000000000000675413031036767017071 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" #include "expm1.h" #define AVOID_FMA 0 extern void expm1_direct_td(double *expm1h, double *expm1m, double *expm1l, double x, double xSqHalfh, double xSqHalfl, double xSqh, double xSql, int expoX); extern void expm1_common_td(double *expm1h, double *expm1m, double *expm1l, double rh, double rm, double rl, double tbl1h, double tbl1m, double tbl1l, double tbl2h, double tbl2m, double tbl2l, int M); /* Function expm1_13 Computes exp(x)-1 with an accuracy of 120 bits (128 for |x| <= 2^(-5)) as (expm1h + expm1m + expm1l) \approx exp(x) - 1 There is no special case handling. |x| is supposed to be greater than 2^(-53) x is supposed to be in the range -37...709 The triple-double exph + expm + expl is non-overlapping. */ void expm1_13(double *expm1h, double *expm1m, double *expm1l, double x) { db_number xdb, shiftedXMultdb; int xIntHi, expoX, k, M, index1, index2; double xSqh, xSql, xSqHalfh, xSqHalfl; double t1, t2; double msLog2Div2LMultKh, msLog2Div2LMultKm, msLog2Div2LMultKl; double xMultLog2InvMult2L, shiftedXMult, kd, rh, rm, rl; double tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l; xdb.d = x; xIntHi = xdb.i[HI] & 0x7fffffff; /* Test if we have |x| <= 1/4-1/2ulp(1/4) for knowing if we use exp(x) or approximate directly */ if (xIntHi < DIRECTINTERVALBOUND) { /* We approximate expm1 directly after a range reduction as follows expm1(x) = (expm1(x/2) + 2) * expm1(x/2) We perform the range reduction in such a way that finally |x| < 1/32 */ /* Extract the exponent of |x| and add 5 (2^5 = 32) */ expoX = ((xIntHi & 0x7ff00000) >> 20) - (1023 - 5); /* If this particularily biased exponent expoX is negative, we are already less than 1/32 */ if (expoX >= 0) { /* If we are here, we must perform range reduction */ /* We multiply x by 2^(-expoX-1) by bit manipulation x cannot be denormalized so there is no danger */ xdb.i[HI] += (-expoX-1) << 20; /* We reassign the new x and maintain xIntHi */ xIntHi = xdb.i[HI] & 0x7fffffff; x = xdb.d; } /* Here, we have always |x| < 1/32 */ /* Double precision evaluation steps and one double-double step */ Mul12(&xSqh,&xSql,x,x); xSqHalfh = 0.5 * xSqh; xSqHalfl = 0.5 * xSql; expm1_direct_td(expm1h, expm1m, expm1l, x, xSqHalfh, xSqHalfl, xSqh, xSql, expoX); } else { /* If we are here, we can use expm1(x) = exp(x) - 1 */ /* Range reduction - exact part: compute k as double and as int */ xMultLog2InvMult2L = x * log2InvMult2L; shiftedXMult = xMultLog2InvMult2L + shiftConst; kd = shiftedXMult - shiftConst; shiftedXMultdb.d = shiftedXMult; k = shiftedXMultdb.i[LO]; M = k >> 12; index1 = k & INDEXMASK1; index2 = (k & INDEXMASK2) >> 6; Mul133(&msLog2Div2LMultKh,&msLog2Div2LMultKm,&msLog2Div2LMultKl,kd,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1 = x + msLog2Div2LMultKh; Add12Cond(rh,t2,t1,msLog2Div2LMultKm); Add12Cond(rm,rl,t2,msLog2Div2LMultKl); tbl1h = twoPowerIndex1[index1].hi; tbl1m = twoPowerIndex1[index1].mi; tbl2h = twoPowerIndex2[index2].hi; tbl2m = twoPowerIndex2[index2].mi; tbl1l = twoPowerIndex1[index1].lo; tbl2l = twoPowerIndex2[index2].lo; expm1_common_td(expm1h, expm1m, expm1l, rh, rm, rl, tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l, M); } } interval-2.1.0/src/crlibm/expm1.c0000644000000000000000000023203613031036767014735 0ustar 00000000000000/* * Correctly rounded expm1 = e^x - 1 * * Author : Christoph Lauter (ENS Lyon) * One bug fix by Florent de Dinechin * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" #include "expm1.h" #ifdef BUILD_INTERVAL_FUNCTIONS #include "interval.h" #endif #define DEBUG 0 void expm1_direct_td(double *expm1h, double *expm1m, double *expm1l, double x, double xSqHalfh, double xSqHalfl, double xSqh, double xSql, int expoX) { double highPoly, tt1h, t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l; double tt6h, tt6m, tt6l, t7h, t7m, t7l, lowPolyh, lowPolym, lowPolyl; double fullHighPolyh, fullHighPolym, fullHighPolyl, polyh, polym, polyl; double xCubeh, xCubem, xCubel, tt7h, tt7m, tt7l, t8h, t8m, t8l; double expm1hover, expm1mover, expm1lover; double r1h, r1m, r1l, r2h, r2m, r2l, r3h, r3m, r3l; double rr1h, rr1m, rr1l, rr2h, rr2m, rr2l, rr3h, rr3m, rr3l; double fullHighPolyhover, fullHighPolymover, fullHighPolylover; /* Double precision evaluation steps */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(accuDirectpolyC15h ,x,accuDirectpolyC14h),x,accuDirectpolyC13h),x, accuDirectpolyC12h),x,accuDirectpolyC11h); #else highPoly = accuDirectpolyC11h + x * (accuDirectpolyC12h + x * (accuDirectpolyC13h + x * ( accuDirectpolyC14h + x * accuDirectpolyC15h))); #endif tt1h = x * highPoly; /* Triple-double steps for x + x^2/2 and x^3*/ Add123(&lowPolyh,&lowPolym,&lowPolyl,x,xSqHalfh,xSqHalfl); /* infty - 52/53 */ Mul123(&xCubeh,&xCubem,&xCubel,x,xSqh,xSql); /* 154 - 47/53 */ /* Double-double evaluation steps */ Add12(t1h,t1l,accuDirectpolyC10h,tt1h); MulAdd212(&t2h,&t2l,accuDirectpolyC9h,accuDirectpolyC9m,x,t1h,t1l); MulAdd212(&t3h,&t3l,accuDirectpolyC8h,accuDirectpolyC8m,x,t2h,t2l); MulAdd212(&t4h,&t4l,accuDirectpolyC7h,accuDirectpolyC7m,x,t3h,t3l); MulAdd212(&t5h,&t5l,accuDirectpolyC6h,accuDirectpolyC6m,x,t4h,t4l); MulAdd212(&t6h,&t6l,accuDirectpolyC5h,accuDirectpolyC5m,x,t5h,t5l); /* Triple-double evaluation steps */ Mul123(&tt6h,&tt6m,&tt6l,x,t6h,t6l); /* 154 - 47/53 */ Add233(&t7h,&t7m,&t7l,accuDirectpolyC4h,accuDirectpolyC4m,tt6h,tt6m,tt6l); /* 150 - 43/53 */ Mul133(&tt7h,&tt7m,&tt7l,x,t7h,t7m,t7l); /* 143 - 38/53 */ Add33(&t8h,&t8m,&t8l,accuDirectpolyC3h,accuDirectpolyC3m,accuDirectpolyC3l,tt7h,tt7m,tt7l); /* 135 - 33/53 */ Mul33(&fullHighPolyhover,&fullHighPolymover,&fullHighPolylover,xCubeh,xCubem,xCubel,t8h,t8m,t8l); /* 130 - 29/53 */ Renormalize3(&fullHighPolyh,&fullHighPolym,&fullHighPolyl, fullHighPolyhover,fullHighPolymover,fullHighPolylover); /* infty - 52/53 */ Add33(&polyh,&polym,&polyl,lowPolyh,lowPolym,lowPolyl,fullHighPolyh,fullHighPolym,fullHighPolyl); /* 149 - 47/53 */ /* Reconstruction steps */ /* If we have not performed any range reduction, we have no reconstruction to do */ if (expoX >= 0) { /* If we are here, we must perform reconstruction */ /* First reconstruction step */ Add133(&r1h,&r1m,&r1l,2,polyh,polym,polyl); Mul33(&rr1h,&rr1m,&rr1l,r1h,r1m,r1l,polyh,polym,polyl); if (expoX >= 1) { /* Second reconstruction step */ Add133(&r2h,&r2m,&r2l,2,rr1h,rr1m,rr1l); Mul33(&rr2h,&rr2m,&rr2l,r2h,r2m,r2l,rr1h,rr1m,rr1l); if (expoX >= 2) { /* Third reconstruction step */ Add133(&r3h,&r3m,&r3l,2,rr2h,rr2m,rr2l); Mul33(&rr3h,&rr3m,&rr3l,r3h,r3m,r3l,rr2h,rr2m,rr2l); /* expoX may be maximally 2 */ expm1hover = rr3h; expm1mover = rr3m; expm1lover = rr3l; } else { expm1hover = rr2h; expm1mover = rr2m; expm1lover = rr2l; } } else { expm1hover = rr1h; expm1mover = rr1m; expm1lover = rr1l; } } else { expm1hover = polyh; expm1mover = polym; expm1lover = polyl; } /* Renormalize before returning */ Renormalize3(expm1h,expm1m,expm1l,expm1hover,expm1mover,expm1lover); } void expm1_common_td(double *expm1h, double *expm1m, double *expm1l, double rh, double rm, double rl, double tbl1h, double tbl1m, double tbl1l, double tbl2h, double tbl2m, double tbl2l, int M) { double highPoly, highPolyMulth, highPolyMultm, highPolyMultl; double rhSquareh, rhSquarel, rhSquareHalfh, rhSquareHalfl; double rhCubeh, rhCubem, rhCubel; double t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5, t6; double lowPolyh, lowPolym, lowPolyl; double ph, pm, pl, phnorm, pmnorm, rmlMultPh, rmlMultPl; double qh, ql, fullPolyh, fullPolym, fullPolyl; double polyWithTbl1h, polyWithTbl1m, polyWithTbl1l; double polyAddOneh,polyAddOnem,polyAddOnel; double polyWithTablesh, polyWithTablesm, polyWithTablesl; double exph, expm, expl, expm1hover, expm1mover, expm1lover; db_number polyWithTableshdb, polyWithTablesmdb, polyWithTablesldb; /* Polynomial approximation - double precision steps */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(accuCommonpolyC7h,rh,accuCommonpolyC6h),rh,accuCommonpolyC5h); #else highPoly = accuCommonpolyC5h + rh * (accuCommonpolyC6h + rh * accuCommonpolyC7h); #endif /* Polynomial approximation - double-double precision steps */ Mul12(&t1h,&t1l,rh,highPoly); Add22(&t2h,&t2l,accuCommonpolyC4h,accuCommonpolyC4m,t1h,t1l); Mul122(&t3h,&t3l,rh,t2h,t2l); Add22(&t4h,&t4l,accuCommonpolyC3h,accuCommonpolyC3m,t3h,t3l); Mul12(&rhSquareh,&rhSquarel,rh,rh); Mul123(&rhCubeh,&rhCubem,&rhCubel,rh,rhSquareh,rhSquarel); rhSquareHalfh = 0.5 * rhSquareh; rhSquareHalfl = 0.5 * rhSquarel; /* Polynomial approximation - triple-double precision steps */ Renormalize3(&lowPolyh,&lowPolym,&lowPolyl,rh,rhSquareHalfh,rhSquareHalfl); Mul233(&highPolyMulth,&highPolyMultm,&highPolyMultl,t4h,t4l,rhCubeh,rhCubem,rhCubel); Add33(&ph,&pm,&pl,lowPolyh,lowPolym,lowPolyl,highPolyMulth,highPolyMultm,highPolyMultl); /* Reconstruction */ Add12(phnorm,pmnorm,ph,pm); Mul22(&rmlMultPh,&rmlMultPl,rm,rl,phnorm,pmnorm); Add22(&qh,&ql,rm,rl,rmlMultPh,rmlMultPl); Add233Cond(&fullPolyh,&fullPolym,&fullPolyl,qh,ql,ph,pm,pl); Add12(polyAddOneh,t5,1,fullPolyh); Add12Cond(polyAddOnem,t6,t5,fullPolym); polyAddOnel = t6 + fullPolyl; Mul33(&polyWithTbl1h,&polyWithTbl1m,&polyWithTbl1l,tbl1h,tbl1m,tbl1l,polyAddOneh,polyAddOnem,polyAddOnel); Mul33(&polyWithTablesh,&polyWithTablesm,&polyWithTablesl, tbl2h,tbl2m,tbl2l, polyWithTbl1h,polyWithTbl1m,polyWithTbl1l); /* Multiplication by 2^(M) We perform it in integer to overcome the non-representability of 2^(1024) This case is possible for M = 1024 and polyWithTablesh < 1 The overlap in the triple-double polyWithTables[hml] stays unchanged. */ polyWithTableshdb.d = polyWithTablesh; polyWithTablesmdb.d = polyWithTablesm; polyWithTablesldb.d = polyWithTablesl; /* TODO FIXME probably at least the first of these tests is useless, but I leave this to Christoph to check it. Let us be conservative. Florent */ if(polyWithTableshdb.d!=0) polyWithTableshdb.i[HI] += M << 20; if(polyWithTablesmdb.d!=0) polyWithTablesmdb.i[HI] += M << 20; if(polyWithTablesldb.d!=0) polyWithTablesldb.i[HI] += M << 20; exph = polyWithTableshdb.d; expm = polyWithTablesmdb.d; expl = polyWithTablesldb.d; /* Subtraction of -1 We use a conditional Add133 */ Add133Cond(&expm1hover,&expm1mover,&expm1lover,-1,exph,expm,expl); /* Renormalization */ Renormalize3(expm1h,expm1m,expm1l,expm1hover,expm1mover,expm1lover); } double expm1_rn(double x) { db_number xdb, shiftedXMultdb, polyTblhdb, polyTblmdb; int xIntHi, expoX, k, M, index1, index2; double highPoly, tt1h, t1h, t1l, xSqh, xSql, xSqHalfh, xSqHalfl, xCubeh, xCubel, t2h, t2l, templ, tt3h, tt3l; double polyh, polyl, expm1h, expm1m, expm1l; double r1h, r1l, r1t, rr1h, rr1l; double r2h, r2l, r2t, rr2h, rr2l; double r3h, r3l, r3t, rr3h, rr3l; double xMultLog2InvMult2L, shiftedXMult, kd, s1, s2, s3, s4, s5, rh, rm, rl; double rhSquare, rhC3, rhSquareHalf, monomialCube, rhFour, monomialFour; double tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l; double highPolyWithSquare, tablesh, tablesl, t8, t9, t10, t11, t12, t13; double exph, expm, t1, t2, t3; double msLog2Div2LMultKh, msLog2Div2LMultKm, msLog2Div2LMultKl; double middlePoly, doublePoly; xdb.d = x; /* Strip off the sign of x for the following tests */ xIntHi = xdb.i[HI] & 0x7fffffff; /* Test if we are so small that we can return (a corrected) x as correct rounding */ if (xIntHi < RETURNXBOUND) { return x; } /* Filter out special cases like overflow, -1 in result, infinities and NaNs The filters are not sharp, we have positive arguments that flow through */ if (xIntHi >= SIMPLEOVERFLOWBOUND) { /* Test if we are +/-inf or NaN */ if (xIntHi >= 0x7ff00000) { /* Test if NaN */ if (((xIntHi & 0x000fffff) | xdb.i[LO]) != 0) { /* NaN */ return x+x; /* return NaN */ } /* Test if +inf or -inf */ if (xdb.i[HI] > 0) { /* +inf */ return x+x; /* return +inf */ } /* If we are here, we are -inf */ return -1.0; } /* If we are here, we are overflowed or a common case that flows through */ /* Test if we are actually overflowed */ if (x > OVERFLOWBOUND) { return LARGEST * LARGEST; /* return +inf and set flag */ } } /* Test if we know already that we are -1.0 (+ correction depending on rounding mode) in result */ if (x < MINUSONEBOUND) { return -1.0; } /* Test if we have |x| <= 1/4-1/2ulp(1/4) for knowing if we use exp(x) or approximate directly */ if (xIntHi < DIRECTINTERVALBOUND) { /* We approximate expm1 directly after a range reduction as follows expm1(x) = (expm1(x/2) + 2) * expm1(x/2) We perform the range reduction in such a way that finally |x| < 1/32 */ /* Extract the exponent of |x| and add 5 (2^5 = 32) */ expoX = ((xIntHi & 0x7ff00000) >> 20) - (1023 - 5); /* If this particularily biased exponent expoX is negative, we are already less than 1/32 */ if (expoX >= 0) { /* If we are here, we must perform range reduction */ /* We multiply x by 2^(-expoX-1) by bit manipulation x cannot be denormalized so there is no danger */ xdb.i[HI] += (-expoX-1) << 20; /* We reassign the new x and maintain xIntHi */ xIntHi = xdb.i[HI] & 0x7fffffff; x = xdb.d; } /* Here, we have always |x| < 1/32 */ /* Double precision evaluation steps and one double-double step */ Mul12(&xSqh,&xSql,x,x); #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) middlePoly = FMA(quickDirectpolyC5h,x,quickDirectpolyC4h); #else middlePoly = quickDirectpolyC4h + x * quickDirectpolyC5h; #endif doublePoly = middlePoly; /* Special path: for small |x| we can truncate the polynomial */ if (xIntHi > SPECIALINTERVALBOUND) { #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(quickDirectpolyC9h ,x,quickDirectpolyC8h),x, quickDirectpolyC7h),x,quickDirectpolyC6h); #else highPoly = quickDirectpolyC6h + x * (quickDirectpolyC7h + x * ( quickDirectpolyC8h + x * quickDirectpolyC9h)); #endif highPolyWithSquare = xSqh * highPoly; doublePoly = middlePoly + highPolyWithSquare; } /* Double-double evaluation steps */ tt1h = x * doublePoly; xSqHalfh = 0.5 * xSqh; xSqHalfl = 0.5 * xSql; Add12(t2h,templ,x,xSqHalfh); t2l = templ + xSqHalfl; Add12(t1h,t1l,quickDirectpolyC3h,tt1h); Mul122(&xCubeh,&xCubel,x,xSqh,xSql); Mul22(&tt3h,&tt3l,xCubeh,xCubel,t1h,t1l); Add22(&polyh,&polyl,t2h,t2l,tt3h,tt3l); /* Reconstruction */ /* If we have not performed any range reduction, we have no reconstruction to do */ if (expoX >= 0) { /* If we are here, we must perform reconstruction */ /* First reconstruction step */ Add12(r1h,r1t,2,polyh); r1l = r1t + polyl; Mul22(&rr1h,&rr1l,r1h,r1l,polyh,polyl); if (expoX >= 1) { /* Second reconstruction step */ Add12(r2h,r2t,2,rr1h); r2l = r2t + rr1l; Mul22(&rr2h,&rr2l,r2h,r2l,rr1h,rr1l); if (expoX >= 2) { /* Third reconstruction step */ Add12(r3h,r3t,2,rr2h); r3l = r3t + rr2l; Mul22(&rr3h,&rr3l,r3h,r3l,rr2h,rr2l); /* expoX may be maximally 2 */ expm1h = rr3h; expm1m = rr3l; } else { expm1h = rr2h; expm1m = rr2l; } } else { expm1h = rr1h; expm1m = rr1l; } } else { expm1h = polyh; expm1m = polyl; } /* Rounding test */ if(expm1h == (expm1h + (expm1m * ROUNDCSTDIRECTRN))) return expm1h; else { #if DEBUG printf("Launch accurate phase (direct interval)\n"); #endif expm1_direct_td(&expm1h, &expm1m, &expm1l, x, xSqHalfh, xSqHalfl, xSqh, xSql, expoX); ReturnRoundToNearest3(expm1h, expm1m, expm1l); } /* Accurate phase launched */ /* We cannot be here, since we return in all cases before */ } /* If we are here, we can use expm1(x) = exp(x) - 1 */ /* Range reduction - exact part: compute k as double and as int */ xMultLog2InvMult2L = x * log2InvMult2L; shiftedXMult = xMultLog2InvMult2L + shiftConst; kd = shiftedXMult - shiftConst; shiftedXMultdb.d = shiftedXMult; k = shiftedXMultdb.i[LO]; M = k >> 12; index1 = k & INDEXMASK1; index2 = (k & INDEXMASK2) >> 6; /* Range reduction - part affected by error - must be redone in accurate phase */ Mul12(&s1,&s2,msLog2Div2Lh,kd); s3 = kd * msLog2Div2Lm; s4 = s2 + s3; s5 = x + s1; Add12Cond(rh,rm,s5,s4); /* Table reads - read only two double-doubles by now */ tbl1h = twoPowerIndex1[index1].hi; tbl1m = twoPowerIndex1[index1].mi; tbl2h = twoPowerIndex2[index2].hi; tbl2m = twoPowerIndex2[index2].mi; /* Quick phase starts here */ rhSquare = rh * rh; rhC3 = quickCommonpolyC3h * rh; rhSquareHalf = 0.5 * rhSquare; monomialCube = rhC3 * rhSquare; rhFour = rhSquare * rhSquare; monomialFour = quickCommonpolyC4h * rhFour; highPoly = monomialCube + monomialFour; highPolyWithSquare = rhSquareHalf + highPoly; /* Reconstruction: integration of table values */ Mul22(&tablesh,&tablesl,tbl1h,tbl1m,tbl2h,tbl2m); t8 = rm + highPolyWithSquare; t9 = rh + t8; t10 = tablesh * t9; Add12(t11,t12,tablesh,t10); t13 = t12 + tablesl; Add12(polyTblhdb.d,polyTblmdb.d,t11,t13); /* Reconstruction: multiplication by 2^M */ /* Implement the multiplication by addition to overcome the problem of the non-representability of 2^1024 (M = 1024) This case is possible if polyTblhdb.d < 1 */ polyTblhdb.i[HI] += M << 20; if(polyTblmdb.d!=0.0) /* predicted true, but it happens for x=-4.1588039009762204, thanks Morten */ polyTblmdb.i[HI] += M << 20; exph = polyTblhdb.d; expm = polyTblmdb.d; /* Subtraction of 1 Testing if the operation is necessary is more expensive than performing it in any case. We may cancellate at most 2 bits in the subtraction for arguments 1/4 <= x <= ln(2) (0.25 <= x <= 0.69) We must therefore use conditional Add12s Since we perform a subtraction, we may not have addition overflow towards +inf */ Add12Cond(t1,t2,-1,exph); t3 = t2 + expm; Add12Cond(expm1h,expm1m,t1,t3); /* Rounding test */ if(expm1h == (expm1h + (expm1m * ROUNDCSTCOMMONRN))) { return expm1h; } else { /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh,&msLog2Div2LMultKm,&msLog2Div2LMultKl,kd,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1 = x + msLog2Div2LMultKh; Add12Cond(rh,t2,t1,msLog2Div2LMultKm); Add12Cond(rm,rl,t2,msLog2Div2LMultKl); /* Table reads for accurate phase */ tbl1l = twoPowerIndex1[index1].lo; tbl2l = twoPowerIndex2[index2].lo; #if DEBUG printf("Launch accurate phase (common interval)\n"); #endif /* Call accurate phase */ expm1_common_td(&expm1h, &expm1m, &expm1l, rh, rm, rl, tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l, M); /* Final rounding */ ReturnRoundToNearest3(expm1h, expm1m, expm1l); } /* Accurate phase launched */ /* We cannot be here since we return before in any case */ } double expm1_rd(double x) { db_number xdb, shiftedXMultdb, polyTblhdb, polyTblmdb; int xIntHi, expoX, k, M, index1, index2; double highPoly, tt1h, t1h, t1l, xSqh, xSql, xSqHalfh, xSqHalfl, xCubeh, xCubel, t2h, t2l, templ, tt3h, tt3l; double polyh, polyl, expm1h, expm1m, expm1l; double r1h, r1l, r1t, rr1h, rr1l; double r2h, r2l, r2t, rr2h, rr2l; double r3h, r3l, r3t, rr3h, rr3l; double xMultLog2InvMult2L, shiftedXMult, kd, s1, s2, s3, s4, s5, rh, rm, rl; double rhSquare, rhC3, rhSquareHalf, monomialCube, rhFour, monomialFour; double tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l; double highPolyWithSquare, tablesh, tablesl, t8, t9, t10, t11, t12, t13; double exph, expm, t1, t2, t3; double msLog2Div2LMultKh, msLog2Div2LMultKm, msLog2Div2LMultKl; double middlePoly, doublePoly; xdb.d = x; /* Strip off the sign of x for the following tests */ xIntHi = xdb.i[HI] & 0x7fffffff; /* Test if we are so small that we can return (a corrected) x as correct rounding */ if (xIntHi < RETURNXBOUND) { /* The only algebraic result is 0 for x = +/- 0; in this case, we can return x = +/- 0 The truncation rest x^2/2 + x^3/6 + ... is always positive but less than 1 ulp in this case, so we round down by returning x */ return x; } /* Filter out special cases like overflow, -1 in result, infinities and NaNs The filters are not sharp, we have positive arguments that flow through */ if (xIntHi >= SIMPLEOVERFLOWBOUND) { /* Test if we are +/-inf or NaN */ if (xIntHi >= 0x7ff00000) { /* Test if NaN */ if (((xIntHi & 0x000fffff) | xdb.i[LO]) != 0) { /* NaN */ return x+x; /* return NaN */ } /* Test if +inf or -inf */ if (xdb.i[HI] > 0) { /* +inf */ return x+x; /* return +inf */ } /* If we are here, we are -inf */ return -1.0; } /* If we are here, we are overflowed or a common case that flows through */ /* Test if we are actually overflowed */ if (x > OVERFLOWBOUND) { /* We would be overflowed but as we are rounding downwards the nearest number lesser than the exact result is the greatest normal. In any case, we must raise the inexact flag. */ return LARGEST * (1.0 + SMALLEST); } } /* Test if we know already that we are -1.0 (+ correction depending on rounding mode) in result */ if (x < MINUSONEBOUND) { /* We round down, so we are -1.0 */ return -1.0; } /* Test if we have |x| <= 1/4-1/2ulp(1/4) for knowing if we use exp(x) or approximate directly */ if (xIntHi < DIRECTINTERVALBOUND) { /* We approximate expm1 directly after a range reduction as follows expm1(x) = (expm1(x/2) + 2) * expm1(x/2) We perform the range reduction in such a way that finally |x| < 1/32 */ /* Extract the exponent of |x| and add 5 (2^5 = 32) */ expoX = ((xIntHi & 0x7ff00000) >> 20) - (1023 - 5); /* If this particularily biased exponent expoX is negative, we are already less than 1/32 */ if (expoX >= 0) { /* If we are here, we must perform range reduction */ /* We multiply x by 2^(-expoX-1) by bit manipulation x cannot be denormalized so there is no danger */ xdb.i[HI] += (-expoX-1) << 20; /* We reassign the new x and maintain xIntHi */ xIntHi = xdb.i[HI] & 0x7fffffff; x = xdb.d; } /* Here, we have always |x| < 1/32 */ /* Double precision evaluation steps and one double-double step */ Mul12(&xSqh,&xSql,x,x); #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) middlePoly = FMA(quickDirectpolyC5h,x,quickDirectpolyC4h); #else middlePoly = quickDirectpolyC4h + x * quickDirectpolyC5h; #endif doublePoly = middlePoly; /* Special path: for small |x| we can truncate the polynomial */ if (xIntHi > SPECIALINTERVALBOUND) { #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(quickDirectpolyC9h ,x,quickDirectpolyC8h),x, quickDirectpolyC7h),x,quickDirectpolyC6h); #else highPoly = quickDirectpolyC6h + x * (quickDirectpolyC7h + x * ( quickDirectpolyC8h + x * quickDirectpolyC9h)); #endif highPolyWithSquare = xSqh * highPoly; doublePoly = middlePoly + highPolyWithSquare; } /* Double-double evaluation steps */ tt1h = x * doublePoly; xSqHalfh = 0.5 * xSqh; xSqHalfl = 0.5 * xSql; Add12(t2h,templ,x,xSqHalfh); t2l = templ + xSqHalfl; Add12(t1h,t1l,quickDirectpolyC3h,tt1h); Mul122(&xCubeh,&xCubel,x,xSqh,xSql); Mul22(&tt3h,&tt3l,xCubeh,xCubel,t1h,t1l); Add22(&polyh,&polyl,t2h,t2l,tt3h,tt3l); /* Reconstruction */ /* If we have not performed any range reduction, we have no reconstruction to do */ if (expoX >= 0) { /* If we are here, we must perform reconstruction */ /* First reconstruction step */ Add12(r1h,r1t,2,polyh); r1l = r1t + polyl; Mul22(&rr1h,&rr1l,r1h,r1l,polyh,polyl); if (expoX >= 1) { /* Second reconstruction step */ Add12(r2h,r2t,2,rr1h); r2l = r2t + rr1l; Mul22(&rr2h,&rr2l,r2h,r2l,rr1h,rr1l); if (expoX >= 2) { /* Third reconstruction step */ Add12(r3h,r3t,2,rr2h); r3l = r3t + rr2l; Mul22(&rr3h,&rr3l,r3h,r3l,rr2h,rr2l); /* expoX may be maximally 2 */ expm1h = rr3h; expm1m = rr3l; } else { expm1h = rr2h; expm1m = rr2l; } } else { expm1h = rr1h; expm1m = rr1l; } } else { expm1h = polyh; expm1m = polyl; } /* Rounding test */ TEST_AND_RETURN_RD(expm1h, expm1m, ROUNDCSTDIRECTRD); { expm1_direct_td(&expm1h, &expm1m, &expm1l, x, xSqHalfh, xSqHalfl, xSqh, xSql, expoX); ReturnRoundDownwards3(expm1h, expm1m, expm1l); } /* Accurate phase launched */ /* We cannot be here, since we return in all cases before */ } /* If we are here, we can use expm1(x) = exp(x) - 1 */ /* Range reduction - exact part: compute k as double and as int */ xMultLog2InvMult2L = x * log2InvMult2L; shiftedXMult = xMultLog2InvMult2L + shiftConst; kd = shiftedXMult - shiftConst; shiftedXMultdb.d = shiftedXMult; k = shiftedXMultdb.i[LO]; M = k >> 12; index1 = k & INDEXMASK1; index2 = (k & INDEXMASK2) >> 6; /* Range reduction - part affected by error - must be redone in accurate phase */ Mul12(&s1,&s2,msLog2Div2Lh,kd); s3 = kd * msLog2Div2Lm; s4 = s2 + s3; s5 = x + s1; Add12Cond(rh,rm,s5,s4); /* Table reads - read only two double-doubles by now */ tbl1h = twoPowerIndex1[index1].hi; tbl1m = twoPowerIndex1[index1].mi; tbl2h = twoPowerIndex2[index2].hi; tbl2m = twoPowerIndex2[index2].mi; /* Quick phase starts here */ rhSquare = rh * rh; rhC3 = quickCommonpolyC3h * rh; rhSquareHalf = 0.5 * rhSquare; monomialCube = rhC3 * rhSquare; rhFour = rhSquare * rhSquare; monomialFour = quickCommonpolyC4h * rhFour; highPoly = monomialCube + monomialFour; highPolyWithSquare = rhSquareHalf + highPoly; /* Reconstruction: integration of table values */ Mul22(&tablesh,&tablesl,tbl1h,tbl1m,tbl2h,tbl2m); t8 = rm + highPolyWithSquare; t9 = rh + t8; t10 = tablesh * t9; Add12(t11,t12,tablesh,t10); t13 = t12 + tablesl; Add12(polyTblhdb.d,polyTblmdb.d,t11,t13); /* Reconstruction: multiplication by 2^M */ /* Implement the multiplication by addition to overcome the problem of the non-representability of 2^1024 (M = 1024) This case is possible if polyTblhdb.d < 1 */ polyTblhdb.i[HI] += M << 20; if(polyTblmdb.d!=0.0) /* predicted true, but it happens for x=-4.1588039009762204, thanks Morten */ polyTblmdb.i[HI] += M << 20; exph = polyTblhdb.d; expm = polyTblmdb.d; /* Subtraction of 1 Testing if the operation is necessary is more expensive than performing it in any case. We may cancellate at most 2 bits in the subtraction for arguments 1/4 <= x <= ln(2) (0.25 <= x <= 0.69) We must therefore use conditional Add12s Since we perform a subtraction, we may not have addition overflow towards +inf */ Add12Cond(t1,t2,-1,exph); t3 = t2 + expm; Add12Cond(expm1h,expm1m,t1,t3); /* Rounding test */ TEST_AND_RETURN_RD(expm1h, expm1m, ROUNDCSTCOMMONRD); { /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh,&msLog2Div2LMultKm,&msLog2Div2LMultKl,kd,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1 = x + msLog2Div2LMultKh; Add12Cond(rh,t2,t1,msLog2Div2LMultKm); Add12Cond(rm,rl,t2,msLog2Div2LMultKl); /* Table reads for accurate phase */ tbl1l = twoPowerIndex1[index1].lo; tbl2l = twoPowerIndex2[index2].lo; /* Call accurate phase */ expm1_common_td(&expm1h, &expm1m, &expm1l, rh, rm, rl, tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l, M); /* Final rounding */ ReturnRoundDownwards3(expm1h, expm1m, expm1l); } /* Accurate phase launched */ /* We cannot be here since we return before in any case */ } double expm1_ru(double x) { db_number xdb, shiftedXMultdb, polyTblhdb, polyTblmdb; int xIntHi, expoX, k, M, index1, index2; double highPoly, tt1h, t1h, t1l, xSqh, xSql, xSqHalfh, xSqHalfl, xCubeh, xCubel, t2h, t2l, templ, tt3h, tt3l; double polyh, polyl, expm1h, expm1m, expm1l; double r1h, r1l, r1t, rr1h, rr1l; double r2h, r2l, r2t, rr2h, rr2l; double r3h, r3l, r3t, rr3h, rr3l; double xMultLog2InvMult2L, shiftedXMult, kd, s1, s2, s3, s4, s5, rh, rm, rl; double rhSquare, rhC3, rhSquareHalf, monomialCube, rhFour, monomialFour; double tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l; double highPolyWithSquare, tablesh, tablesl, t8, t9, t10, t11, t12, t13; double exph, expm, t1, t2, t3; double msLog2Div2LMultKh, msLog2Div2LMultKm, msLog2Div2LMultKl; double middlePoly, doublePoly; xdb.d = x; /* Strip off the sign of x for the following tests */ xIntHi = xdb.i[HI] & 0x7fffffff; /* Test if we are so small that we can return (a corrected) x as correct rounding */ if (xIntHi < RETURNXBOUND) { /* The only algebraic result is 0 for x = +/-0; in this case, we return x = +/-0 The truncation rest x^2/2 + x^3/6 + ... is always positive but less than 1 ulp in this case, so we round by adding 1 ulp */ if (x == 0.0) return x; if (xdb.i[HI] & 0x80000000) { /* x is negative We add 1 ulp by subtracting 1 in long */ xdb.l--; } else { /* x is positive We add 1 ulp by adding 1 in long */ xdb.l++; } return xdb.d; } /* Filter out special cases like overflow, -1 in result, infinities and NaNs The filters are not sharp, we have positive arguments that flow through */ if (xIntHi >= SIMPLEOVERFLOWBOUND) { /* Test if we are +/-inf or NaN */ if (xIntHi >= 0x7ff00000) { /* Test if NaN */ if (((xIntHi & 0x000fffff) | xdb.i[LO]) != 0) { /* NaN */ return x+x; /* return NaN */ } /* Test if +inf or -inf */ if (xdb.i[HI] > 0) { /* +inf */ return x+x; /* return +inf */ } /* If we are here, we are -inf */ return -1.0; } /* If we are here, we are overflowed or a common case that flows through */ /* Test if we are actually overflowed */ if (x > OVERFLOWBOUND) { return LARGEST * LARGEST; /* return +inf and set flag */ } } /* Test if we know already that we are -1.0 (+ correction depending on rounding mode) in result */ if (x < MINUSONEBOUND) { /* Round up so we are -1.0 + 1ulp */ return MINUSONEPLUSONEULP; } /* Test if we have |x| <= 1/4-1/2ulp(1/4) for knowing if we use exp(x) or approximate directly */ if (xIntHi < DIRECTINTERVALBOUND) { /* We approximate expm1 directly after a range reduction as follows expm1(x) = (expm1(x/2) + 2) * expm1(x/2) We perform the range reduction in such a way that finally |x| < 1/32 */ /* Extract the exponent of |x| and add 5 (2^5 = 32) */ expoX = ((xIntHi & 0x7ff00000) >> 20) - (1023 - 5); /* If this particularily biased exponent expoX is negative, we are already less than 1/32 */ if (expoX >= 0) { /* If we are here, we must perform range reduction */ /* We multiply x by 2^(-expoX-1) by bit manipulation x cannot be denormalized so there is no danger */ xdb.i[HI] += (-expoX-1) << 20; /* We reassign the new x and maintain xIntHi */ xIntHi = xdb.i[HI] & 0x7fffffff; x = xdb.d; } /* Here, we have always |x| < 1/32 */ /* Double precision evaluation steps and one double-double step */ Mul12(&xSqh,&xSql,x,x); #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) middlePoly = FMA(quickDirectpolyC5h,x,quickDirectpolyC4h); #else middlePoly = quickDirectpolyC4h + x * quickDirectpolyC5h; #endif doublePoly = middlePoly; /* Special path: for small |x| we can truncate the polynomial */ if (xIntHi > SPECIALINTERVALBOUND) { #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(quickDirectpolyC9h ,x,quickDirectpolyC8h),x, quickDirectpolyC7h),x,quickDirectpolyC6h); #else highPoly = quickDirectpolyC6h + x * (quickDirectpolyC7h + x * ( quickDirectpolyC8h + x * quickDirectpolyC9h)); #endif highPolyWithSquare = xSqh * highPoly; doublePoly = middlePoly + highPolyWithSquare; } /* Double-double evaluation steps */ tt1h = x * doublePoly; xSqHalfh = 0.5 * xSqh; xSqHalfl = 0.5 * xSql; Add12(t2h,templ,x,xSqHalfh); t2l = templ + xSqHalfl; Add12(t1h,t1l,quickDirectpolyC3h,tt1h); Mul122(&xCubeh,&xCubel,x,xSqh,xSql); Mul22(&tt3h,&tt3l,xCubeh,xCubel,t1h,t1l); Add22(&polyh,&polyl,t2h,t2l,tt3h,tt3l); /* Reconstruction */ /* If we have not performed any range reduction, we have no reconstruction to do */ if (expoX >= 0) { /* If we are here, we must perform reconstruction */ /* First reconstruction step */ Add12(r1h,r1t,2,polyh); r1l = r1t + polyl; Mul22(&rr1h,&rr1l,r1h,r1l,polyh,polyl); if (expoX >= 1) { /* Second reconstruction step */ Add12(r2h,r2t,2,rr1h); r2l = r2t + rr1l; Mul22(&rr2h,&rr2l,r2h,r2l,rr1h,rr1l); if (expoX >= 2) { /* Third reconstruction step */ Add12(r3h,r3t,2,rr2h); r3l = r3t + rr2l; Mul22(&rr3h,&rr3l,r3h,r3l,rr2h,rr2l); /* expoX may be maximally 2 */ expm1h = rr3h; expm1m = rr3l; } else { expm1h = rr2h; expm1m = rr2l; } } else { expm1h = rr1h; expm1m = rr1l; } } else { expm1h = polyh; expm1m = polyl; } /* Rounding test */ TEST_AND_RETURN_RU(expm1h, expm1m, ROUNDCSTDIRECTRD); { expm1_direct_td(&expm1h, &expm1m, &expm1l, x, xSqHalfh, xSqHalfl, xSqh, xSql, expoX); ReturnRoundUpwards3(expm1h, expm1m, expm1l); } /* Accurate phase launched */ /* We cannot be here, since we return in all cases before */ } /* If we are here, we can use expm1(x) = exp(x) - 1 */ /* Range reduction - exact part: compute k as double and as int */ xMultLog2InvMult2L = x * log2InvMult2L; shiftedXMult = xMultLog2InvMult2L + shiftConst; kd = shiftedXMult - shiftConst; shiftedXMultdb.d = shiftedXMult; k = shiftedXMultdb.i[LO]; M = k >> 12; index1 = k & INDEXMASK1; index2 = (k & INDEXMASK2) >> 6; /* Range reduction - part affected by error - must be redone in accurate phase */ Mul12(&s1,&s2,msLog2Div2Lh,kd); s3 = kd * msLog2Div2Lm; s4 = s2 + s3; s5 = x + s1; Add12Cond(rh,rm,s5,s4); /* Table reads - read only two double-doubles by now */ tbl1h = twoPowerIndex1[index1].hi; tbl1m = twoPowerIndex1[index1].mi; tbl2h = twoPowerIndex2[index2].hi; tbl2m = twoPowerIndex2[index2].mi; /* Quick phase starts here */ rhSquare = rh * rh; rhC3 = quickCommonpolyC3h * rh; rhSquareHalf = 0.5 * rhSquare; monomialCube = rhC3 * rhSquare; rhFour = rhSquare * rhSquare; monomialFour = quickCommonpolyC4h * rhFour; highPoly = monomialCube + monomialFour; highPolyWithSquare = rhSquareHalf + highPoly; /* Reconstruction: integration of table values */ Mul22(&tablesh,&tablesl,tbl1h,tbl1m,tbl2h,tbl2m); t8 = rm + highPolyWithSquare; t9 = rh + t8; t10 = tablesh * t9; Add12(t11,t12,tablesh,t10); t13 = t12 + tablesl; Add12(polyTblhdb.d,polyTblmdb.d,t11,t13); /* Reconstruction: multiplication by 2^M */ /* Implement the multiplication by addition to overcome the problem of the non-representability of 2^1024 (M = 1024) This case is possible if polyTblhdb.d < 1 */ polyTblhdb.i[HI] += M << 20; if(polyTblmdb.d!=0.0) /* predicted true, but it happens for x=-4.1588039009762204, thanks Morten */ polyTblmdb.i[HI] += M << 20; exph = polyTblhdb.d; expm = polyTblmdb.d; /* Subtraction of 1 Testing if the operation is necessary is more expensive than performing it in any case. We may cancellate at most 2 bits in the subtraction for arguments 1/4 <= x <= ln(2) (0.25 <= x <= 0.69) We must therefore use conditional Add12s Since we perform a subtraction, we may not have addition overflow towards +inf */ Add12Cond(t1,t2,-1,exph); t3 = t2 + expm; Add12Cond(expm1h,expm1m,t1,t3); /* Rounding test */ TEST_AND_RETURN_RU(expm1h, expm1m, ROUNDCSTCOMMONRD); { /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh,&msLog2Div2LMultKm,&msLog2Div2LMultKl,kd,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1 = x + msLog2Div2LMultKh; Add12Cond(rh,t2,t1,msLog2Div2LMultKm); Add12Cond(rm,rl,t2,msLog2Div2LMultKl); /* Table reads for accurate phase */ tbl1l = twoPowerIndex1[index1].lo; tbl2l = twoPowerIndex2[index2].lo; /* Call accurate phase */ expm1_common_td(&expm1h, &expm1m, &expm1l, rh, rm, rl, tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l, M); /* Final rounding */ ReturnRoundUpwards3(expm1h, expm1m, expm1l); } /* Accurate phase launched */ /* We cannot be here since we return before in any case */ } double expm1_rz(double x) { db_number xdb, shiftedXMultdb, polyTblhdb, polyTblmdb; int xIntHi, expoX, k, M, index1, index2; double highPoly, tt1h, t1h, t1l, xSqh, xSql, xSqHalfh, xSqHalfl, xCubeh, xCubel, t2h, t2l, templ, tt3h, tt3l; double polyh, polyl, expm1h, expm1m, expm1l; double r1h, r1l, r1t, rr1h, rr1l; double r2h, r2l, r2t, rr2h, rr2l; double r3h, r3l, r3t, rr3h, rr3l; double xMultLog2InvMult2L, shiftedXMult, kd, s1, s2, s3, s4, s5, rh, rm, rl; double rhSquare, rhC3, rhSquareHalf, monomialCube, rhFour, monomialFour; double tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l; double highPolyWithSquare, tablesh, tablesl, t8, t9, t10, t11, t12, t13; double exph, expm, t1, t2, t3; double msLog2Div2LMultKh, msLog2Div2LMultKm, msLog2Div2LMultKl; double middlePoly, doublePoly; xdb.d = x; /* Strip off the sign of x for the following tests */ xIntHi = xdb.i[HI] & 0x7fffffff; /* Test if we are so small that we can return (a corrected) x as correct rounding */ if (xIntHi < RETURNXBOUND) { /* The only algebraic result is 0 for x = +/- 0; in this case, we can return x = +/- 0 expm1 is positive for positive x, negative for negative x The truncation rest x^2/2 + x^3/6 + ... is always positive but less than 1 ulp in this case, so we round as follows: - x is positive => expm1 is positive => round downwards => truncate by returning x - x is negative => expm1 is negative => round upwards => add 1 ulp */ if (x == 0.0) return x; if (xdb.i[HI] & 0x80000000) { /* x is negative We add 1 ulp by subtracting 1 in long */ xdb.l--; return xdb.d; } else { /* x is positive We do nothing (see above) */ return x; } } /* Filter out special cases like overflow, -1 in result, infinities and NaNs The filters are not sharp, we have positive arguments that flow through */ if (xIntHi >= SIMPLEOVERFLOWBOUND) { /* Test if we are +/-inf or NaN */ if (xIntHi >= 0x7ff00000) { /* Test if NaN */ if (((xIntHi & 0x000fffff) | xdb.i[LO]) != 0) { /* NaN */ return x+x; /* return NaN */ } /* Test if +inf or -inf */ if (xdb.i[HI] > 0) { /* +inf */ return x+x; /* return +inf */ } /* If we are here, we are -inf */ return -1.0; } /* If we are here, we are overflowed or a common case that flows through */ /* Test if we are actually overflowed */ if (x > OVERFLOWBOUND) { /* We would be overflowed but as we are rounding towards zero, i.e. downwards, the nearest number lesser than the exact result is the greatest normal. In any case, we must raise the inexact flag. */ return LARGEST * (1.0 + SMALLEST); } } /* Test if we know already that we are -1.0 (+ correction depending on rounding mode) in result */ if (x < MINUSONEBOUND) { /* We round towards zero, i.e. upwards, so we return -1.0+1ulp */ return MINUSONEPLUSONEULP; } /* Test if we have |x| <= 1/4-1/2ulp(1/4) for knowing if we use exp(x) or approximate directly */ if (xIntHi < DIRECTINTERVALBOUND) { /* We approximate expm1 directly after a range reduction as follows expm1(x) = (expm1(x/2) + 2) * expm1(x/2) We perform the range reduction in such a way that finally |x| < 1/32 */ /* Extract the exponent of |x| and add 5 (2^5 = 32) */ expoX = ((xIntHi & 0x7ff00000) >> 20) - (1023 - 5); /* If this particularily biased exponent expoX is negative, we are already less than 1/32 */ if (expoX >= 0) { /* If we are here, we must perform range reduction */ /* We multiply x by 2^(-expoX-1) by bit manipulation x cannot be denormalized so there is no danger */ xdb.i[HI] += (-expoX-1) << 20; /* We reassign the new x and maintain xIntHi */ xIntHi = xdb.i[HI] & 0x7fffffff; x = xdb.d; } /* Here, we have always |x| < 1/32 */ /* Double precision evaluation steps and one double-double step */ Mul12(&xSqh,&xSql,x,x); #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) middlePoly = FMA(quickDirectpolyC5h,x,quickDirectpolyC4h); #else middlePoly = quickDirectpolyC4h + x * quickDirectpolyC5h; #endif doublePoly = middlePoly; /* Special path: for small |x| we can truncate the polynomial */ if (xIntHi > SPECIALINTERVALBOUND) { #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(quickDirectpolyC9h ,x,quickDirectpolyC8h),x, quickDirectpolyC7h),x,quickDirectpolyC6h); #else highPoly = quickDirectpolyC6h + x * (quickDirectpolyC7h + x * ( quickDirectpolyC8h + x * quickDirectpolyC9h)); #endif highPolyWithSquare = xSqh * highPoly; doublePoly = middlePoly + highPolyWithSquare; } /* Double-double evaluation steps */ tt1h = x * doublePoly; xSqHalfh = 0.5 * xSqh; xSqHalfl = 0.5 * xSql; Add12(t2h,templ,x,xSqHalfh); t2l = templ + xSqHalfl; Add12(t1h,t1l,quickDirectpolyC3h,tt1h); Mul122(&xCubeh,&xCubel,x,xSqh,xSql); Mul22(&tt3h,&tt3l,xCubeh,xCubel,t1h,t1l); Add22(&polyh,&polyl,t2h,t2l,tt3h,tt3l); /* Reconstruction */ /* If we have not performed any range reduction, we have no reconstruction to do */ if (expoX >= 0) { /* If we are here, we must perform reconstruction */ /* First reconstruction step */ Add12(r1h,r1t,2,polyh); r1l = r1t + polyl; Mul22(&rr1h,&rr1l,r1h,r1l,polyh,polyl); if (expoX >= 1) { /* Second reconstruction step */ Add12(r2h,r2t,2,rr1h); r2l = r2t + rr1l; Mul22(&rr2h,&rr2l,r2h,r2l,rr1h,rr1l); if (expoX >= 2) { /* Third reconstruction step */ Add12(r3h,r3t,2,rr2h); r3l = r3t + rr2l; Mul22(&rr3h,&rr3l,r3h,r3l,rr2h,rr2l); /* expoX may be maximally 2 */ expm1h = rr3h; expm1m = rr3l; } else { expm1h = rr2h; expm1m = rr2l; } } else { expm1h = rr1h; expm1m = rr1l; } } else { expm1h = polyh; expm1m = polyl; } /* Rounding test */ TEST_AND_RETURN_RZ(expm1h, expm1m, ROUNDCSTDIRECTRD); { expm1_direct_td(&expm1h, &expm1m, &expm1l, x, xSqHalfh, xSqHalfl, xSqh, xSql, expoX); ReturnRoundTowardsZero3(expm1h, expm1m, expm1l); } /* Accurate phase launched */ /* We cannot be here, since we return in all cases before */ } /* If we are here, we can use expm1(x) = exp(x) - 1 */ /* Range reduction - exact part: compute k as double and as int */ xMultLog2InvMult2L = x * log2InvMult2L; shiftedXMult = xMultLog2InvMult2L + shiftConst; kd = shiftedXMult - shiftConst; shiftedXMultdb.d = shiftedXMult; k = shiftedXMultdb.i[LO]; M = k >> 12; index1 = k & INDEXMASK1; index2 = (k & INDEXMASK2) >> 6; /* Range reduction - part affected by error - must be redone in accurate phase */ Mul12(&s1,&s2,msLog2Div2Lh,kd); s3 = kd * msLog2Div2Lm; s4 = s2 + s3; s5 = x + s1; Add12Cond(rh,rm,s5,s4); /* Table reads - read only two double-doubles by now */ tbl1h = twoPowerIndex1[index1].hi; tbl1m = twoPowerIndex1[index1].mi; tbl2h = twoPowerIndex2[index2].hi; tbl2m = twoPowerIndex2[index2].mi; /* Quick phase starts here */ rhSquare = rh * rh; rhC3 = quickCommonpolyC3h * rh; rhSquareHalf = 0.5 * rhSquare; monomialCube = rhC3 * rhSquare; rhFour = rhSquare * rhSquare; monomialFour = quickCommonpolyC4h * rhFour; highPoly = monomialCube + monomialFour; highPolyWithSquare = rhSquareHalf + highPoly; /* Reconstruction: integration of table values */ Mul22(&tablesh,&tablesl,tbl1h,tbl1m,tbl2h,tbl2m); t8 = rm + highPolyWithSquare; t9 = rh + t8; t10 = tablesh * t9; Add12(t11,t12,tablesh,t10); t13 = t12 + tablesl; Add12(polyTblhdb.d,polyTblmdb.d,t11,t13); /* Reconstruction: multiplication by 2^M */ /* Implement the multiplication by addition to overcome the problem of the non-representability of 2^1024 (M = 1024) This case is possible if polyTblhdb.d < 1 */ polyTblhdb.i[HI] += M << 20; if(polyTblmdb.d!=0.0) /* predicted true, but it happens for x=-4.1588039009762204, thanks Morten */ polyTblmdb.i[HI] += M << 20; exph = polyTblhdb.d; expm = polyTblmdb.d; /* Subtraction of 1 Testing if the operation is necessary is more expensive than performing it in any case. We may cancellate at most 2 bits in the subtraction for arguments 1/4 <= x <= ln(2) (0.25 <= x <= 0.69) We must therefore use conditional Add12s Since we perform a subtraction, we may not have addition overflow towards +inf */ Add12Cond(t1,t2,-1,exph); t3 = t2 + expm; Add12Cond(expm1h,expm1m,t1,t3); /* Rounding test */ TEST_AND_RETURN_RZ(expm1h, expm1m, ROUNDCSTCOMMONRD); { /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh,&msLog2Div2LMultKm,&msLog2Div2LMultKl,kd,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1 = x + msLog2Div2LMultKh; Add12Cond(rh,t2,t1,msLog2Div2LMultKm); Add12Cond(rm,rl,t2,msLog2Div2LMultKl); /* Table reads for accurate phase */ tbl1l = twoPowerIndex1[index1].lo; tbl2l = twoPowerIndex2[index2].lo; /* Call accurate phase */ expm1_common_td(&expm1h, &expm1m, &expm1l, rh, rm, rl, tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l, M); /* Final rounding */ ReturnRoundTowardsZero3(expm1h, expm1m, expm1l); } /* Accurate phase launched */ /* We cannot be here since we return before in any case */ } #ifdef BUILD_INTERVAL_FUNCTIONS interval j_expm1(interval x) { interval res; db_number xdb_inf, shiftedXMultdb_inf, polyTblhdb_inf, polyTblmdb_inf; int xIntHi_inf, expoX_inf, k_inf, M_inf, index1_inf, index2_inf; double x_inf, x_sup; double res_inf,res_sup; double restemp_inf, restemp_sup; double highPoly_inf, tt1h_inf, t1h_inf, t1l_inf, xSqh_inf, xSql_inf, xSqHalfh_inf, xSqHalfl_inf, xCubeh_inf, xCubel_inf, t2h_inf, t2l_inf, templ_inf, tt3h_inf, tt3l_inf; double polyh_inf, polyl_inf, expm1h_inf, expm1m_inf, expm1l_inf; double r1h_inf, r1l_inf, r1t_inf, rr1h_inf, rr1l_inf; double r2h_inf, r2l_inf, r2t_inf, rr2h_inf, rr2l_inf; double r3h_inf, r3l_inf, r3t_inf, rr3h_inf, rr3l_inf; double xMultLog2InvMult2L_inf, shiftedXMult_inf, kd_inf, s1_inf, s2_inf, s3_inf, s4_inf, s5_inf, rh_inf, rm_inf, rl_inf; double rhSquare_inf, rhC3_inf, rhSquareHalf_inf, monomialCube_inf, rhFour_inf, monomialFour_inf; double tbl1h_inf, tbl1m_inf, tbl1l_inf, tbl2h_inf, tbl2m_inf, tbl2l_inf; double highPolyWithSquare_inf, tablesh_inf, tablesl_inf, t8_inf, t9_inf, t10_inf, t11_inf, t12_inf, t13_inf; double exph_inf, expm_inf, t1_inf, t2_inf, t3_inf; double msLog2Div2LMultKh_inf, msLog2Div2LMultKm_inf, msLog2Div2LMultKl_inf; double middlePoly_inf, doublePoly_inf; int roundable; int infDone, supDone; infDone=0; supDone=0; db_number xdb_sup, shiftedXMultdb_sup, polyTblhdb_sup, polyTblmdb_sup; int xIntHi_sup, expoX_sup, k_sup, M_sup, index1_sup, index2_sup; double highPoly_sup, tt1h_sup, t1h_sup, t1l_sup, xSqh_sup, xSql_sup, xSqHalfh_sup, xSqHalfl_sup, xCubeh_sup, xCubel_sup, t2h_sup, t2l_sup, templ_sup, tt3h_sup, tt3l_sup; double polyh_sup, polyl_sup, expm1h_sup, expm1m_sup, expm1l_sup; double r1h_sup, r1l_sup, r1t_sup, rr1h_sup, rr1l_sup; double r2h_sup, r2l_sup, r2t_sup, rr2h_sup, rr2l_sup; double r3h_sup, r3l_sup, r3t_sup, rr3h_sup, rr3l_sup; double xMultLog2InvMult2L_sup, shiftedXMult_sup, kd_sup, s1_sup, s2_sup, s3_sup, s4_sup, s5_sup, rh_sup, rm_sup, rl_sup; double rhSquare_sup, rhC3_sup, rhSquareHalf_sup, monomialCube_sup, rhFour_sup, monomialFour_sup; double tbl1h_sup, tbl1m_sup, tbl1l_sup, tbl2h_sup, tbl2m_sup, tbl2l_sup; double highPolyWithSquare_sup, tablesh_sup, tablesl_sup, t8_sup, t9_sup, t10_sup, t11_sup, t12_sup, t13_sup; double exph_sup, expm_sup, t1_sup, t2_sup, t3_sup; double msLog2Div2LMultKh_sup, msLog2Div2LMultKm_sup, msLog2Div2LMultKl_sup; double middlePoly_sup, doublePoly_sup; x_inf=LOW(x); x_sup=UP(x); xdb_inf.d = x_inf; xdb_sup.d = x_sup; /* Strip off the sign of x for the following tests */ xIntHi_inf = xdb_inf.i[HI] & 0x7fffffff; xIntHi_sup = xdb_sup.i[HI] & 0x7fffffff; /* Test if we are so small that we can return (a corrected) x as correct rounding */ if ( __builtin_expect( (xIntHi_inf < RETURNXBOUND) || ((xIntHi_inf >= SIMPLEOVERFLOWBOUND) && (xIntHi_inf >= 0x7ff00000)) || ((xIntHi_inf >= SIMPLEOVERFLOWBOUND) && (xIntHi_inf >= 0x7ff00000) && (((xIntHi_inf & 0x000fffff) | xdb_inf.i[LO]) != 0)) || ((xIntHi_inf >= SIMPLEOVERFLOWBOUND) && (xIntHi_inf >= 0x7ff00000) && (xdb_inf.i[HI] > 0)) || ((xIntHi_inf >= SIMPLEOVERFLOWBOUND) && (x_inf > OVERFLOWBOUND)) || (x_inf < MINUSONEBOUND) || (xIntHi_sup < RETURNXBOUND) || ((xIntHi_sup < RETURNXBOUND) && (x_sup == 0.0)) || ((xIntHi_sup >= SIMPLEOVERFLOWBOUND) && (xIntHi_sup >= 0x7ff00000)) || ((xIntHi_sup >= SIMPLEOVERFLOWBOUND) && (xIntHi_sup >= 0x7ff00000) && (((xIntHi_sup & 0x000fffff) | xdb_sup.i[LO]) != 0)) || ((xIntHi_sup >= SIMPLEOVERFLOWBOUND) && (xIntHi_sup >= 0x7ff00000) && (xdb_sup.i[HI] > 0)) || ((xIntHi_sup >= SIMPLEOVERFLOWBOUND) && (x_sup > OVERFLOWBOUND)) || (x_sup < MINUSONEBOUND) ,FALSE)) { ASSIGN_LOW(res,expm1_rd(LOW(x))); ASSIGN_UP(res,expm1_ru(UP(x))); return res; } if (__builtin_expect((xIntHi_inf < DIRECTINTERVALBOUND) && (xIntHi_sup < DIRECTINTERVALBOUND),TRUE)) { /* We approximate expm1 directly after a range reduction as follows expm1(x) = (expm1(x/2) + 2) * expm1(x/2) We perform the range reduction in such a way that finally |x| < 1/32 */ /* Extract the exponent of |x| and add 5 (2^5 = 32) */ expoX_inf = ((xIntHi_inf & 0x7ff00000) >> 20) - (1023 - 5); expoX_sup = ((xIntHi_sup & 0x7ff00000) >> 20) - (1023 - 5); /* If this particularily biased exponent expoX is negative, we are already less than 1/32 */ if (expoX_inf >= 0) { /* If we are here, we must perform range reduction */ /* We multiply x by 2^(-expoX-1) by bit manipulation x cannot be denormalized so there is no danger */ xdb_inf.i[HI] += (-expoX_inf-1) << 20; /* We reassign the new x and maintain xIntHi */ xIntHi_inf = xdb_inf.i[HI] & 0x7fffffff; x_inf = xdb_inf.d; } if (expoX_sup >= 0) { /* If we are here, we must perform range reduction */ /* We multiply x by 2^(-expoX-1) by bit manipulation x cannot be denormalized so there is no danger */ xdb_sup.i[HI] += (-expoX_sup-1) << 20; /* We reassign the new x and maintain xIntHi */ xIntHi_sup = xdb_sup.i[HI] & 0x7fffffff; x_sup = xdb_sup.d; } /* Here, we have always |x| < 1/32 */ /* Double precision evaluation steps and one double-double step */ Mul12(&xSqh_inf,&xSql_inf,x_inf,x_inf); Mul12(&xSqh_sup,&xSql_sup,x_sup,x_sup); #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) middlePoly_inf = FMA(quickDirectpolyC5h,x_inf,quickDirectpolyC4h); middlePoly_sup = FMA(quickDirectpolyC5h,x_sup,quickDirectpolyC4h); #else middlePoly_inf = quickDirectpolyC4h + x_inf * quickDirectpolyC5h; middlePoly_sup = quickDirectpolyC4h + x_sup * quickDirectpolyC5h; #endif doublePoly_inf = middlePoly_inf; doublePoly_sup = middlePoly_sup; /* Special path: for small |x| we can truncate the polynomial */ if (xIntHi_inf > SPECIALINTERVALBOUND) { #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly_inf = FMA(FMA(FMA(quickDirectpolyC9h ,x_inf,quickDirectpolyC8h),x_inf, quickDirectpolyC7h),x_inf,quickDirectpolyC6h); #else highPoly_inf = quickDirectpolyC6h + x_inf * (quickDirectpolyC7h + x_inf * ( quickDirectpolyC8h + x_inf * quickDirectpolyC9h)); #endif highPolyWithSquare_inf = xSqh_inf * highPoly_inf; doublePoly_inf = middlePoly_inf + highPolyWithSquare_inf; } if (xIntHi_sup > SPECIALINTERVALBOUND) { #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly_sup = FMA(FMA(FMA(quickDirectpolyC9h ,x_sup,quickDirectpolyC8h),x_sup, quickDirectpolyC7h),x_sup,quickDirectpolyC6h); #else highPoly_sup = quickDirectpolyC6h + x_sup * (quickDirectpolyC7h + x_sup * ( quickDirectpolyC8h + x_sup * quickDirectpolyC9h)); #endif highPolyWithSquare_sup = xSqh_sup * highPoly_sup; doublePoly_sup = middlePoly_sup + highPolyWithSquare_sup; } /* Double-double evaluation steps */ tt1h_inf = x_inf * doublePoly_inf; tt1h_sup = x_sup * doublePoly_sup; xSqHalfh_inf = 0.5 * xSqh_inf; xSqHalfh_sup = 0.5 * xSqh_sup; xSqHalfl_inf = 0.5 * xSql_inf; xSqHalfl_sup = 0.5 * xSql_sup; Add12(t2h_inf,templ_inf,x_inf,xSqHalfh_inf); Add12(t2h_sup,templ_sup,x_sup,xSqHalfh_sup); t2l_inf = templ_inf + xSqHalfl_inf; t2l_sup = templ_sup + xSqHalfl_sup; Add12(t1h_inf,t1l_inf,quickDirectpolyC3h,tt1h_inf); Add12(t1h_sup,t1l_sup,quickDirectpolyC3h,tt1h_sup); Mul122(&xCubeh_inf,&xCubel_inf,x_inf,xSqh_inf,xSql_inf); Mul122(&xCubeh_sup,&xCubel_sup,x_sup,xSqh_sup,xSql_sup); Mul22(&tt3h_inf,&tt3l_inf,xCubeh_inf,xCubel_inf,t1h_inf,t1l_inf); Mul22(&tt3h_sup,&tt3l_sup,xCubeh_sup,xCubel_sup,t1h_sup,t1l_sup); Add22(&polyh_inf,&polyl_inf,t2h_inf,t2l_inf,tt3h_inf,tt3l_inf); Add22(&polyh_sup,&polyl_sup,t2h_sup,t2l_sup,tt3h_sup,tt3l_sup); /* Reconstruction */ /* If we have not performed any range reduction, we have no reconstruction to do */ if (expoX_inf >= 0) { /* If we are here, we must perform reconstruction */ /* First reconstruction step */ Add12(r1h_inf,r1t_inf,2,polyh_inf); r1l_inf = r1t_inf + polyl_inf; Mul22(&rr1h_inf,&rr1l_inf,r1h_inf,r1l_inf,polyh_inf,polyl_inf); if (expoX_inf >= 1) { /* Second reconstruction step */ Add12(r2h_inf,r2t_inf,2,rr1h_inf); r2l_inf = r2t_inf + rr1l_inf; Mul22(&rr2h_inf,&rr2l_inf,r2h_inf,r2l_inf,rr1h_inf,rr1l_inf); if (expoX_inf >= 2) { /* Third reconstruction step */ Add12(r3h_inf,r3t_inf,2,rr2h_inf); r3l_inf = r3t_inf + rr2l_inf; Mul22(&rr3h_inf,&rr3l_inf,r3h_inf,r3l_inf,rr2h_inf,rr2l_inf); /* expoX may be maximally 2 */ expm1h_inf = rr3h_inf; expm1m_inf = rr3l_inf; } else { expm1h_inf = rr2h_inf; expm1m_inf = rr2l_inf; } } else { expm1h_inf = rr1h_inf; expm1m_inf = rr1l_inf; } } else { expm1h_inf = polyh_inf; expm1m_inf = polyl_inf; } if (expoX_sup >= 0) { /* If we are here, we must perform reconstruction */ /* First reconstruction step */ Add12(r1h_sup,r1t_sup,2,polyh_sup); r1l_sup = r1t_sup + polyl_sup; Mul22(&rr1h_sup,&rr1l_sup,r1h_sup,r1l_sup,polyh_sup,polyl_sup); if (expoX_sup >= 1) { /* Second reconstruction step */ Add12(r2h_sup,r2t_sup,2,rr1h_sup); r2l_sup = r2t_sup + rr1l_sup; Mul22(&rr2h_sup,&rr2l_sup,r2h_sup,r2l_sup,rr1h_sup,rr1l_sup); if (expoX_sup >= 2) { /* Third reconstruction step */ Add12(r3h_sup,r3t_sup,2,rr2h_sup); r3l_sup = r3t_sup + rr2l_sup; Mul22(&rr3h_sup,&rr3l_sup,r3h_sup,r3l_sup,rr2h_sup,rr2l_sup); /* expoX may be maximally 2 */ expm1h_sup = rr3h_sup; expm1m_sup = rr3l_sup; } else { expm1h_sup = rr2h_sup; expm1m_sup = rr2l_sup; } } else { expm1h_sup = rr1h_sup; expm1m_sup = rr1l_sup; } } else { expm1h_sup = polyh_sup; expm1m_sup = polyl_sup; } /* Rounding test */ TEST_AND_COPY_RDRU_EXPM1(roundable,restemp_inf,expm1h_inf, expm1m_inf, restemp_sup,expm1h_sup, expm1m_sup, ROUNDCSTDIRECTRD); if((roundable==2) || (roundable==0)) { expm1_direct_td(&expm1h_inf, &expm1m_inf, &expm1l_inf, x_inf, xSqHalfh_inf, xSqHalfl_inf, xSqh_inf, xSql_inf, expoX_inf); RoundDownwards3(&restemp_inf,expm1h_inf, expm1m_inf, expm1l_inf); } /* Accurate phase launched */ if((roundable==1) || (roundable==0)) { expm1_direct_td(&expm1h_sup, &expm1m_sup, &expm1l_sup, x_sup, xSqHalfh_sup, xSqHalfl_sup, xSqh_sup, xSql_sup, expoX_sup); RoundUpwards3(&restemp_sup,expm1h_sup, expm1m_sup, expm1l_sup); } /* Accurate phase launched */ ASSIGN_LOW(res,restemp_inf); ASSIGN_UP(res,restemp_sup); return res; } /* Test if we have |x| <= 1/4-1/2ulp(1/4) for knowing if we use exp(x) or approximate directly */ if (xIntHi_inf < DIRECTINTERVALBOUND) { /* We approximate expm1 directly after a range reduction as follows expm1(x) = (expm1(x/2) + 2) * expm1(x/2) We perform the range reduction in such a way that finally |x| < 1/32 */ /* Extract the exponent of |x| and add 5 (2^5 = 32) */ expoX_inf = ((xIntHi_inf & 0x7ff00000) >> 20) - (1023 - 5); /* If this particularily biased exponent expoX is negative, we are already less than 1/32 */ if (expoX_inf >= 0) { /* If we are here, we must perform range reduction */ /* We multiply x by 2^(-expoX-1) by bit manipulation x cannot be denormalized so there is no danger */ xdb_inf.i[HI] += (-expoX_inf-1) << 20; /* We reassign the new x and maintain xIntHi */ xIntHi_inf = xdb_inf.i[HI] & 0x7fffffff; x_inf = xdb_inf.d; } /* Here, we have always |x| < 1/32 */ /* Double precision evaluation steps and one double-double step */ Mul12(&xSqh_inf,&xSql_inf,x_inf,x_inf); #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) middlePoly_inf = FMA(quickDirectpolyC5h,x_inf,quickDirectpolyC4h); #else middlePoly_inf = quickDirectpolyC4h + x_inf * quickDirectpolyC5h; #endif doublePoly_inf = middlePoly_inf; /* Special path: for small |x| we can truncate the polynomial */ if (xIntHi_inf > SPECIALINTERVALBOUND) { #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly_inf = FMA(FMA(FMA(quickDirectpolyC9h ,x_inf,quickDirectpolyC8h),x_inf, quickDirectpolyC7h),x_inf,quickDirectpolyC6h); #else highPoly_inf = quickDirectpolyC6h + x_inf * (quickDirectpolyC7h + x_inf * ( quickDirectpolyC8h + x_inf * quickDirectpolyC9h)); #endif highPolyWithSquare_inf = xSqh_inf * highPoly_inf; doublePoly_inf = middlePoly_inf + highPolyWithSquare_inf; } /* Double-double evaluation steps */ tt1h_inf = x_inf * doublePoly_inf; xSqHalfh_inf = 0.5 * xSqh_inf; xSqHalfl_inf = 0.5 * xSql_inf; Add12(t2h_inf,templ_inf,x_inf,xSqHalfh_inf); t2l_inf = templ_inf + xSqHalfl_inf; Add12(t1h_inf,t1l_inf,quickDirectpolyC3h,tt1h_inf); Mul122(&xCubeh_inf,&xCubel_inf,x_inf,xSqh_inf,xSql_inf); Mul22(&tt3h_inf,&tt3l_inf,xCubeh_inf,xCubel_inf,t1h_inf,t1l_inf); Add22(&polyh_inf,&polyl_inf,t2h_inf,t2l_inf,tt3h_inf,tt3l_inf); /* Reconstruction */ /* If we have not performed any range reduction, we have no reconstruction to do */ if (expoX_inf >= 0) { /* If we are here, we must perform reconstruction */ /* First reconstruction step */ Add12(r1h_inf,r1t_inf,2,polyh_inf); r1l_inf = r1t_inf + polyl_inf; Mul22(&rr1h_inf,&rr1l_inf,r1h_inf,r1l_inf,polyh_inf,polyl_inf); if (expoX_inf >= 1) { /* Second reconstruction step */ Add12(r2h_inf,r2t_inf,2,rr1h_inf); r2l_inf = r2t_inf + rr1l_inf; Mul22(&rr2h_inf,&rr2l_inf,r2h_inf,r2l_inf,rr1h_inf,rr1l_inf); if (expoX_inf >= 2) { /* Third reconstruction step */ Add12(r3h_inf,r3t_inf,2,rr2h_inf); r3l_inf = r3t_inf + rr2l_inf; Mul22(&rr3h_inf,&rr3l_inf,r3h_inf,r3l_inf,rr2h_inf,rr2l_inf); /* expoX may be maximally 2 */ expm1h_inf = rr3h_inf; expm1m_inf = rr3l_inf; } else { expm1h_inf = rr2h_inf; expm1m_inf = rr2l_inf; } } else { expm1h_inf = rr1h_inf; expm1m_inf = rr1l_inf; } } else { expm1h_inf = polyh_inf; expm1m_inf = polyl_inf; } /* Rounding test */ infDone=1; TEST_AND_COPY_RD(roundable,restemp_inf,expm1h_inf, expm1m_inf, ROUNDCSTDIRECTRD); if(roundable==0) { expm1_direct_td(&expm1h_inf, &expm1m_inf, &expm1l_inf, x_inf, xSqHalfh_inf, xSqHalfl_inf, xSqh_inf, xSql_inf, expoX_inf); RoundDownwards3(&restemp_inf,expm1h_inf, expm1m_inf, expm1l_inf); } /* Accurate phase launched */ } /* Test if we have |x| <= 1/4-1/2ulp(1/4) for knowing if we use exp(x) or approximate directly */ if (xIntHi_sup < DIRECTINTERVALBOUND) { /* We approximate expm1 directly after a range reduction as follows expm1(x) = (expm1(x/2) + 2) * expm1(x/2) We perform the range reduction in such a way that finally |x| < 1/32 */ /* Extract the exponent of |x| and add 5 (2^5 = 32) */ expoX_sup = ((xIntHi_sup & 0x7ff00000) >> 20) - (1023 - 5); /* If this particularily biased exponent expoX is negative, we are already less than 1/32 */ if (expoX_sup >= 0) { /* If we are here, we must perform range reduction */ /* We multiply x by 2^(-expoX-1) by bit manipulation x cannot be denormalized so there is no danger */ xdb_sup.i[HI] += (-expoX_sup-1) << 20; /* We reassign the new x and maintain xIntHi */ xIntHi_sup = xdb_sup.i[HI] & 0x7fffffff; x_sup = xdb_sup.d; } /* Here, we have always |x| < 1/32 */ /* Double precision evaluation steps and one double-double step */ Mul12(&xSqh_sup,&xSql_sup,x_sup,x_sup); #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) middlePoly_sup = FMA(quickDirectpolyC5h,x_sup,quickDirectpolyC4h); #else middlePoly_sup = quickDirectpolyC4h + x_sup * quickDirectpolyC5h; #endif doublePoly_sup = middlePoly_sup; /* Special path: for small |x| we can truncate the polynomial */ if (xIntHi_sup > SPECIALINTERVALBOUND) { #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly_sup = FMA(FMA(FMA(quickDirectpolyC9h ,x_sup,quickDirectpolyC8h),x_sup, quickDirectpolyC7h),x_sup,quickDirectpolyC6h); #else highPoly_sup = quickDirectpolyC6h + x_sup * (quickDirectpolyC7h + x_sup * ( quickDirectpolyC8h + x_sup * quickDirectpolyC9h)); #endif highPolyWithSquare_sup = xSqh_sup * highPoly_sup; doublePoly_sup = middlePoly_sup + highPolyWithSquare_sup; } /* Double-double evaluation steps */ tt1h_sup = x_sup * doublePoly_sup; xSqHalfh_sup = 0.5 * xSqh_sup; xSqHalfl_sup = 0.5 * xSql_sup; Add12(t2h_sup,templ_sup,x_sup,xSqHalfh_sup); t2l_sup = templ_sup + xSqHalfl_sup; Add12(t1h_sup,t1l_sup,quickDirectpolyC3h,tt1h_sup); Mul122(&xCubeh_sup,&xCubel_sup,x_sup,xSqh_sup,xSql_sup); Mul22(&tt3h_sup,&tt3l_sup,xCubeh_sup,xCubel_sup,t1h_sup,t1l_sup); Add22(&polyh_sup,&polyl_sup,t2h_sup,t2l_sup,tt3h_sup,tt3l_sup); /* Reconstruction */ /* If we have not performed any range reduction, we have no reconstruction to do */ if (expoX_sup >= 0) { /* If we are here, we must perform reconstruction */ /* First reconstruction step */ Add12(r1h_sup,r1t_sup,2,polyh_sup); r1l_sup = r1t_sup + polyl_sup; Mul22(&rr1h_sup,&rr1l_sup,r1h_sup,r1l_sup,polyh_sup,polyl_sup); if (expoX_sup >= 1) { /* Second reconstruction step */ Add12(r2h_sup,r2t_sup,2,rr1h_sup); r2l_sup = r2t_sup + rr1l_sup; Mul22(&rr2h_sup,&rr2l_sup,r2h_sup,r2l_sup,rr1h_sup,rr1l_sup); if (expoX_sup >= 2) { /* Third reconstruction step */ Add12(r3h_sup,r3t_sup,2,rr2h_sup); r3l_sup = r3t_sup + rr2l_sup; Mul22(&rr3h_sup,&rr3l_sup,r3h_sup,r3l_sup,rr2h_sup,rr2l_sup); /* expoX may be maximally 2 */ expm1h_sup = rr3h_sup; expm1m_sup = rr3l_sup; } else { expm1h_sup = rr2h_sup; expm1m_sup = rr2l_sup; } } else { expm1h_sup = rr1h_sup; expm1m_sup = rr1l_sup; } } else { expm1h_sup = polyh_sup; expm1m_sup = polyl_sup; } /* Rounding test */ supDone=1; TEST_AND_COPY_RU(roundable,restemp_sup,expm1h_sup, expm1m_sup, ROUNDCSTDIRECTRD); if(roundable==0) { expm1_direct_td(&expm1h_sup, &expm1m_sup, &expm1l_sup, x_sup, xSqHalfh_sup, xSqHalfl_sup, xSqh_sup, xSql_sup, expoX_sup); RoundUpwards3(&restemp_sup,expm1h_sup, expm1m_sup, expm1l_sup); } /* Accurate phase launched */ } if((infDone==0) && (supDone==0)) { /* If we are here, we can use expm1(x) = exp(x) - 1 */ /* Range reduction - exact part: compute k as double and as int */ xMultLog2InvMult2L_inf = x_inf * log2InvMult2L; xMultLog2InvMult2L_sup = x_sup * log2InvMult2L; shiftedXMult_inf = xMultLog2InvMult2L_inf + shiftConst; shiftedXMult_sup = xMultLog2InvMult2L_sup + shiftConst; kd_inf = shiftedXMult_inf - shiftConst; kd_sup = shiftedXMult_sup - shiftConst; shiftedXMultdb_inf.d = shiftedXMult_inf; shiftedXMultdb_sup.d = shiftedXMult_sup; k_inf = shiftedXMultdb_inf.i[LO]; k_sup = shiftedXMultdb_sup.i[LO]; M_inf = k_inf >> 12; M_sup = k_sup >> 12; index1_inf = k_inf & INDEXMASK1; index1_sup = k_sup & INDEXMASK1; index2_inf = (k_inf & INDEXMASK2) >> 6; index2_sup = (k_sup & INDEXMASK2) >> 6; /* Range reduction - part affected by error - must be redone in accurate phase */ Mul12(&s1_inf,&s2_inf,msLog2Div2Lh,kd_inf); Mul12(&s1_sup,&s2_sup,msLog2Div2Lh,kd_sup); s3_inf = kd_inf * msLog2Div2Lm; s3_sup = kd_sup * msLog2Div2Lm; s4_inf = s2_inf + s3_inf; s4_sup = s2_sup + s3_sup; s5_inf = x_inf + s1_inf; s5_sup = x_sup + s1_sup; Add12Cond(rh_inf,rm_inf,s5_inf,s4_inf); Add12Cond(rh_sup,rm_sup,s5_sup,s4_sup); /* Table reads - read only two double-doubles by now */ tbl1h_inf = twoPowerIndex1[index1_inf].hi; tbl1h_sup = twoPowerIndex1[index1_sup].hi; tbl1m_inf = twoPowerIndex1[index1_inf].mi; tbl1m_sup = twoPowerIndex1[index1_sup].mi; tbl2h_inf = twoPowerIndex2[index2_inf].hi; tbl2h_sup = twoPowerIndex2[index2_sup].hi; tbl2m_inf = twoPowerIndex2[index2_inf].mi; tbl2m_sup = twoPowerIndex2[index2_sup].mi; /* Quick phase starts here */ rhSquare_inf = rh_inf * rh_inf; rhSquare_sup = rh_sup * rh_sup; rhC3_inf = quickCommonpolyC3h * rh_inf; rhC3_sup = quickCommonpolyC3h * rh_sup; rhSquareHalf_inf = 0.5 * rhSquare_inf; rhSquareHalf_sup = 0.5 * rhSquare_sup; monomialCube_inf = rhC3_inf * rhSquare_inf; monomialCube_sup = rhC3_sup * rhSquare_sup; rhFour_inf = rhSquare_inf * rhSquare_inf; rhFour_sup = rhSquare_sup * rhSquare_sup; monomialFour_inf = quickCommonpolyC4h * rhFour_inf; monomialFour_sup = quickCommonpolyC4h * rhFour_sup; highPoly_inf = monomialCube_inf + monomialFour_inf; highPoly_sup = monomialCube_sup + monomialFour_sup; highPolyWithSquare_inf = rhSquareHalf_inf + highPoly_inf; highPolyWithSquare_sup = rhSquareHalf_sup + highPoly_sup; /* Reconstruction: integration of table values */ Mul22(&tablesh_inf,&tablesl_inf,tbl1h_inf,tbl1m_inf,tbl2h_inf,tbl2m_inf); Mul22(&tablesh_sup,&tablesl_sup,tbl1h_sup,tbl1m_sup,tbl2h_sup,tbl2m_sup); t8_inf = rm_inf + highPolyWithSquare_inf; t8_sup = rm_sup + highPolyWithSquare_sup; t9_inf = rh_inf + t8_inf; t9_sup = rh_sup + t8_sup; t10_inf = tablesh_inf * t9_inf; t10_sup = tablesh_sup * t9_sup; Add12(t11_inf,t12_inf,tablesh_inf,t10_inf); Add12(t11_sup,t12_sup,tablesh_sup,t10_sup); t13_inf = t12_inf + tablesl_inf; t13_sup = t12_sup + tablesl_sup; Add12(polyTblhdb_inf.d,polyTblmdb_inf.d,t11_inf,t13_inf); Add12(polyTblhdb_sup.d,polyTblmdb_sup.d,t11_sup,t13_sup); /* Reconstruction: multiplication by 2^M */ /* Implement the multiplication by addition to overcome the problem of the non-representability of 2^1024 (M = 1024) This case is possible if polyTblhdb.d < 1 */ polyTblhdb_inf.i[HI] += M_inf << 20; polyTblhdb_sup.i[HI] += M_sup << 20; if(polyTblmdb_inf.d!=0.0) /* predicted true, but it happens for x=-4.1588039009762204, thanks Morten */ polyTblmdb_inf.i[HI] += M_inf << 20; if(polyTblmdb_sup.d!=0.0) /* predicted true, but it happens for x=-4.1588039009762204, thanks Morten */ polyTblmdb_sup.i[HI] += M_sup << 20; exph_inf = polyTblhdb_inf.d; exph_sup = polyTblhdb_sup.d; expm_inf = polyTblmdb_inf.d; expm_sup = polyTblmdb_sup.d; /* Subtraction of 1 Testing if the operation is necessary is more expensive than performing it in any case. We may cancellate at most 2 bits in the subtraction for arguments 1/4 <= x <= ln(2) (0.25 <= x <= 0.69) We must therefore use conditional Add12s Since we perform a subtraction, we may not have addition overflow towards +inf */ Add12Cond(t1_inf,t2_inf,-1,exph_inf); Add12Cond(t1_sup,t2_sup,-1,exph_sup); t3_inf = t2_inf + expm_inf; t3_sup = t2_sup + expm_sup; Add12Cond(expm1h_inf,expm1m_inf,t1_inf,t3_inf); Add12Cond(expm1h_sup,expm1m_sup,t1_sup,t3_sup); /* Rounding test */ TEST_AND_COPY_RDRU_EXPM1(roundable,res_inf,expm1h_inf, expm1m_inf, res_sup,expm1h_sup, expm1m_sup, ROUNDCSTCOMMONRD); if((roundable==2) || (roundable==0)) { /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh_inf,&msLog2Div2LMultKm_inf,&msLog2Div2LMultKl_inf,kd_inf,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1_inf = x_inf + msLog2Div2LMultKh_inf; Add12Cond(rh_inf,t2_inf,t1_inf,msLog2Div2LMultKm_inf); Add12Cond(rm_inf,rl_inf,t2_inf,msLog2Div2LMultKl_inf); /* Table reads for accurate phase */ tbl1l_inf = twoPowerIndex1[index1_inf].lo; tbl2l_inf = twoPowerIndex2[index2_inf].lo; /* Call accurate phase */ expm1_common_td(&expm1h_inf, &expm1m_inf, &expm1l_inf, rh_inf, rm_inf, rl_inf, tbl1h_inf, tbl1m_inf, tbl1l_inf, tbl2h_inf, tbl2m_inf, tbl2l_inf, M_inf); /* Final rounding */ RoundDownwards3(&res_inf,expm1h_inf, expm1m_inf, expm1l_inf); } /* Accurate phase launched */ if((roundable==1) || (roundable==0)) { /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh_sup,&msLog2Div2LMultKm_sup,&msLog2Div2LMultKl_sup,kd_sup,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1_sup = x_sup + msLog2Div2LMultKh_sup; Add12Cond(rh_sup,t2_sup,t1_sup,msLog2Div2LMultKm_sup); Add12Cond(rm_sup,rl_sup,t2_sup,msLog2Div2LMultKl_sup); /* Table reads for accurate phase */ tbl1l_sup = twoPowerIndex1[index1_sup].lo; tbl2l_sup = twoPowerIndex2[index2_sup].lo; /* Call accurate phase */ expm1_common_td(&expm1h_sup, &expm1m_sup, &expm1l_sup, rh_sup, rm_sup, rl_sup, tbl1h_sup, tbl1m_sup, tbl1l_sup, tbl2h_sup, tbl2m_sup, tbl2l_sup, M_sup); /* Final rounding */ RoundUpwards3(&res_sup,expm1h_sup, expm1m_sup, expm1l_sup); } /* Accurate phase launched */ ASSIGN_LOW(res,res_inf); ASSIGN_UP(res,res_sup); return res; } if((supDone==1)) { /* If we are here, we can use expm1(x) = exp(x) - 1 */ /* Range reduction - exact part: compute k as double and as int */ xMultLog2InvMult2L_inf = x_inf * log2InvMult2L; shiftedXMult_inf = xMultLog2InvMult2L_inf + shiftConst; kd_inf = shiftedXMult_inf - shiftConst; shiftedXMultdb_inf.d = shiftedXMult_inf; k_inf = shiftedXMultdb_inf.i[LO]; M_inf = k_inf >> 12; index1_inf = k_inf & INDEXMASK1; index2_inf = (k_inf & INDEXMASK2) >> 6; /* Range reduction - part affected by error - must be redone in accurate phase */ Mul12(&s1_inf,&s2_inf,msLog2Div2Lh,kd_inf); s3_inf = kd_inf * msLog2Div2Lm; s4_inf = s2_inf + s3_inf; s5_inf = x_inf + s1_inf; Add12Cond(rh_inf,rm_inf,s5_inf,s4_inf); /* Table reads - read only two double-doubles by now */ tbl1h_inf = twoPowerIndex1[index1_inf].hi; tbl1m_inf = twoPowerIndex1[index1_inf].mi; tbl2h_inf = twoPowerIndex2[index2_inf].hi; tbl2m_inf = twoPowerIndex2[index2_inf].mi; /* Quick phase starts here */ rhSquare_inf = rh_inf * rh_inf; rhC3_inf = quickCommonpolyC3h * rh_inf; rhSquareHalf_inf = 0.5 * rhSquare_inf; monomialCube_inf = rhC3_inf * rhSquare_inf; rhFour_inf = rhSquare_inf * rhSquare_inf; monomialFour_inf = quickCommonpolyC4h * rhFour_inf; highPoly_inf = monomialCube_inf + monomialFour_inf; highPolyWithSquare_inf = rhSquareHalf_inf + highPoly_inf; /* Reconstruction: integration of table values */ Mul22(&tablesh_inf,&tablesl_inf,tbl1h_inf,tbl1m_inf,tbl2h_inf,tbl2m_inf); t8_inf = rm_inf + highPolyWithSquare_inf; t9_inf = rh_inf + t8_inf; t10_inf = tablesh_inf * t9_inf; Add12(t11_inf,t12_inf,tablesh_inf,t10_inf); t13_inf = t12_inf + tablesl_inf; Add12(polyTblhdb_inf.d,polyTblmdb_inf.d,t11_inf,t13_inf); /* Reconstruction: multiplication by 2^M */ /* Implement the multiplication by addition to overcome the problem of the non-representability of 2^1024 (M = 1024) This case is possible if polyTblhdb.d < 1 */ polyTblhdb_inf.i[HI] += M_inf << 20; if(polyTblmdb_inf.d!=0.0) /* predicted true, but it happens for x=-4.1588039009762204, thanks Morten */ polyTblmdb_inf.i[HI] += M_inf << 20; exph_inf = polyTblhdb_inf.d; expm_inf = polyTblmdb_inf.d; /* Subtraction of 1 Testing if the operation is necessary is more expensive than performing it in any case. We may cancellate at most 2 bits in the subtraction for arguments 1/4 <= x <= ln(2) (0.25 <= x <= 0.69) We must therefore use conditional Add12s Since we perform a subtraction, we may not have addition overflow towards +inf */ Add12Cond(t1_inf,t2_inf,-1,exph_inf); t3_inf = t2_inf + expm_inf; Add12Cond(expm1h_inf,expm1m_inf,t1_inf,t3_inf); /* Rounding test */ TEST_AND_COPY_RD(roundable,res_inf,expm1h_inf, expm1m_inf, ROUNDCSTCOMMONRD); if(roundable==0) { /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh_inf,&msLog2Div2LMultKm_inf,&msLog2Div2LMultKl_inf,kd_inf,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1_inf = x_inf + msLog2Div2LMultKh_inf; Add12Cond(rh_inf,t2_inf,t1_inf,msLog2Div2LMultKm_inf); Add12Cond(rm_inf,rl_inf,t2_inf,msLog2Div2LMultKl_inf); /* Table reads for accurate phase */ tbl1l_inf = twoPowerIndex1[index1_inf].lo; tbl2l_inf = twoPowerIndex2[index2_inf].lo; /* Call accurate phase */ expm1_common_td(&expm1h_inf, &expm1m_inf, &expm1l_inf, rh_inf, rm_inf, rl_inf, tbl1h_inf, tbl1m_inf, tbl1l_inf, tbl2h_inf, tbl2m_inf, tbl2l_inf, M_inf); /* Final rounding */ RoundDownwards3(&res_inf,expm1h_inf, expm1m_inf, expm1l_inf); } /* Accurate phase launched */ } if(infDone==1) { /* If we are here, we can use expm1(x) = exp(x) - 1 */ /* Range reduction - exact part: compute k as double and as int */ xMultLog2InvMult2L_sup = x_sup * log2InvMult2L; shiftedXMult_sup = xMultLog2InvMult2L_sup + shiftConst; kd_sup = shiftedXMult_sup - shiftConst; shiftedXMultdb_sup.d = shiftedXMult_sup; k_sup = shiftedXMultdb_sup.i[LO]; M_sup = k_sup >> 12; index1_sup = k_sup & INDEXMASK1; index2_sup = (k_sup & INDEXMASK2) >> 6; /* Range reduction - part affected by error - must be redone in accurate phase */ Mul12(&s1_sup,&s2_sup,msLog2Div2Lh,kd_sup); s3_sup = kd_sup * msLog2Div2Lm; s4_sup = s2_sup + s3_sup; s5_sup = x_sup + s1_sup; Add12Cond(rh_sup,rm_sup,s5_sup,s4_sup); /* Table reads - read only two double-doubles by now */ tbl1h_sup = twoPowerIndex1[index1_sup].hi; tbl1m_sup = twoPowerIndex1[index1_sup].mi; tbl2h_sup = twoPowerIndex2[index2_sup].hi; tbl2m_sup = twoPowerIndex2[index2_sup].mi; /* Quick phase starts here */ rhSquare_sup = rh_sup * rh_sup; rhC3_sup = quickCommonpolyC3h * rh_sup; rhSquareHalf_sup = 0.5 * rhSquare_sup; monomialCube_sup = rhC3_sup * rhSquare_sup; rhFour_sup = rhSquare_sup * rhSquare_sup; monomialFour_sup = quickCommonpolyC4h * rhFour_sup; highPoly_sup = monomialCube_sup + monomialFour_sup; highPolyWithSquare_sup = rhSquareHalf_sup + highPoly_sup; /* Reconstruction: integration of table values */ Mul22(&tablesh_sup,&tablesl_sup,tbl1h_sup,tbl1m_sup,tbl2h_sup,tbl2m_sup); t8_sup = rm_sup + highPolyWithSquare_sup; t9_sup = rh_sup + t8_sup; t10_sup = tablesh_sup * t9_sup; Add12(t11_sup,t12_sup,tablesh_sup,t10_sup); t13_sup = t12_sup + tablesl_sup; Add12(polyTblhdb_sup.d,polyTblmdb_sup.d,t11_sup,t13_sup); /* Reconstruction: multiplication by 2^M */ /* Implement the multiplication by addition to overcome the problem of the non-representability of 2^1024 (M = 1024) This case is possible if polyTblhdb.d < 1 */ polyTblhdb_sup.i[HI] += M_sup << 20; if(polyTblmdb_sup.d!=0.0) /* predicted true, but it happens for x=-4.1588039009762204, thanks Morten */ polyTblmdb_sup.i[HI] += M_sup << 20; exph_sup = polyTblhdb_sup.d; expm_sup = polyTblmdb_sup.d; /* Subtraction of 1 Testing if the operation is necessary is more expensive than performing it in any case. We may cancellate at most 2 bits in the subtraction for arguments 1/4 <= x <= ln(2) (0.25 <= x <= 0.69) We must therefore use conditional Add12s Since we perform a subtraction, we may not have addition overflow towards +inf */ Add12Cond(t1_sup,t2_sup,-1,exph_sup); t3_sup = t2_sup + expm_sup; Add12Cond(expm1h_sup,expm1m_sup,t1_sup,t3_sup); /* Rounding test */ TEST_AND_COPY_RU(roundable,res_sup,expm1h_sup, expm1m_sup, ROUNDCSTCOMMONRD); if(roundable==0) { /* Rest of argument reduction for accurate phase */ Mul133(&msLog2Div2LMultKh_sup,&msLog2Div2LMultKm_sup,&msLog2Div2LMultKl_sup,kd_sup,msLog2Div2Lh,msLog2Div2Lm,msLog2Div2Ll); t1_sup = x_sup + msLog2Div2LMultKh_sup; Add12Cond(rh_sup,t2_sup,t1_sup,msLog2Div2LMultKm_sup); Add12Cond(rm_sup,rl_sup,t2_sup,msLog2Div2LMultKl_sup); /* Table reads for accurate phase */ tbl1l_sup = twoPowerIndex1[index1_sup].lo; tbl2l_sup = twoPowerIndex2[index2_sup].lo; /* Call accurate phase */ expm1_common_td(&expm1h_sup, &expm1m_sup, &expm1l_sup, rh_sup, rm_sup, rl_sup, tbl1h_sup, tbl1m_sup, tbl1l_sup, tbl2h_sup, tbl2m_sup, tbl2l_sup, M_sup); /* Final rounding */ RoundUpwards3(&res_sup,expm1h_sup, expm1m_sup, expm1l_sup); } /* Accurate phase launched */ } if (infDone==1) res_inf=restemp_inf; if (supDone==1) res_sup=restemp_sup; ASSIGN_LOW(res,res_inf); ASSIGN_UP(res,res_sup); return res; } #endif interval-2.1.0/src/crlibm/expm1.h0000644000000000000000000011756113031036767014747 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" /* File generated by maple/expm1.mpl */ #define log2InvMult2L 5.90927888748119403317105025053024291992187500000000e+03 #define msLog2Div2Lh -1.69225385878892892145206050535932718048570677638054e-04 #define msLog2Div2Lm -5.66173538536694228129338642508144915789549786200850e-21 #define msLog2Div2Ll -1.39348350547270802387134479195513221596886344528448e-37 #define shiftConst 6.75539944105574400000000000000000000000000000000000e+15 #define INDEXMASK1 0x0000003f #define INDEXMASK2 0x00000fc0 #define RETURNXBOUND 0x3c900000 #define OVERFLOWBOUND 7.09782712893383973096206318587064743041992187500000e+02 #define LARGEST 1.79769313486231570814527423731704356798070567525845e+308 #define SMALLEST 4.94065645841246544176568792868221372365059802614325e-324 #define MINUSONEBOUND -3.74299477502370478987359092570841312408447265625000e+01 #define SIMPLEOVERFLOWBOUND 0x40862e42 #define DIRECTINTERVALBOUND 0x3fd00000 #define SPECIALINTERVALBOUND 0x3f300000 #define ROUNDCSTDIRECTRN 1.00392156862745109185069459291432461909707184007331e+00 #define ROUNDCSTDIRECTRD 2.16840434497100886801490560173988342285156250000000e-19 #define ROUNDCSTCOMMONRN 1.00392156862745109185069459291432461909707184007331e+00 #define ROUNDCSTCOMMONRD 2.16840434497100886801490560173988342285156250000000e-19 #define MINUSONEPLUSONEULP -9.99999999999999888977697537484345957636833190917969e-01 #define quickDirectpolyC3h 1.66666666666666657414808128123695496469736099243164e-01 #define quickDirectpolyC4h 4.16666666666666921092776476598373847082257270812988e-02 #define quickDirectpolyC5h 8.33333333340913022524443221072942833416163921356201e-03 #define quickDirectpolyC6h 1.38888888866754321368968128069809608859941363334656e-03 #define quickDirectpolyC7h 1.98412543160940484055984600608724122139392420649528e-04 #define quickDirectpolyC8h 2.48020519562457199031109411624385074901510961353779e-05 #define quickDirectpolyC9h 2.84660857362219107811367527216539485834800871089101e-06 #define accuDirectpolyC3h 1.66666666666666657414808128123695496469736099243164e-01 #define accuDirectpolyC3m 9.25185853854297065661561206416060845590588197735272e-18 #define accuDirectpolyC3l 5.13581650457284662711479178584444638962917803311780e-34 #define accuDirectpolyC4h 4.16666666666666643537020320309238741174340248107910e-02 #define accuDirectpolyC4m 2.31296463463574227896791413859298150278088197735272e-18 #define accuDirectpolyC5h 8.33333333333333321768510160154619370587170124053955e-03 #define accuDirectpolyC5m 1.15648231731787113948395706929649075139044098867636e-19 #define accuDirectpolyC6h 1.38888888888888894189432843262466121814213693141937e-03 #define accuDirectpolyC6m -5.30054395357292524960423423338339636695154423835845e-20 #define accuDirectpolyC7h 1.98412698412698412526317115478491359681356698274612e-04 #define accuDirectpolyC7m 1.72095583354814495137206233661964154177299630853468e-22 #define accuDirectpolyC8h 2.48015873015873015657896394348114199601695872843266e-05 #define accuDirectpolyC8m 2.14651941309384838916703253244235321323283349969089e-23 #define accuDirectpolyC9h 2.75573192239858925109505932704578867742384318262339e-06 #define accuDirectpolyC9m -1.85841997665354272936683956225603122653869677259213e-22 #define accuDirectpolyC10h 2.75573192239859041576536180170875489636728161713108e-07 #define accuDirectpolyC11h 2.50521083854417268413110797455750633488946732541081e-08 #define accuDirectpolyC12h 2.08767569858109971289062132052388037761758710075810e-09 #define accuDirectpolyC13h 1.60590438355780403477083534013894559194790545575415e-10 #define accuDirectpolyC14h 1.14709032708663011999233928519882120839606942652722e-11 #define accuDirectpolyC15h 7.64725827750169879636792489069881340263759583741887e-13 #define quickCommonpolyC3h 1.66666666696497350885763921723992098122835159301758e-01 #define quickCommonpolyC4h 4.16666666766102242180913606262038229033350944519043e-02 #define accuCommonpolyC3h 1.66666666666666657414808128123695496469736099243164e-01 #define accuCommonpolyC3m 9.25185853866467248091737476239823936927135463652392e-18 #define accuCommonpolyC4h 4.16666666666666643537020320309238741174340248107910e-02 #define accuCommonpolyC4m 2.31256737150511109641969514308685693497248293481702e-18 #define accuCommonpolyC5h 8.33333333333333321768510160154619370587170124053955e-03 #define accuCommonpolyC6h 1.38888888911084334119860894674047813168726861476898e-03 #define accuCommonpolyC7h 1.98412713635391310413452758965036082372535020112991e-04 typedef struct tPi_t_tag {double hi; double mi; double lo;} tPi_t; static const tPi_t twoPowerIndex1[64] = { { 1.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex1hi[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex1mi[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex1lo[0] */ } , { 1.00016923970530213772178740327944979071617126464844e+00, /* twoPowerIndex1hi[1] */ 9.33618533547846199388179470637929281332443150415515e-17, /* twoPowerIndex1mi[1] */ 3.77297954885090084710073756456287936644477196404411e-33, /* twoPowerIndex1lo[1] */ } , { 1.00033850805268231809463941317517310380935668945312e+00, /* twoPowerIndex1hi[2] */ -5.14133393131895706530678267769194263660821897510018e-18, /* twoPowerIndex1mi[2] */ 3.65532984508913994275805274025238001612209382982528e-34, /* twoPowerIndex1lo[2] */ } , { 1.00050780504698755279946453811135143041610717773438e+00, /* twoPowerIndex1hi[3] */ 6.96242402202057255168575283120383384543281723609229e-17, /* twoPowerIndex1mi[3] */ 5.20646484360987194687938744912769762301408608274186e-34, /* twoPowerIndex1lo[3] */ } , { 1.00067713069306640782940576173132285475730895996094e+00, /* twoPowerIndex1hi[4] */ -5.11512329768566763581175858027414623025077801052578e-17, /* twoPowerIndex1mi[4] */ 6.98198098827029289611306311409722598417652045670746e-34, /* twoPowerIndex1lo[4] */ } , { 1.00084648499576744917760606767842546105384826660156e+00, /* twoPowerIndex1hi[5] */ 8.42299002458648658027371639395540881533737558365359e-17, /* twoPowerIndex1mi[5] */ 2.36970468083963275494383447607242933566525306383712e-33, /* twoPowerIndex1lo[5] */ } , { 1.00101586795994101919404783984646201133728027343750e+00, /* twoPowerIndex1hi[6] */ -2.82452207477616780689379931990767172214919031737312e-17, /* twoPowerIndex1mi[6] */ -1.95728551891328398835983018867545661396300096090192e-33, /* twoPowerIndex1lo[6] */ } , { 1.00118527959043746022871346212923526763916015625000e+00, /* twoPowerIndex1hi[7] */ -7.18042456559213166577815896739695813826899291527385e-17, /* twoPowerIndex1mi[7] */ -4.76259460142737667571053552520587169925041399888400e-33, /* twoPowerIndex1lo[7] */ } , { 1.00135471989210822485460994357708841562271118164062e+00, /* twoPowerIndex1hi[8] */ -1.89737284167929933536294189134998232481318340155287e-17, /* twoPowerIndex1mi[8] */ -1.14644761608474571162584330231223616391499645510675e-34, /* twoPowerIndex1lo[8] */ } , { 1.00152418886980565382316399336559697985649108886719e+00, /* twoPowerIndex1hi[9] */ 9.06044106726912172835402556659442028244667434824268e-17, /* twoPowerIndex1mi[9] */ -9.28795936877474030548429956901821606468166518236870e-34, /* twoPowerIndex1lo[9] */ } , { 1.00169368652838319810882694582687690854072570800781e+00, /* twoPowerIndex1hi[10] */ -7.17327634990031997530849131951948428542423257707819e-17, /* twoPowerIndex1mi[10] */ 6.07647560689104755979568262152596670382288431776872e-33, /* twoPowerIndex1lo[10] */ } , { 1.00186321287269430868605013529304414987564086914062e+00, /* twoPowerIndex1hi[11] */ -1.33071962467226606689858482393149015112554043251841e-17, /* twoPowerIndex1mi[11] */ -3.85443386097781554341108465500150047004226523597749e-34, /* twoPowerIndex1lo[11] */ } , { 1.00203276790759399084151937131537124514579772949219e+00, /* twoPowerIndex1hi[12] */ 2.57269259432211179649018725316354562817431777421067e-17, /* twoPowerIndex1mi[12] */ 6.79751255613789265201334995370535043187556454092516e-34, /* twoPowerIndex1lo[12] */ } , { 1.00220235163793791599573523853905498981475830078125e+00, /* twoPowerIndex1hi[13] */ -3.92993778548451720552933864302152846562830407163222e-17, /* twoPowerIndex1mi[13] */ 2.22740945016647607963332576015739728975193247400334e-33, /* twoPowerIndex1lo[13] */ } , { 1.00237196406858219965840817167190834879875183105469e+00, /* twoPowerIndex1hi[14] */ 8.46137724799471749932697856411684097253648908880386e-17, /* twoPowerIndex1mi[14] */ -1.15795350476069740873680647805085951983720786847012e-33, /* twoPowerIndex1lo[14] */ } , { 1.00254160520438451165148308064090088009834289550781e+00, /* twoPowerIndex1hi[15] */ -4.19488324163994025318330321149973224973566383682287e-17, /* twoPowerIndex1mi[15] */ -1.10867727371575753136248480661711257993643946476249e-33, /* twoPowerIndex1lo[15] */ } , { 1.00271127505020252179690487537300214171409606933594e+00, /* twoPowerIndex1hi[16] */ -3.63661592869226394431650732319448247819940912156384e-17, /* twoPowerIndex1mi[16] */ -6.58076018413558386665763067745208065096307047224855e-34, /* twoPowerIndex1lo[16] */ } , { 1.00288097361089523218424801598303020000457763671875e+00, /* twoPowerIndex1hi[17] */ -2.61094406324393831074545742903203024867557691172893e-17, /* twoPowerIndex1mi[17] */ 1.20560913995705683042979390390212408639703633013464e-33, /* twoPowerIndex1lo[17] */ } , { 1.00305070089132231103690173767972737550735473632812e+00, /* twoPowerIndex1hi[18] */ 1.75307847798233211014008193947934807324617806015147e-17, /* twoPowerIndex1mi[18] */ 1.13393213893456062969952574781413432615748154285102e-33, /* twoPowerIndex1lo[18] */ } , { 1.00322045689634431475667497579706832766532897949219e+00, /* twoPowerIndex1hi[19] */ 5.75392352562826744411122442879351687879645730521252e-17, /* twoPowerIndex1mi[19] */ -2.67723202763627633853056570968049475423332897231238e-33, /* twoPowerIndex1lo[19] */ } , { 1.00339024163082268792379636579426005482673645019531e+00, /* twoPowerIndex1hi[20] */ -8.68492200511795617368964392061338881522209699276521e-18, /* twoPowerIndex1mi[20] */ -3.48402050975972235345434529928044249018150775634918e-34, /* twoPowerIndex1lo[20] */ } , { 1.00356005509961931920770439319312572479248046875000e+00, /* twoPowerIndex1hi[21] */ 9.49003543098177759384527648244793376993805358019830e-17, /* twoPowerIndex1mi[21] */ -2.72838479693459377473949067074824993718971708464416e-34, /* twoPowerIndex1lo[21] */ } , { 1.00372989730759765159007201873464509844779968261719e+00, /* twoPowerIndex1hi[22] */ -8.71038060581842237129503222771273097866222639659196e-17, /* twoPowerIndex1mi[22] */ 1.08618280977421918449964280592134822915254002216492e-33, /* twoPowerIndex1lo[22] */ } , { 1.00389976825962090600796727812848985195159912109375e+00, /* twoPowerIndex1hi[23] */ 3.49589169585715450145113080496294928974704413200507e-17, /* twoPowerIndex1mi[23] */ -2.94144759791575889018758341844218078845293410867033e-33, /* twoPowerIndex1lo[23] */ } , { 1.00406966796055407975529760733479633927345275878906e+00, /* twoPowerIndex1hi[24] */ 9.75378754984024099793268477195846557070899843396028e-17, /* twoPowerIndex1mi[24] */ 5.64300142720863839874652371486135387544215443970822e-33, /* twoPowerIndex1lo[24] */ } , { 1.00423959641526283625978521740762516856193542480469e+00, /* twoPowerIndex1hi[25] */ -1.05762211962928569325595987354393790031696252155330e-16, /* twoPowerIndex1mi[25] */ 5.83707943855262433756426258532402998630656838432942e-33, /* twoPowerIndex1lo[25] */ } , { 1.00440955362861283894915231940103694796562194824219e+00, /* twoPowerIndex1hi[26] */ 4.20918873812712592966120368574870018412444102186114e-17, /* twoPowerIndex1mi[26] */ 2.17971061415864797757688538084764343153482363480001e-33, /* twoPowerIndex1lo[26] */ } , { 1.00457953960547174965256544965086504817008972167969e+00, /* twoPowerIndex1hi[27] */ -1.67001668575547876279593068362269006396955075031486e-17, /* twoPowerIndex1mi[27] */ 8.56552273127180632250100064178508499726804497630949e-34, /* twoPowerIndex1lo[27] */ } , { 1.00474955435070723019919114449294283986091613769531e+00, /* twoPowerIndex1hi[28] */ -1.62314635541245143576050143734168865049382925451905e-17, /* twoPowerIndex1mi[28] */ 9.28530603331304279248127378347521992965436217888846e-35, /* twoPowerIndex1lo[28] */ } , { 1.00491959786918805264122056541964411735534667968750e+00, /* twoPowerIndex1hi[29] */ 2.30285392780281171183781407072193459566423534757738e-17, /* twoPowerIndex1mi[29] */ -4.94345170697772961451844215454960159293576885861471e-34, /* twoPowerIndex1lo[29] */ } , { 1.00508967016578387720926457404857501387596130371094e+00, /* twoPowerIndex1hi[30] */ 1.64180469767730323539044065876968510741128671646342e-17, /* twoPowerIndex1mi[30] */ -1.40120338097898451052996285664279342840562084008057e-34, /* twoPowerIndex1lo[30] */ } , { 1.00525977124536503026774880709126591682434082031250e+00, /* twoPowerIndex1hi[31] */ 3.72669843182841367415839881731427710949489409371967e-17, /* twoPowerIndex1mi[31] */ -6.47401139805376556406832921347318553328966160972009e-34, /* twoPowerIndex1lo[31] */ } , { 1.00542990111280272635951860138447955250740051269531e+00, /* twoPowerIndex1hi[32] */ 9.49918653545503175702165599813853704096085691656846e-17, /* twoPowerIndex1mi[32] */ 2.69197614795285565383714012654266434015814803945559e-33, /* twoPowerIndex1lo[32] */ } , { 1.00560005977296929025044391892151907086372375488281e+00, /* twoPowerIndex1hi[33] */ -8.68093131444458156819420437418787120833640771986467e-17, /* twoPowerIndex1mi[33] */ 1.70120132411898592857823454488038166970266621441155e-33, /* twoPowerIndex1lo[33] */ } , { 1.00577024723073704670639472169568762183189392089844e+00, /* twoPowerIndex1hi[34] */ 4.00054749103011688253297776917861866454998331259826e-17, /* twoPowerIndex1mi[34] */ 1.31925963209617013098908877209722537258440391267352e-33, /* twoPowerIndex1lo[34] */ } , { 1.00594046349098009685008037195075303316116333007812e+00, /* twoPowerIndex1hi[35] */ 7.19049911150997399545071999536183023264065701084941e-17, /* twoPowerIndex1mi[35] */ 5.87388840736458866162752231275781178461761843642826e-33, /* twoPowerIndex1lo[35] */ } , { 1.00611070855857298589342008199309930205345153808594e+00, /* twoPowerIndex1hi[36] */ -1.39080686710657830063564897325456873924612265621065e-17, /* twoPowerIndex1mi[36] */ -1.04608842475341479042763417006066485614641577765254e-33, /* twoPowerIndex1lo[36] */ } , { 1.00628098243839092518214783922303467988967895507812e+00, /* twoPowerIndex1hi[37] */ -8.14020864257304964668281784838729787981918541118695e-17, /* twoPowerIndex1mi[37] */ 9.81687621053626949463979101287162593669867055078380e-34, /* twoPowerIndex1lo[37] */ } , { 1.00645128513531001424041733116609975695610046386719e+00, /* twoPowerIndex1hi[38] */ -5.76215104374953424938341851527793234314721266620465e-17, /* twoPowerIndex1mi[38] */ -2.57074696660737495074482007072094547944536206743811e-33, /* twoPowerIndex1lo[38] */ } , { 1.00662161665420724077080194547306746244430541992188e+00, /* twoPowerIndex1hi[39] */ 6.74527847731045679518854873240614524466814727371618e-17, /* twoPowerIndex1mi[39] */ 3.78807035520293397050945635744099720111701312971531e-33, /* twoPowerIndex1lo[39] */ } , { 1.00679197699996070269889969495125114917755126953125e+00, /* twoPowerIndex1hi[40] */ 1.89985572403462958330039110072328316553950667129559e-17, /* twoPowerIndex1mi[40] */ -9.63431595756658515104002497950853752466876076619761e-34, /* twoPowerIndex1lo[40] */ } , { 1.00696236617744894203951844247058033943176269531250e+00, /* twoPowerIndex1hi[41] */ -9.63743003231640715845365699595418727819327585110316e-17, /* twoPowerIndex1mi[41] */ 5.37739172125896523173793245498965828230574349410153e-34, /* twoPowerIndex1lo[41] */ } , { 1.00713278419155116694128082599490880966186523437500e+00, /* twoPowerIndex1hi[42] */ -1.25286544624539788678561179100718466970708089928402e-17, /* twoPowerIndex1mi[42] */ 6.73461401738595970431440883296934068477066941591536e-34, /* twoPowerIndex1lo[42] */ } , { 1.00730323104714791782043903367593884468078613281250e+00, /* twoPowerIndex1hi[43] */ 3.02057888784369419361601396858156577301726732087163e-17, /* twoPowerIndex1mi[43] */ 2.28748779695564659338938424768062274005093770790899e-33, /* twoPowerIndex1lo[43] */ } , { 1.00747370674912040122706002875929698348045349121094e+00, /* twoPowerIndex1hi[44] */ -4.86939425860856490657306074829518805252629724182687e-17, /* twoPowerIndex1mi[44] */ -2.15005825118530979132585793750524459885823808259600e-33, /* twoPowerIndex1lo[44] */ } , { 1.00764421130235026780042062455322593450546264648438e+00, /* twoPowerIndex1hi[45] */ 5.22402993768745316546273304631524097955173932918745e-17, /* twoPowerIndex1mi[45] */ 1.56859855755260687389551771821040360984576895950448e-33, /* twoPowerIndex1lo[45] */ } , { 1.00781474471172072249203210958512499928474426269531e+00, /* twoPowerIndex1hi[46] */ -9.36154355147845590745647945463041972879607082944076e-17, /* twoPowerIndex1mi[46] */ 2.73525232969860711971224663796949142049450209755900e-33, /* twoPowerIndex1lo[46] */ } , { 1.00798530698211497025340577238239347934722900390625e+00, /* twoPowerIndex1hi[47] */ -8.65251323306194956904999437269495581443314540350323e-17, /* twoPowerIndex1mi[47] */ 3.95202635576858744637745517221782298786195221857564e-33, /* twoPowerIndex1lo[47] */ } , { 1.00815589811841754830368245166027918457984924316406e+00, /* twoPowerIndex1hi[48] */ -3.25205875608430806088583499076669170064325943797327e-17, /* twoPowerIndex1mi[48] */ 2.46355206137317856028163445564386882918089954604456e-33, /* twoPowerIndex1lo[48] */ } , { 1.00832651812551388204042268625926226377487182617188e+00, /* twoPowerIndex1hi[49] */ -9.91723226806091428304981281566311898208154515630026e-17, /* twoPowerIndex1mi[49] */ -5.54888559019883709197982155449053331751526019176611e-33, /* twoPowerIndex1lo[49] */ } , { 1.00849716700828984095039686508243903517723083496094e+00, /* twoPowerIndex1hi[50] */ -7.13604740416252276802131825807759910735798752142063e-17, /* twoPowerIndex1mi[50] */ 4.98539917129953776836361552714923793985513981224277e-33, /* twoPowerIndex1lo[50] */ } , { 1.00866784477163240474340000218944624066352844238281e+00, /* twoPowerIndex1hi[51] */ -1.72686837122432199045769102324975071816159176955755e-17, /* twoPowerIndex1mi[51] */ 1.49699250027049460850618457278328039699137666243513e-33, /* twoPowerIndex1lo[51] */ } , { 1.00883855142042944130764681176515296101570129394531e+00, /* twoPowerIndex1hi[52] */ -6.61995469367394011396161169543794432105455894234207e-17, /* twoPowerIndex1mi[52] */ -1.37180394060118324236386341775148249159351409372011e-33, /* twoPowerIndex1lo[52] */ } , { 1.00900928695956926262056185805704444646835327148438e+00, /* twoPowerIndex1hi[53] */ 3.56545690151302037529536411250390721695546928174132e-17, /* twoPowerIndex1mi[53] */ -3.04973969952342772070810129193852120178103073824881e-33, /* twoPowerIndex1lo[53] */ } , { 1.00918005139394151292719925550045445561408996582031e+00, /* twoPowerIndex1hi[54] */ 3.71731001370881785990046067286312459291233468170260e-17, /* twoPowerIndex1mi[54] */ 2.33846700487585833881864340821781209486455210644683e-33, /* twoPowerIndex1lo[54] */ } , { 1.00935084472843628056182296859333291649818420410156e+00, /* twoPowerIndex1hi[55] */ 7.06257240682552768409771521622687712943771198652841e-17, /* twoPowerIndex1mi[55] */ -2.69254581845265407066861039619808678678301305791490e-33, /* twoPowerIndex1lo[55] */ } , { 1.00952166696794476408172158699017018079757690429688e+00, /* twoPowerIndex1hi[56] */ -1.43214123034288192889278157016818203958577074101904e-17, /* twoPowerIndex1mi[56] */ 1.18343254028162625925516501493235924385911429505127e-33, /* twoPowerIndex1lo[56] */ } , { 1.00969251811735860613339355040807276964187622070312e+00, /* twoPowerIndex1hi[57] */ 1.56681880131341096294393603553275561732689802958880e-17, /* twoPowerIndex1mi[57] */ -7.81531085085694011629938080711347719818453468652371e-34, /* twoPowerIndex1lo[57] */ } , { 1.00986339818157078163096684875199571251869201660156e+00, /* twoPowerIndex1hi[58] */ -1.10436957803936884179513517801130489140214758906396e-16, /* twoPowerIndex1mi[58] */ 2.26009746193166539328485913376118607218426838997178e-33, /* twoPowerIndex1lo[58] */ } , { 1.01003430716547448753317439695820212364196777343750e+00, /* twoPowerIndex1hi[59] */ -5.76731742716039801926309676866051407637690838590278e-17, /* twoPowerIndex1mi[59] */ -2.78217177127226696492717790709599913537289113429847e-33, /* twoPowerIndex1lo[59] */ } , { 1.01020524507396425306637866015080362558364868164062e+00, /* twoPowerIndex1hi[60] */ 4.83548497844038273903057565303994337100835235326315e-18, /* twoPowerIndex1mi[60] */ 2.61454310671247390892899439237254056446677108734060e-34, /* twoPowerIndex1lo[60] */ } , { 1.01037621191193527359075687854783609509468078613281e+00, /* twoPowerIndex1hi[61] */ 7.01512128971544209746870624992521939688820868468409e-17, /* twoPowerIndex1mi[61] */ -5.58161827166019262256128049263563333632096890407031e-33, /* twoPowerIndex1lo[61] */ } , { 1.01054720768428363264490599249256774783134460449219e+00, /* twoPowerIndex1hi[62] */ 7.16180287361957384315239192590148379997244337618299e-17, /* twoPowerIndex1mi[62] */ -2.02563561553844543425647289447795720504633264470840e-34, /* twoPowerIndex1lo[62] */ } , { 1.01071823239590607990123771742219105362892150878906e+00, /* twoPowerIndex1hi[63] */ 1.05046591340840499506734116899577087874840087102554e-16, /* twoPowerIndex1mi[63] */ 2.18415845005431430458109722226729544983351542501345e-33, /* twoPowerIndex1lo[63] */ } }; static const tPi_t twoPowerIndex2[64] = { { 1.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex2hi[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex2mi[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex2lo[0] */ } , { 1.01088928605170047525518839393043890595436096191406e+00, /* twoPowerIndex2hi[1] */ -1.52347786033685771762884896542837070154735103108242e-17, /* twoPowerIndex2mi[1] */ -1.20527773363982029579667170059568717373235495431222e-33, /* twoPowerIndex2lo[1] */ } , { 1.02189714865411662714222984504885971546173095703125e+00, /* twoPowerIndex2hi[2] */ 5.10922502897344389358977529484899213711118891193073e-17, /* twoPowerIndex2mi[2] */ 7.88422656496927442160138555121324022911581088833303e-34, /* twoPowerIndex2lo[2] */ } , { 1.03302487902122841489926940994337201118469238281250e+00, /* twoPowerIndex2hi[3] */ 7.60083887402708848935418174694583720224989620170520e-18, /* twoPowerIndex2mi[3] */ 4.17547660336499599627565312970423748685953776150432e-34, /* twoPowerIndex2lo[3] */ } , { 1.04427378242741375480306942336028441786766052246094e+00, /* twoPowerIndex2hi[4] */ 8.55188970553796489217080231819249267647451456689049e-17, /* twoPowerIndex2mi[4] */ -4.33079108057472301914865017639792677602990877842667e-33, /* twoPowerIndex2lo[4] */ } , { 1.05564517836055715704901558638084679841995239257812e+00, /* twoPowerIndex2hi[5] */ 1.75932573877209198413667791203269037000656546957040e-18, /* twoPowerIndex2mi[5] */ -1.30396724977978376996223394717384715710429730879060e-34, /* twoPowerIndex2lo[5] */ } , { 1.06714040067682369716806078940862789750099182128906e+00, /* twoPowerIndex2hi[6] */ -7.89985396684158212226333428391940791349522867645719e-17, /* twoPowerIndex2mi[6] */ 2.48773924323047906697979838020484860096229450391065e-33, /* twoPowerIndex2lo[6] */ } , { 1.07876079775711986030728439800441265106201171875000e+00, /* twoPowerIndex2hi[7] */ -6.65666043605659260344452997720816205593857378631714e-17, /* twoPowerIndex2mi[7] */ -3.65812580131923690564246115619834327696213789275798e-33, /* twoPowerIndex2lo[7] */ } , { 1.09050773266525768967483145388541743159294128417969e+00, /* twoPowerIndex2hi[8] */ -3.04678207981247114696551170541257032193091359539676e-17, /* twoPowerIndex2mi[8] */ 2.01705487848848619150139275849815038703452970938356e-33, /* twoPowerIndex2lo[8] */ } , { 1.10238258330784089089604549371870234608650207519531e+00, /* twoPowerIndex2hi[9] */ 5.26603687157069438656191942579725322612448063343618e-17, /* twoPowerIndex2mi[9] */ 6.45805397536721410708490440561131106837447579889036e-34, /* twoPowerIndex2lo[9] */ } , { 1.11438674259589243220602838846389204263687133789062e+00, /* twoPowerIndex2hi[10] */ 1.04102784568455709549461912557590544266030834754874e-16, /* twoPowerIndex2mi[10] */ 1.47570167344000313963428137759389241586071635800536e-33, /* twoPowerIndex2lo[10] */ } , { 1.12652161860824184813623105583246797323226928710938e+00, /* twoPowerIndex2hi[11] */ 5.16585675879545673703180814711785602957687143067887e-17, /* twoPowerIndex2mi[11] */ -5.65916686170716220063974592097473710424342945964456e-34, /* twoPowerIndex2lo[11] */ } , { 1.13878863475669156457570352358743548393249511718750e+00, /* twoPowerIndex2hi[12] */ 8.91281267602540777782023808215740339330966556723006e-17, /* twoPowerIndex2mi[12] */ -2.00741463283249448727846279877956608996968961458494e-33, /* twoPowerIndex2lo[12] */ } , { 1.15118922995298267331065744656370952725410461425781e+00, /* twoPowerIndex2hi[13] */ 3.25071021886382721197741051783883831627922464835734e-17, /* twoPowerIndex2mi[13] */ 8.89091931637927159755660842958283684863470887791663e-34, /* twoPowerIndex2lo[13] */ } , { 1.16372485877757747552152522985124960541725158691406e+00, /* twoPowerIndex2hi[14] */ 3.82920483692409349872159816102110059722238312159091e-17, /* twoPowerIndex2mi[14] */ 7.19709831987676327409679245188515478735702972651365e-34, /* twoPowerIndex2lo[14] */ } , { 1.17639699165028122074261318630306050181388854980469e+00, /* twoPowerIndex2hi[15] */ 5.55420325421807896276684328889766000203735373777665e-17, /* twoPowerIndex2mi[15] */ -1.48842929343368511961710849782815827921712348302943e-33, /* twoPowerIndex2lo[15] */ } , { 1.18920711500272102689734765590401366353034973144531e+00, /* twoPowerIndex2hi[16] */ 3.98201523146564611098029654755651628169309930562261e-17, /* twoPowerIndex2mi[16] */ 1.14195965688545340101163692105448367710482873511510e-33, /* twoPowerIndex2lo[16] */ } , { 1.20215673145270307564658196497475728392601013183594e+00, /* twoPowerIndex2hi[17] */ 6.64498149925230124489270286991048474954122885069094e-17, /* twoPowerIndex2mi[17] */ -3.85685255336907654452995968372311171004938395576078e-33, /* twoPowerIndex2lo[17] */ } , { 1.21524735998046895524282717815367504954338073730469e+00, /* twoPowerIndex2hi[18] */ -7.71263069268148813091257203929615917892526180720328e-17, /* twoPowerIndex2mi[18] */ 4.71720614288499816545262331753743129502653902881319e-33, /* twoPowerIndex2lo[18] */ } , { 1.22848053610687002468182527081808075308799743652344e+00, /* twoPowerIndex2hi[19] */ -1.89878163130252995311948719658078062677878185721429e-17, /* twoPowerIndex2mi[19] */ 6.18469453652103848424687212656185051850860290411013e-34, /* twoPowerIndex2lo[19] */ } , { 1.24185781207348400201340155035723000764846801757812e+00, /* twoPowerIndex2hi[20] */ 4.65802759183693679122616767654141683800114091774588e-17, /* twoPowerIndex2mi[20] */ -2.31439910378785985764079190411324307370918857557275e-33, /* twoPowerIndex2lo[20] */ } , { 1.25538075702469109629078047873917967081069946289062e+00, /* twoPowerIndex2hi[21] */ -6.71138982129687841852821870522008036246320680675952e-18, /* twoPowerIndex2mi[21] */ -5.76846264325028352862497671463784812858487529613818e-35, /* twoPowerIndex2lo[21] */ } , { 1.26905095719173321988648694969015195965766906738281e+00, /* twoPowerIndex2hi[22] */ 2.66793213134218609522998616502989391061315227839969e-18, /* twoPowerIndex2mi[22] */ -5.01723570938719050333027020376949013774930719140568e-35, /* twoPowerIndex2lo[22] */ } , { 1.28287001607877826359072059858590364456176757812500e+00, /* twoPowerIndex2hi[23] */ 1.71359491824356096814175768900864730928374054987756e-17, /* twoPowerIndex2mi[23] */ 7.25131491282819461838977871983760669047046080773478e-34, /* twoPowerIndex2lo[23] */ } , { 1.29683955465100964055125132290413603186607360839844e+00, /* twoPowerIndex2hi[24] */ 2.53825027948883149592910250791940344234383392801619e-17, /* twoPowerIndex2mi[24] */ 1.68678246461832500334243039646153124282288438904092e-34, /* twoPowerIndex2lo[24] */ } , { 1.31096121152476441373835314152529463171958923339844e+00, /* twoPowerIndex2hi[25] */ -7.18153613551945385697245613605196258733040544776187e-17, /* twoPowerIndex2mi[25] */ -2.12629266743969557140434977160228094057588798528197e-34, /* twoPowerIndex2lo[25] */ } , { 1.32523664315974132321684919588733464479446411132812e+00, /* twoPowerIndex2hi[26] */ -2.85873121003886137327027220806882812126373511580572e-17, /* twoPowerIndex2mi[26] */ 7.62021406397260431456821182703024347950927217409368e-34, /* twoPowerIndex2lo[26] */ } , { 1.33966752405330291608720472140703350305557250976562e+00, /* twoPowerIndex2hi[27] */ 8.92728259483173198426255486589831591472085466011828e-17, /* twoPowerIndex2mi[27] */ -7.69657983531899254540849298389093495155758992415150e-34, /* twoPowerIndex2lo[27] */ } , { 1.35425554693689265128853094211081042885780334472656e+00, /* twoPowerIndex2hi[28] */ 7.70094837980298946162338224151128414915778826123523e-17, /* twoPowerIndex2mi[28] */ -2.24074836437395028882100810844688282941385619430371e-33, /* twoPowerIndex2lo[28] */ } , { 1.36900242297459051599162194179370999336242675781250e+00, /* twoPowerIndex2hi[29] */ 9.59379791911884877255545693637832999511204427845953e-17, /* twoPowerIndex2mi[29] */ -4.88674958784947176959607858061848292445663702071206e-33, /* twoPowerIndex2lo[29] */ } , { 1.38390988196383202257777611521305516362190246582031e+00, /* twoPowerIndex2hi[30] */ -6.77051165879478628715737183479431151106043475381389e-17, /* twoPowerIndex2mi[30] */ 5.25954134785524271676320971772030766300829615286373e-34, /* twoPowerIndex2lo[30] */ } , { 1.39897967253831123635166022722842171788215637207031e+00, /* twoPowerIndex2hi[31] */ -9.61421320905132307233280072508933760749140842467170e-17, /* twoPowerIndex2mi[31] */ 3.97465190077505680357285219692652769985214754647576e-33, /* twoPowerIndex2lo[31] */ } , { 1.41421356237309514547462185873882845044136047363281e+00, /* twoPowerIndex2hi[32] */ -9.66729331345291345105469972976694765012981670542977e-17, /* twoPowerIndex2mi[32] */ 4.13867530869941356271900493210877889450985709540127e-33, /* twoPowerIndex2lo[32] */ } , { 1.42961333839197002326670826732879504561424255371094e+00, /* twoPowerIndex2hi[33] */ -1.20316424890536551791763281075597751007148682598677e-17, /* twoPowerIndex2mi[33] */ 3.96492532243389364766543780399018506300743370884771e-35, /* twoPowerIndex2lo[33] */ } , { 1.44518080697704665027458759141154587268829345703125e+00, /* twoPowerIndex2hi[34] */ -3.02375813499398731939978948265280760393682335269040e-17, /* twoPowerIndex2mi[34] */ -1.77301195820250091791088617662298487007284882395542e-33, /* twoPowerIndex2lo[34] */ } , { 1.46091779418064704465507475106278434395790100097656e+00, /* twoPowerIndex2hi[35] */ -5.60037718607521580013156831807759453639536208267684e-17, /* twoPowerIndex2mi[35] */ -4.80948804890004400970317146361816382779746350931714e-33, /* twoPowerIndex2lo[35] */ } , { 1.47682614593949934622685304930200800299644470214844e+00, /* twoPowerIndex2hi[36] */ -3.48399455689279579579151031868718147769491495422105e-17, /* twoPowerIndex2mi[36] */ -1.21157704523090580028169713170353136148082368354920e-34, /* twoPowerIndex2lo[36] */ } , { 1.49290772829126483500772337720263749361038208007812e+00, /* twoPowerIndex2hi[37] */ 1.41929201542840357707378184476885202767753055101956e-17, /* twoPowerIndex2mi[37] */ 2.77326329344780505247628358108799734324783290873618e-34, /* twoPowerIndex2lo[37] */ } , { 1.50916442759342284141155232646269723773002624511719e+00, /* twoPowerIndex2hi[38] */ -1.01645532775429503910501990740249618370059871055172e-16, /* twoPowerIndex2mi[38] */ 2.04191706967403438352422808603561166583202022922508e-34, /* twoPowerIndex2lo[38] */ } , { 1.52559815074453841710067081294255331158638000488281e+00, /* twoPowerIndex2hi[39] */ -1.10249417123425609363148008789604625195179292613569e-16, /* twoPowerIndex2mi[39] */ -2.99382882637137806007903782085057425945683820190483e-33, /* twoPowerIndex2lo[39] */ } , { 1.54221082540794074411394376511452719569206237792969e+00, /* twoPowerIndex2hi[40] */ 7.94983480969762085616103882937991564856794389991833e-17, /* twoPowerIndex2mi[40] */ -9.15995637410036729585390444224530830478731117122757e-34, /* twoPowerIndex2lo[40] */ } , { 1.55900440023783692922165755589958280324935913085938e+00, /* twoPowerIndex2hi[41] */ 3.78120705335752750188190562589679090842557793649900e-17, /* twoPowerIndex2mi[41] */ 5.94230221045385633407443935898656310894518533675204e-35, /* twoPowerIndex2lo[41] */ } , { 1.57598084510788649659218663146020844578742980957031e+00, /* twoPowerIndex2hi[42] */ -1.01369164712783039807957177429288269249745537889645e-17, /* twoPowerIndex2mi[42] */ 5.43913851556220712785038586461119929989856637311730e-34, /* twoPowerIndex2lo[42] */ } , { 1.59314215134226699888131406623870134353637695312500e+00, /* twoPowerIndex2hi[43] */ -1.00944065423119637216151952902063201612012779755882e-16, /* twoPowerIndex2mi[43] */ 4.60848399034962572477662350836868643017178368092553e-33, /* twoPowerIndex2lo[43] */ } , { 1.61049033194925428347232809755951166152954101562500e+00, /* twoPowerIndex2hi[44] */ 2.47071925697978878522451183466139791436957933053447e-17, /* twoPowerIndex2mi[44] */ 1.06968477888935897586507304780358756526593706030066e-33, /* twoPowerIndex2lo[44] */ } , { 1.62802742185734783397776936908485367894172668457031e+00, /* twoPowerIndex2hi[45] */ -6.71295508470708408629558620522800193343463268850872e-17, /* twoPowerIndex2mi[45] */ 1.86124288813399584090278118171650158752835667500490e-33, /* twoPowerIndex2lo[45] */ } , { 1.64575547815396494577555586147354915738105773925781e+00, /* twoPowerIndex2hi[46] */ -1.01256799136747726037875241569662212149731136230039e-16, /* twoPowerIndex2mi[46] */ -6.73838498803664271467304077725442401461793880458369e-34, /* twoPowerIndex2lo[46] */ } , { 1.66367658032673637613640948984539136290550231933594e+00, /* twoPowerIndex2hi[47] */ 5.89099269671309967045155789620226639428173542900082e-17, /* twoPowerIndex2mi[47] */ 2.37785299276765025315795732233641105960161859663372e-33, /* twoPowerIndex2lo[47] */ } , { 1.68179283050742900407215074665145948529243469238281e+00, /* twoPowerIndex2hi[48] */ 8.19901002058149652012724391042374107310082144797238e-17, /* twoPowerIndex2mi[48] */ 5.10351519472809316392686812760480457926425713861784e-33, /* twoPowerIndex2lo[48] */ } , { 1.70010635371852347752508194389520213007926940917969e+00, /* twoPowerIndex2hi[49] */ -8.02371937039770024588528464451482959960563128920877e-18, /* twoPowerIndex2mi[49] */ 4.50894675051846528463958043437010583905518288996850e-34, /* twoPowerIndex2lo[49] */ } , { 1.71861929812247793414314855908742174506187438964844e+00, /* twoPowerIndex2hi[50] */ -1.85138041826311098821086356969536380719870481925638e-17, /* twoPowerIndex2mi[50] */ 6.41562962530571009881963439719259893730039269925891e-34, /* twoPowerIndex2lo[50] */ } , { 1.73733383527370621735030908894259482622146606445312e+00, /* twoPowerIndex2hi[51] */ 3.16438929929295694659064288262436215220581330791541e-17, /* twoPowerIndex2mi[51] */ 2.46812086524635182684409036079744664142196277491485e-33, /* twoPowerIndex2lo[51] */ } , { 1.75625216037329945351075366488657891750335693359375e+00, /* twoPowerIndex2hi[52] */ 2.96014069544887330703087179323550026749650613893620e-17, /* twoPowerIndex2mi[52] */ 1.23348227448930022362949427574612725745479960698002e-33, /* twoPowerIndex2lo[52] */ } , { 1.77537649252652118825324123463360592722892761230469e+00, /* twoPowerIndex2hi[53] */ 6.42973179655657203395602172161574258202382771355994e-17, /* twoPowerIndex2mi[53] */ -3.05903038196122316059732104267589318807211463677414e-33, /* twoPowerIndex2lo[53] */ } , { 1.79470907500310716820024481421569362282752990722656e+00, /* twoPowerIndex2hi[54] */ 1.82274584279120867697625715862678123206602563412216e-17, /* twoPowerIndex2mi[54] */ 1.42176433874694971095041068746172287320972847635154e-33, /* twoPowerIndex2lo[54] */ } , { 1.81425217550039885594514998956583440303802490234375e+00, /* twoPowerIndex2hi[55] */ -9.96953153892034881983229632097342495877571562964276e-17, /* twoPowerIndex2mi[55] */ -5.86224914377491774994695195482808191103744720514440e-33, /* twoPowerIndex2lo[55] */ } , { 1.83400808640934243065601094713201746344566345214844e+00, /* twoPowerIndex2hi[56] */ 3.28310722424562720351405816760294702167288526703081e-17, /* twoPowerIndex2mi[56] */ -6.42508934795304248095271046696049734574532048424330e-34, /* twoPowerIndex2lo[56] */ } , { 1.85397912508338547077357816306175664067268371582031e+00, /* twoPowerIndex2hi[57] */ 9.76188749072759353840331670682321086158335176176729e-17, /* twoPowerIndex2mi[57] */ 4.61481577205566482307976345637533484680898060020057e-33, /* twoPowerIndex2lo[57] */ } , { 1.87416763411029996255763307999586686491966247558594e+00, /* twoPowerIndex2hi[58] */ -6.12276341300414256163658402373731493255704994623650e-17, /* twoPowerIndex2mi[58] */ 5.28588559402507397372575432425046614667899080733482e-33, /* twoPowerIndex2lo[58] */ } , { 1.89457598158696560730618330126162618398666381835938e+00, /* twoPowerIndex2hi[59] */ 3.40340353521652967060147928999507962708632290832738e-17, /* twoPowerIndex2mi[59] */ 1.72475099549343225430579028439403217279441019556785e-33, /* twoPowerIndex2lo[59] */ } , { 1.91520656139714740007207183225546032190322875976562e+00, /* twoPowerIndex2hi[60] */ -1.06199460561959626376283195555328606320260702029334e-16, /* twoPowerIndex2mi[60] */ -3.05776975679132548538006102719337626149343902119718e-33, /* twoPowerIndex2lo[60] */ } , { 1.93606179349229434727419629780342802405357360839844e+00, /* twoPowerIndex2hi[61] */ 1.03323859606763257447769151803649788699571393339738e-16, /* twoPowerIndex2mi[61] */ 6.05301367682062275405664830597304146844867569493449e-33, /* twoPowerIndex2lo[61] */ } , { 1.95714412417540017941064434126019477844238281250000e+00, /* twoPowerIndex2hi[62] */ 8.96076779103666776760155050762912042076490756639488e-17, /* twoPowerIndex2mi[62] */ -9.63267661361827588458686334472185443533033181828620e-34, /* twoPowerIndex2lo[62] */ } , { 1.97845602638795092786949680885300040245056152343750e+00, /* twoPowerIndex2hi[63] */ 4.03887531092781665749784154795462589642365074083484e-17, /* twoPowerIndex2mi[63] */ 3.58120371667786223934924900740488031476290303118010e-34, /* twoPowerIndex2lo[63] */ } }; interval-2.1.0/src/crlibm/gappa/asin/asinAccuR0.gappa0000644000000000000000000005223013031036767020517 0ustar 00000000000000# The polynomial to implement is: x * (1b0 + ((x^(1b1)) * (108172851219475575594385340192083b-109 + ((x^(1b1)) * (3042361440547750563592087693241b-105 + ((x^(1b1)) * (115899483449438116708269989305805b-111 + ((x^(1b1)) * (78876037347534273870913665352907b-111 + ((x^(1b1)) * (14520361420796082234834302007973b-109 + ((x^(1b1)) * (90100704200837228890721343577993b-112 + ((x^(1b1)) * (8050184333924753b-59 + ((x^(1b1)) * (3329579917524393b-58 + ((x^(1b1)) * (703398096605685b-56 + ((x^(1b1)) * (2418349647542263b-58 + ((x^(1b1)) * (4215384086352865b-59 + ((x^(1b1)) * (3716565942414711b-59 + ((x^(1b1)) * (3308858625299127b-59 + ((x^(1b1)) * (1485727445894643b-58 + ((x^(1b1)) * (1338544855889499b-58 + ((x^(1b1)) * (1262327254413885b-58 + ((x^(1b1)) * (7109335287797167b-61 + ((x^(1b1)) * 3595912496380613b-59)))))))))))))))))))))))))))))))))))) # The polynomial implemented is: x * (1b0 + ((x^(1b1)) * (108172851219475575594385340192083b-109 + ((x^(1b1)) * (3042361440547750563592087693241b-105 + ((x^(1b1)) * (115899483449438116708269989305805b-111 + ((x^(1b1)) * (78876037347534273870913665352907b-111 + ((x^(1b1)) * (14520361420796082234834302007973b-109 + ((x^(1b1)) * (90100704200837228890721343577993b-112 + ((x^(1b1)) * (8050184333924753b-59 + ((x^(1b1)) * (3329579917524393b-58 + ((x^(1b1)) * (703398096605685b-56 + ((x^(1b1)) * (2418349647542263b-58 + ((x^(1b1)) * (4215384086352865b-59 + ((x^(1b1)) * (3716565942414711b-59 + ((x^(1b1)) * (3308858625299127b-59 + ((x^(1b1)) * (1485727445894643b-58 + ((x^(1b1)) * (1338544855889499b-58 + ((x^(1b1)) * (1262327254413885b-58 + ((x^(1b1)) * (7109335287797167b-61 + ((x^(1b1)) * 3595912496380613b-59)))))))))))))))))))))))))))))))))))) # The domain is [1b-54;9007199254740983b-55] # The free variable x is a double precision number, the result p_res* is stored on a triple-double number. # The code produces 56 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_1h = double(1.00000000000000000000000000000000000000000000000000000000000000000000000000000000e+00); p_coeff_3h = double(1.66666666666666657414808128123695496469736099243164062500000000000000000000000000e-01); p_coeff_3m = double(9.25185853854296757512770104458324356634117384146900539554358999794203555211424828e-18); p_coeff_3hm = p_coeff_3h + p_coeff_3m; p_coeff_5h = double(7.49999999999999972244424384371086489409208297729492187500000000000000000000000000e-02); p_coeff_5m = double(2.77555756157123848551244900139306363413139848179272961559149734966922551393508911e-18); p_coeff_5hm = p_coeff_5h + p_coeff_5m; p_coeff_7h = double(4.46428571428571438484134148438897682353854179382324218750000000000000000000000000e-02); p_coeff_7m = double(-9.91270564650888671257031422999640405542600950171395167431764861021292745135724545e-19); p_coeff_7hm = p_coeff_7h + p_coeff_7m; p_coeff_9h = double(3.03819444444444440589503386718206456862390041351318359375000000000000000000000000e-02); p_coeff_9m = double(3.85497067132392282371332994114988395042540962791093560324551248186253360472619534e-19); p_coeff_9hm = p_coeff_9h + p_coeff_9m; p_coeff_11h = double(2.23721590909090918553037141691675060428678989410400390625000000000000000000000000e-02); p_coeff_11m = double(-9.46970190235819944882493359250540536388374860744029243297958942093828227370977402e-19); p_coeff_11hm = p_coeff_11h + p_coeff_11m; p_coeff_13h = double(1.73527644230769238775646812200648128055036067962646484375000000000000000000000000e-02); p_coeff_13m = double(-6.73286913315360860061003796178520710524664576113391175476996508564297982957214117e-19); p_coeff_13hm = p_coeff_13h + p_coeff_13m; p_coeff_15h = double(1.39648437499999850813781065994589880574494600296020507812500000000000000000000000e-02); p_coeff_17h = double(1.15518008961409714141499449624461703933775424957275390625000000000000000000000000e-02); p_coeff_19h = double(9.76160952911427071132521859908592887222766876220703125000000000000000000000000000e-03); p_coeff_21h = double(8.39033581342360154642356917520373826846480369567871093750000000000000000000000000e-03); p_coeff_23h = double(7.31252573485535913022648202286291052587330341339111328125000000000000000000000000e-03); p_coeff_25h = double(6.44721419032266533644115469314783695153892040252685546875000000000000000000000000e-03); p_coeff_27h = double(5.73995473599474108350459999883241835050284862518310546875000000000000000000000000e-03); p_coeff_29h = double(5.15465255859299739671364193327462999150156974792480468750000000000000000000000000e-03); p_coeff_31h = double(4.64401037031901206542094939777598483487963676452636718750000000000000000000000000e-03); p_coeff_33h = double(4.37957744519422778606276835944299818947911262512207031250000000000000000000000000e-03); p_coeff_35h = double(3.08318270558301894476715965254243201343342661857604980468750000000000000000000000e-03); p_coeff_37h = double(6.23791382502981474333925149267088272608816623687744140625000000000000000000000000e-03); p_x_0_pow2hm = xh * xh; p_x_0_pow2h = double(p_x_0_pow2hm); p_x_0_pow2m = p_x_0_pow2hm - p_x_0_pow2h; p_t_1_0h = p_coeff_37h; p_t_2_0h = double(p_t_1_0h * p_x_0_pow2h); p_t_3_0h = double(p_coeff_35h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * p_x_0_pow2h); p_t_5_0h = double(p_coeff_33h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * p_x_0_pow2h); p_t_7_0hm = p_coeff_31h + p_t_6_0h; p_t_7_0h = double(p_t_7_0hm); p_t_7_0m = p_t_7_0hm - p_t_7_0h; p_t_8_0hm = mul_rel<102>(p_t_7_0hm,p_x_0_pow2hm); p_t_8_0h = double(p_t_8_0hm); p_t_8_0m = p_t_8_0hm - p_t_8_0h; p_t_9_0hm = add_rel<102>(p_coeff_29h,p_t_8_0hm); p_t_9_0h = double(p_t_9_0hm); p_t_9_0m = p_t_9_0hm - p_t_9_0h; p_t_10_0hm = mul_rel<102>(p_t_9_0hm,p_x_0_pow2hm); p_t_10_0h = double(p_t_10_0hm); p_t_10_0m = p_t_10_0hm - p_t_10_0h; p_t_11_0hm = add_rel<102>(p_coeff_27h,p_t_10_0hm); p_t_11_0h = double(p_t_11_0hm); p_t_11_0m = p_t_11_0hm - p_t_11_0h; p_t_12_0hm = mul_rel<102>(p_t_11_0hm,p_x_0_pow2hm); p_t_12_0h = double(p_t_12_0hm); p_t_12_0m = p_t_12_0hm - p_t_12_0h; p_t_13_0hm = add_rel<102>(p_coeff_25h,p_t_12_0hm); p_t_13_0h = double(p_t_13_0hm); p_t_13_0m = p_t_13_0hm - p_t_13_0h; p_t_14_0hm = mul_rel<102>(p_t_13_0hm,p_x_0_pow2hm); p_t_14_0h = double(p_t_14_0hm); p_t_14_0m = p_t_14_0hm - p_t_14_0h; p_t_15_0hm = add_rel<102>(p_coeff_23h,p_t_14_0hm); p_t_15_0h = double(p_t_15_0hm); p_t_15_0m = p_t_15_0hm - p_t_15_0h; p_t_16_0hm = mul_rel<102>(p_t_15_0hm,p_x_0_pow2hm); p_t_16_0h = double(p_t_16_0hm); p_t_16_0m = p_t_16_0hm - p_t_16_0h; p_t_17_0hm = add_rel<102>(p_coeff_21h,p_t_16_0hm); p_t_17_0h = double(p_t_17_0hm); p_t_17_0m = p_t_17_0hm - p_t_17_0h; p_t_18_0hm = mul_rel<102>(p_t_17_0hm,p_x_0_pow2hm); p_t_18_0h = double(p_t_18_0hm); p_t_18_0m = p_t_18_0hm - p_t_18_0h; p_t_19_0hm = add_rel<102>(p_coeff_19h,p_t_18_0hm); p_t_19_0h = double(p_t_19_0hm); p_t_19_0m = p_t_19_0hm - p_t_19_0h; p_t_20_0hm = mul_rel<102>(p_t_19_0hm,p_x_0_pow2hm); p_t_20_0h = double(p_t_20_0hm); p_t_20_0m = p_t_20_0hm - p_t_20_0h; p_t_21_0hm = add_rel<102>(p_coeff_17h,p_t_20_0hm); p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = mul_rel<102>(p_t_21_0hm,p_x_0_pow2hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = add_rel<102>(p_coeff_15h,p_t_22_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_t_24_0hm = fma_rel<100>(p_t_23_0hm,p_x_0_pow2hm,p_coeff_13hm); p_t_24_0h = double(p_t_24_0hm); p_t_24_0m = p_t_24_0hm - p_t_24_0h; p_t_25_0hm = fma_rel<100>(p_t_24_0hm,p_x_0_pow2hm,p_coeff_11hm); p_t_25_0h = double(p_t_25_0hm); p_t_25_0m = p_t_25_0hm - p_t_25_0h; p_t_26_0hm = fma_rel<100>(p_t_25_0hm,p_x_0_pow2hm,p_coeff_9hm); p_t_26_0h = double(p_t_26_0hm); p_t_26_0m = p_t_26_0hm - p_t_26_0h; p_t_27_0hm = mul_rel<102>(p_t_26_0hm,p_x_0_pow2hm); p_t_27_0h = double(p_t_27_0hm); p_t_27_0m = p_t_27_0hm - p_t_27_0h; p_t_28_0hml = add_rel<140>(p_coeff_7hm,p_t_27_0hm); p_t_28_0ml = p_t_28_0hml - p_t_28_0h; p_t_28_0m = double(p_t_28_0ml); p_t_28_0l = p_t_28_0ml - p_t_28_0m; p_t_28_0hm = p_t_28_0h + p_t_28_0m; overlap_p_t_28_0 = p_t_28_0m / p_t_28_0h; p_t_29_0hml = mul_rel<142>(p_x_0_pow2hm,p_t_28_0hml); p_t_29_0ml = p_t_29_0hml - p_t_29_0h; p_t_29_0m = double(p_t_29_0ml); p_t_29_0l = p_t_29_0ml - p_t_29_0m; p_t_29_0hm = p_t_29_0h + p_t_29_0m; overlap_p_t_29_0 = p_t_29_0m / p_t_29_0h; p_t_30_0hml = add_rel<144>(p_coeff_5hm,p_t_29_0hml); p_t_30_0ml = p_t_30_0hml - p_t_30_0h; p_t_30_0m = double(p_t_30_0ml); p_t_30_0l = p_t_30_0ml - p_t_30_0m; p_t_30_0hm = p_t_30_0h + p_t_30_0m; overlap_p_t_30_0 = p_t_30_0m / p_t_30_0h; p_t_31_0hml = mul_rel<133>(p_x_0_pow2hm,p_t_30_0hml); p_t_31_0ml = p_t_31_0hml - p_t_31_0h; p_t_31_0m = double(p_t_31_0ml); p_t_31_0l = p_t_31_0ml - p_t_31_0m; p_t_31_0hm = p_t_31_0h + p_t_31_0m; overlap_p_t_31_0 = p_t_31_0m / p_t_31_0h; p_t_32_0hml = add_rel<135>(p_coeff_3hm,p_t_31_0hml); p_t_32_0ml = p_t_32_0hml - p_t_32_0h; p_t_32_0m = double(p_t_32_0ml); p_t_32_0l = p_t_32_0ml - p_t_32_0m; p_t_32_0hm = p_t_32_0h + p_t_32_0m; overlap_p_t_32_0 = p_t_32_0m / p_t_32_0h; p_t_33_0hml = mul_rel<124>(p_x_0_pow2hm,p_t_32_0hml); p_t_33_0ml = p_t_33_0hml - p_t_33_0h; p_t_33_0m = double(p_t_33_0ml); p_t_33_0l = p_t_33_0ml - p_t_33_0m; p_t_33_0hm = p_t_33_0h + p_t_33_0m; overlap_p_t_33_0 = p_t_33_0m / p_t_33_0h; p_t_34_0hml = add_rel<127>(p_coeff_1h,p_t_33_0hml); p_t_34_0ml = p_t_34_0hml - p_t_34_0h; p_t_34_0m = double(p_t_34_0ml); p_t_34_0l = p_t_34_0ml - p_t_34_0m; p_t_34_0hm = p_t_34_0h + p_t_34_0m; overlap_p_t_34_0 = p_t_34_0m / p_t_34_0h; p_t_35_0hml = mul_rel<121>(xh,p_t_34_0hml); p_t_35_0ml = p_t_35_0hml - p_t_35_0h; p_t_35_0m = double(p_t_35_0ml); p_t_35_0l = p_t_35_0ml - p_t_35_0m; p_t_35_0hm = p_t_35_0h + p_t_35_0m; overlap_p_t_35_0 = p_t_35_0m / p_t_35_0h; p_reshml = p_t_35_0hml; p_resml = p_reshml - p_resh; p_resm = double(p_resml); p_resl = p_resml - p_resm; p_reshm = p_resh + p_resm; overlap_p_res = p_resm / p_resh; # Mathematical equivalents Mx = x; Mp_coeff_1 = p_coeff_1h; Mp_coeff_3 = p_coeff_3hm; Mp_coeff_5 = p_coeff_5hm; Mp_coeff_7 = p_coeff_7hm; Mp_coeff_9 = p_coeff_9hm; Mp_coeff_11 = p_coeff_11hm; Mp_coeff_13 = p_coeff_13hm; Mp_coeff_15 = p_coeff_15h; Mp_coeff_17 = p_coeff_17h; Mp_coeff_19 = p_coeff_19h; Mp_coeff_21 = p_coeff_21h; Mp_coeff_23 = p_coeff_23h; Mp_coeff_25 = p_coeff_25h; Mp_coeff_27 = p_coeff_27h; Mp_coeff_29 = p_coeff_29h; Mp_coeff_31 = p_coeff_31h; Mp_coeff_33 = p_coeff_33h; Mp_coeff_35 = p_coeff_35h; Mp_coeff_37 = p_coeff_37h; Mp_x_0_pow2 = Mx * Mx; Mp_t_1_0 = Mp_coeff_37; Mp_t_2_0 = Mp_t_1_0 * Mp_x_0_pow2; Mp_t_3_0 = Mp_coeff_35 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mp_x_0_pow2; Mp_t_5_0 = Mp_coeff_33 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mp_x_0_pow2; Mp_t_7_0 = Mp_coeff_31 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mp_x_0_pow2; Mp_t_9_0 = Mp_coeff_29 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mp_x_0_pow2; Mp_t_11_0 = Mp_coeff_27 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mp_x_0_pow2; Mp_t_13_0 = Mp_coeff_25 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mp_x_0_pow2; Mp_t_15_0 = Mp_coeff_23 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mp_x_0_pow2; Mp_t_17_0 = Mp_coeff_21 + Mp_t_16_0; Mp_t_18_0 = Mp_t_17_0 * Mp_x_0_pow2; Mp_t_19_0 = Mp_coeff_19 + Mp_t_18_0; Mp_t_20_0 = Mp_t_19_0 * Mp_x_0_pow2; Mp_t_21_0 = Mp_coeff_17 + Mp_t_20_0; Mp_t_22_0 = Mp_t_21_0 * Mp_x_0_pow2; Mp_t_23_0 = Mp_coeff_15 + Mp_t_22_0; Mp_t_24_0 = (Mp_t_23_0 * Mp_x_0_pow2) + Mp_coeff_13; Mp_t_25_0 = (Mp_t_24_0 * Mp_x_0_pow2) + Mp_coeff_11; Mp_t_26_0 = (Mp_t_25_0 * Mp_x_0_pow2) + Mp_coeff_9; Mp_t_27_0 = Mp_t_26_0 * Mp_x_0_pow2; Mp_t_28_0 = Mp_coeff_7 + Mp_t_27_0; Mp_t_29_0 = Mp_x_0_pow2 * Mp_t_28_0; Mp_t_30_0 = Mp_coeff_5 + Mp_t_29_0; Mp_t_31_0 = Mp_x_0_pow2 * Mp_t_30_0; Mp_t_32_0 = Mp_coeff_3 + Mp_t_31_0; Mp_t_33_0 = Mp_x_0_pow2 * Mp_t_32_0; Mp_t_34_0 = Mp_coeff_1 + Mp_t_33_0; Mp_t_35_0 = Mx * Mp_t_34_0; Mp_res = Mp_t_35_0; # Definition of the relative arithmetical error epsilon = (p_reshml - Mp_res) / Mp_res; # Implication to prove {(( x in [1b-54,9007199254740983b-55] /\ |overlap_p_t_28_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_28_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_29_0| in [1b-400,1b-41] # Verify the lower bound /\ |p_t_29_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_30_0| in [1b-400,1b-36] # Verify the lower bound /\ |p_t_30_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_31_0| in [1b-400,1b-32] # Verify the lower bound /\ |p_t_31_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_32_0| in [1b-400,1b-27] # Verify the lower bound /\ |p_t_32_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_33_0| in [1b-400,1b-23] # Verify the lower bound /\ |p_t_33_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_34_0| in [1b-400,1b-21] # Verify the lower bound /\ |p_t_34_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_35_0| in [1b-400,1b-16] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] ) \/ ( x in [-9007199254740983b-55,-1b-54] /\ |overlap_p_t_28_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_28_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_29_0| in [1b-400,1b-41] # Verify the lower bound /\ |p_t_29_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_30_0| in [1b-400,1b-36] # Verify the lower bound /\ |p_t_30_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_31_0| in [1b-400,1b-32] # Verify the lower bound /\ |p_t_31_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_32_0| in [1b-400,1b-27] # Verify the lower bound /\ |p_t_32_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_33_0| in [1b-400,1b-23] # Verify the lower bound /\ |p_t_33_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_34_0| in [1b-400,1b-21] # Verify the lower bound /\ |p_t_34_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_35_0| in [1b-400,1b-16] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_x_0_pow2h ~ p_x_0_pow2hm; p_t_7_0h ~ p_t_7_0hm; p_t_8_0h ~ p_t_8_0hm; p_t_9_0h ~ p_t_9_0hm; p_t_10_0h ~ p_t_10_0hm; p_t_11_0h ~ p_t_11_0hm; p_t_12_0h ~ p_t_12_0hm; p_t_13_0h ~ p_t_13_0hm; p_t_14_0h ~ p_t_14_0hm; p_t_15_0h ~ p_t_15_0hm; p_t_16_0h ~ p_t_16_0hm; p_t_17_0h ~ p_t_17_0hm; p_t_18_0h ~ p_t_18_0hm; p_t_19_0h ~ p_t_19_0hm; p_t_20_0h ~ p_t_20_0hm; p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; p_t_24_0h ~ p_t_24_0hm; p_t_25_0h ~ p_t_25_0hm; p_t_26_0h ~ p_t_26_0hm; p_t_27_0h ~ p_t_27_0hm; p_t_28_0hm ~ p_t_28_0hml; p_t_28_0h ~ p_t_28_0hm; p_t_28_0h ~ p_t_28_0hml; p_t_28_0m -> p_t_28_0h * overlap_p_t_28_0; p_t_28_0l / p_t_28_0m -> - ((p_t_28_0m - p_t_28_0ml) / p_t_28_0ml) / (1 + ((p_t_28_0m - p_t_28_0ml) / p_t_28_0ml)); (p_t_28_0hm - p_t_28_0hml) / p_t_28_0hml -> - (p_t_28_0l / p_t_28_0m) * (1 / (1 / overlap_p_t_28_0 + 1 + (p_t_28_0l / p_t_28_0m))); p_t_28_0ml -> p_t_28_0hml / ((1 + ((p_t_28_0m - p_t_28_0ml) / p_t_28_0ml)) / overlap_p_t_28_0 + 1); (p_t_28_0h - p_t_28_0hm) / p_t_28_0hm -> - 1 / (1 / overlap_p_t_28_0 + 1); p_t_28_0h -> p_t_28_0hml / (overlap_p_t_28_0 / (1 + ((p_t_28_0m - p_t_28_0ml) / p_t_28_0ml)) + 1); p_t_29_0hm ~ p_t_29_0hml; p_t_29_0h ~ p_t_29_0hm; p_t_29_0h ~ p_t_29_0hml; p_t_29_0m -> p_t_29_0h * overlap_p_t_29_0; p_t_29_0l / p_t_29_0m -> - ((p_t_29_0m - p_t_29_0ml) / p_t_29_0ml) / (1 + ((p_t_29_0m - p_t_29_0ml) / p_t_29_0ml)); (p_t_29_0hm - p_t_29_0hml) / p_t_29_0hml -> - (p_t_29_0l / p_t_29_0m) * (1 / (1 / overlap_p_t_29_0 + 1 + (p_t_29_0l / p_t_29_0m))); p_t_29_0ml -> p_t_29_0hml / ((1 + ((p_t_29_0m - p_t_29_0ml) / p_t_29_0ml)) / overlap_p_t_29_0 + 1); (p_t_29_0h - p_t_29_0hm) / p_t_29_0hm -> - 1 / (1 / overlap_p_t_29_0 + 1); p_t_29_0h -> p_t_29_0hml / (overlap_p_t_29_0 / (1 + ((p_t_29_0m - p_t_29_0ml) / p_t_29_0ml)) + 1); p_t_30_0hm ~ p_t_30_0hml; p_t_30_0h ~ p_t_30_0hm; p_t_30_0h ~ p_t_30_0hml; p_t_30_0m -> p_t_30_0h * overlap_p_t_30_0; p_t_30_0l / p_t_30_0m -> - ((p_t_30_0m - p_t_30_0ml) / p_t_30_0ml) / (1 + ((p_t_30_0m - p_t_30_0ml) / p_t_30_0ml)); (p_t_30_0hm - p_t_30_0hml) / p_t_30_0hml -> - (p_t_30_0l / p_t_30_0m) * (1 / (1 / overlap_p_t_30_0 + 1 + (p_t_30_0l / p_t_30_0m))); p_t_30_0ml -> p_t_30_0hml / ((1 + ((p_t_30_0m - p_t_30_0ml) / p_t_30_0ml)) / overlap_p_t_30_0 + 1); (p_t_30_0h - p_t_30_0hm) / p_t_30_0hm -> - 1 / (1 / overlap_p_t_30_0 + 1); p_t_30_0h -> p_t_30_0hml / (overlap_p_t_30_0 / (1 + ((p_t_30_0m - p_t_30_0ml) / p_t_30_0ml)) + 1); p_t_31_0hm ~ p_t_31_0hml; p_t_31_0h ~ p_t_31_0hm; p_t_31_0h ~ p_t_31_0hml; p_t_31_0m -> p_t_31_0h * overlap_p_t_31_0; p_t_31_0l / p_t_31_0m -> - ((p_t_31_0m - p_t_31_0ml) / p_t_31_0ml) / (1 + ((p_t_31_0m - p_t_31_0ml) / p_t_31_0ml)); (p_t_31_0hm - p_t_31_0hml) / p_t_31_0hml -> - (p_t_31_0l / p_t_31_0m) * (1 / (1 / overlap_p_t_31_0 + 1 + (p_t_31_0l / p_t_31_0m))); p_t_31_0ml -> p_t_31_0hml / ((1 + ((p_t_31_0m - p_t_31_0ml) / p_t_31_0ml)) / overlap_p_t_31_0 + 1); (p_t_31_0h - p_t_31_0hm) / p_t_31_0hm -> - 1 / (1 / overlap_p_t_31_0 + 1); p_t_31_0h -> p_t_31_0hml / (overlap_p_t_31_0 / (1 + ((p_t_31_0m - p_t_31_0ml) / p_t_31_0ml)) + 1); p_t_32_0hm ~ p_t_32_0hml; p_t_32_0h ~ p_t_32_0hm; p_t_32_0h ~ p_t_32_0hml; p_t_32_0m -> p_t_32_0h * overlap_p_t_32_0; p_t_32_0l / p_t_32_0m -> - ((p_t_32_0m - p_t_32_0ml) / p_t_32_0ml) / (1 + ((p_t_32_0m - p_t_32_0ml) / p_t_32_0ml)); (p_t_32_0hm - p_t_32_0hml) / p_t_32_0hml -> - (p_t_32_0l / p_t_32_0m) * (1 / (1 / overlap_p_t_32_0 + 1 + (p_t_32_0l / p_t_32_0m))); p_t_32_0ml -> p_t_32_0hml / ((1 + ((p_t_32_0m - p_t_32_0ml) / p_t_32_0ml)) / overlap_p_t_32_0 + 1); (p_t_32_0h - p_t_32_0hm) / p_t_32_0hm -> - 1 / (1 / overlap_p_t_32_0 + 1); p_t_32_0h -> p_t_32_0hml / (overlap_p_t_32_0 / (1 + ((p_t_32_0m - p_t_32_0ml) / p_t_32_0ml)) + 1); p_t_33_0hm ~ p_t_33_0hml; p_t_33_0h ~ p_t_33_0hm; p_t_33_0h ~ p_t_33_0hml; p_t_33_0m -> p_t_33_0h * overlap_p_t_33_0; p_t_33_0l / p_t_33_0m -> - ((p_t_33_0m - p_t_33_0ml) / p_t_33_0ml) / (1 + ((p_t_33_0m - p_t_33_0ml) / p_t_33_0ml)); (p_t_33_0hm - p_t_33_0hml) / p_t_33_0hml -> - (p_t_33_0l / p_t_33_0m) * (1 / (1 / overlap_p_t_33_0 + 1 + (p_t_33_0l / p_t_33_0m))); p_t_33_0ml -> p_t_33_0hml / ((1 + ((p_t_33_0m - p_t_33_0ml) / p_t_33_0ml)) / overlap_p_t_33_0 + 1); (p_t_33_0h - p_t_33_0hm) / p_t_33_0hm -> - 1 / (1 / overlap_p_t_33_0 + 1); p_t_33_0h -> p_t_33_0hml / (overlap_p_t_33_0 / (1 + ((p_t_33_0m - p_t_33_0ml) / p_t_33_0ml)) + 1); p_t_34_0hm ~ p_t_34_0hml; p_t_34_0h ~ p_t_34_0hm; p_t_34_0h ~ p_t_34_0hml; p_t_34_0m -> p_t_34_0h * overlap_p_t_34_0; p_t_34_0l / p_t_34_0m -> - ((p_t_34_0m - p_t_34_0ml) / p_t_34_0ml) / (1 + ((p_t_34_0m - p_t_34_0ml) / p_t_34_0ml)); (p_t_34_0hm - p_t_34_0hml) / p_t_34_0hml -> - (p_t_34_0l / p_t_34_0m) * (1 / (1 / overlap_p_t_34_0 + 1 + (p_t_34_0l / p_t_34_0m))); p_t_34_0ml -> p_t_34_0hml / ((1 + ((p_t_34_0m - p_t_34_0ml) / p_t_34_0ml)) / overlap_p_t_34_0 + 1); (p_t_34_0h - p_t_34_0hm) / p_t_34_0hm -> - 1 / (1 / overlap_p_t_34_0 + 1); p_t_34_0h -> p_t_34_0hml / (overlap_p_t_34_0 / (1 + ((p_t_34_0m - p_t_34_0ml) / p_t_34_0ml)) + 1); p_t_35_0hm ~ p_t_35_0hml; p_t_35_0h ~ p_t_35_0hm; p_t_35_0h ~ p_t_35_0hml; p_t_35_0m -> p_t_35_0h * overlap_p_t_35_0; p_t_35_0l / p_t_35_0m -> - ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml) / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)); (p_t_35_0hm - p_t_35_0hml) / p_t_35_0hml -> - (p_t_35_0l / p_t_35_0m) * (1 / (1 / overlap_p_t_35_0 + 1 + (p_t_35_0l / p_t_35_0m))); p_t_35_0ml -> p_t_35_0hml / ((1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) / overlap_p_t_35_0 + 1); (p_t_35_0h - p_t_35_0hm) / p_t_35_0hm -> - 1 / (1 / overlap_p_t_35_0 + 1); p_t_35_0h -> p_t_35_0hml / (overlap_p_t_35_0 / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) + 1); p_reshm ~ p_reshml; p_resh ~ p_reshm; p_resh ~ p_reshml; p_resm -> p_resh * overlap_p_res; p_resl / p_resm -> - ((p_resm - p_resml) / p_resml) / (1 + ((p_resm - p_resml) / p_resml)); (p_reshm - p_reshml) / p_reshml -> - (p_resl / p_resm) * (1 / (1 / overlap_p_res + 1 + (p_resl / p_resm))); p_resml -> p_reshml / ((1 + ((p_resm - p_resml) / p_resml)) / overlap_p_res + 1); (p_resh - p_reshm) / p_reshm -> - 1 / (1 / overlap_p_res + 1); p_resh -> p_reshml / (overlap_p_res / (1 + ((p_resm - p_resml) / p_resml)) + 1); # Meta-Hints for Horner scheme p_x_0_pow2hm ~ Mp_x_0_pow2; p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0hm ~ Mp_t_7_0; p_t_8_0hm ~ Mp_t_8_0; p_t_9_0hm ~ Mp_t_9_0; p_t_10_0hm ~ Mp_t_10_0; p_t_11_0hm ~ Mp_t_11_0; p_t_12_0hm ~ Mp_t_12_0; p_t_13_0hm ~ Mp_t_13_0; p_t_14_0hm ~ Mp_t_14_0; p_t_15_0hm ~ Mp_t_15_0; p_t_16_0hm ~ Mp_t_16_0; p_t_17_0hm ~ Mp_t_17_0; p_t_18_0hm ~ Mp_t_18_0; p_t_19_0hm ~ Mp_t_19_0; p_t_20_0hm ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_t_24_0hm ~ Mp_t_24_0; p_t_25_0hm ~ Mp_t_25_0; p_t_26_0hm ~ Mp_t_26_0; p_t_27_0hm ~ Mp_t_27_0; p_t_28_0hml ~ Mp_t_28_0; p_t_29_0hml ~ Mp_t_29_0; p_t_30_0hml ~ Mp_t_30_0; p_t_31_0hml ~ Mp_t_31_0; p_t_32_0hml ~ Mp_t_32_0; p_t_33_0hml ~ Mp_t_33_0; p_t_34_0hml ~ Mp_t_34_0; p_t_35_0hml ~ Mp_t_35_0; p_reshml ~ Mp_res; # Dichotomies for triple-double decomposition $ p_t_28_0hml in (0); $ p_t_28_0ml in (0); $ p_t_29_0hml in (0); $ p_t_29_0ml in (0); $ p_t_30_0hml in (0); $ p_t_30_0ml in (0); $ p_t_31_0hml in (0); $ p_t_31_0ml in (0); $ p_t_32_0hml in (0); $ p_t_32_0ml in (0); $ p_t_33_0hml in (0); $ p_t_33_0ml in (0); $ p_t_34_0hml in (0); $ p_t_34_0ml in (0); $ p_t_35_0hml in (0); $ p_t_35_0ml in (0); $ p_reshml in (0); $ p_resml in (0); # Dichotomy for the error bound epsilon $ xhml; interval-2.1.0/src/crlibm/gappa/asin/asinAccuR1.gappa0000644000000000000000000004532413031036767020526 0ustar 00000000000000# The polynomial to implement is: 12733824903478660485213924945761441b-115 + (x * (21274243840621107493132068550861b-104 + (x * (56506575121178698033892645299217b-108 + (x * (162352694585912342011697266345865b-109 + (x * (108824425124571119884970372511875b-109 + (x * (130962285214586424233709645857015b-109 + (x * (64538322654437688214573659252359b-108 + (x * (19138493711791118275730909715341b-106 + (x * (86948317116031170147801372254985b-108 + (x * (2926340027982217b-53 + (x * (7079519916441877b-54 + (x * (4400722769684657b-53 + (x * (2753619111017419b-52 + (x * (1747593133357423b-51 + (x * (1117301179312929b-50 + (x * (2882758419021281b-51 + (x * (7485076380936111b-52 + (x * (4889438710496705b-51 + (x * (6420893266510167b-51 + (x * (8469313684169241b-51 + (x * (701323415166733b-47 + (x * (7696281875237263b-50 + (x * 5166029452007411b-49))))))))))))))))))))))))))))))))))))))))))) # The polynomial implemented is: 12733824903478660485213924945761441b-115 + (x * (21274243840621107493132068550861b-104 + (x * (56506575121178698033892645299217b-108 + (x * (162352694585912342011697266345865b-109 + (x * (108824425124571119884970372511875b-109 + (x * (130962285214586424233709645857015b-109 + (x * (64538322654437688214573659252359b-108 + (x * (19138493711791118275730909715341b-106 + (x * (86948317116031170147801372254985b-108 + (x * (2926340027982217b-53 + (x * (7079519916441877b-54 + (x * (4400722769684657b-53 + (x * (2753619111017419b-52 + (x * (1747593133357423b-51 + (x * (1117301179312929b-50 + (x * (2882758419021281b-51 + (x * (7485076380936111b-52 + (x * (4889438710496705b-51 + (x * (6420893266510167b-51 + (x * (8469313684169241b-51 + (x * (701323415166733b-47 + (x * (7696281875237263b-50 + (x * 5166029452007411b-49))))))))))))))))))))))))))))))))))))))))))) # The domain is [-466363011288839b-53;932726022577599b-54] # The free variable x is a double precision number, the result p_res* is stored on a triple-double number. # The code produces 63 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(3.06555683602418194144689778113388456404209136962890625000000000000000000000000000e-01); p_coeff_0m = double(1.38398751617026410180086928097698669616246328887899420551771401122209681489039212e-19); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.04890120337530645677759366662940010428428649902343750000000000000000000000000000e+00); p_coeff_1m = double(-1.03082627287649058162739898016810705246384011505786371110104937542928382754325867e-16); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(1.74124328129031780143520791170885786414146423339843750000000000000000000000000000e-01); p_coeff_2m = double(-1.22415542219236523063144722572481689558635471916500300770813680628634756430983543e-17); p_coeff_2hm = p_coeff_2h + p_coeff_2m; p_coeff_3h = double(2.50143932843971239510239001901936717331409454345703125000000000000000000000000000e-01); p_coeff_3m = double(-4.13151149720064821141736364751386140320745355927365902171111144980386598035693169e-18); p_coeff_3hm = p_coeff_3h + p_coeff_3m; p_coeff_4h = double(1.67670575222510526147701170884829480201005935668945312500000000000000000000000000e-01); p_coeff_4m = double(9.08471320692536034881317437634606200189439625594786317797080243963137036189436913e-18); p_coeff_4hm = p_coeff_4h + p_coeff_4m; p_coeff_5h = double(2.01779349344123004605933147104224190115928649902343750000000000000000000000000000e-01); p_coeff_5m = double(-2.81327768912778086871203966934740276353563377312707108335310124402894871309399605e-18); p_coeff_5hm = p_coeff_5h + p_coeff_5m; p_coeff_6h = double(1.98874061057130652185875874238263349980115890502929687500000000000000000000000000e-01); p_coeff_6m = double(4.84208641776008377910230190635861197948724910162295737015014651660749223083257675e-18); p_coeff_6hm = p_coeff_6h + p_coeff_6m; p_coeff_7h = double(2.35900148032034129297329627661383710801601409912109375000000000000000000000000000e-01); p_coeff_7m = double(-7.70265627820459694705350308676046582995139915634938421185040624550310894846916199e-18); p_coeff_7hm = p_coeff_7h + p_coeff_7m; p_coeff_8h = double(2.67930188076546671460675952403107658028602600097656250000000000000000000000000000e-01); p_coeff_8m = double(-1.74203278137786025999080009256505191287370077696727496685547009747097035869956017e-17); p_coeff_8hm = p_coeff_8h + p_coeff_8m; p_coeff_9h = double(3.24889007694808218396076426870422437787055969238281250000000000000000000000000000e-01); p_coeff_10h = double(3.92992300726306809099952488395501859486103057861328125000000000000000000000000000e-01); p_coeff_11h = double(4.88578374389609604300233058893354609608650207519531250000000000000000000000000000e-01); p_coeff_12h = double(6.11426267619878727188620359811466187238693237304687500000000000000000000000000000e-01); p_coeff_13h = double(7.76087253732093085289989176089875400066375732421875000000000000000000000000000000e-01); p_coeff_14h = double(9.92362795771243533238248346606269478797912597656250000000000000000000000000000000e-01); p_coeff_15h = double(1.28020190849177639691447438963223248720169067382812500000000000000000000000000000e+00); p_coeff_16h = double(1.66202082783864191206646410137182101607322692871093750000000000000000000000000000e+00); p_coeff_17h = double(2.17134697355479078240136914246249943971633911132812500000000000000000000000000000e+00); p_coeff_18h = double(2.85144941725608758176235824066679924726486206054687500000000000000000000000000000e+00); p_coeff_19h = double(3.76113082197504100534501958463806658983230590820312500000000000000000000000000000e+00); p_coeff_20h = double(4.98320258065187005058760405518114566802978515625000000000000000000000000000000000e+00); p_coeff_21h = double(6.83567147351494863727339179604314267635345458984375000000000000000000000000000000e+00); p_coeff_22h = double(9.17671174961649249723905086284503340721130371093750000000000000000000000000000000e+00); p_t_1_0h = p_coeff_22h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_21h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_20h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_19h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_18h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_17h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_16h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_15h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0hm = p_coeff_14h + p_t_16_0h; p_t_17_0h = double(p_t_17_0hm); p_t_17_0m = p_t_17_0hm - p_t_17_0h; p_t_18_0hm = mul_rel<102>(xh,p_t_17_0hm); p_t_18_0h = double(p_t_18_0hm); p_t_18_0m = p_t_18_0hm - p_t_18_0h; p_t_19_0hm = add_rel<102>(p_coeff_13h,p_t_18_0hm); p_t_19_0h = double(p_t_19_0hm); p_t_19_0m = p_t_19_0hm - p_t_19_0h; p_t_20_0hm = mul_rel<102>(xh,p_t_19_0hm); p_t_20_0h = double(p_t_20_0hm); p_t_20_0m = p_t_20_0hm - p_t_20_0h; p_t_21_0hm = add_rel<102>(p_coeff_12h,p_t_20_0hm); p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = mul_rel<102>(xh,p_t_21_0hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = add_rel<102>(p_coeff_11h,p_t_22_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_t_24_0hm = mul_rel<102>(xh,p_t_23_0hm); p_t_24_0h = double(p_t_24_0hm); p_t_24_0m = p_t_24_0hm - p_t_24_0h; p_t_25_0hm = add_rel<102>(p_coeff_10h,p_t_24_0hm); p_t_25_0h = double(p_t_25_0hm); p_t_25_0m = p_t_25_0hm - p_t_25_0h; p_t_26_0hm = mul_rel<102>(xh,p_t_25_0hm); p_t_26_0h = double(p_t_26_0hm); p_t_26_0m = p_t_26_0hm - p_t_26_0h; p_t_27_0hm = add_rel<102>(p_coeff_9h,p_t_26_0hm); p_t_27_0h = double(p_t_27_0hm); p_t_27_0m = p_t_27_0hm - p_t_27_0h; p_t_28_0hm = fma_rel<100>(p_t_27_0hm,xh,p_coeff_8hm); p_t_28_0h = double(p_t_28_0hm); p_t_28_0m = p_t_28_0hm - p_t_28_0h; p_t_29_0hm = fma_rel<100>(p_t_28_0hm,xh,p_coeff_7hm); p_t_29_0h = double(p_t_29_0hm); p_t_29_0m = p_t_29_0hm - p_t_29_0h; p_t_30_0hm = fma_rel<100>(p_t_29_0hm,xh,p_coeff_6hm); p_t_30_0h = double(p_t_30_0hm); p_t_30_0m = p_t_30_0hm - p_t_30_0h; p_t_31_0hm = fma_rel<100>(p_t_30_0hm,xh,p_coeff_5hm); p_t_31_0h = double(p_t_31_0hm); p_t_31_0m = p_t_31_0hm - p_t_31_0h; p_t_32_0hm = fma_rel<100>(p_t_31_0hm,xh,p_coeff_4hm); p_t_32_0h = double(p_t_32_0hm); p_t_32_0m = p_t_32_0hm - p_t_32_0h; p_t_33_0hm = fma_rel<100>(p_t_32_0hm,xh,p_coeff_3hm); p_t_33_0h = double(p_t_33_0hm); p_t_33_0m = p_t_33_0hm - p_t_33_0h; p_t_34_0hm = mul_rel<102>(xh,p_t_33_0hm); p_t_34_0h = double(p_t_34_0hm); p_t_34_0m = p_t_34_0hm - p_t_34_0h; p_t_35_0hml = add_rel<140>(p_coeff_2hm,p_t_34_0hm); p_t_35_0ml = p_t_35_0hml - p_t_35_0h; p_t_35_0m = double(p_t_35_0ml); p_t_35_0l = p_t_35_0ml - p_t_35_0m; p_t_35_0hm = p_t_35_0h + p_t_35_0m; overlap_p_t_35_0 = p_t_35_0m / p_t_35_0h; p_t_36_0hml = mul_rel<145>(xh,p_t_35_0hml); p_t_36_0ml = p_t_36_0hml - p_t_36_0h; p_t_36_0m = double(p_t_36_0ml); p_t_36_0l = p_t_36_0ml - p_t_36_0m; p_t_36_0hm = p_t_36_0h + p_t_36_0m; overlap_p_t_36_0 = p_t_36_0m / p_t_36_0h; p_t_37_0hml = add_rel<143>(p_coeff_1hm,p_t_36_0hml); p_t_37_0ml = p_t_37_0hml - p_t_37_0h; p_t_37_0m = double(p_t_37_0ml); p_t_37_0l = p_t_37_0ml - p_t_37_0m; p_t_37_0hm = p_t_37_0h + p_t_37_0m; overlap_p_t_37_0 = p_t_37_0m / p_t_37_0h; p_t_38_0hml = mul_rel<135>(xh,p_t_37_0hml); p_t_38_0ml = p_t_38_0hml - p_t_38_0h; p_t_38_0m = double(p_t_38_0ml); p_t_38_0l = p_t_38_0ml - p_t_38_0m; p_t_38_0hm = p_t_38_0h + p_t_38_0m; overlap_p_t_38_0 = p_t_38_0m / p_t_38_0h; p_t_39_0hml = add_rel<133>(p_coeff_0hm,p_t_38_0hml); p_t_39_0ml = p_t_39_0hml - p_t_39_0h; p_t_39_0m = double(p_t_39_0ml); p_t_39_0l = p_t_39_0ml - p_t_39_0m; p_t_39_0hm = p_t_39_0h + p_t_39_0m; overlap_p_t_39_0 = p_t_39_0m / p_t_39_0h; p_reshml = p_t_39_0hml; p_resml = p_reshml - p_resh; p_resm = double(p_resml); p_resl = p_resml - p_resm; p_reshm = p_resh + p_resm; overlap_p_res = p_resm / p_resh; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2hm; Mp_coeff_3 = p_coeff_3hm; Mp_coeff_4 = p_coeff_4hm; Mp_coeff_5 = p_coeff_5hm; Mp_coeff_6 = p_coeff_6hm; Mp_coeff_7 = p_coeff_7hm; Mp_coeff_8 = p_coeff_8hm; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_coeff_13 = p_coeff_13h; Mp_coeff_14 = p_coeff_14h; Mp_coeff_15 = p_coeff_15h; Mp_coeff_16 = p_coeff_16h; Mp_coeff_17 = p_coeff_17h; Mp_coeff_18 = p_coeff_18h; Mp_coeff_19 = p_coeff_19h; Mp_coeff_20 = p_coeff_20h; Mp_coeff_21 = p_coeff_21h; Mp_coeff_22 = p_coeff_22h; Mp_t_1_0 = Mp_coeff_22; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_21 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_20 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_19 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_18 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_17 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_16 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_15 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_14 + Mp_t_16_0; Mp_t_18_0 = Mx * Mp_t_17_0; Mp_t_19_0 = Mp_coeff_13 + Mp_t_18_0; Mp_t_20_0 = Mx * Mp_t_19_0; Mp_t_21_0 = Mp_coeff_12 + Mp_t_20_0; Mp_t_22_0 = Mx * Mp_t_21_0; Mp_t_23_0 = Mp_coeff_11 + Mp_t_22_0; Mp_t_24_0 = Mx * Mp_t_23_0; Mp_t_25_0 = Mp_coeff_10 + Mp_t_24_0; Mp_t_26_0 = Mx * Mp_t_25_0; Mp_t_27_0 = Mp_coeff_9 + Mp_t_26_0; Mp_t_28_0 = (Mp_t_27_0 * Mx) + Mp_coeff_8; Mp_t_29_0 = (Mp_t_28_0 * Mx) + Mp_coeff_7; Mp_t_30_0 = (Mp_t_29_0 * Mx) + Mp_coeff_6; Mp_t_31_0 = (Mp_t_30_0 * Mx) + Mp_coeff_5; Mp_t_32_0 = (Mp_t_31_0 * Mx) + Mp_coeff_4; Mp_t_33_0 = (Mp_t_32_0 * Mx) + Mp_coeff_3; Mp_t_34_0 = Mx * Mp_t_33_0; Mp_t_35_0 = Mp_coeff_2 + Mp_t_34_0; Mp_t_36_0 = Mx * Mp_t_35_0; Mp_t_37_0 = Mp_coeff_1 + Mp_t_36_0; Mp_t_38_0 = Mx * Mp_t_37_0; Mp_t_39_0 = Mp_coeff_0 + Mp_t_38_0; Mp_res = Mp_t_39_0; # Definition of the relative arithmetical error epsilon = (p_reshml - Mp_res) / Mp_res; # Implication to prove {(( x in [-466363011288839b-53,-466363011288839b-453] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] ) \/ ( x in [932726022577599b-454,932726022577599b-54] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_17_0h ~ p_t_17_0hm; p_t_18_0h ~ p_t_18_0hm; p_t_19_0h ~ p_t_19_0hm; p_t_20_0h ~ p_t_20_0hm; p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; p_t_24_0h ~ p_t_24_0hm; p_t_25_0h ~ p_t_25_0hm; p_t_26_0h ~ p_t_26_0hm; p_t_27_0h ~ p_t_27_0hm; p_t_28_0h ~ p_t_28_0hm; p_t_29_0h ~ p_t_29_0hm; p_t_30_0h ~ p_t_30_0hm; p_t_31_0h ~ p_t_31_0hm; p_t_32_0h ~ p_t_32_0hm; p_t_33_0h ~ p_t_33_0hm; p_t_34_0h ~ p_t_34_0hm; p_t_35_0hm ~ p_t_35_0hml; p_t_35_0h ~ p_t_35_0hm; p_t_35_0h ~ p_t_35_0hml; p_t_35_0m -> p_t_35_0h * overlap_p_t_35_0; p_t_35_0l / p_t_35_0m -> - ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml) / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)); (p_t_35_0hm - p_t_35_0hml) / p_t_35_0hml -> - (p_t_35_0l / p_t_35_0m) * (1 / (1 / overlap_p_t_35_0 + 1 + (p_t_35_0l / p_t_35_0m))); p_t_35_0ml -> p_t_35_0hml / ((1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) / overlap_p_t_35_0 + 1); (p_t_35_0h - p_t_35_0hm) / p_t_35_0hm -> - 1 / (1 / overlap_p_t_35_0 + 1); p_t_35_0h -> p_t_35_0hml / (overlap_p_t_35_0 / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) + 1); p_t_36_0hm ~ p_t_36_0hml; p_t_36_0h ~ p_t_36_0hm; p_t_36_0h ~ p_t_36_0hml; p_t_36_0m -> p_t_36_0h * overlap_p_t_36_0; p_t_36_0l / p_t_36_0m -> - ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml) / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)); (p_t_36_0hm - p_t_36_0hml) / p_t_36_0hml -> - (p_t_36_0l / p_t_36_0m) * (1 / (1 / overlap_p_t_36_0 + 1 + (p_t_36_0l / p_t_36_0m))); p_t_36_0ml -> p_t_36_0hml / ((1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) / overlap_p_t_36_0 + 1); (p_t_36_0h - p_t_36_0hm) / p_t_36_0hm -> - 1 / (1 / overlap_p_t_36_0 + 1); p_t_36_0h -> p_t_36_0hml / (overlap_p_t_36_0 / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) + 1); p_t_37_0hm ~ p_t_37_0hml; p_t_37_0h ~ p_t_37_0hm; p_t_37_0h ~ p_t_37_0hml; p_t_37_0m -> p_t_37_0h * overlap_p_t_37_0; p_t_37_0l / p_t_37_0m -> - ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml) / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)); (p_t_37_0hm - p_t_37_0hml) / p_t_37_0hml -> - (p_t_37_0l / p_t_37_0m) * (1 / (1 / overlap_p_t_37_0 + 1 + (p_t_37_0l / p_t_37_0m))); p_t_37_0ml -> p_t_37_0hml / ((1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) / overlap_p_t_37_0 + 1); (p_t_37_0h - p_t_37_0hm) / p_t_37_0hm -> - 1 / (1 / overlap_p_t_37_0 + 1); p_t_37_0h -> p_t_37_0hml / (overlap_p_t_37_0 / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) + 1); p_t_38_0hm ~ p_t_38_0hml; p_t_38_0h ~ p_t_38_0hm; p_t_38_0h ~ p_t_38_0hml; p_t_38_0m -> p_t_38_0h * overlap_p_t_38_0; p_t_38_0l / p_t_38_0m -> - ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml) / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)); (p_t_38_0hm - p_t_38_0hml) / p_t_38_0hml -> - (p_t_38_0l / p_t_38_0m) * (1 / (1 / overlap_p_t_38_0 + 1 + (p_t_38_0l / p_t_38_0m))); p_t_38_0ml -> p_t_38_0hml / ((1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) / overlap_p_t_38_0 + 1); (p_t_38_0h - p_t_38_0hm) / p_t_38_0hm -> - 1 / (1 / overlap_p_t_38_0 + 1); p_t_38_0h -> p_t_38_0hml / (overlap_p_t_38_0 / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) + 1); p_t_39_0hm ~ p_t_39_0hml; p_t_39_0h ~ p_t_39_0hm; p_t_39_0h ~ p_t_39_0hml; p_t_39_0m -> p_t_39_0h * overlap_p_t_39_0; p_t_39_0l / p_t_39_0m -> - ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml) / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)); (p_t_39_0hm - p_t_39_0hml) / p_t_39_0hml -> - (p_t_39_0l / p_t_39_0m) * (1 / (1 / overlap_p_t_39_0 + 1 + (p_t_39_0l / p_t_39_0m))); p_t_39_0ml -> p_t_39_0hml / ((1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) / overlap_p_t_39_0 + 1); (p_t_39_0h - p_t_39_0hm) / p_t_39_0hm -> - 1 / (1 / overlap_p_t_39_0 + 1); p_t_39_0h -> p_t_39_0hml / (overlap_p_t_39_0 / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) + 1); p_reshm ~ p_reshml; p_resh ~ p_reshm; p_resh ~ p_reshml; p_resm -> p_resh * overlap_p_res; p_resl / p_resm -> - ((p_resm - p_resml) / p_resml) / (1 + ((p_resm - p_resml) / p_resml)); (p_reshm - p_reshml) / p_reshml -> - (p_resl / p_resm) * (1 / (1 / overlap_p_res + 1 + (p_resl / p_resm))); p_resml -> p_reshml / ((1 + ((p_resm - p_resml) / p_resml)) / overlap_p_res + 1); (p_resh - p_reshm) / p_reshm -> - 1 / (1 / overlap_p_res + 1); p_resh -> p_reshml / (overlap_p_res / (1 + ((p_resm - p_resml) / p_resml)) + 1); # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0hm ~ Mp_t_17_0; p_t_18_0hm ~ Mp_t_18_0; p_t_19_0hm ~ Mp_t_19_0; p_t_20_0hm ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_t_24_0hm ~ Mp_t_24_0; p_t_25_0hm ~ Mp_t_25_0; p_t_26_0hm ~ Mp_t_26_0; p_t_27_0hm ~ Mp_t_27_0; p_t_28_0hm ~ Mp_t_28_0; p_t_29_0hm ~ Mp_t_29_0; p_t_30_0hm ~ Mp_t_30_0; p_t_31_0hm ~ Mp_t_31_0; p_t_32_0hm ~ Mp_t_32_0; p_t_33_0hm ~ Mp_t_33_0; p_t_34_0hm ~ Mp_t_34_0; p_t_35_0hml ~ Mp_t_35_0; p_t_36_0hml ~ Mp_t_36_0; p_t_37_0hml ~ Mp_t_37_0; p_t_38_0hml ~ Mp_t_38_0; p_t_39_0hml ~ Mp_t_39_0; p_reshml ~ Mp_res; # Dichotomies for triple-double decomposition $ p_t_35_0hml in (0); $ p_t_35_0ml in (0); $ p_t_36_0hml in (0); $ p_t_36_0ml in (0); $ p_t_37_0hml in (0); $ p_t_37_0ml in (0); $ p_t_38_0hml in (0); $ p_t_38_0ml in (0); $ p_t_39_0hml in (0); $ p_t_39_0ml in (0); $ p_reshml in (0); $ p_resml in (0); # Dichotomy for the error bound epsilon $ xhml; interval-2.1.0/src/crlibm/gappa/asin/asinAccuR2.gappa0000644000000000000000000004533113031036767020525 0ustar 00000000000000# The polynomial to implement is: 537273513210223274716288889248434731b-120 + (x * (88240263986999722252297847012357b-106 + (x * (20526577571859871112569155652563b-106 + (x * (107789892750625855992013313785105b-108 + (x * (95062093602682177187811187465689b-108 + (x * (477193384067815679840324642654849b-110 + (x * (572921965627724688446677452418063b-110 + (x * (188719174585036872257517150346289b-108 + (x * (15724977217398503074240774828841b-104 + (x * (4815943101116825b-52 + (x * (3373125240821569b-51 + (x * (4808226395402763b-51 + (x * (3468851253814359b-50 + (x * (5061210136901323b-50 + (x * (7451575477138987b-50 + (x * (5529276895184587b-49 + (x * (8262038822452853b-49 + (x * (6210057040978841b-48 + (x * (4692590307258443b-47 + (x * (3562757466383109b-46 + (x * (2717503836213503b-45 + (x * (8416477620649297b-46 + (x * 396224776159005b-41))))))))))))))))))))))))))))))))))))))))))) # The polynomial implemented is: 537273513210223274716288889248434731b-120 + (x * (88240263986999722252297847012357b-106 + (x * (20526577571859871112569155652563b-106 + (x * (107789892750625855992013313785105b-108 + (x * (95062093602682177187811187465689b-108 + (x * (477193384067815679840324642654849b-110 + (x * (572921965627724688446677452418063b-110 + (x * (188719174585036872257517150346289b-108 + (x * (15724977217398503074240774828841b-104 + (x * (4815943101116825b-52 + (x * (3373125240821569b-51 + (x * (4808226395402763b-51 + (x * (3468851253814359b-50 + (x * (5061210136901323b-50 + (x * (7451575477138987b-50 + (x * (5529276895184587b-49 + (x * (8262038822452853b-49 + (x * (6210057040978841b-48 + (x * (4692590307258443b-47 + (x * (3562757466383109b-46 + (x * (2717503836213503b-45 + (x * (8416477620649297b-46 + (x * 396224776159005b-41))))))))))))))))))))))))))))))))))))))))))) # The domain is [-715705849514187b-54;178926462378499b-52] # The free variable x is a double precision number, the result p_res* is stored on a triple-double number. # The code produces 63 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(4.04199666960039116769820566332782618701457977294921875000000000000000000000000000e-01); p_coeff_0m = double(-6.46825370068901234687011200856515476665908008275043725957432344531028434175823350e-21); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.08764522696446319649510314775398001074790954589843750000000000000000000000000000e+00); p_coeff_1m = double(7.20122509204450857334003577729908463703780203035882678808121681868215091526508331e-17); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(2.53009602569167157959384439891437068581581115722656250000000000000000000000000000e-01); p_coeff_2m = double(-2.62855515233500204494953653812414612827096270443634484781370019845780916512012482e-17); p_coeff_2hm = p_coeff_2h + p_coeff_2m; p_coeff_3h = double(3.32153251441150376699340540653793141245841979980468750000000000000000000000000000e-01); p_coeff_3m = double(-2.17141385535786665092496720426544052591009587195721927677105611564911669120192528e-17); p_coeff_3hm = p_coeff_3h + p_coeff_3m; p_coeff_4h = double(2.92932692232876656923679092869861051440238952636718750000000000000000000000000000e-01); p_coeff_4m = double(-2.54506532782342113657805222827712812531223364242776927013345300565561046823859215e-17); p_coeff_4hm = p_coeff_4h + p_coeff_4m; p_coeff_5h = double(3.67616411055874059421455513074761256575584411621093750000000000000000000000000000e-01); p_coeff_5m = double(-6.76970835849273256879417289105284614692988316998734608931354017613557516597211361e-18); p_coeff_5hm = p_coeff_5h + p_coeff_5m; p_coeff_6h = double(4.41363027759851866971274603201891295611858367919921875000000000000000000000000000e-01); p_coeff_6m = double(-2.90651996480231385490406350336172813253854649135862232844917940610685036517679691e-18); p_coeff_6hm = p_coeff_6h + p_coeff_6m; p_coeff_7h = double(5.81535855061384165942683921457501128315925598144531250000000000000000000000000000e-01); p_coeff_7m = double(2.15506151894707480118506866417280461854749969158187919426872269923478597775101662e-17); p_coeff_7hm = p_coeff_7h + p_coeff_7m; p_coeff_8h = double(7.75301235143548206352193119528237730264663696289062500000000000000000000000000000e-01); p_coeff_8m = double(-5.09980429509694427469186543286592667631136122693286116813737862685229629278182983e-17); p_coeff_8hm = p_coeff_8h + p_coeff_8m; p_coeff_9h = double(1.06935418322891551135001009242841973900794982910156250000000000000000000000000000e+00); p_coeff_10h = double(1.49796852292175275422891900234390050172805786132812500000000000000000000000000000e+00); p_coeff_11h = double(2.13528146071462776589555687678512185811996459960937500000000000000000000000000000e+00); p_coeff_12h = double(3.08095882478763538614430217421613633632659912109375000000000000000000000000000000e+00); p_coeff_13h = double(4.49525762116327154416239864076487720012664794921875000000000000000000000000000000e+00); p_coeff_14h = double(6.61832853156151212914437564904801547527313232421875000000000000000000000000000000e+00); p_coeff_15h = double(9.82196882969892293147040618350729346275329589843750000000000000000000000000000000e+00); p_coeff_16h = double(1.46763291696545170594845330924727022647857666015625000000000000000000000000000000e+01); p_coeff_17h = double(2.20625545956168913619421800831332802772521972656250000000000000000000000000000000e+01); p_coeff_18h = double(3.33428595472074320582578366156667470932006835937500000000000000000000000000000000e+01); p_coeff_19h = double(5.06298287402715487814930384047329425811767578125000000000000000000000000000000000e+01); p_coeff_20h = double(7.72361044088683854624832747504115104675292968750000000000000000000000000000000000e+01); p_coeff_21h = double(1.19605340680796203400859667453914880752563476562500000000000000000000000000000000e+02); p_coeff_22h = double(1.80182167313889749493682757019996643066406250000000000000000000000000000000000000e+02); p_t_1_0h = p_coeff_22h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_21h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_20h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_19h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_18h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_17h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_16h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_15h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0hm = p_coeff_14h + p_t_16_0h; p_t_17_0h = double(p_t_17_0hm); p_t_17_0m = p_t_17_0hm - p_t_17_0h; p_t_18_0hm = mul_rel<102>(xh,p_t_17_0hm); p_t_18_0h = double(p_t_18_0hm); p_t_18_0m = p_t_18_0hm - p_t_18_0h; p_t_19_0hm = add_rel<102>(p_coeff_13h,p_t_18_0hm); p_t_19_0h = double(p_t_19_0hm); p_t_19_0m = p_t_19_0hm - p_t_19_0h; p_t_20_0hm = mul_rel<102>(xh,p_t_19_0hm); p_t_20_0h = double(p_t_20_0hm); p_t_20_0m = p_t_20_0hm - p_t_20_0h; p_t_21_0hm = add_rel<102>(p_coeff_12h,p_t_20_0hm); p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = mul_rel<102>(xh,p_t_21_0hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = add_rel<102>(p_coeff_11h,p_t_22_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_t_24_0hm = mul_rel<102>(xh,p_t_23_0hm); p_t_24_0h = double(p_t_24_0hm); p_t_24_0m = p_t_24_0hm - p_t_24_0h; p_t_25_0hm = add_rel<102>(p_coeff_10h,p_t_24_0hm); p_t_25_0h = double(p_t_25_0hm); p_t_25_0m = p_t_25_0hm - p_t_25_0h; p_t_26_0hm = mul_rel<102>(xh,p_t_25_0hm); p_t_26_0h = double(p_t_26_0hm); p_t_26_0m = p_t_26_0hm - p_t_26_0h; p_t_27_0hm = add_rel<102>(p_coeff_9h,p_t_26_0hm); p_t_27_0h = double(p_t_27_0hm); p_t_27_0m = p_t_27_0hm - p_t_27_0h; p_t_28_0hm = fma_rel<100>(p_t_27_0hm,xh,p_coeff_8hm); p_t_28_0h = double(p_t_28_0hm); p_t_28_0m = p_t_28_0hm - p_t_28_0h; p_t_29_0hm = fma_rel<100>(p_t_28_0hm,xh,p_coeff_7hm); p_t_29_0h = double(p_t_29_0hm); p_t_29_0m = p_t_29_0hm - p_t_29_0h; p_t_30_0hm = fma_rel<100>(p_t_29_0hm,xh,p_coeff_6hm); p_t_30_0h = double(p_t_30_0hm); p_t_30_0m = p_t_30_0hm - p_t_30_0h; p_t_31_0hm = fma_rel<100>(p_t_30_0hm,xh,p_coeff_5hm); p_t_31_0h = double(p_t_31_0hm); p_t_31_0m = p_t_31_0hm - p_t_31_0h; p_t_32_0hm = fma_rel<100>(p_t_31_0hm,xh,p_coeff_4hm); p_t_32_0h = double(p_t_32_0hm); p_t_32_0m = p_t_32_0hm - p_t_32_0h; p_t_33_0hm = fma_rel<100>(p_t_32_0hm,xh,p_coeff_3hm); p_t_33_0h = double(p_t_33_0hm); p_t_33_0m = p_t_33_0hm - p_t_33_0h; p_t_34_0hm = mul_rel<102>(xh,p_t_33_0hm); p_t_34_0h = double(p_t_34_0hm); p_t_34_0m = p_t_34_0hm - p_t_34_0h; p_t_35_0hml = add_rel<140>(p_coeff_2hm,p_t_34_0hm); p_t_35_0ml = p_t_35_0hml - p_t_35_0h; p_t_35_0m = double(p_t_35_0ml); p_t_35_0l = p_t_35_0ml - p_t_35_0m; p_t_35_0hm = p_t_35_0h + p_t_35_0m; overlap_p_t_35_0 = p_t_35_0m / p_t_35_0h; p_t_36_0hml = mul_rel<145>(xh,p_t_35_0hml); p_t_36_0ml = p_t_36_0hml - p_t_36_0h; p_t_36_0m = double(p_t_36_0ml); p_t_36_0l = p_t_36_0ml - p_t_36_0m; p_t_36_0hm = p_t_36_0h + p_t_36_0m; overlap_p_t_36_0 = p_t_36_0m / p_t_36_0h; p_t_37_0hml = add_rel<143>(p_coeff_1hm,p_t_36_0hml); p_t_37_0ml = p_t_37_0hml - p_t_37_0h; p_t_37_0m = double(p_t_37_0ml); p_t_37_0l = p_t_37_0ml - p_t_37_0m; p_t_37_0hm = p_t_37_0h + p_t_37_0m; overlap_p_t_37_0 = p_t_37_0m / p_t_37_0h; p_t_38_0hml = mul_rel<135>(xh,p_t_37_0hml); p_t_38_0ml = p_t_38_0hml - p_t_38_0h; p_t_38_0m = double(p_t_38_0ml); p_t_38_0l = p_t_38_0ml - p_t_38_0m; p_t_38_0hm = p_t_38_0h + p_t_38_0m; overlap_p_t_38_0 = p_t_38_0m / p_t_38_0h; p_t_39_0hml = add_rel<133>(p_coeff_0hm,p_t_38_0hml); p_t_39_0ml = p_t_39_0hml - p_t_39_0h; p_t_39_0m = double(p_t_39_0ml); p_t_39_0l = p_t_39_0ml - p_t_39_0m; p_t_39_0hm = p_t_39_0h + p_t_39_0m; overlap_p_t_39_0 = p_t_39_0m / p_t_39_0h; p_reshml = p_t_39_0hml; p_resml = p_reshml - p_resh; p_resm = double(p_resml); p_resl = p_resml - p_resm; p_reshm = p_resh + p_resm; overlap_p_res = p_resm / p_resh; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2hm; Mp_coeff_3 = p_coeff_3hm; Mp_coeff_4 = p_coeff_4hm; Mp_coeff_5 = p_coeff_5hm; Mp_coeff_6 = p_coeff_6hm; Mp_coeff_7 = p_coeff_7hm; Mp_coeff_8 = p_coeff_8hm; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_coeff_13 = p_coeff_13h; Mp_coeff_14 = p_coeff_14h; Mp_coeff_15 = p_coeff_15h; Mp_coeff_16 = p_coeff_16h; Mp_coeff_17 = p_coeff_17h; Mp_coeff_18 = p_coeff_18h; Mp_coeff_19 = p_coeff_19h; Mp_coeff_20 = p_coeff_20h; Mp_coeff_21 = p_coeff_21h; Mp_coeff_22 = p_coeff_22h; Mp_t_1_0 = Mp_coeff_22; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_21 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_20 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_19 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_18 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_17 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_16 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_15 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_14 + Mp_t_16_0; Mp_t_18_0 = Mx * Mp_t_17_0; Mp_t_19_0 = Mp_coeff_13 + Mp_t_18_0; Mp_t_20_0 = Mx * Mp_t_19_0; Mp_t_21_0 = Mp_coeff_12 + Mp_t_20_0; Mp_t_22_0 = Mx * Mp_t_21_0; Mp_t_23_0 = Mp_coeff_11 + Mp_t_22_0; Mp_t_24_0 = Mx * Mp_t_23_0; Mp_t_25_0 = Mp_coeff_10 + Mp_t_24_0; Mp_t_26_0 = Mx * Mp_t_25_0; Mp_t_27_0 = Mp_coeff_9 + Mp_t_26_0; Mp_t_28_0 = (Mp_t_27_0 * Mx) + Mp_coeff_8; Mp_t_29_0 = (Mp_t_28_0 * Mx) + Mp_coeff_7; Mp_t_30_0 = (Mp_t_29_0 * Mx) + Mp_coeff_6; Mp_t_31_0 = (Mp_t_30_0 * Mx) + Mp_coeff_5; Mp_t_32_0 = (Mp_t_31_0 * Mx) + Mp_coeff_4; Mp_t_33_0 = (Mp_t_32_0 * Mx) + Mp_coeff_3; Mp_t_34_0 = Mx * Mp_t_33_0; Mp_t_35_0 = Mp_coeff_2 + Mp_t_34_0; Mp_t_36_0 = Mx * Mp_t_35_0; Mp_t_37_0 = Mp_coeff_1 + Mp_t_36_0; Mp_t_38_0 = Mx * Mp_t_37_0; Mp_t_39_0 = Mp_coeff_0 + Mp_t_38_0; Mp_res = Mp_t_39_0; # Definition of the relative arithmetical error epsilon = (p_reshml - Mp_res) / Mp_res; # Implication to prove {(( x in [-715705849514187b-54,-715705849514187b-454] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] ) \/ ( x in [178926462378499b-452,178926462378499b-52] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_17_0h ~ p_t_17_0hm; p_t_18_0h ~ p_t_18_0hm; p_t_19_0h ~ p_t_19_0hm; p_t_20_0h ~ p_t_20_0hm; p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; p_t_24_0h ~ p_t_24_0hm; p_t_25_0h ~ p_t_25_0hm; p_t_26_0h ~ p_t_26_0hm; p_t_27_0h ~ p_t_27_0hm; p_t_28_0h ~ p_t_28_0hm; p_t_29_0h ~ p_t_29_0hm; p_t_30_0h ~ p_t_30_0hm; p_t_31_0h ~ p_t_31_0hm; p_t_32_0h ~ p_t_32_0hm; p_t_33_0h ~ p_t_33_0hm; p_t_34_0h ~ p_t_34_0hm; p_t_35_0hm ~ p_t_35_0hml; p_t_35_0h ~ p_t_35_0hm; p_t_35_0h ~ p_t_35_0hml; p_t_35_0m -> p_t_35_0h * overlap_p_t_35_0; p_t_35_0l / p_t_35_0m -> - ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml) / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)); (p_t_35_0hm - p_t_35_0hml) / p_t_35_0hml -> - (p_t_35_0l / p_t_35_0m) * (1 / (1 / overlap_p_t_35_0 + 1 + (p_t_35_0l / p_t_35_0m))); p_t_35_0ml -> p_t_35_0hml / ((1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) / overlap_p_t_35_0 + 1); (p_t_35_0h - p_t_35_0hm) / p_t_35_0hm -> - 1 / (1 / overlap_p_t_35_0 + 1); p_t_35_0h -> p_t_35_0hml / (overlap_p_t_35_0 / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) + 1); p_t_36_0hm ~ p_t_36_0hml; p_t_36_0h ~ p_t_36_0hm; p_t_36_0h ~ p_t_36_0hml; p_t_36_0m -> p_t_36_0h * overlap_p_t_36_0; p_t_36_0l / p_t_36_0m -> - ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml) / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)); (p_t_36_0hm - p_t_36_0hml) / p_t_36_0hml -> - (p_t_36_0l / p_t_36_0m) * (1 / (1 / overlap_p_t_36_0 + 1 + (p_t_36_0l / p_t_36_0m))); p_t_36_0ml -> p_t_36_0hml / ((1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) / overlap_p_t_36_0 + 1); (p_t_36_0h - p_t_36_0hm) / p_t_36_0hm -> - 1 / (1 / overlap_p_t_36_0 + 1); p_t_36_0h -> p_t_36_0hml / (overlap_p_t_36_0 / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) + 1); p_t_37_0hm ~ p_t_37_0hml; p_t_37_0h ~ p_t_37_0hm; p_t_37_0h ~ p_t_37_0hml; p_t_37_0m -> p_t_37_0h * overlap_p_t_37_0; p_t_37_0l / p_t_37_0m -> - ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml) / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)); (p_t_37_0hm - p_t_37_0hml) / p_t_37_0hml -> - (p_t_37_0l / p_t_37_0m) * (1 / (1 / overlap_p_t_37_0 + 1 + (p_t_37_0l / p_t_37_0m))); p_t_37_0ml -> p_t_37_0hml / ((1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) / overlap_p_t_37_0 + 1); (p_t_37_0h - p_t_37_0hm) / p_t_37_0hm -> - 1 / (1 / overlap_p_t_37_0 + 1); p_t_37_0h -> p_t_37_0hml / (overlap_p_t_37_0 / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) + 1); p_t_38_0hm ~ p_t_38_0hml; p_t_38_0h ~ p_t_38_0hm; p_t_38_0h ~ p_t_38_0hml; p_t_38_0m -> p_t_38_0h * overlap_p_t_38_0; p_t_38_0l / p_t_38_0m -> - ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml) / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)); (p_t_38_0hm - p_t_38_0hml) / p_t_38_0hml -> - (p_t_38_0l / p_t_38_0m) * (1 / (1 / overlap_p_t_38_0 + 1 + (p_t_38_0l / p_t_38_0m))); p_t_38_0ml -> p_t_38_0hml / ((1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) / overlap_p_t_38_0 + 1); (p_t_38_0h - p_t_38_0hm) / p_t_38_0hm -> - 1 / (1 / overlap_p_t_38_0 + 1); p_t_38_0h -> p_t_38_0hml / (overlap_p_t_38_0 / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) + 1); p_t_39_0hm ~ p_t_39_0hml; p_t_39_0h ~ p_t_39_0hm; p_t_39_0h ~ p_t_39_0hml; p_t_39_0m -> p_t_39_0h * overlap_p_t_39_0; p_t_39_0l / p_t_39_0m -> - ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml) / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)); (p_t_39_0hm - p_t_39_0hml) / p_t_39_0hml -> - (p_t_39_0l / p_t_39_0m) * (1 / (1 / overlap_p_t_39_0 + 1 + (p_t_39_0l / p_t_39_0m))); p_t_39_0ml -> p_t_39_0hml / ((1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) / overlap_p_t_39_0 + 1); (p_t_39_0h - p_t_39_0hm) / p_t_39_0hm -> - 1 / (1 / overlap_p_t_39_0 + 1); p_t_39_0h -> p_t_39_0hml / (overlap_p_t_39_0 / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) + 1); p_reshm ~ p_reshml; p_resh ~ p_reshm; p_resh ~ p_reshml; p_resm -> p_resh * overlap_p_res; p_resl / p_resm -> - ((p_resm - p_resml) / p_resml) / (1 + ((p_resm - p_resml) / p_resml)); (p_reshm - p_reshml) / p_reshml -> - (p_resl / p_resm) * (1 / (1 / overlap_p_res + 1 + (p_resl / p_resm))); p_resml -> p_reshml / ((1 + ((p_resm - p_resml) / p_resml)) / overlap_p_res + 1); (p_resh - p_reshm) / p_reshm -> - 1 / (1 / overlap_p_res + 1); p_resh -> p_reshml / (overlap_p_res / (1 + ((p_resm - p_resml) / p_resml)) + 1); # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0hm ~ Mp_t_17_0; p_t_18_0hm ~ Mp_t_18_0; p_t_19_0hm ~ Mp_t_19_0; p_t_20_0hm ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_t_24_0hm ~ Mp_t_24_0; p_t_25_0hm ~ Mp_t_25_0; p_t_26_0hm ~ Mp_t_26_0; p_t_27_0hm ~ Mp_t_27_0; p_t_28_0hm ~ Mp_t_28_0; p_t_29_0hm ~ Mp_t_29_0; p_t_30_0hm ~ Mp_t_30_0; p_t_31_0hm ~ Mp_t_31_0; p_t_32_0hm ~ Mp_t_32_0; p_t_33_0hm ~ Mp_t_33_0; p_t_34_0hm ~ Mp_t_34_0; p_t_35_0hml ~ Mp_t_35_0; p_t_36_0hml ~ Mp_t_36_0; p_t_37_0hml ~ Mp_t_37_0; p_t_38_0hml ~ Mp_t_38_0; p_t_39_0hml ~ Mp_t_39_0; p_reshml ~ Mp_res; # Dichotomies for triple-double decomposition $ p_t_35_0hml in (0); $ p_t_35_0ml in (0); $ p_t_36_0hml in (0); $ p_t_36_0ml in (0); $ p_t_37_0hml in (0); $ p_t_37_0ml in (0); $ p_t_38_0hml in (0); $ p_t_38_0ml in (0); $ p_t_39_0hml in (0); $ p_t_39_0ml in (0); $ p_reshml in (0); $ p_resml in (0); # Dichotomy for the error bound epsilon $ xhml; interval-2.1.0/src/crlibm/gappa/asin/asinAccuR3.gappa0000644000000000000000000004532213031036767020526 0ustar 00000000000000# The polynomial to implement is: 630003272697881842134216252575451b-110 + (x * (91721878242709939892136825593527b-106 + (x * (218764722243419548644270705008141b-109 + (x * (143378738160791311151825186528399b-108 + (x * (306937566524655010129262065785625b-109 + (x * (105290255794522793027813910838891b-107 + (x * (292962667643541176300211307509459b-108 + (x * (54339736079161771142781818307313b-105 + (x * (20685535281765286913304275534467b-103 + (x * (7188477576369723b-51 + (x * (2865361488246401b-49 + (x * (2321271569119023b-48 + (x * (7618929984112671b-49 + (x * (6320068526567569b-48 + (x * (5290960389084703b-47 + (x * (8929200830189797b-47 + (x * (3793264268211083b-45 + (x * (6484707195893555b-45 + (x * (1393124273330901b-42 + (x * (4811689001485343b-43 + (x * (1043673078480581b-40 + (x * (7315064190991621b-42 + (x * 6179384798482871b-41))))))))))))))))))))))))))))))))))))))))))) # The polynomial implemented is: 630003272697881842134216252575451b-110 + (x * (91721878242709939892136825593527b-106 + (x * (218764722243419548644270705008141b-109 + (x * (143378738160791311151825186528399b-108 + (x * (306937566524655010129262065785625b-109 + (x * (105290255794522793027813910838891b-107 + (x * (292962667643541176300211307509459b-108 + (x * (54339736079161771142781818307313b-105 + (x * (20685535281765286913304275534467b-103 + (x * (7188477576369723b-51 + (x * (2865361488246401b-49 + (x * (2321271569119023b-48 + (x * (7618929984112671b-49 + (x * (6320068526567569b-48 + (x * (5290960389084703b-47 + (x * (8929200830189797b-47 + (x * (3793264268211083b-45 + (x * (6484707195893555b-45 + (x * (1393124273330901b-42 + (x * (4811689001485343b-43 + (x * (1043673078480581b-40 + (x * (7315064190991621b-42 + (x * 6179384798482871b-41))))))))))))))))))))))))))))))))))))))))))) # The domain is [-603367941593347b-54;301683970796841b-53] # The free variable x is a double precision number, the result p_res* is stored on a triple-double number. # The code produces 63 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(4.85336867180323261461438733022077940404415130615234375000000000000000000000000000e-01); p_coeff_0m = double(2.48711731548431450339898686061161136444646421020973452165048200868113781325519085e-18); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.13055943592368102201817237073555588722229003906250000000000000000000000000000000e+00); p_coeff_1m = double(8.33253077521152707672020411779329031688034814541986283753516318029141984879970551e-17); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(3.37060423475326498277127029723487794399261474609375000000000000000000000000000000e-01); p_coeff_2m = double(-1.06567668725757610844479862637418971752325776427227331522029629695680341683328152e-17); p_coeff_2hm = p_coeff_2h + p_coeff_2m; p_coeff_3h = double(4.41819848339719767338351630314718931913375854492187500000000000000000000000000000e-01); p_coeff_3m = double(1.00442163349492148002936541754087371062381994416120786772772532913222676143050194e-17); p_coeff_3hm = p_coeff_3h + p_coeff_3m; p_coeff_4h = double(4.72912200341745858622743980959057807922363281250000000000000000000000000000000000e-01); p_coeff_4m = double(4.32579192702017095690398912101462577298397752038590716172627992364141391590237617e-18); p_coeff_4hm = p_coeff_4h + p_coeff_4m; p_coeff_5h = double(6.48901300757961929654982213833136484026908874511718750000000000000000000000000000e-01); p_coeff_5m = double(5.53173550473638312502352924376368778723557407693469517573348070982319768518209457e-17); p_coeff_5hm = p_coeff_5h + p_coeff_5m; p_coeff_6h = double(9.02760918723618410730580308154458180069923400878906250000000000000000000000000000e-01); p_coeff_6m = double(1.83127184204758972652773042458306136013081307308989972848500826785311801359057426e-17); p_coeff_6hm = p_coeff_6h + p_coeff_6m; p_coeff_7h = double(1.33957791852745100591448590421350672841072082519531250000000000000000000000000000e+00); p_coeff_7m = double(-8.08660441258249393782142982707336982340679568071958871477988850529072806239128113e-17); p_coeff_7hm = p_coeff_7h + p_coeff_7m; p_coeff_8h = double(2.03975126091931757699171612330246716737747192382812500000000000000000000000000000e+00); p_coeff_8m = double(1.39326386720348649025304457272644525059897659732127683795965822355356067419052124e-16); p_coeff_8hm = p_coeff_8h + p_coeff_8m; p_coeff_9h = double(3.19232532691492343346340021525975316762924194335937500000000000000000000000000000e+00); p_coeff_10h = double(5.08990447700057480062696413369849324226379394531250000000000000000000000000000000e+00); p_coeff_11h = double(8.24681325581985547046315332408994436264038085937500000000000000000000000000000000e+00); p_coeff_12h = double(1.35339383861901847438957702252082526683807373046875000000000000000000000000000000e+01); p_coeff_13h = double(2.24533939052931295066173333907499909400939941406250000000000000000000000000000000e+01); p_coeff_14h = double(3.75945346965856899146274372469633817672729492187500000000000000000000000000000000e+01); p_coeff_15h = double(6.34457878603441614018265681806951761245727539062500000000000000000000000000000000e+01); p_coeff_16h = double(1.07811054823829493898301734589040279388427734375000000000000000000000000000000000e+02); p_coeff_17h = double(1.84306463662936579339657328091561794281005859375000000000000000000000000000000000e+02); p_coeff_18h = double(3.16759786376428792209480889141559600830078125000000000000000000000000000000000000e+02); p_coeff_19h = double(5.47025706678748861122585367411375045776367187500000000000000000000000000000000000e+02); p_coeff_20h = double(9.49215135261129944410640746355056762695312500000000000000000000000000000000000000e+02); p_coeff_21h = double(1.66325303120893772756971884518861770629882812500000000000000000000000000000000000e+03); p_coeff_22h = double(2.81005886721817250872845761477947235107421875000000000000000000000000000000000000e+03); p_t_1_0h = p_coeff_22h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_21h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_20h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_19h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_18h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_17h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_16h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_15h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0hm = p_coeff_14h + p_t_16_0h; p_t_17_0h = double(p_t_17_0hm); p_t_17_0m = p_t_17_0hm - p_t_17_0h; p_t_18_0hm = mul_rel<102>(xh,p_t_17_0hm); p_t_18_0h = double(p_t_18_0hm); p_t_18_0m = p_t_18_0hm - p_t_18_0h; p_t_19_0hm = add_rel<102>(p_coeff_13h,p_t_18_0hm); p_t_19_0h = double(p_t_19_0hm); p_t_19_0m = p_t_19_0hm - p_t_19_0h; p_t_20_0hm = mul_rel<102>(xh,p_t_19_0hm); p_t_20_0h = double(p_t_20_0hm); p_t_20_0m = p_t_20_0hm - p_t_20_0h; p_t_21_0hm = add_rel<102>(p_coeff_12h,p_t_20_0hm); p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = mul_rel<102>(xh,p_t_21_0hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = add_rel<102>(p_coeff_11h,p_t_22_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_t_24_0hm = mul_rel<102>(xh,p_t_23_0hm); p_t_24_0h = double(p_t_24_0hm); p_t_24_0m = p_t_24_0hm - p_t_24_0h; p_t_25_0hm = add_rel<102>(p_coeff_10h,p_t_24_0hm); p_t_25_0h = double(p_t_25_0hm); p_t_25_0m = p_t_25_0hm - p_t_25_0h; p_t_26_0hm = mul_rel<102>(xh,p_t_25_0hm); p_t_26_0h = double(p_t_26_0hm); p_t_26_0m = p_t_26_0hm - p_t_26_0h; p_t_27_0hm = add_rel<102>(p_coeff_9h,p_t_26_0hm); p_t_27_0h = double(p_t_27_0hm); p_t_27_0m = p_t_27_0hm - p_t_27_0h; p_t_28_0hm = fma_rel<100>(p_t_27_0hm,xh,p_coeff_8hm); p_t_28_0h = double(p_t_28_0hm); p_t_28_0m = p_t_28_0hm - p_t_28_0h; p_t_29_0hm = fma_rel<100>(p_t_28_0hm,xh,p_coeff_7hm); p_t_29_0h = double(p_t_29_0hm); p_t_29_0m = p_t_29_0hm - p_t_29_0h; p_t_30_0hm = fma_rel<100>(p_t_29_0hm,xh,p_coeff_6hm); p_t_30_0h = double(p_t_30_0hm); p_t_30_0m = p_t_30_0hm - p_t_30_0h; p_t_31_0hm = fma_rel<100>(p_t_30_0hm,xh,p_coeff_5hm); p_t_31_0h = double(p_t_31_0hm); p_t_31_0m = p_t_31_0hm - p_t_31_0h; p_t_32_0hm = fma_rel<100>(p_t_31_0hm,xh,p_coeff_4hm); p_t_32_0h = double(p_t_32_0hm); p_t_32_0m = p_t_32_0hm - p_t_32_0h; p_t_33_0hm = fma_rel<100>(p_t_32_0hm,xh,p_coeff_3hm); p_t_33_0h = double(p_t_33_0hm); p_t_33_0m = p_t_33_0hm - p_t_33_0h; p_t_34_0hm = mul_rel<102>(xh,p_t_33_0hm); p_t_34_0h = double(p_t_34_0hm); p_t_34_0m = p_t_34_0hm - p_t_34_0h; p_t_35_0hml = add_rel<140>(p_coeff_2hm,p_t_34_0hm); p_t_35_0ml = p_t_35_0hml - p_t_35_0h; p_t_35_0m = double(p_t_35_0ml); p_t_35_0l = p_t_35_0ml - p_t_35_0m; p_t_35_0hm = p_t_35_0h + p_t_35_0m; overlap_p_t_35_0 = p_t_35_0m / p_t_35_0h; p_t_36_0hml = mul_rel<145>(xh,p_t_35_0hml); p_t_36_0ml = p_t_36_0hml - p_t_36_0h; p_t_36_0m = double(p_t_36_0ml); p_t_36_0l = p_t_36_0ml - p_t_36_0m; p_t_36_0hm = p_t_36_0h + p_t_36_0m; overlap_p_t_36_0 = p_t_36_0m / p_t_36_0h; p_t_37_0hml = add_rel<143>(p_coeff_1hm,p_t_36_0hml); p_t_37_0ml = p_t_37_0hml - p_t_37_0h; p_t_37_0m = double(p_t_37_0ml); p_t_37_0l = p_t_37_0ml - p_t_37_0m; p_t_37_0hm = p_t_37_0h + p_t_37_0m; overlap_p_t_37_0 = p_t_37_0m / p_t_37_0h; p_t_38_0hml = mul_rel<135>(xh,p_t_37_0hml); p_t_38_0ml = p_t_38_0hml - p_t_38_0h; p_t_38_0m = double(p_t_38_0ml); p_t_38_0l = p_t_38_0ml - p_t_38_0m; p_t_38_0hm = p_t_38_0h + p_t_38_0m; overlap_p_t_38_0 = p_t_38_0m / p_t_38_0h; p_t_39_0hml = add_rel<133>(p_coeff_0hm,p_t_38_0hml); p_t_39_0ml = p_t_39_0hml - p_t_39_0h; p_t_39_0m = double(p_t_39_0ml); p_t_39_0l = p_t_39_0ml - p_t_39_0m; p_t_39_0hm = p_t_39_0h + p_t_39_0m; overlap_p_t_39_0 = p_t_39_0m / p_t_39_0h; p_reshml = p_t_39_0hml; p_resml = p_reshml - p_resh; p_resm = double(p_resml); p_resl = p_resml - p_resm; p_reshm = p_resh + p_resm; overlap_p_res = p_resm / p_resh; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2hm; Mp_coeff_3 = p_coeff_3hm; Mp_coeff_4 = p_coeff_4hm; Mp_coeff_5 = p_coeff_5hm; Mp_coeff_6 = p_coeff_6hm; Mp_coeff_7 = p_coeff_7hm; Mp_coeff_8 = p_coeff_8hm; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_coeff_13 = p_coeff_13h; Mp_coeff_14 = p_coeff_14h; Mp_coeff_15 = p_coeff_15h; Mp_coeff_16 = p_coeff_16h; Mp_coeff_17 = p_coeff_17h; Mp_coeff_18 = p_coeff_18h; Mp_coeff_19 = p_coeff_19h; Mp_coeff_20 = p_coeff_20h; Mp_coeff_21 = p_coeff_21h; Mp_coeff_22 = p_coeff_22h; Mp_t_1_0 = Mp_coeff_22; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_21 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_20 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_19 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_18 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_17 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_16 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_15 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_14 + Mp_t_16_0; Mp_t_18_0 = Mx * Mp_t_17_0; Mp_t_19_0 = Mp_coeff_13 + Mp_t_18_0; Mp_t_20_0 = Mx * Mp_t_19_0; Mp_t_21_0 = Mp_coeff_12 + Mp_t_20_0; Mp_t_22_0 = Mx * Mp_t_21_0; Mp_t_23_0 = Mp_coeff_11 + Mp_t_22_0; Mp_t_24_0 = Mx * Mp_t_23_0; Mp_t_25_0 = Mp_coeff_10 + Mp_t_24_0; Mp_t_26_0 = Mx * Mp_t_25_0; Mp_t_27_0 = Mp_coeff_9 + Mp_t_26_0; Mp_t_28_0 = (Mp_t_27_0 * Mx) + Mp_coeff_8; Mp_t_29_0 = (Mp_t_28_0 * Mx) + Mp_coeff_7; Mp_t_30_0 = (Mp_t_29_0 * Mx) + Mp_coeff_6; Mp_t_31_0 = (Mp_t_30_0 * Mx) + Mp_coeff_5; Mp_t_32_0 = (Mp_t_31_0 * Mx) + Mp_coeff_4; Mp_t_33_0 = (Mp_t_32_0 * Mx) + Mp_coeff_3; Mp_t_34_0 = Mx * Mp_t_33_0; Mp_t_35_0 = Mp_coeff_2 + Mp_t_34_0; Mp_t_36_0 = Mx * Mp_t_35_0; Mp_t_37_0 = Mp_coeff_1 + Mp_t_36_0; Mp_t_38_0 = Mx * Mp_t_37_0; Mp_t_39_0 = Mp_coeff_0 + Mp_t_38_0; Mp_res = Mp_t_39_0; # Definition of the relative arithmetical error epsilon = (p_reshml - Mp_res) / Mp_res; # Implication to prove {(( x in [-603367941593347b-54,-603367941593347b-454] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] ) \/ ( x in [301683970796841b-453,301683970796841b-53] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_17_0h ~ p_t_17_0hm; p_t_18_0h ~ p_t_18_0hm; p_t_19_0h ~ p_t_19_0hm; p_t_20_0h ~ p_t_20_0hm; p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; p_t_24_0h ~ p_t_24_0hm; p_t_25_0h ~ p_t_25_0hm; p_t_26_0h ~ p_t_26_0hm; p_t_27_0h ~ p_t_27_0hm; p_t_28_0h ~ p_t_28_0hm; p_t_29_0h ~ p_t_29_0hm; p_t_30_0h ~ p_t_30_0hm; p_t_31_0h ~ p_t_31_0hm; p_t_32_0h ~ p_t_32_0hm; p_t_33_0h ~ p_t_33_0hm; p_t_34_0h ~ p_t_34_0hm; p_t_35_0hm ~ p_t_35_0hml; p_t_35_0h ~ p_t_35_0hm; p_t_35_0h ~ p_t_35_0hml; p_t_35_0m -> p_t_35_0h * overlap_p_t_35_0; p_t_35_0l / p_t_35_0m -> - ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml) / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)); (p_t_35_0hm - p_t_35_0hml) / p_t_35_0hml -> - (p_t_35_0l / p_t_35_0m) * (1 / (1 / overlap_p_t_35_0 + 1 + (p_t_35_0l / p_t_35_0m))); p_t_35_0ml -> p_t_35_0hml / ((1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) / overlap_p_t_35_0 + 1); (p_t_35_0h - p_t_35_0hm) / p_t_35_0hm -> - 1 / (1 / overlap_p_t_35_0 + 1); p_t_35_0h -> p_t_35_0hml / (overlap_p_t_35_0 / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) + 1); p_t_36_0hm ~ p_t_36_0hml; p_t_36_0h ~ p_t_36_0hm; p_t_36_0h ~ p_t_36_0hml; p_t_36_0m -> p_t_36_0h * overlap_p_t_36_0; p_t_36_0l / p_t_36_0m -> - ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml) / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)); (p_t_36_0hm - p_t_36_0hml) / p_t_36_0hml -> - (p_t_36_0l / p_t_36_0m) * (1 / (1 / overlap_p_t_36_0 + 1 + (p_t_36_0l / p_t_36_0m))); p_t_36_0ml -> p_t_36_0hml / ((1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) / overlap_p_t_36_0 + 1); (p_t_36_0h - p_t_36_0hm) / p_t_36_0hm -> - 1 / (1 / overlap_p_t_36_0 + 1); p_t_36_0h -> p_t_36_0hml / (overlap_p_t_36_0 / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) + 1); p_t_37_0hm ~ p_t_37_0hml; p_t_37_0h ~ p_t_37_0hm; p_t_37_0h ~ p_t_37_0hml; p_t_37_0m -> p_t_37_0h * overlap_p_t_37_0; p_t_37_0l / p_t_37_0m -> - ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml) / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)); (p_t_37_0hm - p_t_37_0hml) / p_t_37_0hml -> - (p_t_37_0l / p_t_37_0m) * (1 / (1 / overlap_p_t_37_0 + 1 + (p_t_37_0l / p_t_37_0m))); p_t_37_0ml -> p_t_37_0hml / ((1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) / overlap_p_t_37_0 + 1); (p_t_37_0h - p_t_37_0hm) / p_t_37_0hm -> - 1 / (1 / overlap_p_t_37_0 + 1); p_t_37_0h -> p_t_37_0hml / (overlap_p_t_37_0 / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) + 1); p_t_38_0hm ~ p_t_38_0hml; p_t_38_0h ~ p_t_38_0hm; p_t_38_0h ~ p_t_38_0hml; p_t_38_0m -> p_t_38_0h * overlap_p_t_38_0; p_t_38_0l / p_t_38_0m -> - ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml) / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)); (p_t_38_0hm - p_t_38_0hml) / p_t_38_0hml -> - (p_t_38_0l / p_t_38_0m) * (1 / (1 / overlap_p_t_38_0 + 1 + (p_t_38_0l / p_t_38_0m))); p_t_38_0ml -> p_t_38_0hml / ((1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) / overlap_p_t_38_0 + 1); (p_t_38_0h - p_t_38_0hm) / p_t_38_0hm -> - 1 / (1 / overlap_p_t_38_0 + 1); p_t_38_0h -> p_t_38_0hml / (overlap_p_t_38_0 / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) + 1); p_t_39_0hm ~ p_t_39_0hml; p_t_39_0h ~ p_t_39_0hm; p_t_39_0h ~ p_t_39_0hml; p_t_39_0m -> p_t_39_0h * overlap_p_t_39_0; p_t_39_0l / p_t_39_0m -> - ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml) / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)); (p_t_39_0hm - p_t_39_0hml) / p_t_39_0hml -> - (p_t_39_0l / p_t_39_0m) * (1 / (1 / overlap_p_t_39_0 + 1 + (p_t_39_0l / p_t_39_0m))); p_t_39_0ml -> p_t_39_0hml / ((1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) / overlap_p_t_39_0 + 1); (p_t_39_0h - p_t_39_0hm) / p_t_39_0hm -> - 1 / (1 / overlap_p_t_39_0 + 1); p_t_39_0h -> p_t_39_0hml / (overlap_p_t_39_0 / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) + 1); p_reshm ~ p_reshml; p_resh ~ p_reshm; p_resh ~ p_reshml; p_resm -> p_resh * overlap_p_res; p_resl / p_resm -> - ((p_resm - p_resml) / p_resml) / (1 + ((p_resm - p_resml) / p_resml)); (p_reshm - p_reshml) / p_reshml -> - (p_resl / p_resm) * (1 / (1 / overlap_p_res + 1 + (p_resl / p_resm))); p_resml -> p_reshml / ((1 + ((p_resm - p_resml) / p_resml)) / overlap_p_res + 1); (p_resh - p_reshm) / p_reshm -> - 1 / (1 / overlap_p_res + 1); p_resh -> p_reshml / (overlap_p_res / (1 + ((p_resm - p_resml) / p_resml)) + 1); # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0hm ~ Mp_t_17_0; p_t_18_0hm ~ Mp_t_18_0; p_t_19_0hm ~ Mp_t_19_0; p_t_20_0hm ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_t_24_0hm ~ Mp_t_24_0; p_t_25_0hm ~ Mp_t_25_0; p_t_26_0hm ~ Mp_t_26_0; p_t_27_0hm ~ Mp_t_27_0; p_t_28_0hm ~ Mp_t_28_0; p_t_29_0hm ~ Mp_t_29_0; p_t_30_0hm ~ Mp_t_30_0; p_t_31_0hm ~ Mp_t_31_0; p_t_32_0hm ~ Mp_t_32_0; p_t_33_0hm ~ Mp_t_33_0; p_t_34_0hm ~ Mp_t_34_0; p_t_35_0hml ~ Mp_t_35_0; p_t_36_0hml ~ Mp_t_36_0; p_t_37_0hml ~ Mp_t_37_0; p_t_38_0hml ~ Mp_t_38_0; p_t_39_0hml ~ Mp_t_39_0; p_reshml ~ Mp_res; # Dichotomies for triple-double decomposition $ p_t_35_0hml in (0); $ p_t_35_0ml in (0); $ p_t_36_0hml in (0); $ p_t_36_0ml in (0); $ p_t_37_0hml in (0); $ p_t_37_0ml in (0); $ p_t_38_0hml in (0); $ p_t_38_0ml in (0); $ p_t_39_0hml in (0); $ p_t_39_0ml in (0); $ p_reshml in (0); $ p_resml in (0); # Dichotomy for the error bound epsilon $ xhml; interval-2.1.0/src/crlibm/gappa/asin/asinAccuR4.gappa0000644000000000000000000004531313031036767020527 0ustar 00000000000000# The polynomial to implement is: 23179288235074235572414273684753507b-115 + (x * (3060396379323915655525965395989715b-111 + (x * (140743048026270511662877904535769b-108 + (x * (192160797867958272369452195721767b-108 + (x * (60484226630360230815207732200825b-106 + (x * (92348318688015868651166719352511b-106 + (x * (36688451231400427366893071297149b-104 + (x * (61518808568240203990282236793039b-104 + (x * (13291614381561738069979153918799b-101 + (x * (2617096155665713b-48 + (x * (591488490579095b-45 + (x * (2173007049277499b-46 + (x * (8087008738508987b-47 + (x * (1901529448151669b-44 + (x * (902491660970179b-42 + (x * (863474430653389b-41 + (x * (6654746176145717b-43 + (x * (6449723213208583b-42 + (x * (6284418716064433b-41 + (x * (3077265176489673b-39 + (x * (3027664741461211b-38 + (x * (370529235053615b-34 + (x * 5644104751496821b-37))))))))))))))))))))))))))))))))))))))))))) # The polynomial implemented is: 23179288235074235572414273684753507b-115 + (x * (3060396379323915655525965395989715b-111 + (x * (140743048026270511662877904535769b-108 + (x * (192160797867958272369452195721767b-108 + (x * (60484226630360230815207732200825b-106 + (x * (92348318688015868651166719352511b-106 + (x * (36688451231400427366893071297149b-104 + (x * (61518808568240203990282236793039b-104 + (x * (13291614381561738069979153918799b-101 + (x * (2617096155665713b-48 + (x * (591488490579095b-45 + (x * (2173007049277499b-46 + (x * (8087008738508987b-47 + (x * (1901529448151669b-44 + (x * (902491660970179b-42 + (x * (863474430653389b-41 + (x * (6654746176145717b-43 + (x * (6449723213208583b-42 + (x * (6284418716064433b-41 + (x * (3077265176489673b-39 + (x * (3027664741461211b-38 + (x * (370529235053615b-34 + (x * 5644104751496821b-37))))))))))))))))))))))))))))))))))))))))))) # The domain is [-66447228468955b-51;265788913875259b-53] # The free variable x is a double precision number, the result p_res* is stored on a triple-double number. # The code produces 63 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(5.58021066268902909968119274708442389965057373046875000000000000000000000000000000e-01); p_coeff_0m = double(9.14056635248981946291334736807400951779846267656755277007663007537985322414897382e-20); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.17882180572684136521388609253335744142532348632812500000000000000000000000000000e+00); p_coeff_1m = double(2.57506761959083747975269601591872190204330911429892510960959484123122820165008307e-18); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(4.33698001053000381510571514809271320700645446777343750000000000000000000000000000e-01); p_coeff_2m = double(-1.13987489167043526825762332057111190978471845558278249810335580605169525370001793e-17); p_coeff_2hm = p_coeff_2h + p_coeff_2m; p_coeff_3h = double(5.92141175601989977472783266421174630522727966308593750000000000000000000000000000e-01); p_coeff_3m = double(1.51434599074934130528344780896022003291074232766760462864930047999223461374640465e-17); p_coeff_3hm = p_coeff_3h + p_coeff_3m; p_coeff_4h = double(7.45525652675293803994804875401314347982406616210937500000000000000000000000000000e-01); p_coeff_4m = double(-4.95666529120828261720386639182573717908098482969568576717023233868530951440334320e-17); p_coeff_4hm = p_coeff_4h + p_coeff_4m; p_coeff_5h = double(1.13828091056041680317889586149249225854873657226562500000000000000000000000000000e+00); p_coeff_5m = double(6.30476130024642952826684347359752494928069360322596403900519135277136228978633881e-17); p_coeff_5hm = p_coeff_5h + p_coeff_5m; p_coeff_6h = double(1.80888030309746783430568939365912228822708129882812500000000000000000000000000000e+00); p_coeff_6m = double(6.53471855925770582546264336577217040248932212759963578108113324560690671205520630e-17); p_coeff_6hm = p_coeff_6h + p_coeff_6m; p_coeff_7h = double(3.03311143845375674743536364985629916191101074218750000000000000000000000000000000e+00); p_coeff_7m = double(-2.14585117370534459252749227343052173552538040022033549725222201232099905610084534e-16); p_coeff_7hm = p_coeff_7h + p_coeff_7m; p_coeff_8h = double(5.24261747644370590393236852833069860935211181640625000000000000000000000000000000e+00); p_coeff_8m = double(-5.46512862978737750269761176067830595023185492192796530730447557289153337478637695e-17); p_coeff_8hm = p_coeff_8h + p_coeff_8m; p_coeff_9h = double(9.29779331096978367554584110621362924575805664062500000000000000000000000000000000e+00); p_coeff_10h = double(1.68111140106672962701850337907671928405761718750000000000000000000000000000000000e+01); p_coeff_11h = double(3.08802874723923395094971056096255779266357421875000000000000000000000000000000000e+01); p_coeff_12h = double(5.74616531317601229034153220709413290023803710937500000000000000000000000000000000e+01); p_coeff_13h = double(1.08089434897446437844337197020649909973144531250000000000000000000000000000000000e+02); p_coeff_14h = double(2.05202846011656902192044071853160858154296875000000000000000000000000000000000000e+02); p_coeff_15h = double(3.92662709897826516680652275681495666503906250000000000000000000000000000000000000e+02); p_coeff_16h = double(7.56557048606022931380721274763345718383789062500000000000000000000000000000000000e+02); p_coeff_17h = double(1.46649727257876816111092921346426010131835937500000000000000000000000000000000000e+03); p_coeff_18h = double(2.85782276299161503629875369369983673095703125000000000000000000000000000000000000e+03); p_coeff_19h = double(5.59751274793538505036849528551101684570312500000000000000000000000000000000000000e+03); p_coeff_20h = double(1.10145801644146959006320685148239135742187500000000000000000000000000000000000000e+04); p_coeff_21h = double(2.15676400725272833369672298431396484375000000000000000000000000000000000000000000e+04); p_coeff_22h = double(4.10662669419021476642228662967681884765625000000000000000000000000000000000000000e+04); p_t_1_0h = p_coeff_22h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_21h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_20h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_19h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_18h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_17h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_16h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_15h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0hm = p_coeff_14h + p_t_16_0h; p_t_17_0h = double(p_t_17_0hm); p_t_17_0m = p_t_17_0hm - p_t_17_0h; p_t_18_0hm = mul_rel<102>(xh,p_t_17_0hm); p_t_18_0h = double(p_t_18_0hm); p_t_18_0m = p_t_18_0hm - p_t_18_0h; p_t_19_0hm = add_rel<102>(p_coeff_13h,p_t_18_0hm); p_t_19_0h = double(p_t_19_0hm); p_t_19_0m = p_t_19_0hm - p_t_19_0h; p_t_20_0hm = mul_rel<102>(xh,p_t_19_0hm); p_t_20_0h = double(p_t_20_0hm); p_t_20_0m = p_t_20_0hm - p_t_20_0h; p_t_21_0hm = add_rel<102>(p_coeff_12h,p_t_20_0hm); p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = mul_rel<102>(xh,p_t_21_0hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = add_rel<102>(p_coeff_11h,p_t_22_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_t_24_0hm = mul_rel<102>(xh,p_t_23_0hm); p_t_24_0h = double(p_t_24_0hm); p_t_24_0m = p_t_24_0hm - p_t_24_0h; p_t_25_0hm = add_rel<102>(p_coeff_10h,p_t_24_0hm); p_t_25_0h = double(p_t_25_0hm); p_t_25_0m = p_t_25_0hm - p_t_25_0h; p_t_26_0hm = mul_rel<102>(xh,p_t_25_0hm); p_t_26_0h = double(p_t_26_0hm); p_t_26_0m = p_t_26_0hm - p_t_26_0h; p_t_27_0hm = add_rel<102>(p_coeff_9h,p_t_26_0hm); p_t_27_0h = double(p_t_27_0hm); p_t_27_0m = p_t_27_0hm - p_t_27_0h; p_t_28_0hm = fma_rel<100>(p_t_27_0hm,xh,p_coeff_8hm); p_t_28_0h = double(p_t_28_0hm); p_t_28_0m = p_t_28_0hm - p_t_28_0h; p_t_29_0hm = fma_rel<100>(p_t_28_0hm,xh,p_coeff_7hm); p_t_29_0h = double(p_t_29_0hm); p_t_29_0m = p_t_29_0hm - p_t_29_0h; p_t_30_0hm = fma_rel<100>(p_t_29_0hm,xh,p_coeff_6hm); p_t_30_0h = double(p_t_30_0hm); p_t_30_0m = p_t_30_0hm - p_t_30_0h; p_t_31_0hm = fma_rel<100>(p_t_30_0hm,xh,p_coeff_5hm); p_t_31_0h = double(p_t_31_0hm); p_t_31_0m = p_t_31_0hm - p_t_31_0h; p_t_32_0hm = fma_rel<100>(p_t_31_0hm,xh,p_coeff_4hm); p_t_32_0h = double(p_t_32_0hm); p_t_32_0m = p_t_32_0hm - p_t_32_0h; p_t_33_0hm = fma_rel<100>(p_t_32_0hm,xh,p_coeff_3hm); p_t_33_0h = double(p_t_33_0hm); p_t_33_0m = p_t_33_0hm - p_t_33_0h; p_t_34_0hm = mul_rel<102>(xh,p_t_33_0hm); p_t_34_0h = double(p_t_34_0hm); p_t_34_0m = p_t_34_0hm - p_t_34_0h; p_t_35_0hml = add_rel<140>(p_coeff_2hm,p_t_34_0hm); p_t_35_0ml = p_t_35_0hml - p_t_35_0h; p_t_35_0m = double(p_t_35_0ml); p_t_35_0l = p_t_35_0ml - p_t_35_0m; p_t_35_0hm = p_t_35_0h + p_t_35_0m; overlap_p_t_35_0 = p_t_35_0m / p_t_35_0h; p_t_36_0hml = mul_rel<145>(xh,p_t_35_0hml); p_t_36_0ml = p_t_36_0hml - p_t_36_0h; p_t_36_0m = double(p_t_36_0ml); p_t_36_0l = p_t_36_0ml - p_t_36_0m; p_t_36_0hm = p_t_36_0h + p_t_36_0m; overlap_p_t_36_0 = p_t_36_0m / p_t_36_0h; p_t_37_0hml = add_rel<143>(p_coeff_1hm,p_t_36_0hml); p_t_37_0ml = p_t_37_0hml - p_t_37_0h; p_t_37_0m = double(p_t_37_0ml); p_t_37_0l = p_t_37_0ml - p_t_37_0m; p_t_37_0hm = p_t_37_0h + p_t_37_0m; overlap_p_t_37_0 = p_t_37_0m / p_t_37_0h; p_t_38_0hml = mul_rel<135>(xh,p_t_37_0hml); p_t_38_0ml = p_t_38_0hml - p_t_38_0h; p_t_38_0m = double(p_t_38_0ml); p_t_38_0l = p_t_38_0ml - p_t_38_0m; p_t_38_0hm = p_t_38_0h + p_t_38_0m; overlap_p_t_38_0 = p_t_38_0m / p_t_38_0h; p_t_39_0hml = add_rel<133>(p_coeff_0hm,p_t_38_0hml); p_t_39_0ml = p_t_39_0hml - p_t_39_0h; p_t_39_0m = double(p_t_39_0ml); p_t_39_0l = p_t_39_0ml - p_t_39_0m; p_t_39_0hm = p_t_39_0h + p_t_39_0m; overlap_p_t_39_0 = p_t_39_0m / p_t_39_0h; p_reshml = p_t_39_0hml; p_resml = p_reshml - p_resh; p_resm = double(p_resml); p_resl = p_resml - p_resm; p_reshm = p_resh + p_resm; overlap_p_res = p_resm / p_resh; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2hm; Mp_coeff_3 = p_coeff_3hm; Mp_coeff_4 = p_coeff_4hm; Mp_coeff_5 = p_coeff_5hm; Mp_coeff_6 = p_coeff_6hm; Mp_coeff_7 = p_coeff_7hm; Mp_coeff_8 = p_coeff_8hm; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_coeff_13 = p_coeff_13h; Mp_coeff_14 = p_coeff_14h; Mp_coeff_15 = p_coeff_15h; Mp_coeff_16 = p_coeff_16h; Mp_coeff_17 = p_coeff_17h; Mp_coeff_18 = p_coeff_18h; Mp_coeff_19 = p_coeff_19h; Mp_coeff_20 = p_coeff_20h; Mp_coeff_21 = p_coeff_21h; Mp_coeff_22 = p_coeff_22h; Mp_t_1_0 = Mp_coeff_22; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_21 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_20 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_19 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_18 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_17 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_16 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_15 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_14 + Mp_t_16_0; Mp_t_18_0 = Mx * Mp_t_17_0; Mp_t_19_0 = Mp_coeff_13 + Mp_t_18_0; Mp_t_20_0 = Mx * Mp_t_19_0; Mp_t_21_0 = Mp_coeff_12 + Mp_t_20_0; Mp_t_22_0 = Mx * Mp_t_21_0; Mp_t_23_0 = Mp_coeff_11 + Mp_t_22_0; Mp_t_24_0 = Mx * Mp_t_23_0; Mp_t_25_0 = Mp_coeff_10 + Mp_t_24_0; Mp_t_26_0 = Mx * Mp_t_25_0; Mp_t_27_0 = Mp_coeff_9 + Mp_t_26_0; Mp_t_28_0 = (Mp_t_27_0 * Mx) + Mp_coeff_8; Mp_t_29_0 = (Mp_t_28_0 * Mx) + Mp_coeff_7; Mp_t_30_0 = (Mp_t_29_0 * Mx) + Mp_coeff_6; Mp_t_31_0 = (Mp_t_30_0 * Mx) + Mp_coeff_5; Mp_t_32_0 = (Mp_t_31_0 * Mx) + Mp_coeff_4; Mp_t_33_0 = (Mp_t_32_0 * Mx) + Mp_coeff_3; Mp_t_34_0 = Mx * Mp_t_33_0; Mp_t_35_0 = Mp_coeff_2 + Mp_t_34_0; Mp_t_36_0 = Mx * Mp_t_35_0; Mp_t_37_0 = Mp_coeff_1 + Mp_t_36_0; Mp_t_38_0 = Mx * Mp_t_37_0; Mp_t_39_0 = Mp_coeff_0 + Mp_t_38_0; Mp_res = Mp_t_39_0; # Definition of the relative arithmetical error epsilon = (p_reshml - Mp_res) / Mp_res; # Implication to prove {(( x in [-66447228468955b-51,-66447228468955b-451] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] ) \/ ( x in [265788913875259b-453,265788913875259b-53] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_17_0h ~ p_t_17_0hm; p_t_18_0h ~ p_t_18_0hm; p_t_19_0h ~ p_t_19_0hm; p_t_20_0h ~ p_t_20_0hm; p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; p_t_24_0h ~ p_t_24_0hm; p_t_25_0h ~ p_t_25_0hm; p_t_26_0h ~ p_t_26_0hm; p_t_27_0h ~ p_t_27_0hm; p_t_28_0h ~ p_t_28_0hm; p_t_29_0h ~ p_t_29_0hm; p_t_30_0h ~ p_t_30_0hm; p_t_31_0h ~ p_t_31_0hm; p_t_32_0h ~ p_t_32_0hm; p_t_33_0h ~ p_t_33_0hm; p_t_34_0h ~ p_t_34_0hm; p_t_35_0hm ~ p_t_35_0hml; p_t_35_0h ~ p_t_35_0hm; p_t_35_0h ~ p_t_35_0hml; p_t_35_0m -> p_t_35_0h * overlap_p_t_35_0; p_t_35_0l / p_t_35_0m -> - ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml) / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)); (p_t_35_0hm - p_t_35_0hml) / p_t_35_0hml -> - (p_t_35_0l / p_t_35_0m) * (1 / (1 / overlap_p_t_35_0 + 1 + (p_t_35_0l / p_t_35_0m))); p_t_35_0ml -> p_t_35_0hml / ((1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) / overlap_p_t_35_0 + 1); (p_t_35_0h - p_t_35_0hm) / p_t_35_0hm -> - 1 / (1 / overlap_p_t_35_0 + 1); p_t_35_0h -> p_t_35_0hml / (overlap_p_t_35_0 / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) + 1); p_t_36_0hm ~ p_t_36_0hml; p_t_36_0h ~ p_t_36_0hm; p_t_36_0h ~ p_t_36_0hml; p_t_36_0m -> p_t_36_0h * overlap_p_t_36_0; p_t_36_0l / p_t_36_0m -> - ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml) / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)); (p_t_36_0hm - p_t_36_0hml) / p_t_36_0hml -> - (p_t_36_0l / p_t_36_0m) * (1 / (1 / overlap_p_t_36_0 + 1 + (p_t_36_0l / p_t_36_0m))); p_t_36_0ml -> p_t_36_0hml / ((1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) / overlap_p_t_36_0 + 1); (p_t_36_0h - p_t_36_0hm) / p_t_36_0hm -> - 1 / (1 / overlap_p_t_36_0 + 1); p_t_36_0h -> p_t_36_0hml / (overlap_p_t_36_0 / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) + 1); p_t_37_0hm ~ p_t_37_0hml; p_t_37_0h ~ p_t_37_0hm; p_t_37_0h ~ p_t_37_0hml; p_t_37_0m -> p_t_37_0h * overlap_p_t_37_0; p_t_37_0l / p_t_37_0m -> - ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml) / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)); (p_t_37_0hm - p_t_37_0hml) / p_t_37_0hml -> - (p_t_37_0l / p_t_37_0m) * (1 / (1 / overlap_p_t_37_0 + 1 + (p_t_37_0l / p_t_37_0m))); p_t_37_0ml -> p_t_37_0hml / ((1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) / overlap_p_t_37_0 + 1); (p_t_37_0h - p_t_37_0hm) / p_t_37_0hm -> - 1 / (1 / overlap_p_t_37_0 + 1); p_t_37_0h -> p_t_37_0hml / (overlap_p_t_37_0 / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) + 1); p_t_38_0hm ~ p_t_38_0hml; p_t_38_0h ~ p_t_38_0hm; p_t_38_0h ~ p_t_38_0hml; p_t_38_0m -> p_t_38_0h * overlap_p_t_38_0; p_t_38_0l / p_t_38_0m -> - ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml) / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)); (p_t_38_0hm - p_t_38_0hml) / p_t_38_0hml -> - (p_t_38_0l / p_t_38_0m) * (1 / (1 / overlap_p_t_38_0 + 1 + (p_t_38_0l / p_t_38_0m))); p_t_38_0ml -> p_t_38_0hml / ((1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) / overlap_p_t_38_0 + 1); (p_t_38_0h - p_t_38_0hm) / p_t_38_0hm -> - 1 / (1 / overlap_p_t_38_0 + 1); p_t_38_0h -> p_t_38_0hml / (overlap_p_t_38_0 / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) + 1); p_t_39_0hm ~ p_t_39_0hml; p_t_39_0h ~ p_t_39_0hm; p_t_39_0h ~ p_t_39_0hml; p_t_39_0m -> p_t_39_0h * overlap_p_t_39_0; p_t_39_0l / p_t_39_0m -> - ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml) / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)); (p_t_39_0hm - p_t_39_0hml) / p_t_39_0hml -> - (p_t_39_0l / p_t_39_0m) * (1 / (1 / overlap_p_t_39_0 + 1 + (p_t_39_0l / p_t_39_0m))); p_t_39_0ml -> p_t_39_0hml / ((1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) / overlap_p_t_39_0 + 1); (p_t_39_0h - p_t_39_0hm) / p_t_39_0hm -> - 1 / (1 / overlap_p_t_39_0 + 1); p_t_39_0h -> p_t_39_0hml / (overlap_p_t_39_0 / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) + 1); p_reshm ~ p_reshml; p_resh ~ p_reshm; p_resh ~ p_reshml; p_resm -> p_resh * overlap_p_res; p_resl / p_resm -> - ((p_resm - p_resml) / p_resml) / (1 + ((p_resm - p_resml) / p_resml)); (p_reshm - p_reshml) / p_reshml -> - (p_resl / p_resm) * (1 / (1 / overlap_p_res + 1 + (p_resl / p_resm))); p_resml -> p_reshml / ((1 + ((p_resm - p_resml) / p_resml)) / overlap_p_res + 1); (p_resh - p_reshm) / p_reshm -> - 1 / (1 / overlap_p_res + 1); p_resh -> p_reshml / (overlap_p_res / (1 + ((p_resm - p_resml) / p_resml)) + 1); # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0hm ~ Mp_t_17_0; p_t_18_0hm ~ Mp_t_18_0; p_t_19_0hm ~ Mp_t_19_0; p_t_20_0hm ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_t_24_0hm ~ Mp_t_24_0; p_t_25_0hm ~ Mp_t_25_0; p_t_26_0hm ~ Mp_t_26_0; p_t_27_0hm ~ Mp_t_27_0; p_t_28_0hm ~ Mp_t_28_0; p_t_29_0hm ~ Mp_t_29_0; p_t_30_0hm ~ Mp_t_30_0; p_t_31_0hm ~ Mp_t_31_0; p_t_32_0hm ~ Mp_t_32_0; p_t_33_0hm ~ Mp_t_33_0; p_t_34_0hm ~ Mp_t_34_0; p_t_35_0hml ~ Mp_t_35_0; p_t_36_0hml ~ Mp_t_36_0; p_t_37_0hml ~ Mp_t_37_0; p_t_38_0hml ~ Mp_t_38_0; p_t_39_0hml ~ Mp_t_39_0; p_reshml ~ Mp_res; # Dichotomies for triple-double decomposition $ p_t_35_0hml in (0); $ p_t_35_0ml in (0); $ p_t_36_0hml in (0); $ p_t_36_0ml in (0); $ p_t_37_0hml in (0); $ p_t_37_0ml in (0); $ p_t_38_0hml in (0); $ p_t_38_0ml in (0); $ p_t_39_0hml in (0); $ p_t_39_0ml in (0); $ p_reshml in (0); $ p_resml in (0); # Dichotomy for the error bound epsilon $ xhml; interval-2.1.0/src/crlibm/gappa/asin/asinAccuR5.gappa0000644000000000000000000004532213031036767020530 0ustar 00000000000000# The polynomial to implement is: 207936752306311063879596363241397575b-118 + (x * (200188677279957379313404027895927b-107 + (x * (44618069117890863136015301040417b-106 + (x * (260684645695147510943269794340145b-108 + (x * (381061457037558230442783063668111b-108 + (x * (81771898601459245984531837067169b-105 + (x * (74010517123253970985200791902569b-104 + (x * (140730399485913888056405477478093b-104 + (x * (69075144564109197184455554933769b-102 + (x * (1930159181128091b-46 + (x * (495367769220905b-43 + (x * (8265972462160073b-46 + (x * (8733056710727285b-45 + (x * (4663575235242669b-43 + (x * (2513454672531187b-41 + (x * (1365405966868523b-39 + (x * (5974899153588327b-40 + (x * (3287993622923969b-38 + (x * (7276245728935959b-38 + (x * (8086590392420483b-37 + (x * (2257198020248361b-34 + (x * (5210712187241083b-34 + (x * 5860188613098115b-33))))))))))))))))))))))))))))))))))))))))))) # The polynomial implemented is: 207936752306311063879596363241397575b-118 + (x * (200188677279957379313404027895927b-107 + (x * (44618069117890863136015301040417b-106 + (x * (260684645695147510943269794340145b-108 + (x * (381061457037558230442783063668111b-108 + (x * (81771898601459245984531837067169b-105 + (x * (74010517123253970985200791902569b-104 + (x * (140730399485913888056405477478093b-104 + (x * (69075144564109197184455554933769b-102 + (x * (1930159181128091b-46 + (x * (495367769220905b-43 + (x * (8265972462160073b-46 + (x * (8733056710727285b-45 + (x * (4663575235242669b-43 + (x * (2513454672531187b-41 + (x * (1365405966868523b-39 + (x * (5974899153588327b-40 + (x * (3287993622923969b-38 + (x * (7276245728935959b-38 + (x * (8086590392420483b-37 + (x * (2257198020248361b-34 + (x * (5210712187241083b-34 + (x * 5860188613098115b-33))))))))))))))))))))))))))))))))))))))))))) # The domain is [-120145772825149b-52;60072886412803b-51] # The free variable x is a double precision number, the result p_res* is stored on a triple-double number. # The code produces 63 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(6.25736902820868912122875826753443107008934020996093750000000000000000000000000000e-01); p_coeff_0m = double(1.03044861946200352361105560063972534424839340803290894401332555840866689322865568e-20); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.23375797792237640315704538807040080428123474121093750000000000000000000000000000e+00); p_coeff_1m = double(-1.56943153280384722085732805658465945105123195556662968330741136924189049750566483e-17); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(5.49960162399266483390647408668883144855499267578125000000000000000000000000000000e-01); p_coeff_2m = double(4.77724544586887245869366226653936105958167895554379589473370515406713820993900299e-17); p_coeff_2hm = p_coeff_2h + p_coeff_2m; p_coeff_3h = double(8.03296584298018756520320948766311630606651306152343750000000000000000000000000000e-01); p_coeff_3m = double(8.24298592592304193429233278946371287822415169276122487440616737330856267362833023e-18); p_coeff_3hm = p_coeff_3h + p_coeff_3m; p_coeff_4h = double(1.17423627321674173273891028657089918851852416992187500000000000000000000000000000e+00); p_coeff_4m = double(6.51885136427795249608596859127055587343811181939758764292136561380175407975912094e-18); p_coeff_4hm = p_coeff_4h + p_coeff_4m; p_coeff_5h = double(2.01583293601212298895575258939061313867568969726562500000000000000000000000000000e+00); p_coeff_5m = double(-1.74898605368430358273924263609101302050140983100449953990818130478146485984325409e-16); p_coeff_5hm = p_coeff_5h + p_coeff_5m; p_coeff_6h = double(3.64900022085783248826373892370611429214477539062500000000000000000000000000000000e+00); p_coeff_6m = double(1.43304714197470670030886399120078425706334125872346008101487768726656213402748108e-16); p_coeff_6hm = p_coeff_6h + p_coeff_6m; p_coeff_7h = double(6.93854439566079062018388867727480828762054443359375000000000000000000000000000000e+00); p_coeff_7m = double(-3.60750117305009285790273957823616258349535174413877380850124154676450416445732117e-16); p_coeff_7hm = p_coeff_7h + p_coeff_7m; p_coeff_8h = double(1.36226702672788579917551032849587500095367431640625000000000000000000000000000000e+01); p_coeff_8m = double(5.62980642478103599614115253967152086402971956392848884576096679666079580783843994e-16); p_coeff_8hm = p_coeff_8h + p_coeff_8m; p_coeff_9h = double(2.74292117002245703361040796153247356414794921875000000000000000000000000000000000e+01); p_coeff_10h = double(5.63167951919359666135278530418872833251953125000000000000000000000000000000000000e+01); p_coeff_11h = double(1.17466533739617389642262423876672983169555664062500000000000000000000000000000000e+02); p_coeff_12h = double(2.48208400271530678082854137755930423736572265625000000000000000000000000000000000e+02); p_coeff_13h = double(5.30187120971580611694662366062402725219726562500000000000000000000000000000000000e+02); p_coeff_14h = double(1.14298685390676246242946945130825042724609375000000000000000000000000000000000000e+03); p_coeff_15h = double(2.48365898527212812041398137807846069335937500000000000000000000000000000000000000e+03); p_coeff_16h = double(5.43413912381613681645831093192100524902343750000000000000000000000000000000000000e+03); p_coeff_17h = double(1.19616511180501001945231109857559204101562500000000000000000000000000000000000000e+04); p_coeff_18h = double(2.64708277570606114750262349843978881835937500000000000000000000000000000000000000e+04); p_coeff_19h = double(5.88376889385143513209186494350433349609375000000000000000000000000000000000000000e+04); p_coeff_20h = double(1.31386216977166535798460245132446289062500000000000000000000000000000000000000000e+05); p_coeff_21h = double(3.03303368112601048778742551803588867187500000000000000000000000000000000000000000e+05); p_coeff_22h = double(6.82215743360355845652520656585693359375000000000000000000000000000000000000000000e+05); p_t_1_0h = p_coeff_22h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_21h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_20h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_19h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_18h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_17h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_16h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_15h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0hm = p_coeff_14h + p_t_16_0h; p_t_17_0h = double(p_t_17_0hm); p_t_17_0m = p_t_17_0hm - p_t_17_0h; p_t_18_0hm = mul_rel<102>(xh,p_t_17_0hm); p_t_18_0h = double(p_t_18_0hm); p_t_18_0m = p_t_18_0hm - p_t_18_0h; p_t_19_0hm = add_rel<102>(p_coeff_13h,p_t_18_0hm); p_t_19_0h = double(p_t_19_0hm); p_t_19_0m = p_t_19_0hm - p_t_19_0h; p_t_20_0hm = mul_rel<102>(xh,p_t_19_0hm); p_t_20_0h = double(p_t_20_0hm); p_t_20_0m = p_t_20_0hm - p_t_20_0h; p_t_21_0hm = add_rel<102>(p_coeff_12h,p_t_20_0hm); p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = mul_rel<102>(xh,p_t_21_0hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = add_rel<102>(p_coeff_11h,p_t_22_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_t_24_0hm = mul_rel<102>(xh,p_t_23_0hm); p_t_24_0h = double(p_t_24_0hm); p_t_24_0m = p_t_24_0hm - p_t_24_0h; p_t_25_0hm = add_rel<102>(p_coeff_10h,p_t_24_0hm); p_t_25_0h = double(p_t_25_0hm); p_t_25_0m = p_t_25_0hm - p_t_25_0h; p_t_26_0hm = mul_rel<102>(xh,p_t_25_0hm); p_t_26_0h = double(p_t_26_0hm); p_t_26_0m = p_t_26_0hm - p_t_26_0h; p_t_27_0hm = add_rel<102>(p_coeff_9h,p_t_26_0hm); p_t_27_0h = double(p_t_27_0hm); p_t_27_0m = p_t_27_0hm - p_t_27_0h; p_t_28_0hm = fma_rel<100>(p_t_27_0hm,xh,p_coeff_8hm); p_t_28_0h = double(p_t_28_0hm); p_t_28_0m = p_t_28_0hm - p_t_28_0h; p_t_29_0hm = fma_rel<100>(p_t_28_0hm,xh,p_coeff_7hm); p_t_29_0h = double(p_t_29_0hm); p_t_29_0m = p_t_29_0hm - p_t_29_0h; p_t_30_0hm = fma_rel<100>(p_t_29_0hm,xh,p_coeff_6hm); p_t_30_0h = double(p_t_30_0hm); p_t_30_0m = p_t_30_0hm - p_t_30_0h; p_t_31_0hm = fma_rel<100>(p_t_30_0hm,xh,p_coeff_5hm); p_t_31_0h = double(p_t_31_0hm); p_t_31_0m = p_t_31_0hm - p_t_31_0h; p_t_32_0hm = fma_rel<100>(p_t_31_0hm,xh,p_coeff_4hm); p_t_32_0h = double(p_t_32_0hm); p_t_32_0m = p_t_32_0hm - p_t_32_0h; p_t_33_0hm = fma_rel<100>(p_t_32_0hm,xh,p_coeff_3hm); p_t_33_0h = double(p_t_33_0hm); p_t_33_0m = p_t_33_0hm - p_t_33_0h; p_t_34_0hm = mul_rel<102>(xh,p_t_33_0hm); p_t_34_0h = double(p_t_34_0hm); p_t_34_0m = p_t_34_0hm - p_t_34_0h; p_t_35_0hml = add_rel<140>(p_coeff_2hm,p_t_34_0hm); p_t_35_0ml = p_t_35_0hml - p_t_35_0h; p_t_35_0m = double(p_t_35_0ml); p_t_35_0l = p_t_35_0ml - p_t_35_0m; p_t_35_0hm = p_t_35_0h + p_t_35_0m; overlap_p_t_35_0 = p_t_35_0m / p_t_35_0h; p_t_36_0hml = mul_rel<145>(xh,p_t_35_0hml); p_t_36_0ml = p_t_36_0hml - p_t_36_0h; p_t_36_0m = double(p_t_36_0ml); p_t_36_0l = p_t_36_0ml - p_t_36_0m; p_t_36_0hm = p_t_36_0h + p_t_36_0m; overlap_p_t_36_0 = p_t_36_0m / p_t_36_0h; p_t_37_0hml = add_rel<143>(p_coeff_1hm,p_t_36_0hml); p_t_37_0ml = p_t_37_0hml - p_t_37_0h; p_t_37_0m = double(p_t_37_0ml); p_t_37_0l = p_t_37_0ml - p_t_37_0m; p_t_37_0hm = p_t_37_0h + p_t_37_0m; overlap_p_t_37_0 = p_t_37_0m / p_t_37_0h; p_t_38_0hml = mul_rel<135>(xh,p_t_37_0hml); p_t_38_0ml = p_t_38_0hml - p_t_38_0h; p_t_38_0m = double(p_t_38_0ml); p_t_38_0l = p_t_38_0ml - p_t_38_0m; p_t_38_0hm = p_t_38_0h + p_t_38_0m; overlap_p_t_38_0 = p_t_38_0m / p_t_38_0h; p_t_39_0hml = add_rel<133>(p_coeff_0hm,p_t_38_0hml); p_t_39_0ml = p_t_39_0hml - p_t_39_0h; p_t_39_0m = double(p_t_39_0ml); p_t_39_0l = p_t_39_0ml - p_t_39_0m; p_t_39_0hm = p_t_39_0h + p_t_39_0m; overlap_p_t_39_0 = p_t_39_0m / p_t_39_0h; p_reshml = p_t_39_0hml; p_resml = p_reshml - p_resh; p_resm = double(p_resml); p_resl = p_resml - p_resm; p_reshm = p_resh + p_resm; overlap_p_res = p_resm / p_resh; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2hm; Mp_coeff_3 = p_coeff_3hm; Mp_coeff_4 = p_coeff_4hm; Mp_coeff_5 = p_coeff_5hm; Mp_coeff_6 = p_coeff_6hm; Mp_coeff_7 = p_coeff_7hm; Mp_coeff_8 = p_coeff_8hm; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_coeff_13 = p_coeff_13h; Mp_coeff_14 = p_coeff_14h; Mp_coeff_15 = p_coeff_15h; Mp_coeff_16 = p_coeff_16h; Mp_coeff_17 = p_coeff_17h; Mp_coeff_18 = p_coeff_18h; Mp_coeff_19 = p_coeff_19h; Mp_coeff_20 = p_coeff_20h; Mp_coeff_21 = p_coeff_21h; Mp_coeff_22 = p_coeff_22h; Mp_t_1_0 = Mp_coeff_22; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_21 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_20 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_19 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_18 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_17 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_16 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_15 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_14 + Mp_t_16_0; Mp_t_18_0 = Mx * Mp_t_17_0; Mp_t_19_0 = Mp_coeff_13 + Mp_t_18_0; Mp_t_20_0 = Mx * Mp_t_19_0; Mp_t_21_0 = Mp_coeff_12 + Mp_t_20_0; Mp_t_22_0 = Mx * Mp_t_21_0; Mp_t_23_0 = Mp_coeff_11 + Mp_t_22_0; Mp_t_24_0 = Mx * Mp_t_23_0; Mp_t_25_0 = Mp_coeff_10 + Mp_t_24_0; Mp_t_26_0 = Mx * Mp_t_25_0; Mp_t_27_0 = Mp_coeff_9 + Mp_t_26_0; Mp_t_28_0 = (Mp_t_27_0 * Mx) + Mp_coeff_8; Mp_t_29_0 = (Mp_t_28_0 * Mx) + Mp_coeff_7; Mp_t_30_0 = (Mp_t_29_0 * Mx) + Mp_coeff_6; Mp_t_31_0 = (Mp_t_30_0 * Mx) + Mp_coeff_5; Mp_t_32_0 = (Mp_t_31_0 * Mx) + Mp_coeff_4; Mp_t_33_0 = (Mp_t_32_0 * Mx) + Mp_coeff_3; Mp_t_34_0 = Mx * Mp_t_33_0; Mp_t_35_0 = Mp_coeff_2 + Mp_t_34_0; Mp_t_36_0 = Mx * Mp_t_35_0; Mp_t_37_0 = Mp_coeff_1 + Mp_t_36_0; Mp_t_38_0 = Mx * Mp_t_37_0; Mp_t_39_0 = Mp_coeff_0 + Mp_t_38_0; Mp_res = Mp_t_39_0; # Definition of the relative arithmetical error epsilon = (p_reshml - Mp_res) / Mp_res; # Implication to prove {(( x in [-120145772825149b-52,-120145772825149b-452] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] ) \/ ( x in [60072886412803b-451,60072886412803b-51] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_17_0h ~ p_t_17_0hm; p_t_18_0h ~ p_t_18_0hm; p_t_19_0h ~ p_t_19_0hm; p_t_20_0h ~ p_t_20_0hm; p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; p_t_24_0h ~ p_t_24_0hm; p_t_25_0h ~ p_t_25_0hm; p_t_26_0h ~ p_t_26_0hm; p_t_27_0h ~ p_t_27_0hm; p_t_28_0h ~ p_t_28_0hm; p_t_29_0h ~ p_t_29_0hm; p_t_30_0h ~ p_t_30_0hm; p_t_31_0h ~ p_t_31_0hm; p_t_32_0h ~ p_t_32_0hm; p_t_33_0h ~ p_t_33_0hm; p_t_34_0h ~ p_t_34_0hm; p_t_35_0hm ~ p_t_35_0hml; p_t_35_0h ~ p_t_35_0hm; p_t_35_0h ~ p_t_35_0hml; p_t_35_0m -> p_t_35_0h * overlap_p_t_35_0; p_t_35_0l / p_t_35_0m -> - ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml) / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)); (p_t_35_0hm - p_t_35_0hml) / p_t_35_0hml -> - (p_t_35_0l / p_t_35_0m) * (1 / (1 / overlap_p_t_35_0 + 1 + (p_t_35_0l / p_t_35_0m))); p_t_35_0ml -> p_t_35_0hml / ((1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) / overlap_p_t_35_0 + 1); (p_t_35_0h - p_t_35_0hm) / p_t_35_0hm -> - 1 / (1 / overlap_p_t_35_0 + 1); p_t_35_0h -> p_t_35_0hml / (overlap_p_t_35_0 / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) + 1); p_t_36_0hm ~ p_t_36_0hml; p_t_36_0h ~ p_t_36_0hm; p_t_36_0h ~ p_t_36_0hml; p_t_36_0m -> p_t_36_0h * overlap_p_t_36_0; p_t_36_0l / p_t_36_0m -> - ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml) / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)); (p_t_36_0hm - p_t_36_0hml) / p_t_36_0hml -> - (p_t_36_0l / p_t_36_0m) * (1 / (1 / overlap_p_t_36_0 + 1 + (p_t_36_0l / p_t_36_0m))); p_t_36_0ml -> p_t_36_0hml / ((1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) / overlap_p_t_36_0 + 1); (p_t_36_0h - p_t_36_0hm) / p_t_36_0hm -> - 1 / (1 / overlap_p_t_36_0 + 1); p_t_36_0h -> p_t_36_0hml / (overlap_p_t_36_0 / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) + 1); p_t_37_0hm ~ p_t_37_0hml; p_t_37_0h ~ p_t_37_0hm; p_t_37_0h ~ p_t_37_0hml; p_t_37_0m -> p_t_37_0h * overlap_p_t_37_0; p_t_37_0l / p_t_37_0m -> - ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml) / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)); (p_t_37_0hm - p_t_37_0hml) / p_t_37_0hml -> - (p_t_37_0l / p_t_37_0m) * (1 / (1 / overlap_p_t_37_0 + 1 + (p_t_37_0l / p_t_37_0m))); p_t_37_0ml -> p_t_37_0hml / ((1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) / overlap_p_t_37_0 + 1); (p_t_37_0h - p_t_37_0hm) / p_t_37_0hm -> - 1 / (1 / overlap_p_t_37_0 + 1); p_t_37_0h -> p_t_37_0hml / (overlap_p_t_37_0 / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) + 1); p_t_38_0hm ~ p_t_38_0hml; p_t_38_0h ~ p_t_38_0hm; p_t_38_0h ~ p_t_38_0hml; p_t_38_0m -> p_t_38_0h * overlap_p_t_38_0; p_t_38_0l / p_t_38_0m -> - ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml) / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)); (p_t_38_0hm - p_t_38_0hml) / p_t_38_0hml -> - (p_t_38_0l / p_t_38_0m) * (1 / (1 / overlap_p_t_38_0 + 1 + (p_t_38_0l / p_t_38_0m))); p_t_38_0ml -> p_t_38_0hml / ((1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) / overlap_p_t_38_0 + 1); (p_t_38_0h - p_t_38_0hm) / p_t_38_0hm -> - 1 / (1 / overlap_p_t_38_0 + 1); p_t_38_0h -> p_t_38_0hml / (overlap_p_t_38_0 / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) + 1); p_t_39_0hm ~ p_t_39_0hml; p_t_39_0h ~ p_t_39_0hm; p_t_39_0h ~ p_t_39_0hml; p_t_39_0m -> p_t_39_0h * overlap_p_t_39_0; p_t_39_0l / p_t_39_0m -> - ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml) / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)); (p_t_39_0hm - p_t_39_0hml) / p_t_39_0hml -> - (p_t_39_0l / p_t_39_0m) * (1 / (1 / overlap_p_t_39_0 + 1 + (p_t_39_0l / p_t_39_0m))); p_t_39_0ml -> p_t_39_0hml / ((1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) / overlap_p_t_39_0 + 1); (p_t_39_0h - p_t_39_0hm) / p_t_39_0hm -> - 1 / (1 / overlap_p_t_39_0 + 1); p_t_39_0h -> p_t_39_0hml / (overlap_p_t_39_0 / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) + 1); p_reshm ~ p_reshml; p_resh ~ p_reshm; p_resh ~ p_reshml; p_resm -> p_resh * overlap_p_res; p_resl / p_resm -> - ((p_resm - p_resml) / p_resml) / (1 + ((p_resm - p_resml) / p_resml)); (p_reshm - p_reshml) / p_reshml -> - (p_resl / p_resm) * (1 / (1 / overlap_p_res + 1 + (p_resl / p_resm))); p_resml -> p_reshml / ((1 + ((p_resm - p_resml) / p_resml)) / overlap_p_res + 1); (p_resh - p_reshm) / p_reshm -> - 1 / (1 / overlap_p_res + 1); p_resh -> p_reshml / (overlap_p_res / (1 + ((p_resm - p_resml) / p_resml)) + 1); # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0hm ~ Mp_t_17_0; p_t_18_0hm ~ Mp_t_18_0; p_t_19_0hm ~ Mp_t_19_0; p_t_20_0hm ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_t_24_0hm ~ Mp_t_24_0; p_t_25_0hm ~ Mp_t_25_0; p_t_26_0hm ~ Mp_t_26_0; p_t_27_0hm ~ Mp_t_27_0; p_t_28_0hm ~ Mp_t_28_0; p_t_29_0hm ~ Mp_t_29_0; p_t_30_0hm ~ Mp_t_30_0; p_t_31_0hm ~ Mp_t_31_0; p_t_32_0hm ~ Mp_t_32_0; p_t_33_0hm ~ Mp_t_33_0; p_t_34_0hm ~ Mp_t_34_0; p_t_35_0hml ~ Mp_t_35_0; p_t_36_0hml ~ Mp_t_36_0; p_t_37_0hml ~ Mp_t_37_0; p_t_38_0hml ~ Mp_t_38_0; p_t_39_0hml ~ Mp_t_39_0; p_reshml ~ Mp_res; # Dichotomies for triple-double decomposition $ p_t_35_0hml in (0); $ p_t_35_0ml in (0); $ p_t_36_0hml in (0); $ p_t_36_0ml in (0); $ p_t_37_0hml in (0); $ p_t_37_0ml in (0); $ p_t_38_0hml in (0); $ p_t_38_0ml in (0); $ p_t_39_0hml in (0); $ p_t_39_0ml in (0); $ p_reshml in (0); $ p_resml in (0); # Dichotomy for the error bound epsilon $ xhml; interval-2.1.0/src/crlibm/gappa/asin/asinAccuR6.gappa0000644000000000000000000004530413031036767020531 0ustar 00000000000000# The polynomial to implement is: 1792581242326710567212291806223253b-111 + (x * (52617200066848308332099303297945b-105 + (x * (902150187593629183958092782443033b-110 + (x * (44965428859892640751057159071087b-105 + (x * (4752633902292393250779852752339b-101 + (x * (148125601965768399364062017841291b-105 + (x * (153165790916719773608400395315619b-104 + (x * (41511842370824976233500266801317b-101 + (x * (23248649506122112562773990099117b-99 + (x * (370572309710903b-42 + (x * (6944699428013305b-45 + (x * (4131783695767297b-43 + (x * (2490319441786495b-41 + (x * (3034706834572899b-40 + (x * (933084968080141b-37 + (x * (2313432583692069b-37 + (x * (5775407383919483b-37 + (x * (906590116929055b-33 + (x * (2289170179319731b-33 + (x * (2903438112538227b-32 + (x * (7396622347274281b-32 + (x * (4823126988259909b-30 + (x * 6227373019952893b-29))))))))))))))))))))))))))))))))))))))))))) # The polynomial implemented is: 1792581242326710567212291806223253b-111 + (x * (52617200066848308332099303297945b-105 + (x * (902150187593629183958092782443033b-110 + (x * (44965428859892640751057159071087b-105 + (x * (4752633902292393250779852752339b-101 + (x * (148125601965768399364062017841291b-105 + (x * (153165790916719773608400395315619b-104 + (x * (41511842370824976233500266801317b-101 + (x * (23248649506122112562773990099117b-99 + (x * (370572309710903b-42 + (x * (6944699428013305b-45 + (x * (4131783695767297b-43 + (x * (2490319441786495b-41 + (x * (3034706834572899b-40 + (x * (933084968080141b-37 + (x * (2313432583692069b-37 + (x * (5775407383919483b-37 + (x * (906590116929055b-33 + (x * (2289170179319731b-33 + (x * (2903438112538227b-32 + (x * (7396622347274281b-32 + (x * (4823126988259909b-30 + (x * 6227373019952893b-29))))))))))))))))))))))))))))))))))))))))))) # The domain is [-110485440722351b-52;55242720361239b-51] # The free variable x is a double precision number, the result p_res* is stored on a triple-double number. # The code produces 63 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(6.90477178468776764397318856936180964112281799316406250000000000000000000000000000e-01); p_coeff_0m = double(3.39466231816613032388245073452427079551490712938188829689289960356290976051241159e-18); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.29711412734153253012436834978871047496795654296875000000000000000000000000000000e+00); p_coeff_1m = double(-4.91536443957924304285159601199758593586250555616465329755726543226046487689018250e-17); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(6.94991224248453054457286270917393267154693603515625000000000000000000000000000000e-01); p_coeff_2m = double(4.14055567174545404801311585696815622965502227300336503257316422832445823587477207e-18); p_coeff_2hm = p_coeff_2h + p_coeff_2m; p_coeff_3h = double(1.10848340356455987709693999931914731860160827636718750000000000000000000000000000e+00); p_coeff_3m = double(4.16266958244922006708243033738862584564114206709881105261672473716316744685173035e-17); p_coeff_3hm = p_coeff_3h + p_coeff_3m; p_coeff_4h = double(1.87458354117322345544494055502582341432571411132812500000000000000000000000000000e+00); p_coeff_4m = double(1.01371418047977543599188915056692109774560397669751488081146817421540617942810059e-16); p_coeff_4hm = p_coeff_4h + p_coeff_4m; p_coeff_5h = double(3.65157801416010441286630339163821190595626831054687500000000000000000000000000000e+00); p_coeff_5m = double(1.26536476346012852031977695308463633490816727090143289924384362166165374219417572e-16); p_coeff_5hm = p_coeff_5h + p_coeff_5m; p_coeff_6h = double(7.55165652946598697781155351549386978149414062500000000000000000000000000000000000e+00); p_coeff_6m = double(-2.14190464475496048348382959343551268818198527301224776131505223020212724804878235e-16); p_coeff_6hm = p_coeff_6h + p_coeff_6m; p_coeff_7h = double(1.63735347750204702776954945875331759452819824218750000000000000000000000000000000e+01); p_coeff_7m = double(1.51055732062479748503833695277300766424363764363347772956558401347137987613677979e-15); p_coeff_7hm = p_coeff_7h + p_coeff_7m; p_coeff_8h = double(3.66799013891310394797073968220502138137817382812500000000000000000000000000000000e+01); p_coeff_8m = double(-1.96467879903428952233615671924270070336884016354295212636316136922687292098999023e-15); p_coeff_8hm = p_coeff_8h + p_coeff_8m; p_coeff_9h = double(8.42583880764557306974893435835838317871093750000000000000000000000000000000000000e+01); p_coeff_10h = double(1.97380229224487067085647140629589557647705078125000000000000000000000000000000000e+02); p_coeff_11h = double(4.69729422521515630251087713986635208129882812500000000000000000000000000000000000e+02); p_coeff_12h = double(1.13246616901346669692429713904857635498046875000000000000000000000000000000000000e+03); p_coeff_13h = double(2.76004978747814584494335576891899108886718750000000000000000000000000000000000000e+03); p_coeff_14h = double(6.78908667818280082428827881813049316406250000000000000000000000000000000000000000e+03); p_coeff_15h = double(1.68324374222143451333977282047271728515625000000000000000000000000000000000000000e+04); p_coeff_16h = double(4.20216193300401428132317960262298583984375000000000000000000000000000000000000000e+04); p_coeff_17h = double(1.05540980227414402179419994354248046875000000000000000000000000000000000000000000e+05); p_coeff_18h = double(2.66494483142128563486039638519287109375000000000000000000000000000000000000000000e+05); p_coeff_19h = double(6.76009364551451755687594413757324218750000000000000000000000000000000000000000000e+05); p_coeff_20h = double(1.72216034198046685196459293365478515625000000000000000000000000000000000000000000e+06); p_coeff_21h = double(4.49188704440361727029085159301757812500000000000000000000000000000000000000000000e+06); p_coeff_22h = double(1.15993861480669919401407241821289062500000000000000000000000000000000000000000000e+07); p_t_1_0h = p_coeff_22h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_21h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_20h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_19h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_18h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_17h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_16h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_15h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0hm = p_coeff_14h + p_t_16_0h; p_t_17_0h = double(p_t_17_0hm); p_t_17_0m = p_t_17_0hm - p_t_17_0h; p_t_18_0hm = mul_rel<102>(xh,p_t_17_0hm); p_t_18_0h = double(p_t_18_0hm); p_t_18_0m = p_t_18_0hm - p_t_18_0h; p_t_19_0hm = add_rel<102>(p_coeff_13h,p_t_18_0hm); p_t_19_0h = double(p_t_19_0hm); p_t_19_0m = p_t_19_0hm - p_t_19_0h; p_t_20_0hm = mul_rel<102>(xh,p_t_19_0hm); p_t_20_0h = double(p_t_20_0hm); p_t_20_0m = p_t_20_0hm - p_t_20_0h; p_t_21_0hm = add_rel<102>(p_coeff_12h,p_t_20_0hm); p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = mul_rel<102>(xh,p_t_21_0hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = add_rel<102>(p_coeff_11h,p_t_22_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_t_24_0hm = mul_rel<102>(xh,p_t_23_0hm); p_t_24_0h = double(p_t_24_0hm); p_t_24_0m = p_t_24_0hm - p_t_24_0h; p_t_25_0hm = add_rel<102>(p_coeff_10h,p_t_24_0hm); p_t_25_0h = double(p_t_25_0hm); p_t_25_0m = p_t_25_0hm - p_t_25_0h; p_t_26_0hm = mul_rel<102>(xh,p_t_25_0hm); p_t_26_0h = double(p_t_26_0hm); p_t_26_0m = p_t_26_0hm - p_t_26_0h; p_t_27_0hm = add_rel<102>(p_coeff_9h,p_t_26_0hm); p_t_27_0h = double(p_t_27_0hm); p_t_27_0m = p_t_27_0hm - p_t_27_0h; p_t_28_0hm = fma_rel<100>(p_t_27_0hm,xh,p_coeff_8hm); p_t_28_0h = double(p_t_28_0hm); p_t_28_0m = p_t_28_0hm - p_t_28_0h; p_t_29_0hm = fma_rel<100>(p_t_28_0hm,xh,p_coeff_7hm); p_t_29_0h = double(p_t_29_0hm); p_t_29_0m = p_t_29_0hm - p_t_29_0h; p_t_30_0hm = fma_rel<100>(p_t_29_0hm,xh,p_coeff_6hm); p_t_30_0h = double(p_t_30_0hm); p_t_30_0m = p_t_30_0hm - p_t_30_0h; p_t_31_0hm = fma_rel<100>(p_t_30_0hm,xh,p_coeff_5hm); p_t_31_0h = double(p_t_31_0hm); p_t_31_0m = p_t_31_0hm - p_t_31_0h; p_t_32_0hm = fma_rel<100>(p_t_31_0hm,xh,p_coeff_4hm); p_t_32_0h = double(p_t_32_0hm); p_t_32_0m = p_t_32_0hm - p_t_32_0h; p_t_33_0hm = fma_rel<100>(p_t_32_0hm,xh,p_coeff_3hm); p_t_33_0h = double(p_t_33_0hm); p_t_33_0m = p_t_33_0hm - p_t_33_0h; p_t_34_0hm = mul_rel<102>(xh,p_t_33_0hm); p_t_34_0h = double(p_t_34_0hm); p_t_34_0m = p_t_34_0hm - p_t_34_0h; p_t_35_0hml = add_rel<140>(p_coeff_2hm,p_t_34_0hm); p_t_35_0ml = p_t_35_0hml - p_t_35_0h; p_t_35_0m = double(p_t_35_0ml); p_t_35_0l = p_t_35_0ml - p_t_35_0m; p_t_35_0hm = p_t_35_0h + p_t_35_0m; overlap_p_t_35_0 = p_t_35_0m / p_t_35_0h; p_t_36_0hml = mul_rel<145>(xh,p_t_35_0hml); p_t_36_0ml = p_t_36_0hml - p_t_36_0h; p_t_36_0m = double(p_t_36_0ml); p_t_36_0l = p_t_36_0ml - p_t_36_0m; p_t_36_0hm = p_t_36_0h + p_t_36_0m; overlap_p_t_36_0 = p_t_36_0m / p_t_36_0h; p_t_37_0hml = add_rel<143>(p_coeff_1hm,p_t_36_0hml); p_t_37_0ml = p_t_37_0hml - p_t_37_0h; p_t_37_0m = double(p_t_37_0ml); p_t_37_0l = p_t_37_0ml - p_t_37_0m; p_t_37_0hm = p_t_37_0h + p_t_37_0m; overlap_p_t_37_0 = p_t_37_0m / p_t_37_0h; p_t_38_0hml = mul_rel<135>(xh,p_t_37_0hml); p_t_38_0ml = p_t_38_0hml - p_t_38_0h; p_t_38_0m = double(p_t_38_0ml); p_t_38_0l = p_t_38_0ml - p_t_38_0m; p_t_38_0hm = p_t_38_0h + p_t_38_0m; overlap_p_t_38_0 = p_t_38_0m / p_t_38_0h; p_t_39_0hml = add_rel<133>(p_coeff_0hm,p_t_38_0hml); p_t_39_0ml = p_t_39_0hml - p_t_39_0h; p_t_39_0m = double(p_t_39_0ml); p_t_39_0l = p_t_39_0ml - p_t_39_0m; p_t_39_0hm = p_t_39_0h + p_t_39_0m; overlap_p_t_39_0 = p_t_39_0m / p_t_39_0h; p_reshml = p_t_39_0hml; p_resml = p_reshml - p_resh; p_resm = double(p_resml); p_resl = p_resml - p_resm; p_reshm = p_resh + p_resm; overlap_p_res = p_resm / p_resh; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2hm; Mp_coeff_3 = p_coeff_3hm; Mp_coeff_4 = p_coeff_4hm; Mp_coeff_5 = p_coeff_5hm; Mp_coeff_6 = p_coeff_6hm; Mp_coeff_7 = p_coeff_7hm; Mp_coeff_8 = p_coeff_8hm; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_coeff_13 = p_coeff_13h; Mp_coeff_14 = p_coeff_14h; Mp_coeff_15 = p_coeff_15h; Mp_coeff_16 = p_coeff_16h; Mp_coeff_17 = p_coeff_17h; Mp_coeff_18 = p_coeff_18h; Mp_coeff_19 = p_coeff_19h; Mp_coeff_20 = p_coeff_20h; Mp_coeff_21 = p_coeff_21h; Mp_coeff_22 = p_coeff_22h; Mp_t_1_0 = Mp_coeff_22; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_21 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_20 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_19 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_18 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_17 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_16 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_15 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_14 + Mp_t_16_0; Mp_t_18_0 = Mx * Mp_t_17_0; Mp_t_19_0 = Mp_coeff_13 + Mp_t_18_0; Mp_t_20_0 = Mx * Mp_t_19_0; Mp_t_21_0 = Mp_coeff_12 + Mp_t_20_0; Mp_t_22_0 = Mx * Mp_t_21_0; Mp_t_23_0 = Mp_coeff_11 + Mp_t_22_0; Mp_t_24_0 = Mx * Mp_t_23_0; Mp_t_25_0 = Mp_coeff_10 + Mp_t_24_0; Mp_t_26_0 = Mx * Mp_t_25_0; Mp_t_27_0 = Mp_coeff_9 + Mp_t_26_0; Mp_t_28_0 = (Mp_t_27_0 * Mx) + Mp_coeff_8; Mp_t_29_0 = (Mp_t_28_0 * Mx) + Mp_coeff_7; Mp_t_30_0 = (Mp_t_29_0 * Mx) + Mp_coeff_6; Mp_t_31_0 = (Mp_t_30_0 * Mx) + Mp_coeff_5; Mp_t_32_0 = (Mp_t_31_0 * Mx) + Mp_coeff_4; Mp_t_33_0 = (Mp_t_32_0 * Mx) + Mp_coeff_3; Mp_t_34_0 = Mx * Mp_t_33_0; Mp_t_35_0 = Mp_coeff_2 + Mp_t_34_0; Mp_t_36_0 = Mx * Mp_t_35_0; Mp_t_37_0 = Mp_coeff_1 + Mp_t_36_0; Mp_t_38_0 = Mx * Mp_t_37_0; Mp_t_39_0 = Mp_coeff_0 + Mp_t_38_0; Mp_res = Mp_t_39_0; # Definition of the relative arithmetical error epsilon = (p_reshml - Mp_res) / Mp_res; # Implication to prove {(( x in [-110485440722351b-52,-110485440722351b-452] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] ) \/ ( x in [55242720361239b-451,55242720361239b-51] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_17_0h ~ p_t_17_0hm; p_t_18_0h ~ p_t_18_0hm; p_t_19_0h ~ p_t_19_0hm; p_t_20_0h ~ p_t_20_0hm; p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; p_t_24_0h ~ p_t_24_0hm; p_t_25_0h ~ p_t_25_0hm; p_t_26_0h ~ p_t_26_0hm; p_t_27_0h ~ p_t_27_0hm; p_t_28_0h ~ p_t_28_0hm; p_t_29_0h ~ p_t_29_0hm; p_t_30_0h ~ p_t_30_0hm; p_t_31_0h ~ p_t_31_0hm; p_t_32_0h ~ p_t_32_0hm; p_t_33_0h ~ p_t_33_0hm; p_t_34_0h ~ p_t_34_0hm; p_t_35_0hm ~ p_t_35_0hml; p_t_35_0h ~ p_t_35_0hm; p_t_35_0h ~ p_t_35_0hml; p_t_35_0m -> p_t_35_0h * overlap_p_t_35_0; p_t_35_0l / p_t_35_0m -> - ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml) / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)); (p_t_35_0hm - p_t_35_0hml) / p_t_35_0hml -> - (p_t_35_0l / p_t_35_0m) * (1 / (1 / overlap_p_t_35_0 + 1 + (p_t_35_0l / p_t_35_0m))); p_t_35_0ml -> p_t_35_0hml / ((1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) / overlap_p_t_35_0 + 1); (p_t_35_0h - p_t_35_0hm) / p_t_35_0hm -> - 1 / (1 / overlap_p_t_35_0 + 1); p_t_35_0h -> p_t_35_0hml / (overlap_p_t_35_0 / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) + 1); p_t_36_0hm ~ p_t_36_0hml; p_t_36_0h ~ p_t_36_0hm; p_t_36_0h ~ p_t_36_0hml; p_t_36_0m -> p_t_36_0h * overlap_p_t_36_0; p_t_36_0l / p_t_36_0m -> - ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml) / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)); (p_t_36_0hm - p_t_36_0hml) / p_t_36_0hml -> - (p_t_36_0l / p_t_36_0m) * (1 / (1 / overlap_p_t_36_0 + 1 + (p_t_36_0l / p_t_36_0m))); p_t_36_0ml -> p_t_36_0hml / ((1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) / overlap_p_t_36_0 + 1); (p_t_36_0h - p_t_36_0hm) / p_t_36_0hm -> - 1 / (1 / overlap_p_t_36_0 + 1); p_t_36_0h -> p_t_36_0hml / (overlap_p_t_36_0 / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) + 1); p_t_37_0hm ~ p_t_37_0hml; p_t_37_0h ~ p_t_37_0hm; p_t_37_0h ~ p_t_37_0hml; p_t_37_0m -> p_t_37_0h * overlap_p_t_37_0; p_t_37_0l / p_t_37_0m -> - ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml) / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)); (p_t_37_0hm - p_t_37_0hml) / p_t_37_0hml -> - (p_t_37_0l / p_t_37_0m) * (1 / (1 / overlap_p_t_37_0 + 1 + (p_t_37_0l / p_t_37_0m))); p_t_37_0ml -> p_t_37_0hml / ((1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) / overlap_p_t_37_0 + 1); (p_t_37_0h - p_t_37_0hm) / p_t_37_0hm -> - 1 / (1 / overlap_p_t_37_0 + 1); p_t_37_0h -> p_t_37_0hml / (overlap_p_t_37_0 / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) + 1); p_t_38_0hm ~ p_t_38_0hml; p_t_38_0h ~ p_t_38_0hm; p_t_38_0h ~ p_t_38_0hml; p_t_38_0m -> p_t_38_0h * overlap_p_t_38_0; p_t_38_0l / p_t_38_0m -> - ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml) / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)); (p_t_38_0hm - p_t_38_0hml) / p_t_38_0hml -> - (p_t_38_0l / p_t_38_0m) * (1 / (1 / overlap_p_t_38_0 + 1 + (p_t_38_0l / p_t_38_0m))); p_t_38_0ml -> p_t_38_0hml / ((1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) / overlap_p_t_38_0 + 1); (p_t_38_0h - p_t_38_0hm) / p_t_38_0hm -> - 1 / (1 / overlap_p_t_38_0 + 1); p_t_38_0h -> p_t_38_0hml / (overlap_p_t_38_0 / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) + 1); p_t_39_0hm ~ p_t_39_0hml; p_t_39_0h ~ p_t_39_0hm; p_t_39_0h ~ p_t_39_0hml; p_t_39_0m -> p_t_39_0h * overlap_p_t_39_0; p_t_39_0l / p_t_39_0m -> - ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml) / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)); (p_t_39_0hm - p_t_39_0hml) / p_t_39_0hml -> - (p_t_39_0l / p_t_39_0m) * (1 / (1 / overlap_p_t_39_0 + 1 + (p_t_39_0l / p_t_39_0m))); p_t_39_0ml -> p_t_39_0hml / ((1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) / overlap_p_t_39_0 + 1); (p_t_39_0h - p_t_39_0hm) / p_t_39_0hm -> - 1 / (1 / overlap_p_t_39_0 + 1); p_t_39_0h -> p_t_39_0hml / (overlap_p_t_39_0 / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) + 1); p_reshm ~ p_reshml; p_resh ~ p_reshm; p_resh ~ p_reshml; p_resm -> p_resh * overlap_p_res; p_resl / p_resm -> - ((p_resm - p_resml) / p_resml) / (1 + ((p_resm - p_resml) / p_resml)); (p_reshm - p_reshml) / p_reshml -> - (p_resl / p_resm) * (1 / (1 / overlap_p_res + 1 + (p_resl / p_resm))); p_resml -> p_reshml / ((1 + ((p_resm - p_resml) / p_resml)) / overlap_p_res + 1); (p_resh - p_reshm) / p_reshm -> - 1 / (1 / overlap_p_res + 1); p_resh -> p_reshml / (overlap_p_res / (1 + ((p_resm - p_resml) / p_resml)) + 1); # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0hm ~ Mp_t_17_0; p_t_18_0hm ~ Mp_t_18_0; p_t_19_0hm ~ Mp_t_19_0; p_t_20_0hm ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_t_24_0hm ~ Mp_t_24_0; p_t_25_0hm ~ Mp_t_25_0; p_t_26_0hm ~ Mp_t_26_0; p_t_27_0hm ~ Mp_t_27_0; p_t_28_0hm ~ Mp_t_28_0; p_t_29_0hm ~ Mp_t_29_0; p_t_30_0hm ~ Mp_t_30_0; p_t_31_0hm ~ Mp_t_31_0; p_t_32_0hm ~ Mp_t_32_0; p_t_33_0hm ~ Mp_t_33_0; p_t_34_0hm ~ Mp_t_34_0; p_t_35_0hml ~ Mp_t_35_0; p_t_36_0hml ~ Mp_t_36_0; p_t_37_0hml ~ Mp_t_37_0; p_t_38_0hml ~ Mp_t_38_0; p_t_39_0hml ~ Mp_t_39_0; p_reshml ~ Mp_res; # Dichotomies for triple-double decomposition $ p_t_35_0hml in (0); $ p_t_35_0ml in (0); $ p_t_36_0hml in (0); $ p_t_36_0ml in (0); $ p_t_37_0hml in (0); $ p_t_37_0ml in (0); $ p_t_38_0hml in (0); $ p_t_38_0ml in (0); $ p_t_39_0hml in (0); $ p_t_39_0ml in (0); $ p_reshml in (0); $ p_resml in (0); # Dichotomy for the error bound epsilon $ xhml; interval-2.1.0/src/crlibm/gappa/asin/asinAccuR7.gappa0000644000000000000000000004531513031036767020534 0ustar 00000000000000# The polynomial to implement is: 15651770362713997207607972106972745b-114 + (x * (3476698806776688943652103662933b-101 + (x * (17894972500311187082269807705171b-104 + (x * (126976607296441025269345153102591b-106 + (x * (249107378895562413495151944042799b-106 + (x * (139053951649796304768149995225589b-104 + (x * (165428664168251249501887921888847b-103 + (x * (206167601873884163281098618631159b-102 + (x * (66386611260133347295510390653099b-99 + (x * (2433556521489987b-43 + (x * (409716955440671b-39 + (x * (2242518346998655b-40 + (x * (3108616106416871b-39 + (x * (4356285307071455b-38 + (x * (6161286268548935b-37 + (x * (8783550111623067b-36 + (x * (788026560267325b-31 + (x * (1138037795125313b-30 + (x * (3304615966282565b-30 + (x * (602367826671283b-26 + (x * (1765006192104851b-26 + (x * (1337636086941861b-24 + (x * 986777691264547b-22))))))))))))))))))))))))))))))))))))))))))) # The polynomial implemented is: 15651770362713997207607972106972745b-114 + (x * (3476698806776688943652103662933b-101 + (x * (17894972500311187082269807705171b-104 + (x * (126976607296441025269345153102591b-106 + (x * (249107378895562413495151944042799b-106 + (x * (139053951649796304768149995225589b-104 + (x * (165428664168251249501887921888847b-103 + (x * (206167601873884163281098618631159b-102 + (x * (66386611260133347295510390653099b-99 + (x * (2433556521489987b-43 + (x * (409716955440671b-39 + (x * (2242518346998655b-40 + (x * (3108616106416871b-39 + (x * (4356285307071455b-38 + (x * (6161286268548935b-37 + (x * (8783550111623067b-36 + (x * (788026560267325b-31 + (x * (1138037795125313b-30 + (x * (3304615966282565b-30 + (x * (602367826671283b-26 + (x * (1765006192104851b-26 + (x * (1337636086941861b-24 + (x * 986777691264547b-22))))))))))))))))))))))))))))))))))))))))))) # The domain is [-205674681606191b-53;205674681606835b-53] # The free variable x is a double precision number, the result p_res* is stored on a triple-double number. # The code produces 63 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(7.53605330605588874526290510402759537100791931152343750000000000000000000000000000e-01); p_coeff_0m = double(-6.86303578932659590324882262388685086010663787564085999357010869914574868744239211e-20); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.37131588394733516800272354885237291455268859863281250000000000000000000000000000e+00); p_coeff_1m = double(5.85729819349925155946752593741546617096794483808830378279708384070545434951782227e-17); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(8.82290262843787198576706032326910644769668579101562500000000000000000000000000000e-01); p_coeff_2m = double(5.16377114572074856584788281695076928068533622922381409736658497422467917203903198e-17); p_coeff_2hm = p_coeff_2h + p_coeff_2m; p_coeff_3h = double(1.56510752146505316417801623174455016851425170898437500000000000000000000000000000e+00); p_coeff_3m = double(-4.39163602371923391288987498767894166026634554891340533888666186612681485712528229e-17); p_coeff_3hm = p_coeff_3h + p_coeff_3m; p_coeff_4h = double(3.07048550644979600932060748164076358079910278320312500000000000000000000000000000e+00); p_coeff_4m = double(-1.10182145686314872930592860300828689006905830376995686359364867712429258972406387e-16); p_coeff_4hm = p_coeff_4h + p_coeff_4m; p_coeff_5h = double(6.85588913581356962367863161489367485046386718750000000000000000000000000000000000e+00); p_coeff_5m = double(4.35622325486244782178679451752414705321823684735019210911843856592895463109016418e-16); p_coeff_5hm = p_coeff_5h + p_coeff_5m; p_coeff_6h = double(1.63125257206586802283254655776545405387878417968750000000000000000000000000000000e+01); p_coeff_6m = double(-1.42810985056358952027816317128163090933704222357941704402151117392349988222122192e-16); p_coeff_6hm = p_coeff_6h + p_coeff_6m; p_coeff_7h = double(4.06593902603693564401510229799896478652954101562500000000000000000000000000000000e+01); p_coeff_7m = double(1.26451118649566617072575681437226509832616233499485991487176761438604444265365601e-15); p_coeff_7hm = p_coeff_7h + p_coeff_7m; p_coeff_8h = double(1.04739604506448415577324340119957923889160156250000000000000000000000000000000000e+02); p_coeff_8m = double(-4.21355762035756719251654947961735015460869348269401513107368373312056064605712891e-16); p_coeff_8hm = p_coeff_8h + p_coeff_8m; p_coeff_9h = double(2.76663345345012544385099317878484725952148437500000000000000000000000000000000000e+02); p_coeff_10h = double(7.45270800399650397594086825847625732421875000000000000000000000000000000000000000e+02); p_coeff_11h = double(2.03955855522386173106497153639793395996093750000000000000000000000000000000000000e+03); p_coeff_12h = double(5.65453975726426688197534531354904174804687500000000000000000000000000000000000000e+03); p_coeff_13h = double(1.58480736247709683084394782781600952148437500000000000000000000000000000000000000e+04); p_coeff_14h = double(4.48292577388124118442647159099578857421875000000000000000000000000000000000000000e+04); p_coeff_15h = double(1.27817476628451069700531661510467529296875000000000000000000000000000000000000000e+05); p_coeff_16h = double(3.66953462486772332340478897094726562500000000000000000000000000000000000000000000e+05); p_coeff_17h = double(1.05988028936582896858453750610351562500000000000000000000000000000000000000000000e+06); p_coeff_18h = double(3.07766344983369577676057815551757812500000000000000000000000000000000000000000000e+06); p_coeff_19h = double(8.97598008321647346019744873046875000000000000000000000000000000000000000000000000e+06); p_coeff_20h = double(2.63006417766936272382736206054687500000000000000000000000000000000000000000000000e+07); p_coeff_21h = double(7.97293238009131550788879394531250000000000000000000000000000000000000000000000000e+07); p_coeff_22h = double(2.35266135040413618087768554687500000000000000000000000000000000000000000000000000e+08); p_t_1_0h = p_coeff_22h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_21h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_20h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_19h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_18h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_17h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_16h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_15h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0hm = p_coeff_14h + p_t_16_0h; p_t_17_0h = double(p_t_17_0hm); p_t_17_0m = p_t_17_0hm - p_t_17_0h; p_t_18_0hm = mul_rel<102>(xh,p_t_17_0hm); p_t_18_0h = double(p_t_18_0hm); p_t_18_0m = p_t_18_0hm - p_t_18_0h; p_t_19_0hm = add_rel<102>(p_coeff_13h,p_t_18_0hm); p_t_19_0h = double(p_t_19_0hm); p_t_19_0m = p_t_19_0hm - p_t_19_0h; p_t_20_0hm = mul_rel<102>(xh,p_t_19_0hm); p_t_20_0h = double(p_t_20_0hm); p_t_20_0m = p_t_20_0hm - p_t_20_0h; p_t_21_0hm = add_rel<102>(p_coeff_12h,p_t_20_0hm); p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = mul_rel<102>(xh,p_t_21_0hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = add_rel<102>(p_coeff_11h,p_t_22_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_t_24_0hm = mul_rel<102>(xh,p_t_23_0hm); p_t_24_0h = double(p_t_24_0hm); p_t_24_0m = p_t_24_0hm - p_t_24_0h; p_t_25_0hm = add_rel<102>(p_coeff_10h,p_t_24_0hm); p_t_25_0h = double(p_t_25_0hm); p_t_25_0m = p_t_25_0hm - p_t_25_0h; p_t_26_0hm = mul_rel<102>(xh,p_t_25_0hm); p_t_26_0h = double(p_t_26_0hm); p_t_26_0m = p_t_26_0hm - p_t_26_0h; p_t_27_0hm = add_rel<102>(p_coeff_9h,p_t_26_0hm); p_t_27_0h = double(p_t_27_0hm); p_t_27_0m = p_t_27_0hm - p_t_27_0h; p_t_28_0hm = fma_rel<100>(p_t_27_0hm,xh,p_coeff_8hm); p_t_28_0h = double(p_t_28_0hm); p_t_28_0m = p_t_28_0hm - p_t_28_0h; p_t_29_0hm = fma_rel<100>(p_t_28_0hm,xh,p_coeff_7hm); p_t_29_0h = double(p_t_29_0hm); p_t_29_0m = p_t_29_0hm - p_t_29_0h; p_t_30_0hm = fma_rel<100>(p_t_29_0hm,xh,p_coeff_6hm); p_t_30_0h = double(p_t_30_0hm); p_t_30_0m = p_t_30_0hm - p_t_30_0h; p_t_31_0hm = fma_rel<100>(p_t_30_0hm,xh,p_coeff_5hm); p_t_31_0h = double(p_t_31_0hm); p_t_31_0m = p_t_31_0hm - p_t_31_0h; p_t_32_0hm = fma_rel<100>(p_t_31_0hm,xh,p_coeff_4hm); p_t_32_0h = double(p_t_32_0hm); p_t_32_0m = p_t_32_0hm - p_t_32_0h; p_t_33_0hm = fma_rel<100>(p_t_32_0hm,xh,p_coeff_3hm); p_t_33_0h = double(p_t_33_0hm); p_t_33_0m = p_t_33_0hm - p_t_33_0h; p_t_34_0hm = mul_rel<102>(xh,p_t_33_0hm); p_t_34_0h = double(p_t_34_0hm); p_t_34_0m = p_t_34_0hm - p_t_34_0h; p_t_35_0hml = add_rel<140>(p_coeff_2hm,p_t_34_0hm); p_t_35_0ml = p_t_35_0hml - p_t_35_0h; p_t_35_0m = double(p_t_35_0ml); p_t_35_0l = p_t_35_0ml - p_t_35_0m; p_t_35_0hm = p_t_35_0h + p_t_35_0m; overlap_p_t_35_0 = p_t_35_0m / p_t_35_0h; p_t_36_0hml = mul_rel<145>(xh,p_t_35_0hml); p_t_36_0ml = p_t_36_0hml - p_t_36_0h; p_t_36_0m = double(p_t_36_0ml); p_t_36_0l = p_t_36_0ml - p_t_36_0m; p_t_36_0hm = p_t_36_0h + p_t_36_0m; overlap_p_t_36_0 = p_t_36_0m / p_t_36_0h; p_t_37_0hml = add_rel<143>(p_coeff_1hm,p_t_36_0hml); p_t_37_0ml = p_t_37_0hml - p_t_37_0h; p_t_37_0m = double(p_t_37_0ml); p_t_37_0l = p_t_37_0ml - p_t_37_0m; p_t_37_0hm = p_t_37_0h + p_t_37_0m; overlap_p_t_37_0 = p_t_37_0m / p_t_37_0h; p_t_38_0hml = mul_rel<135>(xh,p_t_37_0hml); p_t_38_0ml = p_t_38_0hml - p_t_38_0h; p_t_38_0m = double(p_t_38_0ml); p_t_38_0l = p_t_38_0ml - p_t_38_0m; p_t_38_0hm = p_t_38_0h + p_t_38_0m; overlap_p_t_38_0 = p_t_38_0m / p_t_38_0h; p_t_39_0hml = add_rel<133>(p_coeff_0hm,p_t_38_0hml); p_t_39_0ml = p_t_39_0hml - p_t_39_0h; p_t_39_0m = double(p_t_39_0ml); p_t_39_0l = p_t_39_0ml - p_t_39_0m; p_t_39_0hm = p_t_39_0h + p_t_39_0m; overlap_p_t_39_0 = p_t_39_0m / p_t_39_0h; p_reshml = p_t_39_0hml; p_resml = p_reshml - p_resh; p_resm = double(p_resml); p_resl = p_resml - p_resm; p_reshm = p_resh + p_resm; overlap_p_res = p_resm / p_resh; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2hm; Mp_coeff_3 = p_coeff_3hm; Mp_coeff_4 = p_coeff_4hm; Mp_coeff_5 = p_coeff_5hm; Mp_coeff_6 = p_coeff_6hm; Mp_coeff_7 = p_coeff_7hm; Mp_coeff_8 = p_coeff_8hm; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_coeff_13 = p_coeff_13h; Mp_coeff_14 = p_coeff_14h; Mp_coeff_15 = p_coeff_15h; Mp_coeff_16 = p_coeff_16h; Mp_coeff_17 = p_coeff_17h; Mp_coeff_18 = p_coeff_18h; Mp_coeff_19 = p_coeff_19h; Mp_coeff_20 = p_coeff_20h; Mp_coeff_21 = p_coeff_21h; Mp_coeff_22 = p_coeff_22h; Mp_t_1_0 = Mp_coeff_22; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_21 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_20 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_19 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_18 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_17 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_16 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_15 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_14 + Mp_t_16_0; Mp_t_18_0 = Mx * Mp_t_17_0; Mp_t_19_0 = Mp_coeff_13 + Mp_t_18_0; Mp_t_20_0 = Mx * Mp_t_19_0; Mp_t_21_0 = Mp_coeff_12 + Mp_t_20_0; Mp_t_22_0 = Mx * Mp_t_21_0; Mp_t_23_0 = Mp_coeff_11 + Mp_t_22_0; Mp_t_24_0 = Mx * Mp_t_23_0; Mp_t_25_0 = Mp_coeff_10 + Mp_t_24_0; Mp_t_26_0 = Mx * Mp_t_25_0; Mp_t_27_0 = Mp_coeff_9 + Mp_t_26_0; Mp_t_28_0 = (Mp_t_27_0 * Mx) + Mp_coeff_8; Mp_t_29_0 = (Mp_t_28_0 * Mx) + Mp_coeff_7; Mp_t_30_0 = (Mp_t_29_0 * Mx) + Mp_coeff_6; Mp_t_31_0 = (Mp_t_30_0 * Mx) + Mp_coeff_5; Mp_t_32_0 = (Mp_t_31_0 * Mx) + Mp_coeff_4; Mp_t_33_0 = (Mp_t_32_0 * Mx) + Mp_coeff_3; Mp_t_34_0 = Mx * Mp_t_33_0; Mp_t_35_0 = Mp_coeff_2 + Mp_t_34_0; Mp_t_36_0 = Mx * Mp_t_35_0; Mp_t_37_0 = Mp_coeff_1 + Mp_t_36_0; Mp_t_38_0 = Mx * Mp_t_37_0; Mp_t_39_0 = Mp_coeff_0 + Mp_t_38_0; Mp_res = Mp_t_39_0; # Definition of the relative arithmetical error epsilon = (p_reshml - Mp_res) / Mp_res; # Implication to prove {(( x in [-205674681606191b-53,-205674681606191b-453] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] ) \/ ( x in [205674681606835b-453,205674681606835b-53] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_17_0h ~ p_t_17_0hm; p_t_18_0h ~ p_t_18_0hm; p_t_19_0h ~ p_t_19_0hm; p_t_20_0h ~ p_t_20_0hm; p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; p_t_24_0h ~ p_t_24_0hm; p_t_25_0h ~ p_t_25_0hm; p_t_26_0h ~ p_t_26_0hm; p_t_27_0h ~ p_t_27_0hm; p_t_28_0h ~ p_t_28_0hm; p_t_29_0h ~ p_t_29_0hm; p_t_30_0h ~ p_t_30_0hm; p_t_31_0h ~ p_t_31_0hm; p_t_32_0h ~ p_t_32_0hm; p_t_33_0h ~ p_t_33_0hm; p_t_34_0h ~ p_t_34_0hm; p_t_35_0hm ~ p_t_35_0hml; p_t_35_0h ~ p_t_35_0hm; p_t_35_0h ~ p_t_35_0hml; p_t_35_0m -> p_t_35_0h * overlap_p_t_35_0; p_t_35_0l / p_t_35_0m -> - ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml) / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)); (p_t_35_0hm - p_t_35_0hml) / p_t_35_0hml -> - (p_t_35_0l / p_t_35_0m) * (1 / (1 / overlap_p_t_35_0 + 1 + (p_t_35_0l / p_t_35_0m))); p_t_35_0ml -> p_t_35_0hml / ((1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) / overlap_p_t_35_0 + 1); (p_t_35_0h - p_t_35_0hm) / p_t_35_0hm -> - 1 / (1 / overlap_p_t_35_0 + 1); p_t_35_0h -> p_t_35_0hml / (overlap_p_t_35_0 / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) + 1); p_t_36_0hm ~ p_t_36_0hml; p_t_36_0h ~ p_t_36_0hm; p_t_36_0h ~ p_t_36_0hml; p_t_36_0m -> p_t_36_0h * overlap_p_t_36_0; p_t_36_0l / p_t_36_0m -> - ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml) / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)); (p_t_36_0hm - p_t_36_0hml) / p_t_36_0hml -> - (p_t_36_0l / p_t_36_0m) * (1 / (1 / overlap_p_t_36_0 + 1 + (p_t_36_0l / p_t_36_0m))); p_t_36_0ml -> p_t_36_0hml / ((1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) / overlap_p_t_36_0 + 1); (p_t_36_0h - p_t_36_0hm) / p_t_36_0hm -> - 1 / (1 / overlap_p_t_36_0 + 1); p_t_36_0h -> p_t_36_0hml / (overlap_p_t_36_0 / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) + 1); p_t_37_0hm ~ p_t_37_0hml; p_t_37_0h ~ p_t_37_0hm; p_t_37_0h ~ p_t_37_0hml; p_t_37_0m -> p_t_37_0h * overlap_p_t_37_0; p_t_37_0l / p_t_37_0m -> - ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml) / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)); (p_t_37_0hm - p_t_37_0hml) / p_t_37_0hml -> - (p_t_37_0l / p_t_37_0m) * (1 / (1 / overlap_p_t_37_0 + 1 + (p_t_37_0l / p_t_37_0m))); p_t_37_0ml -> p_t_37_0hml / ((1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) / overlap_p_t_37_0 + 1); (p_t_37_0h - p_t_37_0hm) / p_t_37_0hm -> - 1 / (1 / overlap_p_t_37_0 + 1); p_t_37_0h -> p_t_37_0hml / (overlap_p_t_37_0 / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) + 1); p_t_38_0hm ~ p_t_38_0hml; p_t_38_0h ~ p_t_38_0hm; p_t_38_0h ~ p_t_38_0hml; p_t_38_0m -> p_t_38_0h * overlap_p_t_38_0; p_t_38_0l / p_t_38_0m -> - ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml) / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)); (p_t_38_0hm - p_t_38_0hml) / p_t_38_0hml -> - (p_t_38_0l / p_t_38_0m) * (1 / (1 / overlap_p_t_38_0 + 1 + (p_t_38_0l / p_t_38_0m))); p_t_38_0ml -> p_t_38_0hml / ((1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) / overlap_p_t_38_0 + 1); (p_t_38_0h - p_t_38_0hm) / p_t_38_0hm -> - 1 / (1 / overlap_p_t_38_0 + 1); p_t_38_0h -> p_t_38_0hml / (overlap_p_t_38_0 / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) + 1); p_t_39_0hm ~ p_t_39_0hml; p_t_39_0h ~ p_t_39_0hm; p_t_39_0h ~ p_t_39_0hml; p_t_39_0m -> p_t_39_0h * overlap_p_t_39_0; p_t_39_0l / p_t_39_0m -> - ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml) / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)); (p_t_39_0hm - p_t_39_0hml) / p_t_39_0hml -> - (p_t_39_0l / p_t_39_0m) * (1 / (1 / overlap_p_t_39_0 + 1 + (p_t_39_0l / p_t_39_0m))); p_t_39_0ml -> p_t_39_0hml / ((1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) / overlap_p_t_39_0 + 1); (p_t_39_0h - p_t_39_0hm) / p_t_39_0hm -> - 1 / (1 / overlap_p_t_39_0 + 1); p_t_39_0h -> p_t_39_0hml / (overlap_p_t_39_0 / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) + 1); p_reshm ~ p_reshml; p_resh ~ p_reshm; p_resh ~ p_reshml; p_resm -> p_resh * overlap_p_res; p_resl / p_resm -> - ((p_resm - p_resml) / p_resml) / (1 + ((p_resm - p_resml) / p_resml)); (p_reshm - p_reshml) / p_reshml -> - (p_resl / p_resm) * (1 / (1 / overlap_p_res + 1 + (p_resl / p_resm))); p_resml -> p_reshml / ((1 + ((p_resm - p_resml) / p_resml)) / overlap_p_res + 1); (p_resh - p_reshm) / p_reshm -> - 1 / (1 / overlap_p_res + 1); p_resh -> p_reshml / (overlap_p_res / (1 + ((p_resm - p_resml) / p_resml)) + 1); # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0hm ~ Mp_t_17_0; p_t_18_0hm ~ Mp_t_18_0; p_t_19_0hm ~ Mp_t_19_0; p_t_20_0hm ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_t_24_0hm ~ Mp_t_24_0; p_t_25_0hm ~ Mp_t_25_0; p_t_26_0hm ~ Mp_t_26_0; p_t_27_0hm ~ Mp_t_27_0; p_t_28_0hm ~ Mp_t_28_0; p_t_29_0hm ~ Mp_t_29_0; p_t_30_0hm ~ Mp_t_30_0; p_t_31_0hm ~ Mp_t_31_0; p_t_32_0hm ~ Mp_t_32_0; p_t_33_0hm ~ Mp_t_33_0; p_t_34_0hm ~ Mp_t_34_0; p_t_35_0hml ~ Mp_t_35_0; p_t_36_0hml ~ Mp_t_36_0; p_t_37_0hml ~ Mp_t_37_0; p_t_38_0hml ~ Mp_t_38_0; p_t_39_0hml ~ Mp_t_39_0; p_reshml ~ Mp_res; # Dichotomies for triple-double decomposition $ p_t_35_0hml in (0); $ p_t_35_0ml in (0); $ p_t_36_0hml in (0); $ p_t_36_0ml in (0); $ p_t_37_0hml in (0); $ p_t_37_0ml in (0); $ p_t_38_0hml in (0); $ p_t_38_0ml in (0); $ p_t_39_0hml in (0); $ p_t_39_0ml in (0); $ p_reshml in (0); $ p_resml in (0); # Dichotomy for the error bound epsilon $ xhml; interval-2.1.0/src/crlibm/gappa/asin/asinAccuR8.gappa0000644000000000000000000004530413031036767020533 0ustar 00000000000000# The polynomial to implement is: 271231531131291488500256432295155355b-118 + (x * (59219663444275665418148029933093b-105 + (x * (91951771149333176184232653360269b-106 + (x * (92423083901517259878576132800551b-105 + (x * (106023148728483104576104226688181b-104 + (x * (2198352805121143801422469570143153b-107 + (x * (95066434162584819377607079588059b-101 + (x * (34442113666568245424103461394667b-98 + (x * (25796159680640669851948010272065b-96 + (x * (8798088372766967b-43 + (x * (215344979201967b-36 + (x * (5483368112016911b-39 + (x * (4420325172995913b-37 + (x * (450290687498503b-32 + (x * (5925847171037497b-34 + (x * (4912853910106897b-32 + (x * (8202403581885303b-31 + (x * (6888828459746951b-29 + (x * (5816597361461873b-27 + (x * (2466185133128319b-24 + (x * (8404734260175089b-24 + (x * (7429764157461459b-22 + (x * 1594661061408329b-18))))))))))))))))))))))))))))))))))))))))))) # The polynomial implemented is: 271231531131291488500256432295155355b-118 + (x * (59219663444275665418148029933093b-105 + (x * (91951771149333176184232653360269b-106 + (x * (92423083901517259878576132800551b-105 + (x * (106023148728483104576104226688181b-104 + (x * (2198352805121143801422469570143153b-107 + (x * (95066434162584819377607079588059b-101 + (x * (34442113666568245424103461394667b-98 + (x * (25796159680640669851948010272065b-96 + (x * (8798088372766967b-43 + (x * (215344979201967b-36 + (x * (5483368112016911b-39 + (x * (4420325172995913b-37 + (x * (450290687498503b-32 + (x * (5925847171037497b-34 + (x * (4912853910106897b-32 + (x * (8202403581885303b-31 + (x * (6888828459746951b-29 + (x * (5816597361461873b-27 + (x * (2466185133128319b-24 + (x * (8404734260175089b-24 + (x * (7429764157461459b-22 + (x * 1594661061408329b-18))))))))))))))))))))))))))))))))))))))))))) # The domain is [-96586942132361b-52;6036683883289b-48] # The free variable x is a double precision number, the result p_res* is stored on a triple-double number. # The code produces 63 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(8.16207699480864135033186812506755813956260681152343750000000000000000000000000000e-01); p_coeff_0m = double(1.10010191397663675140086054218782967355131241568134164879148861881930088202352636e-20); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.45987741598546749699494284868706017732620239257812500000000000000000000000000000e+00); p_coeff_1m = double(1.03784174873658842691949705484313598874177727812186111666648002938018180429935455e-16); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(1.13339308477403566399743795045651495456695556640625000000000000000000000000000000e+00); p_coeff_2m = double(6.19984751477578508212901866489819694255822369395765580879498202193644829094409943e-17); p_coeff_2hm = p_coeff_2h + p_coeff_2m; p_coeff_3h = double(2.27840492593338828086757530400063842535018920898437500000000000000000000000000000e+00); p_coeff_3m = double(1.29623917002581965214107410636027293901696556366158474826733026930014602839946747e-16); p_coeff_3hm = p_coeff_3h + p_coeff_3m; p_coeff_4h = double(5.22734481752082214001120519242249429225921630859375000000000000000000000000000000e+00); p_coeff_4m = double(-3.48196612292005370465186545711763157537164151090688934964134659821866080164909363e-16); p_coeff_4hm = p_coeff_4h + p_coeff_4m; p_coeff_5h = double(1.35483951862735629845246876357123255729675292968750000000000000000000000000000000e+01); p_coeff_5m = double(-4.53291289318611746967298644014774748053833951222640202827207644986629020422697067e-17); p_coeff_5hm = p_coeff_5h + p_coeff_5m; p_coeff_6h = double(3.74970966548151878328098973724991083145141601562500000000000000000000000000000000e+01); p_coeff_6m = double(3.16809448186690022670167104047109366061463187579094746837427010177634656429290771e-15); p_coeff_6hm = p_coeff_6h + p_coeff_6m; p_coeff_7h = double(1.08680147858936038574029225856065750122070312500000000000000000000000000000000000e+02); p_coeff_7m = double(-6.36137089188991992639408248982314785589906210028221522634339635260403156280517578e-15); p_coeff_7hm = p_coeff_7h + p_coeff_7m; p_coeff_8h = double(3.25593310030335430838022148236632347106933593750000000000000000000000000000000000e+02); p_coeff_8m = double(1.91287227671501587672951512619431386699611966073497626439348096027970314025878906e-14); p_coeff_8hm = p_coeff_8h + p_coeff_8m; p_coeff_9h = double(1.00022684509519501716567901894450187683105468750000000000000000000000000000000000e+03); p_coeff_10h = double(3.13368188220144656952470541000366210937500000000000000000000000000000000000000000e+03); p_coeff_11h = double(9.97418849150001005909871309995651245117187500000000000000000000000000000000000000e+03); p_coeff_12h = double(3.21620985996262825210578739643096923828125000000000000000000000000000000000000000e+04); p_coeff_13h = double(1.04841470601619919762015342712402343750000000000000000000000000000000000000000000e+05); p_coeff_14h = double(3.44929702756780723575502634048461914062500000000000000000000000000000000000000000e+05); p_coeff_15h = double(1.14386293806761899031698703765869140625000000000000000000000000000000000000000000e+06); p_coeff_16h = double(3.81954181095832167193293571472167968750000000000000000000000000000000000000000000e+06); p_coeff_17h = double(1.28314429144318234175443649291992187500000000000000000000000000000000000000000000e+07); p_coeff_18h = double(4.33370274414261654019355773925781250000000000000000000000000000000000000000000000e+07); p_coeff_19h = double(1.46996088810462892055511474609375000000000000000000000000000000000000000000000000e+08); p_coeff_20h = double(5.00961200009291708469390869140625000000000000000000000000000000000000000000000000e+08); p_coeff_21h = double(1.77139381348167872428894042968750000000000000000000000000000000000000000000000000e+09); p_coeff_22h = double(6.08314919055301284790039062500000000000000000000000000000000000000000000000000000e+09); p_t_1_0h = p_coeff_22h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_21h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_20h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_19h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_18h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_17h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_16h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_15h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0hm = p_coeff_14h + p_t_16_0h; p_t_17_0h = double(p_t_17_0hm); p_t_17_0m = p_t_17_0hm - p_t_17_0h; p_t_18_0hm = mul_rel<102>(xh,p_t_17_0hm); p_t_18_0h = double(p_t_18_0hm); p_t_18_0m = p_t_18_0hm - p_t_18_0h; p_t_19_0hm = add_rel<102>(p_coeff_13h,p_t_18_0hm); p_t_19_0h = double(p_t_19_0hm); p_t_19_0m = p_t_19_0hm - p_t_19_0h; p_t_20_0hm = mul_rel<102>(xh,p_t_19_0hm); p_t_20_0h = double(p_t_20_0hm); p_t_20_0m = p_t_20_0hm - p_t_20_0h; p_t_21_0hm = add_rel<102>(p_coeff_12h,p_t_20_0hm); p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = mul_rel<102>(xh,p_t_21_0hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = add_rel<102>(p_coeff_11h,p_t_22_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_t_24_0hm = mul_rel<102>(xh,p_t_23_0hm); p_t_24_0h = double(p_t_24_0hm); p_t_24_0m = p_t_24_0hm - p_t_24_0h; p_t_25_0hm = add_rel<102>(p_coeff_10h,p_t_24_0hm); p_t_25_0h = double(p_t_25_0hm); p_t_25_0m = p_t_25_0hm - p_t_25_0h; p_t_26_0hm = mul_rel<102>(xh,p_t_25_0hm); p_t_26_0h = double(p_t_26_0hm); p_t_26_0m = p_t_26_0hm - p_t_26_0h; p_t_27_0hm = add_rel<102>(p_coeff_9h,p_t_26_0hm); p_t_27_0h = double(p_t_27_0hm); p_t_27_0m = p_t_27_0hm - p_t_27_0h; p_t_28_0hm = fma_rel<100>(p_t_27_0hm,xh,p_coeff_8hm); p_t_28_0h = double(p_t_28_0hm); p_t_28_0m = p_t_28_0hm - p_t_28_0h; p_t_29_0hm = fma_rel<100>(p_t_28_0hm,xh,p_coeff_7hm); p_t_29_0h = double(p_t_29_0hm); p_t_29_0m = p_t_29_0hm - p_t_29_0h; p_t_30_0hm = fma_rel<100>(p_t_29_0hm,xh,p_coeff_6hm); p_t_30_0h = double(p_t_30_0hm); p_t_30_0m = p_t_30_0hm - p_t_30_0h; p_t_31_0hm = fma_rel<100>(p_t_30_0hm,xh,p_coeff_5hm); p_t_31_0h = double(p_t_31_0hm); p_t_31_0m = p_t_31_0hm - p_t_31_0h; p_t_32_0hm = fma_rel<100>(p_t_31_0hm,xh,p_coeff_4hm); p_t_32_0h = double(p_t_32_0hm); p_t_32_0m = p_t_32_0hm - p_t_32_0h; p_t_33_0hm = fma_rel<100>(p_t_32_0hm,xh,p_coeff_3hm); p_t_33_0h = double(p_t_33_0hm); p_t_33_0m = p_t_33_0hm - p_t_33_0h; p_t_34_0hm = mul_rel<102>(xh,p_t_33_0hm); p_t_34_0h = double(p_t_34_0hm); p_t_34_0m = p_t_34_0hm - p_t_34_0h; p_t_35_0hml = add_rel<140>(p_coeff_2hm,p_t_34_0hm); p_t_35_0ml = p_t_35_0hml - p_t_35_0h; p_t_35_0m = double(p_t_35_0ml); p_t_35_0l = p_t_35_0ml - p_t_35_0m; p_t_35_0hm = p_t_35_0h + p_t_35_0m; overlap_p_t_35_0 = p_t_35_0m / p_t_35_0h; p_t_36_0hml = mul_rel<145>(xh,p_t_35_0hml); p_t_36_0ml = p_t_36_0hml - p_t_36_0h; p_t_36_0m = double(p_t_36_0ml); p_t_36_0l = p_t_36_0ml - p_t_36_0m; p_t_36_0hm = p_t_36_0h + p_t_36_0m; overlap_p_t_36_0 = p_t_36_0m / p_t_36_0h; p_t_37_0hml = add_rel<143>(p_coeff_1hm,p_t_36_0hml); p_t_37_0ml = p_t_37_0hml - p_t_37_0h; p_t_37_0m = double(p_t_37_0ml); p_t_37_0l = p_t_37_0ml - p_t_37_0m; p_t_37_0hm = p_t_37_0h + p_t_37_0m; overlap_p_t_37_0 = p_t_37_0m / p_t_37_0h; p_t_38_0hml = mul_rel<135>(xh,p_t_37_0hml); p_t_38_0ml = p_t_38_0hml - p_t_38_0h; p_t_38_0m = double(p_t_38_0ml); p_t_38_0l = p_t_38_0ml - p_t_38_0m; p_t_38_0hm = p_t_38_0h + p_t_38_0m; overlap_p_t_38_0 = p_t_38_0m / p_t_38_0h; p_t_39_0hml = add_rel<133>(p_coeff_0hm,p_t_38_0hml); p_t_39_0ml = p_t_39_0hml - p_t_39_0h; p_t_39_0m = double(p_t_39_0ml); p_t_39_0l = p_t_39_0ml - p_t_39_0m; p_t_39_0hm = p_t_39_0h + p_t_39_0m; overlap_p_t_39_0 = p_t_39_0m / p_t_39_0h; p_reshml = p_t_39_0hml; p_resml = p_reshml - p_resh; p_resm = double(p_resml); p_resl = p_resml - p_resm; p_reshm = p_resh + p_resm; overlap_p_res = p_resm / p_resh; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2hm; Mp_coeff_3 = p_coeff_3hm; Mp_coeff_4 = p_coeff_4hm; Mp_coeff_5 = p_coeff_5hm; Mp_coeff_6 = p_coeff_6hm; Mp_coeff_7 = p_coeff_7hm; Mp_coeff_8 = p_coeff_8hm; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_coeff_13 = p_coeff_13h; Mp_coeff_14 = p_coeff_14h; Mp_coeff_15 = p_coeff_15h; Mp_coeff_16 = p_coeff_16h; Mp_coeff_17 = p_coeff_17h; Mp_coeff_18 = p_coeff_18h; Mp_coeff_19 = p_coeff_19h; Mp_coeff_20 = p_coeff_20h; Mp_coeff_21 = p_coeff_21h; Mp_coeff_22 = p_coeff_22h; Mp_t_1_0 = Mp_coeff_22; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_21 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_20 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_19 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_18 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_17 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_16 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_15 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_14 + Mp_t_16_0; Mp_t_18_0 = Mx * Mp_t_17_0; Mp_t_19_0 = Mp_coeff_13 + Mp_t_18_0; Mp_t_20_0 = Mx * Mp_t_19_0; Mp_t_21_0 = Mp_coeff_12 + Mp_t_20_0; Mp_t_22_0 = Mx * Mp_t_21_0; Mp_t_23_0 = Mp_coeff_11 + Mp_t_22_0; Mp_t_24_0 = Mx * Mp_t_23_0; Mp_t_25_0 = Mp_coeff_10 + Mp_t_24_0; Mp_t_26_0 = Mx * Mp_t_25_0; Mp_t_27_0 = Mp_coeff_9 + Mp_t_26_0; Mp_t_28_0 = (Mp_t_27_0 * Mx) + Mp_coeff_8; Mp_t_29_0 = (Mp_t_28_0 * Mx) + Mp_coeff_7; Mp_t_30_0 = (Mp_t_29_0 * Mx) + Mp_coeff_6; Mp_t_31_0 = (Mp_t_30_0 * Mx) + Mp_coeff_5; Mp_t_32_0 = (Mp_t_31_0 * Mx) + Mp_coeff_4; Mp_t_33_0 = (Mp_t_32_0 * Mx) + Mp_coeff_3; Mp_t_34_0 = Mx * Mp_t_33_0; Mp_t_35_0 = Mp_coeff_2 + Mp_t_34_0; Mp_t_36_0 = Mx * Mp_t_35_0; Mp_t_37_0 = Mp_coeff_1 + Mp_t_36_0; Mp_t_38_0 = Mx * Mp_t_37_0; Mp_t_39_0 = Mp_coeff_0 + Mp_t_38_0; Mp_res = Mp_t_39_0; # Definition of the relative arithmetical error epsilon = (p_reshml - Mp_res) / Mp_res; # Implication to prove {(( x in [-96586942132361b-52,-96586942132361b-452] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] ) \/ ( x in [6036683883289b-448,6036683883289b-48] /\ |overlap_p_t_35_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_36_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_36_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_37_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_37_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_38_0| in [1b-400,1b-30] # Verify the lower bound /\ |p_t_38_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_39_0| in [1b-400,1b-25] # Verify the lower bound /\ |p_t_39_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_17_0h ~ p_t_17_0hm; p_t_18_0h ~ p_t_18_0hm; p_t_19_0h ~ p_t_19_0hm; p_t_20_0h ~ p_t_20_0hm; p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; p_t_24_0h ~ p_t_24_0hm; p_t_25_0h ~ p_t_25_0hm; p_t_26_0h ~ p_t_26_0hm; p_t_27_0h ~ p_t_27_0hm; p_t_28_0h ~ p_t_28_0hm; p_t_29_0h ~ p_t_29_0hm; p_t_30_0h ~ p_t_30_0hm; p_t_31_0h ~ p_t_31_0hm; p_t_32_0h ~ p_t_32_0hm; p_t_33_0h ~ p_t_33_0hm; p_t_34_0h ~ p_t_34_0hm; p_t_35_0hm ~ p_t_35_0hml; p_t_35_0h ~ p_t_35_0hm; p_t_35_0h ~ p_t_35_0hml; p_t_35_0m -> p_t_35_0h * overlap_p_t_35_0; p_t_35_0l / p_t_35_0m -> - ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml) / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)); (p_t_35_0hm - p_t_35_0hml) / p_t_35_0hml -> - (p_t_35_0l / p_t_35_0m) * (1 / (1 / overlap_p_t_35_0 + 1 + (p_t_35_0l / p_t_35_0m))); p_t_35_0ml -> p_t_35_0hml / ((1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) / overlap_p_t_35_0 + 1); (p_t_35_0h - p_t_35_0hm) / p_t_35_0hm -> - 1 / (1 / overlap_p_t_35_0 + 1); p_t_35_0h -> p_t_35_0hml / (overlap_p_t_35_0 / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) + 1); p_t_36_0hm ~ p_t_36_0hml; p_t_36_0h ~ p_t_36_0hm; p_t_36_0h ~ p_t_36_0hml; p_t_36_0m -> p_t_36_0h * overlap_p_t_36_0; p_t_36_0l / p_t_36_0m -> - ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml) / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)); (p_t_36_0hm - p_t_36_0hml) / p_t_36_0hml -> - (p_t_36_0l / p_t_36_0m) * (1 / (1 / overlap_p_t_36_0 + 1 + (p_t_36_0l / p_t_36_0m))); p_t_36_0ml -> p_t_36_0hml / ((1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) / overlap_p_t_36_0 + 1); (p_t_36_0h - p_t_36_0hm) / p_t_36_0hm -> - 1 / (1 / overlap_p_t_36_0 + 1); p_t_36_0h -> p_t_36_0hml / (overlap_p_t_36_0 / (1 + ((p_t_36_0m - p_t_36_0ml) / p_t_36_0ml)) + 1); p_t_37_0hm ~ p_t_37_0hml; p_t_37_0h ~ p_t_37_0hm; p_t_37_0h ~ p_t_37_0hml; p_t_37_0m -> p_t_37_0h * overlap_p_t_37_0; p_t_37_0l / p_t_37_0m -> - ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml) / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)); (p_t_37_0hm - p_t_37_0hml) / p_t_37_0hml -> - (p_t_37_0l / p_t_37_0m) * (1 / (1 / overlap_p_t_37_0 + 1 + (p_t_37_0l / p_t_37_0m))); p_t_37_0ml -> p_t_37_0hml / ((1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) / overlap_p_t_37_0 + 1); (p_t_37_0h - p_t_37_0hm) / p_t_37_0hm -> - 1 / (1 / overlap_p_t_37_0 + 1); p_t_37_0h -> p_t_37_0hml / (overlap_p_t_37_0 / (1 + ((p_t_37_0m - p_t_37_0ml) / p_t_37_0ml)) + 1); p_t_38_0hm ~ p_t_38_0hml; p_t_38_0h ~ p_t_38_0hm; p_t_38_0h ~ p_t_38_0hml; p_t_38_0m -> p_t_38_0h * overlap_p_t_38_0; p_t_38_0l / p_t_38_0m -> - ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml) / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)); (p_t_38_0hm - p_t_38_0hml) / p_t_38_0hml -> - (p_t_38_0l / p_t_38_0m) * (1 / (1 / overlap_p_t_38_0 + 1 + (p_t_38_0l / p_t_38_0m))); p_t_38_0ml -> p_t_38_0hml / ((1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) / overlap_p_t_38_0 + 1); (p_t_38_0h - p_t_38_0hm) / p_t_38_0hm -> - 1 / (1 / overlap_p_t_38_0 + 1); p_t_38_0h -> p_t_38_0hml / (overlap_p_t_38_0 / (1 + ((p_t_38_0m - p_t_38_0ml) / p_t_38_0ml)) + 1); p_t_39_0hm ~ p_t_39_0hml; p_t_39_0h ~ p_t_39_0hm; p_t_39_0h ~ p_t_39_0hml; p_t_39_0m -> p_t_39_0h * overlap_p_t_39_0; p_t_39_0l / p_t_39_0m -> - ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml) / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)); (p_t_39_0hm - p_t_39_0hml) / p_t_39_0hml -> - (p_t_39_0l / p_t_39_0m) * (1 / (1 / overlap_p_t_39_0 + 1 + (p_t_39_0l / p_t_39_0m))); p_t_39_0ml -> p_t_39_0hml / ((1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) / overlap_p_t_39_0 + 1); (p_t_39_0h - p_t_39_0hm) / p_t_39_0hm -> - 1 / (1 / overlap_p_t_39_0 + 1); p_t_39_0h -> p_t_39_0hml / (overlap_p_t_39_0 / (1 + ((p_t_39_0m - p_t_39_0ml) / p_t_39_0ml)) + 1); p_reshm ~ p_reshml; p_resh ~ p_reshm; p_resh ~ p_reshml; p_resm -> p_resh * overlap_p_res; p_resl / p_resm -> - ((p_resm - p_resml) / p_resml) / (1 + ((p_resm - p_resml) / p_resml)); (p_reshm - p_reshml) / p_reshml -> - (p_resl / p_resm) * (1 / (1 / overlap_p_res + 1 + (p_resl / p_resm))); p_resml -> p_reshml / ((1 + ((p_resm - p_resml) / p_resml)) / overlap_p_res + 1); (p_resh - p_reshm) / p_reshm -> - 1 / (1 / overlap_p_res + 1); p_resh -> p_reshml / (overlap_p_res / (1 + ((p_resm - p_resml) / p_resml)) + 1); # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0hm ~ Mp_t_17_0; p_t_18_0hm ~ Mp_t_18_0; p_t_19_0hm ~ Mp_t_19_0; p_t_20_0hm ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_t_24_0hm ~ Mp_t_24_0; p_t_25_0hm ~ Mp_t_25_0; p_t_26_0hm ~ Mp_t_26_0; p_t_27_0hm ~ Mp_t_27_0; p_t_28_0hm ~ Mp_t_28_0; p_t_29_0hm ~ Mp_t_29_0; p_t_30_0hm ~ Mp_t_30_0; p_t_31_0hm ~ Mp_t_31_0; p_t_32_0hm ~ Mp_t_32_0; p_t_33_0hm ~ Mp_t_33_0; p_t_34_0hm ~ Mp_t_34_0; p_t_35_0hml ~ Mp_t_35_0; p_t_36_0hml ~ Mp_t_36_0; p_t_37_0hml ~ Mp_t_37_0; p_t_38_0hml ~ Mp_t_38_0; p_t_39_0hml ~ Mp_t_39_0; p_reshml ~ Mp_res; # Dichotomies for triple-double decomposition $ p_t_35_0hml in (0); $ p_t_35_0ml in (0); $ p_t_36_0hml in (0); $ p_t_36_0ml in (0); $ p_t_37_0hml in (0); $ p_t_37_0ml in (0); $ p_t_38_0hml in (0); $ p_t_38_0ml in (0); $ p_t_39_0hml in (0); $ p_t_39_0ml in (0); $ p_reshml in (0); $ p_resml in (0); # Dichotomy for the error bound epsilon $ xhml; interval-2.1.0/src/crlibm/gappa/asin/asinAccuR9.gappa0000644000000000000000000003701513031036767020534 0ustar 00000000000000# The polynomial to implement is: 10495927159903232351211685275788667b-113 + (x * ((-114617556493442511624717420939755b-110) + (x * (27305479231796324762706248415393b-110 + (x * ((-69064186447523516588334408074399b-113) + (x * (100011328992979175025945315294869b-115 + (x * ((-78413912811472400588428747081623b-116) + (x * (16197729753218861570784898965837b-115 + (x * ((-55561816015974041716967640671199b-118) + (x * (1359649836545143b-64 + (x * ((-4899041428846357b-67) + (x * (8978414956877191b-69 + (x * ((-4171527322798521b-69) + (x * (1960809304100323b-69 + (x * ((-3723031201800671b-71) + (x * (7128608706414571b-73 + (x * ((-6874476813806547b-74) + (x * (6671643449666827b-75 + (x * ((-3255007506604485b-75) + (x * (6385219779544523b-77 + (x * ((-802479419572625b-75) + (x * 6343351034255153b-79))))))))))))))))))))))))))))))))))))))) # The polynomial implemented is: 10495927159903232351211685275788667b-113 + (x * ((-114617556493442511624717420939755b-110) + (x * (27305479231796324762706248415393b-110 + (x * ((-69064186447523516588334408074399b-113) + (x * (100011328992979175025945315294869b-115 + (x * ((-78413912811472400588428747081623b-116) + (x * (16197729753218861570784898965837b-115 + (x * ((-55561816015974041716967640671199b-118) + (x * (1359649836545143b-64 + (x * ((-4899041428846357b-67) + (x * (8978414956877191b-69 + (x * ((-4171527322798521b-69) + (x * (1960809304100323b-69 + (x * ((-3723031201800671b-71) + (x * (7128608706414571b-73 + (x * ((-6874476813806547b-74) + (x * (6671643449666827b-75 + (x * ((-3255007506604485b-75) + (x * (6385219779544523b-77 + (x * ((-802479419572625b-75) + (x * 6343351034255153b-79))))))))))))))))))))))))))))))))))))))) # The domain is [-140737488356209b-50;1125899906835577b-53] # The free variable x is a double precision number, the result p_res* is stored on a triple-double number. # The code produces 57 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(1.01072102056824553173441927356179803609848022460937500000000000000000000000000000e+00); p_coeff_0m = double(1.39129934510313097947345056199237890632902839379463674068793110905062349047511816e-20); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(-8.82981536812866424357437722392205614596605300903320312500000000000000000000000000e-02); p_coeff_1m = double(2.41792724167186006978828150786347532734726726246399404474107797113902051933109760e-18); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(2.10353760393441266418612656252662418410181999206542968750000000000000000000000000e-02); p_coeff_2m = double(1.08336737333055412851633739558643005025128690376628494418387305131545872427523136e-18); p_coeff_2hm = p_coeff_2h + p_coeff_2m; p_coeff_3h = double(-6.65063923820143239329372164547748980112373828887939453125000000000000000000000000e-03); p_coeff_3m = double(-3.26520170221686406454105223534078119197675928213141878161951403569673857418820262e-19); p_coeff_3hm = p_coeff_3h + p_coeff_3m; p_coeff_4h = double(2.40768516606927433787443959545271354727447032928466796875000000000000000000000000e-03); p_coeff_4m = double(-1.97265146971483602383336920707508202998297784121844945705998020102356349525507540e-19); p_coeff_4hm = p_coeff_4h + p_coeff_4m; p_coeff_5h = double(-9.43873142126153748948658162021274620201438665390014648437500000000000000000000000e-04); p_coeff_5m = double(-1.00627526920533400945274389592272919368733418903938436114037235924456581415142864e-20); p_coeff_5hm = p_coeff_5h + p_coeff_5m; p_coeff_6h = double(3.89946159535203471478703729502512942417524755001068115234375000000000000000000000e-04); p_coeff_6m = double(-1.68716106145871574328060887792714981312318371720271803146373734705321112414821982e-21); p_coeff_6hm = p_coeff_6h + p_coeff_6m; p_coeff_7h = double(-1.67200258171404256496775375673280450428137555718421936035156250000000000000000000e-04); p_coeff_7m = double(1.19784970040097203700724589956273625590162416200800595011445592863452702658833005e-20); p_coeff_7hm = p_coeff_7h + p_coeff_7m; p_coeff_8h = double(7.37067653300902520495385683574340873747132718563079833984375000000000000000000000e-05); p_coeff_9h = double(-3.31971960015731878111157338029357788400375284254550933837890625000000000000000000e-05); p_coeff_10h = double(1.52100265651915579552836896293221968790021492168307304382324218750000000000000000e-05); p_coeff_11h = double(-7.06684216556374468498364499469133193088055122643709182739257812500000000000000000e-06); p_coeff_12h = double(3.32174016771150049044582924784307920162973459810018539428710937500000000000000000e-06); p_coeff_13h = double(-1.57676504579047108034364592377141178758392925374209880828857421875000000000000000e-06); p_coeff_14h = double(7.54770805302124936124669781628560016883966454770416021347045898437500000000000000e-07); p_coeff_15h = double(-3.63931772276869473623270951831432107326236291555687785148620605468750000000000000e-07); p_coeff_16h = double(1.76596931693785619791949872102454488498324280953966081142425537109375000000000000e-07); p_coeff_17h = double(-8.61593313016896376739609539688324879591618810081854462623596191406250000000000000e-08); p_coeff_18h = double(4.22538400682347749169000988064132107169257324130740016698837280273437500000000000e-08); p_coeff_19h = double(-2.12414533709850257115170054159070112120843987213447690010070800781250000000000000e-08); p_coeff_20h = double(1.04941939883081181921218176284101020190320241454173810780048370361328125000000000e-08); p_t_1_0h = p_coeff_20h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_19h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_18h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_17h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_16h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_15h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_14h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_13h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0hm = p_coeff_12h + p_t_16_0h; p_t_17_0h = double(p_t_17_0hm); p_t_17_0m = p_t_17_0hm - p_t_17_0h; p_t_18_0hm = mul_rel<102>(xh,p_t_17_0hm); p_t_18_0h = double(p_t_18_0hm); p_t_18_0m = p_t_18_0hm - p_t_18_0h; p_t_19_0hm = add_rel<102>(p_coeff_11h,p_t_18_0hm); p_t_19_0h = double(p_t_19_0hm); p_t_19_0m = p_t_19_0hm - p_t_19_0h; p_t_20_0hm = mul_rel<102>(xh,p_t_19_0hm); p_t_20_0h = double(p_t_20_0hm); p_t_20_0m = p_t_20_0hm - p_t_20_0h; p_t_21_0hm = add_rel<102>(p_coeff_10h,p_t_20_0hm); p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = mul_rel<102>(xh,p_t_21_0hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = add_rel<102>(p_coeff_9h,p_t_22_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_t_24_0hm = mul_rel<102>(xh,p_t_23_0hm); p_t_24_0h = double(p_t_24_0hm); p_t_24_0m = p_t_24_0hm - p_t_24_0h; p_t_25_0hm = add_rel<102>(p_coeff_8h,p_t_24_0hm); p_t_25_0h = double(p_t_25_0hm); p_t_25_0m = p_t_25_0hm - p_t_25_0h; p_t_26_0hm = fma_rel<100>(p_t_25_0hm,xh,p_coeff_7hm); p_t_26_0h = double(p_t_26_0hm); p_t_26_0m = p_t_26_0hm - p_t_26_0h; p_t_27_0hm = fma_rel<100>(p_t_26_0hm,xh,p_coeff_6hm); p_t_27_0h = double(p_t_27_0hm); p_t_27_0m = p_t_27_0hm - p_t_27_0h; p_t_28_0hm = fma_rel<100>(p_t_27_0hm,xh,p_coeff_5hm); p_t_28_0h = double(p_t_28_0hm); p_t_28_0m = p_t_28_0hm - p_t_28_0h; p_t_29_0hm = fma_rel<100>(p_t_28_0hm,xh,p_coeff_4hm); p_t_29_0h = double(p_t_29_0hm); p_t_29_0m = p_t_29_0hm - p_t_29_0h; p_t_30_0hm = fma_rel<100>(p_t_29_0hm,xh,p_coeff_3hm); p_t_30_0h = double(p_t_30_0hm); p_t_30_0m = p_t_30_0hm - p_t_30_0h; p_t_31_0hm = fma_rel<100>(p_t_30_0hm,xh,p_coeff_2hm); p_t_31_0h = double(p_t_31_0hm); p_t_31_0m = p_t_31_0hm - p_t_31_0h; p_t_32_0hm = mul_rel<102>(xh,p_t_31_0hm); p_t_32_0h = double(p_t_32_0hm); p_t_32_0m = p_t_32_0hm - p_t_32_0h; p_t_33_0hml = add_rel<140>(p_coeff_1hm,p_t_32_0hm); p_t_33_0ml = p_t_33_0hml - p_t_33_0h; p_t_33_0m = double(p_t_33_0ml); p_t_33_0l = p_t_33_0ml - p_t_33_0m; p_t_33_0hm = p_t_33_0h + p_t_33_0m; overlap_p_t_33_0 = p_t_33_0m / p_t_33_0h; p_t_34_0hml = mul_rel<145>(xh,p_t_33_0hml); p_t_34_0ml = p_t_34_0hml - p_t_34_0h; p_t_34_0m = double(p_t_34_0ml); p_t_34_0l = p_t_34_0ml - p_t_34_0m; p_t_34_0hm = p_t_34_0h + p_t_34_0m; overlap_p_t_34_0 = p_t_34_0m / p_t_34_0h; p_t_35_0hml = add_rel<143>(p_coeff_0hm,p_t_34_0hml); p_t_35_0ml = p_t_35_0hml - p_t_35_0h; p_t_35_0m = double(p_t_35_0ml); p_t_35_0l = p_t_35_0ml - p_t_35_0m; p_t_35_0hm = p_t_35_0h + p_t_35_0m; overlap_p_t_35_0 = p_t_35_0m / p_t_35_0h; p_reshml = p_t_35_0hml; p_resml = p_reshml - p_resh; p_resm = double(p_resml); p_resl = p_resml - p_resm; p_reshm = p_resh + p_resm; overlap_p_res = p_resm / p_resh; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2hm; Mp_coeff_3 = p_coeff_3hm; Mp_coeff_4 = p_coeff_4hm; Mp_coeff_5 = p_coeff_5hm; Mp_coeff_6 = p_coeff_6hm; Mp_coeff_7 = p_coeff_7hm; Mp_coeff_8 = p_coeff_8h; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_coeff_13 = p_coeff_13h; Mp_coeff_14 = p_coeff_14h; Mp_coeff_15 = p_coeff_15h; Mp_coeff_16 = p_coeff_16h; Mp_coeff_17 = p_coeff_17h; Mp_coeff_18 = p_coeff_18h; Mp_coeff_19 = p_coeff_19h; Mp_coeff_20 = p_coeff_20h; Mp_t_1_0 = Mp_coeff_20; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_19 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_18 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_17 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_16 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_15 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_14 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_13 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_12 + Mp_t_16_0; Mp_t_18_0 = Mx * Mp_t_17_0; Mp_t_19_0 = Mp_coeff_11 + Mp_t_18_0; Mp_t_20_0 = Mx * Mp_t_19_0; Mp_t_21_0 = Mp_coeff_10 + Mp_t_20_0; Mp_t_22_0 = Mx * Mp_t_21_0; Mp_t_23_0 = Mp_coeff_9 + Mp_t_22_0; Mp_t_24_0 = Mx * Mp_t_23_0; Mp_t_25_0 = Mp_coeff_8 + Mp_t_24_0; Mp_t_26_0 = (Mp_t_25_0 * Mx) + Mp_coeff_7; Mp_t_27_0 = (Mp_t_26_0 * Mx) + Mp_coeff_6; Mp_t_28_0 = (Mp_t_27_0 * Mx) + Mp_coeff_5; Mp_t_29_0 = (Mp_t_28_0 * Mx) + Mp_coeff_4; Mp_t_30_0 = (Mp_t_29_0 * Mx) + Mp_coeff_3; Mp_t_31_0 = (Mp_t_30_0 * Mx) + Mp_coeff_2; Mp_t_32_0 = Mx * Mp_t_31_0; Mp_t_33_0 = Mp_coeff_1 + Mp_t_32_0; Mp_t_34_0 = Mx * Mp_t_33_0; Mp_t_35_0 = Mp_coeff_0 + Mp_t_34_0; Mp_res = Mp_t_35_0; # Definition of the relative arithmetical error epsilon = (p_reshml - Mp_res) / Mp_res; # Implication to prove {(( x in [-140737488356209b-50,-140737488356209b-450] /\ |overlap_p_t_33_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_33_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_34_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_34_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_35_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] ) \/ ( x in [1125899906835577b-453,1125899906835577b-53] /\ |overlap_p_t_33_0| in [1b-400,1b-45] # Verify the lower bound /\ |p_t_33_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_34_0| in [1b-400,1b-40] # Verify the lower bound /\ |p_t_34_0ml| in [1b-1021,1b1023] /\ |overlap_p_t_35_0| in [1b-400,1b-35] # Verify the lower bound /\ |p_t_35_0ml| in [1b-1021,1b1023] /\ |overlap_p_res| in [1b-400,1b-52] # Verify the lower bound /\ |p_resml| in [1b-1021,1b1023] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_17_0h ~ p_t_17_0hm; p_t_18_0h ~ p_t_18_0hm; p_t_19_0h ~ p_t_19_0hm; p_t_20_0h ~ p_t_20_0hm; p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; p_t_24_0h ~ p_t_24_0hm; p_t_25_0h ~ p_t_25_0hm; p_t_26_0h ~ p_t_26_0hm; p_t_27_0h ~ p_t_27_0hm; p_t_28_0h ~ p_t_28_0hm; p_t_29_0h ~ p_t_29_0hm; p_t_30_0h ~ p_t_30_0hm; p_t_31_0h ~ p_t_31_0hm; p_t_32_0h ~ p_t_32_0hm; p_t_33_0hm ~ p_t_33_0hml; p_t_33_0h ~ p_t_33_0hm; p_t_33_0h ~ p_t_33_0hml; p_t_33_0m -> p_t_33_0h * overlap_p_t_33_0; p_t_33_0l / p_t_33_0m -> - ((p_t_33_0m - p_t_33_0ml) / p_t_33_0ml) / (1 + ((p_t_33_0m - p_t_33_0ml) / p_t_33_0ml)); (p_t_33_0hm - p_t_33_0hml) / p_t_33_0hml -> - (p_t_33_0l / p_t_33_0m) * (1 / (1 / overlap_p_t_33_0 + 1 + (p_t_33_0l / p_t_33_0m))); p_t_33_0ml -> p_t_33_0hml / ((1 + ((p_t_33_0m - p_t_33_0ml) / p_t_33_0ml)) / overlap_p_t_33_0 + 1); (p_t_33_0h - p_t_33_0hm) / p_t_33_0hm -> - 1 / (1 / overlap_p_t_33_0 + 1); p_t_33_0h -> p_t_33_0hml / (overlap_p_t_33_0 / (1 + ((p_t_33_0m - p_t_33_0ml) / p_t_33_0ml)) + 1); p_t_34_0hm ~ p_t_34_0hml; p_t_34_0h ~ p_t_34_0hm; p_t_34_0h ~ p_t_34_0hml; p_t_34_0m -> p_t_34_0h * overlap_p_t_34_0; p_t_34_0l / p_t_34_0m -> - ((p_t_34_0m - p_t_34_0ml) / p_t_34_0ml) / (1 + ((p_t_34_0m - p_t_34_0ml) / p_t_34_0ml)); (p_t_34_0hm - p_t_34_0hml) / p_t_34_0hml -> - (p_t_34_0l / p_t_34_0m) * (1 / (1 / overlap_p_t_34_0 + 1 + (p_t_34_0l / p_t_34_0m))); p_t_34_0ml -> p_t_34_0hml / ((1 + ((p_t_34_0m - p_t_34_0ml) / p_t_34_0ml)) / overlap_p_t_34_0 + 1); (p_t_34_0h - p_t_34_0hm) / p_t_34_0hm -> - 1 / (1 / overlap_p_t_34_0 + 1); p_t_34_0h -> p_t_34_0hml / (overlap_p_t_34_0 / (1 + ((p_t_34_0m - p_t_34_0ml) / p_t_34_0ml)) + 1); p_t_35_0hm ~ p_t_35_0hml; p_t_35_0h ~ p_t_35_0hm; p_t_35_0h ~ p_t_35_0hml; p_t_35_0m -> p_t_35_0h * overlap_p_t_35_0; p_t_35_0l / p_t_35_0m -> - ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml) / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)); (p_t_35_0hm - p_t_35_0hml) / p_t_35_0hml -> - (p_t_35_0l / p_t_35_0m) * (1 / (1 / overlap_p_t_35_0 + 1 + (p_t_35_0l / p_t_35_0m))); p_t_35_0ml -> p_t_35_0hml / ((1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) / overlap_p_t_35_0 + 1); (p_t_35_0h - p_t_35_0hm) / p_t_35_0hm -> - 1 / (1 / overlap_p_t_35_0 + 1); p_t_35_0h -> p_t_35_0hml / (overlap_p_t_35_0 / (1 + ((p_t_35_0m - p_t_35_0ml) / p_t_35_0ml)) + 1); p_reshm ~ p_reshml; p_resh ~ p_reshm; p_resh ~ p_reshml; p_resm -> p_resh * overlap_p_res; p_resl / p_resm -> - ((p_resm - p_resml) / p_resml) / (1 + ((p_resm - p_resml) / p_resml)); (p_reshm - p_reshml) / p_reshml -> - (p_resl / p_resm) * (1 / (1 / overlap_p_res + 1 + (p_resl / p_resm))); p_resml -> p_reshml / ((1 + ((p_resm - p_resml) / p_resml)) / overlap_p_res + 1); (p_resh - p_reshm) / p_reshm -> - 1 / (1 / overlap_p_res + 1); p_resh -> p_reshml / (overlap_p_res / (1 + ((p_resm - p_resml) / p_resml)) + 1); # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0hm ~ Mp_t_17_0; p_t_18_0hm ~ Mp_t_18_0; p_t_19_0hm ~ Mp_t_19_0; p_t_20_0hm ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_t_24_0hm ~ Mp_t_24_0; p_t_25_0hm ~ Mp_t_25_0; p_t_26_0hm ~ Mp_t_26_0; p_t_27_0hm ~ Mp_t_27_0; p_t_28_0hm ~ Mp_t_28_0; p_t_29_0hm ~ Mp_t_29_0; p_t_30_0hm ~ Mp_t_30_0; p_t_31_0hm ~ Mp_t_31_0; p_t_32_0hm ~ Mp_t_32_0; p_t_33_0hml ~ Mp_t_33_0; p_t_34_0hml ~ Mp_t_34_0; p_t_35_0hml ~ Mp_t_35_0; p_reshml ~ Mp_res; # Dichotomies for triple-double decomposition $ p_t_33_0hml in (0); $ p_t_33_0ml in (0); $ p_t_34_0hml in (0); $ p_t_34_0ml in (0); $ p_t_35_0hml in (0); $ p_t_35_0ml in (0); $ p_reshml in (0); $ p_resml in (0); # Dichotomy for the error bound epsilon $ xhml; interval-2.1.0/src/crlibm/gappa/asin/asinQuickR0.gappa0000644000000000000000000001310313031036767020714 0ustar 00000000000000# The polynomial to implement is: x * (1b0 + ((x^(1b1)) * (6004799503160663b-55 + ((x^(1b1)) * (2702159776421267b-55 + ((x^(1b1)) * (6433713754276237b-57 + ((x^(1b1)) * (273656221440481b-53 + ((x^(1b1)) * (1612086811548785b-56 + ((x^(1b1)) * (2500589232146671b-57 + ((x^(1b1)) * (1008591508159575b-56 + ((x^(1b1)) * (6411982820477177b-59 + ((x^(1b1)) * 7401443504515565b-59)))))))))))))))))) # The polynomial implemented is: x * (1b0 + ((x^(1b1)) * (6004799503160663b-55 + ((x^(1b1)) * (2702159776421267b-55 + ((x^(1b1)) * (6433713754276237b-57 + ((x^(1b1)) * (273656221440481b-53 + ((x^(1b1)) * (1612086811548785b-56 + ((x^(1b1)) * (2500589232146671b-57 + ((x^(1b1)) * (1008591508159575b-56 + ((x^(1b1)) * (6411982820477177b-59 + ((x^(1b1)) * 7401443504515565b-59)))))))))))))))))) # The domain is [1b-54;9007199254740983b-55] # The free variable x is a double precision number, the result p_res* is stored on a double-double number. # The code produces 32 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_1h = double(1.00000000000000000000000000000000000000000000000000000000000000000000000000000000e+00); p_coeff_3h = double(1.66666666666666712925959359381522517651319503784179687500000000000000000000000000e-01); p_coeff_5h = double(7.49999999999713951037705328417359851300716400146484375000000000000000000000000000e-02); p_coeff_7h = double(4.46428571490314687886247213555179769173264503479003906250000000000000000000000000e-02); p_coeff_9h = double(3.03819437875142428495678359468001872301101684570312500000000000000000000000000000e-02); p_coeff_11h = double(2.23721986984502102524530187110940460115671157836914062500000000000000000000000000e-02); p_coeff_13h = double(1.73513233791185925158906400156411109492182731628417968750000000000000000000000000e-02); p_coeff_15h = double(1.39970189350021451124561622236797120422124862670898437500000000000000000000000000e-02); p_coeff_17h = double(1.11230171262417399519195626567125145811587572097778320312500000000000000000000000e-02); p_coeff_19h = double(1.28394578033992016324882357025671808514744043350219726562500000000000000000000000e-02); p_x_0_pow2hm = xh * xh; p_x_0_pow2h = double(p_x_0_pow2hm); p_x_0_pow2m = p_x_0_pow2hm - p_x_0_pow2h; p_t_1_0h = p_coeff_19h; p_t_2_0h = double(p_t_1_0h * p_x_0_pow2h); p_t_3_0h = double(p_coeff_17h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * p_x_0_pow2h); p_t_5_0h = double(p_coeff_15h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * p_x_0_pow2h); p_t_7_0h = double(p_coeff_13h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * p_x_0_pow2h); p_t_9_0h = double(p_coeff_11h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * p_x_0_pow2h); p_t_11_0h = double(p_coeff_9h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * p_x_0_pow2h); p_t_13_0h = double(p_coeff_7h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * p_x_0_pow2h); p_t_15_0h = double(p_coeff_5h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * p_x_0_pow2h); p_t_17_0hm = p_coeff_3h + p_t_16_0h; p_t_17_0h = double(p_t_17_0hm); p_t_17_0m = p_t_17_0hm - p_t_17_0h; p_t_18_0hm = mul_rel<102>(p_t_17_0hm,p_x_0_pow2hm); p_t_18_0h = double(p_t_18_0hm); p_t_18_0m = p_t_18_0hm - p_t_18_0h; p_t_19_0hm = add_rel<102>(p_coeff_1h,p_t_18_0hm); p_t_19_0h = double(p_t_19_0hm); p_t_19_0m = p_t_19_0hm - p_t_19_0h; p_t_20_0hm = mul_rel<102>(xh,p_t_19_0hm); p_t_20_0h = double(p_t_20_0hm); p_t_20_0m = p_t_20_0hm - p_t_20_0h; p_reshm = p_t_20_0hm; p_resh = p_t_20_0h; p_resm = p_t_20_0m; # Mathematical equivalents Mx = x; Mp_coeff_1 = p_coeff_1h; Mp_coeff_3 = p_coeff_3h; Mp_coeff_5 = p_coeff_5h; Mp_coeff_7 = p_coeff_7h; Mp_coeff_9 = p_coeff_9h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_13 = p_coeff_13h; Mp_coeff_15 = p_coeff_15h; Mp_coeff_17 = p_coeff_17h; Mp_coeff_19 = p_coeff_19h; Mp_x_0_pow2 = Mx * Mx; Mp_t_1_0 = Mp_coeff_19; Mp_t_2_0 = Mp_t_1_0 * Mp_x_0_pow2; Mp_t_3_0 = Mp_coeff_17 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mp_x_0_pow2; Mp_t_5_0 = Mp_coeff_15 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mp_x_0_pow2; Mp_t_7_0 = Mp_coeff_13 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mp_x_0_pow2; Mp_t_9_0 = Mp_coeff_11 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mp_x_0_pow2; Mp_t_11_0 = Mp_coeff_9 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mp_x_0_pow2; Mp_t_13_0 = Mp_coeff_7 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mp_x_0_pow2; Mp_t_15_0 = Mp_coeff_5 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mp_x_0_pow2; Mp_t_17_0 = Mp_coeff_3 + Mp_t_16_0; Mp_t_18_0 = Mp_t_17_0 * Mp_x_0_pow2; Mp_t_19_0 = Mp_coeff_1 + Mp_t_18_0; Mp_t_20_0 = Mx * Mp_t_19_0; Mp_res = Mp_t_20_0; # Definition of the relative arithmetical error epsilon = (p_reshm - Mp_res) / Mp_res; # Implication to prove {(( x in [1b-54,9007199254740983b-55] ) \/ ( x in [-9007199254740983b-55,-1b-54] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_x_0_pow2h ~ p_x_0_pow2hm; p_t_17_0h ~ p_t_17_0hm; p_t_18_0h ~ p_t_18_0hm; p_t_19_0h ~ p_t_19_0hm; p_t_20_0h ~ p_t_20_0hm; # Meta-Hints for Horner scheme p_x_0_pow2hm ~ Mp_x_0_pow2; p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0hm ~ Mp_t_17_0; p_t_18_0hm ~ Mp_t_18_0; p_t_19_0hm ~ Mp_t_19_0; p_t_20_0hm ~ Mp_t_20_0; p_reshm ~ Mp_res; # Dichotomies for triple-double decomposition # Dichotomy for the error bound epsilon $ xhm; interval-2.1.0/src/crlibm/gappa/asin/asinQuickR1.gappa0000644000000000000000000001446713031036767020733 0ustar 00000000000000# The polynomial to implement is: 3183456225869665121297930434727189b-113 + (x * (85096975362484429898305796608495b-106 + (x * (1568372518556091b-53 + (x * (2253096245490285b-53 + (x * (1510242280185791b-53 + (x * (3634933609551149b-54 + (x * (7165193180030863b-55 + (x * (8499199876434095b-55 + (x * (1206650223448851b-52 + (x * (2926133895132309b-53 + (x * (13826886836375b-45 + (x * (8924243571351707b-54 + (x * 5562679466946017b-53))))))))))))))))))))))) # The polynomial implemented is: 3183456225869665121297930434727189b-113 + (x * (85096975362484429898305796608495b-106 + (x * (1568372518556091b-53 + (x * (2253096245490285b-53 + (x * (1510242280185791b-53 + (x * (3634933609551149b-54 + (x * (7165193180030863b-55 + (x * (8499199876434095b-55 + (x * (1206650223448851b-52 + (x * (2926133895132309b-53 + (x * (13826886836375b-45 + (x * (8924243571351707b-54 + (x * 5562679466946017b-53))))))))))))))))))))))) # The domain is [-466363011288839b-53;932726022577599b-54] # The free variable x is a double precision number, the result p_res* is stored on a double-double number. # The code produces 37 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(3.06555683602418194144689778113388456404209136962890625000000000000000000000000000e-01); p_coeff_0m = double(1.37864228855288786229514205458277346294726855883500333047053665325165638932958245e-19); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.04890120337530645677759366662940010428428649902343750000000000000000000000000000e+00); p_coeff_1m = double(-1.03997489957388085277493589447823941146606896923035995294881672634801361709833145e-16); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(1.74124328129031780143520791170885786414146423339843750000000000000000000000000000e-01); p_coeff_3h = double(2.50143932843980842939402009506011381745338439941406250000000000000000000000000000e-01); p_coeff_4h = double(1.67670575222466200493443011509953066706657409667968750000000000000000000000000000e-01); p_coeff_5h = double(2.01779349315375722273557812513899989426136016845703125000000000000000000000000000e-01); p_coeff_6h = double(1.98874061108935212827120153633586596697568893432617187500000000000000000000000000e-01); p_coeff_7h = double(2.35900184842710441968094414733059238642454147338867187500000000000000000000000000e-01); p_coeff_8h = double(2.67930172148400869147621961019467562437057495117187500000000000000000000000000000e-01); p_coeff_9h = double(3.24866122351198272077965611970284953713417053222656250000000000000000000000000000e-01); p_coeff_10h = double(3.92983759990528369598905555903911590576171875000000000000000000000000000000000000e-01); p_coeff_11h = double(4.95395034513885057503301823089714162051677703857421875000000000000000000000000000e-01); p_coeff_12h = double(6.17581482281306048953695153613807633519172668457031250000000000000000000000000000e-01); p_t_1_0h = p_coeff_12h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_11h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_10h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_9h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_8h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_7h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_6h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_5h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0h = double(p_coeff_4h + p_t_16_0h); p_t_18_0h = double(p_t_17_0h * xh); p_t_19_0h = double(p_coeff_3h + p_t_18_0h); p_t_20_0h = double(p_t_19_0h * xh); p_t_21_0hm = p_coeff_2h + p_t_20_0h; p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = fma_rel<100>(p_t_21_0hm,xh,p_coeff_1hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = fma_rel<100>(p_t_22_0hm,xh,p_coeff_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_reshm = p_t_23_0hm; p_resh = p_t_23_0h; p_resm = p_t_23_0m; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2h; Mp_coeff_3 = p_coeff_3h; Mp_coeff_4 = p_coeff_4h; Mp_coeff_5 = p_coeff_5h; Mp_coeff_6 = p_coeff_6h; Mp_coeff_7 = p_coeff_7h; Mp_coeff_8 = p_coeff_8h; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_t_1_0 = Mp_coeff_12; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_11 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_10 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_9 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_8 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_7 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_6 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_5 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_4 + Mp_t_16_0; Mp_t_18_0 = Mp_t_17_0 * Mx; Mp_t_19_0 = Mp_coeff_3 + Mp_t_18_0; Mp_t_20_0 = Mp_t_19_0 * Mx; Mp_t_21_0 = Mp_coeff_2 + Mp_t_20_0; Mp_t_22_0 = (Mp_t_21_0 * Mx) + Mp_coeff_1; Mp_t_23_0 = (Mp_t_22_0 * Mx) + Mp_coeff_0; Mp_res = Mp_t_23_0; # Definition of the relative arithmetical error epsilon = (p_reshm - Mp_res) / Mp_res; # Implication to prove {(( x in [-466363011288839b-53,-466363011288839b-453] ) \/ ( x in [932726022577599b-454,932726022577599b-54] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0h ~ Mp_t_17_0; p_t_18_0h ~ Mp_t_18_0; p_t_19_0h ~ Mp_t_19_0; p_t_20_0h ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_reshm ~ Mp_res; # Dichotomies for triple-double decomposition # Dichotomy for the error bound epsilon $ xhm; interval-2.1.0/src/crlibm/gappa/asin/asinQuickR2.gappa0000644000000000000000000001447713031036767020735 0ustar 00000000000000# The polynomial to implement is: 268636756605111637357595545192172111b-119 + (x * (44120131993499861117550393673295b-105 + (x * (2278907903703317b-53 + (x * (5983541037681123b-54 + (x * (2638503127167829b-53 + (x * (6622388527030519b-54 + (x * (7950889475864811b-54 + (x * (5238009708732451b-53 + (x * (3491644690235915b-52 + (x * (4815737384658755b-52 + (x * (3373487667168671b-51 + (x * (1215099289485353b-49 + (x * 6911419428626897b-51))))))))))))))))))))))) # The polynomial implemented is: 268636756605111637357595545192172111b-119 + (x * (44120131993499861117550393673295b-105 + (x * (2278907903703317b-53 + (x * (5983541037681123b-54 + (x * (2638503127167829b-53 + (x * (6622388527030519b-54 + (x * (7950889475864811b-54 + (x * (5238009708732451b-53 + (x * (3491644690235915b-52 + (x * (4815737384658755b-52 + (x * (3373487667168671b-51 + (x * (1215099289485353b-49 + (x * 6911419428626897b-51))))))))))))))))))))))) # The domain is [-715705849514187b-54;178926462378499b-52] # The free variable x is a double precision number, the result p_res* is stored on a double-double number. # The code produces 37 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(4.04199666960039116769820566332782618701457977294921875000000000000000000000000000e-01); p_coeff_0m = double(-7.29414577305862355348006038497258990002592122212580672446953500287492033749003895e-21); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.08764522696446319649510314775398001074790954589843750000000000000000000000000000e+00); p_coeff_1m = double(7.18002807945845121967809924279486007735232949667977808694274699519155547022819519e-17); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(2.53009602569167157959384439891437068581581115722656250000000000000000000000000000e-01); p_coeff_3h = double(3.32153251441154206968775497443857602775096893310546875000000000000000000000000000e-01); p_coeff_4h = double(2.92932692232720115477206945797661319375038146972656250000000000000000000000000000e-01); p_coeff_5h = double(3.67616411036137902268450261544785462319850921630859375000000000000000000000000000e-01); p_coeff_6h = double(4.41363028117747802081538566199014894664287567138671875000000000000000000000000000e-01); p_coeff_7h = double(5.81535898184487698436839764326578006148338317871093750000000000000000000000000000e-01); p_coeff_8h = double(7.75300865782017067928677533927839249372482299804687500000000000000000000000000000e-01); p_coeff_9h = double(1.06930850499925678143142704357160255312919616699218750000000000000000000000000000e+00); p_coeff_10h = double(1.49812947255186612594002326659392565488815307617187500000000000000000000000000000e+00); p_coeff_11h = double(2.15844993342769164712535712169483304023742675781250000000000000000000000000000000e+00); p_coeff_12h = double(3.06928679300128992579743680835235863924026489257812500000000000000000000000000000e+00); p_t_1_0h = p_coeff_12h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_11h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_10h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_9h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_8h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_7h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_6h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_5h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0h = double(p_coeff_4h + p_t_16_0h); p_t_18_0h = double(p_t_17_0h * xh); p_t_19_0h = double(p_coeff_3h + p_t_18_0h); p_t_20_0h = double(p_t_19_0h * xh); p_t_21_0hm = p_coeff_2h + p_t_20_0h; p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = fma_rel<100>(p_t_21_0hm,xh,p_coeff_1hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = fma_rel<100>(p_t_22_0hm,xh,p_coeff_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_reshm = p_t_23_0hm; p_resh = p_t_23_0h; p_resm = p_t_23_0m; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2h; Mp_coeff_3 = p_coeff_3h; Mp_coeff_4 = p_coeff_4h; Mp_coeff_5 = p_coeff_5h; Mp_coeff_6 = p_coeff_6h; Mp_coeff_7 = p_coeff_7h; Mp_coeff_8 = p_coeff_8h; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_t_1_0 = Mp_coeff_12; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_11 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_10 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_9 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_8 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_7 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_6 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_5 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_4 + Mp_t_16_0; Mp_t_18_0 = Mp_t_17_0 * Mx; Mp_t_19_0 = Mp_coeff_3 + Mp_t_18_0; Mp_t_20_0 = Mp_t_19_0 * Mx; Mp_t_21_0 = Mp_coeff_2 + Mp_t_20_0; Mp_t_22_0 = (Mp_t_21_0 * Mx) + Mp_coeff_1; Mp_t_23_0 = (Mp_t_22_0 * Mx) + Mp_coeff_0; Mp_res = Mp_t_23_0; # Definition of the relative arithmetical error epsilon = (p_reshm - Mp_res) / Mp_res; # Implication to prove {(( x in [-715705849514187b-54,-715705849514187b-454] ) \/ ( x in [178926462378499b-452,178926462378499b-52] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0h ~ Mp_t_17_0; p_t_18_0h ~ Mp_t_18_0; p_t_19_0h ~ Mp_t_19_0; p_t_20_0h ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_reshm ~ Mp_res; # Dichotomies for triple-double decomposition # Dichotomy for the error bound epsilon $ xhm; interval-2.1.0/src/crlibm/gappa/asin/asinQuickR3.gappa0000644000000000000000000001446613031036767020734 0ustar 00000000000000# The polynomial to implement is: 630003272697881842133904116649941b-110 + (x * (22930469560677484970259027045179b-104 + (x * (758992598782411b-51 + (x * (7959118817390667b-54 + (x * (1064903604618827b-51 + (x * (5844783312361271b-53 + (x * (8131347476778009b-53 + (x * (1508230740643617b-50 + (x * (2296555345676609b-50 + (x * (7188218310357077b-51 + (x * (5730917143769297b-50 + (x * (4688813330751791b-49 + (x * 7638382581357819b-49))))))))))))))))))))))) # The polynomial implemented is: 630003272697881842133904116649941b-110 + (x * (22930469560677484970259027045179b-104 + (x * (758992598782411b-51 + (x * (7959118817390667b-54 + (x * (1064903604618827b-51 + (x * (5844783312361271b-53 + (x * (8131347476778009b-53 + (x * (1508230740643617b-50 + (x * (2296555345676609b-50 + (x * (7188218310357077b-51 + (x * (5730917143769297b-50 + (x * (4688813330751791b-49 + (x * 7638382581357819b-49))))))))))))))))))))))) # The domain is [-603367941593347b-54;301683970796841b-53] # The free variable x is a double precision number, the result p_res* is stored on a double-double number. # The code produces 37 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(4.85336867180323261461438733022077940404415130615234375000000000000000000000000000e-01); p_coeff_0m = double(2.48687685471405101032185714779683260767432502103446885499682394993214984424412251e-18); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.13055943592368102201817237073555588722229003906250000000000000000000000000000000e+00); p_coeff_1m = double(8.31884808460703843039094509953103826114589262451931572783792034897487610578536987e-17); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(3.37060423475326498277127029723487794399261474609375000000000000000000000000000000e-01); p_coeff_3h = double(4.41819848339723264540879199557821266353130340576171875000000000000000000000000000e-01); p_coeff_4h = double(4.72912200341658373048403518623672425746917724609375000000000000000000000000000000e-01); p_coeff_5h = double(6.48901300732837138518505071260733529925346374511718750000000000000000000000000000e-01); p_coeff_6h = double(9.02760918994661598624418274994241073727607727050781250000000000000000000000000000e-01); p_coeff_7h = double(1.33957799576799718721531462506391108036041259765625000000000000000000000000000000e+00); p_coeff_8h = double(2.03975089767692541187216193065978586673736572265625000000000000000000000000000000e+00); p_coeff_9h = double(3.19221018967622649498139253410045057535171508789062500000000000000000000000000000e+00); p_coeff_10h = double(5.09007693218536960699793780804611742496490478515625000000000000000000000000000000e+00); p_coeff_11h = double(8.32900562875201266876956651685759425163269042968750000000000000000000000000000000e+00); p_coeff_12h = double(1.35684931403507018643495030119083821773529052734375000000000000000000000000000000e+01); p_t_1_0h = p_coeff_12h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_11h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_10h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_9h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_8h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_7h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_6h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_5h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0h = double(p_coeff_4h + p_t_16_0h); p_t_18_0h = double(p_t_17_0h * xh); p_t_19_0h = double(p_coeff_3h + p_t_18_0h); p_t_20_0h = double(p_t_19_0h * xh); p_t_21_0hm = p_coeff_2h + p_t_20_0h; p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = fma_rel<100>(p_t_21_0hm,xh,p_coeff_1hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = fma_rel<100>(p_t_22_0hm,xh,p_coeff_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_reshm = p_t_23_0hm; p_resh = p_t_23_0h; p_resm = p_t_23_0m; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2h; Mp_coeff_3 = p_coeff_3h; Mp_coeff_4 = p_coeff_4h; Mp_coeff_5 = p_coeff_5h; Mp_coeff_6 = p_coeff_6h; Mp_coeff_7 = p_coeff_7h; Mp_coeff_8 = p_coeff_8h; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_t_1_0 = Mp_coeff_12; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_11 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_10 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_9 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_8 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_7 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_6 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_5 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_4 + Mp_t_16_0; Mp_t_18_0 = Mp_t_17_0 * Mx; Mp_t_19_0 = Mp_coeff_3 + Mp_t_18_0; Mp_t_20_0 = Mp_t_19_0 * Mx; Mp_t_21_0 = Mp_coeff_2 + Mp_t_20_0; Mp_t_22_0 = (Mp_t_21_0 * Mx) + Mp_coeff_1; Mp_t_23_0 = (Mp_t_22_0 * Mx) + Mp_coeff_0; Mp_res = Mp_t_23_0; # Definition of the relative arithmetical error epsilon = (p_reshm - Mp_res) / Mp_res; # Implication to prove {(( x in [-603367941593347b-54,-603367941593347b-454] ) \/ ( x in [301683970796841b-453,301683970796841b-53] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0h ~ Mp_t_17_0; p_t_18_0h ~ Mp_t_18_0; p_t_19_0h ~ Mp_t_19_0; p_t_20_0h ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_reshm ~ Mp_res; # Dichotomies for triple-double decomposition # Dichotomy for the error bound epsilon $ xhm; interval-2.1.0/src/crlibm/gappa/asin/asinQuickR4.gappa0000644000000000000000000001446513031036767020734 0ustar 00000000000000# The polynomial to implement is: 2897411029384279446550734201912699b-112 + (x * (1530198189661957827573916764927897b-110 + (x * (3906404311867243b-53 + (x * (2666766777791871b-52 + (x * (3357549051583063b-52 + (x * (2563180742222195b-51 + (x * (3977769854047b-41 + (x * (6829960164420871b-51 + (x * (5902661651242291b-50 + (x * (2617002045792421b-48 + (x * (4732026594888409b-48 + (x * (2194629853394353b-46 + (x * 4057612944155747b-46))))))))))))))))))))))) # The polynomial implemented is: 2897411029384279446550734201912699b-112 + (x * (1530198189661957827573916764927897b-110 + (x * (3906404311867243b-53 + (x * (2666766777791871b-52 + (x * (3357549051583063b-52 + (x * (2563180742222195b-51 + (x * (3977769854047b-41 + (x * (6829960164420871b-51 + (x * (5902661651242291b-50 + (x * (2617002045792421b-48 + (x * (4732026594888409b-48 + (x * (2194629853394353b-46 + (x * 4057612944155747b-46))))))))))))))))))))))) # The domain is [-66447228468955b-51;265788913875259b-53] # The free variable x is a double precision number, the result p_res* is stored on a double-double number. # The code produces 37 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(5.58021066268902909968119274708442389965057373046875000000000000000000000000000000e-01); p_coeff_0m = double(9.12034392087434999453497016043152989309974709890359127750780743326686206273734570e-20); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.17882180572684136521388609253335744142532348632812500000000000000000000000000000e+00); p_coeff_1m = double(2.42941652280796864299660766500640409154688815034626482580737416583360754884779453e-18); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(4.33698001053000381510571514809271320700645446777343750000000000000000000000000000e-01); p_coeff_3h = double(5.92141175601994751431789154594298452138900756835937500000000000000000000000000000e-01); p_coeff_4h = double(7.45525652675174788086565058620180934667587280273437500000000000000000000000000000e-01); p_coeff_5h = double(1.13828091051635160724231354834046214818954467773437500000000000000000000000000000e+00); p_coeff_6h = double(1.80888030356391027453355491161346435546875000000000000000000000000000000000000000e+00); p_coeff_7h = double(3.03311161272506835118178969423752278089523315429687500000000000000000000000000000e+00); p_coeff_8h = double(5.24261669742490976631188459577970206737518310546875000000000000000000000000000000e+00); p_coeff_9h = double(9.29745896553562900521683332044631242752075195312500000000000000000000000000000000e+00); p_coeff_10h = double(1.68115356121078072249019896844401955604553222656250000000000000000000000000000000e+01); p_coeff_11h = double(3.11875660002322234731764183379709720611572265625000000000000000000000000000000000e+01); p_coeff_12h = double(5.76621480399203818478781613521277904510498046875000000000000000000000000000000000e+01); p_t_1_0h = p_coeff_12h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_11h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_10h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_9h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_8h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_7h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_6h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_5h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0h = double(p_coeff_4h + p_t_16_0h); p_t_18_0h = double(p_t_17_0h * xh); p_t_19_0h = double(p_coeff_3h + p_t_18_0h); p_t_20_0h = double(p_t_19_0h * xh); p_t_21_0hm = p_coeff_2h + p_t_20_0h; p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = fma_rel<100>(p_t_21_0hm,xh,p_coeff_1hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = fma_rel<100>(p_t_22_0hm,xh,p_coeff_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_reshm = p_t_23_0hm; p_resh = p_t_23_0h; p_resm = p_t_23_0m; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2h; Mp_coeff_3 = p_coeff_3h; Mp_coeff_4 = p_coeff_4h; Mp_coeff_5 = p_coeff_5h; Mp_coeff_6 = p_coeff_6h; Mp_coeff_7 = p_coeff_7h; Mp_coeff_8 = p_coeff_8h; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_t_1_0 = Mp_coeff_12; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_11 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_10 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_9 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_8 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_7 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_6 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_5 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_4 + Mp_t_16_0; Mp_t_18_0 = Mp_t_17_0 * Mx; Mp_t_19_0 = Mp_coeff_3 + Mp_t_18_0; Mp_t_20_0 = Mp_t_19_0 * Mx; Mp_t_21_0 = Mp_coeff_2 + Mp_t_20_0; Mp_t_22_0 = (Mp_t_21_0 * Mx) + Mp_coeff_1; Mp_t_23_0 = (Mp_t_22_0 * Mx) + Mp_coeff_0; Mp_res = Mp_t_23_0; # Definition of the relative arithmetical error epsilon = (p_reshm - Mp_res) / Mp_res; # Implication to prove {(( x in [-66447228468955b-51,-66447228468955b-451] ) \/ ( x in [265788913875259b-453,265788913875259b-53] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0h ~ Mp_t_17_0; p_t_18_0h ~ Mp_t_18_0; p_t_19_0h ~ Mp_t_19_0; p_t_20_0h ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_reshm ~ Mp_res; # Dichotomies for triple-double decomposition # Dichotomy for the error bound epsilon $ xhm; interval-2.1.0/src/crlibm/gappa/asin/asinQuickR5.gappa0000644000000000000000000001447213031036767020733 0ustar 00000000000000# The polynomial to implement is: 51984188076577765969954972216329553b-116 + (x * (400377354559914758555498144461373b-108 + (x * (1238400191224977b-51 + (x * (7235452395425177b-53 + (x * (2644145021253385b-51 + (x * (2269626114756713b-50 + (x * (4108409004761789b-50 + (x * (7812107017201229b-50 + (x * (7668886762282561b-49 + (x * (7720327329412313b-48 + (x * (990526711637311b-44 + (x * (8352794841960659b-46 + (x * 2243673169183011b-43))))))))))))))))))))))) # The polynomial implemented is: 51984188076577765969954972216329553b-116 + (x * (400377354559914758555498144461373b-108 + (x * (1238400191224977b-51 + (x * (7235452395425177b-53 + (x * (2644145021253385b-51 + (x * (2269626114756713b-50 + (x * (4108409004761789b-50 + (x * (7812107017201229b-50 + (x * (7668886762282561b-49 + (x * (7720327329412313b-48 + (x * (990526711637311b-44 + (x * (8352794841960659b-46 + (x * 2243673169183011b-43))))))))))))))))))))))) # The domain is [-120145772825149b-52;60072886412803b-51] # The free variable x is a double precision number, the result p_res* is stored on a double-double number. # The code produces 37 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(6.25736902820868912122875826753443107008934020996093750000000000000000000000000000e-01); p_coeff_0m = double(1.09771341515678393197247834713042073087550408801910172083143857335585380496922880e-20); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.23375797792237640315704538807040080428123474121093750000000000000000000000000000e+00); p_coeff_1m = double(-1.59140559577392273960428308971385735880640476257478696520131222769123269245028496e-17); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(5.49960162399266483390647408668883144855499267578125000000000000000000000000000000e-01); p_coeff_3h = double(8.03296584298027416259913024987326934933662414550781250000000000000000000000000000e-01); p_coeff_4h = double(1.17423627321739276752055047836620360612869262695312500000000000000000000000000000e+00); p_coeff_5h = double(2.01583293591475243289323771023191511631011962890625000000000000000000000000000000e+00); p_coeff_6h = double(3.64900021733109003463368935626931488513946533203125000000000000000000000000000000e+00); p_coeff_7h = double(6.93854486506604661855135418591089546680450439453125000000000000000000000000000000e+00); p_coeff_8h = double(1.36226794507666699729497850057668983936309814453125000000000000000000000000000000e+01); p_coeff_9h = double(2.74281125080204652988413727143779397010803222656250000000000000000000000000000000e+01); p_coeff_10h = double(5.63049247624184658889134880155324935913085937500000000000000000000000000000000000e+01); p_coeff_11h = double(1.18700353964991606403600599151104688644409179687500000000000000000000000000000000e+02); p_coeff_12h = double(2.55076107485252919104823376983404159545898437500000000000000000000000000000000000e+02); p_t_1_0h = p_coeff_12h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_11h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_10h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_9h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_8h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_7h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_6h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_5h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0h = double(p_coeff_4h + p_t_16_0h); p_t_18_0h = double(p_t_17_0h * xh); p_t_19_0h = double(p_coeff_3h + p_t_18_0h); p_t_20_0h = double(p_t_19_0h * xh); p_t_21_0hm = p_coeff_2h + p_t_20_0h; p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = fma_rel<100>(p_t_21_0hm,xh,p_coeff_1hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = fma_rel<100>(p_t_22_0hm,xh,p_coeff_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_reshm = p_t_23_0hm; p_resh = p_t_23_0h; p_resm = p_t_23_0m; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2h; Mp_coeff_3 = p_coeff_3h; Mp_coeff_4 = p_coeff_4h; Mp_coeff_5 = p_coeff_5h; Mp_coeff_6 = p_coeff_6h; Mp_coeff_7 = p_coeff_7h; Mp_coeff_8 = p_coeff_8h; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_t_1_0 = Mp_coeff_12; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_11 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_10 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_9 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_8 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_7 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_6 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_5 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_4 + Mp_t_16_0; Mp_t_18_0 = Mp_t_17_0 * Mx; Mp_t_19_0 = Mp_coeff_3 + Mp_t_18_0; Mp_t_20_0 = Mp_t_19_0 * Mx; Mp_t_21_0 = Mp_coeff_2 + Mp_t_20_0; Mp_t_22_0 = (Mp_t_21_0 * Mx) + Mp_coeff_1; Mp_t_23_0 = (Mp_t_22_0 * Mx) + Mp_coeff_0; Mp_res = Mp_t_23_0; # Definition of the relative arithmetical error epsilon = (p_reshm - Mp_res) / Mp_res; # Implication to prove {(( x in [-120145772825149b-52,-120145772825149b-452] ) \/ ( x in [60072886412803b-451,60072886412803b-51] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0h ~ Mp_t_17_0; p_t_18_0h ~ Mp_t_18_0; p_t_19_0h ~ Mp_t_19_0; p_t_20_0h ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_reshm ~ Mp_res; # Dichotomies for triple-double decomposition # Dichotomy for the error bound epsilon $ xhm; interval-2.1.0/src/crlibm/gappa/asin/asinQuickR6.gappa0000644000000000000000000001446013031036767020731 0ustar 00000000000000# The polynomial to implement is: 224072655290838820901547103663141b-108 + (x * (52617200066848308315160320054687b-105 + (x * (1564981109275549b-51 + (x * (4992165443239819b-52 + (x * (8442373737503053b-52 + (x * (1027827836419783b-48 + (x * (132850146592389b-44 + (x * (4608740736026111b-48 + (x * (2581118930247463b-46 + (x * (5928868654976949b-46 + (x * (108504530938057b-39 + (x * (522450050528739b-40 + (x * 5043156194756227b-42))))))))))))))))))))))) # The polynomial implemented is: 224072655290838820901547103663141b-108 + (x * (52617200066848308315160320054687b-105 + (x * (1564981109275549b-51 + (x * (4992165443239819b-52 + (x * (8442373737503053b-52 + (x * (1027827836419783b-48 + (x * (132850146592389b-44 + (x * (4608740736026111b-48 + (x * (2581118930247463b-46 + (x * (5928868654976949b-46 + (x * (108504530938057b-39 + (x * (522450050528739b-40 + (x * 5043156194756227b-42))))))))))))))))))))))) # The domain is [-110485440722351b-52;55242720361239b-51] # The free variable x is a double precision number, the result p_res* is stored on a double-double number. # The code produces 37 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(6.90477178468776764397318856936180964112281799316406250000000000000000000000000000e-01); p_coeff_0m = double(3.39469506786599975391257859730058491397981612722623695477253136232320684939622879e-18); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.29711412734153253012436834978871047496795654296875000000000000000000000000000000e+00); p_coeff_1m = double(-4.95712225725049321877947559927504147795821978121980078135777603165479376912117004e-17); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(6.94991224248453054457286270917393267154693603515625000000000000000000000000000000e-01); p_coeff_3h = double(1.10848340356457941702217340207425877451896667480468750000000000000000000000000000e+00); p_coeff_4h = double(1.87458354117332537391860114439623430371284484863281250000000000000000000000000000e+00); p_coeff_5h = double(3.65157801390048675216348783578723669052124023437500000000000000000000000000000000e+00); p_coeff_6h = double(7.55165652847091450894367881119251251220703125000000000000000000000000000000000000e+00); p_coeff_7h = double(1.63735362549250531571942701702937483787536621093750000000000000000000000000000000e+01); p_coeff_8h = double(3.66799061204043113093575811944901943206787109375000000000000000000000000000000000e+01); p_coeff_9h = double(8.42542910813925374213795294053852558135986328125000000000000000000000000000000000e+01); p_coeff_10h = double(1.97368592013039233279414474964141845703125000000000000000000000000000000000000000e+02); p_coeff_11h = double(4.75165552896886765665840357542037963867187500000000000000000000000000000000000000e+02); p_coeff_12h = double(1.14668095983602756859909277409315109252929687500000000000000000000000000000000000e+03); p_t_1_0h = p_coeff_12h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_11h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_10h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_9h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_8h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_7h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_6h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_5h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0h = double(p_coeff_4h + p_t_16_0h); p_t_18_0h = double(p_t_17_0h * xh); p_t_19_0h = double(p_coeff_3h + p_t_18_0h); p_t_20_0h = double(p_t_19_0h * xh); p_t_21_0hm = p_coeff_2h + p_t_20_0h; p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = fma_rel<100>(p_t_21_0hm,xh,p_coeff_1hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = fma_rel<100>(p_t_22_0hm,xh,p_coeff_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_reshm = p_t_23_0hm; p_resh = p_t_23_0h; p_resm = p_t_23_0m; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2h; Mp_coeff_3 = p_coeff_3h; Mp_coeff_4 = p_coeff_4h; Mp_coeff_5 = p_coeff_5h; Mp_coeff_6 = p_coeff_6h; Mp_coeff_7 = p_coeff_7h; Mp_coeff_8 = p_coeff_8h; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_t_1_0 = Mp_coeff_12; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_11 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_10 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_9 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_8 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_7 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_6 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_5 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_4 + Mp_t_16_0; Mp_t_18_0 = Mp_t_17_0 * Mx; Mp_t_19_0 = Mp_coeff_3 + Mp_t_18_0; Mp_t_20_0 = Mp_t_19_0 * Mx; Mp_t_21_0 = Mp_coeff_2 + Mp_t_20_0; Mp_t_22_0 = (Mp_t_21_0 * Mx) + Mp_coeff_1; Mp_t_23_0 = (Mp_t_22_0 * Mx) + Mp_coeff_0; Mp_res = Mp_t_23_0; # Definition of the relative arithmetical error epsilon = (p_reshm - Mp_res) / Mp_res; # Implication to prove {(( x in [-110485440722351b-52,-110485440722351b-452] ) \/ ( x in [55242720361239b-451,55242720361239b-51] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0h ~ Mp_t_17_0; p_t_18_0h ~ Mp_t_18_0; p_t_19_0h ~ Mp_t_19_0; p_t_20_0h ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_reshm ~ Mp_res; # Dichotomies for triple-double decomposition # Dichotomy for the error bound epsilon $ xhm; interval-2.1.0/src/crlibm/gappa/asin/asinQuickR7.gappa0000644000000000000000000001447313031036767020736 0ustar 00000000000000# The polynomial to implement is: 31303540725427994415236316926498277b-115 + (x * (55627180908427023057028403875349b-105 + (x * (3973482098975897b-52 + (x * (7048617650465021b-52 + (x * (6914118691349309b-51 + (x * (3859522469193581b-49 + (x * (4591567794769115b-48 + (x * (357643827686125b-43 + (x * (3685198568657065b-45 + (x * (4866801803033539b-44 + (x * (1638677454183417b-41 + (x * (4544581697576865b-41 + (x * 6325975157511843b-40))))))))))))))))))))))) # The polynomial implemented is: 31303540725427994415236316926498277b-115 + (x * (55627180908427023057028403875349b-105 + (x * (3973482098975897b-52 + (x * (7048617650465021b-52 + (x * (6914118691349309b-51 + (x * (3859522469193581b-49 + (x * (4591567794769115b-48 + (x * (357643827686125b-43 + (x * (3685198568657065b-45 + (x * (4866801803033539b-44 + (x * (1638677454183417b-41 + (x * (4544581697576865b-41 + (x * 6325975157511843b-40))))))))))))))))))))))) # The domain is [-205674681606191b-53;205674681606835b-53] # The free variable x is a double precision number, the result p_res* is stored on a double-double number. # The code produces 37 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(7.53605330605588874526290510402759537100791931152343750000000000000000000000000000e-01); p_coeff_0m = double(-6.81399026788433814240085924387948818667013384621768622671778015131849315366707742e-20); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.37131588394733516800272354885237291455268859863281250000000000000000000000000000e+00); p_coeff_1m = double(5.75522635997281408409017033924079017806689197384387157718776961701223626732826233e-17); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(8.82290262843787198576706032326910644769668579101562500000000000000000000000000000e-01); p_coeff_3h = double(1.56510752146510800919543271447764709591865539550781250000000000000000000000000000e+00); p_coeff_4h = double(3.07048550645086359978108703217003494501113891601562500000000000000000000000000000e+00); p_coeff_5h = double(6.85588913497096008597964100772514939308166503906250000000000000000000000000000000e+00); p_coeff_6h = double(1.63125257116160859993669873801991343498229980468750000000000000000000000000000000e+01); p_coeff_7h = double(4.06593958002900990322814323008060455322265625000000000000000000000000000000000000e+01); p_coeff_8h = double(1.04739642911711854367240448482334613800048828125000000000000000000000000000000000e+02); p_coeff_9h = double(2.76645653402371124229830456897616386413574218750000000000000000000000000000000000e+02); p_coeff_10h = double(7.45184231247284060373203828930854797363281250000000000000000000000000000000000000e+02); p_coeff_11h = double(2.06663648786018939063069410622119903564453125000000000000000000000000000000000000e+03); p_coeff_12h = double(5.75344088930418638483388349413871765136718750000000000000000000000000000000000000e+03); p_t_1_0h = p_coeff_12h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_11h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_10h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_9h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_8h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_7h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_6h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_5h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0h = double(p_coeff_4h + p_t_16_0h); p_t_18_0h = double(p_t_17_0h * xh); p_t_19_0h = double(p_coeff_3h + p_t_18_0h); p_t_20_0h = double(p_t_19_0h * xh); p_t_21_0hm = p_coeff_2h + p_t_20_0h; p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = fma_rel<100>(p_t_21_0hm,xh,p_coeff_1hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = fma_rel<100>(p_t_22_0hm,xh,p_coeff_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_reshm = p_t_23_0hm; p_resh = p_t_23_0h; p_resm = p_t_23_0m; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2h; Mp_coeff_3 = p_coeff_3h; Mp_coeff_4 = p_coeff_4h; Mp_coeff_5 = p_coeff_5h; Mp_coeff_6 = p_coeff_6h; Mp_coeff_7 = p_coeff_7h; Mp_coeff_8 = p_coeff_8h; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_t_1_0 = Mp_coeff_12; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_11 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_10 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_9 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_8 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_7 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_6 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_5 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_4 + Mp_t_16_0; Mp_t_18_0 = Mp_t_17_0 * Mx; Mp_t_19_0 = Mp_coeff_3 + Mp_t_18_0; Mp_t_20_0 = Mp_t_19_0 * Mx; Mp_t_21_0 = Mp_coeff_2 + Mp_t_20_0; Mp_t_22_0 = (Mp_t_21_0 * Mx) + Mp_coeff_1; Mp_t_23_0 = (Mp_t_22_0 * Mx) + Mp_coeff_0; Mp_res = Mp_t_23_0; # Definition of the relative arithmetical error epsilon = (p_reshm - Mp_res) / Mp_res; # Implication to prove {(( x in [-205674681606191b-53,-205674681606191b-453] ) \/ ( x in [205674681606835b-453,205674681606835b-53] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0h ~ Mp_t_17_0; p_t_18_0h ~ Mp_t_18_0; p_t_19_0h ~ Mp_t_19_0; p_t_20_0h ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_reshm ~ Mp_res; # Dichotomies for triple-double decomposition # Dichotomy for the error bound epsilon $ xhm; interval-2.1.0/src/crlibm/gappa/asin/asinQuickR8.gappa0000644000000000000000000001446313031036767020736 0ustar 00000000000000# The polynomial to implement is: 33903941391411436062548621898578847b-115 + (x * (118439326888551330576771230425869b-106 + (x * (1276087168563161b-50 + (x * (2565255893858397b-50 + (x * (5885467043083027b-50 + (x * (7627068437138929b-49 + (x * (5277247200778677b-47 + (x * (3823843648895481b-45 + (x * (5727900287195667b-44 + (x * (549830323588319b-39 + (x * (6890204176375445b-41 + (x * (5570398459840501b-39 + (x * 1124915619397507b-35))))))))))))))))))))))) # The polynomial implemented is: 33903941391411436062548621898578847b-115 + (x * (118439326888551330576771230425869b-106 + (x * (1276087168563161b-50 + (x * (2565255893858397b-50 + (x * (5885467043083027b-50 + (x * (7627068437138929b-49 + (x * (5277247200778677b-47 + (x * (3823843648895481b-45 + (x * (5727900287195667b-44 + (x * (549830323588319b-39 + (x * (6890204176375445b-41 + (x * (5570398459840501b-39 + (x * 1124915619397507b-35))))))))))))))))))))))) # The domain is [-96586942132361b-52;6036683883289b-48] # The free variable x is a double precision number, the result p_res* is stored on a double-double number. # The code produces 37 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(8.16207699480864135033186812506755813956260681152343750000000000000000000000000000e-01); p_coeff_0m = double(1.13998759014226814082709277093003596330685011160153518976201336698750310461036861e-20); p_coeff_0hm = p_coeff_0h + p_coeff_0m; p_coeff_1h = double(1.45987741598546749699494284868706017732620239257812500000000000000000000000000000e+00); p_coeff_1m = double(1.00585284375539824516783136958955684505754068277117579954804682529356796294450760e-16); p_coeff_1hm = p_coeff_1h + p_coeff_1m; p_coeff_2h = double(1.13339308477403566399743795045651495456695556640625000000000000000000000000000000e+00); p_coeff_3h = double(2.27840492593358323603069948148913681507110595703125000000000000000000000000000000e+00); p_coeff_4h = double(5.22734481752265178755578745040111243724822998046875000000000000000000000000000000e+00); p_coeff_5h = double(1.35483951828855158083797505241818726062774658203125000000000000000000000000000000e+01); p_coeff_6h = double(3.74970966332361186346133763436228036880493164062500000000000000000000000000000000e+01); p_coeff_7h = double(1.08680173096203162685924326069653034210205078125000000000000000000000000000000000e+02); p_coeff_8h = double(3.25593435218005822662235004827380180358886718750000000000000000000000000000000000e+02); p_coeff_9h = double(1.00013553235534163832198828458786010742187500000000000000000000000000000000000000e+03); p_coeff_10h = double(3.13330209627358499346883036196231842041015625000000000000000000000000000000000000e+03); p_coeff_11h = double(1.01324957719780304614687338471412658691406250000000000000000000000000000000000000e+04); p_coeff_12h = double(3.27393534650766232516616582870483398437500000000000000000000000000000000000000000e+04); p_t_1_0h = p_coeff_12h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_11h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_10h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_9h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_8h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_7h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_6h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_5h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0h = double(p_coeff_4h + p_t_16_0h); p_t_18_0h = double(p_t_17_0h * xh); p_t_19_0h = double(p_coeff_3h + p_t_18_0h); p_t_20_0h = double(p_t_19_0h * xh); p_t_21_0hm = p_coeff_2h + p_t_20_0h; p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = fma_rel<100>(p_t_21_0hm,xh,p_coeff_1hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = fma_rel<100>(p_t_22_0hm,xh,p_coeff_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_reshm = p_t_23_0hm; p_resh = p_t_23_0h; p_resm = p_t_23_0m; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0hm; Mp_coeff_1 = p_coeff_1hm; Mp_coeff_2 = p_coeff_2h; Mp_coeff_3 = p_coeff_3h; Mp_coeff_4 = p_coeff_4h; Mp_coeff_5 = p_coeff_5h; Mp_coeff_6 = p_coeff_6h; Mp_coeff_7 = p_coeff_7h; Mp_coeff_8 = p_coeff_8h; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_coeff_12 = p_coeff_12h; Mp_t_1_0 = Mp_coeff_12; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_11 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_10 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_9 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_8 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_7 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_6 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_5 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_4 + Mp_t_16_0; Mp_t_18_0 = Mp_t_17_0 * Mx; Mp_t_19_0 = Mp_coeff_3 + Mp_t_18_0; Mp_t_20_0 = Mp_t_19_0 * Mx; Mp_t_21_0 = Mp_coeff_2 + Mp_t_20_0; Mp_t_22_0 = (Mp_t_21_0 * Mx) + Mp_coeff_1; Mp_t_23_0 = (Mp_t_22_0 * Mx) + Mp_coeff_0; Mp_res = Mp_t_23_0; # Definition of the relative arithmetical error epsilon = (p_reshm - Mp_res) / Mp_res; # Implication to prove {(( x in [-96586942132361b-52,-96586942132361b-452] ) \/ ( x in [6036683883289b-448,6036683883289b-48] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0h ~ Mp_t_17_0; p_t_18_0h ~ Mp_t_18_0; p_t_19_0h ~ Mp_t_19_0; p_t_20_0h ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_reshm ~ Mp_res; # Dichotomies for triple-double decomposition # Dichotomy for the error bound epsilon $ xhm; interval-2.1.0/src/crlibm/gappa/asin/asinQuickR9.gappa0000644000000000000000000001340313031036767020730 0ustar 00000000000000# The polynomial to implement is: 2275941405803339b-51 + (x * ((-6362552512264725b-56) + (x * (3031517174156445b-57 + (x * ((-1916916249275531b-58) + (x * (2775872004195495b-60 + (x * ((-8705693150762623b-63) + (x * (3596618703231213b-63 + (x * ((-3084299124302975b-64) + (x * (1359599812531581b-64 + (x * ((-4899514141103273b-67) + (x * (566891145413529b-65 + (x * (-8316266913880567b-70)))))))))))))))))))))) # The polynomial implemented is: 2275941405803339b-51 + (x * ((-6362552512264725b-56) + (x * (3031517174156445b-57 + (x * ((-1916916249275531b-58) + (x * (2775872004195495b-60 + (x * ((-8705693150762623b-63) + (x * (3596618703231213b-63 + (x * ((-3084299124302975b-64) + (x * (1359599812531581b-64 + (x * ((-4899514141103273b-67) + (x * (566891145413529b-65 + (x * (-8316266913880567b-70)))))))))))))))))))))) # The domain is [-140737488356209b-50;1125899906835577b-53] # The free variable x is a double precision number, the result p_res* is stored on a double-double number. # The code produces 36 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code p_coeff_0h = double(1.01072102056824553173441927356179803609848022460937500000000000000000000000000000e+00); p_coeff_1h = double(-8.82981536812866424357437722392205614596605300903320312500000000000000000000000000e-02); p_coeff_2h = double(2.10353760393442237863759203264635289087891578674316406250000000000000000000000000e-02); p_coeff_3h = double(-6.65063923819934552095212154654291225597262382507324218750000000000000000000000000e-03); p_coeff_4h = double(2.40768516599235756631136595729003602173179388046264648437500000000000000000000000e-03); p_coeff_5h = double(-9.43873142704901193882072174545783127541653811931610107421875000000000000000000000e-04); p_coeff_6h = double(3.89946181164527888064752492169873221428133547306060791015625000000000000000000000e-04); p_coeff_7h = double(-1.67200190558221219085804909454395783541258424520492553710937500000000000000000000e-04); p_coeff_8h = double(7.37040535228812338126858083597880977322347462177276611328125000000000000000000000e-05); p_coeff_9h = double(-3.32003992244226181431050737291599261880037374794483184814453125000000000000000000e-05); p_coeff_10h = double(1.53656152855036036170705004977321550541091710329055786132812500000000000000000000e-05); p_coeff_11h = double(-7.04415207421768136802344914548790200115035986527800559997558593750000000000000000e-06); p_t_1_0h = p_coeff_11h; p_t_2_0h = double(p_t_1_0h * xh); p_t_3_0h = double(p_coeff_10h + p_t_2_0h); p_t_4_0h = double(p_t_3_0h * xh); p_t_5_0h = double(p_coeff_9h + p_t_4_0h); p_t_6_0h = double(p_t_5_0h * xh); p_t_7_0h = double(p_coeff_8h + p_t_6_0h); p_t_8_0h = double(p_t_7_0h * xh); p_t_9_0h = double(p_coeff_7h + p_t_8_0h); p_t_10_0h = double(p_t_9_0h * xh); p_t_11_0h = double(p_coeff_6h + p_t_10_0h); p_t_12_0h = double(p_t_11_0h * xh); p_t_13_0h = double(p_coeff_5h + p_t_12_0h); p_t_14_0h = double(p_t_13_0h * xh); p_t_15_0h = double(p_coeff_4h + p_t_14_0h); p_t_16_0h = double(p_t_15_0h * xh); p_t_17_0h = double(p_coeff_3h + p_t_16_0h); p_t_18_0h = double(p_t_17_0h * xh); p_t_19_0h = double(p_coeff_2h + p_t_18_0h); p_t_20_0h = double(p_t_19_0h * xh); p_t_21_0hm = p_coeff_1h + p_t_20_0h; p_t_21_0h = double(p_t_21_0hm); p_t_21_0m = p_t_21_0hm - p_t_21_0h; p_t_22_0hm = mul_rel<102>(xh,p_t_21_0hm); p_t_22_0h = double(p_t_22_0hm); p_t_22_0m = p_t_22_0hm - p_t_22_0h; p_t_23_0hm = add_rel<102>(p_coeff_0h,p_t_22_0hm); p_t_23_0h = double(p_t_23_0hm); p_t_23_0m = p_t_23_0hm - p_t_23_0h; p_reshm = p_t_23_0hm; p_resh = p_t_23_0h; p_resm = p_t_23_0m; # Mathematical equivalents Mx = x; Mp_coeff_0 = p_coeff_0h; Mp_coeff_1 = p_coeff_1h; Mp_coeff_2 = p_coeff_2h; Mp_coeff_3 = p_coeff_3h; Mp_coeff_4 = p_coeff_4h; Mp_coeff_5 = p_coeff_5h; Mp_coeff_6 = p_coeff_6h; Mp_coeff_7 = p_coeff_7h; Mp_coeff_8 = p_coeff_8h; Mp_coeff_9 = p_coeff_9h; Mp_coeff_10 = p_coeff_10h; Mp_coeff_11 = p_coeff_11h; Mp_t_1_0 = Mp_coeff_11; Mp_t_2_0 = Mp_t_1_0 * Mx; Mp_t_3_0 = Mp_coeff_10 + Mp_t_2_0; Mp_t_4_0 = Mp_t_3_0 * Mx; Mp_t_5_0 = Mp_coeff_9 + Mp_t_4_0; Mp_t_6_0 = Mp_t_5_0 * Mx; Mp_t_7_0 = Mp_coeff_8 + Mp_t_6_0; Mp_t_8_0 = Mp_t_7_0 * Mx; Mp_t_9_0 = Mp_coeff_7 + Mp_t_8_0; Mp_t_10_0 = Mp_t_9_0 * Mx; Mp_t_11_0 = Mp_coeff_6 + Mp_t_10_0; Mp_t_12_0 = Mp_t_11_0 * Mx; Mp_t_13_0 = Mp_coeff_5 + Mp_t_12_0; Mp_t_14_0 = Mp_t_13_0 * Mx; Mp_t_15_0 = Mp_coeff_4 + Mp_t_14_0; Mp_t_16_0 = Mp_t_15_0 * Mx; Mp_t_17_0 = Mp_coeff_3 + Mp_t_16_0; Mp_t_18_0 = Mp_t_17_0 * Mx; Mp_t_19_0 = Mp_coeff_2 + Mp_t_18_0; Mp_t_20_0 = Mp_t_19_0 * Mx; Mp_t_21_0 = Mp_coeff_1 + Mp_t_20_0; Mp_t_22_0 = Mx * Mp_t_21_0; Mp_t_23_0 = Mp_coeff_0 + Mp_t_22_0; Mp_res = Mp_t_23_0; # Definition of the relative arithmetical error epsilon = (p_reshm - Mp_res) / Mp_res; # Implication to prove {(( x in [-140737488356209b-50,-140737488356209b-450] ) \/ ( x in [1125899906835577b-453,1125899906835577b-53] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition p_t_21_0h ~ p_t_21_0hm; p_t_22_0h ~ p_t_22_0hm; p_t_23_0h ~ p_t_23_0hm; # Meta-Hints for Horner scheme p_t_1_0h ~ Mp_t_1_0; p_t_2_0h ~ Mp_t_2_0; p_t_3_0h ~ Mp_t_3_0; p_t_4_0h ~ Mp_t_4_0; p_t_5_0h ~ Mp_t_5_0; p_t_6_0h ~ Mp_t_6_0; p_t_7_0h ~ Mp_t_7_0; p_t_8_0h ~ Mp_t_8_0; p_t_9_0h ~ Mp_t_9_0; p_t_10_0h ~ Mp_t_10_0; p_t_11_0h ~ Mp_t_11_0; p_t_12_0h ~ Mp_t_12_0; p_t_13_0h ~ Mp_t_13_0; p_t_14_0h ~ Mp_t_14_0; p_t_15_0h ~ Mp_t_15_0; p_t_16_0h ~ Mp_t_16_0; p_t_17_0h ~ Mp_t_17_0; p_t_18_0h ~ Mp_t_18_0; p_t_19_0h ~ Mp_t_19_0; p_t_20_0h ~ Mp_t_20_0; p_t_21_0hm ~ Mp_t_21_0; p_t_22_0hm ~ Mp_t_22_0; p_t_23_0hm ~ Mp_t_23_0; p_reshm ~ Mp_res; # Dichotomies for triple-double decomposition # Dichotomy for the error bound epsilon $ xhm; interval-2.1.0/src/crlibm/gappa/exp-td/exp-td-accurate1.gappa0000644000000000000000000000640213031036767022105 0ustar 00000000000000# Gappa proof for the relative error of a polynomial approximation of exp(rh)-1 # abs(rh) \leq 2^(-12) # Rounding operators and sequences definition @double = float; @Add22 = add_rel<102>; @Mul22 = mul_rel<102>; @Mul23 = mul_rel<149>; # Instantiating of constants accPolyC7 = double(_accPolyC7); accPolyC6 = double(_accPolyC6); accPolyC5 = double(_accPolyC5); accPolyC4h = double(_accPolyC4h); accPolyC4l = double(_accPolyC4l); accPolyC3h = double(_accPolyC3h); accPolyC3l = double(_accPolyC3l); AccPolyC4hl = accPolyC4h + accPolyC4l; AccPolyC3hl = accPolyC3h + accPolyC3l; #Translation of the C code highPoly double= accPolyC5 + rh * (accPolyC6 + rh * accPolyC7); T1hl = rh * highPoly; T2hl = Add22(AccPolyC4hl,T1hl); T3hl = Mul22(rh,T2hl); T4hl = Add22(AccPolyC3hl,T3hl); RhSquarehl = rh * rh; RhCubehml = Mul23(rh,RhSquarehl); RhSquareHalfhl = 0.5 * RhSquarehl; LowPolyhml = rh + RhSquareHalfhl; HighPolyMulthml = mul_rel<148>(T4hl,RhCubehml); Phml = add_rel<145>(LowPolyhml,HighPolyMulthml); #Mathematical definitions corresponding to the code MHighPoly = accPolyC5 + rh * (accPolyC6 + rh * accPolyC7); MT1 = rh * MHighPoly; MT2 = AccPolyC4hl + MT1; MT3 = rh * MT2; MT4 = AccPolyC3hl + MT3; MRhSquare = rh * rh; MRhCube = rh * MRhSquare; MRhSquareHalf = 0.5 * MRhSquare; MLowPoly = rh + MRhSquareHalf; MHighPolyMult = MT4 * MRhCube; MP = MLowPoly + MHighPolyMult; #Definition of the errors epsilonApprox = (MP - MExpM1) / MExpM1; epsilonApproxRh = (Phml - MExpM1) / MExpM1; epsilon1 = (highPoly - MHighPoly) / MHighPoly; epsilon2 = (T1hl - MT1) / MT1; epsilon3 = (T2hl - MT2) / MT2; epsilon4 = (T3hl - MT3) / MT3; epsilon5 = (T4hl - MT4) / MT4; epsilon6 = (RhSquarehl - MRhSquare) / MRhSquare; epsilon7 = (RhCubehml - MRhCube) / MRhCube; epsilon8 = (RhSquareHalfhl - MRhSquareHalf) / MRhSquareHalf; epsilon9 = (LowPolyhml - MLowPoly) / MLowPoly; epsilon10 = (HighPolyMulthml - MHighPolyMult) / MHighPolyMult; epsilon11 = (Phml - MP) / MP; epsilon12 = ((LowPolyhml + HighPolyMulthml) - MP)/MP; epsilon13 = (Phml - (LowPolyhml + HighPolyMulthml)) / (LowPolyhml + HighPolyMulthml); # Additional mathematical definitions (values divided by rh) MRhHalf = rh * 0.5; #Logical implication to prove { ( rh in [-_rhmax,-1b-800] /\ epsilonApprox in [-_epsilonApproxAccurate, _epsilonApproxAccurate] -> epsilonApproxRh in [-1b-112,1b-112] /\ Phml in [-1b-12,-1b-820] ) /\ ( rh in [1b-800,_rhmax] /\ epsilonApprox in [-_epsilonApproxAccurate, _epsilonApproxAccurate] -> epsilonApproxRh in [-1b-112,1b-112] /\ Phml in [1b-820,1b-12] ) /\ ( rh in [-1b-30,-1b-800] /\ epsilonApprox in [-_epsilonApproxSpecial, _epsilonApproxSpecial] -> epsilonApproxRh in [-1b-144,1b-144] /\ Phml in [-1b-29,-1b-820] ) /\ ( rh in [1b-800,1b-30] /\ epsilonApprox in [-_epsilonApproxSpecial, _epsilonApproxSpecial] -> epsilonApproxRh in [-1b-144,1b-144] /\ Phml in [-1b-820,1b-29] ) } #Hints for composing the errors in the different levels epsilonApproxRh -> epsilon11 + epsilonApprox + epsilon11 * epsilonApprox; epsilon11 -> epsilon12 + epsilon13 + epsilon12 * epsilon13; epsilon12 -> (epsilon9 + epsilon9 * MRhHalf + epsilon10 * MRhSquare * MT4) / (1 + MRhHalf + MRhSquare * MT4); #Hints for convincing Gappa that some terms do not cross zero MLowPoly -> rh * (1 + MRhHalf); interval-2.1.0/src/crlibm/gappa/exp-td/exp-td-accurate2.gappa0000644000000000000000000000644213031036767022112 0ustar 00000000000000# Gappa proof for the relative error of the approximation of (exp(rh)-1)*(exp(rm)-1)*(exp(rl)-1) # abs(rh) \leq 2^(-12) using the proof for the approximation of exp(rh)-1 # Rounding operators and sequences definition @double = float; @Add22 = add_rel<102>; @Mul22 = mul_rel<102>; @Mul23 = mul_rel<149>; #Different approximations of Rhml and definition of pl Rhml = rh + rm + rl; Rml = rm + rl; pl = double(Phml - Phm); #Translation of the C code RmlMultPhl = Mul22(Rml,Phm); Qhl = Add22(Rml,RmlMultPhl); FullPolyhml = add_rel<142>(Qhl,Phml); #Additional mathematical definitions MExpRmM1PExpRlM1 = MExpRmM1 + MExpRlM1; MExpRmM1MultExpRlM1 = MExpRmM1 * MExpRlM1; #Mathematical definitions corresponding to the code MExpRmM1PExpRlM1MultExpRhM1 = MExpRmM1PExpRlM1 * MExpRhM1; MExpLowerM1 = MExpRmM1PExpRlM1 + MExpRmM1PExpRlM1MultExpRhM1; MExpRhmlM1 = (MExpLowerM1 + MExpRhM1) + MExpRmM1MultExpRlM1; #Definition of the errors epsilonApproxRh = (Phml - MExpRhM1) / MExpRhM1; epsilonApproxRm = (rm - MExpRmM1) / MExpRmM1; epsilonApproxRl = (rl - MExpRlM1) / MExpRlM1; epsilonApproxPhm = (Phm - Phml) / Phml; deltaApproxExpRhml = FullPolyhml - MExpRhmlM1; delta1 = Phml - MExpRhM1; delta2 = FullPolyhml - (Qhl + Phml); delta3 = Qhl - MExpLowerM1; delta4 = Qhl - (Rml + RmlMultPhl); delta5 = Rml - MExpRmM1PExpRlM1; delta6 = RmlMultPhl - MExpRmM1PExpRlM1MultExpRhM1; delta7 = RmlMultPhl - (Rml * Phm); delta8 = (Rml * Phm) - MExpRmM1PExpRlM1MultExpRhM1; delta9 = Phm - MExpRhM1; epsilon1 = (FullPolyhml - (Qhl + Phml)) / (Qhl + Phml); epsilon2 = (Qhl - (Rml + RmlMultPhl)) / (Rml + RmlMultPhl); epsilon3 = (RmlMultPhl - (Rml * Phm)) / (Rml * Phm); #Logical implication to prove { ( epsilonApproxRh in [-1b-112,1b-112] /\ epsilonApproxRm in [-_epsilonApproxRmAccurate,_epsilonApproxRmAccurate] /\ epsilonApproxRl in [-_epsilonApproxRlAccurate,_epsilonApproxRlAccurate] /\ ( rh in [-_rhmax,-1b-800] \/ rh in [1b-800,_rhmax] ) /\ ( rm in [-_rmmax,-1b-800] \/ rm in [1b-800,_rmmax] ) /\ ( rl in [-_rlmax,-1b-800] \/ rl in [1b-800,_rlmax] ) /\ ( Phml in [-1b-12,-1b-820] \/ Phml in [1b-820,1b-12] ) /\ epsilonApproxPhm in [-1b-91,1b-91] -> deltaApproxExpRhml in [-1b-122,1b-122] /\ FullPolyhml in [-1b-11,1b-11] ) /\ ( epsilonApproxRh in [-1b-144,1b-144] /\ epsilonApproxRm in [0,0] /\ epsilonApproxRl in [0,0] /\ ( rh in [-1b-30,-1b-800] \/ rh in [1b-800,1b-30] ) /\ rm in [0,0] /\ rl in [0,0] /\ ( Phml in [-1b-29,-1b-820] \/ Phml in [1b-820,1b-29] ) /\ epsilonApproxPhm in [-1b-91,1b-91] -> deltaApproxExpRhml in [-1b-170,1b-170] /\ FullPolyhml in [-1b-28,1b-28] ) } #Hints for composing the errors in the different levels deltaApproxExpRhml -> delta1 + delta2 + delta3 - MExpRmM1MultExpRlM1; delta1 -> epsilonApproxRh * MExpRhM1; delta2 -> epsilon1 * (Qhl + Phml); delta4 -> epsilon2 * (Rml + RmlMultPhl); delta3 -> delta4 + delta5 + delta6; delta7 -> epsilon3 * (Rml * Phm); delta6 -> delta7 + delta8; delta9 -> epsilonApproxPhm * Phml + delta1; delta8 -> delta5 * MExpRhM1 + delta9 * MExpRmM1PExpRlM1 + delta5 * delta9; #Hints for computing the absolute mathematical values for the arithmetical ones MExpRhM1 -> Phml * (1 / (1 + epsilonApproxRh)); MExpRmM1 -> rm * (1 / (1 + epsilonApproxRm)); MExpRlM1 -> rl * (1 / (1 + epsilonApproxRl)); Phm -> Phml + epsilonApproxPhm * Phml; Phml - Phm -> -epsilonApproxPhm * Phml;interval-2.1.0/src/crlibm/gappa/exp-td/exp-td-accurate3.gappa0000644000000000000000000000211213031036767022101 0ustar 00000000000000# Gappa proof for the relative error of a polynomial approximation of exp(r) # abs(r) \leq 2^(-12), # integrating the final adding step, the errors made in the polynomial approximation # and the argument reduction error # # THIS IS THE SIMPLE CASE WHERE THERE IS NO GAPPING EFFECT TO PROVE # #Translation of the C code PolyAddOnehml = add_rel<138>(1,FullPolyhml); #Mathematical definitions corresponding to the code MExpRhml = 1 + MExpRhmlM1; #Definition of the errors deltaApproxExpRhml = FullPolyhml - MExpRhmlM1; epsilonArgRed = (MExpRhml - MExpR) / MExpR; epsilon = (PolyAddOnehml - MExpR) / MExpR; epsilon1 = (PolyAddOnehml - MExpRhml) / MExpRhml; #Logical implication to prove { deltaApproxExpRhml in [-1b-122,1b-122] /\ FullPolyhml in [-1b-11,1b-11] /\ epsilonArgRed in [-1b-141,1b-141] -> epsilon in [-1b-121,1b-121] } #Hints for composing the errors in the different levels epsilon -> epsilonArgRed + epsilon1 + epsilonArgRed * epsilon1; #Hints for computing the absolute mathematical values for the arithmetical ones MExpRhmlM1 -> FullPolyhml - deltaApproxExpRhml; interval-2.1.0/src/crlibm/gappa/exp-td/exp-td-accurate4.gappa0000644000000000000000000000214113031036767022104 0ustar 00000000000000# Gappa proof for the relative error of a polynomial approximation of exp(r) # abs(r) \leq 2^(-12), # integrating the final adding step, the errors made in the polynomial approximation # and the argument reduction error # # THIS IS THE DIFFICULT CASE WHERE WE MUST SHOW THE EXACTNESS OF THE LAST ADD # #Translation of the C code PolyAddOnehml = 1 + FullPolyhml; # MUST SHOW THIS EXACTNESS ON PAPER #Mathematical definitions corresponding to the code MExpRhml = 1 + MExpRhmlM1; #Definition of the errors deltaApproxExpRhml = FullPolyhml - MExpRhmlM1; epsilonArgRed = (MExpRhml - MExpR) / MExpR; epsilon = (PolyAddOnehml - MExpR) / MExpR; epsilon1 = (PolyAddOnehml - MExpRhml) / MExpRhml; #Logical implication to prove { deltaApproxExpRhml in [-1b-170,1b-170] /\ FullPolyhml in [-1b-28,1b-28] /\ epsilonArgRed in [0,0] -> epsilon in [-1b-169,1b-169] } #Hints for composing the errors in the different levels epsilon -> epsilonArgRed + epsilon1 + epsilonArgRed * epsilon1; #Hints for computing the absolute mathematical values for the arithmetical ones MExpRhmlM1 -> FullPolyhml - deltaApproxExpRhml; interval-2.1.0/src/crlibm/gappa/exp-td/exp-td-proof.sh0000755000000000000000000000053313031036767020706 0ustar 00000000000000#/bin/bash GAPPA=~/gappa/src/gappa sed -f ../maple/TEMPEXP/exp-td-accurate.sed exp-td-accurate1.gappa | $GAPPA sed -f ../maple/TEMPEXP/exp-td-accurate.sed exp-td-accurate2.gappa | $GAPPA sed -f ../maple/TEMPEXP/exp-td-accurate.sed exp-td-accurate3.gappa | $GAPPA sed -f ../maple/TEMPEXP/exp-td-accurate.sed exp-td-accurate4.gappa | $GAPPA interval-2.1.0/src/crlibm/gappa/log-de/README0000644000000000000000000000255613031036767016660 0ustar 00000000000000 There are (too) many proof files for log-de. Those with "acc" in the filename concern the accurate step (double-double-extended computation). The others concern the quick phase (double-extended computation, with Estrin polynomial evaluation). The most interesting files are the latter. There are three files: log-de-index1N-E0N.gappa covers all the table index values, except 0. log-de-index0-E1N.gappa covers the index 0 and all the exponents, except 0. log-de-index0-E0.gappa covers the case where both the index and the exponent are zero. The hints given to Gappa need to be different in the three cases. Basically, as soon as either the exponent or the index is different from zero, Gappa computes the relative error by dividing an absolute error by the max value of the function, which is sufficiently large. In these cases, Estrin evaluation is just as easy as Horner to handle. However, in the case where both index and exponent are zero (this correspond to the interval where the logarithm goes through zero) we have to compute directly the relative error of the Estrin evaluation. The same holds for log-de-acc, but without the Estrin bravery. Note that some of these files forget the case z=0. It is easy the prove by hand that the Estrin evaluation, in this case, returns logir+E*log2 (with roundings on logir, log2, the + and the *), which is accurate enough. interval-2.1.0/src/crlibm/gappa/log-de/log-de-acc-index0-E0.gappa0000644000000000000000000000711213031036767022325 0ustar 00000000000000# Usage: This files builds an error computation for one index value #only. To get a complete proof you need to run it through gappa for all #the possible values of the constants. # Running the ../maple/log-de.mpl Maple script # should create the required sed files and give the command to run. # Example sed -f ../maple/TEMPLOG/polynomials.sed -f ../maple/TEMPLOG/log-de_1.sed ../gappa/log-de-accurate.gappa | ~/gappa/src/gappa # Remove the following line when editing this file, to get back the warnings (all the current ones are harmless) #@ -Wno-hint-difference -Wno-null-denominator # Remark: asking for warnings resuires at least 512MB of memory #This is to prevent another warning which might let you think Gappa failed when it eventually succeeds. #@ -Wno-dichotomy-failure # Rounding operators and sequences definition @IEEEdouble = float; @IEEEext = float; @Add22ext = add_rel<124>; @Mul22ext = mul_rel<124>; E=0; # polynomial coefficients, computed by Maple c14 = IEEEext(_c14h); c13 = IEEEext(_c13h); c12 = IEEEext(_c12h); c11 = IEEEext(_c11h); c10 = IEEEext(_c10h); c9 = IEEEext(_c9h); c8 = IEEEext(_c8h); c7h = IEEEext(_c7h); c7l = IEEEext(_c7l); c7=c7h+c7l; c6h = IEEEext(_c6h); c6l = IEEEext(_c6l); c6=c6h+c6l; c5h = IEEEext(_c5h); c5l = IEEEext(_c5l); c5=c5h+c5l; c4h = IEEEext(_c4h); c4l = IEEEext(_c4l); c4=c4h+c4l; c3h = IEEEext(_c3h); c3l = IEEEext(_c3l); c3=c3h+c3l; c2h = IEEEext(_c2h); c2l = IEEEext(_c2l); c2=c2h+c2l; c1h = IEEEext(_c1h); c1l = IEEEext(_c1l); c1=c1h+c1l; log2h = IEEEext(_log2h); log2l = IEEEext(_log2l); log2=log2h+log2l; logirh = IEEEext(_logirh); logirl = IEEEext(_logirl); logir=logirh+logirl; # Transcription of C code t13 IEEEext= c13 + z*c14; t12 IEEEext= c12 + z*t13; t11 IEEEext= c11 + z*t12; t10 IEEEext= c10 + z*t11; t9 IEEEext= c9 + z*t10; t8 IEEEext= c8 + z*t9; #Mul12ext(&p7h, &p7l, z, t8); p7=z*t8; #Add22ext(&t7h, &t7l, p7h,p7l, c7h,c7l); t7=Add22ext(c7,p7); #FMA22ext(&t6h, &t6l, z,0, t7h,t7l, c6h,c6l); p6=Mul22ext(z,t7); t6=Add22ext(c6,p6); #FMA22ext(&t5h, &t5l, z,0, t6h,t6l, c5h,c5l); p5=Mul22ext(z,t6); t5=Add22ext(c5,p5); #FMA22ext(&t4h, &t4l, z,0, t5h,t5l, c4h,c4l); p4=Mul22ext(z,t5); t4=Add22ext(c4,p4); #FMA22ext(&t3h, &t3l, z,0, t4h,t4l, c3h,c3l); p3=Mul22ext(z,t4); t3=Add22ext(c3,p3); #FMA22ext(&t2h, &t2l, z,0, t3h,t3l, c2h,c2l); p2=Mul22ext(z,t3); t2=Add22ext(c2,p2); #FMA22ext(&t1h, &t1l, z,0, t2h,t2l, c1h,c1l); p1=Mul22ext(z,t2); t1=Add22ext(c1,p1); #FMA22ext(&t0h, &t0l, z,0, t1h,t1l, argredtable[index].logirh, argredtable[index].logirl); p0=Mul22ext(z,t1); # Addition of 0 is exact t0=p0; #Mul22ext(&eh, &el, log2h,log2l, E, 0); #Mul by 0 is exact e=log2*E; #Add22ext(prh, prl, eh,el, t0h,t0l); #Then, e is also equal to 0 so the last addition is exact again logz=e+t0; #---------- What this code is supposed to approximate # Exact mathematical definition of the log Mlogz = Log1pz; PolyLog1pz = z*(c1+z*(c2+z*(c3+z*(c4+z*(c5+z*(c6+z*(c7+z*(c8+z*(c9+z*(c10+z*(c11+z*(c12+z*(c13+z*c14))))))))))))); epsilon = (logz - Mlogz)/Mlogz; epspoly=(p0-Log1pz)/Log1pz; epsolyRound=(p0-PolyLog1pz)/PolyLog1pz; epspolyApprox=(PolyLog1pz - Log1pz)/Log1pz; { |z| in [1b-200, _zabsmax] /\ log2 - Mlog2 in [-1b-129, 1b-129] /\ (PolyLog1pz - Log1pz)/Log1pz in [-_epsilonApproxAccurate, _epsilonApproxAccurate] /\ (PolyLog1pz - Log1pz) in [-_deltaApproxAccurate, _deltaApproxAccurate] -> epsilon in [-1b-119,1b-119] } epspoly -> epsolyRound + epspolyApprox + epsolyRound*epspolyApprox; Log1pz -> PolyLog1pz - (PolyLog1pz-Log1pz); epsilon-> epspoly; interval-2.1.0/src/crlibm/gappa/log-de/log-de-acc-index0-E1N.gappa0000644000000000000000000001020113031036767022435 0ustar 00000000000000# Usage: This files builds an error computation for one index value #only. To get a complete proof you need to run it through gappa for all #the possible values of the constants. # Running the ../maple/log-de.mpl Maple script # should create the required sed files and give the command to run. # Example sed -f ../maple/TEMPLOG/polynomials.sed -f ../maple/TEMPLOG/log-de_1.sed ../gappa/log-de-accurate.gappa | ~/gappa/src/gappa # Remove the following line when editing this file, to get back the warnings (all the current ones are harmless) #@ -Wno-hint-difference -Wno-null-denominator # Remark: asking for warnings resuires at least 512MB of memory #This is to prevent another warning which might let you think Gappa failed when it eventually succeeds. #@ -Wno-dichotomy-failure # Rounding operators and sequences definition @IEEEdouble = float; @IEEEext = float; @Add22ext = add_rel<124>; @Mul22ext = mul_rel<124>; # This is to tell Gappa that E is an integer. E=int(dummyE); # polynomial coefficients, computed by Maple c14 = IEEEext(_c14h); c13 = IEEEext(_c13h); c12 = IEEEext(_c12h); c11 = IEEEext(_c11h); c10 = IEEEext(_c10h); c9 = IEEEext(_c9h); c8 = IEEEext(_c8h); c7h = IEEEext(_c7h); c7l = IEEEext(_c7l); c7=c7h+c7l; c6h = IEEEext(_c6h); c6l = IEEEext(_c6l); c6=c6h+c6l; c5h = IEEEext(_c5h); c5l = IEEEext(_c5l); c5=c5h+c5l; c4h = IEEEext(_c4h); c4l = IEEEext(_c4l); c4=c4h+c4l; c3h = IEEEext(_c3h); c3l = IEEEext(_c3l); c3=c3h+c3l; c2h = IEEEext(_c2h); c2l = IEEEext(_c2l); c2=c2h+c2l; c1h = IEEEext(_c1h); c1l = IEEEext(_c1l); c1=c1h+c1l; log2h = IEEEext(_log2h); log2l = IEEEext(_log2l); log2=log2h+log2l; logirh = IEEEext(_logirh); logirl = IEEEext(_logirl); logir=logirh+logirl; # Transcription of C code t13 IEEEext= c13 + z*c14; t12 IEEEext= c12 + z*t13; t11 IEEEext= c11 + z*t12; t10 IEEEext= c10 + z*t11; t9 IEEEext= c9 + z*t10; t8 IEEEext= c8 + z*t9; #Mul12ext(&p7h, &p7l, z, t8); p7=z*t8; #Add22ext(&t7h, &t7l, p7h,p7l, c7h,c7l); t7=Add22ext(c7,p7); #FMA22ext(&t6h, &t6l, z,0, t7h,t7l, c6h,c6l); p6=Mul22ext(z,t7); t6=Add22ext(c6,p6); #FMA22ext(&t5h, &t5l, z,0, t6h,t6l, c5h,c5l); p5=Mul22ext(z,t6); t5=Add22ext(c5,p5); #FMA22ext(&t4h, &t4l, z,0, t5h,t5l, c4h,c4l); p4=Mul22ext(z,t5); t4=Add22ext(c4,p4); #FMA22ext(&t3h, &t3l, z,0, t4h,t4l, c3h,c3l); p3=Mul22ext(z,t4); t3=Add22ext(c3,p3); #FMA22ext(&t2h, &t2l, z,0, t3h,t3l, c2h,c2l); p2=Mul22ext(z,t3); t2=Add22ext(c2,p2); #FMA22ext(&t1h, &t1l, z,0, t2h,t2l, c1h,c1l); p1=Mul22ext(z,t2); t1=Add22ext(c1,p1); #FMA22ext(&t0h, &t0l, z,0, t1h,t1l, argredtable[index].logirh, argredtable[index].logirl); p0=Mul22ext(z,t1); # Addition of 0 is exact t0=logir+p0; #Mul22ext(&eh, &el, log2h,log2l, E, 0); e=Mul22ext(log2,E); #Add22ext(prh, prl, eh,el, t0h,t0l); logz=Add22ext(e,t0); #---------- What this code is supposed to approximate # Exact mathematical definition of the log Mlogz = E*Mlog2 + (Mlogir + Log1pz); PolyLog1pz = z*(c1+z*(c2+z*(c3+z*(c4+z*(c5+z*(c6+z*(c7+z*(c8+z*(c9+z*(c10+z*(c11+z*(c12+z*(c13+z*c14))))))))))))); epsilon = (logz - Mlogz)/Mlogz; # Auxiliary epsilons Alogz = e + (logir+p0); # exact, before approximating by the Add22 eps1 = (Alogz - Mlogz)/Mlogz; eps2 = (logz - Alogz)/Alogz; epspoly=(p0-Log1pz)/Log1pz; epsolyRound=(p0-PolyLog1pz)/PolyLog1pz; epspolyApprox=(PolyLog1pz - Log1pz)/Log1pz; { |E| in [1,1024] /\ |z| in [1b-200, _zabsmax] /\ log2 - Mlog2 in [-1b-129, 1b-129] /\ logir - Mlogir in [-1b-129, 1b-129] /\ (PolyLog1pz - Log1pz)/Log1pz in [-_epsilonApproxAccurate, _epsilonApproxAccurate] /\ (PolyLog1pz - Log1pz) in [-_deltaApproxAccurate, _deltaApproxAccurate] -> epsilon in [-1b-119,1b-119] } epspoly -> epsolyRound + epspolyApprox + epsolyRound*epspolyApprox; Log1pz -> PolyLog1pz - (PolyLog1pz-Log1pz); #(Alogz2-Mlogz)/Mlogz -> ( (e + (logir +p0)) - (E*Mlog2 + (Mlogir + Log1pz)) ) / Mlogz; (Alogz-Mlogz)/Mlogz -> ( (e - Mlog2*E) + (logir-Mlogir) + Log1pz*((p0 - Log1pz)/Log1pz) ) / Mlogz; Mlog2 -> log2 - (log2-Mlog2); Mlogir -> logir - (logir - Mlogir); e-E*Mlog2 -> (e-E*log2) + (E*(log2-Mlog2)) ; epsilon-> eps1 + eps2 + eps1*eps2; epsilon $ E; interval-2.1.0/src/crlibm/gappa/log-de/log-de-acc-index1N-E0.gappa0000644000000000000000000001036313031036767022446 0ustar 00000000000000# This file works for the case E=0 and logir!=0 # sed -f ../maple/TEMPLOG/polynomials.sed -f ../maple/TEMPLOG/log-de_1.sed ../gappa/log-de-acc-logirN-E0.gappa | ~/gappa/src/gappa # Usage: This files builds an error computation for one index value #only. To get a complete proof you need to run it through gappa for all #the possible values of the constants. # Running the ../maple/log-de.mpl Maple script # should create the required sed files and give the command to run. # Example sed -f ../maple/TEMPLOG/polynomials.sed -f ../maple/TEMPLOG/log-de_1.sed ../gappa/log-de-accurate.gappa | ~/gappa/src/gappa # Remove the following line when editing this file, to get back the warnings (all the current ones are harmless) #@ -Wno-hint-difference -Wno-null-denominator # Remark: asking for warnings resuires at least 512MB of memory #This is to prevent another warning which might let you think Gappa failed when it eventually succeeds. #@ -Wno-dichotomy-failure # Rounding operators and sequences definition @IEEEdouble = float; @IEEEext = float; @Add22ext = add_rel<124>; @Mul22ext = mul_rel<124>; E=0; # polynomial coefficients, computed by Maple c14 = IEEEext(_c14h); c13 = IEEEext(_c13h); c12 = IEEEext(_c12h); c11 = IEEEext(_c11h); c10 = IEEEext(_c10h); c9 = IEEEext(_c9h); c8 = IEEEext(_c8h); c7h = IEEEext(_c7h); c7l = IEEEext(_c7l); c7=c7h+c7l; c6h = IEEEext(_c6h); c6l = IEEEext(_c6l); c6=c6h+c6l; c5h = IEEEext(_c5h); c5l = IEEEext(_c5l); c5=c5h+c5l; c4h = IEEEext(_c4h); c4l = IEEEext(_c4l); c4=c4h+c4l; c3h = IEEEext(_c3h); c3l = IEEEext(_c3l); c3=c3h+c3l; c2h = IEEEext(_c2h); c2l = IEEEext(_c2l); c2=c2h+c2l; c1h = IEEEext(_c1h); c1l = IEEEext(_c1l); c1=c1h+c1l; log2h = IEEEext(_log2h); log2l = IEEEext(_log2l); log2=log2h+log2l; logirh = IEEEext(_logirh); logirl = IEEEext(_logirl); logir=logirh+logirl; # Transcription of C code t13 IEEEext= c13 + z*c14; t12 IEEEext= c12 + z*t13; t11 IEEEext= c11 + z*t12; t10 IEEEext= c10 + z*t11; t9 IEEEext= c9 + z*t10; t8 IEEEext= c8 + z*t9; #Mul12ext(&p7h, &p7l, z, t8); p7=z*t8; #Add22ext(&t7h, &t7l, p7h,p7l, c7h,c7l); t7=Add22ext(c7,p7); #FMA22ext(&t6h, &t6l, z,0, t7h,t7l, c6h,c6l); p6=Mul22ext(z,t7); t6=Add22ext(c6,p6); #FMA22ext(&t5h, &t5l, z,0, t6h,t6l, c5h,c5l); p5=Mul22ext(z,t6); t5=Add22ext(c5,p5); #FMA22ext(&t4h, &t4l, z,0, t5h,t5l, c4h,c4l); p4=Mul22ext(z,t5); t4=Add22ext(c4,p4); #FMA22ext(&t3h, &t3l, z,0, t4h,t4l, c3h,c3l); p3=Mul22ext(z,t4); t3=Add22ext(c3,p3); #FMA22ext(&t2h, &t2l, z,0, t3h,t3l, c2h,c2l); p2=Mul22ext(z,t3); t2=Add22ext(c2,p2); #FMA22ext(&t1h, &t1l, z,0, t2h,t2l, c1h,c1l); p1=Mul22ext(z,t2); t1=Add22ext(c1,p1); #FMA22ext(&t0h, &t0l, z,0, t1h,t1l, argredtable[index].logirh, argredtable[index].logirl); p0=Mul22ext(z,t1); t0=Add22ext(logir,p0); #Mul22ext(&eh, &el, log2h,log2l, E, 0); #Mul22 is exact when multipluing by 0 e=log2*E; #Add22ext(prh, prl, eh,el, t0h,t0l); # Same for Add22 logz=e+t0; #---------- What this code is supposed to approximate # Exact mathematical definition of the log Mlogz = E*Mlog2 + (Mlogir + Log1pz); PolyLog1pz = z*(c1+z*(c2+z*(c3+z*(c4+z*(c5+z*(c6+z*(c7+z*(c8+z*(c9+z*(c10+z*(c11+z*(c12+z*(c13+z*c14))))))))))))); epsilon = (logz - Mlogz)/Mlogz; # Auxiliary epsilons Alogz = e + (logir+p0); # exact, before approximating by the Add22 eps1 = (Alogz - Mlogz)/Mlogz; eps2 = (logz - Alogz)/Alogz; epspoly=(p0-Log1pz)/Log1pz; epsolyRound=(p0-PolyLog1pz)/PolyLog1pz; epspolyApprox=(PolyLog1pz - Log1pz)/Log1pz; { |z| in [1b-200, _zabsmax] /\ log2 - Mlog2 in [-1b-129, 1b-129] /\ logir - Mlogir in [-1b-129, 1b-129] /\ (PolyLog1pz - Log1pz)/Log1pz in [-_epsilonApproxAccurate, _epsilonApproxAccurate] /\ (PolyLog1pz - Log1pz) in [-_deltaApproxAccurate, _deltaApproxAccurate] -> epsilon in [-1b-119,1b-119] } epspoly -> epsolyRound + epspolyApprox + epsolyRound*epspolyApprox; Log1pz -> PolyLog1pz - (PolyLog1pz-Log1pz); #(Alogz2-Mlogz)/Mlogz -> ( (e + (logir +p0)) - (E*Mlog2 + (Mlogir + Log1pz)) ) / Mlogz; (Alogz-Mlogz)/Mlogz -> ( (e - Mlog2*E) + (logir-Mlogir) + Log1pz*((p0 - Log1pz)/Log1pz) ) / Mlogz; Mlog2 -> log2 - (log2-Mlog2); Mlogir -> logir - (logir - Mlogir); e-E*Mlog2 -> (e-E*log2) + (E*(log2-Mlog2)) ; epsilon-> eps1 + eps2 + eps1*eps2; interval-2.1.0/src/crlibm/gappa/log-de/log-de-acc-index1N-E1N.gappa0000644000000000000000000001016313031036767022563 0ustar 00000000000000# Usage: This files builds an error computation for one index value #only. To get a complete proof you need to run it through gappa for all #the possible values of the constants. # Running the ../maple/log-de.mpl Maple script # should create the required sed files and give the command to run. # Example sed -f ../maple/TEMPLOG/polynomials.sed -f ../maple/TEMPLOG/log-de_1.sed ../gappa/log-de-accurate.gappa | ~/gappa/src/gappa # Remove the following line when editing this file, to get back the warnings (all the current ones are harmless) #@ -Wno-hint-difference -Wno-null-denominator # Remark: asking for warnings resuires at least 512MB of memory #This is to prevent another warning which might let you think Gappa failed when it eventually succeeds. #@ -Wno-dichotomy-failure # Rounding operators and sequences definition @IEEEdouble = float; @IEEEext = float; @Add22ext = add_rel<124>; @Mul22ext = mul_rel<124>; # This is to tell Gappa that E is an integer. E=int(dummyE); # polynomial coefficients, computed by Maple c14 = IEEEext(_c14h); c13 = IEEEext(_c13h); c12 = IEEEext(_c12h); c11 = IEEEext(_c11h); c10 = IEEEext(_c10h); c9 = IEEEext(_c9h); c8 = IEEEext(_c8h); c7h = IEEEext(_c7h); c7l = IEEEext(_c7l); c7=c7h+c7l; c6h = IEEEext(_c6h); c6l = IEEEext(_c6l); c6=c6h+c6l; c5h = IEEEext(_c5h); c5l = IEEEext(_c5l); c5=c5h+c5l; c4h = IEEEext(_c4h); c4l = IEEEext(_c4l); c4=c4h+c4l; c3h = IEEEext(_c3h); c3l = IEEEext(_c3l); c3=c3h+c3l; c2h = IEEEext(_c2h); c2l = IEEEext(_c2l); c2=c2h+c2l; c1h = IEEEext(_c1h); c1l = IEEEext(_c1l); c1=c1h+c1l; log2h = IEEEext(_log2h); log2l = IEEEext(_log2l); log2=log2h+log2l; logirh = IEEEext(_logirh); logirl = IEEEext(_logirl); logir=logirh+logirl; # Transcription of C code t13 IEEEext= c13 + z*c14; t12 IEEEext= c12 + z*t13; t11 IEEEext= c11 + z*t12; t10 IEEEext= c10 + z*t11; t9 IEEEext= c9 + z*t10; t8 IEEEext= c8 + z*t9; #Mul12ext(&p7h, &p7l, z, t8); p7=z*t8; #Add22ext(&t7h, &t7l, p7h,p7l, c7h,c7l); t7=Add22ext(c7,p7); #FMA22ext(&t6h, &t6l, z,0, t7h,t7l, c6h,c6l); p6=Mul22ext(z,t7); t6=Add22ext(c6,p6); #FMA22ext(&t5h, &t5l, z,0, t6h,t6l, c5h,c5l); p5=Mul22ext(z,t6); t5=Add22ext(c5,p5); #FMA22ext(&t4h, &t4l, z,0, t5h,t5l, c4h,c4l); p4=Mul22ext(z,t5); t4=Add22ext(c4,p4); #FMA22ext(&t3h, &t3l, z,0, t4h,t4l, c3h,c3l); p3=Mul22ext(z,t4); t3=Add22ext(c3,p3); #FMA22ext(&t2h, &t2l, z,0, t3h,t3l, c2h,c2l); p2=Mul22ext(z,t3); t2=Add22ext(c2,p2); #FMA22ext(&t1h, &t1l, z,0, t2h,t2l, c1h,c1l); p1=Mul22ext(z,t2); t1=Add22ext(c1,p1); #FMA22ext(&t0h, &t0l, z,0, t1h,t1l, argredtable[index].logirh, argredtable[index].logirl); p0=Mul22ext(z,t1); t0=Add22ext(logir,p0); #Mul22ext(&eh, &el, log2h,log2l, E, 0); e=Mul22ext(log2,E); #Add22ext(prh, prl, eh,el, t0h,t0l); logz=Add22ext(e,t0); #---------- What this code is supposed to approximate # Exact mathematical definition of the log Mlogz = E*Mlog2 + (Mlogir + Log1pz); PolyLog1pz = z*(c1+z*(c2+z*(c3+z*(c4+z*(c5+z*(c6+z*(c7+z*(c8+z*(c9+z*(c10+z*(c11+z*(c12+z*(c13+z*c14))))))))))))); epsilon = (logz - Mlogz)/Mlogz; # Auxiliary epsilons Alogz = e + (logir+p0); # exact, before approximating by the Add22 eps1 = (Alogz - Mlogz)/Mlogz; eps2 = (logz - Alogz)/Alogz; epspoly=(p0-Log1pz)/Log1pz; epsolyRound=(p0-PolyLog1pz)/PolyLog1pz; epspolyApprox=(PolyLog1pz - Log1pz)/Log1pz; { |E| in [1,1024] /\ |z| in [1b-200, _zabsmax] /\ log2 - Mlog2 in [-1b-129, 1b-129] /\ logir - Mlogir in [-1b-129, 1b-129] /\ (PolyLog1pz - Log1pz)/Log1pz in [-_epsilonApproxAccurate, _epsilonApproxAccurate] /\ (PolyLog1pz - Log1pz) in [-_deltaApproxAccurate, _deltaApproxAccurate] -> epsilon in [-1b-119,1b-119] } epspoly -> epsolyRound + epspolyApprox + epsolyRound*epspolyApprox; Log1pz -> PolyLog1pz - (PolyLog1pz-Log1pz); #(Alogz2-Mlogz)/Mlogz -> ( (e + (logir +p0)) - (E*Mlog2 + (Mlogir + Log1pz)) ) / Mlogz; (Alogz-Mlogz)/Mlogz -> ( (e - Mlog2*E) + (logir-Mlogir) + Log1pz*((p0 - Log1pz)/Log1pz) ) / Mlogz; Mlog2 -> log2 - (log2-Mlog2); Mlogir -> logir - (logir - Mlogir); e-E*Mlog2 -> (e-E*log2) + (E*(log2-Mlog2)) ; epsilon-> eps1 + eps2 + eps1*eps2; epsilon $ E; interval-2.1.0/src/crlibm/gappa/log-de/log-de-index0-E0.gappa0000644000000000000000000002240013031036767021576 0ustar 00000000000000# Usage: This files builds an error computation for the case when both the #index and the exponent are zero. # sed -f ../maple/TEMPLOG/polynomials.sed -f ../maple/TEMPLOG/log-de_0.sed ../gappa/log-de-index0-E0.gappa | $GAPPA # NOTATION CONVENTION # Variables that will be replaced with Maple-computed constants begin with an underscore # Variables that correspond to double-precision variables in the code begin with a small letter # variable eps_xxx denote the relative rounding error of the last machine operation that computes xxx # Remove the following line when editing this file, to get back the warnings (all the current ones are harmless) #@ -Wno-hint-difference -Wno-null-denominator # Remark: asking for warnings resuires at least 512MB of memory @IEEEdouble = float; @IEEEext = float; # polynomial coefficients, computed by Maple #c1 = IEEEext(_c1); c2 = IEEEext(_c2); c3 = IEEEext(_c3); c4 = IEEEext(_c4); c5 = IEEEext(_c5); c6 = IEEEext(_c6); c7 = IEEEext(_c7); log2h = IEEEext(_log2h); log2l = IEEEext(_log2l); #r = IEEEext(_rval); #logirh = IEEEext(_logirh); #logirl = IEEEext(_logirl); # Transcription of the code, NOT using FMA # We have removed logirh and Elog2 z2 IEEEext= z*z; p67 IEEEext= c6 + z*c7; p45 IEEEext= c4 + z*c5; p23 IEEEext= c2 + z*c3; #p01 IEEEext= z; z4 IEEEext= z2*z2; p47 IEEEext= p45 + z2*p67; p03 IEEEext= z + z2*p23; # suppressed by hand the exact additions of 0 logz IEEEext= p03 + z4*p47; #---------- What this code is supposed to approximate # Exact mathematical definition of the log Mlogz = Log1pz; ############# Now come auxiliary definitions # Give the polynomial in Estrin form (no need to transcribe the intermediate steps) # Since the argument reduction is exact, Mz = z. Mz2 = z*z; Mz4 = Mz2*Mz2; Mz3 = z*z*z; Mz5 = z*z*z*z*z; Mz6 = z*z*z*z*z*z; eps_z2 = (z2 - z*z)/(z*z); eps_z4 = (z4 - z2*z2)/(z2*z2); t3 = IEEEext(z*c3); t5 = IEEEext(z*c5); t7 = IEEEext(z*c7); t23 = IEEEext(z2*p23); t47 = IEEEext(z4*p47); t67 = IEEEext(z2*p67); eps_t3 = (t3 - z*c3)/(z*c3); eps_t5 = (t5 - z*c5)/(z*c5); eps_t7 = (t7 - z*c7)/(z*c7); eps_t23 = (t23 - z2*p23)/(z2*p23); eps_t67 = (t67 - z2*p67)/(z2*p67); eps_t47 = (t47 - z4*p47)/(z4*p47); eps_p03 = (p03 - (z+t23)) / (z+t23); eps_p23 = (p23 - (c2 + t3)) / (c2 + t3); eps_p45 = (p45 - (c4 + t5)) / (c4 + t5); eps_p67 = (p67 - (c6 + t7)) / (c6 + t7); eps_p47 = (p47 - (p45 + t67)) / (p45 + t67); eps_logz = (logz - (p03 + t47))/(p03 + t47); # The following are just for lightening notations eps2_z4 = (1+eps_z2)*(1+eps_z2)*(1+eps_z4)-1; eps2_p67 = (1+eps_z2)*(1+eps_p67) -1; eps2_p47 = (1+eps2_z4)*(1+eps_p47) -1; PolyLog1pz = z + Mz2*(c2+z*c3) + Mz4*( (c4+z*c5) + Mz2*(c6+z*c7) ); epsilon = (logz - Mlogz)/Mlogz; epsilon_approx = (PolyLog1pz - Log1pz)/Log1pz; epsilon_round = (logz-PolyLog1pz)/PolyLog1pz; # The theorem. Remark that the case z=0 has to be proven by hand (fortunately it is easy) { (z in [1b-200, _zabsmax] \/ z in [-_zabsmax, -1b-200]) /\ epsilon_approx in [-_epsilonApproxQuick, _epsilonApproxQuick] /\ (PolyLog1pz - Log1pz) in [-_deltaApproxQuick, _deltaApproxQuick] -> epsilon in [-1b-63, 1b-63] } epsilon -> epsilon_approx + epsilon_round + epsilon_approx*epsilon_round; #We need to factor z by using : (logz-PolyLog1pz)/PolyLog1pz -> ((logz/z) - PolyLog1pz/z) / (PolyLog1pz/z); # Here the denominator will be bound properly: PolyLog1pz/z -> 1 + z*(c2+z*c3) + z*z*z*( (c4+z*c5) + z*z*(c6+z*c7) ) ; # so all we have is to cancel as much as possible from the numerator. # As all the polynomials come close to zero, we do this by forcing appearance of rel error # (1) logz = IEEEext(p03 + t47). Since p03+t47 comes close to zero, force appearance of relative error logz/z -> (1+ (IEEEext(p03 + t47) - (p03 + t47))/(p03 + t47) ) * ((p03 + t47)/z) ; # ------------------rel error----------------- --closer to PolyLog1pz/z--- # Now if we try to print out the rel error above, it is undefined. # This is because Gappa is not able to prove that p03+t47 does not contain 0. # So the first job is to get a better enclosure of p03+t47, without 0. # First get a good enclosure on p03 (so that it does not contain zero): same process as (1) p03 -> (1+ eps_p03) * (z+t23); # Again, the relative error above exists only if z+t23 does not contain 0 z+t23-> z*(1+t23/z); # now we force the relative error of the rounding of t23 t23/z -> eps_t23 * ((z2/z)*p23) + (z2/z)*p23; z2/z -> ( (z2 - z*z)/(z*z) ) * z + z; # that's eps_z2 # Now p03 is OK, but p03 + t47 still contains 0: rewrite it, first by rewriting t47: t47 -> (1 + eps_t47) * (z4*p47) ; # now we may rewrite p03+t47, with the purpose to factor z p03+t47 -> z*( (1+eps_p03)*(1+t23/z) + (1+eps_t47)*(z4*p47/z)); # remains to bound z4*p47/z, a piece of cake (we even recycle z2/z) z4*p47/z -> (1 + (IEEEext(z2*z2) - z2*z2)/(z2*z2)) * p47*z2*(z2/z) ; # At this point the relative error in (1) exists at last. Beside we have almost built a good approx of: (p03+t47)/z -> (1+eps_p03)*(1+t23/z) + (1+eps_t47)*(z4*p47/z) ; # The previous gives a bound of 2^-8 for the approximation error. Let us refine it. # Replacing the terms with the best expression we have for them gives: (logz-PolyLog1pz)/PolyLog1pz -> ( (1+ eps_logz)*( (1+eps_p03)*(1+t23/z) + (1+eps_t47)*(z4*p47/z) ) - (1 + z*(c2+z*c3) + z*z*z*( (c4+z*c5) + z*z*(c6+z*c7) )) ) / (PolyLog1pz/z); # We develop and simplify the logz/z part of the expression in Maple using expand(). Need to set: interface(prettyprint=0); #expand( (1+ eps_logz)*( (1+eps_p03)*(1+t23/z) + (1+eps_t47)*(z4*p47/z) )); # Then we may cancel the 1s. # Then we regroup the next significant terms: t23/z - z*(c2+z*c3), and # (also add parentheses around (z4*p47/z) and (t23/z) so that the remainder is bound properly using previous hints) (logz-PolyLog1pz)/PolyLog1pz -> ( (t23/z - z*(c2+z*c3)) +((z4*p47/z) - z*z*z*( (c4+z*c5) + z*z*(c6+z*c7))) + (eps_p03 + eps_p03*(t23/z) + + (z4*p47/z)*eps_t47+eps_logz+eps_logz*(t23/z) + eps_logz*eps_p03 + eps_logz*eps_p03*(t23/z) + eps_logz*(z4*p47/z) + eps_logz*(z4*p47/z)*eps_t47 ) ) / (PolyLog1pz/z); # A quick check gives a bound of 2^-62 for the third term (sum of epsilons), which is OK for now. # Now let us work on this next significant term, starting with the expression we already have for t23/z: t23/z - z*(c2+z*c3) -> eps_t23 * ((z2/z)*p23) + ( (z2/z)*p23 - z*(c2+z*c3)) ; # ----------small------- # insert rel error of p23, and replace z2/z with the hint already given, then simplify and look for the most significant term : # expand((eps_z2 * z + z) * (1+eps_p23)*(c2+t3) - z*(c2+z*c3)); (z2/z)*p23 - z*(c2+z*c3) -> (z*t3 - z*z*c3) + eps_z2*z*c2 + eps_z2*z*t3 + eps_z2*z*eps_p23*c2 + eps_z2*z*eps_p23*t3 + z*eps_p23*c2 + z*eps_p23*t3 ; (z*t3 - z*z*c3) -> z*(z*c3*eps_t3); # At this point we have a bound of 2^-71 for t23/z - z*(c2+z*c3), perfect. # Let us attack (z4*p47/z) - z*z*z*( (c4+z*c5) + z*z*(c6+z*c7)) (currently 2^-25 -- interval arithmetic on z^3) # Rewrite z4 as z2*z2*(1+eps_z4), then inside this rewrite z2 as z*z*(1+eps_z2). z4/z -> z*z*z + z*z*z*((1+eps_z2)*(1+eps_z2)*(1+eps_z4) -1); #OK # Also rewrite p47 all the way down : we get # p47 -> (1+eps_p47)*(p45 + (1+eps_t67)*(z2*p67)); # p45 -> (1+eps_p45)*(c4+(1+eps_t5)*(z*c5)); # z2*p67 -> (1+eps_z2)*z*z*(1+eps_p67)*(c6+(1+eps_t7)*(c7*z)); # Putting together: (z4*p47/z) - z*z*z*( (c4+z*c5) + z*z*(c6+z*c7)) -> z*z*z*( (1+eps2_p47)*(((1+eps_p45)*(c4+(1+eps_t5)*(z*c5))) + (1+eps_t67)*(z*z*(1+eps2_p67)*(c6+(1+eps_t7)*c7*z))) - c4 - z*c5 - z*z*(c6+z*c7)) ; # This last hint is computed by one expand() and one collect(,z) in maple (1+eps2_p47)*(((1+eps_p45)*(c4+(1+eps_t5)*(z*c5))) + (1+eps_t67)*(z*z*(1+eps2_p67)*(c6+(1+eps_t7)*c7*z))) - c4 - z*c5 - z*z*(c6+z*c7) -> (eps2_z4*c7*eps_t7+eps2_z4*eps2_p67*c7+c7*eps_t7+eps2_z4*c7+eps2_p67*c7+eps2_p67*c7*eps_t7+eps2_z4*eps2_p67*c7*eps_t7+eps_t67* c7+eps_p47*c7+eps_t67*c7*eps_t7+eps_p47*c7*eps_t7+eps_p47*eps_t67*c7+eps2_z4*eps_p47*c7+eps2_z4*eps_t67*c7+eps_t67*eps2_p67*c7 +eps_p47*eps2_p67*c7+eps_p47*eps_t67*c7*eps_t7+eps2_z4*eps_p47*c7*eps_t7+eps2_z4*eps_p47*eps_t67*c7+eps2_z4*eps_t67*c7*eps_t7+ eps_t67*eps2_p67*c7*eps_t7+eps2_z4*eps_p47*eps2_p67*c7+eps_p47*eps2_p67*c7*eps_t7+eps_p47*eps_t67*eps2_p67*c7+eps2_z4*eps_t67* eps2_p67*c7+eps2_z4*eps_p47*eps_t67*c7*eps_t7+eps2_z4*eps_p47*eps2_p67*c7*eps_t7+eps2_z4*eps_p47*eps_t67*eps2_p67*c7+eps2_z4* eps_p47*eps_t67*eps2_p67*c7*eps_t7+eps_p47*eps_t67*eps2_p67*c7*eps_t7+eps2_z4*eps_t67*eps2_p67*c7*eps_t7)*Mz3+(eps_t67* eps2_p67*c6+eps_p47*eps2_p67*c6+eps_p47*c6+eps2_z4*eps_p47*c6+eps_p47*eps_t67*eps2_p67*c6+eps_t67*c6+eps2_z4*eps_p47*eps2_p67* c6+eps2_p67*c6+eps2_z4*eps_t67*eps2_p67*c6+eps2_z4*eps_p47*eps_t67*eps2_p67*c6+eps2_z4*eps_t67*c6+eps2_z4*eps_p47*eps_t67*c6+ eps2_z4*c6+eps2_z4*eps2_p67*c6+eps_p47*eps_t67*c6)*Mz2+(eps2_z4*eps_p47*eps_p45*c5+c5*eps_t5+eps2_z4*eps_p45*c5*eps_t5+eps_p47 *c5+eps_p45*c5+eps_p47*eps_p45*c5+eps_p45*c5*eps_t5+eps_p47*eps_p45*c5*eps_t5+eps_p47*c5*eps_t5+eps2_z4*eps_p47*c5+eps2_z4* eps_p45*c5+eps2_z4*eps_p47*eps_p45*c5*eps_t5+eps2_z4*eps_p47*c5*eps_t5+eps2_z4*c5*eps_t5+eps2_z4*c5)*z+eps_p47*c4+eps2_z4* eps_p45*c4+eps2_z4*eps_p47*c4+eps2_z4*c4+eps_p47*eps_p45*c4+eps2_z4*eps_p47*eps_p45*c4+eps_p45*c4 ; interval-2.1.0/src/crlibm/gappa/log-de/log-de-index0-E1N.gappa0000644000000000000000000000511413031036767021720 0ustar 00000000000000# This file is exactly log-de-logirN-E0N.gappa, with the case E=0 removed in the theorem. # It is useful only to allow for a full automated proof. # Remove the following line when editing this file, to get back the warnings (all the current ones are harmless) #@ -Wno-hint-difference -Wno-null-denominator # Remark: asking for warnings resuires at least 512MB of memory #This is to prevent another warning which might let you think Gappa failed when it eventually succeeds. #@ -Wno-dichotomy-failure @IEEEdouble = float; @IEEEext = float; # This is to tell Gappa that E is an integer. E=int(dummyE); # polynomial coefficients, computed by Maple #c1 = IEEEext(_c1); # Since c1=1, it does not appear in the C code anymode c2 = IEEEext(_c2); c3 = IEEEext(_c3); c4 = IEEEext(_c4); c5 = IEEEext(_c5); c6 = IEEEext(_c6); c7 = IEEEext(_c7); # other constants, also from Maple log2h = IEEEext(_log2h); log2l = IEEEext(_log2l); #table values r = IEEEext(_rval); logirh = IEEEext(_logirh); logirl = IEEEext(_logirl); # Transcription of the code, NOT using FMA z2 IEEEext= z*z; p67 IEEEext= c6 + z*c7; p45 IEEEext= c4 + z*c5; p23 IEEEext= c2 + z*c3; p01 IEEEext= logirh + z; z4 IEEEext= z2*z2; p47 IEEEext= p45 + z2*p67; p03 IEEEext= p01 + z2*p23; p07 IEEEext= p03 + z4*p47; logz IEEEext= p07 + E*log2h; #---------- What this code is supposed to approximate # Exact mathematical definition of the log Mlogz = Log1pz + Logir + E*Mlog2; ############# Now come auxiliary definitions Log2hl = log2h + log2l; Logirhl = logirh + logirl; # Give the polynomial in Estrin form (no need to transcribe the intermediate steps) # Since the argument reduction is exact, Mz = z. Mz2 = z*z; Mz4 = Mz2*Mz2; P07 = ( (logirh+z) + Mz2*(c2+z*c3) ) + Mz4*( (c4+z*c5) + Mz2*(c6+z*c7) ); Alogz = P07 + E*Mlog2; PolyLog1pz = z + Mz2*(c2+z*c3) + Mz4*( (c4+z*c5) + Mz2*(c6+z*c7) ); epsilon = (logz - Mlogz)/Mlogz; { |E| in [1,1024] /\ |z| in [1b-200, _zabsmax] /\ Log2hl - Mlog2 in [-1b-129, 1b-129] /\ Logirhl - Logir in [-1b-129, 1b-129] /\ (PolyLog1pz - Log1pz) in [-_deltaApproxQuick, _deltaApproxQuick] -> epsilon in [-1b-63, 1b-63] } logz ~ Alogz; Alogz ~ Mlogz; # Trivialities which cannot be expressed using ~ logirh - Logir -> (logirh +logirl -Logir) - logirl; log2h-Mlog2 -> ((log2h + log2l) - Mlog2) - log2l; Mlog2 -> (log2h + log2l) - ((log2h + log2l) - Mlog2); Logir -> logirh + ((logirl - (logirh +logirl -Logir))); Mlogz -> Alogz - (Alogz-Mlogz); Alogz - Mlogz -> (logirh-Logir) + (PolyLog1pz - Log1pz); epsilon $ E; epsilon $ z; interval-2.1.0/src/crlibm/gappa/log-de/log-de-index1N-E0N.gappa0000644000000000000000000000671513031036767022046 0ustar 00000000000000# Usage: This files builds an error computation for all possible #exponent values, but for one index value only. To get a complete #proof you need to run it through gappa for all the possible values of #the constants. However, it doesn't work for the index value 0: use #file log-de-logir0-E0 instead # Running the ../maple/log-de.mpl Maple script # should create the required sed files and give the command to run. # Example sed -f ../maple/TEMPLOG/polynomials.sed -f ../maple/TEMPLOG/log-de_1.sed ../gappa/log-de.gappa | ~/gappa/src/gappa # NOTATION CONVENTION # Variables that will be replaced with Maple-computed constants begin with an underscore # Variables that correspond to double-precision variables in the code begin with a small letter # Other variables begin with a capital letter. # Remove the following line when editing this file, to get back the warnings (all the current ones are harmless) #@ -Wno-hint-difference -Wno-null-denominator # Remark: asking for warnings resuires at least 512MB of memory #This is to prevent another warning which might let you think Gappa failed when it eventually succeeds. #@ -Wno-dichotomy-failure @IEEEdouble = float; @IEEEext = float; # This is to tell Gappa that E is an integer. E=int(dummyE); # polynomial coefficients, computed by Maple #c1 = IEEEext(_c1); # Since c1=1, it does not appear in the C code anymode c2 = IEEEext(_c2); c3 = IEEEext(_c3); c4 = IEEEext(_c4); c5 = IEEEext(_c5); c6 = IEEEext(_c6); c7 = IEEEext(_c7); # other constants, also from Maple log2h = IEEEext(_log2h); log2l = IEEEext(_log2l); #table values r = IEEEext(_rval); logirh = IEEEext(_logirh); logirl = IEEEext(_logirl); # Transcription of the code, NOT using FMA z2 IEEEext= z*z; p67 IEEEext= c6 + z*c7; p45 IEEEext= c4 + z*c5; p23 IEEEext= c2 + z*c3; p01 IEEEext= logirh + z; z4 IEEEext= z2*z2; p47 IEEEext= p45 + z2*p67; p03 IEEEext= p01 + z2*p23; p07 IEEEext= p03 + z4*p47; logz IEEEext= p07 + E*log2h; #---------- What this code is supposed to approximate # Exact mathematical definition of the log Mlogz = Log1pz + Logir + E*Mlog2; ############# Now come auxiliary definitions Log2hl = log2h + log2l; Logirhl = logirh + logirl; # Give the polynomial in Estrin form (no need to transcribe the intermediate steps) # Since the argument reduction is exact, Mz = z. Mz2 = z*z; Mz4 = Mz2*Mz2; P07 = ( (logirh+z) + Mz2*(c2+z*c3) ) + Mz4*( (c4+z*c5) + Mz2*(c6+z*c7) ); Alogz = P07 + E*Mlog2; PolyLog1pz = z + Mz2*(c2+z*c3) + Mz4*( (c4+z*c5) + Mz2*(c6+z*c7) ); epsilon = (logz - Mlogz)/Mlogz; { ( |E| in [1,1024] /\ |z| in [1b-200, _zabsmax] /\ Log2hl - Mlog2 in [-1b-129, 1b-129] /\ Logirhl - Logir in [-1b-129, 1b-129] /\ (PolyLog1pz - Log1pz) in [-_deltaApproxQuick, _deltaApproxQuick] -> epsilon in [-1b-63, 1b-63] ) /\ ( E in [0,0] /\ z in [-_zabsmax, _zabsmax] /\ Log2hl - Mlog2 in [-1b-129, 1b-129] /\ Logirhl - Logir in [-1b-129, 1b-129] /\ (PolyLog1pz - Log1pz) in [-_deltaApproxQuick, _deltaApproxQuick] -> epsilon in [-1b-63, 1b-63] ) } logz ~ Alogz; Alogz ~ Mlogz; # Trivialities which cannot be expressed using ~ logirh - Logir -> (logirh +logirl -Logir) - logirl; log2h-Mlog2 -> ((log2h + log2l) - Mlog2) - log2l; Mlog2 -> (log2h + log2l) - ((log2h + log2l) - Mlog2); Logir -> logirh + ((logirl - (logirh +logirl -Logir))); Mlogz -> Alogz - (Alogz-Mlogz); Alogz - Mlogz -> (logirh-Logir) + (PolyLog1pz - Log1pz); epsilon $ E; epsilon $ z; interval-2.1.0/src/crlibm/gappa/log-td/log-td-E0-logir0.gappa0000644000000000000000000000776413031036767021661 0ustar 00000000000000 c3 = (_c3); c4 = (_c4); c5 = (_c5); c6 = (_c6); c7 = (_c7); E = 0; #MAPLE zh = (Z); zl = Z - zh; #MAPLE polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); ZhSquarehl = zh * zh; #MAPLE zhSquareh = (ZhSquarehl); zhSquarel = (ZhSquarehl - zhSquareh); zhSquareHalfh = zhSquareh * (-0.5); #MAPLE zhSquareHalfl = zhSquarel * (-0.5); #MAPLE ZhSquareHalfhl = ZhSquarehl * (-0.5); #MAPLE ZhCube = (zh * zhSquareh); polyUpper = polyHorner * ZhCube; temp = (zh * zl); T1hl = polyUpper - temp; #MAPLE t1h = (T1hl); t1l = (T1hl - t1h); T2 = Z + ZhSquareHalfhl; #MAPLE t2h = (T2hl); t2l = (T2hl - t2h); PE = T2hl + T1hl; #MAPLE ph = (Phl); pl = (Phl - ph); #We can simplify the computations in the function in this case as we know that #all operations (add, mult) on 0 (as a double double) are exact. Loghm = Phl; #MAPLE logh = (Loghm); logm = (Loghm - logh); #Mathematical definition of the logarithm and the polynomial Phigher = (c3 + Z * (c4 + Z * (c5 + Z * (c6 + Z * c7)))); #MAPLE ZZZ = Z*Z*Z; #MAPLE ZZZPhigher = ZZZ * Phigher; #MAPLE HZZ = (-0.5*Z*Z); #MAPLE ZpHZZ = Z + HZZ; #MAPLE P = ZpHZZ + ZZZPhigher; #MAPLE #We apply the same simplification on the mathematical definition of the log Log = Log1pZ; #MAPLE #Additional useful definitions ZZ = Z*Z; #MAPLE ZZZPhigherPzhzl = ZZZPhigher - zh * zl; #MAPLE HZ = -0.5*Z; #MAPLE Flzhzl = temp; #MAPLE { (T2hl - T2) / T2 in [-1b-103,1b-103] /\ (Phl - PE) / PE in [-1b-103,1b-103] /\ Z in [_zmin,_zmax] /\ (P - Log1pZ) / Log1pZ in [-_epsilonApproxQuick,_epsilonApproxQuick] /\ ((logh + logm) - Loghm) / Loghm in [-1b-106,1b-106] -> ((logh + logm) - Log) / Log in [-5b-65,5b-65] } T2hl - T2 -> ((T2hl - T2) / T2) * T2; T2hl -> (T2hl - T2) + T2; Phl - PE -> ((Phl - PE) / PE) * PE; Phl -> (Phl - PE) + PE; (ZhSquarehl - ZZ) / ZZ -> 2 * ((zh - Z) / Z) + ((zh - Z) / Z) * ((zh - Z) / Z); (zhSquareh - ZZ) / ZZ -> ((ZhSquarehl - ZZ) / ZZ) + ((zhSquareh - ZhSquarehl) / ZZ); (zhSquareh - ZhSquarehl) / ZZ -> ((zhSquareh - ZhSquarehl) / ZhSquarehl) * (ZhSquarehl / ZZ); ZhSquarehl / ZZ -> ((ZhSquarehl - ZZ) / ZZ) + 1; (ZhCube - ZZZ) / ZZZ -> (((zh * zhSquareh) - ZZZ) / ZZZ) + ((ZhCube - (zh * zhSquareh)) / ZZZ); ((zh * zhSquareh) - ZZZ) / ZZZ -> (1 + ((zh - Z) / Z)) * (1 + ((zhSquareh - ZZ) / ZZ)) - 1; ((ZhCube - (zh * zhSquareh)) / ZZZ) -> ((ZhCube - (zh * zhSquareh)) / (zh * zhSquareh)) * (((zh - Z) / Z) + 1) * (((zhSquareh - ZZ) / ZZ) + 1); polyHorner / Phigher -> ((polyHorner - Phigher) / Phigher) + 1; (polyUpper - ZZZPhigher) / ZZZPhigher -> ((polyHorner - Phigher) / Phigher) + ((ZhCube - ZZZ) / ZZZ) * (polyHorner / Phigher) + + ((polyUpper - (polyHorner * ZhCube)) / (polyHorner * ZhCube)) * (polyHorner / Phigher) + + ((ZhCube - ZZZ) / ZZZ) * ((polyUpper - (polyHorner * ZhCube)) / (polyHorner * ZhCube)) * (polyHorner / Phigher); ((ZhSquareHalfhl - (zh * zl)) - HZZ) / HZZ -> - ((zh - Z) / Z) * ((zh - Z) / Z); (ZhSquareHalfhl - HZZ) / HZZ -> (ZhSquarehl - ZZ) / ZZ; ((T2hl - (zh * zl)) - ZpHZZ) / ZpHZZ -> ((HZ * (((ZhSquareHalfhl - (zh * zl)) - HZZ) / HZZ)) + ((T2hl - T2) / T2) + (HZ * ((T2hl - T2) / T2)) + (HZ * ((ZhSquareHalfhl - HZZ) / HZZ) * ((T2hl - T2) / T2))) / (1 + HZ); (PE - P) / P -> (((1 + HZ) * (((T2hl - (zh * zl)) - ZpHZZ) / ZpHZZ)) + ((1 + ((zh - Z) / Z)) * (Z * ((zh - Z) / Z)) * ((Flzhzl - (zh * zl)) / (zh * zl))) + (ZZ * Phigher * ((polyUpper - ZZZPhigher) / ZZZPhigher))) / (1 + HZ + ZZ * Phigher); (Phl - P) / P -> ((PE - P) / P) + ((((PE - P) / P) + 1) * ((Phl - PE) / PE)); (Loghm - Log) / Log -> ((Loghm - P) / P) + ((P - Log) / Log) + ((Loghm - P) / P) * ((P - Log) / Log); (((logh + logm) - Log) / Log) -> (((logh + logm) - Loghm) / Loghm) + ((Loghm - Log) / Log) + (((logh + logm) - Loghm) / Loghm) * ((Loghm - Log) / Log); interval-2.1.0/src/crlibm/gappa/log-td/log-td-E0.gappa0000644000000000000000000000714613031036767020461 0ustar 00000000000000 c3 = (_c3); c4 = (_c4); c5 = (_c5); c6 = (_c6); c7 = (_c7); E = 0; #MAPLE logih = (_logih); logim = (_logim); logil = (_logil); zh = (Z); zl = Z - zh; #MAPLE polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); ZhSquarehl = zh * zh; #MAPLE zhSquareh = (ZhSquarehl); zhSquarel = (ZhSquarehl - zhSquareh); zhSquareHalfh = zhSquareh * (-0.5); #MAPLE zhSquareHalfl = zhSquarel * (-0.5); #MAPLE ZhSquareHalfhl = ZhSquarehl * (-0.5); #MAPLE polyUpper = polyHorner * (zh * zhSquareh); temp = (zh * zl); T1hl = polyUpper - temp; #MAPLE t1h = (T1hl); t1l = (T1hl - t1h); T2 = Z + ZhSquareHalfhl; #MAPLE t2h = (T2hl); t2l = (T2hl - t2h); PE = T2hl + T1hl; #MAPLE ph = (Phl); pl = (Phl - ph); #Useful additional definitions Log2hm = log2h + log2m; #MAPLE Logihm = logih + logim; #MAPLE #End additional LogTabPoly = Logihm + Phl; #MAPLE logTabPolyh = (LogTabPolyhl); logTabPolyl = (LogTabPolyhl - logTabPolyh); #We know that the addition of E * log2hm = 0 and logTabPolyhl is exact #Thus we simplify the proof at this level Loghm = LogTabPolyhl; #MAPLE logh = (Loghm); logm = (Loghm - logh); #Mathematical definition of the logarithm and the polynomial Phigher = (c3 + Z * (c4 + Z * (c5 + Z * (c6 + Z * c7)))); #MAPLE ZZZ = Z*Z*Z; #MAPLE ZZZPhigher = ZZZ * Phigher; #MAPLE HZZ = (-0.5*Z*Z); #MAPLE ZpHZZ = Z + HZZ; #MAPLE P = ZpHZZ + ZZZPhigher; #MAPLE Log1pZpTab = Log1pZ + Logir; #MAPLE #We apply the same simplification to the mathematical definition of the logarithm Log = Log1pZpTab; #MAPLE # Useful additional definitions HZZsimp = HZZ + (zh * zl); #MAPLE ZpHZZsimp = Z + HZZsimp; #MAPLE ZZZPhigherPzhzl = ZZZPhigher - zh * zl; #MAPLE zhCube = zh * zhSquareh; #MAPLE delta1 = T2hl - T2; #MAPLE delta2 = polyUpper - (polyHorner * zhCube); #MAPLE delta3 = zhCube - ZZZ; #MAPLE delta4 = Phl - PE; #MAPLE delta6 = P - Log1pZ; #MAPLE delta7 = LogTabPolyhl - LogTabPoly; #MAPLE # End additional { (T2hl - T2) / T2 in [-1b-103,1b-103] /\ (Phl - PE) / PE in [-1b-103,1b-103] /\ (LogTabPolyhl - LogTabPoly) / LogTabPoly in [-1b-103,1b-103] /\ (Log2hm - Log2) / Log2 in [-1b-84,1b-84] /\ (Logihm - Logir) / Logir in [-1b-106,1b-106] /\ Z in [_zmin,_zmax] /\ (P - Log1pZ) / Log1pZ in [-_epsilonApproxQuick,_epsilonApproxQuick] /\ ((logh + logm) - Loghm) / Loghm in [-1b-106,1b-106] -> ((logh + logm) - Log) / Log in [-5b-65,5b-65] } T2hl - T2 -> ((T2hl - T2) / T2) * T2; T2hl -> (T2hl - T2) + T2; Phl - PE -> ((Phl - PE) / PE) * PE; Phl -> (Phl - PE) + PE; LogTabPolyhl -> (LogTabPolyhl - LogTabPoly) + LogTabPoly; Loghm -> (Loghm - LogE) + LogE; Log2 -> Log2hm * (1 / (((Log2hm - Log2) / Log2) + 1)); Logir -> Logihm * (1 / (((Logihm - Logir) / Logir) + 1)); HZZsimp -> (-0.5 * zh * zh) - (0.5 * zl * zl); T2hl - ZpHZZsimp -> (0.5 * zl * zl) + delta1; zhCube - ZZZ -> (Z * (zhSquareh - Z * Z)) - (zl * zhSquareh); polyUpper - ZZZPhigher -> ZZZ * (polyHorner - Phigher) + polyHorner * delta3 + delta2; ZpHZZ + ZZZPhigher -> ZpHZZsimp + ZZZPhigherPzhzl; Phl - P -> (T2hl - ZpHZZsimp) + (T1hl - ZZZPhigherPzhzl) + delta4; Log1pZ -> P * (1 / (((P - Log1pZ) / Log1pZ) + 1)); P - Log1pZ -> ((P - Log1pZ) / Log1pZ) * Log1pZ; Phl - Log1pZ -> (Phl - P) + delta6; LogTabPolyhl - Log1pZpTab -> (Logihm - Logir) + (Phl - Log1pZ) + delta7; (logh + logm) - Loghm -> (((logh + logm) - Loghm) / Loghm) * Loghm; (logh + logm) - Log -> ((logh + logm) - Loghm) + (Loghm - Log);interval-2.1.0/src/crlibm/gappa/log-td/log-td-accurate-E0-logir0.gappa0000644000000000000000000002243513031036767023436 0ustar 00000000000000 accPolyC14 = (_accPolyC14); accPolyC13 = (_accPolyC13); accPolyC12 = (_accPolyC12); accPolyC11 = (_accPolyC11); accPolyC10 = (_accPolyC10); accPolyC9h = (_accPolyC9h); accPolyC9l = (_accPolyC9l); AccPolyC9hl = accPolyC9h + accPolyC9l; #MAPLE accPolyC8h = (_accPolyC8h); accPolyC8l = (_accPolyC8l); AccPolyC8hl = accPolyC8h + accPolyC8l; #MAPLE accPolyC7h = (_accPolyC7h); accPolyC7l = (_accPolyC7l); AccPolyC7hl = accPolyC7h + accPolyC7l; #MAPLE accPolyC6h = (_accPolyC6h); accPolyC6l = (_accPolyC6l); AccPolyC6hl = accPolyC6h + accPolyC6l; #MAPLE accPolyC5h = (_accPolyC5h); accPolyC5l = (_accPolyC5l); AccPolyC5hl = accPolyC5h + accPolyC5l; #MAPLE accPolyC4h = (_accPolyC4h); accPolyC4l = (_accPolyC4l); AccPolyC4hl = accPolyC4h + accPolyC4l; #MAPLE accPolyC3h = (_accPolyC3h); accPolyC3l = (_accPolyC3l); AccPolyC3hl = accPolyC3h + accPolyC3l; #MAPLE E = 0; #MAPLE zh = (Z); zl = Z - zh; #MAPLE highPoly = accPolyC10 + zh * (accPolyC11 + zh * (accPolyC12 + zh * (accPolyC13 + zh * accPolyC14))); T1hl = zh * highPoly; #MAPLE T2 = AccPolyC9hl + T1hl; #MAPLE T3 = Z * T2hl; #MAPLE T4 = AccPolyC8hl + T3hl; #MAPLE T5 = Z * T4hl; #MAPLE T6 = AccPolyC7hl + T5hl; #MAPLE T7 = Z * T6hl; #MAPLE T8 = AccPolyC6hl + T7hl; #MAPLE T9 = Z * T8hl; #MAPLE T10 = AccPolyC5hl + T9hl; #MAPLE T11 = Z * T10hl; #MAPLE T12 = AccPolyC4hl + T11hl; #MAPLE T13 = Z * T12hl; #MAPLE T14 = AccPolyC3hl + T13hl; #MAPLE ZSquare = Z * Z; #MAPLE ZCube = Z * ZSquarehml; #MAPLE HigherPolyMultZ = T14hl * ZCubehml; #MAPLE ZSquareHalfhml = -0.5 * ZSquarehml; #MAPLE PolyWithSquare = ZSquareHalfhml + HigherPolyMultZhml; #MAPLE Poly = Z + PolyWithSquarehml; #MAPLE #We can simplify the proof in this case since we know that adding a triple double which is #equal to 0 exactly is exact. Loghml = Polyhml; #MAPLE #Mathematical definition of the logarithm MHighPoly = accPolyC10 + Z * (accPolyC11 + Z * (accPolyC12 + Z * (accPolyC13 + Z * accPolyC14))); #MAPLE MT1 = Z * MHighPoly; #MAPLE MT2 = AccPolyC9hl + MT1; #MAPLE MT3 = Z * MT2; #MAPLE MT4 = AccPolyC8hl + MT3; #MAPLE MT5 = Z * MT4; #MAPLE MT6 = AccPolyC7hl + MT5; #MAPLE MT7 = Z * MT6; #MAPLE MT8 = AccPolyC6hl + MT7; #MAPLE MT9 = Z * MT8; #MAPLE MT10 = AccPolyC5hl + MT9; #MAPLE MT11 = Z * MT10; #MAPLE MT12 = AccPolyC4hl + MT11; #MAPLE MT13 = Z * MT12; #MAPLE MT14 = AccPolyC3hl + MT13; #MAPLE MZSquare = Z * Z; #MAPLE MZCube = Z * MZSquare; #MAPLE MHigherPolyMultZ = MT14 * MZCube; #MAPLE MZSquareHalf = -0.5 * MZSquare; #MAPLE MPolyWithSquare = MZSquareHalf + MHigherPolyMultZ; #MAPLE MPoly = Z + MPolyWithSquare; #MAPLE #We apply the same simplification here MLog = MLog1pZ; #MAPLE #Useful additional definitions epsilon1 = (highPoly - MHighPoly) / MHighPoly; #MAPLE epsilon2 = (T1hl - MT1) / MT1; #MAPLE epsilon3 = (T2hl - MT2) / MT2; #MAPLE epsilon4 = (T3hl - MT3) / MT3; #MAPLE epsilon5 = (T4hl - MT4) / MT4; #MAPLE epsilon6 = (T5hl - MT5) / MT5; #MAPLE epsilon7 = (T6hl - MT6) / MT6; #MAPLE epsilon8 = (T7hl - MT7) / MT7; #MAPLE epsilon9 = (T8hl - MT8) / MT8; #MAPLE epsilon10 = (T9hl - MT9) / MT9; #MAPLE epsilon11 = (T10hl - MT10) / MT10; #MAPLE epsilon12 = (T11hl - MT11) / MT11; #MAPLE epsilon13 = (T12hl - MT12) / MT12; #MAPLE epsilon14 = (T13hl - MT13) / MT13; #MAPLE epsilon15 = (T14hl - MT14) / MT14; #MAPLE epsilon16 = (ZCubehml - MZCube) / MZCube; #MAPLE epsilon17 = (HigherPolyMultZhml - MHigherPolyMultZ) / MHigherPolyMultZ; #MAPLE epsilon18 = (ZSquareHalfhml - MZSquareHalf) / MZSquareHalf; #MAPLE epsilon19 = (PolyWithSquarehml - MPolyWithSquare) / MPolyWithSquare; #MAPLE epsilon20 = (Polyhml - MLog1pZ) / MLog1pZ; #MAPLE epsilon21 = (PolyWithSquare - MPolyWithSquare) / MPolyWithSquare; #MAPLE epsilon22 = (Polyhml - MPoly) / MPoly; #MAPLE epsilon23 = (Poly - MPoly) / MPoly; #MAPLE aux1 = -0.5 * Z + MZSquare * MT14; #MAPLE #End additional definitions { ( (T2hl - T2) / T2 in [-1b-103,1b-103] /\ (T3hl - T3) / T3 in [-1b-102,1b-102] /\ (T4hl - T4) / T4 in [-1b-103,1b-103] /\ (T5hl - T5) / T5 in [-1b-102,1b-102] /\ (T6hl - T6) / T6 in [-1b-103,1b-103] /\ (T7hl - T7) / T7 in [-1b-102,1b-102] /\ (T8hl - T8) / T8 in [-1b-103,1b-103] /\ (T9hl - T9) / T9 in [-1b-102,1b-102] /\ (T10hl - T10) / T10 in [-1b-103,1b-103] /\ (T11hl - T11) / T11 in [-1b-102,1b-102] /\ (T12hl - T12) / T12 in [-1b-103,1b-103] /\ (T13hl - T13) / T13 in [-1b-102,1b-102] /\ (T14hl - T14) / T14 in [-1b-103,1b-103] /\ (ZSquarehml - ZSquare) / ZSquare in [-1b-149,1b-149] /\ (ZCubehml - ZCube) / ZCube in [-1b-144,1b-144] /\ (HigherPolyMultZhml - HigherPolyMultZ) / HigherPolyMultZ in [-1b-141,1b-141] /\ (PolyWithSquarehml - PolyWithSquare) / PolyWithSquare in [-1b-137,1b-137] /\ (Polyhml - Poly) / Poly in [-1b-134,1b-134] /\ (MPoly - MLog1pZ) / MLog1pZ in [-_epsilonApproxAccurate,_epsilonApproxAccurate] /\ Z in [1b-900,_zmax] /\ ((logh + logm + logl) - Loghml) / Loghml in [-1b-159,1b-159] -> ((logh + logm + logl) - MLog) / MLog in [-5735b-132,5735b-132] ) /\ ( (T2hl - T2) / T2 in [-1b-103,1b-103] /\ (T3hl - T3) / T3 in [-1b-102,1b-102] /\ (T4hl - T4) / T4 in [-1b-103,1b-103] /\ (T5hl - T5) / T5 in [-1b-102,1b-102] /\ (T6hl - T6) / T6 in [-1b-103,1b-103] /\ (T7hl - T7) / T7 in [-1b-102,1b-102] /\ (T8hl - T8) / T8 in [-1b-103,1b-103] /\ (T9hl - T9) / T9 in [-1b-102,1b-102] /\ (T10hl - T10) / T10 in [-1b-103,1b-103] /\ (T11hl - T11) / T11 in [-1b-102,1b-102] /\ (T12hl - T12) / T12 in [-1b-103,1b-103] /\ (T13hl - T13) / T13 in [-1b-102,1b-102] /\ (T14hl - T14) / T14 in [-1b-103,1b-103] /\ (ZSquarehml - ZSquare) / ZSquare in [-1b-149,1b-149] /\ (ZCubehml - ZCube) / ZCube in [-1b-144,1b-144] /\ (HigherPolyMultZhml - HigherPolyMultZ) / HigherPolyMultZ in [-1b-141,1b-141] /\ (PolyWithSquarehml - PolyWithSquare) / PolyWithSquare in [-1b-137,1b-137] /\ (Polyhml - Poly) / Poly in [-1b-134,1b-134] /\ (MPoly - MLog1pZ) / MLog1pZ in [-_epsilonApproxAccurate,_epsilonApproxAccurate] /\ Z in [_zmin,-1b-900] /\ ((logh + logm + logl) - Loghml) / Loghml in [-1b-159,1b-159] -> ((logh + logm + logl) - MLog) / MLog in [-5735b-132,5735b-132] ) } ((logh + logm + logl) - MLog) / MLog -> ((Loghml - MLog) / MLog) + ((((logh + logm + logl) - Loghml) / Loghml) * (((Loghml - MLog) / MLog) + 1)); T2hl -> (T2 * ((T2hl - T2) / T2)) + T2; T3hl -> (T3 * ((T3hl - T3) / T3)) + T3; T4hl -> (T4 * ((T4hl - T4) / T4)) + T4; T5hl -> (T5 * ((T5hl - T5) / T5)) + T5; T6hl -> (T6 * ((T6hl - T6) / T6)) + T6; T7hl -> (T7 * ((T7hl - T7) / T7)) + T7; T8hl -> (T8 * ((T8hl - T8) / T8)) + T8; T9hl -> (T9 * ((T9hl - T9) / T9)) + T9; T10hl -> (T10 * ((T10hl - T10) / T10)) + T10; T11hl -> (T11 * ((T11hl - T11) / T11)) + T11; T12hl -> (T12 * ((T12hl - T12) / T12)) + T12; T13hl -> (T13 * ((T13hl - T13) / T13)) + T13; T14hl -> (T14 * ((T14hl - T14) / T14)) + T14; ZSquarehml -> (ZSquare * ((ZSquarehml - ZSquare) / ZSquare)) + ZSquare; ZCubehml -> (ZCube * ((ZCubehml - ZCube) / ZCube)) + ZCube; HigherPolyMultZhml -> (HigherPolyMultZ * ((HigherPolyMultZhml - HigherPolyMultZ) / HigherPolyMultZ)) + HigherPolyMultZ; PolyWithSquarehml -> (PolyWithSquare * ((PolyWithSquarehml - PolyWithSquare) / PolyWithSquare)) + PolyWithSquare; Polyhml -> (Poly * ((Polyhml - Poly) / Poly)) + Poly; epsilon2 -> epsilon1 + (((zh - Z) / Z) * (epsilon1 + 1)); epsilon3 -> ((epsilon2 * MT1) / (AccPolyC9hl + MT1)) + (((AccPolyC9hl + T1hl) / (AccPolyC9hl + MT1)) * ((T2hl - T2) / T2)); epsilon4 -> epsilon3 + (((T3hl - T3) / T3) * (epsilon3 + 1)); epsilon5 -> ((epsilon4 * MT3) / (AccPolyC8hl + MT3)) + (((AccPolyC8hl + T3hl) / (AccPolyC8hl + MT3)) * ((T4hl - T4) / T4)); epsilon6 -> epsilon5 + (((T5hl - T5) / T5) * (epsilon5 + 1)); epsilon7 -> ((epsilon6 * MT5) / (AccPolyC7hl + MT5)) + (((AccPolyC7hl + T5hl) / (AccPolyC7hl + MT5)) * ((T6hl - T6) / T6)); epsilon8 -> epsilon7 + (((T7hl - T7) / T7) * (epsilon7 + 1)); epsilon9 -> ((epsilon8 * MT7) / (AccPolyC6hl + MT7)) + (((AccPolyC6hl + T7hl) / (AccPolyC6hl + MT7)) * ((T8hl - T8) / T8)); epsilon10 -> epsilon9 + (((T9hl - T9) / T9) * (epsilon9 + 1)); epsilon11 -> ((epsilon10 * MT9) / (AccPolyC5hl + MT9)) + (((AccPolyC5hl + T9hl) / (AccPolyC5hl + MT9)) * ((T10hl - T10) / T10)); epsilon12 -> epsilon11 + (((T11hl - T11) / T11) * (epsilon11 + 1)); epsilon13 -> ((epsilon12 * MT11) / (AccPolyC4hl + MT11)) + (((AccPolyC4hl + T11hl) / (AccPolyC4hl + MT11)) * ((T12hl - T12) / T12)); epsilon14 -> epsilon13 + (((T13hl - T13) / T13) * (epsilon13 + 1)); epsilon15 -> ((epsilon14 * MT13) / (AccPolyC3hl + MT13)) + (((AccPolyC3hl + T13hl) / (AccPolyC3hl + MT13)) * ((T14hl - T14) / T14)); epsilon16 -> ((ZSquarehml - MZSquare) / MZSquare) + (((ZCubehml - ZCube) / ZCube) * (((ZSquarehml - MZSquare) / MZSquare) + 1)); epsilon17 -> epsilon15 + epsilon16 + epsilon15 * epsilon16 + ((HigherPolyMultZhml - HigherPolyMultZ) / HigherPolyMultZ) * (1 + epsilon15 + epsilon16 + epsilon15 * epsilon16); epsilon18 -> (ZSquarehml - MZSquare) / MZSquare; epsilon19 -> epsilon21 + (1 + epsilon21) * ((PolyWithSquarehml - PolyWithSquare) / PolyWithSquare); epsilon20 -> (((Polyhml - MPoly) / MPoly) + ((MPoly - MLog1pZ) / MLog1pZ)) + (((Polyhml - MPoly) / MPoly) * ((MPoly - MLog1pZ) / MLog1pZ)); epsilon21 -> ((-0.5 * epsilon18) + (Z * MT14 * epsilon17)) / (-0.5 + (Z * MT14)); epsilon22 -> epsilon23 + (((Polyhml - Poly) / Poly) * (1+ epsilon23)); epsilon23 -> epsilon19 * (aux1 / (1 + aux1)); interval-2.1.0/src/crlibm/gappa/log-td/log-td-accurate-E0.gappa0000644000000000000000000001704313031036767022243 0ustar 00000000000000 logih = (_logih); logim = (_logim); logil = (_logil); Logihml = logih + logim + logil; #MAPLE accPolyC14 = (_accPolyC14); accPolyC13 = (_accPolyC13); accPolyC12 = (_accPolyC12); accPolyC11 = (_accPolyC11); accPolyC10 = (_accPolyC10); accPolyC9h = (_accPolyC9h); accPolyC9l = (_accPolyC9l); AccPolyC9hl = accPolyC9h + accPolyC9l; #MAPLE accPolyC8h = (_accPolyC8h); accPolyC8l = (_accPolyC8l); AccPolyC8hl = accPolyC8h + accPolyC8l; #MAPLE accPolyC7h = (_accPolyC7h); accPolyC7l = (_accPolyC7l); AccPolyC7hl = accPolyC7h + accPolyC7l; #MAPLE accPolyC6h = (_accPolyC6h); accPolyC6l = (_accPolyC6l); AccPolyC6hl = accPolyC6h + accPolyC6l; #MAPLE accPolyC5h = (_accPolyC5h); accPolyC5l = (_accPolyC5l); AccPolyC5hl = accPolyC5h + accPolyC5l; #MAPLE accPolyC4h = (_accPolyC4h); accPolyC4l = (_accPolyC4l); AccPolyC4hl = accPolyC4h + accPolyC4l; #MAPLE accPolyC3h = (_accPolyC3h); accPolyC3l = (_accPolyC3l); AccPolyC3hl = accPolyC3h + accPolyC3l; #MAPLE E = 0; #MAPLE zh = (Z); zl = Z - zh; #MAPLE highPoly = accPolyC10 + zh * (accPolyC11 + zh * (accPolyC12 + zh * (accPolyC13 + zh * accPolyC14))); T1hl = zh * highPoly; #MAPLE T2 = AccPolyC9hl + T1hl; #MAPLE T3 = Z * T2hl; #MAPLE T4 = AccPolyC8hl + T3hl; #MAPLE T5 = Z * T4hl; #MAPLE T6 = AccPolyC7hl + T5hl; #MAPLE T7 = Z * T6hl; #MAPLE T8 = AccPolyC6hl + T7hl; #MAPLE T9 = Z * T8hl; #MAPLE T10 = AccPolyC5hl + T9hl; #MAPLE T11 = Z * T10hl; #MAPLE T12 = AccPolyC4hl + T11hl; #MAPLE T13 = Z * T12hl; #MAPLE T14 = AccPolyC3hl + T13hl; #MAPLE ZSquare = Z * Z; #MAPLE ZCube = Z * ZSquarehml; #MAPLE HigherPolyMultZ = T14hl * ZCubehml; #MAPLE ZSquareHalfhml = -0.5 * ZSquarehml; #MAPLE PolyWithSquare = ZSquareHalfhml + HigherPolyMultZhml; #MAPLE Poly = Z + PolyWithSquarehml; #MAPLE Logy = Logihml + Polyhml; #MAPLE #We can simplify the proof in this case since we know that adding a triple double which is #equal to 0 exactly is exact. Loghml = Logyhml; #MAPLE #Mathematical definition of the logarithm MHighPoly = accPolyC10 + Z * (accPolyC11 + Z * (accPolyC12 + Z * (accPolyC13 + Z * accPolyC14))); #MAPLE MT1 = Z * MHighPoly; #MAPLE MT2 = AccPolyC9hl + MT1; #MAPLE MT3 = Z * MT2; #MAPLE MT4 = AccPolyC8hl + MT3; #MAPLE MT5 = Z * MT4; #MAPLE MT6 = AccPolyC7hl + MT5; #MAPLE MT7 = Z * MT6; #MAPLE MT8 = AccPolyC6hl + MT7; #MAPLE MT9 = Z * MT8; #MAPLE MT10 = AccPolyC5hl + MT9; #MAPLE MT11 = Z * MT10; #MAPLE MT12 = AccPolyC4hl + MT11; #MAPLE MT13 = Z * MT12; #MAPLE MT14 = AccPolyC3hl + MT13; #MAPLE MZSquare = Z * Z; #MAPLE MZCube = Z * MZSquare; #MAPLE MHigherPolyMultZ = MT14 * MZCube; #MAPLE MZSquareHalf = -0.5 * MZSquare; #MAPLE MPolyWithSquare = MZSquareHalf + MHigherPolyMultZ; #MAPLE MPoly = Z + MPolyWithSquare; #MAPLE MLogy = MLogi + MLog1pZ; #MAPLE #We apply the same simplification here MLog = MLogy; #MAPLE #Useful additional definitions delta1 = highPoly - MHighPoly; #MAPLE delta2 = T1hl - MT1; #MAPLE delta3 = T2hl - MT2; #MAPLE delta4 = T3hl - MT3; #MAPLE delta5 = T4hl - MT4; #MAPLE delta6 = T5hl - MT5; #MAPLE delta7 = T6hl - MT6; #MAPLE delta8 = T7hl - MT7; #MAPLE delta9 = T8hl - MT8; #MAPLE delta10 = T9hl - MT9; #MAPLE delta11 = T10hl - MT10; #MAPLE delta12 = T11hl - MT11; #MAPLE delta13 = T12hl - MT12; #MAPLE delta14 = T13hl - MT13; #MAPLE delta15 = T14hl - MT14; #MAPLE delta16 = ZSquarehml - MZSquare; #MAPLE delta17 = ZCubehml - MZCube; #MAPLE delta18 = HigherPolyMultZhml - MHigherPolyMultZ; #MAPLE delta19 = ZSquareHalfhml - MZSquareHalf; #MAPLE delta20 = PolyWithSquarehml - MPolyWithSquare; #MAPLE delta21 = Polyhml - MPoly; #MAPLE delta22 = Logyhml - MLogy; #MAPLE delta24 = Loghml - MLog; #MAPLE delta25 = Logihml - MLogi; #MAPLE delta26 = Polyhml - MLog1pZ; #MAPLE #End additional definitions { (T2hl - T2) / T2 in [-1b-103,1b-103] /\ (T3hl - T3) / T3 in [-1b-102,1b-102] /\ (T4hl - T4) / T4 in [-1b-103,1b-103] /\ (T5hl - T5) / T5 in [-1b-102,1b-102] /\ (T6hl - T6) / T6 in [-1b-103,1b-103] /\ (T7hl - T7) / T7 in [-1b-102,1b-102] /\ (T8hl - T8) / T8 in [-1b-103,1b-103] /\ (T9hl - T9) / T9 in [-1b-102,1b-102] /\ (T10hl - T10) / T10 in [-1b-103,1b-103] /\ (T11hl - T11) / T11 in [-1b-102,1b-102] /\ (T12hl - T12) / T12 in [-1b-103,1b-103] /\ (T13hl - T13) / T13 in [-1b-102,1b-102] /\ (T14hl - T14) / T14 in [-1b-103,1b-103] /\ (ZSquarehml - ZSquare) / ZSquare in [-1b-149,1b-149] /\ (ZCubehml - ZCube) / ZCube in [-1b-144,1b-144] /\ (HigherPolyMultZhml - HigherPolyMultZ) / HigherPolyMultZ in [-1b-141,1b-141] /\ (PolyWithSquarehml - PolyWithSquare) / PolyWithSquare in [-1b-137,1b-137] /\ (Polyhml - Poly) / Poly in [-1b-134,1b-134] /\ (Logyhml - Logy) / Logy in [-1b-128,1b-128] /\ (Logihml - MLogi) / MLogi in [-1b-159,1b-159] /\ (MPoly - MLog1pZ) / MLog1pZ in [-_epsilonApproxAccurate,_epsilonApproxAccurate] /\ Z in [_zmin,_zmax] /\ ((logh + logm + logl) - Loghml) / Loghml in [-1b-159,1b-159] -> ((logh + logm + logl) - MLog) / MLog in [-5735b-132,5735b-132] } MLog1pZ -> MPoly * (1 / (((MPoly - MLog1pZ) / MLog1pZ) + 1)); MLog2 -> Log2hml * (1 / (((Log2hml - MLog2) / MLog2) + 1)); MLogi -> Logihml * (1 / (((Logihml - MLogi) / MLogi) + 1)); T2hl -> (T2 * ((T2hl - T2) / T2)) + T2; T3hl -> (T3 * ((T3hl - T3) / T3)) + T3; T4hl -> (T4 * ((T4hl - T4) / T4)) + T4; T5hl -> (T5 * ((T5hl - T5) / T5)) + T5; T6hl -> (T6 * ((T6hl - T6) / T6)) + T6; T7hl -> (T7 * ((T7hl - T7) / T7)) + T7; T8hl -> (T8 * ((T8hl - T8) / T8)) + T8; T9hl -> (T9 * ((T9hl - T9) / T9)) + T9; T10hl -> (T10 * ((T10hl - T10) / T10)) + T10; T11hl -> (T11 * ((T11hl - T11) / T11)) + T11; T12hl -> (T12 * ((T12hl - T12) / T12)) + T12; T13hl -> (T13 * ((T13hl - T13) / T13)) + T13; T14hl -> (T14 * ((T14hl - T14) / T14)) + T14; ZSquarehml -> (ZSquare * ((ZSquarehml - ZSquare) / ZSquare)) + ZSquare; ZCubehml -> (ZCube * ((ZCubehml - ZCube) / ZCube)) + ZCube; HigherPolyMultZhml -> (HigherPolyMultZ * ((HigherPolyMultZhml - HigherPolyMultZ) / HigherPolyMultZ)) + HigherPolyMultZ; PolyWithSquarehml -> (PolyWithSquare * ((PolyWithSquarehml - PolyWithSquare) / PolyWithSquare)) + PolyWithSquare; Polyhml -> (Poly * ((Polyhml - Poly) / Poly)) + Poly; Logyhml -> (Logy * ((Logyhml - Logy) / Logy)) + Logy; delta3 -> delta2 + (T2 * ((T2hl - T2) / T2)); delta4 -> Z * delta3 + T3 * ((T3hl - T3) / T3); delta5 -> delta4 + (T4 * ((T4hl - T4) / T4)); delta6 -> Z * delta5 + T5 * ((T5hl - T5) / T5); delta7 -> delta6 + (T6 * ((T6hl - T6) / T6)); delta8 -> Z * delta7 + T7 * ((T7hl - T7) / T7); delta9 -> delta8 + (T8 * ((T8hl - T8) / T8)); delta10 -> Z * delta9 + T9 * ((T9hl - T9) / T9); delta11 -> delta10 + (T10 * ((T10hl - T10) / T10)); delta12 -> Z * delta11 + T11 * ((T11hl - T11) / T11); delta13 -> delta12 + (T12 * ((T12hl - T12) / T12)); delta14 -> Z * delta13 + T13 * ((T13hl - T13) / T13); delta15 -> delta14 + (T14 * ((T14hl - T14) / T14)); delta16 -> Z*Z*((ZSquarehml - ZSquare) / ZSquare); delta17 -> Z * delta16 + ZCube * ((ZCubehml - ZCube) / ZCube); delta18 -> delta15 * delta17 + delta15 * MZCube + delta17 * MT14 + HigherPolyMultZ * ((HigherPolyMultZhml - HigherPolyMultZ) / HigherPolyMultZ); delta20 -> delta19 + delta18 + PolyWithSquare * ((PolyWithSquarehml - PolyWithSquare) / PolyWithSquare); delta21 -> delta20 + Poly * ((Polyhml - Poly) / Poly); delta22 -> delta25 + delta26 + Logy * ((Logyhml - Logy) / Logy); delta26 -> delta21 + MLog1pZ * ((MPoly - MLog1pZ) / MLog1pZ); ((logh + logm + logl) - MLog) / MLog -> ((Loghml - MLog) / MLog) + ((((logh + logm + logl) - Loghml) / Loghml) * (((Loghml - MLog) / MLog) + 1)); interval-2.1.0/src/crlibm/gappa/log-td/log-td-accurate.gappa0000644000000000000000000001744413031036767022006 0ustar 00000000000000 log2h = (_log2h); log2m = (_log2m); log2l = (_log2l); Log2hml = log2h + log2m + log2l; #MAPLE logih = (_logih); logim = (_logim); logil = (_logil); Logihml = logih + logim + logil; #MAPLE accPolyC14 = (_accPolyC14); accPolyC13 = (_accPolyC13); accPolyC12 = (_accPolyC12); accPolyC11 = (_accPolyC11); accPolyC10 = (_accPolyC10); accPolyC9h = (_accPolyC9h); accPolyC9l = (_accPolyC9l); AccPolyC9hl = accPolyC9h + accPolyC9l; #MAPLE accPolyC8h = (_accPolyC8h); accPolyC8l = (_accPolyC8l); AccPolyC8hl = accPolyC8h + accPolyC8l; #MAPLE accPolyC7h = (_accPolyC7h); accPolyC7l = (_accPolyC7l); AccPolyC7hl = accPolyC7h + accPolyC7l; #MAPLE accPolyC6h = (_accPolyC6h); accPolyC6l = (_accPolyC6l); AccPolyC6hl = accPolyC6h + accPolyC6l; #MAPLE accPolyC5h = (_accPolyC5h); accPolyC5l = (_accPolyC5l); AccPolyC5hl = accPolyC5h + accPolyC5l; #MAPLE accPolyC4h = (_accPolyC4h); accPolyC4l = (_accPolyC4l); AccPolyC4hl = accPolyC4h + accPolyC4l; #MAPLE accPolyC3h = (_accPolyC3h); accPolyC3l = (_accPolyC3l); AccPolyC3hl = accPolyC3h + accPolyC3l; #MAPLE E = 1; #MAPLE zh = (Z); zl = Z - zh; #MAPLE highPoly = accPolyC10 + zh * (accPolyC11 + zh * (accPolyC12 + zh * (accPolyC13 + zh * accPolyC14))); T1hl = zh * highPoly; #MAPLE T2 = AccPolyC9hl + T1hl; #MAPLE T3 = Z * T2hl; #MAPLE T4 = AccPolyC8hl + T3hl; #MAPLE T5 = Z * T4hl; #MAPLE T6 = AccPolyC7hl + T5hl; #MAPLE T7 = Z * T6hl; #MAPLE T8 = AccPolyC6hl + T7hl; #MAPLE T9 = Z * T8hl; #MAPLE T10 = AccPolyC5hl + T9hl; #MAPLE T11 = Z * T10hl; #MAPLE T12 = AccPolyC4hl + T11hl; #MAPLE T13 = Z * T12hl; #MAPLE T14 = AccPolyC3hl + T13hl; #MAPLE ZSquare = Z * Z; #MAPLE ZCube = Z * ZSquarehml; #MAPLE HigherPolyMultZ = T14hl * ZCubehml; #MAPLE ZSquareHalfhml = -0.5 * ZSquarehml; #MAPLE PolyWithSquare = ZSquareHalfhml + HigherPolyMultZhml; #MAPLE Poly = Z + PolyWithSquarehml; #MAPLE Logy = Logihml + Polyhml; #MAPLE Log2edhml = E * Log2hml; #MAPLE Logover = Log2edhml + Logyhml; #MAPLE #Mathematical definition of the logarithm MHighPoly = accPolyC10 + Z * (accPolyC11 + Z * (accPolyC12 + Z * (accPolyC13 + Z * accPolyC14))); #MAPLE MT1 = Z * MHighPoly; #MAPLE MT2 = AccPolyC9hl + MT1; #MAPLE MT3 = Z * MT2; #MAPLE MT4 = AccPolyC8hl + MT3; #MAPLE MT5 = Z * MT4; #MAPLE MT6 = AccPolyC7hl + MT5; #MAPLE MT7 = Z * MT6; #MAPLE MT8 = AccPolyC6hl + MT7; #MAPLE MT9 = Z * MT8; #MAPLE MT10 = AccPolyC5hl + MT9; #MAPLE MT11 = Z * MT10; #MAPLE MT12 = AccPolyC4hl + MT11; #MAPLE MT13 = Z * MT12; #MAPLE MT14 = AccPolyC3hl + MT13; #MAPLE MZSquare = Z * Z; #MAPLE MZCube = Z * MZSquare; #MAPLE MHigherPolyMultZ = MT14 * MZCube; #MAPLE MZSquareHalf = -0.5 * MZSquare; #MAPLE MPolyWithSquare = MZSquareHalf + MHigherPolyMultZ; #MAPLE MPoly = Z + MPolyWithSquare; #MAPLE MLogy = MLogi + MLog1pZ; #MAPLE MLog2E = E * MLog2; #MAPLE MLog = MLog2E + MLogy; #MAPLE #Useful additional definitions delta1 = highPoly - MHighPoly; #MAPLE delta2 = T1hl - MT1; #MAPLE delta3 = T2hl - MT2; #MAPLE delta4 = T3hl - MT3; #MAPLE delta5 = T4hl - MT4; #MAPLE delta6 = T5hl - MT5; #MAPLE delta7 = T6hl - MT6; #MAPLE delta8 = T7hl - MT7; #MAPLE delta9 = T8hl - MT8; #MAPLE delta10 = T9hl - MT9; #MAPLE delta11 = T10hl - MT10; #MAPLE delta12 = T11hl - MT11; #MAPLE delta13 = T12hl - MT12; #MAPLE delta14 = T13hl - MT13; #MAPLE delta15 = T14hl - MT14; #MAPLE delta16 = ZSquarehml - MZSquare; #MAPLE delta17 = ZCubehml - MZCube; #MAPLE delta18 = HigherPolyMultZhml - MHigherPolyMultZ; #MAPLE delta19 = ZSquareHalfhml - MZSquareHalf; #MAPLE delta20 = PolyWithSquarehml - MPolyWithSquare; #MAPLE delta21 = Polyhml - MPoly; #MAPLE delta22 = Logyhml - MLogy; #MAPLE delta23 = Log2edhml - MLog2E; #MAPLE delta24 = Loghml - MLog; #MAPLE delta25 = Logihml - MLogi; #MAPLE delta26 = Polyhml - MLog1pZ; #MAPLE #End additional definitions { (T2hl - T2) / T2 in [-1b-103,1b-103] /\ (T3hl - T3) / T3 in [-1b-102,1b-102] /\ (T4hl - T4) / T4 in [-1b-103,1b-103] /\ (T5hl - T5) / T5 in [-1b-102,1b-102] /\ (T6hl - T6) / T6 in [-1b-103,1b-103] /\ (T7hl - T7) / T7 in [-1b-102,1b-102] /\ (T8hl - T8) / T8 in [-1b-103,1b-103] /\ (T9hl - T9) / T9 in [-1b-102,1b-102] /\ (T10hl - T10) / T10 in [-1b-103,1b-103] /\ (T11hl - T11) / T11 in [-1b-102,1b-102] /\ (T12hl - T12) / T12 in [-1b-103,1b-103] /\ (T13hl - T13) / T13 in [-1b-102,1b-102] /\ (T14hl - T14) / T14 in [-1b-103,1b-103] /\ (ZSquarehml - ZSquare) / ZSquare in [-1b-149,1b-149] /\ (ZCubehml - ZCube) / ZCube in [-1b-144,1b-144] /\ (HigherPolyMultZhml - HigherPolyMultZ) / HigherPolyMultZ in [-1b-141,1b-141] /\ (PolyWithSquarehml - PolyWithSquare) / PolyWithSquare in [-1b-137,1b-137] /\ (Polyhml - Poly) / Poly in [-1b-134,1b-134] /\ (Logyhml - Logy) / Logy in [-1b-128,1b-128] /\ (Loghml - Logover) / Logover in [-1b-123,1b-123] /\ (Log2hml - MLog2) / MLog2 in [-1b-126,1b-126] /\ (Logihml - MLogi) / MLogi in [-1b-159,1b-159] /\ (MPoly - MLog1pZ) / MLog1pZ in [-_epsilonApproxAccurate,_epsilonApproxAccurate] /\ Z in [_zmin,_zmax] /\ ((logh + logm + logl) - Loghml) / Loghml in [-1b-159,1b-159] -> ((logh + logm + logl) - MLog) / MLog in [-5735b-132,5735b-132] } MLog1pZ -> MPoly * (1 / (((MPoly - MLog1pZ) / MLog1pZ) + 1)); MLog2 -> Log2hml * (1 / (((Log2hml - MLog2) / MLog2) + 1)); MLogi -> Logihml * (1 / (((Logihml - MLogi) / MLogi) + 1)); T2hl -> (T2 * ((T2hl - T2) / T2)) + T2; T3hl -> (T3 * ((T3hl - T3) / T3)) + T3; T4hl -> (T4 * ((T4hl - T4) / T4)) + T4; T5hl -> (T5 * ((T5hl - T5) / T5)) + T5; T6hl -> (T6 * ((T6hl - T6) / T6)) + T6; T7hl -> (T7 * ((T7hl - T7) / T7)) + T7; T8hl -> (T8 * ((T8hl - T8) / T8)) + T8; T9hl -> (T9 * ((T9hl - T9) / T9)) + T9; T10hl -> (T10 * ((T10hl - T10) / T10)) + T10; T11hl -> (T11 * ((T11hl - T11) / T11)) + T11; T12hl -> (T12 * ((T12hl - T12) / T12)) + T12; T13hl -> (T13 * ((T13hl - T13) / T13)) + T13; T14hl -> (T14 * ((T14hl - T14) / T14)) + T14; ZSquarehml -> (ZSquare * ((ZSquarehml - ZSquare) / ZSquare)) + ZSquare; ZCubehml -> (ZCube * ((ZCubehml - ZCube) / ZCube)) + ZCube; HigherPolyMultZhml -> (HigherPolyMultZ * ((HigherPolyMultZhml - HigherPolyMultZ) / HigherPolyMultZ)) + HigherPolyMultZ; PolyWithSquarehml -> (PolyWithSquare * ((PolyWithSquarehml - PolyWithSquare) / PolyWithSquare)) + PolyWithSquare; Polyhml -> (Poly * ((Polyhml - Poly) / Poly)) + Poly; Logyhml -> (Logy * ((Logyhml - Logy) / Logy)) + Logy; delta3 -> delta2 + (T2 * ((T2hl - T2) / T2)); delta4 -> Z * delta3 + T3 * ((T3hl - T3) / T3); delta5 -> delta4 + (T4 * ((T4hl - T4) / T4)); delta6 -> Z * delta5 + T5 * ((T5hl - T5) / T5); delta7 -> delta6 + (T6 * ((T6hl - T6) / T6)); delta8 -> Z * delta7 + T7 * ((T7hl - T7) / T7); delta9 -> delta8 + (T8 * ((T8hl - T8) / T8)); delta10 -> Z * delta9 + T9 * ((T9hl - T9) / T9); delta11 -> delta10 + (T10 * ((T10hl - T10) / T10)); delta12 -> Z * delta11 + T11 * ((T11hl - T11) / T11); delta13 -> delta12 + (T12 * ((T12hl - T12) / T12)); delta14 -> Z * delta13 + T13 * ((T13hl - T13) / T13); delta15 -> delta14 + (T14 * ((T14hl - T14) / T14)); delta16 -> Z*Z*((ZSquarehml - ZSquare) / ZSquare); delta17 -> Z * delta16 + ZCube * ((ZCubehml - ZCube) / ZCube); delta18 -> delta15 * delta17 + delta15 * MZCube + delta17 * MT14 + HigherPolyMultZ * ((HigherPolyMultZhml - HigherPolyMultZ) / HigherPolyMultZ); delta20 -> delta19 + delta18 + PolyWithSquare * ((PolyWithSquarehml - PolyWithSquare) / PolyWithSquare); delta21 -> delta20 + Poly * ((Polyhml - Poly) / Poly); delta22 -> delta25 + delta26 + Logy * ((Logyhml - Logy) / Logy); delta26 -> delta21 + MLog1pZ * ((MPoly - MLog1pZ) / MLog1pZ); delta24 -> delta23 + delta22 + Logover * ((Loghml - Logover) / Logover); ((logh + logm + logl) - MLog) / MLog -> ((Loghml - MLog) / MLog) + ((((logh + logm + logl) - Loghml) / Loghml) * (((Loghml - MLog) / MLog) + 1));interval-2.1.0/src/crlibm/gappa/log-td/log-td.gappa0000644000000000000000000000770113031036767020214 0ustar 00000000000000 log2h = (_log2h); log2m = (_log2m); log2l = (_log2l); c3 = (_c3); c4 = (_c4); c5 = (_c5); c6 = (_c6); c7 = (_c7); E = 1; #MAPLE logih = (_logih); logim = (_logim); logil = (_logil); zh = (Z); zl = Z - zh; #MAPLE polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); ZhSquarehl = zh * zh; #MAPLE zhSquareh = (ZhSquarehl); zhSquarel = (ZhSquarehl - zhSquareh); zhSquareHalfh = zhSquareh * (-0.5); #MAPLE zhSquareHalfl = zhSquarel * (-0.5); #MAPLE ZhSquareHalfhl = ZhSquarehl * (-0.5); #MAPLE polyUpper = polyHorner * (zh * zhSquareh); temp = (zh * zl); T1hl = polyUpper - temp; #MAPLE t1h = (T1hl); t1l = (T1hl - t1h); T2 = Z + ZhSquareHalfhl; #MAPLE t2h = (T2hl); t2l = (T2hl - t2h); PE = T2hl + T1hl; #MAPLE ph = (Phl); pl = (Phl - ph); Log2hed = E * log2h; #MAPLE Log2med = E * log2m; #MAPLE Log2edhm = Log2hed + Log2med; #MAPLE log2edh = (Log2edhm); log2edl = (Log2edhm - log2edh); #Useful additional definitions Log2hm = log2h + log2m; #MAPLE Logihm = logih + logim; #MAPLE #End additional LogTabPoly = Logihm + Phl; #MAPLE logTabPolyh = (LogTabPolyhl); logTabPolyl = (LogTabPolyhl - logTabPolyh); LogE = Log2edhm + LogTabPolyhl; #MAPLE logh = (Loghm); logm = (Loghm - logh); #Mathematical definition of the logarithm and the polynomial Phigher = (c3 + Z * (c4 + Z * (c5 + Z * (c6 + Z * c7)))); #MAPLE ZZZ = Z*Z*Z; #MAPLE ZZZPhigher = ZZZ * Phigher; #MAPLE HZZ = (-0.5*Z*Z); #MAPLE ZpHZZ = Z + HZZ; #MAPLE P = ZpHZZ + ZZZPhigher; #MAPLE Log2E = E * Log2; #MAPLE Log1pZpTab = Log1pZ + Logir; #MAPLE Log = Log2E + Log1pZpTab; #MAPLE # Useful additional definitions HZZsimp = HZZ + (zh * zl); #MAPLE ZpHZZsimp = Z + HZZsimp; #MAPLE ZZZPhigherPzhzl = ZZZPhigher - zh * zl; #MAPLE zhCube = zh * zhSquareh; #MAPLE delta1 = T2hl - T2; #MAPLE delta2 = polyUpper - (polyHorner * zhCube); #MAPLE delta3 = zhCube - ZZZ; #MAPLE delta4 = Phl - PE; #MAPLE delta5 = Loghm - LogE; #MAPLE delta6 = P - Log1pZ; #MAPLE delta7 = LogTabPolyhl - LogTabPoly; #MAPLE # End additional { (T2hl - T2) / T2 in [-1b-103,1b-103] /\ (Phl - PE) / PE in [-1b-103,1b-103] /\ (LogTabPolyhl - LogTabPoly) / LogTabPoly in [-1b-103,1b-103] /\ (Loghm - LogE) / LogE in [-1b-103,1b-103] /\ (Log2hm - Log2) / Log2 in [-1b-84,1b-84] /\ (Logihm - Logir) / Logir in [-1b-106,1b-106] /\ Z in [_zmin,_zmax] /\ (P - Log1pZ) / Log1pZ in [-_epsilonApproxQuick,_epsilonApproxQuick] /\ ((logh + logm) - Loghm) / Loghm in [-1b-106,1b-106] -> ((logh + logm) - Log) / Log in [-5b-65,5b-65] } T2hl - T2 -> ((T2hl - T2) / T2) * T2; T2hl -> (T2hl - T2) + T2; Phl - PE -> ((Phl - PE) / PE) * PE; Phl -> (Phl - PE) + PE; LogTabPolyhl -> (LogTabPolyhl - LogTabPoly) + LogTabPoly; Loghm -> (Loghm - LogE) + LogE; Log2 -> Log2hm * (1 / (((Log2hm - Log2) / Log2) + 1)); Logir -> Logihm * (1 / (((Logihm - Logir) / Logir) + 1)); LogTabPolyhl - LogTabPoly -> ((LogTabPolyhl - LogTabPoly) / LogTabPoly) * LogTabPoly; HZZsimp -> (-0.5 * zh * zh) - (0.5 * zl * zl); T2hl - ZpHZZsimp -> (0.5 * zl * zl) + delta1; zhCube - ZZZ -> (Z * (zhSquareh - Z * Z)) - (zl * zhSquareh); polyUpper - ZZZPhigher -> ZZZ * (polyHorner - Phigher) + polyHorner * delta3 + delta2; ZpHZZ + ZZZPhigher -> ZpHZZsimp + ZZZPhigherPzhzl; Phl - P -> (T2hl - ZpHZZsimp) + (T1hl - ZZZPhigherPzhzl) + delta4; Log1pZ -> P * (1 / (((P - Log1pZ) / Log1pZ) + 1)); P - Log1pZ -> ((P - Log1pZ) / Log1pZ) * Log1pZ; Phl - Log1pZ -> (Phl - P) + delta6; LogTabPolyhl - Log1pZpTab -> (Logihm - Logir) + (Phl - Log1pZ) + delta7; Loghm - Log -> (Log2edhm - Log2E) + (LogTabPolyhl - Log1pZpTab) + delta5; (logh + logm) - Loghm -> (((logh + logm) - Loghm) / Loghm) * Loghm; (logh + logm) - Log -> ((logh + logm) - Loghm) + (Loghm - Log);interval-2.1.0/src/crlibm/gappa/sqrt-proof.sh0000755000000000000000000000030713031036767017274 0ustar 00000000000000#/bin/bash GAPPA=~/schorle/gappa/src/gappa echo Proving error bound on sqrt12... sed -f sqrt.sed sqrt12.gappa | $GAPPA echo Proving error bound on sqrt13... sed -f sqrt.sed sqrt13.gappa | $GAPPA interval-2.1.0/src/crlibm/gappa/sqrt.sed0000644000000000000000000000112113031036767016302 0ustar 00000000000000s/_epsilonApprox/3.19769311343973090277659766935447078312230091629790e-03/g s/_ERecSqrtmMin/7.07000000000000000000000000000000000000000000000000e-01/g s/_ERecSqrtmMax/1.41430000000000000000000000000000000000000000000000e+00/g s/_SQRTPOLYC0/2.50385236695888790947606139525305479764938354492188e+00/g s/_SQRTPOLYC1/-3.29763389114324168005509818613063544034957885742188e+00/g s/_SQRTPOLYC2/2.75726076139124520736345402838196605443954467773438e+00/g s/_SQRTPOLYC3/-1.15233725777933848632983426796272397041320800781250e+00/g s/_SQRTPOLYC4/1.86900066679800969104974228685023263096809387207031e-01/g interval-2.1.0/src/crlibm/gappa/sqrt12.gappa0000644000000000000000000001241313031036767016770 0ustar 00000000000000#@ -Eprecision=108 # In this Gappa file, the mathematical values are not # marked with a leading M but with a leading E (for exact) # The reason is that we have already variables starting # with the letter M # Rounding operators and sequences definition @double = float; @Add22 = add_rel<102>; @Mul22 = mul_rel<102>; # Instantiating of constants SQRTPOLYC0 = double(_SQRTPOLYC0); SQRTPOLYC1 = double(_SQRTPOLYC1); SQRTPOLYC2 = double(_SQRTPOLYC2); SQRTPOLYC3 = double(_SQRTPOLYC3); SQRTPOLYC4 = double(_SQRTPOLYC4); # Definition of what is a sqrt # We start with the reciprocal square root. The square root is its reciprocal. # The reduced argument m is the square of its root. ESqrtm = 1 / ERecSqrtm; m = ESqrtm * ESqrtm; ERecM = 1 / m; # Translation of the code r0 double= SQRTPOLYC0 + m * (SQRTPOLYC1 + m * (SQRTPOLYC2 + m * (SQRTPOLYC3 + m * SQRTPOLYC4))); r1 double= (1/2) * r0 * (3 - m * (r0 * r0)); r2 double= (1/2) * r1 * (3 - m * (r1 * r1)); R2Sqhl = r2 * r2; R2PHr2hl = (3/2) * r2; MMr2hl = m * r2; MMr2Chl = Mul22(MMr2hl, R2Sqhl); MHmMr2Chl = -(1/2) * MMr2Chl; R3hl = Add22(R2PHr2hl, MHmMr2Chl); R3Sqhl = Mul22(R3hl,R3hl); MMr3Sqhl = Mul22(m,R3Sqhl); # The next translation of the code is correct only if we can prove that # mMr3Sqh is exactly 1 in each case # We show this below T1 = 1 + -(1/2) * (MMr3Sqhl - 1); R4hl = Mul22(R3hl,T1); Srtmhl = Mul22(m,R4hl); # Show that mMr3Sqh is exactly 1 in each case # We round the double-double result MMr3Sqhl to double # precision and show that the result is in the singleton # interval [1,1] mMr3Sqh = double(MMr3Sqhl); # Mathematical equivalents (marked with E for exact) Er0 = SQRTPOLYC0 + m * (SQRTPOLYC1 + m * (SQRTPOLYC2 + m * (SQRTPOLYC3 + m * SQRTPOLYC4))); Er1 = (1/2) * Er0 * (3 - m * (Er0 * Er0)); Er2 = (1/2) * Er1 * (3 - m * (Er1 * Er1)); #Definition of the errors epsilon = (Srtmhl - ESqrtm) / ESqrtm; epsilonApproxMath0 = (Er0 - ERecSqrtm) / ERecSqrtm; epsilonApproxMath1 = (Er1 - ERecSqrtm) / ERecSqrtm; epsilonApproxMath2 = (Er2 - ERecSqrtm) / ERecSqrtm; epsilonApproxArith0 = (r0 - ERecSqrtm) / ERecSqrtm; epsilonApproxArith1 = (r1 - ERecSqrtm) / ERecSqrtm; epsilonApproxArith2 = (r2 - ERecSqrtm) / ERecSqrtm; epsilonApproxArith3 = (R3hl - ERecSqrtm) / ERecSqrtm; epsilonApproxArith4 = (R4hl - ERecSqrtm) / ERecSqrtm; epsilon0 = (r0 - Er0) / Er0; epsilon1 = (r1 - Er1) / Er1; epsilon2 = (r2 - Er2) / Er2; epsilon3 = ((R2PHr2hl + MHmMr2Chl) - ERecSqrtm) / ERecSqrtm; epsilon4 = ((R3hl * T1) - ERecSqrtm) / ERecSqrtm; epsilon5 = ((T1 - 3/2) - (-1/2 * m * R3hl * R3hl)) / (-1/2 * m * R3hl * R3hl); epsilon6 = (MMr3Sqhl - (m * (R3hl * R3hl))) / (m * (R3hl * R3hl)); epsilon7 = (R3Sqhl - ERecM) / ERecM; epsilon8 = (MMr3Sqhl - 1) / 1; epsilon9 = ((R3hl * R3hl) - ERecM) / ERecM; epsilon10 = ((m * R3Sqhl) - 1) / 1; epsilon11 = ((m * R4hl) - ESqrtm) / ESqrtm; epsilonOp0 = (MMr2Chl - (MMr2hl * R2Sqhl)) / (MMr2hl * R2Sqhl); epsilonOp1 = (R3hl - (R2PHr2hl + MHmMr2Chl)) / (R2PHr2hl + MHmMr2Chl); epsilonOp2 = (R3Sqhl - (R3hl * R3hl)) / (R3hl * R3hl); epsilonOp3 = (MMr3Sqhl - (m * R3Sqhl)) / (m * R3Sqhl); epsilonOp4 = (R4hl - (R3hl * T1)) / (R3hl * T1); epsilonOp5 = (Srtmhl - (m * R4hl)) / (m * R4hl); #Logical implication to prove { ( ERecSqrtm in [_ERecSqrtmMin,_ERecSqrtmMax] /\ epsilonApproxMath0 in [-_epsilonApprox,_epsilonApprox] ) -> ( epsilon in [-1b-100,1b-100] # Accuracy bound /\ mMr3Sqh in [1,1] # For showing that mMr3Sqh is always equal to 1 (see above) ) } # Hints for bounding the variables in the code (not the errors) Er0 -> ERecSqrtm * epsilonApproxMath0 + ERecSqrtm; Er1 -> ERecSqrtm * epsilonApproxMath1 + ERecSqrtm; Er2 -> ERecSqrtm * epsilonApproxMath2 + ERecSqrtm; r0 -> Er0 * epsilon0 + Er0; r1 -> Er1 * epsilon1 + Er1; r2 -> Er2 * epsilon2 + Er2; (R2PHr2hl + MHmMr2Chl) -> ERecSqrtm * epsilon3 + ERecSqrtm; MMr3Sqhl -> 1 + epsilon8; # Hints for the Newton iteration epsilonApproxMath1 -> -3/2 * epsilonApproxMath0 * epsilonApproxMath0 - 1/2 * epsilonApproxMath0 * epsilonApproxMath0 * epsilonApproxMath0; epsilonApproxMath2 -> -3/2 * epsilonApproxMath1 * epsilonApproxMath1 - 1/2 * epsilonApproxMath1 * epsilonApproxMath1 * epsilonApproxMath1; # Hints for the Newton iteration with integrated arithmetical errors epsilon3 -> -3/2 * epsilonApproxArith2 * epsilonApproxArith2 -1/2 * epsilonApproxArith2 * epsilonApproxArith2 * epsilonApproxArith2 -1/2 * epsilonOp0 -3/2 * epsilonApproxArith2 * epsilonOp0 -3/2 * epsilonApproxArith2 * epsilonApproxArith2 * epsilonOp0 -1/2 * epsilonApproxArith2 * epsilonApproxArith2 * epsilonApproxArith2 * epsilonOp0; epsilon5 -> epsilon6; epsilon4 -> -3/2 * epsilonApproxArith3 * epsilonApproxArith3 -1/2 * epsilonApproxArith3 * epsilonApproxArith3 * epsilonApproxArith3 -1/2 * epsilon5 -3/2 * epsilon5 * epsilonApproxArith3 -3/2 * epsilon5 * epsilonApproxArith3 * epsilonApproxArith3 -1/2 * epsilon5 * epsilonApproxArith3 * epsilonApproxArith3 * epsilonApproxArith3; epsilon9 -> 2 * epsilonApproxArith3 + epsilonApproxArith3 * epsilonApproxArith3; epsilon10 -> epsilon7; epsilon11 -> epsilonApproxArith4; # Meta-Hints r0 ~ Er0; r1 ~ Er1; r2 ~ Er2; interval-2.1.0/src/crlibm/gappa/sqrt13.gappa0000644000000000000000000001557713031036767017007 0ustar 00000000000000#@ -Eprecision=108 # In this Gappa file, the mathematical values are not # marked with a leading M but with a leading E (for exact) # The reason is that we have already variables starting # with the letter M # Rounding operators and sequences definition @double = float; @Add22 = add_rel<102>; @Mul22 = mul_rel<102>; # Instantiating of constants SQRTPOLYC0 = double(_SQRTPOLYC0); SQRTPOLYC1 = double(_SQRTPOLYC1); SQRTPOLYC2 = double(_SQRTPOLYC2); SQRTPOLYC3 = double(_SQRTPOLYC3); SQRTPOLYC4 = double(_SQRTPOLYC4); # Definition of what is a sqrt # We start with the reciprocal square root. The square root is its reciprocal. # The reduced argument m is the square of its root. ESqrtm = 1 / ERecSqrtm; m = ESqrtm * ESqrtm; ERecM = 1 / m; # Translation of the code r0 double= SQRTPOLYC0 + m * (SQRTPOLYC1 + m * (SQRTPOLYC2 + m * (SQRTPOLYC3 + m * SQRTPOLYC4))); r1 double= (1/2) * r0 * (3 - m * (r0 * r0)); r2 double= (1/2) * r1 * (3 - m * (r1 * r1)); R2Sqhl = r2 * r2; R2PHr2hl = (3/2) * r2; MMr2hl = m * r2; MMr2Chl = Mul22(MMr2hl, R2Sqhl); MHmMr2Chl = -(1/2) * MMr2Chl; R3hl = Add22(R2PHr2hl, MHmMr2Chl); R3Sqhl = Mul22(R3hl,R3hl); MMr3Sqhl = Mul22(m,R3Sqhl); # The next translation of the code is correct only if we can prove that # mMr3Sqh is exactly 1 in each case # We show this below T1 = 1 + -(1/2) * (MMr3Sqhl - 1); R4hl = Mul22(R3hl,T1); R4Sqhml = mul_rel<149>(R4hl,R4hl); MMr4Sqhml = mul_rel<148>(m,R4Sqhml); # The next translation of the code is correct only if we can prove that # mMr4Sqh is exactly 1 in each case # We show this below T2 = 1 + -(1/2) * (MMr4Sqhml - 1); R5hml = mul_rel<148>(R4hl,T2); Srtmhml = mul_rel<148>(m,R5hml); # Show that mMr3Sqh and mMr4Sqh are exactly 1 in each case # We round the double-double and triple-double results MMr3Sqhl # and MMr3Sqhml to double precision and show that the rounding # result is in the singleton interval [1,1] mMr3Sqh = double(MMr3Sqhl); mMr4Sqh = double(MMr4Sqhml); # Mathematical equivalents (marked with E for exact) Er0 = SQRTPOLYC0 + m * (SQRTPOLYC1 + m * (SQRTPOLYC2 + m * (SQRTPOLYC3 + m * SQRTPOLYC4))); Er1 = (1/2) * Er0 * (3 - m * (Er0 * Er0)); Er2 = (1/2) * Er1 * (3 - m * (Er1 * Er1)); #Definition of the errors epsilon = (Srtmhml - ESqrtm) / ESqrtm; epsilonApproxMath0 = (Er0 - ERecSqrtm) / ERecSqrtm; epsilonApproxMath1 = (Er1 - ERecSqrtm) / ERecSqrtm; epsilonApproxMath2 = (Er2 - ERecSqrtm) / ERecSqrtm; epsilonApproxArith0 = (r0 - ERecSqrtm) / ERecSqrtm; epsilonApproxArith1 = (r1 - ERecSqrtm) / ERecSqrtm; epsilonApproxArith2 = (r2 - ERecSqrtm) / ERecSqrtm; epsilonApproxArith3 = (R3hl - ERecSqrtm) / ERecSqrtm; epsilonApproxArith4 = (R4hl - ERecSqrtm) / ERecSqrtm; epsilonApproxArith5 = (R5hml - ERecSqrtm) / ERecSqrtm; epsilon0 = (r0 - Er0) / Er0; epsilon1 = (r1 - Er1) / Er1; epsilon2 = (r2 - Er2) / Er2; epsilon3 = ((R2PHr2hl + MHmMr2Chl) - ERecSqrtm) / ERecSqrtm; epsilon4 = ((R3hl * T1) - ERecSqrtm) / ERecSqrtm; epsilon5 = ((T1 - 3/2) - (-1/2 * m * R3hl * R3hl)) / (-1/2 * m * R3hl * R3hl); epsilon6 = (MMr3Sqhl - (m * (R3hl * R3hl))) / (m * (R3hl * R3hl)); epsilon7 = (R3Sqhl - ERecM) / ERecM; epsilon8 = (MMr3Sqhl - 1) / 1; epsilon9 = ((R3hl * R3hl) - ERecM) / ERecM; epsilon10 = ((m * R3Sqhl) - 1) / 1; epsilon11 = ((T2 - 3/2) - (-1/2 * m * R4hl * R4hl)) / (-1/2 * m * R4hl * R4hl); epsilon12 = (MMr4Sqhml - (m * (R4hl * R4hl))) / (m * (R4hl * R4hl)); epsilon13 = ((R4hl * T2) - ERecSqrtm) / ERecSqrtm; epsilon14 = (MMr4Sqhml - 1) / 1; epsilon15 = (R4Sqhml - ERecM) / ERecM; epsilon16 = ((R4hl * R4hl) - ERecM) / ERecM; epsilon17 = ((m * R4Sqhml) - 1) / 1; epsilon18 = ((m * R5hml) - ESqrtm) / ESqrtm; epsilonOp0 = (MMr2Chl - (MMr2hl * R2Sqhl)) / (MMr2hl * R2Sqhl); epsilonOp1 = (R3hl - (R2PHr2hl + MHmMr2Chl)) / (R2PHr2hl + MHmMr2Chl); epsilonOp2 = (R3Sqhl - (R3hl * R3hl)) / (R3hl * R3hl); epsilonOp3 = (MMr3Sqhl - (m * R3Sqhl)) / (m * R3Sqhl); epsilonOp4 = (R4hl - (R3hl * T1)) / (R3hl * T1); epsilonOp5 = (R4Sqhml - (R4hl * R4hl)) / (R4hl * R4hl); epsilonOp6 = (MMr4Sqhml - (m * R4Sqhml)) / (m * R4Sqhml); epsilonOp7 = (R5hml - (R4hl * T2)) / (R4hl * T2); #Logical implication to prove { ( ERecSqrtm in [_ERecSqrtmMin,_ERecSqrtmMax] /\ epsilonApproxMath0 in [-_epsilonApprox,_epsilonApprox] ) -> ( epsilon in [-1b-146,1b-146] # Accuracy bound /\ mMr3Sqh in [1,1] # For showing that mMr3Sqh is always equal to 1 (see above) /\ mMr4Sqh in [1,1] # For showing that mMr4Sqh is always equal to 1 (see above) ) } # Hints for bounding the variables in the code (not the errors) Er0 -> ERecSqrtm * epsilonApproxMath0 + ERecSqrtm; Er1 -> ERecSqrtm * epsilonApproxMath1 + ERecSqrtm; Er2 -> ERecSqrtm * epsilonApproxMath2 + ERecSqrtm; r0 -> Er0 * epsilon0 + Er0; r1 -> Er1 * epsilon1 + Er1; r2 -> Er2 * epsilon2 + Er2; (R2PHr2hl + MHmMr2Chl) -> ERecSqrtm * epsilon3 + ERecSqrtm; MMr3Sqhl -> 1 + epsilon8; MMr4Sqhml -> 1 + epsilon14; # Hints for the Newton iteration epsilonApproxMath1 -> -3/2 * epsilonApproxMath0 * epsilonApproxMath0 - 1/2 * epsilonApproxMath0 * epsilonApproxMath0 * epsilonApproxMath0; epsilonApproxMath2 -> -3/2 * epsilonApproxMath1 * epsilonApproxMath1 - 1/2 * epsilonApproxMath1 * epsilonApproxMath1 * epsilonApproxMath1; # Hints for the Newton iteration with integrated arithmetical errors epsilon3 -> -3/2 * epsilonApproxArith2 * epsilonApproxArith2 -1/2 * epsilonApproxArith2 * epsilonApproxArith2 * epsilonApproxArith2 -1/2 * epsilonOp0 -3/2 * epsilonApproxArith2 * epsilonOp0 -3/2 * epsilonApproxArith2 * epsilonApproxArith2 * epsilonOp0 -1/2 * epsilonApproxArith2 * epsilonApproxArith2 * epsilonApproxArith2 * epsilonOp0; epsilon5 -> epsilon6; epsilon4 -> -3/2 * epsilonApproxArith3 * epsilonApproxArith3 -1/2 * epsilonApproxArith3 * epsilonApproxArith3 * epsilonApproxArith3 -1/2 * epsilon5 -3/2 * epsilon5 * epsilonApproxArith3 -3/2 * epsilon5 * epsilonApproxArith3 * epsilonApproxArith3 -1/2 * epsilon5 * epsilonApproxArith3 * epsilonApproxArith3 * epsilonApproxArith3; epsilon9 -> 2 * epsilonApproxArith3 + epsilonApproxArith3 * epsilonApproxArith3; epsilon10 -> epsilon7; epsilon11 -> epsilon12; epsilon13 -> -3/2 * epsilonApproxArith4 * epsilonApproxArith4 -1/2 * epsilonApproxArith4 * epsilonApproxArith4 * epsilonApproxArith4 -1/2 * epsilon11 -3/2 * epsilon11 * epsilonApproxArith4 -3/2 * epsilon11 * epsilonApproxArith4 * epsilonApproxArith4 -1/2 * epsilon11 * epsilonApproxArith4 * epsilonApproxArith4 * epsilonApproxArith4; epsilon16 -> 2 * epsilonApproxArith4 + epsilonApproxArith4 * epsilonApproxArith4; epsilon17 -> epsilon15; epsilon18 -> epsilonApproxArith5; # Meta-Hints r0 ~ Er0; r1 ~ Er1; r2 ~ Er2; interval-2.1.0/src/crlibm/gappa/trigos/SinCosCase3.gappa0000644000000000000000000002125013031036767021217 0ustar 00000000000000# Usage: You need to set the constants cah, cal, sah, sal. Running the trigo.mpl Maple script # should create 64 files in maple/TEMPTRIG, which can be tested independently as # sed -f ../maple/TEMPTRIG/SinACosA_1.sed trigoSinCosCase3.gappa | ~/gappa/src/gappa > /dev/null # NOTATION CONVENTION # Variables that correspond to double-precision variables in the code begin with a small letter # Other variables begin with a capital letter. # Variables that will be replaced with Maple-computed constants begin with an underscore # Otherwise avoid underscores as they are painful to carry on to LaTeX :) # Rounding operators and sequences definition @IEEEdouble = float; # polynomial coefficients, computed by Maple s3 = IEEEdouble(_s3); s5 = IEEEdouble(_s5); s7 = IEEEdouble(_s7); c2 = IEEEdouble(_c2); c4 = IEEEdouble(_c4); c6 = IEEEdouble(_c6); # Table values, computed by Maple cah = IEEEdouble(_cah); cal = IEEEdouble(_cal); sah = IEEEdouble(_sah); sal = IEEEdouble(_sal); # The variables used here: # x input # My perfect reduced argument # Yhl = yh+yl, his distance to My is specified as an hypothesis # Mts perfect ts # Mtc perfect tc # Msinx exact result for sin(x) # Msina, Mcosa perfect sin(kPi/256) and cos(kPi/256) yh = IEEEdouble(Yhl); yl = Yhl - yh; ####################################################################### # First, a transcription of the actual computation, which could (and # should eventually) be generated automatically from the actual code # ---------------------Code shared by sin and cos, cut from ComputeTrigWithArgRed : yh2 IEEEdouble= yh * yh; ts IEEEdouble= yh2 * (s3 + yh2*(s5 + yh2*s7)); tc IEEEdouble= yh2 * (c2 + yh2*(c4 + yh2*c6)); # ---------------------Code for the sine, cut from DosinNotZero: # Mul12(&cahyh_h,&cahyh_l, cah, yh); cahyh = cah * yh; cahyh_h = IEEEdouble(cahyh); cahyh_l = cahyh - cahyh_h; # Exact equation because Mul12 is exact # Add12(thi, tlo, sah, cahyh_h); TSin = sah + cahyh_h; thiSin = IEEEdouble(TSin); tloSin1 = TSin - thiSin; # Exact equation because Add12 is exact # Rem: need to Rename tlo to tloSin1, and its second use to tloSin2. # It would be safer to translate code to single-assignment before # using Gappa, modern compilers won't make any difference. # tlo = tc*sah+(ts*cahyh_h+(sal+(tlo+(cahyh_l+(cal*yh + cah*yl))))) ; tloSin2 IEEEdouble= tc*sah + (ts*cahyh_h + (sal + (tloSin1 + (cahyh_l + (cal*yh + cah*yl))))); # Add12(*reshi, *reslo, thi, tlo); ResSinhilo = thiSin + tloSin2; # we don't need to split it for the proof. # ---------------------Code for the cos, cut from DoCosNotZero: # Mul12(&sahyh_h,&sahyh_l, sah, yh); sahyh = sah * yh; sahyh_h = IEEEdouble(sahyh); sahyh_l = sahyh - sahyh_h; # Exact equation because Mul12 is exact # Add12(thi, tlo, cah, -sahyh_h); TCos = cah - sahyh_h; thiCos = IEEEdouble(TCos); tloCos1 = TCos - thiCos; # Exact equation because Add12 is exact # tlo = tc*sah+(ts*cahyh_h+(sal+(tlo+(cahyh_l+(cal*yh + cah*yl))))) ; tloCos2 IEEEdouble= tc*cah-(ts*sahyh_h-(cal+(tloCos1-(sahyh_l+(sal*yh+sah*yl))))) ; # Add12(*pch, *pcl, thi, tlo); ResCoshilo = thiCos + tloCos2; # No need to split it for the proof. ####################################################################### #Definitions of the mathematical objects #------------------------------------- #With these notations, the exact sine and cosine are given by these #exact mathematical formulae Msinx = Msiny * Mcosa + Mcosy * Msina; Mcosx = Mcosy * Mcosa - Msiny * Msina; # Now let us pile up layers of approximations #------------------------------------- # yh2 is an approximation to : My2 = My*My; # through three layers: # 1/ Yhl=yh+hl = My +/- delta_ArgRed : in the hypotheses below # 2/ yh = Yhl - yl : already written # 3/ rounding error in the mult : already written #------------------------------------- # ts is an approximation to : Mts = My2 * (s3 + My2*(s5 + My2*s7)); # through two layers: # 1/ the approximation y2 of My2 : done just above # 2/ the rounding errors in Horner : already written #------------------------------------- PolySinY = My * (1 + Mts); # PolySinY is an approximation to sin(My) as expressed in the hypotheses below : # PolySinY - Msiny in [-0.24126e-23, 0.24126e-23] # delta_approx_Sin_Case3 #------------------------------------- # Same for PolyCosY Mtc = My2 * (c2 +(My2 * (c4 + (My2 * c6)))); PolyCosY = 1 + Mtc; #------------------------------------- #tc is an approximation to Mtc through the rounding errors, defined #in the definition of tc. Same for ts #------------------------------------- # SinReconstrExact is an approximation to ResSinhilo SinReconstrExact = PolySinY * Mcosa + PolyCosY * Msina ; # The delta between ResSinhilo and SinReconstrExact is due to the two # mathematical poly approx, and has been defined just above CosReconstrExact = PolyCosY * Mcosa - PolySinY * Msina ; #------------------------------------- # The reconstruction approximates the following SinReconstrNoRound = Yhl*(1 + ts)*(cah+cal) + (1 + tc)*(sah+sal); # where Yhl is an approximation to Y # ts is an approximation to Mts # tc is an approximation to Mtc : all already described # All what we still need to express is that the actual computation will neglect some terms CosReconstrNoRound = ( (1 + tc) * (cah+cal) - Yhl * (1 + ts) * (sah+sal) ); #------------------------------------- # tloSin2 is an approximation to TloSin2NoRound (because of rounding error in the operations, already described) TloSin2NoRound = tc*sah+(ts*cahyh_h+(sal+(tloSin1+(cahyh_l+(cal*yh+cah*yl))))) ; TloCos2NoRound = tc*cah-(ts*sahyh_h-(cal+(tloCos1-(sahyh_l+(sal*yh+sah*yl))))); # tloSinNoRound is an approximation to SinReconstrNoRound - tSinhi, the # difference being the neglected terms. This error will be given as an hint NeglectedSinTerms = SinReconstrNoRound - (thiSin + TloSin2NoRound); NeglectedCosTerms = CosReconstrNoRound - (thiCos + TloCos2NoRound); # And finally, ResSinhilo is an approximation to Msinx through many layers which are given in the hints. ########################################################################################### # The theorem to prove { # (Yhl in [-_ymaxCase3, -1b-200] \/ Yhl in [-1b-200, _ymaxCase3]) # computed by Maple Yhl in [-_ymaxCase3, _ymaxCase3] # computed by Maple /\ Yhl - My in [-_delta_ArgRed, _delta_ArgRed] # computed by Maple /\ PolySinY - Msiny in [-_delta_approx_Sin_Case3, _delta_approx_Sin_Case3] # computed by Maple /\ PolyCosY - Mcosy in [-_delta_approx_Cos_Case3, _delta_approx_Cos_Case3] # computed by Maple /\ Msina-sah-sal in [-1b-104, 1b-104] /\ Mcosa-cah-cal in [-1b-104, 1b-104] # double-double absolute rounding error, with margin -> (ResSinhilo - Msinx)/Msinx in [-3b-66,3b-66] /\ (ResCoshilo - Mcosx)/Mcosx in [-3b-66,3b-66] } ########################################################################################### # Hints to the reduction engine: Gappa is not supposed to be clever, it's an assistant # To get bounds on Msinx, try ResSinhilo Msinx -> ResSinhilo - (ResSinhilo - Msinx); Mcosx -> ResCoshilo - (ResCoshilo - Mcosx); # To get bounds on Msina, try sah+sal Msina -> sah + sal + (Msina - sah - sal); Mcosa -> cah + cal + (Mcosa - cah - cal); # To get bounds on My, try Yhl My -> Yhl - (Yhl - My); # One layer of approx error, and one layer of rounding error for Msiny and Mcosy 1 + tc - Mcosy -> (1 + tc - PolyCosY) + (PolyCosY - Mcosy); (My + My * ts) - Msiny -> ((My + My * ts) - PolySinY) + (PolySinY - Msiny); # Layers of approximations ResSinhilo - Msinx -> (ResSinhilo - SinReconstrNoRound) + (SinReconstrNoRound - SinReconstrExact) + (SinReconstrExact - Msinx); ResCoshilo - Mcosx -> (ResCoshilo - CosReconstrNoRound) + (CosReconstrNoRound - CosReconstrExact) + (CosReconstrExact - Mcosx); NeglectedSinTerms -> sal*tc + cal*yl + ts*(cahyh_l + cah*yl + cal*yh + cal*yl); ResSinhilo - SinReconstrNoRound -> (ResSinhilo - (thiSin + TloSin2NoRound)) - (SinReconstrNoRound - (thiSin + TloSin2NoRound)) ; NeglectedCosTerms -> cal*tc - sal*yl - ts*(sahyh_l + sah*yl + sal*yh + sal*yl); ResCoshilo - CosReconstrNoRound -> (ResCoshilo - (thiCos + TloCos2NoRound)) - (CosReconstrNoRound - (thiCos + TloCos2NoRound)) ; Yhl*(1 + ts)*(cah+cal) - PolySinY * Mcosa -> (Yhl*(1 + ts)- PolySinY)*(cah+cal) - PolySinY*(Mcosa - cah - cal) ; (1 + tc) * (cah+cal) - PolyCosY * Mcosa -> ((1 + tc)- PolyCosY) * (cah+cal) - PolyCosY * (Mcosa - cah -cal); (1 + tc)*(sah+sal) - PolyCosY * Msina -> ((1 + tc)- PolyCosY) * (sah+sal) - PolyCosY * (Msina - sah -sal); interval-2.1.0/src/crlibm/gappa/trigos/SinZero.gappa0000644000000000000000000001317713031036767020544 0ustar 00000000000000# test with gappa -Munconstrained < sin.gappa # The proof is not complete, as it doesn't work without -Munconstrained. # What it means is that Gappa is unable to prove that some denominators are not null. # It's OK to me but it takes some more work to get a formal proof. @IEEEdouble = float; # Convention 1: uncapitalized variables match the variables in the C code. Other variables begin with a capital letter # Convention 2: variables beginning with "M" are mathematical ideal # yh+yl is a double-double (call it Yhl) yh = IEEEdouble(Yhl); yl = Yhl-yh; # The following, along with one hypothesis, ensures that yl is a double, too. dummyZero = IEEEdouble(yl)-yl; #--------------- Transcription of the C code -------------------------- s3 = IEEEdouble(-1.6666666666666665741480812812369549646974e-01); s5 = IEEEdouble(8.3333333333333332176851016015461937058717e-03); s7 = IEEEdouble(-1.9841269841269841252631711547849135968136e-04); yh2 IEEEdouble= yh * yh; ts IEEEdouble= yh2 * (s3 + yh2*(s5 + yh2*s7)); r IEEEdouble= yl + yh*ts; s = yh + r; # no rounding, it is the Fast2Sum #-------- Mathematical definition of what we are approximating -------- My2 = My*My; Mts = My2 * (s3 + My2*(s5 + My2*s7)); PolySinY = My + My*Mts; epsargred = (Yhl - My)/My; epstotal = (s - SinY)/SinY; epsapprox = (PolySinY - SinY)/SinY; epsround = (s - PolySinY)/PolySinY; # Layers of approximation on s S1 = yh + (yl + IEEEdouble(yh*ts)); # remove last round S2 = yh + (yl + yh*ts); # remove penultimate round S3 = (yh+yl) + (yh+yl)*ts; # put yl back in eps1 = (s-S1)/S1; eps2 = (S1-S2)/S2; eps3 = (S2-S3)/S3; eps4 = (S3-PolySinY)/PolySinY; yhts = IEEEdouble(yh*ts); # just to make the hints lighter p3 IEEEdouble= s3 + yh2*(s5 + yh2*s7); # idem tsNoRound = yh2 * (s3 + yh2*(s5 + yh2*s7)); epsy2 = (yh2-My2)/My2; epsy2_argred = (Yhl*Yhl-My2)/My2; epsy2_negl_yl = (yh*yh-Yhl*Yhl)/(Yhl*Yhl); epsy2_rnd = (yh2-yh*yh)/(yh*yh); #---------------------- The theorem to prove -------------------------- { # Hypotheses (Yhl in [1b-200, 6.29e-03] \/ Yhl in [ -6.29e-03, -1b-200]) # lower bound guaranteed by Kahan-Douglas algorithm /\ epsargred in [-2.53e-23, 2.53e-23] /\ epsapprox in [-2.26e-24, 2.26e-24] /\ (yl in [1b-200, 6.29e-03] \/ yl in [-6.29e-03, -1b-200]) /\ dummyZero in [0, 0] -> #goal to prove epstotal in ?# [-1b-67, 1b-67] #/\ |s| in ? # At the moment it contains zero } # Yes, it takes one definition, one hypothesis and one hint to manage a double-double input. yl -> IEEEdouble(yl) - dummyZero; # First, some hints for epsy2 # Combination of three relative errors epsy2 -> epsy2_negl_yl + epsy2_rnd + epsy2_argred + epsy2_negl_yl*epsy2_rnd + epsy2_negl_yl*epsy2_argred + epsy2_rnd*epsy2_argred + epsy2_negl_yl*epsy2_rnd*epsy2_argred; # Rewriting hint to remove decorrelation epsy2_argred -> # (epsargred+1)*(epsargred+1) - 1; epsargred*(epsargred + 2); # Another one epsy2_negl_yl -> # (yh*yh-(Yhl*Yhl))/(Yhl*Yhl); # (yh*yh-((yh+yl)*(yh+yl))) / ((yh+yl)*(yh+yl)); # (-2*yh*yl -yl*yl) / (yh*yh + 2*yh*yl + yl*yl); (-2*yl -yl*yl/yh) / (yh + 2*yl + yl*yl/yh) ; # Now the hints for epsround s~S1; S1~S2; S2~S3; S3~PolySinY; eps4 -> # (S3-PolySinY)/PolySinY; # S3/PolySinY - 1; # ((yh+yl) + (yh+yl)*ts) / (My + My*Mts) - 1; # ((yh+yl)/My) * (1+ts)/(1+Mts) - 1; # (epsargred+1) * (1+ts)/(1+Mts) - 1; # epsargred * (1+ts)/(1+Mts) + 1 * (1+ts)/(1+Mts) - 1; # epsargred * (1+ts)/(1+Mts) + (ts-Mts)/(1+Mts); epsargred * (1+ts)/(1+Mts) + Mts*((ts-Mts)/Mts) / (1+Mts); # Now we just need to bound ts-Mts: ts ~ tsNoRound; (tsNoRound - Mts)/Mts -> # yh2/My2 * (s3 + yh2*(s5 + yh2*s7)) / (s3 + My2*(s5 + My2*s7)) - 1 ; (1+epsy2) * (s3 + yh2*(s5 + yh2*s7)) / (s3 + My2*(s5 + My2*s7)) -1; # Now we just need to express My2 in terms of yh2 and epsy2 My2 -> yh2/(1+epsy2); eps3 -> #(S2-S3)/S3 # S2/S3 - 1; # (yh + (yl + yh*ts)) / ((yh+yl) + (yh+yl)*ts) - 1 ; # ((yh+yl) + (yh+yl)*ts - yl*ts) / ((yh+yl) + (yh+yl)*ts) - 1 ; # - yl*ts / ((yh+yl) + (yh+yl)*ts) ; # - (yl/Yhl) * (ts / (1+ts)) ; ((yh-Yhl)/Yhl) * (ts / (1+ts)) ; # change sign to have the expression of a rounding error eps2 -> # (S1-S2)/S2; # (yh + (yl + IEEEdouble(yh*ts))) / (yh + (yl + yh*ts)) -1 ; # (IEEEdouble(yh*ts) - yh*ts) / (yh + yl + yh*ts) ; # ((IEEEdouble(yh*ts) - yh*ts)/(yh*ts)) / ( (yh+yl)/(yh*ts) + 1 ) ; # ts * ((IEEEdouble(yh*ts) - yh*ts)/(yh*ts)) / ( 1 + yl/yh + ts ) ; # Almost OK, just the denominator is poorly bounded ts * ((IEEEdouble(yh*ts) - yh*ts)/(yh*ts)) / ( 1/(1+(yh-Yhl)/Yhl) + ts ) ; yl/yh -> - ((yh-Yhl)/Yhl) / (1+(yh-Yhl)/Yhl); yhts/yh -> ts*((yhts-yh*ts)/(yh*ts) + 1); # !here the most difficult bit. #eps1 -> #(s-S1)/S1; # (IEEEdouble(yl+yhts) - (yl+yhts)) / (yh + yl + yhts); # First make a rounding error appear at the numerator, and factor yh in the denominator, using the hints for yh/yl and yhts/yh below # ((IEEEdouble(yl+yhts) - (yl+yhts))/((yl+yhts)) ) * (yl/yh + yhts/yh) / (1 + yl/yh + yhts/yh); # Now denominator is OK, problem is that numerator needs a proof that yl+yhts is not equal to zero. (yl+yhts)/yh -> yl/yh + yhts/yh; #Hints for epstotal epstotal -> epsapprox + epsround + epsapprox*epsround; # The following are hints added to remove the -Munconstrained PolySinY -> My*(1+Mts); # To show that s doesn't go through zero, we have to make a correlation appear between yl and yh in the sum below: #s -> yh + IEEEdouble(yl + IEEEdouble(yh*ts)); s -> yh * (1+ IEEEdouble(yl + IEEEdouble(yh*ts) )/yh ); interval-2.1.0/src/crlibm/gappa/trigos/TanCase2.gappa0000644000000000000000000000422713031036767020547 0ustar 00000000000000# Usage: You need to replace a few constants (beginning by _) by numerical # values. Running the trigo.mpl Maple script will generate a # TEMPTRIG/tanCase2.sed sed script that does it. # Then sed -f TEMPTRIG/TanCase2.sed trigoTanCase2.gappa | gappa > /dev/null # NOTATION CONVENTION # Variables that correspond to double-precision variables in the code begin with a small letter # Other variables begin with a capital letter. # Otherwise avoid underscores as they are painful to carry on to LaTeX :) # Definition of the polynomial constants: t11 = (_t11); t9 = (_t9); t7 = (_t7); t5 = (_t5); t3h = (_t3h); t3l = (_t3l); ####################################################################### # First, a transcription of the actual computation, which could (and # should eventually) be generated automatically from the actual code # ---------------------Code cut from tan_rn : # x2 = x*x; x2 = x * x; X2 = x*x; # p5 = t5 + x2*(t7 + x2*(t9 + x2*t11)); p5 = t5 + x2*(t7 + x2*(t9 + x2*t11)); P5 = t5 + X2*(t7 + X2*(t9 + X2*t11)); # tt = x2*(t3h + (t3l + x2*p5)); tt = x2*(t3h + (t3l + x2*p5)); Tt = X2*(t3h + (t3l + X2*p5)); # Add12(rri.rh, rri.rl, x, x*tt); rdd = x + (x*tt); # The Add12 is exact Poly = x+x*Tt; epsilon=(rdd - TanX)/TanX; { x in [1b-30, _xmax] /\ (Poly - TanX)/TanX in [-_maxEpsApprox, _maxEpsApprox] /\ ((Poly - TanX)/TanX)/x in [-_maxEpsApproxOverX, _maxEpsApproxOverX] -> epsilon in ? /\ epsilon/x in [-1b-56,1b-56] } # Use a dichotomy on x to get an interval of epsilon/x epsilon/x $ x; # The usual hint for relative errors, with an additional /x*x so that Gappa uses the Maple-computed mathematical bound (rdd - TanX)/TanX -> (rdd - Poly)/Poly + (((Poly - TanX)/TanX)/x)*x + ((rdd - Poly)/Poly) * ((Poly - TanX)/TanX) ; (rdd - Poly)/Poly -> (((x*tt) - x*Tt) / x) * (x/Poly); # I'm not sure I understand why this one improves the result ((x*tt) - x*Tt)/x -> (((x*tt) - x*tt)/(x*tt)) * tt + (tt - Tt); # Easy hints x/Poly -> 1/(Poly/x); Poly/x -> 1+Tt; interval-2.1.0/src/crlibm/gappa/trigpi/cospi-accurate.gappa0000644000000000000000000001671213031036767022042 0ustar 00000000000000# The polynomial to implement is: 1b0 + ((x^(1b1)) * ((-50044839772224400049002264095087b-103) + ((x^(1b1)) * (10290057726411619042605446323595b-101 + ((x^(1b1)) * ((-3006744454127613b-51) + ((x^(1b1)) * (4239339756765869b-54 + ((x^(1b1)) * (-7438313106810207b-58)))))))))) # The polynomial implemented is: 1b0 + ((x^(1b1)) * ((-50044839772224400049002264095087b-103) + ((x^(1b1)) * (10290057726411619042605446323595b-101 + ((x^(1b1)) * ((-3006744454127613b-51) + ((x^(1b1)) * (4239339756765869b-54 + ((x^(1b1)) * (-7438313106810207b-58)))))))))) # The domain is [-1b-8;1b-8] # The free variable x is a double precision number, the result cospiprecise_res* is stored on a triple-double number. # The code produces 17 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code cospiprecise_coeff_0h = double(1.00000000000000000000000000000000000000000000000000000000000000000000000000000000e+00); cospiprecise_coeff_2h = double(-4.93480220054467899615247006295248866081237792968750000000000000000000000000000000e+00); cospiprecise_coeff_2m = double(-3.13264775437072047133490817894057799839785556899468543790021612949203699827194214e-16); cospiprecise_coeff_2hm = cospiprecise_coeff_2h + cospiprecise_coeff_2m; cospiprecise_coeff_4h = double(4.05871212641676848420502210501581430435180664062500000000000000000000000000000000e+00); cospiprecise_coeff_4m = double(-2.66019969731660223662555032718185048048635055542576743903282476821914315223693848e-16); cospiprecise_coeff_4hm = cospiprecise_coeff_4h + cospiprecise_coeff_4m; cospiprecise_coeff_6h = double(-1.33526276885458949905682857206556946039199829101562500000000000000000000000000000e+00); cospiprecise_coeff_8h = double(2.35330630358513925859398341344785876572132110595703125000000000000000000000000000e-01); cospiprecise_coeff_10h = double(-2.58068327360992909313974763563237502239644527435302734375000000000000000000000000e-02); cospiprecise_x_0_pow2hm = xh * xh; cospiprecise_x_0_pow2h = double(cospiprecise_x_0_pow2hm); cospiprecise_x_0_pow2m = cospiprecise_x_0_pow2hm - cospiprecise_x_0_pow2h; cospiprecise_t_1_0h = cospiprecise_coeff_10h; cospiprecise_t_2_0h = double(cospiprecise_t_1_0h * cospiprecise_x_0_pow2h); cospiprecise_t_3_0h = double(cospiprecise_coeff_8h + cospiprecise_t_2_0h); cospiprecise_t_4_0h = double(cospiprecise_t_3_0h * cospiprecise_x_0_pow2h); cospiprecise_t_5_0hm = cospiprecise_coeff_6h + cospiprecise_t_4_0h; cospiprecise_t_5_0h = double(cospiprecise_t_5_0hm); cospiprecise_t_5_0m = cospiprecise_t_5_0hm - cospiprecise_t_5_0h; cospiprecise_t_6_0hm = fma_rel<100>(cospiprecise_t_5_0hm,cospiprecise_x_0_pow2hm,cospiprecise_coeff_4hm); cospiprecise_t_6_0h = double(cospiprecise_t_6_0hm); cospiprecise_t_6_0m = cospiprecise_t_6_0hm - cospiprecise_t_6_0h; cospiprecise_t_7_0hm = fma_rel<100>(cospiprecise_t_6_0hm,cospiprecise_x_0_pow2hm,cospiprecise_coeff_2hm); cospiprecise_t_7_0h = double(cospiprecise_t_7_0hm); cospiprecise_t_7_0m = cospiprecise_t_7_0hm - cospiprecise_t_7_0h; cospiprecise_t_8_0hm = mul_rel<102>(cospiprecise_t_7_0hm,cospiprecise_x_0_pow2hm); cospiprecise_t_8_0h = double(cospiprecise_t_8_0hm); cospiprecise_t_8_0m = cospiprecise_t_8_0hm - cospiprecise_t_8_0h; cospiprecise_t_9_0hml = add_rel<159>(cospiprecise_coeff_0h,cospiprecise_t_8_0hm); cospiprecise_t_9_0ml = cospiprecise_t_9_0hml - cospiprecise_t_9_0h; cospiprecise_t_9_0m = double(cospiprecise_t_9_0ml); cospiprecise_t_9_0l = cospiprecise_t_9_0ml - cospiprecise_t_9_0m; cospiprecise_t_9_0hm = cospiprecise_t_9_0h + cospiprecise_t_9_0m; overlap_cospiprecise_t_9_0 = cospiprecise_t_9_0m / cospiprecise_t_9_0h; cospiprecise_reshml = cospiprecise_t_9_0hml; cospiprecise_reshm = cospiprecise_t_9_0hm; cospiprecise_resml = cospiprecise_t_9_0ml; cospiprecise_resh = cospiprecise_t_9_0h; cospiprecise_resm = cospiprecise_t_9_0m; cospiprecise_resl = cospiprecise_t_9_0l; overlap_cospiprecise_res = overlap_cospiprecise_t_9_0; # Mathematical equivalents Mx = x; Mcospiprecise_coeff_0 = cospiprecise_coeff_0h; Mcospiprecise_coeff_2 = cospiprecise_coeff_2hm; Mcospiprecise_coeff_4 = cospiprecise_coeff_4hm; Mcospiprecise_coeff_6 = cospiprecise_coeff_6h; Mcospiprecise_coeff_8 = cospiprecise_coeff_8h; Mcospiprecise_coeff_10 = cospiprecise_coeff_10h; Mcospiprecise_x_0_pow2 = Mx * Mx; Mcospiprecise_t_1_0 = Mcospiprecise_coeff_10; Mcospiprecise_t_2_0 = Mcospiprecise_t_1_0 * Mcospiprecise_x_0_pow2; Mcospiprecise_t_3_0 = Mcospiprecise_coeff_8 + Mcospiprecise_t_2_0; Mcospiprecise_t_4_0 = Mcospiprecise_t_3_0 * Mcospiprecise_x_0_pow2; Mcospiprecise_t_5_0 = Mcospiprecise_coeff_6 + Mcospiprecise_t_4_0; Mcospiprecise_t_6_0 = (Mcospiprecise_t_5_0 * Mcospiprecise_x_0_pow2) + Mcospiprecise_coeff_4; Mcospiprecise_t_7_0 = (Mcospiprecise_t_6_0 * Mcospiprecise_x_0_pow2) + Mcospiprecise_coeff_2; Mcospiprecise_t_8_0 = Mcospiprecise_t_7_0 * Mcospiprecise_x_0_pow2; Mcospiprecise_t_9_0 = Mcospiprecise_coeff_0 + Mcospiprecise_t_8_0; Mcospiprecise_res = Mcospiprecise_t_9_0; # Definition of the relative arithmetical error epsilon = (cospiprecise_reshml - Mcospiprecise_res) / Mcospiprecise_res; # Implication to prove {(( x in [-1b-8,-1b-408] /\ |overlap_cospiprecise_t_9_0| in [1b-400,1b-52] # Verify the lower bound /\ |cospiprecise_t_9_0ml| in [1b-1021,1b1023] ) \/ ( x in [1b-408,1b-8] /\ |overlap_cospiprecise_t_9_0| in [1b-400,1b-52] # Verify the lower bound /\ |cospiprecise_t_9_0ml| in [1b-1021,1b1023] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition cospiprecise_x_0_pow2h ~ cospiprecise_x_0_pow2hm; cospiprecise_t_5_0h ~ cospiprecise_t_5_0hm; cospiprecise_t_6_0h ~ cospiprecise_t_6_0hm; cospiprecise_t_7_0h ~ cospiprecise_t_7_0hm; cospiprecise_t_8_0h ~ cospiprecise_t_8_0hm; cospiprecise_t_9_0hm ~ cospiprecise_t_9_0hml; cospiprecise_t_9_0h ~ cospiprecise_t_9_0hm; cospiprecise_t_9_0h ~ cospiprecise_t_9_0hml; cospiprecise_t_9_0m -> cospiprecise_t_9_0h * overlap_cospiprecise_t_9_0; cospiprecise_t_9_0l / cospiprecise_t_9_0m -> - ((cospiprecise_t_9_0m - cospiprecise_t_9_0ml) / cospiprecise_t_9_0ml) / (1 + ((cospiprecise_t_9_0m - cospiprecise_t_9_0ml) / cospiprecise_t_9_0ml)); (cospiprecise_t_9_0hm - cospiprecise_t_9_0hml) / cospiprecise_t_9_0hml -> - (cospiprecise_t_9_0l / cospiprecise_t_9_0m) * (1 / (1 / overlap_cospiprecise_t_9_0 + 1 + (cospiprecise_t_9_0l / cospiprecise_t_9_0m))); cospiprecise_t_9_0ml -> cospiprecise_t_9_0hml / ((1 + ((cospiprecise_t_9_0m - cospiprecise_t_9_0ml) / cospiprecise_t_9_0ml)) / overlap_cospiprecise_t_9_0 + 1); (cospiprecise_t_9_0h - cospiprecise_t_9_0hm) / cospiprecise_t_9_0hm -> - 1 / (1 / overlap_cospiprecise_t_9_0 + 1); cospiprecise_t_9_0h -> cospiprecise_t_9_0hml / (overlap_cospiprecise_t_9_0 / (1 + ((cospiprecise_t_9_0m - cospiprecise_t_9_0ml) / cospiprecise_t_9_0ml)) + 1); # Meta-Hints for Horner scheme cospiprecise_x_0_pow2hm ~ Mcospiprecise_x_0_pow2; cospiprecise_t_1_0h ~ Mcospiprecise_t_1_0; cospiprecise_t_2_0h ~ Mcospiprecise_t_2_0; cospiprecise_t_3_0h ~ Mcospiprecise_t_3_0; cospiprecise_t_4_0h ~ Mcospiprecise_t_4_0; cospiprecise_t_5_0hm ~ Mcospiprecise_t_5_0; cospiprecise_t_6_0hm ~ Mcospiprecise_t_6_0; cospiprecise_t_7_0hm ~ Mcospiprecise_t_7_0; cospiprecise_t_8_0hm ~ Mcospiprecise_t_8_0; cospiprecise_t_9_0hml ~ Mcospiprecise_t_9_0; cospiprecise_reshml ~ Mcospiprecise_res; # Dichotomies for triple-double decomposition $ cospiprecise_t_9_0hml in (0); $ cospiprecise_t_9_0ml in (0); # Dichotomy for the error bound epsilon $ xhml; interval-2.1.0/src/crlibm/gappa/trigpi/cospi-quick.gappa0000644000000000000000000000751413031036767021367 0ustar 00000000000000# The polynomial to implement is: 1b0 + ((x^(1b1)) * ((-2778046668940015b-49) + ((x^(1b1)) * (4569703604931271b-50 + ((x^(1b1)) * (-6013451953439851b-52)))))) # The polynomial implemented is: 1b0 + ((x^(1b1)) * ((-2778046668940015b-49) + ((x^(1b1)) * (4569703604931271b-50 + ((x^(1b1)) * (-6013451953439851b-52)))))) # The domain is [-1b-8;1b-8] # The free variable x is a double precision number, the result cospiquick_res* is stored on a double-double number. # The code produces 13 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code cospiquick_coeff_0h = double(1.00000000000000000000000000000000000000000000000000000000000000000000000000000000e+00); cospiquick_coeff_2h = double(-4.93480220054467899615247006295248866081237792968750000000000000000000000000000000e+00); cospiquick_coeff_4h = double(4.05871212632582167856298838160000741481781005859375000000000000000000000000000000e+00); cospiquick_coeff_6h = double(-1.33525456323720947970912220625905320048332214355468750000000000000000000000000000e+00); cospiquick_x_0_pow2hm = xh * xh; cospiquick_x_0_pow2h = double(cospiquick_x_0_pow2hm); cospiquick_x_0_pow2m = cospiquick_x_0_pow2hm - cospiquick_x_0_pow2h; cospiquick_t_1_0h = cospiquick_coeff_6h; cospiquick_t_2_0h = double(cospiquick_t_1_0h * cospiquick_x_0_pow2h); cospiquick_t_3_0h = double(cospiquick_coeff_4h + cospiquick_t_2_0h); cospiquick_t_4_0h = double(cospiquick_t_3_0h * cospiquick_x_0_pow2h); cospiquick_t_5_0hm = cospiquick_coeff_2h + cospiquick_t_4_0h; cospiquick_t_5_0h = double(cospiquick_t_5_0hm); cospiquick_t_5_0m = cospiquick_t_5_0hm - cospiquick_t_5_0h; cospiquick_t_6_0hm = mul_rel<102>(cospiquick_t_5_0hm,cospiquick_x_0_pow2hm); cospiquick_t_6_0h = double(cospiquick_t_6_0hm); cospiquick_t_6_0m = cospiquick_t_6_0hm - cospiquick_t_6_0h; cospiquick_t_7_0hm = add_rel<102>(cospiquick_coeff_0h,cospiquick_t_6_0hm); cospiquick_t_7_0h = double(cospiquick_t_7_0hm); cospiquick_t_7_0m = cospiquick_t_7_0hm - cospiquick_t_7_0h; cospiquick_reshm = cospiquick_t_7_0hm; cospiquick_resh = cospiquick_t_7_0h; cospiquick_resm = cospiquick_t_7_0m; # Mathematical equivalents Mx = x; Mcospiquick_coeff_0 = cospiquick_coeff_0h; Mcospiquick_coeff_2 = cospiquick_coeff_2h; Mcospiquick_coeff_4 = cospiquick_coeff_4h; Mcospiquick_coeff_6 = cospiquick_coeff_6h; Mcospiquick_x_0_pow2 = Mx * Mx; Mcospiquick_t_1_0 = Mcospiquick_coeff_6; Mcospiquick_t_2_0 = Mcospiquick_t_1_0 * Mcospiquick_x_0_pow2; Mcospiquick_t_3_0 = Mcospiquick_coeff_4 + Mcospiquick_t_2_0; Mcospiquick_t_4_0 = Mcospiquick_t_3_0 * Mcospiquick_x_0_pow2; Mcospiquick_t_5_0 = Mcospiquick_coeff_2 + Mcospiquick_t_4_0; Mcospiquick_t_6_0 = Mcospiquick_t_5_0 * Mcospiquick_x_0_pow2; Mcospiquick_t_7_0 = Mcospiquick_coeff_0 + Mcospiquick_t_6_0; Mcospiquick_res = Mcospiquick_t_7_0; # Definition of the relative arithmetical error epsilon = (cospiquick_reshm - Mcospiquick_res) / Mcospiquick_res; # Implication to prove {(( x in [-1b-8,-1b-408] ) \/ ( x in [1b-408,1b-8] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition cospiquick_x_0_pow2h ~ cospiquick_x_0_pow2hm; cospiquick_t_5_0h ~ cospiquick_t_5_0hm; cospiquick_t_6_0h ~ cospiquick_t_6_0hm; cospiquick_t_7_0h ~ cospiquick_t_7_0hm; # Meta-Hints for Horner scheme cospiquick_x_0_pow2hm ~ Mcospiquick_x_0_pow2; cospiquick_t_1_0h ~ Mcospiquick_t_1_0; cospiquick_t_2_0h ~ Mcospiquick_t_2_0; cospiquick_t_3_0h ~ Mcospiquick_t_3_0; cospiquick_t_4_0h ~ Mcospiquick_t_4_0; cospiquick_t_5_0hm ~ Mcospiquick_t_5_0; cospiquick_t_6_0hm ~ Mcospiquick_t_6_0; cospiquick_t_7_0hm ~ Mcospiquick_t_7_0; cospiquick_reshm ~ Mcospiquick_res; # Dichotomies for triple-double decomposition # Dichotomy for the error bound epsilon $ xhm; interval-2.1.0/src/crlibm/gappa/trigpi/sinpi-accurate.gappa0000644000000000000000000002602413031036767022044 0ustar 00000000000000# The polynomial to implement is: x * (286965175440513682586550324983956956112624645035b-156 + ((x^(1b1)) * ((-3275427103718718266226722463013b-99) + ((x^(1b1)) * (51723471613295412653622130742483b-104 + ((x^(1b1)) * ((-2698847510945475b-52) + ((x^(1b1)) * (2959617474724135b-55 + ((x^(1b1)) * (-4248785555898559b-59))))))))))) # The polynomial implemented is: x * (286965175440513682586550324983956956112624645035b-156 + ((x^(1b1)) * ((-3275427103718718266226722463013b-99) + ((x^(1b1)) * (51723471613295412653622130742483b-104 + ((x^(1b1)) * ((-2698847510945475b-52) + ((x^(1b1)) * (2959617474724135b-55 + ((x^(1b1)) * (-4248785555898559b-59))))))))))) # The domain is [-1b-8;1b-8] # The free variable x is a double precision number, the result sinpiprecise_res* is stored on a triple-double number. # The code produces 18 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code sinpiprecise_coeff_1h = double(3.14159265358979311599796346854418516159057617187500000000000000000000000000000000e+00); sinpiprecise_coeff_1m = double(1.22464679914735320717376402945839660462569212467758006379625612680683843791484833e-16); sinpiprecise_coeff_1l = double(-2.87889731599645993207191707893463395148177292198731390393739579574603302514349608e-33); sinpiprecise_coeff_1hml = sinpiprecise_coeff_1h + sinpiprecise_coeff_1m + sinpiprecise_coeff_1l; sinpiprecise_coeff_3h = double(-5.16771278004997025590228076907806098461151123046875000000000000000000000000000000e+00); sinpiprecise_coeff_3m = double(2.26656228257550136196266687046492287115561324595258696490418515168130397796630859e-16); sinpiprecise_coeff_3hm = sinpiprecise_coeff_3h + sinpiprecise_coeff_3m; sinpiprecise_coeff_5h = double(2.55016403987734552316624103696085512638092041015625000000000000000000000000000000e+00); sinpiprecise_coeff_5m = double(-7.93098961936403945684716222915171282926664203267314023904077657789457589387893677e-17); sinpiprecise_coeff_5hm = sinpiprecise_coeff_5h + sinpiprecise_coeff_5m; sinpiprecise_coeff_7h = double(-5.99264529320792105338000510528218001127243041992187500000000000000000000000000000e-01); sinpiprecise_coeff_9h = double(8.21458866130424236740026344705256633460521697998046875000000000000000000000000000e-02); sinpiprecise_coeff_11h = double(-7.37046804820839888960914976223648409359157085418701171875000000000000000000000000e-03); sinpiprecise_x_0_pow2hm = xh * xh; sinpiprecise_x_0_pow2h = double(sinpiprecise_x_0_pow2hm); sinpiprecise_x_0_pow2m = sinpiprecise_x_0_pow2hm - sinpiprecise_x_0_pow2h; sinpiprecise_t_1_0h = sinpiprecise_coeff_11h; sinpiprecise_t_2_0h = double(sinpiprecise_t_1_0h * sinpiprecise_x_0_pow2h); sinpiprecise_t_3_0h = double(sinpiprecise_coeff_9h + sinpiprecise_t_2_0h); sinpiprecise_t_4_0h = double(sinpiprecise_t_3_0h * sinpiprecise_x_0_pow2h); sinpiprecise_t_5_0hm = sinpiprecise_coeff_7h + sinpiprecise_t_4_0h; sinpiprecise_t_5_0h = double(sinpiprecise_t_5_0hm); sinpiprecise_t_5_0m = sinpiprecise_t_5_0hm - sinpiprecise_t_5_0h; sinpiprecise_t_6_0hm = fma_rel<100>(sinpiprecise_t_5_0hm,sinpiprecise_x_0_pow2hm,sinpiprecise_coeff_5hm); sinpiprecise_t_6_0h = double(sinpiprecise_t_6_0hm); sinpiprecise_t_6_0m = sinpiprecise_t_6_0hm - sinpiprecise_t_6_0h; sinpiprecise_t_7_0hm = fma_rel<100>(sinpiprecise_t_6_0hm,sinpiprecise_x_0_pow2hm,sinpiprecise_coeff_3hm); sinpiprecise_t_7_0h = double(sinpiprecise_t_7_0hm); sinpiprecise_t_7_0m = sinpiprecise_t_7_0hm - sinpiprecise_t_7_0h; sinpiprecise_t_8_0hm = mul_rel<102>(sinpiprecise_t_7_0hm,sinpiprecise_x_0_pow2hm); sinpiprecise_t_8_0h = double(sinpiprecise_t_8_0hm); sinpiprecise_t_8_0m = sinpiprecise_t_8_0hm - sinpiprecise_t_8_0h; sinpiprecise_t_9_0hml = add_rel<152>(sinpiprecise_t_8_0hm,sinpiprecise_coeff_1hml); sinpiprecise_t_9_0ml = sinpiprecise_t_9_0hml - sinpiprecise_t_9_0h; sinpiprecise_t_9_0m = double(sinpiprecise_t_9_0ml); sinpiprecise_t_9_0l = sinpiprecise_t_9_0ml - sinpiprecise_t_9_0m; sinpiprecise_t_9_0hm = sinpiprecise_t_9_0h + sinpiprecise_t_9_0m; overlap_sinpiprecise_t_9_0 = sinpiprecise_t_9_0m / sinpiprecise_t_9_0h; sinpiprecise_t_10_0hml = mul_rel<145>(xh,sinpiprecise_t_9_0hml); sinpiprecise_t_10_0ml = sinpiprecise_t_10_0hml - sinpiprecise_t_10_0h; sinpiprecise_t_10_0m = double(sinpiprecise_t_10_0ml); sinpiprecise_t_10_0l = sinpiprecise_t_10_0ml - sinpiprecise_t_10_0m; sinpiprecise_t_10_0hm = sinpiprecise_t_10_0h + sinpiprecise_t_10_0m; overlap_sinpiprecise_t_10_0 = sinpiprecise_t_10_0m / sinpiprecise_t_10_0h; sinpiprecise_reshml = sinpiprecise_t_10_0hml; sinpiprecise_resml = sinpiprecise_reshml - sinpiprecise_resh; sinpiprecise_resm = double(sinpiprecise_resml); sinpiprecise_resl = sinpiprecise_resml - sinpiprecise_resm; sinpiprecise_reshm = sinpiprecise_resh + sinpiprecise_resm; overlap_sinpiprecise_res = sinpiprecise_resm / sinpiprecise_resh; # Mathematical equivalents Mx = x; Msinpiprecise_coeff_1 = sinpiprecise_coeff_1hml; Msinpiprecise_coeff_3 = sinpiprecise_coeff_3hm; Msinpiprecise_coeff_5 = sinpiprecise_coeff_5hm; Msinpiprecise_coeff_7 = sinpiprecise_coeff_7h; Msinpiprecise_coeff_9 = sinpiprecise_coeff_9h; Msinpiprecise_coeff_11 = sinpiprecise_coeff_11h; Msinpiprecise_x_0_pow2 = Mx * Mx; Msinpiprecise_t_1_0 = Msinpiprecise_coeff_11; Msinpiprecise_t_2_0 = Msinpiprecise_t_1_0 * Msinpiprecise_x_0_pow2; Msinpiprecise_t_3_0 = Msinpiprecise_coeff_9 + Msinpiprecise_t_2_0; Msinpiprecise_t_4_0 = Msinpiprecise_t_3_0 * Msinpiprecise_x_0_pow2; Msinpiprecise_t_5_0 = Msinpiprecise_coeff_7 + Msinpiprecise_t_4_0; Msinpiprecise_t_6_0 = (Msinpiprecise_t_5_0 * Msinpiprecise_x_0_pow2) + Msinpiprecise_coeff_5; Msinpiprecise_t_7_0 = (Msinpiprecise_t_6_0 * Msinpiprecise_x_0_pow2) + Msinpiprecise_coeff_3; Msinpiprecise_t_8_0 = Msinpiprecise_t_7_0 * Msinpiprecise_x_0_pow2; Msinpiprecise_t_9_0 = Msinpiprecise_t_8_0 + Msinpiprecise_coeff_1; Msinpiprecise_t_10_0 = Mx * Msinpiprecise_t_9_0; Msinpiprecise_res = Msinpiprecise_t_10_0; # Definition of the relative arithmetical error epsilon = (sinpiprecise_reshml - Msinpiprecise_res) / Msinpiprecise_res; # Implication to prove {(( x in [-1b-8,-1b-408] /\ |overlap_sinpiprecise_t_9_0| in [1b-400,1b-45] # Verify the lower bound /\ |sinpiprecise_t_9_0ml| in [1b-1021,1b1023] /\ |overlap_sinpiprecise_t_10_0| in [1b-400,1b-40] # Verify the lower bound /\ |sinpiprecise_t_10_0ml| in [1b-1021,1b1023] /\ |overlap_sinpiprecise_res| in [1b-400,1b-52] # Verify the lower bound /\ |sinpiprecise_resml| in [1b-1021,1b1023] ) \/ ( x in [1b-408,1b-8] /\ |overlap_sinpiprecise_t_9_0| in [1b-400,1b-45] # Verify the lower bound /\ |sinpiprecise_t_9_0ml| in [1b-1021,1b1023] /\ |overlap_sinpiprecise_t_10_0| in [1b-400,1b-40] # Verify the lower bound /\ |sinpiprecise_t_10_0ml| in [1b-1021,1b1023] /\ |overlap_sinpiprecise_res| in [1b-400,1b-52] # Verify the lower bound /\ |sinpiprecise_resml| in [1b-1021,1b1023] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition sinpiprecise_x_0_pow2h ~ sinpiprecise_x_0_pow2hm; sinpiprecise_t_5_0h ~ sinpiprecise_t_5_0hm; sinpiprecise_t_6_0h ~ sinpiprecise_t_6_0hm; sinpiprecise_t_7_0h ~ sinpiprecise_t_7_0hm; sinpiprecise_t_8_0h ~ sinpiprecise_t_8_0hm; sinpiprecise_t_9_0hm ~ sinpiprecise_t_9_0hml; sinpiprecise_t_9_0h ~ sinpiprecise_t_9_0hm; sinpiprecise_t_9_0h ~ sinpiprecise_t_9_0hml; sinpiprecise_t_9_0m -> sinpiprecise_t_9_0h * overlap_sinpiprecise_t_9_0; sinpiprecise_t_9_0l / sinpiprecise_t_9_0m -> - ((sinpiprecise_t_9_0m - sinpiprecise_t_9_0ml) / sinpiprecise_t_9_0ml) / (1 + ((sinpiprecise_t_9_0m - sinpiprecise_t_9_0ml) / sinpiprecise_t_9_0ml)); (sinpiprecise_t_9_0hm - sinpiprecise_t_9_0hml) / sinpiprecise_t_9_0hml -> - (sinpiprecise_t_9_0l / sinpiprecise_t_9_0m) * (1 / (1 / overlap_sinpiprecise_t_9_0 + 1 + (sinpiprecise_t_9_0l / sinpiprecise_t_9_0m))); sinpiprecise_t_9_0ml -> sinpiprecise_t_9_0hml / ((1 + ((sinpiprecise_t_9_0m - sinpiprecise_t_9_0ml) / sinpiprecise_t_9_0ml)) / overlap_sinpiprecise_t_9_0 + 1); (sinpiprecise_t_9_0h - sinpiprecise_t_9_0hm) / sinpiprecise_t_9_0hm -> - 1 / (1 / overlap_sinpiprecise_t_9_0 + 1); sinpiprecise_t_9_0h -> sinpiprecise_t_9_0hml / (overlap_sinpiprecise_t_9_0 / (1 + ((sinpiprecise_t_9_0m - sinpiprecise_t_9_0ml) / sinpiprecise_t_9_0ml)) + 1); sinpiprecise_t_10_0hm ~ sinpiprecise_t_10_0hml; sinpiprecise_t_10_0h ~ sinpiprecise_t_10_0hm; sinpiprecise_t_10_0h ~ sinpiprecise_t_10_0hml; sinpiprecise_t_10_0m -> sinpiprecise_t_10_0h * overlap_sinpiprecise_t_10_0; sinpiprecise_t_10_0l / sinpiprecise_t_10_0m -> - ((sinpiprecise_t_10_0m - sinpiprecise_t_10_0ml) / sinpiprecise_t_10_0ml) / (1 + ((sinpiprecise_t_10_0m - sinpiprecise_t_10_0ml) / sinpiprecise_t_10_0ml)); (sinpiprecise_t_10_0hm - sinpiprecise_t_10_0hml) / sinpiprecise_t_10_0hml -> - (sinpiprecise_t_10_0l / sinpiprecise_t_10_0m) * (1 / (1 / overlap_sinpiprecise_t_10_0 + 1 + (sinpiprecise_t_10_0l / sinpiprecise_t_10_0m))); sinpiprecise_t_10_0ml -> sinpiprecise_t_10_0hml / ((1 + ((sinpiprecise_t_10_0m - sinpiprecise_t_10_0ml) / sinpiprecise_t_10_0ml)) / overlap_sinpiprecise_t_10_0 + 1); (sinpiprecise_t_10_0h - sinpiprecise_t_10_0hm) / sinpiprecise_t_10_0hm -> - 1 / (1 / overlap_sinpiprecise_t_10_0 + 1); sinpiprecise_t_10_0h -> sinpiprecise_t_10_0hml / (overlap_sinpiprecise_t_10_0 / (1 + ((sinpiprecise_t_10_0m - sinpiprecise_t_10_0ml) / sinpiprecise_t_10_0ml)) + 1); sinpiprecise_reshm ~ sinpiprecise_reshml; sinpiprecise_resh ~ sinpiprecise_reshm; sinpiprecise_resh ~ sinpiprecise_reshml; sinpiprecise_resm -> sinpiprecise_resh * overlap_sinpiprecise_res; sinpiprecise_resl / sinpiprecise_resm -> - ((sinpiprecise_resm - sinpiprecise_resml) / sinpiprecise_resml) / (1 + ((sinpiprecise_resm - sinpiprecise_resml) / sinpiprecise_resml)); (sinpiprecise_reshm - sinpiprecise_reshml) / sinpiprecise_reshml -> - (sinpiprecise_resl / sinpiprecise_resm) * (1 / (1 / overlap_sinpiprecise_res + 1 + (sinpiprecise_resl / sinpiprecise_resm))); sinpiprecise_resml -> sinpiprecise_reshml / ((1 + ((sinpiprecise_resm - sinpiprecise_resml) / sinpiprecise_resml)) / overlap_sinpiprecise_res + 1); (sinpiprecise_resh - sinpiprecise_reshm) / sinpiprecise_reshm -> - 1 / (1 / overlap_sinpiprecise_res + 1); sinpiprecise_resh -> sinpiprecise_reshml / (overlap_sinpiprecise_res / (1 + ((sinpiprecise_resm - sinpiprecise_resml) / sinpiprecise_resml)) + 1); # Meta-Hints for Horner scheme sinpiprecise_x_0_pow2hm ~ Msinpiprecise_x_0_pow2; sinpiprecise_t_1_0h ~ Msinpiprecise_t_1_0; sinpiprecise_t_2_0h ~ Msinpiprecise_t_2_0; sinpiprecise_t_3_0h ~ Msinpiprecise_t_3_0; sinpiprecise_t_4_0h ~ Msinpiprecise_t_4_0; sinpiprecise_t_5_0hm ~ Msinpiprecise_t_5_0; sinpiprecise_t_6_0hm ~ Msinpiprecise_t_6_0; sinpiprecise_t_7_0hm ~ Msinpiprecise_t_7_0; sinpiprecise_t_8_0hm ~ Msinpiprecise_t_8_0; sinpiprecise_t_9_0hml ~ Msinpiprecise_t_9_0; sinpiprecise_t_10_0hml ~ Msinpiprecise_t_10_0; sinpiprecise_reshml ~ Msinpiprecise_res; # Dichotomies for triple-double decomposition $ sinpiprecise_t_9_0hml in (0); $ sinpiprecise_t_9_0ml in (0); $ sinpiprecise_t_10_0hml in (0); $ sinpiprecise_t_10_0ml in (0); $ sinpiprecise_reshml in (0); $ sinpiprecise_resml in (0); # Dichotomy for the error bound epsilon $ xhml; interval-2.1.0/src/crlibm/gappa/trigpi/sinpi-quick.gappa0000644000000000000000000001013413031036767021364 0ustar 00000000000000# The polynomial to implement is: x * (63719069007931157819019535590437b-104 + ((x^(1b1)) * ((-5818327337647699b-50) + ((x^(1b1)) * (717807363739183b-48 + ((x^(1b1)) * (-337355592074089b-49))))))) # The polynomial implemented is: x * (63719069007931157819019535590437b-104 + ((x^(1b1)) * ((-5818327337647699b-50) + ((x^(1b1)) * (717807363739183b-48 + ((x^(1b1)) * (-337355592074089b-49))))))) # The domain is [-1b-8;1b-8] # The free variable x is a double precision number, the result sinpiquick_res* is stored on a double-double number. # The code produces 13 intermediate and final arithmetical approximations. # Double precision rounding operator: @double = float; # Disable some annoying warnings: #@-Wno-dichotomy-failure # Helper definitions for decomposing the free variable xh = x; # Transcription of the C code sinpiquick_coeff_1h = double(3.14159265358979311599796346854418516159057617187500000000000000000000000000000000e+00); sinpiquick_coeff_1m = double(1.22464971683184787123862072310058851157814368464452070561776508839102461934089661e-16); sinpiquick_coeff_1hm = sinpiquick_coeff_1h + sinpiquick_coeff_1m; sinpiquick_coeff_3h = double(-5.16771278004997025590228076907806098461151123046875000000000000000000000000000000e+00); sinpiquick_coeff_5h = double(2.55016403989992213041659852024167776107788085937500000000000000000000000000000000e+00); sinpiquick_coeff_7h = double(-5.99263913290728922333983064163476228713989257812500000000000000000000000000000000e-01); sinpiquick_x_0_pow2hm = xh * xh; sinpiquick_x_0_pow2h = double(sinpiquick_x_0_pow2hm); sinpiquick_x_0_pow2m = sinpiquick_x_0_pow2hm - sinpiquick_x_0_pow2h; sinpiquick_t_1_0h = sinpiquick_coeff_7h; sinpiquick_t_2_0h = double(sinpiquick_t_1_0h * sinpiquick_x_0_pow2h); sinpiquick_t_3_0h = double(sinpiquick_coeff_5h + sinpiquick_t_2_0h); sinpiquick_t_4_0h = double(sinpiquick_t_3_0h * sinpiquick_x_0_pow2h); sinpiquick_t_5_0hm = sinpiquick_coeff_3h + sinpiquick_t_4_0h; sinpiquick_t_5_0h = double(sinpiquick_t_5_0hm); sinpiquick_t_5_0m = sinpiquick_t_5_0hm - sinpiquick_t_5_0h; sinpiquick_t_6_0hm = fma_rel<100>(sinpiquick_t_5_0hm,sinpiquick_x_0_pow2hm,sinpiquick_coeff_1hm); sinpiquick_t_6_0h = double(sinpiquick_t_6_0hm); sinpiquick_t_6_0m = sinpiquick_t_6_0hm - sinpiquick_t_6_0h; sinpiquick_t_7_0hm = mul_rel<102>(xh,sinpiquick_t_6_0hm); sinpiquick_t_7_0h = double(sinpiquick_t_7_0hm); sinpiquick_t_7_0m = sinpiquick_t_7_0hm - sinpiquick_t_7_0h; sinpiquick_reshm = sinpiquick_t_7_0hm; sinpiquick_resh = sinpiquick_t_7_0h; sinpiquick_resm = sinpiquick_t_7_0m; # Mathematical equivalents Mx = x; Msinpiquick_coeff_1 = sinpiquick_coeff_1hm; Msinpiquick_coeff_3 = sinpiquick_coeff_3h; Msinpiquick_coeff_5 = sinpiquick_coeff_5h; Msinpiquick_coeff_7 = sinpiquick_coeff_7h; Msinpiquick_x_0_pow2 = Mx * Mx; Msinpiquick_t_1_0 = Msinpiquick_coeff_7; Msinpiquick_t_2_0 = Msinpiquick_t_1_0 * Msinpiquick_x_0_pow2; Msinpiquick_t_3_0 = Msinpiquick_coeff_5 + Msinpiquick_t_2_0; Msinpiquick_t_4_0 = Msinpiquick_t_3_0 * Msinpiquick_x_0_pow2; Msinpiquick_t_5_0 = Msinpiquick_coeff_3 + Msinpiquick_t_4_0; Msinpiquick_t_6_0 = (Msinpiquick_t_5_0 * Msinpiquick_x_0_pow2) + Msinpiquick_coeff_1; Msinpiquick_t_7_0 = Mx * Msinpiquick_t_6_0; Msinpiquick_res = Msinpiquick_t_7_0; # Definition of the relative arithmetical error epsilon = (sinpiquick_reshm - Msinpiquick_res) / Msinpiquick_res; # Implication to prove {(( x in [-1b-8,-1b-408] ) \/ ( x in [1b-408,1b-8] )) -> ( epsilon in ? )} # Hints and Meta-Hints for expansion decomposition sinpiquick_x_0_pow2h ~ sinpiquick_x_0_pow2hm; sinpiquick_t_5_0h ~ sinpiquick_t_5_0hm; sinpiquick_t_6_0h ~ sinpiquick_t_6_0hm; sinpiquick_t_7_0h ~ sinpiquick_t_7_0hm; # Meta-Hints for Horner scheme sinpiquick_x_0_pow2hm ~ Msinpiquick_x_0_pow2; sinpiquick_t_1_0h ~ Msinpiquick_t_1_0; sinpiquick_t_2_0h ~ Msinpiquick_t_2_0; sinpiquick_t_3_0h ~ Msinpiquick_t_3_0; sinpiquick_t_4_0h ~ Msinpiquick_t_4_0; sinpiquick_t_5_0hm ~ Msinpiquick_t_5_0; sinpiquick_t_6_0hm ~ Msinpiquick_t_6_0; sinpiquick_t_7_0hm ~ Msinpiquick_t_7_0; sinpiquick_reshm ~ Msinpiquick_res; # Dichotomies for triple-double decomposition # Dichotomy for the error bound epsilon $ xhm; interval-2.1.0/src/crlibm/interval.h0000644000000000000000000003551613031036767015540 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" typedef struct interval { double INF, SUP;} interval ; #define LOW(x) x.INF #define UP(x) x.SUP #define ASSIGN_LOW(x,e) x.INF=e #define ASSIGN_UP(x,e) x.SUP=e #define TRUE (1+1==2) #define FALSE (1+1==3) interval j_log(); #define TEST_AND_COPY_RDRU_LOG(__cond__, __res_rd__, __yh_rd__, __yl_rd__, __res_ru__, __yh_ru__, __yl_ru__, __eps__) \ { \ db_number yh_rd, yl_rd, u53_rd, yh_ru, yl_ru, u53_ru; \ int yh_rd_neg, yl_rd_neg, yh_ru_neg, yl_ru_neg; \ int rd_ok, ru_ok; \ double save_res_rd=__res_rd__; \ yh_rd.d = __yh_rd__; yl_rd.d = __yl_rd__; \ yh_rd_neg = (yh_rd.i[HI] & 0x80000000); \ yl_rd_neg = (yl_rd.i[HI] & 0x80000000); \ yh_rd.l = yh_rd.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ yl_rd.l = yl_rd.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ u53_rd.l = (yh_rd.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ yh_ru.d = __yh_ru__; yl_ru.d = __yl_ru__; \ yh_ru_neg = (yh_ru.i[HI] & 0x80000000); \ yl_ru_neg = (yl_ru.i[HI] & 0x80000000); \ yh_ru.l = yh_ru.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ yl_ru.l = yl_ru.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ u53_ru.l = (yh_ru.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ __cond__ = 0; \ rd_ok=(yl_rd.d > __eps__ * u53_rd.d); \ ru_ok=(yl_ru.d > __eps__ * u53_ru.d); \ if(yl_rd_neg) { /* The case yl==0 is filtered by the above test*/ \ /* return next down */ \ yh_rd.d = __yh_rd__; \ if(yh_rd_neg) yh_rd.l++; else yh_rd.l--; /* Beware: fails for zero */ \ __res_rd__ = yh_rd.d ; \ } \ else { \ __res_rd__ = __yh_rd__; \ } \ if(!yl_ru_neg) { /* The case yl==0 is filtered by the above test*/ \ /* return next up */ \ yh_ru.d = __yh_ru__; \ if(yh_ru_neg) yh_ru.l--; else yh_ru.l++; /* Beware: fails for zero */ \ __res_ru__ = yh_ru.d ; \ } \ else { \ __res_ru__ = __yh_ru__; \ } \ if(save_res_rd==-1.0/0.0) __res_rd__=-1.0/0.0; \ if(rd_ok && ru_ok){\ interval _res; \ ASSIGN_LOW(_res,__res_rd__); \ ASSIGN_UP(_res,__res_ru__); \ return(_res); \ } \ else if (rd_ok){\ __cond__=1; \ }\ else if (ru_ok){\ __cond__=2; \ }\ } #define TEST_AND_COPY_RDRU_EXP(__cond__, cond1, cond2, __res_rd__, __yh_rd__, __yl_rd__, __res_ru__, __yh_ru__, __yl_ru__, __eps__) \ { \ db_number yh_rd, yl_rd, u53_rd, yh_ru, yl_ru, u53_ru; \ int yh_rd_neg, yl_rd_neg, yh_ru_neg, yl_ru_neg; \ int rd_ok, ru_ok; \ double save_res_rd=__res_rd__; \ double save_res_ru=__res_ru__; \ yh_rd.d = __yh_rd__; yl_rd.d = __yl_rd__; \ yh_rd_neg = (yh_rd.i[HI] & 0x80000000); \ yl_rd_neg = (yl_rd.i[HI] & 0x80000000); \ yh_rd.l = yh_rd.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ yl_rd.l = yl_rd.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ u53_rd.l = (yh_rd.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ yh_ru.d = __yh_ru__; yl_ru.d = __yl_ru__; \ yh_ru_neg = (yh_ru.i[HI] & 0x80000000); \ yl_ru_neg = (yl_ru.i[HI] & 0x80000000); \ yh_ru.l = yh_ru.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ yl_ru.l = yl_ru.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ u53_ru.l = (yh_ru.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ __cond__ = 0; \ rd_ok=(yl_rd.d > __eps__ * u53_rd.d); \ ru_ok=(yl_ru.d > __eps__ * u53_ru.d); \ if(yl_rd_neg) { /* The case yl==0 is filtered by the above test*/ \ /* return next down */ \ yh_rd.d = __yh_rd__; \ if(yh_rd_neg) yh_rd.l++; else yh_rd.l--; /* Beware: fails for zero */ \ __res_rd__ = yh_rd.d ; \ } \ else { \ __res_rd__ = __yh_rd__; \ } \ if(!yl_ru_neg) { /* The case yl==0 is filtered by the above test*/ \ /* return next up */ \ yh_ru.d = __yh_ru__; \ if(yh_ru_neg) yh_ru.l--; else yh_ru.l++; /* Beware: fails for zero */ \ __res_ru__ = yh_ru.d ; \ } \ else { \ __res_ru__ = __yh_ru__; \ } \ if(cond1) __res_rd__=save_res_rd; \ if(cond2) __res_ru__=save_res_ru; \ if(rd_ok && ru_ok){\ __cond__=3; \ } \ else if (rd_ok){\ __cond__=1; \ }\ else if (ru_ok){\ __cond__=2; \ }\ } #define TEST_AND_COPY_RDRU_EXPM1(__cond__, __res_rd__, __yh_rd__, __yl_rd__, __res_ru__, __yh_ru__, __yl_ru__, __eps__) \ { \ db_number yh_rd, yl_rd, u53_rd, yh_ru, yl_ru, u53_ru; \ int yh_rd_neg, yl_rd_neg, yh_ru_neg, yl_ru_neg; \ int rd_ok, ru_ok; \ yh_rd.d = __yh_rd__; yl_rd.d = __yl_rd__; \ yh_rd_neg = (yh_rd.i[HI] & 0x80000000); \ yl_rd_neg = (yl_rd.i[HI] & 0x80000000); \ yh_rd.l = yh_rd.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ yl_rd.l = yl_rd.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ u53_rd.l = (yh_rd.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ yh_ru.d = __yh_ru__; yl_ru.d = __yl_ru__; \ yh_ru_neg = (yh_ru.i[HI] & 0x80000000); \ yl_ru_neg = (yl_ru.i[HI] & 0x80000000); \ yh_ru.l = yh_ru.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ yl_ru.l = yl_ru.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ u53_ru.l = (yh_ru.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ __cond__ = 0; \ rd_ok=(yl_rd.d > __eps__ * u53_rd.d); \ ru_ok=(yl_ru.d > __eps__ * u53_ru.d); \ if(yl_rd_neg) { /* The case yl==0 is filtered by the above test*/ \ /* return next down */ \ yh_rd.d = __yh_rd__; \ if(yh_rd_neg) yh_rd.l++; else yh_rd.l--; /* Beware: fails for zero */ \ __res_rd__ = yh_rd.d ; \ } \ else { \ __res_rd__ = __yh_rd__; \ } \ if(!yl_ru_neg) { /* The case yl==0 is filtered by the above test*/ \ /* return next up */ \ yh_ru.d = __yh_ru__; \ if(yh_ru_neg) yh_ru.l--; else yh_ru.l++; /* Beware: fails for zero */ \ __res_ru__ = yh_ru.d ; \ } \ else { \ __res_ru__ = __yh_ru__; \ } \ if(rd_ok && ru_ok){\ interval _res; \ ASSIGN_LOW(_res,__res_rd__); \ ASSIGN_UP(_res,__res_ru__); \ return(_res); \ } \ else if (rd_ok){\ __cond__=1; \ }\ else if (ru_ok){\ __cond__=2; \ }\ } #define TEST_AND_COPY_RDRU_LOG2(__cond__, __res_rd__, __yh_rd__, __yl_rd__, __res_ru__, __yh_ru__, __yl_ru__, __eps_rd__, __eps_ru__) \ { \ db_number yh_rd, yl_rd, u53_rd, yh_ru, yl_ru, u53_ru; \ int yh_rd_neg, yl_rd_neg, yh_ru_neg, yl_ru_neg; \ int rd_ok, ru_ok; \ yh_rd.d = __yh_rd__; yl_rd.d = __yl_rd__; \ yh_rd_neg = (yh_rd.i[HI] & 0x80000000); \ yl_rd_neg = (yl_rd.i[HI] & 0x80000000); \ yh_rd.l = yh_rd.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ yl_rd.l = yl_rd.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ u53_rd.l = (yh_rd.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ yh_ru.d = __yh_ru__; yl_ru.d = __yl_ru__; \ yh_ru_neg = (yh_ru.i[HI] & 0x80000000); \ yl_ru_neg = (yl_ru.i[HI] & 0x80000000); \ yh_ru.l = yh_ru.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ yl_ru.l = yl_ru.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ \ u53_ru.l = (yh_ru.l & ULL(7ff0000000000000)) + ULL(0010000000000000); \ __cond__ = 0; \ rd_ok=(yl_rd.d > __eps_rd__ * u53_rd.d); \ ru_ok=(yl_ru.d > __eps_ru__ * u53_ru.d); \ if(yl_rd_neg) { /* The case yl==0 is filtered by the above test*/ \ /* return next down */ \ yh_rd.d = __yh_rd__; \ if(yh_rd_neg) yh_rd.l++; else yh_rd.l--; /* Beware: fails for zero */ \ __res_rd__ = yh_rd.d ; \ } \ else { \ __res_rd__ = __yh_rd__; \ } \ if(!yl_ru_neg) { /* The case yl==0 is filtered by the above test*/ \ /* return next up */ \ yh_ru.d = __yh_ru__; \ if(yh_ru_neg) yh_ru.l--; else yh_ru.l++; /* Beware: fails for zero */ \ __res_ru__ = yh_ru.d ; \ } \ else { \ __res_ru__ = __yh_ru__; \ } \ if(rd_ok && ru_ok){\ interval _res; \ ASSIGN_LOW(_res,__res_rd__); \ ASSIGN_UP(_res,__res_ru__); \ return(_res); \ } \ else if (rd_ok){\ __cond__=1; \ }\ else if (ru_ok){\ __cond__=2; \ }\ } #define RETURN_EMPTY_INTERVAL \ { \ interval res; \ ASSIGN_LOW(res,0.0/0.0); \ ASSIGN_UP(res,0.0/0.0); \ return res; \ } interval-2.1.0/src/crlibm/log-de.c0000644000000000000000000003540113031036767015047 0ustar 00000000000000/* *this function computes log, correctly rounded, using double-extended arithmetic THIS IS EXPERIMENTAL SOFTWARE In particular it changes rounding modes all the time without warning nor restoring. * * Author : Florent de Dinechin * Florent.de.Dinechin at ens-lyon.fr * This function compiles both on IA32 and IA64 architectures. On IA64, it needs icc 8.1 or higher, with the following flags (which should be set up by the autoconf). icc -DHAVE_CONFIG_H -Qoption,cpp,--extended_float_types \ -IPF_fp_speculationsafe -c log-de.c;\ mv log-de.o log-td.o; make */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "double-extended.h" #include "log-de.h" static void log_accurate(double_ext* prh, double_ext* prl, double_ext z, int E, int index) { double_ext eh,el, t13, t12, t11, t10, t9, t8, p7h,p7l, t7h,t7l, t6h,t6l, t5h,t5l, t4h,t4l, t3h,t3l, t2h,t2l, t1h,t1l, t0h,t0l; /* Many temporary because single assignment form is nicer for Gappa */ #if !(defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)) double_ext c1h,c2h,c3h,c4h,c5h,c6h,c7h,c8h,c9h,c10h,c11h,c12h,c13h,c14h,c15h; double_ext c1l,c2l,c3l,c4l,c5l,c6l,c7l,c8l; #endif #if EVAL_PERF crlibm_second_step_taken++; #endif /* TODO check the conditions for the double-double ops */ PREFETCH_POLY_ACCURATE; t13 = c13h + z*c14h; t12 = c12h + z*t13; t11 = c11h + z*t12; t10 = c10h + z*t11; t9 = c9h + z*t10; t8 = c8h + z*t9; #if 1 /* This is faster on PIII. Your mileage may vary */ Mul12_ext(&p7h, &p7l, z, t8); Add22_ext(&t7h, &t7l, p7h,p7l, c7h,c7l); #else FMA22_ext(&t7h, &t7l, z,0, t8,0, c7h,c7l); #endif FMA22_ext(&t6h, &t6l, z,0, t7h,t7l, c6h,c6l); FMA22_ext(&t5h, &t5l, z,0, t6h,t6l, c5h,c5l); FMA22_ext(&t4h, &t4l, z,0, t5h,t5l, c4h,c4l); FMA22_ext(&t3h, &t3l, z,0, t4h,t4l, c3h,c3l); FMA22_ext(&t2h, &t2l, z,0, t3h,t3l, c2h,c2l); FMA22_ext(&t1h, &t1l, z,0, t2h,t2l, c1h,c1l); FMA22_ext(&t0h, &t0l, z,0, t1h,t1l, argredtable[index].logirh, argredtable[index].logirl); Mul22_ext(&eh, &el, log2H,log2L, E, 0); Add22_ext(prh, prl, eh,el, t0h,t0l); } double log_rn(double x) { double_ext logirh, r, y, z, th, tl, logde; #if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) db_number xdb; int E, index, index0, roundtestmask; #else /* assuming Itanium here */ int64_t E, i; uint64_t index, roundtestmask; double c2,c3,c4,c5,c6,c7; #endif #if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) xdb.d=x; index0 = (xdb.i[HI] & 0x000fffff); index = (index0 + (1<<(20-L-1))) >> (20-L); E = (xdb.i[HI]>>20)-1023; /* extract the exponent */ /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0) return -1.0/0.0; /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0) return (x-x)/0; /* log(-x) = Nan */ /* Else subnormal number */ xdb.d *= two64; /* make x a normal number */ E = -64 + (xdb.i[HI]>>20)-1023; /* extract the exponent */ index0 = (xdb.i[HI] & 0x000fffff); index = (index0 + (1<<(20-L-1))) >> (20-L); } if (xdb.i[HI] >= 0x7ff00000) return x+x; /* Inf or Nan */ DOUBLE_EXTENDED_MODE; /* This one should be overlapped with following integer computation */ /* Extract exponent and mantissa */ xdb.i[HI] = index0 | 0x3ff00000; /* do exponent = 0 */ /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to y>sqrt(2)*/ xdb.i[HI] -= 0x00100000; index = index & INDEXMASK; E++; } y = xdb.d; #else /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ /* Here come the code specific to Itanium processor */ E=0; PREFETCH_POLY_QUICK; /* defined in log-de.h */ y=x; i = _Asm_getf(2/*_FR_D*/, y); /* Cast y to a 64-bit integer */ /* Filter special cases */ if (i<(int64_t)ULL(0010000000000000)){ /* equivalent to : x < 2^(-1022) */ if ((i & ULL(7fffffffffffffff))==0) return -1.0/0.0; /* log(+/-0) = -Inf */ if (i<0) return (x-x)/0; /* log(-x) = Nan */ /* Else subnormal number */ y *= two64; /* make x a normal number */ E = -64; i = _Asm_getf(2/*_FR_D*/, y); /* and update i */ } if (i >= ULL(7ff0000000000000)) return x+x; /* Inf or Nan */ /* Extract exponent and mantissa */ E += (i>>52)-1023; i = i & ULL(000fffffffffffff); /* keep only mantissa */ index = (i + (ULL(1)<<(52-L-1))) >> (52-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to y>sqrt(2)*/ y = _Asm_setf(2/*_FR_D*/, (i | ULL(3ff0000000000000)) - ULL(0010000000000000) ); /* exponent = -1 */ index = index & INDEXMASK; E++; } else y = _Asm_setf(2/*_FR_D*/, i | ULL(3ff0000000000000) ); /* exponent = 0*/ #endif /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ /* All the previous argument reduction was exact */ /* now y holds 1+f, and E is the exponent */ r = (double_ext) (argredtable[index].r); /* approx to 1/y.d */ logirh = argredtable[index].logirh; z = y*r - 1. ; /* even without an FMA, all exact */ #if 0 if(E==0) roundtestmask=ACCURATE_TO_61_BITS; else roundtestmask=ACCURATE_TO_61_BITS; #else roundtestmask=ACCURATE_TO_62_BITS; #endif #ifdef ESTRIN /* Estrin polynomial evaluation */ double_ext z2,z4, p01, p23, p45, p67, p03, p47,p07; z2 = z*z; p67 = c6 + z*c7; p45 = c4 + z*c5; p23 = c2 + z*c3; p01 = logirh + z; z4 = z2*z2; p47 = p45 + z2*p67; p03 = p01 + z2*p23; p07 = p03 + z4*p47; logde = p07 + E*log2H; #endif #ifdef PATERSON double_ext z4,z2,t0,t1,t2,t3,t4,t5,t6,t7,t8; z2 = z * z; t1 = z + ps_alpha; t2 = z + ps_beta; t3 = c3 * z + c2; t4 = z + logirh; z4 = z2 * z2; t5 = z2 + ps_c; t6 = t3 * z2 + t4; t7 = t5 * t1 + t2; t0 = z4 * c7; t8 = t7 * t0 + t6; logde = t8 + E*log2H; #endif #if 0 /* to time the first step only */ BACK_TO_DOUBLE_MODE; return (double)t; #endif /* To test the second step only, comment out the following line */ DE_TEST_AND_RETURN_RN(logde, roundtestmask); log_accurate(&th, &tl, z, E, index); BACK_TO_DOUBLE_MODE; return (double) (th+tl); /* The exact sum of these double-extended is rounded to the nearest */ } double log_rd(double x) { double_ext logirh, r, y, z, th, tl, logde; #if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) db_number xdb; int E, index, roundtestmask; #else int64_t E, i; uint64_t index, roundtestmask; double_ext c1,c2,c3,c4,c5,c6,c7; #endif E=0; #if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0) return -1.0/0.0; /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0) return (x-x)/0; /* log(-x) = Nan */ /* Else subnormal number */ E = -64; xdb.d *= two64; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000) return x+x; /* Inf or Nan */ DOUBLE_EXTENDED_MODE; /* This one should be overlapped with following integer computation */ /* Extract exponent and mantissa */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to y>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; #else /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ /* Here come the code specific to Itanium processor */ PREFETCH_POLY_QUICK; /* defined in log-de.h */ y=x; i = _Asm_getf(2/*_FR_D*/, y); /* Cast y to a 64-bit integer */ /* Filter special cases */ if (i<(int64_t)ULL(0010000000000000)){ /* equivalent to : x < 2^(-1022) */ if ((i & ULL(7fffffffffffffff))==0) return -1.0/0.0; /* log(+/-0) = -Inf */ if (i<0) return (x-x)/0; /* log(-x) = Nan */ /* Else subnormal number */ y *= two64; /* make x a normal number */ E = -64; i = _Asm_getf(2/*_FR_D*/, y); /* and update i */ } if (i >= ULL(7ff0000000000000)) return x+x; /* Inf or Nan */ /* Extract exponent and mantissa */ E += (i>>52)-1023; i = i & ULL(000fffffffffffff); /* keep only mantissa */ index = (i + (ULL(1)<<(52-L-1))) >> (52-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to y>sqrt(2)*/ y = _Asm_setf(2/*_FR_D*/, (i | ULL(3ff0000000000000)) - ULL(0010000000000000) ); /* exponent = -1 */ E++; } else y = _Asm_setf(2/*_FR_D*/, i | ULL(3ff0000000000000) ); /* exponent = 0*/ #endif /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ /* All the previous argument reduction was exact */ /* now y holds 1+f, and E is the exponent */ index = index & INDEXMASK; logirh = argredtable[index].logirh; r = (double_ext) (argredtable[index].r); /* approx to 1/y.d */ z = y*r - 1. ; /* even without an FMA, all exact */ if(E==0) roundtestmask=ACCURATE_TO_61_BITS; else roundtestmask=ACCURATE_TO_62_BITS; #ifdef ESTRIN /* Estrin polynomial evaluation */ double_ext z2,z4, p01, p23, p45, p67, p03, p47,p07; z2 = z*z; p67 = c6 + z*c7; p45 = c4 + z*c5; p23 = c2 + z*c3; p01 = logirh + z; z4 = z2*z2; p47 = p45 + z2*p67; p03 = p01 + z2*p23; p07 = p03 + z4*p47; logde = p07 + E*log2H; #endif #ifdef PATERSON double_ext z4,z2,t0,t1,t2,t3,t4,t5,t6,t7,t8; z2 = z * z; t1 = z + ps_alpha; t2 = z + ps_beta; t3 = c3 * z + c2; t4 = z + logirh; z4 = z2 * z2; t5 = z2 + ps_c; t6 = t3 * z2 + t4; t7 = t5 * t1 + t2; t0 = z4 * c7; t8 = t7 * t0 + t6; logde = t8 + E*log2H; #endif #if 0 /* to time the first step only */ BACK_TO_DOUBLE_MODE; return (double)t; #endif /* To test the second step only, comment out the following line */ DE_TEST_AND_RETURN_RD(logde, roundtestmask); log_accurate(&th, &tl, z, E, index); RETURN_SUM_ROUNDED_DOWN(th, tl); } double log_ru(double x) { double_ext logirh, r, y, z, th, tl, logde; #if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) db_number xdb; int E, index, roundtestmask; #else int64_t E, i; uint64_t index, roundtestmask; double_ext c1,c2,c3,c4,c5,c6,c7; #endif E=0; #if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0) return -1.0/0.0; /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0) return (x-x)/0; /* log(-x) = Nan */ /* Else subnormal number */ E = -64; xdb.d *= two64; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000) return x+x; /* Inf or Nan */ DOUBLE_EXTENDED_MODE; /* This one should be overlapped with following integer computation */ /* Extract exponent and mantissa */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to y>sqrt(2)*/ index = index & INDEXMASK; xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; #else /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ /* Here come the code specific to Itanium processor */ PREFETCH_POLY_QUICK; /* defined in log-de.h */ y=x; i = _Asm_getf(2/*_FR_D*/, y); /* Cast y to a 64-bit integer */ /* Filter special cases */ if (i<(int64_t)ULL(0010000000000000)){ /* equivalent to : x < 2^(-1022) */ if ((i & ULL(7fffffffffffffff))==0) return -1.0/0.0; /* log(+/-0) = -Inf */ if (i<0) return (x-x)/0; /* log(-x) = Nan */ /* Else subnormal number */ y *= two64; /* make x a normal number */ E = -64; i = _Asm_getf(2/*_FR_D*/, y); /* and update i */ } if (i >= ULL(7ff0000000000000)) return x+x; /* Inf or Nan */ /* Extract exponent and mantissa */ E += (i>>52)-1023; i = i & ULL(000fffffffffffff); /* keep only mantissa */ index = (i + (ULL(1)<<(52-L-1))) >> (52-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to y>sqrt(2)*/ y = _Asm_setf(2/*_FR_D*/, (i | ULL(3ff0000000000000)) - ULL(0010000000000000) ); /* exponent = -1 */ index = index & INDEXMASK; E++; } else y = _Asm_setf(2/*_FR_D*/, i | ULL(3ff0000000000000) ); /* exponent = 0*/ #endif /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ /* All the previous argument reduction was exact */ /* now y holds 1+f, and E is the exponent */ logirh = argredtable[index].logirh; r = (double_ext) (argredtable[index].r); /* approx to 1/y.d */ z = y*r - 1. ; /* even without an FMA, all exact */ if(E==0) roundtestmask=ACCURATE_TO_61_BITS; else roundtestmask=ACCURATE_TO_62_BITS; #ifdef ESTRIN /* Estrin polynomial evaluation */ double_ext z2,z4, p01, p23, p45, p67, p03, p47,p07; z2 = z*z; p67 = c6 + z*c7; p45 = c4 + z*c5; p23 = c2 + z*c3; p01 = logirh + z; z4 = z2*z2; p47 = p45 + z2*p67; p03 = p01 + z2*p23; p07 = p03 + z4*p47; logde = p07 + E*log2H; #endif #ifdef PATERSON double_ext z4,z2,t0,t1,t2,t3,t4,t5,t6,t7,t8; z2 = z * z; t1 = z + ps_alpha; t2 = z + ps_beta; t3 = c3 * z + c2; t4 = z + logirh; z4 = z2 * z2; t5 = z2 + ps_c; t6 = t3 * z2 + t4; t7 = t5 * t1 + t2; t0 = z4 * c7; t8 = t7 * t0 + t6; logde = t8 + E*log2H; #endif #if 0 /* to time the first step only */ BACK_TO_DOUBLE_MODE; return (double)t; #endif /* To test the second step only, comment out the following line */ DE_TEST_AND_RETURN_RU(logde, roundtestmask); log_accurate(&th, &tl, z, E, index); RETURN_SUM_ROUNDED_UP(th, tl); } double log_rz(double x) { if (x>1.0) return log_rd(x); else return log_ru(x); } interval-2.1.0/src/crlibm/log-de.h0000644000000000000000000011035613031036767015057 0ustar 00000000000000/*File generated by maple/log-de.mpl*/ #define L 7 #define MAXINDEX 53 #define INDEXMASK 127 static const double two64 = 1.84467440737095516160000000000000000000000000000000e+19 ; #if 1 #define ESTRIN #else #define PATERSON #endif #if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) #ifdef PATERSON static const long double c7 = 1.42860987471441585385531838903183654565509641543031e-01; static const long double c3 = 3.33333333333333491175099611014687184251670259982347e-01; static const long double c2 = -5.00000000000000049710669608460378299241710919886827e-01; static const long double ps_alpha = -1.16665881748332273275172571436186785831523593515158e+00; static const long double ps_beta = -1.28333333319474127305875182925021249502606224268675e+00; static const long double ps_c = 3.99962323494931883068092062782916684682277264073491e-01; #endif/* PATERSON*/ #ifdef ESTRIN /* Coefficients are read directly from the array thanks to the following macros */ #define c7 c[0] #define c6 c[1] #define c5 c[2] #define c4 c[3] #define c3 c[4] #define c2 c[5] static const double c[7] = { /* c7 = */ 1.42860563385550420889558154158294200897216796875000e-01L, /* c6 = */ -1.66669572609547372854521540830319281667470932006836e-01L, /* c5 = */ 1.99999999967484798357730824136524461209774017333984e-01L, /* c4 = */ -2.49999999984237081251947643067978788167238235473633e-01L, /* c3 = */ 3.33333333333333425851918718763045035302639007568359e-01L, /* c2 = */ -5.00000000000000000000000000000000000000000000000000e-01L, }; #endif/* ESTRIN */ #define c14h ch[0] #define c13h ch[1] #define c12h ch[2] #define c11h ch[3] #define c10h ch[4] #define c9h ch[5] #define c8h ch[6] #define c7h ch[7] #define c6h ch[8] #define c5h ch[9] #define c4h ch[10] #define c3h ch[11] #define c2h ch[12] #define c1h ch[13] #define c7l cl[0] #define c6l cl[1] #define c5l cl[2] #define c4l cl[3] #define c3l cl[4] #define c2l cl[5] #define c1l cl[6] #define PREFETCH_POLY_ACCURATE #else /* not(defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)), assuming Itanium, otherwise we shouldn't be there */ #define PREFETCH_POLY_QUICK c7=c[0]; c6=c[1]; c5=c[2]; c4=c[3]; c3=c[4]; c2=c[5]; #define PREFETCH_POLY_ACCURATE c14h=ch[0]; c13h=ch[1]; c12h=ch[2]; \ c11h=ch[3]; c10h=ch[4]; c9h=ch[5]; c8h=ch[6]; \ c7h=ch[7]; c6h=ch[8]; c5h=ch[9]; c4h=ch[10]; \ c3h=ch[11]; c2h=ch[12]; c1h=ch[13]; \ c7l=cl[0]; c6l=cl[1]; c5l=cl[2]; c4l=cl[3]; c3l=cl[4]; c2l=cl[5]; c1l=cl[6]; #endif /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ static const long double log2H = 6.93147180559945309428690474184975300886435434222221e-01L ; static const long double log2L = -1.14583527267987328109462081210062935494878745868567e-20L ; static const long double ch[14] = { /* ch14 = */ -7.14324161786485507414918953716931326880512642674148e-02L, /* ch13 = */ 7.69266652810744782218957231456624157317492063157260e-02L, /* ch12 = */ -8.33333332381758034492348456712118576206194120459259e-02L, /* ch11 = */ 9.09090908332141065513009973997338164508619229309261e-02L, /* ch10 = */ -1.00000000000001207646721339272755102456358144991100e-01L, /* ch9 = */ 1.11111111111111906697159444623590474066077149473131e-01L, /* ch8 = */ -1.24999999999999999993223736421965597287453419994563e-01L, /* ch7 = */ 1.42857142857142857140921067549133027796415262855589e-01L, /* ch6 = */ -1.66666666666666666671184175718689601808364386670291e-01L, /* ch5 = */ 2.00000000000000000002710505431213761085018632002175e-01L, /* ch4 = */ -2.50000000000000000000000000000000000000000000000000e-01L, /* ch3 = */ 3.33333333333333333342368351437379203616728773340583e-01L, /* ch2 = */ -5.00000000000000000000000000000000000000000000000000e-01L, /* ch1 = */ 1.00000000000000000000000000000000000000000000000000e+00L, }; static const long double cl[8] = { /* cl7 = */ -2.34607301544056142329539178188626637856988425622953e-21L, /* cl6 = */ 4.51747965172264117284728817178707773935320194423540e-21L, /* cl5 = */ -2.71049445588233034921278017356112411600953390125340e-21L, /* cl4 = */ 4.66256664939948057471422101604617896775339795184375e-32L, /* cl3 = */ -9.03501810405641912072078793108404620486918713178584e-21L, /* cl2 = */ -2.17279608948233676401606923369245026501745724471211e-38L, /* cl1 = */ 1.65533283613483715658161425689915551329447733519200e-39L, }; typedef struct rri_tag {float r; long double logirh; long double logirl; } rri ; static const rri argredtable[128] = { { 1.00000000000000000000000000000000000000000000000000e+00L, /* r[0] */ 0.00000000000000000000000000000000000000000000000000e+00L, /* logirh[0] */ 0.00000000000000000000000000000000000000000000000000e+00L, /* logirl[0] */ } , { 9.92187500000000000000000000000000000000000000000000e-01L, /* r[1] */ 7.84317746102589287284596788335511163836599735077471e-03L, /* logirh[1] */ 3.38074607588470016237165513745732472460993853200422e-22L, /* logirl[1] */ } , { 9.84375000000000000000000000000000000000000000000000e-01L, /* r[2] */ 1.57483569681391686082786579570225171664787922054529e-02L, /* logirh[2] */ -7.29146496194247645559133241782926476205899642506092e-22L, /* logirl[2] */ } , { 9.77050781250000000000000000000000000000000000000000e-01L, /* r[3] */ 2.32166515756649942034666594947722728647931944578886e-02L, /* logirh[3] */ 8.16575450536547381330756941074595397347505963439697e-22L, /* logirl[3] */ } , { 9.69726562500000000000000000000000000000000000000000e-01L, /* r[4] */ 3.07411415542805019917064427575903451383965148124844e-02L, /* logirh[4] */ 7.52695325012824272079306803804945762930133964168774e-22L, /* logirl[4] */ } , { 9.62402343750000000000000000000000000000000000000000e-01L, /* r[5] */ 3.83226790066782003103828830453680964751583815086633e-02L, /* logirh[5] */ 1.32588478845446750814375495501523698113568837341268e-21L, /* logirl[5] */ } , { 9.55078125000000000000000000000000000000000000000000e-01L, /* r[6] */ 4.59621355646357592953472545604931553953065304085612e-02L, /* logirh[6] */ -4.35764480179623995168944249774175041700203429439418e-22L, /* logirl[6] */ } , { 9.48242187500000000000000000000000000000000000000000e-01L, /* r[7] */ 5.31453373081281829112658150054970818132460408378392e-02L, /* logirh[7] */ 1.44205225309117178233184984742382173167310218612172e-21L, /* logirl[7] */ } , { 9.41406250000000000000000000000000000000000000000000e-01L, /* r[8] */ 6.03805109889074798701694406916073987190429761540145e-02L, /* logirh[8] */ 1.27621226298941086768118279123481924424995440912208e-21L, /* logirl[8] */ } , { 9.34082031250000000000000000000000000000000000000000e-01L, /* r[9] */ 6.81910167191455281494459790547768562873898190446198e-02L, /* logirh[9] */ -1.70880559998991196112313542261373401163426418187142e-21L, /* logirl[9] */ } , { 9.27734375000000000000000000000000000000000000000000e-01L, /* r[10] */ 7.50098210048665755422673054320092944635689491406083e-02L, /* logirh[10] */ 2.27568935135100192738710607079520297834759644719280e-21L, /* logirl[10] */ } , { 9.20898437500000000000000000000000000000000000000000e-01L, /* r[11] */ 8.24055229659955995008915365096502370079178945161402e-02L, /* logirh[11] */ -2.08652677548826307173863192982976527450361189636477e-21L, /* logirl[11] */ } , { 9.14062500000000000000000000000000000000000000000000e-01L, /* r[12] */ 8.98563291218610470738304384086259091191095649264753e-02L, /* logirh[12] */ 2.81649638824005330910700533403251014557157154610229e-21L, /* logirl[12] */ } , { 9.07714843750000000000000000000000000000000000000000e-01L, /* r[13] */ 9.68249984379543874202667802508770478198130149394274e-02L, /* logirh[13] */ 3.68094693298691578446114201021493215549389467689654e-22L, /* logirl[13] */ } , { 9.01367187500000000000000000000000000000000000000000e-01L, /* r[14] */ 1.03842571096600936786835851777244243976383586414158e-01L, /* logirh[14] */ 2.54338872616873521380798016729106577000795946658943e-21L, /* logirl[14] */ } , { 8.95019531250000000000000000000000000000000000000000e-01L, /* r[15] */ 1.10909738319693389317513541186821512951610202435404e-01L, /* logirh[15] */ 2.35644659310271753015106107980519412012017300780629e-21L, /* logirl[15] */ } , { 8.88671875000000000000000000000000000000000000000000e-01L, /* r[16] */ 1.18027206088557368998193455866818624144798377528787e-01L, /* logirh[16] */ -2.70388097791548543320098495660860118836293912482208e-21L, /* logirl[16] */ } , { 8.82812500000000000000000000000000000000000000000000e-01L, /* r[17] */ 1.24642445207276597340148149156702217510428454261273e-01L, /* logirh[17] */ -1.65479256548791301121285753303466491277640159570672e-21L, /* logirl[17] */ } , { 8.76953125000000000000000000000000000000000000000000e-01L, /* r[18] */ 1.31301737297253491506014363987553394963470054790378e-01L, /* logirh[18] */ -4.44706169007428370264461881106553970898124442872790e-21L, /* logirl[18] */ } , { 8.70605468750000000000000000000000000000000000000000e-01L, /* r[19] */ 1.38566368296257995358167561250617438872723141685128e-01L, /* logirh[19] */ -4.67634371291677236899800289793824808374204801868093e-22L, /* logirl[19] */ } , { 8.64746093750000000000000000000000000000000000000000e-01L, /* r[20] */ 1.45319348376564863616804482160382860911340685561299e-01L, /* logirh[20] */ -1.30029933894575998199859720642569228712037418444249e-21L, /* logirl[20] */ } , { 8.58886718750000000000000000000000000000000000000000e-01L, /* r[21] */ 1.52118241421840233982849116545210677031718660145998e-01L, /* logirh[21] */ 3.64354833902581289681945250205165982842948711023632e-21L, /* logirl[21] */ } , { 8.53515625000000000000000000000000000000000000000000e-01L, /* r[22] */ 1.58391429943917633934029505493601419630067539401352e-01L, /* logirh[22] */ 5.27932393193803736951671071669282537406718712467109e-21L, /* logirl[22] */ } , { 8.47656250000000000000000000000000000000000000000000e-01L, /* r[23] */ 1.65280090939102924306155009692709256796661065891385e-01L, /* logirh[23] */ -2.81510601283365227976423953518023725736246907863349e-21L, /* logirl[23] */ } , { 8.42285156250000000000000000000000000000000000000000e-01L, /* r[24] */ 1.71636656693938272180742846129142264999245526269078e-01L, /* logirh[24] */ 5.29375472570288169027310108578005956387644768823013e-21L, /* logirl[24] */ } , { 8.36425781250000000000000000000000000000000000000000e-01L, /* r[25] */ 1.78617487835278495469731006861646704919621697627008e-01L, /* logirh[25] */ -5.38910368385932491449404580991668679267931166391590e-21L, /* logirl[25] */ } , { 8.31054687500000000000000000000000000000000000000000e-01L, /* r[26] */ 1.85059677026078958999807423657646410219967947341502e-01L, /* logirh[26] */ -2.33471191752401180750814334631327570292249238444557e-21L, /* logirl[26] */ } , { 8.25683593750000000000000000000000000000000000000000e-01L, /* r[27] */ 1.91543637260818105263310805186360852303550927899778e-01L, /* logirh[27] */ -6.00441704121360115108475562878860059804996577890616e-22L, /* logirl[27] */ } , { 8.20312500000000000000000000000000000000000000000000e-01L, /* r[28] */ 1.98069913762093794816921549228894150473934132605791e-01L, /* logirh[28] */ 2.34598738644875224435499574368287811489905562806854e-21L, /* logirl[28] */ } , { 8.15429687500000000000000000000000000000000000000000e-01L, /* r[29] */ 2.04040080748597612311876631219220712409878615289927e-01L, /* logirh[29] */ -6.55266084220369778013064711105338848331692231543846e-23L, /* logirl[29] */ } , { 8.10058593750000000000000000000000000000000000000000e-01L, /* r[30] */ 2.10648695968953912917276914684716615511206327937543e-01L, /* logirh[30] */ -1.26710049189072313882986012728331847015236776848568e-21L, /* logirl[30] */ } , { 8.05175781250000000000000000000000000000000000000000e-01L, /* r[31] */ 2.16694663599799501227903542055486241224571131169796e-01L, /* logirh[31] */ -4.60644559263224179134698153089361151013881754428009e-21L, /* logirl[31] */ } , { 7.99804687500000000000000000000000000000000000000000e-01L, /* r[32] */ 2.23387721746383670218673127283448565094658988527954e-01L, /* logirh[32] */ 4.31742844476737192308069645283904795344591963380062e-21L, /* logirl[32] */ } , { 7.94921875000000000000000000000000000000000000000000e-01L, /* r[33] */ 2.29511439596912796321610469862939396534784464165568e-01L, /* logirh[33] */ 3.43937426407325242308884173752237970071183767432875e-21L, /* logirl[33] */ } , { 7.90039062500000000000000000000000000000000000000000e-01L, /* r[34] */ 2.35672888540961404738862880470229299589846050366759e-01L, /* logirh[34] */ -1.79412857504879722290348395953977521127195555595173e-21L, /* logirl[34] */ } , { 7.85156250000000000000000000000000000000000000000000e-01L, /* r[35] */ 2.41872536420486724268049359698462552614728338085115e-01L, /* logirh[35] */ 4.49037868070153677475908787622962677106946524955373e-21L, /* logirl[35] */ } , { 7.80273437500000000000000000000000000000000000000000e-01L, /* r[36] */ 2.48110859833178427105411859021621978627081261947751e-01L, /* logirh[36] */ -3.57593208515654235641923519987160957618932290654994e-21L, /* logirl[36] */ } , { 7.75878906250000000000000000000000000000000000000000e-01L, /* r[37] */ 2.53758819622682423467613377354723525058943778276443e-01L, /* logirh[37] */ 3.20563840854194897949310719402625620635813869593052e-21L, /* logirl[37] */ } , { 7.70996093750000000000000000000000000000000000000000e-01L, /* r[38] */ 2.60071971903756312988632154459267553647805470973253e-01L, /* logirh[38] */ -5.41882056366019440034410441132485333532494541348922e-21L, /* logirl[38] */ } , { 7.66601562500000000000000000000000000000000000000000e-01L, /* r[39] */ 2.65788087817044662143715211266581377458351198583841e-01L, /* logirh[39] */ 3.40143368552141502891849732509800494117246716875116e-21L, /* logirl[39] */ } , { 7.61718750000000000000000000000000000000000000000000e-01L, /* r[40] */ 2.72177885915815673289249593258531945139111485332251e-01L, /* logirh[40] */ -8.84633307151349513479527937859825353954577224837834e-22L, /* logirl[40] */ } , { 7.57324218750000000000000000000000000000000000000000e-01L, /* r[41] */ 2.77963822982859581314958596909292509735678322613239e-01L, /* logirh[41] */ -3.54474552917897427055990528561562900487032834630297e-21L, /* logirl[41] */ } , { 7.52929687500000000000000000000000000000000000000000e-01L, /* r[42] */ 2.83783432036123604418629065571089142849814379587770e-01L, /* logirh[42] */ 6.65259732689538164307466344899173176872160839687638e-21L, /* logirl[42] */ } , { 7.48535156250000000000000000000000000000000000000000e-01L, /* r[43] */ 2.89637107287584277988401471048973689903505146503448e-01L, /* logirh[43] */ 8.44502718672055373787764268905081131551582182658017e-21L, /* logirl[43] */ } , { 7.44140625000000000000000000000000000000000000000000e-01L, /* r[44] */ 2.95525249912806820310438860044399689286365173757076e-01L, /* logirh[44] */ 1.96418844037132387179566864994176219064092063775800e-21L, /* logirl[44] */ } , { 7.39746093750000000000000000000000000000000000000000e-01L, /* r[45] */ 3.01448268215928886712157847016513301241502631455660e-01L, /* logirh[45] */ -2.80734803827355347488954127622224279750224052590805e-21L, /* logirl[45] */ } , { 7.35839843750000000000000000000000000000000000000000e-01L, /* r[46] */ 3.06742787532902944200221412307527657503669615834951e-01L, /* logirh[46] */ 1.21982177874199009422425119496965659738938728771737e-20L, /* logirl[46] */ } , { 7.31445312500000000000000000000000000000000000000000e-01L, /* r[47] */ 3.12732822082233615765050824264470463731413474306464e-01L, /* logirh[47] */ -2.48117014916151417666322195359345625530313936737052e-21L, /* logirl[47] */ } , { 7.27050781250000000000000000000000000000000000000000e-01L, /* r[48] */ 3.18758953475389418655326981277831066563521744683385e-01L, /* logirh[48] */ 6.18924657142483596407123884547314261312268979674812e-21L, /* logirl[48] */ } , { 7.23144531250000000000000000000000000000000000000000e-01L, /* r[49] */ 3.24146171891599621094504773965994104401033837348223e-01L, /* logirh[49] */ -6.77810676502059511550248363328884520138042030679722e-21L, /* logirl[49] */ } , { 7.19238281250000000000000000000000000000000000000000e-01L, /* r[50] */ 3.29562569696768133456748345322395721268549095839262e-01L, /* logirh[50] */ 3.36942877993616991096538545261104308752103794630367e-21L, /* logirl[50] */ } , { 7.14843750000000000000000000000000000000000000000000e-01L, /* r[51] */ 3.35691291638141535192156258982087990716536296531558e-01L, /* logirh[51] */ -9.33627664815897075676848962806562975738122262236195e-22L, /* logirl[51] */ } , { 7.10937500000000000000000000000000000000000000000000e-01L, /* r[52] */ 3.41170757402767124748460894623214301191183039918542e-01L, /* logirh[52] */ 1.33237705755233408947468410861546874819170412376378e-20L, /* logirl[52] */ } , { 1.41406250000000000000000000000000000000000000000000e+00L, /* r[53] */ -3.46466767346208580905441917763276649111503502354026e-01L, /* logirh[53] */ -1.30202706624963016000170912600455670740294985927040e-20L, /* logirl[53] */ } , { 1.40625000000000000000000000000000000000000000000000e+00L, /* r[54] */ -3.40926586970593210293607733252230218568001873791218e-01L, /* logirh[54] */ -1.14814665281259898750718236421526040752891815931201e-20L, /* logirl[54] */ } , { 1.39843750000000000000000000000000000000000000000000e+00L, /* r[55] */ -3.35355541921137830261656978536599638118786970153451e-01L, /* logirh[55] */ 4.47739872243343904426499770912991919745896227107013e-21L, /* logirl[55] */ } , { 1.39160156250000000000000000000000000000000000000000e+00L, /* r[56] */ -3.30455287103297806430195551752326821315364213660359e-01L, /* logirh[56] */ -3.27456892866201886570311318311258813067527495773846e-21L, /* logirl[56] */ } , { 1.38378906250000000000000000000000000000000000000000e+00L, /* r[57] */ -3.24825434091227342270433858795186665702203754335642e-01L, /* logirh[57] */ 1.19511796024320905916745808450236450294857297262032e-20L, /* logirl[57] */ } , { 1.37597656250000000000000000000000000000000000000000e+00L, /* r[58] */ -3.19163706299227122796481267985591045999171910807490e-01L, /* logirh[58] */ 6.90202297465146164725318961579993617833444966789173e-21L, /* logirl[58] */ } , { 1.36914062500000000000000000000000000000000000000000e+00L, /* r[59] */ -3.14183261995082305749471540678996461792849004268646e-01L, /* logirh[59] */ 4.21220977458500148787692752842598753888865534619897e-21L, /* logirl[59] */ } , { 1.36132812500000000000000000000000000000000000000000e+00L, /* r[60] */ -3.08460785721016099366091275935097826277342392131686e-01L, /* logirh[60] */ 4.88237814815281499208804200664728929895975484184937e-21L, /* logirl[60] */ } , { 1.35449218750000000000000000000000000000000000000000e+00L, /* r[61] */ -3.03426614715378494924018226708284373671631328761578e-01L, /* logirh[61] */ -4.79684803634605371547569285269009577973457927997898e-21L, /* logirl[61] */ } , { 1.34765625000000000000000000000000000000000000000000e+00L, /* r[62] */ -2.98366972551797281470575134987299747990618925541639e-01L, /* logirh[62] */ 5.67470469380282997916448622011708142111988647148768e-21L, /* logirl[62] */ } , { 1.33984375000000000000000000000000000000000000000000e+00L, /* r[63] */ -2.92553002686377439973833616826404124822147423401475e-01L, /* logirh[63] */ -4.36764183772251948513980052351746496236270975543032e-21L, /* logirl[63] */ } , { 1.33300781250000000000000000000000000000000000000000e+00L, /* r[64] */ -2.87437902019607012987821928473586297059227945283055e-01L, /* logirh[64] */ 5.29838789814029919861828480804189667231634001130568e-21L, /* logirl[64] */ } , { 1.32617187500000000000000000000000000000000000000000e+00L, /* r[65] */ -2.82296502519188342454669118919419190660846652463078e-01L, /* logirh[65] */ -1.23161531041331401059141407104196718032007794736410e-20L, /* logirl[65] */ } , { 1.31933593750000000000000000000000000000000000000000e+00L, /* r[66] */ -2.77128532360745762785523768623185958404064876958728e-01L, /* logirh[66] */ -2.43881362128685466800250141549314299428343038574346e-21L, /* logirl[66] */ } , { 1.31250000000000000000000000000000000000000000000000e+00L, /* r[67] */ -2.71933715483641758834396431887547862515930319204926e-01L, /* logirh[67] */ 2.72693735454870053343005187033588239526260949526707e-21L, /* logirl[67] */ } , { 1.30566406250000000000000000000000000000000000000000e+00L, /* r[68] */ -2.66711771502490083769927597945326169792679138481617e-01L, /* logirh[68] */ -1.30538831184550256981566412802003295683583076000542e-20L, /* logirl[68] */ } , { 1.29980468750000000000000000000000000000000000000000e+00L, /* r[69] */ -2.62214012795658537999981055333087454073393018916249e-01L, /* logirh[69] */ -1.35284639805347646364569630725426945939555870993862e-20L, /* logirl[69] */ } , { 1.29296875000000000000000000000000000000000000000000e+00L, /* r[70] */ -2.56940930897500425454356778875997235900285886600614e-01L, /* logirh[70] */ 7.59691096477297380738769966672131808838423827917718e-21L, /* logirl[70] */ } , { 1.28613281250000000000000000000000000000000000000000e+00L, /* r[71] */ -2.51639896143827947226981334161166614649118855595589e-01L, /* logirh[71] */ 1.08451820776528904003677301321556919497451301342926e-20L, /* logirl[71] */ } , { 1.28027343750000000000000000000000000000000000000000e+00L, /* r[72] */ -2.47073678164246748038433351690734696148865623399615e-01L, /* logirh[72] */ -2.70934348074983423389837544898983311835569196319188e-22L, /* logirl[72] */ } , { 1.27343750000000000000000000000000000000000000000000e+00L, /* r[73] */ -2.41719936887145168147327835284077224287102581001818e-01L, /* logirh[73] */ 3.02031937056332418377432311426563822398827693734850e-21L, /* logirl[73] */ } , { 1.26757812500000000000000000000000000000000000000000e+00L, /* r[74] */ -2.37108091664582209921611002934049849955044919624925e-01L, /* logirh[74] */ -1.29385562718796125049667754614832437256004301349817e-21L, /* logirl[74] */ } , { 1.26074218750000000000000000000000000000000000000000e+00L, /* r[75] */ -2.31700585247189405499685169176338206398213515058160e-01L, /* logirh[75] */ 6.62539371561050126516331629758628121599171156714272e-21L, /* logirl[75] */ } , { 1.25488281250000000000000000000000000000000000000000e+00L, /* r[76] */ -2.27042191729867078774313463029876913878979394212365e-01L, /* logirh[76] */ -5.91897037580049650648090820667969090523023685061856e-21L, /* logirl[76] */ } , { 1.24902343750000000000000000000000000000000000000000e+00L, /* r[77] */ -2.22361995979389595864202273933774023362275329418480e-01L, /* logirh[77] */ 1.99231806901499648836052705402258881903978292639586e-21L, /* logirl[77] */ } , { 1.24316406250000000000000000000000000000000000000000e+00L, /* r[78] */ -2.17659792957953425506303912762007257697405293583870e-01L, /* logirh[78] */ -4.74300907803349351890305548951624396775339872866125e-22L, /* logirl[78] */ } , { 1.23632812500000000000000000000000000000000000000000e+00L, /* r[79] */ -2.12145797104668402385590705860884952471678843721747e-01L, /* logirh[79] */ 3.47829660766824246239119087253730459399781610669550e-21L, /* logirl[79] */ } , { 1.23046875000000000000000000000000000000000000000000e+00L, /* r[80] */ -2.07395194346070587155541307955441965304999030195177e-01L, /* logirh[80] */ -3.20427089356426854873522351022491299412381577686272e-21L, /* logirl[80] */ } , { 1.22460937500000000000000000000000000000000000000000e+00L, /* r[81] */ -2.02621915593412910716630305485441709834049106575549e-01L, /* logirh[81] */ 5.50315183352228080702347654662068966867864577851415e-21L, /* logirl[81] */ } , { 1.21875000000000000000000000000000000000000000000000e+00L, /* r[82] */ -1.97825743329919880362068387857910067850752966478467e-01L, /* logirh[82] */ -5.03683339051401224496307307364812285151080899609793e-22L, /* logirl[82] */ } , { 1.21289062500000000000000000000000000000000000000000e+00L, /* r[83] */ -1.93006456893970980236542936414601001615665154531598e-01L, /* logirh[83] */ -8.56513039583118089646992381309540829893520394889616e-22L, /* logirl[83] */ } , { 1.20800781250000000000000000000000000000000000000000e+00L, /* r[84] */ -1.88972566793034805259442719671536536907296977005899e-01L, /* logirh[84] */ -1.46116025447516430873070498908178881036913039739167e-21L, /* logirl[84] */ } , { 1.20214843750000000000000000000000000000000000000000e+00L, /* r[85] */ -1.84110320585000416173803057529045901219433289952576e-01L, /* logirh[85] */ -4.15395156136845605789354429056953059762833513205358e-21L, /* logirl[85] */ } , { 1.19628906250000000000000000000000000000000000000000e+00L, /* r[86] */ -1.79224317379374265237954554075283652991856797598302e-01L, /* logirh[86] */ -1.94838468168540457849663379542888863164719363528710e-21L, /* logirl[86] */ } , { 1.19042968750000000000000000000000000000000000000000e+00L, /* r[87] */ -1.74314323881818430785127331528183702857859316281974e-01L, /* logirh[87] */ 6.22657527069549481059986868787317656634503241639655e-21L, /* logirl[87] */ } , { 1.18554687500000000000000000000000000000000000000000e+00L, /* r[88] */ -1.70204166019990477397598113706855826876562787219882e-01L, /* logirh[88] */ 2.71497198375317303100785063981453318980131866492304e-21L, /* logirl[88] */ } , { 1.17968750000000000000000000000000000000000000000000e+00L, /* r[89] */ -1.65249572895307162873914340328607153196571744047105e-01L, /* logirh[89] */ -1.69710894863316053274660137780472619090744715377758e-21L, /* logirl[89] */ } , { 1.17382812500000000000000000000000000000000000000000e+00L, /* r[90] */ -1.60270309495699794511943195307601683907705591991544e-01L, /* logirh[90] */ -6.04821814795533552862893869629633677033284792785115e-21L, /* logirl[90] */ } , { 1.16894531250000000000000000000000000000000000000000e+00L, /* r[91] */ -1.56101899958520053736952051814945718888338888064027e-01L, /* logirh[91] */ 4.40261722062672347380361273563329366574299418033041e-21L, /* logirl[91] */ } , { 1.16406250000000000000000000000000000000000000000000e+00L, /* r[92] */ -1.51916042025841975066048281095554273179004667326808e-01L, /* logirh[92] */ -5.75514380133023814872665374682664797890000868696983e-21L, /* logirl[92] */ } , { 1.15820312500000000000000000000000000000000000000000e+00L, /* r[93] */ -1.46869773958217667795276076270205578566674375906587e-01L, /* logirh[93] */ 3.74542574364605198240110299363146340829881458953744e-21L, /* logirl[93] */ } , { 1.15332031250000000000000000000000000000000000000000e+00L, /* r[94] */ -1.42645010597909210864992976541820723923592595383525e-01L, /* logirh[94] */ -1.49668764603399746810002277800399641956108986115277e-21L, /* logirl[94] */ } , { 1.14843750000000000000000000000000000000000000000000e+00L, /* r[95] */ -1.38402322859119135682777479434690803827834315598011e-01L, /* logirh[95] */ -2.54839416695838356532650800861069791639429031347559e-21L, /* logirl[95] */ } , { 1.14257812500000000000000000000000000000000000000000e+00L, /* r[96] */ -1.33287222192348708683213263925804170639821677468717e-01L, /* logirh[96] */ -6.43489158716437030647791169560962525141739108779860e-21L, /* logirl[96] */ } , { 1.13769531250000000000000000000000000000000000000000e+00L, /* r[97] */ -1.29004560400347845734790423743998388772524776868522e-01L, /* logirh[97] */ 4.12743043068895141295491814920903816740508819920186e-21L, /* logirl[97] */ } , { 1.13281250000000000000000000000000000000000000000000e+00L, /* r[98] */ -1.24703478500957235860374400920891346800090104807168e-01L, /* logirh[98] */ -3.03211445997192169150157656625233654585699365130551e-21L, /* logirl[98] */ } , { 1.12792968750000000000000000000000000000000000000000e+00L, /* r[99] */ -1.20383817356440820990376872751115300275159825105220e-01L, /* logirh[99] */ -6.02804224141392601725339572746961606433931174921632e-22L, /* logirl[99] */ } , { 1.12304687500000000000000000000000000000000000000000e+00L, /* r[100] */ -1.16045415757842655255155980137393711970617005135864e-01L, /* logirh[100] */ 1.97357499841142715648611745206675471003368015857707e-21L, /* logirl[100] */ } , { 1.11816406250000000000000000000000000000000000000000e+00L, /* r[101] */ -1.11688110388886928867871375231635155955700611229986e-01L, /* logirh[101] */ -1.80234734539512005333983723608110499312624517402909e-21L, /* logirl[101] */ } , { 1.11328125000000000000000000000000000000000000000000e+00L, /* r[102] */ -1.07311735789088050666375585839862338843886391259730e-01L, /* logirh[102] */ -7.99444531291997962572940662749597218537387594367069e-22L, /* logirl[102] */ } , { 1.10839843750000000000000000000000000000000000000000e+00L, /* r[103] */ -1.02916124316049955441049277432563613388083467725664e-01L, /* logirh[103] */ -7.70418045355390537427085452827290090533981671198214e-22L, /* logirl[103] */ } , { 1.10351562500000000000000000000000000000000000000000e+00L, /* r[104] */ -9.85011061069331584304480803337966676735959481447935e-02L, /* logirh[104] */ 2.64634661517646879820354995203947987149684385342190e-21L, /* logirl[104] */ } , { 1.09863281250000000000000000000000000000000000000000e+00L, /* r[105] */ -9.40665090390674124196622452043214934747084043920040e-02L, /* logirh[105] */ -7.85013737527153642092056782136336663408299656719499e-22L, /* logirl[105] */ } , { 1.09375000000000000000000000000000000000000000000000e+00L, /* r[106] */ -8.96121586896871326189772770376418264959283987991512e-02L, /* logirh[106] */ -9.74192340842702289248316897714444315823596817643550e-22L, /* logirl[106] */ } , { 1.08984375000000000000000000000000000000000000000000e+00L, /* r[107] */ -8.60343373418031533820279736779479407005055691115558e-02L, /* logirh[107] */ 2.30146955951865559597249227413865587554269312860475e-22L, /* logirl[107] */ } , { 1.08496093750000000000000000000000000000000000000000e+00L, /* r[108] */ -8.15439840401769007739956988956020467185226152651012e-02L, /* logirh[108] */ 1.75068599249270760931371736454488137316032510066418e-22L, /* logirl[108] */ } , { 1.08007812500000000000000000000000000000000000000000e+00L, /* r[109] */ -7.70333764828270145253981751598537641712027834728360e-02L, /* logirh[109] */ 2.18898335885222504011340723675649479553611259830224e-21L, /* logirl[109] */ } , { 1.07519531250000000000000000000000000000000000000000e+00L, /* r[110] */ -7.25023311232268688402238278334355214838069514371455e-02L, /* logirh[110] */ -2.13213366575366793826831658963525268068913415683098e-21L, /* logirl[110] */ } , { 1.07128906250000000000000000000000000000000000000000e+00L, /* r[111] */ -6.88626546757771517366978307472802356414831592701375e-02L, /* logirh[111] */ -3.28324237603869825985548439776523090582575800369088e-22L, /* logirl[111] */ } , { 1.06640625000000000000000000000000000000000000000000e+00L, /* r[112] */ -6.42943507053972572172256989830874118752035428769886e-02L, /* logirh[112] */ 9.97248717475917389385548315283734311163209646118044e-22L, /* logirl[112] */ } , { 1.06250000000000000000000000000000000000000000000000e+00L, /* r[113] */ -6.06246218164348425809463336011440048878284869715571e-02L, /* logirh[113] */ 3.40201560723741601617729662632506532290642311489711e-22L, /* logirl[113] */ } , { 1.05761718750000000000000000000000000000000000000000e+00L, /* r[114] */ -5.60184414015375172410100661213316897146796691231430e-02L, /* logirh[114] */ 3.11800048645913474307950146912226463632967430723724e-23L, /* logirl[114] */ } , { 1.05371093750000000000000000000000000000000000000000e+00L, /* r[115] */ -5.23181596586815653583246027436004510491329710930586e-02L, /* logirh[115] */ 1.68615246867707396959723624602535685414462357313269e-21L, /* logirl[115] */ } , { 1.04882812500000000000000000000000000000000000000000e+00L, /* r[116] */ -4.76734694693569028189818886920292584363778587430716e-02L, /* logirh[116] */ 1.02131487169049086541356584124809714333053944625270e-21L, /* logirl[116] */ } , { 1.04492187500000000000000000000000000000000000000000e+00L, /* r[117] */ -4.39421218564987631503880941008510774281603517010808e-02L, /* logirh[117] */ 3.19036974975549018917247656911137538435844307015502e-22L, /* logirl[117] */ } , { 1.04101562500000000000000000000000000000000000000000e+00L, /* r[118] */ -4.01967991263367551645860776404761693925138388294727e-02L, /* logirh[118] */ -5.75643838660911109663810221439950742515738641098385e-22L, /* logirl[118] */ } , { 1.03613281250000000000000000000000000000000000000000e+00L, /* r[119] */ -3.54953330145300408896490932525447092871218046639115e-02L, /* logirh[119] */ 9.92857944898394620246865383584341693120429858950945e-23L, /* logirl[119] */ } , { 1.03222656250000000000000000000000000000000000000000e+00L, /* r[120] */ -3.17181802707845397290716514537844972210223204456270e-02L, /* logirh[120] */ -1.96176892105841918795869133037686185923113451571873e-22L, /* logirl[120] */ } , { 1.02832031250000000000000000000000000000000000000000e+00L, /* r[121] */ -2.79267065345224074627335925091742296899610664695501e-02L, /* logirh[121] */ 5.86417835518487049711934217680032678831410128853609e-22L, /* logirl[121] */ } , { 1.02441406250000000000000000000000000000000000000000e+00L, /* r[122] */ -2.41208027968440809158740456216718506254892417928204e-02L, /* logirh[122] */ 3.02985243973796148231999463903827273031077578359612e-22L, /* logirl[122] */ } , { 1.01953125000000000000000000000000000000000000000000e+00L, /* r[123] */ -1.93429628431309346365065977152442044939562038052827e-02L, /* logirh[123] */ 6.01063173693734308460897092397749141966269930081944e-22L, /* logirl[123] */ } , { 1.01562500000000000000000000000000000000000000000000e+00L, /* r[124] */ -1.55041865359652541508843977442755335260926585760899e-02L, /* logirh[124] */ 3.03517018286976482243336130818153212447067590236466e-23L, /* logirl[124] */ } , { 1.01171875000000000000000000000000000000000000000000e+00L, /* r[125] */ -1.16506172199752741354571356803548898284361712285317e-02L, /* logirh[125] */ -1.34307128859459104723409399281441278120110731736138e-22L, /* logirl[125] */ } , { 1.00781250000000000000000000000000000000000000000000e+00L, /* r[126] */ -7.78214044205494894757658497566610300566480873385444e-03L, /* logirh[126] */ 1.13684914529339327537355164185463042556838581909991e-22L, /* logirl[126] */ } , { 1.00390625000000000000000000000000000000000000000000e+00L, /* r[127] */ -3.89864041565732301388162890642963276377486181445420e-03L, /* logirh[127] */ -5.57141894132742469511718763808942289917039607877533e-23L, /* logirl[127] */ } }; interval-2.1.0/src/crlibm/log-de2.c0000644000000000000000000001706313031036767015135 0ustar 00000000000000/* *this function computes log, correctly rounded, using experimental techniques based on double-extended arithmetic THIS IS EXPERIMENTAL SOFTWARE In particular it changes rounding modes all the time without warning nor restoring. * * Author : Florent de Dinechin * Florent.de.Dinechin at ens-lyon.fr * To have it replace the crlibm log, do: on pentium, gcc -DHAVE_CONFIG_H -I. -fPIC -O2 -c log-de2.c; mv log-de2.o log_fast.o; make on itanium, icc -I/users/fdedinex/local/IA64/include -mcpu=itanium2\ -Qoption,cpp,--extended_float_types -IPF_fp_speculationsafe -c log-de2.c;\ mv log-de2.o log_fast.o; make */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "double-extended.h" #include "log-de2.h" double log_rn(double x) { double wi; #if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) db_number y; int E, i, index, roundtestmask; long double r, logirh, logirl, z, z2, z4, t,evenp,oddp, th, tl, eh,el,p1,p2,p3; #else long int E, i; unsigned long int index, roundtestmask; __fpreg xe, ye, r, logirh, logirl, z, z2, z4, t,evenp,oddp, th, tl, eh,el, c1,c2,c3,c4,c5,c6,p1,p2,p3; #endif E=0; #if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) /* Pentium has few registers, so load coefficients directly from memory */ #define c6 c[0] #define c5 c[1] #define c4 c[2] #define c3 c[3] #define c2 c[4] #define c1 c[5] /* Special case hadling on a x86 */ y.d=x; /* Filter special cases */ if (y.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((y.i[HI] & 0x7fffffff)|y.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (y.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -64; y.d *= two64; /* make x a normal number */ } if (y.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } DOUBLE_EXTENDED_MODE; /* This one should be overlapped with integer computation */ #define X_NEAR_1 (y.i[HI]>MINYFAST) && (y.i[HI]= 0x7ff0000000000000ULL), (1+1==3) )){ if (i >= 0x7ff0000000000000ULL){ return x+x; /* Inf or Nan */ } #define X_NEAR_1 __builtin_expect((i>(((uint64_t) MINYFAST)<<32)) && (i<(((uint64_t) MAXYFAST)<<32)), (1+1==3)) #endif if(X_NEAR_1) { roundtestmask=0x7fc; z = x - 1 ; /* Sterbenz exact */ z2 = z*z; evenp = c6; /* c6 */ oddp = c5; /* c5 */ evenp = c4 + z2 * evenp; /* c4 */ oddp = c3 + z2 * oddp; /* c3 */ evenp = c2 + z2 * evenp; /* c2 */ t = c1 + (z * evenp + z2 * oddp); t = z*t; //printf("z= %1.20e, t=%1.20e \n ", (double)z, (double)t); } else { #if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) /* Extract exponent and mantissa */ E += (y.i[HI]>>20)-1023; /* extract the exponent */ index = (y.i[HI] & 0x000fffff); y.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = index >> (20-L); /* now y.d holds 1+f, and E is the exponent */ logirh = argredtable[index].h; r = (long double) (argredtable[index].r); /* approx to 1/y.d */ z = r*(long double)y.d - 1. ; /* even without an FMA, all exact */ if(E>12 || E<-12) { /* faster and less accurate polynomial evaluation */ roundtestmask=0x7fe; p1 = logirh + z*c1; p2 = c2 + z*c3; p3 = c4 + z*c5; z2 = z*z; p1 = p1 + z2*p2; p3 = p3 + z2*c6; z4=z2*z2; t = p1 + z4*p3; t = t + E*ln2h; } else { roundtestmask=0x7f0; p1 = c5 + z*c6; z2 = z*z; p2 = c3 + z*c4; p3 = c1+z*c2; t = p2 + z2*p1; t = p3 + z2*t; t = logirh + z*t; t = t + E*ln2h; } #if 0 if(E>12 || E<-12) roundtestmask=0x7fe; else roundtestmask=0x7f0; p1 = c5 + z*c6; z2 = z*z; p2 = c3 + z*c4; p3 = c1+z*c2; t = p2 + z2*p1; t = p3 + z2*t; t = logirh + z*t; #endif #else /* Itanium here*/ /* Extract exponent and mantissa */ E += (i>>52)-1023; //printf("\nE = %llx\n", E); i = i & 0x000fffffffffffffULL; /* keep only mantissa */ ye = _Asm_setf(2/*_FR_D*/, i | 0x3ff0000000000000ULL ); /* exponent = 0*/ index = i >> (52-L); //printf("\nindex= %lld\n", index); //printf("\n ye = %1.20Le\n",(long double)ye); /* now ye holds 1+f, and E is the exponent */ logirh = argredtable[index].h; _Asm_frcpa(&r, 1.0L, ye, 1/*_SF1*/); z = r*ye - 1. ; /* even without an FMA, all exact */ if(E>12 || E<-12) { /* faster and less accurate polynomial evaluation */ roundtestmask=0x7fe; p1 = logirh + z*c1; p2 = c2 + z*c3; p3 = c4 + z*c5; z2 = z*z; p1 = p1 + z2*p2; p3 = p3 + z2*c6; z4=z2*z2; t = p1 + z4*p3; t = t + E*ln2h; } else { roundtestmask=0x7f0; p1 = c5 + z*c6; z2 = z*z; p2 = c3 + z*c4; p3 = c1+z*c2; t = p2 + z2*p1; t = p3 + z2*t; t = logirh + z*t; t = t + E*ln2h; } #endif //printf(" x=%1.20Le\n r=%1.20Le\n z=%1.20Le\n logirh=%1.20Le\n ",(long double)xe, (long double)r,(long double)z, (long double)logirh); /* Polynomial evaluation, unrolled to go through Gappa */ //printf("t=%1.20e \n ", (double)t); } #if 0 /* to time the first step only */ BACK_TO_DOUBLE_MODE; return (double)t; #endif /* To test the second step only, comment out the following line */ DE_TEST_AND_RETURN_RN(t, roundtestmask); /* Accurate phase */ #if EVAL_PERF crlibm_second_step_taken++; #endif t = c13h; t = c12h + z*t; t = c11h + z*t; t = c10h + z*t; t = c9h + z*t; t = c8h + z*t; //printf("\n t = %1.20Le\n", (long double)t); Mul12_ext(&th, &tl, z, t); Add22_ext(&th, &tl, c7h,c7l, th,tl); FMA22_ext(&th, &tl, z,0, th,tl, c6h,c6l); FMA22_ext(&th, &tl, z,0, th,tl, c5h,c5l); FMA22_ext(&th, &tl, z,0, th,tl, c4h,c4l); FMA22_ext(&th, &tl, z,0, th,tl, c3h,c3l); FMA22_ext(&th, &tl, z,0, th,tl, c2h,c2l); FMA22_ext(&th, &tl, z,0, th,tl, c1h,c1l); if((X_NEAR_1)) { Mul22_ext(&th, &tl, z,0, th,tl); } else{ FMA22_ext(&th, &tl, z,0, th,tl, logirh, argredtable[index].l); /* the following is not a FMA22 (Eln2 > th+tl) */ Mul22_ext(&eh, &el, ln2h,ln2l, E, 0); Add22_ext(&th, &tl, eh,el, th,tl); } BACK_TO_DOUBLE_MODE; return (double) (th+tl); /* The exact sum of these double-extended is rounded to the nearest */ } double log_ru(double x) { return x;}; double log_rd(double x) { return x;}; double log_rz(double x) { return x;}; interval-2.1.0/src/crlibm/log-de2.h0000644000000000000000000031024313031036767015136 0ustar 00000000000000/*File generated by maple/log-de2.mpl*/ #define L 8 static const long double ln2h = 6.93147180559945309428690474184975300886435434222221e-01L ; static const long double ln2l = -1.14583527267987328109462081210062935494878745868567e-20L ; static const long double two64 = 1.84467440737095516160000000000000000000000000000000e+19L ; #define MINYFAST 0x3FEFEEB0 #define MAXYFAST 0x3FF008A7 static const long double c[6] = { /* c[6] = */ -1.66667783633217541361935289112583546966561698354781e-01L, /* c[5] = */ 2.00000957392221395404448627819427031226950930431485e-01L, /* c[4] = */ -2.49999999997036924197484769605281940130225848406553e-01L, /* c[3] = */ 3.33333333331729287913984538516132261065649800002575e-01L, /* c[2] = */ -5.00000000000000002114194236346733646314532961696386e-01L, /* c[1] = */ 1.00000000000000000043368086899420177360298112034798e+00L, }; static const long double c13h = 7.69241938979196395573712137505584252039625425823033e-02L ; static const long double c12h = -8.33343705120907994983925001775126872871624073013663e-02L ; static const long double c11h = 9.09090909016883407279554195346005229794172919355333e-02L ; static const long double c10h = -9.99999999942075855948863533084747245993639808148146e-02L ; static const long double c9h = 1.11111111111111135639679427244974618815831490792334e-01L ; static const long double c8h = -1.25000000000000015531196120854851017156761372461915e-01L ; static const long double c7h = 1.42857142857142857140921067549133027796415262855589e-01L ; static const long double c7l = 1.89394491613490450765953343598431722998093167933610e-21L ; static const long double c6h = -1.66666666666666666671184175718689601808364386670291e-01L ; static const long double c6l = 4.53774335692433045416162310802604791782942772621503e-21L ; static const long double c5h = 2.00000000000000000002710505431213761085018632002175e-01L ; static const long double c5l = -2.71050539632600296252449828915022593909471492362218e-21L ; static const long double c4h = -2.50000000000000000000000000000000000000000000000000e-01L ; static const long double c4l = -1.13003886444388561404802588393278356484666475997380e-29L ; static const long double c3h = 3.33333333333333333342368351437379203616728773340583e-01L ; static const long double c3l = -9.03501810404588128773682629880975813170990626700199e-21L ; static const long double c2h = -5.00000000000000000000000000000000000000000000000000e-01L ; static const long double c2l = 1.80314378774106365306416798960563441651801284052754e-36L ; static const long double c1h = 1.00000000000000000000000000000000000000000000000000e+00L ; static const long double c1l = 5.78412878802419461281633493409583711449139811025168e-43L ; #if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) typedef struct dde_tag {long double h; float r; long double l; } dde ; static const dde argredtable[256] = { { 1.95503483580335055758484246596351496805255010258406e-03L, /* logirh[0] */ .9980468750, /* frcpa[0] */ 4.26497759032971696118474291411612806946615310742445e-23L, /* logirl[0] */ } , { 5.87660848898504192008808086344906485010142205283046e-03L, /* logirh[1] */ .9941406250, /* frcpa[1] */ 1.37156200381399302871157777585220592575158205768131e-22L, /* logirl[1] */ } , { 9.81362144832462125256124620478748177276884234743193e-03L, /* logirh[2] */ .9902343750, /* frcpa[2] */ 3.07726865638716648710074387700961122683722826913929e-22L, /* logirl[2] */ } , { 1.37661957641479592703297901191972218981618425459601e-02L, /* logirh[3] */ .9863281250, /* frcpa[3] */ -1.98297134784905635140870220079309409760230880892056e-22L, /* logirl[3] */ } , { 1.72375605196069193814697052130613386111690488178283e-02L, /* logirh[4] */ .9829101563, /* frcpa[4] */ -4.94287486388840565529812024596830454645571429961607e-22L, /* logirl[4] */ } , { 2.12196464187288431375985262028471822759456699714065e-02L, /* logirh[5] */ .9790039063, /* frcpa[5] */ 5.16389261557696151000206838577628415000632847634295e-22L, /* logirl[5] */ } , { 2.52176527435831877698167767867798438885529321851209e-02L, /* logirh[6] */ .9750976563, /* frcpa[6] */ -5.88370153281068503292270445713080556561303301841144e-22L, /* logirl[6] */ } , { 2.87290684408603241616140654829392175884095195215195e-02L, /* logirh[7] */ .9716796875, /* frcpa[7] */ -1.73475995898378250110858253089819431684975627555638e-22L, /* logirl[7] */ } , { 3.27572712694651043228305248994347564917006820905954e-02L, /* logirh[8] */ .9677734375, /* frcpa[8] */ 1.04044091162415222941106067538146188822878967483250e-21L, /* logirl[8] */ } , { 3.62953088241761602138690193802839090153611323330551e-02L, /* logirh[9] */ .9643554688, /* frcpa[9] */ 1.22010872587213859039144846596851206648600477022497e-21L, /* logirl[9] */ } , { 4.03541677703393333770148961037182999689321150071919e-02L, /* logirh[10] */ .9604492188, /* frcpa[10] */ 5.47371799872278404585523355882269167105391307255747e-22L, /* logirl[10] */ } , { 4.39192339348354905258654118371808294796210248023272e-02L, /* logirh[11] */ .9570312500, /* frcpa[11] */ 5.26739715684616324587620976855106674710664957099042e-22L, /* logirl[11] */ } , { 4.74970552827194697662028469858919166313171444926411e-02L, /* logirh[12] */ .9536132813, /* frcpa[12] */ -1.65705277653801718279418515265615566433700654766169e-21L, /* logirl[12] */ } , { 5.16017301068517361398093213492588304802666243631393e-02L, /* logirh[13] */ .9497070313, /* frcpa[13] */ 3.64447832323127705842810790836917844429050748104855e-22L, /* logirl[13] */ } , { 5.52071937086868625198861782604753400960362341720611e-02L, /* logirh[14] */ .9462890625, /* frcpa[14] */ -1.37225036221543681414424623055166322809445309674122e-21L, /* logirl[14] */ } , { 5.88257037308839618356705574581111406473610259126872e-02L, /* logirh[15] */ .9428710938, /* frcpa[15] */ -4.39800093887498980427107404671736592431574853874786e-22L, /* logirl[15] */ } , { 6.24573549337466043343298095075200038195362139958888e-02L, /* logirh[16] */ .9394531250, /* frcpa[16] */ -8.23828980696659845387403889844465565154590358193941e-22L, /* logirl[16] */ } , { 6.61022431137539080757761777995540342089952901005745e-02L, /* logirh[17] */ .9360351563, /* frcpa[17] */ -1.41308504022299608057769025420706808988134001026863e-21L, /* logirl[17] */ } , { 6.97604651187228467229951671402243817965427297167480e-02L, /* logirh[18] */ .9326171875, /* frcpa[18] */ -1.38323798701348717556121553783765299441359867812815e-21L, /* logirl[18] */ } , { 7.34321188632489125927647194425063048583979252725840e-02L, /* logirh[19] */ .9291992188, /* frcpa[19] */ 1.34465019131517496452701890834591900102723464814978e-21L, /* logirl[19] */ } , { 7.71173033444312897724342258098939595356569043360651e-02L, /* logirh[20] */ .9257812500, /* frcpa[20] */ -2.76803254841804175261988025377387385490660077224303e-21L, /* logirl[20] */ } , { 8.08161186578888513811196742109288493338681291788816e-02L, /* logirh[21] */ .9223632813, /* frcpa[21] */ 2.93744399967660616702546631311566500630612645057592e-21L, /* logirl[21] */ } , { 8.39974575022459922670056350901823805088497465476394e-02L, /* logirh[22] */ .9194335938, /* frcpa[22] */ -2.75822298865697918651295806251552828734188048975836e-21L, /* logirl[22] */ } , { 8.77218565932284199769932223067492316204152302816510e-02L, /* logirh[23] */ .9160156250, /* frcpa[23] */ 2.67113100993740085512946635363884214822116089153997e-21L, /* logirl[23] */ } , { 9.14601787038355687741450830707812258424382889643312e-02L, /* logirh[24] */ .9125976563, /* frcpa[24] */ -3.00526806639363070117892291419618462383136721841578e-21L, /* logirl[24] */ } , { 9.52125283223860239512309315557114786088277469389141e-02L, /* logirh[25] */ .9091796875, /* frcpa[25] */ 1.35736425184120563462579496535517324394637087277742e-21L, /* logirl[25] */ } , { 9.84400728132525199034455649915731356713877175934613e-02L, /* logirh[26] */ .9062500000, /* frcpa[26] */ -5.56990062601900788417321793968341239499135058919372e-22L, /* logirl[26] */ } , { 1.02218754772273556643104926860976533475877658929676e-01L, /* logirh[27] */ .9028320313, /* frcpa[27] */ 7.63382487271644236333136443364119627751055377943666e-22L, /* logirl[27] */ } , { 1.05469028489575121463619165884662010057581937871873e-01L, /* logirh[28] */ .8999023438, /* frcpa[28] */ 1.85116563464987726627623524285080128419577821992918e-22L, /* logirl[28] */ } , { 1.09274414978962630318388461747591833272963413037360e-01L, /* logirh[29] */ .8964843750, /* frcpa[29] */ 1.43030273529362987587188893575634710205316211093836e-21L, /* logirl[29] */ } , { 1.12547740323931779421560029491589105532511894125491e-01L, /* logirh[30] */ .8935546875, /* frcpa[30] */ 3.36751151584848473373955852226758180853512318689242e-21L, /* logirl[30] */ } , { 1.15831815525121705097444380072602143627591431140900e-01L, /* logirh[31] */ .8906250000, /* frcpa[31] */ 1.67567986607802294055723185761339369360049976900432e-21L, /* logirl[31] */ } , { 1.19676917763227218609019351230893235538133012596518e-01L, /* logirh[32] */ .8872070313, /* frcpa[32] */ 8.35611517441972676431434101463549037120144125394240e-22L, /* logirl[32] */ } , { 1.22984528275985021608521837593874792560200148727745e-01L, /* logirh[33] */ .8842773438, /* frcpa[33] */ -1.14267076111199552134812668592042704746068833133061e-21L, /* logirl[33] */ } , { 1.26303115392417108974409088728574346305322251282632e-01L, /* logirh[34] */ .8813476563, /* frcpa[34] */ -3.66994969052681147535088868653684417772797430455504e-21L, /* logirl[34] */ } , { 1.29632752208865300127572928179375821855501271784306e-01L, /* logirh[35] */ .8784179688, /* frcpa[35] */ 4.83334965613124572307769994176898229963307387098066e-21L, /* logirl[35] */ } , { 1.33531392624522623151618952452857058688096003606915e-01L, /* logirh[36] */ .8750000000, /* frcpa[36] */ -5.27533152150708409857288888663059788853678472480168e-21L, /* logirl[36] */ } , { 1.36885224722954047341127482850797747460092068649828e-01L, /* logirh[37] */ .8720703125, /* frcpa[37] */ 1.21563007094068716150945210722808645658904368873783e-21L, /* logirl[37] */ } , { 1.40250342873267571831169021889795800461797625757754e-01L, /* logirh[38] */ .8691406250, /* frcpa[38] */ 5.34519733775645328726217720982122225003034400597528e-21L, /* logirl[38] */ } , { 1.43626823289873603765680852573094483659588149748743e-01L, /* logirh[39] */ .8662109375, /* frcpa[39] */ 3.59170919594244028724220274969813502658750088315098e-21L, /* logirl[39] */ } , { 1.47014742961809659029448135725282043040351709350944e-01L, /* logirh[40] */ .8632812500, /* frcpa[40] */ 5.38677650168536117007388836493849853882234650385544e-21L, /* logirl[40] */ } , { 1.50414179663273585806342741433283549667976330965757e-01L, /* logirh[41] */ .8603515625, /* frcpa[41] */ 1.72564246416369909726215866729178930082312495242932e-21L, /* logirl[41] */ } , { 1.53825211964336434759034050179238306554907467216253e-01L, /* logirh[42] */ .8574218750, /* frcpa[42] */ 2.84291320159710576836478937518921166594573591422384e-21L, /* logirl[42] */ } , { 1.56676653873546552566981687748537410698190797120333e-01L, /* logirh[43] */ .8549804688, /* frcpa[43] */ 4.43471536483748191570747062604139622410792329989357e-21L, /* logirl[43] */ } , { 1.60109151522870865795122700958597050657772342674434e-01L, /* logirh[44] */ .8520507813, /* frcpa[44] */ -5.81022064348215050161714415533519321872077063187762e-21L, /* logirl[44] */ } , { 1.63553471805115372406905401014842738049992476589978e-01L, /* logirh[45] */ .8491210938, /* frcpa[45] */ -6.39840577852136201560723745193600583196069336234932e-21L, /* logirl[45] */ } , { 1.67009696443792323653637632574486815428826957941055e-01L, /* logirh[46] */ .8461914063, /* frcpa[46] */ 6.92191186869741625944379810478235880715811002219858e-22L, /* logirl[46] */ } , { 1.70477908012719802107013018777070811893281643278897e-01L, /* logirh[47] */ .8432617188, /* frcpa[47] */ -3.84849710573311162685375196487995319911393770927909e-21L, /* logirl[47] */ } , { 1.73377301171722293809149099963473616980991209857166e-01L, /* logirh[48] */ .8408203125, /* frcpa[48] */ -4.18923878482095888690809066241864157021606624827420e-21L, /* logirl[48] */ } , { 1.76867706111490813238994873612952574148948770016432e-01L, /* logirh[49] */ .8378906250, /* frcpa[49] */ 5.41796305766292925593321827919447911014134106410241e-21L, /* logirl[49] */ } , { 1.79785712267204925789132984037532736465436755679548e-01L, /* logirh[50] */ .8354492188, /* frcpa[50] */ 1.09794592080028280721225372439216971505383750155787e-21L, /* logirl[50] */ } , { 1.83298596441781238991779352798250357636788976378739e-01L, /* logirh[51] */ .8325195313, /* frcpa[51] */ 5.90674750801774139656717989843661717212913795636144e-21L, /* logirl[51] */ } , { 1.86823864487466379972558164213047859902872005477548e-01L, /* logirh[52] */ .8295898438, /* frcpa[52] */ -3.04217531149578964457668800577591481904667556936207e-22L, /* logirl[52] */ } , { 1.89771110947398700938607528365675847226157202385366e-01L, /* logirh[53] */ .8271484375, /* frcpa[53] */ 4.47378684265150424850655238125197190495389833236133e-21L, /* logirl[53] */ } , { 1.92727069351598330189216656815887063203263096511364e-01L, /* logirh[54] */ .8247070313, /* frcpa[54] */ 4.25445368378849844793522570228782328665573787173242e-21L, /* logirl[54] */ } , { 1.96285791968592396490329160529952901015349198132753e-01L, /* logirh[55] */ .8217773438, /* frcpa[55] */ -2.74449417331789688975664262836082841822814364159104e-21L, /* logirl[55] */ } , { 1.99261099132246916960020319264934585135051747784019e-01L, /* logirh[56] */ .8193359375, /* frcpa[56] */ 6.47208691720606613197768957447376978812352107535377e-21L, /* logirl[56] */ } , { 2.02843192514751471269385078854963211369977216236293e-01L, /* logirh[57] */ .8164062500, /* frcpa[57] */ -2.49911704253350382497946421034579061512074844155459e-21L, /* logirl[57] */ } , { 2.05838103408604401595963402649136497757353936322033e-01L, /* logirh[58] */ .8139648438, /* frcpa[58] */ 3.44547120579970794151735860178311194999554929496034e-21L, /* logirl[58] */ } , { 2.08842010744004902909995609328053234321487252600491e-01L, /* logirh[59] */ .8115234375, /* frcpa[59] */ -2.31718119342409737696864118031023889824430589122232e-21L, /* logirl[59] */ } , { 2.11854968732835491690620101368214278636514791287482e-01L, /* logirh[60] */ .8090820313, /* frcpa[60] */ -5.59178221480029447097470536961685192149874416053190e-21L, /* logirl[60] */ } , { 2.15482542239270394491710766682324162957229418680072e-01L, /* logirh[61] */ .8061523438, /* frcpa[61] */ -3.08567992399291380594398304266569953574118919907360e-21L, /* logirl[61] */ } , { 2.18515604922383282264996239019350099397343001328409e-01L, /* logirh[62] */ .8037109375, /* frcpa[62] */ -2.54798988296256277081585163171791801881177620828164e-21L, /* logirl[62] */ } , { 2.21557895069307506555442328910476845749144558794796e-01L, /* logirh[63] */ .8012695313, /* frcpa[63] */ 6.13314860927894564393358817562097659422742835665000e-21L, /* logirl[63] */ } , { 2.24609468996706039046508396328505341443815268576145e-01L, /* logirh[64] */ .7988281250, /* frcpa[64] */ -4.94151233330231607699074826625823143609255820481925e-21L, /* logirl[64] */ } , { 2.27670383538384533180648494621323152387049049139023e-01L, /* logirh[65] */ .7963867188, /* frcpa[65] */ 1.32722330655188821742036628678343997944613329580108e-21L, /* logirl[65] */ } , { 2.30740696051642502680673052495308184006717056035995e-01L, /* logirh[66] */ .7939453125, /* frcpa[66] */ -4.67148041930246804736964870794777368798100308802424e-22L, /* logirl[66] */ } , { 2.33820464423722301015970588544679031883788411505520e-01L, /* logirh[67] */ .7915039063, /* frcpa[67] */ 4.09731183066161080755265939560882683473100997189963e-21L, /* logirl[67] */ } , { 2.36909747078357715033302723084407404030571342445910e-01L, /* logirh[68] */ .7890625000, /* frcpa[68] */ 3.12386020983941560709206311202257016876406966228076e-21L, /* logirl[68] */ } , { 2.40008602982424024623693201152541121246031252667308e-01L, /* logirh[69] */ .7866210938, /* frcpa[69] */ -2.43476897905245731343786602663372491079788337856472e-21L, /* logirl[69] */ } , { 2.43117091652691421022275744534546504382888088002801e-01L, /* logirh[70] */ .7841796875, /* frcpa[70] */ -4.00696535645269435436299549546802892061102236811804e-21L, /* logirl[70] */ } , { 2.46235273162683717456332942175034617093842825852334e-01L, /* logirh[71] */ .7817382813, /* frcpa[71] */ 4.07437573318827322756457884828210179798439304619411e-21L, /* logirl[71] */ } , { 2.49363208149644328249063332525459202315687434747815e-01L, /* logirh[72] */ .7792968750, /* frcpa[72] */ -3.59965165542906115819932802133318661805640003973833e-21L, /* logirl[72] */ } , { 2.52500957821611535746280513548001067647419404238462e-01L, /* logirh[73] */ .7768554688, /* frcpa[73] */ 2.33463811464698172389714383182373125448753269899859e-21L, /* logirl[73] */ } , { 2.55648583964605109373428165620012464387400541454554e-01L, /* logirh[74] */ .7744140625, /* frcpa[74] */ -5.98349602918013475350833615157201591368028964103828e-21L, /* logirl[74] */ } , { 2.58173837831799220471438310875456068060884717851877e-01L, /* logirh[75] */ .7724609375, /* frcpa[75] */ 1.33986666471082110277621581004881530763601545750211e-20L, /* logirl[75] */ } , { 2.61339399196360020101188165186911760429211426526308e-01L, /* logirh[76] */ .7700195313, /* frcpa[76] */ 3.86551567380649813446710441868758040977608915780583e-21L, /* logirl[76] */ } , { 2.64515013170246549202438771097867231674172217026353e-01L, /* logirh[77] */ .7675781250, /* frcpa[77] */ 7.98107393367028325011146300178634322183923091601985e-21L, /* logirl[77] */ } , { 2.67700743803377575602683510758161844478308921679854e-01L, /* logirh[78] */ .7651367188, /* frcpa[78] */ -1.91017444378219323517258229660185956541609986586656e-21L, /* logirl[78] */ } , { 2.70256655737921794101881120542252290306350914761424e-01L, /* logirh[79] */ .7631835938, /* frcpa[79] */ 3.53127205732779035544673231633056564481395911692583e-21L, /* logirl[79] */ } , { 2.73460759728704830284762294922984438017010688781738e-01L, /* logirh[80] */ .7607421875, /* frcpa[80] */ 1.17681147335201171244391876920889368097526851011919e-20L, /* logirl[80] */ } , { 2.76675163010711334108434472645043911143147852271795e-01L, /* logirh[81] */ .7583007813, /* frcpa[81] */ 1.06699065144355902967885100961053554661859396947057e-20L, /* logirl[81] */ } , { 2.79254145742529772484998712434034473517385777086020e-01L, /* logirh[82] */ .7563476563, /* frcpa[82] */ 9.18144271840156782536821462802027993141168527210699e-22L, /* logirl[82] */ } , { 2.82487255574676923491547753108932283794274553656578e-01L, /* logirh[83] */ .7539062500, /* frcpa[83] */ -8.62183482657850338055949164218482107835463533173941e-21L, /* logirl[83] */ } , { 2.85081290751723560975309720855186412791226757690310e-01L, /* logirh[84] */ .7519531250, /* frcpa[84] */ 1.17237176339060309039114596865979651990000730425096e-20L, /* logirl[84] */ } , { 2.88333326138100875385417154461720201652497053146362e-01L, /* logirh[85] */ .7495117188, /* frcpa[85] */ 4.91428106954212380686140911029428249306740479245873e-21L, /* logirl[85] */ } , { 2.90942590501714649404855009273695998217590386047959e-01L, /* logirh[86] */ .7475585938, /* frcpa[86] */ -1.75340148127812535361388147355237410486083146456705e-21L, /* logirl[86] */ } , { 2.94213774314996088685928571360150840519054327160120e-01L, /* logirh[87] */ .7451171875, /* frcpa[87] */ 3.72344756923345953865473190171804616041154553422343e-21L, /* logirl[87] */ } , { 2.96838447737767257807650275736044420682446798309684e-01L, /* logirh[88] */ .7431640625, /* frcpa[88] */ 9.29219098895164091290778342787327520629305647347598e-21L, /* logirl[88] */ } , { 3.00129006810866155350540213087029428606911096721888e-01L, /* logirh[89] */ .7407226563, /* frcpa[89] */ 4.15407888405806794704699164445087088652277542419333e-21L, /* logirl[89] */ } , { 3.02769272371042485027595181357185083470540121197701e-01L, /* logirh[90] */ .7387695313, /* frcpa[90] */ -5.39200386021858963294532737382056488102330563120789e-21L, /* logirl[90] */ } , { 3.05416527391549505774737474639302092782600084319711e-01L, /* logirh[91] */ .7368164063, /* frcpa[91] */ 8.09508842504419574684087285543596001167284855903610e-22L, /* logirl[91] */ } , { 3.08735481649613269672805665466697178089816588908434e-01L, /* logirh[92] */ .7343750000, /* frcpa[92] */ 9.63639351018852146719394839260714210168238671991609e-21L, /* logirl[92] */ } , { 3.11398599069096969566353139136083427729317918419838e-01L, /* logirh[93] */ .7324218750, /* frcpa[93] */ -8.78728261358293827391132654678683452408757879284726e-21L, /* logirl[93] */ } , { 3.14068827624975851033669455025787442536966409534216e-01L, /* logirh[94] */ .7304687500, /* frcpa[94] */ -7.29067919863073334281631602128749543633905749487187e-21L, /* logirl[94] */ } , { 3.16746205395692243423234196741944401765067595988512e-01L, /* logirh[95] */ .7285156250, /* frcpa[95] */ -3.87970872001942700455671881391065519856896238099562e-21L, /* logirl[95] */ } , { 3.20103039699243330251134109776245395551086403429508e-01L, /* logirh[96] */ .7260742188, /* frcpa[96] */ 9.74190129969570988905249611640634240349398962781767e-21L, /* logirl[96] */ } , { 3.22796644021466308337566311625899118098459439352155e-01L, /* logirh[97] */ .7241210938, /* frcpa[97] */ -1.24774498383778898467895756041215733560057419893395e-21L, /* logirl[97] */ } , { 3.25497523448598604771950584813033913178514922037721e-01L, /* logirh[98] */ .7221679688, /* frcpa[98] */ -1.04491359306555100779220975161808188230678757588356e-20L, /* logirl[98] */ } , { 3.28205717385478203779961697827971534024982247501612e-01L, /* logirh[99] */ .7202148438, /* frcpa[99] */ -7.97740196010218830935182187448759796325974533751889e-21L, /* logirl[99] */ } , { 3.30921265557960885537493178620849221260868944227695e-01L, /* logirh[100] */ .7182617188, /* frcpa[100] */ 8.64134723319418452779496730832996023729416105456812e-21L, /* logirl[100] */ } , { 3.33644208016416686724469817248994729652622481808066e-01L, /* logirh[101] */ .7163085938, /* frcpa[101] */ 9.66067882514623325134829038169224793167381199665462e-21L, /* logirl[101] */ } , { 3.37058345849674590458339498710849113649601349607110e-01L, /* logirh[102] */ .7138671875, /* frcpa[102] */ -8.39541534805700404182434293467016145944324738626105e-21L, /* logirl[102] */ } , { 3.39798073590794945798669590697471676321583800017834e-01L, /* logirh[103] */ .7119140625, /* frcpa[103] */ 2.18020234913977654841648305008968992796498205692680e-21L, /* logirl[103] */ } , { 3.42545328065933728256022006153358461233437992632389e-01L, /* logirh[104] */ .7099609375, /* frcpa[104] */ 3.84623958513933049310518070448063856087605206176412e-21L, /* logirl[104] */ } , { 3.45300150744778317797719843773585068902320927008986e-01L, /* logirh[105] */ .7080078125, /* frcpa[105] */ -1.01893280061062726927558707137105116763914501631221e-20L, /* logirl[105] */ } , { 3.48062583440688407302680135169126174332632217556238e-01L, /* logirh[106] */ .7060546875, /* frcpa[106] */ 7.98452377929806675746594993919271831161811571911368e-21L, /* logirl[106] */ } , { 3.50832668314504018285994446646469668849022127687931e-01L, /* logirh[107] */ .7041015625, /* frcpa[107] */ 1.23717094386754616403804233472575851672026180336760e-20L, /* logirl[107] */ } , { 3.53610447878406405658891636933915947338391561061144e-01L, /* logirh[108] */ .7021484375, /* frcpa[108] */ -1.30564842388437679910379256931334342564847448923293e-20L, /* logirl[108] */ } , { 3.56395964999832735826479704344116328229574719443917e-01L, /* logirh[109] */ .7001953125, /* frcpa[109] */ -1.25673209467854485601417465225681194056028338689638e-20L, /* logirl[109] */ } , { 3.58490206602947495263637722739957780504482798278332e-01L, /* logirh[110] */ .6987304688, /* frcpa[110] */ -4.28923649665041597642981589160186406861873075678703e-21L, /* logirl[110] */ } , { 3.61289368682561986699693090674401219075662083923817e-01L, /* logirh[111] */ .6967773438, /* frcpa[111] */ -1.25473402274048087652641573695951161425274151232398e-20L, /* logirl[111] */ } , { 3.64096388069546034432343722953007159048866014927626e-01L, /* logirh[112] */ .6948242188, /* frcpa[112] */ 1.30462756592416210783264533797496700709053049115538e-20L, /* logirl[112] */ } , { 3.66911308999355744667886236598519644758198410272598e-01L, /* logirh[113] */ .6928710938, /* frcpa[113] */ -8.36422879207943595633235500504614573436448299389604e-21L, /* logirl[113] */ } , { 3.69734176082060404339114587091152941411564825102687e-01L, /* logirh[114] */ .6909179688, /* frcpa[114] */ 3.69226892746146309305101640958791161030722272698924e-21L, /* logirl[114] */ } , { 3.72565034306584399851920014201667186171107459813356e-01L, /* logirh[115] */ .6889648438, /* frcpa[115] */ 1.26264806737780740417234126186201469813800457294886e-20L, /* logirl[115] */ } , { 3.75403929045009347406115784995250805877731181681156e-01L, /* logirh[116] */ .6870117188, /* frcpa[116] */ 1.27675743152632581009120170158413354291147159818701e-20L, /* logirl[116] */ } , { 3.77538401573641974523281791831230691514065256342292e-01L, /* logirh[117] */ .6855468750, /* frcpa[117] */ -7.41585104053729758201550005081247397028781146530367e-21L, /* logirl[117] */ } , { 3.80391470556048421025564440500765783781389473006129e-01L, /* logirh[118] */ .6835937500, /* frcpa[118] */ 5.42112126909175213422320698106968710022398212765792e-21L, /* logirl[118] */ } , { 3.83252702837080621558942666871061533129250165075064e-01L, /* logirh[119] */ .6816406250, /* frcpa[119] */ -3.33509624611212959857880713113019351814294081047672e-21L, /* logirl[119] */ } , { 3.85404012379592703080441115637277960104256635531783e-01L, /* logirh[120] */ .6801757813, /* frcpa[120] */ -6.36181490905264280193017955525373436929450412995273e-21L, /* logirl[120] */ } , { 3.88279643405054638124378543762027504726574989035726e-01L, /* logirh[121] */ .6782226563, /* frcpa[121] */ -9.91762590332090210822469068841385419105462380573398e-21L, /* logirl[121] */ } , { 3.91163567537959529132191027755993673054035753011703e-01L, /* logirh[122] */ .6762695313, /* frcpa[122] */ -1.27945744668499029121935899537977013057416450166329e-20L, /* logirl[122] */ } , { 3.93331981831783197563028042775812309628236107528210e-01L, /* logirh[123] */ .6748046875, /* frcpa[123] */ 1.53510198299819511369584982102574259233257823450716e-21L, /* logirl[123] */ } , { 3.96230534585794523961144869561579184846777934581041e-01L, /* logirh[124] */ .6728515625, /* frcpa[124] */ 1.32197644258101207427735080522965675494126617191596e-20L, /* logirl[124] */ } , { 3.99137513377103754345399944103434108910732902586460e-01L, /* logirh[125] */ .6708984375, /* frcpa[125] */ -9.55957037680245004179134758135305425464802853191611e-21L, /* logirl[125] */ } , { 4.01323306597084012993211302178231392190355109050870e-01L, /* logirh[126] */ .6694335938, /* frcpa[126] */ 7.96541578570161757432662120891552932782435964821583e-21L, /* logirl[126] */ } , { 4.04245149435448843149238165595171778932126471772790e-01L, /* logirh[127] */ .6674804688, /* frcpa[127] */ -8.26101129620667799302841738321318860761977552259631e-21L, /* logirl[127] */ } , { 4.06442147755990994755599318710714840108266798779368e-01L, /* logirh[128] */ .6660156250, /* frcpa[128] */ 8.38187190538776229960551692264161687270696777776234e-21L, /* logirl[128] */ } , { 4.09379007429300711056819120359229202676942804828286e-01L, /* logirh[129] */ .6640625000, /* frcpa[129] */ 1.35117787486925987380490932795647340967696130081584e-20L, /* logirl[129] */ } , { 4.11587326324529262171723897889563659191480837762356e-01L, /* logirh[130] */ .6625976563, /* frcpa[130] */ -4.97376737951515286685487524395801072129992449215865e-21L, /* logirl[130] */ } , { 4.14539357988610364272145936137548005717690102756023e-01L, /* logirh[131] */ .6606445313, /* frcpa[131] */ -6.54478802266834973263149421547105883296889501687837e-21L, /* logirl[131] */ } , { 4.16759114726923270773280283396644563254085369408131e-01L, /* logirh[132] */ .6591796875, /* frcpa[132] */ 1.17865539651687245072798438812191035874234305068345e-20L, /* logirl[132] */ } , { 4.19726475954725289596548495896222163992206333205104e-01L, /* logirh[133] */ .6572265625, /* frcpa[133] */ -3.13844567079468870611431966996843559602701061715652e-21L, /* logirl[133] */ } , { 4.21957789636160829170727012971120473139308160170913e-01L, /* logirh[134] */ .6557617188, /* frcpa[134] */ -3.65383628571568207059626458690769872734430618127779e-21L, /* logirl[134] */ } , { 4.24940640468225896758322490676107463514199480414391e-01L, /* logirh[135] */ .6538085938, /* frcpa[135] */ 9.14108874507535988282140615418885533302915780668105e-21L, /* logirl[135] */ } , { 4.27183632062807368089249124287754000306449597701430e-01L, /* logirh[136] */ .6523437500, /* frcpa[136] */ -1.11429293671208215000857181981747836059777488816797e-20L, /* logirl[136] */ } , { 4.30182135059063957605897388081217513899900950491428e-01L, /* logirh[137] */ .6503906250, /* frcpa[137] */ -9.39443983412697441559456056174850307219777519084123e-21L, /* logirl[137] */ } , { 4.32436927446153074100412133651261115119268652051687e-01L, /* logirh[138] */ .6489257813, /* frcpa[138] */ 7.88870762087972589406884437345717904736714146607698e-21L, /* logirl[138] */ } , { 4.34696815413590586472123225569852422722760820761323e-01L, /* logirh[139] */ .6474609375, /* frcpa[139] */ 1.93069265094241299131429199321466769625398122100851e-21L, /* logirl[139] */ } , { 4.37717965747766808330210600019860578413499752059579e-01L, /* logirh[140] */ .6455078125, /* frcpa[140] */ 1.42102608319782592423454192434347516972070983180682e-21L, /* logirl[140] */ } , { 4.39989833442083805027352297334353181668120669201016e-01L, /* logirh[141] */ .6440429688, /* frcpa[141] */ -1.20015769356213632548957467075032647879504224252139e-20L, /* logirl[141] */ } , { 4.42266874274135892824424617919554236777912592515349e-01L, /* logirh[142] */ .6425781250, /* frcpa[142] */ 4.36106198868143736862105950597654421314560199511441e-21L, /* logirl[142] */ } , { 4.45311016655364052629993004694952674071828369051218e-01L, /* logirh[143] */ .6406250000, /* frcpa[143] */ 6.63635101669914600475501747811974742734358988145874e-21L, /* logirl[143] */ } , { 4.47600220249498474185288407478644501225062413141131e-01L, /* logirh[144] */ .6391601563, /* frcpa[144] */ -1.25660107201378174413892049079180933248758422196735e-20L, /* logirl[144] */ } , { 4.49894676323022032766573569118051523219037335366011e-01L, /* logirh[145] */ .6376953125, /* frcpa[145] */ -7.20342573451092426836769665486326672600023249811669e-21L, /* logirl[145] */ } , { 4.52194409034553285788591084348730930742021882906556e-01L, /* logirh[146] */ .6362304688, /* frcpa[146] */ -8.47945847451460005436054189483125659211770365332896e-22L, /* logirl[146] */ } , { 4.55268969488798865469280155449105507159401895478368e-01L, /* logirh[147] */ .6342773438, /* frcpa[147] */ 4.74336969576706749657589421782240547135428193892528e-21L, /* logirl[147] */ } , { 4.57581109247178400342009885193306217843201011419296e-01L, /* logirh[148] */ .6328125000, /* frcpa[148] */ -2.36598267617305990464319034283697709014593179635402e-21L, /* logirl[148] */ } , { 4.59898607387540924438563971765603355379425920546055e-01L, /* logirh[149] */ .6313476563, /* frcpa[149] */ 8.07732102676293501119166223720103331713077340297627e-21L, /* logirl[149] */ } , { 4.62221488803680604691035901931961404898174805566669e-01L, /* logirh[150] */ .6298828125, /* frcpa[150] */ 1.24382291552438961245330542958060837987441875091342e-20L, /* logirl[150] */ } , { 4.64549778563271740681669963457522953831357881426811e-01L, /* logirh[151] */ .6284179688, /* frcpa[151] */ 1.96187920691998107717362190747064826757297578125547e-21L, /* logirl[151] */ } , { 4.67662621543761975796173191444182748455205000936985e-01L, /* logirh[152] */ .6264648438, /* frcpa[152] */ -1.00610749233134715635949292420774215513040092431792e-20L, /* logirl[152] */ } , { 4.70003629245735553651317981116442012989864451810718e-01L, /* logirh[153] */ .6250000000, /* frcpa[153] */ -3.80949968099948288960261756455515265913481939735419e-22L, /* logirl[153] */ } , { 4.72350130126859112485648503620971894179092487320304e-01L, /* logirh[154] */ .6235351563, /* frcpa[154] */ -9.08504177179036249027023970290925346168448739123201e-21L, /* logirl[154] */ } , { 4.74702150027289747900079847076071359879279043525457e-01L, /* logirh[155] */ .6220703125, /* frcpa[155] */ 8.04843905401625679617395219952408959338025651283616e-21L, /* logirl[155] */ } , { 4.77059714969944353784529061934804872180393431335688e-01L, /* logirh[156] */ .6206054688, /* frcpa[156] */ 9.09657652537257782393100881420207290475813569550887e-21L, /* logirl[156] */ } , { 4.79422851162227170543914459011070050564740085974336e-01L, /* logirh[157] */ .6191406250, /* frcpa[157] */ 1.14124648139077527373251153641337763160500443812559e-20L, /* logirl[157] */ } , { 4.81791584997777794116503510823967815213109133765101e-01L, /* logirh[158] */ .6176757813, /* frcpa[158] */ 3.59408221446137582759107104970989253261291421513114e-21L, /* logirl[158] */ } , { 4.84165943058239936892892668618415541459398809820414e-01L, /* logirh[159] */ .6162109375, /* frcpa[159] */ 6.90512297756055515870014314442836697397537526874820e-22L, /* logirl[159] */ } , { 4.86545952115051237119123378471741148132423404604197e-01L, /* logirh[160] */ .6147460938, /* frcpa[160] */ 2.87746285587177870212465072536291591811028257755262e-22L, /* logirl[160] */ } , { 4.88931639131254417921087704335114665354922180995345e-01L, /* logirh[161] */ .6132812500, /* frcpa[161] */ -7.67596907317736949350366764620323159731219880272990e-21L, /* logirl[161] */ } , { 4.91323031263330102318652448101232721455744467675686e-01L, /* logirh[162] */ .6118164063, /* frcpa[162] */ -1.22562855258723778652540992985069722405656970405882e-20L, /* logirl[162] */ } , { 4.93720155863051595774996030407955061036773258820176e-01L, /* logirh[163] */ .6103515625, /* frcpa[163] */ -5.71214873093993838422678630171600796188276737719886e-21L, /* logirl[163] */ } , { 4.96123040479361952922402606569463046071177814155817e-01L, /* logirh[164] */ .6088867188, /* frcpa[164] */ 1.10361837627205617056885101288824066464403161388594e-20L, /* logirl[164] */ } , { 4.98531712860273650553873808766169872797036077827215e-01L, /* logirh[165] */ .6074218750, /* frcpa[165] */ 5.21971892473696376244792745349121825258505877961581e-21L, /* logirl[165] */ } , { 5.00946200954791194255404096491446352956700138747692e-01L, /* logirh[166] */ .6059570313, /* frcpa[166] */ -7.49423576317321061879825078913185791137826712727096e-21L, /* logirl[166] */ } , { 5.03366532914856991962667537299225273272895719856024e-01L, /* logirh[167] */ .6044921875, /* frcpa[167] */ -1.83817128671833223948820461377340219380509767768120e-20L, /* logirl[167] */ } , { 5.05792737097320832930034267826968630288320127874613e-01L, /* logirh[168] */ .6030273438, /* frcpa[168] */ -3.75513846638616302607380496933108989002504885108483e-21L, /* logirl[168] */ } , { 5.08224842065933316752682213923719700687797740101814e-01L, /* logirh[169] */ .6015625000, /* frcpa[169] */ 6.46314875207246381902554448007689112535666009895769e-22L, /* logirl[169] */ } , { 5.10662876593363582503580511140484077259316109120846e-01L, /* logirh[170] */ .6000976563, /* frcpa[170] */ 1.31546915527971199814755811920912966696871823382403e-20L, /* logirl[170] */ } , { 5.13106869663241694742069481938173680646286811679602e-01L, /* logirh[171] */ .5986328125, /* frcpa[171] */ -9.48086093245893657857465915239236058691645484958719e-21L, /* logirl[171] */ } , { 5.14739523087127012290851318931927949051896575838327e-01L, /* logirh[172] */ .5976562500, /* frcpa[172] */ 6.98056101530665066905394368582212942263609105784010e-21L, /* logirl[172] */ } , { 5.17193512048693723737180505395372165367007255554199e-01L, /* logirh[173] */ .5961914063, /* frcpa[173] */ 2.70883447254679150939645524105991443744276583896589e-20L, /* logirl[173] */ } , { 5.19653537889556070463858289398828560479159932583570e-01L, /* logirh[174] */ .5947265625, /* frcpa[174] */ 2.45929124553200804969371752267839129056713502249468e-20L, /* logirl[174] */ } , { 5.22119630384749572034417536281480920479225460439920e-01L, /* logirh[175] */ .5932617188, /* frcpa[175] */ -2.18497180803548344111669417650081141798741623577199e-20L, /* logirl[175] */ } , { 5.24591819530138642462425285772908978287887293845415e-01L, /* logirh[176] */ .5917968750, /* frcpa[176] */ 1.32203035151652728530582847665410458727777398365519e-20L, /* logirl[176] */ } , { 5.27070135544605730194053089254779820294061210006475e-01L, /* logirh[177] */ .5903320313, /* frcpa[177] */ 1.76032437549609086335524539448277975821798914097017e-20L, /* logirl[177] */ } , { 5.28725765061866902010632995878580686621717177331448e-01L, /* logirh[178] */ .5893554688, /* frcpa[178] */ -6.88102247990701389925516342020564246262797072332030e-23L, /* logirl[178] */ } , { 5.31214360290632056150247203296643760950246360152960e-01L, /* logirh[179] */ .5878906250, /* frcpa[179] */ 2.66466330379185865323002458390306405768155182617574e-20L, /* logirl[179] */ } , { 5.33709164079414862609691827532998331662383861839771e-01L, /* logirh[180] */ .5864257813, /* frcpa[180] */ -1.29762017107818188869410259485124080678804176241434e-20L, /* logirl[180] */ } , { 5.36210207484003745345615271622463637868349906057119e-01L, /* logirh[181] */ .5849609375, /* frcpa[181] */ 1.65067700778453559631881994813258268290230772692962e-20L, /* logirl[181] */ } , { 5.37881051648821357916759738904133314463251736015081e-01L, /* logirh[182] */ .5839843750, /* frcpa[182] */ -2.19109191560589250321272095571138928163548790076226e-20L, /* logirl[182] */ } , { 5.40392564061482290446898624214355777439777739346027e-01L, /* logirh[183] */ .5825195313, /* frcpa[183] */ 2.08228396513876900118497171678012888475888240965144e-20L, /* logirl[183] */ } , { 5.42910400053823334208438072812086261365038808435202e-01L, /* logirh[184] */ .5810546875, /* frcpa[184] */ 8.23644722718551463874152042367020651575236794759280e-21L, /* logirl[184] */ } , { 5.44592486236808166527503111131736091010679956525564e-01L, /* logirh[185] */ .5800781250, /* frcpa[185] */ -2.00933067408533920949057044370384679454492154640310e-20L, /* logirl[185] */ } , { 5.47120932590166843430528470504370375238067936152220e-01L, /* logirh[186] */ .5786132813, /* frcpa[186] */ -9.92524609455239275442518737817999625480140253588253e-21L, /* logirl[186] */ } , { 5.49655788193354895971275142496637045042007230222225e-01L, /* logirh[187] */ .5771484375, /* frcpa[187] */ 2.60035059997719560566631655963598297729287367007908e-20L, /* logirl[187] */ } , { 5.51349268699687959530229136584367211071366909891367e-01L, /* logirh[188] */ .5761718750, /* frcpa[188] */ 8.05024959333663801951435912985560282262081044464591e-21L, /* logirl[188] */ } , { 5.53894878899121686241600187594613657893205527216196e-01L, /* logirh[189] */ .5747070313, /* frcpa[189] */ -1.83892465430777104472961145252041624877581186770337e-20L, /* logirl[189] */ } , { 5.56446985771356645851352940024270310459542088210583e-01L, /* logirh[190] */ .5732421875, /* frcpa[190] */ 2.06677769878226925286245270139777726439942087527370e-20L, /* logirl[190] */ } , { 5.58152016022440478841114969155157155000779312103987e-01L, /* logirh[191] */ .5722656250, /* frcpa[191] */ -2.58661388440662325511611588814692565587161510028965e-20L, /* logirl[191] */ } , { 5.60715024687329991240868076740611058994545601308346e-01L, /* logirh[192] */ .5708007813, /* frcpa[192] */ -1.64182608886279055979239231155414518020340732707175e-20L, /* logirl[192] */ } , { 5.63284619248960715992471243174222195193578954786062e-01L, /* logirh[193] */ .5693359375, /* frcpa[193] */ -2.65627455866435846195683323864140395189128131938038e-20L, /* logirl[193] */ } , { 5.65001357868015271265077492657269431219901889562607e-01L, /* logirh[194] */ .5683593750, /* frcpa[194] */ -2.19552581601677369964960433395712510373598893667200e-20L, /* logirl[194] */ } , { 5.67582004461506905925068100504660151273128576576710e-01L, /* logirh[195] */ .5668945313, /* frcpa[195] */ 5.90701142185794805590524668669544397085089572669788e-21L, /* logirl[195] */ } , { 5.69306142819646694805835879238387065015558619052172e-01L, /* logirh[196] */ .5659179688, /* frcpa[196] */ 2.33009214880869002611805100582067855813554770257529e-20L, /* logirl[196] */ } , { 5.71897936927075624239692752670549680260592140257359e-01L, /* logirh[197] */ .5644531250, /* frcpa[197] */ 1.63271047067863612422000647375332886660577686602113e-20L, /* logirl[197] */ } , { 5.73629539091353532682168031575642430652806069701910e-01L, /* logirh[198] */ .5634765625, /* frcpa[198] */ 1.35778757354348431006030977215550960808915473679493e-20L, /* logirl[198] */ } , { 5.76232577437515759667327475135323311405954882502556e-01L, /* logirh[199] */ .5620117188, /* frcpa[199] */ 1.28136064828063593458439031297239582536217112855437e-20L, /* logirl[199] */ } , { 5.78842409279886675808717011459947343610110692679882e-01L, /* logirh[200] */ .5605468750, /* frcpa[200] */ -2.57440348169455489440041914302593932468377260933429e-20L, /* logirl[200] */ } , { 5.80586088884713529922713959319224841237883083522320e-01L, /* logirh[201] */ .5595703125, /* frcpa[201] */ 4.41206613764798826108043412776466913688688358898484e-21L, /* logirl[201] */ } , { 5.83207322364587747753113949888970068968774285167456e-01L, /* logirh[202] */ .5581054688, /* frcpa[202] */ -1.49189541037162430714759871409805107504755972902992e-21L, /* logirl[202] */ } , { 5.84958636297322764419429064197686329862335696816444e-01L, /* logirh[203] */ .5571289063, /* frcpa[203] */ -1.60837721673687300800846563753717539999210255011878e-22L, /* logirl[203] */ } , { 5.86713022712216263673118410437723468930926173925400e-01L, /* logirh[204] */ .5561523438, /* frcpa[204] */ -3.17168863463050625558020547002535137465925788804006e-21L, /* logirl[204] */ } , { 5.89350386878301744605131856635793496934638824313879e-01L, /* logirh[205] */ .5546875000, /* frcpa[205] */ -1.39615389415916171660994818848901714495919357934706e-20L, /* logirl[205] */ } , { 5.91112501871701023466523783334025665681110695004463e-01L, /* logirh[206] */ .5537109375, /* frcpa[206] */ 1.94637401144574668475212537692289150763221599806672e-20L, /* logirl[206] */ } , { 5.93761510043277948936186333428466355144337285310030e-01L, /* logirh[207] */ .5522460938, /* frcpa[207] */ 2.13622917617199787393781580337151830714978899979519e-20L, /* logirl[207] */ } , { 5.95531422009736386346742675890197915578028187155724e-01L, /* logirh[208] */ .5512695313, /* frcpa[208] */ -5.57259316426018508787411112338297856432265995386872e-21L, /* logirl[208] */ } , { 5.98192177459762712175232041156291984407289419323206e-01L, /* logirh[209] */ .5498046875, /* frcpa[209] */ -3.74781519226728618443505703931062184338388651621827e-21L, /* logirl[209] */ } , { 5.99969955705762019674415208569939750304911285638809e-01L, /* logirh[210] */ .5488281250, /* frcpa[210] */ -2.59644401395225784451061116582518643426188955954025e-20L, /* logirl[210] */ } , { 6.02642563087238492989475974193069873763306532055140e-01L, /* logirh[211] */ .5473632813, /* frcpa[211] */ -2.50004437606787862337772976338569519653395217249839e-20L, /* logirl[211] */ } , { 6.04428277847473170865909286586514781447476707398891e-01L, /* logirh[212] */ .5463867188, /* frcpa[212] */ -7.33579257076237518313264419331850361801721257990158e-21L, /* logirl[212] */ } , { 6.06217187090197695033266800379578853608109056949615e-01L, /* logirh[213] */ .5454101563, /* frcpa[213] */ -2.17953080850264628478128768590230893044079856673130e-20L, /* logirl[213] */ } , { 6.08906565672169072236594167257806020643329247832298e-01L, /* logirh[214] */ .5439453125, /* frcpa[214] */ 2.43001104791778958605091541205840292926934335038990e-20L, /* logirl[214] */ } , { 6.10703511348870718168906773781756669450260233134031e-01L, /* logirh[215] */ .5429687500, /* frcpa[215] */ -1.98347209918879072887544491214489475082169187478903e-20L, /* logirl[215] */ } , { 6.12503691853018583787435225040951536357169970870018e-01L, /* logirh[216] */ .5419921875, /* frcpa[216] */ 2.07857483606536363253783256589667608143722579784530e-20L, /* logirl[216] */ } , { 6.15210053450761525529327800043688512232620269060135e-01L, /* logirh[217] */ .5405273438, /* frcpa[217] */ 7.72645219126903427887142350700660117976602336795165e-21L, /* logirl[217] */ } , { 6.17018372207545212680766116841724056030216161161661e-01L, /* logirh[218] */ .5395507813, /* frcpa[218] */ 5.00582653358541288118250323060147668157890772059789e-21L, /* logirl[218] */ } , { 6.18829966905895933007054898755683325362042523920536e-01L, /* logirh[219] */ .5385742188, /* frcpa[219] */ 2.60431023001686460777788589129926677065962205227216e-20L, /* logirl[219] */ } , { 6.21553527372936491502113803830908977943181525915861e-01L, /* logirh[220] */ .5371093750, /* frcpa[220] */ -1.04869551248244441365933565828570015553511122659463e-20L, /* logirl[220] */ } , { 6.23373364089922462607726294514520759548759087920189e-01L, /* logirh[221] */ .5361328125, /* frcpa[221] */ 2.27153427965787655960253811756921226020182163308283e-20L, /* logirl[221] */ } , { 6.25196518651437560000743570709502705540216993540525e-01L, /* logirh[222] */ .5351562500, /* frcpa[222] */ 2.19232729760444485003184142946155941222776472408409e-20L, /* logirl[222] */ } , { 6.27937497982859842897505192604867829686554614454508e-01L, /* logirh[223] */ .5336914063, /* frcpa[223] */ 2.59352328668902836446166306553362343068377561588123e-20L, /* logirl[223] */ } , { 6.29769000326327585089804250717548939064727164804935e-01L, /* logirh[224] */ .5327148438, /* frcpa[224] */ -1.21467317879907709324733285927127135284313624485272e-20L, /* logirl[224] */ } , { 6.31603863226437932658786228445890742477786261588335e-01L, /* logirh[225] */ .5317382813, /* frcpa[225] */ 1.63894778187414974146534085353091795011762181164691e-20L, /* logirl[225] */ } , { 6.33442099038188960458128917707654181867837905883789e-01L, /* logirh[226] */ .5307617188, /* frcpa[226] */ -1.06695930136737880114178623385061897940403293765931e-20L, /* logirl[226] */ } , { 6.36205804159806884666688436835713105210743378847837e-01L, /* logirh[227] */ .5292968750, /* frcpa[227] */ -8.46941691798603143710724761239322249883772469675312e-21L, /* logirl[227] */ } , { 6.38052526752971572575768438584375985556107480078936e-01L, /* logirh[228] */ .5283203125, /* frcpa[228] */ 2.63671634127395583915856588351301065321489867148089e-20L, /* logirl[228] */ } , { 6.39902666041133026577757830777315462000842671841383e-01L, /* logirh[229] */ .5273437500, /* frcpa[229] */ -2.63959031056676708649612991271987108904655365467646e-20L, /* logirl[229] */ } , { 6.41756234690455939877196112064439148525707423686981e-01L, /* logirh[230] */ .5263671875, /* frcpa[230] */ 2.24760376658377731327353838657827087113829234283449e-20L, /* logirl[230] */ } , { 6.44543045597635230899678793203833038205630145967007e-01L, /* logirh[231] */ .5249023438, /* frcpa[231] */ 1.55133630378868960145849365255088752071892290926646e-20L, /* logirl[231] */ } , { 6.46405243528699932045906983990590788380359299480915e-01L, /* logirh[232] */ .5239257813, /* frcpa[232] */ -7.72135134400730894438722249896938881605660497758570e-21L, /* logirl[232] */ } , { 6.48270915711649635469575325696922618590178899466991e-01L, /* logirh[233] */ .5229492188, /* frcpa[233] */ -2.53998248183380442804399491918209409440256852527255e-20L, /* logirl[233] */ } , { 6.50140075134353178113941207350023887556744739413261e-01L, /* logirh[234] */ .5219726563, /* frcpa[234] */ 1.59816070187659374889917583730577235865801271336652e-20L, /* logirl[234] */ } , { 6.52012734857645037396360609971424082687008194625378e-01L, /* logirh[235] */ .5209960938, /* frcpa[235] */ 1.45275263994271525130630696327763964092655442137801e-20L, /* logirl[235] */ } , { 6.53888908015872916243329399099692977870290633291006e-01L, /* logirh[236] */ .5200195313, /* frcpa[236] */ 2.07648342785018300271983937594878297626085508933405e-20L, /* logirl[236] */ } , { 6.56709784357514260791366389469203568296507000923157e-01L, /* logirh[237] */ .5185546875, /* frcpa[237] */ -2.55860224521869209004017944548994743296377030914363e-20L, /* logirl[237] */ } , { 6.58594799053285575988515854195526344483369030058384e-01L, /* logirh[238] */ .5175781250, /* frcpa[238] */ 2.13447666728173583107487129669228031073599282234625e-20L, /* logirl[238] */ } , { 6.60483373741153712585625484843276922219956759363413e-01L, /* logirh[239] */ .5166015625, /* frcpa[239] */ -2.68099338819034783490518710777734114173674267685964e-20L, /* logirl[239] */ } , { 6.62375521893191621070843405627570632532297167927027e-01L, /* logirh[240] */ .5156250000, /* frcpa[240] */ -2.46394917661662285487000617992290646560405896530757e-20L, /* logirl[240] */ } , { 6.64271257058090767988727670667614688682078849524260e-01L, /* logirh[241] */ .5146484375, /* frcpa[241] */ 4.89460149866724603480291964434582303569949285072746e-21L, /* logirl[241] */ } , { 6.66170592861743233678312875456484221103892195969820e-01L, /* logirh[242] */ .5136718750, /* frcpa[242] */ -9.15004653796719880999098719384862468581948479370138e-21L, /* logirl[242] */ } , { 6.68073543007829348495344584657473774313984904438257e-01L, /* logirh[243] */ .5126953125, /* frcpa[243] */ -2.51400168937888068945390384200867041048687993212480e-20L, /* logirl[243] */ } , { 6.69980121278410931161349101126134542028012219816446e-01L, /* logirh[244] */ .5117187500, /* frcpa[244] */ 2.70838593697521094682948422665684057236843679459511e-20L, /* logirl[244] */ } , { 6.72846821760487024907150532815336418934748508036137e-01L, /* logirh[245] */ .5102539063, /* frcpa[245] */ 1.06724601454353533112223106661914589204580784001879e-20L, /* logirl[245] */ } , { 6.74762531158625957514261145542278086395526770502329e-01L, /* logirh[246] */ .5092773438, /* frcpa[246] */ -2.24888280496360550575110667851996097244442076628643e-20L, /* logirl[246] */ } , { 6.76681917544429519819054047458095624278939794749022e-01L, /* logirh[247] */ .5083007813, /* frcpa[247] */ 2.15772052734613853105883485574187537438001210159785e-20L, /* logirl[247] */ } , { 6.78604995060171010815616016165208179700130131095648e-01L, /* logirh[248] */ .5073242188, /* frcpa[248] */ -1.30586072834413655346920811356096828938860230682704e-20L, /* logirl[248] */ } , { 6.80531777929871074610777836877417712457827292382717e-01L, /* logirh[249] */ .5063476563, /* frcpa[249] */ -2.21482221362167455319358217853577334183296289025644e-20L, /* logirl[249] */ } , { 6.82462280459928955400790429042245932578225620090961e-01L, /* logirh[250] */ .5053710938, /* frcpa[250] */ -9.23973188373885101035764728029706054781623831427493e-21L, /* logirl[250] */ } , { 6.84396517039759856994123043971711695121484808623791e-01L, /* logirh[251] */ .5043945313, /* frcpa[251] */ -1.15340975708897387680916809613678008557527533421693e-20L, /* logirl[251] */ } , { 6.86334502142438478275096591652015831641620025038719e-01L, /* logirh[252] */ .5034179688, /* frcpa[252] */ 1.00516389437240083809638080859061807916651987536657e-20L, /* logirl[252] */ } , { 6.88276250325348796870426892891003944896510802209377e-01L, /* logirh[253] */ .5024414063, /* frcpa[253] */ 7.82297589687341037552438599781693585434569670880706e-21L, /* logirl[253] */ } , { 6.90221776230840173389172870210828136805503163486719e-01L, /* logirh[254] */ .5014648438, /* frcpa[254] */ -2.60525172176154149544033330497727120965480632602542e-20L, /* logirl[254] */ } , { 6.92171094586889850503938492742861399165121838450432e-01L, /* logirh[255] */ .5004882813, /* frcpa[255] */ 1.73328038072979822371837713611880675698641265660364e-20L, /* logirl[255] */ } }; #else /* not(defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)), assuming Itanium, otherwise we shouldn't be there */ typedef struct dde_tag {long double h; long double l; } dde ; static const dde argredtable[256] = { { 1.95503483580335055758484246596351496805255010258406e-03L, /* logirh[0] */ 4.26497759032971696118474291411612806946615310742445e-23L, /* logirl[0] */ } , { 5.87660848898504192008808086344906485010142205283046e-03L, /* logirh[1] */ 1.37156200381399302871157777585220592575158205768131e-22L, /* logirl[1] */ } , { 9.81362144832462125256124620478748177276884234743193e-03L, /* logirh[2] */ 3.07726865638716648710074387700961122683722826913929e-22L, /* logirl[2] */ } , { 1.37661957641479592703297901191972218981618425459601e-02L, /* logirh[3] */ -1.98297134784905635140870220079309409760230880892056e-22L, /* logirl[3] */ } , { 1.72375605196069193814697052130613386111690488178283e-02L, /* logirh[4] */ -4.94287486388840565529812024596830454645571429961607e-22L, /* logirl[4] */ } , { 2.12196464187288431375985262028471822759456699714065e-02L, /* logirh[5] */ 5.16389261557696151000206838577628415000632847634295e-22L, /* logirl[5] */ } , { 2.52176527435831877698167767867798438885529321851209e-02L, /* logirh[6] */ -5.88370153281068503292270445713080556561303301841144e-22L, /* logirl[6] */ } , { 2.87290684408603241616140654829392175884095195215195e-02L, /* logirh[7] */ -1.73475995898378250110858253089819431684975627555638e-22L, /* logirl[7] */ } , { 3.27572712694651043228305248994347564917006820905954e-02L, /* logirh[8] */ 1.04044091162415222941106067538146188822878967483250e-21L, /* logirl[8] */ } , { 3.62953088241761602138690193802839090153611323330551e-02L, /* logirh[9] */ 1.22010872587213859039144846596851206648600477022497e-21L, /* logirl[9] */ } , { 4.03541677703393333770148961037182999689321150071919e-02L, /* logirh[10] */ 5.47371799872278404585523355882269167105391307255747e-22L, /* logirl[10] */ } , { 4.39192339348354905258654118371808294796210248023272e-02L, /* logirh[11] */ 5.26739715684616324587620976855106674710664957099042e-22L, /* logirl[11] */ } , { 4.74970552827194697662028469858919166313171444926411e-02L, /* logirh[12] */ -1.65705277653801718279418515265615566433700654766169e-21L, /* logirl[12] */ } , { 5.16017301068517361398093213492588304802666243631393e-02L, /* logirh[13] */ 3.64447832323127705842810790836917844429050748104855e-22L, /* logirl[13] */ } , { 5.52071937086868625198861782604753400960362341720611e-02L, /* logirh[14] */ -1.37225036221543681414424623055166322809445309674122e-21L, /* logirl[14] */ } , { 5.88257037308839618356705574581111406473610259126872e-02L, /* logirh[15] */ -4.39800093887498980427107404671736592431574853874786e-22L, /* logirl[15] */ } , { 6.24573549337466043343298095075200038195362139958888e-02L, /* logirh[16] */ -8.23828980696659845387403889844465565154590358193941e-22L, /* logirl[16] */ } , { 6.61022431137539080757761777995540342089952901005745e-02L, /* logirh[17] */ -1.41308504022299608057769025420706808988134001026863e-21L, /* logirl[17] */ } , { 6.97604651187228467229951671402243817965427297167480e-02L, /* logirh[18] */ -1.38323798701348717556121553783765299441359867812815e-21L, /* logirl[18] */ } , { 7.34321188632489125927647194425063048583979252725840e-02L, /* logirh[19] */ 1.34465019131517496452701890834591900102723464814978e-21L, /* logirl[19] */ } , { 7.71173033444312897724342258098939595356569043360651e-02L, /* logirh[20] */ -2.76803254841804175261988025377387385490660077224303e-21L, /* logirl[20] */ } , { 8.08161186578888513811196742109288493338681291788816e-02L, /* logirh[21] */ 2.93744399967660616702546631311566500630612645057592e-21L, /* logirl[21] */ } , { 8.39974575022459922670056350901823805088497465476394e-02L, /* logirh[22] */ -2.75822298865697918651295806251552828734188048975836e-21L, /* logirl[22] */ } , { 8.77218565932284199769932223067492316204152302816510e-02L, /* logirh[23] */ 2.67113100993740085512946635363884214822116089153997e-21L, /* logirl[23] */ } , { 9.14601787038355687741450830707812258424382889643312e-02L, /* logirh[24] */ -3.00526806639363070117892291419618462383136721841578e-21L, /* logirl[24] */ } , { 9.52125283223860239512309315557114786088277469389141e-02L, /* logirh[25] */ 1.35736425184120563462579496535517324394637087277742e-21L, /* logirl[25] */ } , { 9.84400728132525199034455649915731356713877175934613e-02L, /* logirh[26] */ -5.56990062601900788417321793968341239499135058919372e-22L, /* logirl[26] */ } , { 1.02218754772273556643104926860976533475877658929676e-01L, /* logirh[27] */ 7.63382487271644236333136443364119627751055377943666e-22L, /* logirl[27] */ } , { 1.05469028489575121463619165884662010057581937871873e-01L, /* logirh[28] */ 1.85116563464987726627623524285080128419577821992918e-22L, /* logirl[28] */ } , { 1.09274414978962630318388461747591833272963413037360e-01L, /* logirh[29] */ 1.43030273529362987587188893575634710205316211093836e-21L, /* logirl[29] */ } , { 1.12547740323931779421560029491589105532511894125491e-01L, /* logirh[30] */ 3.36751151584848473373955852226758180853512318689242e-21L, /* logirl[30] */ } , { 1.15831815525121705097444380072602143627591431140900e-01L, /* logirh[31] */ 1.67567986607802294055723185761339369360049976900432e-21L, /* logirl[31] */ } , { 1.19676917763227218609019351230893235538133012596518e-01L, /* logirh[32] */ 8.35611517441972676431434101463549037120144125394240e-22L, /* logirl[32] */ } , { 1.22984528275985021608521837593874792560200148727745e-01L, /* logirh[33] */ -1.14267076111199552134812668592042704746068833133061e-21L, /* logirl[33] */ } , { 1.26303115392417108974409088728574346305322251282632e-01L, /* logirh[34] */ -3.66994969052681147535088868653684417772797430455504e-21L, /* logirl[34] */ } , { 1.29632752208865300127572928179375821855501271784306e-01L, /* logirh[35] */ 4.83334965613124572307769994176898229963307387098066e-21L, /* logirl[35] */ } , { 1.33531392624522623151618952452857058688096003606915e-01L, /* logirh[36] */ -5.27533152150708409857288888663059788853678472480168e-21L, /* logirl[36] */ } , { 1.36885224722954047341127482850797747460092068649828e-01L, /* logirh[37] */ 1.21563007094068716150945210722808645658904368873783e-21L, /* logirl[37] */ } , { 1.40250342873267571831169021889795800461797625757754e-01L, /* logirh[38] */ 5.34519733775645328726217720982122225003034400597528e-21L, /* logirl[38] */ } , { 1.43626823289873603765680852573094483659588149748743e-01L, /* logirh[39] */ 3.59170919594244028724220274969813502658750088315098e-21L, /* logirl[39] */ } , { 1.47014742961809659029448135725282043040351709350944e-01L, /* logirh[40] */ 5.38677650168536117007388836493849853882234650385544e-21L, /* logirl[40] */ } , { 1.50414179663273585806342741433283549667976330965757e-01L, /* logirh[41] */ 1.72564246416369909726215866729178930082312495242932e-21L, /* logirl[41] */ } , { 1.53825211964336434759034050179238306554907467216253e-01L, /* logirh[42] */ 2.84291320159710576836478937518921166594573591422384e-21L, /* logirl[42] */ } , { 1.56676653873546552566981687748537410698190797120333e-01L, /* logirh[43] */ 4.43471536483748191570747062604139622410792329989357e-21L, /* logirl[43] */ } , { 1.60109151522870865795122700958597050657772342674434e-01L, /* logirh[44] */ -5.81022064348215050161714415533519321872077063187762e-21L, /* logirl[44] */ } , { 1.63553471805115372406905401014842738049992476589978e-01L, /* logirh[45] */ -6.39840577852136201560723745193600583196069336234932e-21L, /* logirl[45] */ } , { 1.67009696443792323653637632574486815428826957941055e-01L, /* logirh[46] */ 6.92191186869741625944379810478235880715811002219858e-22L, /* logirl[46] */ } , { 1.70477908012719802107013018777070811893281643278897e-01L, /* logirh[47] */ -3.84849710573311162685375196487995319911393770927909e-21L, /* logirl[47] */ } , { 1.73377301171722293809149099963473616980991209857166e-01L, /* logirh[48] */ -4.18923878482095888690809066241864157021606624827420e-21L, /* logirl[48] */ } , { 1.76867706111490813238994873612952574148948770016432e-01L, /* logirh[49] */ 5.41796305766292925593321827919447911014134106410241e-21L, /* logirl[49] */ } , { 1.79785712267204925789132984037532736465436755679548e-01L, /* logirh[50] */ 1.09794592080028280721225372439216971505383750155787e-21L, /* logirl[50] */ } , { 1.83298596441781238991779352798250357636788976378739e-01L, /* logirh[51] */ 5.90674750801774139656717989843661717212913795636144e-21L, /* logirl[51] */ } , { 1.86823864487466379972558164213047859902872005477548e-01L, /* logirh[52] */ -3.04217531149578964457668800577591481904667556936207e-22L, /* logirl[52] */ } , { 1.89771110947398700938607528365675847226157202385366e-01L, /* logirh[53] */ 4.47378684265150424850655238125197190495389833236133e-21L, /* logirl[53] */ } , { 1.92727069351598330189216656815887063203263096511364e-01L, /* logirh[54] */ 4.25445368378849844793522570228782328665573787173242e-21L, /* logirl[54] */ } , { 1.96285791968592396490329160529952901015349198132753e-01L, /* logirh[55] */ -2.74449417331789688975664262836082841822814364159104e-21L, /* logirl[55] */ } , { 1.99261099132246916960020319264934585135051747784019e-01L, /* logirh[56] */ 6.47208691720606613197768957447376978812352107535377e-21L, /* logirl[56] */ } , { 2.02843192514751471269385078854963211369977216236293e-01L, /* logirh[57] */ -2.49911704253350382497946421034579061512074844155459e-21L, /* logirl[57] */ } , { 2.05838103408604401595963402649136497757353936322033e-01L, /* logirh[58] */ 3.44547120579970794151735860178311194999554929496034e-21L, /* logirl[58] */ } , { 2.08842010744004902909995609328053234321487252600491e-01L, /* logirh[59] */ -2.31718119342409737696864118031023889824430589122232e-21L, /* logirl[59] */ } , { 2.11854968732835491690620101368214278636514791287482e-01L, /* logirh[60] */ -5.59178221480029447097470536961685192149874416053190e-21L, /* logirl[60] */ } , { 2.15482542239270394491710766682324162957229418680072e-01L, /* logirh[61] */ -3.08567992399291380594398304266569953574118919907360e-21L, /* logirl[61] */ } , { 2.18515604922383282264996239019350099397343001328409e-01L, /* logirh[62] */ -2.54798988296256277081585163171791801881177620828164e-21L, /* logirl[62] */ } , { 2.21557895069307506555442328910476845749144558794796e-01L, /* logirh[63] */ 6.13314860927894564393358817562097659422742835665000e-21L, /* logirl[63] */ } , { 2.24609468996706039046508396328505341443815268576145e-01L, /* logirh[64] */ -4.94151233330231607699074826625823143609255820481925e-21L, /* logirl[64] */ } , { 2.27670383538384533180648494621323152387049049139023e-01L, /* logirh[65] */ 1.32722330655188821742036628678343997944613329580108e-21L, /* logirl[65] */ } , { 2.30740696051642502680673052495308184006717056035995e-01L, /* logirh[66] */ -4.67148041930246804736964870794777368798100308802424e-22L, /* logirl[66] */ } , { 2.33820464423722301015970588544679031883788411505520e-01L, /* logirh[67] */ 4.09731183066161080755265939560882683473100997189963e-21L, /* logirl[67] */ } , { 2.36909747078357715033302723084407404030571342445910e-01L, /* logirh[68] */ 3.12386020983941560709206311202257016876406966228076e-21L, /* logirl[68] */ } , { 2.40008602982424024623693201152541121246031252667308e-01L, /* logirh[69] */ -2.43476897905245731343786602663372491079788337856472e-21L, /* logirl[69] */ } , { 2.43117091652691421022275744534546504382888088002801e-01L, /* logirh[70] */ -4.00696535645269435436299549546802892061102236811804e-21L, /* logirl[70] */ } , { 2.46235273162683717456332942175034617093842825852334e-01L, /* logirh[71] */ 4.07437573318827322756457884828210179798439304619411e-21L, /* logirl[71] */ } , { 2.49363208149644328249063332525459202315687434747815e-01L, /* logirh[72] */ -3.59965165542906115819932802133318661805640003973833e-21L, /* logirl[72] */ } , { 2.52500957821611535746280513548001067647419404238462e-01L, /* logirh[73] */ 2.33463811464698172389714383182373125448753269899859e-21L, /* logirl[73] */ } , { 2.55648583964605109373428165620012464387400541454554e-01L, /* logirh[74] */ -5.98349602918013475350833615157201591368028964103828e-21L, /* logirl[74] */ } , { 2.58173837831799220471438310875456068060884717851877e-01L, /* logirh[75] */ 1.33986666471082110277621581004881530763601545750211e-20L, /* logirl[75] */ } , { 2.61339399196360020101188165186911760429211426526308e-01L, /* logirh[76] */ 3.86551567380649813446710441868758040977608915780583e-21L, /* logirl[76] */ } , { 2.64515013170246549202438771097867231674172217026353e-01L, /* logirh[77] */ 7.98107393367028325011146300178634322183923091601985e-21L, /* logirl[77] */ } , { 2.67700743803377575602683510758161844478308921679854e-01L, /* logirh[78] */ -1.91017444378219323517258229660185956541609986586656e-21L, /* logirl[78] */ } , { 2.70256655737921794101881120542252290306350914761424e-01L, /* logirh[79] */ 3.53127205732779035544673231633056564481395911692583e-21L, /* logirl[79] */ } , { 2.73460759728704830284762294922984438017010688781738e-01L, /* logirh[80] */ 1.17681147335201171244391876920889368097526851011919e-20L, /* logirl[80] */ } , { 2.76675163010711334108434472645043911143147852271795e-01L, /* logirh[81] */ 1.06699065144355902967885100961053554661859396947057e-20L, /* logirl[81] */ } , { 2.79254145742529772484998712434034473517385777086020e-01L, /* logirh[82] */ 9.18144271840156782536821462802027993141168527210699e-22L, /* logirl[82] */ } , { 2.82487255574676923491547753108932283794274553656578e-01L, /* logirh[83] */ -8.62183482657850338055949164218482107835463533173941e-21L, /* logirl[83] */ } , { 2.85081290751723560975309720855186412791226757690310e-01L, /* logirh[84] */ 1.17237176339060309039114596865979651990000730425096e-20L, /* logirl[84] */ } , { 2.88333326138100875385417154461720201652497053146362e-01L, /* logirh[85] */ 4.91428106954212380686140911029428249306740479245873e-21L, /* logirl[85] */ } , { 2.90942590501714649404855009273695998217590386047959e-01L, /* logirh[86] */ -1.75340148127812535361388147355237410486083146456705e-21L, /* logirl[86] */ } , { 2.94213774314996088685928571360150840519054327160120e-01L, /* logirh[87] */ 3.72344756923345953865473190171804616041154553422343e-21L, /* logirl[87] */ } , { 2.96838447737767257807650275736044420682446798309684e-01L, /* logirh[88] */ 9.29219098895164091290778342787327520629305647347598e-21L, /* logirl[88] */ } , { 3.00129006810866155350540213087029428606911096721888e-01L, /* logirh[89] */ 4.15407888405806794704699164445087088652277542419333e-21L, /* logirl[89] */ } , { 3.02769272371042485027595181357185083470540121197701e-01L, /* logirh[90] */ -5.39200386021858963294532737382056488102330563120789e-21L, /* logirl[90] */ } , { 3.05416527391549505774737474639302092782600084319711e-01L, /* logirh[91] */ 8.09508842504419574684087285543596001167284855903610e-22L, /* logirl[91] */ } , { 3.08735481649613269672805665466697178089816588908434e-01L, /* logirh[92] */ 9.63639351018852146719394839260714210168238671991609e-21L, /* logirl[92] */ } , { 3.11398599069096969566353139136083427729317918419838e-01L, /* logirh[93] */ -8.78728261358293827391132654678683452408757879284726e-21L, /* logirl[93] */ } , { 3.14068827624975851033669455025787442536966409534216e-01L, /* logirh[94] */ -7.29067919863073334281631602128749543633905749487187e-21L, /* logirl[94] */ } , { 3.16746205395692243423234196741944401765067595988512e-01L, /* logirh[95] */ -3.87970872001942700455671881391065519856896238099562e-21L, /* logirl[95] */ } , { 3.20103039699243330251134109776245395551086403429508e-01L, /* logirh[96] */ 9.74190129969570988905249611640634240349398962781767e-21L, /* logirl[96] */ } , { 3.22796644021466308337566311625899118098459439352155e-01L, /* logirh[97] */ -1.24774498383778898467895756041215733560057419893395e-21L, /* logirl[97] */ } , { 3.25497523448598604771950584813033913178514922037721e-01L, /* logirh[98] */ -1.04491359306555100779220975161808188230678757588356e-20L, /* logirl[98] */ } , { 3.28205717385478203779961697827971534024982247501612e-01L, /* logirh[99] */ -7.97740196010218830935182187448759796325974533751889e-21L, /* logirl[99] */ } , { 3.30921265557960885537493178620849221260868944227695e-01L, /* logirh[100] */ 8.64134723319418452779496730832996023729416105456812e-21L, /* logirl[100] */ } , { 3.33644208016416686724469817248994729652622481808066e-01L, /* logirh[101] */ 9.66067882514623325134829038169224793167381199665462e-21L, /* logirl[101] */ } , { 3.37058345849674590458339498710849113649601349607110e-01L, /* logirh[102] */ -8.39541534805700404182434293467016145944324738626105e-21L, /* logirl[102] */ } , { 3.39798073590794945798669590697471676321583800017834e-01L, /* logirh[103] */ 2.18020234913977654841648305008968992796498205692680e-21L, /* logirl[103] */ } , { 3.42545328065933728256022006153358461233437992632389e-01L, /* logirh[104] */ 3.84623958513933049310518070448063856087605206176412e-21L, /* logirl[104] */ } , { 3.45300150744778317797719843773585068902320927008986e-01L, /* logirh[105] */ -1.01893280061062726927558707137105116763914501631221e-20L, /* logirl[105] */ } , { 3.48062583440688407302680135169126174332632217556238e-01L, /* logirh[106] */ 7.98452377929806675746594993919271831161811571911368e-21L, /* logirl[106] */ } , { 3.50832668314504018285994446646469668849022127687931e-01L, /* logirh[107] */ 1.23717094386754616403804233472575851672026180336760e-20L, /* logirl[107] */ } , { 3.53610447878406405658891636933915947338391561061144e-01L, /* logirh[108] */ -1.30564842388437679910379256931334342564847448923293e-20L, /* logirl[108] */ } , { 3.56395964999832735826479704344116328229574719443917e-01L, /* logirh[109] */ -1.25673209467854485601417465225681194056028338689638e-20L, /* logirl[109] */ } , { 3.58490206602947495263637722739957780504482798278332e-01L, /* logirh[110] */ -4.28923649665041597642981589160186406861873075678703e-21L, /* logirl[110] */ } , { 3.61289368682561986699693090674401219075662083923817e-01L, /* logirh[111] */ -1.25473402274048087652641573695951161425274151232398e-20L, /* logirl[111] */ } , { 3.64096388069546034432343722953007159048866014927626e-01L, /* logirh[112] */ 1.30462756592416210783264533797496700709053049115538e-20L, /* logirl[112] */ } , { 3.66911308999355744667886236598519644758198410272598e-01L, /* logirh[113] */ -8.36422879207943595633235500504614573436448299389604e-21L, /* logirl[113] */ } , { 3.69734176082060404339114587091152941411564825102687e-01L, /* logirh[114] */ 3.69226892746146309305101640958791161030722272698924e-21L, /* logirl[114] */ } , { 3.72565034306584399851920014201667186171107459813356e-01L, /* logirh[115] */ 1.26264806737780740417234126186201469813800457294886e-20L, /* logirl[115] */ } , { 3.75403929045009347406115784995250805877731181681156e-01L, /* logirh[116] */ 1.27675743152632581009120170158413354291147159818701e-20L, /* logirl[116] */ } , { 3.77538401573641974523281791831230691514065256342292e-01L, /* logirh[117] */ -7.41585104053729758201550005081247397028781146530367e-21L, /* logirl[117] */ } , { 3.80391470556048421025564440500765783781389473006129e-01L, /* logirh[118] */ 5.42112126909175213422320698106968710022398212765792e-21L, /* logirl[118] */ } , { 3.83252702837080621558942666871061533129250165075064e-01L, /* logirh[119] */ -3.33509624611212959857880713113019351814294081047672e-21L, /* logirl[119] */ } , { 3.85404012379592703080441115637277960104256635531783e-01L, /* logirh[120] */ -6.36181490905264280193017955525373436929450412995273e-21L, /* logirl[120] */ } , { 3.88279643405054638124378543762027504726574989035726e-01L, /* logirh[121] */ -9.91762590332090210822469068841385419105462380573398e-21L, /* logirl[121] */ } , { 3.91163567537959529132191027755993673054035753011703e-01L, /* logirh[122] */ -1.27945744668499029121935899537977013057416450166329e-20L, /* logirl[122] */ } , { 3.93331981831783197563028042775812309628236107528210e-01L, /* logirh[123] */ 1.53510198299819511369584982102574259233257823450716e-21L, /* logirl[123] */ } , { 3.96230534585794523961144869561579184846777934581041e-01L, /* logirh[124] */ 1.32197644258101207427735080522965675494126617191596e-20L, /* logirl[124] */ } , { 3.99137513377103754345399944103434108910732902586460e-01L, /* logirh[125] */ -9.55957037680245004179134758135305425464802853191611e-21L, /* logirl[125] */ } , { 4.01323306597084012993211302178231392190355109050870e-01L, /* logirh[126] */ 7.96541578570161757432662120891552932782435964821583e-21L, /* logirl[126] */ } , { 4.04245149435448843149238165595171778932126471772790e-01L, /* logirh[127] */ -8.26101129620667799302841738321318860761977552259631e-21L, /* logirl[127] */ } , { 4.06442147755990994755599318710714840108266798779368e-01L, /* logirh[128] */ 8.38187190538776229960551692264161687270696777776234e-21L, /* logirl[128] */ } , { 4.09379007429300711056819120359229202676942804828286e-01L, /* logirh[129] */ 1.35117787486925987380490932795647340967696130081584e-20L, /* logirl[129] */ } , { 4.11587326324529262171723897889563659191480837762356e-01L, /* logirh[130] */ -4.97376737951515286685487524395801072129992449215865e-21L, /* logirl[130] */ } , { 4.14539357988610364272145936137548005717690102756023e-01L, /* logirh[131] */ -6.54478802266834973263149421547105883296889501687837e-21L, /* logirl[131] */ } , { 4.16759114726923270773280283396644563254085369408131e-01L, /* logirh[132] */ 1.17865539651687245072798438812191035874234305068345e-20L, /* logirl[132] */ } , { 4.19726475954725289596548495896222163992206333205104e-01L, /* logirh[133] */ -3.13844567079468870611431966996843559602701061715652e-21L, /* logirl[133] */ } , { 4.21957789636160829170727012971120473139308160170913e-01L, /* logirh[134] */ -3.65383628571568207059626458690769872734430618127779e-21L, /* logirl[134] */ } , { 4.24940640468225896758322490676107463514199480414391e-01L, /* logirh[135] */ 9.14108874507535988282140615418885533302915780668105e-21L, /* logirl[135] */ } , { 4.27183632062807368089249124287754000306449597701430e-01L, /* logirh[136] */ -1.11429293671208215000857181981747836059777488816797e-20L, /* logirl[136] */ } , { 4.30182135059063957605897388081217513899900950491428e-01L, /* logirh[137] */ -9.39443983412697441559456056174850307219777519084123e-21L, /* logirl[137] */ } , { 4.32436927446153074100412133651261115119268652051687e-01L, /* logirh[138] */ 7.88870762087972589406884437345717904736714146607698e-21L, /* logirl[138] */ } , { 4.34696815413590586472123225569852422722760820761323e-01L, /* logirh[139] */ 1.93069265094241299131429199321466769625398122100851e-21L, /* logirl[139] */ } , { 4.37717965747766808330210600019860578413499752059579e-01L, /* logirh[140] */ 1.42102608319782592423454192434347516972070983180682e-21L, /* logirl[140] */ } , { 4.39989833442083805027352297334353181668120669201016e-01L, /* logirh[141] */ -1.20015769356213632548957467075032647879504224252139e-20L, /* logirl[141] */ } , { 4.42266874274135892824424617919554236777912592515349e-01L, /* logirh[142] */ 4.36106198868143736862105950597654421314560199511441e-21L, /* logirl[142] */ } , { 4.45311016655364052629993004694952674071828369051218e-01L, /* logirh[143] */ 6.63635101669914600475501747811974742734358988145874e-21L, /* logirl[143] */ } , { 4.47600220249498474185288407478644501225062413141131e-01L, /* logirh[144] */ -1.25660107201378174413892049079180933248758422196735e-20L, /* logirl[144] */ } , { 4.49894676323022032766573569118051523219037335366011e-01L, /* logirh[145] */ -7.20342573451092426836769665486326672600023249811669e-21L, /* logirl[145] */ } , { 4.52194409034553285788591084348730930742021882906556e-01L, /* logirh[146] */ -8.47945847451460005436054189483125659211770365332896e-22L, /* logirl[146] */ } , { 4.55268969488798865469280155449105507159401895478368e-01L, /* logirh[147] */ 4.74336969576706749657589421782240547135428193892528e-21L, /* logirl[147] */ } , { 4.57581109247178400342009885193306217843201011419296e-01L, /* logirh[148] */ -2.36598267617305990464319034283697709014593179635402e-21L, /* logirl[148] */ } , { 4.59898607387540924438563971765603355379425920546055e-01L, /* logirh[149] */ 8.07732102676293501119166223720103331713077340297627e-21L, /* logirl[149] */ } , { 4.62221488803680604691035901931961404898174805566669e-01L, /* logirh[150] */ 1.24382291552438961245330542958060837987441875091342e-20L, /* logirl[150] */ } , { 4.64549778563271740681669963457522953831357881426811e-01L, /* logirh[151] */ 1.96187920691998107717362190747064826757297578125547e-21L, /* logirl[151] */ } , { 4.67662621543761975796173191444182748455205000936985e-01L, /* logirh[152] */ -1.00610749233134715635949292420774215513040092431792e-20L, /* logirl[152] */ } , { 4.70003629245735553651317981116442012989864451810718e-01L, /* logirh[153] */ -3.80949968099948288960261756455515265913481939735419e-22L, /* logirl[153] */ } , { 4.72350130126859112485648503620971894179092487320304e-01L, /* logirh[154] */ -9.08504177179036249027023970290925346168448739123201e-21L, /* logirl[154] */ } , { 4.74702150027289747900079847076071359879279043525457e-01L, /* logirh[155] */ 8.04843905401625679617395219952408959338025651283616e-21L, /* logirl[155] */ } , { 4.77059714969944353784529061934804872180393431335688e-01L, /* logirh[156] */ 9.09657652537257782393100881420207290475813569550887e-21L, /* logirl[156] */ } , { 4.79422851162227170543914459011070050564740085974336e-01L, /* logirh[157] */ 1.14124648139077527373251153641337763160500443812559e-20L, /* logirl[157] */ } , { 4.81791584997777794116503510823967815213109133765101e-01L, /* logirh[158] */ 3.59408221446137582759107104970989253261291421513114e-21L, /* logirl[158] */ } , { 4.84165943058239936892892668618415541459398809820414e-01L, /* logirh[159] */ 6.90512297756055515870014314442836697397537526874820e-22L, /* logirl[159] */ } , { 4.86545952115051237119123378471741148132423404604197e-01L, /* logirh[160] */ 2.87746285587177870212465072536291591811028257755262e-22L, /* logirl[160] */ } , { 4.88931639131254417921087704335114665354922180995345e-01L, /* logirh[161] */ -7.67596907317736949350366764620323159731219880272990e-21L, /* logirl[161] */ } , { 4.91323031263330102318652448101232721455744467675686e-01L, /* logirh[162] */ -1.22562855258723778652540992985069722405656970405882e-20L, /* logirl[162] */ } , { 4.93720155863051595774996030407955061036773258820176e-01L, /* logirh[163] */ -5.71214873093993838422678630171600796188276737719886e-21L, /* logirl[163] */ } , { 4.96123040479361952922402606569463046071177814155817e-01L, /* logirh[164] */ 1.10361837627205617056885101288824066464403161388594e-20L, /* logirl[164] */ } , { 4.98531712860273650553873808766169872797036077827215e-01L, /* logirh[165] */ 5.21971892473696376244792745349121825258505877961581e-21L, /* logirl[165] */ } , { 5.00946200954791194255404096491446352956700138747692e-01L, /* logirh[166] */ -7.49423576317321061879825078913185791137826712727096e-21L, /* logirl[166] */ } , { 5.03366532914856991962667537299225273272895719856024e-01L, /* logirh[167] */ -1.83817128671833223948820461377340219380509767768120e-20L, /* logirl[167] */ } , { 5.05792737097320832930034267826968630288320127874613e-01L, /* logirh[168] */ -3.75513846638616302607380496933108989002504885108483e-21L, /* logirl[168] */ } , { 5.08224842065933316752682213923719700687797740101814e-01L, /* logirh[169] */ 6.46314875207246381902554448007689112535666009895769e-22L, /* logirl[169] */ } , { 5.10662876593363582503580511140484077259316109120846e-01L, /* logirh[170] */ 1.31546915527971199814755811920912966696871823382403e-20L, /* logirl[170] */ } , { 5.13106869663241694742069481938173680646286811679602e-01L, /* logirh[171] */ -9.48086093245893657857465915239236058691645484958719e-21L, /* logirl[171] */ } , { 5.14739523087127012290851318931927949051896575838327e-01L, /* logirh[172] */ 6.98056101530665066905394368582212942263609105784010e-21L, /* logirl[172] */ } , { 5.17193512048693723737180505395372165367007255554199e-01L, /* logirh[173] */ 2.70883447254679150939645524105991443744276583896589e-20L, /* logirl[173] */ } , { 5.19653537889556070463858289398828560479159932583570e-01L, /* logirh[174] */ 2.45929124553200804969371752267839129056713502249468e-20L, /* logirl[174] */ } , { 5.22119630384749572034417536281480920479225460439920e-01L, /* logirh[175] */ -2.18497180803548344111669417650081141798741623577199e-20L, /* logirl[175] */ } , { 5.24591819530138642462425285772908978287887293845415e-01L, /* logirh[176] */ 1.32203035151652728530582847665410458727777398365519e-20L, /* logirl[176] */ } , { 5.27070135544605730194053089254779820294061210006475e-01L, /* logirh[177] */ 1.76032437549609086335524539448277975821798914097017e-20L, /* logirl[177] */ } , { 5.28725765061866902010632995878580686621717177331448e-01L, /* logirh[178] */ -6.88102247990701389925516342020564246262797072332030e-23L, /* logirl[178] */ } , { 5.31214360290632056150247203296643760950246360152960e-01L, /* logirh[179] */ 2.66466330379185865323002458390306405768155182617574e-20L, /* logirl[179] */ } , { 5.33709164079414862609691827532998331662383861839771e-01L, /* logirh[180] */ -1.29762017107818188869410259485124080678804176241434e-20L, /* logirl[180] */ } , { 5.36210207484003745345615271622463637868349906057119e-01L, /* logirh[181] */ 1.65067700778453559631881994813258268290230772692962e-20L, /* logirl[181] */ } , { 5.37881051648821357916759738904133314463251736015081e-01L, /* logirh[182] */ -2.19109191560589250321272095571138928163548790076226e-20L, /* logirl[182] */ } , { 5.40392564061482290446898624214355777439777739346027e-01L, /* logirh[183] */ 2.08228396513876900118497171678012888475888240965144e-20L, /* logirl[183] */ } , { 5.42910400053823334208438072812086261365038808435202e-01L, /* logirh[184] */ 8.23644722718551463874152042367020651575236794759280e-21L, /* logirl[184] */ } , { 5.44592486236808166527503111131736091010679956525564e-01L, /* logirh[185] */ -2.00933067408533920949057044370384679454492154640310e-20L, /* logirl[185] */ } , { 5.47120932590166843430528470504370375238067936152220e-01L, /* logirh[186] */ -9.92524609455239275442518737817999625480140253588253e-21L, /* logirl[186] */ } , { 5.49655788193354895971275142496637045042007230222225e-01L, /* logirh[187] */ 2.60035059997719560566631655963598297729287367007908e-20L, /* logirl[187] */ } , { 5.51349268699687959530229136584367211071366909891367e-01L, /* logirh[188] */ 8.05024959333663801951435912985560282262081044464591e-21L, /* logirl[188] */ } , { 5.53894878899121686241600187594613657893205527216196e-01L, /* logirh[189] */ -1.83892465430777104472961145252041624877581186770337e-20L, /* logirl[189] */ } , { 5.56446985771356645851352940024270310459542088210583e-01L, /* logirh[190] */ 2.06677769878226925286245270139777726439942087527370e-20L, /* logirl[190] */ } , { 5.58152016022440478841114969155157155000779312103987e-01L, /* logirh[191] */ -2.58661388440662325511611588814692565587161510028965e-20L, /* logirl[191] */ } , { 5.60715024687329991240868076740611058994545601308346e-01L, /* logirh[192] */ -1.64182608886279055979239231155414518020340732707175e-20L, /* logirl[192] */ } , { 5.63284619248960715992471243174222195193578954786062e-01L, /* logirh[193] */ -2.65627455866435846195683323864140395189128131938038e-20L, /* logirl[193] */ } , { 5.65001357868015271265077492657269431219901889562607e-01L, /* logirh[194] */ -2.19552581601677369964960433395712510373598893667200e-20L, /* logirl[194] */ } , { 5.67582004461506905925068100504660151273128576576710e-01L, /* logirh[195] */ 5.90701142185794805590524668669544397085089572669788e-21L, /* logirl[195] */ } , { 5.69306142819646694805835879238387065015558619052172e-01L, /* logirh[196] */ 2.33009214880869002611805100582067855813554770257529e-20L, /* logirl[196] */ } , { 5.71897936927075624239692752670549680260592140257359e-01L, /* logirh[197] */ 1.63271047067863612422000647375332886660577686602113e-20L, /* logirl[197] */ } , { 5.73629539091353532682168031575642430652806069701910e-01L, /* logirh[198] */ 1.35778757354348431006030977215550960808915473679493e-20L, /* logirl[198] */ } , { 5.76232577437515759667327475135323311405954882502556e-01L, /* logirh[199] */ 1.28136064828063593458439031297239582536217112855437e-20L, /* logirl[199] */ } , { 5.78842409279886675808717011459947343610110692679882e-01L, /* logirh[200] */ -2.57440348169455489440041914302593932468377260933429e-20L, /* logirl[200] */ } , { 5.80586088884713529922713959319224841237883083522320e-01L, /* logirh[201] */ 4.41206613764798826108043412776466913688688358898484e-21L, /* logirl[201] */ } , { 5.83207322364587747753113949888970068968774285167456e-01L, /* logirh[202] */ -1.49189541037162430714759871409805107504755972902992e-21L, /* logirl[202] */ } , { 5.84958636297322764419429064197686329862335696816444e-01L, /* logirh[203] */ -1.60837721673687300800846563753717539999210255011878e-22L, /* logirl[203] */ } , { 5.86713022712216263673118410437723468930926173925400e-01L, /* logirh[204] */ -3.17168863463050625558020547002535137465925788804006e-21L, /* logirl[204] */ } , { 5.89350386878301744605131856635793496934638824313879e-01L, /* logirh[205] */ -1.39615389415916171660994818848901714495919357934706e-20L, /* logirl[205] */ } , { 5.91112501871701023466523783334025665681110695004463e-01L, /* logirh[206] */ 1.94637401144574668475212537692289150763221599806672e-20L, /* logirl[206] */ } , { 5.93761510043277948936186333428466355144337285310030e-01L, /* logirh[207] */ 2.13622917617199787393781580337151830714978899979519e-20L, /* logirl[207] */ } , { 5.95531422009736386346742675890197915578028187155724e-01L, /* logirh[208] */ -5.57259316426018508787411112338297856432265995386872e-21L, /* logirl[208] */ } , { 5.98192177459762712175232041156291984407289419323206e-01L, /* logirh[209] */ -3.74781519226728618443505703931062184338388651621827e-21L, /* logirl[209] */ } , { 5.99969955705762019674415208569939750304911285638809e-01L, /* logirh[210] */ -2.59644401395225784451061116582518643426188955954025e-20L, /* logirl[210] */ } , { 6.02642563087238492989475974193069873763306532055140e-01L, /* logirh[211] */ -2.50004437606787862337772976338569519653395217249839e-20L, /* logirl[211] */ } , { 6.04428277847473170865909286586514781447476707398891e-01L, /* logirh[212] */ -7.33579257076237518313264419331850361801721257990158e-21L, /* logirl[212] */ } , { 6.06217187090197695033266800379578853608109056949615e-01L, /* logirh[213] */ -2.17953080850264628478128768590230893044079856673130e-20L, /* logirl[213] */ } , { 6.08906565672169072236594167257806020643329247832298e-01L, /* logirh[214] */ 2.43001104791778958605091541205840292926934335038990e-20L, /* logirl[214] */ } , { 6.10703511348870718168906773781756669450260233134031e-01L, /* logirh[215] */ -1.98347209918879072887544491214489475082169187478903e-20L, /* logirl[215] */ } , { 6.12503691853018583787435225040951536357169970870018e-01L, /* logirh[216] */ 2.07857483606536363253783256589667608143722579784530e-20L, /* logirl[216] */ } , { 6.15210053450761525529327800043688512232620269060135e-01L, /* logirh[217] */ 7.72645219126903427887142350700660117976602336795165e-21L, /* logirl[217] */ } , { 6.17018372207545212680766116841724056030216161161661e-01L, /* logirh[218] */ 5.00582653358541288118250323060147668157890772059789e-21L, /* logirl[218] */ } , { 6.18829966905895933007054898755683325362042523920536e-01L, /* logirh[219] */ 2.60431023001686460777788589129926677065962205227216e-20L, /* logirl[219] */ } , { 6.21553527372936491502113803830908977943181525915861e-01L, /* logirh[220] */ -1.04869551248244441365933565828570015553511122659463e-20L, /* logirl[220] */ } , { 6.23373364089922462607726294514520759548759087920189e-01L, /* logirh[221] */ 2.27153427965787655960253811756921226020182163308283e-20L, /* logirl[221] */ } , { 6.25196518651437560000743570709502705540216993540525e-01L, /* logirh[222] */ 2.19232729760444485003184142946155941222776472408409e-20L, /* logirl[222] */ } , { 6.27937497982859842897505192604867829686554614454508e-01L, /* logirh[223] */ 2.59352328668902836446166306553362343068377561588123e-20L, /* logirl[223] */ } , { 6.29769000326327585089804250717548939064727164804935e-01L, /* logirh[224] */ -1.21467317879907709324733285927127135284313624485272e-20L, /* logirl[224] */ } , { 6.31603863226437932658786228445890742477786261588335e-01L, /* logirh[225] */ 1.63894778187414974146534085353091795011762181164691e-20L, /* logirl[225] */ } , { 6.33442099038188960458128917707654181867837905883789e-01L, /* logirh[226] */ -1.06695930136737880114178623385061897940403293765931e-20L, /* logirl[226] */ } , { 6.36205804159806884666688436835713105210743378847837e-01L, /* logirh[227] */ -8.46941691798603143710724761239322249883772469675312e-21L, /* logirl[227] */ } , { 6.38052526752971572575768438584375985556107480078936e-01L, /* logirh[228] */ 2.63671634127395583915856588351301065321489867148089e-20L, /* logirl[228] */ } , { 6.39902666041133026577757830777315462000842671841383e-01L, /* logirh[229] */ -2.63959031056676708649612991271987108904655365467646e-20L, /* logirl[229] */ } , { 6.41756234690455939877196112064439148525707423686981e-01L, /* logirh[230] */ 2.24760376658377731327353838657827087113829234283449e-20L, /* logirl[230] */ } , { 6.44543045597635230899678793203833038205630145967007e-01L, /* logirh[231] */ 1.55133630378868960145849365255088752071892290926646e-20L, /* logirl[231] */ } , { 6.46405243528699932045906983990590788380359299480915e-01L, /* logirh[232] */ -7.72135134400730894438722249896938881605660497758570e-21L, /* logirl[232] */ } , { 6.48270915711649635469575325696922618590178899466991e-01L, /* logirh[233] */ -2.53998248183380442804399491918209409440256852527255e-20L, /* logirl[233] */ } , { 6.50140075134353178113941207350023887556744739413261e-01L, /* logirh[234] */ 1.59816070187659374889917583730577235865801271336652e-20L, /* logirl[234] */ } , { 6.52012734857645037396360609971424082687008194625378e-01L, /* logirh[235] */ 1.45275263994271525130630696327763964092655442137801e-20L, /* logirl[235] */ } , { 6.53888908015872916243329399099692977870290633291006e-01L, /* logirh[236] */ 2.07648342785018300271983937594878297626085508933405e-20L, /* logirl[236] */ } , { 6.56709784357514260791366389469203568296507000923157e-01L, /* logirh[237] */ -2.55860224521869209004017944548994743296377030914363e-20L, /* logirl[237] */ } , { 6.58594799053285575988515854195526344483369030058384e-01L, /* logirh[238] */ 2.13447666728173583107487129669228031073599282234625e-20L, /* logirl[238] */ } , { 6.60483373741153712585625484843276922219956759363413e-01L, /* logirh[239] */ -2.68099338819034783490518710777734114173674267685964e-20L, /* logirl[239] */ } , { 6.62375521893191621070843405627570632532297167927027e-01L, /* logirh[240] */ -2.46394917661662285487000617992290646560405896530757e-20L, /* logirl[240] */ } , { 6.64271257058090767988727670667614688682078849524260e-01L, /* logirh[241] */ 4.89460149866724603480291964434582303569949285072746e-21L, /* logirl[241] */ } , { 6.66170592861743233678312875456484221103892195969820e-01L, /* logirh[242] */ -9.15004653796719880999098719384862468581948479370138e-21L, /* logirl[242] */ } , { 6.68073543007829348495344584657473774313984904438257e-01L, /* logirh[243] */ -2.51400168937888068945390384200867041048687993212480e-20L, /* logirl[243] */ } , { 6.69980121278410931161349101126134542028012219816446e-01L, /* logirh[244] */ 2.70838593697521094682948422665684057236843679459511e-20L, /* logirl[244] */ } , { 6.72846821760487024907150532815336418934748508036137e-01L, /* logirh[245] */ 1.06724601454353533112223106661914589204580784001879e-20L, /* logirl[245] */ } , { 6.74762531158625957514261145542278086395526770502329e-01L, /* logirh[246] */ -2.24888280496360550575110667851996097244442076628643e-20L, /* logirl[246] */ } , { 6.76681917544429519819054047458095624278939794749022e-01L, /* logirh[247] */ 2.15772052734613853105883485574187537438001210159785e-20L, /* logirl[247] */ } , { 6.78604995060171010815616016165208179700130131095648e-01L, /* logirh[248] */ -1.30586072834413655346920811356096828938860230682704e-20L, /* logirl[248] */ } , { 6.80531777929871074610777836877417712457827292382717e-01L, /* logirh[249] */ -2.21482221362167455319358217853577334183296289025644e-20L, /* logirl[249] */ } , { 6.82462280459928955400790429042245932578225620090961e-01L, /* logirh[250] */ -9.23973188373885101035764728029706054781623831427493e-21L, /* logirl[250] */ } , { 6.84396517039759856994123043971711695121484808623791e-01L, /* logirh[251] */ -1.15340975708897387680916809613678008557527533421693e-20L, /* logirl[251] */ } , { 6.86334502142438478275096591652015831641620025038719e-01L, /* logirh[252] */ 1.00516389437240083809638080859061807916651987536657e-20L, /* logirl[252] */ } , { 6.88276250325348796870426892891003944896510802209377e-01L, /* logirh[253] */ 7.82297589687341037552438599781693585434569670880706e-21L, /* logirl[253] */ } , { 6.90221776230840173389172870210828136805503163486719e-01L, /* logirh[254] */ -2.60525172176154149544033330497727120965480632602542e-20L, /* logirl[254] */ } , { 6.92171094586889850503938492742861399165121838450432e-01L, /* logirh[255] */ 1.73328038072979822371837713611880675698641265660364e-20L, /* logirl[255] */ } }; #endif /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ interval-2.1.0/src/crlibm/log-td.c0000644000000000000000000011543313031036767015072 0ustar 00000000000000/* * This function computes log, correctly rounded, * using triple double arithmetics * * Author : Christoph Lauter * christoph.lauter at ens-lyon.fr * */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" #include "log-td.h" #ifdef BUILD_INTERVAL_FUNCTIONS #include "interval.h" #endif #define AVOID_FMA 0 void log_td_accurate(double *logh, double *logm, double *logl, int E, double ed, int index, double zh, double zl, double logih, double logim) { double highPoly, t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, t8h, t8l, t9h, t9l, t10h, t10l, t11h, t11l; double t12h, t12l, t13h, t13l, t14h, t14l, zSquareh, zSquarem, zSquarel, zCubeh, zCubem, zCubel, higherPolyMultZh, higherPolyMultZm; double higherPolyMultZl, zSquareHalfh, zSquareHalfm, zSquareHalfl, polyWithSquareh, polyWithSquarem, polyWithSquarel; double polyh, polym, polyl, logil, logyh, logym, logyl, loghover, logmover, loglover, log2edhover, log2edmover, log2edlover; double log2edh, log2edm, log2edl; #if EVAL_PERF crlibm_second_step_taken++; #endif /* Accurate phase: Argument reduction is already done. We must return logh, logm and logl representing the intermediate result in 118 bits precision. We use a 14 degree polynomial, computing the first 3 (the first is 0) coefficients in triple double, calculating the next 7 coefficients in double double arithmetics and the last in double. We must account for zl starting with the monome of degree 4 (7^3 + 53 - 7 >> 118); so double double calculations won't account for it. */ /* Start of the horner scheme */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(accPolyC14,zh,accPolyC13),zh,accPolyC12),zh,accPolyC11),zh,accPolyC10); #else highPoly = accPolyC10 + zh * (accPolyC11 + zh * (accPolyC12 + zh * (accPolyC13 + zh * accPolyC14))); #endif /* We want to write accPolyC3 + zh * (accPoly4 + zh * (accPoly5 + zh * (accPoly6 + zh * (accPoly7 + zh * (accPoly8 + zh * (accPoly9 + zh * highPoly)))))); ( t14 t13 t12 t11 t10 t9 t8 t7 t6 t5 t4 t3 t2 t1 ) with all additions and multiplications in double double arithmetics but we will produce intermediate results labelled t1h/t1l thru t14h/t14l */ Mul12(&t1h, &t1l, zh, highPoly); Add22(&t2h, &t2l, accPolyC9h, accPolyC9l, t1h, t1l); Mul22(&t3h, &t3l, zh, zl, t2h, t2l); Add22(&t4h, &t4l, accPolyC8h, accPolyC8l, t3h, t3l); Mul22(&t5h, &t5l, zh, zl, t4h, t4l); Add22(&t6h, &t6l, accPolyC7h, accPolyC7l, t5h, t5l); Mul22(&t7h, &t7l, zh, zl, t6h, t6l); Add22(&t8h, &t8l, accPolyC6h, accPolyC6l, t7h, t7l); Mul22(&t9h, &t9l, zh, zl, t8h, t8l); Add22(&t10h, &t10l, accPolyC5h, accPolyC5l, t9h, t9l); Mul22(&t11h, &t11l, zh, zl, t10h, t10l); Add22(&t12h, &t12l, accPolyC4h, accPolyC4l, t11h, t11l); Mul22(&t13h, &t13l, zh, zl, t12h, t12l); Add22(&t14h, &t14l, accPolyC3h, accPolyC3l, t13h, t13l); /* We must now prepare (zh + zl)^2 and (zh + zl)^3 as triple doubles */ Mul23(&zSquareh, &zSquarem, &zSquarel, zh, zl, zh, zl); Mul233(&zCubeh, &zCubem, &zCubel, zh, zl, zSquareh, zSquarem, zSquarel); /* We can now multiplicate the middle and higher polynomial by z^3 */ Mul233(&higherPolyMultZh, &higherPolyMultZm, &higherPolyMultZl, t14h, t14l, zCubeh, zCubem, zCubel); /* Multiply now z^2 by -1/2 (exact op) and add to middle and higher polynomial */ zSquareHalfh = zSquareh * -0.5; zSquareHalfm = zSquarem * -0.5; zSquareHalfl = zSquarel * -0.5; Add33(&polyWithSquareh, &polyWithSquarem, &polyWithSquarel, zSquareHalfh, zSquareHalfm, zSquareHalfl, higherPolyMultZh, higherPolyMultZm, higherPolyMultZl); /* Add now zh and zl to obtain the polynomial evaluation result */ Add233(&polyh, &polym, &polyl, zh, zl, polyWithSquareh, polyWithSquarem, polyWithSquarel); /* Reconstruct now log(y) = log(1 + z) - log(ri) by adding logih, logim, logil logil has not been read to the time, do this first */ logil = argredtable[index].logil; Add33(&logyh, &logym, &logyl, logih, logim, logil, polyh, polym, polyl); /* Multiply log2 with E, i.e. log2h, log2m, log2l by ed ed is always less than 2^(12) and log2h and log2m are stored with at least 12 trailing zeros So multiplying naively is correct (up to 134 bits at least) The final result is thus obtained by adding log2 * E to log(y) */ log2edhover = log2h * ed; log2edmover = log2m * ed; log2edlover = log2l * ed; /* It may be necessary to renormalize the tabulated value (multiplied by ed) before adding the to the log(y)-result If needed, uncomment the following Renormalize3-Statement and comment out the copies following it. */ /* Renormalize3(&log2edh, &log2edm, &log2edl, log2edhover, log2edmover, log2edlover); */ log2edh = log2edhover; log2edm = log2edmover; log2edl = log2edlover; Add33(&loghover, &logmover, &loglover, log2edh, log2edm, log2edl, logyh, logym, logyl); /* Since we can not guarantee in each addition and multiplication procedure that the results are not overlapping, we must renormalize the result before handing it over to the final rounding */ Renormalize3(logh,logm,logl,loghover,logmover,loglover); } /************************************************************* ************************************************************* * ROUNDED TO NEAREST * ************************************************************* *************************************************************/ double log_rn(double x){ db_number xdb; double y, ed, ri, logih, logim, yrih, yril, th, zh, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, logl, roundcst; int E, index; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih, &yril, y, ri); th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zl)); Add22(&t2h, &t2l, zh, zl, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = ROUNDCST1; else roundcst = ROUNDCST2; if(logh == (logh + (logm * roundcst))) return logh; else { #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log_td_accurate(&logh, &logm, &logl, E, ed, index, zh, zl, logih, logim); ReturnRoundToNearest3(logh, logm, logl); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED UPWARDS * ************************************************************* *************************************************************/ double log_ru(double x) { db_number xdb; double y, ed, ri, logih, logim, yrih, yril, th, zh, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, logl, roundcst; int E, index; if (x == 1.0) return 0.0; /* This the only case in which the image under log of a double is a double. */ E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih, &yril, y, ri); th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zl)); Add22(&t2h, &t2l, zh, zl, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = RDROUNDCST1; else roundcst = RDROUNDCST2; TEST_AND_RETURN_RU(logh, logm, roundcst); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log_td_accurate(&logh, &logm, &logl, E, ed, index, zh, zl, logih, logim); ReturnRoundUpwards3(logh, logm, logl); } /************************************************************* ************************************************************* * ROUNDED DOWNWARDS * ************************************************************* *************************************************************/ double log_rd(double x) { db_number xdb; double y, ed, ri, logih, logim, yrih, yril, th, zh, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, logl, roundcst; int E, index; if (x == 1.0) return 0.0; /* This the only case in which the image under log of a double is a double. */ E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih, &yril, y, ri); th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zl)); Add22(&t2h, &t2l, zh, zl, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = RDROUNDCST1; else roundcst = RDROUNDCST2; TEST_AND_RETURN_RD(logh, logm, roundcst); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log_td_accurate(&logh, &logm, &logl, E, ed, index, zh, zl, logih, logim); ReturnRoundDownwards3(logh, logm, logl); } /************************************************************* ************************************************************* * ROUNDED TOWARDS ZERO * ************************************************************* *************************************************************/ double log_rz(double x) { db_number xdb; double y, ed, ri, logih, logim, yrih, yril, th, zh, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, logl, roundcst; int E, index; if (x == 1.0) return 0.0; /* This the only case in which the image under log of a double is a double. */ E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih, &yril, y, ri); th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zl)); Add22(&t2h, &t2l, zh, zl, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = RDROUNDCST1; else roundcst = RDROUNDCST2; TEST_AND_RETURN_RZ(logh, logm, roundcst); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log_td_accurate(&logh, &logm, &logl, E, ed, index, zh, zl, logih, logim); ReturnRoundTowardsZero3(logh, logm, logl); } #ifdef BUILD_INTERVAL_FUNCTIONS interval j_log(interval x) { interval res; int roundable; int cs_inf=0; int cs_sup=0; double x_inf,x_sup; x_inf=LOW(x); x_sup=UP(x); double res_inf, res_sup, res_simple_inf, res_simple_sup; db_number xdb_sup; double y_sup, ed_sup, ri_sup, logih_sup, logim_sup, yrih_sup, yril_sup, th_sup, zh_sup, zl_sup; double polyHorner_sup, zhSquareh_sup, zhSquarel_sup, polyUpper_sup, zhSquareHalfh_sup, zhSquareHalfl_sup; double t1h_sup, t1l_sup, t2h_sup, t2l_sup, ph_sup, pl_sup, log2edh_sup, log2edl_sup, logTabPolyh_sup, logTabPolyl_sup, logh_sup, logm_sup, logl_sup, roundcst; int E_sup, index_sup; db_number xdb_inf; double y_inf, ed_inf, ri_inf, logih_inf, logim_inf, yrih_inf, yril_inf, th_inf, zh_inf, zl_inf; double polyHorner_inf, zhSquareh_inf, zhSquarel_inf, polyUpper_inf, zhSquareHalfh_inf, zhSquareHalfl_inf; double t1h_inf, t1l_inf, t2h_inf, t2l_inf, ph_inf, pl_inf, log2edh_inf, log2edl_inf, logTabPolyh_inf, logTabPolyl_inf, logh_inf, logm_inf, logl_inf; int E_inf, index_inf; E_inf=0; xdb_inf.d=x_inf; E_sup=0; xdb_sup.d=x_sup; if (__builtin_expect( (x_inf == 1.0) || (!(x_inf<=x_sup)) || (xdb_sup.i[HI] < 0) || (xdb_inf.i[HI] < 0x00100000) || (((xdb_inf.i[HI] & 0x7fffffff)|xdb_inf.i[LO])==0) || (xdb_inf.i[HI] < 0) || (xdb_inf.i[HI] >= 0x7ff00000) || (x_sup == 1.0) || (xdb_sup.i[HI] < 0x00100000) || (((xdb_sup.i[HI] & 0x7fffffff)|xdb_sup.i[LO])==0) || (xdb_sup.i[HI] < 0) || (xdb_sup.i[HI] >= 0x7ff00000) || ((xdb_inf.d<00) && (xdb_sup.d>0) ) ,FALSE)) { if (!(x_inf<=x_sup)) RETURN_EMPTY_INTERVAL; if (xdb_sup.i[HI] < 0) RETURN_EMPTY_INTERVAL; if ((xdb_inf.d<00) && (xdb_sup.d>0) ) { ASSIGN_LOW(res,-1.0/0.0); ASSIGN_UP(res,log_ru(UP(x))); return res; } ASSIGN_LOW(res,log_rd(LOW(x))); ASSIGN_UP(res,log_ru(UP(x))); return res; } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E_inf += (xdb_inf.i[HI]>>20)-1023; /* extract the exponent */ E_sup += (xdb_sup.i[HI]>>20)-1023; /* extract the exponent */ index_inf = (xdb_inf.i[HI] & 0x000fffff); index_sup = (xdb_sup.i[HI] & 0x000fffff); xdb_inf.i[HI] = index_inf | 0x3ff00000; /* do exponent = 0 */ xdb_sup.i[HI] = index_sup | 0x3ff00000; /* do exponent = 0 */ index_inf = (index_inf + (1<<(20-L-1))) >> (20-L); index_sup = (index_sup + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index_inf >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb_inf.i[HI] -= 0x00100000; E_inf++; } /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index_sup >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb_sup.i[HI] -= 0x00100000; E_sup++; } y_inf = xdb_inf.d; y_sup = xdb_sup.d; index_inf = index_inf & INDEXMASK; index_sup = index_sup & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed_inf = (double) E_inf; ed_sup = (double) E_sup; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri_inf = argredtable[index_inf].ri; ri_sup = argredtable[index_sup].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih_inf = argredtable[index_inf].logih; logih_sup = argredtable[index_sup].logih; logim_inf = argredtable[index_inf].logim; logim_sup = argredtable[index_sup].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih_inf, &yril_inf, y_inf, ri_inf); Mul12(&yrih_sup, &yril_sup, y_sup, ri_sup); th_inf = yrih_inf - 1.0; th_sup = yrih_sup - 1.0; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Add12Cond(zh_inf, zl_inf, th_inf, yril_inf); Add12Cond(zh_sup, zl_sup, th_sup, yril_sup); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner_inf = FMA(FMA(FMA(FMA(c7,zh_inf,c6),zh_inf,c5),zh_inf,c4),zh_inf,c3); polyHorner_sup = FMA(FMA(FMA(FMA(c7,zh_sup,c6),zh_sup,c5),zh_sup,c4),zh_sup,c3); #else polyHorner_inf = c3 + zh_inf * (c4 + zh_inf * (c5 + zh_inf * (c6 + zh_inf * c7))); polyHorner_sup = c3 + zh_sup * (c4 + zh_sup * (c5 + zh_sup * (c6 + zh_sup * c7))); #endif Mul12(&zhSquareh_inf, &zhSquarel_inf, zh_inf, zh_inf); Mul12(&zhSquareh_sup, &zhSquarel_sup, zh_sup, zh_sup); polyUpper_inf = polyHorner_inf * (zh_inf * zhSquareh_inf); polyUpper_sup = polyHorner_sup * (zh_sup * zhSquareh_sup); zhSquareHalfh_inf = zhSquareh_inf * -0.5; zhSquareHalfh_sup = zhSquareh_sup * -0.5; zhSquareHalfl_inf = zhSquarel_inf * -0.5; zhSquareHalfl_sup = zhSquarel_sup * -0.5; Add12(t1h_inf, t1l_inf, polyUpper_inf, -1 * (zh_inf * zl_inf)); Add12(t1h_sup, t1l_sup, polyUpper_sup, -1 * (zh_sup * zl_sup)); Add22(&t2h_inf, &t2l_inf, zh_inf, zl_inf, zhSquareHalfh_inf, zhSquareHalfl_inf); Add22(&t2h_sup, &t2l_sup, zh_sup, zl_sup, zhSquareHalfh_sup, zhSquareHalfl_sup); Add22(&ph_inf, &pl_inf, t2h_inf, t2l_inf, t1h_inf, t1l_inf); Add22(&ph_sup, &pl_sup, t2h_sup, t2l_sup, t1h_sup, t1l_sup); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh_inf, log2edl_inf, log2h * ed_inf, log2m * ed_inf); /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh_sup, log2edl_sup, log2h * ed_sup, log2m * ed_sup); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh_inf, &logTabPolyl_inf, logih_inf, logim_inf, ph_inf, pl_inf); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh_inf, &logm_inf, log2edh_inf, log2edl_inf, logTabPolyh_inf, logTabPolyl_inf); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh_sup, &logTabPolyl_sup, logih_sup, logim_sup, ph_sup, pl_sup); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh_sup, &logm_sup, log2edh_sup, log2edl_sup, logTabPolyh_sup, logTabPolyl_sup); /* Rounding test and eventual return or call to the accurate function */ roundcst = RDROUNDCST1; if(cs_inf) { res_inf=res_simple_inf; } if(cs_sup) { res_sup=res_simple_sup; } //TEST_AND_COPY_RDRU_LOG(roundable,res_inf,logh_inf,logm_inf,res_sup,logh_sup,logm_sup,roundcst); //#define TEST_AND_COPY_RDRU_LOG(__cond__, __res_inf__, __yh_inf__, __yl_inf__, __res_sup__, __yh_sup__, __yl_sup__, __eps__) db_number yh_inf, yl_inf, u53_inf, yh_sup, yl_sup, u53_sup; int yh_inf_neg, yl_inf_neg, yh_sup_neg, yl_sup_neg; int rd_ok, ru_ok; double save_res_inf=res_inf; yh_inf.d = logh_inf; yl_inf.d = logm_inf; yh_inf_neg = (yh_inf.i[HI] & 0x80000000); yl_inf_neg = (yl_inf.i[HI] & 0x80000000); yh_inf.l = yh_inf.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ yl_inf.l = yl_inf.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ u53_inf.l = (yh_inf.l & ULL(7ff0000000000000)) + ULL(0010000000000000); yh_sup.d = logh_sup; yl_sup.d = logm_sup; yh_sup_neg = (yh_sup.i[HI] & 0x80000000); yl_sup_neg = (yl_sup.i[HI] & 0x80000000); yh_sup.l = yh_sup.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ yl_sup.l = yl_sup.l & 0x7fffffffffffffffLL; /* compute the absolute value*/ u53_sup.l = (yh_sup.l & ULL(7ff0000000000000)) + ULL(0010000000000000); roundable = 0; rd_ok=(yl_inf.d > roundcst * u53_inf.d); ru_ok=(yl_sup.d > roundcst * u53_sup.d); if(yl_inf_neg) { /* The case yl==0 is filtered by the above test*/ /* return next down */ yh_inf.d = logh_inf; if(yh_inf_neg) yh_inf.l++; else yh_inf.l--; /* Beware: fails for zero */ res_inf = yh_inf.d ; } else { res_inf = logh_inf; } if(!yl_sup_neg) { /* The case yl==0 is filtered by the above test*/ /* return next up */ yh_sup.d = logh_sup; if(yh_sup_neg) yh_sup.l--; else yh_sup.l++; /* Beware: fails for zero */ res_sup = yh_sup.d ; } else { res_sup = logh_sup; } if(save_res_inf==-1.0/0.0) res_inf=-1.0/0.0; if(rd_ok && ru_ok){ ASSIGN_LOW(res,res_inf); ASSIGN_UP(res,res_sup); return(res); } else if (rd_ok){ roundable=1; } else if (ru_ok){ roundable=2; } #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif if (roundable==1) { log_td_accurate(&logh_sup, &logm_sup, &logl_sup, E_sup, ed_sup, index_sup, zh_sup, zl_sup, logih_sup, logim_sup); RoundUpwards3(&res_sup, logh_sup, logm_sup, logl_sup); } if (roundable==2) { log_td_accurate(&logh_inf, &logm_inf, &logl_inf, E_inf, ed_inf, index_inf, zh_inf, zl_inf, logih_inf, logim_inf); RoundDownwards3(&res_inf, logh_inf, logm_inf, logl_inf); } if (roundable==0) { log_td_accurate(&logh_inf, &logm_inf, &logl_inf, E_inf, ed_inf, index_inf, zh_inf, zl_inf, logih_inf, logim_inf); RoundDownwards3(&res_inf, logh_inf, logm_inf, logl_inf); log_td_accurate(&logh_sup, &logm_sup, &logl_sup, E_sup, ed_sup, index_sup, zh_sup, zl_sup, logih_sup, logim_sup); RoundUpwards3(&res_sup, logh_sup, logm_sup, logl_sup); } ASSIGN_LOW(res,res_inf); ASSIGN_UP(res,res_sup); return res; } #endif interval-2.1.0/src/crlibm/log-td.h0000644000000000000000000012715513031036767015103 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" /*File generated by maple/log-td.mpl*/ #define L 7 #define MAXINDEX 53 #define INDEXMASK 127 #define two52 4.50359962737049600000000000000000000000000000000000e+15 #define log2h 6.93147180559890330187045037746429443359375000000000e-01 #define log2m 5.49792301870850242169664946507035702127907939029683e-14 #define log2l -1.31246984177852556920995753667322295879593697972250e-27 #define ROUNDCST1 1.00277296776935912123020172797003775857085744686284e+00 #define ROUNDCST2 1.00277296776935912123020172797003775857085744686284e+00 #define RDROUNDCST1 1.53329341668337408143884997262066747209318683475599e-19 #define RDROUNDCST2 1.53329341668337408143884997262066747209318683475599e-19 #define c3 3.33333333333333370340767487505218014121055603027344e-01 #define c4 -2.49999999990904886448817023847368545830249786376953e-01 #define c5 1.99999999978980019799124079327157232910394668579102e-01 #define c6 -1.66669050883027802800739891608827747404575347900391e-01 #define c7 1.42860109897981618631845890377007890492677688598633e-01 #define accPolyC3h 3.33333333333333314829616256247390992939472198486328e-01 #define accPolyC3l 1.85037170770859413132312241283212169118117639547054e-17 #define accPolyC4h -2.50000000000000000000000000000000000000000000000000e-01 #define accPolyC4l 4.62199018306924685334006418421322154174127637249391e-33 #define accPolyC5h 2.00000000000000011102230246251565404236316680908203e-01 #define accPolyC5l -1.11022302443127785678379338452126964515833173338601e-17 #define accPolyC6h -1.66666666666666657414808128123695496469736099243164e-01 #define accPolyC6l -9.25185854591372488017120157358742564605503054108327e-18 #define accPolyC7h 1.42857142857142849212692681248881854116916656494141e-01 #define accPolyC7l 7.92868209382438390589949095717120486682310988838960e-18 #define accPolyC8h -1.25000000000000000000000000000000000000000000000000e-01 #define accPolyC8l 3.42769668947376590645174407718339199260639267364101e-21 #define accPolyC9h 1.11111111111111521276839653182832989841699600219727e-01 #define accPolyC9l 4.33331955380787609416227741118274520376899199903317e-18 #define accPolyC10 -1.00000000000000699440505513848620466887950897216797e-01 #define accPolyC11 9.09090908567022348840680479042930528521537780761719e-02 #define accPolyC12 -8.33333332642126056732934102910803630948066711425781e-02 #define accPolyC13 7.69261287585959879775643344146374147385358810424805e-02 #define accPolyC14 -7.14319092953022982683819464000407606363296508789062e-02 typedef struct rri_tag {float ri; double logih; double logim; double logil;} rri; static const rri argredtable[128] = { { 1.00000000000000000000000000000000000000000000000000e+00, /* r[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logih[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logim[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logil[0] */ } , { 9.92248058319091796875000000000000000000000000000000e-01, /* r[1] */ 7.78214416734525436109004559170898573938757181167603e-03, /* logih[1] */ -1.28191618904143681948935996668824218266800862156024e-20, /* logim[1] */ 1.17655068600225378123891861200215069271455859581641e-37, /* logil[1] */ } , { 9.84615325927734375000000000000000000000000000000000e-01, /* r[2] */ 1.55042461406118062261505485821544425562024116516113e-02, /* logih[2] */ -3.27761516207149627029928635703400435929630184221293e-19, /* logim[2] */ 2.95200020707030964072253388818190769795416371257942e-37, /* logil[2] */ } , { 9.77099180221557617187500000000000000000000000000000e-01, /* r[3] */ 2.31671170235356708999585606534310500137507915496826e-02, /* logih[3] */ 5.57833156048330069504471566938468802334954100224869e-19, /* logim[3] */ 4.08416064054113313191746248503653555682943539201798e-35, /* logil[3] */ } , { 9.69696998596191406250000000000000000000000000000000e-01, /* r[4] */ 3.07716288644317437217523547587916254997253417968750e-02, /* logih[4] */ 1.04316437964092669923942103072089812062131860035492e-18, /* logim[4] */ -8.26837774892530079043982861155759865584698067912967e-36, /* logil[4] */ } , { 9.62406039237976074218750000000000000000000000000000e-01, /* r[5] */ 3.83188391564273991840572364253603154793381690979004e-02, /* logih[5] */ 1.54512636366303706650320890230224472259662656606095e-18, /* logim[5] */ 8.30977110244055528389241824578843983429633068152463e-35, /* logil[5] */ } , { 9.55223917961120605468750000000000000000000000000000e-01, /* r[6] */ 4.58094969157468376308450785927561810240149497985840e-02, /* logih[6] */ -3.30123051072550842868548428055668582607719074881820e-18, /* logim[6] */ 1.64164772626574162996727598513545022472742050176492e-34, /* logil[6] */ } , { 9.48148131370544433593750000000000000000000000000000e-01, /* r[7] */ 5.32445322139413548812036935942160198464989662170410e-02, /* logih[7] */ 2.23755385085953619415254057336256700540433618368589e-18, /* logim[7] */ -9.41330315099866735037984721876103977945647219756033e-35, /* logil[7] */ } , { 9.41176414489746093750000000000000000000000000000000e-01, /* r[8] */ 6.06246814210813916856679384181916248053312301635742e-02, /* logih[8] */ 2.64247317995478646334926909653435556549332769494295e-18, /* logim[8] */ 1.55075207452234839722600788456166299408429635417895e-34, /* logil[8] */ } , { 9.34306621551513671875000000000000000000000000000000e-01, /* r[9] */ 6.79506060291548280583029395529592875391244888305664e-02, /* logih[9] */ 5.65862161871167282533541105359923619273100535513035e-18, /* logim[9] */ -3.57889357320249912090032102867532919048871786355064e-34, /* logil[9] */ } , { 9.27536249160766601562500000000000000000000000000000e-01, /* r[10] */ 7.52234026111362058530929175503842998296022415161133e-02, /* logih[10] */ 1.00828755349783911736541446332784521904773238841865e-18, /* logim[10] */ 7.77966415828014771486738038255868010153689429282538e-36, /* logil[10] */ } , { 9.20863270759582519531250000000000000000000000000000e-01, /* r[11] */ 8.24437111205913314426751981045526918023824691772461e-02, /* logih[11] */ -4.27419767632228646217014766651675738804062364961374e-18, /* logim[11] */ 3.58539257549786746072726449331073277906948658046759e-34, /* logil[11] */ } , { 9.14285659790039062500000000000000000000000000000000e-01, /* r[12] */ 8.96122182943336897942288032936630770564079284667969e-02, /* logih[12] */ -5.42674234758262048883730612286095846547194397615989e-18, /* logim[12] */ -7.94903110897686868047461590865098481976776339992810e-35, /* logil[12] */ } , { 9.07801389694213867187500000000000000000000000000000e-01, /* r[13] */ 9.67296581235191493819414176869031507521867752075195e-02, /* logih[13] */ 1.17499431052084706890372286741885325822732164697539e-18, /* logim[13] */ -7.47188021694240554877009439429630012902672969107896e-35, /* logil[13] */ } , { 9.01408433914184570312500000000000000000000000000000e-01, /* r[14] */ 1.03796812308095232069149460585322231054306030273438e-01, /* logih[14] */ -1.46116759252442942691327623497388991415382979093093e-18, /* logim[14] */ -5.84766064918572844473631496354606243606272630720064e-35, /* logil[14] */ } , { 8.95104885101318359375000000000000000000000000000000e-01, /* r[15] */ 1.10814377516161077785739053069846704602241516113281e-01, /* logih[15] */ -5.75514509579248124656596649605847554012818793702281e-18, /* logim[15] */ 3.29977719536339952907783192540462408052319847426319e-34, /* logil[15] */ } , { 8.88888835906982421875000000000000000000000000000000e-01, /* r[16] */ 1.17783095261030007483427084480354096740484237670898e-01, /* logih[16] */ -1.19709798867727449215060005668653850880775796697715e-18, /* logim[16] */ 8.04222018353684236067064017226062133396406008492921e-35, /* logil[16] */ } , { 8.82758617401123046875000000000000000000000000000000e-01, /* r[17] */ 1.24703482226247538977581541530526010319590568542480e-01, /* logih[17] */ 2.28663295749049514726834658528273231115811065734312e-18, /* logim[17] */ -3.51123005875932392272239647660221882537057244586168e-35, /* logil[17] */ } , { 8.76712322235107421875000000000000000000000000000000e-01, /* r[18] */ 1.31576365239299886145118989588809199631214141845703e-01, /* logih[18] */ 1.11230010175930229418362785876222391520299564865730e-17, /* logim[18] */ 7.27451645836749926637643602480531900716806359121297e-34, /* logil[18] */ } , { 8.70748281478881835937500000000000000000000000000000e-01, /* r[19] */ 1.38402343348215994822680841025430709123611450195312e-01, /* logih[19] */ -7.69528416335144553864151614176326744245393995127969e-18, /* logim[19] */ 1.14202629230472885861778260955781649682548331183808e-34, /* logil[19] */ } , { 8.64864826202392578125000000000000000000000000000000e-01, /* r[20] */ 1.45182054547982469783207193358975928276777267456055e-01, /* logih[20] */ 8.24244856152552570070228105635897158979868211170798e-18, /* logim[20] */ -6.13072808770694892835379995250538817854995507648779e-34, /* logil[20] */ } , { 8.59060406684875488281250000000000000000000000000000e-01, /* r[21] */ 1.51916037369229123266123337998578790575265884399414e-01, /* logih[21] */ -1.04296908000297145574171199957656893307239877379000e-17, /* logim[21] */ -5.53636436435840586444373230094200986769217138540854e-34, /* logil[21] */ } , { 8.53333353996276855468750000000000000000000000000000e-01, /* r[22] */ 1.58605005962251938145257668111298698931932449340820e-01, /* logih[22] */ -8.86065192248216377790637508171938194510660992474042e-19, /* logim[22] */ -5.87995214834401673695486864800931832452468264932844e-35, /* logil[22] */ } , { 8.47682118415832519531250000000000000000000000000000e-01, /* r[23] */ 1.65249573826629747586025587224867194890975952148438e-01, /* logih[23] */ -9.66125475305916070790888958698289394696700966750453e-18, /* logim[23] */ 1.22853647999759344001960461047755491313341721869856e-34, /* logil[23] */ } , { 8.42105269432067871093750000000000000000000000000000e-01, /* r[24] */ 1.71850249476078659194300257695431355386972427368164e-01, /* logih[24] */ -6.02245395887480538795512923412250309472746231920746e-18, /* logim[24] */ 1.52961687917434402329553899350235008490821862631877e-34, /* logil[24] */ } , { 8.36601257324218750000000000000000000000000000000000e-01, /* r[25] */ 1.78407717077464861299418430462537799030542373657227e-01, /* logih[25] */ -1.24324832026190372515095573175819374097319572461178e-17, /* logim[25] */ -5.99222696564577786410580709003476847421843326905428e-34, /* logil[25] */ } , { 8.31168889999389648437500000000000000000000000000000e-01, /* r[26] */ 1.84922267713498816865680396404059138149023056030273e-01, /* logih[26] */ 9.96243711860796179875713739627414673019270693540839e-18, /* logim[26] */ -1.99546782893888540832510298706525540082513642365204e-34, /* logil[26] */ } , { 8.25806498527526855468750000000000000000000000000000e-01, /* r[27] */ 1.91394796188954025017991966706176754087209701538086e-01, /* logih[27] */ -8.22643020277300444045205706293674132131812201700538e-18, /* logim[27] */ 5.69056030867564774930537188285078930441778787828211e-34, /* logil[27] */ } , { 8.20512771606445312500000000000000000000000000000000e-01, /* r[28] */ 1.97825802934566419288842098467284813523292541503906e-01, /* logih[28] */ 1.28212649590622342007825921152819823725126964367518e-17, /* logim[28] */ 4.34712978477783827374998481132430084872238812357849e-34, /* logil[28] */ } , { 8.15286636352539062500000000000000000000000000000000e-01, /* r[29] */ 2.04215526527529805944638496839615982025861740112305e-01, /* logih[29] */ 2.73382699896480606605004885268461286375739934002155e-18, /* logim[29] */ 1.88415596219599490517606146615135776386751947516623e-34, /* logil[29] */ } , { 8.10126543045043945312500000000000000000000000000000e-01, /* r[30] */ 2.10564817536124687658016796376614365726709365844727e-01, /* logih[30] */ 2.68952644992466202072392146799884466396384136175691e-18, /* logim[30] */ -1.58883120037037559046153789501260274259127656480088e-34, /* logil[30] */ } , { 8.05031418800354003906250000000000000000000000000000e-01, /* r[31] */ 2.16873972759550226463431954471161589026451110839844e-01, /* logih[31] */ -1.23625140584833845652640860288020787431726668393088e-17, /* logim[31] */ -1.28369360755661214950804825668450767372141502246786e-34, /* logil[31] */ } , { 7.99999952316284179687500000000000000000000000000000e-01, /* r[32] */ 2.23143610918856316605030087885097600519657135009766e-01, /* logih[32] */ -9.09120001124270523314725361445863555491966823753373e-18, /* logim[32] */ 1.15945802868784933647836819275496182741822080543604e-34, /* logil[32] */ } , { 7.95031070709228515625000000000000000000000000000000e-01, /* r[33] */ 2.29374082438394522043267897970508784055709838867188e-01, /* logih[33] */ -1.08890120418598083770448590672876580941469212582837e-17, /* logim[33] */ 4.74877924128943438272197143958394008126523960202900e-34, /* logil[33] */ } , { 7.90123462677001953125000000000000000000000000000000e-01, /* r[34] */ 2.35566063862186342303672859088692348450422286987305e-01, /* logih[34] */ -2.39433728738216998660812173360881116827035967139939e-18, /* logim[34] */ -9.62471867414270770251397101906428335828045927610883e-35, /* logil[34] */ } , { 7.85276055335998535156250000000000000000000000000000e-01, /* r[35] */ 2.41719960170209802186036540661007165908813476562500e-01, /* logih[35] */ 2.39578119451184969695376143676233310543075971208880e-18, /* logim[35] */ 1.86231935097448741662637615288316997021879162207127e-34, /* logil[35] */ } , { 7.80487775802612304687500000000000000000000000000000e-01, /* r[36] */ 2.47836201157484947721343360171886160969734191894531e-01, /* logih[36] */ -1.24321923457726137680465119406863072977770725701004e-17, /* logim[36] */ -2.09577513970149680056365167860895085898294691979404e-34, /* logil[36] */ } , { 7.75757551193237304687500000000000000000000000000000e-01, /* r[37] */ 2.53915241645931488712051304901251569390296936035156e-01, /* logih[37] */ -6.31336333527435824035156315376733999545148217960567e-18, /* logim[37] */ 4.63496313971202069379055986715253908538961883067566e-35, /* logil[37] */ } , { 7.71084308624267578125000000000000000000000000000000e-01, /* r[38] */ 2.59957561689829752538116736104711890220642089843750e-01, /* logih[38] */ -7.05748899290965383754297836711168798219001736647281e-18, /* logim[38] */ 4.27245447011230141916526741370315150982259792796987e-34, /* logil[38] */ } , { 7.66467094421386718750000000000000000000000000000000e-01, /* r[39] */ 2.65963511244235673025571031757863238453865051269531e-01, /* logih[39] */ -2.24162125724264292804912034054420308588570407662844e-17, /* logim[39] */ 4.90471140265143981765909599584287898945638617268867e-34, /* logil[39] */ } , { 7.61904716491699218750000000000000000000000000000000e-01, /* r[40] */ 2.71933775088288309795814257086021825671195983886719e-01, /* logih[40] */ 7.83390223779535346513505580003968001040971161798700e-19, /* logim[40] */ -3.02585215101390470982866376614279464778757620082138e-35, /* logil[40] */ } , { 7.57396459579467773437500000000000000000000000000000e-01, /* r[41] */ 2.77868437964940373507971571598318405449390411376953e-01, /* logih[41] */ -2.69368711734232128278453248569958166651302969280381e-17, /* logim[41] */ 1.27334496810554064003001771076892864921428144153570e-33, /* logil[41] */ } , { 7.52941131591796875000000000000000000000000000000000e-01, /* r[42] */ 2.83768232735291170421021433867281302809715270996094e-01, /* logih[42] */ -2.03265852251844689554711830689719609838328388091381e-17, /* logim[42] */ 3.99265876662456660849597520210659365811534845502505e-34, /* logil[42] */ } , { 7.48538017272949218750000000000000000000000000000000e-01, /* r[43] */ 2.89633285132462114930262941925320774316787719726562e-01, /* logih[43] */ -7.21962253363417273270454867455071277489833577725373e-18, /* logim[43] */ -2.16150227221931053192432009592422674631830770048369e-34, /* logil[43] */ } , { 7.44186043739318847656250000000000000000000000000000e-01, /* r[44] */ 2.95464216619126196494704572614864446222782135009766e-01, /* logih[44] */ -1.47072146829197428851717511710908602721304319475328e-17, /* logim[44] */ 4.88114627787723832872543510409367916590649903129304e-34, /* logil[44] */ } , { 7.39884376525878906250000000000000000000000000000000e-01, /* r[45] */ 3.01261352929903802877475982313626445829868316650391e-01, /* logih[45] */ 1.87070681938931680167624656750430985298856099421569e-17, /* logim[45] */ 1.51413799416501325421897094776870076323182009328971e-33, /* logil[45] */ } , { 7.35632181167602539062500000000000000000000000000000e-01, /* r[46] */ 3.07025039020202172856954803137341514229774475097656e-01, /* logih[46] */ -5.38102227896180596526923200171118043417676846319102e-18, /* logim[46] */ 2.06712483430759996475892191286335029882052180959917e-34, /* logil[46] */ } , { 7.31428623199462890625000000000000000000000000000000e-01, /* r[47] */ 3.12755639223383730129768309780047275125980377197266e-01, /* logih[47] */ -7.57930782773895721056011815787401170737920404028723e-18, /* logim[47] */ 8.39475110593319988799512618628582752750846924050440e-35, /* logil[47] */ } , { 7.27272748947143554687500000000000000000000000000000e-01, /* r[48] */ 3.18453701316212645089365196326980367302894592285156e-01, /* logih[48] */ 2.71147705440665649189983820006370647423267349507715e-17, /* logim[48] */ 4.61673001741568050305139864943649666789926072891368e-34, /* logil[48] */ } , { 7.23163843154907226562500000000000000000000000000000e-01, /* r[49] */ 3.24119466791566834817928111078799702227115631103516e-01, /* logih[49] */ -6.22349090807112113628215383245238541760656175683922e-18, /* logim[49] */ -2.94864944946984528585289533414905600786096792764282e-34, /* logil[49] */ } , { 7.19101071357727050781250000000000000000000000000000e-01, /* r[50] */ 3.29753359015631464234985514849540777504444122314453e-01, /* logih[50] */ -2.38987037434306035496609341036867889075145964580121e-17, /* logim[50] */ -1.22161021411351376080765213758661026982900357467596e-33, /* logil[50] */ } , { 7.15083837509155273437500000000000000000000000000000e-01, /* r[51] */ 3.35355487904429983014864546930766664445400238037109e-01, /* logih[51] */ -2.15530481136091842439480783176785939188081961777809e-17, /* logim[51] */ 5.65377778536716902900522531845470344712374772157319e-34, /* logil[51] */ } , { 7.11111068725585937500000000000000000000000000000000e-01, /* r[52] */ 3.40926646575239744585417156486073508858680725097656e-01, /* logih[52] */ 1.74672070296268393919501631375949801326271042364782e-17, /* logim[52] */ 1.28757784323920807504216254145051967795248381758825e-33, /* logil[52] */ } , { 1.41436457633972167968750000000000000000000000000000e+00, /* r[53] */ -3.46680367578929504723816990008344873785972595214844e-01, /* logih[53] */ -2.63487075436177288054440686474043695042741778901884e-17, /* logim[53] */ -1.38972774108545698123375234719775474495262622652200e-33, /* logil[53] */ } , { 1.40659332275390625000000000000000000000000000000000e+00, /* r[54] */ -3.41170697798120592381110327551141381263732910156250e-01, /* logih[54] */ 1.93668606486849623510457675345565515553170548397263e-17, /* logim[54] */ -6.31924577586791945681481090971933602378723267089765e-34, /* logil[54] */ } , { 1.39890718460083007812500000000000000000000000000000e+00, /* r[55] */ -3.35691349380139503200126682713744230568408966064453e-01, /* logih[55] */ 8.91843232308579533655667936963342665384096382048557e-18, /* logim[55] */ -7.43852632990846244963757376301756885994340719135686e-34, /* logil[55] */ } , { 1.39130425453186035156250000000000000000000000000000e+00, /* r[56] */ -3.30241619815349218836075806393637321889400482177734e-01, /* logih[56] */ -1.69271534756955752333877800530082817995576241189249e-17, /* logim[56] */ -2.05124125474152062675126703058085713735683777118919e-34, /* logil[56] */ } , { 1.38378381729125976562500000000000000000000000000000e+00, /* r[57] */ -3.24821643615624322531942880232236348092555999755859e-01, /* logih[57] */ 1.93287622140617006961244731990086787828970688523722e-17, /* logim[57] */ -1.40211415833516824405184666805315188814704601258065e-33, /* logil[57] */ } , { 1.37634420394897460937500000000000000000000000000000e+00, /* r[58] */ -3.19430856448034428130000605960958637297153472900391e-01, /* logih[58] */ 5.58442737360353866559969930374464901851229137435661e-18, /* logim[58] */ -2.25313306148742433454599602113064828727792769150620e-34, /* logil[58] */ } , { 1.36898398399353027343750000000000000000000000000000e+00, /* r[59] */ -3.14068847182749744106899925100151449441909790039062e-01, /* logih[59] */ 1.74087330539322720259314067705480812845274240645592e-17, /* logim[59] */ 2.87763442397890459672608687761118393908121210479900e-34, /* logil[59] */ } , { 1.36170220375061035156250000000000000000000000000000e+00, /* r[60] */ -3.08735537528966208498104606405831873416900634765625e-01, /* logih[60] */ 2.31380218279209479391607966489385619371870731511261e-17, /* logim[60] */ 5.75649697670342883220331709767832654878804183961435e-34, /* logil[60] */ } , { 1.35449743270874023437500000000000000000000000000000e+00, /* r[61] */ -3.03430487161918061023158088573836721479892730712891e-01, /* logih[61] */ 5.88591784280850309549180895879864991445414905765635e-18, /* logim[61] */ 3.80740105286783019924475997846877792541810370319751e-34, /* logil[61] */ } , { 1.34736847877502441406250000000000000000000000000000e+00, /* r[62] */ -2.98153415159913837140237546918797306716442108154297e-01, /* logih[62] */ -8.81391967432414632609646763074561636922040597203571e-18, /* logim[62] */ -2.02736910549706342663167850737697734462522018249963e-34, /* logil[62] */ } , { 1.34031414985656738281250000000000000000000000000000e+00, /* r[63] */ -2.92904026677480888718463347686338238418102264404297e-01, /* logih[63] */ 1.79356774462556308958502912313675336181211584010969e-17, /* logim[63] */ 1.02350086185905899058999882149766002774623879978153e-34, /* logil[63] */ } , { 1.33333325386047363281250000000000000000000000000000e+00, /* r[64] */ -2.87682012847134349620148441317724063992500305175781e-01, /* logih[64] */ -2.60715355783435444041951693925565689223533295668838e-17, /* logim[64] */ -9.83372234709377378449141028490939682198507140512540e-34, /* logil[64] */ } , { 1.32642483711242675781250000000000000000000000000000e+00, /* r[65] */ -2.82487230428967117656924301627441309392452239990234e-01, /* logih[65] */ 2.49452771019268745755792758464310261659699707675018e-17, /* logim[65] */ -1.40230272425562150522506576584140991296902734870694e-33, /* logil[65] */ } , { 1.31958770751953125000000000000000000000000000000000e+00, /* r[66] */ -2.77319345020877350282972884087939746677875518798828e-01, /* logih[66] */ 7.44521346975934828880026635948320543669274837358637e-18, /* logim[66] */ -5.41922476182319969711469733445405189836277342215443e-34, /* logil[66] */ } , { 1.31282043457031250000000000000000000000000000000000e+00, /* r[67] */ -2.72177826311169102080356196893262676894664764404297e-01, /* logih[67] */ -1.94604737767255604321061638736698666324990178271015e-17, /* logim[67] */ 4.93318792723831633917605655356651628446409622108869e-34, /* logil[67] */ } , { 1.30612254142761230468750000000000000000000000000000e+00, /* r[68] */ -2.67062856029558426396164350080653093755245208740234e-01, /* logih[68] */ 1.42676910305707233200559864526771082234384991613068e-17, /* logim[68] */ 9.40874014190123375853921812584677628111272401841540e-34, /* logil[68] */ } , { 1.29949235916137695312500000000000000000000000000000e+00, /* r[69] */ -2.61973695252477101202970288795768283307552337646484e-01, /* logih[69] */ -1.59130185496344773949627658712806321021374170989957e-17, /* logim[69] */ 2.05966526658843352548575822504612882857523370085076e-34, /* logil[69] */ } , { 1.29292941093444824218750000000000000000000000000000e+00, /* r[70] */ -2.56910505054635363020310023784986697137355804443359e-01, /* logih[70] */ -2.32939629151451727444770801596466641031683815428509e-17, /* logim[70] */ -1.43942742464573220634874496721239465737503205324375e-33, /* logil[70] */ } , { 1.28643226623535156250000000000000000000000000000000e+00, /* r[71] */ -2.51872701711453261808060233306605368852615356445312e-01, /* logih[71] */ -2.58573188266130078596915247890597291360969537163785e-17, /* logim[71] */ 3.36064630885731507350249551263037246653963144676932e-34, /* logil[71] */ } , { 1.27999997138977050781250000000000000000000000000000e+00, /* r[72] */ -2.46860055579783743695543307694606482982635498046875e-01, /* logih[72] */ -1.36174299951708605118822966558244798958741114531493e-17, /* logim[72] */ -8.23883896198784591738914635896001757021238114385808e-35, /* logil[72] */ } , { 1.27363181114196777343750000000000000000000000000000e+00, /* r[73] */ -2.41872513137422084916750009142560884356498718261719e-01, /* logih[73] */ -2.91827950997726014268071786281330008614392694540440e-18, /* logim[73] */ 8.66387628958027677722140876839269007945711340420961e-35, /* logil[73] */ } , { 1.26732683181762695312500000000000000000000000000000e+00, /* r[74] */ -2.36909825309450927655063878773944452404975891113281e-01, /* logih[74] */ 4.97049401191734143236484721843489954792294974449682e-18, /* logim[74] */ 2.12212094628219632031384179435720857347529888567725e-34, /* logil[74] */ } , { 1.26108384132385253906250000000000000000000000000000e+00, /* r[75] */ -2.31971542737545860513037609962339047342538833618164e-01, /* logih[75] */ 1.20064411563385414488688519726171456939870706105353e-17, /* logim[75] */ -5.20241965000144345106493348505238495111737026311766e-34, /* logil[75] */ } , { 1.25490188598632812500000000000000000000000000000000e+00, /* r[76] */ -2.27057391030699523559732710964453872293233871459961e-01, /* logih[76] */ -9.55134517665639461592830714479938653876650013848813e-18, /* logim[76] */ -7.00052160915705629865262646818211330004502638341784e-34, /* logil[76] */ } , { 1.24878048896789550781250000000000000000000000000000e+00, /* r[77] */ -2.22167466272476882283015697794326115399599075317383e-01, /* logih[77] */ 1.12308837854924459441805420173945034636561801020789e-17, /* logim[77] */ 1.05992689326800868505291338111574353445179905470698e-34, /* logil[77] */ } , { 1.24271845817565917968750000000000000000000000000000e+00, /* r[78] */ -2.17301285003207084178811214769666548818349838256836e-01, /* logih[78] */ -1.37599098464784711367545798871014398359913153389606e-17, /* logim[78] */ -5.44676947016522950876420214713413739910691265570885e-34, /* logil[78] */ } , { 1.23671507835388183593750000000000000000000000000000e+00, /* r[79] */ -2.12458734101899110457978281374380458146333694458008e-01, /* logih[79] */ 3.12575020468223244847667531342710056704202576314513e-18, /* logim[79] */ 1.27082738610098894087384580413567050181540844264548e-35, /* logil[79] */ } , { 1.23076915740966796875000000000000000000000000000000e+00, /* r[80] */ -2.07639305173597937814733427330793347209692001342773e-01, /* logih[80] */ -1.20531726306040366742269494142059745690218464556184e-17, /* logim[80] */ 3.33883514126655983920316543317695602289579500921493e-34, /* logil[80] */ } , { 1.22488045692443847656250000000000000000000000000000e+00, /* r[81] */ -2.02843253050716987306856253781006671488285064697266e-01, /* logih[81] */ -1.66453566992001313940518505696243672056063400746100e-18, /* logim[81] */ 2.78446239404510241881587234176263335863162887428131e-35, /* logil[81] */ } , { 1.21904754638671875000000000000000000000000000000000e+00, /* r[82] */ -1.98069854157447239328959653903439175337553024291992e-01, /* logih[82] */ -3.74277289637934596837745314540095849706853736054736e-18, /* logim[82] */ 2.20940287174632344749918330821286328950105212564345e-34, /* logil[82] */ } , { 1.21327018737792968750000000000000000000000000000000e+00, /* r[83] */ -1.93319348256398265695210625381150748580694198608398e-01, /* logih[83] */ -4.63045754803609100012916107813305239709411987466506e-18, /* logim[83] */ 3.81311992624323390610440652445847060246376140730432e-34, /* logil[83] */ } , { 1.20754718780517578125000000000000000000000000000000e+00, /* r[84] */ -1.88591184708711112616441596401273272931575775146484e-01, /* logih[84] */ 7.43216311628945500204739783937941202296964434266492e-18, /* logim[84] */ -4.02931080995428730719681936637527024502063366412999e-34, /* logil[84] */ } , { 1.20187783241271972656250000000000000000000000000000e+00, /* r[85] */ -1.83885194019779485419263664880418218672275543212891e-01, /* logih[85] */ 4.12613043545869607985270580107985887836449099592842e-18, /* logim[85] */ -1.13080344207561908198013613253456946184091830340475e-34, /* logil[85] */ } , { 1.19626164436340332031250000000000000000000000000000e+00, /* r[86] */ -1.79201397792742966874612875471939332783222198486328e-01, /* logih[86] */ 1.25197515140082668570664893296659406065442168045883e-17, /* logim[86] */ 2.08673445558311131685127966451011169090072111640797e-34, /* logil[86] */ } , { 1.19069766998291015625000000000000000000000000000000e+00, /* r[87] */ -1.74539412626609380385644954003510065376758575439453e-01, /* logih[87] */ 8.52219781255028950312107624449830634785785378861392e-18, /* logim[87] */ 5.46720442033771639415150684633589460164820712880324e-34, /* logil[87] */ } , { 1.18518519401550292968750000000000000000000000000000e+00, /* r[88] */ -1.69899044245978042555478282338299322873353958129883e-01, /* logih[88] */ 4.86800738580472456380134000450154397097303177737598e-19, /* logim[88] */ -4.48365665383134519709151659261825733866549119396251e-36, /* logil[88] */ } , { 1.17972350120544433593750000000000000000000000000000e+00, /* r[89] */ -1.65280090007780350314092743246874306350946426391602e-01, /* logih[89] */ 1.05991222445546499578510819426998369466676418510398e-18, /* logim[89] */ 2.15535973016890499002202117947684925307171077322261e-36, /* logil[89] */ } , { 1.17431187629699707031250000000000000000000000000000e+00, /* r[90] */ -1.60682338849634120947484916541725397109985351562500e-01, /* logih[90] */ 5.38493323815703006679696841052856196024573538758454e-18, /* logim[90] */ 1.60200163876329179080224417109933041789065267300895e-34, /* logil[90] */ } , { 1.16894984245300292968750000000000000000000000000000e+00, /* r[91] */ -1.56105775199027185795586092353914864361286163330078e-01, /* logih[91] */ 1.32405772531609804709122583998125231935523184710352e-17, /* logim[91] */ 4.88933388697666736600942679327919927438390701656817e-35, /* logil[91] */ } , { 1.16363644599914550781250000000000000000000000000000e+00, /* r[92] */ -1.51549968907714105448292229993967339396476745605469e-01, /* logih[92] */ 1.77181633478899593214922561799512844823326841018122e-18, /* logim[92] */ 5.44951453107128861626798538797020344311568819287008e-35, /* logil[92] */ } , { 1.15837097167968750000000000000000000000000000000000e+00, /* r[93] */ -1.47014683357163111754317696977523155510425567626953e-01, /* logih[93] */ 4.46701777108311388441189058844554903695616000674812e-18, /* logim[93] */ -1.53168389834566630100313932781112142055948393405761e-34, /* logil[93] */ } , { 1.15315318107604980468750000000000000000000000000000e+00, /* r[94] */ -1.42500086821669674774781810810964088886976242065430e-01, /* logih[94] */ -2.21668083020505832726646787146199970227457581911830e-18, /* logim[94] */ -4.73140768447350921077611938776759805597533720242102e-36, /* logil[94] */ } , { 1.14798212051391601562500000000000000000000000000000e+00, /* r[95] */ -1.38005723310861472263866289722500368952751159667969e-01, /* logih[95] */ -9.06035372834454229539393713977175584764482079542462e-18, /* logim[95] */ -6.58482110068426815722709702700082916058774211791842e-34, /* logil[95] */ } , { 1.14285707473754882812500000000000000000000000000000e+00, /* r[96] */ -1.33531333019876075063336884340969845652580261230469e-01, /* logih[96] */ 3.66452824974217778950176131406293356640863401093569e-18, /* logim[96] */ 6.15050085774566840615703784135477182311292227710416e-35, /* logil[96] */ } , { 1.13777780532836914062500000000000000000000000000000e+00, /* r[97] */ -1.29077066489528990977930789085803553462028503417969e-01, /* logih[97] */ 7.97904258955058431558707127373439732289437010877585e-19, /* logim[97] */ -4.72584148771245137732808879600361038781792271619664e-35, /* logil[97] */ } , { 1.13274335861206054687500000000000000000000000000000e+00, /* r[98] */ -1.24642441481986290807704165217728586867451667785645e-01, /* logih[98] */ -1.12998120773332791412288663337308123303520797473827e-18, /* logim[98] */ 5.04751909879024305911295754405025108738663901055449e-35, /* logil[98] */ } , { 1.12775325775146484375000000000000000000000000000000e+00, /* r[99] */ -1.20227386019965673535914163494453532621264457702637e-01, /* logih[99] */ -4.10132123403305460439841682733159064509468253505934e-18, /* logim[99] */ 1.89802934268459828223199224893946334512039168636632e-34, /* logil[99] */ } , { 1.12280702590942382812500000000000000000000000000000e+00, /* r[100] */ -1.15831822975702269928888199501670897006988525390625e-01, /* logih[100] */ -4.33848450767153009712329850176816190393287866962401e-18, /* logim[100] */ -3.16979691573058896647113947407157157214490081484725e-34, /* logil[100] */ } , { 1.11790394783020019531250000000000000000000000000000e+00, /* r[101] */ -1.11455456757806464773707944004854653030633926391602e-01, /* logih[101] */ -5.25227837292521929481451677551514755953859335394548e-18, /* logim[101] */ -1.35455162271740897316919848287529722248286557667632e-34, /* logil[101] */ } , { 1.11304354667663574218750000000000000000000000000000e+00, /* r[102] */ -1.07098197023655139492603893813793547451496124267578e-01, /* logih[102] */ 3.47169710366632825350486634041554320998659998614468e-18, /* logim[102] */ 4.16291803858237783591365989446195611338780307382474e-35, /* logil[102] */ } , { 1.10822510719299316406250000000000000000000000000000e+00, /* r[103] */ -1.02759733026446364867467764270259067416191101074219e-01, /* logih[103] */ 5.14131173582414775653668171432178439238499706689565e-18, /* logim[103] */ -2.03511710633920722432014459953905354472733979743122e-34, /* logil[103] */ } , { 1.10344839096069335937500000000000000000000000000000e+00, /* r[104] */ -9.84401771213754411826712953370588365942239761352539e-02, /* logih[104] */ 4.43863133643792238822177111529042861410430977956950e-18, /* logim[104] */ 3.12055863098469149547827014037274497005231280699218e-34, /* logil[104] */ } , { 1.09871244430541992187500000000000000000000000000000e+00, /* r[105] */ -9.41389890512167593072945237508974969387054443359375e-02, /* logih[105] */ 2.37342936135295683496202513568031672884920488134173e-19, /* logim[105] */ 2.33721773003055253003147894270712826153088420940698e-35, /* logil[105] */ } , { 1.09401702880859375000000000000000000000000000000000e+00, /* r[106] */ -8.98562695172144959565585509153606835752725601196289e-02, /* logih[106] */ 6.27446602451052736319026996501069657057280086335290e-19, /* logim[106] */ -3.52284010127094716016693656249620808330731317587528e-35, /* logil[106] */ } , { 1.08936166763305664062500000000000000000000000000000e+00, /* r[107] */ -8.55918986704354706196440361054555978626012802124023e-02, /* logih[107] */ -5.03513826084130895904008327416965851388338774947593e-18, /* logim[107] */ 6.86424026896698901114373288904478288437409959196820e-35, /* logil[107] */ } , { 1.08474564552307128906250000000000000000000000000000e+00, /* r[108] */ -8.13455314205279167438789045263547450304031372070312e-02, /* logih[108] */ 1.86223784192593707654359268192644483006930996779864e-18, /* logim[108] */ -9.08215611660981343459991418247070342987317386688394e-35, /* logil[108] */ } , { 1.08016872406005859375000000000000000000000000000000e+00, /* r[109] */ -7.71172549156562414651716608204878866672515869140625e-02, /* logih[109] */ 4.37349590112793692636976332290601524356283649435490e-18, /* logim[109] */ -2.43638510650083687411626047741666976256819270953612e-34, /* logil[109] */ } , { 1.07563018798828125000000000000000000000000000000000e+00, /* r[110] */ -7.29067112034412351251333461732428986579179763793945e-02, /* logih[110] */ 6.30693084361487082247322771068486204374546343933133e-18, /* logim[110] */ 3.44825082371128400572272238979928316738696119124015e-34, /* logil[110] */ } , { 1.07112979888916015625000000000000000000000000000000e+00, /* r[111] */ -6.87139782297249979148290321973036043345928192138672e-02, /* logih[111] */ -4.40922228882126717948257852084234011599535648658716e-18, /* logim[111] */ 2.00071285755297414487130516445636815235532199087333e-34, /* logil[111] */ } , { 1.06666660308837890625000000000000000000000000000000e+00, /* r[112] */ -6.45384615329246263959461771264614071696996688842773e-02, /* logih[112] */ 6.47055724777502681297997296903095954212491541204973e-18, /* logim[112] */ -3.53995576621708408093066388957026321212073337996708e-34, /* logil[112] */ } , { 1.06224060058593750000000000000000000000000000000000e+00, /* r[113] */ -6.03804513842609302809449900450999848544597625732422e-02, /* logih[113] */ 2.15703432342306119511642925211564389619524247753812e-18, /* logim[113] */ -3.99051054966201464148223117427430962485432571249835e-35, /* logil[113] */ } , { 1.05785131454467773437500000000000000000000000000000e+00, /* r[114] */ -5.62397891033892469159205518280941760167479515075684e-02, /* logih[114] */ 3.28339677990388790029372693220459728960401288179580e-18, /* logim[114] */ 1.51915205677141595589208947882243470550543557886170e-35, /* logil[114] */ } , { 1.05349802970886230468750000000000000000000000000000e+00, /* r[115] */ -5.21160840267197236763685452842764789238572120666504e-02, /* logih[115] */ -2.76876652450490527514912306264172616345243137067863e-19, /* logim[115] */ 4.97747635693761803951848478678221385327287067714555e-36, /* logil[115] */ } , { 1.04918026924133300781250000000000000000000000000000e+00, /* r[116] */ -4.80091633070045681330739739678392652422189712524414e-02, /* logih[116] */ -1.43903217358996287866324353045636173989420593009940e-18, /* logim[116] */ 9.24533961563047616614044310774847027299245259235749e-35, /* logil[116] */ } , { 1.04489803314208984375000000000000000000000000000000e+00, /* r[117] */ -4.39193047153486545997047585387917933985590934753418e-02, /* logih[117] */ -1.76247347066130256555880115492006953917590179181782e-18, /* logim[117] */ 2.95067167680037492936848210009098107643918346324819e-35, /* logil[117] */ } , { 1.04065036773681640625000000000000000000000000000000e+00, /* r[118] */ -3.98458712942959952796329048396728467196226119995117e-02, /* logih[118] */ 3.12956491324511750770873688790894657687633404551217e-18, /* logim[118] */ 9.08530842942513514982993220469010912494881545842223e-35, /* logil[118] */ } , { 1.03643727302551269531250000000000000000000000000000e+00, /* r[119] */ -3.57891329972944774451271143789199413731694221496582e-02, /* logih[119] */ -2.94786708868720304892365707065135221787713948130908e-19, /* logim[119] */ 1.84384763058385810856389175018656477977822636794864e-35, /* logil[119] */ } , { 1.03225803375244140625000000000000000000000000000000e+00, /* r[120] */ -3.17486685122574663342476242178236134350299835205078e-02, /* logih[120] */ -3.03821748520802146852642560679641488082417537178322e-18, /* logim[120] */ 6.90127669441551609256721347857289051065660383455449e-35, /* logil[120] */ } , { 1.02811241149902343750000000000000000000000000000000e+00, /* r[121] */ -2.77245107619511835239656249996187398210167884826660e-02, /* logih[121] */ 1.56537436220084983093655029081028016172956628311065e-18, /* logim[121] */ -4.26959324792631463690822650182944301609062827136870e-35, /* logil[121] */ } , { 1.02399992942810058593750000000000000000000000000000e+00, /* r[122] */ -2.37164576994431455791989549197751330211758613586426e-02, /* logih[122] */ -1.57190014657555079881764699090245893269914973184857e-19, /* logim[122] */ 4.62721637019171363059082221740445258999073602747011e-36, /* logil[122] */ } , { 1.01992034912109375000000000000000000000000000000000e+00, /* r[123] */ -1.97245351501005340699723689112943247891962528228760e-02, /* logih[123] */ 1.34458916305708123412045028332259969564528051018263e-18, /* logim[123] */ -6.02768376061644464555810636396264987280148524662430e-35, /* logil[123] */ } , { 1.01587295532226562500000000000000000000000000000000e+00, /* r[124] */ -1.57482973634926158579272481574662378989160060882568e-02, /* logih[124] */ -1.00208727697080412925749596659626020152032796409604e-18, /* logim[124] */ 7.75790823155383991507800579878754988160969197338737e-35, /* logil[124] */ } , { 1.01185774803161621093750000000000000000000000000000e+00, /* r[125] */ -1.17879957989121472716753658005472971126437187194824e-02, /* logih[125] */ 2.12843993900806841444093729096134188145078357457959e-19, /* logim[125] */ -7.36236149534638490756917054603187520349493909791838e-36, /* logil[125] */ } , { 1.00787401199340820312500000000000000000000000000000e+00, /* r[126] */ -7.84317373573558719590526067122482345439493656158447e-03, /* logih[126] */ -2.76470798179560918828283984091643257584228907545928e-19, /* logim[126] */ 1.46121103426200283031313413564673422143931331178612e-35, /* logil[126] */ } , { 1.00392150878906250000000000000000000000000000000000e+00, /* r[127] */ -3.91383971648977691676352108629544090945273637771606e-03, /* logih[127] */ -4.28019276224719221462393891683495367484578724177817e-19, /* logim[127] */ -2.25272542183557712010826889962617244762256960750126e-35, /* logil[127] */ } }; interval-2.1.0/src/crlibm/log.c0000644000000000000000000020163613031036767014466 0ustar 00000000000000 #include #include #include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" #include "log.h" void p_accu(double *p_resh, double *p_resm, double *p_resl, double xh, double xm) { double p_t_1_0h; double p_t_2_0h; double p_t_3_0h; double p_t_4_0h; double p_t_5_0h; double p_t_6_0h; double p_t_7_0h; double p_t_8_0h; double p_t_9_0h, p_t_9_0m; double p_t_10_0h, p_t_10_0m; double p_t_11_0h, p_t_11_0m; double p_t_12_0h, p_t_12_0m; double p_t_13_0h, p_t_13_0m; double p_t_14_0h, p_t_14_0m; double p_t_15_0h, p_t_15_0m; double p_t_16_0h, p_t_16_0m, p_t_16_0l; double p_t_17_0h, p_t_17_0m, p_t_17_0l; double p_t_18_0h, p_t_18_0m, p_t_18_0l; double p_t_19_0h, p_t_19_0m, p_t_19_0l; double p_t_20_0h, p_t_20_0m, p_t_20_0l; double p_t_21_0h, p_t_21_0m, p_t_21_0l; #if EVAL_PERF crlibm_second_step_taken++; #endif p_t_1_0h = p_coeff_accu_12h; p_t_2_0h = p_t_1_0h * xh; p_t_3_0h = p_coeff_accu_11h + p_t_2_0h; p_t_4_0h = p_t_3_0h * xh; p_t_5_0h = p_coeff_accu_10h + p_t_4_0h; p_t_6_0h = p_t_5_0h * xh; p_t_7_0h = p_coeff_accu_9h + p_t_6_0h; p_t_8_0h = p_t_7_0h * xh; Add12(p_t_9_0h,p_t_9_0m,p_coeff_accu_8h,p_t_8_0h); MulAdd22(&p_t_10_0h,&p_t_10_0m,p_coeff_accu_7h,p_coeff_accu_7m,xh,xm,p_t_9_0h,p_t_9_0m); MulAdd22(&p_t_11_0h,&p_t_11_0m,p_coeff_accu_6h,p_coeff_accu_6m,xh,xm,p_t_10_0h,p_t_10_0m); MulAdd22(&p_t_12_0h,&p_t_12_0m,p_coeff_accu_5h,p_coeff_accu_5m,xh,xm,p_t_11_0h,p_t_11_0m); Mul22(&p_t_13_0h,&p_t_13_0m,p_t_12_0h,p_t_12_0m,xh,xm); Add122(&p_t_14_0h,&p_t_14_0m,p_coeff_accu_4h,p_t_13_0h,p_t_13_0m); Mul22(&p_t_15_0h,&p_t_15_0m,p_t_14_0h,p_t_14_0m,xh,xm); Add23(&p_t_16_0h,&p_t_16_0m,&p_t_16_0l,p_coeff_accu_3h,p_coeff_accu_3m,p_t_15_0h,p_t_15_0m); Mul233(&p_t_17_0h,&p_t_17_0m,&p_t_17_0l,xh,xm,p_t_16_0h,p_t_16_0m,p_t_16_0l); Add133(&p_t_18_0h,&p_t_18_0m,&p_t_18_0l,p_coeff_accu_2h,p_t_17_0h,p_t_17_0m,p_t_17_0l); Mul233(&p_t_19_0h,&p_t_19_0m,&p_t_19_0l,xh,xm,p_t_18_0h,p_t_18_0m,p_t_18_0l); Add133(&p_t_20_0h,&p_t_20_0m,&p_t_20_0l,p_coeff_accu_1h,p_t_19_0h,p_t_19_0m,p_t_19_0l); Mul233(&p_t_21_0h,&p_t_21_0m,&p_t_21_0l,xh,xm,p_t_20_0h,p_t_20_0m,p_t_20_0l); Renormalize3(p_resh,p_resm,p_resl,p_t_21_0h,p_t_21_0m,p_t_21_0l); } /************************************************************* ************************************************************* * ROUNDED TO NEAREST * ************************************************************* *************************************************************/ double log_rn(double x){ db_number xdb, yhdb; double yh, yl, ed, ri, logih, logim, logil, yrih, yril, th, zh, zl; double ph, pl, pm, log2edh, log2edl, log2edm, logTabPolyh, logTabPolyl, logh, logm, logl; int E, index; double zhSquare, zhCube, zhSquareHalf; double p35, p46, p36; double pUpper; double zhSquareHalfPlusZl; double zhFour; double logyh, logym, logyl; double loghover, logmover, loglover; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } yhdb.i[HI] = xdb.i[HI]; yhdb.i[LO] = 0; yh = yhdb.d; yl = xdb.d - yh; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 exactly Exactness is assured by use of two part yh + yl and 21 bit ri and Add12 Discard zl for higher monome degrees */ yrih = yh * ri; yril = yl * ri; th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial approximation */ zhSquare = zh * zh; /* 1 */ p35 = p_coeff_3h + zhSquare * p_coeff_5h; /* 3 */ p46 = p_coeff_4h + zhSquare * p_coeff_6h; /* 3 */ zhCube = zhSquare * zh; /* 2 */ zhSquareHalf = p_coeff_2h * zhSquare; /* 2 */ zhFour = zhSquare * zhSquare; /* 2 */ p36 = zhCube * p35 + zhFour * p46; /* 4 */ zhSquareHalfPlusZl = zhSquareHalf + zl; /* 3 */ pUpper = zhSquareHalfPlusZl + p36; /* 5 */ Add12(ph,pl,zh,pUpper); /* 8 */ /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus exact The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl */ Add22(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Rounding test and possible return or call to the accurate function */ if(logh == (logh + (logm * RNROUNDCST))) return logh; else { logil = argredtable[index].logil; p_accu(&ph, &pm, &pl, zh, zl); Add33(&logyh, &logym, &logyl, logih, logim, logil, ph, pm, pl); log2edh = log2h * ed; log2edm = log2m * ed; log2edl = log2l * ed; Add33(&loghover, &logmover, &loglover, log2edh, log2edm, log2edl, logyh, logym, logyl); Renormalize3(&logh,&logm,&logl,loghover,logmover,loglover); ReturnRoundToNearest3(logh, logm, logl); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED UPWARDS * ************************************************************* *************************************************************/ double log_ru(double x){ db_number xdb, yhdb; double yh, yl, ed, ri, logih, logim, logil, yrih, yril, th, zh, zl; double ph, pl, pm, log2edh, log2edl, log2edm, logTabPolyh, logTabPolyl, logh, logm, logl; int E, index; double zhSquare, zhCube, zhSquareHalf; double p35, p46, p36; double pUpper; double zhSquareHalfPlusZl; double zhFour; double logyh, logym, logyl; double loghover, logmover, loglover; if (x == 1.0) return 0.0; /* This the only case in which the image under log of a double is a double. */ E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } yhdb.i[HI] = xdb.i[HI]; yhdb.i[LO] = 0; yh = yhdb.d; yl = xdb.d - yh; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 exactly Exactness is assured by use of two part yh + yl and 21 bit ri and Add12 Discard zl for higher monome degrees */ yrih = yh * ri; yril = yl * ri; th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial approximation */ zhSquare = zh * zh; /* 1 */ p35 = p_coeff_3h + zhSquare * p_coeff_5h; /* 3 */ p46 = p_coeff_4h + zhSquare * p_coeff_6h; /* 3 */ zhCube = zhSquare * zh; /* 2 */ zhSquareHalf = p_coeff_2h * zhSquare; /* 2 */ zhFour = zhSquare * zhSquare; /* 2 */ p36 = zhCube * p35 + zhFour * p46; /* 4 */ zhSquareHalfPlusZl = zhSquareHalf + zl; /* 3 */ pUpper = zhSquareHalfPlusZl + p36; /* 5 */ Add12(ph,pl,zh,pUpper); /* 8 */ /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus exact The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl */ Add22(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Rounding test and possible return or call to the accurate function */ TEST_AND_RETURN_RU(logh, logm, RDROUNDCST); { logil = argredtable[index].logil; p_accu(&ph, &pm, &pl, zh, zl); Add33(&logyh, &logym, &logyl, logih, logim, logil, ph, pm, pl); log2edh = log2h * ed; log2edm = log2m * ed; log2edl = log2l * ed; Add33(&loghover, &logmover, &loglover, log2edh, log2edm, log2edl, logyh, logym, logyl); Renormalize3(&logh,&logm,&logl,loghover,logmover,loglover); ReturnRoundUpwards3(logh, logm, logl); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED DOWNWARDS * ************************************************************* *************************************************************/ double log_rd(double x){ db_number xdb, yhdb; double yh, yl, ed, ri, logih, logim, logil, yrih, yril, th, zh, zl; double ph, pl, pm, log2edh, log2edl, log2edm, logTabPolyh, logTabPolyl, logh, logm, logl; int E, index; double zhSquare, zhCube, zhSquareHalf; double p35, p46, p36; double pUpper; double zhSquareHalfPlusZl; double zhFour; double logyh, logym, logyl; double loghover, logmover, loglover; if (x == 1.0) return 0.0; /* This the only case in which the image under log of a double is a double. */ E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } yhdb.i[HI] = xdb.i[HI]; yhdb.i[LO] = 0; yh = yhdb.d; yl = xdb.d - yh; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 exactly Exactness is assured by use of two part yh + yl and 21 bit ri and Add12 Discard zl for higher monome degrees */ yrih = yh * ri; yril = yl * ri; th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial approximation */ zhSquare = zh * zh; /* 1 */ p35 = p_coeff_3h + zhSquare * p_coeff_5h; /* 3 */ p46 = p_coeff_4h + zhSquare * p_coeff_6h; /* 3 */ zhCube = zhSquare * zh; /* 2 */ zhSquareHalf = p_coeff_2h * zhSquare; /* 2 */ zhFour = zhSquare * zhSquare; /* 2 */ p36 = zhCube * p35 + zhFour * p46; /* 4 */ zhSquareHalfPlusZl = zhSquareHalf + zl; /* 3 */ pUpper = zhSquareHalfPlusZl + p36; /* 5 */ Add12(ph,pl,zh,pUpper); /* 8 */ /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus exact The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl */ Add22(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Rounding test and possible return or call to the accurate function */ TEST_AND_RETURN_RD(logh, logm, RDROUNDCST); { logil = argredtable[index].logil; p_accu(&ph, &pm, &pl, zh, zl); Add33(&logyh, &logym, &logyl, logih, logim, logil, ph, pm, pl); log2edh = log2h * ed; log2edm = log2m * ed; log2edl = log2l * ed; Add33(&loghover, &logmover, &loglover, log2edh, log2edm, log2edl, logyh, logym, logyl); Renormalize3(&logh,&logm,&logl,loghover,logmover,loglover); ReturnRoundDownwards3(logh, logm, logl); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED TOWARDS ZERO * ************************************************************* *************************************************************/ double log_rz(double x){ db_number xdb, yhdb; double yh, yl, ed, ri, logih, logim, logil, yrih, yril, th, zh, zl; double ph, pl, pm, log2edh, log2edl, log2edm, logTabPolyh, logTabPolyl, logh, logm, logl; int E, index; double zhSquare, zhCube, zhSquareHalf; double p35, p46, p36; double pUpper; double zhSquareHalfPlusZl; double zhFour; double logyh, logym, logyl; double loghover, logmover, loglover; if (x == 1.0) return 0.0; /* This the only case in which the image under log of a double is a double. */ E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } yhdb.i[HI] = xdb.i[HI]; yhdb.i[LO] = 0; yh = yhdb.d; yl = xdb.d - yh; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 exactly Exactness is assured by use of two part yh + yl and 21 bit ri and Add12 Discard zl for higher monome degrees */ yrih = yh * ri; yril = yl * ri; th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial approximation */ zhSquare = zh * zh; /* 1 */ p35 = p_coeff_3h + zhSquare * p_coeff_5h; /* 3 */ p46 = p_coeff_4h + zhSquare * p_coeff_6h; /* 3 */ zhCube = zhSquare * zh; /* 2 */ zhSquareHalf = p_coeff_2h * zhSquare; /* 2 */ zhFour = zhSquare * zhSquare; /* 2 */ p36 = zhCube * p35 + zhFour * p46; /* 4 */ zhSquareHalfPlusZl = zhSquareHalf + zl; /* 3 */ pUpper = zhSquareHalfPlusZl + p36; /* 5 */ Add12(ph,pl,zh,pUpper); /* 8 */ /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus exact The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl */ Add22(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Rounding test and possible return or call to the accurate function */ TEST_AND_RETURN_RZ(logh, logm, RDROUNDCST); { logil = argredtable[index].logil; p_accu(&ph, &pm, &pl, zh, zl); Add33(&logyh, &logym, &logyl, logih, logim, logil, ph, pm, pl); log2edh = log2h * ed; log2edm = log2m * ed; log2edl = log2l * ed; Add33(&loghover, &logmover, &loglover, log2edh, log2edm, log2edl, logyh, logym, logyl); Renormalize3(&logh,&logm,&logl,loghover,logmover,loglover); ReturnRoundTowardsZero3(logh, logm, logl); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED TO NEAREST * ************************************************************* *************************************************************/ double log2_rn(double x){ db_number xdb, yhdb; double yh, yl, ed, ri, logih, logim, logil, yrih, yril, th, zh, zl; double ph, pl, pm, logTabPolyh, logTabPolyl, logh, logm, logl; int E, index; double zhSquare, zhCube, zhSquareHalf; double p35, p46, p36; double pUpper; double zhSquareHalfPlusZl; double zhFour; double logyh, logym, logyl; double loghover, logmover, loglover; double log2TabPolyh, log2TabPolyl, log2yh, log2ym, log2yl; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } yhdb.i[HI] = xdb.i[HI]; yhdb.i[LO] = 0; yh = yhdb.d; yl = xdb.d - yh; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 exactly Exactness is assured by use of two part yh + yl and 21 bit ri and Add12 Discard zl for higher monome degrees */ yrih = yh * ri; yril = yl * ri; th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial approximation */ zhSquare = zh * zh; /* 1 */ p35 = p_coeff_3h + zhSquare * p_coeff_5h; /* 3 */ p46 = p_coeff_4h + zhSquare * p_coeff_6h; /* 3 */ zhCube = zhSquare * zh; /* 2 */ zhSquareHalf = p_coeff_2h * zhSquare; /* 2 */ zhFour = zhSquare * zhSquare; /* 2 */ p36 = zhCube * p35 + zhFour * p46; /* 4 */ zhSquareHalfPlusZl = zhSquareHalf + zl; /* 3 */ pUpper = zhSquareHalfPlusZl + p36; /* 5 */ Add12(ph,pl,zh,pUpper); /* 8 */ /* Reconstruction Read logih and logim in the tables (already done) Compute log2(x) = E + 1/log(2) * (log(1+z) - log(ri)) Carry out everything in double double precision */ /* Add logih and logim to ph and pl */ Add22(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Multiply by 1/log(2) */ Mul22(&log2TabPolyh,&log2TabPolyl, RECPRLOG2H, RECPRLOG2L, logTabPolyh, logTabPolyl); /* Add E */ Add122(&logh, &logm, ed, log2TabPolyh, log2TabPolyl); /* Rounding test and possible return or call to the accurate function */ if(logh == (logh + (logm * RNROUNDCST))) return logh; else { logil = argredtable[index].logil; p_accu(&ph, &pm, &pl, zh, zl); Add33(&logyh, &logym, &logyl, logih, logim, logil, ph, pm, pl); Mul233(&log2yh,&log2ym,&log2yl,RECPRLOG2H,RECPRLOG2L,logyh,logym,logyl); Add133(&loghover,&logmover,&loglover,ed,log2yh,log2ym,log2yl); Renormalize3(&logh,&logm,&logl,loghover,logmover,loglover); ReturnRoundToNearest3(logh, logm, logl); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED UPWARDS * ************************************************************* *************************************************************/ double log2_ru(double x){ db_number xdb, yhdb; double yh, yl, ed, ri, logih, logim, logil, yrih, yril, th, zh, zl; double ph, pl, pm, logTabPolyh, logTabPolyl, logh, logm, logl; int E, index; double zhSquare, zhCube, zhSquareHalf; double p35, p46, p36; double pUpper; double zhSquareHalfPlusZl; double zhFour; double logyh, logym, logyl; double loghover, logmover, loglover; double log2TabPolyh, log2TabPolyl, log2yh, log2ym, log2yl; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); /* Test now if the argument is an exact power of 2 i.e. if the mantissa is exactly 1 (0x0..0 with the implicit bit) This test is necessary for filtering out the cases where the final rounding test cannot distinguish between an exact algebraic number and a hard case to round */ if ((index | xdb.i[LO]) == 0) { /* Handle the "trivial" case for log2: The argument is an exact power of 2, return thus just the exponant of the number */ return (double) E; } xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } yhdb.i[HI] = xdb.i[HI]; yhdb.i[LO] = 0; yh = yhdb.d; yl = xdb.d - yh; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 exactly Exactness is assured by use of two part yh + yl and 21 bit ri and Add12 Discard zl for higher monome degrees */ yrih = yh * ri; yril = yl * ri; th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial approximation */ zhSquare = zh * zh; /* 1 */ p35 = p_coeff_3h + zhSquare * p_coeff_5h; /* 3 */ p46 = p_coeff_4h + zhSquare * p_coeff_6h; /* 3 */ zhCube = zhSquare * zh; /* 2 */ zhSquareHalf = p_coeff_2h * zhSquare; /* 2 */ zhFour = zhSquare * zhSquare; /* 2 */ p36 = zhCube * p35 + zhFour * p46; /* 4 */ zhSquareHalfPlusZl = zhSquareHalf + zl; /* 3 */ pUpper = zhSquareHalfPlusZl + p36; /* 5 */ Add12(ph,pl,zh,pUpper); /* 8 */ /* Reconstruction Read logih and logim in the tables (already done) Compute log2(x) = E + 1/log(2) * (log(1+z) - log(ri)) Carry out everything in double double precision */ /* Add logih and logim to ph and pl */ Add22(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Multiply by 1/log(2) */ Mul22(&log2TabPolyh,&log2TabPolyl, RECPRLOG2H, RECPRLOG2L, logTabPolyh, logTabPolyl); /* Add E */ Add122(&logh, &logm, ed, log2TabPolyh, log2TabPolyl); /* Rounding test and eventual return or call to the accurate function */ TEST_AND_RETURN_RU(logh, logm, RDROUNDCST); { logil = argredtable[index].logil; p_accu(&ph, &pm, &pl, zh, zl); Add33(&logyh, &logym, &logyl, logih, logim, logil, ph, pm, pl); Mul233(&log2yh,&log2ym,&log2yl,RECPRLOG2H,RECPRLOG2L,logyh,logym,logyl); Add133(&loghover,&logmover,&loglover,ed,log2yh,log2ym,log2yl); Renormalize3(&logh,&logm,&logl,loghover,logmover,loglover); ReturnRoundUpwards3(logh, logm, logl); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED DOWNWARDS * ************************************************************* *************************************************************/ double log2_rd(double x){ db_number xdb, yhdb; double yh, yl, ed, ri, logih, logim, logil, yrih, yril, th, zh, zl; double ph, pl, pm, logTabPolyh, logTabPolyl, logh, logm, logl; int E, index; double zhSquare, zhCube, zhSquareHalf; double p35, p46, p36; double pUpper; double zhSquareHalfPlusZl; double zhFour; double logyh, logym, logyl; double loghover, logmover, loglover; double log2TabPolyh, log2TabPolyl, log2yh, log2ym, log2yl; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); /* Test now if the argument is an exact power of 2 i.e. if the mantissa is exactly 1 (0x0..0 with the implicit bit) This test is necessary for filtering out the cases where the final rounding test cannot distinguish between an exact algebraic number and a hard case to round */ if ((index | xdb.i[LO]) == 0) { /* Handle the "trivial" case for log2: The argument is an exact power of 2, return thus just the exponant of the number */ return (double) E; } xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } yhdb.i[HI] = xdb.i[HI]; yhdb.i[LO] = 0; yh = yhdb.d; yl = xdb.d - yh; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 exactly Exactness is assured by use of two part yh + yl and 21 bit ri and Add12 Discard zl for higher monome degrees */ yrih = yh * ri; yril = yl * ri; th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial approximation */ zhSquare = zh * zh; /* 1 */ p35 = p_coeff_3h + zhSquare * p_coeff_5h; /* 3 */ p46 = p_coeff_4h + zhSquare * p_coeff_6h; /* 3 */ zhCube = zhSquare * zh; /* 2 */ zhSquareHalf = p_coeff_2h * zhSquare; /* 2 */ zhFour = zhSquare * zhSquare; /* 2 */ p36 = zhCube * p35 + zhFour * p46; /* 4 */ zhSquareHalfPlusZl = zhSquareHalf + zl; /* 3 */ pUpper = zhSquareHalfPlusZl + p36; /* 5 */ Add12(ph,pl,zh,pUpper); /* 8 */ /* Reconstruction Read logih and logim in the tables (already done) Compute log2(x) = E + 1/log(2) * (log(1+z) - log(ri)) Carry out everything in double double precision */ /* Add logih and logim to ph and pl */ Add22(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Multiply by 1/log(2) */ Mul22(&log2TabPolyh,&log2TabPolyl, RECPRLOG2H, RECPRLOG2L, logTabPolyh, logTabPolyl); /* Add E */ Add122(&logh, &logm, ed, log2TabPolyh, log2TabPolyl); /* Rounding test and eventual return or call to the accurate function */ TEST_AND_RETURN_RD(logh, logm, RDROUNDCST); { logil = argredtable[index].logil; p_accu(&ph, &pm, &pl, zh, zl); Add33(&logyh, &logym, &logyl, logih, logim, logil, ph, pm, pl); Mul233(&log2yh,&log2ym,&log2yl,RECPRLOG2H,RECPRLOG2L,logyh,logym,logyl); Add133(&loghover,&logmover,&loglover,ed,log2yh,log2ym,log2yl); Renormalize3(&logh,&logm,&logl,loghover,logmover,loglover); ReturnRoundDownwards3(logh, logm, logl); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED TOWARDS ZERO * ************************************************************* *************************************************************/ double log2_rz(double x){ db_number xdb, yhdb; double yh, yl, ed, ri, logih, logim, logil, yrih, yril, th, zh, zl; double ph, pl, pm, logTabPolyh, logTabPolyl, logh, logm, logl; int E, index; double zhSquare, zhCube, zhSquareHalf; double p35, p46, p36; double pUpper; double zhSquareHalfPlusZl; double zhFour; double logyh, logym, logyl; double loghover, logmover, loglover; double log2TabPolyh, log2TabPolyl, log2yh, log2ym, log2yl; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); /* Test now if the argument is an exact power of 2 i.e. if the mantissa is exactly 1 (0x0..0 with the implicit bit) This test is necessary for filtering out the cases where the final rounding test cannot distinguish between an exact algebraic number and a hard case to round */ if ((index | xdb.i[LO]) == 0) { /* Handle the "trivial" case for log2: The argument is an exact power of 2, return thus just the exponant of the number */ return (double) E; } xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } yhdb.i[HI] = xdb.i[HI]; yhdb.i[LO] = 0; yh = yhdb.d; yl = xdb.d - yh; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 exactly Exactness is assured by use of two part yh + yl and 21 bit ri and Add12 Discard zl for higher monome degrees */ yrih = yh * ri; yril = yl * ri; th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial approximation */ zhSquare = zh * zh; /* 1 */ p35 = p_coeff_3h + zhSquare * p_coeff_5h; /* 3 */ p46 = p_coeff_4h + zhSquare * p_coeff_6h; /* 3 */ zhCube = zhSquare * zh; /* 2 */ zhSquareHalf = p_coeff_2h * zhSquare; /* 2 */ zhFour = zhSquare * zhSquare; /* 2 */ p36 = zhCube * p35 + zhFour * p46; /* 4 */ zhSquareHalfPlusZl = zhSquareHalf + zl; /* 3 */ pUpper = zhSquareHalfPlusZl + p36; /* 5 */ Add12(ph,pl,zh,pUpper); /* 8 */ /* Reconstruction Read logih and logim in the tables (already done) Compute log2(x) = E + 1/log(2) * (log(1+z) - log(ri)) Carry out everything in double double precision */ /* Add logih and logim to ph and pl */ Add22(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Multiply by 1/log(2) */ Mul22(&log2TabPolyh,&log2TabPolyl, RECPRLOG2H, RECPRLOG2L, logTabPolyh, logTabPolyl); /* Add E */ Add122(&logh, &logm, ed, log2TabPolyh, log2TabPolyl); /* Rounding test and possible return or call to the accurate function */ TEST_AND_RETURN_RZ(logh, logm, RDROUNDCST); { logil = argredtable[index].logil; p_accu(&ph, &pm, &pl, zh, zl); Add33(&logyh, &logym, &logyl, logih, logim, logil, ph, pm, pl); Mul233(&log2yh,&log2ym,&log2yl,RECPRLOG2H,RECPRLOG2L,logyh,logym,logyl); Add133(&loghover,&logmover,&loglover,ed,log2yh,log2ym,log2yl); Renormalize3(&logh,&logm,&logl,loghover,logmover,loglover); ReturnRoundTowardsZero3(logh, logm, logl); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED TO NEAREST * ************************************************************* *************************************************************/ double log10_rn(double x){ db_number xdb, yhdb; double yh, yl, ed, ri, logih, logim, logil, yrih, yril, th, zh, zl; double ph, pl, pm, log2edh, log2edl, log2edm, logTabPolyh, logTabPolyl, logh, logm, logl; int E, index; double zhSquare, zhCube, zhSquareHalf; double p35, p46, p36; double pUpper; double zhSquareHalfPlusZl; double zhFour; double logyh, logym, logyl; double loghover, logmover, loglover; double log10TabPolyh, log10TabPolyl; double log10yh, log10ym, log10yl; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } yhdb.i[HI] = xdb.i[HI]; yhdb.i[LO] = 0; yh = yhdb.d; yl = xdb.d - yh; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 exactly Exactness is assured by use of two part yh + yl and 21 bit ri and Add12 Discard zl for higher monome degrees */ yrih = yh * ri; yril = yl * ri; th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial approximation */ zhSquare = zh * zh; /* 1 */ p35 = p_coeff_3h + zhSquare * p_coeff_5h; /* 3 */ p46 = p_coeff_4h + zhSquare * p_coeff_6h; /* 3 */ zhCube = zhSquare * zh; /* 2 */ zhSquareHalf = p_coeff_2h * zhSquare; /* 2 */ zhFour = zhSquare * zhSquare; /* 2 */ p36 = zhCube * p35 + zhFour * p46; /* 4 */ zhSquareHalfPlusZl = zhSquareHalf + zl; /* 3 */ pUpper = zhSquareHalfPlusZl + p36; /* 5 */ Add12(ph,pl,zh,pUpper); /* 8 */ /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log_10(2) as log210h + log210m + log210l where log210h and log210m have 10 trailing zeros Multiplication of ed (double E) and log210h and m is thus exact The overall accuracy of log10h + log10m + log10l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log210m is smaller than log210h and both are scaled by ed */ Add12(log2edh, log2edl, log210h * ed, log210m * ed); /* Add logih and logim to ph and pl */ Add22(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Multiply by 1/log(10) */ Mul22(&log10TabPolyh,&log10TabPolyl,RECPRLOG10H,RECPRLOG10M,logTabPolyh,logTabPolyl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22(&logh, &logm, log2edh, log2edl, log10TabPolyh, log10TabPolyl); /* Rounding test and possible return or call to the accurate function */ if(logh == (logh + (logm * RNROUNDCST))) return logh; else { logil = argredtable[index].logil; p_accu(&ph, &pm, &pl, zh, zl); Add33(&logyh, &logym, &logyl, logih, logim, logil, ph, pm, pl); Mul33(&log10yh,&log10ym,&log10yl,RECPRLOG10H,RECPRLOG10M,RECPRLOG10L,logyh,logym,logyl); log2edh = log210h * ed; log2edm = log210m * ed; log2edl = log210l * ed; Add33(&loghover, &logmover, &loglover, log2edh, log2edm, log2edl, log10yh, log10ym, log10yl); Renormalize3(&logh,&logm,&logl,loghover,logmover,loglover); ReturnRoundToNearest3(logh, logm, logl); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED UPWARDS * ************************************************************* *************************************************************/ double log10_ru(double x){ db_number xdb, yhdb; double yh, yl, ed, ri, logih, logim, logil, yrih, yril, th, zh, zl; double ph, pl, pm, log2edh, log2edl, log2edm, logTabPolyh, logTabPolyl, logh, logm, logl; int E, index; double zhSquare, zhCube, zhSquareHalf; double p35, p46, p36; double pUpper; double zhSquareHalfPlusZl; double zhFour; double logyh, logym, logyl; double loghover, logmover, loglover; double log10TabPolyh, log10TabPolyl; double log10yh, log10ym, log10yl; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } yhdb.i[HI] = xdb.i[HI]; yhdb.i[LO] = 0; yh = yhdb.d; yl = xdb.d - yh; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 exactly Exactness is assured by use of two part yh + yl and 21 bit ri and Add12 Discard zl for higher monome degrees */ yrih = yh * ri; yril = yl * ri; th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial approximation */ zhSquare = zh * zh; /* 1 */ p35 = p_coeff_3h + zhSquare * p_coeff_5h; /* 3 */ p46 = p_coeff_4h + zhSquare * p_coeff_6h; /* 3 */ zhCube = zhSquare * zh; /* 2 */ zhSquareHalf = p_coeff_2h * zhSquare; /* 2 */ zhFour = zhSquare * zhSquare; /* 2 */ p36 = zhCube * p35 + zhFour * p46; /* 4 */ zhSquareHalfPlusZl = zhSquareHalf + zl; /* 3 */ pUpper = zhSquareHalfPlusZl + p36; /* 5 */ Add12(ph,pl,zh,pUpper); /* 8 */ /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log_10(2) as log210h + log210m + log210l where log210h and log210m have 10 trailing zeros Multiplication of ed (double E) and log210h and m is thus exact The overall accuracy of log10h + log10m + log10l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log210m is smaller than log210h and both are scaled by ed */ Add12(log2edh, log2edl, log210h * ed, log210m * ed); /* Add logih and logim to ph and pl */ Add22(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Multiply by 1/log(10) */ Mul22(&log10TabPolyh,&log10TabPolyl,RECPRLOG10H,RECPRLOG10M,logTabPolyh,logTabPolyl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22(&logh, &logm, log2edh, log2edl, log10TabPolyh, log10TabPolyl); /* Rounding test and possible return or call to the accurate function */ TEST_AND_RETURN_RU(logh, logm, RDROUNDCST); { logil = argredtable[index].logil; p_accu(&ph, &pm, &pl, zh, zl); Add33(&logyh, &logym, &logyl, logih, logim, logil, ph, pm, pl); Mul33(&log10yh,&log10ym,&log10yl,RECPRLOG10H,RECPRLOG10M,RECPRLOG10L,logyh,logym,logyl); log2edh = log210h * ed; log2edm = log210m * ed; log2edl = log210l * ed; Add33(&loghover, &logmover, &loglover, log2edh, log2edm, log2edl, log10yh, log10ym, log10yl); Renormalize3(&logh,&logm,&logl,loghover,logmover,loglover); ReturnRoundUpwards3Unfiltered(logh, logm, logl, WORSTCASEACCURACY); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED DOWNWARDS * ************************************************************* *************************************************************/ double log10_rd(double x){ db_number xdb, yhdb; double yh, yl, ed, ri, logih, logim, logil, yrih, yril, th, zh, zl; double ph, pl, pm, log2edh, log2edl, log2edm, logTabPolyh, logTabPolyl, logh, logm, logl; int E, index; double zhSquare, zhCube, zhSquareHalf; double p35, p46, p36; double pUpper; double zhSquareHalfPlusZl; double zhFour; double logyh, logym, logyl; double loghover, logmover, loglover; double log10TabPolyh, log10TabPolyl; double log10yh, log10ym, log10yl; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } yhdb.i[HI] = xdb.i[HI]; yhdb.i[LO] = 0; yh = yhdb.d; yl = xdb.d - yh; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 exactly Exactness is assured by use of two part yh + yl and 21 bit ri and Add12 Discard zl for higher monome degrees */ yrih = yh * ri; yril = yl * ri; th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial approximation */ zhSquare = zh * zh; /* 1 */ p35 = p_coeff_3h + zhSquare * p_coeff_5h; /* 3 */ p46 = p_coeff_4h + zhSquare * p_coeff_6h; /* 3 */ zhCube = zhSquare * zh; /* 2 */ zhSquareHalf = p_coeff_2h * zhSquare; /* 2 */ zhFour = zhSquare * zhSquare; /* 2 */ p36 = zhCube * p35 + zhFour * p46; /* 4 */ zhSquareHalfPlusZl = zhSquareHalf + zl; /* 3 */ pUpper = zhSquareHalfPlusZl + p36; /* 5 */ Add12(ph,pl,zh,pUpper); /* 8 */ /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log_10(2) as log210h + log210m + log210l where log210h and log210m have 10 trailing zeros Multiplication of ed (double E) and log210h and m is thus exact The overall accuracy of log10h + log10m + log10l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log210m is smaller than log210h and both are scaled by ed */ Add12(log2edh, log2edl, log210h * ed, log210m * ed); /* Add logih and logim to ph and pl */ Add22(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Multiply by 1/log(10) */ Mul22(&log10TabPolyh,&log10TabPolyl,RECPRLOG10H,RECPRLOG10M,logTabPolyh,logTabPolyl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22(&logh, &logm, log2edh, log2edl, log10TabPolyh, log10TabPolyl); /* Rounding test and possible return or call to the accurate function */ TEST_AND_RETURN_RD(logh, logm, RDROUNDCST); { logil = argredtable[index].logil; p_accu(&ph, &pm, &pl, zh, zl); Add33(&logyh, &logym, &logyl, logih, logim, logil, ph, pm, pl); Mul33(&log10yh,&log10ym,&log10yl,RECPRLOG10H,RECPRLOG10M,RECPRLOG10L,logyh,logym,logyl); log2edh = log210h * ed; log2edm = log210m * ed; log2edl = log210l * ed; Add33(&loghover, &logmover, &loglover, log2edh, log2edm, log2edl, log10yh, log10ym, log10yl); Renormalize3(&logh,&logm,&logl,loghover,logmover,loglover); ReturnRoundDownwards3Unfiltered(logh, logm, logl, WORSTCASEACCURACY); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED TOWARDS ZERO * ************************************************************* *************************************************************/ double log10_rz(double x){ db_number xdb, yhdb; double yh, yl, ed, ri, logih, logim, logil, yrih, yril, th, zh, zl; double ph, pl, pm, log2edh, log2edl, log2edm, logTabPolyh, logTabPolyl, logh, logm, logl; int E, index; double zhSquare, zhCube, zhSquareHalf; double p35, p46, p36; double pUpper; double zhSquareHalfPlusZl; double zhFour; double logyh, logym, logyl; double loghover, logmover, loglover; double log10TabPolyh, log10TabPolyl; double log10yh, log10ym, log10yl; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } yhdb.i[HI] = xdb.i[HI]; yhdb.i[LO] = 0; yh = yhdb.d; yl = xdb.d - yh; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 exactly Exactness is assured by use of two part yh + yl and 21 bit ri and Add12 Discard zl for higher monome degrees */ yrih = yh * ri; yril = yl * ri; th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial approximation */ zhSquare = zh * zh; /* 1 */ p35 = p_coeff_3h + zhSquare * p_coeff_5h; /* 3 */ p46 = p_coeff_4h + zhSquare * p_coeff_6h; /* 3 */ zhCube = zhSquare * zh; /* 2 */ zhSquareHalf = p_coeff_2h * zhSquare; /* 2 */ zhFour = zhSquare * zhSquare; /* 2 */ p36 = zhCube * p35 + zhFour * p46; /* 4 */ zhSquareHalfPlusZl = zhSquareHalf + zl; /* 3 */ pUpper = zhSquareHalfPlusZl + p36; /* 5 */ Add12(ph,pl,zh,pUpper); /* 8 */ /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log_10(2) as log210h + log210m + log210l where log210h and log210m have 10 trailing zeros Multiplication of ed (double E) and log210h and m is thus exact The overall accuracy of log10h + log10m + log10l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log210m is smaller than log210h and both are scaled by ed */ Add12(log2edh, log2edl, log210h * ed, log210m * ed); /* Add logih and logim to ph and pl */ Add22(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Multiply by 1/log(10) */ Mul22(&log10TabPolyh,&log10TabPolyl,RECPRLOG10H,RECPRLOG10M,logTabPolyh,logTabPolyl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22(&logh, &logm, log2edh, log2edl, log10TabPolyh, log10TabPolyl); /* Rounding test and possible return or call to the accurate function */ TEST_AND_RETURN_RZ(logh, logm, RDROUNDCST); { logil = argredtable[index].logil; p_accu(&ph, &pm, &pl, zh, zl); Add33(&logyh, &logym, &logyl, logih, logim, logil, ph, pm, pl); Mul33(&log10yh,&log10ym,&log10yl,RECPRLOG10H,RECPRLOG10M,RECPRLOG10L,logyh,logym,logyl); log2edh = log210h * ed; log2edm = log210m * ed; log2edl = log210l * ed; Add33(&loghover, &logmover, &loglover, log2edh, log2edm, log2edl, log10yh, log10ym, log10yl); Renormalize3(&logh,&logm,&logl,loghover,logmover,loglover); ReturnRoundTowardsZero3Unfiltered(logh, logm, logl, WORSTCASEACCURACY); } /* Accurate phase launched */ } interval-2.1.0/src/crlibm/log.h0000644000000000000000000025450313031036767014474 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" #define L 8 #define MAXINDEX 106 #define INDEXMASK 255 #define two52 4.50359962737049600000000000000000000000000000000000e+15 #define log2h 6.93147180559890330187045037746429443359375000000000e-01 #define log2m 5.49792301870850242169664946507035702127907939029683e-14 #define log2l -1.31246984177852556920995753667322295879593697972250e-27 #define log210h 0.3010299956639528318191878497600555419921875 #define log210m 0.28363394551042263094578877949012915560267344972089631482958793640137e-13 #define log210l 0.27013429058980534315374921000428327002971066904842912935671669760243e-26 #define RNROUNDCST 1.01587301587301598581442042834326647273327977070694e+00 #define RDROUNDCST 8.67361737988403547205962240695953369140625000000000e-19 #define RECPRLOG2H 0.1442695040888963387004650940070860087871551513671875e1 #define RECPRLOG2L 0.203552737409310331110210900522069120325603861485809498166e-16 #define RECPRLOG10H 0.43429448190325181666793241674895398318767547607421875 #define RECPRLOG10M 0.109831965021676507273885982186335434116483395815071742729340797950499108992516994476318359375e-16 #define RECPRLOG10L 0.3717181233110958966699817676973599714051656514224857273631510154667658260758842841533296404155084502463068929500877857208251953125e-33 #define WORSTCASEACCURACY 0.5316911983139663491615228241121378304e37 #define p_coeff_accu_1h 1.00000000000000000000000000000000000000000000000000000000000000000000000000000000e+00 #define p_coeff_accu_2h -5.00000000000000000000000000000000000000000000000000000000000000000000000000000000e-01 #define p_coeff_accu_3h 3.33333333333333314829616256247390992939472198486328125000000000000000000000000000e-01 #define p_coeff_accu_3m 1.85037170770874789756988228974262968046011237606765509333683894510613754391670227e-17 #define p_coeff_accu_4h -2.50000000000000000000000000000000000000000000000000000000000000000000000000000000e-01 #define p_coeff_accu_5h 2.00000000000000011102230246251565404236316680908203125000000000000000000000000000e-01 #define p_coeff_accu_5m -1.11022359498086234952280980357986354308310664976318371532926221334491856396198273e-17 #define p_coeff_accu_6h -1.66666666666666657414808128123695496469736099243164062500000000000000000000000000e-01 #define p_coeff_accu_6m -9.25186011742975917381555124745579318634206911138887982626322070700553013011813164e-18 #define p_coeff_accu_7h 1.42857142857142876968268296877795364707708358764648437500000000000000000000000000e-01 #define p_coeff_accu_7m -1.29473592850074078984540189203202170950776491657307348814853753538045566529035568e-17 #define p_coeff_accu_8h -1.25000000000000000000000000000000000000000000000000000000000000000000000000000000e-01 #define p_coeff_accu_9h 1.11111111107490570515388128569611581042408943176269531250000000000000000000000000e-01 #define p_coeff_accu_10h -9.99999999987549875735126647668948862701654434204101562500000000000000000000000000e-02 #define p_coeff_accu_11h 9.09099561261329930372809826621960382908582687377929687500000000000000000000000000e-02 #define p_coeff_accu_12h -8.33339031627361587206692661311535630375146865844726562500000000000000000000000000e-02 #define p_coeff_1h 1.00000000000000000000000000000000000000000000000000000000000000000000000000000000e+00 #define p_coeff_2h -5.00000000000000000000000000000000000000000000000000000000000000000000000000000000e-01 #define p_coeff_3h 3.33333333332438030982558530013193376362323760986328125000000000000000000000000000e-01 #define p_coeff_4h -2.49999999998981758952965037678950466215610504150390625000000000000000000000000000e-01 #define p_coeff_5h 2.00000758681036727715252254711231216788291931152343750000000000000000000000000000e-01 #define p_coeff_6h -1.66667399943076749435633132634393405169248580932617187500000000000000000000000000e-01 typedef struct rri_tag {float ri; double logih; double logim; double logil;} rri; static const rri argredtable[256] = { { 1.00000000000000000000000000000000000000000000000000e+00, /* r[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logih[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logim[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logil[0] */ } , { 9.96109008789062500000000000000000000000000000000000e-01, /* r[1] */ 3.89858081101432385473515296325786039233207702636719e-03, /* logih[1] */ 1.25346004307267304894640684851581512787262559024016e-19, /* logim[1] */ 4.64325168845438317713718561737934247375332721265836e-36, /* logil[1] */ } , { 9.92248535156250000000000000000000000000000000000000e-01, /* r[2] */ 7.78166360501043267300369521421998797450214624404907e-03, /* logih[2] */ -4.89592386148351837006945254137918249482580247924126e-20, /* logim[2] */ -1.08409213368413141614035817819969540383455164545947e-36, /* logil[2] */ } , { 9.88416671752929687500000000000000000000000000000000e-01, /* r[3] */ 1.16509375949922621557020008253857668023556470870972e-02, /* logih[3] */ -2.25226774360965572201294117569374162214377850269541e-19, /* logim[3] */ -5.11945341084299010662466108636073292979157772198876e-36, /* logil[3] */ } , { 9.84615325927734375000000000000000000000000000000000e-01, /* r[4] */ 1.55042461406118062261505485821544425562024116516113e-02, /* logih[4] */ -3.27761516207149627029928635703400435929630184221293e-19, /* logim[4] */ 2.95200020707030964072253388818190769795416371257942e-37, /* logil[4] */ } , { 9.80842590332031250000000000000000000000000000000000e-01, /* r[5] */ 1.93432906687309343063407851559531991370022296905518e-02, /* logih[5] */ -2.15862131267131143148684267329697650453139578671228e-19, /* logim[5] */ -1.15271369538876060199548423508281675592171686662266e-35, /* logil[5] */ } , { 9.77099418640136718750000000000000000000000000000000e-01, /* r[6] */ 2.31668730170368035448102972395645338110625743865967e-02, /* logih[6] */ -1.17910860908392752354910733048566386347187195159043e-18, /* logim[6] */ 2.49612518164524848780028044162189727076238619175360e-35, /* logil[6] */ } , { 9.73383903503417968750000000000000000000000000000000e-01, /* r[7] */ 2.69767180833710221166121812075289199128746986389160e-02, /* logih[7] */ -5.57795528916207151895634361214250967547427159484621e-20, /* logim[7] */ -3.62294468430332561712587522351589910764493467585522e-36, /* logil[7] */ } , { 9.69696998596191406250000000000000000000000000000000e-01, /* r[8] */ 3.07716288644317437217523547587916254997253417968750e-02, /* logih[8] */ 1.04316437964092669923942103072089812062131860035492e-18, /* logim[8] */ -8.26837774892530079043982861155759865584698067912967e-36, /* logil[8] */ } , { 9.66037750244140625000000000000000000000000000000000e-01, /* r[9] */ 3.45523666054986522411240912333596497774124145507812e-02, /* logih[9] */ -1.65910748103534385407065291371523592570431641990885e-18, /* logim[9] */ 3.38525826535166864039714297442413583169978770990777e-35, /* logil[9] */ } , { 9.62406158447265625000000000000000000000000000000000e-01, /* r[10] */ 3.83187152905357653054352340404875576496124267578125e-02, /* logih[10] */ -2.35909906471143038057626284336250570775789572626881e-18, /* logim[10] */ -1.85563428635831615187251482536612501452930840707165e-34, /* logil[10] */ } , { 9.58801269531250000000000000000000000000000000000000e-01, /* r[11] */ 4.20714523392945807800380464414047310128808021545410e-02, /* logih[11] */ -3.12838632664719081818569863425510803330088438244181e-18, /* logim[11] */ -3.22458892012633541790068267080237442991762885883976e-35, /* logil[11] */ } , { 9.55224037170410156250000000000000000000000000000000e-01, /* r[12] */ 4.58093721185345026380986155345453880727291107177734e-02, /* logih[12] */ 1.90149189679431067655792024548961427427986403667162e-18, /* logim[12] */ -1.35330568979098264467186032289860101304045776545335e-34, /* logil[12] */ } , { 9.51672554016113281250000000000000000000000000000000e-01, /* r[13] */ 4.95342592225851141574111125009949319064617156982422e-02, /* logih[13] */ 3.41051514612607272315747347640360336610752192297493e-18, /* logim[13] */ -1.62776077654054345674690342025587161986806134248965e-34, /* logil[13] */ } , { 9.48147773742675781250000000000000000000000000000000e-01, /* r[14] */ 5.32449093996618869062409373782429611310362815856934e-02, /* logih[14] */ -1.64505111621921275224226259698905780842959106366420e-18, /* logim[14] */ 4.14442397515940112138679619536747848472625603933844e-35, /* logil[14] */ } , { 9.44649696350097656250000000000000000000000000000000e-01, /* r[15] */ 5.69411119045622124423822185690369224175810813903809e-02, /* logih[15] */ 4.78734188028619786114736923282640611331114908534069e-19, /* logim[15] */ -3.93713999997785260153004737038398583853656485310521e-35, /* logil[15] */ } , { 9.41176414489746093750000000000000000000000000000000e-01, /* r[16] */ 6.06246814210813916856679384181916248053312301635742e-02, /* logih[16] */ 2.64247317995478646334926909653435556549332769494295e-18, /* logim[16] */ 1.55075207452234839722600788456166299408429635417895e-34, /* logil[16] */ } , { 9.37728881835937500000000000000000000000000000000000e-01, /* r[17] */ 6.42944103100438063558286216903070453554391860961914e-02, /* logih[17] */ 2.60793481490786257498313263319157616690600921511114e-18, /* logim[17] */ -1.45909124358216952997721245377778825212735363222186e-34, /* logil[17] */ } , { 9.34306144714355468750000000000000000000000000000000e-01, /* r[18] */ 6.79511163940274415251607820209756027907133102416992e-02, /* logih[18] */ -1.24892173295840496632514736205386405076267738428183e-18, /* logim[18] */ -5.86027190792146940250174345622545434589551590207709e-35, /* logil[18] */ } , { 9.30909156799316406250000000000000000000000000000000e-01, /* r[19] */ 7.15935824064956455314856498262088280171155929565430e-02, /* logih[19] */ 6.55833354527865440910555403220649032260269042308564e-18, /* logim[19] */ -8.65001743565124847036366836203555319976499748416219e-35, /* logil[19] */ } , { 9.27536010742187500000000000000000000000000000000000e-01, /* r[20] */ 7.52236596561950549011399402843380812555551528930664e-02, /* logih[20] */ -5.92608668643342447178482655547063763942218784624419e-18, /* logim[20] */ 3.06299284565641653395923152025230697760630110042913e-34, /* logil[20] */ } , { 9.24187660217285156250000000000000000000000000000000e-01, /* r[21] */ 7.88401324882942039495858921327453572303056716918945e-02, /* logih[21] */ -3.70086061559488005172131811140468915784794102784056e-18, /* logim[21] */ -9.85152871853396304228341002410386896660946235409677e-36, /* logil[21] */ } , { 9.20863151550292968750000000000000000000000000000000e-01, /* r[22] */ 8.24438405744429975152698375495674554258584976196289e-02, /* logih[22] */ 5.70211515844839148682574255471016004503183577701328e-18, /* logim[22] */ -2.25007518842967334560085413287805841472581599706844e-34, /* logil[22] */ } , { 9.17562484741210937500000000000000000000000000000000e-01, /* r[23] */ 8.60345981121580505313062303685001097619533538818359e-02, /* logih[23] */ -4.22948398727754542981422162560881574021096207871627e-18, /* logim[23] */ 6.94601543497627089738149551411013780692459600238783e-35, /* logil[23] */ } , { 9.14285659790039062500000000000000000000000000000000e-01, /* r[24] */ 8.96122182943336897942288032936630770564079284667969e-02, /* logih[24] */ -5.42674234758262048883730612286095846547194397615989e-18, /* logim[24] */ -7.94903110897686868047461590865098481976776339992810e-35, /* logil[24] */ } , { 9.11031723022460937500000000000000000000000000000000e-01, /* r[25] */ 9.31775601303663630892160085750219877809286117553711e-02, /* logih[25] */ -6.69498457328524671915466867735988222404310795846756e-18, /* logim[25] */ -3.79652072557870206332532254269355336020140715029263e-34, /* logil[25] */ } , { 9.07801628112792968750000000000000000000000000000000e-01, /* r[26] */ 9.67293954905792813248055495023436378687620162963867e-02, /* logih[26] */ -5.63846837522303146603627132880140909669766724948486e-19, /* logim[26] */ -1.66000291590412401400936599792255612972352892524385e-35, /* logil[26] */ } , { 9.04593467712402343750000000000000000000000000000000e-01, /* r[27] */ 1.00269643153498413945534650792978936806321144104004e-01, /* logih[27] */ 4.98554274018507013478029967753506544988890129859642e-18, /* logim[27] */ 5.59670179615967929691409415615538777735120155881527e-35, /* logil[27] */ } , { 9.01408195495605468750000000000000000000000000000000e-01, /* r[28] */ 1.03797076803746321504995364648493705317378044128418e-01, /* logih[28] */ 5.48528900130158927281223188042337652391677694528930e-18, /* logim[28] */ 4.14171393686520487202261794304840175447148562557926e-37, /* logil[28] */ } , { 8.98245811462402343750000000000000000000000000000000e-01, /* r[29] */ 1.07311515996984602194785907158802729099988937377930e-01, /* logih[29] */ -6.49440034445526829025678761855551439585344802732716e-18, /* logim[29] */ 2.57958632702602934657456152939453502266815184956115e-34, /* logil[29] */ } , { 8.95105361938476562500000000000000000000000000000000e-01, /* r[30] */ 1.10813844799784330663605658173764823004603385925293e-01, /* logih[30] */ 1.13646120297132443922718632465223191456150489503195e-18, /* logim[30] */ -5.28316759830006376644472821184088330546878296734027e-35, /* logil[30] */ } , { 8.91985893249511718750000000000000000000000000000000e-01, /* r[31] */ 1.14304961269881905083778406151395756751298904418945e-01, /* logih[31] */ -1.82657204548789933700890276210347276483341044028754e-18, /* logim[31] */ -1.78975695662999910835938906470926846720934095410310e-34, /* logil[31] */ } , { 8.88889312744140625000000000000000000000000000000000e-01, /* r[32] */ 1.17782558819338939448684300259628798812627792358398e-01, /* logih[32] */ -1.23330863425085901895045843903611194329827297821512e-18, /* logim[32] */ -3.52820989557939438405682761152717048907334161666144e-35, /* logil[32] */ } , { 8.85812759399414062500000000000000000000000000000000e-01, /* r[33] */ 1.21249683217221515540984455583384260535240173339844e-01, /* logih[33] */ 5.31311945158451973155842240649445065131843549390499e-18, /* logim[33] */ 2.54343506313921505744140357189546013839546072665324e-34, /* logil[33] */ } , { 8.82759094238281250000000000000000000000000000000000e-01, /* r[34] */ 1.24702942059298146904033899318164912983775138854980e-01, /* logih[34] */ -4.70371819449250479521866847789744043656802774985674e-18, /* logim[34] */ 1.97104582593396093851604773181347759433213428836825e-35, /* logil[34] */ } , { 8.79725456237792968750000000000000000000000000000000e-01, /* r[35] */ 1.28145401734214903211039882080513052642345428466797e-01, /* logih[35] */ 1.14781745994570133838663940952936924060234053388495e-17, /* logim[35] */ 5.58511031530272548588108480038230630258110787014421e-34, /* logil[35] */ } , { 8.76712799072265625000000000000000000000000000000000e-01, /* r[36] */ 1.31575821347060167854081669247534591704607009887695e-01, /* logih[36] */ 1.10715436488867456364710847828940395046896276123492e-17, /* logim[36] */ -1.96739988161444008557083655799953663793248304761174e-34, /* logil[36] */ } , { 8.73720169067382812500000000000000000000000000000000e-01, /* r[37] */ 1.34995127284602528527912568279134575277566909790039e-01, /* logih[37] */ 1.13443032556618420511047729873477099334314080223232e-17, /* logim[37] */ 7.84084139347542359388184229855467642926900448087157e-35, /* logil[37] */ } , { 8.70748519897460937500000000000000000000000000000000e-01, /* r[38] */ 1.38402069539410921272803989268140867352485656738281e-01, /* logih[38] */ 4.44235871792103837022419240194760193308637586385155e-18, /* logim[38] */ -2.41881295582206144619569746427861787915591569677161e-34, /* logil[38] */ } , { 8.67796897888183593750000000000000000000000000000000e-01, /* r[39] */ 1.41797580309475756976667071285191923379898071289062e-01, /* logih[39] */ -7.24160172735387143794870117732197886365507642151672e-18, /* logim[39] */ -5.22451781240386018101218933838001385853101358775197e-34, /* logil[39] */ } , { 8.64865303039550781250000000000000000000000000000000e-01, /* r[40] */ 1.45181503205145640000850448814162518829107284545898e-01, /* logih[40] */ 8.19907012376636936299584542046629720669747968826019e-18, /* logim[40] */ -6.12684085112129298490441309408007876014850876364407e-34, /* logil[40] */ } , { 8.61952781677246093750000000000000000000000000000000e-01, /* r[41] */ 1.48554787455398934481465289536572527140378952026367e-01, /* logih[41] */ 6.78516779658958104936774808506523119026706496843219e-18, /* logim[41] */ -3.27826043728243463792408633436129695451318517711142e-34, /* logil[41] */ } , { 8.59060287475585937500000000000000000000000000000000e-01, /* r[42] */ 1.51916176136301706023346014262642711400985717773438e-01, /* logih[42] */ 6.48466714403849150058443502305577974475027830695770e-18, /* logim[42] */ -1.48928080867016213912478822372262107645375280995355e-34, /* logil[42] */ } , { 8.56186866760253906250000000000000000000000000000000e-01, /* r[43] */ 1.55266624374856387902354981633834540843963623046875e-01, /* logih[43] */ 1.18940768999581165815608386146027685954807862619905e-18, /* logim[43] */ -2.19216119241235749930116667974585541598333050913847e-35, /* logil[43] */ } , { 8.53333473205566406250000000000000000000000000000000e-01, /* r[44] */ 1.58604866263878874210746516837389208376407623291016e-01, /* logih[44] */ 1.12555359025026447024891292897564756165016667291108e-17, /* logim[44] */ 2.51566303827199528440805207088944780959353108097571e-34, /* logil[44] */ } , { 8.50498199462890625000000000000000000000000000000000e-01, /* r[45] */ 1.61932984182099809489230324288655538111925125122070e-01, /* logih[45] */ 9.77539264526997233823717660784682214608240520802842e-18, /* logim[45] */ 5.24985245146816572034425662478272808361990734810588e-34, /* logil[45] */ } , { 8.47681999206542968750000000000000000000000000000000e-01, /* r[46] */ 1.65249714456348534286078688637644518166780471801758e-01, /* logih[46] */ -1.00939900169186480779679825710639265028332267691135e-17, /* logim[46] */ 3.90825918506438654133771548917512854530368619051813e-34, /* logil[46] */ } , { 8.44884872436523437500000000000000000000000000000000e-01, /* r[47] */ 1.68554906544493537934314986159733962267637252807617e-01, /* logih[47] */ -4.88067069357233088835045523845127031889038644659894e-18, /* logim[47] */ -2.74436628602599193485144954170980402729323560852447e-34, /* logil[47] */ } , { 8.42104911804199218750000000000000000000000000000000e-01, /* r[48] */ 1.71850674159259697582058379339287057518959045410156e-01, /* logih[48] */ -5.99824278835946286993892764844703773122678476390412e-18, /* logim[48] */ 3.70682933452027240591056472269948014540566701592829e-34, /* logil[48] */ } , { 8.39344024658203125000000000000000000000000000000000e-01, /* r[49] */ 1.75134615249951913762416211284289602190256118774414e-01, /* logih[49] */ -3.58390218411179180194443037963547505253027562280581e-18, /* logim[49] */ 3.31228661881018068740534361547868152976577021044761e-34, /* logil[49] */ } , { 8.36601257324218750000000000000000000000000000000000e-01, /* r[50] */ 1.78407717077464861299418430462537799030542373657227e-01, /* logih[50] */ -1.24324832026190372515095573175819374097319572461178e-17, /* logim[50] */ -5.99222696564577786410580709003476847421843326905428e-34, /* logil[50] */ } , { 8.33876609802246093750000000000000000000000000000000e-01, /* r[51] */ 1.81669837446455789686794446424755733460187911987305e-01, /* logih[51] */ 1.01814383360123408182300498809467596332645378664897e-18, /* logim[51] */ -3.86254258528557102676238695420952114271137939703806e-35, /* logil[51] */ } , { 8.31169128417968750000000000000000000000000000000000e-01, /* r[52] */ 1.84921980866207286142710586318571586161851882934570e-01, /* logih[52] */ 3.00841482639628279758161917890436573438957544374876e-18, /* logim[52] */ -4.99319538644221397164613342913055299248197716579930e-36, /* logil[52] */ } , { 8.28478813171386718750000000000000000000000000000000e-01, /* r[53] */ 1.88164014957424269303132291497604455798864364624023e-01, /* logih[53] */ 2.44293806976014644991303628324646254244852750452761e-18, /* logim[53] */ -1.81631690797919082130114101842168376499919500191654e-34, /* logil[53] */ } , { 8.25806617736816406250000000000000000000000000000000e-01, /* r[54] */ 1.91394651833973583610060131832142360508441925048828e-01, /* logih[54] */ -1.21322104713829577894210219067304263334028383887345e-17, /* logim[54] */ 5.04102454790153462302483289986561437522938374164401e-34, /* logil[54] */ } , { 8.23151588439941406250000000000000000000000000000000e-01, /* r[55] */ 1.94614905180994807176730887476878706365823745727539e-01, /* logih[55] */ -2.40704484907151006187800247197019539577410611794596e-18, /* logim[55] */ 1.66766736549683531224402325253460134456943558772782e-34, /* logil[55] */ } , { 8.20512771606445312500000000000000000000000000000000e-01, /* r[56] */ 1.97825802934566419288842098467284813523292541503906e-01, /* logih[56] */ 1.28212649590622342007825921152819823725126964367518e-17, /* logim[56] */ 4.34712978477783827374998481132430084872238812357849e-34, /* logil[56] */ } , { 8.17891120910644531250000000000000000000000000000000e-01, /* r[57] */ 2.01026055259733327229554333825944922864437103271484e-01, /* logih[57] */ -1.14998212245338630994656980851947792972358234996197e-17, /* logim[57] */ 5.79624076358083101943179592654253175121330546055049e-34, /* logil[57] */ } , { 8.15286636352539062500000000000000000000000000000000e-01, /* r[58] */ 2.04215526527529805944638496839615982025861740112305e-01, /* logih[58] */ 2.73382699896480606605004885268461286375739934002155e-18, /* logim[58] */ 1.88415596219599490517606146615135776386751947516623e-34, /* logil[58] */ } , { 8.12698364257812500000000000000000000000000000000000e-01, /* r[59] */ 2.07395253950717145530191487523552495986223220825195e-01, /* logih[59] */ -6.62391092234198860395870331818350936803399446817708e-18, /* logim[59] */ 3.21769751525760188204600268636020811532764524000701e-34, /* logil[59] */ } , { 8.10126304626464843750000000000000000000000000000000e-01, /* r[60] */ 2.10565111834115831213054548243235331028699874877930e-01, /* logih[60] */ -4.23598623593001075035023138647901308953697217452223e-18, /* logim[60] */ -1.60116079297919794843846440200207561215761229589523e-34, /* logil[60] */ } , { 8.07571411132812500000000000000000000000000000000000e-01, /* r[61] */ 2.13723792956059033265603375184582546353340148925781e-01, /* logih[61] */ 1.19332110118934137902010996837627215742078591974979e-17, /* logim[61] */ -7.02796906150255788492393691981023760796809185404715e-34, /* logil[61] */ } , { 8.05031776428222656250000000000000000000000000000000e-01, /* r[62] */ 2.16873528518765484873753734973433893173933029174805e-01, /* logih[62] */ 4.52808917121474736889640990984402645764765520737700e-18, /* logim[62] */ 2.11628056886638280859096959251776961524147228058240e-34, /* logil[62] */ } , { 8.02507400512695312500000000000000000000000000000000e-01, /* r[63] */ 2.20014202197813590888841872583725489675998687744141e-01, /* logih[63] */ -1.00259431805058570834488582628193862678340769016279e-17, /* logim[63] */ 2.36589934049562797440015684747135353020590849639512e-35, /* logil[63] */ } , { 8.00000190734863281250000000000000000000000000000000e-01, /* r[64] */ 2.23143312895659085004496091642067767679691314697266e-01, /* logih[64] */ -9.09578810556902738974378981655445966403155329846157e-18, /* logim[64] */ -5.51860343858009857142907585246296630664802326325794e-34, /* logil[64] */ } , { 7.97508239746093750000000000000000000000000000000000e-01, /* r[65] */ 2.26263112406488331451726025989046320319175720214844e-01, /* logih[65] */ 7.84336071516770930915783866759877344054363308944707e-18, /* logim[65] */ -7.43454080890818906474334427543025223771612621973504e-34, /* logil[65] */ } , { 7.95030593872070312500000000000000000000000000000000e-01, /* r[66] */ 2.29374682210301245044448137377912644296884536743164e-01, /* logih[66] */ 9.99309522150144532067602885659542180850459285940861e-18, /* logim[66] */ -4.39495185580213541392726686857289780092191688844937e-34, /* logil[66] */ } , { 7.92570114135742187500000000000000000000000000000000e-01, /* r[67] */ 2.32474305048552654096027936247992329299449920654297e-01, /* logih[67] */ 1.04347973999915730650942527525177991072062294027967e-17, /* logim[67] */ -1.80285268643432323262428865765338414917111027539735e-34, /* logil[67] */ } , { 7.90122985839843750000000000000000000000000000000000e-01, /* r[68] */ 2.35566667359392301062115393506246618926525115966797e-01, /* logih[68] */ -2.32375103902642573879242169796960376755737712824341e-18, /* logim[68] */ -7.21655842491838760103086913983188439028934238517299e-35, /* logil[68] */ } , { 7.87692070007324218750000000000000000000000000000000e-01, /* r[69] */ 2.38648039598734706956406625977251678705215454101562e-01, /* logih[69] */ 4.46784339552128548812794219055404768324811281554067e-18, /* logim[69] */ 3.43429150836221389256015518963937864776602443392546e-34, /* logil[69] */ } , { 7.85276412963867187500000000000000000000000000000000e-01, /* r[70] */ 2.41719504753563907417657219411921687424182891845703e-01, /* logih[70] */ 8.87409122027180881908249517818731600449617581699438e-18, /* logim[70] */ 3.56004039882748459631384958577457237860217830111311e-34, /* logil[70] */ } , { 7.82875061035156250000000000000000000000000000000000e-01, /* r[71] */ 2.44782160173725865659477562985557597130537033081055e-01, /* logih[71] */ 7.08526813357121959967478591264305016478056070347997e-19, /* logim[71] */ -2.15778795199788554090353514030659386443684641384067e-35, /* logil[71] */ } , { 7.80488014221191406250000000000000000000000000000000e-01, /* r[72] */ 2.47835895683715751180997699520958121865987777709961e-01, /* logih[72] */ -1.24386417338518064252295447791954905943026800534449e-17, /* logim[72] */ -7.44029524146381752722089691180123292021312364800709e-34, /* logil[72] */ } , { 7.78115272521972656250000000000000000000000000000000e-01, /* r[73] */ 2.50880600583786306234657104141660965979099273681641e-01, /* logih[73] */ -5.50964893191169223547312201897322976952633356221949e-18, /* logim[73] */ 1.08676143776419160887508248412493151436373152102143e-34, /* logil[73] */ } , { 7.75757789611816406250000000000000000000000000000000e-01, /* r[74] */ 2.53914934309519335631222247684490866959095001220703e-01, /* logih[74] */ 1.97004950260539049796252522941686709480407437591843e-17, /* logim[74] */ -4.67670757123999808225422970015919189294430827275674e-34, /* logil[74] */ } , { 7.73413658142089843750000000000000000000000000000000e-01, /* r[75] */ 2.56941240096642986578956424636999145150184631347656e-01, /* logih[75] */ 1.32566282149745092578207739537715284043427717085946e-17, /* logim[75] */ 4.53175814618419018222032309863239909606680701492128e-34, /* logil[75] */ } , { 7.71084785461425781250000000000000000000000000000000e-01, /* r[76] */ 2.59956943291808351137461841062759049236774444580078e-01, /* logih[76] */ 2.06326460492966557658914107366598455972739008175724e-17, /* logim[76] */ -7.60856026131926782522027611178961885575241901312259e-34, /* logil[76] */ } , { 7.68768310546875000000000000000000000000000000000000e-01, /* r[77] */ 2.62965641547506734365668989994446747004985809326172e-01, /* logih[77] */ 7.11583631875541699557981308503843876478401404595290e-18, /* logim[77] */ -3.16162183522749672668805346311289437550800994700732e-34, /* logil[77] */ } , { 7.66467094421386718750000000000000000000000000000000e-01, /* r[78] */ 2.65963511244235673025571031757863238453865051269531e-01, /* logih[78] */ -2.24162125724264292804912034054420308588570407662844e-17, /* logim[78] */ 4.90471140265143981765909599584287898945638617268867e-34, /* logil[78] */ } , { 7.64179229736328125000000000000000000000000000000000e-01, /* r[79] */ 2.68952923432744239740088687540264800190925598144531e-01, /* logih[79] */ 2.05657969150984247532516778784947182213125204986197e-17, /* logim[79] */ 8.79232077986017876500084195761038723390008355613575e-34, /* logil[79] */ } , { 7.61904716491699218750000000000000000000000000000000e-01, /* r[80] */ 2.71933775088288309795814257086021825671195983886719e-01, /* logih[80] */ 7.83390223779535346513505580003968001040971161798700e-19, /* logim[80] */ -3.02585215101390470982866376614279464778757620082138e-35, /* logil[80] */ } , { 7.59643554687500000000000000000000000000000000000000e-01, /* r[81] */ 2.74905962710071116728016704655601643025875091552734e-01, /* logih[81] */ 2.24378545796980422658699919057279901542517325778057e-17, /* logim[81] */ -3.78062443833687207202366076315857540989955154523774e-34, /* logil[81] */ } , { 7.57396697998046875000000000000000000000000000000000e-01, /* r[82] */ 2.77868123177963777248322685409220866858959197998047e-01, /* logih[82] */ -9.27762050905122039629311187603838349834122732550062e-19, /* logim[82] */ 9.57930007453583023320781825922648925161484087998588e-35, /* logil[82] */ } , { 7.55162239074707031250000000000000000000000000000000e-01, /* r[83] */ 2.80822666626178107929234784023719839751720428466797e-01, /* logih[83] */ -1.78889070415104263420345604636729594822616937899043e-17, /* logim[83] */ -8.11660316854587609717942096562096327563941648142083e-34, /* logil[83] */ } , { 7.52941131591796875000000000000000000000000000000000e-01, /* r[84] */ 2.83768232735291170421021433867281302809715270996094e-01, /* logih[84] */ -2.03265852251844689554711830689719609838328388091381e-17, /* logim[84] */ 3.99265876662456660849597520210659365811534845502505e-34, /* logil[84] */ } , { 7.50733375549316406250000000000000000000000000000000e-01, /* r[85] */ 2.86704716154329075639140000930638052523136138916016e-01, /* logih[85] */ 3.24928817686474637809609763405716794874549598154899e-18, /* logim[85] */ 7.05436161547905729808903355104769078626665732260995e-35, /* logil[85] */ } , { 7.48538017272949218750000000000000000000000000000000e-01, /* r[86] */ 2.89633285132462114930262941925320774316787719726562e-01, /* logih[86] */ -7.21962253363417273270454867455071277489833577725373e-18, /* logim[86] */ -2.16150227221931053192432009592422674631830770048369e-34, /* logil[86] */ } , { 7.46356010437011718750000000000000000000000000000000e-01, /* r[87] */ 2.92552566827507520841322730120737105607986450195312e-01, /* logih[87] */ -1.44160166726851833613115205797213493080706067439112e-17, /* logim[87] */ 1.50883511667334677559761930721175960406498771143078e-33, /* logil[87] */ } , { 7.44186401367187500000000000000000000000000000000000e-01, /* r[88] */ 2.95463736056791381745512126144603826105594635009766e-01, /* logih[88] */ -2.16822486635513901824879610162201037763987226540717e-17, /* logim[88] */ -1.40892440842074578649628629534891601913263524738738e-33, /* logil[88] */ } , { 7.42029190063476562500000000000000000000000000000000e-01, /* r[89] */ 2.98366696880353166054788971450761891901493072509766e-01, /* logih[89] */ 2.66045054346745240447394933749591251388042727860864e-17, /* logim[89] */ -3.07182222949536546434743015167904826317676758257458e-34, /* logil[89] */ } , { 7.39884376525878906250000000000000000000000000000000e-01, /* r[90] */ 3.01261352929903802877475982313626445829868316650391e-01, /* logih[90] */ 1.87070681938931680167624656750430985298856099421569e-17, /* logim[90] */ 1.51413799416501325421897094776870076323182009328971e-33, /* logil[90] */ } , { 7.37751960754394531250000000000000000000000000000000e-01, /* r[91] */ 3.04147607413525478126103962495108135044574737548828e-01, /* logih[91] */ 3.98176030022005428666814320744852118370551740170454e-18, /* logim[91] */ 3.59055661804361869634622461801260435821255127014094e-34, /* logil[91] */ } , { 7.35631942749023437500000000000000000000000000000000e-01, /* r[92] */ 3.07025363120511873837870098213898018002510070800781e-01, /* logih[92] */ -1.23081724383312479171164681702153119269476305242331e-17, /* logim[92] */ -6.24921351181214466368980458020870680109978000216335e-34, /* logil[92] */ } , { 7.33524322509765625000000000000000000000000000000000e-01, /* r[93] */ 3.09894522426349294796921185479732230305671691894531e-01, /* logih[93] */ -2.61915759435025688106872344425103515717035435880289e-17, /* logim[93] */ 4.37310119650947955282720454157502418725525261502025e-34, /* logil[93] */ } , { 7.31428146362304687500000000000000000000000000000000e-01, /* r[94] */ 3.12756291149352327884969326987629756331443786621094e-01, /* logih[94] */ -1.44526601334660927537554677783431908198308471431891e-17, /* logim[94] */ -3.16489425801456252779886240767137743149201554486977e-34, /* logil[94] */ } , { 7.29344367980957031250000000000000000000000000000000e-01, /* r[95] */ 3.15609274450035781622858621631166897714138031005859e-01, /* logih[95] */ -9.15211307104414041770693082901206817295591874336170e-18, /* logim[95] */ 6.92571319717017620584068946677928779786499453239802e-34, /* logil[95] */ } , { 7.27272987365722656250000000000000000000000000000000e-01, /* r[96] */ 3.18453373490729885197936255281092599034309387207031e-01, /* logih[96] */ 2.70995327783651104083044967572356846238550856314185e-17, /* logim[96] */ 1.34600088520445299315193549306530996100489980654781e-33, /* logil[96] */ } , { 7.25212097167968750000000000000000000000000000000000e-01, /* r[97] */ 3.21291119093343235935122947921627201139926910400391e-01, /* logih[97] */ -1.12319519421036650171892375714176815116984091579206e-17, /* logim[97] */ 1.04447652287031956508644916042846488744189014580391e-34, /* logil[97] */ } , { 7.23163604736328125000000000000000000000000000000000e-01, /* r[98] */ 3.24119796479811983491714499905356205999851226806641e-01, /* logih[98] */ -7.94647062012309773892598593677083791992627350537440e-18, /* logim[98] */ 4.59384159170382657706167409359736689725722940359763e-34, /* logil[98] */ } , { 7.21126556396484375000000000000000000000000000000000e-01, /* r[99] */ 3.26940628117956100240348860097583383321762084960938e-01, /* logih[99] */ -1.74837694038376657608222314076357694142138010418063e-17, /* logim[99] */ -1.40581148273538852383687808274899460858762058571376e-34, /* logil[99] */ } , { 7.19100952148437500000000000000000000000000000000000e-01, /* r[100] */ 3.29753524791075502964332599731278605759143829345703e-01, /* logih[100] */ 2.12653812605676265381615743640534834022512048496019e-18, /* logim[100] */ 5.25095014117827902230536920855568345417341287940175e-35, /* logil[100] */ } , { 7.17086791992187500000000000000000000000000000000000e-01, /* r[101] */ 3.32558396904723163611805603068205527961254119873047e-01, /* logih[101] */ -1.04519949901622285684034183132329427334699936682984e-17, /* logim[101] */ 4.45654546722256244026954176794662799321355430560371e-34, /* logil[101] */ } , { 7.15084075927734375000000000000000000000000000000000e-01, /* r[102] */ 3.35355154491021822948937369801569730043411254882812e-01, /* logih[102] */ 1.83262596742990833823701524552706571217123614816200e-17, /* logim[102] */ -1.29569615760463452723681409704842983753419687255982e-33, /* logil[102] */ } , { 7.13091850280761718750000000000000000000000000000000e-01, /* r[103] */ 3.38145044591559529312263521205750294029712677001953e-01, /* logih[103] */ -1.46763527756214729603846930349999949900828274067634e-17, /* logim[103] */ 3.85996984621058858499977696727737728999708408076829e-34, /* logil[103] */ } , { 7.11111068725585937500000000000000000000000000000000e-01, /* r[104] */ 3.40926646575239744585417156486073508858680725097656e-01, /* logih[104] */ 1.74672070296268393919501631375949801326271042364782e-17, /* logim[104] */ 1.28757784323920807504216254145051967795248381758825e-33, /* logil[104] */ } , { 7.09141731262207031250000000000000000000000000000000e-01, /* r[105] */ 3.43699869378304490030728857163921929895877838134766e-01, /* logih[105] */ -5.19524092664710997838651465181771916951448804942375e-18, /* logim[105] */ 2.01852276300632912138205204757451068299686003381730e-34, /* logil[105] */ } , { 1.41436386108398437500000000000000000000000000000000e+00, /* r[106] */ -3.46679861870620553698785215601674281060695648193359e-01, /* logih[106] */ -1.28487666876426526117753107153366705047319625953434e-17, /* logim[106] */ 1.35559275452957780052106182147355087625385646501787e-37, /* logil[106] */ } , { 1.41046905517578125000000000000000000000000000000000e+00, /* r[107] */ -3.43922312315162792550893300358438864350318908691406e-01, /* logih[107] */ 4.92019729190951095471164720202037831908390366509329e-18, /* logim[107] */ 3.82551714632527355673617639808721263761194697351796e-34, /* logil[107] */ } , { 1.40659332275390625000000000000000000000000000000000e+00, /* r[108] */ -3.41170697798120592381110327551141381263732910156250e-01, /* logih[108] */ 1.93668606486849623510457675345565515553170548397263e-17, /* logim[108] */ -6.31924577586791945681481090971933602378723267089765e-34, /* logil[108] */ } , { 1.40274047851562500000000000000000000000000000000000e+00, /* r[109] */ -3.38427807898675381270692241741926409304141998291016e-01, /* logih[109] */ 6.54538052872786451417312049621269831217791334849587e-18, /* logim[109] */ -1.38134173915396180632358800838166951094785757798298e-34, /* logil[109] */ } , { 1.39890670776367187500000000000000000000000000000000e+00, /* r[110] */ -3.35691008516038780218337933547445572912693023681641e-01, /* logih[110] */ 7.19133786441628176722646778964275817014488601387322e-18, /* logim[110] */ 2.28260205775013127550656696784879220819429866829588e-36, /* logil[110] */ } , { 1.39509582519531250000000000000000000000000000000000e+00, /* r[111] */ -3.32963104810430066127224790761829353868961334228516e-01, /* logih[111] */ 2.31257782383773679965596591934497042170211009414751e-17, /* logim[111] */ -8.99899918826696456699888760884182179403739540341569e-34, /* logil[111] */ } , { 1.39130401611328125000000000000000000000000000000000e+00, /* r[112] */ -3.30241448451969343835799008957110345363616943359375e-01, /* logih[112] */ 1.08328391473436749190918194684471671377932692613855e-17, /* logim[112] */ 2.05469820214513767177005852735365876929387324182847e-34, /* logil[112] */ } , { 1.38753318786621093750000000000000000000000000000000e+00, /* r[113] */ -3.27527485535248186199197562018525786697864532470703e-01, /* logih[113] */ 2.56707416856969394221064681139222300535027158809986e-17, /* logim[113] */ 2.48018075170015936943477306695127673525907564478115e-34, /* logil[113] */ } , { 1.38378334045410156250000000000000000000000000000000e+00, /* r[114] */ -3.24821299026220644545759341781376861035823822021484e-01, /* logih[114] */ -2.40283588419711964440744928607170649222918319264531e-17, /* logim[114] */ 1.40448044142609986920740213180800276002578003774456e-33, /* logil[114] */ } , { 1.38005447387695312500000000000000000000000000000000e+00, /* r[115] */ -3.22122972213921499040623075416078791022300720214844e-01, /* logih[115] */ -1.66818907547914379914312063731519121720479863896485e-17, /* logim[115] */ -8.55009499177937534961617974327717063975398325813083e-34, /* logil[115] */ } , { 1.37634468078613281250000000000000000000000000000000e+00, /* r[116] */ -3.19431202899942479067618705812492407858371734619141e-01, /* logih[116] */ -1.38115565915964367886690142912485000070964727867745e-18, /* logim[116] */ -1.22984664179014233019202567735778158211873499167925e-35, /* logil[116] */ } , { 1.37265396118164062500000000000000000000000000000000e+00, /* r[117] */ -3.16746063834650870560949442733544856309890747070312e-01, /* logih[117] */ -1.15419278228466239427477637425076471306644591952148e-17, /* logim[117] */ 3.41592451858080777739018945315482424309486529068749e-34, /* logil[117] */ } , { 1.36898422241210937500000000000000000000000000000000e+00, /* r[118] */ -3.14069021340052600965719875603099353611469268798828e-01, /* logih[118] */ -7.31349707246752102101544908905981332227259572261770e-18, /* logim[118] */ -3.93910979025310412654744290737242169075928226381889e-34, /* logil[118] */ } , { 1.36533355712890625000000000000000000000000000000000e+00, /* r[119] */ -3.11398762981856647158451778523158282041549682617188e-01, /* logih[119] */ -2.10262028332851499303996266991953733885100475347425e-17, /* logim[119] */ 3.10172118073247334983412381313166324533523917848591e-34, /* logil[119] */ } , { 1.36170196533203125000000000000000000000000000000000e+00, /* r[120] */ -3.08735362440316629673020543123129755258560180664062e-01, /* logih[120] */ 1.61997507738300932313233656106715605269821143050038e-17, /* logim[120] */ -4.94737397643073988821957091336118905427415985059196e-34, /* logil[120] */ } , { 1.35808944702148437500000000000000000000000000000000e+00, /* r[121] */ -3.06078893698965515124399416890810243785381317138672e-01, /* logih[121] */ -2.14383901488893084851347644248966504652364110743417e-17, /* logim[121] */ -1.04285659471621119336484757092986113762774232464117e-34, /* logil[121] */ } , { 1.35449790954589843750000000000000000000000000000000e+00, /* r[122] */ -3.03430839201768942636761039466364309191703796386719e-01, /* logih[122] */ -2.36272540975444581798067226838922324791286981755800e-17, /* logim[122] */ 7.63193414263891924102062717951976678650366075861562e-34, /* logil[122] */ } , { 1.35092353820800781250000000000000000000000000000000e+00, /* r[123] */ -3.00788460935273893603891792736249044537544250488281e-01, /* logih[123] */ 1.31911240315125569456750230823426654574574756805059e-17, /* logim[123] */ 6.09798153293836260383095031169419558002984888039367e-34, /* logil[123] */ } , { 1.34736824035644531250000000000000000000000000000000e+00, /* r[124] */ -2.98153238208616611082391045783879235386848449707031e-01, /* logih[124] */ 1.72077626940949324831538094445960560173054776887669e-17, /* logim[124] */ 1.50419727472329867273356373006418522570851500586450e-33, /* logil[124] */ } , { 1.34383201599121093750000000000000000000000000000000e+00, /* r[125] */ -2.95525246187516521523264145798748359084129333496094e-01, /* logih[125] */ 6.61166908095413536634982853435304018965741335429843e-18, /* logim[125] */ -1.66439777489787908751728074566359602553422366675323e-34, /* logil[125] */ } , { 1.34031486511230468750000000000000000000000000000000e+00, /* r[126] */ -2.92904560325168261680772729960153810679912567138672e-01, /* logih[126] */ -6.83776292620451776752481870270640194860145197512462e-18, /* logim[126] */ 1.55562105120034357822530615049801316732267321042243e-34, /* logil[126] */ } , { 1.33681488037109375000000000000000000000000000000000e+00, /* r[127] */ -2.90289829573938562568002907937625423073768615722656e-01, /* logih[127] */ 1.05531301797230420241902730814804872346105655886287e-17, /* logim[127] */ 4.79041533288401481752223531420283794797478252934091e-34, /* logil[127] */ } , { 1.33333396911621093750000000000000000000000000000000e+00, /* r[128] */ -2.87682549288825417654891225538449361920356750488281e-01, /* logih[128] */ -2.61077462239171302791459888459712394960284043875709e-17, /* logim[128] */ 2.49074425570525367279357114033805399391008799131216e-34, /* logil[128] */ } , { 1.32987022399902343750000000000000000000000000000000e+00, /* r[129] */ -2.85081361532236732259093514585401862859725952148438e-01, /* logih[129] */ 5.43627399844908067645917310959280553768099267155506e-18, /* logim[129] */ -1.40940968647840734289903124482303996508342832614184e-34, /* logil[129] */ } , { 1.32642555236816406250000000000000000000000000000000e+00, /* r[130] */ -2.82487769664605981034810611163266003131866455078125e-01, /* logih[130] */ 1.40579607152920466183148026056253132184915242828454e-17, /* logim[130] */ 8.55245308058326661171909652892008079386885810342353e-35, /* logil[130] */ } , { 1.32299804687500000000000000000000000000000000000000e+00, /* r[131] */ -2.79900408846770476500864788249600678682327270507812e-01, /* logih[131] */ -1.83143097611448426823122105710887862843742634907885e-17, /* logim[131] */ 7.32680743617844937675707357797053020869120027100328e-34, /* logil[131] */ } , { 1.31958770751953125000000000000000000000000000000000e+00, /* r[132] */ -2.77319345020877350282972884087939746677875518798828e-01, /* logih[132] */ 7.44521346975934828880026635948320543669274837358637e-18, /* logim[132] */ -5.41922476182319969711469733445405189836277342215443e-34, /* logil[132] */ } , { 1.31619453430175781250000000000000000000000000000000e+00, /* r[133] */ -2.74744644396217541082449997702497057616710662841797e-01, /* logih[133] */ -1.35539016985663678510001485327198622349128587937948e-17, /* logim[133] */ -2.47605212552478755864671758320404239244847510600429e-34, /* logil[133] */ } , { 1.31282043457031250000000000000000000000000000000000e+00, /* r[134] */ -2.72177826311169102080356196893262676894664764404297e-01, /* logih[134] */ -1.94604737767255604321061638736698666324990178271015e-17, /* logim[134] */ 4.93318792723831633917605655356651628446409622108869e-34, /* logil[134] */ } , { 1.30946350097656250000000000000000000000000000000000e+00, /* r[135] */ -2.69617512088877908649209302893723361194133758544922e-01, /* logih[135] */ -4.36842068525796679795304490876810534098425489515634e-19, /* logim[135] */ -2.59640519936698818691794834943491001573704557192093e-35, /* logil[135] */ } , { 1.30612182617187500000000000000000000000000000000000e+00, /* r[136] */ -2.67062308411773363658880953153129667043685913085938e-01, /* logih[136] */ 7.36505541266105414954508218919326623562242166589177e-18, /* logim[136] */ 4.30859840846165501987206211849479522591226050316009e-34, /* logil[136] */ } , { 1.30279922485351562500000000000000000000000000000000e+00, /* r[137] */ -2.64515199434744108231143400189466774463653564453125e-01, /* logih[137] */ -1.68423739176487233694295158507739753610875825604997e-17, /* logim[137] */ -2.52387133235317228793067248082680461143877917377527e-34, /* logil[137] */ } , { 1.29949188232421875000000000000000000000000000000000e+00, /* r[138] */ -2.61973328311307873672575396994943730533123016357422e-01, /* logih[138] */ -3.75057237736452977469227410853090805509462799202680e-18, /* logim[138] */ -2.50001621249400187276643559364982462572917581991553e-34, /* logil[138] */ } , { 1.29620170593261718750000000000000000000000000000000e+00, /* r[139] */ -2.59438223113541976960760848669451661407947540283203e-01, /* logih[139] */ -1.75050620652398740735421575793594666738296743072718e-18, /* logim[139] */ -1.76879556289338598533013427354560697647411264656770e-34, /* logil[139] */ } , { 1.29292869567871093750000000000000000000000000000000e+00, /* r[140] */ -2.56909951848923512329747609328478574752807617187500e-01, /* logih[140] */ -2.49955762333036735703890989320152300242733956262258e-17, /* logim[140] */ 6.46984311731974220303858069024859972656679564537485e-34, /* logil[140] */ } , { 1.28967285156250000000000000000000000000000000000000e+00, /* r[141] */ -2.54388582770868065807690072688274085521697998046875e-01, /* logih[141] */ 1.42784459055047481334238305742929320333571952363668e-17, /* logim[141] */ 1.44560161052022205741731365640574141772476641472904e-33, /* logil[141] */ } , { 1.28643226623535156250000000000000000000000000000000e+00, /* r[142] */ -2.51872701711453261808060233306605368852615356445312e-01, /* logih[142] */ -2.58573188266130078596915247890597291360969537163785e-17, /* logim[142] */ 3.36064630885731507350249551263037246653963144676932e-34, /* logil[142] */ } , { 1.28320884704589843750000000000000000000000000000000e+00, /* r[143] */ -2.49363852624658294265813651691132690757513046264648e-01, /* logih[143] */ 6.17564000922762053278709883095158100872225794241962e-18, /* logim[143] */ -3.59696250405991778286139521640842821567504780771091e-34, /* logil[143] */ } , { 1.28000068664550781250000000000000000000000000000000e+00, /* r[144] */ -2.46860614373184877878841803067189175635576248168945e-01, /* logih[144] */ -1.36688909483265210237069537981338704526084198528804e-17, /* logim[144] */ -4.92999816324333714793093560012211883282871708512667e-34, /* logil[144] */ } , { 1.27680778503417968750000000000000000000000000000000e+00, /* r[145] */ -2.44363044996024708632731403668003622442483901977539e-01, /* logih[145] */ 1.09486381393098425629951474169192910961933895685875e-17, /* logim[145] */ 1.13614657049426843838447103108579796261058240882279e-34, /* logil[145] */ } , { 1.27363204956054687500000000000000000000000000000000e+00, /* r[146] */ -2.41872700333246426485089841662556864321231842041016e-01, /* logih[146] */ 3.58546134799758558220376210039678485387885916926961e-18, /* logim[146] */ -2.20085959592144414214775971267831972426029128230714e-34, /* logil[146] */ } , { 1.27047157287597656250000000000000000000000000000000e+00, /* r[147] */ -2.39388148774497988569009976345114409923553466796875e-01, /* logih[147] */ -8.15278529428586557427891691038658199587387144643622e-18, /* logim[147] */ -4.48801512822497796294159745847501737318770920712608e-34, /* logil[147] */ } , { 1.26732635498046875000000000000000000000000000000000e+00, /* r[148] */ -2.36909449055089427194076279192813672125339508056641e-01, /* logih[148] */ -1.95941703600043116666763494344574061919652321991003e-18, /* logim[148] */ -7.12890529228103914163560488030577203415481759502335e-36, /* logil[148] */ } , { 1.26419830322265625000000000000000000000000000000000e+00, /* r[149] */ -2.34438168880390956916315303715236950665712356567383e-01, /* logih[149] */ -6.99651372151112997059366610960978925151468620541361e-18, /* logim[149] */ 2.72198075748279584311862548086147097324308430232999e-34, /* logil[149] */ } , { 1.26108360290527343750000000000000000000000000000000e+00, /* r[150] */ -2.31971353679059938412976293875544797629117965698242e-01, /* logih[150] */ -5.77385522134567574535417063256881508583112235194305e-18, /* logim[150] */ 3.79366854190657220850283401392416116381504642214271e-34, /* logil[150] */ } , { 1.25798606872558593750000000000000000000000000000000e+00, /* r[151] */ -2.29512084071926747430580917352926917374134063720703e-01, /* logih[151] */ -8.73917888836756753861059666333090512067547544675485e-18, /* logim[151] */ -5.69482104001851921922283043288492925754991621288172e-34, /* logil[151] */ } , { 1.25490188598632812500000000000000000000000000000000e+00, /* r[152] */ -2.27057391030699523559732710964453872293233871459961e-01, /* logih[152] */ -9.55134517665639461592830714479938653876650013848813e-18, /* logim[152] */ -7.00052160915705629865262646818211330004502638341784e-34, /* logil[152] */ } , { 1.25183296203613281250000000000000000000000000000000e+00, /* r[153] */ -2.24608846873032674817949327916721813380718231201172e-01, /* logih[153] */ -2.19162128124331068197096372804387663813879070153910e-18, /* logim[153] */ 8.00496321203755877183709886194177284253312594316861e-35, /* logil[153] */ } , { 1.24878120422363281250000000000000000000000000000000e+00, /* r[154] */ -2.22168039035695707994477743341121822595596313476562e-01, /* logih[154] */ 1.07342637360833029593335438601345228992436813797418e-17, /* logim[154] */ -7.67553083967135214121581596311206028889095496603001e-34, /* logil[154] */ } , { 1.24574279785156250000000000000000000000000000000000e+00, /* r[155] */ -2.19731976787238214576802874944405630230903625488281e-01, /* logih[155] */ -1.35345511944004269567659266993040497754817745842460e-17, /* logim[155] */ -7.06055747414660075242875132218211703222886262645151e-34, /* logil[155] */ } , { 1.24271774291992187500000000000000000000000000000000e+00, /* r[156] */ -2.17300709445695711119483917173056397587060928344727e-01, /* logih[156] */ -1.55632648024565809587441742115549412481509415401206e-18, /* logim[156] */ -2.73645872916697873734554009814155050548437865470935e-35, /* logil[156] */ } , { 1.23970985412597656250000000000000000000000000000000e+00, /* r[157] */ -2.14877363629256634691699900940875522792339324951172e-01, /* logih[157] */ 5.51412653363101081432833599630524903528204879298177e-18, /* logim[157] */ 1.93479402223180105608082323440368830737884048556178e-34, /* logil[157] */ } , { 1.23671531677246093750000000000000000000000000000000e+00, /* r[158] */ -2.12458926885637500170389557752059772610664367675781e-01, /* logih[158] */ 9.62416986757368333294762208707250932658825738879454e-18, /* logim[158] */ 1.34243694982089823913061491133601163572475339258708e-34, /* logil[158] */ } , { 1.23373413085937500000000000000000000000000000000000e+00, /* r[159] */ -2.10045449157502006620745760301360860466957092285156e-01, /* logih[159] */ -1.14897192287332807026526402359503839328475948011071e-17, /* logim[159] */ 3.22998731854659925401919707956820087718358954278512e-34, /* logil[159] */ } , { 1.23077011108398437500000000000000000000000000000000e+00, /* r[160] */ -2.07640080033725998864824191514344420284032821655273e-01, /* logih[160] */ -1.21752158956595077938199084785214052668704102263663e-17, /* logim[160] */ 3.85113498704488412720849922642321502513839838743598e-34, /* logil[160] */ } , { 1.22781753540039062500000000000000000000000000000000e+00, /* r[161] */ -2.05238231877337917730130811833078041672706604003906e-01, /* logih[161] */ -6.49170319816279074800980031896509389281475760737419e-18, /* logim[161] */ 7.54230794214336863035202362512077511130553782508548e-35, /* logil[161] */ } , { 1.22488021850585937500000000000000000000000000000000e+00, /* r[162] */ -2.02843058404291731733337655896320939064025878906250e-01, /* logih[162] */ -2.09733857251185914090082750810867355591642377167668e-18, /* logim[162] */ -7.58503055294887496788011335562125472007511746053015e-35, /* logil[162] */ } , { 1.22195625305175781250000000000000000000000000000000e+00, /* r[163] */ -2.00453060641940739028399320886819623410701751708984e-01, /* logih[163] */ -6.53774572382445798876000474193661396320697712784592e-18, /* logim[163] */ 3.51772439194901607097398534803672574024027259307605e-34, /* logil[163] */ } , { 1.21904754638671875000000000000000000000000000000000e+00, /* r[164] */ -1.98069854157447239328959653903439175337553024291992e-01, /* logih[164] */ -3.74277289637934596837745314540095849706853736054736e-18, /* logim[164] */ 2.20940287174632344749918330821286328950105212564345e-34, /* logil[164] */ } , { 1.21615219116210937500000000000000000000000000000000e+00, /* r[165] */ -1.95691932918147681874643240007571876049041748046875e-01, /* logih[165] */ -7.08261236288433014439133183526990067310528978959932e-18, /* logim[165] */ -1.96435463626369637687474243037286042706661477855383e-34, /* logil[165] */ } , { 1.21327018737792968750000000000000000000000000000000e+00, /* r[166] */ -1.93319348256398265695210625381150748580694198608398e-01, /* logih[166] */ -4.63045754803609100012916107813305239709411987466506e-18, /* logim[166] */ 3.81311992624323390610440652445847060246376140730432e-34, /* logil[166] */ } , { 1.21040153503417968750000000000000000000000000000000e+00, /* r[167] */ -1.90952151695252925200918525661109015345573425292969e-01, /* logih[167] */ -5.80616769316522716849138580075656569977606755839734e-18, /* logim[167] */ 1.34601476508880492535970189187338024694052031880198e-34, /* logil[167] */ } , { 1.20754623413085937500000000000000000000000000000000e+00, /* r[168] */ -1.88590394946867745407104166588396765291690826416016e-01, /* logih[168] */ 7.58724192474608110981409818070149841661745061197758e-18, /* logim[168] */ 5.09865531698430288976485112090438508546399086848170e-34, /* logil[168] */ } , { 1.20470619201660156250000000000000000000000000000000e+00, /* r[169] */ -1.86235713160088522943880207094480283558368682861328e-01, /* logih[169] */ 9.83598941678855625746040824683214800947055255023752e-18, /* logim[169] */ 2.46513729584939313689642856331884108597210035577156e-35, /* logil[169] */ } , { 1.20187759399414062500000000000000000000000000000000e+00, /* r[170] */ -1.83884995648034593740405284734151791781187057495117e-01, /* logih[170] */ -6.70852935530959296202331099325187741392981643909817e-18, /* logim[170] */ 3.00844769658087560728352059501736867279973513368500e-34, /* logil[170] */ } , { 1.19906234741210937500000000000000000000000000000000e+00, /* r[171] */ -1.81539874203132112207015325111569836735725402832031e-01, /* logih[171] */ 9.29803006036969326009349085152256934923841308327213e-18, /* logim[171] */ -5.87687279777529126455867415463448459437016045941915e-34, /* logil[171] */ } , { 1.19626235961914062500000000000000000000000000000000e+00, /* r[172] */ -1.79201995701676053407425115437945351004600524902344e-01, /* logih[172] */ 1.07244987411303504039951333305926418667267361291349e-17, /* logim[172] */ 6.96460410267841846987295265759921471979042436315030e-34, /* logil[172] */ } , { 1.19347381591796875000000000000000000000000000000000e+00, /* r[173] */ -1.76868227651996584581794991208880674093961715698242e-01, /* logih[173] */ -1.10573571536398568326433843554050954952961171968919e-17, /* logim[173] */ -7.15366049912217554019889444240641484300247544429326e-34, /* logil[173] */ } , { 1.19069862365722656250000000000000000000000000000000e+00, /* r[174] */ -1.74540213563705776111945056072727311402559280395508e-01, /* logih[174] */ 1.41441535586615290351432125355737755606926544229499e-18, /* logim[174] */ -9.09232357027904656212336285800609485022315015052927e-35, /* logil[174] */ } , { 1.18793487548828125000000000000000000000000000000000e+00, /* r[175] */ -1.72216400825300264276762618464999832212924957275391e-01, /* logih[175] */ 4.70555006507071052711499439464966393443028017169630e-18, /* logim[175] */ -2.05933939394796488034283377335053411303251320729741e-36, /* logil[175] */ } , { 1.18518447875976562500000000000000000000000000000000e+00, /* r[176] */ -1.69898440748772083797035747920745052397251129150391e-01, /* logih[176] */ 5.57386986936216704195834036089361797810285720893573e-19, /* logim[176] */ 1.95979458384118524767836145844611746655750937760436e-35, /* logil[176] */ } , { 1.18244743347167968750000000000000000000000000000000e+00, /* r[177] */ -1.67586386672116810503396777676243800669908523559570e-01, /* logih[177] */ -2.10518678245997312072852724987229988978414584927966e-18, /* logim[177] */ 1.28828497071302497365120049253927765655050473764692e-34, /* logil[177] */ } , { 1.17972373962402343750000000000000000000000000000000e+00, /* r[178] */ -1.65280292104758808058306840393925085663795471191406e-01, /* logih[178] */ 6.23517789601925714710479118600106051919949505966744e-19, /* logim[178] */ -3.18208255979837719298953172591840257465716328738635e-35, /* logil[178] */ } , { 1.17701148986816406250000000000000000000000000000000e+00, /* r[179] */ -1.62978590225533376267819107852119486778974533081055e-01, /* logih[179] */ -9.90718539912068708756719628839252162668848272704435e-18, /* logim[179] */ 2.65318297676807803018499365510556573456222990710937e-34, /* logil[179] */ } , { 1.17431259155273437500000000000000000000000000000000e+00, /* r[180] */ -1.60682947934438519199673578441434074193239212036133e-01, /* logih[180] */ 3.58966483931976449925223154468506323464461604873135e-18, /* logim[180] */ -2.61108466517449169019772324573366398622685617699208e-35, /* logil[180] */ } , { 1.17162513732910156250000000000000000000000000000000e+00, /* r[181] */ -1.58391791297011308436992749193450435996055603027344e-01, /* logih[181] */ 1.17290336952422323777350005767652445704229453391095e-17, /* logim[181] */ -2.09345211610593757799592941150206031045717866622119e-34, /* logil[181] */ } , { 1.16894912719726562500000000000000000000000000000000e+00, /* r[182] */ -1.56105163319945505762120774306822568178176879882812e-01, /* logih[182] */ 1.28628359267905556190943307276740736661339408993324e-17, /* logim[182] */ -5.95304689974676498338427563732575867009069071311929e-34, /* logil[182] */ } , { 1.16628646850585937500000000000000000000000000000000e+00, /* r[183] */ -1.53824742577648665431411245663184672594070434570312e-01, /* logih[183] */ -1.21520306098644174029034710109981732360242413879415e-18, /* logim[183] */ -3.46376210577156535712238040881332980606390914922373e-35, /* logil[183] */ } , { 1.16363716125488281250000000000000000000000000000000e+00, /* r[184] */ -1.51550583580380926473907265972229652106761932373047e-01, /* logih[184] */ -5.27431191607729841894071463956904781997884546886957e-18, /* logim[184] */ -2.12312727053942207829403955523840244683485282807904e-34, /* logil[184] */ } , { 1.16099739074707031250000000000000000000000000000000e+00, /* r[185] */ -1.49279455294684920696468566347903106361627578735352e-01, /* logih[185] */ 1.30791371646357520506414737413216453391959478831327e-17, /* logim[185] */ 7.56862790077388154224564404755685931026804721911961e-34, /* logil[185] */ } , { 1.15837097167968750000000000000000000000000000000000e+00, /* r[186] */ -1.47014683357163111754317696977523155510425567626953e-01, /* logih[186] */ 4.46701777108311388441189058844554903695616000674812e-18, /* logim[186] */ -1.53168389834566630100313932781112142055948393405761e-34, /* logil[186] */ } , { 1.15575599670410156250000000000000000000000000000000e+00, /* r[187] */ -1.44754672455130850572402323450660333037376403808594e-01, /* logih[187] */ -1.11765997308804560786725769664171557832093187263628e-17, /* logim[187] */ -2.54391351083201803872348589456916885864191215547753e-34, /* logil[187] */ } , { 1.15315246582031250000000000000000000000000000000000e+00, /* r[188] */ -1.42499466560657650493482151432544924318790435791016e-01, /* logih[188] */ 9.99697434471805963116106325782098963574947115358262e-18, /* logim[188] */ -4.16991647873877558887722645601154258382043780560798e-34, /* logil[188] */ } , { 1.15056228637695312500000000000000000000000000000000e+00, /* r[189] */ -1.40250767556271416225399661925621330738067626953125e-01, /* logih[189] */ -2.42967383902664590341317347111432842699638485445637e-18, /* logim[189] */ 1.89046895909651011241835667303830696393887263209723e-35, /* logil[189] */ } , { 1.14798164367675781250000000000000000000000000000000e+00, /* r[190] */ -1.38005307940927829379873514881182927638292312622070e-01, /* logih[190] */ 3.09897250271566693336611278140158537034235759176630e-18, /* logim[190] */ 4.18076944171954954430079149735725094064207802954500e-35, /* logil[190] */ } , { 1.14541435241699218750000000000000000000000000000000e+00, /* r[191] */ -1.35766451383654063178596516081597656011581420898438e-01, /* logih[191] */ -1.26737144704388924877419888090078242028004784977676e-17, /* logim[191] */ -6.55254988981886759240332153938275164053851414525063e-34, /* logil[191] */ } , { 1.14285659790039062500000000000000000000000000000000e+00, /* r[192] */ -1.33530915787250736848079668561695143580436706542969e-01, /* logih[192] */ 3.70059774900097017560711245248993036856587443848886e-18, /* logim[192] */ -1.44076022950175208091543146453702789322369025821334e-34, /* logil[192] */ } , { 1.14031219482421875000000000000000000000000000000000e+00, /* r[193] */ -1.31302080023902228989030049888242501765489578247070e-01, /* logih[193] */ 9.77595259647047985795328829376646744546732643730202e-18, /* logim[193] */ 7.14001485916042767804723486534578453220499721661498e-34, /* logil[193] */ } , { 1.13777732849121093750000000000000000000000000000000e+00, /* r[194] */ -1.29076647394292753912026228135800920426845550537109e-01, /* logih[194] */ 1.29614980241403171231290027930196525012258765738554e-17, /* logim[194] */ -5.85566533144206341645149580771754974185386331638589e-34, /* logil[194] */ } , { 1.13525581359863281250000000000000000000000000000000e+00, /* r[195] */ -1.26858011968173783889923811329936143010854721069336e-01, /* logih[195] */ -1.69678439390834976532815985483256409225876795508054e-18, /* logim[195] */ -2.71228529760193445477650881984529057919186509828788e-35, /* logil[195] */ } , { 1.13274383544921875000000000000000000000000000000000e+00, /* r[196] */ -1.24642862439702989396650423259416129440069198608398e-01, /* logih[196] */ 5.78470166144150337574069781581246057448668006106709e-18, /* logim[196] */ -1.51194875373975987733573028833303263737665603241701e-34, /* logil[196] */ } , { 1.13024330139160156250000000000000000000000000000000e+00, /* r[197] */ -1.22432920514188886551565360605309251695871353149414e-01, /* logih[197] */ -1.49693760153482569091449280029762521944027633466473e-18, /* logim[197] */ -5.39965434369591591869001705818915138621233644825736e-35, /* logil[197] */ } , { 1.12775421142578125000000000000000000000000000000000e+00, /* r[198] */ -1.20228231660540529901481932029128074645996093750000e-01, /* logih[198] */ 2.66388161368585650190234204294063114917602653271451e-18, /* logim[198] */ -4.74069350504018899441229048102955157835045789801575e-35, /* logil[198] */ } , { 1.12527465820312500000000000000000000000000000000000e+00, /* r[199] */ -1.18027146483910813645756832102051703259348869323730e-01, /* logih[199] */ -3.60219775645429345296067350839693560520470018134018e-18, /* logim[199] */ -2.54791949912299670752413217558541051658120178578709e-36, /* logil[199] */ } , { 1.12280654907226562500000000000000000000000000000000e+00, /* r[200] */ -1.15831398292521231541130077857815194875001907348633e-01, /* logih[200] */ -4.31427333715618757910709691609269654043220111432066e-18, /* logim[200] */ -9.92584460384660583856113744874441511647452425237725e-35, /* logil[200] */ } , { 1.12034988403320312500000000000000000000000000000000e+00, /* r[201] */ -1.13641032979606732000732449705537874251604080200195e-01, /* logih[201] */ -2.80052852737773106136039129617512559000765084602728e-18, /* logim[201] */ 1.05442382041672403942755754838681010220413395137635e-34, /* logil[201] */ } , { 1.11790466308593750000000000000000000000000000000000e+00, /* r[202] */ -1.11456096576200411329971018403739435598254203796387e-01, /* logih[202] */ -5.77990794389030241792168588642671979086900695176190e-18, /* logim[202] */ -1.69142770089478743453734869721080946466526879559136e-35, /* logil[202] */ } , { 1.11546897888183593750000000000000000000000000000000e+00, /* r[203] */ -1.09274925343603279692672458622837439179420471191406e-01, /* logih[203] */ -3.85400236141315267161376748908212877710726873076641e-18, /* logim[203] */ -2.42661397467022652703862793756433704621690971685882e-34, /* logil[203] */ } , { 1.11304283142089843750000000000000000000000000000000e+00, /* r[204] */ -1.07097554410911677269524489020113833248615264892578e-01, /* logih[204] */ 1.80247443768247945406811707831640352654515433418144e-18, /* logim[204] */ -1.85453257375612125088595374639844790140667033156959e-34, /* logil[204] */ } , { 1.11062812805175781250000000000000000000000000000000e+00, /* r[205] */ -1.04925736401603963976469913177425041794776916503906e-01, /* logih[205] */ 2.91414777009923095944264947235313742597856028896167e-18, /* logim[205] */ -3.61510340016815217927552346757607780248730263443438e-35, /* logil[205] */ } , { 1.10822486877441406250000000000000000000000000000000e+00, /* r[206] */ -1.02759517890908286252837910978996660560369491577148e-01, /* logih[206] */ 4.71099321843214355541046112004586746562119362394250e-18, /* logim[206] */ -1.09517195512805323092039219231698490527876281773580e-34, /* logil[206] */ } , { 1.10583114624023437500000000000000000000000000000000e+00, /* r[207] */ -1.00597220775924339752904757006035652011632919311523e-01, /* logih[207] */ -3.42156695637354590153605355608799216036823724345522e-18, /* logim[207] */ -1.24284989441486949568174045668508613287571207046391e-36, /* logil[207] */ } , { 1.10344886779785156250000000000000000000000000000000e+00, /* r[208] */ -9.84406092549116179535317883164680097252130508422852e-02, /* logih[208] */ 4.38755240283229348312039895902645159531255023723883e-18, /* logim[208] */ 1.60705777926564974905947594633801050091055265351041e-34, /* logil[208] */ } , { 1.10107612609863281250000000000000000000000000000000e+00, /* r[209] */ -9.62879980375207500387091386073734611272811889648438e-02, /* logih[209] */ -3.66395854119785801784314943749236711112635925431669e-18, /* logim[209] */ 1.90682128658230085463599916944170383720123953153313e-34, /* logil[209] */ } , { 1.09871292114257812500000000000000000000000000000000e+00, /* r[210] */ -9.41394230474431603639118293358478695154190063476562e-02, /* logih[210] */ -1.52427934389046025790404533372637255540123275063242e-18, /* logim[210] */ 2.38117709862259339359946293808333798071470115227448e-35, /* logil[210] */ } , { 1.09635925292968750000000000000000000000000000000000e+00, /* r[211] */ -9.19949203356747319260122708328708540648221969604492e-02, /* logih[211] */ -5.76786325743187763097260207334809269062162873149715e-18, /* logim[211] */ -1.16076884637403681975821590448659743070392522145404e-34, /* logil[211] */ } , { 1.09401702880859375000000000000000000000000000000000e+00, /* r[212] */ -8.98562695172144959565585509153606835752725601196289e-02, /* logih[212] */ 6.27446602451052736319026996501069657057280086335290e-19, /* logim[212] */ -3.52284010127094716016693656249620808330731317587528e-35, /* logil[212] */ } , { 1.09168434143066406250000000000000000000000000000000e+00, /* r[213] */ -8.77217709115478833092893751199881080538034439086914e-02, /* logih[213] */ -1.37126670070706012825933173130657669787213551002177e-18, /* logim[213] */ -1.23989072968810371061913173649528401394932986260312e-36, /* logil[213] */ } , { 1.08936119079589843750000000000000000000000000000000e+00, /* r[214] */ -8.55914609487157390654843425181752536445856094360352e-02, /* logih[214] */ -6.73539996941766729916657848715943989064126863847235e-18, /* logim[214] */ 3.21430126927804602931832802266482628675064054148856e-34, /* logil[214] */ } , { 1.08704948425292968750000000000000000000000000000000e+00, /* r[215] */ -8.34671307946482227135831521991349291056394577026367e-02, /* logih[215] */ -2.59301417543796652810804139098455715391427697882095e-18, /* logim[215] */ 1.65211492395331390788992293150317962555299571277512e-34, /* logil[215] */ } , { 1.08474540710449218750000000000000000000000000000000e+00, /* r[216] */ -8.13453116283524013674366415216354653239250183105469e-02, /* logih[216] */ -5.06533259416045510334473576398828704896081639774469e-18, /* logim[216] */ 3.58554694819254814251485471545002207143063628923407e-34, /* logil[216] */ } , { 1.08245277404785156250000000000000000000000000000000e+00, /* r[217] */ -7.92295531972000560694269211126083973795175552368164e-02, /* logih[217] */ 3.08430116625330602805431897032551509181475376762118e-18, /* logim[217] */ 1.27521745632715758795764081462338721511029897619340e-34, /* logil[217] */ } , { 1.08016967773437500000000000000000000000000000000000e+00, /* r[218] */ -7.71181378091099767324578806437784805893898010253906e-02, /* logih[218] */ -2.75912394291266277302481383554992246538214466259557e-18, /* logim[218] */ 5.96984502944699741108276688448842397927326332487835e-35, /* logil[218] */ } , { 1.07789421081542968750000000000000000000000000000000e+00, /* r[219] */ -7.50093329917183998523100285638065543025732040405273e-02, /* logih[219] */ 1.21553538095744083798831566922580286219799129072055e-18, /* logim[219] */ -5.89842100461659880732549401024388472535698324065996e-35, /* logil[219] */ } , { 1.07563018798828125000000000000000000000000000000000e+00, /* r[220] */ -7.29067112034412351251333461732428986579179763793945e-02, /* logih[220] */ 6.30693084361487082247322771068486204374546343933133e-18, /* logim[220] */ 3.44825082371128400572272238979928316738696119124015e-34, /* logil[220] */ } , { 1.07337570190429687500000000000000000000000000000000e+00, /* r[221] */ -7.08085439330154442494347222236683592200279235839844e-02, /* logih[221] */ 6.21205862241802265972824064219836764844223885696046e-18, /* logim[221] */ -2.58313322603855039499688568243180373305456453270216e-34, /* logil[221] */ } , { 1.07112884521484375000000000000000000000000000000000e+00, /* r[222] */ -6.87130878850236020971564698811562266200780868530273e-02, /* logih[222] */ 2.70354961689989817022493816753711952290500355166865e-18, /* logim[222] */ -4.32103888921541828258452321965605627074720991923399e-35, /* logil[222] */ } , { 1.06889343261718750000000000000000000000000000000000e+00, /* r[223] */ -6.66239382216213954501782268380338791757822036743164e-02, /* logih[223] */ 5.70083134370999669291082348348689873755740434296954e-18, /* logim[223] */ -8.10096531474775368286716199375642728810684749797528e-35, /* logil[223] */ } , { 1.06666755676269531250000000000000000000000000000000e+00, /* r[224] */ -6.45393556022498676716381282858492340892553329467773e-02, /* logih[224] */ 6.27679858230689064724912619776653321119382603385890e-18, /* logim[224] */ 3.82578436460361832583744997495972964625953636902884e-34, /* logil[224] */ } , { 1.06444931030273437500000000000000000000000000000000e+00, /* r[225] */ -6.24575859017184389920807063845131779089570045471191e-02, /* logih[225] */ 3.12396238135026689723293065657341228563060732941880e-18, /* logim[225] */ -2.56480637242869270592951014242676091679089182875022e-35, /* logil[225] */ } , { 1.06224060058593750000000000000000000000000000000000e+00, /* r[226] */ -6.03804513842609302809449900450999848544597625732422e-02, /* logih[226] */ 2.15703432342306119511642925211564389619524247753812e-18, /* logim[226] */ -3.99051054966201464148223117427430962485432571249835e-35, /* logil[226] */ } , { 1.06004142761230468750000000000000000000000000000000e+00, /* r[227] */ -5.83079900133864140188144631338218459859490394592285e-02, /* logih[227] */ -2.26614868674930470856533040936568995022733760870024e-18, /* logim[227] */ 4.93654463845011924979397150953449636718851245018416e-36, /* logil[227] */ } , { 1.05785179138183593750000000000000000000000000000000e+00, /* r[228] */ -5.62402398633818634277048431613366119563579559326172e-02, /* logih[228] */ 3.23622784070623643425179422456037835068049704948076e-18, /* logim[228] */ 8.21211163681263455010708306384902557377035880000243e-35, /* logil[228] */ } , { 1.05566978454589843750000000000000000000000000000000e+00, /* r[229] */ -5.41754323534648848936789988783857552334666252136230e-02, /* logih[229] */ -1.63682825416879776300941023746021061378436290037990e-18, /* logim[229] */ -7.00922691871793498425237363067495151340436490327669e-35, /* logil[229] */ } , { 1.05349731445312500000000000000000000000000000000000e+00, /* r[230] */ -5.21154050923886280610730636908556334674358367919922e-02, /* logih[230] */ -6.39781587823151025739574281786018493556176254138154e-19, /* logim[230] */ 3.56720195764935648932285840665933091100063235873938e-35, /* logil[230] */ } , { 1.05133438110351562500000000000000000000000000000000e+00, /* r[231] */ -5.00601964830668655359602325916057452559471130371094e-02, /* logih[231] */ 2.51984665593202228822706788872411441168875867302045e-18, /* logim[231] */ -2.18342737706092628156578807143832418432366157819325e-35, /* logil[231] */ } , { 1.04918098449707031250000000000000000000000000000000e+00, /* r[232] */ -4.80098450349349045729319129804935073480010032653809e-02, /* logih[232] */ -1.52080250600506339582829684987843924335937235135276e-18, /* logim[232] */ -9.24379674215907095849380058311583825692328514013958e-35, /* logil[232] */ } , { 1.04703521728515625000000000000000000000000000000000e+00, /* r[233] */ -4.59625676982170078277434299707238096743822097778320e-02, /* logih[233] */ -3.31972713633937264538106994059359671095924053342216e-18, /* logim[233] */ -1.13937339607744860727400568917500096969385851217146e-34, /* logil[233] */ } , { 1.04489707946777343750000000000000000000000000000000e+00, /* r[234] */ -4.39183920188736254264227909516193903982639312744141e-02, /* logih[234] */ -1.56343240701227240066055187635828001828861125718036e-18, /* logim[234] */ -3.02746820911254374279963651479509453045839237097215e-35, /* logil[234] */ } , { 1.04277038574218750000000000000000000000000000000000e+00, /* r[235] */ -4.18810038843394558116806081216054735705256462097168e-02, /* logih[235] */ 7.08767348853067953695390709296896788518980234122108e-19, /* logim[235] */ 5.81746887353045891576525685995993541223272544408687e-36, /* logil[235] */ } , { 1.04065132141113281250000000000000000000000000000000e+00, /* r[236] */ -3.98467877153236421650106535707891453057527542114258e-02, /* logih[236] */ 2.90303379363907111194760685579166515046306452777543e-18, /* logim[236] */ -1.87179669992551157656392090580258428294705323369769e-34, /* logil[236] */ } , { 1.03853988647460937500000000000000000000000000000000e+00, /* r[237] */ -3.78157713717320251300968436680705053731799125671387e-02, /* logih[237] */ 1.31557218113972830753744753624727966873659341218890e-19, /* logim[237] */ 3.06309949074642996410908941009119700992862883848855e-36, /* logil[237] */ } , { 1.03643798828125000000000000000000000000000000000000e+00, /* r[238] */ -3.57898231070667913189531361695117084309458732604980e-02, /* logih[238] */ 2.61901199505080724827733891681136430570574020973310e-18, /* logim[238] */ -1.03901456915381040350545966439681190782130708435783e-34, /* logil[238] */ } , { 1.03434371948242187500000000000000000000000000000000e+00, /* r[239] */ -3.37671381422615726752844977909262524917721748352051e-02, /* logih[239] */ 5.67782765535494174549017056202204751471356116304136e-19, /* logim[239] */ 2.53528355791248032893098939659784274260892498065275e-35, /* logil[239] */ } , { 1.03225898742675781250000000000000000000000000000000e+00, /* r[240] */ -3.17495923838522486892799179258872754871845245361328e-02, /* logih[240] */ -3.27645416513913885099937157154221271265660318847254e-18, /* logim[240] */ 8.28856608327529296008590058532581223963810647767730e-35, /* logil[240] */ } , { 1.03018188476562500000000000000000000000000000000000e+00, /* r[241] */ -2.97353738029609328263891399046769947744905948638916e-02, /* logih[241] */ -1.42123656023807324094007557899495837832764341820361e-18, /* logim[241] */ 6.91675602259020207318590223540920124856020443401708e-35, /* logil[241] */ } , { 1.02811241149902343750000000000000000000000000000000e+00, /* r[242] */ -2.77245107619511835239656249996187398210167884826660e-02, /* logih[242] */ 1.56537436220084983093655029081028016172956628311065e-18, /* logim[242] */ -4.26959324792631463690822650182944301609062827136870e-35, /* logil[242] */ } , { 1.02605247497558593750000000000000000000000000000000e+00, /* r[243] */ -2.57188906410827818060926830412427079863846302032471e-02, /* logih[243] */ -4.32555496623632207496744723792774270215720987145012e-19, /* logim[243] */ 1.52055580639983796045911400446456477822011205599594e-35, /* logil[243] */ } , { 1.02400016784667968750000000000000000000000000000000e+00, /* r[244] */ -2.37166905300757423213919850013553514145314693450928e-02, /* logih[244] */ 1.57595637918687487090746306283132097902404584964498e-18, /* logim[244] */ 9.74151980884630209236553635927232431547283770922398e-36, /* logil[244] */ } , { 1.02195549011230468750000000000000000000000000000000e+00, /* r[245] */ -2.17179390838950908682036811114812735468149185180664e-02, /* logih[245] */ 1.51145445644716133590266967637567408648790588957093e-19, /* logim[245] */ -6.02620888867536172611371375475252817876600211415641e-36, /* logil[245] */ } , { 1.01992034912109375000000000000000000000000000000000e+00, /* r[246] */ -1.97245351501005340699723689112943247891962528228760e-02, /* logih[246] */ 1.34458916305708123412045028332259969564528051018263e-18, /* logim[246] */ -6.02768376061644464555810636396264987280148524662430e-35, /* logil[246] */ } , { 1.01789283752441406250000000000000000000000000000000e+00, /* r[247] */ -1.77346449295557526126820846457121660932898521423340e-02, /* logih[247] */ 7.79495017362897286873974720552694669993891890935313e-19, /* logim[247] */ 1.36178679065204639598156495958075391845124350978061e-35, /* logil[247] */ } , { 1.01587295532226562500000000000000000000000000000000e+00, /* r[248] */ -1.57482973634926158579272481574662378989160060882568e-02, /* logih[248] */ -1.00208727697080412925749596659626020152032796409604e-18, /* logim[248] */ 7.75790823155383991507800579878754988160969197338737e-35, /* logil[248] */ } , { 1.01386070251464843750000000000000000000000000000000e+00, /* r[249] */ -1.37655214863766119093302364717601449228823184967041e-02, /* logih[249] */ -5.48983179446608237058051237183129839336112673134214e-19, /* logim[249] */ -1.07124914949087525209371623912638443397942890041101e-35, /* logil[249] */ } , { 1.01185798645019531250000000000000000000000000000000e+00, /* r[250] */ -1.17882314234863290469679242278289166279137134552002e-02, /* logih[250] */ -2.27798661830469484283633290231243375517062716277910e-19, /* logim[250] */ -1.39810745565350762832359759144648110107303965002540e-35, /* logil[250] */ } , { 1.00986099243164062500000000000000000000000000000000e+00, /* r[251] */ -9.81269012531632393858682661402781377546489238739014e-03, /* logih[251] */ -6.97507609288120398034926564017756235032809786202962e-19, /* logim[251] */ -4.77223430605379546730200636004016887477665718525716e-35, /* logil[251] */ } , { 1.00787353515625000000000000000000000000000000000000e+00, /* r[252] */ -7.84270062375400263399161104871382121928036212921143e-03, /* logih[252] */ -2.40330730071604899669779379793438954457155324844264e-19, /* logim[252] */ 1.77453639459760487861944622725812265877091856705197e-36, /* logil[252] */ } , { 1.00589370727539062500000000000000000000000000000000e+00, /* r[253] */ -5.87640732328869111467106733925902517512440681457520e-03, /* logih[253] */ -4.48574348377346892833940286850982368331573394791167e-20, /* logim[253] */ -1.60289170664661311448886936584931944274496990139304e-36, /* logil[253] */ } , { 1.00392150878906250000000000000000000000000000000000e+00, /* r[254] */ -3.91383971648977691676352108629544090945273637771606e-03, /* logih[254] */ -4.28019276224719221462393891683495367484578724177817e-19, /* logim[254] */ -2.25272542183557712010826889962617244762256960750126e-35, /* logil[254] */ } , { 1.00195693969726562500000000000000000000000000000000e+00, /* r[255] */ -1.95502738522272592053274919976502133067697286605835e-03, /* logih[255] */ 4.23091354502479132756026938785685564809899588018682e-20, /* logim[255] */ 2.38479717170645227429169885358660522796868401607905e-36, /* logil[255] */ } }; interval-2.1.0/src/crlibm/log10-td.c0000644000000000000000000007016113031036767015231 0ustar 00000000000000/* * This function computes log10, correctly rounded, * using experimental techniques based on triple double arithmetics THIS IS EXPERIMENTAL SOFTWARE * * Author : Christoph Lauter * christoph.lauter at ens-lyon.fr * To have it replace the crlibm log10, do: gcc -DHAVE_CONFIG_H -I. -fPIC -O2 -c log10-td.c; mv log10-td.o log10_accurate.o; make ********************************************************** * * NOTE: THIS FUNCTION USES SOME BASIC SEQUENCES AND * FURTHER FINAL ROUNDING SEQUENCES WITH SPECIAL CASE * TESTS NO FORMAL PROOF IS AVAILABLE FOR IN THE MOMENT * ********************************************************** */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" #include "log10-td.h" #define AVOID_FMA 0 void log10_td_accurate(double *logb10h, double *logb10m, double *logb10l, int E, double ed, int index, double zh, double zl, double logih, double logim) { double highPoly, t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, t8h, t8l, t9h, t9l, t10h, t10l, t11h, t11l; double t12h, t12l, t13h, t13l, t14h, t14l, zSquareh, zSquarem, zSquarel, zCubeh, zCubem, zCubel, higherPolyMultZh, higherPolyMultZm; double higherPolyMultZl, zSquareHalfh, zSquareHalfm, zSquareHalfl, polyWithSquareh, polyWithSquarem, polyWithSquarel; double polyh, polym, polyl, logil, logyh, logym, logyl, loghover, logmover, loglover, log2edhover, log2edmover, log2edlover; double log2edh, log2edm, log2edl, logb10hover, logb10mover, logb10lover; double logyhnorm, logymnorm, logylnorm; #if EVAL_PERF crlibm_second_step_taken++; #endif /* Accurate phase: Argument reduction is already done. We must return logh, logm and logl representing the intermediate result in 118 bits precision. We use a 14 degree polynomial, computing the first 3 (the first is 0) coefficients in triple double, calculating the next 7 coefficients in double double arithmetics and the last in double. We must account for zl starting with the monome of degree 4 (7^3 + 53 - 7 >> 118); so double double calculations won't account for it. */ /* Start of the horner scheme */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(accPolyC14,zh,accPolyC13),zh,accPolyC12),zh,accPolyC11),zh,accPolyC10); #else highPoly = accPolyC10 + zh * (accPolyC11 + zh * (accPolyC12 + zh * (accPolyC13 + zh * accPolyC14))); #endif /* We want to write accPolyC3 + zh * (accPoly4 + zh * (accPoly5 + zh * (accPoly6 + zh * (accPoly7 + zh * (accPoly8 + zh * (accPoly9 + zh * highPoly)))))); ( t14 t13 t12 t11 t10 t9 t8 t7 t6 t5 t4 t3 t2 t1 ) with all additions and multiplications in double double arithmetics but we will produce intermediate results labelled t1h/t1l thru t14h/t14l */ Mul12(&t1h, &t1l, zh, highPoly); Add22(&t2h, &t2l, accPolyC9h, accPolyC9l, t1h, t1l); Mul22(&t3h, &t3l, zh, zl, t2h, t2l); Add22(&t4h, &t4l, accPolyC8h, accPolyC8l, t3h, t3l); Mul22(&t5h, &t5l, zh, zl, t4h, t4l); Add22(&t6h, &t6l, accPolyC7h, accPolyC7l, t5h, t5l); Mul22(&t7h, &t7l, zh, zl, t6h, t6l); Add22(&t8h, &t8l, accPolyC6h, accPolyC6l, t7h, t7l); Mul22(&t9h, &t9l, zh, zl, t8h, t8l); Add22(&t10h, &t10l, accPolyC5h, accPolyC5l, t9h, t9l); Mul22(&t11h, &t11l, zh, zl, t10h, t10l); Add22(&t12h, &t12l, accPolyC4h, accPolyC4l, t11h, t11l); Mul22(&t13h, &t13l, zh, zl, t12h, t12l); Add22(&t14h, &t14l, accPolyC3h, accPolyC3l, t13h, t13l); /* We must now prepare (zh + zl)^2 and (zh + zl)^3 as triple doubles */ Mul23(&zSquareh, &zSquarem, &zSquarel, zh, zl, zh, zl); Mul233(&zCubeh, &zCubem, &zCubel, zh, zl, zSquareh, zSquarem, zSquarel); /* We can now multiplicate the middle and higher polynomial by z^3 */ Mul233(&higherPolyMultZh, &higherPolyMultZm, &higherPolyMultZl, t14h, t14l, zCubeh, zCubem, zCubel); /* Multiply now z^2 by -1/2 (exact op) and add to middle and higher polynomial */ zSquareHalfh = zSquareh * -0.5; zSquareHalfm = zSquarem * -0.5; zSquareHalfl = zSquarel * -0.5; Add33(&polyWithSquareh, &polyWithSquarem, &polyWithSquarel, zSquareHalfh, zSquareHalfm, zSquareHalfl, higherPolyMultZh, higherPolyMultZm, higherPolyMultZl); /* Add now zh and zl to obtain the polynomial evaluation result */ Add233(&polyh, &polym, &polyl, zh, zl, polyWithSquareh, polyWithSquarem, polyWithSquarel); /* Reconstruct now log(y) = log(1 + z) - log(ri) by adding logih, logim, logil logil has not been read to the time, do this first */ logil = argredtable[index].logil; Add33(&logyh, &logym, &logyl, logih, logim, logil, polyh, polym, polyl); /* Renormalize logyh, logym and logyl to a non-overlapping triple-double for winning some accuracy in the final ln(x) result before multiplying with log10inv THIS MAY NOT BE NECESSARY NOR SUFFICIENT */ Renormalize3(&logyhnorm, &logymnorm, &logylnorm, logyh, logym, logyl); /* Multiply log2 with E, i.e. log2h, log2m, log2l by ed ed is always less than 2^(12) and log2h and log2m are stored with at least 12 trailing zeros So multiplying naively is correct (up to 134 bits at least) The final result is thus obtained by adding log2 * E to log(y) */ log2edhover = log2h * ed; log2edmover = log2m * ed; log2edlover = log2l * ed; /* It may be necessary to renormalize the tabulated value (multiplied by ed) before adding the to the log(y)-result If needed, uncomment the following Renormalize3-Statement and comment out the copies following it. */ /* Renormalize3(&log2edh, &log2edm, &log2edl, log2edhover, log2edmover, log2edlover); */ log2edh = log2edhover; log2edm = log2edmover; log2edl = log2edlover; Add33(&loghover, &logmover, &loglover, log2edh, log2edm, log2edl, logyhnorm, logymnorm, logylnorm); /* Change logarithm base from natural base to base 10 by multiplying */ Mul33(&logb10hover, &logb10mover, &logb10lover, log10invh, log10invm, log10invl, loghover, logmover, loglover); /* Since we can not guarantee in each addition and multiplication procedure that the results are not overlapping, we must renormalize the result before handing it over to the final rounding */ Renormalize3(logb10h,logb10m,logb10l,logb10hover,logb10mover,logb10lover); } /************************************************************* ************************************************************* * ROUNDED TO NEAREST * ************************************************************* *************************************************************/ double log10_rn(double x){ db_number xdb; double y, ed, ri, logih, logim, yrih, yril, th, zh, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, roundcst; double logb10h, logb10m, logb10l; int E, index; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih, &yril, y, ri); th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zl)); Add22(&t2h, &t2l, zh, zl, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Change logarithm base from natural base to base 10 by multiplying */ Mul22(&logb10h, &logb10m, log10invh, log10invm, logh, logm); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = ROUNDCST1; else roundcst = ROUNDCST2; if(logb10h == (logb10h + (logb10m * roundcst))) return logb10h; else { #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log10_td_accurate(&logb10h, &logb10m, &logb10l, E, ed, index, zh, zl, logih, logim); ReturnRoundToNearest3(logb10h, logb10m, logb10l); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED UPWARDS * ************************************************************* *************************************************************/ double log10_ru(double x) { db_number xdb; double y, ed, ri, logih, logim, yrih, yril, th, zh, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, roundcst; double logb10h, logb10m, logb10l; int E, index; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih, &yril, y, ri); th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zl)); Add22(&t2h, &t2l, zh, zl, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Change logarithm base from natural base to base 10 by multiplying */ Mul22(&logb10h, &logb10m, log10invh, log10invm, logh, logm); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = RDROUNDCST1; else roundcst = RDROUNDCST2; TEST_AND_RETURN_RU(logb10h, logb10m, roundcst); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log10_td_accurate(&logb10h, &logb10m, &logb10l, E, ed, index, zh, zl, logih, logim); ReturnRoundUpwards3Unfiltered(logb10h, logb10m, logb10l, WORSTCASEACCURACY); } /************************************************************* ************************************************************* * ROUNDED DOWNWARDS * ************************************************************* *************************************************************/ double log10_rd(double x) { db_number xdb; double y, ed, ri, logih, logim, yrih, yril, th, zh, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, roundcst; double logb10h, logb10m, logb10l; int E, index; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih, &yril, y, ri); th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zl)); Add22(&t2h, &t2l, zh, zl, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Change logarithm base from natural base to base 10 by multiplying */ Mul22(&logb10h, &logb10m, log10invh, log10invm, logh, logm); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = RDROUNDCST1; else roundcst = RDROUNDCST2; TEST_AND_RETURN_RD(logb10h, logb10m, roundcst); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log10_td_accurate(&logb10h, &logb10m, &logb10l, E, ed, index, zh, zl, logih, logim); ReturnRoundDownwards3Unfiltered(logb10h, logb10m, logb10l, WORSTCASEACCURACY); } /************************************************************* ************************************************************* * ROUNDED TOWARDS ZERO * ************************************************************* *************************************************************/ double log10_rz(double x) { db_number xdb; double y, ed, ri, logih, logim, yrih, yril, th, zh, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, roundcst; double logb10h, logb10m, logb10l; int E, index; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih, &yril, y, ri); th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zl)); Add22(&t2h, &t2l, zh, zl, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Change logarithm base from natural base to base 10 by multiplying */ Mul22(&logb10h, &logb10m, log10invh, log10invm, logh, logm); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = RDROUNDCST1; else roundcst = RDROUNDCST2; TEST_AND_RETURN_RZ(logb10h, logb10m, roundcst); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log10_td_accurate(&logb10h, &logb10m, &logb10l, E, ed, index, zh, zl, logih, logim); ReturnRoundTowardsZero3Unfiltered(logb10h, logb10m, logb10l, WORSTCASEACCURACY); } interval-2.1.0/src/crlibm/log10-td.h0000644000000000000000000012764313031036767015246 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" /*File generated by maple/log10-td.mpl*/ #define L 7 #define MAXINDEX 53 #define INDEXMASK 127 #define two52 4.50359962737049600000000000000000000000000000000000e+15 #define log2h 6.93147180559890330187045037746429443359375000000000e-01 #define log2m 5.49792301870850242169664946507035702127907939029683e-14 #define log2l -1.31246984177852556920995753667322295879593697972250e-27 #define log10invh 4.34294481903251816667932416748953983187675476074219e-01 #define log10invm 1.09831965021676507273885982186335434116483395815072e-17 #define log10invl 3.71718123311095896669981767697359971405165651422486e-34 #define WORSTCASEACCURACY 5.31691198313966349161522824112137830400000000000000e+36 #define ROUNDCST1 1.00787401574803160796292764473221714405939530505554e+00 #define ROUNDCST2 1.00787401574803160796292764473221714405939530505554e+00 #define RDROUNDCST1 4.33680868994201773602981120347976684570312500000000e-19 #define RDROUNDCST2 4.33680868994201773602981120347976684570312500000000e-19 #define c3 3.33333333333333370340767487505218014121055603027344e-01 #define c4 -2.49999999990904886448817023847368545830249786376953e-01 #define c5 1.99999999978980019799124079327157232910394668579102e-01 #define c6 -1.66669050883027802800739891608827747404575347900391e-01 #define c7 1.42860109897981618631845890377007890492677688598633e-01 #define accPolyC3h 3.33333333333333314829616256247390992939472198486328e-01 #define accPolyC3l 1.85037170770859413132312241283212169118117639547054e-17 #define accPolyC4h -2.50000000000000000000000000000000000000000000000000e-01 #define accPolyC4l 4.62199018306924685334006418421322154174127637249391e-33 #define accPolyC5h 2.00000000000000011102230246251565404236316680908203e-01 #define accPolyC5l -1.11022302443127785678379338452126964515833173338601e-17 #define accPolyC6h -1.66666666666666657414808128123695496469736099243164e-01 #define accPolyC6l -9.25185854591372488017120157358742564605503054108327e-18 #define accPolyC7h 1.42857142857142849212692681248881854116916656494141e-01 #define accPolyC7l 7.92868209382438390589949095717120486682310988838960e-18 #define accPolyC8h -1.25000000000000000000000000000000000000000000000000e-01 #define accPolyC8l 3.42769668947376590645174407718339199260639267364101e-21 #define accPolyC9h 1.11111111111111521276839653182832989841699600219727e-01 #define accPolyC9l 4.33331955380787609416227741118274520376899199903317e-18 #define accPolyC10 -1.00000000000000699440505513848620466887950897216797e-01 #define accPolyC11 9.09090908567022348840680479042930528521537780761719e-02 #define accPolyC12 -8.33333332642126056732934102910803630948066711425781e-02 #define accPolyC13 7.69261287585959879775643344146374147385358810424805e-02 #define accPolyC14 -7.14319092953022982683819464000407606363296508789062e-02 typedef struct rri_tag {float ri; double logih; double logim; double logil;} rri; static const rri argredtable[128] = { { 1.00000000000000000000000000000000000000000000000000e+00, /* r[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logih[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logim[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logil[0] */ } , { 9.92248058319091796875000000000000000000000000000000e-01, /* r[1] */ 7.78214416734525436109004559170898573938757181167603e-03, /* logih[1] */ -1.28191618904143681948935996668824218266800862156024e-20, /* logim[1] */ 1.17655068600225378123891861200215069271455859581641e-37, /* logil[1] */ } , { 9.84615325927734375000000000000000000000000000000000e-01, /* r[2] */ 1.55042461406118062261505485821544425562024116516113e-02, /* logih[2] */ -3.27761516207149627029928635703400435929630184221293e-19, /* logim[2] */ 2.95200020707030964072253388818190769795416371257942e-37, /* logil[2] */ } , { 9.77099180221557617187500000000000000000000000000000e-01, /* r[3] */ 2.31671170235356708999585606534310500137507915496826e-02, /* logih[3] */ 5.57833156048330069504471566938468802334954100224869e-19, /* logim[3] */ 4.08416064054113313191746248503653555682943539201798e-35, /* logil[3] */ } , { 9.69696998596191406250000000000000000000000000000000e-01, /* r[4] */ 3.07716288644317437217523547587916254997253417968750e-02, /* logih[4] */ 1.04316437964092669923942103072089812062131860035492e-18, /* logim[4] */ -8.26837774892530079043982861155759865584698067912967e-36, /* logil[4] */ } , { 9.62406039237976074218750000000000000000000000000000e-01, /* r[5] */ 3.83188391564273991840572364253603154793381690979004e-02, /* logih[5] */ 1.54512636366303706650320890230224472259662656606095e-18, /* logim[5] */ 8.30977110244055528389241824578843983429633068152463e-35, /* logil[5] */ } , { 9.55223917961120605468750000000000000000000000000000e-01, /* r[6] */ 4.58094969157468376308450785927561810240149497985840e-02, /* logih[6] */ -3.30123051072550842868548428055668582607719074881820e-18, /* logim[6] */ 1.64164772626574162996727598513545022472742050176492e-34, /* logil[6] */ } , { 9.48148131370544433593750000000000000000000000000000e-01, /* r[7] */ 5.32445322139413548812036935942160198464989662170410e-02, /* logih[7] */ 2.23755385085953619415254057336256700540433618368589e-18, /* logim[7] */ -9.41330315099866735037984721876103977945647219756033e-35, /* logil[7] */ } , { 9.41176414489746093750000000000000000000000000000000e-01, /* r[8] */ 6.06246814210813916856679384181916248053312301635742e-02, /* logih[8] */ 2.64247317995478646334926909653435556549332769494295e-18, /* logim[8] */ 1.55075207452234839722600788456166299408429635417895e-34, /* logil[8] */ } , { 9.34306621551513671875000000000000000000000000000000e-01, /* r[9] */ 6.79506060291548280583029395529592875391244888305664e-02, /* logih[9] */ 5.65862161871167282533541105359923619273100535513035e-18, /* logim[9] */ -3.57889357320249912090032102867532919048871786355064e-34, /* logil[9] */ } , { 9.27536249160766601562500000000000000000000000000000e-01, /* r[10] */ 7.52234026111362058530929175503842998296022415161133e-02, /* logih[10] */ 1.00828755349783911736541446332784521904773238841865e-18, /* logim[10] */ 7.77966415828014771486738038255868010153689429282538e-36, /* logil[10] */ } , { 9.20863270759582519531250000000000000000000000000000e-01, /* r[11] */ 8.24437111205913314426751981045526918023824691772461e-02, /* logih[11] */ -4.27419767632228646217014766651675738804062364961374e-18, /* logim[11] */ 3.58539257549786746072726449331073277906948658046759e-34, /* logil[11] */ } , { 9.14285659790039062500000000000000000000000000000000e-01, /* r[12] */ 8.96122182943336897942288032936630770564079284667969e-02, /* logih[12] */ -5.42674234758262048883730612286095846547194397615989e-18, /* logim[12] */ -7.94903110897686868047461590865098481976776339992810e-35, /* logil[12] */ } , { 9.07801389694213867187500000000000000000000000000000e-01, /* r[13] */ 9.67296581235191493819414176869031507521867752075195e-02, /* logih[13] */ 1.17499431052084706890372286741885325822732164697539e-18, /* logim[13] */ -7.47188021694240554877009439429630012902672969107896e-35, /* logil[13] */ } , { 9.01408433914184570312500000000000000000000000000000e-01, /* r[14] */ 1.03796812308095232069149460585322231054306030273438e-01, /* logih[14] */ -1.46116759252442942691327623497388991415382979093093e-18, /* logim[14] */ -5.84766064918572844473631496354606243606272630720064e-35, /* logil[14] */ } , { 8.95104885101318359375000000000000000000000000000000e-01, /* r[15] */ 1.10814377516161077785739053069846704602241516113281e-01, /* logih[15] */ -5.75514509579248124656596649605847554012818793702281e-18, /* logim[15] */ 3.29977719536339952907783192540462408052319847426319e-34, /* logil[15] */ } , { 8.88888835906982421875000000000000000000000000000000e-01, /* r[16] */ 1.17783095261030007483427084480354096740484237670898e-01, /* logih[16] */ -1.19709798867727449215060005668653850880775796697715e-18, /* logim[16] */ 8.04222018353684236067064017226062133396406008492921e-35, /* logil[16] */ } , { 8.82758617401123046875000000000000000000000000000000e-01, /* r[17] */ 1.24703482226247538977581541530526010319590568542480e-01, /* logih[17] */ 2.28663295749049514726834658528273231115811065734312e-18, /* logim[17] */ -3.51123005875932392272239647660221882537057244586168e-35, /* logil[17] */ } , { 8.76712322235107421875000000000000000000000000000000e-01, /* r[18] */ 1.31576365239299886145118989588809199631214141845703e-01, /* logih[18] */ 1.11230010175930229418362785876222391520299564865730e-17, /* logim[18] */ 7.27451645836749926637643602480531900716806359121297e-34, /* logil[18] */ } , { 8.70748281478881835937500000000000000000000000000000e-01, /* r[19] */ 1.38402343348215994822680841025430709123611450195312e-01, /* logih[19] */ -7.69528416335144553864151614176326744245393995127969e-18, /* logim[19] */ 1.14202629230472885861778260955781649682548331183808e-34, /* logil[19] */ } , { 8.64864826202392578125000000000000000000000000000000e-01, /* r[20] */ 1.45182054547982469783207193358975928276777267456055e-01, /* logih[20] */ 8.24244856152552570070228105635897158979868211170798e-18, /* logim[20] */ -6.13072808770694892835379995250538817854995507648779e-34, /* logil[20] */ } , { 8.59060406684875488281250000000000000000000000000000e-01, /* r[21] */ 1.51916037369229123266123337998578790575265884399414e-01, /* logih[21] */ -1.04296908000297145574171199957656893307239877379000e-17, /* logim[21] */ -5.53636436435840586444373230094200986769217138540854e-34, /* logil[21] */ } , { 8.53333353996276855468750000000000000000000000000000e-01, /* r[22] */ 1.58605005962251938145257668111298698931932449340820e-01, /* logih[22] */ -8.86065192248216377790637508171938194510660992474042e-19, /* logim[22] */ -5.87995214834401673695486864800931832452468264932844e-35, /* logil[22] */ } , { 8.47682118415832519531250000000000000000000000000000e-01, /* r[23] */ 1.65249573826629747586025587224867194890975952148438e-01, /* logih[23] */ -9.66125475305916070790888958698289394696700966750453e-18, /* logim[23] */ 1.22853647999759344001960461047755491313341721869856e-34, /* logil[23] */ } , { 8.42105269432067871093750000000000000000000000000000e-01, /* r[24] */ 1.71850249476078659194300257695431355386972427368164e-01, /* logih[24] */ -6.02245395887480538795512923412250309472746231920746e-18, /* logim[24] */ 1.52961687917434402329553899350235008490821862631877e-34, /* logil[24] */ } , { 8.36601257324218750000000000000000000000000000000000e-01, /* r[25] */ 1.78407717077464861299418430462537799030542373657227e-01, /* logih[25] */ -1.24324832026190372515095573175819374097319572461178e-17, /* logim[25] */ -5.99222696564577786410580709003476847421843326905428e-34, /* logil[25] */ } , { 8.31168889999389648437500000000000000000000000000000e-01, /* r[26] */ 1.84922267713498816865680396404059138149023056030273e-01, /* logih[26] */ 9.96243711860796179875713739627414673019270693540839e-18, /* logim[26] */ -1.99546782893888540832510298706525540082513642365204e-34, /* logil[26] */ } , { 8.25806498527526855468750000000000000000000000000000e-01, /* r[27] */ 1.91394796188954025017991966706176754087209701538086e-01, /* logih[27] */ -8.22643020277300444045205706293674132131812201700538e-18, /* logim[27] */ 5.69056030867564774930537188285078930441778787828211e-34, /* logil[27] */ } , { 8.20512771606445312500000000000000000000000000000000e-01, /* r[28] */ 1.97825802934566419288842098467284813523292541503906e-01, /* logih[28] */ 1.28212649590622342007825921152819823725126964367518e-17, /* logim[28] */ 4.34712978477783827374998481132430084872238812357849e-34, /* logil[28] */ } , { 8.15286636352539062500000000000000000000000000000000e-01, /* r[29] */ 2.04215526527529805944638496839615982025861740112305e-01, /* logih[29] */ 2.73382699896480606605004885268461286375739934002155e-18, /* logim[29] */ 1.88415596219599490517606146615135776386751947516623e-34, /* logil[29] */ } , { 8.10126543045043945312500000000000000000000000000000e-01, /* r[30] */ 2.10564817536124687658016796376614365726709365844727e-01, /* logih[30] */ 2.68952644992466202072392146799884466396384136175691e-18, /* logim[30] */ -1.58883120037037559046153789501260274259127656480088e-34, /* logil[30] */ } , { 8.05031418800354003906250000000000000000000000000000e-01, /* r[31] */ 2.16873972759550226463431954471161589026451110839844e-01, /* logih[31] */ -1.23625140584833845652640860288020787431726668393088e-17, /* logim[31] */ -1.28369360755661214950804825668450767372141502246786e-34, /* logil[31] */ } , { 7.99999952316284179687500000000000000000000000000000e-01, /* r[32] */ 2.23143610918856316605030087885097600519657135009766e-01, /* logih[32] */ -9.09120001124270523314725361445863555491966823753373e-18, /* logim[32] */ 1.15945802868784933647836819275496182741822080543604e-34, /* logil[32] */ } , { 7.95031070709228515625000000000000000000000000000000e-01, /* r[33] */ 2.29374082438394522043267897970508784055709838867188e-01, /* logih[33] */ -1.08890120418598083770448590672876580941469212582837e-17, /* logim[33] */ 4.74877924128943438272197143958394008126523960202900e-34, /* logil[33] */ } , { 7.90123462677001953125000000000000000000000000000000e-01, /* r[34] */ 2.35566063862186342303672859088692348450422286987305e-01, /* logih[34] */ -2.39433728738216998660812173360881116827035967139939e-18, /* logim[34] */ -9.62471867414270770251397101906428335828045927610883e-35, /* logil[34] */ } , { 7.85276055335998535156250000000000000000000000000000e-01, /* r[35] */ 2.41719960170209802186036540661007165908813476562500e-01, /* logih[35] */ 2.39578119451184969695376143676233310543075971208880e-18, /* logim[35] */ 1.86231935097448741662637615288316997021879162207127e-34, /* logil[35] */ } , { 7.80487775802612304687500000000000000000000000000000e-01, /* r[36] */ 2.47836201157484947721343360171886160969734191894531e-01, /* logih[36] */ -1.24321923457726137680465119406863072977770725701004e-17, /* logim[36] */ -2.09577513970149680056365167860895085898294691979404e-34, /* logil[36] */ } , { 7.75757551193237304687500000000000000000000000000000e-01, /* r[37] */ 2.53915241645931488712051304901251569390296936035156e-01, /* logih[37] */ -6.31336333527435824035156315376733999545148217960567e-18, /* logim[37] */ 4.63496313971202069379055986715253908538961883067566e-35, /* logil[37] */ } , { 7.71084308624267578125000000000000000000000000000000e-01, /* r[38] */ 2.59957561689829752538116736104711890220642089843750e-01, /* logih[38] */ -7.05748899290965383754297836711168798219001736647281e-18, /* logim[38] */ 4.27245447011230141916526741370315150982259792796987e-34, /* logil[38] */ } , { 7.66467094421386718750000000000000000000000000000000e-01, /* r[39] */ 2.65963511244235673025571031757863238453865051269531e-01, /* logih[39] */ -2.24162125724264292804912034054420308588570407662844e-17, /* logim[39] */ 4.90471140265143981765909599584287898945638617268867e-34, /* logil[39] */ } , { 7.61904716491699218750000000000000000000000000000000e-01, /* r[40] */ 2.71933775088288309795814257086021825671195983886719e-01, /* logih[40] */ 7.83390223779535346513505580003968001040971161798700e-19, /* logim[40] */ -3.02585215101390470982866376614279464778757620082138e-35, /* logil[40] */ } , { 7.57396459579467773437500000000000000000000000000000e-01, /* r[41] */ 2.77868437964940373507971571598318405449390411376953e-01, /* logih[41] */ -2.69368711734232128278453248569958166651302969280381e-17, /* logim[41] */ 1.27334496810554064003001771076892864921428144153570e-33, /* logil[41] */ } , { 7.52941131591796875000000000000000000000000000000000e-01, /* r[42] */ 2.83768232735291170421021433867281302809715270996094e-01, /* logih[42] */ -2.03265852251844689554711830689719609838328388091381e-17, /* logim[42] */ 3.99265876662456660849597520210659365811534845502505e-34, /* logil[42] */ } , { 7.48538017272949218750000000000000000000000000000000e-01, /* r[43] */ 2.89633285132462114930262941925320774316787719726562e-01, /* logih[43] */ -7.21962253363417273270454867455071277489833577725373e-18, /* logim[43] */ -2.16150227221931053192432009592422674631830770048369e-34, /* logil[43] */ } , { 7.44186043739318847656250000000000000000000000000000e-01, /* r[44] */ 2.95464216619126196494704572614864446222782135009766e-01, /* logih[44] */ -1.47072146829197428851717511710908602721304319475328e-17, /* logim[44] */ 4.88114627787723832872543510409367916590649903129304e-34, /* logil[44] */ } , { 7.39884376525878906250000000000000000000000000000000e-01, /* r[45] */ 3.01261352929903802877475982313626445829868316650391e-01, /* logih[45] */ 1.87070681938931680167624656750430985298856099421569e-17, /* logim[45] */ 1.51413799416501325421897094776870076323182009328971e-33, /* logil[45] */ } , { 7.35632181167602539062500000000000000000000000000000e-01, /* r[46] */ 3.07025039020202172856954803137341514229774475097656e-01, /* logih[46] */ -5.38102227896180596526923200171118043417676846319102e-18, /* logim[46] */ 2.06712483430759996475892191286335029882052180959917e-34, /* logil[46] */ } , { 7.31428623199462890625000000000000000000000000000000e-01, /* r[47] */ 3.12755639223383730129768309780047275125980377197266e-01, /* logih[47] */ -7.57930782773895721056011815787401170737920404028723e-18, /* logim[47] */ 8.39475110593319988799512618628582752750846924050440e-35, /* logil[47] */ } , { 7.27272748947143554687500000000000000000000000000000e-01, /* r[48] */ 3.18453701316212645089365196326980367302894592285156e-01, /* logih[48] */ 2.71147705440665649189983820006370647423267349507715e-17, /* logim[48] */ 4.61673001741568050305139864943649666789926072891368e-34, /* logil[48] */ } , { 7.23163843154907226562500000000000000000000000000000e-01, /* r[49] */ 3.24119466791566834817928111078799702227115631103516e-01, /* logih[49] */ -6.22349090807112113628215383245238541760656175683922e-18, /* logim[49] */ -2.94864944946984528585289533414905600786096792764282e-34, /* logil[49] */ } , { 7.19101071357727050781250000000000000000000000000000e-01, /* r[50] */ 3.29753359015631464234985514849540777504444122314453e-01, /* logih[50] */ -2.38987037434306035496609341036867889075145964580121e-17, /* logim[50] */ -1.22161021411351376080765213758661026982900357467596e-33, /* logil[50] */ } , { 7.15083837509155273437500000000000000000000000000000e-01, /* r[51] */ 3.35355487904429983014864546930766664445400238037109e-01, /* logih[51] */ -2.15530481136091842439480783176785939188081961777809e-17, /* logim[51] */ 5.65377778536716902900522531845470344712374772157319e-34, /* logil[51] */ } , { 7.11111068725585937500000000000000000000000000000000e-01, /* r[52] */ 3.40926646575239744585417156486073508858680725097656e-01, /* logih[52] */ 1.74672070296268393919501631375949801326271042364782e-17, /* logim[52] */ 1.28757784323920807504216254145051967795248381758825e-33, /* logil[52] */ } , { 1.41436457633972167968750000000000000000000000000000e+00, /* r[53] */ -3.46680367578929504723816990008344873785972595214844e-01, /* logih[53] */ -2.63487075436177288054440686474043695042741778901884e-17, /* logim[53] */ -1.38972774108545698123375234719775474495262622652200e-33, /* logil[53] */ } , { 1.40659332275390625000000000000000000000000000000000e+00, /* r[54] */ -3.41170697798120592381110327551141381263732910156250e-01, /* logih[54] */ 1.93668606486849623510457675345565515553170548397263e-17, /* logim[54] */ -6.31924577586791945681481090971933602378723267089765e-34, /* logil[54] */ } , { 1.39890718460083007812500000000000000000000000000000e+00, /* r[55] */ -3.35691349380139503200126682713744230568408966064453e-01, /* logih[55] */ 8.91843232308579533655667936963342665384096382048557e-18, /* logim[55] */ -7.43852632990846244963757376301756885994340719135686e-34, /* logil[55] */ } , { 1.39130425453186035156250000000000000000000000000000e+00, /* r[56] */ -3.30241619815349218836075806393637321889400482177734e-01, /* logih[56] */ -1.69271534756955752333877800530082817995576241189249e-17, /* logim[56] */ -2.05124125474152062675126703058085713735683777118919e-34, /* logil[56] */ } , { 1.38378381729125976562500000000000000000000000000000e+00, /* r[57] */ -3.24821643615624322531942880232236348092555999755859e-01, /* logih[57] */ 1.93287622140617006961244731990086787828970688523722e-17, /* logim[57] */ -1.40211415833516824405184666805315188814704601258065e-33, /* logil[57] */ } , { 1.37634420394897460937500000000000000000000000000000e+00, /* r[58] */ -3.19430856448034428130000605960958637297153472900391e-01, /* logih[58] */ 5.58442737360353866559969930374464901851229137435661e-18, /* logim[58] */ -2.25313306148742433454599602113064828727792769150620e-34, /* logil[58] */ } , { 1.36898398399353027343750000000000000000000000000000e+00, /* r[59] */ -3.14068847182749744106899925100151449441909790039062e-01, /* logih[59] */ 1.74087330539322720259314067705480812845274240645592e-17, /* logim[59] */ 2.87763442397890459672608687761118393908121210479900e-34, /* logil[59] */ } , { 1.36170220375061035156250000000000000000000000000000e+00, /* r[60] */ -3.08735537528966208498104606405831873416900634765625e-01, /* logih[60] */ 2.31380218279209479391607966489385619371870731511261e-17, /* logim[60] */ 5.75649697670342883220331709767832654878804183961435e-34, /* logil[60] */ } , { 1.35449743270874023437500000000000000000000000000000e+00, /* r[61] */ -3.03430487161918061023158088573836721479892730712891e-01, /* logih[61] */ 5.88591784280850309549180895879864991445414905765635e-18, /* logim[61] */ 3.80740105286783019924475997846877792541810370319751e-34, /* logil[61] */ } , { 1.34736847877502441406250000000000000000000000000000e+00, /* r[62] */ -2.98153415159913837140237546918797306716442108154297e-01, /* logih[62] */ -8.81391967432414632609646763074561636922040597203571e-18, /* logim[62] */ -2.02736910549706342663167850737697734462522018249963e-34, /* logil[62] */ } , { 1.34031414985656738281250000000000000000000000000000e+00, /* r[63] */ -2.92904026677480888718463347686338238418102264404297e-01, /* logih[63] */ 1.79356774462556308958502912313675336181211584010969e-17, /* logim[63] */ 1.02350086185905899058999882149766002774623879978153e-34, /* logil[63] */ } , { 1.33333325386047363281250000000000000000000000000000e+00, /* r[64] */ -2.87682012847134349620148441317724063992500305175781e-01, /* logih[64] */ -2.60715355783435444041951693925565689223533295668838e-17, /* logim[64] */ -9.83372234709377378449141028490939682198507140512540e-34, /* logil[64] */ } , { 1.32642483711242675781250000000000000000000000000000e+00, /* r[65] */ -2.82487230428967117656924301627441309392452239990234e-01, /* logih[65] */ 2.49452771019268745755792758464310261659699707675018e-17, /* logim[65] */ -1.40230272425562150522506576584140991296902734870694e-33, /* logil[65] */ } , { 1.31958770751953125000000000000000000000000000000000e+00, /* r[66] */ -2.77319345020877350282972884087939746677875518798828e-01, /* logih[66] */ 7.44521346975934828880026635948320543669274837358637e-18, /* logim[66] */ -5.41922476182319969711469733445405189836277342215443e-34, /* logil[66] */ } , { 1.31282043457031250000000000000000000000000000000000e+00, /* r[67] */ -2.72177826311169102080356196893262676894664764404297e-01, /* logih[67] */ -1.94604737767255604321061638736698666324990178271015e-17, /* logim[67] */ 4.93318792723831633917605655356651628446409622108869e-34, /* logil[67] */ } , { 1.30612254142761230468750000000000000000000000000000e+00, /* r[68] */ -2.67062856029558426396164350080653093755245208740234e-01, /* logih[68] */ 1.42676910305707233200559864526771082234384991613068e-17, /* logim[68] */ 9.40874014190123375853921812584677628111272401841540e-34, /* logil[68] */ } , { 1.29949235916137695312500000000000000000000000000000e+00, /* r[69] */ -2.61973695252477101202970288795768283307552337646484e-01, /* logih[69] */ -1.59130185496344773949627658712806321021374170989957e-17, /* logim[69] */ 2.05966526658843352548575822504612882857523370085076e-34, /* logil[69] */ } , { 1.29292941093444824218750000000000000000000000000000e+00, /* r[70] */ -2.56910505054635363020310023784986697137355804443359e-01, /* logih[70] */ -2.32939629151451727444770801596466641031683815428509e-17, /* logim[70] */ -1.43942742464573220634874496721239465737503205324375e-33, /* logil[70] */ } , { 1.28643226623535156250000000000000000000000000000000e+00, /* r[71] */ -2.51872701711453261808060233306605368852615356445312e-01, /* logih[71] */ -2.58573188266130078596915247890597291360969537163785e-17, /* logim[71] */ 3.36064630885731507350249551263037246653963144676932e-34, /* logil[71] */ } , { 1.27999997138977050781250000000000000000000000000000e+00, /* r[72] */ -2.46860055579783743695543307694606482982635498046875e-01, /* logih[72] */ -1.36174299951708605118822966558244798958741114531493e-17, /* logim[72] */ -8.23883896198784591738914635896001757021238114385808e-35, /* logil[72] */ } , { 1.27363181114196777343750000000000000000000000000000e+00, /* r[73] */ -2.41872513137422084916750009142560884356498718261719e-01, /* logih[73] */ -2.91827950997726014268071786281330008614392694540440e-18, /* logim[73] */ 8.66387628958027677722140876839269007945711340420961e-35, /* logil[73] */ } , { 1.26732683181762695312500000000000000000000000000000e+00, /* r[74] */ -2.36909825309450927655063878773944452404975891113281e-01, /* logih[74] */ 4.97049401191734143236484721843489954792294974449682e-18, /* logim[74] */ 2.12212094628219632031384179435720857347529888567725e-34, /* logil[74] */ } , { 1.26108384132385253906250000000000000000000000000000e+00, /* r[75] */ -2.31971542737545860513037609962339047342538833618164e-01, /* logih[75] */ 1.20064411563385414488688519726171456939870706105353e-17, /* logim[75] */ -5.20241965000144345106493348505238495111737026311766e-34, /* logil[75] */ } , { 1.25490188598632812500000000000000000000000000000000e+00, /* r[76] */ -2.27057391030699523559732710964453872293233871459961e-01, /* logih[76] */ -9.55134517665639461592830714479938653876650013848813e-18, /* logim[76] */ -7.00052160915705629865262646818211330004502638341784e-34, /* logil[76] */ } , { 1.24878048896789550781250000000000000000000000000000e+00, /* r[77] */ -2.22167466272476882283015697794326115399599075317383e-01, /* logih[77] */ 1.12308837854924459441805420173945034636561801020789e-17, /* logim[77] */ 1.05992689326800868505291338111574353445179905470698e-34, /* logil[77] */ } , { 1.24271845817565917968750000000000000000000000000000e+00, /* r[78] */ -2.17301285003207084178811214769666548818349838256836e-01, /* logih[78] */ -1.37599098464784711367545798871014398359913153389606e-17, /* logim[78] */ -5.44676947016522950876420214713413739910691265570885e-34, /* logil[78] */ } , { 1.23671507835388183593750000000000000000000000000000e+00, /* r[79] */ -2.12458734101899110457978281374380458146333694458008e-01, /* logih[79] */ 3.12575020468223244847667531342710056704202576314513e-18, /* logim[79] */ 1.27082738610098894087384580413567050181540844264548e-35, /* logil[79] */ } , { 1.23076915740966796875000000000000000000000000000000e+00, /* r[80] */ -2.07639305173597937814733427330793347209692001342773e-01, /* logih[80] */ -1.20531726306040366742269494142059745690218464556184e-17, /* logim[80] */ 3.33883514126655983920316543317695602289579500921493e-34, /* logil[80] */ } , { 1.22488045692443847656250000000000000000000000000000e+00, /* r[81] */ -2.02843253050716987306856253781006671488285064697266e-01, /* logih[81] */ -1.66453566992001313940518505696243672056063400746100e-18, /* logim[81] */ 2.78446239404510241881587234176263335863162887428131e-35, /* logil[81] */ } , { 1.21904754638671875000000000000000000000000000000000e+00, /* r[82] */ -1.98069854157447239328959653903439175337553024291992e-01, /* logih[82] */ -3.74277289637934596837745314540095849706853736054736e-18, /* logim[82] */ 2.20940287174632344749918330821286328950105212564345e-34, /* logil[82] */ } , { 1.21327018737792968750000000000000000000000000000000e+00, /* r[83] */ -1.93319348256398265695210625381150748580694198608398e-01, /* logih[83] */ -4.63045754803609100012916107813305239709411987466506e-18, /* logim[83] */ 3.81311992624323390610440652445847060246376140730432e-34, /* logil[83] */ } , { 1.20754718780517578125000000000000000000000000000000e+00, /* r[84] */ -1.88591184708711112616441596401273272931575775146484e-01, /* logih[84] */ 7.43216311628945500204739783937941202296964434266492e-18, /* logim[84] */ -4.02931080995428730719681936637527024502063366412999e-34, /* logil[84] */ } , { 1.20187783241271972656250000000000000000000000000000e+00, /* r[85] */ -1.83885194019779485419263664880418218672275543212891e-01, /* logih[85] */ 4.12613043545869607985270580107985887836449099592842e-18, /* logim[85] */ -1.13080344207561908198013613253456946184091830340475e-34, /* logil[85] */ } , { 1.19626164436340332031250000000000000000000000000000e+00, /* r[86] */ -1.79201397792742966874612875471939332783222198486328e-01, /* logih[86] */ 1.25197515140082668570664893296659406065442168045883e-17, /* logim[86] */ 2.08673445558311131685127966451011169090072111640797e-34, /* logil[86] */ } , { 1.19069766998291015625000000000000000000000000000000e+00, /* r[87] */ -1.74539412626609380385644954003510065376758575439453e-01, /* logih[87] */ 8.52219781255028950312107624449830634785785378861392e-18, /* logim[87] */ 5.46720442033771639415150684633589460164820712880324e-34, /* logil[87] */ } , { 1.18518519401550292968750000000000000000000000000000e+00, /* r[88] */ -1.69899044245978042555478282338299322873353958129883e-01, /* logih[88] */ 4.86800738580472456380134000450154397097303177737598e-19, /* logim[88] */ -4.48365665383134519709151659261825733866549119396251e-36, /* logil[88] */ } , { 1.17972350120544433593750000000000000000000000000000e+00, /* r[89] */ -1.65280090007780350314092743246874306350946426391602e-01, /* logih[89] */ 1.05991222445546499578510819426998369466676418510398e-18, /* logim[89] */ 2.15535973016890499002202117947684925307171077322261e-36, /* logil[89] */ } , { 1.17431187629699707031250000000000000000000000000000e+00, /* r[90] */ -1.60682338849634120947484916541725397109985351562500e-01, /* logih[90] */ 5.38493323815703006679696841052856196024573538758454e-18, /* logim[90] */ 1.60200163876329179080224417109933041789065267300895e-34, /* logil[90] */ } , { 1.16894984245300292968750000000000000000000000000000e+00, /* r[91] */ -1.56105775199027185795586092353914864361286163330078e-01, /* logih[91] */ 1.32405772531609804709122583998125231935523184710352e-17, /* logim[91] */ 4.88933388697666736600942679327919927438390701656817e-35, /* logil[91] */ } , { 1.16363644599914550781250000000000000000000000000000e+00, /* r[92] */ -1.51549968907714105448292229993967339396476745605469e-01, /* logih[92] */ 1.77181633478899593214922561799512844823326841018122e-18, /* logim[92] */ 5.44951453107128861626798538797020344311568819287008e-35, /* logil[92] */ } , { 1.15837097167968750000000000000000000000000000000000e+00, /* r[93] */ -1.47014683357163111754317696977523155510425567626953e-01, /* logih[93] */ 4.46701777108311388441189058844554903695616000674812e-18, /* logim[93] */ -1.53168389834566630100313932781112142055948393405761e-34, /* logil[93] */ } , { 1.15315318107604980468750000000000000000000000000000e+00, /* r[94] */ -1.42500086821669674774781810810964088886976242065430e-01, /* logih[94] */ -2.21668083020505832726646787146199970227457581911830e-18, /* logim[94] */ -4.73140768447350921077611938776759805597533720242102e-36, /* logil[94] */ } , { 1.14798212051391601562500000000000000000000000000000e+00, /* r[95] */ -1.38005723310861472263866289722500368952751159667969e-01, /* logih[95] */ -9.06035372834454229539393713977175584764482079542462e-18, /* logim[95] */ -6.58482110068426815722709702700082916058774211791842e-34, /* logil[95] */ } , { 1.14285707473754882812500000000000000000000000000000e+00, /* r[96] */ -1.33531333019876075063336884340969845652580261230469e-01, /* logih[96] */ 3.66452824974217778950176131406293356640863401093569e-18, /* logim[96] */ 6.15050085774566840615703784135477182311292227710416e-35, /* logil[96] */ } , { 1.13777780532836914062500000000000000000000000000000e+00, /* r[97] */ -1.29077066489528990977930789085803553462028503417969e-01, /* logih[97] */ 7.97904258955058431558707127373439732289437010877585e-19, /* logim[97] */ -4.72584148771245137732808879600361038781792271619664e-35, /* logil[97] */ } , { 1.13274335861206054687500000000000000000000000000000e+00, /* r[98] */ -1.24642441481986290807704165217728586867451667785645e-01, /* logih[98] */ -1.12998120773332791412288663337308123303520797473827e-18, /* logim[98] */ 5.04751909879024305911295754405025108738663901055449e-35, /* logil[98] */ } , { 1.12775325775146484375000000000000000000000000000000e+00, /* r[99] */ -1.20227386019965673535914163494453532621264457702637e-01, /* logih[99] */ -4.10132123403305460439841682733159064509468253505934e-18, /* logim[99] */ 1.89802934268459828223199224893946334512039168636632e-34, /* logil[99] */ } , { 1.12280702590942382812500000000000000000000000000000e+00, /* r[100] */ -1.15831822975702269928888199501670897006988525390625e-01, /* logih[100] */ -4.33848450767153009712329850176816190393287866962401e-18, /* logim[100] */ -3.16979691573058896647113947407157157214490081484725e-34, /* logil[100] */ } , { 1.11790394783020019531250000000000000000000000000000e+00, /* r[101] */ -1.11455456757806464773707944004854653030633926391602e-01, /* logih[101] */ -5.25227837292521929481451677551514755953859335394548e-18, /* logim[101] */ -1.35455162271740897316919848287529722248286557667632e-34, /* logil[101] */ } , { 1.11304354667663574218750000000000000000000000000000e+00, /* r[102] */ -1.07098197023655139492603893813793547451496124267578e-01, /* logih[102] */ 3.47169710366632825350486634041554320998659998614468e-18, /* logim[102] */ 4.16291803858237783591365989446195611338780307382474e-35, /* logil[102] */ } , { 1.10822510719299316406250000000000000000000000000000e+00, /* r[103] */ -1.02759733026446364867467764270259067416191101074219e-01, /* logih[103] */ 5.14131173582414775653668171432178439238499706689565e-18, /* logim[103] */ -2.03511710633920722432014459953905354472733979743122e-34, /* logil[103] */ } , { 1.10344839096069335937500000000000000000000000000000e+00, /* r[104] */ -9.84401771213754411826712953370588365942239761352539e-02, /* logih[104] */ 4.43863133643792238822177111529042861410430977956950e-18, /* logim[104] */ 3.12055863098469149547827014037274497005231280699218e-34, /* logil[104] */ } , { 1.09871244430541992187500000000000000000000000000000e+00, /* r[105] */ -9.41389890512167593072945237508974969387054443359375e-02, /* logih[105] */ 2.37342936135295683496202513568031672884920488134173e-19, /* logim[105] */ 2.33721773003055253003147894270712826153088420940698e-35, /* logil[105] */ } , { 1.09401702880859375000000000000000000000000000000000e+00, /* r[106] */ -8.98562695172144959565585509153606835752725601196289e-02, /* logih[106] */ 6.27446602451052736319026996501069657057280086335290e-19, /* logim[106] */ -3.52284010127094716016693656249620808330731317587528e-35, /* logil[106] */ } , { 1.08936166763305664062500000000000000000000000000000e+00, /* r[107] */ -8.55918986704354706196440361054555978626012802124023e-02, /* logih[107] */ -5.03513826084130895904008327416965851388338774947593e-18, /* logim[107] */ 6.86424026896698901114373288904478288437409959196820e-35, /* logil[107] */ } , { 1.08474564552307128906250000000000000000000000000000e+00, /* r[108] */ -8.13455314205279167438789045263547450304031372070312e-02, /* logih[108] */ 1.86223784192593707654359268192644483006930996779864e-18, /* logim[108] */ -9.08215611660981343459991418247070342987317386688394e-35, /* logil[108] */ } , { 1.08016872406005859375000000000000000000000000000000e+00, /* r[109] */ -7.71172549156562414651716608204878866672515869140625e-02, /* logih[109] */ 4.37349590112793692636976332290601524356283649435490e-18, /* logim[109] */ -2.43638510650083687411626047741666976256819270953612e-34, /* logil[109] */ } , { 1.07563018798828125000000000000000000000000000000000e+00, /* r[110] */ -7.29067112034412351251333461732428986579179763793945e-02, /* logih[110] */ 6.30693084361487082247322771068486204374546343933133e-18, /* logim[110] */ 3.44825082371128400572272238979928316738696119124015e-34, /* logil[110] */ } , { 1.07112979888916015625000000000000000000000000000000e+00, /* r[111] */ -6.87139782297249979148290321973036043345928192138672e-02, /* logih[111] */ -4.40922228882126717948257852084234011599535648658716e-18, /* logim[111] */ 2.00071285755297414487130516445636815235532199087333e-34, /* logil[111] */ } , { 1.06666660308837890625000000000000000000000000000000e+00, /* r[112] */ -6.45384615329246263959461771264614071696996688842773e-02, /* logih[112] */ 6.47055724777502681297997296903095954212491541204973e-18, /* logim[112] */ -3.53995576621708408093066388957026321212073337996708e-34, /* logil[112] */ } , { 1.06224060058593750000000000000000000000000000000000e+00, /* r[113] */ -6.03804513842609302809449900450999848544597625732422e-02, /* logih[113] */ 2.15703432342306119511642925211564389619524247753812e-18, /* logim[113] */ -3.99051054966201464148223117427430962485432571249835e-35, /* logil[113] */ } , { 1.05785131454467773437500000000000000000000000000000e+00, /* r[114] */ -5.62397891033892469159205518280941760167479515075684e-02, /* logih[114] */ 3.28339677990388790029372693220459728960401288179580e-18, /* logim[114] */ 1.51915205677141595589208947882243470550543557886170e-35, /* logil[114] */ } , { 1.05349802970886230468750000000000000000000000000000e+00, /* r[115] */ -5.21160840267197236763685452842764789238572120666504e-02, /* logih[115] */ -2.76876652450490527514912306264172616345243137067863e-19, /* logim[115] */ 4.97747635693761803951848478678221385327287067714555e-36, /* logil[115] */ } , { 1.04918026924133300781250000000000000000000000000000e+00, /* r[116] */ -4.80091633070045681330739739678392652422189712524414e-02, /* logih[116] */ -1.43903217358996287866324353045636173989420593009940e-18, /* logim[116] */ 9.24533961563047616614044310774847027299245259235749e-35, /* logil[116] */ } , { 1.04489803314208984375000000000000000000000000000000e+00, /* r[117] */ -4.39193047153486545997047585387917933985590934753418e-02, /* logih[117] */ -1.76247347066130256555880115492006953917590179181782e-18, /* logim[117] */ 2.95067167680037492936848210009098107643918346324819e-35, /* logil[117] */ } , { 1.04065036773681640625000000000000000000000000000000e+00, /* r[118] */ -3.98458712942959952796329048396728467196226119995117e-02, /* logih[118] */ 3.12956491324511750770873688790894657687633404551217e-18, /* logim[118] */ 9.08530842942513514982993220469010912494881545842223e-35, /* logil[118] */ } , { 1.03643727302551269531250000000000000000000000000000e+00, /* r[119] */ -3.57891329972944774451271143789199413731694221496582e-02, /* logih[119] */ -2.94786708868720304892365707065135221787713948130908e-19, /* logim[119] */ 1.84384763058385810856389175018656477977822636794864e-35, /* logil[119] */ } , { 1.03225803375244140625000000000000000000000000000000e+00, /* r[120] */ -3.17486685122574663342476242178236134350299835205078e-02, /* logih[120] */ -3.03821748520802146852642560679641488082417537178322e-18, /* logim[120] */ 6.90127669441551609256721347857289051065660383455449e-35, /* logil[120] */ } , { 1.02811241149902343750000000000000000000000000000000e+00, /* r[121] */ -2.77245107619511835239656249996187398210167884826660e-02, /* logih[121] */ 1.56537436220084983093655029081028016172956628311065e-18, /* logim[121] */ -4.26959324792631463690822650182944301609062827136870e-35, /* logil[121] */ } , { 1.02399992942810058593750000000000000000000000000000e+00, /* r[122] */ -2.37164576994431455791989549197751330211758613586426e-02, /* logih[122] */ -1.57190014657555079881764699090245893269914973184857e-19, /* logim[122] */ 4.62721637019171363059082221740445258999073602747011e-36, /* logil[122] */ } , { 1.01992034912109375000000000000000000000000000000000e+00, /* r[123] */ -1.97245351501005340699723689112943247891962528228760e-02, /* logih[123] */ 1.34458916305708123412045028332259969564528051018263e-18, /* logim[123] */ -6.02768376061644464555810636396264987280148524662430e-35, /* logil[123] */ } , { 1.01587295532226562500000000000000000000000000000000e+00, /* r[124] */ -1.57482973634926158579272481574662378989160060882568e-02, /* logih[124] */ -1.00208727697080412925749596659626020152032796409604e-18, /* logim[124] */ 7.75790823155383991507800579878754988160969197338737e-35, /* logil[124] */ } , { 1.01185774803161621093750000000000000000000000000000e+00, /* r[125] */ -1.17879957989121472716753658005472971126437187194824e-02, /* logih[125] */ 2.12843993900806841444093729096134188145078357457959e-19, /* logim[125] */ -7.36236149534638490756917054603187520349493909791838e-36, /* logil[125] */ } , { 1.00787401199340820312500000000000000000000000000000e+00, /* r[126] */ -7.84317373573558719590526067122482345439493656158447e-03, /* logih[126] */ -2.76470798179560918828283984091643257584228907545928e-19, /* logim[126] */ 1.46121103426200283031313413564673422143931331178612e-35, /* logil[126] */ } , { 1.00392150878906250000000000000000000000000000000000e+00, /* r[127] */ -3.91383971648977691676352108629544090945273637771606e-03, /* logih[127] */ -4.28019276224719221462393891683495367484578724177817e-19, /* logim[127] */ -2.25272542183557712010826889962617244762256960750126e-35, /* logil[127] */ } }; interval-2.1.0/src/crlibm/log1p.c0000644000000000000000000011237613031036767014731 0ustar 00000000000000/* * Correctly rounded log1p(x) = log(1 + x) * * Author : Christoph Lauter (ENS Lyon) * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" #include "log-td.h" #define AVOID_FMA 0 void log1p_td_accurate(double *logh, double *logm, double *logl, double ed, int index, double zh, double zm, double zl, double logih, double logim) { double highPoly, t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, t8h, t8l, t9h, t9l, t10h, t10l, t11h, t11l; double t12h, t12l, t13h, t13l, t14h, t14l, zSquareh, zSquarem, zSquarel, zCubeh, zCubem, zCubel, higherPolyMultZh, higherPolyMultZm; double higherPolyMultZl, zSquareHalfh, zSquareHalfm, zSquareHalfl, polyWithSquareh, polyWithSquarem, polyWithSquarel; double polyh, polym, polyl, logil, logyh, logym, logyl, loghover, logmover, loglover, log2edhover, log2edmover, log2edlover; double log2edh, log2edm, log2edl; #if EVAL_PERF crlibm_second_step_taken++; #endif /* Accurate phase: Argument reduction is already done. We must return logh, logm and logl representing the intermediate result in 118 bits precision. We use a 14 degree polynomial, computing the first 3 (the first is 0) coefficients in triple double, calculating the next 7 coefficients in double double arithmetics and the last in double. */ /* Start of the horner scheme */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(accPolyC14,zh,accPolyC13),zh,accPolyC12),zh,accPolyC11),zh,accPolyC10); #else highPoly = accPolyC10 + zh * (accPolyC11 + zh * (accPolyC12 + zh * (accPolyC13 + zh * accPolyC14))); #endif /* We want to write accPolyC3 + zh * (accPoly4 + zh * (accPoly5 + zh * (accPoly6 + zh * (accPoly7 + zh * (accPoly8 + zh * (accPoly9 + zh * highPoly)))))); ( t14 t13 t12 t11 t10 t9 t8 t7 t6 t5 t4 t3 t2 t1 ) with all additions and multiplications in double double arithmetics but we will produce intermediate results labelled t1h/t1l thru t14h/t14l */ Mul12(&t1h, &t1l, zh, highPoly); Add22(&t2h, &t2l, accPolyC9h, accPolyC9l, t1h, t1l); Mul22(&t3h, &t3l, zh, zm, t2h, t2l); Add22(&t4h, &t4l, accPolyC8h, accPolyC8l, t3h, t3l); Mul22(&t5h, &t5l, zh, zm, t4h, t4l); Add22(&t6h, &t6l, accPolyC7h, accPolyC7l, t5h, t5l); Mul22(&t7h, &t7l, zh, zm, t6h, t6l); Add22(&t8h, &t8l, accPolyC6h, accPolyC6l, t7h, t7l); Mul22(&t9h, &t9l, zh, zm, t8h, t8l); Add22(&t10h, &t10l, accPolyC5h, accPolyC5l, t9h, t9l); Mul22(&t11h, &t11l, zh, zm, t10h, t10l); Add22(&t12h, &t12l, accPolyC4h, accPolyC4l, t11h, t11l); Mul22(&t13h, &t13l, zh, zm, t12h, t12l); Add22(&t14h, &t14l, accPolyC3h, accPolyC3l, t13h, t13l); /* We must now prepare (zh + zm)^2 and (zh + zm)^3 as triple doubles */ Mul33(&zSquareh, &zSquarem, &zSquarel, zh, zm, zl, zh, zm, zl); Mul33(&zCubeh, &zCubem, &zCubel, zh, zm, zl, zSquareh, zSquarem, zSquarel); /* We can now multiplicate the middle and higher polynomial by z^3 */ Mul233(&higherPolyMultZh, &higherPolyMultZm, &higherPolyMultZl, t14h, t14l, zCubeh, zCubem, zCubel); /* Multiply now z^2 by -1/2 (exact op) and add to middle and higher polynomial */ zSquareHalfh = zSquareh * -0.5; zSquareHalfm = zSquarem * -0.5; zSquareHalfl = zSquarel * -0.5; Add33(&polyWithSquareh, &polyWithSquarem, &polyWithSquarel, zSquareHalfh, zSquareHalfm, zSquareHalfl, higherPolyMultZh, higherPolyMultZm, higherPolyMultZl); /* Add now zh and zm to obtain the polynomial evaluation result */ Add33(&polyh, &polym, &polyl, zh, zm, zl, polyWithSquareh, polyWithSquarem, polyWithSquarel); /* Reconstruct now log(y) = log(1 + z) - log(ri) by adding logih, logim, logil logil has not been read to the time, do this first */ logil = argredtable[index].logil; Add33(&logyh, &logym, &logyl, logih, logim, logil, polyh, polym, polyl); /* Multiply log2 with E, i.e. log2h, log2m, log2l by ed ed is always less than 2^(12) and log2h and log2m are stored with at least 12 trailing zeros So multiplying naively is correct (up to 134 bits at least) The final result is thus obtained by adding log2 * E to log(y) */ log2edhover = log2h * ed; log2edmover = log2m * ed; log2edlover = log2l * ed; /* It may be necessary to renormalize the tabulated value (multiplied by ed) before adding the to the log(y)-result If needed, uncomment the following Renormalize3-Statement and comment out the copies following it. */ /* Renormalize3(&log2edh, &log2edm, &log2edl, log2edhover, log2edmover, log2edlover); */ log2edh = log2edhover; log2edm = log2edmover; log2edl = log2edlover; Add33(&loghover, &logmover, &loglover, log2edh, log2edm, log2edl, logyh, logym, logyl); /* Since we can not guarantee in each addition and multiplication procedure that the results are not overlapping, we must renormalize the result before handing it over to the final rounding */ Renormalize3(logh,logm,logl,loghover,logmover,loglover); } /************************************************************* ************************************************************* * ROUNDED TO NEAREST * ************************************************************* *************************************************************/ double log1p_rn(double x){ db_number xdb, shdb, scaledb; double yh, yl, ed, ri, logih, logim, yhrih, yhril, ylri, t1, t2, t3, t4, t5, t6, zh, zm, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, logl, roundcst; double sh, sl; int E, index; xdb.d=x; /* Filter cases */ if ((xdb.i[HI] & 0x7fffffff) < 0x3c900000) { /* We are less than 2^(-54) and return simply an adjusted x This captures also the algebraic case x = 0 */ return x; } if (((xdb.i[HI] & 0x80000000) != 0) && ((xdb.i[HI] & 0x7fffffff) >= 0x3ff00000)) { /* We are less or equal than -1 (-inf and NaN, too), we return -inf for -1 and NaN otherwise */ if (x == -1.0) return x/0.0; return (x-x)/0.0; } if ((xdb.i[HI] & 0x7ff00000) == 0x7ff00000) { /* We are +inf or NaN If +inf, we return +inf (x+x) If NaN, we return NaN (x+x) */ return x+x; } /* Test if |x| < 2^(-8) If yes, short-circuit the range reduction */ if ((xdb.i[HI] & 0x7fffffff) < 0x3f700000) { /* Use the polynomial p(zh + zl) approximating log(1+zh+zl) directly Set E and index to values that read 0.0 in the accurate phase. */ logih = 0.0; logim = 0.0; index = 0; ed = 0.0; index = 0; zh = x; zm = 0.0; zl = 0.0; } else { /* If we are here, |x| >= 2^(-8) and we must perform range reduction */ /* Compute first exactly sh + sl = 1 + x x can move over 1, so use a conditional Add12 */ Add12Cond(sh,sl,1.0,x); /* Transform higher order double to integer */ shdb.d = sh; /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E = 0; E += (shdb.i[HI]>>20)-1023; /* extract the exponent */ index = (shdb.i[HI] & 0x000fffff); shdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ shdb.i[HI] -= 0x00100000; E++; } /* Transform shdb to yh */ yh = shdb.d; /* Compute the index to the table */ index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Test if we have a simple range reduction or a complicated one Simple range reduction for x < 0: x + 1 is exact, sl = 0 exactly Simple range reduction for x > 2^(125) (sh > 2^(125)): x + 1 is not exact but its error less than 2^(-125) Complicated range reduction: other cases */ if ((sl == 0.0) || (E > 125)) { /* Simple range reduction */ Mul12(&yhrih, &yhril, yh, ri); t1 = yhrih - 1.0; Add12Cond(zh, zm, t1, yhril); zl = 0.0; } else { /* Complicated range reduction; E <= 125 */ /* Scale sl accordingly to sh, from which the exponent was extracted We form first 2^(-E) and multiply sl with this value; this gives yl. */ scaledb.i[HI] = (-E + 1023) << 20; scaledb.i[LO] = 0; yl = sl * scaledb.d; /* Do complicated range reduction: zh + zm + zl = (yh + yl) * ri - 1.0 We use zh + zm in the quick phase and zh + zm + zl in the accurate phase The multiplication yl * ri is exact because yl contains at most 9 bits and ri contains at most 24 bits. The substraction yhrih - 1.0 is exact as per Sterbenz' lemma. */ Mul12(&yhrih,&yhril,yh,ri); ylri = yl * ri; t1 = yhrih - 1.0; /* The unnormalized triple-double t1 + yhril + ylri is equal to (yh + yl) * ri - 1.0 As t1 can move over yhril and yhri can move over ylri, we normalize first these values pairwise with Add12Conds. Then we renormalize the pairs by a "inverted" (A.E.) Renormalize3. */ Add12Cond(t2,t3,yhril,ylri); Add12Cond(t4,t5,t1,t2); Add12Cond(t6,zl,t3,t5); Add12Cond(zh,zm,t4,t6); } } /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zm using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zm)); Add22(&t2h, &t2l, zh, zm, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = ROUNDCST1; else roundcst = ROUNDCST2; if(logh == (logh + (logm * roundcst))) return logh; else { #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log1p_td_accurate(&logh, &logm, &logl, ed, index, zh, zm, zl, logih, logim); ReturnRoundToNearest3(logh, logm, logl); } /* Accurate phase launched */ } double log1p_ru(double x) { db_number xdb, shdb, scaledb; double yh, yl, ed, ri, logih, logim, yhrih, yhril, ylri, t1, t2, t3, t4, t5, t6, zh, zm, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, logl, roundcst; double sh, sl; int E, index; xdb.d=x; /* Filter cases */ if ((xdb.i[HI] & 0x7fffffff) < 0x3c900000) { /* We are less than 2^(-54) and return simply an adjusted x If x = 0, the result is algebraic and equal to 0. The series for log(1 + x) = x - 1/2 * x^2 + ... is alternated and converges in this interval. The truncation rest -1/2 * x^2 + 1/3 * x^3 - ... is always negative, so log(1 + x) is always less than x but less than 1 ulp of x away. We round up, so we return x. */ return x; } if (((xdb.i[HI] & 0x80000000) != 0) && ((xdb.i[HI] & 0x7fffffff) >= 0x3ff00000)) { /* We are less or equal than -1 (-inf and NaN, too), we return -inf for -1 and NaN otherwise */ if (x == -1.0) return x/0.0; return (x-x)/0.0; } if ((xdb.i[HI] & 0x7ff00000) == 0x7ff00000) { /* We are +inf or NaN If +inf, we return +inf (x+x) If NaN, we return NaN (x+x) */ return x+x; } /* Test if |x| < 2^(-8) If yes, short-circuit the range reduction */ if ((xdb.i[HI] & 0x7fffffff) < 0x3f700000) { /* Use the polynomial p(zh + zl) approximating log(1+zh+zl) directly Set E and index to values that read 0.0 in the accurate phase. */ logih = 0.0; logim = 0.0; index = 0; ed = 0.0; index = 0; zh = x; zm = 0.0; zl = 0.0; } else { /* If we are here, |x| >= 2^(-8) and we must perform range reduction */ /* Compute first exactly sh + sl = 1 + x x can move over 1, so use a conditional Add12 */ Add12Cond(sh,sl,1.0,x); /* Transform higher order double to integer */ shdb.d = sh; /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E = 0; E += (shdb.i[HI]>>20)-1023; /* extract the exponent */ index = (shdb.i[HI] & 0x000fffff); shdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ shdb.i[HI] -= 0x00100000; E++; } /* Transform shdb to yh */ yh = shdb.d; /* Compute the index to the table */ index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Test if we have a simple range reduction or a complicated one Simple range reduction for x < 0: x + 1 is exact, sl = 0 exactly Simple range reduction for x > 2^(125) (sh > 2^(125)): x + 1 is not exact but its error less than 2^(-125) Complicated range reduction: other cases */ if ((sl == 0.0) || (E > 125)) { /* Simple range reduction */ Mul12(&yhrih, &yhril, yh, ri); t1 = yhrih - 1.0; Add12Cond(zh, zm, t1, yhril); zl = 0.0; } else { /* Complicated range reduction; E <= 125 */ /* Scale sl accordingly to sh, from which the exponent was extracted We form first 2^(-E) and multiply sl with this value; this gives yl. */ scaledb.i[HI] = (-E + 1023) << 20; scaledb.i[LO] = 0; yl = sl * scaledb.d; /* Do complicated range reduction: zh + zm + zl = (yh + yl) * ri - 1.0 We use zh + zm in the quick phase and zh + zm + zl in the accurate phase The multiplication yl * ri is exact because yl contains at most 9 bits and ri contains at most 24 bits. The substraction yhrih - 1.0 is exact as per Sterbenz' lemma. */ Mul12(&yhrih,&yhril,yh,ri); ylri = yl * ri; t1 = yhrih - 1.0; /* The unnormalized triple-double t1 + yhril + ylri is equal to (yh + yl) * ri - 1.0 As t1 can move over yhril and yhri can move over ylri, we normalize first these values pairwise with Add12Conds. Then we renormalize the pairs by a "inverted" (A.E.) Renormalize3. */ Add12Cond(t2,t3,yhril,ylri); Add12Cond(t4,t5,t1,t2); Add12Cond(t6,zl,t3,t5); Add12Cond(zh,zm,t4,t6); } } /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zm using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zm)); Add22(&t2h, &t2l, zh, zm, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = RDROUNDCST1; else roundcst = RDROUNDCST2; TEST_AND_RETURN_RU(logh, logm, roundcst); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log1p_td_accurate(&logh, &logm, &logl, ed, index, zh, zm, zl, logih, logim); ReturnRoundUpwards3(logh, logm, logl); } double log1p_rd(double x) { db_number xdb, shdb, scaledb; double yh, yl, ed, ri, logih, logim, yhrih, yhril, ylri, t1, t2, t3, t4, t5, t6, zh, zm, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, logl, roundcst; double sh, sl; int E, index; xdb.d=x; /* Filter cases */ if ((xdb.i[HI] & 0x7fffffff) < 0x3c900000) { /* We are less than 2^(-54) and return simply an adjusted x If x = 0, the result is algebraic and equal to 0. The series for log(1 + x) = x - 1/2 * x^2 + ... is alternated and converges in this interval. The truncation rest -1/2 * x^2 + 1/3 * x^3 - ... is always negative, so log(1 + x) is always less than x but less than 1 ulp of x away. We round down, so we return x - 1ulp; */ if (x == 0.0) return x; if (x > 0) { xdb.l--; } else { xdb.l++; } return xdb.d; } if (((xdb.i[HI] & 0x80000000) != 0) && ((xdb.i[HI] & 0x7fffffff) >= 0x3ff00000)) { /* We are less or equal than -1 (-inf and NaN, too), we return -inf for -1 and NaN otherwise */ if (x == -1.0) return x/0.0; return (x-x)/0.0; } if ((xdb.i[HI] & 0x7ff00000) == 0x7ff00000) { /* We are +inf or NaN If +inf, we return +inf (x+x) If NaN, we return NaN (x+x) */ return x+x; } /* Test if |x| < 2^(-8) If yes, short-circuit the range reduction */ if ((xdb.i[HI] & 0x7fffffff) < 0x3f700000) { /* Use the polynomial p(zh + zl) approximating log(1+zh+zl) directly Set E and index to values that read 0.0 in the accurate phase. */ logih = 0.0; logim = 0.0; index = 0; ed = 0.0; index = 0; zh = x; zm = 0.0; zl = 0.0; } else { /* If we are here, |x| >= 2^(-8) and we must perform range reduction */ /* Compute first exactly sh + sl = 1 + x x can move over 1, so use a conditional Add12 */ Add12Cond(sh,sl,1.0,x); /* Transform higher order double to integer */ shdb.d = sh; /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E = 0; E += (shdb.i[HI]>>20)-1023; /* extract the exponent */ index = (shdb.i[HI] & 0x000fffff); shdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ shdb.i[HI] -= 0x00100000; E++; } /* Transform shdb to yh */ yh = shdb.d; /* Compute the index to the table */ index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Test if we have a simple range reduction or a complicated one Simple range reduction for x < 0: x + 1 is exact, sl = 0 exactly Simple range reduction for x > 2^(125) (sh > 2^(125)): x + 1 is not exact but its error less than 2^(-125) Complicated range reduction: other cases */ if ((sl == 0.0) || (E > 125)) { /* Simple range reduction */ Mul12(&yhrih, &yhril, yh, ri); t1 = yhrih - 1.0; Add12Cond(zh, zm, t1, yhril); zl = 0.0; } else { /* Complicated range reduction; E <= 125 */ /* Scale sl accordingly to sh, from which the exponent was extracted We form first 2^(-E) and multiply sl with this value; this gives yl. */ scaledb.i[HI] = (-E + 1023) << 20; scaledb.i[LO] = 0; yl = sl * scaledb.d; /* Do complicated range reduction: zh + zm + zl = (yh + yl) * ri - 1.0 We use zh + zm in the quick phase and zh + zm + zl in the accurate phase The multiplication yl * ri is exact because yl contains at most 9 bits and ri contains at most 24 bits. The substraction yhrih - 1.0 is exact as per Sterbenz' lemma. */ Mul12(&yhrih,&yhril,yh,ri); ylri = yl * ri; t1 = yhrih - 1.0; /* The unnormalized triple-double t1 + yhril + ylri is equal to (yh + yl) * ri - 1.0 As t1 can move over yhril and yhri can move over ylri, we normalize first these values pairwise with Add12Conds. Then we renormalize the pairs by a "inverted" (A.E.) Renormalize3. */ Add12Cond(t2,t3,yhril,ylri); Add12Cond(t4,t5,t1,t2); Add12Cond(t6,zl,t3,t5); Add12Cond(zh,zm,t4,t6); } } /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zm using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zm)); Add22(&t2h, &t2l, zh, zm, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = RDROUNDCST1; else roundcst = RDROUNDCST2; TEST_AND_RETURN_RD(logh, logm, roundcst); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log1p_td_accurate(&logh, &logm, &logl, ed, index, zh, zm, zl, logih, logim); ReturnRoundDownwards3(logh, logm, logl); } double log1p_rz(double x) { db_number xdb, shdb, scaledb; double yh, yl, ed, ri, logih, logim, yhrih, yhril, ylri, t1, t2, t3, t4, t5, t6, zh, zm, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, logl, roundcst; double sh, sl; int E, index; xdb.d=x; /* Filter cases */ if ((xdb.i[HI] & 0x7fffffff) < 0x3c900000) { /* We are less than 2^(-54) and return simply an adjusted x If x = 0, the result is algebraic and equal to 0. The series for log(1 + x) = x - 1/2 * x^2 + ... is alternated and converges in this interval. The truncation rest -1/2 * x^2 + 1/3 * x^3 - ... is always negative, so log(1 + x) is always less than x but less than 1 ulp of x away. For x < 0, we have log(1 + x) < 0, so we round up and return x; For x > 0, we round down and return x - 1ulp */ if (x > 0) { xdb.l--; return xdb.d; } /* Algebraic case x == 0.0 and round up */ return x; } if (((xdb.i[HI] & 0x80000000) != 0) && ((xdb.i[HI] & 0x7fffffff) >= 0x3ff00000)) { /* We are less or equal than -1 (-inf and NaN, too), we return -inf for -1 and NaN otherwise */ if (x == -1.0) return x/0.0; return (x-x)/0.0; } if ((xdb.i[HI] & 0x7ff00000) == 0x7ff00000) { /* We are +inf or NaN If +inf, we return +inf (x+x) If NaN, we return NaN (x+x) */ return x+x; } /* Test if |x| < 2^(-8) If yes, short-circuit the range reduction */ if ((xdb.i[HI] & 0x7fffffff) < 0x3f700000) { /* Use the polynomial p(zh + zl) approximating log(1+zh+zl) directly Set E and index to values that read 0.0 in the accurate phase. */ logih = 0.0; logim = 0.0; index = 0; ed = 0.0; index = 0; zh = x; zm = 0.0; zl = 0.0; } else { /* If we are here, |x| >= 2^(-8) and we must perform range reduction */ /* Compute first exactly sh + sl = 1 + x x can move over 1, so use a conditional Add12 */ Add12Cond(sh,sl,1.0,x); /* Transform higher order double to integer */ shdb.d = sh; /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E = 0; E += (shdb.i[HI]>>20)-1023; /* extract the exponent */ index = (shdb.i[HI] & 0x000fffff); shdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ shdb.i[HI] -= 0x00100000; E++; } /* Transform shdb to yh */ yh = shdb.d; /* Compute the index to the table */ index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Test if we have a simple range reduction or a complicated one Simple range reduction for x < 0: x + 1 is exact, sl = 0 exactly Simple range reduction for x > 2^(125) (sh > 2^(125)): x + 1 is not exact but its error less than 2^(-125) Complicated range reduction: other cases */ if ((sl == 0.0) || (E > 125)) { /* Simple range reduction */ Mul12(&yhrih, &yhril, yh, ri); t1 = yhrih - 1.0; Add12Cond(zh, zm, t1, yhril); zl = 0.0; } else { /* Complicated range reduction; E <= 125 */ /* Scale sl accordingly to sh, from which the exponent was extracted We form first 2^(-E) and multiply sl with this value; this gives yl. */ scaledb.i[HI] = (-E + 1023) << 20; scaledb.i[LO] = 0; yl = sl * scaledb.d; /* Do complicated range reduction: zh + zm + zl = (yh + yl) * ri - 1.0 We use zh + zm in the quick phase and zh + zm + zl in the accurate phase The multiplication yl * ri is exact because yl contains at most 9 bits and ri contains at most 24 bits. The substraction yhrih - 1.0 is exact as per Sterbenz' lemma. */ Mul12(&yhrih,&yhril,yh,ri); ylri = yl * ri; t1 = yhrih - 1.0; /* The unnormalized triple-double t1 + yhril + ylri is equal to (yh + yl) * ri - 1.0 As t1 can move over yhril and yhri can move over ylri, we normalize first these values pairwise with Add12Conds. Then we renormalize the pairs by a "inverted" (A.E.) Renormalize3. */ Add12Cond(t2,t3,yhril,ylri); Add12Cond(t4,t5,t1,t2); Add12Cond(t6,zl,t3,t5); Add12Cond(zh,zm,t4,t6); } } /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zm using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zm)); Add22(&t2h, &t2l, zh, zm, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = RDROUNDCST1; else roundcst = RDROUNDCST2; TEST_AND_RETURN_RZ(logh, logm, roundcst); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log1p_td_accurate(&logh, &logm, &logl, ed, index, zh, zm, zl, logih, logim); ReturnRoundTowardsZero3(logh, logm, logl); } interval-2.1.0/src/crlibm/log2-td.c0000644000000000000000000014160213031036767015151 0ustar 00000000000000/* * This function computes log2, correctly rounded, * using experimental techniques based on triple double arithmetics THIS IS EXPERIMENTAL SOFTWARE * * Author : Christoph Lauter * christoph.lauter at ens-lyon.fr * To have it replace the crlibm log2, do: gcc -DHAVE_CONFIG_H -I. -fPIC -O2 -c log2-td.c; mv log2-td.o log2_accurate.o; make */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" #include "log2-td.h" #ifdef BUILD_INTERVAL_FUNCTIONS #include "interval.h" #endif #define AVOID_FMA 0 void log2_td_accurate(double *logb2h, double *logb2m, double *logb2l, int E, double ed, int index, double zh, double zl, double logih, double logim) { double highPoly, t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, t8h, t8l, t9h, t9l, t10h, t10l, t11h, t11l; double t12h, t12l, t13h, t13l, t14h, t14l, zSquareh, zSquarem, zSquarel, zCubeh, zCubem, zCubel, higherPolyMultZh, higherPolyMultZm; double higherPolyMultZl, zSquareHalfh, zSquareHalfm, zSquareHalfl, polyWithSquareh, polyWithSquarem, polyWithSquarel; double polyh, polym, polyl, logil, logyh, logym, logyl, loghover, logmover, loglover, log2edhover, log2edmover, log2edlover; double log2edh, log2edm, log2edl, logb2hover, logb2mover, logb2lover; #if EVAL_PERF crlibm_second_step_taken++; #endif /* Accurate phase: Argument reduction is already done. We must return logh, logm and logl representing the intermediate result in 118 bits precision. We use a 14 degree polynomial, computing the first 3 (the first is 0) coefficients in triple double, calculating the next 7 coefficients in double double arithmetics and the last in double. We must account for zl starting with the monome of degree 4 (7^3 + 53 - 7 >> 118); so double double calculations won't account for it. */ /* Start of the horner scheme */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) highPoly = FMA(FMA(FMA(FMA(accPolyC14,zh,accPolyC13),zh,accPolyC12),zh,accPolyC11),zh,accPolyC10); #else highPoly = accPolyC10 + zh * (accPolyC11 + zh * (accPolyC12 + zh * (accPolyC13 + zh * accPolyC14))); #endif /* We want to write accPolyC3 + zh * (accPoly4 + zh * (accPoly5 + zh * (accPoly6 + zh * (accPoly7 + zh * (accPoly8 + zh * (accPoly9 + zh * highPoly)))))); ( t14 t13 t12 t11 t10 t9 t8 t7 t6 t5 t4 t3 t2 t1 ) with all additions and multiplications in double double arithmetics but we will produce intermediate results labelled t1h/t1l thru t14h/t14l */ Mul12(&t1h, &t1l, zh, highPoly); Add22(&t2h, &t2l, accPolyC9h, accPolyC9l, t1h, t1l); Mul22(&t3h, &t3l, zh, zl, t2h, t2l); Add22(&t4h, &t4l, accPolyC8h, accPolyC8l, t3h, t3l); Mul22(&t5h, &t5l, zh, zl, t4h, t4l); Add22(&t6h, &t6l, accPolyC7h, accPolyC7l, t5h, t5l); Mul22(&t7h, &t7l, zh, zl, t6h, t6l); Add22(&t8h, &t8l, accPolyC6h, accPolyC6l, t7h, t7l); Mul22(&t9h, &t9l, zh, zl, t8h, t8l); Add22(&t10h, &t10l, accPolyC5h, accPolyC5l, t9h, t9l); Mul22(&t11h, &t11l, zh, zl, t10h, t10l); Add22(&t12h, &t12l, accPolyC4h, accPolyC4l, t11h, t11l); Mul22(&t13h, &t13l, zh, zl, t12h, t12l); Add22(&t14h, &t14l, accPolyC3h, accPolyC3l, t13h, t13l); /* We must now prepare (zh + zl)^2 and (zh + zl)^3 as triple doubles */ Mul23(&zSquareh, &zSquarem, &zSquarel, zh, zl, zh, zl); Mul233(&zCubeh, &zCubem, &zCubel, zh, zl, zSquareh, zSquarem, zSquarel); /* We can now multiplicate the middle and higher polynomial by z^3 */ Mul233(&higherPolyMultZh, &higherPolyMultZm, &higherPolyMultZl, t14h, t14l, zCubeh, zCubem, zCubel); /* Multiply now z^2 by -1/2 (exact op) and add to middle and higher polynomial */ zSquareHalfh = zSquareh * -0.5; zSquareHalfm = zSquarem * -0.5; zSquareHalfl = zSquarel * -0.5; Add33(&polyWithSquareh, &polyWithSquarem, &polyWithSquarel, zSquareHalfh, zSquareHalfm, zSquareHalfl, higherPolyMultZh, higherPolyMultZm, higherPolyMultZl); /* Add now zh and zl to obtain the polynomial evaluation result */ Add233(&polyh, &polym, &polyl, zh, zl, polyWithSquareh, polyWithSquarem, polyWithSquarel); /* Reconstruct now log(y) = log(1 + z) - log(ri) by adding logih, logim, logil logil has not been read to the time, do this first */ logil = argredtable[index].logil; Add33(&logyh, &logym, &logyl, logih, logim, logil, polyh, polym, polyl); /* Multiply log2 with E, i.e. log2h, log2m, log2l by ed ed is always less than 2^(12) and log2h and log2m are stored with at least 12 trailing zeros So multiplying naively is correct (up to 134 bits at least) The final result is thus obtained by adding log2 * E to log(y) */ log2edhover = log2h * ed; log2edmover = log2m * ed; log2edlover = log2l * ed; /* It may be necessary to renormalize the tabulated value (multiplied by ed) before adding the to the log(y)-result If needed, uncomment the following Renormalize3-Statement and comment out the copies following it. */ /* Renormalize3(&log2edh, &log2edm, &log2edl, log2edhover, log2edmover, log2edlover); */ log2edh = log2edhover; log2edm = log2edmover; log2edl = log2edlover; Add33(&loghover, &logmover, &loglover, log2edh, log2edm, log2edl, logyh, logym, logyl); /* Change logarithm base from natural base to base 2 by multiplying */ Mul233(&logb2hover, &logb2mover, &logb2lover, log2invh, log2invl, loghover, logmover, loglover); /* Since we can not guarantee in each addition and multiplication procedure that the results are not overlapping, we must renormalize the result before handing it over to the final rounding */ Renormalize3(logb2h,logb2m,logb2l,logb2hover,logb2mover,logb2lover); } /************************************************************* ************************************************************* * ROUNDED TO NEAREST * ************************************************************* *************************************************************/ double log2_rn(double x){ db_number xdb; double y, ed, ri, logih, logim, yrih, yril, th, zh, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, roundcst; double logb2h, logb2m, logb2l; int E, index; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih, &yril, y, ri); th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zl)); Add22(&t2h, &t2l, zh, zl, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Change logarithm base from natural base to base 2 by multiplying */ Mul22(&logb2h, &logb2m, log2invh, log2invl, logh, logm); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = ROUNDCST1; else roundcst = ROUNDCST2; if(logb2h == (logb2h + (logb2m * roundcst))) return logb2h; else { #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log2_td_accurate(&logb2h, &logb2m, &logb2l, E, ed, index, zh, zl, logih, logim); ReturnRoundToNearest3(logb2h, logb2m, logb2l); } /* Accurate phase launched */ } /************************************************************* ************************************************************* * ROUNDED UPWARDS * ************************************************************* *************************************************************/ double log2_ru(double x) { db_number xdb; double y, ed, ri, logih, logim, yrih, yril, th, zh, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, roundcst; double logb2h, logb2m, logb2l; int E, index; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); /* Test now if the argument is an exact power of 2 i.e. if the mantissa is exactly 1 (0x0..0 with the implicit bit) This test is necessary for filtering out the cases where the final rounding test cannot distinguish between an exact algebraic number and a hard case to round */ if ((index | xdb.i[LO]) == 0) { /* Handle the "trivial" case for log2: The argument is an exact power of 2, return thus just the exponant of the number */ return (double) E; } xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih, &yril, y, ri); th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zl)); Add22(&t2h, &t2l, zh, zl, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Change logarithm base from natural base to base 2 by multiplying */ Mul22(&logb2h, &logb2m, log2invh, log2invl, logh, logm); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = RDROUNDCST1; else roundcst = RDROUNDCST2; TEST_AND_RETURN_RU(logb2h, logb2m, roundcst); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log2_td_accurate(&logb2h, &logb2m, &logb2l, E, ed, index, zh, zl, logih, logim); ReturnRoundUpwards3(logb2h, logb2m, logb2l); } /************************************************************* ************************************************************* * ROUNDED DOWNWARDS * ************************************************************* *************************************************************/ double log2_rd(double x) { db_number xdb; double y, ed, ri, logih, logim, yrih, yril, th, zh, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, roundcst; double logb2h, logb2m, logb2l; int E, index; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); /* Test now if the argument is an exact power of 2 i.e. if the mantissa is exactly 1 (0x0..0 with the implicit bit) This test is necessary for filtering out the cases where the final rounding test cannot distinguish between an exact algebraic number and a hard case to round */ if ((index | xdb.i[LO]) == 0) { /* Handle the "trivial" case for log2: The argument is an exact power of 2, return thus just the exponant of the number */ return (double) E; } xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih, &yril, y, ri); th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zl)); Add22(&t2h, &t2l, zh, zl, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Change logarithm base from natural base to base 2 by multiplying */ Mul22(&logb2h, &logb2m, log2invh, log2invl, logh, logm); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = RDROUNDCST1; else roundcst = RDROUNDCST2; TEST_AND_RETURN_RD(logb2h, logb2m, roundcst); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log2_td_accurate(&logb2h, &logb2m, &logb2l, E, ed, index, zh, zl, logih, logim); ReturnRoundDownwards3(logb2h, logb2m, logb2l); } /************************************************************* ************************************************************* * ROUNDED TOWARDS ZERO * ************************************************************* *************************************************************/ double log2_rz(double x) { db_number xdb; double y, ed, ri, logih, logim, yrih, yril, th, zh, zl; double polyHorner, zhSquareh, zhSquarel, polyUpper, zhSquareHalfh, zhSquareHalfl; double t1h, t1l, t2h, t2l, ph, pl, log2edh, log2edl, logTabPolyh, logTabPolyl, logh, logm, roundcst; double logb2h, logb2m, logb2l; int E, index; E=0; xdb.d=x; /* Filter cases */ if (xdb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb.i[HI] & 0x7fffffff)|xdb.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (xdb.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; xdb.d *= two52; /* make x a normal number */ } if (xdb.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); /* Test now if the argument is an exact power of 2 i.e. if the mantissa is exactly 1 (0x0..0 with the implicit bit) This test is necessary for filtering out the cases where the final rounding test cannot distinguish between an exact algebraic number and a hard case to round */ if ((index | xdb.i[LO]) == 0) { /* Handle the "trivial" case for log2: The argument is an exact power of 2, return thus just the exponant of the number */ return (double) E; } xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } y = xdb.d; index = index & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed = (double) E; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih, &yril, y, ri); th = yrih - 1.0; Add12Cond(zh, zl, th, yril); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner = FMA(FMA(FMA(FMA(c7,zh,c6),zh,c5),zh,c4),zh,c3); #else polyHorner = c3 + zh * (c4 + zh * (c5 + zh * (c6 + zh * c7))); #endif Mul12(&zhSquareh, &zhSquarel, zh, zh); polyUpper = polyHorner * (zh * zhSquareh); zhSquareHalfh = zhSquareh * -0.5; zhSquareHalfl = zhSquarel * -0.5; Add12(t1h, t1l, polyUpper, -1 * (zh * zl)); Add22(&t2h, &t2l, zh, zl, zhSquareHalfh, zhSquareHalfl); Add22(&ph, &pl, t2h, t2l, t1h, t1l); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh, log2edl, log2h * ed, log2m * ed); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh, &logTabPolyl, logih, logim, ph, pl); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh, &logm, log2edh, log2edl, logTabPolyh, logTabPolyl); /* Change logarithm base from natural base to base 2 by multiplying */ Mul22(&logb2h, &logb2m, log2invh, log2invl, logh, logm); /* Rounding test and eventual return or call to the accurate function */ if(E==0) roundcst = RDROUNDCST1; else roundcst = RDROUNDCST2; TEST_AND_RETURN_RZ(logb2h, logb2m, roundcst); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif log2_td_accurate(&logb2h, &logb2m, &logb2l, E, ed, index, zh, zl, logih, logim); ReturnRoundTowardsZero3(logb2h, logb2m, logb2l); } #ifdef BUILD_INTERVAL_FUNCTIONS interval j_log2(interval x) { interval res; double res_inf, res_sup, restemp_inf, restemp_sup; int infDone, supDone; int roundable; db_number xdb_inf; double y_inf, ed_inf, ri_inf, logih_inf, logim_inf, yrih_inf, yril_inf, th_inf, zh_inf, zl_inf; double polyHorner_inf, zhSquareh_inf, zhSquarel_inf, polyUpper_inf, zhSquareHalfh_inf, zhSquareHalfl_inf; double t1h_inf, t1l_inf, t2h_inf, t2l_inf, ph_inf, pl_inf, log2edh_inf, log2edl_inf, logTabPolyh_inf, logTabPolyl_inf, logh_inf, logm_inf, roundcst_inf; double logb2h_inf, logb2m_inf, logb2l_inf; int E_inf, index_inf; db_number xdb_sup; double y_sup, ed_sup, ri_sup, logih_sup, logim_sup, yrih_sup, yril_sup, th_sup, zh_sup, zl_sup; double polyHorner_sup, zhSquareh_sup, zhSquarel_sup, polyUpper_sup, zhSquareHalfh_sup, zhSquareHalfl_sup; double t1h_sup, t1l_sup, t2h_sup, t2l_sup, ph_sup, pl_sup, log2edh_sup, log2edl_sup, logTabPolyh_sup, logTabPolyl_sup, logh_sup, logm_sup, roundcst_sup; double logb2h_sup, logb2m_sup, logb2l_sup; int E_sup, index_sup; double x_inf, x_sup; x_inf=LOW(x); x_sup=UP(x); infDone=0; supDone=0; E_inf=0; E_sup=0; xdb_inf.d=x_inf; xdb_sup.d=x_sup; /* Filter cases */ if (xdb_inf.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb_inf.i[HI] & 0x7fffffff)|xdb_inf.i[LO])==0){ infDone=1; restemp_inf = -1.0/0.0; } /* log(+/-0) = -Inf */ if ((xdb_inf.i[HI] < 0) && (infDone==0)){ infDone=1; restemp_inf = (x_inf-x_inf)/0; /* log(-x) = Nan */ } /* Subnormal number */ E_inf = -52; xdb_inf.d *= two52; /* make x a normal number */ } if ((xdb_inf.i[HI] >= 0x7ff00000) && (infDone==0)){ infDone=1; restemp_inf = x_inf+x_inf; /* Inf or Nan */ } /* Filter cases */ if (xdb_sup.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((xdb_sup.i[HI] & 0x7fffffff)|xdb_sup.i[LO])==0){ supDone=1; restemp_sup = -1.0/0.0; } /* log(+/-0) = -Inf */ if ((xdb_sup.i[HI] < 0) && (supDone==0)){ supDone=1; restemp_sup = (x_sup-x_sup)/0; /* log(-x) = Nan */ } /* Subnormal number */ E_sup = -52; xdb_sup.d *= two52; /* make x a normal number */ } if ((xdb_sup.i[HI] >= 0x7ff00000) && (supDone==0)){ supDone=1; restemp_sup = x_sup+x_sup; /* Inf or Nan */ } /* Extract exponent and mantissa Do range reduction, yielding to E holding the exponent and y the mantissa between sqrt(2)/2 and sqrt(2) */ E_inf += (xdb_inf.i[HI]>>20)-1023; /* extract the exponent */ E_sup += (xdb_sup.i[HI]>>20)-1023; /* extract the exponent */ index_inf = (xdb_inf.i[HI] & 0x000fffff); index_sup = (xdb_sup.i[HI] & 0x000fffff); /* Test now if the argument is an exact power of 2 i.e. if the mantissa is exactly 1 (0x0..0 with the implicit bit) This test is necessary for filtering out the cases where the final rounding test cannot distinguish between an exact algebraic number and a hard case to round */ if (((index_inf | xdb_inf.i[LO]) == 0) && (infDone==0)) { /* Handle the "trivial" case for log2: The argument is an exact power of 2, return thus just the exponant of the number */ supDone=1; restemp_inf = (double) E_inf; } if (((index_sup | xdb_sup.i[LO]) == 0) && (supDone==0)) { /* Handle the "trivial" case for log2: The argument is an exact power of 2, return thus just the exponant of the number */ supDone=1; restemp_sup = (double) E_sup; } if((infDone==1) && (supDone==1)) { ASSIGN_LOW(res,restemp_inf); ASSIGN_UP(res,restemp_sup); return res; } if((infDone==0) && (supDone==0)) { xdb_inf.i[HI] = index_inf | 0x3ff00000; /* do exponent = 0 */ xdb_sup.i[HI] = index_sup | 0x3ff00000; /* do exponent = 0 */ index_inf = (index_inf + (1<<(20-L-1))) >> (20-L); index_sup = (index_sup + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index_inf >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb_inf.i[HI] -= 0x00100000; E_inf++; } if (index_sup >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb_sup.i[HI] -= 0x00100000; E_sup++; } y_inf = xdb_inf.d; y_sup = xdb_sup.d; index_inf = index_inf & INDEXMASK; index_sup = index_sup & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed_inf = (double) E_inf; ed_sup = (double) E_sup; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri_inf = argredtable[index_inf].ri; ri_sup = argredtable[index_sup].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih_inf = argredtable[index_inf].logih; logih_sup = argredtable[index_sup].logih; logim_inf = argredtable[index_inf].logim; logim_sup = argredtable[index_sup].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih_inf, &yril_inf, y_inf, ri_inf); Mul12(&yrih_sup, &yril_sup, y_sup, ri_sup); th_inf = yrih_inf - 1.0; th_sup = yrih_sup - 1.0; Add12Cond(zh_inf, zl_inf, th_inf, yril_inf); Add12Cond(zh_sup, zl_sup, th_sup, yril_sup); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner_inf = FMA(FMA(FMA(FMA(c7_inf,zh_inf,c6),zh_inf,c5),zh_inf,c4),zh_inf,c3); polyHorner_sup = FMA(FMA(FMA(FMA(c7,zh_sup,c6),zh_sup,c5),zh_sup,c4),zh_sup,c3); #else polyHorner_inf = c3 + zh_inf * (c4 + zh_inf * (c5 + zh_inf * (c6 + zh_inf * c7))); polyHorner_sup = c3 + zh_sup * (c4 + zh_sup * (c5 + zh_sup * (c6 + zh_sup * c7))); #endif Mul12(&zhSquareh_inf, &zhSquarel_inf, zh_inf, zh_inf); Mul12(&zhSquareh_sup, &zhSquarel_sup, zh_sup, zh_sup); polyUpper_inf = polyHorner_inf * (zh_inf * zhSquareh_inf); polyUpper_sup = polyHorner_sup * (zh_sup * zhSquareh_sup); zhSquareHalfh_inf = zhSquareh_inf * -0.5; zhSquareHalfh_sup = zhSquareh_sup * -0.5; zhSquareHalfl_inf = zhSquarel_inf * -0.5; zhSquareHalfl_sup = zhSquarel_sup * -0.5; Add12(t1h_inf, t1l_inf, polyUpper_inf, -1 * (zh_inf * zl_inf)); Add12(t1h_sup, t1l_sup, polyUpper_sup, -1 * (zh_sup * zl_sup)); Add22(&t2h_inf, &t2l_inf, zh_inf, zl_inf, zhSquareHalfh_inf, zhSquareHalfl_inf); Add22(&t2h_sup, &t2l_sup, zh_sup, zl_sup, zhSquareHalfh_sup, zhSquareHalfl_sup); Add22(&ph_inf, &pl_inf, t2h_inf, t2l_inf, t1h_inf, t1l_inf); Add22(&ph_sup, &pl_sup, t2h_sup, t2l_sup, t1h_sup, t1l_sup); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh_inf, log2edl_inf, log2h * ed_inf, log2m * ed_inf); Add12(log2edh_sup, log2edl_sup, log2h * ed_sup, log2m * ed_sup); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh_inf, &logTabPolyl_inf, logih_inf, logim_inf, ph_inf, pl_inf); Add22Cond(&logTabPolyh_sup, &logTabPolyl_sup, logih_sup, logim_sup, ph_sup, pl_sup); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh_inf, &logm_inf, log2edh_inf, log2edl_inf, logTabPolyh_inf, logTabPolyl_inf); Add22Cond(&logh_sup, &logm_sup, log2edh_sup, log2edl_sup, logTabPolyh_sup, logTabPolyl_sup); /* Change logarithm base from natural base to base 2 by multiplying */ Mul22(&logb2h_inf, &logb2m_inf, log2invh, log2invl, logh_inf, logm_inf); Mul22(&logb2h_sup, &logb2m_sup, log2invh, log2invl, logh_sup, logm_sup); /* Rounding test and eventual return or call to the accurate function */ if(E_inf==0) roundcst_inf = RDROUNDCST1; else roundcst_inf = RDROUNDCST2; if(E_sup==0) roundcst_sup = RDROUNDCST1; else roundcst_sup = RDROUNDCST2; TEST_AND_COPY_RDRU_LOG2(roundable, restemp_inf,logb2h_inf, logb2m_inf, restemp_sup, logb2h_sup, logb2m_sup, roundcst_inf, roundcst_sup); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x_inf); #endif if((roundable==2) || (roundable==0)) { log2_td_accurate(&logb2h_inf, &logb2m_inf, &logb2l_inf, E_inf, ed_inf, index_inf, zh_inf, zl_inf, logih_inf, logim_inf); RoundDownwards3(&restemp_inf,logb2h_inf, logb2m_inf, logb2l_inf); } if((roundable==1) || (roundable==0)) { log2_td_accurate(&logb2h_sup, &logb2m_sup, &logb2l_sup, E_sup, ed_sup, index_sup, zh_sup, zl_sup, logih_sup, logim_sup); RoundUpwards3(&restemp_sup,logb2h_sup, logb2m_sup, logb2l_sup); } ASSIGN_LOW(res,restemp_inf); ASSIGN_UP(res,restemp_sup); return res; } if((infDone==0)) { xdb_inf.i[HI] = index_inf | 0x3ff00000; /* do exponent = 0 */ index_inf = (index_inf + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index_inf >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb_inf.i[HI] -= 0x00100000; E_inf++; } y_inf = xdb_inf.d; index_inf = index_inf & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed_inf = (double) E_inf; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri_inf = argredtable[index_inf].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih_inf = argredtable[index_inf].logih; logim_inf = argredtable[index_inf].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih_inf, &yril_inf, y_inf, ri_inf); th_inf = yrih_inf - 1.0; Add12Cond(zh_inf, zl_inf, th_inf, yril_inf); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner_inf = FMA(FMA(FMA(FMA(c7_inf,zh_inf,c6),zh_inf,c5),zh_inf,c4),zh_inf,c3); #else polyHorner_inf = c3 + zh_inf * (c4 + zh_inf * (c5 + zh_inf * (c6 + zh_inf * c7))); #endif Mul12(&zhSquareh_inf, &zhSquarel_inf, zh_inf, zh_inf); polyUpper_inf = polyHorner_inf * (zh_inf * zhSquareh_inf); zhSquareHalfh_inf = zhSquareh_inf * -0.5; zhSquareHalfl_inf = zhSquarel_inf * -0.5; Add12(t1h_inf, t1l_inf, polyUpper_inf, -1 * (zh_inf * zl_inf)); Add22(&t2h_inf, &t2l_inf, zh_inf, zl_inf, zhSquareHalfh_inf, zhSquareHalfl_inf); Add22(&ph_inf, &pl_inf, t2h_inf, t2l_inf, t1h_inf, t1l_inf); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh_inf, log2edl_inf, log2h * ed_inf, log2m * ed_inf); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh_inf, &logTabPolyl_inf, logih_inf, logim_inf, ph_inf, pl_inf); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh_inf, &logm_inf, log2edh_inf, log2edl_inf, logTabPolyh_inf, logTabPolyl_inf); /* Change logarithm base from natural base to base 2 by multiplying */ Mul22(&logb2h_inf, &logb2m_inf, log2invh, log2invl, logh_inf, logm_inf); /* Rounding test and eventual return or call to the accurate function */ if(E_inf==0) roundcst_inf = RDROUNDCST1; else roundcst_inf = RDROUNDCST2; TEST_AND_COPY_RD(roundable, restemp_inf,logb2h_inf, logb2m_inf, roundcst_inf); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x_inf); #endif if((roundable==0)) { log2_td_accurate(&logb2h_inf, &logb2m_inf, &logb2l_inf, E_inf, ed_inf, index_inf, zh_inf, zl_inf, logih_inf, logim_inf); RoundDownwards3(&restemp_inf,logb2h_inf, logb2m_inf, logb2l_inf); } ASSIGN_LOW(res,restemp_inf); ASSIGN_UP(res,restemp_sup); return res; } if((supDone==0)) { xdb_sup.i[HI] = index_sup | 0x3ff00000; /* do exponent = 0 */ index_sup = (index_sup + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index_sup >= MAXINDEX){ /* corresponds to xdb>sqrt(2)*/ xdb_sup.i[HI] -= 0x00100000; E_sup++; } y_sup = xdb_sup.d; index_sup = index_sup & INDEXMASK; /* Cast integer E into double ed for multiplication later */ ed_sup = (double) E_sup; /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri_sup = argredtable[index_sup].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih_sup = argredtable[index_sup].logih; logim_sup = argredtable[index_sup].logim; /* Do range reduction: zh + zl = y * ri - 1.0 correctly Correctness is assured by use of Mul12 and Add12 even if we don't force ri to have its' LSBs set to zero Discard zl for higher monome degrees */ Mul12(&yrih_sup, &yril_sup, y_sup, ri_sup); th_sup = yrih_sup - 1.0; Add12Cond(zh_sup, zl_sup, th_sup, yril_sup); /* Polynomial evaluation Use a 7 degree polynomial Evaluate the higher 5 terms in double precision (-7 * 3 = -21) using Horner's scheme Evaluate the lower 3 terms (the last is 0) in double double precision accounting also for zl using an ad hoc method */ #if defined(PROCESSOR_HAS_FMA) && !defined(AVOID_FMA) polyHorner_sup = FMA(FMA(FMA(FMA(c7,zh_sup,c6),zh_sup,c5),zh_sup,c4),zh_sup,c3); #else polyHorner_sup = c3 + zh_sup * (c4 + zh_sup * (c5 + zh_sup * (c6 + zh_sup * c7))); #endif Mul12(&zhSquareh_sup, &zhSquarel_sup, zh_sup, zh_sup); polyUpper_sup = polyHorner_sup * (zh_sup * zhSquareh_sup); zhSquareHalfh_sup = zhSquareh_sup * -0.5; zhSquareHalfl_sup = zhSquarel_sup * -0.5; Add12(t1h_sup, t1l_sup, polyUpper_sup, -1 * (zh_sup * zl_sup)); Add22(&t2h_sup, &t2l_sup, zh_sup, zl_sup, zhSquareHalfh_sup, zhSquareHalfl_sup); Add22(&ph_sup, &pl_sup, t2h_sup, t2l_sup, t1h_sup, t1l_sup); /* Reconstruction Read logih and logim in the tables (already done) Compute log(x) = E * log(2) + log(1+z) - log(ri) i.e. log(x) = ed * (log2h + log2m) + (ph + pl) + (logih + logim) + delta Carry out everything in double double precision */ /* We store log2 as log2h + log2m + log2l where log2h and log2m have 12 trailing zeros Multiplication of ed (double E) and log2h is thus correct The overall accuracy of log2h + log2m + log2l is 53 * 3 - 24 = 135 which is enough for the accurate phase The accuracy suffices also for the quick phase: 53 * 2 - 24 = 82 Nevertheless the storage with trailing zeros implies an overlap of the tabulated triple double values. We have to take it into account for the accurate phase basic procedures for addition and multiplication The condition on the next Add12 is verified as log2m is smaller than log2h and both are scaled by ed */ Add12(log2edh_sup, log2edl_sup, log2h * ed_sup, log2m * ed_sup); /* Add logih and logim to ph and pl We must use conditioned Add22 as logih can move over ph */ Add22Cond(&logTabPolyh_sup, &logTabPolyl_sup, logih_sup, logim_sup, ph_sup, pl_sup); /* Add log2edh + log2edl to logTabPolyh + logTabPolyl */ Add22Cond(&logh_sup, &logm_sup, log2edh_sup, log2edl_sup, logTabPolyh_sup, logTabPolyl_sup); /* Change logarithm base from natural base to base 2 by multiplying */ Mul22(&logb2h_sup, &logb2m_sup, log2invh, log2invl, logh_sup, logm_sup); /* Rounding test and eventual return or call to the accurate function */ if(E_sup==0) roundcst_sup = RDROUNDCST1; else roundcst_sup = RDROUNDCST2; TEST_AND_COPY_RU(roundable, restemp_sup,logb2h_sup, logb2m_sup, roundcst_sup); #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x_inf); #endif if((roundable==0)) { log2_td_accurate(&logb2h_sup, &logb2m_sup, &logb2l_sup, E_sup, ed_sup, index_sup, zh_sup, zl_sup, logih_sup, logim_sup); RoundUpwards3(&restemp_sup,logb2h_sup, logb2m_sup, logb2l_sup); } ASSIGN_LOW(res,restemp_inf); ASSIGN_UP(res,restemp_sup); return res; } } #endif interval-2.1.0/src/crlibm/log2-td.h0000644000000000000000000012740213031036767015160 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" /*File generated by maple/log2-td.mpl*/ #define L 7 #define MAXINDEX 53 #define INDEXMASK 127 #define two52 4.50359962737049600000000000000000000000000000000000e+15 #define log2h 6.93147180559890330187045037746429443359375000000000e-01 #define log2m 5.49792301870850242169664946507035702127907939029683e-14 #define log2l -1.31246984177852556920995753667322295879593697972250e-27 #define log2invh 1.44269504088896338700465094007086008787155151367188e+00 #define log2invl 2.03552737409310331110210900522069120325603861485809e-17 #define ROUNDCST1 1.00787401574803160796292764473221714405939530505554e+00 #define ROUNDCST2 1.00787401574803160796292764473221714405939530505554e+00 #define RDROUNDCST1 4.33680868994201773602981120347976684570312500000000e-19 #define RDROUNDCST2 4.33680868994201773602981120347976684570312500000000e-19 #define c3 3.33333333333333370340767487505218014121055603027344e-01 #define c4 -2.49999999990904886448817023847368545830249786376953e-01 #define c5 1.99999999978980019799124079327157232910394668579102e-01 #define c6 -1.66669050883027802800739891608827747404575347900391e-01 #define c7 1.42860109897981618631845890377007890492677688598633e-01 #define accPolyC3h 3.33333333333333314829616256247390992939472198486328e-01 #define accPolyC3l 1.85037170770859413132312241283212169118117639547054e-17 #define accPolyC4h -2.50000000000000000000000000000000000000000000000000e-01 #define accPolyC4l 4.62199018306924685334006418421322154174127637249391e-33 #define accPolyC5h 2.00000000000000011102230246251565404236316680908203e-01 #define accPolyC5l -1.11022302443127785678379338452126964515833173338601e-17 #define accPolyC6h -1.66666666666666657414808128123695496469736099243164e-01 #define accPolyC6l -9.25185854591372488017120157358742564605503054108327e-18 #define accPolyC7h 1.42857142857142849212692681248881854116916656494141e-01 #define accPolyC7l 7.92868209382438390589949095717120486682310988838960e-18 #define accPolyC8h -1.25000000000000000000000000000000000000000000000000e-01 #define accPolyC8l 3.42769668947376590645174407718339199260639267364101e-21 #define accPolyC9h 1.11111111111111521276839653182832989841699600219727e-01 #define accPolyC9l 4.33331955380787609416227741118274520376899199903317e-18 #define accPolyC10 -1.00000000000000699440505513848620466887950897216797e-01 #define accPolyC11 9.09090908567022348840680479042930528521537780761719e-02 #define accPolyC12 -8.33333332642126056732934102910803630948066711425781e-02 #define accPolyC13 7.69261287585959879775643344146374147385358810424805e-02 #define accPolyC14 -7.14319092953022982683819464000407606363296508789062e-02 typedef struct rri_tag {float ri; double logih; double logim; double logil;} rri; static const rri argredtable[128] = { { 1.00000000000000000000000000000000000000000000000000e+00, /* r[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logih[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logim[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logil[0] */ } , { 9.92248058319091796875000000000000000000000000000000e-01, /* r[1] */ 7.78214416734525436109004559170898573938757181167603e-03, /* logih[1] */ -1.28191618904143681948935996668824218266800862156024e-20, /* logim[1] */ 1.17655068600225378123891861200215069271455859581641e-37, /* logil[1] */ } , { 9.84615325927734375000000000000000000000000000000000e-01, /* r[2] */ 1.55042461406118062261505485821544425562024116516113e-02, /* logih[2] */ -3.27761516207149627029928635703400435929630184221293e-19, /* logim[2] */ 2.95200020707030964072253388818190769795416371257942e-37, /* logil[2] */ } , { 9.77099180221557617187500000000000000000000000000000e-01, /* r[3] */ 2.31671170235356708999585606534310500137507915496826e-02, /* logih[3] */ 5.57833156048330069504471566938468802334954100224869e-19, /* logim[3] */ 4.08416064054113313191746248503653555682943539201798e-35, /* logil[3] */ } , { 9.69696998596191406250000000000000000000000000000000e-01, /* r[4] */ 3.07716288644317437217523547587916254997253417968750e-02, /* logih[4] */ 1.04316437964092669923942103072089812062131860035492e-18, /* logim[4] */ -8.26837774892530079043982861155759865584698067912967e-36, /* logil[4] */ } , { 9.62406039237976074218750000000000000000000000000000e-01, /* r[5] */ 3.83188391564273991840572364253603154793381690979004e-02, /* logih[5] */ 1.54512636366303706650320890230224472259662656606095e-18, /* logim[5] */ 8.30977110244055528389241824578843983429633068152463e-35, /* logil[5] */ } , { 9.55223917961120605468750000000000000000000000000000e-01, /* r[6] */ 4.58094969157468376308450785927561810240149497985840e-02, /* logih[6] */ -3.30123051072550842868548428055668582607719074881820e-18, /* logim[6] */ 1.64164772626574162996727598513545022472742050176492e-34, /* logil[6] */ } , { 9.48148131370544433593750000000000000000000000000000e-01, /* r[7] */ 5.32445322139413548812036935942160198464989662170410e-02, /* logih[7] */ 2.23755385085953619415254057336256700540433618368589e-18, /* logim[7] */ -9.41330315099866735037984721876103977945647219756033e-35, /* logil[7] */ } , { 9.41176414489746093750000000000000000000000000000000e-01, /* r[8] */ 6.06246814210813916856679384181916248053312301635742e-02, /* logih[8] */ 2.64247317995478646334926909653435556549332769494295e-18, /* logim[8] */ 1.55075207452234839722600788456166299408429635417895e-34, /* logil[8] */ } , { 9.34306621551513671875000000000000000000000000000000e-01, /* r[9] */ 6.79506060291548280583029395529592875391244888305664e-02, /* logih[9] */ 5.65862161871167282533541105359923619273100535513035e-18, /* logim[9] */ -3.57889357320249912090032102867532919048871786355064e-34, /* logil[9] */ } , { 9.27536249160766601562500000000000000000000000000000e-01, /* r[10] */ 7.52234026111362058530929175503842998296022415161133e-02, /* logih[10] */ 1.00828755349783911736541446332784521904773238841865e-18, /* logim[10] */ 7.77966415828014771486738038255868010153689429282538e-36, /* logil[10] */ } , { 9.20863270759582519531250000000000000000000000000000e-01, /* r[11] */ 8.24437111205913314426751981045526918023824691772461e-02, /* logih[11] */ -4.27419767632228646217014766651675738804062364961374e-18, /* logim[11] */ 3.58539257549786746072726449331073277906948658046759e-34, /* logil[11] */ } , { 9.14285659790039062500000000000000000000000000000000e-01, /* r[12] */ 8.96122182943336897942288032936630770564079284667969e-02, /* logih[12] */ -5.42674234758262048883730612286095846547194397615989e-18, /* logim[12] */ -7.94903110897686868047461590865098481976776339992810e-35, /* logil[12] */ } , { 9.07801389694213867187500000000000000000000000000000e-01, /* r[13] */ 9.67296581235191493819414176869031507521867752075195e-02, /* logih[13] */ 1.17499431052084706890372286741885325822732164697539e-18, /* logim[13] */ -7.47188021694240554877009439429630012902672969107896e-35, /* logil[13] */ } , { 9.01408433914184570312500000000000000000000000000000e-01, /* r[14] */ 1.03796812308095232069149460585322231054306030273438e-01, /* logih[14] */ -1.46116759252442942691327623497388991415382979093093e-18, /* logim[14] */ -5.84766064918572844473631496354606243606272630720064e-35, /* logil[14] */ } , { 8.95104885101318359375000000000000000000000000000000e-01, /* r[15] */ 1.10814377516161077785739053069846704602241516113281e-01, /* logih[15] */ -5.75514509579248124656596649605847554012818793702281e-18, /* logim[15] */ 3.29977719536339952907783192540462408052319847426319e-34, /* logil[15] */ } , { 8.88888835906982421875000000000000000000000000000000e-01, /* r[16] */ 1.17783095261030007483427084480354096740484237670898e-01, /* logih[16] */ -1.19709798867727449215060005668653850880775796697715e-18, /* logim[16] */ 8.04222018353684236067064017226062133396406008492921e-35, /* logil[16] */ } , { 8.82758617401123046875000000000000000000000000000000e-01, /* r[17] */ 1.24703482226247538977581541530526010319590568542480e-01, /* logih[17] */ 2.28663295749049514726834658528273231115811065734312e-18, /* logim[17] */ -3.51123005875932392272239647660221882537057244586168e-35, /* logil[17] */ } , { 8.76712322235107421875000000000000000000000000000000e-01, /* r[18] */ 1.31576365239299886145118989588809199631214141845703e-01, /* logih[18] */ 1.11230010175930229418362785876222391520299564865730e-17, /* logim[18] */ 7.27451645836749926637643602480531900716806359121297e-34, /* logil[18] */ } , { 8.70748281478881835937500000000000000000000000000000e-01, /* r[19] */ 1.38402343348215994822680841025430709123611450195312e-01, /* logih[19] */ -7.69528416335144553864151614176326744245393995127969e-18, /* logim[19] */ 1.14202629230472885861778260955781649682548331183808e-34, /* logil[19] */ } , { 8.64864826202392578125000000000000000000000000000000e-01, /* r[20] */ 1.45182054547982469783207193358975928276777267456055e-01, /* logih[20] */ 8.24244856152552570070228105635897158979868211170798e-18, /* logim[20] */ -6.13072808770694892835379995250538817854995507648779e-34, /* logil[20] */ } , { 8.59060406684875488281250000000000000000000000000000e-01, /* r[21] */ 1.51916037369229123266123337998578790575265884399414e-01, /* logih[21] */ -1.04296908000297145574171199957656893307239877379000e-17, /* logim[21] */ -5.53636436435840586444373230094200986769217138540854e-34, /* logil[21] */ } , { 8.53333353996276855468750000000000000000000000000000e-01, /* r[22] */ 1.58605005962251938145257668111298698931932449340820e-01, /* logih[22] */ -8.86065192248216377790637508171938194510660992474042e-19, /* logim[22] */ -5.87995214834401673695486864800931832452468264932844e-35, /* logil[22] */ } , { 8.47682118415832519531250000000000000000000000000000e-01, /* r[23] */ 1.65249573826629747586025587224867194890975952148438e-01, /* logih[23] */ -9.66125475305916070790888958698289394696700966750453e-18, /* logim[23] */ 1.22853647999759344001960461047755491313341721869856e-34, /* logil[23] */ } , { 8.42105269432067871093750000000000000000000000000000e-01, /* r[24] */ 1.71850249476078659194300257695431355386972427368164e-01, /* logih[24] */ -6.02245395887480538795512923412250309472746231920746e-18, /* logim[24] */ 1.52961687917434402329553899350235008490821862631877e-34, /* logil[24] */ } , { 8.36601257324218750000000000000000000000000000000000e-01, /* r[25] */ 1.78407717077464861299418430462537799030542373657227e-01, /* logih[25] */ -1.24324832026190372515095573175819374097319572461178e-17, /* logim[25] */ -5.99222696564577786410580709003476847421843326905428e-34, /* logil[25] */ } , { 8.31168889999389648437500000000000000000000000000000e-01, /* r[26] */ 1.84922267713498816865680396404059138149023056030273e-01, /* logih[26] */ 9.96243711860796179875713739627414673019270693540839e-18, /* logim[26] */ -1.99546782893888540832510298706525540082513642365204e-34, /* logil[26] */ } , { 8.25806498527526855468750000000000000000000000000000e-01, /* r[27] */ 1.91394796188954025017991966706176754087209701538086e-01, /* logih[27] */ -8.22643020277300444045205706293674132131812201700538e-18, /* logim[27] */ 5.69056030867564774930537188285078930441778787828211e-34, /* logil[27] */ } , { 8.20512771606445312500000000000000000000000000000000e-01, /* r[28] */ 1.97825802934566419288842098467284813523292541503906e-01, /* logih[28] */ 1.28212649590622342007825921152819823725126964367518e-17, /* logim[28] */ 4.34712978477783827374998481132430084872238812357849e-34, /* logil[28] */ } , { 8.15286636352539062500000000000000000000000000000000e-01, /* r[29] */ 2.04215526527529805944638496839615982025861740112305e-01, /* logih[29] */ 2.73382699896480606605004885268461286375739934002155e-18, /* logim[29] */ 1.88415596219599490517606146615135776386751947516623e-34, /* logil[29] */ } , { 8.10126543045043945312500000000000000000000000000000e-01, /* r[30] */ 2.10564817536124687658016796376614365726709365844727e-01, /* logih[30] */ 2.68952644992466202072392146799884466396384136175691e-18, /* logim[30] */ -1.58883120037037559046153789501260274259127656480088e-34, /* logil[30] */ } , { 8.05031418800354003906250000000000000000000000000000e-01, /* r[31] */ 2.16873972759550226463431954471161589026451110839844e-01, /* logih[31] */ -1.23625140584833845652640860288020787431726668393088e-17, /* logim[31] */ -1.28369360755661214950804825668450767372141502246786e-34, /* logil[31] */ } , { 7.99999952316284179687500000000000000000000000000000e-01, /* r[32] */ 2.23143610918856316605030087885097600519657135009766e-01, /* logih[32] */ -9.09120001124270523314725361445863555491966823753373e-18, /* logim[32] */ 1.15945802868784933647836819275496182741822080543604e-34, /* logil[32] */ } , { 7.95031070709228515625000000000000000000000000000000e-01, /* r[33] */ 2.29374082438394522043267897970508784055709838867188e-01, /* logih[33] */ -1.08890120418598083770448590672876580941469212582837e-17, /* logim[33] */ 4.74877924128943438272197143958394008126523960202900e-34, /* logil[33] */ } , { 7.90123462677001953125000000000000000000000000000000e-01, /* r[34] */ 2.35566063862186342303672859088692348450422286987305e-01, /* logih[34] */ -2.39433728738216998660812173360881116827035967139939e-18, /* logim[34] */ -9.62471867414270770251397101906428335828045927610883e-35, /* logil[34] */ } , { 7.85276055335998535156250000000000000000000000000000e-01, /* r[35] */ 2.41719960170209802186036540661007165908813476562500e-01, /* logih[35] */ 2.39578119451184969695376143676233310543075971208880e-18, /* logim[35] */ 1.86231935097448741662637615288316997021879162207127e-34, /* logil[35] */ } , { 7.80487775802612304687500000000000000000000000000000e-01, /* r[36] */ 2.47836201157484947721343360171886160969734191894531e-01, /* logih[36] */ -1.24321923457726137680465119406863072977770725701004e-17, /* logim[36] */ -2.09577513970149680056365167860895085898294691979404e-34, /* logil[36] */ } , { 7.75757551193237304687500000000000000000000000000000e-01, /* r[37] */ 2.53915241645931488712051304901251569390296936035156e-01, /* logih[37] */ -6.31336333527435824035156315376733999545148217960567e-18, /* logim[37] */ 4.63496313971202069379055986715253908538961883067566e-35, /* logil[37] */ } , { 7.71084308624267578125000000000000000000000000000000e-01, /* r[38] */ 2.59957561689829752538116736104711890220642089843750e-01, /* logih[38] */ -7.05748899290965383754297836711168798219001736647281e-18, /* logim[38] */ 4.27245447011230141916526741370315150982259792796987e-34, /* logil[38] */ } , { 7.66467094421386718750000000000000000000000000000000e-01, /* r[39] */ 2.65963511244235673025571031757863238453865051269531e-01, /* logih[39] */ -2.24162125724264292804912034054420308588570407662844e-17, /* logim[39] */ 4.90471140265143981765909599584287898945638617268867e-34, /* logil[39] */ } , { 7.61904716491699218750000000000000000000000000000000e-01, /* r[40] */ 2.71933775088288309795814257086021825671195983886719e-01, /* logih[40] */ 7.83390223779535346513505580003968001040971161798700e-19, /* logim[40] */ -3.02585215101390470982866376614279464778757620082138e-35, /* logil[40] */ } , { 7.57396459579467773437500000000000000000000000000000e-01, /* r[41] */ 2.77868437964940373507971571598318405449390411376953e-01, /* logih[41] */ -2.69368711734232128278453248569958166651302969280381e-17, /* logim[41] */ 1.27334496810554064003001771076892864921428144153570e-33, /* logil[41] */ } , { 7.52941131591796875000000000000000000000000000000000e-01, /* r[42] */ 2.83768232735291170421021433867281302809715270996094e-01, /* logih[42] */ -2.03265852251844689554711830689719609838328388091381e-17, /* logim[42] */ 3.99265876662456660849597520210659365811534845502505e-34, /* logil[42] */ } , { 7.48538017272949218750000000000000000000000000000000e-01, /* r[43] */ 2.89633285132462114930262941925320774316787719726562e-01, /* logih[43] */ -7.21962253363417273270454867455071277489833577725373e-18, /* logim[43] */ -2.16150227221931053192432009592422674631830770048369e-34, /* logil[43] */ } , { 7.44186043739318847656250000000000000000000000000000e-01, /* r[44] */ 2.95464216619126196494704572614864446222782135009766e-01, /* logih[44] */ -1.47072146829197428851717511710908602721304319475328e-17, /* logim[44] */ 4.88114627787723832872543510409367916590649903129304e-34, /* logil[44] */ } , { 7.39884376525878906250000000000000000000000000000000e-01, /* r[45] */ 3.01261352929903802877475982313626445829868316650391e-01, /* logih[45] */ 1.87070681938931680167624656750430985298856099421569e-17, /* logim[45] */ 1.51413799416501325421897094776870076323182009328971e-33, /* logil[45] */ } , { 7.35632181167602539062500000000000000000000000000000e-01, /* r[46] */ 3.07025039020202172856954803137341514229774475097656e-01, /* logih[46] */ -5.38102227896180596526923200171118043417676846319102e-18, /* logim[46] */ 2.06712483430759996475892191286335029882052180959917e-34, /* logil[46] */ } , { 7.31428623199462890625000000000000000000000000000000e-01, /* r[47] */ 3.12755639223383730129768309780047275125980377197266e-01, /* logih[47] */ -7.57930782773895721056011815787401170737920404028723e-18, /* logim[47] */ 8.39475110593319988799512618628582752750846924050440e-35, /* logil[47] */ } , { 7.27272748947143554687500000000000000000000000000000e-01, /* r[48] */ 3.18453701316212645089365196326980367302894592285156e-01, /* logih[48] */ 2.71147705440665649189983820006370647423267349507715e-17, /* logim[48] */ 4.61673001741568050305139864943649666789926072891368e-34, /* logil[48] */ } , { 7.23163843154907226562500000000000000000000000000000e-01, /* r[49] */ 3.24119466791566834817928111078799702227115631103516e-01, /* logih[49] */ -6.22349090807112113628215383245238541760656175683922e-18, /* logim[49] */ -2.94864944946984528585289533414905600786096792764282e-34, /* logil[49] */ } , { 7.19101071357727050781250000000000000000000000000000e-01, /* r[50] */ 3.29753359015631464234985514849540777504444122314453e-01, /* logih[50] */ -2.38987037434306035496609341036867889075145964580121e-17, /* logim[50] */ -1.22161021411351376080765213758661026982900357467596e-33, /* logil[50] */ } , { 7.15083837509155273437500000000000000000000000000000e-01, /* r[51] */ 3.35355487904429983014864546930766664445400238037109e-01, /* logih[51] */ -2.15530481136091842439480783176785939188081961777809e-17, /* logim[51] */ 5.65377778536716902900522531845470344712374772157319e-34, /* logil[51] */ } , { 7.11111068725585937500000000000000000000000000000000e-01, /* r[52] */ 3.40926646575239744585417156486073508858680725097656e-01, /* logih[52] */ 1.74672070296268393919501631375949801326271042364782e-17, /* logim[52] */ 1.28757784323920807504216254145051967795248381758825e-33, /* logil[52] */ } , { 1.41436457633972167968750000000000000000000000000000e+00, /* r[53] */ -3.46680367578929504723816990008344873785972595214844e-01, /* logih[53] */ -2.63487075436177288054440686474043695042741778901884e-17, /* logim[53] */ -1.38972774108545698123375234719775474495262622652200e-33, /* logil[53] */ } , { 1.40659332275390625000000000000000000000000000000000e+00, /* r[54] */ -3.41170697798120592381110327551141381263732910156250e-01, /* logih[54] */ 1.93668606486849623510457675345565515553170548397263e-17, /* logim[54] */ -6.31924577586791945681481090971933602378723267089765e-34, /* logil[54] */ } , { 1.39890718460083007812500000000000000000000000000000e+00, /* r[55] */ -3.35691349380139503200126682713744230568408966064453e-01, /* logih[55] */ 8.91843232308579533655667936963342665384096382048557e-18, /* logim[55] */ -7.43852632990846244963757376301756885994340719135686e-34, /* logil[55] */ } , { 1.39130425453186035156250000000000000000000000000000e+00, /* r[56] */ -3.30241619815349218836075806393637321889400482177734e-01, /* logih[56] */ -1.69271534756955752333877800530082817995576241189249e-17, /* logim[56] */ -2.05124125474152062675126703058085713735683777118919e-34, /* logil[56] */ } , { 1.38378381729125976562500000000000000000000000000000e+00, /* r[57] */ -3.24821643615624322531942880232236348092555999755859e-01, /* logih[57] */ 1.93287622140617006961244731990086787828970688523722e-17, /* logim[57] */ -1.40211415833516824405184666805315188814704601258065e-33, /* logil[57] */ } , { 1.37634420394897460937500000000000000000000000000000e+00, /* r[58] */ -3.19430856448034428130000605960958637297153472900391e-01, /* logih[58] */ 5.58442737360353866559969930374464901851229137435661e-18, /* logim[58] */ -2.25313306148742433454599602113064828727792769150620e-34, /* logil[58] */ } , { 1.36898398399353027343750000000000000000000000000000e+00, /* r[59] */ -3.14068847182749744106899925100151449441909790039062e-01, /* logih[59] */ 1.74087330539322720259314067705480812845274240645592e-17, /* logim[59] */ 2.87763442397890459672608687761118393908121210479900e-34, /* logil[59] */ } , { 1.36170220375061035156250000000000000000000000000000e+00, /* r[60] */ -3.08735537528966208498104606405831873416900634765625e-01, /* logih[60] */ 2.31380218279209479391607966489385619371870731511261e-17, /* logim[60] */ 5.75649697670342883220331709767832654878804183961435e-34, /* logil[60] */ } , { 1.35449743270874023437500000000000000000000000000000e+00, /* r[61] */ -3.03430487161918061023158088573836721479892730712891e-01, /* logih[61] */ 5.88591784280850309549180895879864991445414905765635e-18, /* logim[61] */ 3.80740105286783019924475997846877792541810370319751e-34, /* logil[61] */ } , { 1.34736847877502441406250000000000000000000000000000e+00, /* r[62] */ -2.98153415159913837140237546918797306716442108154297e-01, /* logih[62] */ -8.81391967432414632609646763074561636922040597203571e-18, /* logim[62] */ -2.02736910549706342663167850737697734462522018249963e-34, /* logil[62] */ } , { 1.34031414985656738281250000000000000000000000000000e+00, /* r[63] */ -2.92904026677480888718463347686338238418102264404297e-01, /* logih[63] */ 1.79356774462556308958502912313675336181211584010969e-17, /* logim[63] */ 1.02350086185905899058999882149766002774623879978153e-34, /* logil[63] */ } , { 1.33333325386047363281250000000000000000000000000000e+00, /* r[64] */ -2.87682012847134349620148441317724063992500305175781e-01, /* logih[64] */ -2.60715355783435444041951693925565689223533295668838e-17, /* logim[64] */ -9.83372234709377378449141028490939682198507140512540e-34, /* logil[64] */ } , { 1.32642483711242675781250000000000000000000000000000e+00, /* r[65] */ -2.82487230428967117656924301627441309392452239990234e-01, /* logih[65] */ 2.49452771019268745755792758464310261659699707675018e-17, /* logim[65] */ -1.40230272425562150522506576584140991296902734870694e-33, /* logil[65] */ } , { 1.31958770751953125000000000000000000000000000000000e+00, /* r[66] */ -2.77319345020877350282972884087939746677875518798828e-01, /* logih[66] */ 7.44521346975934828880026635948320543669274837358637e-18, /* logim[66] */ -5.41922476182319969711469733445405189836277342215443e-34, /* logil[66] */ } , { 1.31282043457031250000000000000000000000000000000000e+00, /* r[67] */ -2.72177826311169102080356196893262676894664764404297e-01, /* logih[67] */ -1.94604737767255604321061638736698666324990178271015e-17, /* logim[67] */ 4.93318792723831633917605655356651628446409622108869e-34, /* logil[67] */ } , { 1.30612254142761230468750000000000000000000000000000e+00, /* r[68] */ -2.67062856029558426396164350080653093755245208740234e-01, /* logih[68] */ 1.42676910305707233200559864526771082234384991613068e-17, /* logim[68] */ 9.40874014190123375853921812584677628111272401841540e-34, /* logil[68] */ } , { 1.29949235916137695312500000000000000000000000000000e+00, /* r[69] */ -2.61973695252477101202970288795768283307552337646484e-01, /* logih[69] */ -1.59130185496344773949627658712806321021374170989957e-17, /* logim[69] */ 2.05966526658843352548575822504612882857523370085076e-34, /* logil[69] */ } , { 1.29292941093444824218750000000000000000000000000000e+00, /* r[70] */ -2.56910505054635363020310023784986697137355804443359e-01, /* logih[70] */ -2.32939629151451727444770801596466641031683815428509e-17, /* logim[70] */ -1.43942742464573220634874496721239465737503205324375e-33, /* logil[70] */ } , { 1.28643226623535156250000000000000000000000000000000e+00, /* r[71] */ -2.51872701711453261808060233306605368852615356445312e-01, /* logih[71] */ -2.58573188266130078596915247890597291360969537163785e-17, /* logim[71] */ 3.36064630885731507350249551263037246653963144676932e-34, /* logil[71] */ } , { 1.27999997138977050781250000000000000000000000000000e+00, /* r[72] */ -2.46860055579783743695543307694606482982635498046875e-01, /* logih[72] */ -1.36174299951708605118822966558244798958741114531493e-17, /* logim[72] */ -8.23883896198784591738914635896001757021238114385808e-35, /* logil[72] */ } , { 1.27363181114196777343750000000000000000000000000000e+00, /* r[73] */ -2.41872513137422084916750009142560884356498718261719e-01, /* logih[73] */ -2.91827950997726014268071786281330008614392694540440e-18, /* logim[73] */ 8.66387628958027677722140876839269007945711340420961e-35, /* logil[73] */ } , { 1.26732683181762695312500000000000000000000000000000e+00, /* r[74] */ -2.36909825309450927655063878773944452404975891113281e-01, /* logih[74] */ 4.97049401191734143236484721843489954792294974449682e-18, /* logim[74] */ 2.12212094628219632031384179435720857347529888567725e-34, /* logil[74] */ } , { 1.26108384132385253906250000000000000000000000000000e+00, /* r[75] */ -2.31971542737545860513037609962339047342538833618164e-01, /* logih[75] */ 1.20064411563385414488688519726171456939870706105353e-17, /* logim[75] */ -5.20241965000144345106493348505238495111737026311766e-34, /* logil[75] */ } , { 1.25490188598632812500000000000000000000000000000000e+00, /* r[76] */ -2.27057391030699523559732710964453872293233871459961e-01, /* logih[76] */ -9.55134517665639461592830714479938653876650013848813e-18, /* logim[76] */ -7.00052160915705629865262646818211330004502638341784e-34, /* logil[76] */ } , { 1.24878048896789550781250000000000000000000000000000e+00, /* r[77] */ -2.22167466272476882283015697794326115399599075317383e-01, /* logih[77] */ 1.12308837854924459441805420173945034636561801020789e-17, /* logim[77] */ 1.05992689326800868505291338111574353445179905470698e-34, /* logil[77] */ } , { 1.24271845817565917968750000000000000000000000000000e+00, /* r[78] */ -2.17301285003207084178811214769666548818349838256836e-01, /* logih[78] */ -1.37599098464784711367545798871014398359913153389606e-17, /* logim[78] */ -5.44676947016522950876420214713413739910691265570885e-34, /* logil[78] */ } , { 1.23671507835388183593750000000000000000000000000000e+00, /* r[79] */ -2.12458734101899110457978281374380458146333694458008e-01, /* logih[79] */ 3.12575020468223244847667531342710056704202576314513e-18, /* logim[79] */ 1.27082738610098894087384580413567050181540844264548e-35, /* logil[79] */ } , { 1.23076915740966796875000000000000000000000000000000e+00, /* r[80] */ -2.07639305173597937814733427330793347209692001342773e-01, /* logih[80] */ -1.20531726306040366742269494142059745690218464556184e-17, /* logim[80] */ 3.33883514126655983920316543317695602289579500921493e-34, /* logil[80] */ } , { 1.22488045692443847656250000000000000000000000000000e+00, /* r[81] */ -2.02843253050716987306856253781006671488285064697266e-01, /* logih[81] */ -1.66453566992001313940518505696243672056063400746100e-18, /* logim[81] */ 2.78446239404510241881587234176263335863162887428131e-35, /* logil[81] */ } , { 1.21904754638671875000000000000000000000000000000000e+00, /* r[82] */ -1.98069854157447239328959653903439175337553024291992e-01, /* logih[82] */ -3.74277289637934596837745314540095849706853736054736e-18, /* logim[82] */ 2.20940287174632344749918330821286328950105212564345e-34, /* logil[82] */ } , { 1.21327018737792968750000000000000000000000000000000e+00, /* r[83] */ -1.93319348256398265695210625381150748580694198608398e-01, /* logih[83] */ -4.63045754803609100012916107813305239709411987466506e-18, /* logim[83] */ 3.81311992624323390610440652445847060246376140730432e-34, /* logil[83] */ } , { 1.20754718780517578125000000000000000000000000000000e+00, /* r[84] */ -1.88591184708711112616441596401273272931575775146484e-01, /* logih[84] */ 7.43216311628945500204739783937941202296964434266492e-18, /* logim[84] */ -4.02931080995428730719681936637527024502063366412999e-34, /* logil[84] */ } , { 1.20187783241271972656250000000000000000000000000000e+00, /* r[85] */ -1.83885194019779485419263664880418218672275543212891e-01, /* logih[85] */ 4.12613043545869607985270580107985887836449099592842e-18, /* logim[85] */ -1.13080344207561908198013613253456946184091830340475e-34, /* logil[85] */ } , { 1.19626164436340332031250000000000000000000000000000e+00, /* r[86] */ -1.79201397792742966874612875471939332783222198486328e-01, /* logih[86] */ 1.25197515140082668570664893296659406065442168045883e-17, /* logim[86] */ 2.08673445558311131685127966451011169090072111640797e-34, /* logil[86] */ } , { 1.19069766998291015625000000000000000000000000000000e+00, /* r[87] */ -1.74539412626609380385644954003510065376758575439453e-01, /* logih[87] */ 8.52219781255028950312107624449830634785785378861392e-18, /* logim[87] */ 5.46720442033771639415150684633589460164820712880324e-34, /* logil[87] */ } , { 1.18518519401550292968750000000000000000000000000000e+00, /* r[88] */ -1.69899044245978042555478282338299322873353958129883e-01, /* logih[88] */ 4.86800738580472456380134000450154397097303177737598e-19, /* logim[88] */ -4.48365665383134519709151659261825733866549119396251e-36, /* logil[88] */ } , { 1.17972350120544433593750000000000000000000000000000e+00, /* r[89] */ -1.65280090007780350314092743246874306350946426391602e-01, /* logih[89] */ 1.05991222445546499578510819426998369466676418510398e-18, /* logim[89] */ 2.15535973016890499002202117947684925307171077322261e-36, /* logil[89] */ } , { 1.17431187629699707031250000000000000000000000000000e+00, /* r[90] */ -1.60682338849634120947484916541725397109985351562500e-01, /* logih[90] */ 5.38493323815703006679696841052856196024573538758454e-18, /* logim[90] */ 1.60200163876329179080224417109933041789065267300895e-34, /* logil[90] */ } , { 1.16894984245300292968750000000000000000000000000000e+00, /* r[91] */ -1.56105775199027185795586092353914864361286163330078e-01, /* logih[91] */ 1.32405772531609804709122583998125231935523184710352e-17, /* logim[91] */ 4.88933388697666736600942679327919927438390701656817e-35, /* logil[91] */ } , { 1.16363644599914550781250000000000000000000000000000e+00, /* r[92] */ -1.51549968907714105448292229993967339396476745605469e-01, /* logih[92] */ 1.77181633478899593214922561799512844823326841018122e-18, /* logim[92] */ 5.44951453107128861626798538797020344311568819287008e-35, /* logil[92] */ } , { 1.15837097167968750000000000000000000000000000000000e+00, /* r[93] */ -1.47014683357163111754317696977523155510425567626953e-01, /* logih[93] */ 4.46701777108311388441189058844554903695616000674812e-18, /* logim[93] */ -1.53168389834566630100313932781112142055948393405761e-34, /* logil[93] */ } , { 1.15315318107604980468750000000000000000000000000000e+00, /* r[94] */ -1.42500086821669674774781810810964088886976242065430e-01, /* logih[94] */ -2.21668083020505832726646787146199970227457581911830e-18, /* logim[94] */ -4.73140768447350921077611938776759805597533720242102e-36, /* logil[94] */ } , { 1.14798212051391601562500000000000000000000000000000e+00, /* r[95] */ -1.38005723310861472263866289722500368952751159667969e-01, /* logih[95] */ -9.06035372834454229539393713977175584764482079542462e-18, /* logim[95] */ -6.58482110068426815722709702700082916058774211791842e-34, /* logil[95] */ } , { 1.14285707473754882812500000000000000000000000000000e+00, /* r[96] */ -1.33531333019876075063336884340969845652580261230469e-01, /* logih[96] */ 3.66452824974217778950176131406293356640863401093569e-18, /* logim[96] */ 6.15050085774566840615703784135477182311292227710416e-35, /* logil[96] */ } , { 1.13777780532836914062500000000000000000000000000000e+00, /* r[97] */ -1.29077066489528990977930789085803553462028503417969e-01, /* logih[97] */ 7.97904258955058431558707127373439732289437010877585e-19, /* logim[97] */ -4.72584148771245137732808879600361038781792271619664e-35, /* logil[97] */ } , { 1.13274335861206054687500000000000000000000000000000e+00, /* r[98] */ -1.24642441481986290807704165217728586867451667785645e-01, /* logih[98] */ -1.12998120773332791412288663337308123303520797473827e-18, /* logim[98] */ 5.04751909879024305911295754405025108738663901055449e-35, /* logil[98] */ } , { 1.12775325775146484375000000000000000000000000000000e+00, /* r[99] */ -1.20227386019965673535914163494453532621264457702637e-01, /* logih[99] */ -4.10132123403305460439841682733159064509468253505934e-18, /* logim[99] */ 1.89802934268459828223199224893946334512039168636632e-34, /* logil[99] */ } , { 1.12280702590942382812500000000000000000000000000000e+00, /* r[100] */ -1.15831822975702269928888199501670897006988525390625e-01, /* logih[100] */ -4.33848450767153009712329850176816190393287866962401e-18, /* logim[100] */ -3.16979691573058896647113947407157157214490081484725e-34, /* logil[100] */ } , { 1.11790394783020019531250000000000000000000000000000e+00, /* r[101] */ -1.11455456757806464773707944004854653030633926391602e-01, /* logih[101] */ -5.25227837292521929481451677551514755953859335394548e-18, /* logim[101] */ -1.35455162271740897316919848287529722248286557667632e-34, /* logil[101] */ } , { 1.11304354667663574218750000000000000000000000000000e+00, /* r[102] */ -1.07098197023655139492603893813793547451496124267578e-01, /* logih[102] */ 3.47169710366632825350486634041554320998659998614468e-18, /* logim[102] */ 4.16291803858237783591365989446195611338780307382474e-35, /* logil[102] */ } , { 1.10822510719299316406250000000000000000000000000000e+00, /* r[103] */ -1.02759733026446364867467764270259067416191101074219e-01, /* logih[103] */ 5.14131173582414775653668171432178439238499706689565e-18, /* logim[103] */ -2.03511710633920722432014459953905354472733979743122e-34, /* logil[103] */ } , { 1.10344839096069335937500000000000000000000000000000e+00, /* r[104] */ -9.84401771213754411826712953370588365942239761352539e-02, /* logih[104] */ 4.43863133643792238822177111529042861410430977956950e-18, /* logim[104] */ 3.12055863098469149547827014037274497005231280699218e-34, /* logil[104] */ } , { 1.09871244430541992187500000000000000000000000000000e+00, /* r[105] */ -9.41389890512167593072945237508974969387054443359375e-02, /* logih[105] */ 2.37342936135295683496202513568031672884920488134173e-19, /* logim[105] */ 2.33721773003055253003147894270712826153088420940698e-35, /* logil[105] */ } , { 1.09401702880859375000000000000000000000000000000000e+00, /* r[106] */ -8.98562695172144959565585509153606835752725601196289e-02, /* logih[106] */ 6.27446602451052736319026996501069657057280086335290e-19, /* logim[106] */ -3.52284010127094716016693656249620808330731317587528e-35, /* logil[106] */ } , { 1.08936166763305664062500000000000000000000000000000e+00, /* r[107] */ -8.55918986704354706196440361054555978626012802124023e-02, /* logih[107] */ -5.03513826084130895904008327416965851388338774947593e-18, /* logim[107] */ 6.86424026896698901114373288904478288437409959196820e-35, /* logil[107] */ } , { 1.08474564552307128906250000000000000000000000000000e+00, /* r[108] */ -8.13455314205279167438789045263547450304031372070312e-02, /* logih[108] */ 1.86223784192593707654359268192644483006930996779864e-18, /* logim[108] */ -9.08215611660981343459991418247070342987317386688394e-35, /* logil[108] */ } , { 1.08016872406005859375000000000000000000000000000000e+00, /* r[109] */ -7.71172549156562414651716608204878866672515869140625e-02, /* logih[109] */ 4.37349590112793692636976332290601524356283649435490e-18, /* logim[109] */ -2.43638510650083687411626047741666976256819270953612e-34, /* logil[109] */ } , { 1.07563018798828125000000000000000000000000000000000e+00, /* r[110] */ -7.29067112034412351251333461732428986579179763793945e-02, /* logih[110] */ 6.30693084361487082247322771068486204374546343933133e-18, /* logim[110] */ 3.44825082371128400572272238979928316738696119124015e-34, /* logil[110] */ } , { 1.07112979888916015625000000000000000000000000000000e+00, /* r[111] */ -6.87139782297249979148290321973036043345928192138672e-02, /* logih[111] */ -4.40922228882126717948257852084234011599535648658716e-18, /* logim[111] */ 2.00071285755297414487130516445636815235532199087333e-34, /* logil[111] */ } , { 1.06666660308837890625000000000000000000000000000000e+00, /* r[112] */ -6.45384615329246263959461771264614071696996688842773e-02, /* logih[112] */ 6.47055724777502681297997296903095954212491541204973e-18, /* logim[112] */ -3.53995576621708408093066388957026321212073337996708e-34, /* logil[112] */ } , { 1.06224060058593750000000000000000000000000000000000e+00, /* r[113] */ -6.03804513842609302809449900450999848544597625732422e-02, /* logih[113] */ 2.15703432342306119511642925211564389619524247753812e-18, /* logim[113] */ -3.99051054966201464148223117427430962485432571249835e-35, /* logil[113] */ } , { 1.05785131454467773437500000000000000000000000000000e+00, /* r[114] */ -5.62397891033892469159205518280941760167479515075684e-02, /* logih[114] */ 3.28339677990388790029372693220459728960401288179580e-18, /* logim[114] */ 1.51915205677141595589208947882243470550543557886170e-35, /* logil[114] */ } , { 1.05349802970886230468750000000000000000000000000000e+00, /* r[115] */ -5.21160840267197236763685452842764789238572120666504e-02, /* logih[115] */ -2.76876652450490527514912306264172616345243137067863e-19, /* logim[115] */ 4.97747635693761803951848478678221385327287067714555e-36, /* logil[115] */ } , { 1.04918026924133300781250000000000000000000000000000e+00, /* r[116] */ -4.80091633070045681330739739678392652422189712524414e-02, /* logih[116] */ -1.43903217358996287866324353045636173989420593009940e-18, /* logim[116] */ 9.24533961563047616614044310774847027299245259235749e-35, /* logil[116] */ } , { 1.04489803314208984375000000000000000000000000000000e+00, /* r[117] */ -4.39193047153486545997047585387917933985590934753418e-02, /* logih[117] */ -1.76247347066130256555880115492006953917590179181782e-18, /* logim[117] */ 2.95067167680037492936848210009098107643918346324819e-35, /* logil[117] */ } , { 1.04065036773681640625000000000000000000000000000000e+00, /* r[118] */ -3.98458712942959952796329048396728467196226119995117e-02, /* logih[118] */ 3.12956491324511750770873688790894657687633404551217e-18, /* logim[118] */ 9.08530842942513514982993220469010912494881545842223e-35, /* logil[118] */ } , { 1.03643727302551269531250000000000000000000000000000e+00, /* r[119] */ -3.57891329972944774451271143789199413731694221496582e-02, /* logih[119] */ -2.94786708868720304892365707065135221787713948130908e-19, /* logim[119] */ 1.84384763058385810856389175018656477977822636794864e-35, /* logil[119] */ } , { 1.03225803375244140625000000000000000000000000000000e+00, /* r[120] */ -3.17486685122574663342476242178236134350299835205078e-02, /* logih[120] */ -3.03821748520802146852642560679641488082417537178322e-18, /* logim[120] */ 6.90127669441551609256721347857289051065660383455449e-35, /* logil[120] */ } , { 1.02811241149902343750000000000000000000000000000000e+00, /* r[121] */ -2.77245107619511835239656249996187398210167884826660e-02, /* logih[121] */ 1.56537436220084983093655029081028016172956628311065e-18, /* logim[121] */ -4.26959324792631463690822650182944301609062827136870e-35, /* logil[121] */ } , { 1.02399992942810058593750000000000000000000000000000e+00, /* r[122] */ -2.37164576994431455791989549197751330211758613586426e-02, /* logih[122] */ -1.57190014657555079881764699090245893269914973184857e-19, /* logim[122] */ 4.62721637019171363059082221740445258999073602747011e-36, /* logil[122] */ } , { 1.01992034912109375000000000000000000000000000000000e+00, /* r[123] */ -1.97245351501005340699723689112943247891962528228760e-02, /* logih[123] */ 1.34458916305708123412045028332259969564528051018263e-18, /* logim[123] */ -6.02768376061644464555810636396264987280148524662430e-35, /* logil[123] */ } , { 1.01587295532226562500000000000000000000000000000000e+00, /* r[124] */ -1.57482973634926158579272481574662378989160060882568e-02, /* logih[124] */ -1.00208727697080412925749596659626020152032796409604e-18, /* logim[124] */ 7.75790823155383991507800579878754988160969197338737e-35, /* logil[124] */ } , { 1.01185774803161621093750000000000000000000000000000e+00, /* r[125] */ -1.17879957989121472716753658005472971126437187194824e-02, /* logih[125] */ 2.12843993900806841444093729096134188145078357457959e-19, /* logim[125] */ -7.36236149534638490756917054603187520349493909791838e-36, /* logil[125] */ } , { 1.00787401199340820312500000000000000000000000000000e+00, /* r[126] */ -7.84317373573558719590526067122482345439493656158447e-03, /* logih[126] */ -2.76470798179560918828283984091643257584228907545928e-19, /* logim[126] */ 1.46121103426200283031313413564673422143931331178612e-35, /* logil[126] */ } , { 1.00392150878906250000000000000000000000000000000000e+00, /* r[127] */ -3.91383971648977691676352108629544090945273637771606e-03, /* logih[127] */ -4.28019276224719221462393891683495367484578724177817e-19, /* logim[127] */ -2.25272542183557712010826889962617244762256960750126e-35, /* logil[127] */ } }; interval-2.1.0/src/crlibm/log2_accurate.c0000644000000000000000000002152313031036767016412 0ustar 00000000000000/* * Correctly rounded base 2 logarithm * * Author : David Defour * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include "log2_accurate.h" /* * 1) First reduction: exponent extraction * E * x = 2^ .(1+f) with 0 <= f < 1 * * log2(x) = E + log2(1+f) where: * - log2(1+f) need to be evalute * * * 2) Avoiding accuracy problem when E=-1 by testing * * if (1+f >= sqrt(2)) then * 1+f = (1+f)/2; E = E+1; * and, * log2(x) = (E+1) + log2((1+f)/2) * * so now: sqrt(2)/2 <= (1+f) < sqrt(2) * * * 3) Second reduction: tabular reduction * -4 * wi = 1 + i. 2^ * 1 * log2(1+f) = log2(wi) + log2 ( 1 + --- . (1 + f - wi) ) * wi * * then |(1+f-wi)/wi| <= 2^-5 if we use rounded to nearest. * * 4) Computation: * a) Table lookup of: * - ti = log2(wi) * - inv_wi = 1/(wi) * b) Polynomial evaluation of: * - P(R) ~ log2(1 + R), where R = (1+f-wi) * inv_wi * * -5 * with |R| < 2^ * * * 5) Reconstruction: * log2(x) = E + t_i + P(R) * * * Note 1: * To guarantee log2(2^n)=n, where 2^n is normal, the rounding * mode must set to Round-to-Nearest. * * Special cases: * log2(x) is NaN with signal if x < 0; * log2(+INF) is +INF with no signal; log2(0) is -INF with signal; * log2(NaN) is that NaN with no signal; * log2(2^N) = N * */ #define SQRT_2 1.4142135623730950489e0 /************************************************************* ************************************************************* * ROUNDED TO NEAREST ************************************************************* *************************************************************/ double log2_rn(double x) { scs_t R, res1, sc_exp; scs_ptr inv_wi, ti; db_number nb, nb2, wi, resd; int i, E=0; nb.d = x; /* Filter cases */ if (nb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((nb.i[HI] & 0x7fffffff)|nb.i[LO])==0) return 1.0/0.0; /* log(+/-0) = -Inf */ if (nb.i[HI] < 0) return (x-x)/0; /* log(-x) = Nan */ /* Subnormal number */ E -= (SCS_NB_BITS*2); /* keep in mind that x is a subnormal number */ nb.d *=SCS_RADIX_TWO_DOUBLE; /* make x as normal number */ /* We may just want add 2 to the scs number.index */ /* may be .... we will see */ } if (nb.i[HI] >= 0x7ff00000) return x+x; /* Inf or Nan */ /* find n, nb.d such that sqrt(2)/2 < nb.d < sqrt(2) */ E += (nb.i[HI]>>20)-1023; nb.i[HI] = (nb.i[HI] & 0x000fffff) | 0x3ff00000; if (nb.d > SQRT_2){ nb.d *= 0.5; E++; } scs_set_si(sc_exp, E); /* to normalize nb.d and round to nearest */ /* +((2^4 - trunc(sqrt(2)/2) *2^4 )*2 + 1)/2^5 */ nb2.d = nb.d + norm_number.d; i = (nb2.i[HI] & 0x000fffff); i = i >> 16; /* 0<= i <=11 */ wi.d = (11+i)*(double)0.6250e-1; /* (1+f-w_i) */ nb.d -= wi.d; /* Table reduction */ ti = table_ti_ptr[i]; inv_wi = table_inv_wi_ptr[i]; /* R = (1+f-w_i)/w_i */ scs_set_d(R, nb.d); scs_mul(R, R, inv_wi); /* * Polynomial evaluation of log2(1 + R) with an error less than 2^(-130) */ scs_mul(res1, constant_poly_ptr[0], R); for(i=1; i<20; i++){ scs_add(res1, constant_poly_ptr[i], res1); scs_mul(res1, res1, R); } scs_add(res1, res1, ti); scs_add(res1, res1, sc_exp); scs_get_d(&resd.d, res1); return resd.d; } /************************************************************* ************************************************************* * ROUNDED TOWARD -INFINITY ************************************************************* *************************************************************/ double log2_rd(double x) { scs_t R, res1, sc_exp; scs_ptr inv_wi, ti; db_number nb, nb2, wi, resd; int i, E=0; nb.d = x; /* Filter cases */ if (nb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((nb.i[HI] & 0x7fffffff)|nb.i[LO])==0) return 1.0/0.0; /* log(+/-0) = -Inf */ if (nb.i[HI] < 0) return (x-x)/0; /* log(-x) = Nan */ /* Subnormal number */ E -= (SCS_NB_BITS*2); /* keep in mind that x is a subnormal number */ nb.d *=SCS_RADIX_TWO_DOUBLE; /* make x as normal number */ /* We may just want add 2 to the scs number.index */ /* may be .... we will see */ } if (nb.i[HI] >= 0x7ff00000) return x+x; /* Inf or Nan */ /* find n, nb.d such that sqrt(2)/2 < nb.d < sqrt(2) */ E += (nb.i[HI]>>20)-1023; nb.i[HI] = (nb.i[HI] & 0x000fffff) | 0x3ff00000; if (nb.d > SQRT_2){ nb.d *= 0.5; E++; } scs_set_si(sc_exp, E); /* to normalize nb.d and round to nearest */ /* +((2^4 - trunc(sqrt(2)/2) *2^4 )*2 + 1)/2^5 */ nb2.d = nb.d + norm_number.d; i = (nb2.i[HI] & 0x000fffff); i = i >> 16; /* 0<= i <=11 */ wi.d = (11+i)*(double)0.6250e-1; /* (1+f-w_i) */ nb.d -= wi.d; /* Table reduction */ ti = table_ti_ptr[i]; inv_wi = table_inv_wi_ptr[i]; /* R = (1+f-w_i)/w_i */ scs_set_d(R, nb.d); scs_mul(R, R, inv_wi); /* * Polynomial evaluation of log2(1 + R) with an error less than 2^(-130) */ scs_mul(res1, constant_poly_ptr[0], R); for(i=1; i<20; i++){ scs_add(res1, constant_poly_ptr[i], res1); scs_mul(res1, res1, R); } scs_add(res1, res1, ti); scs_add(res1, res1, sc_exp); scs_get_d_minf(&resd.d, res1); return resd.d; } /************************************************************* ************************************************************* * ROUNDED TOWARD +INFINITY ************************************************************* *************************************************************/ double log2_ru(double x) { scs_t R, res1, sc_exp; scs_ptr inv_wi, ti; db_number nb, nb2, wi, resd; int i, E=0; nb.d = x; /* Filter cases */ if (nb.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((nb.i[HI] & 0x7fffffff)|nb.i[LO])==0) return 1.0/0.0; /* log(+/-0) = -Inf */ if (nb.i[HI] < 0) return (x-x)/0; /* log(-x) = Nan */ /* Subnormal number */ E -= (SCS_NB_BITS*2); /* keep in mind that x is a subnormal number */ nb.d *=SCS_RADIX_TWO_DOUBLE; /* make x as normal number */ /* We may just want add 2 to the scs number.index */ /* may be .... we will see */ } if (nb.i[HI] >= 0x7ff00000) return x+x; /* Inf or Nan */ /* find n, nb.d such that sqrt(2)/2 < nb.d < sqrt(2) */ E += (nb.i[HI]>>20)-1023; nb.i[HI] = (nb.i[HI] & 0x000fffff) | 0x3ff00000; if (nb.d > SQRT_2){ nb.d *= 0.5; E++; } scs_set_si(sc_exp, E); /* to normalize nb.d and round to nearest */ /* +((2^4 - trunc(sqrt(2)/2) *2^4 )*2 + 1)/2^5 */ nb2.d = nb.d + norm_number.d; i = (nb2.i[HI] & 0x000fffff); i = i >> 16; /* 0<= i <=11 */ wi.d = (11+i)*(double)0.6250e-1; /* (1+f-w_i) */ nb.d -= wi.d; /* Table reduction */ ti = table_ti_ptr[i]; inv_wi = table_inv_wi_ptr[i]; /* R = (1+f-w_i)/w_i */ scs_set_d(R, nb.d); scs_mul(R, R, inv_wi); /* * Polynomial evaluation of log2(1 + R) with an error less than 2^(-130) */ scs_mul(res1, constant_poly_ptr[0], R); for(i=1; i<20; i++){ scs_add(res1, constant_poly_ptr[i], res1); scs_mul(res1, res1, R); } scs_add(res1, res1, ti); scs_add(res1, res1, sc_exp); scs_get_d_pinf(&resd.d, res1); return resd.d; } /************************************************************* ************************************************************* * ROUNDED TOWARDS ZERO ************************************************************* *************************************************************/ double log2_rz(double x) { if (x > 1) return log2_rd(x); else return log2_ru(x); } interval-2.1.0/src/crlibm/log2_accurate.h0000644000000000000000000001577013031036767016426 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" /* * Constant to compute the logarithm base 2. */ #ifdef WORDS_BIGENDIAN static const db_number norm_number = {{0x3FD60000, 0x00000000}}; /* 11*2^(-5) */ #else static const db_number norm_number = {{0x00000000, 0x3FD60000}}; /* 11*2^(-5) */ #endif static const scs table_ti[13]= /* ~-5.405684e-01 */ {{{0x2298ac1f, 0x33457c40, 0x1c141e66, 0x3eaaab29, 0x1030633d, 0x048bef17, 0x1a91d6a1, 0x22230522}, DB_ONE, -1, -1 } , /* ~-4.150375e-01 */ {{0x1a8ff971, 0x20429786, 0x017fd3b7, 0x35f97452, 0x0bb6c306, 0x15c5da64, 0x3efe1069, 0x2fb2da05}, DB_ONE, -1, -1 } , /* ~-2.995603e-01 */ {{0x132bfee3, 0x1c3b9a19, 0x1a24978d, 0x38d67cae, 0x3878c2df, 0x02d6ff98, 0x24e1a2a9, 0x1b4f917d}, DB_ONE, -1, -1 } , /* ~-1.926451e-01 */ {{0x0c544c05, 0x17f7a64c, 0x3354dbf1, 0x1bec1a57, 0x2e31ce56, 0x2b7fe8e9, 0x20d510a7, 0x19e262f3}, DB_ONE, -1, -1 } , /* ~-9.310940e-02 */ {{0x05f58125, 0x2cfbb4c6, 0x1ced1447, 0x38c2b4e4, 0x3edd56b0, 0x1637ed79, 0x2a14f4fe, 0x3db0ce67}, DB_ONE, -1, -1 } , /* ZERO */ {{0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, {{0, 0}}, 0, 1 } , /* ~8.746284e-02 */ {{0x0598fdbe, 0x2c913167, 0x33314e09, 0x2144575a, 0x30f2941f, 0x0fab1d27, 0x3e612491, 0x0849fe51}, DB_ONE, -1, 1 } , /* ~1.699250e-01 */ {{0x0ae00d1c, 0x3f7ad0f3, 0x3d005890, 0x140d175b, 0x289279f3, 0x14744b36, 0x0203df2c, 0x209a4bf4}, DB_ONE, -1, 1 } , /* ~2.479275e-01 */ {{0x0fde0b5c, 0x204d0144, 0x1d46ccc5, 0x0f09de6b, 0x39267ab7, 0x1b5a9520, 0x35aacfb1, 0x311d7642}, DB_ONE, -1, 1 } , /* ~3.219281e-01 */ {{0x149a784b, 0x3346e2bf, 0x2492bf6f, 0x3d36bf6d, 0x0cd96c55, 0x3f8deceb, 0x14e91b6a, 0x32020b9e}, DB_ONE, -1, 1 } , /* ~3.923174e-01 */ {{0x191bba89, 0x07c5c22d, 0x0b2b5056, 0x2e1a7156, 0x06176ea2, 0x3eba3cb1, 0x202cdeee, 0x366ac306}, DB_ONE, -1, 1 } , /* ~4.594316e-01 */ {{0x1d6753e0, 0x0cba83bf, 0x23ebe199, 0x015554d6, 0x2fcf9cc2, 0x3b7410e8, 0x256e295e, 0x1ddcfadd}, DB_ONE, -1, 1 } , /* ~5.235620e-01 */ {{0x21820a01, 0x2b1d532c, 0x104aea53, 0x1b12ef0a, 0x2a0fca1a, 0x1dd6be1d, 0x0730b711, 0x35eaa979}, DB_ONE, -1, 1 } }; static const scs table_inv_wi[13]= /* ~1.454545e+00 */ {{{0x00000001, 0x1d1745d1, 0x1d1745d1, 0x1d1745d1, 0x1d1745d1, 0x1d1745d1, 0x1d183e2a, 0x36835582}, DB_ONE, 0, 1 } , /* ~1.333333e+00 */ {{0x00000001, 0x15555555, 0x15555555, 0x15555555, 0x15555555, 0x15555555, 0x15549b7e, 0x1a416c6b}, DB_ONE, 0, 1 } , /* ~1.230769e+00 */ {{0x00000001, 0x0ec4ec4e, 0x313b13b1, 0x0ec4ec4e, 0x313b13b1, 0x0ec4ec4e, 0x313a6825, 0x3ab28b77}, DB_ONE, 0, 1 } , /* ~1.142857e+00 */ {{0x00000001, 0x09249249, 0x09249249, 0x09249249, 0x09249249, 0x09249249, 0x09238b74, 0x26f620a6}, DB_ONE, 0, 1 } , /* ~1.066667e+00 */ {{0x00000001, 0x04444444, 0x11111111, 0x04444444, 0x11111111, 0x04444444, 0x1111d60e, 0x1f0c9d58}, DB_ONE, 0, 1 } , /* ~1.000000e+00 */ {{0x00000001, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 } , /* ~9.411765e-01 */ {{0x3c3c3c3c, 0x0f0f0f0f, 0x03c3c3c3, 0x30f0f0f0, 0x3c3c3c3c, 0x0f0f923d, 0x16e0e0a4, 0x3a84202f}, DB_ONE, -1, 1 } , /* ~8.888889e-01 */ {{0x38e38e38, 0x38e38e38, 0x38e38e38, 0x38e38e38, 0x38e38e38, 0x38e3946a, 0x2e0ee2c9, 0x0d6e0fbd}, DB_ONE, -1, 1 } , /* ~8.421053e-01 */ {{0x35e50d79, 0x10d79435, 0x39435e50, 0x35e50d79, 0x10d79435, 0x3943324d, 0x0637ea85, 0x131a67ba}, DB_ONE, -1, 1 } , /* ~8.000000e-01 */ {{0x33333333, 0x0ccccccc, 0x33333333, 0x0ccccccc, 0x33333333, 0x0ccccccc, 0x33333333, 0x0ccccccc}, DB_ONE, -1, 1 } , /* ~7.619048e-01 */ {{0x30c30c30, 0x30c30c30, 0x30c30c30, 0x30c30c30, 0x30c30c30, 0x30c2f1a4, 0x160958a1, 0x2b03bc88}, DB_ONE, -1, 1 } , /* ~7.272727e-01 */ {{0x2e8ba2e8, 0x2e8ba2e8, 0x2e8ba2e8, 0x2e8ba2e8, 0x2e8ba2e8, 0x2e8bcb74, 0x2d78b525, 0x00a1db67}, DB_ONE, -1, 1 } , /* ~6.956522e-01 */ {{0x2c8590b2, 0x0590b216, 0x10b21642, 0x321642c8, 0x1642c859, 0x02c8590b, 0x08590b21, 0x190b2164}, DB_ONE, -1, 1 } }; static const scs constant_poly[20]= /* ~-7.247187e-02 */ {{{0x04a3610e, 0x3280f22f, 0x1de04b83, 0x13d0592c, 0x01c1f347, 0x0e59a808, 0x0bcf5cfa, 0x3009a167}, DB_ONE, -1, -1 } , /* ~7.626763e-02 */ {{0x04e191a1, 0x27127aea, 0x2fb498c3, 0x3f8e3721, 0x2688ed52, 0x38503e4f, 0x3b216e42, 0x17d8666c}, DB_ONE, -1, 1 } , /* ~-8.014898e-02 */ {{0x05212933, 0x12c0276e, 0x1534c74e, 0x1ffc3802, 0x36935f91, 0x25fe848d, 0x2bade416, 0x110f0662}, DB_ONE, -1, -1 } , /* ~8.486372e-02 */ {{0x056e6838, 0x35aa4f4a, 0x2ae2f258, 0x30768483, 0x2bc43d6e, 0x176d2fe1, 0x17488263, 0x30f7670b}, DB_ONE, -1, 1 } , /* ~-9.016844e-02 */ {{0x05c551da, 0x1166e535, 0x10625f98, 0x08af81ee, 0x04feb59e, 0x2906123e, 0x0b31f878, 0x0693beb1}, DB_ONE, -1, -1 } , /* ~9.617967e-02 */ {{0x0627cec6, 0x20792d0d, 0x181b90ab, 0x0c8e3405, 0x1fe3b53f, 0x0f6d3b7a, 0x00eefd12, 0x0808849b}, DB_ONE, -1, 1 } , /* ~-1.030496e-01 */ {{0x06985d8a, 0x27a1d37d, 0x3fa3c0e9, 0x37e7d679, 0x0379ed1d, 0x25a15e16, 0x3ef8c491, 0x2414ab4f}, DB_ONE, -1, -1 } , /* ~1.109765e-01 */ {{0x071a3d5a, 0x0d27a702, 0x138411a6, 0x15701cae, 0x31ef415d, 0x1985227d, 0x31a4c54c, 0x15d3a279}, DB_ONE, -1, 1 } , /* ~-1.202246e-01 */ {{0x07b1c277, 0x03a04150, 0x3be8d05b, 0x2f373cf4, 0x105c73c2, 0x0ee0272b, 0x0b2bf018, 0x1ad7026f}, DB_ONE, -1, -1 } , /* ~1.311541e-01 */ {{0x0864d424, 0x328046b9, 0x132f0fc6, 0x2b14d554, 0x189d4b79, 0x2ec40035, 0x15083d44, 0x33a13b8c}, DB_ONE, -1, 1 } , /* ~-1.442695e-01 */ {{0x093bb628, 0x1df37fcf, 0x022eb69a, 0x0b325d1d, 0x0625c904, 0x1ccaa7ae, 0x0ed7ce1d, 0x3202ff74}, DB_ONE, -1, -1 } , /* ~1.602994e-01 */ {{0x0a42589e, 0x2f80551e, 0x3eb3ec54, 0x1a1094cd, 0x23649796, 0x328d4019, 0x3f6371c6, 0x37a359a1}, DB_ONE, -1, 1 } , /* ~-1.803369e-01 */ {{0x0b8aa3b2, 0x25705fc2, 0x3bbedcca, 0x35a13588, 0x15c06cdc, 0x39fbf52c, 0x2b666451, 0x350d8287}, DB_ONE, -1, -1 } , /* ~2.060993e-01 */ {{0x0d30bb15, 0x0f5bdb27, 0x3b23121c, 0x383c6bb0, 0x2f3b4fd2, 0x2dba0ce0, 0x0230a445, 0x306b1136}, DB_ONE, -1, 1 } , /* ~-2.404492e-01 */ {{0x0f6384ee, 0x07407fae, 0x24fe0aa6, 0x3c7aefd2, 0x12953456, 0x0d1d1991, 0x2af86714, 0x26b4c925}, DB_ONE, -1, -1 } , /* ~2.885390e-01 */ {{0x12776c50, 0x3be6ff9e, 0x12ca7330, 0x1a6d448b, 0x1ef18433, 0x375e9366, 0x21f2efcf, 0x38ab1d93}, DB_ONE, -1, 1 } , /* ~-3.606738e-01 */ {{0x17154765, 0x0ae0bf85, 0x377d0ffd, 0x2836248a, 0x3b8e6858, 0x123f10ae, 0x0c65387c, 0x26048456}, DB_ONE, -1, -1 } , /* ~4.808983e-01 */ {{0x1ec709dc, 0x0e80ff5d, 0x09fc1552, 0x0af12c97, 0x37bd6a2c, 0x3ebc8f65, 0x113a7c28, 0x1663571a}, DB_ONE, -1, 1 } , /* ~-7.213475e-01 */ {{0x2e2a8eca, 0x15c17f0b, 0x2efa1ffb, 0x10691d3d, 0x09a93721, 0x2d59e835, 0x1baea424, 0x28b120a0}, DB_ONE, -1, -1 } , /* ~1.442695e+00 */ {{0x00000001, 0x1c551d94, 0x2b82fe17, 0x1df43ff6, 0x20d23a7c, 0x3b9ff352, 0x14d59cbf, 0x00fe1bdb}, DB_ONE, 0, 1 } }; #define constant_poly_ptr (scs_ptr)&constant_poly #define table_ti_ptr (scs_ptr)&table_ti #define table_inv_wi_ptr (scs_ptr)&table_inv_wi interval-2.1.0/src/crlibm/log_accurate.c0000644000000000000000000000634513031036767016335 0ustar 00000000000000/* * Correctly rounded logarithm * * Author : David Defour * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include #include "log_accurate.h" /* * 1) First reduction: exponent extraction * E * x = 2^ .(1+f) with 0 <= f < 1 * * log(x) = E.log(2) + log(1+f) where: * - log(2) is tabulated * - log(1+f) need to be evaluated * * * 2) Avoiding accuracy problem when E=-1 by testing * * if (1+f >= sqrt(2)) then * 1+f = (1+f)/2; E = E+1; * and, * log(x) = (E+1).log(2) + log((1+f)/2) * * so now: sqrt(2)/2 <= (1+f) < sqrt(2) * * * 3) Second reduction: tabular reduction * -4 * wi = 1 + i. 2^ * 1 * log(1+f) = log(wi) + log ( 1 + --- . (1 + f - wi) ) * wi * * then |(1+f-wi)/wi| <= 2^-5 if we use rounded to nearest. * * 4) Computation: * a) Table lookup of: * - ti = log(wi) * - inv_wi = 1/(wi) * b) Polynomial evaluation of: * - P(R) ~ log(1 + R), where R = (1+f-wi) * inv_wi * * -5 * with |R| < 2^ * * * 5) Reconstruction: * log(x) = E.log(2) + t_i + P(R) * */ void scs_log(scs_ptr res, db_number y, int E){ scs_t R, sc_ln2_times_E, res1, addi; scs_ptr ti, inv_wi; db_number z, wi; int i; #if EVAL_PERF crlibm_second_step_taken++; #endif /* to normalize y.d and round to nearest */ /* + (1-trunc(sqrt(2.)/2 * 2^(4))*2^(-4) )+2.^(-(4+1))*/ z.d = y.d + norm_number.d; i = (z.i[HI] & 0x000fffff); i = i >> 16; /* 0<= i <=11 */ wi.d = ((double)(11+i))*0.0625; /* (1+f-w_i) */ y.d -= wi.d; /* Table reduction */ ti = table_ti_ptr[i]; inv_wi = table_inv_wi_ptr[i]; /* R = (1+f-w_i)/w_i */ scs_set_d(R, y.d); scs_mul(R, R, inv_wi); /* * Polynomial evaluation of log(1 + R) with an error less than 2^(-130) */ scs_mul(res1, constant_poly_ptr[0], R); for(i=1; i<20; i++){ scs_add(addi, constant_poly_ptr[i], res1); scs_mul(res1, addi, R); } if(E==0){ scs_add(res, res1, ti); }else{ /* sc_ln2_times_E = E*log(2) */ scs_set(sc_ln2_times_E, sc_ln2_ptr); if (E >= 0){ scs_mul_ui(sc_ln2_times_E, (unsigned int) E); }else{ scs_mul_ui(sc_ln2_times_E, (unsigned int) -E); sc_ln2_times_E->sign = -1; } scs_add(addi, res1, ti); scs_add(res, addi, sc_ln2_times_E); } } interval-2.1.0/src/crlibm/log_accurate.h0000644000000000000000000001635213031036767016341 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" /* * Constant to compute the natural logarithm. */ #ifdef WORDS_BIGENDIAN static const db_number norm_number = {{0x3FD60000, 0x00000000}}; /* 11*2^(-5) */ #else static const db_number norm_number = {{0x00000000, 0x3FD60000}}; /* 11*2^(-5) */ #endif #define SQRT_2 1.4142135623730950489e0 static const scs sc_ln2={{0x2c5c85fd, 0x3d1cf79a, 0x2f278ece, 0x1803f2f6, 0x2bd03cd0, 0x3267298b, 0x18b62834, 0x175b8baa}, DB_ONE, -1, 1 }; #define sc_ln2_ptr (scs_ptr)(&sc_ln2) static const scs table_ti[13]= /* ~-3.746934e-01 */ {{{0x17fafa3b, 0x360546fb, 0x1e6fdb53, 0x0b1225e6, 0x15f38987, 0x26664702, 0x3cb1bf6d, 0x118a64f9}, DB_ONE, -1, -1 } , /* ~-2.876821e-01 */ {{0x12696211, 0x0d36e49e, 0x03beb767, 0x1b02aa70, 0x2a30f490, 0x3732bb37, 0x2425c6da, 0x1fc53d0e}, DB_ONE, -1, -1 } , /* ~-2.076394e-01 */ {{0x0d49f69e, 0x115b3c6d, 0x395f53bd, 0x0b901b99, 0x2e77188a, 0x3e3d1ab5, 0x1147dede, 0x05483ae4}, DB_ONE, -1, -1 } , /* ~-1.335314e-01 */ {{0x088bc741, 0x04fc8f7b, 0x319c5a0f, 0x38e5bd03, 0x31dda8fe, 0x30f08645, 0x2fa1d5c5, 0x02c6529d}, DB_ONE, -1, -1 } , /* ~-6.453852e-02 */ {{0x0421662d, 0x19e3a068, 0x228ff66f, 0x3503372c, 0x04bf1b16, 0x0ff1b85c, 0x006c21b2, 0x21a9efd6}, DB_ONE, -1, -1 } , /* ZERO */ {{0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, {{0, 0}}, 0, 1 } , /* ~6.062462e-02 */ {{0x03e14618, 0x008b1533, 0x02f992e2, 0x37759978, 0x2634d1d3, 0x13375edb, 0x2e4634ea, 0x1dcf0aef}, DB_ONE, -1, 1 } , /* ~1.177830e-01 */ {{0x0789c1db, 0x22af2e5e, 0x27aa1fff, 0x21fe9e15, 0x176e53af, 0x04015c6b, 0x021a0541, 0x006df1d7}, DB_ONE, -1, 1 } , /* ~1.718503e-01 */ {{0x0aff9838, 0x14f27a79, 0x039f1050, 0x0e424775, 0x3f35571c, 0x355ff008, 0x1ca13efc, 0x3c2c8490}, DB_ONE, -1, 1 } , /* ~2.231436e-01 */ {{0x0e47fbe3, 0x33534435, 0x212ec0f7, 0x25ff7344, 0x2571d97a, 0x274129e2, 0x12b111db, 0x2c051568}, DB_ONE, -1, 1 } , /* ~2.719337e-01 */ {{0x11675cab, 0x2ae98380, 0x39cc7d57, 0x041b8b82, 0x0fc19f41, 0x0a43c91d, 0x1523ef69, 0x164b69f6}, DB_ONE, -1, 1 } , /* ~3.184537e-01 */ {{0x14618bc2, 0x0717b09f, 0x10b7b37b, 0x0cf1cd10, 0x15dcb349, 0x0c00c397, 0x2c39cc9b, 0x274c94a8}, DB_ONE, -1, 1 } , {{0x1739d7f6, 0x2ef401a7, 0x0e24c53f, 0x2b4fbde5, 0x2ab77843, 0x1cea5975, 0x1eeef249, 0x384d2344}, DB_ONE, -1, 1 } }; #define table_ti_ptr (scs_ptr)&table_ti static const scs table_inv_wi[13]= /* ~1.454545e+00 */ {{{0x00000001, 0x1d1745d1, 0x1d1745d1, 0x1d1745d1, 0x1d1745d1, 0x1d1745d1, 0x1d183e2a, 0x36835582}, DB_ONE, 0, 1 } , /* ~1.333333e+00 */ {{0x00000001, 0x15555555, 0x15555555, 0x15555555, 0x15555555, 0x15555555, 0x15549b7e, 0x1a416c6b}, DB_ONE, 0, 1 } , /* ~1.230769e+00 */ {{0x00000001, 0x0ec4ec4e, 0x313b13b1, 0x0ec4ec4e, 0x313b13b1, 0x0ec4ec4e, 0x313a6825, 0x3ab28b77}, DB_ONE, 0, 1 } , /* ~1.142857e+00 */ {{0x00000001, 0x09249249, 0x09249249, 0x09249249, 0x09249249, 0x09249249, 0x09238b74, 0x26f620a6}, DB_ONE, 0, 1 } , /* ~1.066667e+00 */ {{0x00000001, 0x04444444, 0x11111111, 0x04444444, 0x11111111, 0x04444444, 0x1111d60e, 0x1f0c9d58}, DB_ONE, 0, 1 } , /* ~1.000000e+00 */ {{0x00000001, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 } , /* ~9.411765e-01 */ {{0x3c3c3c3c, 0x0f0f0f0f, 0x03c3c3c3, 0x30f0f0f0, 0x3c3c3c3c, 0x0f0f923d, 0x16e0e0a4, 0x3a84202f}, DB_ONE, -1, 1 } , /* ~8.888889e-01 */ {{0x38e38e38, 0x38e38e38, 0x38e38e38, 0x38e38e38, 0x38e38e38, 0x38e3946a, 0x2e0ee2c9, 0x0d6e0fbd}, DB_ONE, -1, 1 } , /* ~8.421053e-01 */ {{0x35e50d79, 0x10d79435, 0x39435e50, 0x35e50d79, 0x10d79435, 0x3943324d, 0x0637ea85, 0x131a67ba}, DB_ONE, -1, 1 } , /* ~8.000000e-01 */ {{0x33333333, 0x0ccccccc, 0x33333333, 0x0ccccccc, 0x33333333, 0x0ccccccc, 0x33333333, 0x0ccccccc}, DB_ONE, -1, 1 } , /* ~7.619048e-01 */ {{0x30c30c30, 0x30c30c30, 0x30c30c30, 0x30c30c30, 0x30c30c30, 0x30c2f1a4, 0x160958a1, 0x2b03bc88}, DB_ONE, -1, 1 } , /* ~7.272727e-01 */ {{0x2e8ba2e8, 0x2e8ba2e8, 0x2e8ba2e8, 0x2e8ba2e8, 0x2e8ba2e8, 0x2e8bcb74, 0x2d78b525, 0x00a1db67}, DB_ONE, -1, 1 } , /* ~6.956522e-01 */ {{0x2c8590b2, 0x0590b216, 0x10b21642, 0x321642c8, 0x1642c859, 0x02c8590b, 0x08590b21, 0x190b2164}, DB_ONE, -1, 1 } }; #define table_inv_wi_ptr (scs_ptr)&table_inv_wi static const scs constant_poly[20]= /*0 ~-5.023367e-02 */ {{{0x0337074b, 0x275aac5c, 0x2cf4a893, 0x38013cc3, 0x149a3416, 0x0e067307, 0x12745608, 0x1658e0d5}, DB_ONE, -1, -1 } , /*1 ~5.286469e-02 */ {{0x03622298, 0x252ff65c, 0x03001550, 0x2f457908, 0x32f78ecc, 0x17442a4e, 0x1d806366, 0x2c50350e}, DB_ONE, -1, 1 } , /*2 ~-5.555504e-02 */ {{0x038e36bb, 0x30665a9c, 0x119434c7, 0x3fdec8cb, 0x37dd3adb, 0x2663cd45, 0x230e43e9, 0x32b9663c}, DB_ONE, -1, -1 } , /*3 ~5.882305e-02 */ {{0x03c3c1bb, 0x38c473ae, 0x192b9c18, 0x242b7c4e, 0x3da8edc8, 0x04454ffe, 0x2cf133c6, 0x0c926fd0}, DB_ONE, -1, 1 } , /*4 ~-6.250000e-02 */ {{0x04000000, 0x2b72bb0a, 0x038f5efc, 0x34665092, 0x2461b6c9, 0x172f7050, 0x1218b5c1, 0x104862d7}, DB_ONE, -1, -1 } , /*5 ~6.666667e-02 */ {{0x04444444, 0x374f3324, 0x1531bcf1, 0x1d7d23fc, 0x26ff9670, 0x38fc33ae, 0x15bf1cfb, 0x2c9f1c2d}, DB_ONE, -1, 1 } , /*6 ~-7.142857e-02 */ {{0x04924924, 0x2489e5b6, 0x288b19c5, 0x2893519b, 0x2c3f35c0, 0x0b8bfdce, 0x3541ab49, 0x1de415bc}, DB_ONE, -1, -1 } , /*7 ~7.692308e-02 */ {{0x04ec4ec4, 0x3b0ce4bd, 0x14d14046, 0x0243ade9, 0x083cc34f, 0x393e6a5a, 0x2c1855f2, 0x259d599f}, DB_ONE, -1, 1 } , /*8 ~-8.333333e-02 */ {{0x05555555, 0x1555565b, 0x064b42af, 0x13bc7961, 0x1396754b, 0x33d85415, 0x2ba548d4, 0x039c4ff6}, DB_ONE, -1, -1 } , /*9 ~9.090909e-02 */ {{0x05d1745d, 0x05d1751c, 0x24facd05, 0x07540f86, 0x014f2ec1, 0x3bb3fa8b, 0x02e1da4c, 0x3304817c}, DB_ONE, -1, 1 } , /*10 ~-1.000000e-01 */ {{0x06666666, 0x19999999, 0x21667ee1, 0x0f5f75ea, 0x353af37f, 0x2578daa1, 0x07c76f47, 0x16541534}, DB_ONE, -1, -1 } , /*11 ~1.111111e-01 */ {{0x071c71c7, 0x071c71c7, 0x03e7af88, 0x2fca5d74, 0x0bb43f38, 0x050edb70, 0x3631b696, 0x1fc3e0d3}, DB_ONE, -1, 1 } , /*12 ~-1.250000e-01 */ {{0x08000000, 0x00000000, 0x00003ac6, 0x36c11384, 0x2d596ab4, 0x09257878, 0x0597dc26, 0x2d60813a}, DB_ONE, -1, -1 } , /*13 ~1.428571e-01 */ {{0x09249249, 0x09249249, 0x0924b1db, 0x0d002ac1, 0x0eafd708, 0x2b4df21d, 0x0458da93, 0x2d11460c}, DB_ONE, -1, 1 } , /*14 ~-1.666667e-01 */ {{0x0aaaaaaa, 0x2aaaaaaa, 0x2aaaaaa9, 0x0bb6630e, 0x2e44a5cf, 0x39f32e04, 0x105732b9, 0x01a76208}, DB_ONE, -1, -1 } , /*15 ~2.000000e-01 */ {{0x0ccccccc, 0x33333333, 0x0ccccccc, 0x0bbbe6e8, 0x253269ea, 0x0ec2a630, 0x10defc5c, 0x238aef3b}, DB_ONE, -1, 1 } , /*16 ~-2.500000e-01 */ {{0x10000000, 0x00000000, 0x00000000, 0x0001195c, 0x3654cd5a, 0x16ca3471, 0x343d2da0, 0x235273f2}, DB_ONE, -1, -1 } , /*17 ~3.333333e-01 */ {{0x15555555, 0x15555555, 0x15555555, 0x1555a1e0, 0x2eb2094a, 0x07dde891, 0x230e2bfa, 0x28aae6ab}, DB_ONE, -1, 1 } , /*18 ~-5.000000e-01 */ {{0x1fffffff, 0x3fffffff, 0x3fffffff, 0x3fffffff, 0x029bd81b, 0x360f63df, 0x28d28bd3, 0x3c15f394}, DB_ONE, -1, -1 } , /*19 ~1.000000e+00 */ {{0x3fffffff, 0x3fffffff, 0x3fffffff, 0x3fffffff, 0x39e04b7e, 0x08e4e337, 0x1a1e2ed3, 0x23e85705}, DB_ONE, -1, 1 } }; #define constant_poly_ptr (scs_ptr)&constant_poly interval-2.1.0/src/crlibm/log_fast.c0000644000000000000000000002227313031036767015501 0ustar 00000000000000/* * Correctly rounded logarithm * * Author : Daramy Catherine, Florent de Dinechin * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "log_fast.h" /* switches on various printfs. Default 0 */ #define DEBUG 0 /* * 1) First reduction: exponent extraction * E * x = 2^ .(y) with 1 <= y < 2 * * log(x) = E.log(2) + log(y) where: * - log(2) is tabulated * - log(y) need to be evaluated * * * 2) Avoiding accuracy problem when E=-1 by testing * * if (ny >= sqrt(2)) then * y = z/2; E = E+1; * and, * log(x) = (E+1).log(2) + log(y/2) * * so now: 11/16 <= sqrt(2)/2 <= y < sqrt(2) <= 23/16 * * * 3) Second reduction: tabular reduction * * The interval 1/sqrt(2) .. sqrt(2) is divided in 8 intervals. * So, find the interval X_i where y is. * And compute z = y - middle(X_i); * * 4) Computation: * * Polynomial evaluation of: * - P(z) ~ log(z+middle(X_i)) * * -4 -5 * with |z| < 2^ or 2^ depending the considered interval. * * * 5) Reconstruction: * log(x) = E.log(2) + P(z) * */ /* * Function used to evaluate log and pow functions */ void log_quick(double *pres_hi, double *pres_lo, int* prndcstindex, db_number * py, int E) { double ln2_times_E_HI, ln2_times_E_LO, res_hi, res_lo; double z, res, P_hi, P_lo; int k, i; res=(double)E; if(E<0) E=-E; /* find the interval including y.d */ i = ((((*py).i[HI] & 0x001F0000)>>16)-6) ; if (i < 10) i = i>>1; else i = ((i-1)>>1); z = (*py).d - (middle[i]).d; /* (exact thanks to Sterbenz Lemma) */ /* Compute ln2_times_E = E*log(2) in double-double */ Add12( ln2_times_E_HI, ln2_times_E_LO, res*ln2hi.d, res*ln2lo.d); /* Now begin the polynomial evaluation of log(1 + z) */ res = (Poly_h[i][DEGREE]).d; for(k=DEGREE-1; k>1; k--){ res *= z; res += (Poly_h[i][k]).d; } if(E <= EMIN_FASTPATH) { /* Slow path */ if(E==0) { *prndcstindex = 0 ; /* In this case we start with a double-double multiplication to get enough relative accuracy */ Mul12(&P_hi, &P_lo, res, z); Add22(&res_hi, &res_lo, (Poly_h[i][1]).d, (Poly_l[i][1]).d, P_hi, P_lo); Mul22(&P_hi, &P_lo, res_hi, res_lo, z, 0.); Add22(pres_hi, pres_lo, (Poly_h[i][0]).d, (Poly_l[i][0]).d, P_hi, P_lo); } else { if(E > EMIN_MEDIUMPATH) *prndcstindex = 2; else *prndcstindex =1; P_hi=res*z; Add12(res_hi, res_lo, (Poly_h[i][1]).d, (Poly_l[i][1]).d + P_hi); Mul22(&P_hi, &P_lo, res_hi, res_lo, z, 0.); Add22(&res_hi, &res_lo, (Poly_h[i][0]).d, (Poly_l[i][0]).d, P_hi, P_lo); /* Add E*log(2) */ Add22(pres_hi, pres_lo, ln2_times_E_HI, ln2_times_E_LO, res_hi, res_lo); } } else { /* Fast path */ *prndcstindex = 3 ; res = z*((Poly_h[i][1]).d + z*res); #if 1 Add12(P_hi,P_lo, ln2_times_E_HI, (Poly_h[i][0]).d ); Add12(*pres_hi, *pres_lo, P_hi, (res + ((Poly_l[i][0]).d + (ln2_times_E_LO + P_lo)))); #else Add12(*pres_hi, *pres_lo, ln2_times_E_HI, (Poly_h[i][0]).d + (res + ((Poly_l[i][0]).d + ln2_times_E_LO))); #endif } } /************************************************************* ************************************************************* * ROUNDED TO NEAREST * ************************************************************* *************************************************************/ double log_rn(double x){ db_number y; double res_hi,res_lo,roundcst; int E,rndcstindex; E=0; y.d=x; /* Filter cases */ if (y.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((y.i[HI] & 0x7fffffff)|y.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (y.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; y.d *= two52.d; /* make x a normal number */ } if (y.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* reduce to y.d such that sqrt(2)/2 < y.d < sqrt(2) */ E += (y.i[HI]>>20)-1023; /* extract the exponent */ y.i[HI] = (y.i[HI] & 0x000fffff) | 0x3ff00000; /* do exponent = 0 */ if (y.d > SQRT_2){ y.d *= 0.5; E++; } /* Call the actual computation */ log_quick(&res_hi, &res_lo, &rndcstindex, &y, E); roundcst = rncst[rndcstindex]; /* Test for rounding to the nearest */ if(res_hi == (res_hi + (res_lo * roundcst))) return res_hi; else { scs_t res; #if DEBUG printf("Going for Accurate Phase for x=%1.50e\n",x); #endif scs_log(res, y, E); scs_get_d(&res_hi, res); return res_hi; } } /************************************************************* ************************************************************* * ROUNDED TOWARD -INFINITY * ************************************************************* *************************************************************/ double log_rd(double x){ db_number y; double res_hi,res_lo,roundcst; int E,rndcstindex; scs_t res; E=0; y.d=x; /* Filter cases */ if (y.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((y.i[HI] & 0x7fffffff)|y.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (y.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; y.d *= two52.d; /* make x as normal number = x's mantissa */ } if (y.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* The only double whose log is exactly a double */ if(x==1.0) return 0.0; E += (y.i[HI]>>20)-1023; /* extract the exponent */ y.i[HI] = (y.i[HI] & 0x000fffff) | 0x3ff00000; /* do exponent = 0 */ if (y.d > SQRT_2){ y.d *= 0.5; E++; } log_quick(&res_hi, &res_lo, &rndcstindex, &y, E); roundcst = epsilon[rndcstindex]; TEST_AND_RETURN_RD(res_hi, res_lo, roundcst); /* if the previous block didn't return a value, launch accurate phase */ #if DEBUG printf("Going for Accurate Phase"); #endif scs_log(res, y, E); scs_get_d_minf(&res_hi, res); return res_hi; } /************************************************************* ************************************************************* * ROUNDED TOWARD +INFINITY * ************************************************************* *************************************************************/ double log_ru(double x){ db_number y; double res_hi,res_lo,roundcst; int E,rndcstindex; scs_t res; E=0; y.d=x; /* Filter cases */ if (y.i[HI] < 0x00100000){ /* x < 2^(-1022) */ if (((y.i[HI] & 0x7fffffff)|y.i[LO])==0){ return -1.0/0.0; } /* log(+/-0) = -Inf */ if (y.i[HI] < 0){ return (x-x)/0; /* log(-x) = Nan */ } /* Subnormal number */ E = -52; y.d *= two52.d; /* make x as normal number = x's mantissa */ } if (y.i[HI] >= 0x7ff00000){ return x+x; /* Inf or Nan */ } /* The only double whose log is exactly a double */ if(x==1.0) return 0.0; E += (y.i[HI]>>20)-1023; /* extract the exponent */ y.i[HI] = (y.i[HI] & 0x000fffff) | 0x3ff00000; /* do exponent = 0 */ if (y.d > SQRT_2){ y.d *= 0.5; E++; } log_quick(&res_hi, &res_lo, &rndcstindex, &y, E); roundcst = epsilon[rndcstindex]; TEST_AND_RETURN_RU(res_hi, res_lo, roundcst); /* if the previous block didn't return a value, launch accurate phase */ #if DEBUG printf("Going for Accurate Phase"); #endif scs_log(res, y, E); scs_get_d_pinf(&res_hi, res); return res_hi; } /************************************************************* ************************************************************* * ROUNDED TOWARD ZERO * ************************************************************* *************************************************************/ double log_rz(double x){ if(x>1) return log_rd(x); else return log_ru(x); } interval-2.1.0/src/crlibm/log_fast.h0000644000000000000000000003701213031036767015503 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" /*File generated by maple/coef_log.mw*/ #define SQRT_2 1.4142135623730950489e0 #define DEGREE 12 #define EMIN_MEDIUMPATH 23.000 #define EMIN_FASTPATH 185.000 /* Constants for rounding */ static const double epsilon[4] = { /* Case E=0 */ 4.47385432225115274522995672974873440655535693998277e-18, /* Middle case */ 8.40963020519242390613590856552459545441732156457476e-19, /* Case E>EminMedPath */ 3.19013236586914638175957676953204491380730158561523e-20, /* And for the fast path */ 1.65439555368591958127629148820687373633319579538065e-19 }; static const double rncst[4] = { /* Case E=0 */ 1.08596671427669422271833354898262768983840942382813e+00, /* Middle case */ 1.01526872993599659444896587956463918089866638183594e+00, /* Case E>EminMedPath */ 1.00057496390146027920309279579669237136840820312500e+00, /* And for the fast path */ 1.00298612635768380485501438670326024293899536132813e+00 }; #ifdef WORDS_BIGENDIAN static const db_number ln2hi = {{0x3FE62E42,0xFEFA3800}} /* +6.9314718056e-01 */; static const db_number ln2lo = {{0x3D2EF357,0x93C76730}} /* +5.4979230187e-14 */; static const db_number two52 = {{0x43300000,0x00000000}} /* +4.5035996274e+15 */; static const db_number middle[8] = { {{0x3FE7504F,0x333F9DE3}} /* +7.2855339059e-01 */ , {{0x3FE90000,0x00000000}} /* +7.8125000000e-01 */ , {{0x3FEB0000,0x00000000}} /* +8.4375000000e-01 */ , {{0x3FED0000,0x00000000}} /* +9.0625000000e-01 */ , {{0x3FF00000,0x00000000}} /* +1.0000000000e+00 */ , {{0x3FF20000,0x00000000}} /* +1.1250000000e+00 */ , {{0x3FF40000,0x00000000}} /* +1.2500000000e+00 */ , {{0x3FF5D04F,0x333F9DE9}} /* +1.3633567812e+00 */ }; static const db_number Poly_h[8][13] = { /* polynomial 1 */ { {{0xBFD444B8,0x73F60B09}} /* -3.1669436764e-01 */ , {{0x3FF5F619,0x980C433A}} /* +1.3725830020e+00 */ , {{0xBFEE24CC,0x824C9A57}} /* -9.4199204873e-01 */ , {{0x3FEB954C,0x47881604}} /* +8.6197484942e-01 */ , {{0xBFEC6529,0xC58FCD22}} /* -8.8734901987e-01 */ , {{0x3FEF2E06,0x1AC1D834}} /* +9.7436814524e-01 */ , {{0xBFF1D4FE,0xF5D42E1A}} /* -1.1145009616e+00 */ , {{0x3FF4FAB7,0x67F441DC}} /* +1.3112100659e+00 */ , {{0xBFF93248,0xEA47B471}} /* -1.5747765686e+00 */ , {{0x3FFEBDCE,0x85276A57}} /* +1.9213395311e+00 */ , {{0xC002FCE1,0x0ABAD697}} /* -2.3734761084e+00 */ , {{0x4007BFE9,0x8C0B7AF7}} /* +2.9687071744e+00 */ , {{0xC00DE4D4,0xF57FD2EC}} /* -3.7367343120e+00 */ }, /* polynomial 2 */ { {{0xBFCF991C,0x6CB3B379}} /* -2.4686007793e-01 */ , {{0x3FF47AE1,0x47AE147B}} /* +1.2800000000e+00 */ , {{0xBFEA36E2,0xEB1C432D}} /* -8.1920000000e-01 */ , {{0x3FE65E9F,0x80F29213}} /* +6.9905066667e-01 */ , {{0xBFE5798E,0xE2308C3F}} /* -6.7108864000e-01 */ , {{0x3FE5FD7F,0xE1793910}} /* +6.8719476736e-01 */ , {{0xBFE774CC,0xAC3CC49E}} /* -7.3300775185e-01 */ , {{0x3FE9BC1F,0x779F31B6}} /* +8.0421422351e-01 */ , {{0xBFECD2B2,0x9C89806A}} /* -9.0071993421e-01 */ , {{0x3FF065A0,0xF663DD55}} /* +1.0248117089e+00 */ , {{0xBFF2E3A7,0x64D28253}} /* -1.1805795611e+00 */ , {{0x3FF613D4,0x162168A9}} /* +1.3798409333e+00 */ , {{0xBFF9EC69,0x1E7E75E1}} /* -1.6202174369e+00 */ }, /* polynomial 3 */ { {{0xBFC5BF40,0x6B543DB2}} /* -1.6989903680e-01 */ , {{0x3FF2F684,0xBDA12F68}} /* +1.1851851852e+00 */ , {{0xBFE67980,0xE0BF08C7}} /* -7.0233196159e-01 */ , {{0x3FE1C1FA,0x5F678885}} /* +5.5492895731e-01 */ , {{0xBFDF91BD,0x1B62B9D2}} /* -4.9327018427e-01 */ , {{0x3FDDEEAF,0x8242EF01}} /* +4.6769321175e-01 */ , {{0xBFDD9015,0xA36B029B}} /* -4.6191922149e-01 */ , {{0x3FDE0836,0x7F176341}} /* +4.6925127422e-01 */ , {{0xBFDF24F6,0x26663631}} /* -4.8663095236e-01 */ , {{0x3FE067BA,0x19D8F153}} /* +5.1266198204e-01 */ , {{0xBFE17FB2,0xECA216B7}} /* -5.4683824747e-01 */ , {{0x3FE2ECE6,0x2FABC4B9}} /* +5.9141835509e-01 */ , {{0xBFE492F3,0x21A51E4E}} /* -6.4293819972e-01 */ }, /* polynomial 4 */ { {{0xBFB9335E,0x5D594989}} /* -9.8440072813e-02 */ , {{0x3FF1A7B9,0x611A7B96}} /* +1.1034482759e+00 */ , {{0xBFE37B48,0x24872744}} /* -6.0879904875e-01 */ , {{0x3FDCA99C,0x29F8DE8E}} /* +4.4785217379e-01 */ , {{0xBFD7B881,0x3D37E454}} /* -3.7063628176e-01 */ , {{0x3FD4F08E,0x55D1F3A8}} /* +3.2718237286e-01 */ , {{0xBFD3413F,0x346E99D3}} /* -3.0085735436e-01 */ , {{0x3FD23625,0x15433E66}} /* +2.8455473973e-01 */ , {{0xBFD19561,0x9976A7ED}} /* -2.7474250781e-01 */ , {{0x3FD13F21,0x5935F4CB}} /* +2.6947816574e-01 */ , {{0xBFD120AC,0x8299A6A4}} /* -2.6761925463e-01 */ , {{0x3FD13CDB,0x325D4F09}} /* +2.6933936995e-01 */ , {{0xBFD1720B,0x858B6D5D}} /* -2.7258575479e-01 */ }, /* polynomial 5 */ { {{0x00000000,0x00000000}} /* +0.0000000000e-01 */ , {{0x3FF00000,0x00000000}} /* +1.0000000000e+00 */ , {{0xBFE00000,0x00000000}} /* -5.0000000000e-01 */ , {{0x3FD55555,0x55555582}} /* +3.3333333333e-01 */ , {{0xBFD00000,0x000000A9}} /* -2.5000000000e-01 */ , {{0x3FC99999,0x99958511}} /* +1.9999999999e-01 */ , {{0xBFC55555,0x554BF922}} /* -1.6666666665e-01 */ , {{0x3FC24924,0xA3AEF673}} /* +1.4285715096e-01 */ , {{0xBFC00000,0x1CE3E886}} /* -1.2500001345e-01 */ , {{0x3FBC7184,0x13CEB1B9}} /* +1.1110711559e-01 */ , {{0xBFB99941,0xE1BDC076}} /* -9.9994771588e-02 */ , {{0x3FB78146,0xBC144107}} /* +9.1816349905e-02 */ , {{0xBFB595CF,0x0AA58754}} /* -8.4317150211e-02 */ }, /* polynomial 6 */ { {{0x3FBE2707,0x6E2AF2E6}} /* +1.1778303566e-01 */ , {{0x3FEC71C7,0x1C71C71C}} /* +8.8888888889e-01 */ , {{0xBFD948B0,0xFCD6E9E0}} /* -3.9506172840e-01 */ , {{0x3FCDF756,0x80FEB690}} /* +2.3411065386e-01 */ , {{0xBFC3FA39,0xAB547A1A}} /* -1.5607376924e-01 */ , {{0x3FBC6990,0x98A29957}} /* +1.1098579146e-01 */ , {{0xBFB50BD3,0x6791851B}} /* -8.2211697374e-02 */ , {{0x3FB00902,0xA288F0A9}} /* +6.2637486154e-02 */ , {{0xBFA8F192,0x5F283335}} /* -4.8718046299e-02 */ , {{0x3FA3B540,0xE7508F6E}} /* +3.8492229687e-02 */ , {{0xBF9F8850,0xBFE2263F}} /* -3.0793439590e-02 */ , {{0x3F99B300,0x12EF8724}} /* +2.5096894413e-02 */ , {{0xBF94F85D,0x99AF0E14}} /* -2.0478689675e-02 */ }, /* polynomial 7 */ { {{0x3FCC8FF7,0xC79A9A22}} /* +2.2314355131e-01 */ , {{0x3FE99999,0x9999999A}} /* +8.0000000000e-01 */ , {{0xBFD47AE1,0x47AE147B}} /* -3.2000000000e-01 */ , {{0x3FC5D867,0xC3ECE2B2}} /* +1.7066666667e-01 */ , {{0xBFBA36E2,0xEB1C436A}} /* -1.0240000000e-01 */ , {{0x3FB0C6F7,0xA0B52722}} /* +6.5535999999e-02 */ , {{0xBFA65E9F,0x80EFFFCD}} /* -4.3690666665e-02 */ , {{0x3F9EADA7,0x96E552E6}} /* +2.9959314904e-02 */ , {{0xBF95798E,0xEF8F2073}} /* -2.0971520778e-02 */ , {{0x3F8E8A9C,0x71A5F85C}} /* +1.4912817210e-02 */ , {{0xBF85FD5B,0xDA92B978}} /* -1.0737149818e-02 */ , {{0x3F801A73,0xDB58E5DE}} /* +7.8629542651e-03 */ , {{0xBF77A54B,0x588CDC6F}} /* -5.7728713226e-03 */ }, /* polynomial 8 */ { {{0x3FD3D638,0x05AA02DB}} /* +3.0994988015e-01 */ , {{0x3FE778B2,0xD84B7B4A}} /* +7.3348371739e-01 */ , {{0xBFD13748,0x582A4354}} /* -2.6899918184e-01 */ , {{0x3FC0D63A,0x08B6E75D}} /* +1.3153767992e-01 */ , {{0xBFB28638,0xBDFF0D07}} /* -7.2360559831e-02 */ , {{0x3FA5BD59,0x0841B395}} /* +4.2460233934e-02 */ , {{0xBF9A937C,0x93FDD519}} /* -2.5953241856e-02 */ , {{0x3F90B55A,0xB37AD191}} /* +1.6316811757e-02 */ , {{0xBF857265,0xA500F702}} /* -1.0472101305e-02 */ , {{0x3F7BF747,0x97F62E2F}} /* +6.8276211381e-03 */ , {{0xBF727615,0x37BCA347}} /* -4.5071438615e-03 */ , {{0x3F68B6F6,0x340868F6}} /* +3.0169304521e-03 */ , {{0xBF60A0BF,0x5B164CA3}} /* -2.0297753733e-03 */ } }; static const db_number Poly_l[8][2] = { /* polynomial 1 */ { {{0xBC531A78,0xC9731542}} /* -4.1423907624e-18 */ , {{0x3C6DA901,0xD7E733C1}} /* +1.2863054535e-17 */ , }, /* polynomial 2 */ { {{0xBC6F6650,0x792F85DD}} /* -1.3617434188e-17 */ , {{0xBC7EB9DF,0xF7DDA2CA}} /* -2.6650620715e-17 */ , }, /* polynomial 3 */ { {{0x3C21F5B3,0xE8EE7A2B}} /* +4.8680071630e-19 */ , {{0x3C92F660,0x2CEA2030}} /* +6.5789058301e-17 */ , }, /* polynomial 4 */ { {{0x3C5478A8,0x527726CF}} /* +4.4390095748e-18 */ , {{0x3C71A77F,0xA4B8A6F9}} /* +1.5312656901e-17 */ , }, /* polynomial 5 */ { {{0x00000000,0x00000000}} /* +0.0000000000e-01 */ , {{0xBC03E91A,0xAAF9039B}} /* -1.3491922402e-19 */ , }, /* polynomial 6 */ { {{0xBC3615B0,0xDBC40302}} /* -1.1972156066e-18 */ , {{0x3C8C55D6,0x047FA77E}} /* +4.9153904729e-17 */ , }, /* polynomial 7 */ { {{0xBC64F68B,0x97A41961}} /* -9.0912813346e-18 */ , {{0xBC89A0B0,0x9DE4BE41}} /* -4.4456964079e-17 */ , }, /* polynomial 8 */ { {{0xBC3B294D,0xE20C7AD0}} /* -1.4724194439e-18 */ , {{0xBC818759,0xCA7AB225}} /* -3.0407471421e-17 */ , } }; #else static const db_number ln2hi = {{0xFEFA3800,0x3FE62E42}} /* +6.9314718056e-01 */; static const db_number ln2lo = {{0x93C76730,0x3D2EF357}} /* +5.4979230187e-14 */; static const db_number two52 = {{0x00000000,0x43300000}} /* +4.5035996274e+15 */; static const db_number middle[8] = { {{0x333F9DE3,0x3FE7504F}} /* +7.2855339059e-01 */ , {{0x00000000,0x3FE90000}} /* +7.8125000000e-01 */ , {{0x00000000,0x3FEB0000}} /* +8.4375000000e-01 */ , {{0x00000000,0x3FED0000}} /* +9.0625000000e-01 */ , {{0x00000000,0x3FF00000}} /* +1.0000000000e+00 */ , {{0x00000000,0x3FF20000}} /* +1.1250000000e+00 */ , {{0x00000000,0x3FF40000}} /* +1.2500000000e+00 */ , {{0x333F9DE9,0x3FF5D04F}} /* +1.3633567812e+00 */ }; static const db_number Poly_h[8][13] = { /* polynomial 1 */ { {{0x73F60B09,0xBFD444B8}} /* -3.1669436764e-01 */ , {{0x980C433A,0x3FF5F619}} /* +1.3725830020e+00 */ , {{0x824C9A57,0xBFEE24CC}} /* -9.4199204873e-01 */ , {{0x47881604,0x3FEB954C}} /* +8.6197484942e-01 */ , {{0xC58FCD22,0xBFEC6529}} /* -8.8734901987e-01 */ , {{0x1AC1D834,0x3FEF2E06}} /* +9.7436814524e-01 */ , {{0xF5D42E1A,0xBFF1D4FE}} /* -1.1145009616e+00 */ , {{0x67F441DC,0x3FF4FAB7}} /* +1.3112100659e+00 */ , {{0xEA47B471,0xBFF93248}} /* -1.5747765686e+00 */ , {{0x85276A57,0x3FFEBDCE}} /* +1.9213395311e+00 */ , {{0x0ABAD697,0xC002FCE1}} /* -2.3734761084e+00 */ , {{0x8C0B7AF7,0x4007BFE9}} /* +2.9687071744e+00 */ , {{0xF57FD2EC,0xC00DE4D4}} /* -3.7367343120e+00 */ }, /* polynomial 2 */ { {{0x6CB3B379,0xBFCF991C}} /* -2.4686007793e-01 */ , {{0x47AE147B,0x3FF47AE1}} /* +1.2800000000e+00 */ , {{0xEB1C432D,0xBFEA36E2}} /* -8.1920000000e-01 */ , {{0x80F29213,0x3FE65E9F}} /* +6.9905066667e-01 */ , {{0xE2308C3F,0xBFE5798E}} /* -6.7108864000e-01 */ , {{0xE1793910,0x3FE5FD7F}} /* +6.8719476736e-01 */ , {{0xAC3CC49E,0xBFE774CC}} /* -7.3300775185e-01 */ , {{0x779F31B6,0x3FE9BC1F}} /* +8.0421422351e-01 */ , {{0x9C89806A,0xBFECD2B2}} /* -9.0071993421e-01 */ , {{0xF663DD55,0x3FF065A0}} /* +1.0248117089e+00 */ , {{0x64D28253,0xBFF2E3A7}} /* -1.1805795611e+00 */ , {{0x162168A9,0x3FF613D4}} /* +1.3798409333e+00 */ , {{0x1E7E75E1,0xBFF9EC69}} /* -1.6202174369e+00 */ }, /* polynomial 3 */ { {{0x6B543DB2,0xBFC5BF40}} /* -1.6989903680e-01 */ , {{0xBDA12F68,0x3FF2F684}} /* +1.1851851852e+00 */ , {{0xE0BF08C7,0xBFE67980}} /* -7.0233196159e-01 */ , {{0x5F678885,0x3FE1C1FA}} /* +5.5492895731e-01 */ , {{0x1B62B9D2,0xBFDF91BD}} /* -4.9327018427e-01 */ , {{0x8242EF01,0x3FDDEEAF}} /* +4.6769321175e-01 */ , {{0xA36B029B,0xBFDD9015}} /* -4.6191922149e-01 */ , {{0x7F176341,0x3FDE0836}} /* +4.6925127422e-01 */ , {{0x26663631,0xBFDF24F6}} /* -4.8663095236e-01 */ , {{0x19D8F153,0x3FE067BA}} /* +5.1266198204e-01 */ , {{0xECA216B7,0xBFE17FB2}} /* -5.4683824747e-01 */ , {{0x2FABC4B9,0x3FE2ECE6}} /* +5.9141835509e-01 */ , {{0x21A51E4E,0xBFE492F3}} /* -6.4293819972e-01 */ }, /* polynomial 4 */ { {{0x5D594989,0xBFB9335E}} /* -9.8440072813e-02 */ , {{0x611A7B96,0x3FF1A7B9}} /* +1.1034482759e+00 */ , {{0x24872744,0xBFE37B48}} /* -6.0879904875e-01 */ , {{0x29F8DE8E,0x3FDCA99C}} /* +4.4785217379e-01 */ , {{0x3D37E454,0xBFD7B881}} /* -3.7063628176e-01 */ , {{0x55D1F3A8,0x3FD4F08E}} /* +3.2718237286e-01 */ , {{0x346E99D3,0xBFD3413F}} /* -3.0085735436e-01 */ , {{0x15433E66,0x3FD23625}} /* +2.8455473973e-01 */ , {{0x9976A7ED,0xBFD19561}} /* -2.7474250781e-01 */ , {{0x5935F4CB,0x3FD13F21}} /* +2.6947816574e-01 */ , {{0x8299A6A4,0xBFD120AC}} /* -2.6761925463e-01 */ , {{0x325D4F09,0x3FD13CDB}} /* +2.6933936995e-01 */ , {{0x858B6D5D,0xBFD1720B}} /* -2.7258575479e-01 */ }, /* polynomial 5 */ { {{0x00000000,0x00000000}} /* +0.0000000000e-01 */ , {{0x00000000,0x3FF00000}} /* +1.0000000000e+00 */ , {{0x00000000,0xBFE00000}} /* -5.0000000000e-01 */ , {{0x55555582,0x3FD55555}} /* +3.3333333333e-01 */ , {{0x000000A9,0xBFD00000}} /* -2.5000000000e-01 */ , {{0x99958511,0x3FC99999}} /* +1.9999999999e-01 */ , {{0x554BF922,0xBFC55555}} /* -1.6666666665e-01 */ , {{0xA3AEF673,0x3FC24924}} /* +1.4285715096e-01 */ , {{0x1CE3E886,0xBFC00000}} /* -1.2500001345e-01 */ , {{0x13CEB1B9,0x3FBC7184}} /* +1.1110711559e-01 */ , {{0xE1BDC076,0xBFB99941}} /* -9.9994771588e-02 */ , {{0xBC144107,0x3FB78146}} /* +9.1816349905e-02 */ , {{0x0AA58754,0xBFB595CF}} /* -8.4317150211e-02 */ }, /* polynomial 6 */ { {{0x6E2AF2E6,0x3FBE2707}} /* +1.1778303566e-01 */ , {{0x1C71C71C,0x3FEC71C7}} /* +8.8888888889e-01 */ , {{0xFCD6E9E0,0xBFD948B0}} /* -3.9506172840e-01 */ , {{0x80FEB690,0x3FCDF756}} /* +2.3411065386e-01 */ , {{0xAB547A1A,0xBFC3FA39}} /* -1.5607376924e-01 */ , {{0x98A29957,0x3FBC6990}} /* +1.1098579146e-01 */ , {{0x6791851B,0xBFB50BD3}} /* -8.2211697374e-02 */ , {{0xA288F0A9,0x3FB00902}} /* +6.2637486154e-02 */ , {{0x5F283335,0xBFA8F192}} /* -4.8718046299e-02 */ , {{0xE7508F6E,0x3FA3B540}} /* +3.8492229687e-02 */ , {{0xBFE2263F,0xBF9F8850}} /* -3.0793439590e-02 */ , {{0x12EF8724,0x3F99B300}} /* +2.5096894413e-02 */ , {{0x99AF0E14,0xBF94F85D}} /* -2.0478689675e-02 */ }, /* polynomial 7 */ { {{0xC79A9A22,0x3FCC8FF7}} /* +2.2314355131e-01 */ , {{0x9999999A,0x3FE99999}} /* +8.0000000000e-01 */ , {{0x47AE147B,0xBFD47AE1}} /* -3.2000000000e-01 */ , {{0xC3ECE2B2,0x3FC5D867}} /* +1.7066666667e-01 */ , {{0xEB1C436A,0xBFBA36E2}} /* -1.0240000000e-01 */ , {{0xA0B52722,0x3FB0C6F7}} /* +6.5535999999e-02 */ , {{0x80EFFFCD,0xBFA65E9F}} /* -4.3690666665e-02 */ , {{0x96E552E6,0x3F9EADA7}} /* +2.9959314904e-02 */ , {{0xEF8F2073,0xBF95798E}} /* -2.0971520778e-02 */ , {{0x71A5F85C,0x3F8E8A9C}} /* +1.4912817210e-02 */ , {{0xDA92B978,0xBF85FD5B}} /* -1.0737149818e-02 */ , {{0xDB58E5DE,0x3F801A73}} /* +7.8629542651e-03 */ , {{0x588CDC6F,0xBF77A54B}} /* -5.7728713226e-03 */ }, /* polynomial 8 */ { {{0x05AA02DB,0x3FD3D638}} /* +3.0994988015e-01 */ , {{0xD84B7B4A,0x3FE778B2}} /* +7.3348371739e-01 */ , {{0x582A4354,0xBFD13748}} /* -2.6899918184e-01 */ , {{0x08B6E75D,0x3FC0D63A}} /* +1.3153767992e-01 */ , {{0xBDFF0D07,0xBFB28638}} /* -7.2360559831e-02 */ , {{0x0841B395,0x3FA5BD59}} /* +4.2460233934e-02 */ , {{0x93FDD519,0xBF9A937C}} /* -2.5953241856e-02 */ , {{0xB37AD191,0x3F90B55A}} /* +1.6316811757e-02 */ , {{0xA500F702,0xBF857265}} /* -1.0472101305e-02 */ , {{0x97F62E2F,0x3F7BF747}} /* +6.8276211381e-03 */ , {{0x37BCA347,0xBF727615}} /* -4.5071438615e-03 */ , {{0x340868F6,0x3F68B6F6}} /* +3.0169304521e-03 */ , {{0x5B164CA3,0xBF60A0BF}} /* -2.0297753733e-03 */ } }; static const db_number Poly_l[8][2] = { /* polynomial 1 */ { {{0xC9731542,0xBC531A78}} /* -4.1423907624e-18 */ , {{0xD7E733C1,0x3C6DA901}} /* +1.2863054535e-17 */ , }, /* polynomial 2 */ { {{0x792F85DD,0xBC6F6650}} /* -1.3617434188e-17 */ , {{0xF7DDA2CA,0xBC7EB9DF}} /* -2.6650620715e-17 */ , }, /* polynomial 3 */ { {{0xE8EE7A2B,0x3C21F5B3}} /* +4.8680071630e-19 */ , {{0x2CEA2030,0x3C92F660}} /* +6.5789058301e-17 */ , }, /* polynomial 4 */ { {{0x527726CF,0x3C5478A8}} /* +4.4390095748e-18 */ , {{0xA4B8A6F9,0x3C71A77F}} /* +1.5312656901e-17 */ , }, /* polynomial 5 */ { {{0x00000000,0x00000000}} /* +0.0000000000e-01 */ , {{0xAAF9039B,0xBC03E91A}} /* -1.3491922402e-19 */ , }, /* polynomial 6 */ { {{0xDBC40302,0xBC3615B0}} /* -1.1972156066e-18 */ , {{0x047FA77E,0x3C8C55D6}} /* +4.9153904729e-17 */ , }, /* polynomial 7 */ { {{0x97A41961,0xBC64F68B}} /* -9.0912813346e-18 */ , {{0x9DE4BE41,0xBC89A0B0}} /* -4.4456964079e-17 */ , }, /* polynomial 8 */ { {{0xE20C7AD0,0xBC3B294D}} /* -1.4724194439e-18 */ , {{0xCA7AB225,0xBC818759}} /* -3.0407471421e-17 */ , } }; #endif interval-2.1.0/src/crlibm/maple/acos-td.mpl0000644000000000000000000004217013031036767016677 0ustar 00000000000000####################################################################### # This file is part of the crlibm library, and is distributed under # the LGPL. # To use: # restart; read "exp-td.mpl"; Digits := 145: interface(quiet=true): read "common-procedures.mpl": read "triple-double.mpl": read "gal.mpl": mkdir("TEMPACOS"): with(orthopoly,T): truncPoly := proc(p,k) local i, q: q := 0: convert(q,polynom): for i from 0 to min(degree(p,x),k) do q := q + coeff(p,x,i) * x^i: od: return (q): end: intervals := 10: for i from 1 to intervals do epsAccurate[i] := 0.5: epsQuick[i] := 0.5: polyAccurate[i] := 1: polyQuick[i] := 1: od: epsAccurateSpecial := 0.5: epsQuickExtra := 0.5: lowestIntervalMax := 0.185: highestIntervalMin := 0.78: polyAccurateTDCoeffsLowest := 13: polyAccurateDDCoeffsLowest := 12: polyAccurateDCoeffsLowest := 16: polyAccurateDegreeLowest := polyAccurateTDCoeffsLowest + polyAccurateDDCoeffsLowest + polyAccurateDCoeffsLowest: polyQuickDDCoeffsLowest := 12: polyQuickDCoeffsLowest := 10: polyQuickDegreeLowest := polyQuickDDCoeffsLowest + polyQuickDCoeffsLowest: polyAccurateTDCoeffsMiddle := 7: polyAccurateDDCoeffsMiddle := 9: polyAccurateDCoeffsMiddle := 19: polyAccurateDegreeMiddle := polyAccurateTDCoeffsMiddle + polyAccurateDDCoeffsMiddle + polyAccurateDCoeffsMiddle: polyQuickDDCoeffsMiddle := 7: polyQuickDCoeffsMiddle := 7: polyQuickDegreeMiddle := polyQuickDDCoeffsMiddle + polyQuickDCoeffsMiddle: polyAccurateTDCoeffsHighest := 9: polyAccurateDDCoeffsHighest := 9: polyAccurateDCoeffsHighest := 11: polyAccurateDegreeHighest := polyAccurateTDCoeffsHighest + polyAccurateDDCoeffsHighest + polyAccurateDCoeffsHighest: polyQuickDDCoeffsHighest := 9: polyQuickDCoeffsHighest := 9: polyQuickDegreeHighest := polyQuickDDCoeffsHighest + polyQuickDCoeffsHighest: extrabound := hexa2ieee(["3F500000","00000000"]): polyQuickDegreeExtra := 5: bound[0] := 0: b := nearest(lowestIntervalMax): he := ieeehexa(b): bound[1] := hexa2ieee([he[1],"00000000"]): b := nearest(highestIntervalMin): he := ieeehexa(b): bound[intervals - 1] := hexa2ieee([he[1],"00000000"]): bound[intervals] := 1: linearWidth := (highestIntervalMin - lowestIntervalMax) / (intervals - 2): scaleSum := 0: scale[2] := 1.5: scale[3] := 1.35: scale[4] := 1.18: scale[5] := 1.00: scale[6] := 0.915: scale[7] := 0.74: scale[8] := 0.595: scale[9] := 0.50: for i from 2 to (intervals-1) do scaleSum := scaleSum + scale[i]: od: for i from 2 to (intervals-1) do scale[i] := scale[i] / scaleSum; od: current := lowestIntervalMax: for i from 2 to (intervals-2) do b := nearest(current + (highestIntervalMin - lowestIntervalMax) * scale[i]): current := b: he := ieeehexa(b): bound[i] := hexa2ieee([he[1],"00000000"]): od: printf("Using %d intervals with bounds:\n",intervals): for i from 0 to intervals do printf("bound[%d] = %1.30e\n",i,bound[i]): od: printf("Using an extra bound for truncating the quick poly to deg. %d in interval #0 for small args up to %f (2^(%f))\n", polyQuickDegreeExtra,extrabound,log[2](abs(extrabound))); printf("Computing Gal's accurate table values for interval midpoints\n"): for i from 2 to (intervals-1) do m := nearest((bound[i] + bound[i-1]) / 2): mhe := ieeehexa(m): printf("Interval %d: accurate table research start value %f (%s%s)\n",i,m,mhe[1],mhe[2]): midpointFloat[i] := galDoubleToDoubleDouble(nearest(m),arcsin,2^(-121),2^(15)): od: printf("Using the following floating point midpoints for intervals 2-%d:\n",intervals-2): for i from 2 to (intervals-1) do mhe := ieeehexa(midpointFloat[i]): printf("midpointFloat[%d] = %f (%s%s)\n",i,midpointFloat[i],mhe[1],mhe[2]): od: printf("The reduced argument z is therefore bounded by:\n"): printf("Interval 1: |z| < 2^(%f)\n", log[2](abs(bound[1]))): for i from 2 to (intervals-1) do printf("Interval %d: |z| < 2^(%f)\n",i, log[2](max(abs(midpointFloat[i] - bound[i-1]),abs(midpointFloat[i] - bound[i])))): od: printf("Interval %d: |z| < 2^(%f)\n",intervals, log[2](abs(1 - bound[intervals-1]))): printf("Using a %d degree polynomial for lowest interval (1) (accurate phase)\n", polyAccurateDegreeLowest): printf("with %d triple-double, %d double-double and %d double coefficients\n", polyAccurateTDCoeffsLowest, polyAccurateDDCoeffsLowest, polyAccurateDCoeffsLowest): printf("Using a %d degree polynomial for lowest interval (1) (quick phase)\n", polyQuickDegreeLowest): printf("with %d double-double and %d double coefficients\n", polyQuickDDCoeffsLowest, polyQuickDCoeffsLowest): printf("Using a %d degree polynomial for middle intervals (2-%d) (accurate phase)\n", polyAccurateDegreeMiddle,intervals-2): printf("with %d triple-double, %d double-double and %d double coefficients\n", polyAccurateTDCoeffsMiddle, polyAccurateDDCoeffsMiddle, polyAccurateDCoeffsMiddle): printf("Using a %d degree polynomial for middle intervals (2-%d) (quick phase)\n", polyQuickDegreeMiddle,intervals-2): printf("with %d double-double and %d double coefficients\n", polyQuickDDCoeffsMiddle, polyQuickDCoeffsMiddle): printf("Using a %d degree polynomial for highest interval (%d) (accurate phase)\n", polyAccurateDegreeHighest,intervals): printf("with %d triple-double, %d double-double and %d double coefficients\n", polyAccurateTDCoeffsHighest, polyAccurateDDCoeffsHighest, polyAccurateDCoeffsHighest): printf("Using a %d degree polynomial for highest interval (%d) (quick phase)\n", polyQuickDegreeHighest,intervals): printf("with %d double-double and %d double coefficients\n", polyQuickDDCoeffsHighest, polyQuickDCoeffsHighest): if true then printf("Computing polynomials for interval 1 ([%f;%f])\n",bound[0],bound[1]): f := unapply(convert(series((arcsin(sqrt(x))/sqrt(x) - 1)/x,x=0,300),polynom),x): p := unapply(eval(numapprox[chebyshev](f(x),x=(bound[0])^2..(bound[1])^2,2^(-127))),x): polyAccuExact[1] := truncPoly(subs(X=x^2,p(X))*x^3+x,polyAccurateDegreeLowest): polyAccurate[1] := poly_exact32(polyAccuExact[1],polyAccurateTDCoeffsLowest,polyAccurateDDCoeffsLowest): epsAccurate[1] := numapprox[infnorm]((polyAccurate[1]/arcsin(x))-1, x=bound[0]..bound[1]): epsAccurateSpecial := numapprox[infnorm]((polyAccurate[1]/arcsin(x))-1, x=bound[0]..evalf(sin(2^(-18)))): epsAccurateUnknown := numapprox[infnorm]((polyAccurate[1]/arcsin(x))-1, x=bound[0]..evalf(cos(12867/8192))): polyQuickExact[1] := truncPoly(polyAccuExact[1],polyQuickDegreeLowest): polyQuick[1] := poly_exact2(polyQuickExact[1],polyQuickDDCoeffsLowest): epsQuick[1] := numapprox[infnorm]((polyQuick[1]/arcsin(x))-1, x=bound[0]..bound[1]): polyQuickExtraExact := truncPoly(polyAccuExact[1],polyQuickDegreeExtra): polyQuickExtra := poly_exact2(polyQuickExtraExact,polyQuickDegreeExtra): epsQuickExtra := numapprox[infnorm]((polyQuickExtra/arcsin(x))-1, x=bound[0]..extrabound): end if: for i from 2 to (intervals-1) do printf("Computing polynomials for interval %d ([%f;%f])\n",i,bound[i-1],bound[i]): printf("Reduced argument z will be in interval [%1.8e;%1.8e] ([-2^%f,2^%f]),\n", bound[i-1]-midpointFloat[i],bound[i]-midpointFloat[i], log[2](abs(bound[i-1]-midpointFloat[i])),log[2](abs(bound[i]-midpointFloat[i]))): f := unapply(arcsin(x+midpointFloat[i]),x): fhelp := unapply(convert(series((f(x)-arcsin(midpointFloat[i]))/x,x=0,polyAccurateDegreeMiddle*3),polynom),x): polyAccuExact[i] := numapprox[minimax](fhelp(x), x=bound[i-1]-midpointFloat[i]..bound[i]-midpointFloat[i], [polyAccurateDegreeMiddle,0],1,'err')*x + nearestDD(evalf(arcsin(midpointFloat[i]))): polyAccurate[i] := poly_exact32(polyAccuExact[i],polyAccurateTDCoeffsMiddle,polyAccurateDDCoeffsMiddle): epsAccurate[i] := numapprox[infnorm]((polyAccurate[i]/f(x))-1, x=bound[i-1]-midpointFloat[i]..bound[i]-midpointFloat[i]): polyQuickExact[i] := truncPoly(polyAccuExact[i],polyQuickDegreeMiddle): polyQuick[i] := poly_exact2(polyQuickExact[i],polyQuickDDCoeffsMiddle): epsQuick[i] := numapprox[infnorm]((polyQuick[i]/f(x))-1, x=bound[i-1]-midpointFloat[i]..bound[i]-midpointFloat[i]): od: if true then printf("Computing polynomials for interval %d ([%f;%f])\n",intervals,bound[intervals-1],bound[intervals]): g := unapply(((arcsin(1 - x) - Pi/2)/sqrt(2*x)),x): f := unapply(convert(series(((g(x)+1)/x),x=0,polyAccurateDegreeHighest*4),polynom),x): polyAccuExact[intervals] := numapprox[minimax](f(x),x=(1-bound[intervals]+2^(-53))..(1-bound[intervals-1]), [polyAccurateDegreeHighest-1,0],1,'err')*x-1: polyAccurate[intervals] := poly_exact32(polyAccuExact[intervals],polyAccurateTDCoeffsHighest,polyAccurateDDCoeffsHighest): epsAccurate[intervals] := numapprox[infnorm](((unapply(polyAccurate[intervals],x)(x)/g(x))-1), x=(1-bound[intervals]+2^(-53))..(1-bound[intervals-1])): polyQuickExact[intervals] := truncPoly(polyAccuExact[intervals],polyQuickDegreeHighest): polyQuick[intervals] := poly_exact2(polyQuickExact[intervals],polyQuickDDCoeffsHighest): epsQuick[intervals] := numapprox[infnorm](((unapply(polyQuick[intervals],x)(x)/g(x))-1), x=(1-bound[intervals]+2^(-53))..(1-bound[intervals-1])): printf("Checking if the polynomial for interval %d is exactly -1 in z = %f...\n",intervals,1-bound[intervals]); if (unapply(polyAccurate[intervals],x)(1-bound[intervals]) = -1) then printf(" Check passed!\n"): else printf(" Check failed!\n"): end if: end if: for i from 1 to intervals do printf("Relative error for accurate phase polynomial in interval %d ([%f;%f]) is 2^(%f)\n", i,bound[i-1],bound[i],log[2](abs(epsAccurate[i]))): printf("Relative error for quick phase polynomial in interval %d ([%f;%f]) is 2^(%f)\n", i,bound[i-1],bound[i],log[2](abs(epsQuick[i]))): od: printf("Relative error for accurate phase polynomial #1 in special interval [0;sin(2^(-18))]) is 2^(%f)\n", log[2](abs(epsAccurateSpecial))): printf("Relative error for accurate phase polynomial #1 in \"unknown\" interval [0;cos(12867/8192)]) is 2^(%f)\n", log[2](abs(epsAccurateUnknown))): printf("Relative error for quick phase extra case truncated polynomial #1 in special interval [0;%f]) is 2^(%f)\n", extrabound,log[2](abs(epsQuickExtra))): (PiHalfH, PiHalfM, PiHalfL) := hi_mi_lo(evalf(Pi/2)): (PiH, PiM, PiL) := hi_mi_lo(evalf(Pi)): epsPiDD := evalf(((PiHalfH + PiHalfM) - Pi/2)/(Pi/2)): epsPiTD := evalf(((PiHalfH + PiHalfM + PiHalfL) - Pi/2) / (Pi/2)): printf("Relative error for storing Pi/2 as a double-double is 2^(%f)\n",evalf(log[2](abs(epsPiDD)))): printf("Relative error for storing Pi/2 as a triple-double is 2^(%f)\n",evalf(log[2](abs(epsPiTD)))): # Ce qui suit est pifometrique et doit etre prouve en Gappa ensuite arithmeticalErrorQuick[1] := 2^(-61): arithmeticalErrorQuick[2] := 2^(-61): arithmeticalErrorQuick[3] := 2^(-61): arithmeticalErrorQuick[4] := 2^(-61): arithmeticalErrorQuick[5] := 2^(-61): arithmeticalErrorQuick[6] := 2^(-61): arithmeticalErrorQuick[7] := 2^(-61): arithmeticalErrorQuick[8] := 2^(-61): arithmeticalErrorQuick[9] := 2^(-61): arithmeticalErrorQuick[10] := 2^(-68): arithmeticalErrorQuickExtra := 2^(-80): for i from 1 to intervals do estimatedOverallEpsQuick[i] := abs(epsQuick[i]) + abs(arithmeticalErrorQuick[i]) + abs(epsQuick[i]) * abs(arithmeticalErrorQuick[i]): printf("Relative quick phase overall error bound to show in Gappa for interval %d ([%f;%f]) is 2^(%f)\n", i,bound[i-1],bound[i],log[2](abs(estimatedOverallEpsQuick[i]))): od: estimatedOverallEpsQuickExtra := abs(epsQuickExtra) + abs(arithmeticalErrorQuickExtra) + abs(epsQuickExtra) * abs(arithmeticalErrorQuickExtra): printf("Relative quick phase overall error bound to show for extra truncted poly in interval [0;%f]) is 2^(%f)\n", extrabound,log[2](abs(estimatedOverallEpsQuickExtra))): printf("Write tables...\n"): filename:="TEMPACOS/acos-td.h": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "#include \"crlibm.h\"\n#include \"crlibm_private.h\"\n"): fprintf(fd, "\n/* File generated by maple/acos-td.mpl */\n\n"): printf("Write table with bounds\n"): fprintf(fd, "/* High order words of interval bounds (low order word is 0) */\n"): for i from 1 to (intervals-1) do heb := ieeehexa(bound[i]): fprintf(fd, "\#define BOUND%d 0x%s\n",i,heb[1]): od: heb := ieeehexa(extrabound): fprintf(fd, "\#define EXTRABOUND 0x%s\n",heb[1]): printf("Write additional constants\n"): fprintf(fd, "\n\n/* Pi/2 as a triple-double*/\n"): fprintf(fd, "\#define PIHALFH %1.50e\n",PiHalfH): fprintf(fd, "\#define PIHALFM %1.50e\n",PiHalfM): fprintf(fd, "\#define PIHALFL %1.50e\n",PiHalfL): fprintf(fd, "\n\n/* Pi as a triple-double*/\n"): fprintf(fd, "\#define PIH %1.50e\n",PiH): fprintf(fd, "\#define PIM %1.50e\n",PiM): fprintf(fd, "\#define PIL %1.50e\n",PiL): fprintf(fd, "\#define PIHALFDOUBLERN %1.50e\n",nearest(evalf(Pi/2))): fprintf(fd, "\#define PIHALFDOUBLERU %1.50e\n",roundUp(evalf(Pi/2))): fprintf(fd, "\#define PIHALFDOUBLERD %1.50e\n",roundDown(evalf(Pi/2))): printf("Write table with midpoints and polynomial coefficients\n"): k := 0: for i from 0 to polyAccurateDegreeLowest do (hi,mi,lo) := hi_mi_lo(coeff(polyAccurate[1],x,i)): if ((abs(hi) = 1.0) and (mi = 0) and (lo = 0)) then printf( "Coefficient %d of interval 1 polynomial is exactly %f and will not be stored in the table\n",i,hi): else g := 0; if (hi <> 0) then if (i <= polyQuickDegreeLowest) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyLowC%dh, quickPolyLowC%dh */",hi,k,i,i): else tbl[k] := sprintf("%1.50e, \t/* %d, accPolyLowC%dh */",hi,k,i): end if: k := k + 1: end if: if (mi <> 0) then if (i <= polyQuickDDCoeffsLowest) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyLowC%dm, quickPolyLowC%dl */",mi,k,i,i): else tbl[k] := sprintf("%1.50e, \t/* %d, accPolyLowC%dm */",mi,k,i): end if: k := k + 1: end if: if (lo <> 0) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyLowC%dl */",lo,k,i): k := k + 1: end if: end if: od: tbl[k] := sprintf("%1.50e, \t/* %d, RN rounding constant quick poly low*/", compute_rn_constant(estimatedOverallEpsQuick[1]),k): k := k + 1: tbl[k] := sprintf("%1.50e, \t/* %d, RD rounding constant quick poly low*/", estimatedOverallEpsQuick[1],k): k := k + 1: printf("Table for interval 1 written\n"): for l from 2 to (intervals-1) do tbl[k] := sprintf("%1.50e, \t/* %d, midpoint in interval %d*/",midpointFloat[l],k,l): tblidx[l] := k; k := k + 1; for i from 0 to polyAccurateDegreeMiddle do (hi,mi,lo) := hi_mi_lo(coeff(polyAccurate[l],x,i)): if ((abs(hi) = 1.0) and (mi = 0) and (lo = 0)) then printf( "Coefficient %d of interval %d polynomial is exactly %f and will not be stored in the table\n",i,l,hi): else g := 0; if (hi <> 0) then if (i <= polyQuickDegreeMiddle) then tbl[k] := sprintf( "%1.50e, \t/* %d, accPolyMid%dC%dh, quickPolyMid%dC%dh */",hi,k,l,i,l,i): else tbl[k] := sprintf("%1.50e, \t/* %d, accPolyMid%dC%dh */",hi,k,l,i): end if: k := k + 1: end if: if (mi <> 0) then if (i <= polyQuickDDCoeffsMiddle) then tbl[k] := sprintf( "%1.50e, \t/* %d, accPolyMid%dC%dm, quickPolyMid%dC%dl */",mi,k,l,i,l,i): else tbl[k] := sprintf("%1.50e, \t/* %d, accPolyMid%dC%dm */",mi,k,l,i): end if: k := k + 1: end if: if (lo <> 0) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyMid%dC%dl */",lo,k,l,i): k := k + 1: end if: end if: od: tbl[k] := sprintf("%1.50e, \t/* %d, RN rounding constant quick poly middle %d*/", compute_rn_constant(estimatedOverallEpsQuick[l]),k,l): k := k + 1: tbl[k] := sprintf("%1.50e, \t/* %d, RD rounding constant quick poly middle %d*/", estimatedOverallEpsQuick[l],k,l): k := k + 1: printf("Table for interval %d written\n",l): od: tblidx[intervals] := k: for i from 0 to polyAccurateDegreeHighest do (hi,mi,lo) := hi_mi_lo(coeff(polyAccurate[intervals],x,i)): if ((abs(hi) = 1.0) and (mi = 0) and (lo = 0)) then printf( "Coefficient %d of interval %d polynomial is exactly %f and will not be stored in the table\n",i,intervals,hi): else g := 0; if (hi <> 0) then if (i <= polyQuickDegreeHighest) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyHighC%dh, quickPolyHighC%dh */",hi,k,i,i): else tbl[k] := sprintf("%1.50e, \t/* %d, accPolyHighC%dh */",hi,k,i): end if: k := k + 1: end if: if (mi <> 0) then if (i <= polyQuickDDCoeffsHighest) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyHighC%dm, quickPolyHighC%dl */",mi,k,i,i): else tbl[k] := sprintf("%1.50e, \t/* %d, accPolyHighC%dm */",mi,k,i): end if: k := k + 1: end if: if (lo <> 0) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyHighC%dl */",lo,k,i): k := k + 1: end if: end if: od: tbl[k] := sprintf("%1.50e, \t/* %d, RN rounding constant quick poly high*/", compute_rn_constant(estimatedOverallEpsQuick[intervals]),k): k := k + 1: tbl[k] := sprintf("%1.50e, \t/* %d, RD rounding constant quick poly high*/", estimatedOverallEpsQuick[intervals],k): k := k + 1: printf("Table for interval %d written\n",intervals): tbllen := k: printf("The whole table has %d entries, so uses %d bytes of memory\n",tbllen,tbllen*8): fprintf(fd,"\n\n/* Indices to the following table */\n"): for i from 2 to intervals do fprintf(fd,"\#define TBLIDX%d %d\n",i,tblidx[i]): od: fprintf(fd, "\n\n/* Table with midpoints and polynomial coefficients */\n"): fprintf(fd, "static const double tbl[%d] = {\n",tbllen): for i from 0 to (tbllen - 1) do fprintf(fd, "%s\n",tbl[i]): od: fprintf(fd, "};\n\n"): fclose(fd): printf("----DONE---\n"): interval-2.1.0/src/crlibm/maple/asin-td.mpl0000644000000000000000000004070413031036767016705 0ustar 00000000000000####################################################################### # This file is part of the crlibm library, and is distributed under # the LGPL. # To use: # restart; read "exp-td.mpl"; Digits := 145: interface(quiet=true): read "common-procedures.mpl": read "triple-double.mpl": read "gal.mpl": mkdir("TEMPASIN"): with(orthopoly,T): truncPoly := proc(p,k) local i, q: q := 0: convert(q,polynom): for i from 0 to min(degree(p,x),k) do q := q + coeff(p,x,i) * x^i: od: return (q): end: intervals := 10: for i from 1 to intervals do epsAccurate[i] := 0.5: epsQuick[i] := 0.5: polyAccurate[i] := 1: polyQuick[i] := 1: od: epsAccurateSpecial := 0.5: epsQuickExtra := 0.5: lowestIntervalMax := 0.185: highestIntervalMin := 0.78: polyAccurateTDCoeffsLowest := 13: polyAccurateDDCoeffsLowest := 12: polyAccurateDCoeffsLowest := 16: polyAccurateDegreeLowest := polyAccurateTDCoeffsLowest + polyAccurateDDCoeffsLowest + polyAccurateDCoeffsLowest: polyQuickDDCoeffsLowest := 12: polyQuickDCoeffsLowest := 10: polyQuickDegreeLowest := polyQuickDDCoeffsLowest + polyQuickDCoeffsLowest: polyAccurateTDCoeffsMiddle := 7: polyAccurateDDCoeffsMiddle := 9: polyAccurateDCoeffsMiddle := 19: polyAccurateDegreeMiddle := polyAccurateTDCoeffsMiddle + polyAccurateDDCoeffsMiddle + polyAccurateDCoeffsMiddle: polyQuickDDCoeffsMiddle := 7: polyQuickDCoeffsMiddle := 7: polyQuickDegreeMiddle := polyQuickDDCoeffsMiddle + polyQuickDCoeffsMiddle: polyAccurateTDCoeffsHighest := 9: polyAccurateDDCoeffsHighest := 9: polyAccurateDCoeffsHighest := 11: polyAccurateDegreeHighest := polyAccurateTDCoeffsHighest + polyAccurateDDCoeffsHighest + polyAccurateDCoeffsHighest: polyQuickDDCoeffsHighest := 9: polyQuickDCoeffsHighest := 9: polyQuickDegreeHighest := polyQuickDDCoeffsHighest + polyQuickDCoeffsHighest: extrabound := hexa2ieee(["3F500000","00000000"]): polyQuickDegreeExtra := 5: bound[0] := 0: b := nearest(lowestIntervalMax): he := ieeehexa(b): bound[1] := hexa2ieee([he[1],"00000000"]): b := nearest(highestIntervalMin): he := ieeehexa(b): bound[intervals - 1] := hexa2ieee([he[1],"00000000"]): bound[intervals] := 1: linearWidth := (highestIntervalMin - lowestIntervalMax) / (intervals - 2): scaleSum := 0: scale[2] := 1.5: scale[3] := 1.35: scale[4] := 1.18: scale[5] := 1.00: scale[6] := 0.915: scale[7] := 0.74: scale[8] := 0.595: scale[9] := 0.50: for i from 2 to (intervals-1) do scaleSum := scaleSum + scale[i]: od: for i from 2 to (intervals-1) do scale[i] := scale[i] / scaleSum; od: current := lowestIntervalMax: for i from 2 to (intervals-2) do b := nearest(current + (highestIntervalMin - lowestIntervalMax) * scale[i]): current := b: he := ieeehexa(b): bound[i] := hexa2ieee([he[1],"00000000"]): od: printf("Using %d intervals with bounds:\n",intervals): for i from 0 to intervals do printf("bound[%d] = %1.30e\n",i,bound[i]): od: printf("Using an extra bound for truncating the quick poly to deg. %d in interval #0 for small args up to %f (2^(%f))\n", polyQuickDegreeExtra,extrabound,log[2](abs(extrabound))); printf("Computing Gal's accurate table values for interval midpoints\n"): for i from 2 to (intervals-1) do m := nearest((bound[i] + bound[i-1]) / 2): mhe := ieeehexa(m): printf("Interval %d: accurate table research start value %f (%s%s)\n",i,m,mhe[1],mhe[2]): midpointFloat[i] := galDoubleToDoubleDouble(nearest(m),arcsin,2^(-121),2^(15)): od: printf("Using the following floating point midpoints for intervals 2-%d:\n",intervals-2): for i from 2 to (intervals-1) do mhe := ieeehexa(midpointFloat[i]): printf("midpointFloat[%d] = %f (%s%s)\n",i,midpointFloat[i],mhe[1],mhe[2]): od: printf("The reduced argument z is therefore bounded by:\n"): printf("Interval 1: |z| < 2^(%f)\n", log[2](abs(bound[1]))): for i from 2 to (intervals-1) do printf("Interval %d: |z| < 2^(%f)\n",i, log[2](max(abs(midpointFloat[i] - bound[i-1]),abs(midpointFloat[i] - bound[i])))): od: printf("Interval %d: |z| < 2^(%f)\n",intervals, log[2](abs(1 - bound[intervals-1]))): printf("Using a %d degree polynomial for lowest interval (1) (accurate phase)\n", polyAccurateDegreeLowest): printf("with %d triple-double, %d double-double and %d double coefficients\n", polyAccurateTDCoeffsLowest, polyAccurateDDCoeffsLowest, polyAccurateDCoeffsLowest): printf("Using a %d degree polynomial for lowest interval (1) (quick phase)\n", polyQuickDegreeLowest): printf("with %d double-double and %d double coefficients\n", polyQuickDDCoeffsLowest, polyQuickDCoeffsLowest): printf("Using a %d degree polynomial for middle intervals (2-%d) (accurate phase)\n", polyAccurateDegreeMiddle,intervals-2): printf("with %d triple-double, %d double-double and %d double coefficients\n", polyAccurateTDCoeffsMiddle, polyAccurateDDCoeffsMiddle, polyAccurateDCoeffsMiddle): printf("Using a %d degree polynomial for middle intervals (2-%d) (quick phase)\n", polyQuickDegreeMiddle,intervals-2): printf("with %d double-double and %d double coefficients\n", polyQuickDDCoeffsMiddle, polyQuickDCoeffsMiddle): printf("Using a %d degree polynomial for highest interval (%d) (accurate phase)\n", polyAccurateDegreeHighest,intervals): printf("with %d triple-double, %d double-double and %d double coefficients\n", polyAccurateTDCoeffsHighest, polyAccurateDDCoeffsHighest, polyAccurateDCoeffsHighest): printf("Using a %d degree polynomial for highest interval (%d) (quick phase)\n", polyQuickDegreeHighest,intervals): printf("with %d double-double and %d double coefficients\n", polyQuickDDCoeffsHighest, polyQuickDCoeffsHighest): if true then printf("Computing polynomials for interval 1 ([%f;%f])\n",bound[0],bound[1]): f := unapply(convert(series((arcsin(sqrt(x))/sqrt(x) - 1)/x,x=0,300),polynom),x): p := unapply(eval(numapprox[chebyshev](f(x),x=(bound[0])^2..(bound[1])^2,2^(-127))),x): polyAccuExact[1] := truncPoly(subs(X=x^2,p(X))*x^3+x,polyAccurateDegreeLowest): polyAccurate[1] := poly_exact32(polyAccuExact[1],polyAccurateTDCoeffsLowest,polyAccurateDDCoeffsLowest): epsAccurate[1] := numapprox[infnorm]((polyAccurate[1]/arcsin(x))-1, x=bound[0]..bound[1]): epsAccurateSpecial := numapprox[infnorm]((polyAccurate[1]/arcsin(x))-1, x=bound[0]..evalf(sin(2^(-18)))): polyQuickExact[1] := truncPoly(polyAccuExact[1],polyQuickDegreeLowest): polyQuick[1] := poly_exact2(polyQuickExact[1],polyQuickDDCoeffsLowest): epsQuick[1] := numapprox[infnorm]((polyQuick[1]/arcsin(x))-1, x=bound[0]..bound[1]): polyQuickExtraExact := truncPoly(polyAccuExact[1],polyQuickDegreeExtra): polyQuickExtra := poly_exact2(polyQuickExtraExact,polyQuickDegreeExtra): epsQuickExtra := numapprox[infnorm]((polyQuickExtra/arcsin(x))-1, x=bound[0]..extrabound): end if: for i from 2 to (intervals-1) do printf("Computing polynomials for interval %d ([%f;%f])\n",i,bound[i-1],bound[i]): printf("Reduced argument z will be in interval [%1.8e;%1.8e] ([-2^%f,2^%f]),\n", bound[i-1]-midpointFloat[i],bound[i]-midpointFloat[i], log[2](abs(bound[i-1]-midpointFloat[i])),log[2](abs(bound[i]-midpointFloat[i]))): f := unapply(arcsin(x+midpointFloat[i]),x): fhelp := unapply(convert(series((f(x)-arcsin(midpointFloat[i]))/x,x=0,polyAccurateDegreeMiddle*3),polynom),x): polyAccuExact[i] := numapprox[minimax](fhelp(x), x=bound[i-1]-midpointFloat[i]..bound[i]-midpointFloat[i], [polyAccurateDegreeMiddle,0],1,'err')*x + nearestDD(evalf(arcsin(midpointFloat[i]))): polyAccurate[i] := poly_exact32(polyAccuExact[i],polyAccurateTDCoeffsMiddle,polyAccurateDDCoeffsMiddle): epsAccurate[i] := numapprox[infnorm]((polyAccurate[i]/f(x))-1, x=bound[i-1]-midpointFloat[i]..bound[i]-midpointFloat[i]): polyQuickExact[i] := truncPoly(polyAccuExact[i],polyQuickDegreeMiddle): polyQuick[i] := poly_exact2(polyQuickExact[i],polyQuickDDCoeffsMiddle): epsQuick[i] := numapprox[infnorm]((polyQuick[i]/f(x))-1, x=bound[i-1]-midpointFloat[i]..bound[i]-midpointFloat[i]): od: if true then printf("Computing polynomials for interval %d ([%f;%f])\n",intervals,bound[intervals-1],bound[intervals]): g := unapply(((arcsin(1 - x) - Pi/2)/sqrt(2*x)),x): f := unapply(convert(series(((g(x)+1)/x),x=0,polyAccurateDegreeHighest*4),polynom),x): polyAccuExact[intervals] := numapprox[minimax](f(x),x=(1-bound[intervals]+2^(-53))..(1-bound[intervals-1]), [polyAccurateDegreeHighest-1,0],1,'err')*x-1: polyAccurate[intervals] := poly_exact32(polyAccuExact[intervals],polyAccurateTDCoeffsHighest,polyAccurateDDCoeffsHighest): epsAccurate[intervals] := numapprox[infnorm](((unapply(polyAccurate[intervals],x)(x)/g(x))-1), x=(1-bound[intervals]+2^(-53))..(1-bound[intervals-1])): polyQuickExact[intervals] := truncPoly(polyAccuExact[intervals],polyQuickDegreeHighest): polyQuick[intervals] := poly_exact2(polyQuickExact[intervals],polyQuickDDCoeffsHighest): epsQuick[intervals] := numapprox[infnorm](((unapply(polyQuick[intervals],x)(x)/g(x))-1), x=(1-bound[intervals]+2^(-53))..(1-bound[intervals-1])): printf("Checking if the polynomial for interval %d is exactly -1 in z = %f...\n",intervals,1-bound[intervals]); if (unapply(polyAccurate[intervals],x)(1-bound[intervals]) = -1) then printf(" Check passed!\n"): else printf(" Check failed!\n"): end if: end if: for i from 1 to intervals do printf("Relative error for accurate phase polynomial in interval %d ([%f;%f]) is 2^(%f)\n", i,bound[i-1],bound[i],log[2](abs(epsAccurate[i]))): printf("Relative error for quick phase polynomial in interval %d ([%f;%f]) is 2^(%f)\n", i,bound[i-1],bound[i],log[2](abs(epsQuick[i]))): od: printf("Relative error for accurate phase polynomial #1 in special interval [0;sin(2^(-18))]) is 2^(%f)\n", log[2](abs(epsAccurateSpecial))): printf("Relative error for quick phase extra case truncated polynomial #1 in special interval [0;%f]) is 2^(%f)\n", extrabound,log[2](abs(epsQuickExtra))): (PiHalfH, PiHalfM, PiHalfL) := hi_mi_lo(evalf(Pi/2)): epsPiDD := evalf(((PiHalfH + PiHalfM) - Pi/2)/(Pi/2)): epsPiTD := evalf(((PiHalfH + PiHalfM + PiHalfL) - Pi/2) / (Pi/2)): printf("Relative error for storing Pi/2 as a double-double is 2^(%f)\n",evalf(log[2](abs(epsPiDD)))): printf("Relative error for storing Pi/2 as a triple-double is 2^(%f)\n",evalf(log[2](abs(epsPiTD)))): # Ce qui suit est pifometrique et doit etre prouve en Gappa ensuite arithmeticalErrorQuick[1] := 2^(-61): arithmeticalErrorQuick[2] := 2^(-61): arithmeticalErrorQuick[3] := 2^(-61): arithmeticalErrorQuick[4] := 2^(-61): arithmeticalErrorQuick[5] := 2^(-61): arithmeticalErrorQuick[6] := 2^(-61): arithmeticalErrorQuick[7] := 2^(-61): arithmeticalErrorQuick[8] := 2^(-61): arithmeticalErrorQuick[9] := 2^(-61): arithmeticalErrorQuick[10] := 2^(-68): arithmeticalErrorQuickExtra := 2^(-80): for i from 1 to intervals do estimatedOverallEpsQuick[i] := abs(epsQuick[i]) + abs(arithmeticalErrorQuick[i]) + abs(epsQuick[i]) * abs(arithmeticalErrorQuick[i]): printf("Relative quick phase overall error bound to show in Gappa for interval %d ([%f;%f]) is 2^(%f)\n", i,bound[i-1],bound[i],log[2](abs(estimatedOverallEpsQuick[i]))): od: estimatedOverallEpsQuickExtra := abs(epsQuickExtra) + abs(arithmeticalErrorQuickExtra) + abs(epsQuickExtra) * abs(arithmeticalErrorQuickExtra): printf("Relative quick phase overall error bound to show for extra truncted poly in interval [0;%f]) is 2^(%f)\n", extrabound,log[2](abs(estimatedOverallEpsQuickExtra))): printf("Write tables...\n"): filename:="TEMPASIN/asin-td.h": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "#include \"crlibm.h\"\n#include \"crlibm_private.h\"\n"): fprintf(fd, "\n/* File generated by maple/asin-td.mpl */\n\n"): printf("Write table with bounds\n"): fprintf(fd, "/* High order words of interval bounds (low order word is 0) */\n"): for i from 1 to (intervals-1) do heb := ieeehexa(bound[i]): fprintf(fd, "\#define BOUND%d 0x%s\n",i,heb[1]): od: heb := ieeehexa(extrabound): fprintf(fd, "\#define EXTRABOUND 0x%s\n",heb[1]): printf("Write additional constants\n"): fprintf(fd, "\n\n/* Pi/2 as a triple-double*/\n"): fprintf(fd, "\#define PIHALFH %1.50e\n",PiHalfH): fprintf(fd, "\#define PIHALFM %1.50e\n",PiHalfM): fprintf(fd, "\#define PIHALFL %1.50e\n",PiHalfL): printf("Write table with midpoints and polynomial coefficients\n"): k := 0: for i from 0 to polyAccurateDegreeLowest do (hi,mi,lo) := hi_mi_lo(coeff(polyAccurate[1],x,i)): if ((abs(hi) = 1.0) and (mi = 0) and (lo = 0)) then printf( "Coefficient %d of interval 1 polynomial is exactly %f and will not be stored in the table\n",i,hi): else g := 0; if (hi <> 0) then if (i <= polyQuickDegreeLowest) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyLowC%dh, quickPolyLowC%dh */",hi,k,i,i): else tbl[k] := sprintf("%1.50e, \t/* %d, accPolyLowC%dh */",hi,k,i): end if: k := k + 1: end if: if (mi <> 0) then if (i <= polyQuickDDCoeffsLowest) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyLowC%dm, quickPolyLowC%dl */",mi,k,i,i): else tbl[k] := sprintf("%1.50e, \t/* %d, accPolyLowC%dm */",mi,k,i): end if: k := k + 1: end if: if (lo <> 0) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyLowC%dl */",lo,k,i): k := k + 1: end if: end if: od: tbl[k] := sprintf("%1.50e, \t/* %d, RN rounding constant quick poly low*/", compute_rn_constant(estimatedOverallEpsQuick[1]),k): k := k + 1: tbl[k] := sprintf("%1.50e, \t/* %d, RD rounding constant quick poly low*/", estimatedOverallEpsQuick[1],k): k := k + 1: printf("Table for interval 1 written\n"): for l from 2 to (intervals-1) do tbl[k] := sprintf("%1.50e, \t/* %d, midpoint in interval %d*/",midpointFloat[l],k,l): tblidx[l] := k; k := k + 1; for i from 0 to polyAccurateDegreeMiddle do (hi,mi,lo) := hi_mi_lo(coeff(polyAccurate[l],x,i)): if ((abs(hi) = 1.0) and (mi = 0) and (lo = 0)) then printf( "Coefficient %d of interval %d polynomial is exactly %f and will not be stored in the table\n",i,l,hi): else g := 0; if (hi <> 0) then if (i <= polyQuickDegreeMiddle) then tbl[k] := sprintf( "%1.50e, \t/* %d, accPolyMid%dC%dh, quickPolyMid%dC%dh */",hi,k,l,i,l,i): else tbl[k] := sprintf("%1.50e, \t/* %d, accPolyMid%dC%dh */",hi,k,l,i): end if: k := k + 1: end if: if (mi <> 0) then if (i <= polyQuickDDCoeffsMiddle) then tbl[k] := sprintf( "%1.50e, \t/* %d, accPolyMid%dC%dm, quickPolyMid%dC%dl */",mi,k,l,i,l,i): else tbl[k] := sprintf("%1.50e, \t/* %d, accPolyMid%dC%dm */",mi,k,l,i): end if: k := k + 1: end if: if (lo <> 0) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyMid%dC%dl */",lo,k,l,i): k := k + 1: end if: end if: od: tbl[k] := sprintf("%1.50e, \t/* %d, RN rounding constant quick poly middle %d*/", compute_rn_constant(estimatedOverallEpsQuick[l]),k,l): k := k + 1: tbl[k] := sprintf("%1.50e, \t/* %d, RD rounding constant quick poly middle %d*/", estimatedOverallEpsQuick[l],k,l): k := k + 1: printf("Table for interval %d written\n",l): od: tblidx[intervals] := k: for i from 0 to polyAccurateDegreeHighest do (hi,mi,lo) := hi_mi_lo(coeff(polyAccurate[intervals],x,i)): if ((abs(hi) = 1.0) and (mi = 0) and (lo = 0)) then printf( "Coefficient %d of interval %d polynomial is exactly %f and will not be stored in the table\n",i,intervals,hi): else g := 0; if (hi <> 0) then if (i <= polyQuickDegreeHighest) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyHighC%dh, quickPolyHighC%dh */",hi,k,i,i): else tbl[k] := sprintf("%1.50e, \t/* %d, accPolyHighC%dh */",hi,k,i): end if: k := k + 1: end if: if (mi <> 0) then if (i <= polyQuickDDCoeffsHighest) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyHighC%dm, quickPolyHighC%dl */",mi,k,i,i): else tbl[k] := sprintf("%1.50e, \t/* %d, accPolyHighC%dm */",mi,k,i): end if: k := k + 1: end if: if (lo <> 0) then tbl[k] := sprintf("%1.50e, \t/* %d, accPolyHighC%dl */",lo,k,i): k := k + 1: end if: end if: od: tbl[k] := sprintf("%1.50e, \t/* %d, RN rounding constant quick poly high*/", compute_rn_constant(estimatedOverallEpsQuick[intervals]),k): k := k + 1: tbl[k] := sprintf("%1.50e, \t/* %d, RD rounding constant quick poly high*/", estimatedOverallEpsQuick[intervals],k): k := k + 1: printf("Table for interval %d written\n",intervals): tbllen := k: printf("The whole table has %d entries, so uses %d bytes of memory\n",tbllen,tbllen*8): fprintf(fd,"\n\n/* Indices to the following table */\n"): for i from 2 to intervals do fprintf(fd,"\#define TBLIDX%d %d\n",i,tblidx[i]): od: fprintf(fd, "\n\n/* Table with midpoints and polynomial coefficients */\n"): fprintf(fd, "static const double tbl[%d] = {\n",tbllen): for i from 0 to (tbllen - 1) do fprintf(fd, "%s\n",tbl[i]): od: fprintf(fd, "};\n\n"): fclose(fd): printf("----DONE---\n"): interval-2.1.0/src/crlibm/maple/atan-itanium.mpl0000644000000000000000000001073113031036767017732 0ustar 00000000000000##################################################################### # this file contains some useful procedures for the computation of atan in # DDE restart: Digits := 200: with (numapprox):with(orthopoly): read "double-extended.mpl"; read "common-procedures.mpl"; e := 2^(-6.3): marge := 2^(-30); P19 := convert(series(arctan(x),x=0,20),polynom): P18 := (P19-x)/x; Q18 := polyExact2Ext(P18, 9); Q9 := -1/3 +1/5*x - 1/7*x^2 + 1/9*x^3 - 1/11*x^4 + 1/13*x^5 - 1/15*x^6 + 1/17*x^7- 1/19*x^8; Qprime := poly_exact( -x /3 + x^2/5 - x^3/7 + x^4 /9); #log2 (infnorm( (arctan(x)-x*(1+Q18))/x, x=0..e)); #function taken from the "old" coef_atan to compute interval parameters. maxx := bi -> simplify( solve( (x-bi) / (1+x*bi) = e ,x) ): minx := bi -> simplify(solve( (x-bi) /(1+x*bi)=-e ,x)): nextbi := proc (x) evalf( max(solve( minx(bi) = x ,bi) )*(1-marge)); end: allbi := proc (n) local xi,nbi,x,i,j; global b,a, nbofai, nbofbi, valuefordicho; x := e; nbi := 0; i := 0; while(i= 0) do nbi := nearest ( nextbi(x) ); b[i] := evalf( nbi ); a[i] := x; x := evalf(maxx(nbi)); i:=i+1; od; j:=0; while ( 2^j < i ) do j:=j+1 od: nbofai := i; nbofbi := i; b[i-1] := nearest(1/e+4): valuefordicho := 2^j; return i,b[0],b[i-1]; end: allbi(100); #------------- #----------------------- #quick error calc : #-----Reduction:------- XredEpsilon := 2^(-64) + 2^(-64) + 2^(-64) + 2^(-64): Xred2Epsilon := 2*XredEpsilon + 2^(-64); log[2.](Xred2Epsilon); errlist:=errlist_quickphase_horner(degree(Qprime),0,0,Xred2Epsilon, 2^(-64)); errorr := compute_horner_rounding_error(Qprime,x,e,errlist,true); qEpsilon := errorr[1]: log[2.](qEpsilon); deltaApprox := e^11/11: polyDelta := e^3*qEpsilon + 2^(-64)*e+ 3*2^(-64)*e^3: EpsilonFinal := polyDelta/arctan(e)+2*2^(-64)+deltaApprox/e: log[2.](EpsilonFinal); #------no reduction------- Errlist:=errlist_quickphase_horner(degree(Qprime),0,0,0, 2**(-64)): qEpsilon:= compute_horner_rounding_error(Qprime,x,e,errlist,true)[1]: deltaApprox := e^11/5: EpsilonFinalNoRed := infnorm( (qEpsilon.x^3+2^(-64).x+2^(-64).x^3)/arctan(x),x=2^(-27)..2^(-6) ) + deltaApprox + 2^(-64): log[2.](EpsilonFinalNoRed); #----------------------- # Output : doth:=proc() local filename, fd, i, hi, lo; filename := "TEMPATAN/atan_ext.h": fd := fopen (filename,WRITE,TEXT): fprintf(fd,"/* file generated by atan_ext.mpl*/\n\n"): fprintf(fd,"#include \"double_ext.h\"\n"): fprintf(fd, "static const double HALFPI = %1.50e;\n", nearest(Pi/2)): fprintf(fd, "#define MIN_REDUCTION_NEEDED %s\n", printDoubleAsHexInt(e)): fprintf(fd,"#define A 0\n"): fprintf(fd,"#define B 1\n"): fprintf(fd,"#define ATAN_BHI 0\n"): fprintf(fd,"#define ATAN_BLO 1\n"): fprintf(fd,"#define epsilon %1.50e\n", EpsilonFinal): fprintf(fd,"#define epsilon_no_red %1.50e\n",EpsilonFinalNoRed): fprintf(fd,"#define TWO_M_64 %1.50e\n",2^(-64)): fprintf(fd,"#define TWO_10 %1.50e\n",2^10): if 1+1=3 then fprintf(fd, "__declspec(align(16)) static const unsigned long long int a_table[%d] = {\n", nbofai ); for i from 0 to nbofai - 1 do fprintf(fd, " /*a[%d] ~= %1.20e */ ",i,a[i]): fprintf(fd, " %s,\n", printDoubleAsULL(a[i])); od: fprintf(fd,"\n};\n"): fprintf(fd, "static const double b_table[%d] = {\n", nbofai ); for i from 0 to nbofai - 1 do fprintf(fd, " /*b[%d] = */ %1.50e,\n", i, b[i]): od: fprintf(fd,"\n};\n"): else fprintf(fd, "static const struct{long long int a; double b;} ab_table[%d] = {\n", nbofai); for i from 0 to nbofai - 1 do fprintf(fd, " { /*a[%d] ~= %1.20e */ ",i,a[i]): fprintf(fd, " %s,\n", printDoubleAsULL(a[i])); fprintf(fd, " /*b[%d] = */ %1.50e},\n", i, b[i]): od: fprintf(fd,"\n};\n"): fi: fprintf(fd, "#define atanb_table ((const XC_FLOAT_TYPE *)_atanb_table)\n"); fprintf(fd, "__declspec(align(16)) static const unsigned short _atanb_table[] = {\n", nbofai ); for i from 0 to nbofai - 1 do fprintf(fd, " /*atan_b[%d] ~= %1.10e*/\n ",i, arctan(b[i])): hi:=nearestExt(arctan(b[i])); lo:=arctan(b[i])-nearestExt(arctan(b[i])); fprintf(fd, " %s, \n", printDoubleExtAsShort(hi)); fprintf(fd, " %s, \n", printDoubleExtAsShort(lo)); od: fprintf(fd,"};\n"): printPolyExt(fd,Q9,4,"coef_poly"): fclose(fd): end proc; doth(); interval-2.1.0/src/crlibm/maple/atan-pentium.mpl0000644000000000000000000000717013031036767017750 0ustar 00000000000000##################################################################### # this file contains some useful procedures for the computation of atan in # DDE restart: Digits := 200: with (numapprox):with(orthopoly): read "double-extended.mpl"; read "common-procedures.mpl"; e := 2^(-6.3): marge := 2^(-30); P19 := convert(series(arctan(x),x=0,20),polynom): P18 := (P19-x)/x; Q18 := polyExact2Ext(P18, 9); Q9 := -1/3 +1/5*x - 1/7*x^2 + 1/9*x^3 - 1/11*x^4 + 1/13*x^5 - 1/15*x^6 + 1/17*x^7- 1/19*x^8; Qprime := poly_exact( -x /3 + x^2/5 - x^3/7 + x^4 /9); #log2 (infnorm( (arctan(x)-x*(1+Q18))/x, x=0..e)); #function taken from the "old" coef_atan to compute interval parameters. maxx := bi -> simplify( solve( (x-bi) / (1+x*bi) = e ,x) ): minx := bi -> simplify(solve( (x-bi) /(1+x*bi)=-e ,x)): nextbi := proc (x) evalf( max(solve( minx(bi) = x ,bi) )*(1-marge)); end: allbi := proc (n) local xi,nbi,x,i,j; global b,a, nbofai, nbofbi, valuefordicho; x := e; nbi := 0; i := 0; while(i= 0) do nbi := nearestExt ( nextbi(x) ); b[i] := evalf( nbi ); a[i] := x; x := evalf(maxx(nbi)); i:=i+1; od; j:=0; while ( 2^j < i ) do j:=j+1 od: nbofai := i; nbofbi := i; b[i-1] := nearestExt(1/e+4): valuefordicho := 2^j; return i,b[0],b[i-1]; end: allbi(100); #------------- #----------------------- #quick error calc : #-----Reduction:------- XredEpsilon := 2^(-64) + 2^(-64) + 2^(-64) + 2^(-64): Xred2Epsilon := 2*XredEpsilon + 2^(-64); log[2.](Xred2Epsilon); errlist:=errlist_quickphase_horner(degree(Qprime),0,0,Xred2Epsilon, 2^(-64)); errorr := compute_horner_rounding_error(Qprime,x,e,errlist,true); qEpsilon := errorr[1]: log[2.](qEpsilon); deltaApprox := e^11/11: polyDelta := e^3*qEpsilon + 2^(-64)*e+ 3*2^(-64)*e^3: EpsilonFinal := polyDelta/arctan(e)+2*2^(-64)+deltaApprox/e: log[2.](EpsilonFinal); #------no reduction------- Errlist:=errlist_quickphase_horner(degree(Qprime),0,0,0, 2**(-64)): qEpsilon:= compute_horner_rounding_error(Qprime,x,e,errlist,true)[1]: deltaApprox := e^11/5: EpsilonFinalNoRed := infnorm( (qEpsilon.x^3+2^(-64).x+2^(-64).x^3)/arctan(x),x=2^(-27)..2^(-6) ) + deltaApprox + 2^(-64): log[2.](EpsilonFinalNoRed); #----------------------- # Output : filename := "atan_ext_itanium.h": fd := fopen (filename,WRITE,TEXT): fprintf(fd,"/* file generated by atan_ext.mpl*/\n\n"): fprintf(fd,"#include \"double_ext.h\"\n"): fprintf(fd,"#ifdef WORDS_BIGENDIAN\n"): fprintf(fd, "static const db_number HALFPI = {{0x3FF921FB,0x54442D18}};"): fprintf(fd,"\n#else\n"): fprintf(fd, "static const db_number HALFPI = {{0x54442D18,0x3FF921FB}};"): fprintf(fd,"\n"): fprintf(fd,"#endif\n"): fprintf(fd, "#define MIN_REDUCTION_NEEDED %1.50f\n",e): fprintf(fd,"#define A 0\n"): fprintf(fd,"#define B 1\n"): fprintf(fd,"#define ATAN_BHI 2\n"): fprintf(fd,"#define ATAN_BLO 3\n"): fprintf(fd,"#define epsilon %1.50e\n", EpsilonFinal): fprintf(fd,"#define epsilon_no_red %1.50e\n",EpsilonFinalNoRed): fprintf(fd,"#define TWO_M_64 %1.50e\n",2^(-64)): fprintf(fd,"#define TWO_10 %1.50e\n",2^10): fprintf(fd, "static long double const arctan_table[%d][4] = \n{\n" , nbofai ); for i from 0 to nbofai - 1 do fprintf(fd, "{\n/*a[%d] */ ",i): fprintf(fd, "%1.50eL",a[i]); fprintf(fd," ,\n/*b[%d] : */ ",i): fprintf(fd, "%1.50eL",b[i]); fprintf(fd," ,\n/*atan_b[%d]*/ ",i): fprintf(fd, "%1.50eL",nearestExt(arctan(b[i]))); fprintf(fd,","); fprintf(fd, "%1.50eL",arctan(b[i])-nearestExt(arctan(b[i]))); fprintf(fd," ,\n}\n,"); od: fprintf(fd,"\n};\n"): fprintf(fd, "/*File generated by atan_exp.mpl*/\n"): printPolyExt(fd,Q9,4,"coef_poly"): fclose(fd): interval-2.1.0/src/crlibm/maple/atan.mpl0000644000000000000000000002336013031036767016270 0ustar 00000000000000restart: Digits := 100: with (numapprox):with(orthopoly): read "common-procedures.mpl"; mkdir("TEMPATAN"); #First, quick phase #Approach for the first function: #atan(x) = atan(b(i)) + atan ( (x-bi) / (1+x*b(i) ) ) #We try to have 64 correct bits #Constants #if (x >= xmax) : return arctan(x)/2)=neareast(Pi/2) log[2](evalf(min(solve(arctan(x)=nearest(Pi/2),x)))): xmax:=2^54: #halfPi=Pi/2 (remark that maxvalue < Pi/2 so that atan(x) < Pi/2 halfPi:=nearest(Pi/2): halfPi_to_plus_infinity:=nearest(nearest(Pi/2)*(1+2^(-53))): # invPi, for the atanpi function invpih,invpil := hi_lo(1/Pi); # if (xmin simplify( solve( (x-bi) / (1+x*bi) = e ,x) ): minx := bi -> simplify(solve( (x-bi) /(1+x*bi)=-e ,x)): nextbi := proc (x) evalf( max(solve( minx(bi) = x ,bi) )*(1-marge)); end: allbi := proc (n) local xi,nbi,x,i,j; global b,a, nb_of_ai, nb_of_bi, value_for_dicho; x := e; nbi := 0; i := 0; while(i= 0) do nbi := nearest ( nextbi(x) ); b[i] := evalf( nbi ); a[i] := x; x := evalf(maxx(nbi)); i:=i+1; od; j:=0; while ( 2^j < i ) do j:=j+1 od: nb_of_ai := i; nb_of_bi := i; b[i-1] := nearest(1/e+4): value_for_dicho := 2^j; return i,b[0],b[i-1]; end: allbi(100); #The polynome and its size ( 4 because 4 terms : x^2/3, ...) Q9:= poly_exact(x-1/3*x^3+1/5*x^5 -1/7*x^7+1/9*x^9): deg_poly := 4: coef_poly[0]:=nearest (-1/3): coef_poly[1]:=nearest (1/5): coef_poly[2]:=nearest (-1/7): coef_poly[3]:=nearest (1/9): Q := x^2 * coef_poly[0] + x^4*coef_poly[1] + x^6*coef_poly[2] + x^8 * coef_poly[3]: Qprime := poly_exact( x * coef_poly[0] + x^2*coef_poly[1] + x^3*coef_poly[2] + x^4 * coef_poly[3]): log[2] (infnorm( (arctan(x)-x*(1+Q) )/x,x=2^(-53)..e)); # we can note that arctan(x) = sum((-1)^i*x^(2*i+1)/(2*i+1), i = (0 .. infinity)) # so ( arctan(x) - Q9(x) ) / x = sum((-1)^i*x^(2*i)/(2*i+1), i = (5 .. infinity)) # so abs ( (arctan(x) -Q9(x) )/x ) <= x^10 * sum((-1)^(i+1)*x^(2*i)/(2*i+1+10), i = (0 .. infinity)) # <= x^10 * 1/11 # <= 2^(-66) if x<2^(-6.3) #Conputation of the RN constant #Epsilon = relative error #Delta = absolute error #1st : Error about reduction: EpsilonXminusBi := 2^(-105): # 1 + x*b[i] : Epsilon1A22xbi := 2^(-104): # Xred = (x-b[i]) / ( 1 + x*b[i] ) EpsilonXred := EpsilonXminusBi+Epsilon1A22xbi + 2^(-105): DeltaXred := EpsilonXred * e: log2(EpsilonXred); #Polynomial evaluation : #atan ~= x - x^3/3 + x^5/5 - x^7/7 + x^9/9 # ~= x * ( 1 + Q(x^2) ) # = (xhi+xlo) * ( 1 + Q) # ~= xhi + (xhi*Q + xlo) # Warning : the approx about x !! #calc of Q: EpsilonXred2 := (1+2^(-53) + 2^(-105) )^2 * (1+2^(-53)) -1 : log2(EpsilonXred2); errlist:=errlist_quickphase_horner( degree( x^4 ),0,0,EpsilonXred2, 2**(-53)): rounding_error1:= compute_horner_rounding_error(Qprime,x,e,errlist,true): EpsilonQ := rounding_error1[1]: log2(EpsilonQ); # Since q will be multiplied in x(1+q), its absolute error term is : Qmax:=infnorm(Qprime,x=-e^2..e^2): DeltaQ := e*Qmax*EpsilonQ; log2(DeltaQ); # calc of xi*Q + xlo + atan(b[i])lo #First the truncation of xredlo*q : at most half an ulp of xredhi*q DeltaTruncXredloQ := 2^(-53) * e * Qmax: log2(DeltaTruncXredloQ); #then the sum of atanbilo and xredlo : the largest term is atanbilo DeltaAdd1 := 0.5*ulp(2^(-53)*(Pi/2 + e)): log2(DeltaAdd1); #then compute xredhi*q DeltaXredhiQ := 0.5*ulp(e*Qmax): log2(DeltaXredhiQ); # and the second addition DeltaAdd2 := 0.5*ulp(e*Qmax + 2^(-53)*(Pi/2 + e) ): log2(DeltaAdd2); DeltaAtanlolo := DeltaTruncXredloQ + DeltaAdd1 + DeltaXredhiQ + DeltaAdd2: log2(DeltaAtanlolo); # In the second reconstruction there is one more FP add which is # aligned to the previous: DeltaReconst := DeltaAtanlolo + DeltaAdd2 : log2(DeltaReconst); # error due to the approx of atan by P : < e^11/11 Deltaapprox := infnorm( (arctan(x)-x*(1+Q)), x=0..e): log[2](Deltaapprox); DeltaTotal := Deltaapprox + DeltaQ + DeltaReconst : log2(DeltaTotal); EpsilonTotal := evalf( DeltaTotal / arctan(xx) ): EpsilonFinal := infnorm( EpsilonTotal,xx=2^(-6.3)..1,'xmaxmax'): EpsilonFinal_i_10 := infnorm( EpsilonTotal,xx=a[10]..2^60,'xmaxmax'): log2( EpsilonFinal ); log2( EpsilonFinal_i_10 ); # Computation of e and e_i_30 (which is e when i>30 (ie x>1) E := evalf(compute_rn_constant(EpsilonFinal)); E_i_10 := evalf(compute_rn_constant(EpsilonFinal_i_10)); #An other Constant : when there is no reduction. #We compute the polynom and then atan(x) = x + x.Q Epsilonx2 := 2^(-53): errlist:=errlist_quickphase_horner( degree( Qprime ),0,0,Epsilonx2, 2**(-53)): rounding_error:= compute_horner_rounding_error(Qprime,x,e,errlist,true): epsilon_Q := rounding_error[1]: log[2](epsilon_Q); epsilon_x_Q := 2^(-52): delta_final := 2^(-105)*x + epsilon_Q*x^3 + epsilon_x_Q*x^3 - arctan(x) + x*(1+Q): epsilon_final := infnorm(delta_final/x,x=2^(-10)..e): epsilon_final_m10 := infnorm(delta_final/x,x=2^(-24)..2^(-10)): log[2](epsilon_final); E_no_reduction := evalf(compute_rn_constant(epsilon_final)); E_no_reduction_m10 := evalf(compute_rn_constant(epsilon_final_m10)); # Output #test filename:="TEMPATAN/atan_fast.h": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "\n/*File generated by maple/atan.mpl */\n"): fprintf(fd, "#ifndef _ATAN_FAST_H\n#define _ATAN_FAST_H\n\n"); fprintf(fd, "#include \"crlibm.h\"\n#include \"crlibm_private.h\"\n"): fprintf(fd,"#ifdef WORDS_BIGENDIAN\n"): fprintf(fd, "static const db_number HALFPI = {{0x3FF921FB,0x54442D18}};"): fprintf(fd, "static const db_number HALFPI_TO_PLUS_INFINITY = {{0x3FF921FB,0x54442D19}};"): fprintf(fd,"\n#else\n"): fprintf(fd, "static const db_number HALFPI = {{0x54442D18,0x3FF921FB}};"): fprintf(fd, "static const db_number HALFPI_TO_PLUS_INFINITY = {{0x54442D19,0x3FF921FB}};"): fprintf(fd,"\n"): fprintf(fd,"#endif\n"): fprintf(fd, "#define MIN_REDUCTION_NEEDED %1.50f\n",e): fprintf(fd, "#define INVPIH %1.50f\n", invpih): fprintf(fd, "#define INVPIL %1.50f\n", invpil): fprintf(fd,"#define nb_of_ai %d\n",nb_of_ai): fprintf(fd,"#define nb_of_bi %d\n",nb_of_bi): # we multiply by 2^(-20) in order to prevent from rounding fprintf(fd, "static const double rncst[4] ={\n"): fprintf(fd, "%1.50f , /* i<10 */ \n",E*(1+2^(-20))) : fprintf(fd, "%1.50f , /* i>10 */ \n",E_i_10*(1+2^(-20))) : fprintf(fd, "%1.50f , /* e > 2^-10 */ \n",E_no_reduction*(1+2^(-20))) : fprintf(fd, "%1.50f , /* e < 2^-10 */ \n };\n",E_no_reduction_m10*(1+2^(-20))) : fprintf(fd, "static const double epsilon[4] ={\n"): fprintf(fd, "%1.50e ,\n",EpsilonFinal *(1+2^(-20))) : fprintf(fd, "%1.50e ,\n",EpsilonFinal_i_10*(1+2^(-20))) : fprintf(fd, "%1.50e ,\n",epsilon_final*(1+2^(-20))) : fprintf(fd, "%1.50e ,\n };\n",epsilon_final_m10*(1+2^(-20))) : fprintf(fd, "#define DEGREE %d\n", deg_poly): fprintf(fd, "static double const coef_poly[%d] = \n{\n",deg_poly): for i from deg_poly-1 to 0 by -1 do fprintf(fd, "/* coef for degree %d */ %1.50f, \n" , 2*i+3, coef_poly[i]): od: fprintf(fd," }; \n"); fprintf(fd,"#define A 0\n"): fprintf(fd,"#define B 1\n"): fprintf(fd,"#define ATAN_BHI 2\n"): fprintf(fd,"#define ATAN_BLO 3\n"): fprintf(fd,"\n#ifdef WORDS_BIGENDIAN\n "): for isbig from 1 to 0 by -1 do if(isbig=0) then fprintf(fd,"#else\n"); fi: if(not (nb_of_ai = nb_of_bi)) then printf("Warning : nb_of_ai != nb_of_bi, this should not work"); fi: fprintf(fd,"\n/* limits of the intervals [a[i],b[i]] */\n"); fprintf(fd, "static db_number const arctan_table[%d][4] = \n{\n" , nb_of_ai ); for i from 0 to nb_of_ai - 1 do fprintf(fd, "{\n/*a[%d] */ ",i); printendian(fd,a[i],isbig); fprintf(fd," ,\n/*b[%d] : */ ",i): printendian(fd,b[i],isbig): fprintf(fd," ,\n/*atan_b[%d]*/ ",i): printendian(fd, arctan(b[i]) ,isbig): fprintf(fd,","); printendian(fd, arctan(b[i])-nearest(arctan(b[i])) ,isbig); fprintf(fd," ,\n}\n,"); od; fprintf(fd,"\n};\n"); od: fprintf(fd,"\n#endif\n\n"): fprintf(fd, "#endif /* def _ATAN_FAST_H */\n"); fclose(fd); # Scs phase #Now we want a precision of 130 bits in order to have correct rounding in all cases. evalf(log[2](e^21/21)); #Test about Rounding : #error on the polynom : P_scs := convert(series(arctan(x),x=0,21),polynom); evalf(log[2](e^21/21)); #Intervals parameters #We choose the same e and the same intervals as in the quick phase. #We have the same b[i]s and a[i]s but we save atan[b[i]] on 4 doubles # Output filename:="TEMPATAN/atan_accurate.h": fd1:=fopen(filename, WRITE, TEXT): fprintf(fd1, "#include \"crlibm.h\"\n#include \"crlibm_private.h\" \n#include \"atan_fast.h\"\n"): fprintf(fd1, "\n/*File generated by maple/atan.mpl */\n"): Write_SCS_poly(fd1, "constant_poly", P_scs); fprintf(fd1,"#define constant_poly_ptr (scs_ptr)&constant_poly\n"); # The 1/Pi SCS constant fprintf(fd, "static const scs InvPiSCS=\n"): WriteSCS(fd, evalf(1/Pi)): fprintf(fd, ";\n#define InvPiSCS_ptr (scs_ptr)(& InvPiSCS)\n\n"): fprintf(fd1,"#ifdef WORDS_BIGENDIAN\n\n"): for isbig from 1 to 0 by -1 do if isbig = 0 then fprintf(fd1, "\n#else\n"): fi: fprintf(fd1,"static const db_number atan_blolo[%d] = {\n",nb_of_ai); for i from 0 to nb_of_ai-1 do fprintf(fd1,"/* %d */ ",i): temp0 := nearest(arctan(b[i])); temp := nearest( arctan(b[i]) - nearest(arctan(b[i]))); temp1 := nearest( arctan(b[i]) - temp -temp0); printendian(fd1,temp1,isbig): fprintf(fd1,", \n"); od: fprintf(fd1,"};\n"): od: fprintf(fd1,"\n#endif /* WORDS_BIGENDIAN */ \n"); fclose(fd1); interval-2.1.0/src/crlibm/maple/check-hints-log-td.sh0000755000000000000000000000635713031036767020565 0ustar 00000000000000#!/bin/sh # # This will only function if you have a modified version of the gappa tool # # You probably need to edit the path to the gappa executable GAPPA=~/ble/gappa-0.4.5/src/gappa cat log-td.gappa | grep "#MAPLE" | sed -e s/=/:=/ -e "s/;/:/" > log-td.gappa.autocheck.mpl echo "printf(\"You should see only zeros in what follows:\\n\");" >> log-td.gappa.autocheck.mpl sed -f ./TEMPLOG/log-td_1.sed log-td.gappa | $GAPPA 2>&1 | grep simplify >> log-td.gappa.autocheck.mpl echo "printf(\"If you have seen only zeros up to now, everything's fine \\n\");" >> log-td.gappa.autocheck.mpl cat log-td-E0.gappa | grep "#MAPLE" | sed -e s/=/:=/ -e "s/;/:/" > log-td-E0.gappa.autocheck.mpl echo "printf(\"You should see only zeros in what follows:\\n\");" >> log-td-E0.gappa.autocheck.mpl sed -f ./TEMPLOG/log-td_1.sed log-td-E0.gappa | $GAPPA 2>&1 | grep simplify >> log-td-E0.gappa.autocheck.mpl echo "printf(\"If you have seen only zeros up to now, everything's fine \\n\");" >> log-td-E0.gappa.autocheck.mpl cat log-td-E0-logir0.gappa | grep "#MAPLE" | sed -e s/=/:=/ -e "s/;/:/" > log-td-E0-logir0.gappa.autocheck.mpl echo "printf(\"You should see only zeros in what follows:\\n\");" >> log-td-E0-logir0.gappa.autocheck.mpl sed -f ./TEMPLOG/log-td_1.sed log-td-E0-logir0.gappa | $GAPPA 2>&1 | grep simplify >> log-td-E0-logir0.gappa.autocheck.mpl echo "printf(\"If you have seen only zeros up to now, everything's fine \\n\");" >> log-td-E0-logir0.gappa.autocheck.mpl cat log-td-accurate.gappa | grep "#MAPLE" | sed -e s/=/:=/ -e "s/;/:/" > log-td-accurate.gappa.autocheck.mpl echo "printf(\"You should see only zeros in what follows:\\n\");" >> log-td-accurate.gappa.autocheck.mpl sed -f ./TEMPLOG/log-td-accurate_1.sed log-td-accurate.gappa | $GAPPA 2>&1 | grep simplify >> log-td-accurate.gappa.autocheck.mpl echo "printf(\"If you have seen only zeros up to now, everything's fine \\n\");" >> log-td-accurate.gappa.autocheck.mpl cat log-td-accurate-E0.gappa | grep "#MAPLE" | sed -e s/=/:=/ -e "s/;/:/" > log-td-accurate-E0.gappa.autocheck.mpl echo "printf(\"You should see only zeros in what follows:\\n\");" >> log-td-accurate-E0.gappa.autocheck.mpl sed -f ./TEMPLOG/log-td-accurate_1.sed log-td-accurate-E0.gappa | $GAPPA 2>&1 | grep simplify >> log-td-accurate-E0.gappa.autocheck.mpl echo "printf(\"If you have seen only zeros up to now, everything's fine \\n\");" >> log-td-accurate-E0.gappa.autocheck.mpl cat log-td-accurate-E0-logir0.gappa | grep "#MAPLE" | sed -e s/=/:=/ -e "s/;/:/" > log-td-accurate-E0-logir0.gappa.autocheck.mpl echo "printf(\"You should see only zeros in what follows:\\n\");" >> log-td-accurate-E0-logir0.gappa.autocheck.mpl sed -f ./TEMPLOG/log-td-accurate_1.sed log-td-accurate-E0-logir0.gappa | $GAPPA 2>&1 | grep simplify >> log-td-accurate-E0-logir0.gappa.autocheck.mpl echo "printf(\"If you have seen only zeros up to now, everything's fine \\n\");" >> log-td-accurate-E0-logir0.gappa.autocheck.mpl echo "read \"log-td.gappa.autocheck.mpl\";" | maple echo "read \"log-td-E0.gappa.autocheck.mpl\";" | maple echo "read \"log-td-E0-logir0.gappa.autocheck.mpl\";" | maple echo "read \"log-td-accurate.gappa.autocheck.mpl\";" | maple echo "read \"log-td-accurate-E0.gappa.autocheck.mpl\";" | maple echo "read \"log-td-accurate-E0-logir0.gappa.autocheck.mpl\";" | maple interval-2.1.0/src/crlibm/maple/common-procedures.mpl0000644000000000000000000007625613031036767021022 0ustar 00000000000000 ##################################################################### # Useful procedures for IEEE doubles #--------------------------------------------------------------------- log2:=proc(x) evalf( log[2](x)) end proc: #--------------------------------------------------------------------- # ieeedouble converts a number to IEEE double format. # returns sign (-1 or 1), exponent between -1022 and 1023, mantissa as a fraction between 0.5 and 1. ieeedouble:=proc(xx) local x, sgn, logabsx, exponent, mantissa, infmantissa,powermin,powermax,expmin,expmax,expmiddle,powermiddle; Digits := 100; x := evalf(xx); if (x=0) then sgn, exponent, mantissa := 1, -1022, 0 else if (x < 0) then sgn := -1 else sgn := 1 fi: x := abs(x); if x >= 2^(1023)*(2-2^(-53)) then mantissa := infinity; exponent := 1023 else if x <= 2^(-1075) then mantissa := 0; exponent := -1022 else if x <= 2^(-1022) then exponent := -1022 else # x is between 2^(-1022) and 2^(1024) powermin := 2^(-1022); expmin := -1022; powermax := 2^1024; expmax := 1024; while (expmax-expmin > 1) do expmiddle := round((expmax+expmin)/2); powermiddle := 2^expmiddle; if x >= powermiddle then powermin := powermiddle; expmin := expmiddle else powermax := powermiddle; expmax := expmiddle fi od; # now, expmax - expmin = 1 and powermin <= x < powermax, # powermin = 2^expmin and powermax = 2^expmax, so expmin is the exponent of x exponent := expmin; fi; infmantissa := x*2^(52-exponent); if frac(infmantissa) <> 0.5 then mantissa := round(infmantissa) else mantissa := floor(infmantissa); if type(mantissa,odd) then mantissa := mantissa+1 fi fi; mantissa := mantissa*2^(-52); fi; fi; fi; sgn,exponent,mantissa; end: #--------------------------------------------------------------------- # ieeedoubleRU converts a number to IEEE double format rounding upwards. # returns sign (-1 or 1), exponent between -1022 and 1023, mantissa as a fraction between 0.5 and 1. ieeedoubleRU:=proc(xx) local x, sgn, logabsx, exponent, mantissa, infmantissa,powermin,powermax,expmin,expmax,expmiddle,powermiddle; Digits := 100; x := evalf(xx); if (x=0) then sgn, exponent, mantissa := 1, -1022, 0 else if (x < 0) then sgn := -1 else sgn := 1 fi: x := abs(x); if x >= 2^(1023)*(2-2^(-53)) then mantissa := infinity; exponent := 1023 else if x <= 2^(-1075) then mantissa := 0; exponent := -1022 else if x <= 2^(-1022) then exponent := -1022 else # x is between 2^(-1022) and 2^(1024) powermin := 2^(-1022); expmin := -1022; powermax := 2^1024; expmax := 1024; while (expmax-expmin > 1) do expmiddle := round((expmax+expmin)/2); powermiddle := 2^expmiddle; if x >= powermiddle then powermin := powermiddle; expmin := expmiddle else powermax := powermiddle; expmax := expmiddle fi od; # now, expmax - expmin = 1 and powermin <= x < powermax, # powermin = 2^expmin and powermax = 2^expmax, so expmin is the exponent of x exponent := expmin; fi; infmantissa := x*2^(52-exponent); if frac(infmantissa) <> 0 then if (sgn > 0) then mantissa := ceil(infmantissa); else mantissa := floor(infmantissa); fi; else mantissa := infmantissa; fi; mantissa := mantissa*2^(-52); fi; fi; fi; sgn,exponent,mantissa; end: #--------------------------------------------------------------------- # ieeedoubleRD converts a number to IEEE double format rounding downwards. # returns sign (-1 or 1), exponent between -1022 and 1023, mantissa as a fraction between 0.5 and 1. ieeedoubleRD:=proc(xx) local x, sgn, logabsx, exponent, mantissa, infmantissa,powermin,powermax,expmin,expmax,expmiddle,powermiddle; Digits := 100; x := evalf(xx); if (x=0) then sgn, exponent, mantissa := 1, -1022, 0 else if (x < 0) then sgn := -1 else sgn := 1 fi: x := abs(x); if x >= 2^(1023)*(2-2^(-53)) then mantissa := infinity; exponent := 1023 else if x <= 2^(-1075) then mantissa := 0; exponent := -1022 else if x <= 2^(-1022) then exponent := -1022 else # x is between 2^(-1022) and 2^(1024) powermin := 2^(-1022); expmin := -1022; powermax := 2^1024; expmax := 1024; while (expmax-expmin > 1) do expmiddle := round((expmax+expmin)/2); powermiddle := 2^expmiddle; if x >= powermiddle then powermin := powermiddle; expmin := expmiddle else powermax := powermiddle; expmax := expmiddle fi od; # now, expmax - expmin = 1 and powermin <= x < powermax, # powermin = 2^expmin and powermax = 2^expmax, so expmin is the exponent of x exponent := expmin; fi; infmantissa := x*2^(52-exponent); if frac(infmantissa) <> 0 then if (sgn < 0) then mantissa := ceil(infmantissa); else mantissa := floor(infmantissa); fi; else mantissa := infmantissa; fi; mantissa := mantissa*2^(-52); fi; fi; fi; sgn,exponent,mantissa; end: #--------------------------------------------------------------------- # pulp returns the precision of the ulp of x pulp:=proc(x) local flt, ulpy: flt:=ieeedouble(x): ulpy:=-52+flt[2]: end proc: #--------------------------------------------------------------------- # ulp returns the absolute value of the ulp of x ulp:=proc(x) 2**(pulp(x)): end proc: #--------------------------------------------------------------------- # Returns nearest IEEE double: nearest := proc(x) local sgn, exponent, mantissa: sgn,exponent,mantissa := ieeedouble(x): sgn*mantissa*2^(exponent): end: #--------------------------------------------------------------------- # Returns RU IEEE double: roundUp := proc(x) local sgn, exponent, mantissa: sgn,exponent,mantissa := ieeedoubleRU(x): sgn*mantissa*2^(exponent): end: #--------------------------------------------------------------------- # Returns RD IEEE double: roundDown := proc(x) local sgn, exponent, mantissa: sgn,exponent,mantissa := ieeedoubleRD(x): sgn*mantissa*2^(exponent): end: #--------------------------------------------------------------------- # Returns RZ IEEE double: roundToZero := proc(x) if evalf(x) > 0 then roundDown(x) else roundUp(x) fi: end: #--------------------------------------------------------------------- # ieehexa returns a string containing the hexadecimal representation of the double nearest to input x. ieeehexa:= proc(x) local hex2, xx, longint, expo, sgn, frac, resultat: if(x=0) then resultat:=["00000000","00000000"]: elif(x=-0) then resultat:=["80000000","00000000"]: # nice try else xx:=ieeedouble(x): sgn:=xx[1]: expo:=xx[2]: frac:=xx[3]: if (expo = -1023) then longint := (frac)*2^51 : # subnormal else longint := (frac-1)*2^52 + (expo+1023)*2^52: fi: if (sgn=-1) then longint := longint + 2^63: fi: longint := longint + 2^64: # to get all the hexadecimal digits when we'll convert to string hex2:=convert(longint, hex): hex2:=convert(hex2, string): resultat:=[substring(hex2,2..9), substring(hex2,10..18)]: fi: resultat: end proc: ieeehexaString := proc(x) local hex, result: hex := ieeehexa(x): result := cat(hex[1],hex[2]): return result: end proc: #--------------------------------------------------------------------- # reciprocal of the previous hexa2ieee:= proc(hexa) local dec, bin, expo, mantis, sgn, hex1, hex2, hexcat, res: hex1:= op(1, hexa): hex2:= op(2, hexa): hexcat:= cat(hex1, hex2): dec:= convert(hexcat, decimal, hex): if(dec >= 2^63) then dec := dec - 2^63: sgn:= -1: else sgn:= 1: fi: expo:= trunc(dec/(2^52)) - 1023: if(expo=-1023) then mantis:= frac(dec/(2^51)): # denormal else mantis:= 1+frac(dec/(2^52)): fi: res:= evalf(sgn*2^(expo)*mantis): res: end proc: #--------------------------------------------------------------------- # Print a number x in Low or Big Endian representation in opened file "fd": printendian:=proc(fd,x,isbig) local xhl: xhl:=ieeehexa(x): if(isbig=0 or isbig=1) then fprintf(fd,"{{0x%+0.8s,0x%+0.8s}} /* %+0.10e */", xhl[2-isbig], xhl[isbig+1], x): else print("ERROR, isbig must be equal to 0 or 1"): end if: end proc: #--------------------------------------------------------------------- # hi_lo takes an arbitrary precision number x and returns two doubles such that: # x ~ x_hi + x_lo hi_lo:= proc(x) local x_hi, x_lo, res: x_hi:= nearest(evalf(x)): res:=x-x_hi: if (res = 0) then x_lo:=0: else x_lo:=nearest(evalf(res)): end if: x_hi,x_lo: end: #--------------------------------------------------------------------- # same as hi_lo, but returns hexadecimal strings ieeehexa2:=proc(x) local reshi, reslo, hexhi, hexlo: reshi:=nearest(x): hexhi:=ieee2hexa(reshi): reslo:= nearest(x-reshi): hexlo:=ieee2hexa(reslo): reshi, reslo: end proc: #--------------------------------------------------------------------- # Computes the constant for the round-to-nearest test. # epsilon is the overall relative error of the approximation scheme # See the documentation for the explanation of these formulae compute_rn_constant := proc(epsilon) local k, constGenCase, constPowerOf2: k := trunc(-log[2](epsilon)) - 53: (1 + 2**54*epsilon / (1 - epsilon - 2**(-k+1) ) ) / (1-2**(-53)) end proc: #--------------------------------------------------------------------- # Takes a real number, and prints the bits after the 53th of its nearest IEEE floating-point number showHowDifficultToRound:=proc(x) local xb,xs,s,e,m: Digits:=200: s,e,m := ieeedouble(x): xb:=convert(evalf(x*2^(-e)),binary): xs:=convert(xb, string): substring(xs,55..153) end proc: #--------------------------------------------------------------------- # Computes the floating point successor of x succDouble:=proc(x) local s,he,hexcat,hehi,helo,castx,shex,neg; he := ieeehexa(x); hehi:= op(1, he); helo:= op(2, he); hexcat := cat(hehi, helo); neg := 1; castx := convert(hexcat, decimal, hex); if (castx >= 2^(63)) then castx := castx - 2^(63); neg := -1; end if; castx := castx + neg; shex := convert(convert(castx, hex),string); s := neg * hexa2ieee([substring(shex,1..8), substring(shex,9..16)]); s; end proc: ##################################################################### # Stuff about truncated polynomials # Truncate a polynomial #--------------------------------------------------------------------- #poly_exact takes a polynomial in x with arbitrary precision # coefficients, and returns a truncated polynomial where coefficients # are IEEE doubles. poly_exact:=proc(P) local deg,i, coef, coef_t, Q: Q:= 0: convert(Q, polynom): deg:=degree(P,x): for i from 0 to deg do coef:=coeff(P,x,i): coef_t:=nearest(coef): Q:= Q + coef_t*x^i: od: return(Q): end: #--------------------------------------------------------------------- #Like poly_exact, but the n first coefficients are exactly # representable as the sum of two doubles. (to actually get the two # doubles, use procedure hi_lo) poly_exact2:=proc(P,n) local deg,i, coef, coef_hi, coef_lo, Q: Q:= 0: convert(Q, polynom): deg:=degree(P,x): for i from 0 to deg do coef :=coeff(P,x,i): coef_hi, coef_lo:=hi_lo(coef): Q:= Q + coef_hi*x^i: if(i|x*Si|. It prints warnings if it not the case. compute_abs_rounding_error:=proc(poly,xmax, nn) local n, deg, delta, deltap, i, S, P, Snorm, Smin, Smax, prec: deltap:=0: delta:=0: deg:=degree(poly): prec:=53: # precision of the first iterations S:=coeff(poly, x, deg): Smax:=abs(S): Smin:=Smax: if nn<0 then n:=0: else n:=nn: fi:# sometimes called by compute_rel_rounding_error with n=-1 for i from (deg-1) to 0 by -1 do P:= convert(S*x, polynom): Smin := abs(coeff(poly,x,i)) - xmax*Smax : if(Smin<=0) then printf("Warning! in compute_abs_rounding_error, Smin<=0 at iteration %d, consider decreasing xmax\n",i): fi: delta:= evalf(xmax*deltap + 2**(-prec)*xmax*Smax): if i0) then p:=100: else p:=53: fi: if coeff(poly,x, 0) = 0 then deltap, Smin, Smax := compute_abs_rounding_error(poly/x,xmax, n-1): rho := (2^(-p)*(Smax+deltap) +deltap ) / Smin : else deltap, Smin, Smax := compute_abs_rounding_error(poly,xmax, n): rho := deltap / Smin: fi: rho: end proc: #--------------------------------------------------------------------- # OBSOLETE use compute_horner_rounding_error below # Computes the accumulated rounding error during the polynomial evaluation. # P is the polynomial. # xmax is the max value of |x|. # n is the degree when P is computed in double double. The first double-double operation is a multiplication (probably less useful). # returns max absolute error, min of the function, max of the function. # This procedure also checks on the fly that the fast (test-free) versions of the double-double addition can be used, i.e. that for all x, at each Horner step i computing ci+x*Si, we have |ci|>|x*Si|. It prints warnings if it not the case. compute_abs_rounding_error_firstmult:=proc(poly,xmax, nn) local n, deg, delta, deltap, i, S, P, Snorm, Smin, Smax, prec: deltap:=0: delta:=0: deg:=degree(poly): prec:=53: # precision of the first iterations S:=coeff(poly, x, deg): Smax:=abs(S): Smin:=Smax: if nn<0 then n:=0: else n:=nn: fi:# sometimes called by compute_rel_rounding_error with n=-1 for i from (deg-1) to 0 by -1 do if i=n-1 then prec:=100: fi: # from the mult of the n-1-th iteration P:= convert(S*x, polynom): Smin := abs(coeff(poly,x,i)) - xmax*Smax : if(Smin<=0) then printf("Warning! in compute_abs_rounding_error, Smin<=0 at iteration %d, consider decreasing xmax\n",i): fi: delta:= evalf(xmax*deltap + 2**(-prec)*xmax*Smax): if i0) then p:=100: else p:=53: fi: if coeff(poly,x, 0) = 0 then deltap, Smin, Smax := compute_abs_rounding_error_firstmult(poly/x,xmax, n-1): rho := (2^(-p)*(Smax+deltap) +deltap ) / Smin : else deltap, Smin, Smax := compute_abs_rounding_error_firstmult(poly,xmax, n): rho := deltap / Smin: fi: rho: end proc: # Compute a good truncated polynomial approximation for a function # Computes an approximation to a function of x f, as a truncated polynomial of deegree deg with the n first coefficients exactly representable as double-double. # The function f(x) must have as input interval xmin..xmax # returns [ truncated polynomial, relative approx error of trunc. poly. , infinite precision polynomial, rel. error of inf. prec. poly ] poly_trunc_classic:=proc(f,deg,xmin,xmax,n) local pe, repe, pt, ppe, rept, maxpt: pe:=numapprox[minimax]( f, x=xmin..xmax, [deg,0], 1, 'err'): pt := poly_exact2(pe,n): rept := numapprox[infnorm]( 1-pt/f, x=xmin..xmax) : maxpt := numapprox[infnorm]( pt, x=xmin..xmax) : pt,rept, maxpt: end proc: #--------------------------------------------------------------------- # Computes a truncated polynomial of degree deg with the two first coefficients stored as double-doubles. # The function f(x) must have as input interval xmin..xmax # returns [ truncated polynomial, relative error of trunc. poly. , infinite precision polynomial, rel. error of inf. prec. poly ] poly_trunc_f2d_2:=proc(f,deg,xmin,xmax) local pe, repe, pt, c0, c1, c2, ppe, abserr, relerr, maxpt, err: pe:=numapprox[minimax]( f, x=xmin..xmax, [deg,0], 1, 'err'): pt := poly_exact2(pe,2): c0:=coeff(pt,x,0): c1:=coeff(pt,x,1): c2:=coeff(pt,x,2): ppe:=numapprox[minimax]( (f - c0 - c1 * x - c2*x*x) , x=xmin..xmax, [deg,0], 1, 'err'): ppe:=expand(ppe) - coeff(ppe,x,0) - coeff(ppe,x,1)*x- coeff(ppe,x,2)*x*x: pt := poly_exact2(ppe,2) + c0 + c1*x + c2*x*x: abserr := numapprox[infnorm]( pt-f, x=xmin..xmax) : relerr := numapprox[infnorm]( 1-pt/f, x=xmin..xmax) : maxpt := numapprox[infnorm]( pt, x=xmin..xmax) : pt,abserr,relerr,maxpt: end proc: #--------------------------------------------------------------------- # Computes a truncated polynomial of degree deg with the first coefficient stored as double-double. # The function f(x) must have as input interval xmin..xmax # returns [ truncated polynomial, relative error of trunc. poly. , infinite precision polynomial, rel. error of inf. prec. poly ] poly_trunc_f2d_1:=proc(f,deg,xmin,xmax) local pe, repe, pt, c0, c1, ppe, relerr, abserr, maxpt, err: pe:=numapprox[minimax]( f , x=xmin..xmax, [deg,0], 1, 'err'): pt := poly_exact2(pe,1): c0:=coeff(pt,x,0): c1:=coeff(pt,x,1): ppe:=numapprox[minimax]( (f - c0 - c1 * x) , x=xmin..xmax, [deg,0], 1, 'err'): ppe:=ppe - coeff(ppe,x,0) - coeff(ppe,x,1)*x: pt := poly_exact2(ppe,1) + c0 + c1*x: abserr := numapprox[infnorm]( pt-f, x=xmin..xmax) : relerr := numapprox[infnorm]( 1-pt/f, x=xmin..xmax) : maxpt := numapprox[infnorm]( pt, x=xmin..xmax) : pt,abserr,relerr,maxpt: end proc: #--------------------------------------------------------------------- # compute_horner_rounding_error # Computes a bound on the accumulated rounding error caused by the Horner evaluation of a truncated polynomial # It is designed to allow evaluating the error for various schemes: # - with or without an error on x # - using SCS operators # - using double and double-double operators. # Arguments: # P is the polynomial. # xmax is the max value of |x|. # errors is a list of size n where n is the degree of the polynomial. # Each element of this list is a triple (epsx,epsmul,epsadd) where # epsx is the relative error on x at each step, # epsadd is the max relative error on the addition # epsmul is the max relative error on the multiplication. # This allows to handle SCS Horner, as well as evaluation starting in double and ending in double-double. # check_dd is a flag, if set to 1 the procedure also checks on the fly that the fast (test-free) versions # of the double-double addition can be used, i.e. that for all x, at each Horner step i computing ci+x*Si, # we have |ci|>|x*Si|. It prints warnings if it not the case. # returns (epsprimek, deltak, minP, maxP) where (see the doc) # epsprimek is the max rel error of the last multiplication (useful if the coeff of degree 0 is 0) # deltak is the max absolute error of the last addition (useful if the reconstruction adds something to result of the polynomial) # minP min of the evaluated polynomial (useful to compute a relative error out of deltak) # maxP max of the evaluated polynomial. compute_horner_rounding_error:=proc(poly, x, xmax, errors, check_dd) local deg, Sk, maxSk, minSk, epsaddk, epsmulk, deltaaddk, k, ck, epsx, epsmul, epsadd, deltaadd, Pk, maxPk: if assigned(x) then printf("Error in compute_horner_rounding_error, polynomial variable is assigned\n"): return 'procname(args)': fi: deg:=degree(poly,x): if(deg<0) then printf("ERROR: negative degree in compute_abs_rounding_error"): return 'procname(args)': fi: Sk:=coeff(poly, x, deg): maxSk:=abs(Sk): minSk:=maxSk: epsmulk:=0: deltaaddk:=0: epsaddk:=0: for k from (deg) to 1 by -1 do # the errors to consider for this step epsx := errors[k][1]: epsadd := errors[k][2]: epsmul := errors[k][3]: # multiplication operation Pk:= convert(Sk*x, polynom): maxPk:=numapprox[infnorm](Pk, x=-xmax..xmax): ck:=coeff(poly,x,k-1): epsmulk:=evalf( (1+epsx)*(1+epsaddk)*(1+epsmul)-1 + 10^(-Digits+2) ): #addition if(ck=0) then Sk:=Pk: maxSk := maxPk: minSk:=0: deltaaddk:= evalf(epsmulk*maxPk): epsaddk:=epsmulk: else Sk:=convert(Pk+ck , polynom): maxSk:=numapprox[infnorm](Sk, x=-xmax..xmax): minSk:=minimize(abs(Sk), x=-xmax..xmax): if(epsadd=2^(-53)) then # compute deltadd exactly as the max half ulp of the result deltaadd := 0.5*ulp(maxSk+epsmulk*maxSk): else # compute deltaadd out of the relative error deltaadd := epsadd * (maxSk+epsmulk*maxSk): fi: deltaaddk := evalf( epsmulk*maxPk + deltaadd + 10^(-Digits+2) ): epsaddk := deltaaddk/minSk + 10^(-Digits+2) : # warnings if (minSk=0) then printf("Warning! in compute_abs_rounding_error, minSk=0 at iteration %d, consider decreasing xmax\n",k): fi: fi: printf("step %d epsmulk=%1.4e deltaaddk=%1.4e minSk=%1.4e maxSk=%1.4e\n", k, epsmulk, deltaaddk, minSk, maxSk): # if (epsadd=2**(-103)) then # # fast Add22 ? # if abs(coeff(poly,x,k)) < xmax*maxSk # may be improved to xmax*Smax/2 # then printf("WARNING Add22 cannot be used at step %d, use Add22Cond\n" , k ): # printf(" coeff=%1.20e, xmax*Smax=%1.20e" , abs(coeff(poly,x,i)), xmax*maxSk ): # fi: # fi: od: return (epsmulk, deltaaddk, minSk, maxSk) end proc: #--------------------------------------------------------------------- # An helper function to build an errlist for the previous procedure. # Arguments: # n is the degree of the polynomial, # ddadd, ddmul number of (final) double-double operations # depsx error on x in the double steps # ddepsx error on x in the double-double steps (when x is represented by a double-double) errlist_quickphase_horner := proc(n,ddadd, ddmul,depsx, ddepsx) local nddadd, epsadd, nddmul, epsmul, epsx: if n=0 then [] else if ddadd>0 then nddadd:=ddadd-1: epsadd:=2**(-103): else nddadd:=ddadd: epsadd:=2**(-53): fi: if ddmul>0 then nddmul:=ddmul-1: epsmul:=2**(-102): epsx:=ddepsx: else nddmul:=ddmul: epsmul:=2**(-53): epsx:=depsx: fi: [ [epsx,epsadd,epsmul] , op(errlist_quickphase_horner(n-1, nddadd, nddmul, depsx,ddepsx))] fi: end proc: #--------------------------------------------------------------------- # Finding the worst cases for additive range reduction # cut and paste from the web page of Muller's book # Much faster if called with Digits very large and an evalf() on C # but then check WorstCaseForAdditiveRangeReduction:=proc(B,n,emin,emax,C) local epsilonmin,powerofBoverC,e,a,Plast,r,Qlast, Q,P,NewQ,NewP,epsilon, numbermin,expmin,l: epsilonmin := 12345.0 : powerofBoverC := B^(emin-n)/C: for e from emin-n+1 to emax-n+1 do powerofBoverC := B*powerofBoverC: a := floor(powerofBoverC): Plast := a: r := 1/(powerofBoverC-a): a := floor(r): Qlast := 1: Q := a: P := Plast*a+1: while Q < B^n-1 do r := 1/(r-a): a := floor(r): NewQ := Q*a+Qlast: NewP := P*a+Plast: Qlast := Q: Plast := P: Q := NewQ: P := NewP od: epsilon := evalf(C*abs(Plast-Qlast*powerofBoverC)): if epsilon < epsilonmin then epsilonmin := epsilon: numbermin := Qlast: expmin := e fi od: print('mantissa',numbermin): print('exponent',expmin): print('epsilon',epsilonmin): l := evalf(log(epsilonmin)/log(B),10): print(numberofdigits,l): (numbermin, expmin, epsilonmin) end proc: ##################################################################### # Stuff for SCS ##################################################################### # Global parameters # Dont forget to set all the parameters here SCS_NB_WORDS := 8: SCS_NB_BITS := 30: #--------------------------------------------------------------------- # This procedure convert a decimal number into it SCS representation. # x : input number to convert into it SCS representation real_to_SCS := proc(x) local exception, index, sgn, mantissa, nb, i: if x <> 0 then exception := 1: if x > 0 then sgn := 1: nb := x: elif x < 0 then sgn := -1: nb := -x: end if: index := 0: if nb >= 1 then for i from 0 while nb > (2^(SCS_NB_BITS+1)-1) do index := index+1: nb := nb * 2^(-SCS_NB_BITS): end do: else for i from 0 while nb < 1 do index := index-1: nb := nb * 2^(SCS_NB_BITS): end do: end if: for i from 0 by 1 to (SCS_NB_WORDS-1) do mantissa[i] := trunc(nb): nb := (nb - mantissa[i]) * 2^(SCS_NB_BITS): end do: else for i from 0 by 1 to (SCS_NB_WORDS-1) do mantissa[i] := 0: end do: index := 1: exception := x: sgn := 1: end if: mantissa[SCS_NB_WORDS] := exception: mantissa[SCS_NB_WORDS+1] := index: mantissa[SCS_NB_WORDS+2] := sgn: return mantissa: end proc: #--------------------------------------------------------------------- # Convert an SCS number into a rational number SCS_to_real := proc(tab) local res, i: if (tab[SCS_NB_WORDS] <> 1) then return tab[SCS_NB_WORDS]: end if: res := 0: for i from (SCS_NB_WORDS-1) by -1 while i>=0 do res := 2^(-SCS_NB_BITS)*res + tab[i] end do: res := tab[SCS_NB_WORDS+2]*(res * 2.^(SCS_NB_BITS * tab[SCS_NB_WORDS+1])): return res: end proc: #--------------------------------------------------------------------- # This procedure truncates the coefficients of a polynomial to SCS # numbers, so that we can then evaluate its approximation error # (equivalent to poly_exact for the doubles) poly_exact_SCS:=proc(P) local deg,i, coef, coef_t, Q: Q:= 0: convert(Q, polynom): deg:=degree(P,x): for i from 0 to deg do coef:=coeff(P,x,i): coef_t:=SCS_to_real(real_to_SCS(evalf(coef))): Q:= Q + coef_t*x^i: od: return(Q): end: #--------------------------------------------------------------------- # Write Into file fd the SCSS number stored into the table tab where # tab[0..(SCS_NB_WORDS-1)] store the mantissa # tab[SCS_NB_WORDS] store the exception # tab[SCS_NB_WORDS+1] store the index # tab[SCS_NB_WORDS+2] store the sign # You probably want to use WriteSCS below ! WriteSCS_from_table := proc(fd, tab) local i: fprintf(fd,"{{"): fprintf(fd,"0x%+0.8x, ", tab[0]): for i from 1 by 1 to (SCS_NB_WORDS-2) do fprintf(fd,"0x%+0.8x, ", tab[i]): if (i mod 4 = 3) then fprintf(fd,"\n"): fi: end do: fprintf(fd,"0x%+0.8x},\n", tab[SCS_NB_WORDS-1]): if (tab[SCS_NB_WORDS]=1) then fprintf(fd,"DB_ONE, %3d, %3d ", tab[SCS_NB_WORDS+1], tab[SCS_NB_WORDS+2]): else # the only other possible value is 0 so ... fprintf(fd,"{0x00000000, 0x00000000}, %3d, %3d ", tab[SCS_NB_WORDS+1], tab[SCS_NB_WORDS+2]): end if: fprintf(fd, "} \n"): end proc: #--------------------------------------------------------------------- # Write a real number as an SCS array to a file WriteSCS := proc (fd,x) WriteSCS_from_table(fd , real_to_SCS (x)): end: #--------------------------------------------------------------------- # A procedure to count the non-zero coefficients of a polynomial (to store it) get_nb_terms := proc(poly) local i, deg_poly: deg_poly := degree(poly): for i from deg_poly by -1 while i>=0 do if coeff(poly, x, i)=0 then deg_poly := deg_poly-1: end if: end do: return deg_poly: end proc: #--------------------------------------------------------------------- # Write a polynomial to an array of SCS coefficients # fd : file where to put the result # poly : input polynom # name : name of the array Write_SCS_poly := proc(fd, name, poly) local i, deg: #fclose(fd): try finally fprintf(fd,"static const scs %s [%d]=\n", name, get_nb_terms(poly)+1): deg := degree(poly): fprintf(fd,"/* ~%1.50e */ \n{", coeff(poly, x, deg)): WriteSCS(fd, coeff(poly, x, deg)): for i from (deg-1) by (-1) while i>=0 do if (coeff(poly, x, i)<>0) then fprintf(fd,",\n/* ~%1.50e */ \n", coeff(poly, x, i)): WriteSCS(fd, coeff(poly, x, i), 0): end if: end do: fprintf(fd,"};\n"): end try: end proc: interval-2.1.0/src/crlibm/maple/csh.mpl0000644000000000000000000004157413031036767016131 0ustar 00000000000000restart: Digits := 150; with (numapprox):with(orthopoly): interface(quiet=true); read "common-procedures.mpl"; mkdir("TEMPCSH"); ####################################################################### # Some values to go to the .testdata # What is the first value that rounds to nearest to +inf ? ieeehexa(arcsinh(hexa2ieee(["7fefffff","ffffffff"]))); # What is the first value that rounds to +inf to +inf ? ###################################################################### #First, some constants variables (used in the polynomial evaluations) n_double_ch := 11: # max degree for cosh's polynomial evaluation n_double_sh := 8: # max degree for sinh's polynomial evaluation b_max := 2**(-9.): # max absolute input for polynomial evaluation ###################################################################### #some constants ... inv_ln_2 := 1/ln(2.): ln2_hi := hexa2ieee(["3FE62E42", "FEFA3800"]): ln2_lo := nearest(ln(2.)-ln2_hi): two_43_44 := 2^43 + 2^44: bias := convert(op(2,ieeehexa(ln(2.)/2.+two_43_44)),'decimal','hex'): #to get maximum index for the second range reduction ... ###################################################################### #Bounds of our evaluation max_input_ch := arccosh(hexa2ieee(["7FEFFFFF","FFFFFFFF"])): k_max_ch := ceil(max_input_ch / ln(2)): max_input_sh := arcsinh(hexa2ieee(["7FEFFFFF","FFFFFFFF"])): k_max_sh := ceil(max_input_sh / ln(2)): #towards +inf, we have cosh(x) = sinh(x) since exp(-x) is too small #so, we are sure of k_max_sh == k_max_ch k_max := k_max_ch; ###################################################################### # When can we ignore exp(-x) in front of exp(x) in the first step ? # We want the same error as in the general case k_max_csh_approx_exp := 35: tempxmax:=(k_max_csh_approx_exp-1)*log(2): eps_csh_approx_exp := exp(-tempxmax)/exp(tempxmax): log2(%); # # When can we ignore exp(-x) in front of exp(x) in the second step ? # The worst case for exp for large arguments requires 115 bits k_max_csh_approx_exp_2 := 65: tempxmax:=(k_max_csh_approx_exp_2-1)*log(2): eps_csh_approx_exp_2 := exp(-tempxmax)/exp(tempxmax): log2(%); # 118 ###################################################################### #The Taylor polynoms poly_ch :=series(cosh(x),x,n_double_ch): poly_ch := convert(poly_ch,polynom)-1; poly_sh :=series(sinh(x),x,n_double_sh): poly_sh := (convert(poly_sh,polynom))/x-1; #################################################################### # secondary functions size_of_table := convert(op(2,ieeehexa(two_43_44+ln(2.)/2.)),decimal,hex); #returns the float which follow immediately the input next_float := proc(value) local hex1,hex2,hexcat,result; hex1:= op(1, value): hex2:= op(2, value): hexcat:= cat(hex1, hex2); result := convert(convert(convert(hexcat,decimal,hex)+1+2**64,hex),string); result := [substring(result,2..9), substring(result,10..18)]; end: #compute the errors done in tabulated values for cosh delta_table_cosh_func := proc() local result, i, value, temp, tmp, maxi; value := ieeehexa(two_43_44-ln(2.)/2.); result := 0; maxi := 0; for i from -size_of_table to size_of_table do tmp := cosh(hexa2ieee(value)-two_43_44): temp := nearest(tmp): result := max(result, abs(tmp - temp - nearest(tmp-temp))); maxi := max(maxi, abs(temp + nearest(tmp-temp))); value:=next_float(value): od: result,maxi; end: #compute the error done in tabulated values for sinh delta_table_sinh_func := proc() local result, i, value, temp, tmp, maxi; value := ieeehexa(two_43_44-ln(2.)/2.); result := 0; maxi := 0; for i from -size_of_table to size_of_table do tmp := sinh(hexa2ieee(value)-two_43_44): temp := nearest(tmp): result := max(result, abs(tmp - temp - nearest(tmp-temp))); maxi := max(maxi, abs(temp + nearest(tmp-temp))); value:=next_float(value): od: result,maxi; end: #return the error on x_hi * y_lo Mul11_Error := proc(x,err_x, y, err_y) (2^(-53) * y + err_y) * (err_x + 1/2*ulp(x)) + x * err_y; end: #return the error on (x_hi * y_hi)_lo + x_lo * y_hi + x_hi * y_lo Mul43_Error := proc(x,err_x, y, err_y) 1/2*ulp(3*2^(-53)* x * y) + 1/2*ulp(2*2^(-53) * x * y) + Mul11_Error(x, err_x, y, err_y) + Mul11_Error(y, err_y, x, err_x); end: cosh_0_35 := proc() local k, delta, maxi,epsilon, mini,cosh_0_35_max, delta_cosh_0_35: epsilon := 0; delta := 0: for k from -35 to -1 do delta_cosh_0_35 := 1/2*2^(-53)*ulp(1/(2^k)*(cosh_max + sinh_max)) + 1/(2^k)*(delta_sinh + delta_cosh): cosh_0_35_max := 1/(2^k)*(cosh_max + sinh_max): delta_cosh_0_35 := 1/2*2^(-53)*ulp(cosh_0_35_max + 2^k * sinh_max) + delta_cosh_0_35 + 2^k * delta_sinh: cosh_0_35_max := cosh_0_35_max + 2^k * sinh_max: delta_cosh_0_35 := 1/2*2^(-53)*ulp(cosh_0_35_max + 2^k * cosh_max) + delta_cosh_0_35 + 2^k * delta_cosh: cosh_0_35_max := cosh_0_35_max + 2^k * cosh_max: maxi := max(evalf(cosh((k-1/2)*ln(2))),evalf(cosh((k+1/2)*ln(2)))): mini := min(evalf(cosh((k-1/2)*ln(2))),evalf(cosh((k+1/2)*ln(2)))): epsilon := max(epsilon, delta_cosh_0_35/mini): delta := max(delta, delta_cosh_0_35): od; for k from 1 to 35 do delta_cosh_0_35 := 1/2*2^(-53)*ulp(1/(2^k)*(cosh_max + sinh_max)) + 1/(2^k)*(delta_sinh + delta_cosh): cosh_0_35_max := 1/(2^k)*(cosh_max + sinh_max): delta_cosh_0_35 := 1/2*2^(-53)*ulp(cosh_0_35_max + 2^k * sinh_max) + delta_cosh_0_35 + 2^k * delta_sinh: cosh_0_35_max := cosh_0_35_max + 2^k * sinh_max: delta_cosh_0_35 := 1/2*2^(-53)*ulp(cosh_0_35_max + 2^k * cosh_max) + delta_cosh_0_35 + 2^k * delta_cosh: cosh_0_35_max := cosh_0_35_max + 2^k * cosh_max: maxi := max(evalf(cosh((k-1/2)*ln(2))),evalf(cosh((k+1/2)*ln(2)))): mini := min(evalf(cosh((k-1/2)*ln(2))),evalf(cosh((k+1/2)*ln(2)))): epsilon := max(epsilon, delta_cosh_0_35/mini): delta := max(delta, delta_cosh_0_35): od; delta, epsilon; end: cosh_35_inf := proc() local k, delta, maxi,epsilon, mini,cosh_0_35_max, delta_cosh_0_35: epsilon := 0; delta := 0: for k from 35 to 1025 do delta_cosh_0_35 := 1/2*2^(-53)*ulp(2^k*(cosh_max + sinh_max)) + 2^k*(delta_sinh + delta_cosh) + 1/(2^k)*(cosh_max + sinh_max + delta_sinh + delta_cosh): cosh_0_35_max := 2^k*(cosh_max + sinh_max): maxi := max(evalf(cosh((k-1/2)*ln(2))),evalf(cosh((k+1/2)*ln(2)))): mini := min(evalf(cosh((k-1/2)*ln(2))),evalf(cosh((k+1/2)*ln(2)))): epsilon := max(epsilon, delta_cosh_0_35/mini): delta := max(delta, delta_cosh_0_35): od; delta, epsilon; end: ############################################################# ###################################################################### #now we can begin the proof ###################################################################### #first, we must compute the error created by the first range reduction # CODY and WAITE Argument reduction ln2 := ln(2.); invln2:= nearest(1/ln2); reminvln2 := evalf(1/ln2 - invln2); expln2:=ieeedouble(ln2)[2]: #get the exponent of ln2 in its IEEE representation bits_ln2_hi_0 := ceil(log2(k_max)); # 1/2 <= ln2/2^(expln2 + 1) < 1 ln2_hi := round(evalf(ln2 * 2^(52 - bits_ln2_hi_0 - expln2)))/2^(52 - bits_ln2_hi_0 - expln2);#this trick is used to get a truncated mantissa for ln2_hi #ln2_hi is a now exactly representable in the IEEE format and bits_ln2_hi_0 last bits of its mantissa are set to 0 #and bits_ln2_hi_0 is exactly the max number of bits to represent k #so the k * ln2_hi-product is exact :) ln2_lo:=nearest(ln2 - ln2_hi): # The error in this case (we need absolute error) delta_repr_ln2 := abs(ln2 - ln2_hi - ln2_lo); delta_round := evalf(1/2 * ulp(ln2_lo)); delta_cody_waite := k_max * (delta_repr_ln2 + delta_round); delta_b := delta_repr_ln2 + delta_round + delta_cody_waite; #we have 2 cases: # * k != 0 and we have an inexact range reduction # * k == 0 and we have no range reduction and then delta_range_reduc = 0 #the second range reduction is exact, so it doesn't introduce new error #after this second range reduction, we have a argument <= 2^(-9) #'mathematical' reductions: # x = k * ln(2) + y # y = a + b #'true' reductions: # x = k * (ln2_hi + ln2_lo) + (b_hi + b_lo) + table_index_float # with table_index_float = table_index * 2^(-8) #we'll use the following mathematical formulaes : #cosh(a + b) = cosh(a) * cosh(b) + sinh(a) * sinh(b) #sinh(a + b) = sinh(a) * cosh(b) + sinh(b) * cosh(a) #sinh(a) and cosh(a) are tabulated as double double # and we use Taylor series to compute approximations of the sums #computation of the absolute error in the tabulated values : delta_ca := delta_table_cosh_func()[1]; delta_sa := delta_table_sinh_func()[1]; ca_max := delta_table_cosh_func()[2]; sa_max := delta_table_sinh_func()[2]; #now we must compute the error done in polynomial evaluation #we use cosh(b) = 1 + sum(b^(2*k)/(2*k!), k > 0) # sinh(b) = b * (1 + sum(b^(2*k)/(2*k+1!), k > 0)) #both used polynoms are even (x, x^4, x^6, ...) and we can use this fact y_max := b_max ^ 2; delta_y := 1/2*ulp(y_max) + delta_b^2; # remove the first x and compute the polynomial of y = x poly_ch2 := subs(x=sqrt(y), expand(poly_ch)); poly_sh2 := subs(x=sqrt(y), expand(poly_sh)); errlist_cosh := errlist_quickphase_horner(degree(poly_ch2), 0, 0, 2^(-53), 2^(-70)): errlist_sinh := errlist_quickphase_horner(degree(poly_sh2), 0, 0, 2^(-53), 2^(-70)): #error between effective result and theorical polynomial result rounding_error_tcb := compute_horner_rounding_error(poly_ch2, y, y_max, errlist_cosh, true); rounding_error_tsb := compute_horner_rounding_error(poly_sh2, y, y_max, errlist_sinh, true); #error between therical polynomial result and cosh value approx_error_tcb := infnorm((cosh(x)-1-poly_ch)/(cosh(x)-1),x= -b_max..b_max); approx_error_tsb := infnorm((sinh(x)/x-1-poly_sh)/(sinh(x)/x-1),x= -b_max..b_max); delta_tcb := rounding_error_tcb[2] + approx_error_tcb; delta_tsb := rounding_error_tsb[2] + approx_error_tsb; tsb_max := rounding_error_tsb[4]; tcb_max := rounding_error_tcb[4]; #now we must do the first reconstruction, which correspond to cosh(a + b) = cosh(a) * cosh(b) + sinh(a) * sinh(b) #first case : sinh(a) = 0 = sa (= sa_hi + sa_lo in the C code) # cosh(a) = 1 = ca (= ca_hi + ca_lo in the C code) #there is no error on sa and caj delta_cosh0 := delta_tcb; cosh0_max := 1+tcb_max; delta_sinh0 := delta_b: sinh0_max := b_max: delta_sinh0 := delta_sinh0 + (tsb_max + delta_tsb)*(b_max + delta_b + 1/2*ulp(b_max)) - b_max * tsb_max + 1/2*ulp(sinh0_max + tsb_max*b_max): sinh0_max := sinh0_max + tsb_max*b_max: delta_sinh0 := delta_sinh0 + 2^(-53)*1/2*ulp(sinh0_max + tsb_max*b_max); sinh0_max := sinh0_max + tsb_max*b_max; #second case : sinh(a) <> 0 #there is a delta_table_cosh and delta_table_sinh absolute error on ca and sa. delta_cosh1 := delta_ca: cosh1_max := 2^(-53)*ca_max: delta_cosh1 := 1/2*ulp(cosh1_max + 3*2^(-53)*b_max * sa_max) + delta_cosh1 + Mul43_Error(b_max, delta_b, sa_max, delta_sa): cosh1_max := cosh1_max + 3 * 2^(-53) * b_max * sa_max: delta_cosh1 := 1/2*ulp(cosh1_max + b_max * sa_max * tsb_max) + delta_cosh1 + ((sa_max+1/2*ulp(sa_max)+delta_sa)*(b_max+ulp(b_max)+delta_b)*(tsb_max+delta_tsb)-tsb_max*sa_max*b_max): cosh1_max := cosh1_max + b_max * sa_max * tsb_max: delta_cosh1 := 1/2*ulp(cosh1_max + tcb_max*ca_max) + delta_cosh1 + ((ca_max + 1/2*ulp(ca_max) + delta_ca)*(tcb_max-delta_tcb)-ca_max*tcb_max): cosh11_max := cosh1_max + tcb_max*ca_max: delta_cosh1 := 1/2*ulp(cosh1_max + b_max * sa_max) + delta_cosh1: cosh11_max := cosh1_max + b_max * sa_max: delta_cosh1 := 1/2*2^(-53)*ulp(cosh1_max + ca_max) + delta_cosh1; cosh11_max := cosh1_max + ca_max; cosh_max := max(cosh0_max, cosh1_max); delta_cosh := max(delta_cosh0, delta_cosh1); delta_sinh1 := delta_sa: sinh1_max := 2^(-53)*sa_max: delta_sinh1 := 1/2*ulp(sinh1_max + 3*2^(-53)*ca_max * b_max) + delta_sinh1 + Mul43_Error(ca_max, delta_ca, b_max, delta_b): sinh1_max := sinh1_max + 3*2^(-53)*ca_max * b_max: delta_sinh1 := delta_sinh1 + 1/2*ulp(sinh1_max + sa_max * tcb_max): sinh1_max := sinh1_max + sa_max * tcb_max: delta_sinh1 := 1/2*ulp(sinh1_max + b_max * ca_max * tsb_max) + delta_sinh1 + ((ca_max+1/2*ulp(ca_max)+delta_ca)*(b_max+ulp(b_max)+delta_b)*(tsb_max+delta_tsb)-tsb_max*ca_max*b_max): sinh1_max := sinh1_max + b_max * sa_max * tsb_max: delta_sinh1 := delta_sinh1 + 1/2*2^(-53)*ulp(sinh1_max + b_max * ca_max): sinh1_max := sinh1_max + b_max * ca_max: delta_sinh1 := delta_sinh1 + 2^(-53)*1/2*ulp(sinh1_max + sa_max); sinh1_max := sinh1_max + sa_max; sinh_max := max(sinh1_max, sinh0_max); delta_sinh := max(delta_sinh0, delta_sinh1); #so we have the error done on cosh(y) and sinh(y) #now we must compute the error done on the last reconstruction #there are many cases #we begin by 0 < |k| < 35 epsilon_cosh_0_35 := cosh_0_35()[2]; #|k| > 35 epsilon_cosh_35_inf := cosh_35_inf()[2]; #rounding constant maxepsilon_csh := max(epsilon_cosh_35_inf, epsilon_cosh_0_35, delta_cosh): round_cst_csh := evalf(compute_rn_constant(maxepsilon_csh));; #################################################################################################" #now some functions used to build the .h header file. #################################################################################################" IEEE2db_number_BE := proc(ieee_number) local hex1, hex2, hexcat; hexcat=ieeehexa(ieee_number); hex1:= op(1, ieeehexa(ieee_number)): hex2:= op(2, ieeehexa(ieee_number)): cat(cat("{{0x"||hex1||",0x"||hex2||"}}; /*",sprintf("%.10e",ieee_number)),"*/ \n"); end: IEEE2db_number_LE := proc(ieee_number) local hex1, hex2, hexcat; hexcat=ieeehexa(ieee_number); hex1:= op(2, ieeehexa(ieee_number)): hex2:= op(1, ieeehexa(ieee_number)): cat(cat("{{0x"||hex1||",0x"||hex2||"}}; /*",sprintf("%.10e",ieee_number)),"*/ \n"); end: IEEE2db_number := proc(ieee_number, big_little) if (big_little = 1) then IEEE2db_number_BE(ieee_number): else IEEE2db_number_LE(ieee_number): fi; end: lo_part := proc(ieee_number) if (ieee_number <> 0) then ieee_number - nearest(ieee_number); else 0; end if; end: IEEE2db_db_number_sinh := proc(number,big_little) local hexstring1,hexstring2, hex1,hex2,hex3,hex4; hexstring1 := ieeehexa(number); hexstring2 := ieeehexa(lo_part(number)); if (big_little = 1) then hex1:= op(1, hexstring1): hex2:= op(2, hexstring1): hex3:= op(1, hexstring2): hex4:= op(2, hexstring2): else hex1:= op(2, hexstring1): hex2:= op(1, hexstring1): hex3:= op(2, hexstring2): hex4:= op(1, hexstring2): fi; " {{0x"||hex1||", 0x"||hex2||"}}, {{0x"||hex3||", 0x"||hex4||"}}},\n"; end: IEEE2db_db_number_cosh := proc(number,big_little) local hexstring1,hexstring2, hex1,hex2,hex3,hex4; hexstring1 := ieeehexa(number); hexstring2 := ieeehexa(lo_part(number)); if (big_little = 1) then hex1:= op(1, hexstring1): hex2:= op(2, hexstring1): hex3:= op(1, hexstring2): hex4:= op(2, hexstring2): else hex1:= op(2, hexstring1): hex2:= op(1, hexstring1): hex3:= op(2, hexstring2): hex4:= op(1, hexstring2): fi; " {{{0x"||hex1||", 0x"||hex2||"}}, {{0x"||hex3||", 0x"||hex4||"}},\n"; end: ##################################################################################### #now, we can produce the header file ! round_cst_cosh := 1.0020: round_cst_sinh := round_cst_cosh: filename := "TEMPCSH/csh_fast.h": fd := fopen(filename, WRITE, TEXT): fprintf(fd, "\n /* File generated by maple/csh.mpl */ \n"): fprintf(fd, "\n"): fprintf(fd, " static double maxepsilon_csh = %1.30e ;\n", maxepsilon_csh): fprintf(fd, " static double round_cst_csh = %1.30e ;\n", round_cst_csh): fprintf(fd, "\n"): fprintf(fd, "#ifdef WORDS_BIGENDIAN \n"): for big_little from 1 to 2 do if (big_little = 2) then fprintf(fd, "#else \n"): fi: fprintf(fd, cat( " static db_number const inv_ln_2 = ",IEEE2db_number(inv_ln_2,big_little))): fprintf(fd, cat( " static db_number const ln2_hi = ",IEEE2db_number(ln2_hi,big_little))): fprintf(fd, cat( " static db_number const ln2_lo = ",IEEE2db_number(ln2_lo,big_little))): fprintf(fd, cat( " static db_number const two_43_44 = ", IEEE2db_number(two_43_44,big_little))): fprintf(fd, cat( " static db_number const two_minus_30 = ", IEEE2db_number(2**(-40),big_little))): fprintf(fd, " static int const bias = %d ;\n", bias): fprintf(fd, "\n"); fprintf(fd,"/* some bounds */ \n"): fprintf(fd, cat( " static db_number const max_input_csh = ",IEEE2db_number(max_input_ch,big_little))): fprintf(fd, "\n"): fprintf(fd, cat(cat(" static const db_number cosh_sinh_table[",convert(2*size_of_table+1,string)),"][4] = { \n")); vvalue := ieeehexa(two_43_44-ln(2.)/2.); for i from -size_of_table to size_of_table do fprintf(fd, IEEE2db_db_number_cosh(cosh(hexa2ieee(vvalue)-two_43_44),big_little)); fprintf(fd, IEEE2db_db_number_sinh(sinh(hexa2ieee(vvalue)-two_43_44),big_little)); vvalue:=next_float(vvalue): od: fprintf(fd,"}; \n"); fprintf(fd,"/* the coefficients for the cosh-approximations */ \n"): for i from 1 to (n_double_ch/2) do fprintf(fd, cat(cat(cat( " static const db_number c",convert(2*(i-1),string))," = "),IEEE2db_number(coeff(poly_ch+1,x,2*(i-1)),big_little))): od: fprintf(fd,"/* the coefficients for the sinh-approximations */\n"): for i from 1 to (n_double_sh/2) do fprintf(fd, cat(cat(cat( " static const db_number s",convert(2*i-1,string))," = "),IEEE2db_number(coeff(poly_sh+1,x,2*(i-1)),big_little))): od: od: fprintf(fd, "#endif \n"): fclose(fd): interval-2.1.0/src/crlibm/maple/double-extended.mpl0000644000000000000000000000757613031036767020430 0ustar 00000000000000 #--------------------------------------------------------------------- # ieeedouble converts a number to IEEE double extended format. # returns sign (-1 or 1), exponent between -16383 and 16383, mantissa as a fraction between 0.5 and 1. # TODO : use JMM procedure; check subnormals etc ieeedoubleExt:=proc(xx) local x, sign, logabsx, exponent, mantissa, infmantissa; x:=evalf(xx): if (x=0) then sign,exponent,mantissa := 0,0,0; else if (x<0) then sign:=-1: else sign:=1: fi: exponent := floor(log2(sign*x)); if (exponent>16383) then mantissa:=infinity: exponent:=16383: elif (exponent< -16382) then # denorm exponent := -16383 fi: infmantissa := sign*x*2^(63-exponent); if frac(infmantissa) <> 0.5 then mantissa := round(infmantissa) else mantissa := floor(infmantissa); if type(mantissa,odd) then mantissa := mantissa+1 fi; fi; mantissa := mantissa*2^(-63); fi; sign,exponent,mantissa; end: nearestExt := proc(x) local sign, exponent, mantissa; sign, exponent, mantissa := ieeedoubleExt(x); sign*mantissa*2^(exponent); end: ieeehexaExt:= proc(x) local resultat, sign, exponent, mantissa, t; if(x=0) then resultat:=["0000","0000","0000","0000","0000"]; elif(x=-0) then resultat:=["8000","0000","0000","0000","0000"]; else sign,exponent,mantissa := ieeedoubleExt(x); t := 2**80 + (exponent+16383)*2^64 + mantissa*2^63; if (sign=-1) then t := t + 2**79; fi: t := convert(t, hex); t:=convert(t, string): resultat:=[substring(t, 2..5), substring(t, 6..9 ), substring(t, 10..13 ), substring(t, 14..17 ), substring(t, 18..21 )]; end if: resultat; end proc: printDoubleAsShort:=proc(x) local ss; ss:=ieeehexa(x); cat( "DOUBLE_HEX(", substring(ss[1], 1..4), ", " , substring(ss[1], 5..8), ", " , substring(ss[2], 1..4), ", " , substring(ss[2], 5..8)) ; end proc: printDoubleExtAsShort:=proc(x) local ss; ss:=ieeehexaExt(x); cat( "LDOUBLE_HEX(", ss[1], ", ", ss[2], ", ",ss[3], ", ", ss[4], ", ", ss[5], ")"); end proc: printDoubleAsULL:=proc(x) local ss; ss:=ieeehexa(x); cat( "ULL(", ss[1], ss[2], ")"); end proc: printDoubleAsHexInt:=proc(x) local ss; ss:=ieeehexa(x); cat(ss[1], ss[2]); end proc: #--------------------------------------------------------------------- # hi_lo takes an arbitrary precision number x and returns two doubles such that: # x ~ x_hi + x_lo hiloExt:= proc(x) local x_hi, x_lo, res: x_hi:= nearestExt(evalf(x)): res:=x-x_hi: if (res = 0) then x_lo:=0: else x_lo:=nearestExt(evalf(res)): end if; x_hi,x_lo; end: #--------------------------------------------------------------------- # Like poly_exact, but the n first coefficients are exactly representable as the sum of two doubles. # (to actually get the two doubles, use procedure hi_lo) polyExact2Ext:=proc(P,n) local deg,i, coef, coef_hi, coef_lo, Q: Q:= 0: convert(Q, polynom): deg:=degree(P,x): for i from 0 to deg do coef :=coeff(P,x,i): coef_hi, coef_lo:=hiloExt(coef): Q:= Q + coef_hi*x^i: if(i 0) then fprintf(fd,"#define %s%dh %1.50e\n",s,i,hi): end if: if (mi <> 0) then fprintf(fd,"#define %s%dm %1.50e\n",s,i,mi): end if: if (lo <> 0) then fprintf(fd,"#define %s%dl %1.50e\n",s,i,lo): end if: end if: end if: od: end proc: # First, we compute special values ReturnXBound := convert((ieeehexa(2^(-54)))[1],decimal,hex): Largest := 2^(1023) * ((2^(53) - 1) / 2^(52)): Smallest := 2^(-1023) * 1 * 2^(-51): OverflowBound := nearest(log(Largest + 1)): MinusOneBound := nearest(log(2^(-54))): SimpleOverflowBound := convert(ieeehexa(OverflowBound)[1],decimal,hex): DirectIntervalBound := convert((ieeehexa(0.25))[1],decimal,hex): MinusOnePlusOneUlp := -1 + 2^(-53): # Attention: it's 2^(-53) because we are at a binade boundary # Second, we have the computation of the values for the direct interval # The function, that we approximate is directF := unapply(exp(x) - 1,x): # The domain is directA := -2^(-5): directB := 2^(-5): # The polynomials are quickDirectpoly := X -> X+1/2*X^2+(3360682229480701/1180591620717411303424*X^6+3660136839517697/147573952589676412928*X^5+7320130809407439/36893488147419103232*X^4+3202559734508631/2305843009213693952*X^3+4803839602572223/576460752303423488*X^2+6004799503160665/144115188075855872*X+6004799503160661/36028797018963968)*X^3: accuDirectpoly := X -> X+1/2*X^2+(3786738884990361/4951760157141521099596496896*X^12+7100145222887513/618970019642690137449562112*X^11+6212541673969101/38685626227668133590597632*X^10+5047690109993399/2417851639229258349412352*X^9+3785767582868083/151115727451828646838272*X^8+5205430426443615/18889465931478580854784*X^7+29303968161043118891149009244865/10633823966279326983230456482242756608*X^6+65933928362347017505024866986963/2658455991569831745807614120560689152*X^5+65933928362347017505149159875899/332306998946228968225951765070086144*X^4+28846093658526820158502757550845/20769187434139310514121985316880384*X^3+21634570243895115118877068038417/2596148429267413814265248164610048*X^2+27043212804868893898596335048021/649037107316853453566312041152512*X+243583606221817153033947472119380503276473908509/1461501637330902918203684832716283019655932542976)*X^3: # Truncate the quick phase direct interval polynomial to degree specialDegree # for special interval |x| <= specialBound (speed-up) specialDegree := 5: specialBound := 2^(-12): specialPoly := unapply(sum(coeff(quickDirectpoly(x),x,i) * x^i,i=0..specialDegree),x): printf("Special polynomial is the direct polynomial truncated to degree %d used in |x| < 2^(%f)\n", specialDegree, evalf(log[2](specialBound))): # Compute the relative errors errDirectQuick := numapprox[infnorm](quickDirectpoly(x)/directF(x) -1,x=directA..directB): errDirectAccu := numapprox[infnorm](accuDirectpoly(x)/directF(x) -1,x=directA..directB): errSpecialPoly := numapprox[infnorm](specialPoly(x)/directF(x) -1,x=-specialBound..specialBound): errDirectAccuSpecial := numapprox[infnorm](accuDirectpoly(x)/directF(x) -1,x=2^(-12)..2^(-12)): printf("The relative approximation error of the direct interval quick polynomial is 2^(%f)\n", evalf(log[2](abs(errDirectQuick)))): printf("The relative approximation error of the direct interval accurate polynomial is 2^(%f)\n", evalf(log[2](abs(errDirectAccu)))): printf("The relative approximation error of the special interval special polynomial is 2^(%f)\n", evalf(log[2](abs(errSpecialPoly)))): printf("The relative approximation error of the direct interval accurate polynomial in special domain is 2^(%f)\n", evalf(log[2](abs(errDirectAccuSpecial)))): # Third, we have the computation of the values for the common interval # The function, that we approximate is commonF := unapply(exp(x),x): # The domain is commonA := -log(2)*2^(-12) * (1/2 + 2^(-19)): commonB := log(2)*2^(-12) * (1/2 + 2^(-19)): quickCommonpoly := X -> 1+X+1/2*X^2+(6004799504593679/144115188075855872*X+6004799504235425/36028797018963968)*X^3: accuCommonpoly := X -> 1+X+1/2*X^2+(3660068549402285/18446744073709551616*X^4+6405119471061623/4611686018427387904*X^3+4803839602528529/576460752303423488*X^2+54086425609737787796676993069745/1298074214633706907132624082305024*X+54086425609737787797192670135537/324518553658426726783156020576256)*X^3: # Compute the relative errors errCommonQuick := numapprox[infnorm](quickCommonpoly(x)/commonF(x) -1,x=commonA..commonB): errCommonAccu := numapprox[infnorm](accuCommonpoly(x)/commonF(x) -1,x=commonA..commonB): printf("The relative approximation error of the common interval quick polynomial is 2^(%f)\n", evalf(log[2](abs(errCommonQuick)))): printf("The relative approximation error of the common interval accurate polynomial is 2^(%f)\n", evalf(log[2](abs(errCommonAccu)))): epsilonApproxRmAccurate := numapprox[infnorm]( ((1+x)/(exp(x)))-1, x=commonA*2^(-52)..commonB*2^(-52)): epsilonApproxRlAccurate := numapprox[infnorm]( ((1+x)/(exp(x)))-1, x=commonA*2^(-105)..commonB*2^(-105)): printf("The approximation rel error for approximating exp(rm) by 1 + rm is 2^(%2f)\n", log2(abs(epsilonApproxRmAccurate))): printf("The approximation rel error for approximating exp(rl) by 1 + rl is 2^(%2f)\n", log2(abs(epsilonApproxRlAccurate))): # Compute the constants for argument reduction and the tables in the common path MsLog2Div2L := evalf(-log(2)/(2^(12))): msLog2Div2Lh, msLog2Div2Lm, msLog2Div2Ll := hi_mi_lo(MsLog2Div2L): epsMsLog2Div2L := evalf(abs(((msLog2Div2Lh + msLog2Div2Lm + msLog2Div2Ll) - MsLog2Div2L)/MsLog2Div2L)): epsDDMsLog2Div2L := evalf(abs(((msLog2Div2Lh + msLog2Div2Lm) - MsLog2Div2L)/MsLog2Div2L)): printf("The error made by storing MsLog2Div2L as a double-double is 2^(%f)\n",log[2](epsDDMsLog2Div2L)): printf("The error made by storing MsLog2Div2L as a triple-double is 2^(%f)\n",log[2](epsMsLog2Div2L)): gap := -floor(-log[2](abs(msLog2Div2Lm/msLog2Div2Lh))): printf("Information: |msLog2Div2Lm| <= 2^(%f) * |msLog2Div2Lh|\n",gap): log2InvMult2L := nearest(2^(12) / (log(2))): shiftConst := 2^(52) + 2^(51): indexmask1 := 2^((12)/2) - 1: indexmask2 := indexmask1 * 2^((12)/2): for i from 0 to 2^(12/2) - 1 do twoPowerIndex1hi[i], twoPowerIndex1mi[i], twoPowerIndex1lo[i] := hi_mi_lo(evalf(2^(i/(2^12)))): twoPowerIndex2hi[i], twoPowerIndex2mi[i], twoPowerIndex2lo[i] := hi_mi_lo(evalf(2^(i/(2^(12/2))))): od: # Estimate the error of the two quick phases # ATTENTION: C EST PIFOMETRIQUE POUR L INSTANT epsQuickDirectOverall := 2^(-62): epsQuickCommonOverall := 2^(-62): # Write the tables printf("Write tables...\n"): filename:="TEMPEXPM1/expm1.h": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "#include \"crlibm.h\"\n#include \"crlibm_private.h\"\n"): fprintf(fd, "\n/* File generated by maple/expm1.mpl */\n"): fprintf(fd, "\#define log2InvMult2L %1.50e\n",log2InvMult2L): fprintf(fd, "\#define msLog2Div2Lh %1.50e\n",msLog2Div2Lh): fprintf(fd, "\#define msLog2Div2Lm %1.50e\n",msLog2Div2Lm): fprintf(fd, "\#define msLog2Div2Ll %1.50e\n",msLog2Div2Ll): fprintf(fd, "\#define shiftConst %1.50e\n",shiftConst): fprintf(fd, "\#define INDEXMASK1 0x%08x\n",indexmask1): fprintf(fd, "\#define INDEXMASK2 0x%08x\n",indexmask2): fprintf(fd, "\#define RETURNXBOUND 0x%08x\n",ReturnXBound): fprintf(fd, "\#define OVERFLOWBOUND %1.50e\n",OverflowBound): fprintf(fd, "\#define LARGEST %1.50e\n",Largest): fprintf(fd, "\#define SMALLEST %1.50e\n",Smallest): fprintf(fd, "\#define MINUSONEBOUND %1.50e\n",MinusOneBound): fprintf(fd, "\#define SIMPLEOVERFLOWBOUND 0x%08x\n",SimpleOverflowBound): fprintf(fd, "\#define DIRECTINTERVALBOUND 0x%08x\n",DirectIntervalBound): fprintf(fd, "\#define SPECIALINTERVALBOUND 0x%08x\n",convert((ieeehexa(specialBound))[1],decimal,hex)): fprintf(fd, "\#define ROUNDCSTDIRECTRN %1.50e\n",compute_rn_constant(epsQuickDirectOverall)): fprintf(fd, "\#define ROUNDCSTDIRECTRD %1.50e\n",epsQuickDirectOverall): fprintf(fd, "\#define ROUNDCSTCOMMONRN %1.50e\n",compute_rn_constant(epsQuickCommonOverall)): fprintf(fd, "\#define ROUNDCSTCOMMONRD %1.50e\n",epsQuickCommonOverall): fprintf(fd, "\#define MINUSONEPLUSONEULP %1.50e\n",MinusOnePlusOneUlp): fprintf(fd,"\n\n"): printPolynomialIntoFile(fd,"quickDirectpolyC",quickDirectpoly): fprintf(fd,"\n"): printPolynomialIntoFile(fd,"accuDirectpolyC",accuDirectpoly): fprintf(fd,"\n"): printPolynomialIntoFile(fd,"quickCommonpolyC",quickCommonpoly): fprintf(fd,"\n"): printPolynomialIntoFile(fd,"accuCommonpolyC",accuCommonpoly): fprintf(fd,"\n\n"): # Print the tables fprintf(fd, "typedef struct tPi_t_tag {double hi; double mi; double lo;} tPi_t; \n"): fprintf(fd, "static const tPi_t twoPowerIndex1[%d] = {\n", 2^(12/2)): for i from 0 to 2^(12/2)-1 do fprintf(fd, " { \n"): fprintf(fd, " %1.50e, /* twoPowerIndex1hi[%d] */ \n", twoPowerIndex1hi[i], i): fprintf(fd, " %1.50e, /* twoPowerIndex1mi[%d] */ \n", twoPowerIndex1mi[i], i): fprintf(fd, " %1.50e, /* twoPowerIndex1lo[%d] */ \n", twoPowerIndex1lo[i], i): fprintf(fd, " } "): if(i<2^(12/2)-1) then fprintf(fd, ", \n"): fi od: fprintf(fd, "}; \n \n"): fprintf(fd, "static const tPi_t twoPowerIndex2[%d] = {\n", 2^(12/2)): for i from 0 to 2^(12/2)-1 do fprintf(fd, " { \n"): fprintf(fd, " %1.50e, /* twoPowerIndex2hi[%d] */ \n", twoPowerIndex2hi[i], i): fprintf(fd, " %1.50e, /* twoPowerIndex2mi[%d] */ \n", twoPowerIndex2mi[i], i): fprintf(fd, " %1.50e, /* twoPowerIndex2lo[%d] */ \n", twoPowerIndex2lo[i], i): fprintf(fd, " } "): if(i<2^(12/2)-1) then fprintf(fd, ", \n"): fi od: fprintf(fd, "}; \n \n"): fprintf(fd, "\n\n"): fclose(fd): printf(" ...done\n"):interval-2.1.0/src/crlibm/maple/gal.mpl0000644000000000000000000000320213031036767016101 0ustar 00000000000000Digits := 120: interface(quiet=true): read "common-procedures.mpl": read "triple-double.mpl": #--------------------------------------------------------------------- # Procedure gal computes a number x and a boolean such that # # if the boolean is true # - |x - xstart| is minimal # - x = roundX(x) (x is a floating point number in format roundX) # - |(roundY(f(x)) - f(x)) / f(x)| <= eps # # and the boolean is false if no such x could be found in iter iterations # # Limitations: # # - floating point numbers xp such that f(xp) = 0 are not considered # # Uses: # # - The successor function succX for floating point numbers roundX(t) gal:=proc(xstart,roundX,f,roundY,epsi,succX,iter) local xleft, xright, i, err, ima, d, x, eps, b; d := Digits; Digits := 120; eps := abs(epsi); xleft := roundX(xstart); xright := roundX(succX(roundX(xstart))); x := 0; i := 0; err := eps * 2; while ((err > eps) and (i < iter)) do i := i + 1; if (type(i,odd)) then x := xright; xright := evalf(roundX(succX(roundX(xright)))); else x := xleft; xleft := evalf(roundX(-succX(roundX(-xleft)))); end if; ima := evalf(f(x)); if (ima <> 0) then err := evalf(abs((ima - roundY(ima))/ima)); end if; end do; b := false; if (i < iter) then b := true; end if; Digits := d; (x,b); end proc: galDoubleToDouble:=proc(xstart,f,epsi,iter) local g,b,xn; (g,b) := gal(xstart,nearest,f,nearest,epsi,succDouble,iter); if (b) then xn := g; else xn = xstart; end if; xn; end proc: galDoubleToDoubleDouble:=proc(xstart,f,epsi,iter) local g,b,xn; (g,b) := gal(xstart,nearest,f,nearestDD,epsi,succDouble,iter); if (b) then xn := g; else xn = xstart; end if; xn; end proc: interval-2.1.0/src/crlibm/maple/log-de.mpl0000644000000000000000000003316013031036767016513 0ustar 00000000000000####################################################################### # This file is part of the crlibm library, and is distributed under # the LGPL. # To use: # restart; read "log-de.mpl"; #TODO output scripts for the Gappa proof out for Paterson/Stockmayer Digits := 100: interface(quiet=true): read "common-procedures.mpl": read "double-extended.mpl": mkdir("TEMPLOG"): log2h,log2l := hiloExt(log(2)): L := 7: # number of bits used to address the table MAXINDEX := round(2^L * (sqrt(2)-1)): for i from 0 to MAXINDEX-1 do center[i] := 1 + i*2^(-L): # center[i] in [1, 2[ # We want it to fit on 11 bits of mantissa r[i] := round(evalf( (1/center[i]) * 2^(11)) ) / 2^(11) ; od: for i from MAXINDEX to 2^L do # y has been divided by two, center[i] in [0.5, 1[ center[i]:=(1 + i*2^(-L)) / 2: # We want it to fit on 11 bits of mantissa, r[i] := round(evalf( (1/center[i]) * 2^(10)) ) / 2^(10) ; od: # Note that we go up to 2^L although the case 2^L is wrapped to zero # in the C code. It could be important for zmax (but it turns out not). for i from 0 to 2^L do (logirh[i], logirl[i]) := hiloExt(-log(r[i])): od: #Computation of ZMax. for i from 0 to MAXINDEX-1 do t_x := center[i] + 2^(-L-1) : zmax[i] := (t_x*r[i]-1) : t_x := center[i] - 2^(-L-1) : zmin[i] := (t_x*r[i]-1) : zabsmax[i] := max(abs(zmin[i]), abs(zmax[i])): od: for i from MAXINDEX to 2^L do t_x := center[i] + 2^(-L-2) : zmax[i] := (t_x*r[i]-1) : t_x := center[i] - 2^(-L-2) : zmin[i] := (t_x*r[i]-1) : zabsmax[i] := max(abs(zmin[i]), abs(zmax[i])): od: zmaxmax:=0: zminmin:=0: for i from 0 to 2^L do if zmax[i] > zmaxmax then zmaxmax := zmax[i]: fi: if zmin[i] < zminmin then zminmin := zmin[i]: fi: od: printf("zminmin = -2^(%2f) zmaxmax = 2^(%2f)\n", log2(-zminmin), log2(zmaxmax) ) : PolyDegreeQuick:=7: #Keep -zmaxmax..zmaxmax to keep c1=1, which is useful in the proof if(1+1=3) then # The polynomial used to be computed here, polyQuick:= polyExact2Ext(x * numapprox[minimax]( log(1+x)/x, x=-zmaxmax..zmaxmax, [PolyDegreeQuick-1,0], 1 , 'deltaApprox'), 0): epsilonApproxQuick := numapprox[infnorm]( 1-polyQuick/log(1+x), x=zminmin..zmaxmax): deltaApproxQuick := numapprox[infnorm]( polyQuick-log(1+x), x=zminmin..zmaxmax): else # magical polynomial given by Sylvain's tool polyQuick := x * (1 + (x * ((-0.50000000000000000000000000000000000000000000000000000000000000e0) + (x * (0.33333333333333342585191871876304503530263900756835937500000000e0 + (x * ((-0.24999999998423708125194764306797878816723823547363281250000000e0) + (x * (0.19999999996748479835773082413652446120977401733398437500000000e0 + (x * ((-0.16666957260954737285452154083031928166747093200683593750000000e0) + (x * 0.14286056338555042088955815415829420089721679687500000000000000e0)))))))))))): # validated infinite norms given by Christoph's tool epsilonApproxQuick := 2^(-64.119667587221): deltaApproxQuick := 2^(-72.230387592107): fi: printf(" rel approximation error for the quick phase is 2^(%2f)\n", log2(epsilonApproxQuick) ) : printf(" abs approximation error for the quick phase is 2^(%2f)\n", log2(deltaApproxQuick) ) : # For the Paterson/Stockmayer method polyQuick0:= x * numapprox[minimax]( log(1+x)/x, x=-zmaxmax..zmaxmax, [PolyDegreeQuick-1,0], 1 , 'deltaApprox'): ## Création des nouveaux coefficients polyQuick0:= x * numapprox[minimax]( log(1+x)/x, x=-zmaxmax..zmaxmax, [PolyDegreeQuick-1,0], 1 , 'deltaApprox'): ## Création des nouveaux coefficients a7 := convert(coeff(polyQuick0,x,7),rational): a6 := convert(coeff(polyQuick0,x,6)/a7,rational): a5 := convert(coeff(polyQuick0,x,5)/a7,rational): a4 := convert(coeff(polyQuick0,x,4)/a7,rational): a3 := convert(coeff(polyQuick0,x,3),rational): a2 := convert(coeff(polyQuick0,x,2),rational): a1 := convert(coeff(polyQuick0,x,1),rational): a0 := convert(coeff(polyQuick0,x,0),rational): alpha0 := a5 - 1: alpha1 := a6: alpha2 := a4 - alpha0 * a6: ## a7_hi,a7_lo := hiloExt(a7): a3_hi,a3_lo := hiloExt(a3): a2_hi,a2_lo := hiloExt(a2): a0_hi,a0_lo := hiloExt(a0): c_hi,c_lo := hiloExt(alpha0): alpha_hi,alpha_lo := hiloExt(alpha1): beta_hi,beta_lo := hiloExt(alpha2): #coef_c := c_hi + c_lo: #coef_alpha := alpha_hi + alpha_lo: #coef_beta := beta_hi + beta_lo: #coef_c7 := a7_hi + a7_lo: #coef_c3 := a3_hi + a3_lo: #coef_c2 := a2_hi + a2_lo: #coef_c0 := a0_hi + a0_lo: coef_c := c_hi: coef_alpha := alpha_hi: coef_beta := beta_hi: coef_c7 := a7_hi: coef_c3 := a3_hi: coef_c2 := a2_hi: coef_c0 := a0_hi: polyQuickPat := ((x^2 + coef_c)*(x + coef_alpha) + (x + coef_beta)) * (coef_c7*x^4) + ((coef_c3 * x + coef_c2)*x^2 + (x)): epsilonApproxQuickPat := numapprox[infnorm]( 1-polyQuickPat/log(1+x), x=zminmin..zmaxmax): printf(" approximation rel error for Paterson/Stockmayer in the quick phase is 2^(%2f)\n", log2(epsilonApproxQuickPat) ) : deltaApproxQuickPat := numapprox[infnorm]( polyQuickPat-log(1+x), x=zminmin..zmaxmax): printf(" approximation abs error for Paterson/Stockmayer in the quick phase is 2^(%2f)\n", log2(deltaApproxQuickPat) ) : PolyDegreeAccurate:=14: printf("Computing the polynomial for accurate phase (this may take some time...)\n"): pe:= x * numapprox[minimax]( log(1+x)/x, x=-zmaxmax..zmaxmax, [PolyDegreeAccurate-1,0], 1 , 'deltaApprox'): MaxDegreeDDE:=8: # polyAccurate := polyExact2Ext(pe, MaxDegreeDDE): deltaApproxAccurate := numapprox[infnorm](polyAccurate-log(1+x), x=-zmaxmax..zmaxmax): epsilonApproxAccurate := numapprox[infnorm]( 1-polyAccurate/log(1+x), x=-zmaxmax..zmaxmax): printf(" approximation error for the accurate phase is 2^(%2f)\n", log2(epsilonApproxAccurate) ) : filename:="TEMPLOG/log-de.h": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "/*File generated by maple/log-de.mpl*/\n\n"): # some constants fprintf(fd, "#define L %d\n", L): fprintf(fd, "#define MAXINDEX %d\n", MAXINDEX): fprintf(fd, "#define INDEXMASK %d\n", 2^L-1): fprintf(fd, "static const double two64 = %1.25e ;\n", evalf(2^64)): fprintf(fd, "#if 1\n#define ESTRIN\n#else\n#define PATERSON\n#endif\n"): fprintf(fd, "#if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)\n\n"): fprintf(fd, "#ifdef PATERSON\n"): # polynomial for quick phase fprintf(fd,"static const long double c7 = %1.50e;\n",coef_c7): fprintf(fd,"static const long double c3 = %1.50e;\n",coef_c3): fprintf(fd,"static const long double c2 = %1.50e;\n",coef_c2): fprintf(fd,"static const long double ps_alpha = %1.50e;\n",coef_alpha): fprintf(fd,"static const long double ps_beta = %1.50e;\n",coef_beta): fprintf(fd,"static const long double ps_c = %1.50e;\n",coef_c): fprintf(fd, "#endif/* PATERSON*/\n\n"): fprintf(fd, "#ifdef ESTRIN\n"): fprintf(fd, " /* Coefficients are read directly from the array thanks to the following macros */ \n"): for i from PolyDegreeQuick to 2 by -1 do fprintf(fd, "#define c%d c[%d]\n", i, PolyDegreeQuick-i): od: fprintf(fd, "static const double c[%d] = {\n",PolyDegreeQuick): for i from PolyDegreeQuick to 2 by -1 do fprintf(fd, " /* c%d = */ %1.50eL, \n", i, coeff(polyQuick,x,i)): od: fprintf(fd, "}; \n \n"): fprintf(fd, "#endif/* ESTRIN */\n\n"): for i from PolyDegreeAccurate to 1 by -1 do fprintf(fd, "#define c%dh ch[%d]\n", i, PolyDegreeAccurate-i): od: for i from MaxDegreeDDE-1 to 1 by -1 do fprintf(fd, "#define c%dl cl[%d]\n", i, MaxDegreeDDE-1-i): od: fprintf(fd, "#define PREFETCH_POLY_ACCURATE \n"): fprintf(fd, "\n#else /* not(defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)),\n assuming Itanium, otherwise we shouldn't be there */ \n\n"): fprintf(fd, "#define PREFETCH_POLY_QUICK "): for i from PolyDegreeQuick to 2 by -1 do fprintf(fd, "c%d=c[%d]; ", i, PolyDegreeQuick-i): od: fprintf(fd, "\n#define PREFETCH_POLY_ACCURATE "): for i from PolyDegreeAccurate to 1 by -1 do fprintf(fd, "c%dh=ch[%d]; ", i, PolyDegreeAccurate-i): if i mod 4 =0 then fprintf(fd, "\\\n "): fi: od: fprintf(fd, "\\\n "): for i from MaxDegreeDDE-1 to 1 by -1 do fprintf(fd, "c%dl=cl[%d]; ", i, MaxDegreeDDE-1-i): od: fprintf(fd, "\n#endif /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ \n\n"): # Various constants fprintf(fd, "static const long double log2H = %1.50eL ;\n", log2h): fprintf(fd, "static const long double log2L = %1.50eL ;\n", log2l): # The polynomials # polynomial for quick phase # for i from PolyDegreeQuick to 1 by -1 do # fprintf(fd, "static const long double c%d = %1.50eL ;\n", i, coeff(polyQuick,x,i)): # od: # polynomial for accurate phase fprintf(fd, "static const long double ch[%d] = {\n",PolyDegreeAccurate): for i from PolyDegreeAccurate to 1 by -1 do (ch, cl) := hiloExt(coeff(polyAccurate,x,i)): fprintf(fd, " /* ch%d = */ %1.50eL, \n", i, ch): od: fprintf(fd, "}; \n \n"): fprintf(fd, "static const long double cl[%d] = {\n", MaxDegreeDDE): for i from MaxDegreeDDE-1 to 1 by -1 do (ch, cl) := hiloExt(coeff(polyAccurate,x,i)): fprintf(fd, " /* cl%d = */ %1.50eL, \n", i, cl): od: fprintf(fd, "}; \n \n"): # The tables fprintf(fd, "typedef struct rri_tag {float r; long double logirh; long double logirl; } rri ; \n"): fprintf(fd, "static const rri argredtable[%d] = {\n", 2^L): for i from 0 to 2^L-1 do fprintf(fd, " { \n"): fprintf(fd, " %1.50eL, /* r[%d] */ \n", r[i], i): fprintf(fd, " %1.50eL, /* logirh[%d] */ \n", logirh[i], i): fprintf(fd, " %1.50eL, /* logirl[%d] */ \n", logirl[i], i): fprintf(fd, " } "): if(i<2^L-1) then fprintf(fd, ", \n"): fi od: fprintf(fd, "}; \n \n"): fclose(fd): printf("\n************ DONE TEMPLOG/log-de.h ************\n"); filename:="TEMPLOG/polynomials.sed": fd:=fopen(filename, WRITE, TEXT): for i from PolyDegreeAccurate to 1 by -1 do (ch, cl) := hiloExt(coeff(polyAccurate,x,i)): fprintf(fd, " s/_c%dh/%1.40e/g\n", i, ch): if(i&2\n"): fprintf(fd, "sed -f $CRLIBMDIR/maple/TEMPLOG/polynomials.sed -f $CRLIBMDIR/maple/TEMPLOG/log-de_0.sed $CRLIBMDIR/gappa/log-de/log-de-acc-index0-E0.gappa | $GAPPA \n"): fprintf(fd, "echo Accurate phase, case E!=0, index=0 1>&2\n"): fprintf(fd, "sed -f $CRLIBMDIR/maple/TEMPLOG/polynomials.sed -f $CRLIBMDIR/maple/TEMPLOG/log-de_0.sed $CRLIBMDIR/gappa/log-de/log-de-acc-index0-E1N.gappa | $GAPPA \n"): fprintf(fd, "for num in `seq 1 %d`; do\n", 2^L-1): fprintf(fd, " echo Accurate phase, case E=0, index=$num 1>&2\n"): fprintf(fd, " sed -f $CRLIBMDIR/maple/TEMPLOG/polynomials.sed -f $CRLIBMDIR/maple/TEMPLOG/log-de_$num.sed $CRLIBMDIR/gappa/log-de/log-de-acc-index1N-E0.gappa | $GAPPA \n"): fprintf(fd, " echo 1>&2\n"): fprintf(fd, "done\n"): fprintf(fd, "for num in `seq 1 %d`; do\n", 2^L-1): fprintf(fd, " echo Accurate phase, case E!=0, index = $num 1>&2 \n"): fprintf(fd, " sed -f $CRLIBMDIR/maple/TEMPLOG/polynomials.sed -f $CRLIBMDIR/maple/TEMPLOG/log-de_$num.sed $CRLIBMDIR/gappa/log-de/log-de-acc-index1N-E1N.gappa | $GAPPA \n"): fprintf(fd, " echo 1>&2\n"): fprintf(fd, "done\n\n"): fprintf(fd, "echo Quick phase, case E=0, index=0 1>&2\n"): fprintf(fd, "sed -f $CRLIBMDIR/maple/TEMPLOG/polynomials.sed -f $CRLIBMDIR/maple/TEMPLOG/log-de_0.sed $CRLIBMDIR/gappa/log-de/log-de-index0-E0.gappa | $GAPPA \n"): fprintf(fd, " echo 1>&2\n"): fprintf(fd, "echo Quick phase, case E!=0, index=0 1>&2 \n"): fprintf(fd, "sed -f $CRLIBMDIR/maple/TEMPLOG/polynomials.sed -f $CRLIBMDIR/maple/TEMPLOG/log-de_0.sed $CRLIBMDIR/gappa/log-de/log-de-index0-E1N.gappa | $GAPPA \n"): fprintf(fd, " echo 1>&2\n"): fprintf(fd, "for num in `seq 1 %d`; do\n", 2^L-1): fprintf(fd, " echo Quick phase, for all E, index=$num 1>&2\n"): fprintf(fd, " sed -f $CRLIBMDIR/maple/TEMPLOG/polynomials.sed -f $CRLIBMDIR/maple/TEMPLOG/log-de_$num.sed $CRLIBMDIR/gappa/log-de/log-de-index1N-E0N.gappa | $GAPPA \n"): fprintf(fd, " echo 1>&2\n"): fprintf(fd, "done\n"): fclose(fd): printf("\n************ DONE TEMPLOG/run-log-de-proof.sh ************\n"): printf("Now you should run \n"): printf(" sh ../../gappa/log-de/run-log-de-proof.sh 2> ../../maple/TEMPLOG/Gappa.out\n"): printf(" (You probably need to edit the path to the gappa executable within run-log-de-proof.sh)\n"): printf("Then look at TEMPLOG/Gappa.out. It shouldn't contain 'some enclosures were not satisfied'.\n If it does, report it !\n"): printf("----DONE---\n") : interval-2.1.0/src/crlibm/maple/log-de.patterson.mpl0000644000000000000000000002572213031036767020536 0ustar 00000000000000####################################################################### # This file is part of the crlibm library, and is distributed under # the LGPL. # To use: # restart; read "log-de.mpl"; Digits := 200: interface(quiet=true): read "common-procedures.mpl": read "double-extended.mpl": mkdir("PATERSON"): log2h,log2l := hiloExt(log(2)): L := 7: # number of bits used to address the table MAXINDEX := round(2^L * (sqrt(2)-1)): for i from 0 to MAXINDEX-1 do center[i] := 1 + i*2^(-L): # center[i] in [1, 2[ # We want it to fit on 11 bits of mantissa r[i] := round(evalf( (1/center[i]) * 2^(11)) ) / 2^(11) ; od: for i from MAXINDEX to 2^L do # y has been divided by two, center[i] in [0.5, 1[ center[i]:=(1 + i*2^(-L)) / 2: # We want it to fit on 11 bits of mantissa, r[i] := round(evalf( (1/center[i]) * 2^(10)) ) / 2^(10) ; od: # Note that we go up to 2^L although the case 2^L is wrapped to zero # in the C code. It could be important for zmax (but it turns out not). for i from 0 to 2^L do (logirh[i], logirl[i]) := hiloExt(-log(r[i])): od: #Computation of ZMax. for i from 0 to MAXINDEX-1 do t_x := center[i] + 2^(-L-1) : zmax[i] := (t_x*r[i]-1) : t_x := center[i] - 2^(-L-1) : zmin[i] := (t_x*r[i]-1) : zabsmax[i] := max(abs(zmin[i]), abs(zmax[i])): od: for i from MAXINDEX to 2^L do t_x := center[i] + 2^(-L-2) : zmax[i] := (t_x*r[i]-1) : t_x := center[i] - 2^(-L-2) : zmin[i] := (t_x*r[i]-1) : zabsmax[i] := max(abs(zmin[i]), abs(zmax[i])): od: zmaxmax:=0: zminmin:=0: for i from 0 to 2^L do if zmax[i] > zmaxmax then zmaxmax := zmax[i]: fi: if zmin[i] < zminmin then zminmin := zmin[i]: fi: od: printf("zminmin = -2^(%2f) zmaxmax = 2^(%2f)\n", log2(-zminmin), log2(zmaxmax) ) : PolyDegreeQuick:=7: #Keep -zmaxmax..zmaxmax to keep c1=1, which is useful in the proof ###### PHASE RAPIDE polyQuick0:= x * numapprox[minimax]( log(1+x)/x, x=-zmaxmax..zmaxmax, [PolyDegreeQuick-1,0], 1 , 'deltaApprox'): ## Création des nouveaux coefficients a7 := convert(coeff(polyQuick0,x,7),rational): a6 := convert(coeff(polyQuick0,x,6)/a7,rational): a5 := convert(coeff(polyQuick0,x,5)/a7,rational): a4 := convert(coeff(polyQuick0,x,4)/a7,rational): a3 := convert(coeff(polyQuick0,x,3),rational): a2 := convert(coeff(polyQuick0,x,2),rational): a1 := convert(coeff(polyQuick0,x,1),rational): a0 := convert(coeff(polyQuick0,x,0),rational): alpha0 := a5 - 1: alpha1 := a6: alpha2 := a4 - alpha0 * a6: ## a7_hi,a7_lo := hiloExt(a7): a3_hi,a3_lo := hiloExt(a3): a2_hi,a2_lo := hiloExt(a2): a0_hi,a0_lo := hiloExt(a0): c_hi,c_lo := hiloExt(alpha0): alpha_hi,alpha_lo := hiloExt(alpha1): beta_hi,beta_lo := hiloExt(alpha2): coef_c := c_hi + c_lo: coef_alpha := alpha_hi + alpha_lo: coef_beta := beta_hi + beta_lo: coef_c7 := a7_hi + a7_lo: coef_c3 := a3_hi + a3_lo: coef_c2 := a2_hi + a2_lo: coef_c0 := a0_hi + a0_lo: polyQuick := ((x^2 + coef_c)*(x + coef_alpha) + (x + coef_beta)) * (coef_c7*x^4) + ((coef_c3 * x + coef_c2)*x^2 + (x)): epsilonApproxQuick := numapprox[infnorm]( 1-polyQuick/log(1+x), x=zminmin..zmaxmax): printf(" approximation rel error for the quick phase is 2^(%2f)\n", log2(epsilonApproxQuick) ) : deltaApproxQuick := numapprox[infnorm]( polyQuick-log(1+x), x=zminmin..zmaxmax): printf(" approximation abs error for the quick phase is 2^(%2f)\n", log2(deltaApproxQuick) ) : ################################################################################################ PolyDegreeAccurate:=14: printf("Computing the polynomial for accurate phase (this may take some time...)\n"): pe:= x * numapprox[minimax]( log(1+x)/x, x=-zmaxmax..zmaxmax, [PolyDegreeAccurate-1,0], 1 , 'deltaApprox'): MaxDegreeDDE:=8: # polyAccurate := polyExact2Ext(pe, MaxDegreeDDE): deltaApproxAccurate := numapprox[infnorm](polyAccurate-log(1+x), x=-zmaxmax..zmaxmax): epsilonApproxAccurate := numapprox[infnorm]( 1-polyAccurate/log(1+x), x=-zmaxmax..zmaxmax): printf(" approximation error for the accurate phase is 2^(%2f)\n", log2(epsilonApproxAccurate) ) : filename:="PATERSON/log-de.h": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "/*File generated by maple/log-de.mpl*/\n\n"): fprintf(fd, "#if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)\n\n"): fprintf(fd, "#ifndef PATERSON\n#define PATERSON\n#endif\n"): for i from PolyDegreeAccurate to 1 by -1 do fprintf(fd, "#define c%dh ch[%d]\n", i, PolyDegreeAccurate-i): od: for i from MaxDegreeDDE-1 to 1 by -1 do fprintf(fd, "#define c%dl cl[%d]\n", i, MaxDegreeDDE-1-i): od: fprintf(fd, "#define PREFETCH_POLY_ACCURATE \n"): fprintf(fd, "\n#else /* not(defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)),\n assuming Itanium, otherwise we shouldn't be there */ \n\n"): fprintf(fd, "\n#define PREFETCH_POLY_ACCURATE "): for i from PolyDegreeAccurate to 1 by -1 do fprintf(fd, "c%dh=ch[%d]; ", i, PolyDegreeAccurate-i): if i mod 4 =0 then fprintf(fd, "\\\n "): fi: od: fprintf(fd, "\\\n "): for i from MaxDegreeDDE-1 to 1 by -1 do fprintf(fd, "c%dl=cl[%d]; ", i, MaxDegreeDDE-1-i): od: fprintf(fd, "\n#endif /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ \n\n"): # Various constants fprintf(fd, "#define L %d\n", L): fprintf(fd, "#define MAXINDEX %d\n", MAXINDEX): fprintf(fd, "#define INDEXMASK %d\n", 2^L-1): fprintf(fd, "static const long double log2h = %1.50eL ;\n", log2h): fprintf(fd, "static const long double log2l = %1.50eL ;\n", log2l): fprintf(fd, "static const long double two64 = %1.50eL ;\n", evalf(2^64)): # The polynomials # polynomial for quick phase fprintf(fd,"static const long double c7 = %1.50e;\n",coef_c7): fprintf(fd,"static const long double c3 = %1.50e;\n",coef_c3): fprintf(fd,"static const long double c2 = %1.50e;\n",coef_c2): fprintf(fd,"static const long double ps_alpha = %1.50e;\n",coef_alpha): fprintf(fd,"static const long double ps_beta = %1.50e;\n",coef_beta): fprintf(fd,"static const long double ps_c = %1.50e;\n",coef_c): # polynomial for accurate phase fprintf(fd, "static const long double ch[%d] = {\n",PolyDegreeAccurate): for i from PolyDegreeAccurate to 1 by -1 do (ch, cl) := hiloExt(coeff(polyAccurate,x,i)): fprintf(fd, " /* ch%d = */ %1.50eL, \n", i, ch): od: fprintf(fd, "}; \n \n"): fprintf(fd, "static const long double cl[%d] = {\n", MaxDegreeDDE): for i from MaxDegreeDDE-1 to 1 by -1 do (ch, cl) := hiloExt(coeff(polyAccurate,x,i)): fprintf(fd, " /* cl%d = */ %1.50eL, \n", i, cl): od: fprintf(fd, "}; \n \n"): # The tables fprintf(fd, "typedef struct rri_tag {float r; long double logirh; long double logirl; } rri ; \n"): fprintf(fd, "static const rri argredtable[%d] = {\n", 2^L): for i from 0 to 2^L-1 do fprintf(fd, " { \n"): fprintf(fd, " %1.50eL, /* r[%d] */ \n", r[i], i): fprintf(fd, " %1.50eL, /* logirh[%d] */ \n", logirh[i], i): fprintf(fd, " %1.50eL, /* logirl[%d] */ \n", logirl[i], i): fprintf(fd, " } "): if(i<2^L-1) then fprintf(fd, ", \n"): fi od: fprintf(fd, "}; \n \n"): fclose(fd): printf("\n************ DONE PATERSON/log-de.h ************\n"); filename:="PATERSON/polynomials.sed": fd:=fopen(filename, WRITE, TEXT): for i from PolyDegreeAccurate to 1 by -1 do (ch, cl) := hiloExt(coeff(polyAccurate,x,i)): fprintf(fd, " s/_c%dh/%1.40e/g\n", i, ch): if(i ../maple/PATERSON/Gappa.out\n"): printf(" (You probably need to edit the path to the gappa executable within run-log-de-proof.sh)\n"): printf("Then look at PATERSON/Gappa.out. It shouldn't contain 'some enclosures were not satisfied'.\n If it does, report it !\n"): printf("----DONE---\n") : interval-2.1.0/src/crlibm/maple/log-de2.mpl0000644000000000000000000001232713031036767016577 0ustar 00000000000000####################################################################### # To use: # restart; read "log.mpl"; Digits := 100: interface(quiet=true): read "common-procedures.mpl": read "double-extended.mpl": mkdir("TEMPLOG"): ln2h,ln2l := hiloExt(log(2)): L := 8: # number of bits used to address the table (imposed by frcpa) read"frcpa.mpl"; for i from 0 to 2^L-1 do (logirh[i], logirl[i]) := hiloExt(-log(r[i])): od: zmax:=2^(-8.886): # given by the doc of the frcpa minyfast:=(1-zmax)*(1+2^(-21)): # mult by 1+2^(-21) to ensure the bound computed below is valid MINYFAST:=ieeehexa(minyfast)[1]: maxyfast:=(1+zmax)*(1-2^(-21)): # mult by 1-2^(-21) to ensure the bound computed below is valid MAXYFAST:=ieeehexa(maxyfast)[1]: PolyDegreeAccurate:=13: printf("Computing the polynomial for accurate phase (this may take some time...)\n"): pe:= x * numapprox[minimax]( log(1+x)/x, x=-zmax..zmax, [PolyDegreeAccurate-1,0], 1 , 'delta_approx'): log2(delta_approx): # 123 bits MaxDegreeDDE:=8: # polyAccurate := polyExact2Ext(pe, MaxDegreeDDE): #delta_approx := numapprox[infnorm](polyAccurate-log(1+x), x=-zmax..zmax): epsilon_approx_accurate := numapprox[infnorm]( 1-polyAccurate/log(1+x), x=-zmax..zmax): printf(" approximation error for the accurate phase is 2^(%2f)\n", log2(epsilon_approx_accurate) ) : PolyDegreeQuick:=6: # On peut faire 6 pour les grands exposants. A voir if(1+1=3) then # Here we tried to use the polynomial from the accurate phase for the # quick one. This loses 7 bits of precision compared to a clean minimax, meaning # one degree more. Better do two polynomials. To investigate some day, # there must be a polynomial that does both. #truncated to PolyDegreeQuick and to DE. We use the fact that series(p)=p polyQuick := convert(series(polyExact2Ext(polyAccurate, 0), x=0, PolyDegreeQuick+1), polynom): #delta_approx := numapprox[infnorm](polyAccurate-log(1+x), x=-zmax..zmax): epsilon_approx := numapprox[infnorm]( 1-polyQuick/log(1+x), x=-zmax..zmax): printf(" approximation error for the quick phase is 2^(%2f)\n", log2(epsilon_approx) ) ; fi: polyQuick:= polyExact2Ext(x * numapprox[minimax]( log(1+x)/x, x=-zmax..zmax, [PolyDegreeQuick-1,0], 1 , 'delta_approx'), 0): epsilon_approx_quick := numapprox[infnorm]( 1-polyQuick/log(1+x), x=-zmax..zmax): printf(" approximation rel error for the quick phase is 2^(%2f)\n", log2(epsilon_approx_quick) ) : delta_approx_quick := numapprox[infnorm]( polyQuick-log(1+x), x=-zmax..zmax): printf(" approximation abs error for the quick phase is 2^(%2f)\n", log2(delta_approx_quick) ) : filename:="TEMPLOG/log-de2.h": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "/*File generated by maple/log-de2.mpl*/\n\n"): # Various constants fprintf(fd, "#define L %d\n", L): fprintf(fd, "static const long double ln2h = %1.50eL ;\n", ln2h): fprintf(fd, "static const long double ln2l = %1.50eL ;\n", ln2l): fprintf(fd, "static const long double two64 = %1.50eL ;\n", evalf(2^64)): fprintf(fd, "#define MINYFAST 0x%s\n", MINYFAST): fprintf(fd, "#define MAXYFAST 0x%s\n", MAXYFAST): # The polynomials # polynomial for quick phase # for i from PolyDegreeQuick to 1 by -1 do # fprintf(fd, "static const long double c%d = %1.50eL ;\n", i, coeff(polyQuick,x,i)): # od: fprintf(fd, "static const long double c[%d] = {\n",PolyDegreeQuick): for i from PolyDegreeQuick to 1 by -1 do fprintf(fd, " /* c[%d] = */ %1.50eL, \n", i, coeff(polyQuick,x,i)): od: fprintf(fd, "}; \n \n"): # polynomial for accurate phase for i from PolyDegreeAccurate to MaxDegreeDDE by -1 do fprintf(fd, "static const long double c%dh = %1.50eL ;\n", i, coeff(polyAccurate,x,i)): od: for i from MaxDegreeDDE-1 to 1 by -1 do (ch, cl) := hiloExt(coeff(polyAccurate,x,i)): fprintf(fd, "static const long double c%dh = %1.50eL ;\n", i, ch): fprintf(fd, "static const long double c%dl = %1.50eL ;\n", i, cl): od: # The tables fprintf(fd, "#if defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)\n"): fprintf(fd, "typedef struct dde_tag {long double h; float r; long double l; } dde ; \n"): fprintf(fd, "static const dde argredtable[%d] = {\n", 2^L): for i from 0 to 2^L-1 do fprintf(fd, " { \n"): fprintf(fd, " %1.50eL, /* logirh[%d] */ \n", logirh[i], i): fprintf(fd, " %1.10f, /* frcpa[%d] */ \n", r[i], i): fprintf(fd, " %1.50eL, /* logirl[%d] */ \n", logirl[i], i): fprintf(fd, " } "): if(i<2^L-1) then fprintf(fd, ", \n"): fi od: fprintf(fd, "}; \n \n"): fprintf(fd, "#else /* not(defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64)),\n assuming Itanium, otherwise we shouldn't be there */ \n"): fprintf(fd, "typedef struct dde_tag {long double h; long double l; } dde ; \n\n"): fprintf(fd, "static const dde argredtable[%d] = {\n", 2^L): for i from 0 to 2^L-1 do fprintf(fd, " { \n"): fprintf(fd, " %1.50eL, /* logirh[%d] */ \n", logirh[i], i): fprintf(fd, " %1.50eL, /* logirl[%d] */ \n", logirl[i], i): fprintf(fd, " } "): if(i<2^L-1) then fprintf(fd, ", \n"): fi od: fprintf(fd, "}; \n \n"): fprintf(fd, "#endif /* defined(CRLIBM_TYPECPU_X86) || defined(CRLIBM_TYPECPU_AMD64) */ \n"): fclose(fd): printf("----DONE---\n") : interval-2.1.0/src/crlibm/maple/log-itanium.mpl0000644000000000000000000001255613031036767017577 0ustar 00000000000000restart: Digits := 50: interface(quiet=true); read "double-extended.mpl"; read "common-procedures.mpl"; # This file is not finished and currently unused # ln(2) as a double-double-ext, with 10 free bits in the higher part # so that the multiplication by the exponent is exact # useless thanks to FMA, sigh ln2hi:= round( ln(2.) * (2**54)) / (2**54) ; r:=evalf(ln(2) - ln2hi): bits_log2hi:=1+log2(op(2,ieeedoubleExt(ln2hi)[3])); ln2lo:=nearestExt(ln(2.) - ln2hi); eps_ln2_cst:=abs( (ln2hi+ln2lo-ln(2.)) / ln(2.)): log2(eps_ln2_cst); # take bits from Aleksey's polynomial */ # Converting the real polynomial may allow to stop at degree 4 poly_aleksey:=polyExact2Ext(x - x^2/2 + x^3/3 -x^4/4 + x^5/5, 0); eps_approx := numapprox[infnorm](poly_aleksey/log(1+x) -1 , x=-2^(-13.72)..2^(-14.09)); log2(eps_approx); # Find a good polynomial for approximating log(1+x) - x + x^2/2 eps_frcpa:=2^(-8.8); # first try a Taylor series p:=convert(series(log(1+x), x=0, 8), polynom); eps_approx := numapprox[infnorm](p/log(1+x) -1 , x=-eps_frcpa..eps_frcpa); log2(eps_approx); # now for something more clever p:=numapprox[minimax](((log(1+x) -x)/x + x/2)/x, x=-eps_frcpa..eps_frcpa, [11,0], 1, 'err'); poly_exact := expand( ((p-coeff(p,x,0))*x - x/2)*x +x ); eps_approx := numapprox[infnorm](poly_exact/log(1+x) -1 , x=-eps_frcpa..eps_frcpa); log2(eps_approx); # we might win a degree here by being even more clever # OK so we have a polynomial of deg. 13, and only 7 to get 63 bits. # How many operations are required in DDE ? ddeops:=7; poly_accurate:=polyExact2Ext(poly_exact, ddeops); eps_approx := numapprox[infnorm](poly_accurate/log(1+x) -1 , x=-eps_frcpa..eps_frcpa); log2(eps_approx); e := 2^(-6.3): marge := 2^(-30); P19 := convert(series(arctan(x),x=0,20),polynom): P18 := (P19-x)/x; Q18 := polyExact2Ext(P18, 9); Q9 := -1/3 +1/5*x - 1/7*x^2 + 1/9*x^3 - 1/11*x^4 + 1/13*x^5 - 1/15*x^6 + 1/17*x^7- 1/19*x^8; Qprime := poly_exact( -x /3 + x^2/5 - x^3/7 + x^4 /9); #log2 (infnorm( (arctan(x)-x*(1+Q18))/x, x=0..e)); #function taken from the "old" coef_atan to compute interval parameters. maxx := bi -> simplify( solve( (x-bi) / (1+x*bi) = e ,x) ): minx := bi -> simplify(solve( (x-bi) /(1+x*bi)=-e ,x)): nextbi := proc (x) evalf( max(solve( minx(bi) = x ,bi) )*(1-marge)); end: allbi := proc (n) local xi,nbi,x,i,j; global b,a, nbofai, nbofbi, valuefordicho; x := e; nbi := 0; i := 0; while(i= 0) do nbi := nearest ( nextbi(x) ); b[i] := evalf( nbi ); a[i] := x; x := evalf(maxx(nbi)); i:=i+1; od; j:=0; while ( 2^j < i ) do j:=j+1 od: nbofai := i; nbofbi := i; b[i-1] := nearest(1/e+4): valuefordicho := 2^j; return i,b[0],b[i-1]; end: allbi(100); #------------- #----------------------- #quick error calc : #-----Reduction:------- XredEpsilon := 2^(-64) + 2^(-64) + 2^(-64) + 2^(-64): Xred2Epsilon := 2*XredEpsilon + 2^(-64); log[2.](Xred2Epsilon); errlist:=errlist_quickphase_horner(degree(Qprime),0,0,Xred2Epsilon, 2^(-64)); errorr := compute_horner_rounding_error(Qprime,x,e,errlist,true); qEpsilon := errorr[1]: log[2.](qEpsilon); deltaApprox := e^11/11: polyDelta := e^3*qEpsilon + 2^(-64)*e+ 3*2^(-64)*e^3: EpsilonFinal := polyDelta/arctan(e)+2*2^(-64)+deltaApprox/e: log[2.](EpsilonFinal); #------no reduction------- Errlist:=errlist_quickphase_horner(degree(Qprime),0,0,0, 2**(-64)): qEpsilon:= compute_horner_rounding_error(Qprime,x,e,errlist,true)[1]: deltaApprox := e^11/5: EpsilonFinalNoRed := infnorm( (qEpsilon.x^3+2^(-64).x+2^(-64).x^3)/arctan(x),x=2^(-27)..2^(-6) ) + deltaApprox + 2^(-64): log[2.](EpsilonFinalNoRed); #----------------------- # Output : doth:=proc() local filename, fd, i, hi, lo; filename := "TEMPLOG/log_ext.h": fd := fopen (filename,WRITE,TEXT): fprintf(fd,"/* file generated by log_itanium.mpl*/\n\n"): fprintf(fd,"#include \"double_ext.h\"\n"): fprintf(fd, "static const double HALFPI = %1.50e;\n", nearest(Pi/2)): fprintf(fd, "#define MIN_REDUCTION_NEEDED %s\n", printDoubleAsHexInt(e)): fprintf(fd,"#define A 0\n"): fprintf(fd,"#define B 1\n"): fprintf(fd,"#define ATAN_BHI 0\n"): fprintf(fd,"#define ATAN_BLO 1\n"): fprintf(fd,"#define epsilon %1.50e\n", EpsilonFinal): fprintf(fd,"#define epsilon_no_red %1.50e\n",EpsilonFinalNoRed): fprintf(fd,"#define TWO_M_64 %1.50e\n",2^(-64)): fprintf(fd,"#define TWO_10 %1.50e\n",2^10): fprintf(fd, "__declspec(align(16)) static const unsigned long long int ab_table[%d][2] = {\n", nbofai ); for i from 0 to nbofai - 1 do fprintf(fd, " { /*a[%d] ~= %1.20e */ ",i,a[i]): fprintf(fd, " %s,\n", printDoubleAsULL(a[i])); fprintf(fd, " /*b[%d] ~= %1.20e */ ",i,b[i]): fprintf(fd, " %s },\n", printDoubleAsULL(b[i])); od: fprintf(fd,"\n};\n"): fprintf(fd, "#define atanb_table ((const XC_FLOAT_TYPE *)_atanb_table)\n"); fprintf(fd, "__declspec(align(16)) static const unsigned short _atanb_table[] = {\n", nbofai ); for i from 0 to nbofai - 1 do fprintf(fd, " /*atan_b[%d] ~= %1.10e*/\n ",i, arctan(b[i])): hi:=nearestExt(arctan(b[i])); lo:=arctan(b[i])-nearestExt(arctan(b[i])); fprintf(fd, " %s, \n", printDoubleExtAsShort(hi)); fprintf(fd, " %s, \n", printDoubleExtAsShort(lo)); od: fprintf(fd,"};\n"): printPolyExt(fd,Q9,4,"coef_poly"): fclose(fd): end proc; doth(); interval-2.1.0/src/crlibm/maple/log-td.mpl0000644000000000000000000003156613031036767016542 0ustar 00000000000000####################################################################### # This file is part of the crlibm library, and is distributed under # the LGPL. # To use: # restart; read "log-de.mpl"; Digits := 120: interface(quiet=true): read "common-procedures.mpl": read "triple-double.mpl": mkdir("TEMPLOG"): # We want log2h + log2m + log2l + delta = log(2) such that # log2h and log2m have at least 11 trailing zeros # in order to have an exact multiplication with E, which is lower than 1024 in # magnitude # The resting accuracy is enough for both quick and accurate phases. log2acc := log(2): log2h := round(log2acc * 2**(floor(-log[2](abs(log2acc))) + (53 - 11))) / 2**(floor(-log[2](abs(log2acc))) + (53 - 11)): log2m := round((log2acc - log2h) * 2**(floor(-log[2](abs((log2acc - log2h)))) + (53 - 11))) / 2**(floor(-log[2](abs((log2acc - log2h)))) + (53 - 11)): log2l := log2acc - (log2h + log2m): L := 7: # number of bits used to address the table MAXINDEX := round(2^L * (sqrt(2)-1)): for i from 0 to MAXINDEX-1 do center[i] := 1 + i*2^(-L): # center[i] in [1, 2[ t := evalf(1/center[i]): r[i] := round(t * 2**(floor(-log[2](abs(t))) + 23)) / 2**(floor(-log[2](abs(t))) + 23): (logih[i], logim[i], logil[i]) := hi_mi_lo(evalf(-log(r[i]))): od: for i from MAXINDEX to 2^L do # y has been divided by two, center[i] in [0.5, 1[ center[i]:=(1 + i*2^(-L)) / 2: t := evalf(1/center[i]): r[i] := round(t * 2**(floor(-log[2](abs(t))) + 23)) / 2**(floor(-log[2](abs(t))) + 23): (logih[i], logim[i], logil[i]) := hi_mi_lo(evalf(-log(r[i]))): od: #Computation of ZMax. for i from 0 to MAXINDEX-1 do __x := center[i] + 2^(-L-1) : zmax[i] := (__x*r[i]-1) : __x := center[i] - 2^(-L-1) : zmin[i] := (__x*r[i]-1) : od: for i from MAXINDEX to 2^L do __x := center[i] + 2^(-L-2) : zmax[i] := (__x*r[i]-1) : __x := center[i] - 2^(-L-2) : zmin[i] := (__x*r[i]-1) : od: zmaxmax:=0: zminmin:=0: for i from 0 to 2^L do tabulated_value := logih[i] + logim[i] + logil[i]: poly_approx_min := evalf(log(1+zmin[i])): poly_approx_max := evalf(log(1+zmax[i])): # Test if we have a case where we cancellate a lot # i.e. the polynomial approximation value is greater than half the tabulated value # the tabulated value is not exactly zero and we are of opposite sign if ((abs(poly_approx_min) > 0.75*abs(tabulated_value)) and (tabulated_value <> 0.0) and (poly_approx_min * tabulated_value < 0)) then printf("Polynomial approximation is greater in magnitude in zmin[%d] than half the tabluated value\n",i): printf("The tabulated value is %1.50e\n",tabulated_value): if (tabulated_value <> 0.0) then printf("i.e. the value has the exponent %d\n",floor(log2(abs(tabulated_value)))) fi: printf("The value of polynomial in zmin[%d] is %1.50e\n",i,poly_approx_min): if (poly_approx_min <> 0.0) then printf("i.e. the value has the exponent %d\n",floor(log2(abs(poly_approx_min)))) fi: summe := poly_approx_min + tabulated_value: printf("The exponent of the sum of both is %d\n",floor(log2(abs(summe)))): fi: if ((abs(poly_approx_max) > 0.75*abs(tabulated_value)) and (tabulated_value <> 0.0) and (poly_approx_max * tabulated_value <0)) then printf("Polynomial approximation is greater in magnitude in zmax[%d] than half the tabluated value\n",i): printf("The tabulated value is %1.50e\n",tabulated_value): if (tabulated_value <> 0.0) then printf("i.e. the value has the exponent %d\n",floor(log2(abs(tabulated_value)))) fi: printf("The value of polynomial in zmax[%d] is %1.50e\n",i,poly_approx_max): if (poly_approx_max <> 0.0) then printf("i.e. the value has the exponent %d\n",floor(log2(abs(poly_approx_max)))) fi: summe := poly_approx_max + tabulated_value: printf("The exponent of the sum of both is %d\n",floor(log2(abs(summe)))): fi: if zmax[i] > zmaxmax then zmaxmax := zmax[i]: fi: if zmin[i] < zminmin then zminmin := zmin[i]: fi: od: printf("zminmin = -2^(%2f) zmaxmax = 2^(%2f)\n", log2(-zminmin), log2(zmaxmax) ) : PolyDegreeQuick:=7: printf(" degree of the polynomial used in the quick phase is %d\n",PolyDegreeQuick); DDNumberQuick:=3: printf(" number of double doubles used for the coefficients is %d\n",DDNumberQuick); #Keep -zmaxmax..zmaxmax to keep c1=1, which is useful in the proof #and constrain the first two coefficients to 1 and -1/2 in order to save up a full multiplication and a rounding error polyQuick:= poly_exact2(x*(1+x*(-0.5+x*(numapprox[minimax]((((log(1+x)/x)-1)/x+0.5)/x, x=-zmaxmax..zmaxmax, [PolyDegreeQuick-3,0], 1 , 'deltaApprox')))), DDNumberQuick): #Try to verify the bound for using double double arithmetic. #Idea: compare the maximum absolute value of the polynomial in zmaxmax (the polynomial has its maxima at the limits) #with the maximum value of the first term which is calculated in double precision only p := unapply(polyQuick,x): printf(" using only %d double doubles should be fine since the hi z ulp should affect the result starting from bit %f\n", DDNumberQuick,evalf(53 + log2(p(zmaxmax)) - log2(zmaxmax^(DDNumberQuick)),5)): epsilonApproxQuick := numapprox[infnorm]( 1-polyQuick/log(1+x), x=zminmin..zmaxmax): printf(" approximation rel error for the quick phase is 2^(%2f)\n", log2(epsilonApproxQuick) ) : deltaApproxQuick := numapprox[infnorm]( polyQuick-log(1+x), x=zminmin..zmaxmax): printf(" approximation abs error for the quick phase is 2^(%2f)\n", log2(deltaApproxQuick) ) : PolyDegreeAccurate:=14: printf(" degree of the polynomial used in the accurate phase is %d\n",PolyDegreeAccurate); DDNumberAccu:=7: TDNumberAccu:=3: printf(" number of triple doubles used for the coefficients is %d\n",TDNumberAccu); printf(" number of double doubles used for the coefficients is %d\n",DDNumberAccu); #Keep -zmaxmax..zmaxmax to keep c1=1, which is useful in the proof polyAccurate:= poly_exact32(x*(1+x*(-0.5+x*(numapprox[minimax]((((log(1+x)/x)-1)/x+0.5)/x, x=-zmaxmax..zmaxmax, [PolyDegreeAccurate-3,0], 1 , 'deltaApprox')))), TDNumberAccu, DDNumberAccu): #Try to verify the bound for using double double arithmetic. #Idea: compare the maximum absolute value of the polynomial in zmaxmax (the polynomial has its maxima at the limits) #with the maximum value of the first term which is calculated in double precision only pp := unapply(polyAccurate,x): printf(" using only %d triple doubles should be fine since the mi z ulp should affect the result starting from bit %f\n", TDNumberAccu,evalf(106 + log2(p(zmaxmax)) - log2(zmaxmax^(TDNumberAccu)),5)): printf(" using only %d double doubles should be fine since the hi z ulp should affect the result starting from bit %f\n", DDNumberAccu,evalf(53 + log2(p(zmaxmax)) - log2(zmaxmax^(TDNumberAccu + DDNumberAccu)),5)): epsilonApproxAccurate := numapprox[infnorm]( 1-polyAccurate/log(1+x), x=zminmin..zmaxmax): printf(" approximation rel error for the accurate phase is 2^(%2f)\n", log2(epsilonApproxAccurate) ) : deltaApproxAccurate := numapprox[infnorm]( polyAccurate-log(1+x), x=zminmin..zmaxmax): printf(" approximation abs error for the quick phase is 2^(%2f)\n", log2(deltaApproxAccurate) ) : #------------------------------------------------------------------- # Output filename:="TEMPLOG/log-td.h": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "#include \"crlibm.h\"\n#include \"crlibm_private.h\"\n"): fprintf(fd, "\n/*File generated by maple/log-td.mpl*/\n"): fprintf(fd, "\n\#define L %d\n\n",L): fprintf(fd, "\#define MAXINDEX %d\n\n", MAXINDEX): fprintf(fd, "\#define INDEXMASK %d\n", 2^L-1): fprintf(fd, "\#define two52 %1.50e\n", 2^(52)): fprintf(fd, "\#define log2h %1.50e\n", log2h): fprintf(fd, "\#define log2m %1.50e\n", log2m): fprintf(fd, "\#define log2l %1.50e\n", log2l): epsilon_quick_1 := 2^(-62.5): # The Gappa proof will show this bound epsilon_quick_2 := 2^(-62.5): # The Gappa proof will show this bound fprintf(fd, "\#define ROUNDCST1 %1.50e\n", compute_rn_constant(epsilon_quick_1)): fprintf(fd, "\#define ROUNDCST2 %1.50e\n", compute_rn_constant(epsilon_quick_2)): fprintf(fd, "\#define RDROUNDCST1 %1.50e\n", epsilon_quick_1): fprintf(fd, "\#define RDROUNDCST2 %1.50e\n", epsilon_quick_2): fprintf(fd, "\n\n"): # Print the defines for the define statements for i from 3 to PolyDegreeQuick do fprintf(fd, "\#define c%d %1.50e\n",i,coeff(polyQuick,x,i)): od: fprintf(fd, "\n\n"): for i from 3 to (DDNumberAccu + TDNumberAccu -1) do (hi,lo) := hi_lo(coeff(polyAccurate,x,i)): fprintf(fd, "\#define accPolyC%dh %1.50e\n",i,hi): fprintf(fd, "\#define accPolyC%dl %1.50e\n",i,lo): od: for i from (DDNumberAccu + TDNumberAccu) to PolyDegreeAccurate do fprintf(fd, "\#define accPolyC%d %1.50e\n",i,coeff(polyAccurate,x,i)): od: fprintf(fd, "\n\n"): # Print the table fprintf(fd, "typedef struct rri_tag {float ri; double logih; double logim; double logil;} rri; \n"): fprintf(fd, "static const rri argredtable[%d] = {\n", 2^L): for i from 0 to 2^L-1 do fprintf(fd, " { \n"): fprintf(fd, " %1.50e, /* r[%d] */ \n", r[i], i): fprintf(fd, " %1.50e, /* logih[%d] */ \n", logih[i], i): fprintf(fd, " %1.50e, /* logim[%d] */ \n", logim[i], i): fprintf(fd, " %1.50e, /* logil[%d] */ \n", logil[i], i): fprintf(fd, " } "): if(i<2^L-1) then fprintf(fd, ", \n"): fi od: fprintf(fd, "}; \n \n"): fclose(fd): for j from 0 to 2^L-1 do filename:=cat("TEMPLOG/log-td_",j,".sed"): fd:=fopen(filename, WRITE, TEXT): fprintf(fd, " s/_log2h/%1.50e/g\n", log2h): fprintf(fd, " s/_log2m/%1.50e/g\n", log2m): fprintf(fd, " s/_log2l/%1.50e/g\n", log2l): fprintf(fd, " s/_logih/%1.50e/g\n", logih[j]): fprintf(fd, " s/_logim/%1.50e/g\n", logim[j]): fprintf(fd, " s/_logil/%1.50e/g\n", logil[j]): fprintf(fd, " s/_zmin/%1.50e/g\n", zmin[j]): fprintf(fd, " s/_zmax/%1.50e/g\n", zmax[j]): for i from 3 to PolyDegreeQuick do fprintf(fd, " s/_c%d/%1.50e/g\n", i, coeff(polyQuick,x,i)): od: fprintf(fd, " s/_epsilonApproxQuick/%1.50e/g\n", epsilonApproxQuick): fclose(fd): od: for j from 0 to 2^L-1 do filename:=cat("TEMPLOG/log-td-accurate_",j,".sed"): fd:=fopen(filename, WRITE, TEXT): fprintf(fd, " s/_log2h/%1.50e/g\n", log2h): fprintf(fd, " s/_log2m/%1.50e/g\n", log2m): fprintf(fd, " s/_log2l/%1.50e/g\n", log2l): fprintf(fd, " s/_logih/%1.50e/g\n", logih[j]): fprintf(fd, " s/_logim/%1.50e/g\n", logim[j]): fprintf(fd, " s/_logil/%1.50e/g\n", logil[j]): fprintf(fd, " s/_zmin/%1.50e/g\n", zmin[j]): fprintf(fd, " s/_zmax/%1.50e/g\n", zmax[j]): for i from 3 to (DDNumberAccu + TDNumberAccu -1) do (hi,lo) := hi_lo(coeff(polyAccurate,x,i)): fprintf(fd, " s/_accPolyC%dh/%1.50e/g\n", i, hi): fprintf(fd, " s/_accPolyC%dl/%1.50e/g\n", i, lo): od: for i from (DDNumberAccu + TDNumberAccu) to PolyDegreeAccurate do fprintf(fd, " s/_accPolyC%d/%1.50e/g\n", i, coeff(polyAccurate,x,i)): od: fprintf(fd, " s/_epsilonApproxAccurate/%1.50e/g\n", epsilonApproxAccurate): fclose(fd): od: # A shell script to use them filename:="run-log-td-proof.sh": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "#!/bin/sh\n"): fprintf(fd, "# You probably need to edit the path to the gappa executable\n"): fprintf(fd, "GAPPA=~/sangria/gappa-0.4.7/src/gappa\n"): fprintf(fd, "# Test all the possible table value for E=1\n"): fprintf(fd, "for num in `seq 0 %d`; do\n", 2^L-1): fprintf(fd, " echo $num, E=1:\n"): fprintf(fd, " sed -f ./TEMPLOG/log-td_$num.sed log-td.gappa | $GAPPA > /dev/null\n"): fprintf(fd, " echo\n"): fprintf(fd, "done\n"): fprintf(fd, "# For the case E=0 we first handle the cases 0 and %d using log-td-E0-logir0.gappa\n", 2^L): fprintf(fd, "echo 0 and %d, E=0:\n", 2^L): fprintf(fd, "sed -f log-td_0.sed log-td-E0-logir0.gappa | $GAPPA > /dev/null\n"): fprintf(fd, "# then the other cases where logirh <> 0\n"): fprintf(fd, "for num in `seq 1 %d`; do\n", 2^L-1): fprintf(fd, " echo $num, E=0:\n"): fprintf(fd, " sed -f ./TEMPLOG/log-td_$num.sed log-td-E0.gappa | $GAPPA > /dev/null\n"): fprintf(fd, " echo\n"): fprintf(fd, "done\n"): fprintf(fd, "# Accurate phase: Test all the possible table value for E=1\n"): fprintf(fd, "for num in `seq 0 %d`; do\n", 2^L-1): fprintf(fd, " echo Accurate phase: $num, E=1:\n"): fprintf(fd, " sed -f ./TEMPLOG/log-td-accurate_$num.sed log-td-accurate.gappa | $GAPPA > /dev/null\n"): fprintf(fd, " echo\n"): fprintf(fd, "done\n"): fprintf(fd, "# Accurate phase: For the case E=0 we first handle the cases 0 and %d using log-td-accurate-E0-logir0.gappa\n", 2^L): fprintf(fd, "echo 0 and %d, E=0:\n", 2^L): fprintf(fd, "sed -f ./TEMPLOG/log-td-accurate_0.sed log-td-accurate-E0-logir0.gappa | $GAPPA > /dev/null\n"): fprintf(fd, "# Accurate phase: then the other cases where logirh <> 0\n"): fprintf(fd, "for num in `seq 1 %d`; do\n", 2^L-1): fprintf(fd, " echo $num, E=0:\n"): fprintf(fd, " sed -f ./TEMPLOG/log-td-accurate_$num.sed log-td-accurate-E0.gappa | $GAPPA > /dev/null\n"): fprintf(fd, " echo\n"): fprintf(fd, "done\n"): fclose(fd): printf("----DONE---\n") : interval-2.1.0/src/crlibm/maple/log.mpl0000644000000000000000000003016213031036767016124 0ustar 00000000000000####################################################################### # To use: # restart; read "log.mpl"; Digits := 100: interface(quiet=true): read "common-procedures.mpl": mkdir("TEMPLOG"): deg:=12: # Error, (in mkdir) directory exists and is not empty ####################################################################### # First, quick phase # Approach for the first function: # log(x) = E*log(2) + P(R) # where P(R) is defined over such an interval [11/16; 12/16] ... [21/16; 23/16] # At all, there is 8 intervals, corresponding to 8 polynomials. # Computation of log(2) as a double-double # We want to compute E.log(2) where |E|<1024, and get the result as a double-double. # We store two double constants ln2hi and ln2lo, such that ln2hi has at most 43 non-zero bits in its mantissa, # such that # ln2hi+ln2lo = log(2) (1+2**-101) (see below log2(eps_ln2_cst) ) # and the multiplication of ln2hi by E is exact. Then we use a Fast2Sum to compute E.log2 as a double-double. ln2hi:= round( ln(2.) * (2**43)) / (2**43) : r:=evalf(ln(2) - ln2hi): bits_log2hi:=1+log2(op(2,ieeedouble(ln2hi)[3])): ln2lo:=nearest(ln(2.) - ln2hi): eps_ln2_cst:=abs( (ln2hi+ln2lo-ln(2.)) / ln(2.)): log2(eps_ln2_cst): # Performance parameters # Try adding one or removing one to bitsFastPath. This value is optimal for the Pentium IV bitsFastPath:=7: #idem for MedPath. Look at the proof for explanations. bitsMedPath:=4: minFastPath:=(2^bitsFastPath)+0.5: # such that |Elog(2) + p(z)| > 2^bitsFastPath where |p(z)| < 0.4 EminFastPath:=floor(minFastPath/log(2)): # such that |E| > EminFastPath => |Elog(2) + p(z)| > 2^bitsFastPath evalf((EminFastPath+1)*log(2)-0.4): # just checking minMedPath:=(2^bitsMedPath)+0.5: # such that |Elog(2) + p(z)| > 2^bitsMedPath where |p(z)| < 0.4 EminMedPath:=floor(minMedPath/log(2)): # such that |E| > EminMedPath => |Elog(2) + p(z)| > 2^bitsMedPath evalf((EminMedPath+1)*log(2)-0.4): # just checking # Interval parameters ymin := (1-2^(-50)) * sqrt(2)/2: # sqrt(2)/2 with margin for the FP comparison and for the computation of xmax ymax := (1+2^(-50)) * sqrt(2): # sqrt(2)/2 with margin for the FP comparison and for the computation of xmax Ilist:=[[ymin,12/16],[12/16,13/16],[13/16,14/16],[14/16,15/16],[15/16,17/16],[17/16,19/16],[19/16,21/16],[21/16,ymax]]: Xmax:=[(12/16-ymin)/2, 2**(-5), 2**(-5), 2**(-5), 2**(-4), 2**(-4), 2**(-4), (ymax - 21/16)/2]: midI:=[nearest((ymin+12/16)/2), 25/32, 27/32, 29/32, 1,18/16, 20/16, nearest((21/16+ymax)/2)]: # Computation of the polynomials # This is the function we use on all the intervals poly_log_2 := proc(i,deg) local p, pe, e, pt, delta_approx, epsilon_approx, delta_rounding, minptr, err, maxptr, maxpt, epsilon, miny, epsilonZero, epsilonEgtMed, ptFastPath,epsilonFastPath, minptrFastPath, maxptrFastPath, errlist, epsilon_lastmult, maxEln2_lo, s1, p1, maxres, c0h, c0l, maxP_hi, maxP_lo,delta_rounding_s1,maxp1,delta_rounding_p1: printf("Interval %d : ", i): if(i=5) # special case around 1, we impose that coeff0 = 0 then pe:=x * numapprox[minimax]( (log(1+x)/x), x=-Xmax[i]..Xmax[i], [deg-1,0], 1 , 'delta_approx'): pt := poly_exact2(pe, 2): delta_approx := numapprox[infnorm](pt-log(1+x), x=-Xmax[i]..Xmax[i]): epsilon_approx := numapprox[infnorm]( 1-pt/log(1+x), x=-Xmax[i]..Xmax[i]): maxpt:= numapprox[infnorm]( pt, x=-Xmax[i]..Xmax[i]): else pt, delta_approx, epsilon_approx, maxpt := poly_trunc_f2d_2( log(x+midI[i]) , deg, -Xmax[i], Xmax[i] ): end if: printf(" delta_approx = %3.2f, epsilon_approx = %3.2f, maxpt = %3.2f\n", -log2(delta_approx), -log2(epsilon_approx), maxpt): #delta for E=0 errlist := errlist_quickphase_horner(deg, 2, 2, 0,0): # two dd adds, two dd mul, no error on x epsilon_lastmult, delta_rounding, minptr, maxptr := compute_horner_rounding_error(pt, x, Xmax[i], errlist, true): if i=5 then epsilonZero := (1+epsilon_approx) * (1 + epsilon_lastmult) - 1 : else epsilonZero := (delta_approx + delta_rounding)/minptr: fi: printf(" epsilonZero = %3.2f ", -log2(epsilonZero)): # For 0 maxepsilonEZero then maxepsilonEZero := epsilonEZero : fi : if epsilon > maxepsilon then maxepsilon := epsilon : fi : if epsilonEgtMed > maxepsilonEgtMed then maxepsilonEgtMed := epsilonEgtMed : fi : if epsilonFastPath > maxepsilonFastPath then maxepsilonFastPath := epsilonFastPath : fi : od: rncstEZero := evalf(compute_rn_constant(maxepsilonEZero)): rncst := evalf(compute_rn_constant(maxepsilon)): rncstEgtMed := evalf(compute_rn_constant(maxepsilonEgtMed)): rncstFastPath := evalf(compute_rn_constant(maxepsilonFastPath)): #------------------------------------------------------------------- # Output filename:="TEMPLOG/log_fast.h": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "#include \"crlibm.h\"\n#include \"crlibm_private.h\"\n"): fprintf(fd, "\n/*File generated by maple/log.mpl*/\n"): fprintf(fd, "\n\#define SQRT_2 1.4142135623730950489e0 \n\n"): fprintf(fd, "#define DEGREE %d\n\n", deg): fprintf(fd,"#define EMIN_MEDIUMPATH %4.3f \n",EminMedPath ): fprintf(fd,"#define EMIN_FASTPATH %4.3f \n",EminFastPath ): fprintf(fd,"/* Constants for rounding */\n"): fprintf(fd,"static const double epsilon[4] =\n{\n"): fprintf(fd," /* Case E=0 */\n"): fprintf(fd," %1.50e, \n",maxepsilonEZero): fprintf(fd," /* Middle case */\n"): fprintf(fd," %1.50e, \n",maxepsilon): fprintf(fd," /* Case E>EminMedPath */\n"): fprintf(fd," %1.50e, \n",maxepsilonEgtMed): fprintf(fd," /* And for the fast path */\n"): fprintf(fd," %1.50e \n",maxepsilonFastPath): fprintf(fd,"\n};\n\n"): fprintf(fd,"static const double rncst[4] =\n{\n"): fprintf(fd," /* Case E=0 */\n"): fprintf(fd," %1.50e, \n",rncstEZero): fprintf(fd," /* Middle case */\n"): fprintf(fd," %1.50e, \n",rncst): fprintf(fd," /* Case E>EminMedPath */\n"): fprintf(fd," %1.50e, \n",rncstEgtMed): fprintf(fd," /* And for the fast path */\n"): fprintf(fd," %1.50e \n",rncstFastPath): fprintf(fd,"};\n\n"): # THE POLYNOMIALS npol:=8: n:=2: # the degree from which we want two doubles fprintf(fd,"#ifdef WORDS_BIGENDIAN\n"): for isbig from 1 to 0 by -1 do if(isbig=0) then fprintf(fd,"#else\n"): fi: # Various constants fprintf(fd, "static const db_number ln2hi = "): printendian(fd,ln2hi,isbig): fprintf(fd, ";\n"): fprintf(fd, "static const db_number ln2lo = "): printendian(fd,ln2lo,isbig): fprintf(fd, ";\n"): fprintf(fd, "static const db_number two52 = "): printendian(fd, nearest(2.**52),isbig): fprintf(fd, ";\n"): # Write middle table fprintf(fd, "static const db_number middle[%d] =\n{\n",npol): for i from 1 to 7 do printendian(fd,midI[i],isbig): fprintf(fd," ,\n"): od: printendian(fd,midI[8],isbig): fprintf(fd, "\n};\n\n"): #Write Poly_h fprintf(fd,"static const db_number Poly_h[%d][%d] =\n{\n", npol, deg+1): for k from 1 to 8 do fprintf(fd," /* polynomial %d */\n",k): fprintf(fd,"{\n"): P:=PolyList[k][1]: for j from 0 to deg do coef:=hi_lo(coeff(P,x,j)): printendian(fd, coef[1], isbig): if j 0.75*abs(tabulated_value)) and (tabulated_value <> 0.0) and (poly_approx_min * tabulated_value < 0)) then printf("Polynomial approximation is greater in magnitude in zmin[%d] than half the tabluated value\n",i): printf("The tabulated value is %1.50e\n",tabulated_value): if (tabulated_value <> 0.0) then printf("i.e. the value has the exponent %d\n",floor(log2(abs(tabulated_value)))) fi: printf("The value of polynomial in zmin[%d] is %1.50e\n",i,poly_approx_min): if (poly_approx_min <> 0.0) then printf("i.e. the value has the exponent %d\n",floor(log2(abs(poly_approx_min)))) fi: summe := poly_approx_min + tabulated_value: printf("The exponent of the sum of both is %d\n",floor(log2(abs(summe)))): fi: if ((abs(poly_approx_max) > 0.75*abs(tabulated_value)) and (tabulated_value <> 0.0) and (poly_approx_max * tabulated_value <0)) then printf("Polynomial approximation is greater in magnitude in zmax[%d] than half the tabluated value\n",i): printf("The tabulated value is %1.50e\n",tabulated_value): if (tabulated_value <> 0.0) then printf("i.e. the value has the exponent %d\n",floor(log2(abs(tabulated_value)))) fi: printf("The value of polynomial in zmax[%d] is %1.50e\n",i,poly_approx_max): if (poly_approx_max <> 0.0) then printf("i.e. the value has the exponent %d\n",floor(log2(abs(poly_approx_max)))) fi: summe := poly_approx_max + tabulated_value: printf("The exponent of the sum of both is %d\n",floor(log2(abs(summe)))): fi: if zmax[i] > zmaxmax then zmaxmax := zmax[i]: fi: if zmin[i] < zminmin then zminmin := zmin[i]: fi: od: printf("zminmin = -2^(%2f) zmaxmax = 2^(%2f)\n", log2(-zminmin), log2(zmaxmax) ) : PolyDegreeQuick:=7: printf(" degree of the polynomial used in the quick phase is %d\n",PolyDegreeQuick); DDNumberQuick:=3: printf(" number of double doubles used for the coefficients is %d\n",DDNumberQuick); #Keep -zmaxmax..zmaxmax to keep c1=1, which is useful in the proof #and constrain the first two coefficients to 1 and -1/2 in order to save up a full multiplication and a rounding error polyQuick:= poly_exact2(x*(1+x*(-0.5+x*(numapprox[minimax]((((log(1+x)/x)-1)/x+0.5)/x, x=-zmaxmax..zmaxmax, [PolyDegreeQuick-3,0], 1 , 'deltaApprox')))), DDNumberQuick): #Try to verify the bound for using double double arithmetic. #Idea: compare the maximum absolute value of the polynomial in zmaxmax (the polynomial has its maxima at the limits) #with the maximum value of the first term which is calculated in double precision only p := unapply(polyQuick,x): printf(" using only %d double doubles should be fine since the hi z ulp should affect the result starting from bit %f\n", DDNumberQuick,evalf(53 + log2(p(zmaxmax)) - log2(zmaxmax^(DDNumberQuick)),5)): epsilonApproxQuick := numapprox[infnorm]( 1-polyQuick/log(1+x), x=zminmin..zmaxmax): printf(" approximation rel error for the quick phase is 2^(%2f)\n", log2(epsilonApproxQuick) ) : deltaApproxQuick := numapprox[infnorm]( polyQuick-log(1+x), x=zminmin..zmaxmax): printf(" approximation abs error for the quick phase is 2^(%2f)\n", log2(deltaApproxQuick) ) : PolyDegreeAccurate:=14: printf(" degree of the polynomial used in the accurate phase is %d\n",PolyDegreeAccurate); DDNumberAccu:=7: TDNumberAccu:=3: printf(" number of triple doubles used for the coefficients is %d\n",TDNumberAccu); printf(" number of double doubles used for the coefficients is %d\n",DDNumberAccu); #Keep -zmaxmax..zmaxmax to keep c1=1, which is useful in the proof polyAccurate:= poly_exact32(x*(1+x*(-0.5+x*(numapprox[minimax]((((log(1+x)/x)-1)/x+0.5)/x, x=-zmaxmax..zmaxmax, [PolyDegreeAccurate-3,0], 1 , 'deltaApprox')))), TDNumberAccu, DDNumberAccu): #Try to verify the bound for using double double arithmetic. #Idea: compare the maximum absolute value of the polynomial in zmaxmax (the polynomial has its maxima at the limits) #with the maximum value of the first term which is calculated in double precision only pp := unapply(polyAccurate,x): printf(" using only %d triple doubles should be fine since the mi z ulp should affect the result starting from bit %f\n", TDNumberAccu,evalf(106 + log2(p(zmaxmax)) - log2(zmaxmax^(TDNumberAccu)),5)): printf(" using only %d double doubles should be fine since the hi z ulp should affect the result starting from bit %f\n", DDNumberAccu,evalf(53 + log2(p(zmaxmax)) - log2(zmaxmax^(TDNumberAccu + DDNumberAccu)),5)): epsilonApproxAccurate := numapprox[infnorm]( 1-polyAccurate/log(1+x), x=zminmin..zmaxmax): printf(" approximation rel error for the accurate phase is 2^(%2f)\n", log2(epsilonApproxAccurate) ) : deltaApproxAccurate := numapprox[infnorm]( polyAccurate-log(1+x), x=zminmin..zmaxmax): printf(" approximation abs error for the quick phase is 2^(%2f)\n", log2(deltaApproxAccurate) ) : #Compute now the inverse of ln(10) for the final multiplication of ln(x) with this constant for obtaining log10(x) #Compute also the relative error of the constant stored as a triple double. Log10inv := evalf(1 / log(10)): (log10invh, log10invm, log10invl) := hi_mi_lo(Log10inv): Log10invhml := log10invh + log10invm + log10invl: epsilonLog10invhml := evalf(abs((Log10invhml - Log10inv) / Log10inv)): printf(" Log10inv = 1 / ln(10) stored as a triple-double is exact with a relative error of 2^(%2f)\n", evalf(log[2](epsilonLog10invhml))): #Compute now the constant needed for the unfiltered directed final rounding of the triple-double result #This constant is supposed to be the reciprocal of the critical accuracy of the function. #We suppose this critical accuracy to be 2^(-120) because the worst case (for RD) we know of is x = 403ce41d 8fa665fa #We can easily spend some guard bits since we want simply filter out cases with a theoretical worst case accuracy #of -infty (exact floating point images) and as we know that we are exact to at least 122 bits. wca := 2^(122): #------------------------------------------------------------------- # Output filename:="TEMPLOG/log10-td.h": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "#include \"crlibm.h\"\n#include \"crlibm_private.h\"\n"): fprintf(fd, "\n/*File generated by maple/log10-td.mpl*/\n"): fprintf(fd, "\n\#define L %d\n\n",L): fprintf(fd, "\#define MAXINDEX %d\n\n", MAXINDEX): fprintf(fd, "\#define INDEXMASK %d\n", 2^L-1): fprintf(fd, "\#define two52 %1.50e\n", 2^(52)): fprintf(fd, "\#define log2h %1.50e\n", log2h): fprintf(fd, "\#define log2m %1.50e\n", log2m): fprintf(fd, "\#define log2l %1.50e\n", log2l): fprintf(fd, "\#define log10invh %1.50e\n",log10invh): fprintf(fd, "\#define log10invm %1.50e\n",log10invm): fprintf(fd, "\#define log10invl %1.50e\n",log10invl): fprintf(fd, "\#define WORSTCASEACCURACY %1.50e\n",wca): epsilon_quick_1 := 2^(-61): # The Gappa proof will show this bound epsilon_quick_2 := 2^(-61): # The Gappa proof will show this bound fprintf(fd, "\#define ROUNDCST1 %1.50e\n", compute_rn_constant(epsilon_quick_1)): fprintf(fd, "\#define ROUNDCST2 %1.50e\n", compute_rn_constant(epsilon_quick_2)): fprintf(fd, "\#define RDROUNDCST1 %1.50e\n", epsilon_quick_1): fprintf(fd, "\#define RDROUNDCST2 %1.50e\n", epsilon_quick_2): fprintf(fd, "\n\n"): # Print the defines for the define statements for i from 3 to PolyDegreeQuick do fprintf(fd, "\#define c%d %1.50e\n",i,coeff(polyQuick,x,i)): od: fprintf(fd, "\n\n"): for i from 3 to (DDNumberAccu + TDNumberAccu -1) do (hi,lo) := hi_lo(coeff(polyAccurate,x,i)): fprintf(fd, "\#define accPolyC%dh %1.50e\n",i,hi): fprintf(fd, "\#define accPolyC%dl %1.50e\n",i,lo): od: for i from (DDNumberAccu + TDNumberAccu) to PolyDegreeAccurate do fprintf(fd, "\#define accPolyC%d %1.50e\n",i,coeff(polyAccurate,x,i)): od: fprintf(fd, "\n\n"): # Print the table fprintf(fd, "typedef struct rri_tag {float ri; double logih; double logim; double logil;} rri; \n"): fprintf(fd, "static const rri argredtable[%d] = {\n", 2^L): for i from 0 to 2^L-1 do fprintf(fd, " { \n"): fprintf(fd, " %1.50e, /* r[%d] */ \n", r[i], i): fprintf(fd, " %1.50e, /* logih[%d] */ \n", logih[i], i): fprintf(fd, " %1.50e, /* logim[%d] */ \n", logim[i], i): fprintf(fd, " %1.50e, /* logil[%d] */ \n", logil[i], i): fprintf(fd, " } "): if(i<2^L-1) then fprintf(fd, ", \n"): fi od: fprintf(fd, "}; \n \n"): fclose(fd): for j from 0 to 2^L-1 do filename:=cat("TEMPLOG/log10-td_",j,".sed"): fd:=fopen(filename, WRITE, TEXT): fprintf(fd, " s/_log2h/%1.50e/g\n", log2h): fprintf(fd, " s/_log2m/%1.50e/g\n", log2m): fprintf(fd, " s/_log2l/%1.50e/g\n", log2l): fprintf(fd, " s/_logih/%1.50e/g\n", logih[j]): fprintf(fd, " s/_logim/%1.50e/g\n", logim[j]): fprintf(fd, " s/_logil/%1.50e/g\n", logil[j]): fprintf(fd, " s/_zmin/%1.50e/g\n", zmin[j]): fprintf(fd, " s/_zmax/%1.50e/g\n", zmax[j]): for i from 3 to PolyDegreeQuick do fprintf(fd, " s/_c%d/%1.50e/g\n", i, coeff(polyQuick,x,i)): od: fprintf(fd, " s/_epsilonApproxQuick/%1.50e/g\n", epsilonApproxQuick): fprintf(fd, " s/_epsilonLog10invhml/%1.50e/g\n", epsilonLog10invhml): fclose(fd): od: for j from 0 to 2^L-1 do filename:=cat("TEMPLOG/log10-td-accurate_",j,".sed"): fd:=fopen(filename, WRITE, TEXT): fprintf(fd, " s/_log2h/%1.50e/g\n", log2h): fprintf(fd, " s/_log2m/%1.50e/g\n", log2m): fprintf(fd, " s/_log2l/%1.50e/g\n", log2l): fprintf(fd, " s/_logih/%1.50e/g\n", logih[j]): fprintf(fd, " s/_logim/%1.50e/g\n", logim[j]): fprintf(fd, " s/_logil/%1.50e/g\n", logil[j]): fprintf(fd, " s/_zmin/%1.50e/g\n", zmin[j]): fprintf(fd, " s/_zmax/%1.50e/g\n", zmax[j]): for i from 3 to (DDNumberAccu + TDNumberAccu -1) do (hi,lo) := hi_lo(coeff(polyAccurate,x,i)): fprintf(fd, " s/_accPolyC%dh/%1.50e/g\n", i, hi): fprintf(fd, " s/_accPolyC%dl/%1.50e/g\n", i, lo): od: for i from (DDNumberAccu + TDNumberAccu) to PolyDegreeAccurate do fprintf(fd, " s/_accPolyC%d/%1.50e/g\n", i, coeff(polyAccurate,x,i)): od: fprintf(fd, " s/_epsilonApproxAccurate/%1.50e/g\n", epsilonApproxAccurate): fprintf(fd, " s/_epsilonLog10invhml/%1.50e/g\n", epsilonLog10invhml): fclose(fd): od: # A shell script to use them filename:="run-log10-td-proof.sh": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "#!/bin/sh\n"): fprintf(fd, "# You probably need to edit the path to the gappa executable\n"): fprintf(fd, "GAPPA=~/ble/gappa-0.4.5/src/gappa\n"): fprintf(fd, "# Test all the possible table value for E=1\n"): fprintf(fd, "for num in `seq 0 %d`; do\n", 2^L-1): fprintf(fd, " echo $num, E=1:\n"): fprintf(fd, " sed -f ./TEMPLOG/log10-td_$num.sed log10-td.gappa | $GAPPA > /dev/null\n"): fprintf(fd, " echo\n"): fprintf(fd, "done\n"): fprintf(fd, "# For the case E=0 we first handle the cases 0 and %d using log10-td-E0-logir0.gappa\n", 2^L): fprintf(fd, "echo 0 and %d, E=0:\n", 2^L): fprintf(fd, "sed -f log10-td_0.sed log10-td-E0-logir0.gappa | $GAPPA > /dev/null\n"): fprintf(fd, "# then the other cases where logirh <> 0\n"): fprintf(fd, "for num in `seq 1 %d`; do\n", 2^L-1): fprintf(fd, " echo $num, E=0:\n"): fprintf(fd, " sed -f ./TEMPLOG/log10-td_$num.sed log10-td-E0.gappa | $GAPPA > /dev/null\n"): fprintf(fd, " echo\n"): fprintf(fd, "done\n"): fprintf(fd, "# Accurate phase: Test all the possible table value for E=1\n"): fprintf(fd, "for num in `seq 0 %d`; do\n", 2^L-1): fprintf(fd, " echo Accurate phase: $num, E=1:\n"): fprintf(fd, " sed -f ./TEMPLOG/log10-td-accurate_$num.sed log10-td-accurate.gappa | $GAPPA > /dev/null\n"): fprintf(fd, " echo\n"): fprintf(fd, "done\n"): fprintf(fd, "# Accurate phase: For the case E=0 we first handle the cases 0 and %d using log10-td-accurate-E0-logir0.gappa\n", 2^L): fprintf(fd, "echo 0 and %d, E=0:\n", 2^L): fprintf(fd, "sed -f ./TEMPLOG/log10-td-accurate_0.sed log10-td-accurate-E0-logir0.gappa | $GAPPA > /dev/null\n"): fprintf(fd, "# Accurate phase: then the other cases where logirh <> 0\n"): fprintf(fd, "for num in `seq 1 %d`; do\n", 2^L-1): fprintf(fd, " echo $num, E=0:\n"): fprintf(fd, " sed -f ./TEMPLOG/log10-td-accurate_$num.sed log10-td-accurate-E0.gappa | $GAPPA > /dev/null\n"): fprintf(fd, " echo\n"): fprintf(fd, "done\n"): fclose(fd): printf("----DONE---\n") : interval-2.1.0/src/crlibm/maple/log2-td.mpl0000644000000000000000000003314613031036767016620 0ustar 00000000000000####################################################################### # This file is part of the crlibm library, and is distributed under # the LGPL. # To use: # restart; read "log2-td.mpl"; Digits := 120: interface(quiet=true): read "common-procedures.mpl": read "triple-double.mpl": mkdir("TEMPLOG"): # We want log2h + log2m + log2l + delta = log(2) such that # log2h and log2m have at least 11 trailing zeros # in order to have an exact multiplication with E, which is lower than 1024 in # magnitude # The resting accuracy is enough for both quick and accurate phases. log2acc := log(2): log2h := round(log2acc * 2**(floor(-log[2](abs(log2acc))) + (53 - 11))) / 2**(floor(-log[2](abs(log2acc))) + (53 - 11)): log2m := round((log2acc - log2h) * 2**(floor(-log[2](abs((log2acc - log2h)))) + (53 - 11))) / 2**(floor(-log[2](abs((log2acc - log2h)))) + (53 - 11)): log2l := log2acc - (log2h + log2m): L := 7: # number of bits used to address the table MAXINDEX := round(2^L * (sqrt(2)-1)): for i from 0 to MAXINDEX-1 do center[i] := 1 + i*2^(-L): # center[i] in [1, 2[ t := evalf(1/center[i]): r[i] := round(t * 2**(floor(-log[2](abs(t))) + 23)) / 2**(floor(-log[2](abs(t))) + 23): (logih[i], logim[i], logil[i]) := hi_mi_lo(evalf(-log(r[i]))): od: for i from MAXINDEX to 2^L do # y has been divided by two, center[i] in [0.5, 1[ center[i]:=(1 + i*2^(-L)) / 2: t := evalf(1/center[i]): r[i] := round(t * 2**(floor(-log[2](abs(t))) + 23)) / 2**(floor(-log[2](abs(t))) + 23): (logih[i], logim[i], logil[i]) := hi_mi_lo(evalf(-log(r[i]))): od: #Computation of ZMax. for i from 0 to MAXINDEX-1 do __x := center[i] + 2^(-L-1) : zmax[i] := (__x*r[i]-1) : __x := center[i] - 2^(-L-1) : zmin[i] := (__x*r[i]-1) : od: for i from MAXINDEX to 2^L do __x := center[i] + 2^(-L-2) : zmax[i] := (__x*r[i]-1) : __x := center[i] - 2^(-L-2) : zmin[i] := (__x*r[i]-1) : od: zmaxmax:=0: zminmin:=0: for i from 0 to 2^L do tabulated_value := logih[i] + logim[i] + logil[i]: poly_approx_min := evalf(log(1+zmin[i])): poly_approx_max := evalf(log(1+zmax[i])): # Test if we have a case where we cancellate a lot # i.e. the polynomial approximation value is greater than half the tabulated value # the tabulated value is not exactly zero and we are of opposite sign if ((abs(poly_approx_min) > 0.75*abs(tabulated_value)) and (tabulated_value <> 0.0) and (poly_approx_min * tabulated_value < 0)) then printf("Polynomial approximation is greater in magnitude in zmin[%d] than half the tabluated value\n",i): printf("The tabulated value is %1.50e\n",tabulated_value): if (tabulated_value <> 0.0) then printf("i.e. the value has the exponent %d\n",floor(log2(abs(tabulated_value)))) fi: printf("The value of polynomial in zmin[%d] is %1.50e\n",i,poly_approx_min): if (poly_approx_min <> 0.0) then printf("i.e. the value has the exponent %d\n",floor(log2(abs(poly_approx_min)))) fi: summe := poly_approx_min + tabulated_value: printf("The exponent of the sum of both is %d\n",floor(log2(abs(summe)))): fi: if ((abs(poly_approx_max) > 0.75*abs(tabulated_value)) and (tabulated_value <> 0.0) and (poly_approx_max * tabulated_value <0)) then printf("Polynomial approximation is greater in magnitude in zmax[%d] than half the tabluated value\n",i): printf("The tabulated value is %1.50e\n",tabulated_value): if (tabulated_value <> 0.0) then printf("i.e. the value has the exponent %d\n",floor(log2(abs(tabulated_value)))) fi: printf("The value of polynomial in zmax[%d] is %1.50e\n",i,poly_approx_max): if (poly_approx_max <> 0.0) then printf("i.e. the value has the exponent %d\n",floor(log2(abs(poly_approx_max)))) fi: summe := poly_approx_max + tabulated_value: printf("The exponent of the sum of both is %d\n",floor(log2(abs(summe)))): fi: if zmax[i] > zmaxmax then zmaxmax := zmax[i]: fi: if zmin[i] < zminmin then zminmin := zmin[i]: fi: od: printf("zminmin = -2^(%2f) zmaxmax = 2^(%2f)\n", log2(-zminmin), log2(zmaxmax) ) : PolyDegreeQuick:=7: printf(" degree of the polynomial used in the quick phase is %d\n",PolyDegreeQuick); DDNumberQuick:=3: printf(" number of double doubles used for the coefficients is %d\n",DDNumberQuick); #Keep -zmaxmax..zmaxmax to keep c1=1, which is useful in the proof #and constrain the first two coefficients to 1 and -1/2 in order to save up a full multiplication and a rounding error polyQuick:= poly_exact2(x*(1+x*(-0.5+x*(numapprox[minimax]((((log(1+x)/x)-1)/x+0.5)/x, x=-zmaxmax..zmaxmax, [PolyDegreeQuick-3,0], 1 , 'deltaApprox')))), DDNumberQuick): #Try to verify the bound for using double double arithmetic. #Idea: compare the maximum absolute value of the polynomial in zmaxmax (the polynomial has its maxima at the limits) #with the maximum value of the first term which is calculated in double precision only p := unapply(polyQuick,x): printf(" using only %d double doubles should be fine since the hi z ulp should affect the result starting from bit %f\n", DDNumberQuick,evalf(53 + log2(p(zmaxmax)) - log2(zmaxmax^(DDNumberQuick)),5)): epsilonApproxQuick := numapprox[infnorm]( 1-polyQuick/log(1+x), x=zminmin..zmaxmax): printf(" approximation rel error for the quick phase is 2^(%2f)\n", log2(epsilonApproxQuick) ) : deltaApproxQuick := numapprox[infnorm]( polyQuick-log(1+x), x=zminmin..zmaxmax): printf(" approximation abs error for the quick phase is 2^(%2f)\n", log2(deltaApproxQuick) ) : PolyDegreeAccurate:=14: printf(" degree of the polynomial used in the accurate phase is %d\n",PolyDegreeAccurate); DDNumberAccu:=7: TDNumberAccu:=3: printf(" number of triple doubles used for the coefficients is %d\n",TDNumberAccu); printf(" number of double doubles used for the coefficients is %d\n",DDNumberAccu); #Keep -zmaxmax..zmaxmax to keep c1=1, which is useful in the proof polyAccurate:= poly_exact32(x*(1+x*(-0.5+x*(numapprox[minimax]((((log(1+x)/x)-1)/x+0.5)/x, x=-zmaxmax..zmaxmax, [PolyDegreeAccurate-3,0], 1 , 'deltaApprox')))), TDNumberAccu, DDNumberAccu): #Try to verify the bound for using double double arithmetic. #Idea: compare the maximum absolute value of the polynomial in zmaxmax (the polynomial has its maxima at the limits) #with the maximum value of the first term which is calculated in double precision only pp := unapply(polyAccurate,x): printf(" using only %d triple doubles should be fine since the mi z ulp should affect the result starting from bit %f\n", TDNumberAccu,evalf(106 + log2(p(zmaxmax)) - log2(zmaxmax^(TDNumberAccu)),5)): printf(" using only %d double doubles should be fine since the hi z ulp should affect the result starting from bit %f\n", DDNumberAccu,evalf(53 + log2(p(zmaxmax)) - log2(zmaxmax^(TDNumberAccu + DDNumberAccu)),5)): epsilonApproxAccurate := numapprox[infnorm]( 1-polyAccurate/log(1+x), x=zminmin..zmaxmax): printf(" approximation rel error for the accurate phase is 2^(%2f)\n", log2(epsilonApproxAccurate) ) : deltaApproxAccurate := numapprox[infnorm]( polyAccurate-log(1+x), x=zminmin..zmaxmax): printf(" approximation abs error for the quick phase is 2^(%2f)\n", log2(deltaApproxAccurate) ) : #Compute now the inverse of ln(2) for the final addition of ln(x) with this constant for obtaining log2(x) #Compute also the relative error of the constant stored as a double double. Log2inv := evalf(1 / log(2)): (log2invh, log2invl) := hi_lo(Log2inv): Log2invhl := log2invh + log2invl: epsilonLog2invhl := evalf(abs((Log2invhl - Log2inv) / Log2inv)): printf(" Log2inv = 1 / ln(2) stored as a double-double is exact with a relative error of 2^(%2f)\n", evalf(log[2](epsilonLog2invhl))): #------------------------------------------------------------------- # Output filename:="TEMPLOG/log2-td.h": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "#include \"crlibm.h\"\n#include \"crlibm_private.h\"\n"): fprintf(fd, "\n/*File generated by maple/log2-td.mpl*/\n"): fprintf(fd, "\n\#define L %d\n\n",L): fprintf(fd, "\#define MAXINDEX %d\n\n", MAXINDEX): fprintf(fd, "\#define INDEXMASK %d\n", 2^L-1): fprintf(fd, "\#define two52 %1.50e\n", 2^(52)): fprintf(fd, "\#define log2h %1.50e\n", log2h): fprintf(fd, "\#define log2m %1.50e\n", log2m): fprintf(fd, "\#define log2l %1.50e\n", log2l): fprintf(fd, "\#define log2invh %1.50e\n",log2invh): fprintf(fd, "\#define log2invl %1.50e\n",log2invl): epsilon_quick_1 := 2^(-61): # The Gappa proof will show this bound epsilon_quick_2 := 2^(-61): # The Gappa proof will show this bound fprintf(fd, "\#define ROUNDCST1 %1.50e\n", compute_rn_constant(epsilon_quick_1)): fprintf(fd, "\#define ROUNDCST2 %1.50e\n", compute_rn_constant(epsilon_quick_2)): fprintf(fd, "\#define RDROUNDCST1 %1.50e\n", epsilon_quick_1): fprintf(fd, "\#define RDROUNDCST2 %1.50e\n", epsilon_quick_2): fprintf(fd, "\n\n"): # Print the defines for the define statements for i from 3 to PolyDegreeQuick do fprintf(fd, "\#define c%d %1.50e\n",i,coeff(polyQuick,x,i)): od: fprintf(fd, "\n\n"): for i from 3 to (DDNumberAccu + TDNumberAccu -1) do (hi,lo) := hi_lo(coeff(polyAccurate,x,i)): fprintf(fd, "\#define accPolyC%dh %1.50e\n",i,hi): fprintf(fd, "\#define accPolyC%dl %1.50e\n",i,lo): od: for i from (DDNumberAccu + TDNumberAccu) to PolyDegreeAccurate do fprintf(fd, "\#define accPolyC%d %1.50e\n",i,coeff(polyAccurate,x,i)): od: fprintf(fd, "\n\n"): # Print the table fprintf(fd, "typedef struct rri_tag {float ri; double logih; double logim; double logil;} rri; \n"): fprintf(fd, "static const rri argredtable[%d] = {\n", 2^L): for i from 0 to 2^L-1 do fprintf(fd, " { \n"): fprintf(fd, " %1.50e, /* r[%d] */ \n", r[i], i): fprintf(fd, " %1.50e, /* logih[%d] */ \n", logih[i], i): fprintf(fd, " %1.50e, /* logim[%d] */ \n", logim[i], i): fprintf(fd, " %1.50e, /* logil[%d] */ \n", logil[i], i): fprintf(fd, " } "): if(i<2^L-1) then fprintf(fd, ", \n"): fi od: fprintf(fd, "}; \n \n"): fclose(fd): for j from 0 to 2^L-1 do filename:=cat("TEMPLOG/log2-td_",j,".sed"): fd:=fopen(filename, WRITE, TEXT): fprintf(fd, " s/_log2h/%1.50e/g\n", log2h): fprintf(fd, " s/_log2m/%1.50e/g\n", log2m): fprintf(fd, " s/_log2l/%1.50e/g\n", log2l): fprintf(fd, " s/_logih/%1.50e/g\n", logih[j]): fprintf(fd, " s/_logim/%1.50e/g\n", logim[j]): fprintf(fd, " s/_logil/%1.50e/g\n", logil[j]): fprintf(fd, " s/_zmin/%1.50e/g\n", zmin[j]): fprintf(fd, " s/_zmax/%1.50e/g\n", zmax[j]): for i from 3 to PolyDegreeQuick do fprintf(fd, " s/_c%d/%1.50e/g\n", i, coeff(polyQuick,x,i)): od: fprintf(fd, " s/_epsilonApproxQuick/%1.50e/g\n", epsilonApproxQuick): fprintf(fd, " s/_epsilonLog2invhl/%1.50e/g\n", epsilonLog2invhl): fclose(fd): od: for j from 0 to 2^L-1 do filename:=cat("TEMPLOG/log2-td-accurate_",j,".sed"): fd:=fopen(filename, WRITE, TEXT): fprintf(fd, " s/_log2h/%1.50e/g\n", log2h): fprintf(fd, " s/_log2m/%1.50e/g\n", log2m): fprintf(fd, " s/_log2l/%1.50e/g\n", log2l): fprintf(fd, " s/_logih/%1.50e/g\n", logih[j]): fprintf(fd, " s/_logim/%1.50e/g\n", logim[j]): fprintf(fd, " s/_logil/%1.50e/g\n", logil[j]): fprintf(fd, " s/_zmin/%1.50e/g\n", zmin[j]): fprintf(fd, " s/_zmax/%1.50e/g\n", zmax[j]): for i from 3 to (DDNumberAccu + TDNumberAccu -1) do (hi,lo) := hi_lo(coeff(polyAccurate,x,i)): fprintf(fd, " s/_accPolyC%dh/%1.50e/g\n", i, hi): fprintf(fd, " s/_accPolyC%dl/%1.50e/g\n", i, lo): od: for i from (DDNumberAccu + TDNumberAccu) to PolyDegreeAccurate do fprintf(fd, " s/_accPolyC%d/%1.50e/g\n", i, coeff(polyAccurate,x,i)): od: fprintf(fd, " s/_epsilonApproxAccurate/%1.50e/g\n", epsilonApproxAccurate): fprintf(fd, " s/_epsilonLog2invhl/%1.50e/g\n", epsilonLog2invhl): fclose(fd): od: # A shell script to use them filename:="run-log2-td-proof.sh": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "#!/bin/sh\n"): fprintf(fd, "# You probably need to edit the path to the gappa executable\n"): fprintf(fd, "GAPPA=~/ble/gappa-0.4.5/src/gappa\n"): fprintf(fd, "# Test all the possible table value for E=1\n"): fprintf(fd, "for num in `seq 0 %d`; do\n", 2^L-1): fprintf(fd, " echo $num, E=1:\n"): fprintf(fd, " sed -f ./TEMPLOG/log2-td_$num.sed log2-td.gappa | $GAPPA > /dev/null\n"): fprintf(fd, " echo\n"): fprintf(fd, "done\n"): fprintf(fd, "# For the case E=0 we first handle the cases 0 and %d using log2-td-E0-logir0.gappa\n", 2^L): fprintf(fd, "echo 0 and %d, E=0:\n", 2^L): fprintf(fd, "sed -f log2-td_0.sed log2-td-E0-logir0.gappa | $GAPPA > /dev/null\n"): fprintf(fd, "# then the other cases where logirh <> 0\n"): fprintf(fd, "for num in `seq 1 %d`; do\n", 2^L-1): fprintf(fd, " echo $num, E=0:\n"): fprintf(fd, " sed -f ./TEMPLOG/log2-td_$num.sed log2-td-E0.gappa | $GAPPA > /dev/null\n"): fprintf(fd, " echo\n"): fprintf(fd, "done\n"): fprintf(fd, "# Accurate phase: Test all the possible table value for E=1\n"): fprintf(fd, "for num in `seq 0 %d`; do\n", 2^L-1): fprintf(fd, " echo Accurate phase: $num, E=1:\n"): fprintf(fd, " sed -f ./TEMPLOG/log2-td-accurate_$num.sed log2-td-accurate.gappa | $GAPPA > /dev/null\n"): fprintf(fd, " echo\n"): fprintf(fd, "done\n"): fprintf(fd, "# Accurate phase: For the case E=0 we first handle the cases 0 and %d using log2-td-accurate-E0-logir0.gappa\n", 2^L): fprintf(fd, "echo 0 and %d, E=0:\n", 2^L): fprintf(fd, "sed -f ./TEMPLOG/log2-td-accurate_0.sed log2-td-accurate-E0-logir0.gappa | $GAPPA > /dev/null\n"): fprintf(fd, "# Accurate phase: then the other cases where logirh <> 0\n"): fprintf(fd, "for num in `seq 1 %d`; do\n", 2^L-1): fprintf(fd, " echo $num, E=0:\n"): fprintf(fd, " sed -f ./TEMPLOG/log2-td-accurate_$num.sed log2-td-accurate-E0.gappa | $GAPPA > /dev/null\n"): fprintf(fd, " echo\n"): fprintf(fd, "done\n"): fclose(fd): printf("----DONE---\n") : interval-2.1.0/src/crlibm/maple/pow.mpl0000755000000000000000000003073113031036767016155 0ustar 00000000000000####################################################################### # This file is part of the crlibm library, and is distributed under # the LGPL. # To use: # restart; read "exp-td.mpl"; Digits := 120: interface(quiet=true): read "common-procedures.mpl": read "triple-double.mpl": mkdir("TEMPPOW"): # Some constants for special cases tests two52 := 2^(52): two53 := 2^(53): twoM53 := 2^(-53): twoM54 := 2^(-54): twoM1021 := 2^(-1021): two1021 := 2^(1021): twoM1000 := 2^(-1000): two1000 := 2^(1000): two999 := 2^(999): two11 := 2^(11): two64 := 2^(64): twoM64 := 2^(-64): scale := 2^(12): rescale := 2^(-12): shiftConst := 2^(52) + 2^(51): largest := 2^(1023) * ((2^(53) - 1) / 2^(52)): smallest := 2^(-1023) * 1 * 2^(-51): # Logarithm log2_12 for power L := 7: # number of bits used to address the table MAXINDEX := round(2^L * (sqrt(2)-1)): for i from 0 to MAXINDEX-1 do center[i] := 1 + i*2^(-L): # center[i] in [1, 2[ t := evalf(1/center[i]): r[i] := round(t * 2**(floor(-log[2](abs(t))) + 23)) / 2**(floor(-log[2](abs(t))) + 23): (logih[i], logil[i], logill[i]) := hi_mi_lo(evalf(-log[2](r[i]))): od: for i from MAXINDEX to 2^L do # y has been divided by two, center[i] in [0.5, 1[ center[i]:=(1 + i*2^(-L)) / 2: t := evalf(1/center[i]): r[i] := round(t * 2**(floor(-log[2](abs(t))) + 23)) / 2**(floor(-log[2](abs(t))) + 23): (logih[i], logil[i], logill[i]) := hi_mi_lo(evalf(-log[2](r[i]))): od: #Computation of ZMax. for i from 0 to MAXINDEX-1 do __x := center[i] + 2^(-L-1) : zmax[i] := (__x*r[i]-1) : __x := center[i] - 2^(-L-1) : zmin[i] := (__x*r[i]-1) : od: for i from MAXINDEX to 2^L do __x := center[i] + 2^(-L-2) : zmax[i] := (__x*r[i]-1) : __x := center[i] - 2^(-L-2) : zmin[i] := (__x*r[i]-1) : od: zmaxmax:=0: zminmin:=0: for i from 0 to 2^L do if zmax[i] > zmaxmax then zmaxmax := zmax[i]: fi: if zmin[i] < zminmin then zminmin := zmin[i]: fi: od: printf("zminmin = -2^(%2f) zmaxmax = 2^(%2f)\n", log2(-zminmin), log2(zmaxmax) ): pLogExact := unapply(-6497523352912697/36028797018963968*X^8+464105351149111/2251799813685248*X^7-4331547231022885/18014398509481984*X^6+324866042375467/1125899906842624*X^5-6497320848556805/18014398509481984*X^4+8460053188225/17592186044416*X^3-58522663504933901518104329421789/81129638414606681695789005144064*X^2+29261331752466950759073917813481/20282409603651670423947251286016*X,X): pLog := poly_exact2(pLogExact(x),3): epsLog := numapprox[infnorm](pLog/log[2](1+x)-1,x=zminmin..zmaxmax): printf("Relative error of pLog w.r.t log2(1+x) is 2^(%f)\n",log[2](abs(epsLog))): # Exponential exp2_12 for power for i from 0 to 2^6 - 1 do twoPowerIndex1hi[i], twoPowerIndex1lo[i], twoPowerIndex1lolo[i] := hi_mi_lo(evalf(2^(i/(2^6)))): twoPowerIndex2hi[i], twoPowerIndex2lo[i], twoPowerIndex2lolo[i] := hi_mi_lo(evalf(2^(i/(2^(12))))): od: pExpExact := unapply(2772236920359585/288230376151711744*X^4+1999746284130149/36028797018963968*X^3+8655072057804175/36028797018963968*X^2+6243314768165359/9007199254740992*X+1,X): pExp := poly_exact(pExpExact(x)): epsExp := numapprox[infnorm]((pExp/2^x)-1,x=-2^(-12)..2^(-12)): printf("Relative error of pExp w.r.t 2^x is 2^(%f)\n",log[2](abs(epsExp))): log2 := nearest(log(2)): # Exponential exp2_33 for power # Polynomial for approximating 2^x - 1 in x=-2^(-42)..2^(-42) pExpXM := unapply(poly_exact2(x * ((6243314768165359 * 2^(-53) + 29397410857115 * 2^(-100)) + (x * 8655072057804175 * 2^(-55))),2),x): epsExpXM := numapprox[infnorm](pExpXM(x)/(2^x-1)-1,x=-2^(-42)..2^(-42)): printf("The relative error of pExpXM w.r.t. 2^x - 1 is 2^(%f)\n",log[2](abs(epsExpXM))): # Polynomial for approximating 2^x - 1 in x=-2^(-95)..2^(-95) pExpXL := unapply(poly_exact(x * 6243314768165359 * 2^(-53)), x): epsExpXL := numapprox[infnorm](pExpXL(x)/(2^x-1)-1,x=-2^(-95)..2^(-95)): printf("The relative error of pExpXL w.r.t. 2^x - 1 is 2^(%f)\n",log[2](abs(epsExpXL))): # Polynomial for approximating 2^x in x=-2^(-12)..2^(-12) pExpXH := unapply(poly_exact32(x * (506517869649829535567849302923399275789356375957 * 2^(-159) + (x * (38978979294391673005692521213079 * 2^(-107) + (x * (36024226132016099441525232746301 * 2^(-109) + (x * (3121261346907607936312652866425 * 2^(-108) + (x * (55385433661433492776134419224183 * 2^(-115) + (x * (5682899659966205 * 2^(-65) + (x * (4501812434047971 * 2^(-68) + (x * 6240991224781291 * 2^(-72))))))))))))))),2,4),x): epsExpXH := numapprox[infnorm](pExpXH(x)/(2^x-1)-1,x=-2^(-12)..2^(-12)): printf("The relative error of pExpXH w.r.t. 2^x - 1 is 2^(%f)\n",log[2](abs(epsExpXH))): # Logarithm log2_13 for power pLog13 := unapply(poly_exact32(x * (65890661388387311068680317907364672336343222485 * 2^(-155) + (x * ((-263562645553549244274721271629458689351564598207 * 2^(-158)) + (x * (39015109003289267678766993386435 * 2^(-106) + (x * ((-29261331752466950759075245039823 * 2^(-106)) + (x * (11704532700986780303630098000775 * 2^(-105) + (x * ((-78030218006578535357533995772145 * 2^(-108)) + (x * (66883044005638744592219245028355 * 2^(-108) + (x * ((-14630665876233475378839909031845 * 2^(-106)) + (x * (721924538728533 * 2^(-52) + (x * ((-324866042427843 * 2^(-51)) + (x * (4725324253587977 * 2^(-55) + (x * ((-8663094456247059 * 2^(-56)) + (x * (7996693900181249 * 2^(-56) + (x * ((-7425880934468497 * 2^(-56)) + (x * 7091529758988931 * 2^(-56))))))))))))))))))))))))))))),3,6),x): epsLog13 := numapprox[infnorm](pLog13(x)/(log[2](1+x))-1,x=-2^(-8)..2^(-8)): printf("The relative error of pLog13 w.r.t. log2(1+x) is 2^(%f)\n",log[2](abs(epsLog13))): # exp2_30bits for exactness test coeff_0 := 9.99999999947486895024439945700578391551971435546875000000000000000000000000000000e-01: coeff_1 := 6.93147180274189311788290979166049510240554809570312500000000000000000000000000000e-01: coeff_2 := 2.40226513201275415632096610352164134383201599121093750000000000000000000000000000e-01: coeff_3 := 5.55041194035996443556513213479775004088878631591796875000000000000000000000000000e-02: coeff_4 := 9.61801251055323207228564541537707555107772350311279296875000000000000000000000000e-03: coeff_5 := 1.33325640280455024258565721595459763193503022193908691406250000000000000000000000e-03: coeff_6 := 1.54736006782907911617439000728779774362919852137565612792968750000000000000000000e-04: coeff_7 := 1.55294506644329091183710789270122631933190859854221343994140625000000000000000000e-05: pExp2Exact := unapply(coeff_0 + X * (coeff_1 + X * (coeff_2 + X * (coeff_3 + X * (coeff_4 + X * (coeff_5 + X * (coeff_6 + X * coeff_7)))))),X): pExp2 := poly_exact(pExp2Exact(x)): epsExp2 := numapprox[infnorm]((pExp2/2^x)-1,x=-0.5..0.5): printf("Relative error of pExp2 w.r.t 2^x is 2^(%f)\n",log[2](abs(epsExp2))): # Overall accuracy estimate # C'est pifometrique epsOverall := 2^(-62): bi := floor(-log[2](abs(epsOverall))): approxBoundFactor := 2^(-(bi - 54)): epsOverallAccurate := 2^(-120): bi2 := floor(-log[2](abs(epsOverallAccurate))) - 1: approxBoundFactorAccurate := 2^(-(bi2 - 54)): # Print out of the .h file filename:="TEMPPOW/pow.h": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "#include \"crlibm.h\"\n#include \"crlibm_private.h\"\n"): fprintf(fd, "\n/*File generated by maple/pow.mpl*/\n"): fprintf(fd, "\#define APPROXBOUNDFACTOR %1.50e\n", approxBoundFactor): fprintf(fd, "\#define APPROXBOUNDFACTORACCURATE %1.50e\n", approxBoundFactorAccurate): fprintf(fd, "\#define TWO52 %1.50e\n", two52): fprintf(fd, "\#define TWO53 %1.50e\n", two53): fprintf(fd, "\#define TWO11 %1.50e\n", two11): fprintf(fd, "\#define TWOM53 %1.50e\n", twoM53): fprintf(fd, "\#define TWOM54 %1.50e\n", twoM54): fprintf(fd, "\#define TWOM1021 %1.50e\n", twoM1021): fprintf(fd, "\#define TWO1021 %1.50e\n", two1021): fprintf(fd, "\#define TWOM1000 %1.50e\n", twoM1000): fprintf(fd, "\#define TWO999 %1.50e\n", two999): fprintf(fd, "\#define TWO1000 %1.50e\n\n", two1000): fprintf(fd, "\#define TWO64 %1.50e\n", two64): fprintf(fd, "\#define TWOM64 %1.50e\n", twoM64): fprintf(fd, "\#define SCALE %1.50e\n", scale): fprintf(fd, "\#define RESCALE %1.50e\n", rescale): fprintf(fd, "\#define SHIFTCONSTANT %1.50e\n", shiftConst): fprintf(fd, "\#define LARGEST %1.50e\n",largest): fprintf(fd, "\#define SMALLEST %1.50e\n\n",smallest): (log2coeff1dh,log2coeff1dl) := hi_lo(coeff(pLog,x,1)): (log2coeff2dh,log2coeff2dl) := hi_lo(coeff(pLog,x,2)): fprintf(fd, "\#define log2coeff1h %1.50e\n",log2coeff1dh): fprintf(fd, "\#define log2coeff1l %1.50e\n",log2coeff1dl): fprintf(fd, "\#define log2coeff2h %1.50e\n",log2coeff2dh): fprintf(fd, "\#define log2coeff2l %1.50e\n",log2coeff2dl): for i from 3 to 8 do fprintf(fd, "\#define log2coeff%d %1.50e\n",i,coeff(pLog,x,i)): od: fprintf(fd,"\n"): for i from 1 to 4 do fprintf(fd, "\#define exp2coeff%d %1.50e\n",i,coeff(pExp,x,i)): od: fprintf(fd,"\n"): for i from 0 to 7 do fprintf(fd, "\#define exp2InaccuCoeff%d %1.50e\n",i,coeff(pExp2,x,i)): od: fprintf(fd,"\n"): (exp2XMcoeff1dh, exp2XMcoeff1dl) := hi_lo(coeff(pExpXM(x),x,1)): exp2XMcoeff2dh := nearest(coeff(pExpXM(x),x,2)): fprintf(fd, "\#define exp2XMcoeff1h %1.50e\n",exp2XMcoeff1dh): fprintf(fd, "\#define exp2XMcoeff1l %1.50e\n",exp2XMcoeff1dl): fprintf(fd, "\#define exp2XMcoeff2h %1.50e\n\n",exp2XMcoeff2dh): exp2XLcoeff1dh := nearest(coeff(pExpXL(x),x,1)): fprintf(fd, "\#define exp2XLcoeff1h %1.50e\n\n",exp2XLcoeff1dh): (exp2XHcoeff1dh,exp2XHcoeff1dm,exp2XHcoeff1dl) := hi_mi_lo(coeff(pExpXH(x),x,1)): fprintf(fd, "\#define exp2XHcoeff1h %1.50e\n",exp2XHcoeff1dh): fprintf(fd, "\#define exp2XHcoeff1m %1.50e\n",exp2XHcoeff1dm): fprintf(fd, "\#define exp2XHcoeff1l %1.50e\n",exp2XHcoeff1dl): for i from 2 to 5 do (exp2XHcoeffidh,exp2XHcoeffidl) := hi_lo(coeff(pExpXH(x),x,i)): fprintf(fd, "\#define exp2XHcoeff%dh %1.50e\n",i,exp2XHcoeffidh): fprintf(fd, "\#define exp2XHcoeff%dm %1.50e\n",i,exp2XHcoeffidl): od: for i from 6 to 8 do fprintf(fd, "\#define exp2XHcoeff%dh %1.50e\n",i,nearest(coeff(pExpXH(x),x,i))): od: fprintf(fd,"\n"): (log213coeff1dh,log213coeff1dm,log213coeff1dl) := hi_mi_lo(coeff(pLog13(x),x,1)): fprintf(fd, "\#define log213coeff1h %1.50e\n",log213coeff1dh): fprintf(fd, "\#define log213coeff1m %1.50e\n",log213coeff1dm): fprintf(fd, "\#define log213coeff1l %1.50e\n",log213coeff1dl): (log213coeff2dh,log213coeff2dm,log213coeff2dl) := hi_mi_lo(coeff(pLog13(x),x,2)): fprintf(fd, "\#define log213coeff2h %1.50e\n",log213coeff2dh): fprintf(fd, "\#define log213coeff2m %1.50e\n",log213coeff2dm): fprintf(fd, "\#define log213coeff2l %1.50e\n",log213coeff2dl): for i from 3 to 8 do (log213coeffidh, log213coeffidl) := hi_lo(coeff(pLog13(x),x,i)): fprintf(fd, "\#define log213coeff%dh %1.50e\n",i,log213coeffidh): fprintf(fd, "\#define log213coeff%dm %1.50e\n",i,log213coeffidl): od: for i from 9 to 15 do fprintf(fd, "\#define log213coeff%dh %1.50e\n",i,nearest(coeff(pLog13(x),x,i))): od: fprintf(fd, "\n\#define LOG2 %1.50e\n\n", log2): fprintf(fd, "typedef struct rri_tag {float ri; double logih; double logil; double logill;} rri; \n"): fprintf(fd, "static const rri argredtable[%d] = {\n", 2^L): for i from 0 to 2^L-1 do fprintf(fd, " { \n"): fprintf(fd, " %1.50e, /* r[%d] */ \n", r[i], i): fprintf(fd, " %1.50e, /* logih[%d] */ \n", logih[i], i): fprintf(fd, " %1.50e, /* logil[%d] */ \n", logil[i], i): fprintf(fd, " %1.50e, /* logill[%d] */ \n", logill[i], i): fprintf(fd, " } "): if(i<2^L-1) then fprintf(fd, ", \n"): fi od: fprintf(fd, "}; \n \n"): fprintf(fd, "typedef struct tPi_t_tag {double hi; double lo; double lolo;} tPi_t; \n"): fprintf(fd, "static const tPi_t twoPowerIndex1[%d] = {\n", 2^(6)): for i from 0 to 2^(6)-1 do fprintf(fd, " { \n"): fprintf(fd, " %1.50e, /* twoPowerIndex1hi[%d] */ \n", twoPowerIndex1hi[i], i): fprintf(fd, " %1.50e, /* twoPowerIndex1lo[%d] */ \n", twoPowerIndex1lo[i], i): fprintf(fd, " %1.50e, /* twoPowerIndex1lolo[%d] */ \n", twoPowerIndex1lolo[i], i): fprintf(fd, " } "): if(i<2^(6)-1) then fprintf(fd, ", \n"): fi od: fprintf(fd, "}; \n \n"): fprintf(fd, "static const tPi_t twoPowerIndex2[%d] = {\n", 2^(6)): for i from 0 to 2^(6)-1 do fprintf(fd, " { \n"): fprintf(fd, " %1.50e, /* twoPowerIndex2hi[%d] */ \n", twoPowerIndex2hi[i], i): fprintf(fd, " %1.50e, /* twoPowerIndex2lo[%d] */ \n", twoPowerIndex2lo[i], i): fprintf(fd, " %1.50e, /* twoPowerIndex2lolo[%d] */ \n", twoPowerIndex2lolo[i], i): fprintf(fd, " } "): if(i<2^(6)-1) then fprintf(fd, ", \n"): fi od: fprintf(fd, "}; \n \n"): fclose(fd): printf("--------- DONE -----------\n");interval-2.1.0/src/crlibm/maple/sqrt.mpl0000644000000000000000000000267613031036767016345 0ustar 00000000000000####################################################################### # This file is part of the crlibm library, and is distributed under # the LGPL. # To use: # restart; read "sqrt.mpl"; Digits := 120: interface(quiet=true): read "common-procedures.mpl": read "triple-double.mpl": mkdir("TEMPSQRT"): polyDegree := 4: ERecSqrtmMin := 0.707: ERecSqrtmMax := 1.4143: xErrMin := evalf((1/(ERecSqrtmMax^2))): xErrMax := evalf((1/(ERecSqrtmMin^2))): printf("Using a %d degree polynomial for computing the iteration seed\n",polyDegree); polyExact := numapprox[minimax](1/sqrt(x),x=1/2..2,[polyDegree,0],1,'err'): poly := poly_exact(polyExact): eps := numapprox[infnorm]((poly*sqrt(x))-1,x=xErrMin..xErrMax): printf("Relative approximation error eps = 2^(%f)\n",log[2](abs(eps))): printf("Writing tables...\n"); filename:="TEMPSQRT/sqrt.h": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "\n/* File generated by maple/sqrt.mpl */\n"): for i from 0 to polyDegree do fprintf(fd, "\#define SQRTPOLYC%d %1.50e\n",i,coeff(poly,x,i)): od: fprintf(fd, "\#define TWO52 %1.50e\n",evalf(2^(52))): fclose(fd): filename:="TEMPSQRT/sqrt.sed": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "s/_epsilonApprox/%1.50e/g\n",eps): fprintf(fd, "s/_ERecSqrtmMin/%1.50e/g\n",ERecSqrtmMin): fprintf(fd, "s/_ERecSqrtmMax/%1.50e/g\n",ERecSqrtmMax): for i from 0 to polyDegree do fprintf(fd, "s/_SQRTPOLYC%d/%1.50e/g\n",i,coeff(poly,x,i)): od: fclose(fd): printf("... done\n");interval-2.1.0/src/crlibm/maple/trigo.mpl0000644000000000000000000006034613031036767016476 0ustar 00000000000000 Digits := 100: interface(quiet=true): read "common-procedures.mpl": with(orthopoly): mkdir("TEMPTRIG"): # - Evaluation scheme : # case 1 : return x # case 2 (or Fast) : compute a simple polynomial # case 3 : do an argument reduction... ######################################################## # Case 1 : Small arguments # return x for sine and tan, return 1 for cos ######################################################## xmax_return_x_for_sin := 2^(-26): xmax_return_1_for_cos_RN := sqrt(2^(-53)): xmax_return_1_for_cos_RDIR:=2^(-26): one_rounded_down := evalf(1-ulp(1/2)): xmax_return_x_for_tan := 2^(-27): ######################################################## # Case 2 : simple polynomial approximation ######################################################## # We want to use the same polynomial in case 2 and 3. # So see after arg red ################################################# # Case 3 : Argument reduction ################################################# ################################################# # CODY and WAITE Argument reduction C := Pi/256: invC:= nearest(1/C): reminvC := evalf(1/C - invC): expC:=ieeedouble(C)[2]: epsinvC := abs(reminvC*C): # There are three sets of constants : # - split redC into two constants, for small values when we are concerned with absolute error # - split redC into three constants, for larger values # - split redC into three doubles, for the cases when we need # good relative precision on the result and fear cancellation # Fastest reduction using two-part Cody and Waite (up to |k|=2^22) bitsCh_0:=34: # 1/2 <= C/2^(expC+1) <1 Ch:= round(evalf( C * 2^(bitsCh_0-expC-1))) / (2^(bitsCh_0-expC-1)): # recompute bitsCh in case we are lucky (and we are for bitsCh_0=32) bitsCh:=1+log2(op(2,ieeedouble(Ch)[3])) : # this means the log of the denominator Cl:=nearest(C - Ch): # Cody and Waite argument reduction will work for |k| /dev/null \n"); maxepstotalTanCase2:=4.59602e-19: # Cut from Gappa output log2(maxepstotalTanCase2): # almost 61 bits ############################################################################### # Computing errors for Case3 : now we have an error due to arg red # First DoSinZero. The notations are those of the paper proof # Approximation error already computed above as epsApproxSinCase3; # polynomial evaluation in double, with an error on y*y of epsilonArgRed errlist:=errlist_quickphase_horner(degree(polyTs2),0,0,eps_ArgRed, 0): (epsRoundingTsSinZero, deltaRoundingTsSinZero, minTs, maxTs):= compute_horner_rounding_error(polyTs2,y,y2maxCase3, errlist, true): # just as in the paper proof maxepsSinZero1 := (1+epsApproxSinCase3)*(1+epsRoundingTsSinZero)*(1+2^(-53))*(1+2^(-53)) - 1: # just as in the paper proof. For x>0 the absolute values are as given epstotalSinZero := ( (x-sin(x))*maxepsSinZero1 + x*eps_ArgRed + 2^(-53)*x^3/3 ) / sin(x): maxepstotalSinZero := numapprox[infnorm]( epstotalSinZero , x=2^(-30)..ymaxCase3): printf("\nMax rel error for DoSinZero is %1.5e, if it's smaller than 2^(-66) (%1.5e) then the proof is OK\n\n", maxepstotalSinZero, 2^(-66)): ##############################SinCosCase3############################ SinCosSize:= 128: # size f the table # The Gappa files in TEMPTRIG for i from 1 to SinCosSize/2 do filename:=cat("TEMPTRIG/SinACosA_",i,".sed"): fd:=fopen(filename, WRITE, TEXT): # The table values s:=hi_lo(sin(i*Pi/(2*SinCosSize))): c:=hi_lo(cos(i*Pi/(2*SinCosSize))): fprintf(fd, " s/_cah/%1.40e/g\n", c[1]): fprintf(fd, " s/_cal/%1.40e/g\n", c[2]): fprintf(fd, " s/_sah/%1.40e/g\n", s[1]): fprintf(fd, " s/_sal/%1.40e/g\n", s[2]): # The polynomial coefficients fprintf(fd, " s/_s3/%1.40e/g\n", coeff(polySin,x,3)): fprintf(fd, " s/_s5/%1.40e/g\n", coeff(polySin,x,5)): fprintf(fd, " s/_s7/%1.40e/g\n", coeff(polySin,x,7)): fprintf(fd, " s/_s9/%1.40e/g\n", coeff(polySin,x,9)): fprintf(fd, " s/_c2/%1.40e/g\n", coeff(polyCos,x,2)): fprintf(fd, " s/_c4/%1.40e/g\n", coeff(polyCos,x,4)): fprintf(fd, " s/_c6/%1.40e/g\n", coeff(polyCos,x,6)): fprintf(fd, " s/_c8/%1.40e/g\n", coeff(polyCos,x,8)): # The approximation errors fprintf(fd, " s/_ymaxCase3/%1.40e/g\n", ymaxCase3*1.00001): fprintf(fd, " s/_delta_ArgRed/%1.40e/g\n", delta_ArgRed*1.00001): fprintf(fd, " s/_delta_approx_Sin_Case3/%1.40e/g\n", deltaApproxSinCase3*1.00001): fprintf(fd, " s/_delta_approx_Cos_Case3/%1.40e/g\n", deltaApproxCosCase3*1.00001): fclose(fd): od: printf("************ DONE TEMPTRIG/*.sed ************\n"): # A shell script to use them filename:="../gappa/run-trigo-proof.sh": fd:=fopen(filename, WRITE, TEXT): fprintf(fd, "#!/bin/sh\n"): fprintf(fd, "# You probably need to edit the path to the gappa executable\n"): fprintf(fd, "for file in ../maple/TEMPTRIG/SinACosA*.sed \n"): fprintf(fd, "do\n"): fprintf(fd, " echo $file:\n"): fprintf(fd, " sed -f $file trigoSinCosCase3.gappa | ~/gappa/src/gappa\n"): fprintf(fd, " echo\n"): fprintf(fd, "done\n"): fclose(fd): printf("************ DONE trigo_test.sh ************\n"): printf("To run the Gappa proof, you should go to the gappa directory and run\n"): printf(" sh run-trigo-proof.sh 2> ../maple/TEMPTRIG/Gappa.out\n"): printf("Then look at maple/TEMPTRIG/Gappa.out. It shouldn't contain 'No proof'.\n This means that everything is OK and the rounding constants in TEMPTRIG/trigo_fast.h are proven upper bounds.\n\n"): # This value has been validated by Gappa (using all the previous) maxepstotalSinCosCase3:=3*2^(-66): rnconstantSinCosCase3 := evalf(compute_rn_constant(maxepstotalSinCosCase3)): # The error of sin, the error of cos, then the error of Div22 maxepstotalTanCase3:= 2.1*maxepstotalSinCosCase3: rnconstantTanCase3 := evalf(compute_rn_constant(maxepstotalTanCase3)): ############################################## ## Compute constants for SCS arg red oldDigits:=Digits: Digits:=1000: # for 2/Pi: n:=round(2^(30*48)*evalf(2/Pi)): digitlist:=[]: for i from 1 to 48 do r:=n mod (2^30): n:=floor(n/(2^30)): hexstring:= convert(convert(r,hex),string): digitlist:=[hexstring, op(digitlist)]: end: digitlist: # for 256/Pi: n:=round(2^(30*47)*evalf(256/Pi)): digitlist:=[]: for i from 1 to 48 do r:=n mod (2^30): n:=floor(n/(2^30)): hexstring:= convert(convert(r,hex),string): digitlist:=[hexstring, op(digitlist)]: end: digitlist: Digits:=oldDigits: # an auxiliary output function: # Outputs the high part of a double, and the double in comment. # As all these high parts are used in code as # if(absxhi < XMAX_COS_CASE2) # we have to remove one LSB to the high part, or, divide var by # (1+2^(-20)) # Now we have absxhi absxhi*(1+2^(-20)) x #include "crlibm.h" #include "crlibm_private.h" #include "triple-double.h" #include "pow.h" /* Some macros for specific operations in power */ #define USE_BUILTINS 0 /* decompose Decomposes a positive double precision variable x (normal or subnormal) such that 2^(resE) * resm = x where resm = 2 * k + 1 for integer k resE is an integer variable pointer resm is a double precision variable pointer x is a double precision variable. */ #if USE_BUILTINS #define decompose(resm,resE,x) \ { \ int __decompose_ex, __decompose_d; \ int64_t __decompose_temp; \ db_number __decompose_xdb; \ \ __decompose_xdb.d = (x); \ __decompose_ex = 0; \ if (!(__decompose_xdb.i[HI] & 0xfff00000)) { \ __decompose_xdb.d = (x) * 0.18014398509481984e17; \ __decompose_ex = -54; \ } \ __decompose_ex += (__decompose_xdb.i[HI] >> 20) - 1023; \ __decompose_xdb.i[HI] &= 0x000fffff; \ __decompose_temp = __decompose_xdb.l | 0x0010000000000000llu; \ __decompose_d = __builtin_ctz(__decompose_temp); \ __decompose_xdb.i[HI] |= (1075 - __decompose_d) << 20; \ *(resE) = __decompose_d - 52 + __decompose_ex; \ *(resm) = __decompose_xdb.d; \ } #else #define decompose(resm,resE,x) \ { \ int __decompose_ex, __decompose_d; \ int64_t __decompose_temp; \ db_number __decompose_xdb, __decompose_tempdb; \ \ __decompose_xdb.d = (x); \ __decompose_ex = 0; \ if (!(__decompose_xdb.i[HI] & 0xfff00000)) { \ __decompose_xdb.d = (x) * 0.18014398509481984e17; \ __decompose_ex = -54; \ } \ __decompose_ex += (__decompose_xdb.i[HI] >> 20) - 1023; \ __decompose_xdb.i[HI] &= 0x000fffff; \ __decompose_temp = __decompose_xdb.l | 0x0010000000000000llu; \ __decompose_temp = (~__decompose_temp & (__decompose_temp - 1)) + 1; \ __decompose_tempdb.d = (double) __decompose_temp; \ __decompose_d = (__decompose_tempdb.i[HI] >> 20) - 1023; \ __decompose_xdb.i[HI] |= (1075 - __decompose_d) << 20; \ *(resE) = __decompose_d - 52 + __decompose_ex; \ *(resm) = __decompose_xdb.d; \ } #endif /* isOddInteger Determines if a given double precision number x is an odd integer */ #define isOddInteger(x) (ABS(((ABS(x) + 0.9007199254740992e16) - 0.9007199254740992e16) - ABS(x)) == 1.0) /* isInteger Determines if a given double precision number x is integer */ #define isInteger(x) ((ABS(x) >= 0.4503599627370496e16) || (((ABS(x) + 0.4503599627370496e16) - 0.4503599627370496e16) == ABS(x))) /* log2_130 Approximates resh + resm + resl = (ed + log2(1 + (xh + xm)) + log2(r[index])) * (1 + eps) where ||eps|| <= 2^(-130) */ static inline void log2_130(double *resh, double *resm, double *resl, int index, double ed, double xh, double xm) { double p_t_1_0h; double p_t_2_0h; double p_t_3_0h; double p_t_4_0h; double p_t_5_0h; double p_t_6_0h; double p_t_7_0h; double p_t_8_0h; double p_t_9_0h, p_t_9_0m; double p_t_10_0h, p_t_10_0m; double p_t_11_0h, p_t_11_0m; double p_t_12_0h, p_t_12_0m; double p_t_13_0h, p_t_13_0m; double p_t_14_0h, p_t_14_0m; double p_t_15_0h, p_t_15_0m; double p_t_16_0h, p_t_16_0m, p_t_16_0l; double p_t_17_0h, p_t_17_0m, p_t_17_0l; double p_t_18_0h, p_t_18_0m, p_t_18_0l; double p_t_19_0h, p_t_19_0m, p_t_19_0l; double p_t_20_0h, p_t_20_0m, p_t_20_0l; double p_t_21_0h, p_t_21_0m, p_t_21_0l; double p_t_21_1h, p_t_21_1m, p_t_21_1l; double p_t_22_0h, p_t_22_0m, p_t_22_0l; double p_t_23_0h, p_t_23_0m, p_t_23_0l; double p_resh, p_resm, p_resl; double log2yh, log2ym, log2yl; double log2xh, log2xm, log2xl; double logih, logim, logil; p_t_1_0h = log2_130_p_coeff_13h; p_t_2_0h = p_t_1_0h * xh; p_t_3_0h = log2_130_p_coeff_12h + p_t_2_0h; p_t_4_0h = p_t_3_0h * xh; p_t_5_0h = log2_130_p_coeff_11h + p_t_4_0h; p_t_6_0h = p_t_5_0h * xh; p_t_7_0h = log2_130_p_coeff_10h + p_t_6_0h; p_t_8_0h = p_t_7_0h * xh; Add12(p_t_9_0h,p_t_9_0m,log2_130_p_coeff_9h,p_t_8_0h); Mul22(&p_t_10_0h,&p_t_10_0m,p_t_9_0h,p_t_9_0m,xh,xm); Add122(&p_t_11_0h,&p_t_11_0m,log2_130_p_coeff_8h,p_t_10_0h,p_t_10_0m); MulAdd22(&p_t_12_0h,&p_t_12_0m,log2_130_p_coeff_7h,log2_130_p_coeff_7m,xh,xm,p_t_11_0h,p_t_11_0m); MulAdd22(&p_t_13_0h,&p_t_13_0m,log2_130_p_coeff_6h,log2_130_p_coeff_6m,xh,xm,p_t_12_0h,p_t_12_0m); MulAdd22(&p_t_14_0h,&p_t_14_0m,log2_130_p_coeff_5h,log2_130_p_coeff_5m,xh,xm,p_t_13_0h,p_t_13_0m); Mul22(&p_t_15_0h,&p_t_15_0m,p_t_14_0h,p_t_14_0m,xh,xm); Add23(&p_t_16_0h,&p_t_16_0m,&p_t_16_0l,log2_130_p_coeff_4h,log2_130_p_coeff_4m,p_t_15_0h,p_t_15_0m); Mul233(&p_t_17_0h,&p_t_17_0m,&p_t_17_0l,xh,xm,p_t_16_0h,p_t_16_0m,p_t_16_0l); Add233(&p_t_18_0h,&p_t_18_0m,&p_t_18_0l,log2_130_p_coeff_3h,log2_130_p_coeff_3m,p_t_17_0h,p_t_17_0m,p_t_17_0l); Mul233(&p_t_19_0h,&p_t_19_0m,&p_t_19_0l,xh,xm,p_t_18_0h,p_t_18_0m,p_t_18_0l); Add33(&p_t_20_0h,&p_t_20_0m,&p_t_20_0l,log2_130_p_coeff_2h,log2_130_p_coeff_2m,log2_130_p_coeff_2l,p_t_19_0h,p_t_19_0m,p_t_19_0l); Mul233(&p_t_21_0h,&p_t_21_0m,&p_t_21_0l,xh,xm,p_t_20_0h,p_t_20_0m,p_t_20_0l); Renormalize3(&p_t_21_1h,&p_t_21_1m,&p_t_21_1l,p_t_21_0h,p_t_21_0m,p_t_21_0l); Add33(&p_t_22_0h,&p_t_22_0m,&p_t_22_0l,log2_130_p_coeff_1h,log2_130_p_coeff_1m,log2_130_p_coeff_1l,p_t_21_1h,p_t_21_1m,p_t_21_1l); Mul233(&p_t_23_0h,&p_t_23_0m,&p_t_23_0l,xh,xm,p_t_22_0h,p_t_22_0m,p_t_22_0l); p_resh = p_t_23_0h; p_resm = p_t_23_0m; p_resl = p_t_23_0l; logih = argredtable[index].logih; logim = argredtable[index].logim; logil = argredtable[index].logil; Add33(&log2yh,&log2ym,&log2yl,logih,logim,logil,p_resh,p_resm,p_resl); Add133(&log2xh,&log2xm,&log2xl,ed,log2yh,log2ym,log2yl); Renormalize3(resh,resm,resl,log2xh,log2xm,log2xl); } /* exp2_120 Approximates 2^H * (resh + resm + resl) = 2^(xh + xm + xl) * (1 + eps) where ||eps|| <= 2^(-119.5) */ static inline void exp2_120(int *H, double *resh, double *resm, double *resl, double xh, double xm, double xl) { double xhMult2L, rhMult2L, r; int k, index1, index2; db_number shiftedxhMult2Ldb; double rh, rm, rl; double t1h, t1m, t1l, t2, t3; double p_t_1_0h; double p_t_2_0h; double p_t_3_0h; double p_t_4_0h; double p_t_5_0h, p_t_5_0m; double p_t_6_0h, p_t_6_0m; double p_t_7_0h, p_t_7_0m; double p_t_8_0h, p_t_8_0m; double p_t_9_0h, p_t_9_0m, p_t_9_0l; double p_t_10_0h, p_t_10_0m, p_t_10_0l; double p_t_11_0h, p_t_11_0m, p_t_11_0l; double p_resh, p_resm, p_resl; double tbl1h, tbl1m, tbl1l, tbl2h, tbl2m, tbl2l; double tablesh, tablesm, tablesl; double exp2h, exp2m, exp2l; /* Argument reduction Produce exactly 2^H * 2^(i1/2^8) * 2^(i2/2^13) * 2^(rh + rm + rl) */ xhMult2L = xh * two13; shiftedxhMult2Ldb.d = shiftConst + xhMult2L; rhMult2L = xhMult2L - (shiftedxhMult2Ldb.d - shiftConst); r = rhMult2L * twoM13; k = shiftedxhMult2Ldb.i[LO]; *H = k >> 13; index1 = k & INDEXMASK1; index2 = (k & INDEXMASK2) >> 5; Add12Cond(t1h, t2, r, xm); Add12Cond(t1m, t1l, t2, xl); Add12(rh, t3, t1h, t1m); Add12(rm, rl, t3, t1l); /* Polynomial approximation of 2^(rh + rm + rl) */ p_t_1_0h = exp2_120_p_coeff_6h; p_t_2_0h = p_t_1_0h * rh; p_t_3_0h = exp2_120_p_coeff_5h + p_t_2_0h; p_t_4_0h = p_t_3_0h * rh; Add12(p_t_5_0h,p_t_5_0m,exp2_120_p_coeff_4h,p_t_4_0h); MulAdd22(&p_t_6_0h,&p_t_6_0m,exp2_120_p_coeff_3h,exp2_120_p_coeff_3m,rh,rm,p_t_5_0h,p_t_5_0m); MulAdd22(&p_t_7_0h,&p_t_7_0m,exp2_120_p_coeff_2h,exp2_120_p_coeff_2m,rh,rm,p_t_6_0h,p_t_6_0m); Mul22(&p_t_8_0h,&p_t_8_0m,p_t_7_0h,p_t_7_0m,rh,rm); Add23(&p_t_9_0h,&p_t_9_0m,&p_t_9_0l,exp2_120_p_coeff_1h,exp2_120_p_coeff_1m,p_t_8_0h,p_t_8_0m); Mul33(&p_t_10_0h,&p_t_10_0m,&p_t_10_0l,rh,rm,rl,p_t_9_0h,p_t_9_0m,p_t_9_0l); Add133(&p_t_11_0h,&p_t_11_0m,&p_t_11_0l,exp2_120_p_coeff_0h,p_t_10_0h,p_t_10_0m,p_t_10_0l); Renormalize3(&p_resh,&p_resm,&p_resl,p_t_11_0h,p_t_11_0m,p_t_11_0l); /* Table access */ tbl1h = twoPowerIndex1[index1].hi; tbl1m = twoPowerIndex1[index1].mi; tbl1l = twoPowerIndex1[index1].lo; tbl2h = twoPowerIndex2[index2].hi; tbl2m = twoPowerIndex2[index2].mi; tbl2l = twoPowerIndex2[index2].lo; /* Reconstruction */ Mul33(&tablesh,&tablesm,&tablesl,tbl1h,tbl1m,tbl1l,tbl2h,tbl2m,tbl2l); Mul33(&exp2h,&exp2m,&exp2l,tablesh,tablesm,tablesl,p_resh,p_resm,p_resl); Renormalize3(resh,resm,resl,exp2h,exp2m,exp2l); } /* pow_120 Approximates 2^H * (resh + resm + resl) = 2^(y * (ed + log2(1 + (zh + zm)) + log2(r[index]))) * (1 + eps) where ||eps|| <= 2^(-118.5) if -1075 <= y * (ed + log2(1 + (zh + zm)) + log2(r[index])) <= 1024 Approximates further (ed + log2(1 + (zh + zm)) + log2(r[index))) by log2xh where log2xh = (ed + log2(1 + (zh + zm)) + log2(r[index))) * (1 + eps2) where |eps2| <= 2^(-52) and log2xh is exact if 2^ed * ((1 + (zh + zm)) * r[index]) is an integer power of 2. */ void pow_120(int *H, double *resh, double *resm, double *resl, double *log2xh, double y, int index, double ed, double zh, double zm) { double ylog2xh, ylog2xm, ylog2xl; double log2xm, log2xl; /* Compute log2(x) */ log2_130(log2xh,&log2xm,&log2xl,index,ed,zh,zm); /* Compute y * log2(x) */ Mul133(&ylog2xh,&ylog2xm,&ylog2xl,y,*log2xh,log2xm,log2xl); /* Compute 2^(y * log2(x)) */ exp2_120(H,resh,resm,resl,ylog2xh,ylog2xm,ylog2xl); } /* pow_round_and_check_rn Checks whether 2^H * (powh + powm + powl) which is an approximate to x^y with a relative error or less than 2^(-118.5), can be rounded correctly to double precision in round-to-nearest-ties-to-even mode or whether the Table Maker's Dilemma occurs or the case is exact. Returns 1 if rounding is possible and affects pow with the rounding Returns 0 if rounding is not possible or if the case is exact If the returned value is 0, it affects G, kh, kl such that 2^G * (kh + kl) is an approximate to x^y with an relative error of 2^(-117) and such that rounding 2^G * kh to double precision is an exact operation. */ static inline int pow_round_and_check_rn(double *pow, int H, double powh, double powm, double powl, int *G, double *kh, double *kl) { double th, tm, tl; int K, K1, K2; db_number twodb, two2db; double twoH1074powh, twoH1074powm, shiftedpowh, delta; double scaledth; double t1m, t1l; /* We start by bringing H and powh + powm + powl to a form such that 1 <= powh + powm + powl < 2 */ if ((powh < 1.0) || ((powh == 1.0) && (powm < 0.0))) { powh *= 2.0; powm *= 2.0; powl *= 2.0; H--; } if ((powh > 2.0) || ((powh == 2.0) && (powm >= 0.0))) { powh *= 0.5; powm *= 0.5; powl *= 0.5; H++; } /* Check now whether we have normal or subnormal rounding The rounding is subnormal iff H <= -1023 In both cases, we bring H, powh + powm + powl to a form 2^K * (th + tm + tl) = 2^H * (powh + powm + powm) * (1 + eps) where (i) |eps| <= 2^(-118 - 53) = 2^(-171) (ii) 2^(-K) * ulp(2^K * th) = 1 (iii) the rounding of 2^K * th to double precision is exact (or produces +inf) */ if (H <= -1023) { /* Subnormal rounding In this case, we can neglect powl because the rounding bit of the RN rounding is in powh */ twodb.i[HI] = (H + (1074 + 1023)) << 20; twodb.i[LO] = 0; twoH1074powh = twodb.d * powh; twoH1074powm = twodb.d * powm; shiftedpowh = two52 + twoH1074powh; th = shiftedpowh - two52; delta = twoH1074powh - th; Add12Cond(tm,tl,delta,twoH1074powm); K = -1074; } else { /* Normal rounding In this case, we have exactly: 2^K * (th + tm + tl) = 2^H * (powh + powm + powm) */ th = powh * two52; tm = powm * two52; tl = powl * two52; K = H - 52; } /* Return results for exactness case test */ *G = K; *kh = th; *kl = tm; /* Compute now delta = ABS(0.5 - ABS(tm + tl)) * (1 + eps) where |eps| <= 2^(-53) The addition 0.5 + (-ABS(tm)) is exact by Sterbenz' lemma */ if (tm > 0.0) { t1m = - tm; t1l = - tl; } else { t1m = tm; t1l = tl; } delta = ABS((0.5 + t1m) - t1l); /* We cannot decide the rounding or have an exact case iff delta <= 2^(-118) * th We can see this in the following drawing: result = round( +-----------------+------+----------...----+------------ 2^K * | th | +/-1 | 0 | delta ) +-----------------+------+----------...----+------------ | <------------- 118 bits -------------> | */ scaledth = th * PRECISEROUNDCST; if (delta > scaledth) { /* We can round exactly to nearest We must correct th to the rounding of th + tm + tl iff tm is greater in absolute value than 0.5 or if tm is equal to 0.5 in absolute value and the sign of tm and tl is equal: | | ...------|--------|--------|------... |------->--> | ^ tm tl ^ th round(th + tm + tl) If tm is negative, we must correct th by decreasing it otherwise we must correct th by increasing it. */ if (ABS(tm) >= 0.5) { if (ABS(tm) == 0.5) { if (tm < 0.0) { if (tl < 0.0) { /* The same sign of tm and tl, tm is negative */ th -= 1.0; } } else { if (tl > 0.0) { /* The same sign of tm and tl, tm is positive */ th += 1.0; } } } else { /* tm > 0.5 */ if (tm < 0.0) { th -= 1.0; } else { th += 1.0; } } } /* Perform now the multiplication 2^K * th Note that we must be able to produce (i) 0 if we have total underflow (ii) a subnormal result (iii) a normal result (iv) +inf if we have overflow in a TMD case We produce K1 + K2 = K with K1 = floor(K/2) and multiply in two steps. */ K1 = K >> 1; K2 = K - K1; twodb.i[HI] = (K1 + 1023) << 20; twodb.i[LO] = 0; two2db.i[HI] = (K2 + 1023) << 20; two2db.i[LO] = 0; *pow = two2db.d * (twodb.d * th); return 1; } /* Otherwise we return 0 because we cannot round */ return 0; } /* pow_exact_case Checks whether x^y is an exact or half-ulp case for rounding into double precision. This means the procedure checks whether x^y can be written on not more than 54 bits. The procedure uses 2^G * (kh + kl) supposing the following properties: * kh + kl holds on at most 54 bits * 2^G * kh is representable in double precision (even in the subnormal range) * 2^G * (kh + kl) approximates x^y with an error eps less than 2^(-117), i.e. 2^G * (kh + kl) = x^y * (1 + eps) where |eps| <= 2^(-117) * log2xh approximates log2(x) with an accuracy equivalent to at least 52 bits In particular log2xh is exact if x is an integer power of 2 Returns 1 if the case is exact or half-ulp Returns 0 otherwise If returning 1, affects pow with 2^G * (kh + kl) rounded to double precision */ int pow_exact_case(double *pow, double x, double y, int G, double kh, double kl, double log2xh) { db_number xdb, ydb, tempdb, shiftedEydb, temp2db; int E, F, G1, G2; double m, n, yh, yl, Eyh, Eyl, ed, Ey; double delta; double nearestEy; double value; /* For testing whether x^y is an exact or half-ulp case, we have two main cases: (i) x is an integer power of 2 (ii) x is not an integer power of 2 We start by testing if x is an integer power of 2. */ xdb.d = x; if ((xdb.i[HI] & 0xfff00000) == 0) { /* x is subnormal, scale by 2^52 */ xdb.d *= 0.4503599627370496e16; } if (((xdb.i[HI] & 0x000fffff) | xdb.i[LO]) == 0) { /* x is an integer power of 2 x^y is exact or midpoint iff log2(x) * y is integer Since we know that x is an integer power of 2, log2xh is equal to this integer. Since the exponent of the double precision number is bounded by the exponent range, we know that log2xh is integer and bounded by 2^11. It is therefore possible to split y into two parts of 21 and 32 bits, to perform the multiplication componentwise. Since the result is bounded by 2^11, it suffices to compute the nearest integer to the higher word product, and to compare the rounding difference to the low word product. This splitting is faster than the usual Dekker splitting. */ ydb.d = y; ydb.i[LO] = 0; yh = ydb.d; yl = y - yh; Eyh = log2xh * yh; Eyl = log2xh * yl; delta = ((0.6755399441055744e16 + Eyh) - 0.6755399441055744e16) - Eyh; /* addition rounds, subtractions exact */ if (delta != Eyl) return 0; } else { /* x is not an integer power of 2 We have clearly an inexact case if y is negative or if y is greater than 35 */ if ((y < 0.0) || (y > 35.0)) return 0; /* Decompose now y into y = 2^F * n Checking F and n, we can then already decide some cases using the fact that the worst-case accuracy for x^n, n in [|0;35|], is less (in bits) than the accuracy of the approximation of x^y we have already in 2^G * (kh + kl). */ decompose(&n,&F,y); if ((n > 35.0) || (F < -5)) return 0; if (F < 0) { /* Here, -5 <= F <= -1, 3 <= n <= 35, n an odd integer We decompose x into 2^E * m where m is an odd integer Let H, sh and sl such that 2^H * (sh + sl) = 2^G * (kh + kl) and sh + sl is an odd integer. If we have E * 2^F * n = H, we can apply the worst case argument because we know the worst case for m^(2^F * n) with m odd integer, -5 <= F <= -1, 3 <= n <= 35 when rounding to 53 bits in both rounding modes. E is bounded in magnitude by 2^11. 2^F * n is equal to y by construction. Since n <= 35, y contains at most 6 significant bits. The arithmetical multiplication E * y is therefore exact and less than or equal to 2^17. We check first whether E * y is an integer. If this is the case, we compute sh + sl = 2^(G - E * y) * (kh + kl). Finally, we check whether sh + sl is an odd integer. */ decompose(&m,&E,x); ed = (double) E; Ey = ed * y; /* Exact */ /* Check whether Ey is an integer using the simple shift technique The addition rounds, the substraction is exact by Sterbenz' lemma. If Ey is an integer, the low order word of shiftedEydb is equal to this integer. */ shiftedEydb.d = 0.6755399441055744e16 + Ey; nearestEy = shiftedEydb.d - 0.6755399441055744e16; if (nearestEy != Ey) return 0; /* Here E * y is integer. Produce now 2^(G - E * y). */ tempdb.i[HI] = (((G - shiftedEydb.i[LO]) + 1023) << 20); tempdb.i[LO] = 0; /* Check now if sh + sl = tempdb.d * (kh + kl) is an odd integer. Since kh and kl are not overlapped, we have two cases: (i) kl is equal to 0, in which case tempdb.d * kh must be an odd integer (ii) kl is not equal to 0, in which case tempdb.d * kl must be an odd integer */ if (kl == 0.0) value = kh; else value = kl; value *= tempdb.d; /* Exact because multiplication by positive integer power of 2 */ if (!isOddInteger(value)) return 0; /* Here the case is exact by the worst-case argument */ } /* Here, we have either F >= 0 or an exact case If F >= 0, we also have an exact case because 2^F * n = y <= 35, y therefore integer and because we can apply the worst case argument. */ } /* Here, the case is exact, affect pow with 2^G * (kh + kl) rounded to nearest in double precision Since kh + kl holds on at most 54 bits, 2^G * kh produces never any rounding error and kh and kl are not overlapping, 2^G * kh is equal to the rounding if (i) kl is equal to 0 (ii) kl is not equal to 0 and the mantissa of 2^G * kh is even If in condition (ii), kl is not equal to 0 and the mantissa of 2^G * kh is not even, we correct it depending on the sign of kl. Remark that G can be such that 2^G is no longer a normal. Produce therefore 2^(floor(G/2)) and 2^(G - floor(G/2)) and multiply in two steps. */ G1 = G >> 1; G2 = G - G1; tempdb.i[HI] = (G1 + 1023) << 20; tempdb.i[LO] = 0; temp2db.i[HI] = (G2 + 1023) << 20; temp2db.i[LO] = 0; tempdb.d *= (kh * temp2db.d); if ((kl != 0.0) && ((tempdb.i[LO] & 1) != 0)) { /* We must correct the rounding to the rounding to nearest ties to even */ if (kl > 0.0) { tempdb.l++; } else { tempdb.l++; } } *pow = tempdb.d; return 1; } double pow_exact_rn(double x, double y, double sign, int index, double ed, double zh, double zm) { int H, G; double powh, powm, powl; double pow; double kh, kl; double log2xh; pow_120(&H, &powh, &powm, &powl, &log2xh, y, index, ed, zh, zm); if (pow_round_and_check_rn(&pow,H,powh,powm,powl,&G,&kh,&kl)) return sign * pow; if (pow_exact_case(&pow,x,y,G,kh,kl,log2xh)) return sign * pow; // printf("Could not decide the rounding to nearest of power.\n"); return -5.0; } double pow_rn(double x, double y) { db_number xdb, ydb, yhdb, shiftedylog2xhMult2Ldb, powdb, twodb; double sign; int E, index; double log2FastApprox, ed, ylog2xFast, f; double yh, yl, ri, logih, logim, yrih, yril, th, zh, zm; double p_t_1_0h; double p_t_2_0h; double p_t_3_0h; double p_t_4_0h; double p_t_5_0h; double p_t_9_0h; double p_t_10_0h; double p_t_11_0h, p_t_11_0m; double p_t_12_0h, p_t_12_0m; double log2zh, log2zm; double log2yh, log2ym; double log2xh, log2xm; double ylog2xh, ylog2xm; double rh, r; int k, index1, index2, H; double tbl1, tbl2h, tbl2m; double ph; double powh, powm; double twoH1074powh, twoH1074powm; double shiftedpowh, nearestintpowh, delta, deltaint; double rest; double lowerTerms; double temp1; double zhSq, zhFour, p35, p46, p36, p7; double xSq; /* Fast rejection of special cases */ xdb.d = x; ydb.d = y; if (((((xdb.i[HI] >> 20) + 1) & 0x3ff) <= 1) || ((((ydb.i[HI] >> 20) + 1) & 0x3ff) <= 1)) { /* Handle special cases before handling NaNs and Infinities */ if (x == 1.0) return 1.0; if (y == 0.0) return 1.0; if (y == 1.0) return x; if (y == 2.0) return x * x; /* Remark: may yield uncorrect rounding on x86 for subnormal results */ if (y == -1.0) return 1 / x; if ((x == 0.0) && ((ydb.i[HI] & 0x7ff00000) != 0x7ff00000)) { /* x = +/-0 and y is neither NaN nor Infinity We have four cases (i) y < 0: (a) y odd integer: return +/- Inf and raise divide-by-zero (b) y not odd integer: return + Ind and raise divide-by-zero (ii) (a) y odd integer: return +/- 0 (b) y not odd integer: return +0 Note that y = 0.0 has already been filtered out. */ if (y < 0.0) { if (isOddInteger(y)) return 1/x; else return 1/(x * x); } else { if (isOddInteger(y)) return x; else return x * x; } } /* Handle NaNs and Infinities Note: the cases (x,y) = (1,NaN) and (x,y) = (NaN,0) have already been handled. */ if ((ydb.i[HI] & 0x7ff00000) == 0x7ff00000) { /* Here y is NaN or Inf */ if (((ydb.i[HI] & 0x000fffff) | ydb.i[LO]) != 0) { /* Here y is NaN, we return NaN */ return y; } /* Here y is +/- Inf There are three main cases: (i) x = -1: return 1 (ii) abs(x) > 1: (a) y = +Inf: return +Inf (b) y = -Inf: return +0 (iii) abs(x) < 1: (a) y = +Inf: return +0 (b) y = -Inf: return +Inf Note: the case x = 1 has already been filtered out */ if (x == -1.0) return 1.0; /* Here x != 1, x != -1 */ if ((ABS(x) > 1.0) ^ ((ydb.i[HI] & 0x80000000) == 0)) { /* abs(x) > 1 and y = -Inf or abs(x) < 1 and y = +Inf */ return 0.0; } else { /* abs(x) > 1 and y = +Inf or abs(x) < 1 and y = -Inf */ return ABS(y); } } /* Here y is neither Inf nor NaN */ if ((xdb.i[HI] & 0x7ff00000) == 0x7ff00000) { /* Here x is NaN or Inf */ if (((xdb.i[HI] & 0x000fffff) | xdb.i[LO]) != 0) { /* Here x is NaN, we return NaN */ return x; } /* Here x is +/- Inf There are two main cases: (i) x is +Inf (ii) x is -Inf */ if ((xdb.i[HI] & 0x80000000) == 0) { /* x is +Inf (a) y > 0: return +Inf (b) y < 0: return +0 Note: y = 0 has already been filtered out */ if (y > 0.0) { return x; } else { return 0.0; } } else { /* x is -Inf There are four cases: (a) y > 0: (*) y is an odd integer: return -Inf (**) y is not an odd integer: return +Inf (b) y < 0: (*) y is an odd integer: return -0 (**) y is not an odd integer: return +0 Note: y = 0 has already been filtered out */ if (y > 0.0) { if (isOddInteger(y)) { return x; } else { return -x; } } else { if (isOddInteger(y)) { return -0.0; } else { return 0.0; } } } } } /* Here both x and y are finite numbers */ /* Test now whether we have the case (-x)^y = (-1)^y * x^y where x is positive */ sign = 1.0; if (x < 0.0) { /* x is negative x^y is defined only if y is integer */ if (!isInteger(y)) { /* y is not integer return NaN and raise invalid exception */ return 0.0/0.0; } /* Here y is integer Remove the sign of x and put (-1)^y in sign */ x = -x; xdb.i[HI] &= 0x7fffffff; if (isOddInteger(y)) { sign = -sign; } } /* Here x is strictly positive and finite */ /* Test now if abs(y) is in a range giving finite, non-trivial results x^y We have x^y = 2^(y * log2(x)) = 2^(y * log2(2^E * m)) = 2^(y * (E + log2(1 + f))) We have overflow iff x^y >= 2^(1024), i.e. y * (E + log2(1 + f)) >= 1024 We have underflow (flush to zero) iff x^y <= 2^(-1076), i.e. y * (E + log2(1 + f)) <= - 1076 We round to 1.0 iff abs(y * (E + log2(1 + f))) <= 2^(-54) We approximate log2(1 + f) as log2(1 + f) = c * f * alpha(f) where c is a constant and 0.853 < alpha(f) < 1.21 So we have surely (i) overflow or underflow if abs(y * (E + c * f)) >= ceil(1076/0.853) = 1261 (ii) trivial rounding to 1.0 if abs(y * (E + c * f)) <= 2^(-55) <= 2^(-54)/1.21 */ /* We start the computation of the logarithm of x */ E = 0; if ((xdb.i[HI] & 0xfff00000) == 0) { /* x is subnormal, make it normal */ xdb.d *= two52; E = -52; } E += (xdb.i[HI]>>20)-1023; /* extract the exponent */ index = (xdb.i[HI] & 0x000fffff); xdb.i[HI] = index | 0x3ff00000; /* do exponent = 0 */ index = (index + (1<<(20-L-1))) >> (20-L); /* reduce such that sqrt(2)/2 < xdb.d < sqrt(2) */ if (index >= MAXINDEX) { /* corresponds to xdb>sqrt(2)*/ xdb.i[HI] -= 0x00100000; E++; } ed = (double) E; /* Continue with the exact range reduction of the logarithm of x */ yhdb.i[HI] = xdb.i[HI]; yhdb.i[LO] = 0; yh = yhdb.d; yl = xdb.d - yh; /* Special handling for y = 3 or y = 4 and x on not more than 21 bits (without subnormals) */ if ((yl == 0) && ((y == 3.0) || (y == 4.0)) && (E > -255)) { if (y == 3.0) return sign * (x * (x * x)); else { xSq = x * x; return sign * (xSq * xSq); } } index = index & INDEXMASK; /* Now we have log2(x) = E + log2(xdb.d) with sqrt(2)/2 < xdb.d < sqrt(2) Compute now f such that 1 + f = xdb.d and approximate log2(1 + f) = logFastCoeff * f */ f = xdb.d - 1.0; log2FastApprox = ed + logFastCoeff * f; ylog2xFast = y * log2FastApprox; if (ABS(ylog2xFast) >= 1261.0) { if (ylog2xFast > 0.0) { /* y * log2(x) is positive, i.e. we overflow */ return (sign * LARGEST) * LARGEST; } else { /* y * log2(x) is negative, i.e. we underflow */ return (sign * SMALLEST) * SMALLEST; } } if (ABS(ylog2xFast) <= twoM55) { /* abs(y * log2(x)) <= 2^(-55), we return 1.0 and set the inexact flag */ return sign * (1.0 + SMALLEST); } /* Now, we may still overflow or underflow but on some inputs only */ /* Read tables: Read one float for ri Read the first two doubles for -log(r_i) (out of three) Organization of the table: one struct entry per index, the struct entry containing r, logih, logim and logil in this order */ ri = argredtable[index].ri; /* Actually we don't need the logarithm entries now Move the following two lines to the eventual reconstruction As long as we don't have any if in the following code, we can overlap memory access with calculations */ logih = argredtable[index].logih; logim = argredtable[index].logim; /* Do range reduction: zh + zm = y * ri - 1.0 correctly Correctness is assured by use of two part yh + yl and 21 bit ri and Add12 Discard zl for higher monome degrees */ yrih = yh * ri; yril = yl * ri; th = yrih - 1.0; Add12Cond(zh, zm, th, yril); /* Polynomial approximation of log2(1 + (zh + zm)) */ zhSq = zh * zh; p35 = log2_70_p_coeff_3h + zhSq * log2_70_p_coeff_5h; p46 = log2_70_p_coeff_4h + zhSq * log2_70_p_coeff_6h; zhFour = zhSq * zhSq; p36 = p35 + zh * p46; p7 = log2_70_p_coeff_7h * zhFour; p_t_9_0h = p36 + p7; p_t_10_0h = p_t_9_0h * zh; Add212(&p_t_11_0h,&p_t_11_0m,log2_70_p_coeff_2h,log2_70_p_coeff_2m,p_t_10_0h); MulAdd22(&p_t_12_0h,&p_t_12_0m,log2_70_p_coeff_1h,log2_70_p_coeff_1m,zh,zm,p_t_11_0h,p_t_11_0m); Mul22(&log2zh,&log2zm,p_t_12_0h,p_t_12_0m,zh,zm); /* Reconstruction */ Add122(&log2yh,&log2ym,ed,logih,logim); Add22(&log2xh,&log2xm,log2yh,log2ym,log2zh,log2zm); /* Produce ylog2xh + ylog2xm approximating y * log2(x) Note: neither y nor y * log2(x) may not be subnormal and non-zero because of the fast overflow/underflow/trivial rounding test. */ Mul12(&ylog2xh,&temp1,y,log2xh); ylog2xm = temp1 + y * log2xm; /* Approximate now 2^(y * log2(x)) We have 2^(ylog2xh + ylog2xm) = 2^ylog2xh * 2^ylog2xm = 2^H * 2^(ylog2xh - H) * 2^ylog2xm = 2^H * 2^(i2/2^8) * 2^(i1/2^13) * 2^(ylog2xh - H - i2/2^8 - i1/2^13) * 2^ylog2xm = 2^H * tbl2[i2] * (1 + tbl1[i1]) * (1 + p(rh)) + delta where rh \approx ylog2xh - H - i1/2^7 - i2/2^13 + ylog2xm */ shiftedylog2xhMult2Ldb.d = shiftConstTwoM13 + ylog2xh; r = ylog2xh - (shiftedylog2xhMult2Ldb.d - shiftConstTwoM13); k = shiftedylog2xhMult2Ldb.i[LO]; H = k >> 13; index1 = k & INDEXMASK1; index2 = (k & INDEXMASK2) >> 5; /* Renormalize reduced argument This operation produces an error 2^(z * (1 + eps)) = 2^z * (1 + eps') where |eps| <= 2^(-53) and |eps'| <= 2^(-65) */ rh = r + ylog2xm; /* Table reads */ tbl1 = twoPowerIndex1[index1].hiM1; tbl2h = twoPowerIndex2[index2].hi; tbl2m = twoPowerIndex2[index2].mi; /* Polynomial approximation */ p_t_1_0h = exp2_p_coeff_3h; p_t_2_0h = p_t_1_0h * rh; p_t_3_0h = exp2_p_coeff_2h + p_t_2_0h; p_t_4_0h = p_t_3_0h * rh; p_t_5_0h = exp2_p_coeff_1h + p_t_4_0h; ph = p_t_5_0h * rh; /* Reconstruction */ lowerTerms = tbl1 + (ph + tbl1 * ph); Add212(&powh,&powm,tbl2h,tbl2m,tbl2h * lowerTerms); /* Here we have 2^H * (powh + powm) = x^y * (1 + eps) with ||eps|| <= 2^(-60) Check first if we overflow or underflow. Check then if we can perform normal rounding or if we must perhaps perform subnormal rounding. We are sure that 0.5 <= powh + powm <= 4.0 */ if (H >= 1025) { /* Here, we surely overflow Return sign * inf */ return (sign * LARGEST) * LARGEST; } if (H <= -1077) { /* Here, we surely underflow Return sign * 0 and set inexact flag */ return (sign * SMALLEST) * SMALLEST; } if (H > -1022) { /* We are sure to be able to perform normal rounding We must still be aware of the fact that the final result may overflow */ if(powh == (powh + (powm * RNROUNDCST))) { powdb.d = powh; if (H < 1023) { powdb.i[HI] += H << 20; return sign * powdb.d; } else { /* May overflow: multiply by 2^H in two steps */ powdb.i[HI] += (H - 3) << 20; return sign * powdb.d * 8.0; } } } else { /* We must perhaps perform subnormal rounding We start by renormalizing the double-double powh + powm such that 1 <= powh + powm < 2 */ if ((powh < 1.0) || ((powh == 1.0) && (powm < 0.0))) { powh *= 2.0; powm *= 2.0; H--; } if ((powh > 2.0) || ((powh == 2.0) && (powm >= 0.0))) { powh *= 0.5; powm *= 0.5; H++; } /* Here we know that 1 <= powh + powm < 2 2^H * (powh + powm) is subnormal or equal to the least normal iff H <= -1023 */ if (H > -1023) { /* We have nevertheless normal rounding */ if(powh == (powh + (powm * RNROUNDCST))) { powdb.d = powh; powdb.i[HI] += H << 20; return sign * powdb.d; } /* Here we have normal rounding but could not decide the rounding */ } else { /* We have surely denormal rounding This means round(2^H * (powh + powm)) = 2^(-1074) * nearestint(2^(+1074) * 2^H * (powh + powm)) We compute the rounding (and test its TMD) of nearestint(2^(H + 1074) * (powh + powm)) by computing first nearestint(2^(H + 1074) * powh) and then the absolute error delta = 2^(H + 1074) * powh - nearestint(2^(H + 1074) * powh) + 2^(H + 1074) * powl We can then refute or correct the rounding by tests on delta. We know that 2^(H + 1074) <= 2^(51) and powh <= 2.0. Thus 2^(H + 1074) * powh <= 2^(52) We can hence compute nearestint using the shift trick. We start by constructing 2^(H + 1074) */ twodb.i[HI] = (H + (1074 + 1023)) << 20; twodb.i[LO] = 0; twoH1074powh = twodb.d * powh; twoH1074powm = twodb.d * powm; shiftedpowh = two52 + twoH1074powh; nearestintpowh = shiftedpowh - two52; deltaint = twoH1074powh - nearestintpowh; /* The next addition produces a very small rounding error we must account for in the rounding test. */ delta = deltaint + twoH1074powm; /* Correct now the rounding */ if (ABS(delta) > 0.5) { /* ABS(delta) > 0.5 */ if (delta > 0.0) { /* nearestintpowh is too small by 1.0 */ nearestintpowh += 1.0; /* exact */ delta -= 1.0; /* exact */ } else { /* nearestintpowh is too great by 1.0 */ nearestintpowh -= 1.0; /* exact */ delta += 1.0; /* exact */ } } /* Perform now the rounding test This test filters out also half-ulp exact cases. Exact cases are not filtered out because C99 allows setting the underflow and/or inexact flags also for exact cases. Compute first rest = abs(0.5 - abs(delta)) * (1 + eps) where abs(eps) <= 2^(-53) We cannot decide the rounding if rest <= 2^(H + 1074) * epsmax * 2 where epsmax is the bound for the approximating polynomials, here epsmax = 2^(-60) as follows by the following drawing 2^52 2^(H + 1074) 2^0 2^(H + 1074) * epsmax +-------------------+----------------+---+------... | | 0 ... 0 | nearestintpowh | 1 | rest +-------------------+----------------+---+------... | | <---- 60 bits approx. ------->| This means that we cannot decide the rounding if rest * 1/epsmax * 0.5 <= 2^(H + 1074) We store 1/epsmax * 0.5 on SUBNORMROUNDCST */ rest = ABS(0.5 - ABS(delta)); if (rest * SUBNORMROUNDCST > twodb.d) { /* Here we could decide the rounding The result to return is sign * 2^(-1074) * nearestintpowh which is either subnormal or equal to the least normal. Since we know that the multiplication does not imply any rounding error, we can perform it using the shift trick and a mask. This trick yields to a 200 cycle speed-up on Athlon. */ twodb.d = nearestintpowh + two52; twodb.i[HI] = (twodb.i[HI] + (1 << 20)) & 0x001fffff; return sign * twodb.d; } } } /* If we are here, we could not decide the rounding or are half-ulp Launch now exacter phases and exact and half-ulp testing */ return pow_exact_rn(x,y,sign,index,ed,zh,zm); } interval-2.1.0/src/crlibm/pow.h0000755000000000000000000053073013031036767014522 0ustar 00000000000000 #define L 8 #define MAXINDEX 106 #define INDEXMASK 255 #define two52 4.50359962737049600000000000000000000000000000000000e+15 #define twoM55 0.277555756156289135105907917022705078125e-16 #define logFastCoeff 0.14142135623730951454746218587388284504413604736328125e1 #define LARGEST 0.898846567431157953864652595394512366808988489471153286e308 #define SMALLEST 0.222507385850720138309023271733240406421921598046233183e-307 #define shiftConst 6.75539944105574400000000000000000000000000000000000e+15 #define shiftConstTwoM13 0.824633720832e12 #define two13 8192.0 #define twoM13 0.1220703125e-3 #define INDEXMASK1 0x1f #define INDEXMASK2 0x1fe0 #define RNROUNDCST 1.01587301587301598581442042834326647273327977070694e+00 #define RDROUNDCST 8.67361737988403547205962240695953369140625000000000e-19 #define SUBNORMROUNDCST 0.576460752303423488e18 #define PRECISEROUNDCST 0.300926553810505602039996553528894893521578382533654405506e-35 #define twoM1000 0.933263618503218878990089544723817169617091446371708024622e-301 #define twoM74 0.5293955920339377119177015629247762262821197509765625e-22 #define log2_70_p_coeff_1h 1.44269504088896338700465094007086008787155151367187500000000000000000000000000000e+00 #define log2_70_p_coeff_1m 2.03552810625246160186433312051638360278748036817121624952875436065369285643100739e-17 #define log2_70_p_coeff_2h -7.21347520444481693502325470035430043935775756835937500000000000000000000000000000e-01 #define log2_70_p_coeff_2m -1.12725594936749318924493788526353267792267647960831322695440803727251477539539337e-17 #define log2_70_p_coeff_3h 4.80898346962987777164499902937677688896656036376953125000000000000000000000000000e-01 #define log2_70_p_coeff_4h -3.60673760219944627980481755002983845770359039306640625000000000000000000000000000e-01 #define log2_70_p_coeff_5h 2.88539008191916690471146011987002566456794738769531250000000000000000000000000000e-01 #define log2_70_p_coeff_6h -2.40450377363966349975044067832641303539276123046875000000000000000000000000000000e-01 #define log2_70_p_coeff_7h 2.06097743969525126761510591677506454288959503173828125000000000000000000000000000e-01 #define log2_130_p_coeff_1h 1.44269504088896338700465094007086008787155151367187500000000000000000000000000000e+00 #define log2_130_p_coeff_1m 2.03552737409310331110210900522069120325603861485809498166332787150167860090732574e-17 #define log2_130_p_coeff_1l -1.06146602236896146263026926064664797993065100369094413909960470044754680755528179e-33 #define log2_130_p_coeff_2h -7.21347520444481693502325470035430043935775756835937500000000000000000000000000000e-01 #define log2_130_p_coeff_2m -1.01776368704655165555105450261034560162801930742904749083166393575083930045366287e-17 #define log2_130_p_coeff_2l 5.34511411595447028630249611725927839300757516466699521565482986252038599158936192e-34 #define log2_130_p_coeff_3h 4.80898346962987777164499902937677688896656036376953125000000000000000000000000000e-01 #define log2_130_p_coeff_3m 2.52888083240629533774008911522493092191867953828603166055444262383389286696910858e-17 #define log2_130_p_coeff_4h -3.60673760222240846751162735017715021967887878417968750000000000000000000000000000e-01 #define log2_130_p_coeff_4m -5.08881843525388804036113375504277575334378429174238267496122034572181291878223419e-18 #define log2_130_p_coeff_5h 2.88539008177792655196469695511041209101676940917968750000000000000000000000000000e-01 #define log2_130_p_coeff_5m 2.62755152398073847756639381346527463413965059531741258469494937344279605895280838e-17 #define log2_130_p_coeff_6h -2.40449173481493888582249951468838844448328018188476562500000000000000000000000000e-01 #define log2_130_p_coeff_6m -1.26443692756777278172382591559880426333181716128670549204038309198949718847870827e-17 #define log2_130_p_coeff_7h 2.06099291555566194178439332063135225325822830200195312500000000000000000000000000e-01 #define log2_130_p_coeff_7m 6.87383539895312875323064204102239130058263040989538494862642892258008942008018494e-18 #define log2_130_p_coeff_8h -1.80336880111120451131156983137771021574735641479492187500000000000000000000000000e-01 #define log2_130_p_coeff_9h 1.60299448987662213061966554050741251558065414428710937500000000000000000000000000e-01 #define log2_130_p_coeff_10h -1.44269504079917953998091206813114695250988006591796875000000000000000000000000000e-01 #define log2_130_p_coeff_11h 1.31154094707513962925204964449221733957529067993164062500000000000000000000000000e-01 #define log2_130_p_coeff_12h -1.20226134447525057069583453994709998369216918945312500000000000000000000000000000e-01 #define log2_130_p_coeff_13h 1.10970553702962271280796358041698113083839416503906250000000000000000000000000000e-01 #define exp2_p_coeff_0h 1.00000000000000000000000000000000000000000000000000000000000000000000000000000000e+00 #define exp2_p_coeff_1h 6.93147180559945286226763982995180413126945495605468750000000000000000000000000000e-01 #define exp2_p_coeff_2h 2.40226506988959309651932017004583030939102172851562500000000000000000000000000000e-01 #define exp2_p_coeff_3h 5.55041161373122232669530262683110777288675308227539062500000000000000000000000000e-02 #define exp2_120_p_coeff_0h 1.00000000000000000000000000000000000000000000000000000000000000000000000000000000e+00 #define exp2_120_p_coeff_1h 6.93147180559945286226763982995180413126945495605468750000000000000000000000000000e-01 #define exp2_120_p_coeff_1m 2.31904681384630849473271303648771975481164951834144039022334027322358451783657074e-17 #define exp2_120_p_coeff_2h 2.40226506959100721827482516346208285540342330932617187500000000000000000000000000e-01 #define exp2_120_p_coeff_2m -9.49393125283880586293948324833484500178580834723511897021985816991218598559498787e-18 #define exp2_120_p_coeff_3h 5.55041086648215831189645541599020361900329589843750000000000000000000000000000000e-02 #define exp2_120_p_coeff_3m -3.16600969138004600291955060443412194788085531170366074271704803777538472786545753e-18 #define exp2_120_p_coeff_4h 9.61812910762847687873300372984886053018271923065185546875000000000000000000000000e-03 #define exp2_120_p_coeff_5h 1.33335581474269999902038108530177851207554340362548828125000000000000000000000000e-03 #define exp2_120_p_coeff_6h 1.54035356831810422203327126666749791183974593877792358398437500000000000000000000e-04 #define exp2_82_coeff_0h 1.00000000000000000000000000000000000000000000000000000000000000000000000000000000e+00 #define exp2_82_coeff_1h 6.93147180559945286226763982995180413126945495605468750000000000000000000000000000e-01 #define exp2_82_coeff_1m 2.31846856407130082392820712925655671368021772333137264787694675760576501488685608e-17 #define exp2_82_coeff_2h 2.40226506959100721827482516346208285540342330932617187500000000000000000000000000e-01 #define exp2_82_coeff_3h 5.55041086710304984452868382049928186461329460144042968750000000000000000000000000e-02 #define exp2_82_coeff_4h 9.61812619551964329001059184065525187179446220397949218750000000000000000000000000e-03 typedef struct rri_tag {float ri; double logih; double logim; double logil;} rri; static const rri argredtable[256] = { { 1.00000000000000000000000000000000000000000000000000e+00, /* r[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logih[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logim[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* logil[0] */ } , { 9.96109008789062500000000000000000000000000000000000e-01, /* r[1] */ 5.62446320255523789233276232835123664699494838714600e-03, /* logih[1] */ 3.64310694089194558034258095993109791807285384624700e-19, /* logim[1] */ -1.96284275232340525914596195720627417731891367064553e-35, /* logil[1] */ } , { 9.92248535156250000000000000000000000000000000000000e-01, /* r[2] */ 1.12265674928146846900389732581970747560262680053711e-02, /* logih[2] */ -2.01837061736057419181201412747877981301873905342571e-19, /* logim[2] */ -8.76276359130307718472217510144964999205167740057366e-36, /* logil[2] */ } , { 9.88416671752929687500000000000000000000000000000000e-01, /* r[3] */ 1.68087498900021219128131377829049597494304180145264e-02, /* logih[3] */ 3.96046463581792988288086065543694985501952808182690e-19, /* logim[3] */ -7.50175900227718281636157827566620605518389361772661e-36, /* logil[3] */ } , { 9.84615325927734375000000000000000000000000000000000e-01, /* r[4] */ 2.23678990197825021402078249366240925155580043792725e-02, /* logih[4] */ 2.72546008943383898172980491432198212129681766980967e-19, /* logim[4] */ 8.65193903240721388373038654840463886141894144823057e-36, /* logil[4] */ } , { 9.80842590332031250000000000000000000000000000000000e-01, /* r[5] */ 2.79064695222518803496836170552342082373797893524170e-02, /* logih[5] */ -1.06035466460511973857716476431794431849741915846778e-18, /* logim[5] */ 1.40399476841784981797309256958923855448288750735528e-35, /* logil[5] */ } , { 9.77099418640136718750000000000000000000000000000000e-01, /* r[6] */ 3.34227328145833349481996776830783346667885780334473e-02, /* logih[6] */ -2.30264185180544573536858875991075869298703226281026e-18, /* logim[6] */ -1.54328657939112637118099481931192082521169355752646e-34, /* logil[6] */ } , { 9.73383903503417968750000000000000000000000000000000e-01, /* r[7] */ 3.89191773983389929791876227227476192638278007507324e-02, /* logih[7] */ 2.25448778888568193693198665534250833992067200909314e-18, /* logim[7] */ -1.66706958554093095538277426422752915572221541711786e-35, /* logil[7] */ } , { 9.69696998596191406250000000000000000000000000000000e-01, /* r[8] */ 4.43940763627913639877142770728823961690068244934082e-02, /* logih[8] */ -1.35148268469329738787933054025463561212703774709647e-18, /* logim[8] */ -9.30542106567779590725369440921408781707570437070629e-36, /* logil[8] */ } , { 9.66037750244140625000000000000000000000000000000000e-01, /* r[9] */ 4.98485279527303287716577528954076115041971206665039e-02, /* logih[9] */ 6.99684078718519819164474461192556823314757766482007e-19, /* logim[9] */ -2.43070079250460900406108506315855413208920069880071e-35, /* logil[9] */ } , { 9.62406158447265625000000000000000000000000000000000e-01, /* r[10] */ 5.52822205228920421360427894796885084360837936401367e-02, /* logih[10] */ -2.28041829375459011783136992188608860381451027094727e-18, /* logim[10] */ 2.92509524765364940130250242310369777453156638429065e-35, /* logil[10] */ } , { 9.58801269531250000000000000000000000000000000000000e-01, /* r[11] */ 6.06962756528966682068038096531381597742438316345215e-02, /* logih[11] */ -2.30575104391021062016554403718699744533879233050506e-18, /* logim[11] */ -7.17933773994063224992733787486043953294734193934224e-35, /* logil[11] */ } , { 9.55224037170410156250000000000000000000000000000000e-01, /* r[12] */ 6.60889539816468807309490784973604604601860046386719e-02, /* logih[12] */ -3.43531319808022917726081135288707689815983878236052e-18, /* logim[12] */ -1.33537440950953098282350657111014906210298802453012e-34, /* logil[12] */ } , { 9.51672554016113281250000000000000000000000000000000e-01, /* r[13] */ 7.14628301345319461024274687588331289589405059814453e-02, /* logih[13] */ 2.85019564755822761568469835817513709577072221641996e-18, /* logim[13] */ -9.19067891131942166039810480616019695600822882350246e-37, /* logil[13] */ } , { 9.48147773742675781250000000000000000000000000000000e-01, /* r[14] */ 7.68161667434743566929000735399313271045684814453125e-02, /* logih[14] */ -1.06503850285483291664763275879140215046738161101689e-18, /* logim[14] */ -7.65539408485798958761020119630194135239837477350922e-35, /* logil[14] */ } , { 9.44649696350097656250000000000000000000000000000000e-01, /* r[15] */ 8.21486597674154217507691555510973557829856872558594e-02, /* logih[15] */ 1.05949179068992293701743882962947866868089440388204e-18, /* logim[15] */ -8.01871606400843361947793952324428287361058018241436e-35, /* logil[15] */ } , { 9.41176414489746093750000000000000000000000000000000e-01, /* r[16] */ 8.74629272416674041767947755943168886005878448486328e-02, /* logih[16] */ -1.77710701464998942664649859987232463493014273104014e-18, /* logim[16] */ -1.80956122292284222227087580389487512155443759846534e-35, /* logil[16] */ } , { 9.37728881835937500000000000000000000000000000000000e-01, /* r[17] */ 9.27572269111804487140560127045318949967622756958008e-02, /* logih[17] */ -5.27591334713426660094475417460021043346056467758629e-18, /* logim[17] */ -1.53175520932242863184799310580698131125491486503283e-34, /* logil[17] */ } , { 9.34306144714355468750000000000000000000000000000000e-01, /* r[18] */ 9.80327386445321302677058383778785355389118194580078e-02, /* logih[18] */ -5.93734060789694089615179387615749478380374593921383e-19, /* logim[18] */ 3.22072168497817739835267264564341161078059188303423e-35, /* logil[18] */ } , { 9.30909156799316406250000000000000000000000000000000e-01, /* r[19] */ 1.03287706297326614679477074787428136914968490600586e-01, /* logih[19] */ 1.33325264360904317354548306659732409559419348498273e-18, /* logim[19] */ 3.31890629684034024636090527929623831396401127155796e-36, /* logil[19] */ } , { 9.27536010742187500000000000000000000000000000000000e-01, /* r[20] */ 1.08524800743511784517636442615184932947158813476562e-01, /* logih[20] */ -1.28671557844966439678563543759408610236814325233478e-18, /* logim[20] */ -2.56854731168380358630388572766888073135733818319681e-35, /* logil[20] */ } , { 9.24187660217285156250000000000000000000000000000000e-01, /* r[21] */ 1.13742268163890894450140933713555568829178810119629e-01, /* logih[21] */ -8.77036301522305748474920477842609739773359932085098e-19, /* logim[21] */ 8.57410843683479675757388920826360661070052891897777e-35, /* logil[21] */ } , { 9.20863151550292968750000000000000000000000000000000e-01, /* r[22] */ 1.18941319948589224742008241264557000249624252319336e-01, /* logih[22] */ 4.19531239651888390161555205120491536470911709375714e-18, /* logim[22] */ -2.32937303080172707430415739969539325535648073239647e-34, /* logil[22] */ } , { 9.17562484741210937500000000000000000000000000000000e-01, /* r[23] */ 1.24121688041285385684098230285599129274487495422363e-01, /* logih[23] */ 9.00256823026971617398245077356557223480847847208472e-19, /* logim[23] */ 6.70088260119589436198762199150551511628184558421695e-35, /* logil[23] */ } , { 9.14285659790039062500000000000000000000000000000000e-01, /* r[24] */ 1.29283102936294441720477266244415659457445144653320e-01, /* logih[24] */ 7.73743323061072771474411865735142118226773038589797e-18, /* logim[24] */ 7.00151503950389057387088983272314894406637587361574e-34, /* logil[24] */ } , { 9.11031723022460937500000000000000000000000000000000e-01, /* r[25] */ 1.34426803922212734221375285414978861808776855468750e-01, /* logih[25] */ 2.87442943483450917166131039871184389070859209874820e-18, /* logim[25] */ 1.07418394159169377416152150989201926752424104438080e-34, /* logil[25] */ } , { 9.07801628112792968750000000000000000000000000000000e-01, /* r[26] */ 1.39551019182446001121178369430708698928356170654297e-01, /* logih[26] */ -1.30334047193679924727952135062206194795888829424720e-17, /* logim[26] */ 7.66296121586659828803741925222999984250452285658724e-34, /* logil[26] */ } , { 9.04593467712402343750000000000000000000000000000000e-01, /* r[27] */ 1.44658516929258157412974128419591579586267471313477e-01, /* logih[27] */ 1.38592310231888602734839275401641903151588210621318e-17, /* logim[27] */ 7.04204624169239561960113974223630631428167482568361e-34, /* logil[27] */ } , { 9.01408195495605468750000000000000000000000000000000e-01, /* r[28] */ 1.49747527963535687067775370451272465288639068603516e-01, /* logih[28] */ -4.63121585254300608564541809516560465960812790456487e-18, /* logim[28] */ -2.38375164082682849282198954173370103452053181545581e-34, /* logil[28] */ } , { 8.98245811462402343750000000000000000000000000000000e-01, /* r[29] */ 1.54817791959126344059072266645671334117650985717773e-01, /* logih[29] */ -1.97608219816229633690476653766429513925576435617957e-18, /* logim[29] */ -7.29293250516190589410842756372025648233179264971183e-35, /* logil[29] */ } , { 8.95105361938476562500000000000000000000000000000000e-01, /* r[30] */ 1.59870584354488087797108164522796869277954101562500e-01, /* logih[30] */ 1.38164327179219532318047293404835044148743773120749e-17, /* logim[30] */ 2.60902789861922854258976768649749081077445016828227e-34, /* logil[30] */ } , { 8.91985893249511718750000000000000000000000000000000e-01, /* r[31] */ 1.64907200773063644660965110233519226312637329101562e-01, /* logih[31] */ 6.40258479048132435575035617265253227017927489659503e-18, /* logim[31] */ -3.13994360424306793167722791429686820377012800164626e-36, /* logil[31] */ } , { 8.88889312744140625000000000000000000000000000000000e-01, /* r[32] */ 1.69924313511872926429902008749195374548435211181641e-01, /* logih[32] */ 6.27897206252693367521427657669679268044418008293354e-19, /* logim[32] */ -1.84662823838719713889061260700783214693984580501609e-35, /* logil[32] */ } , { 8.85812759399414062500000000000000000000000000000000e-01, /* r[33] */ 1.74926316686843275061136182557675056159496307373047e-01, /* logih[33] */ -1.28095711942361950784467450834305264934252560279915e-17, /* logim[33] */ 6.15728414357675841500352304615531898144676821521735e-34, /* logil[33] */ } , { 8.82759094238281250000000000000000000000000000000000e-01, /* r[34] */ 1.79908316093213171971143538030446507036685943603516e-01, /* logih[34] */ -4.05669244508450884106169713651948436101460999171934e-18, /* logim[34] */ -2.73456623470470858112008354603047232113150522790287e-34, /* logil[34] */ } , { 8.79725456237792968750000000000000000000000000000000e-01, /* r[35] */ 1.84874735594675820848920011485461145639419555664062e-01, /* logih[35] */ 7.83038695439828504402955103668931677062328445957555e-18, /* logim[35] */ 6.50239128030890104986149271144609240438163759169796e-34, /* logil[35] */ } , { 8.76712799072265625000000000000000000000000000000000e-01, /* r[36] */ 1.89823784958295938007921677126432769000530242919922e-01, /* logih[36] */ -8.81954617013802931471562955085007459413223371703754e-18, /* logim[36] */ 4.68176162545611138840109682829353162004456293635899e-34, /* logil[36] */ } , { 8.73720169067382812500000000000000000000000000000000e-01, /* r[37] */ 1.94756800677670482979664257072727195918560028076172e-01, /* logih[37] */ -2.00670924345318825647424200264947046592235601474052e-18, /* logim[37] */ 1.23510776676180725049881134754892221509956109351828e-34, /* logil[37] */ } , { 8.70748519897460937500000000000000000000000000000000e-01, /* r[38] */ 1.99671979373277602709535472058632876724004745483398e-01, /* logih[38] */ -3.35041803578082878314072229510113791314884693559175e-19, /* logim[38] */ 2.19585849692745582866688760428854814221266519680553e-36, /* logil[38] */ } , { 8.67796897888183593750000000000000000000000000000000e-01, /* r[39] */ 2.04570665922535199765519564607529900968074798583984e-01, /* logih[39] */ -1.04751553531138287440354969580963337427221634013275e-17, /* logim[39] */ -4.69171037663777474441792299191703931076443660125798e-34, /* logil[39] */ } , { 8.64865303039550781250000000000000000000000000000000e-01, /* r[40] */ 2.09452634702868761840122147077636327594518661499023e-01, /* logih[40] */ 1.10703702929617688876102394158665802371341635353943e-17, /* logim[40] */ -7.14976977668988171404204188299765278177460282467036e-34, /* logil[40] */ } , { 8.61952781677246093750000000000000000000000000000000e-01, /* r[41] */ 2.14319255162218030852372407935035880655050277709961e-01, /* logih[41] */ 1.29702313007778250478283769152847492223363745647243e-17, /* logim[41] */ 5.73068113001992288619079890329675696690665640594386e-34, /* logil[41] */ } , { 8.59060287475585937500000000000000000000000000000000e-01, /* r[42] */ 2.19168713942656773197015240839391481131315231323242e-01, /* logih[42] */ -7.04698144913766631623882809355752075602951087972227e-18, /* logim[42] */ -6.81063628416184547095854182554280736255034389907768e-34, /* logil[42] */ } , { 8.56186866760253906250000000000000000000000000000000e-01, /* r[43] */ 2.24002389001174750937650514970300719141960144042969e-01, /* logih[43] */ 9.77089146727803082940117001653944079518215379270970e-18, /* logim[43] */ -5.15654043774815198603423123107750339552695455461599e-34, /* logil[43] */ } , { 8.53333473205566406250000000000000000000000000000000e-01, /* r[44] */ 2.28818454019755312955908266303595155477523803710938e-01, /* logih[44] */ 8.60482840827231531693211061331421783325499374269103e-18, /* logim[44] */ 4.62159649315070967905902800219645706522346592477674e-34, /* logil[44] */ } , { 8.50498199462890625000000000000000000000000000000000e-01, /* r[45] */ 2.33619913235866366596482635031861718744039535522461e-01, /* logih[45] */ -3.17603438795656722833659731362733461077382072175793e-18, /* logim[45] */ -1.14190998511637372945280226124717188573979535104549e-34, /* logil[45] */ } , { 8.47681999206542968750000000000000000000000000000000e-01, /* r[46] */ 2.38404943554491266510808600287418812513351440429688e-01, /* logih[46] */ -4.91919207875165757062252476472896320156113810759041e-18, /* logim[46] */ -1.65774202516213266221949772053971269011961846039958e-34, /* logil[46] */ } , { 8.44884872436523437500000000000000000000000000000000e-01, /* r[47] */ 2.43173327789243498564530909789027646183967590332031e-01, /* logih[47] */ 4.93306440425329257306593810775031695904319815014754e-18, /* logim[47] */ -1.13614580751390656792590805859574652593001401554151e-34, /* logil[47] */ } , { 8.42104911804199218750000000000000000000000000000000e-01, /* r[48] */ 2.47928115382989089354737188841681927442550659179688e-01, /* logih[48] */ -1.37712103635557072032234153365222440536782865715083e-18, /* logim[48] */ 9.75493887073081889286766097804801019201793778479461e-36, /* logil[48] */ } , { 8.39344024658203125000000000000000000000000000000000e-01, /* r[49] */ 2.52665840909102268341257513384334743022918701171875e-01, /* logih[49] */ -2.29689231346274680410439539616369605449817860326088e-17, /* logim[49] */ -5.60202341060166161523536551099252965521444882693529e-34, /* logil[49] */ } , { 8.36601257324218750000000000000000000000000000000000e-01, /* r[50] */ 2.57387928683979749777677170641254633665084838867188e-01, /* logih[50] */ 1.55294884781987048139059464306453784663352757128198e-17, /* logim[50] */ 1.01380707456162023479965432916465584034071816674502e-33, /* logil[50] */ } , { 8.33876609802246093750000000000000000000000000000000e-01, /* r[51] */ 2.62094173563105881097357041653594933450222015380859e-01, /* logih[51] */ -8.55713950348344689585298731473352525543751015890334e-18, /* logim[51] */ 5.48763060317488000144168502344734048354142056565485e-34, /* logil[51] */ } , { 8.31169128417968750000000000000000000000000000000000e-01, /* r[52] */ 2.66786024747041050630969039048068225383758544921875e-01, /* logih[52] */ -1.67542241678008684495879286127707515841429324510332e-17, /* logim[52] */ -1.84450647715786516704590189681050172449564734674026e-34, /* logil[52] */ } , { 8.28478813171386718750000000000000000000000000000000e-01, /* r[53] */ 2.71463291252832750188872523722238838672637939453125e-01, /* logih[53] */ -1.82861289604292083819624352321660587975949022128451e-17, /* logim[53] */ 1.41344704609359941327335627738873295910710446946318e-33, /* logil[53] */ } , { 8.25806617736816406250000000000000000000000000000000e-01, /* r[54] */ 2.76124115053543395248425440513528883457183837890625e-01, /* logih[54] */ 2.16585493379379121431927795059778160498079515320280e-17, /* logim[54] */ 8.60215787486055402643372799849720707717258614661468e-34, /* logil[54] */ } , { 8.23151588439941406250000000000000000000000000000000e-01, /* r[55] */ 2.80769958587697043839170873980037868022918701171875e-01, /* logih[55] */ -7.49945068305251944743518556464975251268962220130981e-18, /* logim[55] */ -3.35683654241982931982204205181485008542845495662437e-34, /* logil[55] */ } , { 8.20512771606445312500000000000000000000000000000000e-01, /* r[56] */ 2.85402304853576316290286740695592015981674194335938e-01, /* logih[56] */ 1.97058866076428412478768008134629487975209602250437e-17, /* logim[56] */ 1.06837698553508766117432923132263183155168973782721e-33, /* logil[56] */ } , { 8.17891120910644531250000000000000000000000000000000e-01, /* r[57] */ 2.90019293012687973121188633740530349314212799072266e-01, /* logih[57] */ 2.56668340633873322360015168072740173815474168247740e-19, /* logim[57] */ 1.32070461247422232763959137046376896815849857773214e-35, /* logil[57] */ } , { 8.15286636352539062500000000000000000000000000000000e-01, /* r[58] */ 2.94620727393795800441722576579195447266101837158203e-01, /* logih[58] */ 8.28856253528690669390956178529769851637375900355867e-18, /* logim[58] */ 9.21060163289173545842870657414802261911841193726753e-35, /* logil[58] */ } , { 8.12698364257812500000000000000000000000000000000000e-01, /* r[59] */ 2.99208104378606787321359661291353404521942138671875e-01, /* logih[59] */ 2.50440287234594231108545303202106361171199143807143e-17, /* logim[59] */ 5.76496224108896237321806536123506494667013214131283e-34, /* logil[59] */ } , { 8.10126304626464843750000000000000000000000000000000e-01, /* r[60] */ 3.03781242627308878390124391444260254502296447753906e-01, /* logih[60] */ 7.26236946156037909713854903168533397481837663535236e-18, /* logim[60] */ -5.13832288823633829539789242568260267295555917557936e-34, /* logil[60] */ } , { 8.07571411132812500000000000000000000000000000000000e-01, /* r[61] */ 3.08338256217685957594198953302111476659774780273438e-01, /* logih[61] */ -3.91862830506871787886277655283277883335703800578341e-18, /* logim[61] */ -1.80287911307734040041601196733261985968717764792270e-34, /* logil[61] */ } , { 8.05031776428222656250000000000000000000000000000000e-01, /* r[62] */ 3.12882364094114129304813332055346108973026275634766e-01, /* logih[62] */ 2.00566095640240859030080760939632903054042270806498e-17, /* logim[62] */ -1.20548577698548841142520422108638918923500554048039e-33, /* logil[62] */ } , { 8.02507400512695312500000000000000000000000000000000e-01, /* r[63] */ 3.17413398435927307517090412147808820009231567382812e-01, /* logih[63] */ 1.92917962412721060884664265681098014687881777581369e-17, /* logim[63] */ -5.60605040615516964419678016739265374372709613799588e-34, /* logil[63] */ } , { 8.00000190734863281250000000000000000000000000000000e-01, /* r[64] */ 3.21927750922101629793559141035075299441814422607422e-01, /* logih[64] */ -3.68777572337715973775586041884209304585818249254945e-18, /* logim[64] */ 2.42378345855852981194379769493259763563573896470280e-34, /* logil[64] */ } , { 7.97508239746093750000000000000000000000000000000000e-01, /* r[65] */ 3.26428670204942816823745488363783806562423706054688e-01, /* logih[65] */ 1.45984677103376311105171213886420877499189566989355e-18, /* logim[65] */ 8.54804091592753412940247017733822117449065792260507e-35, /* logil[65] */ } , { 7.95030593872070312500000000000000000000000000000000e-01, /* r[66] */ 3.30917716530283567699655122851254418492317199707031e-01, /* logih[66] */ -1.10914470017120619152208446527819480613105503270278e-17, /* logim[66] */ 7.68957589367645155571847946740580012038237827888475e-35, /* logil[66] */ } , { 7.92570114135742187500000000000000000000000000000000e-01, /* r[67] */ 3.35389527027655065527511624168255366384983062744141e-01, /* logih[67] */ -2.68905140673031160753055547019515200860581054595347e-17, /* logim[67] */ 1.12312306509581200028305457580071181488591082452267e-33, /* logil[67] */ } , { 7.90122985839843750000000000000000000000000000000000e-01, /* r[68] */ 3.39850862798135311404479352859198115766048431396484e-01, /* logih[68] */ 2.67578448800166743621563940564181619384497916823689e-18, /* logim[68] */ -4.08593208106915232849113978946102464404769851005264e-36, /* logil[68] */ } , { 7.87692070007324218750000000000000000000000000000000e-01, /* r[69] */ 3.44296343246967506690481286568683572113513946533203e-01, /* logih[69] */ 2.61985729966483159298053143855013667206513518139355e-17, /* logim[69] */ -1.43317776294076914943494562393727319237442460573694e-33, /* logil[69] */ } , { 7.85276412963867187500000000000000000000000000000000e-01, /* r[70] */ 3.48727530794102902333975180226843804121017456054688e-01, /* logih[70] */ -2.34058128233080475834922834476410669486100635732851e-17, /* logim[70] */ -1.19495530307809197006632618244668279768915361517721e-33, /* logil[70] */ } , { 7.82875061035156250000000000000000000000000000000000e-01, /* r[71] */ 3.53146008580722203795687619276577606797218322753906e-01, /* logih[71] */ 2.51020933081373096955654998109339846738212697870377e-17, /* logim[71] */ 3.85467771988000503348528260185321311042188078683671e-35, /* logil[71] */ } , { 7.80488014221191406250000000000000000000000000000000e-01, /* r[72] */ 3.57551617657171139086358380154706537723541259765625e-01, /* logih[72] */ 8.26026920265729456320682991301405499549392385594867e-18, /* logim[72] */ -4.82409659516332608730700682966909062399273519559205e-34, /* logil[72] */ } , { 7.78115272521972656250000000000000000000000000000000e-01, /* r[73] */ 3.61944198317473264658872267318656668066978454589844e-01, /* logih[73] */ 9.35251240570409658369637671707393177323119533170476e-18, /* logim[73] */ 7.65402247015393379174811496478109595932454697550257e-34, /* logil[73] */ } , { 7.75757789611816406250000000000000000000000000000000e-01, /* r[74] */ 3.66321816535990496532804172602482140064239501953125e-01, /* logih[74] */ -1.26283763367166791971668084210111644172264929234222e-17, /* logim[74] */ -5.18175152989954334710733729135724747368463044348133e-34, /* logil[74] */ } , { 7.73413658142089843750000000000000000000000000000000e-01, /* r[75] */ 3.70687852887287339065380820102291181683540344238281e-01, /* logih[75] */ -2.26426578076002335190700377100879173906840093029931e-18, /* logim[75] */ 9.39919422448895887884207901501396710115618070243006e-35, /* logil[75] */ } , { 7.71084785461425781250000000000000000000000000000000e-01, /* r[76] */ 3.75038592931745407010879489462240599095821380615234e-01, /* logih[76] */ 1.36478878694725594397668899630117789175518936328670e-17, /* logim[76] */ -7.42102285102582603712767861440251383531360222023193e-34, /* logil[76] */ } , { 7.68768310546875000000000000000000000000000000000000e-01, /* r[77] */ 3.79379226984772721653627058913116343319416046142578e-01, /* logih[77] */ 1.13769630716652922583152930707043643780239195343403e-17, /* logim[77] */ -5.71497157206590541051326347759309167725971873915619e-34, /* logil[77] */ } , { 7.66467094421386718750000000000000000000000000000000e-01, /* r[78] */ 3.83704238729474844671329947232152335345745086669922e-01, /* logih[78] */ -1.37569501553533684673235058090995964600109755003945e-17, /* logim[78] */ -8.19419663933668791519024676445202574794121365195595e-35, /* logil[78] */ } , { 7.64179229736328125000000000000000000000000000000000e-01, /* r[79] */ 3.88017048869009228972970504401018843054771423339844e-01, /* logih[79] */ -3.80701519449449765873708863588277305202153361708738e-18, /* logim[79] */ 1.41209082306365988413846146208806553569817267206609e-34, /* logil[79] */ } , { 7.61904716491699218750000000000000000000000000000000e-01, /* r[80] */ 3.92317508770088307912260461307596415281295776367188e-01, /* logih[80] */ -2.48709304499940275271685524139705487487812483329234e-17, /* logim[80] */ 1.51913530740466505110972004119148045675527858280419e-33, /* logil[80] */ } , { 7.59643554687500000000000000000000000000000000000000e-01, /* r[81] */ 3.96605469112625952377015892125200480222702026367188e-01, /* logih[81] */ -2.05409584188905648894008644042627621347744841311892e-17, /* logim[81] */ 2.22145444790121064274793819131004556765772287126498e-35, /* logil[81] */ } , { 7.57396697998046875000000000000000000000000000000000e-01, /* r[82] */ 4.00878963329971971241150185960577800869941711425781e-01, /* logih[82] */ -2.66817967026326825523345579536420301974049078445688e-19, /* logim[82] */ -1.05363633967249486254042597699490314094813255836572e-35, /* logil[82] */ } , { 7.55162239074707031250000000000000000000000000000000e-01, /* r[83] */ 4.05141468510801738833748686374747194349765777587891e-01, /* logih[83] */ 4.12013026738107642301137843414110630137096547313805e-19, /* logim[83] */ 2.33575446522787458311195104600075869808876514799442e-35, /* logil[83] */ } , { 7.52941131591796875000000000000000000000000000000000e-01, /* r[84] */ 4.09391022129029724663240585869061760604381561279297e-01, /* logih[84] */ 2.56067666045646563728399935742968282460993394682039e-17, /* logim[84] */ -5.13721066726803690112726682214076449553351301368597e-34, /* logil[84] */ } , { 7.50733375549316406250000000000000000000000000000000e-01, /* r[85] */ 4.13627472195328416137982685540919192135334014892578e-01, /* logih[85] */ 2.18808337792321329482011871274589564814328341663075e-17, /* logim[85] */ 1.02540355629315485391150379093592950725836019876557e-33, /* logil[85] */ } , { 7.48538017272949218750000000000000000000000000000000e-01, /* r[86] */ 4.17852504136982216831341929719201289117336273193359e-01, /* logih[86] */ 9.86946871873695851969756471738566369665379660554619e-19, /* logim[86] */ 6.29612486797528483220726516137805747359270884942425e-35, /* logil[86] */ } , { 7.46356010437011718750000000000000000000000000000000e-01, /* r[87] */ 4.22064137361382152313638016494223847985267639160156e-01, /* logih[87] */ -1.05922076934284027175745907413659282941993793826139e-17, /* logim[87] */ -6.12299960012078338449376466647955436587104734540624e-34, /* logil[87] */ } , { 7.44186401367187500000000000000000000000000000000000e-01, /* r[88] */ 4.26264066771658511889597775734728202223777770996094e-01, /* logih[88] */ -8.85513480816040453945742392800672953193458312727256e-18, /* logim[88] */ -5.24714106986727460487580275593262691651180525370791e-34, /* logil[88] */ } , { 7.42029190063476562500000000000000000000000000000000e-01, /* r[89] */ 4.30452153955706073862330640622531063854694366455078e-01, /* logih[89] */ 2.61368823927001457998555167240062922142140611089746e-17, /* logim[89] */ 1.44680766060028701358746313826017052885573936570807e-33, /* logil[89] */ } , { 7.39884376525878906250000000000000000000000000000000e-01, /* r[90] */ 4.34628259883472034541540551799698732793331146240234e-01, /* logih[90] */ -4.65804559835565790738625882506228255266947860929998e-18, /* logim[90] */ 3.50162107860052357002426832774093849420181199400792e-34, /* logil[90] */ } , { 7.37751960754394531250000000000000000000000000000000e-01, /* r[91] */ 4.38792244913736528832970407165703363716602325439453e-01, /* logih[91] */ 6.54435041067844518638349922716293820410138082918974e-18, /* logim[91] */ 1.66288117681168517806253799205003056056005048205360e-34, /* logil[91] */ } , { 7.35631942749023437500000000000000000000000000000000e-01, /* r[92] */ 4.42943968801095711018689371485379524528980255126953e-01, /* logih[92] */ -1.31830993629830820106422084359785358736815996728614e-17, /* logim[92] */ 4.61053576482372100205685418524847218246553128543631e-34, /* logil[92] */ } , { 7.33524322509765625000000000000000000000000000000000e-01, /* r[93] */ 4.47083290703147728795130433354643173515796661376953e-01, /* logih[93] */ 1.69077329042533132659710418879288890988542117042696e-17, /* logim[93] */ 9.64412076794160463494531210530587642610119179701767e-34, /* logil[93] */ } , { 7.31428146362304687500000000000000000000000000000000e-01, /* r[94] */ 4.51211950247995374763121390060405246913433074951172e-01, /* logih[94] */ 5.29157734589489879989241042345888795815986344495564e-18, /* logim[94] */ 4.05922256458861404459677801513180982129072332853957e-35, /* logil[94] */ } , { 7.29344367980957031250000000000000000000000000000000e-01, /* r[95] */ 4.55327935107630421551760946385911665856838226318359e-01, /* logih[95] */ 1.12238496235431997950024540898660473611218791584296e-17, /* logim[95] */ 2.53810412167217662475589577599465754868617140018869e-34, /* logil[95] */ } , { 7.27272987365722656250000000000000000000000000000000e-01, /* r[96] */ 4.59431102689436932084987574853585101664066314697266e-01, /* logih[96] */ -5.65021202083821658568979172094850503702023051443232e-18, /* logim[96] */ 2.66729880996649709196382536663439201060959304794017e-34, /* logil[96] */ } , { 7.25212097167968750000000000000000000000000000000000e-01, /* r[97] */ 4.63525104197631598879070224938914179801940917968750e-01, /* logih[97] */ 1.64015018050273811377058500937130036591871213663913e-17, /* logim[97] */ -2.37668158047196530099123034685246144103569462059140e-35, /* logil[97] */ } , { 7.23163604736328125000000000000000000000000000000000e-01, /* r[98] */ 4.67606023035364859463669517936068587005138397216797e-01, /* logih[98] */ -2.35404459021293530100419612489692369296536941011139e-17, /* logim[98] */ 8.65686412848735892137131700314774245266762617410743e-34, /* logil[98] */ } , { 7.21126556396484375000000000000000000000000000000000e-01, /* r[99] */ 4.71675622850898035309796796354930847883224487304688e-01, /* logih[99] */ -5.00291784895727418193570650071413020227423422230627e-18, /* logim[99] */ -3.48814629702810911815080058632968938255265704317182e-34, /* logil[99] */ } , { 7.19100952148437500000000000000000000000000000000000e-01, /* r[100] */ 4.75733774931740460711893092593527399003505706787109e-01, /* logih[100] */ 2.37354207292015831848317508817743592416645271551013e-17, /* logim[100] */ 3.75220251398787236762445752605220099123667359652946e-34, /* logil[100] */ } , { 7.17086791992187500000000000000000000000000000000000e-01, /* r[101] */ 4.79780350020427681645429629497812129557132720947266e-01, /* logih[101] */ 9.64996639262616277761997731342311958042765881278166e-18, /* logim[101] */ -1.45917791984963879526832989164269922466650870970319e-34, /* logil[101] */ } , { 7.15084075927734375000000000000000000000000000000000e-01, /* r[102] */ 4.83815218320749418356996329748653806746006011962891e-01, /* logih[102] */ -2.26055495552680496488915066271475591152753444344542e-17, /* logim[102] */ 1.15943477520296400421924802163066587581164941504239e-33, /* logil[102] */ } , { 7.13091850280761718750000000000000000000000000000000e-01, /* r[103] */ 4.87840178933420298701406636610045097768306732177734e-01, /* logih[103] */ 9.95061561880808777250662218784807296295756393896643e-18, /* logim[103] */ -2.70730037505675842458176336457886940782026608863071e-34, /* logil[103] */ } , { 7.11111068725585937500000000000000000000000000000000e-01, /* r[104] */ 4.91853182321002724286529428354697301983833312988281e-01, /* logih[104] */ -1.93631103608357505056849606827194505159750296147429e-17, /* logim[104] */ -5.13067202688456219222003091599945986652944064972985e-34, /* logil[104] */ } , { 7.09141731262207031250000000000000000000000000000000e-01, /* r[105] */ 4.95854097106264379846152223763056099414825439453125e-01, /* logih[105] */ -8.97253997785747359550285084120100354068920818555134e-18, /* logim[105] */ 4.48985852964966878119016366112985893401143906248048e-34, /* logil[105] */ } , { 1.41436386108398437500000000000000000000000000000000e+00, /* r[106] */ -5.00153317496815130738241350627504289150238037109375e-01, /* logih[106] */ 6.38652340493840901898261226024177907291121978480765e-18, /* logim[106] */ -1.50115709371786842001778403725543006667379544298665e-34, /* logil[106] */ } , { 1.41046905517578125000000000000000000000000000000000e+00, /* r[107] */ -4.96175014428150595868771688401466235518455505371094e-01, /* logih[107] */ -2.52613980927368683904892283975420623567633947857171e-17, /* logim[107] */ -2.78172233261534782496122526419959911999891480999118e-34, /* logil[107] */ } , { 1.40659332275390625000000000000000000000000000000000e+00, /* r[108] */ -4.92205273809975751841960800447850488126277923583984e-01, /* logih[108] */ 1.38263645220702992115908316962406899116133433250055e-17, /* logim[108] */ -9.13478810114964638432169273750765158178251684940645e-35, /* logil[108] */ } , { 1.40274047851562500000000000000000000000000000000000e+00, /* r[109] */ -4.88248120154341713750056896969908848404884338378906e-01, /* logih[109] */ -9.19124816655229741100591795639860013679834003477893e-18, /* logim[109] */ 3.57736696925483033542993216894623988952660296440587e-34, /* logil[109] */ } , { 1.39890670776367187500000000000000000000000000000000e+00, /* r[110] */ -4.84299753257103948733686138439225032925605773925781e-01, /* logih[110] */ 2.76894400316545187895597055836412754062515893165117e-17, /* logim[110] */ -1.28196249311567885024568784724802925800328520582323e-33, /* logil[110] */ } , { 1.39509582519531250000000000000000000000000000000000e+00, /* r[111] */ -4.80364220108999595559851059078937396407127380371094e-01, /* logih[111] */ 1.60772577856827581149848485565219950146355948388194e-17, /* logim[111] */ -6.33909180037348533226128939381564653515346318497266e-34, /* logil[111] */ } , { 1.39130401611328125000000000000000000000000000000000e+00, /* r[112] */ -4.76437699977644402160592562722740694880485534667969e-01, /* logih[112] */ 3.93777448294044466045455458211156033645576475025704e-18, /* logim[112] */ 3.61421668039083688240729461133241002751658704802140e-35, /* logil[112] */ } , { 1.38753318786621093750000000000000000000000000000000e+00, /* r[113] */ -4.72522279136534217869325402716640383005142211914062e-01, /* logih[113] */ 1.96035568196414967372784793032251967173332695653211e-18, /* logim[113] */ -1.17747583658959694655352427302025069169526418930102e-34, /* logil[113] */ } , { 1.38378334045410156250000000000000000000000000000000e+00, /* r[114] */ -4.68618077280239631043912140739848837256431579589844e-01, /* logih[114] */ -6.21887814563789414007506165242075506645450300833460e-18, /* logim[114] */ 2.85091055480350088234477660182894618899479782600553e-34, /* logil[114] */ } , { 1.38005447387695312500000000000000000000000000000000e+00, /* r[115] */ -4.64725214569437938827434209088096395134925842285156e-01, /* logih[115] */ 1.41770874784515407852341959571636665299319020447279e-17, /* logim[115] */ 7.16277267487504881902108530195699095867171533372599e-34, /* logil[115] */ } , { 1.37634468078613281250000000000000000000000000000000e+00, /* r[116] */ -4.60841812328943278842530162364710122346878051757812e-01, /* logih[116] */ -4.53322590938932589383322662851218023838002020827810e-18, /* logim[116] */ -3.00474404192043520651451236027633906276066461510596e-34, /* logil[116] */ } , { 1.37265396118164062500000000000000000000000000000000e+00, /* r[117] */ -4.56967975515349844606305396155221387743949890136719e-01, /* logih[117] */ -2.33094358634200721377135368497958427964300301497283e-17, /* logim[117] */ 9.88425626506853222061479506529364782400408771511375e-34, /* logil[117] */ } , { 1.36898422241210937500000000000000000000000000000000e+00, /* r[118] */ -4.53105819584143920675245453821844421327114105224609e-01, /* logih[118] */ 2.01510616322289821386139052884185780607827719984300e-18, /* logim[118] */ 6.02181671552856437268832796139799348494799893689780e-35, /* logil[118] */ } , { 1.36533355712890625000000000000000000000000000000000e+00, /* r[119] */ -4.49253451092882338802070307792746461927890777587891e-01, /* logih[119] */ 8.23312641185804722064182220776569229058888742494964e-18, /* logim[119] */ 3.51720183694942905373021695760046871719134069706073e-34, /* logil[119] */ } , { 1.36170196533203125000000000000000000000000000000000e+00, /* r[120] */ -4.45410976339701503157186834869207814335823059082031e-01, /* logih[120] */ -1.08977418015840362022538949472279372016122627370204e-17, /* logim[120] */ 6.97295970316695053124005231434035931338517048339577e-34, /* logil[120] */ } , { 1.35808944702148437500000000000000000000000000000000e+00, /* r[121] */ -4.41578502060277766627649498332175426185131072998047e-01, /* logih[121] */ -2.36601424071700836766138911811129382339795814666297e-18, /* logim[121] */ -8.33576574128057056240434241376128274787476967696058e-35, /* logil[121] */ } , { 1.35449790954589843750000000000000000000000000000000e+00, /* r[122] */ -4.37758166969168582838278780400287359952926635742188e-01, /* logih[122] */ 2.32683708630670947650076997142659873229215752583714e-17, /* logim[122] */ -4.15560143754890940120352265317471333960877272565937e-34, /* logil[122] */ } , { 1.35092353820800781250000000000000000000000000000000e+00, /* r[123] */ -4.33946020947943322809692290320526808500289916992188e-01, /* logih[123] */ -6.30929577529820412721860253954307086992044476041831e-19, /* logim[123] */ 3.79819606716958067883014408281063348020187639876938e-35, /* logil[123] */ } , { 1.34736824035644531250000000000000000000000000000000e+00, /* r[124] */ -4.30144198188556980966268383781425654888153076171875e-01, /* logih[124] */ 1.71683205857569655573934637457594450429113050785555e-17, /* logim[124] */ 7.29043201113051662805038181720083419974138092701628e-34, /* logil[124] */ } , { 1.34383201599121093750000000000000000000000000000000e+00, /* r[125] */ -4.26352807132220124053390009066788479685783386230469e-01, /* logih[125] */ 8.26061049860036128096500446845868042685767901578105e-18, /* logim[125] */ 4.84223346776956637948090236698054613852109689623963e-35, /* logil[125] */ } , { 1.34031486511230468750000000000000000000000000000000e+00, /* r[126] */ -4.22571956634882506254058398553752340376377105712891e-01, /* logih[126] */ 2.21190566670722703461840612616380011243743333737306e-17, /* logim[126] */ 1.14896204572710075326698165510345911361717606050114e-33, /* logil[126] */ } , { 1.33681488037109375000000000000000000000000000000000e+00, /* r[127] */ -4.18799697546823501692614399871672503650188446044922e-01, /* logih[127] */ 3.41599526072994406508033857887135558854814373525867e-18, /* logim[127] */ 1.61801446193077496556464113278472787123475795694267e-34, /* logil[127] */ } , { 1.33333396911621093750000000000000000000000000000000e+00, /* r[128] */ -4.15038187209283260248326996588730253279209136962891e-01, /* logih[128] */ 5.85238726764280271365110933546070366526501739862427e-18, /* logim[128] */ -2.45528134121210933969132173699021927099228584364359e-34, /* logil[128] */ } , { 1.32987022399902343750000000000000000000000000000000e+00, /* r[129] */ -4.11285466532431642772138502550660632550716400146484e-01, /* logih[129] */ 1.83565181086895727239354318438705255980398036076305e-17, /* logim[129] */ -1.44829162356744238484324099870150480074671457391215e-34, /* logil[129] */ } , { 1.32642555236816406250000000000000000000000000000000e+00, /* r[130] */ -4.07543704406910789472817668865900486707687377929688e-01, /* logih[130] */ 7.10235884116823704612718576916821308079422777996548e-18, /* logim[130] */ -3.80158777039570620950910438941465328615623287437883e-34, /* logil[130] */ } , { 1.32299804687500000000000000000000000000000000000000e+00, /* r[131] */ -4.03810931786029114753944213589420542120933532714844e-01, /* logih[131] */ -1.93041149309406226539378039674180224095823991324562e-17, /* logim[131] */ -6.48369386828220195024391999791810414893637949753662e-34, /* logil[131] */ } , { 1.31958770751953125000000000000000000000000000000000e+00, /* r[132] */ -4.00087243804195191732020475683384574949741363525391e-01, /* logih[132] */ 2.89502375830776532785152499054923847834329794887170e-18, /* logim[132] */ 3.93222273610552470790411012589691255020379298257710e-35, /* logil[132] */ } , { 1.31619453430175781250000000000000000000000000000000e+00, /* r[133] */ -3.96372735981224799672872904920950531959533691406250e-01, /* logih[133] */ 3.60172691524424563925914502416059579856197691514466e-18, /* logim[133] */ -1.20158940511610546308573928507645976530296896406609e-34, /* logil[133] */ } , { 1.31282043457031250000000000000000000000000000000000e+00, /* r[134] */ -3.92669600259061335467691833400749601423740386962891e-01, /* logih[134] */ 1.93341846112285731515865124079144232548548539073023e-17, /* logim[134] */ 9.57937519914959684169918849813293673245644163903024e-34, /* logil[134] */ } , { 1.30946350097656250000000000000000000000000000000000e+00, /* r[135] */ -3.88975847627444304421828746853861957788467407226562e-01, /* logih[135] */ 3.58737691022243699966445076948412264467756073807198e-18, /* logim[135] */ -6.34256172069676302574983465348800715277257535337860e-35, /* logil[135] */ } , { 1.30612182617187500000000000000000000000000000000000e+00, /* r[136] */ -3.85289467954024300588855567184509709477424621582031e-01, /* logih[136] */ -1.78035364405942478618622742807600593390557301297535e-17, /* logim[136] */ 1.17850158702046574289759352582101206794867193878284e-33, /* logil[136] */ } , { 1.30279922485351562500000000000000000000000000000000e+00, /* r[137] */ -3.81614766464260513068040836515137925744056701660156e-01, /* logih[137] */ 2.71673376063405867104437219707745590226184712176125e-17, /* logim[137] */ 1.69029691017588123460454883011389181316638787275286e-34, /* logil[137] */ } , { 1.29949188232421875000000000000000000000000000000000e+00, /* r[138] */ -3.77947621599900140942907000862760469317436218261719e-01, /* logih[138] */ -1.23014367483561633748866777916981619679184303004036e-17, /* logim[138] */ 6.08355261096735838824466189133147806184918981423043e-34, /* logil[138] */ } , { 1.29620170593261718750000000000000000000000000000000e+00, /* r[139] */ -3.74290237902951461457234927365789189934730529785156e-01, /* logih[139] */ 5.12028570979627947467233714003700900250465944855234e-18, /* logim[139] */ -7.18774911143147425103526075484104021221318133467838e-35, /* logil[139] */ } , { 1.29292869567871093750000000000000000000000000000000e+00, /* r[140] */ -3.70642713487464359189971219166181981563568115234375e-01, /* logih[140] */ -3.62882160448161069817531404328334713231193347048715e-18, /* logim[140] */ 3.44993361798375847334078483327966754606152885070616e-34, /* logil[140] */ } , { 1.28967285156250000000000000000000000000000000000000e+00, /* r[141] */ -3.67005146822302952269723164135939441621303558349609e-01, /* logih[141] */ 1.65005650962521207026407651865843985133165811425788e-17, /* logim[141] */ 5.91047470268282047973730611955174472735945862101340e-34, /* logil[141] */ } , { 1.28643226623535156250000000000000000000000000000000e+00, /* r[142] */ -3.63375497694418791994053208327386528253555297851562e-01, /* logih[142] */ 7.55315421152055178681914500647362519327258619048632e-18, /* logim[142] */ 4.21306551291527090995179817572489429320996105009542e-34, /* logil[142] */ } , { 1.28320884704589843750000000000000000000000000000000e+00, /* r[143] */ -3.59755993558560860368089606708963401615619659423828e-01, /* logih[143] */ 2.63438906908873597795987370422038765478538518071631e-17, /* logim[143] */ -5.30377956355563946242119261708497493118965065157578e-34, /* logil[143] */ } , { 1.28000068664550781250000000000000000000000000000000e+00, /* r[144] */ -3.56144584146996623363889966640272177755832672119141e-01, /* logih[144] */ 1.84288871644476152525450190682980250615827933483764e-17, /* logim[144] */ -2.68882850166617068062129216508822868733174909720115e-34, /* logil[144] */ } , { 1.27680778503417968750000000000000000000000000000000e+00, /* r[145] */ -3.52541353192291462281815483947866596281528472900391e-01, /* logih[145] */ 6.10296193683269704536448210556558136989473744080234e-18, /* logim[145] */ 2.08807753798353788586668668478566842671399016888175e-34, /* logil[145] */ } , { 1.27363204956054687500000000000000000000000000000000e+00, /* r[146] */ -3.48948545297196932590821916164713911712169647216797e-01, /* logih[146] */ -8.65980325947033784931501249514555272578815826796687e-18, /* logim[146] */ -5.80551069749146700308305149939969738912023055923091e-34, /* logil[146] */ } , { 1.27047157287597656250000000000000000000000000000000e+00, /* r[147] */ -3.45364095084557620740639549694606103003025054931641e-01, /* logih[147] */ -2.20359930641039442061906126368732543917103383835287e-17, /* logim[147] */ 5.25544112497915932563320135615380577517633877609112e-34, /* logil[147] */ } , { 1.26732635498046875000000000000000000000000000000000e+00, /* r[148] */ -3.41788087291514053323027155784075148403644561767578e-01, /* logih[148] */ 1.60590761637741619238785912450262223376577693103413e-17, /* logim[148] */ 6.20932254992098893431701251479794933091514543510527e-34, /* logil[148] */ } , { 1.26419830322265625000000000000000000000000000000000e+00, /* r[149] */ -3.38222783638829349595056328325881622731685638427734e-01, /* logih[149] */ -7.25934908657137387104187166197193711352219562279959e-19, /* logim[149] */ -7.33518955628645774542681475658185145551343791889460e-36, /* logil[149] */ } , { 1.26108360290527343750000000000000000000000000000000e+00, /* r[150] */ -3.34663921581079604194997045851778239011764526367188e-01, /* logih[150] */ 2.58775470575103710441675607573318821075159943052076e-17, /* logim[150] */ 2.52692281388567773158078403820428589058070685814554e-35, /* logil[150] */ } , { 1.25798606872558593750000000000000000000000000000000e+00, /* r[151] */ -3.31115945514659559822945311680086888372898101806641e-01, /* logih[151] */ -1.88333140638890303027893990821579263359866325365640e-17, /* logim[151] */ -2.42862233896785521070263301233188993094792416528478e-34, /* logil[151] */ } , { 1.25490188598632812500000000000000000000000000000000e+00, /* r[152] */ -3.27574572037176436900551834696670994162559509277344e-01, /* logih[152] */ 2.07539785395888161822620697150340485723327148173244e-17, /* logim[152] */ -1.23548121878231629330640725541259206553802467565088e-33, /* logil[152] */ } , { 1.25183296203613281250000000000000000000000000000000e+00, /* r[153] */ -3.24042069523512776818563452252419665455818176269531e-01, /* logih[153] */ -2.19005007906502743142091460775759087075823478365805e-17, /* logim[153] */ -9.37037260965326332974189985014675959956434500415796e-34, /* logil[153] */ } , { 1.24878120422363281250000000000000000000000000000000e+00, /* r[154] */ -3.20520728160823831220938018304877914488315582275391e-01, /* logih[154] */ 8.84664087846507870804592874874264782111036297675925e-18, /* logim[154] */ -2.79501394783314300402799429396176544077241557582655e-34, /* logil[154] */ } , { 1.24574279785156250000000000000000000000000000000000e+00, /* r[155] */ -3.17006233235677392645612826527212746441364288330078e-01, /* logih[155] */ -2.11397414280339689746407608887976410350376395394685e-17, /* logim[155] */ 3.03479113171805714055168835565789961369331896831913e-34, /* logil[155] */ } , { 1.24271774291992187500000000000000000000000000000000e+00, /* r[156] */ -3.13498655898958755727790048695169389247894287109375e-01, /* logih[156] */ 2.26105586296044525095947242798100200767794657136581e-17, /* logim[156] */ 2.60892976305499386383284257219701588877405462281587e-34, /* logil[156] */ } , { 1.23970985412597656250000000000000000000000000000000e+00, /* r[157] */ -3.10002506907223029930520397101645357906818389892578e-01, /* logih[157] */ -2.12074655036622140523873009541587371919611130881289e-17, /* logim[157] */ 7.30831854753703044634898432991347385046726141750071e-34, /* logil[157] */ } , { 1.23671531677246093750000000000000000000000000000000e+00, /* r[158] */ -3.06513440210500087701461779943201690912246704101562e-01, /* logih[158] */ 2.12840943277243056092775928647435125404474364580951e-17, /* logim[158] */ 7.25047508544774410393782565061654912871065991425794e-34, /* logil[158] */ } , { 1.23373413085937500000000000000000000000000000000000e+00, /* r[159] */ -3.03031527860823046705007755008409731090068817138672e-01, /* logih[159] */ -1.17964490716782890686396740199564245489484684608012e-17, /* logim[159] */ -2.32059444003387543097602750801495580204955378385700e-34, /* logil[159] */ } , { 1.23077011108398437500000000000000000000000000000000e+00, /* r[160] */ -2.99561313754444002999122176333912648260593414306641e-01, /* logih[160] */ 2.11014025619190086202004124493478829824043549375509e-17, /* logim[160] */ 5.40038404420639021176237530552511419095691650926683e-34, /* logil[160] */ } , { 1.22781753540039062500000000000000000000000000000000e+00, /* r[161] */ -2.96096179330254616335338369026430882513523101806641e-01, /* logih[161] */ 2.67263979507576883549661537337697767383852090911653e-17, /* logim[161] */ -2.94764943000919117463056963543943525405460259854793e-34, /* logil[161] */ } , { 1.22488021850585937500000000000000000000000000000000e+00, /* r[162] */ -2.92640674438622072628390924364794045686721801757812e-01, /* logih[162] */ 1.71594867435767387701491785234936424743342309564339e-17, /* logim[162] */ -1.31007554480643933015058741413754044981377681619902e-33, /* logil[162] */ } , { 1.22195625305175781250000000000000000000000000000000e+00, /* r[163] */ -2.89192636519142565187934224013588391244411468505859e-01, /* logih[163] */ -2.18230480089953441152115749431697227603316223085319e-19, /* logim[163] */ -8.85466907005428204234103766898640792692944423628476e-36, /* logil[163] */ } , { 1.21904754638671875000000000000000000000000000000000e+00, /* r[164] */ -2.85754396342549343845718112788745202124118804931641e-01, /* logih[164] */ -2.52426324464082956234588408195190742914473546506648e-17, /* logim[164] */ 1.40869584178453690304836821378162094545489911118516e-33, /* logil[164] */ } , { 1.21615219116210937500000000000000000000000000000000e+00, /* r[165] */ -2.82323781162987341719627920610946603119373321533203e-01, /* logih[165] */ -2.26062338879282363134318310278758951570998177822355e-17, /* logim[165] */ -2.68106389298437671467414029735971090503255483828766e-34, /* logil[165] */ } , { 1.21327018737792968750000000000000000000000000000000e+00, /* r[166] */ -2.78900865037392253764636507185059599578380584716797e-01, /* logih[166] */ -5.63339187198014524317590270324119375314418005110616e-18, /* logim[166] */ 5.21040627963337134602368749859442018659641934000068e-35, /* logil[166] */ } , { 1.21040153503417968750000000000000000000000000000000e+00, /* r[167] */ -2.75485722297818480530651186199975199997425079345703e-01, /* logih[167] */ 1.00075444298865318738580890792735678874884353310639e-17, /* logim[167] */ -4.47816459623451897434280578394151285127126954784303e-34, /* logil[167] */ } , { 1.20754623413085937500000000000000000000000000000000e+00, /* r[168] */ -2.72078427549137136232104694499867036938667297363281e-01, /* logih[168] */ 2.72560475587786773498503956757053623040042693331146e-17, /* logim[168] */ 1.45218948063688621997250686619739825113781997475216e-33, /* logil[168] */ } , { 1.20470619201660156250000000000000000000000000000000e+00, /* r[169] */ -2.68681339812479158535296619447763077914714813232422e-01, /* logih[169] */ 5.70669740727466907072711072058064597445179109382518e-19, /* logim[169] */ 3.22286121745779380928448151900341840625477392480707e-35, /* logil[169] */ } , { 1.20187759399414062500000000000000000000000000000000e+00, /* r[170] */ -2.65289971315308126253995624210801906883716583251953e-01, /* logih[170] */ -9.85570591393311591325758586976559232082321294112761e-18, /* logim[170] */ 4.70169173751465081907550999286196624093375291125429e-34, /* logil[170] */ } , { 1.19906234741210937500000000000000000000000000000000e+00, /* r[171] */ -2.61906676236464963647421200221288017928600311279297e-01, /* logih[171] */ 2.11725501817603632855204088733430972661848669245281e-17, /* logim[171] */ -4.34447783947526009842327436452242187031752585481265e-34, /* logil[171] */ } , { 1.19626235961914062500000000000000000000000000000000e+00, /* r[172] */ -2.58533830516213369854483516974141821265220642089844e-01, /* logih[172] */ 6.68433683242387216829190215856985521381580367248536e-18, /* logim[172] */ 1.47308049080021740635607084979003827052572897235269e-34, /* logil[172] */ } , { 1.19347381591796875000000000000000000000000000000000e+00, /* r[173] */ -2.55166914924355725524662830139277502894401550292969e-01, /* logih[173] */ 8.59194265653184494493651707567219919844164634345398e-18, /* logim[173] */ -5.71296827813717896996055631958626046207607829073074e-34, /* logil[173] */ } , { 1.19069862365722656250000000000000000000000000000000e+00, /* r[174] */ -2.51808300544058893954968425532570108771324157714844e-01, /* logih[174] */ -1.41914360009177510586369575931064612468930448614148e-17, /* logim[174] */ -1.62403247278609196179609602276489322075073469608800e-34, /* logil[174] */ } , { 1.18793487548828125000000000000000000000000000000000e+00, /* r[175] */ -2.48455747430406659326251883612712845206260681152344e-01, /* logih[175] */ -1.01487704576317129292387756236812830284397429666783e-17, /* logim[175] */ -2.33655220085162222996740706004887790768032744693521e-34, /* logil[175] */ } , { 1.18518447875976562500000000000000000000000000000000e+00, /* r[176] */ -2.45111637923020875273749652478727512061595916748047e-01, /* logih[176] */ 7.90027454939177726382780718024180385506006420479963e-18, /* logim[176] */ -7.12630269915217131628005874908549382719132579907736e-34, /* logil[176] */ } , { 1.18244743347167968750000000000000000000000000000000e+00, /* r[177] */ -2.41776048972363183375833273203170392662286758422852e-01, /* logih[177] */ -1.37983625208326204093508338414984840931706541381331e-17, /* logim[177] */ 7.20097580628563544454377572306403550061149741436607e-34, /* logil[177] */ } , { 1.17972373962402343750000000000000000000000000000000e+00, /* r[178] */ -2.38449057776214834447614521195646375417709350585938e-01, /* logih[178] */ 1.09262391873895283755849310197040950453513559131684e-17, /* logim[178] */ 5.19474724393747239275281177964830169009947097965027e-34, /* logil[178] */ } , { 1.17701148986816406250000000000000000000000000000000e+00, /* r[179] */ -2.35128403889451498276486063332413323223590850830078e-01, /* logih[179] */ -2.20620458531834175679580996316363151867859051514489e-18, /* logim[179] */ 9.83810838200669124655236613392658820366639819033369e-35, /* logil[179] */ } , { 1.17431259155273437500000000000000000000000000000000e+00, /* r[180] */ -2.31816492140433955126965770432434510439634323120117e-01, /* logih[180] */ 2.57100775389850524221489812836912330014517778962947e-18, /* logim[180] */ 1.00374417119546455021964629408545038692958060180549e-34, /* logil[180] */ } , { 1.17162513732910156250000000000000000000000000000000e+00, /* r[181] */ -2.28511051821717880994100369207444600760936737060547e-01, /* logih[181] */ 9.92032628735403930510124467196382166156697723468760e-18, /* logim[181] */ 6.81523716295691040818680683845702798454513605818654e-35, /* logil[181] */ } , { 1.16894912719726562500000000000000000000000000000000e+00, /* r[182] */ -2.25212144978847061960181008544168435037136077880859e-01, /* logih[182] */ -1.16073487380474294909629845428878875053786683626167e-17, /* logim[182] */ 1.99595089821539122107001863565030748851109328863471e-34, /* logil[182] */ } , { 1.16628646850585937500000000000000000000000000000000e+00, /* r[183] */ -2.21922193282795110480520861528930254280567169189453e-01, /* logih[183] */ -3.05125287362116491328592101654681002471500301574214e-18, /* logim[183] */ 1.83193994791768071092494646800366992102561399372769e-34, /* logil[183] */ } , { 1.16363716125488281250000000000000000000000000000000e+00, /* r[184] */ -2.18641275375243943068781504734943155199289321899414e-01, /* logih[184] */ 8.35804667506368175331097204734558341794896033630962e-18, /* logim[184] */ -6.76361847971404643554720269553322140862967487333475e-34, /* logil[184] */ } , { 1.16099739074707031250000000000000000000000000000000e+00, /* r[185] */ -2.15364729860247627879488163671339862048625946044922e-01, /* logih[185] */ 6.95092875909142621207400674633981711651172609645792e-20, /* logim[185] */ -2.69634411814059745570417391670366760873171411634907e-36, /* logil[185] */ } , { 1.15837097167968750000000000000000000000000000000000e+00, /* r[186] */ -2.12097354617240441143621865194290876388549804687500e-01, /* logih[186] */ 3.94012228039531281835195940112690671816259833936964e-18, /* logim[186] */ 2.35523503821099524557043963050386917863396604377712e-34, /* logil[186] */ } , { 1.15575599670410156250000000000000000000000000000000e+00, /* r[187] */ -2.08836848096523530760038056541816331446170806884766e-01, /* logih[187] */ 7.10684410301031817893241287396550439057323196953174e-18, /* logim[187] */ 4.17638182387052934717199646329356631335921484531446e-34, /* logil[187] */ } , { 1.15315246582031250000000000000000000000000000000000e+00, /* r[188] */ -2.05583273736383437269026330795895773917436599731445e-01, /* logih[188] */ -1.11541224825735129654072863667548382180433494970388e-17, /* logim[188] */ 2.60702460469050167439470691373935621310497497561972e-34, /* logil[188] */ } , { 1.15056228637695312500000000000000000000000000000000e+00, /* r[189] */ -2.02339086834303488737774046057893428951501846313477e-01, /* logih[189] */ -8.06133178191867723913541186137675666224522328881259e-18, /* logim[189] */ 4.69018902441109377621277031182321899995757079990517e-34, /* logil[189] */ } , { 1.14798164367675781250000000000000000000000000000000e+00, /* r[190] */ -1.99099573382730848924992983484116848558187484741211e-01, /* logih[190] */ -7.82936742512703344110788328637397546846483342009157e-18, /* logim[190] */ 5.23473869269106466321035297990759170076861208106171e-34, /* logil[190] */ } , { 1.14541435241699218750000000000000000000000000000000e+00, /* r[191] */ -1.95869586130290290748590109615179244428873062133789e-01, /* logih[191] */ 1.12134985887404327493969118908772924959105352074790e-17, /* logim[191] */ 1.66886450547656745631907524196364853864087335213403e-34, /* logil[191] */ } , { 1.14285659790039062500000000000000000000000000000000e+00, /* r[192] */ -1.92644390011628419134837031378992833197116851806641e-01, /* logih[192] */ -6.69952429363159445722018187914913034715067412521068e-18, /* logim[192] */ 8.89381602231133611911957806790376785637357399200603e-35, /* logil[192] */ } , { 1.14031219482421875000000000000000000000000000000000e+00, /* r[193] */ -1.89428859708889563151501533866394311189651489257812e-01, /* logih[193] */ 5.59630837119075206491413698162738631266398718359305e-18, /* logim[193] */ -4.99136387936431477565418774749623903558226749832454e-35, /* logil[193] */ } , { 1.13777732849121093750000000000000000000000000000000e+00, /* r[194] */ -1.86218239090319481743307505894335918128490447998047e-01, /* logih[194] */ 3.78774956212100823689526329408930405128821433232626e-18, /* logim[194] */ -3.17758760986685144372998527475489364873340117319014e-34, /* logil[194] */ } , { 1.13525581359863281250000000000000000000000000000000e+00, /* r[195] */ -1.83017424763517094765674642076191958039999008178711e-01, /* logih[195] */ 5.87157335095818829027440258888705251018885949838258e-18, /* logim[195] */ -2.54192655149641158852181857283167049817204136167821e-34, /* logil[195] */ } , { 1.13274383544921875000000000000000000000000000000000e+00, /* r[196] */ -1.79821639523964738049954803500440903007984161376953e-01, /* logih[196] */ 8.22302301209080640417647229353398001438134544835098e-19, /* logim[196] */ -2.52039332892153569817641206709892948549663624549042e-35, /* logil[196] */ } , { 1.13024330139160156250000000000000000000000000000000e+00, /* r[197] */ -1.76633367267372942688297143831732682883739471435547e-01, /* logih[197] */ -1.91571353469448596640611671435274648642190311723695e-18, /* logim[197] */ -1.21134793249841109085003066519453210454870699339190e-34, /* logil[197] */ } , { 1.12775421142578125000000000000000000000000000000000e+00, /* r[198] */ -1.73452673591511286055322216270724311470985412597656e-01, /* logih[198] */ 5.21283885301191031368646131342662533975361117947090e-18, /* logim[198] */ -1.01368643659769709343563840800327590720656486827318e-34, /* logil[198] */ } , { 1.12527465820312500000000000000000000000000000000000e+00, /* r[199] */ -1.70277178922613403599939374544192105531692504882812e-01, /* logih[199] */ 1.34546625256560311153005432906921643689472370072641e-17, /* logim[199] */ -2.01787346631624515685039191465892766058891822659738e-34, /* logil[199] */ } , { 1.12280654907226562500000000000000000000000000000000e+00, /* r[200] */ -1.67109383895854723967033805820392444729804992675781e-01, /* logih[200] */ -6.60161109774567977756253155335787084419173665974265e-18, /* logim[200] */ -5.20727010500155857942441424119648973967213145273875e-35, /* logil[200] */ } , { 1.12034988403320312500000000000000000000000000000000e+00, /* r[201] */ -1.63949354721177775751073113497113808989524841308594e-01, /* logih[201] */ -1.59075426091945659534123359515275496742329136677793e-18, /* logim[201] */ -8.80061355388662086427482764107757767132081769249868e-35, /* logil[201] */ } , { 1.11790466308593750000000000000000000000000000000000e+00, /* r[202] */ -1.60797157807325702405520928550686221569776535034180e-01, /* logih[202] */ -1.27882485432659989407998658585334380471532522122288e-17, /* logim[202] */ -1.78908761080882243046115883816432632406586944308380e-34, /* logil[202] */ } , { 1.11546897888183593750000000000000000000000000000000e+00, /* r[203] */ -1.57650392886728163421850013037328608334064483642578e-01, /* logih[203] */ 5.48897678434671628772441349557697552667538441741952e-19, /* logim[203] */ -6.79258603184423299240762713680989948394024184442684e-36, /* logil[203] */ } , { 1.11304283142089843750000000000000000000000000000000e+00, /* r[204] */ -1.54509110639958202604304915439570322632789611816406e-01, /* logih[204] */ -3.59136851163677714278758679380160119258917626559671e-19, /* logim[204] */ -1.56974154580554013761421709836383374626199071205828e-35, /* logil[204] */ } , { 1.11062812805175781250000000000000000000000000000000e+00, /* r[205] */ -1.51375839568216624675400794330926146358251571655273e-01, /* logih[205] */ 1.85511636793595219210186133192591461270305721253330e-18, /* logim[205] */ -1.91794182494587047847453803902174963816836368421214e-34, /* logil[205] */ } , { 1.10822486877441406250000000000000000000000000000000e+00, /* r[206] */ -1.48250646865354079873000614497868809849023818969727e-01, /* logih[206] */ -1.01653072428705486842585428998216576160196054521775e-17, /* logim[206] */ 5.31584010431656413312485980487520698550209333197199e-34, /* logil[206] */ } , { 1.10583114624023437500000000000000000000000000000000e+00, /* r[207] */ -1.45131111540638235712918913122848607599735260009766e-01, /* logih[207] */ -1.37520535926702420814491655344493331500786583007547e-17, /* logim[207] */ -3.12537587519576338142297025257101128398882620659901e-34, /* logil[207] */ } , { 1.10344886779785156250000000000000000000000000000000e+00, /* r[208] */ -1.42019778794149176270877887873211875557899475097656e-01, /* logih[208] */ -3.68499044867024074477140873097095881834850367397794e-18, /* logim[208] */ -1.63017157850342774197009569405883228185646262806831e-34, /* logil[208] */ } , { 1.10107612609863281250000000000000000000000000000000e+00, /* r[209] */ -1.38914217265857425909203470837383065372705459594727e-01, /* logih[209] */ -6.17799701560862884451695448882239750612348592334350e-18, /* logim[209] */ -2.34837262732331600500907295169491998103701955922085e-34, /* logil[209] */ } , { 1.09871292114257812500000000000000000000000000000000e+00, /* r[210] */ -1.35814478782694425529342652225750498473644256591797e-01, /* logih[210] */ -1.10878202856006564968015298269391791178600779503105e-17, /* logim[210] */ -6.34363946747343426901749776771284987530057524263824e-34, /* logil[210] */ } , { 1.09635925292968750000000000000000000000000000000000e+00, /* r[211] */ -1.32720615355253201972374199613113887608051300048828e-01, /* logih[211] */ 5.00671269578839009481340541432441710674698094423168e-18, /* logim[211] */ 5.65638829687757042763410955571684820831086486484696e-35, /* logil[211] */ } , { 1.09401702880859375000000000000000000000000000000000e+00, /* r[212] */ -1.29635194425267469275908638337568845599889755249023e-01, /* logih[212] */ -1.32741790693761805495822031536188642314117707435772e-17, /* logim[212] */ 2.36177367859446952683532192189387042515220366349614e-34, /* logil[212] */ } , { 1.09168434143066406250000000000000000000000000000000e+00, /* r[213] */ -1.26555763872087861932058672209677752107381820678711e-01, /* logih[213] */ 5.61175210355060094496565624276228808645454542333958e-18, /* logim[213] */ 2.47905722889287266912955785312024516940886239709541e-34, /* logil[213] */ } , { 1.08936119079589843750000000000000000000000000000000e+00, /* r[214] */ -1.23482376253153572354115397047280566766858100891113e-01, /* logih[214] */ -5.24860550833652446049807047479312960894536533343032e-18, /* logim[214] */ 1.57303914080610683083254197080760577504337194439462e-34, /* logil[214] */ } , { 1.08704948425292968750000000000000000000000000000000e+00, /* r[215] */ -1.20417615674669478686986678894754732027649879455566e-01, /* logih[215] */ 4.98589250874990455590729277739610886330195529901588e-19, /* logim[215] */ -2.77483656505407014767190386581182627944876838144956e-35, /* logil[215] */ } , { 1.08474540710449218750000000000000000000000000000000e+00, /* r[216] */ -1.17356477685791341092347295216313796117901802062988e-01, /* logih[216] */ -4.43816803292478642713439762323399536218860906455113e-18, /* logim[216] */ 1.57142075014587982329499427592772686845625881951589e-34, /* logil[216] */ } , { 1.08245277404785156250000000000000000000000000000000e+00, /* r[217] */ -1.14304083489448829458190459718025522306561470031738e-01, /* logih[217] */ -2.44497503421640839485178934251442732595447798838524e-18, /* logim[217] */ 9.13177011131237596027512825680515711244107356781889e-35, /* logil[217] */ } , { 1.08016967773437500000000000000000000000000000000000e+00, /* r[218] */ -1.11257954979794640437695818491192767396569252014160e-01, /* logih[218] */ 3.65465035573521902378371256352169641526181202186019e-18, /* logim[218] */ 3.01033668355988911672661379284389721222632837445285e-34, /* logil[218] */ } , { 1.07789421081542968750000000000000000000000000000000e+00, /* r[219] */ -1.08215592727541040640737435296614421531558036804199e-01, /* logih[219] */ -6.38939331108877749140470530072612418291901128036500e-18, /* logim[219] */ -1.57977443005077752334576053495157374607253022139958e-34, /* logil[219] */ } , { 1.07563018798828125000000000000000000000000000000000e+00, /* r[220] */ -1.05182150700728491155011568025656742975115776062012e-01, /* logih[220] */ 9.96668646201815079564771481993512113001566815373477e-19, /* logim[220] */ -8.40901520642174694941917655898657225968386843551730e-35, /* logil[220] */ } , { 1.07337570190429687500000000000000000000000000000000e+00, /* r[221] */ -1.02155135184729670139169854792271507903933525085449e-01, /* logih[221] */ 9.54331694819518742321529152057292821145759268608888e-19, /* logim[221] */ 8.08375441648303398276921573613512412447286382908005e-35, /* logil[221] */ } , { 1.07112884521484375000000000000000000000000000000000e+00, /* r[222] */ -9.91320311358910577492764559792703948915004730224609e-02, /* logih[222] */ -1.15319697956815851305646410589057158513062401209409e-19, /* logim[222] */ -7.40284620248563691684694048738117565554761996111872e-36, /* logil[222] */ } , { 1.06889343261718750000000000000000000000000000000000e+00, /* r[223] */ -9.61180252768258497342301893695548642426729202270508e-02, /* logih[223] */ 6.85171092643411485272954560328117638640557421326159e-18, /* logim[223] */ -1.67824770393390632739991704456259895006309663742546e-34, /* logil[223] */ } , { 1.06666755676269531250000000000000000000000000000000e+00, /* r[224] */ -9.31106082695352110789599464624188840389251708984375e-02, /* logih[224] */ -2.26105242874531783782517748931571159031922191193177e-18, /* logim[224] */ -2.03783945271517638711748368885966194474657481104373e-35, /* logil[224] */ } , { 1.06444931030273437500000000000000000000000000000000e+00, /* r[225] */ -9.01072494463056178348736580119293648749589920043945e-02, /* logih[225] */ -5.44728555823394356142980742937673446468666963750632e-18, /* logim[225] */ 1.97413590011115023111162093321380372124491875850575e-34, /* logil[225] */ } , { 1.06224060058593750000000000000000000000000000000000e+00, /* r[226] */ -8.71105777787103824350012359900574665516614913940430e-02, /* logih[226] */ -4.43564406369389579389284215323972775263708137166154e-18, /* logim[226] */ 1.70779313126122225936135094173405768955565424909277e-34, /* logil[226] */ } , { 1.06004142761230468750000000000000000000000000000000e+00, /* r[227] */ -8.41206480365157827083777419829857535660266876220703e-02, /* logih[227] */ -3.14792226986980839484335841464619768591703354318294e-18, /* logim[227] */ 1.52657062057281535176853536917634594017181918735262e-34, /* logil[227] */ } , { 1.05785179138183593750000000000000000000000000000000e+00, /* r[228] */ -8.11375151493067964247885015538486186414957046508789e-02, /* logih[228] */ -6.15912022353230257795364252670116201168948678312527e-18, /* logim[228] */ -2.16344593340788372463481302845555712130079294383972e-34, /* logil[228] */ } , { 1.05566978454589843750000000000000000000000000000000e+00, /* r[229] */ -7.81586275943592923010072581746499054133892059326172e-02, /* logih[229] */ -3.25085161347353548036706096407758727333265699647547e-18, /* logim[229] */ 1.63920542914931230587405015453230564450059005459335e-34, /* logil[229] */ } , { 1.05349731445312500000000000000000000000000000000000e+00, /* r[230] */ -7.51866364807085019172916418028762564063072204589844e-02, /* logih[230] */ -2.54870557338844162102455061406383024497892883435493e-18, /* logim[230] */ -6.59135720018155570156029431794739322327869508222348e-35, /* logil[230] */ } , { 1.05133438110351562500000000000000000000000000000000e+00, /* r[231] */ -7.22215972120476834561486612074077129364013671875000e-02, /* logih[231] */ -6.64425227252169993584924920404020380947983762424339e-18, /* logim[231] */ 2.91013479660203574471829316747093985065960871705841e-34, /* logil[231] */ } , { 1.04918098449707031250000000000000000000000000000000e+00, /* r[232] */ -6.92635653457482070027850795668200589716434478759766e-02, /* logih[232] */ -4.17058903808438561260436396327171311252509638555115e-18, /* logim[232] */ 3.30755248525805832232280848513964707004463090388921e-34, /* logil[232] */ } , { 1.04703521728515625000000000000000000000000000000000e+00, /* r[233] */ -6.63099684847409387433714300641440786421298980712891e-02, /* logih[233] */ -8.74727269069244478292642836141302714118531385326008e-19, /* logim[233] */ 9.13680180722266849670406326820143717312677461406295e-35, /* logil[233] */ } , { 1.04489707946777343750000000000000000000000000000000e+00, /* r[234] */ -6.33608463694464163484809660076280124485492706298828e-02, /* logih[234] */ 4.88853992059804485610361972971949389543857070116405e-18, /* logim[234] */ 3.59584991557930488620611395470856240222060784881851e-34, /* logil[234] */ } , { 1.04277038574218750000000000000000000000000000000000e+00, /* r[235] */ -6.04215166113879487141957724816165864467620849609375e-02, /* logih[235] */ 3.24424348086874445666593409656049253578069669395260e-18, /* logim[235] */ -1.60277475491901208789005491794898884020948020845008e-34, /* logil[235] */ } , { 1.04065132141113281250000000000000000000000000000000e+00, /* r[236] */ -5.74867630322526829145246551888703834265470504760742e-02, /* logih[236] */ 3.76759687947251899896914839649469366487490379203479e-19, /* logim[236] */ -2.21494568010334432329216609802290865335331834512200e-35, /* logil[236] */ } , { 1.03853988647460937500000000000000000000000000000000e+00, /* r[237] */ -5.45566258253886229856455258868663804605603218078613e-02, /* logih[237] */ -2.65946239302500951789232143661643591976491541288433e-18, /* logim[237] */ -1.53785481060545545279952344255193134903777587882504e-34, /* logil[237] */ } , { 1.03643798828125000000000000000000000000000000000000e+00, /* r[238] */ -5.16338003108584853162454919583979062736034393310547e-02, /* logih[238] */ -2.78795469954967100989074401097287044599854944339982e-18, /* logim[238] */ -1.49163921524354280847709876358289989763104855468257e-34, /* logil[238] */ } , { 1.03434371948242187500000000000000000000000000000000e+00, /* r[239] */ -4.87156827428533376056485337812773650512099266052246e-02, /* logih[239] */ 2.96381531361489610816411758109172878093342204001504e-18, /* logim[239] */ 1.90369184844193639243251585798972318425548902746587e-34, /* logil[239] */ } , { 1.03225898742675781250000000000000000000000000000000e+00, /* r[240] */ -4.58049794824296474526903466539806686341762542724609e-02, /* logih[240] */ 1.62105752345434014647769506007451291849983142737970e-18, /* logim[240] */ -9.20867893989873723178504588707200553003761945783565e-35, /* logil[240] */ } , { 1.03018188476562500000000000000000000000000000000000e+00, /* r[241] */ -4.28990763245113357338134107976657105609774589538574e-02, /* logih[241] */ -6.34003512301982273340105213426264835291352971908960e-19, /* logim[241] */ -3.19233228551439316201562934283596212957829301138982e-35, /* logil[241] */ } , { 1.02811241149902343750000000000000000000000000000000e+00, /* r[242] */ -3.99980141873396699558895761583698913455009460449219e-02, /* logih[242] */ 3.46776145155773436838304619563053637896412152479204e-18, /* logim[242] */ 1.18249199307224204078322468557405538276307569138571e-35, /* logil[242] */ } , { 1.02605247497558593750000000000000000000000000000000e+00, /* r[243] */ -3.71045159850557013103689030231180367991328239440918e-02, /* logih[243] */ -1.51254314986204784019866874830661020957859050088050e-18, /* logim[243] */ -4.62897721796816023188344967819483871559574158072420e-35, /* logil[243] */ } , { 1.02400016784667968750000000000000000000000000000000e+00, /* r[244] */ -3.42159518140385116025115053162153344601392745971680e-02, /* logih[244] */ -4.20171334566300044079146136535848239242167490849902e-19, /* logim[244] */ -1.97864138714387435136379874705706366605172130727980e-35, /* logil[244] */ } , { 1.02195549011230468750000000000000000000000000000000e+00, /* r[245] */ -3.13323630146640427773796488963853335008025169372559e-02, /* logih[245] */ -1.60932497177386839267872885266206616652634543879907e-18, /* logim[245] */ -6.28817851293024240545936211571266012891885359494453e-35, /* logil[245] */ } , { 1.01992034912109375000000000000000000000000000000000e+00, /* r[246] */ -2.84564890448900827124578682969513465650379657745361e-02, /* logih[246] */ -1.32743413787410314281579343321838041020056743726823e-18, /* logim[246] */ 2.04618286866463010251865131532183144563010428890917e-35, /* logil[246] */ } , { 1.01789283752441406250000000000000000000000000000000e+00, /* r[247] */ -2.55856842917966814665575725484814029186964035034180e-02, /* logih[247] */ -1.49154860937761055001848142233043312841087530311649e-18, /* logim[247] */ 2.02599394521852446744073942371740628593627411196085e-35, /* logil[247] */ } , { 1.01587295532226562500000000000000000000000000000000e+00, /* r[248] */ -2.27199905087555366345331009370056563057005405426025e-02, /* logih[248] */ 1.12960205619839265574985374116680854623969773242666e-18, /* logim[248] */ -8.34362880258700413677035364508655979450149223832712e-35, /* logil[248] */ } , { 1.01386070251464843750000000000000000000000000000000e+00, /* r[249] */ -1.98594495836460112336840921898328815586864948272705e-02, /* logih[249] */ -1.65424881469239763312059082975380380550401132087393e-20, /* logim[249] */ -1.17360571247672971463309448698886739285461152534205e-36, /* logil[249] */ } , { 1.01185798645019531250000000000000000000000000000000e+00, /* r[250] */ -1.70068230155151732529983377162352553568780422210693e-02, /* logih[250] */ 1.27516044327499840806046149901955205004460778589711e-19, /* logim[250] */ -8.52710691967735804583223211101678334615958045143104e-37, /* logil[250] */ } , { 1.00986099243164062500000000000000000000000000000000e+00, /* r[251] */ -1.41567193815739632983818907518980267923325300216675e-02, /* logih[251] */ 8.65690356839925383828965885125235491000373622359337e-19, /* logim[251] */ -1.64494399168713442766339462748988626277364551873170e-35, /* logil[251] */ } , { 1.00787353515625000000000000000000000000000000000000e+00, /* r[252] */ -1.13146252970666803122634647138511354569345712661743e-02, /* logih[252] */ 3.15936714773135871052341883744882960982174189853601e-19, /* logim[252] */ 2.39659922006639309827564391487460990569975332009368e-35, /* logil[252] */ } , { 1.00589370727539062500000000000000000000000000000000e+00, /* r[253] */ -8.47786370355218220351556368541423580609261989593506e-03, /* logih[253] */ -9.75735845129809026777533412359789145867559613642986e-20, /* logim[253] */ -6.04717464355893048249602969326230504905195484152609e-37, /* logil[253] */ } , { 1.00392150878906250000000000000000000000000000000000e+00, /* r[254] */ -5.64647714981406870921043505973102583084255456924438e-03, /* logih[254] */ 4.32956569441265152083688702413498400247673690133916e-19, /* logim[254] */ 2.23027666862069486060936208535887094361283857129620e-36, /* logil[254] */ } , { 1.00195693969726562500000000000000000000000000000000e+00, /* r[255] */ -2.82050831346294375231997797470739897107705473899841e-03, /* logih[255] */ 2.66775679488942854129723744389995508483544623376680e-20, /* logim[255] */ -8.80338525383831336492192061402657740638778525161937e-37, /* logil[255] */ } }; typedef struct tPi1_t_tag {double hiM1; double hi; double mi; double lo;} tPi1_t; typedef struct tPi2_t_tag {double hi; double mi; double lo;} tPi2_t; static const tPi1_t twoPowerIndex1[32] = { { 0.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex1MOne[0] */ 1.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex1hi[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex1mi[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex1lo[0] */ } , { 8.46162726943132067255332051658456293807830661535263e-05, /* twoPowerIndex1MOne[1] */ 1.00008461627269440441523329354822635650634765625000e+00, /* twoPowerIndex1hi[1] */ -9.12125999627646384986052256665186572875345252060450e-17, /* twoPowerIndex1mi[1] */ 3.36755111543914781718517640651013480155414711472518e-33, /* twoPowerIndex1lo[1] */ } , { 1.69239705302231071594454281381558757857419550418854e-04, /* twoPowerIndex1MOne[2] */ 1.00016923970530213772178740327944979071617126464844e+00, /* twoPowerIndex1hi[2] */ 9.33618533547846199388179470637929281332443150415515e-17, /* twoPowerIndex1mi[2] */ 3.77297954885090084710073756456287936644477196404411e-33, /* twoPowerIndex1lo[2] */ } , { 2.53870298429598856802813511279737213044427335262299e-04, /* twoPowerIndex1MOne[3] */ 1.00025387029842960373571258969604969024658203125000e+00, /* twoPowerIndex1hi[3] */ -4.89064911953409381305925724006739962094640351616807e-18, /* twoPowerIndex1mi[3] */ 8.69701308333596579376838706167199696373572491739592e-35, /* twoPowerIndex1lo[3] */ } , { 3.38508052682312944679093869027042273955885320901871e-04, /* twoPowerIndex1MOne[4] */ 1.00033850805268231809463941317517310380935668945312e+00, /* twoPowerIndex1hi[4] */ -5.14133393131895706530678267769194263660821897510018e-18, /* twoPowerIndex1mi[4] */ 3.65532984508913994275805274025238001612209382982528e-34, /* twoPowerIndex1lo[4] */ } , { 4.23152968666321135839808453837918023054953664541244e-04, /* twoPowerIndex1MOne[5] */ 1.00042315296866624052540828415658324956893920898438e+00, /* twoPowerIndex1hi[5] */ 8.06180631495321395718653515232725600012433502276551e-17, /* twoPowerIndex1mi[5] */ 2.27756032119564512217610282919955584270974037720845e-33, /* twoPowerIndex1lo[5] */ } , { 5.07805046987622405244011680736093694576993584632874e-04, /* twoPowerIndex1MOne[6] */ 1.00050780504698755279946453811135143041610717773438e+00, /* twoPowerIndex1hi[6] */ 6.96242402202057255168575283120383384543281723609229e-17, /* twoPowerIndex1mi[6] */ 5.20646484360987194687938744912769762301408608274186e-34, /* twoPowerIndex1lo[6] */ } , { 5.92464288252267119033733777655470476020127534866333e-04, /* twoPowerIndex1MOne[7] */ 1.00059246428825221464364858547924086451530456542969e+00, /* twoPowerIndex1hi[7] */ 5.24358776284676541346649133871799377889330385550410e-17, /* twoPowerIndex1mi[7] */ -1.16401717083964875595275373190622641096721208508067e-33, /* twoPowerIndex1lo[7] */ } , { 6.77130693066356655063220415513569605536758899688721e-04, /* twoPowerIndex1MOne[8] */ 1.00067713069306640782940576173132285475730895996094e+00, /* twoPowerIndex1hi[8] */ -5.11512329768566763581175858027414623025077801052578e-17, /* twoPowerIndex1mi[8] */ 6.98198098827029289611306311409722598417652045670746e-34, /* twoPowerIndex1lo[8] */ } , { 7.61804262036044053420236199514192776405252516269684e-04, /* twoPowerIndex1MOne[9] */ 1.00076180426203609208357647730736061930656433105469e+00, /* twoPowerIndex1hi[9] */ -4.80106395281352797253594357274293799083867247600929e-17, /* twoPowerIndex1mi[9] */ 1.60659089499355510094934148076620501547799589638472e-33, /* twoPowerIndex1lo[9] */ } , { 8.46484995767533420114869802119983432930894196033478e-04, /* twoPowerIndex1MOne[10] */ 1.00084648499576744917760606767842546105384826660156e+00, /* twoPowerIndex1hi[10] */ 8.42299002458648658027371639395540881533737558365359e-17, /* twoPowerIndex1mi[10] */ 2.36970468083963275494383447607242933566525306383712e-33, /* twoPowerIndex1lo[10] */ } , { 9.31172894867080143919968460153313571936450898647308e-04, /* twoPowerIndex1MOne[11] */ 1.00093117289486710497214971837820485234260559082031e+00, /* twoPowerIndex1hi[11] */ -2.48518461029926794844540008382519256098178534001306e-17, /* twoPowerIndex1mi[11] */ 1.46302367831163072138631641353266395843931006446965e-33, /* twoPowerIndex1lo[11] */ } , { 1.01586795994099100479135522334672714350745081901550e-03, /* twoPowerIndex1MOne[12] */ 1.00101586795994101919404783984646201133728027343750e+00, /* twoPowerIndex1hi[12] */ -2.82452207477616780689379931990767172214919031737312e-17, /* twoPowerIndex1mi[12] */ -1.95728551891328398835983018867545661396300096090192e-33, /* twoPowerIndex1lo[12] */ } , { 1.10057019159562384860717720869160984875634312629700e-03, /* twoPowerIndex1MOne[13] */ 1.00110057019159559565935069258557632565498352050781e+00, /* twoPowerIndex1hi[13] */ 2.82746405249917066780441808454827762565634907210646e-17, /* twoPowerIndex1mi[13] */ 2.84963022949056029094282669604361292342636089091009e-33, /* twoPowerIndex1lo[13] */ } , { 1.18527959043738845452964358884173634578473865985870e-03, /* twoPowerIndex1MOne[14] */ 1.00118527959043746022871346212923526763916015625000e+00, /* twoPowerIndex1hi[14] */ -7.18042456559213166577815896739695813826899291527385e-17, /* twoPowerIndex1mi[14] */ -4.76259460142737667571053552520587169925041399888400e-33, /* twoPowerIndex1lo[14] */ } , { 1.26999615707274501712198411240706263924948871135712e-03, /* twoPowerIndex1MOne[15] */ 1.00126999615707279467358148394851014018058776855469e+00, /* twoPowerIndex1hi[15] */ -4.95925540000318718201054702131568017537484907271764e-17, /* twoPowerIndex1mi[15] */ 1.38114240085784279494535821521711378076084168967947e-33, /* twoPowerIndex1lo[15] */ } , { 1.35471989210820577265170783221037709154188632965088e-03, /* twoPowerIndex1MOne[16] */ 1.00135471989210822485460994357708841562271118164062e+00, /* twoPowerIndex1hi[16] */ -1.89737284167929933536294189134998232481318340155287e-17, /* twoPowerIndex1mi[16] */ -1.14644761608474571162584330231223616391499645510675e-34, /* twoPowerIndex1lo[16] */ } , { 1.43945079615033413172886511688375321682542562484741e-03, /* twoPowerIndex1MOne[17] */ 1.00143945079615037663245402654865756630897521972656e+00, /* twoPowerIndex1hi[17] */ -4.25104299595813332360330451324069867137771018561227e-17, /* twoPowerIndex1mi[17] */ -1.57361794708548262075721650186677311111593370726069e-33, /* twoPowerIndex1lo[17] */ } , { 1.52418886980574446246561315376766287954524159431458e-03, /* twoPowerIndex1MOne[18] */ 1.00152418886980565382316399336559697985649108886719e+00, /* twoPowerIndex1hi[18] */ 9.06044106726912172835402556659442028244667434824268e-17, /* twoPowerIndex1mi[18] */ -9.28795936877474030548429956901821606468166518236870e-34, /* twoPowerIndex1lo[18] */ } , { 1.60893411368110274099751944021363669889979064464569e-03, /* twoPowerIndex1MOne[19] */ 1.00160893411368112637660487962421029806137084960938e+00, /* twoPowerIndex1hi[19] */ -2.36264836237383004793138962370023654775211297571300e-17, /* twoPowerIndex1mi[19] */ 8.71910060549436570048152399632583363263947185973970e-34, /* twoPowerIndex1lo[19] */ } , { 1.69368652838312633464312728648337724735029041767120e-03, /* twoPowerIndex1MOne[20] */ 1.00169368652838319810882694582687690854072570800781e+00, /* twoPowerIndex1hi[20] */ -7.17327634990031997530849131951948428542423257707819e-17, /* twoPowerIndex1mi[20] */ 6.07647560689104755979568262152596670382288431776872e-33, /* twoPowerIndex1lo[20] */ } , { 1.77844611451858400190395581574875905062071979045868e-03, /* twoPowerIndex1MOne[21] */ 1.00177844611451849488048537750728428363800048828125e+00, /* twoPowerIndex1hi[21] */ 8.90494708260750700506643975752906510626799035262348e-17, /* twoPowerIndex1mi[21] */ -1.07254669154255875107094381902285900913374960884151e-33, /* twoPowerIndex1lo[21] */ } , { 1.86321287269429545878363096989005498471669852733612e-03, /* twoPowerIndex1MOne[22] */ 1.00186321287269430868605013529304414987564086914062e+00, /* twoPowerIndex1hi[22] */ -1.33071962467226606689858482393149015112554043251841e-17, /* twoPowerIndex1mi[22] */ -3.85443386097781554341108465500150047004226523597749e-34, /* twoPowerIndex1lo[22] */ } , { 1.94798680351713202930918900079859668039716780185699e-03, /* twoPowerIndex1MOne[23] */ 1.00194798680351704334157147968653589487075805664062e+00, /* twoPowerIndex1hi[23] */ 8.86950831931357794861851693306328605666305931343879e-17, /* twoPowerIndex1mi[23] */ 2.75565261371873441737709070275465061950835621245478e-33, /* twoPowerIndex1lo[23] */ } , { 2.03276790759401642869064197327588772168383002281189e-03, /* twoPowerIndex1MOne[24] */ 1.00203276790759399084151937131537124514579772949219e+00, /* twoPowerIndex1hi[24] */ 2.57269259432211179649018725316354562817431777421067e-17, /* twoPowerIndex1mi[24] */ 6.79751255613789265201334995370535043187556454092516e-34, /* twoPowerIndex1lo[24] */ } , { 2.11755618553192319700184675923537724884226918220520e-03, /* twoPowerIndex1MOne[25] */ 1.00211755618553199909115392074454575777053833007812e+00, /* twoPowerIndex1hi[25] */ -7.60963076154928660009367289085332496679920703482915e-17, /* twoPowerIndex1mi[25] */ 4.75753257695507842037160015079808278438391224582425e-33, /* twoPowerIndex1lo[25] */ } , { 2.20235163793787653077616006669359194347634911537170e-03, /* twoPowerIndex1MOne[26] */ 1.00220235163793791599573523853905498981475830078125e+00, /* twoPowerIndex1hi[26] */ -3.92993778548451720552933864302152846562830407163222e-17, /* twoPowerIndex1mi[26] */ 2.22740945016647607963332576015739728975193247400334e-33, /* twoPowerIndex1lo[26] */ } , { 2.28715426541895461981512838178787205833941698074341e-03, /* twoPowerIndex1MOne[27] */ 1.00228715426541903354973328532651066780090332031250e+00, /* twoPowerIndex1hi[27] */ -7.91320298680023160041154790353287334442969086934633e-17, /* twoPowerIndex1mi[27] */ 4.30154033931455305578282137055178652288667345721532e-33, /* twoPowerIndex1lo[27] */ } , { 2.37196406858228422617762554125420138007029891014099e-03, /* twoPowerIndex1MOne[28] */ 1.00237196406858219965840817167190834879875183105469e+00, /* twoPowerIndex1hi[28] */ 8.46137724799471749932697856411684097253648908880386e-17, /* twoPowerIndex1mi[28] */ -1.15795350476069740873680647805085951983720786847012e-33, /* twoPowerIndex1lo[28] */ } , { 2.45678104803504588835028066284849046496674418449402e-03, /* twoPowerIndex1MOne[29] */ 1.00245678104803515040543970826547592878341674804688e+00, /* twoPowerIndex1hi[29] */ -1.04659436381151501919178287379323678295958386394535e-16, /* twoPowerIndex1mi[29] */ 5.63489769746205416541081978104590942612321060930815e-33, /* twoPowerIndex1lo[29] */ } , { 2.54160520438446958443878820332884060917422175407410e-03, /* twoPowerIndex1MOne[30] */ 1.00254160520438451165148308064090088009834289550781e+00, /* twoPowerIndex1hi[30] */ -4.19488324163994025318330321149973224973566383682287e-17, /* twoPowerIndex1mi[30] */ -1.10867727371575753136248480661711257993643946476249e-33, /* twoPowerIndex1lo[30] */ } , { 2.62643653823783820161485991206973267253488302230835e-03, /* twoPowerIndex1MOne[31] */ 1.00262643653823779743561317445710301399230957031250e+00, /* twoPowerIndex1hi[31] */ 4.09516010415381254633240310888754218841825131705667e-17, /* twoPowerIndex1mi[31] */ 4.18651539196539390512773521751259041499174185767385e-34, /* twoPowerIndex1lo[31] */ } }; static const tPi2_t twoPowerIndex2[256] = { { 1.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex2hi[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex2mi[0] */ 0.00000000000000000000000000000000000000000000000000e+00, /* twoPowerIndex2lo[0] */ } , { 1.00271127505020252179690487537300214171409606933594e+00, /* twoPowerIndex2hi[1] */ -3.63661592869226394431650732319448247819940912156384e-17, /* twoPowerIndex2mi[1] */ -6.58076018413558386665763067745208065096307047224855e-34, /* twoPowerIndex2lo[1] */ } , { 1.00542990111280272635951860138447955250740051269531e+00, /* twoPowerIndex2hi[2] */ 9.49918653545503175702165599813853704096085691656846e-17, /* twoPowerIndex2mi[2] */ 2.69197614795285565383714012654266434015814803945559e-33, /* twoPowerIndex2lo[2] */ } , { 1.00815589811841754830368245166027918457984924316406e+00, /* twoPowerIndex2hi[3] */ -3.25205875608430806088583499076669170064325943797327e-17, /* twoPowerIndex2mi[3] */ 2.46355206137317856028163445564386882918089954604456e-33, /* twoPowerIndex2lo[3] */ } , { 1.01088928605170047525518839393043890595436096191406e+00, /* twoPowerIndex2hi[4] */ -1.52347786033685771762884896542837070154735103108242e-17, /* twoPowerIndex2mi[4] */ -1.20527773363982029579667170059568717373235495431222e-33, /* twoPowerIndex2lo[4] */ } , { 1.01363008495148942955665916088037192821502685546875e+00, /* twoPowerIndex2hi[5] */ 9.28359976818356758749022147678502506693759778650960e-18, /* twoPowerIndex2mi[5] */ 4.13890589104247114331738780166693451804305210832799e-34, /* twoPowerIndex2lo[5] */ } , { 1.01637831491095309566219384578289464116096496582031e+00, /* twoPowerIndex2hi[6] */ -5.77217007319966002765782626628372138987895927390512e-17, /* twoPowerIndex2mi[6] */ -3.01819186434481667596632332663816426794401961980022e-34, /* twoPowerIndex2lo[6] */ } , { 1.01913399607773791366582827322417870163917541503906e+00, /* twoPowerIndex2hi[7] */ 3.60190498225966172216609531722640706381960474006480e-17, /* twoPowerIndex2mi[7] */ -3.04390025916336453718381303520593752766892414197373e-33, /* twoPowerIndex2lo[7] */ } , { 1.02189714865411662714222984504885971546173095703125e+00, /* twoPowerIndex2hi[8] */ 5.10922502897344389358977529484899213711118891193073e-17, /* twoPowerIndex2mi[8] */ 7.88422656496927442160138555121324022911581088833303e-34, /* twoPowerIndex2lo[8] */ } , { 1.02466779289713572076436776114860549569129943847656e+00, /* twoPowerIndex2hi[9] */ -7.56160786848777943963602624934464667278197265594918e-17, /* twoPowerIndex2mi[9] */ 3.82829708640966874425497233807001672128855640186408e-33, /* twoPowerIndex2lo[9] */ } , { 1.02744594911876374609960294037591665983200073242188e+00, /* twoPowerIndex2hi[10] */ -4.95607417464537044048053918668002938932966613516228e-17, /* twoPowerIndex2mi[10] */ 1.52647285191522534623240430678753798210498111737407e-33, /* twoPowerIndex2lo[10] */ } , { 1.03023163768604097967340749164577573537826538085938e+00, /* twoPowerIndex2hi[11] */ 3.31983004108081294376648458695381123964530598047240e-17, /* twoPowerIndex2mi[11] */ -6.05948719060829591517581519609021946982655246308260e-34, /* twoPowerIndex2lo[11] */ } , { 1.03302487902122841489926940994337201118469238281250e+00, /* twoPowerIndex2hi[12] */ 7.60083887402708848935418174694583720224989620170520e-18, /* twoPowerIndex2mi[12] */ 4.17547660336499599627565312970423748685953776150432e-34, /* twoPowerIndex2lo[12] */ } , { 1.03582569360195719809780712239444255828857421875000e+00, /* twoPowerIndex2hi[13] */ -7.80678239133763616702426510222438085291507518120348e-17, /* twoPowerIndex2mi[13] */ 4.83798199689382054315888822530184564936218864541054e-34, /* twoPowerIndex2lo[13] */ } , { 1.03863410196137873064969880942953750491142272949219e+00, /* twoPowerIndex2hi[14] */ 5.99627378885251061843052226928644856972739702249617e-17, /* twoPowerIndex2mi[14] */ -3.95663704958043112614113186183111724364471056517376e-33, /* twoPowerIndex2lo[14] */ } , { 1.04145012468831610341624127613613381981849670410156e+00, /* twoPowerIndex2hi[15] */ 3.78483048028757620965705119578257297756469464729973e-17, /* twoPowerIndex2mi[15] */ -2.78990868974053264987416432056918863121352708112718e-33, /* twoPowerIndex2lo[15] */ } , { 1.04427378242741375480306942336028441786766052246094e+00, /* twoPowerIndex2hi[16] */ 8.55188970553796489217080231819249267647451456689049e-17, /* twoPowerIndex2mi[16] */ -4.33079108057472301914865017639792677602990877842667e-33, /* twoPowerIndex2lo[16] */ } , { 1.04710509587928979335913481918396428227424621582031e+00, /* twoPowerIndex2hi[17] */ 7.27707724310431474860740275908141293488900903214077e-17, /* twoPowerIndex2mi[17] */ 4.72214361830876717418601268670474261741247234406534e-34, /* twoPowerIndex2lo[17] */ } , { 1.04994408580068721015265964524587616324424743652344e+00, /* twoPowerIndex2hi[18] */ 5.59293784812700258637018360670823030304395274991437e-17, /* twoPowerIndex2mi[18] */ 5.88211594754600857675576658960991674898106235024158e-33, /* twoPowerIndex2lo[18] */ } , { 1.05279077300462642341472019325010478496551513671875e+00, /* twoPowerIndex2hi[19] */ -9.62948289902693573941616400549765121885820038033846e-17, /* twoPowerIndex2mi[19] */ -1.08761347818786776096507022683126915318078909071327e-33, /* twoPowerIndex2lo[19] */ } , { 1.05564517836055715704901558638084679841995239257812e+00, /* twoPowerIndex2hi[20] */ 1.75932573877209198413667791203269037000656546957040e-18, /* twoPowerIndex2mi[20] */ -1.30396724977978376996223394717384715710429730879060e-34, /* twoPowerIndex2lo[20] */ } , { 1.05850732279451276163229067606152966618537902832031e+00, /* twoPowerIndex2hi[21] */ -7.15265185663778073796145114756001119612383138085358e-17, /* twoPowerIndex2mi[21] */ -5.64149549927303480417353705471376517000863783007238e-33, /* twoPowerIndex2lo[21] */ } , { 1.06137722728926209292410476336954161524772644042969e+00, /* twoPowerIndex2hi[22] */ -1.19735370853656575649342301877145101231593191394554e-17, /* twoPowerIndex2mi[22] */ -3.24019009642435813881917735260705206101901086389479e-34, /* twoPowerIndex2lo[22] */ } , { 1.06425491288446449900106927088927477598190307617188e+00, /* twoPowerIndex2hi[23] */ 5.07875419861123039357382102421174755425792834691388e-17, /* twoPowerIndex2mi[23] */ 1.50895958491701564197395322903064350349289305322861e-33, /* twoPowerIndex2lo[23] */ } , { 1.06714040067682369716806078940862789750099182128906e+00, /* twoPowerIndex2hi[24] */ -7.89985396684158212226333428391940791349522867645719e-17, /* twoPowerIndex2mi[24] */ 2.48773924323047906697979838020484860096229450391065e-33, /* twoPowerIndex2lo[24] */ } , { 1.07003371182024187291403904964681714773178100585938e+00, /* twoPowerIndex2hi[25] */ -9.93716271128891938111903502484820565662793756924256e-17, /* twoPowerIndex2mi[25] */ 2.31962344798684261201922994500766835313211720477486e-34, /* twoPowerIndex2lo[25] */ } , { 1.07293486752597555522470429423265159130096435546875e+00, /* twoPowerIndex2hi[26] */ -3.83966884335882380671154732420037314658136257342221e-18, /* twoPowerIndex2mi[26] */ -1.99249094904898757254369089814013323079830118271091e-34, /* twoPowerIndex2lo[26] */ } , { 1.07584388906279104780594479962019249796867370605469e+00, /* twoPowerIndex2hi[27] */ -1.00027161511441361124926436161855303296586383555652e-17, /* twoPowerIndex2mi[27] */ 6.88586299535442828962527763656910379336185001641212e-34, /* twoPowerIndex2lo[27] */ } , { 1.07876079775711986030728439800441265106201171875000e+00, /* twoPowerIndex2hi[28] */ -6.65666043605659260344452997720816205593857378631714e-17, /* twoPowerIndex2mi[28] */ -3.65812580131923690564246115619834327696213789275798e-33, /* twoPowerIndex2lo[28] */ } , { 1.08168561499321524976835462439339607954025268554688e+00, /* twoPowerIndex2hi[29] */ -4.78262390299708626555704566711052721844264408750016e-17, /* twoPowerIndex2mi[29] */ -2.29832484759747593833858703400029440154531888955339e-33, /* twoPowerIndex2lo[29] */ } , { 1.08461836221330920615457671374315395951271057128906e+00, /* twoPowerIndex2hi[30] */ 3.16615284581634611576111879942615084172431708553659e-17, /* twoPowerIndex2mi[30] */ -7.75514267549291199158161695245488815392525791097983e-34, /* twoPowerIndex2lo[30] */ } , { 1.08755906091776965993744852312374860048294067382812e+00, /* twoPowerIndex2hi[31] */ 5.40934930782029075923173884363871219691387098941733e-18, /* twoPowerIndex2mi[31] */ 3.48154867584145263827432069924110927169603001776988e-34, /* twoPowerIndex2lo[31] */ } , { 1.09050773266525768967483145388541743159294128417969e+00, /* twoPowerIndex2hi[32] */ -3.04678207981247114696551170541257032193091359539676e-17, /* twoPowerIndex2mi[32] */ 2.01705487848848619150139275849815038703452970938356e-33, /* twoPowerIndex2lo[32] */ } , { 1.09346439907288583981426199898123741149902343750000e+00, /* twoPowerIndex2hi[33] */ 1.44139581472692093419513384462869463509260880619035e-17, /* twoPowerIndex2mi[33] */ 4.08630093857659572006798113947020484158367259206261e-34, /* twoPowerIndex2lo[33] */ } , { 1.09642908181637688258547314035240560770034790039062e+00, /* twoPowerIndex2hi[34] */ -5.91993348444931582404791974798026685003551623353440e-17, /* twoPowerIndex2mi[34] */ 1.11454498034154926063604046797188107791920045228203e-33, /* twoPowerIndex2lo[34] */ } , { 1.09940180263022191375910097121959552168846130371094e+00, /* twoPowerIndex2hi[35] */ 7.17045959970192322482531070995357544666158025777059e-17, /* twoPowerIndex2mi[35] */ 2.13409756277809587478782727047623660463701953626949e-33, /* twoPowerIndex2lo[35] */ } , { 1.10238258330784089089604549371870234608650207519531e+00, /* twoPowerIndex2hi[36] */ 5.26603687157069438656191942579725322612448063343618e-17, /* twoPowerIndex2mi[36] */ 6.45805397536721410708490440561131106837447579889036e-34, /* twoPowerIndex2lo[36] */ } , { 1.10537144570174117319538709125481545925140380859375e+00, /* twoPowerIndex2hi[37] */ 8.23928876050021358995335359335922723831311179076842e-17, /* twoPowerIndex2mi[37] */ -1.04774466610247815442874156330747491506292900514778e-33, /* twoPowerIndex2lo[37] */ } , { 1.10836841172367872587756210123188793659210205078125e+00, /* twoPowerIndex2hi[38] */ -8.78681384518052661557648698444116835232371902158176e-17, /* twoPowerIndex2mi[38] */ -1.93068861306745460990089493247099606865877523423866e-33, /* twoPowerIndex2lo[38] */ } , { 1.11137350334481754821069898753194138407707214355469e+00, /* twoPowerIndex2hi[39] */ 5.56394502666969764310655992493514019038185064989534e-17, /* twoPowerIndex2mi[39] */ -1.17769877519864439845431603912093657619994388212320e-33, /* twoPowerIndex2lo[39] */ } , { 1.11438674259589243220602838846389204263687133789062e+00, /* twoPowerIndex2hi[40] */ 1.04102784568455709549461912557590544266030834754874e-16, /* twoPowerIndex2mi[40] */ 1.47570167344000313963428137759389241586071635800536e-33, /* twoPowerIndex2lo[40] */ } , { 1.11740815156736927882263898936798796057701110839844e+00, /* twoPowerIndex2hi[41] */ -7.97680590262822045600561531634368139010993610472575e-17, /* twoPowerIndex2mi[41] */ -3.13386648600120619264244700150043196400877518036064e-33, /* twoPowerIndex2lo[41] */ } , { 1.12043775240960674643986294540809467434883117675781e+00, /* twoPowerIndex2hi[42] */ -6.20108590655417874997850240693143539763038270522938e-17, /* twoPowerIndex2mi[42] */ 5.83820205528528388698845434843840374410554175693809e-33, /* twoPowerIndex2lo[42] */ } , { 1.12347556733301989773110562964575365185737609863281e+00, /* twoPowerIndex2hi[43] */ -9.69973758898704299543613376480429793851537956846792e-17, /* twoPowerIndex2mi[43] */ -2.26554127979727181051674177007680355310974340445620e-33, /* twoPowerIndex2lo[43] */ } , { 1.12652161860824184813623105583246797323226928710938e+00, /* twoPowerIndex2hi[44] */ 5.16585675879545673703180814711785602957687143067887e-17, /* twoPowerIndex2mi[44] */ -5.65916686170716220063974592097473710424342945964456e-34, /* twoPowerIndex2lo[44] */ } , { 1.12957592856628807886920640157768502831459045410156e+00, /* twoPowerIndex2hi[45] */ 6.71280585872625658757968769071561199197683972848295e-17, /* twoPowerIndex2mi[45] */ -1.07820162799000302104084759726971168076450417442143e-33, /* twoPowerIndex2lo[45] */ } , { 1.13263851959871919561351205629762262105941772460938e+00, /* twoPowerIndex2hi[46] */ 3.23735616673800026374280491083711282285071512434226e-17, /* twoPowerIndex2mi[46] */ -2.17410428198276732317664547375555516673086011902827e-33, /* twoPowerIndex2lo[46] */ } , { 1.13570941415780546357439106941455975174903869628906e+00, /* twoPowerIndex2hi[47] */ 5.06659992612615585870979493424241383844326077647274e-17, /* twoPowerIndex2mi[47] */ -1.32541787182048387837370885885176434849571625344055e-33, /* twoPowerIndex2lo[47] */ } , { 1.13878863475669156457570352358743548393249511718750e+00, /* twoPowerIndex2hi[48] */ 8.91281267602540777782023808215740339330966556723006e-17, /* twoPowerIndex2mi[48] */ -2.00741463283249448727846279877956608996968961458494e-33, /* twoPowerIndex2lo[48] */ } , { 1.14187620396956157620138583297375589609146118164062e+00, /* twoPowerIndex2hi[49] */ 4.65109117753141238740817792833606106064264488933295e-17, /* twoPowerIndex2mi[49] */ 1.16876708285186516119099627711493197934208124175159e-33, /* twoPowerIndex2lo[49] */ } , { 1.14497214443180417298151496652280911803245544433594e+00, /* twoPowerIndex2hi[50] */ 4.64128989217001065651476858937308428660295061803434e-17, /* twoPowerIndex2mi[50] */ 2.12613258776789922762135782566899992944567171074898e-34, /* twoPowerIndex2lo[50] */ } , { 1.14807647884017893780139729642542079091072082519531e+00, /* twoPowerIndex2hi[51] */ 6.89774023662719177044119892069339989513569982425983e-17, /* twoPowerIndex2mi[51] */ 4.18470834663834509017799649540704770686179227316921e-33, /* twoPowerIndex2lo[51] */ } , { 1.15118922995298267331065744656370952725410461425781e+00, /* twoPowerIndex2hi[52] */ 3.25071021886382721197741051783883831627922464835734e-17, /* twoPowerIndex2mi[52] */ 8.89091931637927159755660842958283684863470887791663e-34, /* twoPowerIndex2lo[52] */ } , { 1.15431042059021593537693206599215045571327209472656e+00, /* twoPowerIndex2hi[53] */ 1.04171289462732661865012882394503754385710309711063e-16, /* twoPowerIndex2mi[53] */ -5.36004208703313921208161123405733997004096829869921e-33, /* twoPowerIndex2lo[53] */ } , { 1.15744007363375112085179807763779535889625549316406e+00, /* twoPowerIndex2hi[54] */ -9.12387123113440028710214564331695285968225139034901e-17, /* twoPowerIndex2mi[54] */ 4.33323257285343273028953697402398811817365345749781e-33, /* twoPowerIndex2lo[54] */ } , { 1.16057821202749877897986152675002813339233398437500e+00, /* twoPowerIndex2hi[55] */ -3.26104020541739372182753051431941352277362975722267e-17, /* twoPowerIndex2mi[55] */ 7.11357834451307044066628553966351937724582011421575e-35, /* twoPowerIndex2lo[55] */ } , { 1.16372485877757747552152522985124960541725158691406e+00, /* twoPowerIndex2hi[56] */ 3.82920483692409349872159816102110059722238312159091e-17, /* twoPowerIndex2mi[56] */ 7.19709831987676327409679245188515478735702972651365e-34, /* twoPowerIndex2lo[56] */ } , { 1.16688003695248165847431209840578958392143249511719e+00, /* twoPowerIndex2hi[57] */ -8.79187957999916974198229633672296429647404899187201e-17, /* twoPowerIndex2mi[57] */ -2.87626642494823975790958872496361075697324563663418e-33, /* twoPowerIndex2lo[57] */ } , { 1.17004376968325018992800323758274316787719726562500e+00, /* twoPowerIndex2hi[58] */ -1.84774420179000469437829606444460290025923861011560e-18, /* twoPowerIndex2mi[58] */ 9.95026324026540894110632007684038501192747054873613e-35, /* twoPowerIndex2lo[58] */ } , { 1.17321608016363732041043022036319598555564880371094e+00, /* twoPowerIndex2hi[59] */ -7.28756258658499447915217361810881652407443644873380e-17, /* twoPowerIndex2mi[59] */ -5.80514434850720922900022428546053614526438490706197e-33, /* twoPowerIndex2lo[59] */ } , { 1.17639699165028122074261318630306050181388854980469e+00, /* twoPowerIndex2hi[60] */ 5.55420325421807896276684328889766000203735373777665e-17, /* twoPowerIndex2mi[60] */ -1.48842929343368511961710849782815827921712348302943e-33, /* twoPowerIndex2lo[60] */ } , { 1.17958652746287584456297281576553359627723693847656e+00, /* twoPowerIndex2hi[61] */ 1.00923127751003904353623199255548893172824487848155e-16, /* twoPowerIndex2mi[61] */ 2.56907593214680284136128623025833045419367581735075e-33, /* twoPowerIndex2lo[61] */ } , { 1.18278471098434101449470290390308946371078491210938e+00, /* twoPowerIndex2hi[62] */ 1.54297543007907605845327903967313855640292420619590e-17, /* twoPowerIndex2mi[62] */ 7.09719727836492954234152192412259750112212179635692e-34, /* twoPowerIndex2lo[62] */ } , { 1.18599156566099384058077248482732102274894714355469e+00, /* twoPowerIndex2hi[63] */ -9.20950683529310590495224568572832186256763277535644e-18, /* twoPowerIndex2mi[63] */ 4.45938700163758066851795410125927948023388255302655e-34, /* twoPowerIndex2lo[63] */ } , { 1.18920711500272102689734765590401366353034973144531e+00, /* twoPowerIndex2hi[64] */ 3.98201523146564611098029654755651628169309930562261e-17, /* twoPowerIndex2mi[64] */ 1.14195965688545340101163692105448367710482873511510e-33, /* twoPowerIndex2lo[64] */ } , { 1.19243138258315117816721340204821899533271789550781e+00, /* twoPowerIndex2hi[65] */ 4.39755141560972144344381120574300882985513737679934e-17, /* twoPowerIndex2mi[65] */ -2.41829020212771695653773640974975764989760653578657e-33, /* twoPowerIndex2lo[65] */ } , { 1.19566439203982732841780034505063667893409729003906e+00, /* twoPowerIndex2hi[66] */ 4.61660367048148139742806754321229408219716031742605e-17, /* twoPowerIndex2mi[66] */ 1.32248737144550668026460879187484144120719947949532e-33, /* twoPowerIndex2lo[66] */ } , { 1.19890616707438057986223611806053668260574340820312e+00, /* twoPowerIndex2hi[67] */ -9.80919335600842311847819900738643766443372921069732e-17, /* twoPowerIndex2mi[67] */ -5.29087429062105337716063232877224643258346493331853e-33, /* twoPowerIndex2lo[67] */ } , { 1.20215673145270307564658196497475728392601013183594e+00, /* twoPowerIndex2hi[68] */ 6.64498149925230124489270286991048474954122885069094e-17, /* twoPowerIndex2mi[68] */ -3.85685255336907654452995968372311171004938395576078e-33, /* twoPowerIndex2lo[68] */ } , { 1.20541610900512385917693336523370817303657531738281e+00, /* twoPowerIndex2hi[69] */ -3.35727219326752963448211014853517469169774564393197e-17, /* twoPowerIndex2mi[69] */ -4.92549550862177406688591486963370003941067572015491e-34, /* twoPowerIndex2lo[69] */ } , { 1.20868432362658162482205170817906036972999572753906e+00, /* twoPowerIndex2hi[70] */ -4.74672594522898409739364787077500872067787392617061e-17, /* twoPowerIndex2mi[70] */ -2.39731037167046840753848687443925994516005866460984e-33, /* twoPowerIndex2lo[70] */ } , { 1.21196139927680124337427969294367358088493347167969e+00, /* twoPowerIndex2hi[71] */ -4.89061107752111835731723583297106520554917182658748e-17, /* twoPowerIndex2mi[71] */ 3.03773638515966381050119516339532028224866436819777e-33, /* twoPowerIndex2lo[71] */ } , { 1.21524735998046895524282717815367504954338073730469e+00, /* twoPowerIndex2hi[72] */ -7.71263069268148813091257203929615917892526180720328e-17, /* twoPowerIndex2mi[72] */ 4.71720614288499816545262331753743129502653902881319e-33, /* twoPowerIndex2lo[72] */ } , { 1.21854222982740845182547673175577074289321899414062e+00, /* twoPowerIndex2hi[73] */ -9.00672695836383767486750626492663453576309245864756e-17, /* twoPowerIndex2mi[73] */ 5.16504109670658058144743067711083355626699725368541e-34, /* twoPowerIndex2lo[73] */ } , { 1.22184603297275762301410395593848079442977905273438e+00, /* twoPowerIndex2hi[74] */ -1.06110212114026911612338140955143073076587458436915e-16, /* twoPowerIndex2mi[74] */ 1.60374219470078741193166884413586755813454143083569e-33, /* twoPowerIndex2lo[74] */ } , { 1.22515879363714552674480273708468303084373474121094e+00, /* twoPowerIndex2hi[75] */ -8.90353381426998342947457496954569957296479418024787e-17, /* twoPowerIndex2mi[75] */ -3.38239295886914309313127675019861767225893406120572e-33, /* twoPowerIndex2lo[75] */ } , { 1.22848053610687002468182527081808075308799743652344e+00, /* twoPowerIndex2hi[76] */ -1.89878163130252995311948719658078062677878185721429e-17, /* twoPowerIndex2mi[76] */ 6.18469453652103848424687212656185051850860290411013e-34, /* twoPowerIndex2lo[76] */ } , { 1.23181128473407586199073193711228668689727783203125e+00, /* twoPowerIndex2hi[77] */ 7.38938247161005024655390749410851704831793332860224e-17, /* twoPowerIndex2mi[77] */ 5.66416860276341522848933887503853153547313928315175e-33, /* twoPowerIndex2lo[77] */ } , { 1.23515106393693341324535595049383118748664855957031e+00, /* twoPowerIndex2hi[78] */ -1.07552443443078413782534550626319265988634731989314e-16, /* twoPowerIndex2mi[78] */ -1.64465643112359468913735122191038582299186062892515e-33, /* twoPowerIndex2lo[78] */ } , { 1.23849989819981654015634831011993810534477233886719e+00, /* twoPowerIndex2hi[79] */ 2.76770205557396742995282629120281510329639442299790e-17, /* twoPowerIndex2mi[79] */ 2.66724789689442974848682438840669194714548350787063e-35, /* twoPowerIndex2lo[79] */ } , { 1.24185781207348400201340155035723000764846801757812e+00, /* twoPowerIndex2hi[80] */ 4.65802759183693679122616767654141683800114091774588e-17, /* twoPowerIndex2mi[80] */ -2.31439910378785985764079190411324307370918857557275e-33, /* twoPowerIndex2lo[80] */ } , { 1.24522483017525797954760946595342829823493957519531e+00, /* twoPowerIndex2hi[81] */ -4.67724044984672750044476807490179835934784763101964e-17, /* twoPowerIndex2mi[81] */ -6.19614441679121104595267684200368658842294828986636e-34, /* twoPowerIndex2lo[81] */ } , { 1.24860097718920481923987608752213418483734130859375e+00, /* twoPowerIndex2hi[82] */ -8.26181099902196355045651985461180951636054028345939e-17, /* twoPowerIndex2mi[82] */ -3.13508520893426556972542244676107480243422253073214e-33, /* twoPowerIndex2lo[82] */ } , { 1.25198627786631622171853450709022581577301025390625e+00, /* twoPowerIndex2hi[83] */ 4.83416715246989759958838285593793501234849559981127e-17, /* twoPowerIndex2mi[83] */ 1.78566475406016519018652742315549367024352654682538e-33, /* twoPowerIndex2lo[83] */ } , { 1.25538075702469109629078047873917967081069946289062e+00, /* twoPowerIndex2hi[84] */ -6.71138982129687841852821870522008036246320680675952e-18, /* twoPowerIndex2mi[84] */ -5.76846264325028352862497671463784812858487529613818e-35, /* twoPowerIndex2lo[84] */ } , { 1.25878443954971652729568631912115961313247680664062e+00, /* twoPowerIndex2hi[85] */ -8.42178258773059935676825219277948030487309990653640e-17, /* twoPowerIndex2mi[85] */ -3.42668790982954401635344774416743553535666629313219e-33, /* twoPowerIndex2lo[85] */ } , { 1.26219735039425073885865913325687870383262634277344e+00, /* twoPowerIndex2hi[86] */ -3.08446488747384646529907217460461327518172988421553e-17, /* twoPowerIndex2mi[86] */ 2.40882976270348351451454970147527613654722303853330e-33, /* twoPowerIndex2lo[86] */ } , { 1.26561951457880628169050396536476910114288330078125e+00, /* twoPowerIndex2hi[87] */ 4.25057700345086863701776979850140764907451511182054e-17, /* twoPowerIndex2mi[87] */ -2.43502301511662232808349177773715412240431561172854e-33, /* twoPowerIndex2lo[87] */ } , { 1.26905095719173321988648694969015195965766906738281e+00, /* twoPowerIndex2hi[88] */ 2.66793213134218609522998616502989391061315227839969e-18, /* twoPowerIndex2mi[88] */ -5.01723570938719050333027020376949013774930719140568e-35, /* twoPowerIndex2lo[88] */ } , { 1.27249170338940276181460831139702349901199340820312e+00, /* twoPowerIndex2hi[89] */ -1.05779162672124210291083901925683986461541009150905e-17, /* twoPowerIndex2mi[89] */ -2.93131904402812719815315335629352674850210527511727e-34, /* twoPowerIndex2lo[89] */ } , { 1.27594177839639200122689999261638149619102478027344e+00, /* twoPowerIndex2hi[90] */ 9.91543024421429032951245620636467731146795580787420e-17, /* twoPowerIndex2mi[90] */ 4.59759442266878048582159401225601949347063078487755e-33, /* twoPowerIndex2lo[90] */ } , { 1.27940120750566932450453805358847603201866149902344e+00, /* twoPowerIndex2hi[91] */ -9.75909500835606221035467671832651562727399972211988e-17, /* twoPowerIndex2mi[91] */ -1.38251039186524925998756795041289231285031751943997e-33, /* twoPowerIndex2lo[91] */ } , { 1.28287001607877826359072059858590364456176757812500e+00, /* twoPowerIndex2hi[92] */ 1.71359491824356096814175768900864730928374054987756e-17, /* twoPowerIndex2mi[92] */ 7.25131491282819461838977871983760669047046080773478e-34, /* twoPowerIndex2lo[92] */ } , { 1.28634822954602556777103927743155509233474731445312e+00, /* twoPowerIndex2hi[93] */ -3.41695570693618197637835756165078424638638756108411e-17, /* twoPowerIndex2mi[93] */ 3.01980638845024588477534724775904900964451374240343e-33, /* twoPowerIndex2lo[93] */ } , { 1.28983587340666572274017198651563376188278198242188e+00, /* twoPowerIndex2hi[94] */ 8.94925753089759172194875997189204564115016328268090e-17, /* twoPowerIndex2mi[94] */ 1.20830737845688318745384554764993450976718105981461e-33, /* twoPowerIndex2lo[94] */ } , { 1.29333297322908946647146422037621960043907165527344e+00, /* twoPowerIndex2hi[95] */ -2.97459044313275164581312778190571731582573264222880e-17, /* twoPowerIndex2mi[95] */ 1.16237613827319824876464974429153654014369509787634e-33, /* twoPowerIndex2lo[95] */ } , { 1.29683955465100964055125132290413603186607360839844e+00, /* twoPowerIndex2hi[96] */ 2.53825027948883149592910250791940344234383392801619e-17, /* twoPowerIndex2mi[96] */ 1.68678246461832500334243039646153124282288438904092e-34, /* twoPowerIndex2lo[96] */ } , { 1.30035564337965059422685953904874622821807861328125e+00, /* twoPowerIndex2hi[97] */ 5.67872810280221742200488134915364617768988996925235e-17, /* twoPowerIndex2mi[97] */ -2.65697595108343105071012773811939091954697862387724e-33, /* twoPowerIndex2lo[97] */ } , { 1.30388126519193581209776766627328470349311828613281e+00, /* twoPowerIndex2hi[98] */ 8.64767559826787117946355165568051639464066963273840e-17, /* twoPowerIndex2mi[98] */ 8.70201872477350096167517355607069078597678984954289e-34, /* twoPowerIndex2lo[98] */ } , { 1.30741644593467731816360810626065358519554138183594e+00, /* twoPowerIndex2hi[99] */ -7.33664565287886889230365718649852916028408328060276e-17, /* twoPowerIndex2mi[99] */ -2.93367882958631685351818537761286406545337467653224e-33, /* twoPowerIndex2lo[99] */ } , { 1.31096121152476441373835314152529463171958923339844e+00, /* twoPowerIndex2hi[100] */ -7.18153613551945385697245613605196258733040544776187e-17, /* twoPowerIndex2mi[100] */ -2.12629266743969557140434977160228094057588798528197e-34, /* twoPowerIndex2lo[100] */ } , { 1.31451558794935463581055046233814209699630737304688e+00, /* twoPowerIndex2hi[101] */ 2.26754331510458564505142831387082924518590502314377e-17, /* twoPowerIndex2mi[101] */ -7.52544640273480434326029480252966858598400235446401e-34, /* twoPowerIndex2lo[101] */ } , { 1.31807960126606404926974391855765134096145629882812e+00, /* twoPowerIndex2hi[102] */ -5.45795582714915350249059559812768392944707787964569e-17, /* twoPowerIndex2mi[102] */ 3.01605678846279399154010507026593082215688854819315e-34, /* twoPowerIndex2lo[102] */ } , { 1.32165327760315753913289427146082744002342224121094e+00, /* twoPowerIndex2hi[103] */ -2.48063824591302174150388078679826792820566433791932e-17, /* twoPowerIndex2mi[103] */ -7.98826352342197225244683042177702410050087972196938e-34, /* twoPowerIndex2lo[103] */ } , { 1.32523664315974132321684919588733464479446411132812e+00, /* twoPowerIndex2hi[104] */ -2.85873121003886137327027220806882812126373511580572e-17, /* twoPowerIndex2mi[104] */ 7.62021406397260431456821182703024347950927217409368e-34, /* twoPowerIndex2lo[104] */ } , { 1.32882972420595435458778865722706541419029235839844e+00, /* twoPowerIndex2hi[105] */ 4.08908622391016005194851803726881862830375046944341e-17, /* twoPowerIndex2mi[105] */ -8.25755527905788850028602577519818711544066895869934e-34, /* twoPowerIndex2lo[105] */ } , { 1.33243254708316150036750968865817412734031677246094e+00, /* twoPowerIndex2hi[106] */ -5.10158663091674395948874951281987248409217090958003e-17, /* twoPowerIndex2mi[106] */ 1.24161698455614255772408207369534691020717040259615e-33, /* twoPowerIndex2lo[106] */ } , { 1.33604513820414583236129146825987845659255981445312e+00, /* twoPowerIndex2hi[107] */ -5.89186635638880135250424875698763827220081961896780e-17, /* twoPowerIndex2mi[107] */ 4.82773672901544401626262260553683707114055277401310e-33, /* twoPowerIndex2lo[107] */ } , { 1.33966752405330291608720472140703350305557250976562e+00, /* twoPowerIndex2hi[108] */ 8.92728259483173198426255486589831591472085466011828e-17, /* twoPowerIndex2mi[108] */ -7.69657983531899254540849298389093495155758992415150e-34, /* twoPowerIndex2lo[108] */ } , { 1.34329973118683532185002604819601401686668395996094e+00, /* twoPowerIndex2hi[109] */ -5.80258089020143775129607366972124060945118168095697e-17, /* twoPowerIndex2mi[109] */ -5.62848183889096727330900462318018132434931156577971e-33, /* twoPowerIndex2lo[109] */ } , { 1.34694178623294580354752270068274810910224914550781e+00, /* twoPowerIndex2hi[110] */ 3.22406510125467916912928274924363934664289972360091e-17, /* twoPowerIndex2mi[110] */ -2.51832203762622189165076753162586788705235166031733e-33, /* twoPowerIndex2lo[110] */ } , { 1.35059371589203447427962601068429648876190185546875e+00, /* twoPowerIndex2hi[111] */ -8.28711038146241653260111018049835125653080776498248e-17, /* twoPowerIndex2mi[111] */ 2.79728744284194320208556684414100450680158956985147e-33, /* twoPowerIndex2lo[111] */ } , { 1.35425554693689265128853094211081042885780334472656e+00, /* twoPowerIndex2hi[112] */ 7.70094837980298946162338224151128414915778826123523e-17, /* twoPowerIndex2mi[112] */ -2.24074836437395028882100810844688282941385619430371e-33, /* twoPowerIndex2lo[112] */ } , { 1.35792730621290114179089414392365142703056335449219e+00, /* twoPowerIndex2hi[113] */ -9.52963574482518886708763256581296493681255450761483e-17, /* twoPowerIndex2mi[113] */ 3.94129059821951840862728683884868804521606133502020e-33, /* twoPowerIndex2lo[113] */ } , { 1.36160902063822475405174827756127342581748962402344e+00, /* twoPowerIndex2hi[114] */ 1.53378766127066804593191316699398053341331687545086e-18, /* twoPowerIndex2mi[114] */ 2.89261626537731219518175809165487342026413059288117e-36, /* twoPowerIndex2lo[114] */ } , { 1.36530071720401191548432962008519098162651062011719e+00, /* twoPowerIndex2hi[115] */ -1.00053631259747651675482154696825016305954942740907e-16, /* twoPowerIndex2mi[115] */ 3.54928742268818507952779264530371584695776903628456e-33, /* twoPowerIndex2lo[115] */ } , { 1.36900242297459051599162194179370999336242675781250e+00, /* twoPowerIndex2hi[116] */ 9.59379791911884877255545693637832999511204427845953e-17, /* twoPowerIndex2mi[116] */ -4.88674958784947176959607858061848292445663702071206e-33, /* twoPowerIndex2lo[116] */ } , { 1.37271416508766841424460380949312821030616760253906e+00, /* twoPowerIndex2hi[117] */ -4.49596059523484126201398925346079480634909342749196e-17, /* twoPowerIndex2mi[117] */ 1.62562490898807010621996863149362627894393561257459e-33, /* twoPowerIndex2lo[117] */ } , { 1.37643597075453016920221216423669829964637756347656e+00, /* twoPowerIndex2hi[118] */ -6.89858893587180104162314142277078705990308809896903e-17, /* twoPowerIndex2mi[118] */ -9.23154448708427617703494512509845826869729176165562e-34, /* twoPowerIndex2lo[118] */ } , { 1.38016786726023799047879947465844452381134033203125e+00, /* twoPowerIndex2hi[119] */ 1.05103145799699839461846797726451249170514296493641e-16, /* twoPowerIndex2mi[119] */ -5.20959403592477818815879901700610698718705668178631e-34, /* twoPowerIndex2lo[119] */ } , { 1.38390988196383202257777611521305516362190246582031e+00, /* twoPowerIndex2hi[120] */ -6.77051165879478628715737183479431151106043475381389e-17, /* twoPowerIndex2mi[120] */ 5.25954134785524271676320971772030766300829615286373e-34, /* twoPowerIndex2lo[120] */ } , { 1.38766204229852907481301826919661834836006164550781e+00, /* twoPowerIndex2hi[121] */ 8.42298427487541531761909892542259393461447669376914e-17, /* twoPowerIndex2mi[121] */ 4.46434333442928450361645463407705485478297602125654e-33, /* twoPowerIndex2lo[121] */ } , { 1.39142437577192623621158418245613574981689453125000e+00, /* twoPowerIndex2hi[122] */ -4.90617486528898932450860315361961796480813828948749e-17, /* twoPowerIndex2mi[122] */ 9.41947135373105773751136712580396521761942792376029e-34, /* twoPowerIndex2lo[122] */ } , { 1.39519690996620027156893684150418266654014587402344e+00, /* twoPowerIndex2hi[123] */ -9.32933622422549655219151241388008074464471865703576e-17, /* twoPowerIndex2mi[123] */ 3.85009236000292978304841859575059463134595037095756e-33, /* twoPowerIndex2lo[123] */ } , { 1.39897967253831123635166022722842171788215637207031e+00, /* twoPowerIndex2hi[124] */ -9.61421320905132307233280072508933760749140842467170e-17, /* twoPowerIndex2mi[124] */ 3.97465190077505680357285219692652769985214754647576e-33, /* twoPowerIndex2lo[124] */ } , { 1.40277269122020475933254601841326802968978881835938e+00, /* twoPowerIndex2hi[125] */ -5.29578324940798922315924317002369067798815514694702e-17, /* twoPowerIndex2mi[125] */ 3.01901046243343149118437935612420792667881700875337e-33, /* twoPowerIndex2lo[125] */ } , { 1.40657599381901543544870492041809484362602233886719e+00, /* twoPowerIndex2hi[126] */ 7.03491481213642218799944724280847971836007996977941e-18, /* twoPowerIndex2mi[126] */ -1.87515169946872014216649248611672456272335645241101e-34, /* twoPowerIndex2lo[126] */ } , { 1.41038960821727066274888784391805529594421386718750e+00, /* twoPowerIndex2hi[127] */ 4.16654872843506225899503851018795172623979530606656e-17, /* twoPowerIndex2mi[127] */ -2.40474814922300276552970992509731322006163156322473e-33, /* twoPowerIndex2lo[127] */ } , { 1.41421356237309514547462185873882845044136047363281e+00, /* twoPowerIndex2hi[128] */ -9.66729331345291345105469972976694765012981670542977e-17, /* twoPowerIndex2mi[128] */ 4.13867530869941356271900493210877889450985709540127e-33, /* twoPowerIndex2lo[128] */ } , { 1.41804788432041517509674122266005724668502807617188e+00, /* twoPowerIndex2hi[129] */ 2.27443854218552945230015468607785816403034626672752e-17, /* twoPowerIndex2mi[129] */ 6.11983793133626012461813597014932765313298826737750e-34, /* twoPowerIndex2lo[129] */ } , { 1.42189260216916557588717751059448346495628356933594e+00, /* twoPowerIndex2hi[130] */ -1.60778289158902441338409661475962612292273904731179e-17, /* twoPowerIndex2mi[130] */ 7.68807227837949092746953551637615091691382851311989e-34, /* twoPowerIndex2lo[130] */ } , { 1.42574774410549420800009556842269375920295715332031e+00, /* twoPowerIndex2hi[131] */ 9.88069075850060728430483918067849097743150129356283e-17, /* twoPowerIndex2mi[131] */ -5.89890673162487333450312700634529433299513739860251e-34, /* twoPowerIndex2lo[131] */ } , { 1.42961333839197002326670826732879504561424255371094e+00, /* twoPowerIndex2hi[132] */ -1.20316424890536551791763281075597751007148682598677e-17, /* twoPowerIndex2mi[132] */ 3.96492532243389364766543780399018506300743370884771e-35, /* twoPowerIndex2lo[132] */ } , { 1.43348941336778890054404200782300904393196105957031e+00, /* twoPowerIndex2hi[133] */ -5.80245424392682610310488944560210655448170298910740e-17, /* twoPowerIndex2mi[133] */ -1.27850570502833499820846554122319062699206032852878e-33, /* twoPowerIndex2lo[133] */ } , { 1.43737599744898236764356624917127192020416259765625e+00, /* twoPowerIndex2hi[134] */ -4.20403401646755661224775048184723117388682958150796e-17, /* twoPowerIndex2mi[134] */ -7.70667502347783805122329265482919129596484289448427e-34, /* twoPowerIndex2lo[134] */ } , { 1.44127311912862565712600826373090967535972595214844e+00, /* twoPowerIndex2hi[135] */ 5.60250365087898567500720975825924684730592892906837e-18, /* twoPowerIndex2mi[135] */ -1.78220423347129903406970040172107023860560188781295e-34, /* twoPowerIndex2lo[135] */ } , { 1.44518080697704665027458759141154587268829345703125e+00, /* twoPowerIndex2hi[136] */ -3.02375813499398731939978948265280760393682335269040e-17, /* twoPowerIndex2mi[136] */ -1.77301195820250091791088617662298487007284882395542e-33, /* twoPowerIndex2lo[136] */ } , { 1.44909908964203504311285541916731745004653930664062e+00, /* twoPowerIndex2hi[137] */ -6.25940500081930925440932857364551992320704493612607e-17, /* twoPowerIndex2mi[137] */ -2.36452377319288878996205003453964701184928253771460e-33, /* twoPowerIndex2lo[137] */ } , { 1.45302799584905262264555858564563095569610595703125e+00, /* twoPowerIndex2hi[138] */ -5.77994860939610610226179416579990281210592783980168e-17, /* twoPowerIndex2mi[138] */ 4.65449358394055530593548186610866020262848130035371e-33, /* twoPowerIndex2lo[138] */ } , { 1.45696755440144376514410851086722686886787414550781e+00, /* twoPowerIndex2hi[139] */ 5.64867945387699814049307308799040836462273423076302e-17, /* twoPowerIndex2mi[139] */ 5.24967327842642970132560251109596346953497158893017e-33, /* twoPowerIndex2lo[139] */ } , { 1.46091779418064704465507475106278434395790100097656e+00, /* twoPowerIndex2hi[140] */ -5.60037718607521580013156831807759453639536208267684e-17, /* twoPowerIndex2mi[140] */ -4.80948804890004400970317146361816382779746350931714e-33, /* twoPowerIndex2lo[140] */ } , { 1.46487874414640573128565392835298553109169006347656e+00, /* twoPowerIndex2hi[141] */ 9.53076754358715731899854652788308463901335051797481e-17, /* twoPowerIndex2mi[141] */ -3.69846856553667878907707087404919621014972996085084e-34, /* twoPowerIndex2lo[141] */ } , { 1.46885043333698184220281746092950925230979919433594e+00, /* twoPowerIndex2hi[142] */ 8.46588275653362760829764150554853775141300918573480e-17, /* twoPowerIndex2mi[142] */ -3.90998276339861143341660977862311141233961685102469e-33, /* twoPowerIndex2lo[142] */ } , { 1.47283289086936752809720019286032766103744506835938e+00, /* twoPowerIndex2hi[143] */ 6.69177408194058937165142250867005391292400049525410e-17, /* twoPowerIndex2mi[143] */ -8.03669204969698754299165627994407636733379029439982e-34, /* twoPowerIndex2lo[143] */ } , { 1.47682614593949934622685304930200800299644470214844e+00, /* twoPowerIndex2hi[144] */ -3.48399455689279579579151031868718147769491495422105e-17, /* twoPowerIndex2mi[144] */ -1.21157704523090580028169713170353136148082368354920e-34, /* twoPowerIndex2lo[144] */ } , { 1.48083022782247186732718091661809012293815612792969e+00, /* twoPowerIndex2hi[145] */ -9.68695210263061857840747540204704607519762865792956e-17, /* twoPowerIndex2mi[145] */ -1.83093426853584085824897446366702716297781292402913e-33, /* twoPowerIndex2lo[145] */ } , { 1.48484516587275239274390514765400439500808715820312e+00, /* twoPowerIndex2hi[146] */ 1.07800867644074807558776439636082922597575014362313e-16, /* twoPowerIndex2mi[146] */ -5.64322930459841965610869302140803670685265398096703e-33, /* twoPowerIndex2lo[146] */ } , { 1.48887098952439700383365561719983816146850585937500e+00, /* twoPowerIndex2hi[147] */ 6.15536715774287133031442683555328448918198696888232e-17, /* twoPowerIndex2mi[147] */ -4.97910816988088435273822881157670080090569125411939e-33, /* twoPowerIndex2lo[147] */ } , { 1.49290772829126483500772337720263749361038208007812e+00, /* twoPowerIndex2hi[148] */ 1.41929201542840357707378184476885202767753055101956e-17, /* twoPowerIndex2mi[148] */ 2.77326329344780505247628358108799734324783290873618e-34, /* twoPowerIndex2lo[148] */ } , { 1.49695541176723545540028226241702213883399963378906e+00, /* twoPowerIndex2hi[149] */ -2.86166325389915821108552064438047364932070584938283e-17, /* twoPowerIndex2mi[149] */ 1.69686608128918952548566738297292377457978745974095e-33, /* twoPowerIndex2lo[149] */ } , { 1.50101406962642558440279572096187621355056762695312e+00, /* twoPowerIndex2hi[150] */ -6.41376727579023503858812048925241405475211237704851e-17, /* twoPowerIndex2mi[150] */ 2.82195851325152411917232690264483764919093983459578e-33, /* twoPowerIndex2lo[150] */ } , { 1.50508373162340647333223841997096315026283264160156e+00, /* twoPowerIndex2hi[151] */ 7.07471061358284636428966552102679897344999964477370e-17, /* twoPowerIndex2mi[151] */ 5.47182451113168633513345414695618261455556199846033e-33, /* twoPowerIndex2lo[151] */ } , { 1.50916442759342284141155232646269723773002624511719e+00, /* twoPowerIndex2hi[152] */ -1.01645532775429503910501990740249618370059871055172e-16, /* twoPowerIndex2mi[152] */ 2.04191706967403438352422808603561166583202022922508e-34, /* twoPowerIndex2lo[152] */ } , { 1.51325618745260981334865846292814239859580993652344e+00, /* twoPowerIndex2hi[153] */ 8.88449785133871209092649041499311129526944241199989e-17, /* twoPowerIndex2mi[153] */ 2.91936471176098668822594707319785335362070597228113e-33, /* twoPowerIndex2lo[153] */ } , { 1.51735904119821474189677701360778883099555969238281e+00, /* twoPowerIndex2hi[154] */ -4.30869947204334080070359075619950231322291381069658e-17, /* twoPowerIndex2mi[154] */ -2.07710051583928391994432084290324754641836773161677e-33, /* twoPowerIndex2lo[154] */ } , { 1.52147301890881458952264893014216795563697814941406e+00, /* twoPowerIndex2hi[155] */ -5.99638767594568341984511314492633394994506478752408e-18, /* twoPowerIndex2mi[155] */ 3.17143766271956082831607786726725332519992796566057e-34, /* twoPowerIndex2lo[155] */ } , { 1.52559815074453841710067081294255331158638000488281e+00, /* twoPowerIndex2hi[156] */ -1.10249417123425609363148008789604625195179292613569e-16, /* twoPowerIndex2mi[156] */ -2.99382882637137806007903782085057425945683820190483e-33, /* twoPowerIndex2lo[156] */ } , { 1.52973446694728698602716576715465635061264038085938e+00, /* twoPowerIndex2hi[157] */ 3.78579211515721965312581373704701424608681121499690e-17, /* twoPowerIndex2mi[157] */ -1.13571103486415982326219089189691662922640586007719e-33, /* twoPowerIndex2lo[157] */ } , { 1.53388199784095591304833305912325158715248107910156e+00, /* twoPowerIndex2hi[158] */ 8.87522684443844614134710276926299051548575116130438e-17, /* twoPowerIndex2mi[158] */ 5.65828980010215437966290324879670843424190599145086e-33, /* twoPowerIndex2lo[158] */ } , { 1.53804077383165682668675344757502898573875427246094e+00, /* twoPowerIndex2hi[159] */ 1.01746723511613592944060366030036337911942910864054e-16, /* twoPowerIndex2mi[159] */ -6.16113785188921653281369270464531950196652324750545e-33, /* twoPowerIndex2lo[159] */ } , { 1.54221082540794074411394376511452719569206237792969e+00, /* twoPowerIndex2hi[160] */ 7.94983480969762085616103882937991564856794389991833e-17, /* twoPowerIndex2mi[160] */ -9.15995637410036729585390444224530830478731117122757e-34, /* twoPowerIndex2lo[160] */ } , { 1.54639218314102144802291149972006678581237792968750e+00, /* twoPowerIndex2hi[161] */ 1.06839600056572198027549065429961389678954641782420e-16, /* twoPowerIndex2mi[161] */ 5.83718082376326468071834720519101607593932706278383e-33, /* twoPowerIndex2lo[161] */ } , { 1.55058487768499997372373400139622390270233154296875e+00, /* twoPowerIndex2hi[162] */ -1.46007065906893851790690523707186238729906746210228e-17, /* twoPowerIndex2mi[162] */ -4.77975052472883005267659258241957348576642768400574e-34, /* twoPowerIndex2lo[162] */ } , { 1.55478893977708865214992783876368775963783264160156e+00, /* twoPowerIndex2hi[163] */ -8.00316135011603564103663107910618902189361743978666e-17, /* twoPowerIndex2mi[163] */ 3.43160502571587532396871747107270731912475137535806e-33, /* twoPowerIndex2lo[163] */ } , { 1.55900440023783692922165755589958280324935913085938e+00, /* twoPowerIndex2hi[164] */ 3.78120705335752750188190562589679090842557793649900e-17, /* twoPowerIndex2mi[164] */ 5.94230221045385633407443935898656310894518533675204e-35, /* twoPowerIndex2lo[164] */ } , { 1.56323128997135762929815427924040704965591430664062e+00, /* twoPowerIndex2hi[165] */ 7.48477764559073438896405945862770341857979941287485e-17, /* twoPowerIndex2mi[165] */ 4.94341409405079431354025041618045920322070178828810e-33, /* twoPowerIndex2lo[165] */ } , { 1.56746963996555299658552939945366233587265014648438e+00, /* twoPowerIndex2hi[166] */ -1.03520617688497219882501733748772197895029551157134e-16, /* twoPowerIndex2mi[166] */ 2.69762629340863925921698542881054318260398435611831e-33, /* twoPowerIndex2lo[166] */ } , { 1.57171948129234140267840302840340882539749145507812e+00, /* twoPowerIndex2hi[167] */ -3.34298400468720006928343525035325490394427299333229e-17, /* twoPowerIndex2mi[167] */ -2.50544082539015029477640638701507533908898561837361e-33, /* twoPowerIndex2lo[167] */ } , { 1.57598084510788649659218663146020844578742980957031e+00, /* twoPowerIndex2hi[168] */ -1.01369164712783039807957177429288269249745537889645e-17, /* twoPowerIndex2mi[168] */ 5.43913851556220712785038586461119929989856637311730e-34, /* twoPowerIndex2lo[168] */ } , { 1.58025376265282457843852625956060364842414855957031e+00, /* twoPowerIndex2hi[169] */ -5.16340292955446806158689134977166394905402588028521e-17, /* twoPowerIndex2mi[169] */ -1.98856458425291225043917897550918006467398545517999e-33, /* twoPowerIndex2lo[169] */ } , { 1.58453826525249374945758518151706084609031677246094e+00, /* twoPowerIndex2hi[170] */ -1.93377170345857029303925724496164498303135170130746e-17, /* twoPowerIndex2mi[170] */ -9.89372992541829104414473016298122291261880812772281e-35, /* twoPowerIndex2lo[170] */ } , { 1.58883438431716395022874621645314618945121765136719e+00, /* twoPowerIndex2hi[171] */ -5.99495011882447940051706621855722696087552777078266e-18, /* twoPowerIndex2mi[171] */ 3.40432693814393853234442560718610272389282350802004e-34, /* twoPowerIndex2lo[171] */ } , { 1.59314215134226699888131406623870134353637695312500e+00, /* twoPowerIndex2hi[172] */ -1.00944065423119637216151952902063201612012779755882e-16, /* twoPowerIndex2mi[172] */ 4.60848399034962572477662350836868643017178368092553e-33, /* twoPowerIndex2lo[172] */ } , { 1.59746159790862707339442749798763543367385864257812e+00, /* twoPowerIndex2hi[173] */ 2.48683927962209992068662736190579938975994331984811e-17, /* twoPowerIndex2mi[173] */ -1.50139044932662639156159749783676630723204028336974e-33, /* twoPowerIndex2lo[173] */ } , { 1.60179275568269341434302077686879783868789672851562e+00, /* twoPowerIndex2hi[174] */ -6.05491745352778434252262534739031747865810833110836e-17, /* twoPowerIndex2mi[174] */ -7.86094560028510434095753390665330649540069137640692e-34, /* twoPowerIndex2lo[174] */ } , { 1.60613565641677102924234077363507822155952453613281e+00, /* twoPowerIndex2hi[175] */ -1.03545452880599952590528959597961463687339938363058e-16, /* twoPowerIndex2mi[175] */ 1.51213609096324399449109200330291470931948233371206e-33, /* twoPowerIndex2lo[175] */ } , { 1.61049033194925428347232809755951166152954101562500e+00, /* twoPowerIndex2hi[176] */ 2.47071925697978878522451183466139791436957933053447e-17, /* twoPowerIndex2mi[176] */ 1.06968477888935897586507304780358756526593706030066e-33, /* twoPowerIndex2lo[176] */ } , { 1.61485681420486071324660315440269187092781066894531e+00, /* twoPowerIndex2hi[177] */ -7.31666339912512326264416948227914471406433964055342e-17, /* twoPowerIndex2mi[177] */ -1.01595252547599872757692201057811430532632162793873e-33, /* twoPowerIndex2lo[177] */ } , { 1.61923513519486372835842757922364398837089538574219e+00, /* twoPowerIndex2hi[178] */ 2.09413341542290924068018622986227170935043667427799e-17, /* twoPowerIndex2mi[178] */ 1.27693128474282181836038535044586644559852980247542e-35, /* twoPowerIndex2lo[178] */ } , { 1.62362532701732886764034446969162672758102416992188e+00, /* twoPowerIndex2hi[179] */ -3.58451285141447470995906396542340522908345291030162e-17, /* twoPowerIndex2mi[179] */ 2.01654731462508044313244700316326841947169625164993e-33, /* twoPowerIndex2lo[179] */ } , { 1.62802742185734783397776936908485367894172668457031e+00, /* twoPowerIndex2hi[180] */ -6.71295508470708408629558620522800193343463268850872e-17, /* twoPowerIndex2mi[180] */ 1.86124288813399584090278118171650158752835667500490e-33, /* twoPowerIndex2lo[180] */ } , { 1.63244145198727497181323542463360354304313659667969e+00, /* twoPowerIndex2hi[181] */ 9.85281923042999296413676989512408187295863462194442e-17, /* twoPowerIndex2mi[181] */ 5.29569525404258920205362940337854972086009006345576e-33, /* twoPowerIndex2lo[181] */ } , { 1.63686744976696441078445332095725461840629577636719e+00, /* twoPowerIndex2hi[182] */ 7.69832507131987557450420469117071256581189667741842e-17, /* twoPowerIndex2mi[182] */ 4.09860242950305193227828568999385703476733354155568e-33, /* twoPowerIndex2lo[182] */ } , { 1.64130544764400632118395151337608695030212402343750e+00, /* twoPowerIndex2hi[183] */ -9.24756873764070550805453694792420241616904847542502e-17, /* twoPowerIndex2mi[183] */ -5.66841671716411725558391721762496706416420121341510e-33, /* twoPowerIndex2lo[183] */ } , { 1.64575547815396494577555586147354915738105773925781e+00, /* twoPowerIndex2hi[184] */ -1.01256799136747726037875241569662212149731136230039e-16, /* twoPowerIndex2mi[184] */ -6.73838498803664271467304077725442401461793880458369e-34, /* twoPowerIndex2lo[184] */ } , { 1.65021757392061774183389388781506568193435668945312e+00, /* twoPowerIndex2hi[185] */ 9.13327958872990419009159019732303823956193063692260e-18, /* twoPowerIndex2mi[185] */ 3.31329049471088319516103160150508562888797231765374e-34, /* twoPowerIndex2lo[185] */ } , { 1.65469176765619430113929411163553595542907714843750e+00, /* twoPowerIndex2hi[186] */ 9.64329430319602866138745392638249192962312397541490e-17, /* twoPowerIndex2mi[186] */ -4.32763297888919888932772949708066540512036129088577e-33, /* twoPowerIndex2lo[186] */ } , { 1.65917809216161615815110508265206590294837951660156e+00, /* twoPowerIndex2hi[187] */ -7.27554555082305065439455737740507311483946617362319e-17, /* twoPowerIndex2mi[187] */ 3.10484891456420478411627075503167773401278965655170e-33, /* twoPowerIndex2lo[187] */ } , { 1.66367658032673637613640948984539136290550231933594e+00, /* twoPowerIndex2hi[188] */ 5.89099269671309967045155789620226639428173542900082e-17, /* twoPowerIndex2mi[188] */ 2.37785299276765025315795732233641105960161859663372e-33, /* twoPowerIndex2lo[188] */ } , { 1.66818726513058246396781214571092277765274047851562e+00, /* twoPowerIndex2hi[189] */ 4.26917801957061509059398373181907237215463008872616e-17, /* twoPowerIndex2mi[189] */ -1.29778952562173962775902833320678339532997660143370e-33, /* twoPowerIndex2lo[189] */ } , { 1.67271017964159662838596887013409286737442016601562e+00, /* twoPowerIndex2hi[190] */ -5.47671596459956307615994670748846981852905207478754e-17, /* twoPowerIndex2mi[190] */ -6.83184087311466618520328543794554690349915956941633e-34, /* twoPowerIndex2lo[190] */ } , { 1.67724535701787846875276954961009323596954345703125e+00, /* twoPowerIndex2hi[191] */ 8.30394950995073278534724188038576562525621449256837e-17, /* twoPowerIndex2mi[191] */ -3.67907931420049303621015743180896250029187335304385e-33, /* twoPowerIndex2lo[191] */ } , { 1.68179283050742900407215074665145948529243469238281e+00, /* twoPowerIndex2hi[192] */ 8.19901002058149652012724391042374107310082144797238e-17, /* twoPowerIndex2mi[192] */ 5.10351519472809316392686812760480457926425713861784e-33, /* twoPowerIndex2lo[192] */ } , { 1.68635263344839336774327875900780782103538513183594e+00, /* twoPowerIndex2hi[193] */ -7.18146327835801067471572934253931013376714544778519e-17, /* twoPowerIndex2mi[193] */ 3.52898289014887861077288846281933083915589270719972e-33, /* twoPowerIndex2lo[193] */ } , { 1.69092479926930527867057207913603633642196655273438e+00, /* twoPowerIndex2hi[194] */ -9.66967147439488016589832627855454450790922345010565e-17, /* twoPowerIndex2mi[194] */ 1.93673800521759096892309246646768463294752053454796e-33, /* twoPowerIndex2lo[194] */ } , { 1.69550936148933262259674847882706671953201293945312e+00, /* twoPowerIndex2hi[195] */ 7.23841687284516664081325689368355266258278971330115e-17, /* twoPowerIndex2mi[195] */ -4.72142878783650889336226782989306533177552216168780e-33, /* twoPowerIndex2lo[195] */ } , { 1.70010635371852347752508194389520213007926940917969e+00, /* twoPowerIndex2hi[196] */ -8.02371937039770024588528464451482959960563128920877e-18, /* twoPowerIndex2mi[196] */ 4.50894675051846528463958043437010583905518288996850e-34, /* twoPowerIndex2lo[196] */ } , { 1.70471580965805125096323990874225273728370666503906e+00, /* twoPowerIndex2hi[197] */ -2.72888328479728156256649817220242427763035044600143e-17, /* twoPowerIndex2mi[197] */ -4.78966969731514783785812327748180984426830295688131e-34, /* twoPowerIndex2lo[197] */ } , { 1.70933776310046292579158944135997444391250610351562e+00, /* twoPowerIndex2hi[198] */ -9.86877945663293107628372224517314496289872901148114e-17, /* twoPowerIndex2mi[198] */ -6.85025222060857007426626094774522285678578778256981e-34, /* twoPowerIndex2lo[198] */ } , { 1.71397224792992597386387387814465910196304321289062e+00, /* twoPowerIndex2hi[199] */ 6.47397510775336706412073988816560535911210776420163e-17, /* twoPowerIndex2mi[199] */ 2.27573149080872552498096897849055426251128097439426e-33, /* twoPowerIndex2lo[199] */ } , { 1.71861929812247793414314855908742174506187438964844e+00, /* twoPowerIndex2hi[200] */ -1.85138041826311098821086356969536380719870481925638e-17, /* twoPowerIndex2mi[200] */ 6.41562962530571009881963439719259893730039269925891e-34, /* twoPowerIndex2lo[200] */ } , { 1.72327894774627399243627223768271505832672119140625e+00, /* twoPowerIndex2hi[201] */ -9.52212380039379996274889157686297699809734122180713e-17, /* twoPowerIndex2mi[201] */ 2.02866645853394952359480765489840261160247275266736e-33, /* twoPowerIndex2lo[201] */ } , { 1.72795123096183766975286744127515703439712524414062e+00, /* twoPowerIndex2hi[202] */ -1.07509818612046424458879695751780763147087565420428e-16, /* twoPowerIndex2mi[202] */ -1.61412967076299755734407780884081362069739071884994e-34, /* twoPowerIndex2lo[202] */ } , { 1.73263618202231106657507098134374246001243591308594e+00, /* twoPowerIndex2hi[203] */ -1.69805107431541549406538664930124317335159068906677e-18, /* twoPowerIndex2mi[203] */ -2.66402312008479346328768862816128097997745127782773e-35, /* twoPowerIndex2lo[203] */ } , { 1.73733383527370621735030908894259482622146606445312e+00, /* twoPowerIndex2hi[204] */ 3.16438929929295694659064288262436215220581330791541e-17, /* twoPowerIndex2mi[204] */ 2.46812086524635182684409036079744664142196277491485e-33, /* twoPowerIndex2lo[204] */ } , { 1.74204422515515644498407255014171823859214782714844e+00, /* twoPowerIndex2hi[205] */ -1.52595911895078879235703824049564298322445354780003e-18, /* twoPowerIndex2mi[205] */ -8.17523608900014455382082672926541929180458870718501e-35, /* twoPowerIndex2lo[205] */ } , { 1.74676738619916904760032139165559783577919006347656e+00, /* twoPowerIndex2hi[206] */ -1.07522904835075145041783457030040618806351398410292e-16, /* twoPowerIndex2mi[206] */ 8.90461808811939147294432800114435837044658194814041e-34, /* twoPowerIndex2lo[206] */ } , { 1.75150335303187820734649449150310829281806945800781e+00, /* twoPowerIndex2hi[207] */ -5.12445042059672465938775283877530577740069995954300e-17, /* twoPowerIndex2mi[207] */ -1.10691385189430357525360305608492620313871007739409e-33, /* twoPowerIndex2lo[207] */ } , { 1.75625216037329945351075366488657891750335693359375e+00, /* twoPowerIndex2hi[208] */ 2.96014069544887330703087179323550026749650613893620e-17, /* twoPowerIndex2mi[208] */ 1.23348227448930022362949427574612725745479960698002e-33, /* twoPowerIndex2lo[208] */ } , { 1.76101384303758390359462282503955066204071044921875e+00, /* twoPowerIndex2hi[209] */ -7.94325312503922771056589226542000745919657831036441e-17, /* twoPowerIndex2mi[209] */ -1.04403750867744833163298565704167076212852668996068e-33, /* twoPowerIndex2lo[209] */ } , { 1.76578843593327272643023206910584121942520141601562e+00, /* twoPowerIndex2hi[210] */ 9.46131501808326786659595799515277320480429557947658e-17, /* twoPowerIndex2mi[210] */ 1.98867486219252293915985766016443087286320281152529e-33, /* twoPowerIndex2lo[210] */ } , { 1.77057597406355471392203071445692330598831176757812e+00, /* twoPowerIndex2hi[211] */ 5.96179451004055584766584184178983874814969039896383e-17, /* twoPowerIndex2mi[211] */ 2.25217410358405709867930003709735313542997798337535e-33, /* twoPowerIndex2lo[211] */ } , { 1.77537649252652118825324123463360592722892761230469e+00, /* twoPowerIndex2hi[212] */ 6.42973179655657203395602172161574258202382771355994e-17, /* twoPowerIndex2mi[212] */ -3.05903038196122316059732104267589318807211463677414e-33, /* twoPowerIndex2lo[212] */ } , { 1.78019002651542446180599199578864499926567077636719e+00, /* twoPowerIndex2hi[213] */ -5.28462728909161736516945207213792976192807478608583e-17, /* twoPowerIndex2mi[213] */ -8.77486215604854126189970187247268663448961942332927e-34, /* twoPowerIndex2lo[213] */ } , { 1.78501661131893496481382044294150546193122863769531e+00, /* twoPowerIndex2hi[214] */ 1.53304001210313138183913113480738748539708581780129e-17, /* twoPowerIndex2mi[214] */ 5.51980832680936081410203965527728574047454546736523e-34, /* twoPowerIndex2lo[214] */ } , { 1.78985628232140103754943538660882040858268737792969e+00, /* twoPowerIndex2hi[215] */ -4.15435466068335038727327499723453563952032099924980e-17, /* twoPowerIndex2mi[215] */ 6.11515946295708221189397364669019622476882042095523e-35, /* twoPowerIndex2lo[215] */ } , { 1.79470907500310716820024481421569362282752990722656e+00, /* twoPowerIndex2hi[216] */ 1.82274584279120867697625715862678123206602563412216e-17, /* twoPowerIndex2mi[216] */ 1.42176433874694971095041068746172287320972847635154e-33, /* twoPowerIndex2lo[216] */ } , { 1.79957502494053511732374772691400721669197082519531e+00, /* twoPowerIndex2hi[217] */ -2.52688923335889795224096886042608995683536858583738e-17, /* twoPowerIndex2mi[217] */ 1.44522688753239826542123866099361934109399231372306e-33, /* twoPowerIndex2lo[217] */ } , { 1.80445416780662393207990135124418884515762329101562e+00, /* twoPowerIndex2hi[218] */ -5.17722240879331788327618111907586559317876939907178e-17, /* twoPowerIndex2mi[218] */ -3.23967570721982535791533521021663088881060430531174e-34, /* twoPowerIndex2lo[218] */ } , { 1.80934653937103195886493267607875168323516845703125e+00, /* twoPowerIndex2hi[219] */ -9.03264140245002968190484653709605673138415565955571e-17, /* twoPowerIndex2mi[219] */ -1.12019787608951203920985462435640152244227583657230e-33, /* twoPowerIndex2lo[219] */ } , { 1.81425217550039885594514998956583440303802490234375e+00, /* twoPowerIndex2hi[220] */ -9.96953153892034881983229632097342495877571562964276e-17, /* twoPowerIndex2mi[220] */ -5.86224914377491774994695195482808191103744720514440e-33, /* twoPowerIndex2lo[220] */ } , { 1.81917111215860849426917411619797348976135253906250e+00, /* twoPowerIndex2hi[221] */ 7.40267690114583888997332201107850297829481646698022e-17, /* twoPowerIndex2mi[221] */ -4.89675321347547219472440109911293831971254102711009e-33, /* twoPowerIndex2lo[221] */ } , { 1.82410338540705341259240412910003215074539184570312e+00, /* twoPowerIndex2hi[222] */ -1.01596278622770830649733223898080028655802910502598e-16, /* twoPowerIndex2mi[222] */ 4.53871114850207724131140654395208935819981398894467e-34, /* twoPowerIndex2lo[222] */ } , { 1.82904903140489727420003873703535646200180053710938e+00, /* twoPowerIndex2hi[223] */ 6.88919290883569563696897029598215713285030905189271e-17, /* twoPowerIndex2mi[223] */ 3.87648962331697016857882013569485482520267614310710e-33, /* twoPowerIndex2lo[223] */ } , { 1.83400808640934243065601094713201746344566345214844e+00, /* twoPowerIndex2hi[224] */ 3.28310722424562720351405816760294702167288526703081e-17, /* twoPowerIndex2mi[224] */ -6.42508934795304248095271046696049734574532048424330e-34, /* twoPowerIndex2lo[224] */ } , { 1.83898058677589371079363900207681581377983093261719e+00, /* twoPowerIndex2hi[225] */ 6.91896974027251194233158929971981865763925505317250e-18, /* twoPowerIndex2mi[225] */ 8.15206232016177839312277544008762312093325605950960e-35, /* twoPowerIndex2lo[225] */ } , { 1.84396656895862598446456104284152388572692871093750e+00, /* twoPowerIndex2hi[226] */ -5.93974202694996455028254223192510163033537942157969e-17, /* twoPowerIndex2mi[226] */ -1.48362556800548453304632576499694052761575815131607e-33, /* twoPowerIndex2lo[226] */ } , { 1.84896606951045083810925007128389552235603332519531e+00, /* twoPowerIndex2hi[227] */ 9.02758044626108928815754968893534423196214872648843e-17, /* twoPowerIndex2mi[227] */ 3.66962637780002837100397510992219276952101768763175e-33, /* twoPowerIndex2lo[227] */ } , { 1.85397912508338547077357816306175664067268371582031e+00, /* twoPowerIndex2hi[228] */ 9.76188749072759353840331670682321086158335176176729e-17, /* twoPowerIndex2mi[228] */ 4.61481577205566482307976345637533484680898060020057e-33, /* twoPowerIndex2lo[228] */ } , { 1.85900577242882047990235605539055541157722473144531e+00, /* twoPowerIndex2hi[229] */ -9.52870546198994068663058182042478513584534522643660e-17, /* twoPowerIndex2mi[229] */ -3.18046180210394448463313927892837392059725438136108e-33, /* twoPowerIndex2lo[229] */ } , { 1.86404604839778897940050228498876094818115234375000e+00, /* twoPowerIndex2hi[230] */ 6.54091268062057171050111940599879934004515525942762e-17, /* twoPowerIndex2mi[230] */ -5.47450840369931668676283513826314309520282956450186e-33, /* twoPowerIndex2lo[230] */ } , { 1.86909998994123860427407635143026709556579589843750e+00, /* twoPowerIndex2hi[231] */ -9.93850521425506708290021081667794428086842804782007e-17, /* twoPowerIndex2mi[231] */ 2.01996583148501250135094900859003261161238917514540e-33, /* twoPowerIndex2lo[231] */ } , { 1.87416763411029996255763307999586686491966247558594e+00, /* twoPowerIndex2hi[232] */ -6.12276341300414256163658402373731493255704994623650e-17, /* twoPowerIndex2mi[232] */ 5.28588559402507397372575432425046614667899080733482e-33, /* twoPowerIndex2lo[232] */ } , { 1.87924901805656019426749026024481281638145446777344e+00, /* twoPowerIndex2hi[233] */ -1.62263155578358447798931987572415275848558528109557e-17, /* twoPowerIndex2mi[233] */ 9.40055036844163004544204966638003638688147648501487e-34, /* twoPowerIndex2lo[233] */ } , { 1.88434417903233453195355195930460467934608459472656e+00, /* twoPowerIndex2hi[234] */ -8.22659312553371090551493304223608514657111026374334e-17, /* twoPowerIndex2mi[234] */ -5.31443494561164967610191190946004049645366520601710e-33, /* twoPowerIndex2lo[234] */ } , { 1.88945315439093919351876138534862548112869262695312e+00, /* twoPowerIndex2hi[235] */ -9.00516828505912671790149612791654138076908000967551e-17, /* twoPowerIndex2mi[235] */ 4.76098007513107821420081485428133742005900358438723e-33, /* twoPowerIndex2lo[235] */ } , { 1.89457598158696560730618330126162618398666381835938e+00, /* twoPowerIndex2hi[236] */ 3.40340353521652967060147928999507962708632290832738e-17, /* twoPowerIndex2mi[236] */ 1.72475099549343225430579028439403217279441019556785e-33, /* twoPowerIndex2lo[236] */ } , { 1.89971269817655530331990121339913457632064819335938e+00, /* twoPowerIndex2hi[237] */ -3.85973976937851432307271295292856183526693379019865e-17, /* twoPowerIndex2mi[237] */ 8.54252722580247976290671190391307753063293836872304e-34, /* twoPowerIndex2lo[237] */ } , { 1.90486334181767413831209978525293990969657897949219e+00, /* twoPowerIndex2hi[238] */ 6.53385751471827862894642310249671518446001303214235e-17, /* twoPowerIndex2mi[238] */ -4.74812640133837504404873359767131188363298319607458e-33, /* twoPowerIndex2lo[238] */ } , { 1.91002795027038985153922112658619880676269531250000e+00, /* twoPowerIndex2hi[239] */ -5.90968800674406023685750489615373077589386094387626e-17, /* twoPowerIndex2mi[239] */ 1.83214657152134469549465915038517283323758050529819e-33, /* twoPowerIndex2lo[239] */ } , { 1.91520656139714740007207183225546032190322875976562e+00, /* twoPowerIndex2hi[240] */ -1.06199460561959626376283195555328606320260702029334e-16, /* twoPowerIndex2mi[240] */ -3.05776975679132548538006102719337626149343902119718e-33, /* twoPowerIndex2lo[240] */ } , { 1.92039921316304740273039897147100418806076049804688e+00, /* twoPowerIndex2hi[241] */ 7.11668154063031418621133275838618151517201202262489e-17, /* twoPowerIndex2mi[241] */ -4.82668562559464286199698217483008854466173164582353e-33, /* twoPowerIndex2lo[241] */ } , { 1.92560594363612502810667592711979523301124572753906e+00, /* twoPowerIndex2hi[242] */ -9.91496376969374092749319194821921356369769258703312e-17, /* twoPowerIndex2mi[242] */ -3.22132452692376239436249260443042416373307145576578e-33, /* twoPowerIndex2lo[242] */ } , { 1.93082679098762710623304883483797311782836914062500e+00, /* twoPowerIndex2hi[243] */ 6.16714970616910955283771024520843382562539181719792e-17, /* twoPowerIndex2mi[243] */ 9.20187048243808720717080369504670367609474211649437e-34, /* twoPowerIndex2lo[243] */ } , { 1.93606179349229434727419629780342802405357360839844e+00, /* twoPowerIndex2hi[244] */ 1.03323859606763257447769151803649788699571393339738e-16, /* twoPowerIndex2mi[244] */ 6.05301367682062275405664830597304146844867569493449e-33, /* twoPowerIndex2lo[244] */ } , { 1.94131098952864045159572015109006315469741821289062e+00, /* twoPowerIndex2hi[245] */ -6.63802989162148798984357531389107673024275126550005e-17, /* twoPowerIndex2mi[245] */ -3.84589208047361365184351178085214844173829595098042e-33, /* twoPowerIndex2lo[245] */ } , { 1.94657441757923321823398055130382999777793884277344e+00, /* twoPowerIndex2hi[246] */ 6.81102234953387718436390433460451017868586507937427e-17, /* twoPowerIndex2mi[246] */ 4.00132790381313470943337752360672827257448941559276e-33, /* twoPowerIndex2lo[246] */ } , { 1.95185211623097831790119016659446060657501220703125e+00, /* twoPowerIndex2hi[247] */ -2.19901696997935108602521778603883611528020250783493e-17, /* twoPowerIndex2mi[247] */ 2.41215894734058348862039105065931631090122373298988e-34, /* twoPowerIndex2lo[247] */ } , { 1.95714412417540017941064434126019477844238281250000e+00, /* twoPowerIndex2hi[248] */ 8.96076779103666776760155050762912042076490756639488e-17, /* twoPowerIndex2mi[248] */ -9.63267661361827588458686334472185443533033181828620e-34, /* twoPowerIndex2lo[248] */ } , { 1.96245048020892731699404976097866892814636230468750e+00, /* twoPowerIndex2hi[249] */ 1.09768440009135469492530703072443773737110713005320e-16, /* twoPowerIndex2mi[249] */ 2.22935494198572795986893315761753148481994138005007e-33, /* twoPowerIndex2lo[249] */ } , { 1.96777122323317588126201371778734028339385986328125e+00, /* twoPowerIndex2hi[250] */ -1.03149280115311315108805777837120874149571671620808e-16, /* twoPowerIndex2mi[250] */ 4.19326590499492480228618720550851028485481027931040e-33, /* twoPowerIndex2lo[250] */ } , { 1.97310639225523432038755800022045150399208068847656e+00, /* twoPowerIndex2hi[251] */ -7.45161786395603748608029025975637403620995816486529e-18, /* twoPowerIndex2mi[251] */ -5.91616296363099671353015573028401106053667494395426e-34, /* twoPowerIndex2lo[251] */ } , { 1.97845602638795092786949680885300040245056152343750e+00, /* twoPowerIndex2hi[252] */ 4.03887531092781665749784154795462589642365074083484e-17, /* twoPowerIndex2mi[252] */ 3.58120371667786223934924900740488031476290303118010e-34, /* twoPowerIndex2lo[252] */ } , { 1.98382016485021939189437034656293690204620361328125e+00, /* twoPowerIndex2hi[253] */ -2.20345441239106265715861919875136617618161805878720e-17, /* twoPowerIndex2mi[253] */ 1.30241601884067628906145032934477933888241617967293e-33, /* twoPowerIndex2lo[253] */ } , { 1.98919884696726634309982273407513275742530822753906e+00, /* twoPowerIndex2hi[254] */ 8.20513263836919941553211296435337826280802285479647e-18, /* twoPowerIndex2mi[254] */ 4.55959041696793749483275697431418566719882990414142e-34, /* twoPowerIndex2lo[254] */ } , { 1.99459211217094023460560947569319978356361389160156e+00, /* twoPowerIndex2hi[255] */ 1.79097103520026450854305804947681496082855314328245e-17, /* twoPowerIndex2mi[255] */ 3.33253733318286084576384624967661010994920841819939e-34, /* twoPowerIndex2lo[255] */ } }; interval-2.1.0/src/crlibm/prepare0000755000000000000000000000115213031036767015114 0ustar 00000000000000#!/bin/sh -- # This script is inspired by the prepare script distributed with with # mpfr, which is inspired by the prepare script distributed with Mutt. if aclocal && autoheader && autoconf&& automake --add-missing -c && autoconf && ./configure $@ then echo echo "The crlibm source code was successfully prepared." echo "Type 'make' to build crlibm." echo echo "Note: if you want to reconfigure crlibm, you can now use the 'configure'" echo "script directly; you do not need the 'prepare' script any longer." echo else echo echo "Some part of the preparation process failed." echo exit 1 fi interval-2.1.0/src/crlibm/rem_pio2_accurate.c0000644000000000000000000001515513031036767017267 0ustar 00000000000000/* * rem_pio2, used in correctly rounded trigonometric functions * * Author : Catherine Daramy, David Defour, Florent de Dinechin * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ /** * This file include functions to compute y=x-N*pi/2 and return the last two bits of N * in order to know which quadrant we are considering. * * We use an scs representation to compute it by Payne and Hanek methods. For more information * you can read K. C. Ng research report from Sun Microsystems: * "Argument reduction for huge argument: Good to the last bit" (July 13, 1992) * */ #include "rem_pio2_accurate.h" /** * Case X_IND = -1: * 0 * 2 ^ * X : <> |--| |--| |--| 0 0 0 0 0 * 2/Pi : <> |--| |--| |--| |--| ..... * * Case X_IND = 0: * 0 * 2 ^ * X : |--| <> |--| |--| 0 0 0 0 0 * 2/Pi : <> |--| |--| |--| |--| ..... * * Case X_IND = 1: * 0 * 2 ^ * X : |--| |--| <> |--| |--| 0 0 0 0 0 * 2/Pi : <> |--| |--| |--| |--| ..... * * Case ... * * Step 1: * * Compute r = X . 2/Pi where: * - r[0] hold the integer part. (if x>0 or the once complement integer part if x<0 ) * - r[1] to r[SCS_NB_WORDS+2] hold the reduced part * the 3 extra 30 bits are here to prevent possible * cancellation due to a number x too close to a * multiple of Pi/2. * * Step 2: * Compute result = (r[1] ... r[SCS_NB_WORDS]) . Pi/2. * * description of local variables : * - ind : where to start multiplying into 2opi table * */ /* TODO OPTIM better 64-bit multiplication, see in scs_mult */ int rem_pio2_scs(scs_ptr result, const scs_ptr x){ uint64_t r[SCS_NB_WORDS+3], tmp; unsigned int N; /* result r[0],...,r[10] could store till 300 bits of precision */ /* that is really enough for computing the reduced argument */ int sign, i, j, ind; int *two_over_pi_pt; if ((X_EXP != 1)||(X_IND < -1)){ scs_set(result, x); return 0; } /* Compute the product |x| * 2/Pi */ if ((X_IND == -1)){ /* In this case we consider number between ]-1,+1[ */ /* we may use simpler algorithm such as Cody And Waite */ r[0] = 0; r[1] = 0; r[2] = (uint64_t)(two_over_pi[0]) * X_HW[0]; r[3] = ((uint64_t)(two_over_pi[0]) * X_HW[1] +(uint64_t)(two_over_pi[1]) * X_HW[0]); if(X_HW[2] == 0){ for(i=4; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(two_over_pi[i-3]) * X_HW[1] +(uint64_t)(two_over_pi[i-2]) * X_HW[0]); }}else { for(i=4; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(two_over_pi[i-4]) * X_HW[2] +(uint64_t)(two_over_pi[i-3]) * X_HW[1] +(uint64_t)(two_over_pi[i-2]) * X_HW[0]); } } }else { if (X_IND == 0){ r[0] = 0; r[1] = (uint64_t)(two_over_pi[0]) * X_HW[0]; r[2] = ((uint64_t)(two_over_pi[0]) * X_HW[1] +(uint64_t)(two_over_pi[1]) * X_HW[0]); if(X_HW[2] == 0){ for(i=3; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(two_over_pi[i-2]) * X_HW[1] +(uint64_t)(two_over_pi[i-1]) * X_HW[0]); }}else { for(i=3; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(two_over_pi[i-3]) * X_HW[2] +(uint64_t)(two_over_pi[i-2]) * X_HW[1] +(uint64_t)(two_over_pi[i-1]) * X_HW[0]); }} }else { if (X_IND == 1){ r[0] = (uint64_t)(two_over_pi[0]) * X_HW[0]; r[1] = ((uint64_t)(two_over_pi[0]) * X_HW[1] +(uint64_t)(two_over_pi[1]) * X_HW[0]); if(X_HW[2] == 0){ for(i=2; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(two_over_pi[i-1]) * X_HW[1] +(uint64_t)(two_over_pi[ i ]) * X_HW[0]); }}else { for(i=2; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(two_over_pi[i-2]) * X_HW[2] +(uint64_t)(two_over_pi[i-1]) * X_HW[1] +(uint64_t)(two_over_pi[ i ]) * X_HW[0]); }} }else { if (X_IND == 2){ r[0] = ((uint64_t)(two_over_pi[0]) * X_HW[1] +(uint64_t)(two_over_pi[1]) * X_HW[0]); if(X_HW[2] == 0){ for(i=1; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(two_over_pi[ i ]) * X_HW[1] +(uint64_t)(two_over_pi[i+1]) * X_HW[0]); }}else { for(i=1; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(two_over_pi[i-1]) * X_HW[2] +(uint64_t)(two_over_pi[ i ]) * X_HW[1] +(uint64_t)(two_over_pi[i+1]) * X_HW[0]); }} }else { ind = (X_IND - 3); two_over_pi_pt = (int*)&(two_over_pi[ind]); if(X_HW[2] == 0){ for(i=0; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(two_over_pi_pt[i+1]) * X_HW[1] +(uint64_t)(two_over_pi_pt[i+2]) * X_HW[0]); }}else { for(i=0; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(two_over_pi_pt[ i ]) * X_HW[2] +(uint64_t)(two_over_pi_pt[i+1]) * X_HW[1] +(uint64_t)(two_over_pi_pt[i+2]) * X_HW[0]); } } } } } } /* Carry propagate */ r[SCS_NB_WORDS+1] += r[SCS_NB_WORDS+2]>>30; for(i=(SCS_NB_WORDS+1); i>0; i--) {tmp=r[i]>>30; r[i-1] += tmp; r[i] -= (tmp<<30);} /* The integer part is in r[0] */ N = (unsigned int)(r[0]); #if 0 printf("r[0] = %d\n", N); #endif /* test if the reduced part is bigger than Pi/4 */ if (r[1] > (uint64_t)(SCS_RADIX)/2){ N += 1; sign = -1; for(i=1; i<(SCS_NB_WORDS+3); i++) { r[i]=((~(unsigned int)(r[i])) & 0x3fffffff);} } else sign = 1; /* Now we get the reduce argument and check for possible * cancellation By Kahan algorithm we will have at most 2 digits * of cancellations r[1] and r[2] in the worst case. */ if (r[1] == 0) if (r[2] == 0) i = 3; else i = 2; else i = 1; for(j=0; j Copyright (C) This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! interval-2.1.0/src/crlibm/scs_lib/ChangeLog0000644000000000000000000000077313031036767016730 0ustar 000000000000002003-06-17 : Florent de Dinechin * Version 1.4.1 * Added round towards 0 in scs2double * Corrected buggy handling of exceptional cases in scs2double 2003-04-18 : Florent de Dinechin * Version 1.4.0 * Several bugs corrected in multiplication and scs_square * minor performance improvement in scs_square 2003-04-15 : Florent de Dinechin * Version 1.3.0 released * scslib is now a subdirectory of crlibm * Precision is now set cleanly from the configure script. * make install hopefully cleaner interval-2.1.0/src/crlibm/scs_lib/Doxyfile.dev0000644000000000000000000011064613031036767017442 0ustar 00000000000000# Doxyfile 1.2.15 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project # # All text after a hash (#) is considered a comment and will be ignored # The format is: # TAG = value [value, ...] # For lists items can also be appended using: # TAG += value [value, ...] # Values that contain spaces should be placed between quotes (" ") #--------------------------------------------------------------------------- # General configuration options #--------------------------------------------------------------------------- # The PROJECT_NAME tag is a single word (or a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = SCSLib # The PROJECT_NUMBER tag can be used to enter a project or revision number. # This could be handy for archiving the generated documentation or # if some version control system is used. PROJECT_NUMBER = 1.2.1 # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = DocsDev/ # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this # information to generate all constant output in the proper language. # The default language is English, other supported languages are: # Brazilian, Chinese, Croatian, Czech, Danish, Dutch, Finnish, French, # German, Greek, Hungarian, Italian, Japanese, Korean, Norwegian, Polish, # Portuguese, Romanian, Russian, Slovak, Slovene, Spanish and Swedish. OUTPUT_LANGUAGE = English # If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in # documentation are documented, even if no documentation was available. # Private class members and static file members will be hidden unless # the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES EXTRACT_ALL = NO # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. EXTRACT_PRIVATE = NO # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. EXTRACT_STATIC = NO # If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) # defined locally in source files will be included in the documentation. # If set to NO only classes defined in header files are included. EXTRACT_LOCAL_CLASSES = NO # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all # undocumented members of documented classes, files or namespaces. # If set to NO (the default) these members will be included in the # various overviews, but no documentation section is generated. # This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_MEMBERS = YES # If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all # undocumented classes that are normally visible in the class hierarchy. # If set to NO (the default) these class will be included in the various # overviews. This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_CLASSES = YES # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will # include brief member descriptions after the members that are listed in # the file and class documentation (similar to JavaDoc). # Set to NO to disable this. BRIEF_MEMBER_DESC = NO # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend # the brief description of a member or function before the detailed description. # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the # brief descriptions will be completely suppressed. REPEAT_BRIEF = YES # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then # Doxygen will generate a detailed section even if there is only a brief # description. ALWAYS_DETAILED_SEC = YES # If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all inherited # members of a class in the documentation of that class as if those members were # ordinary class members. Constructors, destructors and assignment operators of # the base classes will not be shown. INLINE_INHERITED_MEMB = NO # If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full # path before files name in the file list and in the header files. If set # to NO the shortest path that makes the file name unique will be used. FULL_PATH_NAMES = NO # If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag # can be used to strip a user defined part of the path. Stripping is # only done if one of the specified strings matches the left-hand part of # the path. It is allowed to use relative paths in the argument list. STRIP_FROM_PATH = # The INTERNAL_DOCS tag determines if documentation # that is typed after a \internal command is included. If the tag is set # to NO (the default) then the documentation will be excluded. # Set it to YES to include the internal documentation. INTERNAL_DOCS = NO # Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct # doxygen to hide any special comment blocks from generated source code # fragments. Normal C and C++ comments will always remain visible. STRIP_CODE_COMMENTS = NO # If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate # file names in lower case letters. If set to YES upper case letters are also # allowed. This is useful if you have classes or files whose names only differ # in case and if your file system supports case sensitive file names. Windows # users are adviced to set this option to NO. CASE_SENSE_NAMES = YES # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter # (but less readable) file names. This can be useful is your file systems # doesn't support long names like on DOS, Mac, or CD-ROM. SHORT_NAMES = NO # If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen # will show members with their full class and namespace scopes in the # documentation. If set to YES the scope will be hidden. HIDE_SCOPE_NAMES = NO # If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen # will generate a verbatim copy of the header file for each class for # which an include is specified. Set to NO to disable this. VERBATIM_HEADERS = NO # If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen # will put list of the files that are included by a file in the documentation # of that file. SHOW_INCLUDE_FILES = NO # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen # will interpret the first line (until the first dot) of a JavaDoc-style # comment as the brief description. If set to NO, the JavaDoc # comments will behave just like the Qt-style comments (thus requiring an # explict @brief command for a brief description. JAVADOC_AUTOBRIEF = YES # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented # member inherits the documentation from any documented member that it # reimplements. INHERIT_DOCS = YES # If the INLINE_INFO tag is set to YES (the default) then a tag [inline] # is inserted in the documentation for inline members. INLINE_INFO = YES # If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen # will sort the (detailed) documentation of file and class members # alphabetically by member name. If set to NO the members will appear in # declaration order. SORT_MEMBER_DOCS = NO # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC # tag is set to YES, then doxygen will reuse the documentation of the first # member in the group (if any) for the other members of the group. By default # all members of a group must be documented explicitly. DISTRIBUTE_GROUP_DOC = NO # The TAB_SIZE tag can be used to set the number of spaces in a tab. # Doxygen uses this value to replace tabs by spaces in code fragments. TAB_SIZE = 8 # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = YES # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = YES # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = YES # This tag can be used to specify a number of aliases that acts # as commands in the documentation. An alias has the form "name=value". # For example adding "sideeffect=\par Side Effects:\n" will allow you to # put the command \sideeffect (or @sideeffect) in the documentation, which # will result in a user defined paragraph with heading "Side Effects:". # You can put \n's in the value part of an alias to insert newlines. ALIASES = # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or define consist of for it to appear in # the documentation. If the initializer consists of more lines than specified # here it will be hidden. Use a value of 0 to hide initializers completely. # The appearance of the initializer of individual variables and defines in the # documentation can be controlled using \showinitializer or \hideinitializer # command in the documentation regardless of this setting. MAX_INITIALIZER_LINES = 30 # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources # only. Doxygen will then generate output that is more tailored for C. # For instance some of the names that are used will be different. The list # of all members will be omitted, etc. OPTIMIZE_OUTPUT_FOR_C = YES # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java sources # only. Doxygen will then generate output that is more tailored for Java. # For instance namespaces will be presented as packages, qualified scopes # will look different, etc. OPTIMIZE_OUTPUT_JAVA = NO # Set the SHOW_USED_FILES tag to NO to disable the list of files generated # at the bottom of the documentation of classes and structs. If set to YES the # list will mention the files that were used to generate the documentation. SHOW_USED_FILES = NO #--------------------------------------------------------------------------- # configuration options related to warning and progress messages #--------------------------------------------------------------------------- # The QUIET tag can be used to turn on/off the messages that are generated # by doxygen. Possible values are YES and NO. If left blank NO is used. QUIET = NO # The WARNINGS tag can be used to turn on/off the warning messages that are # generated by doxygen. Possible values are YES and NO. If left blank # NO is used. WARNINGS = YES # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings # for undocumented members. If EXTRACT_ALL is set to YES then this flag will # automatically be disabled. WARN_IF_UNDOCUMENTED = YES # The WARN_FORMAT tag determines the format of the warning messages that # doxygen can produce. The string should contain the $file, $line, and $text # tags, which will be replaced by the file and line number from which the # warning originated and the warning text. WARN_FORMAT = "$file:$line: $text" # The WARN_LOGFILE tag can be used to specify a file to which warning # and error messages should be written. If left blank the output is written # to stderr. WARN_LOGFILE = #--------------------------------------------------------------------------- # configuration options related to the input files #--------------------------------------------------------------------------- # The INPUT tag can be used to specify the files and/or directories that contain # documented source files. You may enter file names like "myfile.cpp" or # directories like "/usr/src/myproject". Separate the files or directories # with spaces. INPUT = . # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank the following patterns are tested: # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx *.hpp # *.h++ *.idl *.odl FILE_PATTERNS = *.c *.h main.dox # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = YES # The EXCLUDE tag can be used to specify files and/or directories that should # excluded from the INPUT source files. This way you can easily exclude a # subdirectory from a directory tree whose root is specified with the INPUT tag. EXCLUDE = # The EXCLUDE_SYMLINKS tag can be used select whether or not files or directories # that are symbolic links (a Unix filesystem feature) are excluded from the input. EXCLUDE_SYMLINKS = NO # If the value of the INPUT tag contains directories, you can use the # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude # certain files from those directories. EXCLUDE_PATTERNS = # The EXAMPLE_PATH tag can be used to specify one or more files or # directories that contain example code fragments that are included (see # the \include command). EXAMPLE_PATH = # If the value of the EXAMPLE_PATH tag contains directories, you can use the # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank all files are included. EXAMPLE_PATTERNS = # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be # searched for input files to be used with the \include or \dontinclude # commands irrespective of the value of the RECURSIVE tag. # Possible values are YES and NO. If left blank NO is used. EXAMPLE_RECURSIVE = NO # The IMAGE_PATH tag can be used to specify one or more files or # directories that contain image that are included in the documentation (see # the \image command). IMAGE_PATH = # The INPUT_FILTER tag can be used to specify a program that doxygen should # invoke to filter for each input file. Doxygen will invoke the filter program # by executing (via popen()) the command , where # is the value of the INPUT_FILTER tag, and is the name of an # input file. Doxygen will then use the output that the filter program writes # to standard output. INPUT_FILTER = # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using # INPUT_FILTER) will be used to filter the input files when producing source # files to browse. FILTER_SOURCE_FILES = NO #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. SOURCE_BROWSER = YES # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # If the REFERENCED_BY_RELATION tag is set to YES (the default) # then for each documented function all documented # functions referencing it will be listed. REFERENCED_BY_RELATION = YES # If the REFERENCES_RELATION tag is set to YES (the default) # then for each documented function all documented entities # called/used by that function will be listed. REFERENCES_RELATION = YES #--------------------------------------------------------------------------- # configuration options related to the alphabetical class index #--------------------------------------------------------------------------- # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index # of all compounds will be generated. Enable this if the project # contains a lot of classes, structs, unions or interfaces. ALPHABETICAL_INDEX = NO # If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns # in which this list will be split (can be a number in the range [1..20]) COLS_IN_ALPHA_INDEX = 5 # In case all classes in a project start with a common prefix, all # classes will be put under the same header in the alphabetical index. # The IGNORE_PREFIX tag can be used to specify one or more prefixes that # should be ignored while generating the index headers. IGNORE_PREFIX = #--------------------------------------------------------------------------- # configuration options related to the HTML output #--------------------------------------------------------------------------- # If the GENERATE_HTML tag is set to YES (the default) Doxygen will # generate HTML output. GENERATE_HTML = YES # The HTML_OUTPUT tag is used to specify where the HTML docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `html' will be used as the default path. HTML_OUTPUT = html # The HTML_FILE_EXTENSION tag can be used to specify the file extension for # each generated HTML page (for example: .htm,.php,.asp). If it is left blank # doxygen will generate files with .html extension. HTML_FILE_EXTENSION = .html # The HTML_HEADER tag can be used to specify a personal HTML header for # each generated HTML page. If it is left blank doxygen will generate a # standard header. HTML_HEADER = # The HTML_FOOTER tag can be used to specify a personal HTML footer for # each generated HTML page. If it is left blank doxygen will generate a # standard footer. HTML_FOOTER = # The HTML_STYLESHEET tag can be used to specify a user defined cascading # style sheet that is used by each HTML page. It can be used to # fine-tune the look of the HTML output. If the tag is left blank doxygen # will generate a default style sheet HTML_STYLESHEET = # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, # files or namespaces will be aligned in HTML using tables. If set to # NO a bullet list will be used. HTML_ALIGN_MEMBERS = YES # If the GENERATE_HTMLHELP tag is set to YES, additional index files # will be generated that can be used as input for tools like the # Microsoft HTML help workshop to generate a compressed HTML help file (.chm) # of the generated HTML documentation. GENERATE_HTMLHELP = NO # If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag # controls if a separate .chi index file is generated (YES) or that # it should be included in the master .chm file (NO). GENERATE_CHI = NO # If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag # controls whether a binary table of contents is generated (YES) or a # normal table of contents (NO) in the .chm file. BINARY_TOC = NO # The TOC_EXPAND flag can be set to YES to add extra items for group members # to the contents of the Html help documentation and to the tree view. TOC_EXPAND = NO # The DISABLE_INDEX tag can be used to turn on/off the condensed index at # top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. DISABLE_INDEX = NO # This tag can be used to set the number of enum values (range [1..20]) # that doxygen will group on one line in the generated HTML documentation. ENUM_VALUES_PER_LINE = 4 # If the GENERATE_TREEVIEW tag is set to YES, a side panel will be # generated containing a tree-like index structure (just like the one that # is generated for HTML Help). For this to work a browser that supports # JavaScript and frames is required (for instance Mozilla, Netscape 4.0+, # or Internet explorer 4.0+). Note that for large projects the tree generation # can take a very long time. In such cases it is better to disable this feature. # Windows users are probably better off using the HTML help feature. GENERATE_TREEVIEW = NO # If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be # used to set the initial width (in pixels) of the frame in which the tree # is shown. TREEVIEW_WIDTH = 250 #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = NO # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = latex # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be invoked. If left blank `latex' will be used as the default command name. LATEX_CMD_NAME = latex # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to # generate index for LaTeX. If left blank `makeindex' will be used as the # default command name. MAKEINDEX_CMD_NAME = makeindex # If the COMPACT_LATEX tag is set to YES Doxygen generates more compact # LaTeX documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_LATEX = YES # The PAPER_TYPE tag can be used to set the paper type that is used # by the printer. Possible values are: a4, a4wide, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4wide # The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX # packages that should be included in the LaTeX output. EXTRA_PACKAGES = # The LATEX_HEADER tag can be used to specify a personal LaTeX header for # the generated latex document. The header should contain everything until # the first chapter. If it is left blank doxygen will generate a # standard header. Notice: only use this tag if you know what you are doing! LATEX_HEADER = # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated # is prepared for conversion to pdf (using ps2pdf). The pdf file will # contain links (just like the HTML output) instead of page references # This makes the output suitable for online browsing using a pdf viewer. PDF_HYPERLINKS = YES # If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of # plain latex in the generated Makefile. Set this option to YES to get a # higher quality PDF documentation. USE_PDFLATEX = YES # If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. # command to the generated LaTeX files. This will instruct LaTeX to keep # running if errors occur, instead of asking the user for help. # This option is also used when generating formulas in HTML. LATEX_BATCHMODE = NO #--------------------------------------------------------------------------- # configuration options related to the RTF output #--------------------------------------------------------------------------- # If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output # The RTF output is optimised for Word 97 and may not look very pretty with # other RTF readers or editors. GENERATE_RTF = NO # The RTF_OUTPUT tag is used to specify where the RTF docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `rtf' will be used as the default path. RTF_OUTPUT = rtf # If the COMPACT_RTF tag is set to YES Doxygen generates more compact # RTF documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_RTF = NO # If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated # will contain hyperlink fields. The RTF file will # contain links (just like the HTML output) instead of page references. # This makes the output suitable for online browsing using WORD or other # programs which support those fields. # Note: wordpad (write) and others do not support links. RTF_HYPERLINKS = NO # Load stylesheet definitions from file. Syntax is similar to doxygen's # config file, i.e. a series of assigments. You only have to provide # replacements, missing definitions are set to their default value. RTF_STYLESHEET_FILE = # Set optional variables used in the generation of an rtf document. # Syntax is similar to doxygen's config file. RTF_EXTENSIONS_FILE = #--------------------------------------------------------------------------- # configuration options related to the man page output #--------------------------------------------------------------------------- # If the GENERATE_MAN tag is set to YES (the default) Doxygen will # generate man pages GENERATE_MAN = NO # The MAN_OUTPUT tag is used to specify where the man pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `man' will be used as the default path. MAN_OUTPUT = man # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = .3 # If the MAN_LINKS tag is set to YES and Doxygen generates man output, # then it will generate one additional man file for each entity # documented in the real man page(s). These additional files # only source the real man page, but without them the man command # would be unable to find the correct page. The default is NO. MAN_LINKS = NO #--------------------------------------------------------------------------- # configuration options related to the XML output #--------------------------------------------------------------------------- # If the GENERATE_XML tag is set to YES Doxygen will # generate an XML file that captures the structure of # the code including all documentation. Note that this # feature is still experimental and incomplete at the # moment. GENERATE_XML = NO #--------------------------------------------------------------------------- # configuration options for the AutoGen Definitions output #--------------------------------------------------------------------------- # If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will # generate an AutoGen Definitions (see autogen.sf.net) file # that captures the structure of the code including all # documentation. Note that this feature is still experimental # and incomplete at the moment. GENERATE_AUTOGEN_DEF = NO #--------------------------------------------------------------------------- # Configuration options related to the preprocessor #--------------------------------------------------------------------------- # If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will # evaluate all C-preprocessor directives found in the sources and include # files. ENABLE_PREPROCESSING = YES # If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro # names in the source code. If set to NO (the default) only conditional # compilation will be performed. Macro expansion can be done in a controlled # way by setting EXPAND_ONLY_PREDEF to YES. MACRO_EXPANSION = NO # If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES # then the macro expansion is limited to the macros specified with the # PREDEFINED and EXPAND_AS_PREDEFINED tags. EXPAND_ONLY_PREDEF = NO # If the SEARCH_INCLUDES tag is set to YES (the default) the includes files # in the INCLUDE_PATH (see below) will be search if a #include is found. SEARCH_INCLUDES = YES # The INCLUDE_PATH tag can be used to specify one or more directories that # contain include files that are not input files but should be processed by # the preprocessor. INCLUDE_PATH = # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard # patterns (like *.h and *.hpp) to filter out the header-files in the # directories. If left blank, the patterns specified with FILE_PATTERNS will # be used. INCLUDE_FILE_PATTERNS = # The PREDEFINED tag can be used to specify one or more macro names that # are defined before the preprocessor is started (similar to the -D option of # gcc). The argument of the tag is a list of macros of the form: name # or name=definition (no spaces). If the definition and the = are # omitted =1 is assumed. PREDEFINED = DOXYGEN_SHOULD_SKIP_THIS # If the MACRO_EXPANSION and EXPAND_PREDEF_ONLY tags are set to YES then # this tag can be used to specify a list of macro names that should be expanded. # The macro definition that is found in the sources will be used. # Use the PREDEFINED tag if you want to use a different macro definition. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all function-like macros that are alone # on a line and do not end with a semicolon. Such function macros are typically # used for boiler-plate code, and will confuse the parser if not removed. SKIP_FUNCTION_MACROS = YES #--------------------------------------------------------------------------- # Configuration::addtions related to external references #--------------------------------------------------------------------------- # The TAGFILES tag can be used to specify one or more tagfiles. TAGFILES = # When a file name is specified after GENERATE_TAGFILE, doxygen will create # a tag file that is based on the input files it reads. GENERATE_TAGFILE = # If the ALLEXTERNALS tag is set to YES all external classes will be listed # in the class index. If set to NO only the inherited external classes # will be listed. ALLEXTERNALS = NO # If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed # in the modules index. If set to NO, only the current project's groups will # be listed. EXTERNAL_GROUPS = YES # The PERL_PATH should be the absolute path and name of the perl script # interpreter (i.e. the result of `which perl'). PERL_PATH = /usr/bin/perl #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- # If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will # generate a inheritance diagram (in Html, RTF and LaTeX) for classes with base or # super classes. Setting the tag to NO turns the diagrams off. Note that this # option is superceded by the HAVE_DOT option below. This is only a fallback. It is # recommended to install and use dot, since it yield more powerful graphs. CLASS_DIAGRAMS = YES # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is # available from the path. This tool is part of Graphviz, a graph visualization # toolkit from AT&T and Lucent Bell Labs. The other options in this section # have no effect if this option is set to NO (the default) HAVE_DOT = NO # If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect inheritance relations. Setting this tag to YES will force the # the CLASS_DIAGRAMS tag to NO. CLASS_GRAPH = YES # If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect implementation dependencies (inheritance, containment, and # class references variables) of the class with other documented classes. COLLABORATION_GRAPH = YES # If set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = YES # If set to YES, the inheritance and collaboration graphs will hide # inheritance and usage relations if the target is undocumented # or is not a class. HIDE_UNDOC_RELATIONS = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT # tags are set to YES then doxygen will generate a graph for each documented # file showing the direct and indirect include dependencies of the file with # other documented files. INCLUDE_GRAPH = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and # HAVE_DOT tags are set to YES then doxygen will generate a graph for each # documented header file showing the documented files that directly or # indirectly include this file. INCLUDED_BY_GRAPH = YES # If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen # will graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images # generated by dot. Possible values are png, jpg, or gif # If left blank png will be used. DOT_IMAGE_FORMAT = png # The tag DOT_PATH can be used to specify the path where the dot tool can be # found. If left blank, it is assumed the dot tool can be found on the path. DOT_PATH = # The DOTFILE_DIRS tag can be used to specify one or more directories that # contain dot files that are included in the documentation (see the # \dotfile command). DOTFILE_DIRS = # The MAX_DOT_GRAPH_WIDTH tag can be used to set the maximum allowed width # (in pixels) of the graphs generated by dot. If a graph becomes larger than # this value, doxygen will try to truncate the graph, so that it fits within # the specified constraint. Beware that most browsers cannot cope with very # large images. MAX_DOT_GRAPH_WIDTH = 1024 # The MAX_DOT_GRAPH_HEIGHT tag can be used to set the maximum allows height # (in pixels) of the graphs generated by dot. If a graph becomes larger than # this value, doxygen will try to truncate the graph, so that it fits within # the specified constraint. Beware that most browsers cannot cope with very # large images. MAX_DOT_GRAPH_HEIGHT = 1024 # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermedate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES #--------------------------------------------------------------------------- # Configuration::addtions related to the search engine #--------------------------------------------------------------------------- # The SEARCHENGINE tag specifies whether or not a search engine should be # used. If set to NO the values of all tags below this one will be ignored. SEARCHENGINE = NO # The CGI_NAME tag should be the name of the CGI script that # starts the search engine (doxysearch) with the correct parameters. # A script with this name will be generated by doxygen. CGI_NAME = search.cgi # The CGI_URL tag should be the absolute URL to the directory where the # cgi binaries are located. See the documentation of your http daemon for # details. CGI_URL = # The DOC_URL tag should be the absolute URL to the directory where the # documentation is located. If left blank the absolute path to the # documentation, with file:// prepended to it, will be used. DOC_URL = # The DOC_ABSPATH tag should be the absolute path to the directory where the # documentation is located. If left blank the directory on the local machine # will be used. DOC_ABSPATH = # The BIN_ABSPATH tag must point to the directory where the doxysearch binary # is installed. BIN_ABSPATH = /usr/local/bin/ # The EXT_DOC_PATHS tag can be used to specify one or more paths to # documentation generated for other projects. This allows doxysearch to search # the documentation for these projects as well. EXT_DOC_PATHS = interval-2.1.0/src/crlibm/scs_lib/Doxyfile.user0000644000000000000000000011063713031036767017642 0ustar 00000000000000# Doxyfile 1.2.15 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project # # All text after a hash (#) is considered a comment and will be ignored # The format is: # TAG = value [value, ...] # For lists items can also be appended using: # TAG += value [value, ...] # Values that contain spaces should be placed between quotes (" ") #--------------------------------------------------------------------------- # General configuration options #--------------------------------------------------------------------------- # The PROJECT_NAME tag is a single word (or a sequence of words surrounded # by quotes) that should identify the project. PROJECT_NAME = SCSLib # The PROJECT_NUMBER tag can be used to enter a project or revision number. # This could be handy for archiving the generated documentation or # if some version control system is used. PROJECT_NUMBER = 1.2.1 # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = Docs/ # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this # information to generate all constant output in the proper language. # The default language is English, other supported languages are: # Brazilian, Chinese, Croatian, Czech, Danish, Dutch, Finnish, French, # German, Greek, Hungarian, Italian, Japanese, Korean, Norwegian, Polish, # Portuguese, Romanian, Russian, Slovak, Slovene, Spanish and Swedish. OUTPUT_LANGUAGE = English # If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in # documentation are documented, even if no documentation was available. # Private class members and static file members will be hidden unless # the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES EXTRACT_ALL = NO # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. EXTRACT_PRIVATE = NO # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. EXTRACT_STATIC = NO # If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) # defined locally in source files will be included in the documentation. # If set to NO only classes defined in header files are included. EXTRACT_LOCAL_CLASSES = NO # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all # undocumented members of documented classes, files or namespaces. # If set to NO (the default) these members will be included in the # various overviews, but no documentation section is generated. # This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_MEMBERS = YES # If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all # undocumented classes that are normally visible in the class hierarchy. # If set to NO (the default) these class will be included in the various # overviews. This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_CLASSES = YES # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will # include brief member descriptions after the members that are listed in # the file and class documentation (similar to JavaDoc). # Set to NO to disable this. BRIEF_MEMBER_DESC = NO # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend # the brief description of a member or function before the detailed description. # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the # brief descriptions will be completely suppressed. REPEAT_BRIEF = YES # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then # Doxygen will generate a detailed section even if there is only a brief # description. ALWAYS_DETAILED_SEC = YES # If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all inherited # members of a class in the documentation of that class as if those members were # ordinary class members. Constructors, destructors and assignment operators of # the base classes will not be shown. INLINE_INHERITED_MEMB = NO # If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full # path before files name in the file list and in the header files. If set # to NO the shortest path that makes the file name unique will be used. FULL_PATH_NAMES = NO # If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag # can be used to strip a user defined part of the path. Stripping is # only done if one of the specified strings matches the left-hand part of # the path. It is allowed to use relative paths in the argument list. STRIP_FROM_PATH = # The INTERNAL_DOCS tag determines if documentation # that is typed after a \internal command is included. If the tag is set # to NO (the default) then the documentation will be excluded. # Set it to YES to include the internal documentation. INTERNAL_DOCS = NO # Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct # doxygen to hide any special comment blocks from generated source code # fragments. Normal C and C++ comments will always remain visible. STRIP_CODE_COMMENTS = NO # If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate # file names in lower case letters. If set to YES upper case letters are also # allowed. This is useful if you have classes or files whose names only differ # in case and if your file system supports case sensitive file names. Windows # users are adviced to set this option to NO. CASE_SENSE_NAMES = YES # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter # (but less readable) file names. This can be useful is your file systems # doesn't support long names like on DOS, Mac, or CD-ROM. SHORT_NAMES = NO # If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen # will show members with their full class and namespace scopes in the # documentation. If set to YES the scope will be hidden. HIDE_SCOPE_NAMES = NO # If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen # will generate a verbatim copy of the header file for each class for # which an include is specified. Set to NO to disable this. VERBATIM_HEADERS = NO # If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen # will put list of the files that are included by a file in the documentation # of that file. SHOW_INCLUDE_FILES = NO # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen # will interpret the first line (until the first dot) of a JavaDoc-style # comment as the brief description. If set to NO, the JavaDoc # comments will behave just like the Qt-style comments (thus requiring an # explict @brief command for a brief description. JAVADOC_AUTOBRIEF = YES # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented # member inherits the documentation from any documented member that it # reimplements. INHERIT_DOCS = NO # If the INLINE_INFO tag is set to YES (the default) then a tag [inline] # is inserted in the documentation for inline members. INLINE_INFO = YES # If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen # will sort the (detailed) documentation of file and class members # alphabetically by member name. If set to NO the members will appear in # declaration order. SORT_MEMBER_DOCS = NO # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC # tag is set to YES, then doxygen will reuse the documentation of the first # member in the group (if any) for the other members of the group. By default # all members of a group must be documented explicitly. DISTRIBUTE_GROUP_DOC = NO # The TAB_SIZE tag can be used to set the number of spaces in a tab. # Doxygen uses this value to replace tabs by spaces in code fragments. TAB_SIZE = 8 # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = YES # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = YES # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = YES # This tag can be used to specify a number of aliases that acts # as commands in the documentation. An alias has the form "name=value". # For example adding "sideeffect=\par Side Effects:\n" will allow you to # put the command \sideeffect (or @sideeffect) in the documentation, which # will result in a user defined paragraph with heading "Side Effects:". # You can put \n's in the value part of an alias to insert newlines. ALIASES = # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or define consist of for it to appear in # the documentation. If the initializer consists of more lines than specified # here it will be hidden. Use a value of 0 to hide initializers completely. # The appearance of the initializer of individual variables and defines in the # documentation can be controlled using \showinitializer or \hideinitializer # command in the documentation regardless of this setting. MAX_INITIALIZER_LINES = 30 # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources # only. Doxygen will then generate output that is more tailored for C. # For instance some of the names that are used will be different. The list # of all members will be omitted, etc. OPTIMIZE_OUTPUT_FOR_C = YES # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java sources # only. Doxygen will then generate output that is more tailored for Java. # For instance namespaces will be presented as packages, qualified scopes # will look different, etc. OPTIMIZE_OUTPUT_JAVA = NO # Set the SHOW_USED_FILES tag to NO to disable the list of files generated # at the bottom of the documentation of classes and structs. If set to YES the # list will mention the files that were used to generate the documentation. SHOW_USED_FILES = NO #--------------------------------------------------------------------------- # configuration options related to warning and progress messages #--------------------------------------------------------------------------- # The QUIET tag can be used to turn on/off the messages that are generated # by doxygen. Possible values are YES and NO. If left blank NO is used. QUIET = NO # The WARNINGS tag can be used to turn on/off the warning messages that are # generated by doxygen. Possible values are YES and NO. If left blank # NO is used. WARNINGS = YES # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings # for undocumented members. If EXTRACT_ALL is set to YES then this flag will # automatically be disabled. WARN_IF_UNDOCUMENTED = YES # The WARN_FORMAT tag determines the format of the warning messages that # doxygen can produce. The string should contain the $file, $line, and $text # tags, which will be replaced by the file and line number from which the # warning originated and the warning text. WARN_FORMAT = "$file:$line: $text" # The WARN_LOGFILE tag can be used to specify a file to which warning # and error messages should be written. If left blank the output is written # to stderr. WARN_LOGFILE = #--------------------------------------------------------------------------- # configuration options related to the input files #--------------------------------------------------------------------------- # The INPUT tag can be used to specify the files and/or directories that contain # documented source files. You may enter file names like "myfile.cpp" or # directories like "/usr/src/myproject". Separate the files or directories # with spaces. INPUT = . # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank the following patterns are tested: # *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx *.hpp # *.h++ *.idl *.odl FILE_PATTERNS = scs.h main.dox # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = YES # The EXCLUDE tag can be used to specify files and/or directories that should # excluded from the INPUT source files. This way you can easily exclude a # subdirectory from a directory tree whose root is specified with the INPUT tag. EXCLUDE = # The EXCLUDE_SYMLINKS tag can be used select whether or not files or directories # that are symbolic links (a Unix filesystem feature) are excluded from the input. EXCLUDE_SYMLINKS = NO # If the value of the INPUT tag contains directories, you can use the # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude # certain files from those directories. EXCLUDE_PATTERNS = # The EXAMPLE_PATH tag can be used to specify one or more files or # directories that contain example code fragments that are included (see # the \include command). EXAMPLE_PATH = # If the value of the EXAMPLE_PATH tag contains directories, you can use the # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank all files are included. EXAMPLE_PATTERNS = # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be # searched for input files to be used with the \include or \dontinclude # commands irrespective of the value of the RECURSIVE tag. # Possible values are YES and NO. If left blank NO is used. EXAMPLE_RECURSIVE = NO # The IMAGE_PATH tag can be used to specify one or more files or # directories that contain image that are included in the documentation (see # the \image command). IMAGE_PATH = # The INPUT_FILTER tag can be used to specify a program that doxygen should # invoke to filter for each input file. Doxygen will invoke the filter program # by executing (via popen()) the command , where # is the value of the INPUT_FILTER tag, and is the name of an # input file. Doxygen will then use the output that the filter program writes # to standard output. INPUT_FILTER = # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using # INPUT_FILTER) will be used to filter the input files when producing source # files to browse. FILTER_SOURCE_FILES = NO #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. SOURCE_BROWSER = NO # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # If the REFERENCED_BY_RELATION tag is set to YES (the default) # then for each documented function all documented # functions referencing it will be listed. REFERENCED_BY_RELATION = NO # If the REFERENCES_RELATION tag is set to YES (the default) # then for each documented function all documented entities # called/used by that function will be listed. REFERENCES_RELATION = NO #--------------------------------------------------------------------------- # configuration options related to the alphabetical class index #--------------------------------------------------------------------------- # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index # of all compounds will be generated. Enable this if the project # contains a lot of classes, structs, unions or interfaces. ALPHABETICAL_INDEX = NO # If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns # in which this list will be split (can be a number in the range [1..20]) COLS_IN_ALPHA_INDEX = 5 # In case all classes in a project start with a common prefix, all # classes will be put under the same header in the alphabetical index. # The IGNORE_PREFIX tag can be used to specify one or more prefixes that # should be ignored while generating the index headers. IGNORE_PREFIX = #--------------------------------------------------------------------------- # configuration options related to the HTML output #--------------------------------------------------------------------------- # If the GENERATE_HTML tag is set to YES (the default) Doxygen will # generate HTML output. GENERATE_HTML = YES # The HTML_OUTPUT tag is used to specify where the HTML docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `html' will be used as the default path. HTML_OUTPUT = html # The HTML_FILE_EXTENSION tag can be used to specify the file extension for # each generated HTML page (for example: .htm,.php,.asp). If it is left blank # doxygen will generate files with .html extension. HTML_FILE_EXTENSION = .html # The HTML_HEADER tag can be used to specify a personal HTML header for # each generated HTML page. If it is left blank doxygen will generate a # standard header. HTML_HEADER = # The HTML_FOOTER tag can be used to specify a personal HTML footer for # each generated HTML page. If it is left blank doxygen will generate a # standard footer. HTML_FOOTER = # The HTML_STYLESHEET tag can be used to specify a user defined cascading # style sheet that is used by each HTML page. It can be used to # fine-tune the look of the HTML output. If the tag is left blank doxygen # will generate a default style sheet HTML_STYLESHEET = # If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, # files or namespaces will be aligned in HTML using tables. If set to # NO a bullet list will be used. HTML_ALIGN_MEMBERS = YES # If the GENERATE_HTMLHELP tag is set to YES, additional index files # will be generated that can be used as input for tools like the # Microsoft HTML help workshop to generate a compressed HTML help file (.chm) # of the generated HTML documentation. GENERATE_HTMLHELP = NO # If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag # controls if a separate .chi index file is generated (YES) or that # it should be included in the master .chm file (NO). GENERATE_CHI = NO # If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag # controls whether a binary table of contents is generated (YES) or a # normal table of contents (NO) in the .chm file. BINARY_TOC = NO # The TOC_EXPAND flag can be set to YES to add extra items for group members # to the contents of the Html help documentation and to the tree view. TOC_EXPAND = NO # The DISABLE_INDEX tag can be used to turn on/off the condensed index at # top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. DISABLE_INDEX = YES # This tag can be used to set the number of enum values (range [1..20]) # that doxygen will group on one line in the generated HTML documentation. ENUM_VALUES_PER_LINE = 4 # If the GENERATE_TREEVIEW tag is set to YES, a side panel will be # generated containing a tree-like index structure (just like the one that # is generated for HTML Help). For this to work a browser that supports # JavaScript and frames is required (for instance Mozilla, Netscape 4.0+, # or Internet explorer 4.0+). Note that for large projects the tree generation # can take a very long time. In such cases it is better to disable this feature. # Windows users are probably better off using the HTML help feature. GENERATE_TREEVIEW = NO # If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be # used to set the initial width (in pixels) of the frame in which the tree # is shown. TREEVIEW_WIDTH = 250 #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = YES # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = latex # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be invoked. If left blank `latex' will be used as the default command name. LATEX_CMD_NAME = latex # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to # generate index for LaTeX. If left blank `makeindex' will be used as the # default command name. MAKEINDEX_CMD_NAME = makeindex # If the COMPACT_LATEX tag is set to YES Doxygen generates more compact # LaTeX documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_LATEX = YES # The PAPER_TYPE tag can be used to set the paper type that is used # by the printer. Possible values are: a4, a4wide, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4wide # The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX # packages that should be included in the LaTeX output. EXTRA_PACKAGES = # The LATEX_HEADER tag can be used to specify a personal LaTeX header for # the generated latex document. The header should contain everything until # the first chapter. If it is left blank doxygen will generate a # standard header. Notice: only use this tag if you know what you are doing! LATEX_HEADER = # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated # is prepared for conversion to pdf (using ps2pdf). The pdf file will # contain links (just like the HTML output) instead of page references # This makes the output suitable for online browsing using a pdf viewer. PDF_HYPERLINKS = YES # If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of # plain latex in the generated Makefile. Set this option to YES to get a # higher quality PDF documentation. USE_PDFLATEX = YES # If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. # command to the generated LaTeX files. This will instruct LaTeX to keep # running if errors occur, instead of asking the user for help. # This option is also used when generating formulas in HTML. LATEX_BATCHMODE = NO #--------------------------------------------------------------------------- # configuration options related to the RTF output #--------------------------------------------------------------------------- # If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output # The RTF output is optimised for Word 97 and may not look very pretty with # other RTF readers or editors. GENERATE_RTF = NO # The RTF_OUTPUT tag is used to specify where the RTF docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `rtf' will be used as the default path. RTF_OUTPUT = rtf # If the COMPACT_RTF tag is set to YES Doxygen generates more compact # RTF documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_RTF = NO # If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated # will contain hyperlink fields. The RTF file will # contain links (just like the HTML output) instead of page references. # This makes the output suitable for online browsing using WORD or other # programs which support those fields. # Note: wordpad (write) and others do not support links. RTF_HYPERLINKS = NO # Load stylesheet definitions from file. Syntax is similar to doxygen's # config file, i.e. a series of assigments. You only have to provide # replacements, missing definitions are set to their default value. RTF_STYLESHEET_FILE = # Set optional variables used in the generation of an rtf document. # Syntax is similar to doxygen's config file. RTF_EXTENSIONS_FILE = #--------------------------------------------------------------------------- # configuration options related to the man page output #--------------------------------------------------------------------------- # If the GENERATE_MAN tag is set to YES (the default) Doxygen will # generate man pages GENERATE_MAN = NO # The MAN_OUTPUT tag is used to specify where the man pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `man' will be used as the default path. MAN_OUTPUT = man # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = .3 # If the MAN_LINKS tag is set to YES and Doxygen generates man output, # then it will generate one additional man file for each entity # documented in the real man page(s). These additional files # only source the real man page, but without them the man command # would be unable to find the correct page. The default is NO. MAN_LINKS = NO #--------------------------------------------------------------------------- # configuration options related to the XML output #--------------------------------------------------------------------------- # If the GENERATE_XML tag is set to YES Doxygen will # generate an XML file that captures the structure of # the code including all documentation. Note that this # feature is still experimental and incomplete at the # moment. GENERATE_XML = NO #--------------------------------------------------------------------------- # configuration options for the AutoGen Definitions output #--------------------------------------------------------------------------- # If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will # generate an AutoGen Definitions (see autogen.sf.net) file # that captures the structure of the code including all # documentation. Note that this feature is still experimental # and incomplete at the moment. GENERATE_AUTOGEN_DEF = NO #--------------------------------------------------------------------------- # Configuration options related to the preprocessor #--------------------------------------------------------------------------- # If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will # evaluate all C-preprocessor directives found in the sources and include # files. ENABLE_PREPROCESSING = YES # If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro # names in the source code. If set to NO (the default) only conditional # compilation will be performed. Macro expansion can be done in a controlled # way by setting EXPAND_ONLY_PREDEF to YES. MACRO_EXPANSION = NO # If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES # then the macro expansion is limited to the macros specified with the # PREDEFINED and EXPAND_AS_PREDEFINED tags. EXPAND_ONLY_PREDEF = NO # If the SEARCH_INCLUDES tag is set to YES (the default) the includes files # in the INCLUDE_PATH (see below) will be search if a #include is found. SEARCH_INCLUDES = YES # The INCLUDE_PATH tag can be used to specify one or more directories that # contain include files that are not input files but should be processed by # the preprocessor. INCLUDE_PATH = # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard # patterns (like *.h and *.hpp) to filter out the header-files in the # directories. If left blank, the patterns specified with FILE_PATTERNS will # be used. INCLUDE_FILE_PATTERNS = # The PREDEFINED tag can be used to specify one or more macro names that # are defined before the preprocessor is started (similar to the -D option of # gcc). The argument of the tag is a list of macros of the form: name # or name=definition (no spaces). If the definition and the = are # omitted =1 is assumed. PREDEFINED = DOXYGEN_SHOULD_SKIP_THIS # If the MACRO_EXPANSION and EXPAND_PREDEF_ONLY tags are set to YES then # this tag can be used to specify a list of macro names that should be expanded. # The macro definition that is found in the sources will be used. # Use the PREDEFINED tag if you want to use a different macro definition. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all function-like macros that are alone # on a line and do not end with a semicolon. Such function macros are typically # used for boiler-plate code, and will confuse the parser if not removed. SKIP_FUNCTION_MACROS = YES #--------------------------------------------------------------------------- # Configuration::addtions related to external references #--------------------------------------------------------------------------- # The TAGFILES tag can be used to specify one or more tagfiles. TAGFILES = # When a file name is specified after GENERATE_TAGFILE, doxygen will create # a tag file that is based on the input files it reads. GENERATE_TAGFILE = # If the ALLEXTERNALS tag is set to YES all external classes will be listed # in the class index. If set to NO only the inherited external classes # will be listed. ALLEXTERNALS = NO # If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed # in the modules index. If set to NO, only the current project's groups will # be listed. EXTERNAL_GROUPS = YES # The PERL_PATH should be the absolute path and name of the perl script # interpreter (i.e. the result of `which perl'). PERL_PATH = /usr/bin/perl #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- # If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will # generate a inheritance diagram (in Html, RTF and LaTeX) for classes with base or # super classes. Setting the tag to NO turns the diagrams off. Note that this # option is superceded by the HAVE_DOT option below. This is only a fallback. It is # recommended to install and use dot, since it yield more powerful graphs. CLASS_DIAGRAMS = YES # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is # available from the path. This tool is part of Graphviz, a graph visualization # toolkit from AT&T and Lucent Bell Labs. The other options in this section # have no effect if this option is set to NO (the default) HAVE_DOT = NO # If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect inheritance relations. Setting this tag to YES will force the # the CLASS_DIAGRAMS tag to NO. CLASS_GRAPH = YES # If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect implementation dependencies (inheritance, containment, and # class references variables) of the class with other documented classes. COLLABORATION_GRAPH = YES # If set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = YES # If set to YES, the inheritance and collaboration graphs will hide # inheritance and usage relations if the target is undocumented # or is not a class. HIDE_UNDOC_RELATIONS = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT # tags are set to YES then doxygen will generate a graph for each documented # file showing the direct and indirect include dependencies of the file with # other documented files. INCLUDE_GRAPH = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and # HAVE_DOT tags are set to YES then doxygen will generate a graph for each # documented header file showing the documented files that directly or # indirectly include this file. INCLUDED_BY_GRAPH = YES # If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen # will graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images # generated by dot. Possible values are png, jpg, or gif # If left blank png will be used. DOT_IMAGE_FORMAT = png # The tag DOT_PATH can be used to specify the path where the dot tool can be # found. If left blank, it is assumed the dot tool can be found on the path. DOT_PATH = # The DOTFILE_DIRS tag can be used to specify one or more directories that # contain dot files that are included in the documentation (see the # \dotfile command). DOTFILE_DIRS = # The MAX_DOT_GRAPH_WIDTH tag can be used to set the maximum allowed width # (in pixels) of the graphs generated by dot. If a graph becomes larger than # this value, doxygen will try to truncate the graph, so that it fits within # the specified constraint. Beware that most browsers cannot cope with very # large images. MAX_DOT_GRAPH_WIDTH = 1024 # The MAX_DOT_GRAPH_HEIGHT tag can be used to set the maximum allows height # (in pixels) of the graphs generated by dot. If a graph becomes larger than # this value, doxygen will try to truncate the graph, so that it fits within # the specified constraint. Beware that most browsers cannot cope with very # large images. MAX_DOT_GRAPH_HEIGHT = 1024 # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermedate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES #--------------------------------------------------------------------------- # Configuration::addtions related to the search engine #--------------------------------------------------------------------------- # The SEARCHENGINE tag specifies whether or not a search engine should be # used. If set to NO the values of all tags below this one will be ignored. SEARCHENGINE = NO # The CGI_NAME tag should be the name of the CGI script that # starts the search engine (doxysearch) with the correct parameters. # A script with this name will be generated by doxygen. CGI_NAME = search.cgi # The CGI_URL tag should be the absolute URL to the directory where the # cgi binaries are located. See the documentation of your http daemon for # details. CGI_URL = # The DOC_URL tag should be the absolute URL to the directory where the # documentation is located. If left blank the absolute path to the # documentation, with file:// prepended to it, will be used. DOC_URL = # The DOC_ABSPATH tag should be the absolute path to the directory where the # documentation is located. If left blank the directory on the local machine # will be used. DOC_ABSPATH = # The BIN_ABSPATH tag must point to the directory where the doxysearch binary # is installed. BIN_ABSPATH = /usr/local/bin/ # The EXT_DOC_PATHS tag can be used to specify one or more paths to # documentation generated for other projects. This allows doxysearch to search # the documentation for these projects as well. EXT_DOC_PATHS = interval-2.1.0/src/crlibm/scs_lib/INSTALL0000644000000000000000000002104613031036767016203 0ustar 00000000000000Basic Installation ================== Thank you for reporting installation problems to scslib@ens-lyon.fr Simple installation: ./configure make make install More advanced installation: try ./configure --help for the compile-time options Installation question specific to scslib: * to change the precision of the library, use ./configure --enable-nbdigits=10 --enable-digitsize=30 The guaranteed precision is digitsize*(nbdigits-1) bits. The nbdigits and digitsize should be such that nbdigits<2^(64-2*digitsize) Some day it will be checked by the configure script * to link against GMP/MPFR (not mandatory but used to test the library, notably if you changed the default precision) : use ./configure --enable-mpfr You need to have mpfr installed, which is a full piece of poetry by itself. You may need to specify its installation directory, typically by ./configure --enable-mpfr --with-gmp=/usr/local --with-mpfr=/usr/local Here are generic installation instructions. The `configure' shell script attempts to guess correct values for various system-dependent variables used during compilation. It uses those values to create a `Makefile' in each directory of the package. It may also create one or more `.h' files containing system-dependent definitions. Finally, it creates a shell scsript `config.status' that you can run in the future to recreate the current configuration, a file `config.cache' that saves the results of its tests to speed up reconfiguring, and a file `config.log' containing compiler output (useful mainly for debugging `configure'). If you need to do unusual things to compile the package, please try to figure out how `configure' could check whether to do them, and mail diffs or instructions to the address given in the `README' so they can be considered for the next release. If at some point `config.cache' contains results you don't want to keep, you may remove or edit it. The file `configure.in' is used to create `configure' by a program called `autoconf'. You only need `configure.in' if you want to change it or regenerate `configure' using a newer version of `autoconf'. The simplest way to compile this package is: 1. `cd' to the directory containing the package's source code and type `./configure' to configure the package for your system. If you're using `csh' on an old version of System V, you might need to type `sh ./configure' instead to prevent `csh' from trying to execute `configure' itself. Running `configure' takes awhile. While running, it prints some messages telling which features it is checking for. 2. Type `make' to compile the package. 3. Optionally, type `make check' to run any self-tests that come with the package. 4. Type `make install' to install the programs and any data files and documentation. 5. You can remove the program binaries and object files from the source code directory by typing `make clean'. To also remove the files that `configure' created (so you can compile the package for a different kind of computer), type `make distclean'. There is also a `make maintainer-clean' target, but that is intended mainly for the package's developers. If you use it, you may have to get all sorts of other programs in order to regenerate files that came with the distribution. Compilers and Options ===================== Some systems require unusual options for compilation or linking that the `configure' scsript does not know about. You can give `configure' initial values for variables by setting them in the environment. Using a Bourne-compatible shell, you can do that on the command line like this: CC=c89 CFLAGS=-O2 LIBS=-lposix ./configure Or on systems that have the `env' program, you can do it like this: env CPPFLAGS=-I/usr/local/include LDFLAGS=-s ./configure Compiling For Multiple Architectures ==================================== You can compile the package for more than one kind of computer at the same time, by placing the object files for each architecture in their own directory. To do this, you must use a version of `make' that supports the `VPATH' variable, such as GNU `make'. `cd' to the directory where you want the object files and executables to go and run the `configure' scsript. `configure' automatically checks for the source code in the directory that `configure' is in and in `..'. If you have to use a `make' that does not supports the `VPATH' variable, you have to compile the package for one architecture at a time in the source code directory. After you have installed the package for one architecture, use `make distclean' before reconfiguring for another architecture. Installation Names ================== By default, `make install' will install the package's files in `/usr/local/bin', `/usr/local/man', etc. You can specify an installation prefix other than `/usr/local' by giving `configure' the option `--prefix=PATH'. You can specify separate installation prefixes for architecture-specific files and architecture-independent files. If you give `configure' the option `--exec-prefix=PATH', the package will use PATH as the prefix for installing programs and libraries. Documentation and other data files will still use the regular prefix. In addition, if you use an unusual directory layout you can give options like `--bindir=PATH' to specify different values for particular kinds of files. Run `configure --help' for a list of the directories you can set and what kinds of files go in them. If the package supports it, you can cause programs to be installed with an extra prefix or suffix on their names by giving `configure' the option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'. Optional Features ================= Some packages pay attention to `--enable-FEATURE' options to `configure', where FEATURE indicates an optional part of the package. They may also pay attention to `--with-PACKAGE' options, where PACKAGE is something like `gnu-as' or `x' (for the X Window System). The `README' should mention any `--enable-' and `--with-' options that the package recognizes. For packages that use the X Window System, `configure' can usually find the X include and library files automatically, but if it doesn't, you can use the `configure' options `--x-includes=DIR' and `--x-libraries=DIR' to specify their locations. Specifying the System Type ========================== There may be some features `configure' can not figure out automatically, but needs to determine by the type of host the package will run on. Usually `configure' can figure that out, but if it prints a message saying it can not guess the host type, give it the `--host=TYPE' option. TYPE can either be a short name for the system type, such as `sun4', or a canonical name with three fields: CPU-COMPANY-SYSTEM See the file `config.sub' for the possible values of each field. If `config.sub' isn't included in this package, then this package doesn't need to know the host type. If you are building compiler tools for cross-compiling, you can also use the `--target=TYPE' option to select the type of system they will produce code for and the `--build=TYPE' option to select the type of system on which you are compiling the package. Sharing Defaults ================ If you want to set default values for `configure' scsripts to share, you can create a site shell scsript called `config.site' that gives default values for variables like `CC', `cache_file', and `prefix'. `configure' looks for `PREFIX/share/config.site' if it exists, then `PREFIX/etc/config.site' if it exists. Or, you can set the `CONFIG_SITE' environment variable to the location of the site scsript. A warning: not all `configure' scsripts look for a site scsript. Operation Controls ================== `configure' recognizes the following options to control how it operates. `--cache-file=FILE' Use and save the results of the tests in FILE instead of `./config.cache'. Set FILE to `/dev/null' to disable caching, for debugging `configure'. `--help' Print a summary of the options to `configure', and exit. `--quiet' `--silent' `-q' Do not print messages saying which checks are being made. To suppress all normal output, redirect it to `/dev/null' (any error messages will still be shown). `--srcdir=DIR' Look for the package's source code in directory DIR. Usually `configure' can determine that directory automatically. `--version' Print the version of Autoconf used to generate the `configure' scsript, and exit. `configure' also accepts some other, not widely useful, options. interval-2.1.0/src/crlibm/scs_lib/Makefile.am0000644000000000000000000000052013031036767017200 0ustar 00000000000000## Process this file with automake to produce Makefile.in lib_LIBRARIES = libscs.a INCLUDES=-I$(top_srcdir) libscs_a_SOURCES = scs.h scs_private.h scs_private.c \ double2scs.c print_scs.c \ division_scs.c\ addition_scs.c multiplication_scs.c\ scs2double.c zero_scs.c \ scs2mpfr.c include_HEADERS = scs.h ../crlibm_config.h interval-2.1.0/src/crlibm/scs_lib/NEWS0000644000000000000000000000000013031036767015634 0ustar 00000000000000interval-2.1.0/src/crlibm/scs_lib/README0000644000000000000000000000040613031036767016027 0ustar 00000000000000scslib, the Software Carry-Save multiple-precision library Authors: David Defour, Catherine Daramy, Florent de Dinechin See the Docs directory for a detailed description and installation instructions. See the DocsDev directory for developer documentation. interval-2.1.0/src/crlibm/scs_lib/README.DEV0000644000000000000000000000152213031036767016444 0ustar 00000000000000Toute la doc est dans les pages info. Les seuls fichiers que j'ai crits moi-mme sont configure.in et Makefile.am Les commandes taper la premire fois aprs le cvs checkout sont (dans l'ordre) aclocal autoheader autoconf automake --add-missing ./configure Pour faire la doc: doxygen Doxyfile.user doxygen Doxyfile.dev puis aller dans le rpertoires latex de Docs et faire cd Docs/latex/ pdflatex refman.tex (deux fois pour les rfrences) Pour enlever un peu du bordel d'autoconf: make distclean Pour exporter : make dist Remarque : sur mon debian woody l'autoconf de service est trop vieux, il faut utiliser la commande autoconf2.50 ... Remarque du meme genre: si on fait make dist sous solaris le truc marche sous linux, mais l'inverse n'est pas vrai (--add-missing ajoute plus de trucs sous solaris). Super portable tout cela. interval-2.1.0/src/crlibm/scs_lib/TODO0000644000000000000000000000023013031036767015632 0ustar 00000000000000(in order of importance/priority) Fix the number of iterations in the division Check the precision in the configure script Add back SPARC optimisations interval-2.1.0/src/crlibm/scs_lib/VERSION0000644000000000000000000000000613031036767016213 0ustar 000000000000001.4.1 interval-2.1.0/src/crlibm/scs_lib/addition_scs.c0000644000000000000000000003733413031036767017770 0ustar 00000000000000/** Functions for SCS addition and subtraction @file addition_scs.c @author Defour David David.Defour@ens-lyon.fr @author Florent de Dinechin Florent.de.Dinechin@ens-lyon.fr This file is part of the SCS library. Many functions come in two versions, selected by a @#if. The reason is that we designed scslib library for internal use with SCS_NB_WORDS==8, so we provide a version with manual optimizations for this case. These optimisations include loop unrolling, and sometimes replacing temporary arrays of size 8 with 8 variables, which is more efficient on all modern processors with many (renaming) registers. Using gcc3.2 with the most aggressive optimization options for this purpose (-funroll-loops -foptimize-register-move -frerun-loop-opt -frerun-cse-after-loop) is still much slower. At some point in the future, gcc should catch up with unrolling since our loops are so simple, however the replacement of small arrays with variables is not something we are aware of in the literature about compiler optimization. */ /* Copyright (C) 2002 David Defour and Florent de Dinechin This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include "scs.h" #include "scs_private.h" /** This function copies a result into another. There is an unrolled version for the case SCS_NB_WORDS==8. */ void scs_set(scs_ptr result, scs_ptr x){ /* unsigned int i;*/ #if (SCS_NB_WORDS==8) R_HW[0] = X_HW[0]; R_HW[1] = X_HW[1]; R_HW[2] = X_HW[2]; R_HW[3] = X_HW[3]; R_HW[4] = X_HW[4]; R_HW[5] = X_HW[5]; R_HW[6] = X_HW[6]; R_HW[7] = X_HW[7]; #else for(i=0; i0; i--){ c = R_HW[i] & ~SCS_MASK_RADIX; R_HW[i-1] += c >> SCS_NB_BITS; R_HW[i] = R_HW[i] & SCS_MASK_RADIX; } if (R_HW[0] >= SCS_RADIX){ /* Carry out! Need to shift digits */ c = R_HW[0] & ~SCS_MASK_RADIX; c = c >> SCS_NB_BITS; for(i=SCS_NB_WORDS-1; i>1; i--) R_HW[i] = R_HW[i-1]; R_HW[1] = R_HW[0] & SCS_MASK_RADIX; R_HW[0] = c; R_IND += 1; }else{ /* Was there a cancellation ? */ if (R_HW[0] == 0){ k = 1; while ((R_HW[k] == 0) && (k <= SCS_NB_WORDS)) k++; R_IND -= k; for(j=k, i=0; j> SCS_NB_BITS; R_HW[6] += carry; R_HW[7] = R_HW[7] & SCS_MASK_RADIX; carry = R_HW[6] >> SCS_NB_BITS; R_HW[5] += carry; R_HW[6] = R_HW[6] & SCS_MASK_RADIX; carry = R_HW[5] >> SCS_NB_BITS; R_HW[4] += carry; R_HW[5] = R_HW[5] & SCS_MASK_RADIX; carry = R_HW[4] >> SCS_NB_BITS; R_HW[3] += carry; R_HW[4] = R_HW[4] & SCS_MASK_RADIX; carry = R_HW[3] >> SCS_NB_BITS; R_HW[2] += carry; R_HW[3] = R_HW[3] & SCS_MASK_RADIX; carry = R_HW[2] >> SCS_NB_BITS; R_HW[1] += carry; R_HW[2] = R_HW[2] & SCS_MASK_RADIX; carry = R_HW[1] >> SCS_NB_BITS; R_HW[0] += carry; R_HW[1] = R_HW[1] & SCS_MASK_RADIX; #else for(i=(SCS_NB_WORDS-1);i>0;i--){ carry = R_HW[i] >> SCS_NB_BITS; R_HW[i-1] += carry; R_HW[i] = R_HW[i] & SCS_MASK_RADIX; } #endif if (R_HW[0] >= SCS_RADIX){ /* Carry out ! Need to shift digits */ c0 = R_HW[0] >> SCS_NB_BITS; #if (SCS_NB_WORDS==8) R_HW[7] = R_HW[6]; R_HW[6] = R_HW[5]; R_HW[5] = R_HW[4]; R_HW[4] = R_HW[3]; R_HW[3] = R_HW[2]; R_HW[2] = R_HW[1]; #else for(i=(SCS_NB_WORDS-1); i>1; i--) R_HW[i] = R_HW[i-1]; #endif R_HW[1] = R_HW[0] & SCS_MASK_RADIX; R_HW[0] = c0; R_IND += 1; } return; } /* addition without renormalisation. Add two scs number x and y, the result is put into "result". Assumes x.sign == y.sign x.index > y.index. The result is not normalized. */ static void do_add_no_renorm(scs_ptr result, scs_ptr x, scs_ptr y){ unsigned int RES[SCS_NB_WORDS]; unsigned int i, j, Diff; if (x->exception.i[HI]==0){scs_set(result, y); return; } if (y->exception.i[HI]==0){scs_set(result, x); return; } for (i=0; i= Y_IND) do_add_no_renorm(result,x,y); else do_add_no_renorm(result,y,x); return; } /* The function that does the work in case of an addition do_add is the function that does the addition of two SCS numbers, assuming that x.sign == y.sign, X_IND > Y_IND, x and y both non-zero. */ static void do_add(scs_ptr result, scs_ptr x, scs_ptr y) { #if (SCS_NB_WORDS==8) /* in this case we unroll all the loops */ int Diff; unsigned int carry; unsigned int r0,r1,r2,r3,r4,r5,r6,r7; Diff = X_IND - Y_IND; R_EXP = X_EXP + Y_EXP - 1; R_IND = X_IND; R_SGN = X_SGN; #if 0 if(Diff<4) if(Diff<2) if(Diff==0) { // case 0: r0 = X_HW[0] + Y_HW[0]; r1 = X_HW[1] + Y_HW[1]; r2 = X_HW[2] + Y_HW[2]; r3 = X_HW[3] + Y_HW[3]; r4 = X_HW[4] + Y_HW[4]; r5 = X_HW[5] + Y_HW[5]; r6 = X_HW[6] + Y_HW[6]; r7 = X_HW[7] + Y_HW[7]; } else { // case 1: r0 = X_HW[0]; r1 = X_HW[1] + Y_HW[0]; r2 = X_HW[2] + Y_HW[1]; r3 = X_HW[3] + Y_HW[2]; r4 = X_HW[4] + Y_HW[3]; r5 = X_HW[5] + Y_HW[4]; r6 = X_HW[6] + Y_HW[5]; r7 = X_HW[7] + Y_HW[6]; } else if(Diff==2) { //case 2: r0 = X_HW[0]; r1 = X_HW[1]; r2 = X_HW[2] + Y_HW[0]; r3 = X_HW[3] + Y_HW[1]; r4 = X_HW[4] + Y_HW[2]; r5 = X_HW[5] + Y_HW[3]; r6 = X_HW[6] + Y_HW[4]; r7 = X_HW[7] + Y_HW[5]; } else { // case 3: r0 = X_HW[0]; r1 = X_HW[1]; r2 = X_HW[2]; r3 = X_HW[3] + Y_HW[0]; r4 = X_HW[4] + Y_HW[1]; r5 = X_HW[5] + Y_HW[2]; r6 = X_HW[6] + Y_HW[3]; r7 = X_HW[7] + Y_HW[4]; } else if(Diff<6) if(Diff==4) { // case 4: r0 = X_HW[0]; r1 = X_HW[1]; r2 = X_HW[2]; r3 = X_HW[3]; r4 = X_HW[4] + Y_HW[0]; r5 = X_HW[5] + Y_HW[1]; r6 = X_HW[6] + Y_HW[2]; r7 = X_HW[7] + Y_HW[3]; } else { // case 5: r0 = X_HW[0]; r1 = X_HW[1]; r2 = X_HW[2]; r3 = X_HW[3]; r4 = X_HW[4]; r5 = X_HW[5] + Y_HW[0]; r6 = X_HW[6] + Y_HW[1]; r7 = X_HW[7] + Y_HW[2]; } else if(Diff<8) if(Diff==6) { // case 6: r0 = X_HW[0]; r1 = X_HW[1]; r2 = X_HW[2]; r3 = X_HW[3]; r4 = X_HW[4]; r5 = X_HW[5]; r6 = X_HW[6] + Y_HW[0]; r7 = X_HW[7] + Y_HW[1]; } else { // case 7: r0 = X_HW[0]; r1 = X_HW[1]; r2 = X_HW[2]; r3 = X_HW[3]; r4 = X_HW[4]; r5 = X_HW[5]; r6 = X_HW[6]; r7 = X_HW[7] + Y_HW[0]; } else { /* Diff >= 8*/ R_HW[0] = X_HW[0]; R_HW[1] = X_HW[1]; R_HW[2] = X_HW[2]; R_HW[3] = X_HW[3]; R_HW[4] = X_HW[4]; R_HW[5] = X_HW[5]; R_HW[6] = X_HW[6]; R_HW[7] = X_HW[7]; return; } #else switch (Diff){ case 0: r0 = X_HW[0] + Y_HW[0]; r1 = X_HW[1] + Y_HW[1]; r2 = X_HW[2] + Y_HW[2]; r3 = X_HW[3] + Y_HW[3]; r4 = X_HW[4] + Y_HW[4]; r5 = X_HW[5] + Y_HW[5]; r6 = X_HW[6] + Y_HW[6]; r7 = X_HW[7] + Y_HW[7]; break; case 1: r0 = X_HW[0]; r1 = X_HW[1] + Y_HW[0]; r2 = X_HW[2] + Y_HW[1]; r3 = X_HW[3] + Y_HW[2]; r4 = X_HW[4] + Y_HW[3]; r5 = X_HW[5] + Y_HW[4]; r6 = X_HW[6] + Y_HW[5]; r7 = X_HW[7] + Y_HW[6]; break; case 2: r0 = X_HW[0]; r1 = X_HW[1]; r2 = X_HW[2] + Y_HW[0]; r3 = X_HW[3] + Y_HW[1]; r4 = X_HW[4] + Y_HW[2]; r5 = X_HW[5] + Y_HW[3]; r6 = X_HW[6] + Y_HW[4]; r7 = X_HW[7] + Y_HW[5]; break; case 3: r0 = X_HW[0]; r1 = X_HW[1]; r2 = X_HW[2]; r3 = X_HW[3] + Y_HW[0]; r4 = X_HW[4] + Y_HW[1]; r5 = X_HW[5] + Y_HW[2]; r6 = X_HW[6] + Y_HW[3]; r7 = X_HW[7] + Y_HW[4]; break; case 4: r0 = X_HW[0]; r1 = X_HW[1]; r2 = X_HW[2]; r3 = X_HW[3]; r4 = X_HW[4] + Y_HW[0]; r5 = X_HW[5] + Y_HW[1]; r6 = X_HW[6] + Y_HW[2]; r7 = X_HW[7] + Y_HW[3]; break; case 5: r0 = X_HW[0]; r1 = X_HW[1]; r2 = X_HW[2]; r3 = X_HW[3]; r4 = X_HW[4]; r5 = X_HW[5] + Y_HW[0]; r6 = X_HW[6] + Y_HW[1]; r7 = X_HW[7] + Y_HW[2]; break; case 6: r0 = X_HW[0]; r1 = X_HW[1]; r2 = X_HW[2]; r3 = X_HW[3]; r4 = X_HW[4]; r5 = X_HW[5]; r6 = X_HW[6] + Y_HW[0]; r7 = X_HW[7] + Y_HW[1]; break; case 7: r0 = X_HW[0]; r1 = X_HW[1]; r2 = X_HW[2]; r3 = X_HW[3]; r4 = X_HW[4]; r5 = X_HW[5]; r6 = X_HW[6]; r7 = X_HW[7] + Y_HW[0]; break; default: /* Diff >= 8*/ R_HW[0] = X_HW[0]; R_HW[1] = X_HW[1]; R_HW[2] = X_HW[2]; R_HW[3] = X_HW[3]; R_HW[4] = X_HW[4]; R_HW[5] = X_HW[5]; R_HW[6] = X_HW[6]; R_HW[7] = X_HW[7]; return; } #endif /* Carry propagation */ carry = r7 >> SCS_NB_BITS; r6 += carry; r7 = r7 & SCS_MASK_RADIX; carry = r6 >> SCS_NB_BITS; r5 += carry; r6 = r6 & SCS_MASK_RADIX; carry = r5 >> SCS_NB_BITS; r4 += carry; r5 = r5 & SCS_MASK_RADIX; carry = r4 >> SCS_NB_BITS; r3 += carry; r4 = r4 & SCS_MASK_RADIX; carry = r3 >> SCS_NB_BITS; r2 += carry; r3 = r3 & SCS_MASK_RADIX; carry = r2 >> SCS_NB_BITS; r1 += carry; r2 = r2 & SCS_MASK_RADIX; carry = r1 >> SCS_NB_BITS; r0 += carry; r1 = r1 & SCS_MASK_RADIX; carry = r0 >> SCS_NB_BITS; if (carry!=0){ R_HW[7] = r6; R_HW[6] = r5; R_HW[5] = r4; R_HW[4] = r3; R_HW[3] = r2; R_HW[2] = r1; R_HW[1] = r0 & SCS_MASK_RADIX; R_HW[0] = 1 ; R_IND += 1; } else { R_HW[0] = r0; R_HW[1] = r1; R_HW[2] = r2; R_HW[3] = r3; R_HW[4] = r4; R_HW[5] = r5; R_HW[6] = r6; R_HW[7] = r7; } return; #else /* #if SCS_NB_WORDS==8*/ /* This generic version is still written in such a way that it is unrollable at compile time */ int i,j, s, carry, Diff; int res[SCS_NB_WORDS]; Diff = X_IND - Y_IND; R_EXP = X_EXP + Y_EXP - 1; R_IND = X_IND; R_SGN = X_SGN; /* The easy case */ if(Diff >= SCS_NB_WORDS){ scs_set(result, x); return; } /* 0 <= Diff <= (SCS_NB_WORDS-1) */ carry=0; for(i=(SCS_NB_WORDS-1), j=((SCS_NB_WORDS-1)-Diff); i>=0 ; i--,j--){ if (j>=0) s = X_HW[i] + Y_HW[j] + carry; else s = X_HW[i] + carry; carry = s >> SCS_NB_BITS; res[i] = s & SCS_MASK_RADIX; } if (carry){ /* Carry out ! Need to shift digits */ for(i=(SCS_NB_WORDS-1); i>=1; i--) R_HW[i] = res[i-1]; R_HW[0] = 1 ; R_IND += 1; } else { for(i=0; i= Y_IND // - X_SIGN != Y_SIGN // neither x or y is zero // and result = x - y */ static void do_sub(scs_ptr result, scs_ptr x, scs_ptr y){ int s, carry; int Diff, i, j, cp; int res[SCS_NB_WORDS]; R_EXP = X_EXP + Y_EXP - 1; Diff = X_IND - Y_IND; R_IND = X_IND; /* The easy case */ if(Diff >= SCS_NB_WORDS){ scs_set(result, x); return; } else { /* 0 <= Diff <= (SCS_NB_WORDS-1) */ carry = 0; if(Diff==0) { i=0; while((X_HW[i] == Y_HW[i]) && (i Y_HW[i]) cp=1; else if (X_HW[i] < Y_HW[i]) cp=-1; else cp=0; if (cp == 0) { /* Yet another easy case: result = 0 */ scs_zero(result); return; } else { /* cp <> 0 */ if (cp > 0){ /* x > y */ R_SGN = X_SGN; for(i=(SCS_NB_WORDS-1); i>=0 ;i--){ s = (int)(X_HW[i] - Y_HW[i] - carry); carry = (int)((s&SCS_RADIX)>>SCS_NB_BITS); res[i] = (int)((s&SCS_RADIX) + s); } } else { /* cp < 0 */ /* x < y (change of sign) */ R_SGN = - X_SGN; for(i=(SCS_NB_WORDS-1); i>=0 ;i--){ s = (int)(- X_HW[i] + Y_HW[i] - carry); carry = (int)((s&SCS_RADIX)>>SCS_NB_BITS); res[i] = (int)((s&SCS_RADIX) + s); } } } } else { /* 1<=Diff<(SCS_NB_WORDS-1) Digits of x and y overlap but the * sign will be that of x */ R_SGN = X_SGN; for(i=(SCS_NB_WORDS-1), j=((SCS_NB_WORDS-1)-Diff); i>=0 ;i--,j--){ if(j>=0) s = (int)(X_HW[i] - Y_HW[j] - carry); else s = (int)(X_HW[i] - carry); carry = (int)((s&SCS_RADIX)>>SCS_NB_BITS); res[i] = (int)((s&SCS_RADIX) + s); } } /* check for cancellations */ i=0; while ((res[i]==0) && (i < SCS_NB_WORDS)) i++; if(i>0) { /* cancellation, shift result*/ R_IND -= i; for(j=0; iexception.i[HI]==0){scs_set(result, y); return; } if (y->exception.i[HI]==0){scs_set(result, x); return; } if (X_SGN == Y_SGN){ if(X_IND >= Y_IND) do_add(result,x,y); else do_add(result,y,x); }else { if(X_IND>=Y_IND){ do_sub(result,x,y); }else { do_sub(result,y,x); } } return; } /** SCS subtraction (result is a normalised SCS number). The arguments x, y and result may point to the same memory location. */ void scs_sub(scs_ptr result, scs_ptr x, scs_ptr y) { if (x->exception.i[HI]==0) { scs_set(result, y); R_SGN = -R_SGN; return; } if (y->exception.i[HI]==0) { scs_set(result, x); return; } if (X_SGN == Y_SGN) { /* Same sign, so it's a sub */ if(X_IND>=Y_IND) do_sub(result,x,y); else{ do_sub(result,y,x); R_SGN = -R_SGN; } }else { if(X_IND>=Y_IND) do_add(result,x,y); else{ do_add(result,y,x); R_SGN = -R_SGN; } } return; } interval-2.1.0/src/crlibm/scs_lib/division_scs.c0000644000000000000000000000565113031036767020016 0ustar 00000000000000/** Functions for SCS inverse and division @file division_scs.c @author Defour David David.Defour@ens-lyon.fr @author Florent de Dinechin Florent.de.Dinechin@ens-lyon.fr This file is part of the SCS library. */ /* Copyright (C) 2002 David Defour and Florent de Dinechin This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include "scs.h" #include "scs_private.h" void scs_div_2(scs_ptr num) { /* small function to divide by 2 any SCS number */ unsigned int carry, mask, old_value; int i; carry = 0x00000000; mask = (unsigned int)(((0x1) << SCS_NB_BITS)-1);/*we now have a mask for the used bits in a word*/ /* if it's a normal number, i.e. not zero nor NaN */ if( (num->exception).d == (double) 1) { /* first, a loop to rotate all numbers to the right*/ for(i = 0; i < SCS_NB_WORDS; i++) { old_value = num->h_word[i]; num->h_word[i] = (old_value & !mask) | carry | ((old_value >> 1) & mask); carry = old_value & 0x00000001;/* it can be interesting to keep the last bit of each number =) */ carry = carry << (SCS_NB_BITS-1); } /* In the SCS format, the first number can't be zero, so we must handle this particular case */ if (num->h_word[0] == 0){ num->index = num->index - 1; for(i = 1; i < SCS_NB_WORDS; i++) { num->h_word[i-1] = num->h_word[i]; } num->h_word[SCS_NB_WORDS-1] = 0; } } else { (num->exception).d = (num->exception).d / 2;/* zero, NaN, ... */ } } /* * Compute 1/x with a Newton scheme */ void scs_inv(scs_ptr result, scs_ptr x){ scs_t tmp, res, res1, scstwo; double app_x, inv; scs_set(tmp, x); tmp->index = 0; scs_get_d(&app_x, tmp); scs_set_si(scstwo, 2); /* inv is a 53-bit approximation of 1/x */ inv = 1/app_x; scs_set_d(res, inv); res->index -= x->index; /* First Newton Iteration */ scs_mul(res1, x, res); scs_sub(res1, scstwo, res1); scs_mul(res, res, res1); /* Second Newton Iteration */ scs_mul(res1, x, res); scs_sub(res1, scstwo, res1); scs_mul(result, res, res1); return; } /* * Compute result = x/y; */ void scs_div(scs_ptr result, scs_ptr x, scs_ptr y){ scs_t res; if (X_EXP != 1){ R_EXP = X_EXP / Y_EXP; return; } scs_inv(res, y); scs_mul(result, res, x); return; } interval-2.1.0/src/crlibm/scs_lib/double2scs.c0000644000000000000000000001032413031036767017360 0ustar 00000000000000/** Conversion of floating-point double to SCS @file double2scs.c @author Defour David David.Defour@ens-lyon.fr @author Florent de Dinechin Florent.de.Dinechin@ens-lyon.fr This file is part of the SCS library. */ /* Copyright (C) 2002 David Defour and Florent de Dinechin This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include "scs.h" #include "scs_private.h" /** Convert a double precision number in it SCS multiprecision representation */ void scs_set_d(scs_ptr result, double x){ db_number nb, mantissa; int exponent, exponent_remainder; int ind, i; if(x>=0){R_SGN = 1; nb.d = x;} else {R_SGN = -1; nb.d = -x;} exponent = nb.i[HI] & 0x7ff00000 ; if (exponent == 0x7ff00000) { /* * x = +/- Inf, s/qNAN */ R_EXP = x; for(i=0; i> 20; /* get the actual value */ ind = ((exponent +((100*SCS_NB_BITS)-1023))/SCS_NB_BITS) - 100 ; /* means : = (exponent -1023 + 100*SCS_NB_BITS)/SCS_NB_BITS -100 The business with 100*SCS_NB_BITS is to stay within the positive range for exponent_remainder between 1 and SCS_NB_BITS */ exponent_remainder = exponent - 1022 - (SCS_NB_BITS*ind); R_IND += ind; /* now get the mantissa and add the implicit 1 in fp. format*/ mantissa.l = (nb.l & ULL(000fffffffffffff)) | ULL(0010000000000000); /* and spread it over the structure Everything here is 64-bit arithmetic */ R_HW[0] = (unsigned int) (mantissa.l >> (53 - exponent_remainder) ); /* 11 = 64-53 */ mantissa.l = (mantissa.l << (exponent_remainder+11)); R_HW[1] = (mantissa.i[HI] >> (32 - SCS_NB_BITS))& SCS_MASK_RADIX ; mantissa.l = (mantissa.l << SCS_NB_BITS); R_HW[2] = (mantissa.i[HI] >> (32 - SCS_NB_BITS))& SCS_MASK_RADIX ; #if SCS_NB_BITS < 27 mantissa.l = (mantissa.l << SCS_NB_BITS); R_HW[3] = (mantissa.i[HI] >> (32 - SCS_NB_BITS))& SCS_MASK_RADIX ; #else R_HW[3] = 0 ; #endif #if (SCS_NB_WORDS==8) R_HW[4] = 0; R_HW[5] = 0; R_HW[6] = 0; R_HW[7] = 0; #else for(i=4; iSCS_RADIX_ONE_DOUBLE) { R_IND++; nb.d *= SCS_RADIX_MONE_DOUBLE; } while(nb.d<1) { R_IND--; nb.d *= SCS_RADIX_ONE_DOUBLE; } i=0; while(nb.d != 0){ R_HW[i] = (unsigned int) nb.d; nb.d = (nb.d - (double)R_HW[i]) * SCS_RADIX_ONE_DOUBLE; i++; } for(; i=0){R_SGN = 1; ux = (unsigned int)x;} else {R_SGN = -1; ux = (unsigned int)-x;} if (ux > SCS_RADIX){ R_IND = 1; R_HW[0] = (ux - SCS_RADIX) >> SCS_NB_BITS; R_HW[1] = ux - (R_HW[0] << SCS_NB_BITS); }else { R_IND = 0; R_HW[0] = ux; R_HW[1] = 0; } for(i=2; i " 0 "" {MPLTEXT 1 0 30 "NB_WORDS := 8:\nNB_BITS := 30:" }}}}{SECT 1 {PARA 3 "" 0 "" {TEXT -1 11 "GetSCS_real" }}{PARA 3 "" 0 "" {TEXT 256 67 "This procedu re convert a decimal number into it SCS representation." }}{PARA 3 "" 0 "" {TEXT 257 61 " x : input number to convert into it SCS repr esentation" }}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 883 "GetSCS_real : = proc(x)\nlocal exception, index, sign, mantissa, nb, i;\n\nif x <> 0 then\n exception := 1;\n if x > 0 then\n sign := 1;\n nb \+ := x;\n elif x < 0 then\n sign := -1;\n nb := -x;\n end if; \n \n index := 0;\n\n if nb >= 1 then\n for i from 0 while nb > \+ (2^(NB_BITS+1)-1) do\n index := index+1;\n nb := nb * 2^( -NB_BITS);\n end do; \n else\n for i from 0 while nb < 1 do\n \+ index := index-1;\n nb := nb * 2^(NB_BITS);\n end do; \+ \n end if;\n\n for i from 0 by 1 to (NB_WORDS-1) do\n mantissa[i] := trunc(nb);\n nb := (nb - mantissa[i]) * 2^(NB_BITS);\n end do;\nelse\n for i from 0 by 1 to (NB_WORDS-1) do\n mantissa[ i] := 0;\n end do;\n\n index := 1;\n exception := x;\n sign \+ := 1;\nend if;\nmantissa[NB_WORDS] := exception;\nmantissa[NB_WOR DS+1] := index;\nmantissa[NB_WORDS+2] := sign;\n\nreturn mantissa;\nen d proc:" }}}}{SECT 1 {PARA 3 "" 0 "" {TEXT -1 11 "SetSCS_real" }} {PARA 0 "" 0 "" {TEXT -1 44 "Convert an SCS number into a rational num ber" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 306 "SetSCS_real := proc(tab)\n local res, i;\n\n if (t ab[NB_WORDS] <> 1) then\n return tab[NB_WORDS];\n end if;\n\n res := 0;\n for i from (NB_WORDS-1) by -1 while i>=0 do\n res := 2^(- NB_BITS)*res + tab[i] \n end do;\n \nres := tab[NB_WORDS+2]*(res * 2 .^(NB_BITS * tab[NB_WORDS+1]));\n\nreturn res;\n\nend proc:\n" }}} {PARA 0 "" 0 "" {TEXT -1 0 "" }}}{SECT 1 {PARA 3 "" 0 "" {TEXT -1 8 "W riteSCS" }}{EXCHG {PARA 0 "" 0 "" {TEXT -1 204 "Write Into file fd the SCSS number stored into the table tab where\ntab[0..(NB_WORDS-1)] sto re the mantissa\ntab[NB_WORDS] store the exception\ntab[NB_WORDS+1] st ore the index\ntab[NB_WORDS+2] store the sign\n" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 541 "WriteSCS := proc(fd, tab)\n local i;\n\nfprintf(fd, \"\{\{\");\n\nfprintf(fd,\"0x%+0.8x, \", tab[0]);\nfor i from 1 by 1 t o (NB_WORDS-2) do\n fprintf(fd,\"0x%+0.8x, \", tab[i]);\n if (i mod \+ 4 = 3) then\n fprintf(fd,\"\\n\"); \n fi;\nend do;\nfprintf(fd,\"0 x%+0.8x\},\\n\", tab[NB_WORDS-1]);\nif (tab[NB_WORDS]=1) then\n fprin tf(fd,\"DB_ONE, %3d, %3d \", tab[NB_WORDS+1], tab[NB_WORDS+2]);\nelse \n # the only other possible value is 0 so....\n fprintf(fd,\"\{0x00 000000, 0x00000000\}, %3d, %3d \", tab[NB_WORDS+1], tab[NB_WORDS+2]); \nend if;\n\nfprintf(fd, \"\} \\n\");\nend proc:" }}}}{SECT 1 {PARA 3 "" 0 "" {TEXT -1 11 "GetSCS_poly" }}{PARA 0 "" 0 "" {TEXT -1 0 "" }} {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 220 "get_nb_terms := proc(poly) \n local i, deg_poly;\n\n deg_poly := degree(poly);\n for i from deg_p oly by -1 while i>=0 do\n if coeff(poly, x, i)=0 then\n deg_poly := deg_poly-1;\n end if;\n end do;\n\n return deg_poly;\nend proc:" }} {PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 67 "Convert each coefficient of a polynom into it SCSS representati on\n\n" }}{PARA 0 "" 0 "" {TEXT -1 72 "poly : input polynom \n file : name of the file where to put the result\n" }{MPLTEXT 1 0 687 "GetSCS _poly := proc(poly, file)\n local i, fd, mantissa, deg;\n #fclose(fd );\n\n try\n fd := fopen(file, WRITE,TEXT);\n finally\n fprint f(fd,\"static const SCS constant_poly[%d]=\\n\",get_nb_terms(poly)+1); \n deg := degree(poly); \n\n fprintf(fd,\"/* ~%e */ \\n\{\", coe ff(poly, x, deg)); \n mantissa := GetSCS_real(coeff(poly, x, deg) );\n WriteSCS(fd, mantissa); \n for i from (deg-1) by (-1) while i>=0 do\n if (coeff(poly, x, i)<>0) then \n fprintf(fd,\" ,\\n/* ~%e */ \\n\", coeff(poly, x, i));\n mantissa := GetSCS_r eal(coeff(poly, x, i));\n WriteSCS(fd, mantissa, 0);\n end if; \n end do;\n fprintf(fd,\"\};\\n\");\n \n fclose(fd);\n \+ end try;\nend proc:" }}}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 51 "Ge tSCS_poly(Poly_Res, \"/home/ddefour/coef_ln10.h\");" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 14 "Digits := 100:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}}}{MARK "8 0 0" 0 }{VIEWOPTS 1 1 0 1 1 1803 1 1 1 1 }{PAGENUMBERS 0 1 2 33 1 1 } interval-2.1.0/src/crlibm/scs_lib/maple/calculpoly.mws0000644000000000000000000004447513031036767021162 0ustar 00000000000000{VERSION 4 0 "SUN SPARC SOLARIS" "4.0" } {USTYLETAB {CSTYLE "Maple Input" -1 0 "Courier" 0 1 255 0 0 1 0 1 0 0 1 0 0 0 0 1 }{CSTYLE "2D Math" -1 2 "Times" 0 1 0 0 0 0 0 0 2 0 0 0 0 0 0 1 }{CSTYLE "2D Output" 2 20 "" 0 1 0 0 255 1 0 0 0 0 0 0 0 0 0 1 } {PSTYLE "Normal" -1 0 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "Text Output" -1 2 1 {CSTYLE "" -1 -1 "Courier" 1 10 0 0 255 1 0 0 0 0 0 1 3 0 3 0 }1 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "" 2 6 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 2 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "W arning" 2 7 1 {CSTYLE "" -1 -1 "" 0 1 0 0 255 1 0 0 0 0 0 0 1 0 0 0 } 0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "Error" 7 8 1 {CSTYLE "" -1 -1 "" 0 1 255 0 255 1 0 0 0 0 0 0 0 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "Maple Output" 0 11 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 }3 3 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "" 11 12 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 }1 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }} {SECT 0 {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 16 "with(numapprox);" }} {PARA 11 "" 1 "" {XPPMATH 20 "6#7/%(chebdegG%)chebmultG%)chebpadeG%)ch ebsortG%*chebyshevG%,confracformG%-hermite_padeG%+hornerformG%(infnorm G%(laurentG%(minimaxG%%padeG%&remezG" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 142 "P := convert(series(sin(sqrt(x))/(x^(3/2)-1/x), x=0, 5 ), polynom):\nR := minimax(P, x=2^(-60)..2^(-9),[7,0],((sqrt(x^3))/ sin(sqrt(x))),'err');" }}{PARA 6 "" 1 "" {TEXT -1 81 "minimax: weigh t function is proc (x) evalf((x^3)^(1/2)/sin(x^(1/2))) end proc" }} {PARA 6 "" 1 "" {TEXT -1 128 "minimax: procedure for function evalua tion is proc (x) evalf(-x^(3/2)+1/6*x^(5/2)-1/120*x^(7/2)-x^4+1/5040 *x^(9/2)) end proc" }}{PARA 6 "" 1 "" {TEXT -1 20 "numapprox[chebyshev ]" }}{PARA 6 "" 1 "" {TEXT -1 28 "procedure for evaluation is:" }} {PARA 6 "" 1 "" {TEXT -1 78 "proc (x) evalf(-x^(3/2)+1/6*x^(5/2)-1/120 *x^(7/2)-x^4+1/5040*x^(9/2)) end proc" }}{PARA 6 "" 1 "" {TEXT -1 64 " numapprox[chebyshev] try again using more function evaluations" }} {PARA 6 "" 1 "" {TEXT -1 20 "numapprox/chebyshev:" }}{PARA 6 "" 1 "" {TEXT -1 28 "procedure for evaluation is:" }}{PARA 6 "" 1 "" {TEXT -1 78 "proc (x) evalf(-x^(3/2)+1/6*x^(5/2)-1/120*x^(7/2)-x^4+1/5040*x^(9/ 2)) end proc" }}{PARA 6 "" 1 "" {TEXT -1 417 "minimax: the Chebyshev -Pade approximation is -.4394713587e-4*T(1,1024.000000*x-1.000000000 )-.6275569735e-5*T(2,1024.000000*x-1.000000000)+.6982024156e-6*T(3,102 4.000000*x-1.000000000)-.1903388654e-6*T(4,1024.000000*x-1.000000000)+ .7320175804e-7*T(5,1024.000000*x-1.000000000)-.3416008676e-7*T(6,1024. 000000*x-1.000000000)+.1808477568e-7*T(7,1024.000000*x-1.000000000)-.3 662442970e-4*T(0,1024.000000*x-1.000000000)" }}{PARA 6 "" 1 "" {TEXT -1 213 "minimax: to be evaluated as proc (x) options operator, arr ow; .33148529e-7+(-.5703323904e-2+(-52.56107700+(59810.97859+(-5774462 6.89+(.3378871607e11+(-.1060123116e14+.1366447017e16*x)*x)*x)*x)*x)*x) *x end proc" }}{PARA 6 "" 1 "" {TEXT -1 36 "numapprox/remez: critica l points =" }}{PARA 12 "" 1 "" {XPPMATH 20 "6+$\"3e******ztht')!#O$\"3 '4-T/%\\9Xo!#A$\"3mS$G'))R%)yC!#@$\"3<'QN)pQ=]aF+$\"3.@_Y*>>B=*F+$\"3# RIld9LjI\"!#?$\"3*f1Xw*ycV;F2$\"3PbSoI@As=F2$\"3+++++]7`>F2" }}{PARA 6 "" 1 "" {TEXT -1 46 "solve/linear/integer/sparse: # equations 9 " }}{PARA 6 "" 1 "" {TEXT -1 231 "solve/linear/integer/sparse: p[4], 9364032305000*p[0]+8588273375000*p[1]+6389531365000*p[2]+313211380700 0*p[3]-644260793500*p[4]-4313888418500*p[5]-7268751855000*p[6]-9019262 520000*p[7]-5000000000000000*e+758339201, -644260793500" }}{PARA 6 "" 1 "" {TEXT -1 46 "solve/linear/integer/sparse: # equations 8" }} {PARA 6 "" 1 "" {TEXT -1 310 "solve/linear/integer/sparse: p[3], -39 852618784353435956250*p[0]-30453552470038604008750*p[1]-11890598573873 005000000*p[2]-771271623082576422500*p[3]+3109965363008006892500*p[5]+ 17759974283434877255000*p[6]+35270467994453945075000*p[7]+237142949437 50000000000000*e-2871989595437299509, -771271623082576422500" }}{PARA 6 "" 1 "" {TEXT -1 46 "solve/linear/integer/sparse: # equations 7 " }}{PARA 6 "" 1 "" {TEXT -1 365 "solve/linear/integer/sparse: p[5], -108246780656447782877771046930000*p[0]-81790651598785636282507268670 000*p[1]-29930168397274615360835194180000*p[2]+67581517038170934086920 89380000*p[5]+46973655943533768365160792100000*p[6]+960830170704099976 27772571820000*p[7]+65163721532386804355625000000000000*e-774663935520 5662722530787813, 6758151703817093408692089380000" }}{PARA 6 "" 1 "" {TEXT -1 46 "solve/linear/integer/sparse: # equations 6" }}{PARA 6 "" 1 "" {TEXT -1 405 "solve/linear/integer/sparse: p[2], 855941070 634206741462727057123876983650000*p[0]+4918388946423536960538259284919 88290250000*p[1]+43439734810308574351391786052097025350000*p[2]-143667 328881296009445115279192557633050000*p[6]-6544115290658152407935256724 04769376155000*p[7]-643295692780789082746458712271875000000000000*e+53 236377847357333174446387735506560117, 43439734810308574351391786052097 025350000" }}{PARA 6 "" 1 "" {TEXT -1 46 "solve/linear/integer/sparse: # equations 5" }}{PARA 6 "" 1 "" {TEXT -1 427 "solve/linear/integ er/sparse: p[6], -20771063321375427844364609476401613513000120319500 00*p[0]-1492124314962609454635806821758308950768992624210000*p[1]+3165 54921461760259370551308904340524606512237520000*p[6]+19097905414030795 33996454880764776353771152264450000*p[7]-83948905110680793692401576655 1323449303125000000000000*e-141657647885324057267987296878025616360243 660521, 316554921461760259370551308904340524606512237520000" }}{PARA 6 "" 1 "" {TEXT -1 46 "solve/linear/integer/sparse: # equations 4 " }}{PARA 6 "" 1 "" {TEXT -1 439 "solve/linear/integer/sparse: p[7], 1107252900583919958685640493310974042045362791688385288998850000*p[0] -668062593854892481055754592530667537471278551484639948795190000*p[1]+ 386785071446781565521804585219504698672228494624262782072170000*p[7]-8 960950365111832541306941338252628146472947541058853125000000000000*e+1 1170378829985122939810113327384365820914549723135548018347, 3867850714 46781565521804585219504698672228494624262782072170000" }}{PARA 6 "" 1 "" {TEXT -1 46 "solve/linear/integer/sparse: # equations 3" }} {PARA 6 "" 1 "" {TEXT -1 418 "solve/linear/integer/sparse: p[1], 508 9877080119340820185055689806282233594113578303331146378906963113155000 *p[0]-1684381981254301457875361831505261684623647812277043211886270104 28621500*p[1]-21764632599500914756508905498791201621587707544790757051 065730312500000000000*e+1789649522460186540516450504160969157961948633 97206244946065538940191, -16843819812543014578753618315052616846236478 1227704321188627010428621500" }}{PARA 6 "" 1 "" {TEXT -1 46 "solve/lin ear/integer/sparse: # equations 2" }}{PARA 6 "" 1 "" {TEXT -1 402 "solve/linear/integer/sparse: p[0], -9559291097563304602757836885427 001435258475493283985494897555322872213416173115424100000*p[0]+3837504 5423572314128524334717375774696727360087622461242385814983591309995175 000000000000000*e-3500216191836878166602153421342146859930263164231825 64971270363677505171300729826459, -95592910975633046027578368854270014 35258475493283985494897555322872213416173115424100000" }}{PARA 6 "" 1 "" {TEXT -1 46 "solve/linear/integer/sparse: # equations 1" }} {PARA 6 "" 1 "" {TEXT -1 428 "solve/linear/integer/sparse: e, 477964 5548781831151307262651477512597784892747720615298359368680495340637867 23092364942120872601902984375000000000000000000000000000000000*e+62401 1993959977321119098783992030078598284634081525182986890834316903475079 83228896288011421437811619208882118801, 477964554878183115130726265147 7512597784892747720615298359368680495340637867230923649421208726019029 84375000000000000000000000000000000000" }}{PARA 6 "" 1 "" {TEXT -1 55 "solve/linear/integer/sparse: backsubstitution at: 9" }}{PARA 6 " " 1 "" {TEXT -1 55 "solve/linear/integer/sparse: backsubstitution at : 8" }}{PARA 6 "" 1 "" {TEXT -1 55 "solve/linear/integer/sparse: b acksubstitution at: 7" }}{PARA 6 "" 1 "" {TEXT -1 55 "solve/linear/i nteger/sparse: backsubstitution at: 6" }}{PARA 6 "" 1 "" {TEXT -1 55 "solve/linear/integer/sparse: backsubstitution at: 5" }}{PARA 6 "" 1 "" {TEXT -1 55 "solve/linear/integer/sparse: backsubstitution at: 4" }}{PARA 6 "" 1 "" {TEXT -1 55 "solve/linear/integer/sparse: \+ backsubstitution at: 3" }}{PARA 6 "" 1 "" {TEXT -1 55 "solve/linea r/integer/sparse: backsubstitution at: 2" }}{PARA 6 "" 1 "" {TEXT -1 55 "solve/linear/integer/sparse: backsubstitution at: 1" }} {PARA 8 "" 1 "" {TEXT -1 95 "Error, (in numapprox/remez) error curve f ails to oscillate sufficiently; try different degrees\n" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "err;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#$\"[p/i0B(Q[i)=)GC@%HQnez=eK\\iDcH&Q)[6S'o\"GM@M#>,*!#!*" }}} {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 17 "log(err)/log(2.);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#$![pFk+#\\&Q;T'34(*)3JXa#H#o8C<)fg$pxl/Bh,s5 %*)RPpL$!#y" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 494 "IEEEdouble: =proc(x) local logabsx, exposant, mantisse; Digits:=200;\n logabsx:=ev alf(log(abs(x))/log(2.));\n if logabsx>=0 then exposant:=trunc(logabsx )\n elif trunc(logabsx)=logabsx then exposant:=logabsx\n else exposant :=trunc(logabsx)-1\n fi;\n if exposant>1023 then mantisse:=infinity\n \+ elif exposant<-1022 then mantisse:=0\n else mantisse:=round(2^(53)*abs (x)/2^exposant)/2^53 fi;\n if x<0 then mantisse:=-mantisse fi; Digits \+ := 53;\n mantisse*2^exposant, convert(mantisse*2.0^exposant,binary);\n end:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 115 "IEEEdouble(-.16666 6666666666666666666666666666666570728027679949072934046248414507329978 4809421763093213085142506);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$#!2B8K1 !*f4?\"\"2Oz#z.%fd?($!V,,,,,,,,,,,,,,,,,,,,,,,,,,\"!#b" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 116 "IEEEdouble(.0083333333333333333333 3333333333293535775352461386501467809924109297973065521102540955580966 4820757002);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$#\"1H&GDgRQ![\"3)[BMI_ 2Yw&$\"V,+,+,+,+,+,+,+,+,+,+,+,+,+\"!#f" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 118 "IEEEdouble(-.000198412698412698412698412697848407150 0102994430958002095767915251033119832282919846858109422973369088);" }} {PARA 11 "" 1 "" {XPPMATH 20 "6$#!1lJfo#o+m$\"5;;b4P2WnW=$!V55,+++55,+ ++55,+++55,+++55\"!#l" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 117 "I EEEdouble(.27557319223985890652553449821914437635565887942832089804138 68785158205567199030755762754173388216971e-5);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$#\"2J!4h1wN,8\"7'p8_kpG[mBs%$\"V6+6+6,+65,,,,,556+56,6, +6,\"!#r" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 118 "IEEEdouble(-.2 5052108385441718628267968185060361058187418601779311173653356130439297 34624389798494799669355006052e-7);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$ #!2FBZJ.2V^\"\"9)3`te9t!)4HY/'$!V6+56+,+,,,666,5,,,+,5,5655\"!#y" }}} {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 117 "IEEEdouble(.160590438368183 6992419321448831031833728375335512795391953420275779428392795045701212 007426922166072e-9);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$#\"2hy*)[L3DC \"\";k_>\"=niLbCDrt($\"V5+5++55,+5556+,+5,+,5+,+5,\"!#&)" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 119 "IEEEdouble(-.764716369021640852619 8866421782331543663165714484615603128534238649724331194813683812555192 634978651e-12);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$#!2v6a!>on9:\">%e() fQ)R%3m&G1/2)>$!V65655,++6665+,566+666,5655\"!#$*" }}}{EXCHG {PARA 0 " > " 0 "" {MPLTEXT 1 0 118 "IEEEdouble(.2811170463538626082557703975224 235561517689078040072401240900544359120139060989936327261501689030452e -14);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$#\"2PWz,xKaU\"\"@/:#G\"o)fg " 0 "" {MPLTEXT 1 0 360 "infnorm((sin(x)-(x-12009599006321323/7205759403 7927936*x^3+4803839602528529/576460752303423488*x^5-3660068268593165/1 8446744073709551616*x^7+13013576066109031/4722366482869645213696*x^9-1 5143070331472327/604462909807314587353088*x^11+12425083348897861/77371 252455336267181195264*x^13-15146768190541175/1980704062856608439838598 7584*x^15))/sin(x),x=0..2^(-40));" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#$ \"_qD[zajSSyo$3'*ooI%[jjn3qZ87zY2?>A9\\Hq#)4A:tN$[r'He1!zk#Q!$T\"" }}} {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 15 "log(%)/log(2.);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#$!_q9MZ\\3&4dD^L0@'Rs=hQ$oi2TMa:wppZA4xo=_rQPX \"=c6s+D'\\eP\"!#(*" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 383 "x-1 2009599006321323/72057594037927936.*x^3+4803839602528529/5764607523034 23488.*x^5-3660068268593165/18446744073709551616.*x^7+1301357606610903 1/4722366482869645213696.*x^9-15143070331472327/6044629098073145873530 88.*x^11+12425083348897861/77371252455336267181195264.*x^13-1514676819 0541175/19807040628566084398385987584.*x^15+14254327701794437/50706024 00912917605986812821504.*x^17;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}{PARA 12 "" 1 "" {XPPMATH 20 "6#,4%\"xG\"\"\"*&$\"_q++++++++++++++++ ++++++vozTy.&>8lY:g,^o!$.\"F%)F$ \"\"(F%F,*&$\"_q++++++++++++++++]PM-u3-(e*Gr7!=KM5RqqM^AoLR!*e)RA>tbF! $0\"F%)F$\"\"*F%F%*&$\"_q++++++++++++++vo/)*zpr#zw?&zWb_x![j9$)H:U&\\] p&=jWDE _DHD()z:oYA_t(QUxX,@[^)GsB-*4E'QNYq6\"G!$9\"F%)F$\"# " 0 "" {MPLTEXT 1 0 0 "" }}{PARA 12 "" 1 "" {XPPMATH 20 "6# >%\"RG,&$\"_q1D9&38K4jHGK)>J.^_\"zw&4-!e4V%*H5+:2%[yp7%)p7%)p7 %)p7%)>!$.\"F)*&,&$\"_qrp@)QtTvidvI!*>nb?e^yoQT!)*3KG%z)ecNwV9>#)\\Mb_ 1*e)RA>tbF!$0\"F)*&,&$!_q_g+b$p'*z%\\)z*QCYtHR/8cLlt6JzR&z7bLv$GP$=.J)[9K> C*p$=o$Q/fg\"!$4\"F)*&,&$!_q^'y\\j#>bD\"Qo8[>JVs\\'QU`GJg:Y[9d;jOaJBy@ k'))>E&3k@!pjrk(!$7\"F)*&$\"_q_/.*o,:EFj$**)41R,7fVa+4C,C2S!y!*o<:cNUA vRqdD3E'QNYq6\"G!$9\"F)%\"xGF)F)F)FLF)F)F)FLF)F)F)FLF)F)F)FLF)F)F)FLF) F)F)FLF)F)" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 60 "Q := minimax( sin(sqrt(x)), x=2^(-60)..2^(-7),[9,0], ,'err');" }}{PARA 12 "" 1 "" {XPPMATH 20 "6#>%\"QG,&$\"fpXXs_7;7PNF]63l6ewafQMv$R*)\\n(G\\JH+fWv<@P $>$Q\"=pUVyq\\Wn>d\"Q(o3`DW0*euozJ.I,Gr*GF(4Bc *******************************!$+\"F)*&,&$\"hp-xK6jYZl=3X.4(*G,5C9qa/ Q'Q\"=E7R'\\6.A'*)pjfw/ID)el7=!$?\"F)*&,&$!_qaM8C@)G\")G9&ffi#ys40#yB4 .'em:x()*yei*y=axCdpmmmmmmmmmmm\"F.F)*&,&$\"ipnCO*f)e=)>H#zZ->8JRO1`.H IyGE9+-0IPtQC^RR:C$*GviFcB!$:\"F)*&,&$\"_q%)z_sP'y]Wk.>S6X\"y(Q^z\\o3* QI%*\\Yb'[$=!pz:%oEKOVALLLLLLL$)!$-\"F)*&,&$\"ipx.0&p%[f&z7D=y\"))RqjC %f62^)f\">cpG\"pxe6m)))z?JVk:O5pgp'e\"He7a!)G0!yT)p7%)>!$.\"F)*&,&$\"jpiQh!=I.&R>)p/5 ;kcI!R8EO%HTY%)=z]t5f4ZgDaEY`0#)e1D " 0 "" {MPLTEXT 1 0 17 "log(err)/log(2.);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#$!_qQB%4(>x.5QQHemq'Q#G]\\OGY;]7TTD1`-#)H,kqeY1Eb;>>dR4 )y=\"!#(*" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 24 "IEEEdouble(eva lf(Pi/2));" }}{PARA 11 "" 1 "" {XPPMATH 20 "6$#\"2\")o0/bZ[T\"\"1#*4ua #*>2!*$\"V+5,+,65++,+,+,,,6566,+5+,5\"!#_" }}}{EXCHG {PARA 0 "> " 0 " " {MPLTEXT 1 0 63 "convert(evalf(Pi/2)-14148475504056881/9007199254740 992,binary);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#$!_q66+5,6566,655,6,,5 ,+66,+,5666+556556+6+6,5,6,5,,56!$a\"" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 35 "convert(2^1024/evalf(Pi/2),binary);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#$\"_q66,+,66,,,6,5++666,55+,,,++,+,56+,565,6++5,5665 +55\"$C*" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 10 "1024*2^53;" }} {PARA 11 "" 1 "" {XPPMATH 20 "6#\"43exao.sLA*" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 6 "2^113;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#\"D#>S% eE*41d_lpqr$f%Q5" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 55 "toto:= \+ proc(x) x-floor(x/evalf(Pi/2))*evalf(Pi/2); end;" }}{PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%%totoGR6#%\"xG6 \"F(F(,&9$\"\"\"*&-%&floorG6#*&F*F+-%&evalfG6#,$%#PiG#F+\"\"#!\"\"F+F1 F+F8F(F(F(" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 14 "toto(2^(200)) ;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#$\"H=uNB.#yOOMF]n(=WV()R*\\!#R" } }}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 14 "Digits := 150;" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%'DigitsG\"$]\"" }}}{EXCHG {PARA 0 "> " 0 " " {MPLTEXT 1 0 12 "toto(2^350);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#$\" ipX+7_uDNU\\;KHK'e,CG>cfZ/4;`E5r9L8(y?^nPMa%G&=?wf/!)!#%*" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 143 "P := convert(series(sin(sqrt(x))/( x^(3/2)-1/x), x=0, 25 ), polynom):\nR := minimax(P, x=2^(-60)..2^(-9), [7,0],((sqrt(x^3))/sin(sqrt(x))),'err');" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 99 "R := minimax(sin(sqrt(x))/(x^(3/2)-1/x), x=2^(-62)..2 ^(-9),[7,0],((sqrt(x^3))/sin(sqrt(x))),'err');" }}{PARA 12 "" 1 "" {XPPMATH 20 "6#>%\"RG,&$\"atlL2!H@$>\\yF@nbJ-*HRJowzrgS*\\%)*oh>z2<=DJ !36q!*>?s)=D'o#4P!\\,MN%p`$e?+2$zDDo2H6R::E`\"!$c\"\"\"\"*&,&$!`tW9&)p U-5XPZULM#p^b)oBAUpV,ARS!pIhVWK!o(\\b/bW*o-yd)f\\\\V7je(*QXyVpwgJ?@e)e R9%f9!>9v(!$^\"F)*&,&$!at\"o@NN'=Ef#p&Rr%Hf:dN'pX?H!Q)pInb2X<*p\"oZE`b 4p&[WQ$oko)fG$p!))3!R$[$feZeZl\"4?F)>f>(p;K=%!$[\"F)*&,&$\"atX7'Rxmz:daw')[-#fK)evYF\"3y$z>mgJ'fYsd(p$*R[2@oN?2Jrs#RC3?#>xR%z [0qoW$!$X\"F)*&,&$!at3;qX!fUn+^M#o;6hr*o.?sD`tHsXIBVf6))p.k=&)HxP>K%H5 WYQm_B)R$Q3xx%eT)=YraW/)y5g#\\#)=oE!$U\"F)*&,&$\"atE%fY%Q#eZ9Xl\\!pB&H 1A4[sxo!ppeTU?9p?_a`'o`'[rc->e(e3.7wzs!>1CPY4>=9&*f%*p5*zj%\\xoTF8!$R \"F)*&,&$!atG`%QQy.,wO:=g#oDi)e!*=ejM:%Q9!***o=&[5U'yvhWdc!*yNBrw.%H$G hLZma(4#pp\"z_x8HQ'eusT!Q4dn$!$P\"F)*&$\"at,N[qYjoyq9GRVDZu4i^Av\\W6c \"=TG>6 " 0 "" {MPLTEXT 1 0 4 "err;" }}{PARA 12 "" 1 "" {XPPMATH 20 "6#$ \"atK>>2*zpJ8?@=tY1zcg:>kR6cuLB$yyaUV$ouurNX1=\"3$p5(y\"Q\\(z0j%Q*)32W !*RhrwLlwqR4fSfm?Z\"!$h\"" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 17 "log(err)/log(2.);" }}{PARA 12 "" 1 "" {XPPMATH 20 "6#$!atxTE\"e6E: bv0hXMCcZjS\"\\(*p)RoN))e&*=po!=.*=Mups!==#z/L\">Dn&zNQR)p.cfy-%zJi-nO IDW+UH0$R!$[\"" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 19 "infnorm(( sin(x)-(x)" }}}}{MARK "0 0 0" 16 }{VIEWOPTS 1 1 0 1 1 1803 1 1 1 1 } {PAGENUMBERS 0 1 2 33 1 1 } interval-2.1.0/src/crlibm/scs_lib/multiplication_scs.c0000644000000000000000000001767413031036767021237 0ustar 00000000000000/** Functions for SCS multiplication operations @file multiplication_scs.c @author Defour David David.Defour@ens-lyon.fr @author Florent de Dinechin Florent.de.Dinechin@ens-lyon.fr This file is part of the SCS library. */ /* Copyright (C) 2002 David Defour and Florent de Dinechin This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include "scs.h" #include "scs_private.h" #if 0 /* used to help debugging */ void pr(char* s,double d) { db_number x; x.d=d; printf(s);printf(" "); printf("%8x%8x . 2^%d (%8f %8x %8x) \n", (x.i[HI]&0x000FFFFF)+0x00100000, x.i[LO], (x.i[HI]>>20)-1023, x.d, x.i[HI], x.i[LO]); } #endif /* Compute the carry of r1, remove it from r1, and add it to r0 */ #define SCS_CARRY_PROPAGATE(r1,r0,tmp) \ {tmp = r1>>SCS_NB_BITS; r0 += tmp; r1 -= (tmp<0; i--) SCS_CARRY_PROPAGATE(RES[i],RES[i-1],tmp) SCS_CARRY_PROPAGATE(RES[0],val,tmp) /* Store the result */ if(val != 0){ /* shift all the digits ! */ R_HW[0] = val; for(i=1; i0; i--) SCS_CARRY_PROPAGATE(RES[i],RES[i-1],tmp) SCS_CARRY_PROPAGATE(RES[0],val,tmp) /* Store the result */ if(val != 0){ /* shift all the digits ! */ R_HW[0] = val; for(i=1; i=0; i--){ val += vald * X_HW[i]; SCS_CARRY_PROPAGATE(val, rr, tmp) X_HW[i] = val; val = rr; rr = 0; } if(val != 0){ /* shift all the digits ! */ for(i=(SCS_NB_WORDS-1); i>0; i--) X_HW[i] = X_HW[i-1]; X_HW[0] = (unsigned int)val; X_IND += 1; } return; } interval-2.1.0/src/crlibm/scs_lib/poly_fct.c0000644000000000000000000000616513031036767017142 0ustar 00000000000000/* * Author : Defour David * Contact : David.Defour@ens-lyon.fr * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include "scs.h" #include "scs_private.h" /* * result = z + (x * y) */ /* z->sign = X_SGN . Y_SGN */ void scs_fma(scs_ptr result, scs_ptr x, scs_ptr y, scs_ptr z){ uint64_t RES[2*SCS_NB_WORDS]; uint64_t val, tmp; int i, j, ind, Diff; ind = X_IND + Y_IND; for(i=0; i<=SCS_NB_WORDS+1; i++) RES[i]=0; for(i=0 ; isign == (X_SGN * Y_SGN)){ Diff = z->index - ind; if (Diff >= 0){ for(i=(SCS_NB_WORDS-1), j=(SCS_NB_WORDS-Diff); j>=0; i--, j--) RES[i] = z->h_word[i] + RES[j]; for( ; i>=0; i--) RES[i] = z->h_word[i]; }else { for(i=(SCS_NB_WORDS+Diff), j=(SCS_NB_WORDS-1); i>=0; i--, j--) RES[j] = z->h_word[i] + RES[j]; } /* Carry propagate */ RES[SCS_NB_WORDS-1] += (RES[SCS_NB_WORDS]>>SCS_NB_BITS); for(i=(SCS_NB_WORDS-1); i>0; i--) {tmp = RES[i]>>SCS_NB_BITS; RES[i-1] += tmp; RES[i] -= (tmp<> SCS_NB_BITS; R_IND = X_IND + Y_IND; /* Store the result */ if(val != 0){ /* shift all the digits ! */ R_HW[0] = (unsigned int)val; R_HW[1] = (unsigned int)(RES[0] - (val<exception.d + (X_EXP * Y_EXP)) - 1; R_SGN = X_SGN * Y_SGN; }else { /* we have to do a sub */ /* Carry propagate */ RES[SCS_NB_WORDS-1] += (RES[SCS_NB_WORDS]>>SCS_NB_BITS); for(i=(SCS_NB_WORDS-1); i>0; i--) {tmp = RES[i]>>SCS_NB_BITS; RES[i-1] += tmp; RES[i] -= (tmp<> SCS_NB_BITS; R_IND = X_IND + Y_IND; /* Store the result */ if(val != 0){ /* shift all the digits ! */ R_HW[0] = (unsigned int)val; R_HW[1] = (unsigned int)(RES[0] - (val< #include "scs.h" #include "scs_private.h" /* * used by the next function to write * bit of the integer in the right order .... */ static void print_order(unsigned int x, int nb, int b){ if (nb<=0) return; print_order(x/b, nb-1, b); printf("%u",x%b); return; } /* * print nb digits of the chain x in base "b" * b must be between 1 and 10 */ static void print_integer(unsigned int x, int b, int nb){ if ((b < 2)||(b>16)){ fprintf(stderr," ERROR: You musn't print number with a base larger than 10 or less than 2 \n"); return; } print_order(x, nb, b); return; } /* * Convert a double precision number in it scs multiprecision * representation * * Rem. : We haven't tested all special cases yet. */ /* */ void scs_get_std( scs_ptr x){ int i; db_number d; scs_get_d(&d.d, x); printf("Exception : %e \n", X_EXP); printf("Index= %d \n Sign= %d \n Double value= %.30e \n Hex mantissa= %x %x\n", X_IND, X_SGN, d.d, d.i[HI], d.i[LO]); for(i=0;i #include "scs.h" #include "scs_private.h" /* * Return 'sizeof(int)' random bits */ int rand_val(void){ int val; int i; val = (rand() & 0x000000ff); for(i=0; i<(sizeof(int)); i++){ val = val << 8; val += (rand() & 0x000000ff ); /* we keep only 8 bits */ } return val; } /* * Put into 'result' a scs random number with the index field set * with a value between -expo_max and +expo_max. * * Rem. : * 1) If you want an scs number belonging to double precision floating * point number you must call scs_rand with an expo_max less than 39. * 2) expo_max must be less than RAND_MAX that is usually set a * value greater than 32767 */ void scs_rand(scs_ptr result, int expo_max){ int i; R_EXP = 1; R_IND = (rand() % (2*expo_max)) - expo_max; R_SGN = ((2*rand()- RAND_MAX) > 0) ? (-1) : (1); for(i=0; i #endif /* 64 bit arithmetic may be standardised, but people still do want they want */ #ifdef HAVE_INTTYPES_H #define ULL(bits) 0x##bits##uLL #elif defined(WIN32) /* TODO insert Windows garbage there */ /* Default, hoping it works, hopefully less and less relevant */ #else typedef long long int64_t; typedef unsigned long long uint64_t; #define ULL(bits) 0x##bits##uLL #endif #ifndef SCS_DEF_INT64 #define SCS_DEF_INT64 #ifdef SCS_TYPEOS_HPUX #ifndef __LP64__ /* To solve the problem with 64 bits integer */ typedef long long int64_t; typedef unsigned long long uint64_t; #define ULL(bits) 0x##bits##uLL #endif #endif #endif #ifdef HAVE_GMP_H #include #endif #ifdef HAVE_MPFR_H #include #endif #endif /* DOXYGEN_SHOULD_SKIP_THIS */ /** @internal An union to cast floats into doubles or the other way round. For internal purpose only */ typedef union { int32_t i[2]; /* Signed (may be useful) */ int64_t l; /* Signed (may be useful) */ double d; } db_number; /* ****************************************************************** */ /**@name SCS data-types */ /**@{*/ /** @struct scs The SCS data type. An SCS number is a a floating-point number in base 2^32. - Its mantissa is formed of SCS_NB_WORDS digits (currently 32 bits by default) - Its exponent is a 32-bit integer - It also has a sign field, and an exception field used to store and propagate IEEE-754 exceptions. The real number represented by a scs structure is equal to: @f$ \displaystyle \sum_{i=0}^{\mathtt{SCS\_NB\_WORDS}} 2^{(\mathtt{index} -i)\mathtt{SCS\_NB\_BITS}} \times \mathtt{h\_word}[i] @f$ */ /* (verbatim-mode formula for the above eqation:) the number represented by a SCS structure is : i= 27 together they include the 53+ guard bits to decide rounding */ /* test for s/qNan, +/- Inf, +/- 0, placed here for obscure performance reasons */ if (X_EXP != 1){ *result = X_EXP; return; } /* take the exponent of nb.d (will be in [0:SCS_NB_BITS])*/ expo = ((nb.i[HI] & 0x7ff00000)>>20) - 1023; /* compute the exponent of the result */ expofinal = expo + SCS_NB_BITS*X_IND; /* Is the SCS number not too large for the IEEE exponent range ? */ if (expofinal > 1023) { /* return an infinity */ res = SCS_RADIX_RNG_DOUBLE*SCS_RADIX_RNG_DOUBLE; } /* Is our SCS number a denormal ? */ else if (expofinal >= -1022){ /* x is in the normal range */ shift=expo+2*SCS_NB_BITS-53; roundbits=lowpart<<(64-shift); /* align the rest of the mantissa to nb : shift by (2*SCS_NB_BITS)-53+expo */ lowpart = lowpart >> shift; /* Look at the last bit to decide rounding */ if (lowpart & ULL(0000000000000001)){ /* Test for the round to even case */ if(roundbits==0) { int i; for (i=3; i> 1; nb.l = nb.l | lowpart; /* Finish to fill the mantissa */ res = nb.d + rndcorr.d; /* rounded to nearest */ /* now compute the exponent from the index : we need to multiply res by 2^(X_IND*SCS_NB_BITS) First check this number won't be a denormal itself */ if((X_IND)*SCS_NB_BITS +1023 > 0) { /* build the double 2^(X_IND*SCS_NB_BITS) */ nb.i[HI] = ((X_IND)*SCS_NB_BITS +1023) << 20; nb.i[LO] = 0; res *= nb.d; /* exact multiplication */ } else { /*offset the previous computation by 2^(2*SCS_NB_BITS) */ /* build the double 2^(X_IND*SCS_NB_BITS) */ nb.i[HI] = ((X_IND)*SCS_NB_BITS +1023 + 2*SCS_NB_BITS) << 20; nb.i[LO] = 0; res *= SCS_RADIX_MTWO_DOUBLE; /* exact multiplication */ res *= nb.d; /* exact multiplication */ } } else { /* the final number is a denormal with 52-(expfinal+1022) significant bits. */ if (expofinal < -1022 - 53 ) { res = 0.0; } else { /* align the rest of the mantissa to nb */ lowpart = lowpart >> (expo+(2*SCS_NB_BITS)-52); /* Finish to fill the mantissa */ nb.l = nb.l | lowpart; /* this is still a normal number. Now remove its exponent and add back the implicit one */ nb.l = (nb.l & ULL(000FFFFFFFFFFFFF)) | ULL(0010000000000000); /* keep only the significant bits */ nb.l = nb.l >> (-1023 - expofinal); /* Look at the last bit to decide rounding */ if (nb.i[LO] & 0x00000001){ /* need to add an half-ulp */ rndcorr.l = 1; /* this is a full ulp but we multiply by 0.5 in the end */ }else{ /* need to add nothing*/ rndcorr.d = 0.0; } res = 0.5*(nb.d + rndcorr.d); /* rounded to nearest */ /* the exponent field is already set to zero so that's all */ } } /* sign management */ if (X_SGN < 0) *result = - res; else *result = res; } /* All the directed roundings boil down to the same computation, which is: first build the truncated mantissa. if the SCS number is exactly a double precision number, return that. Otherwise, either return the truncated mantissa, or return this mantissa plus an ulp, rounded to the nearest. Plus handle the infinities and denormals. */ static void get_d_directed(double *result, scs_ptr x, int rndMantissaUp){ db_number nb, rndcorr; uint64_t lowpart, t1; int expo,expofinal,i, not_null; double res; /* convert the MSB digit into a double, and store it in nb.d */ nb.d = (double)X_HW[0]; /* place the two next digits in lowpart */ t1 = X_HW[1]; lowpart = (t1 << SCS_NB_BITS) + X_HW[2]; /* test for s/qNan, +/- Inf, +/- 0, placed here for obscure performance reasons */ if (X_EXP != 1){ *result = X_EXP; return; } /* take the exponent of nb.d (will be in [0:SCS_NB_BITS])*/ expo = ((nb.i[HI] & 0x7ff00000)>>20) - 1023; not_null = ((lowpart << (64+52 - 2*SCS_NB_BITS - expo)) != 0 ); /* Test if we are not on an exact double precision number */ for (i=3; i 1023) { if (rndMantissaUp) /* return an infinity */ res = SCS_RADIX_RNG_DOUBLE*SCS_RADIX_RNG_DOUBLE; else /* infinity, rounded down, is SCS_MAX_DOUBLE */ res = SCS_MAX_DOUBLE; } /* Is our SCS number a denormal ? */ else if (expofinal >= -1022){ /* x is in the normal range */ /* align the rest of the mantissa to nb : shift by (2*SCS_NB_BITS)-53-exp */ lowpart = lowpart >> (expo+(2*SCS_NB_BITS)-52); /* Finish to fill the mantissa */ nb.l = nb.l | lowpart; if (rndMantissaUp && (not_null)){ rndcorr.i[LO] = 0; rndcorr.i[HI] = (expo-52+1023)<<20; /* 2^(exp-52) */ } else { rndcorr.d = 0.0; } res = nb.d + rndcorr.d; /* rounded to nearest */ /* now compute the exponent from the index : we need to multiply res by 2^(X_IND*SCS_NB_BITS) First check this number won't be a denormal itself */ if((X_IND)*SCS_NB_BITS +1023 > 0) { /* build the double 2^(X_IND*SCS_NB_BITS) */ nb.i[HI] = ((X_IND)*SCS_NB_BITS +1023) << 20; nb.i[LO] = 0; res *= nb.d; /* exact multiplication */ } else { /*offset the previous computation by 2^(2*SCS_NB_BITS) */ /* build the double 2^(X_IND*SCS_NB_BITS) */ nb.i[HI] = ((X_IND)*SCS_NB_BITS +1023 + 2*SCS_NB_BITS) << 20; nb.i[LO] = 0; res *= SCS_RADIX_MTWO_DOUBLE; /* exact multiplication */ res *= nb.d; /* exact multiplication */ } } else { /* the final number is a denormal with 52-(expfinal+1022) significant bits. */ if (expofinal < -1022 - 53 ) { if(rndMantissaUp) res = SCS_MIN_DOUBLE; else res = 0.0; } else { /* align the rest of the mantissa to nb */ lowpart = lowpart >> (expo+(2*SCS_NB_BITS)-52); /* Finish to fill the mantissa */ nb.l = nb.l | lowpart; /* this is still a normal number. Now remove its exponent and add back the implicit one */ nb.l = (nb.l & ULL(000FFFFFFFFFFFFF)) | ULL(0010000000000000); if (rndMantissaUp && (not_null)){ nb.l = nb.l >> (-1022 - expofinal); nb.l = nb.l +1; /* works even if we move back into the normals*/ } else /* keep only the significant bits */ nb.l = nb.l >> (-1022 - expofinal); res = nb.d; /* the exponent field is already set to zero so that's all */ } } /* sign management */ if (X_SGN < 0) *result = - res; else *result = res; } #if 0 void get_d_directed0(double *result, scs_ptr x,int rndMantissaUp) { uint64_t lowpart, t1; db_number nb, rndcorr; int i, expo, not_null; double res; /* convert the MSB digit into a double, and store it in nb.d */ nb.d = (double)X_HW[0]; /* place the two next digits in lowpart */ t1 = X_HW[1]; lowpart = (t1 << SCS_NB_BITS) + X_HW[2]; /* s/qNan, +/- Inf, +/- 0 */ if (X_EXP != 1){ *result = X_EXP; return; } /* take the exponent */ expo = ((nb.i[HI] & 0x7ff00000)>>20) - 1023; not_null = ((lowpart << (64+52 - 2*SCS_NB_BITS - expo)) != 0 ); /* align the rest of the mantissa */ lowpart = lowpart >> (expo + 2*SCS_NB_BITS - 52); /* Finish to fill the mantissa */ nb.l = nb.l | lowpart; /* Test if we are not on an exact double precision number */ for (i=3; i -SCS_MAX_RANGE)){ /* x is comfortably in the double-precision range */ /* build the double 2^(X_IND*SCS_NB_BITS) */ nb.i[HI] = ((X_IND)*SCS_NB_BITS +1023) << 20; nb.i[LO] = 0; res *= nb.d; }else { /* x may end up being a denormal or overflow */ i = X_IND; nb.d = 0; if (X_IND > 0){ /* one of the following computations may lead to an overflow */ res *=SCS_RADIX_RNG_DOUBLE; /* 2^(SCS_NB_BITS.SCS_MAX_RANGE) */ i -= SCS_MAX_RANGE; while((i-->0)&&(res <= SCS_MAX_DOUBLE)) { /* second test means: This loop stops on overflow */ res *= SCS_RADIX_ONE_DOUBLE; } }else { /* One of the computations may lead to denormal/underflow */ res *=SCS_RADIX_MRNG_DOUBLE; /* 2^-(SCS_NB_BITS.SCS_MAX_RANGE)*/ i += SCS_MAX_RANGE; while((i++<0)&&(res != 0)) { res *=SCS_RADIX_MONE_DOUBLE; } } } /* sign management */ if (X_SGN < 0) *result = - res; else *result = res; } #endif /* * Rounded toward -Inf */ void scs_get_d_minf(double *result, scs_ptr x){ /* round up the mantissa if negative */ get_d_directed(result, x, (int)(X_SGN<0)); } /* * Rounded toward +Inf */ void scs_get_d_pinf(double *result, scs_ptr x){ /* round up the mantissa if positive */ get_d_directed(result, x, (int)(X_SGN>=0)); } /* * Rounded toward zero */ void scs_get_d_zero(double *result, scs_ptr x){ /* never round up the mantissa */ get_d_directed(result, x, 0); } interval-2.1.0/src/crlibm/scs_lib/scs2mpf.c0000644000000000000000000000307413031036767016674 0ustar 00000000000000/* * Author : Defour David * Contact : David.Defour@ens-lyon.fr * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include "scs.h" #include "scs_private.h" /* Compile only if gmp is present */ #ifdef HAVE_GMP_H /* * Convert a scs number into a MPF number (GMP) */ void scs_get_mpf(scs_ptr x, mpf_t rop){ mpf_t mp1; long int expo; int i; mpf_set_ui(rop, 0); /* mantissa */ for (i=0; ih_word #define R_SGN result->sign #define R_IND result->index #define R_EXP result->exception.d #define X_HW x->h_word #define X_SGN x->sign #define X_IND x->index #define X_EXP x->exception.d #define Y_HW y->h_word #define Y_SGN y->sign #define Y_IND y->index #define Y_EXP y->exception.d #define Z_HW z->h_word #define Z_SGN z->sign #define Z_IND z->index #define Z_EXP z->exception.d #define W_HW w->h_word #define W_SGN w->sign #define W_IND w->index #define W_EXP w->exception.d /* A few additional defines for the case when we use floating-point multiplier (OBSOLETE, NEVER USED ANYMORE but who knows, some day) */ #ifdef SCS_USE_FLT_MULT /* There is a "53" below, which means that these constants won't do what we expect from them on x86 because of the double extended precision. We could put more ifdefs, but why care, nobody wants to use the FP muls on the x86. */ #ifdef WORDS_BIGENDIAN static const db_number scs_flt_trunc_cst = {{ ((1023+SCS_NB_BITS-1)<<20) , 0x00000000 }}; static const db_number scs_flt_shift_cst = {{ ((1023+SCS_NB_BITS+53)<<20),0x00000000}}; #else static const db_number scs_flt_trunc_cst = {{ 0x00000000, ((1023+SCS_NB_BITS-1)<<20) }}; static const db_number scs_flt_shift_cst = {{ 0x00000000 ,((1023+SCS_NB_BITS+53)<<20)}}; #endif /*WORDS_BIGENDIAN*/ #define SCS_FLT_TRUNC_CST scs_flt_trunc_cst.d /* 2^(SCS_NB_BITS+53-1) */ #define SCS_FLT_SHIFT_CST scs_flt_shift_cst.d /* 2^(SCS_NB_BITS)(1+1/2) */ #endif /* SCS_USE_FLTMULT */ #endif /* SCS_PRIVATE_H */ interval-2.1.0/src/crlibm/scs_lib/tests/Makefile.am0000644000000000000000000000047113031036767020347 0ustar 00000000000000## Process this file with automake to produce Makefile.in bin_PROGRAMS = scs_test_timing scs_test_accuracy LDADD= $(top_builddir)/libscs.a INCLUDES=-I$(top_srcdir) ../libscs.a: cd $(top_srcdir); make libscs.a scs_test_timing_SOURCES = test_timing.c tbx_timing.h scs_test_accuracy_SOURCES = test_accuracy.cinterval-2.1.0/src/crlibm/scs_lib/tests/log.h0000644000000000000000000003341513031036767017251 0ustar 00000000000000/* * Constant to compute the natural logarithm. */ #ifdef WORDS_BIGENDIAN static const scs_db_number norm_number = {{0x3FD60000, 0x00000000}}; /* 11*2^(-5) */ #else static const scs_db_number norm_number = {{0x00000000, 0x3FD60000}}; /* 11*2^(-5) */ #endif #ifdef SCS_TYPECPU_SPARC static const scs sc_ln2={{0x0162e42f, 0x01df473d, 0x01cd5e4f, 0x003b3980, 0x007e5ed5, 0x01d03cd0, 0x0193394c, 0x00b62d8a}, DB_ONE, -1, 1 }; static const scs table_ti[13]= /* ~-3.746934e-01 */ {{{0x00bfd7d1, 0x01bd8151, 0x017dbcdf, 0x016d4cb1, 0x0044bcca, 0x01f38987, 0x013333aa, 0x007cf0d4}, DB_ONE, -1, -1 } , /* ~-2.876821e-01 */ {{0x00934b10, 0x01134db9, 0x004f077d, 0x00dd9db0, 0x00554e15, 0x0030f490, 0x01b996a8, 0x00de6ad6}, DB_ONE, -1, -1 } , /* ~-2.076394e-01 */ {{0x006a4fb4, 0x01e456cf, 0x0036f2be, 0x014ef4b9, 0x00037337, 0x0077188a, 0x01f1e9e8, 0x016e7b9f}, DB_ONE, -1, -1 } , /* ~-1.335314e-01 */ {{0x00445e3a, 0x00113f23, 0x01bde338, 0x01683f8e, 0x00b7a078, 0x01dda8fe, 0x01878496, 0x01e28def}, DB_ONE, -1, -1 } , /* ~-6.453852e-02 */ {{0x00210b31, 0x00d678e8, 0x0034451f, 0x01d9bf50, 0x0066e582, 0x00bf1b16, 0x007f8dd1, 0x011cb965}, DB_ONE, -1, -1 } , /* ~6.062462e-02 */ {{0x001f0a30, 0x018022c5, 0x009985f3, 0x004b8b77, 0x00b32f13, 0x0034d1d3, 0x0099bada, 0x01259671}, DB_ONE, -1, 1 } , /* ~1.177830e-01 */ {{0x003c4e0e, 0x01b8abcb, 0x012f4f54, 0x007ffe1f, 0x01d3c2ab, 0x016e53af, 0x00200bfb, 0x00f957dd}, DB_ONE, -1, 1 } , /* ~1.718503e-01 */ {{0x0057fcc1, 0x01853c9e, 0x013c873e, 0x004140e4, 0x0048eebf, 0x0135571c, 0x01aafef9, 0x01e631c0}, DB_ONE, -1, 1 } , /* ~2.231436e-01 */ {{0x00723fdf, 0x003cd4d1, 0x001ac25d, 0x0103de5f, 0x01ee6892, 0x0171d97a, 0x013a08d6, 0x01c1b170}, DB_ONE, -1, 1 } , /* ~2.719337e-01 */ {{0x008b3ae5, 0x00baba60, 0x01c07398, 0x01f55c41, 0x01717047, 0x01c19f41, 0x00521e0c, 0x01f534c3}, DB_ONE, -1, 1 } , /* ~3.184537e-01 */ {{0x00a30c5e, 0x0021c5ec, 0x004fa16f, 0x00cdeccf, 0x0039a20a, 0x01dcb349, 0x006005a2, 0x00393cb5}, DB_ONE, -1, 1 } , /* ~3.629055e-01 */ {{0x00b9cebf, 0x016bbd00, 0x00d39c49, 0x0114feb4, 0x01f7bcb5, 0x00b77843, 0x00e752cb, 0x0157bbbc}, DB_ONE, -1, 1 } }; static const scs table_inv_wi[13]= /* ~1.454545e+00 */ {{{0x00000001, 0x00e8ba2e, 0x011745d1, 0x00e8ba2e, 0x011745d1, 0x00e8ba2e, 0x011745d1, 0x00e8ba2e}, DB_ONE, 0, 1 } , /* ~1.333333e+00 */ {{0x00000001, 0x00aaaaaa, 0x01555555, 0x00aaaaaa, 0x01555555, 0x00aaaaaa, 0x01555555, 0x00aaaaaa}, DB_ONE, 0, 1 } , /* ~1.230769e+00 */ {{0x00000001, 0x00762762, 0x00ec4ec4, 0x01d89d89, 0x01b13b13, 0x01627627, 0x00c4ec4e, 0x0189d89d}, DB_ONE, 0, 1 } , /* ~1.142857e+00 */ {{0x00000001, 0x00492492, 0x00924924, 0x01249249, 0x00492492, 0x00924924, 0x01249249, 0x00492492}, DB_ONE, 0, 1 } , /* ~1.066667e+00 */ {{0x00000001, 0x00222222, 0x00444444, 0x00888888, 0x01111111, 0x00222222, 0x00444444, 0x00888888}, DB_ONE, 0, 1 } , /* ~1.000000e+00 */ {{0x00000001, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 } , /* ~9.411765e-01 */ {{0x01e1e1e1, 0x01c3c3c3, 0x01878787, 0x010f0f0f, 0x001e1e1e, 0x003c3c3c, 0x00787878, 0x00f0f0f0}, DB_ONE, -1, 1 } , /* ~8.888889e-01 */ {{0x01c71c71, 0x018e38e3, 0x011c71c7, 0x0038e38e, 0x0071c71c, 0x00e38e38, 0x01c71c71, 0x018e38e3}, DB_ONE, -1, 1 } , /* ~8.421053e-01 */ {{0x01af286b, 0x019435e5, 0x001af286, 0x0179435e, 0x00a1af28, 0x00d79435, 0x01ca1af2, 0x010d7943}, DB_ONE, -1, 1 } , /* ~8.000000e-01 */ {{0x01999999, 0x01333333, 0x00666666, 0x00cccccc, 0x01999999, 0x01333333, 0x00666666, 0x00cccccc}, DB_ONE, -1, 1 } , /* ~7.619048e-01 */ {{0x01861861, 0x010c30c3, 0x00186186, 0x0030c30c, 0x00618618, 0x00c30c30, 0x01861861, 0x010c30c3}, DB_ONE, -1, 1 } , /* ~7.272727e-01 */ {{0x01745d17, 0x008ba2e8, 0x01745d17, 0x008ba2e8, 0x01745d17, 0x008ba2e8, 0x01745d17, 0x008ba2e8}, DB_ONE, -1, 1 } , /* ~6.956522e-01 */ {{0x01642c85, 0x0121642c, 0x010b2164, 0x00590b21, 0x00c8590b, 0x0042c859, 0x001642c8, 0x00b21642}, DB_ONE, -1, 1 } }; static const scs constant_poly[20]= /* ~-5.023367e-02 */ {{{0x0019b83a, 0x00b9d6ab, 0x002e59e9, 0x00a24f80, 0x0027986a, 0x007928b4, 0x005ddb72, 0x00619d7f}, DB_ONE, -1, -1 } , /* ~5.286469e-02 */ {{0x001b1114, 0x01894bfd, 0x012e0600, 0x005542f4, 0x00af2119, 0x00f848c9, 0x00ffffb2, 0x00e80ead}, DB_ONE, -1, 1 } , /* ~-5.555504e-02 */ {{0x001c71b5, 0x01bc1996, 0x014e2328, 0x00d31ffd, 0x01d9197b, 0x01dd617b, 0x008f49f5, 0x0114fa8f}, DB_ONE, -1, -1 } , /* ~5.882305e-02 */ {{0x001e1e0d, 0x01be311c, 0x01d73257, 0x00706242, 0x016f89de, 0x01a8eccc, 0x01f56b8f, 0x0007fe91}, DB_ONE, -1, 1 } , /* ~-6.250000e-02 */ {{0x00200000, 0x000adcae, 0x0185071e, 0x017bf346, 0x00ca1252, 0x0061b6b6, 0x013f5139, 0x01ca868c}, DB_ONE, -1, -1 } , /* ~6.666667e-02 */ {{0x00222222, 0x004dd3cc, 0x01922a63, 0x00f3c5d7, 0x01a47f93, 0x00ff9671, 0x00e00ecb, 0x00bd3330}, DB_ONE, -1, 1 } , /* ~-7.142857e-02 */ {{0x00249249, 0x00492279, 0x00db5116, 0x00671689, 0x006a3376, 0x003f35c0, 0x00661341, 0x002815e5}, DB_ONE, -1, -1 } , /* ~7.692308e-02 */ {{0x00276276, 0x004ec339, 0x005ea9a2, 0x01011824, 0x0075bd24, 0x003cc34f, 0x01c99f69, 0x0129e78c}, DB_ONE, -1, 1 } , /* ~-8.333333e-02 */ {{0x002aaaaa, 0x01555555, 0x012d8c96, 0x010abd3b, 0x018f2c29, 0x0196754b, 0x019ec134, 0x00768c4d}, DB_ONE, -1, -1 } , /* ~9.090909e-02 */ {{0x002e8ba2, 0x01d1745d, 0x008e49f5, 0x01341475, 0x0081f0c0, 0x014f2ec1, 0x01dd9fe2, 0x01f38d59}, DB_ONE, -1, 1 } , /* ~-1.000000e-01 */ {{0x00333333, 0x00666666, 0x00ccc2cc, 0x01fb84f5, 0x01eebd5a, 0x013af37f, 0x012bc6d5, 0x004c47a1}, DB_ONE, -1, -1 } , /* ~1.111111e-01 */ {{0x0038e38e, 0x0071c71c, 0x00e387cf, 0x00be22fc, 0x014bae85, 0x01b43f38, 0x002876db, 0x010a8b36}, DB_ONE, -1, 1 } , /* ~-1.250000e-01 */ {{0x00400000, 0x00000000, 0x00000000, 0x00eb1b6c, 0x00227096, 0x01596ab4, 0x00492bc3, 0x018163ed}, DB_ONE, -1, -1 } , /* ~1.428571e-01 */ {{0x00492492, 0x00924924, 0x01249249, 0x00c76cd0, 0x00055827, 0x00afd708, 0x015a6f90, 0x01d11663}, DB_ONE, -1, 1 } , /* ~-1.666667e-01 */ {{0x00555555, 0x00aaaaaa, 0x01555555, 0x00aaa4bb, 0x00cc61d7, 0x0044a5cf, 0x01cf9970, 0x004415cc}, DB_ONE, -1, -1 } , /* ~2.000000e-01 */ {{0x00666666, 0x00cccccc, 0x01999999, 0x013330bb, 0x017cdd12, 0x013269ea, 0x00761531, 0x010437bf}, DB_ONE, -1, 1 } , /* ~-2.500000e-01 */ {{0x00800000, 0x00000000, 0x00000000, 0x00000000, 0x00232b9b, 0x0054cd5a, 0x00b651a3, 0x011d0f4b}, DB_ONE, -1, -1 } , /* ~3.333333e-01 */ {{0x00aaaaaa, 0x01555555, 0x00aaaaaa, 0x01555555, 0x00b43c17, 0x00b2094a, 0x003eef44, 0x0118c38a}, DB_ONE, -1, 1 } , /* ~-5.000000e-01 */ {{0x00ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffe1, 0x009bd81b, 0x01b07b1e, 0x01fa34a2}, DB_ONE, -1, -1 } , /* ~1.000000e+00 */ {{0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01ffffff, 0x01fffffc, 0x01e04b7e, 0x00472719, 0x0176878b}, DB_ONE, -1, 1 } }; #else static const scs sc_ln2={{0x2c5c85fd, 0x3d1cf79a, 0x2f278ece, 0x1803f2f6, 0x2bd03cd0, 0x3267298b, 0x18b62834, 0x175b8baa}, DB_ONE, -1, 1 }; static const scs table_ti[13]= /* ~-3.746934e-01 */ {{{0x17fafa3b, 0x360546fb, 0x1e6fdb53, 0x0b1225e6, 0x15f38987, 0x26664702, 0x3cb1bf6d, 0x118a64f9}, DB_ONE, -1, -1 } , /* ~-2.876821e-01 */ {{0x12696211, 0x0d36e49e, 0x03beb767, 0x1b02aa70, 0x2a30f490, 0x3732bb37, 0x2425c6da, 0x1fc53d0e}, DB_ONE, -1, -1 } , /* ~-2.076394e-01 */ {{0x0d49f69e, 0x115b3c6d, 0x395f53bd, 0x0b901b99, 0x2e77188a, 0x3e3d1ab5, 0x1147dede, 0x05483ae4}, DB_ONE, -1, -1 } , /* ~-1.335314e-01 */ {{0x088bc741, 0x04fc8f7b, 0x319c5a0f, 0x38e5bd03, 0x31dda8fe, 0x30f08645, 0x2fa1d5c5, 0x02c6529d}, DB_ONE, -1, -1 } , /* ~-6.453852e-02 */ {{0x0421662d, 0x19e3a068, 0x228ff66f, 0x3503372c, 0x04bf1b16, 0x0ff1b85c, 0x006c21b2, 0x21a9efd6}, DB_ONE, -1, -1 } , /* ZERO */ {{0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, {{0, 0}}, 0, 1 } , /* ~6.062462e-02 */ {{0x03e14618, 0x008b1533, 0x02f992e2, 0x37759978, 0x2634d1d3, 0x13375edb, 0x2e4634ea, 0x1dcf0aef}, DB_ONE, -1, 1 } , /* ~1.177830e-01 */ {{0x0789c1db, 0x22af2e5e, 0x27aa1fff, 0x21fe9e15, 0x176e53af, 0x04015c6b, 0x021a0541, 0x006df1d7}, DB_ONE, -1, 1 } , /* ~1.718503e-01 */ {{0x0aff9838, 0x14f27a79, 0x039f1050, 0x0e424775, 0x3f35571c, 0x355ff008, 0x1ca13efc, 0x3c2c8490}, DB_ONE, -1, 1 } , /* ~2.231436e-01 */ {{0x0e47fbe3, 0x33534435, 0x212ec0f7, 0x25ff7344, 0x2571d97a, 0x274129e2, 0x12b111db, 0x2c051568}, DB_ONE, -1, 1 } , /* ~2.719337e-01 */ {{0x11675cab, 0x2ae98380, 0x39cc7d57, 0x041b8b82, 0x0fc19f41, 0x0a43c91d, 0x1523ef69, 0x164b69f6}, DB_ONE, -1, 1 } , /* ~3.184537e-01 */ {{0x14618bc2, 0x0717b09f, 0x10b7b37b, 0x0cf1cd10, 0x15dcb349, 0x0c00c397, 0x2c39cc9b, 0x274c94a8}, DB_ONE, -1, 1 } , {{0x1739d7f6, 0x2ef401a7, 0x0e24c53f, 0x2b4fbde5, 0x2ab77843, 0x1cea5975, 0x1eeef249, 0x384d2344}, DB_ONE, -1, 1 } }; static const scs table_inv_wi[13]= /* ~1.454545e+00 */ {{{0x00000001, 0x1d1745d1, 0x1d1745d1, 0x1d1745d1, 0x1d1745d1, 0x1d1745d1, 0x1d183e2a, 0x36835582}, DB_ONE, 0, 1 } , /* ~1.333333e+00 */ {{0x00000001, 0x15555555, 0x15555555, 0x15555555, 0x15555555, 0x15555555, 0x15549b7e, 0x1a416c6b}, DB_ONE, 0, 1 } , /* ~1.230769e+00 */ {{0x00000001, 0x0ec4ec4e, 0x313b13b1, 0x0ec4ec4e, 0x313b13b1, 0x0ec4ec4e, 0x313a6825, 0x3ab28b77}, DB_ONE, 0, 1 } , /* ~1.142857e+00 */ {{0x00000001, 0x09249249, 0x09249249, 0x09249249, 0x09249249, 0x09249249, 0x09238b74, 0x26f620a6}, DB_ONE, 0, 1 } , /* ~1.066667e+00 */ {{0x00000001, 0x04444444, 0x11111111, 0x04444444, 0x11111111, 0x04444444, 0x1111d60e, 0x1f0c9d58}, DB_ONE, 0, 1 } , /* ~1.000000e+00 */ {{0x00000001, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 } , /* ~9.411765e-01 */ {{0x3c3c3c3c, 0x0f0f0f0f, 0x03c3c3c3, 0x30f0f0f0, 0x3c3c3c3c, 0x0f0f923d, 0x16e0e0a4, 0x3a84202f}, DB_ONE, -1, 1 } , /* ~8.888889e-01 */ {{0x38e38e38, 0x38e38e38, 0x38e38e38, 0x38e38e38, 0x38e38e38, 0x38e3946a, 0x2e0ee2c9, 0x0d6e0fbd}, DB_ONE, -1, 1 } , /* ~8.421053e-01 */ {{0x35e50d79, 0x10d79435, 0x39435e50, 0x35e50d79, 0x10d79435, 0x3943324d, 0x0637ea85, 0x131a67ba}, DB_ONE, -1, 1 } , /* ~8.000000e-01 */ {{0x33333333, 0x0ccccccc, 0x33333333, 0x0ccccccc, 0x33333333, 0x0ccccccc, 0x33333333, 0x0ccccccc}, DB_ONE, -1, 1 } , /* ~7.619048e-01 */ {{0x30c30c30, 0x30c30c30, 0x30c30c30, 0x30c30c30, 0x30c30c30, 0x30c2f1a4, 0x160958a1, 0x2b03bc88}, DB_ONE, -1, 1 } , /* ~7.272727e-01 */ {{0x2e8ba2e8, 0x2e8ba2e8, 0x2e8ba2e8, 0x2e8ba2e8, 0x2e8ba2e8, 0x2e8bcb74, 0x2d78b525, 0x00a1db67}, DB_ONE, -1, 1 } , /* ~6.956522e-01 */ {{0x2c8590b2, 0x0590b216, 0x10b21642, 0x321642c8, 0x1642c859, 0x02c8590b, 0x08590b21, 0x190b2164}, DB_ONE, -1, 1 } }; static const scs constant_poly[20]= /*0 ~-5.023367e-02 */ {{{0x0337074b, 0x275aac5c, 0x2cf4a893, 0x38013cc3, 0x149a3416, 0x0e067307, 0x12745608, 0x1658e0d5}, DB_ONE, -1, -1 } , /*1 ~5.286469e-02 */ {{0x03622298, 0x252ff65c, 0x03001550, 0x2f457908, 0x32f78ecc, 0x17442a4e, 0x1d806366, 0x2c50350e}, DB_ONE, -1, 1 } , /*2 ~-5.555504e-02 */ {{0x038e36bb, 0x30665a9c, 0x119434c7, 0x3fdec8cb, 0x37dd3adb, 0x2663cd45, 0x230e43e9, 0x32b9663c}, DB_ONE, -1, -1 } , /*3 ~5.882305e-02 */ {{0x03c3c1bb, 0x38c473ae, 0x192b9c18, 0x242b7c4e, 0x3da8edc8, 0x04454ffe, 0x2cf133c6, 0x0c926fd0}, DB_ONE, -1, 1 } , /*4 ~-6.250000e-02 */ {{0x04000000, 0x2b72bb0a, 0x038f5efc, 0x34665092, 0x2461b6c9, 0x172f7050, 0x1218b5c1, 0x104862d7}, DB_ONE, -1, -1 } , /*5 ~6.666667e-02 */ {{0x04444444, 0x374f3324, 0x1531bcf1, 0x1d7d23fc, 0x26ff9670, 0x38fc33ae, 0x15bf1cfb, 0x2c9f1c2d}, DB_ONE, -1, 1 } , /*6 ~-7.142857e-02 */ {{0x04924924, 0x2489e5b6, 0x288b19c5, 0x2893519b, 0x2c3f35c0, 0x0b8bfdce, 0x3541ab49, 0x1de415bc}, DB_ONE, -1, -1 } , /*7 ~7.692308e-02 */ {{0x04ec4ec4, 0x3b0ce4bd, 0x14d14046, 0x0243ade9, 0x083cc34f, 0x393e6a5a, 0x2c1855f2, 0x259d599f}, DB_ONE, -1, 1 } , /*8 ~-8.333333e-02 */ {{0x05555555, 0x1555565b, 0x064b42af, 0x13bc7961, 0x1396754b, 0x33d85415, 0x2ba548d4, 0x039c4ff6}, DB_ONE, -1, -1 } , /*9 ~9.090909e-02 */ {{0x05d1745d, 0x05d1751c, 0x24facd05, 0x07540f86, 0x014f2ec1, 0x3bb3fa8b, 0x02e1da4c, 0x3304817c}, DB_ONE, -1, 1 } , /*10 ~-1.000000e-01 */ {{0x06666666, 0x19999999, 0x21667ee1, 0x0f5f75ea, 0x353af37f, 0x2578daa1, 0x07c76f47, 0x16541534}, DB_ONE, -1, -1 } , /*11 ~1.111111e-01 */ {{0x071c71c7, 0x071c71c7, 0x03e7af88, 0x2fca5d74, 0x0bb43f38, 0x050edb70, 0x3631b696, 0x1fc3e0d3}, DB_ONE, -1, 1 } , /*12 ~-1.250000e-01 */ {{0x08000000, 0x00000000, 0x00003ac6, 0x36c11384, 0x2d596ab4, 0x09257878, 0x0597dc26, 0x2d60813a}, DB_ONE, -1, -1 } , /*13 ~1.428571e-01 */ {{0x09249249, 0x09249249, 0x0924b1db, 0x0d002ac1, 0x0eafd708, 0x2b4df21d, 0x0458da93, 0x2d11460c}, DB_ONE, -1, 1 } , /*14 ~-1.666667e-01 */ {{0x0aaaaaaa, 0x2aaaaaaa, 0x2aaaaaa9, 0x0bb6630e, 0x2e44a5cf, 0x39f32e04, 0x105732b9, 0x01a76208}, DB_ONE, -1, -1 } , /*15 ~2.000000e-01 */ {{0x0ccccccc, 0x33333333, 0x0ccccccc, 0x0bbbe6e8, 0x253269ea, 0x0ec2a630, 0x10defc5c, 0x238aef3b}, DB_ONE, -1, 1 } , /*16 ~-2.500000e-01 */ {{0x10000000, 0x00000000, 0x00000000, 0x0001195c, 0x3654cd5a, 0x16ca3471, 0x343d2da0, 0x235273f2}, DB_ONE, -1, -1 } , /*17 ~3.333333e-01 */ {{0x15555555, 0x15555555, 0x15555555, 0x1555a1e0, 0x2eb2094a, 0x07dde891, 0x230e2bfa, 0x28aae6ab}, DB_ONE, -1, 1 } , /*18 ~-5.000000e-01 */ {{0x1fffffff, 0x3fffffff, 0x3fffffff, 0x3fffffff, 0x029bd81b, 0x360f63df, 0x28d28bd3, 0x3c15f394}, DB_ONE, -1, -1 } , /*19 ~1.000000e+00 */ {{0x3fffffff, 0x3fffffff, 0x3fffffff, 0x3fffffff, 0x39e04b7e, 0x08e4e337, 0x1a1e2ed3, 0x23e85705}, DB_ONE, -1, 1 } }; #endif #define sc_ln2_ptr (scs_ptr)(&sc_ln2) #define constant_poly_ptr (scs_ptr)&constant_poly #define table_ti_ptr (scs_ptr)&table_ti #define table_inv_wi_ptr (scs_ptr)&table_inv_wi interval-2.1.0/src/crlibm/scs_lib/tests/tbx_timing.h0000644000000000000000000000615413031036767020634 0ustar 00000000000000#ifndef TBX_TIMING_H #define TBX_TIMING_H #include #include #if defined(CRLIBM_TYPECPU_ITANIUM) && defined(__INTEL_COMPILER) #include #endif /* * For the user interested in High resolution timer, to my knowledge * the best library is "RTAI", unfortunately it works only on Linux OS */ typedef union u_tbx_tick { unsigned long long tick; struct { unsigned long low; unsigned long high; } sub; struct timeval timev; } tbx_tick_t, *p_tbx_tick_t; #if defined(CRLIBM_TYPECPU_ITANIUM) && defined(__GNUC__) && !defined(__INTEL_COMPILER) #define TBX_GET_TICK(t) \ __asm__ __volatile__("mov %0=ar.itc" : "=r"((t).tick) :: "memory") #define TBX_TICK_RAW_DIFF(t1, t2) ((t2).tick - (t1).tick) #elif defined(CRLIBM_TYPECPU_ITANIUM) && defined(__HPCC__) /* Never tested, currently nobody defines __HPCC__. It should work on HPUX machines using HP compiler */ #include/* to move up of course */ #define TBX_GET_TICK(t) \ t.tick=_Asm_mov_from_ar(_AREG_ITC) #define TBX_TICK_RAW_DIFF(t1, t2) ((t2).tick - (t1).tick ) #elif defined(CRLIBM_TYPECPU_ITANIUM) && defined(__INTEL_COMPILER) #define TBX_GET_TICK(t) t.tick=__getReg(_IA64_REG_AR_ITC) #define TBX_TICK_RAW_DIFF(t1, t2) ((t2).tick - (t1).tick) #elif (defined(CRLIBM_TYPECPU_AMD64) || defined(CRLIBM_TYPECPU_X86)) \ && defined(__GNUC__) && !defined(__INTEL_COMPILER) #define TBX_GET_TICK(time) \ __asm__ __volatile__( \ "xorl %%eax,%%eax\n\t" \ "cpuid\n\t" \ "rdtsc\n\t" \ "movl %%eax,(%0)\n\t" \ "movl %%edx,4(%0)\n\t" \ "xorl %%eax,%%eax\n\t" \ "cpuid\n\t" \ : /* no output */ \ : "S"(&time.tick) \ : "eax", "ebx", "ecx", "edx", "memory") #define TBX_TICK_RAW_DIFF(t1, t2) ((t2).tick - (t1).tick) #elif defined(CRLIBM_TYPECPU_ALPHA) && defined(__GNUC__) #define TBX_GET_TICK(t) \ __asm__ volatile("rpcc %0\n\t" : "=r"((t).tick)) #define TBX_TICK_RAW_DIFF(t1, t2) \ (((t2).tick & 0xFFFFFFFF) - ((t1).tick & 0xFFFFFFFF)) #elif defined(CRLIBM_TYPECPU_SPARC) && defined(__GNUC__) #define TBX_GET_TICK(t) \ (t).tick = gethrtime() #define TBX_TICK_RAW_DIFF(t1, t2) \ ((t2).tick - (t1).tick) #else /* generic case */ #define TIMING_USES_GETTIMEOFDAY 1 /* inform the test functions that timings are inaccurate */ #define TBX_GET_TICK(t) \ gettimeofday(&(t).timev, 0) #define TBX_TICK_RAW_DIFF(t1, t2) \ ((t2.timev.tv_sec * 1000000L + t2.timev.tv_usec) - \ (t1.timev.tv_sec * 1000000L + t1.timev.tv_usec)) #endif #define TBX_TICK_DIFF(t1, t2) (TBX_TICK_RAW_DIFF(t1, t2) - tbx_residual + 1) #define TBX_TIMING_DELAY(t1, t2) tbx_tick2usec(TBX_TICK_DIFF(t1, t2)) extern unsigned long long tbx_residual; extern tbx_tick_t tbx_new_event; extern tbx_tick_t tbx_last_event; #endif /* TBX_TIMING_H */ interval-2.1.0/src/crlibm/scs_lib/tests/test_accuracy.c0000644000000000000000000002025413031036767021311 0ustar 00000000000000/** Test of SCS library against MPFR @file tests/test_accuracy.c @author David Defour David.Defour@ens-lyon.fr @author Florent de Dinechin Florent.de.Dinechin@ens-lyon.fr This file is part of the SCS library. */ /* Copyright (C) 2002 David Defour and Florent de Dinechin This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include "scs.h" #include "scs_private.h" #include #include #include /* Compile only if mpfr is present */ #ifdef HAVE_MPFR_H #include void (* test_scs_fct) () = NULL; int (* test_mpfr_fct) () = NULL; mp_rnd_t ROUNDING = GMP_RNDN; /* Function defined in scs2MPF.c */ //void scs2MPF(scs_t, mpf_t); void usage(char *namefct){ printf("Usage :\n \t %s n [k] \n\n", namefct); printf("Where k is the number of random tests to generate (default 1000) \n"); printf("and n is the function to test \n"); printf(" 1 : scs_add \n"); printf(" 2 : scs_sub \n"); printf(" 3 : scs_mul \n"); printf(" 4 : scs_div \n"); printf(" 5 : scs_get_d \n"); printf(" 6 : scs_get_d_minf \n"); printf(" 7 : scs_get_d_pinf \n"); printf(" 8 : scs_get_d_zero \n"); printf(" 9 : scs_set \n"); printf(" 10: scs_square \n"); printf("\n"); exit (1); } void test_square(int bcl){ scs_t scx, scr, scx_maxerr, scr_maxerr; mpfr_t mpx, mpr,mpscr,mperr; int j; double err, maxerr, avgerr; mpfr_init2(mpx, SCS_NB_WORDS*SCS_NB_BITS*2); mpfr_init2(mpr, SCS_NB_WORDS*SCS_NB_BITS*2); mpfr_init2(mpscr, SCS_NB_WORDS*SCS_NB_BITS*2); mpfr_init2(mperr, SCS_NB_WORDS*SCS_NB_BITS*2); maxerr = 0; avgerr=0; for(j=0; j h_word[0] = 1; #endif scs_get_mpfr(scx, mpx); scs_square(scr, scx); mpfr_mul(mpr, mpx, mpx, GMP_RNDN); scs_get_mpfr(scr, mpscr); mpfr_sub(mperr, mpscr, mpr, GMP_RNDN); mpfr_div(mperr, mperr, mpr, GMP_RNDN); mpfr_abs(mperr, mperr, GMP_RNDN); err = mpfr_get_d(mperr, GMP_RNDN); if (err > maxerr){ maxerr = err; scs_set(scx_maxerr, scx); scs_set(scr_maxerr, scr); } avgerr += err; } avgerr = avgerr / bcl; printf("Average error : %e nb bit : %d \n", avgerr, -(int)(log(avgerr)/log(2.))); printf("Max error : %e nb bit : %d \n", maxerr, -(int)(log(maxerr)/log(2.))); printf("Argument giving max error : \n"); scs_get_std(scx_maxerr); printf("Result with max error: \n"); scs_get_std(scr_maxerr); mpfr_clear(mpx); mpfr_clear(mpr); mpfr_clear(mperr); mpfr_clear(mpscr); } void test_one_arg(int bcl){ scs_t sc1, scex; mpfr_t mpf1, mpfex; double scsd, mpfrd, scsdmax; int j, nberr; mpfr_init2(mpf1, SCS_NB_WORDS*SCS_NB_BITS*2); mpfr_init2(mpfex, SCS_NB_WORDS*SCS_NB_BITS*2); scsd = 0; mpfrd = 0; nberr = 0; scsdmax = 0; for(j=0; j h_word[0] = 1; sc2 -> h_word[0] = 1; sc1 -> h_word[1] = 1; sc2 -> h_word[1] = 1; #endif test_scs_fct(sc3, sc1, sc2); scs_get_mpfr(sc1, mp1); scs_get_mpfr(sc2, mp2); scs_get_mpfr(sc3, mp3); test_mpfr_fct(mp4, mp1, mp2, GMP_RNDN); /* Error Computation */ mpfr_sub(mp5, mp4, mp3, GMP_RNDN); mpfr_div(mp5, mp5, mp4, GMP_RNDN); mpfr_abs(mp5, mp5, GMP_RNDN); d2 = mpfr_get_d(mp5, GMP_RNDN); if (d2 > max){ max = d2; scs_set(scm1, sc1); scs_set(scm2, sc2); scs_set(scm3, sc3); } d1 += d2; } printf("Average error : %e nb bit : %d \n", d1/bcl, -(int)(log(d1/bcl)/log(2.))); printf("Max error : %e nb bit : %d \n", max, -(int)(log(max)/log(2.))); printf("First Number : \n"); scs_get_std(scm1); printf("Second Number : \n"); scs_get_std(scm2); printf("Result Number : \n"); scs_get_std(scm3); mpfr_clear(mp1); mpfr_clear(mp2); mpfr_clear(mp3); mpfr_clear(mp4); mpfr_clear(mp5); } void test_scs_set_d(int loops) { db_number d; double d1, d2; scs_t s; int i,j, errors, ep; double errorcases1[20]; double errorcases2[20]; errors=0; ep=0; for (i=0; i= 3)? atoi(argv[2]) : 1000; switch(fct){ case 1: test_scs_fct = scs_add; test_mpfr_fct = mpfr_add; test_two_arg(bcl); break; case 2: test_scs_fct = scs_sub; test_mpfr_fct = mpfr_sub; test_two_arg(bcl); break; case 3: test_scs_fct = scs_mul; test_mpfr_fct = mpfr_mul; test_two_arg(bcl); break; case 4: test_scs_fct = scs_div; test_mpfr_fct = mpfr_div; test_two_arg(bcl); break; case 5: test_scs_fct = scs_get_d; ROUNDING = GMP_RNDN; test_one_arg(bcl); break; case 6: test_scs_fct = scs_get_d_minf; ROUNDING = GMP_RNDD; test_one_arg(bcl); break; case 7: test_scs_fct = scs_get_d_pinf; ROUNDING = GMP_RNDU; test_one_arg(bcl); break; case 8: test_scs_fct = scs_get_d_zero; ROUNDING = GMP_RNDZ; test_one_arg(bcl); break; case 9: test_scs_set_d(bcl); break; case 10: test_square(bcl); break; default : fprintf(stderr,"Unknown Function \n"); usage(argv[0]); } return 0; } #else int main(){ fprintf(stderr,"No MPFR detected on your system.\n Please install MPFR, and compile scslib with MPFR support\n (see ./configure --help) \n"); return 0; } #endif /*HAVE_LIBMPFR*/ interval-2.1.0/src/crlibm/scs_lib/tests/test_log.c0000644000000000000000000003561613031036767020310 0ustar 00000000000000/* * Function to compute the logarithm with fully exact rounding * * Author : Defour David (David.Defour@ens-lyon.fr) * * Date of creation : 13/05/2002 * Last Modified : 17/05/2002 */ #include "scs.h" #include "scs_private.h" #include "log.h" #include #ifdef HAVE_GMP_H #include #include "tbx_timing.h" #define LOOPS 10000 mpf_t mpf_sc_ln2_ptr; mpf_t mpf_constant_poly_ptr[20]; mpf_t mpf_table_ti_ptr[13]; mpf_t mpf_table_inv_wi_ptr[13]; /* * 6) SCS CONSTANTS */ #ifdef SCS_TYPECPU_SPARC static const scs /* 0 */ scs_zer ={{0x00000000, 0x00000000, 0x00000000, 0x00000000}, {{0, 0}}, 0, 1 }, /* 1/2 */ scs_half={{0x02000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, -1, 1 }, /* 1 */ scs_one ={{0x00000001, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 }, /* 2 */ scs_two ={{0x00000002, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 }; #else static const scs /* 0 */ scs_zer ={{0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, {{0, 0}}, 0, 1 }, /* 1/2 */ scs_half={{0x20000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, -1, 1 }, /* 1 */ scs_one ={{0x00000001, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 }, /* 2 */ scs_two ={{0x00000002, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 }; #endif #define SCS_ZERO (scs_ptr)(&scs_zer) #define SCS_HALF (scs_ptr)(&scs_half) #define SCS_ONE (scs_ptr)(&scs_one) #define SCS_TWO (scs_ptr)(&scs_two) double sn_log(double); double mpf_sn_log(double); /* * 1) First reduction: exponent extraction * E * x = 2^ .(1+f) with 0 <= f < 1 * * log(x) = E.log(2) + log(1+f) where: * - log(2) is tabulated * - log(1+f) need to be evalute * * * 2) Avoiding accuracy problem when E=-1 by testing * * if (1+f >= sqrt(2)) then * 1+f = (1+f)/2; E = E+1; * and, * log(x) = (E+1).log(2) + log((1+f)/2) * * so now: sqrt(2)/2 <= (1+f) < sqrt(2) * * * 3) Second reduction: tabular reduction * -4 * wi = 1 + i. 2^ * 1 * log(1+f) = log(wi) + log ( 1 + --- . (1 + f - wi) ) * wi * * then |(1+f-wi)/wi| <= 2^-5 if we use rounded to nearest. * * 4) Computation: * a) Table lookup of: * - ti = log(wi) * - inv_wi = 1/(wi) * b) Polynomial evaluation of: * - P(R) ~ log(1 + R), where R = (1+f-wi) * inv_wi * * -5 * with |R| < 2^ * * * 5) Reconstruction: * log(x) = E.log(2) + t_i + P(R) * */ #define SQRT_2 1.4142135623730950489e0 /************************************************************* ************************************************************* * ROUNDED TO NEAREST ************************************************************* *************************************************************/ double sn_log(double x){ scs_t R, sc_ln2_times_E, res1; db_number nb, nb2, wi, resd; int ti, i, E=0; nb.d = x; /* Filter cases */ if (nb.i[HI_ENDIAN] < 0x00100000){ /* x < 2^(-1022) */ if (((nb.i[HI_ENDIAN] & 0x7fffffff)|nb.i[LO_ENDIAN])==0) return 1.0/0.0; /* log(+/-0) = -Inf */ if (nb.i[HI_ENDIAN] < 0) return (x-x)/0; /* log(-x) = Nan */ /* Subnormal number */ E -= (SCS_NB_BITS*2); /* keep in mind that x is a subnormal number */ nb.d *=SCS_RADIX_TWO_DOUBLE; /* make x as normal number */ /* We may just want add 2 to the scs number.index */ /* may be .... we will see */ } if (nb.i[HI_ENDIAN] >= 0x7ff00000) return x+x; /* Inf or Nan */ /* find n, nb.d such that sqrt(2)/2 < nb.d < sqrt(2) */ E += (nb.i[HI_ENDIAN]>>20)-1023; nb.i[HI_ENDIAN] = (nb.i[HI_ENDIAN] & 0x000fffff) | 0x3ff00000; if (nb.d > SQRT_2){ nb.d *= 0.5; E++; } /* to normalize nb.d and round to nearest */ /* + (1-trunc(sqrt(2.)/2 * 2^(4))*2^(-4) )+2.^(-(4+1))*/ nb2.d = nb.d + norm_number.d; i = (nb2.i[HI_ENDIAN] & 0x000fffff); i = i >> 16; /* 0<= i <=11 */ wi.d = (11+i)*(double)0.6250e-1; /* (1+f-w_i) */ nb.d -= wi.d; /* Table reduction */ ti = i; /* R = (1+f-w_i)/w_i */ scs_set_d(R, nb.d); scs_mul(R, R, table_inv_wi_ptr[i]); /* sc_ln2_times_E = E*log(2) */ scs_set(sc_ln2_times_E, sc_ln2_ptr); if (E >= 0){ scs_mul_ui(sc_ln2_times_E, E); }else{ scs_mul_ui(sc_ln2_times_E, -E); sc_ln2_times_E->sign = -1; } /* * Polynomial evaluation of log(1 + R) with an error less than 2^(-130) */ scs_mul(res1, constant_poly_ptr[0], R); for(i=1; i<20; i++){ scs_add(res1, constant_poly_ptr[i], res1); scs_mul(res1, res1, R); } scs_add(res1, res1, table_ti_ptr[ti]); scs_add(res1, res1, sc_ln2_times_E); scs_get_d(&resd.d, res1); return resd.d; } /************************************************************* ************************************************************* * ROUNDED TO NEAREST ************************************************************* *************************************************************/ double mpf_sn_log(double x){ mpf_t R, sc_ln2_times_E, res1; db_number nb, nb2, wi, resd; int ti, i, E=0; /* Memory allocation */ mpf_init2(R, 210); mpf_init2(sc_ln2_times_E, 210); mpf_init2(res1, 210); nb.d = x; /* Filter cases */ if (nb.i[HI_ENDIAN] < 0x00100000){ /* x < 2^(-1022) */ if (((nb.i[HI_ENDIAN] & 0x7fffffff)|nb.i[LO_ENDIAN])==0) return 1.0/0.0; /* log(+/-0) = -Inf */ if (nb.i[HI_ENDIAN] < 0) return (x-x)/0; /* log(-x) = Nan */ /* Subnormal number */ E -= (SCS_NB_BITS*2); /* keep in mind that x is a subnormal number */ nb.d *=SCS_RADIX_TWO_DOUBLE; /* make x as normal number */ /* We may just want add 2 to the scs number.index */ /* may be .... we will see */ } if (nb.i[HI_ENDIAN] >= 0x7ff00000) return x+x; /* Inf or Nan */ /* find n, nb.d such that sqrt(2)/2 < nb.d < sqrt(2) */ E += (nb.i[HI_ENDIAN]>>20)-1023; nb.i[HI_ENDIAN] = (nb.i[HI_ENDIAN] & 0x000fffff) | 0x3ff00000; if (nb.d > SQRT_2){ nb.d *= 0.5; E++; } /* to normalize nb.d and round to nearest */ /* + (1-trunc(sqrt(2.)/2 * 2^(4))*2^(-4) )+2.^(-(4+1))*/ nb2.d = nb.d + norm_number.d; i = (nb2.i[HI_ENDIAN] & 0x000fffff); i = i >> 16; /* 0<= i <=11 */ wi.d = (11+i)*(double)0.6250e-1; /* (1+f-w_i) */ nb.d -= wi.d; /* Table reduction */ ti = i; /* R = (1+f-w_i)/w_i */ mpf_set_d(R, nb.d); mpf_mul(R, R, mpf_table_inv_wi_ptr[i]); /* sc_ln2_times_E = E*log(2) */ mpf_set(sc_ln2_times_E, mpf_sc_ln2_ptr); if (E >= 0){ mpf_mul_ui(sc_ln2_times_E, sc_ln2_times_E, E); }else{ mpf_mul_ui(sc_ln2_times_E, sc_ln2_times_E, -E); mpf_neg(sc_ln2_times_E, sc_ln2_times_E); } /* * Polynomial evaluation of log(1 + R) with an error less than 2^(-130) */ mpf_mul(res1, mpf_constant_poly_ptr[0], R); for(i=1; i<20; i++){ mpf_add(res1, mpf_constant_poly_ptr[i], res1); mpf_mul(res1, res1, R); } mpf_add(res1, res1, mpf_table_ti_ptr[ti]); mpf_add(res1, res1, sc_ln2_times_E); resd.d = mpf_get_d(res1); /* Free Memory */ mpf_clear(R); mpf_clear(sc_ln2_times_E); mpf_clear(res1); return resd.d; } void free_mpf_cst(){ int i; for (i=0; i<13; i++) mpf_clear(mpf_table_ti_ptr[i]); for (i=0; i<13; i++) mpf_clear(mpf_table_inv_wi_ptr[i]); for (i=0; i<20; i++) mpf_clear(mpf_constant_poly_ptr[i]); mpf_clear(mpf_sc_ln2_ptr); } void init_mpf_cst(){ /* * mpf constant initialisation */ mpf_init_set_str(mpf_sc_ln2_ptr,".6931471805599453094172321214581765680755001343602552541206800094933936",10); mpf_init_set_str(mpf_table_ti_ptr[0],"-.3746934494414106936069849078675769724802936835036038412641523288430009",10); mpf_init_set_str(mpf_table_ti_ptr[1],"-.2876820724517809274392190059938274315035097108977610565066656853492930",10); mpf_init_set_str(mpf_table_ti_ptr[2],"-.2076393647782445016154410442673876674967325926808139000636745273101098",10); mpf_init_set_str(mpf_table_ti_ptr[3],"-.1335313926245226231463436209313499745894156734989045739026498785426010",10); mpf_init_set_str(mpf_table_ti_ptr[4],"-.06453852113757117167292391568399292812890862534975384283537781286190121",10); mpf_init_set_str(mpf_table_ti_ptr[5],"0.0",10); mpf_init_set_str(mpf_table_ti_ptr[6],".06062462181643484258060613204042026328620247514472377081451769990871809",10); mpf_init_set_str(mpf_table_ti_ptr[7],".1177830356563834545387941094705217050684807125647331411073486387948077",10); mpf_init_set_str(mpf_table_ti_ptr[8],".1718502569266592223400989460551472649353787238581078020552401984357182",10); mpf_init_set_str(mpf_table_ti_ptr[9],".2231435513142097557662950903098345033746010855480072136712878724873917",10); mpf_init_set_str(mpf_table_ti_ptr[10],".2719337154836417588316694945329991619825747499635896237113644456014997",10); mpf_init_set_str(mpf_table_ti_ptr[11],".3184537311185346158102472135905995955952064508566514128565276806503928",10); mpf_init_set_str(mpf_table_ti_ptr[12],".3629054936893684531378243459774898461403797773994147255159153395094188",10); mpf_init_set_str(mpf_table_inv_wi_ptr[0],"1.454545454545454545454545454545454545454545454545454545454545454545455",10); mpf_init_set_str(mpf_table_inv_wi_ptr[1],"1.333333333333333333333333333333333333333333333333333333333333333333333",10); mpf_init_set_str(mpf_table_inv_wi_ptr[2],"1.230769230769230769230769230769230769230769230769230769230769230769231",10); mpf_init_set_str(mpf_table_inv_wi_ptr[3],"1.142857142857142857142857142857142857142857142857142857142857142857143",10); mpf_init_set_str(mpf_table_inv_wi_ptr[4],"1.066666666666666666666666666666666666666666666666666666666666666666667",10); mpf_init_set_str(mpf_table_inv_wi_ptr[5],"1.0",10); mpf_init_set_str(mpf_table_inv_wi_ptr[6],".9411764705882352941176470588235294117647058823529411764705882352941176",10); mpf_init_set_str(mpf_table_inv_wi_ptr[7],".8888888888888888888888888888888888888888888888888888888888888888888889",10); mpf_init_set_str(mpf_table_inv_wi_ptr[8],".8421052631578947368421052631578947368421052631578947368421052631578947",10); mpf_init_set_str(mpf_table_inv_wi_ptr[9],".8000000000000000000000000000000000000000000000000000000000000000000000",10); mpf_init_set_str(mpf_table_inv_wi_ptr[10],".7619047619047619047619047619047619047619047619047619047619047619047619",10); mpf_init_set_str(mpf_table_inv_wi_ptr[11],".7272727272727272727272727272727272727272727272727272727272727272727273",10); mpf_init_set_str(mpf_table_inv_wi_ptr[12],".6956521739130434782608695652173913043478260869565217391304347826086957",10); mpf_init_set_str(mpf_constant_poly_ptr[0],"-.5023367294567568078075892234129085015737046673117638148835793879900684e-1",10); mpf_init_set_str(mpf_constant_poly_ptr[1],".5286469364636800162451931056605008699849205395651010015123349866702438e-1",10); mpf_init_set_str(mpf_constant_poly_ptr[2],"-.5555504165240301671600703643945025506173351812330050928639639013749408e-1",10); mpf_init_set_str(mpf_constant_poly_ptr[3],".5882304523791230393387514237891031448778320732847321758009922427128675e-1",10); mpf_init_set_str(mpf_constant_poly_ptr[4],"-.6250000063225403563289268352338121550211573212295444469323271379834995e-1",10); mpf_init_set_str(mpf_constant_poly_ptr[5],".6666666722317130353982967043683210254854513387493745794307824211890102e-1",10); mpf_init_set_str(mpf_constant_poly_ptr[6],"-.7142857142809460344869308613352646790467720996336436837300223496769771e-1",10); mpf_init_set_str(mpf_constant_poly_ptr[7],".7692307692269045639218260467556323317594125412187843530035925183575360e-1",10); mpf_init_set_str(mpf_constant_poly_ptr[8],"-.8333333333333356037828752693534976595948243524382699349340678490229276e-1",10); mpf_init_set_str(mpf_constant_poly_ptr[9],".9090909090909107517931824416149710386096279143853141933153563186364239e-1",10); mpf_init_set_str(mpf_constant_poly_ptr[10],"-.9999999999999999993224242653285578758483071952239027712038970659952908e-1",10); mpf_init_set_str(mpf_constant_poly_ptr[11],".1111111111111111110676605039270706067112823008194317757408530067415460",10); mpf_init_set_str(mpf_constant_poly_ptr[12],"-.1250000000000000000000121547531034901577892307419239533855249184555657",10); mpf_init_set_str(mpf_constant_poly_ptr[13],".1428571428571428571428636714934431388385979630564777290210429555695253",10); mpf_init_set_str(mpf_constant_poly_ptr[14],"-.1666666666666666666666666654681759449880186388123105519286024077940397",10); mpf_init_set_str(mpf_constant_poly_ptr[15],".1999999999999999999999999995018689489549856935258632875129946570831422",10); mpf_init_set_str(mpf_constant_poly_ptr[16],"-.2500000000000000000000000000000541884832055314060603150374550752650562",10); mpf_init_set_str(mpf_constant_poly_ptr[17],".3333333333333333333333333333333480752710184240674027421784076979756719",10); mpf_init_set_str(mpf_constant_poly_ptr[18],"-.4999999999999999999999999999999999992783495160517279217122998393096071",10); mpf_init_set_str(mpf_constant_poly_ptr[19],".9999999999999999999999999999999999999280145118565650165317802247440368",10); } /* * Used to mesure time taken by the instruction "name" */ #define TST_FCT(char, name)\ TBX_GET_TICK(t1);\ for(i=0; i< LOOPS-1; i++){ \ name;\ } \ TBX_GET_TICK(t2);\ deltat = TBX_TICK_RAW_DIFF(t1, t2); \ printf("%28s : %lld ticks \n", char, deltat); int main(){ /* table storing random number */ double tableau[LOOPS]; double res[LOOPS]; mpf_t TAB_MPF[LOOPS]; int i; tbx_tick_t t1, t2; unsigned long long deltat; printf("mpf constant initialisation ... \n"); init_mpf_cst(); printf("Finished ... \n"); srand(42); for(i=0; i #include #include #include #include "tbx_timing.h" #ifdef HAVE_GMP_H #include #endif #ifdef HAVE_MPFR_H #include #endif #define LOOPS 1000 /* * Used to mesure time taken by the instruction "name" */ #define TST_FCT(char, name)\ /* one untimed loop to load cache */ \ for(i=0; i< LOOPS-1; i++){ \ name;\ } \ TBX_GET_TICK(t1);\ for(i=0; i< LOOPS-1; i++){ \ name;\ } \ TBX_GET_TICK(t2);\ deltat = TBX_TICK_RAW_DIFF(t1, t2); \ printf("%28s : %lld ticks,\t ratio to FP +: %f\n", char, deltat, (double) deltat/tadd); /* Similar to the previous, computes the time for one FP add so that we have something to normalize against */ #define COMPUTE_TADD()\ /* one untimed loop to load cache */ \ for(i=0; i< LOOPS-1; i++){ \ d3 = double_table[i]*double_table[i+1];\ } \ TBX_GET_TICK(t1);\ for(i=0; i< LOOPS-1; i++){ \ d3 = double_table[i]*double_table[i+1];\ } \ TBX_GET_TICK(t2);\ tadd = TBX_TICK_RAW_DIFF(t1, t2); /* * Fct de test . */ int main(){ scs_t n1I; volatile double d3; volatile int int_r; unsigned long long deltat,tadd; tbx_tick_t t1, t2; int i; /* table storing random number */ scs_t scs_table[LOOPS]; #ifdef HAVE_GMP_H mpf_t mpf_table[LOOPS]; mpf_t a; #endif #ifdef HAVE_MPFR_H mpfr_t mpfr_table[LOOPS]; mpfr_t mpfr_a; #endif double double_table[LOOPS]; int int_table[LOOPS]; printf("Random generation ... "); srand(42); for(i=0; isign = 1; /* only positive numbers */ #endif scs_get_d(&double_table[i], scs_table[i]); int_table[i] = double_table[i]; #ifdef HAVE_GMP_H mpf_init2(mpf_table[i], (SCS_NB_BITS*SCS_NB_WORDS) ); scs_get_mpf(scs_table[i], mpf_table[i]); #endif #ifdef HAVE_MPFR_H mpfr_init2(mpfr_table[i], (SCS_NB_BITS*SCS_NB_WORDS) ); scs_get_mpfr(scs_table[i], mpfr_table[i]); #endif } printf(" done \n\n"); #ifdef HAVE_GMP_H mpf_init2(a, (SCS_NB_BITS*SCS_NB_WORDS)); mpf_set(a, mpf_table[1]); #endif #ifdef HAVE_MPFR_H mpfr_init2(mpfr_a, (SCS_NB_BITS*SCS_NB_WORDS)); mpfr_set(mpfr_a, mpfr_table[1], GMP_RNDN); #endif printf("These first timings don't mean much\n"); COMPUTE_TADD() TST_FCT("int a + b ", int_r = int_table[i]+int_table[i+1]) TST_FCT("int a * b ", d3 = int_table[i]*int_table[i+1]) TST_FCT("double a + b ", d3 = double_table[i]+double_table[i+1]) TST_FCT("double a * b ", d3 = double_table[i]*double_table[i+1]) TST_FCT("double a / b ", d3 = double_table[i]/double_table[i+1]) printf("\n"); printf("Here come the meaningful timings\n"); /* scs library test */ TST_FCT("conversion scs=>doubles ", scs_get_d(&double_table[i], scs_table[i])) TST_FCT("conversion doubles=>scs ", scs_set_d(n1I, double_table[i])) TST_FCT("scs_add ", scs_add(n1I, scs_table[i], scs_table[i+1])) TST_FCT("scs_sub ", scs_sub(n1I, scs_table[i], scs_table[i+1])) TST_FCT("scs_add_no_renorm ",scs_add_no_renorm(n1I, scs_table[i], scs_table[i+1])) TST_FCT("scs_mul ", scs_mul(n1I, scs_table[i], scs_table[i+1])) TST_FCT("scs_mul_ui ", scs_mul_ui(scs_table[i], 31242436)) TST_FCT("scs_square ", scs_square(n1I, scs_table[i])) // TST_FCT("scs_fma ", scs_fma(n1I, scs_table[i], scs_table[i], scs_table[i+1])) TST_FCT("add + mul scs ", scs_mul(n1I, scs_table[i], scs_table[i+1]); scs_add(n1I, n1I, scs_table[i])) TST_FCT("renormalization scs ", scs_renorm(scs_table[i])) TST_FCT("scs_div ", scs_div(n1I, scs_table[i], scs_table[i+1])) printf("\n"); #ifdef HAVE_GMP_H /* mpf (gmp) library test */ TST_FCT("Conversion mpf=>double", double_table[i] = mpf_get_d(mpf_table[i])) TST_FCT("Conversion double=>mpf ", mpf_set_d(a, double_table[i])) TST_FCT("Addition mpf ", mpf_add(a, mpf_table[i], mpf_table[i+1])) TST_FCT("Multiplication mpf ", mpf_mul(a, mpf_table[i], mpf_table[i+1])) TST_FCT("Multiplication_with_int mpf ", mpf_mul_ui(a, mpf_table[i], 3254353)) TST_FCT("Division mpf ", mpf_div(a, mpf_table[i], mpf_table[i+1])) printf("\n"); #endif #ifdef HAVE_MPFR_H /* mpf (gmp) library test */ TST_FCT("Conversion mpfr=>double", double_table[i] = mpfr_get_d(mpfr_table[i],GMP_RNDN)) TST_FCT("Conversion double=>mpfr ", mpfr_set_d(mpfr_a, double_table[i],GMP_RNDN)) TST_FCT("Addition mpfr ", mpfr_add(mpfr_a, mpfr_table[i], mpfr_table[i+1],GMP_RNDN)) TST_FCT("Multiplication mpfr ", mpfr_mul(mpfr_a, mpfr_table[i], mpfr_table[i+1],GMP_RNDN)) TST_FCT("Multiplication_with_int mpfr ", mpfr_mul_ui(mpfr_a, mpfr_table[i], 3254353,GMP_RNDN)) TST_FCT("Division mpfr ", mpfr_div(mpfr_a, mpfr_table[i], mpfr_table[i+1],GMP_RNDN)) printf("\n"); #endif return 0; } interval-2.1.0/src/crlibm/scs_lib/wrapper_scs.h0000644000000000000000000002573213031036767017661 0ustar 00000000000000extern "C" { #include "scs.h" } #include #include #include #include #ifndef SCS_WRAPPER_CPP #define SCS_WRAPPER_CPP 1 extern "C" int scs_cmp_mant(scs_ptr , scs_ptr); class Scs{ private: scs scsnb; public: /* Constructors */ Scs(){} Scs(double &d){scs_set_d(&scsnb, d);} Scs(int &i){scs_set_si(&scsnb, i);} Scs(const Scs& nb); ~Scs(){}; /* Mutators */ void scs_set_sign (int i) {this->scsnb.sign = i;} void scs_set_index(int i) {this->scsnb.index = i;} void scs_set_excep(double d) {this->scsnb.exception.d = d;} void scs_set_words(unsigned int word[SCS_NB_WORDS]){for(int i=0; iscsnb.h_word[i] = word[i];} /* Cast */ operator double(); operator int(); /* Negation */ Scs operator-() const; friend Scs fabs(const Scs &a); /* Assignment */ Scs &operator=(const Scs &nb1); Scs &operator=(const double nb1); Scs &operator=(const int i){scs_set_si(&scsnb, i);} /* Addition */ friend Scs operator+(Scs &nb1,Scs &nb2); friend Scs operator+(Scs &nb1, const double &nb2); friend Scs operator+(const double &nb1,Scs &nb2); void operator+=(Scs &nb); void operator+=(const double nb); /* Subtraction */ friend Scs operator-(Scs &nb1,Scs &nb2); friend Scs operator-(Scs &nb1, const double &nb2); friend Scs operator-(const double &nb1,Scs &nb2); void operator-=(Scs &nb); void operator-=(const double nb); /* Multiplication */ friend Scs operator*(Scs &nb1,Scs &nb2); friend Scs operator*(Scs &nb1, const double &nb2); friend Scs operator*(const double &nb1,Scs &nb2); friend Scs operator*(Scs &nb1, const int &nb2); friend Scs operator*(const int &nb1,Scs &nb2); void operator*=(Scs &nb); void operator*=(const double nb); void operator*=(const int nb); /* Multiplication */ friend Scs operator/(Scs &nb1,Scs &nb2); friend Scs operator/(Scs &nb1, const double &nb2); friend Scs operator/(const double &nb1,Scs &nb2); void operator/=(Scs &nb); void operator/=(const double nb); /* Comparisons */ friend bool operator==(Scs &nb1,Scs &nb2); friend bool operator!=(Scs &nb1,Scs &nb2); friend bool operator<=(Scs &nb1,Scs &nb2); friend bool operator>=(Scs &nb1,Scs &nb2); friend bool operator<(Scs &nb1,Scs &nb2); friend bool operator>(Scs &nb1,Scs &nb2); /* Random Number */ Scs rand(void); /* Input/Output */ friend ostream& operator<<(ostream &s, const Scs &a); friend istream& operator>>(istream &s, Scs &a); }; /************** * CONSTRUCTOR **************/ Scs::Scs(const Scs& nb){ unsigned int i; for(i=0; iscsnb.h_word[i] = nb.scsnb.h_word[i]; this->scsnb.exception.d = nb.scsnb.exception.d; this->scsnb.index = nb.scsnb.index; this->scsnb.sign = nb.scsnb.sign; } /************** * CAST **************/ inline Scs::operator double() { double d; scs_get_d(&d, &(this->scsnb)); return d; } inline Scs::operator int() { double d; scs_get_d(&d, &(this->scsnb)); return ((int)d); } /************** * ASSIGNATION **************/ inline Scs &Scs::operator=(const Scs& nb){ unsigned int i; for(i=0; iscsnb), nb); return *this; } inline Scs fabs(const Scs &a){ Scs res(a); res.scsnb.sign = 1; return res; } /************ * ADDITION ************/ inline Scs operator+(Scs &nb1,Scs &nb2){ Scs res; scs_add(&(res.scsnb), &(nb1.scsnb), &(nb2.scsnb)); return res; } inline Scs operator+(Scs &nb1,const double &nb2){ Scs res, op; scs_set_d(&(op.scsnb), nb2); scs_add(&(res.scsnb), &(nb1.scsnb), &(op.scsnb)); return res; } inline Scs operator+(const double &nb1, Scs &nb2){ Scs res, op; scs_set_d(&(op.scsnb), nb1); scs_add(&(res.scsnb), &(nb2.scsnb), &(op.scsnb)); return res; } void inline Scs::operator+=(Scs &nb) { scs_add(&(this->scsnb), &(this->scsnb), &(nb.scsnb)); } void inline Scs::operator+=(const double nb) { Scs op; scs_set_d(&(op.scsnb), nb); scs_add(&(this->scsnb), &(this->scsnb), &(op.scsnb)); } /************** * SUBTRACTION **************/ inline Scs operator-(Scs &nb1,Scs &nb2){ Scs res; scs_sub(&(res.scsnb), &(nb1.scsnb), &(nb2.scsnb)); return res; } inline Scs operator-(Scs &nb1,const double &nb2){ Scs res, op; scs_set_d(&(op.scsnb), nb2); scs_sub(&(res.scsnb), &(nb1.scsnb), &(op.scsnb)); return res; } inline Scs operator-(const double &nb1, Scs &nb2){ Scs res, op; scs_set_d(&(op.scsnb), nb1); scs_sub(&(res.scsnb), &(nb2.scsnb), &(op.scsnb)); return res; } void inline Scs::operator-=(Scs &nb) { scs_sub(&(this->scsnb), &(this->scsnb), &(nb.scsnb)); } void inline Scs::operator-=(const double nb) { Scs op; scs_set_d(&(op.scsnb), nb); scs_sub(&(this->scsnb), &(this->scsnb), &(op.scsnb)); } /***************** * MULTIPLICATION *****************/ inline Scs operator*(Scs &nb1,Scs &nb2){ Scs res; scs_mul(&(res.scsnb), &(nb1.scsnb), &(nb2.scsnb)); return res; } inline Scs operator*(Scs &nb1,const double &nb2){ Scs res, op; scs_set_d(&(op.scsnb), nb2); scs_mul(&(res.scsnb), &(nb1.scsnb), &(op.scsnb)); return res; } inline Scs operator*(const double &nb1, Scs &nb2){ Scs res, op; scs_set_d(&(op.scsnb), nb1); scs_mul(&(res.scsnb), &(nb2.scsnb), &(op.scsnb)); return res; } inline Scs operator*(Scs &nb1, const int &nb2){ Scs res; scs_set(&(res.scsnb), &(nb1.scsnb)); scs_mul_ui(&(res.scsnb), nb2); return res; } inline Scs operator*(const int &nb1, Scs &nb2){ Scs res; scs_set(&(res.scsnb), &(nb2.scsnb)); scs_mul_ui(&(res.scsnb), nb1); return res; } void inline Scs::operator*=(Scs &nb) { scs_mul(&(this->scsnb), &(this->scsnb), &(nb.scsnb)); } void inline Scs::operator*=(const double nb) { Scs op; scs_set_d(&(op.scsnb), nb); scs_mul(&(this->scsnb), &(this->scsnb), &(op.scsnb)); } void inline Scs::operator*=(const int nb) { scs_mul_ui(&(this->scsnb), nb); } /***************** * DIVISION *****************/ inline Scs operator/(Scs &nb1,Scs &nb2){ Scs res; scs_div(&(res.scsnb), &(nb1.scsnb), &(nb2.scsnb)); return res; } inline Scs operator/(Scs &nb1, const double &nb2){ Scs res, op; scs_set_d(&(op.scsnb), nb2); scs_div(&(res.scsnb), &(nb1.scsnb), &(op.scsnb)); return res; } inline Scs operator/(const double &nb1, Scs &nb2){ Scs res, op; scs_set_d(&(op.scsnb), nb1); scs_div(&(res.scsnb), &(nb2.scsnb), &(op.scsnb)); return res; } void inline Scs::operator/=(Scs &nb) { scs_div(&(this->scsnb), &(this->scsnb), &(nb.scsnb)); } void inline Scs::operator/=(const double nb) { Scs op; scs_set_d(&(op.scsnb), nb); scs_div(&(this->scsnb), &(this->scsnb), &(op.scsnb)); } /************* * COMPARISON *************/ inline bool operator==(Scs &nb1, Scs &nb2){ unsigned int i; bool b=1; for(i=0; i=(Scs &nb1, Scs &nb2){ return ((nb1.scsnb.exception.d >= nb2.scsnb.exception.d)&& (nb1.scsnb.sign >= nb2.scsnb.sign)&& ((nb1.scsnb.index > nb2.scsnb.index)|| ((nb1.scsnb.index == nb2.scsnb.index)&& (scs_cmp_mant(&(nb1.scsnb), &(nb2.scsnb))>=0)))); } inline bool operator<(Scs &nb1, Scs &nb2){ return ((nb1.scsnb.exception.d <= nb2.scsnb.exception.d)&& (nb1.scsnb.sign <= nb2.scsnb.sign)&& ((nb1.scsnb.index < nb2.scsnb.index)|| ((nb1.scsnb.index == nb2.scsnb.index)&& (scs_cmp_mant(&(nb1.scsnb), &(nb2.scsnb))<0)))); } inline bool operator>(Scs &nb1, Scs &nb2){ return ((nb1.scsnb.exception.d >= nb2.scsnb.exception.d)&& (nb1.scsnb.sign >= nb2.scsnb.sign)&& ((nb1.scsnb.index > nb2.scsnb.index)|| ((nb1.scsnb.index == nb2.scsnb.index)&& (scs_cmp_mant(&(nb1.scsnb), &(nb2.scsnb))>0)))); } /**************** * RANDOM NUMBER ****************/ inline Scs Scs::rand(void){ scs_rand(&(this->scsnb), 200); return *this; } /*************** * OUTPUT (in hexadecimal) ***************/ ostream &operator<<(ostream &os, const Scs &a){ Scs aa, p, zer; double d; char buffer[10]; int e, exposant; bool bb; if (a.scsnb.exception.d != 1.){ os << (double)a.scsnb.exception.d; }else { if (a.scsnb.sign == -1) os << '-'; aa = fabs(a); /* Compute the exposant in radix 16 */ d = ((a.scsnb.index)*SCS_NB_BITS)/4; e = 4*(int)floor(d); p = 1; p.scsnb.index = (int)floor(((double)e)/SCS_NB_BITS); p.scsnb.h_word[0] = 1 << e - p.scsnb.index*SCS_NB_BITS; exposant = (int)floor(d); p /= 16; exposant--; while(p <= aa){ p *= 16; exposant++; } p /= 16; exposant--; /* Extract digits */ aa = aa / p; sprintf(buffer,"%x", aa.scsnb.h_word[0]); os << buffer << "."; aa.scsnb.h_word[0] = 0; aa *= 16; bb = 1; while(bb){ sprintf(buffer,"%x", aa.scsnb.h_word[0]); os << buffer; aa.scsnb.h_word[0] = 0; aa *= 16; bb = 0; for(int i=0; i>(istream &is, Scs &a){ char c; int nd = 0; int point = -1; int ex; bool done = false; Scs r; r = 0; /* Skip any leading spaces */ do{ is>>c; }while (c == ' '); /* Read sign, digits, and exponent */ while (!done && (c != '\0')) { if (c >= '0' && c <= '9') { int d = c - '0'; r *= 10.0; r += d; nd++; } else { switch (c) { case '.': point = nd; break; case '-': case '+': if (nd > 0){ a = 0; done = true; point = -1; ex = 0; } a.scsnb.sign = (c == '-') ? -1 : 1; break; case 'E': case 'e': is >> ex; done = true; break; default: a = 0; done = true; point = -1; ex = 0; } } is>>c; } if (point >= 0) ex -= (nd - point); if (ex != 0) { if (ex > 0) for(int i=0; iex; i--) r *= inv_ten; } } } #endif interval-2.1.0/src/crlibm/scs_lib/zero_scs.c0000644000000000000000000000243313031036767017144 0ustar 00000000000000/** Function for setting an SCS number to zero @file zero_scs.c @author Defour David David.Defour@ens-lyon.fr @author Florent de Dinechin Florent.de.Dinechin@ens-lyon.fr This file is part of the SCS library. */ /* Copyright (C) 2002 David Defour and Florent de Dinechin This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include "scs.h" #include "scs_private.h" /** Set a SCS number to zero. There should be a few simple functions in this library. */ void inline scs_zero(scs_ptr result) { int i; for(i=0; i #include #include "trigo_accurate.h" /* * * 1) Range reduction if needed ... x in [-Pi/4, +Pi/4] * * 2) call cosine, sine or tan polynomial * * Polynomials are vastly too accurate. */ extern int rem_pio2_scs(scs_ptr, scs_ptr); /* Polynomial evaluation of sin(x) over [-Pi/4, +Pi/4] Approximation error lower than 2^(-133) */ static void scs_sin(scs_ptr x){ scs_t res_scs; scs_t x2; int i; scs_square(x2, x); scs_mul(res_scs, sin_scs_poly_ptr[0], x2); for(i=1; i<(DEGREE_SIN_SCS-1)/2; i++){ /* Last coeff is one, not read from the file*/ scs_add(res_scs, sin_scs_poly_ptr[i], res_scs); scs_mul(res_scs, res_scs, x2); } scs_mul(res_scs, res_scs, x); scs_add(x, x, res_scs); return; } /* Polynomial evaluation of cos(x) over [-Pi/4, +Pi/4] Approximation error lower than 2^(-128) */ static void scs_cos(scs_ptr x){ scs_t res_scs; scs_t x2; int i; scs_square(x2, x); scs_mul(res_scs, cos_scs_poly_ptr[0], x2); for(i=1; isign = -res_scs->sign; } } double scs_tan_rn(double x){ scs_t res_scs; double resd; #if EVAL_PERF crlibm_second_step_taken++; #endif scs_tan(x,res_scs); scs_get_d(&resd, res_scs); return resd; } double scs_tan_rd(double x){ scs_t res_scs; double resd; #if EVAL_PERF crlibm_second_step_taken++; #endif scs_tan(x,res_scs); scs_get_d_minf(&resd, res_scs); return resd; } double scs_tan_ru(double x){ scs_t res_scs; double resd; #if EVAL_PERF crlibm_second_step_taken++; #endif scs_tan(x,res_scs); scs_get_d_pinf(&resd, res_scs); return resd; } double scs_tan_rz(double x){ scs_t res_scs; double resd; #if EVAL_PERF crlibm_second_step_taken++; #endif scs_tan(x,res_scs); scs_get_d_zero(&resd, res_scs); return resd; } interval-2.1.0/src/crlibm/trigo_accurate.h0000644000000000000000000002742713031036767016711 0ustar 00000000000000/*File generated by maple/trigo.mpl*/ #include "crlibm.h" #include "crlibm_private.h" #define DEGREE_SIN_SCS 25 #define DEGREE_COS_SCS 26 #define DEGREE_TAN_SCS 69 #define sin_scs_poly_ptr (scs_ptr)&sin_scs_poly #define cos_scs_poly_ptr (scs_ptr)&cos_scs_poly #define tan_scs_poly_ptr (scs_ptr)&tan_scs_poly static const scs sin_scs_poly [13]= /* ~6.41304778336249081566343888442398912691656493764128e-26 */ {{{0x0000004f, 0x18f09e97, 0x212a5b47, 0x39f049a7, 0x3bd24b7b, 0x23af8e4a, 0x34d618d1, 0x013262b6}, DB_ONE, -3, 1 } , /* ~-3.86811532168049337542273735719002682824970072395874e-23 */ {{0x0000bb0c, 0x3cb17c1e, 0x37e81e1a, 0x37195774, 0x129a10ee, 0x1f4e5bd3, 0x14c6fde7, 0x15d2d8fd}, DB_ONE, -3, -1 } , /* ~1.95729405534209807707389556511391204655008788789058e-20 */ {{0x0171b8ee, 0x330c68b0, 0x185bd7cd, 0x085a8b04, 0x00c4a269, 0x38b64e54, 0x18d2c602, 0x292ac5c1}, DB_ONE, -3, 1 } , /* ~-8.22063524632359448147958406923548651998620031502275e-18 */ {{0x00000009, 0x1e9368cf, 0x32371688, 0x0021bd52, 0x19613de4, 0x2e9e92f1, 0x27c78771, 0x3f5cc281}, DB_ONE, -2, -1 } , /* ~2.81145725434540361996328805963492166242366185016172e-15 */ {{0x00000ca9, 0x18ee0615, 0x210b66bb, 0x339e7ef6, 0x2c29a154, 0x1f2d1a6e, 0x0dbea028, 0x1214063f}, DB_ONE, -2, 1 } , /* ~-7.64716373181981617151041618487160223947055132654927e-13 */ {{0x000d73f9, 0x3ce67703, 0x36256279, 0x0f1440e6, 0x24128080, 0x2e0c47a6, 0x27b32155, 0x2f115571}, DB_ONE, -2, -1 } , /* ~1.60590438368216145988717363310806625253064912470338e-10 */ {{0x0b092309, 0x350da12f, 0x24b28056, 0x31def2f9, 0x24044621, 0x074f188c, 0x3829c278, 0x09324bdd}, DB_ONE, -2, 1 } , /* ~-2.50521083854417187750515438912201232789985352336291e-08 */ {{0x0000001a, 0x399159fd, 0x144e38fe, 0x1d141fdb, 0x1666d4df, 0x1bf80c34, 0x17ad2747, 0x0566e4f9}, DB_ONE, -1, -1 } , /* ~2.75573192239858906525573188629015139728734265040299e-06 */ {{0x00000b8e, 0x3c74aad8, 0x399c7d56, 0x03906123, 0x2a904384, 0x14010ddd, 0x155495d5, 0x0daca530}, DB_ONE, -1, 1 } , /* ~-1.98412698412698412698412698411505245319877050168798e-04 */ {{0x00034034, 0x00d00d00, 0x34034034, 0x00d006ce, 0x348eca38, 0x3f5dd48f, 0x205a5108, 0x07e84299}, DB_ONE, -1, -1 } , /* ~8.33333333333333333333333333333331789325780263439286e-03 */ {{0x00888888, 0x22222222, 0x08888888, 0x2222220d, 0x270976f8, 0x08cd270c, 0x22fa3253, 0x22fd1924}, DB_ONE, -1, 1 } , /* ~-1.66666666666666666666666666666666666633597567091248e-01 */ {{0x0aaaaaaa, 0x2aaaaaaa, 0x2aaaaaaa, 0x2aaaaaaa, 0x27da7c46, 0x26422150, 0x2f255a8c, 0x055ff185}, DB_ONE, -1, -1 } , /* ~1.00000000000000000000000000000000000000000000000000e+00 */ {{0x00000001, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 } }; static const scs cos_scs_poly [14]= /* ~-2.46647929292600518676295332824511712550323986955787e-27 */ {{{0x00000003, 0x036a24af, 0x0b960021, 0x36ab92b4, 0x251cbcb3, 0x24a97fbb, 0x175c8edb, 0x26ff1299}, DB_ONE, -3, -1 } , /* ~1.61171432886064441126907703621370209480774221167915e-24 */ {{0x000007cb, 0x0d2a2e99, 0x10f8748e, 0x389f34e6, 0x2313bd8f, 0x20be0984, 0x333a6d8e, 0x1b807806}, DB_ONE, -3, 1 } , /* ~-8.89679115256512652448661798519024218223622120108391e-22 */ {{0x0010ce39, 0x1987726f, 0x1eea7e37, 0x1ddf4cfa, 0x1ec5b5c4, 0x120cb52e, 0x37c988dc, 0x0a3377ba}, DB_ONE, -3, -1 } , /* ~4.11031762315246203111669239627818651812500805916919e-19 */ {{0x1e542ba3, 0x3f3c9ecf, 0x00267a43, 0x134ef26e, 0x1ff9a381, 0x26109691, 0x3d30a560, 0x223f772e}, DB_ONE, -3, 1 } , /* ~-1.56192069685855088499658490258665358909888204805953e-16 */ {{0x000000b4, 0x04f0c772, 0x3e3a3149, 0x04b97d58, 0x13ea02e8, 0x370088b3, 0x212bb00b, 0x06497545}, DB_ONE, -2, -1 } , /* ~4.77947733238738507613572564831414572436923450558343e-14 */ {{0x0000d73f, 0x27ce6770, 0x0f5c0984, 0x0a909e14, 0x043eaabb, 0x3925da80, 0x0d2bb88b, 0x1b8d9c50}, DB_ONE, -2, 1 } , /* ~-1.14707455977297247133847313888206952874744927320517e-11 */ {{0x00c9cba5, 0x1180f93a, 0x1053f6e9, 0x07a12245, 0x25d6d8fe, 0x0183a89f, 0x11fe0ecc, 0x116ceaf8}, DB_ONE, -2, -1 } , /* ~2.08767569878680989792094302574029159968587056449638e-09 */ {{0x00000002, 0x0f76c77f, 0x31b12f6a, 0x226bf583, 0x38324c53, 0x0bebff35, 0x1d8aa929, 0x0902e04a}, DB_ONE, -1, 1 } , /* ~-2.75573192239858906525573186252547032413218294797050e-07 */ {{0x00000127, 0x393edde2, 0x1f5c72ef, 0x005b3093, 0x064ee888, 0x10be8aa5, 0x3b5ca412, 0x36d45cbe}, DB_ONE, -1, -1 } , /* ~2.48015873015873015873015873012641551756418143632119e-05 */ {{0x00006806, 0x201a01a0, 0x06806806, 0x2019fff2, 0x243ec0f6, 0x3857f8fc, 0x1e36a7c0, 0x0c2c43d2}, DB_ONE, -1, 1 } , /* ~-1.38888888888888888888888888888887982865405653380695e-03 */ {{0x0016c16c, 0x05b05b05, 0x2c16c16c, 0x05b05af9, 0x29545050, 0x0f1975d1, 0x0cc59466, 0x3fbcae72}, DB_ONE, -1, -1 } , /* ~4.16666666666666666666666666666666665668698162855937e-02 */ {{0x02aaaaaa, 0x2aaaaaaa, 0x2aaaaaaa, 0x2aaaaaaa, 0x222d48a2, 0x0e242eac, 0x1247b316, 0x3b9fbfe1}, DB_ONE, -1, 1 } , /* ~-4.99999999999999999999999999999999999999817875826704e-01 */ {{0x1fffffff, 0x3fffffff, 0x3fffffff, 0x3fffffff, 0x3ffc089f, 0x2c68799b, 0x0b48bbde, 0x2ea8aa51}, DB_ONE, -1, -1 } , /* ~1.00000000000000000000000000000000000000000000000000e+00 */ {{0x00000001, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 } }; static const scs tan_scs_poly [35]= /* ~4.19304248008015673367346745301068970533039252359331e-12 */ {{{0x0049c3c8, 0x3614b771, 0x24336d30, 0x18260f52, 0x1c63a612, 0x3c9708b1, 0x2c030207, 0x3b60a762}, DB_ONE, -2, 1 } , /* ~-3.36706575103240667705547059415226434034305176587654e-11 */ {{0x02505729, 0x078bbff7, 0x277b7292, 0x2ae76500, 0x3326025d, 0x0785010a, 0x2e88ed52, 0x23a7933a}, DB_ONE, -2, -1 } , /* ~1.37767867318476248799250258961217380776040310955523e-10 */ {{0x0977a350, 0x3804d188, 0x2d3b121c, 0x3b0228d8, 0x002a8c44, 0x2d5dfc73, 0x2507d88e, 0x3cfff02b}, DB_ONE, -2, 1 } , /* ~-3.65061594065798937565902299436877921270308616808248e-10 */ {{0x19163b42, 0x137d2c1b, 0x19fd92a2, 0x1d367da1, 0x28a08aa6, 0x19489cc8, 0x2fbf37c1, 0x2a39fb53}, DB_ONE, -2, -1 } , /* ~7.07244120811389943078195053689224634883725238108269e-10 */ {{0x3099f85b, 0x38f9459b, 0x195e2a8d, 0x3797159c, 0x34148387, 0x3b401948, 0x1983fd31, 0x184ad9fd}, DB_ONE, -2, 1 } , /* ~-1.04501041542939812062419752159269710100683051724611e-09 */ {{0x00000001, 0x07d00484, 0x1f25e4fe, 0x34768b93, 0x3b55eb65, 0x12227622, 0x04fedebc, 0x2e961f5c}, DB_ONE, -1, -1 } , /* ~1.25002445075359892223710684907004440385587934042993e-09 */ {{0x00000001, 0x15e6a9a6, 0x23b954f6, 0x248f5fba, 0x38fabeaf, 0x059e710a, 0x3e68659e, 0x08f9d054}, DB_ONE, -1, 1 } , /* ~-1.17970967862051201631515521131934092286748635204441e-09 */ {{0x00000001, 0x1111ac11, 0x2b29b510, 0x0408b38c, 0x29617027, 0x289298c6, 0x2fe4c001, 0x34903af7}, DB_ONE, -1, -1 } , /* ~1.01504782471787319555323236139271916057005781543881e-09 */ {{0x00000001, 0x05c0e901, 0x1495b536, 0x3d0dceff, 0x11d27769, 0x314f4319, 0x2adb4907, 0x04581607}, DB_ONE, -1, 1 } , /* ~-5.23224716917514023729869567637974110005720667650098e-10 */ {{0x23f4aaa3, 0x3810e7e3, 0x377f317c, 0x118eb173, 0x271248c9, 0x0dc34f76, 0x38c69c1a, 0x1715bf81}, DB_ONE, -2, -1 } , /* ~6.84075783927905363651245539376244733085133140080869e-10 */ {{0x2f026372, 0x048fabda, 0x157f9376, 0x1ee01201, 0x1d337305, 0x3277dac2, 0x0388ddbb, 0x1e444286}, DB_ONE, -2, 1 } , /* ~5.90392308289226882244924529214622620104906585387600e-10 */ {{0x28924a94, 0x186459bd, 0x07f03e85, 0x3c711128, 0x3ae6e0c9, 0x1e84f311, 0x3d3d9fe2, 0x186b0f23}, DB_ONE, -2, 1 } , /* ~1.97885803554882259263714586727843568959917519849302e-09 */ {{0x00000002, 0x07fc704f, 0x2fe41d64, 0x39e487cf, 0x184c49c2, 0x0bee9906, 0x1478fbed, 0x3b189f6a}, DB_ONE, -1, 1 } , /* ~4.66924357822849164083933883654466829463908058807791e-09 */ {{0x00000005, 0x00de33a3, 0x25923c9c, 0x2ca62cba, 0x20bdef99, 0x128b5ff5, 0x3fc900ea, 0x04ca7a66}, DB_ONE, -1, 1 } , /* ~1.15959738194320052411880314174946234008645186820135e-08 */ {{0x0000000c, 0x1cde875f, 0x11fe6b7a, 0x1bf8f0ee, 0x1fdaf92d, 0x3db0bd62, 0x15f329f2, 0x1aaaa7de}, DB_ONE, -1, 1 } , /* ~2.85891620102917727867302985486597414498702504078098e-08 */ {{0x0000001e, 0x2ca1db60, 0x16b02396, 0x27782b2d, 0x13c68dde, 0x28c97a48, 0x1971af0d, 0x190791d2}, DB_ONE, -1, 1 } , /* ~7.05468704925032913074778071743586293193594984535199e-08 */ {{0x0000004b, 0x2ff1aba9, 0x215c7e5f, 0x0ec7c100, 0x29f9ff6e, 0x0f5a5e50, 0x1b028faf, 0x24fd23e7}, DB_ONE, -1, 1 } , /* ~1.74066092089222113091708523795806369314584635744294e-07 */ {{0x000000ba, 0x39bb1378, 0x228e6aab, 0x1cd5a3f6, 0x0df50eb5, 0x2fe1339f, 0x3bf44406, 0x0623c42c}, DB_ONE, -1, 1 } , /* ~4.29491124040745236871063166723486418908614935914252e-07 */ {{0x000001cd, 0x0a67c230, 0x15e26fde, 0x2d6f2ed2, 0x1e5d5eed, 0x13306d09, 0x2bc7fd07, 0x3e19f2db}, DB_ONE, -1, 1 } , /* ~1.05972682972071952486859820141805093442802320377425e-06 */ {{0x00000471, 0x37df8b71, 0x36c6ae8b, 0x247f572b, 0x11ae0684, 0x2c9d50b0, 0x3b8c1296, 0x142cbe10}, DB_ONE, -1, 1 } , /* ~2.61477115156382799612950555257222875670856895150216e-06 */ {{0x00000af7, 0x25b48fd7, 0x22f9b7b5, 0x1bf47d23, 0x2d5e7cb4, 0x29eec735, 0x12e994fc, 0x38f234bd}, DB_ONE, -1, 1 } , /* ~6.45168921562814305334220557964389527562662181436031e-06 */ {{0x00001b0f, 0x1cb4fb69, 0x3117e917, 0x2d08cb65, 0x3ed33963, 0x11bb69f4, 0x0b13ad8f, 0x2ed16814}, DB_ONE, -1, 1 } , /* ~1.59189050693312274383546286106716190276142802345865e-05 */ {{0x000042c4, 0x32d39a62, 0x3b08d8b5, 0x1a0a769d, 0x102ec25d, 0x27c1ccb1, 0x2d7c3ac9, 0x1484f03b}, DB_ONE, -1, 1 } , /* ~3.92783238833166802364700496685053984935780264819631e-05 */ {{0x0000a4be, 0x31dd44a4, 0x21406dec, 0x00d8ae9b, 0x263ef3ac, 0x26d69803, 0x1d7f349d, 0x2a7a1ff7}, DB_ONE, -1, 1 } , /* ~9.69153795692945116999068122084400485954578423200626e-05 */ {{0x0001967e, 0x062bf2be, 0x2d29a81a, 0x3528530a, 0x2be09523, 0x150ffb17, 0x1543b0ee, 0x2e51e70c}, DB_ONE, -1, 1 } , /* ~2.39129114243552481118447657590127606492827347439830e-04 */ {{0x0003eafa, 0x3b9a68b3, 0x083c6556, 0x3c8a24a1, 0x2485ea61, 0x0e5b9b2c, 0x2d16e9ba, 0x0700d411}, DB_ONE, -1, 1 } , /* ~5.90027440945585981390430768333505444797856150283712e-04 */ {{0x0009aac1, 0x09006ce8, 0x229156e9, 0x1010a671, 0x167b367e, 0x02d471c6, 0x33700cd8, 0x180a5404}, DB_ONE, -1, 1 } , /* ~1.45583438705131826824917380276818501608784487595954e-03 */ {{0x0017da36, 0x114add78, 0x2b6a1c11, 0x39bc050b, 0x1fa62cde, 0x202525f2, 0x06797d2e, 0x188697d8}, DB_ONE, -1, 1 } , /* ~3.59212803657248101692546700427010326668047642683335e-03 */ {{0x003ada7a, 0x070abeef, 0x36bf9822, 0x114b4de5, 0x29c19548, 0x21cff3b2, 0x1b67ac39, 0x3afe7677}, DB_ONE, -1, 1 } , /* ~8.86323552990219656886323546095947145451052636633979e-03 */ {{0x0091371a, 0x2bcd8479, 0x07ada8e1, 0x2d73a327, 0x39d10b36, 0x2a1371ab, 0x10b30f6e, 0x139bddaa}, DB_ONE, -1, 1 } , /* ~2.18694885361552028218694885366767472933069912253187e-02 */ {{0x01664f48, 0x20b043e7, 0x332d6bba, 0x1281f45d, 0x05c107b1, 0x0b2e1a96, 0x378ae51e, 0x2c9d2be3}, DB_ONE, -1, 1 } , /* ~5.39682539682539682539682539682518643701644736548166e-02 */ {{0x03743743, 0x1d0dd0dd, 0x03743743, 0x1d0dc5f0, 0x20d05868, 0x240b23be, 0x38da29df, 0x3866f03c}, DB_ONE, -1, 1 } , /* ~1.33333333333333333333333333333333336718465844517559e-01 */ {{0x08888888, 0x22222222, 0x08888888, 0x22222226, 0x288230ee, 0x27ff32df, 0x1b2f8f82, 0x12608ad5}, DB_ONE, -1, 1 } , /* ~3.33333333333333333333333333333333333332426548650668e-01 */ {{0x15555555, 0x15555555, 0x15555555, 0x15555555, 0x154195d6, 0x3f2e970a, 0x24a360e2, 0x3f8caf8e}, DB_ONE, -1, 1 } , /* ~1.00000000000000000000000000000000000000000000000000e+00 */ {{0x00000001, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000}, DB_ONE, 0, 1 } }; interval-2.1.0/src/crlibm/trigo_fast.c0000644000000000000000000010735313031036767016047 0ustar 00000000000000/* * Correctly rounded trigonometric functions * * Author : Catherine Daramy, Florent de Dinechin, David Defour * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include #include #include "crlibm.h" #include "crlibm_private.h" #include "trigo_fast.h" extern double scs_sin_rn(double); extern double scs_sin_ru(double); extern double scs_sin_rd(double); extern double scs_sin_rz(double); extern double scs_cos_rn(double); extern double scs_cos_ru(double); extern double scs_cos_rd(double); extern double scs_cos_rz(double); extern double scs_tan_rn(double); extern double scs_tan_rd(double); extern double scs_tan_ru(double); extern double scs_tan_rz(double); extern int rem_pio2_scs(scs_ptr, scs_ptr); /* How these functions work: The trig range reduction in crlibm computes an integer k and a reduced argument y such that x = k.Pi/256 + y with the reduced argument y directly in -Pi/512, Pi/512. (Pi/512 < 4/512 = 2^-7) y is computed as a double-double yh+yl Then we read off a table sah+sal ~ sin(kPi/256) cah+cal ~ cos(kPi/256) and we use the reconstruction sin(kPi/256 + y) = sin(kPi/256)cos(y) + cos(kPi/256)sin(y) cos(kPi/256 + y) = cos(kPi/256)cos(y) - sin(kPi/256)sin(y) where cos(y) and sin(y) are computed as unevaluated 1+tc and (yh+yl)(1+ts) respectively, where tc and ts are doubles resulting from a small polynomial approximation. This gives 14 extra bits of accuracy, so this first step is very accurate. Why not use accurate tables as defined by Gal ? In short, because Gal's fast approach only gives as many additiona bits as you've got to address the table (so we are limited to 7 if we limit the table size to 4KB), and we need more to have a good average performance. From a performance point of view we probably lose a few cycles: There is 4 values to read in our scheme compared to 3 in Gal's method. The reconstruction costs a few floating-point operations more (not that many, if you look in details and want to ensure more than 7 extra bits). Now for the advantages: 1/ The whole thing is simpler 2/ We have much more accuracy in the table, which simplifies the proof. 3/ We will be able to reuse the same table values to speed up the second step (just tabulating a third double such that the three-double approx of sin/cos(kPi/256) will be summed exactly into an SCS number) Now a word on range reduction: We have 4 possible range reductions: Cody and Waite with 2 constants (the fastest) Cody and Waite with 3 constants (almost as fast) Cody and Waite with 3 constants in double-double and k a long-long int Payne and Hanek, implemented in SCS (the slowest). Each of these range reductions except Payne and Hanek is valid for x smaller than some bound. This range reduction may cancel up to 62 bits according to a program by Kahan/Douglas available in Muller's book and implemented as function WorstCaseForAdditiveRangeReduction in common-procedures.mpl However this is not a concern unless x is close to a multiple of Pi/2 (that is k&127==0): in the general case the reconstruction will add a tabulated non-zero value, so the error to consider in the range reduction is the absolute error. Only in the cases when k&127==0 do we need to have 62 extra bits to compute with. This is ensured by using a slower, more accurate range reduction. This test for k&127==0 actually speeds up even these cases, because in these cases there is no table to read and no reconstruction to do : a simple approximation to the function suffices. Why not use Payne and Hanek only as in Markstein's book ? Because our scheme, in the absence of FMA, is much faster for small values which are the most used. Markstein takes as reduced argument the fractional part of x*256/Pi, (or maybe it's 512 in his case), so he's got the same tables as we have, but different polynomials (which compute sin(2Pi*y) and cos(2Pi*y). */ #define DEBUG 0 /* TODO: - in the Cody and Waite, the kd=double(k) should be replaced with a single substraction of the magic number of Double2Int - In some Cody and Waite there are Mul12 involving k, CH and CM. They can be improved by pre-splitting CH, CM (tabulated values) and k (as an int) Then you can improve the precision by taking kmax into account - The first coefficient of the cosine polynomial is equal exactly to 1/2 and this should be modified in order to increase to accuracy of the approximation. - The second step should get the reduced argument from the first step (and use the same argument reduction). This should lead to 5x improvement of the worst case. - in the tangent there are three steps. This could be studied for the other functions */ static int rem_pio256_scs(scs_ptr result, const scs_ptr x){ uint64_t r[SCS_NB_WORDS+3], tmp; unsigned int N; /* result r[0],...,r[10] could store till 300 bits of precision */ /* that is really enough for computing the reduced argument */ int sign, i, j, ind; int *digits_256_over_pi_pt; if ((X_EXP != 1)||(X_IND < -2)){ scs_set(result, x); return 0; } /* Compute the product |x| * 256/Pi */ if ((X_IND == -2)){ r[0] = 0; r[1] = 0; r[2] = (uint64_t)(digits_256_over_pi[0]) * X_HW[0]; r[3] = ((uint64_t)(digits_256_over_pi[0]) * X_HW[1] +(uint64_t)(digits_256_over_pi[1]) * X_HW[0]); if(X_HW[2] == 0){ for(i=4; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(digits_256_over_pi[i-3]) * X_HW[1] +(uint64_t)(digits_256_over_pi[i-2]) * X_HW[0]); }}else { for(i=4; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(digits_256_over_pi[i-4]) * X_HW[2] +(uint64_t)(digits_256_over_pi[i-3]) * X_HW[1] +(uint64_t)(digits_256_over_pi[i-2]) * X_HW[0]); } } }else { if (X_IND == -1){ r[0] = 0; r[1] = (uint64_t)(digits_256_over_pi[0]) * X_HW[0]; r[2] = ((uint64_t)(digits_256_over_pi[0]) * X_HW[1] +(uint64_t)(digits_256_over_pi[1]) * X_HW[0]); if(X_HW[2] == 0){ for(i=3; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(digits_256_over_pi[i-2]) * X_HW[1] +(uint64_t)(digits_256_over_pi[i-1]) * X_HW[0]); }}else { for(i=3; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(digits_256_over_pi[i-3]) * X_HW[2] +(uint64_t)(digits_256_over_pi[i-2]) * X_HW[1] +(uint64_t)(digits_256_over_pi[i-1]) * X_HW[0]); }} }else { if (X_IND == 0){ r[0] = (uint64_t)(digits_256_over_pi[0]) * X_HW[0]; r[1] = ((uint64_t)(digits_256_over_pi[0]) * X_HW[1] +(uint64_t)(digits_256_over_pi[1]) * X_HW[0]); if(X_HW[2] == 0){ for(i=2; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(digits_256_over_pi[i-1]) * X_HW[1] +(uint64_t)(digits_256_over_pi[ i ]) * X_HW[0]); }}else { for(i=2; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(digits_256_over_pi[i-2]) * X_HW[2] +(uint64_t)(digits_256_over_pi[i-1]) * X_HW[1] +(uint64_t)(digits_256_over_pi[ i ]) * X_HW[0]); }} }else { if (X_IND == 1){ r[0] = ((uint64_t)(digits_256_over_pi[0]) * X_HW[1] +(uint64_t)(digits_256_over_pi[1]) * X_HW[0]); if(X_HW[2] == 0){ for(i=1; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(digits_256_over_pi[ i ]) * X_HW[1] +(uint64_t)(digits_256_over_pi[i+1]) * X_HW[0]); }}else { for(i=1; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(digits_256_over_pi[i-1]) * X_HW[2] +(uint64_t)(digits_256_over_pi[ i ]) * X_HW[1] +(uint64_t)(digits_256_over_pi[i+1]) * X_HW[0]); }} }else { ind = (X_IND - 2); digits_256_over_pi_pt = (int*)&(digits_256_over_pi[ind]); if(X_HW[2] == 0){ for(i=0; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(digits_256_over_pi_pt[i+1]) * X_HW[1] +(uint64_t)(digits_256_over_pi_pt[i+2]) * X_HW[0]); }}else { for(i=0; i<(SCS_NB_WORDS+3); i++){ r[i] = ((uint64_t)(digits_256_over_pi_pt[ i ]) * X_HW[2] +(uint64_t)(digits_256_over_pi_pt[i+1]) * X_HW[1] +(uint64_t)(digits_256_over_pi_pt[i+2]) * X_HW[0]); } } } } } } /* Carry propagate */ r[SCS_NB_WORDS+1] += r[SCS_NB_WORDS+2]>>30; for(i=(SCS_NB_WORDS+1); i>0; i--) {tmp=r[i]>>30; r[i-1] += tmp; r[i] -= (tmp<<30);} /* The integer part is in r[0] */ N = r[0]; if (r[1] > (SCS_RADIX)/2){ /* test if the reduced part is bigger than Pi/4 */ N += 1; sign = -1; for(i=1; i<(SCS_NB_WORDS+3); i++) { r[i]=((~(unsigned int)(r[i])) & 0x3fffffff);} } else sign = 1; /* Now we get the reduced argument and check for possible * cancellation. By Kahan algorithm we will have at most 2 digits * of cancellations, r[1] and r[2] in the worst case. */ if (r[1] == 0) if (r[2] == 0) i = 3; else i = 2; else i = 1; for(j=0; jx); \ k= rem_pio256_scs(Y, X); \ index=(k&127)<<2; \ quadrant = (k>>7)&3; \ x0 = (double)(Y->h_word[0]); \ x1 = ((double)(Y->h_word[1])) * SHIFT1; \ x2 = ((double)(Y->h_word[2])) * SHIFT2; \ x3 = ((double)(Y->h_word[3])) * SHIFT3; \ nb.i[HI] = ((Y->index)*SCS_NB_BITS +1023) << 20; \ nb.i[LO] = 0; \ nb.d *= Y->sign; \ yh=(x2+x1)+x0; \ yl=(((x0-yh)+x1)+x2) + x3; \ yh *= nb.d; /* exact multiplication */ \ yl *= nb.d; /* exact multiplication */ \ }while(0) /* A structure that holds all the information to be exchanged between ComputeTrigWithArgred and the 12 functions sin_rn etc It is purely for performance (almost 100 cycles out of 300 on a P4 when compared to passing a list of arguments). In addition to saving a few memory accesses, it also allows other small optimizations like deferring the possible change of sign of the result to the the last moment using rri->changesign. All this is not very elegant, but it is safe. */ struct rrinfo_s {double rh; double rl; double x; int absxhi; int function;} ; typedef struct rrinfo_s rrinfo; #define changesign function /* saves one int in the rrinfo structure */ static void ComputeTrigWithArgred(rrinfo *rri){ double sah,sal,cah,cal, yh, yl, yh2, ts,tc, kd; double kch_h,kch_l, kcm_h,kcm_l, th, tl,sh,sl,ch,cl; int k, quadrant, index; int64_t kl; if (rri->absxhi < XMAX_CODY_WAITE_3) { /* Compute k, deduce the table index and the quadrant */ #if 0 DOUBLE2INT(k, rri->x * INV_PIO256); kd = (double) k; #else {db_number _t; double _d = rri->x * INV_PIO256; _t.d = (_d+6755399441055744.0); k = _t.i[LO]; kd=_t.d-6755399441055744.0; } #endif quadrant = (k>>7)&3; index=(k&127)<<2; if((index == 0)) { /* Here a large cancellation on yh+yl would be a problem, so use double-double RR */ /* all this is exact */ Mul12(&kch_h, &kch_l, kd, RR_DD_MCH); Mul12(&kcm_h, &kcm_l, kd, RR_DD_MCM); Add12 (th,tl, kch_l, kcm_h) ; /* only rounding error in the last multiplication and addition */ Add22 (&yh, &yl, (rri->x + kch_h) , (kcm_l - kd*RR_DD_CL), th, tl) ; goto computeZero; } else { /* index <> 0, don't worry about cancellations on yh+yl */ if (rri->absxhi < XMAX_CODY_WAITE_2) { /* CW 2: all this is exact but the rightmost multiplication */ Add12 (yh,yl, (rri->x - kd*RR_CW2_CH), (kd*RR_CW2_MCL) ) ; } else { /* CW 3: all this is exact but the rightmost multiplication */ Add12Cond(yh,yl, (rri->x - kd*RR_CW3_CH) - kd*RR_CW3_CM, kd*RR_CW3_MCL); } } goto computeNotZero; } else if ( rri->absxhi < XMAX_DDRR ) { /* x sufficiently small for a Cody and Waite in double-double */ DOUBLE2LONGINT(kl, rri->x*INV_PIO256); kd=(double)kl; quadrant = (kl>>7)&3; index=(kl&127)<<2; if(index == 0) { /* Here again a large cancellation on yh+yl would be a problem, so we do the accurate range reduction */ RangeReductionSCS(); /*recomputes k, index, quadrant, and yh and yl*/ /* Now it may happen that the new k differs by 1 of kl, so check that */ if(index==0) /* no surprise */ goto computeZero; else goto computeNotZero; } else { /* index<>0 : double-double argument reduction*/ /* all this is exact */ Mul12(&kch_h, &kch_l, kd, RR_DD_MCH); Mul12(&kcm_h, &kcm_l, kd, RR_DD_MCM); Add12 (th,tl, kch_l, kcm_h) ; /* only rounding error in the last multiplication and addition */ Add22 (&yh, &yl, (rri->x + kch_h) , (kcm_l - kd*RR_DD_CL), th, tl) ; // printf("%f\n", yh); goto computeNotZero; } } /* closes if ( absxhi < XMAX_DDRR ) */ else { /* Worst case : x very large, sin(x) probably meaningless, we return correct rounding but do't mind taking time for it */ RangeReductionSCS(); quadrant = (k>>7)&3; if(index == 0) goto computeZero; else goto computeNotZero; } computeZero: switch(rri->function) { case SIN: if (quadrant&1) DoCosZero(&rri->rh, &rri->rl); else DoSinZero(&rri->rh, &rri->rl); rri->changesign=(quadrant==2)||(quadrant==3); return; case COS: if (quadrant&1) DoSinZero(&rri->rh, &rri->rl); else DoCosZero(&rri->rh, &rri->rl); rri->changesign= (quadrant==1)||(quadrant==2); return; case TAN: rri->changesign = quadrant&1; if (quadrant&1) { DoSinZero(&ch, &cl); DoCosZero(&sh, &sl); } else { DoSinZero(&sh, &sl); DoCosZero(&ch, &cl); } Div22(&rri->rh, &rri->rl, sh, sl, ch, cl); return; } computeNotZero: if(index<=(64<<2)) { sah=sincosTable[index+0].d; /* sin(a), high part */ sal=sincosTable[index+1].d; /* sin(a), low part */ cah=sincosTable[index+2].d; /* cos(a), high part */ cal=sincosTable[index+3].d; /* cos(a), low part */ }else { /* cah <= sah */ index=(128<<2) - index; cah=sincosTable[index+0].d; /* cos(a), high part */ cal=sincosTable[index+1].d; /* cos(a), low part */ sah=sincosTable[index+2].d; /* sin(a), high part */ sal=sincosTable[index+3].d; /* sin(a), low part */ } yh2 = yh*yh ; ts = yh2 * (s3.d + yh2*(s5.d + yh2*s7.d)); tc = yh2 * (c2.d + yh2*(c4.d + yh2*c6.d )); switch(rri->function) { case SIN: if (quadrant&1) DoCosNotZero(&rri->rh, &rri->rl); else DoSinNotZero(&rri->rh, &rri->rl); rri->changesign=(quadrant==2)||(quadrant==3); return; case COS: if (quadrant&1) DoSinNotZero(&rri->rh, &rri->rl); else DoCosNotZero(&rri->rh, &rri->rl); rri->changesign=(quadrant==1)||(quadrant==2); return; case TAN: rri->changesign = quadrant&1; if (quadrant&1) { DoSinNotZero(&ch, &cl); DoCosNotZero(&sh, &sl); } else { DoSinNotZero(&sh, &sl); DoCosNotZero(&ch, &cl); } Div22(&rri->rh, &rri->rl, sh, sl, ch, cl); return; } } /************************************************************* ************************************************************* * SIN ROUNDED TO NEAREST * ************************************************************* *************************************************************/ double sin_rn(double x){ double ts,x2,rncst; rrinfo rri; db_number x_split; double r; x_split.d=x; rri.absxhi = x_split.i[HI] & 0x7fffffff; /* SPECIAL CASES: x=(Nan, Inf) sin(x)=Nan */ if (rri.absxhi>=0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } else if (rri.absxhi < XMAX_SIN_CASE2){ /* CASE 1 : x small enough sin(x)=x */ if (rri.absxhi =0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_SIN_CASE2){ /* CASE 1 : x small enough, return x suitably rounded */ if (rri.absxhi =0.) return x; else { x_split.l --; return x_split.d; } } else { /* CASE 2 : x < Pi/512 Fast polynomial evaluation */ xx = x*x; ts = x * xx * (s3.d + xx*(s5.d + xx*s7.d )); Add12(rri.rh,rri.rl, x, ts); epsilon=EPS_SIN_CASE2; } } else { /* CASE 3 : Need argument reduction */ rri.x=x; rri.function=SIN; ComputeTrigWithArgred(&rri); epsilon=EPS_SINCOS_CASE3; if(rri.changesign) { rri.rh = -rri.rh; rri.rl = -rri.rl; } } TEST_AND_RETURN_RU(rri.rh, rri.rl, epsilon); /* if the previous block didn't return a value, launch accurate phase */ return scs_sin_ru(x); } /************************************************************* ************************************************************* * SIN ROUNDED TOWARD -INFINITY * ************************************************************* *************************************************************/ double sin_rd(double x){ double xx, ts, epsilon; db_number x_split; rrinfo rri; x_split.d=x; rri.absxhi = x_split.i[HI] & 0x7fffffff; /* SPECIAL CASES: x=(Nan, Inf) sin(x)=Nan */ if (rri.absxhi>=0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_SIN_CASE2){ /* CASE 1 : x small enough, return x suitably rounded */ if (rri.absxhi =0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_SIN_CASE2){ /* CASE 1 : x small enough, return x suitably rounded */ if (rri.absxhi =0x7ff00000) { /* was : return x-x; but it's optimized out by Intel compiler (bug reported). Who cares to be slow in this case anyway... */ x_split.l=0xfff8000000000000LL; return x_split.d-x_split.d; } if (rri.absxhi < XMAX_COS_CASE2){ /* CASE 1 : x small enough cos(x)=1. */ if (rri.absxhi =0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_COS_CASE2){ /* CASE 1 : x small enough cos(x)=1. */ if (rri.absxhi =0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_COS_CASE2){ if (x==0) return 1; /* CASE 1 : x small enough cos(x)=1. */ if (rri.absxhi =0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_COS_CASE2){ if (x==0) return 1; /* CASE 1 : x small enough cos(x)=1. */ if (rri.absxhi =0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_TAN_CASE2){ if (rri.absxhi < XMAX_RETURN_X_FOR_TAN) return x; /* Dynamic computation of the rounding constant */ rndcst.i[HI] = 0x3ff00000 + (((rri.absxhi & 0x000fffff)+0x00100000) >> (0x3ff+2 - (rri.absxhi>>20))) ; rndcst.i[LO] =0xffffffff; /* Fast Taylor series */ x2 = x*x; p5 = t5.d + x2*(t7.d + x2*(t9.d + x2*t11.d)); tt = x2*(t3h.d + (t3l.d + x2*p5)); Add12(rri.rh, rri.rl, x, x*tt); /* Test if round to nearest achieved */ if(rri.rh == (rri.rh + (rri.rl * rndcst.d))) return rri.rh; else return scs_tan_rn(x); } else { /* Otherwise : Range reduction then standard evaluation */ rri.x=x; rri.function=TAN; ComputeTrigWithArgred(&rri); /* Test if round to nearest achieved */ if(rri.rh == (rri.rh + (rri.rl * RN_CST_TAN_CASE3))) if(rri.changesign) return -rri.rh; else return rri.rh; else return scs_tan_rn(x); } } /************************************************************* ************************************************************* * ROUNDED TOWARD +INFINITY ************************************************************* *************************************************************/ double tan_ru(double x){ double epsilon, p5, tt, x2; db_number x_split; rrinfo rri; x_split.d=x; rri.absxhi = x_split.i[HI] & 0x7fffffff; /* SPECIAL CASES: x=(Nan, Inf) cos(x)=Nan */ if (rri.absxhi>=0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_TAN_CASE2){ if (rri.absxhi < XMAX_RETURN_X_FOR_TAN) { if(x<=0.) return x; else { x_split.l ++; return x_split.d; } } else { /* Fast Taylor series */ x2 = x*x; p5 = t5.d + x2*(t7.d + x2*(t9.d + x2*t11.d)); tt = x2*(t3h.d + (t3l.d +x2*p5)); Add12(rri.rh, rri.rl, x, x*tt); /* TODO dynamic computation of error constant */ TEST_AND_RETURN_RU(rri.rh, rri.rl, EPS_TAN_CASE2); /* if the previous block didn't return a value, launch accurate phase */ return scs_tan_ru(x); } } else { /* Normal case: Range reduction then standard evaluation */ rri.x=x; rri.function=TAN; ComputeTrigWithArgred(&rri); epsilon=EPS_TAN_CASE3; if(rri.changesign) { rri.rh= -rri.rh; rri.rl=-rri.rl; } } TEST_AND_RETURN_RU(rri.rh, rri.rl, epsilon); /* if the previous block didn't return a value, launch accurate phase */ return scs_tan_ru(x); } /************************************************************* ************************************************************* * ROUNDED TOWARD -INFINITY ************************************************************* *************************************************************/ double tan_rd(double x){ double epsilon, p5, tt, x2; rrinfo rri; db_number x_split; x_split.d=x; rri.absxhi = x_split.i[HI] & 0x7fffffff; /* SPECIAL CASES: x=(Nan, Inf) cos(x)=Nan */ if (rri.absxhi>=0x7ff00000){ x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_TAN_CASE2){ if (rri.absxhi < XMAX_RETURN_X_FOR_TAN) { if(x>=0.) return x; else { x_split.l ++; return x_split.d; } } /* Fast Taylor series */ x2 = x*x; p5 = t5.d + x2*(t7.d + x2*(t9.d + x2*t11.d)); tt = x2*(t3h.d + (t3l.d +x2*p5)); Add12(rri.rh, rri.rl, x, x*tt); TEST_AND_RETURN_RD(rri.rh, rri.rl, EPS_TAN_CASE2); /* if the previous block didn't return a value, launch accurate phase */ return scs_tan_rd(x); } else { /* normal case: Range reduction then standard evaluation */ rri.x=x; rri.function=TAN; ComputeTrigWithArgred(&rri); epsilon=EPS_TAN_CASE3; if(rri.changesign) { rri.rh= -rri.rh; rri.rl=-rri.rl; } } TEST_AND_RETURN_RD(rri.rh, rri.rl, epsilon); /* if the previous block didn't return a value, launch accurate phase */ return scs_tan_rd(x); } /************************************************************* ************************************************************* * ROUNDED TOWARD ZERO ************************************************************* *************************************************************/ double tan_rz(double x){ double epsilon, p5, tt, x2; rrinfo rri; db_number x_split; x_split.d=x; rri.absxhi = x_split.i[HI] & 0x7fffffff; /* SPECIAL CASES: x=(Nan, Inf) cos(x)=Nan */ if (rri.absxhi>=0x7ff00000) { x_split.l=0xfff8000000000000LL; return x_split.d - x_split.d; } if (rri.absxhi < XMAX_TAN_CASE2){ if (rri.absxhi < XMAX_RETURN_X_FOR_TAN) { return x; } else{ /* Fast Taylor series */ x2 = x*x; p5 = t5.d + x2*(t7.d + x2*(t9.d + x2*t11.d)); tt = x2*(t3h.d + (t3l.d +x2*p5)); Add12(rri.rh, rri.rl, x, x*tt); TEST_AND_RETURN_RZ(rri.rh, rri.rl, EPS_TAN_CASE2); /* if the TEST_AND_RETURN block didn't return a value, launch accurate phase */ return scs_tan_rz(x); } } else { /* Normal case: Range reduction then standard evaluation */ rri.x=x; rri.function=TAN; ComputeTrigWithArgred(&rri); epsilon=EPS_TAN_CASE3; if(rri.changesign) { rri.rh = -rri.rh; rri.rl = -rri.rl; } } TEST_AND_RETURN_RZ(rri.rh, rri.rl, epsilon); /* if the previous block didn't return a value, launch accurate phase */ return scs_tan_rz(x); } interval-2.1.0/src/crlibm/trigo_fast.h0000644000000000000000000007634413031036767016061 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" /*File generated by maple/trigo.pl*/ #define XMAX_RETURN_X_FOR_SIN 0x3E4FFFFE /* .14901147e-7 */ #define XMAX_SIN_CASE2 0x3F8921F9 /* .12271835e-1 */ #define XMAX_RETURN_1_FOR_COS_RN 0x3E46A09C /* .10536702e-7 */ #define XMAX_RETURN_1_FOR_COS_RDIR 0x3E4FFFFE /* .14901147e-7 */ #define XMAX_COS_CASE2 0x3F8921F9 /* .12271835e-1 */ #define XMAX_RETURN_X_FOR_TAN 0x3E3FFFFE /* .74505735e-8 */ #define XMAX_TAN_CASE2 0x3FAFFFFE /* .62499940e-1 */ #define ONE_ROUNDED_DOWN 9.9999999999999988897769754e-01 #define EPS_SIN_CASE2 1.1843448950468158814341336e-20 #define RN_CST_SIN_CASE2 1.0002134047098797985844841 #define EPS_COS_CASE2 3.7840527971432048221275834e-20 #define RN_CST_COS_CASE2 1.0006823406990255799706351 #define EPS_SINCOS_CASE3 4.0657581468206416275279480e-20 #define RN_CST_SINCOS_CASE3 1.0007331378299121345641375 #define EPS_TAN_CASE2 4.5960200000000000000000000e-19 #define EPS_TAN_CASE3 8.5380921083233474178086908e-20 #define RN_CST_TAN_CASE3 1.0015410958904110700976399 #define INV_PIO256 81.4873308630504119136684868 #define XMAX_CODY_WAITE_2 0x40B921F9 /* 6433.9756 */ #define XMAX_CODY_WAITE_3 0x416921F9 /* 13176782. */ #define XMAX_DDRR 0x426921F9 /* .86355359e12 */ #define RR_CW2_CH 1.2271846303519851062446833e-02 #define RR_CW2_MCL 4.3472122470213191794988193e-13 #define RR_CW3_CH 1.2271845713257789611816406e-02 #define RR_CW3_CM 5.8982729811418721510563046e-10 #define RR_CW3_MCL -4.2111741079360304438362959e-17 #define RR_DD_MCH -1.2271846303085129359367045e-02 #define RR_DD_MCM -4.7837765591693484655225157e-19 #define RR_DD_CL -1.1698319569212264319871158e-35 static const int digits_256_over_pi[] = { 0x51, 0x1F306DC9, 0x3220A94F, 0x384EAFA3, 0x3A9A6EE0, 0x1B6C52B3, 0x9E21C82, 0x3FCA2C7, 0x15EF5DE2, 0x2C36E48D, 0x31D2126E, 0x25C00C92, 0x177504E8, 0x32439FC3, 0x2F58E589, 0x134E7DD1, 0x11AFA97, 0x1768909D, 0xCE38135, 0x28BEFC82, 0x1CC8EB1C, 0x306A673E, 0x24E422FC, 0x177BF250, 0x1D8FFC4B, 0x3FFBC0B3, 0x7F7978, 0x2316B414, 0x368FB69B, 0xFD9E4F9, 0x184DBA7A, 0xC7ECD3C, 0x2FF516BA, 0x24F758FD, 0x1F2F8BD9, 0x3A0E73EF, 0x5294975, 0xD7F6BF6, 0x8FC6AE8, 0x10AC0660, 0x237E3DB5, 0x357E19F7, 0x2104D7A1, 0x2C3B53C7, 0x8B0AF73, 0x3610CB3, 0xC2AF8A5, 0xD0811C, }; static const scs Pio256= {{0x00c90fda, 0x28885a30, 0x234c4c66, 0x0a2e0370, 0x1cd12902, 0x13822299, 0x3cc74020, 0x2efa98ec}, DB_ONE, -1, 1 } ; #define Pio256_ptr (scs_ptr)(& Pio256) #ifdef WORDS_BIGENDIAN static db_number const s3 = {{0xBFC55555,0x55555555}} /* -1.6666666667e-01 */; static db_number const s5 = {{0x3F811111,0x11111111}} /* +8.3333333333e-03 */; static db_number const s7 = {{0xBF2A01A0,0x1A01A01A}} /* -1.9841269841e-04 */; static db_number const c2 = {{0xBFE00000,0x00000000}} /* -5.0000000000e-01 */; static db_number const c4 = {{0x3FA55555,0x55555555}} /* +4.1666666667e-02 */; static db_number const c6 = {{0xBF56C16C,0x16C16C17}} /* -1.3888888889e-03 */; static db_number const t3h = {{0x3FD55555,0x55555555}} /* +3.3333333333e-01 */; static db_number const t3l = {{0x3C7CB8E2,0xB4EE83F1}} /* +2.4912545352e-17 */; static db_number const t5 = {{0x3FC11111,0x11110586}} /* +1.3333333333e-01 */; static db_number const t7 = {{0x3FABA1BA,0x1D1301A5}} /* +5.3968254136e-02 */; static db_number const t9 = {{0x3F9664EC,0x751BE4A4}} /* +2.1869368217e-02 */; static db_number const t11 = {{0x3F823953,0xEFC04F73}} /* +8.8984067479e-03 */; /* sine and cos of kPi/256 in double-double */ static db_number const sincosTable[260] = { {{0x00000000,0x00000000}} /* +0.0000000000e+00 */ , {{0x00000000,0x00000000}} /* +0.0000000000e+00 */ , {{0x3FF00000,0x00000000}} /* +1.0000000000e+00 */ , {{0x00000000,0x00000000}} /* +0.0000000000e+00 */ , {{0x3F8921D1,0xFCDEC784}} /* +1.2271538286e-02 */ , {{0x3C29878E,0xBE836D9D}} /* +6.9197907640e-19 */ , {{0x3FEFFF62,0x169B92DB}} /* +9.9992470184e-01 */ , {{0x3C85DDA3,0xC81FBD0D}} /* +3.7931082513e-17 */ , {{0x3F992155,0xF7A3667E}} /* +2.4541228523e-02 */ , {{0xBBFB1D63,0x091A0130}} /* -9.1868490126e-20 */ , {{0x3FEFFD88,0x6084CD0D}} /* +9.9969881870e-01 */ , {{0xBC81354D,0x4556E4CB}} /* -2.9851486404e-17 */ , {{0x3FA2D865,0x759455CD}} /* +3.6807222941e-02 */ , {{0x3C2686F6,0x5BA93AC0}} /* +6.1060088804e-19 */ , {{0x3FEFFA72,0xEFFEF75D}} /* +9.9932238459e-01 */ , {{0xBC88B4CD,0xCDB25956}} /* -4.2858538441e-17 */ , {{0x3FA91F65,0xF10DD814}} /* +4.9067674327e-02 */ , {{0xBC2912BD,0x0D569A90}} /* -6.7961037205e-19 */ , {{0x3FEFF621,0xE3796D7E}} /* +9.9879545621e-01 */ , {{0xBC6C57BC,0x2E24AA15}} /* -1.2291693337e-17 */ , {{0x3FAF656E,0x79F820E0}} /* +6.1320736302e-02 */ , {{0xBC22E1EB,0xE392BFFE}} /* -5.1181134065e-19 */ , {{0x3FEFF095,0x658E71AD}} /* +9.9811811290e-01 */ , {{0x3C801A8C,0xE18A4B9E}} /* +2.7935487558e-17 */ , {{0x3FB2D520,0x92CE19F6}} /* +7.3564563600e-02 */ , {{0xBC49A088,0xA8BF6B2C}} /* -2.7784941506e-18 */ , {{0x3FEFE9CD,0xAD01883A}} /* +9.9729045668e-01 */ , {{0x3C6521EC,0xD0C67E35}} /* +9.1647695371e-18 */ , {{0x3FB5F6D0,0x0A9AA419}} /* +8.5797312344e-02 */ , {{0xBC4F4022,0xD03F6C9A}} /* -3.3881893831e-18 */ , {{0x3FEFE1CA,0xFCBD5B09}} /* +9.9631261218e-01 */ , {{0x3C6A23E3,0x202A884E}} /* +1.1336497892e-17 */ , {{0x3FB917A6,0xBC29B42C}} /* +9.8017140330e-02 */ , {{0xBC3E2718,0xD26ED688}} /* -1.6345823622e-18 */ , {{0x3FEFD88D,0xA3D12526}} /* +9.9518472667e-01 */ , {{0xBC887DF6,0x378811C7}} /* -4.2486913678e-17 */ , {{0x3FBC3785,0xC79EC2D5}} /* +1.1022220729e-01 */ , {{0xBC24F39D,0xF133FB21}} /* -5.6789503538e-19 */ , {{0x3FEFCE15,0xFD6DA67B}} /* +9.9390697000e-01 */ , {{0xBC75DD6F,0x830D4C09}} /* -1.8964849471e-17 */ , {{0x3FBF564E,0x56A9730E}} /* +1.2241067520e-01 */ , {{0x3C4A2704,0x729AE56D}} /* +2.8354501490e-18 */ , {{0x3FEFC264,0x70E19FD3}} /* +9.9247953460e-01 */ , {{0x3C81EC86,0x68ECACEE}} /* +3.1093055095e-17 */ , {{0x3FC139F0,0xCEDAF577}} /* +1.3458070851e-01 */ , {{0xBC652343,0x4D1B3CFA}} /* -9.1670359171e-18 */ , {{0x3FEFB579,0x7195D741}} /* +9.9090263543e-01 */ , {{0x3C71BFAC,0x7397CC08}} /* +1.5394565095e-17 */ , {{0x3FC2C810,0x6E8E613A}} /* +1.4673047446e-01 */ , {{0x3C513000,0xA89A11E0}} /* +3.7269471470e-18 */ , {{0x3FEFA755,0x7F08A517}} /* +9.8917650996e-01 */ , {{0xBC87A0A8,0xCA13571F}} /* -4.0987309937e-17 */ , {{0x3FC45576,0xB1293E5A}} /* +1.5885814333e-01 */ , {{0xBC5285A2,0x4119F7B1}} /* -4.0163200574e-18 */ , {{0x3FEF97F9,0x24C9099B}} /* +9.8730141816e-01 */ , {{0xBC8E2AE0,0xEEA5963B}} /* -5.2332261256e-17 */ , {{0x3FC5E214,0x448B3FC6}} /* +1.7096188876e-01 */ , {{0x3C6531FF,0x779DDAC6}} /* +9.1919980182e-18 */ , {{0x3FEF8764,0xFA714BA9}} /* +9.8527764239e-01 */ , {{0x3C7AB256,0x778FFCB6}} /* +2.3155637028e-17 */ , {{0x3FC76DD9,0xDE50BF31}} /* +1.8303988796e-01 */ , {{0x3C61D5EE,0xEC501B2F}} /* +7.7349918689e-18 */ , {{0x3FEF7599,0xA3A12077}} /* +9.8310548743e-01 */ , {{0x3C884F31,0xD743195C}} /* +4.2170007523e-17 */ , {{0x3FC8F8B8,0x3C69A60B}} /* +1.9509032202e-01 */ , {{0xBC626D19,0xB9FF8D82}} /* -7.9910790685e-18 */ , {{0x3FEF6297,0xCFF75CB0}} /* +9.8078528040e-01 */ , {{0x3C756217,0x2A361FD3}} /* +1.8546939998e-17 */ , {{0x3FCA82A0,0x25B00451}} /* +2.0711137619e-01 */ , {{0xBC687905,0xFFD084AD}} /* -1.0613362529e-17 */ , {{0x3FEF4E60,0x3B0B2F2D}} /* +9.7831737072e-01 */ , {{0xBC78EE01,0xE695AC05}} /* -2.1623082233e-17 */ , {{0x3FCC0B82,0x6A7E4F63}} /* +2.1910124016e-01 */ , {{0xBC1AF143,0x9E521935}} /* -3.6513812299e-19 */ , {{0x3FEF38F3,0xAC64E589}} /* +9.7570213004e-01 */ , {{0xBC7D7BAF,0xB51F72E6}} /* -2.5572556081e-17 */ , {{0x3FCD934F,0xE5454311}} /* +2.3105810828e-01 */ , {{0x3C675B92,0x277107AD}} /* +1.0129787150e-17 */ , {{0x3FEF2252,0xF7763ADA}} /* +9.7293995221e-01 */ , {{0xBC820CB8,0x1C8D94AB}} /* -3.1311211122e-17 */ , {{0x3FCF19F9,0x7B215F1B}} /* +2.4298017990e-01 */ , {{0xBC642DEE,0xF11DA2C4}} /* -8.7514315297e-18 */ , {{0x3FEF0A7E,0xFB9230D7}} /* +9.7003125319e-01 */ , {{0x3C752C7A,0xDC6B4989}} /* +1.8365300348e-17 */ , {{0x3FD04FB8,0x0E37FDAE}} /* +2.5486565960e-01 */ , {{0xBC0412CD,0xB72583CC}} /* -1.3602299807e-19 */ , {{0x3FEEF178,0xA3E473C2}} /* +9.6697647104e-01 */ , {{0x3C86310A,0x67FE774F}} /* +3.8496228837e-17 */ , {{0x3FD111D2,0x62B1F677}} /* +2.6671275747e-01 */ , {{0x3C7824C2,0x0AB7AA9A}} /* +2.0941222579e-17 */ , {{0x3FEED740,0xE7684963}} /* +9.6377606580e-01 */ , {{0x3C7E82C7,0x91F59CC2}} /* +2.6463950561e-17 */ , {{0x3FD1D344,0x3F4CDB3E}} /* +2.7851968938e-01 */ , {{0xBC6720D4,0x1C13519E}} /* -1.0030273720e-17 */ , {{0x3FEEBBD8,0xC8DF0B74}} /* +9.6043051942e-01 */ , {{0x3C7C6C8C,0x615E7277}} /* +2.4653904815e-17 */ , {{0x3FD29406,0x2ED59F06}} /* +2.9028467725e-01 */ , {{0xBC75D28D,0xA2C4612D}} /* -1.8927978708e-17 */ , {{0x3FEE9F41,0x56C62DDA}} /* +9.5694033573e-01 */ , {{0x3C8760B1,0xE2E3F81E}} /* +4.0553869862e-17 */ , {{0x3FD35410,0xC2E18152}} /* +3.0200594932e-01 */ , {{0xBC73CB00,0x2F96E062}} /* -1.7167666235e-17 */ , {{0x3FEE817B,0xAB4CD10D}} /* +9.5330604035e-01 */ , {{0xBC7D0AFE,0x686B5E0A}} /* -2.5190738780e-17 */ , {{0x3FD4135C,0x94176601}} /* +3.1368174040e-01 */ , {{0x3C70C97C,0x4AFA2518}} /* +1.4560447300e-17 */ , {{0x3FEE6288,0xEC48E112}} /* +9.4952818059e-01 */ , {{0xBC616B56,0xF2847754}} /* -7.5544151928e-18 */ , {{0x3FD4D1E2,0x4278E76A}} /* +3.2531029216e-01 */ , {{0x3C624172,0x18792858}} /* +7.9171249464e-18 */ , {{0x3FEE426A,0x4B2BC17E}} /* +9.4560732538e-01 */ , {{0x3C8A8738,0x89744882}} /* +4.6019102479e-17 */ , {{0x3FD58F9A,0x75AB1FDD}} /* +3.3688985339e-01 */ , {{0xBC1EFDC0,0xD58CF620}} /* -4.2000940033e-19 */ , {{0x3FEE2121,0x04F686E5}} /* +9.4154406518e-01 */ , {{0xBC8014C7,0x6C126527}} /* -2.7896379548e-17 */ , {{0x3FD64C7D,0xDD3F27C6}} /* +3.4841868025e-01 */ , {{0x3C510D2B,0x4A664121}} /* +3.6974420514e-18 */ , {{0x3FEDFEAE,0x622DBE2B}} /* +9.3733901191e-01 */ , {{0xBC8514EA,0x88425567}} /* -3.6570926284e-17 */ , {{0x3FD70885,0x30FA459F}} /* +3.5989503653e-01 */ , {{0xBC744B19,0xE0864C5D}} /* -1.7601687124e-17 */ , {{0x3FEDDB13,0xB6CCC23C}} /* +9.3299279883e-01 */ , {{0x3C883C37,0xC6107DB3}} /* +4.2041415555e-17 */ , {{0x3FD7C3A9,0x311DCCE7}} /* +3.7131719395e-01 */ , {{0x3C19A3F2,0x1EF3E8D9}} /* +3.4749239648e-19 */ , {{0x3FEDB652,0x6238A09B}} /* +9.2850608047e-01 */ , {{0xBC7ADEE7,0xEAE69460}} /* -2.3306639848e-17 */ , {{0x3FD87DE2,0xA6AEA963}} /* +3.8268343236e-01 */ , {{0xBC672CED,0xD3D5A610}} /* -1.0050772696e-17 */ , {{0x3FED906B,0xCF328D46}} /* +9.2387953251e-01 */ , {{0x3C7457E6,0x10231AC2}} /* +1.7645047084e-17 */ , {{0x3FD9372A,0x63BC93D7}} /* +3.9399204006e-01 */ , {{0x3C668431,0x9E5AD5B1}} /* +9.7649241641e-18 */ , {{0x3FED6961,0x73C9E68B}} /* +9.1911385169e-01 */ , {{0xBC7E8C61,0xC6393D55}} /* -2.6496484622e-17 */ , {{0x3FD9EF79,0x43A8ED8A}} /* +4.0524131400e-01 */ , {{0x3C66DA81,0x290BDBAB}} /* +9.9111401943e-18 */ , {{0x3FED4134,0xD14DC93A}} /* +9.1420975570e-01 */ , {{0xBC84EF52,0x95D25AF2}} /* -3.6316182528e-17 */ , {{0x3FDAA6C8,0x2B6D3FCA}} /* +4.1642956010e-01 */ , {{0xBC7D5F10,0x6EE5CCF7}} /* -2.5475580413e-17 */ , {{0x3FED17E7,0x743E35DC}} /* +9.0916798309e-01 */ , {{0xBC5101DA,0x3540130A}} /* -3.6878564091e-18 */ , {{0x3FDB5D10,0x09E15CC0}} /* +4.2755509343e-01 */ , {{0x3C65B362,0xCB974183}} /* +9.4111898163e-18 */ , {{0x3FECED7A,0xF43CC773}} /* +9.0398929312e-01 */ , {{0xBC5E7B6B,0xB5AB58AE}} /* -6.6097544687e-18 */ , {{0x3FDC1249,0xD8011EE7}} /* +4.3861623854e-01 */ , {{0xBC7813AA,0xBB515206}} /* -2.0883315831e-17 */ , {{0x3FECC1F0,0xF3FCFC5C}} /* +8.9867446569e-01 */ , {{0x3C7E5761,0x3B68F6AB}} /* +2.6316906461e-17 */ , {{0x3FDCC66E,0x9931C45E}} /* +4.4961132965e-01 */ , {{0x3C56850E,0x59C37F8F}} /* +4.8831924232e-18 */ , {{0x3FEC954B,0x213411F5}} /* +8.9322430120e-01 */ , {{0xBC52FB76,0x1E946603}} /* -4.1161239152e-18 */ , {{0x3FDD7977,0x5B86E389}} /* +4.6053871096e-01 */ , {{0x3C7550EC,0x87BC0575}} /* +1.8488777492e-17 */ , {{0x3FEC678B,0x3488739B}} /* +8.8763962040e-01 */ , {{0x3C6D86CA,0xC7C5FF5B}} /* +1.2805091919e-17 */ , {{0x3FDE2B5D,0x3806F63B}} /* +4.7139673683e-01 */ , {{0x3C5E0D89,0x1D3C6841}} /* +6.5166781361e-18 */ , {{0x3FEC38B2,0xF180BDB1}} /* +8.8192126435e-01 */ , {{0xBC76E0B1,0x757C8D07}} /* -1.9843248406e-17 */ , {{0x3FDEDC19,0x52EF78D6}} /* +4.8218377208e-01 */ , {{0xBC7DD0F7,0xC33EDEE6}} /* -2.5861500926e-17 */ , {{0x3FEC08C4,0x26725549}} /* +8.7607009420e-01 */ , {{0x3C5B157F,0xD80E2946}} /* +5.8729024235e-18 */ , {{0x3FDF8BA4,0xDBF89ABA}} /* +4.9289819223e-01 */ , {{0xBC32EC1F,0xC1B776B8}} /* -1.0257831677e-18 */ , {{0x3FEBD7C0,0xAC6F952A}} /* +8.7008699111e-01 */ , {{0xBC8825A7,0x32AC700A}} /* -4.1888510869e-17 */ , {{0x3FE01CFC,0x874C3EB7}} /* +5.0353838373e-01 */ , {{0xBC734A35,0xE7C2368C}} /* -1.6731308205e-17 */ , {{0x3FEBA5AA,0x673590D2}} /* +8.6397285612e-01 */ , {{0x3C87EA4E,0x370753B6}} /* +4.1486355957e-17 */ , {{0x3FE07387,0x9922FFEE}} /* +5.1410274419e-01 */ , {{0xBC8A5A01,0x4347406C}} /* -4.5712707524e-17 */ , {{0x3FEB7283,0x45196E3E}} /* +8.5772861000e-01 */ , {{0xBC8BC69F,0x324E6D61}} /* -4.8183447936e-17 */ , {{0x3FE0C970,0x4D5D898F}} /* +5.2458968268e-01 */ , {{0xBC88D3D7,0xDE6EE9B2}} /* -4.3068869040e-17 */ , {{0x3FEB3E4D,0x3EF55712}} /* +8.5135519311e-01 */ , {{0xBC8EB6B8,0xBF11A493}} /* -5.3279874446e-17 */ , {{0x3FE11EB3,0x541B4B23}} /* +5.3499761989e-01 */ , {{0xBC8EF23B,0x69ABE4F1}} /* -5.3683132708e-17 */ , {{0x3FEB090A,0x58150200}} /* +8.4485356525e-01 */ , {{0xBC8926DA,0x300FFCCE}} /* -4.3631360297e-17 */ , {{0x3FE1734D,0x63DEDB49}} /* +5.4532498842e-01 */ , {{0xBC87EEF2,0xCCC50575}} /* -4.1517817538e-17 */ , {{0x3FEAD2BC,0x9E21D511}} /* +8.3822470555e-01 */ , {{0xBC847FBE,0x07BEA548}} /* -3.5560085053e-17 */ , {{0x3FE1C73B,0x39AE68C8}} /* +5.5557023302e-01 */ , {{0x3C8B25DD,0x267F6600}} /* +4.7094109406e-17 */ , {{0x3FEA9B66,0x290EA1A3}} /* +8.3146961230e-01 */ , {{0x3C39F630,0xE8B6DAC8}} /* +1.4073856985e-18 */ , {{0x3FE21A79,0x9933EB59}} /* +5.6573181078e-01 */ , {{0xBC83A7B1,0x77C68FB2}} /* -3.4096079597e-17 */ , {{0x3FEA6309,0x1B02FAE2}} /* +8.2458930278e-01 */ , {{0xBC7E9111,0x52248D10}} /* -2.6512360489e-17 */ , {{0x3FE26D05,0x4CDD12DF}} /* +5.7580819142e-01 */ , {{0xBC85DA74,0x3EF3770C}} /* -3.7909495459e-17 */ , {{0x3FEA29A7,0xA0462782}} /* +8.1758481315e-01 */ , {{0xBC7128BB,0x015DF175}} /* -1.4883149812e-17 */ , {{0x3FE2BEDB,0x25FAF3EA}} /* +5.8579785746e-01 */ , {{0xBC514981,0xC796EE46}} /* -3.7485501964e-18 */ , {{0x3FE9EF43,0xEF29AF94}} /* +8.1045719825e-01 */ , {{0x3C7B1DFC,0xB60445C2}} /* +2.3520367350e-17 */ , {{0x3FE30FF7,0xFCE17035}} /* +5.9569930449e-01 */ , {{0xBC6EFCC6,0x26F74A6F}} /* -1.3438641937e-17 */ , {{0x3FE9B3E0,0x47F38741}} /* +8.0320753148e-01 */ , {{0xBC830EE2,0x86712474}} /* -3.3060609805e-17 */ , {{0x3FE36058,0xB10659F3}} /* +6.0551104140e-01 */ , {{0xBC81FCB3,0xA35857E7}} /* -3.1202672493e-17 */ , {{0x3FE9777E,0xF4C7D742}} /* +7.9583690461e-01 */ , {{0xBC815479,0xA240665E}} /* -3.0062724852e-17 */ , {{0x3FE3AFFA,0x292050B9}} /* +6.1523159058e-01 */ , {{0x3C7E3E25,0xE3954964}} /* +2.6231417767e-17 */ , {{0x3FE93A22,0x499263FB}} /* +7.8834642763e-01 */ , {{0x3C83D419,0xA920DF0B}} /* +3.4396993154e-17 */ , {{0x3FE3FED9,0x534556D4}} /* +6.2485948814e-01 */ , {{0x3C836916,0x608C5061}} /* +3.3671846037e-17 */ , {{0x3FE8FBCC,0xA3EF940D}} /* +7.8073722857e-01 */ , {{0xBC66DFA9,0x9C86F2F1}} /* -9.9198782067e-18 */ , {{0x3FE44CF3,0x25091DD6}} /* +6.3439328416e-01 */ , {{0x3C68076A,0x2CFDC6B3}} /* +1.0420901929e-17 */ , {{0x3FE8BC80,0x6B151741}} /* +7.7301045336e-01 */ , {{0xBC82C5E1,0x2ED1336D}} /* -3.2565907034e-17 */ , {{0x3FE49A44,0x9B9B0939}} /* +6.4383154289e-01 */ , {{0xBC827EE1,0x6D719B94}} /* -3.2084798795e-17 */ , {{0x3FE87C40,0x0FBA2EBF}} /* +7.6516726562e-01 */ , {{0xBC82DABC,0x0C3F64CD}} /* -3.2707225613e-17 */ , {{0x3FE4E6CA,0xBBE3E5E9}} /* +6.5317284295e-01 */ , {{0x3C63C293,0xEDCEB327}} /* +8.5695642060e-18 */ , {{0x3FE83B0E,0x0BFF976E}} /* +7.5720884651e-01 */ , {{0xBC76F420,0xF8EA3475}} /* -1.9909098777e-17 */ , {{0x3FE53282,0x92A35596}} /* +6.6241577759e-01 */ , {{0xBC7A12EB,0x89DA0257}} /* -2.2615508886e-17 */ , {{0x3FE7F8EC,0xE3571771}} /* +7.4913639452e-01 */ , {{0xBC89C8D8,0xCE93C917}} /* -4.4729078447e-17 */ , {{0x3FE57D69,0x348CECA0}} /* +6.7155895485e-01 */ , {{0xBC875720,0x992BFBB2}} /* -4.0489037749e-17 */ , {{0x3FE7B5DF,0x226AAFAF}} /* +7.4095112535e-01 */ , {{0xBC70F537,0xACDF0AD7}} /* -1.4708616952e-17 */ , {{0x3FE5C77B,0xBE65018C}} /* +6.8060099780e-01 */ , {{0x3C8069EA,0x9C0BC32A}} /* +2.8473293355e-17 */ , {{0x3FE771E7,0x5F037261}} /* +7.3265427167e-01 */ , {{0x3C75CFCE,0x8D84068F}} /* +1.8918673482e-17 */ , {{0x3FE610B7,0x551D2CDF}} /* +6.8954054474e-01 */ , {{0xBC7251B3,0x52FF2A37}} /* -1.5889323295e-17 */ , {{0x3FE72D08,0x37EFFF96}} /* +7.2424708295e-01 */ , {{0x3C80D4EF,0x0F1D915C}} /* +2.9198471334e-17 */ , {{0x3FE65919,0x25F0783D}} /* +6.9837624941e-01 */ , {{0x3C8C3D64,0xFBF5DE23}} /* +4.8988282436e-17 */ , {{0x3FE6E744,0x54EAA8AF}} /* +7.1573082528e-01 */ , {{0xBC8DBC03,0xC84E226E}} /* -5.1581018476e-17 */ , {{0x3FE6A09E,0x667F3BCD}} /* +7.0710678119e-01 */ , {{0xBC8BDD34,0x13B26456}} /* -4.8336466567e-17 */ , {{0x3FE6A09E,0x667F3BCD}} /* +7.0710678119e-01 */ , {{0xBC8BDD34,0x13B26456}} /* -4.8336466567e-17 */ , }; #else static db_number const s3 = {{0x55555555,0xBFC55555}} /* -1.6666666667e-01 */; static db_number const s5 = {{0x11111111,0x3F811111}} /* +8.3333333333e-03 */; static db_number const s7 = {{0x1A01A01A,0xBF2A01A0}} /* -1.9841269841e-04 */; static db_number const c2 = {{0x00000000,0xBFE00000}} /* -5.0000000000e-01 */; static db_number const c4 = {{0x55555555,0x3FA55555}} /* +4.1666666667e-02 */; static db_number const c6 = {{0x16C16C17,0xBF56C16C}} /* -1.3888888889e-03 */; static db_number const t3h = {{0x55555555,0x3FD55555}} /* +3.3333333333e-01 */; static db_number const t3l = {{0xB4EE83F1,0x3C7CB8E2}} /* +2.4912545352e-17 */; static db_number const t5 = {{0x11110586,0x3FC11111}} /* +1.3333333333e-01 */; static db_number const t7 = {{0x1D1301A5,0x3FABA1BA}} /* +5.3968254136e-02 */; static db_number const t9 = {{0x751BE4A4,0x3F9664EC}} /* +2.1869368217e-02 */; static db_number const t11 = {{0xEFC04F73,0x3F823953}} /* +8.8984067479e-03 */; /* sine and cos of kPi/256 in double-double */ static db_number const sincosTable[260] = { {{0x00000000,0x00000000}} /* +0.0000000000e+00 */ , {{0x00000000,0x00000000}} /* +0.0000000000e+00 */ , {{0x00000000,0x3FF00000}} /* +1.0000000000e+00 */ , {{0x00000000,0x00000000}} /* +0.0000000000e+00 */ , {{0xFCDEC784,0x3F8921D1}} /* +1.2271538286e-02 */ , {{0xBE836D9D,0x3C29878E}} /* +6.9197907640e-19 */ , {{0x169B92DB,0x3FEFFF62}} /* +9.9992470184e-01 */ , {{0xC81FBD0D,0x3C85DDA3}} /* +3.7931082513e-17 */ , {{0xF7A3667E,0x3F992155}} /* +2.4541228523e-02 */ , {{0x091A0130,0xBBFB1D63}} /* -9.1868490126e-20 */ , {{0x6084CD0D,0x3FEFFD88}} /* +9.9969881870e-01 */ , {{0x4556E4CB,0xBC81354D}} /* -2.9851486404e-17 */ , {{0x759455CD,0x3FA2D865}} /* +3.6807222941e-02 */ , {{0x5BA93AC0,0x3C2686F6}} /* +6.1060088804e-19 */ , {{0xEFFEF75D,0x3FEFFA72}} /* +9.9932238459e-01 */ , {{0xCDB25956,0xBC88B4CD}} /* -4.2858538441e-17 */ , {{0xF10DD814,0x3FA91F65}} /* +4.9067674327e-02 */ , {{0x0D569A90,0xBC2912BD}} /* -6.7961037205e-19 */ , {{0xE3796D7E,0x3FEFF621}} /* +9.9879545621e-01 */ , {{0x2E24AA15,0xBC6C57BC}} /* -1.2291693337e-17 */ , {{0x79F820E0,0x3FAF656E}} /* +6.1320736302e-02 */ , {{0xE392BFFE,0xBC22E1EB}} /* -5.1181134065e-19 */ , {{0x658E71AD,0x3FEFF095}} /* +9.9811811290e-01 */ , {{0xE18A4B9E,0x3C801A8C}} /* +2.7935487558e-17 */ , {{0x92CE19F6,0x3FB2D520}} /* +7.3564563600e-02 */ , {{0xA8BF6B2C,0xBC49A088}} /* -2.7784941506e-18 */ , {{0xAD01883A,0x3FEFE9CD}} /* +9.9729045668e-01 */ , {{0xD0C67E35,0x3C6521EC}} /* +9.1647695371e-18 */ , {{0x0A9AA419,0x3FB5F6D0}} /* +8.5797312344e-02 */ , {{0xD03F6C9A,0xBC4F4022}} /* -3.3881893831e-18 */ , {{0xFCBD5B09,0x3FEFE1CA}} /* +9.9631261218e-01 */ , {{0x202A884E,0x3C6A23E3}} /* +1.1336497892e-17 */ , {{0xBC29B42C,0x3FB917A6}} /* +9.8017140330e-02 */ , {{0xD26ED688,0xBC3E2718}} /* -1.6345823622e-18 */ , {{0xA3D12526,0x3FEFD88D}} /* +9.9518472667e-01 */ , {{0x378811C7,0xBC887DF6}} /* -4.2486913678e-17 */ , {{0xC79EC2D5,0x3FBC3785}} /* +1.1022220729e-01 */ , {{0xF133FB21,0xBC24F39D}} /* -5.6789503538e-19 */ , {{0xFD6DA67B,0x3FEFCE15}} /* +9.9390697000e-01 */ , {{0x830D4C09,0xBC75DD6F}} /* -1.8964849471e-17 */ , {{0x56A9730E,0x3FBF564E}} /* +1.2241067520e-01 */ , {{0x729AE56D,0x3C4A2704}} /* +2.8354501490e-18 */ , {{0x70E19FD3,0x3FEFC264}} /* +9.9247953460e-01 */ , {{0x68ECACEE,0x3C81EC86}} /* +3.1093055095e-17 */ , {{0xCEDAF577,0x3FC139F0}} /* +1.3458070851e-01 */ , {{0x4D1B3CFA,0xBC652343}} /* -9.1670359171e-18 */ , {{0x7195D741,0x3FEFB579}} /* +9.9090263543e-01 */ , {{0x7397CC08,0x3C71BFAC}} /* +1.5394565095e-17 */ , {{0x6E8E613A,0x3FC2C810}} /* +1.4673047446e-01 */ , {{0xA89A11E0,0x3C513000}} /* +3.7269471470e-18 */ , {{0x7F08A517,0x3FEFA755}} /* +9.8917650996e-01 */ , {{0xCA13571F,0xBC87A0A8}} /* -4.0987309937e-17 */ , {{0xB1293E5A,0x3FC45576}} /* +1.5885814333e-01 */ , {{0x4119F7B1,0xBC5285A2}} /* -4.0163200574e-18 */ , {{0x24C9099B,0x3FEF97F9}} /* +9.8730141816e-01 */ , {{0xEEA5963B,0xBC8E2AE0}} /* -5.2332261256e-17 */ , {{0x448B3FC6,0x3FC5E214}} /* +1.7096188876e-01 */ , {{0x779DDAC6,0x3C6531FF}} /* +9.1919980182e-18 */ , {{0xFA714BA9,0x3FEF8764}} /* +9.8527764239e-01 */ , {{0x778FFCB6,0x3C7AB256}} /* +2.3155637028e-17 */ , {{0xDE50BF31,0x3FC76DD9}} /* +1.8303988796e-01 */ , {{0xEC501B2F,0x3C61D5EE}} /* +7.7349918689e-18 */ , {{0xA3A12077,0x3FEF7599}} /* +9.8310548743e-01 */ , {{0xD743195C,0x3C884F31}} /* +4.2170007523e-17 */ , {{0x3C69A60B,0x3FC8F8B8}} /* +1.9509032202e-01 */ , {{0xB9FF8D82,0xBC626D19}} /* -7.9910790685e-18 */ , {{0xCFF75CB0,0x3FEF6297}} /* +9.8078528040e-01 */ , {{0x2A361FD3,0x3C756217}} /* +1.8546939998e-17 */ , {{0x25B00451,0x3FCA82A0}} /* +2.0711137619e-01 */ , {{0xFFD084AD,0xBC687905}} /* -1.0613362529e-17 */ , {{0x3B0B2F2D,0x3FEF4E60}} /* +9.7831737072e-01 */ , {{0xE695AC05,0xBC78EE01}} /* -2.1623082233e-17 */ , {{0x6A7E4F63,0x3FCC0B82}} /* +2.1910124016e-01 */ , {{0x9E521935,0xBC1AF143}} /* -3.6513812299e-19 */ , {{0xAC64E589,0x3FEF38F3}} /* +9.7570213004e-01 */ , {{0xB51F72E6,0xBC7D7BAF}} /* -2.5572556081e-17 */ , {{0xE5454311,0x3FCD934F}} /* +2.3105810828e-01 */ , {{0x277107AD,0x3C675B92}} /* +1.0129787150e-17 */ , {{0xF7763ADA,0x3FEF2252}} /* +9.7293995221e-01 */ , {{0x1C8D94AB,0xBC820CB8}} /* -3.1311211122e-17 */ , {{0x7B215F1B,0x3FCF19F9}} /* +2.4298017990e-01 */ , {{0xF11DA2C4,0xBC642DEE}} /* -8.7514315297e-18 */ , {{0xFB9230D7,0x3FEF0A7E}} /* +9.7003125319e-01 */ , {{0xDC6B4989,0x3C752C7A}} /* +1.8365300348e-17 */ , {{0x0E37FDAE,0x3FD04FB8}} /* +2.5486565960e-01 */ , {{0xB72583CC,0xBC0412CD}} /* -1.3602299807e-19 */ , {{0xA3E473C2,0x3FEEF178}} /* +9.6697647104e-01 */ , {{0x67FE774F,0x3C86310A}} /* +3.8496228837e-17 */ , {{0x62B1F677,0x3FD111D2}} /* +2.6671275747e-01 */ , {{0x0AB7AA9A,0x3C7824C2}} /* +2.0941222579e-17 */ , {{0xE7684963,0x3FEED740}} /* +9.6377606580e-01 */ , {{0x91F59CC2,0x3C7E82C7}} /* +2.6463950561e-17 */ , {{0x3F4CDB3E,0x3FD1D344}} /* +2.7851968938e-01 */ , {{0x1C13519E,0xBC6720D4}} /* -1.0030273720e-17 */ , {{0xC8DF0B74,0x3FEEBBD8}} /* +9.6043051942e-01 */ , {{0x615E7277,0x3C7C6C8C}} /* +2.4653904815e-17 */ , {{0x2ED59F06,0x3FD29406}} /* +2.9028467725e-01 */ , {{0xA2C4612D,0xBC75D28D}} /* -1.8927978708e-17 */ , {{0x56C62DDA,0x3FEE9F41}} /* +9.5694033573e-01 */ , {{0xE2E3F81E,0x3C8760B1}} /* +4.0553869862e-17 */ , {{0xC2E18152,0x3FD35410}} /* +3.0200594932e-01 */ , {{0x2F96E062,0xBC73CB00}} /* -1.7167666235e-17 */ , {{0xAB4CD10D,0x3FEE817B}} /* +9.5330604035e-01 */ , {{0x686B5E0A,0xBC7D0AFE}} /* -2.5190738780e-17 */ , {{0x94176601,0x3FD4135C}} /* +3.1368174040e-01 */ , {{0x4AFA2518,0x3C70C97C}} /* +1.4560447300e-17 */ , {{0xEC48E112,0x3FEE6288}} /* +9.4952818059e-01 */ , {{0xF2847754,0xBC616B56}} /* -7.5544151928e-18 */ , {{0x4278E76A,0x3FD4D1E2}} /* +3.2531029216e-01 */ , {{0x18792858,0x3C624172}} /* +7.9171249464e-18 */ , {{0x4B2BC17E,0x3FEE426A}} /* +9.4560732538e-01 */ , {{0x89744882,0x3C8A8738}} /* +4.6019102479e-17 */ , {{0x75AB1FDD,0x3FD58F9A}} /* +3.3688985339e-01 */ , {{0xD58CF620,0xBC1EFDC0}} /* -4.2000940033e-19 */ , {{0x04F686E5,0x3FEE2121}} /* +9.4154406518e-01 */ , {{0x6C126527,0xBC8014C7}} /* -2.7896379548e-17 */ , {{0xDD3F27C6,0x3FD64C7D}} /* +3.4841868025e-01 */ , {{0x4A664121,0x3C510D2B}} /* +3.6974420514e-18 */ , {{0x622DBE2B,0x3FEDFEAE}} /* +9.3733901191e-01 */ , {{0x88425567,0xBC8514EA}} /* -3.6570926284e-17 */ , {{0x30FA459F,0x3FD70885}} /* +3.5989503653e-01 */ , {{0xE0864C5D,0xBC744B19}} /* -1.7601687124e-17 */ , {{0xB6CCC23C,0x3FEDDB13}} /* +9.3299279883e-01 */ , {{0xC6107DB3,0x3C883C37}} /* +4.2041415555e-17 */ , {{0x311DCCE7,0x3FD7C3A9}} /* +3.7131719395e-01 */ , {{0x1EF3E8D9,0x3C19A3F2}} /* +3.4749239648e-19 */ , {{0x6238A09B,0x3FEDB652}} /* +9.2850608047e-01 */ , {{0xEAE69460,0xBC7ADEE7}} /* -2.3306639848e-17 */ , {{0xA6AEA963,0x3FD87DE2}} /* +3.8268343236e-01 */ , {{0xD3D5A610,0xBC672CED}} /* -1.0050772696e-17 */ , {{0xCF328D46,0x3FED906B}} /* +9.2387953251e-01 */ , {{0x10231AC2,0x3C7457E6}} /* +1.7645047084e-17 */ , {{0x63BC93D7,0x3FD9372A}} /* +3.9399204006e-01 */ , {{0x9E5AD5B1,0x3C668431}} /* +9.7649241641e-18 */ , {{0x73C9E68B,0x3FED6961}} /* +9.1911385169e-01 */ , {{0xC6393D55,0xBC7E8C61}} /* -2.6496484622e-17 */ , {{0x43A8ED8A,0x3FD9EF79}} /* +4.0524131400e-01 */ , {{0x290BDBAB,0x3C66DA81}} /* +9.9111401943e-18 */ , {{0xD14DC93A,0x3FED4134}} /* +9.1420975570e-01 */ , {{0x95D25AF2,0xBC84EF52}} /* -3.6316182528e-17 */ , {{0x2B6D3FCA,0x3FDAA6C8}} /* +4.1642956010e-01 */ , {{0x6EE5CCF7,0xBC7D5F10}} /* -2.5475580413e-17 */ , {{0x743E35DC,0x3FED17E7}} /* +9.0916798309e-01 */ , {{0x3540130A,0xBC5101DA}} /* -3.6878564091e-18 */ , {{0x09E15CC0,0x3FDB5D10}} /* +4.2755509343e-01 */ , {{0xCB974183,0x3C65B362}} /* +9.4111898163e-18 */ , {{0xF43CC773,0x3FECED7A}} /* +9.0398929312e-01 */ , {{0xB5AB58AE,0xBC5E7B6B}} /* -6.6097544687e-18 */ , {{0xD8011EE7,0x3FDC1249}} /* +4.3861623854e-01 */ , {{0xBB515206,0xBC7813AA}} /* -2.0883315831e-17 */ , {{0xF3FCFC5C,0x3FECC1F0}} /* +8.9867446569e-01 */ , {{0x3B68F6AB,0x3C7E5761}} /* +2.6316906461e-17 */ , {{0x9931C45E,0x3FDCC66E}} /* +4.4961132965e-01 */ , {{0x59C37F8F,0x3C56850E}} /* +4.8831924232e-18 */ , {{0x213411F5,0x3FEC954B}} /* +8.9322430120e-01 */ , {{0x1E946603,0xBC52FB76}} /* -4.1161239152e-18 */ , {{0x5B86E389,0x3FDD7977}} /* +4.6053871096e-01 */ , {{0x87BC0575,0x3C7550EC}} /* +1.8488777492e-17 */ , {{0x3488739B,0x3FEC678B}} /* +8.8763962040e-01 */ , {{0xC7C5FF5B,0x3C6D86CA}} /* +1.2805091919e-17 */ , {{0x3806F63B,0x3FDE2B5D}} /* +4.7139673683e-01 */ , {{0x1D3C6841,0x3C5E0D89}} /* +6.5166781361e-18 */ , {{0xF180BDB1,0x3FEC38B2}} /* +8.8192126435e-01 */ , {{0x757C8D07,0xBC76E0B1}} /* -1.9843248406e-17 */ , {{0x52EF78D6,0x3FDEDC19}} /* +4.8218377208e-01 */ , {{0xC33EDEE6,0xBC7DD0F7}} /* -2.5861500926e-17 */ , {{0x26725549,0x3FEC08C4}} /* +8.7607009420e-01 */ , {{0xD80E2946,0x3C5B157F}} /* +5.8729024235e-18 */ , {{0xDBF89ABA,0x3FDF8BA4}} /* +4.9289819223e-01 */ , {{0xC1B776B8,0xBC32EC1F}} /* -1.0257831677e-18 */ , {{0xAC6F952A,0x3FEBD7C0}} /* +8.7008699111e-01 */ , {{0x32AC700A,0xBC8825A7}} /* -4.1888510869e-17 */ , {{0x874C3EB7,0x3FE01CFC}} /* +5.0353838373e-01 */ , {{0xE7C2368C,0xBC734A35}} /* -1.6731308205e-17 */ , {{0x673590D2,0x3FEBA5AA}} /* +8.6397285612e-01 */ , {{0x370753B6,0x3C87EA4E}} /* +4.1486355957e-17 */ , {{0x9922FFEE,0x3FE07387}} /* +5.1410274419e-01 */ , {{0x4347406C,0xBC8A5A01}} /* -4.5712707524e-17 */ , {{0x45196E3E,0x3FEB7283}} /* +8.5772861000e-01 */ , {{0x324E6D61,0xBC8BC69F}} /* -4.8183447936e-17 */ , {{0x4D5D898F,0x3FE0C970}} /* +5.2458968268e-01 */ , {{0xDE6EE9B2,0xBC88D3D7}} /* -4.3068869040e-17 */ , {{0x3EF55712,0x3FEB3E4D}} /* +8.5135519311e-01 */ , {{0xBF11A493,0xBC8EB6B8}} /* -5.3279874446e-17 */ , {{0x541B4B23,0x3FE11EB3}} /* +5.3499761989e-01 */ , {{0x69ABE4F1,0xBC8EF23B}} /* -5.3683132708e-17 */ , {{0x58150200,0x3FEB090A}} /* +8.4485356525e-01 */ , {{0x300FFCCE,0xBC8926DA}} /* -4.3631360297e-17 */ , {{0x63DEDB49,0x3FE1734D}} /* +5.4532498842e-01 */ , {{0xCCC50575,0xBC87EEF2}} /* -4.1517817538e-17 */ , {{0x9E21D511,0x3FEAD2BC}} /* +8.3822470555e-01 */ , {{0x07BEA548,0xBC847FBE}} /* -3.5560085053e-17 */ , {{0x39AE68C8,0x3FE1C73B}} /* +5.5557023302e-01 */ , {{0x267F6600,0x3C8B25DD}} /* +4.7094109406e-17 */ , {{0x290EA1A3,0x3FEA9B66}} /* +8.3146961230e-01 */ , {{0xE8B6DAC8,0x3C39F630}} /* +1.4073856985e-18 */ , {{0x9933EB59,0x3FE21A79}} /* +5.6573181078e-01 */ , {{0x77C68FB2,0xBC83A7B1}} /* -3.4096079597e-17 */ , {{0x1B02FAE2,0x3FEA6309}} /* +8.2458930278e-01 */ , {{0x52248D10,0xBC7E9111}} /* -2.6512360489e-17 */ , {{0x4CDD12DF,0x3FE26D05}} /* +5.7580819142e-01 */ , {{0x3EF3770C,0xBC85DA74}} /* -3.7909495459e-17 */ , {{0xA0462782,0x3FEA29A7}} /* +8.1758481315e-01 */ , {{0x015DF175,0xBC7128BB}} /* -1.4883149812e-17 */ , {{0x25FAF3EA,0x3FE2BEDB}} /* +5.8579785746e-01 */ , {{0xC796EE46,0xBC514981}} /* -3.7485501964e-18 */ , {{0xEF29AF94,0x3FE9EF43}} /* +8.1045719825e-01 */ , {{0xB60445C2,0x3C7B1DFC}} /* +2.3520367350e-17 */ , {{0xFCE17035,0x3FE30FF7}} /* +5.9569930449e-01 */ , {{0x26F74A6F,0xBC6EFCC6}} /* -1.3438641937e-17 */ , {{0x47F38741,0x3FE9B3E0}} /* +8.0320753148e-01 */ , {{0x86712474,0xBC830EE2}} /* -3.3060609805e-17 */ , {{0xB10659F3,0x3FE36058}} /* +6.0551104140e-01 */ , {{0xA35857E7,0xBC81FCB3}} /* -3.1202672493e-17 */ , {{0xF4C7D742,0x3FE9777E}} /* +7.9583690461e-01 */ , {{0xA240665E,0xBC815479}} /* -3.0062724852e-17 */ , {{0x292050B9,0x3FE3AFFA}} /* +6.1523159058e-01 */ , {{0xE3954964,0x3C7E3E25}} /* +2.6231417767e-17 */ , {{0x499263FB,0x3FE93A22}} /* +7.8834642763e-01 */ , {{0xA920DF0B,0x3C83D419}} /* +3.4396993154e-17 */ , {{0x534556D4,0x3FE3FED9}} /* +6.2485948814e-01 */ , {{0x608C5061,0x3C836916}} /* +3.3671846037e-17 */ , {{0xA3EF940D,0x3FE8FBCC}} /* +7.8073722857e-01 */ , {{0x9C86F2F1,0xBC66DFA9}} /* -9.9198782067e-18 */ , {{0x25091DD6,0x3FE44CF3}} /* +6.3439328416e-01 */ , {{0x2CFDC6B3,0x3C68076A}} /* +1.0420901929e-17 */ , {{0x6B151741,0x3FE8BC80}} /* +7.7301045336e-01 */ , {{0x2ED1336D,0xBC82C5E1}} /* -3.2565907034e-17 */ , {{0x9B9B0939,0x3FE49A44}} /* +6.4383154289e-01 */ , {{0x6D719B94,0xBC827EE1}} /* -3.2084798795e-17 */ , {{0x0FBA2EBF,0x3FE87C40}} /* +7.6516726562e-01 */ , {{0x0C3F64CD,0xBC82DABC}} /* -3.2707225613e-17 */ , {{0xBBE3E5E9,0x3FE4E6CA}} /* +6.5317284295e-01 */ , {{0xEDCEB327,0x3C63C293}} /* +8.5695642060e-18 */ , {{0x0BFF976E,0x3FE83B0E}} /* +7.5720884651e-01 */ , {{0xF8EA3475,0xBC76F420}} /* -1.9909098777e-17 */ , {{0x92A35596,0x3FE53282}} /* +6.6241577759e-01 */ , {{0x89DA0257,0xBC7A12EB}} /* -2.2615508886e-17 */ , {{0xE3571771,0x3FE7F8EC}} /* +7.4913639452e-01 */ , {{0xCE93C917,0xBC89C8D8}} /* -4.4729078447e-17 */ , {{0x348CECA0,0x3FE57D69}} /* +6.7155895485e-01 */ , {{0x992BFBB2,0xBC875720}} /* -4.0489037749e-17 */ , {{0x226AAFAF,0x3FE7B5DF}} /* +7.4095112535e-01 */ , {{0xACDF0AD7,0xBC70F537}} /* -1.4708616952e-17 */ , {{0xBE65018C,0x3FE5C77B}} /* +6.8060099780e-01 */ , {{0x9C0BC32A,0x3C8069EA}} /* +2.8473293355e-17 */ , {{0x5F037261,0x3FE771E7}} /* +7.3265427167e-01 */ , {{0x8D84068F,0x3C75CFCE}} /* +1.8918673482e-17 */ , {{0x551D2CDF,0x3FE610B7}} /* +6.8954054474e-01 */ , {{0x52FF2A37,0xBC7251B3}} /* -1.5889323295e-17 */ , {{0x37EFFF96,0x3FE72D08}} /* +7.2424708295e-01 */ , {{0x0F1D915C,0x3C80D4EF}} /* +2.9198471334e-17 */ , {{0x25F0783D,0x3FE65919}} /* +6.9837624941e-01 */ , {{0xFBF5DE23,0x3C8C3D64}} /* +4.8988282436e-17 */ , {{0x54EAA8AF,0x3FE6E744}} /* +7.1573082528e-01 */ , {{0xC84E226E,0xBC8DBC03}} /* -5.1581018476e-17 */ , {{0x667F3BCD,0x3FE6A09E}} /* +7.0710678119e-01 */ , {{0x13B26456,0xBC8BDD34}} /* -4.8336466567e-17 */ , {{0x667F3BCD,0x3FE6A09E}} /* +7.0710678119e-01 */ , {{0x13B26456,0xBC8BDD34}} /* -4.8336466567e-17 */ , }; #endif /* WORDS_BIGENDIAN */ interval-2.1.0/src/crlibm/trigpi.c0000644000000000000000000011417713031036767015206 0ustar 00000000000000#include #include #include "crlibm.h" /* * Correctly rounded trigpi functions * * Authors : F. de Dinechin, S. Chevillard, C. Lauter (the latter two * didn't write a line of this file, but wrote a tool that wrote a * tool that wrote etc that wrote bits of code related to polynomial * evaluation.) * * This file is part of the crlibm library developed by the Arenaire * project at Ecole Normale Superieure de Lyon * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser 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 Lesser 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. */ #include "crlibm_private.h" #include "triple-double.h" #include "trigpi.h" /* TODO Use the symmetries of the tables Actually, use the tables from the standard trigo. Write decent quick steps. Or hammer Christoph and Sylvain to do so. */ /* This ugly bits of code in the beginning are polynomial evaluations automagically generated and proven by Chevillard and Lauter's tools */ #define sinpiacc_coeff_1h 3.14159265358979311599796346854418516159057617187500000000000000000000000000000000e+00 #define sinpiacc_coeff_1m 1.22464679914735320717376402945839660462569212467758006379625612680683843791484833e-16 #define sinpiacc_coeff_1l -2.87889731599645993207191707893463395148177292198731390393739579574603302514349608e-33 #define sinpiacc_coeff_3h -5.16771278004997025590228076907806098461151123046875000000000000000000000000000000e+00 #define sinpiacc_coeff_3m 2.26656228257550136196266687046492287115561324595258696490418515168130397796630859e-16 #define sinpiacc_coeff_5h 2.55016403987734552316624103696085512638092041015625000000000000000000000000000000e+00 #define sinpiacc_coeff_5m -7.93098961936403945684716222915171282926664203267314023904077657789457589387893677e-17 #define sinpiacc_coeff_7h -5.99264529320792105338000510528218001127243041992187500000000000000000000000000000e-01 #define sinpiacc_coeff_9h 8.21458866130424236740026344705256633460521697998046875000000000000000000000000000e-02 #define sinpiacc_coeff_11h -7.37046804820839888960914976223648409359157085418701171875000000000000000000000000e-03 #define cospiacc_coeff_0h 1.00000000000000000000000000000000000000000000000000000000000000000000000000000000e+00 #define cospiacc_coeff_2h -4.93480220054467899615247006295248866081237792968750000000000000000000000000000000e+00 #define cospiacc_coeff_2m -3.13264775437072047133490817894057799839785556899468543790021612949203699827194214e-16 #define cospiacc_coeff_4h 4.05871212641676848420502210501581430435180664062500000000000000000000000000000000e+00 #define cospiacc_coeff_4m -2.66019969731660223662555032718185048048635055542576743903282476821914315223693848e-16 #define cospiacc_coeff_6h -1.33526276885458949905682857206556946039199829101562500000000000000000000000000000e+00 #define cospiacc_coeff_8h 2.35330630358513925859398341344785876572132110595703125000000000000000000000000000e-01 #define cospiacc_coeff_10h -2.58068327360992909313974763563237502239644527435302734375000000000000000000000000e-02 static void sincospiacc(double *sinpiacc_resh, double *sinpiacc_resm, double *sinpiacc_resl, double *cospiacc_resh, double *cospiacc_resm, double *cospiacc_resl, double x) { double x2h, x2m; double sinpiacc_t_1_0h; double sinpiacc_t_2_0h; double sinpiacc_t_3_0h; double sinpiacc_t_4_0h; double sinpiacc_t_5_0h, sinpiacc_t_5_0m; double sinpiacc_t_6_0h, sinpiacc_t_6_0m; double sinpiacc_t_7_0h, sinpiacc_t_7_0m; double sinpiacc_t_8_0h, sinpiacc_t_8_0m; double sinpiacc_t_9_0h, sinpiacc_t_9_0m, sinpiacc_t_9_0l; double sinpiacc_t_10_0h, sinpiacc_t_10_0m, sinpiacc_t_10_0l; double cospiacc_t_1_0h; double cospiacc_t_2_0h; double cospiacc_t_3_0h; double cospiacc_t_4_0h; double cospiacc_t_5_0h, cospiacc_t_5_0m; double cospiacc_t_6_0h, cospiacc_t_6_0m; double cospiacc_t_7_0h, cospiacc_t_7_0m; double cospiacc_t_8_0h, cospiacc_t_8_0m; double cospiacc_t_9_0h, cospiacc_t_9_0m, cospiacc_t_9_0l; Mul12(&x2h,&x2m,x,x); sinpiacc_t_1_0h = sinpiacc_coeff_11h; sinpiacc_t_2_0h = sinpiacc_t_1_0h * x2h; sinpiacc_t_3_0h = sinpiacc_coeff_9h + sinpiacc_t_2_0h; sinpiacc_t_4_0h = sinpiacc_t_3_0h * x2h; Add12(sinpiacc_t_5_0h,sinpiacc_t_5_0m,sinpiacc_coeff_7h,sinpiacc_t_4_0h); MulAdd22(&sinpiacc_t_6_0h,&sinpiacc_t_6_0m,sinpiacc_coeff_5h,sinpiacc_coeff_5m,x2h,x2m,sinpiacc_t_5_0h,sinpiacc_t_5_0m); MulAdd22(&sinpiacc_t_7_0h,&sinpiacc_t_7_0m,sinpiacc_coeff_3h,sinpiacc_coeff_3m,x2h,x2m,sinpiacc_t_6_0h,sinpiacc_t_6_0m); Mul22(&sinpiacc_t_8_0h,&sinpiacc_t_8_0m,sinpiacc_t_7_0h,sinpiacc_t_7_0m,x2h,x2m); Add233Cond(&sinpiacc_t_9_0h,&sinpiacc_t_9_0m,&sinpiacc_t_9_0l,sinpiacc_t_8_0h,sinpiacc_t_8_0m,sinpiacc_coeff_1h,sinpiacc_coeff_1m,sinpiacc_coeff_1l); Mul133(&sinpiacc_t_10_0h,&sinpiacc_t_10_0m,&sinpiacc_t_10_0l,x,sinpiacc_t_9_0h,sinpiacc_t_9_0m,sinpiacc_t_9_0l); Renormalize3(sinpiacc_resh,sinpiacc_resm,sinpiacc_resl,sinpiacc_t_10_0h,sinpiacc_t_10_0m,sinpiacc_t_10_0l); cospiacc_t_1_0h = cospiacc_coeff_10h; cospiacc_t_2_0h = cospiacc_t_1_0h * x2h; cospiacc_t_3_0h = cospiacc_coeff_8h + cospiacc_t_2_0h; cospiacc_t_4_0h = cospiacc_t_3_0h * x2h; Add12(cospiacc_t_5_0h,cospiacc_t_5_0m,cospiacc_coeff_6h,cospiacc_t_4_0h); MulAdd22(&cospiacc_t_6_0h,&cospiacc_t_6_0m,cospiacc_coeff_4h,cospiacc_coeff_4m,x2h,x2m,cospiacc_t_5_0h,cospiacc_t_5_0m); MulAdd22(&cospiacc_t_7_0h,&cospiacc_t_7_0m,cospiacc_coeff_2h,cospiacc_coeff_2m,x2h,x2m,cospiacc_t_6_0h,cospiacc_t_6_0m); Mul22(&cospiacc_t_8_0h,&cospiacc_t_8_0m,cospiacc_t_7_0h,cospiacc_t_7_0m,x2h,x2m); Add123(&cospiacc_t_9_0h,&cospiacc_t_9_0m,&cospiacc_t_9_0l,cospiacc_coeff_0h,cospiacc_t_8_0h,cospiacc_t_8_0m); *cospiacc_resh = cospiacc_t_9_0h; *cospiacc_resm = cospiacc_t_9_0m; *cospiacc_resl = cospiacc_t_9_0l; } /* Comment on comparing sa, ca, sy and cy either index=0, then sa=0 and ca=1, therefore t2=0, and the Add33 will be exact or index !=0, and -eps1 < sy < eps1 (but sy may be negative) sa > eps1 (sa>0) 1-eps2 < cy < 1 ca < 1-eps2 therefore sacy = t2 >0 casy = t1 may be negative abs(t1) <= abs(t2) Unfortunately we need a stronger condition to use the Add33 */ static void sinpi_accurate(double *rh, double *rm, double *rl, double y, int index, int quadrant) { double syh, sym, syl, cyh, cym, cyl, sah, sam, sal, cah, cam, cal; double t1h, t1m, t1l, t2h, t2m, t2l; sincospiacc(&syh, &sym, &syl, &cyh, &cym, &cyl, y); sah=sincosTable[index].sh; cah=sincosTable[index].ch; sam=sincosTable[index].sm; cam=sincosTable[index].cm; sal=sincosTable[index].sl; cal=sincosTable[index].cl; if(quadrant==0 || quadrant==2) { /* compute sy*ca+sa*cy : t1 = sy*ca, t2 = sa*cy*/ Mul33(&t1h,&t1m,&t1l, syh,sym,syl, cah,cam,cal); Mul33(&t2h,&t2m,&t2l, sah,sam,sal, cyh,cym,cyl); Add33Cond(rh, rm, rl, t2h,t2m,t2l, t1h,t1m,t1l); } else { /* compute cy*ca - sa*sy : t1 = cy*ca, t2 = sa*sy */ Mul33(&t1h,&t1m,&t1l, cyh,cym,cyl, cah,cam,cal); Mul33(&t2h,&t2m,&t2l, sah,sam,sal, syh,sym,syl); Add33Cond(rh, rm, rl, t1h,t1m,t1l, -t2h,-t2m,-t2l); } if (quadrant>=2) { *rh = -*rh; *rm = -*rm; *rl = -*rl; } }; #define sinpiquick_coeff_1h 3.14159265358979311599796346854418516159057617187500000000000000000000000000000000e+00 #define sinpiquick_coeff_1m 1.22464971683184787123862072310058851157814368464452070561776508839102461934089661e-16 #define sinpiquick_coeff_3h -5.16771278004997025590228076907806098461151123046875000000000000000000000000000000e+00 #define sinpiquick_coeff_5h 2.55016403989992213041659852024167776107788085937500000000000000000000000000000000e+00 #define sinpiquick_coeff_7h -5.99263913290728922333983064163476228713989257812500000000000000000000000000000000e-01 #define cospiquick_coeff_0h 1.00000000000000000000000000000000000000000000000000000000000000000000000000000000e+00 #define cospiquick_coeff_2h -4.93480220054467899615247006295248866081237792968750000000000000000000000000000000e+00 #define cospiquick_coeff_4h 4.05871212632582167856298838160000741481781005859375000000000000000000000000000000e+00 #define cospiquick_coeff_6h -1.33525456323720947970912220625905320048332214355468750000000000000000000000000000e+00 static void cospi_accurate(double *rh, double *rm, double *rl, double y, int index, int quadrant) { double syh, sym, syl, cyh, cym, cyl, sah, sam, sal, cah, cam, cal; double t1h, t1m, t1l, t2h, t2m, t2l; sincospiacc(&syh, &sym, &syl, &cyh, &cym, &cyl, y); sah=sincosTable[index].sh; cah=sincosTable[index].ch; sam=sincosTable[index].sm; cam=sincosTable[index].cm; sal=sincosTable[index].sl; cal=sincosTable[index].cl; if(quadrant==0 || quadrant==2) { /* compute cy*ca - sa*sy : t1 = cy*ca, t2 = sa*sy */ Mul33(&t1h,&t1m,&t1l, cyh,cym,cyl, cah,cam,cal); Mul33(&t2h,&t2m,&t2l, sah,sam,sal, syh,sym,syl); Add33Cond(rh, rm, rl, t1h,t1m,t1l, -t2h,-t2m,-t2l); } else { /* compute sy*ca+sa*cy : t1 = sy*ca, t2 = sa*cy*/ Mul33(&t1h,&t1m,&t1l, syh,sym,syl, cah,cam,cal); Mul33(&t2h,&t2m,&t2l, sah,sam,sal, cyh,cym,cyl); Add33Cond(rh, rm, rl, t2h,t2m,t2l, t1h,t1m,t1l); } if (quadrant==1 || quadrant==2) { *rh = -*rh; *rm = -*rm; *rl = -*rl; } }; /* This one can clearly be improved. It was set up in less than one hour */ void sinpiquick(double *rh, double *rm, double x, int index, int quadrant) { double x2h, x2m; double sinpiquick_t_1_0h; double sinpiquick_t_2_0h; double sinpiquick_t_3_0h; double sinpiquick_t_4_0h; double sinpiquick_t_5_0h, sinpiquick_t_5_0m; double sinpiquick_t_6_0h, sinpiquick_t_6_0m; double sinpiquick_t_7_0h, sinpiquick_t_7_0m; double syh, sym; double cospiquick_t_1_0h; double cospiquick_t_2_0h; double cospiquick_t_3_0h; double cospiquick_t_4_0h; double cospiquick_t_5_0h, cospiquick_t_5_0m; double cospiquick_t_6_0h, cospiquick_t_6_0m; double cospiquick_t_7_0h, cospiquick_t_7_0m; double cyh, cym; double t1h, t1m, t2h, t2m, sah, sam, cah,cam; Mul12(&x2h,&x2m,x,x); sah=sincosTable[index].sh; cah=sincosTable[index].ch; sam=sincosTable[index].sm; cam=sincosTable[index].cm; sinpiquick_t_1_0h = sinpiquick_coeff_7h; sinpiquick_t_2_0h = sinpiquick_t_1_0h * x2h; sinpiquick_t_3_0h = sinpiquick_coeff_5h + sinpiquick_t_2_0h; sinpiquick_t_4_0h = sinpiquick_t_3_0h * x2h; Add12(sinpiquick_t_5_0h,sinpiquick_t_5_0m,sinpiquick_coeff_3h,sinpiquick_t_4_0h); MulAdd22(&sinpiquick_t_6_0h,&sinpiquick_t_6_0m,sinpiquick_coeff_1h,sinpiquick_coeff_1m,x2h,x2m,sinpiquick_t_5_0h,sinpiquick_t_5_0m); Mul122(&sinpiquick_t_7_0h,&sinpiquick_t_7_0m,x,sinpiquick_t_6_0h,sinpiquick_t_6_0m); syh = sinpiquick_t_7_0h; sym = sinpiquick_t_7_0m; cospiquick_t_1_0h = cospiquick_coeff_6h; cospiquick_t_2_0h = cospiquick_t_1_0h * x2h; cospiquick_t_3_0h = cospiquick_coeff_4h + cospiquick_t_2_0h; cospiquick_t_4_0h = cospiquick_t_3_0h * x2h; Add12(cospiquick_t_5_0h,cospiquick_t_5_0m,cospiquick_coeff_2h,cospiquick_t_4_0h); Mul22(&cospiquick_t_6_0h,&cospiquick_t_6_0m,cospiquick_t_5_0h,cospiquick_t_5_0m,x2h,x2m); Add122(&cospiquick_t_7_0h,&cospiquick_t_7_0m,cospiquick_coeff_0h,cospiquick_t_6_0h,cospiquick_t_6_0m); cyh = cospiquick_t_7_0h; cym = cospiquick_t_7_0m; /* Here comes the hand-written, unproven yet code */ if(quadrant==0 || quadrant==2) { /* compute sy*ca+sa*cy : t1 = sy*ca, t2 = sa*cy*/ Mul22(&t1h,&t1m, syh,sym, cah,cam); Mul22(&t2h,&t2m, sah,sam, cyh,cym); Add22Cond(rh, rm, t2h,t2m, t1h,t1m); } else { /* compute cy*ca - sa*sy : t1 = cy*ca, t2 = sa*sy */ Mul22(&t1h,&t1m, cyh,cym, cah,cam); Mul22(&t2h,&t2m, sah,sam, syh,sym); Add22Cond(rh, rm, t1h,t1m, -t2h,-t2m); } if (quadrant>=2) { *rh = -*rh; *rm = -*rm; } } double sinpi_rn(double x){ double xs, y,u, rh, rm, rl, sign,absx; db_number xdb, t; int32_t xih, absxih, index, quadrant; if (x<0) absx = -x; else absx = x; xdb.d = x; xs = x*128.0; /* argument reduction */ if(absx> TWOTO42 ) { /* x is very large, let us first subtract a large integer from it */ t.d = xs; t.i[LO] =0; /* remove the low part. The point is somewhere there since x > 2^42. So what remains in t is an FP integer almost as large as x */ xs = xs-t.d; /* we are going to throw away the int part anyway */ } t.d = TWOTO5251 + xs; u = t.d - TWOTO5251; y = xs - u; index = t.i[LO] & 0x3f; quadrant = (t.i[LO] & 0xff) >>6; /* Special case tests come late because the conversion FP to int is slow */ xih = xdb.i[HI]; absxih = xih & 0x7fffffff; if (xih>>31) sign=-1.; else sign=1.; /* consider the sign bit */ if(index==0 && y==0.0 && ((quadrant&1)==0)) return sign*0.0; /*signed, inspired by LIA-2 */ y = y * INV128; /* SPECIAL CASES: x=(Nan, Inf) sin(pi*x)=Nan */ if (absxih>=0x7ff00000) { xdb.l=0xfff8000000000000LL; return xdb.d - xdb.d; } if(absxih>=0x43300000) /* 2^52, which entails that x is an integer */ return sign*0.0; /*signed */ if(absxih<=0x3E000000) /*2^{-31}*/ { if (absxih<0x01700000) { /* 2^{-1000} : Get rid of possible subnormals */ /* in this case, SCS computation, accurate to 2^-210 which is provably enough */ scs_t result; scs_set_d(result, x ); scs_mul(result, PiSCS_ptr, result); scs_get_d(&rh, result); return rh; } /* First step for Pi*x. TODO: FMA-based optimisation */ const double DekkerConst = 134217729.; /* 2^27 +1 */ double tt, xh, xl; /* Splitting of x. Both xh and xl have at least 26 consecutive LSB zeroes */ tt = x*DekkerConst; xh = (x-tt)+tt; xl = x-xh; Add12(rh,rl, xh*PIHH, (xl*PIHH + xh*PIHM) + (xh*PIM + xl*PIHM) ); if(rh == (rh + (rl * PIX_RNCST_SIN))) return rh; } /* Fall here either if we have a large input, or if we have a small input and the rounding test fails. */ sinpiquick(&rh, &rm, y, index, quadrant); if (rh==rh+1.00001*rm) /* See trigpiquick.gappa. This first step is ridiculously too accurate */ return rh; sinpi_accurate(&rh, &rm, &rl, y, index, quadrant); ReturnRoundToNearest3(rh,rm,rl); } double sinpi_rd(double x){ double xs, y,u, rh, rm, rl, sign,absx; db_number xdb, t; int32_t xih, absxih, index, quadrant; if (x<0) absx = -x; else absx = x; xdb.d = x; xs = x*128.0; /* argument reduction */ if(absx> TWOTO42 ) { /* x is very large, let us first subtract a large integer from it */ t.d = xs; t.i[LO] =0; /* remove the low part. The point is somewhere there since x > 2^42. So what remains in t is an FP integer almost as large as x */ xs = xs-t.d; /* we are going to throw away the int part anyway */ } t.d = TWOTO5251 + xs; u = t.d - TWOTO5251; y = xs - u; index = t.i[LO] & 0x3f; quadrant = (t.i[LO] & 0xff) >>6; /* Special case tests come late because the conversion FP to int is slow */ xih = xdb.i[HI]; absxih = xih & 0x7fffffff; if (xih>>31) sign=-1.; else sign=1.; /* consider the sign bit */ if(index==0 && y==0.0 && ((quadrant&1)==0)) return -0.0; /*signed, inspired by LIA-2 */ y = y * INV128; /* SPECIAL CASES: x=(Nan, Inf) sin(pi*x)=Nan */ if (absxih>=0x7ff00000) { xdb.l=0xfff8000000000000LL; return xdb.d - xdb.d; } if(absxih>=0x43300000) /* 2^52, which entails that x is an integer */ return sign*0.0; /*signed */ if(absxih<=0x3E000000) /*2^{-31}*/ { if (absxih<0x01700000) { /* 2^{-1000} : Get rid of possible subnormals */ /* in this case, SCS computation, accurate to 2^-210 which is provably enough */ scs_t result; scs_set_d(result, x ); scs_mul(result, PiSCS_ptr, result); scs_get_d_minf(&rh, result); return rh; } /* First step for Pi*x. TODO: FMA-based optimisation */ const double DekkerConst = 134217729.; /* 2^27 +1 */ double tt, xh, xl; /* Splitting of x. Both xh and xl have at least 26 consecutive LSB zeroes */ tt = x*DekkerConst; xh = (x-tt)+tt; xl = x-xh; Add12(rh,rl, xh*PIHH, (xl*PIHH + xh*PIHM) + (xh*PIM + xl*PIHM) ); TEST_AND_RETURN_RD(rh,rl,PIX_EPS_SIN); } /* Fall here either if we have a large input, or if we have a small input and the rounding test fails. */ sinpi_accurate(&rh, &rm, &rl, y, index, quadrant); ReturnRoundDownwards3(rh,rm,rl); }; double sinpi_ru(double x){ double xs, y,u, rh, rm, rl, sign,absx; db_number xdb, t; int32_t xih, absxih, index, quadrant; if (x<0) absx = -x; else absx = x; xdb.d = x; xs = x*128.0; /* argument reduction */ if(absx> TWOTO42 ) { /* x is very large, let us first subtract a large integer from it */ t.d = xs; t.i[LO] =0; /* remove the low part. The point is somewhere there since x > 2^42. So what remains in t is an FP integer almost as large as x */ xs = xs-t.d; /* we are going to throw away the int part anyway */ } t.d = TWOTO5251 + xs; u = t.d - TWOTO5251; y = xs - u; index = t.i[LO] & 0x3f; quadrant = (t.i[LO] & 0xff) >>6; /* Special case tests come late because the conversion FP to int is slow */ xih = xdb.i[HI]; absxih = xih & 0x7fffffff; if (xih>>31) sign=-1.; else sign=1.; /* consider the sign bit */ if(index==0 && y==0.0 && ((quadrant&1)==0)) return +0.0; /*signed, inspired by LIA-2 */ y = y * INV128; /* SPECIAL CASES: x=(Nan, Inf) sin(pi*x)=Nan */ if (absxih>=0x7ff00000) { xdb.l=0xfff8000000000000LL; return xdb.d - xdb.d; } if(absxih>=0x43300000) /* 2^52, which entails that x is an integer */ return sign*0.0; /*signed */ if(absxih<=0x3E000000) /*2^{-31}*/ { if (absxih<0x01700000) { /* 2^{-1000} : Get rid of possible subnormals */ /* in this case, SCS computation, accurate to 2^-210 which is provably enough */ scs_t result; scs_set_d(result, x ); scs_mul(result, PiSCS_ptr, result); scs_get_d_pinf(&rh, result); return rh; } /* First step for Pi*x. TODO: FMA-based optimisation */ const double DekkerConst = 134217729.; /* 2^27 +1 */ double tt, xh, xl; /* Splitting of x. Both xh and xl have at least 26 consecutive LSB zeroes */ tt = x*DekkerConst; xh = (x-tt)+tt; xl = x-xh; Add12(rh,rl, xh*PIHH, (xl*PIHH + xh*PIHM) + (xh*PIM + xl*PIHM) ); TEST_AND_RETURN_RU(rh,rl,PIX_EPS_SIN); } /* Fall here either if we have a large input, or if we have a small input and the rounding test fails. */ sinpi_accurate(&rh, &rm, &rl, y, index, quadrant); ReturnRoundUpwards3(rh,rm,rl); }; double sinpi_rz(double x){ double xs, y,u, rh, rm, rl, sign,absx; db_number xdb, t; int32_t xih, absxih, index, quadrant; if (x<0) absx = -x; else absx = x; xdb.d = x; xs = x*128.0; /* argument reduction */ if(absx> TWOTO42 ) { /* x is very large, let us first subtract a large integer from it */ t.d = xs; t.i[LO] =0; /* remove the low part. The point is somewhere there since x > 2^42. So what remains in t is an FP integer almost as large as x */ xs = xs-t.d; /* we are going to throw away the int part anyway */ } t.d = TWOTO5251 + xs; u = t.d - TWOTO5251; y = xs - u; index = t.i[LO] & 0x3f; quadrant = (t.i[LO] & 0xff) >>6; /* Special case tests come late because the conversion FP to int is slow */ xih = xdb.i[HI]; absxih = xih & 0x7fffffff; if (xih>>31) sign=-1.; else sign=1.; /* consider the sign bit */ if(index==0 && y==0.0 && ((quadrant&1)==0)) return sign*0.0; /*signed, inspired by LIA-2 */ y = y * INV128; /* SPECIAL CASES: x=(Nan, Inf) sin(pi*x)=Nan */ if (absxih>=0x7ff00000) { xdb.l=0xfff8000000000000LL; return xdb.d - xdb.d; } if(absxih>=0x43300000) /* 2^52, which entails that x is an integer */ return sign*0.0; /*signed */ if(absxih<=0x3E000000) /*2^{-31}*/ { if (absxih<0x01700000) { /* 2^{-1000} : Get rid of possible subnormals */ /* in this case, SCS computation, accurate to 2^-210 which is provably enough */ scs_t result; scs_set_d(result, x ); scs_mul(result, PiSCS_ptr, result); scs_get_d_zero(&rh, result); return rh; } /* First step for Pi*x. TODO: FMA-based optimisation */ const double DekkerConst = 134217729.; /* 2^27 +1 */ double tt, xh, xl; /* Splitting of x. Both xh and xl have at least 26 consecutive LSB zeroes */ tt = x*DekkerConst; xh = (x-tt)+tt; xl = x-xh; Add12(rh,rl, xh*PIHH, (xl*PIHH + xh*PIHM) + (xh*PIM + xl*PIHM) ); TEST_AND_RETURN_RZ(rh,rl,PIX_EPS_SIN); } /* Fall here either if we have a large input, or if we have a small input and the rounding test fails. */ sinpi_accurate(&rh, &rm, &rl, y, index, quadrant); ReturnRoundTowardsZero3(rh,rm,rl); }; /* to nearest */ double cospi_rn(double x){ double xs, y,u, rh, rm, rl, absx; db_number xdb, t; int32_t xih, absxih, index, quadrant; if (x<0) absx =-x; else absx=x; xdb.d=x; xs = x*128.0; /* argument reduction. We do it before the special case tests for performance, it might compute garbage for inf, very large inputs, etc */ if(absx> TWOTO42 ) { /* 2^42, x is very large, let us first subtract a large integer from it */ t.d = xs; t.i[LO] =0; /* remove the low part, in which was the coma since x > 2^42. So what remains in t is an FP integer almost as large as x */ xs = xs-t.d; /* we are going to throw away the int part anyway */ } t.d = TWOTO5251 + xs; u = t.d - TWOTO5251; y = xs - u; y = y * INV128; index = t.i[LO] & 0x3f; quadrant = (t.i[LO] & 0xff) >>6; /* Special case tests come late because the conversion FP to int is slow */ xih = xdb.i[HI]; absxih = xih & 0x7fffffff; /* SPECIAL CASES: x=(Nan, Inf) cos(pi*x)=Nan */ if (absxih>=0x7ff00000) { xdb.l=0xfff8000000000000LL; return xdb.d - xdb.d; } if(absxih>=0x43400000) /* 2^53, which entails that x is an even integer */ return 1.0; if(index==0 && y==0. && ((quadrant&1)==1)) return +0.; /* Always +0, inpired by LIA2; We do not have cos(x+pi) == - cos(x) in this case */ if(index==0 && y==0. && quadrant==0) return 1.; if(index==0 && y==0. && quadrant==2) return -1.; if (absxih<0x3E26A09E) /* sqrt(2^-53)/4 */ return 1.0; /* printf("\n\nint part = %f frac part = %f index=%d quadrant=%d \n", u, y, index, quadrant); */ cospi_accurate(&rh, &rm, &rl, y, index, quadrant); ReturnRoundToNearest3(rh,rm,rl); }; double cospi_rd(double x){ double xs, y,u, rh, rm, rl, absx; db_number xdb, t; int32_t xih, absxih, index, quadrant; if (x<0) absx =-x; else absx=x; xdb.d=x; xs = x*128.0; /* argument reduction. We do it before the special case tests for performance, it might compute garbage for inf, very large inputs, etc */ if(absx> TWOTO42 ) { /* 2^42, x is very large, let us first subtract a large integer from it */ t.d = xs; t.i[LO] =0; /* remove the low part, in which was the coma since x > 2^42. So what remains in t is an FP integer almost as large as x */ xs = xs-t.d; /* we are going to throw away the int part anyway */ } t.d = TWOTO5251 + xs; u = t.d - TWOTO5251; y = xs - u; y = y * INV128; index = t.i[LO] & 0x3f; quadrant = (t.i[LO] & 0xff) >>6; /* Special case tests come late because the conversion FP to int is slow */ xih = xdb.i[HI]; absxih = xih & 0x7fffffff; /* SPECIAL CASES: x=(Nan, Inf) cos(pi*x)=Nan */ if (absxih>=0x7ff00000) { xdb.l=0xfff8000000000000LL; return xdb.d - xdb.d; } if(absxih>=0x43400000) /* 2^53, which entails that x is an even integer */ return 1.0; /*signed */ if(index==0 && y==0. && ((quadrant&1)==1)) return -0.; if(index==0 && y==0. && quadrant==0) return 1.; if(index==0 && y==0. && quadrant==2) return -1.; if (absxih<0x3E200000) /* 2^-29 */ return 0.9999999999999998889776975374843459576368331909179687500; /* 1-2^-53 */ /* Always +0, inpired by LIA2; We do not have cos(x+pi) == - cos(x) in this case */ cospi_accurate(&rh, &rm, &rl, y, index, quadrant); ReturnRoundDownwards3(rh,rm,rl); }; double cospi_ru(double x){ double xs, y,u, rh, rm, rl, absx; db_number xdb, t; int32_t xih, absxih, index, quadrant; if (x<0) absx =-x; else absx=x; xdb.d=x; xs = x*128.0; /* argument reduction. We do it before the special case tests for performance, it might compute garbage for inf, very large inputs, etc */ if(absx> TWOTO42 ) { /* 2^42, x is very large, let us first subtract a large integer from it */ t.d = xs; t.i[LO] =0; /* remove the low part, in which was the coma since x > 2^42. So what remains in t is an FP integer almost as large as x */ xs = xs-t.d; /* we are going to throw away the int part anyway */ } t.d = TWOTO5251 + xs; u = t.d - TWOTO5251; y = xs - u; y = y * INV128; index = t.i[LO] & 0x3f; quadrant = (t.i[LO] & 0xff) >>6; /* Special case tests come late because the conversion FP to int is slow */ xih = xdb.i[HI]; absxih = xih & 0x7fffffff; /* SPECIAL CASES: x=(Nan, Inf) cos(pi*x)=Nan */ if (absxih>=0x7ff00000) { xdb.l=0xfff8000000000000LL; return xdb.d - xdb.d; } if(absxih>=0x43400000) /* 2^53, which entails that x is an even integer */ return 1.0; /*signed */ if(index==0 && y==0. && quadrant==0) return 1.; if(index==0 && y==0. && quadrant==2) return -1.; if(index==0 && y==0. && ((quadrant&1)==1)) return +0.; /* Always +0, inpired by LIA2; We do not have cos(x+pi) == - cos(x) in this case */ if (absxih<0x3E200000) /* 2^-29 */ return 1; cospi_accurate(&rh, &rm, &rl, y, index, quadrant); ReturnRoundUpwards3(rh,rm,rl); }; double cospi_rz(double x){ double xs, y,u, rh, rm, rl, absx; db_number xdb, t; int32_t xih, absxih, index, quadrant; if (x<0) absx =-x; else absx=x; xdb.d=x; xs = x*128.0; /* argument reduction. We do it before the special case tests for performance, it might compute garbage for inf, very large inputs, etc */ if(absx> TWOTO42 ) { /* 2^42, x is very large, let us first subtract a large integer from it */ t.d = xs; t.i[LO] =0; /* remove the low part, in which was the coma since x > 2^42. So what remains in t is an FP integer almost as large as x */ xs = xs-t.d; /* we are going to throw away the int part anyway */ } t.d = TWOTO5251 + xs; u = t.d - TWOTO5251; y = xs - u; y = y * INV128; index = t.i[LO] & 0x3f; quadrant = (t.i[LO] & 0xff) >>6; /* Special case tests come late because the conversion FP to int is slow */ xih = xdb.i[HI]; absxih = xih & 0x7fffffff; /* SPECIAL CASES: x=(Nan, Inf) cos(pi*x)=Nan */ if (absxih>=0x7ff00000) { xdb.l=0xfff8000000000000LL; return xdb.d - xdb.d; } if(absxih>=0x43400000) /* 2^53, which entails that x is an even integer */ return 1.0; /*signed */ if(index==0 && y==0. && ((quadrant&1)==1)) return +0.; /* Always +0, inpired by LIA2; We do not have cos(x+pi) == - cos(x) in this case */ if(index==0 && y==0. && quadrant==0) return 1.; if(index==0 && y==0. && quadrant==2) return -1.; if (absxih<0x3E200000) /* 2^-29 */ return 0.9999999999999998889776975374843459576368331909179687500; /* 1-2^-53 */ cospi_accurate(&rh, &rm, &rl, y, index, quadrant); ReturnRoundTowardsZero3(rh,rm,rl); }; /* tangent of pi times x */ double tanpi_rn(double x){ double xs, y,u, rh, rm, rl, ch,cm,cl, ich,icm,icl, sh,sm,sl, sign,absx; db_number xdb, t; int32_t xih, absxih, index, quadrant; if (x<0) absx = -x; else absx = x; xdb.d = x; xs = x*128.0; /* argument reduction */ if(absx> TWOTO42 ) { /* x is very large, let us first subtract a large integer from it */ t.d = xs; t.i[LO] =0; /* remove the low part. The point is somewhere there since x > 2^42. So what remains in t is an FP integer almost as large as x */ xs = xs-t.d; /* we are going to throw away the int part anyway */ } t.d = TWOTO5251 + xs; u = t.d - TWOTO5251; y = xs - u; index = t.i[LO] & 0x3f; quadrant = (t.i[LO] & 0xff) >>6; /* Special case tests come late because the conversion FP to int is slow */ xih = xdb.i[HI]; absxih = xih & 0x7fffffff; if (xih>>31) sign=-1.; else sign=1.; /* consider the sign bit */ if(index==0 && y==0.0 && ((quadrant&1)==0)) return sign*0.0; /*signed, inspired by LIA-2 */ /* TODO ? No test for Pi/4. Such a value will lauch the accurate phase. */ y = y * INV128; /* SPECIAL CASES: x=(Nan, Inf) sin(pi*x)=Nan */ if (absxih>=0x7ff00000) { xdb.l=0xfff8000000000000LL; return xdb.d - xdb.d; } if(absxih>=0x43300000) /* 2^52, which entails that x is an integer */ return sign*0.0; /*signed */ if(absxih<=0x3E000000) /*2^{-31}*/ { if (absxih<0x01700000) { /* 2^{-1000} : Get rid of possible subnormals */ /* in this case, SCS computation, accurate to 2^-210 which is provably enough */ scs_t result; scs_set_d(result, x ); scs_mul(result, PiSCS_ptr, result); scs_get_d(&rh, result); return rh; } /* First step for Pi*x. TODO: FMA-based optimisation */ const double DekkerConst = 134217729.; /* 2^27 +1 */ double tt, xh, xl; /* Splitting of x. Both xh and xl have at least 26 consecutive LSB zeroes */ tt = x*DekkerConst; xh = (x-tt)+tt; xl = x-xh; Add12(rh,rl, xh*PIHH, (xl*PIHH + xh*PIHM) + (xh*PIM + xl*PIHM) ); if(rh == (rh + (rl * PIX_RNCST_TAN))) return rh; } /* Fall here either if we have a large input, or if we have a small input and the rounding test fails. */ cospi_accurate(&ch, &cm, &cl, y, index, quadrant); Recpr33(&ich, &icm, &icl, ch, cm, cl); sinpi_accurate(&sh, &sm, &sl, y, index, quadrant); Mul33(&rh,&rm,&rl, sh,sm,sl, ich,icm,icl); ReturnRoundToNearest3(rh,rm,rl); }; double tanpi_rd(double x){ double xs, y,u, rh, rm, rl, ch,cm,cl, ich,icm,icl, sh,sm,sl, sign,absx; db_number xdb, t; int32_t xih, absxih, index, quadrant; if (x<0) absx = -x; else absx = x; xdb.d = x; xs = x*128.0; /* argument reduction */ if(absx> TWOTO42 ) { /* x is very large, let us first subtract a large integer from it */ t.d = xs; t.i[LO] =0; /* remove the low part. The point is somewhere there since x > 2^42. So what remains in t is an FP integer almost as large as x */ xs = xs-t.d; /* we are going to throw away the int part anyway */ } t.d = TWOTO5251 + xs; u = t.d - TWOTO5251; y = xs - u; index = t.i[LO] & 0x3f; quadrant = (t.i[LO] & 0xff) >>6; /* Special case tests come late because the conversion FP to int is slow */ xih = xdb.i[HI]; absxih = xih & 0x7fffffff; if (xih>>31) sign=-1.; else sign=1.; /* consider the sign bit */ if(index==0 && y==0.0 && ((quadrant&1)==0)) return sign*0.0; /*signed, inspired by LIA-2 */ y = y * INV128; /* SPECIAL CASES: x=(Nan, Inf) sin(pi*x)=Nan */ if (absxih>=0x7ff00000) { xdb.l=0xfff8000000000000LL; return xdb.d - xdb.d; } if(absxih>=0x43300000) /* 2^52, which entails that x is an integer */ return sign*0.0; /*signed */ if(absxih<=0x3E000000) /*2^{-31}*/ { if (absxih<0x01700000) { /* 2^{-1000} : Get rid of possible subnormals */ /* in this case, SCS computation, accurate to 2^-210 which is provably enough */ scs_t result; scs_set_d(result, x ); scs_mul(result, PiSCS_ptr, result); scs_get_d_minf(&rh, result); return rh; } /* First step for Pi*x. TODO: FMA-based optimisation */ const double DekkerConst = 134217729.; /* 2^27 +1 */ double tt, xh, xl; /* Splitting of x. Both xh and xl have at least 26 consecutive LSB zeroes */ tt = x*DekkerConst; xh = (x-tt)+tt; xl = x-xh; Add12(rh,rl, xh*PIHH, (xl*PIHH + xh*PIHM) + (xh*PIM + xl*PIHM) ); TEST_AND_RETURN_RD(rh,rl,PIX_EPS_SIN); } /* Fall here either if we have a large input, or if we have a small input and the rounding test fails. */ cospi_accurate(&ch, &cm, &cl, y, index, quadrant); Recpr33(&ich, &icm, &icl, ch, cm, cl); sinpi_accurate(&sh, &sm, &sl, y, index, quadrant); Mul33(&rh,&rm,&rl, sh,sm,sl, ich,icm,icl); ReturnRoundDownwards3(rh,rm,rl); }; double tanpi_ru(double x){ double xs, y,u, rh, rm, rl, ch,cm,cl, ich,icm,icl, sh,sm,sl, sign,absx; db_number xdb, t; int32_t xih, absxih, index, quadrant; if (x<0) absx = -x; else absx = x; xdb.d = x; xs = x*128.0; /* argument reduction */ if(absx> TWOTO42 ) { /* x is very large, let us first subtract a large integer from it */ t.d = xs; t.i[LO] =0; /* remove the low part. The point is somewhere there since x > 2^42. So what remains in t is an FP integer almost as large as x */ xs = xs-t.d; /* we are going to throw away the int part anyway */ } t.d = TWOTO5251 + xs; u = t.d - TWOTO5251; y = xs - u; index = t.i[LO] & 0x3f; quadrant = (t.i[LO] & 0xff) >>6; /* Special case tests come late because the conversion FP to int is slow */ xih = xdb.i[HI]; absxih = xih & 0x7fffffff; if (xih>>31) sign=-1.; else sign=1.; /* consider the sign bit */ if(index==0 && y==0.0 && ((quadrant&1)==0)) return sign*0.0; /*signed, inspired by LIA-2 */ y = y * INV128; /* SPECIAL CASES: x=(Nan, Inf) sin(pi*x)=Nan */ if (absxih>=0x7ff00000) { xdb.l=0xfff8000000000000LL; return xdb.d - xdb.d; } if(absxih>=0x43300000) /* 2^52, which entails that x is an integer */ return sign*0.0; /*signed */ if(absxih<=0x3E000000) /*2^{-31}*/ { if (absxih<0x01700000) { /* 2^{-1000} : Get rid of possible subnormals */ /* in this case, SCS computation, accurate to 2^-210 which is provably enough */ scs_t result; scs_set_d(result, x ); scs_mul(result, PiSCS_ptr, result); scs_get_d_pinf(&rh, result); return rh; } /* First step for Pi*x. TODO: FMA-based optimisation */ const double DekkerConst = 134217729.; /* 2^27 +1 */ double tt, xh, xl; /* Splitting of x. Both xh and xl have at least 26 consecutive LSB zeroes */ tt = x*DekkerConst; xh = (x-tt)+tt; xl = x-xh; Add12(rh,rl, xh*PIHH, (xl*PIHH + xh*PIHM) + (xh*PIM + xl*PIHM) ); TEST_AND_RETURN_RU(rh,rl,PIX_EPS_TAN); } /* Fall here either if we have a large input, or if we have a small input and the rounding test fails. */ cospi_accurate(&ch, &cm, &cl, y, index, quadrant); Recpr33(&ich, &icm, &icl, ch, cm, cl); sinpi_accurate(&sh, &sm, &sl, y, index, quadrant); Mul33(&rh,&rm,&rl, sh,sm,sl, ich,icm,icl); ReturnRoundUpwards3(rh,rm,rl); }; double tanpi_rz(double x){ double xs, y,u, rh, rm, rl, ch,cm,cl, ich,icm,icl, sh,sm,sl, sign,absx; db_number xdb, t; int32_t xih, absxih, index, quadrant; if (x<0) absx = -x; else absx = x; xdb.d = x; xs = x*128.0; /* argument reduction */ if(absx> TWOTO42 ) { /* x is very large, let us first subtract a large integer from it */ t.d = xs; t.i[LO] =0; /* remove the low part. The point is somewhere there since x > 2^42. So what remains in t is an FP integer almost as large as x */ xs = xs-t.d; /* we are going to throw away the int part anyway */ } t.d = TWOTO5251 + xs; u = t.d - TWOTO5251; y = xs - u; index = t.i[LO] & 0x3f; quadrant = (t.i[LO] & 0xff) >>6; /* Special case tests come late because the conversion FP to int is slow */ xih = xdb.i[HI]; absxih = xih & 0x7fffffff; if (xih>>31) sign=-1.; else sign=1.; /* consider the sign bit */ if(index==0 && y==0.0 && ((quadrant&1)==0)) return sign*0.0; /*signed, inspired by LIA-2 */ y = y * INV128; /* SPECIAL CASES: x=(Nan, Inf) sin(pi*x)=Nan */ if (absxih>=0x7ff00000) { xdb.l=0xfff8000000000000LL; return xdb.d - xdb.d; } if(absxih>=0x43300000) /* 2^52, which entails that x is an integer */ return sign*0.0; /*signed */ if(absxih<=0x3E000000) /*2^{-31}*/ { if (absxih<0x01700000) { /* 2^{-1000} : Get rid of possible subnormals */ /* in this case, SCS computation, accurate to 2^-210 which is provably enough */ scs_t result; scs_set_d(result, x ); scs_mul(result, PiSCS_ptr, result); scs_get_d_zero(&rh, result); return rh; } /* First step for Pi*x. TODO: FMA-based optimisation */ const double DekkerConst = 134217729.; /* 2^27 +1 */ double tt, xh, xl; /* Splitting of x. Both xh and xl have at least 26 consecutive LSB zeroes */ tt = x*DekkerConst; xh = (x-tt)+tt; xl = x-xh; Add12(rh,rl, xh*PIHH, (xl*PIHH + xh*PIHM) + (xh*PIM + xl*PIHM) ); TEST_AND_RETURN_RZ(rh,rl,PIX_EPS_SIN); } /* Fall here either if we have a large input, or if we have a small input and the rounding test fails. */ cospi_accurate(&ch, &cm, &cl, y, index, quadrant); Recpr33(&ich, &icm, &icl, ch, cm, cl); sinpi_accurate(&sh, &sm, &sl, y, index, quadrant); Mul33(&rh,&rm,&rl, sh,sm,sl, ich,icm,icl); ReturnRoundTowardsZero3(rh,rm,rl); }; interval-2.1.0/src/crlibm/trigpi.h0000644000000000000000000007553613031036767015220 0ustar 00000000000000#include "crlibm.h" #include "crlibm_private.h" /*File generated by maple/trigpi.pl*/ #define TWOTO42 4.39804651110400000000000000000000000000000000000000e+12 #define TWOTO52 4.50359962737049600000000000000000000000000000000000e+15 #define INV128 7.81250000000000000000000000000000000000000000000000e-03 #define TWOTO5251 6.75539944105574400000000000000000000000000000000000e+15 #define SMALLEST 4.94065645841246544176568792868221372365059802614325e-324 #define PIH 3.14159265358979311599796346854418516159057617187500e+00 #define PIM 1.22464679914735320717376402945839660462569212467758e-16 #define PIL -2.99476980971833966588701635421198401670550095233904e-33 #define PIHH 3.14159268140792846679687500000000000000000000000000e+00 #define PIHM -2.78181353507989115314558148384094238281250000000000e-08 #define PIX_RNCST_SIN 1.00787401574803160796292764473221714405939530505554e+00 #define PIX_EPS_SIN 4.33680868994201773602981120347976684570312500000000e-19 #define PIX_RNCST_TAN 1.01587301587301598581442042834326647273327977070694e+00 #define PIX_EPS_TAN 8.67361737988403547205962240695953369140625000000000e-19 static const scs PiSCS= {{0x00000003, 0x090fdaa2, 0x085a308d, 0x0c4c6628, 0x2e037073, 0x1129024e, 0x022299f3, 0x074020bb}, DB_ONE, 0, 1 } ; #define PiSCS_ptr (scs_ptr)(& PiSCS) typedef struct tPi_t_tag {double sh; double ch; double sm; double cm; double sl; double cl;} tPi_t; static const tPi_t sincosTable[64] = { { /* sin/cos(0*pi/128) */ 0.00000000000000000000000000000000000000000000000000e+00, /* sh */ 1.00000000000000000000000000000000000000000000000000e+00, /* ch */ 0.00000000000000000000000000000000000000000000000000e+00, /* sm */ 0.00000000000000000000000000000000000000000000000000e+00, /* cm */ 0.00000000000000000000000000000000000000000000000000e+00, /* sl */ 0.00000000000000000000000000000000000000000000000000e+00, /* cl */ } , { /* sin/cos(1*pi/128) */ 2.45412285229122881236030195850617019459605216979980e-02, /* sh */ 9.99698818696204249967252053465927019715309143066406e-01, /* ch */ -9.18684901257787817511092729052523410277440947511204e-20, /* sm */ -2.98514864037997529143865109884349378101639351597209e-17, /* cm */ 4.87061487044670605326897942323184237088370497395221e-36, /* sl */ -1.90847873707337374441321797545527262287132421960372e-33, /* cl */ } , { /* sin/cos(2*pi/128) */ 4.90676743274180149345653489945107139647006988525391e-02, /* sh */ 9.98795456205172405006464941834565252065658569335938e-01, /* ch */ -6.79610372051828011331087211108459897310458406639606e-19, /* sm */ -1.22916933370754648023069228195440464413706083235769e-17, /* cm */ -4.43188681247183252512131377148380367335867976105441e-35, /* sl */ 2.44684467864912710011822340186994056439724387642614e-34, /* cl */ } , { /* sin/cos(3*pi/128) */ 7.35645635996674263079597722025937400758266448974609e-02, /* sh */ 9.97290456678690206970827603072393685579299926757812e-01, /* ch */ -2.77849415062735932702215188936675076042592110809248e-18, /* sm */ 9.16476953711017345735104565501545052170255011497269e-18, /* cm */ -9.12403754898528209738897073370755128458265201364941e-35, /* sl */ 6.78241343097392959213418956364511469074601099596281e-34, /* cl */ } , { /* sin/cos(4*pi/128) */ 9.80171403295606036287779261328978464007377624511719e-02, /* sh */ 9.95184726672196928731750631413888186216354370117188e-01, /* ch */ -1.63458236224425598733036227927721717477694202336940e-18, /* sm */ -4.24869136783044095961919567518488446851237034975878e-17, /* cm */ -1.32092388100064537760551925056417985745657226089355e-35, /* sl */ 1.33155107725046144631896989941148168106742079450765e-33, /* cl */ } , { /* sin/cos(5*pi/128) */ 1.22410675199216195663254325154412072151899337768555e-01, /* sh */ 9.92479534598709967063712156232213601469993591308594e-01, /* ch */ 2.83545014899653353390676675638351012269446701684827e-18, /* sm */ 3.10930550954289060565003028451274795448754407491652e-17, /* cm */ 1.81516557514933045310042069477077268403843802536068e-34, /* sl */ -1.83795947578180190975980887553298238967275792441039e-33, /* cl */ } , { /* sin/cos(6*pi/128) */ 1.46730474455361747931902982600149698555469512939453e-01, /* sh */ 9.89176509964781014438983675063354894518852233886719e-01, /* ch */ 3.72694714704656774762676429108167171813186218775477e-18, /* sm */ -4.09873099370471113819595571800653989851994072636781e-17, /* cm */ 3.73523981512508271311947760640000952122222968339672e-34, /* sl */ -4.48575605520484372949276939500710783945639583248830e-34, /* cl */ } , { /* sin/cos(7*pi/128) */ 1.70961888760301217171644339032354764640331268310547e-01, /* sh */ 9.85277642388941221618381405278341844677925109863281e-01, /* ch */ 9.19199801817590944421343720066011137609803605455754e-18, /* sm */ 2.31556370279002066952419195035978530309724519300942e-17, /* cm */ -6.76887439409826056872126962280395760312157075744208e-34, /* sl */ -7.52759715457648329988759858960284250572199307609030e-34, /* cl */ } , { /* sin/cos(8*pi/128) */ 1.95090322016128275839363936938752885907888412475586e-01, /* sh */ 9.80785280403230430579242238309234380722045898437500e-01, /* ch */ -7.99107906846173126344289703693072234842489650708062e-18, /* sm */ 1.85469399978250057259083323855314298012062932205111e-17, /* cm */ 6.18462700242207127058950316629513247512028088300259e-34, /* sl */ -1.06965644455307566037437785239692763829708493768038e-33, /* cl */ } , { /* sin/cos(9*pi/128) */ 2.19101240156869797592875670488865580409765243530273e-01, /* sh */ 9.75702130038528570032951847679214552044868469238281e-01, /* ch */ -3.65138122991507758201905028218239594431466287621283e-19, /* sm */ -2.55725560812596856486584111140239960382614753072513e-17, /* cm */ -2.33594994186064420524188910640554529764134815908088e-35, /* sl */ -9.31742445089422233678739018667912651409612658394109e-34, /* cl */ } , { /* sin/cos(10*pi/128) */ 2.42980179903263898699705691797134932130575180053711e-01, /* sh */ 9.70031253194543974238683858857257291674613952636719e-01, /* ch */ -8.75143152971966315657698066597556045463081095367626e-18, /* sm */ 1.83653003484288443908920092041031891826103053310748e-17, /* cm */ -6.57232603730794308023668785032351777033485854907112e-34, /* sl */ -1.43110975719449184241630500775446481526298855330310e-33, /* cl */ } , { /* sin/cos(11*pi/128) */ 2.66712757474898365384063936289749108254909515380859e-01, /* sh */ 9.63776065795439840222513794287806376814842224121094e-01, /* ch */ 2.09412225788266884161338599457742136857657480229159e-17, /* sm */ 2.64639505612200287797555650837254713865234329571181e-17, /* cm */ -1.13034665247279893680679089609736970876966889026874e-33, /* sl */ -2.90732345901993230283123062176090186865215463253595e-36, /* cl */ } , { /* sin/cos(12*pi/128) */ 2.90284677254462386564171083591645583510398864746094e-01, /* sh */ 9.56940335732208824381928025104571133852005004882812e-01, /* ch */ -1.89279787077742514611142383006534872375212090104104e-17, /* sm */ 4.05538698618757005503321806309621067670667256244675e-17, /* cm */ 1.15229531571423146986028622140694357073680581126202e-33, /* sl */ -1.71470133643021490774251081375403695480671459421111e-33, /* cl */ } , { /* sin/cos(13*pi/128) */ 3.13681740398891462096031546025187708437442779541016e-01, /* sh */ 9.49528180593036674750351266993675380945205688476562e-01, /* ch */ 1.45604472999689122359140657497995731581857682115574e-17, /* sm */ -7.55441519280432984009053129417731398148166729726062e-18, /* cm */ 3.65641868980115946347742781527870762816609669157526e-34, /* sl */ -5.12602450240466855759717750777748877302823219800281e-34, /* cl */ } , { /* sin/cos(14*pi/128) */ 3.36889853392220051109262612953898496925830841064453e-01, /* sh */ 9.41544065183020806308888950297841802239418029785156e-01, /* ch */ -4.20009400334750923530198764394686942499166950042589e-19, /* sm */ -2.78963795476983410723774639073498160082587681962273e-17, /* cm */ -2.91786529699854378247553773743757458316226497390670e-36, /* sl */ 1.62732363567338984793340006492231780038121787494388e-33, /* cl */ } , { /* sin/cos(15*pi/128) */ 3.59895036534988166376791696166037581861019134521484e-01, /* sh */ 9.32992798834738845670244700158946216106414794921875e-01, /* ch */ -1.76016871238392824991712490180716397399893409400325e-17, /* sm */ 4.20414155553843553793296357703776047390203635491842e-17, /* cm */ 1.33751254730467910174693675743357144631063005169968e-33, /* sl */ 9.02858964955212762289886973560835699430495731315468e-34, /* cl */ } , { /* sin/cos(16*pi/128) */ 3.82683432365089781779232680491986684501171112060547e-01, /* sh */ 9.23879532511286738483136105060111731290817260742188e-01, /* ch */ -1.00507726964615876116866635215079604149716565502162e-17, /* sm */ 1.76450470843366770599569725809896737820548554530071e-17, /* cm */ -2.06053163028066946700869844728951806226449919556645e-34, /* sl */ -5.04425373215868178317262040897837818667759555267340e-34, /* cl */ } , { /* sin/cos(17*pi/128) */ 4.05241314004989860997341111215064302086830139160156e-01, /* sh */ 9.14209755703530690951197357208002358675003051757812e-01, /* ch */ 9.91114019428998841611582656929141002790524150916273e-18, /* sm */ -3.63161825278144230137483342238202646129279797999369e-17, /* cm */ -2.51690708954346477356872397338259880052208425689270e-34, /* sl */ -1.94388197771225539922639474168732176327545733871664e-33, /* cl */ } , { /* sin/cos(18*pi/128) */ 4.27555093430282084909777040593326091766357421875000e-01, /* sh */ 9.03989293123443338195954765978967770934104919433594e-01, /* ch */ 9.41118981629547261700504547345546652274077429814600e-18, /* sm */ -6.60975446874843084950410324118654757730786778092578e-18, /* cm */ -1.74466824265988005677926664445477172311534261793862e-34, /* sl */ 1.27280130346803566179582264758403917100160817972220e-34, /* cl */ } , { /* sin/cos(19*pi/128) */ 4.49611329654606595163102156220702454447746276855469e-01, /* sh */ 8.93224301195515324458540362684288993477821350097656e-01, /* ch */ 4.88319242320352434992459578960859391755338197539985e-18, /* sm */ -4.11612391519089126927973381825877743981647578251702e-18, /* cm */ 2.71510844981913810248805367518978860016097711671055e-34, /* sl */ 2.53802538057159989694478858192415647688294380587576e-34, /* cl */ } , { /* sin/cos(20*pi/128) */ 4.71396736825997642039709489836241118609905242919922e-01, /* sh */ 8.81921264348355049556005269550951197743415832519531e-01, /* ch */ 6.51667813606901296447208541365272563671678644989260e-18, /* sm */ -1.98432484058905621441138331351064557464910578392153e-17, /* cm */ 2.94575469662359839325656601464778797771834866677748e-34, /* sl */ -7.04121140076738336886106234154968299762349001311189e-34, /* cl */ } , { /* sin/cos(21*pi/128) */ 4.92898192229784037898809856415027752518653869628906e-01, /* sh */ 8.70086991108711460540803273033816367387771606445312e-01, /* ch */ -1.02578316765621855379978432396560880807423053235781e-18, /* sm */ -4.18885108685499682324788024356996724212552957633711e-17, /* cm */ 6.95208177608850685652817838158830003461259862153976e-35, /* sl */ 7.09001858618784147808113574428963243591875515454078e-34, /* cl */ } , { /* sin/cos(22*pi/128) */ 5.14102744193221772306401362584438174962997436523438e-01, /* sh */ 8.57728610000272118085717920621391385793685913085938e-01, /* ch */ -4.57127075236156239511828925399355339402327136821488e-17, /* sm */ -4.81834479363366201443381433448989495956683085629586e-17, /* cm */ 1.54882794422382834009847995565726593342335634635644e-33, /* sl */ -1.10441305176875333754243497414965343357566732409805e-33, /* cl */ } , { /* sin/cos(23*pi/128) */ 5.34997619887097264346209612995153293013572692871094e-01, /* sh */ 8.44853565249707116890931501984596252441406250000000e-01, /* ch */ -5.36831327083581339873963151168879848386957514422019e-17, /* sm */ -4.36313602968796371239489349318562331730725440347672e-17, /* cm */ -1.39005699188381123579693330118086965951478315829762e-33, /* sl */ -2.03077268533675470129749465480265274351493013855507e-33, /* cl */ } , { /* sin/cos(24*pi/128) */ 5.55570233019602177648721408331766724586486816406250e-01, /* sh */ 8.31469612302545235671402679145103320479393005371094e-01, /* ch */ 4.70941094056167682138404887426404929202505139640422e-17, /* sm */ 1.40738569847280238930785242263532116993349751072869e-18, /* cm */ -2.06405203836829206177595824610721979274646969038677e-33, /* sl */ 4.69513153839808352458514422733246165217408979962725e-35, /* cl */ } , { /* sin/cos(25*pi/128) */ 5.75808191417845338655467912758467718958854675292969e-01, /* sh */ 8.17584813151583711388070696557406336069107055664062e-01, /* ch */ -3.79094954589427341338090415345480342563618583176174e-17, /* sm */ -1.48831498124267717438654368251080189181059728497540e-17, /* cm */ -2.74337380468543094919985039492410424892033458032374e-33, /* sl */ -7.82732627712989170819884242480669228359664723248350e-34, /* cl */ } , { /* sin/cos(26*pi/128) */ 5.95699304492433356905678465409437194466590881347656e-01, /* sh */ 8.03207531480644942867286317778052762150764465332031e-01, /* ch */ -1.34386419365794672370769766351890963879615472923649e-17, /* sm */ -3.30606098048149096139985697961182567790418192774440e-17, /* cm */ -6.78776879077210601615057451734157494786909383904135e-35, /* sl */ -1.22427262524204334204965494469832525240861319271513e-33, /* cl */ } , { /* sin/cos(27*pi/128) */ 6.15231590580626819253495796147035434842109680175781e-01, /* sh */ 7.88346427626606227612171551299979910254478454589844e-01, /* ch */ 2.62314177672669502523539824382601959772978459707084e-17, /* sm */ 3.43969931540597076013396400088425960673639156185612e-17, /* cm */ -1.40953666211067162505853387634546257268806948654638e-33, /* sl */ 1.77106237467371703799173999194548788681155596718637e-33, /* cl */ } , { /* sin/cos(28*pi/128) */ 6.34393284163645487794269683945458382368087768554688e-01, /* sh */ 7.73010453362736993376813643408240750432014465332031e-01, /* ch */ 1.04209019292800345765620100334821189439770902041504e-17, /* sm */ -3.25659070336497723355416983248241127086331816976265e-17, /* cm */ 4.11745589292804916608872033177616781045056039843844e-34, /* sl */ 1.38608072515239293103931950218033658496575955944579e-33, /* cl */ } , { /* sin/cos(29*pi/128) */ 6.53172842953776755514638807653682306408882141113281e-01, /* sh */ 7.57208846506484567484562830941285938024520874023438e-01, /* ch */ 8.56956420600262380032120093330718187007118037955581e-18, /* sm */ -1.99090987773355018590769198198766615206267472536943e-17, /* cm */ -6.91653223050706326446309100906668805486226797380063e-34, /* sl */ 3.94092832661584820126428051219691386352890448827143e-34, /* cl */ } , { /* sin/cos(30*pi/128) */ 6.71558954847018441114414599724113941192626953125000e-01, /* sh */ 7.40951125354959105884233849792508408427238464355469e-01, /* ch */ -4.04890377492966924579222325744820057841320210868276e-17, /* sm */ -1.47086169522973451831939448836260932254009548735474e-17, /* cm */ 3.19958356253556814327429889830897695603712398130540e-34, /* sl */ -4.95504338271420316912995166818275952337135785088300e-34, /* cl */ } , { /* sin/cos(31*pi/128) */ 6.89540544737066940506053924764273688197135925292969e-01, /* sh */ 7.24247082951466891742597908887546509504318237304688e-01, /* ch */ -1.58893232948067898977751614830710021398692474578962e-17, /* sm */ 2.91984713344030043552462778935493159883806968705675e-17, /* cm */ 9.12423562402057118300276915582756301317547938020558e-34, /* sl */ 2.30273249687394643468466642789742491277527364150754e-33, /* cl */ } , { /* sin/cos(32*pi/128) */ 7.07106781186547572737310929369414225220680236816406e-01, /* sh */ 7.07106781186547572737310929369414225220680236816406e-01, /* ch */ -4.83364665672645672552734986488347382506490835271488e-17, /* sm */ -4.83364665672645672552734986488347382506490835271488e-17, /* cm */ 2.06933765434970678135950246605438944725492854770064e-33, /* sl */ 2.06933765434970678135950246605438944725492854770064e-33, /* cl */ } , { /* sin/cos(33*pi/128) */ 7.24247082951466891742597908887546509504318237304688e-01, /* sh */ 6.89540544737066940506053924764273688197135925292969e-01, /* ch */ 2.91984713344030043552462778935493159883806968705675e-17, /* sm */ -1.58893232948067898977751614830710021398692474578962e-17, /* cm */ 2.30273249687394643468466642789742491277527364150754e-33, /* sl */ 9.12423562402057118300276915582756301317547938020558e-34, /* cl */ } , { /* sin/cos(34*pi/128) */ 7.40951125354959105884233849792508408427238464355469e-01, /* sh */ 6.71558954847018441114414599724113941192626953125000e-01, /* ch */ -1.47086169522973451831939448836260932254009548735474e-17, /* sm */ -4.04890377492966924579222325744820057841320210868276e-17, /* cm */ -4.95504338271420316912995166818275952337135785088300e-34, /* sl */ 3.19958356253556814327429889830897695603712398130540e-34, /* cl */ } , { /* sin/cos(35*pi/128) */ 7.57208846506484567484562830941285938024520874023438e-01, /* sh */ 6.53172842953776755514638807653682306408882141113281e-01, /* ch */ -1.99090987773355018590769198198766615206267472536943e-17, /* sm */ 8.56956420600262380032120093330718187007118037955581e-18, /* cm */ 3.94092832661584820126428051219691386352890448827143e-34, /* sl */ -6.91653223050706326446309100906668805486226797380063e-34, /* cl */ } , { /* sin/cos(36*pi/128) */ 7.73010453362736993376813643408240750432014465332031e-01, /* sh */ 6.34393284163645487794269683945458382368087768554688e-01, /* ch */ -3.25659070336497723355416983248241127086331816976265e-17, /* sm */ 1.04209019292800345765620100334821189439770902041504e-17, /* cm */ 1.38608072515239293103931950218033658496575955944579e-33, /* sl */ 4.11745589292804916608872033177616781045056039843844e-34, /* cl */ } , { /* sin/cos(37*pi/128) */ 7.88346427626606227612171551299979910254478454589844e-01, /* sh */ 6.15231590580626819253495796147035434842109680175781e-01, /* ch */ 3.43969931540597076013396400088425960673639156185612e-17, /* sm */ 2.62314177672669502523539824382601959772978459707084e-17, /* cm */ 1.77106237467371703799173999194548788681155596718637e-33, /* sl */ -1.40953666211067162505853387634546257268806948654638e-33, /* cl */ } , { /* sin/cos(38*pi/128) */ 8.03207531480644942867286317778052762150764465332031e-01, /* sh */ 5.95699304492433356905678465409437194466590881347656e-01, /* ch */ -3.30606098048149096139985697961182567790418192774440e-17, /* sm */ -1.34386419365794672370769766351890963879615472923649e-17, /* cm */ -1.22427262524204334204965494469832525240861319271513e-33, /* sl */ -6.78776879077210601615057451734157494786909383904135e-35, /* cl */ } , { /* sin/cos(39*pi/128) */ 8.17584813151583711388070696557406336069107055664062e-01, /* sh */ 5.75808191417845338655467912758467718958854675292969e-01, /* ch */ -1.48831498124267717438654368251080189181059728497540e-17, /* sm */ -3.79094954589427341338090415345480342563618583176174e-17, /* cm */ -7.82732627712989170819884242480669228359664723248350e-34, /* sl */ -2.74337380468543094919985039492410424892033458032374e-33, /* cl */ } , { /* sin/cos(40*pi/128) */ 8.31469612302545235671402679145103320479393005371094e-01, /* sh */ 5.55570233019602177648721408331766724586486816406250e-01, /* ch */ 1.40738569847280238930785242263532116993349751072869e-18, /* sm */ 4.70941094056167682138404887426404929202505139640422e-17, /* cm */ 4.69513153839808352458514422733246165217408979962725e-35, /* sl */ -2.06405203836829206177595824610721979274646969038677e-33, /* cl */ } , { /* sin/cos(41*pi/128) */ 8.44853565249707116890931501984596252441406250000000e-01, /* sh */ 5.34997619887097264346209612995153293013572692871094e-01, /* ch */ -4.36313602968796371239489349318562331730725440347672e-17, /* sm */ -5.36831327083581339873963151168879848386957514422019e-17, /* cm */ -2.03077268533675470129749465480265274351493013855507e-33, /* sl */ -1.39005699188381123579693330118086965951478315829762e-33, /* cl */ } , { /* sin/cos(42*pi/128) */ 8.57728610000272118085717920621391385793685913085938e-01, /* sh */ 5.14102744193221772306401362584438174962997436523438e-01, /* ch */ -4.81834479363366201443381433448989495956683085629586e-17, /* sm */ -4.57127075236156239511828925399355339402327136821488e-17, /* cm */ -1.10441305176875333754243497414965343357566732409805e-33, /* sl */ 1.54882794422382834009847995565726593342335634635644e-33, /* cl */ } , { /* sin/cos(43*pi/128) */ 8.70086991108711460540803273033816367387771606445312e-01, /* sh */ 4.92898192229784037898809856415027752518653869628906e-01, /* ch */ -4.18885108685499682324788024356996724212552957633711e-17, /* sm */ -1.02578316765621855379978432396560880807423053235781e-18, /* cm */ 7.09001858618784147808113574428963243591875515454078e-34, /* sl */ 6.95208177608850685652817838158830003461259862153976e-35, /* cl */ } , { /* sin/cos(44*pi/128) */ 8.81921264348355049556005269550951197743415832519531e-01, /* sh */ 4.71396736825997642039709489836241118609905242919922e-01, /* ch */ -1.98432484058905621441138331351064557464910578392153e-17, /* sm */ 6.51667813606901296447208541365272563671678644989260e-18, /* cm */ -7.04121140076738336886106234154968299762349001311189e-34, /* sl */ 2.94575469662359839325656601464778797771834866677748e-34, /* cl */ } , { /* sin/cos(45*pi/128) */ 8.93224301195515324458540362684288993477821350097656e-01, /* sh */ 4.49611329654606595163102156220702454447746276855469e-01, /* ch */ -4.11612391519089126927973381825877743981647578251702e-18, /* sm */ 4.88319242320352434992459578960859391755338197539985e-18, /* cm */ 2.53802538057159989694478858192415647688294380587576e-34, /* sl */ 2.71510844981913810248805367518978860016097711671055e-34, /* cl */ } , { /* sin/cos(46*pi/128) */ 9.03989293123443338195954765978967770934104919433594e-01, /* sh */ 4.27555093430282084909777040593326091766357421875000e-01, /* ch */ -6.60975446874843084950410324118654757730786778092578e-18, /* sm */ 9.41118981629547261700504547345546652274077429814600e-18, /* cm */ 1.27280130346803566179582264758403917100160817972220e-34, /* sl */ -1.74466824265988005677926664445477172311534261793862e-34, /* cl */ } , { /* sin/cos(47*pi/128) */ 9.14209755703530690951197357208002358675003051757812e-01, /* sh */ 4.05241314004989860997341111215064302086830139160156e-01, /* ch */ -3.63161825278144230137483342238202646129279797999369e-17, /* sm */ 9.91114019428998841611582656929141002790524150916273e-18, /* cm */ -1.94388197771225539922639474168732176327545733871664e-33, /* sl */ -2.51690708954346477356872397338259880052208425689270e-34, /* cl */ } , { /* sin/cos(48*pi/128) */ 9.23879532511286738483136105060111731290817260742188e-01, /* sh */ 3.82683432365089781779232680491986684501171112060547e-01, /* ch */ 1.76450470843366770599569725809896737820548554530071e-17, /* sm */ -1.00507726964615876116866635215079604149716565502162e-17, /* cm */ -5.04425373215868178317262040897837818667759555267340e-34, /* sl */ -2.06053163028066946700869844728951806226449919556645e-34, /* cl */ } , { /* sin/cos(49*pi/128) */ 9.32992798834738845670244700158946216106414794921875e-01, /* sh */ 3.59895036534988166376791696166037581861019134521484e-01, /* ch */ 4.20414155553843553793296357703776047390203635491842e-17, /* sm */ -1.76016871238392824991712490180716397399893409400325e-17, /* cm */ 9.02858964955212762289886973560835699430495731315468e-34, /* sl */ 1.33751254730467910174693675743357144631063005169968e-33, /* cl */ } , { /* sin/cos(50*pi/128) */ 9.41544065183020806308888950297841802239418029785156e-01, /* sh */ 3.36889853392220051109262612953898496925830841064453e-01, /* ch */ -2.78963795476983410723774639073498160082587681962273e-17, /* sm */ -4.20009400334750923530198764394686942499166950042589e-19, /* cm */ 1.62732363567338984793340006492231780038121787494388e-33, /* sl */ -2.91786529699854378247553773743757458316226497390670e-36, /* cl */ } , { /* sin/cos(51*pi/128) */ 9.49528180593036674750351266993675380945205688476562e-01, /* sh */ 3.13681740398891462096031546025187708437442779541016e-01, /* ch */ -7.55441519280432984009053129417731398148166729726062e-18, /* sm */ 1.45604472999689122359140657497995731581857682115574e-17, /* cm */ -5.12602450240466855759717750777748877302823219800281e-34, /* sl */ 3.65641868980115946347742781527870762816609669157526e-34, /* cl */ } , { /* sin/cos(52*pi/128) */ 9.56940335732208824381928025104571133852005004882812e-01, /* sh */ 2.90284677254462386564171083591645583510398864746094e-01, /* ch */ 4.05538698618757005503321806309621067670667256244675e-17, /* sm */ -1.89279787077742514611142383006534872375212090104104e-17, /* cm */ -1.71470133643021490774251081375403695480671459421111e-33, /* sl */ 1.15229531571423146986028622140694357073680581126202e-33, /* cl */ } , { /* sin/cos(53*pi/128) */ 9.63776065795439840222513794287806376814842224121094e-01, /* sh */ 2.66712757474898365384063936289749108254909515380859e-01, /* ch */ 2.64639505612200287797555650837254713865234329571181e-17, /* sm */ 2.09412225788266884161338599457742136857657480229159e-17, /* cm */ -2.90732345901993230283123062176090186865215463253595e-36, /* sl */ -1.13034665247279893680679089609736970876966889026874e-33, /* cl */ } , { /* sin/cos(54*pi/128) */ 9.70031253194543974238683858857257291674613952636719e-01, /* sh */ 2.42980179903263898699705691797134932130575180053711e-01, /* ch */ 1.83653003484288443908920092041031891826103053310748e-17, /* sm */ -8.75143152971966315657698066597556045463081095367626e-18, /* cm */ -1.43110975719449184241630500775446481526298855330310e-33, /* sl */ -6.57232603730794308023668785032351777033485854907112e-34, /* cl */ } , { /* sin/cos(55*pi/128) */ 9.75702130038528570032951847679214552044868469238281e-01, /* sh */ 2.19101240156869797592875670488865580409765243530273e-01, /* ch */ -2.55725560812596856486584111140239960382614753072513e-17, /* sm */ -3.65138122991507758201905028218239594431466287621283e-19, /* cm */ -9.31742445089422233678739018667912651409612658394109e-34, /* sl */ -2.33594994186064420524188910640554529764134815908088e-35, /* cl */ } , { /* sin/cos(56*pi/128) */ 9.80785280403230430579242238309234380722045898437500e-01, /* sh */ 1.95090322016128275839363936938752885907888412475586e-01, /* ch */ 1.85469399978250057259083323855314298012062932205111e-17, /* sm */ -7.99107906846173126344289703693072234842489650708062e-18, /* cm */ -1.06965644455307566037437785239692763829708493768038e-33, /* sl */ 6.18462700242207127058950316629513247512028088300259e-34, /* cl */ } , { /* sin/cos(57*pi/128) */ 9.85277642388941221618381405278341844677925109863281e-01, /* sh */ 1.70961888760301217171644339032354764640331268310547e-01, /* ch */ 2.31556370279002066952419195035978530309724519300942e-17, /* sm */ 9.19199801817590944421343720066011137609803605455754e-18, /* cm */ -7.52759715457648329988759858960284250572199307609030e-34, /* sl */ -6.76887439409826056872126962280395760312157075744208e-34, /* cl */ } , { /* sin/cos(58*pi/128) */ 9.89176509964781014438983675063354894518852233886719e-01, /* sh */ 1.46730474455361747931902982600149698555469512939453e-01, /* ch */ -4.09873099370471113819595571800653989851994072636781e-17, /* sm */ 3.72694714704656774762676429108167171813186218775477e-18, /* cm */ -4.48575605520484372949276939500710783945639583248830e-34, /* sl */ 3.73523981512508271311947760640000952122222968339672e-34, /* cl */ } , { /* sin/cos(59*pi/128) */ 9.92479534598709967063712156232213601469993591308594e-01, /* sh */ 1.22410675199216195663254325154412072151899337768555e-01, /* ch */ 3.10930550954289060565003028451274795448754407491652e-17, /* sm */ 2.83545014899653353390676675638351012269446701684827e-18, /* cm */ -1.83795947578180190975980887553298238967275792441039e-33, /* sl */ 1.81516557514933045310042069477077268403843802536068e-34, /* cl */ } , { /* sin/cos(60*pi/128) */ 9.95184726672196928731750631413888186216354370117188e-01, /* sh */ 9.80171403295606036287779261328978464007377624511719e-02, /* ch */ -4.24869136783044095961919567518488446851237034975878e-17, /* sm */ -1.63458236224425598733036227927721717477694202336940e-18, /* cm */ 1.33155107725046144631896989941148168106742079450765e-33, /* sl */ -1.32092388100064537760551925056417985745657226089355e-35, /* cl */ } , { /* sin/cos(61*pi/128) */ 9.97290456678690206970827603072393685579299926757812e-01, /* sh */ 7.35645635996674263079597722025937400758266448974609e-02, /* ch */ 9.16476953711017345735104565501545052170255011497269e-18, /* sm */ -2.77849415062735932702215188936675076042592110809248e-18, /* cm */ 6.78241343097392959213418956364511469074601099596281e-34, /* sl */ -9.12403754898528209738897073370755128458265201364941e-35, /* cl */ } , { /* sin/cos(62*pi/128) */ 9.98795456205172405006464941834565252065658569335938e-01, /* sh */ 4.90676743274180149345653489945107139647006988525391e-02, /* ch */ -1.22916933370754648023069228195440464413706083235769e-17, /* sm */ -6.79610372051828011331087211108459897310458406639606e-19, /* cm */ 2.44684467864912710011822340186994056439724387642614e-34, /* sl */ -4.43188681247183252512131377148380367335867976105441e-35, /* cl */ } , { /* sin/cos(63*pi/128) */ 9.99698818696204249967252053465927019715309143066406e-01, /* sh */ 2.45412285229122881236030195850617019459605216979980e-02, /* ch */ -2.98514864037997529143865109884349378101639351597209e-17, /* sm */ -9.18684901257787817511092729052523410277440947511204e-20, /* cm */ -1.90847873707337374441321797545527262287132421960372e-33, /* sl */ 4.87061487044670605326897942323184237088370497395221e-36, /* cl */ } , }; interval-2.1.0/src/crlibm/triple-double.c0000644000000000000000000000274213031036767016451 0ustar 00000000000000/* * triple_double.c * * This file contains useful tools and data for triple double data representation. * */ #include "triple-double.h" #include "crlibm_private.h" #if TRIPLEDOUBLE_AS_FUNCTIONS #if 0 void Renormalize3(double* resh, double* resm, double* resl, double ah, double am, double al) { DoRenormalize3(resh, resm, resl, ah, am, al); } #endif void Mul23(double* resh, double* resm, double* resl, double ah, double al, double bh, double bl) { DoMul23(resh, resm, resl, ah, al, bh, bl); } void Mul233(double* resh, double* resm, double* resl, double ah, double al, double bh, double bm, double bl) { DoMul233(resh, resm, resl, ah, al, bh, bm, bl); } void Mul33(double* resh, double* resm, double* resl, double ah, double am, double al, double bh, double bm, double bl) { DoMul33(resh, resm, resl, ah, am, al, bh, bm, bl); } void Mul133(double* resh, double* resm, double* resl, double a, double bh, double bm, double bl) { DoMul133(resh, resm, resl, a, bh, bm, bl); } void Mul123(double* resh, double* resm, double* resl, double a, double bh, double bl) { DoMul123(resh, resm, resl, a, bh, bl); } void Sqrt13(double* resh, double* resm, double* resl, double x) { DoSqrt13(resh, resm, resl , x); } void Recpr33(double* resh, double* resm, double* resl, double dh, double dm, double dl) { DoRecpr33(resh, resm, resl, dh, dm, dl); } #endif /* TRIPLEDOUBLE_AS_FUNCTIONS*/ interval-2.1.0/src/crlibm/triple-double.h0000644000000000000000000016302213031036767016455 0ustar 00000000000000/* * triple_double.h * * This file contains useful tools and data for triple double data representation. * */ #ifndef TRIPLE_DOUBLE_H #define TRIPLE_DOUBLE_H 1 #include "scs_lib/scs.h" #include "scs_lib/scs_private.h" /* undef all the variables that might have been defined in scs_lib/scs_private.h */ #undef VERSION #undef PACKAGE #undef HAVE_GMP_H #undef HAVE_MPFR_H #undef HAVE_MATHLIB_H /* then include the proper definitions */ #include "crlibm_config.h" #ifdef HAVE_INTTYPES_H #include #endif /* Set to O for larger but faster functions. As it only impacts the second step, smaller is preferred */ #define TRIPLEDOUBLE_AS_FUNCTIONS 0 #define Renormalize3(resh, resm, resl, ah, am, al) DoRenormalize3(resh, resm, resl, ah, am, al) /*extern void Renormalize3(double* resh, double* resm, double* resl, double ah, double am, double al) ;*/ #if TRIPLEDOUBLE_AS_FUNCTIONS extern void Mul23(double* resh, double* resm, double* resl, double ah, double al, double bh, double bl); extern void Mul233(double* resh, double* resm, double* resl, double ah, double al, double bh, double bm, double bl); extern void Mul33(double* resh, double* resm, double* resl, double ah, double am, double al, double bh, double bm, double bl); extern void Mul133(double* resh, double* resm, double* resl, double a, double bh, double bm, double bl); extern void Mul123(double* resh, double* resm, double* resl, double a, double bh, double bl); extern void Sqrt13(double* resh, double* resm, double* resl, double x); extern void Recpr33(double* resh, double* resm, double* resl, double dh, double dm, double dl); #else #define Mul23(resh, resm, resl, ah, al, bh, bl) DoMul23(resh, resm, resl, ah, al, bh, bl) #define Mul233(resh, resm, resl, ah, al, bh, bm, bl) DoMul233(resh, resm, resl, ah, al, bh, bm, bl) #define Mul33(resh, resm, resl, ah, am, al, bh, bm, bl) DoMul33(resh, resm, resl, ah, am, al, bh, bm, bl) #define Mul133(resh, resm, resl, a, bh, bm, bl) DoMul133(resh, resm, resl, a, bh, bm, bl) #define Mul123(resh, resm, resl, a, bh, bl) DoMul123(resh, resm, resl, a, bh, bl) #define Sqrt13(resh, resm, resl , x) DoSqrt13(resh, resm, resl , x) #define Recpr33(resh, resm, resl, dh, dm, dl) DoRecpr33(resh, resm, resl, dh, dm, dl) #endif /* Renormalize3 Procedure for renormalizing a triple double number, i.e. computing exactly an equivalent sum of three non-overlapping double numbers Arguments: a triple double number ah, am, al Results: a triple double number resh, resm, resl Preconditions: abs(ah) > abs(am) > abs(al) ah and am are overlapping not more than 51 bits am and al are overlapping not more than 51 bits Guarantees: abs(resh) > abs(resm) > abs(resl) resh and resm are non-overlapping resm and resl are non-overlapping resm = round-to-nearest(resm + resl) Details: resh, resm and resl are considered to be pointers */ #define DoRenormalize3(resh, resm, resl, ah, am, al) \ { \ double _t1h, _t1l, _t2l; \ \ Add12(_t1h, _t1l, (am), (al)); \ Add12((*(resh)), _t2l, (ah), (_t1h)); \ Add12((*(resm)), (*(resl)), _t2l, _t1l); \ } /* Mul23 Procedure for multiplying two double double numbers resulting in a triple double number Arguments: two double double numbers: ah, al and bh, bl Results: a triple double number resh, resm, resl Preconditions: abs(ah) > abs(al) ah and al do not overlap ah = round-to-nearest(ah + al) abs(bh) > abs(bl) bh and bl do not overlap bh = round-to-nearest(bh + bl) Guarantees: resm and resl are non-overlapping resm = round-to-nearest(resm + resl) abs(resm) <= 2^(-49) * abs(resh) resh+resm+resl = (ah+al) * (bh+bl) * (1 + eps) where abs(eps) <= 2^(-149) Details: resh, resm and resl are considered to be pointers */ #define DoMul23(resh, resm, resl, ah, al, bh, bl) \ { \ double _t1, _t2, _t3, _t4, _t5, _t6, _t7, _t8, _t9, _t10; \ \ Mul12((resh),&_t1,(ah),(bh)); \ Mul12(&_t2,&_t3,(ah),(bl)); \ Mul12(&_t4,&_t5,(al),(bh)); \ _t6 = (al) * (bl); \ Add22Cond(&_t7,&_t8,_t2,_t3,_t4,_t5); \ Add12(_t9,_t10,_t1,_t6); \ Add22Cond((resm),(resl),_t7,_t8,_t9,_t10); \ } /* Mul233 Procedure for multiplying a double double number by a triple double number resulting in a triple double number Arguments: a double double number ah, al a triple double number bh, bm, bl Results: a triple double number resh, resm, resl Preconditions: abs(ah) > abs(al) ah and al do not overlap ah = round-to-nearest(ah + al) abs(bm) <= 2^(-b_o) * abs(bh) abs(bl) <= 2^(-b_u) * abs(bm) where b_o >= 2 b_u >= 1 Guarantees: resm and resl are non-overlapping resm = round-to-nearest(resm + resl) abs(resm) <= 2^(\gamma) * abs(resh) where \gamma >= min(48,b_o-4,b_o+b_u-4) resh+resm+resl=(ah+al) * (bh+bm+bl) * (1+eps) where abs(eps) <= (2^(-99-b_o) + 2^(-99-b_o-b_u) + 2^(-152)) / (1 - 2^(-53) - 2^(-b_o+1) - 2^(-b_o-b_u+1)) Details: resh, resm and resl are considered to be pointers */ #define DoMul233(resh, resm, resl, ah, al, bh, bm, bl) \ { \ double _t1, _t2, _t3, _t4, _t5, _t6, _t7, _t8, _t9, _t10; \ double _t11, _t12, _t13, _t14, _t15, _t16, _t17, _t18; \ \ Mul12((resh),&_t1,(ah),(bh)); \ Mul12(&_t2,&_t3,(ah),(bm)); \ Mul12(&_t4,&_t5,(ah),(bl)); \ Mul12(&_t6,&_t7,(al),(bh)); \ Mul12(&_t8,&_t9,(al),(bm)); \ _t10 = (al) * (bl); \ Add22Cond(&_t11,&_t12,_t2,_t3,_t4,_t5); \ Add22Cond(&_t13,&_t14,_t6,_t7,_t8,_t9); \ Add22Cond(&_t15,&_t16,_t11,_t12,_t13,_t14); \ Add12Cond(_t17,_t18,_t1,_t10); \ Add22Cond((resm),(resl),_t17,_t18,_t15,_t16); \ } /* Add33 Procedure for adding two triple double numbers resulting in a triple double number Arguments: two triple double numbers: ah, am, al and bh, bm, bl Results: a triple double number resh, resm, resl Preconditions: abs(bh) <= 0.75 * abs(ah) OR ( sign(bh) = sign(ah) AND abs(bh) <= abs(ah)) (i) abs(am) <= 2^(-a_o) * abs(ah) abs(al) <= 2^(-a_u) * abs(am) abs(bm) <= 2^(-b_o) * abs(bh) abs(bl) <= 2^(-b_u) * abs(bm) where b_o >= a_o >= 4 b_u >= a_u >= 4 Condition (i) may not be respected if one can assume in this case that ah=am=al=0 Guarantees: resm and resl are non-overlapping resm = round-to-nearest(resm + resl) abs(resm) <= 2^(-min(a_o,b_o) + 5) * abs(resh) resh+resm+resl = (ah+am+al + bh+bm+bl) * (1+eps) where abs(eps) <= 2^(-min(a_o+a_u,b_o+b_u)-47) + 2^(-min(a_o,a_u)-98) Details: resh, resm and resl are considered to be pointers */ #define Add33(resh, resm, resl, ah, am, al, bh, bm, bl) \ { \ double _t1, _t2, _t3, _t4, _t5, _t6, _t7, _t8; \ \ Add12((*(resh)),_t1,(ah),(bh)); \ Add12Cond(_t2,_t3,(am),(bm)); \ _t6 = (al) + (bl); \ Add12Cond(_t7,_t4,_t1,_t2); \ _t5 = _t3 + _t4; \ _t8 = _t5 + _t6; \ Add12Cond((*(resm)),(*(resl)),_t7,_t8); \ } /* Add33Cond Procedure for adding two triple double numbers resulting in a triple double number Arguments: two triple double numbers: ah, am, al and bh, bm, bl Results: a triple double number resh, resm, resl Preconditions: abs(am) <= 2^(-a_o) * abs(ah) abs(al) <= 2^(-a_u) * abs(am) abs(bm) <= 2^(-b_o) * abs(bh) abs(bl) <= 2^(-b_u) * abs(bm) where b_o >= a_o >= 4 b_u >= a_u >= 4 Condition (i) may not be respected if one can assume in this case that ah=am=al=0 Guarantees: TODO Details: resh, resm and resl are considered to be pointers */ #define Add33Cond(resh, resm, resl, ah, am, al, bh, bm, bl) \ { \ double _t1, _t2, _t3, _t4, _t5, _t6, _t7, _t8; \ \ Add12Cond((*(resh)),_t1,(ah),(bh)); \ Add12Cond(_t2,_t3,(am),(bm)); \ _t6 = (al) + (bl); \ Add12Cond(_t7,_t4,_t1,_t2); \ _t5 = _t3 + _t4; \ _t8 = _t5 + _t6; \ Add12Cond((*(resm)),(*(resl)),_t7,_t8); \ } /* Add233 Procedure for adding a double double number to a triple double number resulting in a triple double number Arguments: a double double number ah, al a triple double number bh, bm, bl Results: a triple double number resh, resm, resl Preconditions: abs(ah) > abs(al) ah and al do not overlap ah = round-to-nearest(ah + al) abs(bh) <= 2^(-2) * abs(ah) abs(bm) <= 2^(-b_o) * abs(bh) abs(bl) <= 2^(-b_u) * abs(bm) where b_o >= 2 b_u >= 1 Guarantees: resm and resl are non-overlapping resm = round-to-nearest(resm + resl) abs(resm) <= 2^(\gamma) * abs(resh) where \gamma >= min(45,b_o-4,b_o+b_u-2) resh+resm+resl=((ah+al) + (bh+bm+bl)) * (1+eps) where abs(eps) <= <= 2^(-b_o-b_u-52) + 2^(-b_o-104) + 2^(-153) Details: resh, resm and resl are considered to be pointers */ #define Add233(resh, resm, resl, ah, al, bh, bm, bl) \ { \ double _t1, _t2, _t3, _t4, _t5, _t6, _t7; \ \ Add12((*(resh)),_t1,(ah),(bh)); \ Add12Cond(_t2,_t3,(al),(bm)); \ Add12Cond(_t4,_t5,_t1,_t2); \ _t6 = _t3 + (bl); \ _t7 = _t6 + _t5; \ Add12Cond((*(resm)),(*(resl)),_t4,_t7); \ } /* Add123 Procedure for adding a double number to a double double number resulting in a triple double number Arguments: a double number a a double double number bh, bl Results: a triple double number resh, resm, resl Preconditions: abs(bh) <= 2^(-2) * abs(a) abs(bl) <= 2^(-53) * abs(bh) Guarantees: resm and resl are non-overlapping resm = round-to-nearest(resm + resl) abs(resm) <= 2^(-\gamma) * abs(resh) where \gamma >= 52 resh+resm+resl=(a + (bh+bm+bl)) exactly Details: resh, resm and resl are considered to be pointers */ #define Add123(resh, resm, resl, a, bh, bl) \ { \ double _t1; \ \ Add12((*(resh)),_t1,(a),(bh)); \ Add12((*(resm)),(*(resl)),_t1,(bl)); \ } /* Add213 Procedure for adding a double double number to a double number resulting in a triple double number Arguments: a double double number ah, al a double number b Results: a triple double number resh, resm, resl Preconditions: abs(b) <= 2^(-2) * abs(ah) abs(al) <= 2^(-53) * abs(ah) Guarantees: resm and resl are non-overlapping resm = round-to-nearest(resm + resl) abs(resm) <= 2^(-\gamma) * abs(resh) where \gamma >= 52 resh+resm+resl=(a + (bh+bm+bl)) exactly Details: resh, resm and resl are considered to be pointers */ #define Add213(resh, resm, resl, ah, al, b) \ { \ double _t1; \ \ Add12((*(resh)),_t1,(ah),(b)); \ Add12Cond((*(resm)),(*(resl)),(al),(b)); \ } /* Add23 Procedure for adding a double-double number to a double-double number resulting in a triple double number Arguments: a double double number ah, al a double double number bh, bl Results: a triple double number resh, resm, resl Preconditions: abs(bh) <= 2^(-2) * abs(ah) abs(al) <= 2^(-53) * abs(ah) abs(bl) <= 2^(-53) * abs(bh) Guarantees: TO DO Details: resh, resm and resl are considered to be pointers */ #define Add23(resh, resm, resl, ah, al, bh, bl) \ { \ double _t1, _t2, _t3, _t4, _t5, _t6; \ \ Add12((*(resh)),_t1,(ah),(bh)); \ Add12Cond(_t2,_t3,(al),(bl)); \ Add12Cond(_t4,_t5,_t1,_t2); \ _t6 = _t3 + _t5; \ Add12Cond((*(resm)),(*(resl)),_t4,_t6); \ } /* Add133 Procedure for adding a double number to a triple double number resulting in a triple double number Arguments: a double number a a triple double number bh, bm, bl Results: a triple double number resh, resm, resl Preconditions: abs(bh) <= 2^(-2) * abs(a) abs(bm) <= 2^(-b_o) * abs(bh) abs(bl) <= 2^(-b_u) * abs(bm) where b_o >= 2 b_u >= 1 Guarantees: resm and resl are non-overlapping resm = round-to-nearest(resm + resl) abs(resm) <= 2^(\gamma) * abs(resh) where \gamma >= min(47,2-b_o,1-b_o-b_u) resh+resm+resl=(a + (bh+bm+bl)) * (1+eps) where abs(eps) <= <= 2^(-52-b_o-b_u) + 2^(-154) Details: resh, resm and resl are considered to be pointers */ #define Add133(resh, resm, resl, a, bh, bm, bl) \ { \ double _t1, _t2, _t3, _t4; \ \ Add12((*(resh)),_t1,(a),(bh)); \ Add12Cond(_t2,_t3,_t1,(bm)); \ _t4 = _t3 + (bl); \ Add12Cond((*(resm)),(*(resl)),_t2,_t4); \ } /* Add133Cond Procedure for adding a double number to a triple double number resulting in a triple double number Arguments: a double number a a triple double number bh, bm, bl Results: a triple double number resh, resm, resl Preconditions: abs(bm) <= 2^(-b_o) * abs(bh) abs(bl) <= 2^(-b_u) * abs(bm) where b_o >= 2 b_u >= 1 Guarantees: resm and resl are non-overlapping resm = round-to-nearest(resm + resl) abs(resm) <= 2^(\gamma) * abs(resh) where TODO resh+resm+resl=(a + (bh+bm+bl)) * (1+eps) where abs(eps) <= TODO Details: resh, resm and resl are considered to be pointers */ #define Add133Cond(resh, resm, resl, a, bh, bm, bl) \ { \ double _t1, _t2, _t3, _t4; \ \ Add12Cond((*(resh)),_t1,(a),(bh)); \ Add12Cond(_t2,_t3,_t1,(bm)); \ _t4 = _t3 + (bl); \ Add12Cond((*(resm)),(*(resl)),_t2,_t4); \ } /* Add233Cond Procedure for adding a double double number to a triple double number resulting in a triple double number Arguments: a double double number ah, al a triple double number bh, bm, bl Results: a triple double number resh, resm, resl Preconditions: abs(ah) > abs(al) ah and al do not overlap ah = round-to-nearest(ah + al) abs(bm) <= 2^(-b_o) * abs(bh) abs(bl) <= 2^(-b_u) * abs(bm) where b_o >= 2 b_u >= 1 Guarantees: resm and resl are non-overlapping resm = round-to-nearest(resm + resl) abs(resm) <= 2^(\gamma) * abs(resh) where \gamma >= ???? resh+resm+resl=((ah+al) + (bh+bm+bl)) * (1+eps) where abs(eps) <= <= ???? Details: resh, resm and resl are considered to be pointers */ #define Add233Cond(resh, resm, resl, ah, al, bh, bm, bl) \ { \ double _t1, _t2, _t3, _t4, _t5, _t6, _t7; \ \ Add12Cond((*(resh)),_t1,(ah),(bh)); \ Add12Cond(_t2,_t3,(al),(bm)); \ Add12Cond(_t4,_t5,_t1,_t2); \ _t6 = _t3 + (bl); \ _t7 = _t6 + _t5; \ Add12Cond((*(resm)),(*(resl)),_t4,_t7); \ } /* Mul33 Procedure for multiplying two triple double numbers resulting in a triple double number Arguments: two triple double numbers: ah, am, al and bh, bm, bl Results: a triple double number resh, resm, resl Preconditions: abs(am) <= 2^(-a_o) * abs(ah) abs(al) <= 2^(-a_u) * abs(am) abs(bm) <= 2^(-b_o) * abs(bh) abs(bl) <= 2^(-b_u) * abs(bm) where b_o, a_o >= 5 b_u, a_u >= 5 Guarantees: resm and resl are non-overlapping resm = round-to-nearest(resm + resl) abs(resm) <= 2^(-g_o) * abs(resh) with g_o > min(48,-4+a_o,-4+b_o,-4+a_o-b_o) resh+resm+resl = (ah+am+al) * (bh+bm+bl) * (1+eps) where abs(eps) <= 2^-151 + 2^-99-a_o + 2^-99-b_o + + 2^-49-a_o-a_u + 2^-49-b_o-b_u + 2^50-a_o-b_o-b_u + + 2^50-a_o-b_o-b_u + 2^-101-a_o-b_o + 2^-52-a_o-a_u-b_o-b_u Details: resh, resm and resl are considered to be pointers */ #define DoMul33(resh, resm, resl, ah, am, al, bh, bm, bl) \ { \ double _t1, _t2, _t3, _t4, _t5, _t6, _t7, _t8, _t9; \ double _t10, _t11, _t12, _t13, _t14, _t15, _t16, _t17; \ double _t18, _t19, _t20, _t21, _t22; \ \ Mul12((resh),&_t1,(ah),(bh)); \ Mul12(&_t2,&_t3,(ah),(bm)); \ Mul12(&_t4,&_t5,(am),(bh)); \ Mul12(&_t6,&_t7,(am),(bm)); \ _t8 = (ah) * (bl); \ _t9 = (al) * (bh); \ _t10 = (am) * (bl); \ _t11 = (al) * (bm); \ _t12 = _t8 + _t9; \ _t13 = _t10 + _t11; \ Add12Cond(_t14,_t15,_t1,_t6); \ _t16 = _t7 + _t15; \ _t17 = _t12 + _t13; \ _t18 = _t16 + _t17; \ Add12Cond(_t19,_t20,_t14,_t18); \ Add22Cond(&_t21,&_t22,_t2,_t3,_t4,_t5); \ Add22Cond((resm),(resl),_t21,_t22,_t19,_t20); \ } /* Mul133 Procedure for multiplying double by a triple double number resulting in a triple double number Arguments: a double a a triple double bh, bm, bl Results: a triple double number resh, resm, resl Preconditions: abs(bm) <= 2^(-b_o) * abs(bh) abs(bl) <= 2^(-b_u) * abs(bm) where b_o >= 2 b_u >= 2 Guarantees: resm and resl are non-overlapping resm = round-to-nearest(resm + resl) abs(resm) <= 2^(-g_o) * abs(resh) with g_o > min(47,-5-b_o,-5+b_o+b_u) resh+resm+resl = a * (bh+bm+bl) * (1+eps) where abs(eps) <= 2^-49-b_o-b_u + 2^-101-b_o + 2^-156 Details: resh, resm and resl are considered to be pointers */ #define DoMul133(resh, resm, resl, a, bh, bm, bl) \ { \ double _t2, _t3, _t4, _t5, _t7, _t8, _t9, _t10; \ \ Mul12((resh),&_t2,(a),(bh)); \ Mul12(&_t3,&_t4,(a),(bm)); \ _t5 = (a) * (bl); \ Add12Cond(_t9,_t7,_t2,_t3); \ _t8 = _t4 + _t5; \ _t10 = _t7 + _t8; \ Add12Cond((*(resm)),(*(resl)),_t9,_t10); \ } /* Mul123 Procedure for multiplying double by a double double number resulting in a triple double number Arguments: a double a a double double bh, bl Results: a triple double number resh, resm, resl Guarantees: resm and resl are non-overlapping resm = round-to-nearest(resm + resl) abs(resm) <= 2^(-g_o) * abs(resh) with g_o > 47 resh+resm+resl = a * (bh+bm) * (1+eps) where abs(eps) <= 2^-154 Details: resh, resm and resl are considered to be pointers */ #define DoMul123(resh, resm, resl, a, bh, bl) \ { \ double _t1, _t2, _t3, _t4, _t5, _t6; \ \ Mul12((resh),&_t1,(a),(bh)); \ Mul12(&_t2,&_t3,(a),(bl)); \ Add12Cond(_t5,_t4,_t1,_t2); \ _t6 = _t3 + _t4; \ Add12Cond((*(resm)),(*(resl)),_t5,_t6); \ } /* ReturnRoundToNearest3 Procedure for rounding a triple to a double number in round-to-nearest-ties-to-even mode. Arguments: a triple double number xh, xm, xl Results: a double number xprime returned by a return-statement Preconditions: xh, xm and xl are non-overlapping xm = RN(xm +math xl) xh != 0, xm != 0 xl = 0 iff xm != +/- 0.5 * ulp(xh) (0.25 if xh = 2^e) Guarantees: xprime = RN(xh + xm + xl) Sideeffects: returns, i.e. leaves the function */ #define ReturnRoundToNearest3(xh,xm,xl) \ { \ double _t1, _t2, _t3, _t4, _t5, _t6; \ db_number _xp, _xn; \ \ _xp.d = (xh); \ _xn.i[HI] = _xp.i[HI]; \ _xn.i[LO] = _xp.i[LO]; \ _xn.l--; \ _t1 = _xn.d; \ _xp.l++; \ _t4 = _xp.d; \ _t2 = (xh) - _t1; \ _t3 = _t2 * -0.5; \ _t5 = _t4 - (xh); \ _t6 = _t5 * 0.5; \ if (((xm) != _t3) && ((xm) != _t6)) return ((xh) + (xm)); \ if ((xm) * (xl) > 0.0) { \ if ((xh) * (xl) > 0.0) \ return _t4; \ else \ return _t1; \ } else return (xh); \ } /* ReturnRoundToNearest3Other ATTENTION: THIS CURRENTLY UNPROVEN CODE !!! Procedure for rounding a triple to a double number in round-to-nearest-ties-to-even mode. Arguments: a triple double number xh, xm, xl Results: a double number xprime returned by a return-statement Preconditions: |xm + xl| <= 2^(-5) * |xh| Guarantees: xprime = RN(xh + xm + xl) Sideeffects: returns, i.e. leaves the function */ #define ReturnRoundToNearest3Other(xh,xm,xl) \ { \ double _t3, _t4; \ db_number _t3db; \ \ Add12(_t3,_t4,(xm),(xl)); \ if (_t4 != 0.0) { \ _t3db.d = _t3; \ if (!(_t3db.i[LO] & 0x00000001)) { \ if ((_t4 > 0.0) ^ ((_t3db.i[HI] & 0x80000000) != 0)) \ _t3db.l++; \ else \ _t3db.l--; \ _t3 = _t3db.d; \ } \ } \ return (xh) + _t3; \ } /* ReturnRoundUpwards3 Procedure for rounding a triple to a double number in round-upwards mode. Arguments: a triple double number xh, xm, xl Results: a double number xprime returned by a return-statement Preconditions: xh, xm and xl are non-overlapping xm = RN(xm +math xl) xh != 0, xm != 0 Exact algebraic images have already been filtered out. Guarantees: xprime = RU(xh + xm + xl) Sideeffects: returns, i.e. leaves the function */ #define ReturnRoundUpwards3(xh,xm,xl) \ { \ double _t1, _t2, _t3; \ db_number _tdb; \ \ Add12(_t1,_t2,(xh),(xm)); \ _t3 = _t2 + (xl); \ if (_t3 > 0.0) { \ if (_t1 > 0.0) { \ _tdb.d = _t1; \ _tdb.l++; \ return _tdb.d; \ } else { \ _tdb.d = _t1; \ _tdb.l--; \ return _tdb.d; \ } \ } else return _t1; \ } /* ReturnRoundDownwards3 Procedure for rounding a triple to a double number in round-downwards mode. Arguments: a triple double number xh, xm, xl Results: a double number xprime returned by a return-statement Preconditions: xh, xm and xl are non-overlapping xm = RN(xm +math xl) xh != 0, xm != 0 Exact algebraic images have already been filtered out. Guarantees: xprime = RD(xh + xm + xl) Sideeffects: returns, i.e. leaves the function */ #define ReturnRoundDownwards3(xh,xm,xl) \ { \ double _t1, _t2, _t3; \ db_number _tdb; \ \ Add12(_t1,_t2,(xh),(xm)); \ _t3 = _t2 + (xl); \ if (_t3 < 0.0) { \ if (_t1 > 0.0) { \ _tdb.d = _t1; \ _tdb.l--; \ return _tdb.d; \ } else { \ _tdb.d = _t1; \ _tdb.l++; \ return _tdb.d; \ } \ } else return _t1; \ } /* ReturnRoundTowardsZero3 Procedure for rounding a triple to a double number in round-towards-zero mode. Arguments: a triple double number xh, xm, xl Results: a double number xprime returned by a return-statement Preconditions: xh, xm and xl are non-overlapping xm = RN(xm +math xl) xh != 0, xm != 0 Exact algebraic images have already been filtered out. Guarantees: xprime = RZ(xh + xm + xl) Sideeffects: returns, i.e. leaves the function */ #define ReturnRoundTowardsZero3(xh,xm,xl) \ { \ double _t1, _t2, _t3; \ db_number _tdb; \ \ Add12(_t1,_t2,(xh),(xm)); \ _t3 = _t2 + (xl); \ if (_t1 > 0.0) { \ if (_t3 < 0.0) { \ _tdb.d = _t1; \ _tdb.l--; \ return _tdb.d; \ } else return _t1; \ } else { \ if (_t3 > 0.0) { \ _tdb.d = _t1; \ _tdb.l--; \ return _tdb.d; \ } else return _t1; \ } \ } /* ReturnRoundUpwards3Unfiltered Procedure for rounding a triple to a double number in round-upwards mode. Arguments: a triple double number xh, xm, xl a double constant wca representing 2^k where 2^-k is Lefevre's worst case accuracy Results: a double number xprime returned by a return-statement Preconditions: xh, xm and xl are non-overlapping xm = RN(xm +math xl) xh != 0, xm != 0 Guarantees: xprime = RU(xh + xm + xl) Sideeffects: returns, i.e. leaves the function */ #define ReturnRoundUpwards3Unfiltered(xh,xm,xl,wca) \ { \ double _t1, _t2, _t3; \ db_number _tdb, _tdb2; \ \ Add12(_t1,_t2,(xh),(xm)); \ _t3 = _t2 + (xl); \ if (_t3 > 0.0) { \ _tdb2.d = wca * _t3; \ _tdb.d = _t1; \ if ((_tdb2.i[HI] & 0x7ff00000) < (_tdb.i[HI] & 0x7ff00000)) \ return _t1; \ if (_t1 > 0.0) { \ _tdb.l++; \ return _tdb.d; \ } else { \ _tdb.l--; \ return _tdb.d; \ } \ } else return _t1; \ } /* ReturnRoundDownwards3Unfiltered Procedure for rounding a triple to a double number in round-downwards mode. Arguments: a triple double number xh, xm, xl a double constant wca representing 2^k where 2^-k is Lefevre's worst case accuracy Results: a double number xprime returned by a return-statement Preconditions: xh, xm and xl are non-overlapping xm = RN(xm +math xl) xh != 0, xm != 0 Guarantees: xprime = RD(xh + xm + xl) Sideeffects: returns, i.e. leaves the function */ #define ReturnRoundDownwards3Unfiltered(xh,xm,xl,wca) \ { \ double _t1, _t2, _t3; \ db_number _tdb, _tdb2; \ \ Add12(_t1,_t2,(xh),(xm)); \ _t3 = _t2 + (xl); \ if (_t3 < 0.0) { \ _tdb2.d = wca * _t3; \ _tdb.d = _t1; \ if ((_tdb2.i[HI] & 0x7ff00000) < (_tdb.i[HI] & 0x7ff00000)) \ return _t1; \ if (_t1 > 0.0) { \ _tdb.l--; \ return _tdb.d; \ } else { \ _tdb.l++; \ return _tdb.d; \ } \ } else return _t1; \ } /* ReturnRoundTowardsZero3Unfiltered Procedure for rounding a triple to a double number in round-towards-zero mode. Arguments: a triple double number xh, xm, xl a double constant wca representing 2^k where 2^-k is Lefevre's worst case accuracy Results: a double number xprime returned by a return-statement Preconditions: xh, xm and xl are non-overlapping xm = RN(xm +math xl) xh != 0, xm != 0 Guarantees: xprime = RZ(xh + xm + xl) Sideeffects: returns, i.e. leaves the function */ #define ReturnRoundTowardsZero3Unfiltered(xh,xm,xl,wca) \ { \ if ((xh) > 0) \ ReturnRoundDownwards3Unfiltered((xh),(xm),(xl),(wca)) \ else \ ReturnRoundUpwards3Unfiltered((xh),(xm),(xl),(wca)) \ } /* RoundToNearest3 Procedure for rounding a triple to a double number in round-to-nearest-ties-to-even mode. Arguments: a triple double number xh, xm, xl Results: a double number xprime returned by a return-statement Preconditions: xh, xm and xl are non-overlapping xm = RN(xm +math xl) xh != 0, xm != 0 xl = 0 iff xm != +/- 0.5 * ulp(xh) (0.25 if xh = 2^e) Guarantees: xprime = RN(xh + xm + xl) Details: res is considered to be a pointer */ #define RoundToNearest3(res,xh,xm,xl) \ { \ double _t1, _t2, _t3, _t4, _t5, _t6; \ db_number _xp, _xn; \ \ _xp.d = (xh); \ _xn.i[HI] = _xp.i[HI]; \ _xn.i[LO] = _xp.i[LO]; \ _xn.l--; \ _t1 = _xn.d; \ _xp.l++; \ _t4 = _xp.d; \ _t2 = (xh) - _t1; \ _t3 = _t2 * -0.5; \ _t5 = _t4 - (xh); \ _t6 = _t5 * 0.5; \ if (((xm) != _t3) && ((xm) != _t6)) \ (*(res)) = ((xh) + (xm)); \ else { \ if ((xm) * (xl) > 0.0) { \ if ((xh) * (xl) > 0.0) \ (*(res)) = _t4; \ else \ (*(res)) = _t1; \ } else (*(res)) = (xh); \ } \ } /* RoundUpwards3 Procedure for rounding a triple to a double number in round-upwards mode. Arguments: a triple double number xh, xm, xl Results: a double number xprime returned by a return-statement Preconditions: xh, xm and xl are non-overlapping xm = RN(xm +math xl) xh != 0, xm != 0 Exact algebraic images have already been filtered out. Guarantees: xprime = RU(xh + xm + xl) Details: res is considered to be a pointer */ #define RoundUpwards3(res,xh,xm,xl) \ { \ double _t1, _t2, _t3; \ db_number _tdb; \ \ Add12(_t1,_t2,(xh),(xm)); \ _t3 = _t2 + (xl); \ if (_t3 > 0.0) { \ if (_t1 > 0.0) { \ _tdb.d = _t1; \ _tdb.l++; \ (*(res)) = _tdb.d; \ } else { \ _tdb.d = _t1; \ _tdb.l--; \ (*(res)) = _tdb.d; \ } \ } else (*(res)) = _t1; \ } /* RoundDownwards3 Procedure for rounding a triple to a double number in round-downwards mode. Arguments: a triple double number xh, xm, xl Results: a double number xprime returned by a return-statement Preconditions: xh, xm and xl are non-overlapping xm = RN(xm +math xl) xh != 0, xm != 0 Exact algebraic images have already been filtered out. Guarantees: xprime = RD(xh + xm + xl) Details: res is considered to be a pointer */ #define RoundDownwards3(res,xh,xm,xl) \ { \ double _t1, _t2, _t3; \ db_number _tdb; \ \ Add12(_t1,_t2,(xh),(xm)); \ _t3 = _t2 + (xl); \ if (_t3 < 0.0) { \ if (_t1 > 0.0) { \ _tdb.d = _t1; \ _tdb.l--; \ (*(res)) = _tdb.d; \ } else { \ _tdb.d = _t1; \ _tdb.l++; \ (*(res)) = _tdb.d; \ } \ } else (*(res)) = _t1; \ } /* RoundTowardsZero3 Procedure for rounding a triple to a double number in round-towards-zero mode. Arguments: a triple double number xh, xm, xl Results: a double number xprime returned by a return-statement Preconditions: xh, xm and xl are non-overlapping xm = RN(xm +math xl) xh != 0, xm != 0 Exact algebraic images have already been filtered out. Guarantees: xprime = RZ(xh + xm + xl) Details: res is considered to be a pointer */ #define RoundTowardsZero3(res,xh,xm,xl) \ { \ double _t1, _t2, _t3; \ db_number _tdb; \ \ Add12(_t1,_t2,(xh),(xm)); \ _t3 = _t2 + (xl); \ if (_t1 > 0.0) { \ if (_t3 < 0.0) { \ _tdb.d = _t1; \ _tdb.l--; \ (*(res)) = _tdb.d; \ } else (*(res)) = _t1; \ } else { \ if (_t3 > 0.0) { \ _tdb.d = _t1; \ _tdb.l--; \ (*(res)) = _tdb.d; \ } else (*(res)) = _t1; \ } \ } /* sqrt13 Computes a triple-double approximation of sqrt(x) Should be provable to be exact to at least 140 bits. Only handles the following special cases: - x == 0 - subnormal x The following cases are not handled: - x < 0 - x = +/-Infty, NaN */ #define DoSqrt13(resh, resm, resl , x) \ { \ db_number _xdb; \ int _E; \ double _m, _r0, _r1, _r2, _r3h, _r3l, _r4h, _r4l; \ double _r5h, _r5m, _r5l, _srtmh, _srtml, _srtmm; \ double _r2PHr2h, _r2PHr2l, _r2Sqh, _r2Sql; \ double _mMr2h, _mMr2l, _mMr2Ch, _mMr2Cl; \ double _MHmMr2Ch, _MHmMr2Cl; \ double _r3Sqh, _r3Sql, _mMr3Sqh, _mMr3Sql; \ double _srtmhover,_srtmmover,_srtmlover; \ double _HmMr4Sqm,_HmMr4Sql, _mMr4Sqhover, _mMr4Sqmover, _mMr4Sqlover; \ double _mMr4Sqh, _mMr4Sqm, _mMr4Sql, _r4Sqh, _r4Sqm, _r4Sql; \ \ /* Special case x = 0 */ \ if ((x) == 0) { \ (*(resh)) = (x); \ (*(resm)) = 0; \ (*(resl)) = 0; \ } else { \ \ _E = 0; \ \ /* Convert to integer format */ \ _xdb.d = (x); \ \ /* Handle subnormal case */ \ if (_xdb.i[HI] < 0x00100000) { \ _E = -52; \ _xdb.d *= ((db_number) ((double) SQRTTWO52)).d; \ /* make x a normal number */ \ } \ \ /* Extract exponent E and mantissa m */ \ _E += (_xdb.i[HI]>>20)-1023; \ _xdb.i[HI] = (_xdb.i[HI] & 0x000fffff) | 0x3ff00000; \ _m = _xdb.d; \ \ /* Make exponent even */ \ if (_E & 0x00000001) { \ _E++; \ _m *= 0.5; /* Suppose now 1/2 <= m <= 2 */ \ } \ \ /* Construct sqrt(2^E) = 2^(E/2) */ \ _xdb.i[HI] = (_E/2 + 1023) << 20; \ _xdb.i[LO] = 0; \ \ /* Compute initial approximation to r = 1/sqrt(m) */ \ \ _r0 = SQRTPOLYC0 + \ _m * (SQRTPOLYC1 + _m * (SQRTPOLYC2 + _m * (SQRTPOLYC3 + _m * SQRTPOLYC4))); \ \ /* Iterate two times on double precision */ \ \ _r1 = 0.5 * _r0 * (3 - _m * (_r0 * _r0)); \ _r2 = 0.5 * _r1 * (3 - _m * (_r1 * _r1)); \ \ /* Iterate two times on double-double precision */ \ \ Mul12(&_r2Sqh, &_r2Sql, _r2, _r2); \ Add12(_r2PHr2h, _r2PHr2l, _r2, (0.5 * _r2)); \ Mul12(&_mMr2h, &_mMr2l, _m, _r2); \ Mul22(&_mMr2Ch, &_mMr2Cl, _mMr2h, _mMr2l, _r2Sqh, _r2Sql); \ \ _MHmMr2Ch = -0.5 * _mMr2Ch; \ _MHmMr2Cl = -0.5 * _mMr2Cl; \ \ Add22(&_r3h, &_r3l, _r2PHr2h, _r2PHr2l, _MHmMr2Ch, _MHmMr2Cl); \ \ Mul22(&_r3Sqh, &_r3Sql, _r3h, _r3l, _r3h, _r3l); \ Mul22(&_mMr3Sqh, &_mMr3Sql, _m, 0.0, _r3Sqh, _r3Sql); \ /* To prove: mMr3Sqh = 1.0 in each case */ \ \ Mul22(&_r4h, &_r4l, _r3h, _r3l, 1.0, (-0.5 * _mMr3Sql)); \ \ /* Iterate once on triple-double precision */ \ \ Mul23(&_r4Sqh, &_r4Sqm, &_r4Sql, _r4h, _r4l, _r4h, _r4l); \ Mul133(&_mMr4Sqhover, &_mMr4Sqmover, &_mMr4Sqlover, _m, _r4Sqh, _r4Sqm, _r4Sql); \ Renormalize3(&_mMr4Sqh, &_mMr4Sqm, &_mMr4Sql, _mMr4Sqhover, _mMr4Sqmover, _mMr4Sqlover); \ /* To prove: mMr4Sqh = 1.0 in each case */ \ \ _HmMr4Sqm = -0.5 * _mMr4Sqm; \ _HmMr4Sql = -0.5 * _mMr4Sql; \ \ Mul233(&_r5h,&_r5m,&_r5l,_r4h,_r4l,1.0,_HmMr4Sqm,_HmMr4Sql); \ \ /* Multiply obtained reciprocal square root by m */ \ \ Mul133(&_srtmhover, &_srtmmover, &_srtmlover,_m,_r5h,_r5m,_r5l); \ \ Renormalize3(&_srtmh,&_srtmm,&_srtml,_srtmhover,_srtmmover,_srtmlover); \ \ /* Multiply componentwise by sqrt(2^E) */ \ /* which is an integer power of 2 that may not produce a subnormal */ \ \ (*(resh)) = _xdb.d * _srtmh; \ (*(resm)) = _xdb.d * _srtmm; \ (*(resl)) = _xdb.d * _srtml; \ \ } /* End: special case 0 */ \ } /* recpr33() Computes a triple-double reciprocal of a triple-double Should be provable to be exact to at least 140 bits No special case handling is done dh + dm + dl must be renormalized The result is renormalized */ #define DoRecpr33(resh, resm, resl, dh, dm, dl) \ { \ double _rec_r1, _rec_t1, _rec_t2, _rec_t3, _rec_t4, _rec_t5, _rec_t6, _rec_t7, _rec_t8, _rec_t9, _rec_t10, _rec_t11, _rec_t12, _rec_t13, _rec_t14; \ double _rec_r2h, _rec_r2l, _rec_t15, _rec_t16, _rec_t17, _rec_t18, _rec_t19, _rec_t20, _rec_t21, _rec_t22, _rec_t23; \ \ _rec_r1 = 1.0 / (dh); \ Mul12(&_rec_t1,&_rec_t2,_rec_r1,(dh)); \ _rec_t3 = _rec_t1 - 1.0; \ Add12Cond(_rec_t4,_rec_t5,_rec_t3,_rec_t2); \ Mul12(&_rec_t6,&_rec_t7,_rec_r1,(dm)); \ Add12(_rec_t8,_rec_t9,-1.0,_rec_t6); \ _rec_t10 = _rec_t9 + _rec_t7; \ Add12(_rec_t11,_rec_t12,_rec_t8,_rec_t10); \ _rec_r1 = -_rec_r1; \ Add22Cond(&_rec_t13,&_rec_t14,_rec_t4,_rec_t5,_rec_t11,_rec_t12); \ Mul122(&_rec_r2h,&_rec_r2l,_rec_r1,_rec_t13,_rec_t14); \ Mul233(&_rec_t15,&_rec_t16,&_rec_t17,_rec_r2h,_rec_r2l,(dh),(dm),(dl)); \ Renormalize3(&_rec_t18,&_rec_t19,&_rec_t20,_rec_t15,_rec_t16,_rec_t17); \ _rec_t18 = -1.0; \ Mul233(&_rec_t21,&_rec_t22,&_rec_t23,_rec_r2h,_rec_r2l,_rec_t18,_rec_t19,_rec_t20); \ _rec_t21 = -_rec_t21; _rec_t22 = -_rec_t22; _rec_t23 = -_rec_t23; \ Renormalize3((resh),(resm),(resl),_rec_t21,_rec_t22,_rec_t23); \ } #endif /*TRIPLE_rec_DOUBLE_rec_H*/ interval-2.1.0/src/crlibm_function.cc0000644000000000000000000001761413031036767015756 0ustar 00000000000000/* Copyright 2015-2016 Oliver Heimlich 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 . */ #include #include "crlibm/crlibm.h" typedef double (*crlibm_unary_fun) (const double op); // Evaluate an unary crlibm function on a binary64 matrix void evaluate ( Matrix &arg1, // Operand 1 and result const crlibm_unary_fun f) // The crlibm function to evaluate (element-wise) { uint64_t old_state = crlibm_init (); const octave_idx_type n = arg1.numel (); for (octave_idx_type i = 0; i < n; i ++) { arg1.elem (i) = (*f) (arg1.elem (i)); } crlibm_exit (old_state); } DEFUN_DLD (crlibm_function, args, nargout, "-*- texinfo -*-\n" "@documentencoding UTF-8\n" "@defun crlibm_function ('acos', @var{R}, @var{X})\n" "@defunx crlibm_function ('asin', @var{R}, @var{X})\n" "@defunx crlibm_function ('atan', @var{R}, @var{X})\n" "@defunx crlibm_function ('cos', @var{R}, @var{X})\n" "@defunx crlibm_function ('cosh', @var{R}, @var{X})\n" "@defunx crlibm_function ('exp', @var{R}, @var{X})\n" "@defunx crlibm_function ('expm1', @var{R}, @var{X})\n" "@defunx crlibm_function ('log', @var{R}, @var{X})\n" "@defunx crlibm_function ('log10', @var{R}, @var{X})\n" "@defunx crlibm_function ('log1p', @var{R}, @var{X})\n" "@defunx crlibm_function ('log2', @var{R}, @var{X})\n" "@defunx crlibm_function ('sin', @var{R}, @var{X})\n" "@defunx crlibm_function ('sinh', @var{R}, @var{X})\n" "@defunx crlibm_function ('tan', @var{R}, @var{X})\n" "\n" "Evaluate a function in binary64 with correctly rounded result." "\n\n" "Parameter 1 is the function's name in GNU Octave, Parameter 2 is the " "rounding direction (@option{0}: towards zero, @option{0.5}: towards " "nearest and ties to even, @option{+inf}: towards positive infinity, " "@option{-inf}: towards negative infinity). " "Parameters 3 is the operand to the function." "\n\n" "Evaluated on matrices, the function will be applied element-wise." "\n\n" "The result is guaranteed to be correctly rounded. That is, the function " "is evaluated with (virtually) infinite precision and the exact result is " "approximated with a binary64 number using the desired rounding direction." "@seealso{mpfr_function_d}\n" "@end defun" ) { const int nargin = args.length (); if (nargin != 3) { print_usage (); return octave_value_list (); } const std::string function = args(0).string_value (); const double rnd = args(1).scalar_value (); Matrix arg1 = args(2).matrix_value (); if (error_state) return octave_value_list (); if (rnd == INFINITY) { // Round upwards if (function == "acos") evaluate (arg1, &acos_ru); else if (function == "asin") evaluate (arg1, &asin_ru); else if (function == "atan") evaluate (arg1, &atan_ru); else if (function == "cos") evaluate (arg1, &cos_ru); else if (function == "cosh") evaluate (arg1, &cosh_ru); else if (function == "exp") evaluate (arg1, &exp_ru); else if (function == "expm1") evaluate (arg1, &expm1_ru); else if (function == "log") evaluate (arg1, &log_ru); else if (function == "log10") evaluate (arg1, &log10_ru); else if (function == "log1p") evaluate (arg1, &log1p_ru); else if (function == "log2") evaluate (arg1, &log2_ru); else if (function == "sin") evaluate (arg1, &sin_ru); else if (function == "sinh") evaluate (arg1, &sinh_ru); else if (function == "tan") evaluate (arg1, &tan_ru); else { print_usage(); return octave_value_list (); } } else if (rnd == -INFINITY) { // Round downwards if (function == "acos") evaluate (arg1, &acos_rd); else if (function == "asin") evaluate (arg1, &asin_rd); else if (function == "atan") evaluate (arg1, &atan_rd); else if (function == "cos") evaluate (arg1, &cos_rd); else if (function == "cosh") evaluate (arg1, &cosh_rd); else if (function == "exp") evaluate (arg1, &exp_rd); else if (function == "expm1") evaluate (arg1, &expm1_rd); else if (function == "log") evaluate (arg1, &log_rd); else if (function == "log10") evaluate (arg1, &log10_rd); else if (function == "log1p") evaluate (arg1, &log1p_rd); else if (function == "log2") evaluate (arg1, &log2_rd); else if (function == "sin") evaluate (arg1, &sin_rd); else if (function == "sinh") evaluate (arg1, &sinh_rd); else if (function == "tan") evaluate (arg1, &tan_rd); else { print_usage(); return octave_value_list (); } } else if (rnd == 0.0) { // Round towards zero if (function == "acos") evaluate (arg1, &acos_rz); else if (function == "asin") evaluate (arg1, &asin_rz); else if (function == "atan") evaluate (arg1, &atan_rz); else if (function == "cos") evaluate (arg1, &cos_rz); else if (function == "cosh") evaluate (arg1, &cosh_rz); else if (function == "exp") evaluate (arg1, &exp_rz); else if (function == "expm1") evaluate (arg1, &expm1_rz); else if (function == "log") evaluate (arg1, &log_rz); else if (function == "log10") evaluate (arg1, &log10_rz); else if (function == "log1p") evaluate (arg1, &log1p_rz); else if (function == "log2") evaluate (arg1, &log2_rz); else if (function == "sin") evaluate (arg1, &sin_rz); else if (function == "sinh") evaluate (arg1, &sinh_rz); else if (function == "tan") evaluate (arg1, &tan_rz); else { print_usage(); return octave_value_list (); } } else { // Round to nearest if (function == "acos") evaluate (arg1, &acos_rn); else if (function == "asin") evaluate (arg1, &asin_rn); else if (function == "atan") evaluate (arg1, &atan_rn); else if (function == "cos") evaluate (arg1, &cos_rn); else if (function == "cosh") evaluate (arg1, &cosh_rn); else if (function == "exp") evaluate (arg1, &exp_rn); else if (function == "expm1") evaluate (arg1, &expm1_rn); else if (function == "log") evaluate (arg1, &log_rn); else if (function == "log10") evaluate (arg1, &log10_rn); else if (function == "log1p") evaluate (arg1, &log1p_rn); else if (function == "log2") evaluate (arg1, &log2_rn); else if (function == "sin") evaluate (arg1, &sin_rn); else if (function == "sinh") evaluate (arg1, &sinh_rn); else if (function == "tan") evaluate (arg1, &tan_rn); else { print_usage(); return octave_value_list (); } } return octave_value (arg1); } /* %!test %! for f = {"acos", "asin", "atan", "cos", "cosh", "exp", "expm1", "log", "log10", "log1p", "log2", "sin", "sinh", "tan"} %! for rnd = {+inf, -inf, 0, 0.5} %! assert (crlibm_function (f{:}, rnd{:}, 0.5), mpfr_function_d (f{:}, rnd{:}, 0.5)); %! endfor %! endfor */ interval-2.1.0/src/mpfr_commons.cc0000644000000000000000000001145313031036767015273 0ustar 00000000000000/* Copyright 2015-2016 Oliver Heimlich 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 . */ #include #include #define BINARY64_PRECISION 53 #define BINARY64_EMIN -1073 #define BINARY64_ACCU_PRECISION 2134 + 2150 mpfr_rnd_t parse_rounding_mode (const double octave_rounding_direction) { // Use rounding mode semantics from the GNU Octave fenv package mpfr_rnd_t mp_rnd; if (octave_rounding_direction == INFINITY) mp_rnd = MPFR_RNDU; else if (octave_rounding_direction == -INFINITY) mp_rnd = MPFR_RNDD; else if (octave_rounding_direction == 0.0) mp_rnd = MPFR_RNDZ; else // default mode mp_rnd = MPFR_RNDN; return mp_rnd; } void exact_interval_dot_product ( mpfr_t accu_l, mpfr_t accu_u, // Add result into the accu const MArray vector_xl, // Lower boundary of first parameter const MArray vector_xu, // Upper boundary of first parameter const MArray vector_yl, // Lower boundary of second parameter const MArray vector_yu) // Upper boundary of second parameter { if (! vector_xl.is_vector () || ! vector_xu.is_vector () || ! vector_yl.is_vector () || ! vector_yu.is_vector ()) { error ("dot product can only be computed over vectors"); return; } const octave_idx_type n = vector_xl.numel (); if (n != vector_xu.numel () || n != vector_yl.numel () || n != vector_yu.numel ()) { error ("vectors must be of equal size"); return; } if (mpfr_cmp (accu_l, accu_u) > 0) // Accu is already [Empty] return; mpfr_t mp_addend_l, mp_addend_u, mp_temp; mpfr_init2 (mp_addend_l, 2 * BINARY64_PRECISION + 1); mpfr_init2 (mp_addend_u, 2 * BINARY64_PRECISION + 1); mpfr_init2 (mp_temp, 2 * BINARY64_PRECISION + 1); for (octave_idx_type i = 0; i < n; i++) { const double xl = vector_xl.elem (i); const double xu = vector_xu.elem (i); const double yl = vector_yl.elem (i); const double yu = vector_yu.elem (i); if ((xl == INFINITY && xu == -INFINITY) || (yl == INFINITY && yu == -INFINITY)) { // [Empty] × Anything = [Empty] // [Empty] + Anything = [Empty] mpfr_set_inf (accu_l, +1); mpfr_set_inf (accu_u, -1); break; } if (mpfr_inf_p (accu_l) != 0 && mpfr_inf_p (accu_u) != 0) // [Entire] + Anything = [Entire] continue; if ((xl == 0.0 && xu == 0.0) || (yl == 0.0 && yu == 0.0)) // [0] × Anything = [0] continue; if ((xl == -INFINITY && xu == INFINITY) || (yl == -INFINITY && yu == INFINITY)) { // [Entire] × Anything = [Entire] mpfr_set_inf (accu_l, -1); mpfr_set_inf (accu_u, +1); continue; } // Both factors can be multiplied within 107 bits exactly! mpfr_set_d (mp_addend_l, xl, MPFR_RNDZ); mpfr_mul_d (mp_addend_l, mp_addend_l, yl, MPFR_RNDZ); mpfr_set (mp_addend_u, mp_addend_l, MPFR_RNDZ); // We have to compute the remaining 3 Products and determine min/max if (yl != yu) { mpfr_set_d (mp_temp, xl, MPFR_RNDZ); mpfr_mul_d (mp_temp, mp_temp, yu, MPFR_RNDZ); mpfr_min (mp_addend_l, mp_addend_l, mp_temp, MPFR_RNDZ); mpfr_max (mp_addend_u, mp_addend_u, mp_temp, MPFR_RNDZ); } if (xl != xu) { mpfr_set_d (mp_temp, xu, MPFR_RNDZ); mpfr_mul_d (mp_temp, mp_temp, yl, MPFR_RNDZ); mpfr_min (mp_addend_l, mp_addend_l, mp_temp, MPFR_RNDZ); mpfr_max (mp_addend_u, mp_addend_u, mp_temp, MPFR_RNDZ); } if (xl != xu || yl != yu) { mpfr_set_d (mp_temp, xu, MPFR_RNDZ); mpfr_mul_d (mp_temp, mp_temp, yu, MPFR_RNDZ); mpfr_min (mp_addend_l, mp_addend_l, mp_temp, MPFR_RNDZ); mpfr_max (mp_addend_u, mp_addend_u, mp_temp, MPFR_RNDZ); } // Compute sums if (mpfr_add (accu_l, accu_l, mp_addend_l, MPFR_RNDZ) != 0 || mpfr_add (accu_u, accu_u, mp_addend_u, MPFR_RNDZ) != 0) error ("failed to compute exact dot product"); } mpfr_clear (mp_addend_l); mpfr_clear (mp_addend_u); mpfr_clear (mp_temp); } interval-2.1.0/src/mpfr_function_d.cc0000644000000000000000000005034513031036767015753 0ustar 00000000000000/* Copyright 2015-2016 Oliver Heimlich 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 . */ #include #include #include "mpfr_commons.cc" typedef int (*mpfr_unary_fun) (mpfr_t rop, const mpfr_t op, mpfr_rnd_t rnd); typedef int (*mpfr_binary_fun) (mpfr_t rop, const mpfr_t op1, const mpfr_t op2, mpfr_rnd_t rnd); typedef int (*mpfr_ternary_fun) (mpfr_t rop, const mpfr_t op1, const mpfr_t op2, const mpfr_t op3, mpfr_rnd_t rnd); // Evaluate an unary MPFR function on a binary64 matrix void evaluate ( Matrix &arg1, // Operand 1 and result const mpfr_rnd_t rnd, // Rounding direction const mpfr_unary_fun f) // The MPFR function to evaluate (element-wise) { mpfr_t mp; mpfr_init2 (mp, BINARY64_PRECISION); mpfr_exp_t old_emin = mpfr_get_emin (); mpfr_set_emin (BINARY64_EMIN); const octave_idx_type n = arg1.numel (); for (octave_idx_type i = 0; i < n; i ++) { mpfr_set_d (mp, arg1.elem (i), MPFR_RNDZ); int rnd_error = (*f) (mp, mp, rnd); if (rnd == MPFR_RNDN) { // Prevent double-rounding errors mpfr_subnormalize (mp, rnd_error, rnd); } arg1.elem (i) = mpfr_get_d (mp, rnd); } mpfr_clear (mp); mpfr_set_emin (old_emin); } // Evaluate a binary MPFR function on two binary64 matrices void evaluate ( Matrix &arg1, // Operand 1 and result const Matrix &arg2, // Operand 2 const mpfr_rnd_t rnd, // Rounding direction const mpfr_binary_fun f) // The MPFR function to evaluate (element-wise) { mpfr_t mp1, mp2; mpfr_init2 (mp1, BINARY64_PRECISION); mpfr_init2 (mp2, BINARY64_PRECISION); mpfr_exp_t old_emin = mpfr_get_emin (); mpfr_set_emin (BINARY64_EMIN); // arg1 shall contain the result and must be resized if (arg1.rows () == 1 && arg2.rows () != 1) arg1 = arg1.index (idx_vector (ColumnVector (arg2.rows (), 1.0)), idx_vector::colon); if (arg1.columns () == 1 && arg2.columns () != 1) arg1 = arg1.index (idx_vector::colon, idx_vector (RowVector (arg2.columns (), 1.0))); const octave_idx_type n = arg1.rows (); const octave_idx_type m = arg1.columns (); const bool broadcast_r = n != 1 && arg2.rows () == 1; const bool broadcast_c = m != 1 && arg2.columns () == 1; for (octave_idx_type i = 0; i < n; i ++) for (octave_idx_type j = 0; j < m; j ++) { mpfr_set_d (mp1, arg1.elem (i, j), MPFR_RNDZ); mpfr_set_d (mp2, (broadcast_r) ? ((broadcast_c) ? arg2.elem (0, 0) : arg2.elem (0, j)) : ((broadcast_c) ? arg2.elem (i, 0) : arg2.elem (i, j)) , MPFR_RNDZ); int rnd_error = (*f) (mp1, mp1, mp2, rnd); if (rnd == MPFR_RNDN) { // Prevent double-rounding errors mpfr_subnormalize (mp1, rnd_error, rnd); } arg1.elem (i, j) = mpfr_get_d (mp1, rnd); } mpfr_clear (mp1); mpfr_clear (mp2); mpfr_set_emin (old_emin); } // Evaluate a ternary MPFR function on three binary64 matrices void evaluate ( Matrix &arg1, // Operand 1 and result const Matrix &arg2, // Operand 2 const Matrix &arg3, // Operand 3 const mpfr_rnd_t rnd, // Rounding direction const mpfr_ternary_fun f) // The MPFR function to evaluate (element-wise) { mpfr_t mp1, mp2, mp3; mpfr_init2 (mp1, BINARY64_PRECISION); mpfr_init2 (mp2, BINARY64_PRECISION); mpfr_init2 (mp3, BINARY64_PRECISION); mpfr_exp_t old_emin = mpfr_get_emin (); mpfr_set_emin (BINARY64_EMIN); bool scalar1 = arg1.numel () == 1; bool scalar2 = arg2.numel () == 1; bool scalar3 = arg3.numel () == 1; if (scalar1) { // arg1 shall contain the result and must possibly be resized if (!scalar2) { arg1 = Matrix (arg2.dims (), arg1.elem (0)); scalar1 = false; } else if (!scalar3) { arg1 = Matrix (arg3.dims (), arg1.elem (0)); scalar1 = false; } } const octave_idx_type n = std::max (std::max (arg1.numel (), arg2.numel ()), arg3.numel ()); for (octave_idx_type i = 0; i < n; i ++) { mpfr_set_d (mp1, arg1.elem (i), MPFR_RNDZ); mpfr_set_d (mp2, (scalar2) ? arg2.elem (0) // broadcast : arg2.elem (i), MPFR_RNDZ); mpfr_set_d (mp3, (scalar3) ? arg3.elem (0) // broadcast : arg3.elem (i), MPFR_RNDZ); int rnd_error = (*f) (mp1, mp1, mp2, mp3, rnd); if (rnd == MPFR_RNDN) { // Prevent double-rounding errors mpfr_subnormalize (mp1, rnd_error, rnd); } arg1.elem (i) = mpfr_get_d (mp1, rnd); } mpfr_clear (mp1); mpfr_clear (mp2); mpfr_clear (mp3); mpfr_set_emin (old_emin); } // Evaluate nthroot void nthroot ( Matrix &arg1, // Operand 1 and result const uint64_t arg2, // Operand 2 const mpfr_rnd_t rnd) { mpfr_t mp; mpfr_init2 (mp, BINARY64_PRECISION); const octave_idx_type n = arg1.numel (); for (octave_idx_type i = 0; i < n; i ++) { mpfr_set_d (mp, arg1.elem (i), MPFR_RNDZ); mpfr_root (mp, mp, arg2, rnd); arg1.elem (i) = mpfr_get_d (mp, rnd); } mpfr_clear (mp); } // Evaluate factorial void factorial ( Matrix &arg1, // Operand 1 and result const mpfr_rnd_t rnd) { mpfr_t mp; mpfr_init2 (mp, BINARY64_PRECISION); const octave_idx_type n = arg1.numel (); for (octave_idx_type i = 0; i < n; i ++) { if (std::isnan (arg1.elem (i))) continue; if (arg1.elem (i) < 2.0) { arg1.elem (i) = 1.0; continue; } if (arg1.elem (i) >= 171.0) { // Computation can become hard for large numbers, // thus we can short-circuit here. switch (rnd) { case MPFR_RNDZ: case MPFR_RNDD: arg1.elem (i) = std::numeric_limits ::max (); continue; case MPFR_RNDA: case MPFR_RNDU: case MPFR_RNDN: arg1.elem (i) = +INFINITY; continue; default: break; } } // The factorial function is defined as the product of all positive // integers less than or equal to n. const double current_arg = floor (arg1.elem (i)); mpfr_fac_ui (mp, static_cast (current_arg), rnd); arg1.elem (i) = mpfr_get_d (mp, rnd); } mpfr_clear (mp); } DEFUN_DLD (mpfr_function_d, args, nargout, "-*- texinfo -*-\n" "@documentencoding UTF-8\n" "@defun mpfr_function_d ('acos', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('acosh', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('asin', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('asinh', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('atan', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('atan2', @var{R}, @var{Y}, @var{X})\n" "@defunx mpfr_function_d ('atanh', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('cbrt', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('cos', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('cosh', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('cot', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('coth', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('csc', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('csch', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('dilog', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('ei', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('erf', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('erfc', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('exp', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('expm1', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('factorial', @var{R}, @var{N})\n" "@defunx mpfr_function_d ('fma', @var{R}, @var{X}, @var{Y}, @var{Z})\n" "@defunx mpfr_function_d ('gamma', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('gammaln', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('hypot', @var{R}, @var{X}, @var{Y})\n" "@defunx mpfr_function_d ('log', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('log2', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('log10', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('log1p', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('minus', @var{R}, @var{X}, @var{Y})\n" "@defunx mpfr_function_d ('nthroot', @var{R}, @var{X}, @var{N})\n" "@defunx mpfr_function_d ('plus', @var{R}, @var{X}, @var{Y})\n" "@defunx mpfr_function_d ('pow', @var{R}, @var{X}, @var{Y})\n" "@defunx mpfr_function_d ('pow2', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('pow10', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('psi', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('rdivide', @var{R}, @var{X}, @var{Y})\n" "@defunx mpfr_function_d ('realsqrt', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('rsqrt', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('sec', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('sech', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('sin', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('sinh', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('sqr', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('tan', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('tanh', @var{R}, @var{X})\n" "@defunx mpfr_function_d ('times', @var{R}, @var{X}, @var{Y})\n" "\n" "Evaluate a function in binary64 with correctly rounded result." "\n\n" "Parameter 1 is the function's name in GNU Octave, Parameter 2 is the " "rounding direction (@option{0}: towards zero, @option{0.5}: towards " "nearest and ties to even, @option{+inf}: towards positive infinity, " "@option{-inf}: towards negative infinity). " "Parameters 3 and (possibly) 4 and 5 are operands to the function." "\n\n" "Evaluated on matrices, the function will be applied element-wise. Scalar " "operands do broadcast for functions with more than one operand." "\n\n" "The result is guaranteed to be correctly rounded. That is, the function " "is evaluated with (virtually) infinite precision and the exact result is " "approximated with a binary64 number using the desired rounding direction." "\n\n" "@example\n" "@group\n" "mpfr_function_d ('plus', -inf, 1, eps / 2) == 1\n" " @result{} 1\n" "mpfr_function_d ('plus', +inf, 1, eps / 2) == 1 + eps\n" " @result{} 1\n" "@end group\n" "@end example\n" "@seealso{crlibm_function}\n" "@end defun" ) { // Check call syntax int nargin = args.length (); if (nargin < 3 || nargin > 5) { print_usage (); return octave_value_list (); } // Read parameters const std::string function = args (0).string_value (); const mpfr_rnd_t rnd = parse_rounding_mode (args (1).scalar_value ()); Matrix arg1 = args (2).matrix_value (); Matrix arg2; Matrix arg3; if (nargin >= 4) { arg2 = args (3).matrix_value (); if (arg1.rows () != 1 && arg2.rows () != 1 && arg1.rows () != arg2.rows ()) error ("mpfr_function_d: Matrix dimensions must agree!"); if (arg1.columns () != 1 && arg2.columns () != 1 && arg1.columns () != arg2.columns ()) error ("mpfr_function_d: Matrix dimensions must agree!"); } if (nargin >= 5) { arg3 = args (4).matrix_value (); if (arg3.numel () != 1 && ( (arg1.numel () != 1 && arg1.numel () != arg3.numel ()) || (arg2.numel () != 1 && arg2.numel () != arg3.numel ()))) error ("mpfr_function_d: Matrix dimensions must agree!"); } if (error_state) return octave_value_list (); // Choose the function to evaluate switch (nargin - 2) { case 1: // unary function if (function == "acos") evaluate (arg1, rnd, &mpfr_acos); else if (function == "acosh") evaluate (arg1, rnd, &mpfr_acosh); else if (function == "asin") evaluate (arg1, rnd, &mpfr_asin); else if (function == "asinh") evaluate (arg1, rnd, &mpfr_asinh); else if (function == "atan") evaluate (arg1, rnd, &mpfr_atan); else if (function == "atanh") evaluate (arg1, rnd, &mpfr_atanh); else if (function == "cbrt") evaluate (arg1, rnd, &mpfr_cbrt); else if (function == "cos") evaluate (arg1, rnd, &mpfr_cos); else if (function == "cosh") evaluate (arg1, rnd, &mpfr_cosh); else if (function == "cot") evaluate (arg1, rnd, &mpfr_cot); else if (function == "coth") evaluate (arg1, rnd, &mpfr_coth); else if (function == "csc") evaluate (arg1, rnd, &mpfr_csc); else if (function == "csch") evaluate (arg1, rnd, &mpfr_csch); else if (function == "dilog") evaluate (arg1, rnd, &mpfr_li2); else if (function == "ei") evaluate (arg1, rnd, &mpfr_eint); else if (function == "erf") evaluate (arg1, rnd, &mpfr_erf); else if (function == "erfc") evaluate (arg1, rnd, &mpfr_erfc); else if (function == "exp") evaluate (arg1, rnd, &mpfr_exp); else if (function == "expm1") evaluate (arg1, rnd, &mpfr_expm1); else if (function == "factorial") factorial (arg1, rnd); else if (function == "gamma") evaluate (arg1, rnd, &mpfr_gamma); else if (function == "gammaln") evaluate (arg1, rnd, &mpfr_lngamma); else if (function == "log") evaluate (arg1, rnd, &mpfr_log); else if (function == "log2") evaluate (arg1, rnd, &mpfr_log2); else if (function == "log10") evaluate (arg1, rnd, &mpfr_log10); else if (function == "log1p") evaluate (arg1, rnd, &mpfr_log1p); else if (function == "pow2") evaluate (arg1, rnd, &mpfr_exp2); else if (function == "pow10") evaluate (arg1, rnd, &mpfr_exp10); else if (function == "psi") evaluate (arg1, rnd, &mpfr_digamma); else if (function == "realsqrt") evaluate (arg1, rnd, &mpfr_sqrt); else if (function == "rsqrt") evaluate (arg1, rnd, &mpfr_rec_sqrt); else if (function == "sec") evaluate (arg1, rnd, &mpfr_sec); else if (function == "sech") evaluate (arg1, rnd, &mpfr_sech); else if (function == "sin") evaluate (arg1, rnd, &mpfr_sin); else if (function == "sinh") evaluate (arg1, rnd, &mpfr_sinh); else if (function == "sqr") evaluate (arg1, rnd, &mpfr_sqr); else if (function == "tan") evaluate (arg1, rnd, &mpfr_tan); else if (function == "tanh") evaluate (arg1, rnd, &mpfr_tanh); else { print_usage(); return octave_value_list (); } break; case 2: // binary function if (function == "atan2") evaluate (arg1, arg2, rnd, &mpfr_atan2); else if (function == "hypot") evaluate (arg1, arg2, rnd, &mpfr_hypot); else if (function == "minus") evaluate (arg1, arg2, rnd, &mpfr_sub); else if (function == "nthroot") { const uint64_t n = args (3).uint64_array_value ().elem (0); if (error_state) return octave_value_list (); nthroot (arg1, n, rnd); } else if (function == "plus") evaluate (arg1, arg2, rnd, &mpfr_add); else if (function == "pow") evaluate (arg1, arg2, rnd, &mpfr_pow); else if (function == "rdivide") evaluate (arg1, arg2, rnd, &mpfr_div); else if (function == "times") evaluate (arg1, arg2, rnd, &mpfr_mul); else { print_usage(); return octave_value_list (); } break; case 3: // ternary function if (function == "fma") evaluate (arg1, arg2, arg3, rnd, &mpfr_fma); else { print_usage(); return octave_value_list (); } break; } return octave_value (arg1); } /* %!assert (mpfr_function_d ('plus', 0, 2, 2), 4); %!assert (mpfr_function_d ('plus', -inf, 1, eps / 2), 1); %!assert (mpfr_function_d ('plus', +inf, 1, eps / 2), 1 + eps); %!error mpfr_function_d ('Krauskefarben', 0, 47, 11); %!# Cross-check unit tests from crlibm against the MPFR library. %!# We simulate binary64 floating-point arithmetic in MPFR %!# with mpfr_function_d and results shall be identical. %!# %!shared testdata %! testdata = load (fullfile (... %! fileparts (file_in_loadpath ("__check_crlibm__.m")), ... %! "test", ... %! "crlibm.mat")); %!function verify (fname, rnd, data) %! assert (mpfr_function_d (fname, rnd, data.input), data.output); %!endfunction %!test verify ("acos", -inf, testdata.acos_rd); %!test verify ("acos", +inf, testdata.acos_ru); %!test verify ("acos", 0.5, testdata.acos_rn); %!test verify ("acos", 0, testdata.acos_rz); %!test verify ("asin", -inf, testdata.asin_rd); %!test verify ("asin", +inf, testdata.asin_ru); %!test verify ("asin", 0.5, testdata.asin_rn); %!test verify ("asin", 0, testdata.asin_rz); %!test verify ("atan", -inf, testdata.atan_rd); %!test verify ("atan", +inf, testdata.atan_ru); %!test verify ("atan", 0.5, testdata.atan_rn); %!test verify ("atan", 0, testdata.atan_rz); %!test verify ("cos", -inf, testdata.cos_rd); %!test verify ("cos", +inf, testdata.cos_ru); %!test verify ("cos", 0.5, testdata.cos_rn); %!test verify ("cos", 0, testdata.cos_rz); %!test verify ("cosh", -inf, testdata.cosh_rd); %!test verify ("cosh", +inf, testdata.cosh_ru); %!test verify ("cosh", 0.5, testdata.cosh_rn); %!test verify ("cosh", 0, testdata.cosh_rz); %!test verify ("exp", -inf, testdata.exp_rd); %!test verify ("exp", +inf, testdata.exp_ru); %!test verify ("exp", 0.5, testdata.exp_rn); %!test verify ("exp", 0, testdata.exp_rz); %!test verify ("expm1", -inf, testdata.expm1_rd); %!test verify ("expm1", +inf, testdata.expm1_ru); %!test verify ("expm1", 0.5, testdata.expm1_rn); %!test verify ("expm1", 0, testdata.expm1_rz); %!test verify ("log", -inf, testdata.log_rd); %!test verify ("log", +inf, testdata.log_ru); %!test verify ("log", 0.5, testdata.log_rn); %!test verify ("log", 0, testdata.log_rz); %!test verify ("log10", -inf, testdata.log10_rd); %!test verify ("log10", +inf, testdata.log10_ru); %!test verify ("log10", 0.5, testdata.log10_rn); %!test verify ("log10", 0, testdata.log10_rz); %!test verify ("log1p", -inf, testdata.log1p_rd); %!test verify ("log1p", +inf, testdata.log1p_ru); %!test verify ("log1p", 0.5, testdata.log1p_rn); %!test verify ("log1p", 0, testdata.log1p_rz); %!test verify ("log2", -inf, testdata.log2_rd); %!test verify ("log2", +inf, testdata.log2_ru); %!test verify ("log2", 0.5, testdata.log2_rn); %!test verify ("log2", 0, testdata.log2_rz); %!test verify ("sin", -inf, testdata.sin_rd); %!test verify ("sin", +inf, testdata.sin_ru); %!test verify ("sin", 0.5, testdata.sin_rn); %!test verify ("sin", 0, testdata.sin_rz); %!test verify ("sinh", -inf, testdata.sinh_rd); %!test verify ("sinh", +inf, testdata.sinh_ru); %!test verify ("sinh", 0.5, testdata.sinh_rn); %!test verify ("sinh", 0, testdata.sinh_rz); %!test verify ("tan", -inf, testdata.tan_rd); %!test verify ("tan", +inf, testdata.tan_ru); %!test verify ("tan", 0.5, testdata.tan_rn); %!test verify ("tan", 0, testdata.tan_rz); */ interval-2.1.0/src/mpfr_linspace_d.cc0000644000000000000000000001024613031036767015720 0ustar 00000000000000/* Copyright 2015-2016 Oliver Heimlich 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 . */ #include #include #include "mpfr_commons.cc" DEFUN_DLD (mpfr_linspace_d, args, nargout, "-*- texinfo -*-\n" "@documentencoding UTF-8\n" "@defun mpfr_linspace_d (@var{R}, @var{BASE}, @var{LIMIT}, @var{N})\n" "\n" "Return a row vector with @var{N} linearly spaced elements between " "@var{BASE} and @var{LIMIT}." "\n\n" "The result is rounded in the direction @var{R} (@option{+inf}: towards " "positive infinity, @option{-inf}: towards negative infinity)." "\n\n" "The result is not guaranteed to be correctly rounded, but should be within " "1 ULP of the correctly rounded result." "\n\n" "@example\n" "@group\n" "mpfr_linspace_d (-inf, 0, 10, 3)\n" " @result{} ans = \n" " 0 5 10\n" "@end group\n" "@end example\n" "@seealso{linspace}\n" "@end defun" ) { // Check call syntax int nargin = args.length (); if (nargin < 3 || nargin > 4) { print_usage (); return octave_value_list (); } const mpfr_rnd_t rnd = parse_rounding_mode (args(0).scalar_value ()); Matrix base = args(1).column_vector_value (); Matrix limit = args(2).column_vector_value (); int n; if (nargin < 4) n = 100; else n = args(3).int_value (); if (base.numel () != limit.numel () && base.numel () != 1 && limit.numel () != 1) error ("mpfr_linspace_d: vectors must be of equal length"); if (rnd != MPFR_RNDD && rnd != MPFR_RNDU) error ("mpfr_linspace_d: only directed rounding supported"); if (error_state) return octave_value_list (); // Result size n = std::max (n, 1); const int m = std::max (base.numel (), limit.numel ()); // helper variables const bool broadcast_base = base.numel () == 1; const bool broadcast_limit = limit.numel () == 1; const unsigned int n_1 = n - 1; // Initialize result and temporary variables Matrix result_d (m, n); mpfr_t tmp1, tmp2; mpfr_init2 (tmp1, 2 * BINARY64_PRECISION); mpfr_init2 (tmp2, 2 * BINARY64_PRECISION); mpfr_t mp_base, mp_limit; mpfr_init2 (mp_base, BINARY64_PRECISION); mpfr_init2 (mp_limit, BINARY64_PRECISION); for (octave_idx_type i = 0; i < m; i ++) if (n == 1) result_d.elem (i, 0) = broadcast_limit ? limit.elem (0) : limit.elem (i); else { mpfr_set_d (mp_base, broadcast_base ? base.elem (0) : base.elem (i), MPFR_RNDZ); mpfr_set_d (mp_limit, broadcast_limit ? limit.elem (0) : limit.elem (i), MPFR_RNDZ); for (unsigned int j = 0; j <= n_1; j ++) { if (j == 0 || mpfr_equal_p (mp_base, mp_limit)) result_d.elem (i, j) = mpfr_get_d (mp_base, MPFR_RNDZ); else if (j == n_1) result_d.elem (i, j) = mpfr_get_d (mp_limit, MPFR_RNDZ); else { mpfr_mul_ui (tmp1, mp_limit, j, MPFR_RNDZ); // exact mpfr_mul_ui (tmp2, mp_base, n_1 - j, MPFR_RNDZ); // exact mpfr_add (tmp1, tmp1, tmp2, rnd); // rounded mpfr_div_ui (tmp1, tmp1, n_1, rnd); // rounded result_d.elem (i, j) = mpfr_get_d (tmp1, rnd); } } } octave_value_list result; result(0) = result_d; // cleanup mpfr_clear (tmp1); mpfr_clear (tmp2); mpfr_clear (mp_base); mpfr_clear (mp_limit); return result; } /* %!assert (mpfr_linspace_d (-inf, 1, 10, 10), 1 : 10); %!assert (mpfr_linspace_d (inf, 1, 10, 8) - mpfr_linspace_d (-inf, 1, 10, 8), [0 2 2 4 4 4 8 0] .* eps); */ interval-2.1.0/src/mpfr_matrix_mul_d.cc0000644000000000000000000001302413031036767016300 0ustar 00000000000000/* Copyright 2015-2016 Oliver Heimlich 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 . */ #include #include #include "mpfr_commons.cc" std::pair interval_matrix_mul ( const Matrix matrix_xl, const Matrix matrix_yl, const Matrix matrix_xu, const Matrix matrix_yu) { const octave_idx_type n = matrix_xl.rows (), m = matrix_yl.columns (), l = matrix_xl.columns (); if (l != matrix_yl.rows () || n != matrix_xu.rows () || m != matrix_yl.columns () || l != matrix_xu.columns () || l != matrix_yu.rows ()) error ("mpfr_matrix_mul_d: " "Matrix dimensions must agree"); Matrix result_l (dim_vector (n, m)); Matrix result_u (dim_vector (n, m)); // Instead of two nested loops (for row = 1 : n / for col = 1 : m), we use // a single loop, which can be parallelized more easily. #if defined (_OPENMP) #pragma omp parallel for #endif for (octave_idx_type i = 0; i < n * m; i++) { mpfr_t accu_l, accu_u; mpfr_init2 (accu_l, BINARY64_ACCU_PRECISION); mpfr_init2 (accu_u, BINARY64_ACCU_PRECISION); mpfr_set_zero (accu_l, 0); mpfr_set_zero (accu_u, 0); const octave_idx_type row = i % n; const octave_idx_type col = i / n; RowVector xl; RowVector xu; ColumnVector yl; ColumnVector yu; #if defined (_OPENMP) #pragma omp critical #endif { // Access to shared memory is critical xl = matrix_xl.row (row); xu = matrix_xu.row (row); yl = matrix_yl.column (col); yu = matrix_yu.column (col); } exact_interval_dot_product (accu_l, accu_u, xl, xu, yl, yu); const double accu_l_d = mpfr_get_d (accu_l, MPFR_RNDD); const double accu_u_d = mpfr_get_d (accu_u, MPFR_RNDU); #if defined (_OPENMP) #pragma omp critical #endif { // Access to shared memory is critical result_l.elem (row, col) = accu_l_d; result_u.elem (row, col) = accu_u_d; } mpfr_clear (accu_l); mpfr_clear (accu_u); } std::pair result (result_l, result_u); return result; } DEFUN_DLD (mpfr_matrix_mul_d, args, nargout, "-*- texinfo -*-\n" "@documentencoding UTF-8\n" "@deftypefun {[@var{L}, @var{U}] =} mpfr_matrix_mul_d (@var{XL}, @var{YL}, @var{XU}, @var{YU})\n" "\n" "Compute the matrix product with binary64 numbers and correctly rounded " "result." "\n\n" "Compute the lower and upper boundary of the matrix multiplication of " "interval matrices [@var{XL}, @var{XU}] and [@var{YL}, @var{YU}]." "\n\n" "The result is guaranteed to be tight. That is, the matrix product is " "evaluated with (virtually) infinite precision and the exact result is " "approximated with binary64 numbers using directed rounding." "\n\n" "@example\n" "@group\n" "m = magic (3);\n" "[l, u] = mpfr_matrix_mul_d (m, m', m + 1, m' + 1)\n" " @result{} l = \n" " 101 71 53\n" " 71 83 71\n" " 53 71 101\n" " u = \n" " 134 104 86\n" " 104 116 104\n" " 86 104 134\n" "@end group\n" "@end example\n" "@seealso{mtimes}\n" "@end deftypefun" ) { // Check call syntax int nargin = args.length (); if (nargin != 4) { print_usage (); return octave_value_list (); } Matrix matrix_xl = args (0).matrix_value (); Matrix matrix_yl = args (1).matrix_value (); Matrix matrix_xu = args (2).matrix_value (); Matrix matrix_yu = args (3).matrix_value (); if (error_state) return octave_value_list (); std::pair result_d = interval_matrix_mul (matrix_xl, matrix_yl, matrix_xu, matrix_yu); octave_value_list result; result (0) = result_d.first; result (1) = result_d.second; return result; } /* %!test; %! [l, u] = mpfr_matrix_mul_d (magic (3), magic (3)', magic (3) + 1, magic (3)' + 1); %! assert (l, [101, 71, 53; 71, 83, 71; 53, 71, 101]); %! assert (u, [134, 104, 86; 104, 116, 104; 86, 104, 134]); %!test; %! if (((exist ("__octave_config_info__") && ... %! __octave_config_info__.ENABLE_OPENMP) || ... %! (not (exist ("__octave_config_info__")) && ... %! octave_config_info ("features").OPENMP)) ... %! && nproc ("overridable") > 1) %! ## OpenMP is enabled and may use more than one thread. %! ## We should observe speed-ups by that. %! A = vec (magic (2000)); %! tic; %! mpfr_matrix_mul_d (A', A, A', A); %! time_per_element = toc; %! A = [A A]; %! tic; %! mpfr_matrix_mul_d (A', A, A', A); %! time_per_element_parallel = toc / numel (ans); %! %! ## Ideally, the runtime would be cut in half (at least), %! ## however, there is an overhead, so let's be pessimistic and %! ## assume that the parallel execution is at least 20% faster. %! assert (time_per_element > 1.2 * time_per_element_parallel) %! endif */ interval-2.1.0/src/mpfr_matrix_sqr_d.cc0000644000000000000000000003270613031036767016320 0ustar 00000000000000/* Copyright 2016 Oliver Heimlich 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 . */ #include #include #include "mpfr_commons.cc" std::pair interval_matrix_sqr ( const Matrix matrix_xl, const Matrix matrix_xu) { const octave_idx_type n = matrix_xl.rows (); if (n != matrix_xl.columns ()) { error ("mpfr_matrix_sqr_d: Matrix must be square"); return std::pair (Matrix (), Matrix ()); } Matrix result_l (dim_vector (n, n)); Matrix result_u (dim_vector (n, n)); #if defined (_OPENMP) #pragma omp parallel for #endif for (octave_idx_type i = 0; i < n; i++) { mpfr_t accu_l, accu_u; mpfr_t mp_temp1, mp_temp2; mpfr_init2 (accu_l, BINARY64_ACCU_PRECISION); mpfr_init2 (accu_u, BINARY64_ACCU_PRECISION); mpfr_init2 (mp_temp1, BINARY64_ACCU_PRECISION); mpfr_init2 (mp_temp2, BINARY64_ACCU_PRECISION); RowVector xl; RowVector xu; #if defined (_OPENMP) #pragma omp critical #endif { // Access to shared memory is critical xl = matrix_xl.row (i); xu = matrix_xu.row (i); } for (octave_idx_type j = 0; j < n; j++) { mpfr_set_zero (accu_l, 0); mpfr_set_zero (accu_u, 0); ColumnVector yl; ColumnVector yu; #if defined (_OPENMP) #pragma omp critical #endif { // Access to shared memory is critical yl = matrix_xl.column (j); yu = matrix_xu.column (j); } // Each entry of the result is defined as // result(i,j) = sum[k != i,j] x(i,k)*x(k,j) // + x(i,j)*(x(i,i), x(j,j)) for i != j // or // result(i,i) = sum[k != i] x(i,k)*x(k,i) // + x(i,i)^2 // // We compute result(i,:) by matrix multiplication of x(i,:) with y, // where y is a matrix made from x such that no entry of x // participates in each entry of the final result more than once. // For i != j // Combine x(i,j)*x(i,i) and x(j,j)*x(i,j) into // x(i,j)*(x(i,i)+x(j,j)), // where x(i,j) would appear twice and introduce dependency errors if (i != j) { // Compute x(i,j)*(x(i,i)+x(j,j)) in the accumulator exactly if ((xl.elem (i) == INFINITY && xu.elem (i) == -INFINITY) || (xl.elem (j) == INFINITY && xu.elem (j) == -INFINITY) || (yl.elem (j) == INFINITY && yu.elem (j) == -INFINITY)) { // [Empty] interval detected mpfr_set_inf (accu_l, +1); mpfr_set_inf (accu_u, -1); } else { // Part 1 // x(i,i) + x(j,j) mpfr_set_d (accu_l, xl.elem (i), MPFR_RNDD); mpfr_set_d (accu_u, xu.elem (i), MPFR_RNDU); mpfr_add_d (accu_l, accu_l, yl.elem (j), MPFR_RNDD); mpfr_add_d (accu_u, accu_u, yu.elem (j), MPFR_RNDU); // Part 2 // Multiply x(i,j) into the accumulator if ((xl.elem (j) == 0.0 && xu.elem (j) == 0.0) || (mpfr_zero_p (accu_l) && mpfr_zero_p (accu_u))) { // Multiplication with zero detected mpfr_set_zero (accu_l, 0); mpfr_set_zero (accu_u, 0); } else { if ((xl.elem (j) == -INFINITY && xu.elem (j) == INFINITY) || (mpfr_inf_p (accu_l) && mpfr_inf_p (accu_u))) { // Multiplication with [Entire] detected mpfr_set_inf (accu_l, -1); mpfr_set_inf (accu_u, +1); } else { if (mpfr_sgn (accu_l) >= 0) { if (xl.elem (j) >= 0.0) { // non-negative × non-negative mpfr_mul_d (accu_l, accu_l, xl.elem (j), MPFR_RNDD); mpfr_mul_d (accu_u, accu_u, xu.elem (j), MPFR_RNDU); } else if (xu.elem (j) <= 0.0) { // non-negative × non-positive mpfr_swap (accu_l, accu_u); mpfr_mul_d (accu_l, accu_l, xl.elem (j), MPFR_RNDD); mpfr_mul_d (accu_u, accu_u, xu.elem (j), MPFR_RNDU); } else { // non-negative × inner-zero mpfr_set (accu_l, accu_u, MPFR_RNDZ); mpfr_mul_d (accu_l, accu_l, xl.elem (j), MPFR_RNDD); mpfr_mul_d (accu_u, accu_u, xu.elem (j), MPFR_RNDU); } } else if (mpfr_sgn (accu_u) <= 0) { if (xl.elem (j) >= 0.0) { // non-positive × non-negative mpfr_mul_d (accu_l, accu_l, xu.elem (j), MPFR_RNDD); mpfr_mul_d (accu_u, accu_u, xl.elem (j), MPFR_RNDU); } else if (xu.elem (j) <= 0.0) { // non-positive × non-positive mpfr_swap (accu_l, accu_u); mpfr_mul_d (accu_l, accu_l, xu.elem (j), MPFR_RNDD); mpfr_mul_d (accu_u, accu_u, xl.elem (j), MPFR_RNDU); } else { // non-positive × inner-zero mpfr_set (accu_u, accu_l, MPFR_RNDZ); mpfr_mul_d (accu_l, accu_l, xu.elem (j), MPFR_RNDD); mpfr_mul_d (accu_u, accu_u, xl.elem (j), MPFR_RNDU); } } else { if (xl.elem (j) >= 0.0) { // inner-zero × non-negative mpfr_mul_d (accu_l, accu_l, xu.elem (j), MPFR_RNDD); mpfr_mul_d (accu_u, accu_u, xu.elem (j), MPFR_RNDU); } else if (xu.elem (j) <= 0.0) { // inner-zero × non-positive mpfr_mul_d (accu_l, accu_l, xl.elem (j), MPFR_RNDD); mpfr_mul_d (accu_u, accu_u, xl.elem (j), MPFR_RNDU); } else { // inner-zero × inner-zero // Lower bound mpfr_mul_d (mp_temp1, accu_l, xu.elem (j), MPFR_RNDD); mpfr_mul_d (mp_temp2, accu_u, xl.elem (j), MPFR_RNDD); mpfr_min (mp_temp1, mp_temp1, mp_temp2, MPFR_RNDD); mpfr_swap (accu_l, mp_temp1); // Upper bound mpfr_mul_d (mp_temp1, mp_temp1, xl.elem (j), MPFR_RNDU); mpfr_mul_d (mp_temp2, accu_u, xu.elem (j), MPFR_RNDU); mpfr_max (accu_u, mp_temp1, mp_temp2, MPFR_RNDU); } } } } } } // For i == j // Make sure that x(i,i)^2 can be computed error free as // x(i,i)*x(i,i) if (i == j) { if (xl.elem (i) < 0.0 && xu.elem (i) > 0.0) { yl.elem (i) = 0.0; yu.elem (i) = std::max (std::abs (xl.elem (i)), std::abs (xu.elem (i))); } exact_interval_dot_product (accu_l, accu_u, yl.extract_n (i, 1), yu.extract_n (i, 1), yl.extract_n (i, 1), yu.extract_n (i, 1)); } // Elements i and j have already been computed in the accumulator // Add remaining products for k != i, j to the accumulator yl.elem (i) = 0.0; yu.elem (i) = 0.0; yl.elem (j) = 0.0; yu.elem (j) = 0.0; exact_interval_dot_product (accu_l, accu_u, xl, xu, yl, yu); const double accu_l_d = mpfr_get_d (accu_l, MPFR_RNDD); const double accu_u_d = mpfr_get_d (accu_u, MPFR_RNDU); #if defined (_OPENMP) #pragma omp critical #endif { // Access to shared memory is critical result_l.elem (i, j) = accu_l_d; result_u.elem (i, j) = accu_u_d; } } mpfr_clear (accu_l); mpfr_clear (accu_u); mpfr_clear (mp_temp1); mpfr_clear (mp_temp2); } std::pair result (result_l, result_u); return result; } DEFUN_DLD (mpfr_matrix_sqr_d, args, nargout, "-*- texinfo -*-\n" "@documentencoding UTF-8\n" "@deftypefun {[@var{L}, @var{U}] =} mpfr_matrix_sqr_d (@var{XL}, @var{XU})\n" "\n" "Compute the lower and upper boundary of the matrix square of " "interval matrix [@var{XL}, @var{XU}]." "\n\n" "The result is guaranteed to be tight. That is, the matrix square is " "evaluated with (virtually) infinite precision and the exact result is " "approximated with binary64 numbers using directed rounding." "\n\n" "Unlike @code{@var{X} * @var{X}} this function avoids the dependency " "problem during computation and produces a better enclosure. The algorithm " "has been implemented after “Feasible algorithm for computing the square of " "an interval matrix” in O. Kosheleva, V. Kreinovich, G. Mayer, and " "H. T. Nguyen (2005): Computing the cube of an interval matrix is NP-hard. " "In SAC '05: Proc. of the 2005 ACM Symposium on Applied Computing, " "pages 1449–1453, 2005." "\n\n" "@example\n" "@group\n" "m = magic (3);\n" "[l, u] = mpfr_matrix_sqr_d (m, m + 1)\n" " @result{} l = \n" " 91 67 67\n" " 67 91 67\n" " 67 67 91\n" " u = \n" " 124 100 100\n" " 100 124 100\n" " 100 100 124\n" "@end group\n" "@end example\n" "@seealso{mpower}\n" "@end deftypefun" ) { // Check call syntax int nargin = args.length (); if (nargin != 2) { print_usage (); return octave_value_list (); } Matrix matrix_xl = args (0).matrix_value (); Matrix matrix_xu = args (1).matrix_value (); if (error_state) return octave_value_list (); std::pair result_d = interval_matrix_sqr (matrix_xl, matrix_xu); octave_value_list result; result (0) = result_d.first; result (1) = result_d.second; return result; } interval-2.1.0/src/mpfr_to_string_d.cc0000644000000000000000000002543513031036767016140 0ustar 00000000000000/* Copyright 2015-2016 Oliver Heimlich 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 . */ #include #include #include #include #include #include #include "mpfr_commons.cc" std::string inttostring (const int number) { std::ostringstream buffer; buffer << number; return buffer.str (); } DEFUN_DLD (mpfr_to_string_d, args, nargout, "-*- texinfo -*-\n" "@documentencoding UTF-8\n" "@defun mpfr_to_string_d (@var{R}, @var{FORMAT}, @var{X})\n" "\n" "Convert binary64 numbers @var{X} to string representation, either exact or " "correctly rounded." "\n\n" "The result is a cell array of strings and, if not exact, is rounded in " "the direction @var{R} (@option{0}: towards zero, @option{0.5}: towards " "nearest and ties to even, @option{+inf}: towards positive infinity, " "@option{-inf}: towards negative infinity)." "\n\n" "The @var{FORMAT} may be one of the following:\n" "@table @option\n" "@item auto\n" "Varying mantissa length with 5 or 15 places, depending on the currently " "active @command{format}. It is also possible to define other values with " "the @command{output_precision} function.\n" "@item decimal\n" "Varying mantissa length with up to 16 or 17 places. This format will " "correctly separate subsequent numbers of binary64 precision with the least " "possible number of digits.\n" "@item exact decimal\n" "Varying mantissa length with up to 751 places.\n" "@item exact hexadecimal\n" "Fixed mantissa length with 1+13 hexadecimal places. The digit before the " "point is only zero if the number is denormalized. For normalized numbers " "the digit before the point should be 1, but this is not guaranteed and " "depends on the C compiler used.\n" "@end table" "\n\n" "@example\n" "@group\n" "mpfr_to_string_d (-inf, \"exact hexadecimal\", magic (3) / 10)\n" " @result{}\n" " @{\n" " [1,1] = 0x1.999999999999ap-1\n" " [2,1] = 0x1.3333333333333p-2\n" " [3,1] = 0x1.999999999999ap-2\n" " [1,2] = 0x1.999999999999ap-4\n" " [2,2] = 0x1.0000000000000p-1\n" " [3,2] = 0x1.ccccccccccccdp-1\n" " [1,3] = 0x1.3333333333333p-1\n" " [2,3] = 0x1.6666666666666p-1\n" " [3,3] = 0x1.999999999999ap-3\n" " @}\n" "@end group\n" "@end example\n" "@end defun" ) { // Check call syntax int nargin = args.length (); if (nargin != 3) { print_usage (); return octave_value_list (); } const mpfr_rnd_t rnd = parse_rounding_mode (args (0).scalar_value ()); std::string format = args (1).string_value (); std::string str_template; // Switch to hexadecimal, if “format hex” is active if (format == "auto") // Maybe there is an easier way to find out whether format hex is active?! if (feval ("disp", octave_value_list(octave_value (octave_uint8(255))), 1) (0).string_value () == "ff\n") format = "exact hexadecimal"; // Switch the conversion template depending on the format if (format == "auto") { const int precision = feval ("output_precision")(0).scalar_value (); str_template = "%." + inttostring (precision) + "R*g"; } else if (format == "decimal") // This might be increased to 17 below, if 16 is not enough for the // particular number. str_template = "%.16R*g"; else if (format == "exact hexadecimal") // We will not use MPFR below! str_template = "%R*a"; else if (format == "exact decimal") str_template = "%.751R*g"; else { error ("mpfr_to_string_d: Illegal format"); return octave_value_list (); } const Matrix x = args (2).matrix_value (); if (error_state) return octave_value_list (); char buf [768]; mpfr_t mp; mpfr_t zero; mpfr_init2 (mp, BINARY64_PRECISION); mpfr_init2 (zero, BINARY64_PRECISION); mpfr_set_zero (zero, 0); Cell str (dim_vector (x.rows (), x.cols ())); bool isexact = true; const mpfr_rnd_t complementary_rnd = (rnd == MPFR_RNDD) ? MPFR_RNDU : (rnd == MPFR_RNDU) ? MPFR_RNDD : (rnd == MPFR_RNDZ) ? MPFR_RNDA : (rnd == MPFR_RNDA) ? MPFR_RNDZ : MPFR_RNDN; const octave_idx_type n = x.numel (); for (octave_idx_type i = 0; i < n; i++) { mpfr_set_d (mp, x.elem (i), MPFR_RNDZ); if (format != "exact hexadecimal") { mpfr_sprintf (buf, str_template.c_str (), rnd, mp); } else { // Do not use MPFR for double to hex conversion. // // MPFR would use any of the 16 hex digits before the point, but // IEEE Std 1788-2015 requires the use of either 0 or 1 before the // point, where 1 is used for normal numbers and 0 is used for // subnormal numbers. MPFR doesn't handle subnormal numbers. // C99's floating-point conversion will use 0 before the point for // subnormal numbers and non-zero before the point for normal // numbers. // https://www.gnu.org/software/libc/manual/html_node/Floating_002dPoint-Conversions.html // // However, it is not guaranteed that only 1 is used for normal // numbers before the point (although this is the case for my gcc // version 4.9.2). // // Also sprintf (... "%.13a" ...) is completely broken on Windows, // where it either returns wrong values, or creates an infinite loop. long exponent; double mantissa = mpfr_get_d_2exp (&exponent, mp, rnd); if (mpfr_number_p (mp) == 0) { // NaN or infinity if (std::isnan (mantissa)) { // The NaN returned by MPFR might produce a sign, // so let's use the implementation's default NaN. mantissa = std::numeric_limits ::quiet_NaN (); } sprintf (buf, "%f", mantissa); } else { // Use normal representation of numbers 1.xxx * 2 ^ e // with hidden mantissa bit before the point if (mantissa != 0.0) { exponent --; mantissa *= 2.0; // 1.0 <= mantissa < 2.0 } // Make subnormal numbers use the exponent -1022 if (exponent < std::numeric_limits ::min_exponent) { mantissa /= uint64_t (1) << ( std::numeric_limits ::min_exponent - 1 - exponent); exponent = std::numeric_limits ::min_exponent - 1; } // Extract sign bool sign = std::signbit (mantissa); mantissa = std::abs (mantissa); // Extract hidden bit bool hiddenbit = (mantissa >= 1.0); if (hiddenbit) mantissa -= 1.0; // shift mantissa by 32 bits to format the first part // sprintf (... "%x" ...) requires an unsigned 4-byte int mantissa *= uint64_t (1) << (sizeof (uint32_t) * 8); uint32_t first_part = static_cast (mantissa); // remove first mantissa part mantissa -= first_part; // shift mantissa by remaining 20 bits such that // it is an integer mantissa *= uint64_t (1) << ( std::numeric_limits ::digits - 1 - 32); uint32_t second_part = static_cast (mantissa); // Format hexadecimal number from individual parts sprintf (buf, "%s0x%u.%08x%05xp%+d", sign ? "-" : "", static_cast (hiddenbit), first_part, second_part, static_cast (exponent)); } } str.elem (i) = buf; if (format == "decimal") { if (x.elem (i) != 0.0) { // Precision 16 might not be enough // Note: mpfr_sprintf does not set the inexact flag, so we must // check for precision loss ourself. mpfr_nexttoward (mp, zero); mpfr_sprintf (buf, str_template.c_str (), rnd, mp); mpfr_set_d (mp, x.elem (i), MPFR_RNDZ); if (str.elem (i).string_value () == buf) { // Increase precision to 17 mpfr_sprintf (buf, "%.17R*g", rnd, mp); str.elem (i) = buf; } } } // Check, whether output was exact if (isexact && nargout >=2 && format != "exact decimal" && format != "exact hexadecimal") { mpfr_sprintf (buf, str_template.c_str (), complementary_rnd, mp); if (str.elem (i).string_value () != buf) isexact = false; } } mpfr_clear (mp); mpfr_clear (zero); octave_value_list result; result (0) = str; result (1) = isexact; return result; } /* %!test; %! [s, isexact] = mpfr_to_string_d (-inf, "decimal", .1); %! assert (s, {"0.1"}); %! assert (isexact, false); %!assert (mpfr_to_string_d (0, "exact hexadecimal", inf), {"inf"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", -inf), {"-inf"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", nan), {"nan"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", 0), {"0x0.0000000000000p+0"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", 2), {"0x1.0000000000000p+1"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", -1), {"-0x1.0000000000000p+0"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", pow2 (-1022)), {"0x1.0000000000000p-1022"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", pow2 (-1074)), {"0x0.0000000000001p-1022"}); */ interval-2.1.0/src/mpfr_vector_dot_d.cc0000644000000000000000000001647513031036767016304 0ustar 00000000000000/* Copyright 2015-2016 Oliver Heimlich 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 . */ #include #include #include "mpfr_commons.cc" std::pair interval_vector_dot ( Matrix vector_xl, Matrix vector_yl, Matrix vector_xu, Matrix vector_yu) { if (vector_xl.numel () == 1 && vector_yl.numel () != 1) { // Broadcast vector x vector_xl = Matrix (vector_yl.dims (), vector_xl.elem (0)); vector_xu = Matrix (vector_yl.dims (), vector_xu.elem (0)); } else if (vector_yl.numel () == 1 && vector_xl.numel () != 1) { // Broadcast vector y vector_yl = Matrix (vector_xl.dims (), vector_yl.elem (0)); vector_yu = Matrix (vector_xl.dims (), vector_yu.elem (0)); } mpfr_t accu_l, accu_u; mpfr_init2 (accu_l, BINARY64_ACCU_PRECISION); mpfr_init2 (accu_u, BINARY64_ACCU_PRECISION); mpfr_set_zero (accu_l, 0); mpfr_set_zero (accu_u, 0); exact_interval_dot_product (accu_l, accu_u, vector_xl, vector_xu, vector_yl, vector_yu); std::pair result (mpfr_get_d (accu_l, MPFR_RNDD), mpfr_get_d (accu_u, MPFR_RNDU)); mpfr_clear (accu_l); mpfr_clear (accu_u); return result; } std::pair vector_dot ( mpfr_rnd_t rnd, Matrix vector_x, Matrix vector_y, const bool compute_error) { if (vector_x.numel () == 1 && vector_y.numel () != 1) // Broadcast vector x vector_x = Matrix (vector_y.dims (), vector_x.elem (0)); else if (vector_y.numel () == 1 && vector_x.numel () != 1) // Broadcast vector y vector_y = Matrix (vector_x.dims (), vector_y.elem (0)); const octave_idx_type n = vector_x.numel (); // Compute sum of products in accumulator // This is faster than the less accurate mpfr_sum function, because we // do not have to instantiate an array of mpfr_t values. mpfr_t accu; mpfr_init2 (accu, BINARY64_ACCU_PRECISION); mpfr_set_zero (accu, 0); mpfr_t product; mpfr_init2 (product, 2 * BINARY64_PRECISION + 1); for (octave_idx_type i = 0; i < n; i++) { mpfr_set_d (product, vector_x.elem (i), MPFR_RNDZ); mpfr_mul_d (product, product, vector_y.elem (i), MPFR_RNDZ); int exact = mpfr_add (accu, accu, product, MPFR_RNDZ); if (exact != 0) error ("mpfr_vector_dot_d: Failed to compute exact dot product"); if (mpfr_nan_p (accu)) // Short-Circtuit if one addend is NAN or if -INF + INF break; } double result; double error; if (mpfr_nan_p (accu) != 0) { result = NAN; error = NAN; } else if (mpfr_cmp_d (accu, 0.0) == 0) { // exact zero if (rnd == MPFR_RNDD) result = -0.0; else result = +0.0; error = 0.0; } else { result = mpfr_get_d (accu, rnd); if (compute_error) { mpfr_sub_d (accu, accu, result, MPFR_RNDA); error = mpfr_get_d (accu, MPFR_RNDA); } else error = 0.0; } mpfr_clear (accu); mpfr_clear (product); return std::pair (result, error); } DEFUN_DLD (mpfr_vector_dot_d, args, nargout, "-*- texinfo -*-\n" "@documentencoding UTF-8\n" "@deftypefun {[@var{L}, @var{U}] =} mpfr_vector_dot_d (@var{XL}, @var{YL}, @var{XU}, @var{YU})\n" "@deftypefunx {[@var{D}, @var{E}] =} mpfr_vector_dot_d (@var{R}, @var{X}, @var{Y})\n" "\n" "Compute the dot product of binary64 numbers with correctly rounded result." "\n\n" "Syntax 1: Compute the lower and upper boundary of the dot product of " "interval vectors [@var{XL}, @var{XU}] and [@var{YL}, @var{YU}] with " "tightest accuracy." "\n\n" "Syntax 2: Compute the dot product @var{D} of two binary64 vectors with " "correctly rounded result and rounding direction @var{R} (@option{0}: " "towards zero, @option{0.5}: towards nearest and ties to even, " "@option{+inf}: towards positive infinity, @option{-inf}: towards negative " "infinity). Output parameter @var{E} yields an approximation of the error, " "that is the difference between the exact dot product and @var{D} as a " "second binary64 number, rounded towards zero." "\n\n" "The result is guaranteed to be tight / correctly rounded. That is, the " "dot product is evaluated with (virtually) infinite precision and the exact " "result is approximated with a binary64 number using the desired rounding " "direction." "\n\n" "For syntax 2 only: If one element of any vector is NaN, infinities of " "both signs or a product of zero and (positive or negative) infinity are " "encountered, the result will be NaN. An @emph{exact} zero is returned as " "+0 in all rounding directions, except for rounding towards negative " "infinity, where -0 is returned." "\n\n" "@example\n" "@group\n" "[l, u] = mpfr_vector_dot_d (-1, -1, 2, 3)\n" " @result{}\n" " l = -3\n" " u = 6\n" "@end group\n" "@end example\n" "@seealso{dot}\n" "@end deftypefun" ) { // Check call syntax int nargin = args.length (); if (nargin < 3 || nargin > 4) { print_usage (); return octave_value_list (); } octave_value_list result; switch (nargin) { case 4: // Interval version { Matrix vector_xl = args (0).row_vector_value (); Matrix vector_yl = args (1).row_vector_value (); Matrix vector_xu = args (2).row_vector_value (); Matrix vector_yu = args (3).row_vector_value (); if (error_state) return octave_value_list (); std::pair result_d = interval_vector_dot (vector_xl, vector_yl, vector_xu, vector_yu); result (0) = result_d.first; result (1) = result_d.second; break; } case 3: // Non-interval version { const mpfr_rnd_t rnd = parse_rounding_mode (args (0).scalar_value()); const Matrix vector_x = args (1).row_vector_value (); const Matrix vector_y = args (2).row_vector_value (); if (error_state) return octave_value_list (); std::pair result_and_error = vector_dot (rnd, vector_x, vector_y, nargout >= 2); result (0) = result_and_error.first; result (1) = result_and_error.second; break; } } return result; } /* %!test; %! [l, u] = mpfr_vector_dot_d (-1, -1, 2, 3); %! assert (l, -3); %! assert (u, 6); %!test; %! x = [realmax, realmax, -realmax, -realmax, 1, eps/2]; %! y = ones (size (x)); %! [l, u] = mpfr_vector_dot_d (x, y, x, y); %! assert (l, 1); %! assert (u, 1 + eps); %!test; %! [l, u] = mpfr_vector_dot_d (0, 0, inf, inf); %! assert (l, 0); %! assert (u, inf); */ interval-2.1.0/src/mpfr_vector_sum_d.cc0000644000000000000000000001005513031036767016306 0ustar 00000000000000/* Copyright 2015-2016 Oliver Heimlich 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 . */ #include #include #include "mpfr_commons.cc" DEFUN_DLD (mpfr_vector_sum_d, args, nargout, "-*- texinfo -*-\n" "@documentencoding UTF-8\n" "@deftypefun {[@var{S}, @var{E}] =} mpfr_vector_sum_d (@var{R}, @var{X})\n" "\n" "Compute the sum @var{S} of all numbers in a binary64 vector @var{X} with " "correctly rounded result." "\n\n" "@var{R} is the rounding direction (@option{0}: towards zero, @option{0.5}: " "towards nearest and ties to even, @option{+inf}: towards positive " "infinity, @option{-inf}: towards negative infinity)." "\n\n" "The result is guaranteed to be correctly rounded. That is, the sum is " "evaluated with (virtually) infinite precision and the exact result is " "approximated with a binary64 number using the desired rounding direction." "\n\n" "If one element of the vector is NaN or infinities of both signs are " "encountered, the result will be NaN. An @emph{exact} zero is returned as " "+0 in all rounding directions, except for rounding towards negative " "infinity, where -0 is returned." "\n\n" "A second output parameter yields an approximation of the error. The " "difference between the exact sum over @var{X} and @var{S} is approximated " "by a second binary64 number @var{E} with rounding towards zero." "\n\n" "@example\n" "@group\n" "mpfr_vector_sum_d (-inf, [1, eps/2, realmax, -realmax]) == 1\n" " @result{} 1\n" "mpfr_vector_sum_d (+inf, [1, eps/2, realmax, -realmax]) == 1 + eps\n" " @result{} 1\n" "@end group\n" "@end example\n" "@seealso{sum}\n" "@end deftypefun" ) { // Check call syntax int nargin = args.length (); if (nargin != 2) { print_usage (); return octave_value_list (); } // Read parameters const mpfr_rnd_t rnd = parse_rounding_mode (args (0).scalar_value ()); const Matrix vector = args (1).row_vector_value (); if (error_state) return octave_value_list (); const octave_idx_type n = vector.numel (); // Compute sum in accumulator // This is faster than the less accurate mpfr_sum function, because we // do not have to instantiate an array of mpfr_t values. mpfr_t accu; mpfr_init2 (accu, BINARY64_ACCU_PRECISION); mpfr_set_zero (accu, 0); for (octave_idx_type i = 0; i < n; i++) { int exact = mpfr_add_d (accu, accu, vector.elem (i), rnd); if (exact != 0) error ("mpfr_vector_sum_d: Failed to compute exact sum"); if (mpfr_nan_p (accu)) // Short-Circtuit if one addend is NAN or if -INF + INF break; } octave_value_list result; if (mpfr_nan_p (accu) != 0) { result (0) = NAN; result (1) = NAN; } else if (mpfr_cmp_d (accu, 0.0) == 0) { // exact zero if (rnd == MPFR_RNDD) result (0) = -0.0; else result (0) = +0.0; result (1) = 0.0; } else { const double sum = mpfr_get_d (accu, rnd); result (0) = sum; if (nargout >= 2) { mpfr_sub_d (accu, accu, sum, MPFR_RNDA); const double error = mpfr_get_d (accu, MPFR_RNDA); result (1) = error; } } mpfr_clear (accu); return result; } /* %!assert (mpfr_vector_sum_d (0, [eps, realmax, realmax, -realmax, -realmax]), eps) %!assert (mpfr_vector_sum_d (-inf, [eps/2, 1]), 1) %!assert (mpfr_vector_sum_d (+inf, [eps/2, 1]), 1 + eps) */ interval-2.1.0/test/abs_rev.itl0000644000000000000000000000364313031036767014612 0ustar 00000000000000/* Copyright 2015-2016 Oliver Heimlich 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 . */ testcase minimal.absRevBin_test { absRevBin [empty] [entire] = [empty]; absRevBin [0.0, 1.0] [empty] = [empty]; absRevBin [0.0, 1.0] [7.0, 9.0] = [empty]; absRevBin [empty] [0.0, 1.0] = [empty]; absRevBin [-2.0, -1.0] [entire] = [empty]; absRevBin [1.0, 1.0] [entire] = [-1.0, 1.0]; absRevBin [0.0, 0.0] [entire] = [0.0, 0.0]; absRevBin [-1.0, -1.0] [entire] = [empty]; absRevBin [0x1.FFFFFFFFFFFFFp1023, 0x1.FFFFFFFFFFFFFp1023] [entire] = [-0x1.FFFFFFFFFFFFFp1023, 0x1.FFFFFFFFFFFFFp1023]; absRevBin [0x1p-1022, 0x1p-1022] [entire] = [-0x1p-1022, 0x1p-1022]; absRevBin [-0x1p-1022, -0x1p-1022] [entire] = [empty]; absRevBin [-0x1.FFFFFFFFFFFFFp1023, -0x1.FFFFFFFFFFFFFp1023] [entire] = [empty]; absRevBin [1.0, 2.0] [entire] = [-2.0, 2.0]; absRevBin [1.0, 2.0] [0.0, 2.0] = [1.0, 2.0]; absRevBin [0.0, 1.0] [-0.5, 2.0] = [-0.5, 1.0]; absRevBin [-1.0, 1.0] [entire] = [-1.0, 1.0]; absRevBin [-1.0, 0.0] [entire] = [0.0, 0.0]; absRevBin [0.0, infinity] [entire] = [entire]; absRevBin [entire] [entire] = [entire]; absRevBin [-infinity, 0.0] [entire] = [0.0, 0.0]; absRevBin [1.0, infinity] [-infinity, 0.0] = [-infinity, -1.0]; absRevBin [-1.0, infinity] [entire] = [entire]; absRevBin [-infinity, -1.0] [entire] = [empty]; absRevBin [-infinity, 1.0] [entire] = [-1.0, 1.0]; } interval-2.1.0/test/atan2.itl0000644000000000000000000000670213031036767014175 0ustar 00000000000000/* Copyright 2015-2016 Oliver Heimlich 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 . */ testcase minimal.atan2_test { atan2 [empty] [empty] = [empty]; atan2 [empty] [entire] = [empty]; atan2 [entire] [empty] = [empty]; atan2 [0.0, 0.0] [0.0, 0.0] = [empty]; atan2 [entire] [entire] = [-0x1.921FB54442D19p1, +0x1.921FB54442D19p1]; atan2 [0.0, 0.0] [-infinity, 0.0] = [0x1.921FB54442D18p1, 0x1.921FB54442D19p1]; atan2 [0.0, 0.0] [0.0, infinity] = [0.0, 0.0]; atan2 [0.0, infinity] [0.0, 0.0] = [0x1.921FB54442D18p0, 0x1.921FB54442D19p0]; atan2 [-infinity, 0.0] [0.0, 0.0] = [-0x1.921FB54442D19p0, -0x1.921FB54442D18p0]; atan2 [-0x1p-1022, 0.0] [-0x1p-1022, -0x1p-1022] = [-0x1.921FB54442D19p1, +0x1.921FB54442D19p1]; atan2 [1.0, 1.0] [-1.0, -1.0] = [0x1.2D97C7F3321D2p1, 0x1.2D97C7F3321D3p1]; atan2 [1.0, 1.0] [1.0, 1.0] = [0x1.921FB54442D18p-1, 0x1.921FB54442D19p-1]; atan2 [-1.0, -1.0] [1.0, 1.0] = [-0x1.921FB54442D19p-1, -0x1.921FB54442D18p-1]; atan2 [-1.0, -1.0] [-1.0, -1.0] = [-0x1.2D97C7F3321D3p1, -0x1.2D97C7F3321D2p1]; atan2 [-0x1p-1022, 0x1p-1022] [-0x1p-1022, -0x1p-1022] = [-0x1.921FB54442D19p1, +0x1.921FB54442D19p1]; atan2 [-0x1p-1022, 0x1p-1022] [0x1p-1022, 0x1p-1022] = [-0x1.921FB54442D19p-1, +0x1.921FB54442D19p-1]; atan2 [-0x1p-1022, -0x1p-1022] [-0x1p-1022, 0x1p-1022] = [-0x1.2D97C7F3321D3p1, -0x1.921FB54442D18p-1]; atan2 [0x1p-1022, 0x1p-1022] [-0x1p-1022, 0x1p-1022] = [0x1.921FB54442D18p-1, 0x1.2D97C7F3321D3p1]; atan2 [-2.0, 2.0] [-3.0, -1.0] = [-0x1.921FB54442D19p1, +0x1.921FB54442D19p1]; atan2 [0.0, 2.0] [-3.0, -1.0] = [0x1.0468A8ACE4DF6p1, 0x1.921FB54442D19p1]; atan2 [1.0, 3.0] [-3.0, -1.0] = [0x1.E47DF3D0DD4Dp0, 0x1.68F095FDF593Dp1]; atan2 [1.0, 3.0] [-2.0, 0.0] = [0x1.921FB54442D18p0, 0x1.56C6E7397F5AFp1]; atan2 [1.0, 3.0] [-2.0, 2.0] = [0x1.DAC670561BB4Fp-2, 0x1.56C6E7397F5AFp1]; atan2 [1.0, 3.0] [0.0, 2.0] = [0x1.DAC670561BB4Fp-2, 0x1.921FB54442D19p0]; atan2 [1.0, 3.0] [1.0, 3.0] = [0x1.4978FA3269EE1p-2, 0x1.3FC176B7A856p0]; atan2 [0.0, 2.0] [1.0, 3.0] = [0x0p0, 0x1.1B6E192EBBE45p0]; atan2 [-2.0, 2.0] [1.0, 3.0] = [-0x1.1B6E192EBBE45p0, +0x1.1B6E192EBBE45p0]; atan2 [-2.0, 0.0] [1.0, 3.0] = [-0x1.1B6E192EBBE45p0, 0x0p0]; atan2 [-3.0, -1.0] [1.0, 3.0] = [-0x1.3FC176B7A856p0, -0x1.4978FA3269EE1p-2]; atan2 [-3.0, -1.0] [0.0, 2.0] = [-0x1.921FB54442D19p0, -0x1.DAC670561BB4Fp-2]; atan2 [-3.0, -1.0] [-2.0, 2.0] = [-0x1.56C6E7397F5AFp1, -0x1.DAC670561BB4Fp-2]; atan2 [-3.0, -1.0] [-2.0, 0.0] = [-0x1.56C6E7397F5AFp1, -0x1.921FB54442D18p0]; atan2 [-3.0, -1.0] [-3.0, -1.0] = [-0x1.68F095FDF593Dp1, -0x1.E47DF3D0DD4Dp0]; atan2 [-2.0, 0.0] [-3.0, -1.0] = [-0x1.921FB54442D19p1, +0x1.921FB54442D19p1]; atan2 [-5.0, 0.0] [-5.0, 0.0] = [-0x1.921FB54442D19p1, +0x1.921FB54442D19p1]; atan2 [0.0, 5.0] [-5.0, 0.0] = [0x1.921FB54442D18p0, 0x1.921FB54442D19p1]; atan2 [0.0, 5.0] [0.0, 5.0] = [0x0p0, 0x1.921FB54442D19p0]; atan2 [-5.0, 0.0] [0.0, 5.0] = [-0x1.921FB54442D19p0, 0x0p0]; } interval-2.1.0/test/c-xsc.itl0000644000000000000000000002174013031036767014204 0ustar 00000000000000/* Copyright 1990-2000 Institut fuer Angewandte Mathematik, Universitaet Karlsruhe, Germany 2000-2014 Wiss. Rechnen/Softwaretechnologie Universitaet Wuppertal, Germany Copyright 2015-2016 Oliver Heimlich Origin: unit tests in C-XSC version 2.5.4, Original license: LGPLv2+ Converted into portable ITL format by Oliver Heimlich. 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 . */ // Tests A+B, B+A, A-B, B-A, -A, +A testcase cxsc.intervaladdsub { add [10.0, 20.0] [13.0, 17.0] = [23.0, 37.0]; add [13.0, 17.0] [10.0, 20.0] = [23.0, 37.0]; sub [10.0, 20.0] [13.0, 16.0] = [-6.0, 7.0]; sub [13.0, 16.0] [10.0, 20.0] = [-7.0, 6.0]; neg [10.0, 20.0] = [-20.0, -10.0]; pos [10.0, 20.0] = [10.0, 20.0]; } // Tests A*B, B*A, A/B, B/A testcase cxsc.intervalmuldiv { mul [1.0, 2.0] [3.0, 4.0] = [3.0, 8.0]; mul [-1.0, 2.0] [3.0, 4.0] = [-4.0, 8.0]; mul [-2.0, 1.0] [3.0, 4.0] = [-8.0, 4.0]; mul [-2.0, -1.0] [3.0, 4.0] = [-8.0, -3.0]; mul [1.0, 2.0] [-3.0, 4.0] = [-6.0, 8.0]; mul [-1.0, 2.0] [-3.0, 4.0] = [-6.0, 8.0]; mul [-2.0, 1.0] [-3.0, 4.0] = [-8.0, 6.0]; mul [-2.0, -1.0] [-3.0, 4.0] = [-8.0, 6.0]; mul [1.0, 2.0] [-4.0, 3.0] = [-8.0, 6.0]; mul [-1.0, 2.0] [-4.0, 3.0] = [-8.0, 6.0]; mul [-2.0, 1.0] [-4.0, 3.0] = [-6.0, 8.0]; mul [-2.0, -1.0] [-4.0, 3.0] = [-6.0, 8.0]; mul [1.0, 2.0] [-4.0, -3.0] = [-8.0, -3.0]; mul [-1.0, 2.0] [-4.0, -3.0] = [-8.0, 4.0]; mul [-2.0, -1.0] [-4.0, -3.0] = [3.0, 8.0]; div [1.0, 2.0] [4.0, 8.0] = [0.125, 0.5]; div [-1.0, 2.0] [4.0, 8.0] = [-0.25, 0.5]; div [-2.0, 1.0] [4.0, 8.0] = [-0.5, 0.25]; div [-2.0, -1.0] [4.0, 8.0] = [-0.5, -0.125]; div [1.0, 2.0] [-4.0, 8.0] = [entire]; div [-1.0, 2.0] [-4.0, 8.0] = [entire]; div [-2.0, 1.0] [-4.0, 8.0] = [entire]; div [-2.0, -1.0] [-4.0, 8.0] = [entire]; div [1.0, 2.0] [-8.0, 4.0] = [entire]; div [-1.0, 2.0] [-8.0, 4.0] = [entire]; div [-2.0, 1.0] [-8.0, 4.0] = [entire]; div [-2.0, -1.0] [-8.0, 4.0] = [entire]; div [1.0, 2.0] [-8.0, -4.0] = [-0.5, -0.125]; div [-1.0, 2.0] [-8.0, -4.0] = [-0.5, 0.25]; div [-2.0, 1.0] [-8.0, -4.0] = [-0.25, 0.5]; div [-2.0, -1.0] [-8.0, -4.0] = [0.125, 0.5]; } // Tests A|B, B|A, A&B, B&A testcase cxsc.intervalsetops { convexHull [-2.0, 2.0] [-4.0, -3.0] = [-4.0, 2.0]; convexHull [-2.0, 2.0] [-4.0, -1.0] = [-4.0, 2.0]; convexHull [-2.0, 2.0] [-4.0, 4.0] = [-4.0, 4.0]; convexHull [-2.0, 2.0] [-1.0, 1.0] = [-2.0, 2.0]; convexHull [-2.0, 2.0] [1.0, 4.0] = [-2.0, 4.0]; convexHull [-2.0, 2.0] [3.0, 4.0] = [-2.0, 4.0]; convexHull [-4.0, -3.0] [-2.0, 2.0] = [-4.0, 2.0]; convexHull [-4.0, -1.0] [-2.0, 2.0] = [-4.0, 2.0]; convexHull [-4.0, 4.0] [-2.0, 2.0] = [-4.0, 4.0]; convexHull [-1.0, 1.0] [-2.0, 2.0] = [-2.0, 2.0]; convexHull [1.0, 4.0] [-2.0, 2.0] = [-2.0, 4.0]; convexHull [3.0, 4.0] [-2.0, 2.0] = [-2.0, 4.0]; intersection [-2.0, 2.0] [-4.0, -3.0] = [empty]; intersection [-2.0, 2.0] [-4.0, -1.0] = [-2.0, -1.0]; intersection [-2.0, 2.0] [-4.0, 4.0] = [-2.0, 2.0]; intersection [-2.0, 2.0] [-1.0, 1.0] = [-1.0, 1.0]; intersection [-2.0, 2.0] [1.0, 4.0] = [1.0, 2.0]; intersection [-2.0, 2.0] [3.0, 4.0] = [empty]; intersection [-4.0, -3.0] [-2.0, 2.0] = [empty]; intersection [-4.0, -1.0] [-2.0, 2.0] = [-2.0, -1.0]; intersection [-4.0, 4.0] [-2.0, 2.0] = [-2.0, 2.0]; intersection [-1.0, 1.0] [-2.0, 2.0] = [-1.0, 1.0]; intersection [1.0, 4.0] [-2.0, 2.0] = [1.0, 2.0]; intersection [3.0, 4.0] [-2.0, 2.0] = [empty]; } // Tests A|B, B|A, A&B, B&A, B is scalar-type testcase cxsc.intervalmixsetops { convexHull [-2.0, 2.0] [-4.0, -4.0] = [-4.0, 2.0]; convexHull [-2.0, 2.0] [1.0, 1.0] = [-2.0, 2.0]; convexHull [-2.0, 2.0] [4.0, 4.0] = [-2.0, 4.0]; convexHull [-4.0, -4.0] [-2.0, 2.0] = [-4.0, 2.0]; convexHull [1.0, 1.0] [-2.0, 2.0] = [-2.0, 2.0]; convexHull [4.0, 4.0] [-2.0, 2.0] = [-2.0, 4.0]; intersection [-2.0, 2.0] [-4.0, -4.0] = [empty]; intersection [-2.0, 2.0] [1.0, 1.0] = [1.0, 1.0]; intersection [-2.0, 2.0] [4.0, 4.0] = [empty]; intersection [-4.0, -4.0] [-2.0, 2.0] = [empty]; intersection [1.0, 1.0] [-2.0, 2.0] = [1.0, 1.0]; intersection [4.0, 4.0] [-2.0, 2.0] = [empty]; } // Tests A|B, B|A, A and B are scalar-type testcase cxsc.scalarmixsetops { convexHull [-2.0, -2.0] [-4.0, -4.0] = [-4.0, -2.0]; convexHull [-2.0, -2.0] [-2.0, -2.0] = [-2.0, -2.0]; convexHull [-2.0, -2.0] [2.0, 2.0] = [-2.0, 2.0]; convexHull [-4.0, -4.0] [-2.0, -2.0] = [-4.0, -2.0]; convexHull [-2.0, -2.0] [-2.0, -2.0] = [-2.0, -2.0]; convexHull [2.0, 2.0] [-2.0, -2.0] = [-2.0, 2.0]; } // Tests AB, A<=B, A>=B, A==B testcase cxsc.intervalsetcompops { interior [-1.0, 2.0] [-1.0, 2.0] = false; interior [-2.0, 1.0] [-3.0, 2.0] = true; interior [-2.0, 2.0] [-1.0, 1.0] = false; interior [-2.0, 2.0] [-1.0, 2.0] = false; interior [-2.0, 2.0] [-2.0, 1.0] = false; interior [-2.0, 2.0] [-2.0, 3.0] = false; interior [-2.0, 2.0] [-3.0, 2.0] = false; interior [-1.0, 2.0] [-1.0, 2.0] = false; interior [-3.0, 2.0] [-2.0, 1.0] = false; interior [-1.0, 1.0] [-2.0, 2.0] = true; interior [-1.0, 2.0] [-2.0, 2.0] = false; interior [-2.0, 1.0] [-2.0, 2.0] = false; interior [-2.0, 3.0] [-2.0, 2.0] = false; interior [-3.0, 2.0] [-2.0, 2.0] = false; subset [-1.0, 2.0] [-1.0, 2.0] = true; subset [-2.0, 1.0] [-3.0, 2.0] = true; subset [-2.0, 2.0] [-1.0, 1.0] = false; subset [-2.0, 2.0] [-1.0, 2.0] = false; subset [-2.0, 2.0] [-2.0, 1.0] = false; subset [-2.0, 2.0] [-2.0, 3.0] = true; subset [-2.0, 2.0] [-3.0, 2.0] = true; subset [-3.0, 2.0] [-2.0, 1.0] = false; subset [-1.0, 1.0] [-2.0, 2.0] = true; subset [-1.0, 2.0] [-2.0, 2.0] = true; subset [-2.0, 1.0] [-2.0, 2.0] = true; subset [-2.0, 3.0] [-2.0, 2.0] = false; subset [-3.0, 2.0] [-2.0, 2.0] = false; equal [-1.0, 2.0] [-1.0, 2.0] = true; equal [-2.0, 1.0] [-3.0, 2.0] = false; equal [-2.0, 2.0] [-1.0, 1.0] = false; equal [-2.0, 2.0] [-1.0, 2.0] = false; equal [-2.0, 2.0] [-2.0, 1.0] = false; equal [-2.0, 2.0] [-2.0, 3.0] = false; equal [-2.0, 2.0] [-3.0, 2.0] = false; } // Tests AB, A<=B, A>=B, A==B, BA, B<=A, B>=A, B==A, where B is scalar testcase cxsc.intervalscalarsetcompops { interior [-1.0, 2.0] [-2.0, -2.0] = false; interior [-2.0, 2.0] [-2.0, -2.0] = false; interior [-2.0, 2.0] [0.0, 0.0] = false; interior [-2.0, 2.0] [2.0, 2.0] = false; interior [-2.0, 2.0] [3.0, 3.0] = false; interior [-1.0, -1.0] [1.0, 1.0] = false; interior [-1.0, -1.0] [-1.0, -1.0] = false; interior [-2.0, -2.0] [-1.0, 2.0] = false; interior [-2.0, -2.0] [-2.0, 2.0] = false; interior [0.0, 0.0] [-2.0, 2.0] = true; interior [2.0, 2.0] [-2.0, 2.0] = false; interior [3.0, 3.0] [-2.0, 2.0] = false; interior [1.0, 1.0] [-1.0, -1.0] = false; interior [-1.0, -1.0] [-1.0, -1.0] = false; subset [-1.0, 2.0] [-2.0, -2.0] = false; subset [-2.0, 2.0] [-2.0, -2.0] = false; subset [-2.0, 2.0] [0.0, 0.0] = false; subset [-2.0, 2.0] [2.0, 2.0] = false; subset [-2.0, 2.0] [3.0, 3.0] = false; subset [-1.0, -1.0] [1.0, 1.0] = false; subset [-1.0, -1.0] [-1.0, -1.0] = true; subset [-2.0, -2.0] [-1.0, 2.0] = false; subset [-2.0, -2.0] [-2.0, 2.0] = true; subset [0.0, 0.0] [-2.0, 2.0] = true; subset [2.0, 2.0] [-2.0, 2.0] = true; subset [3.0, 3.0] [-2.0, 2.0] = false; subset [1.0, 1.0] [-1.0, -1.0] = false; subset [-1.0, -1.0] [-1.0, -1.0] = true; equal [-1.0, 2.0] [-2.0, -2.0] = false; equal [-2.0, 2.0] [-2.0, -2.0] = false; equal [-2.0, 2.0] [0.0, 0.0] = false; equal [-2.0, 2.0] [2.0, 2.0] = false; equal [-2.0, 2.0] [3.0, 3.0] = false; equal [-1.0, -1.0] [1.0, 1.0] = false; equal [-1.0, -1.0] [-1.0, -1.0] = true; } testcase cxsc.intervalstdfunc { sqr [11.0, 11.0] = [121.0, 121.0]; sqr [0.0, 0.0] = [0.0, 0.0]; sqr [-9.0, -9.0] = [81.0, 81.0]; sqrt [121.0, 121.0] = [11.0, 11.0]; sqrt [0.0, 0.0] = [0.0, 0.0]; sqrt [81.0, 81.0] = [9.0, 9.0]; rootn [27.0, 27.0] 3 = [3.0, 3.0]; rootn [0.0, 0.0] 4 = [0.0, 0.0]; rootn [1024.0, 1024.0] 10 = [2.0, 2.0]; pow [2.0, 2.0] [2.0, 2.0] = [4.0, 4.0]; pow [4.0, 4.0] [5.0, 5.0] = [1024.0, 1024.0]; // Negativ geht noch nicht pow [2.0, 2.0] [3.0, 3.0] = [8.0, 8.0]; }interval-2.1.0/test/fi_lib.itl0000644000000000000000000030725713031036767014425 0ustar 00000000000000/* Copyright 1997-2000 Institut fuer Wissenschaftliches Rechnen und Mathematische Modellbildung (IWRMM) and Institut fuer Angewandte Mathematik Universitaet Karlsruhe, Germany 2000-2005 Wiss. Rechnen/Softwaretechnologie Universitaet Wuppertal, Germany Copyright 2015-2016 Oliver Heimlich Original authors: Werner Hofschuster and Walter Kraemer (unit tests in FI_LIB version 1.2, original license: LGPLv2+) Converted into portable ITL format by Oliver Heimlich. 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 . */ testcase FI_LIB.addii { add [0X0.0000000000000P+0, 0X0.0000000000000P+0] [0X0.0000000000000P+0, 0X0.0000000000000P+0] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; add [0X1.0000000000000P+0, 0X1.0000000000000P+0] [0X2.0000000000000P+0, 0X2.0000000000000P+0] = [0X3.0000000000000P+0, 0X3.0000000000000P+0]; add [-0X1.0000000000000P+0, -0X1.0000000000000P+0] [-0X2.0000000000000P+0, -0X2.0000000000000P+0] = [-0X3.0000000000000P+0, -0X3.0000000000000P+0]; add [0X1.0000000000000P+0, 0X1.0000000000000P+0] [-0X1.0000000000000P+0, -0X1.0000000000000P+0] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; add [-0X1.0000000000000P+0, -0X1.0000000000000P+0] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; add [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] = [0X3.F400000000000P-1064, 0X3.F400000000000P-1064]; add [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; add [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064] [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064] = [-0X3.F400000000000P-1064, -0X3.F400000000000P-1064]; add [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; add [0XF.FFFFFFFFFFFF8P+1020, 0XF.FFFFFFFFFFFF8P+1020] [-0X1.0000000000000P+0, -0X1.0000000000000P+0] = [0XF.FFFFFFFFFFFF0P+1020, 0XF.FFFFFFFFFFFF8P+1020]; add [-0XF.FFFFFFFFFFFF8P+1020, -0XF.FFFFFFFFFFFF8P+1020] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [-0XF.FFFFFFFFFFFF8P+1020, -0XF.FFFFFFFFFFFF0P+1020]; add [0X0.0000000000000P+0, 0X1.0000000000000P+0] [0X1.0000000000000P+0, 0X2.0000000000000P+0] = [0X1.0000000000000P+0, 0X3.0000000000000P+0]; add [0X1.0000000000000P+0, 0X2.0000000000000P+0] [0X0.0000000000000P+0, 0X1.0000000000000P+0] = [0X1.0000000000000P+0, 0X3.0000000000000P+0]; add [0X1.0000000000000P+0, 0X2.0000000000000P+0] [0X3.0000000000000P+0, 0X4.0000000000000P+0] = [0X4.0000000000000P+0, 0X6.0000000000000P+0]; add [0X3.0000000000000P+0, 0X4.0000000000000P+0] [0X1.0000000000000P+0, 0X2.0000000000000P+0] = [0X4.0000000000000P+0, 0X6.0000000000000P+0]; add [-0X1.0000000000000P+0, 0X0.0000000000000P+0] [-0X4.0000000000000P+0, -0X3.0000000000000P+0] = [-0X5.0000000000000P+0, -0X3.0000000000000P+0]; add [-0X4.0000000000000P+0, -0X3.0000000000000P+0] [-0X1.0000000000000P+0, 0X0.0000000000000P+0] = [-0X5.0000000000000P+0, -0X3.0000000000000P+0]; add [-0X5.0000000000000P+0, -0X4.0000000000000P+0] [0X4.0000000000000P+0, 0X5.0000000000000P+0] = [-0X1.0000000000000P+0, +0X1.0000000000000P+0]; add [0X4.0000000000000P+0, 0X5.0000000000000P+0] [-0X5.0000000000000P+0, -0X4.0000000000000P+0] = [-0X1.0000000000000P+0, +0X1.0000000000000P+0]; } testcase FI_LIB.subii { sub [0X0.0000000000000P+0, 0X0.0000000000000P+0] [0X0.0000000000000P+0, 0X0.0000000000000P+0] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; sub [0X1.0000000000000P+0, 0X1.0000000000000P+0] [0X2.0000000000000P+0, 0X2.0000000000000P+0] = [-0X1.0000000000000P+0, -0X1.0000000000000P+0]; sub [-0X1.0000000000000P+0, -0X1.0000000000000P+0] [-0X2.0000000000000P+0, -0X2.0000000000000P+0] = [0X1.0000000000000P+0, 0X1.0000000000000P+0]; sub [0X1.0000000000000P+0, 0X1.0000000000000P+0] [-0X1.0000000000000P+0, -0X1.0000000000000P+0] = [0X2.0000000000000P+0, 0X2.0000000000000P+0]; sub [-0X1.0000000000000P+0, -0X1.0000000000000P+0] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [-0X2.0000000000000P+0, -0X2.0000000000000P+0]; sub [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; sub [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [-0X1.0000000000000P+0, -0XF.FFFFFFFFFFFF8P-4]; sub [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064] [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; sub [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [-0X1.0000000000001P+0, -0X1.0000000000000P+0]; sub [0XF.FFFFFFFFFFFF8P+1020, 0XF.FFFFFFFFFFFF8P+1020] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [0XF.FFFFFFFFFFFF0P+1020, 0XF.FFFFFFFFFFFF8P+1020]; sub [-0XF.FFFFFFFFFFFF8P+1020, -0XF.FFFFFFFFFFFF8P+1020] [-0X1.0000000000000P+0, -0X1.0000000000000P+0] = [-0XF.FFFFFFFFFFFF8P+1020, -0XF.FFFFFFFFFFFF0P+1020]; sub [0X0.0000000000000P+0, 0X1.0000000000000P+0] [0X1.0000000000000P+0, 0X2.0000000000000P+0] = [-0X2.0000000000000P+0, 0X0.0000000000000P+0]; sub [0X1.0000000000000P+0, 0X2.0000000000000P+0] [0X0.0000000000000P+0, 0X1.0000000000000P+0] = [0X0.0000000000000P+0, 0X2.0000000000000P+0]; sub [0X1.0000000000000P+0, 0X2.0000000000000P+0] [0X3.0000000000000P+0, 0X4.0000000000000P+0] = [-0X3.0000000000000P+0, -0X1.0000000000000P+0]; sub [0X3.0000000000000P+0, 0X4.0000000000000P+0] [0X1.0000000000000P+0, 0X2.0000000000000P+0] = [0X1.0000000000000P+0, 0X3.0000000000000P+0]; sub [-0X1.0000000000000P+0, 0X0.0000000000000P+0] [-0X4.0000000000000P+0, -0X3.0000000000000P+0] = [0X2.0000000000000P+0, 0X4.0000000000000P+0]; sub [-0X4.0000000000000P+0, -0X3.0000000000000P+0] [-0X1.0000000000000P+0, 0X0.0000000000000P+0] = [-0X4.0000000000000P+0, -0X2.0000000000000P+0]; sub [-0X5.0000000000000P+0, -0X4.0000000000000P+0] [0X4.0000000000000P+0, 0X5.0000000000000P+0] = [-0XA.0000000000000P+0, -0X8.0000000000000P+0]; sub [0X4.0000000000000P+0, 0X5.0000000000000P+0] [-0X5.0000000000000P+0, -0X4.0000000000000P+0] = [0X8.0000000000000P+0, 0XA.0000000000000P+0]; } testcase FI_LIB.mulii { mul [0X0.0000000000000P+0, 0X0.0000000000000P+0] [0X0.0000000000000P+0, 0X0.0000000000000P+0] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; mul [-0X1.0000000000000P+0, -0X1.0000000000000P+0] [-0X1.0000000000000P+0, -0X1.0000000000000P+0] = [0X1.0000000000000P+0, 0X1.0000000000000P+0]; mul [-0X1.0000000000000P+0, -0X1.0000000000000P+0] [0X0.0000000000000P+0, 0X0.0000000000000P+0] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; mul [-0X1.0000000000000P+0, -0X1.0000000000000P+0] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [-0X1.0000000000000P+0, -0X1.0000000000000P+0]; mul [0X0.0000000000000P+0, 0X0.0000000000000P+0] [-0X1.0000000000000P+0, -0X1.0000000000000P+0] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; mul [0X0.0000000000000P+0, 0X0.0000000000000P+0] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; mul [0X1.0000000000000P+0, 0X1.0000000000000P+0] [-0X1.0000000000000P+0, -0X1.0000000000000P+0] = [-0X1.0000000000000P+0, -0X1.0000000000000P+0]; mul [0X1.0000000000000P+0, 0X1.0000000000000P+0] [0X0.0000000000000P+0, 0X0.0000000000000P+0] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; mul [0X1.0000000000000P+0, 0X1.0000000000000P+0] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [0X1.0000000000000P+0, 0X1.0000000000000P+0]; mul [0XF.FFFFFFFFFFFF8P+1020, 0XF.FFFFFFFFFFFF8P+1020] [0X8.0000000000000P-4, 0X8.0000000000000P-4] = [0X7.FFFFFFFFFFFFCP+1020, 0X7.FFFFFFFFFFFFCP+1020]; mul [-0XF.FFFFFFFFFFFF8P+1020, -0XF.FFFFFFFFFFFF8P+1020] [0X8.0000000000000P-4, 0X8.0000000000000P-4] = [-0X7.FFFFFFFFFFFFCP+1020, -0X7.FFFFFFFFFFFFCP+1020]; mul [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] = [0X0.0000000000000P+0, 0X4.0000000000000P-1076]; mul [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064]; mul [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] [-0X1.0000000000000P+0, -0X1.0000000000000P+0] = [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064]; mul [-0X3.0000000000000P+0, -0X2.0000000000000P+0] [-0X3.0000000000000P+0, -0X2.0000000000000P+0] = [0X4.0000000000000P+0, 0X9.0000000000000P+0]; mul [-0X3.0000000000000P+0, -0X2.0000000000000P+0] [-0X1.0000000000000P+0, +0X1.0000000000000P+0] = [-0X3.0000000000000P+0, +0X3.0000000000000P+0]; mul [-0X3.0000000000000P+0, -0X2.0000000000000P+0] [0X2.0000000000000P+0, 0X3.0000000000000P+0] = [-0X9.0000000000000P+0, -0X4.0000000000000P+0]; mul [-0X1.0000000000000P+0, +0X1.0000000000000P+0] [-0X3.0000000000000P+0, -0X2.0000000000000P+0] = [-0X3.0000000000000P+0, +0X3.0000000000000P+0]; mul [-0X1.0000000000000P+0, +0X1.0000000000000P+0] [-0X1.0000000000000P+0, +0X1.0000000000000P+0] = [-0X1.0000000000000P+0, +0X1.0000000000000P+0]; mul [-0X1.0000000000000P+0, +0X1.0000000000000P+0] [0X2.0000000000000P+0, 0X3.0000000000000P+0] = [-0X3.0000000000000P+0, +0X3.0000000000000P+0]; mul [0X2.0000000000000P+0, 0X3.0000000000000P+0] [-0X3.0000000000000P+0, -0X2.0000000000000P+0] = [-0X9.0000000000000P+0, -0X4.0000000000000P+0]; mul [0X2.0000000000000P+0, 0X3.0000000000000P+0] [-0X1.0000000000000P+0, +0X1.0000000000000P+0] = [-0X3.0000000000000P+0, +0X3.0000000000000P+0]; mul [0X2.0000000000000P+0, 0X3.0000000000000P+0] [0X2.0000000000000P+0, 0X3.0000000000000P+0] = [0X4.0000000000000P+0, 0X9.0000000000000P+0]; mul [-0X5.0000000000000P+0, +0X2.0000000000000P+0] [-0X4.0000000000000P+0, +0X3.0000000000000P+0] = [-0XF.0000000000000P+0, +0X1.4000000000000P+4]; mul [-0X5.0000000000000P+0, +0X2.0000000000000P+0] [-0X3.0000000000000P+0, +0X8.0000000000000P+0] = [-0X2.8000000000000P+4, +0X1.0000000000000P+4]; mul [-0X2.0000000000000P+0, +0X5.0000000000000P+0] [-0X4.0000000000000P+0, +0X3.0000000000000P+0] = [-0X1.4000000000000P+4, +0XF.0000000000000P+0]; mul [-0X4.0000000000000P+0, +0X5.0000000000000P+0] [-0X4.0000000000000P+0, +0X3.0000000000000P+0] = [-0X1.4000000000000P+4, +0X1.0000000000000P+4]; mul [-0X3.0000000000000P+0, 0X0.0000000000000P+0] [-0X3.0000000000000P+0, -0X2.0000000000000P+0] = [0X0.0000000000000P+0, 0X9.0000000000000P+0]; mul [-0X3.0000000000000P+0, 0X0.0000000000000P+0] [-0X1.0000000000000P+0, +0X1.0000000000000P+0] = [-0X3.0000000000000P+0, +0X3.0000000000000P+0]; mul [-0X3.0000000000000P+0, 0X0.0000000000000P+0] [0X2.0000000000000P+0, 0X3.0000000000000P+0] = [-0X9.0000000000000P+0, 0X0.0000000000000P+0]; mul [-0X3.0000000000000P+0, -0X2.0000000000000P+0] [-0X3.0000000000000P+0, 0X0.0000000000000P+0] = [0X0.0000000000000P+0, 0X9.0000000000000P+0]; mul [-0X3.0000000000000P+0, -0X2.0000000000000P+0] [0X0.0000000000000P+0, 0X3.0000000000000P+0] = [-0X9.0000000000000P+0, 0X0.0000000000000P+0]; mul [-0X1.0000000000000P+0, +0X1.0000000000000P+0] [-0X3.0000000000000P+0, 0X0.0000000000000P+0] = [-0X3.0000000000000P+0, +0X3.0000000000000P+0]; mul [-0X1.0000000000000P+0, +0X1.0000000000000P+0] [0X0.0000000000000P+0, 0X3.0000000000000P+0] = [-0X3.0000000000000P+0, +0X3.0000000000000P+0]; mul [0X0.0000000000000P+0, 0X3.0000000000000P+0] [-0X3.0000000000000P+0, -0X2.0000000000000P+0] = [-0X9.0000000000000P+0, 0X0.0000000000000P+0]; mul [0X0.0000000000000P+0, 0X3.0000000000000P+0] [-0X1.0000000000000P+0, +0X1.0000000000000P+0] = [-0X3.0000000000000P+0, +0X3.0000000000000P+0]; mul [0X0.0000000000000P+0, 0X3.0000000000000P+0] [0X2.0000000000000P+0, 0X3.0000000000000P+0] = [0X0.0000000000000P+0, 0X9.0000000000000P+0]; mul [0X2.0000000000000P+0, 0X3.0000000000000P+0] [-0X3.0000000000000P+0, 0X0.0000000000000P+0] = [-0X9.0000000000000P+0, 0X0.0000000000000P+0]; mul [0X2.0000000000000P+0, 0X3.0000000000000P+0] [-0X3.0000000000000P+0, 0X0.0000000000000P+0] = [-0X9.0000000000000P+0, 0X0.0000000000000P+0]; mul [0X0.0000000000000P+0, 0X2.0000000000000P+0] [-0X3.0000000000000P+0, 0X0.0000000000000P+0] = [-0X6.0000000000000P+0, 0X0.0000000000000P+0]; mul [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064] [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064] = [0X0.0000000000000P+0, 0X4.0000000000000P-1076]; mul [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064]; mul [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064] [-0X1.0000000000000P+0, -0X1.0000000000000P+0] = [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064]; mul [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064] [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] = [-0X4.0000000000000P-1076, 0X0.0000000000000P+0]; mul [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064] [0X0.0000000000000P+0, 0X0.0000000000000P+0] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; mul [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] [0X0.0000000000000P+0, 0X0.0000000000000P+0] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; } testcase FI_LIB.divii { div [-0X1.0000000000000P+0, -0X1.0000000000000P+0] [-0X1.0000000000000P+0, -0X1.0000000000000P+0] = [0X1.0000000000000P+0, 0X1.0000000000000P+0]; div [-0X1.0000000000000P+0, -0X1.0000000000000P+0] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [-0X1.0000000000000P+0, -0X1.0000000000000P+0]; div [0X0.0000000000000P+0, 0X0.0000000000000P+0] [-0X1.0000000000000P+0, -0X1.0000000000000P+0] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; div [0X0.0000000000000P+0, 0X0.0000000000000P+0] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; div [0X1.0000000000000P+0, 0X1.0000000000000P+0] [-0X1.0000000000000P+0, -0X1.0000000000000P+0] = [-0X1.0000000000000P+0, -0X1.0000000000000P+0]; div [0X1.0000000000000P+0, 0X1.0000000000000P+0] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [0X1.0000000000000P+0, 0X1.0000000000000P+0]; div [0XF.FFFFFFFFFFFF8P+1020, 0XF.FFFFFFFFFFFF8P+1020] [0X2.0000000000000P+0, 0X2.0000000000000P+0] = [0X7.FFFFFFFFFFFFCP+1020, 0X7.FFFFFFFFFFFFCP+1020]; div [-0XF.FFFFFFFFFFFF8P+1020, -0XF.FFFFFFFFFFFF8P+1020] [0X2.0000000000000P+0, 0X2.0000000000000P+0] = [-0X7.FFFFFFFFFFFFCP+1020, -0X7.FFFFFFFFFFFFCP+1020]; div [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] = [0X1.0000000000000P+0, 0X1.0000000000000P+0]; div [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] [0X1.0000000000000P+0, 0X1.0000000000000P+0] = [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064]; div [0X1.FA00000000000P-1064, 0X1.FA00000000000P-1064] [-0X1.0000000000000P+0, -0X1.0000000000000P+0] = [-0X1.FA00000000000P-1064, -0X1.FA00000000000P-1064]; div [-0X3.0000000000000P+0, -0X2.0000000000000P+0] [-0X3.0000000000000P+0, -0X2.0000000000000P+0] = [0XA.AAAAAAAAAAAA8P-4, 0X1.8000000000000P+0]; div [-0X3.0000000000000P+0, -0X2.0000000000000P+0] [0X2.0000000000000P+0, 0X3.0000000000000P+0] = [-0X1.8000000000000P+0, -0XA.AAAAAAAAAAAA8P-4]; div [-0X1.0000000000000P+0, +0X1.0000000000000P+0] [-0X3.0000000000000P+0, -0X2.0000000000000P+0] = [-0X8.0000000000000P-4, +0X8.0000000000000P-4]; div [-0X1.0000000000000P+0, +0X1.0000000000000P+0] [0X2.0000000000000P+0, 0X3.0000000000000P+0] = [-0X8.0000000000000P-4, +0X8.0000000000000P-4]; div [0X2.0000000000000P+0, 0X3.0000000000000P+0] [-0X3.0000000000000P+0, -0X2.0000000000000P+0] = [-0X1.8000000000000P+0, -0XA.AAAAAAAAAAAA8P-4]; div [0X2.0000000000000P+0, 0X3.0000000000000P+0] [0X2.0000000000000P+0, 0X3.0000000000000P+0] = [0XA.AAAAAAAAAAAA8P-4, 0X1.8000000000000P+0]; div [-0X3.0000000000000P+0, 0X0.0000000000000P+0] [-0X3.0000000000000P+0, -0X2.0000000000000P+0] = [0X0.0000000000000P+0, 0X1.8000000000000P+0]; div [-0X3.0000000000000P+0, 0X0.0000000000000P+0] [0X2.0000000000000P+0, 0X3.0000000000000P+0] = [-0X1.8000000000000P+0, 0X0.0000000000000P+0]; div [0X0.0000000000000P+0, 0X3.0000000000000P+0] [-0X3.0000000000000P+0, -0X2.0000000000000P+0] = [-0X1.8000000000000P+0, 0X0.0000000000000P+0]; div [0X0.0000000000000P+0, 0X3.0000000000000P+0] [0X2.0000000000000P+0, 0X3.0000000000000P+0] = [0X0.0000000000000P+0, 0X1.8000000000000P+0]; } testcase FI_LIB.unary_functions { exp [-0X1.16CC0DF1540F5P+112, -0X1.B3E4076622F04P-232] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp [-0X2.42042B9A88438P-220, -0X2.A213429DB0508P-508] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; exp [-0X2.0E2E40B15D814P+272, -0X1.5D74CFDA6B292P-200] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp [-0X2.0EA791886F712P-416, -0X3.FE66A8D1A3472P-456] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; //exp [-0X6.FF424CB26239CP+292, -0X2.89F6682121BA8P+252] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp [-0X8.80EEFDF700148P+332, -0X1.C4E85E50A626DP+0] = [0X0.0000000000000P+0, 0X2.BA43457B11D98P-4]; exp [-0X6.CA83546563A5CP+236, -0X4.F0F28370909FCP-440] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp [-0X4.E60572D4FCFD0P+172, -0X1.EB095183538C8P-344] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp [-0X2.7ED8954764B12P-288, -0X8.71DC22117BE90P-756] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; exp [-0XD.CF39B8DD68B98P-76, -0X8.0205C5B1357B0P-564] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; //exp [-0X1.582D3AFB2C63DP+312, -0X5.08DC843E57ED4P+180] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp [-0X4.AF296DD37FD74P+256, -0X5.CBE2BD423B02CP-48] = [0X0.0000000000000P+0, 0XF.FFFFFFFFFFA38P-4]; exp [-0X1.1FBA2D1252D2BP+656, -0X2.4B7A4095C91B4P+8] = [0X0.0000000000000P+0, 0X1.5D7A2F6655DFCP-848]; //exp [-0X3.2FD3FDE325402P+688, -0X2.738623C238270P+48] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp [-0X1.44F2134E1901EP+8, -0X2.581DAD9AFE6DCP-172] = [0X9.34C0766401B20P-472, 0X1.0000000000000P+0]; exp [-0X2.9529E333F2ABAP+988, -0X7.19390F862F49CP-544] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp [-0X1.58391FD92C387P-148, -0X4.0C12426A57194P-440] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; exp [-0XB.FADC4FB83E140P+348, -0XF.13E388B2165F0P-512] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; //exp [-0XD.F2552B8F60978P+236, -0X7.FBDBC320979A4P+188] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp [-0X8.86826CE1AB700P-240, -0X4.FEA8D3A3ED018P-316] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; exp [0X1.0000000000000P+0, 0X2.0000000000000P+0] = [0X2.B7E151628AED2P+0, 0X7.63992E35376B8P+0]; exp [-0X1.0000000000000P+0, +0X2.0000000000000P+0] = [0X5.E2D58D8B3BCDCP-4, 0X7.63992E35376B8P+0]; exp [-0X5.0000000000000P+0, -0X3.0000000000000P+0] = [0X1.B993FE00D5376P-8, 0XC.BED8666758578P-8]; exp [-0X2.0000000000000P+0, +0X9.9999999999998P-4] = [0X2.2A555477F0396P-4, 0X1.D27660B11A9F0P+0]; exp [0X4.0000000000000P-1076, 0X4.4444400000000P-1056] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; exp [0X4.4440000000000P-1064, 0X1.0000000000000P+0] = [0X1.0000000000000P+0, 0X2.B7E151628AED4P+0]; exp [-0X4.4444000000000P-1060, +0X4.4444000000000P-1060] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000001P+0]; exp [-0X4.4400000000000P-1068, +0X1.FFF0000000000P+0] = [0XF.FFFFFFFFFFFF8P-4, 0X7.6322F8540CFB4P+0]; exp [-0X1.FFFF000000000P+0, -0X8.8888880000000P-1052] = [0X2.2A577ECE59DC6P-4, 0X1.0000000000000P+0]; exp [-0X1.FFFFFFF000000P+0, +0X8.CD11555400000P-1044] = [0X2.2A55549A958EAP-4, 0X1.0000000000001P+0]; exp2 [-0X1.16CC0DF1540F5P+112, -0X1.B3E4076622F04P-232] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp2 [-0X2.42042B9A88438P-220, -0X2.A213429DB0508P-508] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; exp2 [-0X2.0E2E40B15D814P+272, -0X1.5D74CFDA6B292P-200] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp2 [-0X2.0EA791886F712P-416, -0X3.FE66A8D1A3472P-456] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; //exp2 [-0X6.FF424CB26239CP+292, -0X2.89F6682121BA8P+252] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp2 [-0X8.80EEFDF700148P+332, -0X1.C4E85E50A626DP+0] = [0X0.0000000000000P+0, 0X4.B1AC6F8470484P-4]; exp2 [-0X6.CA83546563A5CP+236, -0X4.F0F28370909FCP-440] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp2 [-0X4.E60572D4FCFD0P+172, -0X1.EB095183538C8P-344] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp2 [-0X2.7ED8954764B12P-288, -0X8.71DC22117BE90P-756] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; exp2 [-0XD.CF39B8DD68B98P-76, -0X8.0205C5B1357B0P-564] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; //exp2 [-0X1.582D3AFB2C63DP+312, -0X5.08DC843E57ED4P+180] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp2 [-0X4.AF296DD37FD74P+256, -0X5.CBE2BD423B02CP-48] = [0X0.0000000000000P+0, 0XF.FFFFFFFFFFC00P-4]; exp2 [-0X1.1FBA2D1252D2BP+656, -0X2.4B7A4095C91B4P+8] = [0X0.0000000000000P+0, 0X1.6FB78C613E5ECP-588]; //exp2 [-0X3.2FD3FDE325402P+688, -0X2.738623C238270P+48] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp2 [-0X1.44F2134E1901EP+8, -0X2.581DAD9AFE6DCP-172] = [0X8.4EB038B9B8508P-328, 0X1.0000000000000P+0]; exp2 [-0X2.9529E333F2ABAP+988, -0X7.19390F862F49CP-544] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp2 [-0X1.58391FD92C387P-148, -0X4.0C12426A57194P-440] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; exp2 [-0XB.FADC4FB83E140P+348, -0XF.13E388B2165F0P-512] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; //exp2 [-0XD.F2552B8F60978P+236, -0X7.FBDBC320979A4P+188] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp2 [-0X8.86826CE1AB700P-240, -0X4.FEA8D3A3ED018P-316] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; exp2 [0X1.0000000000000P+0, 0X2.0000000000000P+0] = [0X2.0000000000000P+0, 0X4.0000000000000P+0]; exp2 [-0X1.0000000000000P+0, +0X2.0000000000000P+0] = [0X8.0000000000000P-4, 0X4.0000000000000P+0]; exp2 [-0X5.0000000000000P+0, -0X3.0000000000000P+0] = [0X8.0000000000000P-8, 0X2.0000000000000P-4]; exp2 [-0X2.0000000000000P+0, +0X9.9999999999998P-4] = [0X4.0000000000000P-4, 0X1.8406003B2AE5DP+0]; exp2 [0X4.4400000000000P-1068, 0X4.48CD100000000P-1052] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; exp2 [-0X4.8D15088880000P-1040, +0X4.8D11554000000P-1048] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000001P+0]; exp2 [0XD.0888D11000000P-1044, 0X1.000003443AAAAP+0] = [0X1.0000000000000P+0, 0X2.0000048742860P+0]; exp2 [-0XD.15550CC880000P-1040, +0X4.8D150CC000000P-1048] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000001P+0]; exp2 [-0X4.8D159E0000000P-1048, +0X1.FFFFFF0999999P+0] = [0XF.FFFFFFFFFFFF8P-4, 0X3.FFFFFD54D58B0P+0]; exp2 [-0X1.FFFFFFFFFFFFFP+0, +0X1.14C8911540000P-1040] = [0X4.0000000000000P-4, 0X1.0000000000001P+0]; exp10 [-0X2.8457BC029986EP+112, -0X1.7A77BFCCF5A9EP-232] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp10 [-0X6.05C0BB1BCB730P-220, -0X3.C5EC30FBB68C8P-508] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; exp10 [-0X2.9B09919BF9D9EP+272, -0XE.20FF41BD18058P-204] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp10 [-0X1.1503444763FC5P-416, -0X2.075DF98B2478CP-456] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; //exp10 [-0X2.7C064F6929234P+292, -0X1.5444E676976F1P+252] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp10 [-0X4.ECBC855871080P+332, -0X1.3A01905E36F84P+0] = [0X0.0000000000000P+0, 0XF.317F8555628F0P-8]; exp10 [-0X7.32EDAB7F60A50P+236, -0X2.404E44C49C644P-440] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp10 [-0X6.5263CF84EF388P+172, -0X1.63A15E999EB64P-344] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp10 [-0X1.4171976A1CA54P-288, -0X6.941F470A70074P-756] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; exp10 [-0X4.69BB1D34B9570P-76, -0X7.78A1F475A306CP-564] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; //exp10 [-0X1.F0D19ADCB5D74P+312, -0X1.BA04D452BBB35P+180] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp10 [-0X2.E046DB554037CP+256, -0X2.6ABC15579B2B2P-48] = [0X0.0000000000000P+0, 0XF.FFFFFFFFFFA70P-4]; exp10 [-0XE.33C49CF5B8790P+652, -0X8.297A99ED9ED08P+8] = [0X0.0000000000000P+0, 0X4.0000000000000P-1076]; //exp10 [-0X2.A69A969772FDEP+688, -0X3.436DFE8F08194P+48] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp10 [-0X1.7AAA15EBBD3F2P+8, -0X6.3E590E626451CP-172] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp10 [-0X2.8F9204BC4041EP+988, -0X6.ACFA418D8F92CP-544] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp10 [-0X2.B00450A48D586P-148, -0X2.BB570B356C6CAP-440] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; exp10 [-0X1.9E7DDBBE00F75P+352, -0XC.41329461A0C30P-512] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; //exp10 [-0XD.5E2045CEE9720P+236, -0X6.6978492A3064CP+188] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp10 [-0X1.5BD629B25AA23P-236, -0X7.DEA605DEC97CCP-316] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; //exp10 [-0XB.A944253373080P+564, -0XD.05E9CCF66CF58P+424] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp10 [-0X3.AE1DC13A652CAP+168, -0X6.65D7E0A247778P-56] = [0X0.0000000000000P+0, 0XF.FFFFFFFFFFFF8P-4]; exp10 [-0XA.27B4555158148P-68, -0X5.2B55801231EC8P-344] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; exp10 [-0X1.D68A6BA7E617FP+12, -0X6.36B661DCE2688P-236] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp10 [-0X1.98EF0C6A8BD66P+132, -0X1.EB0E1AB78F314P-480] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp10 [-0X1.C08152CC09416P+220, -0X7.4CF193131FA64P-192] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp10 [-0X6.F70E0DA4D2BA0P-140, -0X1.7036C237D5B00P-672] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; //exp10 [-0XB.24D19E00C8460P+324, -0X1.D283CF8F05665P+252] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; exp10 [-0XF.CC937FA330E40P+648, -0X3.A0EE84451C92CP-324] = [0X0.0000000000000P+0, 0X1.0000000000000P+0]; exp10 [-0X5.F775993940188P-120, -0X1.8BCA641025A83P-124] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; log [0XC.4B4A6EB6B3AF0P-264, 0XA.DD2C4C1BE4B30P+92] = [-0XB.47B530A1054D8P+4, +0X4.227AD8183FB70P+4]; log [0X2.6213E21B14894P-516, 0X6.6606F0995E5F4P-224] = [-0X1.64CBA844FC0EAP+8, -0X9.968AD8B569FE0P+4]; log [0X9.0FF2CAA1B3048P-240, 0X1.95F14B9BA7449P+236] = [-0XA.426B5145A44A0P+4, +0XA.40B346F454218P+4]; log [0X8.E2ADA8DFBE938P-492, 0X3.67CB3BE0BB146P-452] = [-0X1.52D81024E4C23P+8, -0X1.3813C01ACD25CP+8]; log [0X1.394270BBCBA7EP+196, 0X8.4976F0BF45A40P+224] = [0X8.80F0717A1DC40P+4, 0X9.D6130F01F8B78P+4]; log [0X6.A000A12839A50P-44, 0X3.86DC59439415AP+276] = [-0X1.C9B8D4127E3DAP+4, +0XC.091AAD1207058P+4]; log [0X1.3C84E4F9C80CEP-476, 0X9.1E9439C3B4358P+196] = [-0X1.49B9D16B7E46AP+8, +0X8.A1137BDE55CF8P+4]; log [0X8.41D2DB6D93548P-376, 0X2.EDCF4A7919034P+140] = [-0X1.028323B4D95B4P+8, +0X6.21D80D9193AB8P+4]; log [0X1.2C18FEEBCAEAEP-768, 0X1.C369E759DF5E3P-328] = [-0X2.142D983D15A28P+8, -0XE.2C8FA3F896A50P+4]; log [0X4.D94E91619D3F0P-580, 0X2.9F6CAF6B5513EP-132] = [-0X1.907255D3994FEP+8, -0X5.A87FCF5FBD800P+4]; log [0X2.9CD12C1D0AAC4P+116, 0X3.BF7E0E52DC1AAP+276] = [0X5.15D8B410E0A5CP+4, 0XC.0A13DC536CD58P+4]; log [0X3.36DE5C55594EEP-100, 0X1.D0460177B1553P+204] = [-0X4.425A8474E3980P+4, +0X8.DFF506FE0D9F8P+4]; log [0X4.BD4031736F7A8P+4, 0XF.A10BB3C91C7B0P+592] = [0X4.54169A4297548P+0, 0X1.9D179EA5204D0P+8]; log [0X2.8E258DB3C44F8P+20, 0X3.1A4EDE719A4C0P+628] = [0XE.CD14BEBE2CD68P+0, 0X1.B46DC0D02B874P+8]; log [0X2.33950F38F830EP-176, 0X5.BE0388619B018P-24] = [-0X7.9346BAB839B58P+4, -0XE.E33F2C933B990P+0]; log [0X3.24F03DF33568CP-560, 0XE.67255823421E8P+920] = [-0X1.83044F26AAA2BP+8, +0X2.805CE2DC91036P+8]; log [0X2.D572639DC5FA8P-468, 0X1.95CF42AA171CDP-160] = [-0X1.4359ECD75CB6CP+8, -0X6.E715E1BA0E35CP+4]; log [0X4.705A028302DB0P-532, 0X2.E57341C14970CP+324] = [-0X1.6F438EE9F6020P+8, +0XE.1A4A3523F2658P+4]; log [0X4.DBA1D21D6F308P+144, 0X3.667988C57865AP+196] = [0X6.564D09AD1D214P+4, 0X8.914A9531FD118P+4]; log [0X4.9FA5A1E4DF740P-328, 0X1.11B85141B78F6P-240] = [-0XE.1D2336A5BE1A8P+4, -0XA.649D44362A2F0P+4]; log [0XA.0CDE9DC015B08P+360, 0XF.99D84F862AC58P+524] = [0XF.BD7308ED73FF0P+4, 0X1.6DF4DA39DC5DDP+8]; log [0X6.88441038D56B8P-108, 0X3.3D65C09938132P+136] = [-0X4.8FBAEF1169C24P+4, +0X5.F718BBF0CE2F8P+4]; log [0X7.1761CAB055134P-356, 0X1.92EFD09488689P-76] = [-0XF.4CD3094A3B4B8P+4, -0X3.439BFD719BAE8P+4]; log [0X6.2085E427413C8P-252, 0XB.8CDD3B024EA10P-36] = [-0XA.CDC41AEE74318P+4, -0X1.681AFF89E9C89P+4]; log [0XB.F5F1C0FA33978P-504, 0X4.924DD8D50B1CCP+72] = [-0X1.5ADD53379EF4DP+8, +0X3.36D2B121508A8P+4]; log [0XB.BC7E37EB2D388P-216, 0X1.CFE27BB53DEBBP+192] = [-0X9.341D196AD2D58P+4, +0X8.5ADC069F618A8P+4]; log [0X1.E139DD116F868P-688, 0XD.2545346D68FD0P-148] = [-0X1.DC410CBC8E1C8P+8, -0X6.4027B79D2EAA8P+4]; log [0X2.E0C8E64A890ACP+192, 0X2.6A898D2CAA9A4P+260] = [0X8.6243148F46208P+4, 0XB.519B6E544F898P+4]; log [0X5.9C4642ED78BC8P-340, 0X4.631BD2232F0C0P+588] = [-0XE.9F20674285418P+4, +0X1.990C99B6124FEP+8]; log [0XF.C05EA810DFE88P-180, 0XA.05884FBED5F48P-152] = [-0X7.A02728D7D3790P+4, -0X6.70DBA893A16E0P+4]; log2 [0XC.4B4A6EB6B3AF0P-264, 0XA.DD2C4C1BE4B30P+92] = [-0X1.04614E93EA794P+8, +0X5.F7104B04804E4P+4]; log2 [0X2.6213E21B14894P-516, 0X6.6606F0995E5F4P-224] = [-0X2.02BF4547CF74AP+8, -0XD.D527F669B7AA0P+4]; log2 [0X9.0FF2CAA1B3048P-240, 0X1.95F14B9BA7449P+236] = [-0XE.CD1F394A2C268P+4, +0XE.CAA4613C31FD0P+4]; log2 [0X8.E2ADA8DFBE938P-492, 0X3.67CB3BE0BB146P-452] = [-0X1.E8D93AC78E47CP+8, -0X1.C23B6E9F9BE73P+8]; log2 [0X1.394270BBCBA7EP+196, 0X8.4976F0BF45A40P+224] = [0XC.44A8D0A480900P+4, 0XE.30D042BD32E08P+4]; log2 [0X6.A000A12839A50P-44, 0X3.86DC59439415AP+276] = [-0X2.945A6DE3564F2P+4, +0X1.15D18004DA527P+8]; log2 [0X1.3C84E4F9C80CEP-476, 0X9.1E9439C3B4358P+196] = [-0X1.DBB1A03AD9911P+8, +0XC.7305ECF8E75D8P+4]; log2 [0X8.41D2DB6D93548P-376, 0X2.EDCF4A7919034P+140] = [-0X1.74F450FB5F194P+8, +0X8.D8CE5C08208D0P+4]; log2 [0X1.2C18FEEBCAEAEP-768, 0X1.C369E759DF5E3P-328] = [-0X2.FFC54D5EF9E5AP+8, -0X1.472E83799CCFAP+8]; log2 [0X4.D94E91619D3F0P-580, 0X2.9F6CAF6B5513EP-132] = [-0X2.41B8EC5041B68P+8, -0X8.29BE215800410P+4]; log2 [0X2.9CD12C1D0AAC4P+116, 0X3.BF7E0E52DC1AAP+276] = [0X7.562AE05DF4698P+4, 0X1.15E7F7FA196AAP+8]; log2 [0X3.36DE5C55594EEP-100, 0X1.D0460177B1553P+204] = [-0X6.250C3695FCF20P+4, +0XC.CDBDC5938D560P+4]; log2 [0X4.BD4031736F7A8P+4, 0XF.A10BB3C91C7B0P+592] = [0X6.3EA22BED11920P+0, 0X2.53F7565A6FA4CP+8]; log2 [0X2.8E258DB3C44F8P+20, 0X3.1A4EDE719A4C0P+628] = [0X1.55A7D090E9BC4P+4, 0X2.75A230A6EF148P+8]; log2 [0X2.33950F38F830EP-176, 0X5.BE0388619B018P-24] = [-0XA.EDC8C6AE09A00P+4, -0X1.57A778189781EP+4]; log2 [0X3.24F03DF33568CP-560, 0XE.67255823421E8P+920] = [-0X2.2E58E661BEF52P+8, +0X3.9BD9297418726P+8]; log2 [0X2.D572639DC5FA8P-468, 0X1.95CF42AA171CDP-160] = [-0X1.D27F4D5811EC0P+8, -0X9.F55D8E4A51F88P+4]; log2 [0X4.705A028302DB0P-532, 0X2.E57341C14970CP+324] = [-0X2.11D98CE9F01E8P+8, +0X1.4588C1B9F05FCP+8]; log2 [0X4.DBA1D21D6F308P+144, 0X3.667988C57865AP+196] = [0X9.247C4A0D6A240P+4, 0XC.5C40234316DE0P+4]; log2 [0X4.9FA5A1E4DF740P-328, 0X1.11B85141B78F6P-240] = [-0X1.45CA7D7508D73P+8, -0XE.FE7480A8A6A70P+4]; log2 [0XA.0CDE9DC015B08P+360, 0XF.99D84F862AC58P+524] = [0X1.6B54440063A2FP+8, 0X2.0FF6AC0A1DF08P+8]; log2 [0X6.88441038D56B8P-108, 0X3.3D65C09938132P+136] = [-0X6.94ADB7A807630P+4, +0X8.9B227CD69B7B0P+4]; log2 [0X7.1761CAB055134P-356, 0X1.92EFD09488689P-76] = [-0X1.612C877FDEFC9P+8, -0X4.B58789B7D2AB8P+4]; log2 [0X6.2085E427413C8P-252, 0XB.8CDD3B024EA10P-36] = [-0XF.96282D809EDE0P+4, -0X2.0785B9A270C10P+4]; log2 [0XB.F5F1C0FA33978P-504, 0X4.924DD8D50B1CCP+72] = [-0X1.F46B75E4932F4P+8, +0X4.A3152AC221298P+4]; log2 [0XB.BC7E37EB2D388P-216, 0X1.CFE27BB53DEBBP+192] = [-0XD.47274C2E0B298P+4, +0XC.0DB8D252704A8P+4]; log2 [0X1.E139DD116F868P-688, 0XD.2545346D68FD0P-148] = [-0X2.AF16E4D3D6128P+8, -0X9.048930492A7A0P+4]; log2 [0X2.E0C8E64A890ACP+192, 0X2.6A898D2CAA9A4P+260] = [0XC.1866CEA5B0408P+4, 0X1.0545D0C4DA7BAP+8]; log2 [0X5.9C4642ED78BC8P-340, 0X4.631BD2232F0C0P+588] = [-0X1.51830AD8B30FCP+8, +0X2.4E221EC1DB53EP+8]; log2 [0XF.C05EA810DFE88P-180, 0XA.05884FBED5F48P-152] = [-0XB.005C8501548A8P+4, -0X9.4ACCA02A24828P+4]; log10 [0XC.4B4A6EB6B3AF0P-264, 0XA.DD2C4C1BE4B30P+92] = [-0X4.E61D94C4C8D58P+4, +0X1.CBB1247192AE0P+4]; log10 [0X2.6213E21B14894P-516, 0X6.6606F0995E5F4P-224] = [-0X9.AF44F24283358P+4, -0X4.29FE8451F9E24P+4]; log10 [0X9.0FF2CAA1B3048P-240, 0X1.95F14B9BA7449P+236] = [-0X4.74A3ADB971C48P+4, +0X4.73E4925024C64P+4]; log10 [0X8.E2ADA8DFBE938P-492, 0X3.67CB3BE0BB146P-452] = [-0X9.32877CA0160B8P+4, -0X8.7888BDDBCE5D0P+4]; log10 [0X1.394270BBCBA7EP+196, 0X8.4976F0BF45A40P+224] = [0X3.B16EC52507DF2P+4, 0X4.4595F97548968P+4]; log10 [0X6.A000A12839A50P-44, 0X3.86DC59439415AP+276] = [-0XC.6C93FFEF64F78P+0, +0X5.3A1B471A21FF4P+4]; log10 [0X1.3C84E4F9C80CEP-476, 0X9.1E9439C3B4358P+196] = [-0X8.F32B7DBB21008P+4, +0X3.BF63BA7A3C658P+4]; log10 [0X8.41D2DB6D93548P-376, 0X2.EDCF4A7919034P+140] = [-0X7.0453C2F061648P+4, +0X2.A9C64A16830FCP+4]; log10 [0X1.2C18FEEBCAEAEP-768, 0X1.C369E759DF5E3P-328] = [-0XE.71F3C5029D848P+4, -0X6.27DD331C437F0P+4]; log10 [0X4.D94E91619D3F0P-580, 0X2.9F6CAF6B5513EP-132] = [-0XA.DE968FD95ABE0P+4, -0X2.7513429684674P+4]; log10 [0X2.9CD12C1D0AAC4P+116, 0X3.BF7E0E52DC1AAP+276] = [0X2.35627EFD00A60P+4, 0X5.3A877F4AD58E8P+4]; log10 [0X3.36DE5C55594EEP-100, 0X1.D0460177B1553P+204] = [-0X1.D988D7EBC5AE3P+4, +0X3.DAB2CD7F2625EP+4]; log10 [0X4.BD4031736F7A8P+4, 0XF.A10BB3C91C7B0P+592] = [0X1.E13C93CF0C5D8P+0, 0XB.367584AC914D0P+4]; log10 [0X2.8E258DB3C44F8P+20, 0X3.1A4EDE719A4C0P+628] = [0X6.6D93B54D66420P+0, 0XB.D89E0CA927598P+4]; log10 [0X2.33950F38F830EP-176, 0X5.BE0388619B018P-24] = [-0X3.4A378CAAD54DAP+4, -0X6.773414D886C14P+0]; log10 [0X3.24F03DF33568CP-560, 0XE.67255823421E8P+920] = [-0XA.8144B5B8F5DD8P+4, +0X1.161B25DAC86ECP+8]; log10 [0X2.D572639DC5FA8P-468, 0X1.95CF42AA171CDP-160] = [-0X8.C6DFF01C76970P+4, -0X2.FF6F7B088B0CCP+4]; log10 [0X4.705A028302DB0P-532, 0X2.E57341C14970CP+324] = [-0X9.F802CE339E840P+4, +0X6.1FEDD0FB88D78P+4]; log10 [0X4.DBA1D21D6F308P+144, 0X3.667988C57865AP+196] = [0X2.C08E6C63F32E4P+4, 0X3.B888C99289754P+4]; log10 [0X4.9FA5A1E4DF740P-328, 0X1.11B85141B78F6P-240] = [-0X6.212A6B69124F0P+4, -0X4.837D7868C93BCP+4]; log10 [0XA.0CDE9DC015B08P+360, 0XF.99D84F862AC58P+524] = [0X6.D5F7B5F14DD48P+4, 0X9.EEED0801EA480P+4]; log10 [0X6.88441038D56B8P-108, 0X3.3D65C09938132P+136] = [-0X1.FB238786D64F9P+4, +0X2.9735AA99F42AAP+4]; log10 [0X7.1761CAB055134P-356, 0X1.92EFD09488689P-76] = [-0X6.A50E2200DFF14P+4, -0X1.6AE688B7C8203P+4]; log10 [0X6.2085E427413C8P-252, 0XB.8CDD3B024EA10P-36] = [-0X4.B1282C68FE4F8P+4, -0X9.C644DFB9EE3E0P+0]; log10 [0XB.F5F1C0FA33978P-504, 0X4.924DD8D50B1CCP+72] = [-0X9.6A430336AD680P+4, +0X1.6558F570C1420P+4]; log10 [0XB.BC7E37EB2D388P-216, 0X1.CFE27BB53DEBBP+192] = [-0X3.FF3F46384E0E2P+4, +0X3.A0E51611FF75EP+4]; log10 [0X1.E139DD116F868P-688, 0XD.2545346D68FD0P-148] = [-0XC.ED5A39E5D4878P+4, -0X2.B6F044CDE4A0CP+4]; log10 [0X2.E0C8E64A890ACP+192, 0X2.6A898D2CAA9A4P+260] = [0X3.A41C190FE9E7AP+4, 0X4.EA6A3021E4FB8P+4]; log10 [0X5.9C4642ED78BC8P-340, 0X4.631BD2232F0C0P+588] = [-0X6.599E84FEF71BCP+4, +0XB.1A5D77BC55F98P+4]; log10 [0XF.C05EA810DFE88P-180, 0XA.05884FBED5F48P-152] = [-0X3.4FCF2BC10B840P+4, -0X2.CC1706E0167D2P+4]; sin [-0XA.644C9D88EA8C8P-152, -0XD.8EC7927926F18P-944] = [-0XA.644C9D88EA8C8P-152, -0XD.8EC7927926F10P-944]; sin [-0X1.9EE1A9DB994F5P-436, -0X6.D914701C82FECP-624] = [-0X1.9EE1A9DB994F5P-436, -0X6.D914701C82FE8P-624]; sin [-0X5.65057F3EFFC60P+4, -0X2.3617CF5815ECAP-960] = [-0X1.0000000000000P+0, +0X1.0000000000000P+0]; sin [-0X1.975299CCB0E08P-372, +0XB.BEC7D35B45B00P-588] = [-0X1.975299CCB0E08P-372, +0XB.BEC7D35B45B00P-588]; sin [-0X3.51D388D47AED2P-356, -0X1.C3A9CD7025105P-564] = [-0X3.51D388D47AED2P-356, -0X1.C3A9CD7025104P-564]; sin [-0XC.DB363268CF708P-332, -0X2.171B7D7BFE4E0P-412] = [-0XC.DB363268CF708P-332, -0X2.171B7D7BFE4DEP-412]; sin [-0X1.32690AAC2472DP-40, -0X8.706EBDCF39C88P-792] = [-0X1.32690AAC2472DP-40, -0X8.706EBDCF39C80P-792]; sin [-0X5.0145AF0C53324P-200, -0X2.F5A0CB3301856P-204] = [-0X5.0145AF0C53324P-200, -0X2.F5A0CB3301854P-204]; sin [0XF.4077C7E8CD6A0P-268, 0X3.753426098AC5AP-80] = [0XF.4077C7E8CD698P-268, 0X3.753426098AC5AP-80]; sin [-0XB.B25F8D8BB7FB8P-376, -0X2.017A332F9B05CP-916] = [-0XB.B25F8D8BB7FB8P-376, -0X2.017A332F9B05AP-916]; sin [-0XD.947CA427FDFE0P-592, +0XE.3BE493B5BC8E8P-16] = [-0XD.947CA427FDFE0P-592, +0XE.3BE491D517170P-16]; sin [-0X9.C46198B2471F0P-336, -0X1.65ED85DF2D4B7P-576] = [-0X9.C46198B2471F0P-336, -0X1.65ED85DF2D4B6P-576]; sin [-0X3.2C867C027DB44P-936, +0X6.1883EA827AB6CP-388] = [-0X3.2C867C027DB44P-936, +0X6.1883EA827AB6CP-388]; sin [-0X3.560EF91C47DEAP-492, +0X5.413664DD17ABCP-20] = [-0X3.560EF91C47DEAP-492, +0X5.413664DCFF7D4P-20]; sin [-0X8.36BFCD74A6D68P-304, -0X3.2C20EB130D510P-836] = [-0X8.36BFCD74A6D68P-304, -0X3.2C20EB130D50EP-836]; sin [-0X6.BCEC84603958CP-500, -0X1.068B13DA99666P-760] = [-0X6.BCEC84603958CP-500, -0X1.068B13DA99665P-760]; sin [-0X1.2789C2D583BCDP-568, -0X1.F2BD89DAD0665P-780] = [-0X1.2789C2D583BCDP-568, -0X1.F2BD89DAD0664P-780]; sin [-0XC.FE4E8D857E3E0P-548, +0X1.580844B9DC45CP-780] = [-0XC.FE4E8D857E3E0P-548, +0X1.580844B9DC45CP-780]; sin [-0XC.508D29ACB01B8P-52, +0X1.B1E6B793078DDP-664] = [-0XC.508D29ACB01B8P-52, +0X1.B1E6B793078DDP-664]; sin [-0XA.12F7783880A78P-124, -0X3.765DF69EE106EP-548] = [-0XA.12F7783880A78P-124, -0X3.765DF69EE106CP-548]; sin [-0X6.3A58D52FDF844P-896, -0X1.039E2518CF503P-1008] = [-0X6.3A58D52FDF844P-896, -0X1.039E2518CF502P-1008]; sin [-0XB.DD3171FDEEC18P-168, +0X1.069E434EE9E0FP-740] = [-0XB.DD3171FDEEC18P-168, +0X1.069E434EE9E0FP-740]; sin [-0X3.CF0053257533AP-776, -0X1.7883A587654E5P-928] = [-0X3.CF0053257533AP-776, -0X1.7883A587654E4P-928]; sin [0X1.455801D3D2B63P-704, 0X3.A4C915783D07AP-28] = [0X1.455801D3D2B62P-704, 0X3.A4C915783D07AP-28]; sin [-0X2.097D06F4DE3E2P-376, +0X2.2E7561FD9255EP-772] = [-0X2.097D06F4DE3E2P-376, +0X2.2E7561FD9255EP-772]; sin [-0X1.7E13DBB66E5A3P-84, -0X6.BC8F45D6A8F48P-540] = [-0X1.7E13DBB66E5A3P-84, -0X6.BC8F45D6A8F44P-540]; sin [-0X4.1F50C5F2CDA54P-276, -0X3.DF16F79756422P-496] = [-0X4.1F50C5F2CDA54P-276, -0X3.DF16F79756420P-496]; sin [-0X7.ECC4C5EEC4CACP-328, -0X2.E02E1DB7A08F6P-876] = [-0X7.ECC4C5EEC4CACP-328, -0X2.E02E1DB7A08F4P-876]; sin [-0XC.1BC7A4C89D440P-256, +0X2.A7F56252D1D34P-608] = [-0XC.1BC7A4C89D440P-256, +0X2.A7F56252D1D34P-608]; sin [-0XB.CE50D7B2F2868P-236, -0XE.6B08988339B80P-432] = [-0XB.CE50D7B2F2868P-236, -0XE.6B08988339B78P-432]; cos [-0XA.644C9D88EA8C8P-152, -0XD.8EC7927926F18P-944] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X1.9EE1A9DB994F5P-436, -0X6.D914701C82FECP-624] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X5.65057F3EFFC60P+4, -0X2.3617CF5815ECAP-960] = [-0X1.0000000000000P+0, +0X1.0000000000000P+0]; cos [-0X1.975299CCB0E08P-372, +0XB.BEC7D35B45B00P-588] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X3.51D388D47AED2P-356, -0X1.C3A9CD7025105P-564] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0XC.DB363268CF708P-332, -0X2.171B7D7BFE4E0P-412] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X1.32690AAC2472DP-40, -0X8.706EBDCF39C88P-792] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X5.0145AF0C53324P-200, -0X2.F5A0CB3301856P-204] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [0XF.4077C7E8CD6A0P-268, 0X3.753426098AC5AP-80] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0XB.B25F8D8BB7FB8P-376, -0X2.017A332F9B05CP-916] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0XD.947CA427FDFE0P-592, +0XE.3BE493B5BC8E8P-16] = [0XF.FFFFF9AB27E58P-4, 0X1.0000000000000P+0]; cos [-0X9.C46198B2471F0P-336, -0X1.65ED85DF2D4B7P-576] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X3.2C867C027DB44P-936, +0X6.1883EA827AB6CP-388] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X3.560EF91C47DEAP-492, +0X5.413664DD17ABCP-20] = [0XF.FFFFFFFF231A0P-4, 0X1.0000000000000P+0]; cos [-0X8.36BFCD74A6D68P-304, -0X3.2C20EB130D510P-836] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X6.BCEC84603958CP-500, -0X1.068B13DA99666P-760] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X1.2789C2D583BCDP-568, -0X1.F2BD89DAD0665P-780] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0XC.FE4E8D857E3E0P-548, +0X1.580844B9DC45CP-780] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0XC.508D29ACB01B8P-52, +0X1.B1E6B793078DDP-664] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0XA.12F7783880A78P-124, -0X3.765DF69EE106EP-548] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X6.3A58D52FDF844P-896, -0X1.039E2518CF503P-1008] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0XB.DD3171FDEEC18P-168, +0X1.069E434EE9E0FP-740] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X3.CF0053257533AP-776, -0X1.7883A587654E5P-928] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [0X1.455801D3D2B63P-704, 0X3.A4C915783D07AP-28] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X2.097D06F4DE3E2P-376, +0X2.2E7561FD9255EP-772] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X1.7E13DBB66E5A3P-84, -0X6.BC8F45D6A8F48P-540] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X4.1F50C5F2CDA54P-276, -0X3.DF16F79756422P-496] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0X7.ECC4C5EEC4CACP-328, -0X2.E02E1DB7A08F6P-876] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0XC.1BC7A4C89D440P-256, +0X2.A7F56252D1D34P-608] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; cos [-0XB.CE50D7B2F2868P-236, -0XE.6B08988339B80P-432] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; tan [0X4.6AF931A62EB70P+4, 0X4.6C0D89ACF83F0P+4] = [-0X4.2B94A5B864748P+16, -0XE.CC7EFFC39BBE8P+0]; tan [0X9.B824319678E98P+4, 0X9.B8365416B3188P+4] = [-0X9.517610C9FF4F0P+28, -0XE.1DCEBD0ABA128P+4]; tan [0XE.231D6DE6B2910P+0, 0XE.232155989FD58P+0] = [-0X1.1A74CC770CA81P+20, -0X4.09E5FC000B430P+12]; tan [0X3.A1E994576AF38P+4, 0X3.A1F62CB3D8B0CP+4] = [-0X3.EDBBE63A85A20P+12, -0X1.3EC2E09B0B82DP+8]; tan [0X4.504512C674C88P+8, 0X4.5045147DF4570P+8] = [-0XC.5E819F2BCA708P+28, -0X9.51D20751384C0P+12]; tan [0X7.DA9E8C267B000P+0, 0XA.CCC7028A13E50P+0] = [-0X8.CE26DA7B8CCA8P+20, +0X5.0BA299C8F763CP+0]; tan [0XC.CA9E956E09870P+12, 0XC.CA9FEB35E8D28P+12] = [-0X9.40D68D3420248P+16, -0XB.F4CB43C962B98P+0]; tan [0X2.F6B1D30E1AC2CP+8, 0X2.F6B1EAD90ED6EP+8] = [-0X1.1E211833A60A2P+20, -0XA.BBFD5C235E8E8P+8]; tan [0XB.C33774AC8C510P+8, 0XB.C3378F9640B80P+8] = [-0X3.B8E9A3359EA76P+12, -0X8.33C065B080F78P+8]; tan [0X4.B65F2027400ECP+0, 0X4.B65F690A4503CP+0] = [-0X2.D46AD27DDB548P+24, -0X3.7ECF31F99ADC4P+16]; tan [0X3.C60A2C774D8A6P+8, 0X3.C60A76B28E42CP+8] = [-0X3.28E3C44C11B44P+24, -0X3.72D85B31BD660P+8]; tan [0X7.DA9E8A5DF3B7CP+0, 0X7.DAA9CFE45466CP+0] = [-0X1.D9B11082E8FC3P+28, -0X1.6B6333E88C1DFP+12]; tan [0X3.A1E953315B022P+4, 0X3.A3624FC9B84C0P+4] = [-0X4.91A5298A762FCP+24, -0XA.D59BACA695F48P+0]; tan [0X7.DA9E8AB1B7B7CP+0, 0X8.E4A2BCBB988B0P+0] = [-0X2.C52AD8545AC54P+24, -0X9.691CCDB9751E8P-4]; tan [0X5.48783C12B018CP+8, 0X5.487863A8A0C78P+8] = [-0X4.7465D978FF1E8P+4, -0X4.455187267B294P+4]; tan [0X1.AB41B772619C2P+4, 0X1.AB96C295E1A23P+4] = [-0X2.55DE9F429F276P+16, -0X3.02439C1296068P+4]; tan [0X1.87E20C8B7CCC1P+16, 0X1.87E20E060934FP+16] = [-0X7.5F7BB0C55311CP+28, -0XA.D1F5D5F3730E8P+4]; tan [0X2.5BA5629043048P+16, 0X2.5BA5A6106DDF4P+16] = [-0X4.BDE3C915168D8P+4, -0X3.84ED584601B4CP+0]; tan [0X1.A9AF913EE27CFP+8, 0X1.A9AFA6D06E549P+8] = [-0X2.CB455269CB954P+16, -0XB.ACE6E2EAA9098P+8]; tan [0X7.64CF403A51948P+8, 0X7.64D139F1912E4P+8] = [-0X5.38F704820A47CP+28, -0X8.19686283B81E8P+4]; tan [0X4.1437B08F8BA70P+16, 0X4.1439A27E86D50P+16] = [-0X1.3ADB30F7A9B56P+24, +0X6.48C7464A8F9A0P-4]; tan [0X2.74518B3BAFB7CP+4, 0X2.74518DE5A60C0P+4] = [-0XF.8E3A10DB36640P+24, -0X5.FF456443FD8B8P+16]; tan [0X1.DD85A7816A0FFP+4, 0X1.DD89849DFDF09P+4] = [-0X3.FA5C8BD1A67ECP+20, -0X4.23D96B0387510P+8]; tan [0X1.AB41B29964887P+4, 0X1.B5CBD4ED0D1DDP+4] = [-0X7.FC8B577B97310P+16, -0X1.4AB8A7BB81552P+0]; tan [0X1.19454E95BC804P+12, 0X1.194551E9AD95AP+12] = [-0X1.2A53ECF4C9B1AP+12, -0X3.D27F074C2DA94P+8]; tan [0X4.C4823D2C30D00P+8, 0X4.C482DEAE395CCP+8] = [-0X7.F7B434A3F3544P+28, -0X1.95C659F53B09BP+8]; tan [0X1.DD85BAAB9BAF9P+4, 0X1.DD8660423BAACP+4] = [-0XD.2F5338751C9C8P+12, -0X1.623D682415BE0P+12]; tan [0X2.F798BB3536690P+16, 0X2.F79A363308C32P+16] = [-0X2.F8C1AC15A9CCEP+16, -0X1.731B7ACF94603P-4]; tan [0X1.78FDB9F143616P+4, 0X1.78FDB9F143616P+4] = [-0XC.9CFD638FE0A18P+24, -0XC.9CFD638FE0A10P+24]; tan [0X1.78FDB9F143616P+4, 0X1.79367E02D4EAAP+4] = [-0XC.9CFD638FE0A18P+24, -0X4.826BF805C4E68P+4]; cot [0X4.51D73651EA89CP+4, 0X4.52EB8E58B411CP+4] = [0XE.CC7EFFC39DE08P+0, 0X4.2B94A5E391E20P+16]; cot [0X9.9F02364234BC8P+4, 0X9.9F1458C26EEB8P+4] = [0XE.1DCEBD0AA72D0P+4, 0X9.516DD4FA21CF0P+28]; cot [0XC.90FDB8A26FBF8P+0, 0XC.9101A0545D040P+0] = [0X4.09E5FC0006C38P+12, 0X1.1A74CC76B6B71P+20]; cot [0X3.88C7990326C68P+4, 0X3.88D4315F9483CP+4] = [0X1.3EC2E09B0928AP+8, 0X3.EDBBE6390EF44P+12]; cot [0X4.4EB2F3113085CP+8, 0X4.4EB2F4C8B0144P+8] = [0X9.51D206F220E70P+12, 0XC.5DDA26E3680B8P+28]; cot [0X6.487ED6E2382ECP+0, 0X9.3AA74D45D1138P+0] = [-0X5.0BA299C8F7644P+0, +0X8.CE26D93009840P+20]; cot [0XC.CA857372B5428P+12, 0XC.CA86C93A948E0P+12] = [0XB.F4CB43CC4C9E8P+0, 0X9.40D848DDFC130P+16]; cot [0X2.F51FB358D6800P+8, 0X2.F51FCB23CA942P+8] = [0XA.BBFD5C1B7C1D8P+8, 0X1.1E2116D584957P+20]; cot [0XB.C1A554F7480E0P+8, 0XB.C1A56FE0FC750P+8] = [0X8.33C065BCB81C8P+8, 0X3.B8E9A35DDF6BCP+12]; cot [0X3.243F6AE2FD3D8P+0, 0X3.243FB3C602324P+0] = [0X3.7ECF31F964F42P+16, 0X2.D46AD05A0B746P+24]; cot [0X3.C4780CC209478P+8, 0X3.C47856FD49FFEP+8] = [0X3.72D85B3269A44P+8, 0X3.28E454E439A90P+24]; cot [0X6.487ED519B0E68P+0, 0X6.488A1AA011958P+0] = [0X1.6B6333E883806P+12, 0X1.D9B101DF34E20P+28]; cot [0X3.88C757DD16D52P+4, 0X3.8A405475741F0P+4] = [0XA.D59BACA695410P+0, 0X4.91A509DE53224P+24]; cot [0X6.487ED56D74E68P+0, 0X7.5283077755B9CP+0] = [0X9.691CCDB975190P-4, 0X2.C52AD6475D346P+24]; cot [0X5.46E61C5D6BD60P+8, 0X5.46E643F35C84CP+8] = [0X4.4551872667304P+4, 0X4.7465D978E9638P+4]; cot [0X1.921FBC1E1D6F1P+4, 0X1.9274C7419D752P+4] = [0X3.02439C1295BB8P+4, 0X2.55DE9F3FCCF28P+16]; cot [0X1.87E07A6BC787DP+16, 0X1.87E07BE653F0BP+16] = [0XA.D1F5D5DED35E0P+4, 0X7.55F4ABD4357C8P+28]; cot [0X2.5BA3D0708DC04P+16, 0X2.5BA413F0B89B0P+16] = [0X3.84ED5845DBFB2P+0, 0X4.BDE3C91120740P+4]; cot [0X1.A81D71899E3A2P+8, 0X1.A81D871B2A11CP+8] = [0XB.ACE6E2E9DA370P+8, 0X2.CB45525DF368EP+16]; cot [0X7.633D20850D51CP+8, 0X7.633F1A3C4CEB8P+8] = [0X8.19686283704C0P+4, 0X5.38D928BC4D11CP+28]; cot [0X4.14361E6FD662CP+16, 0X4.1438105ED190CP+16] = [-0X6.48C7464AC3A74P-4, +0X1.3AD6ED9B4C193P+24]; cot [0X2.5B2F8FE76B8ACP+4, 0X2.5B2F929161DF0P+4] = [0X5.FF45640D6BF8CP+16, 0XF.8E38A1B8F3CE0P+24]; cot [0X1.C463AC2D25E2EP+4, 0X1.C4678949B9C38P+4] = [0X4.23D96B037E734P+8, 0X3.FA5C8B4EB13BAP+20]; cot [0X1.921FB745205B6P+4, 0X1.9CA9D998C8F0CP+4] = [0X1.4AB8A7BB8153CP+0, 0X7.FC8B575A99618P+16]; cot [0X1.192C2C9A683C1P+12, 0X1.192C2FEE59517P+12] = [0X3.D27F074ED4C1AP+8, 0X1.2A53ECF8BBB09P+12]; cot [0X4.C2F01D76EC8D4P+8, 0X4.C2F0BEF8F51A0P+8] = [0X1.95C659F50F06FP+8, 0X7.F76EB663A7898P+28]; cot [0X1.C463BF5757828P+4, 0X1.C46464EDF77DBP+4] = [0X1.623D682405E56P+12, 0XD.2F53386F7DF28P+12]; cot [0X2.F79729158124CP+16, 0X2.F798A413537EEP+16] = [0X1.731B7ACF66E92P-4, 0X2.F8C19331ECBFCP+16]; cot [0X3.371943E536E9EP+8, 0X3.371D0784693FAP+8] = [0X3.E06D09FC7DDC2P+4, 0X2.C1B5E6F32FDEEP+8]; cot [0X1.5FDBBE9CFF344P+4, 0X1.601482AE90BD8P+4] = [0X4.826BF805C583CP+4, 0XC.9CFDB05DEF930P+24]; asin [-0X3.11A309475E762P-164, -0XC.3784302E15500P-680] = [-0X3.11A309475E764P-164, -0XC.3784302E15500P-680]; asin [-0X5.7DD17A4248D38P-280, -0X2.898FC0F386F74P-640] = [-0X5.7DD17A4248D3CP-280, -0X2.898FC0F386F74P-640]; asin [-0XE.D83DCD7F564A0P-296, -0X1.62F61FBA0F40FP-764] = [-0XE.D83DCD7F564A8P-296, -0X1.62F61FBA0F40FP-764]; asin [-0X1.67712A1E64C2CP-944, -0X1.C0102C4D258EFP-976] = [-0X1.67712A1E64C2DP-944, -0X1.C0102C4D258EFP-976]; asin [0X2.E3D991AE84668P-728, 0X1.92C3C728CCF4AP-612] = [0X2.E3D991AE84668P-728, 0X1.92C3C728CCF4BP-612]; asin [-0X1.BCD3FEB3B0175P-640, +0X1.BEBE69E3BF3C2P-536] = [-0X1.BCD3FEB3B0176P-640, +0X1.BEBE69E3BF3C3P-536]; asin [-0X1.2469575189327P-372, -0X7.51C0C39F58A4CP-1008] = [-0X1.2469575189328P-372, -0X7.51C0C39F58A4CP-1008]; asin [-0X1.C4D163A6CCCD9P-336, -0X1.3BEE6DAB70397P-796] = [-0X1.C4D163A6CCCDAP-336, -0X1.3BEE6DAB70397P-796]; asin [-0X2.0FAE5DE90C98CP-896, -0X2.2079777EC2418P-976] = [-0X2.0FAE5DE90C98EP-896, -0X2.2079777EC2418P-976]; asin [-0X1.08C248C37E53BP-816, +0X2.8C9F04EE5DE84P-948] = [-0X1.08C248C37E53CP-816, +0X2.8C9F04EE5DE86P-948]; asin [-0X2.0002542B01474P-228, +0X2.4D59F217BF74CP-796] = [-0X2.0002542B01476P-228, +0X2.4D59F217BF74EP-796]; asin [0XD.D4033889729A0P-844, 0X7.44451BF919D78P-556] = [0XD.D4033889729A0P-844, 0X7.44451BF919D7CP-556]; asin [-0X2.08918B016995CP-64, +0X3.3FC26450C6E4AP-268] = [-0X2.08918B016995EP-64, +0X3.3FC26450C6E4CP-268]; asin [-0X2.66C95BD8D7716P-388, +0X1.7E16B310F878AP-232] = [-0X2.66C95BD8D7718P-388, +0X1.7E16B310F878BP-232]; asin [-0X3.D9C66BD30B774P-256, -0X4.A8C30F678CB68P-456] = [-0X3.D9C66BD30B776P-256, -0X4.A8C30F678CB68P-456]; asin [-0X1.AA045CCB15AEDP-804, +0XD.450C473265610P-24] = [-0X1.AA045CCB15AEEP-804, +0XD.450C473266E68P-24]; asin [-0X2.23ADFA571FC3CP-344, -0X1.30D1074DC059EP-868] = [-0X2.23ADFA571FC3EP-344, -0X1.30D1074DC059EP-868]; asin [-0X3.DFBC1A4BF3888P-68, -0X4.A89E39B247C84P-840] = [-0X3.DFBC1A4BF388AP-68, -0X4.A89E39B247C84P-840]; asin [0X9.583064525D370P-496, 0X2.C67652F06A55EP-408] = [0X9.583064525D370P-496, 0X2.C67652F06A560P-408]; asin [-0X3.38BF880EC3082P-304, -0X7.7B19877E536ACP-512] = [-0X3.38BF880EC3084P-304, -0X7.7B19877E536ACP-512]; asin [-0X2.ADBF037238702P-44, +0X1.98DC940C3AE1EP-564] = [-0X2.ADBF037238704P-44, +0X1.98DC940C3AE1FP-564]; asin [-0X4.E4A79C48B3A58P-328, +0XA.28B02E59D39D8P-856] = [-0X4.E4A79C48B3A5CP-328, +0XA.28B02E59D39E0P-856]; asin [-0X6.80D3E87B911D8P-232, -0X2.3DF54212C46E4P-520] = [-0X6.80D3E87B911DCP-232, -0X2.3DF54212C46E4P-520]; asin [-0X1.4E54C309C46F8P-480, +0X9.47E982AC83F98P-688] = [-0X1.4E54C309C46F9P-480, +0X9.47E982AC83FA0P-688]; asin [-0X2.276202227A6DEP-808, +0X1.C53E9BA64FADFP-768] = [-0X2.276202227A6E0P-808, +0X1.C53E9BA64FAE0P-768]; asin [-0X4.8E4B4D7BA6DD0P-212, -0X1.4B35284C1064BP-548] = [-0X4.8E4B4D7BA6DD4P-212, -0X1.4B35284C1064BP-548]; asin [-0X3.5C52B8D9FF582P-248, -0X2.AF868D652B866P-912] = [-0X3.5C52B8D9FF584P-248, -0X2.AF868D652B866P-912]; asin [0X1.6938CC5EE183AP-692, 0XB.F7A583AC38168P-664] = [0X1.6938CC5EE183AP-692, 0XB.F7A583AC38170P-664]; asin [-0X3.68B35F23B2506P-560, +0X9.F9C9246D05138P-304] = [-0X3.68B35F23B2508P-560, +0X9.F9C9246D05140P-304]; asin [-0XA.BDE70B6850EA0P-516, +0X2.BB76D5BF703FAP-1020] = [-0XA.BDE70B6850EA8P-516, +0X2.BB76D5BF703FCP-1020]; acos [-0X3.11A309475E762P-164, -0XC.3784302E15500P-680] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X5.7DD17A4248D38P-280, -0X2.898FC0F386F74P-640] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0XE.D83DCD7F564A0P-296, -0X1.62F61FBA0F40FP-764] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X1.67712A1E64C2CP-944, -0X1.C0102C4D258EFP-976] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [0X2.E3D991AE84668P-728, 0X1.92C3C728CCF4AP-612] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X1.BCD3FEB3B0175P-640, +0X1.BEBE69E3BF3C2P-536] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X1.2469575189327P-372, -0X7.51C0C39F58A4CP-1008] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X1.C4D163A6CCCD9P-336, -0X1.3BEE6DAB70397P-796] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X2.0FAE5DE90C98CP-896, -0X2.2079777EC2418P-976] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X1.08C248C37E53BP-816, +0X2.8C9F04EE5DE84P-948] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X2.0002542B01474P-228, +0X2.4D59F217BF74CP-796] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [0XD.D4033889729A0P-844, 0X7.44451BF919D78P-556] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X2.08918B016995CP-64, +0X3.3FC26450C6E4AP-268] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X2.66C95BD8D7716P-388, +0X1.7E16B310F878AP-232] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X3.D9C66BD30B774P-256, -0X4.A8C30F678CB68P-456] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X1.AA045CCB15AEDP-804, +0XD.450C473265610P-24] = [0X1.921FA7FF368A5P+0, 0X1.921FB54442D19P+0]; acos [-0X2.23ADFA571FC3CP-344, -0X1.30D1074DC059EP-868] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X3.DFBC1A4BF3888P-68, -0X4.A89E39B247C84P-840] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [0X9.583064525D370P-496, 0X2.C67652F06A55EP-408] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X3.38BF880EC3082P-304, -0X7.7B19877E536ACP-512] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X2.ADBF037238702P-44, +0X1.98DC940C3AE1EP-564] = [0X1.921FB54442D18P+0, 0X1.921FB54442FC7P+0]; acos [-0X4.E4A79C48B3A58P-328, +0XA.28B02E59D39D8P-856] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X6.80D3E87B911D8P-232, -0X2.3DF54212C46E4P-520] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X1.4E54C309C46F8P-480, +0X9.47E982AC83F98P-688] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X2.276202227A6DEP-808, +0X1.C53E9BA64FADFP-768] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X4.8E4B4D7BA6DD0P-212, -0X1.4B35284C1064BP-548] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X3.5C52B8D9FF582P-248, -0X2.AF868D652B866P-912] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [0X1.6938CC5EE183AP-692, 0XB.F7A583AC38168P-664] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0X3.68B35F23B2506P-560, +0X9.F9C9246D05138P-304] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acos [-0XA.BDE70B6850EA0P-516, +0X2.BB76D5BF703FAP-1020] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan [0X1.7A77BFCCF5A9EP-232, 0X2.8457BC029986EP+112] = [0X1.7A77BFCCF5A9DP-232, 0X1.921FB54442D19P+0]; atan [0X3.C5EC30FBB68C8P-508, 0X6.05C0BB1BCB730P-220] = [0X3.C5EC30FBB68C6P-508, 0X6.05C0BB1BCB730P-220]; atan [0XE.20FF41BD18058P-204, 0X2.9B09919BF9D9EP+272] = [0XE.20FF41BD18050P-204, 0X1.921FB54442D19P+0]; atan [0X2.075DF98B2478CP-456, 0X1.1503444763FC5P-416] = [0X2.075DF98B2478AP-456, 0X1.1503444763FC5P-416]; atan [0X1.5444E676976F1P+252, 0X2.7C064F6929234P+292] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan [0X1.3A01905E36F84P+0, 0X4.ECBC855871080P+332] = [0XE.3062E34353278P-4, 0X1.921FB54442D19P+0]; atan [0X2.404E44C49C644P-440, 0X7.32EDAB7F60A50P+236] = [0X2.404E44C49C642P-440, 0X1.921FB54442D19P+0]; atan [0X1.63A15E999EB64P-344, 0X6.5263CF84EF388P+172] = [0X1.63A15E999EB63P-344, 0X1.921FB54442D19P+0]; atan [0X6.941F470A70074P-756, 0X1.4171976A1CA54P-288] = [0X6.941F470A70070P-756, 0X1.4171976A1CA54P-288]; atan [0X7.78A1F475A306CP-564, 0X4.69BB1D34B9570P-76] = [0X7.78A1F475A3068P-564, 0X4.69BB1D34B9570P-76]; atan [0X1.BA04D452BBB35P+180, 0X1.F0D19ADCB5D74P+312] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan [0X2.6ABC15579B2B2P-48, 0X2.E046DB554037CP+256] = [0X2.6ABC15579B2B0P-48, 0X1.921FB54442D19P+0]; atan [0X8.297A99ED9ED08P+8, 0XE.33C49CF5B8790P+652] = [0X1.920057E3A66F1P+0, 0X1.921FB54442D19P+0]; atan [0X3.436DFE8F08194P+48, 0X2.A69A969772FDEP+688] = [0X1.921FB54442D13P+0, 0X1.921FB54442D19P+0]; atan [0X6.3E590E626451CP-172, 0X1.7AAA15EBBD3F2P+8] = [0X6.3E590E6264518P-172, 0X1.9172A3136EB8DP+0]; atan [0X6.ACFA418D8F92CP-544, 0X2.8F9204BC4041EP+988] = [0X6.ACFA418D8F928P-544, 0X1.921FB54442D19P+0]; atan [0X2.BB570B356C6CAP-440, 0X2.B00450A48D586P-148] = [0X2.BB570B356C6C8P-440, 0X2.B00450A48D586P-148]; atan [0XC.41329461A0C30P-512, 0X1.9E7DDBBE00F75P+352] = [0XC.41329461A0C28P-512, 0X1.921FB54442D19P+0]; atan [0X6.6978492A3064CP+188, 0XD.5E2045CEE9720P+236] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan [0X7.DEA605DEC97CCP-316, 0X1.5BD629B25AA23P-236] = [0X7.DEA605DEC97C8P-316, 0X1.5BD629B25AA23P-236]; atan [0XD.05E9CCF66CF58P+424, 0XB.A944253373080P+564] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan [0X6.65D7E0A247778P-56, 0X3.AE1DC13A652CAP+168] = [0X6.65D7E0A247774P-56, 0X1.921FB54442D19P+0]; atan [0X5.2B55801231EC8P-344, 0XA.27B4555158148P-68] = [0X5.2B55801231EC4P-344, 0XA.27B4555158148P-68]; atan [0X6.36B661DCE2688P-236, 0X1.D68A6BA7E617FP+12] = [0X6.36B661DCE2684P-236, 0X1.921700D14CFE5P+0]; atan [0X1.EB0E1AB78F314P-480, 0X1.98EF0C6A8BD66P+132] = [0X1.EB0E1AB78F313P-480, 0X1.921FB54442D19P+0]; atan [0X7.4CF193131FA64P-192, 0X1.C08152CC09416P+220] = [0X7.4CF193131FA60P-192, 0X1.921FB54442D19P+0]; atan [0X1.7036C237D5B00P-672, 0X6.F70E0DA4D2BA0P-140] = [0X1.7036C237D5AFFP-672, 0X6.F70E0DA4D2BA0P-140]; atan [0X1.D283CF8F05665P+252, 0XB.24D19E00C8460P+324] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan [0X3.A0EE84451C92CP-324, 0XF.CC937FA330E40P+648] = [0X3.A0EE84451C92AP-324, 0X1.921FB54442D19P+0]; atan [0X1.8BCA641025A83P-124, 0X5.F775993940188P-120] = [0X1.8BCA641025A82P-124, 0X5.F775993940188P-120]; acot [0X1.7A77BFCCF5A9EP-232, 0X2.8457BC029986EP+112] = [0X6.5B5B8AA0A6884P-116, 0X1.921FB54442D19P+0]; acot [0X3.C5EC30FBB68C8P-508, 0X6.05C0BB1BCB730P-220] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acot [0XE.20FF41BD18058P-204, 0X2.9B09919BF9D9EP+272] = [0X6.23FD67FFA09A4P-276, 0X1.921FB54442D19P+0]; acot [0X2.075DF98B2478CP-456, 0X1.1503444763FC5P-416] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acot [0X1.5444E676976F1P+252, 0X2.7C064F6929234P+292] = [0X6.70A3F8408ABF0P-296, 0XC.099B90EB0FA30P-256]; acot [0X1.3A01905E36F84P+0, 0X4.ECBC855871080P+332] = [0X3.3FB79247499D6P-336, 0XA.F1987100D9F08P-4]; acot [0X2.404E44C49C644P-440, 0X7.32EDAB7F60A50P+236] = [0X2.38F904C465F6AP-240, 0X1.921FB54442D19P+0]; acot [0X1.63A15E999EB64P-344, 0X6.5263CF84EF388P+172] = [0X2.87E9C09D98938P-176, 0X1.921FB54442D19P+0]; acot [0X6.941F470A70074P-756, 0X1.4171976A1CA54P-288] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acot [0X7.78A1F475A306CP-564, 0X4.69BB1D34B9570P-76] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acot [0X1.BA04D452BBB35P+180, 0X1.F0D19ADCB5D74P+312] = [0X8.3E949ACCB0F88P-316, 0X9.443E1DD721FE8P-184]; acot [0X2.6ABC15579B2B2P-48, 0X2.E046DB554037CP+256] = [0X5.9028FAA64FBC8P-260, 0X1.921FB54442CF2P+0]; acot [0X8.297A99ED9ED08P+8, 0XE.33C49CF5B8790P+652] = [0X1.2067D7F96AFE5P-656, 0X1.F5D609C62725FP-12]; acot [0X3.436DFE8F08194P+48, 0X2.A69A969772FDEP+688] = [0X6.09322FE56F794P-692, 0X4.E7223FE097808P-52]; acot [0X6.3E590E626451CP-172, 0X1.7AAA15EBBD3F2P+8] = [0XA.D1230D418C238P-12, 0X1.921FB54442D19P+0]; acot [0X6.ACFA418D8F92CP-544, 0X2.8F9204BC4041EP+988] = [0X6.3F7C8D3DDFC74P-992, 0X1.921FB54442D19P+0]; acot [0X2.BB570B356C6CAP-440, 0X2.B00450A48D586P-148] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acot [0XC.41329461A0C30P-512, 0X1.9E7DDBBE00F75P+352] = [0X9.E1C9C04F15630P-356, 0X1.921FB54442D19P+0]; acot [0X6.6978492A3064CP+188, 0XD.5E2045CEE9720P+236] = [0X1.326922CF32B2EP-240, 0X2.7ECD966556E9CP-192]; acot [0X7.DEA605DEC97CCP-316, 0X1.5BD629B25AA23P-236] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acot [0XD.05E9CCF66CF58P+424, 0XB.A944253373080P+564] = [0X1.5F401B7014200P-568, 0X1.3A84A0CB7AC42P-428]; acot [0X6.65D7E0A247778P-56, 0X3.AE1DC13A652CAP+168] = [0X4.59002C447A028P-172, 0X1.921FB54442D18P+0]; acot [0X5.2B55801231EC8P-344, 0XA.27B4555158148P-68] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acot [0X6.36B661DCE2688P-236, 0X1.D68A6BA7E617FP+12] = [0X8.B472F5D335130P-16, 0X1.921FB54442D19P+0]; acot [0X1.EB0E1AB78F314P-480, 0X1.98EF0C6A8BD66P+132] = [0XA.042BAEF7787B8P-136, 0X1.921FB54442D19P+0]; acot [0X7.4CF193131FA64P-192, 0X1.C08152CC09416P+220] = [0X9.21EF65D6A5190P-224, 0X1.921FB54442D19P+0]; acot [0X1.7036C237D5B00P-672, 0X6.F70E0DA4D2BA0P-140] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; acot [0X1.D283CF8F05665P+252, 0XB.24D19E00C8460P+324] = [0X1.6F8ED062CAC9BP-328, 0X8.C7ADFB6368868P-256]; acot [0X3.A0EE84451C92CP-324, 0XF.CC937FA330E40P+648] = [0X1.03413E0E19942P-652, 0X1.921FB54442D19P+0]; acot [0X1.8BCA641025A83P-124, 0X5.F775993940188P-120] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; sinh [-0X3.53DC9496DE0A0P-160, -0XC.287E0E10EC1B8P-960] = [-0X3.53DC9496DE0A2P-160, -0XC.287E0E10EC1B8P-960]; sinh [-0X1.CF3637DCBCC9AP-452, -0X5.E4846462FF33CP-636] = [-0X1.CF3637DCBCC9BP-452, -0X5.E4846462FF33CP-636]; sinh [-0X1.0362421843787P+0, -0X3.3D2CCEF698A5AP-972] = [-0X1.32197576F3697P+0, -0X3.3D2CCEF698A5AP-972]; sinh [-0X1.494A24A7585D1P-380, +0X1.A0790A9E3013EP-604] = [-0X1.494A24A7585D2P-380, +0X1.A0790A9E3013FP-604]; sinh [-0X2.B64BC5E999866P-368, -0XF.0633041110C28P-572] = [-0X2.B64BC5E999868P-368, -0XF.0633041110C28P-572]; sinh [-0X7.56F52F4FED854P-336, -0X4.F40A3934B3354P-416] = [-0X7.56F52F4FED858P-336, -0X4.F40A3934B3354P-416]; sinh [-0XA.0E33C2BA95C88P-48, -0X1.1927CA3847669P-808] = [-0XA.0E33C2BA95C90P-48, -0X1.1927CA3847669P-808]; sinh [-0X1.1BBBD6FE8B950P-208, -0X1.463A32DBA649DP-220] = [-0X1.1BBBD6FE8B951P-208, -0X1.463A32DBA649DP-220]; sinh [0X5.290FE84915530P-268, 0X1.8C9AF520C22C3P-96] = [0X5.290FE84915530P-268, 0X1.8C9AF520C22C4P-96]; sinh [-0X2.E7332C654ABB6P-384, -0X1.4363967367F55P-932] = [-0X2.E7332C654ABB8P-384, -0X1.4363967367F55P-932]; sinh [-0X1.55EBB1D70A46EP-592, +0X4.733FA51468530P-20] = [-0X1.55EBB1D70A46FP-592, +0X4.733FA51477038P-20]; sinh [-0X1.1B4B8388A3D92P-340, -0XD.51D4A3CE4C490P-600] = [-0X1.1B4B8388A3D93P-340, -0XD.51D4A3CE4C490P-600]; sinh [-0X4.21B73745BC4C0P-952, +0XD.E40D83923C3E0P-404] = [-0X4.21B73745BC4C4P-952, +0XD.E40D83923C3E8P-404]; sinh [-0X1.73D14FA7DA1CBP-504, +0X1.5B3AFEEB17A85P-28] = [-0X1.73D14FA7DA1CCP-504, +0X1.5B3AFEEB17A86P-28]; sinh [-0X3.3CD34997DF066P-320, -0X1.606C7BCE75819P-852] = [-0X3.3CD34997DF068P-320, -0X1.606C7BCE75819P-852]; sinh [-0XC.5356A56E59748P-516, -0X1.33B9A95C55513P-772] = [-0XC.5356A56E59750P-516, -0X1.33B9A95C55513P-772]; sinh [-0X5.FA887950A63CCP-588, -0X2.B707741B15478P-800] = [-0X5.FA887950A63D0P-588, -0X2.B707741B15478P-800]; sinh [-0X2.9476464AAE5BAP-548, +0X4.0734E17C026D4P-784] = [-0X2.9476464AAE5BCP-548, +0X4.0734E17C026D8P-784]; sinh [-0XF.A46AC05B0EAA8P-68, +0X1.EFA89F34F4188P-684] = [-0XF.A46AC05B0EAB0P-68, +0X1.EFA89F34F4189P-684]; sinh [-0X9.9488CB205AFA8P-124, -0X2.940180D1AA2AEP-556] = [-0X9.9488CB205AFB0P-124, -0X2.940180D1AA2AEP-556]; sinh [-0X3.F9D9FE5792CE0P-912, -0X3.F00FC8CE24ADCP-1016] = [-0X3.F9D9FE5792CE2P-912, -0X3.F00FC8CE24ADCP-1016]; sinh [-0X7.D5A28EF80D6B0P-176, +0XC.5D2B8FFCB2AD8P-756] = [-0X7.D5A28EF80D6B4P-176, +0XC.5D2B8FFCB2AE0P-756]; sinh [-0X5.B5DCAA821A628P-784, -0X1.48532232C10FDP-940] = [-0X5.B5DCAA821A62CP-784, -0X1.48532232C10FDP-940]; sinh [0X3.8110D13AB0378P-720, 0X2.77422E18981C2P-44] = [0X3.8110D13AB0378P-720, 0X2.77422E18981C4P-44]; sinh [-0X1.4AD562C0B5178P-380, +0X3.CEB34F40EA9BAP-792] = [-0X1.4AD562C0B5179P-380, +0X3.CEB34F40EA9BCP-792]; sinh [-0X7.ED02EF56E40B0P-92, -0X1.8C80275A696B0P-552] = [-0X7.ED02EF56E40B4P-92, -0X1.8C80275A696B0P-552]; sinh [-0X1.56FBE834FC822P-296, -0X3.66041558BACA8P-516] = [-0X1.56FBE834FC823P-296, -0X3.66041558BACA8P-516]; sinh [-0X6.44524F6FCCF8CP-340, -0X5.3E8ED576A1334P-896] = [-0X6.44524F6FCCF90P-340, -0X5.3E8ED576A1334P-896]; sinh [-0X8.92F5BEDA59C78P-268, +0X2.51B11C2EC76BAP-612] = [-0X8.92F5BEDA59C80P-268, +0X2.51B11C2EC76BCP-612]; sinh [-0X4.785C46BDC2A50P-244, -0X1.BA5C062DE8F00P-432] = [-0X4.785C46BDC2A54P-244, -0X1.BA5C062DE8F00P-432]; cosh [-0X3.53DC9496DE0A0P-160, -0XC.287E0E10EC1B8P-960] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X1.CF3637DCBCC9AP-452, -0X5.E4846462FF33CP-636] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X1.0362421843787P+0, -0X3.3D2CCEF698A5AP-972] = [0X1.0000000000000P+0, 0X1.8F0A39674B193P+0]; cosh [-0X1.494A24A7585D1P-380, +0X1.A0790A9E3013EP-604] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X2.B64BC5E999866P-368, -0XF.0633041110C28P-572] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X7.56F52F4FED854P-336, -0X4.F40A3934B3354P-416] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0XA.0E33C2BA95C88P-48, -0X1.1927CA3847669P-808] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X1.1BBBD6FE8B950P-208, -0X1.463A32DBA649DP-220] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [0X5.290FE84915530P-268, 0X1.8C9AF520C22C3P-96] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X2.E7332C654ABB6P-384, -0X1.4363967367F55P-932] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X1.55EBB1D70A46EP-592, +0X4.733FA51468530P-20] = [0X1.0000000000000P+0, 0X1.0000000009E6FP+0]; cosh [-0X1.1B4B8388A3D92P-340, -0XD.51D4A3CE4C490P-600] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X4.21B73745BC4C0P-952, +0XD.E40D83923C3E0P-404] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X1.73D14FA7DA1CBP-504, +0X1.5B3AFEEB17A85P-28] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X3.3CD34997DF066P-320, -0X1.606C7BCE75819P-852] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0XC.5356A56E59748P-516, -0X1.33B9A95C55513P-772] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X5.FA887950A63CCP-588, -0X2.B707741B15478P-800] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X2.9476464AAE5BAP-548, +0X4.0734E17C026D4P-784] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0XF.A46AC05B0EAA8P-68, +0X1.EFA89F34F4188P-684] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X9.9488CB205AFA8P-124, -0X2.940180D1AA2AEP-556] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X3.F9D9FE5792CE0P-912, -0X3.F00FC8CE24ADCP-1016] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X7.D5A28EF80D6B0P-176, +0XC.5D2B8FFCB2AD8P-756] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X5.B5DCAA821A628P-784, -0X1.48532232C10FDP-940] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [0X3.8110D13AB0378P-720, 0X2.77422E18981C2P-44] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X1.4AD562C0B5178P-380, +0X3.CEB34F40EA9BAP-792] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X7.ED02EF56E40B0P-92, -0X1.8C80275A696B0P-552] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X1.56FBE834FC822P-296, -0X3.66041558BACA8P-516] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X6.44524F6FCCF8CP-340, -0X5.3E8ED576A1334P-896] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X8.92F5BEDA59C78P-268, +0X2.51B11C2EC76BAP-612] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; cosh [-0X4.785C46BDC2A50P-244, -0X1.BA5C062DE8F00P-432] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; tanh [0X1.7A77BFCCF5A9EP-232, 0X2.8457BC029986EP+112] = [0X1.7A77BFCCF5A9DP-232, 0X1.0000000000000P+0]; tanh [0X3.C5EC30FBB68C8P-508, 0X6.05C0BB1BCB730P-220] = [0X3.C5EC30FBB68C6P-508, 0X6.05C0BB1BCB730P-220]; tanh [0XE.20FF41BD18058P-204, 0X2.9B09919BF9D9EP+272] = [0XE.20FF41BD18050P-204, 0X1.0000000000000P+0]; tanh [0X2.075DF98B2478CP-456, 0X1.1503444763FC5P-416] = [0X2.075DF98B2478AP-456, 0X1.1503444763FC5P-416]; tanh [0X1.5444E676976F1P+252, 0X2.7C064F6929234P+292] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; tanh [0X1.3A01905E36F84P+0, 0X4.ECBC855871080P+332] = [0XD.772335E624B98P-4, 0X1.0000000000000P+0]; tanh [0X2.404E44C49C644P-440, 0X7.32EDAB7F60A50P+236] = [0X2.404E44C49C642P-440, 0X1.0000000000000P+0]; tanh [0X1.63A15E999EB64P-344, 0X6.5263CF84EF388P+172] = [0X1.63A15E999EB63P-344, 0X1.0000000000000P+0]; tanh [0X6.941F470A70074P-756, 0X1.4171976A1CA54P-288] = [0X6.941F470A70070P-756, 0X1.4171976A1CA54P-288]; tanh [0X7.78A1F475A306CP-564, 0X4.69BB1D34B9570P-76] = [0X7.78A1F475A3068P-564, 0X4.69BB1D34B9570P-76]; tanh [0X1.BA04D452BBB35P+180, 0X1.F0D19ADCB5D74P+312] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; tanh [0X2.6ABC15579B2B2P-48, 0X2.E046DB554037CP+256] = [0X2.6ABC15579B2B0P-48, 0X1.0000000000000P+0]; tanh [0X8.297A99ED9ED08P+8, 0XE.33C49CF5B8790P+652] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; tanh [0X3.436DFE8F08194P+48, 0X2.A69A969772FDEP+688] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; tanh [0X6.3E590E626451CP-172, 0X1.7AAA15EBBD3F2P+8] = [0X6.3E590E6264518P-172, 0X1.0000000000000P+0]; tanh [0X6.ACFA418D8F92CP-544, 0X2.8F9204BC4041EP+988] = [0X6.ACFA418D8F928P-544, 0X1.0000000000000P+0]; tanh [0X2.BB570B356C6CAP-440, 0X2.B00450A48D586P-148] = [0X2.BB570B356C6C8P-440, 0X2.B00450A48D586P-148]; tanh [0XC.41329461A0C30P-512, 0X1.9E7DDBBE00F75P+352] = [0XC.41329461A0C28P-512, 0X1.0000000000000P+0]; tanh [0X6.6978492A3064CP+188, 0XD.5E2045CEE9720P+236] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; tanh [0X7.DEA605DEC97CCP-316, 0X1.5BD629B25AA23P-236] = [0X7.DEA605DEC97C8P-316, 0X1.5BD629B25AA23P-236]; tanh [0XD.05E9CCF66CF58P+424, 0XB.A944253373080P+564] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; tanh [0X6.65D7E0A247778P-56, 0X3.AE1DC13A652CAP+168] = [0X6.65D7E0A247774P-56, 0X1.0000000000000P+0]; tanh [0X5.2B55801231EC8P-344, 0XA.27B4555158148P-68] = [0X5.2B55801231EC4P-344, 0XA.27B4555158148P-68]; tanh [0X6.36B661DCE2688P-236, 0X1.D68A6BA7E617FP+12] = [0X6.36B661DCE2684P-236, 0X1.0000000000000P+0]; tanh [0X1.EB0E1AB78F314P-480, 0X1.98EF0C6A8BD66P+132] = [0X1.EB0E1AB78F313P-480, 0X1.0000000000000P+0]; tanh [0X7.4CF193131FA64P-192, 0X1.C08152CC09416P+220] = [0X7.4CF193131FA60P-192, 0X1.0000000000000P+0]; tanh [0X1.7036C237D5B00P-672, 0X6.F70E0DA4D2BA0P-140] = [0X1.7036C237D5AFFP-672, 0X6.F70E0DA4D2BA0P-140]; tanh [0X1.D283CF8F05665P+252, 0XB.24D19E00C8460P+324] = [0XF.FFFFFFFFFFFF8P-4, 0X1.0000000000000P+0]; tanh [0X3.A0EE84451C92CP-324, 0XF.CC937FA330E40P+648] = [0X3.A0EE84451C92AP-324, 0X1.0000000000000P+0]; tanh [0X1.8BCA641025A83P-124, 0X5.F775993940188P-120] = [0X1.8BCA641025A82P-124, 0X5.F775993940188P-120]; coth [0X5.9D7EEEA9B9EE0P-264, 0X3.F03D06503CAA2P+92] = [0X1.0000000000000P+0, 0X2.D97240157D2C8P+260]; coth [-0X3.F03D06503CAA2P+92, -0X5.9D7EEEA9B9EE0P-264] = [-0X2.D97240157D2C8P+260, -0X1.0000000000000P+0]; coth [0XB.6600F238FE060P-520, 0X1.BB63631B595B0P-224] = [0X9.3CEA8A8C76FC0P+220, 0X1.6758D7D180F69P+516]; coth [-0X1.BB63631B595B0P-224, -0XB.6600F238FE060P-520] = [-0X1.6758D7D180F69P+516, -0X9.3CEA8A8C76FC0P+220]; coth [0X4.DC89ED0034C6CP-240, 0XD.A1D118A3891E8P+232] = [0X1.0000000000000P+0, 0X3.4A8AB6B06359AP+236]; coth [-0XD.A1D118A3891E8P+232, -0X4.DC89ED0034C6CP-240] = [-0X3.4A8AB6B06359AP+236, -0X1.0000000000000P+0]; coth [0X4.7F93F879A61A4P-492, 0X1.BDC6388153882P-452] = [0X9.3041F45FA3D78P+448, 0X3.8E8E46D77A03EP+488]; coth [-0X1.BDC6388153882P-452, -0X4.7F93F879A61A4P-492] = [-0X3.8E8E46D77A03EP+488, -0X9.3041F45FA3D78P+448]; coth [0XF.C7C928D9BB718P+192, 0X8.41A7954605A98P+224] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; coth [-0X8.41A7954605A98P+224, -0XF.C7C928D9BB718P+192] = [-0X1.0000000000001P+0, -0X1.0000000000000P+0]; coth [0X3.F07C0B8005270P-44, 0X2.DD3C8580FCBE0P+276] = [0X1.0000000000000P+0, 0X4.0FC1103283A70P+40]; coth [-0X2.DD3C8580FCBE0P+276, -0X3.F07C0B8005270P-44] = [-0X4.0FC1103283A70P+40, -0X1.0000000000000P+0]; coth [0XA.A97DED29FFF30P-480, 0X5.35EEA9C504860P+196] = [0X1.0000000000000P+0, 0X1.802A4F4EFE3B2P+476]; coth [-0X5.35EEA9C504860P+196, -0XA.A97DED29FFF30P-480] = [-0X1.802A4F4EFE3B2P+476, -0X1.0000000000000P+0]; coth [0X3.CF4B727451402P-376, 0X1.759F6C21DAF9AP+140] = [0X1.0000000000000P+0, 0X4.33233873998C8P+372]; coth [-0X1.759F6C21DAF9AP+140, -0X3.CF4B727451402P-376] = [-0X4.33233873998C8P+372, -0X1.0000000000000P+0]; coth [0X6.55376F4C1C50CP-772, 0X1.0120DD4EBC019P-328] = [0XF.EE06735C6D910P+324, 0X2.86C88F09A2CBEP+768]; coth [-0X1.0120DD4EBC019P-328, -0X6.55376F4C1C50CP-772] = [-0X2.86C88F09A2CBEP+768, -0XF.EE06735C6D910P+324]; coth [0X1.B63F1F7AED49EP-580, 0X2.245AF5BCB3356P-132] = [0X7.7838528478BF8P+128, 0X9.58A984202B8E8P+576]; coth [-0X2.245AF5BCB3356P-132, -0X1.B63F1F7AED49EP-580] = [-0X9.58A984202B8E8P+576, -0X7.7838528478BF8P+128]; coth [0X2.73B23CC8D8F76P+116, 0X1.F1E4F59403FC3P+276] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; coth [-0X1.F1E4F59403FC3P+276, -0X2.73B23CC8D8F76P+116] = [-0X1.0000000000001P+0, -0X1.0000000000000P+0]; coth [0X2.5B4F5F71CA5FCP-100, 0X1.5C244CE1AC6B3P+204] = [0X1.0000000000000P+0, 0X6.CA09D0DDC330CP+96]; coth [-0X1.5C244CE1AC6B3P+204, -0X2.5B4F5F71CA5FCP-100] = [-0X6.CA09D0DDC330CP+96, -0X1.0000000000000P+0]; coth [0X1.4E7212DD5ABB9P+4, 0XD.9F35E61FDF7E8P+592] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; coth [-0XD.9F35E61FDF7E8P+592, -0X1.4E7212DD5ABB9P+4] = [-0X1.0000000000001P+0, -0X1.0000000000000P+0]; coth [0X1.271B33491E515P+20, 0X2.B3031CF3AF4ECP+628] = [0X1.0000000000000P+0, 0X1.0000000000001P+0]; coth [-0X2.B3031CF3AF4ECP+628, -0X1.271B33491E515P+20] = [-0X1.0000000000001P+0, -0X1.0000000000000P+0]; coth [0X9.DB635E2FF52B0P-180, 0X2.AF04176524D06P-24] = [0X5.F646A7779F114P+20, 0X1.9F8AFAA8DBFF9P+176]; coth [-0X2.AF04176524D06P-24, -0X9.DB635E2FF52B0P-180] = [-0X1.9F8AFAA8DBFF9P+176, -0X5.F646A7779F114P+20]; asinh [0X1.7A77BFCCF5A9EP-232, 0X2.8457BC029986EP+112] = [0X1.7A77BFCCF5A9DP-232, 0X4.F3FA9CD060658P+4]; asinh [0X3.C5EC30FBB68C8P-508, 0X6.05C0BB1BCB730P-220] = [0X3.C5EC30FBB68C6P-508, 0X6.05C0BB1BCB730P-220]; asinh [0XE.20FF41BD18058P-204, 0X2.9B09919BF9D9EP+272] = [0XE.20FF41BD18050P-204, 0XB.E2FD554E373E0P+4]; asinh [0X2.075DF98B2478CP-456, 0X1.1503444763FC5P-416] = [0X2.075DF98B2478AP-456, 0X1.1503444763FC5P-416]; asinh [0X1.5444E676976F1P+252, 0X2.7C064F6929234P+292] = [0XA.FA69A93525138P+4, 0XC.C008F1DBA8390P+4]; asinh [0X1.3A01905E36F84P+0, 0X4.ECBC855871080P+332] = [0X1.086AFFAE230B6P+0, 0XE.8698B81E22AB0P+4]; asinh [0X2.404E44C49C644P-440, 0X7.32EDAB7F60A50P+236] = [0X2.404E44C49C642P-440, 0XA.63FF3E7D6B730P+4]; asinh [0X1.63A15E999EB64P-344, 0X6.5263CF84EF388P+172] = [0X1.63A15E999EB63P-344, 0X7.9C22B35B1CEE0P+4]; asinh [0X6.941F470A70074P-756, 0X1.4171976A1CA54P-288] = [0X6.941F470A70070P-756, 0X1.4171976A1CA54P-288]; asinh [0X7.78A1F475A306CP-564, 0X4.69BB1D34B9570P-76] = [0X7.78A1F475A3068P-564, 0X4.69BB1D34B9570P-76]; asinh [0X1.BA04D452BBB35P+180, 0X1.F0D19ADCB5D74P+312] = [0X7.E017D1421AED4P+4, 0XD.99E3CCF428D70P+4]; asinh [0X2.6ABC15579B2B2P-48, 0X2.E046DB554037CP+256] = [0X2.6ABC15579B2B0P-48, 0XB.331FC2BC20E70P+4]; //asinh [0X8.297A99ED9ED08P+8, 0XE.33C49CF5B8790P+652] = [0X8.567B3095B8380P+0, 0X1.C7474C3E00682P+8]; //asinh [0X3.436DFE8F08194P+48, 0X2.A69A969772FDEP+688] = [0X2.325A084AF897EP+4, 0X1.DE8DA2F064858P+8]; asinh [0X6.3E590E626451CP-172, 0X1.7AAA15EBBD3F2P+8] = [0X6.3E590E6264518P-172, 0X6.A13A85E654788P+0]; asinh [0X6.ACFA418D8F92CP-544, 0X2.8F9204BC4041EP+988] = [0X6.ACFA418D8F928P-544, 0X2.AE767FF2330E0P+8]; asinh [0X2.BB570B356C6CAP-440, 0X2.B00450A48D586P-148] = [0X2.BB570B356C6C8P-440, 0X2.B00450A48D586P-148]; asinh [0XC.41329461A0C30P-512, 0X1.9E7DDBBE00F75P+352] = [0XC.41329461A0C28P-512, 0XF.529AF3B8107E0P+4]; asinh [0X6.6978492A3064CP+188, 0XD.5E2045CEE9720P+236] = [0X8.4DCECB852E1E8P+4, 0XA.6DE648AA01A20P+4]; asinh [0X7.DEA605DEC97CCP-316, 0X1.5BD629B25AA23P-236] = [0X7.DEA605DEC97C8P-316, 0X1.5BD629B25AA23P-236]; //asinh [0XD.05E9CCF66CF58P+424, 0XB.A944253373080P+564] = [0X1.29277EA798036P+8, 0X1.8A159CCBD552AP+8]; asinh [0X6.65D7E0A247778P-56, 0X3.AE1DC13A652CAP+168] = [0X6.65D7E0A247774P-56, 0X7.671E008768830P+4]; asinh [0X5.2B55801231EC8P-344, 0XA.27B4555158148P-68] = [0X5.2B55801231EC4P-344, 0XA.27B4555158148P-68]; asinh [0X6.36B661DCE2688P-236, 0X1.D68A6BA7E617FP+12] = [0X6.36B661DCE2684P-236, 0X9.9E9F4F5A56088P+0]; asinh [0X1.EB0E1AB78F314P-480, 0X1.98EF0C6A8BD66P+132] = [0X1.EB0E1AB78F313P-480, 0X5.CA82DEDB3D320P+4]; asinh [0X7.4CF193131FA64P-192, 0X1.C08152CC09416P+220] = [0X7.4CF193131FA60P-192, 0X9.9BF0B87669850P+4]; asinh [0X1.7036C237D5B00P-672, 0X6.F70E0DA4D2BA0P-140] = [0X1.7036C237D5AFFP-672, 0X6.F70E0DA4D2BA0P-140]; asinh [0X1.D283CF8F05665P+252, 0XB.24D19E00C8460P+324] = [0XA.FF762A8B30EA0P+4, 0XE.3AF0836B2F5B0P+4]; //asinh [0X3.A0EE84451C92CP-324, 0XF.CC937FA330E40P+648] = [0X3.A0EE84451C92AP-324, 0X1.C49CCB25BBD50P+8]; asinh [0X1.8BCA641025A83P-124, 0X5.F775993940188P-120] = [0X1.8BCA641025A82P-124, 0X5.F775993940188P-120]; acosh [0X5.AD89AD14DDC74P+272, 0X2.6EC5D31670A5EP+860] = [0XB.EF73BF42C19D8P+4, 0X2.55B05064B6C2AP+8]; acosh [0X4.A457C35864940P+344, 0X2.3ADEFB54BC048P+444] = [0XF.0ABC113DB1AF0P+4, 0X1.3540A29BC6B5EP+8]; acosh [0X6.941C8B9506D90P+56, 0X3.B11D8083AE958P+744] = [0X2.964A9197BF832P+4, 0X2.05B3663FAE652P+8]; acosh [0X1.09A940A083EE3P+132, 0X1.047FD514ADF08P+384] = [0X5.C39C22D7AA908P+4, 0X1.0AE10BDF7FE81P+8]; acosh [0X7.710740B71A0D4P+256, 0XF.C0798D156BFA0P+560] = [0XB.42559B5CF34E8P+4, 0X1.879CCE87EE3A1P+8]; acosh [0X2.3721A01F70456P+564, 0X9.C62BBF31FD290P+728] = [0X1.886C6F1DDDFF7P+8, 0X1.FB958311209BFP+8]; acosh [0X6.F06D452BDCEF0P+44, 0X2.4825931366BBCP+520] = [0X2.120F95BD1F706P+4, 0X1.69F464545899AP+8]; acosh [0X5.D326D4B0883D8P+76, 0X1.77175C5A113ADP+528] = [0X3.7226BF0157930P+4, 0X1.6F0E8DBF98710P+8]; acosh [0X1.05ADFE119D4C2P+296, 0X2.6BCDF50E05E34P+1020] = [0XC.DE2FBE78FEC28P+4, 0X2.C49666459E1A4P+8]; acosh [0XA.7F5D255B81268P+408, 0X1.9D1EDDC132B36P+864] = [0X1.1DD92C82827A1P+8, 0X2.580D06072BF20P+8]; acosh [0XC.FBE4E2C6D0A80P+484, 0X4.DF75BDC17C330P+868] = [0X1.52BD770642386P+8, 0X2.5BEDB7E376E18P+8]; acosh [0XB.241032F9700A0P+380, 0X1.04A65B06B2920P+640] = [0X1.0A7FEC190CCEEP+8, 0X1.BC5349B021815P+8]; acosh [0X5.F207EAF5F8BB4P+608, 0XA.BC87C6F90AEE0P+648] = [0X1.A7E8C5069EA32P+8, 0X1.C439E5E8A511CP+8]; acosh [0X1.BCD62C46ADFD7P+16, 0XA.CD289B35ECD00P+564] = [0XC.56062C0C41518P+0, 0X1.8A0201556D85AP+8]; acosh [0X6.534BBA40A0B44P+224, 0X1.8DE35856E91FBP+452] = [0X9.DCD7CC0C7FFB8P+4, 0X1.3A6FC95911674P+8]; acosh [0X2.C4F59012F4E48P+508, 0X1.1854765A9A205P+688] = [0X1.61D49DF92AB79P+8, 0X1.DDAB5081E5A0EP+8]; acosh [0X8.6F890522C18B0P+44, 0X3.F87592D71E06CP+220] = [0X2.152F7D2DBF2BCP+4, 0X9.A907E7C701690P+4]; acosh [0X9.2A9035A578970P+124, 0X1.35EE42DCA8B75P+608] = [0X5.8DBE2A7E96990P+4, 0X1.A6515B9ECF2F1P+8]; acosh [0X5.2641115F86D38P+204, 0X7.BE33D080E6584P+252] = [0X8.FBBEB3B84C708P+4, 0XB.169BBE1313F68P+4]; acosh [0XA.8746F72A1BD90P+72, 0X5.6ABE29A315520P+872] = [0X3.4F42DBFC0E4B4P+4, 0X2.5ECE9922C7894P+8]; acosh [0XB.D0973FF704000P+224, 0X2.2FD9ABBD09D34P+976] = [0X9.E6D6EA0633070P+4, 0X2.A5FCBEDD15F2CP+8]; acosh [0XA.C15D51DB7D9F0P+536, 0X1.7207A70831D7AP+796] = [0X1.76986E964982DP+8, 0X2.28CE847F69DCAP+8]; acosh [0X4.280BEC7911E7CP+180, 0X6.B4F11E86ECA38P+792] = [0X7.EE261446DD5F8P+4, 0X2.27919F48F2C20P+8]; acosh [0X3.4B22674960B0EP+468, 0XA.505A061DF4CD8P+808] = [0X1.4647297977E4EP+8, 0X2.3316ED57009D4P+8]; acosh [0X2.383FC27D5E4E4P+756, 0X5.88E9C96565E54P+920] = [0X2.0D82822002358P+8, 0X2.801980299550CP+8]; acosh [0X1.20E762C8AAB55P+72, 0X1.DBB7B8FE35847P+960] = [0X3.2B87D37C9EAFAP+4, 0X2.9ABBED2A77E62P+8]; acosh [0X1.1265074E9E3DFP+792, 0X2.229B285A709C0P+920] = [0X2.25BC2FC876EBCP+8, 0X2.7F25A89FE16E6P+8]; acosh [0X1.054DCDEF21349P+436, 0X1.618994D07D9A7P+636] = [0X1.2EED02D819A15P+8, 0X1.B9DB8970CC5ECP+8]; acosh [0X4.5BE0D9A7FF0CCP+460, 0X2.6F2C55F16354AP+568] = [0X1.4103588C86AB6P+8, 0X1.8B4A572E180D4P+8]; acosh [0X9.BD8B9A7FB6630P+80, 0X2.AD5F8458C8722P+768] = [0X3.A6BD416FCCF70P+4, 0X2.1603D4EDCB36AP+8]; atanh [-0X3.11A309475E762P-164, -0XC.3784302E15500P-680] = [-0X3.11A309475E764P-164, -0XC.3784302E15500P-680]; atanh [-0X5.7DD17A4248D38P-280, -0X2.898FC0F386F74P-640] = [-0X5.7DD17A4248D3CP-280, -0X2.898FC0F386F74P-640]; atanh [-0XE.D83DCD7F564A0P-296, -0X1.62F61FBA0F40FP-764] = [-0XE.D83DCD7F564A8P-296, -0X1.62F61FBA0F40FP-764]; atanh [-0X1.67712A1E64C2CP-944, -0X1.C0102C4D258EFP-976] = [-0X1.67712A1E64C2DP-944, -0X1.C0102C4D258EFP-976]; atanh [0X2.E3D991AE84668P-728, 0X1.92C3C728CCF4AP-612] = [0X2.E3D991AE84668P-728, 0X1.92C3C728CCF4BP-612]; atanh [-0X1.BCD3FEB3B0175P-640, +0X1.BEBE69E3BF3C2P-536] = [-0X1.BCD3FEB3B0176P-640, +0X1.BEBE69E3BF3C3P-536]; atanh [-0X1.2469575189327P-372, -0X7.51C0C39F58A4CP-1008] = [-0X1.2469575189328P-372, -0X7.51C0C39F58A4CP-1008]; atanh [-0X1.C4D163A6CCCD9P-336, -0X1.3BEE6DAB70397P-796] = [-0X1.C4D163A6CCCDAP-336, -0X1.3BEE6DAB70397P-796]; atanh [-0X2.0FAE5DE90C98CP-896, -0X2.2079777EC2418P-976] = [-0X2.0FAE5DE90C98EP-896, -0X2.2079777EC2418P-976]; atanh [-0X1.08C248C37E53BP-816, +0X2.8C9F04EE5DE84P-948] = [-0X1.08C248C37E53CP-816, +0X2.8C9F04EE5DE86P-948]; atanh [-0X2.0002542B01474P-228, +0X2.4D59F217BF74CP-796] = [-0X2.0002542B01476P-228, +0X2.4D59F217BF74EP-796]; atanh [0XD.D4033889729A0P-844, 0X7.44451BF919D78P-556] = [0XD.D4033889729A0P-844, 0X7.44451BF919D7CP-556]; atanh [-0X2.08918B016995CP-64, +0X3.3FC26450C6E4AP-268] = [-0X2.08918B016995EP-64, +0X3.3FC26450C6E4CP-268]; atanh [-0X2.66C95BD8D7716P-388, +0X1.7E16B310F878AP-232] = [-0X2.66C95BD8D7718P-388, +0X1.7E16B310F878BP-232]; atanh [-0X3.D9C66BD30B774P-256, -0X4.A8C30F678CB68P-456] = [-0X3.D9C66BD30B776P-256, -0X4.A8C30F678CB68P-456]; atanh [-0X1.AA045CCB15AEDP-804, +0XD.450C473265610P-24] = [-0X1.AA045CCB15AEEP-804, +0XD.450C4732686C0P-24]; atanh [-0X2.23ADFA571FC3CP-344, -0X1.30D1074DC059EP-868] = [-0X2.23ADFA571FC3EP-344, -0X1.30D1074DC059EP-868]; atanh [-0X3.DFBC1A4BF3888P-68, -0X4.A89E39B247C84P-840] = [-0X3.DFBC1A4BF388AP-68, -0X4.A89E39B247C84P-840]; atanh [0X9.583064525D370P-496, 0X2.C67652F06A55EP-408] = [0X9.583064525D370P-496, 0X2.C67652F06A560P-408]; atanh [-0X3.38BF880EC3082P-304, -0X7.7B19877E536ACP-512] = [-0X3.38BF880EC3084P-304, -0X7.7B19877E536ACP-512]; atanh [-0X2.ADBF037238702P-44, +0X1.98DC940C3AE1EP-564] = [-0X2.ADBF037238704P-44, +0X1.98DC940C3AE1FP-564]; atanh [-0X4.E4A79C48B3A58P-328, +0XA.28B02E59D39D8P-856] = [-0X4.E4A79C48B3A5CP-328, +0XA.28B02E59D39E0P-856]; atanh [-0X6.80D3E87B911D8P-232, -0X2.3DF54212C46E4P-520] = [-0X6.80D3E87B911DCP-232, -0X2.3DF54212C46E4P-520]; atanh [-0X1.4E54C309C46F8P-480, +0X9.47E982AC83F98P-688] = [-0X1.4E54C309C46F9P-480, +0X9.47E982AC83FA0P-688]; atanh [-0X2.276202227A6DEP-808, +0X1.C53E9BA64FADFP-768] = [-0X2.276202227A6E0P-808, +0X1.C53E9BA64FAE0P-768]; atanh [-0X4.8E4B4D7BA6DD0P-212, -0X1.4B35284C1064BP-548] = [-0X4.8E4B4D7BA6DD4P-212, -0X1.4B35284C1064BP-548]; atanh [-0X3.5C52B8D9FF582P-248, -0X2.AF868D652B866P-912] = [-0X3.5C52B8D9FF584P-248, -0X2.AF868D652B866P-912]; atanh [0X1.6938CC5EE183AP-692, 0XB.F7A583AC38168P-664] = [0X1.6938CC5EE183AP-692, 0XB.F7A583AC38170P-664]; atanh [-0X3.68B35F23B2506P-560, +0X9.F9C9246D05138P-304] = [-0X3.68B35F23B2508P-560, +0X9.F9C9246D05140P-304]; atanh [-0XA.BDE70B6850EA0P-516, +0X2.BB76D5BF703FAP-1020] = [-0XA.BDE70B6850EA8P-516, +0X2.BB76D5BF703FCP-1020]; acoth [0X5.AD89AD14DDC78P+272, 0X2.6EC5D31670A60P+860] = [0X6.93B8C1A4ADA4CP-864, 0X2.D165505974CDCP-276]; acoth [-0X2.6EC5D31670A60P+860, -0X5.AD89AD14DDC78P+272] = [-0X2.D165505974CDCP-276, -0X6.93B8C1A4ADA4CP-864]; acoth [0X4.A457C35864944P+344, 0X2.3ADEFB54BC04AP+444] = [0X7.2CCCD8F3E4D84P-448, 0X3.726295CD6E028P-348]; acoth [-0X2.3ADEFB54BC04AP+444, -0X4.A457C35864944P+344] = [-0X3.726295CD6E028P-348, -0X7.2CCCD8F3E4D84P-448]; acoth [0X6.941C8B9506D98P+56, 0X3.B11D8083AE95CP+744] = [0X4.55780C09BB248P-748, 0X2.6EA0EC606D92CP-60]; acoth [-0X3.B11D8083AE95CP+744, -0X6.941C8B9506D98P+56] = [-0X2.6EA0EC606D92CP-60, -0X4.55780C09BB248P-748]; acoth [0X1.09A940A083EE4P+132, 0X1.047FD514ADF09P+384] = [0XF.B940FE60125C0P-388, 0XF.6B0B0DCA2D740P-136]; acoth [-0X1.047FD514ADF09P+384, -0X1.09A940A083EE4P+132] = [-0XF.6B0B0DCA2D740P-136, -0XF.B940FE60125C0P-388]; acoth [0X7.710740B71A0DCP+256, 0XF.C0798D156BFB0P+560] = [0X1.04086A3447A55P-564, 0X2.266CE7A905524P-260]; acoth [-0XF.C0798D156BFB0P+560, -0X7.710740B71A0DCP+256] = [-0X2.266CE7A905524P-260, -0X1.04086A3447A55P-564]; acoth [0X2.3721A01F70458P+564, 0X9.C62BBF31FD298P+728] = [0X1.A3110641EF7BCP-732, 0X7.38E97DB7ABD94P-568]; acoth [-0X9.C62BBF31FD298P+728, -0X2.3721A01F70458P+564] = [-0X7.38E97DB7ABD94P-568, -0X1.A3110641EF7BCP-732]; acoth [0X6.F06D452BDCEF8P+44, 0X2.4825931366BBEP+520] = [0X7.030E427A5F700P-524, 0X2.4E45C5E18EA0EP-48]; acoth [-0X2.4825931366BBEP+520, -0X6.F06D452BDCEF8P+44] = [-0X2.4E45C5E18EA0EP-48, -0X7.030E427A5F700P-524]; acoth [0X5.D326D4B0883DCP+76, 0X1.77175C5A113AEP+528] = [0XA.EB85BC1375C18P-532, 0X2.BF32E14DB1D26P-80]; acoth [-0X1.77175C5A113AEP+528, -0X5.D326D4B0883DCP+76] = [-0X2.BF32E14DB1D26P-80, -0XA.EB85BC1375C18P-532]; acoth [0X1.05ADFE119D4C3P+296, 0X2.6BCDF50E05E36P+1020] = [0X6.9BC8F6BE69A84P-1024, 0XF.A7190DED61120P-300]; acoth [-0X2.6BCDF50E05E36P+1020, -0X1.05ADFE119D4C3P+296] = [-0XF.A7190DED61120P-300, -0X6.9BC8F6BE69A84P-1024]; acoth [0XA.7F5D255B81270P+408, 0X1.9D1EDDC132B38P+864] = [0X9.EA2F16D4B51A8P-868, 0X1.8630054C790C6P-412]; acoth [-0X1.9D1EDDC132B38P+864, -0XA.7F5D255B81270P+408] = [-0X1.8630054C790C6P-412, -0X9.EA2F16D4B51A8P-868]; acoth [0XC.FBE4E2C6D0A90P+484, 0X4.DF75BDC17C334P+868] = [0X3.4891A2770DF7CP-872, 0X1.3B7754395DD7FP-488]; acoth [-0X4.DF75BDC17C334P+868, -0XC.FBE4E2C6D0A90P+484] = [-0X1.3B7754395DD7FP-488, -0X3.4891A2770DF7CP-872]; acoth [0XB.241032F9700A8P+380, 0X1.04A65B06B2921P+640] = [0XF.B6EE12E44E478P-644, 0X1.6FA7BD9AAC5D2P-384]; acoth [-0X1.04A65B06B2921P+640, -0XB.241032F9700A8P+380] = [-0X1.6FA7BD9AAC5D2P-384, -0XF.B6EE12E44E478P-644]; acoth [0X5.F207EAF5F8BB8P+608, 0XA.BC87C6F90AEE8P+648] = [0X1.7D8116060016CP-652, 0X2.B0EE9FA61C0DAP-612]; acoth [-0XA.BC87C6F90AEE8P+648, -0X5.F207EAF5F8BB8P+608] = [-0X2.B0EE9FA61C0DAP-612, -0X1.7D8116060016CP-652]; acoth [0X1.BCD62C46ADFD9P+16, 0XA.CD289B35ECD08P+564] = [0X1.7B35C74EEC020P-568, 0X9.35374E76B1BE8P-20]; acoth [-0XA.CD289B35ECD08P+564, -0X1.BCD62C46ADFD9P+16] = [-0X9.35374E76B1BE8P-20, -0X1.7B35C74EEC020P-568]; acoth [0X6.534BBA40A0B4CP+224, 0X1.8DE35856E91FDP+452] = [0XA.4B5AAEDFCE6A8P-456, 0X2.878CF52E5FBF8P-228]; acoth [-0X1.8DE35856E91FDP+452, -0X6.534BBA40A0B4CP+224] = [-0X2.878CF52E5FBF8P-228, -0XA.4B5AAEDFCE6A8P-456]; expm1 [-0X1.16CC0DF1540F5P+112, -0X1.B3E4076622F04P-232] = [-0X1.0000000000000P+0, -0X1.B3E4076622F03P-232]; expm1 [-0X2.42042B9A88438P-220, -0X2.A213429DB0508P-508] = [-0X2.42042B9A88438P-220, -0X2.A213429DB0506P-508]; expm1 [-0X2.0E2E40B15D814P+272, -0X1.5D74CFDA6B292P-200] = [-0X1.0000000000000P+0, -0X1.5D74CFDA6B291P-200]; expm1 [-0X2.0EA791886F712P-416, -0X3.FE66A8D1A3472P-456] = [-0X2.0EA791886F712P-416, -0X3.FE66A8D1A3470P-456]; //expm1 [-0X6.FF424CB26239CP+292, -0X2.89F6682121BA8P+252] = [-0X1.0000000000000P+0, -0X1.0000000000000P+0]; expm1 [-0X8.80EEFDF700148P+332, -0X1.C4E85E50A626DP+0] = [-0X1.0000000000000P+0, -0XD.45BCBA84EE268P-4]; expm1 [-0X6.CA83546563A5CP+236, -0X4.F0F28370909FCP-440] = [-0X1.0000000000000P+0, -0X4.F0F28370909F8P-440]; expm1 [-0X4.E60572D4FCFD0P+172, -0X1.EB095183538C8P-344] = [-0X1.0000000000000P+0, -0X1.EB095183538C7P-344]; expm1 [-0X2.7ED8954764B12P-288, -0X8.71DC22117BE90P-756] = [-0X2.7ED8954764B12P-288, -0X8.71DC22117BE88P-756]; expm1 [-0XD.CF39B8DD68B98P-76, -0X8.0205C5B1357B0P-564] = [-0XD.CF39B8DD68B98P-76, -0X8.0205C5B1357A8P-564]; //expm1 [-0X1.582D3AFB2C63DP+312, -0X5.08DC843E57ED4P+180] = [-0X1.0000000000000P+0, -0X1.0000000000000P+0]; expm1 [-0X4.AF296DD37FD74P+256, -0X5.CBE2BD423B02CP-48] = [-0X1.0000000000000P+0, -0X5.CBE2BD423AF1CP-48]; expm1 [-0X1.1FBA2D1252D2BP+656, -0X2.4B7A4095C91B4P+8] = [-0X1.0000000000000P+0, -0XF.FFFFFFFFFFFF8P-4]; //expm1 [-0X3.2FD3FDE325402P+688, -0X2.738623C238270P+48] = [-0X1.0000000000000P+0, -0X1.0000000000000P+0]; expm1 [-0X1.44F2134E1901EP+8, -0X2.581DAD9AFE6DCP-172] = [-0X1.0000000000000P+0, -0X2.581DAD9AFE6DAP-172]; expm1 [-0X2.9529E333F2ABAP+988, -0X7.19390F862F49CP-544] = [-0X1.0000000000000P+0, -0X7.19390F862F498P-544]; expm1 [-0X1.58391FD92C387P-148, -0X4.0C12426A57194P-440] = [-0X1.58391FD92C387P-148, -0X4.0C12426A57190P-440]; expm1 [-0XB.FADC4FB83E140P+348, -0XF.13E388B2165F0P-512] = [-0X1.0000000000000P+0, -0XF.13E388B2165E8P-512]; //expm1 [-0XD.F2552B8F60978P+236, -0X7.FBDBC320979A4P+188] = [-0X1.0000000000000P+0, -0X1.0000000000000P+0]; expm1 [-0X8.86826CE1AB700P-240, -0X4.FEA8D3A3ED018P-316] = [-0X8.86826CE1AB700P-240, -0X4.FEA8D3A3ED014P-316]; expm1 [0X1.0000000000000P+0, 0X2.0000000000000P+0] = [0X1.B7E151628AED2P+0, 0X6.63992E35376B8P+0]; expm1 [-0X1.0000000000000P+0, +0X2.0000000000000P+0] = [-0XA.1D2A7274C4328P-4, +0X6.63992E35376B8P+0]; expm1 [-0X5.0000000000000P+0, -0X3.0000000000000P+0] = [-0XF.E466C01FF2AD0P-4, -0XF.341279998A7A8P-4]; expm1 [-0X2.0000000000000P+0, +0X9.9999999999998P-4] = [-0XD.D5AAAB880FC70P-4, +0XD.27660B11A9EF8P-4]; expm1 [0X4.0000000000000P-1076, 0X4.4444400000000P-1056] = [0X4.0000000000000P-1076, 0X4.4444800000000P-1056]; expm1 [0X4.4440000000000P-1064, 0X1.0000000000000P+0] = [0X4.4440000000000P-1064, 0X1.B7E151628AED3P+0]; expm1 [-0X4.4444000000000P-1060, +0X4.4444000000000P-1060] = [-0X4.4444000000000P-1060, +0X4.4448000000000P-1060]; expm1 [-0X4.4400000000000P-1068, +0X1.FFF0000000000P+0] = [-0X4.4400000000000P-1068, +0X6.6322F8540CFB4P+0]; expm1 [-0X1.FFFF000000000P+0, -0X8.8888880000000P-1052] = [-0XD.D5A88131A6240P-4, -0X8.8888840000000P-1052]; expm1 [-0X1.FFFFFFF000000P+0, +0X8.CD11555400000P-1044] = [-0XD.D5AAAB656A718P-4, +0X8.CD11555800000P-1044]; logp1 [0XC.4B4A6EB6B3AF0P-264, 0XA.DD2C4C1BE4B30P+92] = [0XC.4B4A6EB6B3AE8P-264, 0X4.227AD8183FB70P+4]; logp1 [0X2.6213E21B14894P-516, 0X6.6606F0995E5F4P-224] = [0X2.6213E21B14892P-516, 0X6.6606F0995E5F4P-224]; logp1 [0X9.0FF2CAA1B3048P-240, 0X1.95F14B9BA7449P+236] = [0X9.0FF2CAA1B3040P-240, 0XA.40B346F454218P+4]; logp1 [0X8.E2ADA8DFBE938P-492, 0X3.67CB3BE0BB146P-452] = [0X8.E2ADA8DFBE930P-492, 0X3.67CB3BE0BB146P-452]; logp1 [0X1.394270BBCBA7EP+196, 0X8.4976F0BF45A40P+224] = [0X8.80F0717A1DC40P+4, 0X9.D6130F01F8B78P+4]; logp1 [0X6.A000A12839A50P-44, 0X3.86DC59439415AP+276] = [0X6.A000A1283845CP-44, 0XC.091AAD1207058P+4]; logp1 [0X1.3C84E4F9C80CEP-476, 0X9.1E9439C3B4358P+196] = [0X1.3C84E4F9C80CDP-476, 0X8.A1137BDE55CF8P+4]; logp1 [0X8.41D2DB6D93548P-376, 0X2.EDCF4A7919034P+140] = [0X8.41D2DB6D93540P-376, 0X6.21D80D9193AB8P+4]; logp1 [0X1.2C18FEEBCAEAEP-768, 0X1.C369E759DF5E3P-328] = [0X1.2C18FEEBCAEADP-768, 0X1.C369E759DF5E3P-328]; logp1 [0X4.D94E91619D3F0P-580, 0X2.9F6CAF6B5513EP-132] = [0X4.D94E91619D3ECP-580, 0X2.9F6CAF6B5513EP-132]; logp1 [0X2.9CD12C1D0AAC4P+116, 0X3.BF7E0E52DC1AAP+276] = [0X5.15D8B410E0A5CP+4, 0XC.0A13DC536CD58P+4]; logp1 [0X3.36DE5C55594EEP-100, 0X1.D0460177B1553P+204] = [0X3.36DE5C55594ECP-100, 0X8.DFF506FE0D9F8P+4]; logp1 [0X4.BD4031736F7A8P+4, 0XF.A10BB3C91C7B0P+592] = [0X4.5771391F308D8P+0, 0X1.9D179EA5204D0P+8]; logp1 [0X2.8E258DB3C44F8P+20, 0X3.1A4EDE719A4C0P+628] = [0XE.CD14C501247C0P+0, 0X1.B46DC0D02B874P+8]; logp1 [0X2.33950F38F830EP-176, 0X5.BE0388619B018P-24] = [0X2.33950F38F830CP-176, 0X5.BE0377E504F78P-24]; logp1 [0X3.24F03DF33568CP-560, 0XE.67255823421E8P+920] = [0X3.24F03DF33568AP-560, 0X2.805CE2DC91036P+8]; logp1 [0X2.D572639DC5FA8P-468, 0X1.95CF42AA171CDP-160] = [0X2.D572639DC5FA6P-468, 0X1.95CF42AA171CDP-160]; logp1 [0X4.705A028302DB0P-532, 0X2.E57341C14970CP+324] = [0X4.705A028302DACP-532, 0XE.1A4A3523F2658P+4]; logp1 [0X4.DBA1D21D6F308P+144, 0X3.667988C57865AP+196] = [0X6.564D09AD1D214P+4, 0X8.914A9531FD118P+4]; logp1 [0X4.9FA5A1E4DF740P-328, 0X1.11B85141B78F6P-240] = [0X4.9FA5A1E4DF73CP-328, 0X1.11B85141B78F6P-240]; logp1 [0XA.0CDE9DC015B08P+360, 0XF.99D84F862AC58P+524] = [0XF.BD7308ED73FF0P+4, 0X1.6DF4DA39DC5DDP+8]; logp1 [0X6.88441038D56B8P-108, 0X3.3D65C09938132P+136] = [0X6.88441038D56B4P-108, 0X5.F718BBF0CE2F8P+4]; logp1 [0X7.1761CAB055134P-356, 0X1.92EFD09488689P-76] = [0X7.1761CAB055130P-356, 0X1.92EFD09488689P-76]; logp1 [0X6.2085E427413C8P-252, 0XB.8CDD3B024EA10P-36] = [0X6.2085E427413C4P-252, 0XB.8CDD3AFE235D0P-36]; logp1 [0XB.F5F1C0FA33978P-504, 0X4.924DD8D50B1CCP+72] = [0XB.F5F1C0FA33970P-504, 0X3.36D2B121508A8P+4]; logp1 [0XB.BC7E37EB2D388P-216, 0X1.CFE27BB53DEBBP+192] = [0XB.BC7E37EB2D380P-216, 0X8.5ADC069F618A8P+4]; logp1 [0X1.E139DD116F868P-688, 0XD.2545346D68FD0P-148] = [0X1.E139DD116F867P-688, 0XD.2545346D68FD0P-148]; logp1 [0X2.E0C8E64A890ACP+192, 0X2.6A898D2CAA9A4P+260] = [0X8.6243148F46208P+4, 0XB.519B6E544F898P+4]; logp1 [0X5.9C4642ED78BC8P-340, 0X4.631BD2232F0C0P+588] = [0X5.9C4642ED78BC4P-340, 0X1.990C99B6124FEP+8]; logp1 [0XF.C05EA810DFE88P-180, 0XA.05884FBED5F48P-152] = [0XF.C05EA810DFE80P-180, 0XA.05884FBED5F48P-152]; sqrt [0XC.4B4A6EB6B3AF0P-264, 0XA.DD2C4C1BE4B30P+92] = [0X3.819C8C44FCAE8P-132, 0XD.2F2830FA93228P+44]; sqrt [0X2.6213E21B14894P-516, 0X6.6606F0995E5F4P-224] = [0X6.2CC8B5D1B7648P-260, 0X2.878F8E10E2752P-112]; sqrt [0X9.0FF2CAA1B3048P-240, 0X1.95F14B9BA7449P+236] = [0X3.02A74AB0BBF36P-120, 0X5.0979194446A10P+116]; sqrt [0X8.E2ADA8DFBE938P-492, 0X3.67CB3BE0BB146P-452] = [0XB.EC63BFE10BCC8P-248, 0X7.61AC89CF17804P-228]; sqrt [0X1.394270BBCBA7EP+196, 0X8.4976F0BF45A40P+224] = [0X4.6CBEB2D8F6718P+96, 0X2.E0F32319AC30AP+112]; sqrt [0X6.A000A12839A50P-44, 0X3.86DC59439415AP+276] = [0XA.4BAEE7F482900P-24, 0X7.830C8D5A5F3D8P+136]; sqrt [0X1.3C84E4F9C80CEP-476, 0X9.1E9439C3B4358P+196] = [0X4.729F7C344CE30P-240, 0XC.14519D6697FF0P+96]; sqrt [0X8.41D2DB6D93548P-376, 0X2.EDCF4A7919034P+140] = [0X2.DF9F14A64C77AP-188, 0X6.D87D667089BD8P+68]; sqrt [0X1.2C18FEEBCAEAEP-768, 0X1.C369E759DF5E3P-328] = [0X1.152C585EDDB6AP-384, 0X1.53F1A81CAA4A0P-164]; sqrt [0X4.D94E91619D3F0P-580, 0X2.9F6CAF6B5513EP-132] = [0X8.CEDC2135E05E8P-292, 0X6.7A5BEF2579C34P-68]; sqrt [0X2.9CD12C1D0AAC4P+116, 0X3.BF7E0E52DC1AAP+276] = [0X6.7722C88D985D8P+56, 0X7.BE7173245A668P+136]; sqrt [0X3.36DE5C55594EEP-100, 0X1.D0460177B1553P+204] = [0X7.2BE248A308D24P-52, 0X5.630224B50BCF8P+100]; sqrt [0X4.BD4031736F7A8P+4, 0XF.A10BB3C91C7B0P+592] = [0X8.B53B61217B4F8P+0, 0X3.F40FA54A699E2P+296]; sqrt [0X2.8E258DB3C44F8P+20, 0X3.1A4EDE719A4C0P+628] = [0X6.64E1F64817930P+8, 0X7.0BBE006E8934CP+312]; sqrt [0X2.33950F38F830EP-176, 0X5.BE0388619B018P-24] = [0X1.7BD69462CDAD2P-88, 0X2.6573BFB248EF0P-12]; sqrt [0X3.24F03DF33568CP-560, 0XE.67255823421E8P+920] = [0X1.C5F168118C2B1P-280, 0X3.CB8CCAD62ED10P+460]; sqrt [0X2.D572639DC5FA8P-468, 0X1.95CF42AA171CDP-160] = [0X6.BBC8A036CC930P-236, 0X1.4250C275A7B2BP-80]; sqrt [0X4.705A028302DB0P-532, 0X2.E57341C14970CP+324] = [0X8.6D6D9A3EA2160P-268, 0X6.CEB17F56F1B50P+160]; sqrt [0X4.DBA1D21D6F308P+144, 0X3.667988C57865AP+196] = [0X2.343E215EB2264P+72, 0X7.603E67F0E1DD0P+96]; sqrt [0X4.9FA5A1E4DF740P-328, 0X1.11B85141B78F6P-240] = [0X2.26777C4E368BEP-164, 0X1.08B63617A4210P-120]; sqrt [0XA.0CDE9DC015B08P+360, 0XF.99D84F862AC58P+524] = [0X3.2B934CDCC29E0P+180, 0XF.CC99981010AD0P+260]; sqrt [0X6.88441038D56B8P-108, 0X3.3D65C09938132P+136] = [0XA.392C9B2283838P-56, 0X1.CCC9C68E6B873P+68]; sqrt [0X7.1761CAB055134P-356, 0X1.92EFD09488689P-76] = [0XA.A6DE001E1A878P-180, 0X5.04B0B42B185F4P-40]; sqrt [0X6.2085E427413C8P-252, 0XB.8CDD3B024EA10P-36] = [0X9.E6B17DD90B818P-128, 0XD.9821AE0A3F288P-20]; sqrt [0XB.F5F1C0FA33978P-504, 0X4.924DD8D50B1CCP+72] = [0X3.755B7F9B147FCP-252, 0X2.235AF64AA2532P+36]; sqrt [0XB.BC7E37EB2D388P-216, 0X1.CFE27BB53DEBBP+192] = [0X3.6D0318CB65970P-108, 0X1.589B93C7CC280P+96]; sqrt [0X1.E139DD116F868P-688, 0XD.2545346D68FD0P-148] = [0X1.5EFD65C23F515P-344, 0XE.80B36809CA340P-76]; sqrt [0X2.E0C8E64A890ACP+192, 0X2.6A898D2CAA9A4P+260] = [0X1.B24CEBB3D4B84P+96, 0X6.37B4CD9068634P+128]; sqrt [0X5.9C4642ED78BC8P-340, 0X4.631BD2232F0C0P+588] = [0X9.797C4D6802170P-172, 0X8.60D1F01F1A8D8P+292]; sqrt [0XF.C05EA810DFE88P-180, 0XA.05884FBED5F48P-152] = [0XF.E00F72E6C82F8P-92, 0X3.2A6AD8ACFCBB0P-76]; sqr [-0XA.644C9D88EA8C8P-152, -0XD.8EC7927926F18P-944] = [0X0.0000000000000P+0, 0X6.BFD4840B33478P-300]; sqr [-0X1.9EE1A9DB994F5P-436, -0X6.D914701C82FECP-624] = [0X0.0000000000000P+0, 0X2.A05EA84E4893CP-872]; sqr [-0X5.65057F3EFFC60P+4, -0X2.3617CF5815ECAP-960] = [0X0.0000000000000P+0, 0X1.D1A144EFBEB44P+12]; sqr [-0X1.975299CCB0E08P-372, +0XB.BEC7D35B45B00P-588] = [0X0.0000000000000P+0, 0X2.8817BFAFBDF18P-744]; sqr [-0X3.51D388D47AED2P-356, -0X1.C3A9CD7025105P-564] = [0X0.0000000000000P+0, 0XB.051CC05C2EBE0P-712]; sqr [-0XC.DB363268CF708P-332, -0X2.171B7D7BFE4E0P-412] = [0X4.5E83E96FF693CP-824, 0XA.548CA7F8C13A0P-660]; sqr [-0X1.32690AAC2472DP-40, -0X8.706EBDCF39C88P-792] = [0X0.0000000000000P+0, 0X1.6EBF489D48CA5P-80]; sqr [-0X5.0145AF0C53324P-200, -0X2.F5A0CB3301856P-204] = [0X8.C23056BA480A8P-408, 0X1.90CBA74D12CF4P-396]; sqr [0XF.4077C7E8CD6A0P-268, 0X3.753426098AC5AP-80] = [0XE.89E458947EFA8P-532, 0XB.F4E1999D73020P-160]; sqr [-0XB.B25F8D8BB7FB8P-376, -0X2.017A332F9B05CP-916] = [0X0.0000000000000P+0, 0X8.8D07F2E827770P-748]; sqr [-0XD.947CA427FDFE0P-592, +0XE.3BE493B5BC8E8P-16] = [0X0.0000000000000P+0, 0XC.A9B03500DD578P-28]; sqr [-0X9.C46198B2471F0P-336, -0X1.65ED85DF2D4B7P-576] = [0X0.0000000000000P+0, 0X5.F6582538F0F44P-668]; sqr [-0X3.2C867C027DB44P-936, +0X6.1883EA827AB6CP-388] = [0X0.0000000000000P+0, 0X2.52887FE100FF0P-772]; sqr [-0X3.560EF91C47DEAP-492, +0X5.413664DD17ABCP-20] = [0X0.0000000000000P+0, 0X1.B9CBC9B69E7BFP-36]; sqr [-0X8.36BFCD74A6D68P-304, -0X3.2C20EB130D510P-836] = [0X0.0000000000000P+0, 0X4.377B251ABDCC0P-604]; sqr [-0X6.BCEC84603958CP-500, -0X1.068B13DA99666P-760] = [0X0.0000000000000P+0, 0X2.D668271745A42P-996]; sqr [-0X1.2789C2D583BCDP-568, -0X1.F2BD89DAD0665P-780] = [0X0.0000000000000P+0, 0X4.0000000000000P-1076]; sqr [-0XC.FE4E8D857E3E0P-548, +0X1.580844B9DC45CP-780] = [0X0.0000000000000P+0, 0X4.0000000000000P-1076]; sqr [-0XC.508D29ACB01B8P-52, +0X1.B1E6B793078DDP-664] = [0X0.0000000000000P+0, 0X9.7A69470135FA8P-100]; sqr [-0XA.12F7783880A78P-124, -0X3.765DF69EE106EP-548] = [0X0.0000000000000P+0, 0X6.57CBD208B34ACP-244]; sqr [-0X6.3A58D52FDF844P-896, -0X1.039E2518CF503P-1008] = [0X0.0000000000000P+0, 0X4.0000000000000P-1076]; sqr [-0XB.DD3171FDEEC18P-168, +0X1.069E434EE9E0FP-740] = [0X0.0000000000000P+0, 0X8.CC15E342FC8D8P-332]; sqr [-0X3.CF0053257533AP-776, -0X1.7883A587654E5P-928] = [0X0.0000000000000P+0, 0X4.0000000000000P-1076]; sqr [0X1.455801D3D2B63P-704, 0X3.A4C915783D07AP-28] = [0X0.0000000000000P+0, 0XD.46C8C24634FC8P-56]; sqr [-0X2.097D06F4DE3E2P-376, +0X2.2E7561FD9255EP-772] = [0X0.0000000000000P+0, 0X4.264E23607BEA8P-752]; sqr [-0X1.7E13DBB66E5A3P-84, -0X6.BC8F45D6A8F48P-540] = [0X0.0000000000000P+0, 0X2.3A3F453ECAFB4P-168]; sqr [-0X4.1F50C5F2CDA54P-276, -0X3.DF16F79756422P-496] = [0XE.FCF2D2F52B4C0P-992, 0X1.0FE5AD9038BC9P-548]; sqr [-0X7.ECC4C5EEC4CACP-328, -0X2.E02E1DB7A08F6P-876] = [0X0.0000000000000P+0, 0X3.ECDBE373EAC94P-652]; sqr [-0XC.1BC7A4C89D440P-256, +0X2.A7F56252D1D34P-608] = [0X0.0000000000000P+0, 0X9.29DBB2B42A988P-508]; sqr [-0XB.CE50D7B2F2868P-236, -0XE.6B08988339B80P-432] = [0XC.FE1B0DE21E568P-860, 0X8.B6138BE0C5B78P-468]; } interval-2.1.0/test/ieee1788-constructors.itl0000644000000000000000000000735513031036767017202 0ustar 00000000000000/* Test Cases for interval constructors from IEEE Std 1788-2015 Copyright 2016 Oliver Heimlich 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 . */ // According to the examples in Section 7.4.2, unbounded intervals can be constructed with non-common inputs. testcase IEEE1788.a { b-numsToInterval -infinity infinity = [entire]; } // Examples from Sections 9.7.1 and 9.8 testcase IEEE1788.b { b-textToInterval "[1.2345]" = [0X1.3C083126E978DP+0, 0X1.3C083126E978EP+0]; b-textToInterval "[1,+infinity]" = [1.0, infinity]; d-textToInterval "[1,1e3]_com" = [1.0, 1000.0]_com; d-textToInterval "[1,1E3]_COM" = [1.0, 1000.0]_com; } // Examples from Table 9.4 testcase IEEE1788.c { b-textToInterval "[1.e-3, 1.1e-3]" = [0X4.189374BC6A7ECP-12, 0X4.816F0068DB8BCP-12]; b-textToInterval "[-0x1.3p-1, 2/3]" = [-0X9.8000000000000P-4, +0XA.AAAAAAAAAAAB0P-4]; b-textToInterval "[3.56]" = [0X3.8F5C28F5C28F4P+0, 0X3.8F5C28F5C28F6P+0]; b-textToInterval "3.56?1" = [0X3.8CCCCCCCCCCCCP+0, 0X3.91EB851EB8520P+0]; b-textToInterval "3.56?1e2" = [355.0, 357.0]; b-textToInterval "3.560?2" = [0X3.8ED916872B020P+0, 0X3.8FDF3B645A1CCP+0]; b-textToInterval "3.56?" = [0X3.8E147AE147AE0P+0, 0X3.90A3D70A3D70CP+0]; b-textToInterval "3.560?2u" = [0X3.8F5C28F5C28F4P+0, 0X3.8FDF3B645A1CCP+0]; b-textToInterval "-10?" = [-10.5, -9.5]; b-textToInterval "-10?u" = [-10.0, -9.5]; b-textToInterval "-10?12" = [-22.0, 2.0]; } // Examples from Section 10.5.1 testcase IEEE1788.d { b-textToInterval "[1.234e5,Inf]" = [123400.0, infinity]; b-textToInterval "3.1416?1" = [0X3.24395810624DCP+0, 0X3.24467381D7DC0P+0]; b-textToInterval "[Empty]" = [empty]; } // Example from Section 11.3 testcase IEEE1788.e { d-numsToInterval 2 1 = [nai]; } // Examples from Table 12.1 testcase IEEE1788.e { d-textToInterval "[ ]" = [empty]_trv; d-textToInterval "[entire]" = [-infinity, +infinity]_dac; d-textToInterval "[1.e-3, 1.1e-3]" = [0X4.189374BC6A7ECP-12, 0X4.816F0068DB8BCP-12]_com; d-textToInterval "[-Inf, 2/3]" = [-infinity, +0XA.AAAAAAAAAAAB0P-4]_dac; d-textToInterval "[0x1.3p-1,]" = [0x1.3p-1, infinity]_dac; d-textToInterval "[,]" = [entire]_dac; d-textToInterval "3.56?1" = [0X3.8CCCCCCCCCCCCP+0, 0X3.91EB851EB8520P+0]_com; d-textToInterval "3.56?1e2" = [355.0, 357.0]_com; d-textToInterval "3.560?2" = [0X3.8ED916872B020P+0, 0X3.8FDF3B645A1CCP+0]_com; d-textToInterval "3.56?" = [0X3.8E147AE147AE0P+0, 0X3.90A3D70A3D70CP+0]_com; d-textToInterval "3.560?2u" = [0X3.8F5C28F5C28F4P+0, 0X3.8FDF3B645A1CCP+0]_com; d-textToInterval "-10?" = [-10.5, -9.5]_com; d-textToInterval "-10?u" = [-10.0, -9.5]_com; d-textToInterval "-10?12" = [-22.0, 2.0]_com; d-textToInterval "-10??u" = [-10.0, infinity]_dac; d-textToInterval "-10??" = [-infinity, infinity]_dac; d-textToInterval "[nai]" = [nai]; d-textToInterval "3.56?1_def" = [0X3.8CCCCCCCCCCCCP+0, 0X3.91EB851EB8520P+0]_def; } // Examples from Section 12.11.3 testcase IEEE1788.f { b-textToInterval "[]" = [empty]; b-textToInterval "[empty]" = [empty]; b-textToInterval "[ empty ]" = [empty]; b-textToInterval "[,]" = [entire]; b-textToInterval "[ entire ]" = [entire]; } interval-2.1.0/test/libieeep1788_tests_bool.itl0000644000000000000000000004437113031036767017537 0ustar 00000000000000/* Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) Copyright 2015-2016 Oliver Heimlich Original author: Marco Nehmeier (unit tests in libieeep1788, original license: Apache License 2.0) Converted into portable ITL format by Oliver Heimlich with minor corrections. 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 . */ testcase minimal_empty_test { isEmpty [empty] = true; isEmpty [-infinity,+infinity] = false; isEmpty [1.0,2.0] = false; isEmpty [-1.0,2.0] = false; isEmpty [-3.0,-2.0] = false; isEmpty [-infinity,2.0] = false; isEmpty [-infinity,0.0] = false; isEmpty [-infinity,-0.0] = false; isEmpty [0.0,infinity] = false; isEmpty [-0.0,infinity] = false; isEmpty [-0.0,0.0] = false; isEmpty [0.0,-0.0] = false; isEmpty [0.0,0.0] = false; isEmpty [-0.0,-0.0] = false; } testcase minimal_empty_dec_test { isEmpty [empty]_trv = true; isEmpty [-infinity,+infinity]_def = false; isEmpty [1.0,2.0]_com = false; isEmpty [-1.0,2.0]_trv = false; isEmpty [-3.0,-2.0]_dac = false; isEmpty [-infinity,2.0]_trv = false; isEmpty [-infinity,0.0]_trv = false; isEmpty [-infinity,-0.0]_trv = false; isEmpty [0.0,infinity]_def = false; isEmpty [-0.0,infinity]_trv = false; isEmpty [-0.0,0.0]_com = false; isEmpty [0.0,-0.0]_trv = false; isEmpty [0.0,0.0]_trv = false; isEmpty [-0.0,-0.0]_trv = false; } testcase minimal_entire_test { isEntire [empty] = false; isEntire [-infinity,+infinity] = true; isEntire [1.0,2.0] = false; isEntire [-1.0,2.0] = false; isEntire [-3.0,-2.0] = false; isEntire [-infinity,2.0] = false; isEntire [-infinity,0.0] = false; isEntire [-infinity,-0.0] = false; isEntire [0.0,infinity] = false; isEntire [-0.0,infinity] = false; isEntire [-0.0,0.0] = false; isEntire [0.0,-0.0] = false; isEntire [0.0,0.0] = false; isEntire [-0.0,-0.0] = false; } testcase minimal_entire_dec_test { isEntire [empty]_trv = false; isEntire [-infinity,+infinity]_trv = true; isEntire [-infinity,+infinity]_def = true; isEntire [-infinity,+infinity]_dac = true; isEntire [1.0,2.0]_com = false; isEntire [-1.0,2.0]_trv = false; isEntire [-3.0,-2.0]_dac = false; isEntire [-infinity,2.0]_trv = false; isEntire [-infinity,0.0]_trv = false; isEntire [-infinity,-0.0]_trv = false; isEntire [0.0,infinity]_def = false; isEntire [-0.0,infinity]_trv = false; isEntire [-0.0,0.0]_com = false; isEntire [0.0,-0.0]_trv = false; isEntire [0.0,0.0]_trv = false; isEntire [-0.0,-0.0]_trv = false; } testcase minimal_nai_dec_test { isNaI [-infinity,+infinity]_trv = false; isNaI [-infinity,+infinity]_def = false; isNaI [-infinity,+infinity]_dac = false; isNaI [1.0,2.0]_com = false; isNaI [-1.0,2.0]_trv = false; isNaI [-3.0,-2.0]_dac = false; isNaI [-infinity,2.0]_trv = false; isNaI [-infinity,0.0]_trv = false; isNaI [-infinity,-0.0]_trv = false; isNaI [0.0,infinity]_def = false; isNaI [-0.0,infinity]_trv = false; isNaI [-0.0,0.0]_com = false; isNaI [0.0,-0.0]_trv = false; isNaI [0.0,0.0]_trv = false; isNaI [-0.0,-0.0]_trv = false; } testcase minimal_equal_test { equal [1.0,2.0] [1.0,2.0] = true; equal [1.0,2.1] [1.0,2.0] = false; equal [empty] [empty] = true; equal [empty] [1.0,2.0] = false; equal [-infinity,+infinity] [-infinity,+infinity] = true; equal [1.0,2.4] [-infinity,+infinity] = false; equal [1.0,infinity] [1.0,infinity] = true; equal [1.0,2.4] [1.0,infinity] = false; equal [-infinity,2.0] [-infinity,2.0] = true; equal [-infinity,2.4] [-infinity,2.0] = false; equal [-2.0,0.0] [-2.0,0.0] = true; equal [-0.0,2.0] [0.0,2.0] = true; equal [-0.0,-0.0] [0.0,0.0] = true; equal [-0.0,0.0] [0.0,0.0] = true; equal [0.0,-0.0] [0.0,0.0] = true; } testcase minimal_equal_dec_test { equal [1.0,2.0]_def [1.0,2.0]_trv = true; equal [1.0,2.1]_trv [1.0,2.0]_trv = false; equal [empty]_trv [empty]_trv = true; equal [empty]_trv [1.0,2.0]_trv = false; equal [empty]_trv [1.0,2.0]_trv = false; equal [-infinity,+infinity]_def [-infinity,+infinity]_trv = true; equal [1.0,2.4]_trv [-infinity,+infinity]_trv = false; equal [1.0,infinity]_trv [1.0,infinity]_trv = true; equal [1.0,2.4]_def [1.0,infinity]_trv = false; equal [-infinity,2.0]_trv [-infinity,2.0]_trv = true; equal [-infinity,2.4]_def [-infinity,2.0]_trv = false; equal [-2.0,0.0]_trv [-2.0,0.0]_trv = true; equal [-0.0,2.0]_def [0.0,2.0]_trv = true; equal [-0.0,-0.0]_trv [0.0,0.0]_trv = true; equal [-0.0,0.0]_def [0.0,0.0]_trv = true; equal [0.0,-0.0]_trv [0.0,0.0]_trv = true; } testcase minimal_subset_test { subset [empty] [empty] = true; subset [empty] [0.0,4.0] = true; subset [empty] [-0.0,4.0] = true; subset [empty] [-0.1,1.0] = true; subset [empty] [-0.1,0.0] = true; subset [empty] [-0.1,-0.0] = true; subset [empty] [-infinity,+infinity] = true; subset [0.0,4.0] [empty] = false; subset [-0.0,4.0] [empty] = false; subset [-0.1,1.0] [empty] = false; subset [-infinity,+infinity] [empty] = false; subset [0.0,4.0] [-infinity,+infinity] = true; subset [-0.0,4.0] [-infinity,+infinity] = true; subset [-0.1,1.0] [-infinity,+infinity] = true; subset [-infinity,+infinity] [-infinity,+infinity] = true; subset [1.0,2.0] [1.0,2.0] = true; subset [1.0,2.0] [0.0,4.0] = true; subset [1.0,2.0] [-0.0,4.0] = true; subset [0.1,0.2] [0.0,4.0] = true; subset [0.1,0.2] [-0.0,4.0] = true; subset [-0.1,-0.1] [-4.0, 3.4] = true; subset [0.0,0.0] [-0.0,-0.0] = true; subset [-0.0,-0.0] [0.0,0.0] = true; subset [-0.0,0.0] [0.0,0.0] = true; subset [-0.0,0.0] [0.0,-0.0] = true; subset [0.0,-0.0] [0.0,0.0] = true; subset [0.0,-0.0] [-0.0,0.0] = true; } testcase minimal_subset_dec_test { subset [empty]_trv [0.0,4.0]_trv = true; subset [empty]_trv [-0.0,4.0]_def = true; subset [empty]_trv [-0.1,1.0]_trv = true; subset [empty]_trv [-0.1,0.0]_trv = true; subset [empty]_trv [-0.1,-0.0]_trv = true; subset [empty]_trv [-infinity,+infinity]_trv = true; subset [0.0,4.0]_trv [empty]_trv = false; subset [-0.0,4.0]_def [empty]_trv = false; subset [-0.1,1.0]_trv [empty]_trv = false; subset [-infinity,+infinity]_trv [empty]_trv = false; subset [0.0,4.0]_trv [-infinity,+infinity]_trv = true; subset [-0.0,4.0]_trv [-infinity,+infinity]_trv = true; subset [-0.1,1.0]_trv [-infinity,+infinity]_trv = true; subset [-infinity,+infinity]_trv [-infinity,+infinity]_trv = true; subset [1.0,2.0]_trv [1.0,2.0]_trv = true; subset [1.0,2.0]_trv [0.0,4.0]_trv = true; subset [1.0,2.0]_def [-0.0,4.0]_def = true; subset [0.1,0.2]_trv [0.0,4.0]_trv = true; subset [0.1,0.2]_trv [-0.0,4.0]_def = true; subset [-0.1,-0.1]_trv [-4.0, 3.4]_trv = true; subset [0.0,0.0]_trv [-0.0,-0.0]_trv = true; subset [-0.0,-0.0]_trv [0.0,0.0]_def = true; subset [-0.0,0.0]_trv [0.0,0.0]_trv = true; subset [-0.0,0.0]_trv [0.0,-0.0]_trv = true; subset [0.0,-0.0]_def [0.0,0.0]_trv = true; subset [0.0,-0.0]_trv [-0.0,0.0]_trv = true; } testcase minimal_less_test { less [empty] [empty] = true; less [1.0,2.0] [empty] = false; less [empty] [1.0,2.0] = false; less [-infinity,+infinity] [-infinity,+infinity] = true; less [1.0,2.0] [-infinity,+infinity] = false; less [0.0,2.0] [-infinity,+infinity] = false; less [-0.0,2.0] [-infinity,+infinity] = false; less [-infinity,+infinity] [1.0,2.0] = false; less [-infinity,+infinity] [0.0,2.0] = false; less [-infinity,+infinity] [-0.0,2.0] = false; less [0.0,2.0] [0.0,2.0] = true; less [0.0,2.0] [-0.0,2.0] = true; less [0.0,2.0] [1.0,2.0] = true; less [-0.0,2.0] [1.0,2.0] = true; less [1.0,2.0] [1.0,2.0] = true; less [1.0,2.0] [3.0,4.0] = true; less [1.0,3.5] [3.0,4.0] = true; less [1.0,4.0] [3.0,4.0] = true; less [-2.0,-1.0] [-2.0,-1.0] = true; less [-3.0,-1.5] [-2.0,-1.0] = true; less [0.0,0.0] [-0.0,-0.0] = true; less [-0.0,-0.0] [0.0,0.0] = true; less [-0.0,0.0] [0.0,0.0] = true; less [-0.0,0.0] [0.0,-0.0] = true; less [0.0,-0.0] [0.0,0.0] = true; less [0.0,-0.0] [-0.0,0.0] = true; } testcase minimal_less_dec_test { less [1.0,2.0]_trv [empty]_trv = false; less [empty]_trv [1.0,2.0]_def = false; less [1.0,2.0]_trv [empty]_trv = false; less [empty]_trv [1.0,2.0]_trv = false; less [-infinity,+infinity]_trv [-infinity,+infinity]_trv = true; less [1.0,2.0]_def [-infinity,+infinity]_trv = false; less [0.0,2.0]_trv [-infinity,+infinity]_trv = false; less [-0.0,2.0]_trv [-infinity,+infinity]_trv = false; less [-infinity,+infinity]_trv [1.0,2.0]_trv = false; less [-infinity,+infinity]_trv [0.0,2.0]_def = false; less [-infinity,+infinity]_trv [-0.0,2.0]_trv = false; less [0.0,2.0]_trv [0.0,2.0]_trv = true; less [0.0,2.0]_trv [-0.0,2.0]_trv = true; less [0.0,2.0]_def [1.0,2.0]_def = true; less [-0.0,2.0]_trv [1.0,2.0]_trv = true; less [1.0,2.0]_trv [1.0,2.0]_trv = true; less [1.0,2.0]_trv [3.0,4.0]_def = true; less [1.0,3.5]_trv [3.0,4.0]_trv = true; less [1.0,4.0]_trv [3.0,4.0]_trv = true; less [-2.0,-1.0]_trv [-2.0,-1.0]_trv = true; less [-3.0,-1.5]_trv [-2.0,-1.0]_trv = true; less [0.0,0.0]_trv [-0.0,-0.0]_trv = true; less [-0.0,-0.0]_trv [0.0,0.0]_def = true; less [-0.0,0.0]_trv [0.0,0.0]_trv = true; less [-0.0,0.0]_trv [0.0,-0.0]_trv = true; less [0.0,-0.0]_def [0.0,0.0]_trv = true; less [0.0,-0.0]_trv [-0.0,0.0]_trv = true; } testcase minimal_precedes_test { precedes [empty] [3.0,4.0] = true; precedes [3.0,4.0] [empty] = true; precedes [empty] [empty] = true; precedes [1.0,2.0] [-infinity,+infinity] = false; precedes [0.0,2.0] [-infinity,+infinity] = false; precedes [-0.0,2.0] [-infinity,+infinity] = false; precedes [-infinity,+infinity] [1.0,2.0] = false; precedes [-infinity,+infinity] [-infinity,+infinity] = false; precedes [1.0,2.0] [3.0,4.0] = true; precedes [1.0,3.0] [3.0,4.0] = true; precedes [-3.0, -1.0] [-1.0,0.0] = true; precedes [-3.0, -1.0] [-1.0,-0.0] = true; precedes [1.0,3.5] [3.0,4.0] = false; precedes [1.0,4.0] [3.0,4.0] = false; precedes [-3.0, -0.1] [-1.0,0.0] = false; precedes [0.0,0.0] [-0.0,-0.0] = true; precedes [-0.0,-0.0] [0.0,0.0] = true; precedes [-0.0,0.0] [0.0,0.0] = true; precedes [-0.0,0.0] [0.0,-0.0] = true; precedes [0.0,-0.0] [0.0,0.0] = true; precedes [0.0,-0.0] [-0.0,0.0] = true; } testcase minimal_precedes_dec_test { precedes [empty]_trv [3.0,4.0]_def = true; precedes [3.0,4.0]_trv [empty]_trv = true; precedes [empty]_trv [3.0,4.0]_trv = true; precedes [3.0,4.0]_trv [empty]_trv = true; precedes [1.0,2.0]_trv [-infinity,+infinity]_trv = false; precedes [0.0,2.0]_trv [-infinity,+infinity]_trv = false; precedes [-0.0,2.0]_trv [-infinity,+infinity]_trv = false; precedes [-infinity,+infinity]_trv [1.0,2.0]_trv = false; precedes [-infinity,+infinity]_trv [-infinity,+infinity]_trv = false; precedes [1.0,2.0]_trv [3.0,4.0]_trv = true; precedes [1.0,3.0]_trv [3.0,4.0]_def = true; precedes [-3.0, -1.0]_def [-1.0,0.0]_trv = true; precedes [-3.0, -1.0]_trv [-1.0,-0.0]_trv = true; precedes [1.0,3.5]_trv [3.0,4.0]_trv = false; precedes [1.0,4.0]_trv [3.0,4.0]_trv = false; precedes [-3.0, -0.1]_trv [-1.0,0.0]_trv = false; precedes [0.0,0.0]_trv [-0.0,-0.0]_trv = true; precedes [-0.0,-0.0]_trv [0.0,0.0]_def = true; precedes [-0.0,0.0]_trv [0.0,0.0]_trv = true; precedes [-0.0,0.0]_def [0.0,-0.0]_trv = true; precedes [0.0,-0.0]_trv [0.0,0.0]_trv = true; precedes [0.0,-0.0]_trv [-0.0,0.0]_trv = true; } testcase minimal_interior_test { interior [empty] [empty] = true; interior [empty] [0.0,4.0] = true; interior [0.0,4.0] [empty] = false; interior [-infinity,+infinity] [-infinity,+infinity] = true; interior [0.0,4.0] [-infinity,+infinity] = true; interior [empty] [-infinity,+infinity] = true; interior [-infinity,+infinity] [0.0,4.0] = false; interior [0.0,4.0] [0.0,4.0] = false; interior [1.0,2.0] [0.0,4.0] = true; interior [-2.0,2.0] [-2.0,4.0] = false; interior [-0.0,-0.0] [-2.0,4.0] = true; interior [0.0,0.0] [-2.0,4.0] = true; interior [0.0,0.0] [-0.0,-0.0] = false; interior [0.0,4.4] [0.0,4.0] = false; interior [-1.0,-1.0] [0.0,4.0] = false; interior [2.0,2.0] [-2.0,-1.0] = false; } testcase minimal_interior_dec_test { interior [empty]_trv [0.0,4.0]_trv = true; interior [0.0,4.0]_def [empty]_trv = false; interior [0.0,4.0]_trv [empty]_trv = false; interior [-infinity,+infinity]_trv [-infinity,+infinity]_trv = true; interior [0.0,4.0]_trv [-infinity,+infinity]_trv = true; interior [empty]_trv [-infinity,+infinity]_trv = true; interior [-infinity,+infinity]_trv [0.0,4.0]_trv = false; interior [0.0,4.0]_trv [0.0,4.0]_trv = false; interior [1.0,2.0]_def [0.0,4.0]_trv = true; interior [-2.0,2.0]_trv [-2.0,4.0]_def = false; interior [-0.0,-0.0]_trv [-2.0,4.0]_trv = true; interior [0.0,0.0]_def [-2.0,4.0]_trv = true; interior [0.0,0.0]_trv [-0.0,-0.0]_trv = false; interior [0.0,4.4]_trv [0.0,4.0]_trv = false; interior [-1.0,-1.0]_trv [0.0,4.0]_def = false; interior [2.0,2.0]_def [-2.0,-1.0]_trv = false; } testcase minimal_strictLess_test { strictLess [empty] [empty] = true; strictLess [1.0,2.0] [empty] = false; strictLess [empty] [1.0,2.0] = false; strictLess [-infinity,+infinity] [-infinity,+infinity] = true; strictLess [1.0,2.0] [-infinity,+infinity] = false; strictLess [-infinity,+infinity] [1.0,2.0] = false; strictLess [1.0,2.0] [1.0,2.0] = false; strictLess [1.0,2.0] [3.0,4.0] = true; strictLess [1.0,3.5] [3.0,4.0] = true; strictLess [1.0,4.0] [3.0,4.0] = false; strictLess [0.0,4.0] [0.0,4.0] = false; strictLess [-0.0,4.0] [0.0,4.0] = false; strictLess [-2.0,-1.0] [-2.0,-1.0] = false; strictLess [-3.0,-1.5] [-2.0,-1.0] = true; } testcase minimal_strictLess_dec_test { strictLess [1.0,2.0]_trv [empty]_trv = false; strictLess [empty]_trv [1.0,2.0]_def = false; strictLess [1.0,2.0]_def [empty]_trv = false; strictLess [empty]_trv [1.0,2.0]_def = false; strictLess [-infinity,+infinity]_trv [-infinity,+infinity]_trv = true; strictLess [1.0,2.0]_trv [-infinity,+infinity]_trv = false; strictLess [-infinity,+infinity]_trv [1.0,2.0]_trv = false; strictLess [1.0,2.0]_trv [1.0,2.0]_trv = false; strictLess [1.0,2.0]_trv [3.0,4.0]_trv = true; strictLess [1.0,3.5]_def [3.0,4.0]_trv = true; strictLess [1.0,4.0]_trv [3.0,4.0]_def = false; strictLess [0.0,4.0]_trv [0.0,4.0]_def = false; strictLess [-0.0,4.0]_def [0.0,4.0]_trv = false; strictLess [-2.0,-1.0]_def [-2.0,-1.0]_def = false; strictLess [-3.0,-1.5]_trv [-2.0,-1.0]_trv = true; } testcase minimal_strictPrecedes_test { strictPrecedes [empty] [3.0,4.0] = true; strictPrecedes [3.0,4.0] [empty] = true; strictPrecedes [empty] [empty] = true; strictPrecedes [1.0,2.0] [-infinity,+infinity] = false; strictPrecedes [-infinity,+infinity] [1.0,2.0] = false; strictPrecedes [-infinity,+infinity] [-infinity,+infinity] = false; strictPrecedes [1.0,2.0] [3.0,4.0] = true; strictPrecedes [1.0,3.0] [3.0,4.0] = false; strictPrecedes [-3.0, -1.0] [-1.0,0.0] = false; strictPrecedes [-3.0, -0.0] [0.0,1.0] = false; strictPrecedes [-3.0, 0.0] [-0.0,1.0] = false; strictPrecedes [1.0,3.5] [3.0,4.0] = false; strictPrecedes [1.0,4.0] [3.0,4.0] = false; strictPrecedes [-3.0, -0.1] [-1.0,0.0] = false; } testcase minimal_strictPrecedes_dec_test { strictPrecedes [empty]_trv [3.0,4.0]_trv = true; strictPrecedes [3.0,4.0]_def [empty]_trv = true; strictPrecedes [empty]_trv [3.0,4.0]_trv = true; strictPrecedes [3.0,4.0]_def [empty]_trv = true; strictPrecedes [1.0,2.0]_trv [-infinity,+infinity]_trv = false; strictPrecedes [-infinity,+infinity]_trv [1.0,2.0]_trv = false; strictPrecedes [-infinity,+infinity]_trv [-infinity,+infinity]_trv = false; strictPrecedes [1.0,2.0]_trv [3.0,4.0]_trv = true; strictPrecedes [1.0,3.0]_def [3.0,4.0]_trv = false; strictPrecedes [-3.0, -1.0]_trv [-1.0,0.0]_def = false; strictPrecedes [-3.0, -0.0]_def [0.0,1.0]_trv = false; strictPrecedes [-3.0, 0.0]_trv [-0.0,1.0]_trv = false; strictPrecedes [1.0,3.5]_trv [3.0,4.0]_trv = false; strictPrecedes [1.0,4.0]_trv [3.0,4.0]_def = false; strictPrecedes [-3.0, -0.1]_trv [-1.0,0.0]_trv = false; } testcase minimal_disjoint_test { disjoint [empty] [3.0,4.0] = true; disjoint [3.0,4.0] [empty] = true; disjoint [empty] [empty] = true; disjoint [3.0,4.0] [1.0,2.0] = true; disjoint [0.0,0.0] [-0.0,-0.0] = false; disjoint [0.0,-0.0] [-0.0,0.0] = false; disjoint [3.0,4.0] [1.0,7.0] = false; disjoint [3.0,4.0] [-infinity,+infinity] = false; disjoint [-infinity,+infinity] [1.0,7.0] = false; disjoint [-infinity,+infinity] [-infinity,+infinity] = false; } testcase minimal_disjoint_dec_test { disjoint [empty]_trv [3.0,4.0]_def = true; disjoint [3.0,4.0]_trv [empty]_trv = true; disjoint [empty]_trv [3.0,4.0]_trv = true; disjoint [3.0,4.0]_trv [empty]_trv = true; disjoint [3.0,4.0]_trv [1.0,2.0]_def = true; disjoint [0.0,0.0]_trv [-0.0,-0.0]_trv = false; disjoint [0.0,-0.0]_trv [-0.0,0.0]_trv = false; disjoint [3.0,4.0]_def [1.0,7.0]_def = false; disjoint [3.0,4.0]_trv [-infinity,+infinity]_trv = false; disjoint [-infinity,+infinity]_trv [1.0,7.0]_trv = false; disjoint [-infinity,+infinity]_trv [-infinity,+infinity]_trv = false; } interval-2.1.0/test/libieeep1788_tests_cancel.itl0000644000000000000000000004633313031036767020031 0ustar 00000000000000/* Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) Copyright 2015-2016 Oliver Heimlich Original author: Marco Nehmeier (unit tests in libieeep1788, original license: Apache License 2.0) Converted into portable ITL format by Oliver Heimlich with minor corrections. 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 . */ testcase minimal_cancelPlus_test { cancelPlus [-infinity, -1.0] [empty] = [entire]; cancelPlus [-1.0, infinity] [empty] = [entire]; cancelPlus [entire] [empty] = [entire]; cancelPlus [-infinity, -1.0] [-5.0,1.0] = [entire]; cancelPlus [-1.0, infinity] [-5.0,1.0] = [entire]; cancelPlus [entire] [-5.0,1.0] = [entire]; cancelPlus [-infinity, -1.0] [entire] = [entire]; cancelPlus [-1.0, infinity] [entire] = [entire]; cancelPlus [empty] [1.0, infinity] = [entire]; cancelPlus [empty] [-infinity,1.0] = [entire]; cancelPlus [empty] [entire] = [entire]; cancelPlus [-1.0,5.0] [1.0,infinity] = [entire]; cancelPlus [-1.0,5.0] [-infinity,1.0] = [entire]; cancelPlus [-1.0,5.0] [entire] = [entire]; cancelPlus [entire] [1.0,infinity] = [entire]; cancelPlus [entire] [-infinity,1.0] = [entire]; cancelPlus [entire] [entire] = [entire]; cancelPlus [-5.0, -1.0] [1.0,5.1] = [entire]; cancelPlus [-5.0, -1.0] [0.9,5.0] = [entire]; cancelPlus [-5.0, -1.0] [0.9,5.1] = [entire]; cancelPlus [-10.0, 5.0] [-5.0,10.1] = [entire]; cancelPlus [-10.0, 5.0] [-5.1,10.0] = [entire]; cancelPlus [-10.0, 5.0] [-5.1,10.1] = [entire]; cancelPlus [1.0, 5.0] [-5.0,-0.9] = [entire]; cancelPlus [1.0, 5.0] [-5.1,-1.0] = [entire]; cancelPlus [1.0, 5.0] [-5.1,-0.9] = [entire]; cancelPlus [-10.0, -1.0] [empty] = [entire]; cancelPlus [-10.0, 5.0] [empty] = [entire]; cancelPlus [1.0, 5.0] [empty] = [entire]; cancelPlus [empty] [empty] = [empty]; cancelPlus [empty] [1.0,10.0] = [empty]; cancelPlus [empty] [-5.0,10.0] = [empty]; cancelPlus [empty] [-5.0,-1.0] = [empty]; cancelPlus [-5.1,-0.0] [0.0,5.0] = [-0X1.999999999998P-4,0.0]; cancelPlus [-5.1,-1.0] [1.0,5.0] = [-0X1.999999999998P-4,0.0]; cancelPlus [-5.0,-0.9] [1.0,5.0] = [0.0, 0X1.9999999999998P-4]; cancelPlus [-5.1,-0.9] [1.0,5.0] = [-0X1.999999999998P-4,0X1.9999999999998P-4]; cancelPlus [-5.0,-1.0] [1.0,5.0] = [0.0,0.0]; cancelPlus [-10.1, 5.0] [-5.0,10.0] = [-0X1.999999999998P-4,0.0]; cancelPlus [-10.0, 5.1] [-5.0,10.0] = [0.0,0X1.999999999998P-4]; cancelPlus [-10.1, 5.1] [-5.0,10.0] = [-0X1.999999999998P-4,0X1.999999999998P-4]; cancelPlus [-10.0, 5.0] [-5.0,10.0] = [0.0,0.0]; cancelPlus [0.9, 5.0] [-5.0,-1.0] = [-0X1.9999999999998P-4,0.0]; cancelPlus [1.0, 5.1] [-5.0,-1.0] = [0.0,0X1.999999999998P-4]; cancelPlus [0.0, 5.1] [-5.0,-0.0] = [0.0,0X1.999999999998P-4]; cancelPlus [0.9, 5.1] [-5.0,-1.0] = [-0X1.9999999999998P-4,0X1.999999999998P-4]; cancelPlus [1.0, 5.0] [-5.0,-1.0] = [0.0,0.0]; cancelPlus [0.0, 5.0] [-5.0,-0.0] = [0.0,0.0]; cancelPlus [0X1.FFFFFFFFFFFFP+0,0X1.FFFFFFFFFFFFP+0] [-0X1.999999999999AP-4,-0X1.999999999999AP-4] = [0X1.E666666666656P+0,0X1.E666666666657P+0]; cancelPlus [-0X1.999999999999AP-4,0X1.FFFFFFFFFFFFP+0] [-0X1.999999999999AP-4,0.01] = [-0X1.70A3D70A3D70BP-4,0X1.E666666666657P+0]; cancelPlus [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] = [0x1.FFFFFFFFFFFFFp1023,infinity]; cancelPlus [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] = [0.0,0.0]; cancelPlus [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] [-0X1.FFFFFFFFFFFFEP+1023,0x1.FFFFFFFFFFFFFp1023] = [0.0,0X1P+971]; cancelPlus [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] [-0x1.FFFFFFFFFFFFFp1023,0X1.FFFFFFFFFFFFEP+1023] = [-0X1P+971,0.0]; cancelPlus [-0x1.FFFFFFFFFFFFFp1023,0X1.FFFFFFFFFFFFEP+1023] [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] = [entire]; cancelPlus [-0X1.FFFFFFFFFFFFEP+1023,0x1.FFFFFFFFFFFFFp1023] [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] = [entire]; cancelPlus [-0X1P+0,0X1.FFFFFFFFFFFFFP-53] [-0X1P+0,0X1.FFFFFFFFFFFFEP-53] = [-0X1.FFFFFFFFFFFFFP-1,-0X1.FFFFFFFFFFFFEP-1]; cancelPlus [-0X1P+0,0X1.FFFFFFFFFFFFEP-53] [-0X1P+0,0X1.FFFFFFFFFFFFFP-53] = [entire]; } testcase minimal_cancelPlus_dec_test { cancelPlus [-infinity, -1.0]_dac [empty]_trv = [entire]_trv; cancelPlus [-1.0, infinity]_def [empty]_trv = [entire]_trv; cancelPlus [entire]_def [empty]_trv = [entire]_trv; cancelPlus [-infinity, -1.0]_dac [-5.0,1.0]_com = [entire]_trv; cancelPlus [-1.0, infinity]_trv [-5.0,1.0]_def = [entire]_trv; cancelPlus [entire]_def [-5.0,1.0]_def = [entire]_trv; cancelPlus [-infinity, -1.0]_dac [entire]_def = [entire]_trv; cancelPlus [-1.0, infinity]_def [entire]_def = [entire]_trv; cancelPlus [empty]_trv [1.0, infinity]_def = [entire]_trv; cancelPlus [empty]_trv [-infinity,1.0]_trv = [entire]_trv; cancelPlus [empty]_trv [entire]_def = [entire]_trv; cancelPlus [-1.0,5.0]_dac [1.0,infinity]_dac = [entire]_trv; cancelPlus [-1.0,5.0]_def [-infinity,1.0]_dac = [entire]_trv; cancelPlus [-1.0,5.0]_com [entire]_def = [entire]_trv; cancelPlus [entire]_def [1.0,infinity]_dac = [entire]_trv; cancelPlus [entire]_def [-infinity,1.0]_def = [entire]_trv; cancelPlus [entire]_def [entire]_def = [entire]_trv; cancelPlus [-5.0, -1.0]_com [1.0,5.1]_def = [entire]_trv; cancelPlus [-5.0, -1.0]_dac [0.9,5.0]_def = [entire]_trv; cancelPlus [-5.0, -1.0]_def [0.9,5.1]_def = [entire]_trv; cancelPlus [-10.0, 5.0]_trv [-5.0,10.1]_dac = [entire]_trv; cancelPlus [-10.0, 5.0]_com [-5.1,10.0]_dac = [entire]_trv; cancelPlus [-10.0, 5.0]_dac [-5.1,10.1]_dac = [entire]_trv; cancelPlus [1.0, 5.0]_def [-5.0,-0.9]_com = [entire]_trv; cancelPlus [1.0, 5.0]_trv [-5.1,-1.0]_com = [entire]_trv; cancelPlus [1.0, 5.0]_dac [-5.1,-0.9]_com = [entire]_trv; cancelPlus [-10.0, -1.0]_trv [empty]_trv = [entire]_trv; cancelPlus [-10.0, 5.0]_def [empty]_trv = [entire]_trv; cancelPlus [1.0, 5.0]_com [empty]_trv = [entire]_trv; cancelPlus [empty]_trv [empty]_trv = [empty]_trv; cancelPlus [empty]_trv [1.0,10.0]_dac = [empty]_trv; cancelPlus [empty]_trv [-5.0,10.0]_def = [empty]_trv; cancelPlus [empty]_trv [-5.0,-1.0]_com = [empty]_trv; cancelPlus [-5.1,-0.0]_com [0.0,5.0]_com = [-0X1.999999999998P-4,0.0]_trv; cancelPlus [-5.1,-1.0]_com [1.0,5.0]_dac = [-0X1.999999999998P-4,0.0]_trv; cancelPlus [-5.0,-0.9]_com [1.0,5.0]_def = [0.0, 0X1.9999999999998P-4]_trv; cancelPlus [-5.1,-0.9]_dac [1.0,5.0]_trv = [-0X1.999999999998P-4,0X1.9999999999998P-4]_trv; cancelPlus [-5.0,-1.0]_dac [1.0,5.0]_com = [0.0,0.0]_trv; cancelPlus [-10.1, 5.0]_dac [-5.0,10.0]_dac = [-0X1.999999999998P-4,0.0]_trv; cancelPlus [-10.0, 5.1]_def [-5.0,10.0]_def = [0.0,0X1.999999999998P-4]_trv; cancelPlus [-10.1, 5.1]_def [-5.0,10.0]_trv = [-0X1.999999999998P-4,0X1.999999999998P-4]_trv; cancelPlus [-10.0, 5.0]_def [-5.0,10.0]_com = [0.0,0.0]_trv; cancelPlus [0.9, 5.0]_trv [-5.0,-1.0]_dac = [-0X1.9999999999998P-4,0.0]_trv; cancelPlus [1.0, 5.1]_trv [-5.0,-1.0]_def = [0.0,0X1.999999999998P-4]_trv; cancelPlus [0.0, 5.1]_trv [-5.0,-0.0]_trv = [0.0,0X1.999999999998P-4]_trv; cancelPlus [0.9, 5.1]_com [-5.0,-1.0]_com = [-0X1.9999999999998P-4,0X1.999999999998P-4]_trv; cancelPlus [1.0, 5.0]_dac [-5.0,-1.0]_dac = [0.0,0.0]_trv; cancelPlus [0.0, 5.0]_def [-5.0,-0.0]_trv = [0.0,0.0]_trv; cancelPlus [0X1.FFFFFFFFFFFFP+0,0X1.FFFFFFFFFFFFP+0]_com [-0X1.999999999999AP-4,-0X1.999999999999AP-4]_com = [0X1.E666666666656P+0,0X1.E666666666657P+0]_trv; cancelPlus [-0X1.999999999999AP-4,0X1.FFFFFFFFFFFFP+0]_dac [-0X1.999999999999AP-4,0.01]_com = [-0X1.70A3D70A3D70BP-4,0X1.E666666666657P+0]_trv; cancelPlus [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com = [0x1.FFFFFFFFFFFFFp1023,infinity]_trv; cancelPlus [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com = [0.0,0.0]_trv; cancelPlus [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_dac [-0X1.FFFFFFFFFFFFEP+1023,0x1.FFFFFFFFFFFFFp1023]_com = [0.0,0X1P+971]_trv; cancelPlus [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_dac [-0x1.FFFFFFFFFFFFFp1023,0X1.FFFFFFFFFFFFEP+1023]_com = [-0X1P+971,0.0]_trv; cancelPlus [-0x1.FFFFFFFFFFFFFp1023,0X1.FFFFFFFFFFFFEP+1023]_com [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com = [entire]_trv; cancelPlus [-0X1.FFFFFFFFFFFFEP+1023,0x1.FFFFFFFFFFFFFp1023]_com [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com = [entire]_trv; cancelPlus [-0X1P+0,0X1.FFFFFFFFFFFFFP-53]_dac [-0X1P+0,0X1.FFFFFFFFFFFFEP-53]_com = [-0X1.FFFFFFFFFFFFFP-1,-0X1.FFFFFFFFFFFFEP-1]_trv; cancelPlus [-0X1P+0,0X1.FFFFFFFFFFFFEP-53]_def [-0X1P+0,0X1.FFFFFFFFFFFFFP-53]_com = [entire]_trv; } testcase minimal_cancelMinus_test { cancelMinus [-infinity, -1.0] [empty] = [entire]; cancelMinus [-1.0, infinity] [empty] = [entire]; cancelMinus [entire] [empty] = [entire]; cancelMinus [-infinity, -1.0] [-1.0,5.0] = [entire]; cancelMinus [-1.0, infinity] [-1.0,5.0] = [entire]; cancelMinus [entire] [-1.0,5.0] = [entire]; cancelMinus [-infinity, -1.0] [entire] = [entire]; cancelMinus [-1.0, infinity] [entire] = [entire]; cancelMinus [empty] [-infinity, -1.0] = [entire]; cancelMinus [empty] [-1.0, infinity] = [entire]; cancelMinus [empty] [entire] = [entire]; cancelMinus [-1.0,5.0] [-infinity, -1.0] = [entire]; cancelMinus [-1.0,5.0] [-1.0, infinity] = [entire]; cancelMinus [-1.0,5.0] [entire] = [entire]; cancelMinus [entire] [-infinity, -1.0] = [entire]; cancelMinus [entire] [-1.0, infinity] = [entire]; cancelMinus [entire] [entire] = [entire]; cancelMinus [-5.0, -1.0] [-5.1,-1.0] = [entire]; cancelMinus [-5.0, -1.0] [-5.0,-0.9] = [entire]; cancelMinus [-5.0, -1.0] [-5.1,-0.9] = [entire]; cancelMinus [-10.0, 5.0] [-10.1, 5.0] = [entire]; cancelMinus [-10.0, 5.0] [-10.0, 5.1] = [entire]; cancelMinus [-10.0, 5.0] [-10.1, 5.1] = [entire]; cancelMinus [1.0, 5.0] [0.9, 5.0] = [entire]; cancelMinus [1.0, 5.0] [1.0, 5.1] = [entire]; cancelMinus [1.0, 5.0] [0.9, 5.1] = [entire]; cancelMinus [-10.0, -1.0] [empty] = [entire]; cancelMinus [-10.0, 5.0] [empty] = [entire]; cancelMinus [1.0, 5.0] [empty] = [entire]; cancelMinus [empty] [empty] = [empty]; cancelMinus [empty] [-10.0, -1.0] = [empty]; cancelMinus [empty] [-10.0, 5.0] = [empty]; cancelMinus [empty] [1.0, 5.0] = [empty]; cancelMinus [-5.1,-0.0] [-5.0, 0.0] = [-0X1.999999999998P-4,0.0]; cancelMinus [-5.1,-1.0] [-5.0, -1.0] = [-0X1.999999999998P-4,0.0]; cancelMinus [-5.0,-0.9] [-5.0, -1.0] = [0.0, 0X1.9999999999998P-4]; cancelMinus [-5.1,-0.9] [-5.0, -1.0] = [-0X1.999999999998P-4,0X1.9999999999998P-4]; cancelMinus [-5.0,-1.0] [-5.0, -1.0] = [0.0,0.0]; cancelMinus [-10.1, 5.0] [-10.0, 5.0] = [-0X1.999999999998P-4,0.0]; cancelMinus [-10.0, 5.1] [-10.0, 5.0] = [0.0,0X1.999999999998P-4]; cancelMinus [-10.1, 5.1] [-10.0, 5.0] = [-0X1.999999999998P-4,0X1.999999999998P-4]; cancelMinus [-10.0, 5.0] [-10.0, 5.0] = [0.0,0.0]; cancelMinus [0.9, 5.0] [1.0, 5.0] = [-0X1.9999999999998P-4,0.0]; cancelMinus [-0.0, 5.1] [0.0, 5.0] = [0.0,0X1.999999999998P-4]; cancelMinus [1.0, 5.1] [1.0, 5.0] = [0.0,0X1.999999999998P-4]; cancelMinus [0.9, 5.1] [1.0, 5.0] = [-0X1.9999999999998P-4,0X1.999999999998P-4]; cancelMinus [1.0, 5.0] [1.0, 5.0] = [0.0,0.0]; cancelMinus [-5.0, 1.0] [-1.0, 5.0] = [-4.0,-4.0]; cancelMinus [-5.0, 0.0] [-0.0, 5.0] = [-5.0,-5.0]; cancelMinus [0X1.FFFFFFFFFFFFP+0,0X1.FFFFFFFFFFFFP+0] [0X1.999999999999AP-4,0X1.999999999999AP-4] = [0X1.E666666666656P+0,0X1.E666666666657P+0]; cancelMinus [-0X1.999999999999AP-4,0X1.FFFFFFFFFFFFP+0] [-0.01,0X1.999999999999AP-4] = [-0X1.70A3D70A3D70BP-4,0X1.E666666666657P+0]; cancelMinus [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] = [0x1.FFFFFFFFFFFFFp1023,infinity]; cancelMinus [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] = [0.0,0.0]; cancelMinus [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] [-0x1.FFFFFFFFFFFFFp1023,0X1.FFFFFFFFFFFFEP+1023] = [0.0,0X1P+971]; cancelMinus [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] [-0X1.FFFFFFFFFFFFEP+1023,0x1.FFFFFFFFFFFFFp1023] = [-0X1P+971,0.0]; cancelMinus [-0x1.FFFFFFFFFFFFFp1023,0X1.FFFFFFFFFFFFEP+1023] [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] = [entire]; cancelMinus [-0X1.FFFFFFFFFFFFEP+1023,0x1.FFFFFFFFFFFFFp1023] [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] = [entire]; cancelMinus [0x0.0000000000001p-1022,0x0.0000000000001p-1022] [0x0.0000000000001p-1022,0x0.0000000000001p-1022] = [0.0,0.0]; cancelMinus [0x0.0000000000001p-1022,0x0.0000000000001p-1022] [-0x0.0000000000001p-1022,-0x0.0000000000001p-1022] = [0x0.0000000000002p-1022,0x0.0000000000002p-1022]; cancelMinus [0X1P-1022,0X1.0000000000002P-1022] [0X1P-1022,0X1.0000000000001P-1022] = [0.0,0X0.0000000000001P-1022]; cancelMinus [0X1P-1022,0X1.0000000000001P-1022] [0X1P-1022,0X1.0000000000002P-1022] = [entire]; cancelMinus [-0X1P+0,0X1.FFFFFFFFFFFFFP-53] [-0X1.FFFFFFFFFFFFEP-53,0X1P+0] = [-0X1.FFFFFFFFFFFFFP-1,-0X1.FFFFFFFFFFFFEP-1]; cancelMinus [-0X1P+0,0X1.FFFFFFFFFFFFEP-53] [-0X1.FFFFFFFFFFFFFP-53,0X1P+0] = [entire]; } testcase minimal_cancelMinus_dec_test { cancelMinus [-infinity, -1.0]_dac [empty]_trv = [entire]_trv; cancelMinus [-1.0, infinity]_def [empty]_trv = [entire]_trv; cancelMinus [entire]_def [empty]_trv = [entire]_trv; cancelMinus [-infinity, -1.0]_trv [-1.0,5.0]_dac = [entire]_trv; cancelMinus [-1.0, infinity]_dac [-1.0,5.0]_com = [entire]_trv; cancelMinus [entire]_def [-1.0,5.0]_def = [entire]_trv; cancelMinus [-infinity, -1.0]_def [entire]_def = [entire]_trv; cancelMinus [-1.0, infinity]_trv [entire]_def = [entire]_trv; cancelMinus [empty]_trv [-infinity, -1.0]_dac = [entire]_trv; cancelMinus [empty]_trv [-1.0, infinity]_dac = [entire]_trv; cancelMinus [empty]_trv [entire]_def = [entire]_trv; cancelMinus [-1.0,5.0]_dac [-infinity, -1.0]_def = [entire]_trv; cancelMinus [-1.0,5.0]_def [-1.0, infinity]_trv = [entire]_trv; cancelMinus [-1.0,5.0]_com [entire]_def = [entire]_trv; cancelMinus [entire]_def [-infinity, -1.0]_dac = [entire]_trv; cancelMinus [entire]_def [-1.0, infinity]_def = [entire]_trv; cancelMinus [entire]_def [entire]_def = [entire]_trv; cancelMinus [-5.0, -1.0]_com [-5.1,-1.0]_trv = [entire]_trv; cancelMinus [-5.0, -1.0]_dac [-5.0,-0.9]_def = [entire]_trv; cancelMinus [-5.0, -1.0]_def [-5.1,-0.9]_dac = [entire]_trv; cancelMinus [-10.0, 5.0]_trv [-10.1, 5.0]_com = [entire]_trv; cancelMinus [-10.0, 5.0]_com [-10.0, 5.1]_com = [entire]_trv; cancelMinus [-10.0, 5.0]_dac [-10.1, 5.1]_trv = [entire]_trv; cancelMinus [1.0, 5.0]_def [0.9, 5.0]_def = [entire]_trv; cancelMinus [1.0, 5.0]_trv [1.0, 5.1]_dac = [entire]_trv; cancelMinus [1.0, 5.0]_com [0.9, 5.1]_dac = [entire]_trv; cancelMinus [-10.0, -1.0]_com [empty]_trv = [entire]_trv; cancelMinus [-10.0, 5.0]_dac [empty]_trv = [entire]_trv; cancelMinus [1.0, 5.0]_def [empty]_trv = [entire]_trv; cancelMinus [empty]_trv [empty]_trv = [empty]_trv; cancelMinus [empty]_trv [-10.0, -1.0]_com = [empty]_trv; cancelMinus [empty]_trv [-10.0, 5.0]_dac = [empty]_trv; cancelMinus [empty]_trv [1.0, 5.0]_def = [empty]_trv; cancelMinus [-5.1,-0.0]_com [-5.0, 0.0]_com = [-0X1.999999999998P-4,0.0]_trv; cancelMinus [-5.1,-1.0]_dac [-5.0, -1.0]_com = [-0X1.999999999998P-4,0.0]_trv; cancelMinus [-5.0,-0.9]_def [-5.0, -1.0]_com = [0.0, 0X1.9999999999998P-4]_trv; cancelMinus [-5.1,-0.9]_trv [-5.0, -1.0]_com = [-0X1.999999999998P-4,0X1.9999999999998P-4]_trv; cancelMinus [-5.0,-1.0]_com [-5.0, -1.0]_dac = [0.0,0.0]_trv; cancelMinus [-10.1, 5.0]_dac [-10.0, 5.0]_dac = [-0X1.999999999998P-4,0.0]_trv; cancelMinus [-10.0, 5.1]_def [-10.0, 5.0]_dac = [0.0,0X1.999999999998P-4]_trv; cancelMinus [-10.1, 5.1]_trv [-10.0, 5.0]_def = [-0X1.999999999998P-4,0X1.999999999998P-4]_trv; cancelMinus [-10.0, 5.0]_com [-10.0, 5.0]_def = [0.0,0.0]_trv; cancelMinus [0.9, 5.0]_dac [1.0, 5.0]_def = [-0X1.9999999999998P-4,0.0]_trv; cancelMinus [-0.0, 5.1]_def [0.0, 5.0]_def = [0.0,0X1.999999999998P-4]_trv; cancelMinus [1.0, 5.1]_trv [1.0, 5.0]_trv = [0.0,0X1.999999999998P-4]_trv; cancelMinus [0.9, 5.1]_com [1.0, 5.0]_trv = [-0X1.9999999999998P-4,0X1.999999999998P-4]_trv; cancelMinus [1.0, 5.0]_dac [1.0, 5.0]_com = [0.0,0.0]_trv; cancelMinus [-5.0, 1.0]_def [-1.0, 5.0]_def = [-4.0,-4.0]_trv; cancelMinus [-5.0, 0.0]_trv [-0.0, 5.0]_trv = [-5.0,-5.0]_trv; cancelMinus [0X1.FFFFFFFFFFFFP+0,0X1.FFFFFFFFFFFFP+0]_com [0X1.999999999999AP-4,0X1.999999999999AP-4]_com = [0X1.E666666666656P+0,0X1.E666666666657P+0]_trv; cancelMinus [-0X1.999999999999AP-4,0X1.FFFFFFFFFFFFP+0]_def [-0.01,0X1.999999999999AP-4]_dac = [-0X1.70A3D70A3D70BP-4,0X1.E666666666657P+0]_trv; cancelMinus [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023]_com = [0x1.FFFFFFFFFFFFFp1023,infinity]_trv; cancelMinus [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com = [0.0,0.0]_trv; cancelMinus [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com [-0x1.FFFFFFFFFFFFFp1023,0X1.FFFFFFFFFFFFEP+1023]_com = [0.0,0X1P+971]_trv; cancelMinus [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com [-0X1.FFFFFFFFFFFFEP+1023,0x1.FFFFFFFFFFFFFp1023]_com = [-0X1P+971,0.0]_trv; cancelMinus [-0x1.FFFFFFFFFFFFFp1023,0X1.FFFFFFFFFFFFEP+1023]_com [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com = [entire]_trv; cancelMinus [-0X1.FFFFFFFFFFFFEP+1023,0x1.FFFFFFFFFFFFFp1023]_com [-0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com = [entire]_trv; cancelMinus [0x0.0000000000001p-1022,0x0.0000000000001p-1022]_com [0x0.0000000000001p-1022,0x0.0000000000001p-1022]_com = [0.0,0.0]_trv; cancelMinus [0x0.0000000000001p-1022,0x0.0000000000001p-1022]_com [-0x0.0000000000001p-1022,-0x0.0000000000001p-1022]_dac = [0x0.0000000000002p-1022,0x0.0000000000002p-1022]_trv; cancelMinus [0X1P-1022,0X1.0000000000002P-1022]_dac [0X1P-1022,0X1.0000000000001P-1022]_dac = [0.0,0X0.0000000000001P-1022]_trv; cancelMinus [0X1P-1022,0X1.0000000000001P-1022]_def [0X1P-1022,0X1.0000000000002P-1022]_com = [entire]_trv; cancelMinus [-0X1P+0,0X1.FFFFFFFFFFFFFP-53]_com [-0X1.FFFFFFFFFFFFEP-53,0X1P+0]_dac = [-0X1.FFFFFFFFFFFFFP-1,-0X1.FFFFFFFFFFFFEP-1]_trv; cancelMinus [-0X1P+0,0X1.FFFFFFFFFFFFEP-53]_def [-0X1.FFFFFFFFFFFFFP-53,0X1P+0]_dac = [entire]_trv; } interval-2.1.0/test/libieeep1788_tests_elem.itl0000644000000000000000000065352213031036767017532 0ustar 00000000000000/* Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) Copyright 2015-2016 Oliver Heimlich Original author: Marco Nehmeier (unit tests in libieeep1788, original license: Apache License 2.0) Converted into portable ITL format by Oliver Heimlich with minor corrections. 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 . */ testcase minimal_pos_test { pos [1.0,2.0] = [1.0,2.0]; pos [empty] = [empty]; pos [entire] = [entire]; pos [1.0,infinity] = [1.0,infinity]; pos [-infinity,-1.0] = [-infinity,-1.0]; pos [0.0,2.0] = [0.0,2.0]; pos [-0.0,2.0] = [0.0,2.0]; pos [-2.5,-0.0] = [-2.5,0.0]; pos [-2.5,0.0] = [-2.5,0.0]; pos [-0.0,-0.0] = [0.0,0.0]; pos [0.0,0.0] = [0.0,0.0]; } testcase minimal_pos_dec_test { pos [empty]_trv = [empty]_trv; pos [entire]_def = [entire]_def; pos [1.0, 2.0]_com = [1.0, 2.0]_com; } testcase minimal_neg_test { neg [1.0,2.0] = [-2.0,-1.0]; neg [empty] = [empty]; neg [entire] = [entire]; neg [1.0,infinity] = [-infinity,-1.0]; neg [-infinity,1.0] = [-1.0,infinity]; neg [0.0,2.0] = [-2.0,0.0]; neg [-0.0,2.0] = [-2.0,0.0]; neg [-2.0,0.0] = [0.0,2.0]; neg [-2.0,-0.0] = [0.0,2.0]; neg [0.0,-0.0] = [0.0,0.0]; neg [-0.0,-0.0] = [0.0,0.0]; } testcase minimal_neg_dec_test { neg [empty]_trv = [empty]_trv; neg [entire]_def = [entire]_def; neg [1.0, 2.0]_com = [-2.0, -1.0]_com; } testcase minimal_add_test { add [empty] [empty] = [empty]; add [-1.0,1.0] [empty] = [empty]; add [empty] [-1.0,1.0] = [empty]; add [empty] [entire] = [empty]; add [entire] [empty] = [empty]; add [entire] [-infinity,1.0] = [entire]; add [entire] [-1.0,1.0] = [entire]; add [entire] [-1.0,infinity] = [entire]; add [entire] [entire] = [entire]; add [-infinity,1.0] [entire] = [entire]; add [-1.0,1.0] [entire] = [entire]; add [-1.0,infinity] [entire] = [entire]; add [-infinity,2.0] [-infinity,4.0] = [-infinity,6.0]; add [-infinity,2.0] [3.0,4.0] = [-infinity,6.0]; add [-infinity,2.0] [3.0,infinity] = [entire]; add [1.0,2.0] [-infinity,4.0] = [-infinity,6.0]; add [1.0,2.0] [3.0,4.0] = [4.0,6.0]; add [1.0,2.0] [3.0,infinity] = [4.0,infinity]; add [1.0,infinity] [-infinity,4.0] = [entire]; add [1.0,infinity] [3.0,4.0] = [4.0,infinity]; add [1.0,infinity] [3.0,infinity] = [4.0,infinity]; add [1.0,0x1.FFFFFFFFFFFFFp1023] [3.0,4.0] = [4.0,infinity]; add [-0x1.FFFFFFFFFFFFFp1023,2.0] [-3.0,4.0] = [-infinity,6.0]; add [-0x1.FFFFFFFFFFFFFp1023,2.0] [-3.0,0x1.FFFFFFFFFFFFFp1023] = [entire]; add [1.0,0x1.FFFFFFFFFFFFFp1023] [0.0,0.0] = [1.0,0x1.FFFFFFFFFFFFFp1023]; add [1.0,0x1.FFFFFFFFFFFFFp1023] [-0.0,-0.0] = [1.0,0x1.FFFFFFFFFFFFFp1023]; add [0.0,0.0] [-3.0,4.0] = [-3.0,4.0]; add [-0.0,-0.0] [-3.0,0x1.FFFFFFFFFFFFFp1023] = [-3.0,0x1.FFFFFFFFFFFFFp1023]; add [0X1.FFFFFFFFFFFFP+0,0X1.FFFFFFFFFFFFP+0] [0X1.999999999999AP-4,0X1.999999999999AP-4] = [0X1.0CCCCCCCCCCC4P+1,0X1.0CCCCCCCCCCC5P+1]; add [0X1.FFFFFFFFFFFFP+0,0X1.FFFFFFFFFFFFP+0] [-0X1.999999999999AP-4,-0X1.999999999999AP-4] = [0X1.E666666666656P+0,0X1.E666666666657P+0]; add [-0X1.FFFFFFFFFFFFP+0,0X1.FFFFFFFFFFFFP+0] [0X1.999999999999AP-4,0X1.999999999999AP-4] = [-0X1.E666666666657P+0,0X1.0CCCCCCCCCCC5P+1]; } testcase minimal_add_dec_test { add [1.0,2.0]_com [5.0,7.0]_com = [6.0,9.0]_com; add [1.0,2.0]_com [5.0,7.0]_def = [6.0,9.0]_def; add [1.0,2.0]_com [5.0,0x1.FFFFFFFFFFFFFp1023]_com = [6.0,infinity]_dac; add [-0x1.FFFFFFFFFFFFFp1023,2.0]_com [-0.1, 5.0]_com = [-infinity,7.0]_dac; add [1.0,2.0]_trv [empty]_trv = [empty]_trv; } testcase minimal_sub_test { sub [empty] [empty] = [empty]; sub [-1.0,1.0] [empty] = [empty]; sub [empty] [-1.0,1.0] = [empty]; sub [empty] [entire] = [empty]; sub [entire] [empty] = [empty]; sub [entire] [-infinity,1.0] = [entire]; sub [entire] [-1.0,1.0] = [entire]; sub [entire] [-1.0,infinity] = [entire]; sub [entire] [entire] = [entire]; sub [-infinity,1.0] [entire] = [entire]; sub [-1.0,1.0] [entire] = [entire]; sub [-1.0,infinity] [entire] = [entire]; sub [-infinity,2.0] [-infinity,4.0] = [entire]; sub [-infinity,2.0] [3.0,4.0] = [-infinity,-1.0]; sub [-infinity,2.0] [3.0,infinity] = [-infinity,-1.0]; sub [1.0,2.0] [-infinity,4.0] = [-3.0,infinity]; sub [1.0,2.0] [3.0,4.0] = [-3.0,-1.0]; sub [1.0,2.0] [3.0,infinity] = [-infinity,-1.0]; sub [1.0,infinity] [-infinity,4.0] = [-3.0,infinity]; sub [1.0,infinity] [3.0,4.0] = [-3.0,infinity]; sub [1.0,infinity] [3.0,infinity] = [entire]; sub [1.0,0x1.FFFFFFFFFFFFFp1023] [-3.0,4.0] = [-3.0,infinity]; sub [-0x1.FFFFFFFFFFFFFp1023,2.0] [3.0,4.0] = [-infinity,-1.0]; sub [-0x1.FFFFFFFFFFFFFp1023,2.0] [-0x1.FFFFFFFFFFFFFp1023,4.0] = [entire]; sub [1.0,0x1.FFFFFFFFFFFFFp1023] [0.0,0.0] = [1.0,0x1.FFFFFFFFFFFFFp1023]; sub [1.0,0x1.FFFFFFFFFFFFFp1023] [-0.0,-0.0] = [1.0,0x1.FFFFFFFFFFFFFp1023]; sub [0.0,0.0] [-3.0,4.0] = [-4.0,3.0]; sub [-0.0,-0.0] [-3.0,0x1.FFFFFFFFFFFFFp1023] = [-0x1.FFFFFFFFFFFFFp1023,3.0]; sub [0X1.FFFFFFFFFFFFP+0,0X1.FFFFFFFFFFFFP+0] [0X1.999999999999AP-4,0X1.999999999999AP-4] = [0X1.E666666666656P+0,0X1.E666666666657P+0]; sub [0X1.FFFFFFFFFFFFP+0,0X1.FFFFFFFFFFFFP+0] [-0X1.999999999999AP-4,-0X1.999999999999AP-4] = [0X1.0CCCCCCCCCCC4P+1,0X1.0CCCCCCCCCCC5P+1]; sub [-0X1.FFFFFFFFFFFFP+0,0X1.FFFFFFFFFFFFP+0] [0X1.999999999999AP-4,0X1.999999999999AP-4] = [-0X1.0CCCCCCCCCCC5P+1,0X1.E666666666657P+0]; } testcase minimal_sub_dec_test { sub [1.0,2.0]_com [5.0,7.0]_com = [-6.0,-3.0]_com; sub [1.0,2.0]_com [5.0,7.0]_def = [-6.0,-3.0]_def; sub [-1.0,2.0]_com [5.0,0x1.FFFFFFFFFFFFFp1023]_com = [-infinity,-3.0]_dac; sub [-0x1.FFFFFFFFFFFFFp1023,2.0]_com [-1.0, 5.0]_com = [-infinity,3.0]_dac; sub [1.0,2.0]_trv [empty]_trv = [empty]_trv; } testcase minimal_mul_test { mul [empty] [empty] = [empty]; mul [-1.0,1.0] [empty] = [empty]; mul [empty] [-1.0,1.0] = [empty]; mul [empty] [entire] = [empty]; mul [entire] [empty] = [empty]; mul [0.0,0.0] [empty] = [empty]; mul [empty] [0.0,0.0] = [empty]; mul [-0.0,-0.0] [empty] = [empty]; mul [empty] [-0.0,-0.0] = [empty]; mul [entire] [0.0,0.0] = [0.0,0.0]; mul [entire] [-0.0,-0.0] = [0.0,0.0]; mul [entire] [-5.0, -1.0] = [entire]; mul [entire] [-5.0, 3.0] = [entire]; mul [entire] [1.0, 3.0] = [entire]; mul [entire] [-infinity, -1.0] = [entire]; mul [entire] [-infinity, 3.0] = [entire]; mul [entire] [-5.0, infinity] = [entire]; mul [entire] [1.0, infinity] = [entire]; mul [entire] [entire] = [entire]; mul [1.0,infinity] [0.0,0.0] = [0.0,0.0]; mul [1.0,infinity] [-0.0,-0.0] = [0.0,0.0]; mul [1.0,infinity] [-5.0, -1.0] = [-infinity,-1.0]; mul [1.0,infinity] [-5.0, 3.0] = [entire]; mul [1.0,infinity] [1.0, 3.0] = [1.0,infinity]; mul [1.0,infinity] [-infinity, -1.0] = [-infinity,-1.0]; mul [1.0,infinity] [-infinity, 3.0] = [entire]; mul [1.0,infinity] [-5.0, infinity] = [entire]; mul [1.0,infinity] [1.0, infinity] = [1.0,infinity]; mul [1.0,infinity] [entire] = [entire]; mul [-1.0,infinity] [0.0,0.0] = [0.0,0.0]; mul [-1.0,infinity] [-0.0,-0.0] = [0.0,0.0]; mul [-1.0,infinity] [-5.0, -1.0] = [-infinity,5.0]; mul [-1.0,infinity] [-5.0, 3.0] = [entire]; mul [-1.0,infinity] [1.0, 3.0] = [-3.0,infinity]; mul [-1.0,infinity] [-infinity, -1.0] = [entire]; mul [-1.0,infinity] [-infinity, 3.0] = [entire]; mul [-1.0,infinity] [-5.0, infinity] = [entire]; mul [-1.0,infinity] [1.0, infinity] = [entire]; mul [-1.0,infinity] [entire] = [entire]; mul [-infinity,3.0] [0.0,0.0] = [0.0,0.0]; mul [-infinity,3.0] [-0.0,-0.0] = [0.0,0.0]; mul [-infinity,3.0] [-5.0, -1.0] = [-15.0,infinity]; mul [-infinity,3.0] [-5.0, 3.0] = [entire]; mul [-infinity,3.0] [1.0, 3.0] = [-infinity,9.0]; mul [-infinity,3.0] [-infinity, -1.0] = [entire]; mul [-infinity,3.0] [-infinity, 3.0] = [entire]; mul [-infinity,3.0] [-5.0, infinity] = [entire]; mul [-infinity,3.0] [1.0, infinity] = [entire]; mul [-infinity,3.0] [entire] = [entire]; mul [-infinity,-3.0] [0.0,0.0] = [0.0,0.0]; mul [-infinity,-3.0] [-0.0,-0.0] = [0.0,0.0]; mul [-infinity,-3.0] [-5.0, -1.0] = [3.0,infinity]; mul [-infinity,-3.0] [-5.0, 3.0] = [entire]; mul [-infinity,-3.0] [1.0, 3.0] = [-infinity,-3.0]; mul [-infinity,-3.0] [-infinity, -1.0] = [3.0,infinity]; mul [-infinity,-3.0] [-infinity, 3.0] = [entire]; mul [-infinity,-3.0] [-5.0, infinity] = [entire]; mul [-infinity,-3.0] [1.0, infinity] = [-infinity,-3.0]; mul [-infinity,-3.0] [entire] = [entire]; mul [0.0,0.0] [0.0,0.0] = [0.0,0.0]; mul [0.0,0.0] [-0.0,-0.0] = [0.0,0.0]; mul [0.0,0.0] [-5.0, -1.0] = [0.0,0.0]; mul [0.0,0.0] [-5.0, 3.0] = [0.0,0.0]; mul [0.0,0.0] [1.0, 3.0] = [0.0,0.0]; mul [0.0,0.0] [-infinity, -1.0] = [0.0,0.0]; mul [0.0,0.0] [-infinity, 3.0] = [0.0,0.0]; mul [0.0,0.0] [-5.0, infinity] = [0.0,0.0]; mul [0.0,0.0] [1.0, infinity] = [0.0,0.0]; mul [0.0,0.0] [entire] = [0.0,0.0]; mul [-0.0,-0.0] [0.0,0.0] = [0.0,0.0]; mul [-0.0,-0.0] [-0.0,-0.0] = [0.0,0.0]; mul [-0.0,-0.0] [-5.0, -1.0] = [0.0,0.0]; mul [-0.0,-0.0] [-5.0, 3.0] = [0.0,0.0]; mul [-0.0,-0.0] [1.0, 3.0] = [0.0,0.0]; mul [-0.0,-0.0] [-infinity, -1.0] = [0.0,0.0]; mul [-0.0,-0.0] [-infinity, 3.0] = [0.0,0.0]; mul [-0.0,-0.0] [-5.0, infinity] = [0.0,0.0]; mul [-0.0,-0.0] [1.0, infinity] = [0.0,0.0]; mul [-0.0,-0.0] [entire] = [0.0,0.0]; mul [1.0,5.0] [0.0,0.0] = [0.0,0.0]; mul [1.0,5.0] [-0.0,-0.0] = [0.0,0.0]; mul [1.0,5.0] [-5.0, -1.0] = [-25.0,-1.0]; mul [1.0,5.0] [-5.0, 3.0] = [-25.0,15.0]; mul [1.0,5.0] [1.0, 3.0] = [1.0,15.0]; mul [1.0,5.0] [-infinity, -1.0] = [-infinity,-1.0]; mul [1.0,5.0] [-infinity, 3.0] = [-infinity,15.0]; mul [1.0,5.0] [-5.0, infinity] = [-25.0,infinity]; mul [1.0,5.0] [1.0, infinity] = [1.0,infinity]; mul [1.0,5.0] [entire] = [entire]; mul [-1.0,5.0] [0.0,0.0] = [0.0,0.0]; mul [-1.0,5.0] [-0.0,-0.0] = [0.0,0.0]; mul [-1.0,5.0] [-5.0, -1.0] = [-25.0,5.0]; //min max mul [-1.0,5.0] [-5.0, 3.0] = [-25.0,15.0]; mul [-10.0,2.0] [-5.0, 3.0] = [-30.0,50.0]; mul [-1.0,5.0] [-1.0, 10.0] = [-10.0,50.0]; mul [-2.0,2.0] [-5.0, 3.0] = [-10.0,10.0]; //end min max mul [-1.0,5.0] [1.0, 3.0] = [-3.0,15.0]; mul [-1.0,5.0] [-infinity, -1.0] = [entire]; mul [-1.0,5.0] [-infinity, 3.0] = [entire]; mul [-1.0,5.0] [-5.0, infinity] = [entire]; mul [-1.0,5.0] [1.0, infinity] = [entire]; mul [-1.0,5.0] [entire] = [entire]; mul [-10.0,-5.0] [0.0,0.0] = [0.0,0.0]; mul [-10.0,-5.0] [-0.0,-0.0] = [0.0,0.0]; mul [-10.0,-5.0] [-5.0, -1.0] = [5.0,50.0]; mul [-10.0,-5.0] [-5.0, 3.0] = [-30.0,50.0]; mul [-10.0,-5.0] [1.0, 3.0] = [-30.0,-5.0]; mul [-10.0,-5.0] [-infinity, -1.0] = [5.0,infinity]; mul [-10.0,-5.0] [-infinity, 3.0] = [-30.0,infinity]; mul [-10.0,-5.0] [-5.0, infinity] = [-infinity,50.0]; mul [-10.0,-5.0] [1.0, infinity] = [-infinity,-5.0]; mul [-10.0,-5.0] [entire] = [entire]; mul [0X1.999999999999AP-4,0X1.FFFFFFFFFFFFP+0] [-0X1.FFFFFFFFFFFFP+0, infinity] = [-0X1.FFFFFFFFFFFE1P+1,infinity]; mul [-0X1.999999999999AP-4,0X1.FFFFFFFFFFFFP+0] [-0X1.FFFFFFFFFFFFP+0,-0X1.999999999999AP-4] = [-0X1.FFFFFFFFFFFE1P+1,0X1.999999999998EP-3]; mul [-0X1.999999999999AP-4,0X1.999999999999AP-4] [-0X1.FFFFFFFFFFFFP+0,0X1.999999999999AP-4] = [-0X1.999999999998EP-3,0X1.999999999998EP-3]; mul [-0X1.FFFFFFFFFFFFP+0,-0X1.999999999999AP-4] [0X1.999999999999AP-4,0X1.FFFFFFFFFFFFP+0] = [-0X1.FFFFFFFFFFFE1P+1,-0X1.47AE147AE147BP-7]; } testcase minimal_mul_dec_test { mul [1.0,2.0]_com [5.0,7.0]_com = [5.0,14.0]_com; mul [1.0,2.0]_com [5.0,7.0]_def = [5.0,14.0]_def; mul [1.0,2.0]_com [5.0,0x1.FFFFFFFFFFFFFp1023]_com = [5.0,infinity]_dac; mul [-0x1.FFFFFFFFFFFFFp1023,2.0]_com [-1.0, 5.0]_com = [-infinity,0x1.FFFFFFFFFFFFFp1023]_dac; mul [1.0,2.0]_trv [empty]_trv = [empty]_trv; } testcase minimal_div_test { div [empty] [empty] = [empty]; div [-1.0,1.0] [empty] = [empty]; div [empty] [-1.0,1.0] = [empty]; div [empty] [0.1,1.0] = [empty]; div [empty] [-1.0,-0.1] = [empty]; div [empty] [entire] = [empty]; div [entire] [empty] = [empty]; div [0.0,0.0] [empty] = [empty]; div [empty] [0.0,0.0] = [empty]; div [-0.0,-0.0] [empty] = [empty]; div [empty] [-0.0,-0.0] = [empty]; div [entire] [-5.0, -3.0] = [entire]; div [entire] [3.0, 5.0] = [entire]; div [entire] [-infinity, -3.0] = [entire]; div [entire] [3.0,infinity] = [entire]; div [entire] [0.0,0.0] = [empty]; div [entire] [-0.0,-0.0] = [empty]; div [entire] [-3.0, 0.0] = [entire]; div [entire] [-3.0, -0.0] = [entire]; div [entire] [-3.0, 3.0] = [entire]; div [entire] [0.0, 3.0] = [entire]; div [entire] [-infinity, 0.0] = [entire]; div [entire] [-0.0, 3.0] = [entire]; div [entire] [-infinity, -0.0] = [entire]; div [entire] [-infinity, 3.0] = [entire]; div [entire] [-3.0, infinity] = [entire]; div [entire] [0.0, infinity] = [entire]; div [entire] [-0.0, infinity] = [entire]; div [entire] [entire] = [entire]; div [-30.0,-15.0] [-5.0, -3.0] = [3.0,10.0]; div [-30.0,-15.0] [3.0, 5.0] = [-10.0,-3.0]; div [-30.0,-15.0] [-infinity, -3.0] = [0.0,10.0]; div [-30.0,-15.0] [3.0,infinity] = [-10.0,0.0]; div [-30.0,-15.0] [0.0,0.0] = [empty]; div [-30.0,-15.0] [-3.0, 0.0] = [5.0,infinity]; div [-30.0,-15.0] [-0.0,-0.0] = [empty]; div [-30.0,-15.0] [-3.0, -0.0] = [5.0,infinity]; div [-30.0,-15.0] [-3.0, 3.0] = [entire]; div [-30.0,-15.0] [0.0, 3.0] = [-infinity,-5.0]; div [-30.0,-15.0] [-infinity, 0.0] = [0.0,infinity]; div [-30.0,-15.0] [-0.0, 3.0] = [-infinity,-5.0]; div [-30.0,-15.0] [-infinity, -0.0] = [0.0,infinity]; div [-30.0,-15.0] [-infinity, 3.0] = [entire]; div [-30.0,-15.0] [-3.0, infinity] = [entire]; div [-30.0,-15.0] [0.0, infinity] = [-infinity,0.0]; div [-30.0,-15.0] [-0.0, infinity] = [-infinity,0.0]; div [-30.0,-15.0] [entire] = [entire]; div [-30.0,15.0] [-5.0, -3.0] = [-5.0,10.0]; div [-30.0,15.0] [3.0, 5.0] = [-10.0,5.0]; div [-30.0,15.0] [-infinity, -3.0] = [-5.0,10.0]; div [-30.0,15.0] [3.0,infinity] = [-10.0,5.0]; div [-30.0,15.0] [0.0,0.0] = [empty]; div [-30.0,15.0] [-0.0,-0.0] = [empty]; div [-30.0,15.0] [-3.0, 0.0] = [entire]; div [-30.0,15.0] [-3.0, -0.0] = [entire]; div [-30.0,15.0] [-3.0, 3.0] = [entire]; div [-30.0,15.0] [0.0, 3.0] = [entire]; div [-30.0,15.0] [-infinity, 0.0] = [entire]; div [-30.0,15.0] [-0.0, 3.0] = [entire]; div [-30.0,15.0] [-infinity, -0.0] = [entire]; div [-30.0,15.0] [-infinity, 3.0] = [entire]; div [-30.0,15.0] [-3.0, infinity] = [entire]; div [-30.0,15.0] [0.0, infinity] = [entire]; div [-30.0,15.0] [-0.0, infinity] = [entire]; div [-30.0,15.0] [entire] = [entire]; div [15.0,30.0] [-5.0, -3.0] = [-10.0,-3.0]; div [15.0,30.0] [3.0, 5.0] = [3.0,10.0]; div [15.0,30.0] [-infinity, -3.0] = [-10.0,0.0]; div [15.0,30.0] [3.0,infinity] = [0.0,10.0]; div [15.0,30.0] [0.0,0.0] = [empty]; div [15.0,30.0] [-3.0, 0.0] = [-infinity,-5.0]; div [15.0,30.0] [-0.0,-0.0] = [empty]; div [15.0,30.0] [-3.0, -0.0] = [-infinity,-5.0]; div [15.0,30.0] [-3.0, 3.0] = [entire]; div [15.0,30.0] [0.0, 3.0] = [5.0,infinity]; div [15.0,30.0] [-infinity, 0.0] = [-infinity,0.0]; div [15.0,30.0] [-0.0, 3.0] = [5.0,infinity]; div [15.0,30.0] [-infinity, -0.0] = [-infinity,0.0]; div [15.0,30.0] [-infinity, 3.0] = [entire]; div [15.0,30.0] [-3.0, infinity] = [entire]; div [15.0,30.0] [0.0, infinity] = [0.0,infinity]; div [15.0,30.0] [-0.0, infinity] = [0.0,infinity]; div [15.0,30.0] [entire] = [entire]; div [0.0,0.0] [-5.0, -3.0] = [0.0,0.0]; div [0.0,0.0] [3.0, 5.0] = [0.0,0.0]; div [0.0,0.0] [-infinity, -3.0] = [0.0,0.0]; div [0.0,0.0] [3.0,infinity] = [0.0,0.0]; div [0.0,0.0] [0.0,0.0] = [empty]; div [0.0,0.0] [-3.0, 0.0] = [0.0,0.0]; div [0.0,0.0] [-0.0,-0.0] = [empty]; div [0.0,0.0] [-3.0, -0.0] = [0.0,0.0]; div [0.0,0.0] [-3.0, 3.0] = [0.0,0.0]; div [0.0,0.0] [0.0, 3.0] = [0.0,0.0]; div [0.0,0.0] [-infinity, 0.0] = [0.0,0.0]; div [0.0,0.0] [-0.0, 3.0] = [0.0,0.0]; div [0.0,0.0] [-infinity, -0.0] = [0.0,0.0]; div [0.0,0.0] [-infinity, 3.0] = [0.0,0.0]; div [0.0,0.0] [-3.0, infinity] = [0.0,0.0]; div [0.0,0.0] [0.0, infinity] = [0.0,0.0]; div [0.0,0.0] [-0.0, infinity] = [0.0,0.0]; div [0.0,0.0] [entire] = [0.0,0.0]; div [-0.0,-0.0] [-5.0, -3.0] = [0.0,0.0]; div [-0.0,-0.0] [3.0, 5.0] = [0.0,0.0]; div [-0.0,-0.0] [-infinity, -3.0] = [0.0,0.0]; div [-0.0,-0.0] [3.0,infinity] = [0.0,0.0]; div [-0.0,-0.0] [0.0,0.0] = [empty]; div [-0.0,-0.0] [-3.0, 0.0] = [0.0,0.0]; div [-0.0,-0.0] [-0.0,-0.0] = [empty]; div [-0.0,-0.0] [-3.0, -0.0] = [0.0,0.0]; div [-0.0,-0.0] [-3.0, 3.0] = [0.0,0.0]; div [-0.0,-0.0] [0.0, 3.0] = [0.0,0.0]; div [-0.0,-0.0] [-infinity, 0.0] = [0.0,0.0]; div [-0.0,-0.0] [-0.0, 3.0] = [0.0,0.0]; div [-0.0,-0.0] [-infinity, -0.0] = [0.0,0.0]; div [-0.0,-0.0] [-infinity, 3.0] = [0.0,0.0]; div [-0.0,-0.0] [-3.0, infinity] = [0.0,0.0]; div [-0.0,-0.0] [0.0, infinity] = [0.0,0.0]; div [-0.0,-0.0] [-0.0, infinity] = [0.0,0.0]; div [-0.0,-0.0] [entire] = [0.0,0.0]; div [-infinity,-15.0] [-5.0, -3.0] = [3.0,infinity]; div [-infinity,-15.0] [3.0, 5.0] = [-infinity,-3.0]; div [-infinity,-15.0] [-infinity, -3.0] = [0.0,infinity]; div [-infinity,-15.0] [3.0,infinity] = [-infinity,0.0]; div [-infinity,-15.0] [0.0,0.0] = [empty]; div [-infinity,-15.0] [-3.0, 0.0] = [5.0,infinity]; div [-infinity,-15.0] [-0.0,-0.0] = [empty]; div [-infinity,-15.0] [-3.0, -0.0] = [5.0,infinity]; div [-infinity,-15.0] [-3.0, 3.0] = [entire]; div [-infinity,-15.0] [0.0, 3.0] = [-infinity,-5.0]; div [-infinity,-15.0] [-infinity, 0.0] = [0.0,infinity]; div [-infinity,-15.0] [-0.0, 3.0] = [-infinity,-5.0]; div [-infinity,-15.0] [-infinity, -0.0] = [0.0,infinity]; div [-infinity,-15.0] [-infinity, 3.0] = [entire]; div [-infinity,-15.0] [-3.0, infinity] = [entire]; div [-infinity,-15.0] [0.0, infinity] = [-infinity,0.0]; div [-infinity,-15.0] [-0.0, infinity] = [-infinity,0.0]; div [-infinity,-15.0] [entire] = [entire]; div [-infinity,15.0] [-5.0, -3.0] = [-5.0,infinity]; div [-infinity,15.0] [3.0, 5.0] = [-infinity,5.0]; div [-infinity,15.0] [-infinity, -3.0] = [-5.0,infinity]; div [-infinity,15.0] [3.0,infinity] = [-infinity,5.0]; div [-infinity,15.0] [0.0,0.0] = [empty]; div [-infinity,15.0] [-3.0, 0.0] = [entire]; div [-infinity,15.0] [-0.0,-0.0] = [empty]; div [-infinity,15.0] [-3.0, -0.0] = [entire]; div [-infinity,15.0] [-3.0, 3.0] = [entire]; div [-infinity,15.0] [0.0, 3.0] = [entire]; div [-infinity,15.0] [-infinity, 0.0] = [entire]; div [-infinity,15.0] [-0.0, 3.0] = [entire]; div [-infinity,15.0] [-infinity, -0.0] = [entire]; div [-infinity,15.0] [-infinity, 3.0] = [entire]; div [-infinity,15.0] [-3.0, infinity] = [entire]; div [-infinity,15.0] [0.0, infinity] = [entire]; div [-infinity,15.0] [-0.0, infinity] = [entire]; div [-infinity,15.0] [entire] = [entire]; div [-15.0,infinity] [-5.0, -3.0] = [-infinity,5.0]; div [-15.0,infinity] [3.0, 5.0] = [-5.0,infinity]; div [-15.0,infinity] [-infinity, -3.0] = [-infinity,5.0]; div [-15.0,infinity] [3.0,infinity] = [-5.0,infinity]; div [-15.0,infinity] [0.0,0.0] = [empty]; div [-15.0,infinity] [-3.0, 0.0] = [entire]; div [-15.0,infinity] [-0.0,-0.0] = [empty]; div [-15.0,infinity] [-3.0, -0.0] = [entire]; div [-15.0,infinity] [-3.0, 3.0] = [entire]; div [-15.0,infinity] [0.0, 3.0] = [entire]; div [-15.0,infinity] [-infinity, 0.0] = [entire]; div [-15.0,infinity] [-0.0, 3.0] = [entire]; div [-15.0,infinity] [-infinity, -0.0] = [entire]; div [-15.0,infinity] [-infinity, 3.0] = [entire]; div [-15.0,infinity] [-3.0, infinity] = [entire]; div [-15.0,infinity] [0.0, infinity] = [entire]; div [-15.0,infinity] [-0.0, infinity] = [entire]; div [-15.0,infinity] [entire] = [entire]; div [15.0,infinity] [-5.0, -3.0] = [-infinity,-3.0]; div [15.0,infinity] [3.0, 5.0] = [3.0,infinity]; div [15.0,infinity] [-infinity, -3.0] = [-infinity,0.0]; div [15.0,infinity] [3.0,infinity] = [0.0,infinity]; div [15.0,infinity] [0.0,0.0] = [empty]; div [15.0,infinity] [-3.0, 0.0] = [-infinity,-5.0]; div [15.0,infinity] [-0.0,-0.0] = [empty]; div [15.0,infinity] [-3.0, -0.0] = [-infinity,-5.0]; div [15.0,infinity] [-3.0, 3.0] = [entire]; div [15.0,infinity] [0.0, 3.0] = [5.0,infinity]; div [15.0,infinity] [-infinity, 0.0] = [-infinity,0.0]; div [15.0,infinity] [-0.0, 3.0] = [5.0,infinity]; div [15.0,infinity] [-infinity, -0.0] = [-infinity,0.0]; div [15.0,infinity] [-infinity, 3.0] = [entire]; div [15.0,infinity] [-3.0, infinity] = [entire]; div [15.0,infinity] [0.0, infinity] = [0.0,infinity]; div [15.0,infinity] [-0.0, infinity] = [0.0,infinity]; div [15.0,infinity] [entire] = [entire]; div [-30.0,0.0] [-5.0, -3.0] = [0.0,10.0]; div [-30.0,0.0] [3.0, 5.0] = [-10.0,0.0]; div [-30.0,0.0] [-infinity, -3.0] = [0.0,10.0]; div [-30.0,0.0] [3.0,infinity] = [-10.0,0.0]; div [-30.0,0.0] [0.0,0.0] = [empty]; div [-30.0,0.0] [-3.0, 0.0] = [0.0,infinity]; div [-30.0,0.0] [-0.0,-0.0] = [empty]; div [-30.0,0.0] [-3.0, -0.0] = [0.0,infinity]; div [-30.0,0.0] [-3.0, 3.0] = [entire]; div [-30.0,0.0] [0.0, 3.0] = [-infinity,0.0]; div [-30.0,0.0] [-infinity, 0.0] = [0.0,infinity]; div [-30.0,0.0] [-0.0, 3.0] = [-infinity,0.0]; div [-30.0,0.0] [-infinity, -0.0] = [0.0,infinity]; div [-30.0,0.0] [-infinity, 3.0] = [entire]; div [-30.0,0.0] [-3.0, infinity] = [entire]; div [-30.0,0.0] [0.0, infinity] = [-infinity,0.0]; div [-30.0,0.0] [-0.0, infinity] = [-infinity,0.0]; div [-30.0,0.0] [entire] = [entire]; div [-30.0,-0.0] [-5.0, -3.0] = [0.0,10.0]; div [-30.0,-0.0] [3.0, 5.0] = [-10.0,0.0]; div [-30.0,-0.0] [-infinity, -3.0] = [0.0,10.0]; div [-30.0,-0.0] [3.0,infinity] = [-10.0,0.0]; div [-30.0,-0.0] [0.0,0.0] = [empty]; div [-30.0,-0.0] [-3.0, 0.0] = [0.0,infinity]; div [-30.0,-0.0] [-0.0,-0.0] = [empty]; div [-30.0,-0.0] [-3.0, -0.0] = [0.0,infinity]; div [-30.0,-0.0] [-3.0, 3.0] = [entire]; div [-30.0,-0.0] [0.0, 3.0] = [-infinity,0.0]; div [-30.0,-0.0] [-infinity, 0.0] = [0.0,infinity]; div [-30.0,-0.0] [-0.0, 3.0] = [-infinity,0.0]; div [-30.0,-0.0] [-infinity, -0.0] = [0.0,infinity]; div [-30.0,-0.0] [-infinity, 3.0] = [entire]; div [-30.0,-0.0] [-3.0, infinity] = [entire]; div [-30.0,-0.0] [0.0, infinity] = [-infinity,0.0]; div [-30.0,-0.0] [-0.0, infinity] = [-infinity,0.0]; div [-30.0,-0.0] [entire] = [entire]; div [0.0,30.0] [-5.0, -3.0] = [-10.0,0.0]; div [0.0,30.0] [3.0, 5.0] = [0.0,10.0]; div [0.0,30.0] [-infinity, -3.0] = [-10.0,0.0]; div [0.0,30.0] [3.0,infinity] = [0.0,10.0]; div [0.0,30.0] [0.0,0.0] = [empty]; div [0.0,30.0] [-3.0, 0.0] = [-infinity,0.0]; div [0.0,30.0] [-0.0,-0.0] = [empty]; div [0.0,30.0] [-3.0, -0.0] = [-infinity,0.0]; div [0.0,30.0] [-3.0, 3.0] = [entire]; div [0.0,30.0] [0.0, 3.0] = [0.0,infinity]; div [0.0,30.0] [-infinity, 0.0] = [-infinity,0.0]; div [0.0,30.0] [-0.0, 3.0] = [0.0,infinity]; div [0.0,30.0] [-infinity, -0.0] = [-infinity,0.0]; div [0.0,30.0] [-infinity, 3.0] = [entire]; div [0.0,30.0] [-3.0, infinity] = [entire]; div [0.0,30.0] [0.0, infinity] = [0.0,infinity]; div [0.0,30.0] [-0.0, infinity] = [0.0,infinity]; div [0.0,30.0] [entire] = [entire]; div [-0.0,30.0] [-5.0, -3.0] = [-10.0,0.0]; div [-0.0,30.0] [3.0, 5.0] = [0.0,10.0]; div [-0.0,30.0] [-infinity, -3.0] = [-10.0,0.0]; div [-0.0,30.0] [3.0,infinity] = [0.0,10.0]; div [-0.0,30.0] [0.0,0.0] = [empty]; div [-0.0,30.0] [-3.0, 0.0] = [-infinity,0.0]; div [-0.0,30.0] [-0.0,-0.0] = [empty]; div [-0.0,30.0] [-3.0, -0.0] = [-infinity,0.0]; div [-0.0,30.0] [-3.0, 3.0] = [entire]; div [-0.0,30.0] [0.0, 3.0] = [0.0,infinity]; div [-0.0,30.0] [-infinity, 0.0] = [-infinity,0.0]; div [-0.0,30.0] [-0.0, 3.0] = [0.0,infinity]; div [-0.0,30.0] [-infinity, -0.0] = [-infinity,0.0]; div [-0.0,30.0] [-infinity, 3.0] = [entire]; div [-0.0,30.0] [-3.0, infinity] = [entire]; div [-0.0,30.0] [0.0, infinity] = [0.0,infinity]; div [-0.0,30.0] [-0.0, infinity] = [0.0,infinity]; div [-0.0,30.0] [entire] = [entire]; div [-infinity,0.0] [-5.0, -3.0] = [0.0,infinity]; div [-infinity,0.0] [3.0, 5.0] = [-infinity,0.0]; div [-infinity,0.0] [-infinity, -3.0] = [0.0,infinity]; div [-infinity,0.0] [3.0,infinity] = [-infinity,0.0]; div [-infinity,0.0] [0.0,0.0] = [empty]; div [-infinity,0.0] [-3.0, 0.0] = [0.0,infinity]; div [-infinity,0.0] [-0.0,-0.0] = [empty]; div [-infinity,0.0] [-3.0, -0.0] = [0.0,infinity]; div [-infinity,0.0] [-3.0, 3.0] = [entire]; div [-infinity,0.0] [0.0, 3.0] = [-infinity,0.0]; div [-infinity,0.0] [-infinity, 0.0] = [0.0,infinity]; div [-infinity,0.0] [-0.0, 3.0] = [-infinity,0.0]; div [-infinity,0.0] [-infinity, -0.0] = [0.0,infinity]; div [-infinity,0.0] [-infinity, 3.0] = [entire]; div [-infinity,0.0] [-3.0, infinity] = [entire]; div [-infinity,0.0] [0.0, infinity] = [-infinity,0.0]; div [-infinity,0.0] [-0.0, infinity] = [-infinity,0.0]; div [-infinity,0.0] [entire] = [entire]; div [-infinity,-0.0] [-5.0, -3.0] = [0.0,infinity]; div [-infinity,-0.0] [3.0, 5.0] = [-infinity,0.0]; div [-infinity,-0.0] [-infinity, -3.0] = [0.0,infinity]; div [-infinity,-0.0] [3.0,infinity] = [-infinity,0.0]; div [-infinity,-0.0] [0.0,0.0] = [empty]; div [-infinity,-0.0] [-3.0, 0.0] = [0.0,infinity]; div [-infinity,-0.0] [-0.0,-0.0] = [empty]; div [-infinity,-0.0] [-3.0, -0.0] = [0.0,infinity]; div [-infinity,-0.0] [-3.0, 3.0] = [entire]; div [-infinity,-0.0] [0.0, 3.0] = [-infinity,0.0]; div [-infinity,-0.0] [-infinity, 0.0] = [0.0,infinity]; div [-infinity,-0.0] [-0.0, 3.0] = [-infinity,0.0]; div [-infinity,-0.0] [-infinity, -0.0] = [0.0,infinity]; div [-infinity,-0.0] [-infinity, 3.0] = [entire]; div [-infinity,-0.0] [-3.0, infinity] = [entire]; div [-infinity,-0.0] [0.0, infinity] = [-infinity,0.0]; div [-infinity,-0.0] [-0.0, infinity] = [-infinity,0.0]; div [-infinity,-0.0] [entire] = [entire]; div [0.0,infinity] [-5.0, -3.0] = [-infinity,0.0]; div [0.0,infinity] [3.0, 5.0] = [0.0,infinity]; div [0.0,infinity] [-infinity, -3.0] = [-infinity,0.0]; div [0.0,infinity] [3.0,infinity] = [0.0,infinity]; div [0.0,infinity] [0.0,0.0] = [empty]; div [0.0,infinity] [-3.0, 0.0] = [-infinity,0.0]; div [0.0,infinity] [-0.0,-0.0] = [empty]; div [0.0,infinity] [-3.0, -0.0] = [-infinity,0.0]; div [0.0,infinity] [-3.0, 3.0] = [entire]; div [0.0,infinity] [0.0, 3.0] = [0.0,infinity]; div [0.0,infinity] [-infinity, 0.0] = [-infinity,0.0]; div [0.0,infinity] [-0.0, 3.0] = [0.0,infinity]; div [0.0,infinity] [-infinity, -0.0] = [-infinity,0.0]; div [0.0,infinity] [-infinity, 3.0] = [entire]; div [0.0,infinity] [-3.0, infinity] = [entire]; div [0.0,infinity] [0.0, infinity] = [0.0,infinity]; div [0.0,infinity] [-0.0, infinity] = [0.0,infinity]; div [0.0,infinity] [entire] = [entire]; div [-0.0,infinity] [-5.0, -3.0] = [-infinity,0.0]; div [-0.0,infinity] [3.0, 5.0] = [0.0,infinity]; div [-0.0,infinity] [-infinity, -3.0] = [-infinity,0.0]; div [-0.0,infinity] [3.0,infinity] = [0.0,infinity]; div [-0.0,infinity] [0.0,0.0] = [empty]; div [-0.0,infinity] [-3.0, 0.0] = [-infinity,0.0]; div [-0.0,infinity] [-0.0,-0.0] = [empty]; div [-0.0,infinity] [-3.0, -0.0] = [-infinity,0.0]; div [-0.0,infinity] [-3.0, 3.0] = [entire]; div [-0.0,infinity] [0.0, 3.0] = [0.0,infinity]; div [-0.0,infinity] [-infinity, 0.0] = [-infinity,0.0]; div [-0.0,infinity] [-0.0, 3.0] = [0.0,infinity]; div [-0.0,infinity] [-infinity, -0.0] = [-infinity,0.0]; div [-0.0,infinity] [-infinity, 3.0] = [entire]; div [-0.0,infinity] [-3.0, infinity] = [entire]; div [-0.0,infinity] [0.0, infinity] = [0.0,infinity]; div [-0.0,infinity] [-0.0, infinity] = [0.0,infinity]; div [-0.0,infinity] [entire] = [entire]; div [-2.0,-1.0] [-10.0, -3.0] = [0X1.9999999999999P-4,0X1.5555555555556P-1]; div [-2.0,-1.0] [0.0, 10.0] = [-infinity,-0X1.9999999999999P-4]; div [-2.0,-1.0] [-0.0, 10.0] = [-infinity,-0X1.9999999999999P-4]; div [-1.0,2.0] [10.0,infinity] = [-0X1.999999999999AP-4,0X1.999999999999AP-3]; div [1.0,3.0] [-infinity, -10.0] = [-0X1.3333333333334P-2,0.0]; div [-infinity,-1.0] [1.0, 3.0] = [-infinity,-0X1.5555555555555P-2]; } testcase minimal_div_dec_test { div [-2.0,-1.0]_com [-10.0, -3.0]_com = [0X1.9999999999999P-4,0X1.5555555555556P-1]_com; div [-200.0,-1.0]_com [0x0.0000000000001p-1022, 10.0]_com = [-infinity,-0X1.9999999999999P-4]_dac; div [-2.0,-1.0]_com [0.0, 10.0]_com = [-infinity,-0X1.9999999999999P-4]_trv; div [1.0,3.0]_def [-infinity, -10.0]_dac = [-0X1.3333333333334P-2,0.0]_def; div [1.0,2.0]_trv [empty]_trv = [empty]_trv; } testcase minimal_recip_test { recip [-50.0, -10.0] = [-0X1.999999999999AP-4,-0X1.47AE147AE147AP-6]; recip [10.0, 50.0] = [0X1.47AE147AE147AP-6,0X1.999999999999AP-4]; recip [-infinity, -10.0] = [-0X1.999999999999AP-4,0.0]; recip [10.0,infinity] = [0.0,0X1.999999999999AP-4]; recip [0.0,0.0] = [empty]; recip [-0.0,-0.0] = [empty]; recip [-10.0, 0.0] = [-infinity,-0X1.9999999999999P-4]; recip [-10.0, -0.0] = [-infinity,-0X1.9999999999999P-4]; recip [-10.0, 10.0] = [entire]; recip [0.0, 10.0] = [0X1.9999999999999P-4,infinity]; recip [-0.0, 10.0] = [0X1.9999999999999P-4,infinity]; recip [-infinity, 0.0] = [-infinity,0.0]; recip [-infinity, -0.0] = [-infinity,0.0]; recip [-infinity, 10.0] = [entire]; recip [-10.0, infinity] = [entire]; recip [0.0, infinity] = [0.0,infinity]; recip [-0.0, infinity] = [0.0,infinity]; recip [entire] = [entire]; } testcase minimal_recip_dec_test { recip [10.0, 50.0]_com = [0X1.47AE147AE147AP-6,0X1.999999999999AP-4]_com; recip [-infinity, -10.0]_dac = [-0X1.999999999999AP-4,0.0]_dac; recip [-0x1.FFFFFFFFFFFFFp1023, -0x0.0000000000001p-1022]_def = [-infinity,-0X0.4P-1022]_def; recip [0.0,0.0]_com = [empty]_trv; recip [-10.0, 0.0]_com = [-infinity,-0X1.9999999999999P-4]_trv; recip [-10.0, infinity]_dac = [entire]_trv; recip [-0.0, infinity]_dac = [0.0,infinity]_trv; recip [entire]_def = [entire]_trv; } testcase minimal_sqr_test { sqr [empty] = [empty]; sqr [entire] = [0.0,infinity]; sqr [-infinity,-0x0.0000000000001p-1022] = [0.0,infinity]; sqr [-1.0,1.0] = [0.0,1.0]; sqr [0.0,1.0] = [0.0,1.0]; sqr [-0.0,1.0] = [0.0,1.0]; sqr [-5.0,3.0] = [0.0,25.0]; sqr [-5.0,0.0] = [0.0,25.0]; sqr [-5.0,-0.0] = [0.0,25.0]; sqr [0X1.999999999999AP-4,0X1.999999999999AP-4] = [0X1.47AE147AE147BP-7,0X1.47AE147AE147CP-7]; sqr [-0X1.FFFFFFFFFFFFP+0,0X1.999999999999AP-4] = [0.0,0X1.FFFFFFFFFFFE1P+1]; sqr [-0X1.FFFFFFFFFFFFP+0,-0X1.FFFFFFFFFFFFP+0] = [0X1.FFFFFFFFFFFEP+1,0X1.FFFFFFFFFFFE1P+1]; } testcase minimal_sqr_dec_test { sqr [-0x1.FFFFFFFFFFFFFp1023,-0x0.0000000000001p-1022]_com = [0.0,infinity]_dac; sqr [-1.0,1.0]_def = [0.0,1.0]_def; sqr [-5.0,3.0]_com = [0.0,25.0]_com; sqr [0X1.999999999999AP-4,0X1.999999999999AP-4]_com = [0X1.47AE147AE147BP-7,0X1.47AE147AE147CP-7]_com; } testcase minimal_sqrt_test { sqrt [empty] = [empty]; sqrt [entire] = [0.0,infinity]; sqrt [-infinity,-0x0.0000000000001p-1022] = [empty]; sqrt [-1.0,1.0] = [0.0,1.0]; sqrt [0.0,1.0] = [0.0,1.0]; sqrt [-0.0,1.0] = [0.0,1.0]; sqrt [-5.0,25.0] = [0.0,5.0]; sqrt [0.0,25.0] = [0.0,5.0]; sqrt [-0.0,25.0] = [0.0,5.0]; sqrt [-5.0,infinity] = [0.0,infinity]; sqrt [0X1.999999999999AP-4,0X1.999999999999AP-4] = [0X1.43D136248490FP-2,0X1.43D136248491P-2]; sqrt [-0X1.FFFFFFFFFFFFP+0,0X1.999999999999AP-4] = [0.0,0X1.43D136248491P-2]; sqrt [0X1.999999999999AP-4,0X1.FFFFFFFFFFFFP+0] = [0X1.43D136248490FP-2,0X1.6A09E667F3BC7P+0]; } testcase minimal_sqrt_dec_test { sqrt [1.0,4.0]_com = [1.0,2.0]_com; sqrt [-5.0,25.0]_com = [0.0,5.0]_trv; sqrt [0.0,25.0]_def = [0.0,5.0]_def; sqrt [-5.0,infinity]_dac = [0.0,infinity]_trv; } testcase minimal_fma_test { fma [empty] [empty] [empty] = [empty]; fma [-1.0,1.0] [empty] [empty] = [empty]; fma [empty] [-1.0,1.0] [empty] = [empty]; fma [empty] [entire] [empty] = [empty]; fma [entire] [empty] [empty] = [empty]; fma [0.0,0.0] [empty] [empty] = [empty]; fma [-0.0,-0.0] [empty] [empty] = [empty]; fma [empty] [0.0,0.0] [empty] = [empty]; fma [empty] [-0.0,-0.0] [empty] = [empty]; fma [entire] [0.0,0.0] [empty] = [empty]; fma [entire] [-0.0,-0.0] [empty] = [empty]; fma [entire] [-5.0, -1.0] [empty] = [empty]; fma [entire] [-5.0, 3.0] [empty] = [empty]; fma [entire] [1.0, 3.0] [empty] = [empty]; fma [entire] [-infinity, -1.0] [empty] = [empty]; fma [entire] [-infinity, 3.0] [empty] = [empty]; fma [entire] [-5.0, infinity] [empty] = [empty]; fma [entire] [1.0, infinity] [empty] = [empty]; fma [entire] [entire] [empty] = [empty]; fma [1.0,infinity] [0.0,0.0] [empty] = [empty]; fma [1.0,infinity] [-0.0,-0.0] [empty] = [empty]; fma [1.0,infinity] [-5.0, -1.0] [empty] = [empty]; fma [1.0,infinity] [-5.0, 3.0] [empty] = [empty]; fma [1.0,infinity] [1.0, 3.0] [empty] = [empty]; fma [1.0,infinity] [-infinity, -1.0] [empty] = [empty]; fma [1.0,infinity] [-infinity, 3.0] [empty] = [empty]; fma [1.0,infinity] [-5.0, infinity] [empty] = [empty]; fma [1.0,infinity] [1.0, infinity] [empty] = [empty]; fma [1.0,infinity] [entire] [empty] = [empty]; fma [-1.0,infinity] [0.0,0.0] [empty] = [empty]; fma [-1.0,infinity] [-0.0,-0.0] [empty] = [empty]; fma [-1.0,infinity] [-5.0, -1.0] [empty] = [empty]; fma [-1.0,infinity] [-5.0, 3.0] [empty] = [empty]; fma [-1.0,infinity] [1.0, 3.0] [empty] = [empty]; fma [-1.0,infinity] [-infinity, -1.0] [empty] = [empty]; fma [-1.0,infinity] [-infinity, 3.0] [empty] = [empty]; fma [-1.0,infinity] [-5.0, infinity] [empty] = [empty]; fma [-1.0,infinity] [1.0, infinity] [empty] = [empty]; fma [-1.0,infinity] [entire] [empty] = [empty]; fma [-infinity,3.0] [0.0,0.0] [empty] = [empty]; fma [-infinity,3.0] [-0.0,-0.0] [empty] = [empty]; fma [-infinity,3.0] [-5.0, -1.0] [empty] = [empty]; fma [-infinity,3.0] [-5.0, 3.0] [empty] = [empty]; fma [-infinity,3.0] [1.0, 3.0] [empty] = [empty]; fma [-infinity,3.0] [-infinity, -1.0] [empty] = [empty]; fma [-infinity,3.0] [-infinity, 3.0] [empty] = [empty]; fma [-infinity,3.0] [-5.0, infinity] [empty] = [empty]; fma [-infinity,3.0] [1.0, infinity] [empty] = [empty]; fma [-infinity,3.0] [entire] [empty] = [empty]; fma [-infinity,-3.0] [0.0,0.0] [empty] = [empty]; fma [-infinity,-3.0] [-0.0,-0.0] [empty] = [empty]; fma [-infinity,-3.0] [-5.0, -1.0] [empty] = [empty]; fma [-infinity,-3.0] [-5.0, 3.0] [empty] = [empty]; fma [-infinity,-3.0] [1.0, 3.0] [empty] = [empty]; fma [-infinity,-3.0] [-infinity, -1.0] [empty] = [empty]; fma [-infinity,-3.0] [-infinity, 3.0] [empty] = [empty]; fma [-infinity,-3.0] [-5.0, infinity] [empty] = [empty]; fma [-infinity,-3.0] [1.0, infinity] [empty] = [empty]; fma [-infinity,-3.0] [entire] [empty] = [empty]; fma [0.0,0.0] [0.0,0.0] [empty] = [empty]; fma [0.0,0.0] [-0.0,-0.0] [empty] = [empty]; fma [0.0,0.0] [-5.0, -1.0] [empty] = [empty]; fma [0.0,0.0] [-5.0, 3.0] [empty] = [empty]; fma [0.0,0.0] [1.0, 3.0] [empty] = [empty]; fma [0.0,0.0] [-infinity, -1.0] [empty] = [empty]; fma [0.0,0.0] [-infinity, 3.0] [empty] = [empty]; fma [0.0,0.0] [-5.0, infinity] [empty] = [empty]; fma [0.0,0.0] [1.0, infinity] [empty] = [empty]; fma [0.0,0.0] [entire] [empty] = [empty]; fma [-0.0,-0.0] [0.0,0.0] [empty] = [empty]; fma [-0.0,-0.0] [-0.0,-0.0] [empty] = [empty]; fma [-0.0,-0.0] [-5.0, -1.0] [empty] = [empty]; fma [-0.0,-0.0] [-5.0, 3.0] [empty] = [empty]; fma [-0.0,-0.0] [1.0, 3.0] [empty] = [empty]; fma [-0.0,-0.0] [-infinity, -1.0] [empty] = [empty]; fma [-0.0,-0.0] [-infinity, 3.0] [empty] = [empty]; fma [-0.0,-0.0] [-5.0, infinity] [empty] = [empty]; fma [-0.0,-0.0] [1.0, infinity] [empty] = [empty]; fma [-0.0,-0.0] [entire] [empty] = [empty]; fma [1.0,5.0] [0.0,0.0] [empty] = [empty]; fma [1.0,5.0] [-0.0,-0.0] [empty] = [empty]; fma [1.0,5.0] [-5.0, -1.0] [empty] = [empty]; fma [1.0,5.0] [-5.0, 3.0] [empty] = [empty]; fma [1.0,5.0] [1.0, 3.0] [empty] = [empty]; fma [1.0,5.0] [-infinity, -1.0] [empty] = [empty]; fma [1.0,5.0] [-infinity, 3.0] [empty] = [empty]; fma [1.0,5.0] [-5.0, infinity] [empty] = [empty]; fma [1.0,5.0] [1.0, infinity] [empty] = [empty]; fma [1.0,5.0] [entire] [empty] = [empty]; fma [-1.0,5.0] [0.0,0.0] [empty] = [empty]; fma [-1.0,5.0] [-0.0,-0.0] [empty] = [empty]; fma [-1.0,5.0] [-5.0, -1.0] [empty] = [empty]; //min max fma [-1.0,5.0] [-5.0, 3.0] [empty] = [empty]; fma [-10.0,2.0] [-5.0, 3.0] [empty] = [empty]; fma [-1.0,5.0] [-1.0, 10.0] [empty] = [empty]; fma [-2.0,2.0] [-5.0, 3.0] [empty] = [empty]; //end min max fma [-1.0,5.0] [1.0, 3.0] [empty] = [empty]; fma [-1.0,5.0] [-infinity, -1.0] [empty] = [empty]; fma [-1.0,5.0] [-infinity, 3.0] [empty] = [empty]; fma [-1.0,5.0] [-5.0, infinity] [empty] = [empty]; fma [-1.0,5.0] [1.0, infinity] [empty] = [empty]; fma [-1.0,5.0] [entire] [empty] = [empty]; fma [-10.0,-5.0] [0.0,0.0] [empty] = [empty]; fma [-10.0,-5.0] [-0.0,-0.0] [empty] = [empty]; fma [-10.0,-5.0] [-5.0, -1.0] [empty] = [empty]; fma [-10.0,-5.0] [-5.0, 3.0] [empty] = [empty]; fma [-10.0,-5.0] [1.0, 3.0] [empty] = [empty]; fma [-10.0,-5.0] [-infinity, -1.0] [empty] = [empty]; fma [-10.0,-5.0] [-infinity, 3.0] [empty] = [empty]; fma [-10.0,-5.0] [-5.0, infinity] [empty] = [empty]; fma [-10.0,-5.0] [1.0, infinity] [empty] = [empty]; fma [-10.0,-5.0] [entire] [empty] = [empty]; fma [empty] [empty] [-infinity,2.0] = [empty]; fma [-1.0,1.0] [empty] [-infinity,2.0] = [empty]; fma [empty] [-1.0,1.0] [-infinity,2.0] = [empty]; fma [empty] [entire] [-infinity,2.0] = [empty]; fma [entire] [empty] [-infinity,2.0] = [empty]; fma [0.0,0.0] [empty] [-infinity,2.0] = [empty]; fma [-0.0,-0.0] [empty] [-infinity,2.0] = [empty]; fma [empty] [0.0,0.0] [-infinity,2.0] = [empty]; fma [empty] [-0.0,-0.0] [-infinity,2.0] = [empty]; fma [entire] [0.0,0.0] [-infinity,2.0] = [-infinity,2.0]; fma [entire] [-0.0,-0.0] [-infinity,2.0] = [-infinity,2.0]; fma [entire] [-5.0, -1.0] [-infinity,2.0] = [entire]; fma [entire] [-5.0, 3.0] [-infinity,2.0] = [entire]; fma [entire] [1.0, 3.0] [-infinity,2.0] = [entire]; fma [entire] [-infinity, -1.0] [-infinity,2.0] = [entire]; fma [entire] [-infinity, 3.0] [-infinity,2.0] = [entire]; fma [entire] [-5.0, infinity] [-infinity,2.0] = [entire]; fma [entire] [1.0, infinity] [-infinity,2.0] = [entire]; fma [entire] [entire] [-infinity,2.0] = [entire]; fma [1.0,infinity] [0.0,0.0] [-infinity,2.0] = [-infinity,2.0]; fma [1.0,infinity] [-0.0,-0.0] [-infinity,2.0] = [-infinity,2.0]; fma [1.0,infinity] [-5.0, -1.0] [-infinity,2.0] = [-infinity,1.0]; fma [1.0,infinity] [-5.0, 3.0] [-infinity,2.0] = [entire]; fma [1.0,infinity] [1.0, 3.0] [-infinity,2.0] = [entire]; fma [1.0,infinity] [-infinity, -1.0] [-infinity,2.0] = [-infinity,1.0]; fma [1.0,infinity] [-infinity, 3.0] [-infinity,2.0] = [entire]; fma [1.0,infinity] [-5.0, infinity] [-infinity,2.0] = [entire]; fma [1.0,infinity] [1.0, infinity] [-infinity,2.0] = [entire]; fma [1.0,infinity] [entire] [-infinity,2.0] = [entire]; fma [-1.0,infinity] [0.0,0.0] [-infinity,2.0] = [-infinity,2.0]; fma [-1.0,infinity] [-0.0,-0.0] [-infinity,2.0] = [-infinity,2.0]; fma [-1.0,infinity] [-5.0, -1.0] [-infinity,2.0] = [-infinity,7.0]; fma [-1.0,infinity] [-5.0, 3.0] [-infinity,2.0] = [entire]; fma [-1.0,infinity] [1.0, 3.0] [-infinity,2.0] = [entire]; fma [-1.0,infinity] [-infinity, -1.0] [-infinity,2.0] = [entire]; fma [-1.0,infinity] [-infinity, 3.0] [-infinity,2.0] = [entire]; fma [-1.0,infinity] [-5.0, infinity] [-infinity,2.0] = [entire]; fma [-1.0,infinity] [1.0, infinity] [-infinity,2.0] = [entire]; fma [-1.0,infinity] [entire] [-infinity,2.0] = [entire]; fma [-infinity,3.0] [0.0,0.0] [-infinity,2.0] = [-infinity,2.0]; fma [-infinity,3.0] [-0.0,-0.0] [-infinity,2.0] = [-infinity,2.0]; fma [-infinity,3.0] [-5.0, -1.0] [-infinity,2.0] = [entire]; fma [-infinity,3.0] [-5.0, 3.0] [-infinity,2.0] = [entire]; fma [-infinity,3.0] [1.0, 3.0] [-infinity,2.0] = [-infinity,11.0]; fma [-infinity,3.0] [-infinity, -1.0] [-infinity,2.0] = [entire]; fma [-infinity,3.0] [-infinity, 3.0] [-infinity,2.0] = [entire]; fma [-infinity,3.0] [-5.0, infinity] [-infinity,2.0] = [entire]; fma [-infinity,3.0] [1.0, infinity] [-infinity,2.0] = [entire]; fma [-infinity,3.0] [entire] [-infinity,2.0] = [entire]; fma [-infinity,-3.0] [0.0,0.0] [-infinity,2.0] = [-infinity,2.0]; fma [-infinity,-3.0] [-0.0,-0.0] [-infinity,2.0] = [-infinity,2.0]; fma [-infinity,-3.0] [-5.0, -1.0] [-infinity,2.0] = [entire]; fma [-infinity,-3.0] [-5.0, 3.0] [-infinity,2.0] = [entire]; fma [-infinity,-3.0] [1.0, 3.0] [-infinity,2.0] = [-infinity,-1.0]; fma [-infinity,-3.0] [-infinity, -1.0] [-infinity,2.0] = [entire]; fma [-infinity,-3.0] [-infinity, 3.0] [-infinity,2.0] = [entire]; fma [-infinity,-3.0] [-5.0, infinity] [-infinity,2.0] = [entire]; fma [-infinity,-3.0] [1.0, infinity] [-infinity,2.0] = [-infinity,-1.0]; fma [-infinity,-3.0] [entire] [-infinity,2.0] = [entire]; fma [0.0,0.0] [0.0,0.0] [-infinity,2.0] = [-infinity,2.0]; fma [0.0,0.0] [-0.0,-0.0] [-infinity,2.0] = [-infinity,2.0]; fma [0.0,0.0] [-5.0, -1.0] [-infinity,2.0] = [-infinity,2.0]; fma [0.0,0.0] [-5.0, 3.0] [-infinity,2.0] = [-infinity,2.0]; fma [0.0,0.0] [1.0, 3.0] [-infinity,2.0] = [-infinity,2.0]; fma [0.0,0.0] [-infinity, -1.0] [-infinity,2.0] = [-infinity,2.0]; fma [0.0,0.0] [-infinity, 3.0] [-infinity,2.0] = [-infinity,2.0]; fma [0.0,0.0] [-5.0, infinity] [-infinity,2.0] = [-infinity,2.0]; fma [0.0,0.0] [1.0, infinity] [-infinity,2.0] = [-infinity,2.0]; fma [0.0,0.0] [entire] [-infinity,2.0] = [-infinity,2.0]; fma [-0.0,-0.0] [0.0,0.0] [-infinity,2.0] = [-infinity,2.0]; fma [-0.0,-0.0] [-0.0,-0.0] [-infinity,2.0] = [-infinity,2.0]; fma [-0.0,-0.0] [-5.0, -1.0] [-infinity,2.0] = [-infinity,2.0]; fma [-0.0,-0.0] [-5.0, 3.0] [-infinity,2.0] = [-infinity,2.0]; fma [-0.0,-0.0] [1.0, 3.0] [-infinity,2.0] = [-infinity,2.0]; fma [-0.0,-0.0] [-infinity, -1.0] [-infinity,2.0] = [-infinity,2.0]; fma [-0.0,-0.0] [-infinity, 3.0] [-infinity,2.0] = [-infinity,2.0]; fma [-0.0,-0.0] [-5.0, infinity] [-infinity,2.0] = [-infinity,2.0]; fma [-0.0,-0.0] [1.0, infinity] [-infinity,2.0] = [-infinity,2.0]; fma [-0.0,-0.0] [entire] [-infinity,2.0] = [-infinity,2.0]; fma [1.0,5.0] [0.0,0.0] [-infinity,2.0] = [-infinity,2.0]; fma [1.0,5.0] [-0.0,-0.0] [-infinity,2.0] = [-infinity,2.0]; fma [1.0,5.0] [-5.0, -1.0] [-infinity,2.0] = [-infinity,1.0]; fma [1.0,5.0] [-5.0, 3.0] [-infinity,2.0] = [-infinity,17.0]; fma [1.0,5.0] [1.0, 3.0] [-infinity,2.0] = [-infinity,17.0]; fma [1.0,5.0] [-infinity, -1.0] [-infinity,2.0] = [-infinity,1.0]; fma [1.0,5.0] [-infinity, 3.0] [-infinity,2.0] = [-infinity,17.0]; fma [1.0,5.0] [-5.0, infinity] [-infinity,2.0] = [entire]; fma [1.0,5.0] [1.0, infinity] [-infinity,2.0] = [entire]; fma [1.0,5.0] [entire] [-infinity,2.0] = [entire]; fma [-1.0,5.0] [0.0,0.0] [-infinity,2.0] = [-infinity,2.0]; fma [-1.0,5.0] [-0.0,-0.0] [-infinity,2.0] = [-infinity,2.0]; fma [-1.0,5.0] [-5.0, -1.0] [-infinity,2.0] = [-infinity,7.0]; //min max fma [-1.0,5.0] [-5.0, 3.0] [-infinity,2.0] = [-infinity,17.0]; fma [-10.0,2.0] [-5.0, 3.0] [-infinity,2.0] = [-infinity,52.0]; fma [-1.0,5.0] [-1.0, 10.0] [-infinity,2.0] = [-infinity,52.0]; fma [-2.0,2.0] [-5.0, 3.0] [-infinity,2.0] = [-infinity,12.0]; //end min max fma [-1.0,5.0] [1.0, 3.0] [-infinity,2.0] = [-infinity,17.0]; fma [-1.0,5.0] [-infinity, -1.0] [-infinity,2.0] = [entire]; fma [-1.0,5.0] [-infinity, 3.0] [-infinity,2.0] = [entire]; fma [-1.0,5.0] [-5.0, infinity] [-infinity,2.0] = [entire]; fma [-1.0,5.0] [1.0, infinity] [-infinity,2.0] = [entire]; fma [-1.0,5.0] [entire] [-infinity,2.0] = [entire]; fma [-10.0,-5.0] [0.0,0.0] [-infinity,2.0] = [-infinity,2.0]; fma [-10.0,-5.0] [-0.0,-0.0] [-infinity,2.0] = [-infinity,2.0]; fma [-10.0,-5.0] [-5.0, -1.0] [-infinity,2.0] = [-infinity,52.0]; fma [-10.0,-5.0] [-5.0, 3.0] [-infinity,2.0] = [-infinity,52.0]; fma [-10.0,-5.0] [1.0, 3.0] [-infinity,2.0] = [-infinity,-3.0]; fma [-10.0,-5.0] [-infinity, -1.0] [-infinity,2.0] = [entire]; fma [-10.0,-5.0] [-infinity, 3.0] [-infinity,2.0] = [entire]; fma [-10.0,-5.0] [-5.0, infinity] [-infinity,2.0] = [-infinity,52.0]; fma [-10.0,-5.0] [1.0, infinity] [-infinity,2.0] = [-infinity,-3.0]; fma [-10.0,-5.0] [entire] [-infinity,2.0] = [entire]; fma [empty] [empty] [-2.0,2.0] = [empty]; fma [-1.0,1.0] [empty] [-2.0,2.0] = [empty]; fma [empty] [-1.0,1.0] [-2.0,2.0] = [empty]; fma [empty] [entire] [-2.0,2.0] = [empty]; fma [entire] [empty] [-2.0,2.0] = [empty]; fma [0.0,0.0] [empty] [-2.0,2.0] = [empty]; fma [-0.0,-0.0] [empty] [-2.0,2.0] = [empty]; fma [empty] [0.0,0.0] [-2.0,2.0] = [empty]; fma [empty] [-0.0,-0.0] [-2.0,2.0] = [empty]; fma [entire] [0.0,0.0] [-2.0,2.0] = [-2.0,2.0]; fma [entire] [-0.0,-0.0] [-2.0,2.0] = [-2.0,2.0]; fma [entire] [-5.0, -1.0] [-2.0,2.0] = [entire]; fma [entire] [-5.0, 3.0] [-2.0,2.0] = [entire]; fma [entire] [1.0, 3.0] [-2.0,2.0] = [entire]; fma [entire] [-infinity, -1.0] [-2.0,2.0] = [entire]; fma [entire] [-infinity, 3.0] [-2.0,2.0] = [entire]; fma [entire] [-5.0, infinity] [-2.0,2.0] = [entire]; fma [entire] [1.0, infinity] [-2.0,2.0] = [entire]; fma [entire] [entire] [-2.0,2.0] = [entire]; fma [1.0,infinity] [0.0,0.0] [-2.0,2.0] = [-2.0,2.0]; fma [1.0,infinity] [-0.0,-0.0] [-2.0,2.0] = [-2.0,2.0]; fma [1.0,infinity] [-5.0, -1.0] [-2.0,2.0] = [-infinity,1.0]; fma [1.0,infinity] [-5.0, 3.0] [-2.0,2.0] = [entire]; fma [1.0,infinity] [1.0, 3.0] [-2.0,2.0] = [-1.0,infinity]; fma [1.0,infinity] [-infinity, -1.0] [-2.0,2.0] = [-infinity,1.0]; fma [1.0,infinity] [-infinity, 3.0] [-2.0,2.0] = [entire]; fma [1.0,infinity] [-5.0, infinity] [-2.0,2.0] = [entire]; fma [1.0,infinity] [1.0, infinity] [-2.0,2.0] = [-1.0,infinity]; fma [1.0,infinity] [entire] [-2.0,2.0] = [entire]; fma [-1.0,infinity] [0.0,0.0] [-2.0,2.0] = [-2.0,2.0]; fma [-1.0,infinity] [-0.0,-0.0] [-2.0,2.0] = [-2.0,2.0]; fma [-1.0,infinity] [-5.0, -1.0] [-2.0,2.0] = [-infinity,7.0]; fma [-1.0,infinity] [-5.0, 3.0] [-2.0,2.0] = [entire]; fma [-1.0,infinity] [1.0, 3.0] [-2.0,2.0] = [-5.0,infinity]; fma [-1.0,infinity] [-infinity, -1.0] [-2.0,2.0] = [entire]; fma [-1.0,infinity] [-infinity, 3.0] [-2.0,2.0] = [entire]; fma [-1.0,infinity] [-5.0, infinity] [-2.0,2.0] = [entire]; fma [-1.0,infinity] [1.0, infinity] [-2.0,2.0] = [entire]; fma [-1.0,infinity] [entire] [-2.0,2.0] = [entire]; fma [-infinity,3.0] [0.0,0.0] [-2.0,2.0] = [-2.0,2.0]; fma [-infinity,3.0] [-0.0,-0.0] [-2.0,2.0] = [-2.0,2.0]; fma [-infinity,3.0] [-5.0, -1.0] [-2.0,2.0] = [-17.0,infinity]; fma [-infinity,3.0] [-5.0, 3.0] [-2.0,2.0] = [entire]; fma [-infinity,3.0] [1.0, 3.0] [-2.0,2.0] = [-infinity,11.0]; fma [-infinity,3.0] [-infinity, -1.0] [-2.0,2.0] = [entire]; fma [-infinity,3.0] [-infinity, 3.0] [-2.0,2.0] = [entire]; fma [-infinity,3.0] [-5.0, infinity] [-2.0,2.0] = [entire]; fma [-infinity,3.0] [1.0, infinity] [-2.0,2.0] = [entire]; fma [-infinity,3.0] [entire] [-2.0,2.0] = [entire]; fma [-infinity,-3.0] [0.0,0.0] [-2.0,2.0] = [-2.0,2.0]; fma [-infinity,-3.0] [-0.0,-0.0] [-2.0,2.0] = [-2.0,2.0]; fma [-infinity,-3.0] [-5.0, -1.0] [-2.0,2.0] = [1.0,infinity]; fma [-infinity,-3.0] [-5.0, 3.0] [-2.0,2.0] = [entire]; fma [-infinity,-3.0] [1.0, 3.0] [-2.0,2.0] = [-infinity,-1.0]; fma [-infinity,-3.0] [-infinity, -1.0] [-2.0,2.0] = [1.0,infinity]; fma [-infinity,-3.0] [-infinity, 3.0] [-2.0,2.0] = [entire]; fma [-infinity,-3.0] [-5.0, infinity] [-2.0,2.0] = [entire]; fma [-infinity,-3.0] [1.0, infinity] [-2.0,2.0] = [-infinity,-1.0]; fma [-infinity,-3.0] [entire] [-2.0,2.0] = [entire]; fma [0.0,0.0] [0.0,0.0] [-2.0,2.0] = [-2.0,2.0]; fma [0.0,0.0] [-0.0,-0.0] [-2.0,2.0] = [-2.0,2.0]; fma [0.0,0.0] [-5.0, -1.0] [-2.0,2.0] = [-2.0,2.0]; fma [0.0,0.0] [-5.0, 3.0] [-2.0,2.0] = [-2.0,2.0]; fma [0.0,0.0] [1.0, 3.0] [-2.0,2.0] = [-2.0,2.0]; fma [0.0,0.0] [-infinity, -1.0] [-2.0,2.0] = [-2.0,2.0]; fma [0.0,0.0] [-infinity, 3.0] [-2.0,2.0] = [-2.0,2.0]; fma [0.0,0.0] [-5.0, infinity] [-2.0,2.0] = [-2.0,2.0]; fma [0.0,0.0] [1.0, infinity] [-2.0,2.0] = [-2.0,2.0]; fma [0.0,0.0] [entire] [-2.0,2.0] = [-2.0,2.0]; fma [-0.0,-0.0] [0.0,0.0] [-2.0,2.0] = [-2.0,2.0]; fma [-0.0,-0.0] [-0.0,-0.0] [-2.0,2.0] = [-2.0,2.0]; fma [-0.0,-0.0] [-5.0, -1.0] [-2.0,2.0] = [-2.0,2.0]; fma [-0.0,-0.0] [-5.0, 3.0] [-2.0,2.0] = [-2.0,2.0]; fma [-0.0,-0.0] [1.0, 3.0] [-2.0,2.0] = [-2.0,2.0]; fma [-0.0,-0.0] [-infinity, -1.0] [-2.0,2.0] = [-2.0,2.0]; fma [-0.0,-0.0] [-infinity, 3.0] [-2.0,2.0] = [-2.0,2.0]; fma [-0.0,-0.0] [-5.0, infinity] [-2.0,2.0] = [-2.0,2.0]; fma [-0.0,-0.0] [1.0, infinity] [-2.0,2.0] = [-2.0,2.0]; fma [-0.0,-0.0] [entire] [-2.0,2.0] = [-2.0,2.0]; fma [1.0,5.0] [0.0,0.0] [-2.0,2.0] = [-2.0,2.0]; fma [1.0,5.0] [-0.0,-0.0] [-2.0,2.0] = [-2.0,2.0]; fma [1.0,5.0] [-5.0, -1.0] [-2.0,2.0] = [-27.0,1.0]; fma [1.0,5.0] [-5.0, 3.0] [-2.0,2.0] = [-27.0,17.0]; fma [1.0,5.0] [1.0, 3.0] [-2.0,2.0] = [-1.0,17.0]; fma [1.0,5.0] [-infinity, -1.0] [-2.0,2.0] = [-infinity,1.0]; fma [1.0,5.0] [-infinity, 3.0] [-2.0,2.0] = [-infinity,17.0]; fma [1.0,5.0] [-5.0, infinity] [-2.0,2.0] = [-27.0,infinity]; fma [1.0,5.0] [1.0, infinity] [-2.0,2.0] = [-1.0,infinity]; fma [1.0,5.0] [entire] [-2.0,2.0] = [entire]; fma [-1.0,5.0] [0.0,0.0] [-2.0,2.0] = [-2.0,2.0]; fma [-1.0,5.0] [-0.0,-0.0] [-2.0,2.0] = [-2.0,2.0]; fma [-1.0,5.0] [-5.0, -1.0] [-2.0,2.0] = [-27.0,7.0]; //min max fma [-1.0,5.0] [-5.0, 3.0] [-2.0,2.0] = [-27.0,17.0]; fma [-10.0,2.0] [-5.0, 3.0] [-2.0,2.0] = [-32.0,52.0]; fma [-1.0,5.0] [-1.0, 10.0] [-2.0,2.0] = [-12.0,52.0]; fma [-2.0,2.0] [-5.0, 3.0] [-2.0,2.0] = [-12.0,12.0]; //end min max fma [-1.0,5.0] [1.0, 3.0] [-2.0,2.0] = [-5.0,17.0]; fma [-1.0,5.0] [-infinity, -1.0] [-2.0,2.0] = [entire]; fma [-1.0,5.0] [-infinity, 3.0] [-2.0,2.0] = [entire]; fma [-1.0,5.0] [-5.0, infinity] [-2.0,2.0] = [entire]; fma [-1.0,5.0] [1.0, infinity] [-2.0,2.0] = [entire]; fma [-1.0,5.0] [entire] [-2.0,2.0] = [entire]; fma [-10.0,-5.0] [0.0,0.0] [-2.0,2.0] = [-2.0,2.0]; fma [-10.0,-5.0] [-0.0,-0.0] [-2.0,2.0] = [-2.0,2.0]; fma [-10.0,-5.0] [-5.0, -1.0] [-2.0,2.0] = [3.0,52.0]; fma [-10.0,-5.0] [-5.0, 3.0] [-2.0,2.0] = [-32.0,52.0]; fma [-10.0,-5.0] [1.0, 3.0] [-2.0,2.0] = [-32.0,-3.0]; fma [-10.0,-5.0] [-infinity, -1.0] [-2.0,2.0] = [3.0,infinity]; fma [-10.0,-5.0] [-infinity, 3.0] [-2.0,2.0] = [-32.0,infinity]; fma [-10.0,-5.0] [-5.0, infinity] [-2.0,2.0] = [-infinity,52.0]; fma [-10.0,-5.0] [1.0, infinity] [-2.0,2.0] = [-infinity,-3.0]; fma [-10.0,-5.0] [entire] [-2.0,2.0] = [entire]; fma [empty] [empty] [-2.0,infinity] = [empty]; fma [-1.0,1.0] [empty] [-2.0,infinity] = [empty]; fma [empty] [-1.0,1.0] [-2.0,infinity] = [empty]; fma [empty] [entire] [-2.0,infinity] = [empty]; fma [entire] [empty] [-2.0,infinity] = [empty]; fma [0.0,0.0] [empty] [-2.0,infinity] = [empty]; fma [-0.0,-0.0] [empty] [-2.0,infinity] = [empty]; fma [empty] [0.0,0.0] [-2.0,infinity] = [empty]; fma [empty] [-0.0,-0.0] [-2.0,infinity] = [empty]; fma [entire] [0.0,0.0] [-2.0,infinity] = [-2.0,infinity]; fma [entire] [-0.0,-0.0] [-2.0,infinity] = [-2.0,infinity]; fma [entire] [-5.0, -1.0] [-2.0,infinity] = [entire]; fma [entire] [-5.0, 3.0] [-2.0,infinity] = [entire]; fma [entire] [1.0, 3.0] [-2.0,infinity] = [entire]; fma [entire] [-infinity, -1.0] [-2.0,infinity] = [entire]; fma [entire] [-infinity, 3.0] [-2.0,infinity] = [entire]; fma [entire] [-5.0, infinity] [-2.0,infinity] = [entire]; fma [entire] [1.0, infinity] [-2.0,infinity] = [entire]; fma [entire] [entire] [-2.0,infinity] = [entire]; fma [1.0,infinity] [0.0,0.0] [-2.0,infinity] = [-2.0,infinity]; fma [1.0,infinity] [-0.0,-0.0] [-2.0,infinity] = [-2.0,infinity]; fma [1.0,infinity] [-5.0, -1.0] [-2.0,infinity] = [entire]; fma [1.0,infinity] [-5.0, 3.0] [-2.0,infinity] = [entire]; fma [1.0,infinity] [1.0, 3.0] [-2.0,infinity] = [-1.0,infinity]; fma [1.0,infinity] [-infinity, -1.0] [-2.0,infinity] = [entire]; fma [1.0,infinity] [-infinity, 3.0] [-2.0,infinity] = [entire]; fma [1.0,infinity] [-5.0, infinity] [-2.0,infinity] = [entire]; fma [1.0,infinity] [1.0, infinity] [-2.0,infinity] = [-1.0,infinity]; fma [1.0,infinity] [entire] [-2.0,infinity] = [entire]; fma [-1.0,infinity] [0.0,0.0] [-2.0,infinity] = [-2.0,infinity]; fma [-1.0,infinity] [-0.0,-0.0] [-2.0,infinity] = [-2.0,infinity]; fma [-1.0,infinity] [-5.0, -1.0] [-2.0,infinity] = [entire]; fma [-1.0,infinity] [-5.0, 3.0] [-2.0,infinity] = [entire]; fma [-1.0,infinity] [1.0, 3.0] [-2.0,infinity] = [-5.0,infinity]; fma [-1.0,infinity] [-infinity, -1.0] [-2.0,infinity] = [entire]; fma [-1.0,infinity] [-infinity, 3.0] [-2.0,infinity] = [entire]; fma [-1.0,infinity] [-5.0, infinity] [-2.0,infinity] = [entire]; fma [-1.0,infinity] [1.0, infinity] [-2.0,infinity] = [entire]; fma [-1.0,infinity] [entire] [-2.0,infinity] = [entire]; fma [-infinity,3.0] [0.0,0.0] [-2.0,infinity] = [-2.0,infinity]; fma [-infinity,3.0] [-0.0,-0.0] [-2.0,infinity] = [-2.0,infinity]; fma [-infinity,3.0] [-5.0, -1.0] [-2.0,infinity] = [-17.0,infinity]; fma [-infinity,3.0] [-5.0, 3.0] [-2.0,infinity] = [entire]; fma [-infinity,3.0] [1.0, 3.0] [-2.0,infinity] = [entire]; fma [-infinity,3.0] [-infinity, -1.0] [-2.0,infinity] = [entire]; fma [-infinity,3.0] [-infinity, 3.0] [-2.0,infinity] = [entire]; fma [-infinity,3.0] [-5.0, infinity] [-2.0,infinity] = [entire]; fma [-infinity,3.0] [1.0, infinity] [-2.0,infinity] = [entire]; fma [-infinity,3.0] [entire] [-2.0,infinity] = [entire]; fma [-infinity,-3.0] [0.0,0.0] [-2.0,infinity] = [-2.0,infinity]; fma [-infinity,-3.0] [-0.0,-0.0] [-2.0,infinity] = [-2.0,infinity]; fma [-infinity,-3.0] [-5.0, -1.0] [-2.0,infinity] = [1.0,infinity]; fma [-infinity,-3.0] [-5.0, 3.0] [-2.0,infinity] = [entire]; fma [-infinity,-3.0] [1.0, 3.0] [-2.0,infinity] = [entire]; fma [-infinity,-3.0] [-infinity, -1.0] [-2.0,infinity] = [1.0,infinity]; fma [-infinity,-3.0] [-infinity, 3.0] [-2.0,infinity] = [entire]; fma [-infinity,-3.0] [-5.0, infinity] [-2.0,infinity] = [entire]; fma [-infinity,-3.0] [1.0, infinity] [-2.0,infinity] = [entire]; fma [-infinity,-3.0] [entire] [-2.0,infinity] = [entire]; fma [0.0,0.0] [0.0,0.0] [-2.0,infinity] = [-2.0,infinity]; fma [0.0,0.0] [-0.0,-0.0] [-2.0,infinity] = [-2.0,infinity]; fma [0.0,0.0] [-5.0, -1.0] [-2.0,infinity] = [-2.0,infinity]; fma [0.0,0.0] [-5.0, 3.0] [-2.0,infinity] = [-2.0,infinity]; fma [0.0,0.0] [1.0, 3.0] [-2.0,infinity] = [-2.0,infinity]; fma [0.0,0.0] [-infinity, -1.0] [-2.0,infinity] = [-2.0,infinity]; fma [0.0,0.0] [-infinity, 3.0] [-2.0,infinity] = [-2.0,infinity]; fma [0.0,0.0] [-5.0, infinity] [-2.0,infinity] = [-2.0,infinity]; fma [0.0,0.0] [1.0, infinity] [-2.0,infinity] = [-2.0,infinity]; fma [0.0,0.0] [entire] [-2.0,infinity] = [-2.0,infinity]; fma [-0.0,-0.0] [0.0,0.0] [-2.0,infinity] = [-2.0,infinity]; fma [-0.0,-0.0] [-0.0,-0.0] [-2.0,infinity] = [-2.0,infinity]; fma [-0.0,-0.0] [-5.0, -1.0] [-2.0,infinity] = [-2.0,infinity]; fma [-0.0,-0.0] [-5.0, 3.0] [-2.0,infinity] = [-2.0,infinity]; fma [-0.0,-0.0] [1.0, 3.0] [-2.0,infinity] = [-2.0,infinity]; fma [-0.0,-0.0] [-infinity, -1.0] [-2.0,infinity] = [-2.0,infinity]; fma [-0.0,-0.0] [-infinity, 3.0] [-2.0,infinity] = [-2.0,infinity]; fma [-0.0,-0.0] [-5.0, infinity] [-2.0,infinity] = [-2.0,infinity]; fma [-0.0,-0.0] [1.0, infinity] [-2.0,infinity] = [-2.0,infinity]; fma [-0.0,-0.0] [entire] [-2.0,infinity] = [-2.0,infinity]; fma [1.0,5.0] [0.0,0.0] [-2.0,infinity] = [-2.0,infinity]; fma [1.0,5.0] [-0.0,-0.0] [-2.0,infinity] = [-2.0,infinity]; fma [1.0,5.0] [-5.0, -1.0] [-2.0,infinity] = [-27.0,infinity]; fma [1.0,5.0] [-5.0, 3.0] [-2.0,infinity] = [-27.0,infinity]; fma [1.0,5.0] [1.0, 3.0] [-2.0,infinity] = [-1.0,infinity]; fma [1.0,5.0] [-infinity, -1.0] [-2.0,infinity] = [entire]; fma [1.0,5.0] [-infinity, 3.0] [-2.0,infinity] = [entire]; fma [1.0,5.0] [-5.0, infinity] [-2.0,infinity] = [-27.0,infinity]; fma [1.0,5.0] [1.0, infinity] [-2.0,infinity] = [-1.0,infinity]; fma [1.0,5.0] [entire] [-2.0,infinity] = [entire]; fma [-1.0,5.0] [-0.0,-0.0] [-2.0,infinity] = [-2.0,infinity]; fma [-1.0,5.0] [0.0,0.0] [-2.0,infinity] = [-2.0,infinity]; fma [-1.0,5.0] [-5.0, -1.0] [-2.0,infinity] = [-27.0,infinity]; //min max fma [-1.0,5.0] [-5.0, 3.0] [-2.0,infinity] = [-27.0,infinity]; fma [-10.0,2.0] [-5.0, 3.0] [-2.0,infinity] = [-32.0,infinity]; fma [-1.0,5.0] [-1.0, 10.0] [-2.0,infinity] = [-12.0,infinity]; fma [-2.0,2.0] [-5.0, 3.0] [-2.0,infinity] = [-12.0,infinity]; //end min max fma [-1.0,5.0] [1.0, 3.0] [-2.0,infinity] = [-5.0,infinity]; fma [-1.0,5.0] [-infinity, -1.0] [-2.0,infinity] = [entire]; fma [-1.0,5.0] [-infinity, 3.0] [-2.0,infinity] = [entire]; fma [-1.0,5.0] [-5.0, infinity] [-2.0,infinity] = [entire]; fma [-1.0,5.0] [1.0, infinity] [-2.0,infinity] = [entire]; fma [-1.0,5.0] [entire] [-2.0,infinity] = [entire]; fma [-10.0,-5.0] [0.0,0.0] [-2.0,infinity] = [-2.0,infinity]; fma [-10.0,-5.0] [-0.0,-0.0] [-2.0,infinity] = [-2.0,infinity]; fma [-10.0,-5.0] [-5.0, -1.0] [-2.0,infinity] = [3.0,infinity]; fma [-10.0,-5.0] [-5.0, 3.0] [-2.0,infinity] = [-32.0,infinity]; fma [-10.0,-5.0] [1.0, 3.0] [-2.0,infinity] = [-32.0,infinity]; fma [-10.0,-5.0] [-infinity, -1.0] [-2.0,infinity] = [3.0,infinity]; fma [-10.0,-5.0] [-infinity, 3.0] [-2.0,infinity] = [-32.0,infinity]; fma [-10.0,-5.0] [-5.0, infinity] [-2.0,infinity] = [entire]; fma [-10.0,-5.0] [1.0, infinity] [-2.0,infinity] = [entire]; fma [-10.0,-5.0] [entire] [-2.0,infinity] = [entire]; fma [empty] [empty] [entire] = [empty]; fma [-1.0,1.0] [empty] [entire] = [empty]; fma [empty] [-1.0,1.0] [entire] = [empty]; fma [empty] [entire] [entire] = [empty]; fma [entire] [empty] [entire] = [empty]; fma [0.0,0.0] [empty] [entire] = [empty]; fma [-0.0,-0.0] [empty] [entire] = [empty]; fma [empty] [0.0,0.0] [entire] = [empty]; fma [empty] [-0.0,-0.0] [entire] = [empty]; fma [entire] [0.0,0.0] [entire] = [entire]; fma [entire] [-0.0,-0.0] [entire] = [entire]; fma [entire] [-5.0, -1.0] [entire] = [entire]; fma [entire] [-5.0, 3.0] [entire] = [entire]; fma [entire] [1.0, 3.0] [entire] = [entire]; fma [entire] [-infinity, -1.0] [entire] = [entire]; fma [entire] [-infinity, 3.0] [entire] = [entire]; fma [entire] [-5.0, infinity] [entire] = [entire]; fma [entire] [1.0, infinity] [entire] = [entire]; fma [entire] [entire] [entire] = [entire]; fma [1.0,infinity] [0.0,0.0] [entire] = [entire]; fma [1.0,infinity] [-0.0,-0.0] [entire] = [entire]; fma [1.0,infinity] [-5.0, -1.0] [entire] = [entire]; fma [1.0,infinity] [-5.0, 3.0] [entire] = [entire]; fma [1.0,infinity] [1.0, 3.0] [entire] = [entire]; fma [1.0,infinity] [-infinity, -1.0] [entire] = [entire]; fma [1.0,infinity] [-infinity, 3.0] [entire] = [entire]; fma [1.0,infinity] [-5.0, infinity] [entire] = [entire]; fma [1.0,infinity] [1.0, infinity] [entire] = [entire]; fma [1.0,infinity] [entire] [entire] = [entire]; fma [-1.0,infinity] [0.0,0.0] [entire] = [entire]; fma [-1.0,infinity] [-0.0,-0.0] [entire] = [entire]; fma [-1.0,infinity] [-5.0, -1.0] [entire] = [entire]; fma [-1.0,infinity] [-5.0, 3.0] [entire] = [entire]; fma [-1.0,infinity] [1.0, 3.0] [entire] = [entire]; fma [-1.0,infinity] [-infinity, -1.0] [entire] = [entire]; fma [-1.0,infinity] [-infinity, 3.0] [entire] = [entire]; fma [-1.0,infinity] [-5.0, infinity] [entire] = [entire]; fma [-1.0,infinity] [1.0, infinity] [entire] = [entire]; fma [-1.0,infinity] [entire] [entire] = [entire]; fma [-infinity,3.0] [0.0,0.0] [entire] = [entire]; fma [-infinity,3.0] [-0.0,-0.0] [entire] = [entire]; fma [-infinity,3.0] [-5.0, -1.0] [entire] = [entire]; fma [-infinity,3.0] [-5.0, 3.0] [entire] = [entire]; fma [-infinity,3.0] [1.0, 3.0] [entire] = [entire]; fma [-infinity,3.0] [-infinity, -1.0] [entire] = [entire]; fma [-infinity,3.0] [-infinity, 3.0] [entire] = [entire]; fma [-infinity,3.0] [-5.0, infinity] [entire] = [entire]; fma [-infinity,3.0] [1.0, infinity] [entire] = [entire]; fma [-infinity,3.0] [entire] [entire] = [entire]; fma [-infinity,-3.0] [0.0,0.0] [entire] = [entire]; fma [-infinity,-3.0] [-0.0,-0.0] [entire] = [entire]; fma [-infinity,-3.0] [-5.0, -1.0] [entire] = [entire]; fma [-infinity,-3.0] [-5.0, 3.0] [entire] = [entire]; fma [-infinity,-3.0] [1.0, 3.0] [entire] = [entire]; fma [-infinity,-3.0] [-infinity, -1.0] [entire] = [entire]; fma [-infinity,-3.0] [-infinity, 3.0] [entire] = [entire]; fma [-infinity,-3.0] [-5.0, infinity] [entire] = [entire]; fma [-infinity,-3.0] [1.0, infinity] [entire] = [entire]; fma [-infinity,-3.0] [entire] [entire] = [entire]; fma [0.0,0.0] [0.0,0.0] [entire] = [entire]; fma [0.0,0.0] [-0.0,-0.0] [entire] = [entire]; fma [0.0,0.0] [-5.0, -1.0] [entire] = [entire]; fma [0.0,0.0] [-5.0, 3.0] [entire] = [entire]; fma [0.0,0.0] [1.0, 3.0] [entire] = [entire]; fma [0.0,0.0] [-infinity, -1.0] [entire] = [entire]; fma [0.0,0.0] [-infinity, 3.0] [entire] = [entire]; fma [0.0,0.0] [-5.0, infinity] [entire] = [entire]; fma [0.0,0.0] [1.0, infinity] [entire] = [entire]; fma [0.0,0.0] [entire] [entire] = [entire]; fma [-0.0,-0.0] [0.0,0.0] [entire] = [entire]; fma [-0.0,-0.0] [-0.0,-0.0] [entire] = [entire]; fma [-0.0,-0.0] [-5.0, -1.0] [entire] = [entire]; fma [-0.0,-0.0] [-5.0, 3.0] [entire] = [entire]; fma [-0.0,-0.0] [1.0, 3.0] [entire] = [entire]; fma [-0.0,-0.0] [-infinity, -1.0] [entire] = [entire]; fma [-0.0,-0.0] [-infinity, 3.0] [entire] = [entire]; fma [-0.0,-0.0] [-5.0, infinity] [entire] = [entire]; fma [-0.0,-0.0] [1.0, infinity] [entire] = [entire]; fma [-0.0,-0.0] [entire] [entire] = [entire]; fma [1.0,5.0] [0.0,0.0] [entire] = [entire]; fma [1.0,5.0] [-0.0,-0.0] [entire] = [entire]; fma [1.0,5.0] [-5.0, -1.0] [entire] = [entire]; fma [1.0,5.0] [-5.0, 3.0] [entire] = [entire]; fma [1.0,5.0] [1.0, 3.0] [entire] = [entire]; fma [1.0,5.0] [-infinity, -1.0] [entire] = [entire]; fma [1.0,5.0] [-infinity, 3.0] [entire] = [entire]; fma [1.0,5.0] [-5.0, infinity] [entire] = [entire]; fma [1.0,5.0] [1.0, infinity] [entire] = [entire]; fma [1.0,5.0] [entire] [entire] = [entire]; fma [-1.0,5.0] [0.0,0.0] [entire] = [entire]; fma [-1.0,5.0] [-0.0,-0.0] [entire] = [entire]; fma [-1.0,5.0] [-5.0, -1.0] [entire] = [entire]; //min max fma [-1.0,5.0] [-5.0, 3.0] [entire] = [entire]; fma [-10.0,2.0] [-5.0, 3.0] [entire] = [entire]; fma [-1.0,5.0] [-1.0, 10.0] [entire] = [entire]; fma [-2.0,2.0] [-5.0, 3.0] [entire] = [entire]; //end min max fma [-1.0,5.0] [1.0, 3.0] [entire] = [entire]; fma [-1.0,5.0] [-infinity, -1.0] [entire] = [entire]; fma [-1.0,5.0] [-infinity, 3.0] [entire] = [entire]; fma [-1.0,5.0] [-5.0, infinity] [entire] = [entire]; fma [-1.0,5.0] [1.0, infinity] [entire] = [entire]; fma [-1.0,5.0] [entire] [entire] = [entire]; fma [-10.0,-5.0] [0.0,0.0] [entire] = [entire]; fma [-10.0,-5.0] [-0.0,-0.0] [entire] = [entire]; fma [-10.0,-5.0] [-5.0, -1.0] [entire] = [entire]; fma [-10.0,-5.0] [-5.0, 3.0] [entire] = [entire]; fma [-10.0,-5.0] [1.0, 3.0] [entire] = [entire]; fma [-10.0,-5.0] [-infinity, -1.0] [entire] = [entire]; fma [-10.0,-5.0] [-infinity, 3.0] [entire] = [entire]; fma [-10.0,-5.0] [-5.0, infinity] [entire] = [entire]; fma [-10.0,-5.0] [1.0, infinity] [entire] = [entire]; fma [-10.0,-5.0] [entire] [entire] = [entire]; fma [0.1,0.5] [-5.0, 3.0] [-0.1,0.1] = [-0X1.4CCCCCCCCCCCDP+1,0X1.999999999999AP+0]; fma [-0.5,0.2] [-5.0, 3.0] [-0.1,0.1] = [-0X1.999999999999AP+0,0X1.4CCCCCCCCCCCDP+1]; fma [-0.5,-0.1] [2.0, 3.0] [-0.1,0.1] = [-0X1.999999999999AP+0,-0X1.999999999999AP-4]; fma [-0.5,-0.1] [-infinity, 3.0] [-0.1,0.1] = [-0X1.999999999999AP+0,infinity]; } testcase minimal_fma_dec_test { fma [-0.5,-0.1]_com [-infinity, 3.0]_dac [-0.1,0.1]_com = [-0X1.999999999999AP+0,infinity]_dac; fma [1.0,2.0]_com [1.0, 0x1.FFFFFFFFFFFFFp1023]_com [0.0,1.0]_com = [1.0,infinity]_dac; fma [1.0,2.0]_com [1.0, 2.0]_com [2.0,5.0]_com = [3.0,9.0]_com; } testcase minimal_pown_test { pown [empty] 0 = [empty]; pown [entire] 0 = [1.0,1.0]; pown [0.0,0.0] 0 = [1.0,1.0]; pown [-0.0,-0.0] 0 = [1.0,1.0]; pown [13.1,13.1] 0 = [1.0,1.0]; pown [-7451.145,-7451.145] 0 = [1.0,1.0]; pown [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] 0 = [1.0,1.0]; pown [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] 0 = [1.0,1.0]; pown [0.0,infinity] 0 = [1.0,1.0]; pown [-0.0,infinity] 0 = [1.0,1.0]; pown [-infinity,0.0] 0 = [1.0,1.0]; pown [-infinity,-0.0] 0 = [1.0,1.0]; pown [-324.3,2.5] 0 = [1.0,1.0]; pown [empty] 2 = [empty]; pown [entire] 2 = [0.0,infinity]; pown [0.0,0.0] 2 = [0.0,0.0]; pown [-0.0,-0.0] 2 = [0.0,0.0]; pown [13.1,13.1] 2 = [0X1.573851EB851EBP+7,0X1.573851EB851ECP+7]; pown [-7451.145,-7451.145] 2 = [0X1.A794A4E7CFAADP+25,0X1.A794A4E7CFAAEP+25]; pown [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] 2 = [0x1.FFFFFFFFFFFFFp1023,infinity]; pown [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] 2 = [0x1.FFFFFFFFFFFFFp1023,infinity]; pown [0.0,infinity] 2 = [0.0,infinity]; pown [-0.0,infinity] 2 = [0.0,infinity]; pown [-infinity,0.0] 2 = [0.0,infinity]; pown [-infinity,-0.0] 2 = [0.0,infinity]; pown [-324.3,2.5] 2 = [0.0,0X1.9AD27D70A3D72P+16]; pown [0.01,2.33] 2 = [0X1.A36E2EB1C432CP-14,0X1.5B7318FC50482P+2]; pown [-1.9,-0.33] 2 = [0X1.BE0DED288CE7P-4,0X1.CE147AE147AE1P+1]; pown [empty] 8 = [empty]; pown [entire] 8 = [0.0,infinity]; pown [0.0,0.0] 8 = [0.0,0.0]; pown [-0.0,-0.0] 8 = [0.0,0.0]; pown [13.1,13.1] 8 = [0X1.9D8FD495853F5P+29,0X1.9D8FD495853F6P+29]; pown [-7451.145,-7451.145] 8 = [0X1.DFB1BB622E70DP+102,0X1.DFB1BB622E70EP+102]; pown [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] 8 = [0x1.FFFFFFFFFFFFFp1023,infinity]; pown [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] 8 = [0x1.FFFFFFFFFFFFFp1023,infinity]; pown [0.0,infinity] 8 = [0.0,infinity]; pown [-0.0,infinity] 8 = [0.0,infinity]; pown [-infinity,0.0] 8 = [0.0,infinity]; pown [-infinity,-0.0] 8 = [0.0,infinity]; pown [-324.3,2.5] 8 = [0.0,0X1.A87587109655P+66]; pown [0.01,2.33] 8 = [0X1.CD2B297D889BDP-54,0X1.B253D9F33CE4DP+9]; pown [-1.9,-0.33] 8 = [0X1.26F1FCDD502A3P-13,0X1.53ABD7BFC4FC6P+7]; pown [empty] 1 = [empty]; pown [entire] 1 = [entire]; pown [0.0,0.0] 1 = [0.0,0.0]; pown [-0.0,-0.0] 1 = [0.0,0.0]; pown [13.1,13.1] 1 = [13.1,13.1]; pown [-7451.145,-7451.145] 1 = [-7451.145,-7451.145]; pown [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] 1 = [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]; pown [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] 1 = [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023]; pown [0.0,infinity] 1 = [0.0,infinity]; pown [-0.0,infinity] 1 = [0.0,infinity]; pown [-infinity,0.0] 1 = [-infinity,0.0]; pown [-infinity,-0.0] 1 = [-infinity,0.0]; pown [-324.3,2.5] 1 = [-324.3,2.5]; pown [0.01,2.33] 1 = [0.01,2.33]; pown [-1.9,-0.33] 1 = [-1.9,-0.33]; pown [empty] 3 = [empty]; pown [entire] 3 = [entire]; pown [0.0,0.0] 3 = [0.0,0.0]; pown [-0.0,-0.0] 3 = [0.0,0.0]; pown [13.1,13.1] 3 = [0X1.1902E978D4FDEP+11,0X1.1902E978D4FDFP+11]; pown [-7451.145,-7451.145] 3 = [-0X1.81460637B9A3DP+38,-0X1.81460637B9A3CP+38]; pown [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] 3 = [0x1.FFFFFFFFFFFFFp1023,infinity]; pown [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] 3 = [-infinity,-0x1.FFFFFFFFFFFFFp1023]; pown [0.0,infinity] 3 = [0.0,infinity]; pown [-0.0,infinity] 3 = [0.0,infinity]; pown [-infinity,0.0] 3 = [-infinity,0.0]; pown [-infinity,-0.0] 3 = [-infinity,0.0]; pown [-324.3,2.5] 3 = [-0X1.0436D2F418938P+25,0X1.F4P+3]; pown [0.01,2.33] 3 = [0X1.0C6F7A0B5ED8DP-20,0X1.94C75E6362A6P+3]; pown [-1.9,-0.33] 3 = [-0X1.B6F9DB22D0E55P+2,-0X1.266559F6EC5B1P-5]; pown [empty] 7 = [empty]; pown [entire] 7 = [entire]; pown [0.0,0.0] 7 = [0.0,0.0]; pown [-0.0,-0.0] 7 = [0.0,0.0]; pown [13.1,13.1] 7 = [0X1.F91D1B185493BP+25,0X1.F91D1B185493CP+25]; pown [-7451.145,-7451.145] 7 = [-0X1.07B1DA32F9B59P+90,-0X1.07B1DA32F9B58P+90]; pown [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] 7 = [0x1.FFFFFFFFFFFFFp1023,infinity]; pown [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] 7 = [-infinity,-0x1.FFFFFFFFFFFFFp1023]; pown [0.0,infinity] 7 = [0.0,infinity]; pown [-0.0,infinity] 7 = [0.0,infinity]; pown [-infinity,0.0] 7 = [-infinity,0.0]; pown [-infinity,-0.0] 7 = [-infinity,0.0]; pown [-324.3,2.5] 7 = [-0X1.4F109959E6D7FP+58,0X1.312DP+9]; pown [0.01,2.33] 7 = [0X1.6849B86A12B9BP-47,0X1.74D0373C76313P+8]; pown [-1.9,-0.33] 7 = [-0X1.658C775099757P+6,-0X1.BEE30301BF47AP-12]; pown [empty] -2 = [empty]; pown [entire] -2 = [0.0,infinity]; pown [0.0,0.0] -2 = [empty]; pown [-0.0,-0.0] -2 = [empty]; pown [13.1,13.1] -2 = [0X1.7DE3A077D1568P-8,0X1.7DE3A077D1569P-8]; pown [-7451.145,-7451.145] -2 = [0X1.3570290CD6E14P-26,0X1.3570290CD6E15P-26]; pown [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] -2 = [0X0P+0,0X0.0000000000001P-1022]; pown [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] -2 = [0X0P+0,0X0.0000000000001P-1022]; pown [0.0,infinity] -2 = [0.0,infinity]; pown [-0.0,infinity] -2 = [0.0,infinity]; pown [-infinity,0.0] -2 = [0.0,infinity]; pown [-infinity,-0.0] -2 = [0.0,infinity]; pown [-324.3,2.5] -2 = [0X1.3F0C482C977C9P-17,infinity]; pown [0.01,2.33] -2 = [0X1.793D85EF38E47P-3,0X1.388P+13]; pown [-1.9,-0.33] -2 = [0X1.1BA81104F6C8P-2,0X1.25D8FA1F801E1P+3]; pown [empty] -8 = [empty]; pown [entire] -8 = [0.0,infinity]; pown [0.0,0.0] -8 = [empty]; pown [-0.0,-0.0] -8 = [empty]; pown [13.1,13.1] -8 = [0X1.3CEF39247CA6DP-30,0X1.3CEF39247CA6EP-30]; pown [-7451.145,-7451.145] -8 = [0X1.113D9EF0A99ACP-103,0X1.113D9EF0A99ADP-103]; pown [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] -8 = [0X0P+0,0X0.0000000000001P-1022]; pown [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] -8 = [0X0P+0,0X0.0000000000001P-1022]; pown [0.0,infinity] -8 = [0.0,infinity]; pown [-0.0,infinity] -8 = [0.0,infinity]; pown [-infinity,0.0] -8 = [0.0,infinity]; pown [-infinity,-0.0] -8 = [0.0,infinity]; pown [-324.3,2.5] -8 = [0X1.34CC3764D1E0CP-67,infinity]; pown [0.01,2.33] -8 = [0X1.2DC80DB11AB7CP-10,0X1.1C37937E08P+53]; pown [-1.9,-0.33] -8 = [0X1.81E104E61630DP-8,0X1.BC64F21560E34P+12]; pown [empty] -1 = [empty]; pown [entire] -1 = [entire]; pown [0.0,0.0] -1 = [empty]; pown [-0.0,-0.0] -1 = [empty]; pown [13.1,13.1] -1 = [0X1.38ABF82EE6986P-4,0X1.38ABF82EE6987P-4]; pown [-7451.145,-7451.145] -1 = [-0X1.197422C9048BFP-13,-0X1.197422C9048BEP-13]; pown [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] -1 = [0X0.4P-1022,0X0.4000000000001P-1022]; pown [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] -1 = [-0X0.4000000000001P-1022,-0X0.4P-1022]; pown [0.0,infinity] -1 = [0.0,infinity]; pown [-0.0,infinity] -1 = [0.0,infinity]; pown [-infinity,0.0] -1 = [-infinity,0.0]; pown [-infinity,-0.0] -1 = [-infinity,0.0]; pown [-324.3,2.5] -1 = [entire]; pown [0.01,2.33] -1 = [0X1.B77C278DBBE13P-2,0X1.9P+6]; pown [-1.9,-0.33] -1 = [-0X1.83E0F83E0F83EP+1,-0X1.0D79435E50D79P-1]; pown [empty] -3 = [empty]; pown [entire] -3 = [entire]; pown [0.0,0.0] -3 = [empty]; pown [-0.0,-0.0] -3 = [empty]; pown [13.1,13.1] -3 = [0X1.D26DF4D8B1831P-12,0X1.D26DF4D8B1832P-12]; pown [-7451.145,-7451.145] -3 = [-0X1.54347DED91B19P-39,-0X1.54347DED91B18P-39]; pown [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] -3 = [0X0P+0,0X0.0000000000001P-1022]; pown [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] -3 = [-0X0.0000000000001P-1022,-0X0P+0]; pown [0.0,infinity] -3 = [0.0,infinity]; pown [-0.0,infinity] -3 = [0.0,infinity]; pown [-infinity,0.0] -3 = [-infinity,0.0]; pown [-infinity,-0.0] -3 = [-infinity,0.0]; pown [-324.3,2.5] -3 = [entire]; pown [0.01,2.33] -3 = [0X1.43CFBA61AACABP-4,0X1.E848P+19]; pown [-1.9,-0.33] -3 = [-0X1.BD393CE9E8E7CP+4,-0X1.2A95F6F7C066CP-3]; pown [empty] -7 = [empty]; pown [entire] -7 = [entire]; pown [0.0,0.0] -7 = [empty]; pown [-0.0,-0.0] -7 = [empty]; pown [13.1,13.1] -7 = [0X1.037D76C912DBCP-26,0X1.037D76C912DBDP-26]; pown [-7451.145,-7451.145] -7 = [-0X1.F10F41FB8858FP-91,-0X1.F10F41FB8858EP-91]; pown [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] -7 = [0X0P+0,0X0.0000000000001P-1022]; pown [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] -7 = [-0X0.0000000000001P-1022,-0X0P+0]; pown [0.0,infinity] -7 = [0.0,infinity]; pown [-0.0,infinity] -7 = [0.0,infinity]; pown [-infinity,0.0] -7 = [-infinity,0.0]; pown [-infinity,-0.0] -7 = [-infinity,0.0]; pown [-324.3,2.5] -7 = [entire]; pown [0.01,2.33] -7 = [0X1.5F934D64162A9P-9,0X1.6BCC41E9P+46]; pown [-1.9,-0.33] -7 = [-0X1.254CDD3711DDBP+11,-0X1.6E95C4A761E19P-7]; } testcase minimal_pown_dec_test { pown [-5.0,10.0]_com 0 = [1.0,1.0]_com; pown [-infinity,15.0]_dac 0 = [1.0,1.0]_dac; pown [-3.0,5.0]_def 2 = [0.0,25.0]_def; pown [-0x1.FFFFFFFFFFFFFp1023,2.0]_com 2 = [0.0,infinity]_dac; pown [-3.0,5.0]_dac 3 = [-27.0,125.0]_dac; pown [-0x1.FFFFFFFFFFFFFp1023,2.0]_com 3 = [-infinity, 8.0]_dac; pown [3.0,5.0]_com -2 = [0X1.47AE147AE147AP-5,0X1.C71C71C71C71DP-4]_com; pown [-5.0,-3.0]_def -2 = [0X1.47AE147AE147AP-5,0X1.C71C71C71C71DP-4]_def; pown [-5.0,3.0]_com -2 = [0X1.47AE147AE147AP-5,infinity]_trv; pown [3.0,5.0]_dac -3 = [0X1.0624DD2F1A9FBP-7 ,0X1.2F684BDA12F69P-5]_dac; pown [-3.0,5.0]_com -3 = [entire]_trv; } testcase minimal_pow_test { pow [empty] [empty] = [empty]; pow [empty] [entire] = [empty]; pow [empty] [-infinity,-1.0] = [empty]; pow [empty] [-infinity,0.0] = [empty]; pow [empty] [-infinity,-0.0] = [empty]; pow [empty] [0.0,infinity] = [empty]; pow [empty] [-0.0,infinity] = [empty]; pow [empty] [1.0,infinity] = [empty]; pow [empty] [-3.0,5.0] = [empty]; pow [empty] [0.0,0.0] = [empty]; pow [empty] [-0.0,-0.0] = [empty]; pow [empty] [-5.0,-5.0] = [empty]; pow [empty] [5.0,5.0] = [empty]; pow [0.1,0.5] [empty] = [empty]; pow [0.1,0.5] [0.0,0.0] = [1.0,1.0]; pow [0.1,0.5] [-0.0,-0.0] = [1.0,1.0]; pow [0.1,0.5] [0.0,1.0] = [0X1.999999999999AP-4,1.0]; pow [0.1,0.5] [-0.0,1.0] = [0X1.999999999999AP-4,1.0]; pow [0.1,0.5] [0.0,2.5] = [0X1.9E7C6E43390B7P-9,1.0]; pow [0.1,0.5] [-0.0,2.5] = [0X1.9E7C6E43390B7P-9,1.0]; pow [0.1,0.5] [0.0,infinity] = [0.0,1.0]; pow [0.1,0.5] [-0.0,infinity] = [0.0,1.0]; pow [0.1,0.5] [0.1,0.1] = [0X1.96B230BCDC434P-1,0X1.DDB680117AB13P-1]; pow [0.1,0.5] [0.1,1.0] = [0X1.999999999999AP-4,0X1.DDB680117AB13P-1]; pow [0.1,0.5] [0.1,2.5] = [0X1.9E7C6E43390B7P-9,0X1.DDB680117AB13P-1]; pow [0.1,0.5] [0.1,infinity] = [0.0,0X1.DDB680117AB13P-1]; pow [0.1,0.5] [1.0,1.0] = [0X1.999999999999AP-4,0X1P-1]; pow [0.1,0.5] [1.0,2.5] = [0X1.9E7C6E43390B7P-9,0X1P-1]; pow [0.1,0.5] [1.0,infinity] = [0.0,0X1P-1]; pow [0.1,0.5] [2.5,2.5] = [0X1.9E7C6E43390B7P-9,0X1.6A09E667F3BCDP-3]; pow [0.1,0.5] [2.5,infinity] = [0.0,0X1.6A09E667F3BCDP-3]; pow [0.1,0.5] [-0.1,0.1] = [0X1.96B230BCDC434P-1,0X1.4248EF8FC2604P+0]; pow [0.1,0.5] [-0.1,1.0] = [0X1.999999999999AP-4,0X1.4248EF8FC2604P+0]; pow [0.1,0.5] [-0.1,2.5] = [0X1.9E7C6E43390B7P-9,0X1.4248EF8FC2604P+0]; pow [0.1,0.5] [-0.1,infinity] = [0.0,0X1.4248EF8FC2604P+0]; pow [0.1,0.5] [-1.0,0.1] = [0X1.96B230BCDC434P-1,0X1.4P+3]; pow [0.1,0.5] [-1.0,1.0] = [0X1.999999999999AP-4,0X1.4P+3]; pow [0.1,0.5] [-1.0,2.5] = [0X1.9E7C6E43390B7P-9,0X1.4P+3]; pow [0.1,0.5] [-1.0,infinity] = [0.0,0X1.4P+3]; pow [0.1,0.5] [-2.5,0.1] = [0X1.96B230BCDC434P-1,0X1.3C3A4EDFA9758P+8]; pow [0.1,0.5] [-2.5,1.0] = [0X1.999999999999AP-4,0X1.3C3A4EDFA9758P+8]; pow [0.1,0.5] [-2.5,2.5] = [0X1.9E7C6E43390B7P-9,0X1.3C3A4EDFA9758P+8]; pow [0.1,0.5] [-2.5,infinity] = [0.0,0X1.3C3A4EDFA9758P+8]; pow [0.1,0.5] [-infinity,0.1] = [0X1.96B230BCDC434P-1,infinity]; pow [0.1,0.5] [-infinity,1.0] = [0X1.999999999999AP-4,infinity]; pow [0.1,0.5] [-infinity,2.5] = [0X1.9E7C6E43390B7P-9,infinity]; pow [0.1,0.5] [entire] = [0.0,infinity]; pow [0.1,0.5] [-1.0,0.0] = [1.0,0X1.4P+3]; pow [0.1,0.5] [-1.0,-0.0] = [1.0,0X1.4P+3]; pow [0.1,0.5] [-2.5,0.0] = [1.0,0X1.3C3A4EDFA9758P+8]; pow [0.1,0.5] [-2.5,-0.0] = [1.0,0X1.3C3A4EDFA9758P+8]; pow [0.1,0.5] [-infinity,0.0] = [1.0,infinity]; pow [0.1,0.5] [-infinity,-0.0] = [1.0,infinity]; pow [0.1,0.5] [-0.1,-0.1] = [0X1.125FBEE250664P+0,0X1.4248EF8FC2604P+0]; pow [0.1,0.5] [-1.0,-0.1] = [0X1.125FBEE250664P+0,0X1.4P+3]; pow [0.1,0.5] [-2.5,-0.1] = [0X1.125FBEE250664P+0,0X1.3C3A4EDFA9758P+8]; pow [0.1,0.5] [-infinity,-0.1] = [0X1.125FBEE250664P+0,infinity]; pow [0.1,0.5] [-1.0,-1.0] = [0X1P+1,0X1.4P+3]; pow [0.1,0.5] [-2.5,-1.0] = [0X1P+1,0X1.3C3A4EDFA9758P+8]; pow [0.1,0.5] [-infinity,-1.0] = [0X1P+1,infinity]; pow [0.1,0.5] [-2.5,-2.5] = [0X1.6A09E667F3BCCP+2,0X1.3C3A4EDFA9758P+8]; pow [0.1,0.5] [-infinity,-2.5] = [0X1.6A09E667F3BCCP+2,infinity]; pow [0.1,1.0] [empty] = [empty]; pow [0.1,1.0] [0.0,0.0] = [1.0,1.0]; pow [0.1,1.0] [-0.0,-0.0] = [1.0,1.0]; pow [0.1,1.0] [0.0,1.0] = [0X1.999999999999AP-4,1.0]; pow [0.1,1.0] [-0.0,1.0] = [0X1.999999999999AP-4,1.0]; pow [0.1,1.0] [0.0,2.5] = [0X1.9E7C6E43390B7P-9,1.0]; pow [0.1,1.0] [-0.0,2.5] = [0X1.9E7C6E43390B7P-9,1.0]; pow [0.1,1.0] [0.0,infinity] = [0.0,1.0]; pow [0.1,1.0] [-0.0,infinity] = [0.0,1.0]; pow [0.1,1.0] [0.1,0.1] = [0X1.96B230BCDC434P-1,1.0]; pow [0.1,1.0] [0.1,1.0] = [0X1.999999999999AP-4,1.0]; pow [0.1,1.0] [0.1,2.5] = [0X1.9E7C6E43390B7P-9,1.0]; pow [0.1,1.0] [0.1,infinity] = [0.0,1.0]; pow [0.1,1.0] [1.0,1.0] = [0X1.999999999999AP-4,1.0]; pow [0.1,1.0] [1.0,2.5] = [0X1.9E7C6E43390B7P-9,1.0]; pow [0.1,1.0] [1.0,infinity] = [0.0,1.0]; pow [0.1,1.0] [2.5,2.5] = [0X1.9E7C6E43390B7P-9,1.0]; pow [0.1,1.0] [2.5,infinity] = [0.0,1.0]; pow [0.1,1.0] [-0.1,0.1] = [0X1.96B230BCDC434P-1,0X1.4248EF8FC2604P+0]; pow [0.1,1.0] [-0.1,1.0] = [0X1.999999999999AP-4,0X1.4248EF8FC2604P+0]; pow [0.1,1.0] [-0.1,2.5] = [0X1.9E7C6E43390B7P-9,0X1.4248EF8FC2604P+0]; pow [0.1,1.0] [-0.1,infinity] = [0.0,0X1.4248EF8FC2604P+0]; pow [0.1,1.0] [-1.0,0.1] = [0X1.96B230BCDC434P-1,0X1.4P+3]; pow [0.1,1.0] [-1.0,1.0] = [0X1.999999999999AP-4,0X1.4P+3]; pow [0.1,1.0] [-1.0,2.5] = [0X1.9E7C6E43390B7P-9,0X1.4P+3]; pow [0.1,1.0] [-1.0,infinity] = [0.0,0X1.4P+3]; pow [0.1,1.0] [-2.5,0.1] = [0X1.96B230BCDC434P-1,0X1.3C3A4EDFA9758P+8]; pow [0.1,1.0] [-2.5,1.0] = [0X1.999999999999AP-4,0X1.3C3A4EDFA9758P+8]; pow [0.1,1.0] [-2.5,2.5] = [0X1.9E7C6E43390B7P-9,0X1.3C3A4EDFA9758P+8]; pow [0.1,1.0] [-2.5,infinity] = [0.0,0X1.3C3A4EDFA9758P+8]; pow [0.1,1.0] [-infinity,0.1] = [0X1.96B230BCDC434P-1,infinity]; pow [0.1,1.0] [-infinity,1.0] = [0X1.999999999999AP-4,infinity]; pow [0.1,1.0] [-infinity,2.5] = [0X1.9E7C6E43390B7P-9,infinity]; pow [0.1,1.0] [entire] = [0.0,infinity]; pow [0.1,1.0] [-0.1,0.0] = [1.0,0X1.4248EF8FC2604P+0]; pow [0.1,1.0] [-0.1,-0.0] = [1.0,0X1.4248EF8FC2604P+0]; pow [0.1,1.0] [-1.0,0.0] = [1.0,0X1.4P+3]; pow [0.1,1.0] [-1.0,-0.0] = [1.0,0X1.4P+3]; pow [0.1,1.0] [-2.5,0.0] = [1.0,0X1.3C3A4EDFA9758P+8]; pow [0.1,1.0] [-2.5,-0.0] = [1.0,0X1.3C3A4EDFA9758P+8]; pow [0.1,1.0] [-infinity,0.0] = [1.0,infinity]; pow [0.1,1.0] [-infinity,-0.0] = [1.0,infinity]; pow [0.1,1.0] [-0.1,-0.1] = [1.0,0X1.4248EF8FC2604P+0]; pow [0.1,1.0] [-1.0,-0.1] = [1.0,0X1.4P+3]; pow [0.1,1.0] [-2.5,-0.1] = [1.0,0X1.3C3A4EDFA9758P+8]; pow [0.1,1.0] [-infinity,-0.1] = [1.0,infinity]; pow [0.1,1.0] [-1.0,-1.0] = [1.0,0X1.4P+3]; pow [0.1,1.0] [-2.5,-1.0] = [1.0,0X1.3C3A4EDFA9758P+8]; pow [0.1,1.0] [-infinity,-1.0] = [1.0,infinity]; pow [0.1,1.0] [-2.5,-2.5] = [1.0,0X1.3C3A4EDFA9758P+8]; pow [0.1,1.0] [-infinity,-2.5] = [1.0,infinity]; pow [0.5,1.5] [empty] = [empty]; pow [0.5,1.5] [0.0,0.0] = [1.0,1.0]; pow [0.5,1.5] [-0.0,-0.0] = [1.0,1.0]; pow [0.5,1.5] [0.0,1.0] = [0.5,1.5]; pow [0.5,1.5] [-0.0,1.0] = [0.5,1.5]; pow [0.5,1.5] [0.0,2.5] = [0X1.6A09E667F3BCCP-3,0X1.60B9FD68A4555P+1]; pow [0.5,1.5] [-0.0,2.5] = [0X1.6A09E667F3BCCP-3,0X1.60B9FD68A4555P+1]; pow [0.5,1.5] [0.0,infinity] = [0.0,infinity]; pow [0.5,1.5] [-0.0,infinity] = [0.0,infinity]; pow [0.5,1.5] [0.1,0.1] = [0X1.DDB680117AB12P-1,0X1.0A97DCE72A0CBP+0]; pow [0.5,1.5] [0.1,1.0] = [0.5,1.5]; pow [0.5,1.5] [0.1,2.5] = [0X1.6A09E667F3BCCP-3,0X1.60B9FD68A4555P+1]; pow [0.5,1.5] [0.1,infinity] = [0.0,infinity]; pow [0.5,1.5] [1.0,1.0] = [0.5,1.5]; pow [0.5,1.5] [1.0,2.5] = [0X1.6A09E667F3BCCP-3,0X1.60B9FD68A4555P+1]; pow [0.5,1.5] [1.0,infinity] = [0.0,infinity]; pow [0.5,1.5] [2.5,2.5] = [0X1.6A09E667F3BCCP-3,0X1.60B9FD68A4555P+1]; pow [0.5,1.5] [2.5,infinity] = [0.0,infinity]; pow [0.5,1.5] [-0.1,0.1] = [0X1.DDB680117AB12P-1,0X1.125FBEE250665P+0]; pow [0.5,1.5] [-0.1,1.0] = [0X1P-1,0X1.8P+0]; pow [0.5,1.5] [-0.1,2.5] = [0X1.6A09E667F3BCCP-3,0X1.60B9FD68A4555P+1]; pow [0.5,1.5] [-0.1,infinity] = [0X0P+0,infinity]; pow [0.5,1.5] [-1.0,0.1] = [0X1.5555555555555P-1,0X1P+1]; pow [0.5,1.5] [-1.0,1.0] = [0X1P-1,0X1P+1]; pow [0.5,1.5] [-1.0,2.5] = [0X1.6A09E667F3BCCP-3,0X1.60B9FD68A4555P+1]; pow [0.5,1.5] [-1.0,infinity] = [0X0P+0,infinity]; pow [0.5,1.5] [-2.5,0.1] = [0X1.7398BF1D1EE6FP-2,0X1.6A09E667F3BCDP+2]; pow [0.5,1.5] [-2.5,1.0] = [0X1.7398BF1D1EE6FP-2,0X1.6A09E667F3BCDP+2]; pow [0.5,1.5] [-2.5,2.5] = [0X1.6A09E667F3BCCP-3,0X1.6A09E667F3BCDP+2]; pow [0.5,1.5] [-2.5,infinity] = [0X0P+0,infinity]; pow [0.5,1.5] [-infinity,0.1] = [0X0P+0,infinity]; pow [0.5,1.5] [-infinity,1.0] = [0X0P+0,infinity]; pow [0.5,1.5] [-infinity,2.5] = [0X0P+0,infinity]; pow [0.5,1.5] [entire] = [0X0P+0,infinity]; pow [0.5,1.5] [-1.0,0.0] = [0X1.5555555555555P-1,0X1P+1]; pow [0.5,1.5] [-1.0,-0.0] = [0X1.5555555555555P-1,0X1P+1]; pow [0.5,1.5] [-2.5,0.0] = [0X1.7398BF1D1EE6FP-2,0X1.6A09E667F3BCDP+2]; pow [0.5,1.5] [-2.5,-0.0] = [0X1.7398BF1D1EE6FP-2,0X1.6A09E667F3BCDP+2]; pow [0.5,1.5] [-infinity,0.0] = [0X0P+0,infinity]; pow [0.5,1.5] [-infinity,-0.0] = [0X0P+0,infinity]; pow [0.5,1.5] [-0.1,-0.1] = [0X1.EBA7C9E4D31E9P-1,0X1.125FBEE250665P+0]; pow [0.5,1.5] [-1.0,-0.1] = [0X1.5555555555555P-1,0X1P+1]; pow [0.5,1.5] [-2.5,-0.1] = [0X1.7398BF1D1EE6FP-2,0X1.6A09E667F3BCDP+2]; pow [0.5,1.5] [-infinity,-0.1] = [0X0P+0,infinity]; pow [0.5,1.5] [-1.0,-1.0] = [0X1.5555555555555P-1,0X1P+1]; pow [0.5,1.5] [-2.5,-1.0] = [0X1.7398BF1D1EE6FP-2,0X1.6A09E667F3BCDP+2]; pow [0.5,1.5] [-infinity,-1.0] = [0X0P+0,infinity]; pow [0.5,1.5] [-2.5,-2.5] = [0X1.7398BF1D1EE6FP-2,0X1.6A09E667F3BCDP+2]; pow [0.5,1.5] [-infinity,-2.5] = [0X0P+0,infinity]; pow [0.5,infinity] [empty] = [empty]; pow [0.5,infinity] [0.0,0.0] = [1.0,1.0]; pow [0.5,infinity] [-0.0,-0.0] = [1.0,1.0]; pow [0.5,infinity] [0.0,1.0] = [0.5,infinity]; pow [0.5,infinity] [-0.0,1.0] = [0.5,infinity]; pow [0.5,infinity] [0.0,2.5] = [0X1.6A09E667F3BCCP-3,infinity]; pow [0.5,infinity] [-0.0,2.5] = [0X1.6A09E667F3BCCP-3,infinity]; pow [0.5,infinity] [0.0,infinity] = [0.0,infinity]; pow [0.5,infinity] [-0.0,infinity] = [0.0,infinity]; pow [0.5,infinity] [0.1,0.1] = [0X1.DDB680117AB12P-1,infinity]; pow [0.5,infinity] [0.1,1.0] = [0.5,infinity]; pow [0.5,infinity] [0.1,2.5] = [0X1.6A09E667F3BCCP-3,infinity]; pow [0.5,infinity] [0.1,infinity] = [0.0,infinity]; pow [0.5,infinity] [1.0,1.0] = [0.5,infinity]; pow [0.5,infinity] [1.0,2.5] = [0X1.6A09E667F3BCCP-3,infinity]; pow [0.5,infinity] [1.0,infinity] = [0.0,infinity]; pow [0.5,infinity] [2.5,2.5] = [0X1.6A09E667F3BCCP-3,infinity]; pow [0.5,infinity] [2.5,infinity] = [0.0,infinity]; pow [0.5,infinity] [-0.1,0.1] = [0.0,infinity]; pow [0.5,infinity] [-0.1,1.0] = [0.0,infinity]; pow [0.5,infinity] [-0.1,2.5] = [0.0,infinity]; pow [0.5,infinity] [-0.1,infinity] = [0.0,infinity]; pow [0.5,infinity] [-1.0,0.1] = [0.0,infinity]; pow [0.5,infinity] [-1.0,1.0] = [0.0,infinity]; pow [0.5,infinity] [-1.0,2.5] = [0.0,infinity]; pow [0.5,infinity] [-1.0,infinity] = [0.0,infinity]; pow [0.5,infinity] [-2.5,0.1] = [0.0,infinity]; pow [0.5,infinity] [-2.5,1.0] = [0.0,infinity]; pow [0.5,infinity] [-2.5,2.5] = [0.0,infinity]; pow [0.5,infinity] [-2.5,infinity] = [0.0,infinity]; pow [0.5,infinity] [-infinity,0.1] = [0.0,infinity]; pow [0.5,infinity] [-infinity,1.0] = [0.0,infinity]; pow [0.5,infinity] [-infinity,2.5] = [0.0,infinity]; pow [0.5,infinity] [entire] = [0.0,infinity]; pow [0.5,infinity] [-1.0,0.0] = [0.0,0X1P+1]; pow [0.5,infinity] [-1.0,-0.0] = [0.0,0X1P+1]; pow [0.5,infinity] [-2.5,0.0] = [0.0,0X1.6A09E667F3BCDP+2]; pow [0.5,infinity] [-2.5,-0.0] = [0.0,0X1.6A09E667F3BCDP+2]; pow [0.5,infinity] [-infinity,0.0] = [0.0,infinity]; pow [0.5,infinity] [-infinity,-0.0] = [0.0,infinity]; pow [0.5,infinity] [-0.1,-0.1] = [0.0,0X1.125FBEE250665P+0]; pow [0.5,infinity] [-1.0,-0.1] = [0.0,0X1P+1]; pow [0.5,infinity] [-2.5,-0.1] = [0.0,0X1.6A09E667F3BCDP+2]; pow [0.5,infinity] [-infinity,-0.1] = [0.0,infinity]; pow [0.5,infinity] [-1.0,-1.0] = [0.0,0X1P+1]; pow [0.5,infinity] [-2.5,-1.0] = [0.0,0X1.6A09E667F3BCDP+2]; pow [0.5,infinity] [-infinity,-1.0] = [0.0,infinity]; pow [0.5,infinity] [-infinity,-2.5] = [0.0,infinity]; pow [0.5,infinity] [-2.5,-2.5] = [0.0,0X1.6A09E667F3BCDP+2]; pow [1.0,1.5] [empty] = [empty]; pow [1.0,1.5] [0.0,0.0] = [1.0,1.0]; pow [1.0,1.5] [-0.0,-0.0] = [1.0,1.0]; pow [1.0,1.5] [0.0,1.0] = [1.0,0X1.8P+0]; pow [1.0,1.5] [-0.0,1.0] = [1.0,0X1.8P+0]; pow [1.0,1.5] [0.0,2.5] = [1.0,0X1.60B9FD68A4555P+1]; pow [1.0,1.5] [-0.0,2.5] = [1.0,0X1.60B9FD68A4555P+1]; pow [1.0,1.5] [0.0,infinity] = [1.0,infinity]; pow [1.0,1.5] [-0.0,infinity] = [1.0,infinity]; pow [1.0,1.5] [0.1,0.1] = [1.0,0X1.0A97DCE72A0CBP+0]; pow [1.0,1.5] [0.1,1.0] = [1.0,0X1.8P+0]; pow [1.0,1.5] [0.1,2.5] = [1.0,0X1.60B9FD68A4555P+1]; pow [1.0,1.5] [0.1,infinity] = [1.0,infinity]; pow [1.0,1.5] [1.0,1.0] = [1.0,0X1.8P+0]; pow [1.0,1.5] [1.0,2.5] = [1.0,0X1.60B9FD68A4555P+1]; pow [1.0,1.5] [1.0,infinity] = [1.0,infinity]; pow [1.0,1.5] [2.5,2.5] = [1.0,0X1.60B9FD68A4555P+1]; pow [1.0,1.5] [2.5,infinity] = [1.0,infinity]; pow [1.0,1.5] [-0.1,0.1] = [0X1.EBA7C9E4D31E9P-1,0X1.0A97DCE72A0CBP+0]; pow [1.0,1.5] [-0.1,1.0] = [0X1.EBA7C9E4D31E9P-1,0X1.8P+0]; pow [1.0,1.5] [-0.1,2.5] = [0X1.EBA7C9E4D31E9P-1,0X1.60B9FD68A4555P+1]; pow [1.0,1.5] [-0.1,infinity] = [0X1.EBA7C9E4D31E9P-1,infinity]; pow [1.0,1.5] [-1.0,0.1] = [0X1.5555555555555P-1,0X1.0A97DCE72A0CBP+0]; pow [1.0,1.5] [-1.0,1.0] = [0X1.5555555555555P-1,0X1.8P+0]; pow [1.0,1.5] [-1.0,2.5] = [0X1.5555555555555P-1,0X1.60B9FD68A4555P+1]; pow [1.0,1.5] [-1.0,infinity] = [0X1.5555555555555P-1,infinity]; pow [1.0,1.5] [-2.5,0.1] = [0X1.7398BF1D1EE6FP-2,0X1.0A97DCE72A0CBP+0]; pow [1.0,1.5] [-2.5,1.0] = [0X1.7398BF1D1EE6FP-2,0X1.8P+0]; pow [1.0,1.5] [-2.5,2.5] = [0X1.7398BF1D1EE6FP-2,0X1.60B9FD68A4555P+1]; pow [1.0,1.5] [-2.5,infinity] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [1.0,1.5] [-infinity,0.1] = [0X0P+0,0X1.0A97DCE72A0CBP+0]; pow [1.0,1.5] [-infinity,1.0] = [0X0P+0,0X1.8P+0]; pow [1.0,1.5] [-infinity,2.5] = [0X0P+0,0X1.60B9FD68A4555P+1]; pow [1.0,1.5] [entire] = [0X0P+0,infinity]; pow [1.0,1.5] [-1.0,0.0] = [0X1.5555555555555P-1,1.0]; pow [1.0,1.5] [-1.0,-0.0] = [0X1.5555555555555P-1,1.0]; pow [1.0,1.5] [-2.5,0.0] = [0X1.7398BF1D1EE6FP-2,1.0]; pow [1.0,1.5] [-2.5,-0.0] = [0X1.7398BF1D1EE6FP-2,1.0]; pow [1.0,1.5] [-infinity,0.0] = [0X0P+0,1.0]; pow [1.0,1.5] [-infinity,-0.0] = [0X0P+0,1.0]; pow [1.0,1.5] [-0.1,-0.1] = [0X1.EBA7C9E4D31E9P-1,1.0]; pow [1.0,1.5] [-1.0,-0.1] = [0X1.5555555555555P-1,1.0]; pow [1.0,1.5] [-2.5,-0.1] = [0X1.7398BF1D1EE6FP-2,1.0]; pow [1.0,1.5] [-infinity,-0.1] = [0X0P+0,1.0]; pow [1.0,1.5] [-1.0,-1.0] = [0X1.5555555555555P-1,1.0]; pow [1.0,1.5] [-2.5,-1.0] = [0X1.7398BF1D1EE6FP-2,1.0]; pow [1.0,1.5] [-infinity,-1.0] = [0X0P+0,1.0]; pow [1.0,1.5] [-2.5,-2.5] = [0X1.7398BF1D1EE6FP-2,1.0]; pow [1.0,1.5] [-infinity,-2.5] = [0X0P+0,1.0]; pow [1.0,infinity] [empty] = [empty]; pow [1.0,infinity] [0.0,0.0] = [1.0,1.0]; pow [1.0,infinity] [-0.0,-0.0] = [1.0,1.0]; pow [1.0,infinity] [0.0,1.0] = [1.0,infinity]; pow [1.0,infinity] [-0.0,1.0] = [1.0,infinity]; pow [1.0,infinity] [0.0,2.5] = [1.0,infinity]; pow [1.0,infinity] [-0.0,2.5] = [1.0,infinity]; pow [1.0,infinity] [0.0,infinity] = [1.0,infinity]; pow [1.0,infinity] [-0.0,infinity] = [1.0,infinity]; pow [1.0,infinity] [0.1,0.1] = [1.0,infinity]; pow [1.0,infinity] [0.1,1.0] = [1.0,infinity]; pow [1.0,infinity] [0.1,2.5] = [1.0,infinity]; pow [1.0,infinity] [0.1,infinity] = [1.0,infinity]; pow [1.0,infinity] [1.0,1.0] = [1.0,infinity]; pow [1.0,infinity] [1.0,2.5] = [1.0,infinity]; pow [1.0,infinity] [1.0,infinity] = [1.0,infinity]; pow [1.0,infinity] [2.5,2.5] = [1.0,infinity]; pow [1.0,infinity] [2.5,infinity] = [1.0,infinity]; pow [1.0,infinity] [-0.1,0.1] = [0X0P+0,infinity]; pow [1.0,infinity] [-0.1,1.0] = [0X0P+0,infinity]; pow [1.0,infinity] [-0.1,2.5] = [0X0P+0,infinity]; pow [1.0,infinity] [-0.1,infinity] = [0X0P+0,infinity]; pow [1.0,infinity] [-1.0,0.1] = [0X0P+0,infinity]; pow [1.0,infinity] [-1.0,1.0] = [0X0P+0,infinity]; pow [1.0,infinity] [-1.0,2.5] = [0X0P+0,infinity]; pow [1.0,infinity] [-1.0,infinity] = [0X0P+0,infinity]; pow [1.0,infinity] [-2.5,0.1] = [0X0P+0,infinity]; pow [1.0,infinity] [-2.5,1.0] = [0X0P+0,infinity]; pow [1.0,infinity] [-2.5,2.5] = [0X0P+0,infinity]; pow [1.0,infinity] [-2.5,infinity] = [0X0P+0,infinity]; pow [1.0,infinity] [-infinity,0.1] = [0X0P+0,infinity]; pow [1.0,infinity] [-infinity,1.0] = [0X0P+0,infinity]; pow [1.0,infinity] [-infinity,2.5] = [0X0P+0,infinity]; pow [1.0,infinity] [entire] = [0X0P+0,infinity]; pow [1.0,infinity] [-1.0,0.0] = [0X0P+0,1.0]; pow [1.0,infinity] [-1.0,-0.0] = [0X0P+0,1.0]; pow [1.0,infinity] [-2.5,0.0] = [0X0P+0,1.0]; pow [1.0,infinity] [-2.5,-0.0] = [0X0P+0,1.0]; pow [1.0,infinity] [-infinity,0.0] = [0X0P+0,1.0]; pow [1.0,infinity] [-infinity,-0.0] = [0X0P+0,1.0]; pow [1.0,infinity] [-0.1,-0.1] = [0X0P+0,1.0]; pow [1.0,infinity] [-1.0,-0.1] = [0X0P+0,1.0]; pow [1.0,infinity] [-2.5,-0.1] = [0X0P+0,1.0]; pow [1.0,infinity] [-infinity,-0.1] = [0X0P+0,1.0]; pow [1.0,infinity] [-1.0,-1.0] = [0X0P+0,1.0]; pow [1.0,infinity] [-2.5,-1.0] = [0X0P+0,1.0]; pow [1.0,infinity] [-infinity,-1.0] = [0X0P+0,1.0]; pow [1.0,infinity] [-2.5,-2.5] = [0X0P+0,1.0]; pow [1.0,infinity] [-infinity,-2.5] = [0X0P+0,1.0]; pow [1.1,1.5] [empty] = [empty]; pow [1.1,1.5] [0.0,0.0] = [1.0,1.0]; pow [1.1,1.5] [-0.0,-0.0] = [1.0,1.0]; pow [1.1,1.5] [0.0,1.0] = [1.0,0X1.8P+0]; pow [1.1,1.5] [-0.0,1.0] = [1.0,0X1.8P+0]; pow [1.1,1.5] [0.0,2.5] = [1.0,0X1.60B9FD68A4555P+1]; pow [1.1,1.5] [-0.0,2.5] = [1.0,0X1.60B9FD68A4555P+1]; pow [1.1,1.5] [0.0,infinity] = [1.0,infinity]; pow [1.1,1.5] [-0.0,infinity] = [1.0,infinity]; pow [1.1,1.5] [0.1,0.1] = [0X1.02739C65D58BFP+0,0X1.0A97DCE72A0CBP+0]; pow [1.1,1.5] [0.1,1.0] = [0X1.02739C65D58BFP+0,0X1.8P+0]; pow [1.1,1.5] [0.1,2.5] = [0X1.02739C65D58BFP+0,0X1.60B9FD68A4555P+1]; pow [1.1,1.5] [0.1,infinity] = [0X1.02739C65D58BFP+0,infinity]; pow [1.1,1.5] [1.0,1.0] = [0X1.199999999999AP+0,0X1.8P+0]; pow [1.1,1.5] [1.0,2.5] = [0X1.199999999999AP+0,0X1.60B9FD68A4555P+1]; pow [1.1,1.5] [1.0,infinity] = [0X1.199999999999AP+0,infinity]; pow [1.1,1.5] [2.5,2.5] = [0X1.44E1080833B25P+0,0X1.60B9FD68A4555P+1]; pow [1.1,1.5] [2.5,infinity] = [0X1.44E1080833B25P+0,infinity]; pow [1.1,1.5] [-0.1,0.1] = [0X1.EBA7C9E4D31E9P-1,0X1.0A97DCE72A0CBP+0]; pow [1.1,1.5] [-0.1,1.0] = [0X1.EBA7C9E4D31E9P-1,0X1.8P+0]; pow [1.1,1.5] [-0.1,2.5] = [0X1.EBA7C9E4D31E9P-1,0X1.60B9FD68A4555P+1]; pow [1.1,1.5] [-0.1,infinity] = [0X1.EBA7C9E4D31E9P-1,infinity]; pow [1.1,1.5] [-1.0,0.1] = [0X1.5555555555555P-1,0X1.0A97DCE72A0CBP+0]; pow [1.1,1.5] [-1.0,1.0] = [0X1.5555555555555P-1,0X1.8P+0]; pow [1.1,1.5] [-1.0,2.5] = [0X1.5555555555555P-1,0X1.60B9FD68A4555P+1]; pow [1.1,1.5] [-1.0,infinity] = [0X1.5555555555555P-1,infinity]; pow [1.1,1.5] [-2.5,0.1] = [0X1.7398BF1D1EE6FP-2,0X1.0A97DCE72A0CBP+0]; pow [1.1,1.5] [-2.5,1.0] = [0X1.7398BF1D1EE6FP-2,0X1.8P+0]; pow [1.1,1.5] [-2.5,2.5] = [0X1.7398BF1D1EE6FP-2,0X1.60B9FD68A4555P+1]; pow [1.1,1.5] [-2.5,infinity] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [1.1,1.5] [-infinity,0.1] = [0X0P+0,0X1.0A97DCE72A0CBP+0]; pow [1.1,1.5] [-infinity,1.0] = [0X0P+0,0X1.8P+0]; pow [1.1,1.5] [-infinity,2.5] = [0X0P+0,0X1.60B9FD68A4555P+1]; pow [1.1,1.5] [entire] = [0X0P+0,infinity]; pow [1.1,1.5] [-1.0,0.0] = [0X1.5555555555555P-1,1.0]; pow [1.1,1.5] [-1.0,-0.0] = [0X1.5555555555555P-1,1.0]; pow [1.1,1.5] [-2.5,0.0] = [0X1.7398BF1D1EE6FP-2,1.0]; pow [1.1,1.5] [-2.5,-0.0] = [0X1.7398BF1D1EE6FP-2,1.0]; pow [1.1,1.5] [-infinity,0.0] = [0X0P+0,1.0]; pow [1.1,1.5] [-infinity,-0.0] = [0X0P+0,1.0]; pow [1.1,1.5] [-0.1,-0.1] = [0X1.EBA7C9E4D31E9P-1,0X1.FB24AF5281928P-1]; pow [1.1,1.5] [-1.0,-0.1] = [0X1.5555555555555P-1,0X1.FB24AF5281928P-1]; pow [1.1,1.5] [-2.5,-0.1] = [0X1.7398BF1D1EE6FP-2,0X1.FB24AF5281928P-1]; pow [1.1,1.5] [-infinity,-0.1] = [0X0P+0,0X1.FB24AF5281928P-1]; pow [1.1,1.5] [-1.0,-1.0] = [0X1.5555555555555P-1,0X1.D1745D1745D17P-1]; pow [1.1,1.5] [-2.5,-1.0] = [0X1.7398BF1D1EE6FP-2,0X1.D1745D1745D17P-1]; pow [1.1,1.5] [-infinity,-1.0] = [0X0P+0,0X1.D1745D1745D17P-1]; pow [1.1,1.5] [-2.5,-2.5] = [0X1.7398BF1D1EE6FP-2,0X1.9372D999784C8P-1]; pow [1.1,1.5] [-infinity,-2.5] = [0X0P+0,0X1.9372D999784C8P-1]; pow [1.1,infinity] [empty] = [empty]; pow [1.1,infinity] [0.0,0.0] = [1.0,1.0]; pow [1.1,infinity] [-0.0,-0.0] = [1.0,1.0]; pow [1.1,infinity] [0.0,1.0] = [1.0,infinity]; pow [1.1,infinity] [-0.0,1.0] = [1.0,infinity]; pow [1.1,infinity] [0.0,2.5] = [1.0,infinity]; pow [1.1,infinity] [-0.0,2.5] = [1.0,infinity]; pow [1.1,infinity] [0.0,infinity] = [1.0,infinity]; pow [1.1,infinity] [-0.0,infinity] = [1.0,infinity]; pow [1.1,infinity] [0.1,0.1] = [0X1.02739C65D58BFP+0,infinity]; pow [1.1,infinity] [0.1,1.0] = [0X1.02739C65D58BFP+0,infinity]; pow [1.1,infinity] [0.1,2.5] = [0X1.02739C65D58BFP+0,infinity]; pow [1.1,infinity] [0.1,infinity] = [0X1.02739C65D58BFP+0,infinity]; pow [1.1,infinity] [1.0,1.0] = [0X1.199999999999AP+0,infinity]; pow [1.1,infinity] [1.0,2.5] = [0X1.199999999999AP+0,infinity]; pow [1.1,infinity] [1.0,infinity] = [0X1.199999999999AP+0,infinity]; pow [1.1,infinity] [2.5,2.5] = [0X1.44E1080833B25P+0,infinity]; pow [1.1,infinity] [2.5,infinity] = [0X1.44E1080833B25P+0,infinity]; pow [1.1,infinity] [-0.1,0.1] = [0X0P+0,infinity]; pow [1.1,infinity] [-0.1,1.0] = [0X0P+0,infinity]; pow [1.1,infinity] [-0.1,2.5] = [0X0P+0,infinity]; pow [1.1,infinity] [-0.1,infinity] = [0X0P+0,infinity]; pow [1.1,infinity] [-1.0,0.1] = [0X0P+0,infinity]; pow [1.1,infinity] [-1.0,1.0] = [0X0P+0,infinity]; pow [1.1,infinity] [-1.0,2.5] = [0X0P+0,infinity]; pow [1.1,infinity] [-1.0,infinity] = [0X0P+0,infinity]; pow [1.1,infinity] [-2.5,0.1] = [0X0P+0,infinity]; pow [1.1,infinity] [-2.5,1.0] = [0X0P+0,infinity]; pow [1.1,infinity] [-2.5,2.5] = [0X0P+0,infinity]; pow [1.1,infinity] [-2.5,infinity] = [0X0P+0,infinity]; pow [1.1,infinity] [-infinity,0.1] = [0X0P+0,infinity]; pow [1.1,infinity] [-infinity,1.0] = [0X0P+0,infinity]; pow [1.1,infinity] [-infinity,2.5] = [0X0P+0,infinity]; pow [1.1,infinity] [entire] = [0X0P+0,infinity]; pow [1.1,infinity] [-1.0,0.0] = [0X0P+0,1.0]; pow [1.1,infinity] [-1.0,-0.0] = [0X0P+0,1.0]; pow [1.1,infinity] [-2.5,0.0] = [0X0P+0,1.0]; pow [1.1,infinity] [-2.5,-0.0] = [0X0P+0,1.0]; pow [1.1,infinity] [-infinity,0.0] = [0X0P+0,1.0]; pow [1.1,infinity] [-infinity,-0.0] = [0X0P+0,1.0]; pow [1.1,infinity] [-0.1,-0.1] = [0X0P+0,0X1.FB24AF5281928P-1]; pow [1.1,infinity] [-1.0,-0.1] = [0X0P+0,0X1.FB24AF5281928P-1]; pow [1.1,infinity] [-2.5,-0.1] = [0X0P+0,0X1.FB24AF5281928P-1]; pow [1.1,infinity] [-infinity,-0.1] = [0X0P+0,0X1.FB24AF5281928P-1]; pow [1.1,infinity] [-1.0,-1.0] = [0X0P+0,0X1.D1745D1745D17P-1]; pow [1.1,infinity] [-2.5,-1.0] = [0X0P+0,0X1.D1745D1745D17P-1]; pow [1.1,infinity] [-infinity,-1.0] = [0X0P+0,0X1.D1745D1745D17P-1]; pow [1.1,infinity] [-2.5,-2.5] = [0X0P+0,0X1.9372D999784C8P-1]; pow [1.1,infinity] [-infinity,-2.5] = [0X0P+0,0X1.9372D999784C8P-1]; pow [0.0,0.5] [empty] = [empty]; pow [0.0,0.5] [0.0,0.0] = [1.0,1.0]; pow [0.0,0.5] [-0.0,-0.0] = [1.0,1.0]; pow [0.0,0.5] [0.0,1.0] = [0.0,1.0]; pow [0.0,0.5] [-0.0,1.0] = [0.0,1.0]; pow [0.0,0.5] [0.0,2.5] = [0.0,1.0]; pow [0.0,0.5] [-0.0,2.5] = [0.0,1.0]; pow [0.0,0.5] [0.0,infinity] = [0.0,1.0]; pow [0.0,0.5] [-0.0,infinity] = [0.0,1.0]; pow [0.0,0.5] [0.1,0.1] = [0.0,0X1.DDB680117AB13P-1]; pow [0.0,0.5] [0.1,1.0] = [0.0,0X1.DDB680117AB13P-1]; pow [0.0,0.5] [0.1,2.5] = [0.0,0X1.DDB680117AB13P-1]; pow [0.0,0.5] [0.1,infinity] = [0.0,0X1.DDB680117AB13P-1]; pow [0.0,0.5] [1.0,1.0] = [0.0,0.5]; pow [0.0,0.5] [1.0,2.5] = [0.0,0.5]; pow [0.0,0.5] [1.0,infinity] = [0.0,0.5]; pow [0.0,0.5] [2.5,2.5] = [0.0,0X1.6A09E667F3BCDP-3]; pow [0.0,0.5] [2.5,infinity] = [0.0,0X1.6A09E667F3BCDP-3]; pow [0.0,0.5] [-0.1,0.1] = [0.0,infinity]; pow [0.0,0.5] [-0.1,1.0] = [0.0,infinity]; pow [0.0,0.5] [-0.1,2.5] = [0.0,infinity]; pow [0.0,0.5] [-0.1,infinity] = [0.0,infinity]; pow [0.0,0.5] [-1.0,0.1] = [0.0,infinity]; pow [0.0,0.5] [-1.0,1.0] = [0.0,infinity]; pow [0.0,0.5] [-1.0,2.5] = [0.0,infinity]; pow [0.0,0.5] [-1.0,infinity] = [0.0,infinity]; pow [0.0,0.5] [-2.5,0.1] = [0.0,infinity]; pow [0.0,0.5] [-2.5,1.0] = [0.0,infinity]; pow [0.0,0.5] [-2.5,2.5] = [0.0,infinity]; pow [0.0,0.5] [-2.5,infinity] = [0.0,infinity]; pow [0.0,0.5] [-infinity,0.1] = [0.0,infinity]; pow [0.0,0.5] [-infinity,1.0] = [0.0,infinity]; pow [0.0,0.5] [-infinity,2.5] = [0.0,infinity]; pow [0.0,0.5] [entire] = [0.0,infinity]; pow [0.0,0.5] [-1.0,0.0] = [1.0,infinity]; pow [0.0,0.5] [-1.0,-0.0] = [1.0,infinity]; pow [0.0,0.5] [-2.5,0.0] = [1.0,infinity]; pow [0.0,0.5] [-2.5,-0.0] = [1.0,infinity]; pow [0.0,0.5] [-infinity,0.0] = [1.0,infinity]; pow [0.0,0.5] [-infinity,-0.0] = [1.0,infinity]; pow [0.0,0.5] [-0.1,-0.1] = [0X1.125FBEE250664P+0,infinity]; pow [0.0,0.5] [-1.0,-0.1] = [0X1.125FBEE250664P+0,infinity]; pow [0.0,0.5] [-2.5,-0.1] = [0X1.125FBEE250664P+0,infinity]; pow [0.0,0.5] [-infinity,-0.1] = [0X1.125FBEE250664P+0,infinity]; pow [0.0,0.5] [-1.0,-1.0] = [0X1P+1,infinity]; pow [0.0,0.5] [-2.5,-1.0] = [0X1P+1,infinity]; pow [0.0,0.5] [-infinity,-1.0] = [0X1P+1,infinity]; pow [0.0,0.5] [-2.5,-2.5] = [0X1.6A09E667F3BCCP+2,infinity]; pow [0.0,0.5] [-infinity,-2.5] = [0X1.6A09E667F3BCCP+2,infinity]; pow [0.0,1.0] [empty] = [empty]; pow [0.0,1.0] [0.0,0.0] = [1.0,1.0]; pow [0.0,1.0] [-0.0,-0.0] = [1.0,1.0]; pow [0.0,1.0] [0.0,1.0] = [0.0,1.0]; pow [0.0,1.0] [-0.0,1.0] = [0.0,1.0]; pow [0.0,1.0] [0.0,2.5] = [0.0,1.0]; pow [0.0,1.0] [-0.0,2.5] = [0.0,1.0]; pow [0.0,1.0] [0.0,infinity] = [0.0,1.0]; pow [0.0,1.0] [-0.0,infinity] = [0.0,1.0]; pow [0.0,1.0] [0.1,0.1] = [0.0,1.0]; pow [0.0,1.0] [0.1,1.0] = [0.0,1.0]; pow [0.0,1.0] [0.1,2.5] = [0.0,1.0]; pow [0.0,1.0] [0.1,infinity] = [0.0,1.0]; pow [0.0,1.0] [1.0,1.0] = [0.0,1.0]; pow [0.0,1.0] [1.0,2.5] = [0.0,1.0]; pow [0.0,1.0] [1.0,infinity] = [0.0,1.0]; pow [0.0,1.0] [2.5,2.5] = [0.0,1.0]; pow [0.0,1.0] [2.5,infinity] = [0.0,1.0]; pow [0.0,1.0] [-0.1,0.1] = [0.0,infinity]; pow [0.0,1.0] [-0.1,1.0] = [0.0,infinity]; pow [0.0,1.0] [-0.1,2.5] = [0.0,infinity]; pow [0.0,1.0] [-0.1,infinity] = [0.0,infinity]; pow [0.0,1.0] [-1.0,0.1] = [0.0,infinity]; pow [0.0,1.0] [-1.0,1.0] = [0.0,infinity]; pow [0.0,1.0] [-1.0,2.5] = [0.0,infinity]; pow [0.0,1.0] [-1.0,infinity] = [0.0,infinity]; pow [0.0,1.0] [-2.5,0.1] = [0.0,infinity]; pow [0.0,1.0] [-2.5,1.0] = [0.0,infinity]; pow [0.0,1.0] [-2.5,2.5] = [0.0,infinity]; pow [0.0,1.0] [-2.5,infinity] = [0.0,infinity]; pow [0.0,1.0] [-infinity,0.1] = [0.0,infinity]; pow [0.0,1.0] [-infinity,1.0] = [0.0,infinity]; pow [0.0,1.0] [-infinity,2.5] = [0.0,infinity]; pow [0.0,1.0] [entire] = [0.0,infinity]; pow [0.0,1.0] [-0.1,0.0] = [1.0,infinity]; pow [0.0,1.0] [-0.1,-0.0] = [1.0,infinity]; pow [0.0,1.0] [-1.0,0.0] = [1.0,infinity]; pow [0.0,1.0] [-1.0,-0.0] = [1.0,infinity]; pow [0.0,1.0] [-2.5,0.0] = [1.0,infinity]; pow [0.0,1.0] [-2.5,-0.0] = [1.0,infinity]; pow [0.0,1.0] [-infinity,0.0] = [1.0,infinity]; pow [0.0,1.0] [-infinity,-0.0] = [1.0,infinity]; pow [0.0,1.0] [-0.1,-0.1] = [1.0,infinity]; pow [0.0,1.0] [-1.0,-0.1] = [1.0,infinity]; pow [0.0,1.0] [-2.5,-0.1] = [1.0,infinity]; pow [0.0,1.0] [-infinity,-0.1] = [1.0,infinity]; pow [0.0,1.0] [-1.0,-1.0] = [1.0,infinity]; pow [0.0,1.0] [-2.5,-1.0] = [1.0,infinity]; pow [0.0,1.0] [-infinity,-1.0] = [1.0,infinity]; pow [0.0,1.0] [-2.5,-2.5] = [1.0,infinity]; pow [0.0,1.0] [-infinity,-2.5] = [1.0,infinity]; pow [0.0,1.5] [empty] = [empty]; pow [0.0,1.5] [0.0,0.0] = [1.0,1.0]; pow [0.0,1.5] [-0.0,-0.0] = [1.0,1.0]; pow [0.0,1.5] [0.0,1.0] = [0.0,1.5]; pow [0.0,1.5] [-0.0,1.0] = [0.0,1.5]; pow [0.0,1.5] [0.0,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [0.0,1.5] [-0.0,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [0.0,1.5] [0.0,infinity] = [0.0,infinity]; pow [0.0,1.5] [-0.0,infinity] = [0.0,infinity]; pow [0.0,1.5] [0.1,0.1] = [0.0,0X1.0A97DCE72A0CBP+0]; pow [0.0,1.5] [0.1,1.0] = [0.0,1.5]; pow [0.0,1.5] [0.1,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [0.0,1.5] [0.1,infinity] = [0.0,infinity]; pow [0.0,1.5] [1.0,1.0] = [0.0,1.5]; pow [0.0,1.5] [1.0,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [0.0,1.5] [1.0,infinity] = [0.0,infinity]; pow [0.0,1.5] [2.5,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [0.0,1.5] [2.5,infinity] = [0.0,infinity]; pow [0.0,1.5] [-0.1,0.1] = [0.0,infinity]; pow [0.0,1.5] [-0.1,1.0] = [0.0,infinity]; pow [0.0,1.5] [-0.1,2.5] = [0.0,infinity]; pow [0.0,1.5] [-0.1,infinity] = [0.0,infinity]; pow [0.0,1.5] [-1.0,0.1] = [0.0,infinity]; pow [0.0,1.5] [-1.0,1.0] = [0.0,infinity]; pow [0.0,1.5] [-1.0,2.5] = [0.0,infinity]; pow [0.0,1.5] [-1.0,infinity] = [0.0,infinity]; pow [0.0,1.5] [-2.5,0.1] = [0.0,infinity]; pow [0.0,1.5] [-2.5,1.0] = [0.0,infinity]; pow [0.0,1.5] [-2.5,2.5] = [0.0,infinity]; pow [0.0,1.5] [-2.5,infinity] = [0.0,infinity]; pow [0.0,1.5] [-infinity,0.1] = [0.0,infinity]; pow [0.0,1.5] [-infinity,1.0] = [0.0,infinity]; pow [0.0,1.5] [-infinity,2.5] = [0.0,infinity]; pow [0.0,1.5] [entire] = [0.0,infinity]; pow [0.0,1.5] [-1.0,0.0] = [0X1.5555555555555P-1,infinity]; pow [0.0,1.5] [-1.0,-0.0] = [0X1.5555555555555P-1,infinity]; pow [0.0,1.5] [-2.5,0.0] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [0.0,1.5] [-2.5,-0.0] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [0.0,1.5] [-infinity,0.0] = [0.0,infinity]; pow [0.0,1.5] [-infinity,-0.0] = [0.0,infinity]; pow [0.0,1.5] [-0.1,-0.1] = [0X1.EBA7C9E4D31E9P-1,infinity]; pow [0.0,1.5] [-1.0,-0.1] = [0X1.5555555555555P-1,infinity]; pow [0.0,1.5] [-2.5,-0.1] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [0.0,1.5] [-infinity,-0.1] = [0.0,infinity]; pow [0.0,1.5] [-1.0,-1.0] = [0X1.5555555555555P-1,infinity]; pow [0.0,1.5] [-2.5,-1.0] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [0.0,1.5] [-infinity,-1.0] = [0.0,infinity]; pow [0.0,1.5] [-2.5,-2.5] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [0.0,1.5] [-infinity,-2.5] = [0.0,infinity]; pow [0.0,infinity] [empty] = [empty]; pow [0.0,infinity] [0.0,0.0] = [1.0,1.0]; pow [0.0,infinity] [-0.0,-0.0] = [1.0,1.0]; pow [0.0,infinity] [0.0,1.0] = [0.0,infinity]; pow [0.0,infinity] [-0.0,1.0] = [0.0,infinity]; pow [0.0,infinity] [0.0,2.5] = [0.0,infinity]; pow [0.0,infinity] [-0.0,2.5] = [0.0,infinity]; pow [0.0,infinity] [0.0,infinity] = [0.0,infinity]; pow [0.0,infinity] [-0.0,infinity] = [0.0,infinity]; pow [0.0,infinity] [0.1,0.1] = [0.0,infinity]; pow [0.0,infinity] [0.1,1.0] = [0.0,infinity]; pow [0.0,infinity] [0.1,2.5] = [0.0,infinity]; pow [0.0,infinity] [0.1,infinity] = [0.0,infinity]; pow [0.0,infinity] [1.0,1.0] = [0.0,infinity]; pow [0.0,infinity] [1.0,2.5] = [0.0,infinity]; pow [0.0,infinity] [1.0,infinity] = [0.0,infinity]; pow [0.0,infinity] [2.5,2.5] = [0.0,infinity]; pow [0.0,infinity] [2.5,infinity] = [0.0,infinity]; pow [0.0,infinity] [-0.1,0.1] = [0.0,infinity]; pow [0.0,infinity] [-0.1,1.0] = [0.0,infinity]; pow [0.0,infinity] [-0.1,2.5] = [0.0,infinity]; pow [0.0,infinity] [-0.1,infinity] = [0.0,infinity]; pow [0.0,infinity] [-1.0,0.1] = [0.0,infinity]; pow [0.0,infinity] [-1.0,1.0] = [0.0,infinity]; pow [0.0,infinity] [-1.0,2.5] = [0.0,infinity]; pow [0.0,infinity] [-1.0,infinity] = [0.0,infinity]; pow [0.0,infinity] [-2.5,0.1] = [0.0,infinity]; pow [0.0,infinity] [-2.5,1.0] = [0.0,infinity]; pow [0.0,infinity] [-2.5,2.5] = [0.0,infinity]; pow [0.0,infinity] [-2.5,infinity] = [0.0,infinity]; pow [0.0,infinity] [-infinity,0.1] = [0.0,infinity]; pow [0.0,infinity] [-infinity,1.0] = [0.0,infinity]; pow [0.0,infinity] [-infinity,2.5] = [0.0,infinity]; pow [0.0,infinity] [entire] = [0.0,infinity]; pow [0.0,infinity] [-1.0,0.0] = [0.0,infinity]; pow [0.0,infinity] [-1.0,-0.0] = [0.0,infinity]; pow [0.0,infinity] [-2.5,0.0] = [0.0,infinity]; pow [0.0,infinity] [-2.5,-0.0] = [0.0,infinity]; pow [0.0,infinity] [-infinity,0.0] = [0.0,infinity]; pow [0.0,infinity] [-infinity,-0.0] = [0.0,infinity]; pow [0.0,infinity] [-0.1,-0.1] = [0.0,infinity]; pow [0.0,infinity] [-1.0,-0.1] = [0.0,infinity]; pow [0.0,infinity] [-2.5,-0.1] = [0.0,infinity]; pow [0.0,infinity] [-infinity,-0.1] = [0.0,infinity]; pow [0.0,infinity] [-1.0,-1.0] = [0.0,infinity]; pow [0.0,infinity] [-2.5,-1.0] = [0.0,infinity]; pow [0.0,infinity] [-infinity,-1.0] = [0.0,infinity]; pow [0.0,infinity] [-infinity,-2.5] = [0.0,infinity]; pow [0.0,infinity] [-2.5,-2.5] = [0.0,infinity]; pow [-0.0,0.5] [empty] = [empty]; pow [-0.0,0.5] [0.0,0.0] = [1.0,1.0]; pow [-0.0,0.5] [-0.0,-0.0] = [1.0,1.0]; pow [-0.0,0.5] [0.0,1.0] = [0.0,1.0]; pow [-0.0,0.5] [-0.0,1.0] = [0.0,1.0]; pow [-0.0,0.5] [0.0,2.5] = [0.0,1.0]; pow [-0.0,0.5] [-0.0,2.5] = [0.0,1.0]; pow [-0.0,0.5] [0.0,infinity] = [0.0,1.0]; pow [-0.0,0.5] [-0.0,infinity] = [0.0,1.0]; pow [-0.0,0.5] [0.1,0.1] = [0.0,0X1.DDB680117AB13P-1]; pow [-0.0,0.5] [0.1,1.0] = [0.0,0X1.DDB680117AB13P-1]; pow [-0.0,0.5] [0.1,2.5] = [0.0,0X1.DDB680117AB13P-1]; pow [-0.0,0.5] [0.1,infinity] = [0.0,0X1.DDB680117AB13P-1]; pow [-0.0,0.5] [1.0,1.0] = [0.0,0.5]; pow [-0.0,0.5] [1.0,2.5] = [0.0,0.5]; pow [-0.0,0.5] [1.0,infinity] = [0.0,0.5]; pow [-0.0,0.5] [2.5,2.5] = [0.0,0X1.6A09E667F3BCDP-3]; pow [-0.0,0.5] [2.5,infinity] = [0.0,0X1.6A09E667F3BCDP-3]; pow [-0.0,0.5] [-0.1,0.1] = [0.0,infinity]; pow [-0.0,0.5] [-0.1,1.0] = [0.0,infinity]; pow [-0.0,0.5] [-0.1,2.5] = [0.0,infinity]; pow [-0.0,0.5] [-0.1,infinity] = [0.0,infinity]; pow [-0.0,0.5] [-1.0,0.1] = [0.0,infinity]; pow [-0.0,0.5] [-1.0,1.0] = [0.0,infinity]; pow [-0.0,0.5] [-1.0,2.5] = [0.0,infinity]; pow [-0.0,0.5] [-1.0,infinity] = [0.0,infinity]; pow [-0.0,0.5] [-2.5,0.1] = [0.0,infinity]; pow [-0.0,0.5] [-2.5,1.0] = [0.0,infinity]; pow [-0.0,0.5] [-2.5,2.5] = [0.0,infinity]; pow [-0.0,0.5] [-2.5,infinity] = [0.0,infinity]; pow [-0.0,0.5] [-infinity,0.1] = [0.0,infinity]; pow [-0.0,0.5] [-infinity,1.0] = [0.0,infinity]; pow [-0.0,0.5] [-infinity,2.5] = [0.0,infinity]; pow [-0.0,0.5] [entire] = [0.0,infinity]; pow [-0.0,0.5] [-1.0,0.0] = [1.0,infinity]; pow [-0.0,0.5] [-1.0,-0.0] = [1.0,infinity]; pow [-0.0,0.5] [-2.5,0.0] = [1.0,infinity]; pow [-0.0,0.5] [-2.5,-0.0] = [1.0,infinity]; pow [-0.0,0.5] [-infinity,0.0] = [1.0,infinity]; pow [-0.0,0.5] [-infinity,-0.0] = [1.0,infinity]; pow [-0.0,0.5] [-0.1,-0.1] = [0X1.125FBEE250664P+0,infinity]; pow [-0.0,0.5] [-1.0,-0.1] = [0X1.125FBEE250664P+0,infinity]; pow [-0.0,0.5] [-2.5,-0.1] = [0X1.125FBEE250664P+0,infinity]; pow [-0.0,0.5] [-infinity,-0.1] = [0X1.125FBEE250664P+0,infinity]; pow [-0.0,0.5] [-1.0,-1.0] = [0X1P+1,infinity]; pow [-0.0,0.5] [-2.5,-1.0] = [0X1P+1,infinity]; pow [-0.0,0.5] [-infinity,-1.0] = [0X1P+1,infinity]; pow [-0.0,0.5] [-2.5,-2.5] = [0X1.6A09E667F3BCCP+2,infinity]; pow [-0.0,0.5] [-infinity,-2.5] = [0X1.6A09E667F3BCCP+2,infinity]; pow [-0.0,1.0] [empty] = [empty]; pow [-0.0,1.0] [0.0,0.0] = [1.0,1.0]; pow [-0.0,1.0] [-0.0,-0.0] = [1.0,1.0]; pow [-0.0,1.0] [0.0,1.0] = [0.0,1.0]; pow [-0.0,1.0] [-0.0,1.0] = [0.0,1.0]; pow [-0.0,1.0] [0.0,2.5] = [0.0,1.0]; pow [-0.0,1.0] [-0.0,2.5] = [0.0,1.0]; pow [-0.0,1.0] [0.0,infinity] = [0.0,1.0]; pow [-0.0,1.0] [-0.0,infinity] = [0.0,1.0]; pow [-0.0,1.0] [0.1,0.1] = [0.0,1.0]; pow [-0.0,1.0] [0.1,1.0] = [0.0,1.0]; pow [-0.0,1.0] [0.1,2.5] = [0.0,1.0]; pow [-0.0,1.0] [0.1,infinity] = [0.0,1.0]; pow [-0.0,1.0] [1.0,1.0] = [0.0,1.0]; pow [-0.0,1.0] [1.0,2.5] = [0.0,1.0]; pow [-0.0,1.0] [1.0,infinity] = [0.0,1.0]; pow [-0.0,1.0] [2.5,2.5] = [0.0,1.0]; pow [-0.0,1.0] [2.5,infinity] = [0.0,1.0]; pow [-0.0,1.0] [-0.1,0.1] = [0.0,infinity]; pow [-0.0,1.0] [-0.1,1.0] = [0.0,infinity]; pow [-0.0,1.0] [-0.1,2.5] = [0.0,infinity]; pow [-0.0,1.0] [-0.1,infinity] = [0.0,infinity]; pow [-0.0,1.0] [-1.0,0.1] = [0.0,infinity]; pow [-0.0,1.0] [-1.0,1.0] = [0.0,infinity]; pow [-0.0,1.0] [-1.0,2.5] = [0.0,infinity]; pow [-0.0,1.0] [-1.0,infinity] = [0.0,infinity]; pow [-0.0,1.0] [-2.5,0.1] = [0.0,infinity]; pow [-0.0,1.0] [-2.5,1.0] = [0.0,infinity]; pow [-0.0,1.0] [-2.5,2.5] = [0.0,infinity]; pow [-0.0,1.0] [-2.5,infinity] = [0.0,infinity]; pow [-0.0,1.0] [-infinity,0.1] = [0.0,infinity]; pow [-0.0,1.0] [-infinity,1.0] = [0.0,infinity]; pow [-0.0,1.0] [-infinity,2.5] = [0.0,infinity]; pow [-0.0,1.0] [entire] = [0.0,infinity]; pow [-0.0,1.0] [-0.1,0.0] = [1.0,infinity]; pow [-0.0,1.0] [-0.1,-0.0] = [1.0,infinity]; pow [-0.0,1.0] [-1.0,0.0] = [1.0,infinity]; pow [-0.0,1.0] [-1.0,-0.0] = [1.0,infinity]; pow [-0.0,1.0] [-2.5,0.0] = [1.0,infinity]; pow [-0.0,1.0] [-2.5,-0.0] = [1.0,infinity]; pow [-0.0,1.0] [-infinity,0.0] = [1.0,infinity]; pow [-0.0,1.0] [-infinity,-0.0] = [1.0,infinity]; pow [-0.0,1.0] [-0.1,-0.1] = [1.0,infinity]; pow [-0.0,1.0] [-1.0,-0.1] = [1.0,infinity]; pow [-0.0,1.0] [-2.5,-0.1] = [1.0,infinity]; pow [-0.0,1.0] [-infinity,-0.1] = [1.0,infinity]; pow [-0.0,1.0] [-1.0,-1.0] = [1.0,infinity]; pow [-0.0,1.0] [-2.5,-1.0] = [1.0,infinity]; pow [-0.0,1.0] [-infinity,-1.0] = [1.0,infinity]; pow [-0.0,1.0] [-2.5,-2.5] = [1.0,infinity]; pow [-0.0,1.0] [-infinity,-2.5] = [1.0,infinity]; pow [-0.0,1.5] [empty] = [empty]; pow [-0.0,1.5] [0.0,0.0] = [1.0,1.0]; pow [-0.0,1.5] [-0.0,-0.0] = [1.0,1.0]; pow [-0.0,1.5] [0.0,1.0] = [0.0,1.5]; pow [-0.0,1.5] [-0.0,1.0] = [0.0,1.5]; pow [-0.0,1.5] [0.0,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [-0.0,1.5] [-0.0,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [-0.0,1.5] [0.0,infinity] = [0.0,infinity]; pow [-0.0,1.5] [-0.0,infinity] = [0.0,infinity]; pow [-0.0,1.5] [0.1,0.1] = [0.0,0X1.0A97DCE72A0CBP+0]; pow [-0.0,1.5] [0.1,1.0] = [0.0,1.5]; pow [-0.0,1.5] [0.1,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [-0.0,1.5] [0.1,infinity] = [0.0,infinity]; pow [-0.0,1.5] [1.0,1.0] = [0.0,1.5]; pow [-0.0,1.5] [1.0,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [-0.0,1.5] [1.0,infinity] = [0.0,infinity]; pow [-0.0,1.5] [2.5,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [-0.0,1.5] [2.5,infinity] = [0.0,infinity]; pow [-0.0,1.5] [-0.1,0.1] = [0.0,infinity]; pow [-0.0,1.5] [-0.1,1.0] = [0.0,infinity]; pow [-0.0,1.5] [-0.1,2.5] = [0.0,infinity]; pow [-0.0,1.5] [-0.1,infinity] = [0.0,infinity]; pow [-0.0,1.5] [-1.0,0.1] = [0.0,infinity]; pow [-0.0,1.5] [-1.0,1.0] = [0.0,infinity]; pow [-0.0,1.5] [-1.0,2.5] = [0.0,infinity]; pow [-0.0,1.5] [-1.0,infinity] = [0.0,infinity]; pow [-0.0,1.5] [-2.5,0.1] = [0.0,infinity]; pow [-0.0,1.5] [-2.5,1.0] = [0.0,infinity]; pow [-0.0,1.5] [-2.5,2.5] = [0.0,infinity]; pow [-0.0,1.5] [-2.5,infinity] = [0.0,infinity]; pow [-0.0,1.5] [-infinity,0.1] = [0.0,infinity]; pow [-0.0,1.5] [-infinity,1.0] = [0.0,infinity]; pow [-0.0,1.5] [-infinity,2.5] = [0.0,infinity]; pow [-0.0,1.5] [entire] = [0.0,infinity]; pow [-0.0,1.5] [-1.0,0.0] = [0X1.5555555555555P-1,infinity]; pow [-0.0,1.5] [-1.0,-0.0] = [0X1.5555555555555P-1,infinity]; pow [-0.0,1.5] [-2.5,0.0] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [-0.0,1.5] [-2.5,-0.0] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [-0.0,1.5] [-infinity,0.0] = [0.0,infinity]; pow [-0.0,1.5] [-infinity,-0.0] = [0.0,infinity]; pow [-0.0,1.5] [-0.1,-0.1] = [0X1.EBA7C9E4D31E9P-1,infinity]; pow [-0.0,1.5] [-1.0,-0.1] = [0X1.5555555555555P-1,infinity]; pow [-0.0,1.5] [-2.5,-0.1] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [-0.0,1.5] [-infinity,-0.1] = [0.0,infinity]; pow [-0.0,1.5] [-1.0,-1.0] = [0X1.5555555555555P-1,infinity]; pow [-0.0,1.5] [-2.5,-1.0] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [-0.0,1.5] [-infinity,-1.0] = [0.0,infinity]; pow [-0.0,1.5] [-2.5,-2.5] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [-0.0,1.5] [-infinity,-2.5] = [0.0,infinity]; pow [-0.0,infinity] [empty] = [empty]; pow [-0.0,infinity] [0.0,0.0] = [1.0,1.0]; pow [-0.0,infinity] [-0.0,-0.0] = [1.0,1.0]; pow [-0.0,infinity] [0.0,1.0] = [0.0,infinity]; pow [-0.0,infinity] [-0.0,1.0] = [0.0,infinity]; pow [-0.0,infinity] [0.0,2.5] = [0.0,infinity]; pow [-0.0,infinity] [-0.0,2.5] = [0.0,infinity]; pow [-0.0,infinity] [0.0,infinity] = [0.0,infinity]; pow [-0.0,infinity] [-0.0,infinity] = [0.0,infinity]; pow [-0.0,infinity] [0.1,0.1] = [0.0,infinity]; pow [-0.0,infinity] [0.1,1.0] = [0.0,infinity]; pow [-0.0,infinity] [0.1,2.5] = [0.0,infinity]; pow [-0.0,infinity] [0.1,infinity] = [0.0,infinity]; pow [-0.0,infinity] [1.0,1.0] = [0.0,infinity]; pow [-0.0,infinity] [1.0,2.5] = [0.0,infinity]; pow [-0.0,infinity] [1.0,infinity] = [0.0,infinity]; pow [-0.0,infinity] [2.5,2.5] = [0.0,infinity]; pow [-0.0,infinity] [2.5,infinity] = [0.0,infinity]; pow [-0.0,infinity] [-0.1,0.1] = [0.0,infinity]; pow [-0.0,infinity] [-0.1,1.0] = [0.0,infinity]; pow [-0.0,infinity] [-0.1,2.5] = [0.0,infinity]; pow [-0.0,infinity] [-0.1,infinity] = [0.0,infinity]; pow [-0.0,infinity] [-1.0,0.1] = [0.0,infinity]; pow [-0.0,infinity] [-1.0,1.0] = [0.0,infinity]; pow [-0.0,infinity] [-1.0,2.5] = [0.0,infinity]; pow [-0.0,infinity] [-1.0,infinity] = [0.0,infinity]; pow [-0.0,infinity] [-2.5,0.1] = [0.0,infinity]; pow [-0.0,infinity] [-2.5,1.0] = [0.0,infinity]; pow [-0.0,infinity] [-2.5,2.5] = [0.0,infinity]; pow [-0.0,infinity] [-2.5,infinity] = [0.0,infinity]; pow [-0.0,infinity] [-infinity,0.1] = [0.0,infinity]; pow [-0.0,infinity] [-infinity,1.0] = [0.0,infinity]; pow [-0.0,infinity] [-infinity,2.5] = [0.0,infinity]; pow [-0.0,infinity] [entire] = [0.0,infinity]; pow [-0.0,infinity] [-1.0,0.0] = [0.0,infinity]; pow [-0.0,infinity] [-1.0,-0.0] = [0.0,infinity]; pow [-0.0,infinity] [-2.5,0.0] = [0.0,infinity]; pow [-0.0,infinity] [-2.5,-0.0] = [0.0,infinity]; pow [-0.0,infinity] [-infinity,0.0] = [0.0,infinity]; pow [-0.0,infinity] [-infinity,-0.0] = [0.0,infinity]; pow [-0.0,infinity] [-0.1,-0.1] = [0.0,infinity]; pow [-0.0,infinity] [-1.0,-0.1] = [0.0,infinity]; pow [-0.0,infinity] [-2.5,-0.1] = [0.0,infinity]; pow [-0.0,infinity] [-infinity,-0.1] = [0.0,infinity]; pow [-0.0,infinity] [-1.0,-1.0] = [0.0,infinity]; pow [-0.0,infinity] [-2.5,-1.0] = [0.0,infinity]; pow [-0.0,infinity] [-infinity,-1.0] = [0.0,infinity]; pow [-0.0,infinity] [-infinity,-2.5] = [0.0,infinity]; pow [-0.0,infinity] [-2.5,-2.5] = [0.0,infinity]; pow [-0.1,0.5] [empty] = [empty]; pow [-0.1,0.5] [0.0,0.0] = [1.0,1.0]; pow [-0.1,0.5] [-0.0,-0.0] = [1.0,1.0]; pow [-0.1,0.5] [0.0,1.0] = [0.0,1.0]; pow [-0.1,0.5] [-0.0,1.0] = [0.0,1.0]; pow [-0.1,0.5] [0.0,2.5] = [0.0,1.0]; pow [-0.1,0.5] [-0.0,2.5] = [0.0,1.0]; pow [-0.1,0.5] [0.0,infinity] = [0.0,1.0]; pow [-0.1,0.5] [-0.0,infinity] = [0.0,1.0]; pow [-0.1,0.5] [0.1,0.1] = [0.0,0X1.DDB680117AB13P-1]; pow [-0.1,0.5] [0.1,1.0] = [0.0,0X1.DDB680117AB13P-1]; pow [-0.1,0.5] [0.1,2.5] = [0.0,0X1.DDB680117AB13P-1]; pow [-0.1,0.5] [0.1,infinity] = [0.0,0X1.DDB680117AB13P-1]; pow [-0.1,0.5] [1.0,1.0] = [0.0,0.5]; pow [-0.1,0.5] [1.0,2.5] = [0.0,0.5]; pow [-0.1,0.5] [1.0,infinity] = [0.0,0.5]; pow [-0.1,0.5] [2.5,2.5] = [0.0,0X1.6A09E667F3BCDP-3]; pow [-0.1,0.5] [2.5,infinity] = [0.0,0X1.6A09E667F3BCDP-3]; pow [-0.1,0.5] [-0.1,0.1] = [0.0,infinity]; pow [-0.1,0.5] [-0.1,1.0] = [0.0,infinity]; pow [-0.1,0.5] [-0.1,2.5] = [0.0,infinity]; pow [-0.1,0.5] [-0.1,infinity] = [0.0,infinity]; pow [-0.1,0.5] [-1.0,0.1] = [0.0,infinity]; pow [-0.1,0.5] [-1.0,1.0] = [0.0,infinity]; pow [-0.1,0.5] [-1.0,2.5] = [0.0,infinity]; pow [-0.1,0.5] [-1.0,infinity] = [0.0,infinity]; pow [-0.1,0.5] [-2.5,0.1] = [0.0,infinity]; pow [-0.1,0.5] [-2.5,1.0] = [0.0,infinity]; pow [-0.1,0.5] [-2.5,2.5] = [0.0,infinity]; pow [-0.1,0.5] [-2.5,infinity] = [0.0,infinity]; pow [-0.1,0.5] [-infinity,0.1] = [0.0,infinity]; pow [-0.1,0.5] [-infinity,1.0] = [0.0,infinity]; pow [-0.1,0.5] [-infinity,2.5] = [0.0,infinity]; pow [-0.1,0.5] [entire] = [0.0,infinity]; pow [-0.1,0.5] [-1.0,0.0] = [1.0,infinity]; pow [-0.1,0.5] [-1.0,-0.0] = [1.0,infinity]; pow [-0.1,0.5] [-2.5,0.0] = [1.0,infinity]; pow [-0.1,0.5] [-2.5,-0.0] = [1.0,infinity]; pow [-0.1,0.5] [-infinity,0.0] = [1.0,infinity]; pow [-0.1,0.5] [-infinity,-0.0] = [1.0,infinity]; pow [-0.1,0.5] [-0.1,-0.1] = [0X1.125FBEE250664P+0,infinity]; pow [-0.1,0.5] [-1.0,-0.1] = [0X1.125FBEE250664P+0,infinity]; pow [-0.1,0.5] [-2.5,-0.1] = [0X1.125FBEE250664P+0,infinity]; pow [-0.1,0.5] [-infinity,-0.1] = [0X1.125FBEE250664P+0,infinity]; pow [-0.1,0.5] [-1.0,-1.0] = [0X1P+1,infinity]; pow [-0.1,0.5] [-2.5,-1.0] = [0X1P+1,infinity]; pow [-0.1,0.5] [-infinity,-1.0] = [0X1P+1,infinity]; pow [-0.1,0.5] [-2.5,-2.5] = [0X1.6A09E667F3BCCP+2,infinity]; pow [-0.1,0.5] [-infinity,-2.5] = [0X1.6A09E667F3BCCP+2,infinity]; pow [-0.1,1.0] [empty] = [empty]; pow [-0.1,1.0] [0.0,0.0] = [1.0,1.0]; pow [-0.1,1.0] [-0.0,-0.0] = [1.0,1.0]; pow [-0.1,1.0] [0.0,1.0] = [0.0,1.0]; pow [-0.1,1.0] [-0.0,1.0] = [0.0,1.0]; pow [-0.1,1.0] [0.0,2.5] = [0.0,1.0]; pow [-0.1,1.0] [-0.0,2.5] = [0.0,1.0]; pow [-0.1,1.0] [0.0,infinity] = [0.0,1.0]; pow [-0.1,1.0] [-0.0,infinity] = [0.0,1.0]; pow [-0.1,1.0] [0.1,0.1] = [0.0,1.0]; pow [-0.1,1.0] [0.1,1.0] = [0.0,1.0]; pow [-0.1,1.0] [0.1,2.5] = [0.0,1.0]; pow [-0.1,1.0] [0.1,infinity] = [0.0,1.0]; pow [-0.1,1.0] [1.0,1.0] = [0.0,1.0]; pow [-0.1,1.0] [1.0,2.5] = [0.0,1.0]; pow [-0.1,1.0] [1.0,infinity] = [0.0,1.0]; pow [-0.1,1.0] [2.5,2.5] = [0.0,1.0]; pow [-0.1,1.0] [2.5,infinity] = [0.0,1.0]; pow [-0.1,1.0] [-0.1,0.1] = [0.0,infinity]; pow [-0.1,1.0] [-0.1,1.0] = [0.0,infinity]; pow [-0.1,1.0] [-0.1,2.5] = [0.0,infinity]; pow [-0.1,1.0] [-0.1,infinity] = [0.0,infinity]; pow [-0.1,1.0] [-1.0,0.1] = [0.0,infinity]; pow [-0.1,1.0] [-1.0,1.0] = [0.0,infinity]; pow [-0.1,1.0] [-1.0,2.5] = [0.0,infinity]; pow [-0.1,1.0] [-1.0,infinity] = [0.0,infinity]; pow [-0.1,1.0] [-2.5,0.1] = [0.0,infinity]; pow [-0.1,1.0] [-2.5,1.0] = [0.0,infinity]; pow [-0.1,1.0] [-2.5,2.5] = [0.0,infinity]; pow [-0.1,1.0] [-2.5,infinity] = [0.0,infinity]; pow [-0.1,1.0] [-infinity,0.1] = [0.0,infinity]; pow [-0.1,1.0] [-infinity,1.0] = [0.0,infinity]; pow [-0.1,1.0] [-infinity,2.5] = [0.0,infinity]; pow [-0.1,1.0] [entire] = [0.0,infinity]; pow [-0.1,1.0] [-0.1,0.0] = [1.0,infinity]; pow [-0.1,1.0] [-0.1,-0.0] = [1.0,infinity]; pow [-0.1,1.0] [-1.0,0.0] = [1.0,infinity]; pow [-0.1,1.0] [-1.0,-0.0] = [1.0,infinity]; pow [-0.1,1.0] [-2.5,0.0] = [1.0,infinity]; pow [-0.1,1.0] [-2.5,-0.0] = [1.0,infinity]; pow [-0.1,1.0] [-infinity,0.0] = [1.0,infinity]; pow [-0.1,1.0] [-infinity,-0.0] = [1.0,infinity]; pow [-0.1,1.0] [-0.1,-0.1] = [1.0,infinity]; pow [-0.1,1.0] [-1.0,-0.1] = [1.0,infinity]; pow [-0.1,1.0] [-2.5,-0.1] = [1.0,infinity]; pow [-0.1,1.0] [-infinity,-0.1] = [1.0,infinity]; pow [-0.1,1.0] [-1.0,-1.0] = [1.0,infinity]; pow [-0.1,1.0] [-2.5,-1.0] = [1.0,infinity]; pow [-0.1,1.0] [-infinity,-1.0] = [1.0,infinity]; pow [-0.1,1.0] [-2.5,-2.5] = [1.0,infinity]; pow [-0.1,1.0] [-infinity,-2.5] = [1.0,infinity]; pow [-0.1,1.5] [empty] = [empty]; pow [-0.1,1.5] [0.0,0.0] = [1.0,1.0]; pow [-0.1,1.5] [-0.0,-0.0] = [1.0,1.0]; pow [-0.1,1.5] [0.0,1.0] = [0.0,1.5]; pow [-0.1,1.5] [-0.0,1.0] = [0.0,1.5]; pow [-0.1,1.5] [0.0,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [-0.1,1.5] [-0.0,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [-0.1,1.5] [0.0,infinity] = [0.0,infinity]; pow [-0.1,1.5] [-0.0,infinity] = [0.0,infinity]; pow [-0.1,1.5] [0.1,0.1] = [0.0,0X1.0A97DCE72A0CBP+0]; pow [-0.1,1.5] [0.1,1.0] = [0.0,1.5]; pow [-0.1,1.5] [0.1,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [-0.1,1.5] [0.1,infinity] = [0.0,infinity]; pow [-0.1,1.5] [1.0,1.0] = [0.0,1.5]; pow [-0.1,1.5] [1.0,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [-0.1,1.5] [1.0,infinity] = [0.0,infinity]; pow [-0.1,1.5] [2.5,2.5] = [0.0,0X1.60B9FD68A4555P+1]; pow [-0.1,1.5] [2.5,infinity] = [0.0,infinity]; pow [-0.1,1.5] [-0.1,0.1] = [0.0,infinity]; pow [-0.1,1.5] [-0.1,1.0] = [0.0,infinity]; pow [-0.1,1.5] [-0.1,2.5] = [0.0,infinity]; pow [-0.1,1.5] [-0.1,infinity] = [0.0,infinity]; pow [-0.1,1.5] [-1.0,0.1] = [0.0,infinity]; pow [-0.1,1.5] [-1.0,1.0] = [0.0,infinity]; pow [-0.1,1.5] [-1.0,2.5] = [0.0,infinity]; pow [-0.1,1.5] [-1.0,infinity] = [0.0,infinity]; pow [-0.1,1.5] [-2.5,0.1] = [0.0,infinity]; pow [-0.1,1.5] [-2.5,1.0] = [0.0,infinity]; pow [-0.1,1.5] [-2.5,2.5] = [0.0,infinity]; pow [-0.1,1.5] [-2.5,infinity] = [0.0,infinity]; pow [-0.1,1.5] [-infinity,0.1] = [0.0,infinity]; pow [-0.1,1.5] [-infinity,1.0] = [0.0,infinity]; pow [-0.1,1.5] [-infinity,2.5] = [0.0,infinity]; pow [-0.1,1.5] [entire] = [0.0,infinity]; pow [-0.1,1.5] [-1.0,0.0] = [0X1.5555555555555P-1,infinity]; pow [-0.1,1.5] [-1.0,-0.0] = [0X1.5555555555555P-1,infinity]; pow [-0.1,1.5] [-2.5,0.0] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [-0.1,1.5] [-2.5,-0.0] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [-0.1,1.5] [-infinity,0.0] = [0.0,infinity]; pow [-0.1,1.5] [-infinity,-0.0] = [0.0,infinity]; pow [-0.1,1.5] [-0.1,-0.1] = [0X1.EBA7C9E4D31E9P-1,infinity]; pow [-0.1,1.5] [-1.0,-0.1] = [0X1.5555555555555P-1,infinity]; pow [-0.1,1.5] [-2.5,-0.1] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [-0.1,1.5] [-infinity,-0.1] = [0.0,infinity]; pow [-0.1,1.5] [-1.0,-1.0] = [0X1.5555555555555P-1,infinity]; pow [-0.1,1.5] [-2.5,-1.0] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [-0.1,1.5] [-infinity,-1.0] = [0.0,infinity]; pow [-0.1,1.5] [-2.5,-2.5] = [0X1.7398BF1D1EE6FP-2,infinity]; pow [-0.1,1.5] [-infinity,-2.5] = [0.0,infinity]; pow [-0.1,infinity] [empty] = [empty]; pow [-0.1,infinity] [0.0,0.0] = [1.0,1.0]; pow [-0.1,infinity] [-0.0,-0.0] = [1.0,1.0]; pow [-0.1,infinity] [0.0,1.0] = [0.0,infinity]; pow [-0.1,infinity] [-0.0,1.0] = [0.0,infinity]; pow [-0.1,infinity] [0.0,2.5] = [0.0,infinity]; pow [-0.1,infinity] [-0.0,2.5] = [0.0,infinity]; pow [-0.1,infinity] [0.0,infinity] = [0.0,infinity]; pow [-0.1,infinity] [-0.0,infinity] = [0.0,infinity]; pow [-0.1,infinity] [0.1,0.1] = [0.0,infinity]; pow [-0.1,infinity] [0.1,1.0] = [0.0,infinity]; pow [-0.1,infinity] [0.1,2.5] = [0.0,infinity]; pow [-0.1,infinity] [0.1,infinity] = [0.0,infinity]; pow [-0.1,infinity] [1.0,1.0] = [0.0,infinity]; pow [-0.1,infinity] [1.0,2.5] = [0.0,infinity]; pow [-0.1,infinity] [1.0,infinity] = [0.0,infinity]; pow [-0.1,infinity] [2.5,2.5] = [0.0,infinity]; pow [-0.1,infinity] [2.5,infinity] = [0.0,infinity]; pow [-0.1,infinity] [-0.1,0.1] = [0.0,infinity]; pow [-0.1,infinity] [-0.1,1.0] = [0.0,infinity]; pow [-0.1,infinity] [-0.1,2.5] = [0.0,infinity]; pow [-0.1,infinity] [-0.1,infinity] = [0.0,infinity]; pow [-0.1,infinity] [-1.0,0.1] = [0.0,infinity]; pow [-0.1,infinity] [-1.0,1.0] = [0.0,infinity]; pow [-0.1,infinity] [-1.0,2.5] = [0.0,infinity]; pow [-0.1,infinity] [-1.0,infinity] = [0.0,infinity]; pow [-0.1,infinity] [-2.5,0.1] = [0.0,infinity]; pow [-0.1,infinity] [-2.5,1.0] = [0.0,infinity]; pow [-0.1,infinity] [-2.5,2.5] = [0.0,infinity]; pow [-0.1,infinity] [-2.5,infinity] = [0.0,infinity]; pow [-0.1,infinity] [-infinity,0.1] = [0.0,infinity]; pow [-0.1,infinity] [-infinity,1.0] = [0.0,infinity]; pow [-0.1,infinity] [-infinity,2.5] = [0.0,infinity]; pow [-0.1,infinity] [entire] = [0.0,infinity]; pow [-0.1,infinity] [-1.0,0.0] = [0.0,infinity]; pow [-0.1,infinity] [-1.0,-0.0] = [0.0,infinity]; pow [-0.1,infinity] [-2.5,0.0] = [0.0,infinity]; pow [-0.1,infinity] [-2.5,-0.0] = [0.0,infinity]; pow [-0.1,infinity] [-infinity,0.0] = [0.0,infinity]; pow [-0.1,infinity] [-infinity,-0.0] = [0.0,infinity]; pow [-0.1,infinity] [-0.1,-0.1] = [0.0,infinity]; pow [-0.1,infinity] [-1.0,-0.1] = [0.0,infinity]; pow [-0.1,infinity] [-2.5,-0.1] = [0.0,infinity]; pow [-0.1,infinity] [-infinity,-0.1] = [0.0,infinity]; pow [-0.1,infinity] [-1.0,-1.0] = [0.0,infinity]; pow [-0.1,infinity] [-2.5,-1.0] = [0.0,infinity]; pow [-0.1,infinity] [-infinity,-1.0] = [0.0,infinity]; pow [-0.1,infinity] [-infinity,-2.5] = [0.0,infinity]; pow [-0.1,infinity] [-2.5,-2.5] = [0.0,infinity]; pow [0.0,0.0] [empty] = [empty]; pow [0.0,0.0] [0.0,0.0] = [empty]; pow [0.0,0.0] [-0.0,-0.0] = [empty]; pow [0.0,0.0] [0.0,1.0] = [0.0,0.0]; pow [0.0,0.0] [-0.0,1.0] = [0.0,0.0]; pow [0.0,0.0] [0.0,2.5] = [0.0,0.0]; pow [0.0,0.0] [-0.0,2.5] = [0.0,0.0]; pow [0.0,0.0] [0.0,infinity] = [0.0,0.0]; pow [0.0,0.0] [-0.0,infinity] = [0.0,0.0]; pow [0.0,0.0] [0.1,0.1] = [0.0,0.0]; pow [0.0,0.0] [0.1,1.0] = [0.0,0.0]; pow [0.0,0.0] [0.1,2.5] = [0.0,0.0]; pow [0.0,0.0] [0.1,infinity] = [0.0,0.0]; pow [0.0,0.0] [1.0,1.0] = [0.0,0.0]; pow [0.0,0.0] [1.0,2.5] = [0.0,0.0]; pow [0.0,0.0] [1.0,infinity] = [0.0,0.0]; pow [0.0,0.0] [2.5,2.5] = [0.0,0.0]; pow [0.0,0.0] [2.5,infinity] = [0.0,0.0]; pow [0.0,0.0] [-0.1,0.1] = [0.0,0.0]; pow [0.0,0.0] [-0.1,1.0] = [0.0,0.0]; pow [0.0,0.0] [-0.1,2.5] = [0.0,0.0]; pow [0.0,0.0] [-0.1,infinity] = [0.0,0.0]; pow [0.0,0.0] [-1.0,0.1] = [0.0,0.0]; pow [0.0,0.0] [-1.0,1.0] = [0.0,0.0]; pow [0.0,0.0] [-1.0,2.5] = [0.0,0.0]; pow [0.0,0.0] [-1.0,infinity] = [0.0,0.0]; pow [0.0,0.0] [-2.5,0.1] = [0.0,0.0]; pow [0.0,0.0] [-2.5,1.0] = [0.0,0.0]; pow [0.0,0.0] [-2.5,2.5] = [0.0,0.0]; pow [0.0,0.0] [-2.5,infinity] = [0.0,0.0]; pow [0.0,0.0] [-infinity,0.1] = [0.0,0.0]; pow [0.0,0.0] [-infinity,1.0] = [0.0,0.0]; pow [0.0,0.0] [-infinity,2.5] = [0.0,0.0]; pow [0.0,0.0] [entire] = [0.0,0.0]; pow [0.0,0.0] [-1.0,0.0] = [empty]; pow [0.0,0.0] [-1.0,-0.0] = [empty]; pow [0.0,0.0] [-2.5,0.0] = [empty]; pow [0.0,0.0] [-2.5,-0.0] = [empty]; pow [0.0,0.0] [-infinity,0.0] = [empty]; pow [0.0,0.0] [-infinity,-0.0] = [empty]; pow [0.0,0.0] [-0.1,-0.1] = [empty]; pow [0.0,0.0] [-1.0,-0.1] = [empty]; pow [0.0,0.0] [-2.5,-0.1] = [empty]; pow [0.0,0.0] [-infinity,-0.1] = [empty]; pow [0.0,0.0] [-1.0,-1.0] = [empty]; pow [0.0,0.0] [-2.5,-1.0] = [empty]; pow [0.0,0.0] [-infinity,-1.0] = [empty]; pow [0.0,0.0] [-infinity,-2.5] = [empty]; pow [0.0,0.0] [-2.5,-2.5] = [empty]; pow [-0.0,-0.0] [empty] = [empty]; pow [-0.0,-0.0] [0.0,0.0] = [empty]; pow [-0.0,-0.0] [-0.0,-0.0] = [empty]; pow [-0.0,-0.0] [0.0,1.0] = [0.0,0.0]; pow [-0.0,-0.0] [-0.0,1.0] = [0.0,0.0]; pow [-0.0,-0.0] [0.0,2.5] = [0.0,0.0]; pow [-0.0,-0.0] [-0.0,2.5] = [0.0,0.0]; pow [-0.0,-0.0] [0.0,infinity] = [0.0,0.0]; pow [-0.0,-0.0] [-0.0,infinity] = [0.0,0.0]; pow [-0.0,-0.0] [0.1,0.1] = [0.0,0.0]; pow [-0.0,-0.0] [0.1,1.0] = [0.0,0.0]; pow [-0.0,-0.0] [0.1,2.5] = [0.0,0.0]; pow [-0.0,-0.0] [0.1,infinity] = [0.0,0.0]; pow [-0.0,-0.0] [1.0,1.0] = [0.0,0.0]; pow [-0.0,-0.0] [1.0,2.5] = [0.0,0.0]; pow [-0.0,-0.0] [1.0,infinity] = [0.0,0.0]; pow [-0.0,-0.0] [2.5,2.5] = [0.0,0.0]; pow [-0.0,-0.0] [2.5,infinity] = [0.0,0.0]; pow [-0.0,-0.0] [-0.1,0.1] = [0.0,0.0]; pow [-0.0,-0.0] [-0.1,1.0] = [0.0,0.0]; pow [-0.0,-0.0] [-0.1,2.5] = [0.0,0.0]; pow [-0.0,-0.0] [-0.1,infinity] = [0.0,0.0]; pow [-0.0,-0.0] [-1.0,0.1] = [0.0,0.0]; pow [-0.0,-0.0] [-1.0,1.0] = [0.0,0.0]; pow [-0.0,-0.0] [-1.0,2.5] = [0.0,0.0]; pow [-0.0,-0.0] [-1.0,infinity] = [0.0,0.0]; pow [-0.0,-0.0] [-2.5,0.1] = [0.0,0.0]; pow [-0.0,-0.0] [-2.5,1.0] = [0.0,0.0]; pow [-0.0,-0.0] [-2.5,2.5] = [0.0,0.0]; pow [-0.0,-0.0] [-2.5,infinity] = [0.0,0.0]; pow [-0.0,-0.0] [-infinity,0.1] = [0.0,0.0]; pow [-0.0,-0.0] [-infinity,1.0] = [0.0,0.0]; pow [-0.0,-0.0] [-infinity,2.5] = [0.0,0.0]; pow [-0.0,-0.0] [entire] = [0.0,0.0]; pow [-0.0,-0.0] [-1.0,0.0] = [empty]; pow [-0.0,-0.0] [-1.0,-0.0] = [empty]; pow [-0.0,-0.0] [-2.5,0.0] = [empty]; pow [-0.0,-0.0] [-2.5,-0.0] = [empty]; pow [-0.0,-0.0] [-infinity,0.0] = [empty]; pow [-0.0,-0.0] [-infinity,-0.0] = [empty]; pow [-0.0,-0.0] [-0.1,-0.1] = [empty]; pow [-0.0,-0.0] [-1.0,-0.1] = [empty]; pow [-0.0,-0.0] [-2.5,-0.1] = [empty]; pow [-0.0,-0.0] [-infinity,-0.1] = [empty]; pow [-0.0,-0.0] [-1.0,-1.0] = [empty]; pow [-0.0,-0.0] [-2.5,-1.0] = [empty]; pow [-0.0,-0.0] [-infinity,-1.0] = [empty]; pow [-0.0,-0.0] [-infinity,-2.5] = [empty]; pow [-0.0,-0.0] [-2.5,-2.5] = [empty]; pow [-0.0,0.0] [empty] = [empty]; pow [-0.0,0.0] [0.0,0.0] = [empty]; pow [-0.0,0.0] [-0.0,-0.0] = [empty]; pow [-0.0,0.0] [0.0,1.0] = [0.0,0.0]; pow [-0.0,0.0] [-0.0,1.0] = [0.0,0.0]; pow [-0.0,0.0] [0.0,2.5] = [0.0,0.0]; pow [-0.0,0.0] [-0.0,2.5] = [0.0,0.0]; pow [-0.0,0.0] [0.0,infinity] = [0.0,0.0]; pow [-0.0,0.0] [-0.0,infinity] = [0.0,0.0]; pow [-0.0,0.0] [0.1,0.1] = [0.0,0.0]; pow [-0.0,0.0] [0.1,1.0] = [0.0,0.0]; pow [-0.0,0.0] [0.1,2.5] = [0.0,0.0]; pow [-0.0,0.0] [0.1,infinity] = [0.0,0.0]; pow [-0.0,0.0] [1.0,1.0] = [0.0,0.0]; pow [-0.0,0.0] [1.0,2.5] = [0.0,0.0]; pow [-0.0,0.0] [1.0,infinity] = [0.0,0.0]; pow [-0.0,0.0] [2.5,2.5] = [0.0,0.0]; pow [-0.0,0.0] [2.5,infinity] = [0.0,0.0]; pow [-0.0,0.0] [-0.1,0.1] = [0.0,0.0]; pow [-0.0,0.0] [-0.1,1.0] = [0.0,0.0]; pow [-0.0,0.0] [-0.1,2.5] = [0.0,0.0]; pow [-0.0,0.0] [-0.1,infinity] = [0.0,0.0]; pow [-0.0,0.0] [-1.0,0.1] = [0.0,0.0]; pow [-0.0,0.0] [-1.0,1.0] = [0.0,0.0]; pow [-0.0,0.0] [-1.0,2.5] = [0.0,0.0]; pow [-0.0,0.0] [-1.0,infinity] = [0.0,0.0]; pow [-0.0,0.0] [-2.5,0.1] = [0.0,0.0]; pow [-0.0,0.0] [-2.5,1.0] = [0.0,0.0]; pow [-0.0,0.0] [-2.5,2.5] = [0.0,0.0]; pow [-0.0,0.0] [-2.5,infinity] = [0.0,0.0]; pow [-0.0,0.0] [-infinity,0.1] = [0.0,0.0]; pow [-0.0,0.0] [-infinity,1.0] = [0.0,0.0]; pow [-0.0,0.0] [-infinity,2.5] = [0.0,0.0]; pow [-0.0,0.0] [entire] = [0.0,0.0]; pow [-0.0,0.0] [-1.0,0.0] = [empty]; pow [-0.0,0.0] [-1.0,-0.0] = [empty]; pow [-0.0,0.0] [-2.5,0.0] = [empty]; pow [-0.0,0.0] [-2.5,-0.0] = [empty]; pow [-0.0,0.0] [-infinity,0.0] = [empty]; pow [-0.0,0.0] [-infinity,-0.0] = [empty]; pow [-0.0,0.0] [-0.1,-0.1] = [empty]; pow [-0.0,0.0] [-1.0,-0.1] = [empty]; pow [-0.0,0.0] [-2.5,-0.1] = [empty]; pow [-0.0,0.0] [-infinity,-0.1] = [empty]; pow [-0.0,0.0] [-1.0,-1.0] = [empty]; pow [-0.0,0.0] [-2.5,-1.0] = [empty]; pow [-0.0,0.0] [-infinity,-1.0] = [empty]; pow [-0.0,0.0] [-infinity,-2.5] = [empty]; pow [-0.0,0.0] [-2.5,-2.5] = [empty]; pow [0.0,-0.0] [empty] = [empty]; pow [0.0,-0.0] [0.0,0.0] = [empty]; pow [0.0,-0.0] [-0.0,-0.0] = [empty]; pow [0.0,-0.0] [0.0,1.0] = [0.0,0.0]; pow [0.0,-0.0] [-0.0,1.0] = [0.0,0.0]; pow [0.0,-0.0] [0.0,2.5] = [0.0,0.0]; pow [0.0,-0.0] [-0.0,2.5] = [0.0,0.0]; pow [0.0,-0.0] [0.0,infinity] = [0.0,0.0]; pow [0.0,-0.0] [-0.0,infinity] = [0.0,0.0]; pow [0.0,-0.0] [0.1,0.1] = [0.0,0.0]; pow [0.0,-0.0] [0.1,1.0] = [0.0,0.0]; pow [0.0,-0.0] [0.1,2.5] = [0.0,0.0]; pow [0.0,-0.0] [0.1,infinity] = [0.0,0.0]; pow [0.0,-0.0] [1.0,1.0] = [0.0,0.0]; pow [0.0,-0.0] [1.0,2.5] = [0.0,0.0]; pow [0.0,-0.0] [1.0,infinity] = [0.0,0.0]; pow [0.0,-0.0] [2.5,2.5] = [0.0,0.0]; pow [0.0,-0.0] [2.5,infinity] = [0.0,0.0]; pow [0.0,-0.0] [-0.1,0.1] = [0.0,0.0]; pow [0.0,-0.0] [-0.1,1.0] = [0.0,0.0]; pow [0.0,-0.0] [-0.1,2.5] = [0.0,0.0]; pow [0.0,-0.0] [-0.1,infinity] = [0.0,0.0]; pow [0.0,-0.0] [-1.0,0.1] = [0.0,0.0]; pow [0.0,-0.0] [-1.0,1.0] = [0.0,0.0]; pow [0.0,-0.0] [-1.0,2.5] = [0.0,0.0]; pow [0.0,-0.0] [-1.0,infinity] = [0.0,0.0]; pow [0.0,-0.0] [-2.5,0.1] = [0.0,0.0]; pow [0.0,-0.0] [-2.5,1.0] = [0.0,0.0]; pow [0.0,-0.0] [-2.5,2.5] = [0.0,0.0]; pow [0.0,-0.0] [-2.5,infinity] = [0.0,0.0]; pow [0.0,-0.0] [-infinity,0.1] = [0.0,0.0]; pow [0.0,-0.0] [-infinity,1.0] = [0.0,0.0]; pow [0.0,-0.0] [-infinity,2.5] = [0.0,0.0]; pow [0.0,-0.0] [entire] = [0.0,0.0]; pow [0.0,-0.0] [-1.0,0.0] = [empty]; pow [0.0,-0.0] [-1.0,-0.0] = [empty]; pow [0.0,-0.0] [-2.5,0.0] = [empty]; pow [0.0,-0.0] [-2.5,-0.0] = [empty]; pow [0.0,-0.0] [-infinity,0.0] = [empty]; pow [0.0,-0.0] [-infinity,-0.0] = [empty]; pow [0.0,-0.0] [-0.1,-0.1] = [empty]; pow [0.0,-0.0] [-1.0,-0.1] = [empty]; pow [0.0,-0.0] [-2.5,-0.1] = [empty]; pow [0.0,-0.0] [-infinity,-0.1] = [empty]; pow [0.0,-0.0] [-1.0,-1.0] = [empty]; pow [0.0,-0.0] [-2.5,-1.0] = [empty]; pow [0.0,-0.0] [-infinity,-1.0] = [empty]; pow [0.0,-0.0] [-infinity,-2.5] = [empty]; pow [0.0,-0.0] [-2.5,-2.5] = [empty]; pow [-1.0,0.0] [empty] = [empty]; pow [-1.0,0.0] [0.0,0.0] = [empty]; pow [-1.0,0.0] [-0.0,-0.0] = [empty]; pow [-1.0,0.0] [0.0,1.0] = [0.0,0.0]; pow [-1.0,0.0] [-0.0,1.0] = [0.0,0.0]; pow [-1.0,0.0] [0.0,2.5] = [0.0,0.0]; pow [-1.0,0.0] [-0.0,2.5] = [0.0,0.0]; pow [-1.0,0.0] [0.0,infinity] = [0.0,0.0]; pow [-1.0,0.0] [-0.0,infinity] = [0.0,0.0]; pow [-1.0,0.0] [0.1,0.1] = [0.0,0.0]; pow [-1.0,0.0] [0.1,1.0] = [0.0,0.0]; pow [-1.0,0.0] [0.1,2.5] = [0.0,0.0]; pow [-1.0,0.0] [0.1,infinity] = [0.0,0.0]; pow [-1.0,0.0] [1.0,1.0] = [0.0,0.0]; pow [-1.0,0.0] [1.0,2.5] = [0.0,0.0]; pow [-1.0,0.0] [1.0,infinity] = [0.0,0.0]; pow [-1.0,0.0] [2.5,2.5] = [0.0,0.0]; pow [-1.0,0.0] [2.5,infinity] = [0.0,0.0]; pow [-1.0,0.0] [-0.1,0.1] = [0.0,0.0]; pow [-1.0,0.0] [-0.1,1.0] = [0.0,0.0]; pow [-1.0,0.0] [-0.1,2.5] = [0.0,0.0]; pow [-1.0,0.0] [-0.1,infinity] = [0.0,0.0]; pow [-1.0,0.0] [-1.0,0.1] = [0.0,0.0]; pow [-1.0,0.0] [-1.0,1.0] = [0.0,0.0]; pow [-1.0,0.0] [-1.0,2.5] = [0.0,0.0]; pow [-1.0,0.0] [-1.0,infinity] = [0.0,0.0]; pow [-1.0,0.0] [-2.5,0.1] = [0.0,0.0]; pow [-1.0,0.0] [-2.5,1.0] = [0.0,0.0]; pow [-1.0,0.0] [-2.5,2.5] = [0.0,0.0]; pow [-1.0,0.0] [-2.5,infinity] = [0.0,0.0]; pow [-1.0,0.0] [-infinity,0.1] = [0.0,0.0]; pow [-1.0,0.0] [-infinity,1.0] = [0.0,0.0]; pow [-1.0,0.0] [-infinity,2.5] = [0.0,0.0]; pow [-1.0,0.0] [entire] = [0.0,0.0]; pow [-1.0,0.0] [-1.0,0.0] = [empty]; pow [-1.0,0.0] [-1.0,-0.0] = [empty]; pow [-1.0,0.0] [-2.5,0.0] = [empty]; pow [-1.0,0.0] [-2.5,-0.0] = [empty]; pow [-1.0,0.0] [-infinity,0.0] = [empty]; pow [-1.0,0.0] [-infinity,-0.0] = [empty]; pow [-1.0,0.0] [-0.1,-0.1] = [empty]; pow [-1.0,0.0] [-1.0,-0.1] = [empty]; pow [-1.0,0.0] [-2.5,-0.1] = [empty]; pow [-1.0,0.0] [-infinity,-0.1] = [empty]; pow [-1.0,0.0] [-1.0,-1.0] = [empty]; pow [-1.0,0.0] [-2.5,-1.0] = [empty]; pow [-1.0,0.0] [-infinity,-1.0] = [empty]; pow [-1.0,0.0] [-infinity,-2.5] = [empty]; pow [-1.0,0.0] [-2.5,-2.5] = [empty]; pow [-1.0,-0.0] [empty] = [empty]; pow [-1.0,-0.0] [0.0,0.0] = [empty]; pow [-1.0,-0.0] [-0.0,-0.0] = [empty]; pow [-1.0,-0.0] [0.0,1.0] = [0.0,0.0]; pow [-1.0,-0.0] [-0.0,1.0] = [0.0,0.0]; pow [-1.0,-0.0] [0.0,2.5] = [0.0,0.0]; pow [-1.0,-0.0] [-0.0,2.5] = [0.0,0.0]; pow [-1.0,-0.0] [0.0,infinity] = [0.0,0.0]; pow [-1.0,-0.0] [-0.0,infinity] = [0.0,0.0]; pow [-1.0,-0.0] [0.1,0.1] = [0.0,0.0]; pow [-1.0,-0.0] [0.1,1.0] = [0.0,0.0]; pow [-1.0,-0.0] [0.1,2.5] = [0.0,0.0]; pow [-1.0,-0.0] [0.1,infinity] = [0.0,0.0]; pow [-1.0,-0.0] [1.0,1.0] = [0.0,0.0]; pow [-1.0,-0.0] [1.0,2.5] = [0.0,0.0]; pow [-1.0,-0.0] [1.0,infinity] = [0.0,0.0]; pow [-1.0,-0.0] [2.5,2.5] = [0.0,0.0]; pow [-1.0,-0.0] [2.5,infinity] = [0.0,0.0]; pow [-1.0,-0.0] [-0.1,0.1] = [0.0,0.0]; pow [-1.0,-0.0] [-0.1,1.0] = [0.0,0.0]; pow [-1.0,-0.0] [-0.1,2.5] = [0.0,0.0]; pow [-1.0,-0.0] [-0.1,infinity] = [0.0,0.0]; pow [-1.0,-0.0] [-1.0,0.1] = [0.0,0.0]; pow [-1.0,-0.0] [-1.0,1.0] = [0.0,0.0]; pow [-1.0,-0.0] [-1.0,2.5] = [0.0,0.0]; pow [-1.0,-0.0] [-1.0,infinity] = [0.0,0.0]; pow [-1.0,-0.0] [-2.5,0.1] = [0.0,0.0]; pow [-1.0,-0.0] [-2.5,1.0] = [0.0,0.0]; pow [-1.0,-0.0] [-2.5,2.5] = [0.0,0.0]; pow [-1.0,-0.0] [-2.5,infinity] = [0.0,0.0]; pow [-1.0,-0.0] [-infinity,0.1] = [0.0,0.0]; pow [-1.0,-0.0] [-infinity,1.0] = [0.0,0.0]; pow [-1.0,-0.0] [-infinity,2.5] = [0.0,0.0]; pow [-1.0,-0.0] [entire] = [0.0,0.0]; pow [-1.0,-0.0] [-1.0,0.0] = [empty]; pow [-1.0,-0.0] [-1.0,-0.0] = [empty]; pow [-1.0,-0.0] [-2.5,0.0] = [empty]; pow [-1.0,-0.0] [-2.5,-0.0] = [empty]; pow [-1.0,-0.0] [-infinity,0.0] = [empty]; pow [-1.0,-0.0] [-infinity,-0.0] = [empty]; pow [-1.0,-0.0] [-0.1,-0.1] = [empty]; pow [-1.0,-0.0] [-1.0,-0.1] = [empty]; pow [-1.0,-0.0] [-2.5,-0.1] = [empty]; pow [-1.0,-0.0] [-infinity,-0.1] = [empty]; pow [-1.0,-0.0] [-1.0,-1.0] = [empty]; pow [-1.0,-0.0] [-2.5,-1.0] = [empty]; pow [-1.0,-0.0] [-infinity,-1.0] = [empty]; pow [-1.0,-0.0] [-infinity,-2.5] = [empty]; pow [-1.0,-0.0] [-2.5,-2.5] = [empty]; pow [-1.0,-0.1] [empty] = [empty]; pow [-1.0,-0.1] [0.0,0.0] = [empty]; pow [-1.0,-0.1] [-0.0,-0.0] = [empty]; pow [-1.0,-0.1] [0.0,1.0] = [empty]; pow [-1.0,-0.1] [-0.0,1.0] = [empty]; pow [-1.0,-0.1] [0.0,2.5] = [empty]; pow [-1.0,-0.1] [-0.0,2.5] = [empty]; pow [-1.0,-0.1] [0.0,infinity] = [empty]; pow [-1.0,-0.1] [-0.0,infinity] = [empty]; pow [-1.0,-0.1] [0.1,0.1] = [empty]; pow [-1.0,-0.1] [0.1,1.0] = [empty]; pow [-1.0,-0.1] [0.1,2.5] = [empty]; pow [-1.0,-0.1] [0.1,infinity] = [empty]; pow [-1.0,-0.1] [1.0,1.0] = [empty]; pow [-1.0,-0.1] [1.0,2.5] = [empty]; pow [-1.0,-0.1] [1.0,infinity] = [empty]; pow [-1.0,-0.1] [2.5,2.5] = [empty]; pow [-1.0,-0.1] [2.5,infinity] = [empty]; pow [-1.0,-0.1] [-0.1,0.1] = [empty]; pow [-1.0,-0.1] [-0.1,1.0] = [empty]; pow [-1.0,-0.1] [-0.1,2.5] = [empty]; pow [-1.0,-0.1] [-0.1,infinity] = [empty]; pow [-1.0,-0.1] [-1.0,0.1] = [empty]; pow [-1.0,-0.1] [-1.0,1.0] = [empty]; pow [-1.0,-0.1] [-1.0,2.5] = [empty]; pow [-1.0,-0.1] [-1.0,infinity] = [empty]; pow [-1.0,-0.1] [-2.5,0.1] = [empty]; pow [-1.0,-0.1] [-2.5,1.0] = [empty]; pow [-1.0,-0.1] [-2.5,2.5] = [empty]; pow [-1.0,-0.1] [-2.5,infinity] = [empty]; pow [-1.0,-0.1] [-infinity,0.1] = [empty]; pow [-1.0,-0.1] [-infinity,1.0] = [empty]; pow [-1.0,-0.1] [-infinity,2.5] = [empty]; pow [-1.0,-0.1] [entire] = [empty]; pow [-1.0,-0.1] [-1.0,0.0] = [empty]; pow [-1.0,-0.1] [-1.0,-0.0] = [empty]; pow [-1.0,-0.1] [-2.5,0.0] = [empty]; pow [-1.0,-0.1] [-2.5,-0.0] = [empty]; pow [-1.0,-0.1] [-infinity,0.0] = [empty]; pow [-1.0,-0.1] [-infinity,-0.0] = [empty]; pow [-1.0,-0.1] [-0.1,-0.1] = [empty]; pow [-1.0,-0.1] [-1.0,-0.1] = [empty]; pow [-1.0,-0.1] [-2.5,-0.1] = [empty]; pow [-1.0,-0.1] [-infinity,-0.1] = [empty]; pow [-1.0,-0.1] [-1.0,-1.0] = [empty]; pow [-1.0,-0.1] [-2.5,-1.0] = [empty]; pow [-1.0,-0.1] [-infinity,-1.0] = [empty]; pow [-1.0,-0.1] [-infinity,-2.5] = [empty]; pow [-1.0,-0.1] [-2.5,-2.5] = [empty]; } testcase minimal_pow_dec_test { pow [0.1,0.5]_com [0.0,1.0]_com = [0X1.999999999999AP-4,1.0]_com; pow [0.1,0.5]_com [0.1,0.1]_def = [0X1.96B230BCDC434P-1,0X1.DDB680117AB13P-1]_def; pow [0.1,0.5]_trv [-2.5,2.5]_dac = [0X1.9E7C6E43390B7P-9,0X1.3C3A4EDFA9758P+8]_trv; pow [0.1,0.5]_com [-2.5,infinity]_dac = [0.0,0X1.3C3A4EDFA9758P+8]_dac; pow [0.1,0.5]_trv [-infinity,0.1]_dac = [0X1.96B230BCDC434P-1,infinity]_trv; pow [0.1,1.0]_com [0.0,2.5]_com = [0X1.9E7C6E43390B7P-9,1.0]_com; pow [0.1,1.0]_def [1.0,1.0]_dac = [0X1.999999999999AP-4,1.0]_def; pow [0.1,1.0]_trv [-2.5,1.0]_def = [0X1.999999999999AP-4,0X1.3C3A4EDFA9758P+8]_trv; pow [0.5,1.5]_dac [0.1,0.1]_com = [0X1.DDB680117AB12P-1,0X1.0A97DCE72A0CBP+0]_dac; pow [0.5,1.5]_def [-2.5,0.1]_trv = [0X1.7398BF1D1EE6FP-2,0X1.6A09E667F3BCDP+2]_trv; pow [0.5,1.5]_com [-2.5,-2.5]_com = [0X1.7398BF1D1EE6FP-2,0X1.6A09E667F3BCDP+2]_com; pow [0.5,infinity]_dac [0.1,0.1]_com = [0X1.DDB680117AB12P-1,infinity]_dac; pow [0.5,infinity]_def [-2.5,-0.0]_com = [0.0,0X1.6A09E667F3BCDP+2]_def; pow [1.0,1.5]_com [-0.1,0.1]_def = [0X1.EBA7C9E4D31E9P-1,0X1.0A97DCE72A0CBP+0]_def; pow [1.0,1.5]_trv [-0.1,-0.1]_com = [0X1.EBA7C9E4D31E9P-1,1.0]_trv; pow [1.0,infinity]_dac [1.0,1.0]_dac = [1.0,infinity]_dac; pow [1.0,infinity]_def [-1.0,-0.0]_dac = [0X0P+0,1.0]_def; pow [1.1,1.5]_def [1.0,2.5]_com = [0X1.199999999999AP+0,0X1.60B9FD68A4555P+1]_def; pow [1.1,1.5]_com [-0.1,-0.1]_com = [0X1.EBA7C9E4D31E9P-1,0X1.FB24AF5281928P-1]_com; pow [1.1,infinity]_dac [0.1,infinity]_dac = [0X1.02739C65D58BFP+0,infinity]_dac; pow [1.1,infinity]_def [-2.5,infinity]_dac = [0X0P+0,infinity]_def; pow [1.1,infinity]_trv [-infinity,-1.0]_def = [0X0P+0,0X1.D1745D1745D17P-1]_trv; pow [0.0,0.5]_com [0.1,0.1]_com = [0.0,0X1.DDB680117AB13P-1]_com; pow [0.0,0.5]_com [2.5,infinity]_dac = [0.0,0X1.6A09E667F3BCDP-3]_dac; pow [0.0,0.5]_com [-infinity,-2.5]_dac = [0X1.6A09E667F3BCCP+2,infinity]_trv; pow [0.0,1.0]_com [0.0,0.0]_com = [1.0,1.0]_trv; pow [0.0,1.0]_def [0.0,2.5]_dac = [0.0,1.0]_trv; pow [0.0,1.0]_dac [1.0,2.5]_com = [0.0,1.0]_dac; pow [0.0,1.0]_com [-2.5,0.1]_dac = [0.0,infinity]_trv; pow [0.0,1.0]_def [entire]_def = [0.0,infinity]_trv; pow [0.0,1.0]_dac [-0.1,0.0]_com = [1.0,infinity]_trv; pow [0.0,1.0]_com [-infinity,0.0]_dac = [1.0,infinity]_trv; pow [0.0,1.0]_def [-infinity,-2.5]_dac = [1.0,infinity]_trv; pow [0.0,1.5]_com [0.0,2.5]_com = [0.0,0X1.60B9FD68A4555P+1]_trv; pow [0.0,1.5]_def [2.5,2.5]_dac = [0.0,0X1.60B9FD68A4555P+1]_def; pow [0.0,1.5]_dac [-1.0,0.0]_com = [0X1.5555555555555P-1,infinity]_trv; pow [0.0,1.5]_com [-2.5,-2.5]_def = [0X1.7398BF1D1EE6FP-2,infinity]_trv; pow [0.0,infinity]_dac [0.1,0.1]_com = [0.0,infinity]_dac; pow [0.0,infinity]_def [-1.0,1.0]_dac = [0.0,infinity]_trv; pow [0.0,infinity]_trv [-infinity,-1.0]_def = [0.0,infinity]_trv; pow [0.0,infinity]_dac [-2.5,-2.5]_dac = [0.0,infinity]_trv; pow [-0.0,0.5]_com [0.0,infinity]_dac = [0.0,1.0]_trv; pow [-0.0,0.5]_def [0.1,infinity]_def = [0.0,0X1.DDB680117AB13P-1]_def; pow [-0.0,0.5]_dac [2.5,2.5]_com = [0.0,0X1.6A09E667F3BCDP-3]_dac; pow [-0.0,0.5]_trv [-2.5,-0.0]_dac = [1.0,infinity]_trv; pow [-0.0,0.5]_com [-infinity,-0.1]_def = [0X1.125FBEE250664P+0,infinity]_trv; pow [-0.0,0.5]_def [-infinity,-2.5]_dac = [0X1.6A09E667F3BCCP+2,infinity]_trv; pow [-0.0,1.0]_com [2.5,2.5]_dac = [0.0,1.0]_dac; pow [-0.0,1.0]_dac [-1.0,infinity]_def = [0.0,infinity]_trv; pow [-0.0,1.0]_com [entire]_def = [0.0,infinity]_trv; pow [-0.0,1.0]_def [-2.5,-2.5]_com = [1.0,infinity]_trv; pow [-0.0,1.0]_dac [-infinity,-2.5]_def = [1.0,infinity]_trv; pow [-0.0,1.5]_com [0.1,2.5]_dac = [0.0,0X1.60B9FD68A4555P+1]_dac; pow [-0.0,1.5]_def [-1.0,0.0]_trv = [0X1.5555555555555P-1,infinity]_trv; pow [-0.0,1.5]_dac [-2.5,-0.1]_def = [0X1.7398BF1D1EE6FP-2,infinity]_trv; pow [-0.0,1.5]_com [-2.5,-2.5]_com = [0X1.7398BF1D1EE6FP-2,infinity]_trv; pow [-0.0,1.5]_def [-infinity,-2.5]_dac = [0.0,infinity]_trv; pow [-0.0,infinity]_dac [-0.1,infinity]_dac = [0.0,infinity]_trv; pow [-0.0,infinity]_def [-2.5,-0.0]_com = [0.0,infinity]_trv; pow [-0.0,infinity]_trv [-infinity,0.0]_def = [0.0,infinity]_trv; pow [-0.0,infinity]_dac [-infinity,-0.0]_trv = [0.0,infinity]_trv; pow [-0.0,infinity]_def [-infinity,-1.0]_def = [0.0,infinity]_trv; pow [-0.1,0.5]_def [0.1,infinity]_dac = [0.0,0X1.DDB680117AB13P-1]_trv; pow [-0.1,0.5]_com [-0.1,-0.1]_com = [0X1.125FBEE250664P+0,infinity]_trv; pow [-0.1,0.5]_dac [-infinity,-2.5]_def = [0X1.6A09E667F3BCCP+2,infinity]_trv; pow [-0.1,1.0]_com [0.0,0.0]_com = [1.0,1.0]_trv; pow [-0.1,1.0]_dac [-infinity,2.5]_dac = [0.0,infinity]_trv; pow [-0.1,1.0]_def [-infinity,-1.0]_def = [1.0,infinity]_trv; pow [-0.1,1.0]_com [-2.5,-2.5]_com = [1.0,infinity]_trv; pow [-0.1,1.0]_trv [-infinity,-2.5]_trv = [1.0,infinity]_trv; pow [-0.1,1.5]_trv [0.0,2.5]_com = [0.0,0X1.60B9FD68A4555P+1]_trv; pow [-0.1,1.5]_com [2.5,2.5]_dac = [0.0,0X1.60B9FD68A4555P+1]_trv; pow [-0.1,1.5]_dac [-1.0,0.0]_trv = [0X1.5555555555555P-1,infinity]_trv; pow [-0.1,1.5]_com [-0.1,-0.1]_com = [0X1.EBA7C9E4D31E9P-1,infinity]_trv; pow [-0.1,1.5]_def [-2.5,-2.5]_def = [0X1.7398BF1D1EE6FP-2,infinity]_trv; pow [-0.1,infinity]_dac [-0.1,2.5]_com = [0.0,infinity]_trv; pow [-0.1,infinity]_def [-2.5,0.0]_def = [0.0,infinity]_trv; pow [-0.1,infinity]_dac [-2.5,-2.5]_trv = [0.0,infinity]_trv; pow [0.0,0.0]_com [1.0,infinity]_dac = [0.0,0.0]_dac; pow [0.0,0.0]_com [-2.5,0.1]_com = [0.0,0.0]_trv; pow [0.0,0.0]_dac [-1.0,0.0]_def = [empty]_trv; pow [-1.0,-0.1]_com [-0.1,1.0]_def = [empty]_trv; pow [-1.0,-0.1]_dac [-0.1,2.5]_com = [empty]_trv; pow [-1.0,-0.1]_def [-0.1,infinity]_trv = [empty]_trv; } testcase minimal_exp_test { exp [empty] = [empty]; exp [-infinity,0.0] = [0.0,1.0]; exp [-infinity,-0.0] = [0.0,1.0]; exp [0.0,infinity] = [1.0,infinity]; exp [-0.0,infinity] = [1.0,infinity]; exp [entire] = [0.0,infinity]; exp [-infinity,0X1.62E42FEFA39FP+9] = [0.0,infinity]; exp [0X1.62E42FEFA39FP+9,0X1.62E42FEFA39FP+9] = [ 0X1.FFFFFFFFFFFFFP+1023,infinity]; exp [0.0,0X1.62E42FEFA39EP+9] = [1.0,0X1.FFFFFFFFFC32BP+1023]; exp [-0.0,0X1.62E42FEFA39EP+9] = [1.0,0X1.FFFFFFFFFC32BP+1023]; exp [-0X1.6232BDD7ABCD3P+9,0X1.62E42FEFA39EP+9] = [0X0.FFFFFFFFFFE7BP-1022,0X1.FFFFFFFFFC32BP+1023]; exp [-0X1.6232BDD7ABCD3P+8,0X1.62E42FEFA39EP+9] = [0X1.FFFFFFFFFFE7BP-512,0X1.FFFFFFFFFC32BP+1023]; exp [-0X1.6232BDD7ABCD3P+8,0.0] = [0X1.FFFFFFFFFFE7BP-512,1.0]; exp [-0X1.6232BDD7ABCD3P+8,-0.0] = [0X1.FFFFFFFFFFE7BP-512,1.0]; exp [-0X1.6232BDD7ABCD3P+8,1.0] = [0X1.FFFFFFFFFFE7BP-512,0X1.5BF0A8B14576AP+1]; exp [1.0,5.0] = [0X1.5BF0A8B145769P+1,0X1.28D389970339P+7]; exp [-0X1.A934F0979A372P+1,0X1.CEAECFEA8085AP+0] = [0X1.2797F0A337A5FP-5,0X1.86091CC9095C5P+2]; exp [0X1.87F42B972949CP-1,0X1.8B55484710029P+6] = [0X1.1337E9E45812AP+1, 0X1.805A5C88021B6P+142]; exp [0X1.78025C8B3FD39P+3,0X1.9FD8EEF3FA79BP+4] = [0X1.EF461A783114CP+16,0X1.691D36C6B008CP+37]; } testcase minimal_exp_dec_test { exp [0X1.62E42FEFA39FP+9,0X1.62E42FEFA39FP+9]_com = [ 0X1.FFFFFFFFFFFFFP+1023,infinity]_dac; exp [0.0,0X1.62E42FEFA39EP+9]_def = [1.0,0X1.FFFFFFFFFC32BP+1023]_def; } testcase minimal_exp2_test { exp2 [empty] = [empty]; exp2 [-infinity,0.0] = [0.0,1.0]; exp2 [-infinity,-0.0] = [0.0,1.0]; exp2 [0.0,infinity] = [1.0,infinity]; exp2 [-0.0,infinity] = [1.0,infinity]; exp2 [entire] = [0.0,infinity]; exp2 [-infinity,1024.0] = [0.0,infinity]; exp2 [1024.0,1024.0] = [0X1.FFFFFFFFFFFFFP+1023,infinity]; exp2 [0.0,1023.0] = [1.0,0X1P+1023]; exp2 [-0.0,1023.0] = [1.0,0X1P+1023]; exp2 [-1022.0,1023.0] = [0X1P-1022,0X1P+1023]; exp2 [-1022.0,0.0] = [0X1P-1022,1.0]; exp2 [-1022.0,-0.0] = [0X1P-1022,1.0]; exp2 [-1022.0,1.0] = [0X1P-1022,2.0]; exp2 [1.0,5.0] = [2.0,32.0]; exp2 [-0X1.A934F0979A372P+1,0X1.CEAECFEA8085AP+0] = [0X1.9999999999998P-4,0X1.C000000000001P+1]; exp2 [0X1.87F42B972949CP-1,0X1.8B55484710029P+6] = [0X1.B333333333332P+0,0X1.C81FD88228B4FP+98]; exp2 [0X1.78025C8B3FD39P+3,0X1.9FD8EEF3FA79BP+4] = [0X1.AEA0000721857P+11,0X1.FCA0555555559P+25]; } testcase minimal_exp2_dec_test { exp2 [1024.0,1024.0]_com = [0X1.FFFFFFFFFFFFFP+1023,infinity]_dac; exp2 [0X1.87F42B972949CP-1,0X1.8B55484710029P+6]_def = [0X1.B333333333332P+0,0X1.C81FD88228B4FP+98]_def; } testcase minimal_exp10_test { exp10 [empty] = [empty]; exp10 [-infinity,0.0] = [0.0,1.0]; exp10 [-infinity,-0.0] = [0.0,1.0]; exp10 [0.0,infinity] = [1.0,infinity]; exp10 [-0.0,infinity] = [1.0,infinity]; exp10 [entire] = [0.0,infinity]; exp10 [-infinity,0X1.34413509F79FFP+8] = [0.0,infinity]; exp10 [0X1.34413509F79FFP+8,0X1.34413509F79FFP+8] = [0X1.FFFFFFFFFFFFFP+1023,infinity]; exp10 [0.0,0X1.34413509F79FEP+8] = [1.0,0X1.FFFFFFFFFFBA1P+1023]; exp10 [-0.0,0X1.34413509F79FEP+8] = [1.0,0X1.FFFFFFFFFFBA1P+1023]; exp10 [-0X1.33A7146F72A42P+8,0X1.34413509F79FEP+8] = [0X0.FFFFFFFFFFFE3P-1022,0X1.FFFFFFFFFFBA1P+1023]; exp10 [-0X1.22P+7,0X1.34413509F79FEP+8] = [0X1.3FAAC3E3FA1F3P-482,0X1.FFFFFFFFFFBA1P+1023]; exp10 [-0X1.22P+7,0.0] = [0X1.3FAAC3E3FA1F3P-482,1.0]; exp10 [-0X1.22P+7,-0.0] = [0X1.3FAAC3E3FA1F3P-482,1.0]; exp10 [-0X1.22P+7,1.0] = [0X1.3FAAC3E3FA1F3P-482,10.0]; exp10 [1.0,5.0] = [10.0,100000.0]; exp10 [-0X1.A934F0979A372P+1,0X1.CEAECFEA8085AP+0] = [0X1.F3A8254311F9AP-12,0X1.00B18AD5B7D56P+6]; exp10 [0X1.87F42B972949CP-1,0X1.8B55484710029P+6] = [0X1.75014B7296807P+2,0X1.3EEC1D47DFB2BP+328]; exp10 [0X1.78025C8B3FD39P+3,0X1.9FD8EEF3FA79BP+4] = [0X1.0608D2279A811P+39,0X1.43AF5D4271CB8P+86]; } testcase minimal_exp10_dec_test { exp10 [0X1.34413509F79FFP+8,0X1.34413509F79FFP+8]_com = [ 0X1.FFFFFFFFFFFFFP+1023,infinity]_dac; exp10 [0X1.87F42B972949CP-1,0X1.8B55484710029P+6]_def = [0X1.75014B7296807P+2,0X1.3EEC1D47DFB2BP+328]_def; } testcase minimal_log_test { log [empty] = [empty]; log [-infinity,0.0] = [empty]; log [-infinity,-0.0] = [empty]; log [0.0,1.0] = [-infinity,0.0]; log [-0.0,1.0] = [-infinity,0.0]; log [1.0,infinity] = [0.0,infinity]; log [0.0,infinity] = [entire]; log [-0.0,infinity] = [entire]; log [entire] = [entire]; log [0.0,0x1.FFFFFFFFFFFFFp1023] = [-infinity,0X1.62E42FEFA39FP+9]; log [-0.0,0x1.FFFFFFFFFFFFFp1023] = [-infinity,0X1.62E42FEFA39FP+9]; log [1.0,0x1.FFFFFFFFFFFFFp1023] = [0.0,0X1.62E42FEFA39FP+9]; log [0x0.0000000000001p-1022,0x1.FFFFFFFFFFFFFp1023] = [-0x1.74385446D71C4p9, +0x1.62E42FEFA39Fp9]; log [0x0.0000000000001p-1022,1.0] = [-0x1.74385446D71C4p9,0.0]; log [0X1.5BF0A8B145769P+1,0X1.5BF0A8B145769P+1] = [0X1.FFFFFFFFFFFFFP-1,0X1P+0]; log [0X1.5BF0A8B14576AP+1,0X1.5BF0A8B14576AP+1] = [0X1P+0,0X1.0000000000001P+0]; log [0x0.0000000000001p-1022,0X1.5BF0A8B14576AP+1] = [-0x1.74385446D71C4p9,0X1.0000000000001P+0]; log [0X1.5BF0A8B145769P+1,32.0] = [0X1.FFFFFFFFFFFFFP-1,0X1.BB9D3BEB8C86CP+1]; log [0X1.999999999999AP-4,0X1.CP+1] = [-0X1.26BB1BBB55516P+1,0X1.40B512EB53D6P+0]; log [0X1.B333333333333P+0,0X1.C81FD88228B2FP+98] = [0X1.0FAE81914A99P-1,0X1.120627F6AE7F1P+6]; log [0X1.AEA0000721861P+11,0X1.FCA055555554CP+25] = [0X1.04A1363DB1E63P+3,0X1.203E52C0256B5P+4]; } testcase minimal_log_dec_test { log [0x0.0000000000001p-1022,0x1.FFFFFFFFFFFFFp1023]_com = [-0x1.74385446D71C4p9,0X1.62E42FEFA39FP+9]_com; log [0.0,1.0]_com = [-infinity,0.0]_trv; log [0X1.5BF0A8B14576AP+1,0X1.5BF0A8B14576AP+1]_def = [0X1P+0,0X1.0000000000001P+0]_def; } testcase minimal_log2_test { log2 [empty] = [empty]; log2 [-infinity,0.0] = [empty]; log2 [-infinity,-0.0] = [empty]; log2 [0.0,1.0] = [-infinity,0.0]; log2 [-0.0,1.0] = [-infinity,0.0]; log2 [1.0,infinity] = [0.0,infinity]; log2 [0.0,infinity] = [entire]; log2 [-0.0,infinity] = [entire]; log2 [entire] = [entire]; log2 [0.0,0x1.FFFFFFFFFFFFFp1023] = [-infinity,1024.0]; log2 [-0.0,0x1.FFFFFFFFFFFFFp1023] = [-infinity,1024.0]; log2 [1.0,0x1.FFFFFFFFFFFFFp1023] = [0.0,1024.0]; log2 [0x0.0000000000001p-1022,0x1.FFFFFFFFFFFFFp1023] = [-1074.0,1024.0]; log2 [0x0.0000000000001p-1022,1.0] = [-1074.0,0.0]; log2 [0x0.0000000000001p-1022,2.0] = [-1074.0,1.0]; log2 [2.0,32.0] = [1.0,5.0]; log2 [0X1.999999999999AP-4,0X1.CP+1] = [-0X1.A934F0979A372P+1,0X1.CEAECFEA8085AP+0]; log2 [0X1.B333333333333P+0,0X1.C81FD88228B2FP+98] = [0X1.87F42B972949CP-1,0X1.8B55484710029P+6]; log2 [0X1.AEA0000721861P+11,0X1.FCA055555554CP+25] = [0X1.78025C8B3FD39P+3,0X1.9FD8EEF3FA79BP+4]; } testcase minimal_log2_dec_test { log2 [0x0.0000000000001p-1022,0x1.FFFFFFFFFFFFFp1023]_com = [-1074.0,1024.0]_com; log2 [0x0.0000000000001p-1022,infinity]_dac = [-1074.0,infinity]_dac; log2 [2.0,32.0]_def = [1.0,5.0]_def; log2 [0.0,0x1.FFFFFFFFFFFFFp1023]_com = [-infinity,1024.0]_trv; } testcase minimal_log10_test { log10 [empty] = [empty]; log10 [-infinity,0.0] = [empty]; log10 [-infinity,-0.0] = [empty]; log10 [0.0,1.0] = [-infinity,0.0]; log10 [-0.0,1.0] = [-infinity,0.0]; log10 [1.0,infinity] = [0.0,infinity]; log10 [0.0,infinity] = [entire]; log10 [-0.0,infinity] = [entire]; log10 [entire] = [entire]; log10 [0.0,0x1.FFFFFFFFFFFFFp1023] = [-infinity,0X1.34413509F79FFP+8]; log10 [-0.0,0x1.FFFFFFFFFFFFFp1023] = [-infinity,0X1.34413509F79FFP+8]; log10 [1.0,0x1.FFFFFFFFFFFFFp1023] = [0.0,0X1.34413509F79FFP+8]; log10 [0x0.0000000000001p-1022,0x1.FFFFFFFFFFFFFp1023] = [-0x1.434E6420F4374p+8, +0x1.34413509F79FFp+8]; log10 [0x0.0000000000001p-1022,1.0] = [-0x1.434E6420F4374p+8 ,0.0]; log10 [0x0.0000000000001p-1022,10.0] = [-0x1.434E6420F4374p+8 ,1.0]; log10 [10.0,100000.0] = [1.0,5.0]; log10 [0X1.999999999999AP-4,0X1.CP+1] = [-0X1P+0,0X1.1690163290F4P-1]; log10 [0X1.999999999999AP-4,0X1.999999999999AP-4] = [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]; log10 [0X1.B333333333333P+0,0X1.C81FD88228B2FP+98] = [0X1.D7F59AA5BECB9P-3,0X1.DC074D84E5AABP+4]; log10 [0X1.AEA0000721861P+11,0X1.FCA055555554CP+25] = [0X1.C4C29DD829191P+1,0X1.F4BAEBBA4FA4P+2]; } testcase minimal_log10_dec_test { log10 [0x0.0000000000001p-1022,0x1.FFFFFFFFFFFFFp1023]_com = [-0x1.434E6420F4374p+8,0X1.34413509F79FFP+8]_com; log10 [0.0,0x1.FFFFFFFFFFFFFp1023]_dac = [-infinity,0X1.34413509F79FFP+8]_trv; } testcase minimal_sin_test { sin [empty] = [empty]; sin [0.0,infinity] = [-1.0,1.0]; sin [-0.0,infinity] = [-1.0,1.0]; sin [-infinity,0.0] = [-1.0,1.0]; sin [-infinity,-0.0] = [-1.0,1.0]; sin [entire] = [-1.0,1.0]; sin [0.0,0.0] = [0.0,0.0]; sin [-0.0,-0.0] = [0.0,0.0]; sin [0X1.921FB54442D18P+0,0X1.921FB54442D18P+0] = [0X1.FFFFFFFFFFFFFP-1,0X1P+0]; sin [0X1.921FB54442D19P+0,0X1.921FB54442D19P+0] = [0X1.FFFFFFFFFFFFFP-1,0X1P+0]; sin [0X1.921FB54442D18P+0,0X1.921FB54442D19P+0] = [0X1.FFFFFFFFFFFFFP-1,0X1P+0]; sin [0.0,0X1.921FB54442D18P+0] = [0.0,0X1P+0]; sin [-0.0,0X1.921FB54442D18P+0] = [0.0,0X1P+0]; sin [0.0,0X1.921FB54442D19P+0] = [0.0,0X1P+0]; sin [-0.0,0X1.921FB54442D19P+0] = [0.0,0X1P+0]; sin [0X1.921FB54442D18P+1,0X1.921FB54442D18P+1] = [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53]; sin [0X1.921FB54442D19P+1,0X1.921FB54442D19P+1] = [-0X1.72CECE675D1FDP-52,-0X1.72CECE675D1FCP-52]; sin [0X1.921FB54442D18P+1,0X1.921FB54442D19P+1] = [-0X1.72CECE675D1FDP-52,0X1.1A62633145C07P-53]; sin [0.0,0X1.921FB54442D18P+1] = [0.0,1.0]; sin [-0.0,0X1.921FB54442D18P+1] = [0.0,1.0]; sin [0.0,0X1.921FB54442D19P+1] = [-0X1.72CECE675D1FDP-52,1.0]; sin [-0.0,0X1.921FB54442D19P+1] = [-0X1.72CECE675D1FDP-52,1.0]; sin [0X1.921FB54442D18P+0,0X1.921FB54442D18P+1] = [0X1.1A62633145C06P-53,0X1P+0]; sin [0X1.921FB54442D18P+0,0X1.921FB54442D19P+1] = [-0X1.72CECE675D1FDP-52,0X1P+0]; sin [0X1.921FB54442D19P+0,0X1.921FB54442D18P+1] = [0X1.1A62633145C06P-53,0X1P+0]; sin [0X1.921FB54442D19P+0,0X1.921FB54442D19P+1] = [-0X1.72CECE675D1FDP-52,0X1P+0]; sin [-0X1.921FB54442D18P+0,-0X1.921FB54442D18P+0] = [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]; sin [-0X1.921FB54442D19P+0,-0X1.921FB54442D19P+0] = [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]; sin [-0X1.921FB54442D19P+0,-0X1.921FB54442D18P+0] = [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]; sin [-0X1.921FB54442D18P+0,0.0] = [-0X1P+0,0.0]; sin [-0X1.921FB54442D18P+0,-0.0] = [-0X1P+0,0.0]; sin [-0X1.921FB54442D19P+0,0.0] = [-0X1P+0,0.0]; sin [-0X1.921FB54442D19P+0,-0.0] = [-0X1P+0,0.0]; sin [-0X1.921FB54442D18P+1,-0X1.921FB54442D18P+1] = [-0X1.1A62633145C07P-53,-0X1.1A62633145C06P-53]; sin [-0X1.921FB54442D19P+1,-0X1.921FB54442D19P+1] = [0X1.72CECE675D1FCP-52,0X1.72CECE675D1FDP-52]; sin [-0X1.921FB54442D19P+1,-0X1.921FB54442D18P+1] = [-0X1.1A62633145C07P-53,0X1.72CECE675D1FDP-52]; sin [-0X1.921FB54442D18P+1,0.0] = [-1.0,0.0]; sin [-0X1.921FB54442D18P+1,-0.0] = [-1.0,0.0]; sin [-0X1.921FB54442D19P+1,0.0] = [-1.0,0X1.72CECE675D1FDP-52]; sin [-0X1.921FB54442D19P+1,-0.0] = [-1.0,0X1.72CECE675D1FDP-52]; sin [-0X1.921FB54442D18P+1,-0X1.921FB54442D18P+0] = [-0X1P+0,-0X1.1A62633145C06P-53]; sin [-0X1.921FB54442D19P+1,-0X1.921FB54442D18P+0] = [-0X1P+0,0X1.72CECE675D1FDP-52]; sin [-0X1.921FB54442D18P+1,-0X1.921FB54442D19P+0] = [-0X1P+0,-0X1.1A62633145C06P-53]; sin [-0X1.921FB54442D19P+1,-0X1.921FB54442D19P+0] = [-0X1P+0,0X1.72CECE675D1FDP-52]; sin [-0X1.921FB54442D18P+0,0X1.921FB54442D18P+0] = [-0X1P+0,0X1P+0]; sin [-0X1.921FB54442D18P+0,0X1.921FB54442D19P+0] = [-0X1P+0,0X1P+0]; sin [-0X1.921FB54442D19P+0,0X1.921FB54442D18P+0] = [-0X1P+0,0X1P+0]; sin [-0X1.921FB54442D19P+0,0X1.921FB54442D19P+0] = [-0X1P+0,0X1P+0]; sin [-0.7,0.1] = [-0X1.49D6E694619B9P-1,0X1.98EAECB8BCB2DP-4]; sin [1.0,2.0] = [0X1.AED548F090CEEP-1,1.0]; sin [-3.2,-2.9] = [-0X1.E9FB8D64830E3P-3,0X1.DE33739E82D33P-5]; sin [2.0,3.0] = [0X1.210386DB6D55BP-3,0X1.D18F6EAD1B446P-1]; } testcase minimal_sin_dec_test { sin [-0X1.921FB54442D18P+1,-0X1.921FB54442D18P+0]_def = [-0X1P+0,-0X1.1A62633145C06P-53]_def; sin [-infinity,-0.0]_trv = [-1.0,1.0]_trv; sin [entire]_def = [-1.0,1.0]_def; } testcase minimal_cos_test { cos [empty] = [empty]; cos [0.0,infinity] = [-1.0,1.0]; cos [-0.0,infinity] = [-1.0,1.0]; cos [-infinity,0.0] = [-1.0,1.0]; cos [-infinity,-0.0] = [-1.0,1.0]; cos [entire] = [-1.0,1.0]; cos [0.0,0.0] = [1.0,1.0]; cos [-0.0,-0.0] = [1.0,1.0]; cos [0X1.921FB54442D18P+0,0X1.921FB54442D18P+0] = [0X1.1A62633145C06P-54,0X1.1A62633145C07P-54]; cos [0X1.921FB54442D19P+0,0X1.921FB54442D19P+0] = [-0X1.72CECE675D1FDP-53,-0X1.72CECE675D1FCP-53]; cos [0X1.921FB54442D18P+0,0X1.921FB54442D19P+0] = [-0X1.72CECE675D1FDP-53,0X1.1A62633145C07P-54]; cos [0.0,0X1.921FB54442D18P+0] = [0X1.1A62633145C06P-54,1.0]; cos [-0.0,0X1.921FB54442D18P+0] = [0X1.1A62633145C06P-54,1.0]; cos [0.0,0X1.921FB54442D19P+0] = [-0X1.72CECE675D1FDP-53,1.0]; cos [-0.0,0X1.921FB54442D19P+0] = [-0X1.72CECE675D1FDP-53,1.0]; cos [0X1.921FB54442D18P+1,0X1.921FB54442D18P+1] = [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]; cos [0X1.921FB54442D19P+1,0X1.921FB54442D19P+1] = [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]; cos [0X1.921FB54442D18P+1,0X1.921FB54442D19P+1] = [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]; cos [0.0,0X1.921FB54442D18P+1] = [-1.0,1.0]; cos [-0.0,0X1.921FB54442D18P+1] = [-1.0,1.0]; cos [0.0,0X1.921FB54442D19P+1] = [-1.0,1.0]; cos [-0.0,0X1.921FB54442D19P+1] = [-1.0,1.0]; cos [0X1.921FB54442D18P+0,0X1.921FB54442D18P+1] = [-1.0,0X1.1A62633145C07P-54]; cos [0X1.921FB54442D18P+0,0X1.921FB54442D19P+1] = [-1.0,0X1.1A62633145C07P-54]; cos [0X1.921FB54442D19P+0,0X1.921FB54442D18P+1] = [-1.0,-0X1.72CECE675D1FCP-53]; cos [0X1.921FB54442D19P+0,0X1.921FB54442D19P+1] = [-1.0,-0X1.72CECE675D1FCP-53]; cos [-0X1.921FB54442D18P+0,-0X1.921FB54442D18P+0] = [0X1.1A62633145C06P-54,0X1.1A62633145C07P-54]; cos [-0X1.921FB54442D19P+0,-0X1.921FB54442D19P+0] = [-0X1.72CECE675D1FDP-53,-0X1.72CECE675D1FCP-53]; cos [-0X1.921FB54442D19P+0,-0X1.921FB54442D18P+0] = [-0X1.72CECE675D1FDP-53,0X1.1A62633145C07P-54]; cos [-0X1.921FB54442D18P+0,0.0] = [0X1.1A62633145C06P-54,1.0]; cos [-0X1.921FB54442D18P+0,-0.0] = [0X1.1A62633145C06P-54,1.0]; cos [-0X1.921FB54442D19P+0,0.0] = [-0X1.72CECE675D1FDP-53,1.0]; cos [-0X1.921FB54442D19P+0,-0.0] = [-0X1.72CECE675D1FDP-53,1.0]; cos [-0X1.921FB54442D18P+1,-0X1.921FB54442D18P+1] = [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]; cos [-0X1.921FB54442D19P+1,-0X1.921FB54442D19P+1] = [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]; cos [-0X1.921FB54442D19P+1,-0X1.921FB54442D18P+1] = [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]; cos [-0X1.921FB54442D18P+1,0.0] = [-1.0,1.0]; cos [-0X1.921FB54442D18P+1,-0.0] = [-1.0,1.0]; cos [-0X1.921FB54442D19P+1,0.0] = [-1.0,1.0]; cos [-0X1.921FB54442D19P+1,-0.0] = [-1.0,1.0]; cos [-0X1.921FB54442D18P+1,-0X1.921FB54442D18P+0] = [-1.0,0X1.1A62633145C07P-54]; cos [-0X1.921FB54442D19P+1,-0X1.921FB54442D18P+0] = [-1.0,0X1.1A62633145C07P-54]; cos [-0X1.921FB54442D18P+1,-0X1.921FB54442D19P+0] = [-1.0,-0X1.72CECE675D1FCP-53]; cos [-0X1.921FB54442D19P+1,-0X1.921FB54442D19P+0] = [-1.0,-0X1.72CECE675D1FCP-53]; cos [-0X1.921FB54442D18P+0,0X1.921FB54442D18P+0] = [0X1.1A62633145C06P-54,1.0]; cos [-0X1.921FB54442D18P+0,0X1.921FB54442D19P+0] = [-0X1.72CECE675D1FDP-53,1.0]; cos [-0X1.921FB54442D19P+0,0X1.921FB54442D18P+0] = [-0X1.72CECE675D1FDP-53,1.0]; cos [-0X1.921FB54442D19P+0,0X1.921FB54442D19P+0] = [-0X1.72CECE675D1FDP-53,1.0]; cos [-0.7,0.1] = [0X1.87996529F9D92P-1,1.0]; cos [1.0,2.0] = [-0X1.AA22657537205P-2,0X1.14A280FB5068CP-1]; cos [-3.2,-2.9] = [-1.0,-0X1.F1216DBA340C8P-1]; cos [2.0,3.0] = [-0X1.FAE04BE85E5D3P-1,-0X1.AA22657537204P-2]; } testcase minimal_cos_dec_test { cos [-0X1.921FB54442D18P+0,-0X1.921FB54442D18P+0]_trv = [0X1.1A62633145C06P-54,0X1.1A62633145C07P-54]_trv; cos [-infinity,-0.0]_def = [-1.0,1.0]_def; cos [entire]_def = [-1.0,1.0]_def; } testcase minimal_tan_test { tan [empty] = [empty]; tan [0.0,infinity] = [entire]; tan [-0.0,infinity] = [entire]; tan [-infinity,0.0] = [entire]; tan [-infinity,-0.0] = [entire]; tan [entire] = [entire]; tan [0.0,0.0] = [0.0,0.0]; tan [-0.0,-0.0] = [0.0,0.0]; tan [0X1.921FB54442D18P+0,0X1.921FB54442D18P+0] = [0X1.D02967C31CDB4P+53,0X1.D02967C31CDB5P+53]; tan [0X1.921FB54442D19P+0,0X1.921FB54442D19P+0] = [-0X1.617A15494767BP+52,-0X1.617A15494767AP+52]; tan [0X1.921FB54442D18P+0,0X1.921FB54442D19P+0] = [entire]; tan [0X1.921FB54442D18P+1,0X1.921FB54442D18P+1] = [-0X1.1A62633145C07P-53,-0X1.1A62633145C06P-53]; tan [0X1.921FB54442D19P+1,0X1.921FB54442D19P+1] = [0X1.72CECE675D1FCP-52,0X1.72CECE675D1FDP-52]; tan [0.0,0X1.921FB54442D18P+0] = [0.0,0X1.D02967C31CDB5P+53]; tan [-0.0,0X1.921FB54442D18P+0] = [0.0,0X1.D02967C31CDB5P+53]; tan [0.0,0X1.921FB54442D19P+0] = [entire]; tan [-0.0,0X1.921FB54442D19P+0] = [entire]; tan [0.0,0X1.921FB54442D18P+1] = [entire]; tan [-0.0,0X1.921FB54442D18P+1] = [entire]; tan [0.0,0X1.921FB54442D19P+1] = [entire]; tan [-0.0,0X1.921FB54442D19P+1] = [entire]; tan [0X1P-51,0X1.921FB54442D18P+1] = [entire]; tan [0X1P-51,0X1.921FB54442D19P+1] = [entire]; tan [0X1P-52,0X1.921FB54442D18P+1] = [entire]; tan [0X1P-52,0X1.921FB54442D19P+1] = [entire]; tan [-0X1.921FB54442D18P+0,0X1.921FB54442D18P+0] = [-0X1.D02967C31CDB5P+53,0X1.D02967C31CDB5P+53]; tan [-0X1.921FB54442D18P+0,0X1.921FB54442D19P+0] = [entire]; tan [-0X1.921FB54442D19P+0,0X1.921FB54442D18P+0] = [entire]; tan [-0X1.921FB54442D19P+0,0X1.921FB54442D19P+0] = [entire]; tan [-0X1.555475A31A4BEP-2,0X1.999999999999AP-4] = [-0X1.628F4FD931FEFP-2,0X1.9AF8877430B81P-4]; tan [0X1.4E18E147AE148P+12,0X1.4E2028F5C28F6P+12] = [-0X1.D6D67B035B6B4P+2,-0X1.7E42B0760E3F3P+0]; tan [0X1.4E18E147AE148P+12,0X1.546028F5C28F6P+12] = [entire]; tan [0X1.FAE147AE147AEP-1,0X1.028F5C28F5C29P+0] = [0X1.860FADCC59064P+0,0X1.979AD0628469DP+0]; } testcase minimal_tan_dec_test { tan [empty]_trv = [empty]_trv; tan [0.0,infinity]_dac = [entire]_trv; tan [-0.0,infinity]_def = [entire]_trv; tan [-infinity,0.0]_trv = [entire]_trv; tan [-infinity,-0.0]_dac = [entire]_trv; tan [entire]_def = [entire]_trv; tan [0.0,0.0]_com = [0.0,0.0]_com; tan [-0.0,-0.0]_def = [0.0,0.0]_def; tan [0X1.921FB54442D18P+0,0X1.921FB54442D18P+0]_com = [0X1.D02967C31CDB4P+53,0X1.D02967C31CDB5P+53]_com; tan [0X1.921FB54442D19P+0,0X1.921FB54442D19P+0]_def = [-0X1.617A15494767BP+52,-0X1.617A15494767AP+52]_def; tan [0X1.921FB54442D18P+0,0X1.921FB54442D19P+0]_dac = [entire]_trv; tan [0X1.921FB54442D18P+1,0X1.921FB54442D18P+1]_trv = [-0X1.1A62633145C07P-53,-0X1.1A62633145C06P-53]_trv; tan [0X1.921FB54442D19P+1,0X1.921FB54442D19P+1]_com = [0X1.72CECE675D1FCP-52,0X1.72CECE675D1FDP-52]_com; tan [0.0,0X1.921FB54442D18P+0]_dac = [0.0,0X1.D02967C31CDB5P+53]_dac; tan [-0.0,0X1.921FB54442D18P+0]_com = [0.0,0X1.D02967C31CDB5P+53]_com; tan [0.0,0X1.921FB54442D19P+0]_trv = [entire]_trv; tan [-0.0,0X1.921FB54442D19P+0]_def = [entire]_trv; tan [0.0,0X1.921FB54442D18P+1]_dac = [entire]_trv; tan [-0.0,0X1.921FB54442D18P+1]_com = [entire]_trv; tan [0.0,0X1.921FB54442D19P+1]_trv = [entire]_trv; tan [-0.0,0X1.921FB54442D19P+1]_def = [entire]_trv; tan [0X1P-51,0X1.921FB54442D18P+1]_dac = [entire]_trv; tan [0X1P-51,0X1.921FB54442D19P+1]_com = [entire]_trv; tan [0X1P-52,0X1.921FB54442D18P+1]_trv = [entire]_trv; tan [0X1P-52,0X1.921FB54442D19P+1]_def = [entire]_trv; tan [-0X1.921FB54442D18P+0,0X1.921FB54442D18P+0]_com = [-0X1.D02967C31CDB5P+53,0X1.D02967C31CDB5P+53]_com; tan [-0X1.921FB54442D18P+0,0X1.921FB54442D19P+0]_trv = [entire]_trv; tan [-0X1.921FB54442D19P+0,0X1.921FB54442D18P+0]_def = [entire]_trv; tan [-0X1.921FB54442D19P+0,0X1.921FB54442D19P+0]_dac = [entire]_trv; tan [-0X1.555475A31A4BEP-2,0X1.999999999999AP-4]_com = [-0X1.628F4FD931FEFP-2,0X1.9AF8877430B81P-4]_com; tan [0X1.4E18E147AE148P+12,0X1.4E2028F5C28F6P+12]_dac = [-0X1.D6D67B035B6B4P+2,-0X1.7E42B0760E3F3P+0]_dac; tan [0X1.4E18E147AE148P+12,0X1.546028F5C28F6P+12]_def = [entire]_trv; tan [0X1.FAE147AE147AEP-1,0X1.028F5C28F5C29P+0]_trv = [0X1.860FADCC59064P+0,0X1.979AD0628469DP+0]_trv; } testcase minimal_asin_test { asin [empty] = [empty]; asin [0.0,infinity] = [0.0,0X1.921FB54442D19P+0]; asin [-0.0,infinity] = [0.0,0X1.921FB54442D19P+0]; asin [-infinity,0.0] = [-0X1.921FB54442D19P+0,0.0]; asin [-infinity,-0.0] = [-0X1.921FB54442D19P+0,0.0]; asin [entire] = [-0X1.921FB54442D19P+0,0X1.921FB54442D19P+0]; asin [-1.0,1.0] = [-0X1.921FB54442D19P+0,0X1.921FB54442D19P+0]; asin [-infinity,-1.0] = [-0X1.921FB54442D19P+0,-0X1.921FB54442D18P+0]; asin [1.0,infinity] = [0X1.921FB54442D18P+0,0X1.921FB54442D19P+0]; asin [-1.0,-1.0] = [-0X1.921FB54442D19P+0,-0X1.921FB54442D18P+0]; asin [1.0,1.0] = [0X1.921FB54442D18P+0,0X1.921FB54442D19P+0]; asin [0.0,0.0] = [0.0,0.0]; asin [-0.0,-0.0] = [0.0,0.0]; asin [-infinity,-0X1.0000000000001P+0] = [empty]; asin [0X1.0000000000001P+0,infinity] = [empty]; asin [-0X1.999999999999AP-4,0X1.999999999999AP-4] = [-0X1.9A49276037885P-4,0X1.9A49276037885P-4]; asin [-0X1.51EB851EB851FP-2,0X1.FFFFFFFFFFFFFP-1] = [-0X1.585FF6E341C3FP-2,0X1.921FB50442D19P+0]; asin [-0X1.FFFFFFFFFFFFFP-1,0X1.FFFFFFFFFFFFFP-1] = [-0X1.921FB50442D19P+0,0X1.921FB50442D19P+0]; } testcase minimal_asin_dec_test { asin [0.0,infinity]_dac = [0.0,0X1.921FB54442D19P+0]_trv; asin [-infinity,0.0]_def = [-0X1.921FB54442D19P+0,0.0]_trv; asin [-1.0,1.0]_com = [-0X1.921FB54442D19P+0,0X1.921FB54442D19P+0]_com; asin [entire]_def = [-0X1.921FB54442D19P+0,0X1.921FB54442D19P+0]_trv; asin [-0X1.51EB851EB851FP-2,0X1.FFFFFFFFFFFFFP-1]_def = [-0X1.585FF6E341C3FP-2,0X1.921FB50442D19P+0]_def; } testcase minimal_acos_test { acos [empty] = [empty]; acos [0.0,infinity] = [0.0,0X1.921FB54442D19P+0]; acos [-0.0,infinity] = [0.0,0X1.921FB54442D19P+0]; acos [-infinity,0.0] = [0X1.921FB54442D18P+0,0X1.921FB54442D19P+1]; acos [-infinity,-0.0] = [0X1.921FB54442D18P+0,0X1.921FB54442D19P+1]; acos [entire] = [0.0,0X1.921FB54442D19P+1]; acos [-1.0,1.0] = [0.0,0X1.921FB54442D19P+1]; acos [-infinity,-1.0] = [0X1.921FB54442D18P+1,0X1.921FB54442D19P+1]; acos [1.0,infinity] = [0.0,0.0]; acos [-1.0,-1.0] = [0X1.921FB54442D18P+1,0X1.921FB54442D19P+1]; acos [1.0,1.0] = [0.0,0.0]; acos [0.0,0.0] = [0X1.921FB54442D18P+0,0X1.921FB54442D19P+0]; acos [-0.0,-0.0] = [0X1.921FB54442D18P+0,0X1.921FB54442D19P+0]; acos [-infinity,-0X1.0000000000001P+0] = [empty]; acos [0X1.0000000000001P+0,infinity] = [empty]; acos [-0X1.999999999999AP-4,0X1.999999999999AP-4] = [0X1.787B22CE3F59P+0,0X1.ABC447BA464A1P+0]; acos [-0X1.51EB851EB851FP-2,0X1.FFFFFFFFFFFFFP-1] = [0X1P-26,0X1.E837B2FD13428P+0]; acos [-0X1.FFFFFFFFFFFFFP-1,0X1.FFFFFFFFFFFFFP-1] = [0X1P-26,0X1.921FB52442D19P+1]; } testcase minimal_acos_dec_test { acos [0.0,infinity]_dac = [0.0,0X1.921FB54442D19P+0]_trv; acos [-infinity,0.0]_def = [0X1.921FB54442D18P+0,0X1.921FB54442D19P+1]_trv; acos [-1.0,1.0]_com = [0.0,0X1.921FB54442D19P+1]_com; acos [entire]_def = [0.0,0X1.921FB54442D19P+1]_trv; acos [-0X1.51EB851EB851FP-2,0X1.FFFFFFFFFFFFFP-1]_def = [0X1P-26,0X1.E837B2FD13428P+0]_def; } testcase minimal_atan_test { atan [empty] = [empty]; atan [0.0,infinity] = [0.0,0X1.921FB54442D19P+0]; atan [-0.0,infinity] = [0.0,0X1.921FB54442D19P+0]; atan [-infinity,0.0] = [-0X1.921FB54442D19P+0,0.0]; atan [-infinity,-0.0] = [-0X1.921FB54442D19P+0,0.0]; atan [entire] = [-0X1.921FB54442D19P+0,0X1.921FB54442D19P+0]; atan [0.0,0.0] = [0.0,0.0]; atan [-0.0,-0.0] = [0.0,0.0]; atan [1.0,0X1.4C2463567C5ACP+25] = [0X1.921FB54442D18P-1,0X1.921FB4E19ABD7P+0]; atan [-0X1.FD219490EAAC1P+38,-0X1.1AF1C9D74F06DP+9] = [-0X1.921FB54440CEBP+0,-0X1.91ABE5C1E4C6DP+0]; } testcase minimal_atan_dec_test { atan [0.0,infinity]_dac = [0.0,0X1.921FB54442D19P+0]_dac; atan [-infinity,0.0]_def = [-0X1.921FB54442D19P+0,0.0]_def; atan [entire]_def = [-0X1.921FB54442D19P+0,0X1.921FB54442D19P+0]_def; atan [1.0,0X1.4C2463567C5ACP+25]_trv = [0X1.921FB54442D18P-1,0X1.921FB4E19ABD7P+0]_trv; atan [-0X1.FD219490EAAC1P+38,-0X1.1AF1C9D74F06DP+9]_com = [-0X1.921FB54440CEBP+0,-0X1.91ABE5C1E4C6DP+0]_com; } testcase minimal_atan2_test { atan2 [empty] [empty] = [empty]; atan2 [empty] [entire] = [empty]; atan2 [empty] [0.0, 0.0] = [empty]; atan2 [empty] [-0.0, 0.0] = [empty]; atan2 [empty] [0.0, -0.0] = [empty]; atan2 [empty] [-0.0, -0.0] = [empty]; atan2 [empty] [-2.0, -0.1] = [empty]; atan2 [empty] [-2.0, 0.0] = [empty]; atan2 [empty] [-2.0, -0.0] = [empty]; atan2 [empty] [-2.0, 1.0] = [empty]; atan2 [empty] [0.0, 1.0] = [empty]; atan2 [empty] [-0.0, 1.0] = [empty]; atan2 [empty] [0.1, 1.0] = [empty]; atan2 [entire] [empty] = [empty]; atan2 [entire] [entire] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [entire] [0.0, 0.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; atan2 [entire] [0.0, -0.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; atan2 [entire] [-0.0, 0.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; atan2 [entire] [-0.0, -0.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; atan2 [entire] [-2.0, -0.1] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [entire] [-2.0, 0.0] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [entire] [-2.0, -0.0] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [entire] [-2.0, 1.0] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [entire] [0.0, 1.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; atan2 [entire] [-0.0, 1.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; atan2 [entire] [0.1, 1.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; atan2 [0.0, 0.0] [empty] = [empty]; atan2 [0.0, 0.0] [entire] = [0.0,0X1.921FB54442D19P+1]; atan2 [0.0, 0.0] [0.0, 0.0] = [empty]; atan2 [0.0, 0.0] [-0.0, 0.0] = [empty]; atan2 [0.0, 0.0] [0.0, -0.0] = [empty]; atan2 [0.0, 0.0] [-0.0, -0.0] = [empty]; atan2 [0.0, 0.0] [-2.0, -0.1] = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]; atan2 [0.0, 0.0] [-2.0, 0.0] = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]; atan2 [0.0, 0.0] [-2.0, -0.0] = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]; atan2 [0.0, 0.0] [-2.0, 1.0] = [0.0,0X1.921FB54442D19P+1]; atan2 [0.0, 0.0] [0.0, 1.0] = [0.0,0.0]; atan2 [0.0, 0.0] [-0.0, 1.0] = [0.0,0.0]; atan2 [0.0, 0.0] [0.1, 1.0] = [0.0,0.0]; atan2 [-0.0, 0.0] [empty] = [empty]; atan2 [-0.0, 0.0] [entire] = [0.0,0X1.921FB54442D19P+1]; atan2 [-0.0, 0.0] [0.0, 0.0] = [empty]; atan2 [-0.0, 0.0] [-0.0, 0.0] = [empty]; atan2 [-0.0, 0.0] [0.0, -0.0] = [empty]; atan2 [-0.0, 0.0] [-0.0, -0.0] = [empty]; atan2 [-0.0, 0.0] [-2.0, -0.1] = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]; atan2 [-0.0, 0.0] [-2.0, 0.0] = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]; atan2 [-0.0, 0.0] [-2.0, -0.0] = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]; atan2 [-0.0, 0.0] [-2.0, 1.0] = [0.0,0X1.921FB54442D19P+1]; atan2 [-0.0, 0.0] [0.0, 1.0] = [0.0,0.0]; atan2 [-0.0, 0.0] [-0.0, 1.0] = [0.0,0.0]; atan2 [-0.0, 0.0] [0.1, 1.0] = [0.0,0.0]; atan2 [0.0, -0.0] [empty] = [empty]; atan2 [0.0, -0.0] [entire] = [0.0,0X1.921FB54442D19P+1]; atan2 [0.0, -0.0] [0.0, 0.0] = [empty]; atan2 [0.0, -0.0] [-0.0, 0.0] = [empty]; atan2 [0.0, -0.0] [0.0, -0.0] = [empty]; atan2 [0.0, -0.0] [-0.0, -0.0] = [empty]; atan2 [0.0, -0.0] [-2.0, -0.1] = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]; atan2 [0.0, -0.0] [-2.0, 0.0] = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]; atan2 [0.0, -0.0] [-2.0, -0.0] = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]; atan2 [0.0, -0.0] [-2.0, 1.0] = [0.0,0X1.921FB54442D19P+1]; atan2 [0.0, -0.0] [0.0, 1.0] = [0.0,0.0]; atan2 [0.0, -0.0] [-0.0, 1.0] = [0.0,0.0]; atan2 [0.0, -0.0] [0.1, 1.0] = [0.0,0.0]; atan2 [-0.0, -0.0] [empty] = [empty]; atan2 [-0.0, -0.0] [entire] = [0.0,0X1.921FB54442D19P+1]; atan2 [-0.0, -0.0] [0.0, 0.0] = [empty]; atan2 [-0.0, -0.0] [-0.0, 0.0] = [empty]; atan2 [-0.0, -0.0] [0.0, -0.0] = [empty]; atan2 [-0.0, -0.0] [-0.0, -0.0] = [empty]; atan2 [-0.0, -0.0] [-2.0, -0.1] = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]; atan2 [-0.0, -0.0] [-2.0, 0.0] = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]; atan2 [-0.0, -0.0] [-2.0, -0.0] = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]; atan2 [-0.0, -0.0] [-2.0, 1.0] = [0.0,0X1.921FB54442D19P+1]; atan2 [-0.0, -0.0] [0.0, 1.0] = [0.0,0.0]; atan2 [-0.0, -0.0] [-0.0, 1.0] = [0.0,0.0]; atan2 [-0.0, -0.0] [0.1, 1.0] = [0.0,0.0]; atan2 [-2.0, -0.1] [empty] = [empty]; atan2 [-2.0, -0.1] [entire] = [-0X1.921FB54442D19P+1,0.0]; atan2 [-2.0, -0.1] [0.0, 0.0] = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]; atan2 [-2.0, -0.1] [0.0, -0.0] = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]; atan2 [-2.0, -0.1] [-0.0, 0.0] = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]; atan2 [-2.0, -0.1] [0.0, -0.0] = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]; atan2 [-2.0, -0.1] [-2.0, -0.1] = [-0X1.8BBAABDE5E29CP+1, -0X1.9EE9C8100C211P+0]; atan2 [-2.0, -0.1] [-2.0, 0.0] = [-0X1.8BBAABDE5E29CP+1, -0X1.921FB54442D18P+0]; atan2 [-2.0, -0.1] [-2.0, -0.0] = [-0X1.8BBAABDE5E29CP+1, -0X1.921FB54442D18P+0]; atan2 [-2.0, -0.1] [-2.0, 1.0] = [-0X1.8BBAABDE5E29CP+1, -0X1.983E282E2CC4CP-4]; atan2 [-2.0, -0.1] [0.0, 1.0] = [-0X1.921FB54442D19P+0, -0X1.983E282E2CC4CP-4]; atan2 [-2.0, -0.1] [-0.0, 1.0] = [-0X1.921FB54442D19P+0, -0X1.983E282E2CC4CP-4]; atan2 [-2.0, -0.1] [0.1, 1.0] = [-0X1.8555A2787982P+0, -0X1.983E282E2CC4CP-4]; atan2 [-2.0, 0.0] [empty] = [empty]; atan2 [-2.0, 0.0] [entire] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, 0.0] [0.0, 0.0] = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]; atan2 [-2.0, 0.0] [-0.0, 0.0] = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]; atan2 [-2.0, 0.0] [0.0, -0.0] = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]; atan2 [-2.0, 0.0] [-0.0, -0.0] = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]; atan2 [-2.0, 0.0] [-2.0, -0.1] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, 0.0] [-2.0, 0.0] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, 0.0] [-2.0, -0.0] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, 0.0] [-2.0, 1.0] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, 0.0] [0.0, 1.0] = [-0X1.921FB54442D19P+0, 0.0]; atan2 [-2.0, 0.0] [-0.0, 1.0] = [-0X1.921FB54442D19P+0, 0.0]; atan2 [-2.0, 0.0] [0.1, 1.0] = [-0X1.8555A2787982P+0, 0.0]; atan2 [-2.0, -0.0] [empty] = [empty]; atan2 [-2.0, -0.0] [entire] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, -0.0] [0.0, 0.0] = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]; atan2 [-2.0, -0.0] [-0.0, 0.0] = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]; atan2 [-2.0, -0.0] [0.0, -0.0] = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]; atan2 [-2.0, -0.0] [-0.0, -0.0] = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]; atan2 [-2.0, -0.0] [-2.0, -0.1] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, -0.0] [-2.0, 0.0] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, -0.0] [-2.0, -0.0] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, -0.0] [-2.0, 1.0] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, -0.0] [0.0, 1.0] = [-0X1.921FB54442D19P+0, 0.0]; atan2 [-2.0, -0.0] [-0.0, 1.0] = [-0X1.921FB54442D19P+0, 0.0]; atan2 [-2.0, -0.0] [0.1, 1.0] = [-0X1.8555A2787982P+0, 0.0]; atan2 [-2.0, 1.0] [empty] = [empty]; atan2 [-2.0, 1.0] [entire] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, 1.0] [0.0, 0.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; atan2 [-2.0, 1.0] [-0.0, 0.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; atan2 [-2.0, 1.0] [0.0, -0.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; atan2 [-2.0, 1.0] [-0.0, -0.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; atan2 [-2.0, 1.0] [-2.0, -0.1] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, 1.0] [-2.0, 0.0] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, 1.0] [-2.0, -0.0] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, 1.0] [-2.0, 1.0] = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]; atan2 [-2.0, 1.0] [0.0, 1.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; atan2 [-2.0, 1.0] [-0.0, 1.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; atan2 [-2.0, 1.0] [0.1, 1.0] = [-0X1.8555A2787982P+0, 0X1.789BD2C160054P+0]; atan2 [-0.0, 1.0] [empty] = [empty]; atan2 [-0.0, 1.0] [entire] = [0.0, 0X1.921FB54442D19P+1]; atan2 [-0.0, 1.0] [0.0, 0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan2 [-0.0, 1.0] [-0.0, 0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan2 [-0.0, 1.0] [0.0, -0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan2 [-0.0, 1.0] [-0.0, -0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan2 [-0.0, 1.0] [-2.0, -0.1] = [0X1.ABA397C7259DDP+0, 0X1.921FB54442D19P+1]; atan2 [-0.0, 1.0] [-2.0, 0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+1]; atan2 [-0.0, 1.0] [-2.0, -0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+1]; atan2 [-0.0, 1.0] [-2.0, 1.0] = [0.0, 0X1.921FB54442D19P+1]; atan2 [-0.0, 1.0] [0.0, 1.0] = [0.0,0X1.921FB54442D19P+0]; atan2 [-0.0, 1.0] [-0.0, 1.0] = [0.0,0X1.921FB54442D19P+0]; atan2 [-0.0, 1.0] [0.1, 1.0] = [0.0, 0X1.789BD2C160054P+0]; atan2 [0.0, 1.0] [empty] = [empty]; atan2 [0.0, 1.0] [entire] = [0.0, 0X1.921FB54442D19P+1]; atan2 [0.0, 1.0] [0.0, 0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan2 [0.0, 1.0] [-0.0, 0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan2 [0.0, 1.0] [0.0, -0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan2 [0.0, 1.0] [-0.0, -0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan2 [0.0, 1.0] [-2.0, -0.1] = [0X1.ABA397C7259DDP+0, 0X1.921FB54442D19P+1]; atan2 [0.0, 1.0] [-2.0, 0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+1]; atan2 [0.0, 1.0] [-2.0, -0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+1]; atan2 [0.0, 1.0] [-2.0, 1.0] = [0.0, 0X1.921FB54442D19P+1]; atan2 [0.0, 1.0] [0.0, 1.0] = [0.0,0X1.921FB54442D19P+0]; atan2 [0.0, 1.0] [-0.0, 1.0] = [0.0,0X1.921FB54442D19P+0]; atan2 [0.0, 1.0] [0.1, 1.0] = [0.0,0X1.789BD2C160054P+0]; atan2 [0.1, 1.0] [empty] = [empty]; atan2 [0.1, 1.0] [entire] = [0.0, 0X1.921FB54442D19P+1]; atan2 [0.1, 1.0] [0.0, 0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan2 [0.1, 1.0] [-0.0, 0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan2 [0.1, 1.0] [0.0, -0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan2 [0.1, 1.0] [-0.0, -0.0] = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]; atan2 [0.1, 1.0] [-2.0, -0.1] = [0X1.ABA397C7259DDP+0, 0X1.8BBAABDE5E29CP+1]; atan2 [0.1, 1.0] [-2.0, 0.0] = [0X1.921FB54442D18P+0, 0X1.8BBAABDE5E29CP+1]; atan2 [0.1, 1.0] [-2.0, -0.0] = [0X1.921FB54442D18P+0, 0X1.8BBAABDE5E29CP+1]; atan2 [0.1, 1.0] [-2.0, 1.0] = [0X1.983E282E2CC4CP-4, 0X1.8BBAABDE5E29CP+1]; atan2 [0.1, 1.0] [0.0, 1.0] = [0X1.983E282E2CC4CP-4, 0X1.921FB54442D19P+0]; atan2 [0.1, 1.0] [-0.0, 1.0] = [0X1.983E282E2CC4CP-4, 0X1.921FB54442D19P+0]; atan2 [0.1, 1.0] [0.1, 1.0] = [0X1.983E282E2CC4CP-4, 0X1.789BD2C160054P+0]; } testcase minimal_atan2_dec_test { atan2 [empty]_trv [entire]_def = [empty]_trv; atan2 [empty]_trv [0.0, 0.0]_com = [empty]_trv; atan2 [empty]_trv [-0.0, 0.0]_dac = [empty]_trv; atan2 [empty]_trv [0.0, -0.0]_def = [empty]_trv; atan2 [empty]_trv [-0.0, -0.0]_trv = [empty]_trv; atan2 [empty]_trv [-2.0, -0.1]_com = [empty]_trv; atan2 [empty]_trv [-2.0, 0.0]_dac = [empty]_trv; atan2 [empty]_trv [-2.0, -0.0]_def = [empty]_trv; atan2 [empty]_trv [-2.0, 1.0]_trv = [empty]_trv; atan2 [empty]_trv [0.0, 1.0]_com = [empty]_trv; atan2 [empty]_trv [-0.0, 1.0]_dac = [empty]_trv; atan2 [empty]_trv [0.1, 1.0]_def = [empty]_trv; atan2 [entire]_def [empty]_trv = [empty]_trv; atan2 [entire]_def [entire]_def = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [entire]_def [0.0, 0.0]_com = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_trv; atan2 [entire]_def [0.0, -0.0]_def = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_trv; atan2 [entire]_def [-0.0, 0.0]_dac = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_trv; atan2 [entire]_def [-0.0, -0.0]_trv = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_trv; atan2 [entire]_def [-2.0, -0.1]_com = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_def; atan2 [entire]_def [-2.0, 0.0]_dac = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [entire]_def [-2.0, -0.0]_def = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [entire]_def [-2.0, 1.0]_trv = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [entire]_def [0.0, 1.0]_dac = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_trv; atan2 [entire]_def [-0.0, 1.0]_def = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_trv; atan2 [entire]_def [0.1, 1.0]_com = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_def; atan2 [0.0, 0.0]_com [empty]_trv = [empty]_trv; atan2 [0.0, 0.0]_dac [entire]_def = [0.0,0X1.921FB54442D19P+1]_trv; atan2 [0.0, 0.0]_def [0.0, 0.0]_trv = [empty]_trv; atan2 [0.0, 0.0]_trv [-0.0, 0.0]_dac = [empty]_trv; atan2 [0.0, 0.0]_com [0.0, -0.0]_def = [empty]_trv; atan2 [0.0, 0.0]_dac [-0.0, -0.0]_com = [empty]_trv; atan2 [0.0, 0.0]_com [-2.0, -0.1]_dac = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]_dac; atan2 [0.0, 0.0]_trv [-2.0, 0.0]_com = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]_trv; atan2 [0.0, 0.0]_com [-2.0, -0.0]_trv = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]_trv; atan2 [0.0, 0.0]_dac [-2.0, 1.0]_def = [0.0,0X1.921FB54442D19P+1]_trv; atan2 [0.0, 0.0]_def [0.0, 1.0]_com = [0.0,0.0]_trv; atan2 [0.0, 0.0]_trv [-0.0, 1.0]_dac = [0.0,0.0]_trv; atan2 [0.0, 0.0]_com [0.1, 1.0]_com = [0.0,0.0]_com; atan2 [-0.0, 0.0]_com [empty]_trv = [empty]_trv; atan2 [-0.0, 0.0]_dac [entire]_def = [0.0,0X1.921FB54442D19P+1]_trv; atan2 [-0.0, 0.0]_def [0.0, 0.0]_com = [empty]_trv; atan2 [-0.0, 0.0]_trv [-0.0, 0.0]_trv = [empty]_trv; atan2 [-0.0, 0.0]_com [0.0, -0.0]_def = [empty]_trv; atan2 [-0.0, 0.0]_dac [-0.0, -0.0]_com = [empty]_trv; atan2 [-0.0, 0.0]_dac [-2.0, -0.1]_dac = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]_dac; atan2 [-0.0, 0.0]_trv [-2.0, 0.0]_com = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-0.0, 0.0]_com [-2.0, -0.0]_trv = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-0.0, 0.0]_dac [-2.0, 1.0]_def = [0.0,0X1.921FB54442D19P+1]_trv; atan2 [-0.0, 0.0]_com [0.0, 1.0]_com = [0.0,0.0]_trv; atan2 [-0.0, 0.0]_def [-0.0, 1.0]_dac = [0.0,0.0]_trv; atan2 [-0.0, 0.0]_com [0.1, 1.0]_com = [0.0,0.0]_com; atan2 [0.0, -0.0]_com [empty]_trv = [empty]_trv; atan2 [0.0, -0.0]_dac [entire]_def = [0.0,0X1.921FB54442D19P+1]_trv; atan2 [0.0, -0.0]_def [0.0, 0.0]_dac = [empty]_trv; atan2 [0.0, -0.0]_trv [-0.0, 0.0]_com = [empty]_trv; atan2 [0.0, -0.0]_dac [0.0, -0.0]_def = [empty]_trv; atan2 [0.0, -0.0]_com [-0.0, -0.0]_trv = [empty]_trv; atan2 [0.0, -0.0]_com [-2.0, -0.1]_dac = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]_dac; atan2 [0.0, -0.0]_def [-2.0, 0.0]_com = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]_trv; atan2 [0.0, -0.0]_com [-2.0, -0.0]_dac = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]_trv; atan2 [0.0, -0.0]_dac [-2.0, 1.0]_com = [0.0,0X1.921FB54442D19P+1]_trv; atan2 [0.0, -0.0]_com [0.0, 1.0]_trv = [0.0,0.0]_trv; atan2 [0.0, -0.0]_def [-0.0, 1.0]_com = [0.0,0.0]_trv; atan2 [0.0, -0.0]_com [0.1, 1.0]_def = [0.0,0.0]_def; atan2 [-0.0, -0.0]_com [empty]_trv = [empty]_trv; atan2 [-0.0, -0.0]_def [entire]_def = [0.0,0X1.921FB54442D19P+1]_trv; atan2 [-0.0, -0.0]_dac [0.0, 0.0]_com = [empty]_trv; atan2 [-0.0, -0.0]_trv [-0.0, 0.0]_def = [empty]_trv; atan2 [-0.0, -0.0]_com [0.0, -0.0]_trv = [empty]_trv; atan2 [-0.0, -0.0]_dac [-0.0, -0.0]_com = [empty]_trv; atan2 [-0.0, -0.0]_def [-2.0, -0.1]_dac = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]_def; atan2 [-0.0, -0.0]_trv [-2.0, 0.0]_def = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-0.0, -0.0]_dac [-2.0, -0.0]_trv = [0X1.921FB54442D18P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-0.0, -0.0]_def [-2.0, 1.0]_com = [0.0,0X1.921FB54442D19P+1]_trv; atan2 [-0.0, -0.0]_com [0.0, 1.0]_com = [0.0,0.0]_trv; atan2 [-0.0, -0.0]_trv [-0.0, 1.0]_dac = [0.0,0.0]_trv; atan2 [-0.0, -0.0]_com [0.1, 1.0]_com = [0.0,0.0]_com; atan2 [-2.0, -0.1]_dac [empty]_trv = [empty]_trv; atan2 [-2.0, -0.1]_def [entire]_def = [-0X1.921FB54442D19P+1,0.0]_def; atan2 [-2.0, -0.1]_trv [0.0, 0.0]_com = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]_trv; atan2 [-2.0, -0.1]_com [0.0, -0.0]_dac = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]_dac; atan2 [-2.0, -0.1]_dac [-0.0, 0.0]_def = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]_def; atan2 [-2.0, -0.1]_com [0.0, -0.0]_trv = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]_trv; atan2 [-2.0, -0.1]_def [-2.0, -0.1]_com = [-0X1.8BBAABDE5E29CP+1, -0X1.9EE9C8100C211P+0]_def; atan2 [-2.0, -0.1]_com [-2.0, 0.0]_def = [-0X1.8BBAABDE5E29CP+1, -0X1.921FB54442D18P+0]_def; atan2 [-2.0, -0.1]_trv [-2.0, -0.0]_dac = [-0X1.8BBAABDE5E29CP+1, -0X1.921FB54442D18P+0]_trv; atan2 [-2.0, -0.1]_def [-2.0, 1.0]_trv = [-0X1.8BBAABDE5E29CP+1, -0X1.983E282E2CC4CP-4]_trv; atan2 [-2.0, -0.1]_com [0.0, 1.0]_def = [-0X1.921FB54442D19P+0, -0X1.983E282E2CC4CP-4]_def; atan2 [-2.0, -0.1]_dac [-0.0, 1.0]_com = [-0X1.921FB54442D19P+0, -0X1.983E282E2CC4CP-4]_dac; atan2 [-2.0, -0.1]_com [0.1, 1.0]_com = [-0X1.8555A2787982P+0, -0X1.983E282E2CC4CP-4]_com; atan2 [-2.0, 0.0]_def [empty]_trv = [empty]_trv; atan2 [-2.0, 0.0]_def [entire]_def = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-2.0, 0.0]_dac [0.0, 0.0]_dac = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]_trv; atan2 [-2.0, 0.0]_trv [-0.0, 0.0]_com = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]_trv; atan2 [-2.0, 0.0]_com [0.0, -0.0]_trv = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]_trv; atan2 [-2.0, 0.0]_def [-0.0, -0.0]_def = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]_trv; atan2 [-2.0, 0.0]_com [-2.0, -0.1]_dac = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_def; atan2 [-2.0, 0.0]_dac [-2.0, 0.0]_com = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-2.0, 0.0]_com [-2.0, -0.0]_dac = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-2.0, 0.0]_trv [-2.0, 1.0]_com = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-2.0, 0.0]_def [0.0, 1.0]_def = [-0X1.921FB54442D19P+0, 0.0]_trv; atan2 [-2.0, 0.0]_com [-0.0, 1.0]_dac = [-0X1.921FB54442D19P+0, 0.0]_trv; atan2 [-2.0, 0.0]_com [0.1, 1.0]_com = [-0X1.8555A2787982P+0, 0.0]_com; atan2 [-2.0, -0.0]_trv [empty]_trv = [empty]_trv; atan2 [-2.0, -0.0]_dac [entire]_def = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-2.0, -0.0]_com [0.0, 0.0]_com = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]_trv; atan2 [-2.0, -0.0]_def [-0.0, 0.0]_dac = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]_trv; atan2 [-2.0, -0.0]_dac [0.0, -0.0]_def = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]_trv; atan2 [-2.0, -0.0]_com [-0.0, -0.0]_trv = [-0X1.921FB54442D19P+0, -0X1.921FB54442D18P+0]_trv; atan2 [-2.0, -0.0]_def [-2.0, -0.1]_com = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_def; atan2 [-2.0, -0.0]_com [-2.0, 0.0]_dac = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-2.0, -0.0]_dac [-2.0, -0.0]_def = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-2.0, -0.0]_def [-2.0, 1.0]_trv = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-2.0, -0.0]_trv [0.0, 1.0]_dac = [-0X1.921FB54442D19P+0, 0.0]_trv; atan2 [-2.0, -0.0]_com [-0.0, 1.0]_com = [-0X1.921FB54442D19P+0, 0.0]_trv; atan2 [-2.0, -0.0]_com [0.1, 1.0]_com = [-0X1.8555A2787982P+0, 0.0]_com; atan2 [-2.0, 1.0]_def [empty]_trv = [empty]_trv; atan2 [-2.0, 1.0]_dac [entire]_def = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-2.0, 1.0]_def [0.0, 0.0]_def = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_trv; atan2 [-2.0, 1.0]_com [-0.0, 0.0]_dac = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_trv; atan2 [-2.0, 1.0]_trv [0.0, -0.0]_trv = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_trv; atan2 [-2.0, 1.0]_com [-0.0, -0.0]_com = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_trv; atan2 [-2.0, 1.0]_dac [-2.0, -0.1]_dac = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_def; atan2 [-2.0, 1.0]_def [-2.0, 0.0]_def = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-2.0, 1.0]_trv [-2.0, -0.0]_trv = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-2.0, 1.0]_dac [-2.0, 1.0]_com = [-0X1.921FB54442D19P+1, 0X1.921FB54442D19P+1]_trv; atan2 [-2.0, 1.0]_com [0.0, 1.0]_dac = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_trv; atan2 [-2.0, 1.0]_trv [-0.0, 1.0]_dac = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_trv; atan2 [-2.0, 1.0]_com [0.1, 1.0]_com = [-0X1.8555A2787982P+0, 0X1.789BD2C160054P+0]_com; atan2 [-0.0, 1.0]_com [empty]_trv = [empty]_trv; atan2 [-0.0, 1.0]_dac [entire]_def = [0.0, 0X1.921FB54442D19P+1]_trv; atan2 [-0.0, 1.0]_def [0.0, 0.0]_def = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]_trv; atan2 [-0.0, 1.0]_trv [-0.0, 0.0]_trv = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]_trv; atan2 [-0.0, 1.0]_dac [0.0, -0.0]_dac = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]_trv; atan2 [-0.0, 1.0]_com [-0.0, -0.0]_def = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]_trv; atan2 [-0.0, 1.0]_com [-2.0, -0.1]_com = [0X1.ABA397C7259DDP+0, 0X1.921FB54442D19P+1]_dac; atan2 [-0.0, 1.0]_def [-2.0, 0.0]_com = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+1]_trv; atan2 [-0.0, 1.0]_def [-2.0, -0.0]_def = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+1]_trv; atan2 [-0.0, 1.0]_dac [-2.0, 1.0]_dac = [0.0, 0X1.921FB54442D19P+1]_trv; atan2 [-0.0, 1.0]_dac [0.0, 1.0]_dac = [0.0,0X1.921FB54442D19P+0]_trv; atan2 [-0.0, 1.0]_trv [-0.0, 1.0]_com = [0.0,0X1.921FB54442D19P+0]_trv; atan2 [-0.0, 1.0]_trv [0.1, 1.0]_com = [0.0, 0X1.789BD2C160054P+0]_trv; atan2 [0.0, 1.0]_def [empty]_trv = [empty]_trv; atan2 [0.0, 1.0]_dac [entire]_def = [0.0, 0X1.921FB54442D19P+1]_trv; atan2 [0.0, 1.0]_dac [0.0, 0.0]_def = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]_trv; atan2 [0.0, 1.0]_trv [-0.0, 0.0]_trv = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]_trv; atan2 [0.0, 1.0]_trv [0.0, -0.0]_dac = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]_trv; atan2 [0.0, 1.0]_def [-0.0, -0.0]_com = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]_trv; atan2 [0.0, 1.0]_dac [-2.0, -0.1]_dac = [0X1.ABA397C7259DDP+0, 0X1.921FB54442D19P+1]_dac; atan2 [0.0, 1.0]_def [-2.0, 0.0]_trv = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+1]_trv; atan2 [0.0, 1.0]_dac [-2.0, -0.0]_dac = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+1]_trv; atan2 [0.0, 1.0]_dac [-2.0, 1.0]_def = [0.0, 0X1.921FB54442D19P+1]_trv; atan2 [0.0, 1.0]_dac [0.0, 1.0]_trv = [0.0,0X1.921FB54442D19P+0]_trv; atan2 [0.0, 1.0]_dac [-0.0, 1.0]_def = [0.0,0X1.921FB54442D19P+0]_trv; atan2 [0.0, 1.0]_com [0.1, 1.0]_com = [0.0,0X1.789BD2C160054P+0]_com; atan2 [0.1, 1.0]_dac [empty]_trv = [empty]_trv; atan2 [0.1, 1.0]_dac [entire]_def = [0.0, 0X1.921FB54442D19P+1]_def; atan2 [0.1, 1.0]_def [0.0, 0.0]_com = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]_def; atan2 [0.1, 1.0]_trv [-0.0, 0.0]_def = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]_trv; atan2 [0.1, 1.0]_trv [0.0, -0.0]_def = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]_trv; atan2 [0.1, 1.0]_dac [-0.0, -0.0]_def = [0X1.921FB54442D18P+0, 0X1.921FB54442D19P+0]_def; atan2 [0.1, 1.0]_com [-2.0, -0.1]_trv = [0X1.ABA397C7259DDP+0, 0X1.8BBAABDE5E29CP+1]_trv; atan2 [0.1, 1.0]_com [-2.0, 0.0]_dac = [0X1.921FB54442D18P+0, 0X1.8BBAABDE5E29CP+1]_dac; atan2 [0.1, 1.0]_com [-2.0, -0.0]_dac = [0X1.921FB54442D18P+0, 0X1.8BBAABDE5E29CP+1]_dac; atan2 [0.1, 1.0]_def [-2.0, 1.0]_dac = [0X1.983E282E2CC4CP-4, 0X1.8BBAABDE5E29CP+1]_def; atan2 [0.1, 1.0]_def [0.0, 1.0]_def = [0X1.983E282E2CC4CP-4, 0X1.921FB54442D19P+0]_def; atan2 [0.1, 1.0]_dac [-0.0, 1.0]_def = [0X1.983E282E2CC4CP-4, 0X1.921FB54442D19P+0]_def; atan2 [0.1, 1.0]_dac [0.1, 1.0]_def = [0X1.983E282E2CC4CP-4, 0X1.789BD2C160054P+0]_def; } testcase minimal_sinh_test { sinh [empty] = [empty]; sinh [0.0,infinity] = [0.0,infinity]; sinh [-0.0,infinity] = [0.0,infinity]; sinh [-infinity,0.0] = [-infinity,0.0]; sinh [-infinity,-0.0] = [-infinity,0.0]; sinh [entire] = [entire]; sinh [0.0,0.0] = [0.0,0.0]; sinh [-0.0,-0.0] = [0.0,0.0]; sinh [1.0,0X1.2C903022DD7AAP+8] = [0X1.2CD9FC44EB982P+0,0X1.89BCA168970C6P+432]; sinh [-0X1.FD219490EAAC1P+38,-0X1.1AF1C9D74F06DP+9] = [-infinity,-0X1.53045B4F849DEP+815]; sinh [-0X1.199999999999AP+0,0X1.2666666666666P+1] = [-0X1.55ECFE1B2B215P+0,0X1.3BF72EA61AF1BP+2]; } testcase minimal_sinh_dec_test { sinh [entire]_def = [entire]_def; sinh [0.0,infinity]_dac = [0.0,infinity]_dac; sinh [-infinity,0.0]_def = [-infinity,0.0]_def; sinh [1.0,0X1.2C903022DD7AAP+8]_com = [0X1.2CD9FC44EB982P+0,0X1.89BCA168970C6P+432]_com; sinh [-0X1.FD219490EAAC1P+38,-0X1.1AF1C9D74F06DP+9]_com = [-infinity,-0X1.53045B4F849DEP+815]_dac; } testcase minimal_cosh_test { cosh [empty] = [empty]; cosh [0.0,infinity] = [1.0,infinity]; cosh [-0.0,infinity] = [1.0,infinity]; cosh [-infinity,0.0] = [1.0,infinity]; cosh [-infinity,-0.0] = [1.0,infinity]; cosh [entire] = [1.0,infinity]; cosh [0.0,0.0] = [1.0,1.0]; cosh [-0.0,-0.0] = [1.0,1.0]; cosh [1.0,0X1.2C903022DD7AAP+8] = [0X1.8B07551D9F55P+0,0X1.89BCA168970C6P+432]; cosh [-0X1.FD219490EAAC1P+38,-0X1.1AF1C9D74F06DP+9] = [0X1.53045B4F849DEP+815,infinity]; cosh [-0X1.199999999999AP+0,0X1.2666666666666P+1] = [1.0,0X1.4261D2B7D6181P+2]; } testcase minimal_cosh_dec_test { cosh [0.0,infinity]_dac = [1.0,infinity]_dac; cosh [-infinity,0.0]_def = [1.0,infinity]_def; cosh [entire]_def = [1.0,infinity]_def; cosh [1.0,0X1.2C903022DD7AAP+8]_def = [0X1.8B07551D9F55P+0,0X1.89BCA168970C6P+432]_def; cosh [-0X1.FD219490EAAC1P+38,-0X1.1AF1C9D74F06DP+9]_com = [0X1.53045B4F849DEP+815,infinity]_dac; } testcase minimal_tanh_test { tanh [empty] = [empty]; tanh [0.0,infinity] = [0.0,1.0]; tanh [-0.0,infinity] = [0.0,1.0]; tanh [-infinity,0.0] = [-1.0,0.0]; tanh [-infinity,-0.0] = [-1.0,0.0]; tanh [entire] = [-1.0,1.0]; tanh [0.0,0.0] = [0.0,0.0]; tanh [-0.0,-0.0] = [0.0,0.0]; tanh [1.0,0X1.2C903022DD7AAP+8] = [0X1.85EFAB514F394P-1,0X1P+0]; tanh [-0X1.FD219490EAAC1P+38,-0X1.1AF1C9D74F06DP+9] = [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]; tanh [-0X1.199999999999AP+0,0X1.2666666666666P+1] = [-0X1.99DB01FDE2406P-1,0X1.F5CF31E1C8103P-1]; } testcase minimal_tanh_dec_test { tanh [0.0,infinity]_dac = [0.0,1.0]_dac; tanh [-infinity,0.0]_def = [-1.0,0.0]_def; tanh [entire]_def = [-1.0,1.0]_def; tanh [1.0,0X1.2C903022DD7AAP+8]_com = [0X1.85EFAB514F394P-1,0X1P+0]_com; tanh [-0X1.FD219490EAAC1P+38,-0X1.1AF1C9D74F06DP+9]_trv = [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]_trv; } testcase minimal_asinh_test { asinh [empty] = [empty]; asinh [0.0,infinity] = [0.0,infinity]; asinh [-0.0,infinity] = [0.0,infinity]; asinh [-infinity,0.0] = [-infinity,0.0]; asinh [-infinity,-0.0] = [-infinity,0.0]; asinh [entire] = [entire]; asinh [0.0,0.0] = [0.0,0.0]; asinh [-0.0,-0.0] = [0.0,0.0]; asinh [1.0,0X1.2C903022DD7AAP+8] = [0X1.C34366179D426P-1,0X1.9986127438A87P+2]; asinh [-0X1.FD219490EAAC1P+38,-0X1.1AF1C9D74F06DP+9] = [-0X1.BB86380A6CC45P+4,-0X1.C204D8EB20827P+2]; asinh [-0X1.199999999999AP+0,0X1.2666666666666P+1] = [-0X1.E693DF6EDF1E7P-1,0X1.91FDC64DE0E51P+0]; } testcase minimal_asinh_dec_test { asinh [0.0,infinity]_dac = [0.0,infinity]_dac; asinh [-infinity,0.0]_trv = [-infinity,0.0]_trv; asinh [entire]_def = [entire]_def; asinh [1.0,0X1.2C903022DD7AAP+8]_com = [0X1.C34366179D426P-1,0X1.9986127438A87P+2]_com; asinh [-0X1.FD219490EAAC1P+38,-0X1.1AF1C9D74F06DP+9]_def = [-0X1.BB86380A6CC45P+4,-0X1.C204D8EB20827P+2]_def; } testcase minimal_acosh_test { acosh [empty] = [empty]; acosh [0.0,infinity] = [0.0,infinity]; acosh [-0.0,infinity] = [0.0,infinity]; acosh [1.0,infinity] = [0.0,infinity]; acosh [-infinity,1.0] = [0.0,0.0]; acosh [-infinity,0X1.FFFFFFFFFFFFFP-1] = [empty]; acosh [entire] = [0.0,infinity]; acosh [1.0,1.0] = [0.0,0.0]; acosh [1.0,0X1.2C903022DD7AAP+8] = [0.0,0X1.9985FB3D532AFP+2]; acosh [0X1.199999999999AP+0,0X1.2666666666666P+1] = [0X1.C636C1A882F2CP-2,0X1.799C88E79140DP+0]; acosh [0X1.14D4E82B2B26FP+15,0X1.72DBE91C837B5P+29] = [0X1.656510B4BAEC3P+3,0X1.52A415EE8455AP+4]; } testcase minimal_acosh_dec_test { acosh [0.0,infinity]_dac = [0.0,infinity]_trv; acosh [1.0,infinity]_dac = [0.0,infinity]_dac; acosh [entire]_def = [0.0,infinity]_trv; acosh [1.0,1.0]_com = [0.0,0.0]_com; acosh [0.9,1.0]_com = [0.0,0.0]_trv; acosh [1.0,0X1.2C903022DD7AAP+8]_dac = [0.0,0X1.9985FB3D532AFP+2]_dac; acosh [0.9,0X1.2C903022DD7AAP+8]_com = [0.0,0X1.9985FB3D532AFP+2]_trv; acosh [0X1.14D4E82B2B26FP+15,0X1.72DBE91C837B5P+29]_def = [0X1.656510B4BAEC3P+3,0X1.52A415EE8455AP+4]_def; } testcase minimal_atanh_test { atanh [empty] = [empty]; atanh [0.0,infinity] = [0.0,infinity]; atanh [-0.0,infinity] = [0.0,infinity]; atanh [1.0,infinity] = [empty]; atanh [-infinity,0.0] = [-infinity,0.0]; atanh [-infinity,-0.0] = [-infinity,0.0]; atanh [-infinity,-1.0] = [empty]; atanh [-1.0,1.0] = [entire]; atanh [0.0,0.0] = [0.0,0.0]; atanh [-0.0,-0.0] = [0.0,0.0]; atanh [-1.0,-1.0] = [empty]; atanh [1.0,1.0] = [empty]; atanh [entire] = [entire]; atanh [0X1.4C0420F6F08CCP-2,0X1.FFFFFFFFFFFFFP-1] = [0X1.5871DD2DF9102P-2,0X1.2B708872320E2P+4]; atanh [-0X1.FFB88E9EB6307P-1,0X1.999999999999AP-4] = [-0X1.06A3A97D7979CP+2,0X1.9AF93CD234413P-4]; } testcase minimal_atanh_dec_test { atanh [0.0,infinity]_dac = [0.0,infinity]_trv; atanh [-infinity,0.0]_def = [-infinity,0.0]_trv; atanh [-1.0,1.0]_com = [entire]_trv; atanh [0.0,0.0]_com = [0.0,0.0]_com; atanh [1.0,1.0]_def = [empty]_trv; atanh [0X1.4C0420F6F08CCP-2,0X1.FFFFFFFFFFFFFP-1]_com = [0X1.5871DD2DF9102P-2,0X1.2B708872320E2P+4]_com; atanh [-1.0,0X1.FFFFFFFFFFFFFP-1]_com = [-infinity,0X1.2B708872320E2P+4]_trv; atanh [-0X1.FFB88E9EB6307P-1,0X1.999999999999AP-4]_def = [-0X1.06A3A97D7979CP+2,0X1.9AF93CD234413P-4]_def; atanh [-0X1.FFB88E9EB6307P-1,1.0]_com = [-0X1.06A3A97D7979CP+2,infinity]_trv; } testcase minimal_sign_test { sign [empty] = [empty]; sign [1.0,2.0] = [1.0,1.0]; sign [-1.0,2.0] = [-1.0,1.0]; sign [-1.0,0.0] = [-1.0,0.0]; sign [0.0,2.0] = [0.0,1.0]; sign [-0.0,2.0] = [0.0,1.0]; sign [-5.0,-2.0] = [-1.0,-1.0]; sign [0.0,0.0] = [0.0,0.0]; sign [-0.0,-0.0] = [0.0,0.0]; sign [-0.0,0.0] = [0.0,0.0]; sign [entire] = [-1.0,1.0]; } testcase minimal_sign_dec_test { sign [1.0,2.0]_com = [1.0,1.0]_com; sign [-1.0,2.0]_com = [-1.0,1.0]_def; sign [-1.0,0.0]_com = [-1.0,0.0]_def; sign [0.0,2.0]_com = [0.0,1.0]_def; sign [-0.0,2.0]_def = [0.0,1.0]_def; sign [-5.0,-2.0]_trv = [-1.0,-1.0]_trv; sign [0.0,0.0]_dac = [0.0,0.0]_dac; } testcase minimal_ceil_test { ceil [empty] = [empty]; ceil [entire] = [entire]; ceil [1.1,2.0] = [2.0,2.0]; ceil [-1.1,2.0] = [-1.0,2.0]; ceil [-1.1,0.0] = [-1.0,0.0]; ceil [-1.1,-0.0] = [-1.0,0.0]; ceil [-1.1,-0.4] = [-1.0,0.0]; ceil [-1.9,2.2] = [-1.0,3.0]; ceil [-1.0,2.2] = [-1.0,3.0]; ceil [0.0,2.2] = [0.0,3.0]; ceil [-0.0,2.2] = [0.0,3.0]; ceil [-1.5,infinity] = [-1.0,infinity]; ceil [0x1.FFFFFFFFFFFFFp1023,infinity] = [0x1.FFFFFFFFFFFFFp1023,infinity]; ceil [-infinity,2.2] = [-infinity,3.0]; ceil [-infinity,-0x1.FFFFFFFFFFFFFp1023] = [-infinity,-0x1.FFFFFFFFFFFFFp1023]; } testcase minimal_ceil_dec_test { ceil [1.1,2.0]_com = [2.0,2.0]_dac; ceil [-1.1,2.0]_com = [-1.0,2.0]_def; ceil [-1.1,0.0]_dac = [-1.0,0.0]_def; ceil [-1.1,-0.0]_trv = [-1.0,0.0]_trv; ceil [-1.1,-0.4]_dac = [-1.0,0.0]_def; ceil [-1.9,2.2]_com = [-1.0,3.0]_def; ceil [-1.0,2.2]_dac = [-1.0,3.0]_def; ceil [0.0,2.2]_trv = [0.0,3.0]_trv; ceil [-0.0,2.2]_def = [0.0,3.0]_def; ceil [-1.5,infinity]_trv = [-1.0,infinity]_trv; ceil [0x1.FFFFFFFFFFFFFp1023,infinity]_dac = [0x1.FFFFFFFFFFFFFp1023,infinity]_def; ceil [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com = [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_dac; ceil [-infinity,2.2]_trv = [-infinity,3.0]_trv; ceil [-infinity,-0x1.FFFFFFFFFFFFFp1023]_dac = [-infinity,-0x1.FFFFFFFFFFFFFp1023]_def; } testcase minimal_floor_test { floor [empty] = [empty]; floor [entire] = [entire]; floor [1.1,2.0] = [1.0,2.0]; floor [-1.1,2.0] = [-2.0,2.0]; floor [-1.1,0.0] = [-2.0,0.0]; floor [-1.1,-0.0] = [-2.0,0.0]; floor [-1.1,-0.4] = [-2.0,-1.0]; floor [-1.9,2.2] = [-2.0,2.0]; floor [-1.0,2.2] = [-1.0,2.0]; floor [0.0,2.2] = [0.0,2.0]; floor [-0.0,2.2] = [0.0,2.0]; floor [-1.5,infinity] = [-2.0,infinity]; floor [-infinity,2.2] = [-infinity,2.0]; } testcase minimal_floor_dec_test { floor [1.1,2.0]_com = [1.0,2.0]_def; floor [-1.1,2.0]_def = [-2.0,2.0]_def; floor [-1.1,0.0]_dac = [-2.0,0.0]_def; floor [-1.2,-1.1]_com = [-2.0,-2.0]_com; floor [-1.1,-0.4]_def = [-2.0,-1.0]_def; floor [-1.9,2.2]_com = [-2.0,2.0]_def; floor [-1.0,2.2]_trv = [-1.0,2.0]_trv; floor [0.0,2.2]_trv = [0.0,2.0]_trv; floor [-0.0,2.2]_com = [0.0,2.0]_def; floor [-1.5,infinity]_dac = [-2.0,infinity]_def; floor [-infinity,2.2]_trv = [-infinity,2.0]_trv; } testcase minimal_trunc_test { trunc [empty] = [empty]; trunc [entire] = [entire]; trunc [1.1,2.1] = [1.0,2.0]; trunc [-1.1,2.0] = [-1.0,2.0]; trunc [-1.1,0.0] = [-1.0,0.0]; trunc [-1.1,-0.0] = [-1.0,0.0]; trunc [-1.1,-0.4] = [-1.0,0.0]; trunc [-1.9,2.2] = [-1.0,2.0]; trunc [-1.0,2.2] = [-1.0,2.0]; trunc [0.0,2.2] = [0.0,2.0]; trunc [-0.0,2.2] = [0.0,2.0]; trunc [-1.5,infinity] = [-1.0,infinity]; trunc [-infinity,2.2] = [-infinity,2.0]; } testcase minimal_trunc_dec_test { trunc [1.1,2.1]_com = [1.0,2.0]_def; trunc [1.1,1.9]_com = [1.0,1.0]_com; trunc [-1.1,2.0]_dac = [-1.0,2.0]_def; trunc [-1.1,0.0]_trv = [-1.0,0.0]_trv; trunc [-1.1,-0.0]_def = [-1.0,0.0]_def; trunc [-1.1,-0.4]_com = [-1.0,0.0]_def; trunc [-1.9,2.2]_def = [-1.0,2.0]_def; trunc [-1.0,2.2]_dac = [-1.0,2.0]_def; trunc [-1.5,infinity]_dac = [-1.0,infinity]_def; trunc [-infinity,2.2]_trv = [-infinity,2.0]_trv; } testcase minimal_roundTiesToEven_test { roundTiesToEven [empty] = [empty]; roundTiesToEven [entire] = [entire]; roundTiesToEven [1.1,2.1] = [1.0,2.0]; roundTiesToEven [-1.1,2.0] = [-1.0,2.0]; roundTiesToEven [-1.1,-0.4] = [-1.0,0.0]; roundTiesToEven [-1.1,0.0] = [-1.0,0.0]; roundTiesToEven [-1.1,-0.0] = [-1.0,0.0]; roundTiesToEven [-1.9,2.2] = [-2.0,2.0]; roundTiesToEven [-1.0,2.2] = [-1.0,2.0]; roundTiesToEven [1.5,2.1] = [2.0,2.0]; roundTiesToEven [-1.5,2.0] = [-2.0,2.0]; roundTiesToEven [-1.1,-0.5] = [-1.0,0.0]; roundTiesToEven [-1.9,2.5] = [-2.0,2.0]; roundTiesToEven [0.0,2.5] = [0.0,2.0]; roundTiesToEven [-0.0,2.5] = [0.0,2.0]; roundTiesToEven [-1.5,2.5] = [-2.0,2.0]; roundTiesToEven [-1.5,infinity] = [-2.0,infinity]; roundTiesToEven [-infinity,2.2] = [-infinity,2.0]; } testcase minimal_roundTiesToEven_dec_test { roundTiesToEven [1.1,2.1]_com = [1.0,2.0]_def; roundTiesToEven [-1.1,2.0]_trv = [-1.0,2.0]_trv; roundTiesToEven [-1.6,-1.5]_com = [-2.0,-2.0]_dac; roundTiesToEven [-1.6,-1.4]_com = [-2.0,-1.0]_def; roundTiesToEven [-1.5,infinity]_dac = [-2.0,infinity]_def; roundTiesToEven [-infinity,2.2]_trv = [-infinity,2.0]_trv; } testcase minimal_roundTiesToAway_test { roundTiesToAway [empty] = [empty]; roundTiesToAway [entire] = [entire]; roundTiesToAway [1.1,2.1] = [1.0,2.0]; roundTiesToAway [-1.1,2.0] = [-1.0,2.0]; roundTiesToAway [-1.1,0.0] = [-1.0,0.0]; roundTiesToAway [-1.1,-0.0] = [-1.0,-0.0]; roundTiesToAway [-1.1,-0.4] = [-1.0,0.0]; roundTiesToAway [-1.9,2.2] = [-2.0,2.0]; roundTiesToAway [-1.0,2.2] = [-1.0,2.0]; roundTiesToAway [0.5,2.1] = [1.0,2.0]; roundTiesToAway [-2.5,2.0] = [-3.0,2.0]; roundTiesToAway [-1.1,-0.5] = [-1.0,-1.0]; roundTiesToAway [-1.9,2.5] = [-2.0,3.0]; roundTiesToAway [-1.5,2.5] = [-2.0,3.0]; roundTiesToAway [0.0,2.5] = [0.0,3.0]; roundTiesToAway [-0.0,2.5] = [0.0,3.0]; roundTiesToAway [-1.5,infinity] = [-2.0,infinity]; roundTiesToAway [-infinity,2.2] = [-infinity,2.0]; } testcase minimal_roundTiesToAway_dec_test { roundTiesToAway [1.1,2.1]_com = [1.0,2.0]_def; roundTiesToAway [-1.9,2.2]_com = [-2.0,2.0]_def; roundTiesToAway [1.9,2.2]_com = [2.0,2.0]_com; roundTiesToAway [-1.0,2.2]_trv = [-1.0,2.0]_trv; roundTiesToAway [2.5,2.6]_com = [3.0,3.0]_dac; roundTiesToAway [-1.5,infinity]_dac = [-2.0,infinity]_def; roundTiesToAway [-infinity,2.2]_def = [-infinity,2.0]_def; } testcase minimal_abs_test { abs [empty] = [empty]; abs [entire] = [0.0,infinity]; abs [1.1,2.1] = [1.1,2.1]; abs [-1.1,2.0] = [0.0,2.0]; abs [-1.1,0.0] = [0.0,1.1]; abs [-1.1,-0.0] = [0.0,1.1]; abs [-1.1,-0.4] = [0.4,1.1]; abs [-1.9,0.2] = [0.0,1.9]; abs [0.0,0.2] = [0.0,0.2]; abs [-0.0,0.2] = [0.0,0.2]; abs [-1.5,infinity] = [0.0,infinity]; abs [-infinity,-2.2] = [2.2,infinity]; } testcase minimal_abs_dec_test { abs [-1.1,2.0]_com = [0.0,2.0]_com; abs [-1.1,0.0]_dac = [0.0,1.1]_dac; abs [-1.1,-0.0]_def = [0.0,1.1]_def; abs [-1.1,-0.4]_trv = [0.4,1.1]_trv; abs [-1.9,0.2]_dac = [0.0,1.9]_dac; abs [0.0,0.2]_def = [0.0,0.2]_def; abs [-0.0,0.2]_com = [0.0,0.2]_com; abs [-1.5,infinity]_dac = [0.0,infinity]_dac; } testcase minimal_min_test { min [empty] [1.0,2.0] = [empty]; min [1.0,2.0] [empty] = [empty]; min [empty] [empty] = [empty]; min [entire] [1.0,2.0] = [-infinity,2.0]; min [1.0,2.0] [entire] = [-infinity,2.0]; min [entire] [entire] = [entire]; min [empty] [entire] = [empty]; min [1.0,5.0] [2.0,4.0] = [1.0,4.0]; min [0.0,5.0] [2.0,4.0] = [0.0,4.0]; min [-0.0,5.0] [2.0,4.0] = [0.0,4.0]; min [1.0,5.0] [2.0,8.0] = [1.0,5.0]; min [1.0,5.0] [entire] = [-infinity,5.0]; min [-7.0,-5.0] [2.0,4.0] = [-7.0,-5.0]; min [-7.0,0.0] [2.0,4.0] = [-7.0,0.0]; min [-7.0,-0.0] [2.0,4.0] = [-7.0,0.0]; } testcase minimal_min_dec_test { min [entire]_def [1.0,2.0]_com = [-infinity,2.0]_def; min [-7.0,-5.0]_trv [2.0,4.0]_def = [-7.0,-5.0]_trv; min [-7.0,0.0]_dac [2.0,4.0]_def = [-7.0,0.0]_def; min [-7.0,-0.0]_com [2.0,4.0]_com = [-7.0,0.0]_com; } testcase minimal_max_test { max [empty] [1.0,2.0] = [empty]; max [1.0,2.0] [empty] = [empty]; max [empty] [empty] = [empty]; max [entire] [1.0,2.0] = [1.0,infinity]; max [1.0,2.0] [entire] = [1.0,infinity]; max [entire] [entire] = [entire]; max [empty] [entire] = [empty]; max [1.0,5.0] [2.0,4.0] = [2.0,5.0]; max [1.0,5.0] [2.0,8.0] = [2.0,8.0]; max [-1.0,5.0] [entire] = [-1.0,infinity]; max [-7.0,-5.0] [2.0,4.0] = [2.0,4.0]; max [-7.0,-5.0] [0.0,4.0] = [0.0,4.0]; max [-7.0,-5.0] [-0.0,4.0] = [0.0,4.0]; max [-7.0,-5.0] [-2.0,0.0] = [-2.0,0.0]; max [-7.0,-5.0] [-2.0,-0.0] = [-2.0,0.0]; } testcase minimal_max_dec_test { max [entire]_def [1.0,2.0]_com = [1.0,infinity]_def; max [-7.0,-5.0]_trv [2.0,4.0]_def = [2.0,4.0]_trv; max [-7.0,5.0]_dac [2.0,4.0]_def = [2.0,5.0]_def; max [3.0,3.5]_com [2.0,4.0]_com = [3.0,4.0]_com; } interval-2.1.0/test/libieeep1788_tests_mul_rev.itl0000644000000000000000000007103213031036767020247 0ustar 00000000000000/* Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) Copyright 2015-2016 Oliver Heimlich Original author: Marco Nehmeier (unit tests in libieeep1788, original license: Apache License 2.0) Converted into portable ITL format by Oliver Heimlich with minor corrections. 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 . */ testcase minimal_mulRevToPair_test { mulRevToPair [empty] [1.0, 2.0] = [empty] [empty]; mulRevToPair [1.0, 2.0] [empty] = [empty] [empty]; mulRevToPair [empty] [empty] = [empty] [empty]; mulRevToPair [-2.0, -0.1] [-2.1, -0.4] = [0X1.999999999999AP-3, 0X1.5P+4] [empty]; mulRevToPair [-2.0, 0.0] [-2.1, -0.4] = [0X1.999999999999AP-3, infinity] [empty]; mulRevToPair [-2.0, 1.1] [-2.1, -0.4] = [-infinity, -0X1.745D1745D1745P-2] [0X1.999999999999AP-3, infinity]; mulRevToPair [0.0, 1.1] [-2.1, -0.4] = [-infinity, -0X1.745D1745D1745P-2] [empty]; mulRevToPair [0.01, 1.1] [-2.1, -0.4] = [-0X1.A400000000001P+7, -0X1.745D1745D1745P-2] [empty]; mulRevToPair [0.0, 0.0] [-2.1, -0.4] = [empty] [empty]; mulRevToPair [-infinity, -0.1] [-2.1, -0.4] = [0.0, 0X1.5P+4] [empty]; mulRevToPair [-infinity, 0.0] [-2.1, -0.4] = [0.0, infinity] [empty]; mulRevToPair [-infinity, 1.1] [-2.1, -0.4] = [-infinity, -0X1.745D1745D1745P-2] [0.0, infinity]; mulRevToPair [-2.0, infinity] [-2.1, -0.4] = [-infinity, 0.0] [0X1.999999999999AP-3, infinity]; mulRevToPair [0.0, infinity] [-2.1, -0.4] = [-infinity, 0.0] [empty]; mulRevToPair [0.01, infinity] [-2.1, -0.4] = [-0X1.A400000000001P+7, 0.0] [empty]; mulRevToPair [entire] [-2.1, -0.4] = [-infinity, 0.0] [0.0, infinity]; mulRevToPair [-2.0, -0.1] [-2.1, 0.0] = [0.0, 0X1.5P+4] [empty]; mulRevToPair [-2.0, 0.0] [-2.1, 0.0] = [entire] [empty]; mulRevToPair [-2.0, 1.1] [-2.1, 0.0] = [entire] [empty]; mulRevToPair [0.0, 1.1] [-2.1, 0.0] = [entire] [empty]; mulRevToPair [0.01, 1.1] [-2.1, 0.0] = [-0X1.A400000000001P+7, 0.0] [empty]; mulRevToPair [0.0, 0.0] [-2.1, 0.0] = [entire] [empty]; mulRevToPair [-infinity, -0.1] [-2.1, 0.0] = [0.0, 0X1.5P+4] [empty]; mulRevToPair [-infinity, 0.0] [-2.1, 0.0] = [entire] [empty]; mulRevToPair [-infinity, 1.1] [-2.1, 0.0] = [entire] [empty]; mulRevToPair [-2.0, infinity] [-2.1, 0.0] = [entire] [empty]; mulRevToPair [0.0, infinity] [-2.1, 0.0] = [entire] [empty]; mulRevToPair [0.01, infinity] [-2.1, 0.0] = [-0X1.A400000000001P+7, 0.0] [empty]; mulRevToPair [entire] [-2.1, 0.0] = [entire] [empty]; mulRevToPair [-2.0, -0.1] [-2.1, 0.12] = [-0X1.3333333333333P+0, 0X1.5P+4] [empty]; mulRevToPair [-2.0, 0.0] [-2.1, 0.12] = [entire] [empty]; mulRevToPair [-2.0, 1.1] [-2.1, 0.12] = [entire] [empty]; mulRevToPair [0.0, 1.1] [-2.1, 0.12] = [entire] [empty]; mulRevToPair [0.01, 1.1] [-2.1, 0.12] = [-0X1.A400000000001P+7 , 0X1.8P+3] [empty]; mulRevToPair [0.0, 0.0] [-2.1, 0.12] = [entire] [empty]; mulRevToPair [-infinity, -0.1] [-2.1, 0.12] = [-0X1.3333333333333P+0, 0X1.5P+4] [empty]; mulRevToPair [-infinity, 0.0] [-2.1, 0.12] = [entire] [empty]; mulRevToPair [-infinity, 1.1] [-2.1, 0.12] = [entire] [empty]; mulRevToPair [-2.0, infinity] [-2.1, 0.12] = [entire] [empty]; mulRevToPair [0.0, infinity] [-2.1, 0.12] = [entire] [empty]; mulRevToPair [0.01, infinity] [-2.1, 0.12] = [-0X1.A400000000001P+7 , 0X1.8P+3] [empty]; mulRevToPair [entire] [-2.1, 0.12] = [entire] [empty]; mulRevToPair [-2.0, -0.1] [0.0, 0.12] = [-0X1.3333333333333P+0, 0.0] [empty]; mulRevToPair [-2.0, 0.0] [0.0, 0.12] = [entire] [empty]; mulRevToPair [-2.0, 1.1] [0.0, 0.12] = [entire] [empty]; mulRevToPair [0.0, 1.1] [0.0, 0.12] = [entire] [empty]; mulRevToPair [0.01, 1.1] [0.0, 0.12] = [0.0, 0X1.8P+3] [empty]; mulRevToPair [0.0, 0.0] [0.0, 0.12] = [entire] [empty]; mulRevToPair [-infinity, -0.1] [0.0, 0.12] = [-0X1.3333333333333P+0, 0.0] [empty]; mulRevToPair [-infinity, 0.0] [0.0, 0.12] = [entire] [empty]; mulRevToPair [-infinity, 1.1] [0.0, 0.12] = [entire] [empty]; mulRevToPair [-2.0, infinity] [0.0, 0.12] = [entire] [empty]; mulRevToPair [0.0, infinity] [0.0, 0.12] = [entire] [empty]; mulRevToPair [0.01, infinity] [0.0, 0.12] = [0.0, 0X1.8P+3] [empty]; mulRevToPair [entire] [0.0, 0.12] = [entire] [empty]; mulRevToPair [-2.0, -0.1] [0.01, 0.12] = [-0X1.3333333333333P+0, -0X1.47AE147AE147BP-8] [empty]; mulRevToPair [-2.0, 0.0] [0.01, 0.12] = [-infinity, -0X1.47AE147AE147BP-8] [empty]; mulRevToPair [-2.0, 1.1] [0.01, 0.12] = [-infinity, -0X1.47AE147AE147BP-8] [0X1.29E4129E4129DP-7, infinity]; mulRevToPair [0.0, 1.1] [0.01, 0.12] = [0X1.29E4129E4129DP-7, infinity] [empty]; mulRevToPair [0.01, 1.1] [0.01, 0.12] = [0X1.29E4129E4129DP-7, 0X1.8P+3] [empty]; mulRevToPair [0.0, 0.0] [0.01, 0.12] = [empty] [empty]; mulRevToPair [-infinity, -0.1] [0.01, 0.12] = [-0X1.3333333333333P+0, 0.0] [empty]; mulRevToPair [-infinity, 0.0] [0.01, 0.12] = [-infinity, 0.0] [empty]; mulRevToPair [-infinity, 1.1] [0.01, 0.12] = [-infinity, 0.0] [0X1.29E4129E4129DP-7, infinity]; mulRevToPair [-2.0, infinity] [0.01, 0.12] = [-infinity, -0X1.47AE147AE147BP-8] [0.0, infinity]; mulRevToPair [0.0, infinity] [0.01, 0.12] = [0.0, infinity] [empty]; mulRevToPair [0.01, infinity] [0.01, 0.12] = [0.0, 0X1.8P+3] [empty]; mulRevToPair [entire] [0.01, 0.12] = [-infinity, 0.0] [0.0, infinity]; mulRevToPair [-2.0, -0.1] [0.0, 0.0] = [0.0, 0.0] [empty]; mulRevToPair [-2.0, 0.0] [0.0, 0.0] = [entire] [empty]; mulRevToPair [-2.0, 1.1] [0.0, 0.0] = [entire] [empty]; mulRevToPair [0.0, 1.1] [0.0, 0.0] = [entire] [empty]; mulRevToPair [0.01, 1.1] [0.0, 0.0] = [0.0, 0.0] [empty]; mulRevToPair [0.0, 0.0] [0.0, 0.0] = [entire] [empty]; mulRevToPair [-infinity, -0.1] [0.0, 0.0] = [0.0, 0.0] [empty]; mulRevToPair [-infinity, 0.0] [0.0, 0.0] = [entire] [empty]; mulRevToPair [-infinity, 1.1] [0.0, 0.0] = [entire] [empty]; mulRevToPair [-2.0, infinity] [0.0, 0.0] = [entire] [empty]; mulRevToPair [0.0, infinity] [0.0, 0.0] = [entire] [empty]; mulRevToPair [0.01, infinity] [0.0, 0.0] = [0.0, 0.0] [empty]; mulRevToPair [entire] [0.0, 0.0] = [entire] [empty]; mulRevToPair [-2.0, -0.1] [-infinity, -0.1] = [0X1.999999999999AP-5, infinity] [empty]; mulRevToPair [-2.0, 0.0] [-infinity, -0.1] = [0X1.999999999999AP-5 , infinity] [empty]; mulRevToPair [-2.0, 1.1] [-infinity, -0.1] = [-infinity , -0X1.745D1745D1745P-4] [0X1.999999999999AP-5 , infinity]; mulRevToPair [0.0, 1.1] [-infinity, -0.1] = [-infinity, -0X1.745D1745D1745P-4] [empty]; mulRevToPair [0.01, 1.1] [-infinity, -0.1] = [-infinity, -0X1.745D1745D1745P-4] [empty]; mulRevToPair [0.0, 0.0] [-infinity, -0.1] = [empty] [empty]; mulRevToPair [-infinity, -0.1] [-infinity, -0.1] = [0.0, infinity] [empty]; mulRevToPair [-infinity, 0.0] [-infinity, -0.1] = [0.0, infinity] [empty]; mulRevToPair [-infinity, 1.1] [-infinity, -0.1] = [-infinity, -0X1.745D1745D1745P-4] [0.0, infinity]; mulRevToPair [-2.0, infinity] [-infinity, -0.1] = [-infinity, 0.0] [0X1.999999999999AP-5 , infinity]; mulRevToPair [0.0, infinity] [-infinity, -0.1] = [-infinity, 0.0] [empty]; mulRevToPair [0.01, infinity] [-infinity, -0.1] = [-infinity, 0.0] [empty]; mulRevToPair [entire] [-infinity, -0.1] = [-infinity, 0.0] [0.0, infinity]; mulRevToPair [-2.0, -0.1] [-infinity, 0.0] = [0.0, infinity] [empty]; mulRevToPair [-2.0, 0.0] [-infinity, 0.0] = [entire] [empty]; mulRevToPair [-2.0, 1.1] [-infinity, 0.0] = [entire] [empty]; mulRevToPair [0.0, 1.1] [-infinity, 0.0] = [entire] [empty]; mulRevToPair [0.01, 1.1] [-infinity, 0.0] = [-infinity, 0.0] [empty]; mulRevToPair [0.0, 0.0] [-infinity, 0.0] = [entire] [empty]; mulRevToPair [-infinity, -0.1] [-infinity, 0.0] = [0.0, infinity] [empty]; mulRevToPair [-infinity, 0.0] [-infinity, 0.0] = [entire] [empty]; mulRevToPair [-infinity, 1.1] [-infinity, 0.0] = [entire] [empty]; mulRevToPair [-2.0, infinity] [-infinity, 0.0] = [entire] [empty]; mulRevToPair [0.0, infinity] [-infinity, 0.0] = [entire] [empty]; mulRevToPair [0.01, infinity] [-infinity, 0.0] = [-infinity, 0.0] [empty]; mulRevToPair [entire] [-infinity, 0.0] = [entire] [empty]; mulRevToPair [-2.0, -0.1] [-infinity, 0.3] = [-0X1.8P+1, infinity] [empty]; mulRevToPair [-2.0, 0.0] [-infinity, 0.3] = [entire] [empty]; mulRevToPair [-2.0, 1.1] [-infinity, 0.3] = [entire] [empty]; mulRevToPair [0.0, 1.1] [-infinity, 0.3] = [entire] [empty]; mulRevToPair [0.01, 1.1] [-infinity, 0.3] = [-infinity, 0X1.EP+4] [empty]; mulRevToPair [0.0, 0.0] [-infinity, 0.3] = [entire] [empty]; mulRevToPair [-infinity, -0.1] [-infinity, 0.3] = [-0X1.8P+1, infinity] [empty]; mulRevToPair [-infinity, 0.0] [-infinity, 0.3] = [entire] [empty]; mulRevToPair [-infinity, 1.1] [-infinity, 0.3] = [entire] [empty]; mulRevToPair [-2.0, infinity] [-infinity, 0.3] = [entire] [empty]; mulRevToPair [0.0, infinity] [-infinity, 0.3] = [entire] [empty]; mulRevToPair [0.01, infinity] [-infinity, 0.3] = [-infinity, 0X1.EP+4] [empty]; mulRevToPair [entire] [-infinity, 0.3] = [entire] [empty]; mulRevToPair [-2.0, -0.1] [-0.21, infinity] = [-infinity , 0X1.0CCCCCCCCCCCDP+1] [empty]; mulRevToPair [-2.0, 0.0] [-0.21, infinity] = [entire] [empty]; mulRevToPair [-2.0, 1.1] [-0.21, infinity] = [entire] [empty]; mulRevToPair [0.0, 1.1] [-0.21, infinity] = [entire] [empty]; mulRevToPair [0.01, 1.1] [-0.21, infinity] = [-0X1.5P+4, infinity] [empty]; mulRevToPair [0.0, 0.0] [-0.21, infinity] = [entire] [empty]; mulRevToPair [-infinity, -0.1] [-0.21, infinity] = [-infinity, 0X1.0CCCCCCCCCCCDP+1] [empty]; mulRevToPair [-infinity, 0.0] [-0.21, infinity] = [entire] [empty]; mulRevToPair [-infinity, 1.1] [-0.21, infinity] = [entire] [empty]; mulRevToPair [-2.0, infinity] [-0.21, infinity] = [entire] [empty]; mulRevToPair [0.0, infinity] [-0.21, infinity] = [entire] [empty]; mulRevToPair [0.01, infinity] [-0.21, infinity] = [-0X1.5P+4, infinity] [empty]; mulRevToPair [entire] [-0.21, infinity] = [entire] [empty]; mulRevToPair [-2.0, -0.1] [0.0, infinity] = [-infinity, 0.0] [empty]; mulRevToPair [-2.0, 0.0] [0.0, infinity] = [entire] [empty]; mulRevToPair [-2.0, 1.1] [0.0, infinity] = [entire] [empty]; mulRevToPair [0.0, 1.1] [0.0, infinity] = [entire] [empty]; mulRevToPair [0.01, 1.1] [0.0, infinity] = [0.0, infinity] [empty]; mulRevToPair [0.0, 0.0] [0.0, infinity] = [entire] [empty]; mulRevToPair [-infinity, -0.1] [0.0, infinity] = [-infinity, 0.0] [empty]; mulRevToPair [-infinity, 0.0] [0.0, infinity] = [entire] [empty]; mulRevToPair [-infinity, 1.1] [0.0, infinity] = [entire] [empty]; mulRevToPair [-2.0, infinity] [0.0, infinity] = [entire] [empty]; mulRevToPair [0.0, infinity] [0.0, infinity] = [entire] [empty]; mulRevToPair [0.01, infinity] [0.0, infinity] = [0.0, infinity] [empty]; mulRevToPair [entire] [0.0, infinity] = [entire] [empty]; mulRevToPair [-2.0, -0.1] [0.04, infinity] = [-infinity, -0X1.47AE147AE147BP-6] [empty]; mulRevToPair [-2.0, 0.0] [0.04, infinity] = [-infinity, -0X1.47AE147AE147BP-6] [empty]; mulRevToPair [-2.0, 1.1] [0.04, infinity] = [-infinity, -0X1.47AE147AE147BP-6] [0X1.29E4129E4129DP-5, infinity]; mulRevToPair [0.0, 1.1] [0.04, infinity] = [0X1.29E4129E4129DP-5, infinity] [empty]; mulRevToPair [0.01, 1.1] [0.04, infinity] = [0X1.29E4129E4129DP-5, infinity] [empty]; mulRevToPair [0.0, 0.0] [0.04, infinity] = [empty] [empty]; mulRevToPair [-infinity, -0.1] [0.04, infinity] = [-infinity, 0.0] [empty]; mulRevToPair [-infinity, 0.0] [0.04, infinity] = [-infinity, 0.0] [empty]; mulRevToPair [-infinity, 1.1] [0.04, infinity] = [-infinity, 0.0] [0X1.29E4129E4129DP-5, infinity]; mulRevToPair [-2.0, infinity] [0.04, infinity] = [-infinity, -0X1.47AE147AE147BP-6] [0.0, infinity]; mulRevToPair [0.0, infinity] [0.04, infinity] = [0.0, infinity] [empty]; mulRevToPair [0.01, infinity] [0.04, infinity] = [0.0, infinity] [empty]; mulRevToPair [entire] [0.04, infinity] = [-infinity, 0.0] [0.0, infinity]; mulRevToPair [-2.0, -0.1] [entire] = [entire] [empty]; mulRevToPair [-2.0, 0.0] [entire] = [entire] [empty]; mulRevToPair [-2.0, 1.1] [entire] = [entire] [empty]; mulRevToPair [0.0, 1.1] [entire] = [entire] [empty]; mulRevToPair [0.01, 1.1] [entire] = [entire] [empty]; mulRevToPair [0.0, 0.0] [entire] = [entire] [empty]; mulRevToPair [-infinity, -0.1] [entire] = [entire] [empty]; mulRevToPair [-infinity, 0.0] [entire] = [entire] [empty]; mulRevToPair [-infinity, 1.1] [entire] = [entire] [empty]; mulRevToPair [-2.0, infinity] [entire] = [entire] [empty]; mulRevToPair [0.0, infinity] [entire] = [entire] [empty]; mulRevToPair [0.01, infinity] [entire] = [entire] [empty]; mulRevToPair [entire] [entire] = [entire] [empty]; } testcase minimal_mulRevToPair_dec_test { mulRevToPair [empty]_trv [1.0, 2.0]_def = [empty]_trv [empty]_trv; mulRevToPair [1.0, 2.0]_com [empty]_trv = [empty]_trv [empty]_trv; mulRevToPair [empty]_trv [empty]_trv = [empty]_trv [empty]_trv; mulRevToPair [-2.0, -0.1]_com [-2.1, -0.4]_com = [0X1.999999999999AP-3, 0X1.5P+4]_com [empty]_trv; mulRevToPair [-2.0, 0.0]_dac [-2.1, -0.4]_com = [0X1.999999999999AP-3, infinity]_trv [empty]_trv; mulRevToPair [-2.0, 1.1]_com [-2.1, -0.4]_dac = [-infinity, -0X1.745D1745D1745P-2]_trv [0X1.999999999999AP-3, infinity]_trv; mulRevToPair [0.0, 1.1]_trv [-2.1, -0.4]_def = [-infinity, -0X1.745D1745D1745P-2]_trv [empty]_trv; mulRevToPair [0.01, 1.1]_com [-2.1, -0.4]_com = [-0X1.A400000000001P+7, -0X1.745D1745D1745P-2]_com [empty]_trv; mulRevToPair [0.0, 0.0]_dac [-2.1, -0.4]_def = [empty]_trv [empty]_trv; mulRevToPair [-infinity, -0.1]_dac [-2.1, -0.4]_dac = [0.0, 0X1.5P+4]_dac [empty]_trv; mulRevToPair [-infinity, 0.0]_def [-2.1, -0.4]_com = [0.0, infinity]_trv [empty]_trv; mulRevToPair [-infinity, 1.1]_trv [-2.1, -0.4]_def = [-infinity, -0X1.745D1745D1745P-2]_trv [0.0, infinity]_trv; mulRevToPair [-2.0, infinity]_dac [-2.1, -0.4]_dac = [-infinity, 0.0]_trv [0X1.999999999999AP-3, infinity]_trv; mulRevToPair [0.0, infinity]_def [-2.1, -0.4]_com = [-infinity, 0.0]_trv [empty]_trv; mulRevToPair [0.01, infinity]_def [-2.1, -0.4]_def = [-0X1.A400000000001P+7, 0.0]_def [empty]_trv; mulRevToPair [entire]_dac [-2.1, -0.4]_dac = [-infinity, 0.0]_trv [0.0, infinity]_trv; mulRevToPair [-2.0, -0.1]_dac [-2.1, 0.0]_com = [0.0, 0X1.5P+4]_dac [empty]_trv; mulRevToPair [-2.0, 0.0]_dac [-2.1, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [-2.0, 1.1]_dac [-2.1, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [0.0, 1.1]_dac [-2.1, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [0.01, 1.1]_dac [-2.1, 0.0]_com = [-0X1.A400000000001P+7, 0.0]_dac [empty]_trv; mulRevToPair [0.0, 0.0]_dac [-2.1, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [-infinity, -0.1]_dac [-2.1, 0.0]_com = [0.0, 0X1.5P+4]_dac [empty]_trv; mulRevToPair [-infinity, 0.0]_dac [-2.1, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [-infinity, 1.1]_dac [-2.1, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [-2.0, infinity]_dac [-2.1, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [0.0, infinity]_dac [-2.1, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [0.01, infinity]_dac [-2.1, 0.0]_com = [-0X1.A400000000001P+7, 0.0]_dac [empty]_trv; mulRevToPair [entire]_dac [-2.1, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [-2.0, -0.1]_def [-2.1, 0.12]_dac = [-0X1.3333333333333P+0, 0X1.5P+4]_def [empty]_trv; mulRevToPair [-2.0, 0.0]_def [-2.1, 0.12]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, 1.1]_def [-2.1, 0.12]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.0, 1.1]_def [-2.1, 0.12]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.01, 1.1]_def [-2.1, 0.12]_dac = [-0X1.A400000000001P+7 , 0X1.8P+3]_def [empty]_trv; mulRevToPair [0.0, 0.0]_def [-2.1, 0.12]_dac = [entire]_trv [empty]_trv; mulRevToPair [-infinity, -0.1]_def [-2.1, 0.12]_dac = [-0X1.3333333333333P+0, 0X1.5P+4]_def [empty]_trv; mulRevToPair [-infinity, 0.0]_def [-2.1, 0.12]_dac = [entire]_trv [empty]_trv; mulRevToPair [-infinity, 1.1]_def [-2.1, 0.12]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, infinity]_def [-2.1, 0.12]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.0, infinity]_def [-2.1, 0.12]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.01, infinity]_def [-2.1, 0.12]_dac = [-0X1.A400000000001P+7 , 0X1.8P+3]_def [empty]_trv; mulRevToPair [entire]_def [-2.1, 0.12]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, -0.1]_com [0.0, 0.12]_com = [-0X1.3333333333333P+0, 0.0]_com [empty]_trv; mulRevToPair [-2.0, 0.0]_com [0.0, 0.12]_com = [entire]_trv [empty]_trv; mulRevToPair [-2.0, 1.1]_com [0.0, 0.12]_com = [entire]_trv [empty]_trv; mulRevToPair [0.0, 1.1]_com [0.0, 0.12]_com = [entire]_trv [empty]_trv; mulRevToPair [0.01, 1.1]_com [0.0, 0.12]_com = [0.0, 0X1.8P+3]_com [empty]_trv; mulRevToPair [0.0, 0.0]_com [0.0, 0.12]_com = [entire]_trv [empty]_trv; mulRevToPair [-infinity, -0.1]_dac [0.0, 0.12]_com = [-0X1.3333333333333P+0, 0.0]_dac [empty]_trv; mulRevToPair [-infinity, 0.0]_dac [0.0, 0.12]_com = [entire]_trv [empty]_trv; mulRevToPair [-infinity, 1.1]_dac [0.0, 0.12]_com = [entire]_trv [empty]_trv; mulRevToPair [-2.0, infinity]_dac [0.0, 0.12]_com = [entire]_trv [empty]_trv; mulRevToPair [0.0, infinity]_dac [0.0, 0.12]_com = [entire]_trv [empty]_trv; mulRevToPair [0.01, infinity]_dac [0.0, 0.12]_com = [0.0, 0X1.8P+3]_dac [empty]_trv; mulRevToPair [entire]_dac [0.0, 0.12]_com = [entire]_trv [empty]_trv; mulRevToPair [-2.0, -0.1]_dac [0.01, 0.12]_dac = [-0X1.3333333333333P+0, -0X1.47AE147AE147BP-8]_dac [empty]_trv; mulRevToPair [-2.0, 0.0]_dac [0.01, 0.12]_dac = [-infinity, -0X1.47AE147AE147BP-8]_trv [empty]_trv; mulRevToPair [-2.0, 1.1]_dac [0.01, 0.12]_dac = [-infinity, -0X1.47AE147AE147BP-8]_trv [0X1.29E4129E4129DP-7, infinity]_trv; mulRevToPair [0.0, 1.1]_dac [0.01, 0.12]_dac = [0X1.29E4129E4129DP-7, infinity]_trv [empty]_trv; mulRevToPair [0.01, 1.1]_dac [0.01, 0.12]_dac = [0X1.29E4129E4129DP-7, 0X1.8P+3]_dac [empty]_trv; mulRevToPair [0.0, 0.0]_dac [0.01, 0.12]_dac = [empty]_trv [empty]_trv; mulRevToPair [-infinity, -0.1]_dac [0.01, 0.12]_dac = [-0X1.3333333333333P+0, 0.0]_dac [empty]_trv; mulRevToPair [-infinity, 0.0]_dac [0.01, 0.12]_dac = [-infinity, 0.0]_trv [empty]_trv; mulRevToPair [-infinity, 1.1]_dac [0.01, 0.12]_dac = [-infinity, 0.0]_trv [0X1.29E4129E4129DP-7, infinity]_trv; mulRevToPair [-2.0, infinity]_dac [0.01, 0.12]_dac = [-infinity, -0X1.47AE147AE147BP-8]_trv [0.0, infinity]_trv; mulRevToPair [0.0, infinity]_dac [0.01, 0.12]_dac = [0.0, infinity]_trv [empty]_trv; mulRevToPair [0.01, infinity]_dac [0.01, 0.12]_dac = [0.0, 0X1.8P+3]_dac [empty]_trv; mulRevToPair [entire]_dac [0.01, 0.12]_dac = [-infinity, 0.0]_trv [0.0, infinity]_trv; mulRevToPair [-2.0, -0.1]_com [0.0, 0.0]_com = [0.0, 0.0]_com [empty]_trv; mulRevToPair [-2.0, 0.0]_com [0.0, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [-2.0, 1.1]_com [0.0, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [0.0, 1.1]_com [0.0, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [0.01, 1.1]_com [0.0, 0.0]_com = [0.0, 0.0]_com [empty]_trv; mulRevToPair [0.0, 0.0]_com [0.0, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [-infinity, -0.1]_dac [0.0, 0.0]_com = [0.0, 0.0]_dac [empty]_trv; mulRevToPair [-infinity, 0.0]_dac [0.0, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [-infinity, 1.1]_dac [0.0, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [-2.0, infinity]_dac [0.0, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [0.0, infinity]_dac [0.0, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [0.01, infinity]_dac [0.0, 0.0]_com = [0.0, 0.0]_dac [empty]_trv; mulRevToPair [entire]_dac [0.0, 0.0]_com = [entire]_trv [empty]_trv; mulRevToPair [-2.0, -0.1]_dac [-infinity, -0.1]_dac = [0X1.999999999999AP-5, infinity]_dac [empty]_trv; mulRevToPair [-2.0, 0.0]_dac [-infinity, -0.1]_dac = [0X1.999999999999AP-5 , infinity]_trv [empty]_trv; mulRevToPair [-2.0, 1.1]_dac [-infinity, -0.1]_dac = [-infinity , -0X1.745D1745D1745P-4]_trv [0X1.999999999999AP-5 , infinity]_trv; mulRevToPair [0.0, 1.1]_dac [-infinity, -0.1]_dac = [-infinity, -0X1.745D1745D1745P-4]_trv [empty]_trv; mulRevToPair [0.01, 1.1]_dac [-infinity, -0.1]_dac = [-infinity, -0X1.745D1745D1745P-4]_dac [empty]_trv; mulRevToPair [0.0, 0.0]_dac [-infinity, -0.1]_dac = [empty]_trv [empty]_trv; mulRevToPair [-infinity, -0.1]_dac [-infinity, -0.1]_dac = [0.0, infinity]_dac [empty]_trv; mulRevToPair [-infinity, 0.0]_dac [-infinity, -0.1]_dac = [0.0, infinity]_trv [empty]_trv; mulRevToPair [-infinity, 1.1]_dac [-infinity, -0.1]_dac = [-infinity, -0X1.745D1745D1745P-4]_trv [0.0, infinity]_trv; mulRevToPair [-2.0, infinity]_dac [-infinity, -0.1]_dac = [-infinity, 0.0]_trv [0X1.999999999999AP-5 , infinity]_trv; mulRevToPair [0.0, infinity]_dac [-infinity, -0.1]_dac = [-infinity, 0.0]_trv [empty]_trv; mulRevToPair [0.01, infinity]_dac [-infinity, -0.1]_dac = [-infinity, 0.0]_dac [empty]_trv; mulRevToPair [entire]_dac [-infinity, -0.1]_dac = [-infinity, 0.0]_trv [0.0, infinity]_trv; mulRevToPair [-2.0, -0.1]_dac [-infinity, 0.0]_dac = [0.0, infinity]_dac [empty]_trv; mulRevToPair [-2.0, 0.0]_dac [-infinity, 0.0]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, 1.1]_dac [-infinity, 0.0]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.0, 1.1]_dac [-infinity, 0.0]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.01, 1.1]_dac [-infinity, 0.0]_dac = [-infinity, 0.0]_dac [empty]_trv; mulRevToPair [0.0, 0.0]_dac [-infinity, 0.0]_dac = [entire]_trv [empty]_trv; mulRevToPair [-infinity, -0.1]_dac [-infinity, 0.0]_dac = [0.0, infinity]_dac [empty]_trv; mulRevToPair [-infinity, 0.0]_dac [-infinity, 0.0]_dac = [entire]_trv [empty]_trv; mulRevToPair [-infinity, 1.1]_dac [-infinity, 0.0]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, infinity]_dac [-infinity, 0.0]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.0, infinity]_dac [-infinity, 0.0]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.01, infinity]_dac [-infinity, 0.0]_dac = [-infinity, 0.0]_dac [empty]_trv; mulRevToPair [entire]_dac [-infinity, 0.0]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, -0.1]_dac [-infinity, 0.3]_dac = [-0X1.8P+1, infinity]_dac [empty]_trv; mulRevToPair [-2.0, 0.0]_dac [-infinity, 0.3]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, 1.1]_dac [-infinity, 0.3]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.0, 1.1]_dac [-infinity, 0.3]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.01, 1.1]_dac [-infinity, 0.3]_dac = [-infinity, 0X1.EP+4]_dac [empty]_trv; mulRevToPair [0.0, 0.0]_dac [-infinity, 0.3]_dac = [entire]_trv [empty]_trv; mulRevToPair [-infinity, -0.1]_dac [-infinity, 0.3]_dac = [-0X1.8P+1, infinity]_dac [empty]_trv; mulRevToPair [-infinity, 0.0]_dac [-infinity, 0.3]_dac = [entire]_trv [empty]_trv; mulRevToPair [-infinity, 1.1]_dac [-infinity, 0.3]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, infinity]_dac [-infinity, 0.3]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.0, infinity]_dac [-infinity, 0.3]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.01, infinity]_dac [-infinity, 0.3]_dac = [-infinity, 0X1.EP+4]_dac [empty]_trv; mulRevToPair [entire]_dac [-infinity, 0.3]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, -0.1]_dac [-0.21, infinity]_dac = [-infinity , 0X1.0CCCCCCCCCCCDP+1]_dac [empty]_trv; mulRevToPair [-2.0, 0.0]_dac [-0.21, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, 1.1]_dac [-0.21, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.0, 1.1]_dac [-0.21, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.01, 1.1]_dac [-0.21, infinity]_dac = [-0X1.5P+4, infinity]_dac [empty]_trv; mulRevToPair [0.0, 0.0]_dac [-0.21, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [-infinity, -0.1]_dac [-0.21, infinity]_dac = [-infinity, 0X1.0CCCCCCCCCCCDP+1]_dac [empty]_trv; mulRevToPair [-infinity, 0.0]_dac [-0.21, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [-infinity, 1.1]_dac [-0.21, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, infinity]_dac [-0.21, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.0, infinity]_dac [-0.21, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.01, infinity]_dac [-0.21, infinity]_dac = [-0X1.5P+4, infinity]_dac [empty]_trv; mulRevToPair [entire]_dac [-0.21, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, -0.1]_dac [0.0, infinity]_dac = [-infinity, 0.0]_dac [empty]_trv; mulRevToPair [-2.0, 0.0]_dac [0.0, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, 1.1]_dac [0.0, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.0, 1.1]_dac [0.0, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.01, 1.1]_dac [0.0, infinity]_dac = [0.0, infinity]_dac [empty]_trv; mulRevToPair [0.0, 0.0]_dac [0.0, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [-infinity, -0.1]_dac [0.0, infinity]_dac = [-infinity, 0.0]_dac [empty]_trv; mulRevToPair [-infinity, 0.0]_dac [0.0, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [-infinity, 1.1]_dac [0.0, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, infinity]_dac [0.0, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.0, infinity]_dac [0.0, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.01, infinity]_dac [0.0, infinity]_dac = [0.0, infinity]_dac [empty]_trv; mulRevToPair [entire]_dac [0.0, infinity]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, -0.1]_dac [0.04, infinity]_dac = [-infinity, -0X1.47AE147AE147BP-6]_dac [empty]_trv; mulRevToPair [-2.0, 0.0]_dac [0.04, infinity]_dac = [-infinity, -0X1.47AE147AE147BP-6]_trv [empty]_trv; mulRevToPair [-2.0, 1.1]_dac [0.04, infinity]_dac = [-infinity, -0X1.47AE147AE147BP-6]_trv [0X1.29E4129E4129DP-5, infinity]_trv; mulRevToPair [0.0, 1.1]_dac [0.04, infinity]_dac = [0X1.29E4129E4129DP-5, infinity]_trv [empty]_trv; mulRevToPair [0.01, 1.1]_dac [0.04, infinity]_dac = [0X1.29E4129E4129DP-5, infinity]_dac [empty]_trv; mulRevToPair [0.0, 0.0]_dac [0.04, infinity]_dac = [empty]_trv [empty]_trv; mulRevToPair [-infinity, -0.1]_dac [0.04, infinity]_dac = [-infinity, 0.0]_dac [empty]_trv; mulRevToPair [-infinity, 0.0]_dac [0.04, infinity]_dac = [-infinity, 0.0]_trv [empty]_trv; mulRevToPair [-infinity, 1.1]_dac [0.04, infinity]_dac = [-infinity, 0.0]_trv [0X1.29E4129E4129DP-5, infinity]_trv; mulRevToPair [-2.0, infinity]_dac [0.04, infinity]_dac = [-infinity, -0X1.47AE147AE147BP-6]_trv [0.0, infinity]_trv; mulRevToPair [0.0, infinity]_dac [0.04, infinity]_dac = [0.0, infinity]_trv [empty]_trv; mulRevToPair [0.01, infinity]_dac [0.04, infinity]_dac = [0.0, infinity]_dac [empty]_trv; mulRevToPair [entire]_dac [0.04, infinity]_dac = [-infinity, 0.0]_trv [0.0, infinity]_trv; mulRevToPair [-2.0, -0.1]_dac [entire]_dac = [entire]_dac [empty]_trv; mulRevToPair [-2.0, 0.0]_dac [entire]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, 1.1]_dac [entire]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.0, 1.1]_dac [entire]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.01, 1.1]_dac [entire]_dac = [entire]_dac [empty]_trv; mulRevToPair [0.0, 0.0]_dac [entire]_dac = [entire]_trv [empty]_trv; mulRevToPair [-infinity, -0.1]_dac [entire]_dac = [entire]_dac [empty]_trv; mulRevToPair [-infinity, 0.0]_dac [entire]_dac = [entire]_trv [empty]_trv; mulRevToPair [-infinity, 1.1]_dac [entire]_dac = [entire]_trv [empty]_trv; mulRevToPair [-2.0, infinity]_dac [entire]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.0, infinity]_dac [entire]_dac = [entire]_trv [empty]_trv; mulRevToPair [0.01, infinity]_dac [entire]_dac = [entire]_dac [empty]_trv; mulRevToPair [entire]_dac [entire]_dac = [entire]_trv [empty]_trv; } interval-2.1.0/test/libieeep1788_tests_num.itl0000644000000000000000000001304613031036767017376 0ustar 00000000000000/* Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) Copyright 2015-2016 Oliver Heimlich Original author: Marco Nehmeier (unit tests in libieeep1788, original license: Apache License 2.0) Converted into portable ITL format by Oliver Heimlich with minor corrections. 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 . */ testcase minimal_inf_test { inf [empty] = +infinity; inf [-infinity,+infinity] = -infinity; inf [1.0,2.0] = 1.0; inf [-3.0,-2.0] = -3.0; inf [-infinity,2.0] = -infinity; inf [-infinity,0.0] = -infinity; inf [-infinity,-0.0] = -infinity; inf [-2.0,infinity] = -2.0; inf [0.0,infinity] = -0.0; inf [-0.0,infinity] = -0.0; inf [-0.0,0.0] = -0.0; inf [0.0,-0.0] = -0.0; inf [0.0,0.0] = -0.0; inf [-0.0,-0.0] = -0.0; } testcase minimal_inf_dec_test { inf [empty]_trv = +infinity; inf [-infinity,+infinity]_def = -infinity; inf [1.0,2.0]_com = 1.0; inf [-3.0,-2.0]_trv = -3.0; inf [-infinity,2.0]_dac = -infinity; inf [-infinity,0.0]_def = -infinity; inf [-infinity,-0.0]_trv = -infinity; inf [-2.0,infinity]_trv = -2.0; inf [0.0,infinity]_def = -0.0; inf [-0.0,infinity]_trv = -0.0; inf [-0.0,0.0]_dac = -0.0; inf [0.0,-0.0]_trv = -0.0; inf [0.0,0.0]_trv = -0.0; inf [-0.0,-0.0]_trv = -0.0; } testcase minimal_sup_test { sup [empty] = -infinity; sup [-infinity,+infinity] = +infinity; sup [1.0,2.0] = 2.0; sup [-3.0,-2.0] = -2.0; sup [-infinity,2.0] = 2.0; sup [-infinity,0.0] = 0.0; sup [-infinity,-0.0] = 0.0; sup [-2.0,infinity] = infinity; sup [0.0,infinity] = infinity; sup [-0.0,infinity] = infinity; sup [-0.0,0.0] = 0.0; sup [0.0,-0.0] = 0.0; sup [0.0,0.0] = 0.0; sup [-0.0,-0.0] = 0.0; } testcase minimal_sup_dec_test { sup [empty]_trv = -infinity; sup [-infinity,+infinity]_def = +infinity; sup [1.0,2.0]_com = 2.0; sup [-3.0,-2.0]_trv = -2.0; sup [-infinity,2.0]_dac = 2.0; sup [-infinity,0.0]_def = 0.0; sup [-infinity,-0.0]_trv = 0.0; sup [-2.0,infinity]_trv = infinity; sup [0.0,infinity]_def = infinity; sup [-0.0,infinity]_trv = infinity; sup [-0.0,0.0]_dac = +0.0; sup [0.0,-0.0]_trv = +0.0; sup [0.0,0.0]_trv = +0.0; sup [-0.0,-0.0]_trv = +0.0; } testcase minimal_mid_test { mid [-infinity,+infinity] = 0.0; mid [-0x1.FFFFFFFFFFFFFp1023,+0x1.FFFFFFFFFFFFFp1023] = 0.0; mid [0.0,2.0] = 1.0; mid [2.0,2.0] = 2.0; mid [-2.0,2.0] = 0.0; mid [-0X0.0000000000002P-1022,0X0.0000000000001P-1022] = 0.0; mid [-0X0.0000000000001P-1022,0X0.0000000000002P-1022] = 0.0; } testcase minimal_mid_dec_test { mid [-infinity,+infinity]_def = 0.0; mid [-0x1.FFFFFFFFFFFFFp1023,+0x1.FFFFFFFFFFFFFp1023]_trv = 0.0; mid [0.0,2.0]_com = 1.0; mid [2.0,2.0]_dac = 2.0; mid [-2.0,2.0]_trv = 0.0; mid [-0X0.0000000000002P-1022,0X0.0000000000001P-1022]_trv = 0.0; mid [-0X0.0000000000001P-1022,0X0.0000000000002P-1022]_trv = 0.0; } testcase minimal_rad_test { rad [0.0,2.0] = 1.0; rad [2.0,2.0] = 0.0; rad [-infinity,+infinity] = infinity; rad [0.0,infinity] = infinity; rad [-infinity, 1.2] = infinity; } testcase minimal_rad_dec_test { rad [0.0,2.0]_trv = 1.0; rad [2.0,2.0]_com = 0.0; rad [-infinity,+infinity]_trv = infinity; rad [0.0,infinity]_def = infinity; rad [-infinity, 1.2]_trv = infinity; } testcase minimal_wid_test { wid [2.0,2.0] = 0.0; wid [1.0,2.0] = 1.0; wid [1.0,infinity] = infinity; wid [-infinity,2.0] = infinity; wid [-infinity,+infinity] = infinity; } testcase minimal_wid_dec_test { wid [2.0,2.0]_com = 0.0; wid [1.0,2.0]_trv = 1.0; wid [1.0,infinity]_trv = infinity; wid [-infinity,2.0]_def = infinity; wid [-infinity,+infinity]_trv = infinity; } testcase minimal_mag_test { mag [1.0,2.0] = 2.0; mag [-4.0,2.0] = 4.0; mag [-infinity,2.0] = infinity; mag [1.0,infinity] = infinity; mag [-infinity,+infinity] = infinity; mag [-0.0,0.0] = 0.0; mag [-0.0,-0.0] = 0.0; } testcase minimal_mag_dec_test { mag [1.0,2.0]_com = 2.0; mag [-4.0,2.0]_trv = 4.0; mag [-infinity,2.0]_trv = infinity; mag [1.0,infinity]_def = infinity; mag [-infinity,+infinity]_trv = infinity; mag [-0.0,0.0]_trv = 0.0; mag [-0.0,-0.0]_trv = 0.0; } testcase minimal_mig_test { mig [1.0,2.0] = 1.0; mig [-4.0,2.0] = 0.0; mig [-4.0,-2.0] = 2.0; mig [-infinity,2.0] = 0.0; mig [-infinity,-2.0] = 2.0; mig [-1.0,infinity] = 0.0; mig [1.0,infinity] = 1.0; mig [-infinity,+infinity] = 0.0; mig [-0.0,0.0] = 0.0; mig [-0.0,-0.0] = 0.0; } testcase minimal_mig_dec_test { mig [1.0,2.0]_com = 1.0; mig [-4.0,2.0]_trv = 0.0; mig [-4.0,-2.0]_trv = 2.0; mig [-infinity,2.0]_def = 0.0; mig [-infinity,-2.0]_trv = 2.0; mig [-1.0,infinity]_trv = 0.0; mig [1.0,infinity]_trv = 1.0; mig [-infinity,+infinity]_trv = 0.0; mig [-0.0,0.0]_trv = 0.0; mig [-0.0,-0.0]_trv = 0.0; } interval-2.1.0/test/libieeep1788_tests_overlap.itl0000644000000000000000000001112413031036767020242 0ustar 00000000000000/* Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) Copyright 2015-2016 Oliver Heimlich Original author: Marco Nehmeier (unit tests in libieeep1788, original license: Apache License 2.0) Converted into portable ITL format by Oliver Heimlich with minor corrections. 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 . */ testcase minimal_overlap_test { overlap [empty] [empty] = bothEmpty; overlap [empty] [1.0,2.0] = firstEmpty; overlap [1.0,2.0] [empty] = secondEmpty; overlap [-infinity,2.0] [3.0,infinity] = before; overlap [-infinity,2.0] [3.0,4.0] = before; overlap [2.0,2.0] [3.0,4.0] = before; overlap [1.0,2.0] [3.0,4.0] = before; overlap [1.0,2.0] [3.0,3.0] = before; overlap [2.0,2.0] [3.0,3.0] = before; overlap [2.0,2.0] [3.0,infinity] = before; overlap [-infinity,2.0] [2.0,3.0] = meets; overlap [1.0,2.0] [2.0,3.0] = meets; overlap [1.0,2.0] [2.0,infinity] = meets; overlap [1.0,2.0] [1.5,2.5] = overlaps; overlap [1.0,2.0] [1.0,infinity] = starts; overlap [1.0,2.0] [1.0,3.0] = starts; overlap [1.0,1.0] [1.0,3.0] = starts; overlap [1.0,2.0] [entire] = containedBy; overlap [1.0,2.0] [-infinity,3.0] = containedBy; overlap [1.0,2.0] [0.0,3.0] = containedBy; overlap [2.0,2.0] [0.0,3.0] = containedBy; overlap [2.0,2.0] [0.0,infinity] = containedBy; overlap [1.0,2.0] [-infinity,2.0] = finishes; overlap [1.0,2.0] [0.0,2.0] = finishes; overlap [2.0,2.0] [0.0,2.0] = finishes; overlap [1.0,2.0] [1.0,2.0] = equals; overlap [1.0,1.0] [1.0,1.0] = equals; overlap [-infinity,1.0] [-infinity,1.0] = equals; overlap [entire] [entire] = equals; overlap [3.0,4.0] [2.0,2.0] = after; overlap [3.0,4.0] [1.0,2.0] = after; overlap [3.0,3.0] [1.0,2.0] = after; overlap [3.0,3.0] [2.0,2.0] = after; overlap [3.0,infinity] [2.0,2.0] = after; overlap [2.0,3.0] [1.0,2.0] = metBy; overlap [2.0,3.0] [-infinity,2.0] = metBy; overlap [1.5,2.5] [1.0,2.0] = overlappedBy; overlap [1.5,2.5] [-infinity,2.0] = overlappedBy; overlap [1.0,infinity] [1.0,2.0] = startedBy; overlap [1.0,3.0] [1.0,2.0] = startedBy; overlap [1.0,3.0] [1.0,1.0] = startedBy; overlap [-infinity,3.0] [1.0,2.0] = contains; overlap [entire] [1.0,2.0] = contains; overlap [0.0,3.0] [1.0,2.0] = contains; overlap [0.0,3.0] [2.0,2.0] = contains; overlap [-infinity,2.0] [1.0,2.0] = finishedBy; overlap [0.0,2.0] [1.0,2.0] = finishedBy; overlap [0.0,2.0] [2.0,2.0] = finishedBy; } testcase minimal_overlap_dec_test { overlap [empty]_trv [empty]_trv = bothEmpty; overlap [empty]_trv [1.0,2.0]_com = firstEmpty; overlap [1.0,2.0]_def [empty]_trv = secondEmpty; overlap [2.0,2.0]_def [3.0,4.0]_def = before; overlap [1.0,2.0]_dac [3.0,4.0]_com = before; overlap [1.0,2.0]_com [3.0,3.0]_trv = before; overlap [2.0,2.0]_trv [3.0,3.0]_def = before; overlap [1.0,2.0]_def [2.0,3.0]_def = meets; overlap [1.0,2.0]_dac [1.5,2.5]_def = overlaps; overlap [1.0,2.0]_def [1.0,3.0]_com = starts; overlap [1.0,1.0]_trv [1.0,3.0]_def = starts; overlap [1.0,2.0]_def [0.0,3.0]_dac = containedBy; overlap [2.0,2.0]_trv [0.0,3.0]_def = containedBy; overlap [1.0,2.0]_trv [0.0,2.0]_com = finishes; overlap [2.0,2.0]_def [0.0,2.0]_dac = finishes; overlap [1.0,2.0]_def [1.0,2.0]_def = equals; overlap [1.0,1.0]_dac [1.0,1.0]_dac = equals; overlap [3.0,4.0]_trv [2.0,2.0]_trv = after; overlap [3.0,4.0]_def [1.0,2.0]_def = after; overlap [3.0,3.0]_com [1.0,2.0]_dac = after; overlap [3.0,3.0]_def [2.0,2.0]_trv = after; overlap [2.0,3.0]_def [1.0,2.0]_trv = metBy; overlap [1.5,2.5]_com [1.0,2.0]_com = overlappedBy; overlap [1.0,3.0]_dac [1.0,2.0]_def = startedBy; overlap [1.0,3.0]_com [1.0,1.0]_dac = startedBy; overlap [0.0,3.0]_com [1.0,2.0]_dac = contains; overlap [0.0,3.0]_com [2.0,2.0]_def = contains; overlap [0.0,2.0]_def [1.0,2.0]_trv = finishedBy; overlap [0.0,2.0]_dac [2.0,2.0]_def = finishedBy; } interval-2.1.0/test/libieeep1788_tests_rec_bool.itl0000644000000000000000000001446513031036767020371 0ustar 00000000000000/* Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) Copyright 2015-2016 Oliver Heimlich Original author: Marco Nehmeier (unit tests in libieeep1788, original license: Apache License 2.0) Converted into portable ITL format by Oliver Heimlich with minor corrections. 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 . */ testcase minimal_isCommonInterval_test { isCommonInterval [-27.0,-27.0] = true; isCommonInterval [-27.0, 0.0] = true; isCommonInterval [0.0,0.0] = true; isCommonInterval [-0.0,-0.0] = true; isCommonInterval [-0.0,0.0] = true; isCommonInterval [0.0,-0.0] = true; isCommonInterval [5.0, 12.4] = true; isCommonInterval [-0x1.FFFFFFFFFFFFFp1023, 0x1.FFFFFFFFFFFFFp1023] = true; isCommonInterval [entire] = false; isCommonInterval [empty] = false; isCommonInterval [-infinity, 0.0] = false; isCommonInterval [0.0, infinity] = false; } testcase minimal_isCommonInterval_dec_test { isCommonInterval [-27.0,-27.0]_com = true; isCommonInterval [-27.0, 0.0]_com = true; isCommonInterval [0.0,0.0]_com = true; isCommonInterval [-0.0,-0.0]_com = true; isCommonInterval [-0.0,0.0]_com = true; isCommonInterval [0.0,-0.0]_com = true; isCommonInterval [5.0, 12.4]_com = true; isCommonInterval [-0x1.FFFFFFFFFFFFFp1023, 0x1.FFFFFFFFFFFFFp1023]_com = true; isCommonInterval [-27.0,-27.0]_trv = true; isCommonInterval [-27.0, 0.0]_def = true; isCommonInterval [0.0,0.0]_dac = true; isCommonInterval [-0.0,-0.0]_trv = true; isCommonInterval [-0.0,0.0]_def = true; isCommonInterval [0.0,-0.0]_dac = true; isCommonInterval [5.0, 12.4]_def = true; isCommonInterval [-0x1.FFFFFFFFFFFFFp1023, 0x1.FFFFFFFFFFFFFp1023]_trv = true; isCommonInterval [entire]_dac = false; isCommonInterval [empty]_trv = false; isCommonInterval [empty]_trv = false; isCommonInterval [-infinity, 0.0]_trv = false; isCommonInterval [0.0, infinity]_def = false; } testcase minimal_isSingleton_test { isSingleton [-27.0,-27.0] = true; isSingleton [-2.0, -2.0] = true; isSingleton [12.0,12.0] = true; isSingleton [17.1, 17.1] = true; isSingleton [-0.0,-0.0] = true; isSingleton [0.0,0.0] = true; isSingleton [-0.0, 0.0] = true; isSingleton [0.0, -0.0] = true; isSingleton [empty] = false; isSingleton [entire] = false; isSingleton [-1.0, 0.0] = false; isSingleton [-1.0, -0.5] = false; isSingleton [1.0, 2.0] = false; isSingleton [-infinity,-0x1.FFFFFFFFFFFFFp1023] = false; isSingleton [-1.0,infinity] = false; } testcase minimal_isSingleton_dec_test { isSingleton [-27.0,-27.0]_def = true; isSingleton [-2.0, -2.0]_trv = true; isSingleton [12.0,12.0]_dac = true; isSingleton [17.1, 17.1]_com = true; isSingleton [-0.0,-0.0]_def = true; isSingleton [0.0,0.0]_com = true; isSingleton [-0.0, 0.0]_def = true; isSingleton [0.0, -0.0]_dac = true; isSingleton [empty]_trv = false; isSingleton [empty]_trv = false; isSingleton [entire]_def = false; isSingleton [-1.0, 0.0]_dac = false; isSingleton [-1.0, -0.5]_com = false; isSingleton [1.0, 2.0]_def = false; isSingleton [-infinity,-0x1.FFFFFFFFFFFFFp1023]_dac = false; isSingleton [-1.0,infinity]_trv = false; } testcase minimal_isMember_test { isMember -27.0 [-27.0,-27.0] = true; isMember -27.0 [-27.0, 0.0] = true; isMember -7.0 [-27.0, 0.0] = true; isMember 0.0 [-27.0, 0.0] = true; isMember -0.0 [0.0,0.0] = true; isMember 0.0 [0.0,0.0] = true; isMember 0.0 [-0.0,-0.0] = true; isMember 0.0 [-0.0,0.0] = true; isMember 0.0 [0.0,-0.0] = true; isMember 5.0 [5.0, 12.4] = true; isMember 6.3 [5.0, 12.4] = true; isMember 12.4 [5.0, 12.4] = true; isMember 0.0 [entire] = true; isMember 5.0 [entire] = true; isMember 6.3 [entire] = true; isMember 12.4 [entire] = true; isMember -71.0 [-27.0, 0.0] = false; isMember 0.1 [-27.0, 0.0] = false; isMember -0.01 [0.0,0.0] = false; isMember 0.000001 [0.0,0.0] = false; isMember 111110.0 [-0.0,-0.0] = false; isMember 4.9 [5.0, 12.4] = false; isMember -6.3 [5.0, 12.4] = false; isMember 0.0 [empty] = false; isMember -4535.3 [empty] = false; isMember -infinity [empty] = false; isMember infinity [empty] = false; isMember -infinity [entire] = false; isMember infinity [entire] = false; } testcase minimal_isMember_dec_test { isMember -27.0 [-27.0,-27.0]_trv = true; isMember -27.0 [-27.0, 0.0]_def = true; isMember -7.0 [-27.0, 0.0]_dac = true; isMember 0.0 [-27.0, 0.0]_com = true; isMember -0.0 [0.0,0.0]_trv = true; isMember 0.0 [0.0,0.0]_def = true; isMember 0.0 [-0.0,-0.0]_dac = true; isMember 0.0 [-0.0,0.0]_com = true; isMember 0.0 [0.0,-0.0]_trv = true; isMember 5.0 [5.0, 12.4]_def = true; isMember 6.3 [5.0, 12.4]_dac = true; isMember 12.4 [5.0, 12.4]_com = true; isMember 0.0 [entire]_trv = true; isMember 5.0 [entire]_def = true; isMember 6.3 [entire]_dac = true; isMember 12.4 [entire]_trv = true; isMember -71.0 [-27.0, 0.0]_trv = false; isMember 0.1 [-27.0, 0.0]_def = false; isMember -0.01 [0.0,0.0]_dac = false; isMember 0.000001 [0.0,0.0]_com = false; isMember 111110.0 [-0.0,-0.0]_trv = false; isMember 4.9 [5.0, 12.4]_def = false; isMember -6.3 [5.0, 12.4]_dac = false; isMember 0.0 [empty]_trv = false; isMember 0.0 [empty]_trv = false; isMember -4535.3 [empty]_trv = false; isMember -4535.3 [empty]_trv = false; isMember -infinity [empty]_trv = false; isMember -infinity [empty]_trv = false; isMember infinity [empty]_trv = false; isMember infinity [empty]_trv = false; isMember -infinity [entire]_trv = false; isMember infinity [entire]_def = false; } interval-2.1.0/test/libieeep1788_tests_rev.itl0000644000000000000000000015334113031036767017376 0ustar 00000000000000/* Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) Copyright 2015-2016 Oliver Heimlich Original author: Marco Nehmeier (unit tests in libieeep1788, original license: Apache License 2.0) Converted into portable ITL format by Oliver Heimlich with minor corrections. 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 . */ testcase minimal_sqrRev_test { sqrRev [empty] = [empty]; sqrRev [-10.0,-1.0] = [empty]; sqrRev [0.0,infinity] = [entire]; sqrRev [0.0,1.0] = [-1.0,1.0]; sqrRev [-0.5,1.0] = [-1.0,1.0]; sqrRev [-1000.0,1.0] = [-1.0,1.0]; sqrRev [0.0,25.0] = [-5.0,5.0]; sqrRev [-1.0,25.0] = [-5.0,5.0]; sqrRev [0X1.47AE147AE147BP-7,0X1.47AE147AE147CP-7] = [-0X1.999999999999BP-4,0X1.999999999999BP-4]; sqrRev [0.0,0X1.FFFFFFFFFFFE1P+1] = [-0x1.ffffffffffff1p+0,0x1.ffffffffffff1p+0]; } testcase minimal_sqrRevBin_test { sqrRevBin [empty] [-5.0,1.0] = [empty]; sqrRevBin [-10.0,-1.0] [-5.0,1.0] = [empty]; sqrRevBin [0.0,infinity] [-5.0,1.0] = [-5.0,1.0]; sqrRevBin [0.0,1.0] [-0.1,1.0] = [-0.1,1.0]; sqrRevBin [-0.5,1.0] [-0.1,1.0] = [-0.1,1.0]; sqrRevBin [-1000.0,1.0] [-0.1,1.0] = [-0.1,1.0]; sqrRevBin [0.0,25.0] [-4.1,6.0] = [-4.1,5.0]; sqrRevBin [-1.0,25.0] [-4.1,7.0] = [-4.1,5.0]; sqrRevBin [1.0,25.0] [0.0,7.0] = [1.0,5.0]; sqrRevBin [0X1.47AE147AE147BP-7,0X1.47AE147AE147CP-7] [-0.1,infinity] = [-0.1,0X1.999999999999BP-4]; sqrRevBin [0.0,0X1.FFFFFFFFFFFE1P+1] [-0.1,infinity] = [-0.1,0x1.ffffffffffff1p+0]; } testcase minimal_sqrRev_dec_test { sqrRev [empty]_trv = [empty]_trv; sqrRev [-10.0,-1.0]_com = [empty]_trv; sqrRev [0.0,infinity]_dac = [entire]_trv; sqrRev [0.0,1.0]_def = [-1.0,1.0]_trv; sqrRev [-0.5,1.0]_dac = [-1.0,1.0]_trv; sqrRev [-1000.0,1.0]_com = [-1.0,1.0]_trv; sqrRev [0.0,25.0]_def = [-5.0,5.0]_trv; sqrRev [-1.0,25.0]_dac = [-5.0,5.0]_trv; sqrRev [0X1.47AE147AE147BP-7,0X1.47AE147AE147CP-7]_com = [-0X1.999999999999BP-4,0X1.999999999999BP-4]_trv; sqrRev [0.0,0X1.FFFFFFFFFFFE1P+1]_def = [-0x1.ffffffffffff1p+0,0x1.ffffffffffff1p+0]_trv; } testcase minimal_sqrRev_dec_bin_test { sqrRevBin [empty]_trv [-5.0,1.0]_def = [empty]_trv; sqrRevBin [-10.0,-1.0]_com [-5.0,1.0]_dac = [empty]_trv; sqrRevBin [0.0,infinity]_def [-5.0,1.0]_dac = [-5.0,1.0]_trv; sqrRevBin [0.0,1.0]_dac [-0.1,1.0]_def = [-0.1,1.0]_trv; sqrRevBin [-0.5,1.0]_def [-0.1,1.0]_dac = [-0.1,1.0]_trv; sqrRevBin [-1000.0,1.0]_com [-0.1,1.0]_def = [-0.1,1.0]_trv; sqrRevBin [0.0,25.0]_def [-4.1,6.0]_com = [-4.1,5.0]_trv; sqrRevBin [-1.0,25.0]_dac [-4.1,7.0]_def = [-4.1,5.0]_trv; sqrRevBin [1.0,25.0]_dac [0.0,7.0]_def = [1.0,5.0]_trv; sqrRevBin [0X1.47AE147AE147BP-7,0X1.47AE147AE147CP-7]_def [-0.1,infinity]_dac = [-0.1,0X1.999999999999BP-4]_trv; sqrRevBin [0.0,0X1.FFFFFFFFFFFE1P+1]_dac [-0.1,infinity]_dac = [-0.1,0x1.ffffffffffff1p+0]_trv; } testcase minimal_absRev_test { absRev [empty] = [empty]; absRev [-1.1,-0.4] = [empty]; absRev [0.0,infinity] = [entire]; absRev [1.1,2.1] = [-2.1,2.1]; absRev [-1.1,2.0] = [-2.0,2.0]; absRev [-1.1,0.0] = [0.0,0.0]; absRev [-1.9,0.2] = [-0.2,0.2]; absRev [0.0,0.2] = [-0.2,0.2]; absRev [-1.5,infinity] = [entire]; } testcase minimal_absRevBin_test { absRevBin [empty] [-1.1,5.0] = [empty]; absRevBin [-1.1,-0.4] [-1.1,5.0] = [empty]; absRevBin [0.0,infinity] [-1.1,5.0] = [-1.1,5.0]; absRevBin [1.1,2.1] [-1.0,5.0] = [1.1,2.1]; absRevBin [-1.1,2.0] [-1.1,5.0] = [-1.1,2.0]; absRevBin [-1.1,0.0] [-1.1,5.0] = [0.0,0.0]; absRevBin [-1.9,0.2] [-1.1,5.0] = [-0.2,0.2]; } testcase minimal_absRev_dec_test { absRev [empty]_trv = [empty]_trv; absRev [-1.1,-0.4]_dac = [empty]_trv; absRev [0.0,infinity]_dac = [entire]_trv; absRev [1.1,2.1]_com = [-2.1,2.1]_trv; absRev [-1.1,2.0]_def = [-2.0,2.0]_trv; absRev [-1.1,0.0]_dac = [0.0,0.0]_trv; absRev [-1.9,0.2]_com = [-0.2,0.2]_trv; absRev [0.0,0.2]_def = [-0.2,0.2]_trv; absRev [-1.5,infinity]_def = [entire]_trv; } testcase minimal_absRev_dec_bin_test { absRevBin [empty]_trv [-1.1,5.0]_com = [empty]_trv; absRevBin [-1.1,-0.4]_dac [-1.1,5.0]_dac = [empty]_trv; absRevBin [0.0,infinity]_def [-1.1,5.0]_def = [-1.1,5.0]_trv; absRevBin [1.1,2.1]_dac [-1.0,5.0]_def = [1.1,2.1]_trv; absRevBin [-1.1,2.0]_com [-1.1,5.0]_def = [-1.1,2.0]_trv; absRevBin [-1.1,0.0]_def [-1.1,5.0]_def = [0.0,0.0]_trv; absRevBin [-1.9,0.2]_dac [-1.1,5.0]_def = [-0.2,0.2]_trv; } testcase minimal_pownRev_test { pownRev [empty] 0 = [empty]; pownRev [1.0,1.0] 0 = [entire]; pownRev [-1.0,5.0] 0 = [entire]; pownRev [-1.0,0.0] 0 = [empty]; pownRev [-1.0,-0.0] 0 = [empty]; pownRev [1.1,10.0] 0 = [empty]; pownRev [empty] 1 = [empty]; pownRev [entire] 1 = [entire]; pownRev [0.0,0.0] 1 = [0.0,0.0]; pownRev [-0.0,-0.0] 1 = [0.0,0.0]; pownRev [13.1,13.1] 1 = [13.1,13.1]; pownRev [-7451.145,-7451.145] 1 = [-7451.145,-7451.145]; pownRev [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] 1 = [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]; pownRev [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] 1 = [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023]; pownRev [0.0,infinity] 1 = [0.0,infinity]; pownRev [-0.0,infinity] 1 = [0.0,infinity]; pownRev [-infinity,0.0] 1 = [-infinity,0.0]; pownRev [-infinity,-0.0] 1 = [-infinity,0.0]; pownRev [-324.3,2.5] 1 = [-324.3,2.5]; pownRev [0.01,2.33] 1 = [0.01,2.33]; pownRev [-1.9,-0.33] 1 = [-1.9,-0.33]; pownRev [empty] 2 = [empty]; pownRev [-5.0,-1.0] 2 = [empty]; pownRev [0.0,infinity] 2 = [entire]; pownRev [-0.0,infinity] 2 = [entire]; pownRev [0.0,0.0] 2 = [0.0,0.0]; pownRev [-0.0,-0.0] 2 = [0.0,0.0]; pownRev [0X1.573851EB851EBP+7,0X1.573851EB851ECP+7] 2 = [-0x1.a333333333334p+3,0x1.a333333333334p+3]; pownRev [0X1.A794A4E7CFAADP+25,0X1.A794A4E7CFAAEP+25] 2 = [-0x1.d1b251eb851edp+12,0x1.d1b251eb851edp+12]; pownRev [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] 2 = [-0x1p+512,0x1p+512]; pownRev [0.0,0X1.9AD27D70A3D72P+16] 2 = [-0x1.444cccccccccep+8,0x1.444cccccccccep+8]; pownRev [-0.0,0X1.9AD27D70A3D72P+16] 2 = [-0x1.444cccccccccep+8,0x1.444cccccccccep+8]; pownRev [0X1.A36E2EB1C432CP-14,0X1.5B7318FC50482P+2] 2 = [-0x1.2a3d70a3d70a5p+1,0x1.2a3d70a3d70a5p+1]; pownRev [0X1.BE0DED288CE7P-4,0X1.CE147AE147AE1P+1] 2 = [-0x1.e666666666667p+0,0x1.e666666666667p+0]; pownRev [empty] 8 = [empty]; pownRev [entire] 8 = [entire]; pownRev [0.0,infinity] 8 = [entire]; pownRev [-0.0,infinity] 8 = [entire]; pownRev [0.0,0.0] 8 = [0.0,0.0]; pownRev [-0.0,-0.0] 8 = [0.0,0.0]; pownRev [0X1.9D8FD495853F5P+29,0X1.9D8FD495853F6P+29] 8 = [-0x1.a333333333334p+3,0x1.a333333333334p+3]; pownRev [0X1.DFB1BB622E70DP+102,0X1.DFB1BB622E70EP+102] 8 = [-0x1.d1b251eb851edp+12,0x1.d1b251eb851edp+12]; pownRev [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] 8 = [-0x1p+128,0x1p+128]; pownRev [0.0,0X1.A87587109655P+66] 8 = [-0x1.444cccccccccep+8,0x1.444cccccccccep+8]; pownRev [-0.0,0X1.A87587109655P+66] 8 = [-0x1.444cccccccccep+8,0x1.444cccccccccep+8]; pownRev [0X1.CD2B297D889BDP-54,0X1.B253D9F33CE4DP+9] 8 = [-0x1.2a3d70a3d70a5p+1,0x1.2a3d70a3d70a5p+1]; pownRev [0X1.26F1FCDD502A3P-13,0X1.53ABD7BFC4FC6P+7] 8 = [-0x1.e666666666667p+0,0x1.e666666666667p+0]; pownRev [empty] 3 = [empty]; pownRev [entire] 3 = [entire]; pownRev [0.0,0.0] 3 = [0.0,0.0]; pownRev [-0.0,-0.0] 3 = [0.0,0.0]; pownRev [0X1.1902E978D4FDEP+11,0X1.1902E978D4FDFP+11] 3 = [0x1.a333333333332p+3,0x1.a333333333334p+3]; pownRev [-0X1.81460637B9A3DP+38,-0X1.81460637B9A3CP+38] 3 = [-0x1.d1b251eb851edp+12,-0x1.d1b251eb851ebp+12]; pownRev [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] 3 = [0x1.428a2f98d728ap+341,0x1.428a2f98d728bp+341]; pownRev [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] 3 = [-0x1.428a2f98d728bp+341, -0x1.428a2f98d728ap+341]; pownRev [0.0,infinity] 3 = [0.0,infinity]; pownRev [-0.0,infinity] 3 = [0.0,infinity]; pownRev [-infinity,0.0] 3 = [-infinity,0.0]; pownRev [-infinity,-0.0] 3 = [-infinity,0.0]; pownRev [-0X1.0436D2F418938P+25,0X1.F4P+3] 3 = [-0x1.444cccccccccep+8,0x1.4p+1]; pownRev [0X1.0C6F7A0B5ED8DP-20,0X1.94C75E6362A6P+3] 3 = [0x1.47ae147ae147ap-7,0x1.2a3d70a3d70a5p+1]; pownRev [-0X1.B6F9DB22D0E55P+2,-0X1.266559F6EC5B1P-5] 3 = [-0x1.e666666666667p+0,-0x1.51eb851eb851ep-2]; pownRev [empty] 7 = [empty]; pownRev [entire] 7 = [entire]; pownRev [0.0,0.0] 7 = [0.0,0.0]; pownRev [-0.0,-0.0] 7 = [0.0,0.0]; pownRev [0X1.F91D1B185493BP+25,0X1.F91D1B185493CP+25] 7 = [0x1.a333333333332p+3,0x1.a333333333334p+3]; pownRev [-0X1.07B1DA32F9B59P+90,-0X1.07B1DA32F9B58P+90] 7 = [-0x1.d1b251eb851edp+12,-0x1.d1b251eb851ebp+12]; pownRev [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023] 7 = [0x1.381147622f886p+146,0x1.381147622f887p+146]; pownRev [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023] 7 = [-0x1.381147622f887p+146,-0x1.381147622f886p+146]; pownRev [0.0,infinity] 7 = [0.0,infinity]; pownRev [-0.0,infinity] 7 = [0.0,infinity]; pownRev [-infinity,0.0] 7 = [-infinity,0.0]; pownRev [-infinity,-0.0] 7 = [-infinity,0.0]; pownRev [-0X1.4F109959E6D7FP+58,0X1.312DP+9] 7 = [-0x1.444cccccccccep+8,0x1.4p+1]; pownRev [0X1.6849B86A12B9BP-47,0X1.74D0373C76313P+8] 7 = [0x1.47ae147ae147ap-7,0x1.2a3d70a3d70a5p+1]; pownRev [-0X1.658C775099757P+6,-0X1.BEE30301BF47AP-12] 7 = [-0x1.e666666666667p+0,-0x1.51eb851eb851ep-2]; pownRev [empty] -2 = [empty]; pownRev [0.0,infinity] -2 = [entire]; pownRev [-0.0,infinity] -2 = [entire]; pownRev [0.0,0.0] -2 = [empty]; pownRev [-0.0,-0.0] -2 = [empty]; pownRev [-10.0,0.0] -2 = [empty]; pownRev [-10.0,-0.0] -2 = [empty]; pownRev [0X1.7DE3A077D1568P-8,0X1.7DE3A077D1569P-8] -2 = [-0x1.a333333333334p+3,0x1.a333333333334p+3]; pownRev [0X1.3570290CD6E14P-26,0X1.3570290CD6E15P-26] -2 = [-0x1.d1b251eb851edp+12,0x1.d1b251eb851edp+12]; pownRev [0X0P+0,0X0.0000000000001P-1022] -2 = [entire]; pownRev [0X1.3F0C482C977C9P-17,infinity] -2 = [-0x1.444cccccccccep+8,0x1.444cccccccccep+8]; pownRev [0X1.793D85EF38E47P-3,0X1.388P+13] -2 = [-0x1.2a3d70a3d70a5p+1,0x1.2a3d70a3d70a5p+1]; pownRev [0X1.1BA81104F6C8P-2,0X1.25D8FA1F801E1P+3] -2 = [-0x1.e666666666667p+0,0x1.e666666666667p+0]; pownRev [empty] -8 = [empty]; pownRev [0.0,infinity] -8 = [entire]; pownRev [-0.0,infinity] -8 = [entire]; pownRev [0.0,0.0] -8 = [empty]; pownRev [-0.0,-0.0] -8 = [empty]; pownRev [0X1.3CEF39247CA6DP-30,0X1.3CEF39247CA6EP-30] -8 = [-0x1.a333333333334p+3,0x1.a333333333334p+3]; pownRev [0X1.113D9EF0A99ACP-103,0X1.113D9EF0A99ADP-103] -8 = [-0x1.d1b251eb851edp+12,0x1.d1b251eb851edp+12]; pownRev [0X0P+0,0X0.0000000000001P-1022] -8 = [entire]; pownRev [0X1.34CC3764D1E0CP-67,infinity] -8 = [-0x1.444cccccccccep+8,0x1.444cccccccccep+8]; pownRev [0X1.2DC80DB11AB7CP-10,0X1.1C37937E08P+53] -8 = [-0x1.2a3d70a3d70a5p+1,0x1.2a3d70a3d70a5p+1]; pownRev [0X1.81E104E61630DP-8,0X1.BC64F21560E34P+12] -8 = [-0x1.e666666666667p+0,0x1.e666666666667p+0]; pownRev [empty] -1 = [empty]; pownRev [entire] -1 = [entire]; pownRev [0.0,0.0] -1 = [empty]; pownRev [-0.0,-0.0] -1 = [empty]; pownRev [0X1.38ABF82EE6986P-4,0X1.38ABF82EE6987P-4] -1 = [0x1.a333333333332p+3,0x1.a333333333335p+3]; pownRev [-0X1.197422C9048BFP-13,-0X1.197422C9048BEP-13] -1 = [-0x1.d1b251eb851eep+12,-0x1.d1b251eb851ebp+12]; pownRev [0X0.4P-1022,0X0.4000000000001P-1022] -1 = [0x1.ffffffffffff8p+1023,infinity]; pownRev [-0X0.4000000000001P-1022,-0X0.4P-1022] -1 = [-infinity,-0x1.ffffffffffff8p+1023]; pownRev [0.0,infinity] -1 = [0.0,infinity]; pownRev [-0.0,infinity] -1 = [0.0,infinity]; pownRev [-infinity,0.0] -1 = [-infinity,0.0]; pownRev [-infinity,-0.0] -1 = [-infinity,0.0]; pownRev [0X1.B77C278DBBE13P-2,0X1.9P+6] -1 = [0x1.47ae147ae147ap-7,0x1.2a3d70a3d70a5p+1]; pownRev [-0X1.83E0F83E0F83EP+1,-0X1.0D79435E50D79P-1] -1 = [-0x1.e666666666667p+0,-0x1.51eb851eb851ep-2]; pownRev [empty] -3 = [empty]; pownRev [entire] -3 = [entire]; pownRev [0.0,0.0] -3 = [empty]; pownRev [-0.0,-0.0] -3 = [empty]; pownRev [0X1.D26DF4D8B1831P-12,0X1.D26DF4D8B1832P-12] -3 = [0x1.a333333333332p+3,0x1.a333333333334p+3]; pownRev [-0X1.54347DED91B19P-39,-0X1.54347DED91B18P-39] -3 = [-0x1.d1b251eb851edp+12,-0x1.d1b251eb851ebp+12]; pownRev [0X0P+0,0X0.0000000000001P-1022] -3 = [0x1p+358,infinity]; pownRev [-0X0.0000000000001P-1022,-0X0P+0] -3 = [-infinity,-0x1p+358]; pownRev [0.0,infinity] -3 = [0.0,infinity]; pownRev [-0.0,infinity] -3 = [0.0,infinity]; pownRev [-infinity,0.0] -3 = [-infinity,0.0]; pownRev [-infinity,-0.0] -3 = [-infinity,0.0]; pownRev [0X1.43CFBA61AACABP-4,0X1.E848P+19] -3 = [0x1.47ae147ae147ap-7,0x1.2a3d70a3d70a5p+1]; pownRev [-0X1.BD393CE9E8E7CP+4,-0X1.2A95F6F7C066CP-3] -3 = [-0x1.e666666666667p+0,-0x1.51eb851eb851ep-2]; pownRev [empty] -7 = [empty]; pownRev [entire] -7 = [entire]; pownRev [0.0,0.0] -7 = [empty]; pownRev [-0.0,-0.0] -7 = [empty]; pownRev [0X1.037D76C912DBCP-26,0X1.037D76C912DBDP-26] -7 = [0x1.a333333333332p+3,0x1.a333333333334p+3]; pownRev [-0X1.F10F41FB8858FP-91,-0X1.F10F41FB8858EP-91] -7 = [-0x1.d1b251eb851edp+12,-0x1.d1b251eb851ebp+12]; pownRev [0X0P+0,0X0.0000000000001P-1022] -7 = [0x1.588cea3f093bcp+153,infinity]; pownRev [-0X0.0000000000001P-1022,-0X0P+0] -7 = [-infinity,-0x1.588cea3f093bcp+153]; pownRev [0.0,infinity] -7 = [0.0,infinity]; pownRev [-0.0,infinity] -7 = [0.0,infinity]; pownRev [-infinity,0.0] -7 = [-infinity,0.0]; pownRev [-infinity,-0.0] -7 = [-infinity,0.0]; pownRev [0X1.5F934D64162A9P-9,0X1.6BCC41E9P+46] -7 = [0x1.47ae147ae147ap-7,0x1.2a3d70a3d70a5p+1]; pownRev [-0X1.254CDD3711DDBP+11,-0X1.6E95C4A761E19P-7] -7 = [-0x1.e666666666667p+0,-0x1.51eb851eb851ep-2]; } testcase minimal_pownRevBin_test { pownRevBin [empty] [1.0,1.0] 0 = [empty]; pownRevBin [1.0,1.0] [1.0,1.0] 0 = [1.0,1.0]; pownRevBin [-1.0,5.0] [-51.0,12.0] 0 = [-51.0,12.0]; pownRevBin [-1.0,0.0] [5.0,10.0] 0 = [empty]; pownRevBin [-1.0,-0.0] [-1.0,1.0] 0 = [empty]; pownRevBin [1.1,10.0] [1.0,41.0] 0 = [empty]; pownRevBin [empty] [0.0,100.1] 1 = [empty]; pownRevBin [entire] [-5.1,10.0] 1 = [-5.1,10.0]; pownRevBin [0.0,0.0] [-10.0,5.1] 1 = [0.0,0.0]; pownRevBin [-0.0,-0.0] [1.0,5.0] 1 = [empty]; pownRevBin [empty] [5.0,17.1] 2 = [empty]; pownRevBin [-5.0,-1.0] [5.0,17.1] 2 = [empty]; pownRevBin [0.0,infinity] [5.6,27.544] 2 = [5.6,27.544]; pownRevBin [0.0,0.0] [1.0,2.0] 2 = [empty]; pownRevBin [0X1.A36E2EB1C432CP-14,0X1.5B7318FC50482P+2] [1.0,infinity] 2 = [1.0,0x1.2a3d70a3d70a5p+1]; pownRevBin [0X1.BE0DED288CE7P-4,0X1.CE147AE147AE1P+1] [-infinity,-1.0] 2 = [-0x1.e666666666667p+0,-1.0]; pownRevBin [empty] [-23.0,-1.0] 3 = [empty]; pownRevBin [entire] [-23.0,-1.0] 3 = [-23.0,-1.0]; pownRevBin [0.0,0.0] [1.0,2.0] 3 = [empty]; pownRevBin [0X1.0C6F7A0B5ED8DP-20,0X1.94C75E6362A6P+3] [1.0,infinity] 3 = [1.0,0x1.2a3d70a3d70a5p+1]; pownRevBin [-0X1.B6F9DB22D0E55P+2,-0X1.266559F6EC5B1P-5] [-infinity,-1.0] 3 = [-0x1.e666666666667p+0,-1.0]; pownRevBin [empty] [-3.0,17.3] -2 = [empty]; pownRevBin [0.0,infinity] [-5.1,-0.1] -2 = [-5.1,-0.1]; pownRevBin [0.0,0.0] [27.2,55.1] -2 = [empty]; pownRevBin [0X1.3F0C482C977C9P-17,infinity] [-infinity,-0x1.FFFFFFFFFFFFFp1023] -2 = [empty]; pownRevBin [0X1.793D85EF38E47P-3,0X1.388P+13] [1.0,infinity] -2 = [1.0,0x1.2a3d70a3d70a5p+1]; pownRevBin [0X1.1BA81104F6C8P-2,0X1.25D8FA1F801E1P+3] [-infinity,-1.0] -2 = [-0x1.e666666666667p+0,-1.0]; pownRevBin [empty] [-5.1,55.5] -1 = [empty]; pownRevBin [entire] [-5.1,55.5] -1 = [-5.1,55.5]; pownRevBin [0.0,0.0] [-5.1,55.5] -1 = [empty]; pownRevBin [-infinity,-0.0] [-1.0,1.0] -1 = [-1.0,0.0]; pownRevBin [0X1.B77C278DBBE13P-2,0X1.9P+6] [-1.0,0.0] -1 = [empty]; pownRevBin [empty] [-5.1,55.5] -3 = [empty]; pownRevBin [entire] [-5.1,55.5] -3 = [-5.1,55.5]; pownRevBin [0.0,0.0] [-5.1,55.5] -3 = [empty]; pownRevBin [-infinity,0.0] [5.1,55.5] -3 = [empty]; pownRevBin [-infinity,-0.0] [-32.0,1.1] -3 = [-32.0,0.0]; } testcase minimal_pownRev_dec_test { pownRev [empty]_trv 0 = [empty]_trv; pownRev [1.0,1.0]_com 0 = [entire]_trv; pownRev [-1.0,5.0]_dac 0 = [entire]_trv; pownRev [-1.0,0.0]_def 0 = [empty]_trv; pownRev [-1.0,-0.0]_dac 0 = [empty]_trv; pownRev [1.1,10.0]_com 0 = [empty]_trv; pownRev [empty]_trv 1 = [empty]_trv; pownRev [entire]_def 1 = [entire]_trv; pownRev [0.0,0.0]_com 1 = [0.0,0.0]_trv; pownRev [-0.0,-0.0]_dac 1 = [0.0,0.0]_trv; pownRev [13.1,13.1]_def 1 = [13.1,13.1]_trv; pownRev [-7451.145,-7451.145]_dac 1 = [-7451.145,-7451.145]_trv; pownRev [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com 1 = [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_trv; pownRev [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023]_com 1 = [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023]_trv; pownRev [0.0,infinity]_dac 1 = [0.0,infinity]_trv; pownRev [-0.0,infinity]_dac 1 = [0.0,infinity]_trv; pownRev [-infinity,0.0]_def 1 = [-infinity,0.0]_trv; pownRev [-infinity,-0.0]_def 1 = [-infinity,0.0]_trv; pownRev [-324.3,2.5]_dac 1 = [-324.3,2.5]_trv; pownRev [0.01,2.33]_com 1 = [0.01,2.33]_trv; pownRev [-1.9,-0.33]_def 1 = [-1.9,-0.33]_trv; pownRev [empty]_trv 2 = [empty]_trv; pownRev [0.0,infinity]_dac 2 = [entire]_trv; pownRev [-0.0,infinity]_def 2 = [entire]_trv; pownRev [0.0,0.0]_com 2 = [0.0,0.0]_trv; pownRev [-0.0,-0.0]_dac 2 = [0.0,0.0]_trv; pownRev [0X1.573851EB851EBP+7,0X1.573851EB851ECP+7]_def 2 = [-0x1.a333333333334p+3,0x1.a333333333334p+3]_trv; pownRev [0X1.A794A4E7CFAADP+25,0X1.A794A4E7CFAAEP+25]_def 2 = [-0x1.d1b251eb851edp+12,0x1.d1b251eb851edp+12]_trv; pownRev [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_dac 2 = [-0x1p+512,0x1p+512]_trv; pownRev [0.0,0X1.9AD27D70A3D72P+16]_dac 2 = [-0x1.444cccccccccep+8,0x1.444cccccccccep+8]_trv; pownRev [-0.0,0X1.9AD27D70A3D72P+16]_def 2 = [-0x1.444cccccccccep+8,0x1.444cccccccccep+8]_trv; pownRev [0X1.A36E2EB1C432CP-14,0X1.5B7318FC50482P+2]_com 2 = [-0x1.2a3d70a3d70a5p+1,0x1.2a3d70a3d70a5p+1]_trv; pownRev [0X1.BE0DED288CE7P-4,0X1.CE147AE147AE1P+1]_def 2 = [-0x1.e666666666667p+0,0x1.e666666666667p+0]_trv; pownRev [empty]_trv 8 = [empty]_trv; pownRev [entire]_def 8 = [entire]_trv; pownRev [0.0,infinity]_dac 8 = [entire]_trv; pownRev [-0.0,infinity]_dac 8 = [entire]_trv; pownRev [0.0,0.0]_def 8 = [0.0,0.0]_trv; pownRev [-0.0,-0.0]_dac 8 = [0.0,0.0]_trv; pownRev [0X1.9D8FD495853F5P+29,0X1.9D8FD495853F6P+29]_com 8 = [-0x1.a333333333334p+3,0x1.a333333333334p+3]_trv; pownRev [0X1.DFB1BB622E70DP+102,0X1.DFB1BB622E70EP+102]_dac 8 = [-0x1.d1b251eb851edp+12,0x1.d1b251eb851edp+12]_trv; pownRev [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_def 8 = [-0x1p+128,0x1p+128]_trv; pownRev [0.0,0X1.A87587109655P+66]_dac 8 = [-0x1.444cccccccccep+8,0x1.444cccccccccep+8]_trv; pownRev [-0.0,0X1.A87587109655P+66]_def 8 = [-0x1.444cccccccccep+8,0x1.444cccccccccep+8]_trv; pownRev [0X1.CD2B297D889BDP-54,0X1.B253D9F33CE4DP+9]_com 8 = [-0x1.2a3d70a3d70a5p+1,0x1.2a3d70a3d70a5p+1]_trv; pownRev [0X1.26F1FCDD502A3P-13,0X1.53ABD7BFC4FC6P+7]_dac 8 = [-0x1.e666666666667p+0,0x1.e666666666667p+0]_trv; pownRev [empty]_trv 3 = [empty]_trv; pownRev [entire]_def 3 = [entire]_trv; pownRev [0.0,0.0]_dac 3 = [0.0,0.0]_trv; pownRev [-0.0,-0.0]_def 3 = [0.0,0.0]_trv; pownRev [0X1.1902E978D4FDEP+11,0X1.1902E978D4FDFP+11]_com 3 = [0x1.a333333333332p+3,0x1.a333333333334p+3]_trv; pownRev [-0X1.81460637B9A3DP+38,-0X1.81460637B9A3CP+38]_def 3 = [-0x1.d1b251eb851edp+12,-0x1.d1b251eb851ebp+12]_trv; pownRev [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_dac 3 = [0x1.428a2f98d728ap+341,0x1.428a2f98d728bp+341]_trv; pownRev [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023]_com 3 = [-0x1.428a2f98d728bp+341, -0x1.428a2f98d728ap+341]_trv; pownRev [0.0,infinity]_def 3 = [0.0,infinity]_trv; pownRev [-0.0,infinity]_def 3 = [0.0,infinity]_trv; pownRev [-infinity,0.0]_dac 3 = [-infinity,0.0]_trv; pownRev [-infinity,-0.0]_def 3 = [-infinity,0.0]_trv; pownRev [-0X1.0436D2F418938P+25,0X1.F4P+3]_com 3 = [-0x1.444cccccccccep+8,0x1.4p+1]_trv; pownRev [0X1.0C6F7A0B5ED8DP-20,0X1.94C75E6362A6P+3]_dac 3 = [0x1.47ae147ae147ap-7,0x1.2a3d70a3d70a5p+1]_trv; pownRev [-0X1.B6F9DB22D0E55P+2,-0X1.266559F6EC5B1P-5]_def 3 = [-0x1.e666666666667p+0,-0x1.51eb851eb851ep-2]_trv; pownRev [empty]_trv 7 = [empty]_trv; pownRev [entire]_def 7 = [entire]_trv; pownRev [0.0,0.0]_com 7 = [0.0,0.0]_trv; pownRev [-0.0,-0.0]_dac 7 = [0.0,0.0]_trv; pownRev [0X1.F91D1B185493BP+25,0X1.F91D1B185493CP+25]_def 7 = [0x1.a333333333332p+3,0x1.a333333333334p+3]_trv; pownRev [-0X1.07B1DA32F9B59P+90,-0X1.07B1DA32F9B58P+90]_dac 7 = [-0x1.d1b251eb851edp+12,-0x1.d1b251eb851ebp+12]_trv; pownRev [0x1.FFFFFFFFFFFFFp1023,0x1.FFFFFFFFFFFFFp1023]_com 7 = [0x1.381147622f886p+146,0x1.381147622f887p+146]_trv; pownRev [-0x1.FFFFFFFFFFFFFp1023,-0x1.FFFFFFFFFFFFFp1023]_def 7 = [-0x1.381147622f887p+146,-0x1.381147622f886p+146]_trv; pownRev [0.0,infinity]_dac 7 = [0.0,infinity]_trv; pownRev [-0.0,infinity]_dac 7 = [0.0,infinity]_trv; pownRev [-infinity,0.0]_def 7 = [-infinity,0.0]_trv; pownRev [-infinity,-0.0]_def 7 = [-infinity,0.0]_trv; pownRev [-0X1.4F109959E6D7FP+58,0X1.312DP+9]_dac 7 = [-0x1.444cccccccccep+8,0x1.4p+1]_trv; pownRev [0X1.6849B86A12B9BP-47,0X1.74D0373C76313P+8]_com 7 = [0x1.47ae147ae147ap-7,0x1.2a3d70a3d70a5p+1]_trv; pownRev [-0X1.658C775099757P+6,-0X1.BEE30301BF47AP-12]_def 7 = [-0x1.e666666666667p+0,-0x1.51eb851eb851ep-2]_trv; pownRev [empty]_trv -2 = [empty]_trv; pownRev [0.0,infinity]_dac -2 = [entire]_trv; pownRev [-0.0,infinity]_dac -2 = [entire]_trv; pownRev [0.0,0.0]_def -2 = [empty]_trv; pownRev [-0.0,-0.0]_com -2 = [empty]_trv; pownRev [-10.0,0.0]_dac -2 = [empty]_trv; pownRev [-10.0,-0.0]_def -2 = [empty]_trv; pownRev [0X1.7DE3A077D1568P-8,0X1.7DE3A077D1569P-8]_dac -2 = [-0x1.a333333333334p+3,0x1.a333333333334p+3]_trv; pownRev [0X1.3570290CD6E14P-26,0X1.3570290CD6E15P-26]_def -2 = [-0x1.d1b251eb851edp+12,0x1.d1b251eb851edp+12]_trv; pownRev [0X0P+0,0X0.0000000000001P-1022]_com -2 = [entire]_trv; pownRev [0X1.3F0C482C977C9P-17,infinity]_dac -2 = [-0x1.444cccccccccep+8,0x1.444cccccccccep+8]_trv; pownRev [0X1.793D85EF38E47P-3,0X1.388P+13]_def -2 = [-0x1.2a3d70a3d70a5p+1,0x1.2a3d70a3d70a5p+1]_trv; pownRev [0X1.1BA81104F6C8P-2,0X1.25D8FA1F801E1P+3]_com -2 = [-0x1.e666666666667p+0,0x1.e666666666667p+0]_trv; pownRev [empty]_trv -8 = [empty]_trv; pownRev [0.0,infinity]_def -8 = [entire]_trv; pownRev [-0.0,infinity]_dac -8 = [entire]_trv; pownRev [0.0,0.0]_def -8 = [empty]_trv; pownRev [-0.0,-0.0]_dac -8 = [empty]_trv; pownRev [0X1.3CEF39247CA6DP-30,0X1.3CEF39247CA6EP-30]_com -8 = [-0x1.a333333333334p+3,0x1.a333333333334p+3]_trv; pownRev [0X1.113D9EF0A99ACP-103,0X1.113D9EF0A99ADP-103]_def -8 = [-0x1.d1b251eb851edp+12,0x1.d1b251eb851edp+12]_trv; pownRev [0X0P+0,0X0.0000000000001P-1022]_dac -8 = [entire]_trv; pownRev [0X1.34CC3764D1E0CP-67,infinity]_def -8 = [-0x1.444cccccccccep+8,0x1.444cccccccccep+8]_trv; pownRev [0X1.2DC80DB11AB7CP-10,0X1.1C37937E08P+53]_com -8 = [-0x1.2a3d70a3d70a5p+1,0x1.2a3d70a3d70a5p+1]_trv; pownRev [0X1.81E104E61630DP-8,0X1.BC64F21560E34P+12]_def -8 = [-0x1.e666666666667p+0,0x1.e666666666667p+0]_trv; pownRev [empty]_trv -1 = [empty]_trv; pownRev [entire]_def -1 = [entire]_trv; pownRev [0.0,0.0]_dac -1 = [empty]_trv; pownRev [-0.0,-0.0]_dac -1 = [empty]_trv; pownRev [0X1.38ABF82EE6986P-4,0X1.38ABF82EE6987P-4]_def -1 = [0x1.a333333333332p+3,0x1.a333333333335p+3]_trv; pownRev [-0X1.197422C9048BFP-13,-0X1.197422C9048BEP-13]_dac -1 = [-0x1.d1b251eb851eep+12,-0x1.d1b251eb851ebp+12]_trv; pownRev [0X0.4P-1022,0X0.4000000000001P-1022]_dac -1 = [0x1.ffffffffffff8p+1023,infinity]_trv; pownRev [-0X0.4000000000001P-1022,-0X0.4P-1022]_def -1 = [-infinity,-0x1.ffffffffffff8p+1023]_trv; pownRev [0.0,infinity]_dac -1 = [0.0,infinity]_trv; pownRev [-0.0,infinity]_dac -1 = [0.0,infinity]_trv; pownRev [-infinity,0.0]_dac -1 = [-infinity,0.0]_trv; pownRev [-infinity,-0.0]_def -1 = [-infinity,0.0]_trv; pownRev [0X1.B77C278DBBE13P-2,0X1.9P+6]_com -1 = [0x1.47ae147ae147ap-7,0x1.2a3d70a3d70a5p+1]_trv; pownRev [-0X1.83E0F83E0F83EP+1,-0X1.0D79435E50D79P-1]_com -1 = [-0x1.e666666666667p+0,-0x1.51eb851eb851ep-2]_trv; pownRev [empty]_trv -3 = [empty]_trv; pownRev [entire]_def -3 = [entire]_trv; pownRev [0.0,0.0]_def -3 = [empty]_trv; pownRev [-0.0,-0.0]_dac -3 = [empty]_trv; pownRev [0X1.D26DF4D8B1831P-12,0X1.D26DF4D8B1832P-12]_com -3 = [0x1.a333333333332p+3,0x1.a333333333334p+3]_trv; pownRev [-0X1.54347DED91B19P-39,-0X1.54347DED91B18P-39]_def -3 = [-0x1.d1b251eb851edp+12,-0x1.d1b251eb851ebp+12]_trv; pownRev [0X0P+0,0X0.0000000000001P-1022]_dac -3 = [0x1p+358,infinity]_trv; pownRev [-0X0.0000000000001P-1022,-0X0P+0]_def -3 = [-infinity,-0x1p+358]_trv; pownRev [0.0,infinity]_dac -3 = [0.0,infinity]_trv; pownRev [-0.0,infinity]_dac -3 = [0.0,infinity]_trv; pownRev [-infinity,0.0]_def -3 = [-infinity,0.0]_trv; pownRev [-infinity,-0.0]_def -3 = [-infinity,0.0]_trv; pownRev [0X1.43CFBA61AACABP-4,0X1.E848P+19]_com -3 = [0x1.47ae147ae147ap-7,0x1.2a3d70a3d70a5p+1]_trv; pownRev [-0X1.BD393CE9E8E7CP+4,-0X1.2A95F6F7C066CP-3]_def -3 = [-0x1.e666666666667p+0,-0x1.51eb851eb851ep-2]_trv; pownRev [empty]_trv -7 = [empty]_trv; pownRev [entire]_def -7 = [entire]_trv; pownRev [0.0,0.0]_com -7 = [empty]_trv; pownRev [-0.0,-0.0]_def -7 = [empty]_trv; pownRev [0X1.037D76C912DBCP-26,0X1.037D76C912DBDP-26]_dac -7 = [0x1.a333333333332p+3,0x1.a333333333334p+3]_trv; pownRev [-0X1.F10F41FB8858FP-91,-0X1.F10F41FB8858EP-91]_dac -7 = [-0x1.d1b251eb851edp+12,-0x1.d1b251eb851ebp+12]_trv; pownRev [0X0P+0,0X0.0000000000001P-1022]_def -7 = [0x1.588cea3f093bcp+153,infinity]_trv; pownRev [-0X0.0000000000001P-1022,-0X0P+0]_def -7 = [-infinity,-0x1.588cea3f093bcp+153]_trv; pownRev [0.0,infinity]_dac -7 = [0.0,infinity]_trv; pownRev [-0.0,infinity]_def -7 = [0.0,infinity]_trv; pownRev [-infinity,0.0]_dac -7 = [-infinity,0.0]_trv; pownRev [-infinity,-0.0]_def -7 = [-infinity,0.0]_trv; pownRev [0X1.5F934D64162A9P-9,0X1.6BCC41E9P+46]_com -7 = [0x1.47ae147ae147ap-7,0x1.2a3d70a3d70a5p+1]_trv; pownRev [-0X1.254CDD3711DDBP+11,-0X1.6E95C4A761E19P-7]_com -7 = [-0x1.e666666666667p+0,-0x1.51eb851eb851ep-2]_trv; } testcase minimal_pownRev_dec_bin_test { pownRevBin [empty]_trv [1.0,1.0]_def 0 = [empty]_trv; pownRevBin [1.0,1.0]_dac [1.0,1.0]_dac 0 = [1.0,1.0]_trv; pownRevBin [-1.0,5.0]_def [-51.0,12.0]_dac 0 = [-51.0,12.0]_trv; pownRevBin [-1.0,0.0]_com [5.0,10.0]_dac 0 = [empty]_trv; pownRevBin [-1.0,-0.0]_dac [-1.0,1.0]_def 0 = [empty]_trv; pownRevBin [1.1,10.0]_def [1.0,41.0]_dac 0 = [empty]_trv; pownRevBin [empty]_trv [0.0,100.1]_dac 1 = [empty]_trv; pownRevBin [entire]_def [-5.1,10.0]_def 1 = [-5.1,10.0]_trv; pownRevBin [0.0,0.0]_com [-10.0,5.1]_dac 1 = [0.0,0.0]_trv; pownRevBin [-0.0,-0.0]_def [1.0,5.0]_dac 1 = [empty]_trv; pownRevBin [empty]_trv [5.0,17.1]_def 2 = [empty]_trv; pownRevBin [0.0,infinity]_dac [5.6,27.544]_dac 2 = [5.6,27.544]_trv; pownRevBin [0.0,0.0]_def [1.0,2.0]_def 2 = [empty]_trv; pownRevBin [0X1.A36E2EB1C432CP-14,0X1.5B7318FC50482P+2]_com [1.0,infinity]_def 2 = [1.0,0x1.2a3d70a3d70a5p+1]_trv; pownRevBin [0X1.BE0DED288CE7P-4,0X1.CE147AE147AE1P+1]_dac [-infinity,-1.0]_def 2 = [-0x1.e666666666667p+0,-1.0]_trv; pownRevBin [empty]_trv [-23.0,-1.0]_dac 3 = [empty]_trv; pownRevBin [entire]_def [-23.0,-1.0]_com 3 = [-23.0,-1.0]_trv; pownRevBin [0.0,0.0]_def [1.0,2.0]_dac 3 = [empty]_trv; pownRevBin [0X1.0C6F7A0B5ED8DP-20,0X1.94C75E6362A6P+3]_com [1.0,infinity]_dac 3 = [1.0,0x1.2a3d70a3d70a5p+1]_trv; pownRevBin [-0X1.B6F9DB22D0E55P+2,-0X1.266559F6EC5B1P-5]_com [-infinity,-1.0]_dac 3 = [-0x1.e666666666667p+0,-1.0]_trv; pownRevBin [empty]_trv [-3.0,17.3]_def -2 = [empty]_trv; pownRevBin [0.0,infinity]_dac [-5.1,-0.1]_dac -2 = [-5.1,-0.1]_trv; pownRevBin [0.0,0.0]_def [27.2,55.1]_dac -2 = [empty]_trv; pownRevBin [0X1.3F0C482C977C9P-17,infinity]_def [-infinity,-0x1.FFFFFFFFFFFFFp1023]_dac -2 = [empty]_trv; pownRevBin [0X1.793D85EF38E47P-3,0X1.388P+13]_com [1.0,infinity]_dac -2 = [1.0,0x1.2a3d70a3d70a5p+1]_trv; pownRevBin [0X1.1BA81104F6C8P-2,0X1.25D8FA1F801E1P+3]_com [-infinity,-1.0]_dac -2 = [-0x1.e666666666667p+0,-1.0]_trv; pownRevBin [empty]_trv [-5.1,55.5]_def -1 = [empty]_trv; pownRevBin [entire]_def [-5.1,55.5]_dac -1 = [-5.1,55.5]_trv; pownRevBin [0.0,0.0]_dac [-5.1,55.5]_def -1 = [empty]_trv; pownRevBin [-infinity,-0.0]_dac [-1.0,1.0]_com -1 = [-1.0,0.0]_trv; pownRevBin [0X1.B77C278DBBE13P-2,0X1.9P+6]_def [-1.0,0.0]_dac -1 = [empty]_trv; pownRevBin [empty]_trv [-5.1,55.5]_dac -3 = [empty]_trv; pownRevBin [entire]_def [-5.1,55.5]_def -3 = [-5.1,55.5]_trv; pownRevBin [0.0,0.0]_def [-5.1,55.5]_def -3 = [empty]_trv; pownRevBin [-infinity,0.0]_dac [5.1,55.5]_com -3 = [empty]_trv; pownRevBin [-infinity,-0.0]_dac [-32.0,1.1]_def -3 = [-32.0,0.0]_trv; } testcase minimal_sinRev_test { sinRev [empty] = [empty]; sinRev [-2.0,-1.1] = [empty]; sinRev [1.1, 2.0] = [empty]; sinRev [-1.0,1.0] = [entire]; sinRev [0.0,0.0] = [entire]; sinRev [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53] = [entire]; } testcase minimal_sinRevBin_test { sinRevBin [empty] [-1.2,12.1] = [empty]; sinRevBin [-2.0,-1.1] [-5.0, 5.0] = [empty]; sinRevBin [1.1, 2.0] [-5.0, 5.0] = [empty]; sinRevBin [-1.0,1.0] [-1.2,12.1] = [-1.2,12.1]; sinRevBin [0.0,0.0] [-1.0,1.0] = [0.0,0.0]; sinRevBin [-0.0,-0.0] [2.0,2.5] = [empty]; sinRevBin [-0.0,-0.0] [3.0,3.5] = [0x1.921fb54442d18p+1,0x1.921fb54442d19p+1]; sinRevBin [0X1.FFFFFFFFFFFFFP-1,0X1P+0] [1.57,1.58 ] = [0x1.921fb50442d18p+0,0x1.921fb58442d1ap+0]; sinRevBin [0.0,0X1P+0] [-0.1,1.58] = [0.0,1.58]; sinRevBin [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53] [3.14,3.15] = [0X1.921FB54442D17P+1,0X1.921FB54442D19P+1]; sinRevBin [-0X1.72CECE675D1FDP-52,-0X1.72CECE675D1FCP-52] [3.14,3.15] = [0X1.921FB54442D18P+1,0X1.921FB54442D1aP+1]; sinRevBin [-0X1.72CECE675D1FDP-52,0X1.1A62633145C07P-53] [3.14,3.15] = [0X1.921FB54442D17P+1,0X1.921FB54442D1aP+1]; sinRevBin [0.0,1.0] [-0.1,3.15] = [0.0,0X1.921FB54442D19P+1]; sinRevBin [0.0,1.0] [-0.1,3.15] = [-0.0,0X1.921FB54442D19P+1]; sinRevBin [-0X1.72CECE675D1FDP-52,1.0] [-0.1,3.15] = [-0x1.72cece675d1fep-52,0X1.921FB54442D1aP+1]; sinRevBin [-0X1.72CECE675D1FDP-52,1.0] [0.0,3.15] = [0.0,0X1.921FB54442D1aP+1]; sinRevBin [0X1.1A62633145C06P-53,0X1P+0] [3.14,3.15] = [3.14,0X1.921FB54442D19P+1]; sinRevBin [-0X1.72CECE675D1FDP-52,0X1P+0] [1.57,3.15] = [1.57,0X1.921FB54442D1AP+1]; sinRevBin [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53] [-infinity,3.15] = [-infinity,0X1.921FB54442D19P+1]; sinRevBin [-0X1.72CECE675D1FDP-52,-0X1.72CECE675D1FCP-52] [3.14,infinity] = [0X1.921FB54442D18P+1,infinity]; } testcase minimal_sinRev_dec_test { sinRev [empty]_trv = [empty]_trv; sinRev [-2.0,-1.1]_com = [empty]_trv; sinRev [1.1, 2.0]_dac = [empty]_trv; sinRev [-1.0,1.0]_com = [entire]_trv; sinRev [0.0,0.0]_dac = [entire]_trv; sinRev [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53]_def = [entire]_trv; } testcase minimal_sinRev_dec_bin_test { sinRevBin [empty]_trv [-1.2,12.1]_com = [empty]_trv; sinRevBin [-2.0,-1.1]_def [-5.0, 5.0]_def = [empty]_trv; sinRevBin [1.1, 2.0]_dac [-5.0, 5.0]_com = [empty]_trv; sinRevBin [-1.0,1.0]_com [-1.2,12.1]_def = [-1.2,12.1]_trv; sinRevBin [0.0,0.0]_dac [-1.0,1.0]_def = [0.0,0.0]_trv; sinRevBin [-0.0,-0.0]_def [2.0,2.5]_trv = [empty]_trv; sinRevBin [-0.0,-0.0]_def [3.0,3.5]_dac = [0x1.921fb54442d18p+1,0x1.921fb54442d19p+1]_trv; sinRevBin [0X1.FFFFFFFFFFFFFP-1,0X1P+0]_dac [1.57,1.58]_dac = [0x1.921fb50442d18p+0,0x1.921fb58442d1ap+0]_trv; sinRevBin [0.0,0X1P+0]_com [-0.1,1.58]_dac = [0.0,1.58]_trv; sinRevBin [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53]_com [3.14,3.15]_def = [0X1.921FB54442D17P+1,0X1.921FB54442D19P+1]_trv; sinRevBin [-0X1.72CECE675D1FDP-52,-0X1.72CECE675D1FCP-52]_com [3.14,3.15]_dac = [0X1.921FB54442D18P+1,0X1.921FB54442D1aP+1]_trv; sinRevBin [-0X1.72CECE675D1FDP-52,0X1.1A62633145C07P-53]_dac [3.14,3.15]_com = [0X1.921FB54442D17P+1,0X1.921FB54442D1aP+1]_trv; sinRevBin [0.0,1.0]_def [-0.1,3.15]_def = [0.0,0X1.921FB54442D19P+1]_trv; sinRevBin [0.0,1.0]_dac [-0.1,3.15]_com = [-0.0,0X1.921FB54442D19P+1]_trv; sinRevBin [-0X1.72CECE675D1FDP-52,1.0]_def [-0.1,3.15]_def = [-0x1.72cece675d1fep-52,0X1.921FB54442D1aP+1]_trv; sinRevBin [-0X1.72CECE675D1FDP-52,1.0]_com [0.0,3.15]_dac = [0.0,0X1.921FB54442D1aP+1]_trv; sinRevBin [0X1.1A62633145C06P-53,0X1P+0]_def [3.14,3.15]_com = [3.14,0X1.921FB54442D19P+1]_trv; sinRevBin [-0X1.72CECE675D1FDP-52,0X1P+0]_dac [1.57,3.15]_com = [1.57,0X1.921FB54442D1AP+1]_trv; sinRevBin [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53]_com [-infinity,3.15]_dac = [-infinity,0X1.921FB54442D19P+1]_trv; sinRevBin [-0X1.72CECE675D1FDP-52,-0X1.72CECE675D1FCP-52]_com [3.14,infinity]_dac = [0X1.921FB54442D18P+1,infinity]_trv; } testcase minimal_cosRev_test { cosRev [empty] = [empty]; cosRev [-2.0,-1.1] = [empty]; cosRev [1.1, 2.0] = [empty]; cosRev [-1.0,1.0] = [entire]; cosRev [0.0,0.0] = [entire]; cosRev [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53] = [entire]; } testcase minimal_cosRevBin_test { cosRevBin [empty] [-1.2,12.1] = [empty]; cosRevBin [-2.0,-1.1] [-5.0, 5.0] = [empty]; cosRevBin [1.1, 2.0] [-5.0, 5.0] = [empty]; cosRevBin [-1.0,1.0] [-1.2,12.1] = [-1.2,12.1]; cosRevBin [1.0,1.0] [-0.1,0.1] = [0.0,0.0]; cosRevBin [-1.0,-1.0] [3.14,3.15] = [0x1.921fb54442d18p+1,0x1.921fb54442d1ap+1]; cosRevBin [0X1.1A62633145C06P-54,0X1.1A62633145C07P-54] [1.57,1.58] = [0X1.921FB54442D17P+0,0X1.921FB54442D19P+0]; cosRevBin [-0X1.72CECE675D1FDP-53,-0X1.72CECE675D1FCP-53] [1.57,1.58] = [0X1.921FB54442D18P+0,0X1.921FB54442D1AP+0]; cosRevBin [-0X1.72CECE675D1FDP-53,0X1.1A62633145C07P-54] [1.57,1.58] = [0X1.921FB54442D17P+0,0X1.921FB54442D1aP+0]; cosRevBin [0X1.1A62633145C06P-54,1.0] [-2.0,2.0] = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]; cosRevBin [0X1.1A62633145C06P-54,1.0] [0.0,2.0] = [0.0,0X1.921FB54442D19P+0]; cosRevBin [-0X1.72CECE675D1FDP-53,1.0] [-0.1,1.5708] = [-0.1,0X1.921FB54442D1aP+0]; cosRevBin [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1] [3.14,3.15] = [0x1.921fb52442d18p+1,0x1.921fb56442d1ap+1]; cosRevBin [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1] [-3.15,-3.14] = [-0x1.921fb56442d1ap+1,-0x1.921fb52442d18p+1]; cosRevBin [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1] [9.42,9.45] = [0x1.2d97c7eb321d2p+3,0x1.2d97c7fb321d3p+3]; cosRevBin [0X1.87996529F9D92P-1,1.0] [-1.0,0.1] = [-0x1.6666666666667p-1,0.1]; cosRevBin [-0X1.AA22657537205P-2,0X1.14A280FB5068CP-1] [0.0,2.1] = [0x1.fffffffffffffp-1,0x1.0000000000001p+1]; cosRevBin [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53] [-infinity,1.58] = [-infinity,0X1.921FB54442D18P+0]; cosRevBin [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53] [-infinity,1.5] = [-infinity,-0X1.921FB54442D17P+0]; cosRevBin [-0X1.72CECE675D1FDP-52,-0X1.72CECE675D1FCP-52] [-1.58,infinity] = [-0x1.921fb54442d1ap+0,infinity]; cosRevBin [-0X1.72CECE675D1FDP-52,-0X1.72CECE675D1FCP-52] [-1.5,infinity] = [0x1.921fb54442d19p+0,infinity]; } testcase minimal_cosRev_dec_test { cosRev [empty]_trv = [empty]_trv; cosRev [-2.0,-1.1]_def = [empty]_trv; cosRev [1.1, 2.0]_dac = [empty]_trv; cosRev [-1.0,1.0]_com = [entire]_trv; cosRev [0.0,0.0]_def = [entire]_trv; cosRev [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53]_dac = [entire]_trv; } testcase minimal_cosRev_dec_bin_test { cosRevBin [empty]_trv [-1.2,12.1]_def = [empty]_trv; cosRevBin [-2.0,-1.1]_dac [-5.0, 5.0]_com = [empty]_trv; cosRevBin [1.1, 2.0]_dac [-5.0, 5.0]_com = [empty]_trv; cosRevBin [-1.0,1.0]_dac [-1.2,12.1]_def = [-1.2,12.1]_trv; cosRevBin [1.0,1.0]_def [-0.1,0.1]_dac = [0.0,0.0]_trv; cosRevBin [-1.0,-1.0]_com [3.14,3.15]_dac = [0x1.921fb54442d18p+1,0x1.921fb54442d1ap+1]_trv; cosRevBin [0X1.1A62633145C06P-54,0X1.1A62633145C07P-54]_def [1.57,1.58]_def = [0X1.921FB54442D17P+0,0X1.921FB54442D19P+0]_trv; cosRevBin [-0X1.72CECE675D1FDP-53,-0X1.72CECE675D1FCP-53]_dac [1.57,1.58]_dac = [0X1.921FB54442D18P+0,0X1.921FB54442D1AP+0]_trv; cosRevBin [-0X1.72CECE675D1FDP-53,0X1.1A62633145C07P-54]_com [1.57,1.58]_dac = [0X1.921FB54442D17P+0,0X1.921FB54442D1aP+0]_trv; cosRevBin [0X1.1A62633145C06P-54,1.0]_def [-2.0,2.0]_com = [-0X1.921FB54442D19P+0, 0X1.921FB54442D19P+0]_trv; cosRevBin [0X1.1A62633145C06P-54,1.0]_dac [0.0,2.0]_def = [0.0,0X1.921FB54442D19P+0]_trv; cosRevBin [-0X1.72CECE675D1FDP-53,1.0]_def [-0.1,1.5708]_dac = [-0.1,0X1.921FB54442D1aP+0]_trv; cosRevBin [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]_dac [3.14,3.15]_def = [0x1.921fb52442d18p+1,0x1.921fb56442d1ap+1]_trv; cosRevBin [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]_def [-3.15,-3.14]_com = [-0x1.921fb56442d1ap+1,-0x1.921fb52442d18p+1]_trv; cosRevBin [-0X1P+0,-0X1.FFFFFFFFFFFFFP-1]_def [9.42,9.45]_dac = [0x1.2d97c7eb321d2p+3,0x1.2d97c7fb321d3p+3]_trv; cosRevBin [0X1.87996529F9D92P-1,1.0]_dac [-1.0,0.1]_def = [-0x1.6666666666667p-1,0.1]_trv; cosRevBin [-0X1.AA22657537205P-2,0X1.14A280FB5068CP-1]_com [0.0,2.1]_dac = [0x1.fffffffffffffp-1,0x1.0000000000001p+1]_trv; cosRevBin [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53]_com [-infinity,1.58]_dac = [-infinity,0X1.921FB54442D18P+0]_trv; cosRevBin [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53]_def [-infinity,1.5]_dac = [-infinity,-0X1.921FB54442D17P+0]_trv; cosRevBin [-0X1.72CECE675D1FDP-52,-0X1.72CECE675D1FCP-52]_dac [-1.58,infinity]_dac = [-0x1.921fb54442d1ap+0,infinity]_trv; cosRevBin [-0X1.72CECE675D1FDP-52,-0X1.72CECE675D1FCP-52]_def [-1.5,infinity]_dac = [0x1.921fb54442d19p+0,infinity]_trv; } testcase minimal_tanRev_test { tanRev [empty] = [empty]; tanRev [-1.0,1.0] = [entire]; tanRev [-156.0,-12.0] = [entire]; tanRev [0.0,0.0] = [entire]; tanRev [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53] = [entire]; } testcase minimal_tanRevBin_test { tanRevBin [empty] [-1.5708,1.5708] = [empty]; tanRevBin [entire] [-1.5708,1.5708] = [-1.5708,1.5708]; tanRevBin [0.0,0.0] [-1.5708,1.5708] = [0.0,0.0]; tanRevBin [0X1.D02967C31CDB4P+53,0X1.D02967C31CDB5P+53] [-1.5708,1.5708] = [-0x1.921fb54442d1bp+0,0x1.921fb54442d19p+0]; tanRevBin [-0X1.1A62633145C07P-53,-0X1.1A62633145C06P-53] [3.14,3.15] = [0X1.921FB54442D17P+1,0X1.921FB54442D19P+1]; tanRevBin [0X1.72CECE675D1FCP-52,0X1.72CECE675D1FDP-52] [-3.15,3.15] = [-0X1.921FB54442D19P+1,0X1.921FB54442D1aP+1]; tanRevBin [-0X1.D02967C31p+53,0X1.D02967C31p+53] [-infinity,1.5707965] = [-infinity, +0x1.921FB82C2BD7Fp0]; tanRevBin [-0X1.D02967C31p+53,0X1.D02967C31p+53] [-1.5707965,infinity] = [-0x1.921FB82C2BD7Fp0, +infinity]; tanRevBin [-0X1.D02967C31p+53,0X1.D02967C31p+53] [-1.5707965,1.5707965] = [-0x1.921FB82C2BD7Fp0, +0x1.921FB82C2BD7Fp0]; tanRevBin [-0X1.D02967C31CDB5P+53,0X1.D02967C31CDB5P+53] [-1.5707965,1.5707965] = [-1.5707965,1.5707965]; } testcase minimal_tanRev_dec_test { tanRev [empty]_trv = [empty]_trv; tanRev [-1.0,1.0]_com = [entire]_trv; tanRev [-156.0,-12.0]_dac = [entire]_trv; tanRev [0.0,0.0]_def = [entire]_trv; tanRev [0X1.1A62633145C06P-53,0X1.1A62633145C07P-53]_com = [entire]_trv; } testcase minimal_tanRev_dec_bin_test { tanRevBin [empty]_trv [-1.5708,1.5708]_def = [empty]_trv; tanRevBin [entire]_def [-1.5708,1.5708]_dac = [-1.5708,1.5708]_trv; tanRevBin [0.0,0.0]_com [-1.5708,1.5708]_def = [0.0,0.0]_trv; tanRevBin [0X1.D02967C31CDB4P+53,0X1.D02967C31CDB5P+53]_dac [-1.5708,1.5708]_def = [-0x1.921fb54442d1bp+0,0x1.921fb54442d19p+0]_trv; tanRevBin [-0X1.1A62633145C07P-53,-0X1.1A62633145C06P-53]_def [3.14,3.15]_dac = [0X1.921FB54442D17P+1,0X1.921FB54442D19P+1]_trv; tanRevBin [0X1.72CECE675D1FCP-52,0X1.72CECE675D1FDP-52]_com [-3.15,3.15]_com = [-0X1.921FB54442D19P+1,0X1.921FB54442D1aP+1]_trv; tanRevBin [-0X1.D02967C31p+53,0X1.D02967C31p+53]_def [-infinity,1.5707965]_def = [-infinity,0x1.921FB82C2BD7Fp0]_trv; tanRevBin [-0X1.D02967C31p+53,0X1.D02967C31p+53]_com [-1.5707965,infinity]_dac = [-0x1.921FB82C2BD7Fp0,infinity]_trv; tanRevBin [-0X1.D02967C31p+53,0X1.D02967C31p+53]_com [-1.5707965,1.5707965]_com = [-0x1.921FB82C2BD7Fp0,0x1.921FB82C2BD7Fp0]_trv; tanRevBin [-0X1.D02967C31CDB5P+53,0X1.D02967C31CDB5P+53]_dac [-1.5707965,1.5707965]_def = [-1.5707965,1.5707965]_trv; } testcase minimal_coshRev_test { coshRev [empty] = [empty]; coshRev [1.0,infinity] = [entire]; coshRev [0.0,infinity] = [entire]; coshRev [1.0,1.0] = [0.0,0.0]; coshRev [0X1.8B07551D9F55P+0,0X1.89BCA168970C6P+432] = [-0X1.2C903022DD7ABP+8,0X1.2C903022DD7ABP+8]; } testcase minimal_coshRevBin_test { coshRevBin [empty] [0.0,infinity] = [empty]; coshRevBin [1.0,infinity] [0.0,infinity] = [0.0,infinity]; coshRevBin [0.0,infinity] [1.0,2.0] = [1.0,2.0]; coshRevBin [1.0,1.0] [1.0,infinity] = [empty]; coshRevBin [0X1.8B07551D9F55P+0,0X1.89BCA168970C6P+432] [-infinity,0.0] = [-0X1.2C903022DD7ABP+8,-0x1.fffffffffffffp-1]; } testcase minimal_coshRev_dec_test { coshRev [empty]_trv = [empty]_trv; coshRev [1.0,infinity]_dac = [entire]_trv; coshRev [0.0,infinity]_dac = [entire]_trv; coshRev [1.0,1.0]_def = [0.0,0.0]_trv; coshRev [0X1.8B07551D9F55P+0,0X1.89BCA168970C6P+432]_com = [-0X1.2C903022DD7ABP+8,0X1.2C903022DD7ABP+8]_trv; } testcase minimal_coshRev_dec_bin_test { coshRevBin [empty]_trv [0.0,infinity]_dac = [empty]_trv; coshRevBin [1.0,infinity]_def [0.0,infinity]_dac = [0.0,infinity]_trv; coshRevBin [0.0,infinity]_def [1.0,2.0]_com = [1.0,2.0]_trv; coshRevBin [1.0,1.0]_dac [1.0,infinity]_def = [empty]_trv; coshRevBin [0X1.8B07551D9F55P+0,0X1.89BCA168970C6P+432]_com [-infinity,0.0]_dac = [-0X1.2C903022DD7ABP+8,-0x1.fffffffffffffp-1]_trv; } testcase minimal_mulRev_test { mulRev [empty] [1.0, 2.0] = [empty]; mulRev [1.0, 2.0] [empty] = [empty]; mulRev [empty] [empty] = [empty]; mulRev [-2.0, -0.1] [-2.1, -0.4] = [0X1.999999999999AP-3, 0X1.5P+4]; mulRev [-2.0, 0.0] [-2.1, -0.4] = [0X1.999999999999AP-3, infinity]; mulRev [-2.0, 1.1] [-2.1, -0.4] = [entire]; mulRev [0.0, 1.1] [-2.1, -0.4] = [-infinity, -0X1.745D1745D1745P-2]; mulRev [0.01, 1.1] [-2.1, -0.4] = [-0X1.A400000000001P+7, -0X1.745D1745D1745P-2]; mulRev [0.0, 0.0] [-2.1, -0.4] = [empty]; mulRev [-infinity, -0.1] [-2.1, -0.4] = [0.0, 0X1.5P+4]; mulRev [-infinity, 0.0] [-2.1, -0.4] = [0.0, infinity]; mulRev [-infinity, 1.1] [-2.1, -0.4] = [entire]; mulRev [-2.0, infinity] [-2.1, -0.4] = [entire]; mulRev [0.0, infinity] [-2.1, -0.4] = [-infinity, 0.0]; mulRev [0.01, infinity] [-2.1, -0.4] = [-0X1.A400000000001P+7, 0.0]; mulRev [entire] [-2.1, -0.4] = [entire]; mulRev [-2.0, -0.1] [-2.1, 0.0] = [0.0, 0X1.5P+4]; mulRev [-2.0, 0.0] [-2.1, 0.0] = [entire]; mulRev [-2.0, 1.1] [-2.1, 0.0] = [entire]; mulRev [0.0, 1.1] [-2.1, 0.0] = [entire]; mulRev [0.01, 1.1] [-2.1, 0.0] = [-0X1.A400000000001P+7, 0.0]; mulRev [0.0, 0.0] [-2.1, 0.0] = [entire]; mulRev [-infinity, -0.1] [-2.1, 0.0] = [0.0, 0X1.5P+4]; mulRev [-infinity, 0.0] [-2.1, 0.0] = [entire]; mulRev [-infinity, 1.1] [-2.1, 0.0] = [entire]; mulRev [-2.0, infinity] [-2.1, 0.0] = [entire]; mulRev [0.0, infinity] [-2.1, 0.0] = [entire]; mulRev [0.01, infinity] [-2.1, 0.0] = [-0X1.A400000000001P+7, 0.0]; mulRev [entire] [-2.1, 0.0] = [entire]; mulRev [-2.0, -0.1] [-2.1, 0.12] = [-0X1.3333333333333P+0, 0X1.5P+4]; mulRev [-2.0, 0.0] [-2.1, 0.12] = [entire]; mulRev [-2.0, 1.1] [-2.1, 0.12] = [entire]; mulRev [0.0, 1.1] [-2.1, 0.12] = [entire]; mulRev [0.01, 1.1] [-2.1, 0.12] = [-0X1.A400000000001P+7 , 0X1.8P+3]; mulRev [0.0, 0.0] [-2.1, 0.12] = [entire]; mulRev [-infinity, -0.1] [-2.1, 0.12] = [-0X1.3333333333333P+0, 0X1.5P+4]; mulRev [-infinity, 0.0] [-2.1, 0.12] = [entire]; mulRev [-infinity, 1.1] [-2.1, 0.12] = [entire]; mulRev [-2.0, infinity] [-2.1, 0.12] = [entire]; mulRev [0.0, infinity] [-2.1, 0.12] = [entire]; mulRev [0.01, infinity] [-2.1, 0.12] = [-0X1.A400000000001P+7 , 0X1.8P+3]; mulRev [entire] [-2.1, 0.12] = [entire]; mulRev [-2.0, -0.1] [0.0, 0.12] = [-0X1.3333333333333P+0, 0.0]; mulRev [-2.0, 0.0] [0.0, 0.12] = [entire]; mulRev [-2.0, 1.1] [0.0, 0.12] = [entire]; mulRev [0.0, 1.1] [0.0, 0.12] = [entire]; mulRev [0.01, 1.1] [0.0, 0.12] = [0.0, 0X1.8P+3]; mulRev [0.0, 0.0] [0.0, 0.12] = [entire]; mulRev [-infinity, -0.1] [0.0, 0.12] = [-0X1.3333333333333P+0, 0.0]; mulRev [-infinity, 0.0] [0.0, 0.12] = [entire]; mulRev [-infinity, 1.1] [0.0, 0.12] = [entire]; mulRev [-2.0, infinity] [0.0, 0.12] = [entire]; mulRev [0.0, infinity] [0.0, 0.12] = [entire]; mulRev [0.01, infinity] [0.0, 0.12] = [0.0, 0X1.8P+3]; mulRev [entire] [0.0, 0.12] = [entire]; mulRev [-2.0, -0.1] [0.01, 0.12] = [-0X1.3333333333333P+0, -0X1.47AE147AE147BP-8]; mulRev [-2.0, 0.0] [0.01, 0.12] = [-infinity, -0X1.47AE147AE147BP-8]; mulRev [-2.0, 1.1] [0.01, 0.12] = [entire]; mulRev [0.0, 1.1] [0.01, 0.12] = [0X1.29E4129E4129DP-7, infinity]; mulRev [0.01, 1.1] [0.01, 0.12] = [0X1.29E4129E4129DP-7, 0X1.8P+3]; mulRev [0.0, 0.0] [0.01, 0.12] = [empty]; mulRev [-infinity, -0.1] [0.01, 0.12] = [-0X1.3333333333333P+0, 0.0]; mulRev [-infinity, 0.0] [0.01, 0.12] = [-infinity, 0.0]; mulRev [-infinity, 1.1] [0.01, 0.12] = [entire]; mulRev [-2.0, infinity] [0.01, 0.12] = [entire]; mulRev [0.0, infinity] [0.01, 0.12] = [0.0, infinity]; mulRev [0.01, infinity] [0.01, 0.12] = [0.0, 0X1.8P+3]; mulRev [entire] [0.01, 0.12] = [entire]; mulRev [-2.0, -0.1] [0.0, 0.0] = [0.0, 0.0]; mulRev [-2.0, 0.0] [0.0, 0.0] = [entire]; mulRev [-2.0, 1.1] [0.0, 0.0] = [entire]; mulRev [0.0, 1.1] [0.0, 0.0] = [entire]; mulRev [0.01, 1.1] [0.0, 0.0] = [0.0, 0.0]; mulRev [0.0, 0.0] [0.0, 0.0] = [entire]; mulRev [-infinity, -0.1] [0.0, 0.0] = [0.0, 0.0]; mulRev [-infinity, 0.0] [0.0, 0.0] = [entire]; mulRev [-infinity, 1.1] [0.0, 0.0] = [entire]; mulRev [-2.0, infinity] [0.0, 0.0] = [entire]; mulRev [0.0, infinity] [0.0, 0.0] = [entire]; mulRev [0.01, infinity] [0.0, 0.0] = [0.0, 0.0]; mulRev [entire] [0.0, 0.0] = [entire]; mulRev [-2.0, -0.1] [-infinity, -0.1] = [0X1.999999999999AP-5, infinity]; mulRev [-2.0, 0.0] [-infinity, -0.1] = [0X1.999999999999AP-5 , infinity]; mulRev [-2.0, 1.1] [-infinity, -0.1] = [entire]; mulRev [0.0, 1.1] [-infinity, -0.1] = [-infinity, -0X1.745D1745D1745P-4]; mulRev [0.01, 1.1] [-infinity, -0.1] = [-infinity, -0X1.745D1745D1745P-4]; mulRev [0.0, 0.0] [-infinity, -0.1] = [empty]; mulRev [-infinity, -0.1] [-infinity, -0.1] = [0.0, infinity]; mulRev [-infinity, 0.0] [-infinity, -0.1] = [0.0, infinity]; mulRev [-infinity, 1.1] [-infinity, -0.1] = [entire]; mulRev [-2.0, infinity] [-infinity, -0.1] = [entire]; mulRev [0.0, infinity] [-infinity, -0.1] = [-infinity, 0.0]; mulRev [0.01, infinity] [-infinity, -0.1] = [-infinity, 0.0]; mulRev [entire] [-infinity, -0.1] = [entire]; mulRev [-2.0, -0.1] [-infinity, 0.0] = [0.0, infinity]; mulRev [-2.0, 0.0] [-infinity, 0.0] = [entire]; mulRev [-2.0, 1.1] [-infinity, 0.0] = [entire]; mulRev [0.0, 1.1] [-infinity, 0.0] = [entire]; mulRev [0.01, 1.1] [-infinity, 0.0] = [-infinity, 0.0]; mulRev [0.0, 0.0] [-infinity, 0.0] = [entire]; mulRev [-infinity, -0.1] [-infinity, 0.0] = [0.0, infinity]; mulRev [-infinity, 0.0] [-infinity, 0.0] = [entire]; mulRev [-infinity, 1.1] [-infinity, 0.0] = [entire]; mulRev [-2.0, infinity] [-infinity, 0.0] = [entire]; mulRev [0.0, infinity] [-infinity, 0.0] = [entire]; mulRev [0.01, infinity] [-infinity, 0.0] = [-infinity, 0.0]; mulRev [entire] [-infinity, 0.0] = [entire]; mulRev [-2.0, -0.1] [-infinity, 0.3] = [-0X1.8P+1, infinity]; mulRev [-2.0, 0.0] [-infinity, 0.3] = [entire]; mulRev [-2.0, 1.1] [-infinity, 0.3] = [entire]; mulRev [0.0, 1.1] [-infinity, 0.3] = [entire]; mulRev [0.01, 1.1] [-infinity, 0.3] = [-infinity, 0X1.EP+4]; mulRev [0.0, 0.0] [-infinity, 0.3] = [entire]; mulRev [-infinity, -0.1] [-infinity, 0.3] = [-0X1.8P+1, infinity]; mulRev [-infinity, 0.0] [-infinity, 0.3] = [entire]; mulRev [-infinity, 1.1] [-infinity, 0.3] = [entire]; mulRev [-2.0, infinity] [-infinity, 0.3] = [entire]; mulRev [0.0, infinity] [-infinity, 0.3] = [entire]; mulRev [0.01, infinity] [-infinity, 0.3] = [-infinity, 0X1.EP+4]; mulRev [entire] [-infinity, 0.3] = [entire]; mulRev [-2.0, -0.1] [-0.21, infinity] = [-infinity , 0X1.0CCCCCCCCCCCDP+1]; mulRev [-2.0, 0.0] [-0.21, infinity] = [entire]; mulRev [-2.0, 1.1] [-0.21, infinity] = [entire]; mulRev [0.0, 1.1] [-0.21, infinity] = [entire]; mulRev [0.01, 1.1] [-0.21, infinity] = [-0X1.5P+4, infinity]; mulRev [0.0, 0.0] [-0.21, infinity] = [entire]; mulRev [-infinity, -0.1] [-0.21, infinity] = [-infinity, 0X1.0CCCCCCCCCCCDP+1]; mulRev [-infinity, 0.0] [-0.21, infinity] = [entire]; mulRev [-infinity, 1.1] [-0.21, infinity] = [entire]; mulRev [-2.0, infinity] [-0.21, infinity] = [entire]; mulRev [0.0, infinity] [-0.21, infinity] = [entire]; mulRev [0.01, infinity] [-0.21, infinity] = [-0X1.5P+4, infinity]; mulRev [entire] [-0.21, infinity] = [entire]; mulRev [-2.0, -0.1] [0.0, infinity] = [-infinity, 0.0]; mulRev [-2.0, 0.0] [0.0, infinity] = [entire]; mulRev [-2.0, 1.1] [0.0, infinity] = [entire]; mulRev [0.0, 1.1] [0.0, infinity] = [entire]; mulRev [0.01, 1.1] [0.0, infinity] = [0.0, infinity]; mulRev [0.0, 0.0] [0.0, infinity] = [entire]; mulRev [-infinity, -0.1] [0.0, infinity] = [-infinity, 0.0]; mulRev [-infinity, 0.0] [0.0, infinity] = [entire]; mulRev [-infinity, 1.1] [0.0, infinity] = [entire]; mulRev [-2.0, infinity] [0.0, infinity] = [entire]; mulRev [0.0, infinity] [0.0, infinity] = [entire]; mulRev [0.01, infinity] [0.0, infinity] = [0.0, infinity]; mulRev [entire] [0.0, infinity] = [entire]; mulRev [-2.0, -0.1] [0.04, infinity] = [-infinity, -0X1.47AE147AE147BP-6]; mulRev [-2.0, 0.0] [0.04, infinity] = [-infinity, -0X1.47AE147AE147BP-6]; mulRev [-2.0, 1.1] [0.04, infinity] = [entire]; mulRev [0.0, 1.1] [0.04, infinity] = [0X1.29E4129E4129DP-5, infinity]; mulRev [0.01, 1.1] [0.04, infinity] = [0X1.29E4129E4129DP-5, infinity]; mulRev [0.0, 0.0] [0.04, infinity] = [empty]; mulRev [-infinity, -0.1] [0.04, infinity] = [-infinity, 0.0]; mulRev [-infinity, 0.0] [0.04, infinity] = [-infinity, 0.0]; mulRev [-infinity, 1.1] [0.04, infinity] = [entire]; mulRev [-2.0, infinity] [0.04, infinity] = [entire]; mulRev [0.0, infinity] [0.04, infinity] = [0.0, infinity]; mulRev [0.01, infinity] [0.04, infinity] = [0.0, infinity]; mulRev [entire] [0.04, infinity] = [entire]; mulRev [-2.0, -0.1] [entire] = [entire]; mulRev [-2.0, 0.0] [entire] = [entire]; mulRev [-2.0, 1.1] [entire] = [entire]; mulRev [0.0, 1.1] [entire] = [entire]; mulRev [0.01, 1.1] [entire] = [entire]; mulRev [0.0, 0.0] [entire] = [entire]; mulRev [-infinity, -0.1] [entire] = [entire]; mulRev [-infinity, 0.0] [entire] = [entire]; mulRev [-infinity, 1.1] [entire] = [entire]; mulRev [-2.0, infinity] [entire] = [entire]; mulRev [0.0, infinity] [entire] = [entire]; mulRev [0.01, infinity] [entire] = [entire]; mulRev [entire] [entire] = [entire]; } testcase minimal_mulRevTen_test { mulRevTen [-2.0, -0.1] [-2.1, -0.4] [-2.1, -0.4] = [empty]; mulRevTen [-2.0, 1.1] [-2.1, -0.4] [-2.1, -0.4] = [-2.1, -0.4]; mulRevTen [0.01, 1.1] [-2.1, 0.0] [-2.1, 0.0] = [-2.1,0.0]; mulRevTen [-infinity, -0.1] [0.0, 0.12] [0.0, 0.12] = [0.0, 0.0]; mulRevTen [-2.0, 1.1] [0.04, infinity] [0.04, infinity] = [0.04, infinity]; } testcase minimal_mulRev_dec_test { mulRev [-2.0, -0.1]_dac [-2.1, -0.4]_dac = [0X1.999999999999AP-3, 0X1.5P+4]_trv; mulRev [-2.0, -0.1]_def [-2.1, 0.0]_def = [0.0, 0X1.5P+4]_trv; mulRev [-2.0, -0.1]_com [-2.1, 0.12]_dac = [-0X1.3333333333333P+0, 0X1.5P+4]_trv; mulRev [-infinity, -0.1]_dac [0.0, 0.12]_com = [-0X1.3333333333333P+0, 0.0]_trv; mulRev [0.01, 1.1]_def [0.01, 0.12]_dac = [0X1.29E4129E4129DP-7, 0X1.8P+3]_trv; mulRev [0.01, 1.1]_dac [-infinity, 0.3]_def = [-infinity, 0X1.EP+4]_trv; mulRev [-infinity, -0.1]_trv [-0.21, infinity]_dac = [-infinity, 0X1.0CCCCCCCCCCCDP+1]_trv; } testcase minimal_mulRev_dec_ten_test { mulRevTen [-2.0, -0.1]_dac [-2.1, -0.4]_dac [-2.1, -0.4]_dac = [empty]_trv; mulRevTen [-2.0, 1.1]_def [-2.1, -0.4]_com [-2.1, -0.4]_com = [-2.1, -0.4]_trv; mulRevTen [0.01, 1.1]_com [-2.1, 0.0]_dac [-2.1, 0.0]_dac = [-2.1,0.0]_trv; mulRevTen [-infinity, -0.1]_dac [0.0, 0.12]_com [0.0, 0.12]_com = [0.0, 0.0]_trv; mulRevTen [-2.0, 1.1]_def [0.04, infinity]_dac [0.04, infinity]_dac = [0.04, infinity]_trv; } interval-2.1.0/test/libieeep1788_tests_set.itl0000644000000000000000000000414313031036767017370 0ustar 00000000000000/* Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) Copyright 2015-2016 Oliver Heimlich Original author: Marco Nehmeier (unit tests in libieeep1788, original license: Apache License 2.0) Converted into portable ITL format by Oliver Heimlich with minor corrections. 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 . */ testcase minimal_intersection_test { intersection [1.0,3.0] [2.1,4.0] = [2.1,3.0]; intersection [1.0,3.0] [3.0,4.0] = [3.0,3.0]; intersection [1.0,3.0] [empty] = [empty]; intersection [entire] [empty] = [empty]; intersection [1.0,3.0] [entire] = [1.0,3.0]; } testcase minimal_intersection_dec_test { intersection [1.0,3.0]_com [2.1,4.0]_com = [2.1,3.0]_trv; intersection [1.0,3.0]_dac [3.0,4.0]_def = [3.0,3.0]_trv; intersection [1.0,3.0]_def [empty]_trv = [empty]_trv; intersection [entire]_def [empty]_trv = [empty]_trv; intersection [1.0,3.0]_dac [entire]_def = [1.0,3.0]_trv; } testcase minimal_convexHull_test { convexHull [1.0,3.0] [2.1,4.0] = [1.0,4.0]; convexHull [1.0,1.0] [2.1,4.0] = [1.0,4.0]; convexHull [1.0,3.0] [empty] = [1.0,3.0]; convexHull [empty] [empty] = [empty]; convexHull [1.0,3.0] [entire] = [entire]; } testcase minimal_convexHull_dec_test { convexHull [1.0,3.0]_trv [2.1,4.0]_trv = [1.0,4.0]_trv; convexHull [1.0,1.0]_trv [2.1,4.0]_trv = [1.0,4.0]_trv; convexHull [1.0,3.0]_trv [empty]_trv = [1.0,3.0]_trv; convexHull [empty]_trv [empty]_trv = [empty]_trv; convexHull [1.0,3.0]_trv [entire]_def = [entire]_trv; } interval-2.1.0/test/mpfi.itl0000644000000000000000000024756413031036767014140 0ustar 00000000000000/* Copyright 2009–2012 Spaces project, Inria Lorraine and Salsa project, INRIA Rocquencourt, and Arenaire project, Inria Rhone-Alpes, France and Lab. ANO, USTL (Univ. of Lille), France Copyright 2015-2016 Oliver Heimlich Original authors: Philippe Theveny (Philippe.Theveny@ens-lyon.fr) and Nathalie Revol (Nathalie.Revol@ens-lyon.fr) (unit tests in GNU MPFI, original license: LGPLv2.1+) Converted into portable ITL format by Oliver Heimlich. 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 . */ testcase mpfi_abs { // special values abs [-infinity, -7.0] = [+7.0, +infinity]; abs [-infinity, 0.0] = [0.0, +infinity]; abs [-infinity, 0.0] = [0.0, +infinity]; abs [-infinity, +8.0] = [0.0, +infinity]; abs [entire] = [0.0, +infinity]; abs [0.0, 0.0] = [0.0, 0.0]; abs [0.0, +8.0] = [0.0, +8.0]; abs [0.0, +infinity] = [0.0, +infinity]; abs [0.0, +8.0] = [0.0, +8.0]; abs [0.0, +infinity] = [0.0, +infinity]; // regular values abs [0x123456789p-16, 0x123456799p-16] = [0x123456789p-16, 0x123456799p-16]; abs [-0x123456789p-16, 0x123456799p-16] = [0.0, 0x123456799p-16]; } testcase mpfi_acos { // special values acos [-1.0, 0.0] = [0x3243f6a8885a3p-49, 0x1921fb54442d19p-51]; acos [0.0, 0.0] = [0x3243f6a8885a3p-49, 0x1921fb54442d19p-52]; acos [0.0, +1.0] = [0.0, 0x1921fb54442d19p-52]; // regular values acos [-1.0, -0.5] = [0x10c152382d7365p-51, 0x1921fb54442d19p-51]; acos [-0.75, -0.25] = [0x1d2cf5c7c70f0bp-52, 0x4d6749be4edb1p-49]; acos [-0.5, 0.5] = [0x10c152382d7365p-52, 0x860a91c16b9b3p-50]; acos [0.25, 0.625] = [0x1ca94936b98a21p-53, 0x151700e0c14b25p-52]; acos [-1.0, 1.0] = [0.0, 0x1921fb54442d19p-51]; } testcase mpfi_acosh { // special values acosh [+1.0, +infinity] = [0.0, +infinity]; acosh [+1.5, +infinity] = [0x1ecc2caec51609p-53, +infinity]; // regular values acosh [1.0, 1.5] = [0.0, 0xf661657628b05p-52]; acosh [1.5, 1.5] = [0x1ecc2caec51609p-53, 0xf661657628b05p-52]; acosh [2.0, 1000.0] = [0x544909c66010dp-50, 0x799d4ba2a13b5p-48]; } testcase mpfi_add { // special values add [-infinity, -7.0] [-1.0, +8.0] = [-infinity, +1.0]; add [-infinity, 0.0] [+8.0, +infinity] = [entire]; add [-infinity, +8.0] [0.0, +8.0] = [-infinity, +16.0]; add [entire] [0.0, +8.0] = [entire]; add [0.0, 0.0] [-infinity, -7.0] = [-infinity, -7.0]; add [0.0, +8.0] [-7.0, 0.0] = [-7.0, +8.0]; add [0.0, 0.0] [0.0, +8.0] = [0.0, +8.0]; add [0.0, +infinity] [0.0, +8.0] = [0.0, +infinity]; add [0.0, 0.0] [+8.0, +infinity] = [+8.0, +infinity]; add [0.0, 0.0] [entire] = [entire]; add [0.0, +8.0] [0.0, +8.0] = [0.0, +16.0]; add [0.0, 0.0] [0.0, 0.0] = [0.0, 0.0]; add [0.0, +infinity] [-7.0, +8.0] = [-7.0, +infinity]; // regular values add [-0.375, -0x10187p-256] [-0.125, 0x1p-240] = [-0x1p-1, -0x187p-256]; add [-0x1p-300, 0x123456p+28] [-0x10000000000000p-93, 0x789abcdp0] = [-0x10000000000001p-93, 0x123456789abcdp0]; add [-4.0, +7.0] [-0x123456789abcdp-17, 3e300] = [-0x123456791abcdp-17, 0x8f596b3002c1bp+947]; add [0x1000100010001p+8, 0x1p+60] [0x1000100010001p0, 3.0e300] = [+0x1010101010101p+8, 0x8f596b3002c1bp+947]; // signed zeros add [+4.0, +8.0] [-4.0, -2.0] = [0.0, +6.0]; add [+4.0, +8.0] [-9.0, -8.0] = [-5.0, 0.0]; } testcase mpfi_add_d { // special values add [-infinity, -7.0] [-0x170ef54646d497p-107, -0x170ef54646d497p-107] = [-infinity, -7.0]; add [-infinity, -7.0] [0.0, 0.0] = [-infinity, -7.0]; add [-infinity, -7.0] [0x170ef54646d497p-107, 0x170ef54646d497p-107] = [-infinity, -0x1bffffffffffffp-50]; add [-infinity, 0.0] [-0x170ef54646d497p-106, -0x170ef54646d497p-106] = [-infinity, -8.0e-17]; add [-infinity, 0.0] [0.0, 0.0] = [-infinity, 0.0]; add [-infinity, 0.0] [0x170ef54646d497p-106, 0x170ef54646d497p-106] = [-infinity, 0x170ef54646d497p-106]; add [-infinity, 8.0] [-0x16345785d8a00000p0, -0x16345785d8a00000p0] = [-infinity, -0x16345785d89fff00p0]; add [-infinity, 8.0] [0.0, 0.0] = [-infinity, 8.0]; add [-infinity, 8.0] [0x16345785d8a00000p0, 0x16345785d8a00000p0] = [-infinity, 0x16345785d8a00100p0]; add [entire] [-0x170ef54646d497p-105, -0x170ef54646d497p-105] = [entire]; add [entire] [0.0e-17, 0.0e-17] = [entire]; add [entire] [+0x170ef54646d497p-105, +0x170ef54646d497p-105] = [entire]; add [0.0, 0.0] [-0x170ef54646d497p-109, -0x170ef54646d497p-109] = [-0x170ef54646d497p-109, -0x170ef54646d497p-109]; add [0.0, 0.0] [0.0, 0.0] = [0.0, 0.0]; add [0.0, 0.0] [0x170ef54646d497p-109, 0x170ef54646d497p-109] = [0x170ef54646d497p-109, 0x170ef54646d497p-109]; add [0.0, 8.0] [-0x114b37f4b51f71p-107, -0x114b37f4b51f71p-107] = [-0x114b37f4b51f71p-107, 8.0]; add [0.0, 8.0] [0.0, 0.0] = [0.0, 8.0]; add [0.0, 8.0] [0x114b37f4b51f7p-103, 0x114b37f4b51f7p-103] = [0x114b37f4b51f7p-103, 0x10000000000001p-49]; add [0.0, +infinity] [-0x50b45a75f7e81p-104, -0x50b45a75f7e81p-104] = [-0x50b45a75f7e81p-104, +infinity]; add [0.0, +infinity] [0.0, 0.0] = [0.0, +infinity]; add [0.0, +infinity] [0x142d169d7dfa03p-106, 0x142d169d7dfa03p-106] = [0x142d169d7dfa03p-106, +infinity]; // regular values add [-32.0, -17.0] [-0xfb53d14aa9c2fp-47, -0xfb53d14aa9c2fp-47] = [-0x1fb53d14aa9c2fp-47, -0x18353d14aa9c2fp-47]; add [-0xfb53d14aa9c2fp-47, -17.0] [0xfb53d14aa9c2fp-47, 0xfb53d14aa9c2fp-47] = [0.0, 0x7353d14aa9c2fp-47]; add [-32.0, -0xfb53d14aa9c2fp-48] [0xfb53d14aa9c2fp-48, 0xfb53d14aa9c2fp-48] = [-0x104ac2eb5563d1p-48, 0.0]; add [0x123456789abcdfp-48, 0x123456789abcdfp-4] [3.5, 3.5] = [0x15b456789abcdfp-48, 0x123456789abd17p-4]; add [0x123456789abcdfp-56, 0x123456789abcdfp-4] [3.5, 3.5] = [0x3923456789abcdp-52, 0x123456789abd17p-4]; add [-0xffp0, 0x123456789abcdfp-52] [256.5, 256.5] = [0x18p-4, 0x101a3456789abdp-44]; add [-0x1fffffffffffffp-52, -0x1p-550] [4097.5, 4097.5] = [0xfff8p-4, 0x10018p-4]; add [0x123456789abcdfp-48, 0x123456789abcdfp-4] [-3.5, -3.5] = [0xeb456789abcdfp-48, 0x123456789abca7p-4]; add [0x123456789abcdfp-56, 0x123456789abcdfp-4] [-3.5, -3.5] = [-0x36dcba98765434p-52, 0x123456789abca7p-4]; add [-0xffp0, 0x123456789abcdfp-52] [-256.5, -256.5] = [-0x1ff8p-4, -0xff5cba9876543p-44]; add [-0x1fffffffffffffp-52, -0x1p-550] [-4097.5, -4097.5] = [-0x10038p-4, -0x10018p-4]; } testcase mpfi_asin { // special values asin [-1.0, 0.0] = [-0x1921fb54442d19p-52, 0.0]; asin [0.0, 0.0] = [0.0, 0.0]; asin [0.0, +1.0] = [0.0, 0x1921fb54442d19p-52]; // regular values asin [-1.0, -0.5] = [-0x1921fb54442d19p-52, -0x10c152382d7365p-53]; asin [-0.75, -0.25] = [-0x1b235315c680ddp-53, -0x102be9ce0b87cdp-54]; asin [-0.5, 0.5] = [-0x860a91c16b9b3p-52, 0x860a91c16b9b3p-52]; asin [0.25, 0.625] = [0x102be9ce0b87cdp-54, 0x159aad71ced00fp-53]; asin [-1.0, 1.0] = [-0x1921fb54442d19p-52, 0x1921fb54442d19p-52]; } testcase mpfi_asinh { // special values asinh [-infinity, -7.0] = [-infinity, -0x152728c91b5f1dp-51]; asinh [-infinity, 0.0] = [-infinity, 0.0]; asinh [-infinity, +8.0] = [-infinity, 0x58d8dc657eaf5p-49]; asinh [entire] = [entire]; asinh [-1.0, 0.0] = [-0x1c34366179d427p-53, 0.0]; asinh [0.0, 0.0] = [0.0, 0.0]; asinh [0.0, +1.0] = [0.0, 0x1c34366179d427p-53]; asinh [0.0, +8.0] = [0.0, 0x58d8dc657eaf5p-49]; asinh [0.0, +infinity] = [0.0, +infinity]; // regular values asinh [-6.0, -4.0] = [-0x4fbca919fe219p-49, -0x10c1f8a6e80eebp-51]; asinh [-2.0, -0.5] = [-0x2e32430627a11p-49, -0x1ecc2caec51609p-54]; asinh [-1.0, -0.5] = [-0x1c34366179d427p-53, -0x1ecc2caec51609p-54]; asinh [-0.75, -0.25] = [-0x162e42fefa39fp-49, -0xfd67d91ccf31bp-54]; asinh [-0.5, 0.5] = [-0xf661657628b05p-53, 0xf661657628b05p-53]; asinh [0.25, 0.625] = [0xfd67d91ccf31bp-54, 0x4b89d40b2fecdp-51]; asinh [-1.0, 1.0] = [-0x1c34366179d427p-53, 0x1c34366179d427p-53]; asinh [0.125, 17.0] = [0xff5685b4cb4b9p-55, 0xe1be0ba541ef7p-50]; asinh [17.0, 42.0] = [0x1c37c174a83dedp-51, 0x8dca6976ad6bdp-49]; asinh [-42.0, 17.0] = [-0x8dca6976ad6bdp-49, 0xe1be0ba541ef7p-50]; } testcase mpfi_atan { // special values atan [-infinity, -7.0] = [-0x1921fb54442d19p-52, -0x5b7315eed597fp-50]; atan [-infinity, 0.0] = [-0x1921fb54442d19p-52, 0.0]; atan [-infinity, +8.0] = [-0x1921fb54442d19p-52, 0xb924fd54cb511p-51]; atan [entire] = [-0x1921fb54442d19p-52, 0x1921fb54442d19p-52]; atan [-1.0, 0.0] = [-0x1921fb54442d19p-53, 0.0]; atan [0.0, 0.0] = [0.0, 0.0]; atan [0.0, +1.0] = [0.0, 0x1921fb54442d19p-53]; atan [0.0, +8.0] = [0.0, 0xb924fd54cb511p-51]; atan [0.0, +infinity] = [0.0, 0x1921fb54442d19p-52]; // regular values atan [-6.0, -4.0] = [-0x167d8863bc99bdp-52, -0x54da32547a73fp-50]; atan [-2.0, -0.5] = [-0x11b6e192ebbe45p-52, -0x1dac670561bb4fp-54]; atan [-1.0, -0.5] = [-0x1921fb54442d19p-53, -0x1dac670561bb4fp-54]; atan [-0.75, -0.25] = [-0xa4bc7d1934f71p-52, -0x1f5b75f92c80ddp-55]; atan [-0.5, 0.5] = [-0x1dac670561bb5p-50, 0x1dac670561bb5p-50]; atan [0.25, 0.625] = [0x1f5b75f92c80ddp-55, 0x47802eaf7bfadp-51]; atan [-1.0, 1.0] = [-0x1921fb54442d19p-53, 0x1921fb54442d19p-53]; atan [0.125, 17.0] = [0x1fd5ba9aac2f6dp-56, 0x1831516233f561p-52]; atan [17.0, 42.0] = [0xc18a8b119fabp-47, 0x18c079f3350d27p-52]; atan [-42.0, 17.0] = [-0x18c079f3350d27p-52, 0x1831516233f561p-52]; } testcase mpfi_atan2 { // special values atan2 [-infinity, -7.0] [-1.0, +8.0] = [-0x6d9cc4b34bd0dp-50, -0x1700a7c5784633p-53]; atan2 [-infinity, 0.0] [+8.0, +infinity] = [-0x1921fb54442d19p-52, 0.0]; atan2 [-infinity, +8.0] [0.0, +8.0] = [-0x1921fb54442d19p-52, 0x1921fb54442d19p-52]; atan2 [entire] [0.0, +8.0] = [-0x1921fb54442d19p-52, 0x1921fb54442d19p-52]; atan2 [0.0, 0.0] [-infinity, -7.0] = [0x1921fb54442d18p-51, 0x1921fb54442d19p-51]; atan2 [0.0, +8.0] [-7.0, 0.0] = [0x3243f6a8885a3p-49, 0x1921fb54442d19p-51]; atan2 [0.0, 0.0] [0.0, +8.0] = [0.0, 0.0]; atan2 [0.0, +infinity] [0.0, +8.0] = [0.0, 0x1921fb54442d19p-52]; atan2 [0.0, 0.0] [+8.0, +infinity] = [0.0, 0.0]; atan2 [0.0, 0.0] [entire] = [0.0, 0x1921fb54442d19p-51]; atan2 [0.0, +8.0] [-7.0, +8.0] = [0.0, 0x1921fb54442d19p-51]; atan2 [0.0, 0.0] [0.0, 0.0] = [empty]; atan2 [0.0, +infinity] [0.0, +8.0] = [0.0, 0x1921fb54442d19p-52]; // regular values atan2 [-17.0, -5.0] [-4002.0, -1.0] = [-0x191f6c4c09a81bp-51, -0x1a12a5465464cfp-52]; atan2 [-17.0, -5.0] [1.0, 4002.0] = [-0x1831516233f561p-52, -0xa3c20ea13f5e5p-61]; atan2 [5.0, 17.0] [1.0, 4002.0] = [0xa3c20ea13f5e5p-61, 0x1831516233f561p-52]; atan2 [5.0, 17.0] [-4002.0, -1.0] = [0x1a12a5465464cfp-52, 0x191f6c4c09a81bp-51]; atan2 [-17.0, 5.0] [-4002.0, 1.0] = [-0x1921fb54442d19p-51, 0x1921fb54442d19p-51]; } testcase mpfi_atanh { // special values atanh [-1.0, 0.0] = [-infinity, 0.0]; atanh [0.0, 0.0] = [0.0, 0.0]; atanh [0.0, +1.0] = [0.0, +infinity]; // regular values atanh [-1.0, -0.5] = [-infinity, -0x8c9f53d568185p-52]; atanh [-0.75, -0.25] = [-0x3e44e55c64b4bp-50, -0x1058aefa811451p-54]; atanh [-0.5, 0.5] = [-0x1193ea7aad030bp-53, 0x1193ea7aad030bp-53]; atanh [0.25, 0.625] = [0x1058aefa811451p-54, 0x2eec3bb76c2b3p-50]; atanh [-1.0, 1.0] = [entire]; atanh [0.125, 1.0] = [0x1015891c9eaef7p-55, +infinity]; } testcase mpfi_bounded_p { // special values isCommonInterval [-infinity, -8.0] = false; isCommonInterval [-infinity, 0.0] = false; isCommonInterval [-infinity, 5.0] = false; isCommonInterval [entire] = false; isCommonInterval [-8.0, 0.0] = true; isCommonInterval [0.0, 0.0] = true; isCommonInterval [0.0, 5.0] = true; isCommonInterval [0.0, +infinity] = false; isCommonInterval [5.0, +infinity] = false; // regular values isCommonInterval [-34.0, -17.0] = true; isCommonInterval [-8.0, -1.0] = true; isCommonInterval [-34.0, 17.0] = true; isCommonInterval [-0x1921fb54442d18p-51, 0x1921fb54442d19p-51] = true; isCommonInterval [0x1921fb54442d18p-51, 0x1921fb54442d19p-51] = true; isCommonInterval [+8.0, +0x7fffffffffffbp+51] = true; isCommonInterval [+0x1fffffffffffffp-53, 2.0] = true; } testcase mpfi_cbrt { // special values cbrt [-infinity, -125.0] = [-infinity, -5.0]; cbrt [-infinity, 0.0] = [-infinity, 0.0]; cbrt [-infinity, +64.0] = [-infinity, +4.0]; cbrt [entire] = [entire]; cbrt [0.0, 0.0] = [0.0, 0.0]; cbrt [0.0, +27.0] = [0.0, +3.0]; cbrt [0.0, +infinity] = [0.0, +infinity]; // regular values cbrt [0x40p0, 0x7dp0] = [4.0, 5.0]; cbrt [-0x1856e4be527197p-354, 0xd8p0] = [-0x2e5e58c0083b7bp-154, 6.0]; cbrt [0x141a9019a2184dp-1047, 0xc29c78c66ac0fp-678] = [0x2b8172e535d44dp-385, 0x24cbd1c55aaa1p-258]; } testcase mpfi_cos { // special values cos [-infinity, -7.0] = [-1.0, 1.0]; cos [-infinity, 0.0] = [-1.0, 1.0]; cos [-infinity, +8.0] = [-1.0, 1.0]; cos [entire] = [-1.0, 1.0]; cos [-1.0, 0.0] = [0x114a280fb5068bp-53, 1.0]; cos [0.0, 0.0] = [1.0, 1.0]; cos [0.0, +1.0] = [0x114a280fb5068bp-53, 1.0]; cos [0.0, +8.0] = [-1.0, 1.0]; cos [0.0, +infinity] = [-1.0, 1.0]; // regular values cos [-2.0, -0.5] = [-0x1aa22657537205p-54, 0x1c1528065b7d5p-49]; cos [-1.0, -0.25] = [0x114a280fb5068bp-53, 0xf80aa4fbef751p-52]; cos [-0.5, 0.5] = [0x1c1528065b7d4fp-53, 1.0]; cos [-4.5, 0.625] = [-1.0, 1.0]; cos [1.0, 0x3243f6a8885a3p-48] = [-1.0, 0x4528a03ed41a3p-51]; cos [0.125, 17.0] = [-1.0, 1.0]; cos [17.0, 42.0] = [-1.0, 1.0]; cos [-7.0, 1.0] = [-1.0, 1.0]; cos [-7.0, 0.0] = [-1.0, 1.0]; cos [-7.0, -1.0] = [-1.0, 1.0]; cos [-7.0, -2.0] = [-1.0, 1.0]; cos [-7.0, -3.0] = [-1.0, 1.0]; cos [-7.0, -4.0] = [-0x14eaa606db24c1p-53, 1.0]; cos [-7.0, -5.0] = [0x122785706b4ad9p-54, 1.0]; cos [-7.0, -6.0] = [0x181ff79ed92017p-53, 1.0]; cos [-7.0, -7.0] = [0x181ff79ed92017p-53, 0x181ff79ed92018p-53]; cos [-6.0, 1.0] = [-1.0, 1.0]; cos [-6.0, 0.0] = [-1.0, 1.0]; cos [-6.0, -1.0] = [-1.0, 0x1eb9b7097822f6p-53]; cos [-6.0, -2.0] = [-1.0, 0x1eb9b7097822f6p-53]; cos [-6.0, -3.0] = [-1.0, 0x1eb9b7097822f6p-53]; cos [-6.0, -4.0] = [-0x14eaa606db24c1p-53, 0x1eb9b7097822f6p-53]; cos [-6.0, -5.0] = [0x122785706b4ad9p-54, 0x1eb9b7097822f6p-53]; cos [-6.0, -6.0] = [0x1eb9b7097822f5p-53, 0x1eb9b7097822f6p-53]; cos [-5.0, 1.0] = [-1.0, 1.0]; cos [-5.0, 0.0] = [-1.0, 1.0]; cos [-5.0, -1.0] = [-1.0, 0x114a280fb5068cp-53]; cos [-5.0, -2.0] = [-1.0, 0x122785706b4adap-54]; cos [-5.0, -3.0] = [-1.0, 0x122785706b4adap-54]; cos [-5.0, -4.0] = [-0x14eaa606db24c1p-53, 0x122785706b4adap-54]; cos [-5.0, -5.0] = [0x122785706b4ad9p-54, 0x122785706b4adap-54]; cos [-4.0, 1.0] = [-1.0, 1.0]; cos [-4.0, 0.0] = [-1.0, 1.0]; cos [-4.0, -1.0] = [-1.0, 0x114a280fb5068cp-53]; cos [-4.0, -2.0] = [-1.0, -0x1aa22657537204p-54]; cos [-4.0, -3.0] = [-1.0, -0x14eaa606db24c0p-53]; cos [-4.0, -4.0] = [-0x14eaa606db24c1p-53, -0x14eaa606db24c0p-53]; } testcase mpfi_cosh { // special values cosh [-infinity, -7.0] = [0x11228949ba3a8bp-43, +infinity]; cosh [-infinity, 0.0] = [1.0, +infinity]; cosh [-infinity, +8.0] = [1.0, +infinity]; cosh [entire] = [1.0, +infinity]; cosh [-1.0, 0.0] = [1.0, 0x18b07551d9f551p-52]; cosh [0.0, 0.0] = [1.0, 1.0]; cosh [0.0, +1.0] = [1.0, 0x18b07551d9f551p-52]; cosh [0.0, +8.0] = [1.0, 0x1749eaa93f4e77p-42]; cosh [0.0, +infinity] = [1.0, +infinity]; // regular values cosh [-0.125, 0.0] = [1.0, 0x10200aac16db6fp-52]; cosh [0.0, 0x10000000000001p-53] = [1.0, 0x120ac1862ae8d1p-52]; cosh [-4.5, -0.625] = [0x99d310a496b6dp-51, 0x1681ceb0641359p-47]; cosh [1.0, 3.0] = [0x18b07551d9f55p-48, 0x1422a497d6185fp-49]; cosh [17.0, 0xb145bb71d3dbp-38] = [0x1709348c0ea503p-29, 0x3ffffffffffa34p+968]; } testcase mpfi_cot { // special values cot [-infinity, -7.0] = [entire]; cot [-infinity, 0.0] = [entire]; cot [-infinity, +8.0] = [entire]; cot [entire] = [entire]; cot [-8.0, 0.0] = [entire]; cot [-3.0, 0.0] = [-infinity, 0xe07cf2eb32f0bp-49]; cot [-1.0, 0.0] = [-infinity, -0x148c05d04e1cfdp-53]; cot [0.0, +1.0] = [0x148c05d04e1cfdp-53, +infinity]; cot [0.0, +3.0] = [-0xe07cf2eb32f0bp-49, +infinity]; cot [0.0, +8.0] = [entire]; cot [0.0, +infinity] = [entire]; // regular values cot [-3.0, -2.0] = [0x1d4a42e92faa4dp-54, 0xe07cf2eb32f0bp-49]; cot [-3.0, -0x1921fb54442d19p-52] = [0x5cb3b399d747fp-103, 0xe07cf2eb32f0bp-49]; cot [-2.0, 0x1921fb54442d19p-52] = [entire]; cot [0.125, 0.5] = [0xea4d6bf23e051p-51, 0x1fd549f047f2bbp-50]; cot [0.125, 0x1921fb54442d19p-52] = [-0x172cece675d1fdp-105, 0x1fd549f047f2bbp-50]; cot [0x1921fb54442d19p-52, 4.0] = [entire]; cot [4.0, 0x3243f6a8885a3p-47] = [-0x1d02967c31cdb5p-1, 0x1ba35ba1c6b75dp-53]; cot [0x13a28c59d5433bp-44, 0x9d9462ceaa19dp-43] = [0x148c05d04e1fb7p-53, 0x1cefdde7c84c27p-4]; } testcase mpfi_coth { // special values coth [-infinity, -7.0] = [-0x100001be6c882fp-52, -1.0]; coth [-infinity, 0.0] = [-infinity, -1.0]; coth [-infinity, +8.0] = [entire]; coth [entire] = [entire]; coth [-8.0, 0.0] = [-infinity, -0x1000003c6ab7e7p-52]; coth [-3.0, 0.0] = [-infinity, -0x10145b3cc9964bp-52]; coth [-1.0, 0.0] = [-infinity, -0x150231499b6b1dp-52]; coth [0.0, 0.0] = [empty]; coth [0.0, +1.0] = [0x150231499b6b1dp-52, +infinity]; coth [0.0, +3.0] = [0x10145b3cc9964bp-52, +infinity]; coth [0.0, +8.0] = [0x1000003c6ab7e7p-52, +infinity]; coth [0.0, +infinity] = [1.0, +infinity]; // regular values coth [-3.0, 2.0] = [entire]; coth [-10.0, -8.0] = [-0x1000003c6ab7e8p-52, -0x100000011b4865p-52]; coth [7.0, 17.0] = [0x1000000000000fp-52, 0x100001be6c882fp-52]; coth [0x10000000000001p-58, 0x10000000000001p-53] = [0x114fc6ceb099bdp-51, 0x10005554fa502fp-46]; } testcase mpfi_csc { // special values csc [-infinity, -7.0] = [entire]; csc [-infinity, 0.0] = [entire]; csc [-infinity, 8.0] = [entire]; csc [entire] = [entire]; csc [-8.0, 0.0] = [entire]; csc [-3.0, 0.0] = [-infinity, -1.0]; csc [-1.0, 0.0] = [-infinity, -0x1303aa9620b223p-52]; csc [0.0, 0.0] = [empty]; csc [0.0, +1.0] = [0x1303aa9620b223p-52, +infinity]; csc [0.0, 3.0] = [1.0, +infinity]; csc [0.0, 8.0] = [entire]; csc [0.0, +infinity] = [entire]; // regular values csc [-6.0, 7.0] = [entire]; csc [-6.0, 6.0] = [entire]; csc [-6.0, 5.0] = [entire]; csc [-6.0, 4.0] = [entire]; csc [-6.0, 3.0] = [entire]; csc [-6.0, 2.0] = [entire]; csc [-6.0, 1.0] = [entire]; csc [-6.0, 0.0] = [entire]; csc [-6.0, -1.0] = [entire]; csc [-6.0, -2.0] = [entire]; csc [-6.0, -3.0] = [entire]; csc [-6.0, -4.0] = [1.0, 0x1ca19615f903dap-51]; csc [-6.0, -5.0] = [0x10af73f9df86b7p-52, 0x1ca19615f903dap-51]; csc [-6.0, -6.0] = [0x1ca19615f903d9p-51, 0x1ca19615f903dap-51]; csc [-5.0, 7.0] = [entire]; csc [-5.0, 6.0] = [entire]; csc [-5.0, 5.0] = [entire]; csc [-5.0, 4.0] = [entire]; csc [-5.0, 3.0] = [entire]; csc [-5.0, 2.0] = [entire]; csc [-5.0, 1.0] = [entire]; csc [-5.0, 0.0] = [entire]; csc [-5.0, -1.0] = [entire]; csc [-5.0, -2.0] = [entire]; csc [-5.0, -3.0] = [entire]; csc [-5.0, -4.0] = [1.0, 0x15243e8b2f4642p-52]; csc [-5.0, -5.0] = [0x10af73f9df86b7p-52, 0x10af73f9df86b8p-52]; csc [-4.0, 7.0] = [entire]; csc [-4.0, 6.0] = [entire]; csc [-4.0, 5.0] = [entire]; csc [-4.0, 4.0] = [entire]; csc [-4.0, 3.0] = [entire]; csc [-4.0, 2.0] = [entire]; csc [-4.0, 1.0] = [entire]; csc [-4.0, 0.0] = [entire]; csc [-4.0, -1.0] = [entire]; csc [-4.0, -2.0] = [entire]; csc [-4.0, -3.0] = [entire]; csc [-4.0, -4.0] = [0x15243e8b2f4641p-52, 0x15243e8b2f4642p-52]; csc [-3.0, 7.0] = [entire]; csc [-3.0, 6.0] = [entire]; csc [-3.0, 5.0] = [entire]; csc [-3.0, 4.0] = [entire]; csc [-3.0, 3.0] = [entire]; csc [-3.0, 2.0] = [entire]; csc [-3.0, 1.0] = [entire]; csc [-3.0, 0.0] = [-infinity, -1.0]; csc [-3.0, -1.0] = [-0x1c583c440ab0dap-50, -1.0]; csc [-3.0, -2.0] = [-0x1c583c440ab0dap-50, -0x119893a272f912p-52]; csc [-3.0, -3.0] = [-0x1c583c440ab0dap-50, -0x1c583c440ab0d9p-50]; csc [-2.0, 7.0] = [entire]; csc [-2.0, 6.0] = [entire]; csc [-2.0, 5.0] = [entire]; csc [-2.0, 4.0] = [entire]; csc [-2.0, 3.0] = [entire]; csc [-2.0, 2.0] = [entire]; csc [-2.0, 1.0] = [entire]; csc [-2.0, 0.0] = [-infinity, -1.0]; csc [-2.0, -1.0] = [-0x1303aa9620b224p-52, -1.0]; csc [-2.0, -2.0] = [-0x119893a272f913p-52, -0x119893a272f912p-52]; csc [-1.0, 7.0] = [entire]; csc [-1.0, 6.0] = [entire]; csc [-1.0, 5.0] = [entire]; csc [-1.0, 4.0] = [entire]; csc [-1.0, 3.0] = [entire]; csc [-1.0, 2.0] = [entire]; csc [-1.0, 1.0] = [entire]; csc [-1.0, 0.0] = [-infinity, -0x1303aa9620b223p-52]; csc [-1.0, -1.0] = [-0x1303aa9620b224p-52, -0x1303aa9620b223p-52]; csc [1.0, 7.0] = [entire]; csc [1.0, 6.0] = [entire]; csc [1.0, 5.0] = [entire]; csc [1.0, 4.0] = [entire]; csc [1.0, 3.0] = [1.0, 0x1c583c440ab0dap-50]; csc [1.0, 2.0] = [1.0, 0x1303aa9620b224p-52]; csc [1.0, 1.0] = [0x1303aa9620b223p-52, 0x1303aa9620b224p-52]; csc [2.0, 7.0] = [entire]; csc [2.0, 6.0] = [entire]; csc [2.0, 5.0] = [entire]; csc [2.0, 4.0] = [entire]; csc [2.0, 3.0] = [0x119893a272f912p-52, 0x1c583c440ab0dap-50]; csc [2.0, 2.0] = [0x119893a272f912p-52, 0x119893a272f913p-52]; csc [3.0, 7.0] = [entire]; csc [3.0, 6.0] = [entire]; csc [3.0, 5.0] = [entire]; csc [3.0, 4.0] = [entire]; csc [3.0, 3.0] = [0x1c583c440ab0d9p-50, 0x1c583c440ab0dap-50]; csc [4.0, 7.0] = [entire]; csc [4.0, 6.0] = [-0x1ca19615f903dap-51, -1.0]; csc [4.0, 5.0] = [-0x15243e8b2f4642p-52, -1.0]; csc [4.0, 4.0] = [-0x15243e8b2f4642p-52, -0x15243e8b2f4641p-52]; csc [5.0, 7.0] = [entire]; csc [5.0, 6.0] = [-0x1ca19615f903dap-51, -0x10af73f9df86b7p-52]; csc [5.0, 5.0] = [-0x10af73f9df86b8p-52, -0x10af73f9df86b7p-52]; csc [6.0, 7.0] = [entire]; csc [6.0, 6.0] = [-0x1ca19615f903dap-51, -0x1ca19615f903d9p-51]; csc [7.0, 7.0] = [+0x185a86a4ceb06cp-52, +0x185a86a4ceb06dp-52]; } testcase mpfi_csch { // special values csch [-infinity, -7.0] = [-0x1de16d3cffcd54p-62, 0.0]; csch [-infinity, 0.0] = [-infinity, 0.0]; csch [-infinity, +8.0] = [entire]; csch [entire] = [entire]; csch [-8.0, 0.0] = [-infinity, -0x15fc212d92371ap-63]; csch [-3.0, 0.0] = [-infinity, -0x198de80929b901p-56]; csch [-1.0, 0.0] = [-infinity, -0x1b3ab8a78b90c0p-53]; csch [0.0, 0.0] = [empty]; csch [0.0, +1.0] = [0x1b3ab8a78b90c0p-53, +infinity]; csch [0.0, +3.0] = [0x198de80929b901p-56, +infinity]; csch [0.0, +8.0] = [0x15fc212d92371ap-63, +infinity]; csch [0.0, +infinity] = [0.0, +infinity]; // regular values csch [-3.0, 2.0] = [entire]; csch [-10.0, -8.0] = [-0x15fc212d92371bp-63, -0x17cd79b63733a0p-66]; csch [7.0, 17.0] = [0x1639e3175a68a7p-76, 0x1de16d3cffcd54p-62]; csch [0x10000000000001p-58, 0x10000000000001p-53] = [0x1eb45dc88defeap-52, 0x3fff555693e722p-48]; } testcase mpfi_d_div { // special values div [-0x170ef54646d496p-107, -0x170ef54646d496p-107] [-infinity, -7.0] = [0.0, 0x1a5a3ce29a1787p-110]; div [0.0, 0.0] [-infinity, -7.0] = [0.0, 0.0]; div [0x170ef54646d496p-107, 0x170ef54646d496p-107] [-infinity, -7.0] = [-0x1a5a3ce29a1787p-110, 0.0]; div [-0x170ef54646d497p-106, -0x170ef54646d497p-106] [-infinity, 0.0] = [0.0, +infinity]; div [0.0, 0.0] [-infinity, 0.0] = [0.0, 0.0]; div [0x170ef54646d497p-106, 0x170ef54646d497p-106] [-infinity, 0.0] = [-infinity, 0.0]; div [-0x16345785d8a00000p0, -0x16345785d8a00000p0] [-infinity, 8.0] = [entire]; div [0.0, 0.0] [-infinity, 8.0] = [0.0, 0.0]; div [0x16345785d8a00000p0, 0x16345785d8a00000p0] [-infinity, 8.0] = [entire]; div [-0x170ef54646d497p-105, -0x170ef54646d497p-105] [entire] = [entire]; div [0.0e-17, 0.0e-17] [entire] = [0.0, 0.0]; div [+0x170ef54646d497p-105, +0x170ef54646d497p-105] [entire] = [entire]; div [-0x170ef54646d497p-109, -0x170ef54646d497p-109] [0.0, 0.0] = [empty]; div [0.0, 0.0] [0.0, 0.0] = [empty]; div [0x170ef54646d497p-109, 0x170ef54646d497p-109] [0.0, 0.0] = [empty]; div [-0x114b37f4b51f71p-107, -0x114b37f4b51f71p-107] [0.0, 7.0] = [-infinity, -0x13c3ada9f391a5p-110]; div [0.0, 0.0] [0.0, 7.0] = [0.0, 0.0]; div [0x114b37f4b51f71p-107, 0x114b37f4b51f71p-107] [0.0, 7.0] = [0x13c3ada9f391a5p-110, +infinity]; div [-0x50b45a75f7e81p-104, -0x50b45a75f7e81p-104] [0.0, +infinity] = [-infinity, 0.0]; div [0.0, 0.0] [0.0, +infinity] = [0.0, 0.0]; div [0x142d169d7dfa03p-106, 0x142d169d7dfa03p-106] [0.0, +infinity] = [0.0, +infinity]; // regular values div [-2.5, -2.5] [-8.0, 8.0] = [entire]; div [-2.5, -2.5] [-8.0, -5.0] = [0x5p-4, 0.5]; div [-2.5, -2.5] [25.0, 40.0] = [-0x1999999999999ap-56, -0x1p-4]; div [-2.5, -2.5] [-16.0, -7.0] = [0x5p-5, 0x16db6db6db6db7p-54]; div [-2.5, -2.5] [11.0, 143.0] = [-0x1d1745d1745d18p-55, -0x11e6efe35b4cfap-58]; div [33.125, 33.125] [8.28125, 530.0] = [0x1p-4, 4.0]; div [33.125, 33.125] [-530.0, -496.875] = [-0x11111111111112p-56, -0x1p-4]; div [33.125, 33.125] [54.0, 265.0] = [0.125, 0x13a12f684bda13p-53]; div [33.125, 33.125] [52.0, 54.0] = [0x13a12f684bda12p-53, 0x14627627627628p-53]; } testcase mpfi_diam_abs { // special values wid [-infinity, -8.0] = +infinity; wid [-infinity, 0.0] = +infinity; wid [-infinity, 5.0] = +infinity; wid [entire] = +infinity; wid [-infinity, 0.0] = +infinity; wid [-8.0, 0.0] = +8; wid [0.0, 0.0] = -0; wid [0.0, 5.0] = +5; wid [0.0, +infinity] = +infinity; // regular values wid [-34.0, -17.0] = 17; } testcase mpfi_div { // special values div [-infinity, -7.0] [-1.0, +8.0] = [entire]; div [-infinity, 0.0] [+8.0, +infinity] = [-infinity, 0.0]; div [-infinity, +8.0] [0.0, +8.0] = [entire]; div [entire] [0.0, +8.0] = [entire]; div [0.0, 0.0] [-infinity, -7.0] = [0.0, 0.0]; div [0.0, +8.0] [-7.0, 0.0] = [-infinity, 0.0]; div [0.0, 0.0] [0.0, +8.0] = [0.0, 0.0]; div [0.0, +infinity] [0.0, +8.0] = [0.0, +infinity]; div [0.0, 0.0] [+8.0, +infinity] = [0.0, 0.0]; div [0.0, 0.0] [entire] = [0.0, 0.0]; div [0.0, +8.0] [-7.0, +8.0] = [entire]; div [0.0, +infinity] [0.0, +8.0] = [0.0, +infinity]; // regular value div [-0x75bcd15p0, -0x754ep0] [-0x11ep0, -0x9p0] = [0x69p0, 0xd14fadp0]; div [-0x75bcd15p0, -0x1.489c07caba163p-4] [-0x2.e8e36e560704ap+4, -0x9p0] = [0x7.0ef61537b1704p-12, 0xd14fadp0]; div [-0x1.02f0415f9f596p+0, -0x754ep-16] [-0x11ep0, -0x7.62ce64fbacd2cp-8] = [0x69p-16, 0x2.30ee5eef9c36cp+4]; div [-0x1.02f0415f9f596p+0, -0x1.489c07caba163p-4] [-0x2.e8e36e560704ap+0, -0x7.62ce64fbacd2cp-8] = [0x7.0ef61537b1704p-8, 0x2.30ee5eef9c36cp+4]; div [-0xacbp+256, -0x6f9p0] [-0x7p0, 0.0] = [0xffp0, +infinity]; div [-0x100p0, -0xe.bb80d0a0824ep-4] [-0x1.7c6d760a831fap+0, 0.0] = [0x9.e9f24790445fp-4, +infinity]; div [-0x1.25f2d73472753p+0, -0x9.9a19fd3c1fc18p-4] [-0x9.3b0c8074ccc18p-4, +0x4.788df5d72af78p-4] = [entire]; div [-100.0, -15.0] [0.0, +3.0] = [-infinity, -5.0]; div [-2.0, -0x1.25f2d73472753p+0] [0.0, +0x9.3b0c8074ccc18p-4] = [-infinity, -0x1.fd8457415f917p+0]; div [-0x123456789p0, -0x754ep+4] [0x40bp0, 0x11ep+4] = [-0x480b3bp0, -0x69p0]; div [-0xd.67775e4b8588p-4, -0x754ep-53] [0x4.887091874ffc8p+0, 0x11ep+201] = [-0x2.f5008d2df94ccp-4, -0x69p-254]; div [-0x123456789p0, -0x1.b0a62934c76e9p+0] [0x40bp-17, 0x2.761ec797697a4p-4] = [-0x480b3bp+17, -0xa.fc5e7338f3e4p+0]; div [-0xd.67775e4b8588p+0, -0x1.b0a62934c76e9p+0] [0x4.887091874ffc8p-4, 0x2.761ec797697a4p+4] = [-0x2.f5008d2df94ccp+4, -0xa.fc5e7338f3e4p-8]; div [-0x75bcd15p0, 0.0] [-0x90p0, -0x9p0] = [0.0, 0xd14fadp0]; div [-0x1.4298b2138f2a7p-4, 0.0] [-0x1p-8, -0xf.5e4900c9c19fp-12] = [0.0, 0x1.4fdb41a33d6cep+4]; div [-0xeeeeeeeeep0, 0.0] [-0xaaaaaaaaap0, 0.0] = [0.0, +infinity]; div [-0x1.25f2d73472753p+0, 0.0] [-0x9.3b0c8074ccc18p-4, +0x4.788df5d72af78p-4] = [entire]; div [-0xeeeeeeeeep0, 0.0] [0.0, +0x3p0] = [-infinity, 0.0]; div [-0x75bcd15p0, 0.0] [0x9p0, 0x90p0] = [-0xd14fadp0, 0.0]; div [-0x1.4298b2138f2a7p-4, 0.0] [0xf.5e4900c9c19fp-12, 0x9p0] = [-0x1.4fdb41a33d6cep+4, 0.0]; div [-0x75bcd15p0, 0xa680p0] [-0xaf6p0, -0x9p0] = [-0x1280p0, 0xd14fadp0]; div [-0x12p0, 0x10p0] [-0xbbbbbbbbbbp0, -0x9p0] = [-0x1.c71c71c71c71dp0, 2.0]; div [-0x1p0, 0x754ep-16] [-0xccccccccccp0, -0x11ep0] = [-0x69p-16, 0xe.525982af70c9p-12]; div [-0xb.5b90b4d32136p-4, 0x6.e694ac6767394p+0] [-0xdddddddddddp0, -0xc.f459be9e80108p-4] = [-0x8.85e40b3c3f63p+0, 0xe.071cbfa1de788p-4]; div [-0xacbp+256, 0x6f9p0] [-0x7p0, 0.0] = [entire]; div [-0x1.25f2d73472753p+0, +0x9.9a19fd3c1fc18p-4] [-0x9.3b0c8074ccc18p-4, +0x4.788df5d72af78p-4] = [entire]; div [0.0, +15.0] [-3.0, +3.0] = [entire]; div [-0x754ep0, 0xd0e9dc4p+12] [0x11ep0, 0xbbbp0] = [-0x69p0, 0xbaffep+12]; div [-0x10p0, 0xd0e9dc4p+12] [0x11ep0, 0xbbbp0] = [-0xe.525982af70c9p-8, 0xbaffep+12]; div [-0x754ep0, 0x1p+10] [0x11ep0, 0xbbbp0] = [-0x69p0, 0xe.525982af70c9p-2]; div [-0x1.18333622af827p+0, 0x2.14b836907297p+0] [0x1.263147d1f4bcbp+0, 0x111p0] = [-0xf.3d2f5db8ec728p-4, 0x1.cf8fa732de129p+0]; div [0.0, 0x75bcd15p0] [-0xap0, -0x9p0] = [-0xd14fadp0, 0.0]; div [0.0, 0x1.acbf1702af6edp+0] [-0x0.fp0, -0xe.3d7a59e2bdacp-4] = [-0x1.e1bb896bfda07p+0, 0.0]; div [0.0, 0xap0] [-0x9p0, 0.0] = [-infinity, 0.0]; div [0.0, 0xap0] [-1.0, +1.0] = [entire]; div [0.0, 0x75bcd15p0] [+0x9p0, +0xap0] = [0.0, 0xd14fadp0]; div [0.0, 0x1.5f6b03dc8c66fp+0] [+0x2.39ad24e812dcep+0, 0xap0] = [0.0, 0x9.deb65b02baep-4]; div [0x754ep0, 0x75bcd15p0] [-0x11ep0, -0x9p0] = [-0xd14fadp0, -0x69p0]; div [0x754ep-16, 0x1.008a3accc766dp+4] [-0x11ep0, -0x2.497403b31d32ap+0] = [-0x7.02d3edfbc8b6p+0, -0x69p-16]; div [0x9.ac412ff1f1478p-4, 0x75bcd15p0] [-0x1.5232c83a0e726p+4, -0x9p0] = [-0xd14fadp0, -0x7.52680a49e5d68p-8]; div [0xe.1552a314d629p-4, 0x1.064c5adfd0042p+0] [-0x5.0d4d319a50b04p-4, -0x2.d8f51df1e322ep-4] = [-0x5.c1d97d57d81ccp+0, -0x2.c9a600c455f5ap+0]; div [0x754ep0, 0xeeeep0] [-0x11ep0, 0.0] = [-infinity, -0x69p0]; div [0x1.a9016514490e6p-4, 0xeeeep0] [-0xe.316e87be0b24p-4, 0.0] = [-infinity, -0x1.df1cc82e6a583p-4]; div [5.0, 6.0] [-0x5.0d4d319a50b04p-4, 0x2.d8f51df1e322ep-4] = [entire]; div [0x754ep0, +0xeeeeep0] [0.0, +0x11ep0] = [0x69p0, +infinity]; div [0x1.7f03f2a978865p+0, 0xeeeeep0] [0.0, 0x1.48b08624606b9p+0] = [0x1.2a4fcda56843p+0, +infinity]; div [0x5efc1492p0, 0x1ba2dc763p0] [0x2fdd1fp0, 0x889b71p0] = [0xb2p0, 0x93dp0]; div [0x1.d7c06f9ff0706p-8, 0x1ba2dc763p0] [0x2fdd1fp-20, 0xe.3d7a59e2bdacp+0] = [0x2.120d75be74b54p-12, 0x93dp+20]; div [0x5.efc1492p-4, 0x1.008a3accc766dp+0] [0x2.497403b31d32ap+0, 0x8.89b71p+0] = [0xb.2p-8, 0x7.02d3edfbc8b6p-4]; div [0x8.440e7d65be6bp-8, 0x3.99982e9eae09ep+0] [0x8.29fa8d0659e48p-4, 0xc.13d2fd762e4a8p-4] = [0xa.f3518768b206p-8, 0x7.0e2acad54859cp+0]; } testcase mpfi_div_d { // special values div [-infinity, -7.0] [-7.0, -7.0] = [1.0, +infinity]; div [-infinity, -7.0] [0.0, 0.0] = [empty]; div [-infinity, -7.0] [7.0, 7.0] = [-infinity, -1.0]; div [-infinity, 0.0] [-0x170ef54646d497p-106, -0x170ef54646d497p-106] = [0.0, +infinity]; div [-infinity, 0.0] [0x170ef54646d497p-106, 0x170ef54646d497p-106] = [-infinity, 0.0]; div [-infinity, 8.0] [-3.0, -3.0] = [-0x15555555555556p-51, +infinity]; div [-infinity, 8.0] [0.0, 0.0] = [empty]; div [-infinity, 8.0] [3.0, 3.0] = [-infinity, 0x15555555555556p-51]; div [entire] [-0x170ef54646d497p-105, -0x170ef54646d497p-105] = [entire]; div [entire] [0.0e-17, 0.0e-17] = [empty]; div [entire] [+0x170ef54646d497p-105, +0x170ef54646d497p-105] = [entire]; div [0.0, 0.0] [-0x170ef54646d497p-109, -0x170ef54646d497p-109] = [0.0, 0.0]; div [0.0, 0.0] [0x170ef54646d497p-109, 0x170ef54646d497p-109] = [0.0, 0.0]; div [0.0, 8.0] [-0x114b37f4b51f71p-107, -0x114b37f4b51f71p-107] = [-0x1d9b1f5d20d556p+5, 0.0]; div [0.0, 8.0] [0x114b37f4b51f71p-107, 0x114b37f4b51f71p-107] = [0.0, 0x1d9b1f5d20d556p+5]; div [0.0, +infinity] [-0x50b45a75f7e81p-104, -0x50b45a75f7e81p-104] = [-infinity, 0.0]; div [0.0, +infinity] [0x142d169d7dfa03p-106, 0x142d169d7dfa03p-106] = [0.0, +infinity]; // regular values div [-0x10000000000001p-20, -0x10000000000001p-53] [-1.0, -1.0] = [0x10000000000001p-53, 0x10000000000001p-20]; div [-0x10000000000002p-20, -0x10000000000001p-53] [0x10000000000001p-53, 0x10000000000001p-53] = [-0x10000000000001p-19, -1.0]; div [-0x10000000000001p-20, -0x10000020000001p-53] [0x10000000000001p-53, 0x10000000000001p-53] = [-0x1p+33, -0x1000001fffffffp-52]; div [-0x10000000000002p-20, -0x10000020000001p-53] [0x10000000000001p-53, 0x10000000000001p-53] = [-0x10000000000001p-19, -0x1000001fffffffp-52]; div [-0x123456789abcdfp-53, 0x123456789abcdfp-7] [-0x123456789abcdfp0, -0x123456789abcdfp0] = [-0x1p-7, 0x1p-53]; div [-0x123456789abcdfp-53, 0x10000000000001p-53] [-0x123456789abcdfp0, -0x123456789abcdfp0] = [-0x1c200000000002p-106, 0x1p-53]; div [-1.0, 0x123456789abcdfp-7] [-0x123456789abcdfp0, -0x123456789abcdfp0] = [-0x1p-7, 0x1c200000000001p-105]; div [-1.0, 0x10000000000001p-53] [-0x123456789abcdfp0, -0x123456789abcdfp0] = [-0x1c200000000002p-106, 0x1c200000000001p-105]; } testcase mpfi_d_sub { // special values sub [-0x170ef54646d497p-107, -0x170ef54646d497p-107] [-infinity, -7.0] = [0x1bffffffffffffp-50, +infinity]; sub [0.0, 0.0] [-infinity, -7.0] = [7.0, +infinity]; sub [0x170ef54646d497p-107, 0x170ef54646d497p-107] [-infinity, -7.0] = [7.0, +infinity]; sub [-0x170ef54646d497p-96, -0x170ef54646d497p-96] [-infinity, 0.0] = [-0x170ef54646d497p-96, +infinity]; sub [0.0, 0.0] [-infinity, 0.0] = [0.0, +infinity]; sub [0x170ef54646d497p-96, 0x170ef54646d497p-96] [-infinity, 0.0] = [0x170ef54646d497p-96, +infinity]; sub [-0x16345785d8a00000p0, -0x16345785d8a00000p0] [-infinity, 8.0] = [-0x16345785d8a00100p0, +infinity]; sub [0.0, 0.0] [-infinity, 8.0] = [-8.0, +infinity]; sub [0x16345785d8a00000p0, 0x16345785d8a00000p0] [-infinity, 8.0] = [0x16345785d89fff00p0, +infinity]; sub [-0x170ef54646d497p-105, -0x170ef54646d497p-105] [entire] = [entire]; sub [0.0e-17, 0.0e-17] [entire] = [entire]; sub [0x170ef54646d497p-105, 0x170ef54646d497p-105] [entire] = [entire]; sub [-0x170ef54646d497p-109, -0x170ef54646d497p-109] [0.0, 0.0] = [-0x170ef54646d497p-109, -0x170ef54646d497p-109]; sub [0.0, 0.0] [0.0, 0.0] = [0.0, 0.0]; sub [0x170ef54646d497p-109, 0x170ef54646d497p-109] [0.0, 0.0] = [0x170ef54646d497p-109, 0x170ef54646d497p-109]; sub [-0x114b37f4b51f71p-107, -0x114b37f4b51f71p-107] [0.0, 8.0] = [-0x10000000000001p-49, -0x114b37f4b51f71p-107]; sub [0.0, 0.0] [0.0, 8.0] = [-8.0, 0.0]; sub [0x114b37f4b51f71p-107, 0x114b37f4b51f71p-107] [0.0, 8.0] = [-8.0, 0x114b37f4b51f71p-107]; sub [-0x50b45a75f7e81p-104, -0x50b45a75f7e81p-104] [0.0, +infinity] = [-infinity, -0x50b45a75f7e81p-104]; sub [0.0, 0.0] [0.0, +infinity] = [-infinity, 0.0]; sub [-0x142d169d7dfa03p-106, -0x142d169d7dfa03p-106] [0.0, +infinity] = [-infinity, -0x142d169d7dfa03p-106]; // regular values sub [-0xfb53d14aa9c2fp-47, -0xfb53d14aa9c2fp-47] [17.0, 32.0] = [-0x1fb53d14aa9c2fp-47, -0x18353d14aa9c2fp-47]; sub [0xfb53d14aa9c2fp-47, 0xfb53d14aa9c2fp-47] [17.0, 0xfb53d14aa9c2fp-47] = [0.0, 0x7353d14aa9c2fp-47]; sub [0xfb53d14aa9c2fp-48, 0xfb53d14aa9c2fp-48] [0xfb53d14aa9c2fp-48, 32.0] = [-0x104ac2eb5563d1p-48, 0.0]; sub [3.5, 3.5] [-0x123456789abcdfp-4, -0x123456789abcdfp-48] = [0x15b456789abcdfp-48, 0x123456789abd17p-4]; sub [3.5, 3.5] [-0x123456789abcdfp-4, -0x123456789abcdfp-56] = [0x3923456789abcdp-52, 0x123456789abd17p-4]; sub [256.5, 256.5] [-0x123456789abcdfp-52, 0xffp0] = [0x18p-4, 0x101a3456789abdp-44]; sub [4097.5, 4097.5] [0x1p-550, 0x1fffffffffffffp-52] = [0xfff8p-4, 0x10018p-4]; sub [-3.5, -3.5] [-0x123456789abcdfp-4, -0x123456789abcdfp-48] = [0xeb456789abcdfp-48, 0x123456789abca7p-4]; sub [-3.5, -3.5] [-0x123456789abcdfp-4, -0x123456789abcdfp-56] = [-0x36dcba98765434p-52, 0x123456789abca7p-4]; sub [-256.5, -256.5] [-0x123456789abcdfp-52, 0xffp0] = [-0x1ff8p-4, -0xff5cba9876543p-44]; sub [-4097.5, -4097.5] [0x1p-550, 0x1fffffffffffffp-52] = [-0x10038p-4, -0x10018p-4]; } testcase mpfi_exp { // special values exp [-infinity, -7.0] = [0.0, 0x1de16b9c24a98fp-63]; exp [-infinity, 0.0] = [0.0, 1.0]; exp [-infinity, +1.0] = [0.0, 0x15bf0a8b14576ap-51]; exp [entire] = [0.0, +infinity]; exp [0.0, 0.0] = [1.0, 1.0]; exp [0.0, +1.0] = [1.0, 0x15bf0a8b14576ap-51]; exp [0.0, +infinity] = [1.0, +infinity]; // regular values exp [-123.0, -17.0] = [0x1766b45dd84f17p-230, 0x1639e3175a689dp-77]; exp [-0.125, 0.25] = [0x1c3d6a24ed8221p-53, 0x148b5e3c3e8187p-52]; exp [-0.125, 0.0] = [0x1c3d6a24ed8221p-53, 1.0]; exp [0.0, 0.25] = [1.0, 0x148b5e3c3e8187p-52]; exp [0xap-47, 0xbp-47] = [0x10000000000140p-52, 0x10000000000161p-52]; } testcase mpfi_exp2 { // special values exp2 [-infinity, -1.0] = [0.0, 0.5]; exp2 [-infinity, 0.0] = [0.0, 1.0]; exp2 [-infinity, 1.0] = [0.0, 2.0]; exp2 [entire] = [0.0, +infinity]; exp2 [0.0, 0.0] = [1.0, 1.0]; exp2 [0.0, +1.0] = [1.0, 2.0]; exp2 [0.0, +infinity] = [1.0, +infinity]; // regular values exp2 [-123.0, -17.0] = [0x1p-123, 0x1p-17]; exp2 [-7.0, 7.0] = [0x1p-7, 0x1p+7]; exp2 [-0.125, 0.25] = [0x1d5818dcfba487p-53, 0x1306fe0a31b716p-52]; exp2 [-0.125, 0.0] = [0x1d5818dcfba487p-53, 1.0]; exp2 [0.0, 0.25] = [1.0, 0x1306fe0a31b716p-52]; exp2 [0xap-47, 0xbp-47] = [0x100000000000ddp-52, 0x100000000000f4p-52]; } testcase mpfi_expm1 { // special values expm1 [-infinity, -7.0] = [-1.0, -0x1ff887a518f6d5p-53]; expm1 [-infinity, 0.0] = [-1.0, 0.0]; expm1 [-infinity, 1.0] = [-1.0, 0x1b7e151628aed3p-52]; expm1 [entire] = [-1.0, +infinity]; expm1 [0.0, 0.0] = [0.0, 0.0]; expm1 [0.0, 1.0] = [0.0, 0x1b7e151628aed3p-52]; expm1 [0.0, +infinity] = [0.0, +infinity]; // regular values expm1 [-36.0, -36.0] = [-0x1ffffffffffffep-53, -0x1ffffffffffffdp-53]; expm1 [-0.125, 0.25] = [-0x1e14aed893eef4p-56, 0x122d78f0fa061ap-54]; expm1 [-0.125, 0.0] = [-0x1e14aed893eef4p-56, 0.0]; expm1 [0.0, 0.25] = [0.0, 0x122d78f0fa061ap-54]; expm1 [0xap-47, 0xbp-47] = [0x140000000000c8p-96, 0x160000000000f3p-96]; } testcase mpfi_hypot { // special values hypot [-infinity, -7.0] [-1.0, 8.0] = [7.0, +infinity]; hypot [-infinity, 0.0] [8.0, +infinity] = [8.0, +infinity]; hypot [-infinity, 8.0] [0.0, 8.0] = [0.0, +infinity]; hypot [entire] [0.0, 8.0] = [0.0, +infinity]; hypot [0.0, 0.0] [-infinity, -7.0] = [7.0, +infinity]; hypot [0.0, 3.0] [-4.0, 0.0] = [0.0, 5.0]; hypot [0.0, 0.0] [0.0, 8.0] = [0.0, 8.0]; hypot [0.0, +infinity] [0.0, 8.0] = [0.0, +infinity]; hypot [0.0, 0.0] [8.0, +infinity] = [8.0, +infinity]; hypot [0.0, 0.0] [entire] = [0.0, +infinity]; hypot [0.0, 5.0] [0.0, 12.0] = [0.0, 13.0]; hypot [0.0, 0.0] [0.0, 0.0] = [0.0, 0.0]; hypot [0.0, +infinity] [-7.0, 8.0] = [0.0, +infinity]; // regular values hypot [-12.0, -5.0] [-35.0, -12.0] = [13.0, 37.0]; hypot [6.0, 7.0] [1.0, 24.0] = [0x1854bfb363dc39p-50, 25.0]; hypot [-4.0, +7.0] [-25.0, 3.0] = [0.0, 0x19f625847a5899p-48]; hypot [0x1854bfb363dc39p-50, 0x19f625847a5899p-48] [0x1854bfb363dc39p-50, 0x19f625847a5899p-48] = [0x113463fa37014dp-49, 0x125b89092b8fc0p-47]; } testcase mpfi_intersect { // special values intersection [-infinity, -7.0] [-1.0, +8.0] = [empty]; intersection [-infinity, 0.0] [+8.0, +infinity] = [empty]; intersection [-infinity, +8.0] [0.0, +8.0] = [0.0, +8.0]; intersection [entire] [0.0, +8.0] = [0.0, +8.0]; intersection [0.0, 0.0] [-infinity, -7.0] = [empty]; intersection [0.0, +8.0] [-7.0, 0.0] = [0.0, 0.0]; intersection [0.0, 0.0] [0.0, +8.0] = [0.0, 0.0]; intersection [0.0, +infinity] [0.0, +8.0] = [0.0, +8.0]; intersection [0.0, 0.0] [+8.0, +infinity] = [empty]; intersection [0.0, 0.0] [entire] = [0.0, 0.0]; intersection [0.0, +8.0] [-7.0, +8.0] = [0.0, +8.0]; intersection [0.0, 0.0] [0.0, 0.0] = [0.0, 0.0]; intersection [0.0, +infinity] [0.0, +8.0] = [0.0, +8.0]; // regular values intersection [0x12p0, 0x90p0] [-0x0dp0, 0x34p0] = [0x12p0, 0x34p0]; } testcase mpfi_inv { // special values recip [-infinity, -.25] = [-4.0, 0.0]; recip [-infinity, 0.0] = [-infinity, 0.0]; recip [-infinity, +4.0] = [entire]; recip [entire] = [entire]; recip [0.0, 0.0] = [empty]; recip [0.0, +2.0] = [+.5, +infinity]; recip [0.0, +infinity] = [0.0, +infinity]; // regular values recip [-8.0, -2.0] = [-.5, -0.125]; recip [0x1p-4, 0x1440c131282cd9p-53] = [0x1947bfce1bc417p-52, 0x10p0]; recip [0x19f1a539c91fddp-55, +64.0] = [0.015625, 0x13bc205a76b3fdp-50]; recip [-0xae83b95effd69p-52, -0x63e3cb4ed72a3p-53] = [-0x1480a9b5772a23p-50, -0x177887d65484c9p-52]; } testcase mpfi_is_neg { // special values precedes [-infinity, -8.0] [0.0, 0.0] = true; precedes [-infinity, 0.0] [0.0, 0.0] = true; precedes [-infinity, 5.0] [0.0, 0.0] = false; precedes [entire] [0.0, 0.0] = false; precedes [-8.0, 0.0] [0.0, 0.0] = true; precedes [0.0, 0.0] [0.0, 0.0] = true; precedes [0.0, 5.0] [0.0, 0.0] = false; precedes [0.0, +infinity] [0.0, 0.0] = false; precedes [5.0, +infinity] [0.0, 0.0] = false; // regular values precedes [-34.0, -17.0] [0.0, 0.0] = true; precedes [-8.0, -1.0] [0.0, 0.0] = true; precedes [-34.0, 17.0] [0.0, 0.0] = false; precedes [-0x1921fb54442d18p-51, 0x1921fb54442d19p-51] [0.0, 0.0] = false; precedes [0x1921fb54442d18p-51, 0x1921fb54442d19p-51] [0.0, 0.0] = false; precedes [+8.0, +0x7fffffffffffbp+51] [0.0, 0.0] = false; precedes [+0x1fffffffffffffp-53, 2.0] [0.0, 0.0] = false; } testcase mpfi_is_nonneg { // special values less [0.0, 0.0] [-infinity, -8.0] = false; less [0.0, 0.0] [-infinity, 0.0] = false; less [0.0, 0.0] [-infinity, 5.0] = false; less [0.0, 0.0] [entire] = false; less [0.0, 0.0] [-8.0, 0.0] = false; less [0.0, 0.0] [0.0, 0.0] = true; less [0.0, 0.0] [0.0, 5.0] = true; less [0.0, 0.0] [0.0, +infinity] = true; less [0.0, 0.0] [5.0, +infinity] = true; // regular values less [0.0, 0.0] [-34.0, -17.0] = false; less [0.0, 0.0] [-8.0, -1.0] = false; less [0.0, 0.0] [-34.0, 17.0] = false; less [0.0, 0.0] [-0x1921fb54442d18p-51, 0x1921fb54442d19p-51] = false; less [0.0, 0.0] [0x1921fb54442d18p-51, 0x1921fb54442d19p-51] = true; less [0.0, 0.0] [+8.0, +0x7fffffffffffbp+51] = true; less [0.0, 0.0] [+0x1fffffffffffffp-53, 2.0] = true; } testcase mpfi_is_nonpos { // special values less [-infinity, -8.0] [0.0, 0.0] = true; less [-infinity, 0.0] [0.0, 0.0] = true; less [-infinity, 5.0] [0.0, 0.0] = false; less [entire] [0.0, 0.0] = false; less [-8.0, 0.0] [0.0, 0.0] = true; less [0.0, 0.0] [0.0, 0.0] = true; less [0.0, 5.0] [0.0, 0.0] = false; less [0.0, +infinity] [0.0, 0.0] = false; less [5.0, +infinity] [0.0, 0.0] = false; // regular values less [-34.0, -17.0] [0.0, 0.0] = true; less [-8.0, -1.0] [0.0, 0.0] = true; less [-34.0, 17.0] [0.0, 0.0] = false; less [-0x1921fb54442d18p-51, 0x1921fb54442d19p-51] [0.0, 0.0] = false; less [0x1921fb54442d18p-51, 0x1921fb54442d19p-51] [0.0, 0.0] = false; less [8.0, 0x7fffffffffffbp+51] [0.0, 0.0] = false; less [0x1fffffffffffffp-53, 2.0] [0.0, 0.0] = false; } testcase mpfi_is_pos { // special values precedes [0.0, 0.0] [-infinity, -8.0] = false; precedes [0.0, 0.0] [-infinity, 0.0] = false; precedes [0.0, 0.0] [-infinity, 5.0] = false; precedes [0.0, 0.0] [entire] = false; precedes [0.0, 0.0] [-8.0, 0.0] = false; precedes [0.0, 0.0] [0.0, 0.0] = true; precedes [0.0, 0.0] [0.0, 5.0] = true; precedes [0.0, 0.0] [0.0, +infinity] = true; precedes [0.0, 0.0] [5.0, +infinity] = true; // regular values precedes [0.0, 0.0] [-34.0, -17.0] = false; precedes [0.0, 0.0] [-8.0, -1.0] = false; precedes [0.0, 0.0] [-34.0, 17.0] = false; precedes [0.0, 0.0] [-0x1921fb54442d18p-51, 0x1921fb54442d19p-51] = false; precedes [0.0, 0.0] [0x1921fb54442d18p-51, 0x1921fb54442d19p-51] = true; precedes [0.0, 0.0] [+8.0, +0x7fffffffffffbp+51] = true; precedes [0.0, 0.0] [+0x1fffffffffffffp-53, 2.0] = true; } testcase mpfi_is_strictly_neg { // special values strictPrecedes [-infinity, -8.0] [0.0, 0.0] = true; strictPrecedes [-infinity, 0.0] [0.0, 0.0] = false; strictPrecedes [-infinity, 5.0] [0.0, 0.0] = false; strictPrecedes [entire] [0.0, 0.0] = false; strictPrecedes [-8.0, 0.0] [0.0, 0.0] = false; strictPrecedes [0.0, 0.0] [0.0, 0.0] = false; strictPrecedes [0.0, 5.0] [0.0, 0.0] = false; strictPrecedes [0.0, +infinity] [0.0, 0.0] = false; strictPrecedes [5.0, +infinity] [0.0, 0.0] = false; // regular values strictPrecedes [-34.0, -17.0] [0.0, 0.0] = true; strictPrecedes [-8.0, -1.0] [0.0, 0.0] = true; strictPrecedes [-34.0, 17.0] [0.0, 0.0] = false; strictPrecedes [-0x1921fb54442d18p-51, 0x1921fb54442d19p-51] [0.0, 0.0] = false; strictPrecedes [0x1921fb54442d18p-51, 0x1921fb54442d19p-51] [0.0, 0.0] = false; strictPrecedes [+8.0, +0x7fffffffffffbp+51] [0.0, 0.0] = false; strictPrecedes [+0x1fffffffffffffp-53, 2.0] [0.0, 0.0] = false; } testcase mpfi_is_strictly_pos { // special values strictPrecedes [0.0, 0.0] [-infinity, -8.0] = false; strictPrecedes [0.0, 0.0] [-infinity, 0.0] = false; strictPrecedes [0.0, 0.0] [-infinity, 5.0] = false; strictPrecedes [0.0, 0.0] [entire] = false; strictPrecedes [0.0, 0.0] [-8.0, 0.0] = false; strictPrecedes [0.0, 0.0] [0.0, 0.0] = false; strictPrecedes [0.0, 0.0] [0.0, 5.0] = false; strictPrecedes [0.0, 0.0] [0.0, +infinity] = false; strictPrecedes [0.0, 0.0] [5.0, +infinity] = true; // regular values strictPrecedes [0.0, 0.0] [-34.0, -17.0] = false; strictPrecedes [0.0, 0.0] [-8.0, -1.0] = false; strictPrecedes [0.0, 0.0] [-34.0, 17.0] = false; strictPrecedes [0.0, 0.0] [-0x1921fb54442d18p-51, 0x1921fb54442d19p-51] = false; strictPrecedes [0.0, 0.0] [0x1921fb54442d18p-51, 0x1921fb54442d19p-51] = true; strictPrecedes [0.0, 0.0] [+8.0, +0x7fffffffffffbp+51] = true; strictPrecedes [0.0, 0.0] [+0x1fffffffffffffp-53, 2.0] = true; } testcase mpfi_log { // special values log [0.0, +1.0] = [-infinity, 0.0]; log [0.0, +infinity] = [entire]; // regular values log [+1.0, +1.0] = [0.0, 0.0]; log [0x3a2a08c23afe3p-14, 0x1463ceb440d6bdp-14] = [0xc6dc8a2928579p-47, 0x1a9500bc7ffcc5p-48]; log [0xb616ab8b683b5p-52, +1.0] = [-0x2b9b8b1fb2fb9p-51, 0.0]; log [+1.0, 0x8ac74d932fae3p-21] = [0.0, 0x5380455576989p-46]; log [0x4c322657ec89bp-16, 0x4d68ba5f26bf1p-11] = [0xbdee7228cfedfp-47, 0x1b3913fc99f555p-48]; } testcase mpfi_log1p { // special values logp1 [-1.0, 0.0] = [-infinity, 0.0]; logp1 [0.0, 0.0] = [0.0, 0.0]; logp1 [0.0, 1.0] = [0.0, 0x162e42fefa39f0p-53]; logp1 [0.0, +infinity] = [0.0, +infinity]; // regular values logp1 [-0xb616ab8b683b5p-52, 0.0] = [-0x13e080325bab7bp-52, 0.0]; logp1 [0.0, 0x8ac74d932fae3p-21] = [0.0, 0x14e0115561569cp-48]; logp1 [0x4c322657ec89bp-16, 0x4d68ba5f26bf1p-11] = [0x17bdce451a337fp-48, 0x1b3913fc99f6fcp-48]; } testcase mpfi_log2 { // special values log2 [0.0, +1.0] = [-infinity, 0.0]; log2 [0.0, +infinity] = [entire]; // regular values log2 [1.0, 1.0] = [0.0, 0.0]; log2 [0xb616ab8b683b5p-52, 1.0] = [-0x1f74cb5d105b3ap-54, 0.0]; log2 [1.0, 0x8ac74d932fae3p-21] = [0.0, 0x1e1ddc27c2c70fp-48]; log2 [0x4c322657ec89bp-16, 0x4d68ba5f26bf1p-11] = [0x112035c9390c07p-47, 0x13a3208f61f10cp-47]; } testcase mpfi_log10 { // special values log10 [0.0, 1.0] = [-infinity, 0.0]; log10 [0.0, +infinity] = [entire]; // regular values log10 [1.0, 1.0] = [0.0, 0.0]; log10 [0x3a2a08c23afe3p-14, 0x1463ceb440d6bdp-14] = [0x159753104a9401p-49, 0x1716c01a04b570p-49]; log10 [0xb616ab8b683b5p-52, 1.0] = [-0x12f043ec00f8d6p-55, 0.0]; log10 [100.0, 0x8ac74d932fae3p-21] = [2.0, 0x1221cc590b9946p-49]; log10 [0x4c322657ec89bp-16, 0x4d68ba5f26bf1p-11] = [0x149f1d70168f49p-49, 0x17a543a94fb65ep-49]; } testcase mpfi_mag { // special values mag [-infinity, -8.0] = +infinity; mag [-infinity, 0.0] = +infinity; mag [-infinity, 5.0] = +infinity; mag [entire] = +infinity; mag [-infinity, 0.0] = +infinity; mag [-8.0, 0.0] = +8; mag [0.0, 0.0] = +0; mag [0.0, 5.0] = +5; mag [0.0, +infinity] = +infinity; // regular values mag [-34.0, -17.0] = 34; } testcase mpfi_mid { // special values mid [-8.0, 0.0] = -4; mid [0.0, 0.0] = +0; mid [0.0, 5.0] = +2.5; // regular values mid [-34.0, -17.0] = -0x33p-1; mid [-34.0, 17.0] = -8.5; mid [0.0, +0x123456789abcdp-2] = +0x123456789abcdp-3; mid [0x1921fb54442d18p-51, 0x1921fb54442d19p-51] = 0x1921fb54442d18p-51; mid [-0x1921fb54442d19p-51, -0x1921fb54442d18p-51] = -0x1921fb54442d18p-51; mid [-4.0, -0x7fffffffffffdp-51] = -0x27fffffffffffbp-52; mid [-8.0, -0x7fffffffffffbp-51] = -0x47fffffffffffbp-52; mid [-0x1fffffffffffffp-53, 2.0] = 0.5; } testcase mpfi_mig { // special values mig [-infinity, -8.0] = 8; mig [-infinity, 0.0] = +0; mig [-infinity, 5.0] = +0; mig [entire] = +0; mig [-infinity, 0.0] = +0; mig [-8.0, 0.0] = +0; mig [0.0, 0.0] = +0; mig [0.0, 5.0] = +0; mig [0.0, +infinity] = +0; // regular values mig [-34.0, -17.0] = 17; } testcase mpfi_mul { // special values mul [-infinity, -7.0] [-1.0, +8.0] = [entire]; mul [-infinity, 0.0] [+8.0, +infinity] = [-infinity, 0.0]; mul [-infinity, +8.0] [0.0, +8.0] = [-infinity, +64.0]; mul [entire] [0.0, 0.0] = [0.0, 0.0]; mul [entire] [0.0, +8.0] = [entire]; mul [0.0, 0.0] [-infinity, -7.0] = [0.0, 0.0]; mul [0.0, +8.0] [-7.0, 0.0] = [-56.0, 0.0]; mul [0.0, 0.0] [0.0, +8.0] = [0.0, 0.0]; mul [0.0, +infinity] [0.0, +8.0] = [0.0, +infinity]; mul [0.0, 0.0] [+8.0, +infinity] = [0.0, 0.0]; mul [0.0, 0.0] [entire] = [0.0, 0.0]; mul [0.0, +8.0] [-7.0, +8.0] = [-56.0, +64.0]; mul [0.0, 0.0] [0.0, 0.0] = [0.0, 0.0]; mul [0.0, +infinity] [0.0, +8.0] = [0.0, +infinity]; mul [-3.0, +7.0] [0.0, 0.0] = [0.0, 0.0]; // regular values mul [-0x0dp0, -0x09p0] [-0x04p0, -0x02p0] = [0x12p0, 0x34p0]; mul [-0x0dp0, -0xd.f0e7927d247cp-4] [-0x04p0, -0xa.41084aff48f8p-8] = [0x8.ef3aa21dba748p-8, 0x34p0]; mul [-0xe.26c9e9eb67b48p-4, -0x8.237d2eb8b1178p-4] [-0x5.8c899a0706d5p-4, -0x3.344e57a37b5e8p-4] = [0x1.a142a930de328p-4, 0x4.e86c3434cd924p-4]; mul [-0x37p0, -0x07p0] [-0x01p0, 0x22p0] = [-0x74ep0, 0x37p0]; mul [-0xe.063f267ed51ap-4, -0x0.33p0] [-0x01p0, 0x1.777ab178b4a1ep+0] = [-0x1.491df346a9f15p+0, 0xe.063f267ed51ap-4]; mul [-0x1.cb540b71699a8p+4, -0x0.33p0] [-0x1.64dcaaa101f18p+0, 0x01p0] = [-0x1.cb540b71699a8p+4, 0x2.804cce4a3f42ep+4]; mul [-0x1.cb540b71699a8p+4, -0x0.33p0] [-0x1.64dcaaa101f18p+0, 0x1.eb67a1a6ef725p+4] = [-0x3.71b422ce817f4p+8, 0x2.804cce4a3f42ep+4]; mul [-0x123456789ap0, -0x01p0] [0x01p0, 0x10p0] = [-0x123456789a0p0, -0x01p0]; mul [-0xb.6c67d3a37d54p-4, -0x0.8p0] [0x02p0, 0x2.0bee4e8bb3dfp+0] = [-0x1.7611a672948a5p+0, -0x01p0]; mul [-0x04p0, -0xa.497d533c3b2ep-8] [0xb.d248df3373e68p-4, 0x04p0] = [-0x10p0, -0x7.99b990532d434p-8]; mul [-0xb.6c67d3a37d54p-4, -0xa.497d533c3b2ep-8] [0xb.d248df3373e68p-4, 0x2.0bee4e8bb3dfp+0] = [-0x1.7611a672948a5p+0, -0x7.99b990532d434p-8]; mul [-0x01p0, 0x11p0] [-0x07p0, -0x04p0] = [-0x77p0, 0x07p0]; mul [-0x01p0, 0xe.ca7ddfdb8572p-4] [-0x2.3b46226145234p+0, -0x0.1p0] = [-0x2.101b41d3d48b8p+0, 0x2.3b46226145234p+0]; mul [-0x1.1d069e75e8741p+8, 0x01p0] [-0x2.3b46226145234p+0, -0x0.1p0] = [-0x2.3b46226145234p+0, 0x2.7c0bd9877f404p+8]; mul [-0xe.ca7ddfdb8572p-4, 0x1.1d069e75e8741p+8] [-0x2.3b46226145234p+0, -0x0.1p0] = [-0x2.7c0bd9877f404p+8, 0x2.101b41d3d48b8p+0]; mul [-0x01p0, 0x10p0] [-0x02p0, 0x03p0] = [-0x20p0, 0x30p0]; mul [-0x01p0, 0x2.db091cea593fap-4] [-0x2.6bff2625fb71cp-4, 0x1p-8] = [-0x6.ea77a3ee43de8p-8, 0x2.6bff2625fb71cp-4]; mul [-0x01p0, 0x6.e211fefc216ap-4] [-0x1p-4, 0x1.8e3fe93a4ea52p+0] = [-0x1.8e3fe93a4ea52p+0, 0xa.b52fe22d72788p-4]; mul [-0x1.15e079e49a0ddp+0, 0x1p-8] [-0x2.77fc84629a602p+0, 0x8.3885932f13fp-4] = [-0x8.ec5de73125be8p-4, 0x2.adfe651d3b19ap+0]; mul [-0x07p0, 0x07p0] [0x13p0, 0x24p0] = [-0xfcp0, 0xfcp0]; mul [-0xa.8071f870126cp-4, 0x10p0] [0x02p0, 0x2.3381083e7d3b4p+0] = [-0x1.71dc5b5607781p+0, 0x2.3381083e7d3b4p+4]; mul [-0x01p0, 0x1.90aa487ecf153p+0] [0x01p-53, 0x1.442e2695ac81ap+0] = [-0x1.442e2695ac81ap+0, 0x1.fb5fbebd0cbc6p+0]; mul [-0x1.c40db77f2f6fcp+0, 0x1.8eb70bbd94478p+0] [0x02p0, 0x3.45118635235c6p+0] = [-0x5.c61fcad908df4p+0, 0x5.17b7c49130824p+0]; mul [0xcp0, 0x2dp0] [-0x679p0, -0xe5p0] = [-0x12345p0, -0xabcp0]; mul [0xcp0, 0x1.1833fdcab4c4ap+10] [-0x2.4c0afc50522ccp+40, -0xe5p0] = [-0x2.83a3712099234p+50, -0xabcp0]; mul [0xb.38f1fb0ef4308p+0, 0x2dp0] [-0x679p0, -0xa.4771d7d0c604p+0] = [-0x12345p0, -0x7.35b3c8400ade4p+4]; mul [0xf.08367984ca1cp-4, 0xa.bcf6c6cbe341p+0] [-0x5.cbc445e9952c4p+0, -0x2.8ad05a7b988fep-8] = [-0x3.e3ce52d4a139cp+4, -0x2.637164cf2f346p-8]; mul [0x01p0, 0xcp0] [-0xe5p0, 0x01p0] = [-0xabcp0, 0xcp0]; mul [0x123p-52, 0x1.ec24910ac6aecp+0] [-0xa.a97267f56a9b8p-4, 0x1p+32] = [-0x1.47f2dbe4ef916p+0, 0x1.ec24910ac6aecp+32]; mul [0x03p0, 0x7.2bea531ef4098p+0] [-0x01p0, 0xa.a97267f56a9b8p-4] = [-0x7.2bea531ef4098p+0, 0x4.c765967f9468p+0]; mul [0x0.3p0, 0xa.a97267f56a9b8p-4] [-0x1.ec24910ac6aecp+0, 0x7.2bea531ef4098p+0] = [-0x1.47f2dbe4ef916p+0, 0x4.c765967f9468p+0]; mul [0x3p0, 0x7p0] [0x5p0, 0xbp0] = [0xfp0, 0x4dp0]; mul [0x2.48380232f6c16p+0, 0x7p0] [0x3.71cb6c53e68eep+0, 0xbp0] = [0x7.dc58fb323ad78p+0, 0x4dp0]; mul [0x3p0, 0x3.71cb6c53e68eep+0] [0x5p-25, 0x2.48380232f6c16p+0] = [0xfp-25, 0x7.dc58fb323ad7cp+0]; mul [0x3.10e8a605572p-4, 0x2.48380232f6c16p+0] [0xc.3d8e305214ecp-4, 0x2.9e7db05203c88p+0] = [0x2.587a32d02bc04p-4, 0x5.fa216b7c20c6cp+0]; } testcase mpfi_mul_d { // special values mul [-infinity, -7.0] [-0x17p0, -0x17p0] = [+0xa1p0, +infinity]; mul [-infinity, -7.0] [0.0, 0.0] = [0.0, 0.0]; mul [-infinity, -7.0] [0x170ef54646d497p-107, 0x170ef54646d497p-107] = [-infinity, -0xa168b4ebefd020p-107]; mul [-infinity, 0.0] [-0x170ef54646d497p-106, -0x170ef54646d497p-106] = [0.0, +infinity]; mul [-infinity, 0.0] [0.0, 0.0] = [0.0, 0.0]; mul [-infinity, 0.0] [0x170ef54646d497p-106, 0x170ef54646d497p-106] = [-infinity, 0.0]; mul [-infinity, 8.0] [-0x16345785d8a00000p0, -0x16345785d8a00000p0] = [-0xb1a2bc2ec5000000p0, +infinity]; mul [-infinity, 8.0] [0.0, 0.0] = [0.0, 0.0]; mul [-infinity, 8.0] [0x16345785d8a00000p0, 0x16345785d8a00000p0] = [-infinity, 0xb1a2bc2ec5000000p0]; mul [entire] [-0x170ef54646d497p-105, -0x170ef54646d497p-105] = [entire]; mul [entire] [0.0e-17, 0.0e-17] = [0.0, 0.0]; mul [entire] [+0x170ef54646d497p-105, +0x170ef54646d497p-105] = [entire]; mul [0.0, 0.0] [-0x170ef54646d497p-109, -0x170ef54646d497p-109] = [0.0, 0.0]; mul [0.0, 0.0] [0.0, 0.0] = [0.0, 0.0]; mul [0.0, 0.0] [0x170ef54646d497p-109, 0x170ef54646d497p-109] = [0.0, 0.0]; mul [0.0, 7.0] [-0x114b37f4b51f71p-107, -0x114b37f4b51f71p-107] = [-0x790e87b0f3dc18p-107, 0.0]; mul [0.0, 8.0] [0.0, 0.0] = [0.0, 0.0]; mul [0.0, 9.0] [0x114b37f4b51f71p-103, 0x114b37f4b51f71p-103] = [0.0, 0x9ba4f79a5e1b00p-103]; mul [0.0, +infinity] [-0x50b45a75f7e81p-104, -0x50b45a75f7e81p-104] = [-infinity, 0.0]; mul [0.0, +infinity] [0.0, 0.0] = [0.0, 0.0]; mul [0.0, +infinity] [0x142d169d7dfa03p-106, 0x142d169d7dfa03p-106] = [0.0, +infinity]; // regular values mul [-0x1717170p0, -0xaaaaaaaaaaaaap-123] [-1.5, -1.5] = [0xfffffffffffffp-123, 0x22a2a28p0]; mul [-0xaaaaaaaaaaaaap0, 0x1717170p+401] [-1.5, -1.5] = [-0x22a2a28p+401, 0xfffffffffffffp0]; mul [0x10000000000010p0, 0x888888888888p+654] [-2.125, -2.125] = [-0x1222222222221p+654, -0x22000000000022p0]; mul [-0x1717170p0, -0xaaaaaaaaaaaaap-123] [1.5, 1.5] = [-0x22a2a28p0, -0xfffffffffffffp-123]; mul [-0xaaaaaaaaaaaaap0, 0x1717170p+401] [1.5, 1.5] = [-0xfffffffffffffp0, 0x22a2a28p+401]; mul [0x10000000000010p0, 0x888888888888p+654] [2.125, 2.125] = [0x22000000000022p0, 0x1222222222221p+654]; mul [-0x1717170p+36, -0x10000000000001p0] [-1.5, -1.5] = [0x18000000000001p0, 0x22a2a28p+36]; mul [-0xaaaaaaaaaaaaap0, 0x10000000000001p0] [-1.5, -1.5] = [-0x18000000000002p0, 0xfffffffffffffp0]; mul [0x10000000000010p0, 0x11111111111111p0] [-2.125, -2.125] = [-0x12222222222223p+1, -0x22000000000022p0]; mul [-0x10000000000001p0, -0xaaaaaaaaaaaaap-123] [1.5, 1.5] = [-0x18000000000002p0, -0xfffffffffffffp-123]; mul [-0xaaaaaaaaaaaabp0, 0x1717170p+401] [1.5, 1.5] = [-0x10000000000001p0, 0x22a2a28p+401]; mul [0x10000000000001p0, 0x888888888888p+654] [2.125, 2.125] = [0x22000000000002p0, 0x1222222222221p+654]; mul [-0x11717171717171p0, -0xaaaaaaaaaaaaap-123] [-1.5, -1.5] = [0xfffffffffffffp-123, 0x1a2a2a2a2a2a2ap0]; mul [-0x10000000000001p0, 0x1717170p+401] [-1.5, -1.5] = [-0x22a2a28p+401, 0x18000000000002p0]; mul [0x10000000000001p0, 0x888888888888p+654] [-2.125, -2.125] = [-0x1222222222221p+654, -0x22000000000002p0]; mul [-0x1717170p0, -0x1aaaaaaaaaaaaap-123] [1.5, 1.5] = [-0x22a2a28p0, -0x27fffffffffffep-123]; mul [-0xaaaaaaaaaaaaap0, 0x11717171717171p0] [1.5, 1.5] = [-0xfffffffffffffp0, 0x1a2a2a2a2a2a2ap0]; mul [0x10000000000010p0, 0x18888888888889p0] [2.125, 2.125] = [0x22000000000022p0, 0x34222222222224p0]; mul [-0x11717171717171p0, -0x10000000000001p0] [-1.5, -1.5] = [0x18000000000001p0, 0x1a2a2a2a2a2a2ap0]; mul [-0x10000000000001p0, 0x10000000000001p0] [-1.5, -1.5] = [-0x18000000000002p0, 0x18000000000002p0]; mul [0x10000000000001p0, 0x11111111111111p0] [-2.125, -2.125] = [-0x12222222222223p+1, -0x22000000000002p0]; mul [-0x10000000000001p0, -0x1aaaaaaaaaaaaap-123] [1.5, 1.5] = [-0x18000000000002p0, -0x27fffffffffffep-123]; mul [-0xaaaaaaaaaaaabp0, 0x11717171717171p0] [1.5, 1.5] = [-0x10000000000001p0, 0x1a2a2a2a2a2a2ap0]; mul [0x10000000000001p0, 0x18888888888889p0] [2.125, 2.125] = [0x22000000000002p0, 0x34222222222224p0]; } testcase mpfi_neg { // special values neg [-infinity, -7.0] = [+7.0, +infinity]; neg [-infinity, 0.0] = [0.0, +infinity]; neg [-infinity, +8.0] = [-8.0, +infinity]; neg [entire] = [entire]; neg [0.0, 0.0] = [0.0, 0.0]; neg [0.0, +8.0] = [-8.0, 0.0]; neg [0.0, +infinity] = [-infinity, 0.0]; // regular values neg [0x123456789p-16, 0x123456799p-16] = [-0x123456799p-16, -0x123456789p-16]; } testcase mpfi_put_d { // special values convexHull [0.0, 0.0] [-8.0, -8.0] = [-8.0, 0.0]; convexHull [0.0, 0.0] [0.0, 0.0] = [0.0, 0.0]; convexHull [+5.0, +5.0] [0.0, 0.0] = [0.0, +5.0]; } testcase mpfi_sec { // special values sec [-infinity, -7.0] = [entire]; sec [-infinity, 0.0] = [entire]; sec [-infinity, 8.0] = [entire]; sec [entire] = [entire]; sec [-8.0, 0.0] = [entire]; sec [-3.0, 0.0] = [entire]; sec [-1.0, 0.0] = [1.0, 0x1d9cf0f125cc2ap-52]; sec [0.0, 0.0] = [1.0, 1.0]; sec [0.0, +1.0] = [1.0, 0x1d9cf0f125cc2ap-52]; sec [0.0, 3.0] = [entire]; sec [0.0, 8.0] = [entire]; sec [0.0, +infinity] = [entire]; // regular values sec [-6.0, 7.0] = [entire]; sec [-6.0, 6.0] = [entire]; sec [-6.0, 5.0] = [entire]; sec [-6.0, 4.0] = [entire]; sec [-6.0, 3.0] = [entire]; sec [-6.0, 2.0] = [entire]; sec [-6.0, 1.0] = [entire]; sec [-6.0, 0.0] = [entire]; sec [-6.0, -1.0] = [entire]; sec [-6.0, -2.0] = [entire]; sec [-6.0, -3.0] = [entire]; sec [-6.0, -4.0] = [entire]; sec [-6.0, -5.0] = [0x10a9e8f3e19df1p-52, 0x1c33db0464189bp-51]; sec [-6.0, -6.0] = [0x10a9e8f3e19df1p-52, 0x10a9e8f3e19df2p-52]; sec [-5.0, 7.0] = [entire]; sec [-5.0, 6.0] = [entire]; sec [-5.0, 5.0] = [entire]; sec [-5.0, 4.0] = [entire]; sec [-5.0, 3.0] = [entire]; sec [-5.0, 2.0] = [entire]; sec [-5.0, 1.0] = [entire]; sec [-5.0, 0.0] = [entire]; sec [-5.0, -1.0] = [entire]; sec [-5.0, -2.0] = [entire]; sec [-5.0, -3.0] = [entire]; sec [-5.0, -4.0] = [entire]; sec [-5.0, -5.0] = [0x1c33db0464189ap-51, 0x1c33db0464189bp-51]; sec [-4.0, 7.0] = [entire]; sec [-4.0, 6.0] = [entire]; sec [-4.0, 5.0] = [entire]; sec [-4.0, 4.0] = [entire]; sec [-4.0, 3.0] = [entire]; sec [-4.0, 2.0] = [entire]; sec [-4.0, 1.0] = [entire]; sec [-4.0, 0.0] = [entire]; sec [-4.0, -1.0] = [entire]; sec [-4.0, -2.0] = [-0x133956fecf9e49p-51, -1.0]; sec [-4.0, -3.0] = [-0x187a6961d2485fp-52, -1.0]; sec [-4.0, -4.0] = [-0x187a6961d2485fp-52, -0x187a6961d2485ep-52]; sec [-3.0, 7.0] = [entire]; sec [-3.0, 6.0] = [entire]; sec [-3.0, 5.0] = [entire]; sec [-3.0, 4.0] = [entire]; sec [-3.0, 3.0] = [entire]; sec [-3.0, 2.0] = [entire]; sec [-3.0, 1.0] = [entire]; sec [-3.0, 0.0] = [entire]; sec [-3.0, -1.0] = [entire]; sec [-3.0, -2.0] = [-0x133956fecf9e49p-51, -0x102967b457b245p-52]; sec [-3.0, -3.0] = [-0x102967b457b246p-52, -0x102967b457b245p-52]; sec [-2.0, 7.0] = [entire]; sec [-2.0, 6.0] = [entire]; sec [-2.0, 5.0] = [entire]; sec [-2.0, 4.0] = [entire]; sec [-2.0, 3.0] = [entire]; sec [-2.0, 2.0] = [entire]; sec [-2.0, 1.0] = [entire]; sec [-2.0, 0.0] = [entire]; sec [-2.0, -1.0] = [entire]; sec [-2.0, -2.0] = [-0x133956fecf9e49p-51, -0x133956fecf9e48p-51]; sec [-1.0, 7.0] = [entire]; sec [-1.0, 6.0] = [entire]; sec [-1.0, 5.0] = [entire]; sec [-1.0, 4.0] = [entire]; sec [-1.0, 3.0] = [entire]; sec [-1.0, 2.0] = [entire]; sec [-1.0, 1.0] = [1.0, 0x1d9cf0f125cc2ap-52]; sec [-1.0, 0.0] = [1.0, 0x1d9cf0f125cc2ap-52]; sec [-1.0, -1.0] = [0x1d9cf0f125cc29p-52, 0x1d9cf0f125cc2ap-52]; sec [1.0, 7.0] = [entire]; sec [1.0, 6.0] = [entire]; sec [1.0, 5.0] = [entire]; sec [1.0, 4.0] = [entire]; sec [1.0, 3.0] = [entire]; sec [1.0, 2.0] = [entire]; sec [1.0, 1.0] = [0x1d9cf0f125cc29p-52, 0x1d9cf0f125cc2ap-52]; sec [2.0, 7.0] = [entire]; sec [2.0, 6.0] = [entire]; sec [2.0, 5.0] = [entire]; sec [2.0, 4.0] = [-0x133956fecf9e49p-51, -1.0]; sec [2.0, 3.0] = [-0x133956fecf9e49p-51, -0x102967b457b245p-52]; sec [2.0, 2.0] = [-0x133956fecf9e49p-51, -0x133956fecf9e48p-51]; sec [3.0, 7.0] = [entire]; sec [3.0, 6.0] = [entire]; sec [3.0, 5.0] = [entire]; sec [3.0, 4.0] = [-0x187a6961d2485fp-52, -1.0]; sec [3.0, 3.0] = [-0x102967b457b246p-52, -0x102967b457b245p-52]; sec [4.0, 7.0] = [entire]; sec [4.0, 6.0] = [entire]; sec [4.0, 5.0] = [entire]; sec [4.0, 4.0] = [-0x187a6961d2485fp-52, -0x187a6961d2485ep-52]; sec [5.0, 7.0] = [1.0, 0x1c33db0464189bp-51]; sec [5.0, 6.0] = [0x10a9e8f3e19df1p-52, 0x1c33db0464189bp-51]; sec [5.0, 5.0] = [0x1c33db0464189ap-51, 0x1c33db0464189bp-51]; sec [6.0, 7.0] = [1.0, 0x153910a80e7db5p-52]; sec [6.0, 6.0] = [0x10a9e8f3e19df1p-52, 0x10a9e8f3e19df2p-52]; sec [7.0, 7.0] = [0x153910a80e7db4p-52, 0x153910a80e7db5p-52]; } testcase mpfi_sech { // special values sech [-infinity, -7.0] = [0.0, 0x1de169fb49b339p-62]; sech [-infinity, 0.0] = [0.0, 1.0]; sech [-infinity, +8.0] = [0.0, 1.0]; sech [entire] = [0.0, 1.0]; sech [-1.0, 0.0] = [0x14bcdc50ed6be7p-53, 1.0]; sech [0.0, 0.0] = [1.0, 1.0]; sech [0.0, +1.0] = [0x14bcdc50ed6be7p-53, 1.0]; sech [0.0, +8.0] = [0x15fc20da8e18dbp-63, 1.0]; sech [0.0, +infinity] = [0.0, 1.0]; // regular values sech [-0.125, 0.0] = [0x1fc069fe3f72bep-53, 1.0]; sech [0.0, 0x10000000000001p-53] = [0x1c60d1ff040dcfp-53, 1.0]; sech [-4.5, -0.625] = [0x16bf984a9a2355p-58, 0x1aa0b464a5e24ap-53]; sech [1.0, 3.0] = [0x196d8e17d88eb1p-56, 0x14bcdc50ed6be8p-53]; sech [17.0, 0xb145bb71d3dbp-38] = [0x10000000000173p-1074, 0x1639e3175a6893p-76]; } testcase mpfi_sin { // special values sin [-infinity, -7.0] = [-1.0, 1.0]; sin [-infinity, 0.0] = [-1.0, 1.0]; sin [-infinity, +8.0] = [-1.0, 1.0]; sin [entire] = [-1.0, 1.0]; sin [-1.0, 0.0] = [-0x1aed548f090cefp-53, 0.0]; sin [0.0, 0.0] = [0.0, 0.0]; sin [0.0, +1.0] = [0.0, 0x1aed548f090cefp-53]; sin [0.0, +8.0] = [-1.0, 1.0]; sin [0.0, +infinity] = [-1.0, 1.0]; // regular values sin [0.125, 17.0] = [-1.0, 1.0]; sin [0x1921fb54442d18p-52, 0x1921fb54442d19p-52] = [0x1fffffffffffffp-53, 1.0]; sin [-2.0, -0.5] = [-1.0, -0x1eaee8744b05efp-54]; sin [-4.5, 0.625] = [-1.0, 0x1f47ed3dc74081p-53]; sin [-1.0, -0.25] = [-0x1aed548f090cefp-53, -0x1faaeed4f31576p-55]; sin [-0.5, 0.5] = [-0x1eaee8744b05f0p-54, 0x1eaee8744b05f0p-54]; sin [0x71p+76, 0x71p+76] = [0x1bde6c11cbfc46p-55, 0x1bde6c11cbfc47p-55]; sin [-7.0, 7.0] = [-1.0, 1.0]; sin [-7.0, 6.0] = [-1.0, 1.0]; sin [-7.0, 5.0] = [-1.0, 1.0]; sin [-7.0, 4.0] = [-1.0, 1.0]; sin [-7.0, 3.0] = [-1.0, 1.0]; sin [-7.0, 2.0] = [-1.0, 1.0]; sin [-7.0, 1.0] = [-1.0, 1.0]; sin [-7.0, 0.0] = [-1.0, 1.0]; sin [-7.0, -1.0] = [-1.0, 1.0]; sin [-7.0, -2.0] = [-0x1d18f6ead1b446p-53, 1.0]; sin [-7.0, -3.0] = [-0x150608c26d0a09p-53, 1.0]; sin [-7.0, -4.0] = [-0x150608c26d0a09p-53, 1.0]; sin [-7.0, -5.0] = [-0x150608c26d0a09p-53, 0x1eaf81f5e09934p-53]; sin [-7.0, -6.0] = [-0x150608c26d0a09p-53, 0x11e1f18ab0a2c1p-54]; sin [-7.0, -7.0] = [-0x150608c26d0a09p-53, -0x150608c26d0a08p-53]; sin [-6.0, 7.0] = [-1.0, 1.0]; sin [-6.0, 6.0] = [-1.0, 1.0]; sin [-6.0, 5.0] = [-1.0, 1.0]; sin [-6.0, 4.0] = [-1.0, 1.0]; sin [-6.0, 3.0] = [-1.0, 1.0]; sin [-6.0, 2.0] = [-1.0, 1.0]; sin [-6.0, 1.0] = [-1.0, 1.0]; sin [-6.0, 0.0] = [-1.0, 1.0]; sin [-6.0, -1.0] = [-1.0, 1.0]; sin [-6.0, -2.0] = [-0x1d18f6ead1b446p-53, 1.0]; sin [-6.0, -3.0] = [-0x1210386db6d55cp-55, 1.0]; sin [-6.0, -4.0] = [0x11e1f18ab0a2c0p-54, 1.0]; sin [-6.0, -5.0] = [0x11e1f18ab0a2c0p-54, 0x1eaf81f5e09934p-53]; sin [-6.0, -6.0] = [0x11e1f18ab0a2c0p-54, 0x11e1f18ab0a2c1p-54]; sin [-5.0, 7.0] = [-1.0, 1.0]; sin [-5.0, 6.0] = [-1.0, 1.0]; sin [-5.0, 5.0] = [-1.0, 1.0]; sin [-5.0, 4.0] = [-1.0, 1.0]; sin [-5.0, 3.0] = [-1.0, 1.0]; sin [-5.0, 2.0] = [-1.0, 1.0]; sin [-5.0, 1.0] = [-1.0, 1.0]; sin [-5.0, 0.0] = [-1.0, 1.0]; sin [-5.0, -1.0] = [-1.0, 1.0]; sin [-5.0, -2.0] = [-0x1d18f6ead1b446p-53, 1.0]; sin [-5.0, -3.0] = [-0x1210386db6d55cp-55, 1.0]; sin [-5.0, -4.0] = [0x1837b9dddc1eaep-53, 1.0]; sin [-5.0, -5.0] = [0x1eaf81f5e09933p-53, 0x1eaf81f5e09934p-53]; sin [-4.0, 7.0] = [-1.0, 1.0]; sin [-4.0, 6.0] = [-1.0, 1.0]; sin [-4.0, 5.0] = [-1.0, 1.0]; sin [-4.0, 4.0] = [-1.0, 1.0]; sin [-4.0, 3.0] = [-1.0, 1.0]; sin [-4.0, 2.0] = [-1.0, 1.0]; sin [-4.0, 1.0] = [-1.0, 0x1aed548f090cefp-53]; sin [-4.0, 0.0] = [-1.0, 0x1837b9dddc1eafp-53]; sin [-4.0, -1.0] = [-1.0, 0x1837b9dddc1eafp-53]; sin [-4.0, -2.0] = [-0x1d18f6ead1b446p-53, 0x1837b9dddc1eafp-53]; sin [-4.0, -3.0] = [-0x1210386db6d55cp-55, 0x1837b9dddc1eafp-53]; sin [-4.0, -4.0] = [0x1837b9dddc1eaep-53, 0x1837b9dddc1eafp-53]; sin [-3.0, 7.0] = [-1.0, 1.0]; sin [-3.0, 6.0] = [-1.0, 1.0]; sin [-3.0, 5.0] = [-1.0, 1.0]; sin [-3.0, 4.0] = [-1.0, 1.0]; sin [-3.0, 3.0] = [-1.0, 1.0]; sin [-3.0, 2.0] = [-1.0, 1.0]; sin [-3.0, 1.0] = [-1.0, 0x1aed548f090cefp-53]; sin [-3.0, 0.0] = [-1.0, 0.0]; sin [-3.0, -1.0] = [-1.0, -0x1210386db6d55bp-55]; sin [-3.0, -2.0] = [-0x1d18f6ead1b446p-53, -0x1210386db6d55bp-55]; sin [-3.0, -3.0] = [-0x1210386db6d55cp-55, -0x1210386db6d55bp-55]; sin [-2.0, 7.0] = [-1.0, 1.0]; sin [-2.0, 6.0] = [-1.0, 1.0]; sin [-2.0, 5.0] = [-1.0, 1.0]; sin [-2.0, 4.0] = [-1.0, 1.0]; sin [-2.0, 3.0] = [-1.0, 1.0]; sin [-2.0, 2.0] = [-1.0, 1.0]; sin [-2.0, 1.0] = [-1.0, 0x1aed548f090cefp-53]; sin [-2.0, 0.0] = [-1.0, 0.0]; sin [-2.0, -1.0] = [-1.0, -0x1aed548f090ceep-53]; sin [-2.0, -2.0] = [-0x1d18f6ead1b446p-53, -0x1d18f6ead1b445p-53]; sin [-1.0, 7.0] = [-1.0, 1.0]; sin [-1.0, 6.0] = [-1.0, 1.0]; sin [-1.0, 5.0] = [-1.0, 1.0]; sin [-1.0, 4.0] = [-0x1aed548f090cefp-53, 1.0]; sin [-1.0, 3.0] = [-0x1aed548f090cefp-53, 1.0]; sin [-1.0, 2.0] = [-0x1aed548f090cefp-53, 1.0]; sin [-1.0, 1.0] = [-0x1aed548f090cefp-53, 0x1aed548f090cefp-53]; sin [-1.0, 0.0] = [-0x1aed548f090cefp-53, 0.0]; sin [-1.0, -1.0] = [-0x1aed548f090cefp-53, -0x1aed548f090ceep-53]; sin [1.0, 7.0] = [-1.0, 1.0]; sin [1.0, 6.0] = [-1.0, 1.0]; sin [1.0, 5.0] = [-1.0, 1.0]; sin [1.0, 4.0] = [-0x1837b9dddc1eafp-53, 1.0]; sin [1.0, 3.0] = [0x1210386db6d55bp-55, 1.0]; sin [1.0, 2.0] = [0x1aed548f090ceep-53, 1.0]; sin [1.0, 1.0] = [0x1aed548f090ceep-53, 0x1aed548f090cefp-53]; sin [2.0, 7.0] = [-1.0, 0x1d18f6ead1b446p-53]; sin [2.0, 6.0] = [-1.0, 0x1d18f6ead1b446p-53]; sin [2.0, 5.0] = [-1.0, 0x1d18f6ead1b446p-53]; sin [2.0, 4.0] = [-0x1837b9dddc1eafp-53, 0x1d18f6ead1b446p-53]; sin [2.0, 3.0] = [0x1210386db6d55bp-55, 0x1d18f6ead1b446p-53]; sin [2.0, 2.0] = [0x1d18f6ead1b445p-53, 0x1d18f6ead1b446p-53]; sin [3.0, 7.0] = [-1.0, 0x150608c26d0a09p-53]; sin [3.0, 6.0] = [-1.0, 0x1210386db6d55cp-55]; sin [3.0, 5.0] = [-1.0, 0x1210386db6d55cp-55]; sin [3.0, 4.0] = [-0x1837b9dddc1eafp-53, 0x1210386db6d55cp-55]; sin [3.0, 3.0] = [0x1210386db6d55bp-55, 0x1210386db6d55cp-55]; sin [4.0, 7.0] = [-1.0, 0x150608c26d0a09p-53]; sin [4.0, 6.0] = [-1.0, -0x11e1f18ab0a2c0p-54]; sin [4.0, 5.0] = [-1.0, -0x1837b9dddc1eaep-53]; sin [4.0, 4.0] = [-0x1837b9dddc1eafp-53, -0x1837b9dddc1eaep-53]; sin [5.0, 7.0] = [-0x1eaf81f5e09934p-53, 0x150608c26d0a09p-53]; sin [5.0, 6.0] = [-0x1eaf81f5e09934p-53, -0x11e1f18ab0a2c0p-54]; sin [5.0, 5.0] = [-0x1eaf81f5e09934p-53, -0x1eaf81f5e09933p-53]; sin [6.0, 7.0] = [-0x11e1f18ab0a2c1p-54, 0x150608c26d0a09p-53]; sin [6.0, 6.0] = [-0x11e1f18ab0a2c1p-54, -0x11e1f18ab0a2c0p-54]; sin [7.0, 7.0] = [0x150608c26d0a08p-53, 0x150608c26d0a09p-53]; } testcase mpfi_sinh { // special values sinh [-infinity, -7.0] = [-infinity, -0x1122876ba380c9p-43]; sinh [-infinity, 0.0] = [-infinity, 0.0]; sinh [-infinity, +8.0] = [-infinity, 0x1749ea514eca66p-42]; sinh [entire] = [entire]; sinh [-1.0, 0.0] = [-0x12cd9fc44eb983p-52, 0.0]; sinh [0.0, 0.0] = [0.0, 0.0]; sinh [0.0, +1.0] = [0.0, 0x12cd9fc44eb983p-52]; sinh [0.0, +8.0] = [0.0, 0x1749ea514eca66p-42]; sinh [0.0, +infinity] = [0.0, +infinity]; // regular values sinh [-0.125, 0.0] = [-0x100aaccd00d2f1p-55, 0.0]; sinh [0.0, 0x10000000000001p-53] = [0.0, 0x10acd00fe63b98p-53]; sinh [-4.5, -0.625] = [-0x168062ab5fa9fdp-47, -0x1553e795dc19ccp-53]; sinh [1.0, 3.0] = [0x12cd9fc44eb982p-52, 0x140926e70949aep-49]; } testcase mpfi_sqr { // special values sqr [-infinity, -7.0] = [+49.0, +infinity]; sqr [-infinity, 0.0] = [0.0, +infinity]; sqr [-infinity, +8.0] = [0.0, +infinity]; sqr [entire] = [0.0, +infinity]; sqr [0.0, 0.0] = [0.0, 0.0]; sqr [0.0, +8.0] = [0.0, +64.0]; sqr [0.0, +infinity] = [0.0, +infinity]; // regular values sqr [0x8.6374d8p-4, 0x3.f1d929p+8] = [0x4.65df11464764p-4, 0xf.8f918d688891p+16]; sqr [0x6.61485c33c0b14p+4, 0x123456p0] = [0x2.8b45c3cc03ea6p+12, 0x14b66cb0ce4p0]; sqr [-0x1.64722ad2480c9p+0, 0x1p0] = [0.0, 0x1.f04dba0302d4dp+0]; sqr [0x1.6b079248747a2p+0, 0x2.b041176d263f6p+0] = [0x2.02ce7912cddf6p+0, 0x7.3a5dee779527p+0]; } testcase mpfi_sqrt { // special values sqrt [0.0, 0.0] = [0.0, 0.0]; sqrt [0.0, +9.0] = [0.0, +3.0]; sqrt [0.0, +infinity] = [0.0, +infinity]; // regular values sqrt [0xaaa1p0, 0x14b66cb0ce4p0] = [0xd1p0, 0x123456p0]; sqrt [0xe.49ae7969e41bp-4, 0xaaa1p0] = [0xf.1ea42821b27a8p-4, 0xd1p0]; sqrt [0xa.aa1p-4, 0x1.0c348f804c7a9p+0] = [0xd.1p-4, 0x1.06081714eef1dp+0]; sqrt [0xe.49ae7969e41bp-4, 0x1.0c348f804c7a9p+0] = [0xf.1ea42821b27a8p-4, 0x1.06081714eef1dp+0]; } testcase mpfi_sub { // special values sub [-infinity, -7.0] [-1.0, +8.0] = [-infinity, -6.0]; sub [-infinity, 0.0] [+8.0, +infinity] = [-infinity, -8.0]; sub [-infinity, +8.0] [0.0, +8.0] = [-infinity, +8.0]; sub [entire] [0.0, +8.0] = [entire]; sub [0.0, 0.0] [-infinity, -7.0] = [+7.0, +infinity]; sub [0.0, +8.0] [-7.0, 0.0] = [0.0, +15.0]; sub [0.0, 0.0] [0.0, +8.0] = [-8.0, 0.0]; sub [0.0, +infinity] [0.0, +8.0] = [-8.0, +infinity]; sub [0.0, 0.0] [+8.0, +infinity] = [-infinity, -8.0]; sub [0.0, 0.0] [entire] = [entire]; sub [0.0, +8.0] [-7.0, +8.0] = [-8.0, +15.0]; sub [0.0, 0.0] [0.0, 0.0] = [0.0, 0.0]; sub [0.0, +infinity] [0.0, +8.0] = [-8.0, +infinity]; // regular values sub [-5.0, 59.0] [17.0, 81.0] = [-86.0, 42.0]; sub [-0x1p-300, 0x123456p+28] [-0x789abcdp0, 0x10000000000000p-93] = [-0x10000000000001p-93, 0x123456789abcdp0]; sub [-4.0, 7.0] [-3e300, 0x123456789abcdp-17] = [-0x123456791abcdp-17, 0x8f596b3002c1bp+947]; sub [-0x1000100010001p+8, 0x1p+60] [-3e300, 0x1000100010001p0] = [-0x10101010101011p+4, 0x8f596b3002c1bp+947]; sub [-5.0, 1.0] [1.0, 0x1p+70] = [-0x10000000000001p+18, 0.0]; sub [5.0, 0x1p+70] [3.0, 5.0] = [0.0, 0x1p+70]; } testcase mpfi_sub_d { // special values sub [-infinity, -7.0] [-0x170ef54646d497p-107, -0x170ef54646d497p-107] = [-infinity, -0x1bffffffffffffp-50]; sub [-infinity, -7.0] [0.0, 0.0] = [-infinity, -7.0]; sub [-infinity, -7.0] [0x170ef54646d497p-107, 0x170ef54646d497p-107] = [-infinity, -7.0]; sub [-infinity, 0.0] [-0x170ef54646d497p-106, -0x170ef54646d497p-106] = [-infinity, 0x170ef54646d497p-106]; sub [-infinity, 0.0] [0.0, 0.0] = [-infinity, 0.0]; sub [-infinity, 0.0] [0x170ef54646d497p-106, 0x170ef54646d497p-106] = [-infinity, -8.0e-17]; sub [-infinity, 8.0] [-0x16345785d8a00000p0, -0x16345785d8a00000p0] = [-infinity, 0x16345785d8a00100p0]; sub [-infinity, 8.0] [0.0, 0.0] = [-infinity, 8.0]; sub [-infinity, 8.0] [0x16345785d8a00000p0, 0x16345785d8a00000p0] = [-infinity, -0x16345785d89fff00p0]; sub [entire] [-0x170ef54646d497p-105, -0x170ef54646d497p-105] = [entire]; sub [entire] [0.0e-17, 0.0e-17] = [entire]; sub [entire] [+0x170ef54646d497p-105, +0x170ef54646d497p-105] = [entire]; sub [0.0, 0.0] [-0x170ef54646d497p-109, -0x170ef54646d497p-109] = [+0x170ef54646d497p-109, +0x170ef54646d497p-109]; sub [0.0, 0.0] [0.0, 0.0] = [0.0, 0.0]; sub [0.0, 0.0] [0x170ef54646d497p-109, 0x170ef54646d497p-109] = [-0x170ef54646d497p-109, -0x170ef54646d497p-109]; sub [0.0, 8.0] [-0x114b37f4b51f71p-107, -0x114b37f4b51f71p-107] = [0x114b37f4b51f71p-107, 0x10000000000001p-49]; sub [0.0, 8.0] [0.0, 0.0] = [0.0, 8.0]; sub [0.0, 8.0] [0x114b37f4b51f71p-107, 0x114b37f4b51f71p-107] = [-0x114b37f4b51f71p-107, 8.0]; sub [0.0, +infinity] [-0x50b45a75f7e81p-104, -0x50b45a75f7e81p-104] = [0x50b45a75f7e81p-104, +infinity]; sub [0.0, +infinity] [0.0, 0.0] = [0.0, +infinity]; sub [0.0, +infinity] [0x142d169d7dfa03p-106, 0x142d169d7dfa03p-106] = [-0x142d169d7dfa03p-106, +infinity]; // regular values sub [-32.0, -17.0] [0xfb53d14aa9c2fp-47, 0xfb53d14aa9c2fp-47] = [-0x1fb53d14aa9c2fp-47, -0x18353d14aa9c2fp-47]; sub [-0xfb53d14aa9c2fp-47, -17.0] [-0xfb53d14aa9c2fp-47, -0xfb53d14aa9c2fp-47] = [0.0, 0x7353d14aa9c2fp-47]; sub [-32.0, -0xfb53d14aa9c2fp-48] [-0xfb53d14aa9c2fp-48, -0xfb53d14aa9c2fp-48] = [-0x104ac2eb5563d1p-48, 0.0]; sub [0x123456789abcdfp-48, 0x123456789abcdfp-4] [-3.5, -3.5] = [0x15b456789abcdfp-48, 0x123456789abd17p-4]; sub [0x123456789abcdfp-56, 0x123456789abcdfp-4] [-3.5, -3.5] = [0x3923456789abcdp-52, 0x123456789abd17p-4]; sub [-0xffp0, 0x123456789abcdfp-52] [-256.5, -256.5] = [0x18p-4, 0x101a3456789abdp-44]; sub [-0x1fffffffffffffp-52, -0x1p-550] [-4097.5, -4097.5] = [0xfff8p-4, 0x10018p-4]; sub [0x123456789abcdfp-48, 0x123456789abcdfp-4] [3.5, 3.5] = [0xeb456789abcdfp-48, 0x123456789abca7p-4]; sub [0x123456789abcdfp-56, 0x123456789abcdfp-4] [3.5, 3.5] = [-0x36dcba98765434p-52, 0x123456789abca7p-4]; sub [-0xffp0, 0x123456789abcdfp-52] [256.5, 256.5] = [-0x1ff8p-4, -0xff5cba9876543p-44]; sub [-0x1fffffffffffffp-52, -0x1p-550] [4097.5, 4097.5] = [-0x10038p-4, -0x10018p-4]; } testcase mpfi_tan { // special values tan [-infinity, -7.0] = [entire]; tan [-infinity, 0.0] = [entire]; tan [-infinity, +8.0] = [entire]; tan [entire] = [entire]; tan [-1.0, 0.0] = [-0x18eb245cbee3a6p-52, 0.0]; tan [0.0, 0.0] = [0.0, 0.0]; tan [0.0, +1.0] = [0.0, 0x18eb245cbee3a6p-52]; tan [0.0, +8.0] = [entire]; tan [0.0, +infinity] = [entire]; // regular values tan [0.125, 17.0] = [entire]; tan [0x1921fb54442d18p-52, 0x1921fb54442d19p-52] = [entire]; tan [-2.0, -0.5] = [entire]; tan [-4.5, 0.625] = [entire]; tan [-1.0, -0.25] = [-0x18eb245cbee3a6p-52, -0x105785a43c4c55p-54]; tan [-0.5, 0.5] = [-0x117b4f5bf3474bp-53, 0x117b4f5bf3474bp-53]; tan [0x71p+76, 0x71p+76] = [-0x1c8dc87ddcc134p-55, -0x1c8dc87ddcc133p-55]; tan [-7.0, 7.0] = [entire]; tan [-7.0, 6.0] = [entire]; tan [-7.0, 5.0] = [entire]; tan [-7.0, 4.0] = [entire]; tan [-7.0, 3.0] = [entire]; tan [-7.0, 2.0] = [entire]; tan [-7.0, 1.0] = [entire]; tan [-7.0, 0.0] = [entire]; tan [-7.0, -1.0] = [entire]; tan [-7.0, -2.0] = [entire]; tan [-7.0, -3.0] = [entire]; tan [-7.0, -4.0] = [entire]; tan [-7.0, -5.0] = [-0x1be2e6e13eea79p-53, 0x1b0b4b739bbb07p-51]; tan [-7.0, -6.0] = [-0x1be2e6e13eea79p-53, 0x129fd86ebb95bfp-54]; tan [-7.0, -7.0] = [-0x1be2e6e13eea79p-53, -0x1be2e6e13eea78p-53]; tan [-6.0, 7.0] = [entire]; tan [-6.0, 6.0] = [entire]; tan [-6.0, 5.0] = [entire]; tan [-6.0, 4.0] = [entire]; tan [-6.0, 3.0] = [entire]; tan [-6.0, 2.0] = [entire]; tan [-6.0, 1.0] = [entire]; tan [-6.0, 0.0] = [entire]; tan [-6.0, -1.0] = [entire]; tan [-6.0, -2.0] = [entire]; tan [-6.0, -3.0] = [entire]; tan [-6.0, -4.0] = [entire]; tan [-6.0, -5.0] = [0x129fd86ebb95bep-54, 0x1b0b4b739bbb07p-51]; tan [-6.0, -6.0] = [0x129fd86ebb95bep-54, 0x129fd86ebb95bfp-54]; tan [-5.0, 7.0] = [entire]; tan [-5.0, 6.0] = [entire]; tan [-5.0, 5.0] = [entire]; tan [-5.0, 4.0] = [entire]; tan [-5.0, 3.0] = [entire]; tan [-5.0, 2.0] = [entire]; tan [-5.0, 1.0] = [entire]; tan [-5.0, 0.0] = [entire]; tan [-5.0, -1.0] = [entire]; tan [-5.0, -2.0] = [entire]; tan [-5.0, -3.0] = [entire]; tan [-5.0, -4.0] = [entire]; tan [-5.0, -5.0] = [0x1b0b4b739bbb06p-51, 0x1b0b4b739bbb07p-51]; tan [-4.0, 7.0] = [entire]; tan [-4.0, 6.0] = [entire]; tan [-4.0, 5.0] = [entire]; tan [-4.0, 4.0] = [entire]; tan [-4.0, 3.0] = [entire]; tan [-4.0, 2.0] = [entire]; tan [-4.0, 1.0] = [entire]; tan [-4.0, 0.0] = [entire]; tan [-4.0, -1.0] = [entire]; tan [-4.0, -2.0] = [-0x12866f9be4de14p-52, 0x117af62e0950f9p-51]; tan [-4.0, -3.0] = [-0x12866f9be4de14p-52, 0x123ef71254b870p-55]; tan [-4.0, -4.0] = [-0x12866f9be4de14p-52, -0x12866f9be4de13p-52]; tan [-3.0, 7.0] = [entire]; tan [-3.0, 6.0] = [entire]; tan [-3.0, 5.0] = [entire]; tan [-3.0, 4.0] = [entire]; tan [-3.0, 3.0] = [entire]; tan [-3.0, 2.0] = [entire]; tan [-3.0, 1.0] = [entire]; tan [-3.0, 0.0] = [entire]; tan [-3.0, -1.0] = [entire]; tan [-3.0, -2.0] = [0x123ef71254b86fp-55, 0x117af62e0950f9p-51]; tan [-3.0, -3.0] = [0x123ef71254b86fp-55, 0x123ef71254b870p-55]; tan [-2.0, 7.0] = [entire]; tan [-2.0, 6.0] = [entire]; tan [-2.0, 5.0] = [entire]; tan [-2.0, 4.0] = [entire]; tan [-2.0, 3.0] = [entire]; tan [-2.0, 2.0] = [entire]; tan [-2.0, 1.0] = [entire]; tan [-2.0, 0.0] = [entire]; tan [-2.0, -1.0] = [entire]; tan [-2.0, -2.0] = [0x117af62e0950f8p-51, 0x117af62e0950f9p-51]; tan [-1.0, 7.0] = [entire]; tan [-1.0, 6.0] = [entire]; tan [-1.0, 5.0] = [entire]; tan [-1.0, 4.0] = [entire]; tan [-1.0, 3.0] = [entire]; tan [-1.0, 2.0] = [entire]; tan [-1.0, 1.0] = [-0x18eb245cbee3a6p-52, 0x18eb245cbee3a6p-52]; tan [-1.0, 0.0] = [-0x18eb245cbee3a6p-52, 0.0]; tan [-1.0, -1.0] = [-0x18eb245cbee3a6p-52, -0x18eb245cbee3a5p-52]; tan [1.0, 7.0] = [entire]; tan [1.0, 6.0] = [entire]; tan [1.0, 5.0] = [entire]; tan [1.0, 4.0] = [entire]; tan [1.0, 3.0] = [entire]; tan [1.0, 2.0] = [entire]; tan [1.0, 1.0] = [0x18eb245cbee3a5p-52, 0x18eb245cbee3a6p-52]; tan [2.0, 7.0] = [entire]; tan [2.0, 6.0] = [entire]; tan [2.0, 5.0] = [entire]; tan [2.0, 4.0] = [-0x117af62e0950f9p-51, 0x12866f9be4de14p-52]; tan [2.0, 3.0] = [-0x117af62e0950f9p-51, -0x123ef71254b86fp-55]; tan [2.0, 2.0] = [-0x117af62e0950f9p-51, -0x117af62e0950f8p-51]; tan [3.0, 7.0] = [entire]; tan [3.0, 6.0] = [entire]; tan [3.0, 5.0] = [entire]; tan [3.0, 4.0] = [-0x123ef71254b870p-55, 0x12866f9be4de14p-52]; tan [3.0, 3.0] = [-0x123ef71254b870p-55, -0x123ef71254b86fp-55]; tan [4.0, 7.0] = [entire]; tan [4.0, 6.0] = [entire]; tan [4.0, 5.0] = [entire]; tan [4.0, 4.0] = [0x12866f9be4de13p-52, 0x12866f9be4de14p-52]; tan [5.0, 7.0] = [-0x1b0b4b739bbb07p-51, 0x1be2e6e13eea79p-53]; tan [5.0, 6.0] = [-0x1b0b4b739bbb07p-51, -0x129fd86ebb95bep-54]; tan [5.0, 5.0] = [-0x1b0b4b739bbb07p-51, -0x1b0b4b739bbb06p-51]; tan [6.0, 7.0] = [-0x129fd86ebb95bfp-54, 0x1be2e6e13eea79p-53]; tan [6.0, 6.0] = [-0x129fd86ebb95bfp-54, -0x129fd86ebb95bep-54]; tan [7.0, 7.0] = [0x1be2e6e13eea78p-53, 0x1be2e6e13eea79p-53]; } testcase mpfi_tanh { // special values tanh [-infinity, -7.0] = [-1.0, -0x1ffffc832750f1p-53]; tanh [-infinity, 0.0] = [-1.0, 0.0]; tanh [-infinity, 8.0] = [-1.0, 0x1fffff872a91f9p-53]; tanh [entire] = [-1.0, +1.0]; tanh [-1.0, 0.0] = [-0x185efab514f395p-53, 0.0]; tanh [0.0, 0.0] = [0.0, 0.0]; tanh [0.0, 1.0] = [0.0, 0x185efab514f395p-53]; tanh [0.0, 8.0] = [0.0, 0x1fffff872a91f9p-53]; tanh [0.0, +infinity] = [0.0, +1.0]; // regular values tanh [-0.125, 0.0] = [-0x1fd5992bc4b835p-56, 0.0]; tanh [0.0, 0x10000000000001p-53] = [0.0, 0x1d9353d7568af5p-54]; tanh [-4.5, -0.625] = [-0x1ffdfa72153984p-53, -0x11bf47eabb8f95p-53]; tanh [1.0, 3.0] = [0x185efab514f394p-53, 0x1fd77d111a0b00p-53]; tanh [17.0, 18.0] = [0x1fffffffffffe1p-53, 0x1ffffffffffffcp-53]; } testcase mpfi_union { // special values convexHull [-infinity, -7.0] [-1.0, +8.0] = [-infinity, +8.0]; convexHull [-infinity, 0.0] [+8.0, +infinity] = [entire]; convexHull [-infinity, +8.0] [0.0, +8.0] = [-infinity, +8.0]; convexHull [entire] [0.0, +8.0] = [entire]; convexHull [0.0, 0.0] [-infinity, -7.0] = [-infinity, 0.0]; convexHull [0.0, +8.0] [-7.0, 0.0] = [-7.0, +8.0]; convexHull [0.0, 0.0] [0.0, +8.0] = [0.0, +8.0]; convexHull [0.0, +infinity] [0.0, +8.0] = [0.0, +infinity]; convexHull [0.0, 0.0] [+8.0, +infinity] = [0.0, +infinity]; convexHull [0.0, 0.0] [entire] = [entire]; convexHull [0.0, +8.0] [-7.0, +8.0] = [-7.0, +8.0]; convexHull [0.0, 0.0] [0.0, 0.0] = [0.0, 0.0]; convexHull [0.0, +infinity] [0.0, +8.0] = [0.0, +infinity]; // regular values convexHull [0x12p0, 0x90p0] [-0x0dp0, 0x34p0] = [-0x0dp0, 0x90p0]; } interval-2.1.0/test/pow_rev.itl0000644000000000000000000016204113031036767014650 0ustar 00000000000000/* Copyright 2015-2016 Oliver Heimlich 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 . */ /* The following tests use boundaries for the first parameter whose reciprocal can be computed without round-off error in a binary floating-point context. Thus, an implementation should be able to compute tight results with the formula x = z ^ (1 / y) for the intervals used here. The test values are structured according to table B.1 in Heimlich, Oliver. 2011. “The General Interval Power Function.” Diplomarbeit, Institute for Computer Science, University of Würzburg. http://exp.ln0.de/heimlich-power-2011.htm. */ testcase minimal.powRev1_test { // Empty intervals powRev1 [empty] [empty] [empty] = [empty]; powRev1 [empty] [entire] [empty] = [empty]; powRev1 [entire] [empty] [empty] = [empty]; powRev1 [entire] [entire] [empty] = [empty]; powRev1 [empty] [empty] [entire] = [empty]; powRev1 [empty] [entire] [entire] = [empty]; powRev1 [entire] [empty] [entire] = [empty]; // Entire range powRev1 [entire] [entire] [entire] = [0.0, infinity]; // Outside of the function's domain powRev1 [entire] [entire] [-infinity,-1.0] = [empty]; powRev1 [-infinity,-1.0] [entire] [-infinity,0.0] = [empty]; powRev1 [-infinity,0.0] [entire] [-infinity,0.0] = [empty]; powRev1 [-infinity,0.0] [-infinity,0.0] [entire] = [empty]; powRev1 [-infinity,0.0] [-infinity,0.9] [0.0,1.0] = [empty]; powRev1 [-infinity,0.0] [1.1,infinity] [1.0,infinity] = [empty]; powRev1 [0.0,infinity] [1.1,infinity] [0.0,1.0] = [empty]; powRev1 [0.0,infinity] [-infinity,0.9] [1.0,infinity] = [empty]; powRev1 [0.0,0.0] [1.0,1.0] [-infinity,0.0] = [empty]; // 0^y = 0 powRev1 [entire] [0.0,0.0] [entire] = [0.0,0.0]; powRev1 [entire] [-infinity,0.0] [entire] = [0.0,0.0]; powRev1 [0.0,infinity] [-infinity,0.0] [entire] = [0.0,0.0]; powRev1 [0.0,infinity] [0.0,0.0] [entire] = [0.0,0.0]; powRev1 [1.0,2.0] [0.0,0.0] [entire] = [0.0,0.0]; powRev1 [1.0,1.0] [0.0,0.0] [0.0,0.0] = [0.0,0.0]; // 1^y = x^0 = 1 powRev1 [entire] [1.0,1.0] [1.0,1.0] = [1.0,1.0]; powRev1 [0.0,0.0] [1.0,1.0] [entire] = [0.0,infinity]; powRev1 [0.0,0.0] [1.0,1.0] [2.0,3.0] = [2.0,3.0]; powRev1 [entire] [1.0,1.0] [entire] = [0.0,infinity]; powRev1 [entire] [1.0,1.0] [20.0,30.0] = [20.0,30.0]; powRev1 [0.0,0.0] [1.0,1.0] [1.0,1.0] = [1.0,1.0]; // y < 0, z overlaps/starts [0,1] powRev1 [-4.0,-2.0] [0.0,0.5] [entire] = [0x1.306FE0A31B715p0, infinity]; powRev1 [-infinity,-2.0] [0.0,0.5] [entire] = [1.0, infinity]; powRev1 [-4.0,-2.0] [-infinity,0.5] [entire] = [0x1.306FE0A31B715p0, infinity]; powRev1 [-infinity,-2.0] [-infinity,0.5] [entire] = [1.0, infinity]; // y < 0, z containedBy [0, 1] powRev1 [-4.0,-2.0] [0.25,0.5] [entire] = [0x1.306FE0A31B715p0, 2.0]; powRev1 [-infinity,-2.0] [0.25,0.5] [entire] = [1.0, 2.0]; // y < 0, z finishes [0, 1] powRev1 [-4.0,-2.0] [0.25,1.0] [entire] = [1.0, 2.0]; powRev1 [-infinity,-2.0] [0.25,1.0] [entire] = [1.0, 2.0]; powRev1 [-4.0,-2.0] [1.0,1.0] [entire] = [1.0, 1.0]; powRev1 [-infinity,-2.0] [1.0,1.0] [entire] = [1.0, 1.0]; // y < 0, z equals/finishedBy [0, 1] powRev1 [-4.0,-2.0] [0.0,1.0] [entire] = [1.0, infinity]; powRev1 [-infinity,-2.0] [0.0,1.0] [entire] = [1.0, infinity]; // y < 0, z contains/startedBy [0, 1] powRev1 [-4.0,-2.0] [0.0,2.0] [entire] = [0x1.6A09E667F3BCCp-1, infinity]; powRev1 [-infinity,-2.0] [0.0,2.0] [entire] = [0x1.6A09E667F3BCCp-1, infinity]; powRev1 [-4.0,-2.0] [0.0,infinity] [entire] = [0.0, infinity]; powRev1 [-infinity,-2.0] [0.0,infinity] [entire] = [0.0, infinity]; powRev1 [-4.0,-2.0] [-infinity,2.0] [entire] = [0x1.6A09E667F3BCCp-1, infinity]; powRev1 [-infinity,-2.0] [-infinity,2.0] [entire] = [0x1.6A09E667F3BCCp-1, infinity]; powRev1 [-4.0,-2.0] [-infinity,infinity] [entire] = [0.0, infinity]; powRev1 [-infinity,-2.0] [-infinity,infinity] [entire] = [0.0, infinity]; // y < 0, z overlappedBy [0, 1] powRev1 [-4.0,-2.0] [0.5,2.0] [entire] = [0x1.6A09E667F3BCCp-1, 0x1.6A09E667F3BCDp0]; powRev1 [-infinity,-2.0] [0.5,2.0] [entire] = [0x1.6A09E667F3BCCp-1, 0x1.6A09E667F3BCDp0]; powRev1 [-4.0,-2.0] [0.5,infinity] [entire] = [0.0, 0x1.6A09E667F3BCDp0]; powRev1 [-infinity,-2.0] [0.5,infinity] [entire] = [0.0, 0x1.6A09E667F3BCDp0]; // y < 0, z metBy [0, 1] powRev1 [-4.0,-2.0] [1.0,2.0] [entire] = [0x1.6A09E667F3BCCp-1, 1.0]; powRev1 [-infinity,-2.0] [1.0,2.0] [entire] = [0x1.6A09E667F3BCCp-1, 1.0]; powRev1 [-4.0,-2.0] [1.0,infinity] [entire] = [0.0, 1.0]; powRev1 [-infinity,-2.0] [1.0,infinity] [entire] = [0.0, 1.0]; // y < 0, z after [0, 1] powRev1 [-4.0,-2.0] [2.0,4.0] [entire] = [0.5, 0x1.AE89F995AD3AEp-1]; powRev1 [-infinity,-2.0] [2.0,4.0] [entire] = [0.5, 1.0]; powRev1 [-4.0,-2.0] [2.0,infinity] [entire] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [-infinity,-2.0] [2.0,infinity] [entire] = [0.0, 1.0]; // y = 0, z overlaps/starts [0,1] powRev1 [0.0,0.0] [0.0,0.5] [entire] = [empty]; powRev1 [0.0,0.0] [-infinity,0.5] [entire] = [empty]; // y = 0, z containedBy [0, 1] powRev1 [0.0,0.0] [0.25,0.5] [entire] = [empty]; // y = 0, z finishes [0, 1] powRev1 [0.0,0.0] [0.25,1.0] [entire] = [0.0, infinity]; powRev1 [0.0,0.0] [1.0,1.0] [entire] = [0.0, infinity]; // y = 0, z equals/finishedBy [0, 1] powRev1 [0.0,0.0] [0.0,1.0] [entire] = [0.0, infinity]; // y = 0, z contains/startedBy [0, 1] powRev1 [0.0,0.0] [0.0,2.0] [entire] = [0.0, infinity]; powRev1 [0.0,0.0] [0.0,infinity] [entire] = [0.0, infinity]; powRev1 [0.0,0.0] [-infinity,2.0] [entire] = [0.0, infinity]; powRev1 [0.0,0.0] [-infinity,infinity] [entire] = [0.0, infinity]; // y = 0, z overlappedBy [0, 1] powRev1 [0.0,0.0] [0.5,2.0] [entire] = [0.0, infinity]; powRev1 [0.0,0.0] [0.5,infinity] [entire] = [0.0, infinity]; // y = 0, z metBy [0, 1] powRev1 [0.0,0.0] [1.0,2.0] [entire] = [0.0, infinity]; powRev1 [0.0,0.0] [1.0,infinity] [entire] = [0.0, infinity]; // y = 0, z after [0, 1] powRev1 [0.0,0.0] [2.0,4.0] [entire] = [empty]; powRev1 [0.0,0.0] [2.0,infinity] [entire] = [empty]; // y finishedBy 0, z overlaps/starts [0,1] powRev1 [-4.0,0.0] [0.0,0.5] [entire] = [0x1.306FE0A31B715p0, infinity]; powRev1 [-infinity,0.0] [0.0,0.5] [entire] = [1.0, infinity]; powRev1 [-4.0,0.0] [-infinity,0.5] [entire] = [0x1.306FE0A31B715p0, infinity]; powRev1 [-infinity,0.0] [-infinity,0.5] [entire] = [1.0, infinity]; // y finishedBy 0, z containedBy [0, 1] powRev1 [-4.0,0.0] [0.25,0.5] [entire] = [0x1.306FE0A31B715p0, infinity]; powRev1 [-infinity,0.0] [0.25,0.5] [entire] = [1.0, infinity]; // y finishedBy 0, z finishes [0, 1] powRev1 [-4.0,0.0] [0.25,1.0] [entire] = [0.0, infinity]; powRev1 [-infinity,0.0] [0.25,1.0] [entire] = [0.0, infinity]; powRev1 [-4.0,0.0] [1.0,1.0] [entire] = [0.0, infinity]; powRev1 [-infinity,0.0] [1.0,1.0] [entire] = [0.0, infinity]; // y finishedBy 0, z equals/finishedBy [0, 1] powRev1 [-4.0,0.0] [0.0,1.0] [entire] = [0.0, infinity]; powRev1 [-infinity,0.0] [0.0,1.0] [entire] = [0.0, infinity]; // y finishedBy 0, z contains/startedBy [0, 1] powRev1 [-4.0,0.0] [0.0,2.0] [entire] = [0.0, infinity]; powRev1 [-infinity,0.0] [0.0,2.0] [entire] = [0.0, infinity]; powRev1 [-4.0,0.0] [0.0,infinity] [entire] = [0.0, infinity]; powRev1 [-infinity,0.0] [0.0,infinity] [entire] = [0.0, infinity]; powRev1 [-4.0,0.0] [-infinity,2.0] [entire] = [0.0, infinity]; powRev1 [-infinity,0.0] [-infinity,2.0] [entire] = [0.0, infinity]; powRev1 [-4.0,0.0] [-infinity,infinity] [entire] = [0.0, infinity]; powRev1 [-infinity,0.0] [-infinity,infinity] [entire] = [0.0, infinity]; // y finishedBy 0, z overlappedBy [0, 1] powRev1 [-4.0,0.0] [0.5,2.0] [entire] = [0.0, infinity]; powRev1 [-infinity,0.0] [0.5,2.0] [entire] = [0.0, infinity]; powRev1 [-4.0,0.0] [0.5,infinity] [entire] = [0.0, infinity]; powRev1 [-infinity,0.0] [0.5,infinity] [entire] = [0.0, infinity]; // y finishedBy 0, z metBy [0, 1] powRev1 [-4.0,0.0] [1.0,2.0] [entire] = [0.0, infinity]; powRev1 [-infinity,0.0] [1.0,2.0] [entire] = [0.0, infinity]; powRev1 [-4.0,0.0] [1.0,infinity] [entire] = [0.0, infinity]; powRev1 [-infinity,0.0] [1.0,infinity] [entire] = [0.0, infinity]; // y finishedBy 0, z after [0, 1] powRev1 [-4.0,0.0] [2.0,4.0] [entire] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [-infinity,0.0] [2.0,4.0] [entire] = [0.0, 1.0]; powRev1 [-4.0,0.0] [2.0,infinity] [entire] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [-infinity,0.0] [2.0,infinity] [entire] = [0.0, 1.0]; // y contains 0, z overlaps/starts [0,1] powRev1 [-4.0,4.0] [0.0,0.5] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [0.0,0.5] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [-infinity,0.5] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [-infinity,0.5] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [0.0,0.5] [entire] = [0.0, infinity]; powRev1 [entire] [0.0,0.5] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [-infinity,0.5] [entire] = [0.0, infinity]; powRev1 [entire] [-infinity,0.5] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [0.0,0.5] [0.0, 1.0] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [-infinity,4.0] [0.0,0.5] [0.0, 1.0] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [-4.0,4.0] [-infinity,0.5] [0.0, 1.0] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [-infinity,4.0] [-infinity,0.5] [0.0, 1.0] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [-4.0,infinity] [0.0,0.5] [0.0, 1.0] = [0.0, 1.0]; powRev1 [entire] [0.0,0.5] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [-infinity,0.5] [0.0, 1.0] = [0.0, 1.0]; powRev1 [entire] [-infinity,0.5] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [0.0,0.5] [1.0, infinity] = [0x1.306FE0A31B715p0, infinity]; powRev1 [-infinity,4.0] [0.0,0.5] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,4.0] [-infinity,0.5] [1.0, infinity] = [0x1.306FE0A31B715p0, infinity]; powRev1 [-infinity,4.0] [-infinity,0.5] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [0.0,0.5] [1.0, infinity] = [0x1.306FE0A31B715p0, infinity]; powRev1 [entire] [0.0,0.5] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [-infinity,0.5] [1.0, infinity] = [0x1.306FE0A31B715p0, infinity]; powRev1 [entire] [-infinity,0.5] [1.0, infinity] = [1.0, infinity]; // y contains 0, z containedBy [0, 1] powRev1 [-4.0,4.0] [0.25,0.5] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [0.25,0.5] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [0.25,0.5] [entire] = [0.0, infinity]; powRev1 [entire] [0.25,0.5] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [0.25,0.5] [0.0, 1.0] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [-infinity,4.0] [0.25,0.5] [0.0, 1.0] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [-4.0,infinity] [0.25,0.5] [0.0, 1.0] = [0.0, 1.0]; powRev1 [entire] [0.25,0.5] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [0.25,0.5] [1.0, infinity] = [0x1.306FE0A31B715p0, infinity]; powRev1 [-infinity,4.0] [0.25,0.5] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [0.25,0.5] [1.0, infinity] = [0x1.306FE0A31B715p0, infinity]; powRev1 [entire] [0.25,0.5] [1.0, infinity] = [1.0, infinity]; // y contains 0, z finishes [0, 1] powRev1 [-4.0,4.0] [0.25,1.0] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [0.25,1.0] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [1.0,1.0] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [1.0,1.0] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [0.25,1.0] [entire] = [0.0, infinity]; powRev1 [entire] [0.25,1.0] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [1.0,1.0] [entire] = [0.0, infinity]; powRev1 [entire] [1.0,1.0] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [0.25,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-infinity,4.0] [0.25,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [1.0,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-infinity,4.0] [1.0,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [0.25,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [entire] [0.25,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [1.0,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [entire] [1.0,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [0.25,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [-infinity,4.0] [0.25,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,4.0] [1.0,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [-infinity,4.0] [1.0,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [0.25,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [entire] [0.25,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [1.0,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [entire] [1.0,1.0] [1.0, infinity] = [1.0, infinity]; // y contains 0, z equals/contains [0, 1] powRev1 [-4.0,4.0] [0.0,1.0] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [0.0,1.0] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [0.0,1.0] [entire] = [0.0, infinity]; powRev1 [entire] [0.0,1.0] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [0.0,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-infinity,4.0] [0.0,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [0.0,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [entire] [0.0,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [0.0,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [-infinity,4.0] [0.0,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [0.0,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [entire] [0.0,1.0] [1.0, infinity] = [1.0, infinity]; // y contains 0, z contains/startedBy [0, 1] powRev1 [-4.0,4.0] [0.0,2.0] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [0.0,2.0] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [0.0,infinity] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [0.0,infinity] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [-infinity,2.0] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [-infinity,2.0] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [-infinity,infinity] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [-infinity,infinity] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [0.0,2.0] [entire] = [0.0, infinity]; powRev1 [entire] [0.0,2.0] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [0.0,infinity] [entire] = [0.0, infinity]; powRev1 [entire] [0.0,infinity] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [-infinity,2.0] [entire] = [0.0, infinity]; powRev1 [entire] [-infinity,2.0] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [-infinity,infinity] [entire] = [0.0, infinity]; powRev1 [entire] [-infinity,infinity] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [0.0,2.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-infinity,4.0] [0.0,2.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [0.0,infinity] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-infinity,4.0] [0.0,infinity] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [-infinity,2.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-infinity,4.0] [-infinity,2.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [-infinity,infinity] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-infinity,4.0] [-infinity,infinity] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [0.0,2.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [entire] [0.0,2.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [0.0,infinity] [0.0, 1.0] = [0.0, 1.0]; powRev1 [entire] [0.0,infinity] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [-infinity,2.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [entire] [-infinity,2.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [-infinity,infinity] [0.0, 1.0] = [0.0, 1.0]; powRev1 [entire] [-infinity,infinity] [0.0, 1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [0.0,2.0] [1.0, infinity] = [1.0, infinity]; powRev1 [-infinity,4.0] [0.0,2.0] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,4.0] [0.0,infinity] [1.0, infinity] = [1.0, infinity]; powRev1 [-infinity,4.0] [0.0,infinity] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,4.0] [-infinity,2.0] [1.0, infinity] = [1.0, infinity]; powRev1 [-infinity,4.0] [-infinity,2.0] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,4.0] [-infinity,infinity] [1.0, infinity] = [1.0, infinity]; powRev1 [-infinity,4.0] [-infinity,infinity] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [0.0,2.0] [1.0, infinity] = [1.0, infinity]; powRev1 [entire] [0.0,2.0] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [0.0,infinity] [1.0, infinity] = [1.0, infinity]; powRev1 [entire] [0.0,infinity] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [-infinity,2.0] [1.0, infinity] = [1.0, infinity]; powRev1 [entire] [-infinity,2.0] [1.0, infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [-infinity,infinity] [1.0, infinity] = [1.0, infinity]; powRev1 [entire] [-infinity,infinity] [1.0, infinity] = [1.0, infinity]; // y contains 0, z overlappedBy [0, 1] powRev1 [-4.0,4.0] [0.5,2.0] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [0.5,2.0] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [0.5,infinity] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [0.5,infinity] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [0.5,2.0] [entire] = [0.0, infinity]; powRev1 [entire] [0.5,2.0] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [0.5,infinity] [entire] = [0.0, infinity]; powRev1 [entire] [0.5,infinity] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [0.5,2.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [-infinity,4.0] [0.5,2.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [0.5,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [-infinity,4.0] [0.5,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [0.5,2.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [entire] [0.5,2.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [0.5,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [entire] [0.5,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [0.5,2.0] [1.0,infinity] = [1.0, infinity]; powRev1 [-infinity,4.0] [0.5,2.0] [1.0,infinity] = [1.0, infinity]; powRev1 [-4.0,4.0] [0.5,infinity] [1.0,infinity] = [1.0, infinity]; powRev1 [-infinity,4.0] [0.5,infinity] [1.0,infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [0.5,2.0] [1.0,infinity] = [1.0, infinity]; powRev1 [entire] [0.5,2.0] [1.0,infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [0.5,infinity] [1.0,infinity] = [1.0, infinity]; powRev1 [entire] [0.5,infinity] [1.0,infinity] = [1.0, infinity]; // y contains 0, z metBy [0, 1] powRev1 [-4.0,4.0] [1.0,2.0] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [1.0,2.0] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [1.0,infinity] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [1.0,infinity] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [1.0,2.0] [entire] = [0.0, infinity]; powRev1 [entire] [1.0,2.0] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [1.0,infinity] [entire] = [0.0, infinity]; powRev1 [entire] [1.0,infinity] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [1.0,2.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [-infinity,4.0] [1.0,2.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [1.0,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [-infinity,4.0] [1.0,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [1.0,2.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [entire] [1.0,2.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [1.0,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [entire] [1.0,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [1.0,2.0] [1.0,infinity] = [1.0, infinity]; powRev1 [-infinity,4.0] [1.0,2.0] [1.0,infinity] = [1.0, infinity]; powRev1 [-4.0,4.0] [1.0,infinity] [1.0,infinity] = [1.0, infinity]; powRev1 [-infinity,4.0] [1.0,infinity] [1.0,infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [1.0,2.0] [1.0,infinity] = [1.0, infinity]; powRev1 [entire] [1.0,2.0] [1.0,infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [1.0,infinity] [1.0,infinity] = [1.0, infinity]; powRev1 [entire] [1.0,infinity] [1.0,infinity] = [1.0, infinity]; // y contains 0, z after [0, 1] powRev1 [-4.0,4.0] [2.0,4.0] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [2.0,4.0] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [2.0,infinity] [entire] = [0.0, infinity]; powRev1 [-infinity,4.0] [2.0,infinity] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [2.0,4.0] [entire] = [0.0, infinity]; powRev1 [entire] [2.0,4.0] [entire] = [0.0, infinity]; powRev1 [-4.0,infinity] [2.0,infinity] [entire] = [0.0, infinity]; powRev1 [entire] [2.0,infinity] [entire] = [0.0, infinity]; powRev1 [-4.0,4.0] [2.0,4.0] [0.0,1.0] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [-infinity,4.0] [2.0,4.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [2.0,infinity] [0.0,1.0] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [-infinity,4.0] [2.0,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [2.0,4.0] [0.0,1.0] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [entire] [2.0,4.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [-4.0,infinity] [2.0,infinity] [0.0,1.0] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [entire] [2.0,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [-4.0,4.0] [2.0,4.0] [1.0,infinity] = [0x1.306FE0A31B715p0, infinity]; powRev1 [-infinity,4.0] [2.0,4.0] [1.0,infinity] = [0x1.306FE0A31B715p0, infinity]; powRev1 [-4.0,4.0] [2.0,infinity] [1.0,infinity] = [0x1.306FE0A31B715p0, infinity]; powRev1 [-infinity,4.0] [2.0,infinity] [1.0,infinity] = [0x1.306FE0A31B715p0, infinity]; powRev1 [-4.0,infinity] [2.0,4.0] [1.0,infinity] = [1.0, infinity]; powRev1 [entire] [2.0,4.0] [1.0,infinity] = [1.0, infinity]; powRev1 [-4.0,infinity] [2.0,infinity] [1.0,infinity] = [1.0, infinity]; powRev1 [entire] [2.0,infinity] [1.0,infinity] = [1.0, infinity]; // y startedBy 0, z overlaps/starts [0,1] powRev1 [0.0,4.0] [0.0,0.5] [entire] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [0.0,4.0] [-infinity,0.5] [entire] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [0.0,infinity] [0.0,0.5] [entire] = [0.0, 1.0]; powRev1 [0.0,infinity] [-infinity,0.5] [entire] = [0.0, 1.0]; powRev1 [0.0,4.0] [0.0,0.5] [0.0, 1.0] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [0.0,4.0] [-infinity,0.5] [0.0, 1.0] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [0.0,infinity] [0.0,0.5] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,infinity] [-infinity,0.5] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,4.0] [0.0,0.5] [1.0, infinity] = [empty]; powRev1 [0.0,4.0] [-infinity,0.5] [1.0, infinity] = [empty]; powRev1 [0.0,infinity] [0.0,0.5] [1.0, infinity] = [empty]; powRev1 [0.0,infinity] [-infinity,0.5] [1.0, infinity] = [empty]; // y startedBy 0, z containedBy [0, 1] powRev1 [0.0,4.0] [0.25,0.5] [entire] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [0.0,infinity] [0.25,0.5] [entire] = [0.0, 1.0]; powRev1 [0.0,4.0] [0.25,0.5] [0.0, 1.0] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [0.0,infinity] [0.25,0.5] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,4.0] [0.25,0.5] [1.0, infinity] = [empty]; powRev1 [0.0,infinity] [0.25,0.5] [1.0, infinity] = [empty]; // y startedBy 0, z finishes [0, 1] powRev1 [0.0,4.0] [0.25,1.0] [entire] = [0.0, infinity]; powRev1 [0.0,4.0] [1.0,1.0] [entire] = [0.0, infinity]; powRev1 [0.0,infinity] [0.25,1.0] [entire] = [0.0, infinity]; powRev1 [0.0,infinity] [1.0,1.0] [entire] = [0.0, infinity]; powRev1 [0.0,4.0] [0.25,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,4.0] [1.0,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,infinity] [0.25,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,infinity] [1.0,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,4.0] [0.25,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [0.0,4.0] [1.0,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [0.0,infinity] [0.25,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [0.0,infinity] [1.0,1.0] [1.0, infinity] = [1.0, infinity]; // y startedBy 0, z equals/contains [0, 1] powRev1 [0.0,4.0] [0.0,1.0] [entire] = [0.0, infinity]; powRev1 [0.0,infinity] [0.0,1.0] [entire] = [0.0, infinity]; powRev1 [0.0,4.0] [0.0,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,infinity] [0.0,1.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,4.0] [0.0,1.0] [1.0, infinity] = [1.0, infinity]; powRev1 [0.0,infinity] [0.0,1.0] [1.0, infinity] = [1.0, infinity]; // y startedBy 0, z contains/startedBy [0, 1] powRev1 [0.0,4.0] [0.0,2.0] [entire] = [0.0, infinity]; powRev1 [0.0,4.0] [0.0,infinity] [entire] = [0.0, infinity]; powRev1 [0.0,4.0] [-infinity,2.0] [entire] = [0.0, infinity]; powRev1 [0.0,4.0] [-infinity,infinity] [entire] = [0.0, infinity]; powRev1 [0.0,infinity] [0.0,2.0] [entire] = [0.0, infinity]; powRev1 [0.0,infinity] [0.0,infinity] [entire] = [0.0, infinity]; powRev1 [0.0,infinity] [-infinity,2.0] [entire] = [0.0, infinity]; powRev1 [0.0,infinity] [-infinity,infinity] [entire] = [0.0, infinity]; powRev1 [0.0,4.0] [0.0,2.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,4.0] [0.0,infinity] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,4.0] [-infinity,2.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,4.0] [-infinity,infinity] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,infinity] [0.0,2.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,infinity] [0.0,infinity] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,infinity] [-infinity,2.0] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,infinity] [-infinity,infinity] [0.0, 1.0] = [0.0, 1.0]; powRev1 [0.0,4.0] [0.0,2.0] [1.0, infinity] = [1.0, infinity]; powRev1 [0.0,4.0] [0.0,infinity] [1.0, infinity] = [1.0, infinity]; powRev1 [0.0,4.0] [-infinity,2.0] [1.0, infinity] = [1.0, infinity]; powRev1 [0.0,4.0] [-infinity,infinity] [1.0, infinity] = [1.0, infinity]; powRev1 [0.0,infinity] [0.0,2.0] [1.0, infinity] = [1.0, infinity]; powRev1 [0.0,infinity] [0.0,infinity] [1.0, infinity] = [1.0, infinity]; powRev1 [0.0,infinity] [-infinity,2.0] [1.0, infinity] = [1.0, infinity]; powRev1 [0.0,infinity] [-infinity,infinity] [1.0, infinity] = [1.0, infinity]; // y startedBy 0, z overlappedBy [0, 1] powRev1 [0.0,4.0] [0.5,2.0] [entire] = [0.0, infinity]; powRev1 [0.0,4.0] [0.5,infinity] [entire] = [0.0, infinity]; powRev1 [0.0,infinity] [0.5,2.0] [entire] = [0.0, infinity]; powRev1 [0.0,infinity] [0.5,infinity] [entire] = [0.0, infinity]; powRev1 [0.0,4.0] [0.5,2.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [0.0,4.0] [0.5,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [0.0,infinity] [0.5,2.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [0.0,infinity] [0.5,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [0.0,4.0] [0.5,2.0] [1.0,infinity] = [1.0, infinity]; powRev1 [0.0,4.0] [0.5,infinity] [1.0,infinity] = [1.0, infinity]; powRev1 [0.0,infinity] [0.5,2.0] [1.0,infinity] = [1.0, infinity]; powRev1 [0.0,infinity] [0.5,infinity] [1.0,infinity] = [1.0, infinity]; // y startedBy 0, z metBy [0, 1] powRev1 [0.0,4.0] [1.0,2.0] [entire] = [0.0, infinity]; powRev1 [0.0,4.0] [1.0,infinity] [entire] = [0.0, infinity]; powRev1 [0.0,infinity] [1.0,2.0] [entire] = [0.0, infinity]; powRev1 [0.0,infinity] [1.0,infinity] [entire] = [0.0, infinity]; powRev1 [0.0,4.0] [1.0,2.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [0.0,4.0] [1.0,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [0.0,infinity] [1.0,2.0] [0.0,1.0] = [0.0, 1.0]; powRev1 [0.0,infinity] [1.0,infinity] [0.0,1.0] = [0.0, 1.0]; powRev1 [0.0,4.0] [1.0,2.0] [1.0,infinity] = [1.0, infinity]; powRev1 [0.0,4.0] [1.0,infinity] [1.0,infinity] = [1.0, infinity]; powRev1 [0.0,infinity] [1.0,2.0] [1.0,infinity] = [1.0, infinity]; powRev1 [0.0,infinity] [1.0,infinity] [1.0,infinity] = [1.0, infinity]; // y startedBy 0, z after [0, 1] powRev1 [0.0,4.0] [2.0,4.0] [entire] = [0x1.306FE0A31B715p0, infinity]; powRev1 [0.0,4.0] [2.0,infinity] [entire] = [0x1.306FE0A31B715p0, infinity]; powRev1 [0.0,infinity] [2.0,4.0] [entire] = [1.0, infinity]; powRev1 [0.0,infinity] [2.0,infinity] [entire] = [1.0, infinity]; powRev1 [0.0,4.0] [2.0,4.0] [0.0,1.0] = [empty]; powRev1 [0.0,4.0] [2.0,infinity] [0.0,1.0] = [empty]; powRev1 [0.0,infinity] [2.0,4.0] [0.0,1.0] = [empty]; powRev1 [0.0,infinity] [2.0,infinity] [0.0,1.0] = [empty]; powRev1 [0.0,4.0] [2.0,4.0] [1.0,infinity] = [0x1.306FE0A31B715p0, infinity]; powRev1 [0.0,4.0] [2.0,infinity] [1.0,infinity] = [0x1.306FE0A31B715p0, infinity]; powRev1 [0.0,infinity] [2.0,4.0] [1.0,infinity] = [1.0, infinity]; powRev1 [0.0,infinity] [2.0,infinity] [1.0,infinity] = [1.0, infinity]; // y after 0, z overlaps/starts [0,1] powRev1 [2.0,4.0] [0.0,0.5] [entire] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [2.0,4.0] [-infinity,0.5] [entire] = [0.0, 0x1.AE89F995AD3AEp-1]; powRev1 [2.0,infinity] [0.0,0.5] [entire] = [0.0, 1.0]; powRev1 [2.0,infinity] [-infinity,0.5] [entire] = [0.0, 1.0]; // y after 0, z containedBy [0, 1] powRev1 [2.0,4.0] [0.25,0.5] [entire] = [0.5, 0x1.AE89F995AD3AEp-1]; powRev1 [2.0,infinity] [0.25,0.5] [entire] = [0.5, 1.0]; // y after 0, z finishes [0, 1] powRev1 [2.0,4.0] [0.25,1.0] [entire] = [0.5, 1.0]; powRev1 [2.0,4.0] [1.0,1.0] [entire] = [1.0, 1.0]; powRev1 [2.0,infinity] [0.25,1.0] [entire] = [0.5, 1.0]; powRev1 [2.0,infinity] [1.0,1.0] [entire] = [1.0, 1.0]; // y after 0, z equals/contains [0, 1] powRev1 [2.0,4.0] [0.0,1.0] [entire] = [0.0, 1.0]; powRev1 [2.0,infinity] [0.0,1.0] [entire] = [0.0, 1.0]; // y after 0, z contains/startedBy [0, 1] powRev1 [2.0,4.0] [0.0,2.0] [entire] = [0.0, 0x1.6A09E667F3BCDp0]; powRev1 [2.0,4.0] [0.0,infinity] [entire] = [0.0, infinity]; powRev1 [2.0,4.0] [-infinity,2.0] [entire] = [0.0, 0x1.6A09E667F3BCDp0]; powRev1 [2.0,4.0] [-infinity,infinity] [entire] = [0.0, infinity]; powRev1 [2.0,infinity] [0.0,2.0] [entire] = [0.0, 0x1.6A09E667F3BCDp0]; powRev1 [2.0,infinity] [0.0,infinity] [entire] = [0.0, infinity]; powRev1 [2.0,infinity] [-infinity,2.0] [entire] = [0.0, 0x1.6A09E667F3BCDp0]; powRev1 [2.0,infinity] [-infinity,infinity] [entire] = [0.0, infinity]; // y after 0, z overlappedBy [0, 1] powRev1 [2.0,4.0] [0.5,2.0] [entire] = [0x1.6A09E667F3BCCp-1, 0x1.6A09E667F3BCDp0]; powRev1 [2.0,4.0] [0.5,infinity] [entire] = [0x1.6A09E667F3BCCp-1, infinity]; powRev1 [2.0,infinity] [0.5,2.0] [entire] = [0x1.6A09E667F3BCCp-1, 0x1.6A09E667F3BCDp0]; powRev1 [2.0,infinity] [0.5,infinity] [entire] = [0x1.6A09E667F3BCCp-1, infinity]; // y after 0, z metBy [0, 1] powRev1 [2.0,4.0] [1.0,2.0] [entire] = [1.0, 0x1.6A09E667F3BCDp0]; powRev1 [2.0,4.0] [1.0,infinity] [entire] = [1.0, infinity]; powRev1 [2.0,infinity] [1.0,2.0] [entire] = [1.0, 0x1.6A09E667F3BCDp0]; powRev1 [2.0,infinity] [1.0,infinity] [entire] = [1.0, infinity]; // y after 0, z after [0, 1] powRev1 [2.0,4.0] [2.0,4.0] [entire] = [0x1.306FE0A31B715p0, 2.0]; powRev1 [2.0,4.0] [2.0,infinity] [entire] = [0x1.306FE0A31B715p0, infinity]; powRev1 [2.0,infinity] [2.0,4.0] [entire] = [1.0, 2.0]; powRev1 [2.0,infinity] [2.0,infinity] [entire] = [1.0, infinity]; } /* The following tests use boundaries for the first and second parameter whose binary logarithm can be computed without round-off error in a binary floating-point context. Thus, an implementation should be able to compute tight results with the formula y = log2 z / log2 x for the intervals used here. Implementations which use natural logarithm would introduce additional errors. The test values are structured according to table B.2 in Heimlich, Oliver. 2011. “The General Interval Power Function.” Diplomarbeit, Institute for Computer Science, University of Würzburg. http://exp.ln0.de/heimlich-power-2011.htm. */ testcase minimal.powRev2_test { // Empty intervals powRev2 [empty] [empty] [empty] = [empty]; powRev2 [empty] [entire] [empty] = [empty]; powRev2 [entire] [empty] [empty] = [empty]; powRev2 [entire] [entire] [empty] = [empty]; powRev2 [empty] [empty] [entire] = [empty]; powRev2 [empty] [entire] [entire] = [empty]; powRev2 [entire] [empty] [entire] = [empty]; // Entire range powRev2 [entire] [entire] [entire] = [entire]; // Outside of the function's domain powRev2 [0.0, 0.0] [-infinity, -0.1] [entire] = [empty]; powRev2 [0.0, 0.0] [0.1, infinity] [entire] = [empty]; powRev2 [0.0, 0.0] [0.0, 0.0] [-infinity, 0.0] = [empty]; powRev2 [-infinity, 0.9] [0.0, 0.9] [-infinity, 0.0] = [empty]; powRev2 [1.1, infinity] [1.1, infinity] [-infinity, 0.0] = [empty]; powRev2 [-infinity, 0.9] [1.1, infinity] [0.0, infinity] = [empty]; powRev2 [1.1, infinity] [0.0, 0.9] [0.0, infinity] = [empty]; // 0^y = 0 powRev2 [0.0, 0.0] [0.0, 0.0] [entire] = [0.0, infinity]; powRev2 [-infinity, 0.0] [-infinity, 0.0] [0.0, infinity] = [0.0, infinity]; powRev2 [-infinity, 0.0] [-infinity, 0.0] [1.0, 2.0] = [1.0, 2.0]; powRev2 [entire] [0.0, 0.0] [entire] = [0.0, infinity]; powRev2 [entire] [-infinity, 0.0] [0.0, infinity] = [0.0, infinity]; powRev2 [entire] [-infinity, 0.0] [1.0, 2.0] = [1.0, 2.0]; powRev2 [0.0, 0.0] [entire] [entire] = [0.0, infinity]; powRev2 [-infinity, 0.0] [entire] [0.0, infinity] = [0.0, infinity]; powRev2 [-infinity, 0.0] [entire] [1.0, 2.0] = [1.0, 2.0]; // 1^y = x^0 = 1 powRev2 [1.0, 1.0] [entire] [entire] = [entire]; powRev2 [1.0, 1.0] [1.0, 1.0] [entire] = [entire]; powRev2 [1.0, 1.0] [1.0, 1.0] [2.0, 3.0] = [2.0, 3.0]; powRev2 [entire] [1.0, 1.0] [entire] = [entire]; powRev2 [entire] [1.0, 1.0] [2.0, 3.0] = [2.0, 3.0]; powRev2 [2.0, 3.0] [1.0, 1.0] [entire] = [0.0, 0.0]; powRev2 [2.0, 3.0] [1.0, 1.0] [2.0, 3.0] = [empty]; // x overlaps/starts [0, 1], z overlaps/starts [0, 1] powRev2 [0.0, 0.5] [0.0, 0.5] [entire] = [0.0, infinity]; powRev2 [0.0, 0.5] [0.0, 0.5] [-infinity, 0.0] = [empty]; // x overlaps/starts [0, 1], z containedBy [0, 1] powRev2 [0.0, 0.5] [0.25, 0.5] [entire] = [0.0, 2.0]; // x overlaps/starts [0, 1], z finishes [0, 1] powRev2 [0.0, 0.25] [0.5, 1.0] [entire] = [0.0, 0.5]; powRev2 [0.0, 0.25] [1.0, 1.0] [entire] = [0.0, 0.0]; // x overlaps/starts [0, 1], z equals/finishedBy [0, 1] powRev2 [0.0, 0.25] [0.0, 1.0] [entire] = [0.0, infinity]; powRev2 [0.0, 0.25] [0.0, 1.0] [-infinity, 0.0] = [0.0, 0.0]; // x overlaps/starts [0, 1], z contains/startedBy [0, 1] powRev2 [0.0, 0.25] [0.0, 2.0] [entire] = [-0.5, infinity]; powRev2 [0.0, 0.25] [0.0, infinity] [entire] = [entire]; // x overlaps/starts [0, 1], z overlappedBy [0, 1] powRev2 [0.0, 0.25] [0.5, 2.0] [entire] = [-0.5, 0.5]; powRev2 [0.0, 0.25] [0.5, infinity] [entire] = [-infinity, 0.5]; // x overlaps/starts [0, 1], z metBy [0, 1] powRev2 [0.0, 0.25] [1.0, 2.0] [entire] = [-0.5, 0.0]; powRev2 [0.0, 0.25] [1.0, 2.0] [0.0, infinity] = [0.0, 0.0]; powRev2 [0.0, 0.25] [1.0, infinity] [entire] = [-infinity, 0.0]; powRev2 [0.0, 0.25] [1.0, infinity] [0.0, infinity] = [0.0, 0.0]; // x overlaps/starts [0, 1], z after [0, 1] powRev2 [0.0, 0.25] [2.0, 4.0] [entire] = [-1.0, 0.0]; powRev2 [0.0, 0.25] [2.0, 4.0] [0.0, infinity] = [empty]; powRev2 [0.0, 0.25] [2.0, infinity] [entire] = [-infinity, 0.0]; powRev2 [0.0, 0.25] [2.0, infinity] [0.0, infinity] = [empty]; // x containedBy [0, 1], z overlaps/starts [0, 1] powRev2 [0.25, 0.5] [0.0, 0.5] [entire] = [0.5, infinity]; // x containedBy [0, 1], z containedBy [0, 1] powRev2 [0.25, 0.5] [0.25, 0.5] [entire] = [0.5, 2.0]; // x containedBy [0, 1], z finishes [0, 1] powRev2 [0.25, 0.5] [0.5, 1.0] [entire] = [0.0, 1.0]; powRev2 [0.25, 0.5] [1.0, 1.0] [entire] = [0.0, 0.0]; // x containedBy [0, 1], z equals/finishedBy [0, 1] powRev2 [0.25, 0.5] [0.0, 1.0] [entire] = [0.0, infinity]; powRev2 [0.25, 0.5] [0.0, 1.0] [-infinity, 0.0] = [0.0, 0.0]; // x containedBy [0, 1], z contains/startedBy [0, 1] powRev2 [0.25, 0.5] [0.0, 2.0] [entire] = [-1.0, infinity]; powRev2 [0.25, 0.5] [0.0, infinity] [entire] = [entire]; // x containedBy [0, 1], z overlappedBy [0, 1] powRev2 [0.25, 0.5] [0.5, 2.0] [entire] = [-1.0, 1.0]; powRev2 [0.25, 0.5] [0.5, infinity] [entire] = [-infinity, 1.0]; // x containedBy [0, 1], z metBy [0, 1] powRev2 [0.25, 0.5] [1.0, 2.0] [entire] = [-1.0, 0.0]; powRev2 [0.25, 0.5] [1.0, infinity] [entire] = [-infinity, 0.0]; // x containedBy [0, 1], z after [0, 1] powRev2 [0.25, 0.5] [2.0, 4.0] [entire] = [-2.0, -0.5]; powRev2 [0.25, 0.5] [2.0, infinity] [entire] = [entire]; // x finishes [0, 1], z overlaps/starts [0, 1] powRev2 [0.25, 1.0] [0.0, 0.5] [entire] = [0.5, infinity]; powRev2 [1.0, 1.0] [0.0, 0.5] [entire] = [empty]; // x finishes [0, 1], z containedBy [0, 1] powRev2 [0.25, 1.0] [0.25, 0.5] [entire] = [0.5, infinity]; powRev2 [1.0, 1.0] [0.25, 0.5] [entire] = [empty]; // x finishes [0, 1], z finishes [0, 1] powRev2 [0.25, 1.0] [0.5, 1.0] [entire] = [entire]; powRev2 [0.25, 1.0] [1.0, 1.0] [entire] = [entire]; powRev2 [1.0, 1.0] [0.5, 1.0] [entire] = [entire]; powRev2 [1.0, 1.0] [1.0, 1.0] [entire] = [entire]; // x finishes [0, 1], z equals/finishedBy [0, 1] powRev2 [0.25, 1.0] [0.0, 1.0] [entire] = [entire]; powRev2 [1.0, 1.0] [0.0, 1.0] [entire] = [entire]; // x finishes [0, 1], z contains/startedBy [0, 1] powRev2 [0.25, 1.0] [0.0, 2.0] [entire] = [entire]; powRev2 [1.0, 1.0] [0.0, 2.0] [entire] = [entire]; powRev2 [0.25, 1.0] [0.0, infinity] [entire] = [entire]; powRev2 [1.0, 1.0] [0.0, infinity] [entire] = [entire]; // x finishes [0, 1], z overlappedBy [0, 1] powRev2 [0.25, 1.0] [0.5, 2.0] [entire] = [entire]; powRev2 [1.0, 1.0] [0.5, 2.0] [entire] = [entire]; powRev2 [0.25, 1.0] [0.5, infinity] [entire] = [entire]; powRev2 [1.0, 1.0] [0.5, infinity] [entire] = [entire]; // x finishes [0, 1], z metBy [0, 1] powRev2 [0.25, 1.0] [1.0, 2.0] [entire] = [entire]; powRev2 [1.0, 1.0] [1.0, 2.0] [entire] = [entire]; powRev2 [0.25, 1.0] [1.0, infinity] [entire] = [entire]; powRev2 [1.0, 1.0] [1.0, infinity] [entire] = [entire]; // x finishes [0, 1], z after [0, 1] powRev2 [0.25, 1.0] [2.0, 4.0] [entire] = [-infinity, -0.5]; powRev2 [1.0, 1.0] [2.0, 4.0] [entire] = [empty]; powRev2 [0.25, 1.0] [2.0, infinity] [entire] = [-infinity, 0.0]; powRev2 [1.0, 1.0] [2.0, infinity] [entire] = [empty]; // x equals/finishedBy [0, 1], z overlaps/starts [0, 1] powRev2 [0.0, 1.0] [0.0, 0.5] [entire] = [0.0, infinity]; powRev2 [0.0, 1.0] [0.0, 0.5] [-infinity, 0.0] = [empty]; powRev2 [0.0, 1.0] [0.0, 0.5] [0.0, infinity] = [0.0, infinity]; // x equals/finishedBy [0, 1], z containedBy [0, 1] powRev2 [0.0, 1.0] [0.25, 0.5] [entire] = [0.0, infinity]; powRev2 [0.0, 1.0] [0.25, 0.5] [-infinity, 0.0] = [empty]; powRev2 [0.0, 1.0] [0.25, 0.5] [0.0, infinity] = [0.0, infinity]; // x equals/finishedBy [0, 1], z finishes [0, 1] powRev2 [0.0, 1.0] [0.5, 1.0] [entire] = [entire]; powRev2 [0.0, 1.0] [1.0, 1.0] [entire] = [entire]; powRev2 [0.0, 1.0] [0.5, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 1.0] [1.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 1.0] [0.5, 1.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, 1.0] [1.0, 1.0] [0.0, infinity] = [0.0, infinity]; // x equals/finishedBy [0, 1], z equals/finishedBy [0, 1] powRev2 [0.0, 1.0] [0.0, 1.0] [entire] = [entire]; powRev2 [0.0, 1.0] [0.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 1.0] [0.0, 1.0] [0.0, infinity] = [0.0, infinity]; // x equals/finishedBy [0, 1], z contains/startedBy [0, 1] powRev2 [0.0, 1.0] [0.0, 2.0] [entire] = [entire]; powRev2 [0.0, 1.0] [0.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 1.0] [0.0, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, 1.0] [0.0, infinity] [entire] = [entire]; powRev2 [0.0, 1.0] [0.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 1.0] [0.0, infinity] [0.0, infinity] = [0.0, infinity]; // x equals/finishedBy [0, 1], z overlappedBy [0, 1] powRev2 [0.0, 1.0] [0.5, 2.0] [entire] = [entire]; powRev2 [0.0, 1.0] [0.5, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 1.0] [0.5, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, 1.0] [0.5, infinity] [entire] = [entire]; powRev2 [0.0, 1.0] [0.5, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 1.0] [0.5, infinity] [0.0, infinity] = [0.0, infinity]; // x equals/finishedBy [0, 1], z metBy [0, 1] powRev2 [0.0, 1.0] [1.0, 2.0] [entire] = [entire]; powRev2 [0.0, 1.0] [1.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 1.0] [1.0, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, 1.0] [1.0, infinity] [entire] = [entire]; powRev2 [0.0, 1.0] [1.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 1.0] [1.0, infinity] [0.0, infinity] = [0.0, infinity]; // x equals/finishedBy [0, 1], z after [0, 1] powRev2 [0.0, 1.0] [2.0, 4.0] [entire] = [-infinity, 0.0]; powRev2 [0.0, 1.0] [2.0, 4.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 1.0] [2.0, 4.0] [0.0, infinity] = [empty]; powRev2 [0.0, 1.0] [2.0, infinity] [entire] = [-infinity, 0.0]; powRev2 [0.0, 1.0] [2.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 1.0] [2.0, infinity] [0.0, infinity] = [empty]; // x contains/startedBy [0, 1], z overlaps/starts [0, 1] powRev2 [0.0, 2.0] [0.0, 0.5] [entire] = [entire]; powRev2 [0.0, 2.0] [0.0, 0.5] [-infinity, 0.0] = [-infinity, -1.0]; powRev2 [0.0, 2.0] [0.0, 0.5] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, infinity] [0.0, 0.5] [entire] = [entire]; powRev2 [0.0, infinity] [0.0, 0.5] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, infinity] [0.0, 0.5] [0.0, infinity] = [0.0, infinity]; // x contains/startedBy [0, 1], z containedBy [0, 1] powRev2 [0.0, 2.0] [0.25, 0.5] [entire] = [entire]; powRev2 [0.0, 2.0] [0.25, 0.5] [-infinity, 0.0] = [-infinity, -1.0]; powRev2 [0.0, 2.0] [0.25, 0.5] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, infinity] [0.25, 0.5] [entire] = [entire]; powRev2 [0.0, infinity] [0.25, 0.5] [-infinity, 0.0] = [-infinity, -0.0]; powRev2 [0.0, infinity] [0.25, 0.5] [0.0, infinity] = [0.0, infinity]; // x contains/startedBy [0, 1], z finishes [0, 1] powRev2 [0.0, 2.0] [0.5, 1.0] [entire] = [entire]; powRev2 [0.0, 2.0] [1.0, 1.0] [entire] = [entire]; powRev2 [0.0, 2.0] [0.5, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 2.0] [1.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 2.0] [0.5, 1.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, 2.0] [1.0, 1.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, infinity] [0.5, 1.0] [entire] = [entire]; powRev2 [0.0, infinity] [1.0, 1.0] [entire] = [entire]; powRev2 [0.0, infinity] [0.5, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, infinity] [1.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, infinity] [0.5, 1.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, infinity] [1.0, 1.0] [0.0, infinity] = [0.0, infinity]; // x contains/startedBy [0, 1], z equals/finishedBy [0, 1] powRev2 [0.0, 2.0] [0.0, 1.0] [entire] = [entire]; powRev2 [0.0, 2.0] [0.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 2.0] [0.0, 1.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, infinity] [0.0, 1.0] [entire] = [entire]; powRev2 [0.0, infinity] [0.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, infinity] [0.0, 1.0] [0.0, infinity] = [0.0, infinity]; // x contains/startedBy [0, 1], z contains/startedBy [0, 1] powRev2 [0.0, 2.0] [0.0, 2.0] [entire] = [entire]; powRev2 [0.0, 2.0] [0.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 2.0] [0.0, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, infinity] [0.0, 2.0] [entire] = [entire]; powRev2 [0.0, infinity] [0.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, infinity] [0.0, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, 2.0] [0.0, infinity] [entire] = [entire]; powRev2 [0.0, 2.0] [0.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 2.0] [0.0, infinity] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, infinity] [0.0, infinity] [entire] = [entire]; powRev2 [0.0, infinity] [0.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, infinity] [0.0, infinity] [0.0, infinity] = [0.0, infinity]; // x contains/startedBy [0, 1], z overlappedBy [0, 1] powRev2 [0.0, 2.0] [0.5, 2.0] [entire] = [entire]; powRev2 [0.0, 2.0] [0.5, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 2.0] [0.5, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, infinity] [0.5, 2.0] [entire] = [entire]; powRev2 [0.0, infinity] [0.5, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, infinity] [0.5, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, 2.0] [0.5, infinity] [entire] = [entire]; powRev2 [0.0, 2.0] [0.5, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 2.0] [0.5, infinity] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, infinity] [0.5, infinity] [entire] = [entire]; powRev2 [0.0, infinity] [0.5, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, infinity] [0.5, infinity] [0.0, infinity] = [0.0, infinity]; // x contains/startedBy [0, 1], z metBy [0, 1] powRev2 [0.0, 2.0] [1.0, 2.0] [entire] = [entire]; powRev2 [0.0, 2.0] [1.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 2.0] [1.0, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, infinity] [1.0, 2.0] [entire] = [entire]; powRev2 [0.0, infinity] [1.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, infinity] [1.0, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, 2.0] [1.0, infinity] [entire] = [entire]; powRev2 [0.0, 2.0] [1.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 2.0] [1.0, infinity] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, infinity] [1.0, infinity] [entire] = [entire]; powRev2 [0.0, infinity] [1.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, infinity] [1.0, infinity] [0.0, infinity] = [0.0, infinity]; // x contains/startedBy [0, 1], z after [0, 1] powRev2 [0.0, 2.0] [2.0, 4.0] [entire] = [entire]; powRev2 [0.0, 2.0] [2.0, 4.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 2.0] [2.0, 4.0] [0.0, infinity] = [1.0, infinity]; powRev2 [0.0, infinity] [2.0, 4.0] [entire] = [entire]; powRev2 [0.0, infinity] [2.0, 4.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, infinity] [2.0, 4.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.0, 2.0] [2.0, infinity] [entire] = [entire]; powRev2 [0.0, 2.0] [2.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, 2.0] [2.0, infinity] [0.0, infinity] = [1.0, infinity]; powRev2 [0.0, infinity] [2.0, infinity] [entire] = [entire]; powRev2 [0.0, infinity] [2.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.0, infinity] [2.0, infinity] [0.0, infinity] = [0.0, infinity]; // x overlappedBy [0, 1], z overlaps/starts [0, 1] powRev2 [0.5, 2.0] [0.0, 0.5] [entire] = [entire]; powRev2 [0.5, 2.0] [0.0, 0.5] [-infinity, 0.0] = [-infinity, -1.0]; powRev2 [0.5, 2.0] [0.0, 0.5] [0.0, infinity] = [1.0, infinity]; powRev2 [0.5, infinity] [0.0, 0.5] [entire] = [entire]; powRev2 [0.5, infinity] [0.0, 0.5] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, infinity] [0.0, 0.5] [0.0, infinity] = [1.0, infinity]; // x overlappedBy [0, 1], z containedBy [0, 1] powRev2 [0.5, 2.0] [0.25, 0.5] [entire] = [entire]; powRev2 [0.5, 2.0] [0.25, 0.5] [-infinity, 0.0] = [-infinity, -1.0]; powRev2 [0.5, 2.0] [0.25, 0.5] [0.0, infinity] = [1.0, infinity]; powRev2 [0.5, infinity] [0.25, 0.5] [entire] = [entire]; powRev2 [0.5, infinity] [0.25, 0.5] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, infinity] [0.25, 0.5] [0.0, infinity] = [1.0, infinity]; // x overlappedBy [0, 1], z finishes [0, 1] powRev2 [0.5, 2.0] [0.5, 1.0] [entire] = [entire]; powRev2 [0.5, 2.0] [1.0, 1.0] [entire] = [entire]; powRev2 [0.5, 2.0] [0.5, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, 2.0] [1.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, 2.0] [0.5, 1.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.5, 2.0] [1.0, 1.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.5, infinity] [0.5, 1.0] [entire] = [entire]; powRev2 [0.5, infinity] [1.0, 1.0] [entire] = [entire]; powRev2 [0.5, infinity] [0.5, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, infinity] [1.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, infinity] [0.5, 1.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.5, infinity] [1.0, 1.0] [0.0, infinity] = [0.0, infinity]; // x overlappedBy [0, 1], z equals/finishedBy [0, 1] powRev2 [0.5, 2.0] [0.0, 1.0] [entire] = [entire]; powRev2 [0.5, 2.0] [0.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, 2.0] [0.0, 1.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.5, infinity] [0.0, 1.0] [entire] = [entire]; powRev2 [0.5, infinity] [0.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, infinity] [0.0, 1.0] [0.0, infinity] = [0.0, infinity]; // x overlappedBy [0, 1], z contains/startedBy [0, 1] powRev2 [0.5, 2.0] [0.0, 2.0] [entire] = [entire]; powRev2 [0.5, 2.0] [0.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, 2.0] [0.0, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.5, infinity] [0.0, 2.0] [entire] = [entire]; powRev2 [0.5, infinity] [0.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, infinity] [0.0, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.5, 2.0] [0.0, infinity] [entire] = [entire]; powRev2 [0.5, 2.0] [0.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, 2.0] [0.0, infinity] [0.0, infinity] = [0.0, infinity]; powRev2 [0.5, infinity] [0.0, infinity] [entire] = [entire]; powRev2 [0.5, infinity] [0.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, infinity] [0.0, infinity] [0.0, infinity] = [0.0, infinity]; // x overlappedBy [0, 1], z overlappedBy [0, 1] powRev2 [0.5, 2.0] [0.5, 2.0] [entire] = [entire]; powRev2 [0.5, 2.0] [0.5, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, 2.0] [0.5, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.5, infinity] [0.5, 2.0] [entire] = [entire]; powRev2 [0.5, infinity] [0.5, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, infinity] [0.5, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.5, 2.0] [0.5, infinity] [entire] = [entire]; powRev2 [0.5, 2.0] [0.5, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, 2.0] [0.5, infinity] [0.0, infinity] = [0.0, infinity]; powRev2 [0.5, infinity] [0.5, infinity] [entire] = [entire]; powRev2 [0.5, infinity] [0.5, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, infinity] [0.5, infinity] [0.0, infinity] = [0.0, infinity]; // x overlappedBy [0, 1], z metBy [0, 1] powRev2 [0.5, 2.0] [1.0, 2.0] [entire] = [entire]; powRev2 [0.5, 2.0] [1.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, 2.0] [1.0, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.5, infinity] [1.0, 2.0] [entire] = [entire]; powRev2 [0.5, infinity] [1.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, infinity] [1.0, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [0.5, 2.0] [1.0, infinity] [entire] = [entire]; powRev2 [0.5, 2.0] [1.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, 2.0] [1.0, infinity] [0.0, infinity] = [0.0, infinity]; powRev2 [0.5, infinity] [1.0, infinity] [entire] = [entire]; powRev2 [0.5, infinity] [1.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [0.5, infinity] [1.0, infinity] [0.0, infinity] = [0.0, infinity]; // x overlappedBy [0, 1], z after [0, 1] powRev2 [0.5, 2.0] [2.0, 4.0] [entire] = [entire]; powRev2 [0.5, 2.0] [2.0, 4.0] [-infinity, 0.0] = [-infinity, -1.0]; powRev2 [0.5, 2.0] [2.0, 4.0] [0.0, infinity] = [1.0, infinity]; powRev2 [0.5, infinity] [2.0, 4.0] [entire] = [entire]; powRev2 [0.5, infinity] [2.0, 4.0] [-infinity, 0.0] = [-infinity, -1.0]; powRev2 [0.5, infinity] [2.0, 4.0] [0.0, infinity] = [0.0, infinity]; // x metBy [0, 1], z overlaps/starts [0, 1] powRev2 [1.0, 2.0] [0.0, 0.5] [entire] = [-infinity, -1.0]; powRev2 [1.0, 2.0] [0.0, 0.5] [-infinity, 0.0] = [-infinity, -1.0]; powRev2 [1.0, 2.0] [0.0, 0.5] [0.0, infinity] = [empty]; powRev2 [1.0, infinity] [0.0, 0.5] [entire] = [-infinity, 0.0]; powRev2 [1.0, infinity] [0.0, 0.5] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, infinity] [0.0, 0.5] [0.0, infinity] = [empty]; // x metBy [0, 1], z containedBy [0, 1] powRev2 [1.0, 2.0] [0.25, 0.5] [entire] = [-infinity, -1.0]; powRev2 [1.0, 2.0] [0.25, 0.5] [-infinity, 0.0] = [-infinity, -1.0]; powRev2 [1.0, 2.0] [0.25, 0.5] [0.0, infinity] = [empty]; powRev2 [1.0, infinity] [0.25, 0.5] [entire] = [-infinity, 0.0]; powRev2 [1.0, infinity] [0.25, 0.5] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, infinity] [0.25, 0.5] [0.0, infinity] = [empty]; // x metBy [0, 1], z finishes [0, 1] powRev2 [1.0, 2.0] [0.5, 1.0] [entire] = [entire]; powRev2 [1.0, 2.0] [1.0, 1.0] [entire] = [entire]; powRev2 [1.0, 2.0] [0.5, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, 2.0] [1.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, 2.0] [0.5, 1.0] [0.0, infinity] = [0.0, infinity]; powRev2 [1.0, 2.0] [1.0, 1.0] [0.0, infinity] = [0.0, infinity]; powRev2 [1.0, infinity] [0.5, 1.0] [entire] = [entire]; powRev2 [1.0, infinity] [1.0, 1.0] [entire] = [entire]; powRev2 [1.0, infinity] [0.5, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, infinity] [1.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, infinity] [0.5, 1.0] [0.0, infinity] = [0.0, infinity]; powRev2 [1.0, infinity] [1.0, 1.0] [0.0, infinity] = [0.0, infinity]; // x metBy [0, 1], z equals/finishedBy [0, 1] powRev2 [1.0, 2.0] [0.0, 1.0] [entire] = [entire]; powRev2 [1.0, 2.0] [0.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, 2.0] [0.0, 1.0] [0.0, infinity] = [0.0, infinity]; powRev2 [1.0, infinity] [0.0, 1.0] [entire] = [entire]; powRev2 [1.0, infinity] [0.0, 1.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, infinity] [0.0, 1.0] [0.0, infinity] = [0.0, infinity]; // x metBy [0, 1], z contains/startedBy [0, 1] powRev2 [1.0, 2.0] [0.0, 2.0] [entire] = [entire]; powRev2 [1.0, 2.0] [0.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, 2.0] [0.0, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [1.0, infinity] [0.0, 2.0] [entire] = [entire]; powRev2 [1.0, infinity] [0.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, infinity] [0.0, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [1.0, 2.0] [0.0, infinity] [entire] = [entire]; powRev2 [1.0, 2.0] [0.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, 2.0] [0.0, infinity] [0.0, infinity] = [0.0, infinity]; powRev2 [1.0, infinity] [0.0, infinity] [entire] = [entire]; powRev2 [1.0, infinity] [0.0, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, infinity] [0.0, infinity] [0.0, infinity] = [0.0, infinity]; // x metBy [0, 1], z overlappedBy [0, 1] powRev2 [1.0, 2.0] [0.5, 2.0] [entire] = [entire]; powRev2 [1.0, 2.0] [0.5, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, 2.0] [0.5, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [1.0, infinity] [0.5, 2.0] [entire] = [entire]; powRev2 [1.0, infinity] [0.5, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, infinity] [0.5, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [1.0, 2.0] [0.5, infinity] [entire] = [entire]; powRev2 [1.0, 2.0] [0.5, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, 2.0] [0.5, infinity] [0.0, infinity] = [0.0, infinity]; powRev2 [1.0, infinity] [0.5, infinity] [entire] = [entire]; powRev2 [1.0, infinity] [0.5, infinity] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, infinity] [0.5, infinity] [0.0, infinity] = [0.0, infinity]; // x metBy [0, 1], z metBy [0, 1] powRev2 [1.0, 2.0] [1.0, 2.0] [entire] = [entire]; powRev2 [1.0, 2.0] [1.0, infinity] [entire] = [entire]; powRev2 [1.0, infinity] [1.0, infinity] [entire] = [entire]; powRev2 [1.0, infinity] [1.0, 2.0] [entire] = [entire]; powRev2 [1.0, 2.0] [1.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, infinity] [1.0, 2.0] [-infinity, 0.0] = [-infinity, 0.0]; powRev2 [1.0, 2.0] [1.0, 2.0] [0.0, infinity] = [0.0, infinity]; powRev2 [1.0, infinity] [1.0, 2.0] [0.0, infinity] = [0.0, infinity]; // x metBy [0, 1], z after [0, 1] powRev2 [1.0, 2.0] [2.0, 4.0] [entire] = [1.0, infinity]; powRev2 [1.0, infinity] [2.0, 4.0] [entire] = [0.0, infinity]; powRev2 [1.0, 2.0] [2.0, 4.0] [-infinity, 0.0] = [empty]; powRev2 [1.0, infinity] [2.0, 4.0] [-infinity, 0.0] = [empty]; powRev2 [1.0, 2.0] [2.0, 4.0] [0.0, infinity] = [1.0, infinity]; powRev2 [1.0, infinity] [2.0, 4.0] [0.0, infinity] = [0.0, infinity]; // x after [0, 1], z overlaps/starts [0, 1] powRev2 [2.0, 4.0] [0.0, 0.5] [entire] = [-infinity, -0.5]; powRev2 [2.0, infinity] [0.0, 0.5] [entire] = [-infinity, 0.0]; powRev2 [2.0, infinity] [0.0, 0.5] [0.0, infinity] = [empty]; // x after [0, 1], z containedBy [0, 1] powRev2 [2.0, 4.0] [0.25, 0.5] [entire] = [-2.0, -0.5]; powRev2 [2.0, infinity] [0.25, 0.5] [entire] = [-2.0, 0.0]; powRev2 [2.0, infinity] [0.25, 0.5] [0.0, infinity] = [empty]; // x after [0, 1], z finishes [0, 1] powRev2 [2.0, 4.0] [0.5, 1.0] [entire] = [-1.0, 0.0]; powRev2 [2.0, infinity] [0.5, 1.0] [entire] = [-1.0, 0.0]; powRev2 [2.0, 4.0] [1.0, 1.0] [entire] = [0.0, 0.0]; powRev2 [2.0, infinity] [1.0, 1.0] [entire] = [0.0, 0.0]; // x after [0, 1], z equals/finishedBy [0, 1] powRev2 [2.0, 4.0] [0.0, 1.0] [entire] = [-infinity, 0.0]; powRev2 [2.0, infinity] [0.0, 1.0] [entire] = [-infinity, 0.0]; powRev2 [2.0, 4.0] [0.0, 1.0] [0.0, infinity] = [0.0, 0.0]; powRev2 [2.0, infinity] [0.0, 1.0] [0.0, infinity] = [0.0, 0.0]; // x after [0, 1], z contains/startedBy [0, 1] powRev2 [2.0, 4.0] [0.0, 2.0] [entire] = [-infinity, 1.0]; powRev2 [2.0, infinity] [0.0, 2.0] [entire] = [-infinity, 1.0]; // x after [0, 1], z overlappedBy [0, 1] powRev2 [2.0, 4.0] [0.5, 2.0] [entire] = [-1.0, 1.0]; powRev2 [2.0, infinity] [0.5, 2.0] [entire] = [-1.0, 1.0]; // x after [0, 1], z metBy [0, 1] powRev2 [2.0, 4.0] [1.0, 2.0] [entire] = [0.0, 1.0]; powRev2 [2.0, infinity] [1.0, 2.0] [entire] = [0.0, 1.0]; powRev2 [2.0, 4.0] [1.0, 2.0] [-infinity, 0.0] = [0.0, 0.0]; powRev2 [2.0, infinity] [1.0, 2.0] [-infinity, 0.0] = [0.0, 0.0]; // x after [0, 1], z after [0, 1] powRev2 [2.0, 4.0] [2.0, 4.0] [entire] = [0.5, 2.0]; powRev2 [2.0, infinity] [2.0, 4.0] [entire] = [0.0, 2.0]; powRev2 [2.0, infinity] [2.0, 4.0] [-infinity, 0.0] = [empty]; powRev2 [2.0, 4.0] [2.0, infinity] [entire] = [0.5, infinity]; powRev2 [2.0, infinity] [2.0, infinity] [entire] = [0.0, infinity]; powRev2 [2.0, infinity] [2.0, infinity] [-infinity, 0.0] = [empty]; } interval-2.1.0/CITATION0000644000175000017500000000101113031037005014036 0ustar oliveroliverThe interval package is a collection of functions for interval arithmetic. It is developed at Octave Forge, a sibling of the GNU Octave project. To cite this particular version of the interval package in publications use: @software{octave-interval, author = {Oliver Heimlich}, title = {GNU Octave Interval Package}, url = {http://octave.sourceforge.net/interval/}, version = {2.1.0}, date = {2016-12-28}, } See also ‘citation’ for citing Octave as a whole. interval-2.1.0/COPYING0000644000175000017500000011314613031037005013751 0ustar oliveroliverThe interval package is free software and can be used under the terms of the GNU General Public License Version 3 (or at your option any later version). The wording of the license can be found below. The interval package contains derivative work, which is based on other free software released under various licenses. Original authors are properly attributed in the manual and copyright statements have been retained in the particular source files. For simplicity, any derivative work has been relicensed in this package. Thus, the GPLv3+ is the only effective license for the software in this package. For legal reasons a copy of the Apache License 2.0 is included in this package. You can find the license in the file ‘doc/license/apache-2.0.texi’. However, that license does not apply to the software in this package. The GNU General Public License. Version 3, 29 June 2007 Copyright © 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble ======== The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program—to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. 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 them 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 prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. 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. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers’ and authors’ protection, the GPL clearly explains that there is no warranty for this free software. For both users’ and authors’ sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users’ freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS ==================== 0. Definitions. “This License” refers to version 3 of the GNU General Public License. “Copyright” also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. “The Program” refers to any copyrightable work licensed under this License. Each licensee is addressed as “you”. “Licensees” and “recipients” may be individuals or organizations. To “modify” a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a “modified version” of the earlier work or a work “based on” the earlier work. A “covered work” means either the unmodified Program or a work based on the Program. To “propagate” a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To “convey” a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays “Appropriate Legal Notices” to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The “source code” for a work means the preferred form of the work for making modifications to it. “Object code” means any non-source form of a work. A “Standard Interface” means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The “System Libraries” of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A “Major Component”, in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The “Corresponding Source” for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work’s System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users’ Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work’s users, your or third parties’ legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey 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; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a. The work must carry prominent notices stating that you modified it, and giving a relevant date. b. The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to “keep intact all notices”. c. You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d. If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an “aggregate” if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation’s users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a. Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b. Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c. Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d. Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e. Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A “User Product” is either (1) a “consumer product”, which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, “normally used” refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. “Installation Information” for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. “Additional permissions” are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a. Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b. Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c. Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d. Limiting the use for publicity purposes of names of licensors or authors of the material; or e. Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f. Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered “further restrictions” within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An “entity transaction” is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party’s predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A “contributor” is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor’s “contributor version”. A contributor’s “essential patent claims” are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, “control” includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor’s essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a “patent license” is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To “grant” such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. “Knowingly relying” means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient’s use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is “discriminatory” if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others’ Freedom. If 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 convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU 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 that a certain numbered version of the GNU General Public License “or any later version” applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy’s public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. 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. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 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. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. 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 state the exclusion of warranty; and each file should have at least the “copyright” line and a pointer to where the full notice is found. ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES. Copyright (C) YEAR NAME OF AUTHOR 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 . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: PROGRAM Copyright (C) YEAR NAME OF AUTHOR This program 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, your program’s commands might be different; for a GUI interface, you would use an “about box”. You should also get your employer (if you work as a programmer) or school, if any, to sign a “copyright disclaimer” for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see . The GNU 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 Lesser General Public License instead of this License. But first, please read . interval-2.1.0/NEWS0000644000175000017500000004333013031037005013412 0ustar oliveroliver GNU Octave Interval Package Summary of important user-visible changes Version 2.1.0 2016-12-28 ======================== • The speed of some arithmetic operations has been greatly improved. They have previously been computed by multi-precision arithmetic which simulates binary64 floating-point arithmetic (MPFR library). Now, a specialized correctly rounded mathematical library (crlibm) computes identical results 30–100 times faster. There is no accuracy drawback, arithmetic operations will compute tight interval enclosures as before. The following functions benefit from this: acos, asin, atan, cos, cosh, exp, expm1, log, log10, log1p, log2, sin, sinh, tan. Bugfixes • Fixed indexing expression in interval constructor for illegal intervals of the form ‘[-inf, -inf]’ or ‘[inf, inf]’ • polyval: Fixed unnecessary warnings when evaluated on empty intervals • Fixed compilation errors on FreeBSD 9.3 Version 2.0.0 2016-11-20 ======================== This major release contains fundamental changes to the interval constructors. After a discussion on the P1788 mailing list, it has been revealed that this interval package didn’t implement exceptions from the standard for interval arithmetic correctly: Operations from IEEE Std 1788-2015 which trigger an “exception” shall return a value nonetheless. Conformance has been improved in this new version, but may break compatibility with previous versions. A second big news is that the interval package comprises functions from VERSOFT, a verification software package by Jiří Rohn, who has generously published his work as free software this year. Unfortunately, some of VERSOFT’s functions are encrypted and could not be included yet. • nai: With additional arguments, matrices of NaI (not an interval) values can be constructed. Previously, NaI has been restricted to be of scalar value. • infsup: The bare interval constructor merely triggers a warning instead of an error on illegal input, which creates empty intervals. If input contains legitimate as well as illegal input, only entries with illegal input will carry empty intervals. • infsupdec: The decorated interval constructor may create interval matrices which have NaI (not an interval) as entries. If input contains legitimate as well as illegal input, only entries with illegal input will carry NaI values. • Warning and error identifiers of the constructors have been revised. The warning identifier ‘interval:NaI’ has been removed. Illegal input signals an ‘interval:UndefinedOperation’ warning. If the input is of an illegal data type or of illegal size, the constructors signal an ‘interval:InvalidOperand’ warning. The warning identifier ‘interval:PossiblyUndefinedOperation’ has been renamed to ‘interval:PossiblyUndefined’ to better match the wording in the standard document. Also, previous versions failed to trigger this warning in cases where there is a floating point number between boundaries U < L, which has been fixed. • It is no longer valid to call ‘infsup (+inf, -inf)’ to create an empty interval and the constructor will signal a warning in these cases. This change has been made to better conform to the ‘numsToInterval’ function from the interval standard. You may create empty intervals with either ‘infsup ()’ or ‘infsupdec ()’ or ‘empty ()’. • inf, sup: If the input is NaI (not an interval), these functions return NaN (not a number) values instead of an error. • Output of intervals in hexadecimal form discriminates between subnormal boundaries and normal boundaries. Subnormal numbers start with “0x0.” whereas normal numbers start with “0x1.”. Also, hexadecimal form has been changed to lower case. • resize: New interval elements are initialized with zero instead of empty intervals to better match the corresponding Octave function. • Interval constructors may broadcast column and row vectors. • Performance improvements: factorial on large arguments; plot and plot3 on input that is plotted as a line. • New interval functions: tril, triu, qr • New functions which have been ported from Jiří Rohn’s VERSOFT: chol, vereigback, vereigvec, verintlinineqs, verinvnonneg, verlinineqnn, verlinprog • recip, sqr: The functions have been removed, after they have been deprecated in version 1.4.0. • plot3: Fixed plotting with gnuplot and fixed an issue where the figure did not switch from 2D to 3D after plotting. • expm1: Fixed documentation, the function computes exp (X) - 1 instead of exp (X - 1). • norm: Fixed an error where the Hamming norm of empty intervals was non-empty. Version 1.5.0 2016-05-31 ======================== • norm: Added subordinate matrix norms and the max norm • strictsubset: New interval comparison function • Package documentation: Added new example (Cameleon problem), and the growing list of examples has been split into several web pages. • Package documentation: Updated recommendations to install and load the package. The autoload feature will be removed in Octave 4.2.0. (patch #8981, thanks to juanpi) • Support package installation in Octave 4.1.0+ (bug #47288) Version 1.4.1 2016-02-13 ======================== • Fixed a compile error for 32-bit systems during package installation (bug #47100) Version 1.4.0 2016-02-09 ======================== • mpower: Improved accuracy and speed. The interval matrix square can now be computed without dependency errors and with tightest accuracy. • factorial: New interval arithmetic operation • expm, norm: New interval matrix operations • The functions recip and sqr have been deprecated and will be removed in a future release. Please use ‘1 ./ X’ and ‘X .^ 2’ instead. Bugfixes • bitunpack, interval_bitpack: The order of inf/sup/dec parts has been fixed. The function documentation describes how the functions behave on little-endian and big-endian systems. Version 1.3.0 2015-12-22 ======================== • postpad, prepad, subsasgn: Implicit new elements during subscript assignment and padding have been initialized with empty intervals before this release. This behavior has changed. Now, the implicit new element are initialized with zero to make a correct interval extension of the corresponding built-in function. • fsolve: New function to solve (systems of) equations and compute the inverse of a set under a function • ctc_intersect, ctc_union: Utility functions for contractors and the fsolve function • det, prod, recip: New interval arithmetic functions • diag: New utility function to create diagonal matrices or extract vectors from diagonals of matrices • decorationpart: Choose between different return types with a second parameter • For several functions it is now possible to broadcast row vectors against column vectors or vectors against matrices. • The user manual has been restructured for better accessibility by new users. A bunch of usage examples demonstrates the package’s capabilities. Bugfixes • sum, sumabs, sumsq: Fixed result for matrices of size zero • powrev1, powrev2: Fixed indexing for vectors Version 1.2.0 2015-10-01 ======================== • The output format for intervals has been changed. The number of decimal places now respects what has been set by the user with the ‘format short’ or ‘format long’ command, and is much shorter by default. Also it is possible to use ‘format hex’. The old format can be accessed with the ‘intervaltotext’ function. • fminsearch: New optimizer function for finding the minimum value of a function over interval constraints using the Skelboe-Moore algorithm • fzero: Changed function parameters to support optimset options • power: Improved speed of the general interval power function and monomials with the notation x .^ n • plot, plot3: Added support for colormaps Bugfixes • mldivide: Fixed algorithm to handle more matrices without error • bisect: Fixed an error during bisection of singleton intervals (thanks to Helmut for finding this during OctConf 2015) Version 1.1.0 2015-08-03 ======================== • meshgrid, mince: New utility functions to help plotting of interval functions • linspace: New interval arithmetic function • intersect, max, min, union: Allow evaluation as aggregate functions within an interval matrix along a common dimension • Improvements to the documentation • Added cross-references between package documentation and function reference • Extended information about interval arithmetic in general • Extended information about implemented IEEE Std 1788-2015 functions and fixed references to the standard document • Added information about plotting intervals • Simplified package description • Graphics with higher resolutions, demo of interval sombrero function plot on first page, and minor style fixes Bugfixes • plot3: Fixed plotting of interval edges when plotting several intervals at once using matrices Version 1.0.0 2015-06-13 ======================== • IEEE Std 1788-2015, IEEE standard for interval arithmetic, was approved on June 11. To mark the occasion, the major version number has been raised. • All interval constructors have been extended to create interval matrices from a single string. Commas or spaces may be used as a column separator (consecutive separators are trimmed). Semicolon and new line characters can be used as a row separator. • hdist, idist, sdist, smig: New interval numeric functions • User manual: Relicensed under GPL, added examples from the former Octave SIMP package, and various minor improvements. Bugfixes • mtimes: Fixed matrix-vector multiplication of decorated intervals • Fixed a linking error in mkoctfile that could prevent package installation (bug #45280) Version 0.2.1 2015-05-30 ======================== • plot, plot3: New interval plotting functions. Pay attention to the included examples, which can be executed with ‘demo @infsup/plot’ and ‘demo @infsup/plot3’ respectively. • polyval: New interval arithmetic algorithm • bisect: New set operation for bisecting algorithms • sinrev, cosrev, tanrev, atan2rev1, atan2rev2: Now allow non-scalar arguments • Simplified licensing: Relicensed parts of the software that were not under GPL • Updated information for citation of the package Bugfixes • Fixed generation of the manual in PDF format • subsasgn: Fixed cases where decoration could be lost (bug #42735) Version 0.2.0 2015-05-03 ======================== • User manual included in the package, see doc/manual.texinfo • New utility functions: cat, postpad, prepad, reshape, resize • and, or: Removed deprecated functions • Improved display output for cell arrays and new function: disp • Minor performance improvements (all decorated interval functions, horzcat, vertcat) Bugfixes • issquare, isrow, iscolumn: Fixed compatibility issues with GNU Octave 4.0 • cbrt: Allow negative values as parameter • cot: Fixed accuracy for x = 0 • cos, csc, sec, sin: Fixed correctness in certain cases • Prevent multibyte characters in Microsoft Windows console Version 0.1.5 2015-04-06 ======================== • Implicit decoration of bare intervals triggers a warning now and can be allowed or forbidden by the user. Implicit decoration of bare interval literals is not affected. • newdec: New operation for explicit promotion of bare intervals into decorated intervals (without warning). • Decorated interval literals with illegal decoration are no longer allowed and produce NaIs. • hull: In contrast to the union function, the interval constructor is no longer considered a set operation and can create intervals with a non-trivial decoration. • setdiff, setxor: New set operations • intersect, union: Renamed set operations; the old function names (and, or) are hereby deprecated and are going to be removed in the next release. • intervaltotext, intervaltoexact: Decimal fractions no longer omit zero before the point, and unnecessary trailing decimal places can be omitted more consistently and in more cases than before (also affects console output). Improved accuracy and performance with support for interval matrices. Bugfixes • mtimes, mldivide: Support for broadcasting of scalar parameters • nextout: Support for decorated intervals • An error in GNU Octave core, which could lead to lost or wrong interval decorations, no longer affects decorated intervals (bug #42735) • Some errors in the function documentation have been fixed (thanks to doctest-for-matlab and Colin’s texinfo compatibility patches) • Fixed interval field access on Windows Version 0.1.4 2015-03-15 ======================== • New interval constructors: hull, midrad • New interval arithmetic functions: cbrt, cot, coth, csc, csch, dilog, ei, erf, erfc, gamma, gammaln, psi, rsqrt, sec, sech • mtimes: Support for fast, less accurate evaluation using BLAS routines • mldivide, mrdivide, inv: Improved performance by using faster mtimes • infsup, infsupdec: Enabled broadcasting of scalar boundaries • rad: May compute mid and rad simultaneously • subsref: Access to interval properties using field syntax: x.inf and x.sup Version 0.1.3 2015-02-24 ======================== • Fixed a compile error that could possibly occur during package installation Version 0.1.2 2015-02-22 ======================== • New interval arithmetic functions: nthroot, hypot, log1p, expm1 • lu: New operation for LU(P) decomposition of interval matrices • nai: New decorated interval constant • mldivide, mrdivide, inv: Greatly improved accuracy and performance of the linear solver • Improved accuracy of vector sums, dot products, pownrev, and powrev2 • powrev1, powrev2, pownrev, mulrev: Now allow non-scalar arguments • overlap: Renamed one overlapping state from equal to equals • mulrevtopair: No longer available, use mulrev with two output parameters for two-output division • setdec: No longer available, use infsupdec instead • Small performance improvements Bugfixes • Compatibility with GNU Octave 4.0 (bug #43925) • Build problems during package installation with environment variables • iscommoninterval: The decorated variant must return true for common intervals without com decoration • eq: The decorated variant must not consider the decoration value • Several decorated functions: When evaluated on a subset of the function’s domain, the result’s decoration must be dac if the function’s restriction to that subset is continuous • Decorated boolean functions: Must return false when evaluated on NaI input • Interval constructors: A PossibleUndefined warning must be issued if an interval is created from two very close decimal numbers (which can not be separated in the floating-point context) where the lower boundary is greater than the upper boundary when compared with infinite precision • Interval constructors: NaNs must produce empty intervals • Decorated interval constructor: Illegal decorations for empty intervals must be adjusted to trv, and illegal decoration com for unbounded intervals must be adjusted to dac. • cancelminus/cancelplus: The functions returned wrong results if the interval widths could not be compared in double-precision • cos: Accuracy for x = [0] improved • pow, powrev1, powrev2: The function must be defined for x = 0 and y > 0 • All reverse operations: Must return a trivial decoration information at best (the only exception is mulrev) Version 0.1.1 2015-02-01 ======================== • Increased speed of computation for large matrices • Improved performance for fma and dot • mpfr_vector_dot_d: Changed syntax for faster computation on intervals • Decorated versions of mtimes, mldivide, mpower, inv and reduction operations sum, dot, subabs, subsquare • Renamed function sumsquare to sumsq in accordance with GNU Octave function names • New function: fzero for finding all roots of an interval arithmetic function Bugfixes • nextout: Function returned wrong results • exacttointerval: Now produces bare intervals instead of decorated intervals in conformance with IEEE P1788 • atanh: Function returned wrong results for ±1 • dot: Function returned wrong results for some inputs • fma: Function returned wrong results for some inputs • infsup: Function returned wrong interval boundaries for decimal numbers, function failed on mixed numerical and string boundaries in single cell array parameter • mulrevtopair: Fixed order of operands in conformance with IEEE P1788 and wrong results when evaluated on intervals that contain zero Version 0.1.0 2015-01-21 ======================== • Initial release version, which already contains all required operations of the preliminary standard document IEEE P1788. interval-2.1.0/doc/image/cameleon-start-end.svg.eps0000644000175000017500000020471313031037005021537 0ustar oliveroliver%!PS-Adobe-3.0 EPSF-3.0 %%Creator: cairo 1.14.0 (http://cairographics.org) %%CreationDate: Wed Dec 28 23:34:45 2016 %%Pages: 1 %%DocumentData: Clean7Bit %%LanguageLevel: 2 %%BoundingBox: 0 -1 267 148 %%EndComments %%BeginProlog save 50 dict begin /q { gsave } bind def /Q { grestore } bind def /cm { 6 array astore concat } bind def /w { setlinewidth } bind def /J { setlinecap } bind def /j { setlinejoin } bind def /M { setmiterlimit } bind def /d { setdash } bind def /m { moveto } bind def /l { lineto } bind def /c { curveto } bind def /h { closepath } bind def /re { exch dup neg 3 1 roll 5 3 roll moveto 0 rlineto 0 exch rlineto 0 rlineto closepath } bind def /S { stroke } bind def /f { fill } bind def /f* { eofill } bind def /n { newpath } bind def /W { clip } bind def /W* { eoclip } bind def /BT { } bind def /ET { } bind def /pdfmark where { pop globaldict /?pdfmark /exec load put } { globaldict begin /?pdfmark /pop load def /pdfmark /cleartomark load def end } ifelse /BDC { mark 3 1 roll /BDC pdfmark } bind def /EMC { mark /EMC pdfmark } bind def /cairo_store_point { /cairo_point_y exch def /cairo_point_x exch def } def /Tj { show currentpoint cairo_store_point } bind def /TJ { { dup type /stringtype eq { show } { -0.001 mul 0 cairo_font_matrix dtransform rmoveto } ifelse } forall currentpoint cairo_store_point } bind def /cairo_selectfont { cairo_font_matrix aload pop pop pop 0 0 6 array astore cairo_font exch selectfont cairo_point_x cairo_point_y moveto } bind def /Tf { pop /cairo_font exch def /cairo_font_matrix where { pop cairo_selectfont } if } bind def /Td { matrix translate cairo_font_matrix matrix concatmatrix dup /cairo_font_matrix exch def dup 4 get exch 5 get cairo_store_point /cairo_font where { pop cairo_selectfont } if } bind def /Tm { 2 copy 8 2 roll 6 array astore /cairo_font_matrix exch def cairo_store_point /cairo_font where { pop cairo_selectfont } if } bind def /g { setgray } bind def /rg { setrgbcolor } bind def /d1 { setcachedevice } bind def %%EndProlog %%BeginSetup %%BeginResource: font Cmr10 11 dict begin /FontType 42 def /FontName /Cmr10 def /PaintType 0 def /FontMatrix [ 1 0 0 1 0 0 ] def /FontBBox [ 0 0 0 0 ] def /Encoding 256 array def 0 1 255 { Encoding exch /.notdef put } for Encoding 32 /space put Encoding 80 /P put Encoding 83 /S put Encoding 97 /a put Encoding 105 /i put Encoding 110 /n put Encoding 111 /o put Encoding 114 /r put Encoding 115 /s put Encoding 116 /t put /CharStrings 11 dict dup begin /.notdef 0 def /S 1 def /t 2 def /a 3 def /r 4 def /space 5 def /P 6 def /o 7 def /s 8 def /i 9 def /n 10 def end readonly def /sfnts [ <000100000009008000030010637674204d184f4a0000075c000000da6670676d0211c2610000 0838000001d8676c7966b9e800670000009c000006c06865616466cf48fc00000a1000000036 686865610d5f061700000a4800000024686d74782a97035e00000a6c0000002c6c6f63610000 286800000a98000000306d61787000fa00cb00000ac80000002070726570ef56926200000ae8 0000002800020100000005000500000300070022401b2a02060006042a0009000702046c0305 00056c0701000602090f032b31002b3021112111271121110100040021fc420500fb002104be fb42000000010073ffd303fe05a400490045403c3627131204052f0a091a011c012f23200c0c 08440148010a2240091207020444361c1312050e070924015e3c0e0105330116016a07011206 024b0f032b2b31002b2b301711343b01321615141633323e0135342e0127252e0135343e0133 321737363b0132161511142b012235342e01272623220e0115141617051e0315140e0123222e 012707062b0122731219060af9ca477843325e3bfef684a76cb76acd795406080e060b111813 233e2463a34676466d58010a42754e2c66b96e448e78315606090c121d01de100a06c9dd5285 473e75560e4123d9876aba6c8b85060908fe251212347c722464477a43588f174110536e8748 6fc5781e3e318706000000010027ffe902a804ec001b0037402e1401010f090a010301012208 0a03080f24190900070204070a016a151201050c01030106015b07000d06021d0f032b31002e 2b2b303711233532363533112115211114163332363d013315140e01232226d1aa867e3b0121 fedf394a463e3b2f5c427b8ff6023535fa92fe8748fdcf5580874e797d407d50930000000002 0052ffe903f203960032003e0047403e0b010904090926170a00081101240127043b14062c1f 0236262f091007030429096a252200053b012c015b1b0503060e0133011401570b0019060340 0f032b31003f2b2b30373436243335342e01232207321615140623222635343633321e011511 14163332363d013315140e01232226270e012322262637141633323e013d0122060652c0010d 7934623b884727333a28293ac47653a86b222422213c30512f3c57052694544e9765a66a4842 6c405dc380c97a993f543b6f473d3b27293a3a296c69478458fe332843442783832e53315d40 4d5b2e634f486242723fd53d820000010035000002e903890023002e40260b01150c021b270f 0a0c0801040a0a00091a1812031223010a01020b015d2005150501250f032b2b3f3f2b303335 32363511342e01233525153e0133321615140623222635343723220e01151114331535465a21 3e410125217a573d6035272636270c53692cc748162b022f37310b4816c8596f483b25373626 371778b251feb041480000020044000004fe0577001500230032402a1f010622080c02082417 100006020400090701021215011b12094a0c1b00051601511204010602250f032b2b2b3f2b30 333532351134233521321e0115140e012321111433150321323e013534262b01220e011544d3 d302d970e09192de71feb8d3d90116718c4193abae25291a4841046541485cb07572ac59fe0a 414802bc418970a792061d1e000000020039ffe903c50396001000240023401c1b26090a0008 1124000900070204540d140005542104000602260f032b31002b3005222e0135343e0233321e 0115140606273236353426272e02232206070e011514161602007bd27a437da6617ecf787ad1 7aa46e162517474f2a40732626152879177dd27c5eae894d85df7e7bd37d3ceeb86787372233 1b3a363a8b6073b77c0000010044ffe902e103960040004c4042302f240f0e06040729080917 01190129291d0a0c083b013f0108263909120702041a0a3b302f190f0e060b2c09211a026534 0b010501010601652c13030602420f032b2b31003f2b2b301711343b01321712333236353426 2f012e0235343e0133321737343b0132161511142b01223534262322061514161f011e021514 0e0223222707142b01224412190c0439db61836646894571485f9858694e3b0a0f060a101912 776b5c8761418b467947335b7c44805b4b0b0c1206014e1010fed7585c425d111b0f3e67445a 73333833050b06fef413136b8244533949101a104c74494a6d48225651050002003f000001fe 055a000f001c0025401c1a0f130c000801040a0a0009170f02100901035c0a051405011e0f03 2b31003f3f2b303335323635113426233525111416331501343633321e011514062322263f46 5a3d5a01274e41fe98442c1d361e442d2c4448162b022f4f244816fd002b164804e92d441e36 1d2c444400000001003d0000044c038900280035402b0b010c0120270f0a0c08010418090a0a 0009170119015b121d140528010a01020b015b24051506022a0f032b31003f3f3f2b30333532 363511342e01233525153e013332161511141633152135323635113426232206151114163315 3d465a213e41012929a15f8e8f5a46fe2b465a3a5a77995a4548162b022f37310b4816c85870 888cfe142b164848162b01e66481be79fe6c2b16480000060008000e001d002b0042fe5afe73 ffd30000037303a0057705a401cd00e100db00d500b000a800a600a400980093008d007f006d 006a0068005e00560052004e004a00480042003d003b003700350033002f002107fe07ee05ec 05c305b005a0057b0552050804df040803fe03e9031902fc02f402e302aa026d025a0227021f 01e901c10185017f016d012500ee00e100df00db00d900d500cf00c500c300c100be00ba00b8 00b400b200ae00a600a400a200a000960091008f008b0087007f007d00790073006f006a0062 005200480042003b00350021000040161514131211100f0e0d0c0b0a09080706050403020100 2cb200800043208a628a234266562d2cb22a0000435478b0002b58173959b0002b58173c59b0 002b58b00a2a59b0014310b0002b58173c59b0002b58b00a2a592d2c2b2d2c2bb0022a2d2cb0 022a2d2cb00162b0002342b101032542204620686164b0032546206820b0044323612064b140 408a545821212121b100211c5950582121b1000425204668b007254561b0005158211bb00543 38591b6164595358232f23f91b2f23e959b0012b2d2cb00162b0002342b10103254220462068 6164b0032546206861645358232f23f91b2f23e959b0012b2d2cb00162b0002342b101052542 3fe9b0012b2d2cb00162b0002342b1010325423ff9b0012b2d2c111217392d2cc12d2cb20001 00432020b004438a45b003436169604460422d2c4520b0032342b201020543764323438a2361 6960b004234218b00b2a2d2cb0002342184569b0406120b000515821b0411bb04061b0005158 b0461bb0485959b00523424520b001234269b0022342b00c2a182d2c204568442d2cba001100 05ffc0422b2d2cb2110500422b2d2c2020b102038a4223b0016142466820b0405458b0406059 b00423422d2cb1020343114312173931002d2c2e2d2cc52d2c3fb0142a2d0001000000010000 cc8143dd5f0f3cf50003080000000000000000000000000000000000ffa6fe00081206000000 000600020001000000000001000005a4fe4600000837ffa6ff8e081200010000000000000000 000000000000000b0600010004710073031b0027040000520321003502aa0000057100440400 0039032700440237003f0471003d000000000000004c0000015c000001e8000002dc00000370 000003700000040c000004a00000059800000618000006c000010000000b0060000400000000 0002000c00060016000000c4006200040001401e072703220b1f080f04275d0e0d076a0c5d07 550551234a055d5d2b0d35008db8033c851d2b2b00> ] def /f-0-0 currentdict end definefont pop %%EndResource %%EndSetup %%Page: 1 1 %%BeginPageSetup %%PageBoundingBox: 0 -1 267 148 %%EndPageSetup q 0 -1 267 149 rectclip q 0 0.168627 0.211765 rg 1.44 w 1 J 0 j [] 0.0 d 4 M q 1 0 0 -1 0 147.269531 cm 57.602 57.602 m 79.199 57.602 l S Q q 1 0 0 -1 0 147.269531 cm 180 57.602 m 201.602 57.602 l S Q 0 g BT 14.4 0 0 14.4 -0.808591 0.31641 Tm /f-0-0 1 Tf [(Start Position)]TJ ET q 0 147.27 267 -148 re W n % Fallback Image: x=0 y=0 w=267 h=148 res=300ppi size=2060163 [ 0.24 0 0 0.24 0 -0.810469 ] concat /DeviceRGB setcolorspace 8 dict dup begin /ImageType 1 def /Width 1113 def /Height 617 def /Interpolate false def /BitsPerComponent 8 def /Decode [ 0 1 0 1 0 1 ] def /DataSource currentfile /ASCII85Decode filter /LZWDecode filter def /ImageMatrix [ 1 0 0 -1 0 617 ] def end image J3Vsg3$]7K#D>EP:q1$o*=mro@So+\<\5,H7Uo<*jE<[.O@Wn[3@'nb-^757;Rp>H>q_R=Al C^cenm@97NI>M]:fL^T26p-)C5lQ6DRIm1jW.[R89[/C"4\e:9@Nt<@_'k'CF*.SChXY4!g 3;B=(iZ.nO6GeXa'm>H?6=G'b7D^'c`dk4j=15:;fBkOa(K?GC-]/[+#K\%aSoa6iKqrG!;OG PD%8^^pnX!PjdI5j,b>e%5cLOA$Yu_=24Un%d;O/ITH-bV]jIOR,+&^(8.MrBu^j9bG>4U\ PG>O_e;>`Y"/@)5?Ug+WJ9qbTe.K&`af:7Zn16+ioftN?cOX9#hL]Ysb-0aq7=D&]JciXXh R-bdB%GLobG68$`W?0uq`oE?Io\9[u#FPAK&6c3k&K.EXDnkr[2=I&f6QPO/64ckHiA0?hl j`Bqrd4N0-R<,EXGdM.Ze8\(%To/b>6`A:0$1YjKUe.iE];9JMW'gkt89iG!,1hB6[eeO0U =k8jd/PXh2eTFVgMX%r[fG4pM@G$Q.9i]j] SdjgESQ@5O(I!&D:*L;[<9Z:hA;15H/=@BZ#/A6eb*gh2Z;rki"uq-/DTu#%6D4B]+b&* 7$\JBUba4WY!U$.ptNME=qIP%DY>%KR[ko,SYWTmXK8#thL`DrUHRdRkmll!O&VX0_BSGDF h%b7uSQ_(=\mMZ;;"m_XqmCVg+c%iRjgFgge.pGdA_=3sH.C\_LNp"A:]<;[anf3]:/8q$W qoeQPrrpO9SF8TbnJkmLdI^)`*RFC!:K>r`$0O%YFo@@Y?hKtnD;2k^%iNf>Hs]\)GTIBLi N=0(@EeNE#<1XfSo:.HG?sC.dbu5HTBl@qca8],h3X>oAt>j/nbf"/`T[/iT6okVs#8d.rZ moVCoRkLC&Apuapne^ gkI$>8rM)K-H>iJ*S2iSNA7.77_%t1j91$3Y.?Va=MFaoXFcR4/QkTBq&/7Fc9)^p8kE/:C EndnP>H]^aa$#sdnGdb1-QFCks6c[7&_M2Ai[qF]dIAjZ'Ir#;+J/e,\8g=QW!6X&Qr6eV? BPX')#d.nPR`:2WTuQW,5dn:(5>Z6CHn]P!.C# *LJ_5,#3\2VT'L!Bd<[rGaV>AXZpikHl9S#+6ee@mDO)rU4%a4@0n6%VM,RPs8Z@t8VbXC[ d#)#Uk<1o*<=FW1.W%`,709EQ/uCKUHUb",%B)-BW`2$=8Ld'jWE!!%$_'Y^bO= m&fMbueb'ij2\>h,iY`;5t:mZ<$hh260/9Y=MEs=*jgPfF;5k6/0oSU%>h9Z*m68dTUE8C$h J%Pub31>14L./_.\I8KumCH]2!A28ct%%c1CTSIfU[bD0T9l3t;+0.t&I]0cYf%6M3d0*Td >[hdEIEhdYn($UC\2W%`f]l\0l#9ML@;Vt*%p`2W5:l*$4&aF*,rn/(NNW)iR,i(mdS];K)et^;)sKO:+6\JX@D4#>Bqg.jZdl_p u>JIHS9Nf[J.QX54R6c_lc9,3=c)H^e9g,mR[qW/48LFm?>D!;$'lr,2]V1Q,OMA+1Z3Q#g BuIEs>&Fq2RoRN6R`27JmDdY8>e0c(!QYkf:6YraUn0S]i\$cApX2O5*n`5^n:!p]LVOr5nY8C0+s0#Bqt8"0[`<-8eQ+[V=RGrb[Nb*%=LC:F%0pMq6\da*DJ'SVL-ipY*rjigA:E lX)m<^=p*StQiRu5)-ZBf&++e;^c'$UGR#OMbkak#L<1Ar0*_p59s_Z:dF26]7Hh#K2YP-6 (AhnsD;9Sk1mSXMEK/4X15uuh4.KXmt$i.\HZFJ]Sq;[;Hbuh5SN6^J0 /gdjunQ%7g-IDC*\@ac1t0Lcg-c'#9FhR3.>bb>E4)NcA_rd^3J[#DkjbCYVu=&@+!oZH?E +t0fm)UlWJ`ap"bX"J^7ceRW0V:g\HPV)WVICYFk)DK;j*V6_R\]VY=0$dW\\nl(-M,n+#_ \_/1JrQ7Y8^Q77I>at4c?P)gPhrB+QgtR9ZH(1EbpTi,]RKN<[/L 0``!FPcL/p8KNm`\F@8:f.gmpu@"If/Q4iQos9:Pes]1@C4h!iJ*Y01<(+klSjcgL5!L!!! um6nNr>"K^#QOAP59kTeFY^[;S&_'9.7rp:6?o'dR]&0C6N,m#Q%!g#DIk7%M(QB[Ii#R2I Yn;tmJ!%mOI(pH7=0VJZ2*6PKl859d#OKf"..04C(aKQYe&9S5=L8YJW#ggeNNEZ[-13&D6 %-@WL6+[.Kd(l=#paUQW7EY*p'8(A'R) IAA#&MQK'iCkjhD%gkR)j*6-E*C$'W^]^K)^$(6nHfS7`:sm]mEfnd0Z=*4b7\f.D35nLB[ IGiC0gm_(U-.Cd=1`&^cRP&>oMga<=:C*\9,\;4nITV"I#>)QaPh%MC+*XLeLXruh 4G;8E*;C=aRr"VJraOjMa_4VZE\Sd]@j?",$BEIN1-lj'5o#Kp#6IlcU%fCD <"78X#EiR,e]-D<:Dn.$H?B``(+W)WZ $.ZE+VsRsrbQj07QTYh$S-0]jl5A?!@7jX\dD;s&(-Uac93DF%kV`c^OS6pi;YDap*B,%+( 6ZPmp6+^q!_Z(#Vu;cErZ\k"SZ!#322ec>7N"lP(lnp`JHrq\k_$8ZM[!OO3&80'Ga%5,!g%>Fj j0fWQ&33tFC%)D"%TG'(K,;Mg)n@g/aq@dqL/`8P%n#?H;AdHkq">d_LDkmfj`#Y&_,LYm1 i@?Q:p@*,##VuGgEs)to#r'/W0`W"E;]*Cc*='JB.C!9`PPH^C"D6)]&dVDPM%XXpWq"[L*pmpuI6.`Gf``,g+T+lL9^&O^"a7'$=D'HeYRr?pq,$NN`@+[n"m*? S\^7^HdP'-8;P1G]_idkg>8c>FItZG1p`8?o\Y_AL3C7)/<$!3s0`!F&/PNkb#_'m-P]65) a!kSN179>i\/,U0 <4)WJn5Kfr<6P@(QCj!\%;=W!F-Z^[Fo,Jh]sBqb7,N%MO^%X8 b&YIN;lD+*%S#opirE,uubJtico_DPYC@)'&8'V[n1L:>R0Y9VabQ%rjop?^c4N)(B^[kNHJh\Ef6!Q`,C! 66VJhIE1O)Oao,IB'3Cr%Y(+)ssPFTOjKp<-p-hbjcm;HK#ipMU0Gp'* lEDfg7tG5Ei6s!#lf,`G*&cF"JiXYlJ5(GBq/!nuE_H@C6='h>jSOmr,8*jECoS% JoHSO$+"h,,EJ>]H-\-1u'B1H`^]AT[-Mp)(bS*ht!T#'QXNIgQ+ns-of?PXcdKJ1RGXCG8 Q4T7I4aHfn>W8!XoFGhA8mJ\/";=*XOh#C.6$k0!G2cM3X7ms6XP"QP,.aPB@bS@2di^lP21s ?K'(ucEg\:4H[K&h0420_E(.>)m?=-$o[K_F>4<"Y1F7oV0.+JUqP6!m-@bSqC4b.*ld'.= EN_)@\s+mc'-<1,7Y?mIL0%Fgjb[j(M]@hh=<*SF-JTR=NG/NeU:,C!D7Y,?`o9-CF:qR*[ T0s1gCFWbbD%+l_]n@L^sTH[fQR&n^MH&s;=SdFc!dbtrbR4jaH$^5$cPIWm6eI;pGMjn:k KR!`jjb&WGQuP+gS-;+*E'["RkscA3\q/UuXG`5#:)DUIbolbPiZFLPP0G,-TW]^![@6qbS+/)'Xl7HoI]hMJO1G5@'Im62C*:TbRur[RJ!2?r:ZQp,';e(eI RVIhe1N%F)\5d?+i.`goQ`LMcLjJ=WM. G5i`i(VpPC+lTrb;gqACt\dLSCLU6rca=MuDKSBW\a,a,se!,nt`)5uM*WA5D0Y)Xp\:>Gf",;u1!bk"UP5qH1(J7tIM@ioJJ%^B>4[#hjd"3eAY5;08n>p/uhfeVQet d:\oX%kVH7@S*Rb!NLb&c`p,8_,hT-D@1_nE/ihMdLIK>:sC.N[^s/>1s_Ou*ZP!$bqj(%) hGL\Kt)Jd\@[>$qiK#=2BhrRZV83AR^ocbQ&b[MJXH,7Ha$4Js.!gsVOOkrGW-9&Sh9:QTj*Rmj]9_mA^B&XP:2%)GNFeMX![^q3tXi\=Ode#f *X&E4q/46OIB21iHujLaNj9WPn6"hs#L\scZgReOGl6r2RHVHEr(>XhgR7aqG.`M25J1[P; a%N8R"^Y@g&XN7uW,1a-G 'mmd%=sC?/(+doom[q]c`QW_Obe23EgFn+r[E&2q^YFJHI#'Ym4g-9!])5LPjH%6k!*L2_c NO1QYX'JMhet)4,;B"L]-8P@m*.4H,7OIOPtDI84jn`4@bSsKr/G`KB*DM$%.nG[\hTsh+j +rf[N[?V+:QLWZ7Xc\[mD+<9[bj$3RR\adQJoZh($SG05ULR]"NJMgdBEDKM.j.]7ta[]nT =k/[s'&S\j&hNBt=m&#]KJ-+MmX!Kl+\80)!G(EL0]:&51P;$6mHgpod*=\$q-?GV3/]I^* CqW&kA8AEr[,.qs?)2]1L[>Z:[NNb]qUIj3ke_@o[g^X/9D*csMdA7_g_u:XgrI`ce,Y;:" `7kC+hBlD,5N?]K3e91@J5bM[dK,q26li22*NCD?pB2M,+`ZK_GPWQ;=:cNfg?a`Q\@$aq7 **"5U`";jJh&d,79SC%,0q_AqF2/Daar,!4q9CNK55F8g2:r9 )]"MrR"B:VJ@*CH_$\Xae"9bSR-.4D+d93rAXL`n_7Qr3@([UC>W/,!G/Uq<9(M%Nd7H/plj;F0$Q52GDK86I"uJ\aU&Pn3AYrPGg>[_r:' Bi]bocl"LSjdFcEB`?/JeHJ&EA<\0ERbqlK"69j^^DBtf:o*d;rlhNCQ^a)n@l:^p_T+)Mu eaZNJnU`!-5FfLBdK\\unk8`JJd3I%\dkj[Q.GW`A?7R]U J4>ch(D(&J_la^ML-m+.XpY0Usm2]OFtSMKGP]3XkAS(6s&ID9.WjP1:K$&-9*#2#:90(@$ (@Ib7H?;>`,b@GRH4Oj_^S]kN2)At_)Kr(E'[2B'qY$)t"B@'j#BY.plgIdY+SGj6:]ptI7 )=`1d6IXt'9`1:Lo9l`mB>D1sT2(&\lPdAJe3@k85OV8b^(;BI]AK>"4U$=7P=_XDC'\"FA ccB,9VpaR0?dAfrVf%Mg]IL@:]q"*5d3R+N'<>6)[A[uKHgdiE24ul6L_oL%7>*o4JsY:@c %bc0d>Ed`,RV4'Ld"&[(*8Xlsgo&EMR@h7e+>nG"5s4HJPfYm"2gRBCibXa5?sH,q&&`G0d K^)Ld.X@+;4&M3>_Ta>kJ+IQ:'fJIO=[Tk)KTK81Buk]a3)1Y_iu2f &P`QN""HZDUC&-@J4CB"a76=9)0dA#Sh'10qPbKjjVp>[\_TN!jfYbmqoYAAg6o8`W57fp` uu11HXBkJ"bU5:0`5&g7CG@C@p*tDR:RphI>;N?G,;6T> 3\tOD#lQT4pKd6b*GA!E^4\e+#cTTbHh4Tg3qfAjQ9N"p>?R#?LlPT#@D+dqOTbN;]o1MBk WKY1ZHsuPrXW]&P&ZBL*IrZ=JBVPiq/lM49b.'Nl"a%!VMRKTjp8$AGBVY5ilf6##A*L43A YBGe)"GJ^!o\SL(6JEpP1jboY[">!_cHru)TJ7L)Q&O.AU:8p,/?$eH`SJF;WOXS>HC,UQ<-_ X`>R87m)(7tT(W"BohbGknj:j^^m4@@8I]2knWLrh7Bu-S08&6j:bFB<$@D"UUAeH/?ZuXV;KU[F2EVRZO4@GgC&!W6C;bD=4.V2S[,Hq@T5\LHSjcm$#O=F:(H# YHJd6EG>C`#h:4pL-`&Jq7s.5T?+OqRP1OG+kjQt1dr7l8[Td5V5cafnE>5l!u;UrZ%ks#< T=8-+p=>>B3H1M9Tc"%F%5K,;m.buem?m!t3..IfD`?q6iB^dufDO;0/XgEf2;K0;I@@R76 nTp$VF\q'QFha+UQ`n1V/=tiRAd&2eP(ru]W5Ue,o/RIIPGFQKt8E:t_)DnjQMZ^%#iXrd/ o[HdfGI'k9RP6%+&i?!Zljot\js@CI$WM=^.]QDB2fn8*MeUX$d]nIro>M\@WB4-l"^7-JE VW3eG?AVqA#tr]ZW;+)/#B&GXcguR0iP9m_H0D,>"?]+e:H+TnL+0?J.=`%r6#nWjVQ?'j[OoD24Cd[ muV<>NBt1C;jDsQ$4.slu(@=[+shK9 7T2E$F\/Q,3Wr-1(=+0bP`c' JW`_;2G-9P.'57b\m0G,gVEp0mg.FuA0\=meoZ1FGAS-UE_fih^?TFH1&]8#Dfn@7,YIsn. F;a;h`YV#D%2C0_2N?,K9jV5KHr_E8 i$fPB&B6b%YP:.=3aldrA!K",L4EQK0]t!@J-XJO4XIrdTbGA]]Pu&IuJiQfAKGb*]M\tIrXn)f=Ud:A'k'J8*R_lipYauj*Z?=n pXF^p)_]8r;W;A4h&W2T3(?,J$J]=GJEo[GMrGr]CC@%j8>O9o2fk"m(ZWKrH5a:rdWo)J! ]d+R60hc&&%K4b>\=GfDe)5!'gjl^J"8c/*O`^A3YGB5[4LYC^34NCd5Q15K!moS%cR(#XH TC5hlhWquT,G"$f6cMeiP^lk;ZI'L>D-$8`&Rg^:l>$OE7$_-@mEX;aI8N^3LS5m/5pfVq. f*'t&W66%17KGMCO,XIA7Lf>8//13c3-pH-$5o^r_U_,or.)O1[6JO1V<$T7Z0L:?Z_JCjB /2KXT^d=P@_d"9G9IrP!3(&Wb6^k9sr%UNC4?XrF6_ln5loufG2+)1<6F8[,A3\!p6psS.T X](jLi,V.72Dsd6d.X0$b\p_8Ar_H7+nc^$pm?%:`rG!7-%67/1cQU<"S3c-71;u1&mE6o>fI1\5]T1%JBtXY@?J3)7@Zt>CNDbZAB'RB7[Ut[gg< M:Cd+(k7\joklft&!c[s)T7e%?c>\?N:=W3N.a!>guCj-25CIZN``ShLuI!_C+FLdu!#a/""%X2[WaLrdf"1(nH6&Ag6!7u#rk !aLmE'/>K&5q""<^=i2#>]\#6nA^-Hadeeh'T'o`OtB[7 0>k]l-I$H:g-goN;:hH[EkrZ:n5BT:fk]q!%mCT)Sq.Zm/b2N!mZc;6e(g+V%Z]e;c%T&d" Fa/`=u0sb-fq0N&j+u5ta5B0i?+#a]'H]%/!I:da1]*;B6r"m1iE^'uIWO;Cs4fXMHc_DkY \h,t!:e5gOtG/10\L6,apB4Wi&r*R\dZ;]2f;4VgsY"O^R2;d>eZuAY`F;krBF4'4e.l^6Ki6K]Cf\Xc*qD;lTYd%o.p!(EdGs:g2?;amB#%?Y$2(5>7IlB*OArbZs(7AKEt\6!'Gs([p+QqgPrdKS\&*k]N_MNgV(:)mClg'^ "a(3>SY%Z*Q),6`*=V->W>[d3)KmFZJ/*[gl9H]S]b9'bZq9ogqCs;mESu8c.riT>nt^l*R e:Ge6OBN>s6`o:"ETuf3OBeh4<2(V:f.Vgg.VL?+&Npc/.:4hd-cM?6.q[/`C"nia#r5LHp 1/Km2)GGX_QI#Q8aF?0^$)lX%j&?JXr(mHn6QmU#k^?OcR5"nOl"IN0MI+_WX<=WaB:@%Xr 4"h8O'M.6\`5_Y:q"3=JLh>Z^&@NHWJh=Rm"XWda`<0;?T=Mh#2mU)7U@?@p)`Vj2Q%-#P`@bqN&jt1'10Ok#9@e Kk2h@AL6.UcpH@nnpl7Q4g`2red8A"GO9Flu^639/4L@AY5X(*_f45\'4JA,\dT%RO\i6Y& qYjBOEK3Oh(l8"6(Fhl]+L^&6n30]OKRjPER@mS.6c:1.rqA!U#'Y#Ai-;roW2AR8AJDH,_ BDI^*lA&_P\Kj[uR7V#OfA^4UnhHsjF?tJb6jo/\#.#E]b5QgLDY'4LWG\:o=kC.\hY'N3*=\Cpqk Hr=jk$i!&C1]ASkQZTO/qRb#J`oj]+,Fuo&1AUXa9-)t!UbX[SnfXs8IYGaJt@uo#oVn!IL =YFk:Ujj/s9p4FQlOsB3orJSsO.$QKa-jl&M3HSsr"]I*2/2l)a77p58,6L$B/$C)3IW*i! I&UhV.lKD6\n37!42*Jp& 8TS.D;NBN#2\b0heiq^DB@]XGU``E(Q-m@Mqu0&1A/no%"hDbg!AG1t*Ag[Au*?Cp@u-K/mGr,9=JDmoX`cMiV28HP8.!!p GX8-"=I.Y=Pt#_)##H>U=4Xbp/@D$EZ$mdTZE$ZOCsD]\T@me(Puq/HoUE>K0rQM8P!q!f> @Dl3L&?P`0\s7)-dEL.M^Sf\.J2ZmGt",Jo+Y_;L]`t[IKUJ11Z$\'fPTl?T'DVkkCD[Z,c %:IKlEA&e]-S'1<.e:V1o$.d94K7jH/i#'8EVCAm0/@T5)Y6`\F&t2>>Q+*p_ChN(W3i4Ss !;B7-?=khEfWD*h?*8?/bBQ*F<<4/-UDi-6lS?D8ma8o3js)O2KY!=F)OZmQV-nB96AKR&- "UO*2J6cNflY(ocH81mgm/JC$Y>k1-Cj*Q?oljV_T5O>ZE-D8$G4p:U`1M2 (EQ>7hp(qmq06[%RGB]*mGFs)tVe!J=br%JRF2")acYW8]D0Q7YG3.t#!p r6L"@pXfCodXI8)rh&D'TRd=b5_JhM!:UJWpf<"Y0`?LR^]O'gBIj5+2["Y&L%jF%p\0+)h Y_TWr]g7/TDO(-r+/+S8DiQWJ*.(=&HqOHPBi\\D*"1^kL8,fnqB<%ctJYi2("5SUf/^Af\) @,2ulrneRHVDAPTC-.JoX$NK,kk*S77[$iMe`q:GrH?4cZe0+Q >@#8+Fgg.E]0rb"ThdHYiMh(H`LZe+SgH_(/nLV;^:Gl6E*8 !DKdp%j*.s*)NGXW4jq3\[Wdg@_@9m"/,-W/.4h=-;,1PZ]*29mG!%Ic'*L$3).k \krI&

].KC-%*IVs:jZ Xf?.4eu3)IkBsdoT*O?NKA`4WbHt[s51R%-HZn.l@X,&l\o,-gn%Sa`>%l0?NfJ[l)BNI.o\!RKOabmOmPHChjU!Oh=5EYUd_#IY_;"]I[s-VON2ZRlRfsYXaW>(YC$@V&NH_DH\d/3CaqN*$_h3Np?BkM3uC',;S2F%++2d#%2 $UUG+G06'`ZM%T^7`b+4A$)>`2MTR^4$RF[86h4 AAjKV$0l#b\H5H_kB?]&&D(W0%[hdN"Ybi8TL=#B0Xb_EbaZh4l1oIksRcQ9O9I`Nm[?d.K =ku05FY8kGQLb/bh77rXDUc:DNW_[H1-<'-3p.[-NdbX&VBLq%2r\L.N/nt+Tbd%&`KU^dR+h)6?OoW\;$;Y4@ &[2W0ds6^jM1Dc[MR-pch)Q4Q3qe;DGU"`hj;=#5h,TE>8fuiX?ogJOg]`D@IR0kXORuR?M !abT3G]=C[l#8ZGcgb8!N!$B6b;^u@Q8nAFnB8ME@mj%Yg!Tb">GZePSPI6OjY"08D,RDV!Nu1<#3'ra=s\AXQ?=d QA\RS4[l>m%A's>p=E8>Dk6^IZqk%,:de&&IZr\JIKo"Mf;B;3T1 L0uqH4GGSmK^!h:7:0`j)L'+Glrrnt4FXfusrYLn=-&-g46$mU-kcsBlT:8@Y+,FUk2N5-C#N0n723$PS?IYZD452i^Td!c3 j=G5G(\TA3E^uu!l7tX235kG,:g\D@&o05Ti#>f&eN!I0u'o5D.LJW!qpdtXi%)BCR\kAn] HlTu@*P-nFOIIqV0]`O!<1g";ja@HLk_)r+A_fRfSKJk%&at0mD4A[O2WEHldauknO_t6.2!FPue9f ted_mDd!5uIdkEP>sQ^3iF(:e@NF98=@,#I&M5.W7Ikffast7,a/ZfMNN-hEBXl^!ouWHf% !qT5X3@K%TOB[I\fKX0E_(94 gKP&5gB?$Ei1*AFYW'g]G%>.n(0\C7O":r9nEQ8`]KErVJR[UuHrrr%(&#&+jE++HZDa3l? 6)a&WBP.G2\3U7<8*TLsLaklnaTqM0bZ3A)Fl %]gFKE3U6nt3cm-c0,O_K:u5,-SkBKSVoI'*GS_JMi+:>D@)dKpZKU+BF514,"5XK0quC'= pONTn[?p//VrMn4>^j^-e,Db%s&[FK!?5:5%+b]ML)boKGms5K_bHb2PG"*(%<^X%O[="6a 4.Cp_0g[4SH?]gL=&')9E#:J7KY]mZ+!Y;bPWSRESZ"FB1R=i.VGC#:[InpiqRA[EN/ d9PR.pXHlPEaipR'bd>Qs\`PR/EJG*2KS4orUsR,?d7jbkbr!k=OIQE_GQuN&LEKHI7#8m^ _1r:g".OoDb]:c%h8f$-*Wb4@,\O=e3@>fj%B+T-fP"!DHd5h)L;660m+kD&kmO56JlL5,p j!)MB21;OYHjgV3*$0Pk-D5oaK5!S`:QUEoan3aO;LRlU9(BKSk0od:UH>3`0ATq.h]eD6D Q+ubaD%uRn:Ph"3=A3n4U,FTho9map^&C4>ar\WChRGd%q,mS>X"L1!:Kd!iS`(Cp2"S&^' JRd1ih3lpK/o6j(M;^/VO:A$-c`@THf/^iRB818lmW1/KS4O1mobp>0p2)Nc628:hbL#>N- Y]Y]kEJI@pKbX)Q@,m!_7"WYJ:$"SfE,5[X1;?A+LHo\(k`lCoFGC]PKWmPe`CS7@l3@#T" ,ltS"\cG9B:Ts/NHI&g3,XFp4U:iQe4il=k^PXdWi:eV(9#>-:W:h6=P,c$/[.YMbM:pg_Y`Ga ?CE6=D+;-M/Mk[dUK&lBBdf5f;:728mgZD8$l"g_?0PpfOu[nCc!/c^5'f\/8i*Dto=dHXR 3(eBCH,#T,i=CUV89Yjhr,d-ofLU1if"'sO/NRuBZ#69"(KiD1iOkD%Dfed*,3-U-_'N8R# <<\`BFdUj!R>X$`fiVA08:q.tAd.9sZ-3(o9g@>Gl,W"'"On&_8ot1VPDLI\+4:'joh!kn3 Lr\i<7R^H_h*ekC]tA+fq:6Y\9B8GVHY5?#FK614fOHA=3kG\>A[PJE=u&f!='H:KFEIb&o ^k4?ea[L>P2Bt2.=JnHAB:a"[HQ%_(o%k!`j/Ner9ja[E-q"6dUHT:mH%P"jGc@c.=8d'N% Y-U,10p&D(LAf6u+LCp6O6F4Zu6,<.L`87L65IEPn7;7&uOm8H%TJlk0g?1Er.OA3ErLL)9 ]hDL*8`?X5>M;D6BLU"ZK)Y2PJg0U?'YAIQL/aV?EmG?smVVlr&Li3M0>_H[lh_gd.4dfYG p!#?k"5PYje\$\lHNs7\>?.X2)[_1&X5E!p#*Y'A.")>fG$aZtcN9hJ]fb4O%>O@C")\%kc (Vn9JHH(ALDXA$V?5]'^'D/hLBJI1Sbukq[Tea$@5YOQ5m:J[l/;Vk#HX#ch7_SA^>&o2g[ 2g@i-gukAqoMlghd/r:e]Yuaj=oLUkhp'\8"0,J7"N.?00u"m=L#L;8jR9hCXN>/L+S64jll0L7i`1&9eA pHfI!KA2Hh9-4T$:7HA&MjD^??P8/i)@><-.K:VYq`V*ieojm2ZML]^Npe+<5LPON,#A++K G]&1b2.2/>\@?2T5U02UF9Y97A9a"fK.1A$&P'(>![^uVNaRU78cl,\LZ!Q8Y$:$bq1mmS# CpdsfKWQ2&n*s:iD+./c4u@n7>DMY@?qj@SoEip3+9^JSm[%Q+FXPa?Ss`d<=o6I:ZK@\,"-G(Ac\J`;*!@h:)BV:&i004O't_rO,D*\h-7D+d&[hQ$4$LhB Sb9MrLYdUZ_FI=g\uhPEb[A&^TE7(qX2MJ6Y`RUAnpcuGQhj?5Cfl*cMGOE]b,Aa/?Kl1Ub +eWf0g;e5SrC,SiP5,.=/H\6]V"h\>W8;N&jI##LVKZH;fh?Ap!BES#Njp&#Lph,6c*lh!@ LZj0#StH@9Tt2j_CNcgqJE71612@)%^bBI*?mX8MG(uYqCKA3,A\87-.\VQp 7#9ZotCmN66`$K62E9BF0B4fGEH=7%(_$#!b#6&p][ NffmCZjg&BD1!FIb&P+..X15@]nTFhV-R^h!Mi3EpHS>k:C;A"M!(Agmr6Ra-uD7L-VfP=p7Hb2oU(3N>_^= L<-:L[!nUKH!:ALrY/[Dd#<)O'^LW.VGm9XFcAcV^mT$Q6VNLJV@pTW'oB2&'h;iYflZZL/.s:$F%4<)BL&!(ab=sJ=a(9NtQ2 ,'YO+V\^@ul;h:&1\iH*9tg_9JTc3_*eglU[(lJ7XGl?>uRV#-sKe%p'8FUB:.c#JE-CB#. 7ZU305@e@27M^sE2A)[<69@',e\(RKI[KAc/.n<]l.?YFFtC&;7P&7rDnE'Yr\qr[osn\;^ 5Z5(^NEH`aPEW48f+CFLHNkQ;RLA3]\h^%C.6g**6!t\'l7jn&WHhXG\r27`tJ1kC87!J)O p_V9Ns3MO1hK(&sI48-M0lkZk72L2;,e#^RKM1Jl%JYtHG`uQhjAC0J55j0.F8s+%g0TL>B npE>KV2t4?e0[-P*\STfak@eLZn`(l*l<656?aqpRD06RssOjrp"_5#[;sOp,]^GLT#*FT; k2R9!ROgH;bH2Qq2gpqD(\iq]/Z?kZ%R`Zl[S/KHPdY=f8O+%LWDl6=CG84>moaL-srt(o0 JM'8sh>&\-=&W0Stm<6!T*P"-g_8``iaA>WQ]QTe_NQi,EO2k3WU;n:u_I6XB$BN.#=(6(h [;JB+AAN$)TW)RM1L\(?Z+_2*_\\(e&%4-eCWGIh*5 f:1mirHc7dE&[\1(C>l5ic)gOnefU09:d6/GGS(eQ_urJ9;a6npRTXnZl2(CQU@\!C,FY8B !5L?fP>XkrKc&L\(U1ma1(BbkEt0lhpYZMmJQ6o5$C\dP-p218M$AP*hQ*)fB[U+]tVO.[G =+u)^][52p(4QR8U-'nk"pC7^1$+`YZteo_X)e+2>Sbo`%.:qum)9O9?!n_!ile"i4#O'*l @8KH1?8OIRm/6P&sj7i5_*2Id-UiK"PgE>1tX`'TS3A;MRGQPRR1FC?',;647H`f\2V*642 sI2tijm"6D$;CmYLaDst5AW*A69..[kKMX;^BC=bnE4i 1JO',gGR7)N6Y4fVLbglSS,5$ICM*"rBJX9EKk&U76+=b:t.oE7+%6)*CWj?D'MR!<37T>P _D-+4qVC\3DWS\rC'Q4Pm'lZeFbCjBQS$I'h%rf9FkrC$h07]lNTG HBQ`?R)*s\dtBbojQ:,aKO$=SL^pau`&@$j+mK]/:f*JNJIDBXkr=KWm,ig@_;N8p;^4cNt hmR*&r=Xlm_)'qTBHCa[7oQVBl5%Ls2CIW00k8C.>S*,(BH(V2#OTHaPLsD!Skm6^l U.#AK2Fjb38TFBL*Z)8mXk`*%VIO8n%XYJE)^`P0m2J6:D\<.YS%%XONgIk68]kS1b>g*JNHL[;=W9CpbjR6Pml8>cSU_Eh'm%bk%@Am)G")ajtM%pJWoo2\ "YEeFegQ>LiE&O($`7m5'(Gh2832ijeDLQ?a6X8^h#@Q2chNGn-Mh=<$:G2J 0H(so??$i=9!\aTEF&&%L\+!8bur?!E(/n^p tpSHLM!?a3*JIj@pMrBE!f";Su![qW=@=C1k!9tWCd&NTp9*aDOK2ARR8]"IZ$)&UlKi!n6 _UVp"Q'="X&C)*0n'D1.G:%bfcnAqG&.\4AdHV`QrE>GcB-cI@nSQ!+F:NOOQ-h p+;iC-VD'i#I[5n#$YS2>ssg9"B/\Q@aK32+l_L=TIU4@cE!M_KBAN/EH+l\.g,[Ec;69'' >WN(08D2SN8HrEnmpJZr/b_H9h!5=aB%*[?&D%Dc3hArVq6p.dm+>:!j^V3eMhB$OP;4@r$ []b4i-FcGF8()I9X*28N_c21d"Xb>W@7.,9%fsTq_tC4AG/icP;TLc7BOeNX-LKR2\Tca]c4Ak"CPj7\E="&^)^>RK?JF:_b"27H@ rCU<1>W*f\mdeS9b]*4+]6h4K8!SWFec%R<(WW'8'JlX+e)khI/qeh2k(\i-jrG0j7L5j1oITi3qn*#.ai``>1A =O.aAU<`#HMl64@U!pT6:hi]n*!:YX(-5`DPu6$_"SMH==&W:0@a6k7=C&PMmdN'\QpCqdT FBPH@M1EV3(@eNdIJQ2NcA)F[@XhX]1&>%&L\X?(c^-6HZ!]6][Hu@2B& o&-[e9e()t0%gCWntbTd:9h%-6UCBe321=6BK$URs)j*k9oEQ9fqr6(IK5&EgIA+"n67JUJ !OjCTC8*E)7QfP6=P57[=ktioqN.HZq;keG2$0np9m2q_e7VD$iS$!4:3[i"nER"=&Z?AFU W\^Msj5$atMrCBl,3d;m)C%WD>n,WeVg)?r9P9Wso#6Q^XjpKdmhm>4HYkE1l!$uI%U/mMlebuc`i,=6ra/T`_-A%`5D HDSW-/QR:[0j1_=[,VCP[MG\,C6eq&_/>%8eYlDBSWn,AZ+`?`]o4R/+;e8)[f\n\=hdqtq OsnMt$b)1k]K&7P`nE,5u[GZPL9r&=G$?g5I6]KmY"^j6Nr\/aJm(Eo:h@4E%D_W.fP!>#g \@DEGj=;sNh'VV<1kQXX)4;dEc`NEtYDJ93UDZe?H"7S_^.Scfc\dAH^V65XYDMJCuKa$sJ 7a?t8%[Q?5Ba3Wh&#"eR%'CGkZHI'qbO;UX0!OYZZKn`R;F*hg!P%JmSF!JOm,^:q0GNnnW ]OWG=@g"F+o!.>o*b!R$kDq=C@3/eqB(fS%5?o+:@$;" G3:r=>b2*.`POkgCG^llL_d)@qAnE>]@#C)Xns$;[&b:L4rJ,RSMj%t[n*+l43#hQQ(S(pP (XYt4N'^(MRI&ognDnQ(ktU(N.Rnq"Xni=QanD&2,Ih*K=$+X%P8AGbiOY\PDdE?WJN%=ph`T n")ubT:3b+#.`^Y_rf#4UCUDK]P02n=q85Td9!\$B`j>10-Gep)f2hLk.#o!LX?oD%&1>%$ GX6mc>[6I4+T:-o-K)AaCL)j;h[Q(h#K>178[c2(>i'.FOm[iO0I$ia6,3?OZ^F@J1`#eJH ZM'W^M9JD1gEbTV_4C,2V;Au;pY-RahUQ=7ScDT*"\fA&HN.PF(I7nB/ZG-'u@@"10HQ;7)Y0/![4?J!B?uPQNHY4+-Vs3F."+KSN1b_j oD\"Y&m7nSe<;O+]Gcko=#l!\4@/a#1LO8%[IN33Z0(.'Z$XY!EpFW+QHnG)<&.J1D[N!4! ZRG#r4[U_'H':;'aMb5Us/f;gfspefE`5\HoV]D&4PiF[>X?67iBViOBg?lU(4u6SpYfEGR ,Li#JGj)rYB?18c^g9.Dbq7.aJIaRgG1BFpm#6j&+uB*L,"l7rA01,O,+l+UgrM(fND,,n* N,:D'3U0r$Ss8Pf!V2=j`cOhD_H`"Nej'_?*;F)Op^D ,KsC'm"FTF:CL6IiX(?'g\u3!C.Nd`^I)mjg1F;'hMAI9fb./<2[U0'WD'@=Q)7;4NI4\tR$3*>Hf&e*fM"nQ>(L&qN*gPQ+dm"^/oT5a-IsCc f7&pIQf\??1^aRFZ3'XsKX Fq>79_g6JtI5Xce0:_kH-lt[e))o0VA`t4Ei#S0*QW2dR[WuLepi@Ug%:H/KFRq<@%/nH_d SiSK2$8D^EZB]o)hAb8iLCKG&JfpE&qLB([]=0\4bL71CA9l+="t_56W\Cj;qC`AF[L"j?# A5$D4"mh.RXXLgMU'VDYS?lfQhB\@;g>dKk*VR20U(-106d1%+j^$QPjfc-lNmT;V7"biA)2=%#a(VchC"iG=RV$8kaf"G$()jGhJ(dh'^Rp+(=:O6(mqeoliCcHT:\ B=S\"+j;[&o&J(ZV@V]s3Z5qn]Tf8=#G!0?/YRs..I1(3:_)D"3pI+!&*.b#Ik-cClkLJljIRfJ!rS$5AjpKD7m)H*s-PZSrP?Mfu]5o?nOb_`[U0anEnopg K`'B:[[hSf-W2TUZVhF,.8LLY;>^pjnt][;YlaE*!@(C)e5f:R5W&M7B7!g(mQdp^rmqMO: Qk\?hiq8lo\YON0s5!TNNlc&A%9Ubj&(+e8#T&Z#8#V)hS[@JCo7NmgGp?l:VpGl+A*rMKF -@`D5U7TbVcl5N$]PW\S!h$r>8`pb)k/fY2mkA=5g\TfrB-HOSpB@eq`2!04gRNr#ltYV)=b)EpU&/,T= BOkpk_pONM?#h)8WjIRa>B0'qq+:M<,3Z!@^7e,IdLrX;WUt)i-RahB$T#M]q^7U&1W)SYQ (U$t8Z6]5,!iXh+D6G9QnrTu7a5*N?ZeV`JV+Hc&8_1_3AC\EU(:+k.KXh5Hh"/>9!RTUi. GS.Tel]UQiIiaaC*Z<[M)*`SXC5l88M()t(6%GU9dHGI"3\-J859IT2\j2:DC*5MM/Re+J-$cMX$JLr*tHN&(,"+kk)K)mS9Tgc55*QJ"oa#bB`FXT>k>L5]Y,W+I4;p:/FgQr(VqNi063Na-6ACk_g8Z=C[)k9gV1Lo&6+KWh((naOqYMI>_2d <_9*Ic(Xu5Q)F4L>S/];2f@T".AHAqIi5fG4=rpsZV'4b7@<^aM^r^4JCWETAKL@h`R>5go(L0$ q5^bbFGuJ*XG=I;G0n5);'i-4RpXufqVi9:YaWs^*t;c4qrRU\3/m5D!0*uMrCGB(JkZ[>W7M2PI\ltVU\s7Bo0E,3@A-/+!\0nh(#^n7rf-oXU`2T:]3`E#D8I5"bTI@[0t%5gJ\bb+GZ5 S!$&6=Ud27O3*u0W$U60]MAd7[>0Al=<'TPa2P=ajKR8g=l/XK,m',d%[Bf2AP+4HR/0mMV JSEJB.r"p''9r:kRFW,BG_`qcU7nhCaf!Sbbf5)3!'mdu1ZInNpRmjL+D7*TM QMZrel#=6jO5m[kOOkG0.F$3%lgA\F_dW'PS5q9\NQ5Q")&[5Si9RB(l5>JFB/uI-:g6EKC LG(HdV6)"I9*7KW7PeWqV?nPA[U1Xp7%&MkBX\j[nVQH;@s)Mipf"`SjtGpc/Uulc0UcmW@ iG"QVLLgn$UsY;_#=D=p70u'_`-Ik'P %Kfc8t(Ei@W.DuOhj^i<6[?t;mcch;,d-.6W-nV2,dE'F[]G,S>U)jlIL*SCKjj(Tp0.076 +=b=1/!T?s%ReMdY32-';\?2J&4f=]RNW7N)Bf(M[.)XflSG2W_2^>B]tWE*RT%bAc82-*0 Iu#/sejdMol/"0-i!sWR"P3p@,O!c"bL.W2A:]$GX`R)@CV%6M.,&6,DtK *[PNkPGeQ8!@Y\skHf%sQ99Wo^7T5R`H"L9IAbh'jR:^`ACR-'_g%'A,Af7sTNbe??N[#Gh KqddW2NsqNH9RgpC"d0kWG4JkTrVpS^8n>NHIfZ^*6'-dSK.I68p6RjK/L%m]3@M.D>SM:[ dJKskbt!sT]W?]$_$Isn#!'D0Pd-'$c6lZo)*?i"-R\Rm(A)uaX&=NaDUG$`p:le>Cj.MMn AiOd-od,9@@q\+&gX29&TObRfsYX_B*>%Tum$,a)g'QVs3\tS0YoCbk%DRLUOQA)gpIeD=< nSH+o'+l$;-ZZnmPO8I.Sl:32ikHgYC:l$%DGY3`es,L#dC:Li2T5#>VH"b(DTl1oeCa7&t UA2EX;Lf%7o"?k]Z$c&dE<`$(?6]anG_)fD6d7@ISiu/W_GZe2nF_RtCY.% H3iEL)WDluoq,)CJV%&&n>Lc+lJ=6P3BlkP),iA=&`d&\M4MNSm?7`Rq*+V_#BJ$P4Eb/cR A.Rk(^VNuA[7S)&KD&&bOOgAP)QI'WIsb?K,M29-R*PXC7PNu9`m AAuHL[h@Y)>ENpXplHB2.aMAsTlb1;e%1lHlWnQG@#*\3*2?JO$R#O20,3T^F/&6^Hc^SP2 DV/L+i8k.0r-$\AaR=#ZNh&bi#sbf'4 q@AI(<*H,-Vh%^Z>T5LesjtnJ))CPS4\h1>4TR^g!=fk]:0+@>nL&3?9C_jZPb!`8W+lIWe=cK(mQkPjnufZC3F&OJfOZ Cp]1AKG[7?f[]AQe[@A@>>c^qP4'!1D(LXIJ&hn(3f1c9NoG2r'H3ZcMI1;om.U0(KjYU&7 e=.unPH]@2_J*Qd&E562M(pX(f_Ztn2&27^emdEL>u7D!$n9e$QEAo-''F\]3n=b+t+M\X1;jVOr%Qjqd]&S/ CJ!pI.O7F>Xk?RbQ4JBn=K8)q=I2AVgfh=UMGjlc,lu!;Ql7[mJlk71bE9^];QZF6QbT1a[ Fn>'$.[Qsp7!EJ_h>>fLn"&LRGJ+=q;_F0Zd*`kIN @X"1^P[dI0LlPp'4TI_UXV>SbB[GL'Qm0gfKO1&%q5'X\VHq*HFm;UI:oXp;U?,PUi't_@B R;0^%QdPc?k%('u[jfPbMDrN6S3*^)#,kIg=t\FpL#sJFE-&2s5SgU%Ef"1++Z7Q&1M?]Jt ,iqd4R6rVsG'06#Y\6.^)n2.a7Pp=1-lGX6CXiQ_Ch2ZA>N8-Z4h?45,V0>E;B54\@O5\1* dl+e^2$.*7;g\AOW]*='V!ZR<S.tAS@SNf_)n8T 6k^"hEOt;koA0niBTs\mqX!K;f)`980^Q]^"95bHO%o,!m7mZS5Cc63*Yt2D^RF4 %(I.<%&OE(S7Ohg:#4YtU$6e0+Idt?n!]o1T4N(>22gI(U+6i_X$Z;? 9pFGDs<7/Pu_$fj_j:^.2+#1./(1fZtL<^gh+7QdrI-XqkE(k2cMe4T7Y;rn7skW`N!bJVB7pO3L<*8F@rhlgC5(G`8,AYZcut1,FN>l*Z/cWj9GGQQ' ofG9")oeWMk`S&M@OEt)13Ah_l()(WJ&>sLE&t#]HK?.P!U^_T;Y)0+BATc6Nq826C]JrN$ uf<-pjuD6F/bcLgrN9]#,ec6QDad1n_tgTh6l1&i7Bs9JrN+23Vi8]L4`\)ok'm`@PO__o/ WK]WFQf5Y2Bf/]'-7r.$Js6pt:d6r^NF#Xj?G35(hRbB16^O`_INYJ^gnLL>A&3`(Ti$cO[ 373oZ;*5NoA5R&oML['[g*5tTV`_:3h/sq(m\lK#[=GFo47dS>gr631Qc:m$>-0TFT85oiH HG3nQLM1#u>_>OGe]hiE#1,gA$Nl-n:BMY*&8aP 7ehcs-ei]#bACaY`o^18dH,,r8@N8X,T6V#X=3RE;fdahVE'aCIWmUIlO3:i-J14U9?!#ci 'D4=pr7XJjM$W"Y+M_lHR*bW\l=&k^sm:TU_H9A>.S?nm&p/r[*Z9XDZK)3s\a"S1*dN46u q*Z#M_d8^l=&8Ht-hB`JW"jHD4b9lh#,6*92*ipCncPhPQ fTbN^ib@`;cBe\)?<0WeE5%]GuU3GW'Z2:(jZE@CK+#(),'XXfQ%-$6WA0q5qMNNoi4cgk( _5=:c:p"P1V/9&"DH>#"f%D"h]l?DD7aUM"PY/gtBh+DGajD+B=+,9oN=lQI=dpQ_ki)Ts!6.7u`=`'O)7@@'sEJj:IOlJ(mik,HFBV8LVRGT^itJ4?3_d(=ES$&-"GL``WH3/].F %gNG%%3B\].magi(XW+41cE*VdKh#2.s%F8;n7+WFf8m=j5j>YH^,X\tb=+q:CIG%n^C4c\ 9gcaFiJdB.t+!mnVoD:h8ufMkCDA_c',G>E+Xhn hVRYg?N'@GUs]Kq!-1*>gD=FAim"WLY\.EBX(a`FoXPfh(#*Y9FfR/I>M-sX##uGi#-s>JVrX+>HgN ?NNI.%:o4p.@fe[<%N/#6D2^B\>c>S'a9mDE#N*aW=!gf;?p.l%4$!Sj7k>co>WUUAH/'@s M$>p^t**[tA!.H6@;'$\m7bVdbtEtem,hU!a*PK>@mg"hB=@kKT1^bCG\HXZ='aTukk>XIB Eh-L!;j1Tt2Ce*>O5$g?BhGuRG$:1Z)hB_Z^#OUkg:$^kGlPSi4LYXq"VFbphKG[%1O?s(h@YP/)@EonPp-E276"1$A>[&ia$34O!-"l@i:aO;XD9W-_52s#'@]kAn^4Y WM.H8n,]Ie0:BEVF1#,U? oN]s5(5\V!ZU:>?hb#3o6Ba_pMA6)1b"XOB2GR&DUl9;"Y:8J7WS-QrO**>44#$ku8WG8SA ^>O&:-r;k(a$s02"HI9`%MIp>Uh2#3$Nt:chQ(Cds5/?/l<0S]lO/IR9W,&!?g)-Tn/pdn^ 08I$a1QfK1\>I::Wu(R"pemspf@TS7dOI$lsNqKO@BDh8;'ITCpqLQ^s04jR-,aK7GD*J2.0[C',S&DQ`nQQ"X%.tm_TirPj)eFA&2XX\5.k!R:Gt@[Ih%LG9W:(C!n2'L3 Rhr/t__VT^sJr"^#V@mj7R42KN^d=4sj6-t*88[I^Q%lXr>$Z'6HAFdH?UY?^b8?$5UBFoPb@%psJr@!3AG"8GUnBKZL=ATh]tp2=Vf Iqa(MC3GYQp7H,DcYRd^C\HsQK@!2Bi&h-\EH`dMpFgQ?&3C"S6j')JKMXc6:e1^C;M9in" ZLdPa*WKT6Nn<&">EYrs+'kLJHYa8Ka:J-07\^(;?Ur)Kh+B1&6XXA5m>Sl"ir]W&6o=95m >#`Gk[6ns,Vfb:54QhKg9O$5Ett6Q$H1k]m#6dkEu(;R!GWJ"=R9)n3[@]DY`1]q<+Aqn3d FfDZim;qCeW?2l(b%7>5]!KO@mXJ#N4!WHtL4KmmL#84WO.Xp536qX@UB!([gMZ25?CHU"i `(U/Qp9SOf!!Gg'qm][R\%LnBP(Q:n"c!Qb%h2R!bNL"!nM_)#8&Td^`I)Gi nQ-LiHbr-8-j4d-kba8OkKO400SIegK32"UfK&eI4GBGJKCJ5[kZiljeU:h1#:CYaYLt+U1 48gJo$nIXf2EP?-LurLEd;$r!)hH-RJnii/U!T]^#h)CFJUC1LVS:P(GgN41>'O^bWjp3hs GmMmRC/Y0:M@5%m0E54T?MpIkI^U#[7Emq4)RWLQH2(+&$c8qK+92#>ehd\+BVDnqW:<__1Rrn]+H]6+P'J%E9e)B"jjMh8Z=P\ Wb[aH?RE:nE*)=M[l2g=&6D2]he659RPt.\!BpAI:7[m>O2:L\Wb*^pdXk'Pt?d[a_%`Ke*-IOI@gIGa5-=]I/`#1a4'_UrVh ;-qqs(=L/>6CQk1eZ"$mK''aDK.Hl30IU`k1@&;Ba.$psI-1,+fDi6"?PE=>>L7$0J6>n'1 >E%qp#aIGVaOc3oj7Y6I,?,mQ,EuiWHSjf#uM&9[H'9qN;cI8lS-r2YPLHSG>LnmM-PR3+3: rI2Y6r)IeC>:2;UmWf$"_;G?iabrI%4mKJA[!fX<)cAD%`$Os:PC:m+57Jmf@*g4j:27@D$YrGKBRLr< "+j&noiNb*4E4I1a>pfnekl#V(*2hg@>hNtq80b\03!H6l)rOhrb[h0lg*#L:=K4,U''o([ ,IMmrMfT%D;in0POMW6\1,'fdCir+u"=WU.tjMk&aFVNq7\Wu9eAmLed)4k3(k#o-,S**r" H(8O#ECs1LA)S2:BUUi;UZkrWRA=QN?D"+[)P3e*l8lY>6^.ep26Pu.r\q(IgD7RrQ:C^.P ANi71k-'k8VfTujppLaDL8PV]C/t4q7Q1.hYk7Z*$5-sn6@mY_spu-)8pOM?OCrta0+%:o% ^u7bk#)s3R76Os$>$(>ouYdoZ4T"TRC"!A.f'=,3LKg0X+TJ^?N(%'b!S+.O'p:gOJpJl">C 5ZT@'5cR-F70m+A(SE<2J;((O%["4&iM8>cd+l?tU!>1,^tB>dfZtGfKP)JS6 &;cU,=Io\@EehI2Q#I^7/3Qq@\ckYYtWc)5n#9h)9Osp39VA-W##RSiB-4[1e)`?)5CWn4G T>T`teOmQiqJjdFLE3j91#FEY4A[p-9c-"!?SG6jP-0?:e-K^l52q)em+-$F=sEB ]9gD.??r;NF]o5tL5<-#(Vq]5lCiJJ6f`J%EQBfO]In`bI]lch?W\g!@]Y idZW3eUnH=aHENrc[CbQ.L>Uc8pd_m=hpUOd12ec!6Arr-:5rIAi6"2NOs"CPIJJa c\L^4XL;$dlU2"$RC8\5NcDS2#cf^)b*nHOaK^7>Pq1+N2on'B37oKnefH%"g5q!t8UsZ&U W[f[h*Q9Qc?bhDrWDruYbkH][e&7*%_d7"h&QP4'/[]\,L5NPSF4E*cP\finYlS?\CN^()6 [e9[27oKKSsAB]=c1hM-cRBpL>c+1#:B,om#o6ti-=kbuMI.a(Pk'55*mm$!k!MK$dm2,o7 E![*82FN(;%O*`0kkua%1mXETRU8YNOQ7V)E,ZCMG>IJj6)aGlV:7Pu;JM1Z*(3W,eXF*Nl MY:qFf)Cog3G+lo/cNeH?q0Z$q D(gOP:o'Tr1q3Nu$4PuTKNc!'ek<%k^l_&;R"u-0MK,G[GU\&Gdde[$>krh8.FUjtlHDa^, h+Ohl?F/%ALr`2`$a979&_K/e@dKYXZZ_q`gA=BVm9R32G5gUX];KZ:^!F<7T(1\7^O>QVq n@:S"lObUJFMD+_tY:7'#Z3?$,RNjK`MZ>4I;<'ITOa=Il6?#kEQG7883g`3]7)%VAit%O7c, c8FIWMmMnOR*\*'JMMV>UK)kBK!>$%J7j&D;Ql-FP!`16GO=LCZ0*;bA"%P+r+ncsc`#8Zf 'qk3$9%sKq9*G[Y"].tuE)Qq%?NnecH(i.mJKc/Oef2Kb"(D`\@2]_de.@07#S;[q0S]q\M [9rO#uHZhE0CTiT*`l>$"4#L!O<,aNZ.u:#V`RmE4$(8^C/E+$a@Y[&BP>Wb7,$/%8b:YOO FZCf+$*e%M7e4nEUQ\m1,6H%oC1`@*ApC\dUj&)kaVG0a7q-ZjVDA).:MgOV\V7)%k7@&eQ K'nLG5L/J=1!'2^P!OYINs2\Y^C'G3hL;+hTX:DApg&qQ\a5[=rK?P&?.&@#^\O_5HWAJYq o(GThE;0s+AIi!*W(X[pR&Vh4NM]!+`),ZG4EK_9&T,,8M$UBLd5b\EZWuCN1)\KOu;7dc% ^DioQ6*APk\;:HIk\-&Fb$ihq%;<]-AlQ6`-+&VDIOn0["pE.fc+;+o$n d?R<%3Ar@$pZff1)gqU*>MHs'd:$u0q0B7Td'#t,>ppYY@-;n>#P$o]cB.!1b-PCVN;L9cHIj^D1-dmVqP"6Pmr!]:#%%r"t5^XI-bQq V/%q.%>;Q2-dX"+gd.oNK"JCk@j;d.%2H*m>P@HMWB/\4[2\UBnJBe\APRPA.) 0:EiF+lT;O#YUP34"r3':CjZRlV4T3`DS1PG:1FV`N;53T0ZLo2RXjnN6?[44D54'?N@8b< 6Nb4]BTgPLD\$e-nV5(kB1.+br7Fm67lF5?%/S!PTrNE-URGU6PMIH<'*H(5=:Z$6e"IkJW'uPp)(T^%tTL)<*;Y3>=K<67T1ri;>b=r\l)&-$f!5K,pedsSO:*@Cb6'Mdd"rT\e&](1OFSASPGSdt"T+d"*_Pjt62L\e'3Pka=Z) 7C?/*V!Vd`!Zl.h4##J_3[EDg?cWkVA>h.A1("Za.[WV] '>Tre^YJ4:n#7%J_$;dE&[JO65l;SZ`X8to);rF:Os+Aa+(Z'2AN!=qa)kaPE!N$33=WOd#Bi3JrQBQ$kQYG$GC(\`0!2]nI%r2daCGHK;QFCY\[;/%E"' /iAemiO)c5L*-#*sUQQ@Wn]Kl,52,SENoG3^PWmjPX7DV"DtQM5=Kol(]DE&'s(5mRqJRrK (-.H$+71:o&\)fcRp/+VG8P1=TYh/a4N0:+UN2`WP#5;/3"0Jb.52b>cK96D%H1/fb\'/_S 04Z!g@1kC'uGAB%EB/JRu2cFX=QZmZ&H$B"0GS=.;dt'RsO&C1a;R_j8Q^;HW/,sPRTmB&UW-IHl'hMpWGa")*r?`I/pfDoL42X97?G&ITPQYQf1?>:IR+qL+//N`2=HCA79*>nBN92W:(WR@3l?RMOa!^pj[oW!Zp>C0$srRC A[:Vjk65S+431+M7eW^MC9oSN5;m);?3SecQeHQs#E?;&gO*[q;&)T37q]RAXZjkAXT,Du' WVH4-C7&"n4^T[IQpJJ&I/X:2mqEAEq2@@@W!)0,L/ESqeQW1BD5"5jB-Cc46Oj1c%XFqKmCSIMhsF:[O*gP@I.MB"1J=ZMD\h"fVu?LGSI tl)jnBu]8O1[hi'X0N16&J+XRt5_252[)BmZP39Rm*jguAq]0!/4+]97&X1(1.]N`FhS'/I eQlj0<+#tqk6+@Y[mueP9^0BX3R3fSZkJ#^AX5V&7_($N-g`0q\]NI7Z=ZsRR6brBu*$FGR \R32+A\n1N_H\>&S0=.@a:A:*$(5cM3NO*ka9;>)St&;\['L$c$u+S7T^QXe 2$_Tir&%I(RRl^WV#BbLZ#"JJ8V\XpmXUU3\2]^l<@q3MTY!UY8)\RRa/Ohk_=aV#9t`=%B +bs.u/p%_?AOg2X#lAZ-U_W*4i$SJA)lO/ZD0dN'^7F*jmu!jfEdEeQl+T@>V)[e(,OHI@B-GRbu]Mj4>4(Y'ToqRfD!O!S@:&fA257*Jpt%)Anh` Jg$2[(baRs(`<>3&:op'6')TX()[,G&YYEC<7eI)^U%4`ZTZ@a'^ngZ7C2sAh&Y&b+PICtT @:L6do1ruqcgSb?W5^IhcRr>!R`%Dcenj([sNP]RsX)D=:`P9\GKRgrYfQ!\)2OD\Snnu!V E7(WZFIs+$7$nS%%G4[H%l6^g7-(SkJ/$:ZWWq+Vj2]iR/Se:VQg<^KtKd*c'o0Drt_>%Hg h/k>H>l8\gi0kZe_`OJEkhoF;ik_L*s"I[fS.TBVbM*$F;N(&>b0NZ-ii#CN/_*kUa0^WI> ;)Z[MUgoKesYO)1lm6%Bei2d/gJaOM)mQ?!e?L&R#j9%N.aPQ[[=jb2R6gPl-lnMBUJAq`k fBjXnm8i(b6$/(.dUd[u/9GDjq@kP63\q,a=Q]h-^\TD@B>HU ,R];s16Q=8MkuXM&,G4_=N"gXeT,f"]-#T>sUs;:rY4fO*1]hqLZZa:H+C%)E$q5Mc9fmsr "RYaq2e==r5.!,t7[%Z#j*i>0KtUKJt_F>b3NLd^31hBS,>de&oR7jE@)6D,#3L-*HD$)NoQTq.i-ra@r*f!=^;Q1AAFTC'HAtLHY7YP$NgiX5Fp/7oNGN1T1Ia,-/+WQk.b3,Y3bj$9pXCN[mR)5(FuZcJT Ti=pfq,Oe^3c4j8#5#;u<5AA?c[3Fq7ZXf'ISW?/EnW\_uq$I%EP]Mp^YYq>FXWB><'gpNd j@GIK[(q>GdBTAT8?!'i4P#6I/p1_0^T0N8hm6*PGPa#XIilu\_/q.;o3,r"'_6]g(b&4>t %4VC.;/4U@B0go(V`N`BJ(.IbX@i@fKZtC>tZ,Ci,8$U9f*_6n8K-Ej,1kd2GZ:o"O(*iA3 E>f)Xr-lKqZj_)>Ufl26&5qT&0$Ei#__On!1rhDrZUED#SHJrbCQ(RdYrPRCSEi:4o@3.k: G_A35>X0?#=$SB'b*K+oMlPo;&"-h8("\t-UF5S=K+2P`q[P'S"eQ!:K/&,6>d0?3L2E'Ps n\PeTH"==B1WO?Wkr;V/KR>26D(-=-_<_?s!%:I:?;:/Ri?$@7B]\OE*JYD^N&$f--pX<2M&.aLZX\m'j^QniH\b=V=/]e2mr=+?[)2?J7"ZYs+0) f-4b`:-=F%hR,\0"LLM*L,DorT[O$lA\BZaeA%:YcNT;E_`Xg_T22@CJq,UFYRj.'KFBlAB A"$\+Y%O507i;Fh*2I!:T4f,AK;*%*2MIr?\k\<_Bt@oKV5Rc-I&j_qc:jN%)P!V4d+QSjga`*[d1SDS']eLQ"+4e=`=3K!Pr`f-P+&`4?""j%E %.Ia)W/L,Kb%S[jB7=][&2gNod4l3cI4m5Zs(VWG4:#V7=f3QU<1f?OUGJA(gQ]Vf1=64g0 (bGFd?4i-5.(augMi-]R-\r`>Rr%p$pggJ#2o+oKFi/5#GI+]+XhVhn>6jc\5WdV\EU9=,PC;.`Jp&(;g]3(kJ&>N*spRL+ HmQTo_LVkd;4:FD[$ME]D%b`#f1.g).Z%l@tu41':d0+@Hcn&:tT`#aC)g1*h^tM&&J"W?[ Q/Q:V]\.3rGsD\7UeSJ-9/-KO\VPQ]>mad:O,?Tb36"[lrAH!"p?l!Gth(u`XuAM$Y;_\9o NEM[r+04j]T1+#]D)OZF9jtWg%o+kjTEA/c[]WF+J\nK>KTf#Q<]/R%L>"a.K2eM..)<5g` bObif`rOmYF/8S+UZFQ"FR>Y5Z?]4@k'TW@jd1%OI8@EL5A0WgTG.T]:c\nKBJfZ0_sDa\i N=hgfVf9O.Z#Es-BdT#'r)I@NDY!\7VLm*UXY$YdQ0Zc&l@a._M!;t!RF'rEI^\2D)G6Kdn Nfd2l;G)FGM(=2?P'i;DeVM<$`hfC*cBKFXEk_Wf^3EEekZ#S0a2X#U!isJl?E,FU]J1%%1 TRX:289eb[6fCF*VpFerB'TXYQd]l.O7iji+tk?Mf!GHTKY\qH3U(.'5O@($9T=>gh#X=]+ 0egA `NS#(B5F]H\$jlMg=s'A2hU$tD/H$+>SbU?6T@VSmHqRAS!`#9l\i=a,3ZP[W8O2rf5gUoc /#iQ)aiPr%7/cS3lbLl*YZ9$%gM[_He!I]A%rGGggIfcYk>2rpV,8AqVSpKp7C=1^_3CC8p gqqE%V5A:UU5\\,Cqe%M$=B57(a0]`k(1'#PPn%7)s#*ha8i_siEm@Q6pgnME;FnDb6mS6: ^me3&_Qb8EeIB,pHM29-Q_*FjJ?0Z,#^N8b1"7VL23EYMm$3:eG,S8]?5nAYnLmQQBa#!iA P#8(Gk4UAld,;SnKbORSH8AZ/hA=St1)4rbpON&E_:i_dUIST&Gl(#bLF:mP+"D>@WpOd.4 .W\3t)Ymf"oJGFOo6fF+e"KG,G)no[#%_L/PGMktPg\]]:l8,XT_.r0e.YbWc&EC9F@N1U7 F5(o;:20J5iWnQ`d6r2l)eTY[apo)?#,Yd,6hPre_:=;Cd!W[FuICo)^f2>US1<#39:uDC6 ;D"WO2B,-JKJ@D!cYY[s$okgO"[9NNlG'-t'b2KA_(B\dM2H^@.s]`g]m]"&qTu:#?[AI8p 1>^3A`>hqSF5;u1YZ[tRp_N5TT;^l)lBpCH6<7aLTg+iP1m>QttINEWJFC&%-9j4oC$KqOM a_N6@SFruuOY#ibkB.rAt+Ct_l4(W]FR-+*HSMAL.#.U!7kT'T-.Su,G3]A/F*/SK8gNd\= a%bh>5H/bmWRQ6p7iXi(2V^dNf5;[:)'PXugtS+IHR!oVf1WMW?Is;e[FssaEpSS/GT-bC] a[9o?\Vt\0VBM:I\GP)?Mi@5Dg-s*SfQ_n5jU0X`VdJW5KS0m.=UaZI)+TOb^$kuk)+$`_B +I=qCElUI4(`t=E=oIX>fG&PS_8E`t8,17gF#d0#`;"(Aj_LmdX%+a1hj*r%+9+4u^C!nU< 134H5GOGKgPj!uUrcMt/'VFcQ8[2@(Id*5jPO+W5&JAfo-^5;m$Ls-.&LZ6,NV2t-_&`/G= KR@M%#FoLrN1mK^SkIekoKGmju$UM-M<&HI2^d;mnLjFj2G!L+Z1m:Qh`!O5D$FIn#"Xm?) j%m&s%`%-9Mg_iD2)8WZuNsL)fg]kQA*l7Ij_ ?;!u'Ht=<@ZmC5#FKOdW@!8pE&R<-6?FWmKIOcc.`.E#6DQ-Kd1(j:>D,BiL8bJG.Y"pKGr RoB\!!`o&8qYa/%?7C2s`NAKK6qt3l@1D'@:e&n2nNTKIYE\#(SE/;kZ1X6FmRm6mP.2",2 =oUUjDp`,nP]9M%5MBnD]g\Vlcle!NPY9Z6!fX8lmbTG'?0;Rs_E\_3$o`'hRT6q)*$L6sX qZqPUL:TsIor,h) Z`;`d4bQ@ijHc^ap,@e-!kO[>*md[p1Z2&q3*)$c&RE5d[l)^d!Z\X35S cbCJ3\'Wo2.]$$bXLU__ej;s!4Bnh!T6);<4]YR8E_9=V"#1.RLCpD2p`lrPFb_4']P@?IA HA>mB"h8B&3&a1Z/55]]blfTB'[P#Dd*3ibWB-9!d!5k$af"J\\")*gl[sru3Wg?a9uK-:fI+a\JXI6S7K('mOCdh*(k/D`2("d:'p`2f)84C2VcG]%[883GK_`o>[0C"oJLGAecm-i[lVI0P`QVae'O]95?Vi 7Q6U/UQC1M\ql>c-!h:l4,&;:S(="KJg;%lFcsb3ZaiMJ\(RC!9i6<5AW//@A,F:< Q(%N;uG$^hV&@7o_EEbFM5J[8fiGF,+^^60N!;=EMb=>0J9sbWT32Y[E/EC^-_0ecfI4'k, Z>@a')\-s1JE&7'sBdoLS=eqDORNG$h-C=]4sOVhs>?os-oD2&mW#N1#213-*Bi_>Xn'.i' oI,A"9hUcl,f55b6Grl6:3J.c^')^c?YV#uJAV1g5:Sd,KXasS#J<%^b5`ULfnkURF.U&4djYk" Bi.$=h1;_0Lg]ICkHCId"H"-Mm#sE,uC[W>"!+%eYUXO`)-'9"jf*7]/).,4DC>Ql R]HOj%4_U@8XdaKO7)D]b>0jJgbdi(&,N0[^C1`q65L'TR<(gmGR6O!fX"B].9cpl.%3o)Y U>s1=+:"(mM5L\to?$MIGV*[dc6DWO""DDK'732dMR0Ie3NHIcl?/a:p[=mIC#8M78:rZJj :K6FP??8aBaPL5+\DF6"eP5%'AaPL3B*R@8^j(,0d!XC"o$u:^e]m`oaQPoqjkk4ThhCj_Q 2-K[E!Oa7LA5#OF%47D\AW7hk;Q%/Tb&X$Bmb7"4 _YSeTp*7H!p=TW[Mb;@8(('X4Pe5L8ZbVc'70uP[S]dX&S-\rKl/[)W@P4QV_N#a`gk+NT' RPiWY<%BINsY@fl]>=V`:9$&=7+0c;S[iGKJlG\7+$'B-qM=bDg_%@gnhRc<_)ir[r(#V0' g1>3Qe14U\)4uKKK%,,SXd+c%`K'bY(?J;8<]F>QYjfIM(XkOUUgC?L')=,>VhHN`BA4>=, 27;1^7b`X+a;4kQTjNr[Hf0)iEe-ThVbu#j$mF9q;,uPB1;"H;IbCd;`*o[2,]!oc"t26[$2A)O>m!&Q"odP9p!/9l3eUUEk&+^A?=e#?lL(B8Ao;;EIFq.<5dQ0 umfmN`U]#pbbrkE2<,Ls`p2KJ2&jT\CBg#qg5'?$_kjPS]"\_`;skSFBc0*Q#F>_X)9?;C:bQO3/Z$Lk;'#PJ?+n8SWQ7VMN,kjK)I#8(q\&b.Rh#3]-@h >@IS.W:(MOFEGYes/1m1cN.;BpP4Xf,X>?Tn=I3LHn-b2O34'Sh&0$!sf_/%jgNH-Fs1o\7 VUYQF(\#Cm?Cn\M+c`VQ"=60(S0YQ]Pm4QkX;e177*nnn,.J;R1=1N:Nl*lUna(?FP!Q\FZ l4\sRGi&2n=553"V3K1I>)mm6:=_"9DIC`O%=k/1B37dNU`Ci;l2@Ge_.GO1qpm$CDYY01Y -:@-"sZeiuDrm(0a;4lkUjINk[7auQm9m($]g^_qQB3;je;!jS'D4b)#[T-RMh=^KuUGh"a -oPZ;3!=20".2Z'5Y6\Q3Wu*aK8<&&(1(SG?tL0`>pelTT5F;RDXP+g>per_(@Etag"j+,, hP$Y5\KOAb_(F4mnWkh+L#eiHGL_A#;i[TK\(.6qerB^eF5^rDg?9`GfuEQkJ)@_&@K^'._ p:L#FKdUB8Q+bMXYA)KNhgXhi7EoNqi>T-q]cUn8/>"3UnbdnL'Rk5F$LaQ,9J?"o(_k:QO a+/TI:EL?LOIY9*5k*-q:Mq?!PPa.''+,:hKV!Zs8q=!r&[BnH[0Ej)G5L+A#>rPYoVEo3t hpT8K>9nl1k!8fSIg<2olVL(6Z`HZ6b2lUkYZu_j$H\X_)^U]e0E^hTilc(aPo&0cq1kKp; lf.(h:,m>Y%eNd^S:(t84E>P!8aKg)a(rM5f1^"Yb2aX>FU(]dD6rmNcuh"fD#;`';gA[3('H?iBarZA0iY4'rNn,SggoKL0*D\7@K<%t["fcdVb3K,'<`UCk#cFu(5 #80cP#,`YSCPY#FAGuV4T09samdhfXdpCNiiB2cA%p3f/u:hWfh,o2J1Uf(o+\n*dj:T.6- Z_;]FdX@=i`NQ>TD`qNt7DZ"lFC:V">G*_G`U>8@.(6;+adqX"D]fro*X`0fSD1`E*Bs ua_pKO3Nj*ePsms#g9(Dh_Eic7$6SnB^Ib33nm4T:[KN939nFoB!dF'YkcR*)PZfdFo(o(i 5jT4ag[c7t1oAjIfjlh(('IilG?p[nJMO8K.]^lS[.!Pn1U&I$!IC_I&iOG!?!#k)!R$UYG @1CM)slo>ToE==uB6kLD5'#bG.<>3>iEN1JmArr`%7T#so)TNH&FW3i5b^1ANdL:[Ma7:d8 ,=mt[PpFJ77%GXEL4H9:R,\0".a%=hYq=-sm'A@gP6AO/$mOb;Hr6Vt-Q'h$H673+hEoPGaCdT!=n9@B'D/POWXh*"J3'^ \4UO%-Y++e$:sI8na>*b/KAW=UdF_ofUe[]VQf*QOUO(Ih%4;_-_dr\ksD9t%ujoEC^Qe.eoH=#4JnU99 gmIbs9Qi7/7%"kg6162V\&VXXQ?6+d[(hP(LicpJ4MrNC7.uiR+ju&#)j7/?i&-cH4P@V3f E"r;ibh>/aXUM-)[Q)*Z57\-C?qJN"+N.]6,0 '_0,Lb92b0"J0$])K[Qm$e4(Z0_??dC&@GDS/+Lg?.BWmX)+u]C)0.mC_nWhYk-,)t*mDn6 @E$0FqbD_EJfa?Q7")glEW#nbfR:bAs,f29bZ^a$%]=r9lr!oN\'-5+$sW!b2Z"&W>65rHD ]'p-^']2A%8Yi("W:R3g^QAg$;0(k*Qbics<6n4OV:@6A1dV(&QG'dhU/) -bM3/E'6cdpq,=Yeh*YELo$.5V,$(RD1&nm\)\NM=%5C0cMstMM 1N$_tfp+MYjPZNVKYe2gBH[VJjVjolM9C2#43>=31e2_8*Vo&GLELgNVc`30g%dkXV#d4<$ @kr6%7+Yr"?=;T3eg#86g(Q_&4_EDVo2=g6L[06$+W&n\iiPt"WX=;IZ^;^Xr"q.IAKnG5L R\U950)5VGt)!NGts.dY0\Q[-8se\p[@h"[&__rh6.WU^DiA?iqj4VBtMrR&Ya?).AI8dRp W4C:tpo>&OED8=&"/<-4TfN3!bA\bfVro.0%MU1"Aa_EadWSFPDF"VU\C CR0+2Tr,TY-lrp(N$Xk9>'3O",=HIIdp`KaPkoIUi\Puoj66CHS9g8^),)f#!i+Q?":0__4 X)Q:t?fp-uKWl&3,LOJFK."$$c4sjLdb[-:UOk'LPPk$A#N'UP*Cs!gmf=\+,7Cp*"oFNt> bo7>Z"OrIOGo(1Op^"EAlB`W;l&N6"SMi>t"4)!VZgnYL62"iFsr^d="4qiTqB1l&=77S*H JPB)>:atYSuOX]7So"gfRnV0'_S@sY5#$oG5IkaEt67IZ?8"KLN3M0]GlIBeXlD'G#:'7=cY^R#rQ f;eXc).2oT"Y45YHa+ds7a38LYt_QiT&cb]B8$/h_gC^"d+;0[d_i`-5?nK'-uppEO._-@R Or]O2j"]-'[L_&t"9tpEmrT)muC^&18_RN)Djuglri2,oSpScKGh`dto"am% $.5ghJf#Z2`)saE@_.0-Z1^hj=^J.>m'>WW?#-PIdMkT%rIt>0p"2VB1nhC4K?#'nplhK5Bj0%R+].Lniq-2,*Y< SEG:%cFaX5iC3VkCb1O3r8\6874WW=U9es54k%JT*d^_3cb+4J=5Z??"4(@ZY@4=0%_f"D\ VOCh[@.NJYA=./8i;$AXQ-g>[)U!=XOJeK_u#&TD*Xbd8,< #L6J#q]iA9kt"'I0_E<"eh:s@"oSn6jp!##*t)Z[qbXi1_9b7+p$%<0i,YgT11[LE5*1gpIon@]>!gnLrb4JAb`!,gnV90c_#!)\s^sk0AAjY(7AVIhshV(K#&h_"8$&P3ER3kjaI/JUe1PTWtYol0B2ODQOfE Yj1>Sl\dP;M_=?H6L70pm#KHZcI3`U;I0QfmLItkZ,n!RjW+O^mZ-f7dG5hJi;E$8n';.+O mO3pnF3<<$ni(u_!i2'r?)+0ne)6!:Eq"Q$M'62+`B.[O#J5_cL\51o^X@RY>$4ak4Kk<&* ANV+b1"f%N$>NGV]_JC^=n,iY$r-NumHcNqtEbtQWE;>Z>-L7-Kud['&.8B^j!uf(.o5"@6-:71[k&t3s)MHtZ=>H V@4`k2&-3gj0FKK'XY)0\!HP_'ZF;IU+<1FK+!LLb!=Ti3M$*6+0Q90/P6EYH&0h5**lBid ;]RUa+Yki"134ie62DqMdMegl(*NP_&=j.a5;Y/Y/jY@-TO.r1;$[h6#Z-$gi@Y>NTG-7V) W=3qJ[?-_75PZJ2cFrTTu%T(&=6h6+HT#IZ]$8n]%qFl2;uspJH?cUc3\IG%?TI.PH?leYr ]"o)aMOOU!aK;rsmME%g,M"NaNfV\-UJ^4`OC`Yua)=8/_KH"d*4+&S4/4nNPm>#f3AF5Z\ W(1I*ZT5Z@bLF:>'uQ4%(`'JpY#@)N.giBf?V6:;k6@(6K+o01Y\i6c6T&U-V74[_#M6ud# _+Tr7:K,CkK74SKWi7864Pt!KqZ,MnF;5$J&-L5ZP7r'^c_"8HUYd@9<)tCO2["qu&lkg>` 8TE!HOk!%hD&ne9*\sK_[&HZ[koWdk92Y:%k,RqU]-&rL+7]LVdL.34btTP&+]9I,o\C\?i ?Bf$,4t+DPj9P!5pK8e%'hu(_#tS4c4H6@&:o3*AEA#TT(P/ 6E1QPVsPq81R=EQ2tZHNp>0H.7U"K,BJ_2%5:`!QW)q,=%ZOL.1'3l9 b(a4JNJ\tS)d9SW[?$4h+U5Ul/l8#&N_Vj6/F)t[\m9_.V=@roa&' ?ra/g_p10"k4u5ZmTJWhVU-9#h1YC[UEgu2E[\C$UBh=TNsgkO[,4t5k^OY/hS%bW!*kS'L ]YQ!5nt?D.bc7CFV4\+Mn=@JS[5n7.`Q/PXRtUc##Ad(;\''i92)d=)KipDImQ!T[cLGB,P mb=S-AupAGmUWCL"n)M$sQ;$QVAT(;+tT29c$r+pK[8gfhM+n:,ca-;C,*4EDG,.:FB!aE]P$OrD7V@(Y&V4 PmM]EM@Eu,(_T>9Z;,Ym<5M5.'_5O3Pq.1TX;d4TppE=bf=b+l_0_jG&[HmceOP#]c$[jEq i[@q[8qt%;0,`F%S0r0bhFW_VggRFIj$Q_iQ#FF!$TmH=P'm0Pq3S76B:`.JT[B3W+dlNoi d_/Jg%pm.458WarY!Q>^/86=?TnK5a7rV).AMT3),)$;2$u/dOB4c_8[H\FqOEi@G#:&\89 \]U(e`R?hO_43-g;Q!Z8a+#.%bG!NHiA`%SpZL3RWkWKJ3O>Rs-[)r[#'_>+$)=+D&DAYWE K!9+C[9k8LdA@TU;\B,1gbR]6eAWt/oUL.U)1`K:*CR/t#QFDmLq%'-8CfZ1L\G5!uX9tb5 Bt4OaR13l`&WifK)'HKmiqE)UYLiM`i"VZ#Nh_Qun@r[j,p]OdPs/[ksq&R@ Se0Tdj,,FB:b$NseVL&fA)XRs.Y%='JC#?^p3.FuO-*[qD6*D,,;!G;Sg&i5Q;U3Z'!`&7L ,d2#n2sNLr.lGkq0-2%#5 =f;u"'Z#;>cqkg8qBD:kK=F:JHC_%0@NNAZ-Mh/N\ui"/Z)]'k$N]jV@?_^^=qh[QA.?i2B818%0Tn)+pm8)a0A:lqW(P[9HS;A)3@E8\$iO\TphbJJ\n`Z43InQ+#qBgStL pGR\&]Q@$-HH#8m+s$kTFQZRK;,Kh1qW)qg3k]A8l:hjJK1RCYo&[l;%Kh3rVkR_/@% (JAm2]>-N0^j3c3\]&^eadjANSZBPea#T:1EmlF+>M#2Z?K? 6/RL`tUrHE"-6JYlUdb'[8AkI\ghGKVE;JfL&S>eL%)6NmKS)Q>HjqO,S*c-7gU)Ze\pgnE !jiQaRI13P&diRSn*A$9/1Y<;W^ioD$:8su&pd!FNpRc2W,&/]sL"sKKMTUUc4OqbEmcb/t =5i9lGA'VaMJ3+166-^"VmBSeoe9`@gSOGTj3XYa;ZIl^o3Aqf6]E`e3epDu!U`LH4\d,j( f6`Kj%N=='A_9(Y[XF"b8pD3R^8ZI$9,i*Y*GN"]ToR:,i%>8d]ref?5Ih`$\QbQXS\.ofZ jo@!\t-sSgSborfF$BFQA(=1qnq7OXh9)C>JU(O>L$MYe%L$_?i/sB]AqfGi+%,u^A\G[IL N_*otS-5F?-U"49_4E#N?^4S3AAr4;5Q$(#qJ3DHn9S]HP.6q4:aRT%l'EK0AC\D'U]qaB;SD;"rCP/ 3XsNW\#6H.s*c&lC+1hjrDLT@goO8\po)%Qh-cOpk_]pjJq45J7Wd\d0CAr+]Bh?+\j@dJX $o%rlt)h93D0hn"AZ%=QcF4kAn!qj/>]lFlAnP^4GWV?)eJ_Lb(HY]D8LJ7CXDU!X-n7O]" /7&(>r_3"*%17f>&q$_jD-'Cj\Eg\ba;(Iu+AeN4M^1T0h:$*dDo-hh5A^>#\l3.ZO7A/&l P_q=FR7jGUWYF0H5,D8UT,@+noG4i?Y#jq4)YK!(A$]8[jqGWD]kb(2/_:qqcJNcT?'p>pb 8@a7@c)+ulimt(Ktu[:R#EpN)2lJ*YEulh7k'YFA@!.YcV]eS\8EN:-_r2AE8MXP9-;!cMUF+,o;+PO:7?PD;92a!C02&VS\M6bK*5aO*o/+oOc #Z:k?(&`As#EhqV!C*;o>L5`:NPUo5>UnT"$ob*,n!(8VGW_'5*)6Qq,-cq+\,EeM&o?ZZ@ o,LdrL^69iJG'5>b"*3C%CT[7&PEc';:5<`Sfu:8\5IodEi_f8q*--L@7pI3PR?$Bl7G?srsj*=s TV"B-YB?B(KQtF`D3L_AN='sQ=]l8A!Z8&L2!&f\]/QYB%cQo_g,pZm-JuOB-'&+]n.1ru]kir]g/O!+5@" J.N1m5ZeU!+B/SsE$bcSp`0KFC_MC3;@,Wk"uJZ&.2_#o$c1I[#DPKQ")hKZ4\/?A+]KnEO J3OX\6fVM(sNISWV=-JDYp-G4,6Z+*4nMV+G54+&V9?o6thJji`&L+OWl/@\=XFDKN!b*<[ bq3W>6\b=c8D[01DhB3!94q)SqX[7TdtSUI8mW;78=$pt6W3FE*>'c8Q,]eeQ)1HP4`o50( bC+CkV-O7EuC#B%70>f&:%) =9&U1';RDA)i\Es?+EeS)i0qi7D(\De]9a0$>t`k$8;Y_V.[(Sjb[cPc-76Iapfr%0iO=Vc=7kU-WK7`L-X*(3T3'_OeeS4`d5rcN+n"iY Vq6Wg7*'(DGAft2s1>-SF`.8BLN<%oJAB1;19J&5f+$51h2B)5W)N8PG="-O&]J2Q)f$%#0lS1K!-m7hlN/,7ro\;?Y12eMN mDA<<`hoi"FR<@b*2@ob)-YcDnX22PaV3*P]ZXHf&oW0J/iX&U=FP`E/D&N2%O4]8G?Nk3b 5m9WdBVlR6!Y#kJ5?u,=;(unkFen*\^#$AiKFu=)'j)YLX>T4A!g\]etUXH-*anEcJ)PREG]R;\$oE3hCo^s$sE8@B6Or[gj>$$D Cs&B%*2t9OE`TMpf/6LO>C,,GBR(*gD'b-Fq#U456o/u[5XEC??GVegC'ctK5`]%2^7:cQ1 ;SK55S\KmsT,nqnH5+r3q6[g]p)p%rR6Mi-YucDe9>tNg8)2aF NJZM(kZ;r!fR3s?B]U\FEQpnu=V\WikXd3E!6Ar+$0'2lCQnnADbaFMJAh:MR"?:I_Z-,(< gu09[IWE]-gbo=m"X0ZgH-_WT6qM4r,kMM3d#p:`8j*]ZAJCXDJacu2h`K2c]B(h4*:">YcVJ8WX9%&$WZDXID5\4,n&&E*+B0LoN>p]IB;O@&sNajID9p&$bo=mmeniMi+l[XmaImcS7PVN)P_M5@+*:*p79M ^%*e,aa+IEX29[!N_WcOL"P<&en:m`NhL$1O&,%H=/mjWIQ3)f8aDpkYBBi\fR"EEZfCh0O 29s=7]>2[@Ku1BqgWe$O)XMmf=H0Tk/Q+OBXq2'^N\Q9F$'t_n4`mTK*I.ZRR#M>IH'#knR s(m8C\g\S$IcC>rD5d"_=0JCcXDG(Q3d2$QNq),W\_ O(/BTt?hdlbJj4tcIOFIVJ%,)52f&pe?h=*Ndk&ESLRE3RqYutUrkI4f5RTCO:cnrd1P,uoZ^_1a 9Em;J3!ms7DSdg5lsi7lURdM8;L/E1pU4L=GN`??aU:Z2 $=dS*#ZSO)@9&7\ATCF>TL>u+"Cc%[?MglN$8O"D'n1M[F?K[lm9'o?T'-:_Mfm0RWCACAN "?U6G+m.=NCQr4pE\m"6a3H(dS?3h_s5-2\U-t9K!AiLT$)eK=F@)0Kk).A.V!j"F+I1cqo J'R7$k?3LiB'!k&WDD1i0cL0K5=1e'l<7lVub3(&HhRt\eULW$cqO_GW3/5A1+:4lY8#':s 'i1kpu,Iu!h&tpg:**,*7="F&hQ.*srRe/Uf5f=pQ7C`(&Y\llt?TII\'bd4YHrdg(@RYQ\ 7A2bt0RA)<,P1lDasYD7gsAO,4Po:G6YQa0&S_%FETah] 16sda*`/&Mn0D6/A)sM4=e9=gjI0'I2VNc/qW=?U?`$5GSitmL+lGjaE,BALIc\N]\1Pb(d %n)e4@4%aMZNKgl4kkN4fdB"/n"=MqU`RP"@[^*AdR9aD:q9+?t7@5@g.rFI=mdC4c4#8R) &5gZQ].St1[QJuBVQ"7JG7U.RPC8kbu%>biJL%09:;!u.1rS=.O$R`_?@L?%=9oWCdGq`i" !9+1dC*!&\XYtHPpK@"Cd?mJ!R"i,5hbD`n6TJ_>N$T$SN5c[,bjM!n7^HhE&bR6j5&3bfs 82Prj_.-.qZkl$8a$HfJ6+k7^OH`&T;FMSL60uii]HG'B+gmuF$VVmA*%+'hdgL7I6BbhP> h&o:.lLoi_T^X[PV0iN0SUu-"7Te%a?Kk[hG*Y!c1j$s,Vqeej$RYCNaO^I0OQh$FLPJ(KL e`?F*P0a>so[u`Q[[Df^GdfCd`Y?`.[YV%.Xrt3ANEa:J=C,>YIq%%"gf4L1?(dS5+]U7#$ *5`?\AAlsHg:ON'Cm:^gfu=DN[/H,t[B(S"])jQt60m=ZX08:(ToIF(\*;2lGjSJkA)5o0*I#9[CWb^)fBH-u:+dJY4d %3cW]kCN8SdS,/=>^oXg,tHld!H;WRi$4[Pcb*tK#1uoXXE0*bIYZ?.K*LGC'.coD/d[oN@94e#$QAA"GfbV[@g^*$BgY^g,6!9*+F[7F]/]eW5rZ"9sRVbZVb#7gF-Ha\9='qV;$F.>E- 0tR^0ObI>=20#(URpE'7)N+jpP0>Q)BBotieX;M/O.geB,#<@;$Wa%+clKX_s*TN)(:G_ZQ 8PE:7JV9U_\o`n#R"6m:H*B6u?38HaH>trc'-uK,X-\k5Z":[FuSNP`$5uZlHYs<(+n/TtQ ;dK@Z?1h3KrE!;W=C*`Q#1+oQ%8>Vq:0r'=?@D'EM?&C@.nRk8L0-0]/`>/Bmp61dTo`jg( _bapo3OH0eWj=g`V*YEpJng]#3\1$m9sA(@,JY+UNfmnBJ.k)s"iJC_,cq/,q ;j01_a!?`?g4WJO`* ^5t"G3:G*o%h""TZQW]T@=e7?X#\:m$(g5+R&X[9?iar:nN`r\b:]7$AjuP$f9c DCK)`.M$buKbCr8:,lc5-!JSTg>4jD+CcrZE/'a&LK1`mS[@I[Zt-blKc"S0Q9AdH:LsH$> G-EM]%.(1=H;#m>V3eI%TR(X?lV]ghpCZk[ao7+pNj,!r-J`^b]R>1B s]ZLDX_.k]mD0BtHO4AI`DjLiii.72o[E>t*<+eo"boDW]^%""5C`83gIhF'Yqj?+cG066= :r,MqhWB9%4$G\7*q']2(/kJ]o_La&M>qd,iWBF]Q+*U7;N"U;1\!L`E]QnSQLH/B*fB9n@ F.I@0HI:m+m?WHl7h=g'opWFa8"%E)ocB7?@2[+^iK(]/p9YE^2!`jK3"dT7)S.IMj?IloQ 5tu5j@Tm0:$"0p/C&XeQ&=qinUL;BBMF>bAF',<^D:b'di>rZtN$f"[aPgEQ@:N\>IM[t,/ q_M\K&kYglnDkV*oYrqCJM6P?64_AhI6UG=Ik?%]K>-3"Ba#]KY!-%T"\_.^>o"\"UJ$U5. bV`/SmJ7=_9F!#0(-o0MdAt7.)moMi6NK*J:Flg:a/Z^.%*`cRRRq;%@m,= PAWH!BSlfm-kntUVK_Qp+cL,8`mq(AER:'M-^_hf>BnH[/BRYeWh [L`jCkCX6BZC]tcOl_DXYG&L!G6t(?@m0/K(3ZR0n=/HEUYZL,B3(-n]q\;]+BO;$M"!EB\ &47*fokEO!;Yb"?8DU2NhFf-8T=:K5`L.?RfFnR,A_\Br2"'fJc)CS4lTk1p]nk%\Ieq135 Ka@(sg*?DR11%cIJ)bndrC8hedQ'BST-)LSnX++*)QYEu,sILT#Fb[ruYmGAb0?GA>n;0M;G4mdCC.GJAKZ5YhF5B8 (jeDh!=VQ\"U\K6SeYKuc)_r_IL"JEG7u_c^N\@n`"6_dbQ?; pK4`I;3T,;GIi$*0]*Vk2O*[k]S!#T_]&p_-T^5-NUS*KO!(]"(IH4QW'!Vuh!D1^6t+lI# 9&/TVQ*I;ps*Yb^X2k,,mp2UroE[N+.eQN2#7"`,S!Z*6TGHu7*\:nl\!tQk^UgJ8njolo5.Dr &@R(LoYNOj/bZa296:?$5=C@u[1*QJ$^q228>T:d9e-G@Z,WAQj=EKSt>/:M-ZYfD]]&rs: B7R!V[-E!>0=\o-GLkOnQCp/+Xo#9'jrTDF&@qgYP`Ktp.OQi;2YreLT_ZDN1=+E1FN*Yem 66=I+.F@IDeLW*_"BS0S]BjrAWOkBSX5pML`A28EUU.m)&9'+L#KXPADR8%:ViG1#;7qf"5 %5ktjJO6$VkgWd)&sYt`dV4sB$X%q#F>h]gGFP#urdMWJeb]N)`FH2VCtA_sgK uW4nH*u=c"I[N=AKj#@6lYh$s+/$pnCT9](DDSC@r[n6?:Q$!aCOkp>fK]"Qd+Z6RJZl?lt CMb&6`@'Ro-6:CNV]:B#@oZg2-K;/]2tUuqq[!)P[:N(VgY?"XD,e9UPbuA.[[>Ob;Gc.S=`_Yq+!q[(.a2ZJ<,Ib S(u21<`ZRaYV1?9XHr%"'CS!%&*=T3_jatnN5&q[.ui1ZeYLEckIK"6I3VYhCsqAfe#Y?Zt 17KdM/5o8r\J6<]1GaPr2<8FR;@ie5Z*4:t2l)gccNS9ik=pQ$lq?e[:rU>n#c8Jhdi@'m* jmUUbn0NhuE&@T[e%a?(3u..CZuQ?A[0g/a34BNiuXYA2f-h6h.T2Z:1*>Ls>+EST.\^,(h i:s;0BGAZ5]?5K0oHJUTol$Qghc1ueFf@BtOi&CW=K&:(sO(MJDhA(dsFm-\)(kVH-MILh5 0oP'o[Q0<,\DBB1j;B"'P2o`L\3-.h:03]lR=8G/jggskRV#^*==oR\+LF;!@`\7O$Ua`I/ kmD; 0mW8f=HK:i-p.;7XC/]B9(-n/NML_XLeh$,c:<:Dq)jgg;/Cnf48Jb47[0.Elab#u#1'4T= NjmTgo#dWAbJ;:G/)W>9$',Ssb=Fo@A8g%O6gESC.M^NJE-Sc-?h1UC>cXU2f9OZgX2TFheb6d[b65.Q;X@eW*UHm`X^^WsNNkB*`\-rr_jF_p%#jO, 18[ae)*OOsQ@@*4)a.l%Rl@^ug=.p5ABpV'5%k$(/-j@,Cor]'[_ZOL20QBFmFAmc2Yu97p 5[M>0O,.k*&'Gt"u8QUN,4NRdp3bgF@5A+'&nFV_5K'lDWTWbf4se\gV\7(':'7TE+rT>eT .j*Z!0?b!u lK=_[aU%giBlsRo^G9b*)Oco99:!#C[-=mUS4\+0$a>mTYAXp/oo&a6$fmb\FdJPoA:j%p6 3_8CleX?#@C!F2l2eO,hSF_,\).I8%amA[JF6'"?\aMaSnWG:%!7;QJE`^F9'r#e\ZdIJ[7 u^r)*/?f4'r0E,%O(gQ1Cfu)cnKnZ@HKO;Y]lJ`+MLR01qF*)=LXYN,7E$UCH`X/Ur.,!?6BMtCtZ\E.("QO]:Ci,*=l(6_c7fR!.:oF h:[1oA4RriORe[bE\l.qRe!e[&XE!EOQ#CAsRm61!RpX]:*@pCYhh<27,*o9-rhOmh3'>j# N%,kGML^12t*^]NuimgDSeLiSrlA2GLiKC?DSjg_"\s]W^T!EBo`E?tH/Zi9l["cBk0.VAX =:5q8/3=)EC]?KZh"RI_c@sTq[=uF46H=1sQ-stk87*-,L34)]`,,[QlJ5OC>#)KUf_qhX2 Q`5JYk0Xg"$a5bT%dIUe_3)e_RC\8E?MGu;@kVs10SV^1*rd8Y%t$>AaSRL!J)l!?kD6chOn&H0$OSU`2R/%fpO?BaN=9O jro_/qhZk/.iH.'Y&2);u1BPo[,QWc8^g7n0:^M]K(;Rl9XW[iZ: BaH7"`R?f.;BHGhAi5N+$o<8_R:Q5!=):\++a2,@6>)q:+n1qR8%B$c!q%HB*f-9#uI(YTs P6$O<#JI&.O0tc$p*1K*t8`fPV&STrJLYE8QZH%$8LYjU?7h%*?P%rh+NKM3;WV?V"t#p\F8nBVNId1K4h&W,eJc*%S]#nfi3i=7'jd4Z-[1?%a ]9]<\ri6L@;6K=1rj&&FK@8Q"P8?5TgjD)?h;-r?=@c`VXjiZ$f_#!2J*p1W+Y,-Ra/r:DT K,?4r(f?2.MZDteCDfm;p1nn2]kN=Chp2c0:s?tSKL_%+>O6GCV"SB4S-too9 (%9LlT[j[JRi0MA%`&bqn$)["HMd0Br"<,P+k@\cXTr lYbO:iAZ>UlVEcMdhqXSt0-pINK="$sN-urRAJbgm;BIn_7rm0a*nt,hYTdeEb.[$ZbTgTg 8V(#BMcnlTu2?q!f'qhRl #uq.m!sR-Y"g\Rj;[a)NX;@Phd\0hcJ_h?>qB(:[/2Jb.62V_]EZ[jeO%W-CoF`fMe;#7__ b90G^[)%IY@7t39gbs',dL2nb[DeqM,$s.:2"G^@DX(,/Pepr-Ieede=aE>$5-=A:%\lAlr tkplVUXG;2B$0/?(0DkT<+`.ak.kd]6:=.oR0@M:.Lk2"sra6W@&U<0^'-J^,+K74ls<+G(LTAdd'"=Ha7tdg9.LMcg&()o7[LE+K68Ct!M k<78>uTmRSr3EoEGeMBp(dns?`:L$o6eY11tT^+M"@pN*`?%Yj0ducW+TF;rM44D)R[I63[ VAipQ#d_oce'DD6$4@u4)IT?EZ__(DWF8`'@?qNnJ><@%=Jchk58Ekt[IISRo4(fV80Oa7F oPp7d61Fe4dJ`(p.XFR&ee6s8Gp)# Vo(]_8\G2$m-h/0N57eZ.cQL;3IF%=`)mLeHgl]QD6QV8+5))R7ED`&W;Ytu.4EHM5#QQL4 `\FOPfo(92+pFd\F=`B]4F-OXbY=eJK>tjSh%NuZ-2R%Mu9(t1RFbe7j2&fD5MfqD%(1E@H 261p06@q-8GF'Fm#WRIe%4@KGKXDJ:(QW`]kSq@bLN>#*6&efEUJj+L;jXJ06%U*Xka/c"H ^D?kf=u\A[N@fr*E?`PpWllAd45jSq;gKel3KU>6\Fl- ^4OZ[$,@i/E[G[.%CZj)mr?oVj\!43%5V@$^<@G#p8G^X#1Ib`nk@!HK+!5o&.@>S)nM2e& b2CF73U>Y++A72[&,QHM_Jd7+o'DE04b))#l11 Qp>E(cLbO)*a><6FKj9*S0ptoRQC.-$/l_G;ftOcNs$V;"5?MQBrh?\S[Y5`cI3?90$@G[' C1&6^JPC`PVNn[t\1slu2lAVsVaE3Yagm(.K7pgiK^$m=YhBu1`W[3GA"&gb_r*^\V.;WJWah&-T W/3`JZDn,LcW.VatjKQW^(!u$c%7kqO<>Qc99Oi#9'G@_s_,Z;6F$)Y&55XT_9HlQ'coQGZe==k0J$ %s-F[kS/[l_4._&_,tcj=EuU.NB"s`1M7Yd-F7dYD6)"eH!Z@Ig)0qcIg!?*<,Fs+ZSW%A, !VH0`?[K>s\f7+]_+5:!\!e2ZG^#.\S,^0Dj:d)`do.iF+mGV%nXeML_3sX%!L=S7jhb7M_ ON,P609/\X.e<-TtEI\S3OoJ)B+/p$^rMGS4o*^PS@M]-_S5MH9]Cf7E.Gs`a!6sR-5MuU_ C5Y)KR/Fr%*VSp`>"E)rW1T\ncoH4>0^HVjs6SI%R=H37bm?W19oeI'3o[;6#La)\)tP>1: \6d+Q\/#C>:/>dl]2$P(n$X*VJ(SDRb+XpV;mble1&%B?3D_oqtsXQhnNXg-+K!t^p]Y+5r Y4Ue8T]FP"MYIMX#h&Bqa4:VACYam;Kp3Y7#@Bl,P5sX-7Tlpj[r#$X$%mc,ZgF9H,;:Sks O;S;9SR/SS$lN1[esf+ZRnL-eEamd$(jf=R!JRr9A[VJlfNjEDRq)o"q3/F5[lp4EfgrUj; +Op%g7,Mg+S/.P)+dt@Q@#1Wg[2_g_qX>Ko$9&%h9W[17Lk@>g:OcKh:fU$`4:60,SEPr`W *U*pA6],]t=I)Vq`:9iA-pS<4hDMILc1ep#/es^YSk(*WF(&LK]kS;qr>.?8(PX&[qTiMLDU_`_%`dW9S]P6RNIHWH k)^0qH\kj2PYT1NnidO9H@Jh3up)IL#&,_R3'1'c'Tul/tl]o7)0VTRR"qWo!K\jhLS@-^< \Cj,?c[OWp;o'(Dc0ej%5]`2NSDh`,oC!ao6:%[[Ym9]MQChQ-mG.O)rsVC(g'Ab_m3De\S Ib90lgd=7*&0\+)ZTC,*ohf4%NsNS[W=]/9sGd1Yup,[h)H39iXiqdp4_DR]he>B;t`@T>M WMiIIHn0EaP;#f&(h]I;?3U^XkqC$g&a(SU+s4J(QoFq43B<]oDjFUQWbInLN3g^%3pf:9d-.AJcL! _Z]BpNKGG(&KL4WofM"FBUhqBC:'dY!.i417A!)T>DEf/'8E XFo:m=rj7F#(OQ%?4nLc#o3Am';"6"jE0NLsog[\^0AgGIlt/;T%BU_Xk 8LfJG"QQ=7k>k_7CG$R%Df6:O[L$*[:\!??,?ME"AIUF8uiQ=$'B3Mp_aB0!,=S 7e8@BQ4T9H)rcVg*VfRkk\>DVJ-rlQ`')ZL8V"c\rNtoCDsXe:C\UgfKGDP#0!h5HT''SCn "8R4-a;`l6'u/M*,(=B+e1>!7OZ DA(js@]bk$5V44&&>(I-=>4XX%SFZhBZe9.<`>M+)sQX/+*'#qAk/ofqVK9%m<_4JN%Y\G-c>KP?RO1i$i`cg@JZi4^ce&k WIsK'+0Y)qrnl&lrI;TBs*ntks$.t5!8o[;I\C:9$m;eVi+rgQcpe:,3$/<3PSSk481d*2] H@D<@1YdQ&4.d4#iRTdKb0C^6?lQ=@:V$Fd)Hj=3+365aG^u;n4*nSFUoYN4V6UPB*pq$2T kAV/+Fmg7(A?m,#h9o&O%X3kc#8*XAb#(Ah4Z/-7;9Y4cBsO0gk0H(h5+,N7"LZ7_$b`@H_ _D:sp4K=QpgcZuV3>ei^utocITJD\6JBa,LYi,6ieIOUj>5&0_Ba$VZU(`'fHKU@;LM[$?g f;G@W%@PS0\4HpJ5;&dB0;<$A4Pn@b1b'?r3`8K40"fb]u)/*4^EH%+^AkU=8GqS4KF;ok" HHJ'h22t2)R0J[^RTYn3An95UF%0e:,=j2:T[9'iAo18Q\Mn-mhjb@7EDA?656o!s4NFDm: 79crkB-!\'=N/2q;jbPV"^G_=Af>k"[>fls$1Z%JC"Dp$V"6p#ie4*_C1U2?F[i7,ochHp*EQH=,U5%$\Adb))6:/sYLXW5Y_IC 3"dNMY^K;5t\-Ckp#kc3Hf$u6,K)dX- [>N(/)_"nU[?Io]b\`'LM.3RZN3isIP-T7\Bj(,,B==\d>,tM8g!Jdl+kUQ7E.ZYXZWjmJC >E*@GA_9Z^M'?X30hfNVAPoiqm)Pq!pfIbC0t7!BnX2pM_)/I"?Z-N*I (o?]4E&61+M69IU#3X9c]RuGk$t;1LM."UV$ZIXMiiFF(@0"B0dI.r_*,-K LZmph#\42F./gpq*WlPgZ+\KD(OE)s@aOqpdA@RpJKS[g2;7\Ys*3#1n[Si'H_\qK^CR4Pb ?-F1,'S[b811VAW^UNM*LOg-qjfGd?P"K"m3I@;Cr4N_Pb]"*X)T Pur4__#iR,o/OC3r`>H*6i4pt,B:?u.u[Z$$E"'B)Q7Cq9qZBHGJ`6PN2r+e1%aR*ui0QAj 59\[M5))r(76E,IhX\T\As)FE@.BEGB^V]iof,JX5@g0Ir Ku6?9%hpj/:K7oQ2`I>&O.f,HuI^7s*)QniYZ8u0[:e1B:R3iipc0U i'[j78MmbG5Qh&l^jS(MH9ai"ZjZ<;A*lNpWZiR'5NE-XE4!!*!C4R'^siCA0MM_dEBm'g" A!*Y1K64W'=Bq:5r9:lA/1&*F,-E6_$h3tU`.(V)o9H4VBC6kG]L5$+1F13DG2`*)&j=S7@/OKXn_U*(Pn2Z7hCkZPL#F#cK6lc T'jBnJAa"u&(=!,.!])$[l1!W[."KNU_=O?0GF`fmPpUTMPAdg%UlL<)<*HaLCqD oVEg]3K=oE(^;#3P2$Ga&BOO>J3OJ]Z5Z=49N>NYVr!G3J:j-4>_J@M8t@7`B9B8]VL+kS: \frK044u4Oa4!>_]oHKs1@R]bAs[0JL1-eM2S>L.F$%&7m#`0E_4(^!)VP`0.g8P=["Q0b` BJ1DHIF(,28CTBkLOHhP3RS"n=n"DD>NlQ5QA^>tt["JNsn,pMV-^GMe%*2Yq]1BWR -agA%hXK'C\X!@[XK4%%dUk_1XrP5M=^[at3g^M!ZZD=^H#C(V`FLJ%l"j/+#auesG.lU*8 $:!kb$[f;(jKhMN8r)&J1ZZ"OOC*b[E'\R\9N2eO>f=isa,F,,#7,6A,g+?E-d@;l!FTAiYSW%%cW!?Z@u!HgB>k1>L1i;m4C$4>?,b=k\G0Y<-k_9g`("kDc\2A/`)hNfp"+V)?TJ?PhD$'2N(ek$. Tk26&C;ucZdD[-;fPZ>G/B9%Z`uQ>D"X6G*9*:8:7n^D5=gLV7GfP0E]>El3UVA%+q8_MOa 5hbA,_OP<0%0rV;\XdRcU h8;q3WbZQNe^!qB2f2*]U&9?b#DMuUuu^<8rM#)I1(FNrA*fZStC<5hS+:dYAIBhQEUZuc] +c!/bAAu)YTLS0&haE0_,a&^-uf$qcAh/%fO6O$@r9^Q3=-$%TpF4Wj&#FKK8I+:qSG>1eU f9LU4UL8hD;$-+9c'<\]3)+t.B*DruL6HH!21j+*K?cW5fJS@b7>6j(CB`o]_`1\PTQc.SI YZj/[=E`3fR3u99nW**6`lK[m-[XhnBU]kfgV1Z3$T9:OO/.R; 1+<*RNmVg(g:7%17[R$!HAcg-L;pd;G9GE6qkq>*Z&?V$7...KQBBg$),K?mLJ?1'&u$:t; i)*O70Y'%&SDd7(Ij4gr`lA&]d(!K_)L#TuS$`7itH%jU)KJ6oae:,iiIKMhuL*\S'%56N`e(ln2S[mP)7Fp"9 1r#u#S<.?8?pg=8&C[IT,K2ao4[*0=52GniYd4Yc2;qL,7,?DSeOgPYBLN,G6%okKO(Dd$* U;2jle\K)50NE%C&)d ^(biOcn+?.o,'A&fi=0<7rAU4Pg:'*S,@?CMD:f)`LBSDg,=ETAWjb@4;*T?u=iWY%]9]_$ XA-^J.LN%aB3c?H,IYTm^KS>O`c&tH#J(\Cu=`,g#jt*Lq1'/S?";!e#c'r3$1?1Yc=l$2@ !JH%er`]i+GlOY!M,'H3U#kJVC8ejeRX009nFUj 0hP?PY23?2$!,T"1SeE_OLpA%Q!J.-:M4>e95@@E2XOcXoVkK4$n!/nWp/B3ePN]Nm;MAno!*1kZ]XVQ[7$M"Ho&k_ue8T!]rQ^*8,2Umui!+U9[XI?.W?UQ2hZZk j)t=#`WFq63BMO8q3+W1As5pTGhfW(0+G=*n"^e-c[&Z=o(WBJe5`Kc%^8V@6k@Rd%g"#+0OgZomj@C%;3$`=RUk[QVCj+@qL=R)q@=sXL"opddQ;HZ9g[2H)d3)p$YR^qW21^1 e>I7a*G#`*s?qB=`/stDN7p>BLi5u4QYGdgm2@'S]U"3_h32!L'>lk-=`hg 2hUg;DcURaNqVpGb2$X\mucdF^h/49gLfG3Y4+r9QL]cd3$^14KH3,26hfb%F_>Uqn4*ZFB *KI'GOR6kZL-f2Ie+P4#j:@ZkPl!**t??m5m3HKBI=DKrD;#kKlE?4EC>k?k[]<0q49d,kr c68ArL`8>mIleLZY;^:6=u.+0oD@EM"-5mKt)-Qn8!emG%o6kEgJ3FU_G/]CiS Vho%,Jaj`:[bH\[oal;'/"B/4NDV1uKXK/T]j&7^CW*=tL?CF;..+$/^@3ci%tF2T\ccsd+ XG)$W:i_CfZ@+kjABEf6`iiber`k6*D]_$tLoTGmQ-p3-*_0!]6oZ[#F7R)"cc%7S"FV`R$ +^qn=(i;K:m)t\!\13'D6gYB0on'g\Qmi&>_h'OAFRWsr#T*.TaS#K.""4ccn3$c$@XrVr! 8cOK`_Z;PB(gacK9-_#Qo"iBD$'^Z`bNlg2HG"pjQ0mT]*kn3T5s@dF7,a&KQ&sSf'Lh%aQ <-`mc8T[q7o*+_Jf0ra5AoZpgJ)Qp\4uCp_1[0V\gImqX:q,DotELT)NrbA=SBmk72M%j[94dno7HeTrr\(Y7"r0l#I"=q,`gVB+H:WmVsnIkUJ<>GXQfnMYY#WTc;R ;5VYD#M"-dq1j4fIYG1SIMha9994om-pE+[)QEhVs,W?nC&@Td>U\`"V-.>jf*6X,AI>?]0 nt)?J-aE6+40EP.U9moLKFRNKP+D <8q@.c2*Cl[$"a%q+r&=B7QeqCrhj8>#!Z0V`oLQP@f`"BKIS""':c!Y=A9L4H"3: iCBBo2?lZRsqDVX.0PZ*-'UtI ;L)NE=YH+8A[=CJSG^Mc+;o6gh!0/LT2(@o2JKQ/c8[$%#8CZ5k)X4DU,=Er654C9R*]ZE$ 42o%YLfik3u+(!BZ5)Qccdi,A BpmO&6t_rGc_*54WrQ+KVc>%bcp-`P\^p%r$dk@;3[n+V2N5,l4-S+L;U3R;?AhLr>%9ElhX<[aD*\B&BN"#\bU?+57DGi"d@m*C M%SYj?]Pag:?g:^i3O3$,c7[:CY9_*+' `+nf16,/r0^6a:`OKa"P[.SDQKSF<'a:ch(Kr8^m<[:JKA^*FE+'p)RdWfCjUfX=o>KIi7) :?10#qGFebfi:rlKNT'[30+_uY!YM:Y"_Njj'ma2aVs=.#^U>`UeJK nZj[#IS\e\INDSPi#A0eRP=sDVtJ^BIBWSK?j$=W:]:C1(I0^-E#TV0kQaA_)Zp9mFp!go% `([e*MBJNK(*@^6+B&^T`cBh0RaK?JE@.BQtQ]!?n[0V\ebE=it+MlEeqO*%:Qn-LCiko6e HGjiT*7Zd0:d_3/nKD6pVcCcmoQ5aq(4g:l4^3.Rc>!'V`NGM_SNi7G,-einRt#d>BVI36` =M\;:]hpbiA^/K82IDN5=S3Cd33*Q)9/'k+=-M^\BCU[3Jl;?fHY#n8$<4FI[Tn6JSq)^?V IEY2e )Bm0kN=aM]`bG%38'59^K&0a+Bon`]->"+jRkj,Jd@(_DB:#qN0[G-cRg#TD#Z6pA,eUZE6 B'A=WQ^Q=3_l5%Y&mFleN9[>n"*Irg'BDY1CkYfT2Xm$*\%#2K6W6B1_+BIWXV6B4U!tLM# *`_^`NbGB0YSQMBDHlJC;[[9*nT'TbPgCdkr:C1l@Am1d!8m+Quh4Y*Mu9=HO4Qn>9.0REn 6T,m"qjD4WtahOF#@?S;W*riZ&;'W[SjdV!>?jWtfNQe_7E 4P`WKs"+$lr>0U497;8l(Y-qBbh-92irZB$s%6i8N7g9EASf>MZW:DWfpb!7m.I'Y[Z8^<916ZdaClQ'85>3he254mo Gs][9S]Kec>CHY[oVAAZUT2cRaYASQNlGS4,n3^7E)er*p#50Zl-__kn&FM]f1;?F`,*A]2 r>+h4(s!gZ*a30>72<43%a6BOlTH(A:!dh#X^5mCkNnq-Mh(#tFP@]U/'X?Xp,: gn-1$_0naes&S#'WNNo9$"2dYrKMf6'K.,dmJ_DtiABJ%F.RoAp Q*RPob?8F*Lk+h6j.pp[fnV=Q..nc?7"rl@-T4Kj*Ll+tE=hW.ED@M?fL_ `8_S=nYg.>m[4rr25g5n2?)T6(RVK]$`thX:50N+U23Zdo7U;9R3ToVQQTA>(9Fb*D[L4eqY@O;]=)<7=QY9sqYlf37?DCQ3bFot[78_e+AD\c8pX6/(;0!Fcu\\kpi&)ph_8dJji0e8RSi7r72ES`k!q$/)(>`DGg &\KkM2^tuDY/,/(T`5/-`Fjk:auPToB,tsSG#\XAVMm3j?:PCpHD+(?NA:UnRN1*6MrtI$ub\+ccO3 L0B>Gs$k#NqM?Z:5(lY.&%L0.q$KHY*LAZ]GZ;+*k5E@,O;8aTpDHt@,Y:]b"ebaiOn&cgg 3sZ8m=,6#&kn!cp\0?Gm@/k#;C0/!I >77$5l+u&L!_W@3QUU4qs]u$#l@?JN?*u2ABT+$?3$QOKAl+1_aB*'*1E=&A8J`^C2g5'&c .r+TrF/TFO7%))0_Qd+]#fih/Qq%Zp#p0^B5V"J?p$4Md9nd/Xairt%HJc=#37_35H#'+kf k&O=kY!72:NP7f%%%)DiZ@*B-iHP7QK%"S$f^r?n9JJ9h/'N%F9nO*d.p)#AW's11Fm84WR >VN9Zg23EE5g#S5Qmp9)(TAt:K218th\^?e(p2a6nVJ+qN&i2\f^YKad@f/9P1ahkg/2c,d BOUacCs:b%q1P`j7:r>-9pG\&Sa#W/aQ*s_Vd$E*KC.@Ue2]enfP#+*j.ugd>]"uoVQ+j)f a<`&cUZU],gGK*RYB<"?[=5C)etp:$,+kc7%Zb,iWhl+u1SkngmU'jrZn\+gO6Unj+NV73l nF*l7arJb8)B@cihT-*gMsnl[:P>Zmbr'Yppj_-.2>VWppM-a&pdcCZKTKd\^5-k_LfEfVW G%N/\5#U,3?TNs#;UFHnQ.RBL8i-lUG+:G?f%F33Km`K+$d-_OfmIJKh;U6o"d'uBe&&@W& 0**[Xs"8?N/s>;b7f)gs@4u'!$\493Erbr5"S]5,pL0R#?rJ^W'_X=#067nX6*:QfE:l"8o [>;_;_WO$63W/0#nnC:o,;iSWXJlE0Ja"lo1_(n65^oq"7Lk"kSP.eliU%Q2QrB(c^;_'OS S@E2m9&:c_gP)TFkRf)hAb5CkTljb;jL[3J_VoB[drnap8O=rR7kI1TrjGYrcX+&:j*Y:\; kP`;_C7!#*TVo?dP(F:I11(_@>28MD?=h@Do!!V>Y'n5f^R5nXi/\U7^B7&7!)-kZr'5UFFb2/r>)ZA)a_=L@1q-'I6HR)(_e&`naf@-P tH.l8s,((amh_T[6o&H)O-.QnZtn'N'9N,)mR-sar[93`uIC3*3mg4/aXR!&KpWP:25Y+_: ftD92Bc"=FcBN]OL.%*R+TP,6P+:5t1%)u?7;Soo?CFjMT>dDs5oJ\cjI+=/r^AN'6r2_ U]t'7XXNK4f7V3!#':ihcOqD*o)W8sJF1#a=ZYFQlC6kZS+U/GX$Tp *64Drfi +7%;g7V-fC+0^JeN^4)>E$T[DF*]93bpd'Q-79Ok&KU>8_\59J>TG.@jA=C57!@9QR3#N;fu!43]=,RopP%X#l up!njXJV\I"\=pbL@)BLKg(N?o*MG/"fU[m:T8GV-MKl7\=L!anZ\nOcMn$k0p1IQ"lYs\^gWH&6^/HWPdsAMq+$]19pJjYQ$HZ#\R CbkAX3'h)PGpm6,jCBbEk55QW\U#q0eVjH^K)0R$iYq\WN9TQ'g6mR5pb)H(CBaTpg8!R^o 8_J\hl3\/Jb`#/R@0\\FWe_45eiS@QP-q8o0Fc(-lJSU'%^=lGjD^($aARec?>RI?TtnXk+ "T=K1b5hlU4BqT`]TUBGc\e1V3'pW3r%7"#5T[F!i+ei-bU3\Dc\hTqJ259q+UH1E1qE:W8 2@VoP(Z>&i>"th3:Sg*TV0YlR_"7aqNXoMhVL!$TRVer`EMn,$Vn.#Kg3KUmKr@%hVkKCh5 ^"#r/dOM'WLB0Q\tQ,"V5`1JW]I'sJN=/^_A&[B*C3d@+kd[I7BAPjXBN`IqTZ-'bH.C()k d0-f[[[V(YHW2PYc,DM+Rfrn\ZotkC_k'-4!4u_lkX :]8QOHKih^M@k`]^BDH#sJn1+R+rGSo(%m]V#4%pG0;mg$'[9HkCRpEHa@CCMi[_$+ZgM++ nFgiLk&OD]nn<:?_U_P%Z)kh!^iPW2&PIVWt\\"9?qj4l;=;E'k&:lLDi@#Qds1:A%]3DhX qn9X(]=`L,]UQmQ]@":ge\'Yi]--k\!Hnu=p_DQF^74<"]CEW4otK2V^H;>-Hi:`B!Pj'^^ q9idTZdq?F:3Wq(]5/eg`+*--,Mbn_Ak/EHnW@L0uJAr_n7N.d3K+F/]9r?`10Q?Hr7hp;o JT6`Oo?lJCG1ISdp<")OtN]ghXq-FiQUi`uKNJI"02LDAHYt\iZJ(gS)^dQ,u.VaW-knI%S NnTuqbZb.OLlr2IjZXiii;bC%"H>f"Ur_oqts\Nr7jiN9f*f=a;sc+Cb#JJ]7e?c@EW`S=? "+UNAEKm4D*Ggt'cn\]W=H$PY3;!NCR2lG%^diF!=(dZJu]c]h3]68D5G,%qJTfO+dbL"Bh I.u7?I6l?@XrM"-J)T`9@J>7W7Ub3piK])pV1d[(KfuKjIBD6eYd.]3(-oQf4i)ktA__^O>%*L)TP %J4jq8fV)rW%P-?a%3M258lhOX&jB"Vpip`H3j*aNeV6.QaD0`7-(i4]Kp+iFrmi#89d$%\ ZY!--us,N9ajik?l$r[6_i/`U.lj*j/O^-UeN7H=A;irQG"T\7tH<98]-+*@25lJ*J4llKT T'>Xj-^2[CAF'M@_*[.$j*H5$?A(Y+EJ\e,mi//Eql3Dd'l(47+^7jfjV0C1mCls@g#rlsdqN"Cd8&E%4>IbjE5hsN\mmXFQk?LdHtoBuVNn%SVdr o=t@>RPta)Sp_0+j_/O=rr7O)km*MOuc*!fGC5[kC5)H7VE`+n-YWkC;2q'W1jfqn.>I7CU ;+^Rj2`Jc4.S](J/ihpJ\C0'g>R[%=n#qRm$L-5m16aDh/<-_.4-D!YsUHpn*?:^QJTY'rdX>7?h+,hS.VG[(-rQU#c,Ti"U'Cm@1[Z_)Arj9_VrlZKMEU(M*oJ-V1CK<]8fCV Z2#)g8Ka3fjRQGAY#R';'N8i-P'*NURa!2.RDeN34e5BGKr#GZo!WN[="[*6.[*N';ed#hP s2*CW]o=$kP];/?*@>r()n!Ka^qe]m1u0kY1[[$>OE:GrFu8-@C;86L3;YQHG3bTfGj5h!J J9.'eKak/pWDIQP#1o$42o[b2kD3SAoJ#S]tfRRJdnV8YFOGo_MiZI.kY4CULbF!V)7a5Vg R6I;M\ i=P)OYk1'J"3hEFnJjn/7.E*#>X"4->8JgVM2jffjpYl@`f[WL*(P"]HQ>W(jF8=D1*hDq8 9-hN,Y<#URj?,HA;kQ#LR_^%9(Kp,/PC-F].ZhK"N)rfF!So:T#XF2Cm;hRf/Cm;FQ5>UF+ !:6:=H$-4\mlpnNTfjr;/`UF;50Kd.AUr6W#Z@c=7P9dH#GPB(;*T)J-_/9N+p82c!A["Z] FYoc6Ct<:r+I;UonY=]JJ0KjRt_eYQbZeoeBA>ZZ']HX0_'jaU]@2C3oa=EZi$>7>+(*Z1: *BO,:T.2DLD-HYhZYj"@oqH&\iVB-)#,\??*ZG1mK6CPPD;TVF2l5J[??a*KHs_*J qg@;qjoKs>3$nl_?fo_\-(Q;)!d,'-(*A@l(mZFrSk#$iN@m_(8k^5#@/#an=UmrcA@Y0$Q "9\s;jM"U@.\>uUH,&3#R5PC*+q:gFe37Ap4Jt#H3T5"BY$ZoV.eRpPG[SiiNc@@P[tZ3;- Lu?XO!eq[UJ3C#/[d?a5Q`5Q%YR@8WJ-ufsU4ZL>TOYgSX#BmX)D6]Ph;Jem0!%(BUb3a76 Z?O#kl+X79BL%VZI5.AAkYI$Z;(o"T>pI!;LI,UAS"i^QC$hZYiqt 3+Mj:0#%h!J)L"@%Fl%?@pOh>tIKt_gGeQ\/jT^Hr>V4VMKo8hJ`^pqiS>JUEH_&4W#^I=X -M>"KIi$;BHq)KP.N62QIJ/*HDr:A>5H!K;IXf,ur-s4Jqu"5'q#A7iGS)+'4c*h]!['T3J WMJh5c>eE"1YB@J^dgg=>'iN`#F>*Fpu4^3%T\qGS^Cn4c@,:,=Zp!&]7'R6KhV]iKQ'OOM Vr(3,]0lJ:AD%]KHYLg`D1EAIekQ,"-+&&`Qb]M3/u07(Aj&@Q8QAip]&8EH`/WbZKd#FtQ 5Y[hqLeIMP6u5`4dM)C%@YNKLA&7]>8b@uP>d;:[cuGip,X8<=O\9^W8HN&f(#m2fcm:5eY >@:W5eO_,M%8D,.2,a=@QE\p7C!G"WTTbioUDGNj'5pp4M$4ERV=VASM.V2#K-.9)!'&m:m N,5gK'%Fr8@+6\rfi4;l>$i"IJM1UA8KWTX_+]-:11jAS*s:e!a[r0^bM[1NjsjP-H*0jMJ W_lhFO\S,;)i1[ig^[BEt"/G+%Ai*SVG)6L*6=JNSO+`iU%'tRIGq@+jE%2V%V,H;*ZN%!M G4(HOlO(18n1\9'=FpT\:N@.$>(71fB1X=trIm8>R%GEd^`05<`c_)agtJJPpeg8n]4qTAj *ZNZ&b#L'Zi[.7TdPl>Dh8`B0tsp70V.Gu,,u\f;r@R+-GE;JK3)WKfB><:mgfL=iL9N\[X p]!140]iqHoDQd'iqDSRcGAEr_Z4E\b5=ar7H7L>OVUm)$G`bYTsTb"db6cWC 2HD6)aT]4NfaGdfW,^pN)&+^Fu*)21EBul]&,9tJBTVT^DqhR4,op:(<1Dl\W&f92!^iVDN 2uR=&ks%-E1)sjkHj1DQ/CX[TtK8j#p-KFpnCVq4Anp]pGnr4sA&t`,gU*2j#YP&\KkOmJF Lj0upg@8EcTC"2J"T!8r5/0a$nfFq1td@,)YU">DBP0,k:->VPaE.;!h"RWC1#MNM'r7HhXZ1R)"#EL&^WB _@qfep5T0j$-$.q&bXKe?iuHgRtYdt&CsJ9:#rJYRise^Z_qSkZc;Z=c ADS@^^lD"C79"8qJU`kuR1nB)itk1cKWMf2K2q+@VT/DOHrEZL:`3sWL3h301@;/P8]GE!N tHe3O]EO[)YB&BD2o7%q%4h:;/"5MZFJKdDQ0m@>I*CJJ*e1Mn@Ga1JPHq0'6IOp^O.*3/7"8#SPQ:gm][)#Kp&a-:!;10q[sILDj--57H#UD2^[Q'4SX0K nEO"]UIgi\V5s2g%Xdhp`\dpjIrh$4L[cF&"c18.mKKrSoHYqr!e328%JAcmEpQf+RF& s_SMuQ5_6!qno34(_k/jpiU38bPfV5f@=2R-QIUo,:T(nncPg#g"9gO\46(1Q#fL5t=;) L.-6-LArJ=*c$<@+YMV;#->.pBeG=gaWG\_GcRCaTT5\cjKk$cEaq0Z&H5;^Sjo_>p&`6Y4 .3B0uc76OY^Ypb;mWALD8/[]%l=W8/i%I]3V^2[b8UX+NdOJr_@,4fciHXBJ')gGse,L4EE^i-Yd'(Pb7m"afIEC[";FA4A+]7Qb8%9P-bAB ,0WBKbu,I];iHdCIZLK]%aDXl`eD#YK$oX"3Sf>L_L&d1kE6a/H`LEP]oW6GWV=CLF><#=)gR7#FQ]6Tr?E4k,o`m$c%`AqRT34q$>km%+DP6NMP q5',jY*2=P'kXL2t"h6;l5Y(pE_hM8`!SigOm&M)3n%UEU5:!Br1p8X\3WmGn5BA&B/,$8I q(d"=")'b"U\qEt'=+nY5PtGcm(+?f!29;k"%YP/"9^M["\\\@^gm^9Cr8')#sc]B^netD> fS'O%?D'ALN%VJpgo3G7Dc.N6!V[O[*GJ;(;Zda6%mW[.nmdd*'rB16.FIOl;Y/Y7:7,($jgd4Q1_HW)C<8T>GHABRibk00bE&31t=[Lor[Q)@G*9T['kX-obNE^/8<&FabFUd )C`+siMf]PYun3jWUWAmf\!-:m4oEY:Z`'cs\*;<6FpaD4s"Rp3PjSM>m8C&">cQ)nm&8Ht ,.`GdnL:Cte/5X\U;G]da:e_-+Y\8egFAGU;:n7qiXU>dK7g0=J=P/(i: kW$S!'M;@?7ZA,0AJNU0(f>QfL3Q]"UhrT7*)XBi(6!-#r?"N"FirM_O4eOKMX^aa?Y?iLe)WB;b]/K>rN[4M, S5u)T8%8]gkZ%84f1YKA[Ebj\% c^i)#jr7;-LmE->&`W)-Kn:i3 2cLgYnoBnh&(g>/o8mB8s/I#!f*e5`eQV6\TR2b@CU&U8`Y%8kl.),YOe>D9WBNOi?)?3ZK o!qdS]b\UM^^H/24dKL`@'uF3=_^r$'a"V305T9p31'.%sdZqsQM0fHj2M/n!]A5&Di'C9& RF;$fR7MB%BK_+F6\AW5!];mbWC$neAd*%TVFe'40NEdk=$GPeL4E]cB8V:=,^= r;2NET\;=l53C+/h1%i(;JTr%^-:b>hr(Os#J.\)7Ym9:]Zf^&k"0]YGF-U'P+"'l2`J-W\ a6i14c06T\?qE+$q1b[#9"i(+$5D:abkfU`]6/U=_*HWSK-@7s:G^dZlBJ74DfiKI3m*9@B `fsQ6]iSB/qm=W8]j'isN0LVs__'9QG"SLB:jKfEn%J5@,f9*R(9"NY.WjdY;9M^[M#g'0_g]_pdnUZ2hLN eg;]U6nAWHO&2Og9sISY")Zm83!iTYHBZlY"N<>9H+O]KpY-^<_lpX:gR6^`K9kMLi`iD]O )FRj^#K0DH17k<\([o"fO-kBkQ3)^?*XF7bYr=9u?#j`+B1j"u&-e2'c("-;o!.gpUd\^hn ]h-CB(6>j]eVc-TR@d7=7Xa;LDe3'@<0f\Lu/B-)&*/Mu:\:uqM@.m?Xj1AV5`?%kH7YAeZ =pf:qA1_Wo3kM8U6D^L1jJ:Ci'2tE.k&h khN2qFnoBuq<8>l",1(G/RBQZrSQlOK5`r,c2gs6\DS;WERTBK?9`@=t4FD%=t\(=EC-SF!E/A&=&2eY);UOQ6= +Ci755EUsqjGlathVVjgEX/&gm$?XK0&ph/Z\P2p#-N)dDLQJB2M[*+L+rCWpgsY` =ROI:DVeI_md4ocmM,6./0_uCh8&.'o@sMcjn<*NDYA!t?j9Ff!B%mPIE:Pfb,l$%Jgb^mN b[^S!*oGMg>6Y6:iV.Z3X3AaJsLBFDK9]>F)ZE$k=/R/pWq#Z\4e:kA $tGV[GM57c'/UEE&A2:ct:lpLs 8_B`BE">95(i&s#.CE6D`[Kg8-Q/soA6NhlkJa1($b4hoE^5(YXO8[Z!j7n=:VWn[N*Pp[.KBdlVo*E D[l?KYQf>jLK?\EE&!%n]@\?-ldifC0"uHj0geFHfdPI):d>4M4+ok3CdABo *;KQoG/pc?0E:eZH6oQZDfDasE^(Q33UMslDoL+#-6k[t!B(+e)XdV`Z8a`b:p+GVp@]?^K GrQc=i!Sn'C#9fIi"k89g4b=1MH/ApIO.U^U*,qg(gH!.RamSf1H4Psp#68^7/?4I::4rf- mN[t,?[ko0'_,P4BG1LQ-pN7mKQ3WgL,_LRV]>RtLgKe3DW#4mX6]4F(GSH8E^#L&k9XgI] Q.r'T=67rlQl%trZMh7^V6*"LVm.f!cm^tbGR#XcnpBn^L2Q5?J(YeriZp !pfJ.LQ]JX%oF[oAGpZAo&M8S$7p7!7#QH6:f+)0E`&0q(eudj`5dF#TXcB9W/I#(8h2;!?D47 1tkUTV35S8+`[T;lWi4eU#2H[9Ke8CXr:cL;dZ.=_uZ97AeUNWOj(,QHGTLEOjl-Q[?.&l[ -9O03?p4rrmkg?uWV<2CB)p_rG`=ldOPA^7pFh-@H2qu%FpOU6@EHjTp-InQY,Vd]@mWV$jdHYiMh(H`LZe+SgH_(/ nLV,6JSqCi8aD92go_SOChhSQ"n+lm1T7=?5lhgN6:4XR]2$RZsa<)?'&;()$0LQW[_2s$\ #f4@ab!$;*;$]HT&C`KF_pIa9%Ra.k7"1^tP1^Pg8+H;#*!E5&BFb-sSid5iXD]%J&_qLMa "dL;+@jigM'9sg'TjT]1-CgKac_%<.*4s#8iAEp],<.T'&9lIY=HFaECEeGaYKo0iT>?S7+ hEV&n@Hf3)0"'ibt!4WVCeY'/]MKUZ^uJ02%JQ#skeMOT$Gm,H,fTdBmI*8CA3C+%js\[4+ bt<6Z7mNhOjN5Q^Tf7o<6N4\\o*[9ZX1<(7H$%N/e:Bj'#pV/9Jh(#0+ ja,dM^#se"f>uT-P1T+$Ipa*7"bPYl4pF*6@pnS)@@23WLQ/(6BK)!+i8-WW(tLL&j4NccN =J?jSiMqQN_PaKq+b(Xjk3[CQKC1ei'3SrGk>>*):igd%jh"n4;`ASLS8CM5)lB%\mCMrBL BT'?0W>oUT*P4Y-G!B>+#d`(.;"$=)8fk_m/R_0%$tA><^ZGm@/R\\F$mO?9=5pR)VEJ7"L @SP/_D<^i0,Vr)=QPR;p.74@^.+nXP(FaRS&P+j'<1Y;+1@>e`5Ao7h6':_lGj'MS.i2bVW m>u+VQFkpD3f(L,VA_Qi@^M2G[A6Eq"O[\/Ui-5/2M;e6d(Qm_Q5!P=pq4<(t//.0%nlm)$ l#Lfk*nRacqqgeXmX/@@a70#!5L&iu^L,CY.PphXq#4Wmk`DC6anO,2>hHhhRK5rSN>MZrT F:pQckZaL8/)jC@*B$'#\:aG,6T-R'nVNR$,Mu\#,&mRK@"cQ6-)J"i>a"oO@V)3+d%IH(H@%T+K"7Z_s0iuC)d6&-@g>\]7\^,JP!gDo7,FH/ZF8rQVB.Yd#2O0S7 ?8/VFNj8=Um;AqkmGnhN6A;D1VJ5VB*M\)\[PEO<79?BI0-jIUfPL3E,`Ha`tjV4PU,0XSX R(A][aSmWO]VN^PQRl^DZ^0%^>YA4@/Vf/X*tk_a9GrOomaRrA.4[RBs% 5arXd@/NY6B2Y",>.1a)ktknS:ce\B-cN-du&6B=joCo<:-6?^3.a>h)p\\cP7TtBc\M85% isRT@<(U*M^c&cdDMPPSSpKH5/`EAI1PQ'K^lnS/]:PdgY0qCPEs^K]qD,5sp;d#"2$Rd1% ?hFHmE3AG7jC,cr.5^iPN5KI4m8d1ASQ-RC%3:2/fOVpt");qck"l4l=g:li;2-' "n4?O#V(bF/r#]F=<='DU[YMZ^9N=il&eWDDKagbU24Z=tKbUF!`GJOr]!bZ9jJ)omG6Wr5 ]IKrPX/k6^)'Tn7X>PQ:lkP4V2BK]9\fUP0 =sYdD'Jh`[Z8g?Q.!Jc6O'ra^=P'9+)KScFr"msO0QlNDJeDSA8INtZR^`KDBgrL%+UiRQ? LQkE-`>F2WuuuU=69?6u)++XPJ61elqBHDG@sXh@%;Hmj6q0+r!;"nC$0_aLJpWRD(X"jP\ efE>*s^rOMgsIba>h^K::2?hYK&>oU4r3$/61QZ7V]7LR&XS108fFRu)1'uH>Dk[BE$n\Yo r(4ksYNVD1`hc;"NR$SLrHrZ#pgf^^<^DLGnVDLdKlbG,urkPHCNhB-/a)Ed=6>V>^E[3$R GoIsgI$Kk&aC#O?_^Il7UCCYE3JSd56k&<9QJqa5M/nbUjrD4)jYgY6,KtLqb[m7#M#&3go PkBbi[i+5g(5JK@0_?\*OFgLcdBp#kM6.WKc$a-;D(IQN>3[[?A['m&5nC:\!JAAR*s\i9M )cVRC)*fe(KXTl-^%e`K8urfs%T9ENh;HhQ<,J^0Bn4?*&1GZRLMlF\8c5Y4^qjf@p74C`6 D9"o+FceM=LJI?h*]B#lZYk^*gAZo,htFe3qd`bh..[e@_rgKSl@D>hG_[j:5W,/>g64k2d k>licN]^/HU)a`b3p"l1qH1.X#4QL<'UsbRMGM+:,q@P9@"/^:coFRo hA.:4_c(;i;)mZ)j4+s+nd[n*Gp6+aq_)T&N`98=i:eID5F?F#,!*]iV-ASrC(-,40h9=U* B^Nier&!_l\@pmSK>;>_2o^h7=4:Ll_mn8<&$cX,I#`3`-$O:@OtR=2o@%&Rq85p:fZ>qnI%a9&=de rul*)igaJ;O*'C`n=gfqq]>bWGlloA8H.9qqrH)prr9u*$ip8E/>W>;BSR"s!5Xa+BPn>t0 %,]ke.<\N:a4CC-6V9c*C9,kYVIHdhNsr*).Cl3_'0c5PUVR`cqmKa0N-8::(kB4)N>[?%3 EpDB*L&%&"soj%4MNV0%3W?!g"]5d";T*)BT"R+0[RI+gN-)f[e;Y$-d5ln='arV[>b"'1& E3d#e]4[gS;0$dcU>,etC[JIIO-%'G3l"U#iSSe_C1++a&*Y.Y<>`sut0%Zp,hd.7aOpC@i 11kBHO7@XPl`nh:5h9c`Ec/da+o\U5s&^_O1&K!Y22Aoo\"X0fR@"o[&#S52niJnWdc5K+? ^)qpq*hh4)6#IVb:(>.Kj%`#Y%SIQi7i%5"(=#P5nBDbGdhcL9'`i.[&A0&-RMWfo(]dnZ. (1)RAe6ZB%.8l7/r^c%OW$jG(a/k]:7g`J[i7b>)*nZ8DRSjC`uI_Tl`g4C@@@m\QOq'A)h B7D:=gO^eK0W2mEXr<%d+p/lQ:iM)PG4Xme!p8#4ElA[SH`0_".=T#pG?7+jUY.Y86X`,%^ 3]ndc]VT[*->-G$B1\mW`rla%j43@&N*]?`n;Z;W%^@<_Jbh;:RrsJVAF&0(4bNZO/Vp$Wqu'Kr"?a@ o"t:P`l-8g/CMgmkOU*7&ds7YJ+)It&*Cq$lMn'\0!G('ddo*t:(SgT!0@E-%'9NnEee=T! KA`5d"_kt(C3qV+G#IiiSQ3Qf$2Fsc:mHIbja2&9a+?j"`la]T`PlNPm4Qf##e5#M&Ht7// jUo#;Zk=.60,hB/*>!1!#e(+lFFr^)l8,+)n7f1P6$uKfBa$35TeDd#Tr'QT:8!3RaRf8?s 2.?4V%H(UL:]PI!+@`uP`a4L<-le'gGnf0&)P=^];g!@.lSgCU^W&JON eYn[m+*thNJ5L]?>!Jh7O3?.M*u'U8?o[)6&ZA*;]MsH8^YXOn]s?c1`>7Q$Ie3#!K%J>>T=n8m?G@,FMT$!59I0)+#M/8$V MT4"!Ea1+Jo_niFECjn.tI#+ggV[bC!i`,u9[P\C)p@PlbT+e.3^T,F&ca`e>ZK1F0@I,_i \9)O"#3Q"j_\89lm& !AI=X>Kj7n1L2^kD`6.h2Q94]+a>!7MMmQUQbfC:@F>e)U)C:p-W<#]p%'uipG8L;2"gl+2 ?PfG&/,(.)\ZLc&:$06cWlbR>gOf96,'17^(J2M)&;NuQ8:Mo2.IC[-NV641fIe?i@HJOqTGsS.%o,ti'Mh, _kAF>d7(2MRe5Krp>t76f*b!,.<_m[7f]"'_'`d94C6_;RIn-ksEM.Im@.FL9O)gJEEkj:E +T_aFRn=JY*)ra"_5%i3^M)Z3)?CrdoYYfKlEdk>9_Vmff4.N$nf"1G9pFO0cLbO1g^aF&: D\LUpOX3E+X2,g:UL+5dP2sNHtX6.,Ia7Y[2/AA*I;.<;DfnM'diQ.>eP/f;`DHg\dMl"V!m^`/YLN7cI9(t-qMd1pY*DmpC>pu?:F)B464%mg5Li^A\Jq AMY=%/,76(4VEHK9/)"OEh2(6'r>dO*%oOBfR2JC'eV*UQV#mP0N,,+U/,%39oIm&E&'XTa V>1bRgH;68U,Xd72`J=rpMk(,NF;2Xt\9l'>IfQAU01=QPPY>2m?rNEL`=_V?a]F`4`*ERu (r$J62gq?/`-8K"->6')YN>EbAVRaK/t&Em8NS-Ctr)^-I82ci[U`pItUG#r*qH.)+^CNfG n9sP(#@9U,VJPS4XnC72.f8k1L!I7.T\Z;?JeId)t2,TV\HET2PpU*o.Z>9PJ%fleKPrF(L _4k#O;tn?BlgK7e;59R=UNb[GQfW\-7t*DcUt'2l:SR]0rM>k^J+C2J3":D*&#PN/Ql9jk@ I"3#!d[Z"=nj?C==]"`08!GbW6C&+!;aiaQA,"DWR)/0\5:BDVhuCn2WbgiTm:L1g,?3 /IeiMBkj]a@d0LYC(0XTB)c4;mpPXk8K5!Ori[;B)!kY/l*LqPgZ#UT]7T&n,Al#dk&VefM ZnN#N;/RhL`B(+I+oX*Yqo)^DXTc'?t+ZIt(pC6Te`hAh,A'Z&1Z)%X)W%CDTl[(Ai8_b(f _:^U>K[FlY1"2d?(V7)dB[^e"R+c[*jR@8keG0I$2r%^RN*'nTW QM6\*DjGaNQJ8OQKQ3>?1U@j!V;]b+Hc";>R$l^@3uO#tq3/K<(`Gg\RG6V>lLl''"9[D,^ =8lZc+pU-+L53\4Cme^f3,mlahVJuSCuG_r"HmMpRR`.G7.XdJM7Pks%^,l_V+3af86,&o2 "'8,4?\J>XE-id3La^HBLdl3Z"J_bBoC\U0M'"P%gZBbC#'H&n,^,3]hcD4i_J\U`)h#4G1 ][>GV#b.[Tl[3a8HYPq/,HVL5#5>b_,rrYJd#]NhTjiMISgCqmce'D7cl(aOYnKrDSPLSr_%%?^1L,8'YBm;U_8%'7mBT%Qi](Nd@DWu""tBE]Z$OZs3-inOp5]LP XubHrh'.s=rqa(XUu2Z!C%h_;l[oGKV"2e_OT;iV">/j 0JQmf%k(;6,j_W-mZX[)rYqI4&OX7:Y;4jfY*%*c-?]D?YNf6fpcW_h4qG"VVYa?&&:cNpH ?!^GT#HO#Q`En_.)NBc&ZRp7=k"N+heg[\.sP_f"7il*TOa0kIWHf9"f5We$9seJeL:UhoV &6NK)gS'N$sBi7X,hT^E#riL1_GiP7(Lp9!(U-Zb]]gL6<[5_7U>O:e.$S6eFqV6du5dH$f 4jJCtS\_k6kn.%_q'mq>E)XgjTU\Gs*(CGIo>LQ#o6aK1Ss!uA ndneUU4/`S*hgSR43!OL&`IHE4F+tR\*HO7a8/6k*/3`4KugobBI3R7XSPT bi$ZR(Ra];smC)BkO!*=^C:(XY:k"`4Unr?(]<-1t[`'(]=aIq+>K1\.(qo$AX&!T2Fh^_H mU)S\Yhs+AgnKINA)mba*$+-S_W3CDX.q;#ublBEBiRNu=I(dRiJhm:uX\(L_mqd6oQ6#$f ONY0'6g"ZK(*Lbh*U"Z'6[f>2J+c6e\6/+WiRc1+Z@)=ao^_rgp49>N3IQj?apbX$($&(_) OP!M!lL/i#<:,r*[Oi>S`ab.@oP-Z4ON6E[=M%!)6YDtq'"Mha>qq^?jmuW>g1`L::1ocIo ^72lTMXiO=q)O/3,GQgP%bq#SPbPLl4lpV`,^E5+BFah/8Yup@Y>;`#"Bsh.3QJ6PriG O$)S<^+^hQqI-[#a9KM:?a!^u-nK>UCNtM8Nf-(qb"mP'[ot&-70U>:Z&bAojB!p2<0dctN !OA0@/'LDjoMHECeo?*VuIp)?_leY92u[+>M!k50M?iGa%3"#Df(94O_cgqI\_S^HYCq>FW ]\YtT=\.WFh9@D>/2bO_DELKIc#'E:1e5[ej;cP\,=&`1b/C3ZYit_os\iJ6s41`ObJHF=5=Zl 2g*q8A`%]<,N3BUO/9t?HX@T&o6t%jp%.WFF?M9IdrdfD=4?i;_,+R#KVr>5p0FS7gNPfaGMID5f6cG!`2Q.=PiYcQj*;\1PNI.> GEqB;^5noNHG6;\kS"*pYI",<0>4]=rtiTDHiuGpCiI$'fCaR)+5cd@+*ZcAD[(KuGk%ESg he(pCT;N]!Wb@'#68-W#Ct/J!l2;X"!CPPJHB(j%+k4W@'g`&&7uA;\2ae%oH/_tL(P1%lo N/VFtYPH'LK+u$Xm!eKoj"d6P;.97\I:86hGga(a#N#u,F!= 3K+'mDZ%a;be:!DJqERS3"X.CbLQIZC6V*U_,33j'OqKZDaS>B4##L$YB%BZqGrTZ:oUD'8 FD6Xe_\EBc^(+YGD2U.:4NB/TEU6"o&(0`)7bHT6@L=#@$$cr95q4;%-=KRcLf,QN_jJn"A 5'Oo9aY#tQa6#sbo*K;iCNATiqY#,"pPIZG* K6V0-],ZM#%*ejGk91`Tk<5BG!l%hPB!.EYcWX?r`)sFB@k:W>Z3p4u/dj):CoZArT hIl_OPV253q-F`L,,$.%8![-[_$`%rS7t#*+lX&db5Ik/dLR@o[,=H[7OYSbJF:Q(t63lF2!s2bT_0=NZ"CS]gK5aY<'-esl4Zk0 Hn?^capf6Yf&P=sR"s85;Jb$N6cMDI%m(N1h'k2PnHc9[;*>cu>%q5/qYV%lM=Q9HmS9^.b p,^!am!b#NAW_!k8')Vr-"OZVP=kWL)hP:Uc?ZOW1:5TSq,]+6d,%"KM$>#RZtmY9a[1&*@ a+Y71hODNRr_>Cc'cI.B,p0+omH'`l?+lT';Fk%)W&]&R (3Ij9 -`n"$6e(7iE@r\8l1IBA]OQq#8rf(7CA0H3F4bckA"_H9!id^j?i_hgLZ'+&a1; 0rl$08,j#hODndN`+h.s?>me<'[^1F@"[]U[):sZeaY8$!R7Ho4Fn/b]\]G=!Wj;aAJEmA/ ;A)Cp[rM-I0pcA[fYBB;^jpDfsUi#(_M2"2P)Yk4Gi/PrLo5P;eI$g8LH9\D$rjSeR@SBpb %e],1:lcL3-eePaDsb:ujS]%D!feGeW]p1GrZB2VIm<2r9/uD[UDmq6?)di'oDZ1kH3Yj5# WQgYOA<-o3jeM_5\(#5F9TI-#/Glu^m#2AMCJg<:P(BJZlBRkj:AUC%jQZh,ND;11Ij_u83 o?Q5sSt6+;_L\(q3`f[nmu"j9ptrCBa2f#=**ZBR0o.DObs"LcBI10Mt(3r[+sU2=r6("=L VT.)L'T2:Gu!"=6B./;Uf_60nD7oImh`+bn':K6/\',AT3dCc:'+6Vq@sa;DB2EAoF/_io% o#XEpi)*t>e2ek#NOBR8J@t](D_#t>NE+];u+ueP1.,780EfQ3-K#Ek)7&,=OYlcsIKfDme KCDS;O@=kELT.>3\=/u-+VD5qU,^nd`DIYcl]9#:V7Apl7AH'0J2Iu*QpoJjP`oF/?o#*TCbJt34Js\u\co 2)0=M$tD]0(8K9%5q]Ge8WS]6&?984J=I(rHK)a5QuafoD=1ik-gna:lIZHcNd7aN-c'aAd n_-pPA=m6%`"4MpR.Z*5/\d([E`^9!=8nbNIZF:.X80=q(bfM+$joLW!S8Rq?TbMU"gR(`- [*LKTU0PeBQjM!aHal2Rgq&-nf&]tb!5*V,LjJ0jSUmq.+LWFp7k_03`Eeb?o^J(ZMUoVUQ oED13#2H-!oWQF@Yfd`cM\(@D*&C5U/'CU;-E(hdLd-\LIg29FK1$\EZjKI5]Z\7,bIkR4e A"Z;]*fXZSa\(bX&O49DTsB!(I2iD2#K8"X #To>Q)EL-pjHSbuE92UthO'[]3OQ/$;tltt-m(p%gu](BurfJ!G1>=A>9a )lK%jWD!Ye&Sj>a/pQ+PIC[>@E6mRdUab]5\YubG"=.$;PBDt4GQIt!)KXPc=qH3[A'bRIn&"^fL@?WIVDSEV#FK[7KnJ#CL54E.#E=6AfY576in04M#)G>AfO+gf$r1r)c>AT>\7 (%-&(^*l:9l1#=A8i#BX?W8KTJ,g/4SBG++mK9_j3aQ#[5>-\WmMcZscEM%bh^.>9seW"VF4=\qE= Md8^k7Fgg%U>=QjRgSGclXV_gu6l#A6(;+[Aco/p=+']O%g`T\H'dHU&,MZ;;Qk2fC,ph2< aM4JF!n^A)XXV=;._J2$>idQmm4R2aSV%NZ;[K@S!'WrUeC,o7K1JId=@\(!Q;kgqh5*cJG YSFa`3M4_YL%BEfP-(g;Uldd?6#up"[Z0&QsN)5"1UsX,t:J^kgWo&*_8ts77g)jkSlZW?+ '+VSaRNmB*RDj9)J%0!+T=eiEoUE?X"TWLjW1`a^:>/hkg1ofRa?FLK2%dfG4B/Li!ec+PnV[#It"YKU\ FXID*?%dqWM%noNSh&HT`!10B!NhALXtO8RAHXt1@3]mI.O'UT;$'c*5j2a3BGt$%R:DKO= fn4I]q&ZO9*Ub>=mLa&TaQQK_75)d=tW.q3*oc_VIWVc>'6c4MPdD$>2$$@>.k4&ZE@#nRM 4XE:rNrUos*TS[p)#&gIf+/e[X@^($/1jL3:&][TD5&]>isG3odF[XW13g_W2J51e-;7*l]L eEIfF_g.8VY^*)a>O3@DJ"=@d^%qGQ>:*0s6p]A!s?ZX[Vai-"N\)0k5e6Z+B1!PLZi@WZ" S@eXP"L4O"?i.g(SEM9\pk(doR$$! eiePrc-i-5KN&oeF*nK*Z4OpZ-*,k>"_nmJt_W,r6pPj?'!EhXFQLc&UcAd(FHC:9[Rp71^ Z0(TT,bP5V$YT7PoU2s?DF':Y?4q;XgV/qH%"3:qsK1bF#aR"qeo-!%I?rMY`Y%mu&F=+2" I[:)>BE\)Y#.RP5+Dh9FJEpgXCQD*RLJ,LdJ+Bcl6:c>*i*u7q:pOh<#2iO7cREZG_KAm1! SCh6!"S@.=R99R6b!P>LHO/mabGUR!p;DUk\c'81i2S?m/0<>%QjARdWS6G#*:Y.5md^55_ TEnQURWcL-mr-s6ZFqg0@]iDVTFQ#is5<\^'>]G3/IM\40ffpS,6PP\B L!GbPR0l%**AbL3N:>i,S O#ESZSOI[Nc):pI_Rk."ED* B>b.u`e%G]i@p'e2Am$Z`*q%AKMF*6N("s\A:klIQ=e1u1'nY\8LJ,FQAjmni`Rn"bN;_@U r$t)S'>RZ\^^=o5Ft\!8C[d`&rKB1kqn8t2OR@;e7mG_KheaMXApcNHAYE2Q8YJg-T##@a_ %j3m8f]fU>9UogMRfhQ.F`<>.;hYQR2(sI(s'.(d%^5"bsm&nQ;;n,9;]ZVV+_Rr`:\!44!9rHKUF]uIj[kds*iQk/@)+cg7.48:\S_i[X^Y`peLrNkW"Nf\E3;f@ \0:g8LF*]tJQWL0Hi@@?Vng`@AkADg,jS#I =W@tM!rtS_/-uEoE(g]E5nI9A#/Up^,mV;+N%#)N#*IWk1<6ZnI@A2jekR,qGlD3?0g&AK7 8[l((WCBQ>o?*DS8B1b&YsOga)T=K+32e-*%e&:];c]d/_4\u8A5\rdV[1* Jj'J0tcd8Xs#8'u9Ib''BgjXj-5`-Ik`aL(;f:Ip`K78VL!"\hkDneoAk*]1iA=4S+GAQdT LX_h:o(!Ul,f9P`O?aT!9Y[FFUkVIc4Z)8:6_B: 7%lS`e]:JXI?bco,Oimihf:4+'j7'e%oNV^I32U\4GH<+! "8d5Vs!pV+2@LGJ"P'`rnm>KJ.N1i^VPRGJD5']Xj.).d@r.Cf[:POOCSYOCs\UJ)1r@mB* e!Y3!>UiKFj"P_Dk6r@72Ap:nAE=QrsgUF>488BKQGaX;O=r2hs*H*CJJ)&)l;0LX?GO6o^ /<@RNV@;'$j>&Bk^'BRLNtOB35bit]afD\(jc2i"Y`(Lm;KN"M()7TdPGj!8;r_8o*)nE(s MN,O_2_Dt+gkoJfSH&g;;3!TH_0S=Ur(U=62a=.E=j>;Gt60)DX;"-1"FHDXU7S664/L6&f C_$UN49okM-Y3.HPS0!R8m+M1_mH!EJbWK4E]#ADJJjb/^0+*,2FgQm\KqLE6OMe@:PoRsQ kKn%9Nd'(VBJ#LKc$nVadk5"JQnR!5%tb*DBd#$i=TMh.o"IZ2kn7JS5Y*QQ]iRQb\ZJto; 6\+\_T<"nB3SJ:3o]=m60XCYTN!m2@AEQE"218TEaoES5[$ccK,?ooI>Mj\fF.OKaA/S#k8 s'b^'eVofdJ0N`!.NIV%1T&;$]p.-2[FWBu]C1nKsTJM\ta&Z$SEpjWdIlobOIiZ&":AIM" +:Xqm"<4*(+<'$"9R<\F?bZVP@B3*KI%AOJ-!p9hD`7Qtd%L4fr# [01GE("s2FV[(]XXe!MC=!m&__4W;F`#EB/C?aP)WHIX:ft+Y0RC$"TesaK]]GH Uu?#iHpW2p>acXO5F80a3TQO#J`n2TIrdW:_P/9S=,Sui5lPG^A2>EhDCmUaqFdKm9PX[c \B5s$a@J`k$6#riKe0$d&%^KBTj)cL2Y@700/28l(,hEB*_qe7#K+&T?D%SMijGbkZnLgj& BZNOh*YF]cEkiKRAh8qERT>$`2oRQOTYP?ccG*VmQYoP=#CL8ps@3jR@@'ip\s`JU/4:^qU ;/pg$NUD(W0.[+ALBKb;0b84al=QUB>+&Zq,R%OFTo$>2/!lDTLT:I ;#2'GpbrMR4=c)(Z^)`R872s\-B"Ia2oY"4)5EFG@>9A!,K52jXrNJ2nlk(qcrg2fVJ-Pb" @OV,R*`'[s-d%BCWuU`3N0>8WH6dgcg$!FW^8C8%/RT`lK:a>h(Gac&PP*`/Rtm<9gGX@8] j%P=6j.'8.(K43VUsh*M_D:F,nMiqaW^74e,o90p"*Pf4")Qcan=,mG7ZZpDh'b:h,OaM=J oAn3-m?%<4uXYRi?(,0V]IS+5P,DijM?aD-XKgJ'bdSFZjLHk-hG3CZ9h(ucXZqHkQ5r/[i J@n9c-!KJCUIU2YMJ(eK&D=%5541j+=o3P4Xh_@WAb@u%ir1BY]S_mjUqIS\5`s$u2L5Fp*Z%gDk.-h6\7Zu:jg$9Z?WeKCpA.*<)Naj;aDiJ8%Q6MXE=D;d;W%r h_f\/W72%BS(`/COc=f*/7sc)g::/F*LVmflU'c=+'k5i1;`b0VQFd*340&;8F?(=DLq#ge []/L](%R*s(d%q0k8/O#?eUss6XeB(CK!:C?uGR\'K(X6>(nA<^I+WD n,llR2.=Tsskh33,fhh+(c(NdMXUhZ3&*^0b!Qa$_]FSuhgb$P%&JYPU)$bu!h+c\]0dRGe .,IPL'OdLPO96/933c(f+3E"j@qmpi!oRL]TWT.I/f`iT=VXe;U*.5^XscDi0]NL$j&'XQN IW9Apcm'6lOe[5EIpIW,!Z1?*MMJj.X%_mfbpsE)=H#n0q;4'Gj&#+kV9=)`39a1.N#=Ml& M#Jn\e-)\/T=\*:Bc,m]@;qKcRGO*V"[oUI:_?!#X+[)A/kh1%?>oJfZ*+;R,=+1'Je@#p? M^Sr7Eon)XPt)'O#?raj(eiB@Te&fEu)#`kN$02WriT!gr1)Z`nqchJT5llJI2\)CL/Tlpm n3@1si-1X*-+`;m_+9ldUpG-_8noXT/E;+:&pTf>E&q[cIL_!lS).I1`_#5d;B#d4GuQ(D=(m 6/bERnMN"b.70e/VJ5b\$2U:^"Ve4='ldMI1dONL?UUR(&.rM:mO]4h=Vg&a57l](.Rp5=i >p=$7cX[aiF3bb"r1RN%A?0-^qLJ5NXgV\(if3ioT`!)R3.H48J/@&0s=2HZ:][9'aH<11p n;;\K#/.&-3gj1!o2baW4"&7hf`51so$/'HY*]s0O6j@C-s&Rn7^m:A!nW+e0Q/"%(N9:\= `b2$E?@^(t,Z0f&DT2&/t''H#d]#7mth5fY2!@k'>f;Pj",U#('KBR7MY*[/lJ_7CKb'2k) i;Yc2KmeJD(?(jJ?T'gV%)_ 6+Tt-m&$d?M3f5U$4IJ1j *;.k%5N?+:7XF20M8qo2R[^D)QQ12RZ;9J[Q%rW=ZCZ&+gF'F+H;oBfK.132kRl(3MW3,rq 0]BCM?+T["&KKfW&.B].ST%7rVM[0r)0$kp@9OMTlZ]`+GLZ3NOfM*`M+X+nWM(dU6)RB-R7ham)hB&*PfJ)\m] @:(9p\Y&1tEXtfj?';1+j=>aSJ3ECAcAX.% 42/al;6u%:;&>3H@21pU'Q\C@_D\sh3!L+:pcWPJfL@VNNoqs?cH&$Wm>-c9QiK=^Z=FK+A >SYSA29gu#d/;GEIlHgn1COirll@Sds**F[34(Q:r5BfAM?T,M('TY?#^p-9&&:88Q5)28f o9r,>8;E>Qs=H-GQq/`@e_l_6+.Ckc"'aUO7kr&#Y/Ek;e6gUAFjUUi7J?5"qOQ<)hAl=(@ p7HB4gjQ3/Gg=e!#u=GA!lSBK8?+^t'#f)`i/'$:*E]9hRQ">1N>C41;&Q1VX@,[;-P[QLi =e'@TDp7$k@*QhJaAe)NWXf0:.3g;,*JF84LUkq;o-^qLjoLP]k.N&6)&%#V`g%0:W@@(G"%O!eM2m8lh eONSa8&3mo6(`?;CSA4UU"U>#i5-/dOaNLJI+g0I,_^JeO*J%0UZA!Wi@r:'SYWX)UrohR5 scM,WD',fHIoQtQa*E&i3$h\6G`.5Jbc'E0;lC+YQ=A<[,IODM5\"FW:0ZaJ[Q9nj,=`+WV E6;_57nh]mkTj'&[2Q3%M%S-t$Jl(r6EZeN=m=e/Dc8)GX_AR^K2n4;kt/$/"jP3'XQj4SI DpKUVFaHLr'U"pLAoKt@AhlfD6;eo*jKosf!E\8AKY=bg"XL\Q5$q^&Nj//TN6>;`lo[D,s +R>G%8Z`hu;qOsn34<4Hc'`n&->*64>=>M7V=IVc`pr/3(B`Xp#%`!4H>BPq;G@;YV&AVKP eT_:]M?B`TNuI7>J\2U\j,_jq\bhqZBPW^?&\=I5LnN$!6-'X'nX6p2P$+t#R4FI=/\JVOP Io3K=[+q"6ISXhB\&0.2O?K@SI>7%^A2,NPJNR>q3JYjQ?Kg*PL9t-8ShO^Ql1Uo$%nV2gR ,O0D;c9BH(St:.DfKd)tXH+*&YAeq*A/sS%M%VM:r\qVB+Dq`9SE);*f-Yg(hH96eU4c*+b ^HB:^Ra$j4VCq=hpLF.]p/a5I4;!OJY)YB>%m)h@Vs!NUBFBqbHqU-,-D*2FG0r#!"nUE$P ]r3YW*3M[QTbPFLE\"Clj:ei0%'[b/G4Om,o@A]K'c2?A!@8%L=btoQ-)8VT9r3O^S[RL;9 *c#]5*bI:c/+s?4$a!\d,GEm4JVp`dq12WcJ\eK*i9et(f mo!P\iZ,+3pWqSa;5qldTA%N;9b*+9nWmDNjk4-Y]DIp6s5mc&^cDA6i7&Cu Qb`TK_*3>#r#(n")\DhC%Pe!Q,]A_ji[G'GB5L5K$m/lJj!%_5JCQbNl's`EY_LQ PuM5,K?>"`nY@s0k6g.nXj.Cj&\O^9nd[t+QPY@jOt&5Ts::P(Wq-#ao;8.56)PYp)"L+c[ QPQ^D3Z:];+7(bRq&mJP$jYae\qg)rXI*+h=GVa3D?ec9FPbmkIVSNZ@$"c_"))1m/V_\f4 thp&AIo5@cOcp`BP$d@IW<5B'dLMA!^3Yp#,@J8s)2M:\UqZFilg96)*MafO4C)F8&a071Fj0A%6K%f_7!@Bc,H<[Sc@a(" S_UbKcRLDj`Eq/!qcrZu!E6Ws?tK1*^IMO:1V:]p8IO6+164dV6e&Hfj'A/>J::kTbn^uLOqB9$MBUC9LdbVp&"Ylm'!6 h)-O3"P-_hE;[[<*9sTZ%QI%(ScXa162VZD]He0e9`6,jqu<)(dgRX?c]N8N?h)9<1>/Tnj (8\(IK&C>Y;<7XXm+ce@R9To&RV?9J[s71JC_8YVQmr36k/7ZZP.bc829Z4&/_j,$UJ2R;c e7Zi'be:imE[5g]-L&OTDPAJ[j6<.u8^&Z#M=7$0m^020h/eN6N)o\Dl1<)j)l;3n"T'QQA pA)UKPon?UPe].+r5/4<0s'/WJeU(QQp#Ua3%u%!s5*mWCO(?oZ#p?TCKe0c WGPi4M.14jlK,p'>^%L;F'SH.d\S%@l2PX,p42d>S77U?BF7/lU+R%4@)>2I2td9%i&E%gK 4%eN$\[I5ePWP@Rfc82QIKAEu?hfnA3APD 4o>=WAHkN%Y@72A8Jca@UOB$n))H[a_ZDL7]8\F06kn[i^$k4cW/>R()@n,*sH4;A&;kXohW?PUS #r-'C*npH3Aa`>&70?nNj=ZU10j\`S8FBoDIdr`8n8_%q]?W5NurHD^g&4D)F4qVC^Dqt(- f6c@uk(+"=2`^kkj*8:-LZNd[?^'Vtrcb."qL44!T:Vt"gN@je&__T'gb0!(E.97Qo)*tre +A'<3J'Pb"r`!ZIXe9]qgSRcoDO/gkPP9Dp]1:`+MSQ.OKfHi%0Bp*$\7_)"[M8h"5o:l)W Hi7N'Sp$+N,1N0Q%CefKf`C@*oa@J8'plbmE?&."tL+(..dt$t465L(MWL6We=;+k/H+E98 3/pjE]^d*rjtW1Z@'!kF*Uq&Z<0Fq+Or2F[suL_08179Hf+U=Q8U2[1A@.eh&o;9?0Z+[f'O$``EYsa40FV@e,*d2W&Ba6?/*3!>(a9e+Mt$oRV 8Ts31@ALBfmte''Yg#V#%C8ONAj4-Tq8PAXKh@,3qL-"TpBrcoV?7J07,!OJ. CeL7%fX6th8fU#l&Y#TuVa`^#+ZEXk>8UJ,DIV'D"BP]$jNfQ.ON.]%n]QI!"_UY-B\;c6Kj+9jCi +m4WA`9,/4GN+=+]29:<$,WBIp=LSZ3,'L)lqqG0?,W`0%J XeN+221laqB0(#0?F,Vb)%P0)B-.D8fjPd7`%@VeL)A\njTNL-\p?:^+m,CDe7Z*53:+OOu lHNQ.\&V4mr#Jj,.2@?cMq]Ac(_K],g@=0MY0X_jHNZH?SCdEjH':ZpbLCsi#-nu`pXi6[2 (HX0TMd8l7'-gN741oQmn[lY_O'<]5XFBfI#"-I7(EhdY`&brPbC5Mn5`BuVL9d*b_g,<4j _UmQa+3q,))EpWr5"bA(1YRVQSTAMn2lCFr1)6"2J2mCS9&Rh/0dDUKiqiUAXLUSTcR(RD# ^/>/qVFg%mr^Xa>HC5B.G5!ILhS)43$]F'SB(aL5cM:F?Y0m6JO>TOX^iNQD:7EP*5*I;5n \=Vq#D14%G,88%"Yfes(VL7ropaUu&_I](Sm7rHYV)p;)s@K2$#bOe9X4WsTa0=R?!WZt5c 8QLcS:9O4p2p=@gLRq?&e!<`SG.";@e-p7XjSfW\Ehj^+EG&I,f2gAL K*Qa:hi:PiMJHLQW!fkbB\rk3`P75F+.uOC#(ZdU!tVsMbl;7>t29Rd9kD7T2`Bt9<'jIXB !!,e8!N>XEB#n<[:]a_oTWq25Dp]Oc*GED/ZR7e$E+>d9N`kK!6!e[W_Z+gf"*(Yl3/K-P6 b;PN@t5^%]6bq^p`BXdHI:(=2c&3i3(RM\0^,eoV:$j=P&(&,dHjFC-b=XgP[M*d6Fdl_EZ \fX2X`K7\E!;nM8,?&r h%0MMBPeSZ&ee%+86X;q:5]$:km.6*WuPL_]D"+"Yqnqinu$01-.'21(K R4'KNh>7CRD"=P*F,@SKJ@7-PE6_l_#.T!u54[L>CU@]JDqH:`:(,hq)[e)pT/4;D_7)V,k L'U&AEbGYb4FruG2iLAI]6FT[H,5^`TQkM^+A[d6GX3;q`@OqV3d?FIEX&%/TOW\S,DWdF= ::4%[l]L:]8X_HNQ')"L,_MN;d>&"4LKi"\L>qE*+TM?B`rr5\X[:mP\<()BW7Jl3Q%E-]P BO;CkH[R#;AW[HcV7]CP6(]4M/iL"/IE)VE.\!&::<)e#>B]GS(=`3kME'_Q\Z+4U(\hX'; jLqlr3q\-*W"WP.f'>Q^%N(D``'U-Br6c2#[OY%3 o/MkL?4E/=A=q@EM8ScPlEF6B=f=_PdcX3%hj9FEK&B)2X5?(q UqQ,k8o1@flf#Q7W@qe^#"&)K<3-bDR@1)RYNl.l$N\!NYs/As54l/()6F#1@kruR^uVstC q)as\JtG?^RP*n]Xph[qOCY[Kb.u`j8_F:^e>WmKc!aCg]Pbli'9sA^i[T3KZ?cFa?G\_"m Btun=ta-G_^[WbD`pSm*Isf8d9fWbf%t)4Od)!eP0/=#EWm/A6-ORfhIFZ7,X2^^f#ei5sa .9"^idr`'-p!iBu?aZu[kE@&5]$82QKX"__WSfJZJEi1WDJKch\]9JTA]m6_TU:fB*63n`5G;:bm4?g:!K3_$)h]p:c\i#CPD8,#JbZ271`<*&IK)!#O$#Y5WI#eQ:61(; /B@E?t'6-%n5"e7H@b%]c)F67f^nF"5"+0,!J"Dm`rUaKSVA&HtcJQ,Z7b$`h[E?XXI(nRY *jL#:N#nemAfLd2c:_8:6b8<%[l'KXbbhFJ[O4>ZKRWe^8l!-pPF/@7lrQ 5"pg_0fXeAk(DSiL8h!f?r"GcZWG;@rL[7&+kdbL:B^46'd,so@tXgq:N`R2?)Q"cW&=5B=j>O2t-@nt\< (/]H^d;ZPsYT6Tc`DO%^dD3bUn32AQ@0=RYg.9Z34eb:\h?/`a;H.>blBfq@Csn@IJYVK3s=JX"#*&r?!^P)"^k(0)lB^SZ-01:P#@BfiC9\&7^CG)rmMj+O.+E/m) NNB9QmhNd+CSM%886%Si/aM7FC[Nf/`Z*mf_,iP30d'3p-u7fH+m`KWKSW>,[NnqRi1:u 9m&h^P[O>U(E;XP%g1a$H8GV!^g3TY]mDm!:4[TW(BDQ$)7L-Rt,BKZBPAr&%K-N 7F`BT^ZO3mc5\#O$T]53)-n#p5T:TJ"t*/]$3pBt.P]"5jjTeo(!_&I[N(KCB31#R9fh'I1 'U;@[g:dPQ]_8:o-2kEd+BmWrN\*F1)bLA3q7*h"ZGC4ot\hi"7k-A$84gLrb+kX9[Z?/R4 Bis7E>OD+?Lo-#t)Aa7bo4+n_Wksgs&:H3E@8*P,W?QJ^> /bA514`V%%6$f9r2aD*8qs!eSoId!43o,MjD[2m@oP+1-]&r8aBPM5jK4m[XG,Y&YWcZglQ j>SQ5\4?#Y!+W9@*T5>mLSVj!`&Yj8c%CTgrXOCNnNnng#-FmdZMq7(5N_X &':a9/Z4KOmpY2E7h]*#XACA& b-?KHJ#o]Y8([dY^gCp"4.A.9d+bmOp:DIK3oS\O14;ARdo6]ET$/;j.CDRPm3UEnh3:7T- S(l_.Y8#nn*RGFl'.k2%b:mBSS-Z^W6Tb0SA77?9cVRkooX'br\-EF"]9GrfH@d216?%K>` [hNg>)`eJ%[ld53+3$bUAB)n$F"m"#N(hK8eDO 8?q3rjInouu:'4lkL.F2p+7)V)Z3*4s!n]kp-WTh`nUD)?Faap22d>sY>^p$q"6a4g(\i2% ERtG(FuNk0]DD]78qo!2lt9mc!i`]-JO(Dt=;$TggHHh8&D2@k+VT]"OQm%e8S$b=7jE$," F`c\P"9,h3AdU1/!J.f;X%`+AMKWI*"!G@Q2`q;:M8/Q"U9ZJU/>URH7Si8JRbpFluih%UJ RpiC6a+9B!#7<L"bn4#=g?ZH[[V] RkA.]bD`1;.3A%,<1N<-%:,aP_bN&2>>jc5hV:"RM3o*!7=0^NIE?&gPr\MORnkl%*k;q!G fLQh4#m*1/)D:i65(?q[ht?^BIXeQUr;aVE)ufuT:c&I\_,*fC"@:C:>[`[YfnMVA:ol;X6 P/$1%`:!u3=nQt;$n-XA2n9:`A'b\(<)D`:hc5*$b5QEdO ^LJaR3K*-`:=I?Qc>Jp -h&B7u7ZdTnRNnbTeIpefBf\fbRkYB%](j R:m-3Z$\]c`T[""gD8>GD3r/u*>%"&nVfki:kd:$^d37_8e,J7-[4E+L#mX;QbDR0hUg8kGa!JlKI'59Jo3Aabbk&L)4j`gA+$\3EUG3m$N9%75eb-Ug?.eik T3p=F_bi+#&nT++hKOD:J`$6.pPIi'^)r?qq&Wn(k4r=4)Gh2;8JFkpT!tcdqW*bQ9,b`O! L)TT:W;o&T0LBgr81OQCQX8cCRjPeO6QK>hj+=LC>`M>U!2'`&JC#&75Y)Uji* 6S>O?Nn8(`NV9KF/QKI!M^d2$W""*J;<.HOlhI"^rYhJUuHK%>MCA7YkIa6REU:#[\!KUbd bParEcNEt.*X4bo-u*Q/eC&>B:pLsXp8LiJRs`$!,1638N'#bMf?TP,e5PWoRQ_B/t%>Dob */-o[='SKl2N00Pa`d$#P@q984dB5FJ:oYb[(gdr/,!-3Xo,bj2HB5?%5=cXm+QNBROAZu` 89kpoA7U*!,62/qSmM>&6o9[5 I+%fpe1SCCehh;Pp7/OXW^HXON]&%3]U+ke.n:e[420FL%H9RWbjAhRZdWm9Zj4H`tum1 J&-?1.0\F)56+0%Aai8<=jHt,CF&5iVGb&Fd98`?HcQ>1d$Nnbb;$o<%=_XXmIF0[*$m0LQ GcJD.:euX%M#JqdjQ/En+@ZG2+[mFLK1#H31KGE\;*jE6m1a&cjJMgm/1cQi5+=`J14fl'7omUi >?#*/_YdQH;07tBoD>5-^@#!guE&2o\=?d$LnUfb*CQ$&s?,a>J,3^*]VSedN%q6M?Ltpa` F\^?;4)@cOnPIIC,2)/>(R^5RFu..jf,S9:U@d@--M^+04l%&0h2?aZWWnWAs2XH@2<=r&5!X'X83c':sOme'0 KoToau9-H-a%i5=??O1./!rMLhS$L2d&FK,B"ROaBVfbp+%E*+=eG[Q%ul0rEukSI7bd@n> 8h+uL^BeCog[C0a^l_jIor1WNTn%:qZpT!?k8hcS#MBeC^?]@Yd2?u+#@.YOap)Nu(Mm#@8 c2I=Ln!XqVZ.AO94FOQ`6?>f.u_7$elgY:J)H&lD0RZ%O0*[AF)CL,K%G@n;>e$M]*nWgXD VY/g#hgB@5ofblrg_dJKLi<\G^pk`mi5SJ[f*X=NX*Lug_R(fDMT`r=583&3WpTZZTNS"aoUcs/Yg!Z.Ad'?*?`9(6$'h&]U33$c@d,M%T)aa8+oYS\M [Y*oqS4OS]t@S2YCc2e[%X[^?#+>DuDX#]6-;[[nGVG[D/i7IY^,$ZF*jT-J6-qV^M7@T0b>@G:US;\J7r8JWKa$gm_2cShu"GX IIH"kpqImLi!.Q^Y[.Y3h_t^mnFM;PhpoR<9+569[J!jHOMmNE&:OStpjXNY`7V![@aEM]6 tinEptm!>+6!.fch)KBmHm&6+&-hjdp);!.pM^bfckQ50nB26r!Xu[B9] #o1g_g.2*ffCc:c;6'N8jX6U("jF)/TBX9`G9U!sNXL"fR@k@?M(.$lK'!&Aa %JE-BZ+HI@d"d`jVtY_<@B30"!O'5^Lp:mVJbRalAL$%UG=0*L+ug>-_K$P9KL:ol-@FP&0 ofPnS6:r<]mL(Bt3)%E&E9plHMSIN\o&j\Doc)@'?WZqtb%h6&[9tq3Xo+-Fh*!+J/co&q@g)hL5gi3W5;(!!=.h^5^0C'r,0(fm<%hl)N'@%(+TgT;AU>`@P2kc0D+ D0kX>3Smjit5N)_6On#ob.Z2+$ng*DatUtoNe-P)keMd8otE6OqF@'o8bgJ:1Y;_P8T#t6> nL>&YoLpM@Z@J),?#-:59dKM]6ZL)l/'VEFg,P?onC`(1=`gdFP'FW9Z1pl]L,kdGl:1k8q RM(kF(=JX."CNZ''S$j2G-8Ko1+^_^GM*hh(2Buq.])^3WNTAe9;_-[lDq![c+n'Ws/i9CP C(@a$g,LSq)%i>hM,4]bLnkr?dX*OjXC@a0MW?Jtg@,Vp*:F n-K(gN#D),!HO?Q%t)*PK_Q1KB^^blYY-I#ZA!hM&#"aRlkM%6[VeY$qTKpt06YaIciCk8i4K UEO:,Is(r3G8+M\O3KFHfH(XRF4n9m8e]a-Wgqhr+'Gj'")aVsp;k_PU!D=*u.hj^(6PM(-@@e..T'B0M6gbg4!4s5U@ iWuo7*&@/i06Dj?R?AS8.hIamT/J4Vb#*L6fEn5J3 Fi:$jL^f8eJg1;8Z"g_!(Df7's6ZJW:C/BcWF'8s.pNZ/nZDa%XnL9^]&#!DfnI.adoor%ctP8RDU5q(\$1/Jo=P+Pg= SG2TMpsW)B/,[\Om"TPe/'jn>[?M("p271R=ojI2P0[k7nJXbmm&TZP`"0t#tH7T(.u(_Ch2?P=dfVrKP=0jiC&?h6%)6'N@*btrQnhZ ;mBp&N:b:KV5,=L2-g'4#'J.Y_nT2F3E4PArNIMds1ZM`*VM_1iBW#T(:q.l3)CQ<)FtO#^ 6J#e"-iNBYiJX#`.W3gObt_"nnT%qjAuBClXH&A"*IaZNM:Bbl`\_)<"$XZ_m"C(o-4651A ;igIY,5'-*U2RdI&]0B-i'>\c1F$LTdc5a9JBNESq2V'F1@N0m)@2@m@RIqH9ET!&<7,rTbB UDCGmaBb@1!,I"ViI3FXMW^jB)C4;`F;HE`>A)OX9`q634/#+Koh\$WU7]-ZrdIL`@2E8F08e4mS3n@6CBi^4X6:];0>j!8YBR:[q25$#GBSEG8\;F&^7#q_4*/TG^#.A=-KA&O%fY,&7@1/T aV(5S-AYdU_fkRQ`ZrKMAID_:A"-R@JCp@1S";KV?J_0_]bIMf6t%B! OZhXn@=a.g$,OlD31aZ3Q4]C%M_(u_3&cIl3#@ j2NND9fXS%8A;r*Vs"_iT#c`\['quMC)A8]#0FF4's.QlEq[GsR[?6^4(cf>-_cTo52(:?fH!P1sn!Sk5H)B[r)*e*%k[X)'O.&3ShZ@10rKjF.flXJK>',o>]JY65f_mmV3U?"KL'jTY,iKr.E(Z'?!!uXML2 :^m2fPh4cqZar2k+]V\DsKFhNL(r6ae6')[D@AGi[Ug1g](TO7cO?3KE(Z=Kt!O`bf]mL26 `8'Cu6@tkf%,b<+V\dudJY!@jGGlF.I[pOC)KZ&BYdXCdIshpV95UY.6`G_S?%q+RI4)$eB <%E&dfq!7i6o7'_m9%_%skl"q`]L5a/n"<=84p\:Prk[ToJh?#!1M@rF]8oVlkdF%,g\q3+ Z:DWNUXHYF>LD/5%U"#D\k1`??'6HPNe+S(W@_(]g]XH#b;0.>bYke/^b[!MU0Q2m_7!e<; >>HV:dFag@b7*75#:IF^'FhmM:aJpV"XB!Yr.CQ=TaNkiCfZZ!>-K=DkUhqeHri3g(G!#Ru D&0ZW6@/Z3G=ci>_\fN*,p1DenYN"lc`?9OLgPb-^akoQ&Q;a5XQZkX_H_V?T/? D9:!-3tT\_dH`O=0J,6O6bZ63MGLS@Ai@!H6.XG)BC9G]drK(r#=T@Slt7`_2o8EA]FZj`r kMF=&S2^O:WO3aF=<5?O+Z0_8tKLbf\+u@)_FDg.NE^aulZo(QWicRLpZJbPsBB?T$'!\a_ /n)o7aNJ`7[NSY_f%m(ZJHD>N/^0@(X2p'#=OJFEa`!VY=KIV$4oqMileH)QXI!ou_JIdS* T*XMbqq&\8$:K)gm11FY:#U.8$+Re&jYSeT"&KSb(P5hlr[Sd[mh),jVf =B!e9QRiZG_>SH,HLoaI1PWSoruHgn)["aI"N@)8K2sd+CPHpH%gI\RiDA0#4rFoe6t29jdq_[GLG!]jC /og\(RIJ\ba`Qs;N=hY)D&Z'N!Nff7VEURF2*Y#?p?b\#QUA2>pVJn4(eH7^J99rZS+obu( USHd1i+INDO!uSCp@hqka?0;$2^Ys-VS.7IgN*8G`&$07!o:1-i*a$DagD%MP@J5%rY31;J iU6L@;_:ujhO6nmst&4DWp9,'ea<)",s0l0o-7PTR/(WN#r&=Dd6@$eTY>$[Io#N*QGX;Cm;hS MdtDj7@.Rg[SDc*(tg7_q\T(dt$!@M6-rc#VV6Rh7&+$F IEAXY%a4)2=l7R=69I3?oRKYJ7+`[$\Vp_n%*EV[e%4 OHhQlAQ=CCLLiBkR&&N<+2\KYc!VPQq?9FM;Eu6/V2IDP2[kl;#>j">tF?K"^cubfp9@S(^ =&%7g4`=ERG!/u[5m%('MEt'a%iS%tS[f?\cuP014A$K$[s7_3d4ei:Iq@&9\W$pbFM?fFMc5BO_=0<7B Qc/qsf8D$_?%bb;@"LCDHK6[3eb=TI.d!DmP9:jio7/4>JMie)I08G+8,il%kP/3YNN$-Ig"oOpTnp4,)3CPB.%&]gr14X0gsT+g(0'LJ m%%!;M$ZiJ+m)@8[m0j5K*S@H:*)+/([%p%`#`DCjf>0MP\1QgOR;3NCFKG_ih["^fn.0+2 (87)oQ+>'((O\8G$/i`#.jW)1.F9:FL$\qWMSN;$kl.OWL#Dhjj8qg,<)4 9^.2]+6shh05Bn_k"?N"n6u%JaPKc^j:d&VB9-SH[B[2m_+_78I$E I,_JA2&ckC2Lu;nS@=(kdfEVC6(9#cPqcglJUgf+p4u.dF1N0D]$"4f%hsdc^_UrK0@D!fB >TMP:(NU0o[h:M$Lg.G,3p6`t#=]Ld4!UKKq%*+t_h;4Gf0j1 W7BG"lqeI6]!R9:N5?=AI--/3CZ:1*ojhP:0YT<7sOSG6Zd=.9Zsq4=fQUS_`q0Of?-O8Sb-\CiuD(t*'c^J*/LiGGM0 uHPKRaZ>;:$t##B'>["Uhl'Y):,X%LF;0@5QhNON9L^2?VI=0#SF`LOC"Ik'h?KTs$@u%O2+I*.*:q\K),r_@:\"b ?/;[eneIeVat+,%Ol; 2-GTKuO!,+7oK8e,%XOc4cm9'`U9sMSHIf)FDe(jQoC$5NDd8E-2BS><`bi#Om0IfQ%-$6T *n2^ha7`oE[^'?Q$,="Fr.[E(9sK!B%Jm^u?.a.MT]2Xom#\0QRLRdgNuk'Z"8h6#7:PF;V 7S!'ffg_4ef%-qjZ"qEMS-*4m/pU`dMW+gK6864qb&+@?/HA->F>1.rjt/18TQc.Ud>,pIMs,PDd!Z!E5D1]k!GEGQ!#:'l35_7H6_lf]Zol7-4i>3% 6e"<<"@'g=5=?b^`%43m1do8M7Dq;X`)K5pA4OS&8Aq;p7'IJZO=c4&DheA`LX:=%A+d3m9 =1Km['BB1GWUJW:dnkk`G8;hKNPW;r\RJ932S!XOeCGsXZ`p@WPj):^(5!)D[2b;E,@s>slGfO<=,Tp Is!'IopH_e/\2p6WYoR+.7IAJ`N3+IY%7"<8lJB/p=\9!KdXG"Y_Kr-h#Kt)^ogQ+maM5J. /-PCG.,Eg'JC.RE"aRGQ%+@ZIkDZjH4aWNg&^dWnbPf[0q8S"10:hkYs6&(aqaeYCtXII>\ QA/L1KJ]:Br1?RaTE[YMKKruL:diGoV+OFXb#iB`!-X*IEsK(Ob,hU8[&XCEEX/OPLB)VBo WUscYfd;\LA6%Jcts#H[*)^^94YI7aD?W^HZKR dM:5Xu"qF9^ZHLVUf\#YPEhl^YQXYdY"G9rQ3),BTn?PUTLr4//)kK=lj#@Y37r!pDcO42JQC^eRkkc=H+;j2/G sl)H#oW^Fe=MoX,]mAa8A"OLX@e'$&OnBW?)"-?]@,O3"4lVD'acZJgko@6!^f=b_kc_UH$ E(u$7CH]W8]r_5saY&6#8VW_j^$.O@6fLp@j3V'7ct*H`aEY;W1DHd!LIcJ^K_Ed:pX%G#L 'Uk8i+u5d&^_m;d5;Tb721[\I#!5n^N9+rKD&0-(X\X`"u&[NS/tPVqU*uAL/:a!,V-a^+j q"jLVS3@2&.NcEX+j3"OpqsSLDp?.E5(2YF>WI:1$:@E"47J@&P36sR^MA[QNYJBM*E":e>V.ak.B;QX`&K4)]1D 72E@"+Vd)1l]TSNetuV`lj^gj).?iDc]gq2Z'g>1ih34F2psta'SL"[M;Y^$7.(6j.a0rRcReV!jgWuh 1PIs`d.Ik&`OjmT%M8R6:UKrQ"i&h,q?0>a#&O?F7/u%@gBMi7oaj>aa:j't:Y t'Q,Eu;$E$psMhc+[HmdG*=f]6Ia`mE]'7^i'C<5Z+B3d>cmXXVh>Q;M.\-;< ?]Olh__g1/t(o<3>0t@I:1FfGMDJL+$3UXm"?TkuP4W^h@Y>TK!h108>!J!]XYBAMHX^>>l aLYW-0H+;[t1p!]3"duF+ZA/S=Bj5)BaQgs.moD;JZ5u\"S?fh=;(h!Oi%gG!]!G+egV+9H ="B9M8?`"(b7H0&p?%Z7"#,kEe$o+m=mt%DfK*@_&"e9!1SDbM%i>**W0Pq$rc^tJi*i3*` D-c+b;[*du!8V'a/f`ig=,%%]L%%6UF_''7ARZ?XL'TpBV.a3V0F$H,K2(W?L$>;UD+8[uU 1e?F:a69+4]r5W=R]aPA8F8d0oDfLf4Hhj=u_.R4pBk#"=Rj5S9&2(ZraAW=113"EiMX(9S :,gfEORm'RllaKigcqj>K?79nlc!7G)^8";k.[Ko=Tl8Z)?'^/=;5FcPJL:"_-oiq?,Xpln oETO)$;K&A_CrY&]e'P1#:m5:4geo8V1Qc\]WJ^,7CZu1\I\KC 4U'5=/pQQ6H*()]:W:0*%X[Bd*Wr?5"sq47%Y/3n1Bu+F/7lq.Y(YTMKj;oXBQ.;_Lj!>X\ [(-ZL-T2'-@08RGJ&f#&mRoNV d+D#VObJL1j.m.:%_%D$GG;hR4kJ5,@I##)U(/@=bh"YT^$q0OobA']4qRhfc 21L9KKV)63%9,!P!3+?ATa:EX1fF"\:YUoj$&0 )5"u_K;]buh-t5]*An[@"5jFD/g>/`+mnD6J8etN8/1?s0U].*C0m]R3'#uoB's/<"#qEY+ @QCH:i;qrL(HfW?$#$Q1Lj.&j#AoKi*Qtu@"T/7ml!2**]hou4E"Cl"56=VgO*N!5ZeNmV+ s>;5!j2=r5^KZA8R-5@V:=l:h5SYA<;`%aGsBU=le.0DQZh*LBm=7;-?A]M"ih1(e&8\c1' U#m+2bejNiPdAVP20#=*P>eY5(L?FL2#%&:-284<_j08(``K(g2R^Dh15)M6VtAq]1+Q)nT CCZ_N=ng>[Q)![-qDK93]B)Zf5#:T.np.k8LB23V_?Rq4o5-#HZB\tK,f.bO-*9Z1+F#Pl; \57l=D!2VQo5!(a+B/R-K+iqABPrOqa#inDLD39R/GBMWpfRgbD0#A*EsG%4:h5>@Ec_OUo QNgtLId]4jVB7'l!B]jDbJKNAd$a0lXs#XWQBlC97_i7C_j>oE-R./BCqrFfHK#YW/hb0ja89h[C!%.p3f,Y]_@uCCaqK/bq+#;tago#)HFb#>c4;[qh;>?jCG:i*] MD@g"b*e61XDp:b>BEFm!oCL6,/cOECbrdCK+/Ko=:DkSs$sIIR8cnIL- Di#;a53Wn)l((k".*n>+=?%u`LJWAFYL=pg5$_WpqmG?XckDV9;@K\Y'DAj;qE(>L-=nT7e R82kpk2lmc6DC(WH$1hF#Y"r/m7,[pDYELPju%kN1'?09K(qK`#G6_To'])Cj,A(**qoG2p *=d0j5rR:%f:R3Jn.@LqQBg"56#R+s6p;+K0W'hcNF%ULrd"tQ,a*uO-f@.[/4H3AKO/ALh qh$b"T9oGRqF`\%MJ?'EORNK(lSd\9%11'fjg>Ae&83/n9W3*:_>nENhcL[Uk'[h#d(0nZY 3)\7g>(5.KV'lR.Q#Oqa0 nc'GL#*<&2f1c3G9O5_V"ZSE,-l2NCq=P&:#(TeWcZF>JZNo8]ruchVi(uBY((C@p^#"b`\ `(>f3Q'i2#aA@=(Q$.@dAY!$4WTVS,Z4@WL.NbV8n>6<7']f3E2=%]e<-l9O=`68_mVT_>s /uXcU"uWj>=eNm2.B=Y3VhR`rXt>T' [\.uhjAFhD!5=*rccq1$.eDn%n6'&pu-NgPZ#AhP*^a(03.4F",_L(1?56#>+n2kA<.oNCQ .LJ+DkC3:H.5.Sbo`%.:qum)9O9?!n_ !ile"i4#O'*l@8KH1?8OIRm/5f";!.0eeQ_EJT#_=2iE03h3b`=H,HI%J@"9K'l;KO5Rb6h lOPNhP6J*Chj>I3-H1fnqtHAcVl>aO3J;,fu3SSL$l@CniB#;QQiJK&ue*$(%F>)_T>)oYE 9+;_5gBb`bH>1sM4hh(tE$(bVIVM=g)*cI:#-4duS1^6[+PI0>m5PR:H.%g&H+15F@b)b*] SN>QUG"$t(!%s5K@9N+pX3D\+H%6[Qf'cg"HeJ/C@7M2D`(0B&:KjRs5Q(;bpib?OR%iJhN0s"efX6,7t&hN&JAUCg0s-\Sp5H%D?ad"6kOo%n7#UF ^6q3h0.WkA`\-mGA-PVMrVX1I$fOGn6h4X_1.!nGSUUu'NOsRB'8XC=OH_+m(%Y:>:qC. q/(T*>?GFjplSJ3+l&Tq%%R]`WjeN1^PXQu>3]rc)hm_c6oVs3Jll2+6+[I'Gu#%O)+R$]` @5p2=>6EnK$]u'[/otKo7rrp/VS.?"D_8255/raBb'QtM[L>B8-a-$!XQR=.8c#Z#)4jN[> iQ+0K#8lH'S&6s1BFElMO4O!b.?H3EI@12jO2aGt4rF7UHeru'%tWXLAiR:_R,1&kjEY'MR HOBpO.GN]*hTS"q];ZClha^sM[u2)#K/fR5:=MBr?"#'6Ps9p(h%jMLYqn+T:bNHIiklcqu :$lq#B6e=q[mo:-/.W(Z7C^JC#nO5faZB@"]&B:c\qL(apAXTYqB$*+6Um3sQo#+bUDe&&M F;$)&UlKi"W^6ASnSiI!53&C).\=CVg!Uc=+Fi)C+=kTqDE5_nk6,"+DM&>DQ]M(p%t7+dn @i`o?;d3Lo4JWM>":u$s@C+R?6]bb/]>`;O/0ub'P)<3PV&AgtP#Jh04,BRmaiZ(c(JKue% "F#n]i]Tfaq&eYPJWJ4d5Y*mE+_3uoO]!5haI*njjE-NHZ;*P>_=ZgL`0lf[S:$C6q$ps=2 O#o\;G&rD.&B>.PqnpMO,6"Hjb0n);U/H==`#bP`4;44mTrQ>I4s^c_3ds$INBbE1!uN57T 1pM9Z`PUAq\L!;`\Yf)65UVZ8!9WO>7[u.lX@,PajOYEDBZY3Th9?0`^;%:=HO2cG]7D`TV (Fd,QhC`;)OupjNaYa='G+L7h-KJZ)`Y60L04TX6>):r5UZ`0bN`,"+/Ei8P-a+F4-d/>e_ rcu,2=5H%QVdgQfm "pQK1"K'BZS7@a]We&6k2*S!>>,Vj)=j]U^=Ug2?d&P )0SUHlDhAF+bX%As(/''o`V7,KgAWh(:d=mnP%]_Sl9l-(f3otK&Ys. A.^bo*]@k1nJ`_W[F*cs&Os4R3/l[X$1:lnaN=M^pUeX3abF6>.AIT_(.!K95XQkh)T(U6^ kg>";2!#`'p>9P)[MUJ:!D3N(lXPS8[Q39jW/*FshfP$4baC;!oQ[>(g73knffTsQgqFtBd KXCc.J&$P["_9j24?t_:-49p&@fip+ACu(Ygp4guK>>0U.0mk9Zbh1ZK?Z'_O]=.G,iC2cl :PB^,3[rA=h&EP=mW"sQ!sN)5eVe\nU!P^:NmurRpjWcn?7%6mX5I4fJm,;b_"]hp-"C==" C]Y"6dXs,J`La*:s:aa0LV`WDO"+k4i]P^*TS2lQ>^'nanMDV(ntCTmbQDgl6SaY2%Q*r;b /Tq(`O=/+;G<9'FZI`6)r`JX7T/GDsGXqjZP,kEfQVj7^0W;S(q/<+jIbUY57HiDm!lLniR .?H:HH^Z<,Or1P<1pZ$idoG2!nhd]aLm^!=gSDXH7A]pQ,q>S#O@r18X6NknU`UW[]abSd.pO7Pb_>#)]NSjX=J\F@j^oXn.MS'hun8ga,%4S/U4>2N)a-$6_: [NSf\VT!)?2S&jnpX_N36-RF`^0.=LGr$H"]3bVJp:m\TeJ7=89V 2<$RL>e\Gg*J9ckuk'*6W:BH=`N^N5!M4/HW#pI>lh'n2USi4O)52$DASL@5rFHoZlr'"Ro C:D!hhmO;L]FfW\ok0PK+#CBdKMdVUQ@:jCEmHO"C;'4FKOm6K.)N1-YQ5$!Rl1$%`al"5Vj;_"cY+aVf@ :J`/&JO[t'JBn0EBt:ic4GO$*C0rB;,n?n(%S#MVI,m#5(U 8T/mRn1QQPe*s%)JGK@%e0hcK5UQk&I49.Y9P\A.]qhkjF>lEOd$.]c0S6kqS;?EK;*EP8r iF)o7aNJ`7[NS?7cl'/ASiDog,ldKLaZJk4jJ%q$CG&fC& B)Xfn3723$mU!F:Y"WSH]e-P.g%o9Y\DnKh9FRmV--8./% :H#`+P$%%9\Z;=oKrHH*Ge23tol>a7/%T!S@jpeS.4*a[@>+?NoY#0e.PGmP9BQ"FIk(#k. kc]h`_cJ,OSNq4^qf.J!LW^:TP(>K_FuArc`\Y#h#$YF/e[%o-E+kFkq;Ps0.DDj!SAHPE# W2ba+0BgDu'bnq(U8*0_6"YciF-n$Sh,W1+]7'1FWA=/HN11HR(e%m)Lod0/Ls1bg8ES'1k $%9`sS\'!17"E)Qq(=Z,Ck&#"gh;eZ])D%1Q+2Q01P0RYmaJN*(J3%ZTl+Z^LfP6gP=3AZc G5tD^k[gC.9$8AeIE4J#k[6!o]4"2Eg6#dPNoP).u*s(ggo6!1%aZSsH&-7_,,L&=Ah*(Ag 4u;:aBk#tN\eUn2&2=+qF7hc(pmFFP'VNtoe-Q_l'0ts1)F86LOjP/ra=s\D+*6Y460K6gR j7P['U1C!1c7Y*4s!"e(r=c8TbeHN9bm:t("?4uU!O@DqA]MA%5'=?Z%YZPIn%h@7k.@QZl MZD)Q!'B5bfhJ%V\J=Vb"]`W6125i(Q&SJK(l18ee*@oVUi7`CJE"9/NnHFFGo0Xr"n9*1+0kN0@>5Br@.kB[((p!m-C$u#$]=PpP$)20oM8+-eQ4,P V^N'U.$\96moq5=OS2IZoLmX^mr'[khcK8j.^HNcEj8`0Zt,5W/2FnADjD$0Q=l-j_5;MlA s-kJil)Pb/lf;XUr4Z3 Qa%fq#>drRYf8S%NgK@>**'7Di@=_7)E%\Y9fPE0=^Q"J8t%tPT)o:jbKX(V%/BG7de2Mhe m-U"lV4f<$3G#Mq[SRiS/"sMbCiU:$;X_RR7CGrRPJ\E"#rBGJAC\G]8@Ajk_]1>uM5h=AR iLCX5Vb=D-(r`FB')"!ZZas% ^BmZJX@"rGt.N_7oqK:%S/2&iH+P1)*p^tP_DYmO*'oj!m6H(Y''tlkt7:N8iL6P[qQf2YB 1Q?G;jMcA$6n=(`hSX)$0FQ!TS(LNBQpZ+,!l.jCq@Dq0D%K%cDD('_cp?W(TB#:c/PUGI8 Ue%3hKp&;92Q2p!:2I#fE3Dta'I$Wp7Z&fa1E%Q2"*dbYc@)A3cP-?o,0V1U-GS@TG>J2LJ [CT1>ILK8X0>dB>ifGR`uaBn=O]p4.Md\I]PKiki>=SOaUQ'3`n4^".9ARQVqTpiga,/SHK `KdcYFh<@;=bZG(>W7^uG\EG;llT[0)St,J@5o06SqeHJ(Y.\TfSITL-lH%^?ZR#<(&qZdS R>Qmaj:W-p(q-q)2e#;@FcZ3o0+"7-Xt`E@i30okMciB*s@["A%"[_GgmSgie'.YC)H&m39 \b'HY(k"A[qDF'7:K;:)c*2O>_$=@CQmM-lR&q3`^rsG)MKKLQV:\*T?0JmWL:Ka;GtF7/[7oQRO9"*QG/HQ?>F"HA)1a[O[b$hReX#IF(sZ9.QZT*"^_qD k7)AX>_<)^\/.VF)R5`fIH't'e6lb/f&nB+(Zq56tX`9c4EET\*#Xdm?rZPl)2,OVjc\U3+\h1m@mV)hmLp=@D!/ fP_2\d%O$-8Fmk-ZPS8;,YrJ.+[L'4KT/%'-MVBG7]-ti^[>VQ*!k?"(Gf,K04#EV;'%T!O ptN0F9S#IU']G%84'@c:>;hdKO#ZsDHY!H@-57W$OAhLT9fNc:3n/uCB<\4p]8;[iMilbUe cE&rJa7(P^`FZX[JQf.gSi`_+;r"\Y5>W=Hb$bjW#\0k'tIJ[H!S(>Q5`+b%AO[B\SXVMEP 8?a)BiW!RL`%Y$6N^JGe:PZJbU3n4qN$YRCS["4:&>\`Y5$IT:%)MQOTEH*Le#lRs,\i+US c(aq161(>uV=Tah_rf1gBENi9`K(nhEBmX7\'"/"@eTH%r p=)Z%3lbr^Pa5[OJ5oZ0Xp`H!=aXQ_HU$&0bk9$CV%tI6I4K5+ZNYgXQ!h*&a)GSCj/#@@u (a04gH=@&oYS$rJ^q9galWP7#ndE%lXtniLTbnDGLOWlQ%NuT'!5]9JIAptN=)9s+9Xa^%n1=D rsSFq^RH)A(SX3/:hRC^EBnYum>IGajRP+4p:_@,!3;Gd5n6Q*U9CMep;;HTe^+S_:*l@p; a9\Cn6N>m;7K\p6Bl8QiJ]pU7cMgcK*YJM%f:H'"TBN'TWAJ[LUuICT77\D?8W4m"j-SI?: :+&"-c/_5\<% g>A3YY3l!)!F?E:e`?W5jZM,P+heS>l5tTB*^e>k]Hb8j-0G2Dk1h?qft86>$jm#u&DTRA] LKBYQYli+ga<6g[+&+&Oog; ,9]<916Ulj$sNY^EKt]W=_CjibC.bF\BR>ete#.N#3J,9aW2@,'caZGYSe483$Xj'd*='q54]Qn$mDT357o.BD?7df3cc>r0s #2#-"Y'*4U8!ES(YO<#s_e9t-_^PV`._#-CDq(K^j+k.RLkSNscYM0*8iIe@?CTsmj'O>jd 4aXHiIJa&W)#1#]h2D3>&_S1iZQ5A7>hu[]Sb`;Vr#c7<3 sGikJ\bb+1W#i?F@no/nE>O#,o)6TifT&(AiUfk7\gXL$uJP7D5l&[a[E.-/!in@'$6BPB/ ,iLjXN\dD"rp%:Ke$H"(YZ@UNQ,JuGa@[3hf[+Ro,4( LD`OB7BCm)_(6;%`dqSInSQ;psXk.@VN[;h&ZDKPIG5H-rmrc>!n+W=]pBQPmj)DOK;enZ_ ;dq%ASGnR:V:FjRqL+sECU)X_GC1FW(Ora=>8WfEK/]^[lLoT'h]Hd_iUlqoIij0lg\BoIQ #20V!A9.AJliuqR-+T<:eVZ16*Q"[#sn'N,76d,Zni',E5XaG6a6bY&OXqk6P@=W1fFi*-V ;7dSRcFMFV'3?B,\dPZu[3WEP-W=8($CI+\4@6HpWob0a^#^UbKSs&AdUs6\^bgW@>uq`31 abdc@_ebB!6m0MHNbb:acFR)8d9P?ci?c-p4\3DMB+i:\"`Y[6l^AdJkTQfJ]05YtDh#=D= p$%P;Cjrk-GR06&eAqi3>r]D38QK&OhmPf'BFES9,(q,+j*]FB7Y5.*2I!:QtBK]B:EMD`bCuUq;- 1aBDM7RT'1J)FBFZe8JYBfH<-H1l+2V@=,nP/?n;mY\=,i&HI6mfO9PEn4d[0(ag(3E7aJJ YgLepClsgV1A;iU9l+-5o`p^TYgZJ+AmpkU:0FpV`#K#u#2\X,LHp8RhESP18096;[co`-b Z%(!hA&gIPo:5PBcjYQsF>8kGa%t4X*EQIrFo>ZWf61GTBA7UCa(a@P6ST]nN9%75i-8Q=L ZPr_W#Z)MEZNDlEl-AoJjCCI!-37FmCcBO:[pn9f^%bOGH0-dhO65A#Y!Su83eq0 mgklhc#VRIklqB49:bNA7):$uqD[Ae6p0_2&_X(s@J,1'PJ?Os@tK8J/1%$Gf7b#%55JDF& M2%!Xo@+T*C9OH'u@-rC:Z9IGNjW%WqBO;A#?`eI=<)8fQr%H5epLQLX>_mk++@K]&RnF/, e_2AoF*(l'=ng26,jA0VZKhM_T*&7G,Em,8=LDEJ?5>&+=/LAoUQZD4p'liq3*l I`>KD]>AOj><8<0EZ47V>E*T/1#FWuFE0@a02'2J1InS!/#6:&2U[#Is(=V^ca-H-UGC7-g CB[,h^9/e/QJiLX\BH;AhR5%gkU)1nM-X6K\hBF8i&_n^39)884fR)W[\Od&\r+[bIY%\f1 WMU=I9M2.JK)(!ZI,:&/.dKLkk<0iWoH:^^68;%N6N'dg>XJ!3+2dkh#SqH^fnbqi6i4r5)dmI@7BRH'HCRu4qH'34rJ %=I9-%7gZR1-=t$QdD'c/?/*0Pmh:7 lpQ`hVG9M9N0Yn.UjC3jf0'FsPT>$>CqRMq`l(-#,GB`KT?eb[30GC[7Y5RFobRoEq:sBG9 ?tTar<]9'4p`Dls]tLneDt);o_fl1n@GF/(0b[!(n&E'#Hr5c75`Zf#->6l`#TLbH`IYPM# JdR,,t:iNa,jXM6'sVe@;IL9OKTm>4HGV5#[IsN*[*pVT9Ne3;T]kP,"-[>'Je0:bAg$*7- LZdj&Bm>R?'-nbg2\u7V`C+BOaR]s.".bF-([j3em`J0l_loc^F5d9e?CnN e&^SWPul9^^S<1u*hsPs2+cdFt'cCJS>B=t>kW Y%c+0&&IqCQ:Ucj_g^4l4(Ghq[tA^%^&*hg=H-UiFU%"3B:0T nm?;@"1s$eNMl=2hb3/\&D>;9;\VAj(h+0j.0*RSGnjlNFdnP7ISIt1.\GI#:P j'd?d*e>1Zer/I1L>P\@L3QS-+jE#Km9ZH3hD!^imcjHPt6_KoHo-p^#R=2q0DI;=f+7u2MG^_NRt9&,nrd[Hq3CDTFB>lOf URg%EU?5(4^S%3dHs,+HQ/\9e3d="[\m,JjDuZO'Sr_>^*".@) ?46F%3TrUTH9):Uq82TA\b@asgjRe`pO;9<57Vu.IM]mR!t]L5/S2!l!,d?)g'<#pOs],<5 KC;9%cjguP((tQqiI=#LTI&3ZEN<2T9o(Ypl7'ar`oDoXsI["ebjJao?Dd.qW;aq,K:^D)& ^mb5PtIG$9a"q;?er<^cP]79BAECjKp.#ZqEkRKF'nj7>%O2"sZaIRT2Vs%"ti\#/a.B)cF 'X&j[KN2&m;r.o-AZENq=Z%+8R;(hA@H"@-K$6*)%l\:KEKH\\sE_>GEB$m@qW+suf(#2!@ m>U;:M-+7>3#,"eEo4k^u.RKXU2Rr;^GZOsQR5q=*#2ito/0^'-I>=PL"J@ff1O$Gn2FC_. 6W?#nQudsp8r*:KN3djij?5Ho4u_gm6ecse=?hQH63DaT"=Pf*=@<2%Kg]^26uaulK:5-n8 h(B`"UH6KWhq8-$jJ.N'Ul-a6^>V);E7]S`>hfF9:!He9#Y=4`I(`UM-gI[>m!p0VAq>0bZ tY0G(edIL4[9'#\X=E*BI/03_X'F>Gcq7WCC['`cJ3#H`F1MXVdjL"opu?]"a4"LG`ZEojH>^q95c/sF,SbJUtDI2cD/]Q;*6$cX.Ga=gK 7]UXUF0O^KXbrkUC0:U7jbL4'o@6CbjF]urL1irYN"LehDMO/(Yfq8\;r1)N Pt>e7Yq02&N0ta.FpG6u6-E>^E*]`D)npY;K_t#V$gP#*m_7HBat0>D+rJ'WVEZ?'^GGDc_ tPqQW]t8Q,.%/=bPFi[qo\4^,C2>UX8tQhYtHVIKE,Ne'V%g$*C7'A209'gN!`4B\j2ds"T VJU`"#&f^-L2_"SblLe.AI@'hg.lbVU$X4N/VV>R"SY8XR!kQu7Z.[S)"VbcK"o(h3e)EQj *^9`373%+-rrIg=VR_JI^gACX"ci.bW7!^nQUX=R)9fhJF4L+l=&UfPamq$2.bL,@;9X)Ed GEJ377`rtHn']hgnk"\O+#8g5>'[hchbsT]=`!#F%]^8)amC2m:3"U"]-o2'`6NSN(:HV.1 gdsr!=A@a_#)HE6kjep;9nBNZ"FqAi`)+EH<);jZci!c="TK3^=O2*l:Mg51AH`gIEX&16c 4(%JaEIdF9nqRhK%lra^h/57)+H]ad.CfMp^0KE&k8+!d6/,0A$!9&C7(Au"BZBC?q17ik> A<=LPTRHppWa]PgSi`4j[/]>J%MpWe/;\KuA>Mr?Y?6l,VU-8*]J3r..BAJ\56>a@.XN43@ aAL.I"O8:(-RP`/N\MUNi/S^Z*%AMj[*3e[9BKSWaS5]?m?@Y[@8dJZ1!FZe(E4W5$%:lR_ >$XnrT>0O@_")(s_9V/t=#X5(T5-lD)4\87'8kMWaZ=ECHF\PJ^:.fbnF:2'J/$S;.Zs3WBPjr CP7d$fL:D0E-2?";@AI*;r+r^kWOVZ7>/$nY&u&2Xh@r`,uSS.;LEpkN@J0R.Ba12daWrub 4Pkh@++Er89N!,_pD=>b#9n8;`utN?-Pq0AqVR3L=Kpu60gtVKJ:BTe)f(b4k2^?5MA!H9` S/taD4i7_1QQpe7D(AH3ld;hB8no<1QZg%H&uln'oTWeD-tY8g=Guoh)>_<Ga$"6rrEh.YU Rra4L]-GihaR.o/d*G%H\^DA?%*&eNX9*_@0b/)#@2OTD@KZTj9E+l"$Lth %=2G'HOe,-`5SB9oNF\j4'23#"n5Mr7N#<&[,ISpO]Za].*t_sMdc"1iVe^E"RZLS6%d\Vc PT"N/WhL#p#/Xn7>7+3Q((q%.Unu"=i6J,h#u_cT46Y16L]GZi-\q01+)+Y&[6$Q^a0cK3s !uA":,FiVE$28@"\dnXH@h_hE>'15$Hsi>5W/5CT[m"8:sYVA2sdJ0N80q^>L-CgO6V<>]k f-7K_R3KO@bW:/+sI^K^BHg]bJkPq(QA;90os>XcVC8]Cj'4PYq:deI1u(!GC71ZbY:grn5 HD)]q'rebrILWFop`RA@X@U2`:j[t5&hKF!@'W\PTlJA)tB7>%KbckFQH=#Sq"*dqaV?LVh"R#/i?WHi-AbYC'p 'E.2hl_W52M?p[7"hLQhpqd@NaCq?s41S$#E*QJLeEJYAnI'QBBG6\/n\8ZAn`l]Bg.as88 j3T6K$-!BldjG?n1+N''Z9_-c#\3^2*CP4r'C.=s0LiERE 5)8D$$`6I,2UO\GB*;U.KNLYGa>8KGp/"ul-tO.1AM#B:4iHGOhAg2eK?.A1L >b8W=_5$EmQTYOSm39l3-SjQd_3)!m_7*:`REX\]l*-N?tauQ#_@V)>ir0D5( i**m%EM&iF`@5Df&0\-00!9F'`G@k=bL)NcsmJG]2_hUD6gBXm]o.4bG.[^c%9n:64mL)X% BVkRRrE;'o0(i"g9APE_K-:[NEB*D>qC*pCXEISgFNu8= %HA=IrBnd)e^uP\j9EF">l)kY=qKf/$-YniJLT#F;20"D]EX([MEdepILF(:j$C/o*YZo7")gL:1km\+2GgF14%W&9`gD*H@]9% 6hKoGOfGbAe3HC?D4%OdTNfn5Z?* 38VFZGut(e+Vp+G=u-m8$f:a>3s$IBVGHTW?*<&=p&7j+el?SE@N7']K?.;8*`k mlamMW%G(4-8uQLiV7:.BjHFJ_P\*EbG4t:Mmd>/rE[K6N0m=A.L@T7@CWZGoe9mt (^@uiCp@!Y'DjPia.N.D5Fa*+#<@7`j%fZ5BqHh)=E#41#0L(:G?u\sVKEu)F*u.%J#A>Ij ppUP9#Xa:*88u9>?a*=[+Dl)\&+K%OGqYBi#[2s^a3]WeXj;cH:Pm;t6FFe\G;#J3c^dme7 Y]8hK:a01%+U*J;RV?'qEH*K:7;j3(\>I&@gh!i&:Qu#E'$ikEf[;BT<"@sF9QVV6arPE%k MbqZ?#E?En@Xs(9;2c3epOI"c-rJpcA7q41V7JF-!tTT=o<1;Y.*'o?Y4!Ub;toHMMKMr&D lA#oa*L56E.)!;Aou/#EF@Ao)BVr3sm[k=O_BXp.]d!H;Y'fG]Ls7Y;eb[t&g\-uP!pd.[` 9#(T-q#Y+KBg'#`(K.'02Y?Z4X^293CD4SLS-X^L=@;YIAY?3iH< 8;9UsGrf16?t*'DDLH_Irr6r?#BBZ3neOpDLE;KY86f+pCO^"CKbeND?[6jup]%C7TmW^*V gX'C,5:6sL]\(&I"=R+E*,D7%)XM=(f8k43[#/n7:IurUgbnnN^i'VW<@B3+,C\1XA\n7O" $@:V3:Xr``k6d9dWeAA.aECA'X8Dan5jh6_Db><,*^#Pt@iN.FbqW,tcd(2P'9fZgIJSHbJ [O$O)!u;6j"o$AKGG.;?3DXd8j,`nPRE>qT2_`SU92^0Y`e]6VpT`)E\*Qs;fo&W=VZ\gjVa@Q-8<2G`V7o&X();fPJ6-a'Z7*mWNrj^A!A.m!Cm@hLA%nea)pUIGY!Za5uphI =C('a63-mrdTFDquH@0`j'c)Pf%;H"@2HM)$Rk'<$;I_0RP/R_N;:]C6V'dLeB=V\p'<+-Q^0mmMEQ/]?O>R]$(G9'29r-]^.Z5eE>85_"$+WDaNr;asd!W7 A<7hIXD*!DYl/'B]d[4]Xcr3nB'dhKVQbgS,j1/1\0f/1a9I,-d,Z^fu8:/e7a0H>cQ%"=h (g[oWNUfl26&6(4l6W"P''h6S-I2PRQe;YnKdaXO:9%,W12,;VbrARR%`"Dik*_m%:I3+0+ e7kFbOZOi0eX^8TaS!5\>ZTD"H!Suj=XY=/,Z%uZfX<)cAD%`(O(R'GFdZmr1T7JC >0N[[;O_WrO<]5A[ooj='%P3FBmElflc-&r=Un#bAD&#"P3!Qftgm92+o%[os5oCmX29p8jmm5:l>k^h:oXu+<@>k<9K@TY.B3j0`*M6]mp0G.AgQ'1nC ,?G)s*`gLrXXkEptcgLi/E8kGa.;F>rf=&CqVIRDlMEc[[I3p`s0qKX":8g5'S`*$oX >o@@=@'0;;u"#>;jOurh$pPr-mPLq>L?>l2X'$!rq0Ar>q`YpV<.2!oRSuJ]AIJO)aN2Nr0 V@+f&?O@$E(Z>T8="EXtJR3"eW(b6]@N'1.LN$:\-!F$Y%7%!Z1hTo:d^d+01(89GC#gc:. OrZ=NFH83;#HPk^\4H*s9&u&&mM:"407*)2PL-V(+K'WcOIjLWK-/ 6a1M;Z*#b_]`DHHqOgY2fWZ,(hHVoZUK!Mp;QmJhUaU3(+m.(nqQRZ$PKM/"7AbUAR6,dT3 .D*"\&cL")S[l#I%r%KRdj4p0N_8Ok;5SeDU$*S2jX [+S0bMMc4RuSV^ZN=]tABorIm7u7d7'%_mn!`j>rWGEo#!bG8EI*4&G>dKrAa2mhOp>HaN> b>KqO+H19Yu`HUbsiHtZkkD/R//4<m-&>Zm&n65g&HgNQM V,Wmiu#%[Z%Q)7;26,[r,W^0*+Y&=r\qj`Koe&25pS`m7uT3$1*b(=NnHHV$uk,UL+X..)- H;A19+?sb()XLaDR!=Z'`]cRZr)h;.c4fRPS8b0EOX=%2iA"jaM9rd_&G80u#BFVL?dYrqb gurLf/&lQ.;:#,L4r4NEIm_HC5:B`06PMYN/KK-NeKSMd;:k+0uTIo%2katSM(ldXCa<)1\ ;KSCn?"r$EPCE6ibkK^Kd;p]395egC#ipe*XfQM!Cn2gg3W3[1VA*f[@ZM$c3fip@oNkp/p (Xdk2FLmc9rNis+`nfBRHYt9Y@XF=32''SG=,GJq)>3.ZX7^5%<>qK/\"<9L>MjaFNU4&fV XE'Js*nu.hnV2ilQ0Q?CMYU<_XM,N;BoR:"`]bMJW4g3e^KHXEIo;u\@rJ]3l4u?7EBa#L# dWNOP"`+@[Z/q&&>'`K3!db`#),"r8*E0YoQ/Io2NNX$_T`He/q+HDRK2LeoZ)t(rT7T[eA 1KFS?:)D?[`=h,g[_)iJ_thd*b[G3)upUY,G[A\(r>3!YRiFus9im@sUJhE0!;qj2H<[t4( -;%\/YBWgg5_YIk0"YPQYm2m!jrU]ppd!SoSnX_tai(Oa#4K"J8a!arITrk.BiUS8XG$jug[p+!5$3Kopg27/5XJN07XIP Q#/kaop3KMBRuB1n!)1@k_DNn\dC4>`Fm/gi*cIiUoC3B$K5*2ZB6"qYrj!%q8XNkBuOls- @^B@h`ut%gSdmkPP;*o`,(V)I^M!0.oE(p)h-Ir/Dp%DlWoc)CPZmd1?`gO=LCZ0*;b@S)N oZ+jSU)dSRcI&HHbf@1EL%2?SslY0JX%! IPE.*osJ"&lBkdN_pG77-.0GYsFZdJ7@Xn@aAH@#`si^5r9+GqB&#o5)VVpcQ_mP::25\kn .Ol:6N$d'G^&3[]t#@-MY&&ZKgb((e6-e::TW[Nu6''F\^0IMkM#HS@W-D%UeiD%c82Mgir 2Gmd[aROgsi"Ye:'V]h@#HOim.9h!bjVs5RE'@C.'d&:RJ\*`!q#EEsWJmXNP1&!?T.M2E7 Gi#V;04(->LcTq,C%YPuj)37Ve%oi5-*qg3hp!P1A.#Q!iEq[p8pC([.Dg_;_IZ._Oq!X+9 &kaL5:5u43q9PN*nlR2'rk^DnROkfq_QYOYSf]YO-;:ZAcd_p!Ij`ZrrIXMQK/!;+lR+o! +YA3NhZ$8AG8P;b;EX#(:%$KM9DU$*NU\fCgW'qqQB@+R(DkZ7"d'N\L):`Bq>q6Z&ofQd;nG,R0,#iO j^9VWT_RYB,noSi)Z^QZ1EP];-k:h'*b!nhnQ?qGl>&#,kbd5Qd:khMC(h`*l*5@IZjQ)6F VlqK(_3S`Y.Y]0*:%L[):U#OZmp6Ln@F/:%mb%Nla&t%Yo?QP6rC]eLVOB#"Rf43n$H.9dF 0R%?8_g^(dZIh$i(jnDa+p(7oXIM&bS-UIn0[o*ti]I9d1"^C`'6*8P__\+[j5,54n2,L%6 N^OspXUP-D:&LEl+!u'H(> aSpK//[=Anc/T iMLVHsM%)8Q"P+i4kWZ"=%,>N>B?e9PZ GZPE]L5Lt$D'EAO"()BjUBMj$knV9DRN,hl:)&+6.B2KOg.2hiQC/cl&ZnN8[4)5(^6o7P) EP/rh_]3c$*;7Eh:B%sb2'#Y37lG9UG1UT^g1p8.@5d:KaU/nc:+.7-(;Z&'EY1m!9-KOq` )Nd1(CP2HW:lIj9aTh+g;n/h@ed`*&c2CPrEs>M0Ql+QrJMU+n- Qi>u_]7c2=N"n>rV@^P(@IXde_2](W:L_m\FDK9D4) 2tR2YW3jb:5i%mc3q_9%!g`YQ#XoU.W]!A-ns;bD/8E;;qeQOJXI/TH&7ECdEUeA[^!HVCn 'Q<,T&G;>-jH0fRT1Z&@hEq$ hA8JJ*I!X8R0fA7NkSrM*YDC3o_^a;WHso/SQV)G,(L\i-'DEkSlt6JL`@FPF*r9)/gN7^2 p\,JeXuTg7)>N3+LQm,b4)T:IB"-2W`XhPAijNr'H)GrBQMS%Q;ZigSe&VfU;Y\)Xen?#ViaL6B/*t1\@J` OZkFRoMtk8oOaQG]c"QmuBirohR+"B(heG4Q(c^Lc6"oXDML^g%((JbU ;FkFYaqHqE$*TUVT:+.sSuTL;NliAq3I%]9>Q+-c[D6#IB?a.g46UARB9?#[r1dt*eQb"6Sj;_)r'qqWD@,2#jAZ$GbVS%Q&PAu7X8]_m!a]M@Z!LseX$-EGH XWb[qJENm/Y7SO)&3rL`Xu>=C5H:6kW]\8#TGsoh.Mr0h"'C\d[SX8[fu/He'nI_:j8H)!5 &:8<&RbElpp7+#s/jq`$[Uup4UXO/m6MZ^d7\bgGgk'`O0AE_dTG:IQE=o;kRUOkYrt%NCV >d2nEsERms,#@SP,%`/\VYj*O4IjGn\LC6e32BZe6ME4_gJjp(/C-O5'@Yi5QP#2/h<&#sg qBkZ>3^EONQEfa*.K4+!6:)7T>d\.V,e]8=';NS;u9F*Be%N2%^$Je9j1(Lb0"_9O*QkEq; _(1Fl"?$OdZ]:%EihE/T=%,`%.bMNqrRc3*E@JA;8s-rufn3LM$'!XtN`#_Vlh:qbaS+Mm& )#G=jia+"lQa.T>HkO(*j$Xq*JLh!f+i8[oj@SPR6#$fd!iE[@&"F%LTu%Hcou*G3`*R#n^ 1q@-p(6(_3F#e.*dbm*J&XoCV!Wh8-!"$>^_rgn?FVl6I[eDbT?+%%aS_CH3d^/KW`EQf*C 6I[^:HLcdMkI\$Tt\n*m3JM?EU.bj;c5-SBK-Jhl>=^Z!3q+*8.CJg9O#C&>5_kdj>VOUW% Q)kM&/%HK!3m%F?7R$XjedRd8>`$]LVmN:\"8qYQ8#,LW2?NP-pJVfm9t3CC=Fe,MqD&]rO l-hSQWOA>u:6Zs0[J/m<&7bqS)rFP];Dq:MnpIH8=TsbmUn-hTqfGe+[PaWIK!en0Pfm@T3 SWnmi;;(hk`n=SMIAFoOA(pshgHDeeH#_TNQjnU5)53E;U!^Hup`)I2iPLf8*Td7Ul2BVm% q.*i3NN/6c8""T+,M$2^'"DP!8pF"TMS0!((ge*6(sC-Cb?_?LdBI)2ZrmU)3%,GOkB;T5p ;@]jH.%\A=fk`jQ.kn[_-sTNm$:j5T$^J`]3HqQ0t,nW\(kkf4136$FhHQ!9nb$mLm8``E-No \*t=(Dipdl0<];1_a^_WE*3N'hRET',C/RDnE+[I1ZoU?.QVjR/C%ZcfP2OXbIm7d3>3#;H pi5WU+2@FE!'cPYrrKnh,S'uC0J""C&4c!GGrF$4T%T`k\`RrRLB 2R6QfG,Keer"kG[uq&N(Xi&d6q%N7BoNn(.JmX@i@gVZt14HZ-7,,8$V-)*QTu)@VM.g/3q _,%;_@W8[;$^-;"nmUFJlV[&#p1sW%j`8NUd&AcJS6\^eXjZ(P ,[,PL*5hUZQ!p/qJ#T'8g)aR;b*=G83oMl>i;)E,+7oD0t-V)UlPq>U+o[P`m!N#;f$(']i .o?AF@/(S,UY'?^T08&MnnkpLA<5YT80Km$(_=R@WIT`h2>dqejYp:=gh%rE =l^><(2r18JFkPpINY.D;7&B`Gf(+26\YEAZ2%d(O'HHG2;nXj*G#J[GEKs"o,epQl "l_Ic'o9"+jnt2@"llUCdW>N&YDiL>hon,DoqI[O7!mUZmLe%n7$jO5nmt8!.>m%Sr7!))b AT%n3@"QfZ+Mn6b='Y%aA<3Q?94QfB4d>mt6UEM7'7*fHh-qGrTQBf]Y[5o-7^!`ot;VQHl `qUW!UCDuoUYNpjm8nk#5Ia3de)`H0R2Ftd5OWGh]F_4eRY4$"A)n,@PDgV3N^i-jqs1rZe -P+&`2DP&SSpQ57aDsD0-d!Y\n`"bl>geY*N!5?&,nsru6dbO3-Vr36-PW[&V_+Vp\j!)kP9SAO72pp+1Lk@It.(dJ.M>R^\@s5?a*KAis[St_3" f=4:ZrEEX0E/+u-tPSf'iL;[kGm.n80R(*e3ZNY0]&S?$TN7&eFqQT5FG5^4"G$p"\cAITf Q22;b"*CFLc%Un]cLX?;K6o]Z.@MD:fOWGX&5uKV[33!p[4t+AUV%mI8=,M!0.n-DA(<4/C *TUm.$\?7Mj"kG0%C.e0W7)[FFD[$MZ8kDJfKLHP-]\C@:(8qM$KLb2O79G@8/V^V,W(.-_ e=7Sf^g=uFH;Rt7S-03.4&N0@5^JpBh[csQW*1';5t`i1IL0/<]'n\e.l.F6r7-W'-)C[OiEei'#\b7-p=>jD&_ok2U<["&:Q@@1a>>DI>5041_b0\'$JJKhlbr,qhf50iD(!V`D`u+&TD'9$'UYs irQK6jONN[=;_Ppa$ASl:D\$hU]^:;3(7r@q6\.VVc&&J&bA3i`oilGW@LJ)]+A]tH)=kEk D?L3D>ah&'%m(A7aGAcO"]5HtG4fcZsmjm)(cTU\ZkKA3Z7IGQT`UU[?f`Bcr82ko IrFHK^LIO#M,B07@&RlU,;_XmTroV/JDH6<'P`ZoJli/cdM]M5%798e&u&,CM&;!Y@Osg$n MV\L!bbI@BX`n/mOsKc`tq13^DKM_]G^mXdmlJqO"p>ia;FXoj7q%`#C-']V4_L^Z."Hq5# 065+"64JV'3f;fG^/*/S2T*QZDe,bS"$&NU`8^o/*,anqac6Tem<,L2W@Q``Zq*iLKMEQ5S \h.T'@e49hBc.uh&`%'b"SAtFaG3[[=/]apl[$A.RqBrlHcZe#!''2X)P7()Crf@pOk3n1)2gpb8*Ci[K$$?5Zm*F^qO2[^^<0.9l,'Gcn\g]CD1/?E -(5T'$lASQYr;BNlfNkSXYX%O'CdjDD $VQJ84iY*m`7G=q-1*o:_iWRZ=!rt7[]AS!i%(WDBWF]Uf3p(9<,m]3\+f8$a,]><5`=)Af 5F?R:kds=*`kBg:5q-O'rhVS5'^Xre,pcJT94;W_A&)8iFZ&o6`j;rscMkL]54>*XP=!XP# FH1g\Q!o%p`>Ffd@Xgo3I4(r2U)6W6gh5qmLT\Wo@iCK'ZoLXS6-,Y\gj?d`mlf&-)<5g`q 1>V/LWK;_\PqU;T:+lVBg6Il'Bsp0WV(_Lf.7%#G35F-RQg4X0>XtUr]KH@F2-l8T:ElZ@5 &+u10pHGfBa4Qlo53`OoHBP8,p?qs$,!3^]1kqAdJm`)A93jh.>er4$5su@%8JF&B@6],U_/pO&,T/n"M2/Td#:'V le/aF6CBURe2NqmT(hA:B(BtF6!5Mroj)-dpE'eXn_LlmGN$jk[:_bBhKCBYc@s>fF/V`IZ K/_i-.\K%[E(#AkJjXU3_g@!8n1+W<>:Vdj\847:MRU*rM8S;(\@[b\gd/HtM `C:C3?+'u6q+X@Qij9M"iHWW<(WLaQar>RRUXEn_TT%(T"3UG`:Qm:o$P/K;R+kaL:\BL_k ]>OVn-\F`Iq=3PZJhDWPRY"`PF;6899P2kDBNu"bG#^)WsR-dtIn1*K.9dK=Aj1[mkIN]4' g5UV".=]H4\u08+/Rltni[ot3,"]M*9,4E8CRp]@rq"s>T&OCWtd8d8BU"NY5gMr+ejIZ9R 4#Dh0SoB-Eq%_X]K]e"]I7"Il2%g88.]nD'PI"eh`fnd^nLS0&cUYa(f;b4!HaK`/WBOZ`b >_qpZ"=Rf8,^mC3IRu)SaWi6i:jWiaO%FG[ab6&'OY_b`Ad)E,ZW*Hk(i"aA0gA@(^I4a0< 1li#`ColLNmqH#YY?M!5J0,b-\7br2n,[Xqe`i"(3L383m@M#Knq.90 [Y_bOiTd>(4;()9aq66);HC4N0uZ1C] Fp8p&.gR+[4%8:gCUPF,na0H$iNP_72dT#)GMG,=mS Lq:On$#&732qef1,_7?%.5SG^^orN3_:9 U,V)&H2jDa t6Ma!DEi/JJ8Z7YVa4"GgRj&4qUQ1BaXg"#rpXD&gsZ*Dt`YZ!@'Z!-ngRVa-ZZKH-+N6K? ,YJl6]AdY*5#PL5'i;hiMM4cM#@`.nTmI>?a1;ACn,]eRUQ0aL%%LqLf_\8VZ6-.?t";gaf T3+7RbEDRZ;e&=Gue6Id]HA?m<^;U7 =p('JXjPM"MrY0@^V03b\^n7AS'(kB#1EaL1!POV.m6b)i#]]be%U'J/O(q630>ZKEr!pe0 [mHdS2lGf/7ZZ,+OAn5lfEdf7_`jQu@Y62^X&pK]k[Vn>;_Gh4(K&_d#+F%,t"sJ_2\rJs\ t1]]DN"L6oj@c@kAuo]XSsMU%[&cFiO4>jTC=P1];lKr"6,V"(O-R+X;j7-+&1"dRb@QC=W Ddj6dU4F6P_q'c!@RF2pssa(T&3jgEM/[aFKOgL+WH?ro%9R"ul'#=9(ii *$?SD:=<;;Jdi1I41>K"S74W5*fnIUYdC"asHe dT&=gag\(%YSj1?06bg%GGV;lbUsD?e'+K%O.Z7A\@Q@=h$Cd%k5VVENY)52).V7[:(%rN. _aY2h>0d5A2`%C0MQpJGcDd>]$kXW-#T9&"M^>D9OVKR"^KhZaX+UgtMO(!k\DceLCoj[N2 1;\F`8985UL;UrdlKeeXJ&hHaC(*JZcZadAh.JB"B[+8-lQHiL>SSXOi@3)jnregrTLB_#M=F_0@!6o^fP>hEYd\8ErocD?KPhBH^pP$%mN3C$kZCR1C\nete u/B0/T<\%rj;<@1##7u#=1!8Md12%H8CW8/!N\otf^9.`[SAmMlFudPp_U*A0g3,Vhp-*!c `_b+R`idCp[1L_46e_6%jDID&e%j]pF[otdAB*!W^sP&$2qZp- J@KUg1=J#,%;p2Q<>eDMI?1(i4tHG&-g;m` +VO#_*'2<=O*pK1E"n4eXVO_,p,/VuLKO?JD i-GU;AYa!g8$H*L5Zd5WV/j#?o"ZZ,=C#Zr*&r,@C8N$C%]a%CX3S-slJFGX1;Dg:7mr*:` 1A?FK_0tI[e$r9@^[iU43<46<8"AMld!-3LHtJWs."!AF@&V*cB$CU/F4E=FFhmE!+ft=lg .tOlu,Qo[B!gNoB`YVg?#O)hF7)[@:Xd';3`%s[2a$1d;:gConQW9/\-W-hf=D*_9bi0Lh: O\@-s96p'0:F'uD\((2_o14bd,GaEWK=IIl=UA`mb#J:n)6@S#k,Z^H;?5;01?'4n):%k+Uf?5]e*gptnF9N\kiBRXDB_"JBC^>`o0(f=]+A&r:o#QJ$%J+F5m\5Y@"%u*Iqd28ZS/J ="2@ki5XFu^Y(_:Zl'UJ5]>P=d+kR:NI*ApqCbDu$3[D)[t[B2cA%p3f/u:hWfgg[X_)E[X c0"I[Q':8ZM*<>q]#X]):NCDFG2G-bPY==_rA-'$5ZZrq6(HW@N-DlYc)Udi1VK6=f^Y8=g uOGN*c*h>hi((Ue+_d[U&]KS7hNlGT"=WF;+/X+B>EuDXAG:`]<4K+]3-C7H)S\!=MLFP"P Xk2mI)a0M=A%1002VXebmsVe%\IjU/i[Dsr7?NudToUjrbia(o*BnsSV:OpSqd#fVA%g0%X j"*(=-q%lQhii$T4b@`lM,^T56$u$l1b#QIc!)j`PU+i&.A^C^lU)V"2POB%Xt$_al76,7c @N5RjBcC$Gu;>0P(na!Yf%(T\4i\!laBs#/nnW:DCd1>[8(6&Stqn`_igO)ocmAD&l+YgjL 6b&`eWdR01f6ArgB%OX3RS>b*4a&nIgdb&WH,DNWsOSob^cZ2T4pcr:!o+/eXPBrQg&S4Us nBf]=X,Z-?Wc?#6743l=!lTNQ-jRk^`'E&)!:m;C^-]pjMRmbYG<>e0MkgM)aZnRP'"-$@%D>W3\JEnqNXeT9Pj:"aaHf8\O1gg kt.Bp(oI_0k-aebO^PfF@_/i#!dEK&IP1"FeS$'2Wq@7FQS@@X+r'Mdi'f22pR_`]]=Aq!L E%+/c,OLLh>u5n?@-6.^Dk-!YhL1r.)TSO889b#R(X9QB\*rLOH:(66Q)XeAW9QY29)$:)rklg)C!BY+/?t9L$3N6Z0d;WiVGbD5 dD&W\@'C\#pIKFLlg%37S('1,,BmOO[[@&(TArlAANYW"->VLdl:rN"J:oJH;Vg&8L`aXWA =a/d7;9VC5l^JA5^[6b?8@o6dXa'@D$E4^pGl8:cUUMI.#3=NA5$5`&afLnXm@^IO9GcRSu [j9aRpYk.K6)dJ/.4l+K%="FM;$e9?qXSh+@Sl&2jP:;qc[ rRJT22niI^ti"r4^%$dbX $V@('1]!k,%"iF>heO\s[m8Z9fEBIs"MZ \>&f%g)E?X^QYs6bpJIF\Fn&EHWLko'ftDb-=uNa][pMBjHYMHpVT($#>2A?\?RL&'1E^(m MM5;UW8%CAD6&omsG>U*s-&d3:/sI2o#7^j;'"(EXfFKGcJh+(!\H&0CH=Ib2m@ ?WZ]En"ofnfB2o:!DYNqAc[HB$3oEj#6Wn@3Z')8G1S5$K<("C_H9;8@14`@fAPa2\!lp,O `EDcm?#7f]+Not98W0c.E'U&@#dVSLN/&'``UP*@pEl1ifNt]'<3_)gitXYped$]%QIuij, pW:7EJEFA;UA<2?ue-(0KT8-3;sX7@]L&nk1TH]Y0W;#$oG5Ik_]&.42AhQd$ZVE!J)9.o.l^h!(\miL& /M9r7&SUS6D5Mp_AITF7IYf!i8"e#ffN[[g.1gP^JuD>h'RDLa;F!K?8K4/odhNp1^[U"S8 8e/>`!ls6[&GHV5&gKi"5$1WO&iIj#N<g]:^nBNj7".Q ^sG+J'=#,/a0-?O>\f;oh`'`2jq&D?BR"`s&ig2ao'c@Se`+>Ll[=PiLOppcN,MGXrPuJC? LQ`s@D4;r-EG2%$tBToCQ`^%9DKY_ja>sL)?u;3$uspHO!2R4B)qQC@m`!Lgrl*M#N#ACJ+ 7tcS!ikLl'"?1]FEfQ(!IMGc@=/%In]D2J&J=OT4%_4hG3-n!<;?VQRR*EWI>FeFO@3+dEi _uA&Qhj1BK-_!cT:aO)%ZNFYWO96r'@%7)e"I?5uJ22K`rm9)8S??j?=/@4;X[ cSrJ($Xa(-Ik0DGH_0`pDt`D&>!XlHZ^$#;?MD*k6 !C\Ef=EZ(11nT'XL8%0oeuMmBs1]"@:G$IQBOEOuR[Zl($s*:ZK`Tu8!\itVqEn1PFqY7Vf D'ck]]^7b$0ToAOQ-Qb)4_#ed$+m^:j,4lKO+>O5p1(:;d;A`9Q*28*.M#A>iAG,L<+qc1G Yu)V..3Xj3,B>dhZ976bkT%F@"]'lDJCOCUT-Y+Lq9i=j.*`^(;@1G2@?NDkka!;6g)U42' &`9Wcc7F(I4-bj-usk8n'M#RONhUm)dq#!U!O?9rr1?As"^JNnuS(ZpEmb!s3WnAEBPhoA2 ljF)rVVC/Ii)b)PJhmA2"s2:_#n/Kk=R `U&5`.WZ4mP2Joc.&A8HmD[Wmjgebfq;gdCI0+@H+%4ZK0E8:tbhVM)h%[3:jC6/ihp)$O( 3b=Tg!:gnC%cK,I4)PirOUi&/)*BVi4D!UdndckE-kjF=qWONS'#,s'iB?eo/-Bf)')Olan 6s/I*[0JdJ>a28E>?cE5[frbAru3gFV`IA(Glpo.oNcmRd'-F(_eC`LB/6SN9ao,l`RsDa& $nUUI6i16u/A'iA_^*r"S+Y&HQ8Wi?/o@]gael7T$oiZsp\,3Bn^4H(k*ZLjpG-i>tsP82Q /ED[mIi:`E:%8T,l*On^:la<.b98or>I"W:NB`:Z.l;B!PNP+cku?\`*5NO(@Dias:_@*H]3oh7Y T#19RkFAV0%G5"[=)+dg)>Nc%>;H@eIPdM?B=(-*20AOiFWWXkuoZ@'VNkk@3>^%*WiaU1/ fb\28*5%_)#*07KJY\i'TNJll@V*Ng *a^k"\4OgQGXt_fTRm#;#Ap$s_[8bKdm9(3I9u6BBJb^L?V*GW"5aI.>X49MeO[6F@6'dmS NgE'_@m\bC(f%%t!3-XIL^Wa=\IkZ+rbcRM'%M)g#e2[I\7bD+8F0m f^I>5r'?ESP4gD8/.%SG5Fh=rGX.@'-Tmb[$`"8RXm;e-\4GtJ]UNM>tYt[E]5D!_\G('(R%6/W aAQZZnBO2:T3+^u+-.=!cuH$(9UQ]s#n/Q4M[.4Hkfip7Y8oF:I^<&_?e(VM=-oh/:ZAsR@ If>ooA`#GBc%7-p)@%]MfB3*A"=#G>,([Z[\nQ4tZ*5Scm2hcb@L`_ls$"86>!976YLOfK% '7d2h3#sah\Qj9p>PKLr\0sm6J.B@B>d_l0ZU8#C5T/Mj#d8qb_$3S3>SnWc*-U4n[Ig7Q! FOCQL,K#DFp29[ItnTW@.k=D2A8(!P@<*r%L$o_2CF=BG@I]R&0UP*5k5Xu4qAf:MBPq1!: Ud?7>il/X>Wq6[T-lk+_?u`N+MW&+mUJRP@dn@NH`R*\'>M-F+>+h,@Mu(a-a-Tnj,MqA>mJ&V6-5p:lda]QTU[75S(7[a/eKf7hf 7P^,]^Z+:dGZ5g;p)Ab>S-A?B)"`O3JQ8rXJTaDHAQZ2bBnlHSSE@)^Ya`=j\T7@Gr.Af0^"\ZM=rY[ocs*jS@/5h[?r>B^m!S9`)D[.knSCct\e*]^N"7 )0hZL))_?Sp-`s\!ruX`HjJBT6I0W@DWM)aa86HHb'BRu`EIu ncK)0X-T\KWo3F*IfKB/sK_#ajmZCS9l+(=>,,R7YL3F;F>Wcm,TfOq5ZAZI*PL=QZd1OT\ AHXRi2Vfj#8HHP*sMdfeJX_!:s5kGlnn.-[V@t@pCRdGu7W"FRL(3m5tR'tu+^Pga\YYcD" q1l3<4r_>bj2dXJ=rFUA(U>YjN]KV7Y=ogBdN$Y2$3R(7p`]?._Io^m1u9k\"LRAH>KiP#-M\gD=TW/n 7=n\70Y^B)Io5rSL/`!k>DS;R0uED)/p[> ?>Wn]f]FDZ\r]1F[S5#Ymn"B:BTfXEk]N_(rdsYZ+&R_Ir@S8F%B *auu*!Orl[oqcmHV3RdGTpu[%I50Y3VRcM&OpkV0WR.oG>>(M>H[uHL ]DA<"bkp(&If<\@Jh,0sH'\N*?m]//B87@cSIS`Vi+i(f:_!'&]@7U[@;B4Z"'qPt%_=AU?>S=j@_`TO3^ .IDM)kU@sT:A*/6*q'kSLPUP`?&[SUD_$Ln&:hle=9h-@r*5QllG'B")U"/r--1DHg(Hn5/ FZET`sJ^Cada4SGgeDgm.1&R#@Z4&Km/Q@/'pgWMZ%+b1s>i]XQ'jcpo7,%mV4hSA,>5LWh $-#lr)h6lAK=JfQA_'1$sPS[$o@A'R4$csf8(H1jFMkIBG\hOl^uNV;L@H,0\& !J^9?SeU!lehL87!?`7#Fk7R.q)_63)dF5L@CBHu[f)EBs/GkpXg_MZm(h0c6'r0+8/\*,' qq'.Tk51Y,SpC\g>CTPs4dKhZ5E\Ph\=o__7gkZ^3fgtgqWU`]uV<%o`IKTWbt+1n7Y3B'b ,i6iJkjpA`!HF7H4tmlh11==Z@YS#lKEK,EkZp&m7o"<@sM0j`;;]b$d)q9kP,2eD=[6T13 K.)ANa=7AE`E'Ui#&b4Bm#f^'N18u#=c&=I[[j;)1-M3o6%NP\V ,UnYC.D7ks(K+%K33HQ^B"'T4/+nf3i<%qkGkTH(tV9PKgq1oDhGP-hPH96.\W/PFOQ^G/D <,f)91F$.W&9lj:g1sPW&b]b%],Z-Wuo>L47T?"4fD]D3n*6Z]FXU*-IoJI:Kd<%ep78^EP VFZRkB_E@4"8G]"OC51L:=GHtH9MAKkk551[675`o7l$un[lUIdg&,6Hk8>UO): qmAFksN\hg&MZV;lmYGHi&]Q/kLN9]*>XrIA:#((5ZNpa-T*@5qj8LLF;>)GH80nbj#H0[O(2;s3aIYS!Ic\_Ad2%qjV_*'Q=]kuA!^e15f>r+,7\X^k8DitSnIlUK:cg\!;^, _"4;asBj+8uVeN_sRAjosON9SP,C&oh%HGi^4-)hX5!5*7(* 0`5&c6j[/3Dd1N]^Mgahq8%"I*s9B!r&5;+nU&q3;OV=_,+S3qh^4DVLue,OQpoMkcUf,SQ -aW$(JE-Ir?kG]T;S[O4a$^To5^4"6#pY/*KP9t35q#kD(XTGU*gZ;=Hl\X^-@VWHboCB#ZnqhKFj: Y6!Ksj?-`TD(T=<4:6Xo*<`0(LiEbG7!O\(@Ot0/&MbY# fV&u'c8Q82n 3:?gHQt.NI`&\s%qHA:OHKf7a>j\RA3jZG_sDflaWVp?P`q8n<_H#00d]S%o,L+`70^)B-r %XS2c>Z78m,"?,uge-B&mQ]YbF?Pi;/X8e^tDs*'+7:PWe3@?QRmO04kX-Qr=c09R2CKAeF PsBF8Ap)5)NBI+"Gc>l'IGoGc0\gI+t_&C($]3%":VS1'L594[OLO^kA]Ngb.&WSor%PjY- "#q!]e1,XdLEDA=_2c&Mn5Nig_TTfM1:c])Ua3aQ$Z_E4Oo+s"aaRL50-uKC-n@+X9)P`4> NR?hr[Y!eo(a9(l.I'a.']PidMZI09.U>_^KeoRtesTHOBhd,3`XQr#C6fU5fOh#16Vr+Gm;QCalQ"O2$YjM/'ibS>RQR4&_]6Kq!(OCM"QnpiQ\pdk<*CZ\[Rmmhcm!XlQ(* Z\:rqB4^BO1E:BI?D.>FQ*.$MYNMN@X,A=Ytc^d=LT%S0h*Vse76L\M]36P-rNMgf,aS*+' S#\Cbc2^aB94B%O'CdnEIq+j&B]$)&FIeQ;G_L7k/(j`&5SKm)aNs04k'tQua$QU$4C_)*m %i`i,U>d^M/-bi($mNc33Gf/akUPU?M4s!RW+58R4F4%9L[R+!NqBO)4DoN$^oRO:Rr$(3Y -Pge'E7nTET_Au!#jICO>EG>A3W&4&]SD!hVcDuM7F\TX$>.7O:l0_!\f_HRf-X0E,EC"`m \(=gX?7->`/q[/$eCtaBO0Rt3a&pY'2(rT?%A?]YG\nAYJ245mQlc@*.9$+d:oZQr\7sJRg ma4BmQJh+@SQJMqaD=WsBl."S26.kOGt>UZ+m<1aIUQe,.#e`]cH\ ?iEG-q(W3k@KT6&k>i2pTWkago4nI5b5Lm9e@(Ku2Kl5bGYWdgJRb],Ce=b]R7 -;?t;@+.6MEKY+@0HWA_cQYPrBnHXAeQ0@Y&YIaHlm[+m_[WJG:@D:Qb3s84ADeRD:r:!qVoec[!8ik?"n,)^C]RQiT0'`d_SPfT-dDr*AYDJ $Sd>a4j%F0IXr<22n.#0ud[c3(Hg>kd_Y-I"..HIP%fAq")t$nYSAQ:TV^r="=/uWV/N\DA 6S_BmfrspjX+?r1B9sN<*X&`aG;C);dIRr9aDHGOb[)bg6eB5SZf)mMoT'kD,F>#"(mG)b% Oe8&.4h5YM6dJGD$k90dk05`86hpc&?-FTa3l5g*!>gJPcP:UM_Q$@,S7fU`=q2p#7+Q;;gc$4,.<^\.0*6J:hG@D*#>2Y "6^N/j=2T_E&U092`rZN<%Yu2/eu`@KmTXUYj(;OR9#Te`A;M/L)W`WthTL^QDX M#<14S+.a6\Rno5"#4$Qp=*MCP]KH\2]V6\@[X!bXECJN4AJ>`/BWo$]m@nOXri\[g)rs1ej9>$dZJsV"A/)j:?U7(e`T\ O,U`Ub[j+Q_-2um1fLuCfRYQUn<#%K,E>4&q0M-r.?s oL1!K(^hSNF8HsO\]PGR#Uj>.fHG$>,4JU*4bWNQAIn/jU4Ucm)!-b3VB*pV3#?0m$gF0aV gV'Z@aF&h8N/Bc[63PYH^#Y/-]AO#]H3^s/7C2)EXHH-pP=ZBDLEqM089p!;I(mgl87V$YS =%EkXGGl88R.fXgn%+(T-U@a#Io$`d)q=2(I,8%8k]$'<2<,kV[WWAKd\a4(g[?0TO\;NWm@*A IU9FP>eF;9T+Dh_@a_8I6c>T:mt`Ct*h'!QZeE,@fG-DdNP$c7`:#[rJ7<.g]#_Fu4L*70Y O2hlE42iqJNp^oinDaLaq_X,rBr%CdGg!-d-"t2D1gbLg.A[dUT\"Gp9\82L;6]> E)_MK6%g@QKV1m?W+8ErJZu4=`!ek*e3Hd_Zii?VKZlg%2"EVYM8Wrs6sTCQF@\fip;R<:9ett1?MEn%YeA5&4DpU]PCA[[iUni">"N>S8_?,DUG`\+/*2JW&9 5NAqP%jL3PZ\=D.f(7g=qt#)Ip9-rbrR5D4Pu8%g?A[44\ib<3`U8.@,q]e34=/[3D-Zg=< >LjXurR\B9p8;/olSMeKj2H+oHKf(3ugYYQ^*/["RaV?s8FZrW=57-F+;)!KQ5\5[%1WbnL agFQ:8?N1gHAA=_<#EX(`-t.eij@pA5bp:[qYTpWM4oqWWJ@* odig*<7gXlCR=:EtOaoqeChRA*12k8fjY\Z5*Ga'mnKbuh'=A&dMkQI`?KNM+UFY?Y@&l-[ >:@40=jcUG`n4sbhcQ#9>"S9rEoYbI27!qR%I@6NQUVsd,7*CkKh#'074bLg\:[Ohp(f))U <@mcC:fRU$>m/,h##j>BUN0RH%h/eM8A&_6(#&m6>i+T^mHs5f.#Cq2#2 &4M](.P:ed=iG>po%'/]2?8S;5*?KLgu&4rrV[TT"DLapd,0R,htO-gdNJd3/E7O;22b5d^ @1e]RAH"0&$iY>g:J9+C`_$^'o6QL.p.I5de[U2dJR)h+]k7;CmLr;[13%;l#G2:f7Jf2:L rk?-V/1gZ5B5IT2D7LB)6lA^XO`inc!A$IE/c(i\4uk?`T#?AgIl88AB_:u8l^?Hl:&g/`r 99nGAm#@M6L[HT!9Ig=n[LH&<;SQjX@p=6SF?]5*;c!JrU[U6ZPVQ_1u0KoT0A';Rd<\t=f 9WQ`MX]i\W?qarU]V,QVD.%d.i/MP\RY6F:@>!mGM=>tKk\LDV@KksO@/)M^3+)hooJ0DV1 GF*jcu0)L5ZiGZ@?#P@R6q[M.76?=L0-V?NI@d)DV+9,fENJN(*R-9eVp/D3.m@OP)6B.kL0X-'_tULY6O3=`uf.PkS =`3lIka`3TIfKB3##/YT8_c!!0Scn2-U?);(AS_AMK?-nt4Pg!=4?=6e9jN^F for_XMUC$l0d1+?nr+3lc:F"YbKH8GmS[[]t(G>(lgZUpV%D?>T]@!1`>Ogu`#VTF&D,HU$ jpkcrO>qo1,2>q(>ZbZlTLT3L0n`q.#)1.\SLWEt;;B_Wk.Y\1i-.`i^'2;jL?1hZ2:cCle `T*F8=2pO"XPn:fV:#[MGrZBmRZNCW9:ld*2%:8*D$JiH3^#%BFX"c*TXAj7#R((kY?hF?A 9-$E.gJcKX_lU`U7'`MJ0\!#,='j85k.]=Y6e2UmQW:?sX"*pZXj:Bgqf2?2@pIqWWHq&*S !iec4PCRq\i,?mMB&2GN+!T4H?rVmpgQfNI-e$=K0pC/,'?BQ44Y;d3@J#%1pCee)Z"&7H, aL1j%1jIHP6Hj?To#.S"EfMhs5.I0/869&_5^b+Pk9,,/UiU#0HXrq13+mZkSCW`.O&359K KApDtfN9&HO@TG5.G0W:fWHi/`\-Ui`rp?^"kIKfhD4+\b@<`[(jJE$<]4)UcVHAcfm_=YP kJUpRU`sjj2n<(ej%jM5\'dZ=q3l9R`^:s49_$=>"tl)DVf6`_ISCKB<[X*cuRWe'O%r8OGM/bL7ZM\D%\m1kFI-+L@O08[T?[e\)i?P4-!P6*PA!+>hf6aAb#%t)=-a'@;g &YDg4,B:hJK_`<3>8Aoep>ALCB1C0[;[ist>9cN8&-""N[lC?1rk+K&im2!7>LB28hQMqJ3 R9-X@ZE6UGK_D@'J,X*R6E=Ups*die@*UrG0,PH\%/qS(M(CH&RA?P7gT,M^Q)_-YmLY40^ E`d"pMXg]gEXOkP:c4J^H&!X5n[_7V!+T_E-YZ@)Bj:aSD>S@VQu]P?K7"%l`ggEI0#5c'8 bS`iroN`)1+0;cL9P$;VPS#l2fims6'-JXlS+9BF,(lGlF%8h^HQ_r56jGoL(c3Fi=^q0GR '!kF@S^j:I]G57>H,3LU_>YcuFcL8(_K2oZ'Z0#>FdQ:%[mNFT53[pJQ,E;Y;,1F\btZ?W6 UUD$'P?JY-';Qot&.>4m\[":,Hjpd"nX??Q!Kp&AHCm^hC*@r'+pldD1*3hG[8hZdIM!J"b acl.)"CA+<6"@se*F>uX;DKc%uG7STc(i0?u2U5u%";j`6T65?jFn]g!GCOl@QpQJ99Odd/ pW%[c^O5e=IJ<2\GQ35&5ZIk)A*@26X_\DA3q:KMF?IO.)Y`=npe\idJ3p"73dseAC>`kVH#!dWDa:+@I@PZR*= ^A=iAa22kA6,PPOkUHUFH'-raA=*gK3l;GV5?_o\dc1KH?@kAZ:qAXT@(1WNkN]>`q*H[\1$%7Y@uLqPTPn@2.M-P;9SR@`kkAa^q/b!4_(Pe:$N k^g7)`jVSnK[Di@oU9VLT2hlAC,O_YI^`alfkkmoIAZ%@coI+h7Y)L(c6;.d3.,$uTL-=TK 6a!TDa1)Gl?#)C5/11(g[0334oXVs^#AO,r8'&GkSCfn!e$[/DnkE(qKr;pEr]S;qY^?mAj FQN)$<,g!JBN2ee4Cg^i!eG!Q5ua61Bg^$,XNpKKP'D5m0<2j:M8#`%_B`'#]np7hh'G5q# -`7*JpR7Ic=N)91'gE>lkP]QG:9Oo0DGa3kZQ+ir(_OW]b(;)BV^7GOF^8b.h>.E^)'Ypu) Lf`5B;j4Su:bVKC@1n9EP<-9$BO%$TC4I&mJ02#4Xh).rm7,[W9Nruq:;:Mus$pPLq;$'g!Q$$;4el@]D= BpiP'W.9D=WA2/O(2<.?'T$T2LV!,=k8S3C"h.#^eC'W)_5g$Vhp(4.G #K)E[eILd<",F2;**-WR:QgSp'ekHJ[8b:j/FC\N4)dA=7CL?l0X]J`,05&V=Fn4r8n2Qsj rI)qW(YH^LZjcr63!ju&0/Gj[kYjB2+IOQ>t.tt45(IK$J%,lRkL/?SB6[3_`@H9D'd-`!nfRXUn'Ldg4 *Ztmm4qu#XV@Bdg-cG5B'F2_K*:Sh:7@:GPa4Tu(j+pEbiP6_VS7@M_Ou#Rpd2M%-D2hE(2 FdK'*+Pd`NmZ-6a&qjQj4&L<1&a@+dBFKT+P7)g#"(q<%jGOpMilF;84_DY,NP)SP*0-Cad FUr69+0?!US''&hbYh`2&XGN.V_:3>U^b,pfA#G=r\&/=1alQBL*-bE@`F7nCuZ1AnUT!oY hF,f?"u$=lh5P$>sDdM&poHB/Zr2b#dA%>H:Nc&&f;$o#g@J_Ya9iVPG?Od@jL>]^5op,>@ k>T*h!gs6ks4O)CKSl=?h:NK8f"/%[m6)5-`K9&:C2$Fi5X:Ch#d6ad?kFo78LJ\s57-JpW 4\*`n;2R2W7JLp)L\Uks'DMaX!WkW>,W,W;*.q)!'gbm5$A5$A++j>975W_g,)UC_KFieJa W2R))M(`59gkp[(8OoUPu&)s9hOYbW)WVhQ4i1`9aRu(#tqS]!>Qt?o)/3 !n)L84'DN30*H\5r+u*_!B);`3FD=(+4i_"ascp-%iGQ$H+HKKWuV/l`nd9a?D obqr#o\>Z0Qc9<0dZm+%Z5/%p223QYsX_qH3m'Pn7L5j)uqX)io\GE5BfAQZP^HAo_r4Zd_ %mFAnZQMm,)d4dSpfC&[rg]5..i4^+*\bKAg5Vtu-k ^frms#ZR3o5LQ?_UfS2iJ]FEE9"_Di`'@m_)aBjkb]9XRc%E/\FlH0HPGKCF'0G(@r[el`g GX$j.'tH8!rulQn$dM61d@FHje$K(F3DtO-6eD9?GjF!5A@EO><\5b1U,QAXp/oo&`1U_Xo f&nY@`g29=^0utF=S>VUWUJpHK9dqAhJ:k/Ace6QQ B=4&5es:DrN6s(0p#O9IdiVr_h1;g(&TJk%Y\S"5m5TjafG)ePCsC5$[!&+t)WHrl).P?]K IDEl@K8BI;",*qeG7nKj)f0Ee%,3LbRK*"JP]Y4]LEHR!n:8-Di-!XGNSe[gZj[DF6cI`T9F;aQm.4>;+i cBQR/Z47^;Z*ef^Bkkm`M[QBA3$fCtAQs[osfY(>To-?hb#A?lN2p"k_3EG#,Z2 gM;\Z-7SH8n&0HX'#qkWTc.$IRbW8)GAdRWCc=MW>t2cc)`)0uSq"lY+"QP-?tKuQ0(V#QU )nuLe+#bL;@SQGm+bNu^jYD#pTJZ+rPuVG:1RfCOiuZiM"A]56R?.o+btMQ)u8AMk[Dj=-: UOk'LPPjMK,u^^>g0OL.Gj7J`#,Mf4=g:Qh5`&eW'k7koS^p%Z$750tp+Qae.JfJ"Q'+s2I bR!U-sfi;c[Z!0@Qgcjp-cWZQf_.RMo-iALo,jN]G+c4DK-:b;a10*=aW"ei:;m.ATm5gM, "rU:I'a=;O&qAk-1'^[=QbpN])+U0W-##K(>Ls1rp$Ic+C#EX-7bs)I#5TF2"%8BmR&<,.9 N[!jp"Qh2b%bh=#h[2!p$=\Z.JJ\n`VAA+4fWBc6c%uht]*o7k$pq$;U%i_grZ;11*Pn*[_ "?=linAA4g4A6(iO$rTp)bHt&`E-s5jAUaeIYI.&<59Qd0AD-RLR&9hJ*?/TL'LuL,jc(i! oPrXoB$]1D:?YU;PR?EB`kFn'?_3PQs)YHSfk\c@D0u"[ H*Y9IdY-+<8cCl6Z)@ljZlE7;U;;UWDi9Tpm.6=W?tE\Sc=JG\@"*.c``naA%Ao.r%Vi.L)#j6d=.(8O\>).;5';-OdPYDqC:.,RU'+oX]d=XmXKgm[e&:k K3d?PRZ@S60Y)>&7nc=n1oWoo'1kO*sAB'e_HrofB)*&O'Tb2p*8rL\+^H+h!?RB d99J=/`I/fUf.GD<(I=Q3EW%oidlGq03G$Y^o8k_&lO]]rV'> \cpPu]Ykc5qQ"Cj9F*BhGG8cJVXcN2*og66 8lqOpDj46j2Z?-R,t;ubE0OpQ[g&cS$V &Wg7i**+7(YtZTh!CJ)O,tNnZNlgO)n1/8Q;0!'V?>oU)(,8*=eZ?"[l=D9c_`m9D#i=Pda =DPBKjZ'#A<&1so$`;e5WD9pFOG69QJfKiHSq;unTf@A*)R`m=;Q=7l`B\"<*J&efhc:r+I qFWF@=Z$TIoHZud-T[XQN?Es?b_.'?. th"pKU>Dca%DjnQ5QAo$+8rMe`DN#hhEp6)W=9tFeCtFuULo0@91]Ne0nUN**id\AGS=I:)X-me>mn'h/ttTeL\V@i ,lPfFaekqgbBBHFL))RNHn1,C@!LU'?>\5n4bc;@gSlHh6nf6t40ITf=8g.S7CSLF 0GK(nq=2uBHgs!i/2=&jMB=q>o44T!1%18.S_6-l+UK7[9^Sa9l.+mSG3HmA_Z)PO![=?V; *T;l(hG+koV[*P^TZ`@9=X-NZ*iT(tmQ5W&*%!Z-6>0j;(dtT$+'&[JcqVI([RLjeW1u\?S 61Q#3:(b!qM-,nDRf>7oCPj&9M>I[<0S%YI8W-V6A!jf[R(]+2,G+c[$GdPh_3,Bq@uU35Z ^BLR\C\(hhd=Ps"X1JSGk6t8;i^`Ug&iBO1(nq)WZ:!?(dU*`(%XW\o9%]B\!qRR$2C..dK GsiCV,Lf6^O#VPEYm1PFIq#3CQ8s5T&!,PlST%)-@$2Z'FT`'VPC?H#:23EP*c;&0_;iTaV O953+_ZQoU#:]ABM1#SB?_R5Z.S=!;TeR@0J7X<>Zei8P?$H((6.F**U;H*q_K&l=,b%p)7 @q8"'P#3pD493K_dr%5er^p0>dW/Pn,=@.Vml(6[#ZN%aaVcSM;p OCu-VDnVoQj+G>(G#E%`g@Ej@eL[JZlU->_joK+SDIAa]H%PVX*UifHDdb_o?SEN04?s]JY B6;"41FXIi hqh'*ar]m6:@oB=;d9@#*J)ZmgpO"A\AHs5&ck6921+X oam3PGbi877U"US.iQ^5-nl"6[+f69k]7_1"cW[=>^HYp^0@O8uoUeeKaL3#'IL_?j)Bi]# ]cHee,PF8GL!8`hIClrsnf7am'YdEt_;H2^HdnTTYMY95M#Yu\R/()F5,FI=&;KL\tG3r1/WoiT)"M,)]K]4EJ^!s52Mej4XSPg&;S25OZ9^?0boYdj&+IiIQ&F28>Hh5@C0.Y1Pf U?a]u8_0:>J1P1CMl0"jE#B2cq-p45H%:T0Kr/Imb3Uf-FKg/U2%:T7<.PmVNp(;)a2CK8O 5G/7BkRY"4S!+*o`Za.f,)dnidC_J5C7C2grrHGp203?oirqCuY@'CJ0dL?P>6m>OMPYu-7 ON6F&R67oN0pTuEo3'l2IlF(IBXA[@2O@::eRVL4Uu=0F]@^r.4$C%(EO=P=f4D;jr4[McE -Qa_-Qe>iipumbc4Pm9aYo(ELP[bV$&[Z0i`j*I+*CmBYIU!bG;?%h2Z8@Uf8MX82GaLqIb!ln ^KV^*>EjVku8s7]-/^#p1^Fr89m)LeRP8)1s9_26.2GGFLqKe`R>j".CZaB0`:G]PIDOfdU E+_u=%08akZm?5Kd53]q6rA&K)bujtuQ"*uu't%[Yf!WJ98X(Q`kXl\8"bg?EA=80*&>hUSA_C*qT4_=cD5V&NQBeLe>5 $LKDHf$d[r5M1"ikQ:[]%D<)/esG8t)%$Fa-o^Bej?6AO2_V?So1b9&I,.rI/,K('B.r(cD VOi3X*MH(O[%+,FAcM<94.,Pd@-iqUeRNFTK\5E2$T_,4ZP[N84PjV]sTQ=Y>b#?(4URu#0GbYT'+5m*_6'ET-%edG,)'PHFBZOC:_]oX[g=gE,f>k (<<^sZ9]+7R+V+"[I(L/h6q1tQK,Po)n+qAm^pL5]l1O.s1+Z_Uueq%]JgA>EBI;=`c8Y8+ 38IbQRBpr]XKMCT81hXBpSo\44!NS#=m0`]a2hl'1&UR8qigK?.S]IQXe`m*Of\9p:\Ljh0 6QYJ)5DjpOhIMIQ)^a&qOJq;N6K)%Hr*:Oq6geVs3o&EurrBmW.L,aDRLNR-4!eT-)8KI/d 9mp3f/DfCs_YLZeF2^R+?aIfJ$krdBO:AI*or0a&0L/@;IHIU\&gB-bBgiJEmoD@5gQ\f+/O2 4bs[K+[bIM&6!Q1&Y\Q$Llc($6r5TV@b``M7o'jDZ_iWM<\-\L[23;r?]1%u01Hf#(umG^N =L2^&!?)cSB1UM"&NV9iJ9-S1j+iKg,qm8ocI\fIuf`o5=cXu+QPA2OV.eANrcVYL[b9b,J \A\6%1-:S'cPf?;4"S'LN0HT-U^qP"I`#.4#\),==FM"!V2K8XuoK'"jKfi:I,oR9#XEjJp D&EA$AF]pKH'@24C2=/Ign(u^D](6[*$6Ppmt+cmIR^5pRkB-*_'=)mYq<'kQTq`0N/5D\Vphja/]/M)3i#JM]6"hPL3QE]7%$9$a 7WIEMa-)6U3[At]60^ZkAGf<2mmh'=q`h#"!hbE@8Pf,O%g&j;T_'Fad5iSMeAdkS3aYTXq C+jMFfnZO[ng_bQPQ?Mae[FY&ZRZTW::Y!<4\>nC.`8:%MC]\FrEP5#f.F\,-@ >@1G?$,iSJ;4#BPdpI^K;5T+U0oH&Yh TVM.PLJ.o<&W,A]mX_4Og\[9^*2I`ts,2.paMT25T.?O\1U,O6m<&Aoo*3!T6#fm>InI(SeBn6S2qH#F/T]T(uY%M?BtDftN_(WQ8X46_03[J,EN`,uM+di$s1c5!$Qik-fKJ FGA8_"\]K@([5,E#?_2@1#`NN%'G#JD;!NisfG+'L'QnmMo\P5!QOHM/ajiJ%26e@[pSYnT 3fAn-0<]3&-D#ehkDAgDj_9FTk7]AdLht]L(tA$o0XmaUl$$6VKKL@Dk4+oeS#Gm%otfVH6 K%LdhUdSJ,I[;2T@ZroQ>^R;_e3baG4^At7:,`UIr._pEZ=+c\4nA;-.$+$=2Koq-)k<&&IHkCln$BVW?X)>=W?CM 9$i.0Sg?N,Xp$b\NT,ahqPbqDf-T;4Tl=Q2=p]f:^u)BkS4;q42Z=`TZ1r2^sAa>7t#9\GjeoK,?mUaXgT["20lt?pD7==Da_mg]giH-,sc\&P[AP3nO=?`-\\oi\ j]gJ^j*iQOMJ;kH+$H@0;e2'R]lK3MMRs$E&ffM-&@&"!CN]p_-L"P<&f:e;[lXSafLNaSO adP"o0IXr6Up<.)UA-?riHuiH\?1]j$pi:]r-'4Q(K8G#s!H8dM"Mj<[^(pEkWM"oT=mFCo 6N&Ukl!H:[3H;SglF>YI>.uj58JcIol)hJWM&cE;U `^/kO.ahtuKLWoNYsQ+99_3E-!o,F!r(7=sPPZKj2-dksC4#/GjK^m#)>Rf8(5DM>(W,^=c mlJ=?+&$tm>1^"B+,S?gHBEg^g#>f%:KB>I@90n3m[)5^+UJJ_4:;OH&L4D;caCPH5&N)mX 2*<#gBO_-`%CN6>[>ZBJA0o*7,pj"([F?X[#WI9[Aci;J$[QP7Z>;F00=Fel2Ni$fR)"@t6 NgN1N,*E#@rfJ&EPmGg_j!(h:dG4^ICEC0_p`b;HA"5HGc3ka"5mMgGWl;j`&GPj\(jD2l[ :_hJOG-@`05]S5WjaiKLE_3W>Ir(^frdVMF@W*`=%XD&Ip8-b!e\=RZM[tLj_9$-U8AJ^ar VR**T@@QG;Z0.]?2K&8O?hZF`M47M/5rY\1.TT+qaO]GtLq1hIK@4,.gPKU?40P\Re2CH@u %`l)`*BJfohAqV,*`c51:n8F)D@"tn*`Vaku%!G)[G/o/d#@Mg66sPqsEuZ.I];*##Z')5h gTAWS``-Qk,_=#li&jT9#&%k/KN,UcLWFRn`Dh\VY\j\"HH3;4/LZ*3/<7ChO1dZ;8G&"c+ F4:B=%LQ"a]+PIAZQ9a42UG-9`3$l9QS%^GD5!5@WjIMjGCPi5PcCu=(r(.c5D6,\jK6Sr*etk#"'b^gbd,"!5sOG,)]SgrS@6DD[md (n#%0lNj97=8.7oc:^oY5bUqY%%^E#"U#FKP%Zg7pAAqi!&_%al)/B0t4a!:pu"fNsU^efT t>(k6<##J+tPbH=n(pKMJ_9C@KKHA2[C@2I,=\$>m[#0rH-ZV_CVo5Xd&"3Q$e::<`+N`9tq!G_?Je_ qT@PbWZL65L2]C%M1ONfNnZ-po,E/5sWcM+E1>#,lLA+iZMf\5:,Qd+#SKFBh>BQq)91a,LZJ0QEIhppp!sh6u84&!FC=-`sa!c3Lg,deZ&Y*#WVtiZ:d>g+c7/f3B YJr%FE?0<^gS`-uoGu43Or`,)!U%j[dt)CWlruf!7(WG^^WbeV?tBL.'*VD0!jKF%f\B"!C qSJ1-,U:'$$l!G-OXUs-IG10"L*blUYIbgT93e(=hRLj3K`:_V)rK>Jb!_=/#\eV;>nLX"Y 2fPKEPb$p)Z0`\e"!FS:fbq+"].Vl>/^WkF Z@iu#R-l4e1&F7]k1;>ZeI@EP:[;.S6a,$-.72ggOVsWaCmRCD_B9Kdj6_I/\RSBSVGr;dC mBD[DL>9_d"@!KG[@`D8/s_EtTmD#EX::S[i"5\D5'GPXo/9WNal;:^3k3]9I_u*.P*+BS? .Z#0"=4A\MGm`t]kQR$"3`AZsptY?f+*h8pRgdBHY#Lk`-WLL!/O,sP]f5i+lVK^`^\L#:a 0kMCpVhNIU<=Dro>Y3L3Q5?-$/$''&b6I"ir?NfMdABHIn\2iJ&0Q^eFicJKAr^haSV\$;Xb=Ip rS3bp\d49n^cG,;glZ"&KK[Fbs4T-K9b-c/>\UX'CAJ3riYdK5`*h"QeY:0#J`Itplj&MIVAXR%O27DT8fr^cI]^f4JJ]%aT\#<\1AG8lS5NDH&g*HQ!5!iFoL1"p)7EoCdbL%G9 #&%nXFhM'tfO`%9KCDP=6"-':)-f@5geM;57UirJ5(okJjh2h#7!(q"=D!92k)NN_&9Zd!6 O'3,#?'+U#\/T#N\H,k=r]sObg\Y8VN_kkE\m+S_L<:SipZg&mNQbe` 5icj(JVWkR4q![XDgIKBPdXkYQ&L!'B,TdtWBTK&,s1V=<]Vn4E+aKbuOO4]"FH=6N\HOsk a6G]a5s9EWiB?`!YaAsLo9).3@ABpP.NV>d-,D6a.`Z5s)3jKr;YKA]d/jXmlT&N,<97=o[ hbI]IdhM:B>%;L7q#DdI+EQ5>HE<\9QjqG)j@>3VpL'Ura^fuKe)I]3TCK;;+D"B^QpMeBq_8+6"'KLq6S4AgD0c,IK46"+Zp$Q7$K,.-s.7MNs&G0Ns+M$3Vb?"#_duV 3&,t0SAq:";>R(Pj6Q.2red8D&1Lc-I<1:5Yi.VD,r_cmQ?MHT0t:sg(r@P#!q<&gY+6Tg1 Ecjf_5MF4QLX`mM2^^pd>5R=QI/tmS;l_1QCS+kMA%"/jiaBOTMUB2@=s`Tju-[\(A[F-qNdL/"F+M??-!X>do&=Smga)O-NW# 9.'4]B8l0egabq#:8HsEN"u(*'(j-(fH=t>D##QOV?OlO+%m2IfRh/VT/&q"3H>uFgnPF00 I$87VZ^X^>kSG-,QQ#&rHuCq[n^efOk8q++e+$]%aeTDasEpB+QZY; $B4%Dh(D??Mn`>MsnE>;8=u@:h#,90P/79&lm%YVh97RK)%n`rMbu":-[Ra>S[d6!3khFoUi]pcS_h5m+ne"=Q?j84.PZAcG82Ins[+A2`gFBQf]lNL n_gHpR.\D!e.um@N'90E0;-J03E5o@!==#(j\M:mbc;*=IY?@-GMV`BJQI7H6+Ye93hoNQ> VPV8<6kMEn5=&ueR->qMF:-;sZ0`b@B$:1giC>!Yd08M$AG)BB0A8#&sq[(8[]Pte2Ul;[& F25]>X^["n2j`\=EYZBU3-.A+rHa?m,p7#Wrh.jH(DDqBWf'.ChhJUrG`U<\Q^gAcso@rs( =g6n*=M/6([.AXY<(o3M9lSD$Ahs1Pk&3DOct@G\r>(_kVpXdOg9!iJ?*2ap2HmMX27nn(D JUk)4/#ELDK#;4%Moq3aDZV8#b,(SW\q!P"CC76F$G00+X,gjn*g]?@ Q=[g$eZ_ID8"%e)g9#IK*YmkN.^[O_-%-;k#DWWrok$n\09'AdPV[[I'Gn#f;[n/I=cUX>: 7%;!^1QRE&IkHT+eQ9bYJX9"&:KLK"^!]$ZHK)+G4.D&UG,UidWd#/RTh`Cf[IGFp@BWi=( f9T^XBnnaR=8WnIt.*@^)QAKjr^N4^r+>!m.`H%C U\[BNeH=WGC42c)khe(>63!%nHR/9jF#:c#^?n1#?H-7faqsh:IAg[jm#=d*:DKM3%9lBVE+f%;XAr,^mp"bC1f_ 1l.D:s+RYB/Im?13'rpO3FA3X8,Fck2Zj3()d&ITMs#q;.1%l1uI!V)Zq4)%M.OZ4:!Y1+@IW$&?oaU_4_D`KW'_>6=pfr84Ntp6mm[bRMJ5W>70>20np7b(W0?d %ABRVLJ[+S6\p.#iVYip&IoP3!>HouBSmUG-7-U/R1nS%;2MPQ-k!8f+9hOI%q>So7CWg\" *f0O&W/9^36`=N6tD9SQoPH"SfG[fd>eg]36+#G*Fm$0O&=as`t7/oLkL=';@JB&=TgBG@! Ns7J<@q+)'d6/aUfXmS.ib^-"Or\P>YRZ'1.(C&unl&dY^pp&qhgU8Ej"UN3]gI>g[,08!X e5=\Dn,?q`;2B*Kbr%H5ZhOPI[>'+GLH8VJm26)bhkZ(!@UG]/_u3Cf9.Bh_a*29naM';IN I#rB;Ech-1d'9)q98]<]&7-C+>R.Q,d![GYad@//0"\d@]Tu?00)KQgG9UYc4kQLpY;u$t2 Z$\B`lJn4Q/?^89>rF($&Y]t7C/ISL77Q9#8-sNg&#&kLAK7SC1ldYq>")#^,"rXogi:]`> `&dV>#7'#5>suO9khR*Vc;BA;jr&.LR@o[1qo\`>)cDE77jIY/uDUua?PE@\.%bmZ8RHC15 .,H=XtDnb/=ZCAbKu0:MT7,g!`'Lo$Yq/CIr7-25r1 f1e!&jTkiAG:25?GW`rZ/DJ#9_#Is=E8>ptJ_=0;dG`Qer''7p##BR%ZcZ!A& ?%sMK.`,,TF-gagh:o>]Y3"P],:$*>$JenS7H[iLXk(,iI.2'&n\*Q"pg6O#1;cp9HFN;-h q+u[n)Mk6!RqFj=7Z=Z2@72:0*C.f'n``&%i3"N$j\!\(W4=H%Bp

4g3"5n9Q0L>sL&F pnG+EnB9Eu%'C=s7;O+c'7G+QHR\NNo?>a&qLG@uPhrnbb3SnK'1@=J_.SUf**0r%nYpHlK uaB8po/.:lb`).RK$O"p5YA\>\uA(5uNEY:b%>fiDQk`$*>b"!'n+e)%?dLZI<9ZbsHSTDe pcU>oOdZ",roE%`"@`WK7V&(X6'91sOD@SRuF*?4FaG6B!!2e9,!mH#?*-Zj[\1MH2>]=a7[riuDlEM,7 W,X*s6n2k4lGd3leV7k$AajE?Q7_BoB0KWojL_/ipoc+0S=Ygu=9=Uojjq>WVA*=nhtdBje .=Qg;>qTUe]43EeYU!`]mWT`cLe`D=,[LGa02)_LRHNt)?h2ef6:;tmd!<""7m1YORKJA2] D7Ub5l!5@th&IQR(;XZhMBI%dY7H2s*Y6&29=QiJ+CsOQMoK)4=a[EVOn'Pgqfu"]1BV;@^ clZ9H-?;=Y^`@`5*#tq?Ua4m-`7calqTe/.u*QE)8jf?%cQ%c*eUtS%fuM8LeM1EnTVgh&; )*Q>^Q"H&'=Vh0B;ufQ&e;rM2<)ll=?Nh'ge:F(Ep:R$_4DbrruO%3E%Kjgqig$7UOABRR: \JfL,jaMU!*SqI\\c27&[0&0eGCkAU:uYQ3!cqV;\gh,"M/U$s.4qGF@+lOKrrn/VQ_XHm] ITn/XO_:%"RSHD\Jfs!Lq6Y\O@aOH3ZgFu>)W[JRT;B'IXf+;3 L(o28FAPdQNJ9A;*'t3"#d?5ncp%gjN#b;Ul3+cRY^ZfC[0glL$DW]X72-L>HJL9c!3j'8n @]5R^`DCrm?!i:+g)iZf\_\Y%B]@6d+JltjUNQ['7m"unBVV!oac$;&$Z!Cij9`"_ACMB&> _W0!BLH\2%a^^&["&)OWIUjS.hQ_nSp,@EA1TIN#n)^'o#/.kCCVZJ^=r.oWq;b'?%KI:aH/S-Q#^:BOSUeJCNn)PdX?$m.$VXd@T_ ;UDdok)lB'0+oEFU]Gj.7mh*5#Z+fYglkb2n(VsJd+`%gb@dpYTn57p/dGVXqE"bKG=l@sG mi$=!f^b(Ko$R7TkC=Gci!']T+KmjLmlgjtNX\67ohSL0mnk8a*?nB(I1.I>X=j2:2"i's% F8d>_"80\i"0gIp]rr,nk@$h@el(W-*gZ"n!td<>p_=?'-R.mO/g;7FGW9$&Rf>_@2Ka[h@ JRaqsVKPnr3L&h#/nObOV$\Dq=m8V#@Tt+Re;*&*El>Z6XAX&YW5:+[#fYrm,W(/>?&CE5= +[^.I;38<=Z>Oc(&rK._3+/u$erV9I@t-8Mff0"VM_!(G0UF2j2]MZ[bW@Z5eG]2<>_t_=esikmeAp%We+"F.G?;h_ha"3jYqLo1] 9QkB]jAH5d>)id:Ya%&Ei#n%fk>J`bRcuEu5PW/s>6]n0Ap'(()d^l`lhcOek/S6UYpn7$4 ,`!R;QM*$6?n*T<<5ng"X\?u:bl6%iB\i0Y)6#\qnX$`!9Ol%?W&%S-ut4CF YP<[1AnGK;mMlknt;'WVZ$0W+e^#&ZF9b9Rn5CL#)t5X?ooV*f;-@`ie'1/6Ke5"MBj,Rj#N6d=iMSI&-X1XD>EuU#UZN"O)`( oW&:lYUF$N$%:=utB=]LYk[GWqdHlA!@54`8fPAOL2o3Z#;2['dFUl.2iD`@@r?u@e#\J8^s/"pCMK+TFP@KGp#OJoW',O+;^^A!VF?OoY5G]_fI3K,4$igo[? Mkg^W3<&E**iXATR;!Y0ER%UfWp[.e`#ohVZ#:pgO)f5Z!.F`uA]KX,J02&+.FHRJB:;OGemuWg)a\D)L.g3jL-+\[Mfp8NOF=rb5Z.@O,eCINg?#lZ!\RQ>SAF&2;!+f\*&i3jcEs 4*'kJQQG0d[\SO1IMKp5)\KJ@)W#&jo>Y8HUX,=FGSe;grPIB7bn]2N_>RAFj"kNQhG5[[D _+:[f`:8$ZEAn>mnb@?:F;[T0EZ':G9DfY-cia#"R(#(sH'%\ua\:;R9aiih5 mE8k"qG&=&HMWq[-r,r=*:u`:RSmAdT:X:F*G16S@Qb3lu!>b(O-R6;3/'nocJGO-W4+/Gr M(]oe_YkQ[0PFH0iFJ=05Gj"'!),(%kLP\e$)a\fBZ7&=:Fbg**0_CPJ9,!5Tut@DS,g'j$ a^UU^Q'cmUU0-N`O^KK;hW\kduI1`R[jD+,[Q=BVL\Fq>BH0!IXL]p` daB4Gq4h'=.tQ+i_B]"(bNfiP cJ*cpL2FF,/#bM/@"&%m"Q).;%1=b1TTeX,2\(nfN.H&n?GPJ0-BII]!%@0?ti73f@::-f! m5l$joZ+tXeFTClQT`0Og]>8E>S2nuefuLrl+i8GJ%q-3DPnps:I4,gRSt%s8HpLYum@Q>* `2LY#f;"tdR68rIE["abdr9.5h6OYLBgp2&ddTt20 ;7.Qlc1#ao(POXY!k%lT3b)bF5ufr3m%#]MXM^*B\nSr=R*FA0%\&ZH?Vug?l%k-.4q*3N@ ZQ>;+Gg2:Ht5;PF",JTM?*K,S0_'OZd&>u@kr(9E(i'O]8!q.J8)ZY_YUe%I^_U%&g_64ga lBKJFl)ah!%:Y:)LfWf(s+P^9H_@n'a+(=.L[Qh3*Og]\:lCjd]5_HOH_&9pVgUi0KdA@t9 hZQ7C*!*Vcq)u:%e8BhlE5@,AJ?TgJ4pIL]hRg2-4n4cqO;%\eec=Hj]?-AlC`0E4]q,\H- `S"+kQ778iOeF7cV/gs4:g@k^L5h-@0R3@kMoeHj'_]p_"GL2YJ@]U%UfJN+TK9G^NOWn_; $?QraFpfA\sCD%m^mD:U-Jdj2:]SkIa$tHqhPE2kPItT=e6u**o4]X:dIuT`1H,*,K2;>S' fNa.BE-5-?9BdEt)e9#QI_AJ:i/PM3akg3f2ZRRtgFV9](l?+9oc73B]8rQmal3e9O1_6a[ 1(`FC9bl7M.r6,U9*J0Ap%fn-s]\lHX3J62Cn\3]Hm>`21iIo[>cb0AIIkb;6]MSa5*e(`m rjhYHRR-1\ZGB'MiMY,;-a'(Eolu92+k>/WD>&Hnp:kDu+n?\jg"XoO)Bi]#h,DjRK8Tbf' #7l3hiQnBar!E%pAHjZ+ncoW?kZgmqRq>b?%]N?NS'l2qlYG%"o8j^kcY#jA"BI_^X;D&L` Cs]lWFtW<'U,LjkKgt%)MES_:0?RN";K.s1(B;"uY\QR'o]sQDpQg-5R#D6fHE0Cec,fM+( ndGgonW)32_sdMW0ZWh_C.<6!TZW`(F794egSCIn:hBUqY7H-G8j4e>I4F;a`YJO?2/)5cA >,gIR1;lR/#Pt%`LX&SBW>/bBdBFq?X5h5,e`FQ7,D&.IuRb;D`g?mK2L!JRu\QuA)He%4o Hjh.E7H;5ng3Q&ScY+Ph-PqZ[@h5MJanZKqb%7lhF6X>)HU++JVh?6.m"Nl%[(:ZdVcftMC =&o410"sE9^R$#D8u$e^"i)NS.52tM8S@m\K"pO+-k+5F8:5*G>"XYlYhhTV%GR!].kM\LG WJUk)3=:I/\%SYLW%4X3Ki#`Z]X"q]>aOO2'lRqu8k_OW%kmA9"@G5gV%m"[OhQ&I1U@HjV hDjq-B4(U18$$c=[Z2\/8Q"?R14nAuqJ$nFCQ*+EIh))&-Q^s64cUX#"Xk E$!eZE;@J=*8?tX?,tRT3P9rllFJC2)7"IsEP!tML/5&mb[kCC\"M$6[o,PY'9_1*i1oS2F/8+`:@kIE@2DE_(d63Or;AlWF;50Kd.AUr6W#[O(Iq>%KcuoM;F'dI@on-XSFo@5,=O ndZAQ^mQ^i`C0%ARW47Oa@>']i3&Cg0rb[r5K["hAVWpDq.l>k^,)Entq.fl^T0L#6^2"Ym GG5bdcUA)B6$omU9Bp&fd%GQnJ*@(8Z:Kj`PF'8GIjFsDfPG^_/u%:j1/3YI/g2icpP+]>L[JH5kk[c4V.iCrQuur. L#nK_3hE1JCAPBFWp=u)Y\]m,?B00"-e-nW9j9a5Zu(.jgU-AFB&U4:4/U_:C"j-h]l/8[q `1,NC"PY;jpq^6n=2EN`,U/h)oZgPB-5694Js@GEdYVPb]A0`43[rAq'^-FT"^.eT H:Q>M"#rLL]"\IA^l8G5]H\G8t34VHaPcpOV5s4su-GG[UiJP\**^t9e4i04_'O@BSn3%Y>B`#F4Lc,>H6%i't&].XI$/ni1Koi/I _RNk[@>$FjnCAIEBP@q7e2`;GiZCOlJiEmPDM(b^G`:U4!?tF8*Fb7,.Cc%J,)VhH;-#/8G c)l+XC$BO`Dd<825cL_Vi!>T_OW]q(X2Vd3Fi1E_X[/5psbC\._-GCPks>rFJ h\-A:$Gb4:B?8j'DF'$Otn!,,F@be'3>oW:d^GZ@3uC'3S[@i'u`?KOr%R8Z"U9_jtr!-"J >^u.>20\g)hJWDP7FN2Spp`W#8Q^ieBEsKT@*Q-fc%]7*e)VNt_kCKHf7aUGHF/_>u]_\66 mXJ$d!C%tHs.F!E6O9AJ)oPn?4iaf$d-;a#O,-V)meQ/`9Ags_052M$5h]49HT!PHE=mK("Xd,clf"0[B7W=S.,5MTACQQ7KK8Ltj(7N_=%A^4Omb_7'JT!.RiG6\hf%4p=;Q=TV \Wnr4gq0,!DM)d=im_r%Ha)d*YkoM[L@7.g^?@3Rj1JHZnD8N6H7p]E+2dg=hYZ8ZDjBq.Q e)%@HguN=fZ"JBi]Z2rr>c)mY6tl="$X@/qQO!*_0@=3@)8ciK)D[!:ZDdjHnC(EOR=%hrq taQ6&8_No,=AN,3!i-MBM=:`K5*N_AIV20pXQ6OT-6Z4Dg*u`]M30Xs$2,;Zt-;\.iltpL5 LW'4QArad$cke_H^[Ee)^Q@88UJ4L(13'PWPHlN$&5_141-D8+/d!6/']A1]M]eW :jE>U,\^ri4TnY2;+MS[X<*K[UALOAJK9SD16"jO9U%D1p(d`HjiJ]6[afMhsP1N?"9e\C+ QoLG]#>]'i5qiY]`!ucZBM@ZWWc^e3eG?XS(XOjr_YAHhF+/"BBtRpXi.MTHPg!qAI6'b)k ajjOH-\()4_Q1cTK=o\m/SBSrN@5)/J']R/k5);LHdF&B:EJ>iu'h0 ZSmdV;uYkt^d*LjVdLWaLf8XY\j=p7%hN"?D,PK;^X@K5b-/;#!SaW7O7h>qR2Q7$t;#%2m Yq4JBc8IiHO8F,b1i%p0`BUK"7bfinhgb'?K-jSZKP0;?J=8K3Yf%o$?mMSr;%sJ*m5`-i/ju1g,FW=p5HQ"di,;8Nh\&42=KM5Ys6 ma>!k^uB*]:SR29[6HO?Nda3]6OU-TK?Zi'E"25diIZ6BZT%;ee4SC ;S1G6JO*.ln'Uk9E\0a#1u@snN[:$7CM5q2XE=\"*(e3EjnFs.-#G!)g=5O3tQ1P2k3&jPW q*_8Wc)`6lUQRX+-8dJ-:ZnKj08LCP>0'K;p@N460!qo'$l6h])0G5?%8DlqTtGor?2t(5\ djQuN@@Yr_e^]*q\.CfWuNZNgN9SO1$%F1=ZO>=GblKdt"P-oclnBKBY!`Z/DV/#>]t@P"" H3fBqj0N]6ml(,]cDmF04K5*Iq;t=ER$4 ^;l1W8"<4BOYmAOGmDi_`;sa4uD?CkkQ/Le*J]#H2j$j 8MT]rLPu\"[FCtFH8S/>5Zll9=:#T\sgCfKKPmG_^C/PG@_<"A_GpX@g#tLCcn,U\MToYVO oi8Ak?rbd,DSZ6Nal"irJ(&68ih!Wc!)Kof,^NFt9Sf2CKG4Vm2$#NLbhO%/j%k:u&Acj8boG,*/050Y?\@8AKucE- n3[?Q6NmjZbW 's>/s>L7n"%P;Strf#6Orn#"2rj9c$ZD(e-q2Qs_fTH`*80*#S7a#/k2C6.gs3H3_+m;B6. n,n6:#?A=p7aHU\l/J6#T-W5kl7p4GuW,RN^s&.)?dbOlNcu92nE@VHsSWIt!Y^4AQJ^[;F ;cPYQ>rN`W63]ti341KiXZKIp4B'Kf'aSi7YZ&_=ZUhT1K,fro*0AZ%6rZ23L6,45XHZ:^8 5sq,#5D@),sBbii.pmk#=)=CUn:7aSlH+AaonG24]>?4<(]SZ8ee+%',6+m3XD&3eAB.F&B]NJQ95<9)X0O')nQf`:4=W'pin CkQ1\Ph9D>V!LHSQo>TP6]IO0kl&g)nP9QU:DjL84eGM,50m4%6nJ(9,kqthJ2dO?&bQ#iK r32?8LckUdcE+qBP*"OGW<5se]k6s`NN:h:!dUL#/G87D'N7J,25g:gI,+sLh8Z<&36j?gR TctTooQN?4_WDKMZ8XS\J$e^eoNqd:bE@EK*#5`)4@kr^S]_c+FGG LT8:;i5L!Nu2cs*Jld\57t@Bs(=Wa/>uh-Bs`W+?369H?urL\3R]XYsIu2r2I-*,'SPaF%9 Qi*HlO?6/#Xad.[S?%Z]u?<]+<:f)`Q7+=*Y?B+4kl;Nq6ink+T+>@2W I8AC9oL\lj4&OtrVdLmB7s)*[Ce g]X686>qYB?QM@i.t`oYUe;!7KsE/K(rXU:a=R,DrD0;@3'As+Gkh<:]bu7=(QU"V0<6]Uk *Z7_2]DlQsg)a$J4D\=8j4ucsHn-#6k/k!172Icj^024TQPSc&IJ;Ct^6*aGcYF:!P4Gn3M ]r6Wh>[=Oc<_'p<&*04PHRW$#;t=@IuhXG.!M"D*qF]pOjKm9-OXj.2]Ch47]unlbn_A'k^ %.&e+bFA^t'OE!9?Q#fPhs53LQWs&``cr5ZICYZ&" gqHWs/lEH-D[0:DS(/)+(!kua\m*,f&3)V%A7416>[/%M>Q.p0S\j/F*8F(I"K5ebESj]o"IVWPt&`"V]]E70TIW&b?E+FR^"KT,k&\`rICPJ\Ak?ZnVD; =<#o`fqh#>T>QY'XfqHtUP]TBLLWEWWX+u,Kd`.heeV\; (::kiK8Npc^)H;qZmFY6@JC(9m^HWe\,^As!,u=ucjGLE4Fkt6JCmbPi#gT`-gV4FV[@G'S Vc@)b(MH4KOuggh2Gh21$joSCmHelRXEdB9/mR6I6K&gfhB)@DK@D,Ji9^.;nDG,r6J85AQEb9 LZAmX`aD9L;iI*h\cASu;FL@7.,:5(#tO=>O2Na?Wf>jk-gd;V"kZt/.?55WmoH 4l>Ou6Dqtk#9dRj:C2X#eE#/R+p2(grlFXLaE*dMQAk4ODMA]6,LN%G"Ap@s4$ZOC8"OLie G6m^<&9/3m4Qq!E-tDN!'I/EDK[:WN-PpGT(S:,."Q1P=Fm\_-L5Ccd?2kN,l.NcfEX);2" 0Ri$ePKrIOn)8/E`S(n@B5YZ$Jn5f[1KSW+!F5Ethm]?$[4pA_rV)-es`in?N6japW2!2124rS NX@4!>1fEY!U3+%BSuOfQN5GD3iq"W>T4fgk651 "9;E^?JkJRL$f`^G8tkG`(aFm/oGp/g32TJtn[`;k=NqMjHp!;lOX(R*^PO-f"[_H9]J+%PEdHrl'cL 5@gGOntsPO3kmA'djNaB&#Cg;Go):R>mOO?j$,Dh$'j&smT`O-^+RahX'j5p1,K6lm'(G.o 'fpk2*_'8aA(9;a6npDJt1UQP?DL-$WA8L.2:7%RC*Q:b_o\TGi"1RH?kW70c=(55/NP;C_ 28SH4;Xr5_m4W9GUV,M(bqIN!a;6!U\eLJO=ZWF81CR+bPL:q'#=R=UC7?Z26VmkJX(o>4p `FHInlDE\"o6@rUDjU@X#5s.h@.;fR7M?Ml`Stm)r,psVUMQIJboF0%/o3t_9?:-tIm]mVB loel*iD`4e8"[1h1i7IYM&8cRsha.CV)L"fS;ki%tVUUnG$ZRdk;l%D`?NS/r)rn'7Y.(// G@o[;#$^qjm`\LV)U9G>g$#KCSg;l2,ncs+a11b]Rt*fc4qnn+us2s3L$3r]j-pY\]m!N"C gak8EE76-)_@KgIJ`+UZ(_ZmcC#:s:p.6dXUQ%`Ar!6tr/=S.cUU;-[6>\jTto@uob4K,M\ 6Uhq*l&_q:Ga&2JS+37=gM',@;*02;c&mU\KaYJ73,91?Zi>5,7]Wj$2;V\f8bL6=)0[*H8 aYM)h4OGc'a6E;3QNK)#3)0"'krI&-=/f@ BhN(E^]Vp2cL0OhaPKG"n<7=dFK,B\BhbTk[b3@B_MCL;:_MgQqNEDqnD'a`(M:*RAc^(L> R7h)Bc8G[8p\l$;.;Q190V-NP2G>.=I6JD/WrSk9KJ_8pNH1>15VP6mCgRUR,*-&U\A^+#! fL0530R3YU=O5r;*7?Z`"5"6C9@k@RE:`4.ZQf_FoBpe%nSFgJ1UB,71#"=qH'^-GNK;%M_ /s$d570$.jQ3)>N:POS&1_shp[]?Ip>0a[[CYIX[Y3[)K`Nnhl50:0JgJ6G0mFt\#[dH5+j gsjAJOV7lVNCWtRNnbT^[O>j"iBc!56o-r_:bJB#=_P<&t't(6cno3V_--a*8`Epo3D#Mch (KR8^MOTq!\QUUY$O9ot>!Df_->X?eY3Z[qXUk?-dfOG,=^##FIm*/n'e`f8\j9r^h>sKHr h`0TT`UjluWUVlf=_*oF0hqd/ds3KM*Dq=4Bt-dD;^+(*@frBoNT6^#AQqF;*lYm^I/5KEH rs,[-W^_cqLT>66o_Gm0nP'mCgr!S)&2@)Rh,m3(q&V?*N$UL.1#2mE>K2?_&623kRTO>5@ Jh1psAhlqHd#8RQbXIEa@18ig1PX9-*(*8>%E3R1&)uM+LTu+9@N7^jOWG`8R#;U:6qiD&a @;-[1DJ'G<&7BX.n,i+(<2/L&*!pSLS9&3@iSs:Oe+?uR*-E.6u7i[O@t@k>URG1WfE4q3l cL<*b48UO4!;o%:K5]7o4jM;AMX@@@/1UJ;Om^\jo0Db@/m,@7&V9^OLnQ1"8eFHRZQ/L/K?5l \ABUCi.VMN/UGL'.PSYQ,Hk3LWH]+S@5UZL2c2#=qM=@^/e.s@n\>:25Z$4=cAKl7]GBU(h8YI,oVH#WZ"^4Po c]"RYt)/78-;4gi*_FHW9:,H.TG[P>eLVS$+nKZi-YBpplOQ7L:3.$)K^%Pq@h"q4NL(eLQq`kDlNq([`J<0 s;5_qc61*/l;GoIr_oX,%l33+bHUCS_ruXaU2FPdR@Yc o\=jV7?>YT<\h.Oh],0LFFcH4R2eSZI04Tg?O;\$]kQq21A/']YdNV'gd0LpAoUF7^2b6OM ,GX?'U6Lo!RH^/WVPQPW(djlsOaO?M[3`<3\rTc&6?#\Vk!k`F;clm;@mtO;Ze!jR>YMtA1 FeOSS$\Ae;E]_*[Mb$p")BlaOME#o7/WZUj(E3LTsXNBe_.dKhbY3t[Z22s'Z4>Wd#'Y7`m El!qU]!?IFYoOaQFT(db(*/3O!ZRp"l1q@dfNb8eWc0+51X`BoW:n3%"gdaB2#l+hi)CNJ\ `DfQpNb,u]&b9&dKZMfG=BPXHA1(lId:nfC6@q'RKLgn0fWOjH!TD9BBd^R'!Ujt23#Ffmj `\oWmKc?\?q'B)^&oG[hXX;=7fec]rMTc;.#B2,X@b\@Q%.r-_:Og=\Dd99k_f)!EmlWnk? 0'c<_q^5D1_9@(\nQ;s(D6qb5^JjkI;lU&cM[YpZi*8J=oREPZJ011NpQpPSN1W%Gn_GH[OG9o:CHVqB%la]`VsbU3%CbThZPF[JFlEo@GrFRN $g$#56[sgYdR(mRB0P"1V"^@8&':.cJ#\. :>1gIc!lhhU&;2!u)D9.09OE%3Z?%NMP:QW=2VH%$8dD@s4K^I\:PfTOAfRiLnsNS>/HO+2 b6C0V&MHpBe)"%mmWciLlZ+qW,oa$S\[p&J#IMXt`ZG9]7T>_8?J>-O0)i#-ffoag2P=S>W UXj)-La%Q+qT586sf'SLoV61Q*P3>IZ\("$A(&RuSCj;O_8%F4ti%g%u!cKM4!@76A1_rA0"HQ%u%ne0D8L0Hd,dKoc`oJ!<5RHm_p(C^)k7SZJi! ++@-I6ZZ%sKBK4r>F'!j@M1%tuDZIX!5pGcWt&16D=pOqFAf$a6rf&$m`Nj:?eK%e%3QEjI 8$bRhT#&hhQ/-gLZVfZ2F[Io##%n+A81dk-XP/[ErZ!@l5XZk6^E*p\"M+X5,#pAhE/L[Z5 `CsapBM#m)l$aU>$O=LDao`K7NNNbJHn4*U5"U'Ye"N_<5!@eX(;['C8"nOf4#qlL&.laTt'M6gV@kJ5L(`Dhf%5Y+J&CEQqXu-dB%F)>S@.4f&M[jJ7Vh*__1OD(pf0*'d/Ko9UC, 4kT%68Lq3E,B,NV*n%bSNR8*HoiukN17'?M-+_1t#Ma`b`7BqYHTN_"cT,El/7[.g/V-4mJSea. K8(;u3@J1aNhAeg>&(0,N`NWQDd7KJH8^YXOoU?jIqahL&*G)#d5roPXp`?ccX-)^+;dW3t _ID_,%oNDr1t(h&qaAjC7.f80iM[P8bSXbj#kB$N+^u,C9GRXa"0s^-FTYGN-l/L3"`dNf' b_kc(Jtnb;,nNP6(/>bI.f='EG2.XdW\VfF]4HA;l;$d?l^Y<7jplR([Nak5k;fjPuX!2:pHe+7,qne309faoD=6SCNEB00.04-jdn5i*,'!=cJa49:0NJPmFsQJ>*4) $.2$eiRCXQ"cOH*9#i4%RiRI;/2CsC:7/.KFCQUZ5eG]@(*gXp;::f#T?P(8-HXG+l"*&-Z ,(oD:C(Qp=^?,/fI$FD"d=9(@uHFp8VQZ*]Njr&_,#aBC"f-* X#,3\-C+'/2Y&S3"\h@_ZI)t]Ih2a^1R7nQiUF@Eqb<0KrK-79.?_3>B/7oS$o;g7%rJW:0^5?*]#<2Y*[i;!*joE)=bBiqJW- ^2j__?=;M,Odf'+K[eY?b/a?'?8S(#`J!lX"WXO>AIq'.t/r#a)Op?s&JGdm[Z1`G?=06Qq U3$;s;k>D.7%G7NOY,'SZq+_*F"Bm)_!fY`X]F;qHZAA[YIpsX!)ZT6L.$_YKNiKIl>EG!k dNn/&/epTX?L(`H7)O?4rb,GltnVd2NN*-QO0`qu))esWLCDe.P;sQYYarTI'+*a9=(n$Ri S3u7E)&+lJ,[;DLp)eJ>Ph+l[(?(NR0HXiWPW<*:).St8AfJRP&_D_UGDHNZ,(OK:Rdc]S(C@SG>jtI=.E[\*e CI3C9r)NX`h80#GJ:4@'Oq*eK?2)GStXr)039gSnVu;BI9#K!FQRK6$fgiH9)R_H4tTj@M7 TbHb(;GqBL@@-__Ec(-rQ86$a(B8USPoEMjju2rUQ6hkZF8C6FiT3i`6D<*L3:`K\8-j:D68WJ'-Qi\R!Yu9lX'8U?NIkPJIdSQ",T)6d F1ULRfeiu'GQ+I*2H_pR^',#h$;LY@^[qi@Y'HIa,q;kOS^]:K#'E\ZSc1kAGICU)'7Y.0f epN%=o3Lf^#qIl*ZoI[A,tri?8YrIue)k&4&,j=TM1O)Vn,h3&n,Al%RHO/&.uaI)&Z58GuM?pa-@gd*b;=`HdfZ4f=d2:3hcA 9)rmP9iYk+#%%2fhHh!I,4:PGURRs."iLAT<$G7EGU_oNCRp!SE)8!aG^NX4$sJ3*WJJ!JVN?XR+cF=DuYlfrb,2LRgYbg?UNY&01cZ"a^'LI8^=H!P4a (CfX.o3tp"(8(M-VM_//[/>'4pKsMeF\351KTir]oT^PfA0Z#CINI]6#[fL>MbjMe^OjH! VI+R&ip&L*21EcS&=/j"5o;.(88A[IJMi.(ZCr(9VLkq6-$]E?,`[E).?,Cqt8uRnl!;a'& [K>49=MIs5\b#*PokVhGU8K&0%=Y@+:=Tr$CK1.H[-J*?6ZK4>EA&WZ;+H''4nTV1HQ*CZq =&-"4e*Mg_2-l04+UT)L2('MBT)(EoZ1(*P^A@9O;:/]W/Pa1f/^!GPBcMsQsrm(A>F'cY8 "Qic5Y&ATt;i9U[Z>T(?4"oPXo*3\g)'Z$5L4SeSEhl5FQoA'ZCq]^Y2X'35q2Bc69JLf.E]3EohdX&s^Ra$ROB3a7KX h?YJI64TVI>>L)Lc+Z7i;ka*;>?UY1VHrJh9p&9Ms'>[?\iu-UoZ]J\%qgng3>Vi $L8/rBW#DGI;OI0i:*>+)qiUL$7=t(8I7UqOu_XXAtIQq31=Yu^I.@!NeP1arFPg"8!eP4/ ]g1rX<:1ocIo^72lTMXiO=q)O08>B'sPe(ueThTD_)_Ur7?El%f1`_E!PCgJUYLmZW4#MoC A[L.XW*JNp3N@`ll9V!)ir*OEg[?E:G8!WB (K0\c@7jIcY.Eh4Z83qV9bgf/4]CU@BnL%p7#?rhf63_DYKXVpA]][iGeRZ(JAa[dp*d$>g ?\8U!MtE\t'nG:T`=:G5D0of6`h2>*p.`;.l6Ak4Euu?JePng$n``I\/j6aB6hcPZoVIC\n (GciaRS5d1Y-!^RAS'*^aAF;5'IY`'Y(*+eXgikmJ"2\&3ZnudD47sW$I&#TFT3Q1G];&)M h^rdi?!t^)&7Zj3V*(KJJD&u2%lusOB1'E@SaKcM>,"V9(P9rj6FI"&>"E<04`KIT0/5!4l Y:WDQjM*:j0i>qcO=0;ZH,JfJ8k^5#@.uTT'7Ah$:33f(4AN6,mlaIQjSqBi1\Co::inQ&2 k.`nb[ci%N>kC8e:f8A;RDE:8d6W1DDJiro=7Z0'bs)4RYAi,@24ASA5EF5JMn%(KTIK_!] @)t8QOBdEEuYRjaURg+GjDs"%B1G(0L9)O_%\(AY3Pf2Kbj0>'@aH2KFBnQ?Zrmt`d:,FopOFl$&7G%&3sTARl5c;1Lh:1Vi=5s@i)h<:K4-_l(PH4a=3G882=]T4/VEkJ;&9T iph/8Gi."V3qA4U4JFF.hM8#nHG5HDl?aRki'3SrGk>>>rsus9I(q&Tnbk[2eb"5WaRE4Dj2k< sI\37ur-n[tmJ_S]:t?0Z1j''i"T[I3"G"i9>6lB1,(p6)J^?^g_&+U(i3X,L&694UGVo_6 j;/F1P\HK*87#^RH\BbC'GmI]3ledc*[:qr3_)U&@AGi:d,l7a[-A_;+H$f*,XdKE/EGeI7 <'MB=q$QP7NuqKM?J)N`;$/D@\d(_EFp^iW3I,toNdCfE[HW/E\k]@`#Q`g2&,i:<+BHWNR >a(Pp%\,7`3o?%p1XoOdHr<.*%Cs!^FaD#pA:cJrpZ]7*'Wg,@k>GO`Eo]8LYf.jKt29&l< (n!?s6#TTg:6ISe/n74DdnV\il&:Q5F=2hq+u6fnf$O$W:QUAVHY1>Z;0R<^D2oXc6?i+S, G@UP%L1QE'mAB_RF1F?)GRM.ktPsVR,`mEfgOIg;UWOE5sm,+:rL2Tg2e2,,.nX-YYi/d-T +9jR"2!1f`:DrCZ-a`K:o@A:b\`u:I_"aI"#(]T3#si5^#GDhYKi#'K221gIWG(ZJ,t,RGC:.'B$&Yh7E99,JY]h/KS8]Xiesg*t3/< cj[8raL=rdUk&Rd+^f/5-c'Z-/7C3GKd\hRP?Z/6H$fJ&576js6Men'!WX"e5QoprH*Em\%e7^Q63mp7NhH&P#b$H@U;#4,OH0fs!dD5F_Mf&k\j 6&$A0]-:dp!KRWHp&g$TH3/^-4Yu5IF'7VN\X,YG>oT^qK?,)EJdnL2[Zhbai.MTbDXfU=a O`(&j(fhQ6\tHZHWrRGDYM,]?RG;k>B>+/Naa8@X8*@rmJFZN#68-4C*J=-jK3R:"Q6Zh.N I3O_@Flt]2rV4*RhrOph("D[ug,d;p9R8jm?M>7.ssIhL2o1p0tM_MfDR^%g&m5@lO.A+7& fS&./PM\.=WiE.\bLH4AptKoodB7*+k4&AgHLP@kq4S/FSqN,c$Y9I)?IGV]M(gpNJa@Yt\ jE(('q#Cl>$OGQgi?tQrrRjJ&Nc5FAWB'ecPF0&jc_b+W:m.iJZmX*:!*(l(omtc'Af+$^n B?>EVUGR(\dJ>dmBg!c=FGuCmnodr(4ZTD3fQ\%((08TSF?dc9gDp%84)2H/X)l"YeV"?P9 0*kDoEMeNqWC-0NH_O_"Oof%b^F%CM3GA#;VtgLbkN]s 5%)eFjd?X(Uf?aglURkM7)TF`+Nn56oR-YP%d<=5E,RBXlA(!Fh10\k,HepA@)6#YG07Zmk 6p#GtJ@KlE%g_J*]M<84a9EBYdCVdTHD@d$_>)M_9AF]%2sLQ?I>6-2,"7&kBNPuYP$ak6JL@Tta^eQS6t/=213%:FY@gQ(H7];Kl@h;hoJTH/!>,:ELJ-%VD_IEhpQS(%EA;g00UuthWqlKQmHH:#pMY>D!G 6g]l[UA-]nl#d]%J"R'EMaA<)I?9ltH5iZ1JJ4bM$Cq`d5 K9>=R]1P@N90kr\_,M2d91X\[80mb*2"V\PY[N5&<&c:tV/fZedWPlb:kf6j^k;p/1a9e)# pS;gL5:tOH@rW4%`$j16C]OBP%Fjt;[0")&D3*MoCbNRpVRC4_^$siQs#1I-b-1.Lu5a9*U$`*d&-\/71.8@RqW2t1 C3fHE4r9Xnn5\7A@Qd0YGMIu!NV6l]+D14[4AGQqP^P1,H%/6BAE=Lg7k`IqDT$^A2;QpoM 0`T*9iE+4Ns;+"1:\[23'1YbGer0/%;KO?c#1SQD$BY#+p`'e@Y=QY@">6>FJKg6rg/ :j151k>JgcV3EE:1WImkY?gSB`oPO"h6dMQro*)CH!+@K\0Ob*4A3c[nd.scOdF<\9s(m;i p3i#M=Gl[.hJVpqsc?c\2-'BRRi>ohX*9cfG)Oo`'bUE!BuJ7^PW]/H`pnAqa&/`2*[VSHk 4kBnZgE`;L%]jU4KL$`RN[#;Bo>"V8u\gP1$;P;-amT\LGMPQc8>/d@i6 !3*1dKIg=n[`Z[65SKGu0+JIG("Ag[>I3Zao9ZElDdURS-Lfjf;A-DZKL%n7@3*/ULEDk;, dbJmILe@aGH;bN'dj07g2)3QC19@j0a2eXBGX2=[&;riT`aC9dH% B^o8/jtW=XGg+I6e#+')/AIi_X.Hp6\F0U8KCE&TL"5r7*.0gRk0dq>a3?>qFPeB<@"!_/A 7RiboG]g;?XSZ&NGIiT?7i)arB3O%&?nAUXdkj*aI)bI&=/'m_4pcb+2t5'W]C3X]ABe^>n Z_Eup"M5_V>+`e_f#)KG5eFHZ%VqRE7LB)CNEe%!mi.Q>f##+mIo_D\gqcad2LC e_Y7BG64[+eTggL0$N]`_.h-JO0M"!n12rQKS\1]IbbX1-i_!K`i8n<$9WXlJB!L^+Z0?Rf`G=FdCLNA7Y]KlC4J\53F0phAFf>hV%#jP?QU\46^9:aMs-OO.kM0RD]t)d8h4j^>9HE,JlC_i:m0#:ORr%U7Zl> h^<*2Y^G[n879Q@-/55js@*a\9Wie\_X,o>De>n:f2fb]\CG?\+!j[YSg[<^t\j)k2V/NaE \"c@cnI)LIai:3,Ja_-=!]rgm3+gVKSu)bM:ptgu`q%k\u3b49rrMLFCp5/g+g3+0/L`KO? mtG(\477oEZ*`'A!iTJ-RP;M$n'L(Ht.:g!pg$f4&,B]\7;nQLX>9S$L5kp>M,/a6t=PHCoLpM*N7KEr7r=@7Y4 8VB>chnH,JZ)hRl:#G>5YD*'X#-XNA!an3si^U4FO@]RT

N`BGS#YfMI6/:#MRGCSB>0] j9RA]J0"bfUb%[jq$Dd&Cr<&"Q2E$/eh_X'B)t-558fE(e3JCZsfM@iN?5C'G(@]bF2..Km30[V5Xbgk6j6t%f;9tUVUsG>f]'#[f?dse:>=i!guLZTLqYQt:,0tobKS 7'DC.t3kXf9$?SN*G">F@r[cc\Rki9XC,it2!mcu/a:B`Fg$,#(Q9\rM;hJLj!D\H-)\7d3 5JE2aNDe;W0.%A)pC?3Z8n"riuYZTue:^,3]7L9NZLjFj5bA\4sn0P(\7U\k$JaR0PH0-04pK]nRI(RGY\BiDW]Ogn Wt/Tn8edV:N6%K\>XP'BLSR25_ebdK!'<<2L&ka,gg^=B:gO6[jPg^0KG@]%@2M0DUPLFB`fIrL:Ar>!?VN=1BGdso]Drkp8&Yj@fu34l?F4 i-t@oi*!?JHhoAd1a&Rd&XjlA)]bUTj[]fld;

6;HR`n\m='[ST@ AHiu51,C1Qh)3Ym2PRJd#MgZRA+p/J_C8q:R tT*[/.n[B@"OgNP\I;"W5X0?3U[[LWWU^Unk[e9iT)Aehbn"MqL_!%+]P1epS#rKLH!9>_V *"L+lt34VCfO'3=45MVp%>LeLHX\(0ked=l[BoMe#YBST]3LR_;W(;]O,GZ^SG7Io"=9=Tso? &M&X@G_Z`\=deVs<(OdUm\@K`WALBqFGjcV7gFG#'C5KUdRUNB\YIY>X`@!\2/h8>Qa2!f.agh86l BnDVVX=>eP&7/JNo(Fk`J5>G][T>oAARs0 [c8+DHPN1g*9%fG32 p:#4XA!![KYfQH-)D;j,o(BomsJQ49&q>)2;?3;4,?@a36BdJpZem>cMhS=Vr5]$[QhVRc% L1"Tr-(%WtjO<-E1Gt\*XnCROp9S^7"],tgpgf$%TJ`.2?HrE*d*b[k^=mG=?hnYrLjN3jh M84\X`Tk]eZ<.iXl+'!)#-RS^cU9kYi)`s#5D[5fRC&!rJc&>LOaU)(!k9H9*U2a]cCQhp( cKe1V'J?N)V<(,4/eNB$%Z?5;J[7Q&hD$kUer.>\Uu*K=1C)hsG d"A/k@Ft@.c50fA_K8q]s!fDcCH3Yl`"$Q3c;`m+AX5A'n=k6+(Or]5f<<7>LKs3$2\7gPu 5@jG]e>skQDGf=#lr<3u"orLojf3t.f944o,R@Xfk0RYo5:Q9=@+D)s4' 7>S^I`#rlgXJH!/lH+h#LJG:d&k1DVJ5#'C15"rK.p8Y^chrCaGccL"jg7Y*[>,HET]$RK8 /d!K.k>m&qcjef!AKi?ok4(ZD>)/*H5 i*V8VKPC55_h:$_IWoQM\-ERj_omT9J9m!gdq3L,l7Nn3Lbj`5>irb8lc-R&dUWH9>D;!"L .37*%NoCJEbmYNf'Xdd^*%'+`p4[hig"aiQETYPT+1SRNYl:T@Y\V,cKHV$Ba2np0PNf=Aa !aTk[)d&CDFB0QfEskj.R:o87;U^d*l%a7G(BF,/FN06tnjFTnld(fIH -G8FCZ`]"h/,W*BM).;?p)K/q_BVVQ.NM1s#aLBb8'2Xr)\H!hdCL(J5+o$i>a?_m?X_+[=pjDB#mYtUaLG3abG-]#a=bc-W2@*iJfQ6L.U=@H'"?9Ng5WXU$?r4;F lcs9bf*nNgD!'SlSU`R$hJm0]''qgrCd=nNG[CW0!V(?Rf1(#(ApNRBs)GKi0RF)0RH1pmU 2:,Wm2"UM%j2Dq!Y@9?D+<(H7jZf7s08UDT>UhGa>=.[I>>!Fo#E;c:iD(r89,KmLR<7>\C 62jED9"(DRu8@E+B(Sddl!S^lD7@^@C]:6HWt864C:`"$+DqAfY2eD)%7&8F^DHAb;:$$IscU7u@#4s9 EM,(Sc+>\]u]5ZX9FiR_Zcs#c'^[);OKCL3[*u&lG'D=?&KndREcVeq!(bc08ec:)>?VkpC YJms,#4%!6ruuXL+nkS[dWHsY=)me,Eq3]V3?jd"3+)p"/On#GWPE0O=@2WRCA52aTXkSUh f"Qn%WqKnTO<0O\7("[1jC`^;u.I)Icu#^pB:OrF0@[cPQM-rDM=.!Gf--,5^E$HNq>#in5 [+1i*uuT@*]V^KkN&[VYU$p8[Rt\L(Hmtb!thj?XP63prLr'(dNg>_0%DCYQ/no9*X+"O*- -\n:qM37UPhYCgAU`k3iQ^O6umtJGO#G9P+:f`>'CjS+5YMa!t8!,=b]-<47M\kPr#(G(j>tTB1Rc)b$u]4Io2*)bE *>>T'4HW(\fa%>[@q;#$PM.2Rn3@^3G]E]"l!8*!P3,_er:P=fC!\NI<#/s]/m;]2CJD)7[ "=j'_.bsEkO:ablR,n>o$Ueth_H;ukk:SlQTeLH8JX];H&.ogoOAr*/sY1:HjqUi$j?5XT< dl"5Np3O:lpH,5&mtrkNj #o9Gc?*51-A"_RE%^U_fB_gA__`s47W"I?B=6N3pKMLskBjhuE-N?crtg?#<\;FMog#FCcK =`p>oon2XjcV/HQBiPGI-2pGWXb(-]cO3nI!j*6>I$VA[d&(T.=j+mIgC*5?>ck#iO8U9[! Y@^lU)V"2POB'a;F8CC5M4VsuHI)C1_iB0st`0+>a[gcZ*7&F;ap`)/'W'?"la9bg)/>[8, b&S,Gh`c6rN:m`T/r>i.t0t^qYAg&TGaDquO,KN:#L.RHfBXBu=K"Rd+8hup=.a&I#[4BF@ bdfCMdgWiCbS)8@17TOlKS0pZ^InYKe97:ZICLl+A0N;[;0!4c+@iIf+#Q5N5\ )%4rB"X;0CBtALKI'V.d#6'%`]?H=#4JnU99gmIbs9Qi7/=i0X]XJ`-;U&V]1GDA.faR"cS =Q\BS[cdr_-F?s^(7jLr:\smES^?N\Y;`9ILh.kpms-tbaa H&k?_4RDjfe??B:ZAH6/]\&K)qKcGgqriU]0,e's1EQXfsLo?DbQht?qTDq"IZT827tb[aR e3.)go`B>#,Z"Q6i\F=b4%K[Hon370<+_6Ze"[LX3"5m]$A#&/h5Z6f.a11pZ6O7Hj=?Q7" "4r2[I9R!)C,3^5YSa(0;[]G?\)DunL.dOD_anDL@Dk*YiP\rY_#AgkF:j(4q7;92?mXHa8 R^!qM+$!a'B37oM:"pD75aun`3_p<:eE?.."`>qlsPb!KoHDtW&+^7lQ%4gI#ir(5G5B'N` "(_7p,.!bel[ej9U>K@AGLX4,Is?%REWe)^48fLlg%37S't`2$M'5(IFK.2Q#4TUr.#411! [Hff:G@YeCi<"EFrK83I3&h.QoQ4A+:4/*2GhQ;.2D%nRccV8S@[/L_^$df>EKi4'VTXj#! j3AI&ra-fF3=ptDLErf4BF`U.*brMm`B#N1[DSb!71=GRQ"1k!Tno6abg,atAZ^k$tG#$Y@ /r#JGKTj[ncWEV!kG7mEaG>)%Binia8Db8fl0tTJ!%UCjo:\t&L-J9H6`=i4U/WsCN&9\rk ULZj"'A^A#R*;h"#LWX4Cpu39c5/r.AZU8:(@ L$1l5N])F&Aq`8#]K8VC\Rd\^sP+W_-!C$L"Njih]e8eRGZ2Wju3rddS!Z:6npaa][jsA.W 5r@LFp%2OS>6Ai,7R='Fuslc"-%_t\V?;:Nu_^qgO:hHa5f$";rOM6PP\`)sI:1^1*m-dKS )8\6QcCrE!Q2I=X2d?6%ITbJG5&3p`Q`%X^.pDq5u3*3.dC[Hh\[R^[KNhN4XD8hIC9iu@n nM"C,#j)s[,2u;.M_]09`tdV#.a=rrF/I4.\lV>MJtZX)JjeHI;jMH0fuJ=)iURE;k^8$!GL-=jc[=0dQTat,.rA:]5mZ7]:ufkV.UfZtIG>]%5 XF#%?4c'e/hNg4,(G7B]B-Y*(*[s$oSB2%]_o>Yq!2DetQ+KK-3"e3k>G1MPr7W!a[iA*eK[GfLW\>Zb1ZnG4iuhYkWTPW+NZ@?^8K.HMPQ.Iu=p_*_> :'q>5cF'`QaX(Ec_/Abb4DLKk-#=4Y#qUCPahDn%jgDHXm:ZoH_Vn.@Pl5`["$h7++1bW"Y rGP&GhR1slpph*SejqXFZ7uIQ7;,&XA99H[g\Z]iQat/9G@%%RLZ&"MVBg/AJW$Qd?\-a6% EjK'67Tg#[..>G`bSMu/-Uhu4kfX=q-AR5[M-4l,BR&^+$Jf\8@od-LP5M1)qDa.PO+H `UnQ[#c^7Xh>Wb[RP9In-\B9%F:c,TcJj]P^n+8l/:qpahY(ukTIM\.\e3Igl)+7GPG`VRa 'T__Ig!$sfA_4hg@Q5p"MNJQ@[O-Kb8+Ta>CU_sn'qg_0!HJVY+AP)8X<1D8&c)_@*Ps&8ut.YBLQ%$kXXl$Xm'P^r.;qnfBL=be[U)J[# 39i=cb,@o*g*L3DM#&Iu'7%ch<^c6-4A,RdErr=N01;-a&S@25W+%&$K5i:n.*Y7iX4<6e+ sn,!piob\5<(ib48JCGBD<>/5p(MFN@+bo/L>j%4s)KD_pZ)fWSLp^!<)$.5a_$^O2_$JDG *-&k9JncZBHNg\)"qfGk1"trES/-XbY^s(s5kaS7L6o0K+*%)uU@'%1^)'Yi+E>=F_:0F?C bank*?gOPE2=`IU@;ZU3H#iEE[r?o^(m>N#XO%Y@)WOnbp3oj%&<#NU])@4o,lC\-"^iDc( Pi67h3sY-6uD)TsG1q&4-Ek'7l%905*mB-5W?\&4L2?`1L)R@1-5+Be+WM9ABGdDlKs>,&nRX%s/B!?4/NX.I!.N+l>D]efQ5i0[gV"N'`,Ipe\ 4]4gWe4d7iOLIhbD7/eZo+ZoLMEjJ^I?(=@+fdgf6JiYUQb0G==<1g*98>R`uA))P,YZOn( k=rUnS*!,+A&Z%c-JOhVNda31s!Lt+&O:`-n3-:Q[FIbCC2!goZ'YnWEF&Or\X\1D"(VroQ d"r&/k;*/**^R^dk'opDd7l%S++a,,e=T=>THe&u66dZo_:0?DT/j2#:EsVBWLah2UH3N$3 i?'pJRA`3[8A`l;,b+kJ_1u/T1r<39e4j0@\_G_iKl:#`E'Cs?$4f.'^"dkcl6D*)PM< `eDFU)j'NMYZ-+8q5shlAY@'2p?rXBgJX!MUQStNT)e&F^&LC_k+^u`'*b!\>eb*D;FrTD/ &jn8n_0-[Rj%kp6A9@GP_-e'eXZDbJ:h-a7i(M[C\=]*@-'gW]l5js:N)E$7hg )9P^KWWZZ7uNEbSqeB_WPJRM(o@?["GM[IPW0%aXhV@$aGmG>,=P'%(ne-)%CVT]7g>/i,J(FJq+cI6B)-(BI&2Nm!2Y'cV %K9\6;fPq,c-&!&ZaBGEZ@6O"Ifc5N"38=#TV\)!/?gQ=;i'1$LDd%DGrn/[n]B.oYJ fI5U30 ^C;PrE9B=j7kBqB1'uSTL9BT]/5QclJ)\N#Cl)EZc-+ILFfST5lY_^jh@]h0M*^G4/"[&ZuZGHIp7n C`^n(]*0nM%O&I3^D[%(SuhE3t7dVI3Nt4N>i]piIZd;#G>9ITI4q/_u[&'0V-h'VOAO3Q@ ih6i%T_d*?hJFA:tM&?jo(Z[6Q)*@6)!W)P^, o=iC?7\=h-SC\QXU`3FS4SpU>Bt:dCgt !Hd(-eaS_,/0knZA;RLV[^>?s4IIA\K?pdB+H4gY871e\Na+)aT2hqusfH PtZ;B5loIU_5X[7mDCWO3]e.qWNHtE>R-`CZCFE^PJK@d'u_T]NqG-5]Nr$N*#%'%O2CmV! W3ViN"Zti&tsacqcT]lJ]HiK(.!HZMiJY5TFkF.1DD"A>GoU);*eF10H+GuHsTkmC`0g(Vc )3Y]Y1kG_7=UKLTfISgms'W2nN>F]0+b8JG(R8Z+%g;iKRU$R&Iar'f 1#J]+.3]Ku-%5#(8&$5\8joUU?8hON;(5VQm.'EO4-4E_P"&_Xn+fou0+.ukI_Se3$*0Ys% q+jJa=TpDr5)Zo]T[>!AR;9M)1%=q<+S_OidWj1N;>R`#Zk6J_Y]gpi]5Rh,X71c55G_$iOZ4^4s7dWRAOqqI:p?!W ,dM>OET@l1TbL7BeE2$9T2+S@g'%t?7A/&lP_q=FR7jGUW971gfWMGO(0aM)eSVa!m<9Llb2?c6W9LYL$QXo&D71BYpM8a_r.!\q(n=V[)3)[HneiF5: FVRPAb-e0eo*R>cY)kg*>X]-V:0/O)P'p4=fp:kp)>$!HZd]gS502$?`\2'9p:gQq_!DLfrbnF(22GNdJj#9_3K]bElZc))k9gqWY*>jLob s5*)%0o6sZpb9i;"S$,7T&f#,=^+'KdfSk[&Lo[Q4]ZL:K-oi6W$g*,Z\uWkFj5-):__i,8 ER7$#;pYAd`J%EENp[meD]>k_OQG$Xibj*':'L$Vupnfj*@p$`0NuVe`i_gVJ[?kH8p+[[oRA;!8@h$CCGa0QMVIuAE RD*I,B6i'TSEK_1JYiq2\&cTbL cp3lsJj7O5Md(N+Ns2?SgIfJAI[]6<1236Rr(hMs_@afNenoKJS>Oeeph_XsF7M?$o4gG`PB'! oan]0]L/kNM`N$@T-*[OX;En\=?<_5]@LUlopjHr5_]h\'Ooml7WsD&=n HHg&["&^f\mbei+*P=i&qJMB+uT?:QLW-4icd]*C^W?Cf2"R2E;?mUeHQ+;Dk``O^9?OJ@? 0.J7]/IlorJF7$EdW:J(@J-tO*fP`h9Z)fbX9a-c!0")M,";0EnMFL-9(5$LZOD_5P9cPE4 "e][\a0HF-/R$/"i9IZ'T7W>^BP2^+IWM(q30]![60uFET#*G`=gRFCMD]!KL3hep8W^==qC"mX@sKIS]e<5ZD)9! `/V+TF+1<*Q<`B_+s0toYKlJYr_Q#EgJ`jubZLtW%e^oFeO^K9.j\9l/B*&>I6%<(__!C*"kD(p=`CJKu g6jmO5maDbPBE+I#2Ks3H6_.2h_O(+3f%YEf1&j">A,3[=1j![)[LrgO8]lqP`f.1DpYEa. J>8FKl4%G6`O7NiIbZU0)u%*W?LEl@ K+c#CpbGg"W!6L(;&L1Nh"'gm[//%:R;3E3ANE)ma[)h;GKWD4EB!pem'E4eF17f+R*H7H3 /)M`;J*i-Ya&$P@h*-_o?*Y?u>._(%8p:1h^t=,KMZ[P,NI04nZ1=U]W#b1UIJX];\[AY)c @q,U\\S>V\)JSSSmk82@4f8F]fBGZAqS^#sa3:lLocq;)^(,eY(fip+AGLe#'A&N_T%Nj2H QW*1?=0"_N;ej>idM'4h;F4'&3FIAPF%O^Jn#(LYkneE2`VFrJCDe J+?DIZM>:ebg5921sE7pHK8GSoEF$bT2Bk;$XB"81g-%tcGI--ids(\=Cp,:!/paBgE=UsDdd\+p%3->IE*naD5$%q$,1% puoT2"[D4hc!TQB^SZ->JS2JF$F,KAZq.E14j'r)!^o'auKs%bHg/>I$UD?55g0ZLTR;Nn FYml(L&aT>G-(g)$X]I]==Q @X"or4ej+g!b;29[L#K-I(Zi%c"UP%c>.Q`YT<)Pqs;SRTX78-Z9a>c295HER6`JdR2PFA? >Sj3E`5Q"e4=>%054GCr#/@*JbHt#Jh@_dP0LOa^VHqQqFB1@8^7Z*-dr!nL$CqA7oL6,XB 4=3Pa-V!ms%p8PAHl5F*E^r5/XoM]1.1)*;DaJ8b1mo9b<,;f@CIY+68'97$]=\5VGK9W#% X]FhW+(L+6UJu=85(R*;(.e<1(uJu_Y\)hOC&1?d)/7-8Bd#`g&2-UDSW&r8IU^j6Z]_15" "*faZPh[8s5k<&.FqHLOaBa1(piBil#Y$aim4Ge=7>R8-PLGaAR3djH6*<\V(f1L*Tqp>Zl qgm]nZL`B:+g<2n$!W_0db5E#?[A5>hYY9V[]L)=12$s^t$?&GsKZ`?1'>ae,MA'970"d!F %A>78K]1]fL9?A',o3&p1@"ua2"5JDsN.B,#j.+69a#%n^>fBBQF:ZdMSUA=K*6K7_Cka&s 5m.[Q<&`"McQFt'#CO\<,gm:KH-GNa+o$&u7"rm%ee8$dL%4fVN7pgmg4^qTJY\8mk*[/6BBPprBo+GD6uJ%%qYHJ9"Jb8d%+VK3[k?h *''N4r;jA"cT+k\9KM?2^1V(.PD4BI/LT#8lFXYj YFt\ps;S:acRqRL(<__*t;WTR`dY"bc"P3O%4:kmCFZ369K2Z?70XH&HI-;WE!8]^R;7RkH3[`=>)fLbSZ47klE6Q28*t-5=fXfbl6@lsI5)u*qJLdkHW^J][X[U:hD!*" MTH!EK`'0olXa=UKTI,'-uYUFXL87l(kb;:3uW;V>#9nV6WcTT^Bc?(7h?uuX8F47NZ;q6h /]o?<&m=\kM<#U&f@!@@5bE7lZL6-$#eP;Q586M4F=e4MX%H9TWX]4DPhc*V*Pe".m)?VRULJ3()H&pC[;.4#O9MS[..LZ %5GV"cKoqAc>o@_4A-lV0-XH"nPRenco?mht+HR]Jgf9H3^Zr>Q&bN"pu!A=G>Z`gdQNo8N d5"`KD)#tR3HeR1!D/I6I9Xj>eb(L_1u'qI<"GfUr9AUA?&m-n_saTBnVKQAPNT+ln*f1%:so@L!X%U` Y)O2>2^/R?u=&@(/TBiI0#6*aoeVFpF:e$ug.S)70SK!06 hU\2ZCNLuZil@^!\KW%KI'aS^R>^#=sO(aHT#-_G:P3EG 0lKDadY';qj##Q\FI0[!"*[#ca\92@`$0f.=Qj?Om=;^.S%I*[G@.k.C[\@1OU7^C=8HtDo =lLlT:5/IWjpnA&-E3sm:#-6@N,Vf%E)Tl#@,^5ik,rFa$Pd+cO!3^n"unX&7]$U4UWQ=bf u-\jpbRV#>j"k&lcsTfe_gOK=lSLEB9'f@L;H@81#jjXj$km/Xu9d5JEQo_Ckg&JH4pN[H& #/'m*m`E'G:jE;SWp]kdD[MZ #DX7d\b6La'"Ai9SI^*g/Z>1>'k-utGG]\^KBPu2@KqN>ghRL)%,"dU(E"9SN*kYf+Fm!YZ llQ/q;QJZ!?*e^$kK\M=m`K@,$LFAm3hdj,1B[7E1%SmLi`i>)/Ye`#8h0.q?2SXH\Z4nl,MdN]d_C4%W6&sKc!d?J7 =6+lL(6J__j-Uh]6b%:?DD;AhNRo(@a>.FmeJ7Kn*h?01'b&6SbORC]scZpI9+7"IS[5"gCi3QnCEP`IqGWKZYk8cO=pa$hXH o"JsP%2a)::;ft55%D,'r";,YN8VSp#Jo;FtT,)RK"]g68Y"or.h]R(*nA4b366<6$6;iR5 AV>P7Fl<`6TQZ(,+U2UpKZ>A3T-]Y>;MB?8nqV&qJ6dlE/+V";G76=[pL8=pfUf7DlAm^p? SZh@$Ym<1A_=oSE-:V?>6BpGmsf`E!(7!>q8cBS#?YV_0Rnl2l?$e`DuE6!5=4ieL3S#'E' <9,7uDD3-_!%"hPF4b`dML_;#(&dGm@/^QrA`I:sP,RGu']N>\;!OHUbWM7au=!IL"_?TKmjZ^ist"-$m,j>S/dI2^eI hH%cN'JU]0?^Tr%f&R:]7qG4L.%dn6/G&nb8H[/W[-T$R=2HiXFL(Hn"hnFBq%7G n8GN+4_4;F,,]=qd8$)T@uCJ?O(\f#0:2)f;9O7Z5h4+q<+=J+.XDPA-IK4IIEj.;Hj@QLs 4?ZD@bHd.aEesk$,%F"4Bu"E,,U&X+($TKn^"ZhOld)DM#@(Int&43.54"l2Q"LL'VSd&%M @X\UUmjo/M(*E-DPcG)-3:Lm3HV+E1FN*X7O,S<(h0]KRPOM+(m9Gar@t)N7/GdFeYC73@Z 5As-C%6$;eabXKgqn;UbePo F8Hu1=fp8UQ2:0.]48'J/65tDT%.GZ0TM'ViIO>'0IX)jCTZIdH+mTPNZ>LWSb(S#7F0;As,fctSgK1c5b 1E9ok$`)-(t&B(gn9bbPY>Yc-S;05qS)24H\=d1('D&c%8b]t5LdF<^ga>*UH,05p0LEssh <08KKdVPU(8lC&7.*@\bA5EFVHKc6hd>YmY9N(f/0[,_Cbr!YN>gYH(;f(DOc;SiL(Rg')e 8^pFl/Zt*E,k=N:fJGA6I.]Dd-9Xh0!&U2>qf.=4Rh;@G'-+6r\l[.=@BL.J-I@TA]T fkt5aAm'RqR-'f>YhRXbbGIV;'FPJg$?BeiYVBLLmQON;\c>(S[Z)[+N^ 9t-0Rf9e#le<2j]T'n(G!DA6#*ZL[Rs(:2DHhSS\F-u#m'[KQ=c?XV-Lo$"*[fqDTdg6)Y$ >Mm>K=`GS:;R#n[tJ;b&U6kb'4nP00.>Lh#B[eoN`P1de)?[;:P8862Z-PkAf@!R0M?%6.3 H[-/;C[fmm'.EkJO4b.\sKicnc_OlQ7D2jr`\-+QPa)MQL]lM"W"F6rb[fANh6ismXF&sn_G97WRLU@6UYaIp3_ j34kf[N'>;#25#pk98g,X@1/pg9"X`)0$Tp)WR+L'KVSc(^sjMU>0L`E9A\aU!V9jMD'MdE "@<4>`#BLuT$)#VnjoG`Bu'A!Z-4>am!]CiS::a-c68UVqM?dIog`"$UBm*,faN)FR(%%jI fCMil$'hOF+gdGmgg*f*,*ad4S+goR'1;L2)0o=?@T:n:mSSlA=M<@[*@Xd.>K=A'NBkE'] q6:7D^MUA@T_di>*ceTCs+`80(J2)>u*TbM#RkeSdbF-g/BI&.^.fqQBIkq.B9mO-(VW?F" Y>fHLd3tVVR/A$ndTOk`?TEn;hjr5BGYPR-1ki_XI<)Sf%i?*"?qgNkF8C>]nn9Snpg8Y1* Xkl42+$6BTik#D'>gao7,^iSU/Y0P/Wo6ZLCEICe:*KW&tgpJ\DrBb*[9$Y)hLM,ANo]&&T)h[4) 2"j5jRIQ%#jd)SK7R"F=nOV7"iV+!W:ICTZ-e\4E;)1<(hnE"3/%3)fl3#11#I;MMtZ$O'o (*J(GM0QE-<4&bKWNNq%uaB9H.AF-+)N?de;%i8\1#2mN5o=fK!0qKtKr6^r(2Ubj!;/5J] XdMO5=p;N(D!-ebZo6Xn>?Tt`6_]DQDkZh7kLjEa,(^j\W+aqTDf2^`Tc?Eb9ZnTV2MDkIW >#F#?#-ch`F-.]Zm(6$X20&=fX;-/ArBubdqM5-?L1^=V1.06Qk[0BFe#[) W/RquqS;ZQ3QBKV/hfmQ;K!N#)NGU!tV>:iN9D_R0"i7LQXBLD]1kQfAVk!Q7+@NH))j`4) 'Gk?0NNA&Zub(h291Mt)poOCjiMe)_&]Bj2+F=WmlXB-<9sD/m-=mU UFTiW(Ph:aBAXp/oo&a6$fmV=S+o"3UOQ)T.ZtbN'h/]Cf`YIGjeQV9AS9(QKcIp>%$UI)e -4j_4QSUk]h#j>B#),`>(5f&$o`?`. 'Ek7P47b-;+!cC/Jqsd1>^4)HaT0IesbAM%:PnToS1'2g-Q`GN!Y#X*Wt&a+(K,SGV=fI9. 5DIC5XQ^0a*Se'mO)%@;WE*p>4IH!iD_gnSU%u;hZ<>rl1#2Ko[1t=0!OD>iT(']^_TdhHS `\Dg&K,Kq2moR/;&G*Wa(I#6YTXYZZt5[,=H6H+7Y"@#_Fe,#hBg.b;5h( ]5Y5D-GL(pTl^d$TP#tOSO6@o$@P@ooab?XF7KNi2/3Kk?/k5)X0[_8C_X:cZgHSX\8-f.3 ep!al.t709+d%>7kVs;)]-;6rrq;`rA,M8+QYV')D2-#h=96@aDLAkblf/m$NeshiN^6[L' N!p,%PBrmK@:bQ7Cc5T7(XMB0p>4EVE)UX%EZ)[6V\]Im>`q7[f>Z bL)iX]?3%.6]S&kSUk^=PLo_tc=qT$'">R/Ml3f57&,2=p9TNBE'-TCtYkOa4&J20QL;Z". 'piS7Oqu<2Vd/l)J]&DK:rk,KX!U(Nlkl=N=;2][p!V@IBlKaJF!K\)u@:0mZY3`==!g"`C !DirZ?Igaj"-27@Y2]W"bTB.A*\[Bncq[oJoNtAqn;pcVcNaXC>%,V`E/kt]iH-!sCo8G2& jZF2J?\S4-LrjC#`scb!DjS_`8!Y5%0m0QOALZtT^IkYC!*Xgc/A9AZLtH1ooQcn:qSI>fG 4L/$BWF)0[08\P2P;Ti@YnL$M8b?MAr7>q%2ie:Ql;#loCcR*J(a.&H<:R!t\<7&<9MUl,Z Xd3pIlS7ZZ(3cd*3ldh2nO9-gr=YR(sRlP!)"'6,dVJZKZ\ioq^6QE^dH_:0F?Eta[;'?"# g!H+mQX;dj3!RA@oYT"@pA6)-4m-lA=cH[3aC^Mj^(m$s!cpED^dLW>G'[`Bf_sACpj#Z8bbOj7P^#Sk3ao-sYXiQ+qPSoirP+!L4I@-ACmI #a<'+-=#TYe_ForbG;;p-F'Bd*X!JcQQ-52Sgp_+ds9WclC.UpaBSn!VRT(ocm<%,B34X0: ;R`.iqSY,a(eGdSD.krjYb2*!(4$iI29]!Z3(]#a$>Yd3fQ)F!fsuH3^6lO]`@'K.%@f'rs Y?_3,CKnoa!B?*[@7+g;e+o-fcU.&>SsiQS:;p)ekS(@o'R0lX`1)M.)s([rpkZH`V^L)7' Q)%hoHZJ-u8VM0h3.FRN7_L1fiq\o"*)`%.@de\`me/g6D-moRG8N:8mHO')g*70["ZQ<[d :)C.!l_)OBYb*Q0k`%"ANNNNtJVk9EckVQ#+4Ek*1JJuj;)Lo1$rG%hEYBU[@l=Cu&7LY;E 8'92*1]BS)khs1Z[X3`K-SU3)kkh%F#,fiP;uR.3KXSD&J.`PkR?^iQq<)JM2`kqG<8a04- FWQBr`_i_^^kj.W`brM09>J&g!b%)_juGU]_d5p)_]-4Hm]Pm)60&YT(D_/(26uZhg>P%4q (p5`JSU_/'Gkha(/r6'C0EJ\aMA,74u^09dt?oIVa,r"ELb)Fk'=W@f6S^_\-b0pGEu[%e:bgAfG5WQ8JIL re]SD#C_`YP)Zd_q6/aaqn/28@(mM@!o7^MtoG_5g)`=I!ec0"m"(4VoQEHH=KIfIo.N"ja c4oY@Frt/D,"X?Xc[fu[eG2tm1Lh1Z;WIY(N5_07Yn2d,gKH_]h:!M2/KX]kg,C3K>i=:]=0'7dt'%A@6J2[+.8c[l5+2P Gn3Fk^3pioGZT*!)+?QQ^A$5-TUB*C%>\,P9i4.c/*n4+`"oduGke6=JRTFGZ$FoE5aHd(\$(+ F_g9Bl*s(jOfN4%==rkHDEUbaC!JB-c,4nf!lM]q0og9CfpCB@0:>e)T-`+(-'`* YbW9a95\iq8%9@tfFa8@'jJJj'S1*ldLUqS-'M?PE/+--b7YlTmn<,C8qHUJJVXrK7>*[&K GP[C_2K#I#cY?DQC2NSfl&l03jW7n(]``SG]T5iIj]4c)A+WYG_;D%O-s+;HcpZCf5A)rl5 bGm(YP4F`)oks$GNB&+'4;VftWEFXq`*m(RVakC(LP7KmHk;N-X0KJX@:iolh9nSqg<[[\& R_o8WS=#!pXOidVG7ku\bW'qhsqf__?ZpklmY(LY%j62*QGl7$>*.tILR!7?=b-)4TfUR<8 5\/U"p2j63FOOu(8p"`pci=J;D*'ojT=^.a!?5i;8U0;?0g2El#9H0\2']FQXi3X;/>R7$: 'OY(2=EUS\K$Nq5H?kjF3NoF9UR@22jZ&A?_6Oo.rMgdE6XfC(7lJ*r?A"Z`Grj&3ZG_>#- "iXjX^uGe@:fgkfreGr<;LbQ)KW(e4+$etYF+@RZN#=(ct!bB,:`g.+a=OO&#!2B72Z(4q# m>]oe)^(-n*LS@7*$6-!\rFqP%F!U8d@;,u]o>DqRkpT2g?eK#"Z8rUH/5Wj`,J#W\(gaU[:bK1 rP2S3^l/70Tr,)'s#6-iTQf:dg(U`]+i6Q6'Oc,eNk?H-Q*Pu4.m[P\J[c3K=0jtQ`1&d*] 0)+b5cX5O[(8cH`g`dSfGd-5*MN"+o9pQu`YlC$VAj( >WZ,A@V]il15q!NmSmT;F(1EEG*DaWP;oHQGZoKeHgfr>2aqA-S)*s7GiSB_Y7na-o[Gd%a ]mn*#I$9+Af@a`^]oUhePM&Ce*<:O`#$7'$A!44@"6??Zc_O%@Y(FdgssUg^YE,24 F!D2@Cn\Icl@V8'OAh:6/WaAQHPcEgmmE<]]?tREP=R'=?Gc<5f_3_n_d=%)M+Cjes"d9&j ;'!'Hr&H]beJu+jii+YV\H[+i"r!FqS3`'qi%aIQu8e*#(Ld]20)T)/7!>q8:%Y@K@YgiLA @<=6;\ZJD=-]*FIt:g(5[mK)B9$]PhLmU`?)#fKFfrO1#g=5D]Mm!Zq@Pkc`uP'0Xo.?(\Wej&N1Gd@rRbKi'`*UW;9n0\4W 'EM)8SbJ%NA/8R8i'.Uqc"25\\*?0n.G37f4sTV>-h9_M^u<2Yq[=9l!TY7Mo91'?iG.\pW #K/:QCU,Z4[IRgGR]4"TtOIgSn7TD=4OoQk<3;4SS-Na4rlrU*h@Fp3G$j7Om'Q83*Tc4Jc 1ma)>RX+q4F"'I/j_Ef[\p#g3p$UnLNq_Z\JRC('(,t50rTQ_u'"W4VeOl?.-#k>TLT"AKe &iJD9#kZ8f\qB>E-f4n&CV&W7L6cJJV(iW-i%(tabq1_pT+KL4WofM"IH&;NY_OZ9^?0boY dj&+IiINJ<44.l(H1nIPnPtL/$flXr:0pt_tP?G9LEB0RbkEFTkrddA/;!=-HUE-`(8Zir\ \ns3n;5dIYoidVaWE63&CR'eMDSKJ]=R9'm%A([TZW_(gLO7F5i+&Y:M+a]!lZ^$KDQ":iE ;Zdfi,Eol-6E\R_W()&bZ6YGO3(n;R2iA*/Xagpo(h(HI<8h#0T=^K/sB#/e7g!XVk"c8Z. WsePD@?Kpp"Ei/X=fm_2;Vt/U1Mq*uC'[j`.i$So69QdHG]JrEbgpWRpN\H_$2kDnk,tGl1 lT&"gto2CoY7jspH2a'egoIkR_WmJ6VXru]S9qZ&kM'E%tt0J!G25qj/XA!f]![VQmQH.mW fLZ<.Y6SR"K%N:*WU:m`B'LNKdOW7(.`:6f*(.AgW7)jMlAj_^QIiq9; 'Sdl'Z8@Uf8MX83-:tLbT.!;ePc$!'Z6A4P)eee$/k]m*KNsGSl!bs)Kcjc+PT``L29f'1h `":dD!*cQPEbAq:@m!&5#4!$pHMJ2"U@9;AqPnRQNK)Y7F>(G+%K3cD'qkPPa*am;Y8Kk:/ a":2c!C1"\2A<[1uD6<:s6i<`KlW='*q[KkFOh[>f*.5fdBHIK4oM-6VXDJO^7H"7g6EUZ&W"2JEn/]N0oP?7 eU3eh0FJi#/;CA@jVp(L!k=N=AW?7X3N'@q9L5@Xq^<#ZSmt2$>;s Y0hrH;WE)\=3[.WsGq5EC!aL"Xc.eSF`%g::\n:B2%cD@q9#'eUfEo\FU]`*TAg$ofFOSm [qu49u**60ZkO!*?uUdd(!-`k]I<-oJL`K6%BdqZoOlq?B%=,'G4qV7&1NGO\E>Q6\h'"K2 `bS;S$!#L-XKB;.>q^\n<,LV)P:$jKf=^g,rOH6^>n55t;48;/.CINR]AN7[C4.>246="'e T!f8SBe4)(T]GWZ>LK-T[RNiWjOYuUY@=DK./$t>H*\5s1flZASu&n\[ToB>9UZ^>f$dEsu .WF&7"U*$P#dn;b//?C\8YdPanfT^@BBJ"\=(.QDK4"4`W[?n36(m,=)7nIOe'RC9\/.8^f &Oi(]"`n/'9tOIcD.TnG@l.>BWWbWS[C*IX!o7(-GA_9Z^UM@a>_\%>!FS!t*ffXs%GQMRD KW`u")qb+CGJVWkd_P(\qjY'-$O$^hn+f&f>c.!EK2]i@M U%%.:mVQ!E4p^1VCf\3c+4eu5\N6OTemO=d2F(`NKJl8kH+CtcukH\;6DB*2ODfLpiha'\ ![O^jrHf=nEN,!WG`!QF>%KJ8,MO*6IjH^Xs2(-q,[cZ# D&1_##?d2R.'T#3_Qo[MVUEiV[UI"C5HeZOfGa$D-JT[#n_&2EOI a](t3bJrTCh/7;Arm#CU+lq2gZ1OVu^*bdk=Z\T7!`'B9p'AR67>pi]]t*&SHelgqs&[hn' EB8poF3Jb\JcOq/VO_\r])+FV8$W`?5Ma9f?1VYTggrDN(_0RQHhO)\qj.0nUH-U^(46PE& D[`aj.h%#[<.`A!X?/!M]m$qjp :a&O27XMD,G.a$hW`j$r@b$0/%objq7=2p`Y\egANMUL/&M;?gE%SVGb5jN7,YQ_e3JAD53 u,eW;XZeUVG8sg*t"to^j*Wd;NA`k\Cqna&5]^n%J\bgic*,aA4(,>eW,::tXc6kD/r;,OX Z4`>bQSg3c,AnUKQ/_jU*L[.]5>YmNW]T`-Ude:/S &r4els.H.E_K:(jA,.)\-+iHUtl:'uJ^\%Q@d&B'625eo]#<6j\CTfeZYJ<7'W.7g#L`a5j =29-@"`mh\K==+Q$D(_O^/PQWi=3!dPrn,MtZN1W(XR%D.M7oJXU/2oC;._ii/tOE^uj$pKV4#Wn3(#[@Gh?%m MK3FEW:lg@.sm=@hrK*2*;>Q2QW8&Sq/`,nQmj.V-99nko]LVS.rge:,3:VST(L8\$1i-tp g@tU!J78sCY=a?]U["W`E^l2F3K3+c!0Z2CF_ouDRQt?ON4LC>5`Y;j<=El$K'1PA5_%^H= 85BF$@QYmQ6(DZ*P\S%8C]r*h]Sf\nY^;.93BXpt`_)_iBP#%[-HAMqa&FB)i&1a`>`WtV_ OPm+o@PfZ;8sh6L?Nc7gbd(D1Iq@"/1=q]i*XOKK?-H6aAdl7@4;EUD$=0M5eLD9gZa>%?N m)P"h7N_gd8qINt_'T!K_"!\2)#+848u4a[DE94I4)d;hhM_K8]L.BR0o.DP0OJMBHek5X` _9Q:,\kKbJ_)QS/aiCmtOAI"FN/F$ZsR%A>BPu a(3009ZBS-`f@,J\'-M7>d0o#IH#40c44W72)dfoeh"l1!BjW;hB+4:6uXPEMDXS/@g @>Gn^!h`eP=5)"5XSPs7G]`ZdW"'#L-%%(0%!&>dtA-RiZ^,3^RZbJ4sAC18bd,eB[T]uUj;2) MAL&/7*/BTJjbY6O3*8Jk>@kn;Y;?frmdCgIC2.aZrH\]sp<\8%:V/"ShCSGKa1He'&/T-r (,QfS]K&Br=J0d3dhGTUePUelt=D3Du1"0D\;e:5UV0LV"H'LGT"?T>448cI\939)_\d3J7 &7E4'lqZ(m:@3b1W)j/<-r]d0=Hu(mW*feioi*M\=O<-6QtHP=@TLI0Wh[ R`^gG[CT0?Gd[_4=pV6rD?Q(Rah+*Kr?W&J9hI)F?&Xo:o0FH;g(*B=kZ;I>#eadn21Ag>m 'k37mS5ph^2bX]n6$gJtZ9@3c&UB7u8(f(G!*ETd T,>6;Jb;KXB^lpM$8;h<2?f<'U/'uJ`P_qZ9NgbJWUN,QEYFpE8-=B3JN1fq(a=]h5NfVQi dOAuI'*a=oVgRsK]0On=(e"tRj=s]D=A_!8P8N1+cm@\qEMA?.GHJ]*d(6^S*>k L4D\%cuY+i9Ej'^h/p';ld+9ZVI"u>Uh*ba\2slH?I:VD"AI$nfPlT7F,-E6f`fkdYYp3P: Km_%gC>u2IYZ!S"opR;'tN5m+gYrCKsGFIl0j?d=+Z.Fi)R^'?, ^2`#N0b2cC3_-$f_K]?j9Fj>c!0IA>]LXYra8Ui>'XH*!jkU0Al13h&(ME\9?c4(S33K?(Yai#FKh8b>/B%d07=!#5/qT(dSW8kh9> ,@a&ptFf8K/m'lA_;-asX`Y^\fEJJdY?Y/ojAbBPP>m@fC@l?@-VE3bEeq]?3L@,d`rR%fp d%6_l/NVD58O!E(>6=d.jAlOs?3t.S8*"haZiG+NQr$'+G)(Tai8.1f,k(t&=jJ-%jVAJ?, I3#"@F2.?%?O>E)?cm7to[5SQJMh!(>g!+l29jN3 HHbHLD%lBEUCOhCs7^7HJ*pCPqUO"fucSegtG,DN5b&?FB-"o-%Gm@p\Qkh[T,;Mi8E:Ig% fD<7Wtf?8lMrU'I?=Y"j0'k'lLeJ%Me;aGrJu-9gWJ/`6tL?l0g'nacd?P"@Q&A8[7fQAXa hMeJuGQ#M$SBP]rrGMp8"jQ6pgSNNTl)!)d_Bi^IbaBsYJ04eIBkU;Dpk\N[7J8)hLKb.Ys [TmP?Ceqi6"blo/&5h8_U')T@K-k/A:8[/>W+%mo,H,jBTQ.8<-\qCDigufXi3S%^>\@jbNRO#CsL6r3.;+d"i9tXLQHCf**.c4>_89,jXuj9>?D %o!HCU0e29Wn%1-'#DdZ?WlaPA>R$"&nYR1W86OJtmctrG2ib304VMU3[VL&rEI6c%3-^32qJ4,.Die 0-TNLe-2tMeao8t?T0%k-K#_*n-)?d(V ^RW-VO4cWTe@So^@L."#C-7EVP'JmG?^n-]7U=>_G<]ER7SN0&rLQ6Nri6FggH*^#"Eu=b> @`#D/0g2^e0W.JU-O")q2k^L[%&RuXAOKD$t!IkQRJG_m5DG`1Yg89kG)D/Z%`qFMQYW+lK kU&'PCqNiq?`Vj0,FaD)MqTt4HF%@[WCPDOEpSY:j^Tr'eZhlM-#*<'l4CH(!Q%oTo(GK!G pb1kr9R&e7pbp_-BH-_ZXjeb:#.RNVT83\jDt00Pq1lpYVX.0PZ*-'UtI;L)NE=YH+8A[=C+4_@o&0T=JKh!0/LT2(sG -L:Yj8#0$s<4ZX!SPQ1`C/ig>nbTe0\.WS3F`+frY?5TV3rPA`B!PS,V/<(q`$k'op:DnlZs06S4L*R['q;o,3.0A*=;fBr>1IXb_>kP+oS^^pnWi#DsS=CN)A1_Bm W0O,V&_@U6(#JtG=.1=#>bUX.?&EG\Y`";i8%n)Ng9+f+hTpT=#9kjI'+32LgFWH5b_g\:Au#YrcjFLJH5pZ$HUH008qTN/C#Nf7N+FGE*> @O";bGL1[4tD)<:)J;e!1)":t1aN9i4n*/Q5TuW@`eM;/rF,drYc+`PY8 N354bj4Oo.OlQ6i7*H&c+`'4VAa'b;R&/KQD]D90idDoRIM&.6RI5Kq^SPqA<'0q,_kXj_: 5u)a)IAu3l5F/uG93Z"JZJ)TcF'e?RdRkmll-GRZ0[r3!>e17jaCG%RpOoWDB!KR\*dJ%3c :E54)TM>OceF8S7[mEBbpk6nN-1[58?>$HqtX#n_B0EampFL--Gg!^GX2USBj:And".GHL0 H;SmrZA4os3]]kn6]Q\*UM>`3s,NOej(\!,j2a!&<*@,3c k]#Jk./L2c>rk,?iLkH>3N6 n*gWY^-eVT%'H]0krDb(dg9"%:R&W)FCSA6eHetiWMQ';%=d<=H*pP.B=KX1+#,nSFWD-9o :Yg'/O(0Do_AD*ojbRNZj!47M'ofnVtja=$[_a,\W.aVD^oRh&<&AD2p?b3Cd&_29#?5M%+ QPO&=(#,Qk1a6I6r=aUIY!42I$l/k&=a&u\5KZ\hXU.S3a>M$?ep%\qO"%VYSajTM9A73.# AnObLTZk&Eu10)-S=Y&TSdgcG@<3B[?.)a3D4/-+jLtDG$Ad#l9:[2C_)2]r`n7.P0*+',9 mds]s$=SlS0MH9MU7h-Y%uVAZWjJb0^Kh??*:t_F>Sm*E3`KXb#]=R,`:[DS2P,% ft0BO"(8#C@K]dA;&V#U=^Dl=3,ZNXcYMp$6>D.YJ5>G6D/I8$[oV/CMW(3X/WITV E*Xj7%cB29!-LASTA\&?$V'!B*dO%.8P=oMdsD?N.JJnKIo9`f8fB->'kOu-0MsCVY4>Sh& 2!Xo97cOr/X/13[S$b'uK#\!ZQ-m/:9!4+MHl<6'l5A4&$=R0fp0Q R=ZIiq&=^4"rK8d0c6l#DZj/+.-&<$ncg/ VWh)]ZZ\f<%K%m HT#Kkh4+"jER%VpS<&ek0EZ2"cWDt,kM5caLIgPEa6\9ddJ$4H4Xh;Dn2B/#gNrL8OjY.D8 *O;*V6="J08!)+l%IJLoIb2JeJ(Ko&BLZ3V?F[qY>o>m$`b;X]GCT]5O2SLK%:"?=IP.SCY 4OoANZs53,]u,4cKPN35iaG(kbPG\fsSADT4b6(imK=p0eGPf>SaDYO/bFJ\-E$se.XY->g:+V7gZVu[A!(B*Q.Z -&`R%kMB7#EXg@`1j'65W+jodBkUHWUA)MUf_2pTF5`!kdY=`i[4j1Bk/`p GJK?;VW7G.&ts/kZ*K2XY2D0f%QU'\T_BD9Z;&OgOY_u$ukC\PRPtR3FB&bD[YOI+a5S$a* 6Uj)j@0j^reZ4#%_VUQFcOQo0Ufptda#O9%LNr) SR'?4G!%k+u!kY_/'7kj-G@a&SFYhdY)7l0s'e)l%mSar;$dMBZ\?A`]Ic9Y7YqZAf]"jU@ 87nD#"k1!t%0d9C=*/3Z@6hYX%h>6UNZ3q`2g<"Ur-KOXUs'P-hN8_Jk0+dWub5`tp&OC"G Xd35.*Z&6?3l)FENMQ!fk5oTK!iPAs@:BU>p*YF<*J'q\iiF6H`n[d'"L&%4kJUjW2Xul2n ]3bmeX=q-f^-@'g]#6j8XYk>:FI+`% j#>T+c'%#lnJn=hA*i#X&S'M=hmn(RaQ'bN/;WZahH+CN%4YmTZ]X6RPDcufmS2%sGnfEkC TOA-E#:k=/Z'VSX^Bl;VAR[50>!fl^ad:!*n=;?[UmpUAV^u4s>qX@8e'JY"MEI_7YneJ)N "g8iNJAN!dC^ra1(['`IN.gcGZHI5J)QSZ0iMmYIM[45m)j.f)iQrW3cPk3Q*3ma.n^,QK< ZVg[&ol_JX:u^Ai$bJ4pWn@ZTluIslOAs+%C,jRZ2l&1"EFr2%)IZ5J<(32'b8Y/"X/7.!. <21X;@Pi*6]TE`"j(r>R-B',I&%0d2O=l//M`6$M!'fKHL]o0-)fN)PQ:8%`9+Q74*%c.tJ K:n.HkHfG"l:(80V%0jb\oKd\-W&KtTk0K(:T3Z6uJ":aM'*_o9GEmYi3di7>3'd8qYE0Vu;jXtT<0!ai!as%]9:EB"'09>B8iIDAP 5,9OK$h2"OB*&aP#9Yc$0ln?iZQUG#1^jD&'S'apSePU7&g;ZVcfc8jQ4W$KFE6h/n+[dZ_#P+G.Pm%MT]Qs)>:1R`I? 5@-5r'9c+Xe#'.!)DlTj&;6Cf,1j(G.s;0mFTMO"-@5fS_F$d]itn)]:As)6odUP,T?q0fT j1PTaua_.P?@ods,Q8,E/+lj'i@?+;a`KGre'k3MI3#1qtH(dp6En'k)Iu:A,JIL^gV23&AHVo\j$$9FtWA )"Z00e(GV$S/-+<.Pp0)Q*FaF8k.cX;)JkK[N)`LbT7qL@9+shp+^&2G\4e,=uA?+^,ATh?Za!2&_iY4*2nGj!4q)o7[LE0hSRRMauZH%B-7!. e9qP=O2lBkM<"+`7Xq6<<'P)PK;qehq4off2oe?WOjI&5Eh%X#YmX&Z=>CTb\F%k?XA'9K( NLPfEl*bYZ-u*?gM'YX0.WVZ`=#?T,^U+WqQZRdmcR:GhfaV5I+rrb#9>EMfr]Jaa_(,@VH <@J;;eTp2W16#kL:F14;Rlms+7\.uHMA/.1Jj@K"uG<>'MUhpY_JZ9E8VACB&AbK>?(N"@R ;]r@V+Z=1M2h-'/:)U7HN^;SCo[Nn]/jTK_MEuh15f%/9V.mE9^nF+ueY.*hI3hQ5F;MU"e p>9`=j_^p^'g[)4p&c2+#SnSCE%Zip6HBdjEZ*i?*3MYUpb5j%H5cm)Ed'*ffK:.)iC6p*KXaa0pe]T$S/D >.FLYV':M:]@YS>5%A?JTF@>YV?Fa!P*LNn3+iLgt%_A=@f#+'mR(PR\7mM;Kc"ehb'W7'a M&G8sp2"OW*@9=96l&S_m&A_^IVuj4)`Z5dZ2Ac95_13Gt`IN4ONQWXZ6!>*m%XiD+ma;q6#sM+KB'HU@?M;75F$LsQ+:..!V@HWja!5#FP1LaAo/THcHr['UrlN16$<^)It tLQR(8%r'Lij(6&?JIM-,sd:T=YT51+N:K[2MFP\e0%JersTMtjoRfY"5NXp(MR(P'[p_9* `MZZCD!SZ1fjiP$=8)i_Dl@_h=EiEqUDRMSXk&qMkVJKtcB=-%RgO.$D$!E'`AiI;uo(?'u W7WKS[TH0`g*oT!n_53`L23R.@&]4$d!L#\c2D*Q-Js\-\g/(!7J/_pBPe(.bRUA-a`#Z\/ V)iIjqJiDXL)fdWL)Fp-eib]#"JcE_](i)^_71?@&"%[2R+e#sOSMp7B:6<&Wg^&X^eu%+4 EB,(oeh7=_.'6hd6,fa*jG;F*UjDDX@2p&mj*aXf%=ph[N) >#>-kW.l%b_AbRh9M)rK%N_*$NNC,*e8KJf;JGY5.CYRk^M&1R!)GY'W8o%_s.>?^0;:Zsc ??+ZD`75IGi@[CP%Lfk\#WJ?-%#6_n8-B'1s,CKFSr4Vu06K!RMh&Lt@h"$phTFTd@3QJ]:oG]lFGs;A$HEFh'V[7. kR)Fa-\bGiG'U(UomB@*BA%?jM+sXW3hC"Y:GjC'lNdH]0>ir31KUU)Y?._-8\q3q=.Kok_ 26+orZ"+S!3n'>KZ7&:n+9!Jca`!e]FV'nM5Y*500N^X$nNZ["PE4L_jpWX<'l=cu@71^#mM#[I&j^CQSY=A8jk_=8&q[[1]p%=tTG YMV(d/>cr=ZQ4\fG4ghd-cMrXf!>B<46PiOhrbG?%tP.E/V)E*YuR^+nX.I@3*^eUB[3]ig ba\GO4k]7H"$fru;-DrJVq(#`O+SU&@!A\6[G$5AF=.YXFb'B`tQ]tF0tNK;:Ga,XS-mD9m fi:G_DfBI9[&4'P.qA`>n*Xq!O(#]!"_*AVsZ0P`%&><2A?@gs^J*^aT'u?+REad<9H/SA) d(TVLr=A!=E>;D1Q'd%(tg?s.oMA7=DL6b?4:IjMT?e+N9qgKUdQb2MPqY^?MT?$EhrV\t,j8T- F0I-Z$5:'F92\[L8lqe)6,KV]OQR>@&KUXC3ns$1)9(JLY.n`dY[ kCC\"M$6[o,PVC)!&O0Iiks1gG_juK]>'fF/8+`:@lEq4\p.[q`dmK"TpiW7mWB[;!TD=a3 c_T(Iq>%Kc1[o9H!OL["b0r^eg5rXfQK-9=IOrdW)e`]?)!Qe8S+r;>5"MnCEqt5@O]l`.B6\P+bX/1AFWF5hX!]%_V\G6pO?P["o3^Vla?!m(hMXI6k&fMST<]aL*MOa Gc!!JSu9F!'uehf2igD;r]?31UX<%D]C,AjmZ_4t<):TRR/U-E0H:T)k./KMSS$R;F.VQ?n FBNdis@D,$fnQ,3"s5X.g]qdF`Gp9<)olsrLEhTnk)h<@Eqb:Fc#X l^1X:(>pG-HNUga5NEa;"LI\2D;k]`Mo+f\EYA]W81=T-9Yh,tc]F5HY>pOhCKIK,4.)C;o 3>a1qYZ#0=9GGB#$?@l!V'ELdu>Dt"fl?A_g9S1D/B#1?T,\U0O5!I+ >1Rl5(nms'/TD\$"6LTKSUm3$395:"B7.29b^$O;*H6DMABq4>ZM4<.0QG6IBnib%H!?^A7A/tc:@E2FZW>.,U*2=WnN)9fL*YZPV;H?C]GpaqL[$m0 coOJ.kiWq<"k-1;YYe,FW>NY',gLXo3[-uV6fIB3$ V38"Nre5Qis\POVJ-Dce17/QWddgTrY=,u?OUCW6c2BW66Vgi%Dm7b_oR$47#OuYZ`8pYak '!q]c*XMq6>n@aua55iM;^(P=73n3(?SPN&7u/;Y\4)Blu1)K4&d1>#.n-eN9[np7G:[JP\ s4ZlCjdUJ'=%0'ZG.F+`7pNlm$nV1YoiUS)F\dV'RFh-6)NG"u'6\QC?S@LW#"X)3`&LZDLh97G*$]2V*C_H2DJ,pfS'#J 3$N-JO45cM@:\8)oJ*h6pr0!("Si'h!:YK/r].REA\Y;CU&&#dQemd<\-\>Bm=?_j/*WUnQ o2()5BT7]6C^X?Mi]/DjBq.K\jDogAtZ]?2;7%mf+p$$m!I,CqcnBDi_0m4Chj@)hT+tef5 i8nq6*9/22<9g/g7\Jc^QVT,;/?odSi2RR$]%74mE$cHa >.3#F1M0n>DNA'*TX5d!g_q!!BN5M8oLe2;nKN,H^!Fk^mltI=4P:Z2,KVt_6XMR<36#7f] _XPXB`/gE,4O,&j%Dc(I5.U@esk-WFWQV-!$F"5s2E]Y;JLIU2b(sMe&gi3O2:38C9XfYU? jgID/k7%c55*$m$PrSL9pCc+5!%n@q%2Y0no+1NqE.%Y,t4$FYQl3@aHF]NNnK:eiMQ(_I3 f1EYO53_@51[Epc6+3/,Y[h4(dt&&J$)#,'9Sl:bdu;"HTG_6=YA*,Og9q7q4V*jp1"H#Rq -GXWa8(IA3\k'Y^t30QA3QMWX]I,Dq]-,t]OlA0HRSfl!KXPeC,JT>X$C2U+Jh;#K+7nD&l `8JV_>h;O\i%\+P\=IG'D6bj#q\u:[ic3_OVBiOQ]IdnpXMm)C(>Uo<4k5I[;thD>\) X;4mFYfA$1pGOKtPDE>g/bO9jHo)=*.UK#s<;u_D-lLF:)a"Zj"!pj\1nEJVUf4=oPNsZZd .L<6n4*.gF/-8'rMhT5PJcMtZ@!+ZUCBpea#;B\C&32sBo05dOKqMTNA&5ecDSZ_m+.uVfW $K#cF2:Na2_]+S&6hA@(b,;u2,I6ue#>C&b+NN"^'!?1l?#!9d]Ie[KHOD#9@uQmf>:)Z/` 9I-qqFGag;8d%!s=Q96]`^P5m:(b61a)&ln0o3Q*.b:_]1EF^rcoBSj&(t6X2K9CI^#R1no @Q_jibTX?/e]6Q[cK^sic[lomf3JXn%H6bskU\lo>8BnmO>"RH$$oL?cGYq%<1X%TlhX91k t"@Ta6L&bEZ\?Q,qI##dfUR6N9$GJn"%)ke+""6s!8/8r<=@!X'X@gM6BNTuH/Oq5Y-IuUaTYB;'6NVpqN;ZA"fNe;S=`67TI(U!1%QMVe6^9[UB](a"dFp;Bsk6N-G"KMSLf) e&:4Z(NCSYG7u@R=!)Pur+G6%["L()o>]7eJD_81EK5qf!1ic6:[ki[e/j#+WlA5WL7 l#bA&`M8q\9UJ170Mgg"i)q9'TgReO9ecm2ADBI>a3L7g`C]DKch4sQuIfD=<`iN#@M8#.q Qs.j=C@>`FN%Ar"74r&%;@Sau&BPo]o+/I>?lqboH-bP[HG>HHc/`aJ-j5S/oc5^J!OeO&0 (NbL6VK29S[4:RM;5(bl08UW5L,:Xlnaco/SeFZBOdL.q8:/G-6lH)VLXcKtg+\8-jZC.ra V9Pk,1GqatfPu)<,:u)UXm"@%)jN5XY;%!@.,68H`%h[0<#KV4H;u-[N-A'T*b%B^hO#&&l05SMO^5hI-=03-bKPu]K='WXJAV).lT.u#4P[@9 eQrcaum#S;GaPk'P@`rBM^PX;d#*5OB`!'29Pjk)-A\Jn4j)Dc\>ut$>Y6Np#KdBZ[d]&d_fU\GadA:/6li99c*``^jef/'&#[DuGG9b;P*,GpHU^L1 V1.2.r""6tL5Sd7WCf5jq-[6k6bq)oo/(Y+/LTOb3.&"JECr*5eP]Hi/)S?,`N\pm+A?e?N j7J+5GEYZ_*^CsIHG-5]P_<*Mf1Dc[CPgB_PKgWe ER;T:7tXQ>gLQ!,`;C54)+fU[=mW8O,3AiNeb-`VF\(#LI8m>U>hbRApeQVu9N^sa=U!2+/?D;Mc6 W_@!Le^fkj>H4^(Wm+ktWF:O+>(ZC0g-&nO-)2u@>Qn4O,Pd(`BRRJ2*8oAGNo*"Zpl/^e%?dDK'sLB(fAQ4IC&&7Gke6e0 lIfY.q,9q/@k#)"kj[G9H$L#V()j5J7W"o)8QW^4T,;&H\!c7J#74qcCb>D9" (hVIR.BY$s&EF02)?QL\$#\f%L\)D.]:AAITL*Mr1:,djnWXX1Xj`t6G1gc(">K+9_Z\2QH :4k5pKCs_!*WB:q_r)k)?lhL-coU)PO9>8W>a@5)D+EBpG[/fOA6SaTpeV/S9]3>fjH`CNI FI7h9OuFCAD!HJ\m)#V,@q>KjVY"pi*bX))`;tELD*gFW*TRD)5P&WKkMc=2HsV0>Cf=RL" J++dnn/K;,Sk7@fB4h/E6gd:tkUi>1=.<(fg[4++kA2J+ +&@87QqJtLeW\`>Ac@o,GpE*cc%Q/BQqK17p^GWc4$/d!4j">2muh>q9f6%`96i'#+@"c%g r6Xs'RL3RYB8oSCnLb$8YLKJESY"@QkM\=ZNL>ZG&NfRlQOBFFaB,6YB.'a)pVs+L,`&"MV i+)sc=I((D"h6=A`85(NS7T^2!D$At(`0C&E!GN-PRr1sY]W44$gBQIC/DqS^fuD^Aa5,%f &ga_Y%m77'S_-S"SS*EnneU#D$<[tSCUVGBRb_^WUpCBI\i@n5G#V[V/WSKgKgI`^OY1a=5b=.:.ts`li&+^_k?Om#KA-ma" LI;_Q.em2iO49m4oRc])`85EKskfNEs5?A"!"LbNIqYV57d*GOA8L#?&7;c1sT4kb.!g6SU R0%(+S@tbIo!HtGS@JF$nYJnegC:5V[ST"hTI0Z(f\eVUW?t0<$d\Grh15_c9:,D6;oM8:L KlCA]JF6da3FekkCU!tS^3o,#_!fRaDqlan?%qVgVZ_6JL,R!>.-P>VLMkuQ-O=XGBPqXhb ]&6UB\nd=?OLhf$pOnpeR%b557]"6D2,8kE60*<1t0B:7G[0;Km4t^`trUBPQhCu!om//:k #])3F6rV?B5TdlVhP;.W0-8hX%!)[d*EIl;Fj"#.REJ,>VZB&(49c"rKBA1c[#kCR[6bDbD Y1E+\Eb\DqZS@tGR#TMkqfq@@JVCY$4;2.V :E0e]>,u<-Ic1Cs(FC.Km9pOCM+**E6'UX+MG\m"d)spmi"l,,/oq)EG;h\@cD$I4?lSc+c< d"#VFDkLZo+KY^`4;deemIY;Dmk(,k5KF_Dta[LK3!QpU)jGV=p?WnEoE$t7Yg[ZGT]OrLM 1Vu2g]WtJ-G^b"kS"nmsfQXTKmI.oq+hL33Dk-kMJ4K?,Z,M4OhV\f!(S'!uP2F#Sm"SN,a D`Kt(*5g^IJ6*hO9cd#Wd(.oQVu>Cs%`AnG[RUW%BER!&Fs?P$iSW(Znhb>Selq(ht(=%fQ Q8oHq:o%C#5rjZTk1kbX"+cnL5i'68'-$*D+lgJh;#<7%35m*o5Dug2rkYd*6U%W`gF4bf_ (S#h4e-GJ@L/:Zi^BjSS[tLQXpfFhLYIf.m"hVCZpc!g%l9C#ZAV<6THcB%4AJ[S0C^(/-U l]0lQn3L.;Y\^LL%&7IS3LHf@1@CSl8W4)T:UH1=p=CO"W13iLR#-aWd0Y4I:(MnjM6P#_C 7TFc3M]R5D09n\gdcCq[[imJ3ns??ght$!t\-/H5Qg`;Y*83p?):!a/f2hX'cc$K\/cg0rO b2@X[=>pNP9hl,9.*tLN%( S8_OFNTr,=U5iAk;1`:nG+tV4fQukY:&W0!9d3uq61Dc$@A!-QAL-6`B8EA3%7$9mS?'q"; dkndK0UYXIPBi\\D*"1^frT8drVlei;/"I*74+9gIlQ3K=kuPo;k@!(gO7*(QMGnifo0G&P0_#)=h) +.20GY:6dVd$Y(oNDWddk\CkgA4E6dip4+5ukJ&U:8G^R4i2lG'hoDGW @1Bb@8::$#H@9B\oR_b0[*H8aYM)h4OH"1;dA!6c-q#1Ih\bW5#%DtV!U9>o?@"ncdUDF50 u+a"[^S#4U4C%e5[)LdF<"V7T*36-V0haaltc`<8BQ0e("=^:t/Jc8Q+'g4],2/IOB,E*Lp'a`6+f&k6%=@]);#,kJS#dgE,qI;h H*[Jo'%SPb4;]`T]d:8J"l.10q:Rr"oJl4C"dA-0bYgc82HH^q#".03nu\FO$uUL1)!&,GI #7n4F+=#gK)_0mFuGZ1_W8nOWs5JXGBB4L*i%skkk@9^i.OBSo>]&IWNHt>[JAgn_AU4Eh3 LV.E^($[4BJm*8`Epo3D#Mcd=&dXBKWb5>fr'?!gacp"b++f_/UC:iW!4L1T0&4l0o0G?sL :AJepPWd],_5EWr-Vr]UVS#8QXXdUX,^:?[A8sM_M;E'9V=;n& pYUJVq"OfZE3tMtGO^Jts53A]PJWh(MW&Lg)&"*BckZa>#SdBu=NVOk60,j!,m;Jcr?%fqC 5h[,r1AW6K8"kb/4_1V7_n++Xpu.*-rf,5A1<51YVun49[jV)2/0n*:Pn^A*5s=>CT)Li+s u1$+s]O3c,([CLlW0:;EdVX)CROhU)q8rS;#?s'ubu8I?M`W9C3W18jVI$;6P.,M?pdDU%@W2R7#3u3Tf0V$!uRL=E@uo4WYH0q9am_/mC >/HU>@;e64q)]@F&+74QtOQE6]YMdMbPFkp0XV_n^:_=QN0><@s5Q^6V\$-n[uiVPLTUS5Y l!:?gk'VptXrO.l2.a`qHgFWOmhRED`=JF4?k!iSRSW&)AC1)OKi1(3Vg('W?n#cjm>8h.e /CE04QUhH*L>*,lkW6l64TR2`.e1sK1F00TAV,rP?m`!hg$POGo9NUj9KqLo(Q6'bmRA")k 6'3$084QZ!,u=j;n.lc(bZBtP,UAX?*olI4Ze=S5/L@1!e9.Cumj7).f:MV@S((?hCG3"om`aPrhH1k%BO6>Bp"u'356p-A(ukHO('7STUtAQ\ig^ t=HHCd)2@Nfagf+B6ic'ZTko"%\VTG>UI.67g_p>hjMQg`$?fckmjoiMf>8rIdAhC94^1Rs BloK(920gPo gutTLMBXl\$nRO.ni?&UXreTpSCO(h#j<)bgXRks2Tce8=`BH75F# .W+q3;5gNbnO6>=j8@@%nJ&+j?*Y+]bc6ck-(KAoOlAS1f_ &S:k=+ZaAZTJ)I1&#u>Sg70/&BsT@edPN@h"!np(R]Jj$6#s*L*gIDR7C<4au9mmo0I8au_ VM,j%h-[L^?W[@'4,[-M'/ZHhRT)kSVJNQhsOoM<6&`PsoLB$5f5DX;#-,einZl((o3:-&jXYtFd*+Jf&EYE%D7`_N?(_9LJ 6#J/YV&:Mnp9^NF`7A/U'AN6Aoj+UGnp0K UoBSp?ohFWUeFr#r*],KOtG?4l2p=,l/g+B]-s>N't-Q1Ed=b^#C_4\)1+lPi3^q@[iTI+O TDU\&/W@.sM?^6oe3`$MRZ?d$!@[3WVF(4#q&ke5lHIH'a$"g3BnKb19h6Hiek%[HV]:X/- N&7Z.=&a=b<9:M]6;P(*$XOD%AD'/qsS(ahj^nVp@hX0mkDlWk7#2eBA)8T#:cPZ3A'`jC/:EeX;_;>6S-N]A[!miR4@[qWQI/B!bj ,)'+YV>&]GTH)#Wo1nY+`\<*IMP47p TH.c'0A&YWh*OL#;Z4O"G(%aaXViRT'$eH+#5&$Qu`c41U5U_Rk=&CD"#&JGaH=s(SR)*nK 7&L-j?3>$+o*?iWDN-Z=,EXU3"p)us2%qu_E/sQFE&l>>-nP8]7H5@^4kR:9'!I+t`NeOpN@2)^B!='Z!iUN(bhjFpDGl@aT 02Z;W%^<\XX7*bW_@/8X"5HDo7P-IN]jc);Loh^DC-2TGh:&Z"1pO::)/'0 s8u&t9grLH&,P)m.p8jFe$e7iZSbhSFs(/!VqF-m(bN*>>DD43ROod]T?BbIg@:FmU(bT7qK:16?uEmmT-?ljmg* c1B_1VGnL_+RW('u?OX'W4W(a%V`?VX>uP5ikA_elM7Pr"RAQ_7gjS=!P$R0PNK^_+Y'475 ,k#9p@kV+qfTtj=`LlubK)0gEglX5QOL+uqngf3aaS?c'JQ+bgkBrDE5,6C&!*!T-+AhM_ep*bc%F(&q%/Y SLY\$#YKIU='Ci3#o-:2H+ACLqX,)Z[tIZ]_fK8f*d_):XdWN? _R`Q5&;F'IPRL_4OCZE`Jh"+!KncJZ]e(^K]7!Bp-CL6(/LQ.;5$JC=]S("ZZZbqd#C)(pT -;.0Tj?\/7MT$kim_JRAe-\S[WY5!c7g!@F*5oU*!;kP1N")ogg=[C?EMlaOsaZS0i:%jMeTm@Y9QYG'0Bt'.;khbgfd=Xuc5_Ce.:JM\@4,sdpMW"AfHJri!O[8E&se*Q)I Y@ImsQD]BGQ,e/V$h+U?o(l2Q9`k+/HSM+jg.R@<5CUmm2Lb@52@p;T`'+2E[W-b3e/aYF!72;Y@9[DI7SJC&+(=RRiNsD&PBdt(L6T%[+d`sf!JQnfLY.)O&cj+ QBn%u>2=k=6#f;3B2gcI#M7B1*;Apq@r#[Li1o[PsQed)"[saXT(Vu7EohgPl=[S$OM9J,4 GPZga!@1e$0%V!Ff-%%jF;([I()(>3\FO<8*o8%rAlh?AGVas)#EVK2%T0olW2!G1.R-4fa T4^F+fZSANJqYn=s;WniDBV!e/if]P+uN@_^)MW,o]&siTrJbC[>VS`R=X!2lCXD36W3S5Qhdcmb,u /HDAJn<'B)gmGQO8KE#.B1OjdVTWdSo].<>4VA4oQ)iIm)>2imbI&iNW"q$VfMpQ1;QFAUR [97./Z)Io.-&.b)Ufo5c!PTD>3MUp/UK\4M.S^tPn$/?$Z-E5A'\0(M-S`!aZ0+ tZ<9^]WRBrA@=;Kk58RaU:Sf6QFW&meR)cAFOTns^@3`cQmVg"UrE#,+B'EM)8R\]-rN#*X R$>CL1qMqIUmpm?O7HuKBR`1lP`r?neK"BL)S"Ype@A"OZTODk[H4Cqk'=GpaY9@X!@:-6i .>Km,U00Z%-^YdF_APGU^"X"0ot+A#6)5I3^>&+k$d'O9S[LU.)dGSoB%\6K(m=6k>5$=21T\"K^?TNem17P;>@WpAO=_/Z#3p)ei:(K TRIS73AjO@_`"\XSr+#4)c/"1gUAXZUuJGU^Yk-5&UaOi40#HKlRL0TYn/9,lke=]pOOWZP Hs]t<7H)\L7UTT/+[*.40u*5fum7Oc/j_ib=VfFc>=NGNtObl$;B$-="n;B@+')F:YC*$NX 4<>L/6*MK=S@nQ?Dbi8LG_&/l`_/7*m"iQmSWb:r>iGR/h3Zc-'H&?sLQku=l2J:ti(86Zt ThH.?DlfILbI:K_>uSfWSd]g5e=$RX"7R0O\\!47cmZ_6eZi=`[(@5>^:0OQQjt$#ar0.t( kF3\SU&mOQQAF`)-H4$ST!4fVqQohOJ.jN*94Iel.VtB'&ehpr=@[h_Dk\TR)r`0_=A[6jj /<#c^ip&JT_mgj-]eB+2Pl7e7mZ57F<6V'L>\%h&G9G9G@M("e8?@r6hLtM7Ccne%ptR_+Y P+8`H:8%@B(rS:BR)[%M:k]A8XgN34b=c(LY0;$fq)F 2*cESq`#Z\1jW8p8*eJCAK]aBMgi#T[]3FJf:PjMAkh_jQX8WQ`cl47e)I]ue?/+[Ni7K4$ *J'p/G_HacZfq;t<3#d%pDO57#LVD^kQ,K8J=rEHC_N=?`OoR:VLB-YC)Hn:idNK/^BH7/SsFM%65RJD(Hur<)s>iGbLe!5)WAs[@5o+_kGj+JYo?]\fEiF`^^:&@Xo0/7IYf]n.oTq*tRC]&K?0 ^j;I:p_+5/h=;RXjC]XV:JO&.T=>V'2$&(_)OP"Y=+VBQ!ifR?M?83=W7cTW`oH!GuHa"G^ [+c0A-^;b";V>Tp=#$%8V@ttseoie< j>`.8&D_-lc">W*Z9M8 `ra9pVTGH=gVsEd945?S.\gk49J7eosEPd:]hT*A3CIWRP\TqV>2a=g-%+=_N$p.iGnRDYK XQF2d(nfPpOg*]Fan`T2(8>i&7@RF(,=HC[7/9;2#m5;/5Fl1B<"rnge hg$e`aI\..[cgUQ)IfEd4bPqK+&+RkdR>phL"@4Q+qL5&+\Y;_Y:m8'h].g";>o)G986(Bi q+qdCnI.\q7'S"5&]HI]<>7lAFB]SNOd'2j`//cBWC1IkZ5tj?S"H:5QbYoe51JKYVf/-3c<80B,o9A&l9r"+=8. 4L`'g5?Vh"s?4oG%6j:c'a/6W#[/(IQTW$:\m!Ma_6cer*7?;Ahmi>@(C0g6AH``;,Edf%)]oA6/CeQ"8QkFdm&IQBe% 6'IH+(Ip4f'[r,EYotPHN2\jAR>dlT:FBpE9Z@3Z\)!N&-n?qG(hNsMnHCUl>F*1j!p&9l> #2*.,?MHDFKOD;b%u"H%Afl`d/V0@#O/LCrGdf'Jp3OM6oDO`c=VaAfA/R9qPN98Als,p1D 6eWK)4"liSu8:+A=,`M*Jn5Cj,dR`!msV?L2j)O)!MX8Q_eE-:7nAH`Agh*Q\-W6d$t=)?J FV#Z1<=8KX#W49(Jk*ZY_JCeL6S,\WngA':h:tDL8bV]C*;NpG*/qaVdck1p7'Vn@U+Z_=9 WH'uY*6B])Yuo-!s/&VXA42STF+L,:!6DS=D=4VABU+,@ssD]!Yq=(q8`dDU5K*?Sn(>;ce o@G&83GA6fBGCSLp4n"0aG`'VWG+5&#Qf`S-GG")F5*r24HFF)pF))Z^\*\OQo<*E]Vaml[ I(*8VI[PpEqN@0Zhs4Gj7O,K"bJNs=8H>?j+(#s l$Z!Dk6"e3@k+"hmAQJIp:6G>BhH,rk','4P3AM30tN726(FKXcpQ_T>Y)7RB&S+MBgs%>2TCNKmJq 8%]+XZK>Cb\.(*&e@n0li*lo,qEKbrTpZ$kI?1Ys1^6d/Q'/.JRLsp"!ol\$E/G2n8[UKhj PQGD8ZFX['K(W,PsL&fA$']SU:5QK+kB3c=."6Iu?dD@YL'd&M`XDeZs]g`h0YT+$Q:!s=K95.rjUbo ZMdfRNJ7p+NAeE3<#\p7(cofoAbb^UQt%lA#Xe!a(JD%0V+:hk%N*CH?,e9[pXP9rmHGIf6 "^t8iZkd()G_UO>""T35FJJN6[TVL!B9Gdu6JQ..0ifePm@U"oJq$r`M\7F,VkDV8K\F%<' E`a/2obPt5\BJqs"I'NBCI>s"0k/k sp/(EcK^EA4ULD;VuBL@JS3aa%G)59@5d][a(9HHbmH*MZO(?SiL!"I8DU(ZtGKX7:YkM!# b1"`P!gpc]3/]<-4Q[U?`_K5aETF()(E?Ur?gL:G\G2tmb!JUT5gn>I(pikaV9%>cV_-a4_ l@891[1PS/E+%,7;?U;CeLQ(`C(1PMo0i_kg%R7=g!mtO:mMZ5TNjZ;&PCAQ(4LH*0!mZ$QhQ?T:8oTmD)Hrbli9sJ[ja2JuA%LY")'$` c$CMe8]cJ3Hnm)[?]U9Ia19S9ftk246OWmbM7acl:=kM3'S2[TQHCosR8b.1l(ARP]l6H-N I6Z@#Q?$!bOdL74cP;?g0q8$r:KXmTITWA1<4@^Nj)+&h*BAP)UppPY3'XmCcM2KN%=!-KC LQQU@8Jm37eeB$`Q#$(-1cEA%jLiEfO!3LA\R(um*8d;ZJ\F$r>P_V8G^SFtBrlV5Zfp3kQ /N]1ba/_LJm@c7R1Xs%K)QnFRk(UWT"2,;llp10V5gqE0aaUb0%!]haj1>M1B]D6(41[PDB @usH]i6e_DcRSD:@Bhjf?N\3%s_B$,$#!LD6.k!bL5Za;j^I)WR?%Pldf%GeXtE6ZdG[Y8T eLYim,QS5YB_6fn8*QLu;/eTu8U2?ue'o=i8uHTu63IBe6,Mn+(Qc["%=nY[@ZL>VlXDZ2\ `a7m=nhjUNO/7k;W)e4P)oREjg^9:)Y8srY+6kqK>CsVoTS#V24;Cb&b?Mtm_o_&7:MT(CW #prVdN=dU.\+V]!l"@Huro,=&Zar62!'h4tKSVZRo=_q,^HbH,PNXoY#W]A8_Rqu;2i'`.Y u.@=Ckh^e53"=4!2bWuW4c^RWJcb=o@gkSd"O_s"V_S4>L^K2(r:gk$B)s?ll3dZ*5U,F]] ncI$fo/+9-4K1_;g]HJb:*q+Mms:_IOsP3r:bTI%:kq#LUeK6gMV,lU'(e-,_<#U`taa\Z; \N_K,T9W%^-V+$X!f^Jm,+Cc=E]F9a4&\WBu!E,Rtq\-');5R[]]lp&9(,(iE\]@7!P1^6? /KKKVk]JKs`Ce):1.g6m2-1YW&ZnNtW&!df:6'N2(n?`DHFYjcb#@Mi_:f[d>;aftP_445El/%tcLfq84:B o6=K>:=$oK^J#J&i;65VaV'7"`9[KVD]V5_@\-F@aK+LTRWc!k\q#aDhBjDPg!5#0:n@Z/! 1`8a3&C.n7Hlb+u#Rb)2_eUC%QZLTknYjJA5o@&T/eKm4][I!3DLZcc4E "\;dJ./Z2;98ZPpLF@8!6O8`,;2)eG6j/(^%)0pd3Q)n(a@&G?1r>uc9S=q485,(nhm3+U:+YPQ4QhaBT"4[h+#5JQjJtbWm)lEs)%1 ir]]BEtIg6g0"g$l(6a;>Q=+UR_b=)'MAG-0,<<6c8"lLpC$F(N06RF4126^L^_#FO6nmMW*lqZ@gdaJ@mN?a5o,)1>QVM-?q0JaWG15,^-!G(rJ9fLC@3"_f]Km 4W'(but.9/!!+9;lB!_3G1s@"U^,Ka:4G4MTB7"&qfK"QLb$4U+l2`<-gn9P"LRI7r(r_Z_ `$"&O(E=D(=h0HQXD?]i;eJ2E@oj?8 QDRh`'dVWHRF-d"]:t>uE\Y:oZ4_%BKc+re3-6&1N!;o0iWi1e ;;&hFGEi?$.t52!k:IKBIs@C?%_WAL+#[A7:i'C0a-EDeYQL'.cf8"8i%+M#G?GLQs,6;=B 2bmfq"Sb0U[Y,D?]NV#K\+A"eXKPT\:'I4ih(7X_:m'eP@1Rg)?N:phg7PUt1O)[!ZLXW^R _85M#LF[8r+?)?92[G/"b+kn;a,r+nE4kq=iQl)J[h;,):j<01R@ KX5A2,]?f(itEXY$RBqhP$4\`8=2JY9`5hRH8MlNH\TDnCq@h95#N7(c&LDBnk8<.JSBs^g 2[S36%d[e/^m2'nb9fqiblMKT3q&AcJl[L:;TOfU`/gJ1Q@u>m&l%>e$l_4&"K3Y;c]Mh-J V]@l)d2#V"l`Kt(lOQ3uRSf&7!o"jh%=[FsJu']E(-iF8=rh-TIDU_)/7=OXm+R5,K-O/`4VYe&9#lI(qrig"#*QtQ1/-%/29!Vc^ajOTs.EM FbfI0LOa2pk[Xe'Xp#qQfH'm"Fo>[h3J1F.e91fKnq7)N9S>Af"[FftL'(PN5HU;C"irf_4 pI=<HD`94A)]s`i`7=cD0o@&Ro:%WAQo%65Ug0mnRbC3Kf(oFY[Gr"?A= ha"WBpA*\rH=A:qU&%rK'd"utXlE+=Dhhr[#QBuYd5:P5bSi$NX.%RK/-b(Pml=\Y1CEH/X R%E8eS'2?^5(p,M!0tMc4&[o/m4duG6_5aBUT-[ \7l)[Ms1m^L6-##>=o.3i*n!^B',E@lg*<,>Z.D=kene,TMYkh(M7!Ek"ufr?sA5#,R;L1, 8o5@E-R-$?\V*6l#?N,V*\->EGCeYlC^%7DKB&hJT]9p:oqu^lUu-AX8IGN?SVY0^KD71rt),2T' ?_<*HPD0*lV(:h=BZbisL,hc9A:.SgIlaD%foNc85,YUXAL/EuC:>CF$%Y&4GoCas/bC,Vj l!+c8`bo%'jj(<;up8PZc3e[9!!s1"<`J&qP:]n.LCA-f!J5q327YSW>CF_O*`K0@g<4M:V CVI5fhLD.A157K#L(:h5p@I`.lNNAa"_PJdcM-d^q!X_I2*+$isn.PG/\5`QYeF:qhKh,BS0OWd.#+5aE(r>HlLj =ae@0U+)E-bl'p>>/5(cLNWA$4k(p9!B;5@b!>gi,]9\2hSFH,XYmDrCjo2Y?G$Zj'oWXE! I!-tAfD,]?0unu!pnLffCn/Kss!$^g)T'.e)8_eF/iJ[IJ[me 9_"'lmM=f"2KQf#jR-<0CB%2IQQL5J@>'PqkOQ]":&R_CL?2*.SGk0"unVbY=3X1OYMZ;]^ 6oo7r(-).Kp)WnBTSV)StQL*ThfaoR'%!JiP8dYf5't:TFHX=kr=-+97I1;G(u'.G6b"L?J+Y7Om/AkH5ETK M%#!FGP?,rC&Xe%EjCF-C4rR9GM$AZE'jD4/VI5+k5S0QGCq:3:@9N!pdr>8:Jp$lLKLI1G aF:ZDX_r#g_S,\q)=HCLlh;OF1cjNHoK(C09\t(;L)ojr27^8[Su9Y7/=G7kb9Ir,1#1I'=Ei*QR@%M8B:oHM-=BNf8&YJT1DLN.HcXp'^'86UH5bcD-"8[[N*n5-1#e*V2"AY]A7BA]@HWHJ% f:C9LHGJmd.DlEDZC.[ALB@)6t,2N__6lb[iS5I,8KrT?h1l\ig7]7A\LJoic3EVd$37[F9 B6V5`nVFY['34:_)`^;+[^>TP6o^q3hde*;K[0:U2KFF"rkIoiJtl?2u0T''Usg[F_K.mb` 9JnV/k_f3g[&&Zd'3_5:,q&hASjB0,h&Q)e;(.HW0@2[&SXCW>?Oh=pW'B?=n`s8N/G";ag.=cVs3%5L5PsrBS_o*=Y;3'>a0dT(ABdI\3OsUiMmaiJ:+QZqV')e!/ ZO9iMho6Vl33/P/mjF\PS1<>Ad.<10R#b]oY5nc)fje]i5Bf9P`O?e?,'KjiW"/WF8n(/:$ `S`a^ej#D47MeLh1SZQU0"$-"$SlT.1DqkYQ,(1=5&E.G/[mdKBh3VF'FXX-GYYj!7mDF:F -h2Ln%aY[`!+6?Qs++Q;*Y!XkkK2V/=GQFhE>OsqgPK52Sh5i'jV_#84;dCrO$#E46':3q@ 6deGKn4J"@/)'SQG&'YnAJCHWSI7])28Nijn\%\bn5Y4"V=(J-B/UNqC[o,kuqtg%Lo5u+! !j4XDt<+R^g4.&ECT'1!*=2`N\]lFI5F]@pGm#e^\Qn<_qjT^11T@Y3f\fk@qK8mMk%@$gIY^QgO#:$FtCd$Q19Za^=rHJ'[mfMXY^>L 'V=;cn4d\'C[6qP;YT+8d7J(/Ho9jZkssZ4Gj^ne(S=TC!_SI69%[FRNa%GkbYAteu]=BW] Wen!OB-lbmg-UBFR\!`&OAlA7-$Lf;#Ve/ka\4L\GB(#c-m-,e2CQQOGU 4p-cNU/(LmSQN)>$YVNFD)K^5CTWnnr>f\IM,KQ3#Lc8nHtm2abCrZB&I_1u+Wra3U2\(?%/M9Nau&a.W,H-7!sLOlC1Fgr>TM8no4U8 hNps-&!"IDF/W\2WjQK%Dm'S6OD!Fd:6BrXaV26fP`j'\;(i]lsR9CaZ\Yk^\aIa=/?A$X/%7TJL(8E]qN@H?:-X4[ITCe/,;Hcddks[ %t<3DN"6Z+qrPqeT3b$,S=lobS2/Z2@rIlnkT9e$<&W))>mN^8:bWS2;3UVL]j=f4">I8QG ,ihV[T+?mfde5Fg,T[R)T=3@T@$SqF]9FApdKb12c3k(i/35%Ec#"1jL9Y6^P!=^8_TF,Y$nT:eQP^o%NmYq:U?'j)Zr']I$ 0sZBm7!pkK@kR4;KG4)#bW$oB%:&M;f/Y=\$oE"^0;a:6nKFq\5s1">[*2-mR>5C,FEJ/lF V-'"jepgPW1)mol@4P_HUNkTa#k?GOCGu0O`aa(jiPm.!2$kFo&i/gA-*KCGKLg"P\s1PVC "Oi2bJtrB2l+.`%ro^f?h2$DY[fO%&KMQb^hhOjHefYgK1)0+)*fh$0P1U4`.a%Tlst@W;G e%F%Ldf^T\;Re'pXpo_`7_$V`G0U0(W0cgP<31/Ka>ap q#_^LgmOAs%ShktHt*J?+]:&O=j'rd/nNhOQh(9"+2^W]#b1^9Drt_:6X4;]Cr;ac=R$n2% lJ!)e"+Ya\.hg(IV/_"43*H<_RMBgBJs&sm1B9-QTI9@I.XO:SL9K01I0_$T)i9]eCIbg*b2V!j+[q2u``U\Lm&9?K=hBPkGr[s%me'>knB7=;AGpI=E'>H`3fh;(^ 1iBAY.4*kTLmQ3p8d,"TcOr"2]]sk/*?-cO:]q+pl-ud$@JcA^=h)hW,W:q<3W-s`#l81t4 L>Y14J8s#).>;Fnd[Z(YmZ .Pdo@a05O6m/]BJlH*5NPi6\i4p9umt:&%aufnN:[;5):Q(pL/P.kPFIQpFoa]7"HUh=tgP efcZ)0`Uo(M@^can=,mG7Z[Gtm>7G7AFM^q9Ms>>'%NGZ#0am\bWrfBPuMGr+E9]0tq.II(MUVd,q%WFYmJe%%'\*N&(pj"-ugg8$;f[k0]`d`kmj[nc\q3$co2JS4=]S&ORVV piPZ\OB+L(`cLCD;X61$<4rsac*"Zfs0Pk=&5h&?m^8p\:0`)N'%hQR)(Eg6kC^:1f;ANYr _%@stWhL>=S.J".E?Xrn_8mF&+:Rd=(@`_aJK,DbFU)i=(\)mC!?`,n!YAdD$P82MY`B)EQ OPXoEc%cOE>YTG***)1):>[HiT;3C\fl%+$is*@JO:A2T,b,X*9@Z._($=r_AP&`)KF^W1$ 'HrkoQ[Q*m'ZYdIe0)MB8JTjjEGJ@Jh#%Oq:Lb';qML9_feT4;ac^&@$3i;BdoW=We",d7] rOnhhMHL(s_m#8'?d/MPXO-Pn@7&])7*aY=PcB,7dG,#V+':NlK:HPeMR-KH?]@71^d:)?1 P11\%d1^>m;.7/,.,ggfPZX6(@>h0O1-^&j? JP[/U`,$Rs'qi&L6$Nr>ZTBkK$^:FI;kb9H><:8L4&g2hoQ3e3j;>`*+,d(_"75*C6;gl\6>ZV@sZ0^JG^H<2:]J=<,gD6F0KG@>OU^B*/1='U5dm[*jF)IM ZD)XPlJ\5[Y@9ILGe_:@uFt'_MZd1^s"@273HPKI.;i=:c2C?dig'!FuT1'.EQA)[f;7fh#:o`K;(dR+ ]nIQOFllQ8p*Hc$>+cmTc(Jbb>:Eq55#?_]JnQ/_]9h!e]e0(+j9,-F4=OjZZ't%0:\2/\4 (MU3C[0'Z%776Wm-g#XiJW:4KclHPc$fT9-[5;oeY:DJ^Fog)6@FJO_q,?t`??Q6IF[?o'n fN[A?M4t>2AKYD(g(`5=nJ+k0EFgI)O#+I**+2.@C@)j6QpV&+\Wn\27kZ@igWOJ-*"..E@]$Y@I oi.9Z(JZ!BP(2"D&B53t-7DO>fmZO7[D7:*p`MsY=>R.SjJC?GqpEaHR-ZB1d:UL-u=#AJ6 3YDH_(?"7=2NMQ1QB+i&+Y^Y\G.VPo4r0ih(&%E-+kdugf6*CoFa%hKpN6>,JfA-FCj0B62 hcL#M0LQ:EAlW*EVpfCM^%]u+P.=BF7VV?RNTm"*EOb<,;L):Q4K9X=HjE,&!QC3;iDp:`EVeWb`R/)l43L& rrPC-LZLbUn]iLQBLJ@(LZ-bPWOa]6'XH3Q)^u5=(c]eK8[5\'j7InQkUS:J!aCYU&#*giGKR-AXL%B UA?U>3],$&=e.REX2*"&.@m5F_,f*+9lptc2YWt<;k@.W?m0n8+RbGeh/IqB)5.qCg3&2F% <-n?RA&Z;g4c,eL=KCsIZA]H.T^'SeZGtX@X)Uh7>N"9jrAK05:tot+e0Ie1T7^?H_ISs2o@pB5Gri8bmK ?,kk$'mVAhfiYM+i=3a]1+.lN_M>`jN.R&2`lYT(D^E?Xm#3m"G1jqY_*'cQ-[q2;VL=f`Q JX5PLd!ElLn;ms;T[ek$"Y2^$S%=&`J[j?fIP3%F2NNEBt*W%"cK1$NLNXhLk-Eo0BpjKCD WOJm^]OMB_@P/`XpUNB!Z49`N3_cO\+]%a5oqWS0r#Zjn/+L!d81&Rq3!M0,*6=Ut2@VHJVLl^9G_% tdg\M!:o6I`hI_Y_0g4-dcq!uPGI]S$m'6VG*H?;:4PGlpFi\ Bp'k*UH[o:?&RE<+4alMWTr'/>>p3NCfWZ7ZiQs25K3FcJ`Q2C`_*)X[te.-hs,jHAJTn1- %WF?auS>&Ut8)MOlbRGc >`$mW,bXb.aaG2Y4Z1]:38kAec(#DM_5\Cs.FY%,8`?,cg/Doq*#_,K'Kk]e@F?0UoHc1uV YYAY]lhgRAZ)^Q-&uLN4_*,lmF\O?'f(1pYBb3BqD18:ctD3;>?AnZW)*>:Z$f:iiTM@,kL .&EgYF8uI4l!LZeW7=h#5V(aYMeF6"1j3h'18ciMI8=Us+B%Y<=as]nr7FFr8$RP6k?<1mQ [@gWH!!a.cPq*V\N@NMY$W&+>.sSGY-h)AILJ=aDD14i#gXUV`S[,!gGliGmn+^Z<)Fm*Vn 8AS^$A5NTUbjo*>e^'iPFKqpb"joT+ieT/n8a;cZIY!"faJ[Q9L)2WLjRUSFk4/_4iR,6T% ]Y\[%5)\]T)sX?CcN-J\9*s9rUb[@''L"-UiT)']j5cF59u1NbO1Zk%WpT)(4P3>_9O)W/b"?!l9T^h5BZBQEfB51FIq glhhCiTM6/^1)1d_W?SP8`^`0akpnCY+@DEYe1`G/aS"='@5=K3nbeCq?bpn_KIf1m(hDUI )(-f;,5=`\F1Z@JQl^'kb+Y35@A&oXDpRY,Q0ZD67eaG/e+:5J#;?[2S_-mn"<#QV\L;Mos (kbX+'o>AROa,Af3>dfHj71e*N^Y7UalJVA1o=D+QV++ffo2=ga\K>$XiLA-Gs.cqkS+pM% Z*WL;<\d`L9`8gBU%!G,iPKRLC)-kHo23E2Igin/^O%H1s>G' .58dd_N^9O$eVfT,@VqZ(_)k/qVq"IuHN8+=B",4_REVOpQ2_1$6kAtqhcBgbndHYlNh4Cf gZ/"_!(l$*&rVK$459C=mE]73lpNq?-msiO@oDd-K0p\Onq=_:.I=c?pE..qaEaA9c6CI["A]qQih @)I\0R[1JLe_an1!&CZ*M<)Fe-HI@k/[3E9(#Z*&![OXs!9<`Pu+>?5m'aE3g7&`S#(/V)A BdFKV!@o;qgMe(K61WAKEG\o^$q+E8(OfGW3TPJRi4& -^j1>Am:U5m1lFH)MWMZAnLaCF(],g`JA8t,c5"DBPWaaFW&N)aD dJJ-AeX7l77,:>aIXRX'FAlYj`*Wl26!68*RU$PhGKJSo"5Ze$Emq7XAV_K=UJuSWfQRI2: r^dAlLOk4cW+49k\un,*t0_E*E3TLBmaM92\E-3:JZj#FLsN,l6b`ciCbIljSGVWiZTFF;+ ^dr_-F9@S*4<0`I'\Gg'cG($9(gNNP9F5;%gkBl)t%ls,hQfD]0j))M"g#YH==jgo+reGH. RUjSd[uRAgjllSd6*P8Br'(GVE8M[FD]D3VQsu+?5F:I0^PC_BIF]ROCQqk^q)k.e+`m.e8 -&\J'BOb+"p2S"%!74XcOgQ(H+UoZ5)62?FYHi'0f!LZhW,VOUYpR)a'/_@$l=S9Q4ZH.8I ?),Sf$HpCQnV?Wl9rVRp1.D gp0B6_]$2=$)U=)q)kTjRZ\.9Ea9F+lIYZle.4=S*C_\[le,=G(`*+OYCNU%$FL:)EM'D,+ >%I,Z;8H0fB*.j7b%RW1[N&1YsnK)1t)@QYT0-O#QK[N\X%M@DRU>24jK,AM83@uXiXJ:JI Q;L7g83oZ%`=deoEfBd)-RG"`QBKg'96kM0A^n=A:Y8Q8=QM4]Uqne'3+N9fRkH*cVgBjHG 7Aha1eVfA*!4DPc$9UR:.Vc0+cK;+i,0p]5Ui3gUfr[QRkUa>`0bVSFgdL`,@1_G)rm#d9o 0B=Vo8J);tbUK;2-kp)"AZ(3ZLEtm4%6uWK`7BBi+Ar5"F9#-:26O#lu_67!/m&'R#L6qAD ejYau]K=DNqJW@V_:/#AK;ViH>h3U(ZBVNfZ$;f\2V#%5F];nel!b'ni\#i-6fihKJ!OD*Y =$D3O]VRNg<0*9)O"`p!1:-$6"L(nL'20PWmq;#-]LufUCmUX9+qEEZLC8ph$[aaTu>\f%7 (aCRr%cQD+@b[Pt@W&/%ct&.;MFGJ1_\+.E>DFp1.g!55('0<-fmDWLaG#!`KPZa9(]l&a=kk` cnC@G.6?$B?;49I694,&N',+hu@!M'+N>08Y:_@\h22.nU`gG?s@s$qA0)aSGR-_a?0\emW ^,X3%(1j(\mbVl!nB$G:=c;d`."tbX\li)!co0DbE7`B7MZr\3,pbadFL5H1g4e6ctA32[XGKUE?*n3")OX43g!AN%Dr@9$B?R>3sms*TPM.[q/Q0t[3^$SFJm;$qlA .$DBS)M6"aEIKX^D@=:*D\m'VrLM#&qop"+CQid^9cl,kh:mjRD?_gf/&BNPb5Bk$h-@9e_ ]I1c*:o:KV+;e,,=?8KjC/>M>LIe09A1=K%" 10gBNp2XotGY&25Y`)bgVq7i9frf'0]%A?_e4J/g&,;`n_lf(.1!C.L/1H8i"9 AMj)%'F@.Y)C`DHdk<5@l`$:5NE24o'ih"HO!^.\gV$?F5=Y@"[NgY%R=:7pi;-\A3^LN#$ >i!47G=q8d<(Q#-7k>q!j.+'S\r^Q&&1h^b<;m["Jum4+%o0r$0%:,RC>X#2il3nH-P>.5f lP#A@1'@MFTRH\[8'_X&pBq)k,HAqi!&^oT=VfZaWqD1ud[6Yn[gLiEYZ@6l+rZ?n"*S'sa K#t*>Z]hfrk4:B%oO9X?Q"UZfOi,]-"AOE7*`,$()Gml_f2Sn(N0f+J:n4LPs9bTRN"L?EB Gpo-b*OA%NO[([SpfJ7o*a;h^)S#=*f)V_Md]2c5bIDj'^ 8.#^Blqba=Z:I(9"k[;eJjRF5<(0cB4%MsIn3Y:a\OaT_"jh%=[#Wj%6"1c=4Gi*6Jj=ihBdd:r!eaEj!=+AQm>"`S,Y72JhG*B7!<#2K/Sq QN)_`)5>7/Za1ePlqhl4#3!L:Sde^XXD?^?:QjO:YdN3oKkr%18U@f2Y]>]9`r^Q0TaN_:h *5488/;OB2L5ndnAZJ."=%JDhGB^K`GA1"BE1O5QtgR;e6kE4$Nn9Ba&>?;Ct6Uob[krCse e=&hC_Zh*]\O8MNU0KiK6n]D]M65/aQpeEWNY0Qi+]0G&VL7eJ-/4Xa;skll$.ccmrh]'Yd lG,@7)KX4l'X';DM@RjK=fsdkVGXr&3EESL$1hR *Ge[LMoHl?<%UmHq3=9s?\Zp5;(M=e`GemQFXb6`6R>i7Hi:i]2HO11-B-FY4OmHBD9;C;; N4[XrD^Hmc[u[NeAE=g#ud*`HW'NA=D`I*iU6qb0#/afL6ZT++XKjNkKJorX2nY&83Fr&:t **?Zq*FcF["C,Putr+9F+YJIN2\Um744BQ])tFP2qN=mB5saF"5@K%_+'LR<=A"eS sj:!aUV=Et;YLgC/4bh*)K=:M:5OB%!Z+5/#n+)KB=U50%^GD^pP0-QEQL,_i Y]WSb4]iJ&kKA?U+i%kK=[bKFbKTKMn't@D[_$N)&L5hP4"f5Hq5IW^:Ze`HbQrO?(;D9-1 >cl0mUmD9+Y$BXj\F$\/^!In`0"Q_Z:NZA8]rG@4X#[ClL#mnfKs%rh%%bTHWN^k.Lcns*V d7trL6uh3+\tP^A&o\+fjL&bm.3e@7L'K5#%0]#-rG]N0\Itae(?7R=@q@$m3O("Kd0EnQ- eCp3&`g,V#B\;3ga7XnR#Sq*N>K$6^a5"EhjoD>YEAFGFOD8%;_,!&.;^e6QA^?l[ Dp?rmC%q,f17"U*JX1HJglZX)O/h=]\2h;Li*[TdnG`JqDt3X5j5JRFSu>K%-0UO33#?3CH BgjG&emI/rX)%AZK\2G+ZJ5h82;;])*iU.d*%.C_!f]!k$LJW'.?6A/uTi12q5p]Fe2:Z/j !l0=o"kYM:?20JG=Uh+YYuSBo-445gjG'MgW/u1J;qELcrK1>/?Rp&K@N_0DL=ahO4apF>(A1.!*"M];roV[kU^ZVpg!t#Guuet)J4+E &Xcs=5NZ"(+=LiVW([H+]hl>Dk.Y6(j8!:>@t\`WOUtDsQ>!@a5I#Nm.Kl%J20-Cj?2TaR-/__-5u=n\="FD;ko':#g,`=<(Zk?U9(BHF3f0NA9i*U 6%*T"Wi5/m/DPP3X!+BXg]Kd!&A2R0>Kih7nEu8]rp JE1Y@=p7#"b(-&>C6Qu>m&t`_HZ+m*lE)+8K!XKnK2)658X#0ASPi%L@7k,_.HjT[.[jA$A OBR%/0pu,'::cp?tVkk(Eg)B9[;;*n/''843'2!t`Lp?="\K^i+BYN)q'U0g7AtODKUUFXh '("m@[^?rh>f@Io7;paD2GqA;D/C?.jQYQ.DlPOA_X9__tPB4cANO!aYGd:]V/pof_c#^?T H!Z*33?l*a)kAU/j-h"PapDHDoZ7Jo.`J9h,LG+)3k)!,?@HPml/E-rnb1W5FCBj!%q7CKd QpV%%/F_h."4s-@,1#EoKmoD!MjqPUN(@\!]W5'_?c(.kb75HjrTT(83t' qY0gO-BI%Q$\_D"n5cKkHYMVrbq>%^TM)/:FgWm!qHkmB39//G]A%Vmn9lh/LdY'\8I"-UG HR`F&rhRs+']j`>ENlXU'B\0=>/*X(LNoHIpU_E,R9Ld/@8Dm'jY&d73KV9mpZ8?qIr'VZ\/BX'3guM&?2eaE"?-e __[!DR4FX7d7)h[B\(Y*i'kA]WI6PHUD]XC(q-6agk1I0m& 7>gTATN$g_l@DVm,7o]#@Zbo*Ah=p[7cVnL"EHpQOiV'rGr2Bk/!NSkX-23LH=iR>-?E>.h K:`J:1poDo`ft7T@%=OC*anAiEX.Tn*5$bV,OBoC=RXLB!kjG=)6@`"bt!+Z<:p9VOBg\CP #b5pA9!PgN0l1/lu8rhXu'+?>mV9\@JHG)MOB@OhI\0+"aBbHK4Y:-l2DmF'fiCh8A0AfN?7`c#/ZEHHV82P%gJt)Z>?d0)P])r0dJ/,k Gqh,dn8G,p_+/p#QcD81!qf'W!Rh`&7@c]c@/0i?cZ*XRGVfKKn#iE0D("eV^Wnm`L=D $c*H340!Lj&jSeN+:!Re8q#PDFp#Pffi8t_'U=o5nlaqANXR'^1f^lfq*,Nk8D*\>RO[54, rG<+gc"uls]^TBi&is8QjVNT4[@,Stri^VE!g:)JXCdVQ\j_shEP7g SORUH>RQtVFm/!PT:tOr?EE!]Q':Zbme=HlA2F$NGEMHrLU$>lDnfWQp2A6=G[lb[f"(C$f fU`a)5S]Rrq)9MdC+Ve4pR#?/1neZNa[Mk`Y`H=coq*=(Z,?kcCef6T!4>DMp]kK1/+@I'#&E4s(@=s)IMT: 2?U0HQ4OZk-UnX)$uac%=H)D"=E[2-p^%j*#mB8H\;.KsKFHOjF>4_W@`j'6:mip9nRR%#) TJMe>j/45K'oK?[DXr5,V9>O1'"JcodINcdS%_'MXj6Vb!,G]SpG\n_bb`lGNe7o?sN)U&G jW,Qi#!hDZ.,_2'OKtGa3!6tTT[M:PN[@BA(iHHa*$mU#3a>=GFMS3$oc9d:BL=dk-)Ms*R *s4/%=uk`A_bOudlqG>(l&i\@)`_>dO<@s[2il?;&c9@;p?c139MLm*eVOR0d\;G"n9&1Z* JUDl/`jsV"&'6OB$o^[l.R^jXH8AEjW+>5"B^nPgY^]Miif7AFR[5'F'@:-TL:d4N3^&r8hE`eUpV8]juuW\F\_2[Q^=JS=:G: 29dm\DW0JC0_mk"W@Jr?geNTp3)Pi$VaS6eIm]9.:ZTfr!;B@IAWR`!,=Nn#K*$]Q--p^`] 6.GV1e'>GK>2_U(J68jpgmO+`KH+VaiiJ*'B+89*8L[(T;Ud1N8bfDplsZ(u6d0Z%MN((VR ^Enu86.oh4X]It,-]XI_V,q8BZoVA(ZCOC_6p3g7M(Ze<_-VXZ$T40c&K0_hH\I%i%5/#Y- mt$hq;4cCrW^BCNe^u>aq"!k%c+Wp#<.)X/0oUTgos[!&^:&;0+AOh3p3#GKj9n`l8"i$e< 8h=$#Ghmn.X8@\ahL;13S)R6DQW<)5Fl]YQ!5n$JCL>@YjQZH>"">.E\Tq(s23Io&7>o7,6a#DV:MU9#dJ1cY^R3B!pFEX@H]l[SdWQjh:6!i k9^@e/]ZL6+4O.I0gqbL5^;<7A=SpJfJ(ho!_VZf)s`aWUUh@R3(Ba7R?mF(Q[Ed2[=c*GR ."'d]pG`Y"am-[T+fDkX/ouoO["Wk'7IZ@'r5I>D[Z+GIE2\]=H+J)lNd#b(Ln:AB2'+sFC '*)K!E,FQo/Y2G(7KNW8EM,Fe5u&SQC(#[L4)RV=_3kW.RcaN=A%Nok(>V`u:g0(+5RDVGu -W<18i0bV=6h^":CbV@TB'1dn_'(]s%Wk&$BOG%PC#@Z4=E)s=?OP]r0CmpE$Pn30@&NSDG #"pThFSp&B8(#q\^l>92*f6bVeX[U=](7+9, n=C>I1!mBJ\r1`N4se-YOo#cqqh=R329,4>nfB$&C27]UXuRClGV9SfEh66]X6f,P@]3?1h 3YIYT/G;tOBi65XiOC&r[G-/Q)4#H2FS,OhW,>h[la90DFj.9K8jcOu7^j$q)1nm B1jLu_!Gb00pii)j6rX[(q&t`=GNb]I5n1\p$C!HS=RuKaj<.aGtifZ0FYEPa'-)'rpLS%n g!M&802BKEB9t.Ff\%MIL#7K0k=>Y?nGofjhcr6DH[9l>7Qr($*M6Zd,ODpS@Sm8Y2DMk19l?k9p%rU[5jS rRguX_tl=nj$"77q&>8@8-I9U)O-G'r?3u0G(L?hB&BGqsZ@r-t;J\gd7^i*[/*2iK=^*)Y gO3q!_+ATjAQD:rMZt[=KCKD#tGjV#l`rbHIugiIDk5G6:W_qp9s$"?[R\`Yi`8#nW:,7Fq Iah$ME^$3iKM_7L"mWk5@I$6kKI+a3H1rsR.9!"NTT01,;GnBJ-9$H-V2_ (Mg2_XKa6n!*GZd!E'FIKJ/LWF%C$!=;$R7L[Lp>fV3#$%i=Hctg;Tan)Bi)SOQ@+5QNog, )e""%nEgmNL<)$e'!Xe<;+=!JdUZ1GoT<&e"UM^*ZOS]]((&(7+g)_L0,7r>'qo"@&AnnGG mk#A(BJ=ZM=qhGOq:Di`j&uB6)klT;%Q(a%I:D>9#;VMllGUT'@;D^5tK0e`Z?;c*'o5qJH 6YYb7Kf[ZnPVdc2AZ60GkrQW/;p.0rH(MS6UX9(u`+EENpUJ4!14o)1fYudH_p<$R!=)aip Fd1)C['(ha>\b9IrKng9/bqRYV@(?12g+a=DMI3[-d,R/)o?s4CUGRUO>.:I1hngHg*p)ek S)<%G3@7VJ+p9q8/WX^$.&[NjIYT4#o9B##16&$8n"W\5:*:f:)UAto-A.+Ha4Fn%ZJCp%4 [iTR0.g^2:iK>/]M]_N)+4A#V-qq6nZRjPN&rgA^dN'p&)_K&`*!]A6($kk'+Yk+tnA<\&Vh*tOiT!9]l@\%h)*pPT,U-+ee/8:]&[V^7;u]L*:) 5Nf2.`a-_&?>t8f9oW*'r@"'W4M:g0q(B6I%/S[-'errYV??(_ke%<;*q[X;R^l&%#hC<)@ e"i;Q^O;$:?G+g;kn0i2M*3l&d*e%&AA-56JW"d?YJ_42AD!>uUb5k$%$BaTp[01`I2kt0!.2IXZm[8%S_U_2+ga<+-e;>%h'LN7Qh\QcJe30Gg0&i!X-WYOK%#aHcD<,VrQIDM9hTds+8r2352>.%\&FNeFkQoL@+/HXI(F`UWM.q4+u(/n.*,K LMVJeJn`tMer[IO@MWM+Bt$HDQUX^.9GRVQ(86W,iGSnj$HPb.Z7Msc$O;L7AF-e2%,mYLlar#?S=gVObCSt&R4;@ N]FB4^!fDGdq>SeNY/]g@BQgcOnO<7360&_g/!>@9A(nr^0'3E5%,A1.G`slIM)Z`$GG2%\ :Q%Z'j'#A;jW&,%f`"iB4&&I%cX)Mq*?Rn&ff'd%Tp%,(]/^W]mpu<:B=K3TTV A2'`e&3.YcqVZgjChb-iI?P5+B-6,"A$W%)h&*g>.h=Tt7]s-g#W(D2TI@I,!0MjqPq*J(b V=F$)JbF)MWi+;qPG`6FK]q*j57D\q$JH;'>9qJ(oS+R;`&dTSq`#HO*T(3^66"UE`D4o39 +b3`>+LG8P^`9%rT6_]S2\$o)P5G&%'67h/_5nTLQOkKV+5t*`$/ Y*eeSEL$q@4=Op[A=d[VZ[`=iT,AI".n1X:0\%"^2G'(I `Gt;0>@&ga.:EHAS\YqA@&[(cks",=7[\?k-U7(O43#>!\62f<)pm*'jN,)4dh%"j$B0sluY.Fe?6SKNhdSSYKYo8(K2LfC%#5n5gYr6b@@:T[JV6\*VJ=$ds$;;DT`YVi "Zj;:g+n;a[aHbsM>'O3XiG5RlfsTRT8o4\&pA[Po3TMClt[MOf;VsXcupG\'bI;2X4 Ei6dAGEZZocrhX1Z");nYKO8>$oQXq[G.]7J`XJYp.HdG'(98moicgqgUng5T;mJFAKB4i- !/:EVYHg+Cr?JL2!QFq<79>$Z?tlVnQJeI+QgR)$/W$lfrQ4O4WWOQTJoGX/=ms D>D]8(Hd_mXh#`V;jB:MXVn+sfh"g4NTkFbg9lrZj'q!%#YhC$>^_QiAk6/QA<9<+Q5Mpnd hr.et21sgnMHZQtfDU?SSe((C9Z(8nTtVQ11Wm1%f_6G6lQ.SB,Y)H4JHoMZll/6pTpOk)5 g=J%-2tf+72<^Hc0`TI47t3Lh;)dm8MkaP*o>H96u`L+Qe%aW(P)UKmJGgk$UEZ5(EgKW^( ]aU9!J^B7=P!rMDc6DVA9(^o,b>@JV4tnI(#XnoG[s2Po]8kb4-XN)5.k]ha36+Z_/C5p'S ?#+JIoC4j9G@Tq-uXiO[Bc=nfi[aP(:BJKu%_":tT<&O)'I?Ocg6&(fWgnUI>(USP\T+S"? =3,E]#&pNq2[JSE)2ZsGI)NCMrjf^sVY+d#=VP$'W5;(7c&jcXeNQ (4=Q,plP^SCV[=SP?#GRI'?i6(h';oNDtJM+=#1Q\Zmg['kEa($\dkSQ3e;h!PtOQ.GJL]j7h.S*fYBJ\Y[^pfnRR$&?K/EL;].0->jP0b' -Z1BmXSIS4aMh"H4`U![QGRU%hD;5oI:*tL6@[@p _M9+^tH(.7O?#-NelFNNm[pQDnm<8AthY2N9iUM0jSm=/"k2Ki'9]!O&Zeb0HI/X(PQeUd! rI06gO7W)F^T[hG!C3jt%g#$.1_Tj2#J&LY684WO$::u':j3q7R>P>\&7cRg5uA=\&]?CL: D6/O/66!kU5;'5"Yk[A(rgR&CE,g+e8HAJ1$!g+829Id+@p&5:)&u4^nAb?XDFEJasNOb;F 9r]Y:N=%e@.&'ZLkGOT;UX-@_#DnRkqTm171?=-#gB!/+]"c3\6Jrk;t0T=KYgE15qnl8b< _s6-qG7%ms2N/JgfPMt([nN<\po?(]?j^J%Q_eMg6%[,LA!Su(DK>YPqieMPf64]PH]F`gn jgnL@T^&rO(:=B&\M8c&RCr@795D?Bj.sAY@e_B+RX`O a6f(0>W3D;P"[7VY\FhPS_%X_QGqU'?2'Qs%Lg;_<#3Qae:i=lQf\6s?ns0#aUg)MIO*(08q$NREB2DR.Y@ -2ca7ONJ; _oS$D:YcT_"S(mTgun"n4'3i*(DfV<+)lnihhn%>GG6)+-=%22=0?I5'a94$a!"_Y_!%%dk K%k_>YHd'jD0WT?OXPnRS29Sr$)j373Cc'n*EOBL*$!( /]+;,P7W=?0G-o-_:Z.4+d+3A#tSEXJCkO@,#q7G=Y!'0R3//N@u5H[p]RP1&HWAC"rMt)- 1nm<&JV4W(P`]:1o6T1Nb(nMBJp(aX`]9Y=%t]S2+VEW++rWa%FKk]@nbd>'8CF#.D\!h8? a!VW-/\;eMX7Hn"(34Gu!n61rR=nP#LLj:UT1=7TbEgA,:Jt3=^d?g)ZfLl:K@6'glBUWWh s*&Q'o,OjZipR<'R3(ZFpK7u[YI'S_`7@B_d^XQF%KhHYs=`@tm$_PQnEQO/4Z(MM&PR?VT Zdt`i;VL\Rd'TSkd2s3((aN,=\&sQ-`R8Wq8!YP+bp68\4VUQln1#@f.oYb6]oCE7GTo]#@d`( oO;DrY+Tm.E+`@`VqL.X,T@eYfX[TZ3f_8H.[%NOBVA@um%`1I h_mZBjXOgT%)gD<'Oh6Sq\@HF%Fj2936D-KPjPkWFo+G.JF>kuVriK91f1]*fdu3'i9=m\S CD2h(5!;*laGNI8DR9d'k+AeAlSn#%DcI#e*1I;cOf-"CV2%?#[/m')?YK"s+ogHgC0-3l) R@O,:gDm]\D>#$c\:5)pbCad!`YZT2V\N[OhDePIik.7j n43#50Z0WN1O-5H*bZTRi0H.<(sa>UEHEeL[=-.&jq7aC?nVT$&AcqbAdqTfNq0V[^?SgM$ 3?/6C06f>+tu?A+O,Kl24r+GUp0f6"8SL=9g"U:\aE[k^A0n<8L9m](\qJC#W>VRTk,6_ZOC&3#81M H98\I\*:lu6OCug@T4Mi0OsL:62U2+h..'08>fMl Y'KOa*lg;6YZeg,Vq?KCU4UnrD7d&Q\*)_`h4?/+8i3E0'H#Gk1]hl?8C]Q@dQoDc$?/q)5C/)%rq)#\Gne*%^:BkG]&p.2X0HH+/Nk8Q;#7?aqMD!GV .d'eU"]+lNE/i%\]B/qY(H1>TuJm::%DG0\I@tbHQ-g);ApdUD6tHoXSBu.`%C$Y^G2aF(+ >sa'WEI*X/9tiRg(-O!PCM(c6:$=lXmBN7lrQS+jZFhMcA5'&<)NGV;'Rm!.8*6Y4k2%[5@ )2l60f2=_)/PLOf*najK8fm>oa29)#Om@NLK_28+U3iB@1pM=Brhf[\eho\_B<"dcQC@.GNSh/pfP0^WTAVPW>U=b8pAtCpA_M$o DXJI92ALNrDW_]"9+0&mY:L[L?&0H6j1;(/#rqa.i[N_/-qSuEX)kU5[+T#lQtHO!4P_/pKRk\pc?D[lb@L)%!CE;+_N:B@LeL-_-:6cG_Xb/H5]OU#0u3G?B Hlkb.+bb_ZXX$+uj=iI1?U Tt.je2bDt>nt^"h5nte7bs +38K60Z)"A-OrEKc2LKqL$;PY=SH5K!t+70IGIJY]l=:kh50`DfmY`-]PQ1PG7-KYsMgRTN (=J]K*gSterJKOi(b3>#1c2$AOW6aOBuKug'D8?alRkZi_e,.jnfX;#cu!h>!!B7r[/8Mi( *fR=(8CBj!%"<^bI`,NaBEClBcKnK(ebac^V6&%(,"?:Xe9U!U2E!Q!63>?g/FJQt$V+99\ a6\;L]R`ZpWQM$:R&bTVoSU_#Xd5H,L:jQ2]AYq!MosPT`^j#3=;mA##K5m0R\`?IFK90e?qr*F>2'A.P_@ueA5WcP<[R Y;:;jM#&%M!n9m*sL'BnVKOlf:Jn'RdH%uQ!eZq6&2)L%&255=pL$Jce,rsG6@)"Bb"dKeP NA$"LA-8cQ#A@htrEIj7Ml0[""^ksH2+H0I7TSUl<-Vn,c"YcEERQID<8CHsb[28/EYQHs0 (i+D4a=$#Dhd1NPd,._HkhE*ACof$d;;/#AUpAWEt#9\P^kV>a?tZ7kgh%gfQCUCi)`=SI` (AUL,_4pF_Er:JQUi_tE%?B+AQ-T_c#(U81D0T3Ij9EtGK_:WB]ZZ 'I?WWM7=mGI13+%;L-j\"U"GM_:6(1Z!S6B@,-kLi_.!124K<7[D9Eg5SD6-iaWJ")MTg_) a86uK[3JTkBL371`D0@.C='5ur=X@t?EtF'CD?]f_LYAEU9t]61We]8`9$NdWqM#6"G)!E< NqEEL,WAs;T3MK&#,l2J5og5\6\4*h=\>5Wh_XXc4J5[XojD'*e6:Ad>3INog#@_,@KUJo>=J $[.BnN!Bn^]ch=^eU!NY&XV;K8oi&"92NTsi6),KYsi&Hp#%L$7*jHapeKC)YsfTQQF#N(O ON$)J^83GgR#N6flh\EI$fOG#:FG*Im!nI#%Af0E-.tqhsgB3pPSbh'*Hf6P#%ZjkKTNGS2 s5!)dUBseO_!,:q-/rG=^hL^EVC8U3$3e^%M$!(`p'KY`/[[9O#1usbi0LH(9AoKp.+LO)< \%ZVd0K?'iD(-H\Anbao\kNBj/Xs=7-J,/^C6LPN4@*:c8EqHkln;+%?;Xn7NuABoT"0#@T Gd*L.K"6HAA/6impbb#^\jL8I1TP=lq/D`\&NrT\::eN>'QHhDh60AV7E'jQ9O"`\uCm?%t mA!f"2.A0Mt*+af`%Zo:rQ6Tp8ARns6L!XT=VFTc$C$)1_LDq=H%W%3 $iId\Dk,Yc5mVQMNEMuUPgk^ERYgWeqCBVp^j"][$@!CBYC?M7DL\9O"@2]kPkH*)M=f.X:B'?Ns%_kub=rAZob7S`SmsKjF?!p4;XQq&;L1"JCaTj]Um2Za6l+VA59oS A7-0^Z9@/rFUGe2^CSnJ%o_cbLM1g bL9]hJKNptmikl^Oeu`d#qM+c^"^WmCo5/9g_&b25".kkGXgIDmDU[6$D-4hmc55g?^2;jQ KiMKud[qkHfZ5hC-JEA(DMRS-jI3S\L6,F%QJueJl*8eBm2jW8p'0?Lk@F;QDY4-D-)(s7C P<8QhhZB0?taGS[)rAg9Q3780gUM14)OE"n$69d"3PKriGVt;W\@q;n6t`d!UaR]MC;P\Lf N$/rpXP)YdPqIrj%ioEeb,ShBm1G=@7%g%EQ8)',#!jX*eiG\/8O2m7.C]]Q[*^61GhH"DC qTf)+jl)9`h&!u!(7A\Nr/'Lf=&#"W\;0*6)O+^#_`.^KfYk9TUrlsutdDSIQg^j?Z##DUoLUF,*k0nm+OOE+.$60V0[o`4#O6LDgNh63V]`c>&q)Pl^J= :pA+Png=M1rl6`CicF!DoJ5Ih]\;q3#j19D=QZfA^f#3n8]*0elUZBg=Y9PJ+#:\t"MK.WjQF6MmH8"$gr=?1\;hbdd9&5'_I[p:K2B6<[>Qf! Q[SkD'I'5_pr-+plB-'-u+K]8FZFcWV;QRn8\b)A,6U<4 Op3Q`"U8&1A=k8q_5%'&6AqD8.pj)4P-aN\!j#&dJ;+:ql?STHe1p\8!SER^',ojQq4orQqI 7*bWVHn]b/ln^R]e=a$!g*`@oeja5!M4*+I76CE*Zb`>E@c^&!6<[+T9u^9nfnCkh^eHOn7 ,i,Ju]@K"[P2UH)k\4usLb!03]I2DAL3mWHj.rlF[fY5L_+[T@j%LV8YPK s(D6/_F%k,F+-'fK.qg=T!!kH((CM%6=E^#A2YG=LdY]L32BS,(Q:gn;7P\1')-`6R7oE3& UJ&Q8gNtqA?K2fQqM$Hq39HE2jqs'e#C:RI6F6!-r]s_#)PjF;JVsOMT]P:>&>%e4grmY[Ti0$)l:F=F1^7H(VA5ko57d:btlsWm^%\e@W> M_AiC`kaCKhk&`S]moD6BJi;%)\085 %>61g!jiO%l?uo`=YdD'uc;O>o1KmN+EmHOfWC=`t?O<(n@K9G,E=f<._#=OrTH)8J3S<,E 0W6L,lJs1j:CkP,\q?*9SJr-;0M,]d6>bm)(L#;_6$Hb\@`M?k$b*hJC?Y_74J#X\A*4:@3 /n4jR'no/rNj0nD=2PV!>3d1f:h_m=!LU26%br:ro[e=A0`dhJPK=I91@UJJGN"/SlE<@pR :e]Ce)"_^WJE5dfGfb!P7A(an"R:k2rNLace (7hRB^I7UQ&B&_)I;dmW%E3>BQS$I'h%rf9FkqkQr+ML/4O#_>GHB2=?C/6fCmp%=gOIhQi V7d=An`-1@2IJcL#G"''o(]\8Yfs\BArQ2i!?UaIih;R_+W6[#";5HGn*BYYTlKCI:G9T?' j[kMCO%HLUjF&'cAoPP385sGFrDVWG:*d=tN[JeTsuMV.giPMF&'\+Y$i]&9H?=Am3KfXm; Z*i>4Tlo*&qggV&JG200a"r[*ojN_V%uu!hGc4a&C'8?EsTr3`&W TLm2e--*mT*!/b4Aqe;2Og8@SAe@EMB70M\"4HaXJMek(M-@-_PPl&^Dh[:nWi2`bnM]]c +GbkCiAs;pGL\1&+;]/>/V5IXXm%A2sl'Yb$cOoHfa253M SETi:Z=\eN_b;g\e'`X6'Ga`U$Y3+nPa%ZXE;pr^VGj;2WYN)=mq7B&[/'&qUkb^#+#WJ*! )63p[eTaNjbd-2J`HCe'd?Ss17V\t)@E`?2^;-1fi`EB6A D!qm3kW,S9%'3H_H&s2q2 *%mX_"[R6[WASZO:I6`OWHYmbV1#^5k_EENSsFi=nS@0S>Nc\&ch>3Ti\5XsMH)[n=+jVni jUYdbO$Y/ON/)0\a()nC0QnecJCTLK>C]D&Js?JE8l`5&ehejdeh>Ni#=!3HWpCarbD[p424brP/3$6%/AdFfUj'f9N-q;S0s"EY!A!jc7n^8m_,"kClRsnMfM8HP!ek^NffE26WQLq= Uuum,31<)k^F7jgr6>0X6Tu^/h*k+3Lj*_pr7r[c4=s1jW=YD+DDOJN`Db$%c\2FL-s-0f"(Q4 E3)fhNNeM+deO0S)K22(P>q(uVfX1=L]E#p%&pjB[hKpOB&rJ/A;.";u*BLn&crO19`B ?_[pWc4P(!Cqt?*Wj]&MXEd=\VAo$r6(J#?+`=UaS"Wln"+UWIF$[_Kol2lU2J[#1WDt,MZM7K#b"$ui)IgIsF'fs44GSpNK*6%LhJq3G2js8DDpEX XCH\@NFm>QZWK\"73!I&]*[AI/NCA<:8(4N48K(-YCbIK/-aI sYrI@piO?@H[GNa8,aBn,=&R"]D1.rZTWisp%s%ZV_T61k0H72Ots+2QYP!O?q@ZXZWF;;:A$[!a]IPQ4*oVJc+`eSW.icqi*::!9@:^+W^E)k'*\l`Um91RU)&:Qh(*o &o6))_$SE^^X(%MM9cE-=>GT@s[)A//NNWM#Q4!&Db+bS,^_;ZE-IMj:"+`]FXE],eKC+QD =)D3Sa@2]p^m2GNA_GM$l10>\3_AE<\(NNFp;:?ktB(>t5)F7Q\10Z-3I4+T9N!CmPEX*[` oF0^N+!K^`037bL?RW4R+>/OATm#[9aEU$kU@rZEP2HlSik:U7pus+l>Bma#66%(h&pG ;t2eFo0D^H'JeQ*"+*"&q`(p[&ttI-iJTqHLH0pI)rZW7PW;&dX$`ZS'k*UHX%Pe/9gnVN7 3rHDoA)5T3$-5VZt%H'6-^>^>=S5BJ[&f^%1!u*hAXlO80msJTrJaT<9\trX5SdNTa++f%8 $2^AAN!t+NtB/Uc3i=(;SiA+bUIB5na\,3AccZD875BdVO"g9D$\-F?Vo4<#MB$7't!0FQl Q-lpWV#7l9lS!K\-`i.gODQD(5p_&Z#[>u9o,`.8REd8qO_1I2_LQU1&&eF)+6OrV;q)8Q\ Y1nde^4Q&Lo6#=5-1q-,beP2hD(nnN;FXl).npb)?<:sfsQ"J=khbGW&gJ;$\[I'PPQ-O)J@U%:JlA@3Q.%Z0 tiH*7:J6*DZs9YRh`s:KVb/@g=/6@IP>Sf)Y2,/AV!beNRN[m/g<&]QGPA_3,^&*FtGYA@? %,5t2YU_Gt"W(4b4Hp#BE0C)DN4!/AlXhFs0He\#j,+E, Adqbs&[mm([)6bH!fn\r)K%u_G+!?9PemGl)*p?!%7P6f/TUS?7+3;pG0#?C.M)3He:OSfP \k5\3HX8FU%3s)K?tGYQ4MR88_(F7G;?(^iYl5OFuJ`3G4RQN.j]"`_#56F (#L[q_\[S4#ZLEHdUdf;X(,.")+WCA43EGI`(+q)hTtF14tfPL2Nb#>eD,I!=+__JrFQ)"> s%)n0s6V"n6r)gf]_/)fJ*iNP/HLkM!>CD?&5f8F;E490G_M6>j, [U`LuK;MAb@^TQ3(73U`b5>^.Ep)o5[T=p q:?#W8r'&,5'_.fgiIpcs8NB/kq)S$Kl30+P@WnPFnHH="N_5:C4-oX A4-O5>+`#-=@%D'riE!:t&T+kFQ*4guoTnu@0b$<&'QMU?[HApc@>S#PS0r^ZX!LOR)];d+ `*b"Lg3rWA5SR?09Rp*;-HQf.F^)?CYZF`Q4HUtAZ5T!nrY+!cd1XO5+"(Is$[9I1jP=GVY ,D`rQo$(i#Y2!`$AMY492WKCWH>Xa9;)O_! Ps;dOq7iH615jEtbL3,TL!T[Lcm:+k+R-u&&4I:$'YLP/J`%Tuqp-M&g+;7/I':u3(S`Rq3 ?99lI6#cT!3WaLc'VZTJ^bRVeZIQaY$BT/HsCcN!#Jn$0u9.o@3a'_a;s7!CE5Mm9U=7gU" 8%Ncj"t0+Qi&3:!hs)*C8a,4YNfk&(b;AdS(J1]rB0^Ojbl_g)[TUICO6ihAs1%eXL.ZiU\ T>/1Q7E'g5"ABfu#LD+,2N*IWQ3oc;UH\g%\#euQ::IJMMb7dXU=et).s+^NfMXjY,I0g4q Sm@k?SU(r*Wi>s:Z2LlVV_r6&!j$#;39g08>fnI#hf``,(\QtLA`T6u$9O$\G[-?.M-f;7O >(/@RNm@#U!TkGChnrX`D.poLj#^Ql-M+AT?=kD-&FiO6i;SAn93<#s\/3IEkeF_=/JZEuBOV)'JD+IP^,[SG=h)k?cL&@d^ing#oJ,;-k:&*g tHXh)*ug+OBGd*gbl8qXRGEriaZ;58j"+**4=L*F?L7U$*P+`_JR"&g&LmAeiSGiEK`\)Sn 5tOA/6]YNg)a"CFanIcN&om(ET^]>\p]rsKhf-gHcZ(=1P)^CU(<\XIghnc+=R=/YNH"1?Gp0:K6O#gHSVf.5Dk"cg?/Z!"/oHW?rrBX_14p=k;Hj`S)hm[&jWSO2.eBQ#mIDqF= D't(liT!$St&Lk?Kml0#C#7l='iGlAtITInbaQIU>r8*3)V:Ff&qONYP[@X>OGPiL((QZ]" o2VC.Q`B_a\Es+hh[\8ajn8EIrh#7\kP>#T5>VIZ!5J";$N`9+_5pe2-b81,_=3+&#srU,. gn]5`%qiiE9'(k6h(:H&O^Ua9+s_`6rOghC2*Hl*p,2+2(,Z'FW.1*`,?YcdH#?ia($jXFW &R5npDJ?@>mB@&nHJ>8(*'[.*;%EX"$a4RUg7R`;0=\+-C*O0hcL'npI#\7+0Q/D,f1G9s] HB?5V^k,;N$c`:H,8'(PmD*[^-!A<-80$TCoRN=eNT1h@In;,i5g8@.\n>hCr/V"VY@L7)< L^i]bh:t,(P92[eU;<2iJ2pfX%SCN+II p19_+=n[QEBj,\VX(to4`NsDcG3-a(3OE`@BBf>B@YfTnHQDf4CLUoL*ckX&7VPFXjr+GV&Cr5>J8H*j[WS*S3bF_VBj-7\W9N `lA8)dErB!=tOn*6)jG)^(mT]\ n^MnQ)r+ML/3VIkB]13fY+",ItP&bh4.?_s[fo.m`a6t%pF6H@O?l;>h/^naR7k`?a>u+PR 1PW`YL&]kB]=iVZN/2O]HWHL KBE&HiF>gnU,g6bO^,]8(.tja6AgsNnbuc_Z#%OlCO_]HldST7hL\f#1ql8?_daPcjg.C;F !5I#e=jAWWs`1W&DUNYB>q-$8Oom3mo8aK8W9FO"nR,L1#O`m^aa[%>1gPgc;b^76AIkRab]fRF*AI8J95Np>gUP0TGO/ZnHk`$:PFI%d3C.To ;%)\I>G*c,'@8(C#1T$DfRi$/C1ko\$SC+-F2@js!^"E#?N\TE60dGb__d%8B0fUn-p ,p%!2^W)/Tm+HBoY/gj+m"*VQ?(P\bF*N`2PE]qnC@B=U;ZW_:PpHK).S2JN7N\BIIUg`2E;I6u[q\*7 O<1l.(W1Hp+dUT$1n5dFjLs_Y>Z^S\[ZZ^Bl\td2V%:M'#2\t!"RoaYGiKuJ*V8oG8!,]*& :T:gd"MTMOYJ`o35OZK7^nFETJa[N-g$nbRdu1s15;0Zh3?E9O.ksV\e Pek;VoOdeQe_jf)4F\#H)N)U!WXdT,>FTV=]eQep>qPl^`4sbn5NIGde`2dptBr[en`>(Mi D2dDLcQ'gk%S??UtaBleamanEa.mV&ejN<-72]?`J+IM\Ik_2^>T<;j-*#]:% n^7rRC_1pm@(uf2MFWR1VJXN:b `M'e$Ksug+Q(2e';17o[mk8(M+2e"`U%(=0D"/\s``n^;5!:!\a.e5t$,9@.OM4]k_Jei@I ma']iWKq4*)'mOVlN#uoDYB6qgX+bZSm?S(ZD^U4k'HrquJt)!Jpn=35bZgYnmYm9"peYTf G`9U2Ib;n?C8T#3]%%F:CE]%C(Fn#(T(6q]RW_jTZ+b5?`ktk]MX8$4e8/18CSY1\F$r)F9 l4%P.7fHR"qnY!HkG62Vil$m@qS_?YU8Lo[K6:<@l6p(7"k\Pr@,slE<6u5C\EsK5W%E(R*'Z:3n,Vti"1T'5+$9J\7;j0W!;F<9=` 7[$Q#\AY\27*X!L@AWhg_;&=I0RVcMDG(1J9!eF7Qb3N9P$!Lc4 WZ27#XXSP\A(,BI=@(L.FTV(jX,(oY*:l77:&k9AkN2DDm/F7g*p&4EW9(<0YE+ 3!A=];X92^L`sF]5KM+Rlf7htka'=\I9U$\[?j9^s$tsIl$X![)Dh]fn8+E)RaE30D91Qj. "[HZ''V!5b?qMm*L/;fC0R^g&N65t78pmR0MD1o`@*";-8>N<-PQ3s/r^r=ELBqr*%$aBb2 Ao=o6lAZi/\pq?9R./\Wg,b,T":P?*,_X[#K:fW6h;TmS-8i3$[5[ u5?Y=rcQ9ROoTM9e>@B>'h:9Y@K"bfr3oAH_>59U(MLr/SsJ[Z'5U62=2I!+<7RdS4PCbp_ (qk[T7@\V?W53G<"0$h);-hBc9>LHrU@%)@n]<(oEfc8<4.<5qW8k"]aU:427@_u7@:c-4D U:9%]<3J3Rl+PQ`VG\76uA^Am.O5OaX0o3P@AHdTt"] ZXB9`n3<"Ahu5d1%L%N@@br.Lu5l#1->rh$hTB/lLG7#8hC`]_YO*a%o,Ad=AQXWX1g_(9S Yod?QOeNArjS&d)tB;]F>l/3hQ_+-)"=cg.bG@!ECE:JtI^e29E*/LHNQ("4I!<..;:NCaf Bp-s0V<4sp6_`(3K&_*6.;&EbpFYhF&6<%`V*9A,nbtuq2<`>2F;loU2j<4_`EX$AKcm&(m ip6o;>)&\P>o>hnGKh*%/A3Fn,o_Hh$1?%(?cD$gL'U0Xn9?+?G[5[abJ"C6lD#=*G:NP n=kR"XK4(pQ=Cac5)@iS:9NR7W[p`2Q&aYe"\[e)dm>!MUJd?/7C(h*_pF[FLRKhd7u,?Tn $<%4d-4gKX(>?YLVg&5(fEoUPu3>.s'*aZ(8kG;%5%#3jNfe`Pd1r>f&X]<(0"^iY=5mklM )#688;l63tr#2]Um9A/Y8=fgM`%Ue]8@/AZKi+@]t4l:tK@5YdOFq>]CFbapNi$7FiE,('; ikZ6>+XR9Lc0&Ng7Gp#m-pp%s].(bP6(LWF\@Wd][>B*8u*iRTrTrZ=sJ.#-)jL;kQ/RNf*?as%[5LB O)U<^C'k64bEYKdrBu%Rjo77V$7)#=*4A"c;Y6&KXlMC_,,"1bO/8CNiVaBk8&/Nd/GS<>tL>oB7>)< Nd2Q!]]M+FBGV+.8*5;Z7iTKC!5qVkg$saq^F:tOD?2\Cd,d R8I])D&o-jTCAH/pM[IYuRO<[^k8'=?=1TmlpA^:A"smFGDPZCjt:/l$MU?I__QJSFV0*[c D!%l^o-2L;6RPLB1c1YlnD4ij1+Q$=$[*_&jW?\3=#6:)M&)HB7rS>\Tk1_f)>$')87?\n30Qa^h#t'$,JTI#L/1aYqJ5go'ht QD\!4=3A5A:-?=#PDaD%?DYS7D/d=cu*02J=n7%,s6ZH!2#FKh6H*aa'GGgK?o04-jNtqjd &SIJOX4JR?D4:^&a$[(MBSRZ#cQg9=*5@/REmI!m%mb"iPNbjSEi0J*(%'VCDj'7!0LA 5Th?UT%k#]:,`os*sJ84@XJeb&[10[^d2-T##HR7D_./')aPMMTlg=IRll7FYXeQWIpG=9a 1=FpDu1%rl,jAu?/,pHM'/HD(J=IJ4W*Er^9);AJ5"5o>i-)..Z5b]UsEB5C.'kho>3dN*H h<#48]#D6`/Q80rQVhk>?@39;]Sp8Nu3"R@]P/&92D5B7P=^Sl=^h:Ud6KO1BV.]8 !7sKTDr+aX;ieNOY=Yt=CHh`g3r9UI"^5 OT-esKc[0K')4!+C`;e0pd!>*C)O2Y`ce/5hl@,j,BfL#/?gS-6Fe<:CI^/A0Vr&?d`eMkU ;eT]?J+1"a-f2^+C,ATBeYVIM3Gc=Z\$XTiu:T3j?Kn0dn fr;M/U>qC]I&D*Z1BD/o"`ntpIhJRPL^%Vb__r(!/>](o2Q-!:9:"np>s&4F4FaDkm`'n(\ <@6@T:A9CUiUV6khChBce*$CNI@gIGa5-=]I/`#1a4'_UrVg*CWS5%W-b8/dZ1+(r3l'ZEpS=Vf!(Hsml3;4M>=`mMG=*6 1q3Gok#Rr.'tgBBbdn%uY2^\&f7fPpXU.I$lBSdYt.Sb0)f6@un[Pnp&52r4t)2;]6KbR\[ ib1q=9(QSqQ:CuE\]LO$+t87t6>B/u`/h`f<6r8U%+0#N78Hq6%:eht-T>ZT4VKPhUHZ1<4h [N136f[`3JAD(!hR:b.'IA(?.oMt.$hUGgD?C:o%:n=6!;;,`NAh`1jhRCK8K](Kh&Va^rDBR^m,@r"K?.ckG(7%FP=^ C($@uo\r%UGIa)4k3(k#o-+rYK1_Dj2;fc@MYP=rrNpkh84_V!2 &hRAT5iajP5If*83olF/CJXQpe]Y-aSY!8Mgj#4A+hm+XR)B:@o4*OarhFrr\=B!Q3%i$I' :3:7aBhnJM?k5W28*#h,!S0p%CI\4[CdDk^tg"q&rftSu+o%Cuo_;o o\CTbd_`uNY$1#DIpq"'?(Yibp>*K'h"P+3G`\AkGpBKX?5C*1ptdZdi[MmPTLlPHf6c`X= rHgWSfB*[m/%W>G[lbXl;tS9Id#n\n6\DfoR,Olg%DiY\V;p[a!#WVnXcBCZG=gW;uZG#rR Dr$e3(cC/Q`,)?4Cmo!+5@,J.OUE5klW-OC5U;U6Ps5?b&HM`K*Dt+QunD/LtNI1\b/?,g;4(cm2AP%G)l[0^4WdXLiGU+72U^ mU4Jqc&'=YYdJ?&cgg+)N^j?Rd.0O-#'2sL]Ar8rVFNG4%(W0cg``V=?,G\q3dEXhRpH1"" b[-@Xr]j!l"X)kOKoj_(&%3Xn$fkhROg*8(8J8\%;VGE=&me6Fna\l!PZ3jo:/Dein/PM,) 3&.9G`C0E*T[,uQ.!*C8f;*26TEd>!mWA\#r=3_!4HI$ia>8YauTc`k9J'8H]/!40'3RfRF ='-9IZe@R+SN*kQY?fRC+s8jP?jJ5E:-%DuaIq!$6Ae plR:O6+8F.5t<`@/'J22c,qN^[?K@$%r6Ho)0QL65.:J)mU,!,[Y :/P,*E-)1%'Os+Eq.jhqCV:<5H;]94@l(p87aRLFL<0')>jR&kOY'%/G_V"+d7@[7lH-j\K 65XbG%MG"\%h[q`L(MQ>od[%Bb-b.4jK0@'GZKmAqEAXOALN]/Ph)9sVoM'nR)Ct46@k(SL )k$*'s>2NHM(R)#d>3kW-/\;eQJt"Ks9,L`)rKD@cs33*YeaKfc#9LhBU6i_tJo=b;CCHW8 &*[B!0[l#!%H@bTSi7E==Rl+KYgLZrXofgD8aLlNmD1(2hn@!TlQNQ$fbnq$)^rQmb[&C`m l=I#NWj0eNXS\+`)"h$%sO`c.cAQ+l&0S$dG-jk[Q#IdemsdQ,<1OKt0Eo3RU)%ACc"^!LS D&$bG9Xd-+fME3="Z0"1S0Z4j'%f0QPm==Z."Z[f$D2LXO5*crP_8LWM$Yu;TE2"Bn_o-R+ Qr#S/#g'r.Id(;].u98IBG?e?#ND7RMXb:1`RqpB&L"/2"I88bptm#c['CcDe<\*6rR_Qf\ ghY7#/Gt(fUG!aP4CM*aLOFMj<7Dba4U+,)-hm%lp6HuiVXAL*)#D+`JHAt?+LhK;NA6nQ8 <,ic.TikB,p"LTfacXGinX2S8e#].'0EdcTj4Ip-/er:s%BH6YN#&U@^RNT#-KPV]+]R.D=t/Xk5!)n3,4:mi&eEF=IE-HC[GE4_RO4biR-:U% &#blG59SE]O-V;Si+O_k&!Y6mriJ@h0H2:*TY<<>72JK^A%@Rjda)N^9l*1\0!*<0HZ&=^) tXGk<%kJHr5ib3]G)mgudE7Ui`2nde[O7*u7)'oc?O`1#>(A>rSi/]#6d++D9h!]aQ,N,W?iP]TDTd j0&pnj$XUa3q^7Wp^0-4"JYF@Wf]M_VY^;G)n(kURGP'aYe9XL!-cRj-)e5pSq>Y$mrMR's hVBjR%h[=ifjNCbj'@"mKMSW[qMP8^b5@kbo"IPt(umkMH/FC7`[KX[*imcgO&Pb$j:_-W] @^joVtg9>jo"#.oFe]T1'S;/pV&#SD[bt.J"\QF@cunRT:,]X?i=ELN#CRcqG6Cil&bd=%f .]uDHE(VBko(_\Ks%iRs:g4 *XiY]M)&F30rbT*d#lN&\\!K_F):_a#X+TbIh#-`jgOGaCkNnhIf)kga>n3igUQl)Le*s(f !&[id0D]'(*%No^e(gtl%nJ_k`*t/RF(a51Ud)ck-_AON4(pMHuYh'PN5 (YKG%P[%H8+.)\:DFI?'iA#$9R7aHQ439e$,iu^i7?L5@hk,,E8c?[d3BITHPcne&n(SLd; lkGd1aok'=!l<%5JTJL_?dK)'ScpEK(maY8\([)b6bG@F?#jAK1cMGMsbFEOQYFm)^u7(\& Xh;;*_("qPC1)_]/MbHr-q_AMg4+&S:FEL9'YPT/S?+)&,)Z3qf'%j;PuBE>7S5qa34Ah2' X*g.6K6,jo'M&k!q,>p;mV=Y7p!#fLd,)`cM@J:Yu.j)&q+-K\I_rDj?N34Ze,][NEP%uDm DFXt-+&CPfcpJ,DTaFVq-P6hZAJu#`3?=9H,BB#CiHc@!kp-m1-u6.-;H5$KXXal'-1YOqE kgC`C3t'i>Dk:okXfdMVP;.<=T(90disk"c#K.T5!,E_@\KZRYNK0F YB,@CR-4nfMXc09[2,P8c7**[+32Ji1YkOMC5V3:I^,qC/%?Lkc5 KYD6kk>)_/pU3Bgd&i8Q;$JPa^WQFXNAq1@Kied#alnTglDq6>fjp.'k%\Wk33ubO!,6oSH 8K4r47$(23S='\c@3hbFVS*eEAl1*8H=I*e,<7T)BB<,YEOr\P>#(MiV<9=u2%cl/.n89E0 TA1W4F>>V^P;H5)BN)CW]]G>IU4KFH>YY-5Uqc":1To'hV$SbS\])n(D;,p[pMGg9n+]S,E <`Nd5MTR$WSf&[Sel3;K@G+\cMBC@D<)n]LeVZ?/,$//B:J`3M\=)Z`Dh;k%!Q8oAc==Oi5K[?.iIcF_0Kqt6^a[Hbqd?5b]$YZ9XhQ2 =q=re+_2*e?rc'MLZ"0,fJ7uB,689QA]FqfY8S m(dR(c'fTgq0Y"CHAl^!g@mh5o'/9OPC$WZGiO-%riC!ECJp@+SZd&BSteD\;GOEd*;nYH r109d>APZ^M@L"Pu_)j5D#@Ng7>@/1jG4d<"YXeF()G=kn=3lA5%6Q'C#R"Gu^6S'/&jNGhM)mj0h%[D4h.\2<7Id=o"`E&"smTTgA\9!ABqNn MEZ*S6?]?orXbWm5=5fTXlSIRQI:u5EpHU*P*=pZf!l%3M['(?NF6&pVSlP&#D&(\VYGJEnmGWDh)L\RsbG&Ea"^HL\I`#:IIZNWg^ DtR_,WP>)0&+T$r\!1bYor?`4kF3bMQ;g9n$Yhl[mXY#]Mi3hFa,"Ff(ea5L\M@9oo#Y_'q M5aqAMRgZIT%pKL)'KYT?*&kgk:W4;Oge,9qqFRRC1O"4Gc6;PjRTjn.$_MfXa'L7&W=d04cRWdSX6ToQ:<3KVVPefB%gSVu.VN`ol,*2.cNd)D1(OO\b[oUUVurLq s$YM1)';Gke!9oG1EqqFi_*qAgu]r@,7_qc?^h-JT$@Dj/EK[ACTQ,o6/^"Ci?@k[6lQP$- qII5qJs54q".'tWJ/mTM9?cP>5f7B=,XLFWT^YrKDia+"lJn,j0ckrblR2Np$4t>*Gr>H%1 SN5<^hFlqd:ZVX0.&@o@RD5A!S`MGJ)<&RQMCkSZ'BVK"k?`AqJdrcOcl!)?0(VTn^3\D;T gOY%k51M/hOEcdTA`^,:P[:mA"fWGT\M>!2(/;iA4nm'Z0WOLls88NJXBj!H.[Scgk`s3M,Nr+fZO3Jl`oW8Nut>T*t/E4<4IT)<6:L^&.Iin7=0Cp1@=>HI(3q;at1?/oj;'Y['gB8Q>61l*TA/Aj-7L+"2h\!g%Jc opKr-__>W3+KsCZ&kj:gJ0!G%PhB3p~> Q Q Q showpage %%Trailer end restore %%EOF interval-2.1.0/doc/image/inverse-power.svg.eps0000644000175000017500000004656013031037006020667 0ustar oliveroliver%!PS-Adobe-3.0 EPSF-3.0 %%Creator: cairo 1.14.0 (http://cairographics.org) %%CreationDate: Wed Dec 28 23:34:46 2016 %%Pages: 1 %%DocumentData: Clean7Bit %%LanguageLevel: 2 %%BoundingBox: 0 -1 362 180 %%EndComments %%BeginProlog save 50 dict begin /q { gsave } bind def /Q { grestore } bind def /cm { 6 array astore concat } bind def /w { setlinewidth } bind def /J { setlinecap } bind def /j { setlinejoin } bind def /M { setmiterlimit } bind def /d { setdash } bind def /m { moveto } bind def /l { lineto } bind def /c { curveto } bind def /h { closepath } bind def /re { exch dup neg 3 1 roll 5 3 roll moveto 0 rlineto 0 exch rlineto 0 rlineto closepath } bind def /S { stroke } bind def /f { fill } bind def /f* { eofill } bind def /n { newpath } bind def /W { clip } bind def /W* { eoclip } bind def /BT { } bind def /ET { } bind def /pdfmark where { pop globaldict /?pdfmark /exec load put } { globaldict begin /?pdfmark /pop load def /pdfmark /cleartomark load def end } ifelse /BDC { mark 3 1 roll /BDC pdfmark } bind def /EMC { mark /EMC pdfmark } bind def /cairo_store_point { /cairo_point_y exch def /cairo_point_x exch def } def /Tj { show currentpoint cairo_store_point } bind def /TJ { { dup type /stringtype eq { show } { -0.001 mul 0 cairo_font_matrix dtransform rmoveto } ifelse } forall currentpoint cairo_store_point } bind def /cairo_selectfont { cairo_font_matrix aload pop pop pop 0 0 6 array astore cairo_font exch selectfont cairo_point_x cairo_point_y moveto } bind def /Tf { pop /cairo_font exch def /cairo_font_matrix where { pop cairo_selectfont } if } bind def /Td { matrix translate cairo_font_matrix matrix concatmatrix dup /cairo_font_matrix exch def dup 4 get exch 5 get cairo_store_point /cairo_font where { pop cairo_selectfont } if } bind def /Tm { 2 copy 8 2 roll 6 array astore /cairo_font_matrix exch def cairo_store_point /cairo_font where { pop cairo_selectfont } if } bind def /g { setgray } bind def /rg { setrgbcolor } bind def /d1 { setcachedevice } bind def %%EndProlog %%BeginSetup %%BeginResource: font Cmmi10 11 dict begin /FontType 42 def /FontName /Cmmi10 def /PaintType 0 def /FontMatrix [ 1 0 0 1 0 0 ] def /FontBBox [ 0 0 0 0 ] def /Encoding 256 array def 0 1 255 { Encoding exch /.notdef put } for Encoding 120 /x put Encoding 121 /y put /CharStrings 3 dict dup begin /.notdef 0 def /x 1 def /y 2 def end readonly def /sfnts [ <00010000000900800003001063767420721a75db00000338000001166670676d0211c2610000 0450000001d8676c7966d7fc9a800000009c0000029c68656164673348fc0000062800000036 686865610e1f03020000066000000024686d74780e7d0176000006840000000c6c6f63610000 047000000690000000106d61787000e500ca000006a00000002070726570566f2373000006c0 0000002600020100000005000500000300070022401b2b02060006042b0009000702048a0305 00058a0701000602090f032b31002b3021112111271121110100040021fc420500fb002104be fb4200000001003fffe9043503890057004c404352423d2c26151200080b37091f011c012e01 0b29190a0e08480102014b01372845091a07020448341c080429550942402c03582329010515 000258554f010602590f032b2b31002b2b30371633323637133635342623220e0107062b0122 3d013e02333216173e0133321e01151406232226353436372623220607030615141633323637 363b0132161514070e01232226270e0123222e01353436333216151406a024424062125d1639 3341724e10040c191014608b4f4b7919236d412c5c3a4334212c3b2925414261145a163b3160 9718040c19080a021dba754b79192071402c5d3a4332222e393b1c7b49016b6324334c517d40 0d13064c915a50453f561f4030344b2a202b41061d7a4bfe965235344ba9650c0b0702047abe 51453c5a1f4031304f29212b4000000000010037fe5c03f00389004c0042403b382f1d1a0414 2d0933011429200a0108060144012d28080914074a000202293d071007030436060212231202 411d000347016e2a0c1506014e10032b2b2b2b30131633323e01370623222e0135343e013736 353423220607062b01223d013e013332161514070e03151416333237133e0133321615140703 0e0223222e01353436333216151406232626ac2b6b618e57185b6a51723f2441181b2d516919 040d1811218868496511094022163a3f7f659b07321d192502cb1b90cb6e3568404237212d46 2f0204fedb4a88c16556386f4f438dad404b303da7670d13067abd604a262a19a86e6a35445e 9b02771b27201a0c04fcd169c075295237385229212f4601010000060008000e001f002d005e fe5cfe73ffd300000389038b057705a40110010400e100cf00be00a8009e009c009a00960093 0091008d0085007f006d00660064005c0052004e004a00480042003d003b0037003500330021 001f080a07f4071906d306c5069c05f805ec05d705d105cf05b605b40581057b05750550050e 04e304dd0489046003fe03f403e703cd03be038b036a03190277022f022701be0193013b011d 00e900e100df00cf00c900c700c500c300be00bc00ba00b800b600b200ae00ac00a800a600a4 00a0009e009c009a009800960093008f008d008b00890087008500830081007d007b00790075 00730071006d00660060005e00520050004c0048004600440042003f003d003b003700350021 000040161514131211100f0e0d0c0b0a090807060504030201002cb200800043208a628a2342 66562d2cb22a0000435478b0002b58173959b0002b58173c59b0002b58b00a2a59b0014310b0 002b58173c59b0002b58b00a2a592d2c2b2d2c2bb0022a2d2cb0022a2d2cb00162b0002342b1 01032542204620686164b0032546206820b0044323612064b140408a545821212121b100211c 5950582121b1000425204668b007254561b0005158211bb0054338591b6164595358232f23f9 1b2f23e959b0012b2d2cb00162b0002342b101032542204620686164b0032546206861645358 232f23f91b2f23e959b0012b2d2cb00162b0002342b1010525423fe9b0012b2d2cb00162b000 2342b1010325423ff9b0012b2d2c111217392d2cc12d2cb2000100432020b004438a45b00343 6169604460422d2c4520b0032342b201020543764323438a23616960b004234218b00b2a2d2c b0002342184569b0406120b000515821b0411bb04061b0005158b0461bb0485959b005234245 20b001234269b0022342b00c2a182d2c204568442d2cba00110005ffc0422b2d2cb211050042 2b2d2c2020b102038a4223b0016142466820b0405458b0406059b00423422d2cb10203431143 12173931002d2c2e2d2cc52d2c3fb0142a2d0001000000010000ae3916995f0f3cf500030800 00000000000000000000000000000000ffbafe00086206000000000600020001000000000001 00000600fe0000000800ffbafcfe086200010000000000000000000000000000000306000100 0491003f03ec0037000000000000004c000001880000029c0001000000030063000300000000 0002000c00060016000000bc005e00000001401c072903240521101c0429580e0d0f87116e0b 6833580458582d0d35008db8033c851d2b2b000000> ] def /f-0-0 currentdict end definefont pop %%EndResource %%BeginResource: font Cmr10 11 dict begin /FontType 42 def /FontName /Cmr10 def /PaintType 0 def /FontMatrix [ 1 0 0 1 0 0 ] def /FontBBox [ 0 0 0 0 ] def /Encoding 256 array def 0 1 255 { Encoding exch /.notdef put } for Encoding 45 /hyphen put Encoding 48 /zero put Encoding 49 /one put Encoding 50 /two put Encoding 65 /A put Encoding 66 /B put /CharStrings 7 dict dup begin /.notdef 0 def /A 1 def /B 2 def /hyphen 3 def /one 4 def /two 5 def /zero 6 def end readonly def /sfnts [ <000100000009008000030010637674204d184f4a00000450000000da6670676d0211c2610000 052c000001d8676c79660d8a2fb80000009c000003b46865616466cf48fc0000070400000036 686865610d5f06130000073c00000024686d747820540307000007600000001c6c6f63610000 0e0c0000077c000000206d61787000f600cb0000079c0000002070726570ef569262000007bc 0000002800020100000005000500000300070022401b2a02060006042a0009000702046c0305 00056c0701000602090f032b31002b3021112111271121110100040021fc420500fb002104be fb42000000020042000005bc05ba001c001f00314028221e1500061b100d030f01012200090a 0702041f071f1e1d1c181514131009310e01010501210f032b31002e2e2b303335323701363b 013217011e0133152135323d0103210306151416331503210342b72a01ae061b1a1b0601c113 6b50fdc5aa6ffe0f5c0261382301c1e1487904e31616fae52b164848370a0140fef8070e3331 480210028e00000000030046000005350577001700250036003a403432010622080c02080f01 26272501061c010122000908070304070102124c132000050f014d0c2c040626015518040806 03380f032b2b2b30333532351134233521321e0115140607321e0115140e0123251416332132 3e0135342e0123213521323e0235342e022321220e011546d3d302f168d48bcd8959bc7885d4 6bfe5a32360104508950427b4ffe7701333e6d572f23445c35fefc25291a484104654148519f 6c7da91a62a45c70ac5d892c15548d504e9560362d556b3c3562502d061d1e00000000010017 017b023501fa00030017401019020000060104400301000501050f032b31002b301335211517 021e017b7f7f000100b20000035e055400110024401d0a010401220706110601040009110701 031209015a0d04010501130f032b2b3f2b30333520351106233532373332161511142115be01 006aa2fb801d070d0100484104333348830b07fb474148000000000100660000039805540032 0044403b2e2918030d2b091210020d22200c0408310103012b14000911070204290109150931 0132302e034f240909051b012a100303481501030602340f032b2b31002b2b3033353437013e 0335342e01232206073633321615140623222635343e0233321e0115140e020f013332363736 3733036604013e485a58333e7b57598e1d080e2e41412e30413a6d894d75ca764e7abe1ee8c5 91c30618193c3a37050601604e6a8a8f5054995c6b55023e312f41432d4d87693863b57959a0 83a61cdf05051aa3fe9300020050ffd303ae0554000f00200023401c1827070c000810270009 00070204550c140005551c03000602220f032b31002b300522021134123633321e0215140206 27323612353402262322060215141e01160200fbb541c1ae87ac5a2141beaf72701a1a6f7374 701a0b306b2d019d011db2013adb84d1ef83b0fecdd735ea011ca09a0104d3d4fefd9a72cad7 930000060008000e001d002b0042fe5afe73ffd30000037303a0057705a401cd00e100db00d5 00b000a800a600a400980093008d007f006d006a0068005e00560052004e004a00480042003d 003b003700350033002f002107fe07ee05ec05c305b005a0057b0552050804df040803fe03e9 031902fc02f402e302aa026d025a0227021f01e901c10185017f016d012500ee00e100df00db 00d900d500cf00c500c300c100be00ba00b800b400b200ae00a600a400a200a000960091008f 008b0087007f007d00790073006f006a0062005200480042003b003500210000401615141312 11100f0e0d0c0b0a090807060504030201002cb200800043208a628a234266562d2cb22a0000 435478b0002b58173959b0002b58173c59b0002b58b00a2a59b0014310b0002b58173c59b000 2b58b00a2a592d2c2b2d2c2bb0022a2d2cb0022a2d2cb00162b0002342b10103254220462068 6164b0032546206820b0044323612064b140408a545821212121b100211c5950582121b10004 25204668b007254561b0005158211bb0054338591b6164595358232f23f91b2f23e959b0012b 2d2cb00162b0002342b101032542204620686164b0032546206861645358232f23f91b2f23e9 59b0012b2d2cb00162b0002342b1010525423fe9b0012b2d2cb00162b0002342b1010325423f f9b0012b2d2c111217392d2cc12d2cb2000100432020b004438a45b003436169604460422d2c 4520b0032342b201020543764323438a23616960b004234218b00b2a2d2cb0002342184569b0 406120b000515821b0411bb04061b0005158b0461bb0485959b00523424520b001234269b002 2342b00c2a182d2c204568442d2cba00110005ffc0422b2d2cb2110500422b2d2c2020b10203 8a4223b0016142466820b0405458b0406059b00423422d2cb1020343114312173931002d2c2e 2d2cc52d2c3fb0142a2d000100000001000039cb36855f0f3cf5000308000000000000000000 0000000000000000ffa6fe00081206000000000600020001000000000001000005a4fe460000 0837ffa6ff8e0812000100000000000000000000000000000007060001000600004205aa0046 02aa0017040000b20400006604000050000000000000004c000000e8000001c0000001f00000 025000000324000003b400010000000700600004000000000002000c00060016000000c40062 00040001401e072703220b1f080f04275d0e0d076a0c5d07550551234a055d5d2b0d35008db8 033c851d2b2b00> ] def /f-1-0 currentdict end definefont pop %%EndResource %%EndSetup %%Page: 1 1 %%BeginPageSetup %%PageBoundingBox: 0 -1 362 180 %%EndPageSetup q 0 -1 362 181 rectclip q 0 g 0.8 w 1 J 0 j [] 0.0 d 4 M q 1 0 0 -1 0 179.239456 cm 66.926 43.836 m 81.098 43.836 l S Q 76.914 137.341 m 82.156 135.411 l 76.914 133.482 l 77.75 134.622 77.746 136.181 76.914 137.341 c h 76.914 137.341 m f* 0.402638 w 1 j 10 M q 1 0 0 -1 0 179.239456 cm 35.539 50.633 m 37.664 50.633 l S Q q 1 0 0 -1 0 179.239456 cm 35.539 75.652 m 37.664 75.652 l S Q q 1 0 0 -1 0 179.239456 cm 35.539 100.695 m 37.664 100.695 l S Q q 1 0 0 -1 0 179.239456 cm 35.539 125.715 m 37.664 125.715 l S Q 0.316883 w q 1 0 0 -1 0 179.239456 cm 78.051 150.758 m 78.051 148.633 l S Q q 1 0 0 -1 0 179.239456 cm 120.562 150.758 m 120.562 148.633 l S Q 0.402638 w q 1 0 0 -1 0 179.239456 cm 35.539 25.59 m 37.664 25.59 l S Q q 1 0 0 -1 0 179.239456 cm 233.953 50.633 m 236.078 50.633 l S Q q 1 0 0 -1 0 179.239456 cm 233.953 75.652 m 236.078 75.652 l S Q q 1 0 0 -1 0 179.239456 cm 233.953 100.695 m 236.078 100.695 l S Q q 1 0 0 -1 0 179.239456 cm 233.953 125.715 m 236.078 125.715 l S Q 0.316884 w q 1 0 0 -1 0 179.239456 cm 276.465 150.758 m 276.465 148.633 l S Q q 1 0 0 -1 0 179.239456 cm 318.977 150.758 m 318.977 148.633 l S Q 0.402638 w q 1 0 0 -1 0 179.239456 cm 233.953 25.59 m 236.078 25.59 l S Q 0.0784314 g 0.4252 w 0 J 0 j 22.9256 M q 1 0 0 -1 0 179.239456 cm 159.543 150.758 m 35.539 150.758 l 35.539 4.117 l S Q 0 g 154.996 30.368 m 160.105 28.489 l 154.996 26.611 l 155.812 27.72 155.809 29.236 154.996 30.368 c h 154.996 30.368 m f* 33.652 170.575 m 35.531 175.685 l 37.41 170.575 l 36.301 171.392 34.785 171.388 33.652 170.575 c h 33.652 170.575 m f* 0.0784314 g q 1 0 0 -1 0 179.239456 cm 357.957 150.758 m 233.953 150.758 l 233.953 4.117 l S Q 0 g 353.41 30.368 m 358.52 28.489 l 353.41 26.611 l 354.227 27.72 354.223 29.236 353.41 30.368 c h 353.41 30.368 m f* 232.066 170.575 m 233.945 175.685 l 235.824 170.575 l 234.715 171.392 233.199 171.388 232.066 170.575 c h 232.066 170.575 m f* BT 12 0 0 12 92.778516 0.134769 Tm /f-0-0 1 Tf (x)Tj 19.680585 3.543424 Td (x)Tj ET 0.0784314 g 1 J [ 0.4252 2.126] 0 d q 1 0 0 -1 0 179.239456 cm 340.238 0.57 m 340.238 150.758 l 324.488 0.57 m 324.488 150.758 l S Q /CairoPattern { q 0 g 0 150 100 -200 re f Q } bind def << /PatternType 1 /PaintType 1 /TilingType 1 /XStep 500 /YStep 100 /BBox [0 0 500 100] /PaintProc { pop CairoPattern } >> [ 0.005 0.005 0.01 -0.01 -1.128906 0.239456 ] makepattern setpattern 324.496 139.989 m 324.496 126.54 l 329.488 124.876 334.879 123.583 340.246 122.54 c 340.246 133.564 l 334.934 135.196 329.57 137.259 324.496 139.989 c h 324.496 139.989 m f 0.0784314 g 0.4252 w 1 J 0 j [ 0.4252 2.126] 0 d 22.9256 M q 1 0 0 -1 0 179.239456 cm 361.504 56.711 m 233.953 56.711 l 361.504 39.25 m 233.953 39.25 l S Q [ 0.4252 2.126] 0 d q 1 0 0 -1 0 179.239456 cm 104.004 0.57 m 104.004 150.758 l 152.172 0.57 m 152.172 150.758 l S Q [ 0.4252 2.126] 0 d q 1 0 0 -1 0 179.239456 cm 163.086 48.406 m 35.539 48.406 l 163.086 39.25 m 35.539 39.25 l S Q 0 g BT 12 0 0 12 49.713293 132.716461 Tm /f-0-0 1 Tf (y)Tj /f-1-0 1 Tf 8.677075 3.161096 Td (A)Tj 16.68129 0 Td (B)Tj /f-0-0 1 Tf -5.235105 -14.20957 Td (x)Tj -7.739945 8.588267 Td (y)Tj -16.552944 0 Td (y)Tj 12.000001 0 0 10.848438 218.912661 79.087771 Tm /f-1-0 1 Tf (-1)Tj -0.130859 -2.336044 Td (-2)Tj 0.329099 4.633154 Td (0)Tj 0.135744 2.336044 Td (1)Tj -0.130859 2.29711 Td (2)Tj -8.857124 -12.848241 Td [(2)4020(1)4090(0)]TJ -7.818577 5.917977 Td (-1)Tj -0.13086 -2.336044 Td (-2)Tj 0.3291 4.633154 Td (0)Tj 0.135744 2.336044 Td (1)Tj -0.13086 2.29711 Td (2)Tj 24.158423 -12.848241 Td [(2)4020(1)4090(0)]TJ ET 0.8 w [] 0.0 d 4 M q 1 0 0 -1 0 179.239456 cm 128.098 94.371 m 128.098 108.543 l S Q 130.031 74.88 m 128.105 69.634 l 126.176 74.88 l 127.312 74.04 128.871 74.048 130.031 74.88 c h 130.031 74.88 m f* q 1 0 0 -1 0 179.239456 cm 280.02 47.98 m 265.848 47.98 l S Q 270.031 129.321 m 264.785 131.251 l 270.031 133.181 l 269.191 132.04 269.199 130.486 270.031 129.321 c h 270.031 129.321 m f* q 1 0 0 -1 0 179.239456 cm 332.363 123.262 m 332.363 109.09 l S Q 330.426 65.966 m 332.355 71.212 l 334.285 65.966 l 333.145 66.806 331.586 66.798 330.426 65.966 c h 330.426 65.966 m f* /CairoPattern { q 0 g 0 150 100 -200 re f Q } bind def << /PatternType 1 /PaintType 1 /TilingType 1 /XStep 500 /YStep 100 /BBox [0 0 500 100] /PaintProc { pop CairoPattern } >> [ -0.005 0.005 0.01 0.01 -1.128906 -1.760544 ] makepattern setpattern 267.676 28.486 m 264.844 55.118 260.898 76.353 245.926 89.861 c 242.777 92.704 238.305 95.689 235.926 97.935 c 233.883 99.868 233.953 100.431 233.953 103.587 c 233.957 102.107 233.852 99.669 234.176 98.263 c 235.055 94.47 240.988 88.431 243.004 85.861 c 255.035 70.501 259.871 52.626 263.426 28.486 c h 267.676 28.486 m f /CairoPattern { q 0 g 0 150 100 -200 re f Q } bind def << /PatternType 1 /PaintType 1 /TilingType 1 /XStep 500 /YStep 100 /BBox [0 0 500 100] /PaintProc { pop CairoPattern } >> [ -0.005 0.005 0.01 0.01 -1.128906 -1.760544 ] makepattern setpattern 163.086 119.376 m 149.266 120.997 129.184 123.736 116.105 130.716 c 100.59 139.001 93.648 151.939 89.098 178.669 c 96.852 178.669 l 99.742 169.556 102.617 162.634 107.43 155.927 c 121.16 136.779 145.988 131.868 163.086 128.607 c h 163.086 119.376 m f /CairoPattern { q 0 g 0 150 100 -200 re f Q } bind def << /PatternType 1 /PaintType 1 /TilingType 1 /XStep 500 /YStep 100 /BBox [0 0 500 100] /PaintProc { pop CairoPattern } >> [ -0.005 0.005 0.01 0.01 -1.128906 -1.760544 ] makepattern setpattern 69.27 28.489 m 66.438 55.122 62.492 76.353 47.52 89.864 c 44.371 92.708 39.898 95.693 37.52 97.939 c 35.477 99.872 35.547 100.431 35.547 103.591 c 35.551 102.111 35.445 99.669 35.77 98.263 c 36.648 94.47 42.582 88.435 44.598 85.864 c 56.629 70.505 61.465 52.63 65.02 28.489 c h 69.27 28.489 m f /CairoPattern { q 0 g 0 150 100 -200 re f Q } bind def << /PatternType 1 /PaintType 1 /TilingType 1 /XStep 500 /YStep 100 /BBox [0 0 500 100] /PaintProc { pop CairoPattern } >> [ 0.005 0.005 0.01 -0.01 -1.128906 0.239456 ] makepattern setpattern 104.02 139.989 m 107.305 136.333 111.18 133.372 115.871 130.841 c 152.145 130.841 l 143.699 132.759 134.508 135.466 126.098 139.989 c h 104.02 139.989 m f 0.2 g 0.7088 w 1 J 1 j [] 0.0 d 22.9256 M q 1 0 0 -1 0 179.239456 cm 69.27 150.75 m 66.438 124.117 62.492 102.887 47.52 89.375 c 44.371 86.531 39.898 83.547 37.52 81.301 c 35.477 79.367 35.547 78.809 35.547 75.648 c 35.551 77.129 35.445 79.57 35.77 80.977 c 36.648 84.77 42.582 90.805 44.598 93.375 c 56.629 108.734 61.465 126.609 65.02 150.75 c S Q /CairoPattern { q 0 g 0 150 100 -200 re f Q } bind def << /PatternType 1 /PaintType 1 /TilingType 1 /XStep 500 /YStep 100 /BBox [0 0 500 100] /PaintProc { pop CairoPattern } >> [ -0.005 0.005 0.01 0.01 -1.128906 -1.760544 ] makepattern setpattern 361.492 119.372 m 347.672 120.993 327.59 123.732 314.512 130.712 c 298.996 138.997 292.055 151.935 287.508 178.665 c 295.258 178.665 l 298.148 169.552 301.023 162.63 305.836 155.923 c 319.566 136.775 344.395 131.864 361.492 128.603 c h 361.492 119.372 m f 0.2 g 0.70866 w 1 J 1 j [] 0.0 d 22.9256 M q 1 0 0 -1 0 179.239456 cm 361.5 59.863 m 347.68 58.242 327.598 55.504 314.52 48.523 c 299.004 40.238 292.062 27.301 287.516 0.57 c 295.266 0.57 m 298.156 9.684 301.031 16.605 305.844 23.312 c 319.574 42.461 344.402 47.371 361.5 50.633 c 267.684 150.758 m 264.852 124.125 260.918 102.883 245.945 89.371 c 242.793 86.527 238.301 83.551 235.926 81.305 c 233.879 79.371 233.953 78.812 233.953 75.652 c 233.957 77.133 233.855 79.559 234.184 80.965 c 235.059 84.758 241.004 90.805 243.02 93.379 c 255.051 108.738 259.875 126.617 263.434 150.758 c S Q 1 g 35.539 105.005 m 36.32 105.005 36.957 104.368 36.957 103.587 c 36.957 102.802 36.32 102.169 35.539 102.169 c 34.758 102.169 34.121 102.802 34.121 103.587 c 34.121 104.368 34.758 105.005 35.539 105.005 c h 35.539 105.005 m f 0.2 g 0 J 0 j q 1 0 0 -1 0 179.239456 cm 35.539 74.234 m 36.32 74.234 36.957 74.871 36.957 75.652 c 36.957 76.438 36.32 77.07 35.539 77.07 c 34.758 77.07 34.121 76.438 34.121 75.652 c 34.121 74.871 34.758 74.234 35.539 74.234 c h 35.539 74.234 m S Q 1 g 233.953 105.005 m 234.734 105.005 235.371 104.368 235.371 103.587 c 235.371 102.802 234.734 102.169 233.953 102.169 c 233.172 102.169 232.535 102.802 232.535 103.587 c 232.535 104.368 233.172 105.005 233.953 105.005 c h 233.953 105.005 m f 0.2 g q 1 0 0 -1 0 179.239456 cm 233.953 74.234 m 234.734 74.234 235.371 74.871 235.371 75.652 c 235.371 76.438 234.734 77.07 233.953 77.07 c 233.172 77.07 232.535 76.438 232.535 75.652 c 232.535 74.871 233.172 74.234 233.953 74.234 c h 233.953 74.234 m S Q 1 J 1 j q 1 0 0 -1 0 179.239456 cm 96.852 0.57 m 99.742 9.684 102.617 16.605 107.43 23.312 c 121.16 42.461 145.988 47.371 163.086 50.633 c 163.086 59.863 m 149.266 58.242 129.184 55.504 116.105 48.523 c 100.59 40.238 93.648 27.301 89.098 0.57 c S Q Q Q showpage %%Trailer end restore %%EOF interval-2.1.0/doc/image/octave-interval.ly.eps0000644000175000017500000006151413031037010021001 0ustar oliveroliver%!PS-Adobe-3.0 EPSF-3.0 %Produced by poppler pdftops version: 0.26.5 (http://poppler.freedesktop.org) %%Creator: LilyPond 2.18.2 %%LanguageLevel: 2 %%DocumentSuppliedResources: (atend) %%BoundingBox: 0 0 77 50 %%HiResBoundingBox: 0 0 77 50 %%DocumentSuppliedResources: (atend) %%EndComments %%BeginProlog %%BeginResource: procset xpdf 3.00 0 %%Copyright: Copyright 1996-2011 Glyph & Cog, LLC /xpdf 75 dict def xpdf begin % PDF special state /pdfDictSize 15 def /pdfSetup { /setpagedevice where { pop 2 dict begin /Policies 1 dict dup begin /PageSize 6 def end def { /Duplex true def } if currentdict end setpagedevice } { pop } ifelse } def /pdfSetupPaper { % Change paper size, but only if different from previous paper size otherwise % duplex fails. PLRM specifies a tolerance of 5 pts when matching paper size % so we use the same when checking if the size changes. /setpagedevice where { pop currentpagedevice /PageSize known { 2 copy currentpagedevice /PageSize get aload pop exch 4 1 roll sub abs 5 gt 3 1 roll sub abs 5 gt or } { true } ifelse { 2 array astore 2 dict begin /PageSize exch def /ImagingBBox null def currentdict end setpagedevice } { pop pop } ifelse } { pop } ifelse } def /pdfStartPage { pdfDictSize dict begin /pdfFillCS [] def /pdfFillXform {} def /pdfStrokeCS [] def /pdfStrokeXform {} def /pdfFill [0] def /pdfStroke [0] def /pdfFillOP false def /pdfStrokeOP false def /pdfLastFill false def /pdfLastStroke false def /pdfTextMat [1 0 0 1 0 0] def /pdfFontSize 0 def /pdfCharSpacing 0 def /pdfTextRender 0 def /pdfPatternCS false def /pdfTextRise 0 def /pdfWordSpacing 0 def /pdfHorizScaling 1 def /pdfTextClipPath [] def } def /pdfEndPage { end } def % PDF color state /cs { /pdfFillXform exch def dup /pdfFillCS exch def setcolorspace } def /CS { /pdfStrokeXform exch def dup /pdfStrokeCS exch def setcolorspace } def /sc { pdfLastFill not { pdfFillCS setcolorspace } if dup /pdfFill exch def aload pop pdfFillXform setcolor /pdfLastFill true def /pdfLastStroke false def } def /SC { pdfLastStroke not { pdfStrokeCS setcolorspace } if dup /pdfStroke exch def aload pop pdfStrokeXform setcolor /pdfLastStroke true def /pdfLastFill false def } def /op { /pdfFillOP exch def pdfLastFill { pdfFillOP setoverprint } if } def /OP { /pdfStrokeOP exch def pdfLastStroke { pdfStrokeOP setoverprint } if } def /fCol { pdfLastFill not { pdfFillCS setcolorspace pdfFill aload pop pdfFillXform setcolor pdfFillOP setoverprint /pdfLastFill true def /pdfLastStroke false def } if } def /sCol { pdfLastStroke not { pdfStrokeCS setcolorspace pdfStroke aload pop pdfStrokeXform setcolor pdfStrokeOP setoverprint /pdfLastStroke true def /pdfLastFill false def } if } def % build a font /pdfMakeFont { 4 3 roll findfont 4 2 roll matrix scale makefont dup length dict begin { 1 index /FID ne { def } { pop pop } ifelse } forall /Encoding exch def currentdict end definefont pop } def /pdfMakeFont16 { exch findfont dup length dict begin { 1 index /FID ne { def } { pop pop } ifelse } forall /WMode exch def currentdict end definefont pop } def % graphics state operators /q { gsave pdfDictSize dict begin } def /Q { end grestore /pdfLastFill where { pop pdfLastFill { pdfFillOP setoverprint } { pdfStrokeOP setoverprint } ifelse } if } def /cm { concat } def /d { setdash } def /i { setflat } def /j { setlinejoin } def /J { setlinecap } def /M { setmiterlimit } def /w { setlinewidth } def % path segment operators /m { moveto } def /l { lineto } def /c { curveto } def /re { 4 2 roll moveto 1 index 0 rlineto 0 exch rlineto neg 0 rlineto closepath } def /h { closepath } def % path painting operators /S { sCol stroke } def /Sf { fCol stroke } def /f { fCol fill } def /f* { fCol eofill } def % clipping operators /W { clip newpath } def /W* { eoclip newpath } def /Ws { strokepath clip newpath } def % text state operators /Tc { /pdfCharSpacing exch def } def /Tf { dup /pdfFontSize exch def dup pdfHorizScaling mul exch matrix scale pdfTextMat matrix concatmatrix dup 4 0 put dup 5 0 put exch findfont exch makefont setfont } def /Tr { /pdfTextRender exch def } def /Tp { /pdfPatternCS exch def } def /Ts { /pdfTextRise exch def } def /Tw { /pdfWordSpacing exch def } def /Tz { /pdfHorizScaling exch def } def % text positioning operators /Td { pdfTextMat transform moveto } def /Tm { /pdfTextMat exch def } def % text string operators /xyshow where { pop /xyshow2 { dup length array 0 2 2 index length 1 sub { 2 index 1 index 2 copy get 3 1 roll 1 add get pdfTextMat dtransform 4 2 roll 2 copy 6 5 roll put 1 add 3 1 roll dup 4 2 roll put } for exch pop xyshow } def }{ /xyshow2 { currentfont /FontType get 0 eq { 0 2 3 index length 1 sub { currentpoint 4 index 3 index 2 getinterval show moveto 2 copy get 2 index 3 2 roll 1 add get pdfTextMat dtransform rmoveto } for } { 0 1 3 index length 1 sub { currentpoint 4 index 3 index 1 getinterval show moveto 2 copy 2 mul get 2 index 3 2 roll 2 mul 1 add get pdfTextMat dtransform rmoveto } for } ifelse pop pop } def } ifelse /cshow where { pop /xycp { 0 3 2 roll { pop pop currentpoint 3 2 roll 1 string dup 0 4 3 roll put false charpath moveto 2 copy get 2 index 2 index 1 add get pdfTextMat dtransform rmoveto 2 add } exch cshow pop pop } def }{ /xycp { currentfont /FontType get 0 eq { 0 2 3 index length 1 sub { currentpoint 4 index 3 index 2 getinterval false charpath moveto 2 copy get 2 index 3 2 roll 1 add get pdfTextMat dtransform rmoveto } for } { 0 1 3 index length 1 sub { currentpoint 4 index 3 index 1 getinterval false charpath moveto 2 copy 2 mul get 2 index 3 2 roll 2 mul 1 add get pdfTextMat dtransform rmoveto } for } ifelse pop pop } def } ifelse /Tj { fCol 0 pdfTextRise pdfTextMat dtransform rmoveto currentpoint 4 2 roll pdfTextRender 1 and 0 eq { 2 copy xyshow2 } if pdfTextRender 3 and dup 1 eq exch 2 eq or { 3 index 3 index moveto 2 copy currentfont /FontType get 3 eq { fCol } { sCol } ifelse xycp currentpoint stroke moveto } if pdfTextRender 4 and 0 ne { 4 2 roll moveto xycp /pdfTextClipPath [ pdfTextClipPath aload pop {/moveto cvx} {/lineto cvx} {/curveto cvx} {/closepath cvx} pathforall ] def currentpoint newpath moveto } { pop pop pop pop } ifelse 0 pdfTextRise neg pdfTextMat dtransform rmoveto } def /TJm { 0.001 mul pdfFontSize mul pdfHorizScaling mul neg 0 pdfTextMat dtransform rmoveto } def /TJmV { 0.001 mul pdfFontSize mul neg 0 exch pdfTextMat dtransform rmoveto } def /Tclip { pdfTextClipPath cvx exec clip newpath /pdfTextClipPath [] def } def /Tclip* { pdfTextClipPath cvx exec eoclip newpath /pdfTextClipPath [] def } def % Level 2/3 image operators /pdfImBuf 100 string def /pdfImStr { 2 copy exch length lt { 2 copy get exch 1 add exch } { () } ifelse } def /skipEOD { { currentfile pdfImBuf readline not { pop exit } if (%-EOD-) eq { exit } if } loop } def /pdfIm { image skipEOD } def /pdfImM { fCol imagemask skipEOD } def /pr { 2 index 2 index 3 2 roll putinterval 4 add } def /pdfImClip { gsave 0 2 4 index length 1 sub { dup 4 index exch 2 copy get 5 index div put 1 add 3 index exch 2 copy get 3 index div put } for pop pop rectclip } def /pdfImClipEnd { grestore } def % shading operators /colordelta { false 0 1 3 index length 1 sub { dup 4 index exch get 3 index 3 2 roll get sub abs 0.004 gt { pop true } if } for exch pop exch pop } def /funcCol { func n array astore } def /funcSH { dup 0 eq { true } { dup 6 eq { false } { 4 index 4 index funcCol dup 6 index 4 index funcCol dup 3 1 roll colordelta 3 1 roll 5 index 5 index funcCol dup 3 1 roll colordelta 3 1 roll 6 index 8 index funcCol dup 3 1 roll colordelta 3 1 roll colordelta or or or } ifelse } ifelse { 1 add 4 index 3 index add 0.5 mul exch 4 index 3 index add 0.5 mul exch 6 index 6 index 4 index 4 index 4 index funcSH 2 index 6 index 6 index 4 index 4 index funcSH 6 index 2 index 4 index 6 index 4 index funcSH 5 3 roll 3 2 roll funcSH pop pop } { pop 3 index 2 index add 0.5 mul 3 index 2 index add 0.5 mul funcCol sc dup 4 index exch mat transform m 3 index 3 index mat transform l 1 index 3 index mat transform l mat transform l pop pop h f* } ifelse } def /axialCol { dup 0 lt { pop t0 } { dup 1 gt { pop t1 } { dt mul t0 add } ifelse } ifelse func n array astore } def /axialSH { dup 0 eq { true } { dup 8 eq { false } { 2 index axialCol 2 index axialCol colordelta } ifelse } ifelse { 1 add 3 1 roll 2 copy add 0.5 mul dup 4 3 roll exch 4 index axialSH exch 3 2 roll axialSH } { pop 2 copy add 0.5 mul axialCol sc exch dup dx mul x0 add exch dy mul y0 add 3 2 roll dup dx mul x0 add exch dy mul y0 add dx abs dy abs ge { 2 copy yMin sub dy mul dx div add yMin m yMax sub dy mul dx div add yMax l 2 copy yMax sub dy mul dx div add yMax l yMin sub dy mul dx div add yMin l h f* } { exch 2 copy xMin sub dx mul dy div add xMin exch m xMax sub dx mul dy div add xMax exch l exch 2 copy xMax sub dx mul dy div add xMax exch l xMin sub dx mul dy div add xMin exch l h f* } ifelse } ifelse } def /radialCol { dup t0 lt { pop t0 } { dup t1 gt { pop t1 } if } ifelse func n array astore } def /radialSH { dup 0 eq { true } { dup 8 eq { false } { 2 index dt mul t0 add radialCol 2 index dt mul t0 add radialCol colordelta } ifelse } ifelse { 1 add 3 1 roll 2 copy add 0.5 mul dup 4 3 roll exch 4 index radialSH exch 3 2 roll radialSH } { pop 2 copy add 0.5 mul dt mul t0 add radialCol sc encl { exch dup dx mul x0 add exch dup dy mul y0 add exch dr mul r0 add 0 360 arc h dup dx mul x0 add exch dup dy mul y0 add exch dr mul r0 add 360 0 arcn h f } { 2 copy dup dx mul x0 add exch dup dy mul y0 add exch dr mul r0 add a1 a2 arcn dup dx mul x0 add exch dup dy mul y0 add exch dr mul r0 add a2 a1 arcn h dup dx mul x0 add exch dup dy mul y0 add exch dr mul r0 add a1 a2 arc dup dx mul x0 add exch dup dy mul y0 add exch dr mul r0 add a2 a1 arc h f } ifelse } ifelse } def end %%EndResource %%EndProlog %%BeginSetup xpdf begin %%BeginResource: font CenturySchL-Roma %!FontType1-1.0: CenturySchL-Roma 12 dict begin /FontInfo 10 dict dup begin /Notice (Copyright \(URW\)++,Copyright 1999 by \(URW\)++ Design & Develo\ pment; Cyrillic glyphs added by Valek Filippov \(C\) 2001-2005) readonly def /FullName (Century Schoolbook L Roman) readonly def /FamilyName (Roman) readonly def /isFixedPitch false def /ItalicAngle 0 def /UnderlinePosition 0 def /UnderlineThickness 0 def end readonly def /FontName /CenturySchL-Roma def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /FontBBox [0 -155 513 722] readonly def /StrokeWidth 0 def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 32 /space put dup 44 /comma put dup 50 /two put dup 51 /three put dup 53 /five put dup 56 /eight put dup 57 /nine put dup 91 /bracketleft put dup 93 /bracketright put readonly def currentdict end currentfile eexec 5AA4F71255501637F1A431BAB555283D093E1B588B45B0281559110D21315C62 BD638C6B34BA54AA75227715D9947EBCD51A104CAEA657499E94138F5645BF68 368BB1B1EC8E4776F067FFF2CE9B89FB7E63A7DB304498C1036D399C47A4CB79 BD517EDB02BEB90195FD7DDAF3E839BCE2DB156D9337DBB2305A465B3E0FFB97 1985C79DC71C47E26F9F0F042B2CDEE97B679358059256FB93D662D43C7ECB5B 1A564DFCECB963478373C69F52172F071E0AA6082A3E10D9E1CE2851CFA210EE 7BD5FCB1AAE15E89D1FB339D587D218B89C18A32F47C7451A80CB1FC07CF5EF6 F88E0E90C57D14F7F444B6A578FCB8A653FA775A1A93B92228992B91CC422826 88B74CE701020A2700976C9A0B00A6FC0A0B144431463260293AA2B7A877AB51 E6155154FA9B73D948446548BA9E81FC465DC2BA50D434ABFBBAFE9FB80F7F1C A366B57486581BBD98316DEE898EEE4097DAF68FF86F971F908D8D89E71CBDD4 445D1AFD4EF865915ABD064C516611E7D620D51377C001597EC9982EADD6AB50 97FB056B5F07D1C97ECD1AF2541AA024A14CE3B048A4F074DD9663FFDEF2A31C 3A9D75D59161150F6A6130BD6A2E6DFEAEB58AFA3AA351C0EA83A7C773BC08B3 A8F336E1954106262F04D76A2079313CFE335966D3E6E2FD66B844889759D68E AE32101FD94F50ED58BB2FAC4D7E783AA121D2431D8DDE854095CD02BD48EF67 64DB83148B3A9BF38E92FED3C94E98D0CC71646DB9EC2DFFBD935859433AA69E 0EE020383B6294BC2D090C91EC5585097525E436864C2C31804F778E9840D161 091B15B606BFC8DAFD67272DA2DFE54A42BCD291E1C7BDDEC0096DD672F50BD0 E3C7E283362ABE99036371D842A7597BEAFE0B358FECCF66269DE9BC495C503A D1205ED2A48B82D81EA529BF7FB34116FAA92603EDFF0A6F777D89E777FE0696 5D7C0BCCC5956F9C314235B68D5A67CB77E3B6401462E279EFD1330DA13C8127 B0DE4898BA8816058590E342F538162866D1E9D669A03958C7B88D130901C547 DA296EFFAACDF03C6B790FBD80E3C929BC699512BBBD595413B4ABBB1184111E 1976236844043136990642575CFFF3169FE870A91B6041D4E5AED30BEAA333EB A7574A578F7250D2B3F522FF85792E79B6CA2FF8ACAE1833BE529AC1A4AC77E2 58B802A8B16A34063181484ECE30043A080FCED012D811D761A575C933D24BB4 F9AC91FE9D0C0EFA2EEF9D6ADBFBF6DDFAC01A6C62D729F30CEE5F6AA87132CA 2A79EBBCC1CD23514346CDD1560F99C40EE2AC0D612513E964E9FEBEFBA14D9B 9954294AEA91AAF29DFCD428FD1E34008002AF0511E2F2044C1A3161F6D1EC5B 0883A2BF7C44C8BC690228D7B807AD016F22316036945DF41FAE9C12209F7C4F 4EDB24F83DFB42C3C4025F06C7659DD9D3D835E8EC2874E983D3F1C24DA87386 AD9A067C2DEC7589D0DE40232DE5BDD170097E59BB76EFBC59973397D2685117 8941BCDC4692280AF8B76F97AABD7380158EA9259331C3E6741C3E25E6E3DDEE BDBA9BA4D26BFDA8C5616AAF03B43A017A162BA6DE7D4FB8D4862ED85383723A D5BF374BA8F300469D717CE4E218A8650A053FFE705BA586DF50E06D08AA5EA5 8158537C1F9901EA36021B680EFB0EF75BE4B01E1A2C8CC3648E3F4D31645D75 437630D59DB4F8C52893185E50AF7C5CC9F955E5275C97C3141DCC20E2323FD2 E36E1E7BBDD6A29AEE85652D335E95CFFD9BACDAEE4CDE282D4F661A3B3D1047 C87706E430E01EA5E2229B3F05A9A5D483C481F341A887CFFB2C6E89B103FAA1 C1182158525A7141EC0F5A3E8D4069C548C1458BE5D249280938064753CA28CC 3BD8F342F809B1354EF054142CD71E23FFAC407FB1B9C856E526A670C93C534E 6F1AE3A137B624A182297AB7B81FE45A254E09835D956063A9D9878E53BBAFE8 959C4E61A2815C1150948C7E2EA69BDC5B5FC947A1B4972B912CFDA09CE0C93A 209CA75526C8AA5373F02D19CEA2338CC6C59F50625242B9C35CBD882A3CEC3A BA8914A4E62E5E75E163E5D050DB493805281C1090ED642698063B71EF8A350A 53CF2247DF886F9AE384EDB094E23EA74900E69155179A0B3BD84BE0196BC2C8 9F298A49B3FF7546589385507870D92B65E81054FE7C5C83EAC878203DD02522 3666E90C458E61463A783E561D56231729EDCAC188C7342AACF7DEF0A0ADFA6E 7CB64081256844A3773D56429F22D9CB43955AD0F07FE9454CDE5CEB0B4CAAC1 D0C477E2B7C2028299126237E030BAE0E6D1059444DFF0A832558F685EF2C77C BE03EC7460A614E9D4D5EA6C425D9B9131C3769012FD66896BC1D0086DF01631 0DA3C56AB53CC840872F3E7ACB91AB01226C19190C24FC145938EDBAEA452046 756F4863340EF0DAF93DF232BB9FF4F6E588D2405F83F8B303C7F76DE2C2265C 3440F18C5B801800DF 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndResource /F10_0 /CenturySchL-Roma 1 1 [ /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef /space/exclam/quotedbl/numbersign/dollar/percent/ampersand/quotesingle /parenleft/parenright/asterisk/plus/comma/hyphen/period/slash /zero/one/two/three/four/five/six/seven /eight/nine/colon/semicolon/less/equal/greater/question /at/A/B/C/D/E/F/G /H/I/J/K/L/M/N/O /P/Q/R/S/T/U/V/W /X/Y/Z/bracketleft/backslash/bracketright/asciicircum/underscore /grave/a/b/c/d/e/f/g /h/i/j/k/l/m/n/o /p/q/r/s/t/u/v/w /x/y/z/braceleft/bar/braceright/asciitilde/bullet /Euro/bullet/quotesinglbase/florin/quotedblbase/ellipsis/dagger/daggerdbl /circumflex/perthousand/Scaron/guilsinglleft/OE/bullet/Zcaron/bullet /bullet/quoteleft/quoteright/quotedblleft/quotedblright/bullet/endash/emdash /tilde/trademark/scaron/guilsinglright/oe/bullet/zcaron/Ydieresis /space/exclamdown/cent/sterling/currency/yen/brokenbar/section /dieresis/copyright/ordfeminine/guillemotleft/logicalnot/hyphen/registered/macron /degree/plusminus/twosuperior/threesuperior/acute/mu/paragraph/periodcentered /cedilla/onesuperior/ordmasculine/guillemotright/onequarter/onehalf/threequarters/questiondown /Agrave/Aacute/Acircumflex/Atilde/Adieresis/Aring/AE/Ccedilla /Egrave/Eacute/Ecircumflex/Edieresis/Igrave/Iacute/Icircumflex/Idieresis /Eth/Ntilde/Ograve/Oacute/Ocircumflex/Otilde/Odieresis/multiply /Oslash/Ugrave/Uacute/Ucircumflex/Udieresis/Yacute/Thorn/germandbls /agrave/aacute/acircumflex/atilde/adieresis/aring/ae/ccedilla /egrave/eacute/ecircumflex/edieresis/igrave/iacute/icircumflex/idieresis /eth/ntilde/ograve/oacute/ocircumflex/otilde/odieresis/divide /oslash/ugrave/uacute/ucircumflex/udieresis/yacute/thorn/ydieresis] pdfMakeFont %%BeginResource: font Emmentaler-20 %!FontType1-1.0: Emmentaler-20 12 dict begin /FontInfo 10 dict dup begin /Notice (This font is distributed under the GNU General Public License. \ As a special exception, if you create a document which uses this\ font, and embed this font or unaltered portions of this font in\ to the document, this font does not by itself cause the resultin\ ) readonly def /FullName (Emmentaler-20) readonly def /FamilyName (Medium) readonly def /isFixedPitch false def /ItalicAngle 0 def /UnderlinePosition 0 def /UnderlineThickness 0 def end readonly def /FontName /Emmentaler-20 def /PaintType 0 def /FontType 1 def /FontMatrix [0.001 0 0 0.001 0 0] readonly def /FontBBox [0 -635 645 1194] readonly def /StrokeWidth 0 def /Encoding 256 array 0 1 255 {1 index exch /.notdef put} for dup 0 /noteheads.s0 put dup 1 /clefs.G put dup 2 /timesig.C44 put readonly def currentdict end currentfile eexec 5AA4F71255501637F1A431BAB555283D093E1B588B45B0281559110D21315C62 BD638C6B34BA54AA75227715D9947EBCD51A104CAEA657499E94138F5645BF68 368BB1B1EC8E4776F067FFF2CE9B89FB7E63A7DB304498C1036D399C47A4CB79 BD517EDB02BEB90195FD7DDAF3E839BCE2DB156D9337DBB2305A465B3E0FFB97 1985C79DC71C47E26F9F0F042B2CDEE97B679358059256FB93D662D43C7ECB5B 1A564DFCECB963478373C69F52172F071E0AA6082A3E10D9E1CE2851CFA210EE 7BD5FCB1AAE15E89D1FB339D587D218B89C18A32F47C7451A80CB1FC07CF5EF7 B7EF5EFBC8E958E4AEC58C2EDB62B8483E59EE70E539F9DA32E3915FBC891B2A 92E54CFC72F16F43AC5850091067BAD3A607B987BB8F66EF34C9D90207192BEB 398F18EF8AA78DFD27E7411B4D24A1F3A61E0661090CAFA69387BB5D6CBEE7CD 779F0E774EC8AF19F7F7228FE16DD53A85F022838EFE59BECDFE9138B5F7CD17 37C5B3B4B82911B24FE83F45C913A793669DEF9875890474CF5DD70F206FF888 C1EF2A880EF7AD5887840BD2D6AF4F1B7F3968A8DBAC988E48EDB28BBCF258B8 23A5F48DCEEE0951A60223E3E7F030E2640BE36C9BD34B6DB509A5729616DD7E A5D43E0C892FEAF1F056183C3FC6DAF2955707676F620B054C22AEF7CA7FF18B 97AF5D2F9C1C0F48E0E33C8D790B8F41E078302F09D14EAD2FFABA75044B5E0F 268EF87F9926B8E20580DAF712F2B37DF1F77845476FE9EDE4EDB136A3322047 006BC4B106BD2167E7337D37AE2946BC6E85E45D8F7E421152D4E53FE9D75ECD 0AD43EF2702002BE274BF89DAA8C3BA8E8B9F4D70679D252A889FA46BB33F0E8 48518B7CC196D833CC3E0EA0D35C7971A1F61870E451D337C056AB6D0F8A5206 8FF1F4C308292EF9E24C99E821ADBC8C6E4C24EF55ED64B3D3E4F9E7EEC49D7E D027A554AA0FCD511655F44F0B63CA253FE305D4B39479832DC5235D93A41C84 C3D09CE35071C183A9B5EF656A7587609656172D580C9A5A2A8DB0F59607FC9E 34A7ADE613CB3DBD0DFB479E33F3F4AC94E0154CD34C51E7D7620637A3F5D2C1 831AE21BA42E9151F472A368744994F66376B2865CF70A876E1790A560F5B9E0 BD81BEFCD99B033908816FA5EBEA9CA985225B05E1E6F71E83DAF6A866FB8CB5 2403335C500FA872904E06262394A518EAD1785282FA1EDBEA9234D6C87947AF AD54A21A00C6A3A7143E77982EA2605E77CBAAE8B952B991A2334ED10DAF13F4 B0527E8D7A6B4D9BC0C0A1D2C770115CDDEAE5B3A125F95B8389A6E9B492C98B 564256E1EAE0B4D69AB1DA27604ADE857C7097E39778D20775EEB9971A8ECDBF E808AAA5BB701AAADC1716552CE01F52AB85A342C567D4D7DE437BB1CA0947F7 C42F40144E568E6D5085EC285690A555670DDCC7BBD8674DAE77E81A9DE6400B 2E7E3C0F8096F7E68EBE87A074EC9E50C6707FBA6A644863734E178BF3F2C577 7B185E38A997210CF0E1900DCA5B0575C3239C2795D8C6DEEC343203DCA1DBDE C0C95604DB4B43C9E2E8D5A34D8417B39E08910D584A37CD1891EAAF2216ACCE 92C39085FCC7D26342F8941E4E298BD09E08E1E520584F11353DDC02E388A9AB 2B4D18883EE9478837FE87B22F17578F3BB2F57A7543607E049EB8142BE3B771 6FB69940931CA989D2D5E7272F5340C867408AAB42DE2F851B247E1972C51DC4 A1DCCC1D20248342CF94D1689AFC9E7351D7E71BA91F32C091CD3C20F0103C9A FF6CB747DF587C4CB03219443F168EF4DE4733342B288921A823034FB487831A 848693EFDFABAAEB9474519223FA00FC372309679C0B6F14EF6F5983B2A2C9 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000000000 cleartomark %%EndResource /F8_0 /Emmentaler-20 1 1 [ /noteheads.s0/clefs.G/timesig.C44/.notdef/.notdef/.notdef/.notdef/.notdef /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef /space/exclam/quotedbl/numbersign/dollar/percent/ampersand/quotesingle /parenleft/parenright/asterisk/plus/comma/hyphen/period/slash /zero/one/two/three/four/five/six/seven /eight/nine/colon/semicolon/less/equal/greater/question /at/A/B/C/D/E/F/G /H/I/J/K/L/M/N/O /P/Q/R/S/T/U/V/W /X/Y/Z/bracketleft/backslash/bracketright/asciicircum/underscore /grave/a/b/c/d/e/f/g /h/i/j/k/l/m/n/o /p/q/r/s/t/u/v/w /x/y/z/braceleft/bar/braceright/asciitilde/bullet /Euro/bullet/quotesinglbase/florin/quotedblbase/ellipsis/dagger/daggerdbl /circumflex/perthousand/Scaron/guilsinglleft/OE/bullet/Zcaron/bullet /bullet/quoteleft/quoteright/quotedblleft/quotedblright/bullet/endash/emdash /tilde/trademark/scaron/guilsinglright/oe/bullet/zcaron/Ydieresis /space/exclamdown/cent/sterling/currency/yen/brokenbar/section /dieresis/copyright/ordfeminine/guillemotleft/logicalnot/hyphen/registered/macron /degree/plusminus/twosuperior/threesuperior/acute/mu/paragraph/periodcentered /cedilla/onesuperior/ordmasculine/guillemotright/onequarter/onehalf/threequarters/questiondown /Agrave/Aacute/Acircumflex/Atilde/Adieresis/Aring/AE/Ccedilla /Egrave/Eacute/Ecircumflex/Edieresis/Igrave/Iacute/Icircumflex/Idieresis /Eth/Ntilde/Ograve/Oacute/Ocircumflex/Otilde/Odieresis/multiply /Oslash/Ugrave/Uacute/Ucircumflex/Udieresis/Yacute/Thorn/germandbls /agrave/aacute/acircumflex/atilde/adieresis/aring/ae/ccedilla /egrave/eacute/ecircumflex/edieresis/igrave/iacute/icircumflex/idieresis /eth/ntilde/ograve/oacute/ocircumflex/otilde/odieresis/divide /oslash/ugrave/uacute/ucircumflex/udieresis/yacute/thorn/ydieresis] pdfMakeFont %%EndSetup pdfStartPage %%EndPageSetup [] 0 d 1 i 0 j 0 J 10 M 1 w /DeviceGray {} cs [0] sc /DeviceGray {} CS [0] SC false op false OP {} settransfer 0 0 77 50 re W q q [0.1 0 0 0.1 0 0] cm 4.98132 w 1 J /DeviceGray {} CS [0] SC 2.49219 202.277 m 759.129 202.277 l S 2.49219 252.094 m 759.129 252.094 l S 2.49219 301.906 m 759.129 301.906 l S 2.49219 351.719 m 759.129 351.719 l S 2.49219 401.531 m 759.129 401.531 l S 9.46451 w 0 J 756.887 202.277 m 756.887 401.531 l S /DeviceGray {} cs [0] sc q [10 0 0 10 0 0] cm [1 0 0 1 0 0] Tm 0 0 Td [1 0 0 1 43.3375 35.1719] Tm 0 0 Td /F8_0 19.9253 Tf (\000) [9.863023 0] Tj 0 -17.4348 Td (\000) [9.863023 0] Tj -39.3523 -9.96253 Td (\001) [12.772117 0] Tj -18.4308 -4.98128 Td (\002) [8.448327 0] Tj -22.96127 -32.37858 Td /F10_0 12.3019 Tf ([) [4.096533 0] Tj 1.21109 TJm (2) [6.839856 0] Tj 2.98678 TJm (9) [6.839856 0] Tj 3.01854 TJm (3) [6.839856 0] Tj 2.98678 TJm (,) [3.419928 0] Tj 1.49339 TJm ( ) [3.419928 0] Tj 1.46164 TJm (5) [6.839856 0] Tj 3.01854 TJm (8) [6.839856 0] Tj 2.98678 TJm (8) [6.839856 0] Tj 2.98678 TJm (]) [4.096533 0] Tj Q Q Q showpage %%PageTrailer pdfEndPage %%Trailer end %%DocumentSuppliedResources: %%+ font CenturySchL-Roma %%+ font Emmentaler-20 %%EOF interval-2.1.0/doc/image/cameleon-start-end.svg.pdf0000644000175000017500000002112013031037005021506 0ustar oliveroliver%PDF-1.5 % 3 0 obj << /Length 4 0 R /Filter /FlateDecode >> stream x}QNQ ߯inĄ(rw#I-35FV}==G$9x/PV1Z a*;U-d`,<  % }rayP.' pS0HXMsz]VleK {ː\T䵪F>wܴnNj> /s6 6 0 R /s8 8 0 R >> /XObject << /x7 7 0 R /x9 9 0 R >> /Font << /f-0-0 5 0 R >> >> endobj 10 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 266.399994 147.269531 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources 2 0 R >> endobj 11 0 obj << /Type /XObject /Length 47 /Filter /FlateDecode /Subtype /Form /BBox [ 0 17.269531 144 147.269531 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.Cs=#3KScCCCclB endstream endobj 7 0 obj << /Type /XObject /Length 47 /Filter /FlateDecode /Subtype /Form /BBox [ 0 17.269531 144 147.269531 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x12 12 0 R >> >> >> stream x+2T0Bkgnl`bf˥h^_ah endstream endobj 13 0 obj << /Type /Mask /S /Alpha /G 11 0 R >> endobj 6 0 obj << /Type /ExtGState /SMask 13 0 R /ca 1 /CA 1 /AIS false >> endobj 14 0 obj << /Type /XObject /Length 49 /Filter /FlateDecode /Subtype /Form /BBox [ 122 17.269531 267 147.269531 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.C##Cs=#3KScCCSCc|Bɂ ( endstream endobj 9 0 obj << /Type /XObject /Length 47 /Filter /FlateDecode /Subtype /Form /BBox [ 122 17.269531 267 147.269531 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x15 15 0 R >> >> >> stream x+2T0Bkgnl`bf˥h^_ah endstream endobj 16 0 obj << /Type /Mask /S /Alpha /G 14 0 R >> endobj 8 0 obj << /Type /ExtGState /SMask 16 0 R /ca 1 /CA 1 /AIS false >> endobj 12 0 obj << /Length 18 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 18 144 148 ] /Resources 17 0 R >> stream xe10 {B/pNg4"g +xNL.Hz0-xYۛ${,jJN=t*n 'Ai5rYe4G0^NBPP8m4z~ō3@ endstream endobj 18 0 obj 126 endobj 17 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 15 0 obj << /Length 20 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 122 18 267 148 ] /Resources 19 0 R >> stream xu 0 {M dLcd7q H?QpH>|ʲr@֡7xl@$Hp B= ϦLY6BFՐsRUEf#Q:l|Doc^n b37 endstream endobj 20 0 obj 130 endobj 19 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 21 0 obj << /Length 22 0 R /Filter /FlateDecode /Length1 4696 >> stream xX{pSםzY?mI,)B%K-b7m6v0@ ö I)%ni6͐%tIJ&dgvI+Aٿ^s9W|`NͼSPjчw[(Z§~uf4: @~m* ay֛l cCfΌǧw%w-X_zrj(k8_ !:̮-3}rXJJ-8*bh욒(vwUkպ$ y-:˞m u [#2R[Ji$݉@YUIdv2Ԡ"ɤ8~J]kևIѠ7ꚈX6_)z7]Nަ"56lp=+m.^7~sS?E8o~"='Vvs2s7~ynU3KSs2i֡/첏{25k61dH͍tA(@A7-ڤ 2F&s ;q1a=YA52f*ea!,ͩ&stTD>{&CTL %^\6u^!m.ߪU=6PaZWdz[N&cSn3vUZU95hOWOްr0@HlWƃ~ |> LM~3Rnsj+Iɰ#pMsg3IaLDUZA8TII& P:)ڕzC8JD!C`*p,0kVQNuDu=ۧO3{mbD3?,I63[vʛGg;ɕ a\рhYS&=g]z` t̀j s Yw)ID-)Ծso̟y0:i C>p}{o-6|xyۑW*9L~&U#LTVlIH!UJښb|FYK- O!QDYI!אjꮭVS8 c1S6 ] :hS=aku{I5oMW(uho mY}>Ve?*,~0!ZSY{utֽŹ`YPhYP 5)rVsNJZ' >+QHk_cqu4gO%<sI֞41,y@'t jQ(%/"וي`DTֻ(X1ʿ|⩾֬oUߞo|NI=3?#Hl#6+D=y!m,!X .Wy]lsLA122YZL6^H9FX՟UWS99iǧ17A̘ MTGGnb k/\zv|mٺ/pwNpY (1w⹯w0$t54F}&Ra)HK*g%Y,fwL,"_+b#ȱn S@)OVoFf@P+ST'(}}G_l%dC-OE}kMޚ[xs_>rNO,L4&n׍t9/ob={ Z#0Lbu{|;6 ^<'#^URr)"R4R dV`9R\$K.^46H]$\)$y<07;NֶtL[6t>Qɼ,{g3dn?q"ڴHw'VAm®W1Fh[LWrݡjٍ%c rowNp.| sBj[ہOlztC+ _=xeh'=JKR!(ȥF0]<_0 "9S]3QuJ߂䋺eZ/s:+lj" 4S@6)k%]ZFsם@0a5 6݀[= 2ƞsC w^8*J!ʯd{lCpdTG$_;q  F[ Ձ٠Aal )2GϨw-NKeն,4$ؿ/н>.]~亸:<>Ȉ6_WWR!G*(7IJ}Y^$v>aϐ_x2<3p '1aa:> A/C*aO{NVʼH,DSQQQTV%*9Liqq8MWUx^"\ "i< Oq8h! 1 KqXhP:F*P*rs,CU%m9Ƕv{=]spBb yUo5/CUy= HhGjOeh S豮+ZֻGaђki[K8ߞ'YG,/G>:SyFu-c-:N ǼKccVQۊZ&2єEĝi.{6ZIfX> |l"C񱌲뱴v%*|% .iYJ"E"aѮLtW6pWS\z"}Wt<7?x|~)fArN}l+4|vT%o`v,] ɀN ~ yv'$]gM(\fO ߷?py5;%^W$"u9&6pD:F? =#޽%.ڦX!U3AUdR9(ȮAwL7.w0<|@ endstream endobj 22 0 obj 3283 endobj 23 0 obj << /Length 24 0 R /Filter /FlateDecode >> stream x]Qn0 !𣎂"]<G\,/%);Tq;V({\:o".5j ΋zSOCmYq꼝RP|PrY'3_A@ FG}{~pBB) Z{0!Y ݺIW:+%=\ 1~Dʲem+ЛȒCHeI Աɜ@(YeN@5̜K6ճ1yO#s$2'8o>MW=euCMNsߧH̏w<9! k endstream endobj 24 0 obj 306 endobj 25 0 obj << /Type /FontDescriptor /FontName /WNAXVC+Cmr10 /FontFamily (cmr10) /Flags 32 /FontBBox [ -43 -250 1008 750 ] /ItalicAngle 0 /Ascent 705 /Descent -215 /CapHeight 750 /StemV 80 /StemH 80 /FontFile2 21 0 R >> endobj 5 0 obj << /Type /Font /Subtype /TrueType /BaseFont /WNAXVC+Cmr10 /FirstChar 32 /LastChar 116 /FontDescriptor 25 0 R /Encoding /WinAnsiEncoding /Widths [ 333 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 680 0 0 0 0 0 0 0 0 0 776 680 0 0 555 0 0 0 0 0 0 0 0 0 0 0 0 0 500 555 443 555 443 0 0 0 276 0 0 276 0 555 500 0 0 391 394 388 ] /ToUnicode 23 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 10 0 R ] /Count 1 >> endobj 26 0 obj << /Creator (cairo 1.14.0 (http://cairographics.org)) /Producer (cairo 1.14.0 (http://cairographics.org)) >> endobj 27 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 28 0000000000 65535 f 0000007891 00000 n 0000000406 00000 n 0000000015 00000 n 0000000384 00000 n 0000007478 00000 n 0000001635 00000 n 0000001182 00000 n 0000002549 00000 n 0000002094 00000 n 0000000585 00000 n 0000000814 00000 n 0000002636 00000 n 0000001575 00000 n 0000001722 00000 n 0000003020 00000 n 0000002489 00000 n 0000002947 00000 n 0000002924 00000 n 0000003337 00000 n 0000003314 00000 n 0000003410 00000 n 0000006789 00000 n 0000006813 00000 n 0000007198 00000 n 0000007221 00000 n 0000007957 00000 n 0000008085 00000 n trailer << /Size 28 /Root 27 0 R /Info 26 0 R >> startxref 8138 %%EOF interval-2.1.0/doc/image/cameleon-transition.svg.pdf0000644000175000017500000010541313031037006022010 0ustar oliveroliver%PDF-1.5 % 3 0 obj << /Length 4 0 R /Filter /FlateDecode >> stream x}j1}@39'w2^(.lBZ( Fֻ*'s9榩_DNm+}91ᒈU38_vT1/48$[qmK+?x& kYujS|, (߆t/,Ho z| P0䆂!7 ` CnT76 ge endstream endobj 4 0 obj 193 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> /s5 5 0 R /s7 7 0 R /s9 9 0 R /s11 11 0 R /s13 13 0 R /s15 15 0 R /s17 17 0 R /s19 19 0 R /s21 21 0 R /s23 23 0 R /s25 25 0 R /s27 27 0 R /s29 29 0 R >> /XObject << /x6 6 0 R /x8 8 0 R /x10 10 0 R /x12 12 0 R /x14 14 0 R /x16 16 0 R /x18 18 0 R /x20 20 0 R /x22 22 0 R /x24 24 0 R /x26 26 0 R /x28 28 0 R /x30 30 0 R >> >> endobj 31 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 423.458008 321.940643 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources 2 0 R >> endobj 32 0 obj << /Type /XObject /Length 49 /Filter /FlateDecode /Subtype /Form /BBox [ 66 127.940643 211 257.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.33C#s=K3cCSCc|Ba 1 endstream endobj 6 0 obj << /Type /XObject /Length 48 /Filter /FlateDecode /Subtype /Form /BBox [ 66 127.940643 211 257.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x33 33 0 R >> >> >> stream x+2T0Bkg`jiljf˥h^_alA % endstream endobj 34 0 obj << /Type /Mask /S /Alpha /G 32 0 R >> endobj 5 0 obj << /Type /ExtGState /SMask 34 0 R /ca 1 /CA 1 /AIS false >> endobj 35 0 obj << /Type /XObject /Length 49 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.]=SKcS3s#c##T4. endstream endobj 8 0 obj << /Type /XObject /Length 48 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x36 36 0 R >> >> >> stream x+2T0Bkg`jiljf˥h^_alV ( endstream endobj 37 0 obj << /Type /Mask /S /Alpha /G 35 0 R >> endobj 7 0 obj << /Type /ExtGState /SMask 37 0 R /ca 1 /CA 1 /AIS false >> endobj 38 0 obj << /Type /XObject /Length 49 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.]=SKcS3s#c##T4. endstream endobj 10 0 obj << /Type /XObject /Length 48 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x39 39 0 R >> >> >> stream x+2T0Bkg`jiljf˥h^_alk + endstream endobj 40 0 obj << /Type /Mask /S /Alpha /G 38 0 R >> endobj 9 0 obj << /Type /ExtGState /SMask 40 0 R /ca 1 /CA 1 /AIS false >> endobj 41 0 obj << /Type /XObject /Length 49 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.]=SKcS3s#c##T4. endstream endobj 12 0 obj << /Type /XObject /Length 48 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x42 42 0 R >> >> >> stream x+2T0Bkg`jiljf˥h^_abB % endstream endobj 43 0 obj << /Type /Mask /S /Alpha /G 41 0 R >> endobj 11 0 obj << /Type /ExtGState /SMask 43 0 R /ca 1 /CA 1 /AIS false >> endobj 44 0 obj << /Type /XObject /Length 49 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.]=SKcS3s#c##T4. endstream endobj 14 0 obj << /Type /XObject /Length 48 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x45 45 0 R >> >> >> stream x+2T0Bkg`jiljf˥h^_abW ( endstream endobj 46 0 obj << /Type /Mask /S /Alpha /G 44 0 R >> endobj 13 0 obj << /Type /ExtGState /SMask 46 0 R /ca 1 /CA 1 /AIS false >> endobj 47 0 obj << /Type /XObject /Length 49 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.]=SKcS3s#c##T4. endstream endobj 16 0 obj << /Type /XObject /Length 48 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x48 48 0 R >> >> >> stream x+2T0Bkg`jiljf˥h^_abl + endstream endobj 49 0 obj << /Type /Mask /S /Alpha /G 47 0 R >> endobj 15 0 obj << /Type /ExtGState /SMask 49 0 R /ca 1 /CA 1 /AIS false >> endobj 50 0 obj << /Type /XObject /Length 49 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.]=SKcS3s#c##T4. endstream endobj 18 0 obj << /Type /XObject /Length 48 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x51 51 0 R >> >> >> stream x+2T0Bkg`jiljf˥h^_ajC % endstream endobj 52 0 obj << /Type /Mask /S /Alpha /G 50 0 R >> endobj 17 0 obj << /Type /ExtGState /SMask 52 0 R /ca 1 /CA 1 /AIS false >> endobj 53 0 obj << /Type /XObject /Length 49 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.]=SKcS3s#c##T4. endstream endobj 20 0 obj << /Type /XObject /Length 48 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x54 54 0 R >> >> >> stream x+2T0Bkg`jiljf˥h^_ajX ( endstream endobj 55 0 obj << /Type /Mask /S /Alpha /G 53 0 R >> endobj 19 0 obj << /Type /ExtGState /SMask 55 0 R /ca 1 /CA 1 /AIS false >> endobj 56 0 obj << /Type /XObject /Length 49 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.]=SKcS3s#c##T4. endstream endobj 22 0 obj << /Type /XObject /Length 48 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x57 57 0 R >> >> >> stream x+2T0Bkg`jiljf˥h^_ajm + endstream endobj 58 0 obj << /Type /Mask /S /Alpha /G 56 0 R >> endobj 21 0 obj << /Type /ExtGState /SMask 58 0 R /ca 1 /CA 1 /AIS false >> endobj 59 0 obj << /Type /XObject /Length 49 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.]=SKcS3s#c##T4. endstream endobj 24 0 obj << /Type /XObject /Length 48 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x60 60 0 R >> >> >> stream x+2T0Bkg`jiljf˥h^_afD % endstream endobj 61 0 obj << /Type /Mask /S /Alpha /G 59 0 R >> endobj 23 0 obj << /Type /ExtGState /SMask 61 0 R /ca 1 /CA 1 /AIS false >> endobj 62 0 obj << /Type /XObject /Length 49 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.]=SKcS3s#c##T4. endstream endobj 26 0 obj << /Type /XObject /Length 48 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x63 63 0 R >> >> >> stream x+2T0Bkg`jiljf˥h^_afY ( endstream endobj 64 0 obj << /Type /Mask /S /Alpha /G 62 0 R >> endobj 25 0 obj << /Type /ExtGState /SMask 64 0 R /ca 1 /CA 1 /AIS false >> endobj 65 0 obj << /Type /XObject /Length 49 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.]=SKcS3s#c##T4. endstream endobj 28 0 obj << /Type /XObject /Length 48 /Filter /FlateDecode /Subtype /Form /BBox [ 0 -0.0593567 424 321.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x66 66 0 R >> >> >> stream x+2T0Bkg`jiljf˥h^_afn + endstream endobj 67 0 obj << /Type /Mask /S /Alpha /G 65 0 R >> endobj 27 0 obj << /Type /ExtGState /SMask 67 0 R /ca 1 /CA 1 /AIS false >> endobj 68 0 obj << /Type /XObject /Length 50 /Filter /FlateDecode /Subtype /Form /BBox [ 188 127.940643 333 257.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 0.6 /ca 0.6 >> >> >> >> stream x3P0¢tDb.C C#s=K3cCSCcT4. f endstream endobj 30 0 obj << /Type /XObject /Length 48 /Filter /FlateDecode /Subtype /Form /BBox [ 188 127.940643 333 257.940643 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x69 69 0 R >> >> >> stream x+2T0Bkg`jiljf˥h^_af . endstream endobj 70 0 obj << /Type /Mask /S /Alpha /G 68 0 R >> endobj 29 0 obj << /Type /ExtGState /SMask 70 0 R /ca 1 /CA 1 /AIS false >> endobj 33 0 obj << /Length 72 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 66 128 211 258 ] /Resources 71 0 R >> stream xmA 1 }N$Mb\2@݅STm$Y8Š7H:zL' ԲTMVPu>w -O $+KkѠ2A'uXp/m`> endstream endobj 72 0 obj 139 endobj 71 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 36 0 obj << /Length 74 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 424 322 ] /Resources 73 0 R >> stream x+*T/67UH/VЯ07SpW O endstream endobj 74 0 obj 32 endobj 73 0 obj << /ExtGState << /s75 75 0 R >> /XObject << /x76 76 0 R >> >> endobj 39 0 obj << /Length 78 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 424 322 ] /Resources 77 0 R >> stream x+*T/6TH/VЯ0PpW O endstream endobj 78 0 obj 32 endobj 77 0 obj << /ExtGState << /s79 79 0 R >> /XObject << /x80 80 0 R >> >> endobj 42 0 obj << /Length 82 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 424 322 ] /Resources 81 0 R >> stream x+*T/0VH/VЯ0QpW N endstream endobj 82 0 obj 32 endobj 81 0 obj << /ExtGState << /s83 83 0 R >> /XObject << /x84 84 0 R >> >> endobj 45 0 obj << /Length 86 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 424 322 ] /Resources 85 0 R >> stream x+*T/0WH/VЯPpW OS endstream endobj 86 0 obj 32 endobj 85 0 obj << /ExtGState << /s87 87 0 R >> /XObject << /x88 88 0 R >> >> endobj 48 0 obj << /Length 90 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 424 322 ] /Resources 89 0 R >> stream x+*T/4TH/VЯ4RpW N endstream endobj 90 0 obj 32 endobj 89 0 obj << /ExtGState << /s91 91 0 R >> /XObject << /x92 92 0 R >> >> endobj 51 0 obj << /Length 94 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 424 322 ] /Resources 93 0 R >> stream x+*T/4UH/VЯ4SpW O; endstream endobj 94 0 obj 32 endobj 93 0 obj << /ExtGState << /s95 95 0 R >> /XObject << /x96 96 0 R >> >> endobj 54 0 obj << /Length 98 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 424 322 ] /Resources 97 0 R >> stream x+*T/TH/VЯ040PpW T endstream endobj 98 0 obj 33 endobj 97 0 obj << /ExtGState << /s99 99 0 R >> /XObject << /x100 100 0 R >> >> endobj 57 0 obj << /Length 102 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 424 322 ] /Resources 101 0 R >> stream x+*T/640VH/VЯ040QpW Y|B endstream endobj 102 0 obj 34 endobj 101 0 obj << /ExtGState << /s103 103 0 R >> /XObject << /x104 104 0 R >> >> endobj 60 0 obj << /Length 106 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 424 322 ] /Resources 105 0 R >> stream x+*T/640WH/VЯ04PpW YJ endstream endobj 106 0 obj 34 endobj 105 0 obj << /ExtGState << /s107 107 0 R >> /XObject << /x108 108 0 R >> >> endobj 63 0 obj << /Length 110 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 424 322 ] /Resources 109 0 R >> stream x+*T/644TH/VЯ044RpW Yc@ endstream endobj 110 0 obj 34 endobj 109 0 obj << /ExtGState << /s111 111 0 R >> /XObject << /x112 112 0 R >> >> endobj 66 0 obj << /Length 114 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 424 322 ] /Resources 113 0 R >> stream x+*T/644UH/VЯ044SpW YH endstream endobj 114 0 obj 34 endobj 113 0 obj << /ExtGState << /s115 115 0 R >> /XObject << /x116 116 0 R >> >> endobj 69 0 obj << /Length 118 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 188 128 333 258 ] /Resources 117 0 R >> stream xmA1}O |nBby ?#e.ЊZּiy%gqNH[(5&)_IGE.-s+2QFGv%jqc"p֏$Rővَ]6y5A? endstream endobj 118 0 obj 143 endobj 117 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 119 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 91 128 236 258 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x120 120 0 R >> >> >> stream x+O4PH/VЯ042Pp 5& endstream endobj 76 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 91 128 236 258 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x120 120 0 R >> >> >> stream x+O4PH/VЯ042Pp 5& endstream endobj 121 0 obj << /Type /Mask /S /Alpha /G 119 0 R >> endobj 75 0 obj << /Type /ExtGState /SMask 121 0 R /ca 1 /CA 1 /AIS false >> endobj 122 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 42 128 213 322 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x123 123 0 R >> >> >> stream x+O4PH/VЯ042Vp 5; endstream endobj 80 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 42 128 213 322 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x123 123 0 R >> >> >> stream x+O4PH/VЯ042Vp 5; endstream endobj 124 0 obj << /Type /Mask /S /Alpha /G 122 0 R >> endobj 79 0 obj << /Type /ExtGState /SMask 124 0 R /ca 1 /CA 1 /AIS false >> endobj 125 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 1 128 174 304 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x126 126 0 R >> >> >> stream x+O4PH/VЯ042Sp 5P endstream endobj 84 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 1 128 174 304 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x126 126 0 R >> >> >> stream x+O4PH/VЯ042Sp 5P endstream endobj 127 0 obj << /Type /Mask /S /Alpha /G 125 0 R >> endobj 83 0 obj << /Type /ExtGState /SMask 127 0 R /ca 1 /CA 1 /AIS false >> endobj 128 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 0 89 174 226 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x129 129 0 R >> >> >> stream x+O4PH/VЯ04Tp 5e endstream endobj 88 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 0 89 174 226 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x129 129 0 R >> >> >> stream x+O4PH/VЯ04Tp 5e endstream endobj 130 0 obj << /Type /Mask /S /Alpha /G 128 0 R >> endobj 87 0 obj << /Type /ExtGState /SMask 130 0 R /ca 1 /CA 1 /AIS false >> endobj 131 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 48 11 238 188 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x132 132 0 R >> >> >> stream x+O4PH/VЯ046Rp 5< endstream endobj 92 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 48 11 238 188 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x132 132 0 R >> >> >> stream x+O4PH/VЯ046Rp 5< endstream endobj 133 0 obj << /Type /Mask /S /Alpha /G 131 0 R >> endobj 91 0 obj << /Type /ExtGState /SMask 133 0 R /ca 1 /CA 1 /AIS false >> endobj 134 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 147 0 329 175 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x135 135 0 R >> >> >> stream x+O4PH/VЯ046Up 5Q endstream endobj 96 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 147 0 329 175 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x135 135 0 R >> >> >> stream x+O4PH/VЯ046Up 5Q endstream endobj 136 0 obj << /Type /Mask /S /Alpha /G 134 0 R >> endobj 95 0 obj << /Type /ExtGState /SMask 136 0 R /ca 1 /CA 1 /AIS false >> endobj 137 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 242 0 424 175 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x138 138 0 R >> >> >> stream x+O4PH/VЯ04Pp 5f endstream endobj 100 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 242 0 424 175 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x138 138 0 R >> >> >> stream x+O4PH/VЯ04Pp 5f endstream endobj 139 0 obj << /Type /Mask /S /Alpha /G 137 0 R >> endobj 99 0 obj << /Type /ExtGState /SMask 139 0 R /ca 1 /CA 1 /AIS false >> endobj 140 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 227 100 392 267 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x141 141 0 R >> >> >> stream x+O4PH/VЯ041Tp 5= endstream endobj 104 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 227 100 392 267 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x141 141 0 R >> >> >> stream x+O4PH/VЯ041Tp 5= endstream endobj 142 0 obj << /Type /Mask /S /Alpha /G 140 0 R >> endobj 103 0 obj << /Type /ExtGState /SMask 142 0 R /ca 1 /CA 1 /AIS false >> endobj 143 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 155 72 344 249 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x144 144 0 R >> >> >> stream x+O4PH/VЯ041Qp 5R endstream endobj 108 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 155 72 344 249 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x144 144 0 R >> >> >> stream x+O4PH/VЯ041Qp 5R endstream endobj 145 0 obj << /Type /Mask /S /Alpha /G 143 0 R >> endobj 107 0 obj << /Type /ExtGState /SMask 145 0 R /ca 1 /CA 1 /AIS false >> endobj 146 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 157 128 288 274 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x147 147 0 R >> >> >> stream x+O4PH/VЯ041Wp 5g endstream endobj 112 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 157 128 288 274 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x147 147 0 R >> >> >> stream x+O4PH/VЯ041Wp 5g endstream endobj 148 0 obj << /Type /Mask /S /Alpha /G 146 0 R >> endobj 111 0 obj << /Type /ExtGState /SMask 148 0 R /ca 1 /CA 1 /AIS false >> endobj 149 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 193 128 355 285 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x150 150 0 R >> >> >> stream x+O4PH/VЯ045Pp 5> endstream endobj 116 0 obj << /Type /XObject /Length 29 /Filter /FlateDecode /Subtype /Form /BBox [ 193 128 355 285 ] /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /XObject << /x150 150 0 R >> >> >> stream x+O4PH/VЯ045Pp 5> endstream endobj 151 0 obj << /Type /Mask /S /Alpha /G 149 0 R >> endobj 115 0 obj << /Type /ExtGState /SMask 151 0 R /ca 1 /CA 1 /AIS false >> endobj 120 0 obj << /Length 153 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 91 128 236 258 ] /Resources 152 0 R >> stream xmA @ }NOb&nPBaAMMqxFG/_T#R/Ee3@}4 k퀫ID_ L3%Z1t@6Q@̕'t> endstream endobj 153 0 obj 138 endobj 152 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 123 0 obj << /Length 155 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 42 128 213 322 ] /Resources 154 0 R >> stream xeq0DsUAkX$@e'>wg:c,ܡYf \0uDb&TK eSf!Av+'B74b”V!hаm X97fpCaz;&& i߶+.ĂՄ2b]Qu5_[= endstream endobj 155 0 obj 182 endobj 154 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 126 0 obj << /Length 157 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 1 128 174 304 ] /Resources 156 0 R >> stream xeQ@ B 08 *x]-0*t\ٹv+1=~J: 5$ GB4I /hed$uA'쐺 6^%Wqy_0: '8f[8R䞰Aul> >> >> endobj 129 0 obj << /Length 159 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 89 174 226 ] /Resources 158 0 R >> stream xeqC1 sV @*Al?#)T=bq].vbF߃>L%hURI '8iL+-a30<9olER= 96 OkCֱå.̸"AbR 8E|>i8mȒ5,~纭': endstream endobj 159 0 obj 177 endobj 158 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 132 0 obj << /Length 161 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 48 11 238 188 ] /Resources 160 0 R >> stream xeq1 }F1Prg'_%2el`Q}h}ɸ~"UdM]q#A N@4C"hYmNf3sk;#3={4Z(SEBn26nLXԬ_G?E!rVPKs}m;V endstream endobj 161 0 obj 178 endobj 160 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 135 0 obj << /Length 163 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 147 0 329 175 ] /Resources 162 0 R >> stream xeQ1 sWYOeP% @Dj1&C%rc21>’f*.'$ʹ5LsҸvǔ^Zj`?s X(68Jf%ʩ%e )yF+ھHDYM?;}w[~}:^79 endstream endobj 163 0 obj 175 endobj 162 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 138 0 obj << /Length 165 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 242 0 424 175 ] /Resources 164 0 R >> stream xeq@ ÕXv3d)R{1̃w#%sͶFoWrIlM*A6}CI6|'i*DnbRpT6]z$8I`@ B=i4FuROC+e&\Qcϼ\ >xI.> >> >> endobj 141 0 obj << /Length 167 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 227 100 392 267 ] /Resources 166 0 R >> stream xmqC1 DsV ָ DR cgpw1$<9&6,{׍^j+#2W 7^4_Q$VЈC;H:dDI*\%Ql;ѳ!0>`#QLإ" ľtYSLDhzJkt(&\Na}}> endstream endobj 167 0 obj 188 endobj 166 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 144 0 obj << /Length 169 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 155 72 344 249 ] /Resources 168 0 R >> stream xmq1 {M h|H##SEIc*:̶LM_Q._ݧ endstream endobj 169 0 obj 187 endobj 168 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 147 0 obj << /Length 171 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 157 128 288 274 ] /Resources 170 0 R >> stream xmQ0 sW T% l4;g1HiC_zzz|/INdeЕĀ ok822M ? kK~{ (Cۙ|Γެd.l$K)2G՚}nK׽ZG}BoL]=9>U endstream endobj 171 0 obj 178 endobj 170 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 150 0 obj << /Length 173 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 193 128 355 285 ] /Resources 172 0 R >> stream xm1rC1D{X@1r7v s_ӼyKAޮZޒE}݄4X Efݛt#K;CtjmuX`kuJtEqH{+i7_NHk,,gg*r% !5@5QB[ ^1+8ff49?F?? endstream endobj 173 0 obj 189 endobj 172 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 1 0 obj << /Type /Pages /Kids [ 31 0 R ] /Count 1 >> endobj 174 0 obj << /Creator (cairo 1.14.0 (http://cairographics.org)) /Producer (cairo 1.14.0 (http://cairographics.org)) >> endobj 175 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 176 0000000000 65535 f 0000031735 00000 n 0000000307 00000 n 0000000015 00000 n 0000000285 00000 n 0000001834 00000 n 0000001378 00000 n 0000002747 00000 n 0000002292 00000 n 0000003661 00000 n 0000003205 00000 n 0000004575 00000 n 0000004119 00000 n 0000005490 00000 n 0000005034 00000 n 0000006405 00000 n 0000005949 00000 n 0000007320 00000 n 0000006864 00000 n 0000008235 00000 n 0000007779 00000 n 0000009150 00000 n 0000008694 00000 n 0000010065 00000 n 0000009609 00000 n 0000010980 00000 n 0000010524 00000 n 0000011895 00000 n 0000011439 00000 n 0000012815 00000 n 0000012357 00000 n 0000000777 00000 n 0000001006 00000 n 0000012903 00000 n 0000001774 00000 n 0000001921 00000 n 0000013302 00000 n 0000002687 00000 n 0000002834 00000 n 0000013610 00000 n 0000003601 00000 n 0000003748 00000 n 0000013918 00000 n 0000004515 00000 n 0000004663 00000 n 0000014226 00000 n 0000005430 00000 n 0000005578 00000 n 0000014534 00000 n 0000006345 00000 n 0000006493 00000 n 0000014842 00000 n 0000007260 00000 n 0000007408 00000 n 0000015150 00000 n 0000008175 00000 n 0000008323 00000 n 0000015461 00000 n 0000009090 00000 n 0000009238 00000 n 0000015779 00000 n 0000010005 00000 n 0000010153 00000 n 0000016097 00000 n 0000010920 00000 n 0000011068 00000 n 0000016415 00000 n 0000011835 00000 n 0000011983 00000 n 0000016733 00000 n 0000012755 00000 n 0000013229 00000 n 0000013206 00000 n 0000013517 00000 n 0000013495 00000 n 0000017936 00000 n 0000017508 00000 n 0000013825 00000 n 0000013803 00000 n 0000018820 00000 n 0000018392 00000 n 0000014133 00000 n 0000014111 00000 n 0000019702 00000 n 0000019275 00000 n 0000014441 00000 n 0000014419 00000 n 0000020582 00000 n 0000020156 00000 n 0000014749 00000 n 0000014727 00000 n 0000021464 00000 n 0000021037 00000 n 0000015057 00000 n 0000015035 00000 n 0000022346 00000 n 0000021919 00000 n 0000015366 00000 n 0000015344 00000 n 0000023229 00000 n 0000022801 00000 n 0000015681 00000 n 0000015658 00000 n 0000024116 00000 n 0000023686 00000 n 0000015999 00000 n 0000015976 00000 n 0000025002 00000 n 0000024573 00000 n 0000016317 00000 n 0000016294 00000 n 0000025890 00000 n 0000025460 00000 n 0000016635 00000 n 0000016612 00000 n 0000026778 00000 n 0000026348 00000 n 0000017067 00000 n 0000017043 00000 n 0000017141 00000 n 0000026868 00000 n 0000017874 00000 n 0000018025 00000 n 0000027271 00000 n 0000018758 00000 n 0000018909 00000 n 0000027718 00000 n 0000019640 00000 n 0000019791 00000 n 0000028166 00000 n 0000020520 00000 n 0000020671 00000 n 0000028606 00000 n 0000021402 00000 n 0000021553 00000 n 0000029048 00000 n 0000022284 00000 n 0000022435 00000 n 0000029487 00000 n 0000023167 00000 n 0000023318 00000 n 0000029930 00000 n 0000024054 00000 n 0000024206 00000 n 0000030384 00000 n 0000024940 00000 n 0000025092 00000 n 0000030836 00000 n 0000025828 00000 n 0000025980 00000 n 0000031280 00000 n 0000026716 00000 n 0000027197 00000 n 0000027173 00000 n 0000027644 00000 n 0000027620 00000 n 0000028092 00000 n 0000028068 00000 n 0000028532 00000 n 0000028508 00000 n 0000028974 00000 n 0000028950 00000 n 0000029413 00000 n 0000029389 00000 n 0000029856 00000 n 0000029832 00000 n 0000030310 00000 n 0000030286 00000 n 0000030762 00000 n 0000030738 00000 n 0000031206 00000 n 0000031182 00000 n 0000031661 00000 n 0000031637 00000 n 0000031801 00000 n 0000031930 00000 n trailer << /Size 176 /Root 175 0 R /Info 174 0 R >> startxref 31984 %%EOF interval-2.1.0/doc/image/inverse-power.svg.pdf0000644000175000017500000003175413031037006020650 0ustar oliveroliver%PDF-1.5 % 3 0 obj << /Length 4 0 R /Filter /FlateDecode >> stream xY[}ׯcZ8z70S'4q Z[w3'13'mK[_ߌدG[띷ߛdj/!{>>R\ŦZ,6q5da'X,J.&r$fD|.j8R1'Mx5ջC׍Z9v+1Bdx]}.|ݿ&r0'ft\ZO^UYdsr  {晈C6 ~5l T% z׸.;K]]E?&|Ξ7QD/2oExw L~BZW^rw9ţ!ħ5H=z/6Ex'>Ѐi}E=5 a|76PrH9 1j^ZB*I`\\{ڲI Ͻ9V^-(sfy1GڴssPpz~ߞp\uzzt9ISOaoRNP S>x:-+y;{byQ8TǏ\EФhtd} ۇC3\dn'燷cHZav(`6y($D` w_~EYtK'讷pIC*>ɦGZJ) f2Ǥ4EXuɤE=I 3F\lצc/.0E\,'D|X0# 3>Ȯ5!CKt}й`:ܸRt JIEn,%ȚAϫWVVܟG{?na 2{EP芝xk-MϿ@rΡ4EEgN@ xҷZk[ET07d%O@._Ά>XlIfp3I^kf@uCүC@oG`}TRxJ]nFKn  { нw.A{%'(23#A`r&WAS8qyBc̲sIґ+ka @[tluAȊ#(`"^t&J[X2lP81'toNӜCbZB ߚ(~]0lxL+8Pu7fnh^c;c={*U* V*m8 ׃H~>ZC"%F }Xfܨ+3 G>;4{)1Bٰܡѣ1:$M@B)]7D!jf$;Ҵq@ڜZ^PȹhQ%Gp7.c?;Z-&Hp)jIKL ;ks顬䂢ܜՙ BʣE&>_5aE3Y@5%Z>TR( YMFu@Í/9G;P}p'&7/ L?`l#wK5akg2мģ?NӫC$]3gw0D$9(jePhYCnanWP1C'M7 V4Pآn&[d}3Oyѓ,ȼ2QÕ 1# dMvfY5f)=)hJrǹx+{kS5 Ί 6L8/b"y>L<>adOLVxqӢH&zg郳#n{5 NZY̝:脤-;uZL#f#s };S]^gJ왎x|2&sMQ+%TxAP3 YĤ@D Ma,RG( ):C|R!B$S` '0aqy4e!7Dde 7澑8KRXW <0z5ڒոл6q6åEQYʺY/i8Ԇ$InT7Yw1 ƺVGRŶ,&ríd_&[ͥY,9Bk.f Zu-!`?Ķ~]њXyPzPQzyRXɨTk!' a`_TA+M0Khd!^/ AO)B}I!|+XЬ.cPv~c enۣ-Tf9wN});^Ӟo~"cjK9aU{ZOwK] +0pmա9 sRdʀW0,IF_|]Ǎ"7*_mXįIUEU7 :l _Nby|cWY endstream endobj 4 0 obj 2459 endobj 2 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> /Pattern << /p6 6 0 R /p8 8 0 R /p9 9 0 R /p10 10 0 R /p11 11 0 R /p12 12 0 R >> /Font << /f-0-0 5 0 R /f-1-0 7 0 R >> >> endobj 13 0 obj << /Type /Page /Parent 1 0 R /MediaBox [ 0 0 361.873016 179.239456 ] /Contents 3 0 R /Group << /Type /Group /S /Transparency /I true /CS /DeviceRGB >> /Resources 2 0 R >> endobj 6 0 obj << /Length 15 0 R /PatternType 1 /BBox [ 0 0 100 100 ] /XStep 500 /YStep 100 /TilingType 1 /PaintType 1 /Matrix [ 0.005 0.005 0.01 -0.01 -1.128906 0.239456 ] /Resources << /XObject << /x14 14 0 R >> >> >> stream /x14 Do endstream endobj 15 0 obj 11 endobj 8 0 obj << /Length 17 0 R /PatternType 1 /BBox [ 0 0 100 100 ] /XStep 500 /YStep 100 /TilingType 1 /PaintType 1 /Matrix [ -0.005 0.005 0.01 0.01 -1.128906 -1.760544 ] /Resources << /XObject << /x16 16 0 R >> >> >> stream /x16 Do endstream endobj 17 0 obj 11 endobj 9 0 obj << /Length 19 0 R /PatternType 1 /BBox [ 0 0 100 100 ] /XStep 500 /YStep 100 /TilingType 1 /PaintType 1 /Matrix [ -0.005 0.005 0.01 0.01 -1.128906 -1.760544 ] /Resources << /XObject << /x18 18 0 R >> >> >> stream /x18 Do endstream endobj 19 0 obj 11 endobj 10 0 obj << /Length 21 0 R /PatternType 1 /BBox [ 0 0 100 100 ] /XStep 500 /YStep 100 /TilingType 1 /PaintType 1 /Matrix [ -0.005 0.005 0.01 0.01 -1.128906 -1.760544 ] /Resources << /XObject << /x20 20 0 R >> >> >> stream /x20 Do endstream endobj 21 0 obj 11 endobj 11 0 obj << /Length 23 0 R /PatternType 1 /BBox [ 0 0 100 100 ] /XStep 500 /YStep 100 /TilingType 1 /PaintType 1 /Matrix [ 0.005 0.005 0.01 -0.01 -1.128906 0.239456 ] /Resources << /XObject << /x22 22 0 R >> >> >> stream /x22 Do endstream endobj 23 0 obj 11 endobj 12 0 obj << /Length 25 0 R /PatternType 1 /BBox [ 0 0 100 100 ] /XStep 500 /YStep 100 /TilingType 1 /PaintType 1 /Matrix [ -0.005 0.005 0.01 0.01 -1.128906 -1.760544 ] /Resources << /XObject << /x24 24 0 R >> >> >> stream /x24 Do endstream endobj 25 0 obj 11 endobj 14 0 obj << /Length 27 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 100 100 ] /Resources 26 0 R >> stream x+2PtDb  tDQBW  endstream endobj 27 0 obj 41 endobj 26 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 16 0 obj << /Length 29 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 100 100 ] /Resources 28 0 R >> stream x+2PtDb  tDQBW  endstream endobj 29 0 obj 41 endobj 28 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 18 0 obj << /Length 31 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 100 100 ] /Resources 30 0 R >> stream x+2PtDb  tDQBW  endstream endobj 31 0 obj 41 endobj 30 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 20 0 obj << /Length 33 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 100 100 ] /Resources 32 0 R >> stream x+2PtDb  tDQBW  endstream endobj 33 0 obj 41 endobj 32 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 22 0 obj << /Length 35 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 100 100 ] /Resources 34 0 R >> stream x+2PtDb  tDQBW  endstream endobj 35 0 obj 41 endobj 34 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 24 0 obj << /Length 37 0 R /Filter /FlateDecode /Type /XObject /Subtype /Form /BBox [ 0 0 100 100 ] /Resources 36 0 R >> stream x+2PtDb  tDQBW  endstream endobj 37 0 obj 41 endobj 36 0 obj << /ExtGState << /a0 << /CA 1 /ca 1 >> >> >> endobj 38 0 obj << /Length 39 0 R /Filter /FlateDecode /Length1 2388 >> stream xVmLSW~9޶Pj r-R*"r (bе|hQA85Q1nsnnQga6Bc#Ec2]e[%3l<9O9@ /2/޵ui],X=>n؋#SўHO8mUDaeoΏmnMm ]876ր/}~LfŁM=mhh!Z7@` js]9m!s\ 8'C?qC@V-1g%٤$,BI#ͮ3)ʳkISe\O\43Ƨt231{*ʧ 99T:/7R0>V:b'nxgp܄18p ؏;VC7t@+,ETC pB1Ȑ% ?w|3o~~qaco[6,n%t#HɁG| W s F"\8 g0@< b} n;`60Bx4@="zSNO}Z:͒bNN2 1F#= CCMG˶N %NO* $`Ki"OH6LX&֋H u. EaUZt 3;+\X uZNҠT"=vHqnGt?7/)?Nl+ .S@Y  k\'LF[R`H€IZ_+Y׫1[qWz 鼤Dzu*i(Sźh" Eq!MIDGeA] )2\Wٯۋ-;$}e߁910v &*5P1b|> stream x]n wu8eiOB뒡Դ@@u*uYd{,CtsZ" 8(N `˭N& p.$͹ g| !8ON (ѶW̄ +|CY)֌[ᜍE2qDjA{ _ى۫!X_\b}n.Dٌ7_qO endstream endobj 41 0 obj 231 endobj 42 0 obj << /Type /FontDescriptor /FontName /MAPJMV+Cmmi10 /FontFamily (cmmi10) /Flags 32 /FontBBox [ -34 -250 1047 750 ] /ItalicAngle 0 /Ascent 750 /Descent -250 /CapHeight 750 /StemV 80 /StemH 80 /FontFile2 38 0 R >> endobj 5 0 obj << /Type /Font /Subtype /TrueType /BaseFont /MAPJMV+Cmmi10 /FirstChar 32 /LastChar 121 /FontDescriptor 42 0 R /Encoding /WinAnsiEncoding /Widths [ 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 570 490 ] /ToUnicode 40 0 R >> endobj 43 0 obj << /Length 44 0 R /Filter /FlateDecode /Length1 2640 >> stream xV}L[?am`0Ő`CB(RB $@IJY*hSjZE,KUuLJQUMjmZKbvA*k={܏s/ A7W'ַeG- |al ]o z`$^1IEDA#SJ7 cHWψV3Sw5_ye Dof)Zqo @j 28dY<zե >EXUXXI ěPy@:܁ki+}wP(S\["ش#%èGE@r.zI2E]\:& ?I>-.T9цss l1@%Ao1(0Zd. *R@t[HTH|! `\ZL\UZ`65֢Qi=KK/#^{&}kԽl_ 3]1?Sm> l,K%ԮYॽWτmt]kK(@ٗw5%lEy]+Kxyilz s:$XHX}fRu0Ȫ}X`WMM>2Y_?Wb[>o8id~]Da^C}p~u9N Ә)a+UJҢ\U++9܍$?&/"l|sk: X`*_$ ,* z/{xe0.|72\ pҞ0 Rt<[b:Pghsⴸ[ |{>eW8cլ"|N?܆EXpޤ8v-5 8a0 ¡)p-?"$ ݫRjylcĐv^CLnJ{3C{:+ol=3؞b@~c K6C6bm7x2s``ۀ+ydbhRKj$0M/5M_I[i#Qrft5T0pHiݤ+H\y['.ZQ3>kfxwH!%]IPm8t'jk¹HHEyo-+`)Vw8ˍȍ/e]`i^rRw%b(] Tty m*_#|via"Ek +ڙ`'Ws~!T僶~Gܥm[OU d endstream endobj 44 0 obj 1746 endobj 45 0 obj << /Length 46 0 R /Filter /FlateDecode >> stream x]Pn )7 TRi\P|¸߇cR0yo.z_FgЏՄ u:f\#mUEժUBx:'B-N@GѺNߗ}M{?K0F˽&WZQM9_G@5Hk܂T[ {j٨Dc9}ǘEU/{[z endstream endobj 46 0 obj 249 endobj 47 0 obj << /Type /FontDescriptor /FontName /QLMNHR+Cmr10 /FontFamily (cmr10) /Flags 32 /FontBBox [ -43 -250 1008 750 ] /ItalicAngle 0 /Ascent 705 /Descent -215 /CapHeight 750 /StemV 80 /StemH 80 /FontFile2 43 0 R >> endobj 7 0 obj << /Type /Font /Subtype /TrueType /BaseFont /QLMNHR+Cmr10 /FirstChar 32 /LastChar 66 /FontDescriptor 47 0 R /Encoding /WinAnsiEncoding /Widths [ 0 0 0 0 0 0 0 0 0 0 0 0 0 333 0 0 500 500 500 0 0 0 0 0 0 0 0 0 0 0 0 0 0 750 708 ] /ToUnicode 45 0 R >> endobj 1 0 obj << /Type /Pages /Kids [ 13 0 R ] /Count 1 >> endobj 48 0 obj << /Creator (cairo 1.14.0 (http://cairographics.org)) /Producer (cairo 1.14.0 (http://cairographics.org)) >> endobj 49 0 obj << /Type /Catalog /Pages 1 0 R >> endobj xref 0 50 0000000000 65535 f 0000011958 00000 n 0000002574 00000 n 0000000015 00000 n 0000002551 00000 n 0000008800 00000 n 0000003015 00000 n 0000011668 00000 n 0000003310 00000 n 0000003606 00000 n 0000003902 00000 n 0000004199 00000 n 0000004495 00000 n 0000002786 00000 n 0000004792 00000 n 0000003288 00000 n 0000005089 00000 n 0000003584 00000 n 0000005386 00000 n 0000003880 00000 n 0000005683 00000 n 0000004177 00000 n 0000005980 00000 n 0000004473 00000 n 0000006277 00000 n 0000004770 00000 n 0000005016 00000 n 0000004994 00000 n 0000005313 00000 n 0000005291 00000 n 0000005610 00000 n 0000005588 00000 n 0000005907 00000 n 0000005885 00000 n 0000006204 00000 n 0000006182 00000 n 0000006501 00000 n 0000006479 00000 n 0000006574 00000 n 0000008184 00000 n 0000008208 00000 n 0000008518 00000 n 0000008541 00000 n 0000009194 00000 n 0000011036 00000 n 0000011060 00000 n 0000011388 00000 n 0000011411 00000 n 0000012024 00000 n 0000012152 00000 n trailer << /Size 50 /Root 49 0 R /Info 48 0 R >> startxref 12205 %%EOF interval-2.1.0/doc/image/octave-interval.ly.pdf0000644000175000017500000004314713031037010020765 0ustar oliveroliver%PDF-1.4 %쏢 5 0 obj <> stream xUN1 O፜DN.񊄐*JS7T >I{mSepKbۚn:Yfx|`†$% E#+ޚIog2?v֙X)Y3PoF:f1D:O#nf9=\v>RF62 N1%k{ĭ27p!cykjQ+O" 'frc`P ڟP!B%mm&adƘAs=U/9l۲uoendstream endobj 6 0 obj 294 endobj 4 0 obj <> /Contents 5 0 R >> endobj 3 0 obj << /Type /Pages /Kids [ 4 0 R ] /Count 1 >> endobj 1 0 obj <> endobj 7 0 obj <>endobj 12 0 obj <> endobj 13 0 obj <> endobj 10 0 obj <> endobj 8 0 obj <> endobj 16 0 obj <> endobj 11 0 obj <> endobj %BeginResource: file (PDF FontFile obj_14) 14 0 obj <>stream xy TS׺?dQԪ'`Vmζ#Z'Ty$@ aYD:`Zu޶׎kwPZ/\kobi1ruYxhnO߭n^=0r`V@2yh+=sH_,,-TCCľ29{vꫯ`ٲeOl?ށ!AT u@?O[q`toy^@ ~~!!s͵] L?x-U<88#88v Q atٻh1E,VZXmaMoaeb_ȴZmb<0c%nj@ NLC| "c|?6PI7Ay.Ll.v`0`ׇ}J2t}qQ'xݴtڱm՛=Z=ׅ/\ۻ&t^ ;0rRq^rֵ582j=j%ƪ**2XVȃ|T^}.K{;S 6;.;5;E$DhS+PE٭<޾w, nln:'B[[-2K߄'YnxYuȬ,o*li|6dBmz7Җ+TB~F2@pQ>y3 oƓqȢr0@IhhҶra)fWP`dGlm BUCj1F#aoN !@(CcIYc&t|&.tKnt{"KD@.\NFVRXYdrJF6'S3-d\?\-]-?aBZRd6iyo+Awݺyy-"vR ;飐F/،Vlu;gTG[w(ժ}G5kUX\0篍e,vXZXZX\R`cYf3VS6ZG)yt fT2gmN 2ZѝQ7uT.iZb}-qܟJ,wkFyc6q##s}ڱ[m؁^~8ݸq8~x_:{w;A0v 7'|c3fMƦljc'2qĐO:iҤe"'ɣ''GL>9)>Sʦ\S7Mu:_^$/\* *zklll+md7n -v>vQvYvev}g78s̕3 :S;0k'/O}y~Zcsp; x#d. iRd!spqgۜ}~<'uJ@N6rټ4!67}{0܁ f"bcCpYO$'U%3\'KL~\(64هw =~H*!3Ȁ: p =/4K0JV=ηU^o /wh7s=W [E^QY'y)! ;^M0Vxm\&M$ۑx?_HT$MGylp]dp`FQن~ }ZPKb9=E}\|}</govkrZ.^@W:gkȶ, ooDe 0Tr>Z4/W^-L+M@ OQ 90UDTK59;P#bs=^.$t47Iv.fqҵoul OKl9 W}"jY C8 *RygT G!z&:;mwT5 pua!P ZAu/Wwz)yBc:ywrSTQ3j<=Qe W'[n=䞨7D=+[^pgfn0(39(jGNp҈ (D:c_u|826Qx-)`J”b|?o9BJ҅2G; S")H&o (i' pߋOYx 1ЧU 3"%#n Ϡ n`4JTQj*n>rp 82kPgj!y|w1DB_v3 uh %%U&@)*` !93>= у?I+Ϣ jRTe*!"=0Tx3wZZƎT&!)CY@^Ď\Jj4|k9Oo ?I+YBaNC' -BQ~Fh%XISD$%A*ĦgmBKd@KmW1jPr]t]އڂ<g.OUv U{ZF2ۊu:}ecMAi=OB\ZLR$Ii+h!<  7_"06 wmom6C,&3+ !#գZ^HjTW;;F.ݻ[flW (N.NSeB.TvĘ\W %7EO ڮc+q2DS)tHϒgĦg N.?*`{F|q>B:+U6i>.B\:?>@+H;c 1 3k/m:LoK̿pGZ֪+= Bxhp) J&$cnĒ"3?t4E\( Rûk֭w{[^~wQs顖Z\%?ҪWGl? O>=o9=hW>S٧5g:׾w$%5@9fgd'JP_St)A.Iw8)&TZ/gnFN2$PQYL=- s  ht:MqAҞXm  ~ wy8*kqGu*o6Z/ Oh2מnk?滆n1F{|j]T'$w8ߔnIR ~`ਪ[ŰtpU8# o<ڴexMxdE7_CA.Ta$uX\ MG"\TXT](lVGwy|! xIrdX\CR>-I&OK I/}pPpHsV?|``\ PBR?%ƥ&vw^dqDf݇3^.@&R"n4h'>KAܖM_3=og'f? )ODiY=TzbfWiْ_x4yd}u@8)e:YYZdG\a2TYyFe&DdR S."Te) .e&".ckARA[#Pr%W0JKT&f|3VEP\ Hm"r^ObַVäҊbI-E)MOGI($*4@u:/ٌ*9?(!NmN<: -mFЋ3Ut(+T5&"ֲP_Fo ˈ׈@ ȕU9ٹ\u Pux7T*vm?Ο 퇰k1ho""q Z$5 AC% )dU;0꿛Lw} zp / o&y@\=0|}!bb0g0ЉΝYL6MRyX/%։Q iy sWj".y'Y_H TS[l˄Rc!G&Ny mx׌NA1ǖDA$"n+r1ѳiy$2sUhH͑3x{%l颪)g(Sw,0Ná.p޾mTEvmw;/p!2YH^V]?X[#Ӈ=..{]Nu;($~`\Wgr%)watyf;(^\Li}px\ dl2{1ϛEZڬҴJyq4C"65툌S4ߓ$'50D]8Dw< zS>SH)؛^BQZSЌ` *V* Im 1RGB@KE}Z]Cb:+M_+OЃ͑ S?IiaaCeDŽV%=P)42OyRhv%+¢ҪvhAn~@vFwӰUd(;4 ; <~# !v%4GYIOJ%t::Ql%#F$SaPu5\dN>nSsy>&B1wT|Xx6`=Ʒ0l9Q0l¡vūxpdp#;q;O`d=!3#C  4syJȆ:3P]<8EvdK'&ȋ%\JkGحDH+S2Z*r* Dwq<hۭ:.1Aױ|N=i8Mznf▒.}{¥.6;)#(B:5RE<*I*`? ;c1x%QΊ-<02 fPĠ a/.ZLJ5%8Kr,E+׹lkllTE(O*,<[֍ {CeWДKF9ޅ[p̐b#xu6"r:,-y*$ >?]\+x4D4ϸu])r&TYdq6©9N+Qd%2%L<@")XYg]Gic퇀z?]wܽ߰ܙOv\ xnF16 x]E09}Z'"c2FBTvc[rԘ']]~{֖}|E*aJI%RJX!#U= PmX'@泶C| [V 0u2>G “Z?`Ҵ s.UKkx/-$ٕh2-[_öuh*=K1ǜg9;,t` Gg?MI6Ñ$T+p^V~ |<=Ef¶%g9z4UC)-s 'ciW<tᣍwV̓Mny q0Wim]T5w",Lp-98DHԄ|jocI^˥Ճ*`rO!9!xrO@]'5“q ( G,>kA()t^0ͥ Ϳ,/fO=_d?!iHSxwʭ!^呍Zρ!6\AA`xj_->){v[(9"nSqn~]TY!a\pF>ƼZ!f-J'VUSMsD 7[MsDWucUFW*EIՍtUJpS5J.ms_CjZ^j^B4*n=Cx8ILt\i䰺Bok<\Dz.zIktX^4 I 8iתy 8<@IȫXd^K`[v9Z~cO`(44Jr&!{o|yùz\~߭O&`l$^rkZPҕ w(>'ΐ,Ql4l?'"˳!]|9N\ _f$*2܋B@,c_h&pC7iV֧Yxޡl/zO;۱,|Wtww\t[BͿfJocdt҇|@}>w>ap8x)ƫh=L/r0REWҕp}+BM9K29xp~> endobj %BeginResource: file (PDF FontFile obj_15) 15 0 obj <>stream x8 xI~0 M[AEEV CN!cCdfϙ}n !@ʩԢbUGmۉlD>yloG)*R3 ewN[<7)Ƅw#xc @Ro_ӷnt_Ⱦed"Wo/\J))V<,/SVfje\ejڢibeYFaMfa^VyYbrZUReVYRu^Iy9%Ԭ2eZ(%YQܼTJBH(NUeث%eCFZYǥ%e"cUjIbu.A%!..v)q7LJ&%Q;+7z_#ww#W_<0qgz&?ƅ^M$!Er+xj!Y' Vݙ\AN ݞIo|i0T$R@:~0_;&ɟrڋ*mJVCM{rc'2XrR!{8? .q^>do&bwmm D^;)X. Vج@rERÏrOi:[7;MEue<_#,mXZ:Y^t? @ܜ~bgaxNl˄) hX}$o,_Ҝ4%Xmlj8)O#"Ƹq}wȄi sV'&lN$)b' ;!861-qiD]"RT<5KNw2;ujS2%:%ϓ ܡ{=K'+bJ'$-HMy7g4|s?1lĄY##Nxoė#Ǎ4|cEiQwzxvӣъFkG;FcS5}1ɹɾ'|1m{&;5U^^p6ǪW d8K/ol!PwwD< ?nhFjbdtPR6Lf0gٹ;:9'r؝ BW댷wE;B(aɚuJ-$(@OƦa5+th= icg'Ee֭'s:;;:srr:-?45----Me#unf?F2mNOuJE ׼~}/Ȁ0 isG7O.yh]ņU-; (Oo0ᢔ/A?Q֚eksT9++hAV^ivЎ~[/D!g5(J'5u8u{Ոٍѵ@ӕ+JWff™-V$4fgq\Tڪ&Zu!lW! T36pEH:v)GՄ ֆ?n_ewCuA S>v8@*`Ky@{A\}RDhWz8elcD_N.X8֊'rcm5'T^.Lh>b-OY -vh:NLr-:V&Vm Pe ׊;ۥbXl1ŜbYbx:R/xp;+?X}pjdb_+)%O~ӠZfP/t'lc6?X d3 hv1x@U|:( i- D;:ڣ]90gqf C|aWkBg8\y9Dl :kWn[`س@Gj`w#0Gav My-l61MxuIh:n"<4{NCRwE2Wޔ\+z936WuLz ^o~{^L&.*7c%xHOC`BA}bF}ȥueAAȒKodz?ۜ>]qa3rB:Ӂ6Y߇sA_~L,Rri0К? fLc_ԏ8:=8 (cnsnׄ^CX"ʨc7>q W;y$z"|up=] kHQ_gvאҜ;َ&Gv}8 WʞC' ݵk+3j6.VVRf*и4='셭-[ i6CcfX09Fk347Lw Y ї*T"4i;/eVEyn~Jȩ4.m;-؁3,8.h{*And6#<OPf_RiՁupֺ@#GHEMY߹pXI4EeJt^fkA˵6; 8cB:wS'vvv50rKO^cK}0N\ NY1D2as%`wz-k6rlR9]QKz3^o,`^InF0Y '`@dV zwylþa)o&M KfP%5F,4rz-D4;.s^] ރnz7Qu:kmyv:ڣB18ef8a"Ƥ7ToR["̍)fPmtfgۣeZ0eRLC:[VJPU5_~@HMx"L)z/S@y B &oK+ D&"V-ө8iYjj! wRS `a}I+Sa=iuHfI|WWM |2g'0 UȚҤokUUMEY ,mǽ[܈p|63ke@9좘mpJyF޾k Γ!e%J~VIٵYF77a/0p[ +JŇF4%ZbPt+[kۼaۮ띳I H%n*quUEMt/88N=d,QE _`0XI`,L x.^V}"p/>2}#LWY/߷!䰸-=YϫO`\epb!Tp;;G|dD::@4Fth$"ZFiU&Ll5v3:Ԗ*oK!X1`1l5F)AZseLFh·r`3Smm7{iK9HdA:3ψ)j{Ԓ-7p kR%neL oɤBKq+/v\'}›u+9^ B28^8D_pw. 1,N.?9;t8#D%O[SggjrO-ZtN+]˂v࿥h_<0x@Pk|QF  oH?&:0a? ve3ŷ67>L㟥.6I..=J6dNV=Nu8-WqNsv|;=הm[Jg;YO&F0X3Yk`RF.ጕf+K>RDRM:µF)y'OYJEXTcI|JJZCsk8E*Q >voa_1gǫSѕn.ݢe C]VʲVFxLnu.XX.8E@L>@[Yk5Yl6)݄xl|ئk:7?iX.:y endstream endobj 17 0 obj <>stream 2016-12-28T23:34:48+01:00 2016-12-28T23:34:48+01:00 LilyPond 2.18.2 Untitled endstream endobj 2 0 obj <>endobj xref 0 18 0000000000 65535 f 0000000606 00000 n 0000017360 00000 n 0000000547 00000 n 0000000398 00000 n 0000000015 00000 n 0000000379 00000 n 0000000671 00000 n 0000001086 00000 n 0000009699 00000 n 0000000783 00000 n 0000001356 00000 n 0000000712 00000 n 0000000742 00000 n 0000001685 00000 n 0000009993 00000 n 0000001243 00000 n 0000015942 00000 n trailer << /Size 18 /Root 1 0 R /Info 2 0 R /ID [] >> startxref 17509 %%EOF interval-2.1.0/doc/image/cameleon-start-end.svg.png0000644000175000017500000001452313031037010021526 0ustar oliveroliverPNG  IHDR2asRGB, pHYsttfxIDATx{TeϺu_A DT545CҰ4%/YXad%{jԼג[ ^/ܕ;qfwfwfwv~5g9s3%Sm{oY:K&8hq.~|^`vFUy N88:00 >+nOJ{8Crm[`Oev2.)?ۀMy$[x*i-9. u8$<'?& p9|?&|GQs O x 8v88"`̱<&t k@䲯lHRQ|{,J+-@ߴf2Ly$}} ʖW}x2mA:Mt[\M w#WsWIT$UM˴M}sy2|Хy! {yٻJy1_ӟ'_Ŗ`NLBwU-6?w秵 l)sl}lF%TwuƑ^Wx x: atz+8} ˭Nk֊p&uWITwO0Ze s|O1>>G}`98}L&`{gT@Yk[sOه,;B$Out'/wߨioؒ-| M6&/˰ǽ#H#8%>Y߻j(U1WIKעe [ @MΟG1+wlڴ-=ӟ)5YsHbGP{Ieqnz$q*^㲖p~&}dlF4Ai%$gS =wM8vklu I2_(Qg`7xTlq=[ w@a%ωoH{gb+wQGq&t]| q?G9¨ˏf_%5"eA:8AOźi&t:<c' :8[mn-6-ݜz.asy]3}D;Mqkkul^gџ׬f:l j*ƟuE *[x`kxT"{y.?̏?IKY#…uQ:jI 4W.A"T(TC:3ô%ގd੩{-ߏn2ẸKȔ٥ԂЅYF,JIT~|-+k}dwExbd O m/ Wx+ ~~E,J"/'y< b{ū&lih9“$$$$$$$$x$x$x$x$x$x$x$x$x$O$O$O$O$O$OAS\U]{[x$x$x$x$x$x$x$x$O$O$O$O$O$O$O$O$OdIdIdIdIdIdIdIdIdI w0z`,^2`s-z_r.6}=׫seV<΋b &@0 3rtFVö^?xWZïceOi6k2m53p״ X?fmׁa{^m&`=PVmW73 ݅x⾏f<~F*e[^x\Y|a{![=ȥ.Xэ@^<@WΥSCjx-'@J=.NΒ")1m |FCNhUCsYIRZ(<MzWǿgSNz6ruv%)a豄k 'yB; UNŲ::XNٖw{{WO{K }RKĴ,x,}p)Hb.8Υ.R dk#`ǿCo.uH.NcUŃj@*|P]9C'z[@0xļ.JkY_] *p|9nz?o4:K2./U\]w zF\.ABuq.uz`]m2*30t9lKL??N?2Ɗ 8;η_וaxRµJ1cґHT.16l%ORQsL糽)g<'03 ٭^a|˷O|Ku j=׃bօ V.u!օf,Zɱ2~rNj 4%)>OŊ[7Cv_ _[fX}w {fF j+lor=]s2T<_\K4B}׃bօbB3W{vte 3r5?VAwjVxŀ %2aS} ^?)OFd< чӲ/3*Z {92okJX 7*C>uЧ]UWƃef`or嵬l`Z85inO"a no7qn=0ݮԟ\w"ZG`]P!BD.ÀM}BQM"kRU}ٷ,U!ZW3ODp'D:Wö[Uݜ{`!Y|@袬ICRIݣ /gS?eL{ ajjj>;N_D;r^:<`!a/eIΤ0 Tcļǽ'{$Zlwu]l&#d1V 廀0gc9UaFFֱ0O^G Bm 2$9=NOҞ-w*!i˴vWH+jؿsՎ-]"{Mwib2no*qbm ]]ɋSeеi|7}==ݣ֛l^Y5x8c^Draź:֩XYՃ\B ܝkm$ . XYoފ]\H5مi6e4+G@)VcÄkio - kzJvf}>"iJt܆s M I O!\}yi۳0j6}i\w?\/S[\Ά2yfkZ*PVyL#yBlXAB.օf0Xq+ CW3<7Z%ԕY5=w}hǖ)y#akM^.qg}i{U:pK*ֳ4yJkxJl[IENDB`interval-2.1.0/doc/image/cameleon-transition.svg.png0000644000175000017500000027706313031037010022031 0ustar oliveroliverPNG  IHDRY5sRGB, pHYsttfx IDATxyUՕϹsUQPUQ5Q%P`Iitkwk711MkԌ/Ѩ&`K1@ XUL5霽`5[/{{gZ ^8olt"HzCA-] @w"+´wOIL3u3 0t˘P0@ LS^iwAah bUW-ؚ{d  M",5Ic_|'^A‚P"unTX1cErXzNAD  e5x~? ˓K(%Nt  BX!)I$Gt B|;3ғ P܈PT0@X򖞈C;ä3"w FVJo Bq#aX_]YàKbD' EX LϮ_\u  'b.9m\Y8 aA(($bԽ 8M |3'=. Ł5uF=H <.4޻~ uAA!, TGyRWmut}AA!,F8%oN^"w@A7rFX[X9:03~!Nt  BX NbB]i':AAaPYONx\jK&wGAD Bpxm ݻqIrAaP Alo+ NlY;  BXe1oatԉryʓ B!rBQ0oYwZePwĉNA  E7kW~./f=cŞUr{AA Jmuto):)³Ӗ8 aA5U%. )?ի}C  BXcD1`*h4u8 aA52ә4 *wHAD B`0@&\:6JL ^JCӗ׭;$ "!PzDBȖz%SFTyt /Szʺ_ĉNAD B[X9:CNM:Fژ?ձ1# 5D$2ĉNAD Bpب3<~Ʈx}(㼭wRy{ aA5'7)P>lmwkD:׬@ ֿ';$ "!0VT&kk.dp-:21n!AA!,}Mѱ*":ȧ nM\xOd]|jߊ  ^*G;J_%m`)tXǸ m OǼ':AA!,c-Ks& w>!QYgkiU^ m ʽ{]i  BX:')׭2HT(#?xz.=g?] 7(>(:ن+%żd a;/LΖ* "C.Qk6dZbxy׭]Pu9AA!,YZ+p ٗAVPe6iVW}S2AA 2F +Xlg׮ţcrAA )Xk>gBf=M~" #6*?},Y%wZAD B;34C@F h[}{> p|r$ ](\3QS{؉KIgD;/ "HoCNt\3q?S({8 aA|0~m_ KspUAP'>˳˻dft4Y+|:y8 ±0X}s -T0߈hG)'(A CmcNE&Bi73K:1#d aarϲH^1kbsZoV'O  !r?XJO5}e/A-.%2A‚0hhȬrF'΂`·Y0)qAD e|\nkh-xW7L ɨAD =dܜ>sEa\z; ,LU&BA!,CyK.^Z}D B?ѱln #XVF# h*㉆YW 8k$ϕ#CqvKP2LzZ!,if-ACDsV.8P<{eL+vXoI@jIO "ap]('>!ڣp3WԽm DM]0/D'ŏ`-Hyrm6M&OXTnb+,kw.۲ʲ)iajAz;:mA ptܹ癝}}/5O"`Oj2&A Y0p0<mhjE7ͤ6ʤmVm6 ցǖlDmڠ(7fCmgmoc wwS+3Dq`NϮiJ.a ?N{|uSU.9_6ضS_bsi{BhG׊cmÉoFhT {Rt;ߵ>~_AoV@(,'0u ~!p1ԗ6};1BM#&7nXO6Pڡy3[8 " 4r­9 zo7 95|trYQ(E! {!a1aA5dUPןPK+v0e n^ذDZU(+fOm|eƈ\Cda(`Pǿᖠ˰#ˈD B]JSJ- -VKHdBZM~DBC [ !@EG&"x<YEG4}:yYi}WUֳϟ-T݌5<ϞeC2[wͯMVF(f!Mc0kΐ#ܹN请UG R)X^T|<}8};<~r_^ciD'1\$rXs:KF BX> $9UۧNXM~>/|O3wѯ8 Ȇ9EL&"](6P4aMxwaN!,bu Lؒ3"w FVUJ3R&g,X^]:&NtY+2B&v=3Ml{thqD |Y t)1EwV'OE9KןJa? ^[ߚ:*XB׃,(o|7+)55]2Q+BX N2e͂Ks~ kT=~ ([2ބZ^?M脢DMA^j=}OyxuKq4Ej"S30hxay|P+|:9~̺Sw\epc%B)^ﾾ_lNjz;[$rr썲 9Ff0X!pQ_㭾N'jF0By衊Ξ.aʕn&:+_eb믟/tގYa}k++wZ6cz^ENGs[ZBO= NtঘFؙ'sh__EjP|EM C|>zK:1#zz+(Гj ߝŚwm 075 e<(68 |UԚXhB^CϜ.tGdgCS؆.q+BXa }yMk)֒': sf~wM[K&;6BFfv" 6Ha_-ES. %kzHDvQ\0>[j?k~Eږr!}=qBd f*3VQsЙuɿΔG~m턄'->YN(X6.3c sڅOΪ{0M':K5)ApEtY_}6lۈea4LAeށi^1l&mea8PV;`Ftiȱ{9_?hEiϰa.+] "U{}&ŵɯn-E?;CL;\Ɍ~ sq?HnKYr:Z(%b)7 lHfP";# GdoFNslXF ˂_9ȉ>þ7WK|)TV04i^]?P&H(*‡D!L pLm)\ 4N3RFaA_WqT& $n $нR/bV~¥;߄ĩG el -9*s4P)ƣ- nnT.23=|,@EJƉ)#X tT 깛K&)o^4ϧ/^Wf?)/ו/X#H)kn/dS]wlKLz[2 -o"3O(D,QQ&1mFFgyndKMp66!%2 qe[j|d{].7]hr|Jju1溏W0 On3$B2 Ny.A_g~w˿Z/Vc!?5aP\Pf6zg"O/+;m)疴ͮU\CmT5>fc_=6yNtsPa@vھlm]QL6l_L&eEAu+6?22E q$c#ݰ,RmUUIGQ-̕ \aqr暊O]9]p_7ƷC@-.YRm8oO^0wD,}+s4ֿ'5uܾeߤ)S|ְli󦭵5J4 o{}e6r8 Rq=N=ʅP&ۈV}GAnFFS i2(NǖneC#|IYx F2q?Od;K&,O"B_ [@uMy65gIze9)@S<1 Sq5 OT `]:E<:?+vOy|83)ou6L Q\,xv GͲeۂGd/R GL[3m~qZrߍ& Ơ=/bYOl& ;w@p+s~(YKnE2,m7,aAd/iV *.\R4Ӟsg{cY&W_|^ yfk 6ܫښ6^~`3[_Ÿ>̈́ =9GeF7쏚ƖM@Kɾľwyu7!E8 =S=sSt_4/noٱDUW} l`e\lTO4'T)uߘ`oсRj8m#~J?ܜȞX_I'F x5cH"A bi BUss% q4FVݺEUf.:e51۠Yu(\VuGcٰj䪹S~4oj_ff=@* p Ynk[ !Gm]rr┌;&T6s<-E0DxƲrKf2A8XTؘ?.b a1sS ܪp "5GZ xn_OB-wY09 E4af:fM5q xtRڱMs@FmF{]hi<:& W(ߍ?Xj٭q&9ʹDZ}6*[Q#J9),1^#uJ~1-""ds Bďڗ!RY29r Ϊdeij$vo)zi׮]0keݯ <_Bhg}-K&GJrjxH*NpBX?#|~\ɰ|Q?|&^ |zN*R) &BX|~îrj21{ۑ⭰;a1^='|Zr"XJ>D[[_yj.M~uK_@ixlubbC1.j.կ4gZ\XL:<x=VXYnfD F+Hy|>_N FMԯԭ_PW.+./D2?}5֥5t&>@fJEzYeuw[ez*`ieCV_mff3,ݎ'8Eg!,8p;c%\ɧ qbWGy{(^2qpwy;B4>>Vj[Ÿ 7{e0X`B1tyZ8{FeZD]E|pf_{}rY} ᐻSJsсOɬ!, kn^3K,R{߷.UM򂢭6_Jy8Nh2xCtJ*.*"~\U0h54R\,}&joeyE po|䑸ϭt쾉f)#=; `* 7ܐ#BX(ŇA)2!͟y5£Lu6h,1E x*rt:38dSJxhpG<8wŞ .~rrO^87h4l!&(1.<}XwYec_#`ÜqCk(!, kUq K!Sg/9|YU_KMjqr7ĄfRᄟld `˳޷c5ɯxufQu?[$2xђ*ց!gepKivwYJS,0n }Ҩ$2{D =UsW8 BT NEԌpNC7J_1sE] ?"dCu'tɀMebCXNt2XLt KkT J&]AOy~6!LW8%[#2حn( a7u@=y/Wtv16pM!k!,BXgMT:QZ <:,&1sR(4t$L'w(V4,{Qی14@<Sz<6c b3ӺKSHNt&&m.yDWLwɕ. {@ݿ7=YRp\)h_~G-/i XXA`āC&^([5"^A?)BibO,!,S%TRZǎ}zM.lyաEцgv=w_wSnޖO`gŬ}ߤɍN2kmNzzߎ5v NG5N6nTD7TDh/`>+,-;ӂ MxUM\)iX[؍F謚n"fc_8)8W2.Ce -O/qrATJhz؁YY+0l,peo\ӰVFAyÏڤ79AVw\y$w׋p9Ә`U戕U"_jKD/A6r$/ˬ!,tWLN}쨏_dWS_\Ɗ]Ԟmm1PbpӴ5_S8,/Aq=͑8_fl1ɫW{tiLq_yl"?̑at@;de/'b_U ;UnبpPLTei&Hc57 gN Uy*y#k[>QH< _;Uo[:qdM!;ٛJk]"jDb 7_pf,c1cocK׍CάufO.b;uV_RxD2Ekp+NN\ߞ۝l$Tn8-S)|Nhx=.(&=![<ϩ籉&tYܲ忿ۿ|Ю 7Ά<>p[__.ɇKb9KN;!}1Q(Q2nI:r&^-]q8.sWVRF]؈t8[60jKfA,?%ws+&rI煮:?Kɇ;gͪ{0(19+^o$ G-??Pj:{a%ܡ==4v `fL예&&{+p@W{G}v_>m(|CFr.h %+[Xz{+.mpYALXJDz75 o*yuC^gZXכE2cbn,+_@4PRzPN9WFآ>3;i^y׎IAm[s3;G^n9@3%~zjuơ0f,1;U~A*:[JgFZ\xcnj4qCc2M4u??5! 'ذP>ZE40akX!`p#(n}4G4C4:Ok; Pw$!L*uqCƚ2# uDPy"Dtf:Tdpɞ\eS]0>T9sa]p`r4Ӻ %<b @/^V |uUf[8)+e8b癩Wu&D< K8c(h qϿY]/tS û菎k2jY9| 8!LMƃ@'$Xa[j|d{].7];qj"_!/V['7;ՆlEPek_fNۖxփb/iݏ.Y h!eKl$~R?=sɝ!/FGcіkb"^==IW}h#N+R);7NYT/Jq!\|XU{|$6(u b G[?RXJ_@Ŕ%DlUİEr?l6u\~%Cm^q;"M(Uƛڋlwʪz  LĬ]F8 (ghn.kg N Q760ב]׋8PpG"1]{{V}zfH!\4ܝdJ; W1[ubذom\8g|u aQ%^2 L6b~ز*H s\x^ xϲ}VN`Ǩb[x+ߍCoen, 9"Ez>Z}!pWZ?A;b7%P}dBGFՎ\΁Sյ쾺T|AˇtЧ~OI<џR)4?}k*HUSAi7C^C%\Lp,g">6Ɣ;L&n Җʬ9"$оSBD[}r_yo 2 q2.y~I@sD.X6 TW=O: !֓eȴ>?h`fQ)`+7z Ynv˱nӁ ٝ7Fn׻{+> Q3z/M",}@KH+DǧnۮAԱ\3-Hʟfdc*#gQq:QV_m/Q̮?iv/+56CMFR);78'X &BxƲr_ݠnX#'Kzna{dCf4|ʓoR)|Nt|W{mȎ⪬.^fDGfZVMċDp;"A)"k#47-rU^TaxÍ&8֎SٱjQ.1ްl)`om`:ѠG O ~@@2JX>fiC&!r ?됳r}-c+'맻E oJӺg#/=X")2n-eShxp]DOfA':ɠX62>;T?},YEyq &jo/-x։ؒ݉ V]tOd;/) /aB^UHTz ,!Gz+s|gwS罟F@xPT:7Yץsâf39"EmR hJ̋3p;̠ |.:FF+ۈ"@= 饕BY+~qᘭy_dUkrB}'$m7!~G fPDE] }m Eul*RTj0gbN3Q`g}*"XlqO/J^h)B8P>~짠TŐx[XE:% Pui#!l~^r&IYI>}掿mo<}zdR_tM-)ج?!#ZWYQ~E_¤}PS2(1y5O|Lc0bP0 tEkcW'T`[N)F mahOHN0S5_82j?2T l-)=j2.Iaf$毿˻r ?z{67K^gvC8;msԸn,+Ca]\$;d8L ڭ0#'rX,=#%E9WP(ě9ǐw0 ^a& b("c400,sЍ8?OQ#Dsγ7EZZO*7+,u^.+i0M^hұ3B_~Qr>߹in0+na >o^6jh ֹ'ךb'{Q3>O!Eil}_T|ΆЁH$wtj ̒ϰJl[}ЄDlI:V3HL~aɌG~|0DP$aD 믇F=JC$E-?oIyur7}+&ַd3!.X)0]& IDATy +kW2,]ޥ%ӧ:\G?į}Po ͚ޗl\4bg? DwFZ{Je604 DvKrwȱT,(r)`ub?F16/iݧ sޟgzuz-(aDn,+d+S5ΌU}?qPRP/ZZ@6[S_"=tٓg rY5wNޖ/fMY bΉ kqm4σo­DK^]$sX2*}ylD^V` {?>җX]u5; im^I{Ī r;3@y{ѱ6!?6+b~1ֹnF9'%oQ97j%M9'Rrc|hDDmۨ]ֶզzʉgt8vao{7o}v< LDPk0 ~u/ V1R"f"6z>QcACtO*D&VclKܷV̍ H~b4>0j";k6j/o 5u_ ^&7rCR\IĜi mV_NA5Nӧ+ k>3/驍O5ɏe{f5Q y@MD>տNoo;vݼw a%~ˉ #!4B۸ *(<2N>WxnW\婬SFGB!'dxd[y-%{0ˊNy] Xր@@hA k''' yH=g[gga -ƞQc[i@D#ګrxܮ[Uw;m*IɓȈ_Sܼ;׵TB؈> iaޡ9ڮ[!֧b+duy-,iaĚ% @D)K )*9 bКu B|V$5Z$@x&(`I-b" !Q[HSȃVHrYNUdK2{k4.W$ɾWAkgKFM^;1[2rG.ٟ&Hm8N3_PKVv .N{U>(;x*u)PGj[,ԕ*#PL>d cV5U6GVTzL&&$UBDDT0)@U@psZ>d5JFBV ӌ0d4{Yq$ fÜB Z>BΊea!TτH'5 Qx w^<2ruviۂj}lWGi},z[.NCn7dgzS4 +!ũ&|](Ԣ$hcWvZIAo7~QuZ'qw, N?i,iER+r0tWT2y6$ZW B (8T|BvD. \:^] G[E==3ňyaߓw: kmG.iiU@{;Lj[ӠyU|B b/D;i6֨D'mp7ߴNes; R%=Ur7\QXJW7 P2]Cנ S`@Ht=HD^8~"a RP2I 7H, @PII/t;֠4Az=S敬NWmb[o vl} 8YLVH-:x[bTeiaXUՉb呍X@ ahbJ8&/:] @[cE=J/C*Te NDA|O+;t .d9zXքj \JwxwtiX`mUiRZ _']&Q v\tkij%[xo8aflieL98g|tl dU6nq>YG Ĉ^hz9щ _6= ^)t<͇xrvgX V AX3&+B%yY.EB@!ARɕvљzGK8<sYwWu`M 3ε>N}sz*Qm4YZLK[B0[ܺV3r{l!3='ʸ^-f7vT8_N' 2@ z=]q嚘dXtrLU]TW[u@JuK8:qJbnb93)A"B5f%_CJ`*,ҒzJbv}ǕWv>T %+n=u4XsCnl+Ca @,&{)P꒤8o,<7Ң-$;}jn* 5_PFRO/n+%u!:0SVqkiLWX6ѩKn- B bkM&EL $(0L %  jU:gIf][lbرMfE0ECZnE 3؞zO}n4m5+tb <@U>:2td"idl֞E,FlFMf ]J;'LUΖRdՁ_%xzH{Š0D=7)Ce!CDu}ˀ)[0D4+s " B jVRdKNE}W^[e3qD dhq`Bjb]|;ǭrPYwgfOٔ@(G6lMCron; pԾ*PJHfҖR+jzo6SR ,JR@";(b$|e#6ﲱ3^Y[*[?i6EpnJH@5tvlx^ٞ”j}ewuֵKDOsl?k0 WO*uAuEIß1(i]6oHM--fy>N#-a6ɪҹsz Y[Ѭɪ ,ٶ;ά=I5N@% LI{$^p&23GBZ^P.0 ܮײQG@db]Rб57q^4ooEN<fZ]JED[ H،.zެofCwOV~vyk@+O5ÝD}dl#}%@HP*ʹ>n^>˫Cu'f9"\vU83qJ7W(uTPd5% 5%D`b/ n+DHmlR ҒPYH$vcfRVM*S$4dF ^<;rIW_˴(Jتz𞫮 ~kNMG6hV]k?粡?4>/PÝ4X&Pȴ$*W8aSv/O_M \4X&L{Q>̵2*7^)Rbtb#vLWƛXۍ2 FE{"UJ羵NˉkI"I&$$L WSX=Xϱf\*Uf"V9'wyk$Ŝ a֤XHn!:3^upmUq]~ Td!;N>Bl-dMG}==(pnMjȸ"!W#We[E ftvlrvTzMZ/N\vt`7ФaQٷ. !'G3 _gpӎw.XMawqnl~.e7_db*IbHHDh:7qu9hzVbK9OYyJ= ;!(b*@H*$ڊ,LAH( P p.hnS/~R^f!qzVQ'=o^V(ˋuTSQOMj`r)UB P=I\sp&r_YTt3" &:)r'3_SӜ#, oTPQ(wueV٪ZER%1X8@ LBX8wˁ"Š+՟g!$"p +VJ-]_ve͇_ ^ueUr–+U1u7nW+ |m̚sV5-N>X?s։M'Na:-og*A_yzJq]ӓ/+K}wfUiTʝeƶdHa.kKǕ~?۞+!l{Њ90uY(z &b }: b;XHb򧭚09no`wE"mz1ZƗ..1}QKפ@tlmn '-00C94+ IDATS>uzxb–B_QL5;fN! {ɳN//Z͠e$m<F!y `8jvW[Q鴿7Dlpzbd^Tnr0rJ?$Hd#kC: ͦ>1W,8`/:ApYoTܖ@Qo9--|d[$@&iϽ::' Q0;6|svo]wR7JѲI&q)!i)8)Cewƙl[8aRC)D 3~.opjeϥye'{Uwzt N'OSܼTkeY:3y:ȝqn;*IfD|9CVbDSL`g뙆y!rpy`Mڋj\; L$wq@gz͓OUeUy7P̖e?F3W@˟*e&5M.vsSo :t`<0Iu<]RL繾{{x_ԬM7=Di=<G Slfֹ 0PIxss ʹs Ԋ<5QPRM\/!Wl߮ ?O%DuV"*U[t9nI#"Fݹn[*WPV .m*o|#x ];8Ʀ]Dnɏx`RkIFf2[zP |`'NHI|~w\&.Q Pf}7_(+ψ}WkH26DSLpѲ|w(j ]95f(_Ep,19Q23>:-{`.^8^Yvm}տ V4" w7|QhJdPZ`J&6V=sdW,!~5tH%R0ȟtuHKg$ D7cMR`D%#D8ht=MUPcTl282-Sɩ uQZa/~d R s.Mz+PL[hh=kCMJuo&H'嚮B'X+0HorIP gځ@4~[к(|[AgW{>J@ ت+ky\W&Κim&+R%jBfHpRŵm hN"|25 qιj.&myzޫs{4rlS0$K=n5j ]WOX\ 4j.\y'Gq \6*3щ*.qv!Y\O *M4RRV}#meȩ%{b]_.PxQ%' K[Qb gDTۄŸE}VhR/@m hI2+a%=ƒyld7\nUx: j{N$<LuaL;'[zEj㪀``F]k#}מ ƹbl=-bGb_tki/ iӖ=ը 3~$CwG`*%"էKU*v B6.!qQP2gt"J8d,D{eSҷn#ګAZh~'RnmԈ)Чp2Bc5@.RM4og_9֮`}ɠ-LX%/1޳]^G @uFZ0T ƙUd/68Ba>Ǟ-ήm& ]|0(1DpXAWpr u=p%pMќ* T*ug͎r@*vD%X'$˯j;x/n(>{|"uE=Q]N8=,QbTSaPּ΢[-/& ^PN~+䉟N@lT[K{3@ɣ-D *Mb J<^؉sG+Өi0pw@(0>Fֱ@*x4T0;|Ȅ}h凥&#p-… @#`(g"HDjoVXjj**s8:ֱ) t퀣b~Cfo.TUnZB.KM[b]4 F,|%g,'H{Z|(ak-]#૤-s(E[S Pt6{*k Lbk-BICpDhe5-( )gҦQS` w0&;V(&"Jh u8,NJ)`e/$8  g9!Ej,h#/RQWX۾ с SPǭJvKF4IĿ\3hӪΰyY[qˌ;[ߩnR9 D1R3D̰/7 XdCq_"JNj!^vHA.'~,&uƆjQS$a- pyhN O^'ԆMDZaКbFK0 HW$ĎZ+N&t^Fsb]4eU`Eߞv7M̬8@& Ɗ`\he/)[7wVki)NC!؆󄗋I48n ܻ$.1q ęy#$$NJ3ƃBv^ @""X2ґ_ϯ@3Bz,KIx *AIsLgxpP J**XxEs#`ŏ]qk߈zMEkA+ (s81/'*qJD% XzF>f?*qߵi@/$ u@`,[N-M3[Jg!4gR T[̳n ד v)S#6̸4[ "TL@,!*W6{u;z~˅NI6!LFԀ0+u;L[cȤ>ӗĭ61D :XYUBhN!SYLFKߩ{DrLM4rylQp6͏'i]׳g}KIOqjIJ,UXb|g}y3~;W_rȑL zNB(Y@"D.9L0tyS6k#`*"I6m Lv Ll L`M:OK{w^$Re3}uaܟ 3/SQR&tvڙ+<E}`.@r&@k`j/ԣ˛Ksj%IN\s@ci'~h{:\77%:?) @5 YqhM>MG}7E=bG DYUP>5- :±D.;9%9dr#_I!x sR>r Q:Vj"7l\Ҕi\)Y­{Ld]#n2joJW6vZNyoJs fᝉ?qvCO7cek7>~Ǥ \Bڻ;V #'ʿw`î-Om {f}=o)F^>"IʪYz9] mnV<Dri2DfmU{ ,gFs6ʴ4wOq[X='˄֎D։pe'TO$"0͟h]BMUBoqa=kJ@k> 7Jh}őFb B? EsM?GH)+ $gl-Oo r7^UMy Ga4G%T-52Db wc IDAT*޴=gǛ/4bvo8c{ZJ+uvD+_<`MRO|s{E:{S$(KLKꩶnoΠ!t&T48ϥ=W$fw&@X yv}|;c2^h|s֍ ^*!@B[(x2 # x* iI_U Ͳ>|0CRs@4|v8#} }N~t`EIz_a&+@(Lf0<߸,Xʔ[cMaEpf=g%jڬ,Pћ,o7cMLd[^CO 9/BIVQ Paiv%AtIg_uׅkZ@xۭF˞%FhKzX܇&"8Y6*)cm=w:ZT {uŷprp>3WУMRtgUˬmi 1D,嬆*6ܟ,l##kS?vdg.Hl#rk~)%1N0gxzJGd_JPZ&!XePԉ_<2ˌ{ vO,su MiҨ91" \<2biȺa0}q@7k2@]oHfqNv5/s9#"" e஽* ~'Y|G&;Bu 0 D,CĢw*Af EXC)ƍy(K' ċϐ*mRb-jȡ>2 \_h Q3tۿ6Rl!̆mҍ6҉e8LaQ /Ȯ/=F}'joa&: % N9X0-LOA^Τ]-v$zo˞%-ceVR7>:W;lGpK6/a_~](e _} 'VǺ6mN¾0Kitg6Hz^-$갖vwj -;y'}h,1!@_qqz| 2)ԻV0?C{' $Z EX$)v {2?ݟ=~O~@I$@,9hD j)cKz%e?|F[pEijZLU6˞ފ)sN܎.޺S7Օ#~Kx/6=p>3X)4nWxhP¦͇uE2HvHEslYT^} L>ELK}Ż;z> W23f"P(u?#ƪVE}$j!h)Cļ*ɱ#>".N?w`g*ϩ^ӝIF$EɌ36AEP@g|qAe#3#(B- /IHzOw.UGg-^]%}oݪSUss>CO)>?P`"Im@> uHGj֮eM*4.#FX/M5 7 ?oٔ^ iLF=8nal6jukSqD`2Vm]Ğ_7+dg~h~h;m*gL%4zgq>FV&QAkn`eMt2u/5xZ`?ʜ5X |<9tu7}8%ԕ$4SlP^Ar [_}c-Kt@y=QLt, Xyp'AU7ۘm@0v݌h@W."QLw/},3-9Vn۽0 lX7?4ibh`I( ᣦ*9:gM%MBjvfs/_tk?A ,I ݉[>@Zu&_!Mt3a^J/rp>B&RG))]+GoQ>}XU37믺7&H8ݝRFK&l[/0K<T(9uR$%<{f 2Pt8t,7BU*Zn##ݴ4g>ۙ.61K\erfV_Xp W3vOkc5It!lg\<`sL01;t辍{?+=_'As+QdGAg\G-~rX{n|DbuxCQhk(dۆvJU`],l3o{ۏH*Ĥ$ Oj,Bԇ0K" 졭d+o\CLDFϻdԴEF(E06'ʨ Fжߖ\  3 b4rwӾeD{>$V (#G"̦B'XP('x0G&[z]˚xf˄< [7GwTOP z{{-7H:v&9Մ Z᫑Q{1"P i{(j:B'HM3+Zh)eBF zR[8 D~&Xqnp_~ miX$bVKQ3@$N`7Pu~Km}@'$3i;06*}k`2p^d"KӮ*1QF [7}MΩޘ=$ߔOdAh'n Pރ 4 }<~&)<+ =|VSs{s)FZLEWdLT*>H> YJz=Q˘șw->z5|KHe{ayrZG+G֖25]K{P;A+hEq&4+30TwW )PЁ4t,v:-4zVYp`rV~$KWf!M&EV_G7qDW&ݵ54; ?.Wnnd~Sawތ"]|xwL} x!z š)`#_;oY\ $NQW(:ve,s,vE/Mx7aim]}!p9C;27&XOڷTΓJ5"A<±~ߩ_/ݺg‹PKb7%im &V+4x7½3~-a]-=®ǘtCYyE /=в75q2 uɗS\U0J9b0K7/1߉v;/~D5ܤ0X4e۪Te*DL$ʒQ#ۡUommS&XsvJ-3OJ, MgCd6њy o,0H .؟s2 O Uc _pZ,`LQT:ᆦ>|%S_'ƻTƐJv<`HS.'C@uAЩu,V_"GB^;b3m}:h5U$;^HzZիTʂܔ_WI]4rbS&h`Y;D1e0oN$Zy -m oRgɽ~cyꢗjGP򳚰V&^.8pЙ[h2_8$kq"u e~6qMI|Q utj(Tc60-PcCo=Q`c97ta]f"CRC r#Z (rcmm_wT7]2I'9q5燉Oy{u0N7v%")7 (x]diet†Z2e#W -;#}7Xpjarx?JK2صk:h֬Q33.?RsW$e&QbO$?dca$"/)ZxԺ& +O+ u pC'ϱP*LV~.\( )# } ]y2^OLE#gx[?PnxTc_uˑ`[^ic4cwWs (_z}'KQF}l|h2g= QcY8[@1/-Udb帆zs V i)뻅dliɶ`,!nB'M!Qn:`&1ЍGWX[fil 0 <*/d!Wk9SQn>/(C,Bb|޹ +RF(=B;Z< ikk5K 1PÞ# Ԝ1uud⟦gK5K֪ђF(i{ImL!x:RoMXF+D["~CUxj@10)+Q3a=:?x[o* <^Zk̫gHe=r:(iu`6FGGGڔN?k։5Haԃs852[F|BS]Xx˅]_5d6޿mI-YS1"aG%i8 hns`bMwoFfh\6i ]t,evX4L Pj DoƕmZf E[#2yEXϥ-YX[c@X(mKL@}bޙ>!k~<t-% 3Y{'THFy '}gS\:V0sTcpSJTN,b  Nk<xJ&4c=o!, 6Ik=l~I݈9] IDATVkoՈ}j Z&FZ@{x86W X b5"7 |twJo9nM'9Aw5̯Z3[&haܮ v8elUuDaQ$HM2ZKlzHfej0WP 6X;\iI=&{:/;ӧ:yt ?) 'F047/}%PE"*Pz2/}0@uwKQї1 4m?tK<ȇ#iӄ)5ӵ-2~d_,_,$H~1T%8AQYd~%#R ׌BŽu-%m<"%s濘)&Uwu~ĿH-׵ Xje,,426DdڿhpmkkԸ"FsXˀ<`d }bb\z8u(c[+SËc|C=zc;ˇ G'CX) squⶆ5_i"o`cGEhah9ޖNWulkξ֥n6Tٵ-iS:{Vʨfd>.[-Bd9mLt̔ SZ1|ܷW3.pC+YMp & 43/<`VBDiBCIOD.#yks:?xŮ-/> r8,8 >/cMT>>dž%1CC"H Yac1rpgAS$nOCQۢ#!˨V̶7(y"]dW JgDm$:L> y}ǪD4+}F6`4hZ@ZpG}TM$)*vk~xc+B!bfb)<+'|# SaR@ÚjVkE9K@ƍ׭)M⤯<id~x ٙQ%* /*|BJMm3vϦ^rjˢCk;/$œԇFLr(X G +r:Q]77D%'MjU< @ln}_t}0fE2c bV6߻O,~tZiV] o8C`*i:tCH"*?,Du-ѓڙ@ùIHh!Gi4.tk'@4ee\.@H5!&C4C8}$+PNLZpLӯ ]:WᣰՃgѸ/[0)xŋ!nő1\mcQd`8Zk!ENcn\Sr#/ r&x`2 :ж!ja[ζĆ_bAH8luduCןXcGw>8-cfs E20ggϔ% aX|O@ar~VmoH ^ո^)dmb" '"G tEѫ?JQ m8 jnY xx>!ꅦV o(9I% __P4@=3w~E+&v >&Yw5?+޽v"*le}qٹv>+o) H1(wbt7~.&ʻ.HXͣ&mu/T*>`NqgVtT|`~K0@8i]m1^dW؉=`T7zɻ5Dl -ťfV)7?h-̂*h ,NV9^4l{i7bʎw-RR״;L)G%;Ek:7MWl01r kߙ7ل9BҦgLfү4V]Z5C'}ƒxq5'SM(%3ACHFeSh:otTxSbS2b\Fmu͸ 33ᤈݙ,C+" z^YbDO =y  I"턉lQC v-q}e]W 5&!D(氆ǚzX=2nΛ2GqD*l rkQC f/7eCF#tkԦAo}ܰ"Ļ׾ؼd8S8ȢZZ$j3Es`%*ذk?֐iZCNZkU\֫-ˋ/G3r-c-2Sёierq=+V- |h$F/f兙+bXVd4aV)@)e`UUs@Ul &Tl(LWYe /bL}(!'T@{aDo :JЯ,Jw}/$ݦPߓX)d29{1WܻeE\c_[`{F]Q|T ]tmuWZEx% >eN ݬ.І3 AꥵQ޾_q=|dԪ2 v`\F@2j҂Gx8-s>(gXY~b(9T3}bc,˂|s~aS srGBk EBN+oBlf#4@y:+,a SEUc~]8Qien3 G)FylykYяԼc'r{kј>0ܓHi _T Eb"GJX$!?+w~wj lcpBsS F̖ K[Sshn3 _$AdFW8tJM6(TL3x،ZtC͒3"c;)Ă{?x0N21P2jFFmupaA]a\0K,큔r9RPI`9)@ԂXX! ^P{w.Ϭ`hJ*DLu!"wy@SM\/00DD!B)#p}ue!"RV"A~|D9 EuXJ昣u]]>\φSr׭ :/Tn&hiCVD a0VhZfnfO*7h#+Ms\~5G2X|"|gD˹'"I4R݇fAQijX!$LAA?Qfq.ěD#c(% Zuخ#AD.{[z|H,X?wX@|{v~\6o?e`֞ɲϬoԹ=`yKPAPP&zU]J~ֹjt2,ZTM3S96.i 79ңG0gm`X.JmfA]PoFM,F'gqtR\ٯ Z`3,QVlZj|~Nwia_~Y3qֳD`SM>6&`nUBDvCndn;"/ e ja5f{ӦV QC~,oM Q?*bۧ$:Ԭnö{wiQ!eYVYNϱJ(Zh-#A/'4dOVCP:-Oo8cZFŬq Lq2Q_1 8`t'pLPNXZsDqftw7uF_S\~o}-p]풤r|\^wa'ȫ1A6fz[LiHU&#Nקaw]:lkXSXD|v뷈*iAڲˆV\F2i힎B@bzJj첷4_gB^u738[V__.CZp|X\>rÆ*Dz~g1nm:;/?ďmp2g2Hm"[+r3l~7/oGI.?oH1wl.h^~*V2jӣP'oY \i]H$,I+VacB6+Qd"UJj]iH`Ĭ) 8t'F#.w1q|s4BW5<|c1,sV ;PF4]Iyy7S<12$/x׾}-3#D~\/>d&BP&_d$L[XjjKUvfpkR;O,!O#eoEt4=X"퟽J.(9?esDB]ywhu09c΢}!ofG鯖+ݳ ^0C喴‚ZX4bOVٹՊ {x si"-x[kʨ–2NZ}=~萎x-uNdL֩! ULH6Hn&0Z B&KSAY?d|\[Da`01CF.՝-eVke.9- iID<Hs уۆfsaJ_ }E/`B2PUu$(QIW'J;C %x.ĝ~QǦtc\F-T$~^EC@:h]rKG0QeMƦ](ΥUyQhbZTAFcVFm<[`FBmO5U{o $>~93j'T5PK4=",Z-^J5E7 PqesX=/]ɷwKxl9`HYO, Rg]kJ4}Z^IldWȖNUsI@>TٳRxmJW3?I(e+P#U h=1~xͬmϜ(O.Ցbmw=hm׳S:Ltx74Z! '#KPP$xB/20 ` x>T%l8te^{xțQ ӎIM-nFAL*%o)u>)Vn]r IDATdPs ege #$/F PR  N EЗ&o<Ϋ 4V*αH"\<RΘ@{k@ 8>ֲJmr/WݍNm %q#{R})p3z(mngM+aL߀P=0ʟ|P[{Bw|\j) .ޓf* <|N lm$ &N E²!Ov@ rpI |㷐 B 6&:N>wpsjH|S%;'k]6oD" e6@bjI+&qhMIf*^a *+û(f}c^E;֕izII`-BٺGECD{\aWg#2ӊUM|7lDbMq"dY$lGa}k綠D_Կ\OOTQXUܬX@DB-|^iѠ$W7'^8.HYt/K*U0i"uF ˈ#x6Ǿ/߿(Ocfy-q.d(i]Uw068Yd?ܐ-=b9,PBŀң %_Owx-F?^9޼L*l qA 3;i,٦L{9K܉vU7g =H{!@kCLzK ۏFsu}Cb?>du; v%By`q"2/*gq,גO֝QҲ1 ՘ M$Ķ= QВt헟~zXܢW[k,&,X W&7_+TiIa>t2ۧTܪ$T={Nߜx޴V>Eƍoʼn.04~= L T-{7mx7@%WŠ_[u_W*d2[z7djK[l[9Et 9ZM{'gco!3%M.|mݷ$#c+Qiծj>z&>ܿ S!ʩJC[\Z>3sK<`%C+0иcގeO:~āAaℰȟ&lJJi{\]};T _ $Ο e̶M Ujil2hiZ!dЦ"!P- c%n6 ?d1MŅncDh-ԅs?A 4$I$9741z`e8 z{a@ۥ^6s1{Qu}/^y TV|,.SKL3es5=Xyu&N[,d%6LIe41-tQ(9K6ea6?&=4N%4Dk-zh[P$ I4۟Oj:NQ 8LjylflȇƞOB̜9J:"K_~<޶4d{,xu\0s+B|rk Yas}QsaUj1OY Udpt|\)տEi˒ Q[= , m$:!I٢@otZ붒^" nQ޴aŸy++bZhԙvg6]z,z]u߀7]%P 1͡{p*ФVaڳ>F:쀼'÷UqLS?@!ka^1O<,r gK9H=caEGGG5l`gE21 ׿d?gy9mҽ7a=T7" L!C_N=?wG{QC’.@-d3~9ݭt 7ŧ 1G#`2/Oje U=c9d`!;3\}EFq"I5G/Vk?{_'gU{ߥ޻'$ Vu0 ::3_"n8 0ΌȨWoMgTDYPqAt0`$,[vt饪?J9=9X4)ӳX( <.{Ҡ~pM$ s#33kl |cA/ĆA0w:}+E?Xzҗ;"A0hxjtPC^atQL䶋|ܟM:dy4.h3pXlԹ?,~h/H6|ZbpڼV{[ǿ`|<)[Aوnh㕰DAhpEoΊ vT}zH|݅3y4CIBذ.-B J8=M +=YF2@ dHcbLf9*"Qq:}tp< -^q\T~-@?wVLl+Oˊ5p̖-[N99a¼~~zםb&AŔ[жn="aA +D"/O A)!$W+Όafa#_t%e^N@-vgl\"O^Y8[j7\It8]L15?WmD=X~8KyCxA+ p~I2g c@RdzMA!lٞ-YD(i\P|xi"q0}~׭!&(3B,01]m }Y5uGLG8~$|V8. YR)]D(y<%([Hb/iBtS*"1:"ۤ D!9:Ҋu-0Q#6>r?Se?cG~V y@zEML0\<r%*JA3Xi %LrmZWrfXFkF<4~_kcGi|#j.4N%Ao%/*[l!F2{^扄HTc" >%'"uRzfG2{'b/ Sa;c!_ 揄FA i \=B4ȟBU-#ҢihNlo|h(&I%مcݘ_7&h.+a~ U5\mhoF( Ñps`+L)A'BV*ӌ}졭Sa?x4.ҼA"a,q ^>UL%O%A5; 5: UäH].9َ,6Η@zd ZpǯFJbygi00cKp06\0Zü((hhЅ)j$0HK J>/~ݳ: $Ж:)#e;sn)A[Z[^V!$Oo4c8ZGF%60,e2h1 a !2=ŇH5;k"v@/Cx_Q蘆ȇi`|Tp*sDUeGZѓ.P8'.8uw{{=pJW|s|)Z3'RKMݑ]0BKUg DzsZ?K7>sQLmxlLkiYM$$e )NBz<:: }~ oA GF z \䃋ʎ"6^뛅؊t2 }}ժxRy+Vȧf\m!Zji6m+Ȉ{/D/.ҔԘb=E c2@T9o1 Rgu Zφ͎ ]uB0_/`1Ah |@ǦtRXh!Eΐg *R.tlzE$,>9ժȄ7cѧ9}۫uU\~wnMK3EtQ;S Ȩ@?"ht̾!]ORO<*!ӛ`3Ւ =ͰPb+jQ>h&irhh WE=zUܿWƩthmb L$ É猲Qd(*Xi g`d ksp^z5[p+P ;oŒ) u~Tn]"D!^%SxLL{=xG(2R]^q‚HC\]䌒șxoߗ__3ތ,a7h1Rڦ8֢0PB#11 ~5992B}k2ӏ|.U xUc"UO)={yb劣#,BGY^9NGRO79~+`igc%'kԒ&ϜPyf+ݾ҆@fdp!Ȅ9TLOSt)3R_1Iiu>?t K25/H[%b:kQ4U.rnt +:c@^tG_BoҰeO `:h?>£ 'T>^BE-;Qb% >jwm $)ip76ept@Xc9a^y !n"hwSbx;^ߚhW&BcϘ9tD0)qP ̛-Rԉ]p&y6JP,€ m{ּw>~5sѼ&|]o ޴wb[o.ܦ?1Glk4 P LYZ]=W t5Yy/_tS+ , Sv_@F2&[ؔ"P i <6 5š0{*~}>MG{-qY/ d佁viw )Ci+kJHm*b1`I i Y2Δ@ghė+ ?]~[]JB^B<='8>/:YS Zs$X$J)mм<K;^hGEB QgvGfF$o͋dAAc'ɷl^LE m`5U3B,ёtfxgqqCЩh[UN@_ah IDATf+Bz#%X_PnwlΎ f0dxa1i <ڢs0_ZP~7kwދ566:g盋Wv&H F ]+L,XɦT烶]ѕ6rl5>.ܱ=yj̠9@k&T2;[6%R)LGa}ŋzM7zz#ޔ(m9i&N%H ZVa1Ԭu =)*\g&tJ>ZJr@q5z0b&IĪX+o v@~/Ӈԅ?~Tae)-&1DTێ~Jp/Qi2jZX\awgf!)fh5D)*f6b1|Ĥ) ptF637 (լ١kyB7Z3cmh 铀Nؘ6+jž1a^TJե"CXw ͸9̂2sx`{wہC fQzbx 2iPJ@ތE~{Ƕz3;K[m6^]>u6y=kRn=#CiVj @(3vI?[TJϞͿ|'C%f?DB T*wTO ?IP%W_vkF!R6z{4b &u"F+3{ܼYz׿l*Mufgt1zǗMMo}Lu4 F)w5ZهO3#,wS ]P_0N; &͖8fLrn 'g%}JXXg 32]vh:2WƬmK<]Z (x0b!(T6^՝pbAGǿ|}?ո^J"NTmaH<{@m+om+f@xLw0$|4uKf 3m`x`[m+HO6nޙ|c / ` _XwMOnj}"f3ISPZ5J?sPQ%vJFR;8ITK gp #KÎ hzl{hI 76Z%,~c,(0m6V^@oHUR)né,|g,𑱓uVyRku D>XՔ/>H52lU3O,H8u Z2g=+e]eg]% >K_tI-mq-TZױ3cǂJlbUA;X:Hswh󂵺$ũRT†om!#l80Fupn:߹N|ł1N8P"#Yߞx|ӳBQzqc{C=Lo9odѬ`6r2#ϑgOqwޮw# o뇔] fIJV!-33ޣm"[GXr@cP)^&4u V#褈Oe9ECpLZ$[+^ dkA@ k*PYyF ^w=lV<;;յ ⚳jgT2[vl.xH/<9?Rw5i= C@'”Q/羍F@t`a8I֋Mq`9;[c doY1r GS46cs^mMcӵTA7R5aFTGÞ|bP'V_dL0t:QE_'"m#(Xwy 5*w@@\XZ6te- Jr1yvC#^E`7i!%פ +!%+Pޙ($cʡEkWFغ7en̘&sfhͤ:~@(ń+vڪD.Rw~ntB8! $˟!_K2WXJ嵓Z\K¸+j f?V5KPjH0J0@LPoS);r:d#O:|.iUپ !_f0:^ŵ HrȨQ:ܐ78aRJiT$-houO%$.d Y+kW5~6\KjY) #[wKMܘ..^XFPL{n;(Dci-/DnW!4bh{I RB$ L*oG o+}cF*kz3&}c6BЪi KRH! a͋Ib8/~CS)@0Y]w0SeQ1=[Y@B$XZ"`B۶7n]nғF3`vXTm]48e3<+T_8B̷gf#Mvl>mk!t| 6x頫 6j=Wp 2Xz.^7T;:@qA447T[-{`@؞vC UWqM_J§$~ >-$yF]/cҾkr)V.}\WIg殟F[+|3gydljf>" iOz[]I=44[th뚗#/ղNLU a;a3Te #_rD=b| *3 m#>.uztF J!as2 )2bt̏p¿y&hE*U!u`=[ *ᛁ7a 4~' l9 w~뱫i"A LHzQKC:˶ިJ,p)sK :Hkw1?Jh'jM#3M˶5~.| C2Z(!4X 4UmkRץLB?( P`~0  #$zk.G@k5qJ,h+ {FUI-BUf[$sp+ Ix'OW^-7oY. ȁUm`Qq.U+Y%JkoB?8(Uyo~ ]^S ?10=S=K =ocۦj8,:h-s1yfZ%yʀIl Mɔdi,te`gI`>4_{`5I*!. >(<֟HkF@R,Hƚ T 11a l?7N>C@YaPqqB"!`e^^S><{ovF&¿ I:< 4%uDˊ#Wl92VBxrI{WG\_|8o|DIpՌfE%$Q'/(WgLK!xsKwR0usW{']m{[k#keI0WBĐÒ/ٕ|>lr^%`%|ZF/[a#rG)KHb X{3O{Oǯoc ?=3&43r_fE^LYNӏ F6 Sl ȦeW(דc)ٴ𡿑ZQ0 fAK1C;)$FIMFh<:&fRϠ{O Řz@I1(:ͨ|ƿom ;DB7Xc %D"3.RfeƊNI:P5¿b: SFEx&Qfl+MRː__٠Hy?w2v`Gjvٛ[^iܛ>&;|ÉZ@ &pjg^#0ZR3V,6V \_yd͗x m/#Ŋpţ)RP;xSMl>Aڛ%dw6 *~ӧ wWC`ATJ+`ۉvۨ*5+ ]9V% ehz7gMNF.L8 PFvj('MYq"n"" sTc!rb`16Q`Vs%0T,=A 0s )"{j@vhgjPX,C$dCEkg/xfdBJ}g¢?;4 0ތ}ቜ QRP|mY{n_oQYS2!ٵ{O($:] 7tx{<H5' g>x0 ߪPam?|A+`39B" @AZh(cH[_4'Pf`1^(0Q`!(ʞZ6?wgV5B,qviO"m.Dȡ&-@٨odA(`ܷax:UT5,/;F2fA X X3X3yяzn2kO +PQ1 \ @}#[ᛪ9-C{Nh\Gs9U$DBe䑨Qkkh%q#g#ކ,oZe(HG%G/ b,M_V Qx) \[ qy"-]ˉtzQ<j"e80&t0JLJKS421 B$zbNT)%Iꐕ"1&W4XqƔQ Y#EH`cLUӗݾ0d5%5x~V8ME'|!A<57f:W `#<$k3;m-ZsgVH|=Gv3f@ bjb r[w{$t-x3Vs^iyHK+o B DG !Wہ _vENJLc{j*Vy3Qo"jN s1C$&zG#IljeeFcfT"DL ӛ|4H/:;JCw:-5dԔPuĨNr҉cC4`amoa%sښumc}տ~4K©3N!mrE67)o L_&ָz5(z>!nB\$gelei;pȃ-'N$:ˍtվSa}؞$d2,U0$Z:"9ۓӗc#ԝcTف;"A\a;3 L,:ƪ~1+|sE_N0:m8p(Ct u]X 6i]X:HnF!,^"$HDܘֹ4.oo)Xo$|-=G,>77$NC IDATv8嵡Arρ++F*|ϭXo鄸) HY~2~ >eEW鑌嚴d^  ,J il9}.)b @ܡMƺZBKT?n?ń,Hos36ґHm33BY^TFN(3>cɤ, +e1LH*|fʗTk챝yo֥-wdyނ}6~oqt8ht/ʹ/LgL{ *|C+K744Pȟ -fd!h-$d/4y;VDoC-$TV+ IC =+M_!s 9췪M <;;v1H'pjCHz'šD,hV 8DJPS0`si*^&1PqJ*( @uG^_ǹ렫J !O=HRFT2GSh5iKZ퉫xg"'M9CEG'%8+kF)/"nn-e[ʟwM2rV-mX~o<i+7/#l<>gڳ+jf} X3/-]˫n !oJm9DAvZ3!F\Ix ș,4eahMȎXPm0ӚVSnv38$՜njeflaMXvD9(O  A#OzF4$")VL[чFr-,ȡ5:]~56MTmڛqgUw;LqiOW&8Mj'Ica(l?^2HX䛉zcHۇktʹ1@ );A~YI@Ğz_jͪ5";B'ye_KC &_f-&%6KvvgoxӬȋ_z#U>mDoxu 17&p&&mMfc ZPakO[%GF=l?b EX|1L /As?bL)>rB_W6%~xH ,ϰ]RgQIx[ec! Ͼo_t} 5`mO\g"B'}gjRmw-$EҞ!@r+O/0ijLj]AEӑy <~F4c OyG ,- 1:a2`5.%OLFTfXec&}'@?م71bMfb յkV:Sƫb3%˰dbDiMt'b lE*et,pmO_Wa|[%zYqFTzpv0XE:&Ý{1ktwB@x=mc~L&ƴ/{ .&8%f_+AĔFb}[|(i^(ץR.R ZQ& ^x&nZ:B#~Uk&5i-Y ַlYyWܿ;X唓l@k9jX4[XA[ k .x[ +tTt(#Q,G@4 Qnet-\ gSzjr0?I|*;/~E>jh, a.DlMӳcw7EN>!6cş2sUZSt>B ͣiH?X7{o3ZA>%Wa\)0Ub"2xdMf7RXX(B}QMƤ$СY?n~Ӭo}W[ReJO ?b;^)}Rӵj? h_8/`j{=`kB@BM!uSoCM+goܷLc5?=|_`i0Aj)jCX7+y1Y `_,xzJx5obiԀH[XV%((M ੼ M.v79wH!=_is&> *I%/)|nKY.a szutb?918D"J2pDrKӡ^SǸko+NWkܡjysoǢa{0&j* a} phP,"=6gjBŜKM/AǧY0)XMI)Kk9?WBRSj +<Ʉ-4ਦfْ-?Owg&KK-D0f7u> F $Lϖۇn\=_j5"Jī6|$,HlfM/7z%UۿĄBk` GDSlkrbѕdf(+d!**&McӬQxC?ʠr‹ҒjEZ8 ' U)x"\{F|-4L/2981 !Rdt%}LڒfiIE7bW}{Xw,8 6C$suvS_G˅PWنpYKY`A걾íx$3tjV2^/Ӭ4.?[]axiUXa=J^͌ǙKlqEm0;zqkw2sN|!(!NW%&n+W3\WÅ~~Bc??EzDHrY홭7o:@Z+)Mۡ3{kź?Iste}˄w'sUN}铫yjxNʍgcd:~;4; fP省njc { o ³ēlf'nހEBp=u5sM$cKIFOĪ-1}5=s&nϿgklsp;/*Y1(Dw J@A!YjF ƮqV{n0녒l7E:]W9xpCh;cf}Ty2$[}]5ɛ=0}1ǎA7fFsI5[`Ֆ/W X*b}&+Dc?,/ ." 7m09W |+Wbg?@xF]C6vJ-&X <ܵ*^\_Rw#+ 3LNZZ)J$fR#ӠB{ o@Պd ߛ{? `B^f&//_̹w3l|}@ZEG#$]*jv*HQߦo[pB=}Ƭx=Um",VHr [OݭpEEp1ҒAfR0W&Ys~框$pGj,IdVzdV.Jtlړ^NEu 5"mkL$&lwi{u>ڜ{DkNYtjI\rF֐T # p2 i:hЫFx$%f̠i 0^1-4-mbLTj5R$[VNf1Q4%(K/qfhWWx\|'3*S.D{>!Aj%|\y0 }k[:t}P]Ep©ϭ"؝b`kɚܼ^9ZKHZHؠKZ*I5Ȱ):c?\*P""]Bd8aӃʓ͝}sq_暟WJNΉ>LMVHbiI RHC=TT2YYvǚjI<&0M~1) -94N0:tKaw@`buĸqL5S jgORa'1ζi\Q< @!n"!!!`X~n B5"%nГք4kj7Gүl $"|oF{Bj7$s'[:N~+ @ VDŽ| xlhLj i?Y䠆v?3a>fITtSj65R$5SnzТ08Bb+ {D*O>xn;0y8MĨ >ocAUN D.>,BMiCkUuEMAz}8lo5®{)g/c("hizI9@?eW-~i&R=-TI>M:̯4mб)FI5*ӣxߦQ$Gok䚊qtd1t6)'n>:9Mq3O<~LRՂ 5_*3Q+=EEmkEYAL&~ٳCWC+؇>g3?q}{k$)f VJt rb=EI$kx-Ht0ID/Tc d qOB|Z 6łқ^~%u6S%Y?(`:r {pݰ񽺉Ì{&?Gpn6v/XԷϱ4م6yꔙXBGkl̃+=7hdpD6{i#W9Qg1(QL|nK],t0= Һ46A7`YYÈ8ܧDG@oSQ`Uy(pmWӬ[n-|S8hQQDtW /~y +"~p %\h3!6$N(ܿ Iqͧ%Ql6n%f|Wk a]ĉ]n:8ZMn?O >obPjU`ěQ`I9ӹ-6E}:jOugrVmR+" u8s!5U͉&Ql+$Ӳ"f~aKF]T8MWgt71gPI|Yxa[)'Z)s#N[7偃`X m}ꉇMI(NNlFc;Usp X1MHq]SbPԔxRԀ EtW!BGax1Bx:$8Uv$l^Q&MDxՃx)B'/͚v~LfII5dH6_0E0!gbl 5R$R2(˝wxTؒxD{iuu$OxKyT+_^u:S.qלn} oG׼fBE:"fT(HD^Oh$i+x|L[.YP#$ Xlט8v! ~e%Z7 :=88oDz~SϮt a}gu# UVsCGTl(U} fɯI#?rݞ[:VY#̥..SMCm | .Z2BWcW/ I99׵xrfF_zz$v>磱Xx8Scبfi uɰ6"O7@c+Ց?{K@g,x9ƂCs8g&Ҝ7 LۈJkG}׍`I*GsTTT5t[&=O` vH"]:SK5:N؛ j6S5{mX3[kL^4k~QRq{5ŦDy6!ѡ1I5"x lO'd=(޽MIŅuTg kL=n6a1gN#{q٩b[RJ;Œ^p8 7hnCX A}QcARiJ~ӓr\5XD? oUzDF\tA 1:88ig_ IDAT_@4#wձ*?=/ȹgL2>79i 0qu[@@HcS#[l/Qj6w?@ l g}W:e#o0$ &m7(QD@/uE*(03%Mapa!?A%+GWkU+AE9#M$|&N$@0#t'M =RL|F= !zz#qdfc4Ad4-ZO ؙ=g5=nHH+teK:QB= [{)goIo,{+r`q(QU$ȁPUQ`bF[6| a;pv=W8aD! *m= :h.-v"fxI԰ADjN˿M[Q`44yZ3 at?* 3J>ND׽)JK-oE{I,[gILQ`VwSNv{+*c{-I%mPa C绊 &jD[8XbbBE&*^Ta$ˑpd֠%w(wx9^ WiT 'gDo g"UpEϵ$*jNO'`Tk y0~k]G9$tKus%ZE/'0mW`-h܃5nغ cv["5srmIvht>DbOq6 2}?pV4^`ƒ)w;%Q#S7(%Ld6[e $~%Kn0j.TD !'@K0T lÿ XBDBb_ ;*L@ \' =й0Y3p3qN, }@L>04(ިp8̢%QN,蘭m CQߡ oX%QuF4+4Q 56|ރʺsܴd 84ZP+lG<0Ԭ~+b-{l}OA3\ɏgej?Sw*"܆x1BU79wpݴNtwR$ңy/yt2*ퟦ[3}#Q#keS#{T *{=択J3OEV gBAI%Vp'iU'E*/:(ҋSUF]ODwE4dr1$[}Vq9^ⱮBT8v- #~ݾ{Pb&×hcbʋZ&Q{>`/&c)qss>WtSC}(`Uq$}/(4m wޝW/?{~:ԫt* jeTS%xJ^:]._1pf{@4 [OdӷRy]aPFP#hjvcCY&z@Z: &<:K&?ng5{̋\@cxI=(P LkP$."iN%+2-j_+PR9#w>i"b . |jf^^zn9 uz噜(;_BnUF3TN,钀* zp$u%i)-.Q->o+`E/fL#=(1ΉuDz2ZOD)ʟu<APNP~JB'S{ n=7Ab$(;g+$'Ѻ#&#.Vg}l] &+i1ű b[ 3`F-,PqzipQOwP_fnzcFگIVLZEwH +}yb6ABMGJQp6/xu* X|橬#%9^Mo=Xy]aLjf4bt yq%q-tjiA\, ΀ckhB #`#gb<5U b[h c$?<~֌{,G 4}Asǔf={YYQ+Jy'oJTsN,\ [Z9aI2uEbDJٍhqK?[Z^w,0P5כ;2Eqm?ZW8Wɀ%EhA3LS 79gE41j°>3{)DiwW ^2th8A$<+cTȈ(pb"awg.nw.T^WDX(,q6yI94sKߩk>e:0[wXĤkZ8өkZ.g' S`D@%Fjt7āc{|+Vtj3C5s9$_+*rIV.*iVGUm`PqP7lY+*Y C ɸr&O-hbcw{p5~~?89I (C\ l@M}ԓL)Ǐ bE 2/f{=BH)_?eU`!H9XN%`HoN^T &޸D9_]KJʖTݢI}x3"\ô+4Z#}}v^B0DL $'nRI bQ10T:q͙gU-FQӴGDZ>d̓`ʔ}֙?JEea4 [\!9陻VP^ɟɏ0K>jmI5[7(&ᕾ1#%f.&Čő)G^O?>2un`1I¾-!;׫'O=!ƬູMNH{-T)/шyJ԰:yH%jF 8;‡G n{86+!nP8CW'XKٺ3h,th1MiQfƻ ?48X+tR+0n-\לӫڡH>Ғr K9,*vL ]ZU}qzSQaNWnV_J\7ly&/?)۰)l/3 YKX<'&o7(@T`c&IB77cGL%#3q$0QXT*M oA>EX3$ %ͳEq_rR}V,V&XT4DZP^sﯟU$cЗ7 [@6qEpxmĄpVÈxF$emDkc88߫q ~q |ikA\LqMx[%Z44 Y `o"1:cIjS ZVժͪ;\RD%إE}:*+"L  ,wlJ ^|l~BQ„E Bx-J`c]K`g[]  `) [^7y_!­5asH[Vg1|E$( 4Щ2S' |ؽC[~5VDX%ÿܖTY=7w cPe x3 |8RX2dU02$-ނHpu8CqY:hUN>HNEOc_$JVnP.P0~GPVQCMEY Zu~n.vn)әܩbY7/j޳#fB ]Pjh613Ѐ`oju/0;ݖa0l&FGF-9| YR+K ' & 7+oߓT7|mJJ9W`Ƃޝo]8*SW \іYz|"u}Ɖ?{6{Ճijv(K֐Tz0&$Վ71^f5w@ rAw*)\`"p.zBbx"Ud`V1\yܑt&{t|BaS.0F &%3 A~4 L6޷g-͟nRŮ~):1;`IyuuQg3Pԧm jr. <3l+m{=0uKkӤykw(VB p6N?lbL .6|2d/dy07FC!x \k(N0şW:Vj!Qij!ld[3m>Cg1v^6`KajT[42?+S0n,^9j}x}B7׽C%pr9޾4{ThZrUh>%.M鞉!džE`$ f0cpR wt5\81{R \e0&KAN^\],j3}`cٯKD=7_b#i(L򤧊OvWd5lzT&/7~8Gi#SA$ KP͂h2n*kxIVkkN!\B=C@hW"|[{T[R,xۦ 0p~^\$Lp{:92/vd3 l9}#Eӟy$@Dr^㇧m˂wdsзdz;e#> ֬A n$!\р?Xi[m g0 Hѱ$zۯ+'FB  mi|dv%u KSk$a_DC$։78Ο@`d= ۩Si65Ȉ@˥=u#*dlvS%UV-WKoR_8E֣y IDATE[R\k{٫HpKjT^wѬGK^{%WbSFucm= :^jW}@ߑ@'s%^kEWRl\IL_]<٣J 0>k}4ɡ߫.=翶AQi}+?ҔК5C ޭs@ EDLZė~Q?زr[Y2Wnν* }mܶϾ-0 V_YK}K x #; M,pq#=7 &Z[7q1 xʕ$qjx!Zeӫ/c,|H oY87*\c̀Hc{4zRs9Qa(0FJ:GҴ!ɸfqZ`[QTO1`a%X\ c $3yFY vTs fʒj,Xks簆4mхwnKvvkԅq@E Wp |fʝx%ǩaf6:Vu9Z ,k(uI&Q??lWH2 ,WH [W}%Sw!i݁jcӊ+(4pabfK'"fPQ>G/.?3a+hbꔻ㏠6pk&7ZGhD(V#=v,b%$Sr8gpw[lW'5xkRKA7QO 5G bҜk QpL?!Ld6{ͳ^IӒFTܕUPPDXP<I\^V!ga"WɒJ¬ܰfb̂&H`>4?"pI/,PqagXcZV\tinT ܲ'%eOD5rp;܀fJn` 0$YqQKHpkMnc]$JmmϭGPpCdTsڇ햒:[I,W |CcQpg`Q3d!,gEݢ 1um(WrW `.sҟ s~ l'q:vߗ [_S×"qWKcrDWS#k9UQ͌&2e1~3dEC0dw[)cjqAQ`f2j5!/~$-DaO:ý􏺇ziR)IxkZҒePp 1ⷿŷ=U^|t%D!$Od `[G-q6F2l8*lG6A׌_P=^"$ (vj+L_|z WoI$l!W`Wy` oYO3}]"*(4ePq>&0pv-G U0~o㘵JA\8M=(t ."uq1nB zBೊK|\J\_C<ѳtϖJ PV#zdk"pˢHnugn侧eK~okCEҐ84lÝHm>Bk\UC$xW=J@Z 8.~3D"uTV[Eq\' %0z3ݳe??W̭:<4 2d i݊ J% "sҜU  VDXbPH\& cno1܍@|tĺZ܍Q6@N ƕR`&}M)KtԦHhKvɁ?"50zr.f92o~Y6&+Lz 1xb9eUVdݣ8NjnTx Ł[.JX0IO]D1EA!0I\`mvro܄DJt/i2EP8"zdb;ʊhO3D~%ېa gԎxt0?U=DyDa$DmeWa_PO{y( 1%٣X6*5ǕGJs9fvBp6)%.*21uHX}1d IOH<)Aվ3CHn)0ߏ?6@wwM Iƨ9;/{+ Pd٫TXav<1ZۋTcƮJ„aJ[Ơ+chCQ8Ai^/{F;NGyGʏȒ=/陝8rGplE5Q_9 E_lQ~\bDe9kf,v((4xp+[dİnLRM܏J.p4m1, ߅??KLƝ $\.9MN|Z5u=?WlAY# |:gejc2L7{,Bk(z՟CAabeI ItU|J 5Ɯ   s) `\&r.0J¬Xz8 邇HzBϸ)3N@D۟ḨiNwuwMCE}.w}`O*wDm.Ζc&y}s7* Qza=8>LsV &&l.0je ͙ p)ܤ޼RXg_*~w %.<5go9&·A)I;e|zk>iP9 aH5$ _8af[.sW2ßa*I<܃rUw"`ËQv`̥eeɷFCOՒ ӯK#JՙZ:l*7G/^a{><㶤1-G$&#; !^?&q=Dy-kB֤k\^11pD[W n܏a'|9sz_Gi/ $Y,.^9/^ަpOn$ .̊9NF(ؿ<=nDBBR;Sc9*V7[ . 6ƫF/]U2ҚʭI/ "H0U8>[i1M;rVR7alj;$r>~K_@DM" x.zIݴ)Ga~r`|djawAX8G =`ķLwU FQŋV(\EL ^1pVʬ 0t/ f>+Xk>D)zI #ƔJ<YΪM+$m I5P;F 90}3g\sB" \Hv*3LZQa)nAeA`&2悱 E5Ore5s!k_oxC萱μ)C gI!M_Q8 g9DqtlR+8%/Jxhnħ] *ba2x3Sbt5IǠ~߷4KWZ^og2\ TlK/,Bz|חl*ŀA= -T" p6a']9&ו^;9.q`bdp74'!7dA,TFa3y|r6$E]Wx]jJ ya/'tgp1z yR R?2ؗ08IH ޖSSYz4 Lǵ`*TDXy2[EN`xQycf!RM1 b¶kKl=}z0c\BnOKZk'$n.{3q_$pT8\ n ׶;K/7(*p#>8EKF|Wa[xx2ܴ+ T~J!0}ncMXA\LsᨰqM[tL܆*% p=n[|m0|#^tت&ʽwЃ_|O5g_NoT[)oIIpbcpѵlu9ghQaj8*+Pj E(! .V,|u;_+|z'b|j,n MyaASS#.hjD<?_vh_fdUt7*\Kr}[nwgǓnv Vp E13nqӦTKL[`7 .6N aWTQaq .V5U_(LR_#SaKܒ!+*x1(T!1XJkU]-@Ck2| BE\ 1 -ߌ /> 6fB:? WG bZ[q"<y4Lt\aaqV?čE~ _AJQkF\an;mvR!f HZ1pETMuo`>.ЈT" "?u˦TKL-~OA\L &^'W킸XQ˔x*p=܌ K/-j[ "%.kDZ.: ek n$E}:ƠܴXQ" ccYV+I̙HX#9m+el|f <=xM} '݆'Ja` !qd>;.6Oْ~p-2-[#JR+  є ڡJR͢tc t i1WvA\^ l!#)>}|A}\4gN`ni F(%T"λmP(In rWV2 n's[Z +"*!u`wEI6Z^ * dR.^>&nr^1w[ۂOg.DWSq~AH,|'>l/oZGXbvp%0kpvEi#*W; +ȸ5O lS9BPaVSI @8'* 'G5twb "?hksjBLbS}d1D1`^VFT\l9@N@Daos/(> T!**U NH]wT" Eq nuӦTkx*`8nDA_6B6 .,Dr!dҝ=߼_2 nت41fe3_`h#>,ο0P:\CT֋'6n[|mȰ< ŕ~ e9kBBZCR  sF=Cxc ͶV'o 8LPaVGkH07JR-P_j:QW zBIm1e)^HX0m!NğfVaɽ#"Gb`QnJ1ʅe=gJF6qQJãrE"!Ž5fnt^tR+$2.ݝ?M *~לU tsm!m+qbK& d OFTX^y&% qG02ۚ#.|퐼Ҭ+Q, 0sɌӰRw)"0(~Pb1x^y0oR&͗D;d"tdSJ{]٬kVܽO_3Yby=m'Q+:+~9IaAkIyijZ"K~ .VTkpShY0vLq87v#EcGp/sp)__ p 1|h젧GnPo}2R>,i(?Z'QDX!$͡G9̸4(*bZ2"M |׭}#A\#o㫪}>' (*V[Q -Ukz%PBneP $@dHQ(mp*W+ T ΰ{Pp>䬽u.Hc?{ |DQ qEZfA2G޶+rk|Yjx=2~/y*)|+\g &`hFix[hM9@rTRp {cɚLX8 |t)DGnD#XZ4;#CGB1 03e p,e(-B9UYCjL 7^Ad}) Zog(d^}jvr!jg@"",8I.:* ^,&5zxpYV=sąH4Ǥf۫?V)gVB.3ԃ}x=&h v̩ HvC]_ 3,", cm1=$jj<)R ^\ ׂ> ViH 0ߴnVgwzuKtv?`#l5M睻1S՟SuQvus7!FX2\?;ώ]q#rąJ(5!G `^5O pM/wY|~556^P_,9^QR]RC׬i!FVJ5L遯c@9H=!^Mcq!d4pgMLte/dY/{.sf6NuEШ.G@Q7WT#!"BL ߴתσ+Ie*~ݛ tL@\4~eGdTa5t4 ވ?'.T?6I[e]MB0:}eSxdt>lkJ5a$5~d(ĝ E*8P@@׈ Xsetį{"?nooHKN@Sp p*p+YWX3f>#;BtRͯ1MTIDATSxn{ĝ>Do+`Q7_.?!7(Bk𠹩¶ i-%ƾ|z'4s͚MoSEDR@]杺xN3hV" 1wL ѡ#c~2}}ǎ|'EE"ˣ!"B̳qȵY.S" m{HLow~X;=G-VѷP&ZSeYNVa57>"\`gZq ӷ;`>c@\* qi1~8 #B VQ =]D#q3jKXq!7'XDXpRcT3HᅼO$uUR9ef:_Y!~{Mؠ"{ssd/q2w KRQ vG,qj""‚+Z Yc23hB ~klO@\*ǯD< =(Av9g/FR(MWG5MmE'6vknL 9ȁ[ͭX>&YتJXiGb s@xGvąCJmVwdV:Ka  *0ڐE Nc4.0-ZgđuC}Z[^ӧbpE "SpJރcNo7ąrLg;r2>^R!Y5S@RS>T 2Zڐ/HAw+ elufJOM'nT蚸. a*yy2}r3R-V<2q!jʖqAxlzQ^/ 䃑k;^'FioI?xqUަ_CXJAw76m)sS_ naIv-ЃHsj)Ŕx2;Z*}eØ8^ZDH콷pWtamHI>l hqLix"ԿH-- Ҳ"GVS}a)ɢyxigd `-+0"+6nsJYi'(H펐D4!khR͇H<ޭ+:sI^ndXٰ$M#R'o+mq!Wp3H&hT瀸P]̸jҿ23ڐvgsAUmcWy{/6&‹FSڒ-ԗ"B\j,ϟYisq20ı ǽ^̍t@\"UI`qi"'`1>E@%'}HRw.˲'6Q56)`MUM ا"B\D‰ wT1 =8ve0=0{dFvN`|#rv"$K wL3ӫOP&P]WEpY S+ Q\0?{b̮Bh"\ 1|};`K0-Y]2ڇɦ[kq0-L]Ed|jimHckg<@"&m8̻hą$Yyl+/-ƫ2Cc"dXp[CiУF㚈!M]4ދw Qd֚zįkXkvq 3OoJ5 p-xM d>krmzۆn=ݱ ݱ(+C'왐V;dtC/1Ac,@IxVC"‚)b% .#wL?ce\̩E>lKaӌ2{`+*DXwE7<ws*('>2_v\]gH;sГK@+@`ّ5#o /)CbUfxSΥT;c{zo:) .݉Yx&dW+ ?uD4<ۯ牸Sql 3(2^3AO+v<*áLUAS*`"/- 5#u|?(c^Bb,.rjtg}NAJFFx/]5FjlqwJQRP'MEE!b%چr$aì ZnaLj,PGvMm!/@{8<ꕫ6\s"Z f݄M! B{~~Ly҅RM糯QiΙH3"knzwl4T G~ ]auQ֥UBKq BXR[㧶NsT3Mxv= Y "ކq+lV#)LMǦp)qzڂMǍ'Q!sEWX3f>@NޠM0\hga؞+BeB1;R[,FW #R'&l ~M-;fhR?|-,SRQ\pػuQe I*=\!lڰjn9]DXIC邹v08w;]Lmx,A厭Lji l#ӫ c -Ch"OvUD$,",r9) kS'HaTicLx<a()v\{zkM@CaԒ[H)[xO4KlZ?j H] d<*oK""‚5o$({S9tqKjOtk@\̬ĸю`•.0,bXٰnɞLO3aÚ cI=lfp>2O7!u]scJ ݱz|*G4ocE T.xWt)X7Q?}<@>) i?jg܅x*HjGYAL(z1%Lfb1XkkcWSDTgݱ+CS]á3?; S"yٙ 1#%wp+cUOa}cWl[}AmPW 5}rX 9K%t7E:NQ FrmF".$̠9Kpf ČAwY:?@mGY^o{V䮈)zc3Zt Zc>5qc]v_VLaAp a1_?`WvDX_2RB!繤{>XX&>EuI|Ɏ]]aY$S7 pCk`S,L"",BHtJ5  cWXM 0piw$QE!7&ӎZ@S-x)2_ta z2nok ^ ",)M+$ .|yZv;Ľw݅ ї<(%]q5&[kG +cuަp|԰aItt`aA3*cA(tB`BąkakqaGi:%$3/%`,4hdf擽l؏ɵ,#1x_Ϸ4vy{/6vI>v"zA <[[vD!扁jPVlBv+"r>=e-|,Ao'uAٛ,i9JtYkmL[dIlO&q0r- O@BĻl'#K\q"$ +2QKF(M[<43=$eQ q^5''ljUODX/PRMf1/ΙK̮ĵX; $~3gUfP;/ijoߗ#UzT{w !Gn EEA8 U1 #05g@y/|mӋ~6g2taiBH:97xeYVWXLmSZȣ5˰o9*LDXsݯRMϜ lO h{ ƷQ;C9>zkM?j`~C^-,",B;bJ5 s GHJp"d _rAx[d Jx{б1֎2{N XTqX28Cc]uc$ 1*5mq3K@0#ª=pGڏ鎪2(ՆŽ}ބO$",B*C138g YG*@Xg}4Hǹ}ewIK8WaG] ӄ eD+rv+DC1"L8h(# ;?̠gmC׬i ",j!r3|9˄tilhf/^F-@&JKn^A? "‚`1_Ji=TIk>LX(ܔ0@NMNs[}?EWƔwڰj֌ټSp!Rx#)$ .yx jLۇ¶ iX𠜪32'4s͚MoB6aA>K`7c.,dTM0/э\XjJ5 s+Џ!$~۫F<Ȍvh"OvUD$,t4 DPyq8GJ|^ Cj_'c\#yBgǔ eI(ƯN;% εYoi ^ kD{_ϩkz O/5M@"˸|`16| ?"dZ!ea׈aX,쮲4-wTU:"B؟  )HcwXZ\!'k9p6pl^WX3=GGcv{ ),QADXbʇF=x]Z#~U@}MM}܌)8${ܲKȘ{WniMSDAbKq Y%!y-X)Q9b.%>ryVslCF Dxv9g c?ZQ#Hk< n3O A"̅KpM@=G팻$C72ƥw >+$^B#,af܅*0:Pcc{&$-IitMX]P&M yD`v|̜ /,͚ R;AZlINAvAl|4!a^}䮎'L[`A8&A qQ\Q"L}[QKO"o5HOWohDA*ǽP hL7Badհ{fQm3mW>,-/ |xآhdr`ᫌ̚HP"h/MgjK4Jk "‚ i]cF[X8y`pv? mz65H+ "‚ Y1q "$,p|x ", OnRN' GZ!4MhiQ!mN=*`ADXA[WJ`,{arTZQp GX! Sc ?u{c{]6,iAy$m.¬`S!;‚ Q¬F7cXwE7<-,c\{֡G/X!,A ̌g`#l5Mpb4R<aOvdGX!DzS3[tB}q1BBU9<@?:oME8BvAH8aZ!/,,D)#GpЏ&l/" 0:~2LPFS1tIENDB`interval-2.1.0/doc/image/inverse-power.svg.png0000644000175000017500000006174013031037010020654 0ustar oliveroliverPNG  IHDR\+ ]TsRGB, pHYsttfx IDATxy|_dC ~6 G |޳jok="xgzիjmAU[ P \1BBv53}>`n҉F"JOLy|/L6-[){ XI&Ʋb ^9.1LӬ,~=- ;xr|3Essp)q?7?;wj!esj,o\ ӽ!Fi]?z?,/Cuu{O*lk ,0N4kGr{@YL'k,7nV (EKaȒ%K6h$bݺu6t~g>4B)q{_`B;(.w7UUUi֭[ap*,rAn1A `+ѳ\ %K32;~Tx$NL6 l봶S4Yjjj6kw澂ėo0ƒ<={**gK_VwD"1=Ruiqq@w: q.#pfffި>u̘1,abo\ 7\D"FS7bĈ%H5 4 !:uY1w3ùfX g&rRS ݳ,xbc Z9yOJo 6m{B]NsqqZ3C|ZG=NJ+ض0`H<5=g?ܨmOg!Imup?\J3=ֺ| :|GeB-pfVt pM7r?2 6lؿ @@v8E4?ߨ#ޓ-#S"if۵7m']'~pna~?β g+}1pn'< ØovΌ `ҥmNkiirV\,x.=ǒ%K5]pxB3BD/**:U: i /}ؼ<_cYz۶k*&yoO3={,B'> KMq>_p+⛿4hst9_%%%ആmuSJ]hRVV7Nv ,||WJ)8p wĥtz]OeYgf;O)UFDmiv]/~ Ju8N ~О[=eYoɱ RѢD\0`8dId<ӳ:w9k1`N"zDcd5p[/'2`0xR*jTVa'W=qWlul-ӗ|""Z.p/EGp#c̈́s- `֭[mnn~0 XIa2ZByc8;|>c䀋o?۶ o7333p~EEENZV~ TYo$F-j޽{=sp1=ɫZb\ e>K>`S$9/B]c䡮nm---?~yt3_s5_{O2\LOm65.G♭<h8 @/=Nnz9uX?I*uɡ}{ @۷xض} {Or\L\OWSfk,[ԂX e}dbkB<#pI`+smZ b57%`z~{m2u$z x㍖;w6Dn{Rv֏anp 4hP${:w5jOf$q2[sOKCC.06Mr=,X?I"F@{9ĸ;ΝG!5~9:>Ni|c3֏!i_m۶RV~ \̝;7Fk?@ V!NKFh ##c&{Or\L`eD4l&3ഝ$D4e/R6y_Qnkkm޽ !&{0=o!I Ac,Cqz֮B<3Yٮ1La ZOM? ؂SPL%5k߽֜'}.B t J\k,B_ !!0IF}}JZZZNx 1׹cŊ{r*{O\̑[8w$LU}zD"}>:u A%2oǖcU'|U`B/ s… w7ӦMޓ>jW:ҥKx#==8~ Yf466>*Cqv }%pРA#A<ҹcժUGGHss{R%:PF|zZ_ H3 [۶,:Uiiic$)Β%Kvڶ]?jԨpytйCk9--B?:u=s];p*#< eERJr#`'lwɱ &Nx?mBYCGJy>>ՖeY4@'8d ˲Gakzn;3RFRFD)uᔇHlc0iҤ]iɪ2 d_" EDvyyȘh#/wl-pǼreYs΂3sV'MH)+"Z;f̘ VwI彞`'222 6l ;o<2?##4w4wG֛IZ }ɾZщys;jkk \ӟ'}.DC}}J!ꂂ,8'`].ؽ{YC5>هF8_$ ;h!ĵp8܏}sA"^*eDR =Ʋ1 O$f=0}43f=  '$"-KG~ܞ$%| ãܗf X-jjj^mll\F 3 d_@qOnn`_ZksssguΘȋFy^;GnND?C'3%c,OR)~v^[JKKdzȝ;\n,딾=sa$L`YVRZOu@|cYߚ`sy*0쓩M)U&ȻtxcҤI~LDMq֝ޓ>g" !.'Ko7H_m{lc3˷o~,!-:˼?Hd0%K !B\&ȣ;V\]v'x4=sp11"77i$Hwe;wnc,3\WW8DzڟG?a+opvEEE!!AܑKBZ0=eʔ=s O'Dt]YYه8̄3ew&kRJ5RV;~ >XUc88pc TJZГ$ ܕg qLp=D˗ظ-r0MJ2b:w8@p׮]zϑd9^v <\c,Ù2p~ZWRYu0Lj1r9Bͥ#q}NGˈr:Ĥo,\p7< &>ɔEѢ &8c<;N45 ѣG7&"J>Ft@eee&TogMR'~3 dD)**OTCwO!ѲX}y XV34+RJ'M{adL^"z;=h<$"5>FG,˲pO3 ow;5FqOxcN.>R=z~ >h+l-S!'>.#&]w@5Լ8wJ&ϱ0 RJ5;饔 dE1cdDײsy.e d^DD[*++q :`܀>,++޵,krz IJ nI>倄S"&{zðO2݀z# =LƤDV6,$=eûa#Ia}DR8'!'1D2lذ/}ZiY{ad@Ӑ!C$n|Ͱ0=H(:v*^F=A+2|RQeYbtG>wPJ"]#xbOtɥ))NMac#aH&ơC~a'lIl4AO@L©RsnJyG>ٷ 9DZuu]NwIOO2gDQVVVޓ>ǭ}QwsH8-I`,/X*/^! BהRz81 Xv\O 8NK[%Ћp!jK-[ 0WXuVozܘ*?q`͙.'AN6(VL}I,2hoqqKyI.VJUJfT3l$L af1}HD9+AXҕRJTңðO1RQۄ NKY";:v_`LiSN};vl~ngffzú`0xtboFFƎ`+zP~! ~ͽس5Rʻ~=!fYNd"zϔR-X`5;'ԡ&vM2[8DQJhY1 \}"z BGy|[x7&xϧ+2eD,Cm>% n9N2 ݹRrJW)5K)-,,3q'NXRRR" 5@D?ꮑäO2G7oDQG t|v@W)EJM)xENbt2IOݎ=M2-sT#cE ]_SJ56Wb#~IOp5qذaLYH8>?>R&4[cyv4{wsrr6lXRj'm$Xd! $ȆsYŞeMJG8S~7c;lVh/DT6v} z!i޳S?sssMRji[R Bc{K?}]MD-Jknjᖏ8$߭TJ]VVVGDie] ϥrkG| <#ٶmۑ<vudnXW%A1p IrmF%0!ZF"֭۰{q`DpbLg{<tq~6muY__H9' IDAT N~܅ p#wy;< r:_K,7~f׼+2gNck&ֺ9 477n.˲rE?}ˇ 'hiVL - @=ƍ;n1Ms3E-"N)EH4*6| {A8P{— )e~F)uRjׄ >)))3:k/ ~`R=s!''Gvy fI8u}/J)7B'hSJ=GDC8]яac*= A>Lh BD-D\ 8{?lOղDtuYY2"GDeYrF2l!Yp9?{hoڅ\%f"ݴiӲ=<G;a ?pDg% ׺t87Z$F=NFDPJAD4ByDtqۨ>0j>q=eUYYYQ~`f(v {==滞mДyR47k5i"ZEDwZuɞ֕R~sWn]'W}3Z `8_.Yd_4 Up-ro{Fù;NM~.p ~ -ٮ!up0f si6v7mqGaa~ `ֺ07۶fmm>>MR,vg`pÿsΝhUUUi!~%ŋW1w#U5x ND{/v7ļp8\xfkk!5:7֯ۺL-Rn m! > <\J/777 ʤv0RvR-R߷&?srrFVZZdG `%ZZ ,ŀ!Enj7J~1I$N}|v?@۷?ҝ,//D" !={<uA7I B$^`7I=f׼"rdee >|k>o2<ZZE"e˖#}`ڜ2L>l:R ܫ9sm۾~qgL8˔+tg d,siprZc333ljj}W(&8|ϧ2222D˄~ҲlŊ}i+3#\A+Wض {… ?9!{"'+2ǎ8H@X qԞ={BL4h FGmssx°O\vcMp juƍ۶m> ~5YvtЩ k$NVdmx+2q΃~ashdd ղ7(bYDTmE~ =@~ mﲑ0)I x7[YYOD+Q+=kY99[*2wpD WdocJ3ǭ|4O2L,iN"R[BPKii J`/1oڄq~'wHeY D4eʔ[233gtpBv"sPm,鄱?Nei}aD:%F"H)ui\E8H 8]Bygn% >4J"۵^ Kh[o0 s-, k>T۶[,Zt^:]AW adn# 6 c$8©ڎ;͛ojjڪI-}sǡ.\ @8E8N\oݺ5>ZNVO`,=Y ad\1-~hۻwV;0^-/ݠ-sǡ.\L ܺuk_e(&۶O2 #`NkDk]dѢEѵ ^q z>"'HywYY٠rڶ}a&̖֭wil2ᡘ@7:w_#CO~J&'j˲~zM.զi4i-eYYA+geeE=ࣱod~~ܧ>)`0[Ϗ`M˥rssLJi/&[oL x\JeRʦ|˛+RR7)ew:Ngc Q);MgK)[`|2ZPPp3m{}-Rb)e$ V{4[ |A) 󤔭@`(r1ó5Rʻ)jRʶ0x)erfuu4ͩ#G85nZoq֭kjjʖR^Y[__kD $$wwǶ*++3F#`Ҵ;kl X~zsǎDSޘso0+3|цaPgd¹Tkkk_gU'&UUUo߾ZZqa%Z룴Ä>ڵx9$ 222J谌W.\ >0ٮ](B=aI9pZ&KY֏aT9%F1 >T90 $J0 0 p0naX?a{R8bR!ĩ0 {\¹ 0  0 0 \ ?@Vc'|.&BeX?a{RR-$2Z2Vc'g*g?0@PWɠ ðOO2 5k.c#gH)Y֏ad{纗 c#'m31 {O*\*\88"Vc'pgex0 $$$3|b\ڋOlW{azdKII~`1c_^~`wl V%/'9@-;Yg4k>8˲0_! _/P~>ɰeÙ&opu εczh0'β'eirn0],I}aRo2 <+㼾K"6a_O2L$c^{ໝK=:ueYU{삊 }G2wy"U`/'}W}so[MLzO2r<7$~wɝ0LFgUvm3_}o;w~ueeeeYgfR{9hZ}1f)7:rG5SLßa>]I+[~衇qWûaD8}I]GbFfvvhb!1 $_v'۶?~{0w;tpgF'.)Nl}+%\z.ݝH)*~KeeCgqFs]]~W'ϻIEIFp@Z9) 8Rp8|iZZ"HڏOٓu۶m~V_N6-۶m>WjKJJ~6w(v&ռ'Y}nP򾶣R3Nʷ;DV|/'NL*{O2pp*O`u6G6>}/'N8L }˲N'"MDNm/~CL0AQCuuw5ޓ>ش ;%^Ç}jںU`z>헶m@5k]ͤ$eG !ړWJ]ˇ~JKX֏(lnSJ+¤$ωKKK [1[k}ŧ0guapjkkW2 sx+Vimm:[Q V`Q^!?aVa84{zŋ}D·B gX?gD"B[/Xqmۯr_E&'}\B5hР;v]urtHӣ< UUU/|UkaR{DRJ=bĈ{l>zɒ%S4͠)!D0kjjV90LEJ 3 ˗"q/]tҽtH:w}666NokkFD->,ϬXӯ/ùhaaY5btҏ9,]t͛_pRR5#Y֏YjkkBO2`@MMZ?Mk]cv=URL2zO2wzvvZ-hc`٦MB|q|$%3X֏qmR.\KwxȲ#& '|_\ ,8Ok}߂ z!n)0Ͷm׆I.m6U`gɒ% !~$sEEE!?}$:SNʊ1=sR{+2MsO(:*3d$AD& øN2%ϲghRj:+01_WWw-??oܸqמ={B\aYӡPh02Ip21G mٶm0˖-۱xSv<@e{~b6̛<^zm+u{+ Ӧy%`#G}}ִS Hyyk֬͛B\IDsh +$ ghSJ]'?! &l6577O0>oz۶CYjjj5Msgl8Wm'x4bV ae&|eY_QJ Dt'++++0>_4ID ܇a aѣ,ʎY۲e˙Bj!\#NvvvU`^J! !p:goXbŞo߾u9ޓ>?hZϫ, .ŋ6 s!;9:ddd|*~LP[[R2&M&m֯_J˲`{qb[[[r\ gLWSSDqSM kyD%`cٲe;Ҧ0`J<'i{֏Zu>8XnB;"zoĉ4!&?k, i }20'*"jVJ4FB-&5[u.GxV&ov!233c 1 Qܜmۮ0}ڵWUU /^@q⑒S,sG{lhhX߲ X=.V8%''geY x} IDAT|>mllx1I !{t.6؂hÚ.ZȰKGg^B\qnoNk%!ęDt Z=Jc'ݠ0旖N(++ˌl @ʕ+"Ti{{璛"`!F+#?@ Pqڍ%//U M ,++DDD4'&z j7$_D4wHRrFkkk^\cǎ---W!*r=|rҥ{ DttϚZ7M3Ȼ+X<?nB! |\>̺),X??$jjj6io}W[.f$aDλ/;ImmGap8|LLu#ܮR[[K/!3&VJc/~Zk}_IIɗ''fNk}ֺ PeػquhFF۶ADl`z]F9997zǶmۆ !KJJ~g~;-[öp\HVVZ1 >}ҥKW^mOa@a>Mmmml_TJ͊ Q__Xk}a Y`A$ RJ"l455U !'x|$+xH)*~LrSSSN[hh)&]WWBcccZ[[\. }.s\\dɒ1b4e&$Ϋho[x%`1)P[[4$ 6<+(޽{u{%[5@(1$ Xd=1féuz|k^avU`1).JOO1f̘G< 85J2=sZ/ivO_^CfcǎH)GL7`'R3hO29r {h_`___I=M N~ H0e{]Դ!r '''U`IvhwyǠpf?0bݺu.d+>jW!x,8 Gŋ? ~Ȑ!?sM`k,,Ӆeq-.?dX?&u|.BXe}֋F˖-myϥTyc]wײDԢg88ѥDg@ HQo_RLr*>NKK[zx|4KD|{7\I[ZZ ^c,ED^sp>ji+ƌSAuwYBDgTpu'ؚ`2ڮpf̝;7 ɖeMl׹~?ٶGb8b .lp'C 9#p 4^t{ip=whǤ&<`'؊۹#p˲d{R8FjkkypTlHkk$"uZVcRezJsǒ%Kvܹh41cdt=s)@O&*#iV~wX ,z^g.}5DV1NEq4 ci[rCL3\L]]R!Æa&N5GqB8β*V/:k~m*,, i'}mnz \ 1J/zH_'?f~YNoH¯u >wY?9 6|LҔ ؚ`G(F!{7\l}喉X NO/#ƒ#T4ͩ:7%: N^l >xODe:Y&.!U{=]>McqڌĖ@3]='AGNz$xbbsgI&Q951H$QLiA.pЍ@ }{T* y*_zWqR|9p'Ƙk@p.gٳS!ZZZ07F[ͳaudX-8ZkK7CSv+ty5O}SZLu;/W^[_VID9R"u -WY3[*;JD#%hY>}lMMM;gwߩsxiHiOם7I~"q~dF<gV5775ƌ95\QCC~kjeK1d^וּυX|=ة|ŋ?gO|Y`^/|`cGGު))pgEEER2fKUb0o\U?s{ii9.8+:Z1"uGt}6\X TǮghvMf 6zV)(S)D9yDSԷ24dOZMM%A4uO< \Ef{ǩq?+//?oYp{U?#b{1uD oHqLy<3fTb >pK.b}f̘1 }M4idfny=~|Dqlm'gڵƘǹH-;tڿW 6{k\؝ĵ Լ]puݍ555WMDSLJSgr<]D555ծvTUU +Wpoӽv ߐfNlwpԩSlH ys<ϛHm0ܜٚC/n&Ts-ljyhرsw |Sk׮1Ɯ?u\OrBUAȘ*?2I3fG +{?u`/ S;NB3gΜ4{+>{6uvv^fJI᪯V94u03iΩy=C_!/sN ׉.<ҷoҪ_l.3VT9pܷoeqVv<8Z׫D`FqbW~IprǢE kΩ: ,X%K5,XZՙа x;v,ST?FNٱXrcr4[ Nb SL! cCSu/? :sel7ttt,^,W D''6[k+ Xե"=a̹|h六xl+N\SȀz`ڴieY}4U."QI1O'6rl_#h]T\o ׅ"444,v13X1oz~Q3`s;uB;^i'9kh?sr)F2-'k%84̫׀էFMkٮR"dd$ƍ[cg5[O9zqJhgOK9w aڵ 555_HR[\0qughHHr2߻?vUUUhX" VH>_ƟJgPFT"0yz_p1fރ"<qwh644xJC#ui؂?UםtJ]F/8RQdN-T?fNN4i^IIc*2f2UUU-u]̞0\>p L/!!Kr4[ohxQ"xΘ1#M.ONHN.+MkJKK/"kf+C={Јl.!4&l0k ƍlf[1 @O;E礩~rbr2Y8 6|YƘ:=Ɯs4£*++¡ ]Wq m cSEH{q9~_|EE/1UUUTHfOrN W,X [8|ʼZ[: 4bO}!PVSSsf3ظQTTYfOsN WXk߀v*NSZ#ItXb1fql=\M3iZkTŢ=a95\᳠o߾N ;v&q O"oyӃfkp QhU*U'9+dqMN;&5ڱcROtq \`y)=ghkky-`1p-A,^qL< lFʭ5RT?6kBcLѠA1W߸q73}bU,ZƜS ٚ ̰־K\ >;.5\% H oQ0_-Y8V,cVG-H pF'yq L4"`[t(j>{0|95\Ykeܩl=`H5\A!""Vl<x(-5\rt0`9w۱c >}zq L&d]^4[M8F1p号JJJxr۶muD aYAZk׵>¡'1j"=a95\Šzཨ\577pPDz -f~1pϕ*` J3ǁQZ8ߡo[vY6cLĉR=95\c٧Oyx :c"p>L|iFEc8X'9+O444tT< yTNߵKzGIZ w]<ٚ֞&(I=95\ed-fFKN_7Q/&0To3gǏ_cN `Zk7ѪDfq= +,ׯ_'YwxZ;6 Eعs" ~//}U-7sINٺ8 8NiAvǿkLCـQUxVr,ݰa Dd WEEE^r \ x >j%+wmֶQt8]5`#p0 d2iǩ_CezWQimm{b;tKGr2JJJ0ڊWׯEEE޽[/Û)cK;;;?lQD䃬f,ok&@D3r2|u@J#"TshMHX OaIDATrȑG*Š>H\%)rRf+4g, (gwo`0_{/Jo'-թ4TVJi4,+(M"g]<t zGJQVJOOx`ʣŶ mX^GJQVBZ,9 v0E T[3+TQN(+U!} ޓgve,;r<- |S夈X9x\?LnnQVBrp$"I夈~_eQN1*rRDkXBeQNG%*M8]B6D"TNѻ j[@9x)ˁ/L"TNJ 'P "0 &0#T&QN*' 1ȠFIENDB`interval-2.1.0/doc/image/octave-interval.ly.png0000644000175000017500000001115013031037010020765 0ustar oliveroliverPNG  IHDRlF3 6iCCPdefault_rgb.iccxgP} tXz*eIK,K!b"4ER$VDY$(1ETP;}~=;眙@@ERR|?{NHh!n ( V}](1<X|^:_f ]VTR9 ,~HhrXq_}XQ_}X?@}Q( 1XAN$?bqspbc9*AL!-}?!.^F/{ ؾj]RT0 _3(H&%؂7@(lC !aA 샃P-.yxK:DED A.b8!D qH*#;Ar # db( e:rQ; @ףqh{*=vW(*D_ `T)as0,c[bkڱ^l 9#c88]%2p[q \w7}rx f|'~?O  JH$l&: ÄIH&HXD&$^"HT"ɈL # HVEiD%-h&rKC"/Q(+J%REi\SRTe9՗@NޠNP?i4Z8-vvNmat}/~A)'&-MVKdD5Pc1603;9QhVZsc bL1C1oRVb3Dquq'hBcW'S1w2טS,KJd~f %%%$r%j%.H[NfO?IKIHl\*$͑vN/-T'-+#sD̜,KR'[,{Z*-'Yܠ܂||U9BBEYEbb%ŗ 'S+)*e)5( )-)k(*(w(?UpUbU*TTUUTUTոjj5ԃwwhHiiiik5m4345kZIZj&ڵwtPS:ëWj\5KӵmӝcyuW߯? ٠aaFF¾}?Q.VW>y@WoVW:$VW\_3Zk_Q'Wnp#GK?M8QXMAM?qjii.i|<߉Vֲ6-mdɻ?;Ӯ(9N%=Ni?vY܅tm s?kޯ+ q"bŕKy._weocߓ!W]vvnX8[[ݷMow vf[P;=w8b3r];: ñ13yxqxSѧ5{Txaqb'Wdn!m8H)u]uqq xSUy8j[v9B$Icr"]׳,(ʲLu4Mu] }_AxOaBƘeY8)!6tb'ieY:. S*q7"q*~xpuuǏUT;c ߿ OOO_|`ׯǏ풨Z0 7,s˲RJ0J >`Ɔn@nc.<ϱjZ5UV]εjvsh,Bl]!NUoN<"Y%ELI)ιz0 2)eHh'q_ [kdGѲ%Z;=TMdgЪnN?bYcL4!ІknIt]W1eYiҎEA5DX3RaQ4r 9 (R8qZN*4}p/7Dd2L&HTx٪%@1BM}?z2<|Ç]],)ԧ넝 krs!Lh" C˲,˚/DՔ՚c)SR. ^3a1eY֔)f k> P'sD 0fA'EQ9JZ$IRh`0P?tHDu(<OnU!|-6219u# <;)@Qxjd̩ I`2rgs+ގ Hd#GYsuVp&twيyi:Q+ds $q6p8\XdTc|C2H{a$I(Qmsk #lנW $pǦi4t]/b4!%g۶nZGXly*Jg#ޡj:dGUW$C 5*6ʔܣu^g4M0}۶18:m۰]Ee( 0 (Y<_x4QR"I],k ~/0TaШj:ەue- A [cQz,:18n7y<C*T-iV1 ÀVoBYս8nHG6&`%R+1N *u;tu]]訞#5R GzN KE0j~"}<σ!iTYUyֱu[Z e14M8^ v]ZE L81MjvEq,֐ ǁ1<}) mIENDB`interval-2.1.0/src/crlibm/aclocal.m40000644000175000017500000012166113031037010016612 0ustar oliveroliver# 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'.])]) # 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]))]) # 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], [AC_REQUIRE([AC_CONFIG_AUX_DIR_DEFAULT])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])]) # 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 interval-2.1.0/src/crlibm/configure0000755000175000017500000062375713031037010016676 0ustar oliveroliver#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.69. # # # Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc. # # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # Use a proper internal environment variable to ensure we don't fall # into an infinite loop, continuously re-executing ourselves. if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then _as_can_reexec=no; export _as_can_reexec; # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 as_fn_exit 255 fi # We don't want this to propagate to other subprocesses. { _as_can_reexec=; unset _as_can_reexec;} if test "x$CONFIG_SHELL" = x; then as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi " as_required="as_fn_return () { (exit \$1); } as_fn_success () { as_fn_return 0; } as_fn_failure () { as_fn_return 1; } as_fn_ret_success () { return 0; } as_fn_ret_failure () { return 1; } exitcode=0 as_fn_success || { exitcode=1; echo as_fn_success failed.; } as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; } as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; } as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; } if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then : else exitcode=1; echo positional parameters were not saved. fi test x\$exitcode = x0 || exit 1 test -x / || exit 1" as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" && test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1 test \$(( 1 + 1 )) = 2 || exit 1" if (eval "$as_required") 2>/dev/null; then : as_have_required=yes else as_have_required=no fi if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then : else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_found=false for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. as_found=: case $as_dir in #( /*) for as_base in sh bash ksh sh5; do # Try only shells that exist, to save several forks. as_shell=$as_dir/$as_base if { test -f "$as_shell" || test -f "$as_shell.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then : CONFIG_SHELL=$as_shell as_have_required=yes if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then : break 2 fi fi done;; esac as_found=false done $as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then : CONFIG_SHELL=$SHELL as_have_required=yes fi; } IFS=$as_save_IFS if test "x$CONFIG_SHELL" != x; then : export CONFIG_SHELL # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 exit 255 fi if test x$as_have_required = xno; then : $as_echo "$0: This script requires a shell more modern than all" $as_echo "$0: the shells that I found on your system." if test x${ZSH_VERSION+set} = xset ; then $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should" $as_echo "$0: be upgraded to zsh 4.3.4 or later." else $as_echo "$0: Please tell bug-autoconf@gnu.org about your system, $0: including any error possibly output before this $0: message. Then install a modern shell, or manually run $0: the script under such a shell if you do have one." fi exit 1 fi fi fi SHELL=${CONFIG_SHELL-/bin/sh} export SHELL # Unset more variables known to interfere with behavior of common tools. CLICOLOR_FORCE= GREP_OPTIONS= unset CLICOLOR_FORCE GREP_OPTIONS ## --------------------- ## ## M4sh Shell Functions. ## ## --------------------- ## # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits as_lineno_1=$LINENO as_lineno_1a=$LINENO as_lineno_2=$LINENO as_lineno_2a=$LINENO eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" && test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || { # Blame Lee E. McMahon (1931-1989) for sed's syntax. :-) sed -n ' p /[$]LINENO/= ' <$as_myself | sed ' s/[$]LINENO.*/&-/ t lineno b :lineno N :loop s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ t loop s/-\n.*// ' >$as_me.lineno && chmod +x "$as_me.lineno" || { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; } # If we had to re-execute with $CONFIG_SHELL, we're ensured to have # already done that, so ensure we don't try to do so again and fall # in an infinite loop. This has already happened in practice. _as_can_reexec=no; export _as_can_reexec # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensitive to this). . "./$as_me.lineno" # Exit status is that of the last command. exit } ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi as_test_x='test -x' as_executable_p=as_fn_executable_p # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" test -n "$DJDIR" || exec 7<&0 &1 # Name of the host. # hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` # # Initializations. # ac_default_prefix=/usr/local ac_clean_files= ac_config_libobj_dir=. LIBOBJS= cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= # Identity of this package. PACKAGE_NAME= PACKAGE_TARNAME= PACKAGE_VERSION= PACKAGE_STRING= PACKAGE_BUGREPORT= PACKAGE_URL= ac_unique_file="crlibm.h" # 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 USE_HARDWARE_DE_FALSE USE_HARDWARE_DE_TRUE USE_INTERVAL_FUNCTIONS_FALSE USE_INTERVAL_FUNCTIONS_TRUE USE_SSE2_FALSE USE_SSE2_TRUE HAS_FPU_CONTROL_FALSE HAS_FPU_CONTROL_TRUE EGREP GREP CPP LN_S RANLIB COMPILER_ICC_FALSE COMPILER_ICC_TRUE 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 host_os host_vendor host_cpu host build_os build_vendor build_cpu build ISODATE 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_dependency_tracking enable_sse2 enable_interval_functions enable_double_extended enable_nbdigits enable_digitsize enable_mpfr enable_gmp enable_ultim enable_mcr with_gmp_include with_gmp_lib with_gmp with_mpfr_include with_mpfr_lib with_mpfr with_ultim_include with_ultim_lib with_ultim with_mcr_include with_mcr_lib with_mcr ' ac_precious_vars='build_alias host_alias target_alias CC CFLAGS LDFLAGS LIBS CPPFLAGS CPP' # Initialize some variables set by options. ac_init_help= ac_init_version=false ac_unrecognized_opts= ac_unrecognized_sep= # The variables have the same names as the options, with # dashes changed to underlines. cache_file=/dev/null exec_prefix=NONE no_create= no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= verbose= x_includes=NONE x_libraries=NONE # Installation directory options. # These are left unexpanded so users can "make install exec_prefix=/foo" # and all the variables that are supposed to be based on exec_prefix # by default will actually change. # Use braces instead of parens because sh, perl, etc. also accept them. # (The list follows the same order as the GNU Coding Standards.) bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datarootdir='${prefix}/share' datadir='${datarootdir}' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' includedir='${prefix}/include' oldincludedir='/usr/include' docdir='${datarootdir}/doc/${PACKAGE}' infodir='${datarootdir}/info' htmldir='${docdir}' dvidir='${docdir}' pdfdir='${docdir}' psdir='${docdir}' libdir='${exec_prefix}/lib' localedir='${datarootdir}/locale' mandir='${datarootdir}/man' ac_prev= ac_dashdash= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval $ac_prev=\$ac_option ac_prev= continue fi case $ac_option in *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;; *=) ac_optarg= ;; *) ac_optarg=yes ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_dashdash$ac_option in --) ac_dashdash=yes ;; -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir=$ac_optarg ;; -build | --build | --buil | --bui | --bu) ac_prev=build_alias ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build_alias=$ac_optarg ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file=$ac_optarg ;; --config-cache | -C) cache_file=config.cache ;; -datadir | --datadir | --datadi | --datad) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=*) datadir=$ac_optarg ;; -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \ | --dataroo | --dataro | --datar) ac_prev=datarootdir ;; -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \ | --dataroot=* | --dataroo=* | --dataro=* | --datar=*) datarootdir=$ac_optarg ;; -disable-* | --disable-*) ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=no ;; -docdir | --docdir | --docdi | --doc | --do) ac_prev=docdir ;; -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*) docdir=$ac_optarg ;; -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv) ac_prev=dvidir ;; -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*) dvidir=$ac_optarg ;; -enable-* | --enable-*) ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=\$ac_optarg ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix=$ac_optarg ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he | -h) ac_init_help=long ;; -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) ac_init_help=recursive ;; -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) ac_init_help=short ;; -host | --host | --hos | --ho) ac_prev=host_alias ;; -host=* | --host=* | --hos=* | --ho=*) host_alias=$ac_optarg ;; -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht) ac_prev=htmldir ;; -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \ | --ht=*) htmldir=$ac_optarg ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir=$ac_optarg ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir=$ac_optarg ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir=$ac_optarg ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir=$ac_optarg ;; -localedir | --localedir | --localedi | --localed | --locale) ac_prev=localedir ;; -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*) localedir=$ac_optarg ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst | --locals) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*) localstatedir=$ac_optarg ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir=$ac_optarg ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c | -n) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir=$ac_optarg ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=$ac_optarg ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix=$ac_optarg ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix=$ac_optarg ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name=$ac_optarg ;; -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd) ac_prev=pdfdir ;; -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*) pdfdir=$ac_optarg ;; -psdir | --psdir | --psdi | --psd | --ps) ac_prev=psdir ;; -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*) psdir=$ac_optarg ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir=$ac_optarg ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir=$ac_optarg ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site=$ac_optarg ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir=$ac_optarg ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir=$ac_optarg ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target_alias ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target_alias=$ac_optarg ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers | -V) ac_init_version=: ;; -with-* | --with-*) ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=\$ac_optarg ;; -without-* | --without-*) ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=no ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes=$ac_optarg ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries=$ac_optarg ;; -*) as_fn_error $? "unrecognized option: \`$ac_option' Try \`$0 --help' for more information" ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. case $ac_envvar in #( '' | [0-9]* | *[!_$as_cr_alnum]* ) as_fn_error $? "invalid variable name: \`$ac_envvar'" ;; esac eval $ac_envvar=\$ac_optarg export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2 : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}" ;; esac done if test -n "$ac_prev"; then ac_option=--`echo $ac_prev | sed 's/_/-/g'` as_fn_error $? "missing argument to $ac_option" fi if test -n "$ac_unrecognized_opts"; then case $enable_option_checking in no) ;; fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;; *) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;; esac fi # Check all directory arguments for consistency. for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \ datadir sysconfdir sharedstatedir localstatedir includedir \ oldincludedir docdir infodir htmldir dvidir pdfdir psdir \ libdir localedir mandir do eval ac_val=\$$ac_var # Remove trailing slashes. case $ac_val in */ ) ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'` eval $ac_var=\$ac_val;; esac # Be sure to have absolute directory names. case $ac_val in [\\/$]* | ?:[\\/]* ) continue;; NONE | '' ) case $ac_var in *prefix ) continue;; esac;; esac as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val" done # There might be people who depend on the old broken behavior: `$host' # used to hold the argument of --host etc. # FIXME: To remove some day. build=$build_alias host=$host_alias target=$target_alias # FIXME: To remove some day. if test "x$host_alias" != x; then if test "x$build_alias" = x; then cross_compiling=maybe elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null ac_pwd=`pwd` && test -n "$ac_pwd" && ac_ls_di=`ls -di .` && ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` || as_fn_error $? "working directory cannot be determined" test "X$ac_ls_di" = "X$ac_pwd_ls_di" || as_fn_error $? "pwd does not report name of working directory" # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then the parent directory. ac_confdir=`$as_dirname -- "$as_myself" || $as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_myself" : 'X\(//\)[^/]' \| \ X"$as_myself" : 'X\(//\)$' \| \ X"$as_myself" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_myself" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` srcdir=$ac_confdir if test ! -r "$srcdir/$ac_unique_file"; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r "$srcdir/$ac_unique_file"; then test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .." as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir" fi ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work" ac_abs_confdir=`( cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg" pwd)` # When building in place, set srcdir=. if test "$ac_abs_confdir" = "$ac_pwd"; then srcdir=. fi # Remove unnecessary trailing slashes from srcdir. # Double slashes in file names in object file debugging info # mess up M-x gdb in Emacs. case $srcdir in */) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;; esac for ac_var in $ac_precious_vars; do eval ac_env_${ac_var}_set=\${${ac_var}+set} eval ac_env_${ac_var}_value=\$${ac_var} eval ac_cv_env_${ac_var}_set=\${${ac_var}+set} eval ac_cv_env_${ac_var}_value=\$${ac_var} done # # Report the --help message. # if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \`configure' configures this package to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking ...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] Installation directories: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [PREFIX] By default, \`make install' will install all the files in \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify an installation prefix other than \`$ac_default_prefix' using \`--prefix', for instance \`--prefix=\$HOME'. For better control, use the options below. Fine tuning of the installation directories: --bindir=DIR user executables [EPREFIX/bin] --sbindir=DIR system admin executables [EPREFIX/sbin] --libexecdir=DIR program executables [EPREFIX/libexec] --sysconfdir=DIR read-only single-machine data [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] --localstatedir=DIR modifiable single-machine data [PREFIX/var] --libdir=DIR object code libraries [EPREFIX/lib] --includedir=DIR C header files [PREFIX/include] --oldincludedir=DIR C header files for non-gcc [/usr/include] --datarootdir=DIR read-only arch.-independent data root [PREFIX/share] --datadir=DIR read-only architecture-independent data [DATAROOTDIR] --infodir=DIR info documentation [DATAROOTDIR/info] --localedir=DIR locale-dependent data [DATAROOTDIR/locale] --mandir=DIR man documentation [DATAROOTDIR/man] --docdir=DIR documentation root [DATAROOTDIR/doc/PACKAGE] --htmldir=DIR html documentation [DOCDIR] --dvidir=DIR dvi documentation [DOCDIR] --pdfdir=DIR pdf documentation [DOCDIR] --psdir=DIR ps documentation [DOCDIR] _ACEOF cat <<\_ACEOF 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 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") --enable-dependency-tracking do not reject slow dependency extractors --disable-dependency-tracking speeds up one-time build --enable-sse2 forces the use of sse2 arith [default=no] --enable-interval-functions enables filib-compatible interval functions (DOES NOT WORK YET) [default=no] --enable-double-extended enable double-extended optimised versions of functions if hardware supports it [default=yes] --enable-nbdigits=N set the number of digits in the SCS structure to N [default=8] --enable-digitsize=N set the size of a digit to N bits [default=30] --enable-mpfr enable MPFR function [default=no] --enable-gmp enable GMP function [default=no] --enable-ultim enable comparison with libultim, IBM's Accurate Portable Math Library [default=no] --enable-mcr enable comparison with Sun's LIBMCR [default=no] Optional Packages: --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --with-gmp-include=DIR GMP include directory --with-gmp-lib=DIR GMP lib directory --with-gmp=DIR GMP directory --with-mpfr-include=DIR MPFR include directory --with-mpfr-lib=DIR MPFR lib directory --with-mpfr=DIR MPFR directory --with-ultim-include=DIR ULTIM include directory --with-ultim-lib=DIR ULTIM lib directory --with-ultim=DIR ULTIM directory --with-mcr-include=DIR LIBMCR include directory --with-mcr-lib=DIR LIBMCR lib directory --with-mcr=DIR LIBMCR directory Some influential environment variables: CC C compiler command CFLAGS C compiler flags LDFLAGS linker flags, e.g. -L if you have libraries in a nonstandard directory LIBS libraries to pass to the linker, e.g. -l CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I if you have headers in a nonstandard directory CPP C preprocessor Use these variables to override the choices made by `configure' or to help it to find libraries and programs with nonstandard names/locations. Report bugs to the package provider. _ACEOF ac_status=$? fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d "$ac_dir" || { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } || continue ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" || { ac_status=$?; continue; } # Check for guested configure. if test -f "$ac_srcdir/configure.gnu"; then echo && $SHELL "$ac_srcdir/configure.gnu" --help=recursive elif test -f "$ac_srcdir/configure"; then echo && $SHELL "$ac_srcdir/configure" --help=recursive else $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi || ac_status=$? cd "$ac_pwd" || { ac_status=$?; break; } done fi test -n "$ac_init_help" && exit $ac_status if $ac_init_version; then cat <<\_ACEOF configure generated by GNU Autoconf 2.69 Copyright (C) 2012 Free Software Foundation, Inc. This configure script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. _ACEOF exit fi ## ------------------------ ## ## Autoconf initialization. ## ## ------------------------ ## # ac_fn_c_try_compile LINENO # -------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_compile # ac_fn_c_try_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_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_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_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_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_compute_int LINENO EXPR VAR INCLUDES # -------------------------------------------- # Tries to find the compile-time value of EXPR in a program that includes # INCLUDES, setting VAR accordingly. Returns whether the value could be # computed ac_fn_c_compute_int () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if test "$cross_compiling" = yes; then # Depending upon the size, compute the lo and hi bounds. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) >= 0)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_lo=0 ac_mid=0 while :; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) <= $ac_mid)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=$ac_mid; break else as_fn_arith $ac_mid + 1 && ac_lo=$as_val if test $ac_lo -le $ac_mid; then ac_lo= ac_hi= break fi as_fn_arith 2 '*' $ac_mid + 1 && ac_mid=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) < 0)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=-1 ac_mid=-1 while :; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) >= $ac_mid)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_lo=$ac_mid; break else as_fn_arith '(' $ac_mid ')' - 1 && ac_hi=$as_val if test $ac_mid -le $ac_hi; then ac_lo= ac_hi= break fi as_fn_arith 2 '*' $ac_mid && ac_mid=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done else ac_lo= ac_hi= fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext # Binary search between lo and hi bounds. while test "x$ac_lo" != "x$ac_hi"; do as_fn_arith '(' $ac_hi - $ac_lo ')' / 2 + $ac_lo && ac_mid=$as_val cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { static int test_array [1 - 2 * !(($2) <= $ac_mid)]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_hi=$ac_mid else as_fn_arith '(' $ac_mid ')' + 1 && ac_lo=$as_val fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext done case $ac_lo in #(( ?*) eval "$3=\$ac_lo"; ac_retval=0 ;; '') ac_retval=1 ;; esac else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 static long int longval () { return $2; } static unsigned long int ulongval () { return $2; } #include #include int main () { FILE *f = fopen ("conftest.val", "w"); if (! f) return 1; if (($2) < 0) { long int i = longval (); if (i != ($2)) return 1; fprintf (f, "%ld", i); } else { unsigned long int i = ulongval (); if (i != ($2)) return 1; fprintf (f, "%lu", i); } /* Do not output a trailing newline, as this causes \r\n confusion on some platforms. */ return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : echo >>conftest.val; read $3 config.log <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by $as_me, which was generated by GNU Autoconf 2.69. Invocation command line was $ $0 $@ _ACEOF exec 5>>config.log { cat <<_ASUNAME ## --------- ## ## Platform. ## ## --------- ## hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` /usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown` /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` _ASUNAME as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. $as_echo "PATH: $as_dir" done IFS=$as_save_IFS } >&5 cat >&5 <<_ACEOF ## ----------- ## ## Core tests. ## ## ----------- ## _ACEOF # Keep a trace of the command line. # Strip out --no-create and --no-recursion so they do not pile up. # Strip out --silent because we don't want to record it for future runs. # Also quote any args containing shell meta-characters. # Make two passes to allow for proper duplicate-argument suppression. ac_configure_args= ac_configure_args0= ac_configure_args1= ac_must_keep_next=false for ac_pass in 1 2 do for ac_arg do case $ac_arg in -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) continue ;; *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) as_fn_append ac_configure_args0 " '$ac_arg'" ;; 2) as_fn_append ac_configure_args1 " '$ac_arg'" if test $ac_must_keep_next = true; then ac_must_keep_next=false # Got value, back to normal. else case $ac_arg in *=* | --config-cache | -C | -disable-* | --disable-* \ | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ | -with-* | --with-* | -without-* | --without-* | --x) case "$ac_configure_args0 " in "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; esac ;; -* ) ac_must_keep_next=true ;; esac fi as_fn_append ac_configure_args " '$ac_arg'" ;; esac done done { ac_configure_args0=; unset ac_configure_args0;} { ac_configure_args1=; unset ac_configure_args1;} # When interrupted or exit'd, cleanup temporary files, and complete # config.log. We remove comments because anyway the quotes in there # would cause problems or look ugly. # WARNING: Use '\'' to represent an apostrophe within the trap. # WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo $as_echo "## ---------------- ## ## Cache variables. ## ## ---------------- ##" echo # The following way of writing the cache mishandles newlines in values, ( for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #( *${as_nl}ac_space=\ *) sed -n \ "s/'\''/'\''\\\\'\'''\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p" ;; #( *) sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) echo $as_echo "## ----------------- ## ## Output variables. ## ## ----------------- ##" echo for ac_var in $ac_subst_vars do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo if test -n "$ac_subst_files"; then $as_echo "## ------------------- ## ## File substitutions. ## ## ------------------- ##" echo for ac_var in $ac_subst_files do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo fi if test -s confdefs.h; then $as_echo "## ----------- ## ## confdefs.h. ## ## ----------- ##" echo cat confdefs.h echo fi test "$ac_signal" != 0 && $as_echo "$as_me: caught signal $ac_signal" $as_echo "$as_me: exit $exit_status" } >&5 rm -f core *.core core.conftest.* && rm -f -r conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -f -r conftest* confdefs.h $as_echo "/* confdefs.h */" > confdefs.h # Predefined preprocessor variables. cat >>confdefs.h <<_ACEOF #define PACKAGE_NAME "$PACKAGE_NAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_TARNAME "$PACKAGE_TARNAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_VERSION "$PACKAGE_VERSION" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_STRING "$PACKAGE_STRING" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_URL "$PACKAGE_URL" _ACEOF # Let the site file select an alternate cache file if it wants to. # Prefer an explicitly selected file to automatically selected ones. ac_site_file1=NONE ac_site_file2=NONE if test -n "$CONFIG_SITE"; then # We do not want a PATH search for config.site. case $CONFIG_SITE in #(( -*) ac_site_file1=./$CONFIG_SITE;; */*) ac_site_file1=$CONFIG_SITE;; *) ac_site_file1=./$CONFIG_SITE;; esac elif test "x$prefix" != xNONE; then ac_site_file1=$prefix/share/config.site ac_site_file2=$prefix/etc/config.site else ac_site_file1=$ac_default_prefix/share/config.site ac_site_file2=$ac_default_prefix/etc/config.site fi for ac_site_file in "$ac_site_file1" "$ac_site_file2" do test "x$ac_site_file" = xNONE && continue if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5 $as_echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" \ || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "failed to load site script $ac_site_file See \`config.log' for more details" "$LINENO" 5; } fi done if test -r "$cache_file"; then # Some versions of bash will fail to source /dev/null (special files # actually), so we avoid doing that. DJGPP emulates it as a regular file. if test /dev/null != "$cache_file" && test -f "$cache_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5 $as_echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . "$cache_file";; *) . "./$cache_file";; esac fi else { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5 $as_echo "$as_me: creating cache $cache_file" >&6;} >$cache_file fi # Check that the precious variables saved in the cache have kept the same # value. ac_cache_corrupted=false for ac_var in $ac_precious_vars; do eval ac_old_set=\$ac_cv_env_${ac_var}_set eval ac_new_set=\$ac_env_${ac_var}_set eval ac_old_val=\$ac_cv_env_${ac_var}_value eval ac_new_val=\$ac_env_${ac_var}_value case $ac_old_set,$ac_new_set in set,) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} ac_cache_corrupted=: ;; ,);; *) if test "x$ac_old_val" != "x$ac_new_val"; then # differences in whitespace do not lead to failure. ac_old_val_w=`echo x $ac_old_val` ac_new_val_w=`echo x $ac_new_val` if test "$ac_old_val_w" != "$ac_new_val_w"; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5 $as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} ac_cache_corrupted=: else { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5 $as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;} eval $ac_var=\$ac_old_val fi { $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5 $as_echo "$as_me: former value: \`$ac_old_val'" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5 $as_echo "$as_me: current value: \`$ac_new_val'" >&2;} fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; *) ac_arg=$ac_var=$ac_new_val ;; esac case " $ac_configure_args " in *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. *) as_fn_append ac_configure_args " '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5 $as_echo "$as_me: error: changes in the environment can compromise the build" >&2;} as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5 fi ## -------------------- ## ## Main body of script. ## ## -------------------- ## ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu crlibm_version=`cat $srcdir/VERSION` 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=crlibm VERSION=$crlibm_version 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 ac_config_headers="$ac_config_headers crlibm_config.h" ISODATE=`date +%Y-%m-%d` # 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 case $host_os in hpux*) cat >>confdefs.h <<_ACEOF #define CRLIBM_TYPEOS_HPUX 1 _ACEOF ;; *cygwin* | *mingw* | *uwin* | *djgpp | *emx*) cat >>confdefs.h <<_ACEOF #define CRLIBM_TYPEOS_CYGWIN 1 _ACEOF ;; freebsd*|netbsd*|darwin*) cat >>confdefs.h <<_ACEOF #define CRLIBM_TYPEOS_BSD 1 _ACEOF ;; esac; case $host_cpu in alpha) cat >>confdefs.h <<_ACEOF #define CRLIBM_TYPECPU_ALPHA 1 _ACEOF ;; sparc) cat >>confdefs.h <<_ACEOF #define CRLIBM_TYPECPU_SPARC 1 _ACEOF ;; powerpc*) cat >>confdefs.h <<_ACEOF #define CRLIBM_TYPECPU_POWERPC 1 _ACEOF ;; i*86|k6|k7|pentium*|athlon*) cat >>confdefs.h <<_ACEOF #define CRLIBM_TYPECPU_X86 1 _ACEOF has_ia32_de=true;; x86_64|amd64) cat >>confdefs.h <<_ACEOF #define CRLIBM_TYPECPU_AMD64 1 _ACEOF has_ia32_de=true;; ia64) cat >>confdefs.h <<_ACEOF #define CRLIBM_TYPECPU_ITANIUM 1 _ACEOF has_ia64_de=true;; esac; { $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 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 for ac_prog in gcc icc cc 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 gcc icc 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_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 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 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 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 # Try to set compiler flags to get floating point arithmetics # to work. This is an old heritage and should become useless within 30 years # if test "${GCC}" != "yes" ; then case "${build}" in *-*-hpux* ) AM_CFLAGS="${AM_CFLAGS} -Wp,-H30000" ;; *-dec-osf* ) AM_CFLAGS="${AM_CFLAGS} -ieee" ;; *-apple-darwin* ) AM_CFLAGS="${AM_CFLAGS} -fno-common" ;; *-sgi-irix* ) ;; esac else case "${CC}" in *icc* ) # -Wall causes relocation errors with icc. AM_CFLAGS="${AM_CFLAGS} -wd269" ;; * ) case "${build}" in *-dec-osf* ) AM_CFLAGS="${AM_CFLAGS} -mieee -Wall" ;; *alpha*-*-linux* ) AM_CFLAGS="${AM_CFLAGS} -mieee -Wall" ;; *alpha*-*-freebsd* ) AM_CFLAGS="${AM_CFLAGS} -mieee -Wall" ;; *-apple-darwin* ) AM_CFLAGS="${AM_CFLAGS} -fno-common -Wall" ;; * ) AM_CFLAGS="${AM_CFLAGS} -Wall" ;; esac ;; esac fi if test x$CC = xicc; then COMPILER_ICC_TRUE= COMPILER_ICC_FALSE='#' else COMPILER_ICC_TRUE='#' COMPILER_ICC_FALSE= fi 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 { $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 ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor" >&5 $as_echo_n "checking how to run the C preprocessor... " >&6; } # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if ${ac_cv_prog_CPP+:} false; then : $as_echo_n "(cached) " >&6 else # Double quotes because CPP needs to be expanded for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp" do ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CPP=$CPP fi CPP=$ac_cv_prog_CPP else ac_cv_prog_CPP=$CPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CPP" >&5 $as_echo "$CPP" >&6; } ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details" "$LINENO" 5; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5 $as_echo_n "checking for grep that handles long lines and -e... " >&6; } if ${ac_cv_path_GREP+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$GREP"; then ac_path_GREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in grep ggrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_GREP" || continue # Check for GNU ac_path_GREP and select it if it is found. # Check for GNU $ac_path_GREP case `"$ac_path_GREP" --version 2>&1` in *GNU*) ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'GREP' >> "conftest.nl" "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_GREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_GREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_GREP"; then as_fn_error $? "no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_GREP=$GREP fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP" >&5 $as_echo "$ac_cv_path_GREP" >&6; } GREP="$ac_cv_path_GREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for egrep" >&5 $as_echo_n "checking for egrep... " >&6; } if ${ac_cv_path_EGREP+:} false; then : $as_echo_n "(cached) " >&6 else if echo a | $GREP -E '(a|b)' >/dev/null 2>&1 then ac_cv_path_EGREP="$GREP -E" else if test -z "$EGREP"; then ac_path_EGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in egrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_EGREP" || continue # Check for GNU ac_path_EGREP and select it if it is found. # Check for GNU $ac_path_EGREP case `"$ac_path_EGREP" --version 2>&1` in *GNU*) ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'EGREP' >> "conftest.nl" "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_EGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_EGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_EGREP"; then as_fn_error $? "no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_EGREP=$EGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP" >&5 $as_echo "$ac_cv_path_EGREP" >&6; } EGREP="$ac_cv_path_EGREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if ${ac_cv_header_stdc+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for an ANSI C-conforming const" >&5 $as_echo_n "checking for an ANSI C-conforming const... " >&6; } if ${ac_cv_c_const+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __cplusplus /* Ultrix mips cc rejects this sort of thing. */ typedef int charset[2]; const charset cs = { 0, 0 }; /* SunOS 4.1.1 cc rejects this. */ char const *const *pcpcc; char **ppc; /* NEC SVR4.0.2 mips cc rejects this. */ struct point {int x, y;}; static struct point const zero = {0,0}; /* AIX XL C 1.02.0.0 rejects this. It does not let you subtract one const X* pointer from another in an arm of an if-expression whose if-part is not a constant expression */ const char *g = "string"; pcpcc = &g + (g ? g-g : 0); /* HPUX 7.0 cc rejects these. */ ++pcpcc; ppc = (char**) pcpcc; pcpcc = (char const *const *) ppc; { /* SCO 3.2v4 cc rejects this sort of thing. */ char tx; char *t = &tx; char const *s = 0 ? (char *) 0 : (char const *) 0; *t++ = 0; if (s) return 0; } { /* Someone thinks the Sun supposedly-ANSI compiler will reject this. */ int x[] = {25, 17}; const int *foo = &x[0]; ++foo; } { /* Sun SC1.0 ANSI compiler rejects this -- but not the above. */ typedef const int *iptr; iptr p = 0; ++p; } { /* AIX XL C 1.02.0.0 rejects this sort of thing, saying "k.c", line 2.27: 1506-025 (S) Operand must be a modifiable lvalue. */ struct s { int j; const int *ap[3]; } bx; struct s *b = &bx; b->j = 5; } { /* ULTRIX-32 V3.1 (Rev 9) vcc rejects this */ const int foo = 10; if (!foo) return 0; } return !cs[0] && !zero.x; #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_const=yes else ac_cv_c_const=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_const" >&5 $as_echo "$ac_cv_c_const" >&6; } if test $ac_cv_c_const = no; then $as_echo "#define const /**/" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for inline" >&5 $as_echo_n "checking for inline... " >&6; } if ${ac_cv_c_inline+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_c_inline=no for ac_kw in inline __inline__ __inline; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifndef __cplusplus typedef int foo_t; static $ac_kw foo_t static_foo () {return 0; } $ac_kw foo_t foo () {return 0; } #endif _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_inline=$ac_kw fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext test "$ac_cv_c_inline" != no && break done fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_inline" >&5 $as_echo "$ac_cv_c_inline" >&6; } case $ac_cv_c_inline in inline | yes) ;; *) case $ac_cv_c_inline in no) ac_val=;; *) ac_val=$ac_cv_c_inline;; esac cat >>confdefs.h <<_ACEOF #ifndef __cplusplus #define inline $ac_val #endif _ACEOF ;; esac for ac_func in sqrt do : ac_fn_c_check_func "$LINENO" "sqrt" "ac_cv_func_sqrt" if test "x$ac_cv_func_sqrt" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_SQRT 1 _ACEOF fi done # 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 fenv.h do : ac_fn_c_check_header_mongrel "$LINENO" "fenv.h" "ac_cv_header_fenv_h" "$ac_includes_default" if test "x$ac_cv_header_fenv_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_FENV_H 1 _ACEOF fi done for ac_header in float.h do : ac_fn_c_check_header_mongrel "$LINENO" "float.h" "ac_cv_header_float_h" "$ac_includes_default" if test "x$ac_cv_header_float_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_FLOAT_H 1 _ACEOF fi done ac_fn_c_check_header_mongrel "$LINENO" "fpu_control.h" "ac_cv_header_fpu_control_h" "$ac_includes_default" if test "x$ac_cv_header_fpu_control_h" = xyes; then : has_fpu_control=yes else has_fpu_control=no fi if test x$has_fpu_control = xyes; then HAS_FPU_CONTROL_TRUE= HAS_FPU_CONTROL_FALSE='#' else HAS_FPU_CONTROL_TRUE='#' HAS_FPU_CONTROL_FALSE= fi if test x$has_fpu_control = xyes ; then cat >>confdefs.h <<_ACEOF #define CRLIBM_HAS_FPU_CONTROL 1 _ACEOF fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for log in -lm" >&5 $as_echo_n "checking for log in -lm... " >&6; } if ${ac_cv_lib_m_log+:} 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 log (); int main () { return log (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_m_log=yes else ac_cv_lib_m_log=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_log" >&5 $as_echo "$ac_cv_lib_m_log" >&6; } if test "x$ac_cv_lib_m_log" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBM 1 _ACEOF LIBS="-lm $LIBS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether byte ordering is bigendian" >&5 $as_echo_n "checking whether byte ordering is bigendian... " >&6; } if ${ac_cv_c_bigendian+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_c_bigendian=unknown # See if we're dealing with a universal compiler. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifndef __APPLE_CC__ not a universal capable compiler #endif typedef int dummy; _ACEOF if ac_fn_c_try_compile "$LINENO"; then : # Check for potential -arch flags. It is not universal unless # there are at least two -arch flags with different values. ac_arch= ac_prev= for ac_word in $CC $CFLAGS $CPPFLAGS $LDFLAGS; do if test -n "$ac_prev"; then case $ac_word in i?86 | x86_64 | ppc | ppc64) if test -z "$ac_arch" || test "$ac_arch" = "$ac_word"; then ac_arch=$ac_word else ac_cv_c_bigendian=universal break fi ;; esac ac_prev= elif test "x$ac_word" = "x-arch"; then ac_prev=arch fi done fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_c_bigendian = unknown; then # See if sys/param.h defines the BYTE_ORDER macro. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include int main () { #if ! (defined BYTE_ORDER && defined BIG_ENDIAN \ && defined LITTLE_ENDIAN && BYTE_ORDER && BIG_ENDIAN \ && LITTLE_ENDIAN) bogus endian macros #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : # It does; now see whether it defined to BIG_ENDIAN or not. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include int main () { #if BYTE_ORDER != BIG_ENDIAN not big endian #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_bigendian=yes else ac_cv_c_bigendian=no 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 if test $ac_cv_c_bigendian = unknown; then # See if defines _LITTLE_ENDIAN or _BIG_ENDIAN (e.g., Solaris). cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { #if ! (defined _LITTLE_ENDIAN || defined _BIG_ENDIAN) bogus endian macros #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : # It does; now see whether it defined to _BIG_ENDIAN or not. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { #ifndef _BIG_ENDIAN not big endian #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_bigendian=yes else ac_cv_c_bigendian=no 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 if test $ac_cv_c_bigendian = unknown; then # Compile a test program. if test "$cross_compiling" = yes; then : # Try to guess by grepping values from an object file. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ short int ascii_mm[] = { 0x4249, 0x4765, 0x6E44, 0x6961, 0x6E53, 0x7953, 0 }; short int ascii_ii[] = { 0x694C, 0x5454, 0x656C, 0x6E45, 0x6944, 0x6E61, 0 }; int use_ascii (int i) { return ascii_mm[i] + ascii_ii[i]; } short int ebcdic_ii[] = { 0x89D3, 0xE3E3, 0x8593, 0x95C5, 0x89C4, 0x9581, 0 }; short int ebcdic_mm[] = { 0xC2C9, 0xC785, 0x95C4, 0x8981, 0x95E2, 0xA8E2, 0 }; int use_ebcdic (int i) { return ebcdic_mm[i] + ebcdic_ii[i]; } extern int foo; int main () { return use_ascii (foo) == use_ebcdic (foo); ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : if grep BIGenDianSyS conftest.$ac_objext >/dev/null; then ac_cv_c_bigendian=yes fi if grep LiTTleEnDian conftest.$ac_objext >/dev/null ; then if test "$ac_cv_c_bigendian" = unknown; then ac_cv_c_bigendian=no else # finding both strings is unlikely to happen, but who knows? ac_cv_c_bigendian=unknown fi fi fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $ac_includes_default int main () { /* Are we little or big endian? From Harbison&Steele. */ union { long int l; char c[sizeof (long int)]; } u; u.l = 1; return u.c[sizeof (long int) - 1] == 1; ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ac_cv_c_bigendian=no else ac_cv_c_bigendian=yes 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_c_bigendian" >&5 $as_echo "$ac_cv_c_bigendian" >&6; } case $ac_cv_c_bigendian in #( yes) $as_echo "#define WORDS_BIGENDIAN 1" >>confdefs.h ;; #( no) ;; #( universal) $as_echo "#define AC_APPLE_UNIVERSAL_BUILD 1" >>confdefs.h ;; #( *) as_fn_error $? "unknown endianness presetting ac_cv_c_bigendian=no (or yes) will help" "$LINENO" 5 ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for long double with more range or precision than double" >&5 $as_echo_n "checking for long double with more range or precision than double... " >&6; } if ${ac_cv_type_long_double_wider+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include long double const a[] = { 0.0L, DBL_MIN, DBL_MAX, DBL_EPSILON, LDBL_MIN, LDBL_MAX, LDBL_EPSILON }; long double f (long double x) { return ((x + (unsigned long int) 10) * (-1 / x) + a[0] + (x ? f (x) : 'c')); } int main () { static int test_array [1 - 2 * !((0 < ((DBL_MAX_EXP < LDBL_MAX_EXP) + (DBL_MANT_DIG < LDBL_MANT_DIG) - (LDBL_MAX_EXP < DBL_MAX_EXP) - (LDBL_MANT_DIG < DBL_MANT_DIG))) && (int) LDBL_EPSILON == 0 )]; test_array [0] = 0; return test_array [0]; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_type_long_double_wider=yes else ac_cv_type_long_double_wider=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_type_long_double_wider" >&5 $as_echo "$ac_cv_type_long_double_wider" >&6; } if test $ac_cv_type_long_double_wider = yes; then $as_echo "#define HAVE_LONG_DOUBLE_WIDER 1" >>confdefs.h fi ac_cv_c_long_double=$ac_cv_type_long_double_wider if test $ac_cv_c_long_double = yes; then $as_echo "#define HAVE_LONG_DOUBLE 1" >>confdefs.h fi # The cast to long int works around a bug in the HP C Compiler # version HP92453-01 B.11.11.23709.GP, which incorrectly rejects # declarations like `int a3[[(sizeof (unsigned char)) >= 0]];'. # This bug is HP SR number 8606223364. { $as_echo "$as_me:${as_lineno-$LINENO}: checking size of int" >&5 $as_echo_n "checking size of int... " >&6; } if ${ac_cv_sizeof_int+:} false; then : $as_echo_n "(cached) " >&6 else if ac_fn_c_compute_int "$LINENO" "(long int) (sizeof (int))" "ac_cv_sizeof_int" "$ac_includes_default"; then : else if test "$ac_cv_type_int" = yes; then { { $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 "cannot compute sizeof (int) See \`config.log' for more details" "$LINENO" 5; } else ac_cv_sizeof_int=0 fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_sizeof_int" >&5 $as_echo "$ac_cv_sizeof_int" >&6; } cat >>confdefs.h <<_ACEOF #define SIZEOF_INT $ac_cv_sizeof_int _ACEOF # Check whether --enable-sse2 was given. if test "${enable_sse2+set}" = set; then : enableval=$enable_sse2; case $enableval in yes) cat >>confdefs.h <<_ACEOF #define HAS_SSE2 1 _ACEOF ;; no) ;; *) as_fn_error $? "bad value $enableval for --enable-sse2, need yes or no" "$LINENO" 5 ;; esac else enable_sse2=no fi if test x$enable_sse2 = xyes ; then USE_SSE2_TRUE= USE_SSE2_FALSE='#' else USE_SSE2_TRUE='#' USE_SSE2_FALSE= fi # Check whether --enable-interval-functions was given. if test "${enable_interval_functions+set}" = set; then : enableval=$enable_interval_functions; case $enableval in yes) cat >>confdefs.h <<_ACEOF #define BUILD_INTERVAL_FUNCTIONS 1 _ACEOF ;; no) ;; *) as_fn_error $? "bad value $enableval for --enable-interval-functions, need yes or no" "$LINENO" 5 ;; esac else enable_interval_functions=no fi if test x$enable_interval_functions = xyes ; then USE_INTERVAL_FUNCTIONS_TRUE= USE_INTERVAL_FUNCTIONS_FALSE='#' else USE_INTERVAL_FUNCTIONS_TRUE='#' USE_INTERVAL_FUNCTIONS_FALSE= fi # Check whether --enable-double-extended was given. if test "${enable_double_extended+set}" = set; then : enableval=$enable_double_extended; case $enableval in yes|no) ;; *) as_fn_error $? "bad value $enableval for --enable-double-extended, need yes or no" "$LINENO" 5 ;; esac else enable_double_extended=yes fi if test x$has_ia32_de = xtrue -a x$has_fpu_control = xyes -a x$enable_double_extended = xyes -a x$enable_interval_functions = xno ; then USE_HARDWARE_DE_TRUE= USE_HARDWARE_DE_FALSE='#' else USE_HARDWARE_DE_TRUE='#' USE_HARDWARE_DE_FALSE= fi # Check whether --enable-nbdigits was given. if test "${enable_nbdigits+set}" = set; then : enableval=$enable_nbdigits; case $enableval in *[0-9]) cat >>confdefs.h <<_ACEOF #define SCS_NB_WORDS $enableval _ACEOF ;; *) as_fn_error $? "bad value $enableval for --enable-nbdigits, number expected" "$LINENO" 5 ;; esac else cat >>confdefs.h <<_ACEOF #define SCS_NB_WORDS 8 _ACEOF fi # Check whether --enable-digitsize was given. if test "${enable_digitsize+set}" = set; then : enableval=$enable_digitsize; case $enableval in *[0-9]) cat >>confdefs.h <<_ACEOF #define SCS_NB_BITS $enableval _ACEOF ;; *) as_fn_error $? "bad value $enableval for --enable-digitsize, number expected" "$LINENO" 5 ;; esac else cat >>confdefs.h <<_ACEOF #define SCS_NB_BITS 30 _ACEOF fi # Check whether --enable-mpfr was given. if test "${enable_mpfr+set}" = set; then : enableval=$enable_mpfr; case $enableval in yes|no) ;; *) as_fn_error $? "bad value $enableval for --enable-mpfr, need yes or no" "$LINENO" 5 ;; esac else enable_mpfr=no fi # Check whether --enable-gmp was given. if test "${enable_gmp+set}" = set; then : enableval=$enable_gmp; case $enableval in yes|no) ;; *) as_fn_error $? "bad value $enableval for --enable-gmp, need yes or no" "$LINENO" 5 ;; esac else enable_gmp=no fi # Check whether --enable-ultim was given. if test "${enable_ultim+set}" = set; then : enableval=$enable_ultim; case $enableval in yes|no) ;; *) as_fn_error $? "bad value $enableval for --enable-ultim, need yes or no" "$LINENO" 5 ;; esac else enable_ultim=no fi # Check whether --enable-mcr was given. if test "${enable_mcr+set}" = set; then : enableval=$enable_mcr; case $enableval in yes|no) ;; *) as_fn_error $? "bad value $enableval for --enable-mcr, need yes or no" "$LINENO" 5 ;; esac else enable_mcr=no fi if test "$enable_gmp" = "yes" -o "$enable_mpfr" = "yes"; then # Check whether --with-gmp_include was given. if test "${with_gmp_include+set}" = set; then : withval=$with_gmp_include; with_gmp_include=$withval fi # Check whether --with-gmp_lib was given. if test "${with_gmp_lib+set}" = set; then : withval=$with_gmp_lib; with_gmp_lib=$withval fi # Check whether --with-gmp was given. if test "${with_gmp+set}" = set; then : withval=$with_gmp; with_gmp_include=$withval/include with_gmp_lib=$withval/lib fi if test -d "$with_gmp_include"; then CPPFLAGS="$CPPFLAGS -I$with_gmp_include" else with_gmp_include= fi if ` test "$with_gmp_lib" ` then { $as_echo "$as_me:${as_lineno-$LINENO}: checking gmp library" >&5 $as_echo_n "checking gmp library... " >&6; } if test -r "$with_gmp_lib/libgmp.a" -o -r "$with_gmp_lib/libgmp.so" then LDFLAGS="$LDFLAGS -L$with_gmp_lib" LIBS ="$LIBS -lgmp" else as_fn_error $? "gmp not found" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lgmp" >&5 $as_echo_n "checking for main in -lgmp... " >&6; } if ${ac_cv_lib_gmp_main+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lgmp $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_gmp_main=yes else ac_cv_lib_gmp_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_gmp_main" >&5 $as_echo "$ac_cv_lib_gmp_main" >&6; } if test "x$ac_cv_lib_gmp_main" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBGMP 1 _ACEOF LIBS="-lgmp $LIBS" else as_fn_error $? "gmp not found" "$LINENO" 5 fi fi for ac_header in gmp.h do : ac_fn_c_check_header_mongrel "$LINENO" "gmp.h" "ac_cv_header_gmp_h" "$ac_includes_default" if test "x$ac_cv_header_gmp_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_GMP_H 1 _ACEOF fi done { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lgmp" >&5 $as_echo_n "checking for main in -lgmp... " >&6; } if ${ac_cv_lib_gmp_main+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lgmp $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_gmp_main=yes else ac_cv_lib_gmp_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_gmp_main" >&5 $as_echo "$ac_cv_lib_gmp_main" >&6; } if test "x$ac_cv_lib_gmp_main" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBGMP 1 _ACEOF LIBS="-lgmp $LIBS" fi fi if test "$enable_mpfr" = "yes"; then # Check whether --with-mpfr_include was given. if test "${with_mpfr_include+set}" = set; then : withval=$with_mpfr_include; with_mpfr_include=$withval fi # Check whether --with-mpfr_lib was given. if test "${with_mpfr_lib+set}" = set; then : withval=$with_mpfr_lib; with_mpfr_lib=$withval fi # Check whether --with-mpfr was given. if test "${with_mpfr+set}" = set; then : withval=$with_mpfr; with_mpfr_include=$withval/include with_mpfr_lib=$withval/lib fi if test -d "$with_mpfr_include"; then CPPFLAGS="$CPPFLAGS -I$with_mpfr_include" else with_mpfr_include= fi if ` test "$with_mpfr_lib" ` then { $as_echo "$as_me:${as_lineno-$LINENO}: checking mpfr library" >&5 $as_echo_n "checking mpfr library... " >&6; } if test -r "$with_mpfr_lib/libmpfr.a" -o -r "$with_mpfr_lib/libmpfr.so" then LDFLAGS="$LDFLAGS -L$with_mpfr_lib" LIBS ="$LIBS -lmpfr" else as_fn_error $? "mpfr not found" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lmpfr" >&5 $as_echo_n "checking for main in -lmpfr... " >&6; } if ${ac_cv_lib_mpfr_main+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lmpfr $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_mpfr_main=yes else ac_cv_lib_mpfr_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_mpfr_main" >&5 $as_echo "$ac_cv_lib_mpfr_main" >&6; } if test "x$ac_cv_lib_mpfr_main" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBMPFR 1 _ACEOF LIBS="-lmpfr $LIBS" else as_fn_error $? "mpfr not found" "$LINENO" 5 fi fi for ac_header in mpfr.h do : ac_fn_c_check_header_compile "$LINENO" "mpfr.h" "ac_cv_header_mpfr_h" "#include " if test "x$ac_cv_header_mpfr_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_MPFR_H 1 _ACEOF fi done { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lmpfr" >&5 $as_echo_n "checking for main in -lmpfr... " >&6; } if ${ac_cv_lib_mpfr_main+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lmpfr $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_mpfr_main=yes else ac_cv_lib_mpfr_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_mpfr_main" >&5 $as_echo "$ac_cv_lib_mpfr_main" >&6; } if test "x$ac_cv_lib_mpfr_main" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBMPFR 1 _ACEOF LIBS="-lmpfr $LIBS" fi fi if test "$enable_ultim" = "yes"; then # Check whether --with-ultim_include was given. if test "${with_ultim_include+set}" = set; then : withval=$with_ultim_include; with_ultim_include=$withval fi # Check whether --with-ultim_lib was given. if test "${with_ultim_lib+set}" = set; then : withval=$with_ultim_lib; with_ultim_lib=$withval fi # Check whether --with-ultim was given. if test "${with_ultim+set}" = set; then : withval=$with_ultim; with_ultim_include=$withval/include with_ultim_lib=$withval/lib fi if test -d "$with_ultim_include"; then CPPFLAGS="$CPPFLAGS -I$with_ultim_include" else with_ultim_include= fi if ` test "$with_ultim_lib" ` then { $as_echo "$as_me:${as_lineno-$LINENO}: checking ultim library" >&5 $as_echo_n "checking ultim library... " >&6; } if test -r "$with_ultim_lib/libultim.a" -o -r "$with_ultim_lib/libultim.so" then LDFLAGS="$LDFLAGS -L$with_ultim_lib" LIBS ="$LIBS -lultim" else as_fn_error $? "ultim not found" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lultim" >&5 $as_echo_n "checking for main in -lultim... " >&6; } if ${ac_cv_lib_ultim_main+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lultim $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_ultim_main=yes else ac_cv_lib_ultim_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_ultim_main" >&5 $as_echo "$ac_cv_lib_ultim_main" >&6; } if test "x$ac_cv_lib_ultim_main" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBULTIM 1 _ACEOF LIBS="-lultim $LIBS" else as_fn_error $? "ultim not found" "$LINENO" 5 fi fi for ac_header in MathLib.h do : ac_fn_c_check_header_mongrel "$LINENO" "MathLib.h" "ac_cv_header_MathLib_h" "$ac_includes_default" if test "x$ac_cv_header_MathLib_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_MATHLIB_H 1 _ACEOF fi done { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lultim" >&5 $as_echo_n "checking for main in -lultim... " >&6; } if ${ac_cv_lib_ultim_main+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lultim $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_ultim_main=yes else ac_cv_lib_ultim_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_ultim_main" >&5 $as_echo "$ac_cv_lib_ultim_main" >&6; } if test "x$ac_cv_lib_ultim_main" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBULTIM 1 _ACEOF LIBS="-lultim $LIBS" fi fi if test "$enable_mcr" = "yes"; then # Check whether --with-mcr_include was given. if test "${with_mcr_include+set}" = set; then : withval=$with_mcr_include; with_mcr_include=$withval fi # Check whether --with-mcr_lib was given. if test "${with_mcr_lib+set}" = set; then : withval=$with_mcr_lib; with_mcr_lib=$withval fi # Check whether --with-mcr was given. if test "${with_mcr+set}" = set; then : withval=$with_mcr; with_mcr_include=$withval/include with_mcr_lib=$withval/lib fi if test -d "$with_mcr_include"; then CPPFLAGS="$CPPFLAGS -I$with_mcr_include" else with_mcr_include= fi if ` test "$with_mcr_lib" ` then { $as_echo "$as_me:${as_lineno-$LINENO}: checking mcr library" >&5 $as_echo_n "checking mcr library... " >&6; } if test -r "$with_mcr_lib/libmcr.a" -o -r "$with_mcr_lib/libmcr.so" then LDFLAGS="$LDFLAGS -L$with_mcr_lib" LIBS ="$LIBS -lmcr" else as_fn_error $? "mcr not found" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lmcr" >&5 $as_echo_n "checking for main in -lmcr... " >&6; } if ${ac_cv_lib_mcr_main+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lmcr $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_mcr_main=yes else ac_cv_lib_mcr_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_mcr_main" >&5 $as_echo "$ac_cv_lib_mcr_main" >&6; } if test "x$ac_cv_lib_mcr_main" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBMCR 1 _ACEOF LIBS="-lmcr $LIBS" else as_fn_error $? "mcr not found" "$LINENO" 5 fi fi for ac_header in libmcr.h do : ac_fn_c_check_header_mongrel "$LINENO" "libmcr.h" "ac_cv_header_libmcr_h" "$ac_includes_default" if test "x$ac_cv_header_libmcr_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBMCR_H 1 _ACEOF fi done { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lmcr" >&5 $as_echo_n "checking for main in -lmcr... " >&6; } if ${ac_cv_lib_mcr_main+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lmcr $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_mcr_main=yes else ac_cv_lib_mcr_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_mcr_main" >&5 $as_echo "$ac_cv_lib_mcr_main" >&6; } if test "x$ac_cv_lib_mcr_main" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBMCR 1 _ACEOF LIBS="-lmcr $LIBS" fi fi #AC_CONFIG_SUBDIRS([scs_lib]) ac_config_files="$ac_config_files Makefile scs_lib/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}' DEFS=-DHAVE_CONFIG_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 "${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 "${COMPILER_ICC_TRUE}" && test -z "${COMPILER_ICC_FALSE}"; then as_fn_error $? "conditional \"COMPILER_ICC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${HAS_FPU_CONTROL_TRUE}" && test -z "${HAS_FPU_CONTROL_FALSE}"; then as_fn_error $? "conditional \"HAS_FPU_CONTROL\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${USE_SSE2_TRUE}" && test -z "${USE_SSE2_FALSE}"; then as_fn_error $? "conditional \"USE_SSE2\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${USE_INTERVAL_FUNCTIONS_TRUE}" && test -z "${USE_INTERVAL_FUNCTIONS_FALSE}"; then as_fn_error $? "conditional \"USE_INTERVAL_FUNCTIONS\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${USE_HARDWARE_DE_TRUE}" && test -z "${USE_HARDWARE_DE_FALSE}"; then as_fn_error $? "conditional \"USE_HARDWARE_DE\" 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 $as_me, which was generated by GNU Autoconf 2.69. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ on `(hostname || uname -n) 2>/dev/null | sed 1q` " _ACEOF case $ac_config_files in *" "*) set x $ac_config_files; shift; ac_config_files=$*;; esac case $ac_config_headers in *" "*) set x $ac_config_headers; shift; ac_config_headers=$*;; esac cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # Files that config.status was made for. config_files="$ac_config_files" config_headers="$ac_config_headers" 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 --header=FILE[:TEMPLATE] instantiate the configuration header FILE Configuration files: $config_files Configuration headers: $config_headers 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="\\ config.status configured by $0, generated by GNU Autoconf 2.69, with options \\"\$ac_cs_config\\" Copyright (C) 2012 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." ac_pwd='$ac_pwd' srcdir='$srcdir' 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;; --header | --heade | --head | --hea ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; esac as_fn_append CONFIG_HEADERS " '$ac_optarg'" ac_need_defaults=false;; --he | --h) # Conflict between --help and --header as_fn_error $? "ambiguous option: \`$1' Try \`$0 --help' for more information.";; --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" _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 "crlibm_config.h") CONFIG_HEADERS="$CONFIG_HEADERS crlibm_config.h" ;; "depfiles") CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;; "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;; "scs_lib/Makefile") CONFIG_FILES="$CONFIG_FILES scs_lib/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_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers 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" # Set up the scripts for CONFIG_HEADERS section. # No need to generate them if there are no CONFIG_HEADERS. # This happens for instance with `./config.status Makefile'. if test -n "$CONFIG_HEADERS"; then cat >"$ac_tmp/defines.awk" <<\_ACAWK || BEGIN { _ACEOF # Transform confdefs.h into an awk script `defines.awk', embedded as # here-document in config.status, that substitutes the proper values into # config.h.in to produce config.h. # Create a delimiter string that does not exist in confdefs.h, to ease # handling of long lines. ac_delim='%!_!# ' for ac_last_try in false false :; do ac_tt=`sed -n "/$ac_delim/p" confdefs.h` if test -z "$ac_tt"; then break elif $ac_last_try; then as_fn_error $? "could not make $CONFIG_HEADERS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done # For the awk script, D is an array of macro values keyed by name, # likewise P contains macro parameters if any. Preserve backslash # newline sequences. ac_word_re=[_$as_cr_Letters][_$as_cr_alnum]* sed -n ' s/.\{148\}/&'"$ac_delim"'/g t rset :rset s/^[ ]*#[ ]*define[ ][ ]*/ / t def d :def s/\\$// t bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3"/p s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2"/p d :bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3\\\\\\n"\\/p t cont s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2\\\\\\n"\\/p t cont d :cont n s/.\{148\}/&'"$ac_delim"'/g t clear :clear s/\\$// t bsnlc s/["\\]/\\&/g; s/^/"/; s/$/"/p d :bsnlc s/["\\]/\\&/g; s/^/"/; s/$/\\\\\\n"\\/p b cont ' >$CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 for (key in D) D_is_set[key] = 1 FS = "" } /^[\t ]*#[\t ]*(define|undef)[\t ]+$ac_word_re([\t (]|\$)/ { line = \$ 0 split(line, arg, " ") if (arg[1] == "#") { defundef = arg[2] mac1 = arg[3] } else { defundef = substr(arg[1], 2) mac1 = arg[2] } split(mac1, mac2, "(") #) macro = mac2[1] prefix = substr(line, 1, index(line, defundef) - 1) if (D_is_set[macro]) { # Preserve the white space surrounding the "#". print prefix "define", macro P[macro] D[macro] next } else { # Replace #undef with comments. This is necessary, for example, # in the case of _POSIX_SOURCE, which is predefined and required # on some systems where configure will not decide to define it. if (defundef == "undef") { print "/*", prefix defundef, macro, "*/" next } } } { print } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 as_fn_error $? "could not setup config headers machinery" "$LINENO" 5 fi # test -n "$CONFIG_HEADERS" eval set X " :F $CONFIG_FILES :H $CONFIG_HEADERS :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 ;; :H) # # CONFIG_HEADER # if test x"$ac_file" != x-; then { $as_echo "/* $configure_input */" \ && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs" } >"$ac_tmp/config.h" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 if diff "$ac_file" "$ac_tmp/config.h" >/dev/null 2>&1; then { $as_echo "$as_me:${as_lineno-$LINENO}: $ac_file is unchanged" >&5 $as_echo "$as_me: $ac_file is unchanged" >&6;} else rm -f "$ac_file" mv "$ac_tmp/config.h" "$ac_file" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 fi else $as_echo "/* $configure_input */" \ && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs" \ || as_fn_error $? "could not create -" "$LINENO" 5 fi # Compute "$ac_file"'s index in $config_headers. _am_arg="$ac_file" _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" || $as_expr X"$_am_arg" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$_am_arg" : 'X\(//\)[^/]' \| \ X"$_am_arg" : 'X\(//\)$' \| \ X"$_am_arg" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$_am_arg" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'`/stamp-h$_am_stamp_count ;; :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 } ;; 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 interval-2.1.0/src/crlibm/config.guess0000755000175000017500000012355013031037010017271 0ustar oliveroliver#! /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: interval-2.1.0/src/crlibm/config.sub0000755000175000017500000010577513031037010016745 0ustar oliveroliver#! /bin/sh # Configuration validation subroutine script. # Copyright 1992-2014 Free Software Foundation, Inc. timestamp='2014-09-11' # 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 \ | riscv32 | riscv64 \ | 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 ;; moxiebox) basic_machine=moxie-unknown os=-moxiebox ;; msdos) basic_machine=i386-pc os=-msdos ;; ms1-*) basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'` ;; msys) basic_machine=i686-pc os=-msys ;; mvs) basic_machine=i370-ibm os=-mvs ;; nacl) basic_machine=le32-unknown os=-nacl ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; netbsd386) basic_machine=i386-unknown os=-netbsd ;; netwinder) basic_machine=armv4l-rebel os=-linux ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; news1000) basic_machine=m68030-sony os=-newsos ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; necv70) basic_machine=v70-nec os=-sysv ;; next | m*-next ) basic_machine=m68k-next case $os in -nextstep* ) ;; -ns2*) os=-nextstep2 ;; *) os=-nextstep3 ;; esac ;; nh3000) basic_machine=m68k-harris os=-cxux ;; nh[45]000) basic_machine=m88k-harris os=-cxux ;; nindy960) basic_machine=i960-intel os=-nindy ;; mon960) basic_machine=i960-intel os=-mon960 ;; nonstopux) basic_machine=mips-compaq os=-nonstopux ;; np1) basic_machine=np1-gould ;; neo-tandem) basic_machine=neo-tandem ;; nse-tandem) basic_machine=nse-tandem ;; nsr-tandem) basic_machine=nsr-tandem ;; 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* | -moxiebox* \ | -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: interval-2.1.0/src/crlibm/install-sh0000755000175000017500000003413713031037010016757 0ustar oliveroliver#!/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. ;; *) # $RANDOM is not portable (e.g. dash); use it when possible to # lower collision chance tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$ trap 'ret=$?; rmdir "$tmpdir/a/b" "$tmpdir/a" "$tmpdir" 2>/dev/null; exit $ret' 0 # As "mkdir -p" follows symlinks and we work in /tmp possibly; so # create the $tmpdir first (and fail if unsuccessful) to make sure # that nobody tries to guess the $tmpdir name. if (umask $mkdir_umask && $mkdirprog $mkdir_mode "$tmpdir" && exec $mkdirprog $mkdir_mode -p -- "$tmpdir/a/b") >/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. test_tmpdir="$tmpdir/a" ls_ld_tmpdir=`ls -ld "$test_tmpdir"` case $ls_ld_tmpdir in d????-?r-*) different_mode=700;; d????-?--*) different_mode=755;; *) false;; esac && $mkdirprog -m$different_mode -p -- "$test_tmpdir" && { ls_ld_tmpdir_1=`ls -ld "$test_tmpdir"` test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1" } } then posix_mkdir=: fi rmdir "$tmpdir/a/b" "$tmpdir/a" "$tmpdir" else # Remove any dirs left behind by ancient mkdir implementations. rmdir ./$mkdir_mode ./-p ./-- "$tmpdir" 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: interval-2.1.0/src/crlibm/Makefile.in0000644000175000017500000011101313031037010017005 0ustar oliveroliver# 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@ subdir = . DIST_COMMON = INSTALL NEWS README AUTHORS ChangeLog \ $(srcdir)/Makefile.in $(srcdir)/Makefile.am \ $(top_srcdir)/configure $(am__configure_deps) \ $(srcdir)/crlibm_config.h.in $(include_HEADERS) COPYING \ COPYING.LIB TODO compile config.guess config.sub install-sh \ missing ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(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_HEADER = crlibm_config.h 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)$(includedir)" LIBRARIES = $(lib_LIBRARIES) AR = ar ARFLAGS = cru AM_V_AR = $(am__v_AR_@AM_V@) am__v_AR_ = $(am__v_AR_@AM_DEFAULT_V@) am__v_AR_0 = @echo " AR " $@; am__v_AR_1 = libcrlibm_a_AR = $(AR) $(ARFLAGS) libcrlibm_a_DEPENDENCIES = scs_lib/scs_private.o \ scs_lib/addition_scs.o scs_lib/division_scs.o \ scs_lib/print_scs.o scs_lib/double2scs.o scs_lib/zero_scs.o \ scs_lib/multiplication_scs.o scs_lib/scs2double.o am__libcrlibm_a_SOURCES_DIST = crlibm.h crlibm_private.h \ crlibm_private.c triple-double.h triple-double.c exp-td.h \ exp-td.c exp-td-standalone.c expm1-standalone.c expm1.h \ expm1.c log.c log.h log1p.c rem_pio2_accurate.h \ rem_pio2_accurate.c trigo_fast.c trigo_fast.h trigo_accurate.c \ trigo_accurate.h trigpi.c trigpi.h asincos.h asincos.c pow.h \ pow.c atan_fast.c atan_fast.h atan_accurate.h atan_accurate.c \ csh_fast.h csh_fast.c double-extended.h log-de.c log-de.h \ log10-td.h log10-td.c log2-td.h log2-td.c @USE_HARDWARE_DE_FALSE@am_libcrlibm_a_OBJECTS = \ @USE_HARDWARE_DE_FALSE@ crlibm_private.$(OBJEXT) \ @USE_HARDWARE_DE_FALSE@ triple-double.$(OBJEXT) \ @USE_HARDWARE_DE_FALSE@ exp-td.$(OBJEXT) \ @USE_HARDWARE_DE_FALSE@ exp-td-standalone.$(OBJEXT) \ @USE_HARDWARE_DE_FALSE@ expm1-standalone.$(OBJEXT) \ @USE_HARDWARE_DE_FALSE@ expm1.$(OBJEXT) log.$(OBJEXT) \ @USE_HARDWARE_DE_FALSE@ log1p.$(OBJEXT) \ @USE_HARDWARE_DE_FALSE@ rem_pio2_accurate.$(OBJEXT) \ @USE_HARDWARE_DE_FALSE@ trigo_fast.$(OBJEXT) \ @USE_HARDWARE_DE_FALSE@ trigo_accurate.$(OBJEXT) \ @USE_HARDWARE_DE_FALSE@ trigpi.$(OBJEXT) asincos.$(OBJEXT) \ @USE_HARDWARE_DE_FALSE@ pow.$(OBJEXT) atan_fast.$(OBJEXT) \ @USE_HARDWARE_DE_FALSE@ atan_accurate.$(OBJEXT) \ @USE_HARDWARE_DE_FALSE@ csh_fast.$(OBJEXT) @USE_HARDWARE_DE_TRUE@am_libcrlibm_a_OBJECTS = \ @USE_HARDWARE_DE_TRUE@ crlibm_private.$(OBJEXT) \ @USE_HARDWARE_DE_TRUE@ triple-double.$(OBJEXT) exp-td.$(OBJEXT) \ @USE_HARDWARE_DE_TRUE@ exp-td-standalone.$(OBJEXT) \ @USE_HARDWARE_DE_TRUE@ expm1-standalone.$(OBJEXT) \ @USE_HARDWARE_DE_TRUE@ expm1.$(OBJEXT) log-de.$(OBJEXT) \ @USE_HARDWARE_DE_TRUE@ log1p.$(OBJEXT) log10-td.$(OBJEXT) \ @USE_HARDWARE_DE_TRUE@ log2-td.$(OBJEXT) \ @USE_HARDWARE_DE_TRUE@ rem_pio2_accurate.$(OBJEXT) \ @USE_HARDWARE_DE_TRUE@ trigo_fast.$(OBJEXT) \ @USE_HARDWARE_DE_TRUE@ trigo_accurate.$(OBJEXT) \ @USE_HARDWARE_DE_TRUE@ trigpi.$(OBJEXT) asincos.$(OBJEXT) \ @USE_HARDWARE_DE_TRUE@ pow.$(OBJEXT) atan_fast.$(OBJEXT) \ @USE_HARDWARE_DE_TRUE@ atan_accurate.$(OBJEXT) \ @USE_HARDWARE_DE_TRUE@ csh_fast.$(OBJEXT) libcrlibm_a_OBJECTS = $(am_libcrlibm_a_OBJECTS) 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 = am__depfiles_maybe = 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 = $(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 = SOURCES = $(libcrlibm_a_SOURCES) DIST_SOURCES = $(am__libcrlibm_a_SOURCES_DIST) RECURSIVE_TARGETS = all-recursive check-recursive cscopelist-recursive \ ctags-recursive dvi-recursive html-recursive info-recursive \ install-data-recursive install-dvi-recursive \ install-exec-recursive install-html-recursive \ install-info-recursive install-pdf-recursive \ install-ps-recursive install-recursive installcheck-recursive \ installdirs-recursive pdf-recursive ps-recursive \ tags-recursive uninstall-recursive am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac HEADERS = $(include_HEADERS) RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \ distclean-recursive maintainer-clean-recursive am__recursive_targets = \ $(RECURSIVE_TARGETS) \ $(RECURSIVE_CLEAN_TARGETS) \ $(am__extra_recursive_targets) AM_RECURSIVE_TARGETS = $(am__recursive_targets:-recursive=) TAGS CTAGS \ cscope distdir dist dist-all distcheck am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) \ $(LISP)crlibm_config.h.in # 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 DIST_SUBDIRS = $(SUBDIRS) 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) am__relativize = \ dir0=`pwd`; \ sed_first='s,^\([^/]*\)/.*$$,\1,'; \ sed_rest='s,^[^/]*/*,,'; \ sed_last='s,^.*/\([^/]*\)$$,\1,'; \ sed_butlast='s,/*[^/]*$$,,'; \ while test -n "$$dir1"; do \ first=`echo "$$dir1" | sed -e "$$sed_first"`; \ if test "$$first" != "."; then \ if test "$$first" = ".."; then \ dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \ dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \ else \ first2=`echo "$$dir2" | sed -e "$$sed_first"`; \ if test "$$first2" = "$$first"; then \ dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \ else \ dir2="../$$dir2"; \ fi; \ dir0="$$dir0"/"$$first"; \ fi; \ fi; \ dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \ done; \ reldir="$$dir2" 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@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ ISODATE = @ISODATE@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ OBJEXT = @OBJEXT@ 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@ RANLIB = @RANLIB@ 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_CC = @ac_ct_CC@ 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@ 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@ lib_LIBRARIES = libcrlibm.a @USE_HARDWARE_DE_FALSE@libcrlibm_a_SOURCES = \ @USE_HARDWARE_DE_FALSE@ crlibm.h crlibm_private.h crlibm_private.c \ @USE_HARDWARE_DE_FALSE@ triple-double.h triple-double.c\ @USE_HARDWARE_DE_FALSE@ exp-td.h exp-td.c exp-td-standalone.c expm1-standalone.c \ @USE_HARDWARE_DE_FALSE@ expm1.h expm1.c \ @USE_HARDWARE_DE_FALSE@ log.c log.h \ @USE_HARDWARE_DE_FALSE@ log1p.c \ @USE_HARDWARE_DE_FALSE@ rem_pio2_accurate.h rem_pio2_accurate.c \ @USE_HARDWARE_DE_FALSE@ trigo_fast.c trigo_fast.h trigo_accurate.c trigo_accurate.h \ @USE_HARDWARE_DE_FALSE@ trigpi.c trigpi.h \ @USE_HARDWARE_DE_FALSE@ asincos.h asincos.c \ @USE_HARDWARE_DE_FALSE@ pow.h pow.c\ @USE_HARDWARE_DE_FALSE@ atan_fast.c atan_fast.h atan_accurate.h atan_accurate.c \ @USE_HARDWARE_DE_FALSE@ csh_fast.h csh_fast.c # shared libraries need libtool. We'll do it later. #lib_LTLIBRARIES = libcrlibm.la # Note that at the moment, asking for intervals disables double-extended @USE_HARDWARE_DE_TRUE@libcrlibm_a_SOURCES = \ @USE_HARDWARE_DE_TRUE@ crlibm.h crlibm_private.h crlibm_private.c double-extended.h\ @USE_HARDWARE_DE_TRUE@ triple-double.h triple-double.c\ @USE_HARDWARE_DE_TRUE@ exp-td.h exp-td.c exp-td-standalone.c expm1-standalone.c \ @USE_HARDWARE_DE_TRUE@ expm1.h expm1.c \ @USE_HARDWARE_DE_TRUE@ log-de.c log-de.h \ @USE_HARDWARE_DE_TRUE@ log1p.c \ @USE_HARDWARE_DE_TRUE@ log10-td.h log10-td.c \ @USE_HARDWARE_DE_TRUE@ log2-td.h log2-td.c \ @USE_HARDWARE_DE_TRUE@ rem_pio2_accurate.h rem_pio2_accurate.c \ @USE_HARDWARE_DE_TRUE@ trigo_fast.c trigo_fast.h trigo_accurate.c trigo_accurate.h \ @USE_HARDWARE_DE_TRUE@ trigpi.c trigpi.h \ @USE_HARDWARE_DE_TRUE@ asincos.h asincos.c \ @USE_HARDWARE_DE_TRUE@ pow.h pow.c\ @USE_HARDWARE_DE_TRUE@ atan_fast.c atan_fast.h atan_accurate.h atan_accurate.c \ @USE_HARDWARE_DE_TRUE@ csh_fast.h csh_fast.c # add all the scs_lib useful functions libcrlibm_a_LIBADD = scs_lib/scs_private.o scs_lib/addition_scs.o \ scs_lib/division_scs.o scs_lib/print_scs.o\ scs_lib/double2scs.o scs_lib/zero_scs.o\ scs_lib/multiplication_scs.o scs_lib/scs2double.o include_HEADERS = crlibm.h SUBDIRS = scs_lib . @COMPILER_ICC_FALSE@@USE_SSE2_FALSE@AM_CFLAGS = -std=c99 -Wall -O3 @COMPILER_ICC_FALSE@@USE_SSE2_TRUE@AM_CFLAGS = -std=c99 -Wall -msse2 -mfpmath=sse # Add your compiler here. Default is assumed to be gcc. # mp means maintain precision. Should be useless with std=c99, this is an ICC bug @COMPILER_ICC_TRUE@AM_CFLAGS = -std=c99 -mp -Qoption,cpp,--extended_float_types -IPF_fp_speculationsafe EXTRA_DIST = VERSION TODO\ maple/common-procedures.mpl \ maple/double-extended.mpl maple/triple-double.mpl\ maple/exp-td.mpl maple/csh.mpl \ maple/log-td.mpl maple/log-de.mpl \ maple/log2-td.mpl maple/log10-td.mpl \ maple/trigo.mpl maple/atan.mpl maple/atan-pentium.mpl \ maple/asin-td.mpl maple/acos-td.mpl \ maple/sqrt.mpl \ maple/expm1.mpl \ maple/gal.mpl \ maple/pow.mpl \ maple/atan-itanium.mpl \ gappa/trigos/SinCosCase3.gappa gappa/trigos/TanCase2.gappa \ gappa/trigos/TanCase2.gappa \ gappa/trigos/SinCosCase3.gappa gappa/trigos/TanCase2.gappa \ gappa/sqrt12.gappa gappa/sqrt13.gappa gappa/sqrt-proof.sh gappa/sqrt.sed \ gappa/log-de/log-de-acc-index0-E0.gappa gappa/log-de/log-de-index0-E0.gappa \ gappa/log-de/log-de-acc-index0-E1N.gappa gappa/log-de/log-de-index0-E1N.gappa \ gappa/log-de/log-de-acc-index1N-E0.gappa gappa/log-de/log-de-index1N-E0N.gappa \ gappa/log-de/log-de-acc-index1N-E1N.gappa gappa/log-de/README \ gappa/log-td/log-td.gappa gappa/log-td/log-td-E0.gappa \ gappa/log-td/log-td-E0-logir0.gappa gappa/log-td/log-td-accurate.gappa \ gappa/log-td/log-td-accurate-E0.gappa gappa/log-td/log-td-accurate-E0-logir0.gappa \ gappa/exp-td/exp-td-accurate1.gappa gappa/exp-td/exp-td-accurate2.gappa \ gappa/exp-td/exp-td-accurate3.gappa gappa/exp-td/exp-td-accurate4.gappa \ gappa/exp-td/exp-td-proof.sh \ gappa/trigpi/cospi-accurate.gappa gappa/trigpi/cospi-quick.gappa \ gappa/trigpi/sinpi-accurate.gappa gappa/trigpi/sinpi-quick.gappa \ gappa/asin/asinAccuR0.gappa gappa/asin/asinAccuR1.gappa \ gappa/asin/asinAccuR2.gappa gappa/asin/asinAccuR3.gappa \ gappa/asin/asinAccuR4.gappa gappa/asin/asinAccuR5.gappa \ gappa/asin/asinAccuR6.gappa gappa/asin/asinAccuR7.gappa \ gappa/asin/asinAccuR8.gappa gappa/asin/asinAccuR9.gappa \ gappa/asin/asinQuickR0.gappa gappa/asin/asinQuickR1.gappa \ gappa/asin/asinQuickR2.gappa gappa/asin/asinQuickR3.gappa \ gappa/asin/asinQuickR4.gappa gappa/asin/asinQuickR5.gappa \ gappa/asin/asinQuickR6.gappa gappa/asin/asinQuickR7.gappa \ gappa/asin/asinQuickR8.gappa gappa/asin/asinQuickR9.gappa \ docs/latex/crlibm.tex \ docs/latex/0_intro.tex docs/latex/0_getting-started.tex\ docs/latex/1_common.tex docs/latex/sqrt.tex \ docs/latex/exp.tex docs/latex/expm1.tex \ docs/latex/log.tex docs/latex/log1p.tex docs/latex/log2.tex docs/latex/log10.tex\ docs/latex/asin.tex docs/latex/acos.tex docs/latex/atan.tex \ docs/latex/csh.tex docs/latex/trigo.tex docs/latex/trigpi.tex \ docs/latex/pow.tex \ docs/latex/fig_scs docs/latex/fig_exp\ docs/latex/elem-fun.bib\ docs/latex/tripledoubleprocedures.tex \ scs_lib/tests/tbx_timing.h \ tests/testperfs.sh\ triple-double.h double-extended.h \ log-de.c log-de.h log-td.c log-td.h\ atan-pentium.c atan-itanium.c all: crlibm_config.h $(MAKE) $(AM_MAKEFLAGS) all-recursive .SUFFIXES: .SUFFIXES: .c .o .obj am--refresh: Makefile @: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ echo ' cd $(srcdir) && $(AUTOMAKE) --gnu --ignore-deps'; \ $(am__cd) $(srcdir) && $(AUTOMAKE) --gnu --ignore-deps \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu --ignore-deps 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: $(am__configure_deps) $(am__cd) $(srcdir) && $(AUTOCONF) $(ACLOCAL_M4): $(am__aclocal_m4_deps) $(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS) $(am__aclocal_m4_deps): crlibm_config.h: stamp-h1 @test -f $@ || rm -f stamp-h1 @test -f $@ || $(MAKE) $(AM_MAKEFLAGS) stamp-h1 stamp-h1: $(srcdir)/crlibm_config.h.in $(top_builddir)/config.status @rm -f stamp-h1 cd $(top_builddir) && $(SHELL) ./config.status crlibm_config.h $(srcdir)/crlibm_config.h.in: $(am__configure_deps) ($(am__cd) $(top_srcdir) && $(AUTOHEADER)) rm -f stamp-h1 touch $@ distclean-hdr: -rm -f crlibm_config.h stamp-h1 install-libLIBRARIES: $(lib_LIBRARIES) @$(NORMAL_INSTALL) @list='$(lib_LIBRARIES)'; 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 " $(INSTALL_DATA) $$list2 '$(DESTDIR)$(libdir)'"; \ $(INSTALL_DATA) $$list2 "$(DESTDIR)$(libdir)" || exit $$?; } @$(POST_INSTALL) @list='$(lib_LIBRARIES)'; test -n "$(libdir)" || list=; \ for p in $$list; do \ if test -f $$p; then \ $(am__strip_dir) \ echo " ( cd '$(DESTDIR)$(libdir)' && $(RANLIB) $$f )"; \ ( cd "$(DESTDIR)$(libdir)" && $(RANLIB) $$f ) || exit $$?; \ else :; fi; \ done uninstall-libLIBRARIES: @$(NORMAL_UNINSTALL) @list='$(lib_LIBRARIES)'; test -n "$(libdir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(libdir)'; $(am__uninstall_files_from_dir) clean-libLIBRARIES: -test -z "$(lib_LIBRARIES)" || rm -f $(lib_LIBRARIES) libcrlibm.a: $(libcrlibm_a_OBJECTS) $(libcrlibm_a_DEPENDENCIES) $(EXTRA_libcrlibm_a_DEPENDENCIES) $(AM_V_at)-rm -f libcrlibm.a $(AM_V_AR)$(libcrlibm_a_AR) libcrlibm.a $(libcrlibm_a_OBJECTS) $(libcrlibm_a_LIBADD) $(AM_V_at)$(RANLIB) libcrlibm.a mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c .c.o: $(AM_V_CC)$(COMPILE) -c -o $@ $< .c.obj: $(AM_V_CC)$(COMPILE) -c -o $@ `$(CYGPATH_W) '$<'` 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) # This directory's subdirectories are mostly independent; you can cd # into them and run 'make' without going through this Makefile. # To change the values of 'make' variables: instead of editing Makefiles, # (1) if the variable is set in 'config.status', edit 'config.status' # (which will cause the Makefiles to be regenerated when you run 'make'); # (2) otherwise, pass the desired values on the 'make' command line. $(am__recursive_targets): @fail=; \ if $(am__make_keepgoing); then \ failcom='fail=yes'; \ else \ failcom='exit 1'; \ fi; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ for subdir in $$list; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ dot_seen=yes; \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done; \ if test "$$dot_seen" = "no"; then \ $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \ fi; test -z "$$fail" ID: $(am__tagged_files) $(am__define_uniq_tagged_files); mkid -fID $$unique tags: tags-recursive TAGS: tags tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) set x; \ here=`pwd`; \ if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ empty_fix=.; \ else \ include_option=--include; \ empty_fix=; \ fi; \ list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test ! -f $$subdir/TAGS || \ set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \ fi; \ done; \ $(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-recursive 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-recursive 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 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 @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ $(am__make_dryrun) \ || test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ dir1=$$subdir; dir2="$(distdir)/$$subdir"; \ $(am__relativize); \ new_distdir=$$reldir; \ dir1=$$subdir; dir2="$(top_distdir)"; \ $(am__relativize); \ new_top_distdir=$$reldir; \ echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \ echo " am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \ ($(am__cd) $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$$new_top_distdir" \ distdir="$$new_distdir" \ am__remove_distdir=: \ am__skip_length_check=: \ am__skip_mode_fix=: \ distdir) \ || 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 check: check-recursive all-am: Makefile $(LIBRARIES) $(HEADERS) crlibm_config.h installdirs: installdirs-recursive installdirs-am: for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(includedir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: install-recursive install-exec: install-exec-recursive install-data: install-data-recursive uninstall: uninstall-recursive install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-recursive 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: 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) 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-recursive clean-am: clean-generic clean-libLIBRARIES mostlyclean-am distclean: distclean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-hdr distclean-tags dvi: dvi-recursive dvi-am: html: html-recursive html-am: info: info-recursive info-am: install-data-am: install-includeHEADERS install-dvi: install-dvi-recursive install-dvi-am: install-exec-am: install-libLIBRARIES install-html: install-html-recursive install-html-am: install-info: install-info-recursive install-info-am: install-man: install-pdf: install-pdf-recursive install-pdf-am: install-ps: install-ps-recursive install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf $(top_srcdir)/autom4te.cache -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-recursive mostlyclean-am: mostlyclean-compile mostlyclean-generic pdf: pdf-recursive pdf-am: ps: ps-recursive ps-am: uninstall-am: uninstall-includeHEADERS uninstall-libLIBRARIES .MAKE: $(am__recursive_targets) all install-am install-strip .PHONY: $(am__recursive_targets) CTAGS GTAGS TAGS all all-am \ am--refresh check check-am clean clean-cscope clean-generic \ clean-libLIBRARIES 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-hdr distclean-tags distcleancheck \ distdir distuninstallcheck dvi dvi-am html html-am info \ info-am install install-am 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-libLIBRARIES install-man \ install-pdf install-pdf-am install-ps install-ps-am \ install-strip installcheck installcheck-am installdirs \ installdirs-am maintainer-clean maintainer-clean-generic \ mostlyclean mostlyclean-compile mostlyclean-generic pdf pdf-am \ ps ps-am tags tags-am uninstall uninstall-am \ uninstall-includeHEADERS uninstall-libLIBRARIES tripledoubleprocedures.pdf: docs/latex/tripledoubleprocedures.tex cd docs/latex; \ pdflatex tripledoubleprocedures; bibtex tripledoubleprocedures; \ pdflatex tripledoubleprocedures; pdflatex tripledoubleprocedures;\ mv tripledoubleprocedures.pdf .. crlibm.pdf: docs/latex/crlibm.tex cd docs/latex; pdflatex crlibm; bibtex crlibm; pdflatex crlibm; pdflatex crlibm;\ mv crlibm.pdf .. doc: crlibm.pdf tripledoubleprocedures.pdf # 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: interval-2.1.0/src/crlibm/scs_lib/Makefile.in0000644000175000017500000004422013031037010020430 0ustar oliveroliver# 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@ subdir = scs_lib DIST_COMMON = $(srcdir)/Makefile.in $(srcdir)/Makefile.am \ $(include_HEADERS) AUTHORS COPYING ChangeLog INSTALL NEWS \ README TODO ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/crlibm_config.h 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)$(includedir)" LIBRARIES = $(lib_LIBRARIES) AR = ar ARFLAGS = cru AM_V_AR = $(am__v_AR_@AM_V@) am__v_AR_ = $(am__v_AR_@AM_DEFAULT_V@) am__v_AR_0 = @echo " AR " $@; am__v_AR_1 = libscs_a_AR = $(AR) $(ARFLAGS) libscs_a_LIBADD = am_libscs_a_OBJECTS = scs_private.$(OBJEXT) double2scs.$(OBJEXT) \ print_scs.$(OBJEXT) division_scs.$(OBJEXT) \ addition_scs.$(OBJEXT) multiplication_scs.$(OBJEXT) \ scs2double.$(OBJEXT) zero_scs.$(OBJEXT) scs2mpfr.$(OBJEXT) libscs_a_OBJECTS = $(am_libscs_a_OBJECTS) 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@ -I$(top_builddir) depcomp = am__depfiles_maybe = 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 = $(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 = SOURCES = $(libscs_a_SOURCES) DIST_SOURCES = $(libscs_a_SOURCES) am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac 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 DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ ISODATE = @ISODATE@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MKDIR_P = @MKDIR_P@ OBJEXT = @OBJEXT@ 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@ RANLIB = @RANLIB@ 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_CC = @ac_ct_CC@ 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@ 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@ lib_LIBRARIES = libscs.a INCLUDES = -I$(top_srcdir) libscs_a_SOURCES = scs.h scs_private.h scs_private.c \ double2scs.c print_scs.c \ division_scs.c\ addition_scs.c multiplication_scs.c\ scs2double.c zero_scs.c \ scs2mpfr.c include_HEADERS = scs.h ../crlibm_config.h all: all-am .SUFFIXES: .SUFFIXES: .c .o .obj $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu --ignore-deps scs_lib/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu --ignore-deps scs_lib/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): install-libLIBRARIES: $(lib_LIBRARIES) @$(NORMAL_INSTALL) @list='$(lib_LIBRARIES)'; 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 " $(INSTALL_DATA) $$list2 '$(DESTDIR)$(libdir)'"; \ $(INSTALL_DATA) $$list2 "$(DESTDIR)$(libdir)" || exit $$?; } @$(POST_INSTALL) @list='$(lib_LIBRARIES)'; test -n "$(libdir)" || list=; \ for p in $$list; do \ if test -f $$p; then \ $(am__strip_dir) \ echo " ( cd '$(DESTDIR)$(libdir)' && $(RANLIB) $$f )"; \ ( cd "$(DESTDIR)$(libdir)" && $(RANLIB) $$f ) || exit $$?; \ else :; fi; \ done uninstall-libLIBRARIES: @$(NORMAL_UNINSTALL) @list='$(lib_LIBRARIES)'; test -n "$(libdir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(libdir)'; $(am__uninstall_files_from_dir) clean-libLIBRARIES: -test -z "$(lib_LIBRARIES)" || rm -f $(lib_LIBRARIES) libscs.a: $(libscs_a_OBJECTS) $(libscs_a_DEPENDENCIES) $(EXTRA_libscs_a_DEPENDENCIES) $(AM_V_at)-rm -f libscs.a $(AM_V_AR)$(libscs_a_AR) libscs.a $(libscs_a_OBJECTS) $(libscs_a_LIBADD) $(AM_V_at)$(RANLIB) libscs.a mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c .c.o: $(AM_V_CC)$(COMPILE) -c -o $@ $< .c.obj: $(AM_V_CC)$(COMPILE) -c -o $@ `$(CYGPATH_W) '$<'` 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" 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 distdir: $(DISTFILES) @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 check-am: all-am check: check-am all-am: Makefile $(LIBRARIES) $(HEADERS) installdirs: for dir in "$(DESTDIR)$(libdir)" "$(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: 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) 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-generic clean-libLIBRARIES mostlyclean-am distclean: distclean-am -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-tags dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-includeHEADERS install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-libLIBRARIES 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 Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-compile mostlyclean-generic pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: uninstall-includeHEADERS uninstall-libLIBRARIES .MAKE: install-am install-strip .PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \ clean-libLIBRARIES cscopelist-am ctags ctags-am distclean \ distclean-compile distclean-generic distclean-tags distdir dvi \ dvi-am html html-am info info-am install install-am \ 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-libLIBRARIES install-man 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 pdf pdf-am ps ps-am tags tags-am uninstall \ uninstall-am uninstall-includeHEADERS uninstall-libLIBRARIES # 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: interval-2.1.0/src/crlibm/crlibm_config.h.in0000644000175000017500000001004213031037010020313 0ustar oliveroliver/* crlibm_config.h.in. Generated from configure.ac by autoheader. */ /* Define if building universal (internal helper macro) */ #undef AC_APPLE_UNIVERSAL_BUILD /* Compile the filib-compatible interval functions */ #undef BUILD_INTERVAL_FUNCTIONS /* architecture- and system-specific FPU control header file */ #undef CRLIBM_HAS_FPU_CONTROL /* Processor type */ #undef CRLIBM_TYPECPU_ALPHA /* Processor type */ #undef CRLIBM_TYPECPU_AMD64 /* Processor type */ #undef CRLIBM_TYPECPU_ITANIUM /* Processor type */ #undef CRLIBM_TYPECPU_POWERPC /* Processor type */ #undef CRLIBM_TYPECPU_SPARC /* Processor type */ #undef CRLIBM_TYPECPU_X86 /* OS type */ #undef CRLIBM_TYPEOS_BSD /* OS type */ #undef CRLIBM_TYPEOS_CYGWIN /* OS type */ #undef CRLIBM_TYPEOS_HPUX /* Use the sse2 operators */ #undef HAS_SSE2 /* Define to 1 if you have the header file. */ #undef HAVE_FENV_H /* Define to 1 if you have the header file. */ #undef HAVE_FLOAT_H /* Define to 1 if you have the header file. */ #undef HAVE_GMP_H /* Define to 1 if you have the header file. */ #undef HAVE_INTTYPES_H /* Define to 1 if you have the `gmp' library (-lgmp). */ #undef HAVE_LIBGMP /* Define to 1 if you have the `m' library (-lm). */ #undef HAVE_LIBM /* Define to 1 if you have the `mcr' library (-lmcr). */ #undef HAVE_LIBMCR /* Define to 1 if you have the header file. */ #undef HAVE_LIBMCR_H /* Define to 1 if you have the `mpfr' library (-lmpfr). */ #undef HAVE_LIBMPFR /* Define to 1 if you have the `ultim' library (-lultim). */ #undef HAVE_LIBULTIM /* Define to 1 if the type `long double' works and has more range or precision than `double'. */ #undef HAVE_LONG_DOUBLE /* Define to 1 if the type `long double' works and has more range or precision than `double'. */ #undef HAVE_LONG_DOUBLE_WIDER /* Define to 1 if you have the header file. */ #undef HAVE_MATHLIB_H /* Define to 1 if you have the header file. */ #undef HAVE_MEMORY_H /* Define to 1 if you have the header file. */ #undef HAVE_MPFR_H /* Define to 1 if you have the `sqrt' function. */ #undef HAVE_SQRT /* Define to 1 if you have the header file. */ #undef HAVE_STDINT_H /* Define to 1 if you have the header file. */ #undef HAVE_STDLIB_H /* Define to 1 if you have the header file. */ #undef HAVE_STRINGS_H /* Define to 1 if you have the header file. */ #undef HAVE_STRING_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_STAT_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_TYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_UNISTD_H /* Name of package */ #undef PACKAGE /* Define to the address where bug reports for this package should be sent. */ #undef PACKAGE_BUGREPORT /* Define to the full name of this package. */ #undef PACKAGE_NAME /* Define to the full name and version of this package. */ #undef PACKAGE_STRING /* Define to the one symbol short name of this package. */ #undef PACKAGE_TARNAME /* Define to the home page for this package. */ #undef PACKAGE_URL /* Define to the version of this package. */ #undef PACKAGE_VERSION /* Size of an SCS digit */ #undef SCS_NB_BITS /* Number of digits in the SCS structure */ #undef SCS_NB_WORDS /* The size of `int', as computed by sizeof. */ #undef SIZEOF_INT /* Define to 1 if you have the ANSI C header files. */ #undef STDC_HEADERS /* Version number of package */ #undef VERSION /* Define WORDS_BIGENDIAN to 1 if your processor stores words with the most significant byte first (like Motorola and SPARC, unlike Intel). */ #if defined AC_APPLE_UNIVERSAL_BUILD # if defined __BIG_ENDIAN__ # define WORDS_BIGENDIAN 1 # endif #else # ifndef WORDS_BIGENDIAN # undef WORDS_BIGENDIAN # endif #endif /* Define to empty if `const' does not conform to ANSI C. */ #undef const /* Define to `__inline__' or `__inline' if that's what the C compiler calls it, or to nothing if 'inline' is not supported under any name. */ #ifndef __cplusplus #undef inline #endif interval-2.1.0/src/crlibm/missing0000755000175000017500000001533013031037010016344 0ustar oliveroliver#! /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: interval-2.1.0/src/crlibm/INSTALL0000644000175000017500000003661013031037010016002 0ustar oliveroliverInstallation Instructions ************************* Copyright (C) 1994-1996, 1999-2002, 2004-2013 Free Software Foundation, Inc. Copying and distribution of this file, with or without modification, are permitted in any medium without royalty provided the copyright notice and this notice are preserved. This file is offered as-is, without warranty of any kind. Basic Installation ================== Briefly, the shell command `./configure && make && make install' should configure, build, and install this package. The following more-detailed instructions are generic; see the `README' file for instructions specific to this package. Some packages provide this `INSTALL' file but do not implement all of the features documented below. The lack of an optional feature in a given package is not necessarily a bug. More recommendations for GNU packages can be found in *note Makefile Conventions: (standards)Makefile Conventions. The `configure' shell script attempts to guess correct values for various system-dependent variables used during compilation. It uses those values to create a `Makefile' in each directory of the package. It may also create one or more `.h' files containing system-dependent definitions. Finally, it creates a shell script `config.status' that you can run in the future to recreate the current configuration, and a file `config.log' containing compiler output (useful mainly for debugging `configure'). It can also use an optional file (typically called `config.cache' and enabled with `--cache-file=config.cache' or simply `-C') that saves the results of its tests to speed up reconfiguring. Caching is disabled by default to prevent problems with accidental use of stale cache files. If you need to do unusual things to compile the package, please try to figure out how `configure' could check whether to do them, and mail diffs or instructions to the address given in the `README' so they can be considered for the next release. If you are using the cache, and at some point `config.cache' contains results you don't want to keep, you may remove or edit it. The file `configure.ac' (or `configure.in') is used to create `configure' by a program called `autoconf'. You need `configure.ac' if you want to change it or regenerate `configure' using a newer version of `autoconf'. The simplest way to compile this package is: 1. `cd' to the directory containing the package's source code and type `./configure' to configure the package for your system. Running `configure' might take a while. While running, it prints some messages telling which features it is checking for. 2. Type `make' to compile the package. 3. Optionally, type `make check' to run any self-tests that come with the package, generally using the just-built uninstalled binaries. 4. Type `make install' to install the programs and any data files and documentation. When installing into a prefix owned by root, it is recommended that the package be configured and built as a regular user, and only the `make install' phase executed with root privileges. 5. Optionally, type `make installcheck' to repeat any self-tests, but this time using the binaries in their final installed location. This target does not install anything. Running this target as a regular user, particularly if the prior `make install' required root privileges, verifies that the installation completed correctly. 6. You can remove the program binaries and object files from the source code directory by typing `make clean'. To also remove the files that `configure' created (so you can compile the package for a different kind of computer), type `make distclean'. There is also a `make maintainer-clean' target, but that is intended mainly for the package's developers. If you use it, you may have to get all sorts of other programs in order to regenerate files that came with the distribution. 7. Often, you can also type `make uninstall' to remove the installed files again. In practice, not all packages have tested that uninstallation works correctly, even though it is required by the GNU Coding Standards. 8. Some packages, particularly those that use Automake, provide `make distcheck', which can by used by developers to test that all other targets like `make install' and `make uninstall' work correctly. This target is generally not run by end users. Compilers and Options ===================== Some systems require unusual options for compilation or linking that the `configure' script does not know about. Run `./configure --help' for details on some of the pertinent environment variables. You can give `configure' initial values for configuration parameters by setting variables in the command line or in the environment. Here is an example: ./configure CC=c99 CFLAGS=-g LIBS=-lposix *Note Defining Variables::, for more details. Compiling For Multiple Architectures ==================================== You can compile the package for more than one kind of computer at the same time, by placing the object files for each architecture in their own directory. To do this, you can use GNU `make'. `cd' to the directory where you want the object files and executables to go and run the `configure' script. `configure' automatically checks for the source code in the directory that `configure' is in and in `..'. This is known as a "VPATH" build. With a non-GNU `make', it is safer to compile the package for one architecture at a time in the source code directory. After you have installed the package for one architecture, use `make distclean' before reconfiguring for another architecture. On MacOS X 10.5 and later systems, you can create libraries and executables that work on multiple system types--known as "fat" or "universal" binaries--by specifying multiple `-arch' options to the compiler but only a single `-arch' option to the preprocessor. Like this: ./configure CC="gcc -arch i386 -arch x86_64 -arch ppc -arch ppc64" \ CXX="g++ -arch i386 -arch x86_64 -arch ppc -arch ppc64" \ CPP="gcc -E" CXXCPP="g++ -E" This is not guaranteed to produce working output in all cases, you may have to build one architecture at a time and combine the results using the `lipo' tool if you have problems. Installation Names ================== By default, `make install' installs the package's commands under `/usr/local/bin', include files under `/usr/local/include', etc. You can specify an installation prefix other than `/usr/local' by giving `configure' the option `--prefix=PREFIX', where PREFIX must be an absolute file name. You can specify separate installation prefixes for architecture-specific files and architecture-independent files. If you pass the option `--exec-prefix=PREFIX' to `configure', the package uses PREFIX as the prefix for installing programs and libraries. Documentation and other data files still use the regular prefix. In addition, if you use an unusual directory layout you can give options like `--bindir=DIR' to specify different values for particular kinds of files. Run `configure --help' for a list of the directories you can set and what kinds of files go in them. In general, the default for these options is expressed in terms of `${prefix}', so that specifying just `--prefix' will affect all of the other directory specifications that were not explicitly provided. The most portable way to affect installation locations is to pass the correct locations to `configure'; however, many packages provide one or both of the following shortcuts of passing variable assignments to the `make install' command line to change installation locations without having to reconfigure or recompile. The first method involves providing an override variable for each affected directory. For example, `make install prefix=/alternate/directory' will choose an alternate location for all directory configuration variables that were expressed in terms of `${prefix}'. Any directories that were specified during `configure', but not in terms of `${prefix}', must each be overridden at install time for the entire installation to be relocated. The approach of makefile variable overrides for each directory variable is required by the GNU Coding Standards, and ideally causes no recompilation. However, some platforms have known limitations with the semantics of shared libraries that end up requiring recompilation when using this method, particularly noticeable in packages that use GNU Libtool. The second method involves providing the `DESTDIR' variable. For example, `make install DESTDIR=/alternate/directory' will prepend `/alternate/directory' before all installation names. The approach of `DESTDIR' overrides is not required by the GNU Coding Standards, and does not work on platforms that have drive letters. On the other hand, it does better at avoiding recompilation issues, and works well even when some directory options were not specified in terms of `${prefix}' at `configure' time. Optional Features ================= If the package supports it, you can cause programs to be installed with an extra prefix or suffix on their names by giving `configure' the option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'. Some packages pay attention to `--enable-FEATURE' options to `configure', where FEATURE indicates an optional part of the package. They may also pay attention to `--with-PACKAGE' options, where PACKAGE is something like `gnu-as' or `x' (for the X Window System). The `README' should mention any `--enable-' and `--with-' options that the package recognizes. For packages that use the X Window System, `configure' can usually find the X include and library files automatically, but if it doesn't, you can use the `configure' options `--x-includes=DIR' and `--x-libraries=DIR' to specify their locations. Some packages offer the ability to configure how verbose the execution of `make' will be. For these packages, running `./configure --enable-silent-rules' sets the default to minimal output, which can be overridden with `make V=1'; while running `./configure --disable-silent-rules' sets the default to verbose, which can be overridden with `make V=0'. Particular systems ================== On HP-UX, the default C compiler is not ANSI C compatible. If GNU CC is not installed, it is recommended to use the following options in order to use an ANSI C compiler: ./configure CC="cc -Ae -D_XOPEN_SOURCE=500" and if that doesn't work, install pre-built binaries of GCC for HP-UX. HP-UX `make' updates targets which have the same time stamps as their prerequisites, which makes it generally unusable when shipped generated files such as `configure' are involved. Use GNU `make' instead. On OSF/1 a.k.a. Tru64, some versions of the default C compiler cannot parse its `' header file. The option `-nodtk' can be used as a workaround. If GNU CC is not installed, it is therefore recommended to try ./configure CC="cc" and if that doesn't work, try ./configure CC="cc -nodtk" On Solaris, don't put `/usr/ucb' early in your `PATH'. This directory contains several dysfunctional programs; working variants of these programs are available in `/usr/bin'. So, if you need `/usr/ucb' in your `PATH', put it _after_ `/usr/bin'. On Haiku, software installed for all users goes in `/boot/common', not `/usr/local'. It is recommended to use the following options: ./configure --prefix=/boot/common Specifying the System Type ========================== There may be some features `configure' cannot figure out automatically, but needs to determine by the type of machine the package will run on. Usually, assuming the package is built to be run on the _same_ architectures, `configure' can figure that out, but if it prints a message saying it cannot guess the machine type, give it the `--build=TYPE' option. TYPE can either be a short name for the system type, such as `sun4', or a canonical name which has the form: CPU-COMPANY-SYSTEM where SYSTEM can have one of these forms: OS KERNEL-OS See the file `config.sub' for the possible values of each field. If `config.sub' isn't included in this package, then this package doesn't need to know the machine type. If you are _building_ compiler tools for cross-compiling, you should use the option `--target=TYPE' to select the type of system they will produce code for. If you want to _use_ a cross compiler, that generates code for a platform different from the build platform, you should specify the "host" platform (i.e., that on which the generated programs will eventually be run) with `--host=TYPE'. Sharing Defaults ================ If you want to set default values for `configure' scripts to share, you can create a site shell script called `config.site' that gives default values for variables like `CC', `cache_file', and `prefix'. `configure' looks for `PREFIX/share/config.site' if it exists, then `PREFIX/etc/config.site' if it exists. Or, you can set the `CONFIG_SITE' environment variable to the location of the site script. A warning: not all `configure' scripts look for a site script. Defining Variables ================== Variables not defined in a site shell script can be set in the environment passed to `configure'. However, some packages may run configure again during the build, and the customized values of these variables may be lost. In order to avoid this problem, you should set them in the `configure' command line, using `VAR=value'. For example: ./configure CC=/usr/local2/bin/gcc causes the specified `gcc' to be used as the C compiler (unless it is overridden in the site shell script). Unfortunately, this technique does not work for `CONFIG_SHELL' due to an Autoconf limitation. Until the limitation is lifted, you can use this workaround: CONFIG_SHELL=/bin/bash ./configure CONFIG_SHELL=/bin/bash `configure' Invocation ====================== `configure' recognizes the following options to control how it operates. `--help' `-h' Print a summary of all of the options to `configure', and exit. `--help=short' `--help=recursive' Print a summary of the options unique to this package's `configure', and exit. The `short' variant lists options used only in the top level, while the `recursive' variant lists options also present in any nested packages. `--version' `-V' Print the version of Autoconf used to generate the `configure' script, and exit. `--cache-file=FILE' Enable the cache: use and save the results of the tests in FILE, traditionally `config.cache'. FILE defaults to `/dev/null' to disable caching. `--config-cache' `-C' Alias for `--cache-file=config.cache'. `--quiet' `--silent' `-q' Do not print messages saying which checks are being made. To suppress all normal output, redirect it to `/dev/null' (any error messages will still be shown). `--srcdir=DIR' Look for the package's source code in directory DIR. Usually `configure' can determine that directory automatically. `--prefix=DIR' Use DIR as the installation prefix. *note Installation Names:: for more details, including other options available for fine-tuning the installation locations. `--no-create' `-n' Run the configure checks, but stop before creating any output files. `configure' also accepts some other, not widely useful, options. Run `configure --help' for more details. interval-2.1.0/src/crlibm/compile0000755000175000017500000001624513031037010016331 0ustar oliveroliver#! /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: interval-2.1.0/inst/test/mpfr_vector_dot_d.cc-tst0000644000175000017500000000067213031037010021463 0ustar oliveroliver## DO NOT EDIT! Generated automatically from src/mpfr_vector_dot_d.cc %!test; %! [l, u] = mpfr_vector_dot_d (-1, -1, 2, 3); %! assert (l, -3); %! assert (u, 6); %!test; %! x = [realmax, realmax, -realmax, -realmax, 1, eps/2]; %! y = ones (size (x)); %! [l, u] = mpfr_vector_dot_d (x, y, x, y); %! assert (l, 1); %! assert (u, 1 + eps); %!test; %! [l, u] = mpfr_vector_dot_d (0, 0, inf, inf); %! assert (l, 0); %! assert (u, inf); interval-2.1.0/inst/test/mpfr_vector_sum_d.cc-tst0000644000175000017500000000040613031037010021474 0ustar oliveroliver## DO NOT EDIT! Generated automatically from src/mpfr_vector_sum_d.cc %!assert (mpfr_vector_sum_d (0, [eps, realmax, realmax, -realmax, -realmax]), eps) %!assert (mpfr_vector_sum_d (-inf, [eps/2, 1]), 1) %!assert (mpfr_vector_sum_d (+inf, [eps/2, 1]), 1 + eps) interval-2.1.0/inst/test/mpfr_to_string_d.cc-tst0000644000175000017500000000151213031037010021315 0ustar oliveroliver## DO NOT EDIT! Generated automatically from src/mpfr_to_string_d.cc %!test; %! [s, isexact] = mpfr_to_string_d (-inf, "decimal", .1); %! assert (s, {"0.1"}); %! assert (isexact, false); %!assert (mpfr_to_string_d (0, "exact hexadecimal", inf), {"inf"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", -inf), {"-inf"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", nan), {"nan"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", 0), {"0x0.0000000000000p+0"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", 2), {"0x1.0000000000000p+1"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", -1), {"-0x1.0000000000000p+0"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", pow2 (-1022)), {"0x1.0000000000000p-1022"}); %!assert (mpfr_to_string_d (0, "exact hexadecimal", pow2 (-1074)), {"0x0.0000000000001p-1022"}); interval-2.1.0/inst/test/crlibm_function.cc-tst0000644000175000017500000000053713031037010021141 0ustar oliveroliver## DO NOT EDIT! Generated automatically from src/crlibm_function.cc %!test %! for f = {"acos", "asin", "atan", "cos", "cosh", "exp", "expm1", "log", "log10", "log1p", "log2", "sin", "sinh", "tan"} %! for rnd = {+inf, -inf, 0, 0.5} %! assert (crlibm_function (f{:}, rnd{:}, 0.5), mpfr_function_d (f{:}, rnd{:}, 0.5)); %! endfor %! endfor interval-2.1.0/inst/test/mpfr_matrix_mul_d.cc-tst0000644000175000017500000000223513031037010021471 0ustar oliveroliver## DO NOT EDIT! Generated automatically from src/mpfr_matrix_mul_d.cc %!test; %! [l, u] = mpfr_matrix_mul_d (magic (3), magic (3)', magic (3) + 1, magic (3)' + 1); %! assert (l, [101, 71, 53; 71, 83, 71; 53, 71, 101]); %! assert (u, [134, 104, 86; 104, 116, 104; 86, 104, 134]); %!test; %! if (((exist ("__octave_config_info__") && ... %! __octave_config_info__.ENABLE_OPENMP) || ... %! (not (exist ("__octave_config_info__")) && ... %! octave_config_info ("features").OPENMP)) ... %! && nproc ("overridable") > 1) %! ## OpenMP is enabled and may use more than one thread. %! ## We should observe speed-ups by that. %! A = vec (magic (2000)); %! tic; %! mpfr_matrix_mul_d (A', A, A', A); %! time_per_element = toc; %! A = [A A]; %! tic; %! mpfr_matrix_mul_d (A', A, A', A); %! time_per_element_parallel = toc / numel (ans); %! %! ## Ideally, the runtime would be cut in half (at least), %! ## however, there is an overhead, so let's be pessimistic and %! ## assume that the parallel execution is at least 20% faster. %! assert (time_per_element > 1.2 * time_per_element_parallel) %! endif interval-2.1.0/inst/test/__setround__.cc-tst0000644000175000017500000000071713031037010020423 0ustar oliveroliver## DO NOT EDIT! Generated automatically from src/__setround__.cc %!test %! __setround__ (+inf); %! assert (1 + realmin > 1, true); %! assert (1 - realmin == 1, true); %! __setround__ (0.5); %!test %! __setround__ (-inf); %! assert (1 + realmin == 1, true); %! assert (1 - realmin < 1, true); %! __setround__ (0.5); %!test %! __setround__ (0.5); %! assert (1 + realmin == 1, true); %! assert (1 - realmin == 1, true); %!shared %! __setround__ (0.5); interval-2.1.0/inst/test/mpfr_linspace_d.cc-tst0000644000175000017500000000034413031037010021105 0ustar oliveroliver## DO NOT EDIT! Generated automatically from src/mpfr_linspace_d.cc %!assert (mpfr_linspace_d (-inf, 1, 10, 10), 1 : 10); %!assert (mpfr_linspace_d (inf, 1, 10, 8) - mpfr_linspace_d (-inf, 1, 10, 8), [0 2 2 4 4 4 8 0] .* eps); interval-2.1.0/inst/test/mpfr_function_d.cc-tst0000644000175000017500000000653613031037010021145 0ustar oliveroliver## DO NOT EDIT! Generated automatically from src/mpfr_function_d.cc %!assert (mpfr_function_d ('plus', 0, 2, 2), 4); %!assert (mpfr_function_d ('plus', -inf, 1, eps / 2), 1); %!assert (mpfr_function_d ('plus', +inf, 1, eps / 2), 1 + eps); %!error mpfr_function_d ('Krauskefarben', 0, 47, 11); %!# Cross-check unit tests from crlibm against the MPFR library. %!# We simulate binary64 floating-point arithmetic in MPFR %!# with mpfr_function_d and results shall be identical. %!# %!shared testdata %! testdata = load (fullfile (... %! fileparts (file_in_loadpath ("__check_crlibm__.m")), ... %! "test", ... %! "crlibm.mat")); %!function verify (fname, rnd, data) %! assert (mpfr_function_d (fname, rnd, data.input), data.output); %!endfunction %!test verify ("acos", -inf, testdata.acos_rd); %!test verify ("acos", +inf, testdata.acos_ru); %!test verify ("acos", 0.5, testdata.acos_rn); %!test verify ("acos", 0, testdata.acos_rz); %!test verify ("asin", -inf, testdata.asin_rd); %!test verify ("asin", +inf, testdata.asin_ru); %!test verify ("asin", 0.5, testdata.asin_rn); %!test verify ("asin", 0, testdata.asin_rz); %!test verify ("atan", -inf, testdata.atan_rd); %!test verify ("atan", +inf, testdata.atan_ru); %!test verify ("atan", 0.5, testdata.atan_rn); %!test verify ("atan", 0, testdata.atan_rz); %!test verify ("cos", -inf, testdata.cos_rd); %!test verify ("cos", +inf, testdata.cos_ru); %!test verify ("cos", 0.5, testdata.cos_rn); %!test verify ("cos", 0, testdata.cos_rz); %!test verify ("cosh", -inf, testdata.cosh_rd); %!test verify ("cosh", +inf, testdata.cosh_ru); %!test verify ("cosh", 0.5, testdata.cosh_rn); %!test verify ("cosh", 0, testdata.cosh_rz); %!test verify ("exp", -inf, testdata.exp_rd); %!test verify ("exp", +inf, testdata.exp_ru); %!test verify ("exp", 0.5, testdata.exp_rn); %!test verify ("exp", 0, testdata.exp_rz); %!test verify ("expm1", -inf, testdata.expm1_rd); %!test verify ("expm1", +inf, testdata.expm1_ru); %!test verify ("expm1", 0.5, testdata.expm1_rn); %!test verify ("expm1", 0, testdata.expm1_rz); %!test verify ("log", -inf, testdata.log_rd); %!test verify ("log", +inf, testdata.log_ru); %!test verify ("log", 0.5, testdata.log_rn); %!test verify ("log", 0, testdata.log_rz); %!test verify ("log10", -inf, testdata.log10_rd); %!test verify ("log10", +inf, testdata.log10_ru); %!test verify ("log10", 0.5, testdata.log10_rn); %!test verify ("log10", 0, testdata.log10_rz); %!test verify ("log1p", -inf, testdata.log1p_rd); %!test verify ("log1p", +inf, testdata.log1p_ru); %!test verify ("log1p", 0.5, testdata.log1p_rn); %!test verify ("log1p", 0, testdata.log1p_rz); %!test verify ("log2", -inf, testdata.log2_rd); %!test verify ("log2", +inf, testdata.log2_ru); %!test verify ("log2", 0.5, testdata.log2_rn); %!test verify ("log2", 0, testdata.log2_rz); %!test verify ("sin", -inf, testdata.sin_rd); %!test verify ("sin", +inf, testdata.sin_ru); %!test verify ("sin", 0.5, testdata.sin_rn); %!test verify ("sin", 0, testdata.sin_rz); %!test verify ("sinh", -inf, testdata.sinh_rd); %!test verify ("sinh", +inf, testdata.sinh_ru); %!test verify ("sinh", 0.5, testdata.sinh_rn); %!test verify ("sinh", 0, testdata.sinh_rz); %!test verify ("tan", -inf, testdata.tan_rd); %!test verify ("tan", +inf, testdata.tan_ru); %!test verify ("tan", 0.5, testdata.tan_rn); %!test verify ("tan", 0, testdata.tan_rz); interval-2.1.0/inst/test/libieeep1788_tests_overlap.tst0000644000175000017500000002221613031037011022460 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/libieeep1788_tests_overlap.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) ## Copyright 2015-2016 Oliver Heimlich ## ## Original author: Marco Nehmeier (unit tests in libieeep1788, ## original license: Apache License 2.0) ## Converted into portable ITL format by Oliver Heimlich with minor corrections. ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## minimal_overlap_test %!test %! assert (isequal (overlap (infsup, infsup), "bothEmpty")); %!test %! assert (isequal (overlap (infsup, infsup (1.0, 2.0)), "firstEmpty")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup), "secondEmpty")); %!test %! assert (isequal (overlap (infsup (-inf, 2.0), infsup (3.0, inf)), "before")); %!test %! assert (isequal (overlap (infsup (-inf, 2.0), infsup (3.0, 4.0)), "before")); %!test %! assert (isequal (overlap (infsup (2.0, 2.0), infsup (3.0, 4.0)), "before")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup (3.0, 4.0)), "before")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup (3.0, 3.0)), "before")); %!test %! assert (isequal (overlap (infsup (2.0, 2.0), infsup (3.0, 3.0)), "before")); %!test %! assert (isequal (overlap (infsup (2.0, 2.0), infsup (3.0, inf)), "before")); %!test %! assert (isequal (overlap (infsup (-inf, 2.0), infsup (2.0, 3.0)), "meets")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup (2.0, 3.0)), "meets")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup (2.0, inf)), "meets")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup (1.5, 2.5)), "overlaps")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup (1.0, inf)), "starts")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup (1.0, 3.0)), "starts")); %!test %! assert (isequal (overlap (infsup (1.0, 1.0), infsup (1.0, 3.0)), "starts")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup (-inf, inf)), "containedBy")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup (-inf, 3.0)), "containedBy")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup (0.0, 3.0)), "containedBy")); %!test %! assert (isequal (overlap (infsup (2.0, 2.0), infsup (0.0, 3.0)), "containedBy")); %!test %! assert (isequal (overlap (infsup (2.0, 2.0), infsup (0.0, inf)), "containedBy")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup (-inf, 2.0)), "finishes")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup (0.0, 2.0)), "finishes")); %!test %! assert (isequal (overlap (infsup (2.0, 2.0), infsup (0.0, 2.0)), "finishes")); %!test %! assert (isequal (overlap (infsup (1.0, 2.0), infsup (1.0, 2.0)), "equals")); %!test %! assert (isequal (overlap (infsup (1.0, 1.0), infsup (1.0, 1.0)), "equals")); %!test %! assert (isequal (overlap (infsup (-inf, 1.0), infsup (-inf, 1.0)), "equals")); %!test %! assert (isequal (overlap (infsup (-inf, inf), infsup (-inf, inf)), "equals")); %!test %! assert (isequal (overlap (infsup (3.0, 4.0), infsup (2.0, 2.0)), "after")); %!test %! assert (isequal (overlap (infsup (3.0, 4.0), infsup (1.0, 2.0)), "after")); %!test %! assert (isequal (overlap (infsup (3.0, 3.0), infsup (1.0, 2.0)), "after")); %!test %! assert (isequal (overlap (infsup (3.0, 3.0), infsup (2.0, 2.0)), "after")); %!test %! assert (isequal (overlap (infsup (3.0, inf), infsup (2.0, 2.0)), "after")); %!test %! assert (isequal (overlap (infsup (2.0, 3.0), infsup (1.0, 2.0)), "metBy")); %!test %! assert (isequal (overlap (infsup (2.0, 3.0), infsup (-inf, 2.0)), "metBy")); %!test %! assert (isequal (overlap (infsup (1.5, 2.5), infsup (1.0, 2.0)), "overlappedBy")); %!test %! assert (isequal (overlap (infsup (1.5, 2.5), infsup (-inf, 2.0)), "overlappedBy")); %!test %! assert (isequal (overlap (infsup (1.0, inf), infsup (1.0, 2.0)), "startedBy")); %!test %! assert (isequal (overlap (infsup (1.0, 3.0), infsup (1.0, 2.0)), "startedBy")); %!test %! assert (isequal (overlap (infsup (1.0, 3.0), infsup (1.0, 1.0)), "startedBy")); %!test %! assert (isequal (overlap (infsup (-inf, 3.0), infsup (1.0, 2.0)), "contains")); %!test %! assert (isequal (overlap (infsup (-inf, inf), infsup (1.0, 2.0)), "contains")); %!test %! assert (isequal (overlap (infsup (0.0, 3.0), infsup (1.0, 2.0)), "contains")); %!test %! assert (isequal (overlap (infsup (0.0, 3.0), infsup (2.0, 2.0)), "contains")); %!test %! assert (isequal (overlap (infsup (-inf, 2.0), infsup (1.0, 2.0)), "finishedBy")); %!test %! assert (isequal (overlap (infsup (0.0, 2.0), infsup (1.0, 2.0)), "finishedBy")); %!test %! assert (isequal (overlap (infsup (0.0, 2.0), infsup (2.0, 2.0)), "finishedBy")); ## minimal_overlap_dec_test %!test %! assert (isequal (overlap (infsupdec (empty, "trv"), infsupdec (empty, "trv")), "bothEmpty")); %!test %! assert (isequal (overlap (infsupdec (empty, "trv"), infsupdec (1.0, 2.0, "com")), "firstEmpty")); %!test %! assert (isequal (overlap (infsupdec (1.0, 2.0, "def"), infsupdec (empty, "trv")), "secondEmpty")); %!test %! assert (isequal (overlap (infsupdec (2.0, 2.0, "def"), infsupdec (3.0, 4.0, "def")), "before")); %!test %! assert (isequal (overlap (infsupdec (1.0, 2.0, "dac"), infsupdec (3.0, 4.0, "com")), "before")); %!test %! assert (isequal (overlap (infsupdec (1.0, 2.0, "com"), infsupdec (3.0, 3.0, "trv")), "before")); %!test %! assert (isequal (overlap (infsupdec (2.0, 2.0, "trv"), infsupdec (3.0, 3.0, "def")), "before")); %!test %! assert (isequal (overlap (infsupdec (1.0, 2.0, "def"), infsupdec (2.0, 3.0, "def")), "meets")); %!test %! assert (isequal (overlap (infsupdec (1.0, 2.0, "dac"), infsupdec (1.5, 2.5, "def")), "overlaps")); %!test %! assert (isequal (overlap (infsupdec (1.0, 2.0, "def"), infsupdec (1.0, 3.0, "com")), "starts")); %!test %! assert (isequal (overlap (infsupdec (1.0, 1.0, "trv"), infsupdec (1.0, 3.0, "def")), "starts")); %!test %! assert (isequal (overlap (infsupdec (1.0, 2.0, "def"), infsupdec (0.0, 3.0, "dac")), "containedBy")); %!test %! assert (isequal (overlap (infsupdec (2.0, 2.0, "trv"), infsupdec (0.0, 3.0, "def")), "containedBy")); %!test %! assert (isequal (overlap (infsupdec (1.0, 2.0, "trv"), infsupdec (0.0, 2.0, "com")), "finishes")); %!test %! assert (isequal (overlap (infsupdec (2.0, 2.0, "def"), infsupdec (0.0, 2.0, "dac")), "finishes")); %!test %! assert (isequal (overlap (infsupdec (1.0, 2.0, "def"), infsupdec (1.0, 2.0, "def")), "equals")); %!test %! assert (isequal (overlap (infsupdec (1.0, 1.0, "dac"), infsupdec (1.0, 1.0, "dac")), "equals")); %!test %! assert (isequal (overlap (infsupdec (3.0, 4.0, "trv"), infsupdec (2.0, 2.0, "trv")), "after")); %!test %! assert (isequal (overlap (infsupdec (3.0, 4.0, "def"), infsupdec (1.0, 2.0, "def")), "after")); %!test %! assert (isequal (overlap (infsupdec (3.0, 3.0, "com"), infsupdec (1.0, 2.0, "dac")), "after")); %!test %! assert (isequal (overlap (infsupdec (3.0, 3.0, "def"), infsupdec (2.0, 2.0, "trv")), "after")); %!test %! assert (isequal (overlap (infsupdec (2.0, 3.0, "def"), infsupdec (1.0, 2.0, "trv")), "metBy")); %!test %! assert (isequal (overlap (infsupdec (1.5, 2.5, "com"), infsupdec (1.0, 2.0, "com")), "overlappedBy")); %!test %! assert (isequal (overlap (infsupdec (1.0, 3.0, "dac"), infsupdec (1.0, 2.0, "def")), "startedBy")); %!test %! assert (isequal (overlap (infsupdec (1.0, 3.0, "com"), infsupdec (1.0, 1.0, "dac")), "startedBy")); %!test %! assert (isequal (overlap (infsupdec (0.0, 3.0, "com"), infsupdec (1.0, 2.0, "dac")), "contains")); %!test %! assert (isequal (overlap (infsupdec (0.0, 3.0, "com"), infsupdec (2.0, 2.0, "def")), "contains")); %!test %! assert (isequal (overlap (infsupdec (0.0, 2.0, "def"), infsupdec (1.0, 2.0, "trv")), "finishedBy")); %!test %! assert (isequal (overlap (infsupdec (0.0, 2.0, "dac"), infsupdec (2.0, 2.0, "def")), "finishedBy")); interval-2.1.0/inst/test/pow_rev.tst0000644000175000017500000030733013031037011017064 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/pow_rev.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## minimal.powRev1_test ## ## The following tests use boundaries for the first parameter whose reciprocal ## can be computed without round-off error in a binary floating-point context. ## Thus, an implementation should be able to compute tight results with the ## formula x = z ^ (1 / y) for the intervals used here. ## ## The test values are structured according to table B.1 in ## Heimlich, Oliver. 2011. “The General Interval Power Function.” ## Diplomarbeit, Institute for Computer Science, University of Würzburg. ## http://exp.ln0.de/heimlich-power-2011.htm. ## %!# Empty intervals %!test %! assert (isequal (powrev1 (infsup, infsup, infsup), infsup)); %!test %! assert (isequal (powrev1 (infsup, infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup, infsup), infsup)); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (powrev1 (infsup, infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (powrev1 (infsup, infsup (-inf, inf), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup, infsup (-inf, inf)), infsup)); %!# Entire range %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!# Outside of the function's domain %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (-inf, inf), infsup (-inf, -1.0)), infsup)); %!test %! assert (isequal (powrev1 (infsup (-inf, -1.0), infsup (-inf, inf), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (-inf, inf), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (-inf, 0.0), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (-inf, 0.9), infsup (0.0, 1.0)), infsup)); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (1.1, inf), infsup (1.0, inf)), infsup)); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (1.1, inf), infsup (0.0, 1.0)), infsup)); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (-inf, 0.9), infsup (1.0, inf)), infsup)); %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (1.0, 1.0), infsup (-inf, 0.0)), infsup)); %!# 0^y = 0 %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (-inf, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (-inf, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (powrev1 (infsup (1.0, 2.0), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (powrev1 (infsup (1.0, 1.0), infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!# 1^y = x^0 = 1 %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (1.0, 1.0), infsup (1.0, 1.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (1.0, 1.0), infsup (2.0, 3.0)), infsup (2.0, 3.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (1.0, 1.0), infsup (20.0, 30.0)), infsup (20.0, 30.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (1.0, 1.0), infsup (1.0, 1.0)), infsup (1.0, 1.0))); %!# y < 0, z overlaps/starts [0,1] %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (-inf, 0.5), infsup (-inf, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (-inf, 0.5), infsup (-inf, inf)), infsup (1.0, inf))); %!# y < 0, z containedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (1.189207115002721027e+00, 2.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (1.0, 2.0))); %!# y < 0, z finishes [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (0.25, 1.0), infsup (-inf, inf)), infsup (1.0, 2.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (0.25, 1.0), infsup (-inf, inf)), infsup (1.0, 2.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (1.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (1.0, 1.0))); %!# y < 0, z equals/finishedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (1.0, inf))); %!# y < 0, z contains/startedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (7.071067811865474617e-01, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (7.071067811865474617e-01, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (-inf, 2.0), infsup (-inf, inf)), infsup (7.071067811865474617e-01, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (-inf, 2.0), infsup (-inf, inf)), infsup (7.071067811865474617e-01, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!# y < 0, z overlappedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (7.071067811865474617e-01, 1.414213562373095145e+00))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (7.071067811865474617e-01, 1.414213562373095145e+00))); %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (0.0, 1.414213562373095145e+00))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (0.0, 1.414213562373095145e+00))); %!# y < 0, z metBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (7.071067811865474617e-01, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (7.071067811865474617e-01, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (0.0, 1.0))); %!# y < 0, z after [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (0.5, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (0.5, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, -2.0), infsup (2.0, inf), infsup (-inf, inf)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-inf, -2.0), infsup (2.0, inf), infsup (-inf, inf)), infsup (0.0, 1.0))); %!# y = 0, z overlaps/starts [0,1] %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (-inf, 0.5), infsup (-inf, inf)), infsup)); %!# y = 0, z containedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup)); %!# y = 0, z finishes [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (0.25, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!# y = 0, z equals/finishedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!# y = 0, z contains/startedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (-inf, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!# y = 0, z overlappedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!# y = 0, z metBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!# y = 0, z after [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (powrev1 (infsup (0.0, 0.0), infsup (2.0, inf), infsup (-inf, inf)), infsup)); %!# y finishedBy 0, z overlaps/starts [0,1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (-inf, 0.5), infsup (-inf, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (-inf, 0.5), infsup (-inf, inf)), infsup (1.0, inf))); %!# y finishedBy 0, z containedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (1.0, inf))); %!# y finishedBy 0, z finishes [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (0.25, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (0.25, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!# y finishedBy 0, z equals/finishedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!# y finishedBy 0, z contains/startedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (-inf, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (-inf, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!# y finishedBy 0, z overlappedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!# y finishedBy 0, z metBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!# y finishedBy 0, z after [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 0.0), infsup (2.0, inf), infsup (-inf, inf)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-inf, 0.0), infsup (2.0, inf), infsup (-inf, inf)), infsup (0.0, 1.0))); %!# y contains 0, z overlaps/starts [0,1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (-inf, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (-inf, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (-inf, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (-inf, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.0, 0.5), infsup (0.0, 1.0)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.0, 0.5), infsup (0.0, 1.0)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (-inf, 0.5), infsup (0.0, 1.0)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (-inf, 0.5), infsup (0.0, 1.0)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.0, 0.5), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.0, 0.5), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (-inf, 0.5), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (-inf, 0.5), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.0, 0.5), infsup (1.0, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.0, 0.5), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (-inf, 0.5), infsup (1.0, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (-inf, 0.5), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.0, 0.5), infsup (1.0, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.0, 0.5), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (-inf, 0.5), infsup (1.0, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (-inf, 0.5), infsup (1.0, inf)), infsup (1.0, inf))); %!# y contains 0, z containedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.25, 0.5), infsup (0.0, 1.0)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.25, 0.5), infsup (0.0, 1.0)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.25, 0.5), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.25, 0.5), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.25, 0.5), infsup (1.0, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.25, 0.5), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.25, 0.5), infsup (1.0, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.25, 0.5), infsup (1.0, inf)), infsup (1.0, inf))); %!# y contains 0, z finishes [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.25, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.25, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.25, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.25, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.25, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.25, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (1.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (1.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.25, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.25, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (1.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (1.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.25, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.25, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (1.0, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (1.0, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.25, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.25, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (1.0, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (1.0, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!# y contains 0, z equals/contains [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.0, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.0, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.0, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.0, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!# y contains 0, z contains/startedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (-inf, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (-inf, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (-inf, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (-inf, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.0, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.0, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (-inf, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (-inf, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (-inf, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (-inf, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.0, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.0, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (-inf, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (-inf, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (-inf, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (-inf, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.0, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.0, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (-inf, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (-inf, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (-inf, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (-inf, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.0, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.0, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (-inf, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (-inf, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (-inf, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (-inf, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!# y contains 0, z overlappedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.5, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.5, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.5, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.5, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.5, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.5, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.5, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.5, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.5, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.5, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.5, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.5, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (0.5, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (0.5, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.5, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.5, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (0.5, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (0.5, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!# y contains 0, z metBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (1.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (1.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (1.0, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (1.0, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (1.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (1.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (1.0, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (1.0, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (1.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (1.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (1.0, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (1.0, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (1.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (1.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (1.0, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (1.0, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (1.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (1.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!# y contains 0, z after [0, 1] %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (2.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (2.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (2.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (2.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (2.0, 4.0), infsup (0.0, 1.0)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (2.0, 4.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (2.0, inf), infsup (0.0, 1.0)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (2.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (2.0, 4.0), infsup (0.0, 1.0)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (2.0, 4.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (2.0, inf), infsup (0.0, 1.0)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (2.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (2.0, 4.0), infsup (1.0, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (2.0, 4.0), infsup (1.0, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, 4.0), infsup (2.0, inf), infsup (1.0, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, 4.0), infsup (2.0, inf), infsup (1.0, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (2.0, 4.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (2.0, 4.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-4.0, inf), infsup (2.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (-inf, inf), infsup (2.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!# y startedBy 0, z overlaps/starts [0,1] %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (-inf, 0.5), infsup (-inf, inf)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (-inf, 0.5), infsup (-inf, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.0, 0.5), infsup (0.0, 1.0)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (-inf, 0.5), infsup (0.0, 1.0)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.0, 0.5), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (-inf, 0.5), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.0, 0.5), infsup (1.0, inf)), infsup)); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (-inf, 0.5), infsup (1.0, inf)), infsup)); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.0, 0.5), infsup (1.0, inf)), infsup)); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (-inf, 0.5), infsup (1.0, inf)), infsup)); %!# y startedBy 0, z containedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.25, 0.5), infsup (0.0, 1.0)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.25, 0.5), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.25, 0.5), infsup (1.0, inf)), infsup)); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.25, 0.5), infsup (1.0, inf)), infsup)); %!# y startedBy 0, z finishes [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.25, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.25, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.25, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (1.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.25, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (1.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.25, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (1.0, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.25, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (1.0, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!# y startedBy 0, z equals/contains [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.0, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.0, 1.0), infsup (1.0, inf)), infsup (1.0, inf))); %!# y startedBy 0, z contains/startedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (-inf, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (-inf, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.0, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (-inf, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (-inf, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.0, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (-inf, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (-inf, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.0, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (-inf, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (-inf, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.0, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (-inf, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (-inf, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!# y startedBy 0, z overlappedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.5, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.5, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.5, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.5, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.5, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.5, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (0.5, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.5, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (0.5, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!# y startedBy 0, z metBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (1.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (1.0, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (1.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (1.0, 2.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (1.0, inf), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (1.0, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (1.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (1.0, 2.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (1.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!# y startedBy 0, z after [0, 1] %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (2.0, inf), infsup (-inf, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (2.0, inf), infsup (-inf, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (2.0, 4.0), infsup (0.0, 1.0)), infsup)); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (2.0, inf), infsup (0.0, 1.0)), infsup)); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (2.0, 4.0), infsup (0.0, 1.0)), infsup)); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (2.0, inf), infsup (0.0, 1.0)), infsup)); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (2.0, 4.0), infsup (1.0, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, 4.0), infsup (2.0, inf), infsup (1.0, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (2.0, 4.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (0.0, inf), infsup (2.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!# y after 0, z overlaps/starts [0,1] %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (-inf, 0.5), infsup (-inf, inf)), infsup (0.0, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (-inf, 0.5), infsup (-inf, inf)), infsup (0.0, 1.0))); %!# y after 0, z containedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (0.5, 8.408964152537146131e-01))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (0.5, 1.0))); %!# y after 0, z finishes [0, 1] %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (0.25, 1.0), infsup (-inf, inf)), infsup (0.5, 1.0))); %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (1.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (0.25, 1.0), infsup (-inf, inf)), infsup (0.5, 1.0))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (1.0, 1.0))); %!# y after 0, z equals/contains [0, 1] %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, 1.0))); %!# y after 0, z contains/startedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (0.0, 1.414213562373095145e+00))); %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (-inf, 2.0), infsup (-inf, inf)), infsup (0.0, 1.414213562373095145e+00))); %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (0.0, 1.414213562373095145e+00))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (-inf, 2.0), infsup (-inf, inf)), infsup (0.0, 1.414213562373095145e+00))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!# y after 0, z overlappedBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (7.071067811865474617e-01, 1.414213562373095145e+00))); %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (7.071067811865474617e-01, inf))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (7.071067811865474617e-01, 1.414213562373095145e+00))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (0.5, inf), infsup (-inf, inf)), infsup (7.071067811865474617e-01, inf))); %!# y after 0, z metBy [0, 1] %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (1.0, 1.414213562373095145e+00))); %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (1.0, 1.414213562373095145e+00))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (1.0, inf), infsup (-inf, inf)), infsup (1.0, inf))); %!# y after 0, z after [0, 1] %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (1.189207115002721027e+00, 2.0))); %!test %! assert (isequal (powrev1 (infsup (2.0, 4.0), infsup (2.0, inf), infsup (-inf, inf)), infsup (1.189207115002721027e+00, inf))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (1.0, 2.0))); %!test %! assert (isequal (powrev1 (infsup (2.0, inf), infsup (2.0, inf), infsup (-inf, inf)), infsup (1.0, inf))); ## minimal.powRev2_test ## ## The following tests use boundaries for the first and second parameter ## whose binary logarithm can be computed without round-off error in a ## binary floating-point context. ## Thus, an implementation should be able to compute tight results with the ## formula y = log2 z / log2 x for the intervals used here. ## Implementations which use natural logarithm would introduce additional ## errors. ## ## The test values are structured according to table B.2 in ## Heimlich, Oliver. 2011. “The General Interval Power Function.” ## Diplomarbeit, Institute for Computer Science, University of Würzburg. ## http://exp.ln0.de/heimlich-power-2011.htm. ## %!# Empty intervals %!test %! assert (isequal (powrev2 (infsup, infsup, infsup), infsup)); %!test %! assert (isequal (powrev2 (infsup, infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (powrev2 (infsup (-inf, inf), infsup, infsup), infsup)); %!test %! assert (isequal (powrev2 (infsup (-inf, inf), infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (powrev2 (infsup, infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (powrev2 (infsup, infsup (-inf, inf), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (powrev2 (infsup (-inf, inf), infsup, infsup (-inf, inf)), infsup)); %!# Entire range %!test %! assert (isequal (powrev2 (infsup (-inf, inf), infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!# Outside of the function's domain %!test %! assert (isequal (powrev2 (infsup (0.0, 0.0), infsup (-inf, -0.1), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.0), infsup (0.1, inf), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.0), infsup (0.0, 0.0), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (powrev2 (infsup (-inf, 0.9), infsup (0.0, 0.9), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (powrev2 (infsup (1.1, inf), infsup (1.1, inf), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (powrev2 (infsup (-inf, 0.9), infsup (1.1, inf), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (powrev2 (infsup (1.1, inf), infsup (0.0, 0.9), infsup (0.0, inf)), infsup)); %!# 0^y = 0 %!test %! assert (isequal (powrev2 (infsup (0.0, 0.0), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (-inf, 0.0), infsup (-inf, 0.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (-inf, 0.0), infsup (-inf, 0.0), infsup (1.0, 2.0)), infsup (1.0, 2.0))); %!test %! assert (isequal (powrev2 (infsup (-inf, inf), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (-inf, inf), infsup (-inf, 0.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (-inf, inf), infsup (-inf, 0.0), infsup (1.0, 2.0)), infsup (1.0, 2.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (-inf, 0.0), infsup (-inf, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (-inf, 0.0), infsup (-inf, inf), infsup (1.0, 2.0)), infsup (1.0, 2.0))); %!# 1^y = x^0 = 1 %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (1.0, 1.0), infsup (2.0, 3.0)), infsup (2.0, 3.0))); %!test %! assert (isequal (powrev2 (infsup (-inf, inf), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (-inf, inf), infsup (1.0, 1.0), infsup (2.0, 3.0)), infsup (2.0, 3.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, 3.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, 3.0), infsup (1.0, 1.0), infsup (2.0, 3.0)), infsup)); %!# x overlaps/starts [0, 1], z overlaps/starts [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 0.5), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.5), infsup (0.0, 0.5), infsup (-inf, 0.0)), infsup)); %!# x overlaps/starts [0, 1], z containedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 0.5), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (0.0, 2.0))); %!# x overlaps/starts [0, 1], z finishes [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (0.5, 1.0), infsup (-inf, inf)), infsup (0.0, 0.5))); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!# x overlaps/starts [0, 1], z equals/finishedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (0.0, 1.0), infsup (-inf, 0.0)), infsup (0.0, 0.0))); %!# x overlaps/starts [0, 1], z contains/startedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (-0.5, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!# x overlaps/starts [0, 1], z overlappedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (-0.5, 0.5))); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (0.5, inf), infsup (-inf, inf)), infsup (-inf, 0.5))); %!# x overlaps/starts [0, 1], z metBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (-0.5, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (1.0, 2.0), infsup (0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (1.0, inf), infsup (0.0, inf)), infsup (0.0, 0.0))); %!# x overlaps/starts [0, 1], z after [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (-1.0, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (2.0, 4.0), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (2.0, inf), infsup (-inf, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 0.25), infsup (2.0, inf), infsup (0.0, inf)), infsup)); %!# x containedBy [0, 1], z overlaps/starts [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (0.5, inf))); %!# x containedBy [0, 1], z containedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (0.5, 2.0))); %!# x containedBy [0, 1], z finishes [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (0.5, 1.0), infsup (-inf, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!# x containedBy [0, 1], z equals/finishedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (0.0, 1.0), infsup (-inf, 0.0)), infsup (0.0, 0.0))); %!# x containedBy [0, 1], z contains/startedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (-1.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!# x containedBy [0, 1], z overlappedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (-1.0, 1.0))); %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (0.5, inf), infsup (-inf, inf)), infsup (-inf, 1.0))); %!# x containedBy [0, 1], z metBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (-1.0, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, 0.0))); %!# x containedBy [0, 1], z after [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (-2.0, -0.5))); %!test %! assert (isequal (powrev2 (infsup (0.25, 0.5), infsup (2.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!# x finishes [0, 1], z overlaps/starts [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 1.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (0.5, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup)); %!# x finishes [0, 1], z containedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 1.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (0.5, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup)); %!# x finishes [0, 1], z finishes [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 1.0), infsup (0.5, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.25, 1.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (0.5, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!# x finishes [0, 1], z equals/finishedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 1.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!# x finishes [0, 1], z contains/startedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 1.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.25, 1.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!# x finishes [0, 1], z overlappedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 1.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.25, 1.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!# x finishes [0, 1], z metBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 1.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.25, 1.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!# x finishes [0, 1], z after [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.25, 1.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (-inf, -0.5))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (powrev2 (infsup (0.25, 1.0), infsup (2.0, inf), infsup (-inf, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, 1.0), infsup (2.0, inf), infsup (-inf, inf)), infsup)); %!# x equals/finishedBy [0, 1], z overlaps/starts [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.0, 0.5), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.0, 0.5), infsup (0.0, inf)), infsup (0.0, inf))); %!# x equals/finishedBy [0, 1], z containedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.25, 0.5), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.25, 0.5), infsup (0.0, inf)), infsup (0.0, inf))); %!# x equals/finishedBy [0, 1], z finishes [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.5, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.5, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (1.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.5, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (1.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!# x equals/finishedBy [0, 1], z equals/finishedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!# x equals/finishedBy [0, 1], z contains/startedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!# x equals/finishedBy [0, 1], z overlappedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.5, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.5, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.5, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (0.5, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!# x equals/finishedBy [0, 1], z metBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (1.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (1.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (1.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (1.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!# x equals/finishedBy [0, 1], z after [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (2.0, 4.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (2.0, 4.0), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (2.0, inf), infsup (-inf, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (2.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 1.0), infsup (2.0, inf), infsup (0.0, inf)), infsup)); %!# x contains/startedBy [0, 1], z overlaps/starts [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.0, 0.5), infsup (-inf, 0.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.0, 0.5), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.0, 0.5), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.0, 0.5), infsup (0.0, inf)), infsup (0.0, inf))); %!# x contains/startedBy [0, 1], z containedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.25, 0.5), infsup (-inf, 0.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.25, 0.5), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.25, 0.5), infsup (-inf, 0.0)), infsup (-inf, -0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.25, 0.5), infsup (0.0, inf)), infsup (0.0, inf))); %!# x contains/startedBy [0, 1], z finishes [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.5, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.5, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (1.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.5, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (1.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.5, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.5, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (1.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.5, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (1.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!# x contains/startedBy [0, 1], z equals/finishedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!# x contains/startedBy [0, 1], z contains/startedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!# x contains/startedBy [0, 1], z overlappedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.5, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.5, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.5, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.5, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.5, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (0.5, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.5, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.5, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (0.5, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!# x contains/startedBy [0, 1], z metBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (1.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (1.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (1.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (1.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (1.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (1.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (1.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (1.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!# x contains/startedBy [0, 1], z after [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (2.0, 4.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (2.0, 4.0), infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (2.0, 4.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (2.0, 4.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (2.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (2.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, 2.0), infsup (2.0, inf), infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (2.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (2.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.0, inf), infsup (2.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!# x overlappedBy [0, 1], z overlaps/starts [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.0, 0.5), infsup (-inf, 0.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.0, 0.5), infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.0, 0.5), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.0, 0.5), infsup (0.0, inf)), infsup (1.0, inf))); %!# x overlappedBy [0, 1], z containedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.25, 0.5), infsup (-inf, 0.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.25, 0.5), infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.25, 0.5), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.25, 0.5), infsup (0.0, inf)), infsup (1.0, inf))); %!# x overlappedBy [0, 1], z finishes [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.5, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.5, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (1.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.5, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (1.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.5, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.5, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (1.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.5, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (1.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!# x overlappedBy [0, 1], z equals/finishedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!# x overlappedBy [0, 1], z contains/startedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!# x overlappedBy [0, 1], z overlappedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.5, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.5, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.5, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.5, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.5, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (0.5, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.5, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.5, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (0.5, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!# x overlappedBy [0, 1], z metBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (1.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (1.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (1.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (1.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (1.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (1.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (1.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (1.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!# x overlappedBy [0, 1], z after [0, 1] %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (2.0, 4.0), infsup (-inf, 0.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, 2.0), infsup (2.0, 4.0), infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (2.0, 4.0), infsup (-inf, 0.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (powrev2 (infsup (0.5, inf), infsup (2.0, 4.0), infsup (0.0, inf)), infsup (0.0, inf))); %!# x metBy [0, 1], z overlaps/starts [0, 1] %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (-inf, -1.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.0, 0.5), infsup (-inf, 0.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.0, 0.5), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.0, 0.5), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.0, 0.5), infsup (0.0, inf)), infsup)); %!# x metBy [0, 1], z containedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (-inf, -1.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.25, 0.5), infsup (-inf, 0.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.25, 0.5), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.25, 0.5), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.25, 0.5), infsup (0.0, inf)), infsup)); %!# x metBy [0, 1], z finishes [0, 1] %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.5, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.5, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (1.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.5, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (1.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.5, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.5, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (1.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.5, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (1.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!# x metBy [0, 1], z equals/finishedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.0, 1.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.0, 1.0), infsup (0.0, inf)), infsup (0.0, inf))); %!# x metBy [0, 1], z contains/startedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!# x metBy [0, 1], z overlappedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.5, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.5, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.5, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.5, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.5, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.5, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (0.5, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.5, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.5, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (0.5, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!# x metBy [0, 1], z metBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (1.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (1.0, 2.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (1.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (1.0, 2.0), infsup (0.0, inf)), infsup (0.0, inf))); %!# x metBy [0, 1], z after [0, 1] %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (2.0, 4.0), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (2.0, 4.0), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (powrev2 (infsup (1.0, 2.0), infsup (2.0, 4.0), infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (powrev2 (infsup (1.0, inf), infsup (2.0, 4.0), infsup (0.0, inf)), infsup (0.0, inf))); %!# x after [0, 1], z overlaps/starts [0, 1] %!test %! assert (isequal (powrev2 (infsup (2.0, 4.0), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (-inf, -0.5))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (0.0, 0.5), infsup (-inf, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (0.0, 0.5), infsup (0.0, inf)), infsup)); %!# x after [0, 1], z containedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (2.0, 4.0), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (-2.0, -0.5))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (0.25, 0.5), infsup (-inf, inf)), infsup (-2.0, 0.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (0.25, 0.5), infsup (0.0, inf)), infsup)); %!# x after [0, 1], z finishes [0, 1] %!test %! assert (isequal (powrev2 (infsup (2.0, 4.0), infsup (0.5, 1.0), infsup (-inf, inf)), infsup (-1.0, 0.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (0.5, 1.0), infsup (-inf, inf)), infsup (-1.0, 0.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, 4.0), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (1.0, 1.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!# x after [0, 1], z equals/finishedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (2.0, 4.0), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (0.0, 1.0), infsup (-inf, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, 4.0), infsup (0.0, 1.0), infsup (0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (0.0, 1.0), infsup (0.0, inf)), infsup (0.0, 0.0))); %!# x after [0, 1], z contains/startedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (2.0, 4.0), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (-inf, 1.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (0.0, 2.0), infsup (-inf, inf)), infsup (-inf, 1.0))); %!# x after [0, 1], z overlappedBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (2.0, 4.0), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (-1.0, 1.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (0.5, 2.0), infsup (-inf, inf)), infsup (-1.0, 1.0))); %!# x after [0, 1], z metBy [0, 1] %!test %! assert (isequal (powrev2 (infsup (2.0, 4.0), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (1.0, 2.0), infsup (-inf, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, 4.0), infsup (1.0, 2.0), infsup (-inf, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (1.0, 2.0), infsup (-inf, 0.0)), infsup (0.0, 0.0))); %!# x after [0, 1], z after [0, 1] %!test %! assert (isequal (powrev2 (infsup (2.0, 4.0), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (0.5, 2.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (2.0, 4.0), infsup (-inf, inf)), infsup (0.0, 2.0))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (2.0, 4.0), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (powrev2 (infsup (2.0, 4.0), infsup (2.0, inf), infsup (-inf, inf)), infsup (0.5, inf))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (2.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (powrev2 (infsup (2.0, inf), infsup (2.0, inf), infsup (-inf, 0.0)), infsup)); interval-2.1.0/inst/test/libieeep1788_tests_num.tst0000644000175000017500000002452613031037011021615 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/libieeep1788_tests_num.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) ## Copyright 2015-2016 Oliver Heimlich ## ## Original author: Marco Nehmeier (unit tests in libieeep1788, ## original license: Apache License 2.0) ## Converted into portable ITL format by Oliver Heimlich with minor corrections. ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## minimal_inf_test %!test %! assert (isequal (inf (infsup), inf)); %!test %! assert (isequal (inf (infsup (-inf, inf)), -inf)); %!test %! assert (isequal (inf (infsup (1.0, 2.0)), 1.0)); %!test %! assert (isequal (inf (infsup (-3.0, -2.0)), -3.0)); %!test %! assert (isequal (inf (infsup (-inf, 2.0)), -inf)); %!test %! assert (isequal (inf (infsup (-inf, 0.0)), -inf)); %!test %! assert (isequal (inf (infsup (-inf, -0.0)), -inf)); %!test %! assert (isequal (inf (infsup (-2.0, inf)), -2.0)); %!test %! assert (isequal (inf (infsup (0.0, inf)), -0.0)); %!test %! assert (isequal (inf (infsup (-0.0, inf)), -0.0)); %!test %! assert (isequal (inf (infsup (-0.0, 0.0)), -0.0)); %!test %! assert (isequal (inf (infsup (0.0, -0.0)), -0.0)); %!test %! assert (isequal (inf (infsup (0.0, 0.0)), -0.0)); %!test %! assert (isequal (inf (infsup (-0.0, -0.0)), -0.0)); ## minimal_inf_dec_test %!test %! assert (isequal (inf (infsupdec (empty, "trv")), inf)); %!test %! assert (isequal (inf (infsupdec (-inf, inf, "def")), -inf)); %!test %! assert (isequal (inf (infsupdec (1.0, 2.0, "com")), 1.0)); %!test %! assert (isequal (inf (infsupdec (-3.0, -2.0, "trv")), -3.0)); %!test %! assert (isequal (inf (infsupdec (-inf, 2.0, "dac")), -inf)); %!test %! assert (isequal (inf (infsupdec (-inf, 0.0, "def")), -inf)); %!test %! assert (isequal (inf (infsupdec (-inf, -0.0, "trv")), -inf)); %!test %! assert (isequal (inf (infsupdec (-2.0, inf, "trv")), -2.0)); %!test %! assert (isequal (inf (infsupdec (0.0, inf, "def")), -0.0)); %!test %! assert (isequal (inf (infsupdec (-0.0, inf, "trv")), -0.0)); %!test %! assert (isequal (inf (infsupdec (-0.0, 0.0, "dac")), -0.0)); %!test %! assert (isequal (inf (infsupdec (0.0, -0.0, "trv")), -0.0)); %!test %! assert (isequal (inf (infsupdec (0.0, 0.0, "trv")), -0.0)); %!test %! assert (isequal (inf (infsupdec (-0.0, -0.0, "trv")), -0.0)); ## minimal_sup_test %!test %! assert (isequal (sup (infsup), -inf)); %!test %! assert (isequal (sup (infsup (-inf, inf)), inf)); %!test %! assert (isequal (sup (infsup (1.0, 2.0)), 2.0)); %!test %! assert (isequal (sup (infsup (-3.0, -2.0)), -2.0)); %!test %! assert (isequal (sup (infsup (-inf, 2.0)), 2.0)); %!test %! assert (isequal (sup (infsup (-inf, 0.0)), 0.0)); %!test %! assert (isequal (sup (infsup (-inf, -0.0)), 0.0)); %!test %! assert (isequal (sup (infsup (-2.0, inf)), inf)); %!test %! assert (isequal (sup (infsup (0.0, inf)), inf)); %!test %! assert (isequal (sup (infsup (-0.0, inf)), inf)); %!test %! assert (isequal (sup (infsup (-0.0, 0.0)), 0.0)); %!test %! assert (isequal (sup (infsup (0.0, -0.0)), 0.0)); %!test %! assert (isequal (sup (infsup (0.0, 0.0)), 0.0)); %!test %! assert (isequal (sup (infsup (-0.0, -0.0)), 0.0)); ## minimal_sup_dec_test %!test %! assert (isequal (sup (infsupdec (empty, "trv")), -inf)); %!test %! assert (isequal (sup (infsupdec (-inf, inf, "def")), inf)); %!test %! assert (isequal (sup (infsupdec (1.0, 2.0, "com")), 2.0)); %!test %! assert (isequal (sup (infsupdec (-3.0, -2.0, "trv")), -2.0)); %!test %! assert (isequal (sup (infsupdec (-inf, 2.0, "dac")), 2.0)); %!test %! assert (isequal (sup (infsupdec (-inf, 0.0, "def")), 0.0)); %!test %! assert (isequal (sup (infsupdec (-inf, -0.0, "trv")), 0.0)); %!test %! assert (isequal (sup (infsupdec (-2.0, inf, "trv")), inf)); %!test %! assert (isequal (sup (infsupdec (0.0, inf, "def")), inf)); %!test %! assert (isequal (sup (infsupdec (-0.0, inf, "trv")), inf)); %!test %! assert (isequal (sup (infsupdec (-0.0, 0.0, "dac")), +0.0)); %!test %! assert (isequal (sup (infsupdec (0.0, -0.0, "trv")), +0.0)); %!test %! assert (isequal (sup (infsupdec (0.0, 0.0, "trv")), +0.0)); %!test %! assert (isequal (sup (infsupdec (-0.0, -0.0, "trv")), +0.0)); ## minimal_mid_test %!test %! assert (isequal (mid (infsup (-inf, inf)), 0.0)); %!test %! assert (isequal (mid (infsup (-1.797693134862315708e+308, 1.797693134862315708e+308)), 0.0)); %!test %! assert (isequal (mid (infsup (0.0, 2.0)), 1.0)); %!test %! assert (isequal (mid (infsup (2.0, 2.0)), 2.0)); %!test %! assert (isequal (mid (infsup (-2.0, 2.0)), 0.0)); %!test %! assert (isequal (mid (infsup (-9.881312916824930884e-324, 4.940656458412465442e-324)), 0.0)); %!test %! assert (isequal (mid (infsup (-4.940656458412465442e-324, 9.881312916824930884e-324)), 0.0)); ## minimal_mid_dec_test %!test %! assert (isequal (mid (infsupdec (-inf, inf, "def")), 0.0)); %!test %! assert (isequal (mid (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "trv")), 0.0)); %!test %! assert (isequal (mid (infsupdec (0.0, 2.0, "com")), 1.0)); %!test %! assert (isequal (mid (infsupdec (2.0, 2.0, "dac")), 2.0)); %!test %! assert (isequal (mid (infsupdec (-2.0, 2.0, "trv")), 0.0)); %!test %! assert (isequal (mid (infsupdec (-9.881312916824930884e-324, 4.940656458412465442e-324, "trv")), 0.0)); %!test %! assert (isequal (mid (infsupdec (-4.940656458412465442e-324, 9.881312916824930884e-324, "trv")), 0.0)); ## minimal_rad_test %!test %! assert (isequal (rad (infsup (0.0, 2.0)), 1.0)); %!test %! assert (isequal (rad (infsup (2.0, 2.0)), 0.0)); %!test %! assert (isequal (rad (infsup (-inf, inf)), inf)); %!test %! assert (isequal (rad (infsup (0.0, inf)), inf)); %!test %! assert (isequal (rad (infsup (-inf, 1.2)), inf)); ## minimal_rad_dec_test %!test %! assert (isequal (rad (infsupdec (0.0, 2.0, "trv")), 1.0)); %!test %! assert (isequal (rad (infsupdec (2.0, 2.0, "com")), 0.0)); %!test %! assert (isequal (rad (infsupdec (-inf, inf, "trv")), inf)); %!test %! assert (isequal (rad (infsupdec (0.0, inf, "def")), inf)); %!test %! assert (isequal (rad (infsupdec (-inf, 1.2, "trv")), inf)); ## minimal_wid_test %!test %! assert (isequal (wid (infsup (2.0, 2.0)), 0.0)); %!test %! assert (isequal (wid (infsup (1.0, 2.0)), 1.0)); %!test %! assert (isequal (wid (infsup (1.0, inf)), inf)); %!test %! assert (isequal (wid (infsup (-inf, 2.0)), inf)); %!test %! assert (isequal (wid (infsup (-inf, inf)), inf)); ## minimal_wid_dec_test %!test %! assert (isequal (wid (infsupdec (2.0, 2.0, "com")), 0.0)); %!test %! assert (isequal (wid (infsupdec (1.0, 2.0, "trv")), 1.0)); %!test %! assert (isequal (wid (infsupdec (1.0, inf, "trv")), inf)); %!test %! assert (isequal (wid (infsupdec (-inf, 2.0, "def")), inf)); %!test %! assert (isequal (wid (infsupdec (-inf, inf, "trv")), inf)); ## minimal_mag_test %!test %! assert (isequal (mag (infsup (1.0, 2.0)), 2.0)); %!test %! assert (isequal (mag (infsup (-4.0, 2.0)), 4.0)); %!test %! assert (isequal (mag (infsup (-inf, 2.0)), inf)); %!test %! assert (isequal (mag (infsup (1.0, inf)), inf)); %!test %! assert (isequal (mag (infsup (-inf, inf)), inf)); %!test %! assert (isequal (mag (infsup (-0.0, 0.0)), 0.0)); %!test %! assert (isequal (mag (infsup (-0.0, -0.0)), 0.0)); ## minimal_mag_dec_test %!test %! assert (isequal (mag (infsupdec (1.0, 2.0, "com")), 2.0)); %!test %! assert (isequal (mag (infsupdec (-4.0, 2.0, "trv")), 4.0)); %!test %! assert (isequal (mag (infsupdec (-inf, 2.0, "trv")), inf)); %!test %! assert (isequal (mag (infsupdec (1.0, inf, "def")), inf)); %!test %! assert (isequal (mag (infsupdec (-inf, inf, "trv")), inf)); %!test %! assert (isequal (mag (infsupdec (-0.0, 0.0, "trv")), 0.0)); %!test %! assert (isequal (mag (infsupdec (-0.0, -0.0, "trv")), 0.0)); ## minimal_mig_test %!test %! assert (isequal (mig (infsup (1.0, 2.0)), 1.0)); %!test %! assert (isequal (mig (infsup (-4.0, 2.0)), 0.0)); %!test %! assert (isequal (mig (infsup (-4.0, -2.0)), 2.0)); %!test %! assert (isequal (mig (infsup (-inf, 2.0)), 0.0)); %!test %! assert (isequal (mig (infsup (-inf, -2.0)), 2.0)); %!test %! assert (isequal (mig (infsup (-1.0, inf)), 0.0)); %!test %! assert (isequal (mig (infsup (1.0, inf)), 1.0)); %!test %! assert (isequal (mig (infsup (-inf, inf)), 0.0)); %!test %! assert (isequal (mig (infsup (-0.0, 0.0)), 0.0)); %!test %! assert (isequal (mig (infsup (-0.0, -0.0)), 0.0)); ## minimal_mig_dec_test %!test %! assert (isequal (mig (infsupdec (1.0, 2.0, "com")), 1.0)); %!test %! assert (isequal (mig (infsupdec (-4.0, 2.0, "trv")), 0.0)); %!test %! assert (isequal (mig (infsupdec (-4.0, -2.0, "trv")), 2.0)); %!test %! assert (isequal (mig (infsupdec (-inf, 2.0, "def")), 0.0)); %!test %! assert (isequal (mig (infsupdec (-inf, -2.0, "trv")), 2.0)); %!test %! assert (isequal (mig (infsupdec (-1.0, inf, "trv")), 0.0)); %!test %! assert (isequal (mig (infsupdec (1.0, inf, "trv")), 1.0)); %!test %! assert (isequal (mig (infsupdec (-inf, inf, "trv")), 0.0)); %!test %! assert (isequal (mig (infsupdec (-0.0, 0.0, "trv")), 0.0)); %!test %! assert (isequal (mig (infsupdec (-0.0, -0.0, "trv")), 0.0)); interval-2.1.0/inst/test/mpfi.tst0000644000175000017500000064650513031037012016351 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/mpfi.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 2009–2012 Spaces project, Inria Lorraine ## and Salsa project, INRIA Rocquencourt, ## and Arenaire project, Inria Rhone-Alpes, France ## and Lab. ANO, USTL (Univ. of Lille), France ## Copyright 2015-2016 Oliver Heimlich ## ## Original authors: Philippe Theveny (Philippe.Theveny@ens-lyon.fr) ## and Nathalie Revol (Nathalie.Revol@ens-lyon.fr) ## (unit tests in GNU MPFI, original license: LGPLv2.1+) ## Converted into portable ITL format by Oliver Heimlich. ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## mpfi_abs %!# special values %!test %! assert (isequal (abs (infsup (-inf, -7.0)), infsup (+7.0, inf))); %!test %! assert (isequal (abs (infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (abs (infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (abs (infsup (-inf, +8.0)), infsup (0.0, inf))); %!test %! assert (isequal (abs (infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (abs (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (abs (infsup (0.0, +8.0)), infsup (0.0, +8.0))); %!test %! assert (isequal (abs (infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (abs (infsup (0.0, +8.0)), infsup (0.0, +8.0))); %!test %! assert (isequal (abs (infsup (0.0, inf)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (abs (infsup (7.456540443420410156e+04, 7.456540467834472656e+04)), infsup (7.456540443420410156e+04, 7.456540467834472656e+04))); %!test %! assert (isequal (abs (infsup (-7.456540443420410156e+04, 7.456540467834472656e+04)), infsup (0.0, 7.456540467834472656e+04))); ## mpfi_acos %!# special values %!test %! assert (isequal (acos (infsup (-1.0, 0.0)), infsup (1.570796326794896558e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (acos (infsup (0.0, 0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (0.0, +1.0)), infsup (0.0, 1.570796326794896780e+00))); %!# regular values %!test %! assert (isequal (acos (infsup (-1.0, -0.5)), infsup (2.094395102393195263e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (acos (infsup (-0.75, -0.25)), infsup (1.823476581936975149e+00, 2.418858405776378007e+00))); %!test %! assert (isequal (acos (infsup (-0.5, 0.5)), infsup (1.047197551196597631e+00, 2.094395102393195707e+00))); %!test %! assert (isequal (acos (infsup (0.25, 0.625)), infsup (8.956647938578649049e-01, 1.318116071652817967e+00))); %!test %! assert (isequal (acos (infsup (-1.0, 1.0)), infsup (0.0, 3.141592653589793560e+00))); ## mpfi_acosh %!# special values %!test %! assert (isequal (acosh (infsup (+1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (acosh (infsup (+1.5, inf)), infsup (9.624236501192068305e-01, inf))); %!# regular values %!test %! assert (isequal (acosh (infsup (1.0, 1.5)), infsup (0.0, 9.624236501192069415e-01))); %!test %! assert (isequal (acosh (infsup (1.5, 1.5)), infsup (9.624236501192068305e-01, 9.624236501192069415e-01))); %!test %! assert (isequal (acosh (infsup (2.0, 1000.0)), infsup (1.316957896924816573e+00, 7.600902209541988697e+00))); ## mpfi_add %!# special values %!test %! assert (isequal (infsup (-inf, -7.0) + infsup (-1.0, +8.0), infsup (-inf, +1.0))); %! assert (isequal (plus (infsup (-inf, -7.0), infsup (-1.0, +8.0)), infsup (-inf, +1.0))); %!test %! assert (isequal (infsup (-inf, 0.0) + infsup (+8.0, inf), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-inf, 0.0), infsup (+8.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, +8.0) + infsup (0.0, +8.0), infsup (-inf, +16.0))); %! assert (isequal (plus (infsup (-inf, +8.0), infsup (0.0, +8.0)), infsup (-inf, +16.0))); %!test %! assert (isequal (infsup (-inf, inf) + infsup (0.0, +8.0), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-inf, inf), infsup (0.0, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) + infsup (-inf, -7.0), infsup (-inf, -7.0))); %! assert (isequal (plus (infsup (0.0, 0.0), infsup (-inf, -7.0)), infsup (-inf, -7.0))); %!test %! assert (isequal (infsup (0.0, +8.0) + infsup (-7.0, 0.0), infsup (-7.0, +8.0))); %! assert (isequal (plus (infsup (0.0, +8.0), infsup (-7.0, 0.0)), infsup (-7.0, +8.0))); %!test %! assert (isequal (infsup (0.0, 0.0) + infsup (0.0, +8.0), infsup (0.0, +8.0))); %! assert (isequal (plus (infsup (0.0, 0.0), infsup (0.0, +8.0)), infsup (0.0, +8.0))); %!test %! assert (isequal (infsup (0.0, inf) + infsup (0.0, +8.0), infsup (0.0, inf))); %! assert (isequal (plus (infsup (0.0, inf), infsup (0.0, +8.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) + infsup (+8.0, inf), infsup (+8.0, inf))); %! assert (isequal (plus (infsup (0.0, 0.0), infsup (+8.0, inf)), infsup (+8.0, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) + infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (plus (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, +8.0) + infsup (0.0, +8.0), infsup (0.0, +16.0))); %! assert (isequal (plus (infsup (0.0, +8.0), infsup (0.0, +8.0)), infsup (0.0, +16.0))); %!test %! assert (isequal (infsup (0.0, 0.0) + infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (plus (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) + infsup (-7.0, +8.0), infsup (-7.0, inf))); %! assert (isequal (plus (infsup (0.0, inf), infsup (-7.0, +8.0)), infsup (-7.0, inf))); %!# regular values %!test %! assert (isequal (infsup (-0.375, -5.693566843317114508e-73) + infsup (-0.125, 5.659799424266695230e-73), infsup (-5.000000000000000000e-01, -3.376741905041927849e-75))); %! assert (isequal (plus (infsup (-0.375, -5.693566843317114508e-73), infsup (-0.125, 5.659799424266695230e-73)), infsup (-5.000000000000000000e-01, -3.376741905041927849e-75))); %!test %! assert (isequal (infsup (-4.909093465297726553e-91, 3.202558470389760000e+14) + infsup (-4.547473508864641190e-13, 1.264629250000000000e+08), infsup (-4.547473508864642199e-13, 3.202559735019010000e+14))); %! assert (isequal (plus (infsup (-4.909093465297726553e-91, 3.202558470389760000e+14), infsup (-4.547473508864641190e-13, 1.264629250000000000e+08)), infsup (-4.547473508864642199e-13, 3.202559735019010000e+14))); %!test %! assert (isequal (infsup (-4.0, +7.0) + infsup (-2.443359172835548401e+09, 3e300), infsup (-2.443359176835548401e+09, 3.000000000000000752e+300))); %! assert (isequal (plus (infsup (-4.0, +7.0), infsup (-2.443359172835548401e+09, 3e300)), infsup (-2.443359176835548401e+09, 3.000000000000000752e+300))); %!test %! assert (isequal (infsup (7.205869356633318400e+16, 1.152921504606846976e+18) + infsup (2.814792717434890000e+14, 3.0e300), infsup (7.234017283807667200e+16, 3.000000000000000752e+300))); %! assert (isequal (plus (infsup (7.205869356633318400e+16, 1.152921504606846976e+18), infsup (2.814792717434890000e+14, 3.0e300)), infsup (7.234017283807667200e+16, 3.000000000000000752e+300))); %!# signed zeros %!test %! assert (isequal (infsup (+4.0, +8.0) + infsup (-4.0, -2.0), infsup (0.0, +6.0))); %! assert (isequal (plus (infsup (+4.0, +8.0), infsup (-4.0, -2.0)), infsup (0.0, +6.0))); %!test %! assert (isequal (infsup (+4.0, +8.0) + infsup (-9.0, -8.0), infsup (-5.0, 0.0))); %! assert (isequal (plus (infsup (+4.0, +8.0), infsup (-9.0, -8.0)), infsup (-5.0, 0.0))); ## mpfi_add_d %!# special values %!test %! assert (isequal (infsup (-inf, -7.0) + infsup (-4.000000000000000286e-17, -4.000000000000000286e-17), infsup (-inf, -7.0))); %! assert (isequal (plus (infsup (-inf, -7.0), infsup (-4.000000000000000286e-17, -4.000000000000000286e-17)), infsup (-inf, -7.0))); %!test %! assert (isequal (infsup (-inf, -7.0) + infsup (0.0, 0.0), infsup (-inf, -7.0))); %! assert (isequal (plus (infsup (-inf, -7.0), infsup (0.0, 0.0)), infsup (-inf, -7.0))); %!test %! assert (isequal (infsup (-inf, -7.0) + infsup (4.000000000000000286e-17, 4.000000000000000286e-17), infsup (-inf, -6.999999999999999112e+00))); %! assert (isequal (plus (infsup (-inf, -7.0), infsup (4.000000000000000286e-17, 4.000000000000000286e-17)), infsup (-inf, -6.999999999999999112e+00))); %!test %! assert (isequal (infsup (-inf, 0.0) + infsup (-8.000000000000000572e-17, -8.000000000000000572e-17), infsup (-inf, -8.0e-17))); %! assert (isequal (plus (infsup (-inf, 0.0), infsup (-8.000000000000000572e-17, -8.000000000000000572e-17)), infsup (-inf, -8.0e-17))); %!test %! assert (isequal (infsup (-inf, 0.0) + infsup (0.0, 0.0), infsup (-inf, 0.0))); %! assert (isequal (plus (infsup (-inf, 0.0), infsup (0.0, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, 0.0) + infsup (8.000000000000000572e-17, 8.000000000000000572e-17), infsup (-inf, 8.000000000000000572e-17))); %! assert (isequal (plus (infsup (-inf, 0.0), infsup (8.000000000000000572e-17, 8.000000000000000572e-17)), infsup (-inf, 8.000000000000000572e-17))); %!test %! assert (isequal (infsup (-inf, 8.0) + infsup (-1.600000000000000000e+18, -1.600000000000000000e+18), infsup (-inf, -1.599999999999999744e+18))); %! assert (isequal (plus (infsup (-inf, 8.0), infsup (-1.600000000000000000e+18, -1.600000000000000000e+18)), infsup (-inf, -1.599999999999999744e+18))); %!test %! assert (isequal (infsup (-inf, 8.0) + infsup (0.0, 0.0), infsup (-inf, 8.0))); %! assert (isequal (plus (infsup (-inf, 8.0), infsup (0.0, 0.0)), infsup (-inf, 8.0))); %!test %! assert (isequal (infsup (-inf, 8.0) + infsup (1.600000000000000000e+18, 1.600000000000000000e+18), infsup (-inf, 1.600000000000000256e+18))); %! assert (isequal (plus (infsup (-inf, 8.0), infsup (1.600000000000000000e+18, 1.600000000000000000e+18)), infsup (-inf, 1.600000000000000256e+18))); %!test %! assert (isequal (infsup (-inf, inf) + infsup (-1.600000000000000114e-16, -1.600000000000000114e-16), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-inf, inf), infsup (-1.600000000000000114e-16, -1.600000000000000114e-16)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) + infsup (0.0e-17, 0.0e-17), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-inf, inf), infsup (0.0e-17, 0.0e-17)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) + infsup (1.600000000000000114e-16, 1.600000000000000114e-16), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-inf, inf), infsup (1.600000000000000114e-16, 1.600000000000000114e-16)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) + infsup (-1.000000000000000072e-17, -1.000000000000000072e-17), infsup (-1.000000000000000072e-17, -1.000000000000000072e-17))); %! assert (isequal (plus (infsup (0.0, 0.0), infsup (-1.000000000000000072e-17, -1.000000000000000072e-17)), infsup (-1.000000000000000072e-17, -1.000000000000000072e-17))); %!test %! assert (isequal (infsup (0.0, 0.0) + infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (plus (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) + infsup (1.000000000000000072e-17, 1.000000000000000072e-17), infsup (1.000000000000000072e-17, 1.000000000000000072e-17))); %! assert (isequal (plus (infsup (0.0, 0.0), infsup (1.000000000000000072e-17, 1.000000000000000072e-17)), infsup (1.000000000000000072e-17, 1.000000000000000072e-17))); %!test %! assert (isequal (infsup (0.0, 8.0) + infsup (-3.000000000000000061e-17, -3.000000000000000061e-17), infsup (-3.000000000000000061e-17, 8.0))); %! assert (isequal (plus (infsup (0.0, 8.0), infsup (-3.000000000000000061e-17, -3.000000000000000061e-17)), infsup (-3.000000000000000061e-17, 8.0))); %!test %! assert (isequal (infsup (0.0, 8.0) + infsup (0.0, 0.0), infsup (0.0, 8.0))); %! assert (isequal (plus (infsup (0.0, 8.0), infsup (0.0, 0.0)), infsup (0.0, 8.0))); %!test %! assert (isequal (infsup (0.0, 8.0) + infsup (2.999999999999999444e-17, 2.999999999999999444e-17), infsup (2.999999999999999444e-17, 8.000000000000001776e+00))); %! assert (isequal (plus (infsup (0.0, 8.0), infsup (2.999999999999999444e-17, 2.999999999999999444e-17)), infsup (2.999999999999999444e-17, 8.000000000000001776e+00))); %!test %! assert (isequal (infsup (0.0, inf) + infsup (-7.000000000000000347e-17, -7.000000000000000347e-17), infsup (-7.000000000000000347e-17, inf))); %! assert (isequal (plus (infsup (0.0, inf), infsup (-7.000000000000000347e-17, -7.000000000000000347e-17)), infsup (-7.000000000000000347e-17, inf))); %!test %! assert (isequal (infsup (0.0, inf) + infsup (0.0, 0.0), infsup (0.0, inf))); %! assert (isequal (plus (infsup (0.0, inf), infsup (0.0, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, inf) + infsup (6.999999999999999114e-17, 6.999999999999999114e-17), infsup (6.999999999999999114e-17, inf))); %! assert (isequal (plus (infsup (0.0, inf), infsup (6.999999999999999114e-17, 6.999999999999999114e-17)), infsup (6.999999999999999114e-17, inf))); %!# regular values %!test %! assert (isequal (infsup (-32.0, -17.0) + infsup (-3.141592653589793116e+01, -3.141592653589793116e+01), infsup (-6.341592653589793116e+01, -4.841592653589793116e+01))); %! assert (isequal (plus (infsup (-32.0, -17.0), infsup (-3.141592653589793116e+01, -3.141592653589793116e+01)), infsup (-6.341592653589793116e+01, -4.841592653589793116e+01))); %!test %! assert (isequal (infsup (-3.141592653589793116e+01, -17.0) + infsup (3.141592653589793116e+01, 3.141592653589793116e+01), infsup (0.0, 1.441592653589793116e+01))); %! assert (isequal (plus (infsup (-3.141592653589793116e+01, -17.0), infsup (3.141592653589793116e+01, 3.141592653589793116e+01)), infsup (0.0, 1.441592653589793116e+01))); %!test %! assert (isequal (infsup (-32.0, -1.570796326794896558e+01) + infsup (1.570796326794896558e+01, 1.570796326794896558e+01), infsup (-1.629203673205103442e+01, 0.0))); %! assert (isequal (plus (infsup (-32.0, -1.570796326794896558e+01), infsup (1.570796326794896558e+01, 1.570796326794896558e+01)), infsup (-1.629203673205103442e+01, 0.0))); %!test %! assert (isequal (infsup (1.820444444444444443e+01, 3.202559735019019375e+14) + infsup (3.5, 3.5), infsup (2.170444444444444443e+01, 3.202559735019054375e+14))); %! assert (isequal (plus (infsup (1.820444444444444443e+01, 3.202559735019019375e+14), infsup (3.5, 3.5)), infsup (2.170444444444444443e+01, 3.202559735019054375e+14))); %!test %! assert (isequal (infsup (7.111111111111111105e-02, 3.202559735019019375e+14) + infsup (3.5, 3.5), infsup (3.571111111111110681e+00, 3.202559735019054375e+14))); %! assert (isequal (plus (infsup (7.111111111111111105e-02, 3.202559735019019375e+14), infsup (3.5, 3.5)), infsup (3.571111111111110681e+00, 3.202559735019054375e+14))); %!test %! assert (isequal (infsup (-2.550000000000000000e+02, 1.137777777777777777e+00) + infsup (256.5, 256.5), infsup (1.500000000000000000e+00, 2.576377777777777851e+02))); %! assert (isequal (plus (infsup (-2.550000000000000000e+02, 1.137777777777777777e+00), infsup (256.5, 256.5)), infsup (1.500000000000000000e+00, 2.576377777777777851e+02))); %!test %! assert (isequal (infsup (-1.999999999999999778e+00, -2.713328551617526225e-166) + infsup (4097.5, 4097.5), infsup (4.095500000000000000e+03, 4.097500000000000000e+03))); %! assert (isequal (plus (infsup (-1.999999999999999778e+00, -2.713328551617526225e-166), infsup (4097.5, 4097.5)), infsup (4.095500000000000000e+03, 4.097500000000000000e+03))); %!test %! assert (isequal (infsup (1.820444444444444443e+01, 3.202559735019019375e+14) + infsup (-3.5, -3.5), infsup (1.470444444444444443e+01, 3.202559735018984375e+14))); %! assert (isequal (plus (infsup (1.820444444444444443e+01, 3.202559735019019375e+14), infsup (-3.5, -3.5)), infsup (1.470444444444444443e+01, 3.202559735018984375e+14))); %!test %! assert (isequal (infsup (7.111111111111111105e-02, 3.202559735019019375e+14) + infsup (-3.5, -3.5), infsup (-3.428888888888889319e+00, 3.202559735018984375e+14))); %! assert (isequal (plus (infsup (7.111111111111111105e-02, 3.202559735019019375e+14), infsup (-3.5, -3.5)), infsup (-3.428888888888889319e+00, 3.202559735018984375e+14))); %!test %! assert (isequal (infsup (-2.550000000000000000e+02, 1.137777777777777777e+00) + infsup (-256.5, -256.5), infsup (-5.115000000000000000e+02, -2.553622222222222149e+02))); %! assert (isequal (plus (infsup (-2.550000000000000000e+02, 1.137777777777777777e+00), infsup (-256.5, -256.5)), infsup (-5.115000000000000000e+02, -2.553622222222222149e+02))); %!test %! assert (isequal (infsup (-1.999999999999999778e+00, -2.713328551617526225e-166) + infsup (-4097.5, -4097.5), infsup (-4.099500000000000000e+03, -4.097500000000000000e+03))); %! assert (isequal (plus (infsup (-1.999999999999999778e+00, -2.713328551617526225e-166), infsup (-4097.5, -4097.5)), infsup (-4.099500000000000000e+03, -4.097500000000000000e+03))); ## mpfi_asin %!# special values %!test %! assert (isequal (asin (infsup (-1.0, 0.0)), infsup (-1.570796326794896780e+00, 0.0))); %!test %! assert (isequal (asin (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (asin (infsup (0.0, +1.0)), infsup (0.0, 1.570796326794896780e+00))); %!# regular values %!test %! assert (isequal (asin (infsup (-1.0, -0.5)), infsup (-1.570796326794896780e+00, -5.235987755982988157e-01))); %!test %! assert (isequal (asin (infsup (-0.75, -0.25)), infsup (-8.480620789814811156e-01, -2.526802551420786469e-01))); %!test %! assert (isequal (asin (infsup (-0.5, 0.5)), infsup (-5.235987755982989267e-01, 5.235987755982989267e-01))); %!test %! assert (isequal (asin (infsup (0.25, 0.625)), infsup (2.526802551420786469e-01, 6.751315329370316531e-01))); %!test %! assert (isequal (asin (infsup (-1.0, 1.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); ## mpfi_asinh %!# special values %!test %! assert (isequal (asinh (infsup (-inf, -7.0)), infsup (-inf, -2.644120761058629032e+00))); %!test %! assert (isequal (asinh (infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (asinh (infsup (-inf, +8.0)), infsup (-inf, 2.776472280723718100e+00))); %!test %! assert (isequal (asinh (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (asinh (infsup (-1.0, 0.0)), infsup (-8.813735870195430477e-01, 0.0))); %!test %! assert (isequal (asinh (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (asinh (infsup (0.0, +1.0)), infsup (0.0, 8.813735870195430477e-01))); %!test %! assert (isequal (asinh (infsup (0.0, +8.0)), infsup (0.0, 2.776472280723718100e+00))); %!test %! assert (isequal (asinh (infsup (0.0, inf)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (asinh (infsup (-6.0, -4.0)), infsup (-2.491779852644912197e+00, -2.094712547261101232e+00))); %!test %! assert (isequal (asinh (infsup (-2.0, -0.5)), infsup (-1.443635475178810523e+00, -4.812118250596034152e-01))); %!test %! assert (isequal (asinh (infsup (-1.0, -0.5)), infsup (-8.813735870195430477e-01, -4.812118250596034152e-01))); %!test %! assert (isequal (asinh (infsup (-0.75, -0.25)), infsup (-6.931471805599453972e-01, -2.474664615472634277e-01))); %!test %! assert (isequal (asinh (infsup (-0.5, 0.5)), infsup (-4.812118250596034708e-01, 4.812118250596034708e-01))); %!test %! assert (isequal (asinh (infsup (0.25, 0.625)), infsup (2.474664615472634277e-01, 5.901436857819590820e-01))); %!test %! assert (isequal (asinh (infsup (-1.0, 1.0)), infsup (-8.813735870195430477e-01, 8.813735870195430477e-01))); %!test %! assert (isequal (asinh (infsup (0.125, 17.0)), infsup (1.246767469214427326e-01, 3.527224456199966163e+00))); %!test %! assert (isequal (asinh (infsup (17.0, 42.0)), infsup (3.527224456199965719e+00, 4.430958492080543820e+00))); %!test %! assert (isequal (asinh (infsup (-42.0, 17.0)), infsup (-4.430958492080543820e+00, 3.527224456199966163e+00))); ## mpfi_atan %!# special values %!test %! assert (isequal (atan (infsup (-inf, -7.0)), infsup (-1.570796326794896780e+00, -1.428899272190732539e+00))); %!test %! assert (isequal (atan (infsup (-inf, 0.0)), infsup (-1.570796326794896780e+00, 0.0))); %!test %! assert (isequal (atan (infsup (-inf, +8.0)), infsup (-1.570796326794896780e+00, 1.446441332248135314e+00))); %!test %! assert (isequal (atan (infsup (-inf, inf)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (-1.0, 0.0)), infsup (-7.853981633974483900e-01, 0.0))); %!test %! assert (isequal (atan (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan (infsup (0.0, +1.0)), infsup (0.0, 7.853981633974483900e-01))); %!test %! assert (isequal (atan (infsup (0.0, +8.0)), infsup (0.0, 1.446441332248135314e+00))); %!test %! assert (isequal (atan (infsup (0.0, inf)), infsup (0.0, 1.570796326794896780e+00))); %!# regular values %!test %! assert (isequal (atan (infsup (-6.0, -4.0)), infsup (-1.405647649380269870e+00, -1.325817663668032331e+00))); %!test %! assert (isequal (atan (infsup (-2.0, -0.5)), infsup (-1.107148717794090631e+00, -4.636476090008060935e-01))); %!test %! assert (isequal (atan (infsup (-1.0, -0.5)), infsup (-7.853981633974483900e-01, -4.636476090008060935e-01))); %!test %! assert (isequal (atan (infsup (-0.75, -0.25)), infsup (-6.435011087932844820e-01, -2.449786631268641435e-01))); %!test %! assert (isequal (atan (infsup (-0.5, 0.5)), infsup (-4.636476090008061490e-01, 4.636476090008061490e-01))); %!test %! assert (isequal (atan (infsup (0.25, 0.625)), infsup (2.449786631268641435e-01, 5.585993153435624414e-01))); %!test %! assert (isequal (atan (infsup (-1.0, 1.0)), infsup (-7.853981633974483900e-01, 7.853981633974483900e-01))); %!test %! assert (isequal (atan (infsup (0.125, 17.0)), infsup (1.243549945467614243e-01, 1.512040504079174008e+00))); %!test %! assert (isequal (atan (infsup (17.0, 42.0)), infsup (1.512040504079173786e+00, 1.546991300609826814e+00))); %!test %! assert (isequal (atan (infsup (-42.0, 17.0)), infsup (-1.546991300609826814e+00, 1.512040504079174008e+00))); ## mpfi_atan2 %!# special values %!test %! assert (isequal (atan2 (infsup (-inf, -7.0), infsup (-1.0, +8.0)), infsup (-1.712693381399060577e+00, -7.188299996216244159e-01))); %!test %! assert (isequal (atan2 (infsup (-inf, 0.0), infsup (+8.0, inf)), infsup (-1.570796326794896780e+00, 0.0))); %!test %! assert (isequal (atan2 (infsup (-inf, +8.0), infsup (0.0, +8.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (0.0, +8.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (-inf, -7.0)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, +8.0), infsup (-7.0, 0.0)), infsup (1.570796326794896558e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (0.0, +8.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (0.0, inf), infsup (0.0, +8.0)), infsup (0.0, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (+8.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, +8.0), infsup (-7.0, +8.0)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (0.0, inf), infsup (0.0, +8.0)), infsup (0.0, 1.570796326794896780e+00))); %!# regular values %!test %! assert (isequal (atan2 (infsup (-17.0, -5.0), infsup (-4002.0, -1.0)), infsup (-3.140343278927514969e+00, -1.629552149510619108e+00))); %!test %! assert (isequal (atan2 (infsup (-17.0, -5.0), infsup (1.0, 4002.0)), infsup (-1.512040504079174008e+00, -1.249374662278356866e-03))); %!test %! assert (isequal (atan2 (infsup (5.0, 17.0), infsup (1.0, 4002.0)), infsup (1.249374662278356866e-03, 1.512040504079174008e+00))); %!test %! assert (isequal (atan2 (infsup (5.0, 17.0), infsup (-4002.0, -1.0)), infsup (1.629552149510619108e+00, 3.140343278927514969e+00))); %!test %! assert (isequal (atan2 (infsup (-17.0, 5.0), infsup (-4002.0, 1.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); ## mpfi_atanh %!# special values %!test %! assert (isequal (atanh (infsup (-1.0, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (atanh (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atanh (infsup (0.0, +1.0)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (atanh (infsup (-1.0, -0.5)), infsup (-inf, -5.493061443340547800e-01))); %!test %! assert (isequal (atanh (infsup (-0.75, -0.25)), infsup (-9.729550745276567270e-01, -2.554128118829953054e-01))); %!test %! assert (isequal (atanh (infsup (-0.5, 0.5)), infsup (-5.493061443340548911e-01, 5.493061443340548911e-01))); %!test %! assert (isequal (atanh (infsup (0.25, 0.625)), infsup (2.554128118829953054e-01, 7.331685343967135893e-01))); %!test %! assert (isequal (atanh (infsup (-1.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (atanh (infsup (0.125, 1.0)), infsup (1.256572141404530274e-01, inf))); ## mpfi_bounded_p %!# special values %!test %! assert (isequal (iscommoninterval (infsup (-inf, -8.0)), false)); %!test %! assert (isequal (iscommoninterval (infsup (-inf, 0.0)), false)); %!test %! assert (isequal (iscommoninterval (infsup (-inf, 5.0)), false)); %!test %! assert (isequal (iscommoninterval (infsup (-inf, inf)), false)); %!test %! assert (iscommoninterval (infsup (-8.0, 0.0))); %!test %! assert (iscommoninterval (infsup (0.0, 0.0))); %!test %! assert (iscommoninterval (infsup (0.0, 5.0))); %!test %! assert (isequal (iscommoninterval (infsup (0.0, inf)), false)); %!test %! assert (isequal (iscommoninterval (infsup (5.0, inf)), false)); %!# regular values %!test %! assert (iscommoninterval (infsup (-34.0, -17.0))); %!test %! assert (iscommoninterval (infsup (-8.0, -1.0))); %!test %! assert (iscommoninterval (infsup (-34.0, 17.0))); %!test %! assert (iscommoninterval (infsup (-3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (iscommoninterval (infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (iscommoninterval (infsup (+8.0, 5.070602400912906347e+30))); %!test %! assert (iscommoninterval (infsup (9.999999999999998890e-01, 2.0))); ## mpfi_cbrt %!# special values %!test %! assert (isequal (cbrt (infsup (-inf, -125.0)), infsup (-inf, -5.0))); %!test %! assert (isequal (cbrt (infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (cbrt (infsup (-inf, +64.0)), infsup (-inf, +4.0))); %!test %! assert (isequal (cbrt (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cbrt (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (cbrt (infsup (0.0, +27.0)), infsup (0.0, +3.0))); %!test %! assert (isequal (cbrt (infsup (0.0, inf)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (cbrt (infsup (6.400000000000000000e+01, 1.250000000000000000e+02)), infsup (4.0, 5.0))); %!test %! assert (isequal (cbrt (infsup (-1.866945721837885044e-91, 2.160000000000000000e+02)), infsup (-5.715364030403196328e-31, 6.0))); %!test %! assert (isequal (cbrt (infsup (3.752421802055952558e-300, 2.729924395354002306e-189)), infsup (1.553950629986428998e-100, 1.397602084890329947e-63))); ## mpfi_cos %!# special values %!test %! assert (isequal (cos (infsup (-inf, -7.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-inf, 0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-inf, +8.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-inf, inf)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-1.0, 0.0)), infsup (5.403023058681396540e-01, 1.0))); %!test %! assert (isequal (cos (infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (cos (infsup (0.0, +1.0)), infsup (5.403023058681396540e-01, 1.0))); %!test %! assert (isequal (cos (infsup (0.0, +8.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (0.0, inf)), infsup (-1.0, 1.0))); %!# regular values %!test %! assert (isequal (cos (infsup (-2.0, -0.5)), infsup (-4.161468365471424069e-01, 8.775825618903727587e-01))); %!test %! assert (isequal (cos (infsup (-1.0, -0.25)), infsup (5.403023058681396540e-01, 9.689124217106448445e-01))); %!test %! assert (isequal (cos (infsup (-0.5, 0.5)), infsup (8.775825618903726477e-01, 1.0))); %!test %! assert (isequal (cos (infsup (-4.5, 0.625)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (1.0, 3.141592653589793116e+00)), infsup (-1.0, 5.403023058681397650e-01))); %!test %! assert (isequal (cos (infsup (0.125, 17.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (17.0, 42.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-7.0, 1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-7.0, 0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-7.0, -1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-7.0, -2.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-7.0, -3.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-7.0, -4.0)), infsup (-6.536436208636119405e-01, 1.0))); %!test %! assert (isequal (cos (infsup (-7.0, -5.0)), infsup (2.836621854632262463e-01, 1.0))); %!test %! assert (isequal (cos (infsup (-7.0, -6.0)), infsup (7.539022543433046009e-01, 1.0))); %!test %! assert (isequal (cos (infsup (-7.0, -7.0)), infsup (7.539022543433046009e-01, 7.539022543433047119e-01))); %!test %! assert (isequal (cos (infsup (-6.0, 1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-6.0, 0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-6.0, -1.0)), infsup (-1.0, 9.601702866503660783e-01))); %!test %! assert (isequal (cos (infsup (-6.0, -2.0)), infsup (-1.0, 9.601702866503660783e-01))); %!test %! assert (isequal (cos (infsup (-6.0, -3.0)), infsup (-1.0, 9.601702866503660783e-01))); %!test %! assert (isequal (cos (infsup (-6.0, -4.0)), infsup (-6.536436208636119405e-01, 9.601702866503660783e-01))); %!test %! assert (isequal (cos (infsup (-6.0, -5.0)), infsup (2.836621854632262463e-01, 9.601702866503660783e-01))); %!test %! assert (isequal (cos (infsup (-6.0, -6.0)), infsup (9.601702866503659672e-01, 9.601702866503660783e-01))); %!test %! assert (isequal (cos (infsup (-5.0, 1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-5.0, 0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-5.0, -1.0)), infsup (-1.0, 5.403023058681397650e-01))); %!test %! assert (isequal (cos (infsup (-5.0, -2.0)), infsup (-1.0, 2.836621854632263018e-01))); %!test %! assert (isequal (cos (infsup (-5.0, -3.0)), infsup (-1.0, 2.836621854632263018e-01))); %!test %! assert (isequal (cos (infsup (-5.0, -4.0)), infsup (-6.536436208636119405e-01, 2.836621854632263018e-01))); %!test %! assert (isequal (cos (infsup (-5.0, -5.0)), infsup (2.836621854632262463e-01, 2.836621854632263018e-01))); %!test %! assert (isequal (cos (infsup (-4.0, 1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-4.0, 0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-4.0, -1.0)), infsup (-1.0, 5.403023058681397650e-01))); %!test %! assert (isequal (cos (infsup (-4.0, -2.0)), infsup (-1.0, -4.161468365471423514e-01))); %!test %! assert (isequal (cos (infsup (-4.0, -3.0)), infsup (-1.0, -6.536436208636118295e-01))); %!test %! assert (isequal (cos (infsup (-4.0, -4.0)), infsup (-6.536436208636119405e-01, -6.536436208636118295e-01))); ## mpfi_cosh %!# special values %!test %! assert (isequal (cosh (infsup (-inf, -7.0)), infsup (5.483170351552120110e+02, inf))); %!test %! assert (isequal (cosh (infsup (-inf, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (cosh (infsup (-inf, +8.0)), infsup (1.0, inf))); %!test %! assert (isequal (cosh (infsup (-inf, inf)), infsup (1.0, inf))); %!test %! assert (isequal (cosh (infsup (-1.0, 0.0)), infsup (1.0, 1.543080634815243934e+00))); %!test %! assert (isequal (cosh (infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (cosh (infsup (0.0, +1.0)), infsup (1.0, 1.543080634815243934e+00))); %!test %! assert (isequal (cosh (infsup (0.0, +8.0)), infsup (1.0, 1.490479161252178301e+03))); %!test %! assert (isequal (cosh (infsup (0.0, inf)), infsup (1.0, inf))); %!# regular values %!test %! assert (isequal (cosh (infsup (-0.125, 0.0)), infsup (1.0, 1.007822677825710889e+00))); %!test %! assert (isequal (cosh (infsup (0.0, 5.000000000000001110e-01)), infsup (1.0, 1.127625965206380920e+00))); %!test %! assert (isequal (cosh (infsup (-4.5, -0.625)), infsup (1.201753692975606302e+00, 4.501412014853003285e+01))); %!test %! assert (isequal (cosh (infsup (1.0, 3.0)), infsup (1.543080634815243712e+00, 1.006766199577776710e+01))); %!test %! assert (isequal (cosh (infsup (17.0, 7.090895657128239691e+02)), infsup (1.207747637678766809e+07, 4.494232837155419541e+307))); ## mpfi_cot %!# special values %!test %! assert (isequal (cot (infsup (-inf, -7.0)), infsup (-inf, inf))); %!test %! assert (isequal (cot (infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (cot (infsup (-inf, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (cot (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cot (infsup (-8.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (cot (infsup (-3.0, 0.0)), infsup (-inf, 7.015252551434533856e+00))); %!test %! assert (isequal (cot (infsup (-1.0, 0.0)), infsup (-inf, -6.420926159343306461e-01))); %!test %! assert (isequal (cot (infsup (0.0, +1.0)), infsup (6.420926159343306461e-01, inf))); %!test %! assert (isequal (cot (infsup (0.0, +3.0)), infsup (-7.015252551434533856e+00, inf))); %!test %! assert (isequal (cot (infsup (0.0, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (cot (infsup (0.0, inf)), infsup (-inf, inf))); %!# regular values %!test %! assert (isequal (cot (infsup (-3.0, -2.0)), infsup (4.576575543602857121e-01, 7.015252551434533856e+00))); %!test %! assert (isequal (cot (infsup (-3.0, -1.570796326794896780e+00)), infsup (1.608122649676636354e-16, 7.015252551434533856e+00))); %!test %! assert (isequal (cot (infsup (-2.0, 1.570796326794896780e+00)), infsup (-inf, inf))); %!test %! assert (isequal (cot (infsup (0.125, 0.5)), infsup (1.830487721712451776e+00, 7.958289865867011592e+00))); %!test %! assert (isequal (cot (infsup (0.125, 1.570796326794896780e+00)), infsup (-1.608122649676636601e-16, 7.958289865867011592e+00))); %!test %! assert (isequal (cot (infsup (1.570796326794896780e+00, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (cot (infsup (4.0, 6.283185307179586232e+00)), infsup (-4.082809838298842500e+15, 8.636911544506166161e-01))); %!test %! assert (isequal (cot (infsup (3.141592653589793258e+02, 3.151592653589792690e+02)), infsup (6.420926159344081396e-01, 5.090647314608024375e+14))); ## mpfi_coth %!# special values %!test %! assert (isequal (coth (infsup (-inf, -7.0)), infsup (-1.000001663058821100e+00, -1.0))); %!test %! assert (isequal (coth (infsup (-inf, 0.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (coth (infsup (-inf, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (coth (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (coth (infsup (-8.0, 0.0)), infsup (-inf, -1.000000225070374560e+00))); %!test %! assert (isequal (coth (infsup (-3.0, 0.0)), infsup (-inf, -1.004969823313689004e+00))); %!test %! assert (isequal (coth (infsup (-1.0, 0.0)), infsup (-inf, -1.313035285499331239e+00))); %!test %! assert (isequal (coth (infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (coth (infsup (0.0, +1.0)), infsup (1.313035285499331239e+00, inf))); %!test %! assert (isequal (coth (infsup (0.0, +3.0)), infsup (1.004969823313689004e+00, inf))); %!test %! assert (isequal (coth (infsup (0.0, +8.0)), infsup (1.000000225070374560e+00, inf))); %!test %! assert (isequal (coth (infsup (0.0, inf)), infsup (1.0, inf))); %!# regular values %!test %! assert (isequal (coth (infsup (-3.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (coth (infsup (-10.0, -8.0)), infsup (-1.000000225070374782e+00, -1.000000004122307162e+00))); %!test %! assert (isequal (coth (infsup (7.0, 17.0)), infsup (1.000000000000003331e+00, 1.000001663058821100e+00))); %!test %! assert (isequal (coth (infsup (1.562500000000000347e-02, 5.000000000000001110e-01)), infsup (2.163953413738652021e+00, 6.400520824856424440e+01))); ## mpfi_csc %!# special values %!test %! assert (isequal (csc (infsup (-inf, -7.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-inf, 8.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-8.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-3.0, 0.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (csc (infsup (-1.0, 0.0)), infsup (-inf, -1.188395105778121019e+00))); %!test %! assert (isequal (csc (infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (csc (infsup (0.0, +1.0)), infsup (1.188395105778121019e+00, inf))); %!test %! assert (isequal (csc (infsup (0.0, 3.0)), infsup (1.0, inf))); %!test %! assert (isequal (csc (infsup (0.0, 8.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (0.0, inf)), infsup (-inf, inf))); %!# regular values %!test %! assert (isequal (csc (infsup (-6.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-6.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-6.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-6.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-6.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-6.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-6.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-6.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-6.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-6.0, -2.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-6.0, -3.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-6.0, -4.0)), infsup (1.0, 3.578899547254406066e+00))); %!test %! assert (isequal (csc (infsup (-6.0, -5.0)), infsup (1.042835212771405784e+00, 3.578899547254406066e+00))); %!test %! assert (isequal (csc (infsup (-6.0, -6.0)), infsup (3.578899547254405622e+00, 3.578899547254406066e+00))); %!test %! assert (isequal (csc (infsup (-5.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-5.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-5.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-5.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-5.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-5.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-5.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-5.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-5.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-5.0, -2.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-5.0, -3.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-5.0, -4.0)), infsup (1.0, 1.321348708810902384e+00))); %!test %! assert (isequal (csc (infsup (-5.0, -5.0)), infsup (1.042835212771405784e+00, 1.042835212771406006e+00))); %!test %! assert (isequal (csc (infsup (-4.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-4.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-4.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-4.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-4.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-4.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-4.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-4.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-4.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-4.0, -2.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-4.0, -3.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-4.0, -4.0)), infsup (1.321348708810902162e+00, 1.321348708810902384e+00))); %!test %! assert (isequal (csc (infsup (-3.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-3.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-3.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-3.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-3.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-3.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-3.0, 0.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (csc (infsup (-3.0, -1.0)), infsup (-7.086167395737186681e+00, -1.0))); %!test %! assert (isequal (csc (infsup (-3.0, -2.0)), infsup (-7.086167395737186681e+00, -1.099750170294616414e+00))); %!test %! assert (isequal (csc (infsup (-3.0, -3.0)), infsup (-7.086167395737186681e+00, -7.086167395737185792e+00))); %!test %! assert (isequal (csc (infsup (-2.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-2.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-2.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-2.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-2.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-2.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-2.0, 0.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (csc (infsup (-2.0, -1.0)), infsup (-1.188395105778121241e+00, -1.0))); %!test %! assert (isequal (csc (infsup (-2.0, -2.0)), infsup (-1.099750170294616636e+00, -1.099750170294616414e+00))); %!test %! assert (isequal (csc (infsup (-1.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-1.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-1.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-1.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-1.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-1.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-1.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (-1.0, 0.0)), infsup (-inf, -1.188395105778121019e+00))); %!test %! assert (isequal (csc (infsup (-1.0, -1.0)), infsup (-1.188395105778121241e+00, -1.188395105778121019e+00))); %!test %! assert (isequal (csc (infsup (1.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (1.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (1.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (1.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (1.0, 3.0)), infsup (1.0, 7.086167395737186681e+00))); %!test %! assert (isequal (csc (infsup (1.0, 2.0)), infsup (1.0, 1.188395105778121241e+00))); %!test %! assert (isequal (csc (infsup (1.0, 1.0)), infsup (1.188395105778121019e+00, 1.188395105778121241e+00))); %!test %! assert (isequal (csc (infsup (2.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (2.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (2.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (2.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (2.0, 3.0)), infsup (1.099750170294616414e+00, 7.086167395737186681e+00))); %!test %! assert (isequal (csc (infsup (2.0, 2.0)), infsup (1.099750170294616414e+00, 1.099750170294616636e+00))); %!test %! assert (isequal (csc (infsup (3.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (3.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (3.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (3.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (3.0, 3.0)), infsup (7.086167395737185792e+00, 7.086167395737186681e+00))); %!test %! assert (isequal (csc (infsup (4.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (4.0, 6.0)), infsup (-3.578899547254406066e+00, -1.0))); %!test %! assert (isequal (csc (infsup (4.0, 5.0)), infsup (-1.321348708810902384e+00, -1.0))); %!test %! assert (isequal (csc (infsup (4.0, 4.0)), infsup (-1.321348708810902384e+00, -1.321348708810902162e+00))); %!test %! assert (isequal (csc (infsup (5.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (5.0, 6.0)), infsup (-3.578899547254406066e+00, -1.042835212771405784e+00))); %!test %! assert (isequal (csc (infsup (5.0, 5.0)), infsup (-1.042835212771406006e+00, -1.042835212771405784e+00))); %!test %! assert (isequal (csc (infsup (6.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (csc (infsup (6.0, 6.0)), infsup (-3.578899547254406066e+00, -3.578899547254405622e+00))); %!test %! assert (isequal (csc (infsup (7.0, 7.0)), infsup (1.522101062563730345e+00, 1.522101062563730567e+00))); ## mpfi_csch %!# special values %!test %! assert (isequal (csch (infsup (-inf, -7.0)), infsup (-1.823765447622379028e-03, 0.0))); %!test %! assert (isequal (csch (infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (csch (infsup (-inf, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (csch (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (csch (infsup (-8.0, 0.0)), infsup (-inf, -6.709253313077229598e-04))); %!test %! assert (isequal (csch (infsup (-3.0, 0.0)), infsup (-inf, -9.982156966882273219e-02))); %!test %! assert (isequal (csch (infsup (-1.0, 0.0)), infsup (-inf, -8.509181282393214474e-01))); %!test %! assert (isequal (csch (infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (csch (infsup (0.0, +1.0)), infsup (8.509181282393214474e-01, inf))); %!test %! assert (isequal (csch (infsup (0.0, +3.0)), infsup (9.982156966882273219e-02, inf))); %!test %! assert (isequal (csch (infsup (0.0, +8.0)), infsup (6.709253313077229598e-04, inf))); %!test %! assert (isequal (csch (infsup (0.0, inf)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (csch (infsup (-3.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (csch (infsup (-10.0, -8.0)), infsup (-6.709253313077230682e-04, -9.079985971212215304e-05))); %!test %! assert (isequal (csch (infsup (7.0, 17.0)), infsup (8.279875437570346897e-08, 1.823765447622379028e-03))); %!test %! assert (isequal (csch (infsup (1.562500000000000347e-02, 5.000000000000001110e-01)), infsup (1.919034751334943056e+00, 6.399739590750608187e+01))); ## mpfi_d_div %!# special values %!test %! assert (isequal (infsup (-3.999999999999999670e-17, -3.999999999999999670e-17) ./ infsup (-inf, -7.0), infsup (0.0, 5.714285714285713924e-18))); %! assert (isequal (rdivide (infsup (-3.999999999999999670e-17, -3.999999999999999670e-17), infsup (-inf, -7.0)), infsup (0.0, 5.714285714285713924e-18))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-inf, -7.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-inf, -7.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (3.999999999999999670e-17, 3.999999999999999670e-17) ./ infsup (-inf, -7.0), infsup (-5.714285714285713924e-18, 0.0))); %! assert (isequal (rdivide (infsup (3.999999999999999670e-17, 3.999999999999999670e-17), infsup (-inf, -7.0)), infsup (-5.714285714285713924e-18, 0.0))); %!test %! assert (isequal (infsup (-8.000000000000000572e-17, -8.000000000000000572e-17) ./ infsup (-inf, 0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-8.000000000000000572e-17, -8.000000000000000572e-17), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-inf, 0.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-inf, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (8.000000000000000572e-17, 8.000000000000000572e-17) ./ infsup (-inf, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (8.000000000000000572e-17, 8.000000000000000572e-17), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-1.600000000000000000e+18, -1.600000000000000000e+18) ./ infsup (-inf, 8.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-1.600000000000000000e+18, -1.600000000000000000e+18), infsup (-inf, 8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-inf, 8.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-inf, 8.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (1.600000000000000000e+18, 1.600000000000000000e+18) ./ infsup (-inf, 8.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (1.600000000000000000e+18, 1.600000000000000000e+18), infsup (-inf, 8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.600000000000000114e-16, -1.600000000000000114e-16) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-1.600000000000000114e-16, -1.600000000000000114e-16), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0e-17, 0.0e-17) ./ infsup (-inf, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0e-17, 0.0e-17), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (1.600000000000000114e-16, 1.600000000000000114e-16) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (1.600000000000000114e-16, 1.600000000000000114e-16), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.000000000000000072e-17, -1.000000000000000072e-17) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-1.000000000000000072e-17, -1.000000000000000072e-17), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (1.000000000000000072e-17, 1.000000000000000072e-17) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (1.000000000000000072e-17, 1.000000000000000072e-17), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-3.000000000000000061e-17, -3.000000000000000061e-17) ./ infsup (0.0, 7.0), infsup (-inf, -4.285714285714285251e-18))); %! assert (isequal (rdivide (infsup (-3.000000000000000061e-17, -3.000000000000000061e-17), infsup (0.0, 7.0)), infsup (-inf, -4.285714285714285251e-18))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (0.0, 7.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (0.0, 7.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (3.000000000000000061e-17, 3.000000000000000061e-17) ./ infsup (0.0, 7.0), infsup (4.285714285714285251e-18, inf))); %! assert (isequal (rdivide (infsup (3.000000000000000061e-17, 3.000000000000000061e-17), infsup (0.0, 7.0)), infsup (4.285714285714285251e-18, inf))); %!test %! assert (isequal (infsup (-7.000000000000000347e-17, -7.000000000000000347e-17) ./ infsup (0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-7.000000000000000347e-17, -7.000000000000000347e-17), infsup (0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (0.0, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (6.999999999999999114e-17, 6.999999999999999114e-17) ./ infsup (0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (6.999999999999999114e-17, 6.999999999999999114e-17), infsup (0.0, inf)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (infsup (-2.5, -2.5) ./ infsup (-8.0, 8.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-2.5, -2.5), infsup (-8.0, 8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-2.5, -2.5) ./ infsup (-8.0, -5.0), infsup (3.125000000000000000e-01, 0.5))); %! assert (isequal (rdivide (infsup (-2.5, -2.5), infsup (-8.0, -5.0)), infsup (3.125000000000000000e-01, 0.5))); %!test %! assert (isequal (infsup (-2.5, -2.5) ./ infsup (25.0, 40.0), infsup (-1.000000000000000056e-01, -6.250000000000000000e-02))); %! assert (isequal (rdivide (infsup (-2.5, -2.5), infsup (25.0, 40.0)), infsup (-1.000000000000000056e-01, -6.250000000000000000e-02))); %!test %! assert (isequal (infsup (-2.5, -2.5) ./ infsup (-16.0, -7.0), infsup (1.562500000000000000e-01, 3.571428571428571508e-01))); %! assert (isequal (rdivide (infsup (-2.5, -2.5), infsup (-16.0, -7.0)), infsup (1.562500000000000000e-01, 3.571428571428571508e-01))); %!test %! assert (isequal (infsup (-2.5, -2.5) ./ infsup (11.0, 143.0), infsup (-2.272727272727272929e-01, -1.748251748251748033e-02))); %! assert (isequal (rdivide (infsup (-2.5, -2.5), infsup (11.0, 143.0)), infsup (-2.272727272727272929e-01, -1.748251748251748033e-02))); %!test %! assert (isequal (infsup (33.125, 33.125) ./ infsup (8.28125, 530.0), infsup (6.250000000000000000e-02, 4.0))); %! assert (isequal (rdivide (infsup (33.125, 33.125), infsup (8.28125, 530.0)), infsup (6.250000000000000000e-02, 4.0))); %!test %! assert (isequal (infsup (33.125, 33.125) ./ infsup (-530.0, -496.875), infsup (-6.666666666666667962e-02, -6.250000000000000000e-02))); %! assert (isequal (rdivide (infsup (33.125, 33.125), infsup (-530.0, -496.875)), infsup (-6.666666666666667962e-02, -6.250000000000000000e-02))); %!test %! assert (isequal (infsup (33.125, 33.125) ./ infsup (54.0, 265.0), infsup (0.125, 6.134259259259259300e-01))); %! assert (isequal (rdivide (infsup (33.125, 33.125), infsup (54.0, 265.0)), infsup (0.125, 6.134259259259259300e-01))); %!test %! assert (isequal (infsup (33.125, 33.125) ./ infsup (52.0, 54.0), infsup (6.134259259259258190e-01, 6.370192307692308376e-01))); %! assert (isequal (rdivide (infsup (33.125, 33.125), infsup (52.0, 54.0)), infsup (6.134259259259258190e-01, 6.370192307692308376e-01))); ## mpfi_diam_abs %!# special values %!test %! assert (isequal (wid (infsup (-inf, -8.0)), inf)); %!test %! assert (isequal (wid (infsup (-inf, 0.0)), inf)); %!test %! assert (isequal (wid (infsup (-inf, 5.0)), inf)); %!test %! assert (isequal (wid (infsup (-inf, inf)), inf)); %!test %! assert (isequal (wid (infsup (-inf, 0.0)), inf)); %!test %! assert (isequal (wid (infsup (-8.0, 0.0)), +8)); %!test %! assert (isequal (wid (infsup (0.0, 0.0)), -0)); %!test %! assert (isequal (wid (infsup (0.0, 5.0)), +5)); %!test %! assert (isequal (wid (infsup (0.0, inf)), inf)); %!# regular values %!test %! assert (isequal (wid (infsup (-34.0, -17.0)), 17)); ## mpfi_div %!# special values %!test %! assert (isequal (infsup (-inf, -7.0) ./ infsup (-1.0, +8.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, -7.0), infsup (-1.0, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (+8.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (+8.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, +8.0) ./ infsup (0.0, +8.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, +8.0), infsup (0.0, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (0.0, +8.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (0.0, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-inf, -7.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-inf, -7.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, +8.0) ./ infsup (-7.0, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (0.0, +8.0), infsup (-7.0, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (0.0, +8.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (0.0, +8.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (0.0, +8.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (0.0, +8.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (+8.0, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (+8.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-inf, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, +8.0) ./ infsup (-7.0, +8.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (0.0, +8.0), infsup (-7.0, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (0.0, +8.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (0.0, +8.0)), infsup (0.0, inf))); %!# regular value %!test %! assert (isequal (infsup (-1.234567890000000000e+08, -3.003000000000000000e+04) ./ infsup (-2.860000000000000000e+02, -9.000000000000000000e+00), infsup (1.050000000000000000e+02, 1.371742100000000000e+07))); %! assert (isequal (rdivide (infsup (-1.234567890000000000e+08, -3.003000000000000000e+04), infsup (-2.860000000000000000e+02, -9.000000000000000000e+00)), infsup (1.050000000000000000e+02, 1.371742100000000000e+07))); %!test %! assert (isequal (infsup (-1.234567890000000000e+08, -8.022692722045614289e-02) ./ infsup (-4.655552514652689666e+01, -9.000000000000000000e+00), infsup (1.723252545599116220e-03, 1.371742100000000000e+07))); %! assert (isequal (rdivide (infsup (-1.234567890000000000e+08, -8.022692722045614289e-02), infsup (-4.655552514652689666e+01, -9.000000000000000000e+00)), infsup (1.723252545599116220e-03, 1.371742100000000000e+07))); %!test %! assert (isequal (infsup (-1.011478505940748729e+00, -4.582214355468750000e-01) ./ infsup (-2.860000000000000000e+02, -2.885141339691025750e-02), infsup (1.602172851562500000e-03, 3.505819600675333447e+01))); %! assert (isequal (rdivide (infsup (-1.011478505940748729e+00, -4.582214355468750000e-01), infsup (-2.860000000000000000e+02, -2.885141339691025750e-02)), infsup (1.602172851562500000e-03, 3.505819600675333447e+01))); %!test %! assert (isequal (infsup (-1.011478505940748729e+00, -8.022692722045614289e-02) ./ infsup (-2.909720321657931041e+00, -2.885141339691025750e-02), infsup (2.757204072958585953e-02, 3.505819600675333447e+01))); %! assert (isequal (rdivide (infsup (-1.011478505940748729e+00, -8.022692722045614289e-02), infsup (-2.909720321657931041e+00, -2.885141339691025750e-02)), infsup (2.757204072958585953e-02, 3.505819600675333447e+01))); %!test %! assert (isequal (infsup (-3.199335425627046480e+80, -1.785000000000000000e+03) ./ infsup (-7.000000000000000000e+00, 0.0), infsup (2.550000000000000000e+02, inf))); %! assert (isequal (rdivide (infsup (-3.199335425627046480e+80, -1.785000000000000000e+03), infsup (-7.000000000000000000e+00, 0.0)), infsup (2.550000000000000000e+02, inf))); %!test %! assert (isequal (infsup (-2.560000000000000000e+02, -9.207771443835954805e-01) ./ infsup (-1.486045243803458593e+00, 0.0), infsup (6.196158214045437429e-01, inf))); %! assert (isequal (rdivide (infsup (-2.560000000000000000e+02, -9.207771443835954805e-01), infsup (-1.486045243803458593e+00, 0.0)), infsup (6.196158214045437429e-01, inf))); %!test %! assert (isequal (infsup (-1.148236704163043909e+00, -6.001224414812756924e-01) ./ infsup (-5.769162195036162677e-01, 2.794322589058405581e-01), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-1.148236704163043909e+00, -6.001224414812756924e-01), infsup (-5.769162195036162677e-01, 2.794322589058405581e-01)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-100.0, -15.0) ./ infsup (0.0, +3.0), infsup (-inf, -5.0))); %! assert (isequal (rdivide (infsup (-100.0, -15.0), infsup (0.0, +3.0)), infsup (-inf, -5.0))); %!test %! assert (isequal (infsup (-2.0, -1.148236704163043909e+00) ./ infsup (0.0, 5.769162195036162677e-01), infsup (-inf, -1.990300610981255991e+00))); %! assert (isequal (rdivide (infsup (-2.0, -1.148236704163043909e+00), infsup (0.0, 5.769162195036162677e-01)), infsup (-inf, -1.990300610981255991e+00))); %!test %! assert (isequal (infsup (-4.886718345000000000e+09, -4.804800000000000000e+05) ./ infsup (1.035000000000000000e+03, 4.576000000000000000e+03), infsup (-4.721467000000000000e+06, -1.050000000000000000e+02))); %! assert (isequal (rdivide (infsup (-4.886718345000000000e+09, -4.804800000000000000e+05), infsup (1.035000000000000000e+03, 4.576000000000000000e+03)), infsup (-4.721467000000000000e+06, -1.050000000000000000e+02))); %!test %! assert (isequal (infsup (-8.377603228949244141e-01, -3.333999742949345091e-12) ./ infsup (4.532967658553376467e+00, 9.191685613161424376e+62), infsup (-1.848149790599393216e-01, -3.627190793139666743e-75))); %! assert (isequal (rdivide (infsup (-8.377603228949244141e-01, -3.333999742949345091e-12), infsup (4.532967658553376467e+00, 9.191685613161424376e+62)), infsup (-1.848149790599393216e-01, -3.627190793139666743e-75))); %!test %! assert (isequal (infsup (-4.886718345000000000e+09, -1.690035415063386504e+00) ./ infsup (7.896423339843750000e-03, 1.538379475155964848e-01), infsup (-6.188521226240000000e+11, -1.098581619396635745e+01))); %! assert (isequal (rdivide (infsup (-4.886718345000000000e+09, -1.690035415063386504e+00), infsup (7.896423339843750000e-03, 1.538379475155964848e-01)), infsup (-6.188521226240000000e+11, -1.098581619396635745e+01))); %!test %! assert (isequal (infsup (-1.340416516631879063e+01, -1.690035415063386504e+00) ./ infsup (2.833104786595860292e-01, 3.938251456399270012e+01), infsup (-4.731263463934446634e+01, -4.291334450768108377e-02))); %! assert (isequal (rdivide (infsup (-1.340416516631879063e+01, -1.690035415063386504e+00), infsup (2.833104786595860292e-01, 3.938251456399270012e+01)), infsup (-4.731263463934446634e+01, -4.291334450768108377e-02))); %!test %! assert (isequal (infsup (-1.234567890000000000e+08, 0.0) ./ infsup (-1.440000000000000000e+02, -9.000000000000000000e+00), infsup (0.0, 1.371742100000000000e+07))); %! assert (isequal (rdivide (infsup (-1.234567890000000000e+08, 0.0), infsup (-1.440000000000000000e+02, -9.000000000000000000e+00)), infsup (0.0, 1.371742100000000000e+07))); %!test %! assert (isequal (infsup (-7.875890313239129747e-02, 0.0) ./ infsup (-3.906250000000000000e-03, -3.752026718402494930e-03), infsup (0.0, 2.099102939382174071e+01))); %! assert (isequal (rdivide (infsup (-7.875890313239129747e-02, 0.0), infsup (-3.906250000000000000e-03, -3.752026718402494930e-03)), infsup (0.0, 2.099102939382174071e+01))); %!test %! assert (isequal (infsup (-6.413817828600000000e+10, 0.0) ./ infsup (-4.581298449000000000e+10, 0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-6.413817828600000000e+10, 0.0), infsup (-4.581298449000000000e+10, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-1.148236704163043909e+00, 0.0) ./ infsup (-5.769162195036162677e-01, 2.794322589058405581e-01), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-1.148236704163043909e+00, 0.0), infsup (-5.769162195036162677e-01, 2.794322589058405581e-01)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-6.413817828600000000e+10, 0.0) ./ infsup (0.0, 3.000000000000000000e+00), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-6.413817828600000000e+10, 0.0), infsup (0.0, 3.000000000000000000e+00)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-1.234567890000000000e+08, 0.0) ./ infsup (9.000000000000000000e+00, 1.440000000000000000e+02), infsup (-1.371742100000000000e+07, 0.0))); %! assert (isequal (rdivide (infsup (-1.234567890000000000e+08, 0.0), infsup (9.000000000000000000e+00, 1.440000000000000000e+02)), infsup (-1.371742100000000000e+07, 0.0))); %!test %! assert (isequal (infsup (-7.875890313239129747e-02, 0.0) ./ infsup (3.752026718402494930e-03, 9.000000000000000000e+00), infsup (-2.099102939382174071e+01, 0.0))); %! assert (isequal (rdivide (infsup (-7.875890313239129747e-02, 0.0), infsup (3.752026718402494930e-03, 9.000000000000000000e+00)), infsup (-2.099102939382174071e+01, 0.0))); %!test %! assert (isequal (infsup (-1.234567890000000000e+08, 4.262400000000000000e+04) ./ infsup (-2.806000000000000000e+03, -9.000000000000000000e+00), infsup (-4.736000000000000000e+03, 1.371742100000000000e+07))); %! assert (isequal (rdivide (infsup (-1.234567890000000000e+08, 4.262400000000000000e+04), infsup (-2.806000000000000000e+03, -9.000000000000000000e+00)), infsup (-4.736000000000000000e+03, 1.371742100000000000e+07))); %!test %! assert (isequal (infsup (-1.800000000000000000e+01, 1.600000000000000000e+01) ./ infsup (-8.063085270350000000e+11, -9.000000000000000000e+00), infsup (-1.777777777777777901e+00, 2.0))); %! assert (isequal (rdivide (infsup (-1.800000000000000000e+01, 1.600000000000000000e+01), infsup (-8.063085270350000000e+11, -9.000000000000000000e+00)), infsup (-1.777777777777777901e+00, 2.0))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 4.582214355468750000e-01) ./ infsup (-8.796093022200000000e+11, -2.860000000000000000e+02), infsup (-1.602172851562500000e-03, 3.496503496503496934e-03))); %! assert (isequal (rdivide (infsup (-1.000000000000000000e+00, 4.582214355468750000e-01), infsup (-8.796093022200000000e+11, -2.860000000000000000e+02)), infsup (-1.602172851562500000e-03, 3.496503496503496934e-03))); %!test %! assert (isequal (infsup (-7.098547996011581596e-01, 6.900706076855589011e+00) ./ infsup (-1.524656123849300000e+13, -8.096558996257990914e-01), infsup (-8.523010923584831033e+00, 8.767364011418107284e-01))); %! assert (isequal (rdivide (infsup (-7.098547996011581596e-01, 6.900706076855589011e+00), infsup (-1.524656123849300000e+13, -8.096558996257990914e-01)), infsup (-8.523010923584831033e+00, 8.767364011418107284e-01))); %!test %! assert (isequal (infsup (-3.199335425627046480e+80, 1.785000000000000000e+03) ./ infsup (-7.000000000000000000e+00, 0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-3.199335425627046480e+80, 1.785000000000000000e+03), infsup (-7.000000000000000000e+00, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.148236704163043909e+00, 6.001224414812756924e-01) ./ infsup (-5.769162195036162677e-01, 2.794322589058405581e-01), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-1.148236704163043909e+00, 6.001224414812756924e-01), infsup (-5.769162195036162677e-01, 2.794322589058405581e-01)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, +15.0) ./ infsup (-3.0, +3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (0.0, +15.0), infsup (-3.0, +3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-3.003000000000000000e+04, 8.972767232000000000e+11) ./ infsup (2.860000000000000000e+02, 3.003000000000000000e+03), infsup (-1.050000000000000000e+02, 3.137331200000000000e+09))); %! assert (isequal (rdivide (infsup (-3.003000000000000000e+04, 8.972767232000000000e+11), infsup (2.860000000000000000e+02, 3.003000000000000000e+03)), infsup (-1.050000000000000000e+02, 3.137331200000000000e+09))); %!test %! assert (isequal (infsup (-1.600000000000000000e+01, 8.972767232000000000e+11) ./ infsup (2.860000000000000000e+02, 3.003000000000000000e+03), infsup (-5.594405594405595095e-02, 3.137331200000000000e+09))); %! assert (isequal (rdivide (infsup (-1.600000000000000000e+01, 8.972767232000000000e+11), infsup (2.860000000000000000e+02, 3.003000000000000000e+03)), infsup (-5.594405594405595095e-02, 3.137331200000000000e+09))); %!test %! assert (isequal (infsup (-3.003000000000000000e+04, 1.024000000000000000e+03) ./ infsup (2.860000000000000000e+02, 3.003000000000000000e+03), infsup (-1.050000000000000000e+02, 3.580419580419580861e+00))); %! assert (isequal (rdivide (infsup (-3.003000000000000000e+04, 1.024000000000000000e+03), infsup (2.860000000000000000e+02, 3.003000000000000000e+03)), infsup (-1.050000000000000000e+02, 3.580419580419580861e+00))); %!test %! assert (isequal (infsup (-1.094531424968872235e+00, 2.080935869470149413e+00) ./ infsup (1.149189461478033136e+00, 2.730000000000000000e+02), infsup (-9.524377499608617237e-01, 1.810785722655120944e+00))); %! assert (isequal (rdivide (infsup (-1.094531424968872235e+00, 2.080935869470149413e+00), infsup (1.149189461478033136e+00, 2.730000000000000000e+02)), infsup (-9.524377499608617237e-01, 1.810785722655120944e+00))); %!test %! assert (isequal (infsup (0.0, 1.234567890000000000e+08) ./ infsup (-1.000000000000000000e+01, -9.000000000000000000e+00), infsup (-1.371742100000000000e+07, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 1.234567890000000000e+08), infsup (-1.000000000000000000e+01, -9.000000000000000000e+00)), infsup (-1.371742100000000000e+07, 0.0))); %!test %! assert (isequal (infsup (0.0, 1.674790800242983879e+00) ./ infsup (-9.375000000000000000e-01, -8.900092612419525651e-01), infsup (-1.881767834534572748e+00, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 1.674790800242983879e+00), infsup (-9.375000000000000000e-01, -8.900092612419525651e-01)), infsup (-1.881767834534572748e+00, 0.0))); %!test %! assert (isequal (infsup (0.0, 1.000000000000000000e+01) ./ infsup (-9.000000000000000000e+00, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 1.000000000000000000e+01), infsup (-9.000000000000000000e+00, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, 1.000000000000000000e+01) ./ infsup (-1.0, +1.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (0.0, 1.000000000000000000e+01), infsup (-1.0, +1.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 1.234567890000000000e+08) ./ infsup (9.000000000000000000e+00, 1.000000000000000000e+01), infsup (0.0, 1.371742100000000000e+07))); %! assert (isequal (rdivide (infsup (0.0, 1.234567890000000000e+08), infsup (9.000000000000000000e+00, 1.000000000000000000e+01)), infsup (0.0, 1.371742100000000000e+07))); %!test %! assert (isequal (infsup (0.0, 1.372726670594058396e+00) ./ infsup (2.225298220308889352e+00, 1.000000000000000000e+01), infsup (0.0, 6.168731265167295419e-01))); %! assert (isequal (rdivide (infsup (0.0, 1.372726670594058396e+00), infsup (2.225298220308889352e+00, 1.000000000000000000e+01)), infsup (0.0, 6.168731265167295419e-01))); %!test %! assert (isequal (infsup (3.003000000000000000e+04, 1.234567890000000000e+08) ./ infsup (-2.860000000000000000e+02, -9.000000000000000000e+00), infsup (-1.371742100000000000e+07, -1.050000000000000000e+02))); %! assert (isequal (rdivide (infsup (3.003000000000000000e+04, 1.234567890000000000e+08), infsup (-2.860000000000000000e+02, -9.000000000000000000e+00)), infsup (-1.371742100000000000e+07, -1.050000000000000000e+02))); %!test %! assert (isequal (infsup (4.582214355468750000e-01, 1.603374748222124779e+01) ./ infsup (-2.860000000000000000e+02, -2.286926490048424743e+00), infsup (-7.011046289416036359e+00, -1.602172851562500000e-03))); %! assert (isequal (rdivide (infsup (4.582214355468750000e-01, 1.603374748222124779e+01), infsup (-2.860000000000000000e+02, -2.286926490048424743e+00)), infsup (-7.011046289416036359e+00, -1.602172851562500000e-03))); %!test %! assert (isequal (infsup (6.045543549399371441e-01, 1.234567890000000000e+08) ./ infsup (-2.113739798239034684e+01, -9.000000000000000000e+00), infsup (-1.371742100000000000e+07, -2.860117198169773861e-02))); %! assert (isequal (rdivide (infsup (6.045543549399371441e-01, 1.234567890000000000e+08), infsup (-2.113739798239034684e+01, -9.000000000000000000e+00)), infsup (-1.371742100000000000e+07, -2.860117198169773861e-02))); %!test %! assert (isequal (infsup (8.802057619444758618e-01, 1.024602584497202873e+00) ./ infsup (-3.157474458321694599e-01, -1.779681367608609566e-01), infsup (-5.757224878259978418e+00, -2.787689254697360841e+00))); %! assert (isequal (rdivide (infsup (8.802057619444758618e-01, 1.024602584497202873e+00), infsup (-3.157474458321694599e-01, -1.779681367608609566e-01)), infsup (-5.757224878259978418e+00, -2.787689254697360841e+00))); %!test %! assert (isequal (infsup (3.003000000000000000e+04, 6.116600000000000000e+04) ./ infsup (-2.860000000000000000e+02, 0.0), infsup (-inf, -1.050000000000000000e+02))); %! assert (isequal (rdivide (infsup (3.003000000000000000e+04, 6.116600000000000000e+04), infsup (-2.860000000000000000e+02, 0.0)), infsup (-inf, -1.050000000000000000e+02))); %!test %! assert (isequal (infsup (1.037610958488276169e-01, 6.116600000000000000e+04) ./ infsup (-8.870683004794921445e-01, 0.0), infsup (-inf, -1.169708079893521518e-01))); %! assert (isequal (rdivide (infsup (1.037610958488276169e-01, 6.116600000000000000e+04), infsup (-8.870683004794921445e-01, 0.0)), infsup (-inf, -1.169708079893521518e-01))); %!test %! assert (isequal (infsup (5.0, 6.0) ./ infsup (-3.157474458321694599e-01, 1.779681367608609566e-01), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (5.0, 6.0), infsup (-3.157474458321694599e-01, 1.779681367608609566e-01)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (3.003000000000000000e+04, 9.786700000000000000e+05) ./ infsup (0.0, 2.860000000000000000e+02), infsup (1.050000000000000000e+02, inf))); %! assert (isequal (rdivide (infsup (3.003000000000000000e+04, 9.786700000000000000e+05), infsup (0.0, 2.860000000000000000e+02)), infsup (1.050000000000000000e+02, inf))); %!test %! assert (isequal (infsup (1.496153990149218460e+00, 9.786700000000000000e+05) ./ infsup (0.0, 1.283943542366996704e+00), infsup (1.165280201799998139e+00, inf))); %! assert (isequal (rdivide (infsup (1.496153990149218460e+00, 9.786700000000000000e+05), infsup (0.0, 1.283943542366996704e+00)), infsup (1.165280201799998139e+00, inf))); %!test %! assert (isequal (infsup (1.593578642000000000e+09, 7.418529635000000000e+09) ./ infsup (3.136799000000000000e+06, 8.952689000000000000e+06), infsup (1.780000000000000000e+02, 2.365000000000000000e+03))); %! assert (isequal (rdivide (infsup (1.593578642000000000e+09, 7.418529635000000000e+09), infsup (3.136799000000000000e+06, 8.952689000000000000e+06)), infsup (1.780000000000000000e+02, 2.365000000000000000e+03))); %!test %! assert (isequal (infsup (7.198359729899688961e-03, 7.418529635000000000e+09) ./ infsup (2.991484642028808594e+00, 1.424014817987124104e+01), infsup (5.054975298694381908e-04, 2.479882240000000000e+09))); %! assert (isequal (rdivide (infsup (7.198359729899688961e-03, 7.418529635000000000e+09), infsup (2.991484642028808594e+00, 1.424014817987124104e+01)), infsup (5.054975298694381908e-04, 2.479882240000000000e+09))); %!test %! assert (isequal (infsup (3.710339409299194813e-01, 1.002109217638827987e+00) ./ infsup (2.286926490048424743e+00, 8.537949562072753906e+00), infsup (4.345703125000000000e-02, 4.381903930885022724e-01))); %! assert (isequal (rdivide (infsup (3.710339409299194813e-01, 1.002109217638827987e+00), infsup (2.286926490048424743e+00, 8.537949562072753906e+00)), infsup (4.345703125000000000e-02, 4.381903930885022724e-01))); %!test %! assert (isequal (infsup (3.228846131764277760e-02, 3.599978364696688526e+00) ./ infsup (5.102487095624549385e-01, 7.548398876996481599e-01), infsup (4.277524524577111520e-02, 7.055340458937599202e+00))); %! assert (isequal (rdivide (infsup (3.228846131764277760e-02, 3.599978364696688526e+00), infsup (5.102487095624549385e-01, 7.548398876996481599e-01)), infsup (4.277524524577111520e-02, 7.055340458937599202e+00))); ## mpfi_div_d %!# special values %!test %! assert (isequal (infsup (-inf, -7.0) ./ infsup (-7.0, -7.0), infsup (1.0, inf))); %! assert (isequal (rdivide (infsup (-inf, -7.0), infsup (-7.0, -7.0)), infsup (1.0, inf))); %!test %! assert (isequal (infsup (-inf, -7.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-inf, -7.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, -7.0) ./ infsup (7.0, 7.0), infsup (-inf, -1.0))); %! assert (isequal (rdivide (infsup (-inf, -7.0), infsup (7.0, 7.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-8.000000000000000572e-17, -8.000000000000000572e-17), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-8.000000000000000572e-17, -8.000000000000000572e-17)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (8.000000000000000572e-17, 8.000000000000000572e-17), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (8.000000000000000572e-17, 8.000000000000000572e-17)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, 8.0) ./ infsup (-3.0, -3.0), infsup (-2.666666666666666963e+00, inf))); %! assert (isequal (rdivide (infsup (-inf, 8.0), infsup (-3.0, -3.0)), infsup (-2.666666666666666963e+00, inf))); %!test %! assert (isequal (infsup (-inf, 8.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-inf, 8.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, 8.0) ./ infsup (3.0, 3.0), infsup (-inf, 2.666666666666666963e+00))); %! assert (isequal (rdivide (infsup (-inf, 8.0), infsup (3.0, 3.0)), infsup (-inf, 2.666666666666666963e+00))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-1.600000000000000114e-16, -1.600000000000000114e-16), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-1.600000000000000114e-16, -1.600000000000000114e-16)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (0.0e-17, 0.0e-17), infsup)); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (0.0e-17, 0.0e-17)), infsup)); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (1.600000000000000114e-16, 1.600000000000000114e-16), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (1.600000000000000114e-16, 1.600000000000000114e-16)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-1.000000000000000072e-17, -1.000000000000000072e-17), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-1.000000000000000072e-17, -1.000000000000000072e-17)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (1.000000000000000072e-17, 1.000000000000000072e-17), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (1.000000000000000072e-17, 1.000000000000000072e-17)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 8.0) ./ infsup (-3.000000000000000061e-17, -3.000000000000000061e-17), infsup (-2.666666666666666880e+17, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 8.0), infsup (-3.000000000000000061e-17, -3.000000000000000061e-17)), infsup (-2.666666666666666880e+17, 0.0))); %!test %! assert (isequal (infsup (0.0, 8.0) ./ infsup (3.000000000000000061e-17, 3.000000000000000061e-17), infsup (0.0, 2.666666666666666880e+17))); %! assert (isequal (rdivide (infsup (0.0, 8.0), infsup (3.000000000000000061e-17, 3.000000000000000061e-17)), infsup (0.0, 2.666666666666666880e+17))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-7.000000000000000347e-17, -7.000000000000000347e-17), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-7.000000000000000347e-17, -7.000000000000000347e-17)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (6.999999999999999114e-17, 6.999999999999999114e-17), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (6.999999999999999114e-17, 6.999999999999999114e-17)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (infsup (-4.294967296000000954e+09, -5.000000000000001110e-01) ./ infsup (-1.0, -1.0), infsup (5.000000000000001110e-01, 4.294967296000000954e+09))); %! assert (isequal (rdivide (infsup (-4.294967296000000954e+09, -5.000000000000001110e-01), infsup (-1.0, -1.0)), infsup (5.000000000000001110e-01, 4.294967296000000954e+09))); %!test %! assert (isequal (infsup (-4.294967296000001907e+09, -5.000000000000001110e-01) ./ infsup (5.000000000000001110e-01, 5.000000000000001110e-01), infsup (-8.589934592000001907e+09, -1.0))); %! assert (isequal (rdivide (infsup (-4.294967296000001907e+09, -5.000000000000001110e-01), infsup (5.000000000000001110e-01, 5.000000000000001110e-01)), infsup (-8.589934592000001907e+09, -1.0))); %!test %! assert (isequal (infsup (-4.294967296000000954e+09, -5.000000596046448864e-01) ./ infsup (5.000000000000001110e-01, 5.000000000000001110e-01), infsup (-8.589934592000000000e+09, -1.000000119209289329e+00))); %! assert (isequal (rdivide (infsup (-4.294967296000000954e+09, -5.000000596046448864e-01), infsup (5.000000000000001110e-01, 5.000000000000001110e-01)), infsup (-8.589934592000000000e+09, -1.000000119209289329e+00))); %!test %! assert (isequal (infsup (-4.294967296000001907e+09, -5.000000596046448864e-01) ./ infsup (5.000000000000001110e-01, 5.000000000000001110e-01), infsup (-8.589934592000001907e+09, -1.000000119209289329e+00))); %! assert (isequal (rdivide (infsup (-4.294967296000001907e+09, -5.000000596046448864e-01), infsup (5.000000000000001110e-01, 5.000000000000001110e-01)), infsup (-8.589934592000001907e+09, -1.000000119209289329e+00))); %!test %! assert (isequal (infsup (-5.688888888888888884e-01, 4.003199668773774219e+13) ./ infsup (-5.124095576030431000e+15, -5.124095576030431000e+15), infsup (-7.812500000000000000e-03, 1.110223024625156540e-16))); %! assert (isequal (rdivide (infsup (-5.688888888888888884e-01, 4.003199668773774219e+13), infsup (-5.124095576030431000e+15, -5.124095576030431000e+15)), infsup (-7.812500000000000000e-03, 1.110223024625156540e-16))); %!test %! assert (isequal (infsup (-5.688888888888888884e-01, 5.000000000000001110e-01) ./ infsup (-5.124095576030431000e+15, -5.124095576030431000e+15), infsup (-9.757819552369542371e-17, 1.110223024625156540e-16))); %! assert (isequal (rdivide (infsup (-5.688888888888888884e-01, 5.000000000000001110e-01), infsup (-5.124095576030431000e+15, -5.124095576030431000e+15)), infsup (-9.757819552369542371e-17, 1.110223024625156540e-16))); %!test %! assert (isequal (infsup (-1.0, 4.003199668773774219e+13) ./ infsup (-5.124095576030431000e+15, -5.124095576030431000e+15), infsup (-7.812500000000000000e-03, 1.951563910473908228e-16))); %! assert (isequal (rdivide (infsup (-1.0, 4.003199668773774219e+13), infsup (-5.124095576030431000e+15, -5.124095576030431000e+15)), infsup (-7.812500000000000000e-03, 1.951563910473908228e-16))); %!test %! assert (isequal (infsup (-1.0, 5.000000000000001110e-01) ./ infsup (-5.124095576030431000e+15, -5.124095576030431000e+15), infsup (-9.757819552369542371e-17, 1.951563910473908228e-16))); %! assert (isequal (rdivide (infsup (-1.0, 5.000000000000001110e-01), infsup (-5.124095576030431000e+15, -5.124095576030431000e+15)), infsup (-9.757819552369542371e-17, 1.951563910473908228e-16))); ## mpfi_d_sub %!# special values %!test %! assert (isequal (infsup (-4.000000000000000286e-17, -4.000000000000000286e-17) - infsup (-inf, -7.0), infsup (6.999999999999999112e+00, inf))); %! assert (isequal (minus (infsup (-4.000000000000000286e-17, -4.000000000000000286e-17), infsup (-inf, -7.0)), infsup (6.999999999999999112e+00, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (-inf, -7.0), infsup (7.0, inf))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (-inf, -7.0)), infsup (7.0, inf))); %!test %! assert (isequal (infsup (4.000000000000000286e-17, 4.000000000000000286e-17) - infsup (-inf, -7.0), infsup (7.0, inf))); %! assert (isequal (minus (infsup (4.000000000000000286e-17, 4.000000000000000286e-17), infsup (-inf, -7.0)), infsup (7.0, inf))); %!test %! assert (isequal (infsup (-8.192000000000000586e-14, -8.192000000000000586e-14) - infsup (-inf, 0.0), infsup (-8.192000000000000586e-14, inf))); %! assert (isequal (minus (infsup (-8.192000000000000586e-14, -8.192000000000000586e-14), infsup (-inf, 0.0)), infsup (-8.192000000000000586e-14, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (-inf, 0.0), infsup (0.0, inf))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (8.192000000000000586e-14, 8.192000000000000586e-14) - infsup (-inf, 0.0), infsup (8.192000000000000586e-14, inf))); %! assert (isequal (minus (infsup (8.192000000000000586e-14, 8.192000000000000586e-14), infsup (-inf, 0.0)), infsup (8.192000000000000586e-14, inf))); %!test %! assert (isequal (infsup (-1.600000000000000000e+18, -1.600000000000000000e+18) - infsup (-inf, 8.0), infsup (-1.600000000000000256e+18, inf))); %! assert (isequal (minus (infsup (-1.600000000000000000e+18, -1.600000000000000000e+18), infsup (-inf, 8.0)), infsup (-1.600000000000000256e+18, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (-inf, 8.0), infsup (-8.0, inf))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (-inf, 8.0)), infsup (-8.0, inf))); %!test %! assert (isequal (infsup (1.600000000000000000e+18, 1.600000000000000000e+18) - infsup (-inf, 8.0), infsup (1.599999999999999744e+18, inf))); %! assert (isequal (minus (infsup (1.600000000000000000e+18, 1.600000000000000000e+18), infsup (-inf, 8.0)), infsup (1.599999999999999744e+18, inf))); %!test %! assert (isequal (infsup (-1.600000000000000114e-16, -1.600000000000000114e-16) - infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-1.600000000000000114e-16, -1.600000000000000114e-16), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0e-17, 0.0e-17) - infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (minus (infsup (0.0e-17, 0.0e-17), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (1.600000000000000114e-16, 1.600000000000000114e-16) - infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (minus (infsup (1.600000000000000114e-16, 1.600000000000000114e-16), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.000000000000000072e-17, -1.000000000000000072e-17) - infsup (0.0, 0.0), infsup (-1.000000000000000072e-17, -1.000000000000000072e-17))); %! assert (isequal (minus (infsup (-1.000000000000000072e-17, -1.000000000000000072e-17), infsup (0.0, 0.0)), infsup (-1.000000000000000072e-17, -1.000000000000000072e-17))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (1.000000000000000072e-17, 1.000000000000000072e-17) - infsup (0.0, 0.0), infsup (1.000000000000000072e-17, 1.000000000000000072e-17))); %! assert (isequal (minus (infsup (1.000000000000000072e-17, 1.000000000000000072e-17), infsup (0.0, 0.0)), infsup (1.000000000000000072e-17, 1.000000000000000072e-17))); %!test %! assert (isequal (infsup (-3.000000000000000061e-17, -3.000000000000000061e-17) - infsup (0.0, 8.0), infsup (-8.000000000000001776e+00, -3.000000000000000061e-17))); %! assert (isequal (minus (infsup (-3.000000000000000061e-17, -3.000000000000000061e-17), infsup (0.0, 8.0)), infsup (-8.000000000000001776e+00, -3.000000000000000061e-17))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (0.0, 8.0), infsup (-8.0, 0.0))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (0.0, 8.0)), infsup (-8.0, 0.0))); %!test %! assert (isequal (infsup (3.000000000000000061e-17, 3.000000000000000061e-17) - infsup (0.0, 8.0), infsup (-8.0, 3.000000000000000061e-17))); %! assert (isequal (minus (infsup (3.000000000000000061e-17, 3.000000000000000061e-17), infsup (0.0, 8.0)), infsup (-8.0, 3.000000000000000061e-17))); %!test %! assert (isequal (infsup (-7.000000000000000347e-17, -7.000000000000000347e-17) - infsup (0.0, inf), infsup (-inf, -7.000000000000000347e-17))); %! assert (isequal (minus (infsup (-7.000000000000000347e-17, -7.000000000000000347e-17), infsup (0.0, inf)), infsup (-inf, -7.000000000000000347e-17))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-6.999999999999999114e-17, -6.999999999999999114e-17) - infsup (0.0, inf), infsup (-inf, -6.999999999999999114e-17))); %! assert (isequal (minus (infsup (-6.999999999999999114e-17, -6.999999999999999114e-17), infsup (0.0, inf)), infsup (-inf, -6.999999999999999114e-17))); %!# regular values %!test %! assert (isequal (infsup (-3.141592653589793116e+01, -3.141592653589793116e+01) - infsup (17.0, 32.0), infsup (-6.341592653589793116e+01, -4.841592653589793116e+01))); %! assert (isequal (minus (infsup (-3.141592653589793116e+01, -3.141592653589793116e+01), infsup (17.0, 32.0)), infsup (-6.341592653589793116e+01, -4.841592653589793116e+01))); %!test %! assert (isequal (infsup (3.141592653589793116e+01, 3.141592653589793116e+01) - infsup (17.0, 3.141592653589793116e+01), infsup (0.0, 1.441592653589793116e+01))); %! assert (isequal (minus (infsup (3.141592653589793116e+01, 3.141592653589793116e+01), infsup (17.0, 3.141592653589793116e+01)), infsup (0.0, 1.441592653589793116e+01))); %!test %! assert (isequal (infsup (1.570796326794896558e+01, 1.570796326794896558e+01) - infsup (1.570796326794896558e+01, 32.0), infsup (-1.629203673205103442e+01, 0.0))); %! assert (isequal (minus (infsup (1.570796326794896558e+01, 1.570796326794896558e+01), infsup (1.570796326794896558e+01, 32.0)), infsup (-1.629203673205103442e+01, 0.0))); %!test %! assert (isequal (infsup (3.5, 3.5) - infsup (-3.202559735019019375e+14, -1.820444444444444443e+01), infsup (2.170444444444444443e+01, 3.202559735019054375e+14))); %! assert (isequal (minus (infsup (3.5, 3.5), infsup (-3.202559735019019375e+14, -1.820444444444444443e+01)), infsup (2.170444444444444443e+01, 3.202559735019054375e+14))); %!test %! assert (isequal (infsup (3.5, 3.5) - infsup (-3.202559735019019375e+14, -7.111111111111111105e-02), infsup (3.571111111111110681e+00, 3.202559735019054375e+14))); %! assert (isequal (minus (infsup (3.5, 3.5), infsup (-3.202559735019019375e+14, -7.111111111111111105e-02)), infsup (3.571111111111110681e+00, 3.202559735019054375e+14))); %!test %! assert (isequal (infsup (256.5, 256.5) - infsup (-1.137777777777777777e+00, 2.550000000000000000e+02), infsup (1.500000000000000000e+00, 2.576377777777777851e+02))); %! assert (isequal (minus (infsup (256.5, 256.5), infsup (-1.137777777777777777e+00, 2.550000000000000000e+02)), infsup (1.500000000000000000e+00, 2.576377777777777851e+02))); %!test %! assert (isequal (infsup (4097.5, 4097.5) - infsup (2.713328551617526225e-166, 1.999999999999999778e+00), infsup (4.095500000000000000e+03, 4.097500000000000000e+03))); %! assert (isequal (minus (infsup (4097.5, 4097.5), infsup (2.713328551617526225e-166, 1.999999999999999778e+00)), infsup (4.095500000000000000e+03, 4.097500000000000000e+03))); %!test %! assert (isequal (infsup (-3.5, -3.5) - infsup (-3.202559735019019375e+14, -1.820444444444444443e+01), infsup (1.470444444444444443e+01, 3.202559735018984375e+14))); %! assert (isequal (minus (infsup (-3.5, -3.5), infsup (-3.202559735019019375e+14, -1.820444444444444443e+01)), infsup (1.470444444444444443e+01, 3.202559735018984375e+14))); %!test %! assert (isequal (infsup (-3.5, -3.5) - infsup (-3.202559735019019375e+14, -7.111111111111111105e-02), infsup (-3.428888888888889319e+00, 3.202559735018984375e+14))); %! assert (isequal (minus (infsup (-3.5, -3.5), infsup (-3.202559735019019375e+14, -7.111111111111111105e-02)), infsup (-3.428888888888889319e+00, 3.202559735018984375e+14))); %!test %! assert (isequal (infsup (-256.5, -256.5) - infsup (-1.137777777777777777e+00, 2.550000000000000000e+02), infsup (-5.115000000000000000e+02, -2.553622222222222149e+02))); %! assert (isequal (minus (infsup (-256.5, -256.5), infsup (-1.137777777777777777e+00, 2.550000000000000000e+02)), infsup (-5.115000000000000000e+02, -2.553622222222222149e+02))); %!test %! assert (isequal (infsup (-4097.5, -4097.5) - infsup (2.713328551617526225e-166, 1.999999999999999778e+00), infsup (-4.099500000000000000e+03, -4.097500000000000000e+03))); %! assert (isequal (minus (infsup (-4097.5, -4097.5), infsup (2.713328551617526225e-166, 1.999999999999999778e+00)), infsup (-4.099500000000000000e+03, -4.097500000000000000e+03))); ## mpfi_exp %!# special values %!test %! assert (isequal (exp (infsup (-inf, -7.0)), infsup (0.0, 9.118819655545162437e-04))); %!test %! assert (isequal (exp (infsup (-inf, 0.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (exp (infsup (-inf, +1.0)), infsup (0.0, 2.718281828459045535e+00))); %!test %! assert (isequal (exp (infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (exp (infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (exp (infsup (0.0, +1.0)), infsup (1.0, 2.718281828459045535e+00))); %!test %! assert (isequal (exp (infsup (0.0, inf)), infsup (1.0, inf))); %!# regular values %!test %! assert (isequal (exp (infsup (-123.0, -17.0)), infsup (3.817497188671174176e-54, 4.139937718785166831e-08))); %!test %! assert (isequal (exp (infsup (-0.125, 0.25)), infsup (8.824969025845953441e-01, 1.284025416687741616e+00))); %!test %! assert (isequal (exp (infsup (-0.125, 0.0)), infsup (8.824969025845953441e-01, 1.0))); %!test %! assert (isequal (exp (infsup (0.0, 0.25)), infsup (1.0, 1.284025416687741616e+00))); %!test %! assert (isequal (exp (infsup (7.105427357601001859e-14, 7.815970093361102045e-14)), infsup (1.000000000000071054e+00, 1.000000000000078382e+00))); ## mpfi_exp2 %!# special values %!test %! assert (isequal (pow2 (infsup (-inf, -1.0)), infsup (0.0, 0.5))); %!test %! assert (isequal (pow2 (infsup (-inf, 0.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow2 (infsup (-inf, 1.0)), infsup (0.0, 2.0))); %!test %! assert (isequal (pow2 (infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow2 (infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow2 (infsup (0.0, +1.0)), infsup (1.0, 2.0))); %!test %! assert (isequal (pow2 (infsup (0.0, inf)), infsup (1.0, inf))); %!# regular values %!test %! assert (isequal (pow2 (infsup (-123.0, -17.0)), infsup (9.403954806578300064e-38, 7.629394531250000000e-06))); %!test %! assert (isequal (pow2 (infsup (-7.0, 7.0)), infsup (7.812500000000000000e-03, 1.280000000000000000e+02))); %!test %! assert (isequal (pow2 (infsup (-0.125, 0.25)), infsup (9.170040432046712153e-01, 1.189207115002721249e+00))); %!test %! assert (isequal (pow2 (infsup (-0.125, 0.0)), infsup (9.170040432046712153e-01, 1.0))); %!test %! assert (isequal (pow2 (infsup (0.0, 0.25)), infsup (1.0, 1.189207115002721249e+00))); %!test %! assert (isequal (pow2 (infsup (7.105427357601001859e-14, 7.815970093361102045e-14)), infsup (1.000000000000049072e+00, 1.000000000000054179e+00))); ## mpfi_expm1 %!# special values %!test %! assert (isequal (expm1 (infsup (-inf, -7.0)), infsup (-1.0, -9.990881180344454160e-01))); %!test %! assert (isequal (expm1 (infsup (-inf, 0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (expm1 (infsup (-inf, 1.0)), infsup (-1.0, 1.718281828459045313e+00))); %!test %! assert (isequal (expm1 (infsup (-inf, inf)), infsup (-1.0, inf))); %!test %! assert (isequal (expm1 (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (expm1 (infsup (0.0, 1.0)), infsup (0.0, 1.718281828459045313e+00))); %!test %! assert (isequal (expm1 (infsup (0.0, inf)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (expm1 (infsup (-36.0, -36.0)), infsup (-9.999999999999997780e-01, -9.999999999999996669e-01))); %!test %! assert (isequal (expm1 (infsup (-0.125, 0.25)), infsup (-1.175030974154046004e-01, 2.840254166877415054e-01))); %!test %! assert (isequal (expm1 (infsup (-0.125, 0.0)), infsup (-1.175030974154046004e-01, 0.0))); %!test %! assert (isequal (expm1 (infsup (0.0, 0.25)), infsup (0.0, 2.840254166877415054e-01))); %!test %! assert (isequal (expm1 (infsup (7.105427357601001859e-14, 7.815970093361102045e-14)), infsup (7.105427357601254294e-14, 7.815970093361408754e-14))); ## mpfi_hypot %!# special values %!test %! assert (isequal (hypot (infsup (-inf, -7.0), infsup (-1.0, 8.0)), infsup (7.0, inf))); %!test %! assert (isequal (hypot (infsup (-inf, 0.0), infsup (8.0, inf)), infsup (8.0, inf))); %!test %! assert (isequal (hypot (infsup (-inf, 8.0), infsup (0.0, 8.0)), infsup (0.0, inf))); %!test %! assert (isequal (hypot (infsup (-inf, inf), infsup (0.0, 8.0)), infsup (0.0, inf))); %!test %! assert (isequal (hypot (infsup (0.0, 0.0), infsup (-inf, -7.0)), infsup (7.0, inf))); %!test %! assert (isequal (hypot (infsup (0.0, 3.0), infsup (-4.0, 0.0)), infsup (0.0, 5.0))); %!test %! assert (isequal (hypot (infsup (0.0, 0.0), infsup (0.0, 8.0)), infsup (0.0, 8.0))); %!test %! assert (isequal (hypot (infsup (0.0, inf), infsup (0.0, 8.0)), infsup (0.0, inf))); %!test %! assert (isequal (hypot (infsup (0.0, 0.0), infsup (8.0, inf)), infsup (8.0, inf))); %!test %! assert (isequal (hypot (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (hypot (infsup (0.0, 5.0), infsup (0.0, 12.0)), infsup (0.0, 13.0))); %!test %! assert (isequal (hypot (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (hypot (infsup (0.0, inf), infsup (-7.0, 8.0)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (hypot (infsup (-12.0, -5.0), infsup (-35.0, -12.0)), infsup (13.0, 37.0))); %!test %! assert (isequal (hypot (infsup (6.0, 7.0), infsup (1.0, 24.0)), infsup (6.082762530298219339e+00, 25.0))); %!test %! assert (isequal (hypot (infsup (-4.0, +7.0), infsup (-25.0, 3.0)), infsup (0.0, 2.596150997149434048e+01))); %!test %! assert (isequal (hypot (infsup (6.082762530298219339e+00, 2.596150997149434048e+01), infsup (6.082762530298219339e+00, 2.596150997149434048e+01)), infsup (8.602325267042624901e+00, 3.671511950137164604e+01))); ## mpfi_intersect %!# special values %!test %! assert (isequal (intersect (infsup (-inf, -7.0), infsup (-1.0, +8.0)), infsup)); %!test %! assert (isequal (intersect (infsup (-inf, 0.0), infsup (+8.0, inf)), infsup)); %!test %! assert (isequal (intersect (infsup (-inf, +8.0), infsup (0.0, +8.0)), infsup (0.0, +8.0))); %!test %! assert (isequal (intersect (infsup (-inf, inf), infsup (0.0, +8.0)), infsup (0.0, +8.0))); %!test %! assert (isequal (intersect (infsup (0.0, 0.0), infsup (-inf, -7.0)), infsup)); %!test %! assert (isequal (intersect (infsup (0.0, +8.0), infsup (-7.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (intersect (infsup (0.0, 0.0), infsup (0.0, +8.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (intersect (infsup (0.0, inf), infsup (0.0, +8.0)), infsup (0.0, +8.0))); %!test %! assert (isequal (intersect (infsup (0.0, 0.0), infsup (+8.0, inf)), infsup)); %!test %! assert (isequal (intersect (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (intersect (infsup (0.0, +8.0), infsup (-7.0, +8.0)), infsup (0.0, +8.0))); %!test %! assert (isequal (intersect (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (intersect (infsup (0.0, inf), infsup (0.0, +8.0)), infsup (0.0, +8.0))); %!# regular values %!test %! assert (isequal (intersect (infsup (1.800000000000000000e+01, 1.440000000000000000e+02), infsup (-1.300000000000000000e+01, 5.200000000000000000e+01)), infsup (1.800000000000000000e+01, 5.200000000000000000e+01))); ## mpfi_inv %!# special values %!test %! assert (isequal (1 ./ infsup (-inf, -.25), infsup (-4.0, 0.0))); %! assert (isequal (rdivide (1, infsup (-inf, -.25)), infsup (-4.0, 0.0))); %! assert (isequal (pown (infsup (-inf, -.25), -1), infsup (-4.0, 0.0))); %! assert (isequal (infsup (-inf, -.25) .^ -1, infsup (-4.0, 0.0))); %! assert (isequal (power (infsup (-inf, -.25), -1), infsup (-4.0, 0.0))); %! assert (isequal (infsup (-inf, -.25) ^ -1, infsup (-4.0, 0.0))); %! assert (isequal (mpower (infsup (-inf, -.25), -1), infsup (-4.0, 0.0))); %!test %! assert (isequal (1 ./ infsup (-inf, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (1, infsup (-inf, 0.0)), infsup (-inf, 0.0))); %! assert (isequal (pown (infsup (-inf, 0.0), -1), infsup (-inf, 0.0))); %! assert (isequal (infsup (-inf, 0.0) .^ -1, infsup (-inf, 0.0))); %! assert (isequal (power (infsup (-inf, 0.0), -1), infsup (-inf, 0.0))); %! assert (isequal (infsup (-inf, 0.0) ^ -1, infsup (-inf, 0.0))); %! assert (isequal (mpower (infsup (-inf, 0.0), -1), infsup (-inf, 0.0))); %!test %! assert (isequal (1 ./ infsup (-inf, +4.0), infsup (-inf, inf))); %! assert (isequal (rdivide (1, infsup (-inf, +4.0)), infsup (-inf, inf))); %! assert (isequal (pown (infsup (-inf, +4.0), -1), infsup (-inf, inf))); %! assert (isequal (infsup (-inf, +4.0) .^ -1, infsup (-inf, inf))); %! assert (isequal (power (infsup (-inf, +4.0), -1), infsup (-inf, inf))); %! assert (isequal (infsup (-inf, +4.0) ^ -1, infsup (-inf, inf))); %! assert (isequal (mpower (infsup (-inf, +4.0), -1), infsup (-inf, inf))); %!test %! assert (isequal (1 ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (1, infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (pown (infsup (-inf, inf), -1), infsup (-inf, inf))); %! assert (isequal (infsup (-inf, inf) .^ -1, infsup (-inf, inf))); %! assert (isequal (power (infsup (-inf, inf), -1), infsup (-inf, inf))); %! assert (isequal (infsup (-inf, inf) ^ -1, infsup (-inf, inf))); %! assert (isequal (mpower (infsup (-inf, inf), -1), infsup (-inf, inf))); %!test %! assert (isequal (1 ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (1, infsup (0.0, 0.0)), infsup)); %! assert (isequal (pown (infsup (0.0, 0.0), -1), infsup)); %! assert (isequal (infsup (0.0, 0.0) .^ -1, infsup)); %! assert (isequal (power (infsup (0.0, 0.0), -1), infsup)); %! assert (isequal (infsup (0.0, 0.0) ^ -1, infsup)); %! assert (isequal (mpower (infsup (0.0, 0.0), -1), infsup)); %!test %! assert (isequal (1 ./ infsup (0.0, +2.0), infsup (+.5, inf))); %! assert (isequal (rdivide (1, infsup (0.0, +2.0)), infsup (+.5, inf))); %! assert (isequal (pown (infsup (0.0, +2.0), -1), infsup (+.5, inf))); %! assert (isequal (infsup (0.0, +2.0) .^ -1, infsup (+.5, inf))); %! assert (isequal (power (infsup (0.0, +2.0), -1), infsup (+.5, inf))); %! assert (isequal (infsup (0.0, +2.0) ^ -1, infsup (+.5, inf))); %! assert (isequal (mpower (infsup (0.0, +2.0), -1), infsup (+.5, inf))); %!test %! assert (isequal (1 ./ infsup (0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (1, infsup (0.0, inf)), infsup (0.0, inf))); %! assert (isequal (pown (infsup (0.0, inf), -1), infsup (0.0, inf))); %! assert (isequal (infsup (0.0, inf) .^ -1, infsup (0.0, inf))); %! assert (isequal (power (infsup (0.0, inf), -1), infsup (0.0, inf))); %! assert (isequal (infsup (0.0, inf) ^ -1, infsup (0.0, inf))); %! assert (isequal (mpower (infsup (0.0, inf), -1), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (1 ./ infsup (-8.0, -2.0), infsup (-.5, -0.125))); %! assert (isequal (rdivide (1, infsup (-8.0, -2.0)), infsup (-.5, -0.125))); %! assert (isequal (pown (infsup (-8.0, -2.0), -1), infsup (-.5, -0.125))); %! assert (isequal (infsup (-8.0, -2.0) .^ -1, infsup (-.5, -0.125))); %! assert (isequal (power (infsup (-8.0, -2.0), -1), infsup (-.5, -0.125))); %! assert (isequal (infsup (-8.0, -2.0) ^ -1, infsup (-.5, -0.125))); %! assert (isequal (mpower (infsup (-8.0, -2.0), -1), infsup (-.5, -0.125))); %!test %! assert (isequal (1 ./ infsup (6.250000000000000000e-02, 6.329046211334584671e-01), infsup (1.580016903983283205e+00, 1.600000000000000000e+01))); %! assert (isequal (rdivide (1, infsup (6.250000000000000000e-02, 6.329046211334584671e-01)), infsup (1.580016903983283205e+00, 1.600000000000000000e+01))); %! assert (isequal (pown (infsup (6.250000000000000000e-02, 6.329046211334584671e-01), -1), infsup (1.580016903983283205e+00, 1.600000000000000000e+01))); %! assert (isequal (infsup (6.250000000000000000e-02, 6.329046211334584671e-01) .^ -1, infsup (1.580016903983283205e+00, 1.600000000000000000e+01))); %! assert (isequal (power (infsup (6.250000000000000000e-02, 6.329046211334584671e-01), -1), infsup (1.580016903983283205e+00, 1.600000000000000000e+01))); %! assert (isequal (infsup (6.250000000000000000e-02, 6.329046211334584671e-01) ^ -1, infsup (1.580016903983283205e+00, 1.600000000000000000e+01))); %! assert (isequal (mpower (infsup (6.250000000000000000e-02, 6.329046211334584671e-01), -1), infsup (1.580016903983283205e+00, 1.600000000000000000e+01))); %!test %! assert (isequal (1 ./ infsup (2.026869327694375278e-01, +64.0), infsup (0.015625, 4.933717168326436031e+00))); %! assert (isequal (rdivide (1, infsup (2.026869327694375278e-01, +64.0)), infsup (0.015625, 4.933717168326436031e+00))); %! assert (isequal (pown (infsup (2.026869327694375278e-01, +64.0), -1), infsup (0.015625, 4.933717168326436031e+00))); %! assert (isequal (infsup (2.026869327694375278e-01, +64.0) .^ -1, infsup (0.015625, 4.933717168326436031e+00))); %! assert (isequal (power (infsup (2.026869327694375278e-01, +64.0), -1), infsup (0.015625, 4.933717168326436031e+00))); %! assert (isequal (infsup (2.026869327694375278e-01, +64.0) ^ -1, infsup (0.015625, 4.933717168326436031e+00))); %! assert (isequal (mpower (infsup (2.026869327694375278e-01, +64.0), -1), infsup (0.015625, 4.933717168326436031e+00))); %!test %! assert (isequal (1 ./ infsup (-6.816974503452348788e-01, -1.950973066082791751e-01), infsup (-5.125647387884359141e+00, -1.466926419474747556e+00))); %! assert (isequal (rdivide (1, infsup (-6.816974503452348788e-01, -1.950973066082791751e-01)), infsup (-5.125647387884359141e+00, -1.466926419474747556e+00))); %! assert (isequal (pown (infsup (-6.816974503452348788e-01, -1.950973066082791751e-01), -1), infsup (-5.125647387884359141e+00, -1.466926419474747556e+00))); %! assert (isequal (infsup (-6.816974503452348788e-01, -1.950973066082791751e-01) .^ -1, infsup (-5.125647387884359141e+00, -1.466926419474747556e+00))); %! assert (isequal (power (infsup (-6.816974503452348788e-01, -1.950973066082791751e-01), -1), infsup (-5.125647387884359141e+00, -1.466926419474747556e+00))); %! assert (isequal (infsup (-6.816974503452348788e-01, -1.950973066082791751e-01) ^ -1, infsup (-5.125647387884359141e+00, -1.466926419474747556e+00))); %! assert (isequal (mpower (infsup (-6.816974503452348788e-01, -1.950973066082791751e-01), -1), infsup (-5.125647387884359141e+00, -1.466926419474747556e+00))); ## mpfi_is_neg %!# special values %!test %! assert (precedes (infsup (-inf, -8.0), infsup (0.0, 0.0))); %!test %! assert (precedes (infsup (-inf, 0.0), infsup (0.0, 0.0))); %!test %! assert (isequal (precedes (infsup (-inf, 5.0), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (precedes (infsup (-inf, inf), infsup (0.0, 0.0)), false)); %!test %! assert (precedes (infsup (-8.0, 0.0), infsup (0.0, 0.0))); %!test %! assert (precedes (infsup (0.0, 0.0), infsup (0.0, 0.0))); %!test %! assert (isequal (precedes (infsup (0.0, 5.0), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (precedes (infsup (0.0, inf), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (precedes (infsup (5.0, inf), infsup (0.0, 0.0)), false)); %!# regular values %!test %! assert (precedes (infsup (-34.0, -17.0), infsup (0.0, 0.0))); %!test %! assert (precedes (infsup (-8.0, -1.0), infsup (0.0, 0.0))); %!test %! assert (isequal (precedes (infsup (-34.0, 17.0), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (precedes (infsup (-3.141592653589793116e+00, 3.141592653589793560e+00), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (precedes (infsup (3.141592653589793116e+00, 3.141592653589793560e+00), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (precedes (infsup (+8.0, 5.070602400912906347e+30), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (precedes (infsup (9.999999999999998890e-01, 2.0), infsup (0.0, 0.0)), false)); ## mpfi_is_nonneg %!# special values %!test %! assert (isequal (le (infsup (0.0, 0.0), infsup (-inf, -8.0)), false)); %! assert (isequal (infsup (0.0, 0.0) <= infsup (-inf, -8.0), false)); %!test %! assert (isequal (le (infsup (0.0, 0.0), infsup (-inf, 0.0)), false)); %! assert (isequal (infsup (0.0, 0.0) <= infsup (-inf, 0.0), false)); %!test %! assert (isequal (le (infsup (0.0, 0.0), infsup (-inf, 5.0)), false)); %! assert (isequal (infsup (0.0, 0.0) <= infsup (-inf, 5.0), false)); %!test %! assert (isequal (le (infsup (0.0, 0.0), infsup (-inf, inf)), false)); %! assert (isequal (infsup (0.0, 0.0) <= infsup (-inf, inf), false)); %!test %! assert (isequal (le (infsup (0.0, 0.0), infsup (-8.0, 0.0)), false)); %! assert (isequal (infsup (0.0, 0.0) <= infsup (-8.0, 0.0), false)); %!test %! assert (le (infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (infsup (0.0, 0.0) <= infsup (0.0, 0.0)); %!test %! assert (le (infsup (0.0, 0.0), infsup (0.0, 5.0))); %! assert (infsup (0.0, 0.0) <= infsup (0.0, 5.0)); %!test %! assert (le (infsup (0.0, 0.0), infsup (0.0, inf))); %! assert (infsup (0.0, 0.0) <= infsup (0.0, inf)); %!test %! assert (le (infsup (0.0, 0.0), infsup (5.0, inf))); %! assert (infsup (0.0, 0.0) <= infsup (5.0, inf)); %!# regular values %!test %! assert (isequal (le (infsup (0.0, 0.0), infsup (-34.0, -17.0)), false)); %! assert (isequal (infsup (0.0, 0.0) <= infsup (-34.0, -17.0), false)); %!test %! assert (isequal (le (infsup (0.0, 0.0), infsup (-8.0, -1.0)), false)); %! assert (isequal (infsup (0.0, 0.0) <= infsup (-8.0, -1.0), false)); %!test %! assert (isequal (le (infsup (0.0, 0.0), infsup (-34.0, 17.0)), false)); %! assert (isequal (infsup (0.0, 0.0) <= infsup (-34.0, 17.0), false)); %!test %! assert (isequal (le (infsup (0.0, 0.0), infsup (-3.141592653589793116e+00, 3.141592653589793560e+00)), false)); %! assert (isequal (infsup (0.0, 0.0) <= infsup (-3.141592653589793116e+00, 3.141592653589793560e+00), false)); %!test %! assert (le (infsup (0.0, 0.0), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %! assert (infsup (0.0, 0.0) <= infsup (3.141592653589793116e+00, 3.141592653589793560e+00)); %!test %! assert (le (infsup (0.0, 0.0), infsup (+8.0, 5.070602400912906347e+30))); %! assert (infsup (0.0, 0.0) <= infsup (+8.0, 5.070602400912906347e+30)); %!test %! assert (le (infsup (0.0, 0.0), infsup (9.999999999999998890e-01, 2.0))); %! assert (infsup (0.0, 0.0) <= infsup (9.999999999999998890e-01, 2.0)); ## mpfi_is_nonpos %!# special values %!test %! assert (le (infsup (-inf, -8.0), infsup (0.0, 0.0))); %! assert (infsup (-inf, -8.0) <= infsup (0.0, 0.0)); %!test %! assert (le (infsup (-inf, 0.0), infsup (0.0, 0.0))); %! assert (infsup (-inf, 0.0) <= infsup (0.0, 0.0)); %!test %! assert (isequal (le (infsup (-inf, 5.0), infsup (0.0, 0.0)), false)); %! assert (isequal (infsup (-inf, 5.0) <= infsup (0.0, 0.0), false)); %!test %! assert (isequal (le (infsup (-inf, inf), infsup (0.0, 0.0)), false)); %! assert (isequal (infsup (-inf, inf) <= infsup (0.0, 0.0), false)); %!test %! assert (le (infsup (-8.0, 0.0), infsup (0.0, 0.0))); %! assert (infsup (-8.0, 0.0) <= infsup (0.0, 0.0)); %!test %! assert (le (infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (infsup (0.0, 0.0) <= infsup (0.0, 0.0)); %!test %! assert (isequal (le (infsup (0.0, 5.0), infsup (0.0, 0.0)), false)); %! assert (isequal (infsup (0.0, 5.0) <= infsup (0.0, 0.0), false)); %!test %! assert (isequal (le (infsup (0.0, inf), infsup (0.0, 0.0)), false)); %! assert (isequal (infsup (0.0, inf) <= infsup (0.0, 0.0), false)); %!test %! assert (isequal (le (infsup (5.0, inf), infsup (0.0, 0.0)), false)); %! assert (isequal (infsup (5.0, inf) <= infsup (0.0, 0.0), false)); %!# regular values %!test %! assert (le (infsup (-34.0, -17.0), infsup (0.0, 0.0))); %! assert (infsup (-34.0, -17.0) <= infsup (0.0, 0.0)); %!test %! assert (le (infsup (-8.0, -1.0), infsup (0.0, 0.0))); %! assert (infsup (-8.0, -1.0) <= infsup (0.0, 0.0)); %!test %! assert (isequal (le (infsup (-34.0, 17.0), infsup (0.0, 0.0)), false)); %! assert (isequal (infsup (-34.0, 17.0) <= infsup (0.0, 0.0), false)); %!test %! assert (isequal (le (infsup (-3.141592653589793116e+00, 3.141592653589793560e+00), infsup (0.0, 0.0)), false)); %! assert (isequal (infsup (-3.141592653589793116e+00, 3.141592653589793560e+00) <= infsup (0.0, 0.0), false)); %!test %! assert (isequal (le (infsup (3.141592653589793116e+00, 3.141592653589793560e+00), infsup (0.0, 0.0)), false)); %! assert (isequal (infsup (3.141592653589793116e+00, 3.141592653589793560e+00) <= infsup (0.0, 0.0), false)); %!test %! assert (isequal (le (infsup (8.0, 5.070602400912906347e+30), infsup (0.0, 0.0)), false)); %! assert (isequal (infsup (8.0, 5.070602400912906347e+30) <= infsup (0.0, 0.0), false)); %!test %! assert (isequal (le (infsup (9.999999999999998890e-01, 2.0), infsup (0.0, 0.0)), false)); %! assert (isequal (infsup (9.999999999999998890e-01, 2.0) <= infsup (0.0, 0.0), false)); ## mpfi_is_pos %!# special values %!test %! assert (isequal (precedes (infsup (0.0, 0.0), infsup (-inf, -8.0)), false)); %!test %! assert (isequal (precedes (infsup (0.0, 0.0), infsup (-inf, 0.0)), false)); %!test %! assert (isequal (precedes (infsup (0.0, 0.0), infsup (-inf, 5.0)), false)); %!test %! assert (isequal (precedes (infsup (0.0, 0.0), infsup (-inf, inf)), false)); %!test %! assert (isequal (precedes (infsup (0.0, 0.0), infsup (-8.0, 0.0)), false)); %!test %! assert (precedes (infsup (0.0, 0.0), infsup (0.0, 0.0))); %!test %! assert (precedes (infsup (0.0, 0.0), infsup (0.0, 5.0))); %!test %! assert (precedes (infsup (0.0, 0.0), infsup (0.0, inf))); %!test %! assert (precedes (infsup (0.0, 0.0), infsup (5.0, inf))); %!# regular values %!test %! assert (isequal (precedes (infsup (0.0, 0.0), infsup (-34.0, -17.0)), false)); %!test %! assert (isequal (precedes (infsup (0.0, 0.0), infsup (-8.0, -1.0)), false)); %!test %! assert (isequal (precedes (infsup (0.0, 0.0), infsup (-34.0, 17.0)), false)); %!test %! assert (isequal (precedes (infsup (0.0, 0.0), infsup (-3.141592653589793116e+00, 3.141592653589793560e+00)), false)); %!test %! assert (precedes (infsup (0.0, 0.0), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (precedes (infsup (0.0, 0.0), infsup (+8.0, 5.070602400912906347e+30))); %!test %! assert (precedes (infsup (0.0, 0.0), infsup (9.999999999999998890e-01, 2.0))); ## mpfi_is_strictly_neg %!# special values %!test %! assert (strictprecedes (infsup (-inf, -8.0), infsup (0.0, 0.0))); %!test %! assert (isequal (strictprecedes (infsup (-inf, 0.0), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (-inf, 5.0), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (-inf, inf), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (-8.0, 0.0), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (0.0, 0.0), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (0.0, 5.0), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (0.0, inf), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (5.0, inf), infsup (0.0, 0.0)), false)); %!# regular values %!test %! assert (strictprecedes (infsup (-34.0, -17.0), infsup (0.0, 0.0))); %!test %! assert (strictprecedes (infsup (-8.0, -1.0), infsup (0.0, 0.0))); %!test %! assert (isequal (strictprecedes (infsup (-34.0, 17.0), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (-3.141592653589793116e+00, 3.141592653589793560e+00), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (3.141592653589793116e+00, 3.141592653589793560e+00), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (+8.0, 5.070602400912906347e+30), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (9.999999999999998890e-01, 2.0), infsup (0.0, 0.0)), false)); ## mpfi_is_strictly_pos %!# special values %!test %! assert (isequal (strictprecedes (infsup (0.0, 0.0), infsup (-inf, -8.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (0.0, 0.0), infsup (-inf, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (0.0, 0.0), infsup (-inf, 5.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (0.0, 0.0), infsup (-inf, inf)), false)); %!test %! assert (isequal (strictprecedes (infsup (0.0, 0.0), infsup (-8.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (0.0, 0.0), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (0.0, 0.0), infsup (0.0, 5.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (0.0, 0.0), infsup (0.0, inf)), false)); %!test %! assert (strictprecedes (infsup (0.0, 0.0), infsup (5.0, inf))); %!# regular values %!test %! assert (isequal (strictprecedes (infsup (0.0, 0.0), infsup (-34.0, -17.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (0.0, 0.0), infsup (-8.0, -1.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (0.0, 0.0), infsup (-34.0, 17.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (0.0, 0.0), infsup (-3.141592653589793116e+00, 3.141592653589793560e+00)), false)); %!test %! assert (strictprecedes (infsup (0.0, 0.0), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (strictprecedes (infsup (0.0, 0.0), infsup (+8.0, 5.070602400912906347e+30))); %!test %! assert (strictprecedes (infsup (0.0, 0.0), infsup (9.999999999999998890e-01, 2.0))); ## mpfi_log %!# special values %!test %! assert (isequal (log (infsup (0.0, +1.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (log (infsup (0.0, inf)), infsup (-inf, inf))); %!# regular values %!test %! assert (isequal (log (infsup (+1.0, +1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (log (infsup (6.245333006274822998e+10, 3.502953474593552856e+11)), infsup (2.485768539575924052e+01, 2.658204248547260207e+01))); %!test %! assert (isequal (log (infsup (7.112834182118892290e-01, +1.0)), infsup (-3.406843094616900380e-01, 0.0))); %!test %! assert (isequal (log (infsup (+1.0, 1.164158665593125820e+09)), infsup (0.0, 2.087526448761322229e+01))); %!test %! assert (isequal (log (infsup (2.045368051078361511e+10, 6.649390526214926758e+11)), infsup (2.374142867931890777e+01, 2.722296122320888756e+01))); ## mpfi_log1p %!# special values %!test %! assert (isequal (log1p (infsup (-1.0, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (log1p (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (log1p (infsup (0.0, 1.0)), infsup (0.0, 6.931471805599453972e-01))); %!test %! assert (isequal (log1p (infsup (0.0, inf)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (log1p (infsup (-7.112834182118892290e-01, 0.0)), infsup (-1.242309757910986745e+00, 0.0))); %!test %! assert (isequal (log1p (infsup (0.0, 1.164158665593125820e+09)), infsup (0.0, 2.087526448847221161e+01))); %!test %! assert (isequal (log1p (infsup (2.045368051078361511e+10, 6.649390526214926758e+11)), infsup (2.374142867936779666e+01, 2.722296122321039036e+01))); ## mpfi_log2 %!# special values %!test %! assert (isequal (log2 (infsup (0.0, +1.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (log2 (infsup (0.0, inf)), infsup (-inf, inf))); %!# regular values %!test %! assert (isequal (log2 (infsup (1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (log2 (infsup (7.112834182118892290e-01, 1.0)), infsup (-4.915035637690611248e-01, 0.0))); %!test %! assert (isequal (log2 (infsup (1.0, 1.164158665593125820e+09)), infsup (0.0, 3.011664055352508385e+01))); %!test %! assert (isequal (log2 (infsup (2.045368051078361511e+10, 6.649390526214926758e+11)), infsup (3.425164141927239569e+01, 3.927443115503601234e+01))); ## mpfi_log10 %!# special values %!test %! assert (isequal (log10 (infsup (0.0, 1.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (log10 (infsup (0.0, inf)), infsup (-inf, inf))); %!# regular values %!test %! assert (isequal (log10 (infsup (1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (log10 (infsup (6.245333006274822998e+10, 3.502953474593552856e+11)), infsup (1.079555560026529015e+01, 1.154443436915855159e+01))); %!test %! assert (isequal (log10 (infsup (7.112834182118892290e-01, 1.0)), infsup (-1.479573156702317926e-01, 0.0))); %!test %! assert (isequal (log10 (infsup (100.0, 1.164158665593125820e+09)), infsup (2.0, 9.066012175241336735e+00))); %!test %! assert (isequal (log10 (infsup (2.045368051078361511e+10, 6.649390526214926758e+11)), infsup (1.031077146792780930e+01, 1.182278184030581869e+01))); ## mpfi_mag %!# special values %!test %! assert (isequal (mag (infsup (-inf, -8.0)), inf)); %!test %! assert (isequal (mag (infsup (-inf, 0.0)), inf)); %!test %! assert (isequal (mag (infsup (-inf, 5.0)), inf)); %!test %! assert (isequal (mag (infsup (-inf, inf)), inf)); %!test %! assert (isequal (mag (infsup (-inf, 0.0)), inf)); %!test %! assert (isequal (mag (infsup (-8.0, 0.0)), +8)); %!test %! assert (isequal (mag (infsup (0.0, 0.0)), +0)); %!test %! assert (isequal (mag (infsup (0.0, 5.0)), +5)); %!test %! assert (isequal (mag (infsup (0.0, inf)), inf)); %!# regular values %!test %! assert (isequal (mag (infsup (-34.0, -17.0)), 34)); ## mpfi_mid %!# special values %!test %! assert (isequal (mid (infsup (-8.0, 0.0)), -4)); %!test %! assert (isequal (mid (infsup (0.0, 0.0)), +0)); %!test %! assert (isequal (mid (infsup (0.0, 5.0)), +2.5)); %!# regular values %!test %! assert (isequal (mid (infsup (-34.0, -17.0)), -2.550000000000000000e+01)); %!test %! assert (isequal (mid (infsup (-34.0, 17.0)), -8.5)); %!test %! assert (isequal (mid (infsup (0.0, 8.006399337547525000e+13)), 4.003199668773762500e+13)); %!test %! assert (isequal (mid (infsup (3.141592653589793116e+00, 3.141592653589793560e+00)), 3.141592653589793116e+00)); %!test %! assert (isequal (mid (infsup (-3.141592653589793560e+00, -3.141592653589793116e+00)), -3.141592653589793116e+00)); %!test %! assert (isequal (mid (infsup (-4.0, -9.999999999999986677e-01)), -2.499999999999999112e+00)); %!test %! assert (isequal (mid (infsup (-8.0, -9.999999999999977796e-01)), -4.499999999999999112e+00)); %!test %! assert (isequal (mid (infsup (-9.999999999999998890e-01, 2.0)), 0.5)); ## mpfi_mig %!# special values %!test %! assert (isequal (mig (infsup (-inf, -8.0)), 8)); %!test %! assert (isequal (mig (infsup (-inf, 0.0)), +0)); %!test %! assert (isequal (mig (infsup (-inf, 5.0)), +0)); %!test %! assert (isequal (mig (infsup (-inf, inf)), +0)); %!test %! assert (isequal (mig (infsup (-inf, 0.0)), +0)); %!test %! assert (isequal (mig (infsup (-8.0, 0.0)), +0)); %!test %! assert (isequal (mig (infsup (0.0, 0.0)), +0)); %!test %! assert (isequal (mig (infsup (0.0, 5.0)), +0)); %!test %! assert (isequal (mig (infsup (0.0, inf)), +0)); %!# regular values %!test %! assert (isequal (mig (infsup (-34.0, -17.0)), 17)); ## mpfi_mul %!# special values %!test %! assert (isequal (infsup (-inf, -7.0) .* infsup (-1.0, +8.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, -7.0), infsup (-1.0, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) .* infsup (+8.0, inf), infsup (-inf, 0.0))); %! assert (isequal (times (infsup (-inf, 0.0), infsup (+8.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, +8.0) .* infsup (0.0, +8.0), infsup (-inf, +64.0))); %! assert (isequal (times (infsup (-inf, +8.0), infsup (0.0, +8.0)), infsup (-inf, +64.0))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-inf, inf), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (0.0, +8.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, inf), infsup (0.0, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (-inf, -7.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (-inf, -7.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, +8.0) .* infsup (-7.0, 0.0), infsup (-56.0, 0.0))); %! assert (isequal (times (infsup (0.0, +8.0), infsup (-7.0, 0.0)), infsup (-56.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (0.0, +8.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (0.0, +8.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) .* infsup (0.0, +8.0), infsup (0.0, inf))); %! assert (isequal (times (infsup (0.0, inf), infsup (0.0, +8.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (+8.0, inf), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (+8.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (-inf, inf), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, +8.0) .* infsup (-7.0, +8.0), infsup (-56.0, +64.0))); %! assert (isequal (times (infsup (0.0, +8.0), infsup (-7.0, +8.0)), infsup (-56.0, +64.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) .* infsup (0.0, +8.0), infsup (0.0, inf))); %! assert (isequal (times (infsup (0.0, inf), infsup (0.0, +8.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-3.0, +7.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-3.0, +7.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!# regular values %!test %! assert (isequal (infsup (-1.300000000000000000e+01, -9.000000000000000000e+00) .* infsup (-4.000000000000000000e+00, -2.000000000000000000e+00), infsup (1.800000000000000000e+01, 5.200000000000000000e+01))); %! assert (isequal (times (infsup (-1.300000000000000000e+01, -9.000000000000000000e+00), infsup (-4.000000000000000000e+00, -2.000000000000000000e+00)), infsup (1.800000000000000000e+01, 5.200000000000000000e+01))); %!test %! assert (isequal (infsup (-1.300000000000000000e+01, -8.713145944805367193e-01) .* infsup (-4.000000000000000000e+00, -4.005481558786871954e-02), infsup (3.490034540093651244e-02, 5.200000000000000000e+01))); %! assert (isequal (times (infsup (-1.300000000000000000e+01, -8.713145944805367193e-01), infsup (-4.000000000000000000e+00, -4.005481558786871954e-02)), infsup (3.490034540093651244e-02, 5.200000000000000000e+01))); %!test %! assert (isequal (infsup (-8.844699037058322277e-01, -5.086643052155234157e-01) .* infsup (-3.468109146783053820e-01, -2.002700255759105596e-01), infsup (1.018702134150656358e-01, 3.067438163096523618e-01))); %! assert (isequal (times (infsup (-8.844699037058322277e-01, -5.086643052155234157e-01), infsup (-3.468109146783053820e-01, -2.002700255759105596e-01)), infsup (1.018702134150656358e-01, 3.067438163096523618e-01))); %!test %! assert (isequal (infsup (-5.500000000000000000e+01, -7.000000000000000000e+00) .* infsup (-1.000000000000000000e+00, 3.400000000000000000e+01), infsup (-1.870000000000000000e+03, 5.500000000000000000e+01))); %! assert (isequal (times (infsup (-5.500000000000000000e+01, -7.000000000000000000e+00), infsup (-1.000000000000000000e+00, 3.400000000000000000e+01)), infsup (-1.870000000000000000e+03, 5.500000000000000000e+01))); %!test %! assert (isequal (infsup (-8.765250686386196755e-01, -1.992187500000000000e-01) .* infsup (-1.000000000000000000e+00, 1.466715900391711624e+00), infsup (-1.285613255264199895e+00, 8.765250686386196755e-01))); %! assert (isequal (times (infsup (-8.765250686386196755e-01, -1.992187500000000000e-01), infsup (-1.000000000000000000e+00, 1.466715900391711624e+00)), infsup (-1.285613255264199895e+00, 8.765250686386196755e-01))); %!test %! assert (isequal (infsup (-2.870801872541201760e+01, -1.992187500000000000e-01) .* infsup (-1.393992103870862920e+00, 1.000000000000000000e+00), infsup (-2.870801872541201760e+01, 4.001875142100123384e+01))); %! assert (isequal (times (infsup (-2.870801872541201760e+01, -1.992187500000000000e-01), infsup (-1.393992103870862920e+00, 1.000000000000000000e+00)), infsup (-2.870801872541201760e+01, 4.001875142100123384e+01))); %!test %! assert (isequal (infsup (-2.870801872541201760e+01, -1.992187500000000000e-01) .* infsup (-1.393992103870862920e+00, 3.071280064782253660e+01), infsup (-8.817036561075358350e+02, 4.001875142100123384e+01))); %! assert (isequal (times (infsup (-2.870801872541201760e+01, -1.992187500000000000e-01), infsup (-1.393992103870862920e+00, 3.071280064782253660e+01)), infsup (-8.817036561075358350e+02, 4.001875142100123384e+01))); %!test %! assert (isequal (infsup (-7.818749353000000000e+10, -1.000000000000000000e+00) .* infsup (1.000000000000000000e+00, 1.600000000000000000e+01), infsup (-1.250999896480000000e+12, -1.000000000000000000e+00))); %! assert (isequal (times (infsup (-7.818749353000000000e+10, -1.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.600000000000000000e+01)), infsup (-1.250999896480000000e+12, -1.000000000000000000e+00))); %!test %! assert (isequal (infsup (-7.139662043699290805e-01, -5.000000000000000000e-01) .* infsup (2.000000000000000000e+00, 2.046605023486218755e+00), infsup (-1.461206820462885192e+00, -1.000000000000000000e+00))); %! assert (isequal (times (infsup (-7.139662043699290805e-01, -5.000000000000000000e-01), infsup (2.000000000000000000e+00, 2.046605023486218755e+00)), infsup (-1.461206820462885192e+00, -1.000000000000000000e+00))); %!test %! assert (isequal (infsup (-4.000000000000000000e+00, -4.018386156188277769e-02) .* infsup (7.388390272892536581e-01, 4.000000000000000000e+00), infsup (-1.600000000000000000e+01, -2.968940518910749907e-02))); %! assert (isequal (times (infsup (-4.000000000000000000e+00, -4.018386156188277769e-02), infsup (7.388390272892536581e-01, 4.000000000000000000e+00)), infsup (-1.600000000000000000e+01, -2.968940518910749907e-02))); %!test %! assert (isequal (infsup (-7.139662043699290805e-01, -4.018386156188277769e-02) .* infsup (7.388390272892536581e-01, 2.046605023486218755e+00), infsup (-1.461206820462885192e+00, -2.968940518910749907e-02))); %! assert (isequal (times (infsup (-7.139662043699290805e-01, -4.018386156188277769e-02), infsup (7.388390272892536581e-01, 2.046605023486218755e+00)), infsup (-1.461206820462885192e+00, -2.968940518910749907e-02))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 1.700000000000000000e+01) .* infsup (-7.000000000000000000e+00, -4.000000000000000000e+00), infsup (-1.190000000000000000e+02, 7.000000000000000000e+00))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, 1.700000000000000000e+01), infsup (-7.000000000000000000e+00, -4.000000000000000000e+00)), infsup (-1.190000000000000000e+02, 7.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 9.244364494737422611e-01) .* infsup (-2.231538914439750165e+00, -6.250000000000000000e-02), infsup (-2.062915910927172192e+00, 2.231538914439750165e+00))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, 9.244364494737422611e-01), infsup (-2.231538914439750165e+00, -6.250000000000000000e-02)), infsup (-2.062915910927172192e+00, 2.231538914439750165e+00))); %!test %! assert (isequal (infsup (-2.850258554165375813e+02, 1.000000000000000000e+00) .* infsup (-2.231538914439750165e+00, -6.250000000000000000e-02), infsup (-2.231538914439750165e+00, 6.360462879834815340e+02))); %! assert (isequal (times (infsup (-2.850258554165375813e+02, 1.000000000000000000e+00), infsup (-2.231538914439750165e+00, -6.250000000000000000e-02)), infsup (-2.231538914439750165e+00, 6.360462879834815340e+02))); %!test %! assert (isequal (infsup (-9.244364494737422611e-01, 2.850258554165375813e+02) .* infsup (-2.231538914439750165e+00, -6.250000000000000000e-02), infsup (-6.360462879834815340e+02, 2.062915910927172192e+00))); %! assert (isequal (times (infsup (-9.244364494737422611e-01, 2.850258554165375813e+02), infsup (-2.231538914439750165e+00, -6.250000000000000000e-02)), infsup (-6.360462879834815340e+02, 2.062915910927172192e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 1.600000000000000000e+01) .* infsup (-2.000000000000000000e+00, 3.000000000000000000e+00), infsup (-3.200000000000000000e+01, 4.800000000000000000e+01))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, 1.600000000000000000e+01), infsup (-2.000000000000000000e+00, 3.000000000000000000e+00)), infsup (-3.200000000000000000e+01, 4.800000000000000000e+01))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 1.784754876621973685e-01) .* infsup (-1.513663759394287545e-01, 3.906250000000000000e-03), infsup (-2.701518776144904571e-02, 1.513663759394287545e-01))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, 1.784754876621973685e-01), infsup (-1.513663759394287545e-01, 3.906250000000000000e-03)), infsup (-2.701518776144904571e-02, 1.513663759394287545e-01))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 4.301929436060967227e-01) .* infsup (-6.250000000000000000e-02, 1.555662705168874727e+00), infsup (-1.555662705168874727e+00, 6.692351183948216375e-01))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, 4.301929436060967227e-01), infsup (-6.250000000000000000e-02, 1.555662705168874727e+00)), infsup (-1.555662705168874727e+00, 6.692351183948216375e-01))); %!test %! assert (isequal (infsup (-1.085456484137515831e+00, 3.906250000000000000e-03) .* infsup (-2.468696855614667118e+00, 5.137992619868292365e-01), infsup (-5.577067404686740781e-01, 2.679663009296837206e+00))); %! assert (isequal (times (infsup (-1.085456484137515831e+00, 3.906250000000000000e-03), infsup (-2.468696855614667118e+00, 5.137992619868292365e-01)), infsup (-5.577067404686740781e-01, 2.679663009296837206e+00))); %!test %! assert (isequal (infsup (-7.000000000000000000e+00, 7.000000000000000000e+00) .* infsup (1.900000000000000000e+01, 3.600000000000000000e+01), infsup (-2.520000000000000000e+02, 2.520000000000000000e+02))); %! assert (isequal (times (infsup (-7.000000000000000000e+00, 7.000000000000000000e+00), infsup (1.900000000000000000e+01, 3.600000000000000000e+01)), infsup (-2.520000000000000000e+02, 2.520000000000000000e+02))); %!test %! assert (isequal (infsup (-6.563586907006095927e-01, 1.600000000000000000e+01) .* infsup (2.000000000000000000e+00, 2.201187625175617946e+00), infsup (-1.444768627646652925e+00, 3.521900200280988713e+01))); %! assert (isequal (times (infsup (-6.563586907006095927e-01, 1.600000000000000000e+01), infsup (2.000000000000000000e+00, 2.201187625175617946e+00)), infsup (-1.444768627646652925e+00, 3.521900200280988713e+01))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 1.565098315200050605e+00) .* infsup (1.110223024625156540e-16, 1.266329204122035978e+00), infsup (-1.266329204122035978e+00, 1.981929703860019654e+00))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, 1.565098315200050605e+00), infsup (1.110223024625156540e-16, 1.266329204122035978e+00)), infsup (-1.266329204122035978e+00, 1.981929703860019654e+00))); %!test %! assert (isequal (infsup (-1.765834301520441407e+00, 1.557480558189380915e+00) .* infsup (2.000000000000000000e+00, 3.269798648808647012e+00), infsup (-5.773922613131500903e+00, 5.092647824713375293e+00))); %! assert (isequal (times (infsup (-1.765834301520441407e+00, 1.557480558189380915e+00), infsup (2.000000000000000000e+00, 3.269798648808647012e+00)), infsup (-5.773922613131500903e+00, 5.092647824713375293e+00))); %!test %! assert (isequal (infsup (1.200000000000000000e+01, 4.500000000000000000e+01) .* infsup (-1.657000000000000000e+03, -2.290000000000000000e+02), infsup (-7.456500000000000000e+04, -2.748000000000000000e+03))); %! assert (isequal (times (infsup (1.200000000000000000e+01, 4.500000000000000000e+01), infsup (-1.657000000000000000e+03, -2.290000000000000000e+02)), infsup (-7.456500000000000000e+04, -2.748000000000000000e+03))); %!test %! assert (isequal (infsup (1.200000000000000000e+01, 1.120812365223437610e+03) .* infsup (-2.525625077842174805e+12, -2.290000000000000000e+02), infsup (-2.830751817163917000e+15, -2.748000000000000000e+03))); %! assert (isequal (times (infsup (1.200000000000000000e+01, 1.120812365223437610e+03), infsup (-2.525625077842174805e+12, -2.290000000000000000e+02)), infsup (-2.830751817163917000e+15, -2.748000000000000000e+03))); %!test %! assert (isequal (infsup (1.122244233241161915e+01, 4.500000000000000000e+01) .* infsup (-1.657000000000000000e+03, -1.027908085677155725e+01), infsup (-7.456500000000000000e+04, -1.153563921453150130e+02))); %! assert (isequal (times (infsup (1.122244233241161915e+01, 4.500000000000000000e+01), infsup (-1.657000000000000000e+03, -1.027908085677155725e+01)), infsup (-7.456500000000000000e+04, -1.153563921453150130e+02))); %!test %! assert (isequal (infsup (9.395050761055534494e-01, 1.073814051130034741e+01) .* infsup (-5.795963639761951391e+00, -9.930631723906067562e-03), infsup (-6.223787196215162965e+01, -9.329878913544592187e-03))); %! assert (isequal (times (infsup (9.395050761055534494e-01, 1.073814051130034741e+01), infsup (-5.795963639761951391e+00, -9.930631723906067562e-03)), infsup (-6.223787196215162965e+01, -9.329878913544592187e-03))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 1.200000000000000000e+01) .* infsup (-2.290000000000000000e+02, 1.000000000000000000e+00), infsup (-2.748000000000000000e+03, 1.200000000000000000e+01))); %! assert (isequal (times (infsup (1.000000000000000000e+00, 1.200000000000000000e+01), infsup (-2.290000000000000000e+02, 1.000000000000000000e+00)), infsup (-2.748000000000000000e+03, 1.200000000000000000e+01))); %!test %! assert (isequal (infsup (6.461498003318411065e-14, 1.922432961588749656e+00) .* infsup (-6.663688717732502154e-01, 4.294967296000000000e+09), infsup (-1.281049483673603273e+00, 8.256786698776103973e+09))); %! assert (isequal (times (infsup (6.461498003318411065e-14, 1.922432961588749656e+00), infsup (-6.663688717732502154e-01, 4.294967296000000000e+09)), infsup (-1.281049483673603273e+00, 8.256786698776103973e+09))); %!test %! assert (isequal (infsup (3.000000000000000000e+00, 7.171544261033011125e+00) .* infsup (-1.000000000000000000e+00, 6.663688717732502154e-01), infsup (-7.171544261033011125e+00, 4.778893858096495251e+00))); %! assert (isequal (times (infsup (3.000000000000000000e+00, 7.171544261033011125e+00), infsup (-1.000000000000000000e+00, 6.663688717732502154e-01)), infsup (-7.171544261033011125e+00, 4.778893858096495251e+00))); %!test %! assert (isequal (infsup (1.875000000000000000e-01, 6.663688717732502154e-01) .* infsup (-1.922432961588749656e+00, 7.171544261033011125e+00), infsup (-1.281049483673603273e+00, 4.778893858096495251e+00))); %! assert (isequal (times (infsup (1.875000000000000000e-01, 6.663688717732502154e-01), infsup (-1.922432961588749656e+00, 7.171544261033011125e+00)), infsup (-1.281049483673603273e+00, 4.778893858096495251e+00))); %!test %! assert (isequal (infsup (3.000000000000000000e+00, 7.000000000000000000e+00) .* infsup (5.000000000000000000e+00, 1.100000000000000000e+01), infsup (1.500000000000000000e+01, 7.700000000000000000e+01))); %! assert (isequal (times (infsup (3.000000000000000000e+00, 7.000000000000000000e+00), infsup (5.000000000000000000e+00, 1.100000000000000000e+01)), infsup (1.500000000000000000e+01, 7.700000000000000000e+01))); %!test %! assert (isequal (infsup (2.282104623262744436e+00, 7.000000000000000000e+00) .* infsup (3.444510241015958041e+00, 1.100000000000000000e+01), infsup (7.860732745898387108e+00, 7.700000000000000000e+01))); %! assert (isequal (times (infsup (2.282104623262744436e+00, 7.000000000000000000e+00), infsup (3.444510241015958041e+00, 1.100000000000000000e+01)), infsup (7.860732745898387108e+00, 7.700000000000000000e+01))); %!test %! assert (isequal (infsup (3.000000000000000000e+00, 3.444510241015958041e+00) .* infsup (1.490116119384765625e-07, 2.282104623262744436e+00), infsup (4.470348358154296875e-07, 7.860732745898387996e+00))); %! assert (isequal (times (infsup (3.000000000000000000e+00, 3.444510241015958041e+00), infsup (1.490116119384765625e-07, 2.282104623262744436e+00)), infsup (4.470348358154296875e-07, 7.860732745898387996e+00))); %!test %! assert (isequal (infsup (1.916281209173078537e-01, 2.282104623262744436e+00) .* infsup (7.650281798863103333e-01, 2.619105358145846552e+00), infsup (1.466009125604018082e-01, 5.977072446636863212e+00))); %! assert (isequal (times (infsup (1.916281209173078537e-01, 2.282104623262744436e+00), infsup (7.650281798863103333e-01, 2.619105358145846552e+00)), infsup (1.466009125604018082e-01, 5.977072446636863212e+00))); ## mpfi_mul_d %!# special values %!test %! assert (isequal (infsup (-inf, -7.0) .* infsup (-2.300000000000000000e+01, -2.300000000000000000e+01), infsup (1.610000000000000000e+02, inf))); %! assert (isequal (times (infsup (-inf, -7.0), infsup (-2.300000000000000000e+01, -2.300000000000000000e+01)), infsup (1.610000000000000000e+02, inf))); %!test %! assert (isequal (infsup (-inf, -7.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-inf, -7.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-inf, -7.0) .* infsup (4.000000000000000286e-17, 4.000000000000000286e-17), infsup (-inf, -2.800000000000000139e-16))); %! assert (isequal (times (infsup (-inf, -7.0), infsup (4.000000000000000286e-17, 4.000000000000000286e-17)), infsup (-inf, -2.800000000000000139e-16))); %!test %! assert (isequal (infsup (-inf, 0.0) .* infsup (-8.000000000000000572e-17, -8.000000000000000572e-17), infsup (0.0, inf))); %! assert (isequal (times (infsup (-inf, 0.0), infsup (-8.000000000000000572e-17, -8.000000000000000572e-17)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-inf, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-inf, 0.0) .* infsup (8.000000000000000572e-17, 8.000000000000000572e-17), infsup (-inf, 0.0))); %! assert (isequal (times (infsup (-inf, 0.0), infsup (8.000000000000000572e-17, 8.000000000000000572e-17)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, 8.0) .* infsup (-1.600000000000000000e+18, -1.600000000000000000e+18), infsup (-1.280000000000000000e+19, inf))); %! assert (isequal (times (infsup (-inf, 8.0), infsup (-1.600000000000000000e+18, -1.600000000000000000e+18)), infsup (-1.280000000000000000e+19, inf))); %!test %! assert (isequal (infsup (-inf, 8.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-inf, 8.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-inf, 8.0) .* infsup (1.600000000000000000e+18, 1.600000000000000000e+18), infsup (-inf, 1.280000000000000000e+19))); %! assert (isequal (times (infsup (-inf, 8.0), infsup (1.600000000000000000e+18, 1.600000000000000000e+18)), infsup (-inf, 1.280000000000000000e+19))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (-1.600000000000000114e-16, -1.600000000000000114e-16), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, inf), infsup (-1.600000000000000114e-16, -1.600000000000000114e-16)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (0.0e-17, 0.0e-17), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-inf, inf), infsup (0.0e-17, 0.0e-17)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (1.600000000000000114e-16, 1.600000000000000114e-16), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, inf), infsup (1.600000000000000114e-16, 1.600000000000000114e-16)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (-1.000000000000000072e-17, -1.000000000000000072e-17), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (-1.000000000000000072e-17, -1.000000000000000072e-17)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (1.000000000000000072e-17, 1.000000000000000072e-17), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (1.000000000000000072e-17, 1.000000000000000072e-17)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 7.0) .* infsup (-3.000000000000000061e-17, -3.000000000000000061e-17), infsup (-2.100000000000000104e-16, 0.0))); %! assert (isequal (times (infsup (0.0, 7.0), infsup (-3.000000000000000061e-17, -3.000000000000000061e-17)), infsup (-2.100000000000000104e-16, 0.0))); %!test %! assert (isequal (infsup (0.0, 8.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 8.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 9.0) .* infsup (4.800000000000000097e-16, 4.800000000000000097e-16), infsup (0.0, 4.320000000000000777e-15))); %! assert (isequal (times (infsup (0.0, 9.0), infsup (4.800000000000000097e-16, 4.800000000000000097e-16)), infsup (0.0, 4.320000000000000777e-15))); %!test %! assert (isequal (infsup (0.0, inf) .* infsup (-7.000000000000000347e-17, -7.000000000000000347e-17), infsup (-inf, 0.0))); %! assert (isequal (times (infsup (0.0, inf), infsup (-7.000000000000000347e-17, -7.000000000000000347e-17)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, inf), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) .* infsup (6.999999999999999114e-17, 6.999999999999999114e-17), infsup (0.0, inf))); %! assert (isequal (times (infsup (0.0, inf), infsup (6.999999999999999114e-17, 6.999999999999999114e-17)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (infsup (-2.421182400000000000e+07, -2.823443157514333837e-22) .* infsup (-1.5, -1.5), infsup (4.235164736271500755e-22, 3.631773600000000000e+07))); %! assert (isequal (times (infsup (-2.421182400000000000e+07, -2.823443157514333837e-22), infsup (-1.5, -1.5)), infsup (4.235164736271500755e-22, 3.631773600000000000e+07))); %!test %! assert (isequal (infsup (-3.002399751580330000e+15, 1.250419591445233750e+128) .* infsup (-1.5, -1.5), infsup (-1.875629387167850624e+128, 4.503599627370495000e+15))); %! assert (isequal (times (infsup (-3.002399751580330000e+15, 1.250419591445233750e+128), infsup (-1.5, -1.5)), infsup (-1.875629387167850624e+128, 4.503599627370495000e+15))); %!test %! assert (isequal (infsup (4.503599627370512000e+15, 1.122162325663649028e+211) .* infsup (-2.125, -2.125), infsup (-2.384594942035254185e+211, -9.570149208162338000e+15))); %! assert (isequal (times (infsup (4.503599627370512000e+15, 1.122162325663649028e+211), infsup (-2.125, -2.125)), infsup (-2.384594942035254185e+211, -9.570149208162338000e+15))); %!test %! assert (isequal (infsup (-2.421182400000000000e+07, -2.823443157514333837e-22) .* infsup (1.5, 1.5), infsup (-3.631773600000000000e+07, -4.235164736271500755e-22))); %! assert (isequal (times (infsup (-2.421182400000000000e+07, -2.823443157514333837e-22), infsup (1.5, 1.5)), infsup (-3.631773600000000000e+07, -4.235164736271500755e-22))); %!test %! assert (isequal (infsup (-3.002399751580330000e+15, 1.250419591445233750e+128) .* infsup (1.5, 1.5), infsup (-4.503599627370495000e+15, 1.875629387167850624e+128))); %! assert (isequal (times (infsup (-3.002399751580330000e+15, 1.250419591445233750e+128), infsup (1.5, 1.5)), infsup (-4.503599627370495000e+15, 1.875629387167850624e+128))); %!test %! assert (isequal (infsup (4.503599627370512000e+15, 1.122162325663649028e+211) .* infsup (2.125, 2.125), infsup (9.570149208162338000e+15, 2.384594942035254185e+211))); %! assert (isequal (times (infsup (4.503599627370512000e+15, 1.122162325663649028e+211), infsup (2.125, 2.125)), infsup (9.570149208162338000e+15, 2.384594942035254185e+211))); %!test %! assert (isequal (infsup (-1.663823876104126464e+18, -4.503599627370497000e+15) .* infsup (-1.5, -1.5), infsup (6.755399441055745000e+15, 2.495735814156189696e+18))); %! assert (isequal (times (infsup (-1.663823876104126464e+18, -4.503599627370497000e+15), infsup (-1.5, -1.5)), infsup (6.755399441055745000e+15, 2.495735814156189696e+18))); %!test %! assert (isequal (infsup (-3.002399751580330000e+15, 4.503599627370497000e+15) .* infsup (-1.5, -1.5), infsup (-6.755399441055746000e+15, 4.503599627370495000e+15))); %! assert (isequal (times (infsup (-3.002399751580330000e+15, 4.503599627370497000e+15), infsup (-1.5, -1.5)), infsup (-6.755399441055746000e+15, 4.503599627370495000e+15))); %!test %! assert (isequal (infsup (4.503599627370512000e+15, 4.803839602528529000e+15) .* infsup (-2.125, -2.125), infsup (-1.020815915537312600e+16, -9.570149208162338000e+15))); %! assert (isequal (times (infsup (4.503599627370512000e+15, 4.803839602528529000e+15), infsup (-2.125, -2.125)), infsup (-1.020815915537312600e+16, -9.570149208162338000e+15))); %!test %! assert (isequal (infsup (-4.503599627370497000e+15, -2.823443157514333837e-22) .* infsup (1.5, 1.5), infsup (-6.755399441055746000e+15, -4.235164736271500755e-22))); %! assert (isequal (times (infsup (-4.503599627370497000e+15, -2.823443157514333837e-22), infsup (1.5, 1.5)), infsup (-6.755399441055746000e+15, -4.235164736271500755e-22))); %!test %! assert (isequal (infsup (-3.002399751580331000e+15, 1.250419591445233750e+128) .* infsup (1.5, 1.5), infsup (-4.503599627370497000e+15, 1.875629387167850624e+128))); %! assert (isequal (times (infsup (-3.002399751580331000e+15, 1.250419591445233750e+128), infsup (1.5, 1.5)), infsup (-4.503599627370497000e+15, 1.875629387167850624e+128))); %!test %! assert (isequal (infsup (4.503599627370497000e+15, 1.122162325663649028e+211) .* infsup (2.125, 2.125), infsup (9.570149208162306000e+15, 2.384594942035254185e+211))); %! assert (isequal (times (infsup (4.503599627370497000e+15, 1.122162325663649028e+211), infsup (2.125, 2.125)), infsup (9.570149208162306000e+15, 2.384594942035254185e+211))); %!test %! assert (isequal (infsup (-4.909806652584305000e+15, -2.823443157514333837e-22) .* infsup (-1.5, -1.5), infsup (4.235164736271500755e-22, 7.364709978876458000e+15))); %! assert (isequal (times (infsup (-4.909806652584305000e+15, -2.823443157514333837e-22), infsup (-1.5, -1.5)), infsup (4.235164736271500755e-22, 7.364709978876458000e+15))); %!test %! assert (isequal (infsup (-4.503599627370497000e+15, 1.250419591445233750e+128) .* infsup (-1.5, -1.5), infsup (-1.875629387167850624e+128, 6.755399441055746000e+15))); %! assert (isequal (times (infsup (-4.503599627370497000e+15, 1.250419591445233750e+128), infsup (-1.5, -1.5)), infsup (-1.875629387167850624e+128, 6.755399441055746000e+15))); %!test %! assert (isequal (infsup (4.503599627370497000e+15, 1.122162325663649028e+211) .* infsup (-2.125, -2.125), infsup (-2.384594942035254185e+211, -9.570149208162306000e+15))); %! assert (isequal (times (infsup (4.503599627370497000e+15, 1.122162325663649028e+211), infsup (-2.125, -2.125)), infsup (-2.384594942035254185e+211, -9.570149208162306000e+15))); %!test %! assert (isequal (infsup (-2.421182400000000000e+07, -7.058607893785835532e-22) .* infsup (1.5, 1.5), infsup (-3.631773600000000000e+07, -1.058791184067875236e-21))); %! assert (isequal (times (infsup (-2.421182400000000000e+07, -7.058607893785835532e-22), infsup (1.5, 1.5)), infsup (-3.631773600000000000e+07, -1.058791184067875236e-21))); %!test %! assert (isequal (infsup (-3.002399751580330000e+15, 4.909806652584305000e+15) .* infsup (1.5, 1.5), infsup (-4.503599627370495000e+15, 7.364709978876458000e+15))); %! assert (isequal (times (infsup (-3.002399751580330000e+15, 4.909806652584305000e+15), infsup (1.5, 1.5)), infsup (-4.503599627370495000e+15, 7.364709978876458000e+15))); %!test %! assert (isequal (infsup (4.503599627370512000e+15, 6.905519428634761000e+15) .* infsup (2.125, 2.125), infsup (9.570149208162338000e+15, 1.467422878584886800e+16))); %! assert (isequal (times (infsup (4.503599627370512000e+15, 6.905519428634761000e+15), infsup (2.125, 2.125)), infsup (9.570149208162338000e+15, 1.467422878584886800e+16))); %!test %! assert (isequal (infsup (-4.909806652584305000e+15, -4.503599627370497000e+15) .* infsup (-1.5, -1.5), infsup (6.755399441055745000e+15, 7.364709978876458000e+15))); %! assert (isequal (times (infsup (-4.909806652584305000e+15, -4.503599627370497000e+15), infsup (-1.5, -1.5)), infsup (6.755399441055745000e+15, 7.364709978876458000e+15))); %!test %! assert (isequal (infsup (-4.503599627370497000e+15, 4.503599627370497000e+15) .* infsup (-1.5, -1.5), infsup (-6.755399441055746000e+15, 6.755399441055746000e+15))); %! assert (isequal (times (infsup (-4.503599627370497000e+15, 4.503599627370497000e+15), infsup (-1.5, -1.5)), infsup (-6.755399441055746000e+15, 6.755399441055746000e+15))); %!test %! assert (isequal (infsup (4.503599627370497000e+15, 4.803839602528529000e+15) .* infsup (-2.125, -2.125), infsup (-1.020815915537312600e+16, -9.570149208162306000e+15))); %! assert (isequal (times (infsup (4.503599627370497000e+15, 4.803839602528529000e+15), infsup (-2.125, -2.125)), infsup (-1.020815915537312600e+16, -9.570149208162306000e+15))); %!test %! assert (isequal (infsup (-4.503599627370497000e+15, -7.058607893785835532e-22) .* infsup (1.5, 1.5), infsup (-6.755399441055746000e+15, -1.058791184067875236e-21))); %! assert (isequal (times (infsup (-4.503599627370497000e+15, -7.058607893785835532e-22), infsup (1.5, 1.5)), infsup (-6.755399441055746000e+15, -1.058791184067875236e-21))); %!test %! assert (isequal (infsup (-3.002399751580331000e+15, 4.909806652584305000e+15) .* infsup (1.5, 1.5), infsup (-4.503599627370497000e+15, 7.364709978876458000e+15))); %! assert (isequal (times (infsup (-3.002399751580331000e+15, 4.909806652584305000e+15), infsup (1.5, 1.5)), infsup (-4.503599627370497000e+15, 7.364709978876458000e+15))); %!test %! assert (isequal (infsup (4.503599627370497000e+15, 6.905519428634761000e+15) .* infsup (2.125, 2.125), infsup (9.570149208162306000e+15, 1.467422878584886800e+16))); %! assert (isequal (times (infsup (4.503599627370497000e+15, 6.905519428634761000e+15), infsup (2.125, 2.125)), infsup (9.570149208162306000e+15, 1.467422878584886800e+16))); ## mpfi_neg %!# special values %!test %! assert (isequal (-infsup (-inf, -7.0), infsup (+7.0, inf))); %! assert (isequal (uminus (infsup (-inf, -7.0)), infsup (+7.0, inf))); %!test %! assert (isequal (-infsup (-inf, 0.0), infsup (0.0, inf))); %! assert (isequal (uminus (infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (-infsup (-inf, +8.0), infsup (-8.0, inf))); %! assert (isequal (uminus (infsup (-inf, +8.0)), infsup (-8.0, inf))); %!test %! assert (isequal (-infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (uminus (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (-infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (uminus (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (-infsup (0.0, +8.0), infsup (-8.0, 0.0))); %! assert (isequal (uminus (infsup (0.0, +8.0)), infsup (-8.0, 0.0))); %!test %! assert (isequal (-infsup (0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (uminus (infsup (0.0, inf)), infsup (-inf, 0.0))); %!# regular values %!test %! assert (isequal (-infsup (7.456540443420410156e+04, 7.456540467834472656e+04), infsup (-7.456540467834472656e+04, -7.456540443420410156e+04))); %! assert (isequal (uminus (infsup (7.456540443420410156e+04, 7.456540467834472656e+04)), infsup (-7.456540467834472656e+04, -7.456540443420410156e+04))); ## mpfi_put_d %!# special values %!test %! assert (isequal (union (infsup (0.0, 0.0), infsup (-8.0, -8.0)), infsup (-8.0, 0.0))); %!test %! assert (isequal (union (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (union (infsup (+5.0, +5.0), infsup (0.0, 0.0)), infsup (0.0, +5.0))); ## mpfi_sec %!# special values %!test %! assert (isequal (sec (infsup (-inf, -7.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-inf, 8.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-8.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-3.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-1.0, 0.0)), infsup (1.0, 1.850815717680925676e+00))); %!test %! assert (isequal (sec (infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (sec (infsup (0.0, +1.0)), infsup (1.0, 1.850815717680925676e+00))); %!test %! assert (isequal (sec (infsup (0.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (0.0, 8.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (0.0, inf)), infsup (-inf, inf))); %!# regular values %!test %! assert (isequal (sec (infsup (-6.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-6.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-6.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-6.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-6.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-6.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-6.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-6.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-6.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-6.0, -2.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-6.0, -3.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-6.0, -4.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-6.0, -5.0)), infsup (1.041481926595107632e+00, 3.525320085816088689e+00))); %!test %! assert (isequal (sec (infsup (-6.0, -6.0)), infsup (1.041481926595107632e+00, 1.041481926595107854e+00))); %!test %! assert (isequal (sec (infsup (-5.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-5.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-5.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-5.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-5.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-5.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-5.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-5.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-5.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-5.0, -2.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-5.0, -3.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-5.0, -4.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-5.0, -5.0)), infsup (3.525320085816088245e+00, 3.525320085816088689e+00))); %!test %! assert (isequal (sec (infsup (-4.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-4.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-4.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-4.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-4.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-4.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-4.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-4.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-4.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-4.0, -2.0)), infsup (-2.402997961722381337e+00, -1.0))); %!test %! assert (isequal (sec (infsup (-4.0, -3.0)), infsup (-1.529885656466397625e+00, -1.0))); %!test %! assert (isequal (sec (infsup (-4.0, -4.0)), infsup (-1.529885656466397625e+00, -1.529885656466397403e+00))); %!test %! assert (isequal (sec (infsup (-3.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-3.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-3.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-3.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-3.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-3.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-3.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-3.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-3.0, -2.0)), infsup (-2.402997961722381337e+00, -1.010108665907993641e+00))); %!test %! assert (isequal (sec (infsup (-3.0, -3.0)), infsup (-1.010108665907993863e+00, -1.010108665907993641e+00))); %!test %! assert (isequal (sec (infsup (-2.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-2.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-2.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-2.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-2.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-2.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-2.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-2.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-2.0, -2.0)), infsup (-2.402997961722381337e+00, -2.402997961722380893e+00))); %!test %! assert (isequal (sec (infsup (-1.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-1.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-1.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-1.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-1.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-1.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (-1.0, 1.0)), infsup (1.0, 1.850815717680925676e+00))); %!test %! assert (isequal (sec (infsup (-1.0, 0.0)), infsup (1.0, 1.850815717680925676e+00))); %!test %! assert (isequal (sec (infsup (-1.0, -1.0)), infsup (1.850815717680925454e+00, 1.850815717680925676e+00))); %!test %! assert (isequal (sec (infsup (1.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (1.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (1.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (1.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (1.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (1.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (1.0, 1.0)), infsup (1.850815717680925454e+00, 1.850815717680925676e+00))); %!test %! assert (isequal (sec (infsup (2.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (2.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (2.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (2.0, 4.0)), infsup (-2.402997961722381337e+00, -1.0))); %!test %! assert (isequal (sec (infsup (2.0, 3.0)), infsup (-2.402997961722381337e+00, -1.010108665907993641e+00))); %!test %! assert (isequal (sec (infsup (2.0, 2.0)), infsup (-2.402997961722381337e+00, -2.402997961722380893e+00))); %!test %! assert (isequal (sec (infsup (3.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (3.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (3.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (3.0, 4.0)), infsup (-1.529885656466397625e+00, -1.0))); %!test %! assert (isequal (sec (infsup (3.0, 3.0)), infsup (-1.010108665907993863e+00, -1.010108665907993641e+00))); %!test %! assert (isequal (sec (infsup (4.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (4.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (4.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (sec (infsup (4.0, 4.0)), infsup (-1.529885656466397625e+00, -1.529885656466397403e+00))); %!test %! assert (isequal (sec (infsup (5.0, 7.0)), infsup (1.0, 3.525320085816088689e+00))); %!test %! assert (isequal (sec (infsup (5.0, 6.0)), infsup (1.041481926595107632e+00, 3.525320085816088689e+00))); %!test %! assert (isequal (sec (infsup (5.0, 5.0)), infsup (3.525320085816088245e+00, 3.525320085816088689e+00))); %!test %! assert (isequal (sec (infsup (6.0, 7.0)), infsup (1.0, 1.326431900473705072e+00))); %!test %! assert (isequal (sec (infsup (6.0, 6.0)), infsup (1.041481926595107632e+00, 1.041481926595107854e+00))); %!test %! assert (isequal (sec (infsup (7.0, 7.0)), infsup (1.326431900473704850e+00, 1.326431900473705072e+00))); ## mpfi_sech %!# special values %!test %! assert (isequal (sech (infsup (-inf, -7.0)), infsup (0.0, 1.823762414598208018e-03))); %!test %! assert (isequal (sech (infsup (-inf, 0.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (sech (infsup (-inf, +8.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (sech (infsup (-inf, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (sech (infsup (-1.0, 0.0)), infsup (6.480542736638853496e-01, 1.0))); %!test %! assert (isequal (sech (infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (sech (infsup (0.0, +1.0)), infsup (6.480542736638853496e-01, 1.0))); %!test %! assert (isequal (sech (infsup (0.0, +8.0)), infsup (6.709251803023412583e-04, 1.0))); %!test %! assert (isequal (sech (infsup (0.0, inf)), infsup (0.0, 1.0))); %!# regular values %!test %! assert (isequal (sech (infsup (-0.125, 0.0)), infsup (9.922380414751257316e-01, 1.0))); %!test %! assert (isequal (sech (infsup (0.0, 5.000000000000001110e-01)), infsup (8.868188839700738013e-01, 1.0))); %!test %! assert (isequal (sech (infsup (-4.5, -0.625)), infsup (2.221525149664967461e-02, 8.321172681599560139e-01))); %!test %! assert (isequal (sech (infsup (1.0, 3.0)), infsup (9.932792741943320680e-02, 6.480542736638854606e-01))); %!test %! assert (isequal (sech (infsup (17.0, 7.090895657128239691e+02)), infsup (2.225073858507384681e-308, 8.279875437570320428e-08))); ## mpfi_sin %!# special values %!test %! assert (isequal (sin (infsup (-inf, -7.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-inf, 0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-inf, +8.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-inf, inf)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-1.0, 0.0)), infsup (-8.414709848078966159e-01, 0.0))); %!test %! assert (isequal (sin (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (sin (infsup (0.0, +1.0)), infsup (0.0, 8.414709848078966159e-01))); %!test %! assert (isequal (sin (infsup (0.0, +8.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (0.0, inf)), infsup (-1.0, 1.0))); %!# regular values %!test %! assert (isequal (sin (infsup (0.125, 17.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (1.570796326794896558e+00, 1.570796326794896780e+00)), infsup (9.999999999999998890e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-2.0, -0.5)), infsup (-1.0, -4.794255386042029499e-01))); %!test %! assert (isequal (sin (infsup (-4.5, 0.625)), infsup (-1.0, 9.775301176650971202e-01))); %!test %! assert (isequal (sin (infsup (-1.0, -0.25)), infsup (-8.414709848078966159e-01, -2.474039592545229094e-01))); %!test %! assert (isequal (sin (infsup (-0.5, 0.5)), infsup (-4.794255386042030054e-01, 4.794255386042030054e-01))); %!test %! assert (isequal (sin (infsup (8.538038601028318546e+24, 8.538038601028318546e+24)), infsup (2.177252852343107281e-01, 2.177252852343107559e-01))); %!test %! assert (isequal (sin (infsup (-7.0, 7.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-7.0, 6.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-7.0, 5.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-7.0, 4.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-7.0, 3.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-7.0, 2.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-7.0, 1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-7.0, 0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-7.0, -1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-7.0, -2.0)), infsup (-9.092974268256817094e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-7.0, -3.0)), infsup (-6.569865987187891720e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-7.0, -4.0)), infsup (-6.569865987187891720e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-7.0, -5.0)), infsup (-6.569865987187891720e-01, 9.589242746631385650e-01))); %!test %! assert (isequal (sin (infsup (-7.0, -6.0)), infsup (-6.569865987187891720e-01, 2.794154981989259157e-01))); %!test %! assert (isequal (sin (infsup (-7.0, -7.0)), infsup (-6.569865987187891720e-01, -6.569865987187890610e-01))); %!test %! assert (isequal (sin (infsup (-6.0, 7.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-6.0, 6.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-6.0, 5.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-6.0, 4.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-6.0, 3.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-6.0, 2.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-6.0, 1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-6.0, 0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-6.0, -1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-6.0, -2.0)), infsup (-9.092974268256817094e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-6.0, -3.0)), infsup (-1.411200080598672413e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-6.0, -4.0)), infsup (2.794154981989258602e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-6.0, -5.0)), infsup (2.794154981989258602e-01, 9.589242746631385650e-01))); %!test %! assert (isequal (sin (infsup (-6.0, -6.0)), infsup (2.794154981989258602e-01, 2.794154981989259157e-01))); %!test %! assert (isequal (sin (infsup (-5.0, 7.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-5.0, 6.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-5.0, 5.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-5.0, 4.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-5.0, 3.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-5.0, 2.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-5.0, 1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-5.0, 0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-5.0, -1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-5.0, -2.0)), infsup (-9.092974268256817094e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-5.0, -3.0)), infsup (-1.411200080598672413e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-5.0, -4.0)), infsup (7.568024953079282025e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-5.0, -5.0)), infsup (9.589242746631384540e-01, 9.589242746631385650e-01))); %!test %! assert (isequal (sin (infsup (-4.0, 7.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-4.0, 6.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-4.0, 5.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-4.0, 4.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-4.0, 3.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-4.0, 2.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-4.0, 1.0)), infsup (-1.0, 8.414709848078966159e-01))); %!test %! assert (isequal (sin (infsup (-4.0, 0.0)), infsup (-1.0, 7.568024953079283135e-01))); %!test %! assert (isequal (sin (infsup (-4.0, -1.0)), infsup (-1.0, 7.568024953079283135e-01))); %!test %! assert (isequal (sin (infsup (-4.0, -2.0)), infsup (-9.092974268256817094e-01, 7.568024953079283135e-01))); %!test %! assert (isequal (sin (infsup (-4.0, -3.0)), infsup (-1.411200080598672413e-01, 7.568024953079283135e-01))); %!test %! assert (isequal (sin (infsup (-4.0, -4.0)), infsup (7.568024953079282025e-01, 7.568024953079283135e-01))); %!test %! assert (isequal (sin (infsup (-3.0, 7.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-3.0, 6.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-3.0, 5.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-3.0, 4.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-3.0, 3.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-3.0, 2.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-3.0, 1.0)), infsup (-1.0, 8.414709848078966159e-01))); %!test %! assert (isequal (sin (infsup (-3.0, 0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (sin (infsup (-3.0, -1.0)), infsup (-1.0, -1.411200080598672135e-01))); %!test %! assert (isequal (sin (infsup (-3.0, -2.0)), infsup (-9.092974268256817094e-01, -1.411200080598672135e-01))); %!test %! assert (isequal (sin (infsup (-3.0, -3.0)), infsup (-1.411200080598672413e-01, -1.411200080598672135e-01))); %!test %! assert (isequal (sin (infsup (-2.0, 7.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-2.0, 6.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-2.0, 5.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-2.0, 4.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-2.0, 3.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-2.0, 2.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-2.0, 1.0)), infsup (-1.0, 8.414709848078966159e-01))); %!test %! assert (isequal (sin (infsup (-2.0, 0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (sin (infsup (-2.0, -1.0)), infsup (-1.0, -8.414709848078965049e-01))); %!test %! assert (isequal (sin (infsup (-2.0, -2.0)), infsup (-9.092974268256817094e-01, -9.092974268256815984e-01))); %!test %! assert (isequal (sin (infsup (-1.0, 7.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-1.0, 6.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-1.0, 5.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-1.0, 4.0)), infsup (-8.414709848078966159e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-1.0, 3.0)), infsup (-8.414709848078966159e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-1.0, 2.0)), infsup (-8.414709848078966159e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-1.0, 1.0)), infsup (-8.414709848078966159e-01, 8.414709848078966159e-01))); %!test %! assert (isequal (sin (infsup (-1.0, 0.0)), infsup (-8.414709848078966159e-01, 0.0))); %!test %! assert (isequal (sin (infsup (-1.0, -1.0)), infsup (-8.414709848078966159e-01, -8.414709848078965049e-01))); %!test %! assert (isequal (sin (infsup (1.0, 7.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (1.0, 6.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (1.0, 5.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (1.0, 4.0)), infsup (-7.568024953079283135e-01, 1.0))); %!test %! assert (isequal (sin (infsup (1.0, 3.0)), infsup (1.411200080598672135e-01, 1.0))); %!test %! assert (isequal (sin (infsup (1.0, 2.0)), infsup (8.414709848078965049e-01, 1.0))); %!test %! assert (isequal (sin (infsup (1.0, 1.0)), infsup (8.414709848078965049e-01, 8.414709848078966159e-01))); %!test %! assert (isequal (sin (infsup (2.0, 7.0)), infsup (-1.0, 9.092974268256817094e-01))); %!test %! assert (isequal (sin (infsup (2.0, 6.0)), infsup (-1.0, 9.092974268256817094e-01))); %!test %! assert (isequal (sin (infsup (2.0, 5.0)), infsup (-1.0, 9.092974268256817094e-01))); %!test %! assert (isequal (sin (infsup (2.0, 4.0)), infsup (-7.568024953079283135e-01, 9.092974268256817094e-01))); %!test %! assert (isequal (sin (infsup (2.0, 3.0)), infsup (1.411200080598672135e-01, 9.092974268256817094e-01))); %!test %! assert (isequal (sin (infsup (2.0, 2.0)), infsup (9.092974268256815984e-01, 9.092974268256817094e-01))); %!test %! assert (isequal (sin (infsup (3.0, 7.0)), infsup (-1.0, 6.569865987187891720e-01))); %!test %! assert (isequal (sin (infsup (3.0, 6.0)), infsup (-1.0, 1.411200080598672413e-01))); %!test %! assert (isequal (sin (infsup (3.0, 5.0)), infsup (-1.0, 1.411200080598672413e-01))); %!test %! assert (isequal (sin (infsup (3.0, 4.0)), infsup (-7.568024953079283135e-01, 1.411200080598672413e-01))); %!test %! assert (isequal (sin (infsup (3.0, 3.0)), infsup (1.411200080598672135e-01, 1.411200080598672413e-01))); %!test %! assert (isequal (sin (infsup (4.0, 7.0)), infsup (-1.0, 6.569865987187891720e-01))); %!test %! assert (isequal (sin (infsup (4.0, 6.0)), infsup (-1.0, -2.794154981989258602e-01))); %!test %! assert (isequal (sin (infsup (4.0, 5.0)), infsup (-1.0, -7.568024953079282025e-01))); %!test %! assert (isequal (sin (infsup (4.0, 4.0)), infsup (-7.568024953079283135e-01, -7.568024953079282025e-01))); %!test %! assert (isequal (sin (infsup (5.0, 7.0)), infsup (-9.589242746631385650e-01, 6.569865987187891720e-01))); %!test %! assert (isequal (sin (infsup (5.0, 6.0)), infsup (-9.589242746631385650e-01, -2.794154981989258602e-01))); %!test %! assert (isequal (sin (infsup (5.0, 5.0)), infsup (-9.589242746631385650e-01, -9.589242746631384540e-01))); %!test %! assert (isequal (sin (infsup (6.0, 7.0)), infsup (-2.794154981989259157e-01, 6.569865987187891720e-01))); %!test %! assert (isequal (sin (infsup (6.0, 6.0)), infsup (-2.794154981989259157e-01, -2.794154981989258602e-01))); %!test %! assert (isequal (sin (infsup (7.0, 7.0)), infsup (6.569865987187890610e-01, 6.569865987187891720e-01))); ## mpfi_sinh %!# special values %!test %! assert (isequal (sinh (infsup (-inf, -7.0)), infsup (-inf, -5.483161232732464896e+02))); %!test %! assert (isequal (sinh (infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (sinh (infsup (-inf, +8.0)), infsup (-inf, 1.490478825789550228e+03))); %!test %! assert (isequal (sinh (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (sinh (infsup (-1.0, 0.0)), infsup (-1.175201193643801600e+00, 0.0))); %!test %! assert (isequal (sinh (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (sinh (infsup (0.0, +1.0)), infsup (0.0, 1.175201193643801600e+00))); %!test %! assert (isequal (sinh (infsup (0.0, +8.0)), infsup (0.0, 1.490478825789550228e+03))); %!test %! assert (isequal (sinh (infsup (0.0, inf)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (sinh (infsup (-0.125, 0.0)), infsup (-1.253257752411154613e-01, 0.0))); %!test %! assert (isequal (sinh (infsup (0.0, 5.000000000000001110e-01)), infsup (0.0, 5.210953054937474960e-01))); %!test %! assert (isequal (sinh (infsup (-4.5, -0.625)), infsup (-4.500301115199179236e+01, -6.664922644566160237e-01))); %!test %! assert (isequal (sinh (infsup (1.0, 3.0)), infsup (1.175201193643801378e+00, 1.001787492740990260e+01))); ## mpfi_sqr %!# special values %!test %! assert (isequal (pown (infsup (-inf, -7.0), 2), infsup (+49.0, inf))); %! assert (isequal (infsup (-inf, -7.0) .^ 2, infsup (+49.0, inf))); %! assert (isequal (power (infsup (-inf, -7.0), 2), infsup (+49.0, inf))); %! assert (isequal (infsup (-inf, -7.0) ^ 2, infsup (+49.0, inf))); %! assert (isequal (mpower (infsup (-inf, -7.0), 2), infsup (+49.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, 0.0), 2), infsup (0.0, inf))); %! assert (isequal (infsup (-inf, 0.0) .^ 2, infsup (0.0, inf))); %! assert (isequal (power (infsup (-inf, 0.0), 2), infsup (0.0, inf))); %! assert (isequal (infsup (-inf, 0.0) ^ 2, infsup (0.0, inf))); %! assert (isequal (mpower (infsup (-inf, 0.0), 2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, +8.0), 2), infsup (0.0, inf))); %! assert (isequal (infsup (-inf, +8.0) .^ 2, infsup (0.0, inf))); %! assert (isequal (power (infsup (-inf, +8.0), 2), infsup (0.0, inf))); %! assert (isequal (infsup (-inf, +8.0) ^ 2, infsup (0.0, inf))); %! assert (isequal (mpower (infsup (-inf, +8.0), 2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, inf), 2), infsup (0.0, inf))); %! assert (isequal (infsup (-inf, inf) .^ 2, infsup (0.0, inf))); %! assert (isequal (power (infsup (-inf, inf), 2), infsup (0.0, inf))); %! assert (isequal (infsup (-inf, inf) ^ 2, infsup (0.0, inf))); %! assert (isequal (mpower (infsup (-inf, inf), 2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (0.0, 0.0), 2), infsup (0.0, 0.0))); %! assert (isequal (infsup (0.0, 0.0) .^ 2, infsup (0.0, 0.0))); %! assert (isequal (power (infsup (0.0, 0.0), 2), infsup (0.0, 0.0))); %! assert (isequal (infsup (0.0, 0.0) ^ 2, infsup (0.0, 0.0))); %! assert (isequal (mpower (infsup (0.0, 0.0), 2), infsup (0.0, 0.0))); %!test %! assert (isequal (pown (infsup (0.0, +8.0), 2), infsup (0.0, +64.0))); %! assert (isequal (infsup (0.0, +8.0) .^ 2, infsup (0.0, +64.0))); %! assert (isequal (power (infsup (0.0, +8.0), 2), infsup (0.0, +64.0))); %! assert (isequal (infsup (0.0, +8.0) ^ 2, infsup (0.0, +64.0))); %! assert (isequal (mpower (infsup (0.0, +8.0), 2), infsup (0.0, +64.0))); %!test %! assert (isequal (pown (infsup (0.0, inf), 2), infsup (0.0, inf))); %! assert (isequal (infsup (0.0, inf) .^ 2, infsup (0.0, inf))); %! assert (isequal (power (infsup (0.0, inf), 2), infsup (0.0, inf))); %! assert (isequal (infsup (0.0, inf) ^ 2, infsup (0.0, inf))); %! assert (isequal (mpower (infsup (0.0, inf), 2), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (pown (infsup (5.242813527584075928e-01, 1.009848281860351562e+03), 2), infsup (2.748709368501858208e-01, 1.019793552376304055e+06))); %! assert (isequal (infsup (5.242813527584075928e-01, 1.009848281860351562e+03) .^ 2, infsup (2.748709368501858208e-01, 1.019793552376304055e+06))); %! assert (isequal (power (infsup (5.242813527584075928e-01, 1.009848281860351562e+03), 2), infsup (2.748709368501858208e-01, 1.019793552376304055e+06))); %! assert (isequal (infsup (5.242813527584075928e-01, 1.009848281860351562e+03) ^ 2, infsup (2.748709368501858208e-01, 1.019793552376304055e+06))); %! assert (isequal (mpower (infsup (5.242813527584075928e-01, 1.009848281860351562e+03), 2), infsup (2.748709368501858208e-01, 1.019793552376304055e+06))); %!test %! assert (isequal (pown (infsup (1.020801660558309578e+02, 1.193046000000000000e+06), 2), infsup (1.042036030198602202e+04, 1.423358758116000000e+12))); %! assert (isequal (infsup (1.020801660558309578e+02, 1.193046000000000000e+06) .^ 2, infsup (1.042036030198602202e+04, 1.423358758116000000e+12))); %! assert (isequal (power (infsup (1.020801660558309578e+02, 1.193046000000000000e+06), 2), infsup (1.042036030198602202e+04, 1.423358758116000000e+12))); %! assert (isequal (infsup (1.020801660558309578e+02, 1.193046000000000000e+06) ^ 2, infsup (1.042036030198602202e+04, 1.423358758116000000e+12))); %! assert (isequal (mpower (infsup (1.020801660558309578e+02, 1.193046000000000000e+06), 2), infsup (1.042036030198602202e+04, 1.423358758116000000e+12))); %!test %! assert (isequal (pown (infsup (-1.392367054308168983e+00, 1.000000000000000000e+00), 2), infsup (0.0, 1.938686013922807705e+00))); %! assert (isequal (infsup (-1.392367054308168983e+00, 1.000000000000000000e+00) .^ 2, infsup (0.0, 1.938686013922807705e+00))); %! assert (isequal (power (infsup (-1.392367054308168983e+00, 1.000000000000000000e+00), 2), infsup (0.0, 1.938686013922807705e+00))); %! assert (isequal (infsup (-1.392367054308168983e+00, 1.000000000000000000e+00) ^ 2, infsup (0.0, 1.938686013922807705e+00))); %! assert (isequal (mpower (infsup (-1.392367054308168983e+00, 1.000000000000000000e+00), 2), infsup (0.0, 1.938686013922807705e+00))); %!test %! assert (isequal (pown (infsup (1.418084280671316311e+00, 2.688493217609218444e+00), 2), infsup (2.010963027087084409e+00, 7.227995781130768904e+00))); %! assert (isequal (infsup (1.418084280671316311e+00, 2.688493217609218444e+00) .^ 2, infsup (2.010963027087084409e+00, 7.227995781130768904e+00))); %! assert (isequal (power (infsup (1.418084280671316311e+00, 2.688493217609218444e+00), 2), infsup (2.010963027087084409e+00, 7.227995781130768904e+00))); %! assert (isequal (infsup (1.418084280671316311e+00, 2.688493217609218444e+00) ^ 2, infsup (2.010963027087084409e+00, 7.227995781130768904e+00))); %! assert (isequal (mpower (infsup (1.418084280671316311e+00, 2.688493217609218444e+00), 2), infsup (2.010963027087084409e+00, 7.227995781130768904e+00))); ## mpfi_sqrt %!# special values %!test %! assert (isequal (realsqrt (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (realsqrt (infsup (0.0, +9.0)), infsup (0.0, +3.0))); %!test %! assert (isequal (realsqrt (infsup (0.0, inf)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (realsqrt (infsup (4.368100000000000000e+04, 1.423358758116000000e+12)), infsup (2.090000000000000000e+02, 1.193046000000000000e+06))); %!test %! assert (isequal (realsqrt (infsup (8.929886572570981951e-01, 4.368100000000000000e+04)), infsup (9.449807708398610950e-01, 2.090000000000000000e+02))); %!test %! assert (isequal (realsqrt (infsup (6.665191650390625000e-01, 1.047677010367332295e+00)), infsup (8.164062500000000000e-01, 1.023560946093261537e+00))); %!test %! assert (isequal (realsqrt (infsup (8.929886572570981951e-01, 1.047677010367332295e+00)), infsup (9.449807708398610950e-01, 1.023560946093261537e+00))); ## mpfi_sub %!# special values %!test %! assert (isequal (infsup (-inf, -7.0) - infsup (-1.0, +8.0), infsup (-inf, -6.0))); %! assert (isequal (minus (infsup (-inf, -7.0), infsup (-1.0, +8.0)), infsup (-inf, -6.0))); %!test %! assert (isequal (infsup (-inf, 0.0) - infsup (+8.0, inf), infsup (-inf, -8.0))); %! assert (isequal (minus (infsup (-inf, 0.0), infsup (+8.0, inf)), infsup (-inf, -8.0))); %!test %! assert (isequal (infsup (-inf, +8.0) - infsup (0.0, +8.0), infsup (-inf, +8.0))); %! assert (isequal (minus (infsup (-inf, +8.0), infsup (0.0, +8.0)), infsup (-inf, +8.0))); %!test %! assert (isequal (infsup (-inf, inf) - infsup (0.0, +8.0), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-inf, inf), infsup (0.0, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (-inf, -7.0), infsup (+7.0, inf))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (-inf, -7.0)), infsup (+7.0, inf))); %!test %! assert (isequal (infsup (0.0, +8.0) - infsup (-7.0, 0.0), infsup (0.0, +15.0))); %! assert (isequal (minus (infsup (0.0, +8.0), infsup (-7.0, 0.0)), infsup (0.0, +15.0))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (0.0, +8.0), infsup (-8.0, 0.0))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (0.0, +8.0)), infsup (-8.0, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) - infsup (0.0, +8.0), infsup (-8.0, inf))); %! assert (isequal (minus (infsup (0.0, inf), infsup (0.0, +8.0)), infsup (-8.0, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (+8.0, inf), infsup (-inf, -8.0))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (+8.0, inf)), infsup (-inf, -8.0))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, +8.0) - infsup (-7.0, +8.0), infsup (-8.0, +15.0))); %! assert (isequal (minus (infsup (0.0, +8.0), infsup (-7.0, +8.0)), infsup (-8.0, +15.0))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) - infsup (0.0, +8.0), infsup (-8.0, inf))); %! assert (isequal (minus (infsup (0.0, inf), infsup (0.0, +8.0)), infsup (-8.0, inf))); %!# regular values %!test %! assert (isequal (infsup (-5.0, 59.0) - infsup (17.0, 81.0), infsup (-86.0, 42.0))); %! assert (isequal (minus (infsup (-5.0, 59.0), infsup (17.0, 81.0)), infsup (-86.0, 42.0))); %!test %! assert (isequal (infsup (-4.909093465297726553e-91, 3.202558470389760000e+14) - infsup (-1.264629250000000000e+08, 4.547473508864641190e-13), infsup (-4.547473508864642199e-13, 3.202559735019010000e+14))); %! assert (isequal (minus (infsup (-4.909093465297726553e-91, 3.202558470389760000e+14), infsup (-1.264629250000000000e+08, 4.547473508864641190e-13)), infsup (-4.547473508864642199e-13, 3.202559735019010000e+14))); %!test %! assert (isequal (infsup (-4.0, 7.0) - infsup (-3e300, 2.443359172835548401e+09), infsup (-2.443359176835548401e+09, 3.000000000000000752e+300))); %! assert (isequal (minus (infsup (-4.0, 7.0), infsup (-3e300, 2.443359172835548401e+09)), infsup (-2.443359176835548401e+09, 3.000000000000000752e+300))); %!test %! assert (isequal (infsup (-7.205869356633318400e+16, 1.152921504606846976e+18) - infsup (-3e300, 2.814792717434890000e+14), infsup (-7.234017283807668800e+16, 3.000000000000000752e+300))); %! assert (isequal (minus (infsup (-7.205869356633318400e+16, 1.152921504606846976e+18), infsup (-3e300, 2.814792717434890000e+14)), infsup (-7.234017283807668800e+16, 3.000000000000000752e+300))); %!test %! assert (isequal (infsup (-5.0, 1.0) - infsup (1.0, 1.180591620717411303e+21), infsup (-1.180591620717411566e+21, 0.0))); %! assert (isequal (minus (infsup (-5.0, 1.0), infsup (1.0, 1.180591620717411303e+21)), infsup (-1.180591620717411566e+21, 0.0))); %!test %! assert (isequal (infsup (5.0, 1.180591620717411303e+21) - infsup (3.0, 5.0), infsup (0.0, 1.180591620717411303e+21))); %! assert (isequal (minus (infsup (5.0, 1.180591620717411303e+21), infsup (3.0, 5.0)), infsup (0.0, 1.180591620717411303e+21))); ## mpfi_sub_d %!# special values %!test %! assert (isequal (infsup (-inf, -7.0) - infsup (-4.000000000000000286e-17, -4.000000000000000286e-17), infsup (-inf, -6.999999999999999112e+00))); %! assert (isequal (minus (infsup (-inf, -7.0), infsup (-4.000000000000000286e-17, -4.000000000000000286e-17)), infsup (-inf, -6.999999999999999112e+00))); %!test %! assert (isequal (infsup (-inf, -7.0) - infsup (0.0, 0.0), infsup (-inf, -7.0))); %! assert (isequal (minus (infsup (-inf, -7.0), infsup (0.0, 0.0)), infsup (-inf, -7.0))); %!test %! assert (isequal (infsup (-inf, -7.0) - infsup (4.000000000000000286e-17, 4.000000000000000286e-17), infsup (-inf, -7.0))); %! assert (isequal (minus (infsup (-inf, -7.0), infsup (4.000000000000000286e-17, 4.000000000000000286e-17)), infsup (-inf, -7.0))); %!test %! assert (isequal (infsup (-inf, 0.0) - infsup (-8.000000000000000572e-17, -8.000000000000000572e-17), infsup (-inf, 8.000000000000000572e-17))); %! assert (isequal (minus (infsup (-inf, 0.0), infsup (-8.000000000000000572e-17, -8.000000000000000572e-17)), infsup (-inf, 8.000000000000000572e-17))); %!test %! assert (isequal (infsup (-inf, 0.0) - infsup (0.0, 0.0), infsup (-inf, 0.0))); %! assert (isequal (minus (infsup (-inf, 0.0), infsup (0.0, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, 0.0) - infsup (8.000000000000000572e-17, 8.000000000000000572e-17), infsup (-inf, -8.0e-17))); %! assert (isequal (minus (infsup (-inf, 0.0), infsup (8.000000000000000572e-17, 8.000000000000000572e-17)), infsup (-inf, -8.0e-17))); %!test %! assert (isequal (infsup (-inf, 8.0) - infsup (-1.600000000000000000e+18, -1.600000000000000000e+18), infsup (-inf, 1.600000000000000256e+18))); %! assert (isequal (minus (infsup (-inf, 8.0), infsup (-1.600000000000000000e+18, -1.600000000000000000e+18)), infsup (-inf, 1.600000000000000256e+18))); %!test %! assert (isequal (infsup (-inf, 8.0) - infsup (0.0, 0.0), infsup (-inf, 8.0))); %! assert (isequal (minus (infsup (-inf, 8.0), infsup (0.0, 0.0)), infsup (-inf, 8.0))); %!test %! assert (isequal (infsup (-inf, 8.0) - infsup (1.600000000000000000e+18, 1.600000000000000000e+18), infsup (-inf, -1.599999999999999744e+18))); %! assert (isequal (minus (infsup (-inf, 8.0), infsup (1.600000000000000000e+18, 1.600000000000000000e+18)), infsup (-inf, -1.599999999999999744e+18))); %!test %! assert (isequal (infsup (-inf, inf) - infsup (-1.600000000000000114e-16, -1.600000000000000114e-16), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-inf, inf), infsup (-1.600000000000000114e-16, -1.600000000000000114e-16)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) - infsup (0.0e-17, 0.0e-17), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-inf, inf), infsup (0.0e-17, 0.0e-17)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) - infsup (1.600000000000000114e-16, 1.600000000000000114e-16), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-inf, inf), infsup (1.600000000000000114e-16, 1.600000000000000114e-16)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (-1.000000000000000072e-17, -1.000000000000000072e-17), infsup (1.000000000000000072e-17, 1.000000000000000072e-17))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (-1.000000000000000072e-17, -1.000000000000000072e-17)), infsup (1.000000000000000072e-17, 1.000000000000000072e-17))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (1.000000000000000072e-17, 1.000000000000000072e-17), infsup (-1.000000000000000072e-17, -1.000000000000000072e-17))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (1.000000000000000072e-17, 1.000000000000000072e-17)), infsup (-1.000000000000000072e-17, -1.000000000000000072e-17))); %!test %! assert (isequal (infsup (0.0, 8.0) - infsup (-3.000000000000000061e-17, -3.000000000000000061e-17), infsup (3.000000000000000061e-17, 8.000000000000001776e+00))); %! assert (isequal (minus (infsup (0.0, 8.0), infsup (-3.000000000000000061e-17, -3.000000000000000061e-17)), infsup (3.000000000000000061e-17, 8.000000000000001776e+00))); %!test %! assert (isequal (infsup (0.0, 8.0) - infsup (0.0, 0.0), infsup (0.0, 8.0))); %! assert (isequal (minus (infsup (0.0, 8.0), infsup (0.0, 0.0)), infsup (0.0, 8.0))); %!test %! assert (isequal (infsup (0.0, 8.0) - infsup (3.000000000000000061e-17, 3.000000000000000061e-17), infsup (-3.000000000000000061e-17, 8.0))); %! assert (isequal (minus (infsup (0.0, 8.0), infsup (3.000000000000000061e-17, 3.000000000000000061e-17)), infsup (-3.000000000000000061e-17, 8.0))); %!test %! assert (isequal (infsup (0.0, inf) - infsup (-7.000000000000000347e-17, -7.000000000000000347e-17), infsup (7.000000000000000347e-17, inf))); %! assert (isequal (minus (infsup (0.0, inf), infsup (-7.000000000000000347e-17, -7.000000000000000347e-17)), infsup (7.000000000000000347e-17, inf))); %!test %! assert (isequal (infsup (0.0, inf) - infsup (0.0, 0.0), infsup (0.0, inf))); %! assert (isequal (minus (infsup (0.0, inf), infsup (0.0, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, inf) - infsup (6.999999999999999114e-17, 6.999999999999999114e-17), infsup (-6.999999999999999114e-17, inf))); %! assert (isequal (minus (infsup (0.0, inf), infsup (6.999999999999999114e-17, 6.999999999999999114e-17)), infsup (-6.999999999999999114e-17, inf))); %!# regular values %!test %! assert (isequal (infsup (-32.0, -17.0) - infsup (3.141592653589793116e+01, 3.141592653589793116e+01), infsup (-6.341592653589793116e+01, -4.841592653589793116e+01))); %! assert (isequal (minus (infsup (-32.0, -17.0), infsup (3.141592653589793116e+01, 3.141592653589793116e+01)), infsup (-6.341592653589793116e+01, -4.841592653589793116e+01))); %!test %! assert (isequal (infsup (-3.141592653589793116e+01, -17.0) - infsup (-3.141592653589793116e+01, -3.141592653589793116e+01), infsup (0.0, 1.441592653589793116e+01))); %! assert (isequal (minus (infsup (-3.141592653589793116e+01, -17.0), infsup (-3.141592653589793116e+01, -3.141592653589793116e+01)), infsup (0.0, 1.441592653589793116e+01))); %!test %! assert (isequal (infsup (-32.0, -1.570796326794896558e+01) - infsup (-1.570796326794896558e+01, -1.570796326794896558e+01), infsup (-1.629203673205103442e+01, 0.0))); %! assert (isequal (minus (infsup (-32.0, -1.570796326794896558e+01), infsup (-1.570796326794896558e+01, -1.570796326794896558e+01)), infsup (-1.629203673205103442e+01, 0.0))); %!test %! assert (isequal (infsup (1.820444444444444443e+01, 3.202559735019019375e+14) - infsup (-3.5, -3.5), infsup (2.170444444444444443e+01, 3.202559735019054375e+14))); %! assert (isequal (minus (infsup (1.820444444444444443e+01, 3.202559735019019375e+14), infsup (-3.5, -3.5)), infsup (2.170444444444444443e+01, 3.202559735019054375e+14))); %!test %! assert (isequal (infsup (7.111111111111111105e-02, 3.202559735019019375e+14) - infsup (-3.5, -3.5), infsup (3.571111111111110681e+00, 3.202559735019054375e+14))); %! assert (isequal (minus (infsup (7.111111111111111105e-02, 3.202559735019019375e+14), infsup (-3.5, -3.5)), infsup (3.571111111111110681e+00, 3.202559735019054375e+14))); %!test %! assert (isequal (infsup (-2.550000000000000000e+02, 1.137777777777777777e+00) - infsup (-256.5, -256.5), infsup (1.500000000000000000e+00, 2.576377777777777851e+02))); %! assert (isequal (minus (infsup (-2.550000000000000000e+02, 1.137777777777777777e+00), infsup (-256.5, -256.5)), infsup (1.500000000000000000e+00, 2.576377777777777851e+02))); %!test %! assert (isequal (infsup (-1.999999999999999778e+00, -2.713328551617526225e-166) - infsup (-4097.5, -4097.5), infsup (4.095500000000000000e+03, 4.097500000000000000e+03))); %! assert (isequal (minus (infsup (-1.999999999999999778e+00, -2.713328551617526225e-166), infsup (-4097.5, -4097.5)), infsup (4.095500000000000000e+03, 4.097500000000000000e+03))); %!test %! assert (isequal (infsup (1.820444444444444443e+01, 3.202559735019019375e+14) - infsup (3.5, 3.5), infsup (1.470444444444444443e+01, 3.202559735018984375e+14))); %! assert (isequal (minus (infsup (1.820444444444444443e+01, 3.202559735019019375e+14), infsup (3.5, 3.5)), infsup (1.470444444444444443e+01, 3.202559735018984375e+14))); %!test %! assert (isequal (infsup (7.111111111111111105e-02, 3.202559735019019375e+14) - infsup (3.5, 3.5), infsup (-3.428888888888889319e+00, 3.202559735018984375e+14))); %! assert (isequal (minus (infsup (7.111111111111111105e-02, 3.202559735019019375e+14), infsup (3.5, 3.5)), infsup (-3.428888888888889319e+00, 3.202559735018984375e+14))); %!test %! assert (isequal (infsup (-2.550000000000000000e+02, 1.137777777777777777e+00) - infsup (256.5, 256.5), infsup (-5.115000000000000000e+02, -2.553622222222222149e+02))); %! assert (isequal (minus (infsup (-2.550000000000000000e+02, 1.137777777777777777e+00), infsup (256.5, 256.5)), infsup (-5.115000000000000000e+02, -2.553622222222222149e+02))); %!test %! assert (isequal (infsup (-1.999999999999999778e+00, -2.713328551617526225e-166) - infsup (4097.5, 4097.5), infsup (-4.099500000000000000e+03, -4.097500000000000000e+03))); %! assert (isequal (minus (infsup (-1.999999999999999778e+00, -2.713328551617526225e-166), infsup (4097.5, 4097.5)), infsup (-4.099500000000000000e+03, -4.097500000000000000e+03))); ## mpfi_tan %!# special values %!test %! assert (isequal (tan (infsup (-inf, -7.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-inf, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-1.0, 0.0)), infsup (-1.557407724654902292e+00, 0.0))); %!test %! assert (isequal (tan (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (tan (infsup (0.0, +1.0)), infsup (0.0, 1.557407724654902292e+00))); %!test %! assert (isequal (tan (infsup (0.0, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (0.0, inf)), infsup (-inf, inf))); %!# regular values %!test %! assert (isequal (tan (infsup (0.125, 17.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (1.570796326794896558e+00, 1.570796326794896780e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-2.0, -0.5)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-4.5, 0.625)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-1.0, -0.25)), infsup (-1.557407724654902292e+00, -2.553419212210362166e-01))); %!test %! assert (isequal (tan (infsup (-0.5, 0.5)), infsup (-5.463024898437905952e-01, 5.463024898437905952e-01))); %!test %! assert (isequal (tan (infsup (8.538038601028318546e+24, 8.538038601028318546e+24)), infsup (-2.230768789827465293e-01, -2.230768789827465015e-01))); %!test %! assert (isequal (tan (infsup (-7.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-7.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-7.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-7.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-7.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-7.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-7.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-7.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-7.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-7.0, -2.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-7.0, -3.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-7.0, -4.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-7.0, -5.0)), infsup (-8.714479827243187815e-01, 3.380515006246585852e+00))); %!test %! assert (isequal (tan (infsup (-7.0, -6.0)), infsup (-8.714479827243187815e-01, 2.910061913847492021e-01))); %!test %! assert (isequal (tan (infsup (-7.0, -7.0)), infsup (-8.714479827243187815e-01, -8.714479827243186705e-01))); %!test %! assert (isequal (tan (infsup (-6.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-6.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-6.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-6.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-6.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-6.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-6.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-6.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-6.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-6.0, -2.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-6.0, -3.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-6.0, -4.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-6.0, -5.0)), infsup (2.910061913847491466e-01, 3.380515006246585852e+00))); %!test %! assert (isequal (tan (infsup (-6.0, -6.0)), infsup (2.910061913847491466e-01, 2.910061913847492021e-01))); %!test %! assert (isequal (tan (infsup (-5.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-5.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-5.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-5.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-5.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-5.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-5.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-5.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-5.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-5.0, -2.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-5.0, -3.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-5.0, -4.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-5.0, -5.0)), infsup (3.380515006246585408e+00, 3.380515006246585852e+00))); %!test %! assert (isequal (tan (infsup (-4.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-4.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-4.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-4.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-4.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-4.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-4.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-4.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-4.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-4.0, -2.0)), infsup (-1.157821282349577707e+00, 2.185039863261519333e+00))); %!test %! assert (isequal (tan (infsup (-4.0, -3.0)), infsup (-1.157821282349577707e+00, 1.425465430742778317e-01))); %!test %! assert (isequal (tan (infsup (-4.0, -4.0)), infsup (-1.157821282349577707e+00, -1.157821282349577485e+00))); %!test %! assert (isequal (tan (infsup (-3.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-3.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-3.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-3.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-3.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-3.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-3.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-3.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-3.0, -2.0)), infsup (1.425465430742778039e-01, 2.185039863261519333e+00))); %!test %! assert (isequal (tan (infsup (-3.0, -3.0)), infsup (1.425465430742778039e-01, 1.425465430742778317e-01))); %!test %! assert (isequal (tan (infsup (-2.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-2.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-2.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-2.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-2.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-2.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-2.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-2.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-2.0, -2.0)), infsup (2.185039863261518889e+00, 2.185039863261519333e+00))); %!test %! assert (isequal (tan (infsup (-1.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-1.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-1.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-1.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-1.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-1.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-1.0, 1.0)), infsup (-1.557407724654902292e+00, 1.557407724654902292e+00))); %!test %! assert (isequal (tan (infsup (-1.0, 0.0)), infsup (-1.557407724654902292e+00, 0.0))); %!test %! assert (isequal (tan (infsup (-1.0, -1.0)), infsup (-1.557407724654902292e+00, -1.557407724654902070e+00))); %!test %! assert (isequal (tan (infsup (1.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (1.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (1.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (1.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (1.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (1.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (1.0, 1.0)), infsup (1.557407724654902070e+00, 1.557407724654902292e+00))); %!test %! assert (isequal (tan (infsup (2.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (2.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (2.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (2.0, 4.0)), infsup (-2.185039863261519333e+00, 1.157821282349577707e+00))); %!test %! assert (isequal (tan (infsup (2.0, 3.0)), infsup (-2.185039863261519333e+00, -1.425465430742778039e-01))); %!test %! assert (isequal (tan (infsup (2.0, 2.0)), infsup (-2.185039863261519333e+00, -2.185039863261518889e+00))); %!test %! assert (isequal (tan (infsup (3.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (3.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (3.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (3.0, 4.0)), infsup (-1.425465430742778317e-01, 1.157821282349577707e+00))); %!test %! assert (isequal (tan (infsup (3.0, 3.0)), infsup (-1.425465430742778317e-01, -1.425465430742778039e-01))); %!test %! assert (isequal (tan (infsup (4.0, 7.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (4.0, 6.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (4.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (4.0, 4.0)), infsup (1.157821282349577485e+00, 1.157821282349577707e+00))); %!test %! assert (isequal (tan (infsup (5.0, 7.0)), infsup (-3.380515006246585852e+00, 8.714479827243187815e-01))); %!test %! assert (isequal (tan (infsup (5.0, 6.0)), infsup (-3.380515006246585852e+00, -2.910061913847491466e-01))); %!test %! assert (isequal (tan (infsup (5.0, 5.0)), infsup (-3.380515006246585852e+00, -3.380515006246585408e+00))); %!test %! assert (isequal (tan (infsup (6.0, 7.0)), infsup (-2.910061913847492021e-01, 8.714479827243187815e-01))); %!test %! assert (isequal (tan (infsup (6.0, 6.0)), infsup (-2.910061913847492021e-01, -2.910061913847491466e-01))); %!test %! assert (isequal (tan (infsup (7.0, 7.0)), infsup (8.714479827243186705e-01, 8.714479827243187815e-01))); ## mpfi_tanh %!# special values %!test %! assert (isequal (tanh (infsup (-inf, -7.0)), infsup (-1.0, -9.999983369439445768e-01))); %!test %! assert (isequal (tanh (infsup (-inf, 0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (tanh (infsup (-inf, 8.0)), infsup (-1.0, 9.999997749296759553e-01))); %!test %! assert (isequal (tanh (infsup (-inf, inf)), infsup (-1.0, +1.0))); %!test %! assert (isequal (tanh (infsup (-1.0, 0.0)), infsup (-7.615941559557649621e-01, 0.0))); %!test %! assert (isequal (tanh (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (tanh (infsup (0.0, 1.0)), infsup (0.0, 7.615941559557649621e-01))); %!test %! assert (isequal (tanh (infsup (0.0, 8.0)), infsup (0.0, 9.999997749296759553e-01))); %!test %! assert (isequal (tanh (infsup (0.0, inf)), infsup (0.0, +1.0))); %!# regular values %!test %! assert (isequal (tanh (infsup (-0.125, 0.0)), infsup (-1.243530017715962083e-01, 0.0))); %!test %! assert (isequal (tanh (infsup (0.0, 5.000000000000001110e-01)), infsup (0.0, 4.621171572600098476e-01))); %!test %! assert (isequal (tanh (infsup (-4.5, -0.625)), infsup (-9.997532108480275959e-01, -5.545997223493822625e-01))); %!test %! assert (isequal (tanh (infsup (1.0, 3.0)), infsup (7.615941559557648510e-01, 9.950547536867304643e-01))); %!test %! assert (isequal (tanh (infsup (17.0, 18.0)), infsup (9.999999999999965583e-01, 9.999999999999995559e-01))); ## mpfi_union %!# special values %!test %! assert (isequal (union (infsup (-inf, -7.0), infsup (-1.0, +8.0)), infsup (-inf, +8.0))); %!test %! assert (isequal (union (infsup (-inf, 0.0), infsup (+8.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (union (infsup (-inf, +8.0), infsup (0.0, +8.0)), infsup (-inf, +8.0))); %!test %! assert (isequal (union (infsup (-inf, inf), infsup (0.0, +8.0)), infsup (-inf, inf))); %!test %! assert (isequal (union (infsup (0.0, 0.0), infsup (-inf, -7.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (union (infsup (0.0, +8.0), infsup (-7.0, 0.0)), infsup (-7.0, +8.0))); %!test %! assert (isequal (union (infsup (0.0, 0.0), infsup (0.0, +8.0)), infsup (0.0, +8.0))); %!test %! assert (isequal (union (infsup (0.0, inf), infsup (0.0, +8.0)), infsup (0.0, inf))); %!test %! assert (isequal (union (infsup (0.0, 0.0), infsup (+8.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (union (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (union (infsup (0.0, +8.0), infsup (-7.0, +8.0)), infsup (-7.0, +8.0))); %!test %! assert (isequal (union (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (union (infsup (0.0, inf), infsup (0.0, +8.0)), infsup (0.0, inf))); %!# regular values %!test %! assert (isequal (union (infsup (1.800000000000000000e+01, 1.440000000000000000e+02), infsup (-1.300000000000000000e+01, 5.200000000000000000e+01)), infsup (-1.300000000000000000e+01, 1.440000000000000000e+02))); interval-2.1.0/inst/test/ieee1788-constructors.tst0000644000175000017500000002041513031037012021405 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/ieee1788-constructors.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## ## Test Cases for interval constructors from IEEE Std 1788-2015 ## ## Copyright 2016 Oliver Heimlich ## ## 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 . ## ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## IEEE1788.a %!# According to the examples in Section 7.4.2, unbounded intervals can be constructed with non-common inputs. %!test %! assert (isequal (infsup (-inf, inf), infsup (-inf, inf))); ## IEEE1788.b %!# Examples from Sections 9.7.1 and 9.8 %!test %! assert (isequal (infsup ("[1.2345]"), infsup (1.234499999999999931e+00, 1.234500000000000153e+00))); %!test %! assert (isequal (infsup ("[1,+infinity]"), infsup (1.0, inf))); %!test %! assert (isequal (infsupdec ("[1,1e3]_com"), infsupdec (1.0, 1000.0, "com"))); %! assert (isequal (decorationpart (infsupdec ("[1,1e3]_com")){1}, decorationpart (infsupdec (1.0, 1000.0, "com")){1})); %!test %! assert (isequal (infsupdec ("[1,1E3]_COM"), infsupdec (1.0, 1000.0, "com"))); %! assert (isequal (decorationpart (infsupdec ("[1,1E3]_COM")){1}, decorationpart (infsupdec (1.0, 1000.0, "com")){1})); ## IEEE1788.c %!# Examples from Table 9.4 %!test %! assert (isequal (infsup ("[1.e-3, 1.1e-3]"), infsup (9.999999999999998040e-04, 1.100000000000000066e-03))); %!test %! assert (isequal (infsup ("[-0x1.3p-1, 2/3]"), infsup (-5.937500000000000000e-01, 6.666666666666667407e-01))); %!test %! assert (isequal (infsup ("[3.56]"), infsup (3.559999999999999609e+00, 3.560000000000000053e+00))); %!test %! assert (isequal (infsup ("3.56?1"), infsup (3.549999999999999822e+00, 3.570000000000000284e+00))); %!test %! assert (isequal (infsup ("3.56?1e2"), infsup (355.0, 357.0))); %!test %! assert (isequal (infsup ("3.560?2"), infsup (3.557999999999999829e+00, 3.562000000000000277e+00))); %!test %! assert (isequal (infsup ("3.56?"), infsup (3.554999999999999716e+00, 3.565000000000000391e+00))); %!test %! assert (isequal (infsup ("3.560?2u"), infsup (3.559999999999999609e+00, 3.562000000000000277e+00))); %!test %! assert (isequal (infsup ("-10?"), infsup (-10.5, -9.5))); %!test %! assert (isequal (infsup ("-10?u"), infsup (-10.0, -9.5))); %!test %! assert (isequal (infsup ("-10?12"), infsup (-22.0, 2.0))); ## IEEE1788.d %!# Examples from Section 10.5.1 %!test %! assert (isequal (infsup ("[1.234e5,Inf]"), infsup (123400.0, inf))); %!test %! assert (isequal (infsup ("3.1416?1"), infsup (3.141499999999999737e+00, 3.141700000000000159e+00))); %!test %! assert (isequal (infsup ("[Empty]"), infsup)); ## IEEE1788.e %!# Example from Section 11.3 %!test %! assert (isequal (infsupdec (2, 1), nai)); ## IEEE1788.e %!# Examples from Table 12.1 %!test %! assert (isequal (infsupdec ("[ ]"), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (infsupdec ("[ ]")){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (infsupdec ("[entire]"), infsupdec (-inf, inf, "dac"))); %! assert (isequal (decorationpart (infsupdec ("[entire]")){1}, decorationpart (infsupdec (-inf, inf, "dac")){1})); %!test %! assert (isequal (infsupdec ("[1.e-3, 1.1e-3]"), infsupdec (9.999999999999998040e-04, 1.100000000000000066e-03, "com"))); %! assert (isequal (decorationpart (infsupdec ("[1.e-3, 1.1e-3]")){1}, decorationpart (infsupdec (9.999999999999998040e-04, 1.100000000000000066e-03, "com")){1})); %!test %! assert (isequal (infsupdec ("[-Inf, 2/3]"), infsupdec (-inf, 6.666666666666667407e-01, "dac"))); %! assert (isequal (decorationpart (infsupdec ("[-Inf, 2/3]")){1}, decorationpart (infsupdec (-inf, 6.666666666666667407e-01, "dac")){1})); %!test %! assert (isequal (infsupdec ("[0x1.3p-1,]"), infsupdec (5.937500000000000000e-01, inf, "dac"))); %! assert (isequal (decorationpart (infsupdec ("[0x1.3p-1,]")){1}, decorationpart (infsupdec (5.937500000000000000e-01, inf, "dac")){1})); %!test %! assert (isequal (infsupdec ("[,]"), infsupdec (entire, "dac"))); %! assert (isequal (decorationpart (infsupdec ("[,]")){1}, decorationpart (infsupdec (entire, "dac")){1})); %!test %! assert (isequal (infsupdec ("3.56?1"), infsupdec (3.549999999999999822e+00, 3.570000000000000284e+00, "com"))); %! assert (isequal (decorationpart (infsupdec ("3.56?1")){1}, decorationpart (infsupdec (3.549999999999999822e+00, 3.570000000000000284e+00, "com")){1})); %!test %! assert (isequal (infsupdec ("3.56?1e2"), infsupdec (355.0, 357.0, "com"))); %! assert (isequal (decorationpart (infsupdec ("3.56?1e2")){1}, decorationpart (infsupdec (355.0, 357.0, "com")){1})); %!test %! assert (isequal (infsupdec ("3.560?2"), infsupdec (3.557999999999999829e+00, 3.562000000000000277e+00, "com"))); %! assert (isequal (decorationpart (infsupdec ("3.560?2")){1}, decorationpart (infsupdec (3.557999999999999829e+00, 3.562000000000000277e+00, "com")){1})); %!test %! assert (isequal (infsupdec ("3.56?"), infsupdec (3.554999999999999716e+00, 3.565000000000000391e+00, "com"))); %! assert (isequal (decorationpart (infsupdec ("3.56?")){1}, decorationpart (infsupdec (3.554999999999999716e+00, 3.565000000000000391e+00, "com")){1})); %!test %! assert (isequal (infsupdec ("3.560?2u"), infsupdec (3.559999999999999609e+00, 3.562000000000000277e+00, "com"))); %! assert (isequal (decorationpart (infsupdec ("3.560?2u")){1}, decorationpart (infsupdec (3.559999999999999609e+00, 3.562000000000000277e+00, "com")){1})); %!test %! assert (isequal (infsupdec ("-10?"), infsupdec (-10.5, -9.5, "com"))); %! assert (isequal (decorationpart (infsupdec ("-10?")){1}, decorationpart (infsupdec (-10.5, -9.5, "com")){1})); %!test %! assert (isequal (infsupdec ("-10?u"), infsupdec (-10.0, -9.5, "com"))); %! assert (isequal (decorationpart (infsupdec ("-10?u")){1}, decorationpart (infsupdec (-10.0, -9.5, "com")){1})); %!test %! assert (isequal (infsupdec ("-10?12"), infsupdec (-22.0, 2.0, "com"))); %! assert (isequal (decorationpart (infsupdec ("-10?12")){1}, decorationpart (infsupdec (-22.0, 2.0, "com")){1})); %!test %! assert (isequal (infsupdec ("-10??u"), infsupdec (-10.0, inf, "dac"))); %! assert (isequal (decorationpart (infsupdec ("-10??u")){1}, decorationpart (infsupdec (-10.0, inf, "dac")){1})); %!test %! assert (isequal (infsupdec ("-10??"), infsupdec (-inf, inf, "dac"))); %! assert (isequal (decorationpart (infsupdec ("-10??")){1}, decorationpart (infsupdec (-inf, inf, "dac")){1})); %!test %! assert (isequal (infsupdec ("[nai]"), nai)); %!test %! assert (isequal (infsupdec ("3.56?1_def"), infsupdec (3.549999999999999822e+00, 3.570000000000000284e+00, "def"))); %! assert (isequal (decorationpart (infsupdec ("3.56?1_def")){1}, decorationpart (infsupdec (3.549999999999999822e+00, 3.570000000000000284e+00, "def")){1})); ## IEEE1788.f %!# Examples from Section 12.11.3 %!test %! assert (isequal (infsup ("[]"), infsup)); %!test %! assert (isequal (infsup ("[empty]"), infsup)); %!test %! assert (isequal (infsup ("[ empty ]"), infsup)); %!test %! assert (isequal (infsup ("[,]"), infsup (-inf, inf))); %!test %! assert (isequal (infsup ("[ entire ]"), infsup (-inf, inf))); interval-2.1.0/inst/test/libieeep1788_tests_set.tst0000644000175000017500000001314013031037013021601 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/libieeep1788_tests_set.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) ## Copyright 2015-2016 Oliver Heimlich ## ## Original author: Marco Nehmeier (unit tests in libieeep1788, ## original license: Apache License 2.0) ## Converted into portable ITL format by Oliver Heimlich with minor corrections. ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## minimal_intersection_test %!test %! assert (isequal (intersect (infsup (1.0, 3.0), infsup (2.1, 4.0)), infsup (2.1, 3.0))); %!test %! assert (isequal (intersect (infsup (1.0, 3.0), infsup (3.0, 4.0)), infsup (3.0, 3.0))); %!test %! assert (isequal (intersect (infsup (1.0, 3.0), infsup), infsup)); %!test %! assert (isequal (intersect (infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (intersect (infsup (1.0, 3.0), infsup (-inf, inf)), infsup (1.0, 3.0))); ## minimal_intersection_dec_test %!test %! assert (isequal (intersect (infsupdec (1.0, 3.0, "com"), infsupdec (2.1, 4.0, "com")), infsupdec (2.1, 3.0, "trv"))); %! assert (isequal (decorationpart (intersect (infsupdec (1.0, 3.0, "com"), infsupdec (2.1, 4.0, "com"))){1}, decorationpart (infsupdec (2.1, 3.0, "trv")){1})); %!test %! assert (isequal (intersect (infsupdec (1.0, 3.0, "dac"), infsupdec (3.0, 4.0, "def")), infsupdec (3.0, 3.0, "trv"))); %! assert (isequal (decorationpart (intersect (infsupdec (1.0, 3.0, "dac"), infsupdec (3.0, 4.0, "def"))){1}, decorationpart (infsupdec (3.0, 3.0, "trv")){1})); %!test %! assert (isequal (intersect (infsupdec (1.0, 3.0, "def"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (intersect (infsupdec (1.0, 3.0, "def"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (intersect (infsupdec (entire, "def"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (intersect (infsupdec (entire, "def"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (intersect (infsupdec (1.0, 3.0, "dac"), infsupdec (entire, "def")), infsupdec (1.0, 3.0, "trv"))); %! assert (isequal (decorationpart (intersect (infsupdec (1.0, 3.0, "dac"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (1.0, 3.0, "trv")){1})); ## minimal_convexHull_test %!test %! assert (isequal (union (infsup (1.0, 3.0), infsup (2.1, 4.0)), infsup (1.0, 4.0))); %!test %! assert (isequal (union (infsup (1.0, 1.0), infsup (2.1, 4.0)), infsup (1.0, 4.0))); %!test %! assert (isequal (union (infsup (1.0, 3.0), infsup), infsup (1.0, 3.0))); %!test %! assert (isequal (union (infsup, infsup), infsup)); %!test %! assert (isequal (union (infsup (1.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); ## minimal_convexHull_dec_test %!test %! assert (isequal (union (infsupdec (1.0, 3.0, "trv"), infsupdec (2.1, 4.0, "trv")), infsupdec (1.0, 4.0, "trv"))); %! assert (isequal (decorationpart (union (infsupdec (1.0, 3.0, "trv"), infsupdec (2.1, 4.0, "trv"))){1}, decorationpart (infsupdec (1.0, 4.0, "trv")){1})); %!test %! assert (isequal (union (infsupdec (1.0, 1.0, "trv"), infsupdec (2.1, 4.0, "trv")), infsupdec (1.0, 4.0, "trv"))); %! assert (isequal (decorationpart (union (infsupdec (1.0, 1.0, "trv"), infsupdec (2.1, 4.0, "trv"))){1}, decorationpart (infsupdec (1.0, 4.0, "trv")){1})); %!test %! assert (isequal (union (infsupdec (1.0, 3.0, "trv"), infsupdec (empty, "trv")), infsupdec (1.0, 3.0, "trv"))); %! assert (isequal (decorationpart (union (infsupdec (1.0, 3.0, "trv"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (1.0, 3.0, "trv")){1})); %!test %! assert (isequal (union (infsupdec (empty, "trv"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (union (infsupdec (empty, "trv"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (union (infsupdec (1.0, 3.0, "trv"), infsupdec (entire, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (union (infsupdec (1.0, 3.0, "trv"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); interval-2.1.0/inst/test/c-xsc.tst0000644000175000017500000005232013031037013016416 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/c-xsc.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 1990-2000 Institut fuer Angewandte Mathematik, ## Universitaet Karlsruhe, Germany ## 2000-2014 Wiss. Rechnen/Softwaretechnologie ## Universitaet Wuppertal, Germany ## Copyright 2015-2016 Oliver Heimlich ## ## Origin: unit tests in C-XSC version 2.5.4, Original license: LGPLv2+ ## Converted into portable ITL format by Oliver Heimlich. ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## cxsc.intervaladdsub %!# Tests A+B, B+A, A-B, B-A, -A, +A %!test %! assert (isequal (infsup (10.0, 20.0) + infsup (13.0, 17.0), infsup (23.0, 37.0))); %! assert (isequal (plus (infsup (10.0, 20.0), infsup (13.0, 17.0)), infsup (23.0, 37.0))); %!test %! assert (isequal (infsup (13.0, 17.0) + infsup (10.0, 20.0), infsup (23.0, 37.0))); %! assert (isequal (plus (infsup (13.0, 17.0), infsup (10.0, 20.0)), infsup (23.0, 37.0))); %!test %! assert (isequal (infsup (10.0, 20.0) - infsup (13.0, 16.0), infsup (-6.0, 7.0))); %! assert (isequal (minus (infsup (10.0, 20.0), infsup (13.0, 16.0)), infsup (-6.0, 7.0))); %!test %! assert (isequal (infsup (13.0, 16.0) - infsup (10.0, 20.0), infsup (-7.0, 6.0))); %! assert (isequal (minus (infsup (13.0, 16.0), infsup (10.0, 20.0)), infsup (-7.0, 6.0))); %!test %! assert (isequal (-infsup (10.0, 20.0), infsup (-20.0, -10.0))); %! assert (isequal (uminus (infsup (10.0, 20.0)), infsup (-20.0, -10.0))); %!test %! assert (isequal (+infsup (10.0, 20.0), infsup (10.0, 20.0))); %! assert (isequal (uplus (infsup (10.0, 20.0)), infsup (10.0, 20.0))); ## cxsc.intervalmuldiv %!# Tests A*B, B*A, A/B, B/A %!test %! assert (isequal (infsup (1.0, 2.0) .* infsup (3.0, 4.0), infsup (3.0, 8.0))); %! assert (isequal (times (infsup (1.0, 2.0), infsup (3.0, 4.0)), infsup (3.0, 8.0))); %!test %! assert (isequal (infsup (-1.0, 2.0) .* infsup (3.0, 4.0), infsup (-4.0, 8.0))); %! assert (isequal (times (infsup (-1.0, 2.0), infsup (3.0, 4.0)), infsup (-4.0, 8.0))); %!test %! assert (isequal (infsup (-2.0, 1.0) .* infsup (3.0, 4.0), infsup (-8.0, 4.0))); %! assert (isequal (times (infsup (-2.0, 1.0), infsup (3.0, 4.0)), infsup (-8.0, 4.0))); %!test %! assert (isequal (infsup (-2.0, -1.0) .* infsup (3.0, 4.0), infsup (-8.0, -3.0))); %! assert (isequal (times (infsup (-2.0, -1.0), infsup (3.0, 4.0)), infsup (-8.0, -3.0))); %!test %! assert (isequal (infsup (1.0, 2.0) .* infsup (-3.0, 4.0), infsup (-6.0, 8.0))); %! assert (isequal (times (infsup (1.0, 2.0), infsup (-3.0, 4.0)), infsup (-6.0, 8.0))); %!test %! assert (isequal (infsup (-1.0, 2.0) .* infsup (-3.0, 4.0), infsup (-6.0, 8.0))); %! assert (isequal (times (infsup (-1.0, 2.0), infsup (-3.0, 4.0)), infsup (-6.0, 8.0))); %!test %! assert (isequal (infsup (-2.0, 1.0) .* infsup (-3.0, 4.0), infsup (-8.0, 6.0))); %! assert (isequal (times (infsup (-2.0, 1.0), infsup (-3.0, 4.0)), infsup (-8.0, 6.0))); %!test %! assert (isequal (infsup (-2.0, -1.0) .* infsup (-3.0, 4.0), infsup (-8.0, 6.0))); %! assert (isequal (times (infsup (-2.0, -1.0), infsup (-3.0, 4.0)), infsup (-8.0, 6.0))); %!test %! assert (isequal (infsup (1.0, 2.0) .* infsup (-4.0, 3.0), infsup (-8.0, 6.0))); %! assert (isequal (times (infsup (1.0, 2.0), infsup (-4.0, 3.0)), infsup (-8.0, 6.0))); %!test %! assert (isequal (infsup (-1.0, 2.0) .* infsup (-4.0, 3.0), infsup (-8.0, 6.0))); %! assert (isequal (times (infsup (-1.0, 2.0), infsup (-4.0, 3.0)), infsup (-8.0, 6.0))); %!test %! assert (isequal (infsup (-2.0, 1.0) .* infsup (-4.0, 3.0), infsup (-6.0, 8.0))); %! assert (isequal (times (infsup (-2.0, 1.0), infsup (-4.0, 3.0)), infsup (-6.0, 8.0))); %!test %! assert (isequal (infsup (-2.0, -1.0) .* infsup (-4.0, 3.0), infsup (-6.0, 8.0))); %! assert (isequal (times (infsup (-2.0, -1.0), infsup (-4.0, 3.0)), infsup (-6.0, 8.0))); %!test %! assert (isequal (infsup (1.0, 2.0) .* infsup (-4.0, -3.0), infsup (-8.0, -3.0))); %! assert (isequal (times (infsup (1.0, 2.0), infsup (-4.0, -3.0)), infsup (-8.0, -3.0))); %!test %! assert (isequal (infsup (-1.0, 2.0) .* infsup (-4.0, -3.0), infsup (-8.0, 4.0))); %! assert (isequal (times (infsup (-1.0, 2.0), infsup (-4.0, -3.0)), infsup (-8.0, 4.0))); %!test %! assert (isequal (infsup (-2.0, -1.0) .* infsup (-4.0, -3.0), infsup (3.0, 8.0))); %! assert (isequal (times (infsup (-2.0, -1.0), infsup (-4.0, -3.0)), infsup (3.0, 8.0))); %!test %! assert (isequal (infsup (1.0, 2.0) ./ infsup (4.0, 8.0), infsup (0.125, 0.5))); %! assert (isequal (rdivide (infsup (1.0, 2.0), infsup (4.0, 8.0)), infsup (0.125, 0.5))); %!test %! assert (isequal (infsup (-1.0, 2.0) ./ infsup (4.0, 8.0), infsup (-0.25, 0.5))); %! assert (isequal (rdivide (infsup (-1.0, 2.0), infsup (4.0, 8.0)), infsup (-0.25, 0.5))); %!test %! assert (isequal (infsup (-2.0, 1.0) ./ infsup (4.0, 8.0), infsup (-0.5, 0.25))); %! assert (isequal (rdivide (infsup (-2.0, 1.0), infsup (4.0, 8.0)), infsup (-0.5, 0.25))); %!test %! assert (isequal (infsup (-2.0, -1.0) ./ infsup (4.0, 8.0), infsup (-0.5, -0.125))); %! assert (isequal (rdivide (infsup (-2.0, -1.0), infsup (4.0, 8.0)), infsup (-0.5, -0.125))); %!test %! assert (isequal (infsup (1.0, 2.0) ./ infsup (-4.0, 8.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (1.0, 2.0), infsup (-4.0, 8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, 2.0) ./ infsup (-4.0, 8.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-1.0, 2.0), infsup (-4.0, 8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-2.0, 1.0) ./ infsup (-4.0, 8.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-2.0, 1.0), infsup (-4.0, 8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-2.0, -1.0) ./ infsup (-4.0, 8.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-2.0, -1.0), infsup (-4.0, 8.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (1.0, 2.0) ./ infsup (-8.0, 4.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (1.0, 2.0), infsup (-8.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, 2.0) ./ infsup (-8.0, 4.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-1.0, 2.0), infsup (-8.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-2.0, 1.0) ./ infsup (-8.0, 4.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-2.0, 1.0), infsup (-8.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-2.0, -1.0) ./ infsup (-8.0, 4.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-2.0, -1.0), infsup (-8.0, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (1.0, 2.0) ./ infsup (-8.0, -4.0), infsup (-0.5, -0.125))); %! assert (isequal (rdivide (infsup (1.0, 2.0), infsup (-8.0, -4.0)), infsup (-0.5, -0.125))); %!test %! assert (isequal (infsup (-1.0, 2.0) ./ infsup (-8.0, -4.0), infsup (-0.5, 0.25))); %! assert (isequal (rdivide (infsup (-1.0, 2.0), infsup (-8.0, -4.0)), infsup (-0.5, 0.25))); %!test %! assert (isequal (infsup (-2.0, 1.0) ./ infsup (-8.0, -4.0), infsup (-0.25, 0.5))); %! assert (isequal (rdivide (infsup (-2.0, 1.0), infsup (-8.0, -4.0)), infsup (-0.25, 0.5))); %!test %! assert (isequal (infsup (-2.0, -1.0) ./ infsup (-8.0, -4.0), infsup (0.125, 0.5))); %! assert (isequal (rdivide (infsup (-2.0, -1.0), infsup (-8.0, -4.0)), infsup (0.125, 0.5))); ## cxsc.intervalsetops %!# Tests A|B, B|A, A&B, B&A %!test %! assert (isequal (union (infsup (-2.0, 2.0), infsup (-4.0, -3.0)), infsup (-4.0, 2.0))); %!test %! assert (isequal (union (infsup (-2.0, 2.0), infsup (-4.0, -1.0)), infsup (-4.0, 2.0))); %!test %! assert (isequal (union (infsup (-2.0, 2.0), infsup (-4.0, 4.0)), infsup (-4.0, 4.0))); %!test %! assert (isequal (union (infsup (-2.0, 2.0), infsup (-1.0, 1.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (union (infsup (-2.0, 2.0), infsup (1.0, 4.0)), infsup (-2.0, 4.0))); %!test %! assert (isequal (union (infsup (-2.0, 2.0), infsup (3.0, 4.0)), infsup (-2.0, 4.0))); %!test %! assert (isequal (union (infsup (-4.0, -3.0), infsup (-2.0, 2.0)), infsup (-4.0, 2.0))); %!test %! assert (isequal (union (infsup (-4.0, -1.0), infsup (-2.0, 2.0)), infsup (-4.0, 2.0))); %!test %! assert (isequal (union (infsup (-4.0, 4.0), infsup (-2.0, 2.0)), infsup (-4.0, 4.0))); %!test %! assert (isequal (union (infsup (-1.0, 1.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (union (infsup (1.0, 4.0), infsup (-2.0, 2.0)), infsup (-2.0, 4.0))); %!test %! assert (isequal (union (infsup (3.0, 4.0), infsup (-2.0, 2.0)), infsup (-2.0, 4.0))); %!test %! assert (isequal (intersect (infsup (-2.0, 2.0), infsup (-4.0, -3.0)), infsup)); %!test %! assert (isequal (intersect (infsup (-2.0, 2.0), infsup (-4.0, -1.0)), infsup (-2.0, -1.0))); %!test %! assert (isequal (intersect (infsup (-2.0, 2.0), infsup (-4.0, 4.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (intersect (infsup (-2.0, 2.0), infsup (-1.0, 1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (intersect (infsup (-2.0, 2.0), infsup (1.0, 4.0)), infsup (1.0, 2.0))); %!test %! assert (isequal (intersect (infsup (-2.0, 2.0), infsup (3.0, 4.0)), infsup)); %!test %! assert (isequal (intersect (infsup (-4.0, -3.0), infsup (-2.0, 2.0)), infsup)); %!test %! assert (isequal (intersect (infsup (-4.0, -1.0), infsup (-2.0, 2.0)), infsup (-2.0, -1.0))); %!test %! assert (isequal (intersect (infsup (-4.0, 4.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (intersect (infsup (-1.0, 1.0), infsup (-2.0, 2.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (intersect (infsup (1.0, 4.0), infsup (-2.0, 2.0)), infsup (1.0, 2.0))); %!test %! assert (isequal (intersect (infsup (3.0, 4.0), infsup (-2.0, 2.0)), infsup)); ## cxsc.intervalmixsetops %!# Tests A|B, B|A, A&B, B&A, B is scalar-type %!test %! assert (isequal (union (infsup (-2.0, 2.0), infsup (-4.0, -4.0)), infsup (-4.0, 2.0))); %!test %! assert (isequal (union (infsup (-2.0, 2.0), infsup (1.0, 1.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (union (infsup (-2.0, 2.0), infsup (4.0, 4.0)), infsup (-2.0, 4.0))); %!test %! assert (isequal (union (infsup (-4.0, -4.0), infsup (-2.0, 2.0)), infsup (-4.0, 2.0))); %!test %! assert (isequal (union (infsup (1.0, 1.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (union (infsup (4.0, 4.0), infsup (-2.0, 2.0)), infsup (-2.0, 4.0))); %!test %! assert (isequal (intersect (infsup (-2.0, 2.0), infsup (-4.0, -4.0)), infsup)); %!test %! assert (isequal (intersect (infsup (-2.0, 2.0), infsup (1.0, 1.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (intersect (infsup (-2.0, 2.0), infsup (4.0, 4.0)), infsup)); %!test %! assert (isequal (intersect (infsup (-4.0, -4.0), infsup (-2.0, 2.0)), infsup)); %!test %! assert (isequal (intersect (infsup (1.0, 1.0), infsup (-2.0, 2.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (intersect (infsup (4.0, 4.0), infsup (-2.0, 2.0)), infsup)); ## cxsc.scalarmixsetops %!# Tests A|B, B|A, A and B are scalar-type %!test %! assert (isequal (union (infsup (-2.0, -2.0), infsup (-4.0, -4.0)), infsup (-4.0, -2.0))); %!test %! assert (isequal (union (infsup (-2.0, -2.0), infsup (-2.0, -2.0)), infsup (-2.0, -2.0))); %!test %! assert (isequal (union (infsup (-2.0, -2.0), infsup (2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (union (infsup (-4.0, -4.0), infsup (-2.0, -2.0)), infsup (-4.0, -2.0))); %!test %! assert (isequal (union (infsup (-2.0, -2.0), infsup (-2.0, -2.0)), infsup (-2.0, -2.0))); %!test %! assert (isequal (union (infsup (2.0, 2.0), infsup (-2.0, -2.0)), infsup (-2.0, 2.0))); ## cxsc.intervalsetcompops %!# Tests AB, A<=B, A>=B, A==B %!test %! assert (isequal (interior (infsup (-1.0, 2.0), infsup (-1.0, 2.0)), false)); %!test %! assert (interior (infsup (-2.0, 1.0), infsup (-3.0, 2.0))); %!test %! assert (isequal (interior (infsup (-2.0, 2.0), infsup (-1.0, 1.0)), false)); %!test %! assert (isequal (interior (infsup (-2.0, 2.0), infsup (-1.0, 2.0)), false)); %!test %! assert (isequal (interior (infsup (-2.0, 2.0), infsup (-2.0, 1.0)), false)); %!test %! assert (isequal (interior (infsup (-2.0, 2.0), infsup (-2.0, 3.0)), false)); %!test %! assert (isequal (interior (infsup (-2.0, 2.0), infsup (-3.0, 2.0)), false)); %!test %! assert (isequal (interior (infsup (-1.0, 2.0), infsup (-1.0, 2.0)), false)); %!test %! assert (isequal (interior (infsup (-3.0, 2.0), infsup (-2.0, 1.0)), false)); %!test %! assert (interior (infsup (-1.0, 1.0), infsup (-2.0, 2.0))); %!test %! assert (isequal (interior (infsup (-1.0, 2.0), infsup (-2.0, 2.0)), false)); %!test %! assert (isequal (interior (infsup (-2.0, 1.0), infsup (-2.0, 2.0)), false)); %!test %! assert (isequal (interior (infsup (-2.0, 3.0), infsup (-2.0, 2.0)), false)); %!test %! assert (isequal (interior (infsup (-3.0, 2.0), infsup (-2.0, 2.0)), false)); %!test %! assert (subset (infsup (-1.0, 2.0), infsup (-1.0, 2.0))); %!test %! assert (subset (infsup (-2.0, 1.0), infsup (-3.0, 2.0))); %!test %! assert (isequal (subset (infsup (-2.0, 2.0), infsup (-1.0, 1.0)), false)); %!test %! assert (isequal (subset (infsup (-2.0, 2.0), infsup (-1.0, 2.0)), false)); %!test %! assert (isequal (subset (infsup (-2.0, 2.0), infsup (-2.0, 1.0)), false)); %!test %! assert (subset (infsup (-2.0, 2.0), infsup (-2.0, 3.0))); %!test %! assert (subset (infsup (-2.0, 2.0), infsup (-3.0, 2.0))); %!test %! assert (isequal (subset (infsup (-3.0, 2.0), infsup (-2.0, 1.0)), false)); %!test %! assert (subset (infsup (-1.0, 1.0), infsup (-2.0, 2.0))); %!test %! assert (subset (infsup (-1.0, 2.0), infsup (-2.0, 2.0))); %!test %! assert (subset (infsup (-2.0, 1.0), infsup (-2.0, 2.0))); %!test %! assert (isequal (subset (infsup (-2.0, 3.0), infsup (-2.0, 2.0)), false)); %!test %! assert (isequal (subset (infsup (-3.0, 2.0), infsup (-2.0, 2.0)), false)); %!test %! assert (eq (infsup (-1.0, 2.0), infsup (-1.0, 2.0))); %! assert (infsup (-1.0, 2.0) == infsup (-1.0, 2.0)); %!test %! assert (isequal (eq (infsup (-2.0, 1.0), infsup (-3.0, 2.0)), false)); %! assert (isequal (infsup (-2.0, 1.0) == infsup (-3.0, 2.0), false)); %!test %! assert (isequal (eq (infsup (-2.0, 2.0), infsup (-1.0, 1.0)), false)); %! assert (isequal (infsup (-2.0, 2.0) == infsup (-1.0, 1.0), false)); %!test %! assert (isequal (eq (infsup (-2.0, 2.0), infsup (-1.0, 2.0)), false)); %! assert (isequal (infsup (-2.0, 2.0) == infsup (-1.0, 2.0), false)); %!test %! assert (isequal (eq (infsup (-2.0, 2.0), infsup (-2.0, 1.0)), false)); %! assert (isequal (infsup (-2.0, 2.0) == infsup (-2.0, 1.0), false)); %!test %! assert (isequal (eq (infsup (-2.0, 2.0), infsup (-2.0, 3.0)), false)); %! assert (isequal (infsup (-2.0, 2.0) == infsup (-2.0, 3.0), false)); %!test %! assert (isequal (eq (infsup (-2.0, 2.0), infsup (-3.0, 2.0)), false)); %! assert (isequal (infsup (-2.0, 2.0) == infsup (-3.0, 2.0), false)); ## cxsc.intervalscalarsetcompops %!# Tests AB, A<=B, A>=B, A==B, BA, B<=A, B>=A, B==A, where B is scalar %!test %! assert (isequal (interior (infsup (-1.0, 2.0), infsup (-2.0, -2.0)), false)); %!test %! assert (isequal (interior (infsup (-2.0, 2.0), infsup (-2.0, -2.0)), false)); %!test %! assert (isequal (interior (infsup (-2.0, 2.0), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (interior (infsup (-2.0, 2.0), infsup (2.0, 2.0)), false)); %!test %! assert (isequal (interior (infsup (-2.0, 2.0), infsup (3.0, 3.0)), false)); %!test %! assert (isequal (interior (infsup (-1.0, -1.0), infsup (1.0, 1.0)), false)); %!test %! assert (isequal (interior (infsup (-1.0, -1.0), infsup (-1.0, -1.0)), false)); %!test %! assert (isequal (interior (infsup (-2.0, -2.0), infsup (-1.0, 2.0)), false)); %!test %! assert (isequal (interior (infsup (-2.0, -2.0), infsup (-2.0, 2.0)), false)); %!test %! assert (interior (infsup (0.0, 0.0), infsup (-2.0, 2.0))); %!test %! assert (isequal (interior (infsup (2.0, 2.0), infsup (-2.0, 2.0)), false)); %!test %! assert (isequal (interior (infsup (3.0, 3.0), infsup (-2.0, 2.0)), false)); %!test %! assert (isequal (interior (infsup (1.0, 1.0), infsup (-1.0, -1.0)), false)); %!test %! assert (isequal (interior (infsup (-1.0, -1.0), infsup (-1.0, -1.0)), false)); %!test %! assert (isequal (subset (infsup (-1.0, 2.0), infsup (-2.0, -2.0)), false)); %!test %! assert (isequal (subset (infsup (-2.0, 2.0), infsup (-2.0, -2.0)), false)); %!test %! assert (isequal (subset (infsup (-2.0, 2.0), infsup (0.0, 0.0)), false)); %!test %! assert (isequal (subset (infsup (-2.0, 2.0), infsup (2.0, 2.0)), false)); %!test %! assert (isequal (subset (infsup (-2.0, 2.0), infsup (3.0, 3.0)), false)); %!test %! assert (isequal (subset (infsup (-1.0, -1.0), infsup (1.0, 1.0)), false)); %!test %! assert (subset (infsup (-1.0, -1.0), infsup (-1.0, -1.0))); %!test %! assert (isequal (subset (infsup (-2.0, -2.0), infsup (-1.0, 2.0)), false)); %!test %! assert (subset (infsup (-2.0, -2.0), infsup (-2.0, 2.0))); %!test %! assert (subset (infsup (0.0, 0.0), infsup (-2.0, 2.0))); %!test %! assert (subset (infsup (2.0, 2.0), infsup (-2.0, 2.0))); %!test %! assert (isequal (subset (infsup (3.0, 3.0), infsup (-2.0, 2.0)), false)); %!test %! assert (isequal (subset (infsup (1.0, 1.0), infsup (-1.0, -1.0)), false)); %!test %! assert (subset (infsup (-1.0, -1.0), infsup (-1.0, -1.0))); %!test %! assert (isequal (eq (infsup (-1.0, 2.0), infsup (-2.0, -2.0)), false)); %! assert (isequal (infsup (-1.0, 2.0) == infsup (-2.0, -2.0), false)); %!test %! assert (isequal (eq (infsup (-2.0, 2.0), infsup (-2.0, -2.0)), false)); %! assert (isequal (infsup (-2.0, 2.0) == infsup (-2.0, -2.0), false)); %!test %! assert (isequal (eq (infsup (-2.0, 2.0), infsup (0.0, 0.0)), false)); %! assert (isequal (infsup (-2.0, 2.0) == infsup (0.0, 0.0), false)); %!test %! assert (isequal (eq (infsup (-2.0, 2.0), infsup (2.0, 2.0)), false)); %! assert (isequal (infsup (-2.0, 2.0) == infsup (2.0, 2.0), false)); %!test %! assert (isequal (eq (infsup (-2.0, 2.0), infsup (3.0, 3.0)), false)); %! assert (isequal (infsup (-2.0, 2.0) == infsup (3.0, 3.0), false)); %!test %! assert (isequal (eq (infsup (-1.0, -1.0), infsup (1.0, 1.0)), false)); %! assert (isequal (infsup (-1.0, -1.0) == infsup (1.0, 1.0), false)); %!test %! assert (eq (infsup (-1.0, -1.0), infsup (-1.0, -1.0))); %! assert (infsup (-1.0, -1.0) == infsup (-1.0, -1.0)); ## cxsc.intervalstdfunc %!test %! assert (isequal (pown (infsup (11.0, 11.0), 2), infsup (121.0, 121.0))); %! assert (isequal (infsup (11.0, 11.0) .^ 2, infsup (121.0, 121.0))); %! assert (isequal (power (infsup (11.0, 11.0), 2), infsup (121.0, 121.0))); %! assert (isequal (infsup (11.0, 11.0) ^ 2, infsup (121.0, 121.0))); %! assert (isequal (mpower (infsup (11.0, 11.0), 2), infsup (121.0, 121.0))); %!test %! assert (isequal (pown (infsup (0.0, 0.0), 2), infsup (0.0, 0.0))); %! assert (isequal (infsup (0.0, 0.0) .^ 2, infsup (0.0, 0.0))); %! assert (isequal (power (infsup (0.0, 0.0), 2), infsup (0.0, 0.0))); %! assert (isequal (infsup (0.0, 0.0) ^ 2, infsup (0.0, 0.0))); %! assert (isequal (mpower (infsup (0.0, 0.0), 2), infsup (0.0, 0.0))); %!test %! assert (isequal (pown (infsup (-9.0, -9.0), 2), infsup (81.0, 81.0))); %! assert (isequal (infsup (-9.0, -9.0) .^ 2, infsup (81.0, 81.0))); %! assert (isequal (power (infsup (-9.0, -9.0), 2), infsup (81.0, 81.0))); %! assert (isequal (infsup (-9.0, -9.0) ^ 2, infsup (81.0, 81.0))); %! assert (isequal (mpower (infsup (-9.0, -9.0), 2), infsup (81.0, 81.0))); %!test %! assert (isequal (realsqrt (infsup (121.0, 121.0)), infsup (11.0, 11.0))); %!test %! assert (isequal (realsqrt (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (realsqrt (infsup (81.0, 81.0)), infsup (9.0, 9.0))); %!test %! assert (isequal (nthroot (infsup (27.0, 27.0), 3), infsup (3.0, 3.0))); %!test %! assert (isequal (nthroot (infsup (0.0, 0.0), 4), infsup (0.0, 0.0))); %!test %! assert (isequal (nthroot (infsup (1024.0, 1024.0), 10), infsup (2.0, 2.0))); %!test %! assert (isequal (pow (infsup (2.0, 2.0), infsup (2.0, 2.0)), infsup (4.0, 4.0))); %!test %! assert (isequal (pow (infsup (4.0, 4.0), infsup (5.0, 5.0)), infsup (1024.0, 1024.0))); %!# Negativ geht noch nicht %!test %! assert (isequal (pow (infsup (2.0, 2.0), infsup (3.0, 3.0)), infsup (8.0, 8.0))); interval-2.1.0/inst/test/libieeep1788_tests_rev.tst0000644000175000017500000044300613031037013021612 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/libieeep1788_tests_rev.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) ## Copyright 2015-2016 Oliver Heimlich ## ## Original author: Marco Nehmeier (unit tests in libieeep1788, ## original license: Apache License 2.0) ## Converted into portable ITL format by Oliver Heimlich with minor corrections. ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## minimal_sqrRev_test %!test %! assert (isequal (sqrrev (infsup), infsup)); %!test %! assert (isequal (sqrrev (infsup (-10.0, -1.0)), infsup)); %!test %! assert (isequal (sqrrev (infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (sqrrev (infsup (0.0, 1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sqrrev (infsup (-0.5, 1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sqrrev (infsup (-1000.0, 1.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sqrrev (infsup (0.0, 25.0)), infsup (-5.0, 5.0))); %!test %! assert (isequal (sqrrev (infsup (-1.0, 25.0)), infsup (-5.0, 5.0))); %!test %! assert (isequal (sqrrev (infsup (1.000000000000000021e-02, 1.000000000000000194e-02)), infsup (-1.000000000000000194e-01, 1.000000000000000194e-01))); %!test %! assert (isequal (sqrrev (infsup (0.0, 3.999999999999986233e+00)), infsup (-1.999999999999996669e+00, 1.999999999999996669e+00))); ## minimal_sqrRevBin_test %!test %! assert (isequal (sqrrev (infsup, infsup (-5.0, 1.0)), infsup)); %!test %! assert (isequal (sqrrev (infsup (-10.0, -1.0), infsup (-5.0, 1.0)), infsup)); %!test %! assert (isequal (sqrrev (infsup (0.0, inf), infsup (-5.0, 1.0)), infsup (-5.0, 1.0))); %!test %! assert (isequal (sqrrev (infsup (0.0, 1.0), infsup (-0.1, 1.0)), infsup (-0.1, 1.0))); %!test %! assert (isequal (sqrrev (infsup (-0.5, 1.0), infsup (-0.1, 1.0)), infsup (-0.1, 1.0))); %!test %! assert (isequal (sqrrev (infsup (-1000.0, 1.0), infsup (-0.1, 1.0)), infsup (-0.1, 1.0))); %!test %! assert (isequal (sqrrev (infsup (0.0, 25.0), infsup (-4.1, 6.0)), infsup (-4.1, 5.0))); %!test %! assert (isequal (sqrrev (infsup (-1.0, 25.0), infsup (-4.1, 7.0)), infsup (-4.1, 5.0))); %!test %! assert (isequal (sqrrev (infsup (1.0, 25.0), infsup (0.0, 7.0)), infsup (1.0, 5.0))); %!test %! assert (isequal (sqrrev (infsup (1.000000000000000021e-02, 1.000000000000000194e-02), infsup (-0.1, inf)), infsup (-0.1, 1.000000000000000194e-01))); %!test %! assert (isequal (sqrrev (infsup (0.0, 3.999999999999986233e+00), infsup (-0.1, inf)), infsup (-0.1, 1.999999999999996669e+00))); ## minimal_sqrRev_dec_test %!test %! assert (isequal (sqrrev (infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (-10.0, -1.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (-10.0, -1.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (0.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (0.0, 1.0, "def")), infsupdec (-1.0, 1.0, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (0.0, 1.0, "def"))){1}, decorationpart (infsupdec (-1.0, 1.0, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (-0.5, 1.0, "dac")), infsupdec (-1.0, 1.0, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (-0.5, 1.0, "dac"))){1}, decorationpart (infsupdec (-1.0, 1.0, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (-1000.0, 1.0, "com")), infsupdec (-1.0, 1.0, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (-1000.0, 1.0, "com"))){1}, decorationpart (infsupdec (-1.0, 1.0, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (0.0, 25.0, "def")), infsupdec (-5.0, 5.0, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (0.0, 25.0, "def"))){1}, decorationpart (infsupdec (-5.0, 5.0, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (-1.0, 25.0, "dac")), infsupdec (-5.0, 5.0, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (-1.0, 25.0, "dac"))){1}, decorationpart (infsupdec (-5.0, 5.0, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "com")), infsupdec (-1.000000000000000194e-01, 1.000000000000000194e-01, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "com"))){1}, decorationpart (infsupdec (-1.000000000000000194e-01, 1.000000000000000194e-01, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (0.0, 3.999999999999986233e+00, "def")), infsupdec (-1.999999999999996669e+00, 1.999999999999996669e+00, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (0.0, 3.999999999999986233e+00, "def"))){1}, decorationpart (infsupdec (-1.999999999999996669e+00, 1.999999999999996669e+00, "trv")){1})); ## minimal_sqrRev_dec_bin_test %!test %! assert (isequal (sqrrev (infsupdec (empty, "trv"), infsupdec (-5.0, 1.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (empty, "trv"), infsupdec (-5.0, 1.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (-10.0, -1.0, "com"), infsupdec (-5.0, 1.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (-10.0, -1.0, "com"), infsupdec (-5.0, 1.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (0.0, inf, "def"), infsupdec (-5.0, 1.0, "dac")), infsupdec (-5.0, 1.0, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (0.0, inf, "def"), infsupdec (-5.0, 1.0, "dac"))){1}, decorationpart (infsupdec (-5.0, 1.0, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (0.0, 1.0, "dac"), infsupdec (-0.1, 1.0, "def")), infsupdec (-0.1, 1.0, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (0.0, 1.0, "dac"), infsupdec (-0.1, 1.0, "def"))){1}, decorationpart (infsupdec (-0.1, 1.0, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (-0.5, 1.0, "def"), infsupdec (-0.1, 1.0, "dac")), infsupdec (-0.1, 1.0, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (-0.5, 1.0, "def"), infsupdec (-0.1, 1.0, "dac"))){1}, decorationpart (infsupdec (-0.1, 1.0, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (-1000.0, 1.0, "com"), infsupdec (-0.1, 1.0, "def")), infsupdec (-0.1, 1.0, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (-1000.0, 1.0, "com"), infsupdec (-0.1, 1.0, "def"))){1}, decorationpart (infsupdec (-0.1, 1.0, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (0.0, 25.0, "def"), infsupdec (-4.1, 6.0, "com")), infsupdec (-4.1, 5.0, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (0.0, 25.0, "def"), infsupdec (-4.1, 6.0, "com"))){1}, decorationpart (infsupdec (-4.1, 5.0, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (-1.0, 25.0, "dac"), infsupdec (-4.1, 7.0, "def")), infsupdec (-4.1, 5.0, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (-1.0, 25.0, "dac"), infsupdec (-4.1, 7.0, "def"))){1}, decorationpart (infsupdec (-4.1, 5.0, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (1.0, 25.0, "dac"), infsupdec (0.0, 7.0, "def")), infsupdec (1.0, 5.0, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (1.0, 25.0, "dac"), infsupdec (0.0, 7.0, "def"))){1}, decorationpart (infsupdec (1.0, 5.0, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "def"), infsupdec (-0.1, inf, "dac")), infsupdec (-0.1, 1.000000000000000194e-01, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "def"), infsupdec (-0.1, inf, "dac"))){1}, decorationpart (infsupdec (-0.1, 1.000000000000000194e-01, "trv")){1})); %!test %! assert (isequal (sqrrev (infsupdec (0.0, 3.999999999999986233e+00, "dac"), infsupdec (-0.1, inf, "dac")), infsupdec (-0.1, 1.999999999999996669e+00, "trv"))); %! assert (isequal (decorationpart (sqrrev (infsupdec (0.0, 3.999999999999986233e+00, "dac"), infsupdec (-0.1, inf, "dac"))){1}, decorationpart (infsupdec (-0.1, 1.999999999999996669e+00, "trv")){1})); ## minimal_absRev_test %!test %! assert (isequal (absrev (infsup), infsup)); %!test %! assert (isequal (absrev (infsup (-1.1, -0.4)), infsup)); %!test %! assert (isequal (absrev (infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (absrev (infsup (1.1, 2.1)), infsup (-2.1, 2.1))); %!test %! assert (isequal (absrev (infsup (-1.1, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (absrev (infsup (-1.1, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (absrev (infsup (-1.9, 0.2)), infsup (-0.2, 0.2))); %!test %! assert (isequal (absrev (infsup (0.0, 0.2)), infsup (-0.2, 0.2))); %!test %! assert (isequal (absrev (infsup (-1.5, inf)), infsup (-inf, inf))); ## minimal_absRevBin_test %!test %! assert (isequal (absrev (infsup, infsup (-1.1, 5.0)), infsup)); %!test %! assert (isequal (absrev (infsup (-1.1, -0.4), infsup (-1.1, 5.0)), infsup)); %!test %! assert (isequal (absrev (infsup (0.0, inf), infsup (-1.1, 5.0)), infsup (-1.1, 5.0))); %!test %! assert (isequal (absrev (infsup (1.1, 2.1), infsup (-1.0, 5.0)), infsup (1.1, 2.1))); %!test %! assert (isequal (absrev (infsup (-1.1, 2.0), infsup (-1.1, 5.0)), infsup (-1.1, 2.0))); %!test %! assert (isequal (absrev (infsup (-1.1, 0.0), infsup (-1.1, 5.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (absrev (infsup (-1.9, 0.2), infsup (-1.1, 5.0)), infsup (-0.2, 0.2))); ## minimal_absRev_dec_test %!test %! assert (isequal (absrev (infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (-1.1, -0.4, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (-1.1, -0.4, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (0.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (1.1, 2.1, "com")), infsupdec (-2.1, 2.1, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (1.1, 2.1, "com"))){1}, decorationpart (infsupdec (-2.1, 2.1, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (-1.1, 2.0, "def")), infsupdec (-2.0, 2.0, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (-1.1, 2.0, "def"))){1}, decorationpart (infsupdec (-2.0, 2.0, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (-1.1, 0.0, "dac")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (-1.1, 0.0, "dac"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (-1.9, 0.2, "com")), infsupdec (-0.2, 0.2, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (-1.9, 0.2, "com"))){1}, decorationpart (infsupdec (-0.2, 0.2, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (0.0, 0.2, "def")), infsupdec (-0.2, 0.2, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (0.0, 0.2, "def"))){1}, decorationpart (infsupdec (-0.2, 0.2, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (-1.5, inf, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (-1.5, inf, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); ## minimal_absRev_dec_bin_test %!test %! assert (isequal (absrev (infsupdec (empty, "trv"), infsupdec (-1.1, 5.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (empty, "trv"), infsupdec (-1.1, 5.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (-1.1, -0.4, "dac"), infsupdec (-1.1, 5.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (-1.1, -0.4, "dac"), infsupdec (-1.1, 5.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (0.0, inf, "def"), infsupdec (-1.1, 5.0, "def")), infsupdec (-1.1, 5.0, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (0.0, inf, "def"), infsupdec (-1.1, 5.0, "def"))){1}, decorationpart (infsupdec (-1.1, 5.0, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (1.1, 2.1, "dac"), infsupdec (-1.0, 5.0, "def")), infsupdec (1.1, 2.1, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (1.1, 2.1, "dac"), infsupdec (-1.0, 5.0, "def"))){1}, decorationpart (infsupdec (1.1, 2.1, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (-1.1, 2.0, "com"), infsupdec (-1.1, 5.0, "def")), infsupdec (-1.1, 2.0, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (-1.1, 2.0, "com"), infsupdec (-1.1, 5.0, "def"))){1}, decorationpart (infsupdec (-1.1, 2.0, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (-1.1, 0.0, "def"), infsupdec (-1.1, 5.0, "def")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (-1.1, 0.0, "def"), infsupdec (-1.1, 5.0, "def"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (absrev (infsupdec (-1.9, 0.2, "dac"), infsupdec (-1.1, 5.0, "def")), infsupdec (-0.2, 0.2, "trv"))); %! assert (isequal (decorationpart (absrev (infsupdec (-1.9, 0.2, "dac"), infsupdec (-1.1, 5.0, "def"))){1}, decorationpart (infsupdec (-0.2, 0.2, "trv")){1})); ## minimal_pownRev_test %!test %! assert (isequal (pownrev (infsup, 0), infsup)); %!test %! assert (isequal (pownrev (infsup (1.0, 1.0), 0), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (-1.0, 5.0), 0), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (-1.0, 0.0), 0), infsup)); %!test %! assert (isequal (pownrev (infsup (-1.0, -0.0), 0), infsup)); %!test %! assert (isequal (pownrev (infsup (1.1, 10.0), 0), infsup)); %!test %! assert (isequal (pownrev (infsup, 1), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, inf), 1), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), 1), infsup (0.0, 0.0))); %!test %! assert (isequal (pownrev (infsup (-0.0, -0.0), 1), infsup (0.0, 0.0))); %!test %! assert (isequal (pownrev (infsup (13.1, 13.1), 1), infsup (13.1, 13.1))); %!test %! assert (isequal (pownrev (infsup (-7451.145, -7451.145), 1), infsup (-7451.145, -7451.145))); %!test %! assert (isequal (pownrev (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), 1), infsup (1.797693134862315708e+308, 1.797693134862315708e+308))); %!test %! assert (isequal (pownrev (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), 1), infsup (-1.797693134862315708e+308, -1.797693134862315708e+308))); %!test %! assert (isequal (pownrev (infsup (0.0, inf), 1), infsup (0.0, inf))); %!test %! assert (isequal (pownrev (infsup (-0.0, inf), 1), infsup (0.0, inf))); %!test %! assert (isequal (pownrev (infsup (-inf, 0.0), 1), infsup (-inf, 0.0))); %!test %! assert (isequal (pownrev (infsup (-inf, -0.0), 1), infsup (-inf, 0.0))); %!test %! assert (isequal (pownrev (infsup (-324.3, 2.5), 1), infsup (-324.3, 2.5))); %!test %! assert (isequal (pownrev (infsup (0.01, 2.33), 1), infsup (0.01, 2.33))); %!test %! assert (isequal (pownrev (infsup (-1.9, -0.33), 1), infsup (-1.9, -0.33))); %!test %! assert (isequal (pownrev (infsup, 2), infsup)); %!test %! assert (isequal (pownrev (infsup (-5.0, -1.0), 2), infsup)); %!test %! assert (isequal (pownrev (infsup (0.0, inf), 2), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (-0.0, inf), 2), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), 2), infsup (0.0, 0.0))); %!test %! assert (isequal (pownrev (infsup (-0.0, -0.0), 2), infsup (0.0, 0.0))); %!test %! assert (isequal (pownrev (infsup (1.716099999999999852e+02, 1.716100000000000136e+02), 2), infsup (-1.310000000000000142e+01, 1.310000000000000142e+01))); %!test %! assert (isequal (pownrev (infsup (5.551956181102500111e+07, 5.551956181102500856e+07), 2), infsup (-7.451145000000001346e+03, 7.451145000000001346e+03))); %!test %! assert (isequal (pownrev (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), 2), infsup (-1.340780792994259710e+154, 1.340780792994259710e+154))); %!test %! assert (isequal (pownrev (infsup (0.0, 1.051704900000000198e+05), 2), infsup (-3.243000000000000682e+02, 3.243000000000000682e+02))); %!test %! assert (isequal (pownrev (infsup (-0.0, 1.051704900000000198e+05), 2), infsup (-3.243000000000000682e+02, 3.243000000000000682e+02))); %!test %! assert (isequal (pownrev (infsup (9.999999999999999124e-05, 5.428900000000000503e+00), 2), infsup (-2.330000000000000515e+00, 2.330000000000000515e+00))); %!test %! assert (isequal (pownrev (infsup (1.088999999999999968e-01, 3.609999999999999876e+00), 2), infsup (-1.900000000000000133e+00, 1.900000000000000133e+00))); %!test %! assert (isequal (pownrev (infsup, 8), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, inf), 8), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (0.0, inf), 8), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (-0.0, inf), 8), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), 8), infsup (0.0, 0.0))); %!test %! assert (isequal (pownrev (infsup (-0.0, -0.0), 8), infsup (0.0, 0.0))); %!test %! assert (isequal (pownrev (infsup (8.673020346900621653e+08, 8.673020346900622845e+08), 8), infsup (-1.310000000000000142e+01, 1.310000000000000142e+01))); %!test %! assert (isequal (pownrev (infsup (9.501323805961964567e+30, 9.501323805961965692e+30), 8), infsup (-7.451145000000001346e+03, 7.451145000000001346e+03))); %!test %! assert (isequal (pownrev (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), 8), infsup (-3.402823669209384635e+38, 3.402823669209384635e+38))); %!test %! assert (isequal (pownrev (infsup (0.0, 1.223420037986718843e+20), 8), infsup (-3.243000000000000682e+02, 3.243000000000000682e+02))); %!test %! assert (isequal (pownrev (infsup (-0.0, 1.223420037986718843e+20), 8), infsup (-3.243000000000000682e+02, 3.243000000000000682e+02))); %!test %! assert (isequal (pownrev (infsup (1.000000000000000102e-16, 8.686550888106663706e+02), 8), infsup (-2.330000000000000515e+00, 2.330000000000000515e+00))); %!test %! assert (isequal (pownrev (infsup (1.406408618241000491e-04, 1.698356304099999647e+02), 8), infsup (-1.900000000000000133e+00, 1.900000000000000133e+00))); %!test %! assert (isequal (pownrev (infsup, 3), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, inf), 3), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), 3), infsup (0.0, 0.0))); %!test %! assert (isequal (pownrev (infsup (-0.0, -0.0), 3), infsup (0.0, 0.0))); %!test %! assert (isequal (pownrev (infsup (2.248090999999999440e+03, 2.248090999999999894e+03), 3), infsup (1.309999999999999787e+01, 1.310000000000000142e+01))); %!test %! assert (isequal (pownrev (infsup (-4.136843053904099731e+11, -4.136843053904099121e+11), 3), infsup (-7.451145000000001346e+03, -7.451144999999999527e+03))); %!test %! assert (isequal (pownrev (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), 3), infsup (5.643803094122361304e+102, 5.643803094122362298e+102))); %!test %! assert (isequal (pownrev (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), 3), infsup (-5.643803094122362298e+102, -5.643803094122361304e+102))); %!test %! assert (isequal (pownrev (infsup (0.0, inf), 3), infsup (0.0, inf))); %!test %! assert (isequal (pownrev (infsup (-0.0, inf), 3), infsup (0.0, inf))); %!test %! assert (isequal (pownrev (infsup (-inf, 0.0), 3), infsup (-inf, 0.0))); %!test %! assert (isequal (pownrev (infsup (-inf, -0.0), 3), infsup (-inf, 0.0))); %!test %! assert (isequal (pownrev (infsup (-3.410678990700000525e+07, 1.562500000000000000e+01), 3), infsup (-3.243000000000000682e+02, 2.500000000000000000e+00))); %!test %! assert (isequal (pownrev (infsup (9.999999999999999547e-07, 1.264933700000000272e+01), 3), infsup (9.999999999999998473e-03, 2.330000000000000515e+00))); %!test %! assert (isequal (pownrev (infsup (-6.858999999999999098e+00, -3.593700000000000366e-02), 3), infsup (-1.900000000000000133e+00, -3.299999999999999600e-01))); %!test %! assert (isequal (pownrev (infsup, 7), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, inf), 7), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), 7), infsup (0.0, 0.0))); %!test %! assert (isequal (pownrev (infsup (-0.0, -0.0), 7), infsup (0.0, 0.0))); %!test %! assert (isequal (pownrev (infsup (6.620626219008108228e+07, 6.620626219008108974e+07), 7), infsup (1.309999999999999787e+01, 1.310000000000000142e+01))); %!test %! assert (isequal (pownrev (infsup (-1.275149497957960280e+27, -1.275149497957960005e+27), 7), infsup (-7.451145000000001346e+03, -7.451144999999999527e+03))); %!test %! assert (isequal (pownrev (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), 7), infsup (1.087396515837748951e+44, 1.087396515837749149e+44))); %!test %! assert (isequal (pownrev (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), 7), infsup (-1.087396515837749149e+44, -1.087396515837748951e+44))); %!test %! assert (isequal (pownrev (infsup (0.0, inf), 7), infsup (0.0, inf))); %!test %! assert (isequal (pownrev (infsup (-0.0, inf), 7), infsup (0.0, inf))); %!test %! assert (isequal (pownrev (infsup (-inf, 0.0), 7), infsup (-inf, 0.0))); %!test %! assert (isequal (pownrev (infsup (-inf, -0.0), 7), infsup (-inf, 0.0))); %!test %! assert (isequal (pownrev (infsup (-3.772494720896449920e+17, 6.103515625000000000e+02), 7), infsup (-3.243000000000000682e+02, 2.500000000000000000e+00))); %!test %! assert (isequal (pownrev (infsup (9.999999999999999988e-15, 3.728133428371958757e+02), 7), infsup (9.999999999999998473e-03, 2.330000000000000515e+00))); %!test %! assert (isequal (pownrev (infsup (-8.938717389999997920e+01, -4.261844297700001028e-04), 7), infsup (-1.900000000000000133e+00, -3.299999999999999600e-01))); %!test %! assert (isequal (pownrev (infsup, -2), infsup)); %!test %! assert (isequal (pownrev (infsup (0.0, inf), -2), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (-0.0, inf), -2), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), -2), infsup)); %!test %! assert (isequal (pownrev (infsup (-0.0, -0.0), -2), infsup)); %!test %! assert (isequal (pownrev (infsup (-10.0, 0.0), -2), infsup)); %!test %! assert (isequal (pownrev (infsup (-10.0, -0.0), -2), infsup)); %!test %! assert (isequal (pownrev (infsup (5.827166249053085390e-03, 5.827166249053086257e-03), -2), infsup (-1.310000000000000142e+01, 1.310000000000000142e+01))); %!test %! assert (isequal (pownrev (infsup (1.801166953377180740e-08, 1.801166953377181071e-08), -2), infsup (-7.451145000000001346e+03, 7.451145000000001346e+03))); %!test %! assert (isequal (pownrev (infsup (0.000000000000000000e+00, 4.940656458412465442e-324), -2), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (9.508370646556841917e-06, inf), -2), infsup (-3.243000000000000682e+02, 3.243000000000000682e+02))); %!test %! assert (isequal (pownrev (infsup (1.841993774061043421e-01, 1.000000000000000000e+04), -2), infsup (-2.330000000000000515e+00, 2.330000000000000515e+00))); %!test %! assert (isequal (pownrev (infsup (2.770083102493074989e-01, 9.182736455463727410e+00), -2), infsup (-1.900000000000000133e+00, 1.900000000000000133e+00))); %!test %! assert (isequal (pownrev (infsup, -8), infsup)); %!test %! assert (isequal (pownrev (infsup (0.0, inf), -8), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (-0.0, inf), -8), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), -8), infsup)); %!test %! assert (isequal (pownrev (infsup (-0.0, -0.0), -8), infsup)); %!test %! assert (isequal (pownrev (infsup (1.153000869365374417e-09, 1.153000869365374624e-09), -8), infsup (-1.310000000000000142e+01, 1.310000000000000142e+01))); %!test %! assert (isequal (pownrev (infsup (1.052484917283328578e-31, 1.052484917283328797e-31), -8), infsup (-7.451145000000001346e+03, 7.451145000000001346e+03))); %!test %! assert (isequal (pownrev (infsup (0.000000000000000000e+00, 4.940656458412465442e-324), -8), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (8.173807596331487643e-21, inf), -8), infsup (-3.243000000000000682e+02, 3.243000000000000682e+02))); %!test %! assert (isequal (pownrev (infsup (1.151204906160357110e-03, 1.000000000000000000e+16), -8), infsup (-2.330000000000000515e+00, 2.330000000000000515e+00))); %!test %! assert (isequal (pownrev (infsup (5.888045974722156024e-03, 7.110309102419345436e+03), -8), infsup (-1.900000000000000133e+00, 1.900000000000000133e+00))); %!test %! assert (isequal (pownrev (infsup, -1), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, inf), -1), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), -1), infsup)); %!test %! assert (isequal (pownrev (infsup (-0.0, -0.0), -1), infsup)); %!test %! assert (isequal (pownrev (infsup (7.633587786259540819e-02, 7.633587786259542207e-02), -1), infsup (1.309999999999999787e+01, 1.310000000000000320e+01))); %!test %! assert (isequal (pownrev (infsup (-1.342075613882161712e-04, -1.342075613882161441e-04), -1), infsup (-7.451145000000002256e+03, -7.451144999999999527e+03))); %!test %! assert (isequal (pownrev (infsup (5.562684646268003458e-309, 5.562684646268008398e-309), -1), infsup (1.797693134862314311e+308, inf))); %!test %! assert (isequal (pownrev (infsup (-5.562684646268008398e-309, -5.562684646268003458e-309), -1), infsup (-inf, -1.797693134862314311e+308))); %!test %! assert (isequal (pownrev (infsup (0.0, inf), -1), infsup (0.0, inf))); %!test %! assert (isequal (pownrev (infsup (-0.0, inf), -1), infsup (0.0, inf))); %!test %! assert (isequal (pownrev (infsup (-inf, 0.0), -1), infsup (-inf, 0.0))); %!test %! assert (isequal (pownrev (infsup (-inf, -0.0), -1), infsup (-inf, 0.0))); %!test %! assert (isequal (pownrev (infsup (4.291845493562231328e-01, 1.000000000000000000e+02), -1), infsup (9.999999999999998473e-03, 2.330000000000000515e+00))); %!test %! assert (isequal (pownrev (infsup (-3.030303030303030276e+00, -5.263157894736841813e-01), -1), infsup (-1.900000000000000133e+00, -3.299999999999999600e-01))); %!test %! assert (isequal (pownrev (infsup, -3), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, inf), -3), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), -3), infsup)); %!test %! assert (isequal (pownrev (infsup (-0.0, -0.0), -3), infsup)); %!test %! assert (isequal (pownrev (infsup (4.448218510727546177e-04, 4.448218510727546720e-04), -3), infsup (1.309999999999999787e+01, 1.310000000000000142e+01))); %!test %! assert (isequal (pownrev (infsup (-2.417302244657943502e-12, -2.417302244657943098e-12), -3), infsup (-7.451145000000001346e+03, -7.451144999999999527e+03))); %!test %! assert (isequal (pownrev (infsup (0.000000000000000000e+00, 4.940656458412465442e-324), -3), infsup (5.871356456934583070e+107, inf))); %!test %! assert (isequal (pownrev (infsup (-4.940656458412465442e-324, -0.000000000000000000e+00), -3), infsup (-inf, -5.871356456934583070e+107))); %!test %! assert (isequal (pownrev (infsup (0.0, inf), -3), infsup (0.0, inf))); %!test %! assert (isequal (pownrev (infsup (-0.0, inf), -3), infsup (0.0, inf))); %!test %! assert (isequal (pownrev (infsup (-inf, 0.0), -3), infsup (-inf, 0.0))); %!test %! assert (isequal (pownrev (infsup (-inf, -0.0), -3), infsup (-inf, 0.0))); %!test %! assert (isequal (pownrev (infsup (7.905552678373577169e-02, 1.000000000000000000e+06), -3), infsup (9.999999999999998473e-03, 2.330000000000000515e+00))); %!test %! assert (isequal (pownrev (infsup (-2.782647410746584171e+01, -1.457938474996355316e-01), -3), infsup (-1.900000000000000133e+00, -3.299999999999999600e-01))); %!test %! assert (isequal (pownrev (infsup, -7), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, inf), -7), infsup (-inf, inf))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), -7), infsup)); %!test %! assert (isequal (pownrev (infsup (-0.0, -0.0), -7), infsup)); %!test %! assert (isequal (pownrev (infsup (1.510431138868640339e-08, 1.510431138868640670e-08), -7), infsup (1.309999999999999787e+01, 1.310000000000000142e+01))); %!test %! assert (isequal (pownrev (infsup (-7.842217728991088300e-28, -7.842217728991087403e-28), -7), infsup (-7.451145000000001346e+03, -7.451144999999999527e+03))); %!test %! assert (isequal (pownrev (infsup (0.000000000000000000e+00, 4.940656458412465442e-324), -7), infsup (1.536746355637629315e+46, inf))); %!test %! assert (isequal (pownrev (infsup (-4.940656458412465442e-324, -0.000000000000000000e+00), -7), infsup (-inf, -1.536746355637629315e+46))); %!test %! assert (isequal (pownrev (infsup (0.0, inf), -7), infsup (0.0, inf))); %!test %! assert (isequal (pownrev (infsup (-0.0, inf), -7), infsup (0.0, inf))); %!test %! assert (isequal (pownrev (infsup (-inf, 0.0), -7), infsup (-inf, 0.0))); %!test %! assert (isequal (pownrev (infsup (-inf, -0.0), -7), infsup (-inf, 0.0))); %!test %! assert (isequal (pownrev (infsup (2.682307431353632161e-03, 1.000000000000000000e+14), -7), infsup (9.999999999999998473e-03, 2.330000000000000515e+00))); %!test %! assert (isequal (pownrev (infsup (-2.346402003798384158e+03, -1.118728735197209619e-02), -7), infsup (-1.900000000000000133e+00, -3.299999999999999600e-01))); ## minimal_pownRevBin_test %!test %! assert (isequal (pownrev (infsup, infsup (1.0, 1.0), 0), infsup)); %!test %! assert (isequal (pownrev (infsup (1.0, 1.0), infsup (1.0, 1.0), 0), infsup (1.0, 1.0))); %!test %! assert (isequal (pownrev (infsup (-1.0, 5.0), infsup (-51.0, 12.0), 0), infsup (-51.0, 12.0))); %!test %! assert (isequal (pownrev (infsup (-1.0, 0.0), infsup (5.0, 10.0), 0), infsup)); %!test %! assert (isequal (pownrev (infsup (-1.0, -0.0), infsup (-1.0, 1.0), 0), infsup)); %!test %! assert (isequal (pownrev (infsup (1.1, 10.0), infsup (1.0, 41.0), 0), infsup)); %!test %! assert (isequal (pownrev (infsup, infsup (0.0, 100.1), 1), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, inf), infsup (-5.1, 10.0), 1), infsup (-5.1, 10.0))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), infsup (-10.0, 5.1), 1), infsup (0.0, 0.0))); %!test %! assert (isequal (pownrev (infsup (-0.0, -0.0), infsup (1.0, 5.0), 1), infsup)); %!test %! assert (isequal (pownrev (infsup, infsup (5.0, 17.1), 2), infsup)); %!test %! assert (isequal (pownrev (infsup (-5.0, -1.0), infsup (5.0, 17.1), 2), infsup)); %!test %! assert (isequal (pownrev (infsup (0.0, inf), infsup (5.6, 27.544), 2), infsup (5.6, 27.544))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), infsup (1.0, 2.0), 2), infsup)); %!test %! assert (isequal (pownrev (infsup (9.999999999999999124e-05, 5.428900000000000503e+00), infsup (1.0, inf), 2), infsup (1.0, 2.330000000000000515e+00))); %!test %! assert (isequal (pownrev (infsup (1.088999999999999968e-01, 3.609999999999999876e+00), infsup (-inf, -1.0), 2), infsup (-1.900000000000000133e+00, -1.0))); %!test %! assert (isequal (pownrev (infsup, infsup (-23.0, -1.0), 3), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, inf), infsup (-23.0, -1.0), 3), infsup (-23.0, -1.0))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), infsup (1.0, 2.0), 3), infsup)); %!test %! assert (isequal (pownrev (infsup (9.999999999999999547e-07, 1.264933700000000272e+01), infsup (1.0, inf), 3), infsup (1.0, 2.330000000000000515e+00))); %!test %! assert (isequal (pownrev (infsup (-6.858999999999999098e+00, -3.593700000000000366e-02), infsup (-inf, -1.0), 3), infsup (-1.900000000000000133e+00, -1.0))); %!test %! assert (isequal (pownrev (infsup, infsup (-3.0, 17.3), -2), infsup)); %!test %! assert (isequal (pownrev (infsup (0.0, inf), infsup (-5.1, -0.1), -2), infsup (-5.1, -0.1))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), infsup (27.2, 55.1), -2), infsup)); %!test %! assert (isequal (pownrev (infsup (9.508370646556841917e-06, inf), infsup (-inf, -1.797693134862315708e+308), -2), infsup)); %!test %! assert (isequal (pownrev (infsup (1.841993774061043421e-01, 1.000000000000000000e+04), infsup (1.0, inf), -2), infsup (1.0, 2.330000000000000515e+00))); %!test %! assert (isequal (pownrev (infsup (2.770083102493074989e-01, 9.182736455463727410e+00), infsup (-inf, -1.0), -2), infsup (-1.900000000000000133e+00, -1.0))); %!test %! assert (isequal (pownrev (infsup, infsup (-5.1, 55.5), -1), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, inf), infsup (-5.1, 55.5), -1), infsup (-5.1, 55.5))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), infsup (-5.1, 55.5), -1), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, -0.0), infsup (-1.0, 1.0), -1), infsup (-1.0, 0.0))); %!test %! assert (isequal (pownrev (infsup (4.291845493562231328e-01, 1.000000000000000000e+02), infsup (-1.0, 0.0), -1), infsup)); %!test %! assert (isequal (pownrev (infsup, infsup (-5.1, 55.5), -3), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, inf), infsup (-5.1, 55.5), -3), infsup (-5.1, 55.5))); %!test %! assert (isequal (pownrev (infsup (0.0, 0.0), infsup (-5.1, 55.5), -3), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, 0.0), infsup (5.1, 55.5), -3), infsup)); %!test %! assert (isequal (pownrev (infsup (-inf, -0.0), infsup (-32.0, 1.1), -3), infsup (-32.0, 0.0))); ## minimal_pownRev_dec_test %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), 0), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), 0)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.0, 1.0, "com"), 0), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.0, 1.0, "com"), 0)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-1.0, 5.0, "dac"), 0), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-1.0, 5.0, "dac"), 0)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-1.0, 0.0, "def"), 0), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-1.0, 0.0, "def"), 0)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-1.0, -0.0, "dac"), 0), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-1.0, -0.0, "dac"), 0)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.1, 10.0, "com"), 0), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.1, 10.0, "com"), 0)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), 1), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), 1)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (entire, "def"), 1), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (entire, "def"), 1)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "com"), 1), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "com"), 1)){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, -0.0, "dac"), 1), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, -0.0, "dac"), 1)){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (13.1, 13.1, "def"), 1), infsupdec (13.1, 13.1, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (13.1, 13.1, "def"), 1)){1}, decorationpart (infsupdec (13.1, 13.1, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-7451.145, -7451.145, "dac"), 1), infsupdec (-7451.145, -7451.145, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-7451.145, -7451.145, "dac"), 1)){1}, decorationpart (infsupdec (-7451.145, -7451.145, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "com"), 1), infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "com"), 1)){1}, decorationpart (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-1.797693134862315708e+308, -1.797693134862315708e+308, "com"), 1), infsupdec (-1.797693134862315708e+308, -1.797693134862315708e+308, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-1.797693134862315708e+308, -1.797693134862315708e+308, "com"), 1)){1}, decorationpart (infsupdec (-1.797693134862315708e+308, -1.797693134862315708e+308, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, inf, "dac"), 1), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, inf, "dac"), 1)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, inf, "dac"), 1), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, inf, "dac"), 1)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, 0.0, "def"), 1), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, 0.0, "def"), 1)){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, -0.0, "def"), 1), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, -0.0, "def"), 1)){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-324.3, 2.5, "dac"), 1), infsupdec (-324.3, 2.5, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-324.3, 2.5, "dac"), 1)){1}, decorationpart (infsupdec (-324.3, 2.5, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.01, 2.33, "com"), 1), infsupdec (0.01, 2.33, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.01, 2.33, "com"), 1)){1}, decorationpart (infsupdec (0.01, 2.33, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-1.9, -0.33, "def"), 1), infsupdec (-1.9, -0.33, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-1.9, -0.33, "def"), 1)){1}, decorationpart (infsupdec (-1.9, -0.33, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), 2), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), 2)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, inf, "dac"), 2), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, inf, "dac"), 2)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, inf, "def"), 2), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, inf, "def"), 2)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "com"), 2), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "com"), 2)){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, -0.0, "dac"), 2), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, -0.0, "dac"), 2)){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.716099999999999852e+02, 1.716100000000000136e+02, "def"), 2), infsupdec (-1.310000000000000142e+01, 1.310000000000000142e+01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.716099999999999852e+02, 1.716100000000000136e+02, "def"), 2)){1}, decorationpart (infsupdec (-1.310000000000000142e+01, 1.310000000000000142e+01, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (5.551956181102500111e+07, 5.551956181102500856e+07, "def"), 2), infsupdec (-7.451145000000001346e+03, 7.451145000000001346e+03, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (5.551956181102500111e+07, 5.551956181102500856e+07, "def"), 2)){1}, decorationpart (infsupdec (-7.451145000000001346e+03, 7.451145000000001346e+03, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "dac"), 2), infsupdec (-1.340780792994259710e+154, 1.340780792994259710e+154, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "dac"), 2)){1}, decorationpart (infsupdec (-1.340780792994259710e+154, 1.340780792994259710e+154, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 1.051704900000000198e+05, "dac"), 2), infsupdec (-3.243000000000000682e+02, 3.243000000000000682e+02, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 1.051704900000000198e+05, "dac"), 2)){1}, decorationpart (infsupdec (-3.243000000000000682e+02, 3.243000000000000682e+02, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, 1.051704900000000198e+05, "def"), 2), infsupdec (-3.243000000000000682e+02, 3.243000000000000682e+02, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, 1.051704900000000198e+05, "def"), 2)){1}, decorationpart (infsupdec (-3.243000000000000682e+02, 3.243000000000000682e+02, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (9.999999999999999124e-05, 5.428900000000000503e+00, "com"), 2), infsupdec (-2.330000000000000515e+00, 2.330000000000000515e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (9.999999999999999124e-05, 5.428900000000000503e+00, "com"), 2)){1}, decorationpart (infsupdec (-2.330000000000000515e+00, 2.330000000000000515e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.088999999999999968e-01, 3.609999999999999876e+00, "def"), 2), infsupdec (-1.900000000000000133e+00, 1.900000000000000133e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.088999999999999968e-01, 3.609999999999999876e+00, "def"), 2)){1}, decorationpart (infsupdec (-1.900000000000000133e+00, 1.900000000000000133e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), 8), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), 8)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (entire, "def"), 8), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (entire, "def"), 8)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, inf, "dac"), 8), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, inf, "dac"), 8)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, inf, "dac"), 8), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, inf, "dac"), 8)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "def"), 8), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "def"), 8)){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, -0.0, "dac"), 8), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, -0.0, "dac"), 8)){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (8.673020346900621653e+08, 8.673020346900622845e+08, "com"), 8), infsupdec (-1.310000000000000142e+01, 1.310000000000000142e+01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (8.673020346900621653e+08, 8.673020346900622845e+08, "com"), 8)){1}, decorationpart (infsupdec (-1.310000000000000142e+01, 1.310000000000000142e+01, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (9.501323805961964567e+30, 9.501323805961965692e+30, "dac"), 8), infsupdec (-7.451145000000001346e+03, 7.451145000000001346e+03, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (9.501323805961964567e+30, 9.501323805961965692e+30, "dac"), 8)){1}, decorationpart (infsupdec (-7.451145000000001346e+03, 7.451145000000001346e+03, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "def"), 8), infsupdec (-3.402823669209384635e+38, 3.402823669209384635e+38, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "def"), 8)){1}, decorationpart (infsupdec (-3.402823669209384635e+38, 3.402823669209384635e+38, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 1.223420037986718843e+20, "dac"), 8), infsupdec (-3.243000000000000682e+02, 3.243000000000000682e+02, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 1.223420037986718843e+20, "dac"), 8)){1}, decorationpart (infsupdec (-3.243000000000000682e+02, 3.243000000000000682e+02, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, 1.223420037986718843e+20, "def"), 8), infsupdec (-3.243000000000000682e+02, 3.243000000000000682e+02, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, 1.223420037986718843e+20, "def"), 8)){1}, decorationpart (infsupdec (-3.243000000000000682e+02, 3.243000000000000682e+02, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.000000000000000102e-16, 8.686550888106663706e+02, "com"), 8), infsupdec (-2.330000000000000515e+00, 2.330000000000000515e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.000000000000000102e-16, 8.686550888106663706e+02, "com"), 8)){1}, decorationpart (infsupdec (-2.330000000000000515e+00, 2.330000000000000515e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.406408618241000491e-04, 1.698356304099999647e+02, "dac"), 8), infsupdec (-1.900000000000000133e+00, 1.900000000000000133e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.406408618241000491e-04, 1.698356304099999647e+02, "dac"), 8)){1}, decorationpart (infsupdec (-1.900000000000000133e+00, 1.900000000000000133e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), 3), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), 3)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (entire, "def"), 3), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (entire, "def"), 3)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "dac"), 3), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "dac"), 3)){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, -0.0, "def"), 3), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, -0.0, "def"), 3)){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (2.248090999999999440e+03, 2.248090999999999894e+03, "com"), 3), infsupdec (1.309999999999999787e+01, 1.310000000000000142e+01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (2.248090999999999440e+03, 2.248090999999999894e+03, "com"), 3)){1}, decorationpart (infsupdec (1.309999999999999787e+01, 1.310000000000000142e+01, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-4.136843053904099731e+11, -4.136843053904099121e+11, "def"), 3), infsupdec (-7.451145000000001346e+03, -7.451144999999999527e+03, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-4.136843053904099731e+11, -4.136843053904099121e+11, "def"), 3)){1}, decorationpart (infsupdec (-7.451145000000001346e+03, -7.451144999999999527e+03, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "dac"), 3), infsupdec (5.643803094122361304e+102, 5.643803094122362298e+102, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "dac"), 3)){1}, decorationpart (infsupdec (5.643803094122361304e+102, 5.643803094122362298e+102, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-1.797693134862315708e+308, -1.797693134862315708e+308, "com"), 3), infsupdec (-5.643803094122362298e+102, -5.643803094122361304e+102, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-1.797693134862315708e+308, -1.797693134862315708e+308, "com"), 3)){1}, decorationpart (infsupdec (-5.643803094122362298e+102, -5.643803094122361304e+102, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, inf, "def"), 3), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, inf, "def"), 3)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, inf, "def"), 3), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, inf, "def"), 3)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, 0.0, "dac"), 3), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, 0.0, "dac"), 3)){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, -0.0, "def"), 3), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, -0.0, "def"), 3)){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-3.410678990700000525e+07, 1.562500000000000000e+01, "com"), 3), infsupdec (-3.243000000000000682e+02, 2.500000000000000000e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-3.410678990700000525e+07, 1.562500000000000000e+01, "com"), 3)){1}, decorationpart (infsupdec (-3.243000000000000682e+02, 2.500000000000000000e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (9.999999999999999547e-07, 1.264933700000000272e+01, "dac"), 3), infsupdec (9.999999999999998473e-03, 2.330000000000000515e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (9.999999999999999547e-07, 1.264933700000000272e+01, "dac"), 3)){1}, decorationpart (infsupdec (9.999999999999998473e-03, 2.330000000000000515e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-6.858999999999999098e+00, -3.593700000000000366e-02, "def"), 3), infsupdec (-1.900000000000000133e+00, -3.299999999999999600e-01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-6.858999999999999098e+00, -3.593700000000000366e-02, "def"), 3)){1}, decorationpart (infsupdec (-1.900000000000000133e+00, -3.299999999999999600e-01, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), 7), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), 7)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (entire, "def"), 7), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (entire, "def"), 7)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "com"), 7), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "com"), 7)){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, -0.0, "dac"), 7), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, -0.0, "dac"), 7)){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (6.620626219008108228e+07, 6.620626219008108974e+07, "def"), 7), infsupdec (1.309999999999999787e+01, 1.310000000000000142e+01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (6.620626219008108228e+07, 6.620626219008108974e+07, "def"), 7)){1}, decorationpart (infsupdec (1.309999999999999787e+01, 1.310000000000000142e+01, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-1.275149497957960280e+27, -1.275149497957960005e+27, "dac"), 7), infsupdec (-7.451145000000001346e+03, -7.451144999999999527e+03, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-1.275149497957960280e+27, -1.275149497957960005e+27, "dac"), 7)){1}, decorationpart (infsupdec (-7.451145000000001346e+03, -7.451144999999999527e+03, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "com"), 7), infsupdec (1.087396515837748951e+44, 1.087396515837749149e+44, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "com"), 7)){1}, decorationpart (infsupdec (1.087396515837748951e+44, 1.087396515837749149e+44, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-1.797693134862315708e+308, -1.797693134862315708e+308, "def"), 7), infsupdec (-1.087396515837749149e+44, -1.087396515837748951e+44, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-1.797693134862315708e+308, -1.797693134862315708e+308, "def"), 7)){1}, decorationpart (infsupdec (-1.087396515837749149e+44, -1.087396515837748951e+44, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, inf, "dac"), 7), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, inf, "dac"), 7)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, inf, "dac"), 7), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, inf, "dac"), 7)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, 0.0, "def"), 7), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, 0.0, "def"), 7)){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, -0.0, "def"), 7), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, -0.0, "def"), 7)){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-3.772494720896449920e+17, 6.103515625000000000e+02, "dac"), 7), infsupdec (-3.243000000000000682e+02, 2.500000000000000000e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-3.772494720896449920e+17, 6.103515625000000000e+02, "dac"), 7)){1}, decorationpart (infsupdec (-3.243000000000000682e+02, 2.500000000000000000e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (9.999999999999999988e-15, 3.728133428371958757e+02, "com"), 7), infsupdec (9.999999999999998473e-03, 2.330000000000000515e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (9.999999999999999988e-15, 3.728133428371958757e+02, "com"), 7)){1}, decorationpart (infsupdec (9.999999999999998473e-03, 2.330000000000000515e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-8.938717389999997920e+01, -4.261844297700001028e-04, "def"), 7), infsupdec (-1.900000000000000133e+00, -3.299999999999999600e-01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-8.938717389999997920e+01, -4.261844297700001028e-04, "def"), 7)){1}, decorationpart (infsupdec (-1.900000000000000133e+00, -3.299999999999999600e-01, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), -2), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), -2)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, inf, "dac"), -2), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, inf, "dac"), -2)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, inf, "dac"), -2), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, inf, "dac"), -2)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "def"), -2), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "def"), -2)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, -0.0, "com"), -2), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, -0.0, "com"), -2)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-10.0, 0.0, "dac"), -2), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-10.0, 0.0, "dac"), -2)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-10.0, -0.0, "def"), -2), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-10.0, -0.0, "def"), -2)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (5.827166249053085390e-03, 5.827166249053086257e-03, "dac"), -2), infsupdec (-1.310000000000000142e+01, 1.310000000000000142e+01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (5.827166249053085390e-03, 5.827166249053086257e-03, "dac"), -2)){1}, decorationpart (infsupdec (-1.310000000000000142e+01, 1.310000000000000142e+01, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.801166953377180740e-08, 1.801166953377181071e-08, "def"), -2), infsupdec (-7.451145000000001346e+03, 7.451145000000001346e+03, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.801166953377180740e-08, 1.801166953377181071e-08, "def"), -2)){1}, decorationpart (infsupdec (-7.451145000000001346e+03, 7.451145000000001346e+03, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.000000000000000000e+00, 4.940656458412465442e-324, "com"), -2), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.000000000000000000e+00, 4.940656458412465442e-324, "com"), -2)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (9.508370646556841917e-06, inf, "dac"), -2), infsupdec (-3.243000000000000682e+02, 3.243000000000000682e+02, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (9.508370646556841917e-06, inf, "dac"), -2)){1}, decorationpart (infsupdec (-3.243000000000000682e+02, 3.243000000000000682e+02, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.841993774061043421e-01, 1.000000000000000000e+04, "def"), -2), infsupdec (-2.330000000000000515e+00, 2.330000000000000515e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.841993774061043421e-01, 1.000000000000000000e+04, "def"), -2)){1}, decorationpart (infsupdec (-2.330000000000000515e+00, 2.330000000000000515e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (2.770083102493074989e-01, 9.182736455463727410e+00, "com"), -2), infsupdec (-1.900000000000000133e+00, 1.900000000000000133e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (2.770083102493074989e-01, 9.182736455463727410e+00, "com"), -2)){1}, decorationpart (infsupdec (-1.900000000000000133e+00, 1.900000000000000133e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), -8), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), -8)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, inf, "def"), -8), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, inf, "def"), -8)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, inf, "dac"), -8), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, inf, "dac"), -8)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "def"), -8), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "def"), -8)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, -0.0, "dac"), -8), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, -0.0, "dac"), -8)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.153000869365374417e-09, 1.153000869365374624e-09, "com"), -8), infsupdec (-1.310000000000000142e+01, 1.310000000000000142e+01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.153000869365374417e-09, 1.153000869365374624e-09, "com"), -8)){1}, decorationpart (infsupdec (-1.310000000000000142e+01, 1.310000000000000142e+01, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.052484917283328578e-31, 1.052484917283328797e-31, "def"), -8), infsupdec (-7.451145000000001346e+03, 7.451145000000001346e+03, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.052484917283328578e-31, 1.052484917283328797e-31, "def"), -8)){1}, decorationpart (infsupdec (-7.451145000000001346e+03, 7.451145000000001346e+03, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.000000000000000000e+00, 4.940656458412465442e-324, "dac"), -8), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.000000000000000000e+00, 4.940656458412465442e-324, "dac"), -8)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (8.173807596331487643e-21, inf, "def"), -8), infsupdec (-3.243000000000000682e+02, 3.243000000000000682e+02, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (8.173807596331487643e-21, inf, "def"), -8)){1}, decorationpart (infsupdec (-3.243000000000000682e+02, 3.243000000000000682e+02, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.151204906160357110e-03, 1.000000000000000000e+16, "com"), -8), infsupdec (-2.330000000000000515e+00, 2.330000000000000515e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.151204906160357110e-03, 1.000000000000000000e+16, "com"), -8)){1}, decorationpart (infsupdec (-2.330000000000000515e+00, 2.330000000000000515e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (5.888045974722156024e-03, 7.110309102419345436e+03, "def"), -8), infsupdec (-1.900000000000000133e+00, 1.900000000000000133e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (5.888045974722156024e-03, 7.110309102419345436e+03, "def"), -8)){1}, decorationpart (infsupdec (-1.900000000000000133e+00, 1.900000000000000133e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), -1), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), -1)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (entire, "def"), -1), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (entire, "def"), -1)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "dac"), -1), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "dac"), -1)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, -0.0, "dac"), -1), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, -0.0, "dac"), -1)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (7.633587786259540819e-02, 7.633587786259542207e-02, "def"), -1), infsupdec (1.309999999999999787e+01, 1.310000000000000320e+01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (7.633587786259540819e-02, 7.633587786259542207e-02, "def"), -1)){1}, decorationpart (infsupdec (1.309999999999999787e+01, 1.310000000000000320e+01, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-1.342075613882161712e-04, -1.342075613882161441e-04, "dac"), -1), infsupdec (-7.451145000000002256e+03, -7.451144999999999527e+03, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-1.342075613882161712e-04, -1.342075613882161441e-04, "dac"), -1)){1}, decorationpart (infsupdec (-7.451145000000002256e+03, -7.451144999999999527e+03, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (5.562684646268003458e-309, 5.562684646268008398e-309, "dac"), -1), infsupdec (1.797693134862314311e+308, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (5.562684646268003458e-309, 5.562684646268008398e-309, "dac"), -1)){1}, decorationpart (infsupdec (1.797693134862314311e+308, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-5.562684646268008398e-309, -5.562684646268003458e-309, "def"), -1), infsupdec (-inf, -1.797693134862314311e+308, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-5.562684646268008398e-309, -5.562684646268003458e-309, "def"), -1)){1}, decorationpart (infsupdec (-inf, -1.797693134862314311e+308, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, inf, "dac"), -1), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, inf, "dac"), -1)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, inf, "dac"), -1), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, inf, "dac"), -1)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, 0.0, "dac"), -1), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, 0.0, "dac"), -1)){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, -0.0, "def"), -1), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, -0.0, "def"), -1)){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (4.291845493562231328e-01, 1.000000000000000000e+02, "com"), -1), infsupdec (9.999999999999998473e-03, 2.330000000000000515e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (4.291845493562231328e-01, 1.000000000000000000e+02, "com"), -1)){1}, decorationpart (infsupdec (9.999999999999998473e-03, 2.330000000000000515e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-3.030303030303030276e+00, -5.263157894736841813e-01, "com"), -1), infsupdec (-1.900000000000000133e+00, -3.299999999999999600e-01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-3.030303030303030276e+00, -5.263157894736841813e-01, "com"), -1)){1}, decorationpart (infsupdec (-1.900000000000000133e+00, -3.299999999999999600e-01, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), -3), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), -3)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (entire, "def"), -3), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (entire, "def"), -3)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "def"), -3), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "def"), -3)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, -0.0, "dac"), -3), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, -0.0, "dac"), -3)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (4.448218510727546177e-04, 4.448218510727546720e-04, "com"), -3), infsupdec (1.309999999999999787e+01, 1.310000000000000142e+01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (4.448218510727546177e-04, 4.448218510727546720e-04, "com"), -3)){1}, decorationpart (infsupdec (1.309999999999999787e+01, 1.310000000000000142e+01, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-2.417302244657943502e-12, -2.417302244657943098e-12, "def"), -3), infsupdec (-7.451145000000001346e+03, -7.451144999999999527e+03, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-2.417302244657943502e-12, -2.417302244657943098e-12, "def"), -3)){1}, decorationpart (infsupdec (-7.451145000000001346e+03, -7.451144999999999527e+03, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.000000000000000000e+00, 4.940656458412465442e-324, "dac"), -3), infsupdec (5.871356456934583070e+107, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.000000000000000000e+00, 4.940656458412465442e-324, "dac"), -3)){1}, decorationpart (infsupdec (5.871356456934583070e+107, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-4.940656458412465442e-324, -0.000000000000000000e+00, "def"), -3), infsupdec (-inf, -5.871356456934583070e+107, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-4.940656458412465442e-324, -0.000000000000000000e+00, "def"), -3)){1}, decorationpart (infsupdec (-inf, -5.871356456934583070e+107, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, inf, "dac"), -3), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, inf, "dac"), -3)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, inf, "dac"), -3), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, inf, "dac"), -3)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, 0.0, "def"), -3), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, 0.0, "def"), -3)){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, -0.0, "def"), -3), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, -0.0, "def"), -3)){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (7.905552678373577169e-02, 1.000000000000000000e+06, "com"), -3), infsupdec (9.999999999999998473e-03, 2.330000000000000515e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (7.905552678373577169e-02, 1.000000000000000000e+06, "com"), -3)){1}, decorationpart (infsupdec (9.999999999999998473e-03, 2.330000000000000515e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-2.782647410746584171e+01, -1.457938474996355316e-01, "def"), -3), infsupdec (-1.900000000000000133e+00, -3.299999999999999600e-01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-2.782647410746584171e+01, -1.457938474996355316e-01, "def"), -3)){1}, decorationpart (infsupdec (-1.900000000000000133e+00, -3.299999999999999600e-01, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), -7), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), -7)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (entire, "def"), -7), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (entire, "def"), -7)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "com"), -7), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "com"), -7)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, -0.0, "def"), -7), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, -0.0, "def"), -7)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.510431138868640339e-08, 1.510431138868640670e-08, "dac"), -7), infsupdec (1.309999999999999787e+01, 1.310000000000000142e+01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.510431138868640339e-08, 1.510431138868640670e-08, "dac"), -7)){1}, decorationpart (infsupdec (1.309999999999999787e+01, 1.310000000000000142e+01, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-7.842217728991088300e-28, -7.842217728991087403e-28, "dac"), -7), infsupdec (-7.451145000000001346e+03, -7.451144999999999527e+03, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-7.842217728991088300e-28, -7.842217728991087403e-28, "dac"), -7)){1}, decorationpart (infsupdec (-7.451145000000001346e+03, -7.451144999999999527e+03, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.000000000000000000e+00, 4.940656458412465442e-324, "def"), -7), infsupdec (1.536746355637629315e+46, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.000000000000000000e+00, 4.940656458412465442e-324, "def"), -7)){1}, decorationpart (infsupdec (1.536746355637629315e+46, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-4.940656458412465442e-324, -0.000000000000000000e+00, "def"), -7), infsupdec (-inf, -1.536746355637629315e+46, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-4.940656458412465442e-324, -0.000000000000000000e+00, "def"), -7)){1}, decorationpart (infsupdec (-inf, -1.536746355637629315e+46, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, inf, "dac"), -7), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, inf, "dac"), -7)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, inf, "def"), -7), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, inf, "def"), -7)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, 0.0, "dac"), -7), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, 0.0, "dac"), -7)){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, -0.0, "def"), -7), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, -0.0, "def"), -7)){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (2.682307431353632161e-03, 1.000000000000000000e+14, "com"), -7), infsupdec (9.999999999999998473e-03, 2.330000000000000515e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (2.682307431353632161e-03, 1.000000000000000000e+14, "com"), -7)){1}, decorationpart (infsupdec (9.999999999999998473e-03, 2.330000000000000515e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-2.346402003798384158e+03, -1.118728735197209619e-02, "com"), -7), infsupdec (-1.900000000000000133e+00, -3.299999999999999600e-01, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-2.346402003798384158e+03, -1.118728735197209619e-02, "com"), -7)){1}, decorationpart (infsupdec (-1.900000000000000133e+00, -3.299999999999999600e-01, "trv")){1})); ## minimal_pownRev_dec_bin_test %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), infsupdec (1.0, 1.0, "def"), 0), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), infsupdec (1.0, 1.0, "def"), 0)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.0, 1.0, "dac"), infsupdec (1.0, 1.0, "dac"), 0), infsupdec (1.0, 1.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.0, 1.0, "dac"), infsupdec (1.0, 1.0, "dac"), 0)){1}, decorationpart (infsupdec (1.0, 1.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-1.0, 5.0, "def"), infsupdec (-51.0, 12.0, "dac"), 0), infsupdec (-51.0, 12.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-1.0, 5.0, "def"), infsupdec (-51.0, 12.0, "dac"), 0)){1}, decorationpart (infsupdec (-51.0, 12.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-1.0, 0.0, "com"), infsupdec (5.0, 10.0, "dac"), 0), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-1.0, 0.0, "com"), infsupdec (5.0, 10.0, "dac"), 0)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-1.0, -0.0, "dac"), infsupdec (-1.0, 1.0, "def"), 0), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-1.0, -0.0, "dac"), infsupdec (-1.0, 1.0, "def"), 0)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.1, 10.0, "def"), infsupdec (1.0, 41.0, "dac"), 0), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.1, 10.0, "def"), infsupdec (1.0, 41.0, "dac"), 0)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), infsupdec (0.0, 100.1, "dac"), 1), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), infsupdec (0.0, 100.1, "dac"), 1)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (entire, "def"), infsupdec (-5.1, 10.0, "def"), 1), infsupdec (-5.1, 10.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (entire, "def"), infsupdec (-5.1, 10.0, "def"), 1)){1}, decorationpart (infsupdec (-5.1, 10.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "com"), infsupdec (-10.0, 5.1, "dac"), 1), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "com"), infsupdec (-10.0, 5.1, "dac"), 1)){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-0.0, -0.0, "def"), infsupdec (1.0, 5.0, "dac"), 1), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-0.0, -0.0, "def"), infsupdec (1.0, 5.0, "dac"), 1)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), infsupdec (5.0, 17.1, "def"), 2), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), infsupdec (5.0, 17.1, "def"), 2)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, inf, "dac"), infsupdec (5.6, 27.544, "dac"), 2), infsupdec (5.6, 27.544, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, inf, "dac"), infsupdec (5.6, 27.544, "dac"), 2)){1}, decorationpart (infsupdec (5.6, 27.544, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "def"), infsupdec (1.0, 2.0, "def"), 2), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "def"), infsupdec (1.0, 2.0, "def"), 2)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (9.999999999999999124e-05, 5.428900000000000503e+00, "com"), infsupdec (1.0, inf, "def"), 2), infsupdec (1.0, 2.330000000000000515e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (9.999999999999999124e-05, 5.428900000000000503e+00, "com"), infsupdec (1.0, inf, "def"), 2)){1}, decorationpart (infsupdec (1.0, 2.330000000000000515e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.088999999999999968e-01, 3.609999999999999876e+00, "dac"), infsupdec (-inf, -1.0, "def"), 2), infsupdec (-1.900000000000000133e+00, -1.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.088999999999999968e-01, 3.609999999999999876e+00, "dac"), infsupdec (-inf, -1.0, "def"), 2)){1}, decorationpart (infsupdec (-1.900000000000000133e+00, -1.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), infsupdec (-23.0, -1.0, "dac"), 3), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), infsupdec (-23.0, -1.0, "dac"), 3)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (entire, "def"), infsupdec (-23.0, -1.0, "com"), 3), infsupdec (-23.0, -1.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (entire, "def"), infsupdec (-23.0, -1.0, "com"), 3)){1}, decorationpart (infsupdec (-23.0, -1.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "def"), infsupdec (1.0, 2.0, "dac"), 3), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "def"), infsupdec (1.0, 2.0, "dac"), 3)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (9.999999999999999547e-07, 1.264933700000000272e+01, "com"), infsupdec (1.0, inf, "dac"), 3), infsupdec (1.0, 2.330000000000000515e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (9.999999999999999547e-07, 1.264933700000000272e+01, "com"), infsupdec (1.0, inf, "dac"), 3)){1}, decorationpart (infsupdec (1.0, 2.330000000000000515e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-6.858999999999999098e+00, -3.593700000000000366e-02, "com"), infsupdec (-inf, -1.0, "dac"), 3), infsupdec (-1.900000000000000133e+00, -1.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-6.858999999999999098e+00, -3.593700000000000366e-02, "com"), infsupdec (-inf, -1.0, "dac"), 3)){1}, decorationpart (infsupdec (-1.900000000000000133e+00, -1.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), infsupdec (-3.0, 17.3, "def"), -2), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), infsupdec (-3.0, 17.3, "def"), -2)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, inf, "dac"), infsupdec (-5.1, -0.1, "dac"), -2), infsupdec (-5.1, -0.1, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, inf, "dac"), infsupdec (-5.1, -0.1, "dac"), -2)){1}, decorationpart (infsupdec (-5.1, -0.1, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "def"), infsupdec (27.2, 55.1, "dac"), -2), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "def"), infsupdec (27.2, 55.1, "dac"), -2)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (9.508370646556841917e-06, inf, "def"), infsupdec (-inf, -1.797693134862315708e+308, "dac"), -2), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (9.508370646556841917e-06, inf, "def"), infsupdec (-inf, -1.797693134862315708e+308, "dac"), -2)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (1.841993774061043421e-01, 1.000000000000000000e+04, "com"), infsupdec (1.0, inf, "dac"), -2), infsupdec (1.0, 2.330000000000000515e+00, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (1.841993774061043421e-01, 1.000000000000000000e+04, "com"), infsupdec (1.0, inf, "dac"), -2)){1}, decorationpart (infsupdec (1.0, 2.330000000000000515e+00, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (2.770083102493074989e-01, 9.182736455463727410e+00, "com"), infsupdec (-inf, -1.0, "dac"), -2), infsupdec (-1.900000000000000133e+00, -1.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (2.770083102493074989e-01, 9.182736455463727410e+00, "com"), infsupdec (-inf, -1.0, "dac"), -2)){1}, decorationpart (infsupdec (-1.900000000000000133e+00, -1.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), infsupdec (-5.1, 55.5, "def"), -1), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), infsupdec (-5.1, 55.5, "def"), -1)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (entire, "def"), infsupdec (-5.1, 55.5, "dac"), -1), infsupdec (-5.1, 55.5, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (entire, "def"), infsupdec (-5.1, 55.5, "dac"), -1)){1}, decorationpart (infsupdec (-5.1, 55.5, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "dac"), infsupdec (-5.1, 55.5, "def"), -1), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "dac"), infsupdec (-5.1, 55.5, "def"), -1)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, -0.0, "dac"), infsupdec (-1.0, 1.0, "com"), -1), infsupdec (-1.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, -0.0, "dac"), infsupdec (-1.0, 1.0, "com"), -1)){1}, decorationpart (infsupdec (-1.0, 0.0, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (4.291845493562231328e-01, 1.000000000000000000e+02, "def"), infsupdec (-1.0, 0.0, "dac"), -1), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (4.291845493562231328e-01, 1.000000000000000000e+02, "def"), infsupdec (-1.0, 0.0, "dac"), -1)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (empty, "trv"), infsupdec (-5.1, 55.5, "dac"), -3), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (empty, "trv"), infsupdec (-5.1, 55.5, "dac"), -3)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (entire, "def"), infsupdec (-5.1, 55.5, "def"), -3), infsupdec (-5.1, 55.5, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (entire, "def"), infsupdec (-5.1, 55.5, "def"), -3)){1}, decorationpart (infsupdec (-5.1, 55.5, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (0.0, 0.0, "def"), infsupdec (-5.1, 55.5, "def"), -3), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (0.0, 0.0, "def"), infsupdec (-5.1, 55.5, "def"), -3)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, 0.0, "dac"), infsupdec (5.1, 55.5, "com"), -3), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, 0.0, "dac"), infsupdec (5.1, 55.5, "com"), -3)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pownrev (infsupdec (-inf, -0.0, "dac"), infsupdec (-32.0, 1.1, "def"), -3), infsupdec (-32.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pownrev (infsupdec (-inf, -0.0, "dac"), infsupdec (-32.0, 1.1, "def"), -3)){1}, decorationpart (infsupdec (-32.0, 0.0, "trv")){1})); ## minimal_sinRev_test %!test %! assert (isequal (sinrev (infsup), infsup)); %!test %! assert (isequal (sinrev (infsup (-2.0, -1.1)), infsup)); %!test %! assert (isequal (sinrev (infsup (1.1, 2.0)), infsup)); %!test %! assert (isequal (sinrev (infsup (-1.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (sinrev (infsup (0.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (sinrev (infsup (1.224646799147352961e-16, 1.224646799147353207e-16)), infsup (-inf, inf))); ## minimal_sinRevBin_test %!test %! assert (isequal (sinrev (infsup, infsup (-1.2, 12.1)), infsup)); %!test %! assert (isequal (sinrev (infsup (-2.0, -1.1), infsup (-5.0, 5.0)), infsup)); %!test %! assert (isequal (sinrev (infsup (1.1, 2.0), infsup (-5.0, 5.0)), infsup)); %!test %! assert (isequal (sinrev (infsup (-1.0, 1.0), infsup (-1.2, 12.1)), infsup (-1.2, 12.1))); %!test %! assert (isequal (sinrev (infsup (0.0, 0.0), infsup (-1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (sinrev (infsup (-0.0, -0.0), infsup (2.0, 2.5)), infsup)); %!test %! assert (isequal (sinrev (infsup (-0.0, -0.0), infsup (3.0, 3.5)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (sinrev (infsup (9.999999999999998890e-01, 1.000000000000000000e+00), infsup (1.57, 1.58)), infsup (1.570796311893735364e+00, 1.570796341696058196e+00))); %!test %! assert (isequal (sinrev (infsup (0.0, 1.000000000000000000e+00), infsup (-0.1, 1.58)), infsup (0.0, 1.58))); %!test %! assert (isequal (sinrev (infsup (1.224646799147352961e-16, 1.224646799147353207e-16), infsup (3.14, 3.15)), infsup (3.141592653589792672e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (sinrev (infsup (-3.216245299353273201e-16, -3.216245299353272708e-16), infsup (3.14, 3.15)), infsup (3.141592653589793116e+00, 3.141592653589794004e+00))); %!test %! assert (isequal (sinrev (infsup (-3.216245299353273201e-16, 1.224646799147353207e-16), infsup (3.14, 3.15)), infsup (3.141592653589792672e+00, 3.141592653589794004e+00))); %!test %! assert (isequal (sinrev (infsup (0.0, 1.0), infsup (-0.1, 3.15)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (sinrev (infsup (0.0, 1.0), infsup (-0.1, 3.15)), infsup (-0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (sinrev (infsup (-3.216245299353273201e-16, 1.0), infsup (-0.1, 3.15)), infsup (-3.216245299353273694e-16, 3.141592653589794004e+00))); %!test %! assert (isequal (sinrev (infsup (-3.216245299353273201e-16, 1.0), infsup (0.0, 3.15)), infsup (0.0, 3.141592653589794004e+00))); %!test %! assert (isequal (sinrev (infsup (1.224646799147352961e-16, 1.000000000000000000e+00), infsup (3.14, 3.15)), infsup (3.14, 3.141592653589793560e+00))); %!test %! assert (isequal (sinrev (infsup (-3.216245299353273201e-16, 1.000000000000000000e+00), infsup (1.57, 3.15)), infsup (1.57, 3.141592653589794004e+00))); %!test %! assert (isequal (sinrev (infsup (1.224646799147352961e-16, 1.224646799147353207e-16), infsup (-inf, 3.15)), infsup (-inf, 3.141592653589793560e+00))); %!test %! assert (isequal (sinrev (infsup (-3.216245299353273201e-16, -3.216245299353272708e-16), infsup (3.14, inf)), infsup (3.141592653589793116e+00, inf))); ## minimal_sinRev_dec_test %!test %! assert (isequal (sinrev (infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (-2.0, -1.1, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (-2.0, -1.1, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (1.1, 2.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (1.1, 2.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (-1.0, 1.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (-1.0, 1.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (0.0, 0.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (0.0, 0.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); ## minimal_sinRev_dec_bin_test %!test %! assert (isequal (sinrev (infsupdec (empty, "trv"), infsupdec (-1.2, 12.1, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (empty, "trv"), infsupdec (-1.2, 12.1, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (-2.0, -1.1, "def"), infsupdec (-5.0, 5.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (-2.0, -1.1, "def"), infsupdec (-5.0, 5.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (1.1, 2.0, "dac"), infsupdec (-5.0, 5.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (1.1, 2.0, "dac"), infsupdec (-5.0, 5.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (-1.0, 1.0, "com"), infsupdec (-1.2, 12.1, "def")), infsupdec (-1.2, 12.1, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (-1.0, 1.0, "com"), infsupdec (-1.2, 12.1, "def"))){1}, decorationpart (infsupdec (-1.2, 12.1, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (0.0, 0.0, "dac"), infsupdec (-1.0, 1.0, "def")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (0.0, 0.0, "dac"), infsupdec (-1.0, 1.0, "def"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (-0.0, -0.0, "def"), infsupdec (2.0, 2.5, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (-0.0, -0.0, "def"), infsupdec (2.0, 2.5, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (-0.0, -0.0, "def"), infsupdec (3.0, 3.5, "dac")), infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (-0.0, -0.0, "def"), infsupdec (3.0, 3.5, "dac"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (9.999999999999998890e-01, 1.000000000000000000e+00, "dac"), infsupdec (1.57, 1.58, "dac")), infsupdec (1.570796311893735364e+00, 1.570796341696058196e+00, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (9.999999999999998890e-01, 1.000000000000000000e+00, "dac"), infsupdec (1.57, 1.58, "dac"))){1}, decorationpart (infsupdec (1.570796311893735364e+00, 1.570796341696058196e+00, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (0.0, 1.000000000000000000e+00, "com"), infsupdec (-0.1, 1.58, "dac")), infsupdec (0.0, 1.58, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (0.0, 1.000000000000000000e+00, "com"), infsupdec (-0.1, 1.58, "dac"))){1}, decorationpart (infsupdec (0.0, 1.58, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "com"), infsupdec (3.14, 3.15, "def")), infsupdec (3.141592653589792672e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "com"), infsupdec (3.14, 3.15, "def"))){1}, decorationpart (infsupdec (3.141592653589792672e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (-3.216245299353273201e-16, -3.216245299353272708e-16, "com"), infsupdec (3.14, 3.15, "dac")), infsupdec (3.141592653589793116e+00, 3.141592653589794004e+00, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (-3.216245299353273201e-16, -3.216245299353272708e-16, "com"), infsupdec (3.14, 3.15, "dac"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589794004e+00, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (-3.216245299353273201e-16, 1.224646799147353207e-16, "dac"), infsupdec (3.14, 3.15, "com")), infsupdec (3.141592653589792672e+00, 3.141592653589794004e+00, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (-3.216245299353273201e-16, 1.224646799147353207e-16, "dac"), infsupdec (3.14, 3.15, "com"))){1}, decorationpart (infsupdec (3.141592653589792672e+00, 3.141592653589794004e+00, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (0.0, 1.0, "def"), infsupdec (-0.1, 3.15, "def")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (0.0, 1.0, "def"), infsupdec (-0.1, 3.15, "def"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (0.0, 1.0, "dac"), infsupdec (-0.1, 3.15, "com")), infsupdec (-0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (0.0, 1.0, "dac"), infsupdec (-0.1, 3.15, "com"))){1}, decorationpart (infsupdec (-0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (-3.216245299353273201e-16, 1.0, "def"), infsupdec (-0.1, 3.15, "def")), infsupdec (-3.216245299353273694e-16, 3.141592653589794004e+00, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (-3.216245299353273201e-16, 1.0, "def"), infsupdec (-0.1, 3.15, "def"))){1}, decorationpart (infsupdec (-3.216245299353273694e-16, 3.141592653589794004e+00, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (-3.216245299353273201e-16, 1.0, "com"), infsupdec (0.0, 3.15, "dac")), infsupdec (0.0, 3.141592653589794004e+00, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (-3.216245299353273201e-16, 1.0, "com"), infsupdec (0.0, 3.15, "dac"))){1}, decorationpart (infsupdec (0.0, 3.141592653589794004e+00, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (1.224646799147352961e-16, 1.000000000000000000e+00, "def"), infsupdec (3.14, 3.15, "com")), infsupdec (3.14, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (1.224646799147352961e-16, 1.000000000000000000e+00, "def"), infsupdec (3.14, 3.15, "com"))){1}, decorationpart (infsupdec (3.14, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (-3.216245299353273201e-16, 1.000000000000000000e+00, "dac"), infsupdec (1.57, 3.15, "com")), infsupdec (1.57, 3.141592653589794004e+00, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (-3.216245299353273201e-16, 1.000000000000000000e+00, "dac"), infsupdec (1.57, 3.15, "com"))){1}, decorationpart (infsupdec (1.57, 3.141592653589794004e+00, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "com"), infsupdec (-inf, 3.15, "dac")), infsupdec (-inf, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "com"), infsupdec (-inf, 3.15, "dac"))){1}, decorationpart (infsupdec (-inf, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (sinrev (infsupdec (-3.216245299353273201e-16, -3.216245299353272708e-16, "com"), infsupdec (3.14, inf, "dac")), infsupdec (3.141592653589793116e+00, inf, "trv"))); %! assert (isequal (decorationpart (sinrev (infsupdec (-3.216245299353273201e-16, -3.216245299353272708e-16, "com"), infsupdec (3.14, inf, "dac"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, inf, "trv")){1})); ## minimal_cosRev_test %!test %! assert (isequal (cosrev (infsup), infsup)); %!test %! assert (isequal (cosrev (infsup (-2.0, -1.1)), infsup)); %!test %! assert (isequal (cosrev (infsup (1.1, 2.0)), infsup)); %!test %! assert (isequal (cosrev (infsup (-1.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (cosrev (infsup (0.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (cosrev (infsup (1.224646799147352961e-16, 1.224646799147353207e-16)), infsup (-inf, inf))); ## minimal_cosRevBin_test %!test %! assert (isequal (cosrev (infsup, infsup (-1.2, 12.1)), infsup)); %!test %! assert (isequal (cosrev (infsup (-2.0, -1.1), infsup (-5.0, 5.0)), infsup)); %!test %! assert (isequal (cosrev (infsup (1.1, 2.0), infsup (-5.0, 5.0)), infsup)); %!test %! assert (isequal (cosrev (infsup (-1.0, 1.0), infsup (-1.2, 12.1)), infsup (-1.2, 12.1))); %!test %! assert (isequal (cosrev (infsup (1.0, 1.0), infsup (-0.1, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (cosrev (infsup (-1.0, -1.0), infsup (3.14, 3.15)), infsup (3.141592653589793116e+00, 3.141592653589794004e+00))); %!test %! assert (isequal (cosrev (infsup (6.123233995736764803e-17, 6.123233995736766036e-17), infsup (1.57, 1.58)), infsup (1.570796326794896336e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (cosrev (infsup (-1.608122649676636601e-16, -1.608122649676636354e-16), infsup (1.57, 1.58)), infsup (1.570796326794896558e+00, 1.570796326794897002e+00))); %!test %! assert (isequal (cosrev (infsup (-1.608122649676636601e-16, 6.123233995736766036e-17), infsup (1.57, 1.58)), infsup (1.570796326794896336e+00, 1.570796326794897002e+00))); %!test %! assert (isequal (cosrev (infsup (6.123233995736764803e-17, 1.0), infsup (-2.0, 2.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (cosrev (infsup (6.123233995736764803e-17, 1.0), infsup (0.0, 2.0)), infsup (0.0, 1.570796326794896780e+00))); %!test %! assert (isequal (cosrev (infsup (-1.608122649676636601e-16, 1.0), infsup (-0.1, 1.5708)), infsup (-0.1, 1.570796326794897002e+00))); %!test %! assert (isequal (cosrev (infsup (-1.000000000000000000e+00, -9.999999999999998890e-01), infsup (3.14, 3.15)), infsup (3.141592638688631922e+00, 3.141592668490955198e+00))); %!test %! assert (isequal (cosrev (infsup (-1.000000000000000000e+00, -9.999999999999998890e-01), infsup (-3.15, -3.14)), infsup (-3.141592668490955198e+00, -3.141592638688631922e+00))); %!test %! assert (isequal (cosrev (infsup (-1.000000000000000000e+00, -9.999999999999998890e-01), infsup (9.42, 9.45)), infsup (9.424777945868218154e+00, 9.424777975670542318e+00))); %!test %! assert (isequal (cosrev (infsup (7.648421872844883840e-01, 1.0), infsup (-1.0, 0.1)), infsup (-7.000000000000000666e-01, 0.1))); %!test %! assert (isequal (cosrev (infsup (-4.161468365471424069e-01, 5.403023058681397650e-01), infsup (0.0, 2.1)), infsup (9.999999999999998890e-01, 2.000000000000000444e+00))); %!test %! assert (isequal (cosrev (infsup (1.224646799147352961e-16, 1.224646799147353207e-16), infsup (-inf, 1.58)), infsup (-inf, 1.570796326794896558e+00))); %!test %! assert (isequal (cosrev (infsup (1.224646799147352961e-16, 1.224646799147353207e-16), infsup (-inf, 1.5)), infsup (-inf, -1.570796326794896336e+00))); %!test %! assert (isequal (cosrev (infsup (-3.216245299353273201e-16, -3.216245299353272708e-16), infsup (-1.58, inf)), infsup (-1.570796326794897002e+00, inf))); %!test %! assert (isequal (cosrev (infsup (-3.216245299353273201e-16, -3.216245299353272708e-16), infsup (-1.5, inf)), infsup (1.570796326794896780e+00, inf))); ## minimal_cosRev_dec_test %!test %! assert (isequal (cosrev (infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-2.0, -1.1, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-2.0, -1.1, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (1.1, 2.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (1.1, 2.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-1.0, 1.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-1.0, 1.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (0.0, 0.0, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (0.0, 0.0, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); ## minimal_cosRev_dec_bin_test %!test %! assert (isequal (cosrev (infsupdec (empty, "trv"), infsupdec (-1.2, 12.1, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (empty, "trv"), infsupdec (-1.2, 12.1, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-2.0, -1.1, "dac"), infsupdec (-5.0, 5.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-2.0, -1.1, "dac"), infsupdec (-5.0, 5.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (1.1, 2.0, "dac"), infsupdec (-5.0, 5.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (1.1, 2.0, "dac"), infsupdec (-5.0, 5.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-1.0, 1.0, "dac"), infsupdec (-1.2, 12.1, "def")), infsupdec (-1.2, 12.1, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-1.0, 1.0, "dac"), infsupdec (-1.2, 12.1, "def"))){1}, decorationpart (infsupdec (-1.2, 12.1, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (1.0, 1.0, "def"), infsupdec (-0.1, 0.1, "dac")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (1.0, 1.0, "def"), infsupdec (-0.1, 0.1, "dac"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-1.0, -1.0, "com"), infsupdec (3.14, 3.15, "dac")), infsupdec (3.141592653589793116e+00, 3.141592653589794004e+00, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-1.0, -1.0, "com"), infsupdec (3.14, 3.15, "dac"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589794004e+00, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (6.123233995736764803e-17, 6.123233995736766036e-17, "def"), infsupdec (1.57, 1.58, "def")), infsupdec (1.570796326794896336e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (6.123233995736764803e-17, 6.123233995736766036e-17, "def"), infsupdec (1.57, 1.58, "def"))){1}, decorationpart (infsupdec (1.570796326794896336e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-1.608122649676636601e-16, -1.608122649676636354e-16, "dac"), infsupdec (1.57, 1.58, "dac")), infsupdec (1.570796326794896558e+00, 1.570796326794897002e+00, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-1.608122649676636601e-16, -1.608122649676636354e-16, "dac"), infsupdec (1.57, 1.58, "dac"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 1.570796326794897002e+00, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-1.608122649676636601e-16, 6.123233995736766036e-17, "com"), infsupdec (1.57, 1.58, "dac")), infsupdec (1.570796326794896336e+00, 1.570796326794897002e+00, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-1.608122649676636601e-16, 6.123233995736766036e-17, "com"), infsupdec (1.57, 1.58, "dac"))){1}, decorationpart (infsupdec (1.570796326794896336e+00, 1.570796326794897002e+00, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (6.123233995736764803e-17, 1.0, "def"), infsupdec (-2.0, 2.0, "com")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (6.123233995736764803e-17, 1.0, "def"), infsupdec (-2.0, 2.0, "com"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (6.123233995736764803e-17, 1.0, "dac"), infsupdec (0.0, 2.0, "def")), infsupdec (0.0, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (6.123233995736764803e-17, 1.0, "dac"), infsupdec (0.0, 2.0, "def"))){1}, decorationpart (infsupdec (0.0, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-1.608122649676636601e-16, 1.0, "def"), infsupdec (-0.1, 1.5708, "dac")), infsupdec (-0.1, 1.570796326794897002e+00, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-1.608122649676636601e-16, 1.0, "def"), infsupdec (-0.1, 1.5708, "dac"))){1}, decorationpart (infsupdec (-0.1, 1.570796326794897002e+00, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-1.000000000000000000e+00, -9.999999999999998890e-01, "dac"), infsupdec (3.14, 3.15, "def")), infsupdec (3.141592638688631922e+00, 3.141592668490955198e+00, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-1.000000000000000000e+00, -9.999999999999998890e-01, "dac"), infsupdec (3.14, 3.15, "def"))){1}, decorationpart (infsupdec (3.141592638688631922e+00, 3.141592668490955198e+00, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-1.000000000000000000e+00, -9.999999999999998890e-01, "def"), infsupdec (-3.15, -3.14, "com")), infsupdec (-3.141592668490955198e+00, -3.141592638688631922e+00, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-1.000000000000000000e+00, -9.999999999999998890e-01, "def"), infsupdec (-3.15, -3.14, "com"))){1}, decorationpart (infsupdec (-3.141592668490955198e+00, -3.141592638688631922e+00, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-1.000000000000000000e+00, -9.999999999999998890e-01, "def"), infsupdec (9.42, 9.45, "dac")), infsupdec (9.424777945868218154e+00, 9.424777975670542318e+00, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-1.000000000000000000e+00, -9.999999999999998890e-01, "def"), infsupdec (9.42, 9.45, "dac"))){1}, decorationpart (infsupdec (9.424777945868218154e+00, 9.424777975670542318e+00, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (7.648421872844883840e-01, 1.0, "dac"), infsupdec (-1.0, 0.1, "def")), infsupdec (-7.000000000000000666e-01, 0.1, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (7.648421872844883840e-01, 1.0, "dac"), infsupdec (-1.0, 0.1, "def"))){1}, decorationpart (infsupdec (-7.000000000000000666e-01, 0.1, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-4.161468365471424069e-01, 5.403023058681397650e-01, "com"), infsupdec (0.0, 2.1, "dac")), infsupdec (9.999999999999998890e-01, 2.000000000000000444e+00, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-4.161468365471424069e-01, 5.403023058681397650e-01, "com"), infsupdec (0.0, 2.1, "dac"))){1}, decorationpart (infsupdec (9.999999999999998890e-01, 2.000000000000000444e+00, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "com"), infsupdec (-inf, 1.58, "dac")), infsupdec (-inf, 1.570796326794896558e+00, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "com"), infsupdec (-inf, 1.58, "dac"))){1}, decorationpart (infsupdec (-inf, 1.570796326794896558e+00, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "def"), infsupdec (-inf, 1.5, "dac")), infsupdec (-inf, -1.570796326794896336e+00, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "def"), infsupdec (-inf, 1.5, "dac"))){1}, decorationpart (infsupdec (-inf, -1.570796326794896336e+00, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-3.216245299353273201e-16, -3.216245299353272708e-16, "dac"), infsupdec (-1.58, inf, "dac")), infsupdec (-1.570796326794897002e+00, inf, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-3.216245299353273201e-16, -3.216245299353272708e-16, "dac"), infsupdec (-1.58, inf, "dac"))){1}, decorationpart (infsupdec (-1.570796326794897002e+00, inf, "trv")){1})); %!test %! assert (isequal (cosrev (infsupdec (-3.216245299353273201e-16, -3.216245299353272708e-16, "def"), infsupdec (-1.5, inf, "dac")), infsupdec (1.570796326794896780e+00, inf, "trv"))); %! assert (isequal (decorationpart (cosrev (infsupdec (-3.216245299353273201e-16, -3.216245299353272708e-16, "def"), infsupdec (-1.5, inf, "dac"))){1}, decorationpart (infsupdec (1.570796326794896780e+00, inf, "trv")){1})); ## minimal_tanRev_test %!test %! assert (isequal (tanrev (infsup), infsup)); %!test %! assert (isequal (tanrev (infsup (-1.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (tanrev (infsup (-156.0, -12.0)), infsup (-inf, inf))); %!test %! assert (isequal (tanrev (infsup (0.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (tanrev (infsup (1.224646799147352961e-16, 1.224646799147353207e-16)), infsup (-inf, inf))); ## minimal_tanRevBin_test %!test %! assert (isequal (tanrev (infsup, infsup (-1.5708, 1.5708)), infsup)); %!test %! assert (isequal (tanrev (infsup (-inf, inf), infsup (-1.5708, 1.5708)), infsup (-1.5708, 1.5708))); %!test %! assert (isequal (tanrev (infsup (0.0, 0.0), infsup (-1.5708, 1.5708)), infsup (0.0, 0.0))); %!test %! assert (isequal (tanrev (infsup (1.633123935319536800e+16, 1.633123935319537000e+16), infsup (-1.5708, 1.5708)), infsup (-1.570796326794897224e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (tanrev (infsup (-1.224646799147353207e-16, -1.224646799147352961e-16), infsup (3.14, 3.15)), infsup (3.141592653589792672e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (tanrev (infsup (3.216245299353272708e-16, 3.216245299353273201e-16), infsup (-3.15, 3.15)), infsup (-3.141592653589793560e+00, 3.141592653589794004e+00))); %!test %! assert (isequal (tanrev (infsup (-1.633123935309004800e+16, 1.633123935309004800e+16), infsup (-inf, 1.5707965)), infsup (-inf, 1.570796499999999929e+00))); %!test %! assert (isequal (tanrev (infsup (-1.633123935309004800e+16, 1.633123935309004800e+16), infsup (-1.5707965, inf)), infsup (-1.570796499999999929e+00, inf))); %!test %! assert (isequal (tanrev (infsup (-1.633123935309004800e+16, 1.633123935309004800e+16), infsup (-1.5707965, 1.5707965)), infsup (-1.570796499999999929e+00, 1.570796499999999929e+00))); %!test %! assert (isequal (tanrev (infsup (-1.633123935319537000e+16, 1.633123935319537000e+16), infsup (-1.5707965, 1.5707965)), infsup (-1.5707965, 1.5707965))); ## minimal_tanRev_dec_test %!test %! assert (isequal (tanrev (infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (tanrev (infsupdec (-1.0, 1.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (-1.0, 1.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tanrev (infsupdec (-156.0, -12.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (-156.0, -12.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tanrev (infsupdec (0.0, 0.0, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (0.0, 0.0, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tanrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (1.224646799147352961e-16, 1.224646799147353207e-16, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); ## minimal_tanRev_dec_bin_test %!test %! assert (isequal (tanrev (infsupdec (empty, "trv"), infsupdec (-1.5708, 1.5708, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (empty, "trv"), infsupdec (-1.5708, 1.5708, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (tanrev (infsupdec (entire, "def"), infsupdec (-1.5708, 1.5708, "dac")), infsupdec (-1.5708, 1.5708, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (entire, "def"), infsupdec (-1.5708, 1.5708, "dac"))){1}, decorationpart (infsupdec (-1.5708, 1.5708, "trv")){1})); %!test %! assert (isequal (tanrev (infsupdec (0.0, 0.0, "com"), infsupdec (-1.5708, 1.5708, "def")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (0.0, 0.0, "com"), infsupdec (-1.5708, 1.5708, "def"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (tanrev (infsupdec (1.633123935319536800e+16, 1.633123935319537000e+16, "dac"), infsupdec (-1.5708, 1.5708, "def")), infsupdec (-1.570796326794897224e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (1.633123935319536800e+16, 1.633123935319537000e+16, "dac"), infsupdec (-1.5708, 1.5708, "def"))){1}, decorationpart (infsupdec (-1.570796326794897224e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (tanrev (infsupdec (-1.224646799147353207e-16, -1.224646799147352961e-16, "def"), infsupdec (3.14, 3.15, "dac")), infsupdec (3.141592653589792672e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (-1.224646799147353207e-16, -1.224646799147352961e-16, "def"), infsupdec (3.14, 3.15, "dac"))){1}, decorationpart (infsupdec (3.141592653589792672e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (tanrev (infsupdec (3.216245299353272708e-16, 3.216245299353273201e-16, "com"), infsupdec (-3.15, 3.15, "com")), infsupdec (-3.141592653589793560e+00, 3.141592653589794004e+00, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (3.216245299353272708e-16, 3.216245299353273201e-16, "com"), infsupdec (-3.15, 3.15, "com"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589794004e+00, "trv")){1})); %!test %! assert (isequal (tanrev (infsupdec (-1.633123935309004800e+16, 1.633123935309004800e+16, "def"), infsupdec (-inf, 1.5707965, "def")), infsupdec (-inf, 1.570796499999999929e+00, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (-1.633123935309004800e+16, 1.633123935309004800e+16, "def"), infsupdec (-inf, 1.5707965, "def"))){1}, decorationpart (infsupdec (-inf, 1.570796499999999929e+00, "trv")){1})); %!test %! assert (isequal (tanrev (infsupdec (-1.633123935309004800e+16, 1.633123935309004800e+16, "com"), infsupdec (-1.5707965, inf, "dac")), infsupdec (-1.570796499999999929e+00, inf, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (-1.633123935309004800e+16, 1.633123935309004800e+16, "com"), infsupdec (-1.5707965, inf, "dac"))){1}, decorationpart (infsupdec (-1.570796499999999929e+00, inf, "trv")){1})); %!test %! assert (isequal (tanrev (infsupdec (-1.633123935309004800e+16, 1.633123935309004800e+16, "com"), infsupdec (-1.5707965, 1.5707965, "com")), infsupdec (-1.570796499999999929e+00, 1.570796499999999929e+00, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (-1.633123935309004800e+16, 1.633123935309004800e+16, "com"), infsupdec (-1.5707965, 1.5707965, "com"))){1}, decorationpart (infsupdec (-1.570796499999999929e+00, 1.570796499999999929e+00, "trv")){1})); %!test %! assert (isequal (tanrev (infsupdec (-1.633123935319537000e+16, 1.633123935319537000e+16, "dac"), infsupdec (-1.5707965, 1.5707965, "def")), infsupdec (-1.5707965, 1.5707965, "trv"))); %! assert (isequal (decorationpart (tanrev (infsupdec (-1.633123935319537000e+16, 1.633123935319537000e+16, "dac"), infsupdec (-1.5707965, 1.5707965, "def"))){1}, decorationpart (infsupdec (-1.5707965, 1.5707965, "trv")){1})); ## minimal_coshRev_test %!test %! assert (isequal (coshrev (infsup), infsup)); %!test %! assert (isequal (coshrev (infsup (1.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (coshrev (infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (coshrev (infsup (1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (coshrev (infsup (1.543080634815243712e+00, 1.705784684221513993e+130)), infsup (-3.005632345000000782e+02, 3.005632345000000782e+02))); ## minimal_coshRevBin_test %!test %! assert (isequal (coshrev (infsup, infsup (0.0, inf)), infsup)); %!test %! assert (isequal (coshrev (infsup (1.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (coshrev (infsup (0.0, inf), infsup (1.0, 2.0)), infsup (1.0, 2.0))); %!test %! assert (isequal (coshrev (infsup (1.0, 1.0), infsup (1.0, inf)), infsup)); %!test %! assert (isequal (coshrev (infsup (1.543080634815243712e+00, 1.705784684221513993e+130), infsup (-inf, 0.0)), infsup (-3.005632345000000782e+02, -9.999999999999998890e-01))); ## minimal_coshRev_dec_test %!test %! assert (isequal (coshrev (infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (coshrev (infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (coshrev (infsupdec (1.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (coshrev (infsupdec (1.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (coshrev (infsupdec (0.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (coshrev (infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (coshrev (infsupdec (1.0, 1.0, "def")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (coshrev (infsupdec (1.0, 1.0, "def"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (coshrev (infsupdec (1.543080634815243712e+00, 1.705784684221513993e+130, "com")), infsupdec (-3.005632345000000782e+02, 3.005632345000000782e+02, "trv"))); %! assert (isequal (decorationpart (coshrev (infsupdec (1.543080634815243712e+00, 1.705784684221513993e+130, "com"))){1}, decorationpart (infsupdec (-3.005632345000000782e+02, 3.005632345000000782e+02, "trv")){1})); ## minimal_coshRev_dec_bin_test %!test %! assert (isequal (coshrev (infsupdec (empty, "trv"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (coshrev (infsupdec (empty, "trv"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (coshrev (infsupdec (1.0, inf, "def"), infsupdec (0.0, inf, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (coshrev (infsupdec (1.0, inf, "def"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (coshrev (infsupdec (0.0, inf, "def"), infsupdec (1.0, 2.0, "com")), infsupdec (1.0, 2.0, "trv"))); %! assert (isequal (decorationpart (coshrev (infsupdec (0.0, inf, "def"), infsupdec (1.0, 2.0, "com"))){1}, decorationpart (infsupdec (1.0, 2.0, "trv")){1})); %!test %! assert (isequal (coshrev (infsupdec (1.0, 1.0, "dac"), infsupdec (1.0, inf, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (coshrev (infsupdec (1.0, 1.0, "dac"), infsupdec (1.0, inf, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (coshrev (infsupdec (1.543080634815243712e+00, 1.705784684221513993e+130, "com"), infsupdec (-inf, 0.0, "dac")), infsupdec (-3.005632345000000782e+02, -9.999999999999998890e-01, "trv"))); %! assert (isequal (decorationpart (coshrev (infsupdec (1.543080634815243712e+00, 1.705784684221513993e+130, "com"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (-3.005632345000000782e+02, -9.999999999999998890e-01, "trv")){1})); ## minimal_mulRev_test %!test %! assert (isequal (mulrev (infsup, infsup (1.0, 2.0)), infsup)); %!test %! assert (isequal (mulrev (infsup (1.0, 2.0), infsup), infsup)); %!test %! assert (isequal (mulrev (infsup, infsup), infsup)); %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (-2.1, -0.4)), infsup (2.000000000000000111e-01, 2.100000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (-2.0, 0.0), infsup (-2.1, -0.4)), infsup (2.000000000000000111e-01, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (-2.1, -0.4)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 1.1), infsup (-2.1, -0.4)), infsup (-inf, -3.636363636363635909e-01))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (-2.1, -0.4)), infsup (-2.100000000000000284e+02, -3.636363636363635909e-01))); %!test %! assert (isequal (mulrev (infsup (0.0, 0.0), infsup (-2.1, -0.4)), infsup)); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (-2.1, -0.4)), infsup (0.0, 2.100000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (-inf, 0.0), infsup (-2.1, -0.4)), infsup (0.0, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 1.1), infsup (-2.1, -0.4)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, inf), infsup (-2.1, -0.4)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, inf), infsup (-2.1, -0.4)), infsup (-inf, 0.0))); %!test %! assert (isequal (mulrev (infsup (0.01, inf), infsup (-2.1, -0.4)), infsup (-2.100000000000000284e+02, 0.0))); %!test %! assert (isequal (mulrev (infsup (-inf, inf), infsup (-2.1, -0.4)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (-2.1, 0.0)), infsup (0.0, 2.100000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (-2.0, 0.0), infsup (-2.1, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (-2.1, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 1.1), infsup (-2.1, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (-2.1, 0.0)), infsup (-2.100000000000000284e+02, 0.0))); %!test %! assert (isequal (mulrev (infsup (0.0, 0.0), infsup (-2.1, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (-2.1, 0.0)), infsup (0.0, 2.100000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (-inf, 0.0), infsup (-2.1, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 1.1), infsup (-2.1, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, inf), infsup (-2.1, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, inf), infsup (-2.1, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, inf), infsup (-2.1, 0.0)), infsup (-2.100000000000000284e+02, 0.0))); %!test %! assert (isequal (mulrev (infsup (-inf, inf), infsup (-2.1, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (-2.1, 0.12)), infsup (-1.199999999999999956e+00, 2.100000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (-2.0, 0.0), infsup (-2.1, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (-2.1, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 1.1), infsup (-2.1, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (-2.1, 0.12)), infsup (-2.100000000000000284e+02, 1.200000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (0.0, 0.0), infsup (-2.1, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (-2.1, 0.12)), infsup (-1.199999999999999956e+00, 2.100000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (-inf, 0.0), infsup (-2.1, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 1.1), infsup (-2.1, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, inf), infsup (-2.1, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, inf), infsup (-2.1, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, inf), infsup (-2.1, 0.12)), infsup (-2.100000000000000284e+02, 1.200000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (-inf, inf), infsup (-2.1, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (0.0, 0.12)), infsup (-1.199999999999999956e+00, 0.0))); %!test %! assert (isequal (mulrev (infsup (-2.0, 0.0), infsup (0.0, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (0.0, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 1.1), infsup (0.0, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (0.0, 0.12)), infsup (0.0, 1.200000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (0.0, 0.0), infsup (0.0, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (0.0, 0.12)), infsup (-1.199999999999999956e+00, 0.0))); %!test %! assert (isequal (mulrev (infsup (-inf, 0.0), infsup (0.0, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 1.1), infsup (0.0, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, inf), infsup (0.0, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, inf), infsup (0.0, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, inf), infsup (0.0, 0.12)), infsup (0.0, 1.200000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (-inf, inf), infsup (0.0, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (0.01, 0.12)), infsup (-1.199999999999999956e+00, -5.000000000000000104e-03))); %!test %! assert (isequal (mulrev (infsup (-2.0, 0.0), infsup (0.01, 0.12)), infsup (-inf, -5.000000000000000104e-03))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (0.01, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 1.1), infsup (0.01, 0.12)), infsup (9.090909090909088733e-03, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (0.01, 0.12)), infsup (9.090909090909088733e-03, 1.200000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (0.0, 0.0), infsup (0.01, 0.12)), infsup)); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (0.01, 0.12)), infsup (-1.199999999999999956e+00, 0.0))); %!test %! assert (isequal (mulrev (infsup (-inf, 0.0), infsup (0.01, 0.12)), infsup (-inf, 0.0))); %!test %! assert (isequal (mulrev (infsup (-inf, 1.1), infsup (0.01, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, inf), infsup (0.01, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, inf), infsup (0.01, 0.12)), infsup (0.0, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, inf), infsup (0.01, 0.12)), infsup (0.0, 1.200000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (-inf, inf), infsup (0.01, 0.12)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (mulrev (infsup (-2.0, 0.0), infsup (0.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (0.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 1.1), infsup (0.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (mulrev (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (mulrev (infsup (-inf, 0.0), infsup (0.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 1.1), infsup (0.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, inf), infsup (0.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, inf), infsup (0.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, inf), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (mulrev (infsup (-inf, inf), infsup (0.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (-inf, -0.1)), infsup (5.000000000000000278e-02, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 0.0), infsup (-inf, -0.1)), infsup (5.000000000000000278e-02, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (-inf, -0.1)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 1.1), infsup (-inf, -0.1)), infsup (-inf, -9.090909090909089774e-02))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (-inf, -0.1)), infsup (-inf, -9.090909090909089774e-02))); %!test %! assert (isequal (mulrev (infsup (0.0, 0.0), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (-inf, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 0.0), infsup (-inf, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 1.1), infsup (-inf, -0.1)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, inf), infsup (-inf, -0.1)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, inf), infsup (-inf, -0.1)), infsup (-inf, 0.0))); %!test %! assert (isequal (mulrev (infsup (0.01, inf), infsup (-inf, -0.1)), infsup (-inf, 0.0))); %!test %! assert (isequal (mulrev (infsup (-inf, inf), infsup (-inf, -0.1)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 0.0), infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 1.1), infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (mulrev (infsup (0.0, 0.0), infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 0.0), infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 1.1), infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, inf), infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, inf), infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (mulrev (infsup (-inf, inf), infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (-inf, 0.3)), infsup (-3.000000000000000000e+00, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 0.0), infsup (-inf, 0.3)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (-inf, 0.3)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 1.1), infsup (-inf, 0.3)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (-inf, 0.3)), infsup (-inf, 3.000000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (0.0, 0.0), infsup (-inf, 0.3)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (-inf, 0.3)), infsup (-3.000000000000000000e+00, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 0.0), infsup (-inf, 0.3)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 1.1), infsup (-inf, 0.3)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, inf), infsup (-inf, 0.3)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, inf), infsup (-inf, 0.3)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, inf), infsup (-inf, 0.3)), infsup (-inf, 3.000000000000000000e+01))); %!test %! assert (isequal (mulrev (infsup (-inf, inf), infsup (-inf, 0.3)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (-0.21, inf)), infsup (-inf, 2.100000000000000089e+00))); %!test %! assert (isequal (mulrev (infsup (-2.0, 0.0), infsup (-0.21, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (-0.21, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 1.1), infsup (-0.21, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (-0.21, inf)), infsup (-2.100000000000000000e+01, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 0.0), infsup (-0.21, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (-0.21, inf)), infsup (-inf, 2.100000000000000089e+00))); %!test %! assert (isequal (mulrev (infsup (-inf, 0.0), infsup (-0.21, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 1.1), infsup (-0.21, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, inf), infsup (-0.21, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, inf), infsup (-0.21, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, inf), infsup (-0.21, inf)), infsup (-2.100000000000000000e+01, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, inf), infsup (-0.21, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (mulrev (infsup (-2.0, 0.0), infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 1.1), infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 0.0), infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (mulrev (infsup (-inf, 0.0), infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 1.1), infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, inf), infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, inf), infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, inf), infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (0.04, inf)), infsup (-inf, -2.000000000000000042e-02))); %!test %! assert (isequal (mulrev (infsup (-2.0, 0.0), infsup (0.04, inf)), infsup (-inf, -2.000000000000000042e-02))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (0.04, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 1.1), infsup (0.04, inf)), infsup (3.636363636363635493e-02, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (0.04, inf)), infsup (3.636363636363635493e-02, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 0.0), infsup (0.04, inf)), infsup)); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (0.04, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (mulrev (infsup (-inf, 0.0), infsup (0.04, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (mulrev (infsup (-inf, 1.1), infsup (0.04, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, inf), infsup (0.04, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, inf), infsup (0.04, inf)), infsup (0.0, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, inf), infsup (0.04, inf)), infsup (0.0, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, inf), infsup (0.04, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 1.1), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, 1.1), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-2.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (0.01, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (mulrev (infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); ## minimal_mulRevTen_test %!test %! assert (isequal (mulrev (infsup (-2.0, -0.1), infsup (-2.1, -0.4), infsup (-2.1, -0.4)), infsup)); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (-2.1, -0.4), infsup (-2.1, -0.4)), infsup (-2.1, -0.4))); %!test %! assert (isequal (mulrev (infsup (0.01, 1.1), infsup (-2.1, 0.0), infsup (-2.1, 0.0)), infsup (-2.1, 0.0))); %!test %! assert (isequal (mulrev (infsup (-inf, -0.1), infsup (0.0, 0.12), infsup (0.0, 0.12)), infsup (0.0, 0.0))); %!test %! assert (isequal (mulrev (infsup (-2.0, 1.1), infsup (0.04, inf), infsup (0.04, inf)), infsup (0.04, inf))); ## minimal_mulRev_dec_test %!test %! assert (isequal (mulrev (infsupdec (-2.0, -0.1, "dac"), infsupdec (-2.1, -0.4, "dac")), infsupdec (2.000000000000000111e-01, 2.100000000000000000e+01, "trv"))); %! assert (isequal (decorationpart (mulrev (infsupdec (-2.0, -0.1, "dac"), infsupdec (-2.1, -0.4, "dac"))){1}, decorationpart (infsupdec (2.000000000000000111e-01, 2.100000000000000000e+01, "trv")){1})); %!test %! assert (isequal (mulrev (infsupdec (-2.0, -0.1, "def"), infsupdec (-2.1, 0.0, "def")), infsupdec (0.0, 2.100000000000000000e+01, "trv"))); %! assert (isequal (decorationpart (mulrev (infsupdec (-2.0, -0.1, "def"), infsupdec (-2.1, 0.0, "def"))){1}, decorationpart (infsupdec (0.0, 2.100000000000000000e+01, "trv")){1})); %!test %! assert (isequal (mulrev (infsupdec (-2.0, -0.1, "com"), infsupdec (-2.1, 0.12, "dac")), infsupdec (-1.199999999999999956e+00, 2.100000000000000000e+01, "trv"))); %! assert (isequal (decorationpart (mulrev (infsupdec (-2.0, -0.1, "com"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (-1.199999999999999956e+00, 2.100000000000000000e+01, "trv")){1})); %!test %! assert (isequal (mulrev (infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (-1.199999999999999956e+00, 0.0, "trv"))); %! assert (isequal (decorationpart (mulrev (infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (-1.199999999999999956e+00, 0.0, "trv")){1})); %!test %! assert (isequal (mulrev (infsupdec (0.01, 1.1, "def"), infsupdec (0.01, 0.12, "dac")), infsupdec (9.090909090909088733e-03, 1.200000000000000000e+01, "trv"))); %! assert (isequal (decorationpart (mulrev (infsupdec (0.01, 1.1, "def"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (9.090909090909088733e-03, 1.200000000000000000e+01, "trv")){1})); %!test %! assert (isequal (mulrev (infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, 0.3, "def")), infsupdec (-inf, 3.000000000000000000e+01, "trv"))); %! assert (isequal (decorationpart (mulrev (infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, 0.3, "def"))){1}, decorationpart (infsupdec (-inf, 3.000000000000000000e+01, "trv")){1})); %!test %! assert (isequal (mulrev (infsupdec (-inf, -0.1, "trv"), infsupdec (-0.21, inf, "dac")), infsupdec (-inf, 2.100000000000000089e+00, "trv"))); %! assert (isequal (decorationpart (mulrev (infsupdec (-inf, -0.1, "trv"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (-inf, 2.100000000000000089e+00, "trv")){1})); ## minimal_mulRev_dec_ten_test %!test %! assert (isequal (mulrev (infsupdec (-2.0, -0.1, "dac"), infsupdec (-2.1, -0.4, "dac"), infsupdec (-2.1, -0.4, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (mulrev (infsupdec (-2.0, -0.1, "dac"), infsupdec (-2.1, -0.4, "dac"), infsupdec (-2.1, -0.4, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (mulrev (infsupdec (-2.0, 1.1, "def"), infsupdec (-2.1, -0.4, "com"), infsupdec (-2.1, -0.4, "com")), infsupdec (-2.1, -0.4, "trv"))); %! assert (isequal (decorationpart (mulrev (infsupdec (-2.0, 1.1, "def"), infsupdec (-2.1, -0.4, "com"), infsupdec (-2.1, -0.4, "com"))){1}, decorationpart (infsupdec (-2.1, -0.4, "trv")){1})); %!test %! assert (isequal (mulrev (infsupdec (0.01, 1.1, "com"), infsupdec (-2.1, 0.0, "dac"), infsupdec (-2.1, 0.0, "dac")), infsupdec (-2.1, 0.0, "trv"))); %! assert (isequal (decorationpart (mulrev (infsupdec (0.01, 1.1, "com"), infsupdec (-2.1, 0.0, "dac"), infsupdec (-2.1, 0.0, "dac"))){1}, decorationpart (infsupdec (-2.1, 0.0, "trv")){1})); %!test %! assert (isequal (mulrev (infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, 0.12, "com"), infsupdec (0.0, 0.12, "com")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (mulrev (infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, 0.12, "com"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (mulrev (infsupdec (-2.0, 1.1, "def"), infsupdec (0.04, inf, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (0.04, inf, "trv"))); %! assert (isequal (decorationpart (mulrev (infsupdec (-2.0, 1.1, "def"), infsupdec (0.04, inf, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (0.04, inf, "trv")){1})); interval-2.1.0/inst/test/libieeep1788_tests_mul_rev.tst0000644000175000017500000044515213031037014022474 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/libieeep1788_tests_mul_rev.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) ## Copyright 2015-2016 Oliver Heimlich ## ## Original author: Marco Nehmeier (unit tests in libieeep1788, ## original license: Apache License 2.0) ## Converted into portable ITL format by Oliver Heimlich with minor corrections. ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## minimal_mulRevToPair_test %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup, infsup (1.0, 2.0)), infsup)); %! assert (isequal (nthargout(2, 2, @mulrev, infsup, infsup (1.0, 2.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (1.0, 2.0), infsup), infsup)); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (1.0, 2.0), infsup), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup, infsup), infsup)); %! assert (isequal (nthargout(2, 2, @mulrev, infsup, infsup), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, -0.1), infsup (-2.1, -0.4)), infsup (2.000000000000000111e-01, 2.100000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, -0.1), infsup (-2.1, -0.4)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 0.0), infsup (-2.1, -0.4)), infsup (2.000000000000000111e-01, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 0.0), infsup (-2.1, -0.4)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 1.1), infsup (-2.1, -0.4)), infsup (-inf, -3.636363636363635909e-01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 1.1), infsup (-2.1, -0.4)), infsup (2.000000000000000111e-01, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 1.1), infsup (-2.1, -0.4)), infsup (-inf, -3.636363636363635909e-01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 1.1), infsup (-2.1, -0.4)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, 1.1), infsup (-2.1, -0.4)), infsup (-2.100000000000000284e+02, -3.636363636363635909e-01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, 1.1), infsup (-2.1, -0.4)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 0.0), infsup (-2.1, -0.4)), infsup)); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 0.0), infsup (-2.1, -0.4)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, -0.1), infsup (-2.1, -0.4)), infsup (0.0, 2.100000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, -0.1), infsup (-2.1, -0.4)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 0.0), infsup (-2.1, -0.4)), infsup (0.0, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 0.0), infsup (-2.1, -0.4)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 1.1), infsup (-2.1, -0.4)), infsup (-inf, -3.636363636363635909e-01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 1.1), infsup (-2.1, -0.4)), infsup (0.0, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, inf), infsup (-2.1, -0.4)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, inf), infsup (-2.1, -0.4)), infsup (2.000000000000000111e-01, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, inf), infsup (-2.1, -0.4)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, inf), infsup (-2.1, -0.4)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, inf), infsup (-2.1, -0.4)), infsup (-2.100000000000000284e+02, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, inf), infsup (-2.1, -0.4)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, inf), infsup (-2.1, -0.4)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, inf), infsup (-2.1, -0.4)), infsup (0.0, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, -0.1), infsup (-2.1, 0.0)), infsup (0.0, 2.100000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, -0.1), infsup (-2.1, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 0.0), infsup (-2.1, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 0.0), infsup (-2.1, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 1.1), infsup (-2.1, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 1.1), infsup (-2.1, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 1.1), infsup (-2.1, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 1.1), infsup (-2.1, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, 1.1), infsup (-2.1, 0.0)), infsup (-2.100000000000000284e+02, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, 1.1), infsup (-2.1, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 0.0), infsup (-2.1, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 0.0), infsup (-2.1, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, -0.1), infsup (-2.1, 0.0)), infsup (0.0, 2.100000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, -0.1), infsup (-2.1, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 0.0), infsup (-2.1, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 0.0), infsup (-2.1, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 1.1), infsup (-2.1, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 1.1), infsup (-2.1, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, inf), infsup (-2.1, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, inf), infsup (-2.1, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, inf), infsup (-2.1, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, inf), infsup (-2.1, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, inf), infsup (-2.1, 0.0)), infsup (-2.100000000000000284e+02, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, inf), infsup (-2.1, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, inf), infsup (-2.1, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, inf), infsup (-2.1, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, -0.1), infsup (-2.1, 0.12)), infsup (-1.199999999999999956e+00, 2.100000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, -0.1), infsup (-2.1, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 0.0), infsup (-2.1, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 0.0), infsup (-2.1, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 1.1), infsup (-2.1, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 1.1), infsup (-2.1, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 1.1), infsup (-2.1, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 1.1), infsup (-2.1, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, 1.1), infsup (-2.1, 0.12)), infsup (-2.100000000000000284e+02, 1.200000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, 1.1), infsup (-2.1, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 0.0), infsup (-2.1, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 0.0), infsup (-2.1, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, -0.1), infsup (-2.1, 0.12)), infsup (-1.199999999999999956e+00, 2.100000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, -0.1), infsup (-2.1, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 0.0), infsup (-2.1, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 0.0), infsup (-2.1, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 1.1), infsup (-2.1, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 1.1), infsup (-2.1, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, inf), infsup (-2.1, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, inf), infsup (-2.1, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, inf), infsup (-2.1, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, inf), infsup (-2.1, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, inf), infsup (-2.1, 0.12)), infsup (-2.100000000000000284e+02, 1.200000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, inf), infsup (-2.1, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, inf), infsup (-2.1, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, inf), infsup (-2.1, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, -0.1), infsup (0.0, 0.12)), infsup (-1.199999999999999956e+00, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, -0.1), infsup (0.0, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 0.0), infsup (0.0, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 0.0), infsup (0.0, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 1.1), infsup (0.0, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 1.1), infsup (0.0, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 1.1), infsup (0.0, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 1.1), infsup (0.0, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, 1.1), infsup (0.0, 0.12)), infsup (0.0, 1.200000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, 1.1), infsup (0.0, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 0.0), infsup (0.0, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 0.0), infsup (0.0, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, -0.1), infsup (0.0, 0.12)), infsup (-1.199999999999999956e+00, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, -0.1), infsup (0.0, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 0.0), infsup (0.0, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 0.0), infsup (0.0, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 1.1), infsup (0.0, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 1.1), infsup (0.0, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, inf), infsup (0.0, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, inf), infsup (0.0, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, inf), infsup (0.0, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, inf), infsup (0.0, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, inf), infsup (0.0, 0.12)), infsup (0.0, 1.200000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, inf), infsup (0.0, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, inf), infsup (0.0, 0.12)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, inf), infsup (0.0, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, -0.1), infsup (0.01, 0.12)), infsup (-1.199999999999999956e+00, -5.000000000000000104e-03))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, -0.1), infsup (0.01, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 0.0), infsup (0.01, 0.12)), infsup (-inf, -5.000000000000000104e-03))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 0.0), infsup (0.01, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 1.1), infsup (0.01, 0.12)), infsup (-inf, -5.000000000000000104e-03))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 1.1), infsup (0.01, 0.12)), infsup (9.090909090909088733e-03, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 1.1), infsup (0.01, 0.12)), infsup (9.090909090909088733e-03, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 1.1), infsup (0.01, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, 1.1), infsup (0.01, 0.12)), infsup (9.090909090909088733e-03, 1.200000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, 1.1), infsup (0.01, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 0.0), infsup (0.01, 0.12)), infsup)); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 0.0), infsup (0.01, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, -0.1), infsup (0.01, 0.12)), infsup (-1.199999999999999956e+00, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, -0.1), infsup (0.01, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 0.0), infsup (0.01, 0.12)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 0.0), infsup (0.01, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 1.1), infsup (0.01, 0.12)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 1.1), infsup (0.01, 0.12)), infsup (9.090909090909088733e-03, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, inf), infsup (0.01, 0.12)), infsup (-inf, -5.000000000000000104e-03))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, inf), infsup (0.01, 0.12)), infsup (0.0, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, inf), infsup (0.01, 0.12)), infsup (0.0, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, inf), infsup (0.01, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, inf), infsup (0.01, 0.12)), infsup (0.0, 1.200000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, inf), infsup (0.01, 0.12)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, inf), infsup (0.01, 0.12)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, inf), infsup (0.01, 0.12)), infsup (0.0, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, -0.1), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, -0.1), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 0.0), infsup (0.0, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 1.1), infsup (0.0, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 1.1), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 1.1), infsup (0.0, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 1.1), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, 1.1), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, 1.1), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, -0.1), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, -0.1), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 0.0), infsup (0.0, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 1.1), infsup (0.0, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 1.1), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, inf), infsup (0.0, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, inf), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, inf), infsup (0.0, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, inf), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, inf), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, inf), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, inf), infsup (0.0, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, inf), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, -0.1), infsup (-inf, -0.1)), infsup (5.000000000000000278e-02, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, -0.1), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 0.0), infsup (-inf, -0.1)), infsup (5.000000000000000278e-02, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 0.0), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 1.1), infsup (-inf, -0.1)), infsup (-inf, -9.090909090909089774e-02))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 1.1), infsup (-inf, -0.1)), infsup (5.000000000000000278e-02, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 1.1), infsup (-inf, -0.1)), infsup (-inf, -9.090909090909089774e-02))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 1.1), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, 1.1), infsup (-inf, -0.1)), infsup (-inf, -9.090909090909089774e-02))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, 1.1), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 0.0), infsup (-inf, -0.1)), infsup)); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 0.0), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, -0.1), infsup (-inf, -0.1)), infsup (0.0, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, -0.1), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 0.0), infsup (-inf, -0.1)), infsup (0.0, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 0.0), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 1.1), infsup (-inf, -0.1)), infsup (-inf, -9.090909090909089774e-02))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 1.1), infsup (-inf, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, inf), infsup (-inf, -0.1)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, inf), infsup (-inf, -0.1)), infsup (5.000000000000000278e-02, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, inf), infsup (-inf, -0.1)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, inf), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, inf), infsup (-inf, -0.1)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, inf), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, inf), infsup (-inf, -0.1)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, inf), infsup (-inf, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, -0.1), infsup (-inf, 0.0)), infsup (0.0, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, -0.1), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 0.0), infsup (-inf, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 0.0), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 1.1), infsup (-inf, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 1.1), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 1.1), infsup (-inf, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 1.1), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, 1.1), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, 1.1), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 0.0), infsup (-inf, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 0.0), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, -0.1), infsup (-inf, 0.0)), infsup (0.0, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, -0.1), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 0.0), infsup (-inf, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 0.0), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 1.1), infsup (-inf, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 1.1), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, inf), infsup (-inf, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, inf), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, inf), infsup (-inf, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, inf), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, inf), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, inf), infsup (-inf, 0.0)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, inf), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, -0.1), infsup (-inf, 0.3)), infsup (-3.000000000000000000e+00, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, -0.1), infsup (-inf, 0.3)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 0.0), infsup (-inf, 0.3)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 0.0), infsup (-inf, 0.3)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 1.1), infsup (-inf, 0.3)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 1.1), infsup (-inf, 0.3)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 1.1), infsup (-inf, 0.3)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 1.1), infsup (-inf, 0.3)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, 1.1), infsup (-inf, 0.3)), infsup (-inf, 3.000000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, 1.1), infsup (-inf, 0.3)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 0.0), infsup (-inf, 0.3)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 0.0), infsup (-inf, 0.3)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, -0.1), infsup (-inf, 0.3)), infsup (-3.000000000000000000e+00, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, -0.1), infsup (-inf, 0.3)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 0.0), infsup (-inf, 0.3)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 0.0), infsup (-inf, 0.3)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 1.1), infsup (-inf, 0.3)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 1.1), infsup (-inf, 0.3)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, inf), infsup (-inf, 0.3)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, inf), infsup (-inf, 0.3)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, inf), infsup (-inf, 0.3)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, inf), infsup (-inf, 0.3)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, inf), infsup (-inf, 0.3)), infsup (-inf, 3.000000000000000000e+01))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, inf), infsup (-inf, 0.3)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, inf), infsup (-inf, 0.3)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, inf), infsup (-inf, 0.3)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, -0.1), infsup (-0.21, inf)), infsup (-inf, 2.100000000000000089e+00))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, -0.1), infsup (-0.21, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 0.0), infsup (-0.21, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 0.0), infsup (-0.21, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 1.1), infsup (-0.21, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 1.1), infsup (-0.21, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 1.1), infsup (-0.21, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 1.1), infsup (-0.21, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, 1.1), infsup (-0.21, inf)), infsup (-2.100000000000000000e+01, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, 1.1), infsup (-0.21, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 0.0), infsup (-0.21, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 0.0), infsup (-0.21, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, -0.1), infsup (-0.21, inf)), infsup (-inf, 2.100000000000000089e+00))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, -0.1), infsup (-0.21, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 0.0), infsup (-0.21, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 0.0), infsup (-0.21, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 1.1), infsup (-0.21, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 1.1), infsup (-0.21, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, inf), infsup (-0.21, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, inf), infsup (-0.21, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, inf), infsup (-0.21, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, inf), infsup (-0.21, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, inf), infsup (-0.21, inf)), infsup (-2.100000000000000000e+01, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, inf), infsup (-0.21, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, inf), infsup (-0.21, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, inf), infsup (-0.21, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, -0.1), infsup (0.0, inf)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, -0.1), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 0.0), infsup (0.0, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 0.0), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 1.1), infsup (0.0, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 1.1), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 1.1), infsup (0.0, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 1.1), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, 1.1), infsup (0.0, inf)), infsup (0.0, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, 1.1), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 0.0), infsup (0.0, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 0.0), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, -0.1), infsup (0.0, inf)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, -0.1), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 0.0), infsup (0.0, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 0.0), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 1.1), infsup (0.0, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 1.1), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, inf), infsup (0.0, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, inf), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, inf), infsup (0.0, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, inf), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, inf), infsup (0.0, inf)), infsup (0.0, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, inf), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, inf), infsup (0.0, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, inf), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, -0.1), infsup (0.04, inf)), infsup (-inf, -2.000000000000000042e-02))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, -0.1), infsup (0.04, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 0.0), infsup (0.04, inf)), infsup (-inf, -2.000000000000000042e-02))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 0.0), infsup (0.04, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 1.1), infsup (0.04, inf)), infsup (-inf, -2.000000000000000042e-02))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 1.1), infsup (0.04, inf)), infsup (3.636363636363635493e-02, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 1.1), infsup (0.04, inf)), infsup (3.636363636363635493e-02, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 1.1), infsup (0.04, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, 1.1), infsup (0.04, inf)), infsup (3.636363636363635493e-02, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, 1.1), infsup (0.04, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 0.0), infsup (0.04, inf)), infsup)); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 0.0), infsup (0.04, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, -0.1), infsup (0.04, inf)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, -0.1), infsup (0.04, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 0.0), infsup (0.04, inf)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 0.0), infsup (0.04, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 1.1), infsup (0.04, inf)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 1.1), infsup (0.04, inf)), infsup (3.636363636363635493e-02, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, inf), infsup (0.04, inf)), infsup (-inf, -2.000000000000000042e-02))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, inf), infsup (0.04, inf)), infsup (0.0, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, inf), infsup (0.04, inf)), infsup (0.0, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, inf), infsup (0.04, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, inf), infsup (0.04, inf)), infsup (0.0, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, inf), infsup (0.04, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, inf), infsup (0.04, inf)), infsup (-inf, 0.0))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, inf), infsup (0.04, inf)), infsup (0.0, inf))); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, -0.1), infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, -0.1), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 0.0), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, 1.1), infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, 1.1), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 1.1), infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 1.1), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, 1.1), infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, 1.1), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, 0.0), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, -0.1), infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, -0.1), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 0.0), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, 1.1), infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, 1.1), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-2.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-2.0, inf), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.0, inf), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (0.01, inf), infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (0.01, inf), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (nthargout(2, 2, @mulrev, infsup (-inf, inf), infsup (-inf, inf)), infsup)); ## minimal_mulRevToPair_dec_test %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (empty, "trv"), infsupdec (1.0, 2.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (empty, "trv"), infsupdec (1.0, 2.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (empty, "trv"), infsupdec (1.0, 2.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (empty, "trv"), infsupdec (1.0, 2.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (1.0, 2.0, "com"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (1.0, 2.0, "com"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (1.0, 2.0, "com"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (1.0, 2.0, "com"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (empty, "trv"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (empty, "trv"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (empty, "trv"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (empty, "trv"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "com"), infsupdec (-2.1, -0.4, "com")), infsupdec (2.000000000000000111e-01, 2.100000000000000000e+01, "com"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "com"), infsupdec (-2.1, -0.4, "com"))){1}, decorationpart (infsupdec (2.000000000000000111e-01, 2.100000000000000000e+01, "com")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "com"), infsupdec (-2.1, -0.4, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "com"), infsupdec (-2.1, -0.4, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-2.1, -0.4, "com")), infsupdec (2.000000000000000111e-01, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-2.1, -0.4, "com"))){1}, decorationpart (infsupdec (2.000000000000000111e-01, inf, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-2.1, -0.4, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-2.1, -0.4, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "com"), infsupdec (-2.1, -0.4, "dac")), infsupdec (-inf, -3.636363636363635909e-01, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "com"), infsupdec (-2.1, -0.4, "dac"))){1}, decorationpart (infsupdec (-inf, -3.636363636363635909e-01, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "com"), infsupdec (-2.1, -0.4, "dac")), infsupdec (2.000000000000000111e-01, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "com"), infsupdec (-2.1, -0.4, "dac"))){1}, decorationpart (infsupdec (2.000000000000000111e-01, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "trv"), infsupdec (-2.1, -0.4, "def")), infsupdec (-inf, -3.636363636363635909e-01, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "trv"), infsupdec (-2.1, -0.4, "def"))){1}, decorationpart (infsupdec (-inf, -3.636363636363635909e-01, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "trv"), infsupdec (-2.1, -0.4, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "trv"), infsupdec (-2.1, -0.4, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "com"), infsupdec (-2.1, -0.4, "com")), infsupdec (-2.100000000000000284e+02, -3.636363636363635909e-01, "com"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "com"), infsupdec (-2.1, -0.4, "com"))){1}, decorationpart (infsupdec (-2.100000000000000284e+02, -3.636363636363635909e-01, "com")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "com"), infsupdec (-2.1, -0.4, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "com"), infsupdec (-2.1, -0.4, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-2.1, -0.4, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-2.1, -0.4, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-2.1, -0.4, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-2.1, -0.4, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-2.1, -0.4, "dac")), infsupdec (0.0, 2.100000000000000000e+01, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-2.1, -0.4, "dac"))){1}, decorationpart (infsupdec (0.0, 2.100000000000000000e+01, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-2.1, -0.4, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-2.1, -0.4, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "def"), infsupdec (-2.1, -0.4, "com")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "def"), infsupdec (-2.1, -0.4, "com"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "def"), infsupdec (-2.1, -0.4, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "def"), infsupdec (-2.1, -0.4, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "trv"), infsupdec (-2.1, -0.4, "def")), infsupdec (-inf, -3.636363636363635909e-01, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "trv"), infsupdec (-2.1, -0.4, "def"))){1}, decorationpart (infsupdec (-inf, -3.636363636363635909e-01, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "trv"), infsupdec (-2.1, -0.4, "def")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "trv"), infsupdec (-2.1, -0.4, "def"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-2.1, -0.4, "dac")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-2.1, -0.4, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-2.1, -0.4, "dac")), infsupdec (2.000000000000000111e-01, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-2.1, -0.4, "dac"))){1}, decorationpart (infsupdec (2.000000000000000111e-01, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "def"), infsupdec (-2.1, -0.4, "com")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "def"), infsupdec (-2.1, -0.4, "com"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "def"), infsupdec (-2.1, -0.4, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "def"), infsupdec (-2.1, -0.4, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "def"), infsupdec (-2.1, -0.4, "def")), infsupdec (-2.100000000000000284e+02, 0.0, "def"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "def"), infsupdec (-2.1, -0.4, "def"))){1}, decorationpart (infsupdec (-2.100000000000000284e+02, 0.0, "def")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "def"), infsupdec (-2.1, -0.4, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "def"), infsupdec (-2.1, -0.4, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-2.1, -0.4, "dac")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-2.1, -0.4, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-2.1, -0.4, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-2.1, -0.4, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (0.0, 2.100000000000000000e+01, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (0.0, 2.100000000000000000e+01, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (-2.100000000000000284e+02, 0.0, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (-2.100000000000000284e+02, 0.0, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (0.0, 2.100000000000000000e+01, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (0.0, 2.100000000000000000e+01, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (-2.100000000000000284e+02, 0.0, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (-2.100000000000000284e+02, 0.0, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-2.1, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-2.1, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (-1.199999999999999956e+00, 2.100000000000000000e+01, "def"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (-1.199999999999999956e+00, 2.100000000000000000e+01, "def")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (-2.100000000000000284e+02, 1.200000000000000000e+01, "def"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (-2.100000000000000284e+02, 1.200000000000000000e+01, "def")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (-1.199999999999999956e+00, 2.100000000000000000e+01, "def"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (-1.199999999999999956e+00, 2.100000000000000000e+01, "def")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (-2.100000000000000284e+02, 1.200000000000000000e+01, "def"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (-2.100000000000000284e+02, 1.200000000000000000e+01, "def")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (entire, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (entire, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (entire, "def"), infsupdec (-2.1, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (entire, "def"), infsupdec (-2.1, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, 0.12, "com")), infsupdec (-1.199999999999999956e+00, 0.0, "com"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (-1.199999999999999956e+00, 0.0, "com")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, 0.12, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "com"), infsupdec (0.0, 0.12, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "com"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "com"), infsupdec (0.0, 0.12, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "com"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "com"), infsupdec (0.0, 0.12, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "com"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "com"), infsupdec (0.0, 0.12, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "com"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "com"), infsupdec (0.0, 0.12, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "com"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "com"), infsupdec (0.0, 0.12, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "com"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "com"), infsupdec (0.0, 0.12, "com")), infsupdec (0.0, 1.200000000000000000e+01, "com"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "com"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (0.0, 1.200000000000000000e+01, "com")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "com"), infsupdec (0.0, 0.12, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "com"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "com"), infsupdec (0.0, 0.12, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "com"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "com"), infsupdec (0.0, 0.12, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "com"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (-1.199999999999999956e+00, 0.0, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (-1.199999999999999956e+00, 0.0, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (0.0, 1.200000000000000000e+01, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (0.0, 1.200000000000000000e+01, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.0, 0.12, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.0, 0.12, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (-1.199999999999999956e+00, -5.000000000000000104e-03, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (-1.199999999999999956e+00, -5.000000000000000104e-03, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (-inf, -5.000000000000000104e-03, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (-inf, -5.000000000000000104e-03, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (-inf, -5.000000000000000104e-03, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (-inf, -5.000000000000000104e-03, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (9.090909090909088733e-03, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (9.090909090909088733e-03, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (9.090909090909088733e-03, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (9.090909090909088733e-03, inf, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (9.090909090909088733e-03, 1.200000000000000000e+01, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (9.090909090909088733e-03, 1.200000000000000000e+01, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (-1.199999999999999956e+00, 0.0, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (-1.199999999999999956e+00, 0.0, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (9.090909090909088733e-03, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (9.090909090909088733e-03, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (-inf, -5.000000000000000104e-03, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (-inf, -5.000000000000000104e-03, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (0.0, 1.200000000000000000e+01, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (0.0, 1.200000000000000000e+01, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.01, 0.12, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.01, 0.12, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (0.0, 0.0, "com"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "com")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (0.0, 0.0, "com"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "com")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (0.0, 0.0, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (0.0, 0.0, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (5.000000000000000278e-02, inf, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (5.000000000000000278e-02, inf, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (5.000000000000000278e-02, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (5.000000000000000278e-02, inf, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (-inf, -9.090909090909089774e-02, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (-inf, -9.090909090909089774e-02, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (5.000000000000000278e-02, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (5.000000000000000278e-02, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (-inf, -9.090909090909089774e-02, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (-inf, -9.090909090909089774e-02, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (-inf, -9.090909090909089774e-02, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (-inf, -9.090909090909089774e-02, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (-inf, -9.090909090909089774e-02, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (-inf, -9.090909090909089774e-02, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (5.000000000000000278e-02, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (5.000000000000000278e-02, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (-inf, 0.0, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-inf, -0.1, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-inf, -0.1, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (-inf, 0.0, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (-inf, 0.0, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-inf, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (-3.000000000000000000e+00, inf, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (-3.000000000000000000e+00, inf, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (-inf, 3.000000000000000000e+01, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (-inf, 3.000000000000000000e+01, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (-3.000000000000000000e+00, inf, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (-3.000000000000000000e+00, inf, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (-inf, 3.000000000000000000e+01, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (-inf, 3.000000000000000000e+01, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-inf, 0.3, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-inf, 0.3, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (-inf, 2.100000000000000089e+00, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (-inf, 2.100000000000000089e+00, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (-2.100000000000000000e+01, inf, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (-2.100000000000000000e+01, inf, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (-inf, 2.100000000000000089e+00, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (-inf, 2.100000000000000089e+00, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (-2.100000000000000000e+01, inf, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (-2.100000000000000000e+01, inf, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-0.21, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (-0.21, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (-inf, 0.0, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (-inf, 0.0, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.0, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (-inf, -2.000000000000000042e-02, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (-inf, -2.000000000000000042e-02, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (-inf, -2.000000000000000042e-02, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (-inf, -2.000000000000000042e-02, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (-inf, -2.000000000000000042e-02, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (-inf, -2.000000000000000042e-02, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (3.636363636363635493e-02, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (3.636363636363635493e-02, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (3.636363636363635493e-02, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (3.636363636363635493e-02, inf, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (3.636363636363635493e-02, inf, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (3.636363636363635493e-02, inf, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (-inf, 0.0, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (3.636363636363635493e-02, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (3.636363636363635493e-02, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (-inf, -2.000000000000000042e-02, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (-inf, -2.000000000000000042e-02, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.04, inf, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (0.04, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (entire, "dac")), infsupdec (entire, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (entire, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (entire, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, -0.1, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (entire, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (entire, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 0.0, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (entire, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (entire, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, 1.1, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (entire, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (entire, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 1.1, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (entire, "dac")), infsupdec (entire, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (entire, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (entire, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, 1.1, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (entire, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (entire, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, 0.0, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (entire, "dac")), infsupdec (entire, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (entire, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (entire, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, -0.1, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (entire, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (entire, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 0.0, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (entire, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (entire, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-inf, 1.1, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (entire, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (entire, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (-2.0, inf, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (entire, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (entire, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.0, inf, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (entire, "dac")), infsupdec (entire, "dac"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (entire, "dac")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (entire, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (0.01, inf, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (entire, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (nthargout(1, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (entire, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (nthargout(2, 2, @mulrev, infsupdec (entire, "dac"), infsupdec (entire, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); interval-2.1.0/inst/test/libieeep1788_tests_cancel.tst0000644000175000017500000016231113031037014022241 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/libieeep1788_tests_cancel.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) ## Copyright 2015-2016 Oliver Heimlich ## ## Original author: Marco Nehmeier (unit tests in libieeep1788, ## original license: Apache License 2.0) ## Converted into portable ITL format by Oliver Heimlich with minor corrections. ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## minimal_cancelPlus_test %!test %! assert (isequal (cancelplus (infsup (-inf, -1.0), infsup), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-1.0, inf), infsup), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-inf, inf), infsup), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-inf, -1.0), infsup (-5.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-1.0, inf), infsup (-5.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-inf, inf), infsup (-5.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-inf, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup, infsup (1.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup, infsup (-inf, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup, infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-1.0, 5.0), infsup (1.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-1.0, 5.0), infsup (-inf, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-1.0, 5.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-inf, inf), infsup (1.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-inf, inf), infsup (-inf, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-5.0, -1.0), infsup (1.0, 5.1)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-5.0, -1.0), infsup (0.9, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-5.0, -1.0), infsup (0.9, 5.1)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-10.0, 5.0), infsup (-5.0, 10.1)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-10.0, 5.0), infsup (-5.1, 10.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-10.0, 5.0), infsup (-5.1, 10.1)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (1.0, 5.0), infsup (-5.0, -0.9)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (1.0, 5.0), infsup (-5.1, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (1.0, 5.0), infsup (-5.1, -0.9)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-10.0, -1.0), infsup), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-10.0, 5.0), infsup), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (1.0, 5.0), infsup), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup, infsup), infsup)); %!test %! assert (isequal (cancelplus (infsup, infsup (1.0, 10.0)), infsup)); %!test %! assert (isequal (cancelplus (infsup, infsup (-5.0, 10.0)), infsup)); %!test %! assert (isequal (cancelplus (infsup, infsup (-5.0, -1.0)), infsup)); %!test %! assert (isequal (cancelplus (infsup (-5.1, -0.0), infsup (0.0, 5.0)), infsup (-9.999999999999964473e-02, 0.0))); %!test %! assert (isequal (cancelplus (infsup (-5.1, -1.0), infsup (1.0, 5.0)), infsup (-9.999999999999964473e-02, 0.0))); %!test %! assert (isequal (cancelplus (infsup (-5.0, -0.9), infsup (1.0, 5.0)), infsup (0.0, 9.999999999999997780e-02))); %!test %! assert (isequal (cancelplus (infsup (-5.1, -0.9), infsup (1.0, 5.0)), infsup (-9.999999999999964473e-02, 9.999999999999997780e-02))); %!test %! assert (isequal (cancelplus (infsup (-5.0, -1.0), infsup (1.0, 5.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (cancelplus (infsup (-10.1, 5.0), infsup (-5.0, 10.0)), infsup (-9.999999999999964473e-02, 0.0))); %!test %! assert (isequal (cancelplus (infsup (-10.0, 5.1), infsup (-5.0, 10.0)), infsup (0.0, 9.999999999999964473e-02))); %!test %! assert (isequal (cancelplus (infsup (-10.1, 5.1), infsup (-5.0, 10.0)), infsup (-9.999999999999964473e-02, 9.999999999999964473e-02))); %!test %! assert (isequal (cancelplus (infsup (-10.0, 5.0), infsup (-5.0, 10.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (cancelplus (infsup (0.9, 5.0), infsup (-5.0, -1.0)), infsup (-9.999999999999997780e-02, 0.0))); %!test %! assert (isequal (cancelplus (infsup (1.0, 5.1), infsup (-5.0, -1.0)), infsup (0.0, 9.999999999999964473e-02))); %!test %! assert (isequal (cancelplus (infsup (0.0, 5.1), infsup (-5.0, -0.0)), infsup (0.0, 9.999999999999964473e-02))); %!test %! assert (isequal (cancelplus (infsup (0.9, 5.1), infsup (-5.0, -1.0)), infsup (-9.999999999999997780e-02, 9.999999999999964473e-02))); %!test %! assert (isequal (cancelplus (infsup (1.0, 5.0), infsup (-5.0, -1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (cancelplus (infsup (0.0, 5.0), infsup (-5.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (cancelplus (infsup (1.999999999999996447e+00, 1.999999999999996447e+00), infsup (-1.000000000000000056e-01, -1.000000000000000056e-01)), infsup (1.899999999999996358e+00, 1.899999999999996581e+00))); %!test %! assert (isequal (cancelplus (infsup (-1.000000000000000056e-01, 1.999999999999996447e+00), infsup (-1.000000000000000056e-01, 0.01)), infsup (-9.000000000000001055e-02, 1.899999999999996581e+00))); %!test %! assert (isequal (cancelplus (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), infsup (1.797693134862315708e+308, 1.797693134862315708e+308)), infsup (1.797693134862315708e+308, inf))); %!test %! assert (isequal (cancelplus (infsup (-1.797693134862315708e+308, 1.797693134862315708e+308), infsup (-1.797693134862315708e+308, 1.797693134862315708e+308)), infsup (0.0, 0.0))); %!test %! assert (isequal (cancelplus (infsup (-1.797693134862315708e+308, 1.797693134862315708e+308), infsup (-1.797693134862315509e+308, 1.797693134862315708e+308)), infsup (0.0, 1.995840309534719812e+292))); %!test %! assert (isequal (cancelplus (infsup (-1.797693134862315708e+308, 1.797693134862315708e+308), infsup (-1.797693134862315708e+308, 1.797693134862315509e+308)), infsup (-1.995840309534719812e+292, 0.0))); %!test %! assert (isequal (cancelplus (infsup (-1.797693134862315708e+308, 1.797693134862315509e+308), infsup (-1.797693134862315708e+308, 1.797693134862315708e+308)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-1.797693134862315509e+308, 1.797693134862315708e+308), infsup (-1.797693134862315708e+308, 1.797693134862315708e+308)), infsup (-inf, inf))); %!test %! assert (isequal (cancelplus (infsup (-1.000000000000000000e+00, 2.220446049250312834e-16), infsup (-1.000000000000000000e+00, 2.220446049250312588e-16)), infsup (-9.999999999999998890e-01, -9.999999999999997780e-01))); %!test %! assert (isequal (cancelplus (infsup (-1.000000000000000000e+00, 2.220446049250312588e-16), infsup (-1.000000000000000000e+00, 2.220446049250312834e-16)), infsup (-inf, inf))); ## minimal_cancelPlus_dec_test %!test %! assert (isequal (cancelplus (infsupdec (-inf, -1.0, "dac"), infsupdec (empty, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-inf, -1.0, "dac"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.0, inf, "def"), infsupdec (empty, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.0, inf, "def"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (entire, "def"), infsupdec (empty, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (entire, "def"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-inf, -1.0, "dac"), infsupdec (-5.0, 1.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-inf, -1.0, "dac"), infsupdec (-5.0, 1.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.0, inf, "trv"), infsupdec (-5.0, 1.0, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.0, inf, "trv"), infsupdec (-5.0, 1.0, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (entire, "def"), infsupdec (-5.0, 1.0, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (entire, "def"), infsupdec (-5.0, 1.0, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-inf, -1.0, "dac"), infsupdec (entire, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-inf, -1.0, "dac"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.0, inf, "def"), infsupdec (entire, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.0, inf, "def"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (empty, "trv"), infsupdec (1.0, inf, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (empty, "trv"), infsupdec (1.0, inf, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (empty, "trv"), infsupdec (-inf, 1.0, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (empty, "trv"), infsupdec (-inf, 1.0, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (empty, "trv"), infsupdec (entire, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (empty, "trv"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.0, 5.0, "dac"), infsupdec (1.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.0, 5.0, "dac"), infsupdec (1.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.0, 5.0, "def"), infsupdec (-inf, 1.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.0, 5.0, "def"), infsupdec (-inf, 1.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.0, 5.0, "com"), infsupdec (entire, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.0, 5.0, "com"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (entire, "def"), infsupdec (1.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (entire, "def"), infsupdec (1.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (entire, "def"), infsupdec (-inf, 1.0, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (entire, "def"), infsupdec (-inf, 1.0, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (entire, "def"), infsupdec (entire, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (entire, "def"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-5.0, -1.0, "com"), infsupdec (1.0, 5.1, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-5.0, -1.0, "com"), infsupdec (1.0, 5.1, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-5.0, -1.0, "dac"), infsupdec (0.9, 5.0, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-5.0, -1.0, "dac"), infsupdec (0.9, 5.0, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-5.0, -1.0, "def"), infsupdec (0.9, 5.1, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-5.0, -1.0, "def"), infsupdec (0.9, 5.1, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-10.0, 5.0, "trv"), infsupdec (-5.0, 10.1, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-10.0, 5.0, "trv"), infsupdec (-5.0, 10.1, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-10.0, 5.0, "com"), infsupdec (-5.1, 10.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-10.0, 5.0, "com"), infsupdec (-5.1, 10.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-10.0, 5.0, "dac"), infsupdec (-5.1, 10.1, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-10.0, 5.0, "dac"), infsupdec (-5.1, 10.1, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (1.0, 5.0, "def"), infsupdec (-5.0, -0.9, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (1.0, 5.0, "def"), infsupdec (-5.0, -0.9, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (1.0, 5.0, "trv"), infsupdec (-5.1, -1.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (1.0, 5.0, "trv"), infsupdec (-5.1, -1.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (1.0, 5.0, "dac"), infsupdec (-5.1, -0.9, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (1.0, 5.0, "dac"), infsupdec (-5.1, -0.9, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-10.0, -1.0, "trv"), infsupdec (empty, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-10.0, -1.0, "trv"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-10.0, 5.0, "def"), infsupdec (empty, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-10.0, 5.0, "def"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (1.0, 5.0, "com"), infsupdec (empty, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (1.0, 5.0, "com"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (empty, "trv"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (empty, "trv"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (empty, "trv"), infsupdec (1.0, 10.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (empty, "trv"), infsupdec (1.0, 10.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (empty, "trv"), infsupdec (-5.0, 10.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (empty, "trv"), infsupdec (-5.0, 10.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (empty, "trv"), infsupdec (-5.0, -1.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (empty, "trv"), infsupdec (-5.0, -1.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-5.1, -0.0, "com"), infsupdec (0.0, 5.0, "com")), infsupdec (-9.999999999999964473e-02, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-5.1, -0.0, "com"), infsupdec (0.0, 5.0, "com"))){1}, decorationpart (infsupdec (-9.999999999999964473e-02, 0.0, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-5.1, -1.0, "com"), infsupdec (1.0, 5.0, "dac")), infsupdec (-9.999999999999964473e-02, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-5.1, -1.0, "com"), infsupdec (1.0, 5.0, "dac"))){1}, decorationpart (infsupdec (-9.999999999999964473e-02, 0.0, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-5.0, -0.9, "com"), infsupdec (1.0, 5.0, "def")), infsupdec (0.0, 9.999999999999997780e-02, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-5.0, -0.9, "com"), infsupdec (1.0, 5.0, "def"))){1}, decorationpart (infsupdec (0.0, 9.999999999999997780e-02, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-5.1, -0.9, "dac"), infsupdec (1.0, 5.0, "trv")), infsupdec (-9.999999999999964473e-02, 9.999999999999997780e-02, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-5.1, -0.9, "dac"), infsupdec (1.0, 5.0, "trv"))){1}, decorationpart (infsupdec (-9.999999999999964473e-02, 9.999999999999997780e-02, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-5.0, -1.0, "dac"), infsupdec (1.0, 5.0, "com")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-5.0, -1.0, "dac"), infsupdec (1.0, 5.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-10.1, 5.0, "dac"), infsupdec (-5.0, 10.0, "dac")), infsupdec (-9.999999999999964473e-02, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-10.1, 5.0, "dac"), infsupdec (-5.0, 10.0, "dac"))){1}, decorationpart (infsupdec (-9.999999999999964473e-02, 0.0, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-10.0, 5.1, "def"), infsupdec (-5.0, 10.0, "def")), infsupdec (0.0, 9.999999999999964473e-02, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-10.0, 5.1, "def"), infsupdec (-5.0, 10.0, "def"))){1}, decorationpart (infsupdec (0.0, 9.999999999999964473e-02, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-10.1, 5.1, "def"), infsupdec (-5.0, 10.0, "trv")), infsupdec (-9.999999999999964473e-02, 9.999999999999964473e-02, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-10.1, 5.1, "def"), infsupdec (-5.0, 10.0, "trv"))){1}, decorationpart (infsupdec (-9.999999999999964473e-02, 9.999999999999964473e-02, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-10.0, 5.0, "def"), infsupdec (-5.0, 10.0, "com")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-10.0, 5.0, "def"), infsupdec (-5.0, 10.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (0.9, 5.0, "trv"), infsupdec (-5.0, -1.0, "dac")), infsupdec (-9.999999999999997780e-02, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (0.9, 5.0, "trv"), infsupdec (-5.0, -1.0, "dac"))){1}, decorationpart (infsupdec (-9.999999999999997780e-02, 0.0, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (1.0, 5.1, "trv"), infsupdec (-5.0, -1.0, "def")), infsupdec (0.0, 9.999999999999964473e-02, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (1.0, 5.1, "trv"), infsupdec (-5.0, -1.0, "def"))){1}, decorationpart (infsupdec (0.0, 9.999999999999964473e-02, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (0.0, 5.1, "trv"), infsupdec (-5.0, -0.0, "trv")), infsupdec (0.0, 9.999999999999964473e-02, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (0.0, 5.1, "trv"), infsupdec (-5.0, -0.0, "trv"))){1}, decorationpart (infsupdec (0.0, 9.999999999999964473e-02, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (0.9, 5.1, "com"), infsupdec (-5.0, -1.0, "com")), infsupdec (-9.999999999999997780e-02, 9.999999999999964473e-02, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (0.9, 5.1, "com"), infsupdec (-5.0, -1.0, "com"))){1}, decorationpart (infsupdec (-9.999999999999997780e-02, 9.999999999999964473e-02, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (1.0, 5.0, "dac"), infsupdec (-5.0, -1.0, "dac")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (1.0, 5.0, "dac"), infsupdec (-5.0, -1.0, "dac"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (0.0, 5.0, "def"), infsupdec (-5.0, -0.0, "trv")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (0.0, 5.0, "def"), infsupdec (-5.0, -0.0, "trv"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (1.999999999999996447e+00, 1.999999999999996447e+00, "com"), infsupdec (-1.000000000000000056e-01, -1.000000000000000056e-01, "com")), infsupdec (1.899999999999996358e+00, 1.899999999999996581e+00, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (1.999999999999996447e+00, 1.999999999999996447e+00, "com"), infsupdec (-1.000000000000000056e-01, -1.000000000000000056e-01, "com"))){1}, decorationpart (infsupdec (1.899999999999996358e+00, 1.899999999999996581e+00, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.000000000000000056e-01, 1.999999999999996447e+00, "dac"), infsupdec (-1.000000000000000056e-01, 0.01, "com")), infsupdec (-9.000000000000001055e-02, 1.899999999999996581e+00, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.000000000000000056e-01, 1.999999999999996447e+00, "dac"), infsupdec (-1.000000000000000056e-01, 0.01, "com"))){1}, decorationpart (infsupdec (-9.000000000000001055e-02, 1.899999999999996581e+00, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "com"), infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "com")), infsupdec (1.797693134862315708e+308, inf, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "com"), infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (1.797693134862315708e+308, inf, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "dac"), infsupdec (-1.797693134862315509e+308, 1.797693134862315708e+308, "com")), infsupdec (0.0, 1.995840309534719812e+292, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "dac"), infsupdec (-1.797693134862315509e+308, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (0.0, 1.995840309534719812e+292, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "dac"), infsupdec (-1.797693134862315708e+308, 1.797693134862315509e+308, "com")), infsupdec (-1.995840309534719812e+292, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "dac"), infsupdec (-1.797693134862315708e+308, 1.797693134862315509e+308, "com"))){1}, decorationpart (infsupdec (-1.995840309534719812e+292, 0.0, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.797693134862315708e+308, 1.797693134862315509e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.797693134862315708e+308, 1.797693134862315509e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.797693134862315509e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.797693134862315509e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.000000000000000000e+00, 2.220446049250312834e-16, "dac"), infsupdec (-1.000000000000000000e+00, 2.220446049250312588e-16, "com")), infsupdec (-9.999999999999998890e-01, -9.999999999999997780e-01, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.000000000000000000e+00, 2.220446049250312834e-16, "dac"), infsupdec (-1.000000000000000000e+00, 2.220446049250312588e-16, "com"))){1}, decorationpart (infsupdec (-9.999999999999998890e-01, -9.999999999999997780e-01, "trv")){1})); %!test %! assert (isequal (cancelplus (infsupdec (-1.000000000000000000e+00, 2.220446049250312588e-16, "def"), infsupdec (-1.000000000000000000e+00, 2.220446049250312834e-16, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelplus (infsupdec (-1.000000000000000000e+00, 2.220446049250312588e-16, "def"), infsupdec (-1.000000000000000000e+00, 2.220446049250312834e-16, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); ## minimal_cancelMinus_test %!test %! assert (isequal (cancelminus (infsup (-inf, -1.0), infsup), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-1.0, inf), infsup), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-inf, inf), infsup), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-inf, -1.0), infsup (-1.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-1.0, inf), infsup (-1.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-inf, inf), infsup (-1.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-inf, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup, infsup (-inf, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup, infsup (-1.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup, infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-1.0, 5.0), infsup (-inf, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-1.0, 5.0), infsup (-1.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-1.0, 5.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-inf, inf), infsup (-inf, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-inf, inf), infsup (-1.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-5.0, -1.0), infsup (-5.1, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-5.0, -1.0), infsup (-5.0, -0.9)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-5.0, -1.0), infsup (-5.1, -0.9)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-10.0, 5.0), infsup (-10.1, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-10.0, 5.0), infsup (-10.0, 5.1)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-10.0, 5.0), infsup (-10.1, 5.1)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (1.0, 5.0), infsup (0.9, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (1.0, 5.0), infsup (1.0, 5.1)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (1.0, 5.0), infsup (0.9, 5.1)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-10.0, -1.0), infsup), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-10.0, 5.0), infsup), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (1.0, 5.0), infsup), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup, infsup), infsup)); %!test %! assert (isequal (cancelminus (infsup, infsup (-10.0, -1.0)), infsup)); %!test %! assert (isequal (cancelminus (infsup, infsup (-10.0, 5.0)), infsup)); %!test %! assert (isequal (cancelminus (infsup, infsup (1.0, 5.0)), infsup)); %!test %! assert (isequal (cancelminus (infsup (-5.1, -0.0), infsup (-5.0, 0.0)), infsup (-9.999999999999964473e-02, 0.0))); %!test %! assert (isequal (cancelminus (infsup (-5.1, -1.0), infsup (-5.0, -1.0)), infsup (-9.999999999999964473e-02, 0.0))); %!test %! assert (isequal (cancelminus (infsup (-5.0, -0.9), infsup (-5.0, -1.0)), infsup (0.0, 9.999999999999997780e-02))); %!test %! assert (isequal (cancelminus (infsup (-5.1, -0.9), infsup (-5.0, -1.0)), infsup (-9.999999999999964473e-02, 9.999999999999997780e-02))); %!test %! assert (isequal (cancelminus (infsup (-5.0, -1.0), infsup (-5.0, -1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (cancelminus (infsup (-10.1, 5.0), infsup (-10.0, 5.0)), infsup (-9.999999999999964473e-02, 0.0))); %!test %! assert (isequal (cancelminus (infsup (-10.0, 5.1), infsup (-10.0, 5.0)), infsup (0.0, 9.999999999999964473e-02))); %!test %! assert (isequal (cancelminus (infsup (-10.1, 5.1), infsup (-10.0, 5.0)), infsup (-9.999999999999964473e-02, 9.999999999999964473e-02))); %!test %! assert (isequal (cancelminus (infsup (-10.0, 5.0), infsup (-10.0, 5.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (cancelminus (infsup (0.9, 5.0), infsup (1.0, 5.0)), infsup (-9.999999999999997780e-02, 0.0))); %!test %! assert (isequal (cancelminus (infsup (-0.0, 5.1), infsup (0.0, 5.0)), infsup (0.0, 9.999999999999964473e-02))); %!test %! assert (isequal (cancelminus (infsup (1.0, 5.1), infsup (1.0, 5.0)), infsup (0.0, 9.999999999999964473e-02))); %!test %! assert (isequal (cancelminus (infsup (0.9, 5.1), infsup (1.0, 5.0)), infsup (-9.999999999999997780e-02, 9.999999999999964473e-02))); %!test %! assert (isequal (cancelminus (infsup (1.0, 5.0), infsup (1.0, 5.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (cancelminus (infsup (-5.0, 1.0), infsup (-1.0, 5.0)), infsup (-4.0, -4.0))); %!test %! assert (isequal (cancelminus (infsup (-5.0, 0.0), infsup (-0.0, 5.0)), infsup (-5.0, -5.0))); %!test %! assert (isequal (cancelminus (infsup (1.999999999999996447e+00, 1.999999999999996447e+00), infsup (1.000000000000000056e-01, 1.000000000000000056e-01)), infsup (1.899999999999996358e+00, 1.899999999999996581e+00))); %!test %! assert (isequal (cancelminus (infsup (-1.000000000000000056e-01, 1.999999999999996447e+00), infsup (-0.01, 1.000000000000000056e-01)), infsup (-9.000000000000001055e-02, 1.899999999999996581e+00))); %!test %! assert (isequal (cancelminus (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), infsup (-1.797693134862315708e+308, -1.797693134862315708e+308)), infsup (1.797693134862315708e+308, inf))); %!test %! assert (isequal (cancelminus (infsup (-1.797693134862315708e+308, 1.797693134862315708e+308), infsup (-1.797693134862315708e+308, 1.797693134862315708e+308)), infsup (0.0, 0.0))); %!test %! assert (isequal (cancelminus (infsup (-1.797693134862315708e+308, 1.797693134862315708e+308), infsup (-1.797693134862315708e+308, 1.797693134862315509e+308)), infsup (0.0, 1.995840309534719812e+292))); %!test %! assert (isequal (cancelminus (infsup (-1.797693134862315708e+308, 1.797693134862315708e+308), infsup (-1.797693134862315509e+308, 1.797693134862315708e+308)), infsup (-1.995840309534719812e+292, 0.0))); %!test %! assert (isequal (cancelminus (infsup (-1.797693134862315708e+308, 1.797693134862315509e+308), infsup (-1.797693134862315708e+308, 1.797693134862315708e+308)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-1.797693134862315509e+308, 1.797693134862315708e+308), infsup (-1.797693134862315708e+308, 1.797693134862315708e+308)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (4.940656458412465442e-324, 4.940656458412465442e-324), infsup (4.940656458412465442e-324, 4.940656458412465442e-324)), infsup (0.0, 0.0))); %!test %! assert (isequal (cancelminus (infsup (4.940656458412465442e-324, 4.940656458412465442e-324), infsup (-4.940656458412465442e-324, -4.940656458412465442e-324)), infsup (9.881312916824930884e-324, 9.881312916824930884e-324))); %!test %! assert (isequal (cancelminus (infsup (2.225073858507201383e-308, 2.225073858507202371e-308), infsup (2.225073858507201383e-308, 2.225073858507201877e-308)), infsup (0.0, 4.940656458412465442e-324))); %!test %! assert (isequal (cancelminus (infsup (2.225073858507201383e-308, 2.225073858507201877e-308), infsup (2.225073858507201383e-308, 2.225073858507202371e-308)), infsup (-inf, inf))); %!test %! assert (isequal (cancelminus (infsup (-1.000000000000000000e+00, 2.220446049250312834e-16), infsup (-2.220446049250312588e-16, 1.000000000000000000e+00)), infsup (-9.999999999999998890e-01, -9.999999999999997780e-01))); %!test %! assert (isequal (cancelminus (infsup (-1.000000000000000000e+00, 2.220446049250312588e-16), infsup (-2.220446049250312834e-16, 1.000000000000000000e+00)), infsup (-inf, inf))); ## minimal_cancelMinus_dec_test %!test %! assert (isequal (cancelminus (infsupdec (-inf, -1.0, "dac"), infsupdec (empty, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-inf, -1.0, "dac"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.0, inf, "def"), infsupdec (empty, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.0, inf, "def"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (entire, "def"), infsupdec (empty, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (entire, "def"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-inf, -1.0, "trv"), infsupdec (-1.0, 5.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-inf, -1.0, "trv"), infsupdec (-1.0, 5.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.0, inf, "dac"), infsupdec (-1.0, 5.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.0, inf, "dac"), infsupdec (-1.0, 5.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (entire, "def"), infsupdec (-1.0, 5.0, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (entire, "def"), infsupdec (-1.0, 5.0, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-inf, -1.0, "def"), infsupdec (entire, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-inf, -1.0, "def"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.0, inf, "trv"), infsupdec (entire, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.0, inf, "trv"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (empty, "trv"), infsupdec (-inf, -1.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (empty, "trv"), infsupdec (-inf, -1.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (empty, "trv"), infsupdec (-1.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (empty, "trv"), infsupdec (-1.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (empty, "trv"), infsupdec (entire, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (empty, "trv"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.0, 5.0, "dac"), infsupdec (-inf, -1.0, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.0, 5.0, "dac"), infsupdec (-inf, -1.0, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.0, 5.0, "def"), infsupdec (-1.0, inf, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.0, 5.0, "def"), infsupdec (-1.0, inf, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.0, 5.0, "com"), infsupdec (entire, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.0, 5.0, "com"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (entire, "def"), infsupdec (-inf, -1.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (entire, "def"), infsupdec (-inf, -1.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (entire, "def"), infsupdec (-1.0, inf, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (entire, "def"), infsupdec (-1.0, inf, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (entire, "def"), infsupdec (entire, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (entire, "def"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-5.0, -1.0, "com"), infsupdec (-5.1, -1.0, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-5.0, -1.0, "com"), infsupdec (-5.1, -1.0, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-5.0, -1.0, "dac"), infsupdec (-5.0, -0.9, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-5.0, -1.0, "dac"), infsupdec (-5.0, -0.9, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-5.0, -1.0, "def"), infsupdec (-5.1, -0.9, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-5.0, -1.0, "def"), infsupdec (-5.1, -0.9, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-10.0, 5.0, "trv"), infsupdec (-10.1, 5.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-10.0, 5.0, "trv"), infsupdec (-10.1, 5.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-10.0, 5.0, "com"), infsupdec (-10.0, 5.1, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-10.0, 5.0, "com"), infsupdec (-10.0, 5.1, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-10.0, 5.0, "dac"), infsupdec (-10.1, 5.1, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-10.0, 5.0, "dac"), infsupdec (-10.1, 5.1, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (1.0, 5.0, "def"), infsupdec (0.9, 5.0, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (1.0, 5.0, "def"), infsupdec (0.9, 5.0, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (1.0, 5.0, "trv"), infsupdec (1.0, 5.1, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (1.0, 5.0, "trv"), infsupdec (1.0, 5.1, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (1.0, 5.0, "com"), infsupdec (0.9, 5.1, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (1.0, 5.0, "com"), infsupdec (0.9, 5.1, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-10.0, -1.0, "com"), infsupdec (empty, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-10.0, -1.0, "com"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-10.0, 5.0, "dac"), infsupdec (empty, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-10.0, 5.0, "dac"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (1.0, 5.0, "def"), infsupdec (empty, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (1.0, 5.0, "def"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (empty, "trv"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (empty, "trv"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (empty, "trv"), infsupdec (-10.0, -1.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (empty, "trv"), infsupdec (-10.0, -1.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (empty, "trv"), infsupdec (-10.0, 5.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (empty, "trv"), infsupdec (-10.0, 5.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (empty, "trv"), infsupdec (1.0, 5.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (empty, "trv"), infsupdec (1.0, 5.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-5.1, -0.0, "com"), infsupdec (-5.0, 0.0, "com")), infsupdec (-9.999999999999964473e-02, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-5.1, -0.0, "com"), infsupdec (-5.0, 0.0, "com"))){1}, decorationpart (infsupdec (-9.999999999999964473e-02, 0.0, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-5.1, -1.0, "dac"), infsupdec (-5.0, -1.0, "com")), infsupdec (-9.999999999999964473e-02, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-5.1, -1.0, "dac"), infsupdec (-5.0, -1.0, "com"))){1}, decorationpart (infsupdec (-9.999999999999964473e-02, 0.0, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-5.0, -0.9, "def"), infsupdec (-5.0, -1.0, "com")), infsupdec (0.0, 9.999999999999997780e-02, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-5.0, -0.9, "def"), infsupdec (-5.0, -1.0, "com"))){1}, decorationpart (infsupdec (0.0, 9.999999999999997780e-02, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-5.1, -0.9, "trv"), infsupdec (-5.0, -1.0, "com")), infsupdec (-9.999999999999964473e-02, 9.999999999999997780e-02, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-5.1, -0.9, "trv"), infsupdec (-5.0, -1.0, "com"))){1}, decorationpart (infsupdec (-9.999999999999964473e-02, 9.999999999999997780e-02, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-5.0, -1.0, "com"), infsupdec (-5.0, -1.0, "dac")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-5.0, -1.0, "com"), infsupdec (-5.0, -1.0, "dac"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-10.1, 5.0, "dac"), infsupdec (-10.0, 5.0, "dac")), infsupdec (-9.999999999999964473e-02, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-10.1, 5.0, "dac"), infsupdec (-10.0, 5.0, "dac"))){1}, decorationpart (infsupdec (-9.999999999999964473e-02, 0.0, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-10.0, 5.1, "def"), infsupdec (-10.0, 5.0, "dac")), infsupdec (0.0, 9.999999999999964473e-02, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-10.0, 5.1, "def"), infsupdec (-10.0, 5.0, "dac"))){1}, decorationpart (infsupdec (0.0, 9.999999999999964473e-02, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-10.1, 5.1, "trv"), infsupdec (-10.0, 5.0, "def")), infsupdec (-9.999999999999964473e-02, 9.999999999999964473e-02, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-10.1, 5.1, "trv"), infsupdec (-10.0, 5.0, "def"))){1}, decorationpart (infsupdec (-9.999999999999964473e-02, 9.999999999999964473e-02, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-10.0, 5.0, "com"), infsupdec (-10.0, 5.0, "def")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-10.0, 5.0, "com"), infsupdec (-10.0, 5.0, "def"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (0.9, 5.0, "dac"), infsupdec (1.0, 5.0, "def")), infsupdec (-9.999999999999997780e-02, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (0.9, 5.0, "dac"), infsupdec (1.0, 5.0, "def"))){1}, decorationpart (infsupdec (-9.999999999999997780e-02, 0.0, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-0.0, 5.1, "def"), infsupdec (0.0, 5.0, "def")), infsupdec (0.0, 9.999999999999964473e-02, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-0.0, 5.1, "def"), infsupdec (0.0, 5.0, "def"))){1}, decorationpart (infsupdec (0.0, 9.999999999999964473e-02, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (1.0, 5.1, "trv"), infsupdec (1.0, 5.0, "trv")), infsupdec (0.0, 9.999999999999964473e-02, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (1.0, 5.1, "trv"), infsupdec (1.0, 5.0, "trv"))){1}, decorationpart (infsupdec (0.0, 9.999999999999964473e-02, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (0.9, 5.1, "com"), infsupdec (1.0, 5.0, "trv")), infsupdec (-9.999999999999997780e-02, 9.999999999999964473e-02, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (0.9, 5.1, "com"), infsupdec (1.0, 5.0, "trv"))){1}, decorationpart (infsupdec (-9.999999999999997780e-02, 9.999999999999964473e-02, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (1.0, 5.0, "dac"), infsupdec (1.0, 5.0, "com")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (1.0, 5.0, "dac"), infsupdec (1.0, 5.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-5.0, 1.0, "def"), infsupdec (-1.0, 5.0, "def")), infsupdec (-4.0, -4.0, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-5.0, 1.0, "def"), infsupdec (-1.0, 5.0, "def"))){1}, decorationpart (infsupdec (-4.0, -4.0, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-5.0, 0.0, "trv"), infsupdec (-0.0, 5.0, "trv")), infsupdec (-5.0, -5.0, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-5.0, 0.0, "trv"), infsupdec (-0.0, 5.0, "trv"))){1}, decorationpart (infsupdec (-5.0, -5.0, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (1.999999999999996447e+00, 1.999999999999996447e+00, "com"), infsupdec (1.000000000000000056e-01, 1.000000000000000056e-01, "com")), infsupdec (1.899999999999996358e+00, 1.899999999999996581e+00, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (1.999999999999996447e+00, 1.999999999999996447e+00, "com"), infsupdec (1.000000000000000056e-01, 1.000000000000000056e-01, "com"))){1}, decorationpart (infsupdec (1.899999999999996358e+00, 1.899999999999996581e+00, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.000000000000000056e-01, 1.999999999999996447e+00, "def"), infsupdec (-0.01, 1.000000000000000056e-01, "dac")), infsupdec (-9.000000000000001055e-02, 1.899999999999996581e+00, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.000000000000000056e-01, 1.999999999999996447e+00, "def"), infsupdec (-0.01, 1.000000000000000056e-01, "dac"))){1}, decorationpart (infsupdec (-9.000000000000001055e-02, 1.899999999999996581e+00, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315708e+308, -1.797693134862315708e+308, "com")), infsupdec (1.797693134862315708e+308, inf, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315708e+308, -1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (1.797693134862315708e+308, inf, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315509e+308, "com")), infsupdec (0.0, 1.995840309534719812e+292, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315509e+308, "com"))){1}, decorationpart (infsupdec (0.0, 1.995840309534719812e+292, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315509e+308, 1.797693134862315708e+308, "com")), infsupdec (-1.995840309534719812e+292, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315509e+308, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (-1.995840309534719812e+292, 0.0, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.797693134862315708e+308, 1.797693134862315509e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.797693134862315708e+308, 1.797693134862315509e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.797693134862315509e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.797693134862315509e+308, 1.797693134862315708e+308, "com"), infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (4.940656458412465442e-324, 4.940656458412465442e-324, "com"), infsupdec (4.940656458412465442e-324, 4.940656458412465442e-324, "com")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (4.940656458412465442e-324, 4.940656458412465442e-324, "com"), infsupdec (4.940656458412465442e-324, 4.940656458412465442e-324, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (4.940656458412465442e-324, 4.940656458412465442e-324, "com"), infsupdec (-4.940656458412465442e-324, -4.940656458412465442e-324, "dac")), infsupdec (9.881312916824930884e-324, 9.881312916824930884e-324, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (4.940656458412465442e-324, 4.940656458412465442e-324, "com"), infsupdec (-4.940656458412465442e-324, -4.940656458412465442e-324, "dac"))){1}, decorationpart (infsupdec (9.881312916824930884e-324, 9.881312916824930884e-324, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (2.225073858507201383e-308, 2.225073858507202371e-308, "dac"), infsupdec (2.225073858507201383e-308, 2.225073858507201877e-308, "dac")), infsupdec (0.0, 4.940656458412465442e-324, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (2.225073858507201383e-308, 2.225073858507202371e-308, "dac"), infsupdec (2.225073858507201383e-308, 2.225073858507201877e-308, "dac"))){1}, decorationpart (infsupdec (0.0, 4.940656458412465442e-324, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (2.225073858507201383e-308, 2.225073858507201877e-308, "def"), infsupdec (2.225073858507201383e-308, 2.225073858507202371e-308, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (2.225073858507201383e-308, 2.225073858507201877e-308, "def"), infsupdec (2.225073858507201383e-308, 2.225073858507202371e-308, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.000000000000000000e+00, 2.220446049250312834e-16, "com"), infsupdec (-2.220446049250312588e-16, 1.000000000000000000e+00, "dac")), infsupdec (-9.999999999999998890e-01, -9.999999999999997780e-01, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.000000000000000000e+00, 2.220446049250312834e-16, "com"), infsupdec (-2.220446049250312588e-16, 1.000000000000000000e+00, "dac"))){1}, decorationpart (infsupdec (-9.999999999999998890e-01, -9.999999999999997780e-01, "trv")){1})); %!test %! assert (isequal (cancelminus (infsupdec (-1.000000000000000000e+00, 2.220446049250312588e-16, "def"), infsupdec (-2.220446049250312834e-16, 1.000000000000000000e+00, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (cancelminus (infsupdec (-1.000000000000000000e+00, 2.220446049250312588e-16, "def"), infsupdec (-2.220446049250312834e-16, 1.000000000000000000e+00, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); interval-2.1.0/inst/test/libieeep1788_tests_rec_bool.tst0000644000175000017500000002514713031037014022605 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/libieeep1788_tests_rec_bool.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) ## Copyright 2015-2016 Oliver Heimlich ## ## Original author: Marco Nehmeier (unit tests in libieeep1788, ## original license: Apache License 2.0) ## Converted into portable ITL format by Oliver Heimlich with minor corrections. ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## minimal_isCommonInterval_test %!test %! assert (iscommoninterval (infsup (-27.0, -27.0))); %!test %! assert (iscommoninterval (infsup (-27.0, 0.0))); %!test %! assert (iscommoninterval (infsup (0.0, 0.0))); %!test %! assert (iscommoninterval (infsup (-0.0, -0.0))); %!test %! assert (iscommoninterval (infsup (-0.0, 0.0))); %!test %! assert (iscommoninterval (infsup (0.0, -0.0))); %!test %! assert (iscommoninterval (infsup (5.0, 12.4))); %!test %! assert (iscommoninterval (infsup (-1.797693134862315708e+308, 1.797693134862315708e+308))); %!test %! assert (isequal (iscommoninterval (infsup (-inf, inf)), false)); %!test %! assert (isequal (iscommoninterval (infsup), false)); %!test %! assert (isequal (iscommoninterval (infsup (-inf, 0.0)), false)); %!test %! assert (isequal (iscommoninterval (infsup (0.0, inf)), false)); ## minimal_isCommonInterval_dec_test %!test %! assert (iscommoninterval (infsupdec (-27.0, -27.0, "com"))); %!test %! assert (iscommoninterval (infsupdec (-27.0, 0.0, "com"))); %!test %! assert (iscommoninterval (infsupdec (0.0, 0.0, "com"))); %!test %! assert (iscommoninterval (infsupdec (-0.0, -0.0, "com"))); %!test %! assert (iscommoninterval (infsupdec (-0.0, 0.0, "com"))); %!test %! assert (iscommoninterval (infsupdec (0.0, -0.0, "com"))); %!test %! assert (iscommoninterval (infsupdec (5.0, 12.4, "com"))); %!test %! assert (iscommoninterval (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "com"))); %!test %! assert (iscommoninterval (infsupdec (-27.0, -27.0, "trv"))); %!test %! assert (iscommoninterval (infsupdec (-27.0, 0.0, "def"))); %!test %! assert (iscommoninterval (infsupdec (0.0, 0.0, "dac"))); %!test %! assert (iscommoninterval (infsupdec (-0.0, -0.0, "trv"))); %!test %! assert (iscommoninterval (infsupdec (-0.0, 0.0, "def"))); %!test %! assert (iscommoninterval (infsupdec (0.0, -0.0, "dac"))); %!test %! assert (iscommoninterval (infsupdec (5.0, 12.4, "def"))); %!test %! assert (iscommoninterval (infsupdec (-1.797693134862315708e+308, 1.797693134862315708e+308, "trv"))); %!test %! assert (isequal (iscommoninterval (infsupdec (entire, "dac")), false)); %!test %! assert (isequal (iscommoninterval (infsupdec (empty, "trv")), false)); %!test %! assert (isequal (iscommoninterval (infsupdec (empty, "trv")), false)); %!test %! assert (isequal (iscommoninterval (infsupdec (-inf, 0.0, "trv")), false)); %!test %! assert (isequal (iscommoninterval (infsupdec (0.0, inf, "def")), false)); ## minimal_isSingleton_test %!test %! assert (issingleton (infsup (-27.0, -27.0))); %!test %! assert (issingleton (infsup (-2.0, -2.0))); %!test %! assert (issingleton (infsup (12.0, 12.0))); %!test %! assert (issingleton (infsup (17.1, 17.1))); %!test %! assert (issingleton (infsup (-0.0, -0.0))); %!test %! assert (issingleton (infsup (0.0, 0.0))); %!test %! assert (issingleton (infsup (-0.0, 0.0))); %!test %! assert (issingleton (infsup (0.0, -0.0))); %!test %! assert (isequal (issingleton (infsup), false)); %!test %! assert (isequal (issingleton (infsup (-inf, inf)), false)); %!test %! assert (isequal (issingleton (infsup (-1.0, 0.0)), false)); %!test %! assert (isequal (issingleton (infsup (-1.0, -0.5)), false)); %!test %! assert (isequal (issingleton (infsup (1.0, 2.0)), false)); %!test %! assert (isequal (issingleton (infsup (-inf, -1.797693134862315708e+308)), false)); %!test %! assert (isequal (issingleton (infsup (-1.0, inf)), false)); ## minimal_isSingleton_dec_test %!test %! assert (issingleton (infsupdec (-27.0, -27.0, "def"))); %!test %! assert (issingleton (infsupdec (-2.0, -2.0, "trv"))); %!test %! assert (issingleton (infsupdec (12.0, 12.0, "dac"))); %!test %! assert (issingleton (infsupdec (17.1, 17.1, "com"))); %!test %! assert (issingleton (infsupdec (-0.0, -0.0, "def"))); %!test %! assert (issingleton (infsupdec (0.0, 0.0, "com"))); %!test %! assert (issingleton (infsupdec (-0.0, 0.0, "def"))); %!test %! assert (issingleton (infsupdec (0.0, -0.0, "dac"))); %!test %! assert (isequal (issingleton (infsupdec (empty, "trv")), false)); %!test %! assert (isequal (issingleton (infsupdec (empty, "trv")), false)); %!test %! assert (isequal (issingleton (infsupdec (entire, "def")), false)); %!test %! assert (isequal (issingleton (infsupdec (-1.0, 0.0, "dac")), false)); %!test %! assert (isequal (issingleton (infsupdec (-1.0, -0.5, "com")), false)); %!test %! assert (isequal (issingleton (infsupdec (1.0, 2.0, "def")), false)); %!test %! assert (isequal (issingleton (infsupdec (-inf, -1.797693134862315708e+308, "dac")), false)); %!test %! assert (isequal (issingleton (infsupdec (-1.0, inf, "trv")), false)); ## minimal_isMember_test %!test %! assert (ismember (-27.0, infsup (-27.0, -27.0))); %!test %! assert (ismember (-27.0, infsup (-27.0, 0.0))); %!test %! assert (ismember (-7.0, infsup (-27.0, 0.0))); %!test %! assert (ismember (0.0, infsup (-27.0, 0.0))); %!test %! assert (ismember (-0.0, infsup (0.0, 0.0))); %!test %! assert (ismember (0.0, infsup (0.0, 0.0))); %!test %! assert (ismember (0.0, infsup (-0.0, -0.0))); %!test %! assert (ismember (0.0, infsup (-0.0, 0.0))); %!test %! assert (ismember (0.0, infsup (0.0, -0.0))); %!test %! assert (ismember (5.0, infsup (5.0, 12.4))); %!test %! assert (ismember (6.3, infsup (5.0, 12.4))); %!test %! assert (ismember (12.4, infsup (5.0, 12.4))); %!test %! assert (ismember (0.0, infsup (-inf, inf))); %!test %! assert (ismember (5.0, infsup (-inf, inf))); %!test %! assert (ismember (6.3, infsup (-inf, inf))); %!test %! assert (ismember (12.4, infsup (-inf, inf))); %!test %! assert (isequal (ismember (-71.0, infsup (-27.0, 0.0)), false)); %!test %! assert (isequal (ismember (0.1, infsup (-27.0, 0.0)), false)); %!test %! assert (isequal (ismember (-0.01, infsup (0.0, 0.0)), false)); %!test %! assert (isequal (ismember (0.000001, infsup (0.0, 0.0)), false)); %!test %! assert (isequal (ismember (111110.0, infsup (-0.0, -0.0)), false)); %!test %! assert (isequal (ismember (4.9, infsup (5.0, 12.4)), false)); %!test %! assert (isequal (ismember (-6.3, infsup (5.0, 12.4)), false)); %!test %! assert (isequal (ismember (0.0, infsup), false)); %!test %! assert (isequal (ismember (-4535.3, infsup), false)); %!test %! assert (isequal (ismember (-inf, infsup), false)); %!test %! assert (isequal (ismember (inf, infsup), false)); %!test %! assert (isequal (ismember (-inf, infsup (-inf, inf)), false)); %!test %! assert (isequal (ismember (inf, infsup (-inf, inf)), false)); ## minimal_isMember_dec_test %!test %! assert (ismember (-27.0, infsupdec (-27.0, -27.0, "trv"))); %!test %! assert (ismember (-27.0, infsupdec (-27.0, 0.0, "def"))); %!test %! assert (ismember (-7.0, infsupdec (-27.0, 0.0, "dac"))); %!test %! assert (ismember (0.0, infsupdec (-27.0, 0.0, "com"))); %!test %! assert (ismember (-0.0, infsupdec (0.0, 0.0, "trv"))); %!test %! assert (ismember (0.0, infsupdec (0.0, 0.0, "def"))); %!test %! assert (ismember (0.0, infsupdec (-0.0, -0.0, "dac"))); %!test %! assert (ismember (0.0, infsupdec (-0.0, 0.0, "com"))); %!test %! assert (ismember (0.0, infsupdec (0.0, -0.0, "trv"))); %!test %! assert (ismember (5.0, infsupdec (5.0, 12.4, "def"))); %!test %! assert (ismember (6.3, infsupdec (5.0, 12.4, "dac"))); %!test %! assert (ismember (12.4, infsupdec (5.0, 12.4, "com"))); %!test %! assert (ismember (0.0, infsupdec (entire, "trv"))); %!test %! assert (ismember (5.0, infsupdec (entire, "def"))); %!test %! assert (ismember (6.3, infsupdec (entire, "dac"))); %!test %! assert (ismember (12.4, infsupdec (entire, "trv"))); %!test %! assert (isequal (ismember (-71.0, infsupdec (-27.0, 0.0, "trv")), false)); %!test %! assert (isequal (ismember (0.1, infsupdec (-27.0, 0.0, "def")), false)); %!test %! assert (isequal (ismember (-0.01, infsupdec (0.0, 0.0, "dac")), false)); %!test %! assert (isequal (ismember (0.000001, infsupdec (0.0, 0.0, "com")), false)); %!test %! assert (isequal (ismember (111110.0, infsupdec (-0.0, -0.0, "trv")), false)); %!test %! assert (isequal (ismember (4.9, infsupdec (5.0, 12.4, "def")), false)); %!test %! assert (isequal (ismember (-6.3, infsupdec (5.0, 12.4, "dac")), false)); %!test %! assert (isequal (ismember (0.0, infsupdec (empty, "trv")), false)); %!test %! assert (isequal (ismember (0.0, infsupdec (empty, "trv")), false)); %!test %! assert (isequal (ismember (-4535.3, infsupdec (empty, "trv")), false)); %!test %! assert (isequal (ismember (-4535.3, infsupdec (empty, "trv")), false)); %!test %! assert (isequal (ismember (-inf, infsupdec (empty, "trv")), false)); %!test %! assert (isequal (ismember (-inf, infsupdec (empty, "trv")), false)); %!test %! assert (isequal (ismember (inf, infsupdec (empty, "trv")), false)); %!test %! assert (isequal (ismember (inf, infsupdec (empty, "trv")), false)); %!test %! assert (isequal (ismember (-inf, infsupdec (entire, "trv")), false)); %!test %! assert (isequal (ismember (inf, infsupdec (entire, "def")), false)); interval-2.1.0/inst/test/atan2.tst0000644000175000017500000001557213031037014016417 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/atan2.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## minimal.atan2_test %!test %! assert (isequal (atan2 (infsup, infsup), infsup)); %!test %! assert (isequal (atan2 (infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (-inf, inf)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (-inf, 0.0)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (0.0, inf), infsup (0.0, 0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-inf, 0.0), infsup (0.0, 0.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.225073858507201383e-308, 0.0), infsup (-2.225073858507201383e-308, -2.225073858507201383e-308)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (1.0, 1.0), infsup (-1.0, -1.0)), infsup (2.356194490192344837e+00, 2.356194490192345281e+00))); %!test %! assert (isequal (atan2 (infsup (1.0, 1.0), infsup (1.0, 1.0)), infsup (7.853981633974482790e-01, 7.853981633974483900e-01))); %!test %! assert (isequal (atan2 (infsup (-1.0, -1.0), infsup (1.0, 1.0)), infsup (-7.853981633974483900e-01, -7.853981633974482790e-01))); %!test %! assert (isequal (atan2 (infsup (-1.0, -1.0), infsup (-1.0, -1.0)), infsup (-2.356194490192345281e+00, -2.356194490192344837e+00))); %!test %! assert (isequal (atan2 (infsup (-2.225073858507201383e-308, 2.225073858507201383e-308), infsup (-2.225073858507201383e-308, -2.225073858507201383e-308)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.225073858507201383e-308, 2.225073858507201383e-308), infsup (2.225073858507201383e-308, 2.225073858507201383e-308)), infsup (-7.853981633974483900e-01, 7.853981633974483900e-01))); %!test %! assert (isequal (atan2 (infsup (-2.225073858507201383e-308, -2.225073858507201383e-308), infsup (-2.225073858507201383e-308, 2.225073858507201383e-308)), infsup (-2.356194490192345281e+00, -7.853981633974482790e-01))); %!test %! assert (isequal (atan2 (infsup (2.225073858507201383e-308, 2.225073858507201383e-308), infsup (-2.225073858507201383e-308, 2.225073858507201383e-308)), infsup (7.853981633974482790e-01, 2.356194490192345281e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 2.0), infsup (-3.0, -1.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 2.0), infsup (-3.0, -1.0)), infsup (2.034443935795702707e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (1.0, 3.0), infsup (-3.0, -1.0)), infsup (1.892546881191538688e+00, 2.819842099193151430e+00))); %!test %! assert (isequal (atan2 (infsup (1.0, 3.0), infsup (-2.0, 0.0)), infsup (1.570796326794896558e+00, 2.677945044588987411e+00))); %!test %! assert (isequal (atan2 (infsup (1.0, 3.0), infsup (-2.0, 2.0)), infsup (4.636476090008060935e-01, 2.677945044588987411e+00))); %!test %! assert (isequal (atan2 (infsup (1.0, 3.0), infsup (0.0, 2.0)), infsup (4.636476090008060935e-01, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (1.0, 3.0), infsup (1.0, 3.0)), infsup (3.217505543966421855e-01, 1.249045772398254428e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 2.0), infsup (1.0, 3.0)), infsup (0.000000000000000000e+00, 1.107148717794090631e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 2.0), infsup (1.0, 3.0)), infsup (-1.107148717794090631e+00, 1.107148717794090631e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (1.0, 3.0)), infsup (-1.107148717794090631e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (atan2 (infsup (-3.0, -1.0), infsup (1.0, 3.0)), infsup (-1.249045772398254428e+00, -3.217505543966421855e-01))); %!test %! assert (isequal (atan2 (infsup (-3.0, -1.0), infsup (0.0, 2.0)), infsup (-1.570796326794896780e+00, -4.636476090008060935e-01))); %!test %! assert (isequal (atan2 (infsup (-3.0, -1.0), infsup (-2.0, 2.0)), infsup (-2.677945044588987411e+00, -4.636476090008060935e-01))); %!test %! assert (isequal (atan2 (infsup (-3.0, -1.0), infsup (-2.0, 0.0)), infsup (-2.677945044588987411e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-3.0, -1.0), infsup (-3.0, -1.0)), infsup (-2.819842099193151430e+00, -1.892546881191538688e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (-3.0, -1.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-5.0, 0.0), infsup (-5.0, 0.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 5.0), infsup (-5.0, 0.0)), infsup (1.570796326794896558e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 5.0), infsup (0.0, 5.0)), infsup (0.000000000000000000e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-5.0, 0.0), infsup (0.0, 5.0)), infsup (-1.570796326794896780e+00, 0.000000000000000000e+00))); interval-2.1.0/inst/test/libieeep1788_tests_bool.tst0000644000175000017500000011500613031037015021747 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/libieeep1788_tests_bool.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) ## Copyright 2015-2016 Oliver Heimlich ## ## Original author: Marco Nehmeier (unit tests in libieeep1788, ## original license: Apache License 2.0) ## Converted into portable ITL format by Oliver Heimlich with minor corrections. ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## minimal_empty_test %!test %! assert (isempty (infsup)); %!test %! assert (isequal (isempty (infsup (-inf, inf)), false)); %!test %! assert (isequal (isempty (infsup (1.0, 2.0)), false)); %!test %! assert (isequal (isempty (infsup (-1.0, 2.0)), false)); %!test %! assert (isequal (isempty (infsup (-3.0, -2.0)), false)); %!test %! assert (isequal (isempty (infsup (-inf, 2.0)), false)); %!test %! assert (isequal (isempty (infsup (-inf, 0.0)), false)); %!test %! assert (isequal (isempty (infsup (-inf, -0.0)), false)); %!test %! assert (isequal (isempty (infsup (0.0, inf)), false)); %!test %! assert (isequal (isempty (infsup (-0.0, inf)), false)); %!test %! assert (isequal (isempty (infsup (-0.0, 0.0)), false)); %!test %! assert (isequal (isempty (infsup (0.0, -0.0)), false)); %!test %! assert (isequal (isempty (infsup (0.0, 0.0)), false)); %!test %! assert (isequal (isempty (infsup (-0.0, -0.0)), false)); ## minimal_empty_dec_test %!test %! assert (isempty (infsupdec (empty, "trv"))); %!test %! assert (isequal (isempty (infsupdec (-inf, inf, "def")), false)); %!test %! assert (isequal (isempty (infsupdec (1.0, 2.0, "com")), false)); %!test %! assert (isequal (isempty (infsupdec (-1.0, 2.0, "trv")), false)); %!test %! assert (isequal (isempty (infsupdec (-3.0, -2.0, "dac")), false)); %!test %! assert (isequal (isempty (infsupdec (-inf, 2.0, "trv")), false)); %!test %! assert (isequal (isempty (infsupdec (-inf, 0.0, "trv")), false)); %!test %! assert (isequal (isempty (infsupdec (-inf, -0.0, "trv")), false)); %!test %! assert (isequal (isempty (infsupdec (0.0, inf, "def")), false)); %!test %! assert (isequal (isempty (infsupdec (-0.0, inf, "trv")), false)); %!test %! assert (isequal (isempty (infsupdec (-0.0, 0.0, "com")), false)); %!test %! assert (isequal (isempty (infsupdec (0.0, -0.0, "trv")), false)); %!test %! assert (isequal (isempty (infsupdec (0.0, 0.0, "trv")), false)); %!test %! assert (isequal (isempty (infsupdec (-0.0, -0.0, "trv")), false)); ## minimal_entire_test %!test %! assert (isequal (isentire (infsup), false)); %!test %! assert (isentire (infsup (-inf, inf))); %!test %! assert (isequal (isentire (infsup (1.0, 2.0)), false)); %!test %! assert (isequal (isentire (infsup (-1.0, 2.0)), false)); %!test %! assert (isequal (isentire (infsup (-3.0, -2.0)), false)); %!test %! assert (isequal (isentire (infsup (-inf, 2.0)), false)); %!test %! assert (isequal (isentire (infsup (-inf, 0.0)), false)); %!test %! assert (isequal (isentire (infsup (-inf, -0.0)), false)); %!test %! assert (isequal (isentire (infsup (0.0, inf)), false)); %!test %! assert (isequal (isentire (infsup (-0.0, inf)), false)); %!test %! assert (isequal (isentire (infsup (-0.0, 0.0)), false)); %!test %! assert (isequal (isentire (infsup (0.0, -0.0)), false)); %!test %! assert (isequal (isentire (infsup (0.0, 0.0)), false)); %!test %! assert (isequal (isentire (infsup (-0.0, -0.0)), false)); ## minimal_entire_dec_test %!test %! assert (isequal (isentire (infsupdec (empty, "trv")), false)); %!test %! assert (isentire (infsupdec (-inf, inf, "trv"))); %!test %! assert (isentire (infsupdec (-inf, inf, "def"))); %!test %! assert (isentire (infsupdec (-inf, inf, "dac"))); %!test %! assert (isequal (isentire (infsupdec (1.0, 2.0, "com")), false)); %!test %! assert (isequal (isentire (infsupdec (-1.0, 2.0, "trv")), false)); %!test %! assert (isequal (isentire (infsupdec (-3.0, -2.0, "dac")), false)); %!test %! assert (isequal (isentire (infsupdec (-inf, 2.0, "trv")), false)); %!test %! assert (isequal (isentire (infsupdec (-inf, 0.0, "trv")), false)); %!test %! assert (isequal (isentire (infsupdec (-inf, -0.0, "trv")), false)); %!test %! assert (isequal (isentire (infsupdec (0.0, inf, "def")), false)); %!test %! assert (isequal (isentire (infsupdec (-0.0, inf, "trv")), false)); %!test %! assert (isequal (isentire (infsupdec (-0.0, 0.0, "com")), false)); %!test %! assert (isequal (isentire (infsupdec (0.0, -0.0, "trv")), false)); %!test %! assert (isequal (isentire (infsupdec (0.0, 0.0, "trv")), false)); %!test %! assert (isequal (isentire (infsupdec (-0.0, -0.0, "trv")), false)); ## minimal_nai_dec_test %!test %! assert (isequal (isnai (infsupdec (-inf, inf, "trv")), false)); %!test %! assert (isequal (isnai (infsupdec (-inf, inf, "def")), false)); %!test %! assert (isequal (isnai (infsupdec (-inf, inf, "dac")), false)); %!test %! assert (isequal (isnai (infsupdec (1.0, 2.0, "com")), false)); %!test %! assert (isequal (isnai (infsupdec (-1.0, 2.0, "trv")), false)); %!test %! assert (isequal (isnai (infsupdec (-3.0, -2.0, "dac")), false)); %!test %! assert (isequal (isnai (infsupdec (-inf, 2.0, "trv")), false)); %!test %! assert (isequal (isnai (infsupdec (-inf, 0.0, "trv")), false)); %!test %! assert (isequal (isnai (infsupdec (-inf, -0.0, "trv")), false)); %!test %! assert (isequal (isnai (infsupdec (0.0, inf, "def")), false)); %!test %! assert (isequal (isnai (infsupdec (-0.0, inf, "trv")), false)); %!test %! assert (isequal (isnai (infsupdec (-0.0, 0.0, "com")), false)); %!test %! assert (isequal (isnai (infsupdec (0.0, -0.0, "trv")), false)); %!test %! assert (isequal (isnai (infsupdec (0.0, 0.0, "trv")), false)); %!test %! assert (isequal (isnai (infsupdec (-0.0, -0.0, "trv")), false)); ## minimal_equal_test %!test %! assert (eq (infsup (1.0, 2.0), infsup (1.0, 2.0))); %! assert (infsup (1.0, 2.0) == infsup (1.0, 2.0)); %!test %! assert (isequal (eq (infsup (1.0, 2.1), infsup (1.0, 2.0)), false)); %! assert (isequal (infsup (1.0, 2.1) == infsup (1.0, 2.0), false)); %!test %! assert (eq (infsup, infsup)); %! assert (infsup == infsup); %!test %! assert (isequal (eq (infsup, infsup (1.0, 2.0)), false)); %! assert (isequal (infsup == infsup (1.0, 2.0), false)); %!test %! assert (eq (infsup (-inf, inf), infsup (-inf, inf))); %! assert (infsup (-inf, inf) == infsup (-inf, inf)); %!test %! assert (isequal (eq (infsup (1.0, 2.4), infsup (-inf, inf)), false)); %! assert (isequal (infsup (1.0, 2.4) == infsup (-inf, inf), false)); %!test %! assert (eq (infsup (1.0, inf), infsup (1.0, inf))); %! assert (infsup (1.0, inf) == infsup (1.0, inf)); %!test %! assert (isequal (eq (infsup (1.0, 2.4), infsup (1.0, inf)), false)); %! assert (isequal (infsup (1.0, 2.4) == infsup (1.0, inf), false)); %!test %! assert (eq (infsup (-inf, 2.0), infsup (-inf, 2.0))); %! assert (infsup (-inf, 2.0) == infsup (-inf, 2.0)); %!test %! assert (isequal (eq (infsup (-inf, 2.4), infsup (-inf, 2.0)), false)); %! assert (isequal (infsup (-inf, 2.4) == infsup (-inf, 2.0), false)); %!test %! assert (eq (infsup (-2.0, 0.0), infsup (-2.0, 0.0))); %! assert (infsup (-2.0, 0.0) == infsup (-2.0, 0.0)); %!test %! assert (eq (infsup (-0.0, 2.0), infsup (0.0, 2.0))); %! assert (infsup (-0.0, 2.0) == infsup (0.0, 2.0)); %!test %! assert (eq (infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (infsup (-0.0, -0.0) == infsup (0.0, 0.0)); %!test %! assert (eq (infsup (-0.0, 0.0), infsup (0.0, 0.0))); %! assert (infsup (-0.0, 0.0) == infsup (0.0, 0.0)); %!test %! assert (eq (infsup (0.0, -0.0), infsup (0.0, 0.0))); %! assert (infsup (0.0, -0.0) == infsup (0.0, 0.0)); ## minimal_equal_dec_test %!test %! assert (eq (infsupdec (1.0, 2.0, "def"), infsupdec (1.0, 2.0, "trv"))); %! assert (infsupdec (1.0, 2.0, "def") == infsupdec (1.0, 2.0, "trv")); %!test %! assert (isequal (eq (infsupdec (1.0, 2.1, "trv"), infsupdec (1.0, 2.0, "trv")), false)); %! assert (isequal (infsupdec (1.0, 2.1, "trv") == infsupdec (1.0, 2.0, "trv"), false)); %!test %! assert (eq (infsupdec (empty, "trv"), infsupdec (empty, "trv"))); %! assert (infsupdec (empty, "trv") == infsupdec (empty, "trv")); %!test %! assert (isequal (eq (infsupdec (empty, "trv"), infsupdec (1.0, 2.0, "trv")), false)); %! assert (isequal (infsupdec (empty, "trv") == infsupdec (1.0, 2.0, "trv"), false)); %!test %! assert (isequal (eq (infsupdec (empty, "trv"), infsupdec (1.0, 2.0, "trv")), false)); %! assert (isequal (infsupdec (empty, "trv") == infsupdec (1.0, 2.0, "trv"), false)); %!test %! assert (eq (infsupdec (-inf, inf, "def"), infsupdec (-inf, inf, "trv"))); %! assert (infsupdec (-inf, inf, "def") == infsupdec (-inf, inf, "trv")); %!test %! assert (isequal (eq (infsupdec (1.0, 2.4, "trv"), infsupdec (-inf, inf, "trv")), false)); %! assert (isequal (infsupdec (1.0, 2.4, "trv") == infsupdec (-inf, inf, "trv"), false)); %!test %! assert (eq (infsupdec (1.0, inf, "trv"), infsupdec (1.0, inf, "trv"))); %! assert (infsupdec (1.0, inf, "trv") == infsupdec (1.0, inf, "trv")); %!test %! assert (isequal (eq (infsupdec (1.0, 2.4, "def"), infsupdec (1.0, inf, "trv")), false)); %! assert (isequal (infsupdec (1.0, 2.4, "def") == infsupdec (1.0, inf, "trv"), false)); %!test %! assert (eq (infsupdec (-inf, 2.0, "trv"), infsupdec (-inf, 2.0, "trv"))); %! assert (infsupdec (-inf, 2.0, "trv") == infsupdec (-inf, 2.0, "trv")); %!test %! assert (isequal (eq (infsupdec (-inf, 2.4, "def"), infsupdec (-inf, 2.0, "trv")), false)); %! assert (isequal (infsupdec (-inf, 2.4, "def") == infsupdec (-inf, 2.0, "trv"), false)); %!test %! assert (eq (infsupdec (-2.0, 0.0, "trv"), infsupdec (-2.0, 0.0, "trv"))); %! assert (infsupdec (-2.0, 0.0, "trv") == infsupdec (-2.0, 0.0, "trv")); %!test %! assert (eq (infsupdec (-0.0, 2.0, "def"), infsupdec (0.0, 2.0, "trv"))); %! assert (infsupdec (-0.0, 2.0, "def") == infsupdec (0.0, 2.0, "trv")); %!test %! assert (eq (infsupdec (-0.0, -0.0, "trv"), infsupdec (0.0, 0.0, "trv"))); %! assert (infsupdec (-0.0, -0.0, "trv") == infsupdec (0.0, 0.0, "trv")); %!test %! assert (eq (infsupdec (-0.0, 0.0, "def"), infsupdec (0.0, 0.0, "trv"))); %! assert (infsupdec (-0.0, 0.0, "def") == infsupdec (0.0, 0.0, "trv")); %!test %! assert (eq (infsupdec (0.0, -0.0, "trv"), infsupdec (0.0, 0.0, "trv"))); %! assert (infsupdec (0.0, -0.0, "trv") == infsupdec (0.0, 0.0, "trv")); ## minimal_subset_test %!test %! assert (subset (infsup, infsup)); %!test %! assert (subset (infsup, infsup (0.0, 4.0))); %!test %! assert (subset (infsup, infsup (-0.0, 4.0))); %!test %! assert (subset (infsup, infsup (-0.1, 1.0))); %!test %! assert (subset (infsup, infsup (-0.1, 0.0))); %!test %! assert (subset (infsup, infsup (-0.1, -0.0))); %!test %! assert (subset (infsup, infsup (-inf, inf))); %!test %! assert (isequal (subset (infsup (0.0, 4.0), infsup), false)); %!test %! assert (isequal (subset (infsup (-0.0, 4.0), infsup), false)); %!test %! assert (isequal (subset (infsup (-0.1, 1.0), infsup), false)); %!test %! assert (isequal (subset (infsup (-inf, inf), infsup), false)); %!test %! assert (subset (infsup (0.0, 4.0), infsup (-inf, inf))); %!test %! assert (subset (infsup (-0.0, 4.0), infsup (-inf, inf))); %!test %! assert (subset (infsup (-0.1, 1.0), infsup (-inf, inf))); %!test %! assert (subset (infsup (-inf, inf), infsup (-inf, inf))); %!test %! assert (subset (infsup (1.0, 2.0), infsup (1.0, 2.0))); %!test %! assert (subset (infsup (1.0, 2.0), infsup (0.0, 4.0))); %!test %! assert (subset (infsup (1.0, 2.0), infsup (-0.0, 4.0))); %!test %! assert (subset (infsup (0.1, 0.2), infsup (0.0, 4.0))); %!test %! assert (subset (infsup (0.1, 0.2), infsup (-0.0, 4.0))); %!test %! assert (subset (infsup (-0.1, -0.1), infsup (-4.0, 3.4))); %!test %! assert (subset (infsup (0.0, 0.0), infsup (-0.0, -0.0))); %!test %! assert (subset (infsup (-0.0, -0.0), infsup (0.0, 0.0))); %!test %! assert (subset (infsup (-0.0, 0.0), infsup (0.0, 0.0))); %!test %! assert (subset (infsup (-0.0, 0.0), infsup (0.0, -0.0))); %!test %! assert (subset (infsup (0.0, -0.0), infsup (0.0, 0.0))); %!test %! assert (subset (infsup (0.0, -0.0), infsup (-0.0, 0.0))); ## minimal_subset_dec_test %!test %! assert (subset (infsupdec (empty, "trv"), infsupdec (0.0, 4.0, "trv"))); %!test %! assert (subset (infsupdec (empty, "trv"), infsupdec (-0.0, 4.0, "def"))); %!test %! assert (subset (infsupdec (empty, "trv"), infsupdec (-0.1, 1.0, "trv"))); %!test %! assert (subset (infsupdec (empty, "trv"), infsupdec (-0.1, 0.0, "trv"))); %!test %! assert (subset (infsupdec (empty, "trv"), infsupdec (-0.1, -0.0, "trv"))); %!test %! assert (subset (infsupdec (empty, "trv"), infsupdec (-inf, inf, "trv"))); %!test %! assert (isequal (subset (infsupdec (0.0, 4.0, "trv"), infsupdec (empty, "trv")), false)); %!test %! assert (isequal (subset (infsupdec (-0.0, 4.0, "def"), infsupdec (empty, "trv")), false)); %!test %! assert (isequal (subset (infsupdec (-0.1, 1.0, "trv"), infsupdec (empty, "trv")), false)); %!test %! assert (isequal (subset (infsupdec (-inf, inf, "trv"), infsupdec (empty, "trv")), false)); %!test %! assert (subset (infsupdec (0.0, 4.0, "trv"), infsupdec (-inf, inf, "trv"))); %!test %! assert (subset (infsupdec (-0.0, 4.0, "trv"), infsupdec (-inf, inf, "trv"))); %!test %! assert (subset (infsupdec (-0.1, 1.0, "trv"), infsupdec (-inf, inf, "trv"))); %!test %! assert (subset (infsupdec (-inf, inf, "trv"), infsupdec (-inf, inf, "trv"))); %!test %! assert (subset (infsupdec (1.0, 2.0, "trv"), infsupdec (1.0, 2.0, "trv"))); %!test %! assert (subset (infsupdec (1.0, 2.0, "trv"), infsupdec (0.0, 4.0, "trv"))); %!test %! assert (subset (infsupdec (1.0, 2.0, "def"), infsupdec (-0.0, 4.0, "def"))); %!test %! assert (subset (infsupdec (0.1, 0.2, "trv"), infsupdec (0.0, 4.0, "trv"))); %!test %! assert (subset (infsupdec (0.1, 0.2, "trv"), infsupdec (-0.0, 4.0, "def"))); %!test %! assert (subset (infsupdec (-0.1, -0.1, "trv"), infsupdec (-4.0, 3.4, "trv"))); %!test %! assert (subset (infsupdec (0.0, 0.0, "trv"), infsupdec (-0.0, -0.0, "trv"))); %!test %! assert (subset (infsupdec (-0.0, -0.0, "trv"), infsupdec (0.0, 0.0, "def"))); %!test %! assert (subset (infsupdec (-0.0, 0.0, "trv"), infsupdec (0.0, 0.0, "trv"))); %!test %! assert (subset (infsupdec (-0.0, 0.0, "trv"), infsupdec (0.0, -0.0, "trv"))); %!test %! assert (subset (infsupdec (0.0, -0.0, "def"), infsupdec (0.0, 0.0, "trv"))); %!test %! assert (subset (infsupdec (0.0, -0.0, "trv"), infsupdec (-0.0, 0.0, "trv"))); ## minimal_less_test %!test %! assert (le (infsup, infsup)); %! assert (infsup <= infsup); %!test %! assert (isequal (le (infsup (1.0, 2.0), infsup), false)); %! assert (isequal (infsup (1.0, 2.0) <= infsup, false)); %!test %! assert (isequal (le (infsup, infsup (1.0, 2.0)), false)); %! assert (isequal (infsup <= infsup (1.0, 2.0), false)); %!test %! assert (le (infsup (-inf, inf), infsup (-inf, inf))); %! assert (infsup (-inf, inf) <= infsup (-inf, inf)); %!test %! assert (isequal (le (infsup (1.0, 2.0), infsup (-inf, inf)), false)); %! assert (isequal (infsup (1.0, 2.0) <= infsup (-inf, inf), false)); %!test %! assert (isequal (le (infsup (0.0, 2.0), infsup (-inf, inf)), false)); %! assert (isequal (infsup (0.0, 2.0) <= infsup (-inf, inf), false)); %!test %! assert (isequal (le (infsup (-0.0, 2.0), infsup (-inf, inf)), false)); %! assert (isequal (infsup (-0.0, 2.0) <= infsup (-inf, inf), false)); %!test %! assert (isequal (le (infsup (-inf, inf), infsup (1.0, 2.0)), false)); %! assert (isequal (infsup (-inf, inf) <= infsup (1.0, 2.0), false)); %!test %! assert (isequal (le (infsup (-inf, inf), infsup (0.0, 2.0)), false)); %! assert (isequal (infsup (-inf, inf) <= infsup (0.0, 2.0), false)); %!test %! assert (isequal (le (infsup (-inf, inf), infsup (-0.0, 2.0)), false)); %! assert (isequal (infsup (-inf, inf) <= infsup (-0.0, 2.0), false)); %!test %! assert (le (infsup (0.0, 2.0), infsup (0.0, 2.0))); %! assert (infsup (0.0, 2.0) <= infsup (0.0, 2.0)); %!test %! assert (le (infsup (0.0, 2.0), infsup (-0.0, 2.0))); %! assert (infsup (0.0, 2.0) <= infsup (-0.0, 2.0)); %!test %! assert (le (infsup (0.0, 2.0), infsup (1.0, 2.0))); %! assert (infsup (0.0, 2.0) <= infsup (1.0, 2.0)); %!test %! assert (le (infsup (-0.0, 2.0), infsup (1.0, 2.0))); %! assert (infsup (-0.0, 2.0) <= infsup (1.0, 2.0)); %!test %! assert (le (infsup (1.0, 2.0), infsup (1.0, 2.0))); %! assert (infsup (1.0, 2.0) <= infsup (1.0, 2.0)); %!test %! assert (le (infsup (1.0, 2.0), infsup (3.0, 4.0))); %! assert (infsup (1.0, 2.0) <= infsup (3.0, 4.0)); %!test %! assert (le (infsup (1.0, 3.5), infsup (3.0, 4.0))); %! assert (infsup (1.0, 3.5) <= infsup (3.0, 4.0)); %!test %! assert (le (infsup (1.0, 4.0), infsup (3.0, 4.0))); %! assert (infsup (1.0, 4.0) <= infsup (3.0, 4.0)); %!test %! assert (le (infsup (-2.0, -1.0), infsup (-2.0, -1.0))); %! assert (infsup (-2.0, -1.0) <= infsup (-2.0, -1.0)); %!test %! assert (le (infsup (-3.0, -1.5), infsup (-2.0, -1.0))); %! assert (infsup (-3.0, -1.5) <= infsup (-2.0, -1.0)); %!test %! assert (le (infsup (0.0, 0.0), infsup (-0.0, -0.0))); %! assert (infsup (0.0, 0.0) <= infsup (-0.0, -0.0)); %!test %! assert (le (infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (infsup (-0.0, -0.0) <= infsup (0.0, 0.0)); %!test %! assert (le (infsup (-0.0, 0.0), infsup (0.0, 0.0))); %! assert (infsup (-0.0, 0.0) <= infsup (0.0, 0.0)); %!test %! assert (le (infsup (-0.0, 0.0), infsup (0.0, -0.0))); %! assert (infsup (-0.0, 0.0) <= infsup (0.0, -0.0)); %!test %! assert (le (infsup (0.0, -0.0), infsup (0.0, 0.0))); %! assert (infsup (0.0, -0.0) <= infsup (0.0, 0.0)); %!test %! assert (le (infsup (0.0, -0.0), infsup (-0.0, 0.0))); %! assert (infsup (0.0, -0.0) <= infsup (-0.0, 0.0)); ## minimal_less_dec_test %!test %! assert (isequal (le (infsupdec (1.0, 2.0, "trv"), infsupdec (empty, "trv")), false)); %! assert (isequal (infsupdec (1.0, 2.0, "trv") <= infsupdec (empty, "trv"), false)); %!test %! assert (isequal (le (infsupdec (empty, "trv"), infsupdec (1.0, 2.0, "def")), false)); %! assert (isequal (infsupdec (empty, "trv") <= infsupdec (1.0, 2.0, "def"), false)); %!test %! assert (isequal (le (infsupdec (1.0, 2.0, "trv"), infsupdec (empty, "trv")), false)); %! assert (isequal (infsupdec (1.0, 2.0, "trv") <= infsupdec (empty, "trv"), false)); %!test %! assert (isequal (le (infsupdec (empty, "trv"), infsupdec (1.0, 2.0, "trv")), false)); %! assert (isequal (infsupdec (empty, "trv") <= infsupdec (1.0, 2.0, "trv"), false)); %!test %! assert (le (infsupdec (-inf, inf, "trv"), infsupdec (-inf, inf, "trv"))); %! assert (infsupdec (-inf, inf, "trv") <= infsupdec (-inf, inf, "trv")); %!test %! assert (isequal (le (infsupdec (1.0, 2.0, "def"), infsupdec (-inf, inf, "trv")), false)); %! assert (isequal (infsupdec (1.0, 2.0, "def") <= infsupdec (-inf, inf, "trv"), false)); %!test %! assert (isequal (le (infsupdec (0.0, 2.0, "trv"), infsupdec (-inf, inf, "trv")), false)); %! assert (isequal (infsupdec (0.0, 2.0, "trv") <= infsupdec (-inf, inf, "trv"), false)); %!test %! assert (isequal (le (infsupdec (-0.0, 2.0, "trv"), infsupdec (-inf, inf, "trv")), false)); %! assert (isequal (infsupdec (-0.0, 2.0, "trv") <= infsupdec (-inf, inf, "trv"), false)); %!test %! assert (isequal (le (infsupdec (-inf, inf, "trv"), infsupdec (1.0, 2.0, "trv")), false)); %! assert (isequal (infsupdec (-inf, inf, "trv") <= infsupdec (1.0, 2.0, "trv"), false)); %!test %! assert (isequal (le (infsupdec (-inf, inf, "trv"), infsupdec (0.0, 2.0, "def")), false)); %! assert (isequal (infsupdec (-inf, inf, "trv") <= infsupdec (0.0, 2.0, "def"), false)); %!test %! assert (isequal (le (infsupdec (-inf, inf, "trv"), infsupdec (-0.0, 2.0, "trv")), false)); %! assert (isequal (infsupdec (-inf, inf, "trv") <= infsupdec (-0.0, 2.0, "trv"), false)); %!test %! assert (le (infsupdec (0.0, 2.0, "trv"), infsupdec (0.0, 2.0, "trv"))); %! assert (infsupdec (0.0, 2.0, "trv") <= infsupdec (0.0, 2.0, "trv")); %!test %! assert (le (infsupdec (0.0, 2.0, "trv"), infsupdec (-0.0, 2.0, "trv"))); %! assert (infsupdec (0.0, 2.0, "trv") <= infsupdec (-0.0, 2.0, "trv")); %!test %! assert (le (infsupdec (0.0, 2.0, "def"), infsupdec (1.0, 2.0, "def"))); %! assert (infsupdec (0.0, 2.0, "def") <= infsupdec (1.0, 2.0, "def")); %!test %! assert (le (infsupdec (-0.0, 2.0, "trv"), infsupdec (1.0, 2.0, "trv"))); %! assert (infsupdec (-0.0, 2.0, "trv") <= infsupdec (1.0, 2.0, "trv")); %!test %! assert (le (infsupdec (1.0, 2.0, "trv"), infsupdec (1.0, 2.0, "trv"))); %! assert (infsupdec (1.0, 2.0, "trv") <= infsupdec (1.0, 2.0, "trv")); %!test %! assert (le (infsupdec (1.0, 2.0, "trv"), infsupdec (3.0, 4.0, "def"))); %! assert (infsupdec (1.0, 2.0, "trv") <= infsupdec (3.0, 4.0, "def")); %!test %! assert (le (infsupdec (1.0, 3.5, "trv"), infsupdec (3.0, 4.0, "trv"))); %! assert (infsupdec (1.0, 3.5, "trv") <= infsupdec (3.0, 4.0, "trv")); %!test %! assert (le (infsupdec (1.0, 4.0, "trv"), infsupdec (3.0, 4.0, "trv"))); %! assert (infsupdec (1.0, 4.0, "trv") <= infsupdec (3.0, 4.0, "trv")); %!test %! assert (le (infsupdec (-2.0, -1.0, "trv"), infsupdec (-2.0, -1.0, "trv"))); %! assert (infsupdec (-2.0, -1.0, "trv") <= infsupdec (-2.0, -1.0, "trv")); %!test %! assert (le (infsupdec (-3.0, -1.5, "trv"), infsupdec (-2.0, -1.0, "trv"))); %! assert (infsupdec (-3.0, -1.5, "trv") <= infsupdec (-2.0, -1.0, "trv")); %!test %! assert (le (infsupdec (0.0, 0.0, "trv"), infsupdec (-0.0, -0.0, "trv"))); %! assert (infsupdec (0.0, 0.0, "trv") <= infsupdec (-0.0, -0.0, "trv")); %!test %! assert (le (infsupdec (-0.0, -0.0, "trv"), infsupdec (0.0, 0.0, "def"))); %! assert (infsupdec (-0.0, -0.0, "trv") <= infsupdec (0.0, 0.0, "def")); %!test %! assert (le (infsupdec (-0.0, 0.0, "trv"), infsupdec (0.0, 0.0, "trv"))); %! assert (infsupdec (-0.0, 0.0, "trv") <= infsupdec (0.0, 0.0, "trv")); %!test %! assert (le (infsupdec (-0.0, 0.0, "trv"), infsupdec (0.0, -0.0, "trv"))); %! assert (infsupdec (-0.0, 0.0, "trv") <= infsupdec (0.0, -0.0, "trv")); %!test %! assert (le (infsupdec (0.0, -0.0, "def"), infsupdec (0.0, 0.0, "trv"))); %! assert (infsupdec (0.0, -0.0, "def") <= infsupdec (0.0, 0.0, "trv")); %!test %! assert (le (infsupdec (0.0, -0.0, "trv"), infsupdec (-0.0, 0.0, "trv"))); %! assert (infsupdec (0.0, -0.0, "trv") <= infsupdec (-0.0, 0.0, "trv")); ## minimal_precedes_test %!test %! assert (precedes (infsup, infsup (3.0, 4.0))); %!test %! assert (precedes (infsup (3.0, 4.0), infsup)); %!test %! assert (precedes (infsup, infsup)); %!test %! assert (isequal (precedes (infsup (1.0, 2.0), infsup (-inf, inf)), false)); %!test %! assert (isequal (precedes (infsup (0.0, 2.0), infsup (-inf, inf)), false)); %!test %! assert (isequal (precedes (infsup (-0.0, 2.0), infsup (-inf, inf)), false)); %!test %! assert (isequal (precedes (infsup (-inf, inf), infsup (1.0, 2.0)), false)); %!test %! assert (isequal (precedes (infsup (-inf, inf), infsup (-inf, inf)), false)); %!test %! assert (precedes (infsup (1.0, 2.0), infsup (3.0, 4.0))); %!test %! assert (precedes (infsup (1.0, 3.0), infsup (3.0, 4.0))); %!test %! assert (precedes (infsup (-3.0, -1.0), infsup (-1.0, 0.0))); %!test %! assert (precedes (infsup (-3.0, -1.0), infsup (-1.0, -0.0))); %!test %! assert (isequal (precedes (infsup (1.0, 3.5), infsup (3.0, 4.0)), false)); %!test %! assert (isequal (precedes (infsup (1.0, 4.0), infsup (3.0, 4.0)), false)); %!test %! assert (isequal (precedes (infsup (-3.0, -0.1), infsup (-1.0, 0.0)), false)); %!test %! assert (precedes (infsup (0.0, 0.0), infsup (-0.0, -0.0))); %!test %! assert (precedes (infsup (-0.0, -0.0), infsup (0.0, 0.0))); %!test %! assert (precedes (infsup (-0.0, 0.0), infsup (0.0, 0.0))); %!test %! assert (precedes (infsup (-0.0, 0.0), infsup (0.0, -0.0))); %!test %! assert (precedes (infsup (0.0, -0.0), infsup (0.0, 0.0))); %!test %! assert (precedes (infsup (0.0, -0.0), infsup (-0.0, 0.0))); ## minimal_precedes_dec_test %!test %! assert (precedes (infsupdec (empty, "trv"), infsupdec (3.0, 4.0, "def"))); %!test %! assert (precedes (infsupdec (3.0, 4.0, "trv"), infsupdec (empty, "trv"))); %!test %! assert (precedes (infsupdec (empty, "trv"), infsupdec (3.0, 4.0, "trv"))); %!test %! assert (precedes (infsupdec (3.0, 4.0, "trv"), infsupdec (empty, "trv"))); %!test %! assert (isequal (precedes (infsupdec (1.0, 2.0, "trv"), infsupdec (-inf, inf, "trv")), false)); %!test %! assert (isequal (precedes (infsupdec (0.0, 2.0, "trv"), infsupdec (-inf, inf, "trv")), false)); %!test %! assert (isequal (precedes (infsupdec (-0.0, 2.0, "trv"), infsupdec (-inf, inf, "trv")), false)); %!test %! assert (isequal (precedes (infsupdec (-inf, inf, "trv"), infsupdec (1.0, 2.0, "trv")), false)); %!test %! assert (isequal (precedes (infsupdec (-inf, inf, "trv"), infsupdec (-inf, inf, "trv")), false)); %!test %! assert (precedes (infsupdec (1.0, 2.0, "trv"), infsupdec (3.0, 4.0, "trv"))); %!test %! assert (precedes (infsupdec (1.0, 3.0, "trv"), infsupdec (3.0, 4.0, "def"))); %!test %! assert (precedes (infsupdec (-3.0, -1.0, "def"), infsupdec (-1.0, 0.0, "trv"))); %!test %! assert (precedes (infsupdec (-3.0, -1.0, "trv"), infsupdec (-1.0, -0.0, "trv"))); %!test %! assert (isequal (precedes (infsupdec (1.0, 3.5, "trv"), infsupdec (3.0, 4.0, "trv")), false)); %!test %! assert (isequal (precedes (infsupdec (1.0, 4.0, "trv"), infsupdec (3.0, 4.0, "trv")), false)); %!test %! assert (isequal (precedes (infsupdec (-3.0, -0.1, "trv"), infsupdec (-1.0, 0.0, "trv")), false)); %!test %! assert (precedes (infsupdec (0.0, 0.0, "trv"), infsupdec (-0.0, -0.0, "trv"))); %!test %! assert (precedes (infsupdec (-0.0, -0.0, "trv"), infsupdec (0.0, 0.0, "def"))); %!test %! assert (precedes (infsupdec (-0.0, 0.0, "trv"), infsupdec (0.0, 0.0, "trv"))); %!test %! assert (precedes (infsupdec (-0.0, 0.0, "def"), infsupdec (0.0, -0.0, "trv"))); %!test %! assert (precedes (infsupdec (0.0, -0.0, "trv"), infsupdec (0.0, 0.0, "trv"))); %!test %! assert (precedes (infsupdec (0.0, -0.0, "trv"), infsupdec (-0.0, 0.0, "trv"))); ## minimal_interior_test %!test %! assert (interior (infsup, infsup)); %!test %! assert (interior (infsup, infsup (0.0, 4.0))); %!test %! assert (isequal (interior (infsup (0.0, 4.0), infsup), false)); %!test %! assert (interior (infsup (-inf, inf), infsup (-inf, inf))); %!test %! assert (interior (infsup (0.0, 4.0), infsup (-inf, inf))); %!test %! assert (interior (infsup, infsup (-inf, inf))); %!test %! assert (isequal (interior (infsup (-inf, inf), infsup (0.0, 4.0)), false)); %!test %! assert (isequal (interior (infsup (0.0, 4.0), infsup (0.0, 4.0)), false)); %!test %! assert (interior (infsup (1.0, 2.0), infsup (0.0, 4.0))); %!test %! assert (isequal (interior (infsup (-2.0, 2.0), infsup (-2.0, 4.0)), false)); %!test %! assert (interior (infsup (-0.0, -0.0), infsup (-2.0, 4.0))); %!test %! assert (interior (infsup (0.0, 0.0), infsup (-2.0, 4.0))); %!test %! assert (isequal (interior (infsup (0.0, 0.0), infsup (-0.0, -0.0)), false)); %!test %! assert (isequal (interior (infsup (0.0, 4.4), infsup (0.0, 4.0)), false)); %!test %! assert (isequal (interior (infsup (-1.0, -1.0), infsup (0.0, 4.0)), false)); %!test %! assert (isequal (interior (infsup (2.0, 2.0), infsup (-2.0, -1.0)), false)); ## minimal_interior_dec_test %!test %! assert (interior (infsupdec (empty, "trv"), infsupdec (0.0, 4.0, "trv"))); %!test %! assert (isequal (interior (infsupdec (0.0, 4.0, "def"), infsupdec (empty, "trv")), false)); %!test %! assert (isequal (interior (infsupdec (0.0, 4.0, "trv"), infsupdec (empty, "trv")), false)); %!test %! assert (interior (infsupdec (-inf, inf, "trv"), infsupdec (-inf, inf, "trv"))); %!test %! assert (interior (infsupdec (0.0, 4.0, "trv"), infsupdec (-inf, inf, "trv"))); %!test %! assert (interior (infsupdec (empty, "trv"), infsupdec (-inf, inf, "trv"))); %!test %! assert (isequal (interior (infsupdec (-inf, inf, "trv"), infsupdec (0.0, 4.0, "trv")), false)); %!test %! assert (isequal (interior (infsupdec (0.0, 4.0, "trv"), infsupdec (0.0, 4.0, "trv")), false)); %!test %! assert (interior (infsupdec (1.0, 2.0, "def"), infsupdec (0.0, 4.0, "trv"))); %!test %! assert (isequal (interior (infsupdec (-2.0, 2.0, "trv"), infsupdec (-2.0, 4.0, "def")), false)); %!test %! assert (interior (infsupdec (-0.0, -0.0, "trv"), infsupdec (-2.0, 4.0, "trv"))); %!test %! assert (interior (infsupdec (0.0, 0.0, "def"), infsupdec (-2.0, 4.0, "trv"))); %!test %! assert (isequal (interior (infsupdec (0.0, 0.0, "trv"), infsupdec (-0.0, -0.0, "trv")), false)); %!test %! assert (isequal (interior (infsupdec (0.0, 4.4, "trv"), infsupdec (0.0, 4.0, "trv")), false)); %!test %! assert (isequal (interior (infsupdec (-1.0, -1.0, "trv"), infsupdec (0.0, 4.0, "def")), false)); %!test %! assert (isequal (interior (infsupdec (2.0, 2.0, "def"), infsupdec (-2.0, -1.0, "trv")), false)); ## minimal_strictLess_test %!test %! assert (lt (infsup, infsup)); %! assert (infsup < infsup); %!test %! assert (isequal (lt (infsup (1.0, 2.0), infsup), false)); %! assert (isequal (infsup (1.0, 2.0) < infsup, false)); %!test %! assert (isequal (lt (infsup, infsup (1.0, 2.0)), false)); %! assert (isequal (infsup < infsup (1.0, 2.0), false)); %!test %! assert (lt (infsup (-inf, inf), infsup (-inf, inf))); %! assert (infsup (-inf, inf) < infsup (-inf, inf)); %!test %! assert (isequal (lt (infsup (1.0, 2.0), infsup (-inf, inf)), false)); %! assert (isequal (infsup (1.0, 2.0) < infsup (-inf, inf), false)); %!test %! assert (isequal (lt (infsup (-inf, inf), infsup (1.0, 2.0)), false)); %! assert (isequal (infsup (-inf, inf) < infsup (1.0, 2.0), false)); %!test %! assert (isequal (lt (infsup (1.0, 2.0), infsup (1.0, 2.0)), false)); %! assert (isequal (infsup (1.0, 2.0) < infsup (1.0, 2.0), false)); %!test %! assert (lt (infsup (1.0, 2.0), infsup (3.0, 4.0))); %! assert (infsup (1.0, 2.0) < infsup (3.0, 4.0)); %!test %! assert (lt (infsup (1.0, 3.5), infsup (3.0, 4.0))); %! assert (infsup (1.0, 3.5) < infsup (3.0, 4.0)); %!test %! assert (isequal (lt (infsup (1.0, 4.0), infsup (3.0, 4.0)), false)); %! assert (isequal (infsup (1.0, 4.0) < infsup (3.0, 4.0), false)); %!test %! assert (isequal (lt (infsup (0.0, 4.0), infsup (0.0, 4.0)), false)); %! assert (isequal (infsup (0.0, 4.0) < infsup (0.0, 4.0), false)); %!test %! assert (isequal (lt (infsup (-0.0, 4.0), infsup (0.0, 4.0)), false)); %! assert (isequal (infsup (-0.0, 4.0) < infsup (0.0, 4.0), false)); %!test %! assert (isequal (lt (infsup (-2.0, -1.0), infsup (-2.0, -1.0)), false)); %! assert (isequal (infsup (-2.0, -1.0) < infsup (-2.0, -1.0), false)); %!test %! assert (lt (infsup (-3.0, -1.5), infsup (-2.0, -1.0))); %! assert (infsup (-3.0, -1.5) < infsup (-2.0, -1.0)); ## minimal_strictLess_dec_test %!test %! assert (isequal (lt (infsupdec (1.0, 2.0, "trv"), infsupdec (empty, "trv")), false)); %! assert (isequal (infsupdec (1.0, 2.0, "trv") < infsupdec (empty, "trv"), false)); %!test %! assert (isequal (lt (infsupdec (empty, "trv"), infsupdec (1.0, 2.0, "def")), false)); %! assert (isequal (infsupdec (empty, "trv") < infsupdec (1.0, 2.0, "def"), false)); %!test %! assert (isequal (lt (infsupdec (1.0, 2.0, "def"), infsupdec (empty, "trv")), false)); %! assert (isequal (infsupdec (1.0, 2.0, "def") < infsupdec (empty, "trv"), false)); %!test %! assert (isequal (lt (infsupdec (empty, "trv"), infsupdec (1.0, 2.0, "def")), false)); %! assert (isequal (infsupdec (empty, "trv") < infsupdec (1.0, 2.0, "def"), false)); %!test %! assert (lt (infsupdec (-inf, inf, "trv"), infsupdec (-inf, inf, "trv"))); %! assert (infsupdec (-inf, inf, "trv") < infsupdec (-inf, inf, "trv")); %!test %! assert (isequal (lt (infsupdec (1.0, 2.0, "trv"), infsupdec (-inf, inf, "trv")), false)); %! assert (isequal (infsupdec (1.0, 2.0, "trv") < infsupdec (-inf, inf, "trv"), false)); %!test %! assert (isequal (lt (infsupdec (-inf, inf, "trv"), infsupdec (1.0, 2.0, "trv")), false)); %! assert (isequal (infsupdec (-inf, inf, "trv") < infsupdec (1.0, 2.0, "trv"), false)); %!test %! assert (isequal (lt (infsupdec (1.0, 2.0, "trv"), infsupdec (1.0, 2.0, "trv")), false)); %! assert (isequal (infsupdec (1.0, 2.0, "trv") < infsupdec (1.0, 2.0, "trv"), false)); %!test %! assert (lt (infsupdec (1.0, 2.0, "trv"), infsupdec (3.0, 4.0, "trv"))); %! assert (infsupdec (1.0, 2.0, "trv") < infsupdec (3.0, 4.0, "trv")); %!test %! assert (lt (infsupdec (1.0, 3.5, "def"), infsupdec (3.0, 4.0, "trv"))); %! assert (infsupdec (1.0, 3.5, "def") < infsupdec (3.0, 4.0, "trv")); %!test %! assert (isequal (lt (infsupdec (1.0, 4.0, "trv"), infsupdec (3.0, 4.0, "def")), false)); %! assert (isequal (infsupdec (1.0, 4.0, "trv") < infsupdec (3.0, 4.0, "def"), false)); %!test %! assert (isequal (lt (infsupdec (0.0, 4.0, "trv"), infsupdec (0.0, 4.0, "def")), false)); %! assert (isequal (infsupdec (0.0, 4.0, "trv") < infsupdec (0.0, 4.0, "def"), false)); %!test %! assert (isequal (lt (infsupdec (-0.0, 4.0, "def"), infsupdec (0.0, 4.0, "trv")), false)); %! assert (isequal (infsupdec (-0.0, 4.0, "def") < infsupdec (0.0, 4.0, "trv"), false)); %!test %! assert (isequal (lt (infsupdec (-2.0, -1.0, "def"), infsupdec (-2.0, -1.0, "def")), false)); %! assert (isequal (infsupdec (-2.0, -1.0, "def") < infsupdec (-2.0, -1.0, "def"), false)); %!test %! assert (lt (infsupdec (-3.0, -1.5, "trv"), infsupdec (-2.0, -1.0, "trv"))); %! assert (infsupdec (-3.0, -1.5, "trv") < infsupdec (-2.0, -1.0, "trv")); ## minimal_strictPrecedes_test %!test %! assert (strictprecedes (infsup, infsup (3.0, 4.0))); %!test %! assert (strictprecedes (infsup (3.0, 4.0), infsup)); %!test %! assert (strictprecedes (infsup, infsup)); %!test %! assert (isequal (strictprecedes (infsup (1.0, 2.0), infsup (-inf, inf)), false)); %!test %! assert (isequal (strictprecedes (infsup (-inf, inf), infsup (1.0, 2.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (-inf, inf), infsup (-inf, inf)), false)); %!test %! assert (strictprecedes (infsup (1.0, 2.0), infsup (3.0, 4.0))); %!test %! assert (isequal (strictprecedes (infsup (1.0, 3.0), infsup (3.0, 4.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (-3.0, -1.0), infsup (-1.0, 0.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (-3.0, -0.0), infsup (0.0, 1.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (-3.0, 0.0), infsup (-0.0, 1.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (1.0, 3.5), infsup (3.0, 4.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (1.0, 4.0), infsup (3.0, 4.0)), false)); %!test %! assert (isequal (strictprecedes (infsup (-3.0, -0.1), infsup (-1.0, 0.0)), false)); ## minimal_strictPrecedes_dec_test %!test %! assert (strictprecedes (infsupdec (empty, "trv"), infsupdec (3.0, 4.0, "trv"))); %!test %! assert (strictprecedes (infsupdec (3.0, 4.0, "def"), infsupdec (empty, "trv"))); %!test %! assert (strictprecedes (infsupdec (empty, "trv"), infsupdec (3.0, 4.0, "trv"))); %!test %! assert (strictprecedes (infsupdec (3.0, 4.0, "def"), infsupdec (empty, "trv"))); %!test %! assert (isequal (strictprecedes (infsupdec (1.0, 2.0, "trv"), infsupdec (-inf, inf, "trv")), false)); %!test %! assert (isequal (strictprecedes (infsupdec (-inf, inf, "trv"), infsupdec (1.0, 2.0, "trv")), false)); %!test %! assert (isequal (strictprecedes (infsupdec (-inf, inf, "trv"), infsupdec (-inf, inf, "trv")), false)); %!test %! assert (strictprecedes (infsupdec (1.0, 2.0, "trv"), infsupdec (3.0, 4.0, "trv"))); %!test %! assert (isequal (strictprecedes (infsupdec (1.0, 3.0, "def"), infsupdec (3.0, 4.0, "trv")), false)); %!test %! assert (isequal (strictprecedes (infsupdec (-3.0, -1.0, "trv"), infsupdec (-1.0, 0.0, "def")), false)); %!test %! assert (isequal (strictprecedes (infsupdec (-3.0, -0.0, "def"), infsupdec (0.0, 1.0, "trv")), false)); %!test %! assert (isequal (strictprecedes (infsupdec (-3.0, 0.0, "trv"), infsupdec (-0.0, 1.0, "trv")), false)); %!test %! assert (isequal (strictprecedes (infsupdec (1.0, 3.5, "trv"), infsupdec (3.0, 4.0, "trv")), false)); %!test %! assert (isequal (strictprecedes (infsupdec (1.0, 4.0, "trv"), infsupdec (3.0, 4.0, "def")), false)); %!test %! assert (isequal (strictprecedes (infsupdec (-3.0, -0.1, "trv"), infsupdec (-1.0, 0.0, "trv")), false)); ## minimal_disjoint_test %!test %! assert (disjoint (infsup, infsup (3.0, 4.0))); %!test %! assert (disjoint (infsup (3.0, 4.0), infsup)); %!test %! assert (disjoint (infsup, infsup)); %!test %! assert (disjoint (infsup (3.0, 4.0), infsup (1.0, 2.0))); %!test %! assert (isequal (disjoint (infsup (0.0, 0.0), infsup (-0.0, -0.0)), false)); %!test %! assert (isequal (disjoint (infsup (0.0, -0.0), infsup (-0.0, 0.0)), false)); %!test %! assert (isequal (disjoint (infsup (3.0, 4.0), infsup (1.0, 7.0)), false)); %!test %! assert (isequal (disjoint (infsup (3.0, 4.0), infsup (-inf, inf)), false)); %!test %! assert (isequal (disjoint (infsup (-inf, inf), infsup (1.0, 7.0)), false)); %!test %! assert (isequal (disjoint (infsup (-inf, inf), infsup (-inf, inf)), false)); ## minimal_disjoint_dec_test %!test %! assert (disjoint (infsupdec (empty, "trv"), infsupdec (3.0, 4.0, "def"))); %!test %! assert (disjoint (infsupdec (3.0, 4.0, "trv"), infsupdec (empty, "trv"))); %!test %! assert (disjoint (infsupdec (empty, "trv"), infsupdec (3.0, 4.0, "trv"))); %!test %! assert (disjoint (infsupdec (3.0, 4.0, "trv"), infsupdec (empty, "trv"))); %!test %! assert (disjoint (infsupdec (3.0, 4.0, "trv"), infsupdec (1.0, 2.0, "def"))); %!test %! assert (isequal (disjoint (infsupdec (0.0, 0.0, "trv"), infsupdec (-0.0, -0.0, "trv")), false)); %!test %! assert (isequal (disjoint (infsupdec (0.0, -0.0, "trv"), infsupdec (-0.0, 0.0, "trv")), false)); %!test %! assert (isequal (disjoint (infsupdec (3.0, 4.0, "def"), infsupdec (1.0, 7.0, "def")), false)); %!test %! assert (isequal (disjoint (infsupdec (3.0, 4.0, "trv"), infsupdec (-inf, inf, "trv")), false)); %!test %! assert (isequal (disjoint (infsupdec (-inf, inf, "trv"), infsupdec (1.0, 7.0, "trv")), false)); %!test %! assert (isequal (disjoint (infsupdec (-inf, inf, "trv"), infsupdec (-inf, inf, "trv")), false)); interval-2.1.0/inst/test/fi_lib.tst0000644000175000017500000054206013031037016016635 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/fi_lib.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 1997-2000 Institut fuer Wissenschaftliches Rechnen ## und Mathematische Modellbildung (IWRMM) ## and ## Institut fuer Angewandte Mathematik ## Universitaet Karlsruhe, Germany ## 2000-2005 Wiss. Rechnen/Softwaretechnologie ## Universitaet Wuppertal, Germany ## Copyright 2015-2016 Oliver Heimlich ## ## Original authors: Werner Hofschuster and Walter Kraemer ## (unit tests in FI_LIB version 1.2, original license: LGPLv2+) ## Converted into portable ITL format by Oliver Heimlich. ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## FI_LIB.addii %!test %! assert (isequal (infsup (0.000000000000000000e+00, 0.000000000000000000e+00) + infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (plus (infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 1.000000000000000000e+00) + infsup (2.000000000000000000e+00, 2.000000000000000000e+00), infsup (3.000000000000000000e+00, 3.000000000000000000e+00))); %! assert (isequal (plus (infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (2.000000000000000000e+00, 2.000000000000000000e+00)), infsup (3.000000000000000000e+00, 3.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00) + infsup (-2.000000000000000000e+00, -2.000000000000000000e+00), infsup (-3.000000000000000000e+00, -3.000000000000000000e+00))); %! assert (isequal (plus (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (-2.000000000000000000e+00, -2.000000000000000000e+00)), infsup (-3.000000000000000000e+00, -3.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 1.000000000000000000e+00) + infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (plus (infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00) + infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (plus (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (9.999888671826830054e-321, 9.999888671826830054e-321) + infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (1.999977734365366011e-320, 1.999977734365366011e-320))); %! assert (isequal (plus (infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (9.999888671826830054e-321, 9.999888671826830054e-321)), infsup (1.999977734365366011e-320, 1.999977734365366011e-320))); %!test %! assert (isequal (infsup (9.999888671826830054e-321, 9.999888671826830054e-321) + infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %! assert (isequal (plus (infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321) + infsup (-9.999888671826830054e-321, -9.999888671826830054e-321), infsup (-1.999977734365366011e-320, -1.999977734365366011e-320))); %! assert (isequal (plus (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321), infsup (-9.999888671826830054e-321, -9.999888671826830054e-321)), infsup (-1.999977734365366011e-320, -1.999977734365366011e-320))); %!test %! assert (isequal (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321) + infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %! assert (isequal (plus (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.797693134862315708e+308, 1.797693134862315708e+308) + infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (1.797693134862315509e+308, 1.797693134862315708e+308))); %! assert (isequal (plus (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00)), infsup (1.797693134862315509e+308, 1.797693134862315708e+308))); %!test %! assert (isequal (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308) + infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-1.797693134862315708e+308, -1.797693134862315509e+308))); %! assert (isequal (plus (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (-1.797693134862315708e+308, -1.797693134862315509e+308))); %!test %! assert (isequal (infsup (0.000000000000000000e+00, 1.000000000000000000e+00) + infsup (1.000000000000000000e+00, 2.000000000000000000e+00), infsup (1.000000000000000000e+00, 3.000000000000000000e+00))); %! assert (isequal (plus (infsup (0.000000000000000000e+00, 1.000000000000000000e+00), infsup (1.000000000000000000e+00, 2.000000000000000000e+00)), infsup (1.000000000000000000e+00, 3.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 2.000000000000000000e+00) + infsup (0.000000000000000000e+00, 1.000000000000000000e+00), infsup (1.000000000000000000e+00, 3.000000000000000000e+00))); %! assert (isequal (plus (infsup (1.000000000000000000e+00, 2.000000000000000000e+00), infsup (0.000000000000000000e+00, 1.000000000000000000e+00)), infsup (1.000000000000000000e+00, 3.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 2.000000000000000000e+00) + infsup (3.000000000000000000e+00, 4.000000000000000000e+00), infsup (4.000000000000000000e+00, 6.000000000000000000e+00))); %! assert (isequal (plus (infsup (1.000000000000000000e+00, 2.000000000000000000e+00), infsup (3.000000000000000000e+00, 4.000000000000000000e+00)), infsup (4.000000000000000000e+00, 6.000000000000000000e+00))); %!test %! assert (isequal (infsup (3.000000000000000000e+00, 4.000000000000000000e+00) + infsup (1.000000000000000000e+00, 2.000000000000000000e+00), infsup (4.000000000000000000e+00, 6.000000000000000000e+00))); %! assert (isequal (plus (infsup (3.000000000000000000e+00, 4.000000000000000000e+00), infsup (1.000000000000000000e+00, 2.000000000000000000e+00)), infsup (4.000000000000000000e+00, 6.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 0.000000000000000000e+00) + infsup (-4.000000000000000000e+00, -3.000000000000000000e+00), infsup (-5.000000000000000000e+00, -3.000000000000000000e+00))); %! assert (isequal (plus (infsup (-1.000000000000000000e+00, 0.000000000000000000e+00), infsup (-4.000000000000000000e+00, -3.000000000000000000e+00)), infsup (-5.000000000000000000e+00, -3.000000000000000000e+00))); %!test %! assert (isequal (infsup (-4.000000000000000000e+00, -3.000000000000000000e+00) + infsup (-1.000000000000000000e+00, 0.000000000000000000e+00), infsup (-5.000000000000000000e+00, -3.000000000000000000e+00))); %! assert (isequal (plus (infsup (-4.000000000000000000e+00, -3.000000000000000000e+00), infsup (-1.000000000000000000e+00, 0.000000000000000000e+00)), infsup (-5.000000000000000000e+00, -3.000000000000000000e+00))); %!test %! assert (isequal (infsup (-5.000000000000000000e+00, -4.000000000000000000e+00) + infsup (4.000000000000000000e+00, 5.000000000000000000e+00), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00))); %! assert (isequal (plus (infsup (-5.000000000000000000e+00, -4.000000000000000000e+00), infsup (4.000000000000000000e+00, 5.000000000000000000e+00)), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (infsup (4.000000000000000000e+00, 5.000000000000000000e+00) + infsup (-5.000000000000000000e+00, -4.000000000000000000e+00), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00))); %! assert (isequal (plus (infsup (4.000000000000000000e+00, 5.000000000000000000e+00), infsup (-5.000000000000000000e+00, -4.000000000000000000e+00)), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00))); ## FI_LIB.subii %!test %! assert (isequal (infsup (0.000000000000000000e+00, 0.000000000000000000e+00) - infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (minus (infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 1.000000000000000000e+00) - infsup (2.000000000000000000e+00, 2.000000000000000000e+00), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00))); %! assert (isequal (minus (infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (2.000000000000000000e+00, 2.000000000000000000e+00)), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00) - infsup (-2.000000000000000000e+00, -2.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000000e+00))); %! assert (isequal (minus (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (-2.000000000000000000e+00, -2.000000000000000000e+00)), infsup (1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 1.000000000000000000e+00) - infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (2.000000000000000000e+00, 2.000000000000000000e+00))); %! assert (isequal (minus (infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00)), infsup (2.000000000000000000e+00, 2.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00) - infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-2.000000000000000000e+00, -2.000000000000000000e+00))); %! assert (isequal (minus (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (-2.000000000000000000e+00, -2.000000000000000000e+00))); %!test %! assert (isequal (infsup (9.999888671826830054e-321, 9.999888671826830054e-321) - infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (minus (infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (9.999888671826830054e-321, 9.999888671826830054e-321)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (9.999888671826830054e-321, 9.999888671826830054e-321) - infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %! assert (isequal (minus (infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %!test %! assert (isequal (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321) - infsup (-9.999888671826830054e-321, -9.999888671826830054e-321), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (minus (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321), infsup (-9.999888671826830054e-321, -9.999888671826830054e-321)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321) - infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-1.000000000000000222e+00, -1.000000000000000000e+00))); %! assert (isequal (minus (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (-1.000000000000000222e+00, -1.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.797693134862315708e+308, 1.797693134862315708e+308) - infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (1.797693134862315509e+308, 1.797693134862315708e+308))); %! assert (isequal (minus (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (1.797693134862315509e+308, 1.797693134862315708e+308))); %!test %! assert (isequal (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308) - infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (-1.797693134862315708e+308, -1.797693134862315509e+308))); %! assert (isequal (minus (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00)), infsup (-1.797693134862315708e+308, -1.797693134862315509e+308))); %!test %! assert (isequal (infsup (0.000000000000000000e+00, 1.000000000000000000e+00) - infsup (1.000000000000000000e+00, 2.000000000000000000e+00), infsup (-2.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (minus (infsup (0.000000000000000000e+00, 1.000000000000000000e+00), infsup (1.000000000000000000e+00, 2.000000000000000000e+00)), infsup (-2.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 2.000000000000000000e+00) - infsup (0.000000000000000000e+00, 1.000000000000000000e+00), infsup (0.000000000000000000e+00, 2.000000000000000000e+00))); %! assert (isequal (minus (infsup (1.000000000000000000e+00, 2.000000000000000000e+00), infsup (0.000000000000000000e+00, 1.000000000000000000e+00)), infsup (0.000000000000000000e+00, 2.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 2.000000000000000000e+00) - infsup (3.000000000000000000e+00, 4.000000000000000000e+00), infsup (-3.000000000000000000e+00, -1.000000000000000000e+00))); %! assert (isequal (minus (infsup (1.000000000000000000e+00, 2.000000000000000000e+00), infsup (3.000000000000000000e+00, 4.000000000000000000e+00)), infsup (-3.000000000000000000e+00, -1.000000000000000000e+00))); %!test %! assert (isequal (infsup (3.000000000000000000e+00, 4.000000000000000000e+00) - infsup (1.000000000000000000e+00, 2.000000000000000000e+00), infsup (1.000000000000000000e+00, 3.000000000000000000e+00))); %! assert (isequal (minus (infsup (3.000000000000000000e+00, 4.000000000000000000e+00), infsup (1.000000000000000000e+00, 2.000000000000000000e+00)), infsup (1.000000000000000000e+00, 3.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 0.000000000000000000e+00) - infsup (-4.000000000000000000e+00, -3.000000000000000000e+00), infsup (2.000000000000000000e+00, 4.000000000000000000e+00))); %! assert (isequal (minus (infsup (-1.000000000000000000e+00, 0.000000000000000000e+00), infsup (-4.000000000000000000e+00, -3.000000000000000000e+00)), infsup (2.000000000000000000e+00, 4.000000000000000000e+00))); %!test %! assert (isequal (infsup (-4.000000000000000000e+00, -3.000000000000000000e+00) - infsup (-1.000000000000000000e+00, 0.000000000000000000e+00), infsup (-4.000000000000000000e+00, -2.000000000000000000e+00))); %! assert (isequal (minus (infsup (-4.000000000000000000e+00, -3.000000000000000000e+00), infsup (-1.000000000000000000e+00, 0.000000000000000000e+00)), infsup (-4.000000000000000000e+00, -2.000000000000000000e+00))); %!test %! assert (isequal (infsup (-5.000000000000000000e+00, -4.000000000000000000e+00) - infsup (4.000000000000000000e+00, 5.000000000000000000e+00), infsup (-1.000000000000000000e+01, -8.000000000000000000e+00))); %! assert (isequal (minus (infsup (-5.000000000000000000e+00, -4.000000000000000000e+00), infsup (4.000000000000000000e+00, 5.000000000000000000e+00)), infsup (-1.000000000000000000e+01, -8.000000000000000000e+00))); %!test %! assert (isequal (infsup (4.000000000000000000e+00, 5.000000000000000000e+00) - infsup (-5.000000000000000000e+00, -4.000000000000000000e+00), infsup (8.000000000000000000e+00, 1.000000000000000000e+01))); %! assert (isequal (minus (infsup (4.000000000000000000e+00, 5.000000000000000000e+00), infsup (-5.000000000000000000e+00, -4.000000000000000000e+00)), infsup (8.000000000000000000e+00, 1.000000000000000000e+01))); ## FI_LIB.mulii %!test %! assert (isequal (infsup (0.000000000000000000e+00, 0.000000000000000000e+00) .* infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00) .* infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000000e+00))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00)), infsup (1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00) .* infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00) .* infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00))); %!test %! assert (isequal (infsup (0.000000000000000000e+00, 0.000000000000000000e+00) .* infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (0.000000000000000000e+00, 0.000000000000000000e+00) .* infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 1.000000000000000000e+00) .* infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00))); %! assert (isequal (times (infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00)), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 1.000000000000000000e+00) .* infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 1.000000000000000000e+00) .* infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000000e+00))); %! assert (isequal (times (infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.797693134862315708e+308, 1.797693134862315708e+308) .* infsup (5.000000000000000000e-01, 5.000000000000000000e-01), infsup (8.988465674311578541e+307, 8.988465674311578541e+307))); %! assert (isequal (times (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), infsup (5.000000000000000000e-01, 5.000000000000000000e-01)), infsup (8.988465674311578541e+307, 8.988465674311578541e+307))); %!test %! assert (isequal (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308) .* infsup (5.000000000000000000e-01, 5.000000000000000000e-01), infsup (-8.988465674311578541e+307, -8.988465674311578541e+307))); %! assert (isequal (times (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), infsup (5.000000000000000000e-01, 5.000000000000000000e-01)), infsup (-8.988465674311578541e+307, -8.988465674311578541e+307))); %!test %! assert (isequal (infsup (9.999888671826830054e-321, 9.999888671826830054e-321) .* infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (times (infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (9.999888671826830054e-321, 9.999888671826830054e-321)), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %!test %! assert (isequal (infsup (9.999888671826830054e-321, 9.999888671826830054e-321) .* infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (9.999888671826830054e-321, 9.999888671826830054e-321))); %! assert (isequal (times (infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (9.999888671826830054e-321, 9.999888671826830054e-321))); %!test %! assert (isequal (infsup (9.999888671826830054e-321, 9.999888671826830054e-321) .* infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (-9.999888671826830054e-321, -9.999888671826830054e-321))); %! assert (isequal (times (infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00)), infsup (-9.999888671826830054e-321, -9.999888671826830054e-321))); %!test %! assert (isequal (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00) .* infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (4.000000000000000000e+00, 9.000000000000000000e+00))); %! assert (isequal (times (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (-3.000000000000000000e+00, -2.000000000000000000e+00)), infsup (4.000000000000000000e+00, 9.000000000000000000e+00))); %!test %! assert (isequal (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00) .* infsup (-1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %! assert (isequal (times (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %!test %! assert (isequal (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00) .* infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (-9.000000000000000000e+00, -4.000000000000000000e+00))); %! assert (isequal (times (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (2.000000000000000000e+00, 3.000000000000000000e+00)), infsup (-9.000000000000000000e+00, -4.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00) .* infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-3.000000000000000000e+00, -2.000000000000000000e+00)), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00) .* infsup (-1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00) .* infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00), infsup (2.000000000000000000e+00, 3.000000000000000000e+00)), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %!test %! assert (isequal (infsup (2.000000000000000000e+00, 3.000000000000000000e+00) .* infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (-9.000000000000000000e+00, -4.000000000000000000e+00))); %! assert (isequal (times (infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (-3.000000000000000000e+00, -2.000000000000000000e+00)), infsup (-9.000000000000000000e+00, -4.000000000000000000e+00))); %!test %! assert (isequal (infsup (2.000000000000000000e+00, 3.000000000000000000e+00) .* infsup (-1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %! assert (isequal (times (infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %!test %! assert (isequal (infsup (2.000000000000000000e+00, 3.000000000000000000e+00) .* infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (4.000000000000000000e+00, 9.000000000000000000e+00))); %! assert (isequal (times (infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (2.000000000000000000e+00, 3.000000000000000000e+00)), infsup (4.000000000000000000e+00, 9.000000000000000000e+00))); %!test %! assert (isequal (infsup (-5.000000000000000000e+00, 2.000000000000000000e+00) .* infsup (-4.000000000000000000e+00, 3.000000000000000000e+00), infsup (-1.500000000000000000e+01, 2.000000000000000000e+01))); %! assert (isequal (times (infsup (-5.000000000000000000e+00, 2.000000000000000000e+00), infsup (-4.000000000000000000e+00, 3.000000000000000000e+00)), infsup (-1.500000000000000000e+01, 2.000000000000000000e+01))); %!test %! assert (isequal (infsup (-5.000000000000000000e+00, 2.000000000000000000e+00) .* infsup (-3.000000000000000000e+00, 8.000000000000000000e+00), infsup (-4.000000000000000000e+01, 1.600000000000000000e+01))); %! assert (isequal (times (infsup (-5.000000000000000000e+00, 2.000000000000000000e+00), infsup (-3.000000000000000000e+00, 8.000000000000000000e+00)), infsup (-4.000000000000000000e+01, 1.600000000000000000e+01))); %!test %! assert (isequal (infsup (-2.000000000000000000e+00, 5.000000000000000000e+00) .* infsup (-4.000000000000000000e+00, 3.000000000000000000e+00), infsup (-2.000000000000000000e+01, 1.500000000000000000e+01))); %! assert (isequal (times (infsup (-2.000000000000000000e+00, 5.000000000000000000e+00), infsup (-4.000000000000000000e+00, 3.000000000000000000e+00)), infsup (-2.000000000000000000e+01, 1.500000000000000000e+01))); %!test %! assert (isequal (infsup (-4.000000000000000000e+00, 5.000000000000000000e+00) .* infsup (-4.000000000000000000e+00, 3.000000000000000000e+00), infsup (-2.000000000000000000e+01, 1.600000000000000000e+01))); %! assert (isequal (times (infsup (-4.000000000000000000e+00, 5.000000000000000000e+00), infsup (-4.000000000000000000e+00, 3.000000000000000000e+00)), infsup (-2.000000000000000000e+01, 1.600000000000000000e+01))); %!test %! assert (isequal (infsup (-3.000000000000000000e+00, 0.000000000000000000e+00) .* infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (0.000000000000000000e+00, 9.000000000000000000e+00))); %! assert (isequal (times (infsup (-3.000000000000000000e+00, 0.000000000000000000e+00), infsup (-3.000000000000000000e+00, -2.000000000000000000e+00)), infsup (0.000000000000000000e+00, 9.000000000000000000e+00))); %!test %! assert (isequal (infsup (-3.000000000000000000e+00, 0.000000000000000000e+00) .* infsup (-1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %! assert (isequal (times (infsup (-3.000000000000000000e+00, 0.000000000000000000e+00), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %!test %! assert (isequal (infsup (-3.000000000000000000e+00, 0.000000000000000000e+00) .* infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (-9.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (-3.000000000000000000e+00, 0.000000000000000000e+00), infsup (2.000000000000000000e+00, 3.000000000000000000e+00)), infsup (-9.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00) .* infsup (-3.000000000000000000e+00, 0.000000000000000000e+00), infsup (0.000000000000000000e+00, 9.000000000000000000e+00))); %! assert (isequal (times (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (-3.000000000000000000e+00, 0.000000000000000000e+00)), infsup (0.000000000000000000e+00, 9.000000000000000000e+00))); %!test %! assert (isequal (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00) .* infsup (0.000000000000000000e+00, 3.000000000000000000e+00), infsup (-9.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (0.000000000000000000e+00, 3.000000000000000000e+00)), infsup (-9.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00) .* infsup (-3.000000000000000000e+00, 0.000000000000000000e+00), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-3.000000000000000000e+00, 0.000000000000000000e+00)), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00) .* infsup (0.000000000000000000e+00, 3.000000000000000000e+00), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %! assert (isequal (times (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00), infsup (0.000000000000000000e+00, 3.000000000000000000e+00)), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %!test %! assert (isequal (infsup (0.000000000000000000e+00, 3.000000000000000000e+00) .* infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (-9.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (0.000000000000000000e+00, 3.000000000000000000e+00), infsup (-3.000000000000000000e+00, -2.000000000000000000e+00)), infsup (-9.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (0.000000000000000000e+00, 3.000000000000000000e+00) .* infsup (-1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %! assert (isequal (times (infsup (0.000000000000000000e+00, 3.000000000000000000e+00), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (-3.000000000000000000e+00, 3.000000000000000000e+00))); %!test %! assert (isequal (infsup (0.000000000000000000e+00, 3.000000000000000000e+00) .* infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (0.000000000000000000e+00, 9.000000000000000000e+00))); %! assert (isequal (times (infsup (0.000000000000000000e+00, 3.000000000000000000e+00), infsup (2.000000000000000000e+00, 3.000000000000000000e+00)), infsup (0.000000000000000000e+00, 9.000000000000000000e+00))); %!test %! assert (isequal (infsup (2.000000000000000000e+00, 3.000000000000000000e+00) .* infsup (-3.000000000000000000e+00, 0.000000000000000000e+00), infsup (-9.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (-3.000000000000000000e+00, 0.000000000000000000e+00)), infsup (-9.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (2.000000000000000000e+00, 3.000000000000000000e+00) .* infsup (-3.000000000000000000e+00, 0.000000000000000000e+00), infsup (-9.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (-3.000000000000000000e+00, 0.000000000000000000e+00)), infsup (-9.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (0.000000000000000000e+00, 2.000000000000000000e+00) .* infsup (-3.000000000000000000e+00, 0.000000000000000000e+00), infsup (-6.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (0.000000000000000000e+00, 2.000000000000000000e+00), infsup (-3.000000000000000000e+00, 0.000000000000000000e+00)), infsup (-6.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321) .* infsup (-9.999888671826830054e-321, -9.999888671826830054e-321), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (times (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321), infsup (-9.999888671826830054e-321, -9.999888671826830054e-321)), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %!test %! assert (isequal (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321) .* infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-9.999888671826830054e-321, -9.999888671826830054e-321))); %! assert (isequal (times (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (-9.999888671826830054e-321, -9.999888671826830054e-321))); %!test %! assert (isequal (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321) .* infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (9.999888671826830054e-321, 9.999888671826830054e-321))); %! assert (isequal (times (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00)), infsup (9.999888671826830054e-321, 9.999888671826830054e-321))); %!test %! assert (isequal (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321) .* infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (-4.940656458412465442e-324, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321), infsup (9.999888671826830054e-321, 9.999888671826830054e-321)), infsup (-4.940656458412465442e-324, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321) .* infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (-9.999888671826830054e-321, -9.999888671826830054e-321), infsup (0.000000000000000000e+00, 0.000000000000000000e+00)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (9.999888671826830054e-321, 9.999888671826830054e-321) .* infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (times (infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (0.000000000000000000e+00, 0.000000000000000000e+00)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); ## FI_LIB.divii %!test %! assert (isequal (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00) ./ infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000000e+00))); %! assert (isequal (rdivide (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00)), infsup (1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00) ./ infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00))); %! assert (isequal (rdivide (infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00))); %!test %! assert (isequal (infsup (0.000000000000000000e+00, 0.000000000000000000e+00) ./ infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (rdivide (infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (0.000000000000000000e+00, 0.000000000000000000e+00) ./ infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (rdivide (infsup (0.000000000000000000e+00, 0.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (0.000000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 1.000000000000000000e+00) ./ infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00))); %! assert (isequal (rdivide (infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00)), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.000000000000000000e+00, 1.000000000000000000e+00) ./ infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000000e+00))); %! assert (isequal (rdivide (infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (infsup (1.797693134862315708e+308, 1.797693134862315708e+308) ./ infsup (2.000000000000000000e+00, 2.000000000000000000e+00), infsup (8.988465674311578541e+307, 8.988465674311578541e+307))); %! assert (isequal (rdivide (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), infsup (2.000000000000000000e+00, 2.000000000000000000e+00)), infsup (8.988465674311578541e+307, 8.988465674311578541e+307))); %!test %! assert (isequal (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308) ./ infsup (2.000000000000000000e+00, 2.000000000000000000e+00), infsup (-8.988465674311578541e+307, -8.988465674311578541e+307))); %! assert (isequal (rdivide (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), infsup (2.000000000000000000e+00, 2.000000000000000000e+00)), infsup (-8.988465674311578541e+307, -8.988465674311578541e+307))); %!test %! assert (isequal (infsup (9.999888671826830054e-321, 9.999888671826830054e-321) ./ infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (1.000000000000000000e+00, 1.000000000000000000e+00))); %! assert (isequal (rdivide (infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (9.999888671826830054e-321, 9.999888671826830054e-321)), infsup (1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (infsup (9.999888671826830054e-321, 9.999888671826830054e-321) ./ infsup (1.000000000000000000e+00, 1.000000000000000000e+00), infsup (9.999888671826830054e-321, 9.999888671826830054e-321))); %! assert (isequal (rdivide (infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (1.000000000000000000e+00, 1.000000000000000000e+00)), infsup (9.999888671826830054e-321, 9.999888671826830054e-321))); %!test %! assert (isequal (infsup (9.999888671826830054e-321, 9.999888671826830054e-321) ./ infsup (-1.000000000000000000e+00, -1.000000000000000000e+00), infsup (-9.999888671826830054e-321, -9.999888671826830054e-321))); %! assert (isequal (rdivide (infsup (9.999888671826830054e-321, 9.999888671826830054e-321), infsup (-1.000000000000000000e+00, -1.000000000000000000e+00)), infsup (-9.999888671826830054e-321, -9.999888671826830054e-321))); %!test %! assert (isequal (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00) ./ infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (6.666666666666666297e-01, 1.500000000000000000e+00))); %! assert (isequal (rdivide (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (-3.000000000000000000e+00, -2.000000000000000000e+00)), infsup (6.666666666666666297e-01, 1.500000000000000000e+00))); %!test %! assert (isequal (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00) ./ infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (-1.500000000000000000e+00, -6.666666666666666297e-01))); %! assert (isequal (rdivide (infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (2.000000000000000000e+00, 3.000000000000000000e+00)), infsup (-1.500000000000000000e+00, -6.666666666666666297e-01))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00) ./ infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (-5.000000000000000000e-01, 5.000000000000000000e-01))); %! assert (isequal (rdivide (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00), infsup (-3.000000000000000000e+00, -2.000000000000000000e+00)), infsup (-5.000000000000000000e-01, 5.000000000000000000e-01))); %!test %! assert (isequal (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00) ./ infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (-5.000000000000000000e-01, 5.000000000000000000e-01))); %! assert (isequal (rdivide (infsup (-1.000000000000000000e+00, 1.000000000000000000e+00), infsup (2.000000000000000000e+00, 3.000000000000000000e+00)), infsup (-5.000000000000000000e-01, 5.000000000000000000e-01))); %!test %! assert (isequal (infsup (2.000000000000000000e+00, 3.000000000000000000e+00) ./ infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (-1.500000000000000000e+00, -6.666666666666666297e-01))); %! assert (isequal (rdivide (infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (-3.000000000000000000e+00, -2.000000000000000000e+00)), infsup (-1.500000000000000000e+00, -6.666666666666666297e-01))); %!test %! assert (isequal (infsup (2.000000000000000000e+00, 3.000000000000000000e+00) ./ infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (6.666666666666666297e-01, 1.500000000000000000e+00))); %! assert (isequal (rdivide (infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (2.000000000000000000e+00, 3.000000000000000000e+00)), infsup (6.666666666666666297e-01, 1.500000000000000000e+00))); %!test %! assert (isequal (infsup (-3.000000000000000000e+00, 0.000000000000000000e+00) ./ infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (0.000000000000000000e+00, 1.500000000000000000e+00))); %! assert (isequal (rdivide (infsup (-3.000000000000000000e+00, 0.000000000000000000e+00), infsup (-3.000000000000000000e+00, -2.000000000000000000e+00)), infsup (0.000000000000000000e+00, 1.500000000000000000e+00))); %!test %! assert (isequal (infsup (-3.000000000000000000e+00, 0.000000000000000000e+00) ./ infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (-1.500000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (rdivide (infsup (-3.000000000000000000e+00, 0.000000000000000000e+00), infsup (2.000000000000000000e+00, 3.000000000000000000e+00)), infsup (-1.500000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (0.000000000000000000e+00, 3.000000000000000000e+00) ./ infsup (-3.000000000000000000e+00, -2.000000000000000000e+00), infsup (-1.500000000000000000e+00, 0.000000000000000000e+00))); %! assert (isequal (rdivide (infsup (0.000000000000000000e+00, 3.000000000000000000e+00), infsup (-3.000000000000000000e+00, -2.000000000000000000e+00)), infsup (-1.500000000000000000e+00, 0.000000000000000000e+00))); %!test %! assert (isequal (infsup (0.000000000000000000e+00, 3.000000000000000000e+00) ./ infsup (2.000000000000000000e+00, 3.000000000000000000e+00), infsup (0.000000000000000000e+00, 1.500000000000000000e+00))); %! assert (isequal (rdivide (infsup (0.000000000000000000e+00, 3.000000000000000000e+00), infsup (2.000000000000000000e+00, 3.000000000000000000e+00)), infsup (0.000000000000000000e+00, 1.500000000000000000e+00))); ## FI_LIB.unary_functions %!test %! assert (isequal (exp (infsup (-5.654676730021285758e+33, -2.467054147405823936e-70)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (exp (infsup (-1.339988487076310626e-66, -3.142176739251405931e-153)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (exp (infsup (-1.559745526584455293e+82, -8.494812002392629213e-61)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (exp (infsup (-1.215647583031333080e-125, -2.146363543986120533e-137)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!#exp [-0X6.FF424CB26239CP+292, -0X2.89F6682121BA8P+252] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (exp (infsup (-7.439842988767636755e+100, -1.769170660676674389e+00)), infsup (0.000000000000000000e+00, 1.704743112651300185e-01))); %!test %! assert (isequal (exp (infsup (-7.499234869798133827e+71, -1.740341118088671732e-132)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (exp (infsup (-2.932406654409041728e+52, -5.352481974657761661e-104)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (exp (infsup (-5.017847776764403958e-87, -2.227977792271395082e-227)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (exp (infsup (-1.827668734769395026e-22, -1.326175859067188756e-169)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!#exp [-0X1.582D3AFB2C63DP+312, -0X5.08DC843E57ED4P+180] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (exp (infsup (-5.423963041733560701e+77, -2.059305088062927775e-14)), infsup (0.000000000000000000e+00, 9.999999999999794609e-01))); %!test %! assert (isequal (exp (infsup (-3.360610542799653195e+197, -5.874775479904158146e+02)), infsup (0.000000000000000000e+00, 7.273486979199256744e-256))); %!#exp [-0X3.2FD3FDE325402P+688, -0X2.738623C238270P+48] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (exp (infsup (-3.249456070719769514e+02, -3.915939161035242553e-52)), infsup (7.549460722130907947e-142, 1.000000000000000000e+00))); %!test %! assert (isequal (exp (infsup (-6.756234292039407244e+297, -1.232680690145569154e-163)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (exp (infsup (-3.768432504481998329e-45, -1.425448715493971452e-132)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (exp (infsup (-6.868984884638793653e+105, -1.124545542537290068e-153)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!#exp [-0XD.F2552B8F60978P+236, -0X7.FBDBC320979A4P+188] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (exp (infsup (-4.825221040561267626e-72, -3.741418656433786262e-95)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (exp (infsup (1.000000000000000000e+00, 2.000000000000000000e+00)), infsup (2.718281828459045091e+00, 7.389056098930650407e+00))); %!test %! assert (isequal (exp (infsup (-1.000000000000000000e+00, 2.000000000000000000e+00)), infsup (3.678794411714422785e-01, 7.389056098930650407e+00))); %!test %! assert (isequal (exp (infsup (-5.000000000000000000e+00, -3.000000000000000000e+00)), infsup (6.737946999085467001e-03, 4.978706836786394446e-02))); %!test %! assert (isequal (exp (infsup (-2.000000000000000000e+00, 5.999999999999999778e-01)), infsup (1.353352832366126746e-01, 1.822118800390509108e+00))); %!test %! assert (isequal (exp (infsup (4.940656458412465442e-324, 5.526030376261632760e-318)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (exp (infsup (2.158572806680406152e-320, 1.000000000000000000e+00)), infsup (1.000000000000000000e+00, 2.718281828459045535e+00))); %!test %! assert (isequal (exp (infsup (-3.453765897253233967e-319, 3.453765897253233967e-319)), infsup (9.999999999999998890e-01, 1.000000000000000222e+00))); %!test %! assert (isequal (exp (infsup (-1.348799213146603066e-321, 1.999755859375000000e+00)), infsup (9.999999999999998890e-01, 7.387252350349609920e+00))); %!test %! assert (isequal (exp (infsup (-1.999984741210937500e+00, -1.768329819216851651e-316)), infsup (1.353373483049074844e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (exp (infsup (-1.999999996274709702e+00, 4.668945501635218808e-314)), infsup (1.353352837407758857e-01, 1.000000000000000222e+00))); %!test %! assert (isequal (pow2 (infsup (-5.654676730021285758e+33, -2.467054147405823936e-70)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow2 (infsup (-1.339988487076310626e-66, -3.142176739251405931e-153)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (pow2 (infsup (-1.559745526584455293e+82, -8.494812002392629213e-61)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow2 (infsup (-1.215647583031333080e-125, -2.146363543986120533e-137)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!#exp2 [-0X6.FF424CB26239CP+292, -0X2.89F6682121BA8P+252] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (pow2 (infsup (-7.439842988767636755e+100, -1.769170660676674389e+00)), infsup (0.000000000000000000e+00, 2.933773380418803201e-01))); %!test %! assert (isequal (pow2 (infsup (-7.499234869798133827e+71, -1.740341118088671732e-132)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow2 (infsup (-2.932406654409041728e+52, -5.352481974657761661e-104)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow2 (infsup (-5.017847776764403958e-87, -2.227977792271395082e-227)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (pow2 (infsup (-1.827668734769395026e-22, -1.326175859067188756e-169)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!#exp2 [-0X1.582D3AFB2C63DP+312, -0X5.08DC843E57ED4P+180] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (pow2 (infsup (-5.423963041733560701e+77, -2.059305088062927775e-14)), infsup (0.000000000000000000e+00, 9.999999999999857891e-01))); %!test %! assert (isequal (pow2 (infsup (-3.360610542799653195e+197, -5.874775479904158146e+02)), infsup (0.000000000000000000e+00, 1.417869550014210814e-177))); %!#exp2 [-0X3.2FD3FDE325402P+688, -0X2.738623C238270P+48] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (pow2 (infsup (-3.249456070719769514e+02, -3.915939161035242553e-52)), infsup (1.519236241890019241e-98, 1.000000000000000000e+00))); %!test %! assert (isequal (pow2 (infsup (-6.756234292039407244e+297, -1.232680690145569154e-163)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow2 (infsup (-3.768432504481998329e-45, -1.425448715493971452e-132)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (pow2 (infsup (-6.868984884638793653e+105, -1.124545542537290068e-153)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!#exp2 [-0XD.F2552B8F60978P+236, -0X7.FBDBC320979A4P+188] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (pow2 (infsup (-4.825221040561267626e-72, -3.741418656433786262e-95)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (pow2 (infsup (1.000000000000000000e+00, 2.000000000000000000e+00)), infsup (2.000000000000000000e+00, 4.000000000000000000e+00))); %!test %! assert (isequal (pow2 (infsup (-1.000000000000000000e+00, 2.000000000000000000e+00)), infsup (5.000000000000000000e-01, 4.000000000000000000e+00))); %!test %! assert (isequal (pow2 (infsup (-5.000000000000000000e+00, -3.000000000000000000e+00)), infsup (3.125000000000000000e-02, 1.250000000000000000e-01))); %!test %! assert (isequal (pow2 (infsup (-2.000000000000000000e+00, 5.999999999999999778e-01)), infsup (2.500000000000000000e-01, 1.515716566510398211e+00))); %!test %! assert (isequal (pow2 (infsup (1.348799213146603066e-321, 8.878353726979450304e-317)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (pow2 (infsup (-3.862967879279826753e-313, 1.508953107040180465e-315)), infsup (9.999999999999998890e-01, 1.000000000000000222e+00))); %!test %! assert (isequal (pow2 (infsup (6.914171912282031536e-314, 1.000000194699774969e+00)), infsup (1.000000000000000000e+00, 2.000000269911218709e+00))); %!test %! assert (isequal (pow2 (infsup (-1.110510763557203341e-312, 1.508971911178661183e-315)), infsup (9.999999999999998890e-01, 1.000000000000000222e+00))); %!test %! assert (isequal (pow2 (infsup (-1.508974781700063520e-315, 1.999999942630529270e+00)), infsup (9.999999999999998890e-01, 3.999999840938055939e+00))); %!test %! assert (isequal (pow2 (infsup (-1.999999999999999778e+00, 9.177083518333092811e-314)), infsup (2.500000000000000000e-01, 1.000000000000000222e+00))); %!test %! assert (isequal (pow10 (infsup (-1.306882282121512488e+34, -2.142051668986572426e-70)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-3.574174482995173238e-66, -4.502612523763230139e-153)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-1.977283881120209920e+82, -5.495270555084999106e-61)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-6.394132238750145602e-126, -1.090326174415294200e-137)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!#exp10 [-0X2.7C064F6929234P+292, -0X1.5444E676976F1P+252] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (pow10 (infsup (-4.308666602899711518e+100, -1.226586363793985335e+00)), infsup (0.000000000000000000e+00, 5.934903149808178069e-02))); %!test %! assert (isequal (pow10 (infsup (-7.949640211843924994e+71, -7.928935505948560140e-133)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-3.784447147395508652e+52, -3.876504952447015518e-104)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-2.524795598203051262e-87, -1.735629038886541013e-227)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-5.840571936196232559e-23, -1.237297234801419434e-169)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!#exp10 [-0X1.F0D19ADCB5D74P+312, -0X1.BA04D452BBB35P+180] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (pow10 (infsup (-3.330274496326268835e+77, -8.586668885039760719e-15)), infsup (0.000000000000000000e+00, 9.999999999999802380e-01))); %!test %! assert (isequal (pow10 (infsup (-2.654076110524515271e+197, -2.089478911258004246e+03)), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %!#exp10 [-0X2.A69A969772FDEP+688, -0X3.436DFE8F08194P+48] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (pow10 (infsup (-3.786643969857242382e+02, -1.042970653496689987e-51)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-6.699078654119896870e+297, -1.159254403776913034e-163)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-7.532163773886162862e-45, -9.621666972390800389e-133)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-1.485368733580681843e+106, -9.139956432627538486e-154)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!#exp10 [-0XD.5E2045CEE9720P+236, -0X6.6978492A3064CP+188] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (pow10 (infsup (-1.230428274874167409e-71, -5.894957732633465837e-95)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!#exp10 [-0XB.A944253373080P+564, -0XD.05E9CCF66CF58P+424] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (pow10 (infsup (-1.376904412228828177e+51, -8.878766165166293762e-17)), infsup (0.000000000000000000e+00, 9.999999999999998890e-01))); %!test %! assert (isequal (pow10 (infsup (-3.440680160407877302e-20, -1.442483959041155224e-103)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-7.528651283167650945e+03, -5.626945812397601245e-71)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-8.697059728957016802e+39, -6.144581905264969684e-145)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-2.952069202447659552e+66, -1.163046489009897174e-57)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-4.997184174270236677e-42, -7.340119470601840050e-203)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!#exp10 [-0XB.24D19E00C8460P+324, -0X1.D283CF8F05665P+252] = [0X0.0000000000000P+0, 0X0.0000000000000P+0]; %!test %! assert (isequal (pow10 (infsup (-1.845313858239065767e+196, -1.061757227068338186e-97)), infsup (0.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (pow10 (infsup (-4.488799649180782136e-36, -7.269525029365293208e-38)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (log (infsup (4.147420261371489825e-79, 5.379571027897612396e+28)), infsup (-1.804817358293410905e+02, 6.615499124023648392e+01))); %!test %! assert (isequal (log (infsup (1.110880646187224313e-155, 2.373351651082584966e-67)), infsup (-3.567955363383649683e+02, -1.534088980757222771e+02))); %!test %! assert (isequal (log (infsup (5.129079157666995424e-72, 1.751070362531829627e+71)), infsup (-1.641512005539303800e+02, 1.640437688392722464e+02))); %!test %! assert (isequal (log (infsup (6.948997631311531055e-148, 2.928301646694579776e-136)), infsup (-3.388439963396542112e+02, -3.120771500349853795e+02))); %!test %! assert (isequal (log (infsup (1.228976222624138207e+59, 2.234162998792154053e+68)), infsup (1.360587019701163172e+02, 1.573796529843343421e+02))); %!test %! assert (isequal (log (infsup (3.765881959744468747e-13, 4.282127607174989696e+83)), infsup (-2.860762412284734779e+01, 1.925690127090641397e+02))); %!test %! assert (isequal (log (infsup (6.336975772360046338e-144, 9.158993707856365702e+59)), infsup (-3.297258517440119476e+02, 1.380672568020790720e+02))); %!test %! assert (isequal (log (infsup (5.364761505213512494e-113, 4.082352475280499044e+42)), infsup (-2.585122635870604881e+02, 9.811524731508208674e+01))); %!test %! assert (isequal (log (infsup (7.550677903404239041e-232, 3.224750948704370352e-99)), infsup (-5.321781042268580677e+02, -2.267850684843527347e+02))); %!test %! assert (isequal (log (infsup (1.225297990074229138e-174, 4.817234909117431242e-40)), infsup (-4.004466221093460945e+02, -9.053120362661866238e+01))); %!test %! assert (isequal (log (infsup (2.170435512584716658e+35, 4.550722777302786970e+83)), infsup (8.136540609925064871e+01, 1.926298487910074471e+02))); %!test %! assert (isequal (log (infsup (2.535659632151250680e-30, 4.662866785261630365e+61)), infsup (-6.814709897670536520e+01, 1.419973211215928757e+02))); %!test %! assert (isequal (log (infsup (7.582817216007211414e+01, 2.533325420226928244e+179)), infsup (4.328469887979126796e+00, 4.130922644809588746e+02))); %!test %! assert (isequal (log (infsup (2.679384856388388202e+06, 3.456099944072672956e+189)), infsup (1.480109779494235944e+01, 4.364287233454008401e+02))); %!test %! assert (isequal (log (infsup (2.298466163925377139e-53, 3.422642591789022920e-07)), infsup (-1.212047679134660427e+02, -1.488768271059561599e+01))); %!test %! assert (isequal (log (infsup (8.331537116545182766e-169, 1.276575089856515728e+278)), infsup (-3.870168327490416118e+02, 6.403628366331134885e+02))); %!test %! assert (isequal (log (infsup (3.718156390017819207e-141, 1.084633607212178861e-48)), infsup (-3.233512701608040061e+02, -1.104428422229569691e+02))); %!test %! assert (isequal (log (infsup (3.157294329035461405e-160, 9.898300388558577825e+97)), infsup (-3.672638994432072650e+02, 2.256431170849012631e+02))); %!test %! assert (isequal (log (infsup (1.083356361649631714e+44, 3.415036575780023082e+59)), infsup (1.013938080560929649e+02, 1.370807086899449985e+02))); %!test %! assert (isequal (log (infsup (8.455584990678977241e-99, 6.051563441903092353e-73)), infsup (-2.258210970377273554e+02, -1.662883951297580438e+02))); %!test %! assert (isequal (log (infsup (2.360349141715971707e+109, 8.567792987486366378e+158)), infsup (2.518405846858512973e+02, 3.659564548647884408e+02))); %!test %! assert (isequal (log (infsup (2.012916824299288793e-32, 2.822293342336804668e+41)), infsup (-7.298313814928054910e+01, 9.544353860916723420e+01))); %!test %! assert (isequal (log (infsup (4.831139778854605785e-107, 2.083134309679031648e-23)), infsup (-2.448015225314781844e+02, -5.222558349970032054e+01))); %!test %! assert (isequal (log (infsup (8.466268199564697371e-76, 1.680782691923963737e-10)), infsup (-1.728603772463421535e+02, -2.250659135696745139e+01))); %!test %! assert (isequal (log (infsup (2.283702426861795342e-151, 2.158830003381976904e+22)), infsup (-3.468645510447575475e+02, 5.142643845571060979e+01))); %!test %! assert (isequal (log (infsup (1.114428406645123204e-64, 1.137441975089809242e+58)), infsup (-1.472571043179317201e+02, 1.336787172532864645e+02))); %!test %! assert (isequal (log (infsup (1.463767593806767211e-207, 3.684178239990781413e-44)), infsup (-4.762541005942298398e+02, -1.000096965923245591e+02))); %!test %! assert (isequal (log (infsup (1.806590984564742948e+58, 4.476357965164357790e+78)), infsup (1.341413770290983223e+02, 1.811004470151316070e+02))); %!test %! assert (isequal (log (infsup (2.504949335867761681e-102, 4.444462712533866271e+177)), infsup (-2.339454109762628775e+02, 4.090492204470355091e+02))); %!test %! assert (isequal (log (infsup (1.027829701532525701e-53, 1.755408547816880709e-45)), infsup (-1.220095604353624026e+02, -1.030536275641269413e+02))); %!test %! assert (isequal (log2 (infsup (4.147420261371489825e-79, 5.379571027897612396e+28)), infsup (-2.603801052520223038e+02, 9.544147779234198481e+01))); %!test %! assert (isequal (log2 (infsup (1.110880646187224313e-155, 2.373351651082584966e-67)), infsup (-5.147471508866771046e+02, -2.213222564820849811e+02))); %!test %! assert (isequal (log2 (infsup (5.129079157666995424e-72, 1.751070362531829627e+71)), infsup (-2.368201229951249900e+02, 2.366651317931535345e+02))); %!test %! assert (isequal (log2 (infsup (6.948997631311531055e-148, 2.928301646694579776e-136)), infsup (-4.888485531542171429e+02, -4.502321567302344079e+02))); %!test %! assert (isequal (log2 (infsup (1.228976222624138207e+59, 2.234162998792154053e+68)), infsup (1.962912146020762520e+02, 2.270508448973251063e+02))); %!test %! assert (isequal (log2 (infsup (3.765881959744468747e-13, 4.282127607174989696e+83)), infsup (-4.127207745364734848e+01, 2.778183596642506359e+02))); %!test %! assert (isequal (log2 (infsup (6.336975772360046338e-144, 9.158993707856365702e+59)), infsup (-4.756938511639755802e+02, 1.991889466975024732e+02))); %!test %! assert (isequal (log2 (infsup (5.364761505213512494e-113, 4.082352475280499044e+42)), infsup (-3.729543606860327145e+02, 1.415503807370631080e+02))); %!test %! assert (isequal (log2 (infsup (7.550677903404239041e-232, 3.224750948704370352e-99)), infsup (-7.677707118377780944e+02, -3.271816936500396196e+02))); %!test %! assert (isequal (log2 (infsup (1.225297990074229138e-174, 4.817234909117431242e-40)), infsup (-5.777223558578903067e+02, -1.306089185178316825e+02))); %!test %! assert (isequal (log2 (infsup (2.170435512584716658e+35, 4.550722777302786970e+83)), infsup (1.173854678793055371e+02, 2.779061275779773723e+02))); %!test %! assert (isequal (log2 (infsup (2.535659632151250680e-30, 4.662866785261630365e+61)), infsup (-9.831548174466217915e+01, 2.048588310016397145e+02))); %!test %! assert (isequal (log2 (infsup (7.582817216007211414e+01, 2.533325420226928244e+179)), infsup (6.244662042024692994e+00, 5.959661613962714455e+02))); %!test %! assert (isequal (log2 (infsup (2.679384856388388202e+06, 3.456099944072672956e+189)), infsup (2.135347038847591250e+01, 6.296335548719112012e+02))); %!test %! assert (isequal (log2 (infsup (2.298466163925377139e-53, 3.422642591789022920e-07)), infsup (-1.748615176008552226e+02, -2.147838601690465765e+01))); %!test %! assert (isequal (log2 (infsup (8.331537116545182766e-169, 1.276575089856515728e+278)), infsup (-5.583472653475956804e+02, 9.238482887801823153e+02))); %!test %! assert (isequal (log2 (infsup (3.718156390017819207e-141, 1.084633607212178861e-48)), infsup (-4.664972739261393144e+02, -1.593353407767422425e+02))); %!test %! assert (isequal (log2 (infsup (3.157294329035461405e-160, 9.898300388558577825e+97)), infsup (-5.298498064242580767e+02, 3.255342060291147845e+02))); %!test %! assert (isequal (log2 (infsup (1.083356361649631714e+44, 3.415036575780023082e+59)), infsup (1.462803440593727373e+02, 1.977656586285282856e+02))); %!test %! assert (isequal (log2 (infsup (8.455584990678977241e-99, 6.051563441903092353e-73)), infsup (-3.257909768244346083e+02, -2.399034430110863809e+02))); %!test %! assert (isequal (log2 (infsup (2.360349141715971707e+109, 8.567792987486366378e+158)), infsup (3.633291626208546745e+02, 5.279635626147360199e+02))); %!test %! assert (isequal (log2 (infsup (2.012916824299288793e-32, 2.822293342336804668e+41)), infsup (-1.052924114764811634e+02, 1.376959198363398968e+02))); %!test %! assert (isequal (log2 (infsup (4.831139778854605785e-107, 2.083134309679031648e-23)), infsup (-3.531739425582314311e+02, -7.534559032255012312e+01))); %!test %! assert (isequal (log2 (infsup (8.466268199564697371e-76, 1.680782691923963737e-10)), infsup (-2.493848090194932183e+02, -3.247014773801134879e+01))); %!test %! assert (isequal (log2 (infsup (2.283702426861795342e-151, 2.158830003381976904e+22)), infsup (-5.004197676524483995e+02, 7.419266773063517917e+01))); %!test %! assert (isequal (log2 (infsup (1.114428406645123204e-64, 1.137441975089809242e+58)), infsup (-2.124470941351488307e+02, 1.928576224537142991e+02))); %!test %! assert (isequal (log2 (infsup (1.463767593806767211e-207, 3.684178239990781413e-44)), infsup (-6.870894291303288810e+02, -1.442834933145564946e+02))); %!test %! assert (isequal (log2 (infsup (1.806590984564742948e+58, 4.476357965164357790e+78)), infsup (1.935250994178968824e+02, 2.612727168115048926e+02))); %!test %! assert (isequal (log2 (infsup (2.504949335867761681e-102, 4.444462712533866271e+177)), infsup (-3.375118842541849062e+02, 5.901332818184345115e+02))); %!test %! assert (isequal (log2 (infsup (1.027829701532525701e-53, 1.755408547816880709e-45)), infsup (-1.760225877811396060e+02, -1.486749574323841045e+02))); %!test %! assert (isequal (log10 (infsup (4.147420261371489825e-79, 5.379571027897612396e+28)), infsup (-7.838222195500324574e+01, 2.873074764599266473e+01))); %!test %! assert (isequal (log10 (infsup (1.110880646187224313e-155, 2.373351651082584966e-67)), infsup (-1.549543325994630720e+02, -6.662463790914456752e+01))); %!test %! assert (isequal (log10 (infsup (5.129079157666995424e-72, 1.751070362531829627e+71)), infsup (-7.128996059836597965e+01, 7.124330359750855735e+01))); %!test %! assert (isequal (log10 (infsup (6.948997631311531055e-148, 2.928301646694579776e-136)), infsup (-1.471580778363574780e+02, -1.355333841882873571e+02))); %!test %! assert (isequal (log10 (infsup (1.228976222624138207e+59, 2.234162998792154053e+68)), infsup (5.908954348054061967e+01, 6.834911485494504291e+01))); %!test %! assert (isequal (log10 (infsup (3.765881959744468747e-13, 4.282127607174989696e+83)), infsup (-1.242413329691495782e+01, 8.363165960510373509e+01))); %!test %! assert (isequal (log10 (infsup (6.336975772360046338e-144, 9.158993707856365702e+59)), infsup (-1.431981179532740782e+02, 5.996184776066215250e+01))); %!test %! assert (isequal (log10 (infsup (5.364761505213512494e-113, 4.082352475280499044e+42)), infsup (-1.122704495801793030e+02, 4.261091049951299681e+01))); %!test %! assert (isequal (log10 (infsup (7.550677903404239041e-232, 3.224750948704370352e-99)), infsup (-2.311220140554580951e+02, -9.849150382080546251e+01))); %!test %! assert (isequal (log10 (infsup (1.225297990074229138e-174, 4.817234909117431242e-40)), infsup (-1.739117582788857135e+02, -3.931720217510014947e+01))); %!test %! assert (isequal (log10 (infsup (2.170435512584716658e+35, 4.550722777302786970e+83)), infsup (3.533654688672174871e+01, 8.365808037979232381e+01))); %!test %! assert (isequal (log10 (infsup (2.535659632151250680e-30, 4.662866785261630365e+61)), infsup (-2.959590904329787620e+01, 6.166865300815185691e+01))); %!test %! assert (isequal (log10 (infsup (7.582817216007211414e+01, 2.533325420226928244e+179)), infsup (1.879830587433721334e+00, 1.794036909809991016e+02))); %!test %! assert (isequal (log10 (infsup (2.679384856388388202e+06, 3.456099944072672956e+189)), infsup (6.428035098453854346e+00, 1.895385862929884695e+02))); %!test %! assert (isequal (log10 (infsup (2.298466163925377139e-53, 3.422642591789022920e-07)), infsup (-5.263856188518261803e+01, -6.465638449538123389e+00))); %!test %! assert (isequal (log10 (infsup (8.331537116545182766e-169, 1.276575089856515728e+278)), infsup (-1.680792748665824945e+02, 2.781060463656747288e+02))); %!test %! assert (isequal (log10 (infsup (3.718156390017819207e-141, 1.084633607212178861e-48)), infsup (-1.404296723472447752e+02, -4.796471694314168133e+01))); %!test %! assert (isequal (log10 (infsup (3.157294329035461405e-160, 9.898300388558577825e+97)), infsup (-1.595006849304556908e+02, 9.799556062942198764e+01))); %!test %! assert (isequal (log10 (infsup (1.083356361649631714e+44, 3.415036575780023082e+59)), infsup (4.403477133791865583e+01, 5.953339535943025851e+01))); %!test %! assert (isequal (log10 (infsup (8.455584990678977241e-99, 6.051563441903092353e-73)), infsup (-9.807285634082376191e+01, -7.221813240940149115e+01))); %!test %! assert (isequal (log10 (infsup (2.360349141715971707e+109, 8.567792987486366378e+158)), infsup (1.093729762483538082e+02, 1.589328689646540624e+02))); %!test %! assert (isequal (log10 (infsup (2.012916824299288793e-32, 2.822293342336804668e+41)), infsup (-3.169617417021524730e+01, 4.145060215128129499e+01))); %!test %! assert (isequal (log10 (infsup (4.831139778854605785e-107, 2.083134309679031648e-23)), infsup (-1.063159503969355484e+02, -2.268128272809736856e+01))); %!test %! assert (isequal (log10 (infsup (8.466268199564697371e-76, 1.680782691923963737e-10)), infsup (-7.507230797780081843e+01, -9.774488432782383995e+00))); %!test %! assert (isequal (log10 (infsup (2.283702426861795342e-151, 2.158830003381976904e+22)), infsup (-1.506413604865870184e+02, 2.233421844525230426e+01))); %!test %! assert (isequal (log10 (infsup (1.114428406645123204e-64, 1.137441975089809242e+58)), infsup (-6.395294782632925745e+01, 5.805592925100733481e+01))); %!test %! assert (isequal (log10 (infsup (1.463767593806767211e-207, 3.684178239990781413e-44)), infsup (-2.068345278718702218e+02, -4.343365936686500106e+01))); %!test %! assert (isequal (log10 (infsup (1.806590984564742948e+58, 4.476357965164357790e+78)), infsup (5.825685983864102724e+01, 7.865092480888390014e+01))); %!test %! assert (isequal (log10 (infsup (2.504949335867761681e-102, 4.444462712533866271e+177)), infsup (-1.016012010535794019e+02, 1.776478192669743237e+02))); %!test %! assert (isequal (log10 (infsup (1.027829701532525701e-53, 1.755408547816880709e-45)), infsup (-5.298807883651920747e+01, -4.475562179121317996e+01))); %!test %! assert (isequal (sin (infsup (-1.820250631842705497e-45, -9.117403206523163851e-284)), infsup (-1.820250631842705497e-45, -9.117403206523162656e-284))); %!test %! assert (isequal (sin (infsup (-9.132843019095516065e-132, -9.836586939929288236e-188)), infsup (-9.132843019095516065e-132, -9.836586939929286960e-188))); %!test %! assert (isequal (sin (infsup (-8.631384205445317548e+01, -2.269091389186822222e-289)), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (-1.654017949299359065e-112, 1.159376035639006975e-176)), infsup (-1.654017949299359065e-112, 1.159376035639006975e-176))); %!test %! assert (isequal (sin (infsup (-2.261578927830210317e-107, -2.921845682025291002e-170)), infsup (-2.261578927830210317e-107, -2.921845682025290634e-170))); %!test %! assert (isequal (sin (infsup (-1.469458391712281360e-99, -1.976254011990074054e-124)), infsup (-1.469458391712281360e-99, -1.976254011990073634e-124))); %!test %! assert (isequal (sin (infsup (-1.088588131986426258e-12, -3.239993862505298994e-238)), infsup (-1.088588131986426258e-12, -3.239993862505298312e-238))); %!test %! assert (isequal (sin (infsup (-3.114600191344484305e-60, -1.151057432815240852e-61)), infsup (-3.114600191344484305e-60, -1.151057432815240680e-61))); %!test %! assert (isequal (sin (infsup (3.215755734598088570e-80, 2.860247434645490115e-24)), infsup (3.215755734598088196e-80, 2.860247434645490115e-24))); %!test %! assert (isequal (sin (infsup (-7.599545156767026148e-113, -3.620806299549831939e-276)), infsup (-7.599545156767026148e-113, -3.620806299549831137e-276))); %!test %! assert (isequal (sin (infsup (-8.378054792460110690e-178, 2.171929406448802147e-04)), infsup (-8.378054792460110690e-178, 2.171929389372813358e-04))); %!test %! assert (isequal (sin (infsup (-6.977305240208117095e-101, -5.652987073406890307e-174)), infsup (-6.977305240208117095e-101, -5.652987073406889409e-174))); %!test %! assert (isequal (sin (infsup (-5.464129729164141708e-282, 9.669182275976748412e-117)), infsup (-5.464129729164141708e-282, 9.669182275976748412e-117))); %!test %! assert (isequal (sin (infsup (-2.609094333453398954e-148, 5.011306988287881225e-06)), infsup (-2.609094333453398954e-148, 5.011306988266906995e-06))); %!test %! assert (isequal (sin (infsup (-2.520164184091732485e-91, -6.923225182185906259e-252)), infsup (-2.520164184091732485e-91, -6.923225182185905290e-252))); %!test %! assert (isequal (sin (infsup (-2.058411222963202619e-150, -1.691080271454051769e-229)), infsup (-2.058411222963202619e-150, -1.691080271454051403e-229))); %!test %! assert (isequal (sin (infsup (-1.194912260770650641e-171, -3.063641562993914407e-235)), infsup (-1.194912260770650641e-171, -3.063641562993914058e-235))); %!test %! assert (isequal (sin (infsup (-1.410213021759318257e-164, 2.113307206456483530e-235)), infsup (-1.410213021759318257e-164, 2.113307206456483530e-235))); %!test %! assert (isequal (sin (infsup (-2.734402476279937437e-15, 2.214286456252711975e-200)), infsup (-2.734402476279937437e-15, 2.214286456252711975e-200))); %!test %! assert (isequal (sin (infsup (-4.736813689297963792e-37, -3.757820326147841254e-165)), infsup (-4.736813689297963792e-37, -3.757820326147840772e-165))); %!test %! assert (isequal (sin (infsup (-1.178872317111653867e-269, -3.697079530478824433e-304)), infsup (-1.178872317111653867e-269, -3.697079530478823624e-304))); %!test %! assert (isequal (sin (infsup (-3.170977600535302060e-50, 1.773732353250808790e-223)), infsup (-3.170977600535302060e-50, 1.773732353250808790e-223))); %!test %! assert (isequal (sin (infsup (-9.582715182984806788e-234, -6.481946913158783102e-280)), infsup (-9.582715182984806788e-234, -6.481946913158782124e-280))); %!test %! assert (isequal (sin (infsup (1.510030059283921314e-212, 1.357381528725581723e-08)), infsup (1.510030059283921050e-212, 1.357381528725581723e-08))); %!test %! assert (isequal (sin (infsup (-1.323507196051687166e-113, 8.782017701712098963e-233)), infsup (-1.323507196051687166e-113, 8.782017701712098963e-233))); %!test %! assert (isequal (sin (infsup (-7.715995104235895070e-26, -1.871718785128404206e-162)), infsup (-7.715995104235895070e-26, -1.871718785128403959e-162))); %!test %! assert (isequal (sin (infsup (-3.395185885371617857e-83, -1.892322506995032646e-149)), infsup (-3.395185885371617857e-83, -1.892322506995032429e-149))); %!test %! assert (isequal (sin (infsup (-1.449285613317172764e-98, -5.707789272110613126e-264)), infsup (-1.449285613317172764e-98, -5.707789272110612244e-264))); %!test %! assert (isequal (sin (infsup (-1.045711771041448932e-76, 2.500374714085601101e-183)), infsup (-1.045711771041448932e-76, 2.500374714085601101e-183))); %!test %! assert (isequal (sin (infsup (-1.069106323474023944e-70, -1.300019611184126890e-129)), infsup (-1.069106323474023944e-70, -1.300019611184126730e-129))); %!test %! assert (isequal (cos (infsup (-1.820250631842705497e-45, -9.117403206523163851e-284)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-9.132843019095516065e-132, -9.836586939929288236e-188)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-8.631384205445317548e+01, -2.269091389186822222e-289)), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-1.654017949299359065e-112, 1.159376035639006975e-176)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-2.261578927830210317e-107, -2.921845682025291002e-170)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-1.469458391712281360e-99, -1.976254011990074054e-124)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-1.088588131986426258e-12, -3.239993862505298994e-238)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-3.114600191344484305e-60, -1.151057432815240852e-61)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (3.215755734598088570e-80, 2.860247434645490115e-24)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-7.599545156767026148e-113, -3.620806299549831939e-276)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-8.378054792460110690e-178, 2.171929406448802147e-04)), infsup (9.999999764136132674e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-6.977305240208117095e-101, -5.652987073406890307e-174)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-5.464129729164141708e-282, 9.669182275976748412e-117)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-2.609094333453398954e-148, 5.011306988287881225e-06)), infsup (9.999999999874433776e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-2.520164184091732485e-91, -6.923225182185906259e-252)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-2.058411222963202619e-150, -1.691080271454051769e-229)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-1.194912260770650641e-171, -3.063641562993914407e-235)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-1.410213021759318257e-164, 2.113307206456483530e-235)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-2.734402476279937437e-15, 2.214286456252711975e-200)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-4.736813689297963792e-37, -3.757820326147841254e-165)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-1.178872317111653867e-269, -3.697079530478824433e-304)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-3.170977600535302060e-50, 1.773732353250808790e-223)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-9.582715182984806788e-234, -6.481946913158783102e-280)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (1.510030059283921314e-212, 1.357381528725581723e-08)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-1.323507196051687166e-113, 8.782017701712098963e-233)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-7.715995104235895070e-26, -1.871718785128404206e-162)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-3.395185885371617857e-83, -1.892322506995032646e-149)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-1.449285613317172764e-98, -5.707789272110613126e-264)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-1.045711771041448932e-76, 2.500374714085601101e-183)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (cos (infsup (-1.069106323474023944e-70, -1.300019611184126890e-129)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (tan (infsup (7.068583836474448390e+01, 7.075330512586873510e+01)), infsup (-2.733006473448547767e+05, -1.479881285214991671e+01))); %!test %! assert (isequal (tan (infsup (1.555088363530945514e+02, 1.555132637869551502e+02)), infsup (-2.501337356624831200e+09, -2.258629732531564116e+02))); %!test %! assert (isequal (tan (infsup (1.413716780550254626e+01, 1.413722739196949441e+01)), infsup (-1.156940779064804548e+06, -1.654237402347945317e+04))); %!test %! assert (isequal (tan (infsup (5.811952623508042848e+01, 5.812260122540014606e+01)), infsup (-1.609174370815468137e+04, -3.187612397101500505e+02))); %!test %! assert (isequal (tan (infsup (1.104269817737113499e+03, 1.104269843933251650e+03)), infsup (-3.320322546736923695e+09, -3.817312678644171683e+04))); %!test %! assert (isequal (tan (infsup (7.853981742281575862e+00, 1.079991165038144985e+01)), infsup (-9.233005655163565651e+06, 5.045449840129903940e+00))); %!test %! assert (isequal (tan (infsup (5.239391148189279193e+04, 5.239399492445894430e+04)), infsup (-6.064225515766228782e+05, -1.195622657457963633e+01))); %!test %! assert (isequal (tan (infsup (7.586946266951879352e+02, 7.586949897443035979e+02)), infsup (-1.171985512609519530e+06, -2.747989687166772001e+03))); %!test %! assert (isequal (tan (infsup (3.011216624054200111e+03, 3.011217034712601162e+03)), infsup (-1.524660234605764526e+04, -2.099751551658140215e+03))); %!test %! assert (isequal (tan (infsup (4.712389001448225478e+00, 4.712393345839713810e+00)), infsup (-4.747541049162796140e+07, -2.290711952149188728e+05))); %!test %! assert (isequal (tan (infsup (9.660397409977252892e+02, 9.660408736798588052e+02)), infsup (-5.301139629714514315e+07, -8.828451415145300416e+02))); %!test %! assert (isequal (tan (infsup (7.853981635987763887e+00, 7.854153626675180355e+00)), infsup (-4.967017041818811297e+08, -5.814200172946292696e+03))); %!test %! assert (isequal (tan (infsup (5.811946410445683142e+01, 5.821150187298621859e+01)), infsup (-7.665386554086588323e+07, -1.083440665308985906e+01))); %!test %! assert (isequal (tan (infsup (7.853981655490968272e+00, 8.893108173179410159e+00)), infsup (-4.647599232951004803e+07, -5.881622348891323293e-01))); %!test %! assert (isequal (tan (infsup (1.352469666641228059e+03, 1.352470270671131857e+03)), infsup (-7.127486560119896808e+01, -6.833240428001097655e+01))); %!test %! assert (isequal (tan (infsup (2.670354408912840682e+01, 2.672430666491903750e+01)), infsup (-1.530546221103163844e+05, -4.814150626430674151e+01))); %!test %! assert (isequal (tan (infsup (1.003220490034101676e+05, 1.003220547796015017e+05)), infsup (-1.979169548332780600e+09, -1.731225184926742315e+02))); %!test %! assert (isequal (tan (infsup (1.545333850137601839e+05, 1.545336486881895107e+05)), infsup (-7.586811168897187940e+01, -3.519246594516249438e+00))); %!test %! assert (isequal (tan (infsup (4.256858100226353940e+02, 4.256861391324387682e+02)), infsup (-1.831093219268073444e+05, -2.988901899973172021e+03))); %!test %! assert (isequal (tan (infsup (1.892809573788563739e+03, 1.892817290399498461e+03)), infsup (-1.401909320127509832e+09, -1.295879845757753230e+02))); %!test %! assert (isequal (tan (infsup (2.673196896903307643e+05, 2.673216347431440372e+05)), infsup (-2.063441696743329614e+07, 3.927681680442902667e-01))); %!test %! assert (isequal (tan (infsup (3.926990817370413822e+01, 3.926991071421139168e+01)), infsup (-2.609792168562986851e+08, -3.930293916624513222e+05))); %!test %! assert (isequal (tan (infsup (2.984513044884169730e+01, 2.984607373920065143e+01)), infsup (-4.171208738684172742e+06, -1.059849289150749428e+03))); %!test %! assert (isequal (tan (infsup (2.670353946608568307e+01, 2.736226360891474840e+01)), infsup (-5.234033417295927648e+05, -1.291880114820135095e+00))); %!test %! assert (isequal (tan (infsup (4.500331685768444004e+03, 4.500332498243393275e+03)), infsup (-4.773245350635401337e+03, -9.784962051021077514e+02))); %!test %! assert (isequal (tan (infsup (1.220508745920102228e+03, 1.220511210335735768e+03)), infsup (-2.138784586246906519e+09, -4.057748101491103512e+02))); %!test %! assert (isequal (tan (infsup (2.984514872583801903e+01, 2.984530664322180371e+01)), infsup (-5.400520128356148052e+04, -5.667837925038271351e+03))); %!test %! assert (isequal (tan (infsup (1.944567312807089183e+05, 1.944582117162205104e+05)), infsup (-1.947536722055554565e+05, -9.060237858764001728e-02))); %!test %! assert (isequal (tan (infsup (2.356194490664901053e+01, 2.356194490664901053e+01)), infsup (-2.116150755620213449e+08, -2.116150755620213151e+08))); %!test %! assert (isequal (tan (infsup (2.356194490664901053e+01, 2.357580376726279070e+01)), infsup (-2.116150755620213449e+08, -7.215135957959719804e+01))); %!test %! assert (isequal (cot (infsup (6.911504203794957846e+01, 6.918250879907382966e+01)), infsup (1.479881285215185649e+01, 2.733006480036904104e+05))); %!test %! assert (isequal (cot (infsup (1.539380400262996602e+02, 1.539424674601602590e+02)), infsup (2.258629732528814316e+02, 2.501303631633254051e+09))); %!test %! assert (isequal (cot (infsup (1.256637147870764970e+01, 1.256643106517459785e+01)), infsup (1.654237402346269664e+04, 1.156940778982844437e+06))); %!test %! assert (isequal (cot (infsup (5.654872990828553725e+01, 5.655180489860525483e+01)), infsup (3.187612397096023642e+02, 1.609174370675889440e+04))); %!test %! assert (isequal (cot (infsup (1.102699021410318664e+03, 1.102699047606456816e+03)), infsup (3.817312669575550535e+04, 3.319636590212901592e+09))); %!test %! assert (isequal (cot (infsup (6.283185415486680192e+00, 9.229115323586553288e+00)), infsup (-5.045449840129905716e+00, 9.233005574227824807e+06))); %!test %! assert (isequal (cot (infsup (5.239234068556599232e+04, 5.239242412813214469e+04)), infsup (1.195622657525802346e+01, 6.064242846372171771e+05))); %!test %! assert (isequal (cot (infsup (7.571238303683931008e+02, 7.571241934175087636e+02)), infsup (2.747989686696816989e+03, 1.171985427128394833e+06))); %!test %! assert (isequal (cot (infsup (3.009645827727405049e+03, 3.009646238385806100e+03)), infsup (2.099751552386235289e+03, 1.524660238444589413e+04))); %!test %! assert (isequal (cot (infsup (3.141592674653329809e+00, 3.141597019044817252e+00)), infsup (2.290711952117057808e+05, 4.747540835173728317e+07))); %!test %! assert (isequal (cot (infsup (9.644689446709303411e+02, 9.644700773530638571e+02)), infsup (8.828451415546335284e+02, 5.301154089150482416e+07))); %!test %! assert (isequal (cot (infsup (6.283185309192868218e+00, 6.283357299880284685e+00)), infsup (5.814200172914197537e+03, 4.967014699504108429e+08))); %!test %! assert (isequal (cot (infsup (5.654866777766194019e+01, 5.664070554619132736e+01)), infsup (1.083440665308922135e+01, 7.665383386845602095e+07))); %!test %! assert (isequal (cot (infsup (6.283185328696072602e+00, 7.322311846384514489e+00)), infsup (5.881622348891311081e-01, 4.647599027876593918e+07))); %!test %! assert (isequal (cot (infsup (1.350898870314433225e+03, 1.350899474344337023e+03)), infsup (6.833240427972033615e+01, 7.127486560088274814e+01))); %!test %! assert (isequal (cot (infsup (2.513274776233351204e+01, 2.515351033812414272e+01)), infsup (4.814150626430247826e+01, 1.530546220672695199e+05))); %!test %! assert (isequal (cot (infsup (1.003204782070833753e+05, 1.003204839832747093e+05)), infsup (1.731225184158446382e+02, 1.969179325263058186e+09))); %!test %! assert (isequal (cot (infsup (1.545318142174333916e+05, 1.545320778918627184e+05)), infsup (3.519246594481938661e+00, 7.586811167421478785e+01))); %!test %! assert (isequal (cot (infsup (4.241150136958405028e+02, 4.241153428056438770e+02)), infsup (2.988901899925017460e+03, 1.831093217460757296e+05))); %!test %! assert (isequal (cot (infsup (1.891238777461768905e+03, 1.891246494072703626e+03)), infsup (1.295879845747301715e+02, 1.401787019768815756e+09))); %!test %! assert (isequal (cot (infsup (2.673181188940039719e+05, 2.673200639468172449e+05)), infsup (-3.927681680472490666e-01, 2.063332560662991926e+07))); %!test %! assert (isequal (cot (infsup (3.769911184690924699e+01, 3.769911438741650045e+01)), infsup (3.930293908297998714e+05, 2.609788497224701643e+08))); %!test %! assert (isequal (cot (infsup (2.827433412204680252e+01, 2.827527741240575665e+01)), infsup (1.059849289148685102e+03, 4.171208706711991224e+06))); %!test %! assert (isequal (cot (infsup (2.513274313929078829e+01, 2.579146728211985362e+01)), infsup (1.291880114820130210e+00, 5.234033412261832273e+05))); %!test %! assert (isequal (cot (infsup (4.498760889441648942e+03, 4.498761701916598213e+03)), infsup (9.784962052602219273e+02, 4.773245354397929077e+03))); %!test %! assert (isequal (cot (infsup (1.218937949593307394e+03, 1.218940414008940934e+03)), infsup (4.057748101388633017e+02, 2.138499942228402615e+09))); %!test %! assert (isequal (cot (infsup (2.827435239904312425e+01, 2.827451031642690893e+01)), infsup (5.667837924979239688e+03, 5.400520127820203925e+04))); %!test %! assert (isequal (cot (infsup (1.944551604843821260e+05, 1.944566409198937181e+05)), infsup (9.060237858505562625e-02, 1.947535749805420055e+05))); %!test %! assert (isequal (cot (infsup (8.230986922511164039e+02, 8.231133959538416320e+02)), infsup (6.202662085179850493e+01, 7.057105552665587993e+02))); %!test %! assert (isequal (cot (infsup (2.199114857985411220e+01, 2.200500744046789237e+01)), infsup (7.215135957960613666e+01, 2.116151523669368625e+08))); %!test %! assert (isequal (asin (infsup (-1.312389047028587488e-49, -2.435356662074063942e-204)), infsup (-1.312389047028587678e-49, -2.435356662074063942e-204))); %!test %! assert (isequal (asin (infsup (-2.826769732140076133e-84, -5.561386920473982459e-193)), infsup (-2.826769732140076591e-84, -5.561386920473982459e-193))); %!test %! assert (isequal (asin (infsup (-1.165983769138532228e-88, -1.428974577546032222e-230)), infsup (-1.165983769138532367e-88, -1.428974577546032222e-230))); %!test %! assert (isequal (asin (infsup (-9.442195953730013721e-285, -2.740460328962132443e-294)), infsup (-9.442195953730015214e-285, -2.740460328962132443e-294))); %!test %! assert (isequal (asin (infsup (2.046759423140378801e-219, 9.256656556116300803e-185)), infsup (2.046759423140378801e-219, 9.256656556116302109e-185))); %!test %! assert (isequal (asin (infsup (-3.808509373683396527e-193, 7.757841386304002834e-162)), infsup (-3.808509373683397013e-193, 7.757841386304003821e-162))); %!test %! assert (isequal (asin (infsup (-1.187397361107265637e-112, -2.668312821848315349e-303)), infsup (-1.187397361107265868e-112, -2.668312821848315349e-303))); %!test %! assert (isequal (asin (infsup (-1.263586867414290315e-101, -2.961257846195185529e-240)), infsup (-1.263586867414290474e-101, -2.961257846195185529e-240))); %!test %! assert (isequal (asin (infsup (-3.901714394731276617e-270, -3.330134658353580222e-294)), infsup (-3.901714394731277458e-270, -3.330134658353580222e-294))); %!test %! assert (isequal (asin (infsup (-2.366650777764918445e-246, 1.071483042175132919e-285)), infsup (-2.366650777764918953e-246, 1.071483042175133106e-285))); %!test %! assert (isequal (asin (infsup (-4.636590066075016366e-69, 5.524052139366596165e-240)), infsup (-4.636590066075017395e-69, 5.524052139366597231e-240))); %!test %! assert (isequal (asin (infsup (1.178822725995249352e-253, 3.080763910515160059e-167)), infsup (1.178822725995249352e-253, 3.080763910515160435e-167))); %!test %! assert (isequal (asin (infsup (-1.102346734829299702e-19, 6.850446591467340374e-81)), infsup (-1.102346734829299943e-19, 6.850446591467341310e-81))); %!test %! assert (isequal (asin (infsup (-3.809307924483539467e-117, 2.162545233549648523e-70)), infsup (-3.809307924483540172e-117, 2.162545233549648845e-70))); %!test %! assert (isequal (asin (infsup (-3.325515536019971910e-77, -2.504008447335657004e-137)), infsup (-3.325515536019972294e-77, -2.504008447335657004e-137))); %!test %! assert (isequal (asin (infsup (-1.559805661433223275e-242, 7.909368633706727513e-07)), infsup (-1.559805661433223483e-242, 7.909368633707552311e-07))); %!test %! assert (isequal (asin (infsup (-5.969914231928147727e-104, -6.050096414444652455e-262)), infsup (-5.969914231928148967e-104, -6.050096414444652455e-262))); %!test %! assert (isequal (asin (infsup (-1.312550047541150255e-20, -6.354261176220087715e-253)), infsup (-1.312550047541150406e-20, -6.354261176220087715e-253))); %!test %! assert (isequal (asin (infsup (4.567490786574823890e-149, 4.198196690886986340e-123)), infsup (4.567490786574823890e-149, 4.198196690886987012e-123))); %!test %! assert (isequal (asin (infsup (-9.884682253430382309e-92, -5.579479013164953220e-154)), infsup (-9.884682253430383672e-92, -5.579479013164953220e-154))); %!test %! assert (isequal (asin (infsup (-1.522662321416928111e-13, 2.644958365616577639e-170)), infsup (-1.522662321416928363e-13, 2.644958365616578006e-170))); %!test %! assert (isequal (asin (infsup (-8.948553501584778180e-99, 2.114326410545258721e-257)), infsup (-8.948553501584779804e-99, 2.114326410545259090e-257))); %!test %! assert (isequal (asin (infsup (-9.422591232382868792e-70, -6.531943700592087501e-157)), infsup (-9.422591232382870079e-70, -6.531943700592087501e-157))); %!test %! assert (isequal (asin (infsup (-4.183491534989001599e-145, 7.226922481530353777e-207)), infsup (-4.183491534989002310e-145, 7.226922481530355161e-207))); %!test %! assert (isequal (asin (infsup (-1.261760095202863281e-243, 1.140396740717171993e-231)), infsup (-1.261760095202863541e-243, 1.140396740717172136e-231))); %!test %! assert (isequal (asin (infsup (-6.921640701718756344e-64, -1.404179941832861768e-165)), infsup (-6.921640701718757694e-64, -1.404179941832861768e-165))); %!test %! assert (isequal (asin (infsup (-7.429895589392232365e-75, -7.756983358701570246e-275)), infsup (-7.429895589392233347e-75, -7.756983358701570246e-275))); %!test %! assert (isequal (asin (infsup (6.867158476684655683e-209, 1.563441271274809437e-199)), infsup (6.867158476684655683e-209, 1.563441271274809669e-199))); %!test %! assert (isequal (asin (infsup (-9.032911858299409062e-169, 3.060735534879519294e-91)), infsup (-9.032911858299410238e-169, 3.060735534879519839e-91))); %!test %! assert (isequal (asin (infsup (-5.007253407091102708e-155, 2.431811725358315428e-307)), infsup (-5.007253407091103536e-155, 2.431811725358315824e-307))); %!test %! assert (isequal (acos (infsup (-1.312389047028587488e-49, -2.435356662074063942e-204)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-2.826769732140076133e-84, -5.561386920473982459e-193)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-1.165983769138532228e-88, -1.428974577546032222e-230)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-9.442195953730013721e-285, -2.740460328962132443e-294)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (2.046759423140378801e-219, 9.256656556116300803e-185)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-3.808509373683396527e-193, 7.757841386304002834e-162)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-1.187397361107265637e-112, -2.668312821848315349e-303)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-1.263586867414290315e-101, -2.961257846195185529e-240)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-3.901714394731276617e-270, -3.330134658353580222e-294)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-2.366650777764918445e-246, 1.071483042175132919e-285)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-4.636590066075016366e-69, 5.524052139366596165e-240)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (1.178822725995249352e-253, 3.080763910515160059e-167)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-1.102346734829299702e-19, 6.850446591467340374e-81)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-3.809307924483539467e-117, 2.162545233549648523e-70)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-3.325515536019971910e-77, -2.504008447335657004e-137)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-1.559805661433223275e-242, 7.909368633706727513e-07)), infsup (1.570795535858033221e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-5.969914231928147727e-104, -6.050096414444652455e-262)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-1.312550047541150255e-20, -6.354261176220087715e-253)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (4.567490786574823890e-149, 4.198196690886986340e-123)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-9.884682253430382309e-92, -5.579479013164953220e-154)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-1.522662321416928111e-13, 2.644958365616577639e-170)), infsup (1.570796326794896558e+00, 1.570796326795049103e+00))); %!test %! assert (isequal (acos (infsup (-8.948553501584778180e-99, 2.114326410545258721e-257)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-9.422591232382868792e-70, -6.531943700592087501e-157)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-4.183491534989001599e-145, 7.226922481530353777e-207)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-1.261760095202863281e-243, 1.140396740717171993e-231)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-6.921640701718756344e-64, -1.404179941832861768e-165)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-7.429895589392232365e-75, -7.756983358701570246e-275)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (6.867158476684655683e-209, 1.563441271274809437e-199)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-9.032911858299409062e-169, 3.060735534879519294e-91)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-5.007253407091102708e-155, 2.431811725358315428e-307)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (2.142051668986572426e-70, 1.306882282121512488e+34)), infsup (2.142051668986572104e-70, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (4.502612523763230139e-153, 3.574174482995173238e-66)), infsup (4.502612523763229609e-153, 3.574174482995173238e-66))); %!test %! assert (isequal (atan (infsup (5.495270555084999106e-61, 1.977283881120209920e+82)), infsup (5.495270555084998415e-61, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (1.090326174415294200e-137, 6.394132238750145602e-126)), infsup (1.090326174415293961e-137, 6.394132238750145602e-126))); %!test %! assert (isequal (atan (infsup (9.619256544849800952e+75, 1.976936481141943109e+88)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (1.226586363793985335e+00, 4.308666602899711518e+100)), infsup (8.868130567036106582e-01, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (7.928935505948560140e-133, 7.949640211843924994e+71)), infsup (7.928935505948558576e-133, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (3.876504952447015518e-104, 3.784447147395508652e+52)), infsup (3.876504952447014898e-104, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (1.735629038886541013e-227, 2.524795598203051262e-87)), infsup (1.735629038886540779e-227, 2.524795598203051262e-87))); %!test %! assert (isequal (atan (infsup (1.237297234801419434e-169, 5.840571936196232559e-23)), infsup (1.237297234801419286e-169, 5.840571936196232559e-23))); %!test %! assert (isequal (atan (infsup (2.646062262797938974e+54, 1.619260330717682242e+94)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (8.586668885039760719e-15, 3.330274496326268835e+77)), infsup (8.586668885039759141e-15, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (2.089478911258004246e+03, 2.654076110524515271e+197)), infsup (1.570317738608022262e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (9.185646314148092500e+14, 3.404186753017747637e+207)), infsup (1.570796326794895448e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (1.042970653496689987e-51, 3.786643969857242382e+02)), infsup (1.042970653496689839e-51, 1.568155472034706621e+00))); %!test %! assert (isequal (atan (infsup (1.159254403776913034e-163, 6.699078654119896870e+297)), infsup (1.159254403776912880e-163, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (9.621666972390800389e-133, 7.532163773886162862e-45)), infsup (9.621666972390798825e-133, 7.532163773886162862e-45))); %!test %! assert (isequal (atan (infsup (9.139956432627538486e-154, 1.485368733580681843e+106)), infsup (9.139956432627537161e-154, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (2.515545250733326100e+57, 1.476165379292337505e+72)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (5.894957732633465837e-95, 1.230428274874167409e-71)), infsup (5.894957732633465172e-95, 1.230428274874167409e-71))); %!test %! assert (isequal (atan (infsup (5.641992385637192390e+128, 7.041426524450171694e+170)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (8.878766165166293762e-17, 1.376904412228828177e+51)), infsup (8.878766165166292529e-17, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (1.442483959041155224e-103, 3.440680160407877302e-20)), infsup (1.442483959041154976e-103, 3.440680160407877302e-20))); %!test %! assert (isequal (atan (infsup (5.626945812397601245e-71, 7.528651283167650945e+03)), infsup (5.626945812397600441e-71, 1.570663500880067120e+00))); %!test %! assert (isequal (atan (infsup (6.144581905264969684e-145, 8.697059728957016802e+39)), infsup (6.144581905264968972e-145, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (1.163046489009897174e-57, 2.952069202447659552e+66)), infsup (1.163046489009897032e-57, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (7.340119470601840050e-203, 4.997184174270236677e-42)), infsup (7.340119470601838917e-203, 4.997184174270236677e-42))); %!test %! assert (isequal (atan (infsup (1.318816730766393217e+76, 3.808490005836893230e+98)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (1.061757227068338186e-97, 1.845313858239065767e+196)), infsup (1.061757227068338056e-97, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (7.269525029365293208e-38, 4.488799649180782136e-36)), infsup (7.269525029365292164e-38, 4.488799649180782136e-36))); %!test %! assert (isequal (sinh (infsup (-2.276825735402380789e-48, -1.247591758624133168e-288)), infsup (-2.276825735402381093e-48, -1.247591758624133168e-288))); %!test %! assert (isequal (sinh (infsup (-1.555899708023971053e-136, -2.066488754605661877e-191)), infsup (-1.555899708023971244e-136, -2.066488754605661877e-191))); %!test %! assert (isequal (sinh (infsup (-1.013218050883979648e+00, -8.114288896805143833e-293)), infsup (-1.195700971165398974e+00, -8.114288896805143833e-293))); %!test %! assert (isequal (sinh (infsup (-5.223236923356957882e-115, 2.450356733437761473e-182)), infsup (-5.223236923356958784e-115, 2.450356733437761807e-182))); %!test %! assert (isequal (sinh (infsup (-4.510932062945640269e-111, -9.719284552905501027e-172)), infsup (-4.510932062945641008e-111, -9.719284552905501027e-172))); %!test %! assert (isequal (sinh (infsup (-5.243225148031154877e-101, -2.926946402493516021e-125)), infsup (-5.243225148031155512e-101, -2.926946402493516021e-125))); %!test %! assert (isequal (sinh (infsup (-3.572423176829176112e-14, -6.433836389930062741e-244)), infsup (-3.572423176829176744e-14, -6.433836389930062741e-244))); %!test %! assert (isequal (sinh (infsup (-2.694213038264476014e-63, -7.562777816273446350e-67)), infsup (-2.694213038264476553e-63, -7.562777816273446350e-67))); %!test %! assert (isequal (sinh (infsup (1.088038949658882158e-80, 1.955415113914635483e-29)), infsup (1.088038949658882158e-80, 1.955415113914635764e-29))); %!test %! assert (isequal (sinh (infsup (-7.367961367144991472e-116, -3.479600132086108765e-281)), infsup (-7.367961367144992599e-116, -3.479600132086108765e-281))); %!test %! assert (isequal (sinh (infsup (-8.240014447403598921e-179, 4.244031804302998196e-06)), infsup (-8.240014447403600291e-179, 4.244031804315739266e-06))); %!test %! assert (isequal (sinh (infsup (-4.940835347719680012e-103, -3.209929124440609153e-180)), infsup (-4.940835347719681003e-103, -3.209929124440609153e-180))); %!test %! assert (isequal (sinh (infsup (-1.085358240794141589e-286, 3.362095038805252608e-121)), infsup (-1.085358240794141823e-286, 3.362095038805253038e-121))); %!test %! assert (isequal (sinh (infsup (-2.773142512496348467e-152, 5.052868105777038456e-09)), infsup (-2.773142512496348891e-152, 5.052868105777039283e-09))); %!test %! assert (isequal (sinh (infsup (-1.515739064210033408e-96, -4.584256552639734730e-257)), infsup (-1.515739064210033616e-96, -4.584256552639734730e-257))); %!test %! assert (isequal (sinh (infsup (-5.745505217333493514e-155, -4.839121225948962742e-233)), infsup (-5.745505217333494342e-155, -4.839121225948962742e-233))); %!test %! assert (isequal (sinh (infsup (-5.901539399340708264e-177, -4.071613085569532874e-241)), infsup (-5.901539399340709140e-177, -4.071613085569532874e-241))); %!test %! assert (isequal (sinh (infsup (-2.800078795581776764e-165, 3.959032834373606979e-236)), infsup (-2.800078795581777246e-165, 3.959032834373607852e-236))); %!test %! assert (isequal (sinh (infsup (-5.299801768007807772e-20, 2.412268889562441467e-206)), infsup (-5.299801768007808374e-20, 2.412268889562441744e-206))); %!test %! assert (isequal (sinh (infsup (-4.504594176548485258e-37, -1.093025376211848040e-167)), infsup (-4.504594176548486093e-37, -1.093025376211848040e-167))); %!test %! assert (isequal (sinh (infsup (-1.148387419014246691e-274, -5.607529106307211921e-306)), infsup (-1.148387419014246819e-274, -5.607529106307211921e-306))); %!test %! assert (isequal (sinh (infsup (-8.179611867336581810e-53, 3.261973107060699204e-227)), infsup (-8.179611867336582738e-53, 3.261973107060699673e-227))); %!test %! assert (isequal (sinh (infsup (-5.612415357146817830e-236, -1.379963883993877056e-283)), infsup (-5.612415357146818703e-236, -1.379963883993877056e-283))); %!test %! assert (isequal (sinh (infsup (6.353125060297895407e-217, 1.401675477619655357e-13)), infsup (6.353125060297895407e-217, 1.401675477619655609e-13))); %!test %! assert (isequal (sinh (infsup (-5.247726734531364136e-115, 1.461755126469774210e-238)), infsup (-5.247726734531365037e-115, 1.461755126469774380e-238))); %!test %! assert (isequal (sinh (infsup (-1.600607820612694866e-27, -1.050621484395105629e-166)), infsup (-1.600607820612695045e-27, -1.050621484395105629e-166))); %!test %! assert (isequal (sinh (infsup (-1.052337857345041679e-89, -1.584198096209285781e-155)), infsup (-1.052337857345041853e-89, -1.584198096209285781e-155))); %!test %! assert (isequal (sinh (infsup (-2.798033560470428915e-102, -9.926975697028544915e-270)), infsup (-2.798033560470429312e-102, -9.926975697028544915e-270))); %!test %! assert (isequal (sinh (infsup (-1.807789234464845648e-80, 1.364469289790188620e-184)), infsup (-1.807789234464846022e-80, 1.364469289790188881e-184))); %!test %! assert (isequal (sinh (infsup (-1.581262363552952774e-73, -1.558035095719158102e-130)), infsup (-1.581262363552953088e-73, -1.558035095719158102e-130))); %!test %! assert (isequal (cosh (infsup (-2.276825735402380789e-48, -1.247591758624133168e-288)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-1.555899708023971053e-136, -2.066488754605661877e-191)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-1.013218050883979648e+00, -8.114288896805143833e-293)), infsup (1.000000000000000000e+00, 1.558749759405235080e+00))); %!test %! assert (isequal (cosh (infsup (-5.223236923356957882e-115, 2.450356733437761473e-182)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-4.510932062945640269e-111, -9.719284552905501027e-172)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-5.243225148031154877e-101, -2.926946402493516021e-125)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-3.572423176829176112e-14, -6.433836389930062741e-244)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-2.694213038264476014e-63, -7.562777816273446350e-67)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (1.088038949658882158e-80, 1.955415113914635483e-29)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-7.367961367144991472e-116, -3.479600132086108765e-281)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-8.240014447403598921e-179, 4.244031804302998196e-06)), infsup (1.000000000000000000e+00, 1.000000000009005907e+00))); %!test %! assert (isequal (cosh (infsup (-4.940835347719680012e-103, -3.209929124440609153e-180)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-1.085358240794141589e-286, 3.362095038805252608e-121)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-2.773142512496348467e-152, 5.052868105777038456e-09)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-1.515739064210033408e-96, -4.584256552639734730e-257)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-5.745505217333493514e-155, -4.839121225948962742e-233)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-5.901539399340708264e-177, -4.071613085569532874e-241)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-2.800078795581776764e-165, 3.959032834373606979e-236)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-5.299801768007807772e-20, 2.412268889562441467e-206)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-4.504594176548485258e-37, -1.093025376211848040e-167)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-1.148387419014246691e-274, -5.607529106307211921e-306)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-8.179611867336581810e-53, 3.261973107060699204e-227)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-5.612415357146817830e-236, -1.379963883993877056e-283)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (6.353125060297895407e-217, 1.401675477619655357e-13)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-5.247726734531364136e-115, 1.461755126469774210e-238)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-1.600607820612694866e-27, -1.050621484395105629e-166)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-1.052337857345041679e-89, -1.584198096209285781e-155)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-2.798033560470428915e-102, -9.926975697028544915e-270)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-1.807789234464845648e-80, 1.364469289790188620e-184)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (cosh (infsup (-1.581262363552952774e-73, -1.558035095719158102e-130)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (tanh (infsup (2.142051668986572426e-70, 1.306882282121512488e+34)), infsup (2.142051668986572104e-70, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (4.502612523763230139e-153, 3.574174482995173238e-66)), infsup (4.502612523763229609e-153, 3.574174482995173238e-66))); %!test %! assert (isequal (tanh (infsup (5.495270555084999106e-61, 1.977283881120209920e+82)), infsup (5.495270555084998415e-61, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (1.090326174415294200e-137, 6.394132238750145602e-126)), infsup (1.090326174415293961e-137, 6.394132238750145602e-126))); %!test %! assert (isequal (tanh (infsup (9.619256544849800952e+75, 1.976936481141943109e+88)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (1.226586363793985335e+00, 4.308666602899711518e+100)), infsup (8.415863137654880921e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (7.928935505948560140e-133, 7.949640211843924994e+71)), infsup (7.928935505948558576e-133, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (3.876504952447015518e-104, 3.784447147395508652e+52)), infsup (3.876504952447014898e-104, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (1.735629038886541013e-227, 2.524795598203051262e-87)), infsup (1.735629038886540779e-227, 2.524795598203051262e-87))); %!test %! assert (isequal (tanh (infsup (1.237297234801419434e-169, 5.840571936196232559e-23)), infsup (1.237297234801419286e-169, 5.840571936196232559e-23))); %!test %! assert (isequal (tanh (infsup (2.646062262797938974e+54, 1.619260330717682242e+94)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (8.586668885039760719e-15, 3.330274496326268835e+77)), infsup (8.586668885039759141e-15, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (2.089478911258004246e+03, 2.654076110524515271e+197)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (9.185646314148092500e+14, 3.404186753017747637e+207)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (1.042970653496689987e-51, 3.786643969857242382e+02)), infsup (1.042970653496689839e-51, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (1.159254403776913034e-163, 6.699078654119896870e+297)), infsup (1.159254403776912880e-163, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (9.621666972390800389e-133, 7.532163773886162862e-45)), infsup (9.621666972390798825e-133, 7.532163773886162862e-45))); %!test %! assert (isequal (tanh (infsup (9.139956432627538486e-154, 1.485368733580681843e+106)), infsup (9.139956432627537161e-154, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (2.515545250733326100e+57, 1.476165379292337505e+72)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (5.894957732633465837e-95, 1.230428274874167409e-71)), infsup (5.894957732633465172e-95, 1.230428274874167409e-71))); %!test %! assert (isequal (tanh (infsup (5.641992385637192390e+128, 7.041426524450171694e+170)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (8.878766165166293762e-17, 1.376904412228828177e+51)), infsup (8.878766165166292529e-17, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (1.442483959041155224e-103, 3.440680160407877302e-20)), infsup (1.442483959041154976e-103, 3.440680160407877302e-20))); %!test %! assert (isequal (tanh (infsup (5.626945812397601245e-71, 7.528651283167650945e+03)), infsup (5.626945812397600441e-71, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (6.144581905264969684e-145, 8.697059728957016802e+39)), infsup (6.144581905264968972e-145, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (1.163046489009897174e-57, 2.952069202447659552e+66)), infsup (1.163046489009897032e-57, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (7.340119470601840050e-203, 4.997184174270236677e-42)), infsup (7.340119470601838917e-203, 4.997184174270236677e-42))); %!test %! assert (isequal (tanh (infsup (1.318816730766393217e+76, 3.808490005836893230e+98)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (1.061757227068338186e-97, 1.845313858239065767e+196)), infsup (1.061757227068338056e-97, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (7.269525029365293208e-38, 4.488799649180782136e-36)), infsup (7.269525029365292164e-38, 4.488799649180782136e-36))); %!test %! assert (isequal (coth (infsup (1.894295696760237533e-79, 1.950216651182638040e+28)), infsup (1.000000000000000000e+00, 5.279006871579093604e+78))); %!test %! assert (isequal (coth (infsup (-1.950216651182638040e+28, -1.894295696760237533e-79)), infsup (-5.279006871579093604e+78, -1.000000000000000000e+00))); %!test %! assert (isequal (coth (infsup (3.320841342139927716e-156, 6.424290443627079857e-68)), infsup (1.556592138501464494e+67, 3.011285084025142904e+155))); %!test %! assert (isequal (coth (infsup (-6.424290443627079857e-68, -3.320841342139927716e-156)), infsup (-3.011285084025142904e+155, -1.556592138501464494e+67))); %!test %! assert (isequal (coth (infsup (2.751499933051732237e-72, 9.408527432646626663e+70)), infsup (1.000000000000000000e+00, 3.634381335022909468e+71))); %!test %! assert (isequal (coth (infsup (-9.408527432646626663e+70, -2.751499933051732237e-72)), infsup (-3.634381335022909468e+71, -1.000000000000000000e+00))); %!test %! assert (isequal (coth (infsup (3.517997538706998525e-148, 1.497328258663174781e-136)), infsup (6.678562260574758313e+135, 2.842526150167629525e+147))); %!test %! assert (isequal (coth (infsup (-1.497328258663174781e-136, -3.517997538706998525e-148)), infsup (-2.842526150167629525e+147, -6.678562260574758313e+135))); %!test %! assert (isequal (coth (infsup (9.905525909214206329e+58, 2.225938119842340464e+68)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (coth (infsup (-2.225938119842340464e+68, -9.905525909214206329e+58)), infsup (-1.000000000000000222e+00, -1.000000000000000000e+00))); %!test %! assert (isequal (coth (infsup (2.239285535837240642e-13, 3.477625899530847479e+83)), infsup (1.000000000000000000e+00, 4.465710084739652344e+12))); %!test %! assert (isequal (coth (infsup (-3.477625899530847479e+83, -2.239285535837240642e-13)), infsup (-4.465710084739652344e+12, -1.000000000000000000e+00))); %!test %! assert (isequal (coth (infsup (3.415418494751353181e-144, 5.233267885617046715e+59)), infsup (1.000000000000000000e+00, 2.927898884241420862e+143))); %!test %! assert (isequal (coth (infsup (-5.233267885617046715e+59, -3.415418494751353181e-144)), infsup (-2.927898884241420862e+143, -1.000000000000000000e+00))); %!test %! assert (isequal (coth (infsup (2.475241261380885882e-113, 2.034195705081105309e+42)), infsup (1.000000000000000000e+00, 4.040010222850441763e+112))); %!test %! assert (isequal (coth (infsup (-2.034195705081105309e+42, -2.475241261380885882e-113)), infsup (-4.040010222850441763e+112, -1.000000000000000000e+00))); %!test %! assert (isequal (coth (infsup (2.549437728230459203e-232, 1.836840579504975127e-99)), infsup (5.444130596622043095e+98, 3.922433519072814253e+231))); %!test %! assert (isequal (coth (infsup (-1.836840579504975127e-99, -2.549437728230459203e-232)), infsup (-3.922433519072814253e+231, -5.444130596622043095e+98))); %!test %! assert (isequal (coth (infsup (4.325945854917056393e-175, 3.934256418924328452e-40)), infsup (2.541776370217911761e+39, 2.311633186216043598e+174))); %!test %! assert (isequal (coth (infsup (-3.934256418924328452e-40, -4.325945854917056393e-175)), infsup (-2.311633186216043598e+174, -2.541776370217911761e+39))); %!test %! assert (isequal (coth (infsup (2.036990759412397446e+35, 2.361435323577135193e+83)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (coth (infsup (-2.361435323577135193e+83, -2.036990759412397446e+35)), infsup (-1.000000000000000222e+00, -1.000000000000000000e+00))); %!test %! assert (isequal (coth (infsup (1.859092626033397846e-30, 3.496514376215051672e+61)), infsup (1.000000000000000000e+00, 5.378968137448980910e+29))); %!test %! assert (isequal (coth (infsup (-3.496514376215051672e+61, -1.859092626033397846e-30)), infsup (-5.378968137448980910e+29, -1.000000000000000000e+00))); %!test %! assert (isequal (coth (infsup (2.090285002199718534e+01, 2.207982549862724136e+179)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (coth (infsup (-2.207982549862724136e+179, -2.090285002199718534e+01)), infsup (-1.000000000000000222e+00, -1.000000000000000000e+00))); %!test %! assert (isequal (coth (infsup (1.208755205351178767e+06, 3.006650875502725685e+189)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (coth (infsup (-3.006650875502725685e+189, -1.208755205351178767e+06)), infsup (-1.000000000000000222e+00, -1.000000000000000000e+00))); %!test %! assert (isequal (coth (infsup (6.431982815787139811e-54, 1.599583732850823968e-07)), infsup (6.251626466704432853e+06, 1.554730521893692440e+53))); %!test %! assert (isequal (coth (infsup (-1.599583732850823968e-07, -6.431982815787139811e-54)), infsup (-1.554730521893692440e+53, -6.251626466704432853e+06))); %!test %! assert (isequal (asinh (infsup (2.142051668986572426e-70, 1.306882282121512488e+34)), infsup (2.142051668986572104e-70, 7.924868470570649492e+01))); %!test %! assert (isequal (asinh (infsup (4.502612523763230139e-153, 3.574174482995173238e-66)), infsup (4.502612523763229609e-153, 3.574174482995173238e-66))); %!test %! assert (isequal (asinh (infsup (5.495270555084999106e-61, 1.977283881120209920e+82)), infsup (5.495270555084998415e-61, 1.901868489318184174e+02))); %!test %! assert (isequal (asinh (infsup (1.090326174415294200e-137, 6.394132238750145602e-126)), infsup (1.090326174415293961e-137, 6.394132238750145602e-126))); %!test %! assert (isequal (asinh (infsup (9.619256544849800952e+75, 1.976936481141943109e+88)), infsup (1.756507961345643878e+02, 2.040021837787967911e+02))); %!test %! assert (isequal (asinh (infsup (1.226586363793985335e+00, 4.308666602899711518e+100)), infsup (1.032882671369447447e+00, 2.324122849633374130e+02))); %!test %! assert (isequal (asinh (infsup (7.928935505948560140e-133, 7.949640211843924994e+71)), infsup (7.928935505948558576e-133, 1.662498154544074964e+02))); %!test %! assert (isequal (asinh (infsup (3.876504952447015518e-104, 3.784447147395508652e+52)), infsup (3.876504952447014898e-104, 1.217584718283750362e+02))); %!test %! assert (isequal (asinh (infsup (1.735629038886541013e-227, 2.524795598203051262e-87)), infsup (1.735629038886540779e-227, 2.524795598203051262e-87))); %!test %! assert (isequal (asinh (infsup (1.237297234801419434e-169, 5.840571936196232559e-23)), infsup (1.237297234801419286e-169, 5.840571936196232559e-23))); %!test %! assert (isequal (asinh (infsup (2.646062262797938974e+54, 1.619260330717682242e+94)), infsup (1.260058147985681245e+02, 2.176181153810006776e+02))); %!test %! assert (isequal (asinh (infsup (8.586668885039760719e-15, 3.330274496326268835e+77)), infsup (8.586668885039759141e-15, 1.791952540730257510e+02))); %!#asinh [0X8.297A99ED9ED08P+8, 0XE.33C49CF5B8790P+652] = [0X8.567B3095B8380P+0, 0X1.C7474C3E00682P+8]; %!#asinh [0X3.436DFE8F08194P+48, 0X2.A69A969772FDEP+688] = [0X2.325A084AF897EP+4, 0X1.DE8DA2F064858P+8]; %!test %! assert (isequal (asinh (infsup (1.042970653496689987e-51, 3.786643969857242382e+02)), infsup (1.042970653496689839e-51, 6.629799240811253824e+00))); %!test %! assert (isequal (asinh (infsup (1.159254403776913034e-163, 6.699078654119896870e+297)), infsup (1.159254403776912880e-163, 6.864628898024220689e+02))); %!test %! assert (isequal (asinh (infsup (9.621666972390800389e-133, 7.532163773886162862e-45)), infsup (9.621666972390798825e-133, 7.532163773886162862e-45))); %!test %! assert (isequal (asinh (infsup (9.139956432627538486e-154, 1.485368733580681843e+106)), infsup (9.139956432627537161e-154, 2.451628300848022946e+02))); %!test %! assert (isequal (asinh (infsup (2.515545250733326100e+57, 1.476165379292337505e+72)), infsup (1.328629870607709620e+02, 1.668687216416238925e+02))); %!test %! assert (isequal (asinh (infsup (5.894957732633465837e-95, 1.230428274874167409e-71)), infsup (5.894957732633465172e-95, 1.230428274874167409e-71))); %!#asinh [0XD.05E9CCF66CF58P+424, 0XB.A944253373080P+564] = [0X1.29277EA798036P+8, 0X1.8A159CCBD552AP+8]; %!test %! assert (isequal (asinh (infsup (8.878766165166293762e-17, 1.376904412228828177e+51)), infsup (8.878766165166292529e-17, 1.184448247231850360e+02))); %!test %! assert (isequal (asinh (infsup (1.442483959041155224e-103, 3.440680160407877302e-20)), infsup (1.442483959041154976e-103, 3.440680160407877302e-20))); %!test %! assert (isequal (asinh (infsup (5.626945812397601245e-71, 7.528651283167650945e+03)), infsup (5.626945812397600441e-71, 9.619618377260879427e+00))); %!test %! assert (isequal (asinh (infsup (6.144581905264969684e-145, 8.697059728957016802e+39)), infsup (6.144581905264968972e-145, 9.265695081367732655e+01))); %!test %! assert (isequal (asinh (infsup (1.163046489009897174e-57, 2.952069202447659552e+66)), infsup (1.163046489009897032e-57, 1.537462696671939852e+02))); %!test %! assert (isequal (asinh (infsup (7.340119470601840050e-203, 4.997184174270236677e-42)), infsup (7.340119470601838917e-203, 4.997184174270236677e-42))); %!test %! assert (isequal (asinh (infsup (1.318816730766393217e+76, 3.808490005836893230e+98)), infsup (1.759663491665984338e+02, 2.276837190806306239e+02))); %!#asinh [0X3.A0EE84451C92CP-324, 0XF.CC937FA330E40P+648] = [0X3.A0EE84451C92AP-324, 0X1.C49CCB25BBD50P+8]; %!test %! assert (isequal (asinh (infsup (7.269525029365293208e-38, 4.488799649180782136e-36)), infsup (7.269525029365292164e-38, 4.488799649180782136e-36))); %!test %! assert (isequal (acosh (infsup (4.308689365264194681e+82, 1.870190767041050574e+259)), infsup (1.909657585723560658e+02, 5.976887267061416651e+02))); %!test %! assert (isequal (acosh (infsup (1.663490370649616415e+104, 1.013015541347756766e+134)), infsup (2.406709148797917237e+02, 3.092524812088139470e+02))); %!test %! assert (isequal (acosh (infsup (4.740352466070305280e+17, 3.416343854883929839e+224)), infsup (4.139320525433158338e+01, 5.177007789421815005e+02))); %!test %! assert (isequal (acosh (infsup (5.649987645498339448e+39, 4.009451878894758553e+115)), infsup (9.222561916584621144e+01, 2.668790874182960238e+02))); %!test %! assert (isequal (acosh (infsup (8.616687911287559235e+77, 5.944690784478971107e+169)), infsup (1.801459001189113280e+02, 3.916125264126404204e+02))); %!test %! assert (isequal (acosh (infsup (1.337707751915661292e+170, 1.380110451090683299e+220)), infsup (3.924235705058085273e+02, 5.075840311722385536e+02))); %!test %! assert (isequal (acosh (infsup (1.220751226792469375e+14, 7.832127768107454054e+156)), infsup (3.312880491138550809e+01, 3.619546559063252289e+02))); %!test %! assert (isequal (acosh (infsup (4.401102955082982275e+23, 1.287462777714444441e+159)), infsup (5.513445950054409650e+01, 3.670568504092379953e+02))); %!test %! assert (isequal (acosh (infsup (1.301393744352418326e+89, 2.720259598242152528e+307)), infsup (2.058866562582371955e+02, 7.085874980460159804e+02))); %!test %! assert (isequal (acosh (infsup (6.939444977341106986e+123, 1.984966170027903415e+260)), infsup (2.858483354157015697e+02, 6.000508732301987038e+02))); %!test %! assert (isequal (acosh (infsup (6.485225963939702296e+146, 9.590094226342687312e+261)), infsup (3.387400974189444014e+02, 6.039285871663319085e+02))); %!test %! assert (isequal (acosh (infsup (2.743579466422469183e+115, 4.645309981121623107e+192)), infsup (2.664996963173169888e+02, 4.443253431398200632e+02))); %!test %! assert (isequal (acosh (infsup (6.315691036069834079e+183, 1.254000664372473335e+196)), infsup (4.239092563760087842e+02, 4.522261643794061001e+02))); %!test %! assert (isequal (acosh (infsup (1.138781729534858459e+05, 6.522252952647259925e+170)), infsup (1.233603167819211954e+01, 3.940078328506839398e+02))); %!test %! assert (isequal (acosh (infsup (1.705317527179950542e+68, 1.807502842596086102e+136)), infsup (1.578026848305014198e+02, 3.144366660754669738e+02))); %!test %! assert (isequal (acosh (infsup (2.320700483702952407e+153, 1.406262907030544946e+207)), infsup (3.538305354813851977e+02, 4.776691971955887084e+02))); %!test %! assert (isequal (acosh (infsup (1.484021313157366875e+14, 6.690353456676457891e+66)), infsup (3.332409398908451692e+01, 1.545644300244953797e+02))); %!test %! assert (isequal (acosh (infsup (1.949448535585448881e+38, 1.286062297009824876e+183)), infsup (8.885892724464935100e+01, 4.223178042655773083e+02))); %!test %! assert (isequal (acosh (infsup (1.323970487459108229e+62, 5.603597588316931976e+76)), infsup (1.437340581130183921e+02, 1.774130230660661312e+02))); %!test %! assert (isequal (acosh (infsup (4.971908888084823723e+22, 1.705737433846073186e+263)), infsup (5.295382307490645246e+01, 6.068070241677426111e+02))); %!test %! assert (isequal (acosh (infsup (3.185265905903948048e+68, 1.396714687103404512e+294)), infsup (1.584274692766343264e+02, 6.779872873476585937e+02))); %!test %! assert (isequal (acosh (infsup (2.419365169286764294e+162, 6.023839510485900011e+239)), infsup (3.745954374246092016e+02, 5.528067092545940113e+02))); %!test %! assert (isequal (acosh (infsup (6.369713416360370450e+54, 1.746916684461024567e+239)), infsup (1.268842966812280508e+02, 5.515688367455168191e+02))); %!test %! assert (isequal (acosh (infsup (2.510121874915821578e+141, 1.760590294900778378e+244)), infsup (3.262779766004285875e+02, 5.630895590187549260e+02))); %!test %! assert (isequal (acosh (infsup (8.413476455681521536e+227, 4.905680962443388553e+277)), infsup (5.255097980504410771e+02, 6.400996118535556434e+02))); %!test %! assert (isequal (acosh (infsup (5.329335402634341777e+21, 1.810944547265758752e+289)), infsup (5.072066067390094446e+01, 6.667340876143190371e+02))); %!test %! assert (isequal (acosh (infsup (2.791850949318598675e+238, 1.892476551972181292e+277)), infsup (5.497351041117033219e+02, 6.391471042561882996e+02))); %!test %! assert (isequal (acosh (infsup (1.811273674489520570e+131, 3.937972452864056384e+191)), infsup (3.029258246481488754e+02, 4.418575659274054033e+02))); %!test %! assert (isequal (acosh (infsup (1.297701720686003170e+139, 2.351832189572987335e+171)), infsup (3.210130698994429395e+02, 3.952903927620620834e+02))); %!test %! assert (isequal (acosh (infsup (1.177543487203761135e+25, 4.156461555557113578e+231)), infsup (5.842120498344542057e+01, 5.340149677868963636e+02))); %!test %! assert (isequal (atanh (infsup (-1.312389047028587488e-49, -2.435356662074063942e-204)), infsup (-1.312389047028587678e-49, -2.435356662074063942e-204))); %!test %! assert (isequal (atanh (infsup (-2.826769732140076133e-84, -5.561386920473982459e-193)), infsup (-2.826769732140076591e-84, -5.561386920473982459e-193))); %!test %! assert (isequal (atanh (infsup (-1.165983769138532228e-88, -1.428974577546032222e-230)), infsup (-1.165983769138532367e-88, -1.428974577546032222e-230))); %!test %! assert (isequal (atanh (infsup (-9.442195953730013721e-285, -2.740460328962132443e-294)), infsup (-9.442195953730015214e-285, -2.740460328962132443e-294))); %!test %! assert (isequal (atanh (infsup (2.046759423140378801e-219, 9.256656556116300803e-185)), infsup (2.046759423140378801e-219, 9.256656556116302109e-185))); %!test %! assert (isequal (atanh (infsup (-3.808509373683396527e-193, 7.757841386304002834e-162)), infsup (-3.808509373683397013e-193, 7.757841386304003821e-162))); %!test %! assert (isequal (atanh (infsup (-1.187397361107265637e-112, -2.668312821848315349e-303)), infsup (-1.187397361107265868e-112, -2.668312821848315349e-303))); %!test %! assert (isequal (atanh (infsup (-1.263586867414290315e-101, -2.961257846195185529e-240)), infsup (-1.263586867414290474e-101, -2.961257846195185529e-240))); %!test %! assert (isequal (atanh (infsup (-3.901714394731276617e-270, -3.330134658353580222e-294)), infsup (-3.901714394731277458e-270, -3.330134658353580222e-294))); %!test %! assert (isequal (atanh (infsup (-2.366650777764918445e-246, 1.071483042175132919e-285)), infsup (-2.366650777764918953e-246, 1.071483042175133106e-285))); %!test %! assert (isequal (atanh (infsup (-4.636590066075016366e-69, 5.524052139366596165e-240)), infsup (-4.636590066075017395e-69, 5.524052139366597231e-240))); %!test %! assert (isequal (atanh (infsup (1.178822725995249352e-253, 3.080763910515160059e-167)), infsup (1.178822725995249352e-253, 3.080763910515160435e-167))); %!test %! assert (isequal (atanh (infsup (-1.102346734829299702e-19, 6.850446591467340374e-81)), infsup (-1.102346734829299943e-19, 6.850446591467341310e-81))); %!test %! assert (isequal (atanh (infsup (-3.809307924483539467e-117, 2.162545233549648523e-70)), infsup (-3.809307924483540172e-117, 2.162545233549648845e-70))); %!test %! assert (isequal (atanh (infsup (-3.325515536019971910e-77, -2.504008447335657004e-137)), infsup (-3.325515536019972294e-77, -2.504008447335657004e-137))); %!test %! assert (isequal (atanh (infsup (-1.559805661433223275e-242, 7.909368633706727513e-07)), infsup (-1.559805661433223483e-242, 7.909368633708377109e-07))); %!test %! assert (isequal (atanh (infsup (-5.969914231928147727e-104, -6.050096414444652455e-262)), infsup (-5.969914231928148967e-104, -6.050096414444652455e-262))); %!test %! assert (isequal (atanh (infsup (-1.312550047541150255e-20, -6.354261176220087715e-253)), infsup (-1.312550047541150406e-20, -6.354261176220087715e-253))); %!test %! assert (isequal (atanh (infsup (4.567490786574823890e-149, 4.198196690886986340e-123)), infsup (4.567490786574823890e-149, 4.198196690886987012e-123))); %!test %! assert (isequal (atanh (infsup (-9.884682253430382309e-92, -5.579479013164953220e-154)), infsup (-9.884682253430383672e-92, -5.579479013164953220e-154))); %!test %! assert (isequal (atanh (infsup (-1.522662321416928111e-13, 2.644958365616577639e-170)), infsup (-1.522662321416928363e-13, 2.644958365616578006e-170))); %!test %! assert (isequal (atanh (infsup (-8.948553501584778180e-99, 2.114326410545258721e-257)), infsup (-8.948553501584779804e-99, 2.114326410545259090e-257))); %!test %! assert (isequal (atanh (infsup (-9.422591232382868792e-70, -6.531943700592087501e-157)), infsup (-9.422591232382870079e-70, -6.531943700592087501e-157))); %!test %! assert (isequal (atanh (infsup (-4.183491534989001599e-145, 7.226922481530353777e-207)), infsup (-4.183491534989002310e-145, 7.226922481530355161e-207))); %!test %! assert (isequal (atanh (infsup (-1.261760095202863281e-243, 1.140396740717171993e-231)), infsup (-1.261760095202863541e-243, 1.140396740717172136e-231))); %!test %! assert (isequal (atanh (infsup (-6.921640701718756344e-64, -1.404179941832861768e-165)), infsup (-6.921640701718757694e-64, -1.404179941832861768e-165))); %!test %! assert (isequal (atanh (infsup (-7.429895589392232365e-75, -7.756983358701570246e-275)), infsup (-7.429895589392233347e-75, -7.756983358701570246e-275))); %!test %! assert (isequal (atanh (infsup (6.867158476684655683e-209, 1.563441271274809437e-199)), infsup (6.867158476684655683e-209, 1.563441271274809669e-199))); %!test %! assert (isequal (atanh (infsup (-9.032911858299409062e-169, 3.060735534879519294e-91)), infsup (-9.032911858299410238e-169, 3.060735534879519839e-91))); %!test %! assert (isequal (atanh (infsup (-5.007253407091102708e-155, 2.431811725358315428e-307)), infsup (-5.007253407091103536e-155, 2.431811725358315824e-307))); %!test %! assert (isequal (expm1 (infsup (-5.654676730021285758e+33, -2.467054147405823936e-70)), infsup (-1.000000000000000000e+00, -2.467054147405823614e-70))); %!test %! assert (isequal (expm1 (infsup (-1.339988487076310626e-66, -3.142176739251405931e-153)), infsup (-1.339988487076310626e-66, -3.142176739251405401e-153))); %!test %! assert (isequal (expm1 (infsup (-1.559745526584455293e+82, -8.494812002392629213e-61)), infsup (-1.000000000000000000e+00, -8.494812002392627831e-61))); %!test %! assert (isequal (expm1 (infsup (-1.215647583031333080e-125, -2.146363543986120533e-137)), infsup (-1.215647583031333080e-125, -2.146363543986120294e-137))); %!#expm1 [-0X6.FF424CB26239CP+292, -0X2.89F6682121BA8P+252] = [-0X1.0000000000000P+0, -0X1.0000000000000P+0]; %!test %! assert (isequal (expm1 (infsup (-7.439842988767636755e+100, -1.769170660676674389e+00)), infsup (-1.000000000000000000e+00, -8.295256887348699815e-01))); %!test %! assert (isequal (expm1 (infsup (-7.499234869798133827e+71, -1.740341118088671732e-132)), infsup (-1.000000000000000000e+00, -1.740341118088671419e-132))); %!test %! assert (isequal (expm1 (infsup (-2.932406654409041728e+52, -5.352481974657761661e-104)), infsup (-1.000000000000000000e+00, -5.352481974657761041e-104))); %!test %! assert (isequal (expm1 (infsup (-5.017847776764403958e-87, -2.227977792271395082e-227)), infsup (-5.017847776764403958e-87, -2.227977792271394613e-227))); %!test %! assert (isequal (expm1 (infsup (-1.827668734769395026e-22, -1.326175859067188756e-169)), infsup (-1.827668734769395026e-22, -1.326175859067188461e-169))); %!#expm1 [-0X1.582D3AFB2C63DP+312, -0X5.08DC843E57ED4P+180] = [-0X1.0000000000000P+0, -0X1.0000000000000P+0]; %!test %! assert (isequal (expm1 (infsup (-5.423963041733560701e+77, -2.059305088062927775e-14)), infsup (-1.000000000000000000e+00, -2.059305088062906318e-14))); %!test %! assert (isequal (expm1 (infsup (-3.360610542799653195e+197, -5.874775479904158146e+02)), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %!#expm1 [-0X3.2FD3FDE325402P+688, -0X2.738623C238270P+48] = [-0X1.0000000000000P+0, -0X1.0000000000000P+0]; %!test %! assert (isequal (expm1 (infsup (-3.249456070719769514e+02, -3.915939161035242553e-52)), infsup (-1.000000000000000000e+00, -3.915939161035241811e-52))); %!test %! assert (isequal (expm1 (infsup (-6.756234292039407244e+297, -1.232680690145569154e-163)), infsup (-1.000000000000000000e+00, -1.232680690145569000e-163))); %!test %! assert (isequal (expm1 (infsup (-3.768432504481998329e-45, -1.425448715493971452e-132)), infsup (-3.768432504481998329e-45, -1.425448715493971139e-132))); %!test %! assert (isequal (expm1 (infsup (-6.868984884638793653e+105, -1.124545542537290068e-153)), infsup (-1.000000000000000000e+00, -1.124545542537289935e-153))); %!#expm1 [-0XD.F2552B8F60978P+236, -0X7.FBDBC320979A4P+188] = [-0X1.0000000000000P+0, -0X1.0000000000000P+0]; %!test %! assert (isequal (expm1 (infsup (-4.825221040561267626e-72, -3.741418656433786262e-95)), infsup (-4.825221040561267626e-72, -3.741418656433785596e-95))); %!test %! assert (isequal (expm1 (infsup (1.000000000000000000e+00, 2.000000000000000000e+00)), infsup (1.718281828459045091e+00, 6.389056098930650407e+00))); %!test %! assert (isequal (expm1 (infsup (-1.000000000000000000e+00, 2.000000000000000000e+00)), infsup (-6.321205588285577770e-01, 6.389056098930650407e+00))); %!test %! assert (isequal (expm1 (infsup (-5.000000000000000000e+00, -3.000000000000000000e+00)), infsup (-9.932620530009146353e-01, -9.502129316321360486e-01))); %!test %! assert (isequal (expm1 (infsup (-2.000000000000000000e+00, 5.999999999999999778e-01)), infsup (-8.646647167633874087e-01, 8.221188003905089969e-01))); %!test %! assert (isequal (expm1 (infsup (4.940656458412465442e-324, 5.526030376261632760e-318)), infsup (4.940656458412465442e-324, 5.526035316918091172e-318))); %!test %! assert (isequal (expm1 (infsup (2.158572806680406152e-320, 1.000000000000000000e+00)), infsup (2.158572806680406152e-320, 1.718281828459045313e+00))); %!test %! assert (isequal (expm1 (infsup (-3.453765897253233967e-319, 3.453765897253233967e-319)), infsup (-3.453765897253233967e-319, 3.453815303817818092e-319))); %!test %! assert (isequal (expm1 (infsup (-1.348799213146603066e-321, 1.999755859375000000e+00)), infsup (-1.348799213146603066e-321, 6.387252350349609920e+00))); %!test %! assert (isequal (expm1 (infsup (-1.999984741210937500e+00, -1.768329819216851651e-316)), infsup (-8.646626516950925989e-01, -1.768329769810287067e-316))); %!test %! assert (isequal (expm1 (infsup (-1.999999996274709702e+00, 4.668945501635218808e-314)), infsup (-8.646647162592241420e-01, 4.668945502129284454e-314))); %!test %! assert (isequal (log1p (infsup (4.147420261371489825e-79, 5.379571027897612396e+28)), infsup (4.147420261371489226e-79, 6.615499124023648392e+01))); %!test %! assert (isequal (log1p (infsup (1.110880646187224313e-155, 2.373351651082584966e-67)), infsup (1.110880646187224105e-155, 2.373351651082584966e-67))); %!test %! assert (isequal (log1p (infsup (5.129079157666995424e-72, 1.751070362531829627e+71)), infsup (5.129079157666994419e-72, 1.640437688392722464e+02))); %!test %! assert (isequal (log1p (infsup (6.948997631311531055e-148, 2.928301646694579776e-136)), infsup (6.948997631311529665e-148, 2.928301646694579776e-136))); %!test %! assert (isequal (log1p (infsup (1.228976222624138207e+59, 2.234162998792154053e+68)), infsup (1.360587019701163172e+02, 1.573796529843343421e+02))); %!test %! assert (isequal (log1p (infsup (3.765881959744468747e-13, 4.282127607174989696e+83)), infsup (3.765881959743759404e-13, 1.925690127090641397e+02))); %!test %! assert (isequal (log1p (infsup (6.336975772360046338e-144, 9.158993707856365702e+59)), infsup (6.336975772360045200e-144, 1.380672568020790720e+02))); %!test %! assert (isequal (log1p (infsup (5.364761505213512494e-113, 4.082352475280499044e+42)), infsup (5.364761505213511340e-113, 9.811524731508208674e+01))); %!test %! assert (isequal (log1p (infsup (7.550677903404239041e-232, 3.224750948704370352e-99)), infsup (7.550677903404237611e-232, 3.224750948704370352e-99))); %!test %! assert (isequal (log1p (infsup (1.225297990074229138e-174, 4.817234909117431242e-40)), infsup (1.225297990074228914e-174, 4.817234909117431242e-40))); %!test %! assert (isequal (log1p (infsup (2.170435512584716658e+35, 4.550722777302786970e+83)), infsup (8.136540609925064871e+01, 1.926298487910074471e+02))); %!test %! assert (isequal (log1p (infsup (2.535659632151250680e-30, 4.662866785261630365e+61)), infsup (2.535659632151250329e-30, 1.419973211215928757e+02))); %!test %! assert (isequal (log1p (infsup (7.582817216007211414e+01, 2.533325420226928244e+179)), infsup (4.341571397890723105e+00, 4.130922644809588746e+02))); %!test %! assert (isequal (log1p (infsup (2.679384856388388202e+06, 3.456099944072672956e+189)), infsup (1.480109816816228374e+01, 4.364287233454008401e+02))); %!test %! assert (isequal (log1p (infsup (2.298466163925377139e-53, 3.422642591789022920e-07)), infsup (2.298466163925376675e-53, 3.422642006065041091e-07))); %!test %! assert (isequal (log1p (infsup (8.331537116545182766e-169, 1.276575089856515728e+278)), infsup (8.331537116545181589e-169, 6.403628366331134885e+02))); %!test %! assert (isequal (log1p (infsup (3.718156390017819207e-141, 1.084633607212178861e-48)), infsup (3.718156390017818625e-141, 1.084633607212178861e-48))); %!test %! assert (isequal (log1p (infsup (3.157294329035461405e-160, 9.898300388558577825e+97)), infsup (3.157294329035460773e-160, 2.256431170849012631e+02))); %!test %! assert (isequal (log1p (infsup (1.083356361649631714e+44, 3.415036575780023082e+59)), infsup (1.013938080560929649e+02, 1.370807086899449985e+02))); %!test %! assert (isequal (log1p (infsup (8.455584990678977241e-99, 6.051563441903092353e-73)), infsup (8.455584990678975617e-99, 6.051563441903092353e-73))); %!test %! assert (isequal (log1p (infsup (2.360349141715971707e+109, 8.567792987486366378e+158)), infsup (2.518405846858512973e+02, 3.659564548647884408e+02))); %!test %! assert (isequal (log1p (infsup (2.012916824299288793e-32, 2.822293342336804668e+41)), infsup (2.012916824299288519e-32, 9.544353860916723420e+01))); %!test %! assert (isequal (log1p (infsup (4.831139778854605785e-107, 2.083134309679031648e-23)), infsup (4.831139778854605180e-107, 2.083134309679031648e-23))); %!test %! assert (isequal (log1p (infsup (8.466268199564697371e-76, 1.680782691923963737e-10)), infsup (8.466268199564696144e-76, 1.680782691782712307e-10))); %!test %! assert (isequal (log1p (infsup (2.283702426861795342e-151, 2.158830003381976904e+22)), infsup (2.283702426861795002e-151, 5.142643845571060979e+01))); %!test %! assert (isequal (log1p (infsup (1.114428406645123204e-64, 1.137441975089809242e+58)), infsup (1.114428406645123036e-64, 1.336787172532864645e+02))); %!test %! assert (isequal (log1p (infsup (1.463767593806767211e-207, 3.684178239990781413e-44)), infsup (1.463767593806767038e-207, 3.684178239990781413e-44))); %!test %! assert (isequal (log1p (infsup (1.806590984564742948e+58, 4.476357965164357790e+78)), infsup (1.341413770290983223e+02, 1.811004470151316070e+02))); %!test %! assert (isequal (log1p (infsup (2.504949335867761681e-102, 4.444462712533866271e+177)), infsup (2.504949335867761285e-102, 4.090492204470355091e+02))); %!test %! assert (isequal (log1p (infsup (1.027829701532525701e-53, 1.755408547816880709e-45)), infsup (1.027829701532525585e-53, 1.755408547816880709e-45))); %!test %! assert (isequal (realsqrt (infsup (4.147420261371489825e-79, 5.379571027897612396e+28)), infsup (6.440046786609154008e-40, 2.319390227602421562e+14))); %!test %! assert (isequal (realsqrt (infsup (1.110880646187224313e-155, 2.373351651082584966e-67)), infsup (3.332987618019641001e-78, 4.871705708561002190e-34))); %!test %! assert (isequal (realsqrt (infsup (5.129079157666995424e-72, 1.751070362531829627e+71)), infsup (2.264747040547132332e-36, 4.184579265029914561e+35))); %!test %! assert (isequal (realsqrt (infsup (6.948997631311531055e-148, 2.928301646694579776e-136)), infsup (2.636095148379802032e-74, 1.711228110654620020e-68))); %!test %! assert (isequal (realsqrt (infsup (1.228976222624138207e+59, 2.234162998792154053e+68)), infsup (3.505675716069781836e+29, 1.494711677479022891e+34))); %!test %! assert (isequal (realsqrt (infsup (3.765881959744468747e-13, 4.282127607174989696e+83)), infsup (6.136678221761727970e-07, 6.543796762717337107e+41))); %!test %! assert (isequal (realsqrt (infsup (6.336975772360046338e-144, 9.158993707856365702e+59)), infsup (2.517335053654964799e-72, 9.570263166630459163e+29))); %!test %! assert (isequal (realsqrt (infsup (5.364761505213512494e-113, 4.082352475280499044e+42)), infsup (7.324453225472541740e-57, 2.020483228161149501e+21))); %!test %! assert (isequal (realsqrt (infsup (7.550677903404239041e-232, 3.224750948704370352e-99)), infsup (2.747849687192557654e-116, 5.678689064127715303e-50))); %!test %! assert (isequal (realsqrt (infsup (1.225297990074229138e-174, 4.817234909117431242e-40)), infsup (1.106931791066743519e-87, 2.194820017476930231e-20))); %!test %! assert (isequal (realsqrt (infsup (2.170435512584716658e+35, 4.550722777302786970e+83)), infsup (4.658793312205121280e+17, 6.745904518522914642e+41))); %!test %! assert (isequal (realsqrt (infsup (2.535659632151250680e-30, 4.662866785261630365e+61)), infsup (1.592375468333787993e-15, 6.828518715842866868e+30))); %!test %! assert (isequal (realsqrt (infsup (7.582817216007211414e+01, 2.533325420226928244e+179)), infsup (8.707937308000792243e+00, 5.033215095966919400e+89))); %!test %! assert (isequal (realsqrt (infsup (2.679384856388388202e+06, 3.456099944072672956e+189)), infsup (1.636882664209132599e+03, 5.878860386225099984e+94))); %!test %! assert (isequal (realsqrt (infsup (2.298466163925377139e-53, 3.422642591789022920e-07)), infsup (4.794232121962157468e-27, 5.850335538914860564e-04))); %!test %! assert (isequal (realsqrt (infsup (8.331537116545182766e-169, 1.276575089856515728e+278)), infsup (9.127725410278938219e-85, 1.129856225303253353e+139))); %!test %! assert (isequal (realsqrt (infsup (3.718156390017819207e-141, 1.084633607212178861e-48)), infsup (6.097668726667445732e-71, 1.041457443783556123e-24))); %!test %! assert (isequal (realsqrt (infsup (3.157294329035461405e-160, 9.898300388558577825e+97)), infsup (1.776877691073716194e-80, 9.949020247521149013e+48))); %!test %! assert (isequal (realsqrt (infsup (1.083356361649631714e+44, 3.415036575780023082e+59)), infsup (1.040844062119600901e+22, 5.843831427907570747e+29))); %!test %! assert (isequal (realsqrt (infsup (8.455584990678977241e-99, 6.051563441903092353e-73)), infsup (9.195425488077740187e-50, 7.779179546650850484e-37))); %!test %! assert (isequal (realsqrt (infsup (2.360349141715971707e+109, 8.567792987486366378e+158)), infsup (4.858342455731143318e+54, 2.927079258832320626e+79))); %!test %! assert (isequal (realsqrt (infsup (2.012916824299288793e-32, 2.822293342336804668e+41)), infsup (1.418772999566628592e-16, 5.312526086841179177e+20))); %!test %! assert (isequal (realsqrt (infsup (4.831139778854605785e-107, 2.083134309679031648e-23)), infsup (6.950640099195617068e-54, 4.564136621179335194e-12))); %!test %! assert (isequal (realsqrt (infsup (8.466268199564697371e-76, 1.680782691923963737e-10)), infsup (2.909685240634233473e-38, 1.296450034488010588e-05))); %!test %! assert (isequal (realsqrt (infsup (2.283702426861795342e-151, 2.158830003381976904e+22)), infsup (4.778809921792030281e-76, 1.469295750821452942e+11))); %!test %! assert (isequal (realsqrt (infsup (1.114428406645123204e-64, 1.137441975089809242e+58)), infsup (1.055664912102852335e-32, 1.066509247540690319e+29))); %!test %! assert (isequal (realsqrt (infsup (1.463767593806767211e-207, 3.684178239990781413e-44)), infsup (3.825921580229744811e-104, 1.919421329461247340e-22))); %!test %! assert (isequal (realsqrt (infsup (1.806590984564742948e+58, 4.476357965164357790e+78)), infsup (1.344094856981732069e+29, 2.115740524063468000e+39))); %!test %! assert (isequal (realsqrt (infsup (2.504949335867761681e-102, 4.444462712533866271e+177)), infsup (1.582703173645570547e-51, 6.666680367719655103e+88))); %!test %! assert (isequal (realsqrt (infsup (1.027829701532525701e-53, 1.755408547816880709e-45)), infsup (3.205978324213258952e-27, 4.189759596703468421e-23))); %!test %! assert (isequal (pown (infsup (-1.820250631842705497e-45, -9.117403206523163851e-284), 2), infsup (0.000000000000000000e+00, 3.313312362723768996e-90))); %! assert (isequal (infsup (-1.820250631842705497e-45, -9.117403206523163851e-284) .^ 2, infsup (0.000000000000000000e+00, 3.313312362723768996e-90))); %! assert (isequal (power (infsup (-1.820250631842705497e-45, -9.117403206523163851e-284), 2), infsup (0.000000000000000000e+00, 3.313312362723768996e-90))); %! assert (isequal (infsup (-1.820250631842705497e-45, -9.117403206523163851e-284) ^ 2, infsup (0.000000000000000000e+00, 3.313312362723768996e-90))); %! assert (isequal (mpower (infsup (-1.820250631842705497e-45, -9.117403206523163851e-284), 2), infsup (0.000000000000000000e+00, 3.313312362723768996e-90))); %!test %! assert (isequal (pown (infsup (-9.132843019095516065e-132, -9.836586939929288236e-188), 2), infsup (0.000000000000000000e+00, 8.340882161144170744e-263))); %! assert (isequal (infsup (-9.132843019095516065e-132, -9.836586939929288236e-188) .^ 2, infsup (0.000000000000000000e+00, 8.340882161144170744e-263))); %! assert (isequal (power (infsup (-9.132843019095516065e-132, -9.836586939929288236e-188), 2), infsup (0.000000000000000000e+00, 8.340882161144170744e-263))); %! assert (isequal (infsup (-9.132843019095516065e-132, -9.836586939929288236e-188) ^ 2, infsup (0.000000000000000000e+00, 8.340882161144170744e-263))); %! assert (isequal (mpower (infsup (-9.132843019095516065e-132, -9.836586939929288236e-188), 2), infsup (0.000000000000000000e+00, 8.340882161144170744e-263))); %!test %! assert (isequal (pown (infsup (-8.631384205445317548e+01, -2.269091389186822222e-289), 2), infsup (0.000000000000000000e+00, 7.450079330201089761e+03))); %! assert (isequal (infsup (-8.631384205445317548e+01, -2.269091389186822222e-289) .^ 2, infsup (0.000000000000000000e+00, 7.450079330201089761e+03))); %! assert (isequal (power (infsup (-8.631384205445317548e+01, -2.269091389186822222e-289), 2), infsup (0.000000000000000000e+00, 7.450079330201089761e+03))); %! assert (isequal (infsup (-8.631384205445317548e+01, -2.269091389186822222e-289) ^ 2, infsup (0.000000000000000000e+00, 7.450079330201089761e+03))); %! assert (isequal (mpower (infsup (-8.631384205445317548e+01, -2.269091389186822222e-289), 2), infsup (0.000000000000000000e+00, 7.450079330201089761e+03))); %!test %! assert (isequal (pown (infsup (-1.654017949299359065e-112, 1.159376035639006975e-176), 2), infsup (0.000000000000000000e+00, 2.735775376604457287e-224))); %! assert (isequal (infsup (-1.654017949299359065e-112, 1.159376035639006975e-176) .^ 2, infsup (0.000000000000000000e+00, 2.735775376604457287e-224))); %! assert (isequal (power (infsup (-1.654017949299359065e-112, 1.159376035639006975e-176), 2), infsup (0.000000000000000000e+00, 2.735775376604457287e-224))); %! assert (isequal (infsup (-1.654017949299359065e-112, 1.159376035639006975e-176) ^ 2, infsup (0.000000000000000000e+00, 2.735775376604457287e-224))); %! assert (isequal (mpower (infsup (-1.654017949299359065e-112, 1.159376035639006975e-176), 2), infsup (0.000000000000000000e+00, 2.735775376604457287e-224))); %!test %! assert (isequal (pown (infsup (-2.261578927830210317e-107, -2.921845682025291002e-170), 2), infsup (0.000000000000000000e+00, 5.114739246805643826e-214))); %! assert (isequal (infsup (-2.261578927830210317e-107, -2.921845682025291002e-170) .^ 2, infsup (0.000000000000000000e+00, 5.114739246805643826e-214))); %! assert (isequal (power (infsup (-2.261578927830210317e-107, -2.921845682025291002e-170), 2), infsup (0.000000000000000000e+00, 5.114739246805643826e-214))); %! assert (isequal (infsup (-2.261578927830210317e-107, -2.921845682025291002e-170) ^ 2, infsup (0.000000000000000000e+00, 5.114739246805643826e-214))); %! assert (isequal (mpower (infsup (-2.261578927830210317e-107, -2.921845682025291002e-170), 2), infsup (0.000000000000000000e+00, 5.114739246805643826e-214))); %!test %! assert (isequal (pown (infsup (-1.469458391712281360e-99, -1.976254011990074054e-124), 2), infsup (3.905579919906863034e-248, 2.159307964973644752e-198))); %! assert (isequal (infsup (-1.469458391712281360e-99, -1.976254011990074054e-124) .^ 2, infsup (3.905579919906863034e-248, 2.159307964973644752e-198))); %! assert (isequal (power (infsup (-1.469458391712281360e-99, -1.976254011990074054e-124), 2), infsup (3.905579919906863034e-248, 2.159307964973644752e-198))); %! assert (isequal (infsup (-1.469458391712281360e-99, -1.976254011990074054e-124) ^ 2, infsup (3.905579919906863034e-248, 2.159307964973644752e-198))); %! assert (isequal (mpower (infsup (-1.469458391712281360e-99, -1.976254011990074054e-124), 2), infsup (3.905579919906863034e-248, 2.159307964973644752e-198))); %!test %! assert (isequal (pown (infsup (-1.088588131986426258e-12, -3.239993862505298994e-238), 2), infsup (0.000000000000000000e+00, 1.185024121101697110e-24))); %! assert (isequal (infsup (-1.088588131986426258e-12, -3.239993862505298994e-238) .^ 2, infsup (0.000000000000000000e+00, 1.185024121101697110e-24))); %! assert (isequal (power (infsup (-1.088588131986426258e-12, -3.239993862505298994e-238), 2), infsup (0.000000000000000000e+00, 1.185024121101697110e-24))); %! assert (isequal (infsup (-1.088588131986426258e-12, -3.239993862505298994e-238) ^ 2, infsup (0.000000000000000000e+00, 1.185024121101697110e-24))); %! assert (isequal (mpower (infsup (-1.088588131986426258e-12, -3.239993862505298994e-238), 2), infsup (0.000000000000000000e+00, 1.185024121101697110e-24))); %!test %! assert (isequal (pown (infsup (-3.114600191344484305e-60, -1.151057432815240852e-61), 2), infsup (1.324933213639212643e-122, 9.700734351923098806e-120))); %! assert (isequal (infsup (-3.114600191344484305e-60, -1.151057432815240852e-61) .^ 2, infsup (1.324933213639212643e-122, 9.700734351923098806e-120))); %! assert (isequal (power (infsup (-3.114600191344484305e-60, -1.151057432815240852e-61), 2), infsup (1.324933213639212643e-122, 9.700734351923098806e-120))); %! assert (isequal (infsup (-3.114600191344484305e-60, -1.151057432815240852e-61) ^ 2, infsup (1.324933213639212643e-122, 9.700734351923098806e-120))); %! assert (isequal (mpower (infsup (-3.114600191344484305e-60, -1.151057432815240852e-61), 2), infsup (1.324933213639212643e-122, 9.700734351923098806e-120))); %!test %! assert (isequal (pown (infsup (3.215755734598088570e-80, 2.860247434645490115e-24), 2), infsup (1.034108494460049166e-159, 8.181015387396108212e-48))); %! assert (isequal (infsup (3.215755734598088570e-80, 2.860247434645490115e-24) .^ 2, infsup (1.034108494460049166e-159, 8.181015387396108212e-48))); %! assert (isequal (power (infsup (3.215755734598088570e-80, 2.860247434645490115e-24), 2), infsup (1.034108494460049166e-159, 8.181015387396108212e-48))); %! assert (isequal (infsup (3.215755734598088570e-80, 2.860247434645490115e-24) ^ 2, infsup (1.034108494460049166e-159, 8.181015387396108212e-48))); %! assert (isequal (mpower (infsup (3.215755734598088570e-80, 2.860247434645490115e-24), 2), infsup (1.034108494460049166e-159, 8.181015387396108212e-48))); %!test %! assert (isequal (pown (infsup (-7.599545156767026148e-113, -3.620806299549831939e-276), 2), infsup (0.000000000000000000e+00, 5.775308658974116928e-225))); %! assert (isequal (infsup (-7.599545156767026148e-113, -3.620806299549831939e-276) .^ 2, infsup (0.000000000000000000e+00, 5.775308658974116928e-225))); %! assert (isequal (power (infsup (-7.599545156767026148e-113, -3.620806299549831939e-276), 2), infsup (0.000000000000000000e+00, 5.775308658974116928e-225))); %! assert (isequal (infsup (-7.599545156767026148e-113, -3.620806299549831939e-276) ^ 2, infsup (0.000000000000000000e+00, 5.775308658974116928e-225))); %! assert (isequal (mpower (infsup (-7.599545156767026148e-113, -3.620806299549831939e-276), 2), infsup (0.000000000000000000e+00, 5.775308658974116928e-225))); %!test %! assert (isequal (pown (infsup (-8.378054792460110690e-178, 2.171929406448802147e-04), 2), infsup (0.000000000000000000e+00, 4.717277346597046512e-08))); %! assert (isequal (infsup (-8.378054792460110690e-178, 2.171929406448802147e-04) .^ 2, infsup (0.000000000000000000e+00, 4.717277346597046512e-08))); %! assert (isequal (power (infsup (-8.378054792460110690e-178, 2.171929406448802147e-04), 2), infsup (0.000000000000000000e+00, 4.717277346597046512e-08))); %! assert (isequal (infsup (-8.378054792460110690e-178, 2.171929406448802147e-04) ^ 2, infsup (0.000000000000000000e+00, 4.717277346597046512e-08))); %! assert (isequal (mpower (infsup (-8.378054792460110690e-178, 2.171929406448802147e-04), 2), infsup (0.000000000000000000e+00, 4.717277346597046512e-08))); %!test %! assert (isequal (pown (infsup (-6.977305240208117095e-101, -5.652987073406890307e-174), 2), infsup (0.000000000000000000e+00, 4.868278841503565141e-201))); %! assert (isequal (infsup (-6.977305240208117095e-101, -5.652987073406890307e-174) .^ 2, infsup (0.000000000000000000e+00, 4.868278841503565141e-201))); %! assert (isequal (power (infsup (-6.977305240208117095e-101, -5.652987073406890307e-174), 2), infsup (0.000000000000000000e+00, 4.868278841503565141e-201))); %! assert (isequal (infsup (-6.977305240208117095e-101, -5.652987073406890307e-174) ^ 2, infsup (0.000000000000000000e+00, 4.868278841503565141e-201))); %! assert (isequal (mpower (infsup (-6.977305240208117095e-101, -5.652987073406890307e-174), 2), infsup (0.000000000000000000e+00, 4.868278841503565141e-201))); %!test %! assert (isequal (pown (infsup (-5.464129729164141708e-282, 9.669182275976748412e-117), 2), infsup (0.000000000000000000e+00, 9.349308588606289563e-233))); %! assert (isequal (infsup (-5.464129729164141708e-282, 9.669182275976748412e-117) .^ 2, infsup (0.000000000000000000e+00, 9.349308588606289563e-233))); %! assert (isequal (power (infsup (-5.464129729164141708e-282, 9.669182275976748412e-117), 2), infsup (0.000000000000000000e+00, 9.349308588606289563e-233))); %! assert (isequal (infsup (-5.464129729164141708e-282, 9.669182275976748412e-117) ^ 2, infsup (0.000000000000000000e+00, 9.349308588606289563e-233))); %! assert (isequal (mpower (infsup (-5.464129729164141708e-282, 9.669182275976748412e-117), 2), infsup (0.000000000000000000e+00, 9.349308588606289563e-233))); %!test %! assert (isequal (pown (infsup (-2.609094333453398954e-148, 5.011306988287881225e-06), 2), infsup (0.000000000000000000e+00, 2.511319773086295719e-11))); %! assert (isequal (infsup (-2.609094333453398954e-148, 5.011306988287881225e-06) .^ 2, infsup (0.000000000000000000e+00, 2.511319773086295719e-11))); %! assert (isequal (power (infsup (-2.609094333453398954e-148, 5.011306988287881225e-06), 2), infsup (0.000000000000000000e+00, 2.511319773086295719e-11))); %! assert (isequal (infsup (-2.609094333453398954e-148, 5.011306988287881225e-06) ^ 2, infsup (0.000000000000000000e+00, 2.511319773086295719e-11))); %! assert (isequal (mpower (infsup (-2.609094333453398954e-148, 5.011306988287881225e-06), 2), infsup (0.000000000000000000e+00, 2.511319773086295719e-11))); %!test %! assert (isequal (pown (infsup (-2.520164184091732485e-91, -6.923225182185906259e-252), 2), infsup (0.000000000000000000e+00, 6.351227514778747876e-182))); %! assert (isequal (infsup (-2.520164184091732485e-91, -6.923225182185906259e-252) .^ 2, infsup (0.000000000000000000e+00, 6.351227514778747876e-182))); %! assert (isequal (power (infsup (-2.520164184091732485e-91, -6.923225182185906259e-252), 2), infsup (0.000000000000000000e+00, 6.351227514778747876e-182))); %! assert (isequal (infsup (-2.520164184091732485e-91, -6.923225182185906259e-252) ^ 2, infsup (0.000000000000000000e+00, 6.351227514778747876e-182))); %! assert (isequal (mpower (infsup (-2.520164184091732485e-91, -6.923225182185906259e-252), 2), infsup (0.000000000000000000e+00, 6.351227514778747876e-182))); %!test %! assert (isequal (pown (infsup (-2.058411222963202619e-150, -1.691080271454051769e-229), 2), infsup (0.000000000000000000e+00, 4.237056762820867958e-300))); %! assert (isequal (infsup (-2.058411222963202619e-150, -1.691080271454051769e-229) .^ 2, infsup (0.000000000000000000e+00, 4.237056762820867958e-300))); %! assert (isequal (power (infsup (-2.058411222963202619e-150, -1.691080271454051769e-229), 2), infsup (0.000000000000000000e+00, 4.237056762820867958e-300))); %! assert (isequal (infsup (-2.058411222963202619e-150, -1.691080271454051769e-229) ^ 2, infsup (0.000000000000000000e+00, 4.237056762820867958e-300))); %! assert (isequal (mpower (infsup (-2.058411222963202619e-150, -1.691080271454051769e-229), 2), infsup (0.000000000000000000e+00, 4.237056762820867958e-300))); %!test %! assert (isequal (pown (infsup (-1.194912260770650641e-171, -3.063641562993914407e-235), 2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (infsup (-1.194912260770650641e-171, -3.063641562993914407e-235) .^ 2, infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (power (infsup (-1.194912260770650641e-171, -3.063641562993914407e-235), 2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (infsup (-1.194912260770650641e-171, -3.063641562993914407e-235) ^ 2, infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (mpower (infsup (-1.194912260770650641e-171, -3.063641562993914407e-235), 2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %!test %! assert (isequal (pown (infsup (-1.410213021759318257e-164, 2.113307206456483530e-235), 2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (infsup (-1.410213021759318257e-164, 2.113307206456483530e-235) .^ 2, infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (power (infsup (-1.410213021759318257e-164, 2.113307206456483530e-235), 2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (infsup (-1.410213021759318257e-164, 2.113307206456483530e-235) ^ 2, infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (mpower (infsup (-1.410213021759318257e-164, 2.113307206456483530e-235), 2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %!test %! assert (isequal (pown (infsup (-2.734402476279937437e-15, 2.214286456252711975e-200), 2), infsup (0.000000000000000000e+00, 7.476956902285853824e-30))); %! assert (isequal (infsup (-2.734402476279937437e-15, 2.214286456252711975e-200) .^ 2, infsup (0.000000000000000000e+00, 7.476956902285853824e-30))); %! assert (isequal (power (infsup (-2.734402476279937437e-15, 2.214286456252711975e-200), 2), infsup (0.000000000000000000e+00, 7.476956902285853824e-30))); %! assert (isequal (infsup (-2.734402476279937437e-15, 2.214286456252711975e-200) ^ 2, infsup (0.000000000000000000e+00, 7.476956902285853824e-30))); %! assert (isequal (mpower (infsup (-2.734402476279937437e-15, 2.214286456252711975e-200), 2), infsup (0.000000000000000000e+00, 7.476956902285853824e-30))); %!test %! assert (isequal (pown (infsup (-4.736813689297963792e-37, -3.757820326147841254e-165), 2), infsup (0.000000000000000000e+00, 2.243740392712058757e-73))); %! assert (isequal (infsup (-4.736813689297963792e-37, -3.757820326147841254e-165) .^ 2, infsup (0.000000000000000000e+00, 2.243740392712058757e-73))); %! assert (isequal (power (infsup (-4.736813689297963792e-37, -3.757820326147841254e-165), 2), infsup (0.000000000000000000e+00, 2.243740392712058757e-73))); %! assert (isequal (infsup (-4.736813689297963792e-37, -3.757820326147841254e-165) ^ 2, infsup (0.000000000000000000e+00, 2.243740392712058757e-73))); %! assert (isequal (mpower (infsup (-4.736813689297963792e-37, -3.757820326147841254e-165), 2), infsup (0.000000000000000000e+00, 2.243740392712058757e-73))); %!test %! assert (isequal (pown (infsup (-1.178872317111653867e-269, -3.697079530478824433e-304), 2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (infsup (-1.178872317111653867e-269, -3.697079530478824433e-304) .^ 2, infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (power (infsup (-1.178872317111653867e-269, -3.697079530478824433e-304), 2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (infsup (-1.178872317111653867e-269, -3.697079530478824433e-304) ^ 2, infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (mpower (infsup (-1.178872317111653867e-269, -3.697079530478824433e-304), 2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %!test %! assert (isequal (pown (infsup (-3.170977600535302060e-50, 1.773732353250808790e-223), 2), infsup (0.000000000000000000e+00, 1.005509894309662304e-99))); %! assert (isequal (infsup (-3.170977600535302060e-50, 1.773732353250808790e-223) .^ 2, infsup (0.000000000000000000e+00, 1.005509894309662304e-99))); %! assert (isequal (power (infsup (-3.170977600535302060e-50, 1.773732353250808790e-223), 2), infsup (0.000000000000000000e+00, 1.005509894309662304e-99))); %! assert (isequal (infsup (-3.170977600535302060e-50, 1.773732353250808790e-223) ^ 2, infsup (0.000000000000000000e+00, 1.005509894309662304e-99))); %! assert (isequal (mpower (infsup (-3.170977600535302060e-50, 1.773732353250808790e-223), 2), infsup (0.000000000000000000e+00, 1.005509894309662304e-99))); %!test %! assert (isequal (pown (infsup (-9.582715182984806788e-234, -6.481946913158783102e-280), 2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (infsup (-9.582715182984806788e-234, -6.481946913158783102e-280) .^ 2, infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (power (infsup (-9.582715182984806788e-234, -6.481946913158783102e-280), 2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (infsup (-9.582715182984806788e-234, -6.481946913158783102e-280) ^ 2, infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %! assert (isequal (mpower (infsup (-9.582715182984806788e-234, -6.481946913158783102e-280), 2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %!test %! assert (isequal (pown (infsup (1.510030059283921314e-212, 1.357381528725581723e-08), 2), infsup (0.000000000000000000e+00, 1.842484614525397339e-16))); %! assert (isequal (infsup (1.510030059283921314e-212, 1.357381528725581723e-08) .^ 2, infsup (0.000000000000000000e+00, 1.842484614525397339e-16))); %! assert (isequal (power (infsup (1.510030059283921314e-212, 1.357381528725581723e-08), 2), infsup (0.000000000000000000e+00, 1.842484614525397339e-16))); %! assert (isequal (infsup (1.510030059283921314e-212, 1.357381528725581723e-08) ^ 2, infsup (0.000000000000000000e+00, 1.842484614525397339e-16))); %! assert (isequal (mpower (infsup (1.510030059283921314e-212, 1.357381528725581723e-08), 2), infsup (0.000000000000000000e+00, 1.842484614525397339e-16))); %!test %! assert (isequal (pown (infsup (-1.323507196051687166e-113, 8.782017701712098963e-233), 2), infsup (0.000000000000000000e+00, 1.751671298000599397e-226))); %! assert (isequal (infsup (-1.323507196051687166e-113, 8.782017701712098963e-233) .^ 2, infsup (0.000000000000000000e+00, 1.751671298000599397e-226))); %! assert (isequal (power (infsup (-1.323507196051687166e-113, 8.782017701712098963e-233), 2), infsup (0.000000000000000000e+00, 1.751671298000599397e-226))); %! assert (isequal (infsup (-1.323507196051687166e-113, 8.782017701712098963e-233) ^ 2, infsup (0.000000000000000000e+00, 1.751671298000599397e-226))); %! assert (isequal (mpower (infsup (-1.323507196051687166e-113, 8.782017701712098963e-233), 2), infsup (0.000000000000000000e+00, 1.751671298000599397e-226))); %!test %! assert (isequal (pown (infsup (-7.715995104235895070e-26, -1.871718785128404206e-162), 2), infsup (0.000000000000000000e+00, 5.953658044859230885e-51))); %! assert (isequal (infsup (-7.715995104235895070e-26, -1.871718785128404206e-162) .^ 2, infsup (0.000000000000000000e+00, 5.953658044859230885e-51))); %! assert (isequal (power (infsup (-7.715995104235895070e-26, -1.871718785128404206e-162), 2), infsup (0.000000000000000000e+00, 5.953658044859230885e-51))); %! assert (isequal (infsup (-7.715995104235895070e-26, -1.871718785128404206e-162) ^ 2, infsup (0.000000000000000000e+00, 5.953658044859230885e-51))); %! assert (isequal (mpower (infsup (-7.715995104235895070e-26, -1.871718785128404206e-162), 2), infsup (0.000000000000000000e+00, 5.953658044859230885e-51))); %!test %! assert (isequal (pown (infsup (-3.395185885371617857e-83, -1.892322506995032646e-149), 2), infsup (3.580884470479965241e-298, 1.152728719622665870e-165))); %! assert (isequal (infsup (-3.395185885371617857e-83, -1.892322506995032646e-149) .^ 2, infsup (3.580884470479965241e-298, 1.152728719622665870e-165))); %! assert (isequal (power (infsup (-3.395185885371617857e-83, -1.892322506995032646e-149), 2), infsup (3.580884470479965241e-298, 1.152728719622665870e-165))); %! assert (isequal (infsup (-3.395185885371617857e-83, -1.892322506995032646e-149) ^ 2, infsup (3.580884470479965241e-298, 1.152728719622665870e-165))); %! assert (isequal (mpower (infsup (-3.395185885371617857e-83, -1.892322506995032646e-149), 2), infsup (3.580884470479965241e-298, 1.152728719622665870e-165))); %!test %! assert (isequal (pown (infsup (-1.449285613317172764e-98, -5.707789272110613126e-264), 2), infsup (0.000000000000000000e+00, 2.100428788968133734e-196))); %! assert (isequal (infsup (-1.449285613317172764e-98, -5.707789272110613126e-264) .^ 2, infsup (0.000000000000000000e+00, 2.100428788968133734e-196))); %! assert (isequal (power (infsup (-1.449285613317172764e-98, -5.707789272110613126e-264), 2), infsup (0.000000000000000000e+00, 2.100428788968133734e-196))); %! assert (isequal (infsup (-1.449285613317172764e-98, -5.707789272110613126e-264) ^ 2, infsup (0.000000000000000000e+00, 2.100428788968133734e-196))); %! assert (isequal (mpower (infsup (-1.449285613317172764e-98, -5.707789272110613126e-264), 2), infsup (0.000000000000000000e+00, 2.100428788968133734e-196))); %!test %! assert (isequal (pown (infsup (-1.045711771041448932e-76, 2.500374714085601101e-183), 2), infsup (0.000000000000000000e+00, 1.093513108094643860e-152))); %! assert (isequal (infsup (-1.045711771041448932e-76, 2.500374714085601101e-183) .^ 2, infsup (0.000000000000000000e+00, 1.093513108094643860e-152))); %! assert (isequal (power (infsup (-1.045711771041448932e-76, 2.500374714085601101e-183), 2), infsup (0.000000000000000000e+00, 1.093513108094643860e-152))); %! assert (isequal (infsup (-1.045711771041448932e-76, 2.500374714085601101e-183) ^ 2, infsup (0.000000000000000000e+00, 1.093513108094643860e-152))); %! assert (isequal (mpower (infsup (-1.045711771041448932e-76, 2.500374714085601101e-183), 2), infsup (0.000000000000000000e+00, 1.093513108094643860e-152))); %!test %! assert (isequal (pown (infsup (-1.069106323474023944e-70, -1.300019611184126890e-129), 2), infsup (1.690050989463328240e-258, 1.142988330892144404e-140))); %! assert (isequal (infsup (-1.069106323474023944e-70, -1.300019611184126890e-129) .^ 2, infsup (1.690050989463328240e-258, 1.142988330892144404e-140))); %! assert (isequal (power (infsup (-1.069106323474023944e-70, -1.300019611184126890e-129), 2), infsup (1.690050989463328240e-258, 1.142988330892144404e-140))); %! assert (isequal (infsup (-1.069106323474023944e-70, -1.300019611184126890e-129) ^ 2, infsup (1.690050989463328240e-258, 1.142988330892144404e-140))); %! assert (isequal (mpower (infsup (-1.069106323474023944e-70, -1.300019611184126890e-129), 2), infsup (1.690050989463328240e-258, 1.142988330892144404e-140))); interval-2.1.0/inst/test/libieeep1788_tests_elem.tst0000644000175000017500000213242213031037021021736 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/libieeep1788_tests_elem.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 2013-2015 Marco Nehmeier (nehmeier@informatik.uni-wuerzburg.de) ## Copyright 2015-2016 Oliver Heimlich ## ## Original author: Marco Nehmeier (unit tests in libieeep1788, ## original license: Apache License 2.0) ## Converted into portable ITL format by Oliver Heimlich with minor corrections. ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## minimal_pos_test %!test %! assert (isequal (+infsup (1.0, 2.0), infsup (1.0, 2.0))); %! assert (isequal (uplus (infsup (1.0, 2.0)), infsup (1.0, 2.0))); %!test %! assert (isequal (+infsup, infsup)); %! assert (isequal (uplus (infsup), infsup)); %!test %! assert (isequal (+infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (uplus (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (+infsup (1.0, inf), infsup (1.0, inf))); %! assert (isequal (uplus (infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (+infsup (-inf, -1.0), infsup (-inf, -1.0))); %! assert (isequal (uplus (infsup (-inf, -1.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (+infsup (0.0, 2.0), infsup (0.0, 2.0))); %! assert (isequal (uplus (infsup (0.0, 2.0)), infsup (0.0, 2.0))); %!test %! assert (isequal (+infsup (-0.0, 2.0), infsup (0.0, 2.0))); %! assert (isequal (uplus (infsup (-0.0, 2.0)), infsup (0.0, 2.0))); %!test %! assert (isequal (+infsup (-2.5, -0.0), infsup (-2.5, 0.0))); %! assert (isequal (uplus (infsup (-2.5, -0.0)), infsup (-2.5, 0.0))); %!test %! assert (isequal (+infsup (-2.5, 0.0), infsup (-2.5, 0.0))); %! assert (isequal (uplus (infsup (-2.5, 0.0)), infsup (-2.5, 0.0))); %!test %! assert (isequal (+infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (uplus (infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (+infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (uplus (infsup (0.0, 0.0)), infsup (0.0, 0.0))); ## minimal_pos_dec_test %!test %! assert (isequal (+infsupdec (empty, "trv"), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (+infsupdec (empty, "trv")){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (uplus (infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (uplus (infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (+infsupdec (entire, "def"), infsupdec (entire, "def"))); %! assert (isequal (decorationpart (+infsupdec (entire, "def")){1}, decorationpart (infsupdec (entire, "def")){1})); %! assert (isequal (uplus (infsupdec (entire, "def")), infsupdec (entire, "def"))); %! assert (isequal (decorationpart (uplus (infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "def")){1})); %!test %! assert (isequal (+infsupdec (1.0, 2.0, "com"), infsupdec (1.0, 2.0, "com"))); %! assert (isequal (decorationpart (+infsupdec (1.0, 2.0, "com")){1}, decorationpart (infsupdec (1.0, 2.0, "com")){1})); %! assert (isequal (uplus (infsupdec (1.0, 2.0, "com")), infsupdec (1.0, 2.0, "com"))); %! assert (isequal (decorationpart (uplus (infsupdec (1.0, 2.0, "com"))){1}, decorationpart (infsupdec (1.0, 2.0, "com")){1})); ## minimal_neg_test %!test %! assert (isequal (-infsup (1.0, 2.0), infsup (-2.0, -1.0))); %! assert (isequal (uminus (infsup (1.0, 2.0)), infsup (-2.0, -1.0))); %!test %! assert (isequal (-infsup, infsup)); %! assert (isequal (uminus (infsup), infsup)); %!test %! assert (isequal (-infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (uminus (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (-infsup (1.0, inf), infsup (-inf, -1.0))); %! assert (isequal (uminus (infsup (1.0, inf)), infsup (-inf, -1.0))); %!test %! assert (isequal (-infsup (-inf, 1.0), infsup (-1.0, inf))); %! assert (isequal (uminus (infsup (-inf, 1.0)), infsup (-1.0, inf))); %!test %! assert (isequal (-infsup (0.0, 2.0), infsup (-2.0, 0.0))); %! assert (isequal (uminus (infsup (0.0, 2.0)), infsup (-2.0, 0.0))); %!test %! assert (isequal (-infsup (-0.0, 2.0), infsup (-2.0, 0.0))); %! assert (isequal (uminus (infsup (-0.0, 2.0)), infsup (-2.0, 0.0))); %!test %! assert (isequal (-infsup (-2.0, 0.0), infsup (0.0, 2.0))); %! assert (isequal (uminus (infsup (-2.0, 0.0)), infsup (0.0, 2.0))); %!test %! assert (isequal (-infsup (-2.0, -0.0), infsup (0.0, 2.0))); %! assert (isequal (uminus (infsup (-2.0, -0.0)), infsup (0.0, 2.0))); %!test %! assert (isequal (-infsup (0.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (uminus (infsup (0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (-infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (uminus (infsup (-0.0, -0.0)), infsup (0.0, 0.0))); ## minimal_neg_dec_test %!test %! assert (isequal (-infsupdec (empty, "trv"), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (-infsupdec (empty, "trv")){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (uminus (infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (uminus (infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (-infsupdec (entire, "def"), infsupdec (entire, "def"))); %! assert (isequal (decorationpart (-infsupdec (entire, "def")){1}, decorationpart (infsupdec (entire, "def")){1})); %! assert (isequal (uminus (infsupdec (entire, "def")), infsupdec (entire, "def"))); %! assert (isequal (decorationpart (uminus (infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "def")){1})); %!test %! assert (isequal (-infsupdec (1.0, 2.0, "com"), infsupdec (-2.0, -1.0, "com"))); %! assert (isequal (decorationpart (-infsupdec (1.0, 2.0, "com")){1}, decorationpart (infsupdec (-2.0, -1.0, "com")){1})); %! assert (isequal (uminus (infsupdec (1.0, 2.0, "com")), infsupdec (-2.0, -1.0, "com"))); %! assert (isequal (decorationpart (uminus (infsupdec (1.0, 2.0, "com"))){1}, decorationpart (infsupdec (-2.0, -1.0, "com")){1})); ## minimal_add_test %!test %! assert (isequal (infsup + infsup, infsup)); %! assert (isequal (plus (infsup, infsup), infsup)); %!test %! assert (isequal (infsup (-1.0, 1.0) + infsup, infsup)); %! assert (isequal (plus (infsup (-1.0, 1.0), infsup), infsup)); %!test %! assert (isequal (infsup + infsup (-1.0, 1.0), infsup)); %! assert (isequal (plus (infsup, infsup (-1.0, 1.0)), infsup)); %!test %! assert (isequal (infsup + infsup (-inf, inf), infsup)); %! assert (isequal (plus (infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (infsup (-inf, inf) + infsup, infsup)); %! assert (isequal (plus (infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (infsup (-inf, inf) + infsup (-inf, 1.0), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-inf, inf), infsup (-inf, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) + infsup (-1.0, 1.0), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-inf, inf), infsup (-1.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) + infsup (-1.0, inf), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-inf, inf), infsup (-1.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) + infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 1.0) + infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-inf, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, 1.0) + infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-1.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, inf) + infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 2.0) + infsup (-inf, 4.0), infsup (-inf, 6.0))); %! assert (isequal (plus (infsup (-inf, 2.0), infsup (-inf, 4.0)), infsup (-inf, 6.0))); %!test %! assert (isequal (infsup (-inf, 2.0) + infsup (3.0, 4.0), infsup (-inf, 6.0))); %! assert (isequal (plus (infsup (-inf, 2.0), infsup (3.0, 4.0)), infsup (-inf, 6.0))); %!test %! assert (isequal (infsup (-inf, 2.0) + infsup (3.0, inf), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-inf, 2.0), infsup (3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (1.0, 2.0) + infsup (-inf, 4.0), infsup (-inf, 6.0))); %! assert (isequal (plus (infsup (1.0, 2.0), infsup (-inf, 4.0)), infsup (-inf, 6.0))); %!test %! assert (isequal (infsup (1.0, 2.0) + infsup (3.0, 4.0), infsup (4.0, 6.0))); %! assert (isequal (plus (infsup (1.0, 2.0), infsup (3.0, 4.0)), infsup (4.0, 6.0))); %!test %! assert (isequal (infsup (1.0, 2.0) + infsup (3.0, inf), infsup (4.0, inf))); %! assert (isequal (plus (infsup (1.0, 2.0), infsup (3.0, inf)), infsup (4.0, inf))); %!test %! assert (isequal (infsup (1.0, inf) + infsup (-inf, 4.0), infsup (-inf, inf))); %! assert (isequal (plus (infsup (1.0, inf), infsup (-inf, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (1.0, inf) + infsup (3.0, 4.0), infsup (4.0, inf))); %! assert (isequal (plus (infsup (1.0, inf), infsup (3.0, 4.0)), infsup (4.0, inf))); %!test %! assert (isequal (infsup (1.0, inf) + infsup (3.0, inf), infsup (4.0, inf))); %! assert (isequal (plus (infsup (1.0, inf), infsup (3.0, inf)), infsup (4.0, inf))); %!test %! assert (isequal (infsup (1.0, 1.797693134862315708e+308) + infsup (3.0, 4.0), infsup (4.0, inf))); %! assert (isequal (plus (infsup (1.0, 1.797693134862315708e+308), infsup (3.0, 4.0)), infsup (4.0, inf))); %!test %! assert (isequal (infsup (-1.797693134862315708e+308, 2.0) + infsup (-3.0, 4.0), infsup (-inf, 6.0))); %! assert (isequal (plus (infsup (-1.797693134862315708e+308, 2.0), infsup (-3.0, 4.0)), infsup (-inf, 6.0))); %!test %! assert (isequal (infsup (-1.797693134862315708e+308, 2.0) + infsup (-3.0, 1.797693134862315708e+308), infsup (-inf, inf))); %! assert (isequal (plus (infsup (-1.797693134862315708e+308, 2.0), infsup (-3.0, 1.797693134862315708e+308)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (1.0, 1.797693134862315708e+308) + infsup (0.0, 0.0), infsup (1.0, 1.797693134862315708e+308))); %! assert (isequal (plus (infsup (1.0, 1.797693134862315708e+308), infsup (0.0, 0.0)), infsup (1.0, 1.797693134862315708e+308))); %!test %! assert (isequal (infsup (1.0, 1.797693134862315708e+308) + infsup (-0.0, -0.0), infsup (1.0, 1.797693134862315708e+308))); %! assert (isequal (plus (infsup (1.0, 1.797693134862315708e+308), infsup (-0.0, -0.0)), infsup (1.0, 1.797693134862315708e+308))); %!test %! assert (isequal (infsup (0.0, 0.0) + infsup (-3.0, 4.0), infsup (-3.0, 4.0))); %! assert (isequal (plus (infsup (0.0, 0.0), infsup (-3.0, 4.0)), infsup (-3.0, 4.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) + infsup (-3.0, 1.797693134862315708e+308), infsup (-3.0, 1.797693134862315708e+308))); %! assert (isequal (plus (infsup (-0.0, -0.0), infsup (-3.0, 1.797693134862315708e+308)), infsup (-3.0, 1.797693134862315708e+308))); %!test %! assert (isequal (infsup (1.999999999999996447e+00, 1.999999999999996447e+00) + infsup (1.000000000000000056e-01, 1.000000000000000056e-01), infsup (2.099999999999996092e+00, 2.099999999999996536e+00))); %! assert (isequal (plus (infsup (1.999999999999996447e+00, 1.999999999999996447e+00), infsup (1.000000000000000056e-01, 1.000000000000000056e-01)), infsup (2.099999999999996092e+00, 2.099999999999996536e+00))); %!test %! assert (isequal (infsup (1.999999999999996447e+00, 1.999999999999996447e+00) + infsup (-1.000000000000000056e-01, -1.000000000000000056e-01), infsup (1.899999999999996358e+00, 1.899999999999996581e+00))); %! assert (isequal (plus (infsup (1.999999999999996447e+00, 1.999999999999996447e+00), infsup (-1.000000000000000056e-01, -1.000000000000000056e-01)), infsup (1.899999999999996358e+00, 1.899999999999996581e+00))); %!test %! assert (isequal (infsup (-1.999999999999996447e+00, 1.999999999999996447e+00) + infsup (1.000000000000000056e-01, 1.000000000000000056e-01), infsup (-1.899999999999996581e+00, 2.099999999999996536e+00))); %! assert (isequal (plus (infsup (-1.999999999999996447e+00, 1.999999999999996447e+00), infsup (1.000000000000000056e-01, 1.000000000000000056e-01)), infsup (-1.899999999999996581e+00, 2.099999999999996536e+00))); ## minimal_add_dec_test %!test %! assert (isequal (infsupdec (1.0, 2.0, "com") + infsupdec (5.0, 7.0, "com"), infsupdec (6.0, 9.0, "com"))); %! assert (isequal (decorationpart (infsupdec (1.0, 2.0, "com") + infsupdec (5.0, 7.0, "com")){1}, decorationpart (infsupdec (6.0, 9.0, "com")){1})); %! assert (isequal (plus (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 7.0, "com")), infsupdec (6.0, 9.0, "com"))); %! assert (isequal (decorationpart (plus (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 7.0, "com"))){1}, decorationpart (infsupdec (6.0, 9.0, "com")){1})); %!test %! assert (isequal (infsupdec (1.0, 2.0, "com") + infsupdec (5.0, 7.0, "def"), infsupdec (6.0, 9.0, "def"))); %! assert (isequal (decorationpart (infsupdec (1.0, 2.0, "com") + infsupdec (5.0, 7.0, "def")){1}, decorationpart (infsupdec (6.0, 9.0, "def")){1})); %! assert (isequal (plus (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 7.0, "def")), infsupdec (6.0, 9.0, "def"))); %! assert (isequal (decorationpart (plus (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 7.0, "def"))){1}, decorationpart (infsupdec (6.0, 9.0, "def")){1})); %!test %! assert (isequal (infsupdec (1.0, 2.0, "com") + infsupdec (5.0, 1.797693134862315708e+308, "com"), infsupdec (6.0, inf, "dac"))); %! assert (isequal (decorationpart (infsupdec (1.0, 2.0, "com") + infsupdec (5.0, 1.797693134862315708e+308, "com")){1}, decorationpart (infsupdec (6.0, inf, "dac")){1})); %! assert (isequal (plus (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 1.797693134862315708e+308, "com")), infsupdec (6.0, inf, "dac"))); %! assert (isequal (decorationpart (plus (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (6.0, inf, "dac")){1})); %!test %! assert (isequal (infsupdec (-1.797693134862315708e+308, 2.0, "com") + infsupdec (-0.1, 5.0, "com"), infsupdec (-inf, 7.0, "dac"))); %! assert (isequal (decorationpart (infsupdec (-1.797693134862315708e+308, 2.0, "com") + infsupdec (-0.1, 5.0, "com")){1}, decorationpart (infsupdec (-inf, 7.0, "dac")){1})); %! assert (isequal (plus (infsupdec (-1.797693134862315708e+308, 2.0, "com"), infsupdec (-0.1, 5.0, "com")), infsupdec (-inf, 7.0, "dac"))); %! assert (isequal (decorationpart (plus (infsupdec (-1.797693134862315708e+308, 2.0, "com"), infsupdec (-0.1, 5.0, "com"))){1}, decorationpart (infsupdec (-inf, 7.0, "dac")){1})); %!test %! assert (isequal (infsupdec (1.0, 2.0, "trv") + infsupdec (empty, "trv"), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (infsupdec (1.0, 2.0, "trv") + infsupdec (empty, "trv")){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (plus (infsupdec (1.0, 2.0, "trv"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (plus (infsupdec (1.0, 2.0, "trv"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); ## minimal_sub_test %!test %! assert (isequal (infsup - infsup, infsup)); %! assert (isequal (minus (infsup, infsup), infsup)); %!test %! assert (isequal (infsup (-1.0, 1.0) - infsup, infsup)); %! assert (isequal (minus (infsup (-1.0, 1.0), infsup), infsup)); %!test %! assert (isequal (infsup - infsup (-1.0, 1.0), infsup)); %! assert (isequal (minus (infsup, infsup (-1.0, 1.0)), infsup)); %!test %! assert (isequal (infsup - infsup (-inf, inf), infsup)); %! assert (isequal (minus (infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (infsup (-inf, inf) - infsup, infsup)); %! assert (isequal (minus (infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (infsup (-inf, inf) - infsup (-inf, 1.0), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-inf, inf), infsup (-inf, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) - infsup (-1.0, 1.0), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-inf, inf), infsup (-1.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) - infsup (-1.0, inf), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-inf, inf), infsup (-1.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) - infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 1.0) - infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-inf, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, 1.0) - infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-1.0, 1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, inf) - infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 2.0) - infsup (-inf, 4.0), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-inf, 2.0), infsup (-inf, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 2.0) - infsup (3.0, 4.0), infsup (-inf, -1.0))); %! assert (isequal (minus (infsup (-inf, 2.0), infsup (3.0, 4.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (infsup (-inf, 2.0) - infsup (3.0, inf), infsup (-inf, -1.0))); %! assert (isequal (minus (infsup (-inf, 2.0), infsup (3.0, inf)), infsup (-inf, -1.0))); %!test %! assert (isequal (infsup (1.0, 2.0) - infsup (-inf, 4.0), infsup (-3.0, inf))); %! assert (isequal (minus (infsup (1.0, 2.0), infsup (-inf, 4.0)), infsup (-3.0, inf))); %!test %! assert (isequal (infsup (1.0, 2.0) - infsup (3.0, 4.0), infsup (-3.0, -1.0))); %! assert (isequal (minus (infsup (1.0, 2.0), infsup (3.0, 4.0)), infsup (-3.0, -1.0))); %!test %! assert (isequal (infsup (1.0, 2.0) - infsup (3.0, inf), infsup (-inf, -1.0))); %! assert (isequal (minus (infsup (1.0, 2.0), infsup (3.0, inf)), infsup (-inf, -1.0))); %!test %! assert (isequal (infsup (1.0, inf) - infsup (-inf, 4.0), infsup (-3.0, inf))); %! assert (isequal (minus (infsup (1.0, inf), infsup (-inf, 4.0)), infsup (-3.0, inf))); %!test %! assert (isequal (infsup (1.0, inf) - infsup (3.0, 4.0), infsup (-3.0, inf))); %! assert (isequal (minus (infsup (1.0, inf), infsup (3.0, 4.0)), infsup (-3.0, inf))); %!test %! assert (isequal (infsup (1.0, inf) - infsup (3.0, inf), infsup (-inf, inf))); %! assert (isequal (minus (infsup (1.0, inf), infsup (3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (1.0, 1.797693134862315708e+308) - infsup (-3.0, 4.0), infsup (-3.0, inf))); %! assert (isequal (minus (infsup (1.0, 1.797693134862315708e+308), infsup (-3.0, 4.0)), infsup (-3.0, inf))); %!test %! assert (isequal (infsup (-1.797693134862315708e+308, 2.0) - infsup (3.0, 4.0), infsup (-inf, -1.0))); %! assert (isequal (minus (infsup (-1.797693134862315708e+308, 2.0), infsup (3.0, 4.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (infsup (-1.797693134862315708e+308, 2.0) - infsup (-1.797693134862315708e+308, 4.0), infsup (-inf, inf))); %! assert (isequal (minus (infsup (-1.797693134862315708e+308, 2.0), infsup (-1.797693134862315708e+308, 4.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (1.0, 1.797693134862315708e+308) - infsup (0.0, 0.0), infsup (1.0, 1.797693134862315708e+308))); %! assert (isequal (minus (infsup (1.0, 1.797693134862315708e+308), infsup (0.0, 0.0)), infsup (1.0, 1.797693134862315708e+308))); %!test %! assert (isequal (infsup (1.0, 1.797693134862315708e+308) - infsup (-0.0, -0.0), infsup (1.0, 1.797693134862315708e+308))); %! assert (isequal (minus (infsup (1.0, 1.797693134862315708e+308), infsup (-0.0, -0.0)), infsup (1.0, 1.797693134862315708e+308))); %!test %! assert (isequal (infsup (0.0, 0.0) - infsup (-3.0, 4.0), infsup (-4.0, 3.0))); %! assert (isequal (minus (infsup (0.0, 0.0), infsup (-3.0, 4.0)), infsup (-4.0, 3.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) - infsup (-3.0, 1.797693134862315708e+308), infsup (-1.797693134862315708e+308, 3.0))); %! assert (isequal (minus (infsup (-0.0, -0.0), infsup (-3.0, 1.797693134862315708e+308)), infsup (-1.797693134862315708e+308, 3.0))); %!test %! assert (isequal (infsup (1.999999999999996447e+00, 1.999999999999996447e+00) - infsup (1.000000000000000056e-01, 1.000000000000000056e-01), infsup (1.899999999999996358e+00, 1.899999999999996581e+00))); %! assert (isequal (minus (infsup (1.999999999999996447e+00, 1.999999999999996447e+00), infsup (1.000000000000000056e-01, 1.000000000000000056e-01)), infsup (1.899999999999996358e+00, 1.899999999999996581e+00))); %!test %! assert (isequal (infsup (1.999999999999996447e+00, 1.999999999999996447e+00) - infsup (-1.000000000000000056e-01, -1.000000000000000056e-01), infsup (2.099999999999996092e+00, 2.099999999999996536e+00))); %! assert (isequal (minus (infsup (1.999999999999996447e+00, 1.999999999999996447e+00), infsup (-1.000000000000000056e-01, -1.000000000000000056e-01)), infsup (2.099999999999996092e+00, 2.099999999999996536e+00))); %!test %! assert (isequal (infsup (-1.999999999999996447e+00, 1.999999999999996447e+00) - infsup (1.000000000000000056e-01, 1.000000000000000056e-01), infsup (-2.099999999999996536e+00, 1.899999999999996581e+00))); %! assert (isequal (minus (infsup (-1.999999999999996447e+00, 1.999999999999996447e+00), infsup (1.000000000000000056e-01, 1.000000000000000056e-01)), infsup (-2.099999999999996536e+00, 1.899999999999996581e+00))); ## minimal_sub_dec_test %!test %! assert (isequal (infsupdec (1.0, 2.0, "com") - infsupdec (5.0, 7.0, "com"), infsupdec (-6.0, -3.0, "com"))); %! assert (isequal (decorationpart (infsupdec (1.0, 2.0, "com") - infsupdec (5.0, 7.0, "com")){1}, decorationpart (infsupdec (-6.0, -3.0, "com")){1})); %! assert (isequal (minus (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 7.0, "com")), infsupdec (-6.0, -3.0, "com"))); %! assert (isequal (decorationpart (minus (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 7.0, "com"))){1}, decorationpart (infsupdec (-6.0, -3.0, "com")){1})); %!test %! assert (isequal (infsupdec (1.0, 2.0, "com") - infsupdec (5.0, 7.0, "def"), infsupdec (-6.0, -3.0, "def"))); %! assert (isequal (decorationpart (infsupdec (1.0, 2.0, "com") - infsupdec (5.0, 7.0, "def")){1}, decorationpart (infsupdec (-6.0, -3.0, "def")){1})); %! assert (isequal (minus (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 7.0, "def")), infsupdec (-6.0, -3.0, "def"))); %! assert (isequal (decorationpart (minus (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 7.0, "def"))){1}, decorationpart (infsupdec (-6.0, -3.0, "def")){1})); %!test %! assert (isequal (infsupdec (-1.0, 2.0, "com") - infsupdec (5.0, 1.797693134862315708e+308, "com"), infsupdec (-inf, -3.0, "dac"))); %! assert (isequal (decorationpart (infsupdec (-1.0, 2.0, "com") - infsupdec (5.0, 1.797693134862315708e+308, "com")){1}, decorationpart (infsupdec (-inf, -3.0, "dac")){1})); %! assert (isequal (minus (infsupdec (-1.0, 2.0, "com"), infsupdec (5.0, 1.797693134862315708e+308, "com")), infsupdec (-inf, -3.0, "dac"))); %! assert (isequal (decorationpart (minus (infsupdec (-1.0, 2.0, "com"), infsupdec (5.0, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (-inf, -3.0, "dac")){1})); %!test %! assert (isequal (infsupdec (-1.797693134862315708e+308, 2.0, "com") - infsupdec (-1.0, 5.0, "com"), infsupdec (-inf, 3.0, "dac"))); %! assert (isequal (decorationpart (infsupdec (-1.797693134862315708e+308, 2.0, "com") - infsupdec (-1.0, 5.0, "com")){1}, decorationpart (infsupdec (-inf, 3.0, "dac")){1})); %! assert (isequal (minus (infsupdec (-1.797693134862315708e+308, 2.0, "com"), infsupdec (-1.0, 5.0, "com")), infsupdec (-inf, 3.0, "dac"))); %! assert (isequal (decorationpart (minus (infsupdec (-1.797693134862315708e+308, 2.0, "com"), infsupdec (-1.0, 5.0, "com"))){1}, decorationpart (infsupdec (-inf, 3.0, "dac")){1})); %!test %! assert (isequal (infsupdec (1.0, 2.0, "trv") - infsupdec (empty, "trv"), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (infsupdec (1.0, 2.0, "trv") - infsupdec (empty, "trv")){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (minus (infsupdec (1.0, 2.0, "trv"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (minus (infsupdec (1.0, 2.0, "trv"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); ## minimal_mul_test %!test %! assert (isequal (infsup .* infsup, infsup)); %! assert (isequal (times (infsup, infsup), infsup)); %!test %! assert (isequal (infsup (-1.0, 1.0) .* infsup, infsup)); %! assert (isequal (times (infsup (-1.0, 1.0), infsup), infsup)); %!test %! assert (isequal (infsup .* infsup (-1.0, 1.0), infsup)); %! assert (isequal (times (infsup, infsup (-1.0, 1.0)), infsup)); %!test %! assert (isequal (infsup .* infsup (-inf, inf), infsup)); %! assert (isequal (times (infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (infsup (-inf, inf) .* infsup, infsup)); %! assert (isequal (times (infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup, infsup)); %! assert (isequal (times (infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (infsup .* infsup (0.0, 0.0), infsup)); %! assert (isequal (times (infsup, infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-0.0, -0.0) .* infsup, infsup)); %! assert (isequal (times (infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (infsup .* infsup (-0.0, -0.0), infsup)); %! assert (isequal (times (infsup, infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-inf, inf), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-inf, inf), infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (-5.0, -1.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, inf), infsup (-5.0, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (-5.0, 3.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, inf), infsup (-5.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (1.0, 3.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, inf), infsup (1.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (-inf, -1.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, inf), infsup (-inf, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, inf), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (-5.0, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, inf), infsup (-5.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (1.0, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, inf), infsup (1.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) .* infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (1.0, inf) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (1.0, inf), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (1.0, inf) .* infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (1.0, inf), infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (1.0, inf) .* infsup (-5.0, -1.0), infsup (-inf, -1.0))); %! assert (isequal (times (infsup (1.0, inf), infsup (-5.0, -1.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (infsup (1.0, inf) .* infsup (-5.0, 3.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (1.0, inf), infsup (-5.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (1.0, inf) .* infsup (1.0, 3.0), infsup (1.0, inf))); %! assert (isequal (times (infsup (1.0, inf), infsup (1.0, 3.0)), infsup (1.0, inf))); %!test %! assert (isequal (infsup (1.0, inf) .* infsup (-inf, -1.0), infsup (-inf, -1.0))); %! assert (isequal (times (infsup (1.0, inf), infsup (-inf, -1.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (infsup (1.0, inf) .* infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (1.0, inf), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (1.0, inf) .* infsup (-5.0, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (1.0, inf), infsup (-5.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (1.0, inf) .* infsup (1.0, inf), infsup (1.0, inf))); %! assert (isequal (times (infsup (1.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (infsup (1.0, inf) .* infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, inf) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-1.0, inf), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-1.0, inf) .* infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-1.0, inf), infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-1.0, inf) .* infsup (-5.0, -1.0), infsup (-inf, 5.0))); %! assert (isequal (times (infsup (-1.0, inf), infsup (-5.0, -1.0)), infsup (-inf, 5.0))); %!test %! assert (isequal (infsup (-1.0, inf) .* infsup (-5.0, 3.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-1.0, inf), infsup (-5.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, inf) .* infsup (1.0, 3.0), infsup (-3.0, inf))); %! assert (isequal (times (infsup (-1.0, inf), infsup (1.0, 3.0)), infsup (-3.0, inf))); %!test %! assert (isequal (infsup (-1.0, inf) .* infsup (-inf, -1.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-1.0, inf), infsup (-inf, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, inf) .* infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-1.0, inf), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, inf) .* infsup (-5.0, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-1.0, inf), infsup (-5.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, inf) .* infsup (1.0, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-1.0, inf), infsup (1.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, inf) .* infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 3.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-inf, 3.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-inf, 3.0) .* infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-inf, 3.0), infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-inf, 3.0) .* infsup (-5.0, -1.0), infsup (-15.0, inf))); %! assert (isequal (times (infsup (-inf, 3.0), infsup (-5.0, -1.0)), infsup (-15.0, inf))); %!test %! assert (isequal (infsup (-inf, 3.0) .* infsup (-5.0, 3.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, 3.0), infsup (-5.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 3.0) .* infsup (1.0, 3.0), infsup (-inf, 9.0))); %! assert (isequal (times (infsup (-inf, 3.0), infsup (1.0, 3.0)), infsup (-inf, 9.0))); %!test %! assert (isequal (infsup (-inf, 3.0) .* infsup (-inf, -1.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, 3.0), infsup (-inf, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 3.0) .* infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, 3.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 3.0) .* infsup (-5.0, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, 3.0), infsup (-5.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 3.0) .* infsup (1.0, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, 3.0), infsup (1.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 3.0) .* infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, -3.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-inf, -3.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-inf, -3.0) .* infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-inf, -3.0), infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-inf, -3.0) .* infsup (-5.0, -1.0), infsup (3.0, inf))); %! assert (isequal (times (infsup (-inf, -3.0), infsup (-5.0, -1.0)), infsup (3.0, inf))); %!test %! assert (isequal (infsup (-inf, -3.0) .* infsup (-5.0, 3.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, -3.0), infsup (-5.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, -3.0) .* infsup (1.0, 3.0), infsup (-inf, -3.0))); %! assert (isequal (times (infsup (-inf, -3.0), infsup (1.0, 3.0)), infsup (-inf, -3.0))); %!test %! assert (isequal (infsup (-inf, -3.0) .* infsup (-inf, -1.0), infsup (3.0, inf))); %! assert (isequal (times (infsup (-inf, -3.0), infsup (-inf, -1.0)), infsup (3.0, inf))); %!test %! assert (isequal (infsup (-inf, -3.0) .* infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, -3.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, -3.0) .* infsup (-5.0, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, -3.0), infsup (-5.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, -3.0) .* infsup (1.0, inf), infsup (-inf, -3.0))); %! assert (isequal (times (infsup (-inf, -3.0), infsup (1.0, inf)), infsup (-inf, -3.0))); %!test %! assert (isequal (infsup (-inf, -3.0) .* infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-inf, -3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (-5.0, -1.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (-5.0, -1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (-5.0, 3.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (-5.0, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (1.0, 3.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (1.0, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (-inf, -1.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (-inf, -1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (-inf, 3.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (-inf, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (-5.0, inf), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (-5.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (1.0, inf), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) .* infsup (-inf, inf), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-0.0, -0.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) .* infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-0.0, -0.0), infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) .* infsup (-5.0, -1.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-0.0, -0.0), infsup (-5.0, -1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) .* infsup (-5.0, 3.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-0.0, -0.0), infsup (-5.0, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) .* infsup (1.0, 3.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-0.0, -0.0), infsup (1.0, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) .* infsup (-inf, -1.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-0.0, -0.0), infsup (-inf, -1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) .* infsup (-inf, 3.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-0.0, -0.0), infsup (-inf, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) .* infsup (-5.0, inf), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-0.0, -0.0), infsup (-5.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) .* infsup (1.0, inf), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-0.0, -0.0), infsup (1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) .* infsup (-inf, inf), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (1.0, 5.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (1.0, 5.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (1.0, 5.0) .* infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (1.0, 5.0), infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (1.0, 5.0) .* infsup (-5.0, -1.0), infsup (-25.0, -1.0))); %! assert (isequal (times (infsup (1.0, 5.0), infsup (-5.0, -1.0)), infsup (-25.0, -1.0))); %!test %! assert (isequal (infsup (1.0, 5.0) .* infsup (-5.0, 3.0), infsup (-25.0, 15.0))); %! assert (isequal (times (infsup (1.0, 5.0), infsup (-5.0, 3.0)), infsup (-25.0, 15.0))); %!test %! assert (isequal (infsup (1.0, 5.0) .* infsup (1.0, 3.0), infsup (1.0, 15.0))); %! assert (isequal (times (infsup (1.0, 5.0), infsup (1.0, 3.0)), infsup (1.0, 15.0))); %!test %! assert (isequal (infsup (1.0, 5.0) .* infsup (-inf, -1.0), infsup (-inf, -1.0))); %! assert (isequal (times (infsup (1.0, 5.0), infsup (-inf, -1.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (infsup (1.0, 5.0) .* infsup (-inf, 3.0), infsup (-inf, 15.0))); %! assert (isequal (times (infsup (1.0, 5.0), infsup (-inf, 3.0)), infsup (-inf, 15.0))); %!test %! assert (isequal (infsup (1.0, 5.0) .* infsup (-5.0, inf), infsup (-25.0, inf))); %! assert (isequal (times (infsup (1.0, 5.0), infsup (-5.0, inf)), infsup (-25.0, inf))); %!test %! assert (isequal (infsup (1.0, 5.0) .* infsup (1.0, inf), infsup (1.0, inf))); %! assert (isequal (times (infsup (1.0, 5.0), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (infsup (1.0, 5.0) .* infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (1.0, 5.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, 5.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-1.0, 5.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-1.0, 5.0) .* infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-1.0, 5.0), infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-1.0, 5.0) .* infsup (-5.0, -1.0), infsup (-25.0, 5.0))); %! assert (isequal (times (infsup (-1.0, 5.0), infsup (-5.0, -1.0)), infsup (-25.0, 5.0))); %!#min max %!test %! assert (isequal (infsup (-1.0, 5.0) .* infsup (-5.0, 3.0), infsup (-25.0, 15.0))); %! assert (isequal (times (infsup (-1.0, 5.0), infsup (-5.0, 3.0)), infsup (-25.0, 15.0))); %!test %! assert (isequal (infsup (-10.0, 2.0) .* infsup (-5.0, 3.0), infsup (-30.0, 50.0))); %! assert (isequal (times (infsup (-10.0, 2.0), infsup (-5.0, 3.0)), infsup (-30.0, 50.0))); %!test %! assert (isequal (infsup (-1.0, 5.0) .* infsup (-1.0, 10.0), infsup (-10.0, 50.0))); %! assert (isequal (times (infsup (-1.0, 5.0), infsup (-1.0, 10.0)), infsup (-10.0, 50.0))); %!test %! assert (isequal (infsup (-2.0, 2.0) .* infsup (-5.0, 3.0), infsup (-10.0, 10.0))); %! assert (isequal (times (infsup (-2.0, 2.0), infsup (-5.0, 3.0)), infsup (-10.0, 10.0))); %!#end min max %!test %! assert (isequal (infsup (-1.0, 5.0) .* infsup (1.0, 3.0), infsup (-3.0, 15.0))); %! assert (isequal (times (infsup (-1.0, 5.0), infsup (1.0, 3.0)), infsup (-3.0, 15.0))); %!test %! assert (isequal (infsup (-1.0, 5.0) .* infsup (-inf, -1.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-1.0, 5.0), infsup (-inf, -1.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, 5.0) .* infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (times (infsup (-1.0, 5.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, 5.0) .* infsup (-5.0, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-1.0, 5.0), infsup (-5.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, 5.0) .* infsup (1.0, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-1.0, 5.0), infsup (1.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-1.0, 5.0) .* infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-1.0, 5.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-10.0, -5.0) .* infsup (0.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-10.0, -5.0), infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-10.0, -5.0) .* infsup (-0.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (times (infsup (-10.0, -5.0), infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-10.0, -5.0) .* infsup (-5.0, -1.0), infsup (5.0, 50.0))); %! assert (isequal (times (infsup (-10.0, -5.0), infsup (-5.0, -1.0)), infsup (5.0, 50.0))); %!test %! assert (isequal (infsup (-10.0, -5.0) .* infsup (-5.0, 3.0), infsup (-30.0, 50.0))); %! assert (isequal (times (infsup (-10.0, -5.0), infsup (-5.0, 3.0)), infsup (-30.0, 50.0))); %!test %! assert (isequal (infsup (-10.0, -5.0) .* infsup (1.0, 3.0), infsup (-30.0, -5.0))); %! assert (isequal (times (infsup (-10.0, -5.0), infsup (1.0, 3.0)), infsup (-30.0, -5.0))); %!test %! assert (isequal (infsup (-10.0, -5.0) .* infsup (-inf, -1.0), infsup (5.0, inf))); %! assert (isequal (times (infsup (-10.0, -5.0), infsup (-inf, -1.0)), infsup (5.0, inf))); %!test %! assert (isequal (infsup (-10.0, -5.0) .* infsup (-inf, 3.0), infsup (-30.0, inf))); %! assert (isequal (times (infsup (-10.0, -5.0), infsup (-inf, 3.0)), infsup (-30.0, inf))); %!test %! assert (isequal (infsup (-10.0, -5.0) .* infsup (-5.0, inf), infsup (-inf, 50.0))); %! assert (isequal (times (infsup (-10.0, -5.0), infsup (-5.0, inf)), infsup (-inf, 50.0))); %!test %! assert (isequal (infsup (-10.0, -5.0) .* infsup (1.0, inf), infsup (-inf, -5.0))); %! assert (isequal (times (infsup (-10.0, -5.0), infsup (1.0, inf)), infsup (-inf, -5.0))); %!test %! assert (isequal (infsup (-10.0, -5.0) .* infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (times (infsup (-10.0, -5.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (1.000000000000000056e-01, 1.999999999999996447e+00) .* infsup (-1.999999999999996447e+00, inf), infsup (-3.999999999999986233e+00, inf))); %! assert (isequal (times (infsup (1.000000000000000056e-01, 1.999999999999996447e+00), infsup (-1.999999999999996447e+00, inf)), infsup (-3.999999999999986233e+00, inf))); %!test %! assert (isequal (infsup (-1.000000000000000056e-01, 1.999999999999996447e+00) .* infsup (-1.999999999999996447e+00, -1.000000000000000056e-01), infsup (-3.999999999999986233e+00, 1.999999999999996780e-01))); %! assert (isequal (times (infsup (-1.000000000000000056e-01, 1.999999999999996447e+00), infsup (-1.999999999999996447e+00, -1.000000000000000056e-01)), infsup (-3.999999999999986233e+00, 1.999999999999996780e-01))); %!test %! assert (isequal (infsup (-1.000000000000000056e-01, 1.000000000000000056e-01) .* infsup (-1.999999999999996447e+00, 1.000000000000000056e-01), infsup (-1.999999999999996780e-01, 1.999999999999996780e-01))); %! assert (isequal (times (infsup (-1.000000000000000056e-01, 1.000000000000000056e-01), infsup (-1.999999999999996447e+00, 1.000000000000000056e-01)), infsup (-1.999999999999996780e-01, 1.999999999999996780e-01))); %!test %! assert (isequal (infsup (-1.999999999999996447e+00, -1.000000000000000056e-01) .* infsup (1.000000000000000056e-01, 1.999999999999996447e+00), infsup (-3.999999999999986233e+00, -1.000000000000000021e-02))); %! assert (isequal (times (infsup (-1.999999999999996447e+00, -1.000000000000000056e-01), infsup (1.000000000000000056e-01, 1.999999999999996447e+00)), infsup (-3.999999999999986233e+00, -1.000000000000000021e-02))); ## minimal_mul_dec_test %!test %! assert (isequal (infsupdec (1.0, 2.0, "com") .* infsupdec (5.0, 7.0, "com"), infsupdec (5.0, 14.0, "com"))); %! assert (isequal (decorationpart (infsupdec (1.0, 2.0, "com") .* infsupdec (5.0, 7.0, "com")){1}, decorationpart (infsupdec (5.0, 14.0, "com")){1})); %! assert (isequal (times (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 7.0, "com")), infsupdec (5.0, 14.0, "com"))); %! assert (isequal (decorationpart (times (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 7.0, "com"))){1}, decorationpart (infsupdec (5.0, 14.0, "com")){1})); %!test %! assert (isequal (infsupdec (1.0, 2.0, "com") .* infsupdec (5.0, 7.0, "def"), infsupdec (5.0, 14.0, "def"))); %! assert (isequal (decorationpart (infsupdec (1.0, 2.0, "com") .* infsupdec (5.0, 7.0, "def")){1}, decorationpart (infsupdec (5.0, 14.0, "def")){1})); %! assert (isequal (times (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 7.0, "def")), infsupdec (5.0, 14.0, "def"))); %! assert (isequal (decorationpart (times (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 7.0, "def"))){1}, decorationpart (infsupdec (5.0, 14.0, "def")){1})); %!test %! assert (isequal (infsupdec (1.0, 2.0, "com") .* infsupdec (5.0, 1.797693134862315708e+308, "com"), infsupdec (5.0, inf, "dac"))); %! assert (isequal (decorationpart (infsupdec (1.0, 2.0, "com") .* infsupdec (5.0, 1.797693134862315708e+308, "com")){1}, decorationpart (infsupdec (5.0, inf, "dac")){1})); %! assert (isequal (times (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 1.797693134862315708e+308, "com")), infsupdec (5.0, inf, "dac"))); %! assert (isequal (decorationpart (times (infsupdec (1.0, 2.0, "com"), infsupdec (5.0, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (5.0, inf, "dac")){1})); %!test %! assert (isequal (infsupdec (-1.797693134862315708e+308, 2.0, "com") .* infsupdec (-1.0, 5.0, "com"), infsupdec (-inf, 1.797693134862315708e+308, "dac"))); %! assert (isequal (decorationpart (infsupdec (-1.797693134862315708e+308, 2.0, "com") .* infsupdec (-1.0, 5.0, "com")){1}, decorationpart (infsupdec (-inf, 1.797693134862315708e+308, "dac")){1})); %! assert (isequal (times (infsupdec (-1.797693134862315708e+308, 2.0, "com"), infsupdec (-1.0, 5.0, "com")), infsupdec (-inf, 1.797693134862315708e+308, "dac"))); %! assert (isequal (decorationpart (times (infsupdec (-1.797693134862315708e+308, 2.0, "com"), infsupdec (-1.0, 5.0, "com"))){1}, decorationpart (infsupdec (-inf, 1.797693134862315708e+308, "dac")){1})); %!test %! assert (isequal (infsupdec (1.0, 2.0, "trv") .* infsupdec (empty, "trv"), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (infsupdec (1.0, 2.0, "trv") .* infsupdec (empty, "trv")){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (times (infsupdec (1.0, 2.0, "trv"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (times (infsupdec (1.0, 2.0, "trv"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); ## minimal_div_test %!test %! assert (isequal (infsup ./ infsup, infsup)); %! assert (isequal (rdivide (infsup, infsup), infsup)); %!test %! assert (isequal (infsup (-1.0, 1.0) ./ infsup, infsup)); %! assert (isequal (rdivide (infsup (-1.0, 1.0), infsup), infsup)); %!test %! assert (isequal (infsup ./ infsup (-1.0, 1.0), infsup)); %! assert (isequal (rdivide (infsup, infsup (-1.0, 1.0)), infsup)); %!test %! assert (isequal (infsup ./ infsup (0.1, 1.0), infsup)); %! assert (isequal (rdivide (infsup, infsup (0.1, 1.0)), infsup)); %!test %! assert (isequal (infsup ./ infsup (-1.0, -0.1), infsup)); %! assert (isequal (rdivide (infsup, infsup (-1.0, -0.1)), infsup)); %!test %! assert (isequal (infsup ./ infsup (-inf, inf), infsup)); %! assert (isequal (rdivide (infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup, infsup)); %! assert (isequal (rdivide (infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup, infsup)); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (infsup ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup, infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup, infsup)); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (infsup ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup, infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-5.0, -3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-5.0, -3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (3.0, 5.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (3.0, 5.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-inf, -3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-inf, -3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-3.0, 0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-3.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-3.0, -0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-3.0, -0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (0.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (0.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-inf, 0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-0.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-0.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-inf, -0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-inf, -0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (0.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-0.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, inf) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (-5.0, -3.0), infsup (3.0, 10.0))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (-5.0, -3.0)), infsup (3.0, 10.0))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (3.0, 5.0), infsup (-10.0, -3.0))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (3.0, 5.0)), infsup (-10.0, -3.0))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (-inf, -3.0), infsup (0.0, 10.0))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (-inf, -3.0)), infsup (0.0, 10.0))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (3.0, inf), infsup (-10.0, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (3.0, inf)), infsup (-10.0, 0.0))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (-3.0, 0.0), infsup (5.0, inf))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (-3.0, 0.0)), infsup (5.0, inf))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (-3.0, -0.0), infsup (5.0, inf))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (-3.0, -0.0)), infsup (5.0, inf))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (0.0, 3.0), infsup (-inf, -5.0))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (0.0, 3.0)), infsup (-inf, -5.0))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (-inf, 0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (-0.0, 3.0), infsup (-inf, -5.0))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (-0.0, 3.0)), infsup (-inf, -5.0))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (-inf, -0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (-inf, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (-0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (-0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-30.0, -15.0) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, -15.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (-5.0, -3.0), infsup (-5.0, 10.0))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (-5.0, -3.0)), infsup (-5.0, 10.0))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (3.0, 5.0), infsup (-10.0, 5.0))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (3.0, 5.0)), infsup (-10.0, 5.0))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (-inf, -3.0), infsup (-5.0, 10.0))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (-inf, -3.0)), infsup (-5.0, 10.0))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (3.0, inf), infsup (-10.0, 5.0))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (3.0, inf)), infsup (-10.0, 5.0))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (-3.0, 0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (-3.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (-3.0, -0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (-3.0, -0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (0.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (0.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (-inf, 0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (-0.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (-0.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (-inf, -0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (-inf, -0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (0.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (-0.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (-0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 15.0) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 15.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (-5.0, -3.0), infsup (-10.0, -3.0))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (-5.0, -3.0)), infsup (-10.0, -3.0))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (3.0, 5.0), infsup (3.0, 10.0))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (3.0, 5.0)), infsup (3.0, 10.0))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (-inf, -3.0), infsup (-10.0, 0.0))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (-inf, -3.0)), infsup (-10.0, 0.0))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (3.0, inf), infsup (0.0, 10.0))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (3.0, inf)), infsup (0.0, 10.0))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (-3.0, 0.0), infsup (-inf, -5.0))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (-3.0, 0.0)), infsup (-inf, -5.0))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (-3.0, -0.0), infsup (-inf, -5.0))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (-3.0, -0.0)), infsup (-inf, -5.0))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (0.0, 3.0), infsup (5.0, inf))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (0.0, 3.0)), infsup (5.0, inf))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (-inf, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (-0.0, 3.0), infsup (5.0, inf))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (-0.0, 3.0)), infsup (5.0, inf))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (-inf, -0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (-inf, -0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (-0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (15.0, 30.0) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (15.0, 30.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-5.0, -3.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-5.0, -3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (3.0, 5.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (3.0, 5.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-inf, -3.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-inf, -3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (3.0, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (3.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-3.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-3.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-3.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-3.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-3.0, 3.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-3.0, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (0.0, 3.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (0.0, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-inf, 0.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-inf, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-0.0, 3.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-0.0, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-inf, -0.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-inf, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-inf, 3.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-inf, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-3.0, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-3.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (0.0, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-0.0, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 0.0) ./ infsup (-inf, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (-5.0, -3.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (-5.0, -3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (3.0, 5.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (3.0, 5.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (-inf, -3.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (-inf, -3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (3.0, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (3.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (-3.0, 0.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (-3.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (-3.0, -0.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (-3.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (-3.0, 3.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (-3.0, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (0.0, 3.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (0.0, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (-inf, 0.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (-inf, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (-0.0, 3.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (-0.0, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (-inf, -0.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (-inf, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (-inf, 3.0), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (-inf, 3.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (-3.0, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (-3.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (0.0, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (-0.0, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (-0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, -0.0) ./ infsup (-inf, inf), infsup (0.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (-5.0, -3.0), infsup (3.0, inf))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (-5.0, -3.0)), infsup (3.0, inf))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (3.0, 5.0), infsup (-inf, -3.0))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (3.0, 5.0)), infsup (-inf, -3.0))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (-inf, -3.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (-inf, -3.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (3.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (3.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (-3.0, 0.0), infsup (5.0, inf))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (-3.0, 0.0)), infsup (5.0, inf))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (-3.0, -0.0), infsup (5.0, inf))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (-3.0, -0.0)), infsup (5.0, inf))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (0.0, 3.0), infsup (-inf, -5.0))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (0.0, 3.0)), infsup (-inf, -5.0))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (-inf, 0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (-0.0, 3.0), infsup (-inf, -5.0))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (-0.0, 3.0)), infsup (-inf, -5.0))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (-inf, -0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (-inf, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (-0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (-0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, -15.0) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, -15.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (-5.0, -3.0), infsup (-5.0, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (-5.0, -3.0)), infsup (-5.0, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (3.0, 5.0), infsup (-inf, 5.0))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (3.0, 5.0)), infsup (-inf, 5.0))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (-inf, -3.0), infsup (-5.0, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (-inf, -3.0)), infsup (-5.0, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (3.0, inf), infsup (-inf, 5.0))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (3.0, inf)), infsup (-inf, 5.0))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (-3.0, 0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (-3.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (-3.0, -0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (-3.0, -0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (0.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (0.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (-inf, 0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (-0.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (-0.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (-inf, -0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (-inf, -0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (0.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (-0.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (-0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 15.0) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 15.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (-5.0, -3.0), infsup (-inf, 5.0))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (-5.0, -3.0)), infsup (-inf, 5.0))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (3.0, 5.0), infsup (-5.0, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (3.0, 5.0)), infsup (-5.0, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (-inf, -3.0), infsup (-inf, 5.0))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (-inf, -3.0)), infsup (-inf, 5.0))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (3.0, inf), infsup (-5.0, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (3.0, inf)), infsup (-5.0, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (-3.0, 0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (-3.0, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (-3.0, -0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (-3.0, -0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (0.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (0.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (-inf, 0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (-0.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (-0.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (-inf, -0.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (-inf, -0.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (0.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (-0.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (-0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-15.0, inf) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-15.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (-5.0, -3.0), infsup (-inf, -3.0))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (-5.0, -3.0)), infsup (-inf, -3.0))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (3.0, 5.0), infsup (3.0, inf))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (3.0, 5.0)), infsup (3.0, inf))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (-inf, -3.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (-inf, -3.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (3.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (3.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (-3.0, 0.0), infsup (-inf, -5.0))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (-3.0, 0.0)), infsup (-inf, -5.0))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (-3.0, -0.0), infsup (-inf, -5.0))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (-3.0, -0.0)), infsup (-inf, -5.0))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (0.0, 3.0), infsup (5.0, inf))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (0.0, 3.0)), infsup (5.0, inf))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (-inf, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (-0.0, 3.0), infsup (5.0, inf))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (-0.0, 3.0)), infsup (5.0, inf))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (-inf, -0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (-inf, -0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (-0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (15.0, inf) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (15.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (-5.0, -3.0), infsup (0.0, 10.0))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (-5.0, -3.0)), infsup (0.0, 10.0))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (3.0, 5.0), infsup (-10.0, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (3.0, 5.0)), infsup (-10.0, 0.0))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (-inf, -3.0), infsup (0.0, 10.0))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (-inf, -3.0)), infsup (0.0, 10.0))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (3.0, inf), infsup (-10.0, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (3.0, inf)), infsup (-10.0, 0.0))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (-3.0, 0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (-3.0, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (-3.0, -0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (-3.0, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (0.0, 3.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (0.0, 3.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (-inf, 0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (-0.0, 3.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (-0.0, 3.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (-inf, -0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (-inf, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (-0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (-0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-30.0, 0.0) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (-5.0, -3.0), infsup (0.0, 10.0))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (-5.0, -3.0)), infsup (0.0, 10.0))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (3.0, 5.0), infsup (-10.0, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (3.0, 5.0)), infsup (-10.0, 0.0))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (-inf, -3.0), infsup (0.0, 10.0))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (-inf, -3.0)), infsup (0.0, 10.0))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (3.0, inf), infsup (-10.0, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (3.0, inf)), infsup (-10.0, 0.0))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (-3.0, 0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (-3.0, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (-3.0, -0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (-3.0, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (0.0, 3.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (0.0, 3.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (-inf, 0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (-0.0, 3.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (-0.0, 3.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (-inf, -0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (-inf, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (-0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (-0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-30.0, -0.0) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-30.0, -0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (-5.0, -3.0), infsup (-10.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (-5.0, -3.0)), infsup (-10.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (3.0, 5.0), infsup (0.0, 10.0))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (3.0, 5.0)), infsup (0.0, 10.0))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (-inf, -3.0), infsup (-10.0, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (-inf, -3.0)), infsup (-10.0, 0.0))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (3.0, inf), infsup (0.0, 10.0))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (3.0, inf)), infsup (0.0, 10.0))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (-3.0, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (-3.0, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (-3.0, -0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (-3.0, -0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (0.0, 3.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (0.0, 3.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (-inf, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (-0.0, 3.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (-0.0, 3.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (-inf, -0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (-inf, -0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (-0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, 30.0) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (0.0, 30.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (-5.0, -3.0), infsup (-10.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (-5.0, -3.0)), infsup (-10.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (3.0, 5.0), infsup (0.0, 10.0))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (3.0, 5.0)), infsup (0.0, 10.0))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (-inf, -3.0), infsup (-10.0, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (-inf, -3.0)), infsup (-10.0, 0.0))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (3.0, inf), infsup (0.0, 10.0))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (3.0, inf)), infsup (0.0, 10.0))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (-3.0, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (-3.0, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (-3.0, -0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (-3.0, -0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (0.0, 3.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (0.0, 3.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (-inf, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (-0.0, 3.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (-0.0, 3.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (-inf, -0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (-inf, -0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (-0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-0.0, 30.0) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-0.0, 30.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-5.0, -3.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-5.0, -3.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (3.0, 5.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (3.0, 5.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-inf, -3.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-inf, -3.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (3.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (3.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-3.0, 0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-3.0, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-3.0, -0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-3.0, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (0.0, 3.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (0.0, 3.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-inf, 0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-0.0, 3.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-0.0, 3.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-inf, -0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-inf, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, 0.0) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (-5.0, -3.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (-5.0, -3.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (3.0, 5.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (3.0, 5.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (-inf, -3.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (-inf, -3.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (3.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (3.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (-3.0, 0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (-3.0, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (-3.0, -0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (-3.0, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (0.0, 3.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (0.0, 3.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (-inf, 0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (-0.0, 3.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (-0.0, 3.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (-inf, -0.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (-inf, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (-0.0, inf), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (-0.0, inf)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-inf, -0.0) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-inf, -0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-5.0, -3.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-5.0, -3.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (3.0, 5.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (3.0, 5.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-inf, -3.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-inf, -3.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (3.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (3.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-3.0, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-3.0, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-3.0, -0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-3.0, -0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (0.0, 3.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (0.0, 3.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-inf, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-0.0, 3.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-0.0, 3.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-inf, -0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-inf, -0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (0.0, inf) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (-5.0, -3.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (-5.0, -3.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (3.0, 5.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (3.0, 5.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (-inf, -3.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (-inf, -3.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (3.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (3.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (-3.0, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (-3.0, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (-3.0, -0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (-3.0, -0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (-3.0, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (-3.0, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (0.0, 3.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (0.0, 3.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (-inf, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (-0.0, 3.0), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (-0.0, 3.0)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (-inf, -0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (-inf, -0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (-inf, 3.0), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (-inf, 3.0)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (-3.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (-3.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (-0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (infsup (-0.0, inf) ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (infsup (-0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (infsup (-2.0, -1.0) ./ infsup (-10.0, -3.0), infsup (9.999999999999999167e-02, 6.666666666666667407e-01))); %! assert (isequal (rdivide (infsup (-2.0, -1.0), infsup (-10.0, -3.0)), infsup (9.999999999999999167e-02, 6.666666666666667407e-01))); %!test %! assert (isequal (infsup (-2.0, -1.0) ./ infsup (0.0, 10.0), infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (rdivide (infsup (-2.0, -1.0), infsup (0.0, 10.0)), infsup (-inf, -9.999999999999999167e-02))); %!test %! assert (isequal (infsup (-2.0, -1.0) ./ infsup (-0.0, 10.0), infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (rdivide (infsup (-2.0, -1.0), infsup (-0.0, 10.0)), infsup (-inf, -9.999999999999999167e-02))); %!test %! assert (isequal (infsup (-1.0, 2.0) ./ infsup (10.0, inf), infsup (-1.000000000000000056e-01, 2.000000000000000111e-01))); %! assert (isequal (rdivide (infsup (-1.0, 2.0), infsup (10.0, inf)), infsup (-1.000000000000000056e-01, 2.000000000000000111e-01))); %!test %! assert (isequal (infsup (1.0, 3.0) ./ infsup (-inf, -10.0), infsup (-3.000000000000000444e-01, 0.0))); %! assert (isequal (rdivide (infsup (1.0, 3.0), infsup (-inf, -10.0)), infsup (-3.000000000000000444e-01, 0.0))); %!test %! assert (isequal (infsup (-inf, -1.0) ./ infsup (1.0, 3.0), infsup (-inf, -3.333333333333333148e-01))); %! assert (isequal (rdivide (infsup (-inf, -1.0), infsup (1.0, 3.0)), infsup (-inf, -3.333333333333333148e-01))); ## minimal_div_dec_test %!test %! assert (isequal (infsupdec (-2.0, -1.0, "com") ./ infsupdec (-10.0, -3.0, "com"), infsupdec (9.999999999999999167e-02, 6.666666666666667407e-01, "com"))); %! assert (isequal (decorationpart (infsupdec (-2.0, -1.0, "com") ./ infsupdec (-10.0, -3.0, "com")){1}, decorationpart (infsupdec (9.999999999999999167e-02, 6.666666666666667407e-01, "com")){1})); %! assert (isequal (rdivide (infsupdec (-2.0, -1.0, "com"), infsupdec (-10.0, -3.0, "com")), infsupdec (9.999999999999999167e-02, 6.666666666666667407e-01, "com"))); %! assert (isequal (decorationpart (rdivide (infsupdec (-2.0, -1.0, "com"), infsupdec (-10.0, -3.0, "com"))){1}, decorationpart (infsupdec (9.999999999999999167e-02, 6.666666666666667407e-01, "com")){1})); %!test %! assert (isequal (infsupdec (-200.0, -1.0, "com") ./ infsupdec (4.940656458412465442e-324, 10.0, "com"), infsupdec (-inf, -9.999999999999999167e-02, "dac"))); %! assert (isequal (decorationpart (infsupdec (-200.0, -1.0, "com") ./ infsupdec (4.940656458412465442e-324, 10.0, "com")){1}, decorationpart (infsupdec (-inf, -9.999999999999999167e-02, "dac")){1})); %! assert (isequal (rdivide (infsupdec (-200.0, -1.0, "com"), infsupdec (4.940656458412465442e-324, 10.0, "com")), infsupdec (-inf, -9.999999999999999167e-02, "dac"))); %! assert (isequal (decorationpart (rdivide (infsupdec (-200.0, -1.0, "com"), infsupdec (4.940656458412465442e-324, 10.0, "com"))){1}, decorationpart (infsupdec (-inf, -9.999999999999999167e-02, "dac")){1})); %!test %! assert (isequal (infsupdec (-2.0, -1.0, "com") ./ infsupdec (0.0, 10.0, "com"), infsupdec (-inf, -9.999999999999999167e-02, "trv"))); %! assert (isequal (decorationpart (infsupdec (-2.0, -1.0, "com") ./ infsupdec (0.0, 10.0, "com")){1}, decorationpart (infsupdec (-inf, -9.999999999999999167e-02, "trv")){1})); %! assert (isequal (rdivide (infsupdec (-2.0, -1.0, "com"), infsupdec (0.0, 10.0, "com")), infsupdec (-inf, -9.999999999999999167e-02, "trv"))); %! assert (isequal (decorationpart (rdivide (infsupdec (-2.0, -1.0, "com"), infsupdec (0.0, 10.0, "com"))){1}, decorationpart (infsupdec (-inf, -9.999999999999999167e-02, "trv")){1})); %!test %! assert (isequal (infsupdec (1.0, 3.0, "def") ./ infsupdec (-inf, -10.0, "dac"), infsupdec (-3.000000000000000444e-01, 0.0, "def"))); %! assert (isequal (decorationpart (infsupdec (1.0, 3.0, "def") ./ infsupdec (-inf, -10.0, "dac")){1}, decorationpart (infsupdec (-3.000000000000000444e-01, 0.0, "def")){1})); %! assert (isequal (rdivide (infsupdec (1.0, 3.0, "def"), infsupdec (-inf, -10.0, "dac")), infsupdec (-3.000000000000000444e-01, 0.0, "def"))); %! assert (isequal (decorationpart (rdivide (infsupdec (1.0, 3.0, "def"), infsupdec (-inf, -10.0, "dac"))){1}, decorationpart (infsupdec (-3.000000000000000444e-01, 0.0, "def")){1})); %!test %! assert (isequal (infsupdec (1.0, 2.0, "trv") ./ infsupdec (empty, "trv"), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (infsupdec (1.0, 2.0, "trv") ./ infsupdec (empty, "trv")){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (rdivide (infsupdec (1.0, 2.0, "trv"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (rdivide (infsupdec (1.0, 2.0, "trv"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); ## minimal_recip_test %!test %! assert (isequal (1 ./ infsup (-50.0, -10.0), infsup (-1.000000000000000056e-01, -1.999999999999999695e-02))); %! assert (isequal (rdivide (1, infsup (-50.0, -10.0)), infsup (-1.000000000000000056e-01, -1.999999999999999695e-02))); %! assert (isequal (pown (infsup (-50.0, -10.0), -1), infsup (-1.000000000000000056e-01, -1.999999999999999695e-02))); %! assert (isequal (infsup (-50.0, -10.0) .^ -1, infsup (-1.000000000000000056e-01, -1.999999999999999695e-02))); %! assert (isequal (power (infsup (-50.0, -10.0), -1), infsup (-1.000000000000000056e-01, -1.999999999999999695e-02))); %! assert (isequal (infsup (-50.0, -10.0) ^ -1, infsup (-1.000000000000000056e-01, -1.999999999999999695e-02))); %! assert (isequal (mpower (infsup (-50.0, -10.0), -1), infsup (-1.000000000000000056e-01, -1.999999999999999695e-02))); %!test %! assert (isequal (1 ./ infsup (10.0, 50.0), infsup (1.999999999999999695e-02, 1.000000000000000056e-01))); %! assert (isequal (rdivide (1, infsup (10.0, 50.0)), infsup (1.999999999999999695e-02, 1.000000000000000056e-01))); %! assert (isequal (pown (infsup (10.0, 50.0), -1), infsup (1.999999999999999695e-02, 1.000000000000000056e-01))); %! assert (isequal (infsup (10.0, 50.0) .^ -1, infsup (1.999999999999999695e-02, 1.000000000000000056e-01))); %! assert (isequal (power (infsup (10.0, 50.0), -1), infsup (1.999999999999999695e-02, 1.000000000000000056e-01))); %! assert (isequal (infsup (10.0, 50.0) ^ -1, infsup (1.999999999999999695e-02, 1.000000000000000056e-01))); %! assert (isequal (mpower (infsup (10.0, 50.0), -1), infsup (1.999999999999999695e-02, 1.000000000000000056e-01))); %!test %! assert (isequal (1 ./ infsup (-inf, -10.0), infsup (-1.000000000000000056e-01, 0.0))); %! assert (isequal (rdivide (1, infsup (-inf, -10.0)), infsup (-1.000000000000000056e-01, 0.0))); %! assert (isequal (pown (infsup (-inf, -10.0), -1), infsup (-1.000000000000000056e-01, 0.0))); %! assert (isequal (infsup (-inf, -10.0) .^ -1, infsup (-1.000000000000000056e-01, 0.0))); %! assert (isequal (power (infsup (-inf, -10.0), -1), infsup (-1.000000000000000056e-01, 0.0))); %! assert (isequal (infsup (-inf, -10.0) ^ -1, infsup (-1.000000000000000056e-01, 0.0))); %! assert (isequal (mpower (infsup (-inf, -10.0), -1), infsup (-1.000000000000000056e-01, 0.0))); %!test %! assert (isequal (1 ./ infsup (10.0, inf), infsup (0.0, 1.000000000000000056e-01))); %! assert (isequal (rdivide (1, infsup (10.0, inf)), infsup (0.0, 1.000000000000000056e-01))); %! assert (isequal (pown (infsup (10.0, inf), -1), infsup (0.0, 1.000000000000000056e-01))); %! assert (isequal (infsup (10.0, inf) .^ -1, infsup (0.0, 1.000000000000000056e-01))); %! assert (isequal (power (infsup (10.0, inf), -1), infsup (0.0, 1.000000000000000056e-01))); %! assert (isequal (infsup (10.0, inf) ^ -1, infsup (0.0, 1.000000000000000056e-01))); %! assert (isequal (mpower (infsup (10.0, inf), -1), infsup (0.0, 1.000000000000000056e-01))); %!test %! assert (isequal (1 ./ infsup (0.0, 0.0), infsup)); %! assert (isequal (rdivide (1, infsup (0.0, 0.0)), infsup)); %! assert (isequal (pown (infsup (0.0, 0.0), -1), infsup)); %! assert (isequal (infsup (0.0, 0.0) .^ -1, infsup)); %! assert (isequal (power (infsup (0.0, 0.0), -1), infsup)); %! assert (isequal (infsup (0.0, 0.0) ^ -1, infsup)); %! assert (isequal (mpower (infsup (0.0, 0.0), -1), infsup)); %!test %! assert (isequal (1 ./ infsup (-0.0, -0.0), infsup)); %! assert (isequal (rdivide (1, infsup (-0.0, -0.0)), infsup)); %! assert (isequal (pown (infsup (-0.0, -0.0), -1), infsup)); %! assert (isequal (infsup (-0.0, -0.0) .^ -1, infsup)); %! assert (isequal (power (infsup (-0.0, -0.0), -1), infsup)); %! assert (isequal (infsup (-0.0, -0.0) ^ -1, infsup)); %! assert (isequal (mpower (infsup (-0.0, -0.0), -1), infsup)); %!test %! assert (isequal (1 ./ infsup (-10.0, 0.0), infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (rdivide (1, infsup (-10.0, 0.0)), infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (pown (infsup (-10.0, 0.0), -1), infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (infsup (-10.0, 0.0) .^ -1, infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (power (infsup (-10.0, 0.0), -1), infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (infsup (-10.0, 0.0) ^ -1, infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (mpower (infsup (-10.0, 0.0), -1), infsup (-inf, -9.999999999999999167e-02))); %!test %! assert (isequal (1 ./ infsup (-10.0, -0.0), infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (rdivide (1, infsup (-10.0, -0.0)), infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (pown (infsup (-10.0, -0.0), -1), infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (infsup (-10.0, -0.0) .^ -1, infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (power (infsup (-10.0, -0.0), -1), infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (infsup (-10.0, -0.0) ^ -1, infsup (-inf, -9.999999999999999167e-02))); %! assert (isequal (mpower (infsup (-10.0, -0.0), -1), infsup (-inf, -9.999999999999999167e-02))); %!test %! assert (isequal (1 ./ infsup (-10.0, 10.0), infsup (-inf, inf))); %! assert (isequal (rdivide (1, infsup (-10.0, 10.0)), infsup (-inf, inf))); %! assert (isequal (pown (infsup (-10.0, 10.0), -1), infsup (-inf, inf))); %! assert (isequal (infsup (-10.0, 10.0) .^ -1, infsup (-inf, inf))); %! assert (isequal (power (infsup (-10.0, 10.0), -1), infsup (-inf, inf))); %! assert (isequal (infsup (-10.0, 10.0) ^ -1, infsup (-inf, inf))); %! assert (isequal (mpower (infsup (-10.0, 10.0), -1), infsup (-inf, inf))); %!test %! assert (isequal (1 ./ infsup (0.0, 10.0), infsup (9.999999999999999167e-02, inf))); %! assert (isequal (rdivide (1, infsup (0.0, 10.0)), infsup (9.999999999999999167e-02, inf))); %! assert (isequal (pown (infsup (0.0, 10.0), -1), infsup (9.999999999999999167e-02, inf))); %! assert (isequal (infsup (0.0, 10.0) .^ -1, infsup (9.999999999999999167e-02, inf))); %! assert (isequal (power (infsup (0.0, 10.0), -1), infsup (9.999999999999999167e-02, inf))); %! assert (isequal (infsup (0.0, 10.0) ^ -1, infsup (9.999999999999999167e-02, inf))); %! assert (isequal (mpower (infsup (0.0, 10.0), -1), infsup (9.999999999999999167e-02, inf))); %!test %! assert (isequal (1 ./ infsup (-0.0, 10.0), infsup (9.999999999999999167e-02, inf))); %! assert (isequal (rdivide (1, infsup (-0.0, 10.0)), infsup (9.999999999999999167e-02, inf))); %! assert (isequal (pown (infsup (-0.0, 10.0), -1), infsup (9.999999999999999167e-02, inf))); %! assert (isequal (infsup (-0.0, 10.0) .^ -1, infsup (9.999999999999999167e-02, inf))); %! assert (isequal (power (infsup (-0.0, 10.0), -1), infsup (9.999999999999999167e-02, inf))); %! assert (isequal (infsup (-0.0, 10.0) ^ -1, infsup (9.999999999999999167e-02, inf))); %! assert (isequal (mpower (infsup (-0.0, 10.0), -1), infsup (9.999999999999999167e-02, inf))); %!test %! assert (isequal (1 ./ infsup (-inf, 0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (1, infsup (-inf, 0.0)), infsup (-inf, 0.0))); %! assert (isequal (pown (infsup (-inf, 0.0), -1), infsup (-inf, 0.0))); %! assert (isequal (infsup (-inf, 0.0) .^ -1, infsup (-inf, 0.0))); %! assert (isequal (power (infsup (-inf, 0.0), -1), infsup (-inf, 0.0))); %! assert (isequal (infsup (-inf, 0.0) ^ -1, infsup (-inf, 0.0))); %! assert (isequal (mpower (infsup (-inf, 0.0), -1), infsup (-inf, 0.0))); %!test %! assert (isequal (1 ./ infsup (-inf, -0.0), infsup (-inf, 0.0))); %! assert (isequal (rdivide (1, infsup (-inf, -0.0)), infsup (-inf, 0.0))); %! assert (isequal (pown (infsup (-inf, -0.0), -1), infsup (-inf, 0.0))); %! assert (isequal (infsup (-inf, -0.0) .^ -1, infsup (-inf, 0.0))); %! assert (isequal (power (infsup (-inf, -0.0), -1), infsup (-inf, 0.0))); %! assert (isequal (infsup (-inf, -0.0) ^ -1, infsup (-inf, 0.0))); %! assert (isequal (mpower (infsup (-inf, -0.0), -1), infsup (-inf, 0.0))); %!test %! assert (isequal (1 ./ infsup (-inf, 10.0), infsup (-inf, inf))); %! assert (isequal (rdivide (1, infsup (-inf, 10.0)), infsup (-inf, inf))); %! assert (isequal (pown (infsup (-inf, 10.0), -1), infsup (-inf, inf))); %! assert (isequal (infsup (-inf, 10.0) .^ -1, infsup (-inf, inf))); %! assert (isequal (power (infsup (-inf, 10.0), -1), infsup (-inf, inf))); %! assert (isequal (infsup (-inf, 10.0) ^ -1, infsup (-inf, inf))); %! assert (isequal (mpower (infsup (-inf, 10.0), -1), infsup (-inf, inf))); %!test %! assert (isequal (1 ./ infsup (-10.0, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (1, infsup (-10.0, inf)), infsup (-inf, inf))); %! assert (isequal (pown (infsup (-10.0, inf), -1), infsup (-inf, inf))); %! assert (isequal (infsup (-10.0, inf) .^ -1, infsup (-inf, inf))); %! assert (isequal (power (infsup (-10.0, inf), -1), infsup (-inf, inf))); %! assert (isequal (infsup (-10.0, inf) ^ -1, infsup (-inf, inf))); %! assert (isequal (mpower (infsup (-10.0, inf), -1), infsup (-inf, inf))); %!test %! assert (isequal (1 ./ infsup (0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (1, infsup (0.0, inf)), infsup (0.0, inf))); %! assert (isequal (pown (infsup (0.0, inf), -1), infsup (0.0, inf))); %! assert (isequal (infsup (0.0, inf) .^ -1, infsup (0.0, inf))); %! assert (isequal (power (infsup (0.0, inf), -1), infsup (0.0, inf))); %! assert (isequal (infsup (0.0, inf) ^ -1, infsup (0.0, inf))); %! assert (isequal (mpower (infsup (0.0, inf), -1), infsup (0.0, inf))); %!test %! assert (isequal (1 ./ infsup (-0.0, inf), infsup (0.0, inf))); %! assert (isequal (rdivide (1, infsup (-0.0, inf)), infsup (0.0, inf))); %! assert (isequal (pown (infsup (-0.0, inf), -1), infsup (0.0, inf))); %! assert (isequal (infsup (-0.0, inf) .^ -1, infsup (0.0, inf))); %! assert (isequal (power (infsup (-0.0, inf), -1), infsup (0.0, inf))); %! assert (isequal (infsup (-0.0, inf) ^ -1, infsup (0.0, inf))); %! assert (isequal (mpower (infsup (-0.0, inf), -1), infsup (0.0, inf))); %!test %! assert (isequal (1 ./ infsup (-inf, inf), infsup (-inf, inf))); %! assert (isequal (rdivide (1, infsup (-inf, inf)), infsup (-inf, inf))); %! assert (isequal (pown (infsup (-inf, inf), -1), infsup (-inf, inf))); %! assert (isequal (infsup (-inf, inf) .^ -1, infsup (-inf, inf))); %! assert (isequal (power (infsup (-inf, inf), -1), infsup (-inf, inf))); %! assert (isequal (infsup (-inf, inf) ^ -1, infsup (-inf, inf))); %! assert (isequal (mpower (infsup (-inf, inf), -1), infsup (-inf, inf))); ## minimal_recip_dec_test %!test %! assert (isequal (1 ./ infsupdec (10.0, 50.0, "com"), infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com"))); %! assert (isequal (decorationpart (1 ./ infsupdec (10.0, 50.0, "com")){1}, decorationpart (infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com")){1})); %! assert (isequal (rdivide (1, infsupdec (10.0, 50.0, "com")), infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com"))); %! assert (isequal (decorationpart (rdivide (1, infsupdec (10.0, 50.0, "com"))){1}, decorationpart (infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com")){1})); %! assert (isequal (pown (infsupdec (10.0, 50.0, "com"), -1), infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com"))); %! assert (isequal (decorationpart (pown (infsupdec (10.0, 50.0, "com"), -1)){1}, decorationpart (infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com")){1})); %! assert (isequal (infsupdec (10.0, 50.0, "com") .^ -1, infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com"))); %! assert (isequal (decorationpart (infsupdec (10.0, 50.0, "com") .^ -1){1}, decorationpart (infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com")){1})); %! assert (isequal (power (infsupdec (10.0, 50.0, "com"), -1), infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com"))); %! assert (isequal (decorationpart (power (infsupdec (10.0, 50.0, "com"), -1)){1}, decorationpart (infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com")){1})); %! assert (isequal (infsupdec (10.0, 50.0, "com") ^ -1, infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com"))); %! assert (isequal (decorationpart (infsupdec (10.0, 50.0, "com") ^ -1){1}, decorationpart (infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com")){1})); %! assert (isequal (mpower (infsupdec (10.0, 50.0, "com"), -1), infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com"))); %! assert (isequal (decorationpart (mpower (infsupdec (10.0, 50.0, "com"), -1)){1}, decorationpart (infsupdec (1.999999999999999695e-02, 1.000000000000000056e-01, "com")){1})); %!test %! assert (isequal (1 ./ infsupdec (-inf, -10.0, "dac"), infsupdec (-1.000000000000000056e-01, 0.0, "dac"))); %! assert (isequal (decorationpart (1 ./ infsupdec (-inf, -10.0, "dac")){1}, decorationpart (infsupdec (-1.000000000000000056e-01, 0.0, "dac")){1})); %! assert (isequal (rdivide (1, infsupdec (-inf, -10.0, "dac")), infsupdec (-1.000000000000000056e-01, 0.0, "dac"))); %! assert (isequal (decorationpart (rdivide (1, infsupdec (-inf, -10.0, "dac"))){1}, decorationpart (infsupdec (-1.000000000000000056e-01, 0.0, "dac")){1})); %! assert (isequal (pown (infsupdec (-inf, -10.0, "dac"), -1), infsupdec (-1.000000000000000056e-01, 0.0, "dac"))); %! assert (isequal (decorationpart (pown (infsupdec (-inf, -10.0, "dac"), -1)){1}, decorationpart (infsupdec (-1.000000000000000056e-01, 0.0, "dac")){1})); %! assert (isequal (infsupdec (-inf, -10.0, "dac") .^ -1, infsupdec (-1.000000000000000056e-01, 0.0, "dac"))); %! assert (isequal (decorationpart (infsupdec (-inf, -10.0, "dac") .^ -1){1}, decorationpart (infsupdec (-1.000000000000000056e-01, 0.0, "dac")){1})); %! assert (isequal (power (infsupdec (-inf, -10.0, "dac"), -1), infsupdec (-1.000000000000000056e-01, 0.0, "dac"))); %! assert (isequal (decorationpart (power (infsupdec (-inf, -10.0, "dac"), -1)){1}, decorationpart (infsupdec (-1.000000000000000056e-01, 0.0, "dac")){1})); %! assert (isequal (infsupdec (-inf, -10.0, "dac") ^ -1, infsupdec (-1.000000000000000056e-01, 0.0, "dac"))); %! assert (isequal (decorationpart (infsupdec (-inf, -10.0, "dac") ^ -1){1}, decorationpart (infsupdec (-1.000000000000000056e-01, 0.0, "dac")){1})); %! assert (isequal (mpower (infsupdec (-inf, -10.0, "dac"), -1), infsupdec (-1.000000000000000056e-01, 0.0, "dac"))); %! assert (isequal (decorationpart (mpower (infsupdec (-inf, -10.0, "dac"), -1)){1}, decorationpart (infsupdec (-1.000000000000000056e-01, 0.0, "dac")){1})); %!test %! assert (isequal (1 ./ infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def"), infsupdec (-inf, -5.562684646268003458e-309, "def"))); %! assert (isequal (decorationpart (1 ./ infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def")){1}, decorationpart (infsupdec (-inf, -5.562684646268003458e-309, "def")){1})); %! assert (isequal (rdivide (1, infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def")), infsupdec (-inf, -5.562684646268003458e-309, "def"))); %! assert (isequal (decorationpart (rdivide (1, infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def"))){1}, decorationpart (infsupdec (-inf, -5.562684646268003458e-309, "def")){1})); %! assert (isequal (pown (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def"), -1), infsupdec (-inf, -5.562684646268003458e-309, "def"))); %! assert (isequal (decorationpart (pown (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def"), -1)){1}, decorationpart (infsupdec (-inf, -5.562684646268003458e-309, "def")){1})); %! assert (isequal (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def") .^ -1, infsupdec (-inf, -5.562684646268003458e-309, "def"))); %! assert (isequal (decorationpart (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def") .^ -1){1}, decorationpart (infsupdec (-inf, -5.562684646268003458e-309, "def")){1})); %! assert (isequal (power (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def"), -1), infsupdec (-inf, -5.562684646268003458e-309, "def"))); %! assert (isequal (decorationpart (power (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def"), -1)){1}, decorationpart (infsupdec (-inf, -5.562684646268003458e-309, "def")){1})); %! assert (isequal (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def") ^ -1, infsupdec (-inf, -5.562684646268003458e-309, "def"))); %! assert (isequal (decorationpart (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def") ^ -1){1}, decorationpart (infsupdec (-inf, -5.562684646268003458e-309, "def")){1})); %! assert (isequal (mpower (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def"), -1), infsupdec (-inf, -5.562684646268003458e-309, "def"))); %! assert (isequal (decorationpart (mpower (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "def"), -1)){1}, decorationpart (infsupdec (-inf, -5.562684646268003458e-309, "def")){1})); %!test %! assert (isequal (1 ./ infsupdec (0.0, 0.0, "com"), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (1 ./ infsupdec (0.0, 0.0, "com")){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (rdivide (1, infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (rdivide (1, infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (pown (infsupdec (0.0, 0.0, "com"), -1), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pown (infsupdec (0.0, 0.0, "com"), -1)){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (infsupdec (0.0, 0.0, "com") .^ -1, infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (infsupdec (0.0, 0.0, "com") .^ -1){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (power (infsupdec (0.0, 0.0, "com"), -1), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (power (infsupdec (0.0, 0.0, "com"), -1)){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (infsupdec (0.0, 0.0, "com") ^ -1, infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (infsupdec (0.0, 0.0, "com") ^ -1){1}, decorationpart (infsupdec (empty, "trv")){1})); %! assert (isequal (mpower (infsupdec (0.0, 0.0, "com"), -1), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (mpower (infsupdec (0.0, 0.0, "com"), -1)){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (1 ./ infsupdec (-10.0, 0.0, "com"), infsupdec (-inf, -9.999999999999999167e-02, "trv"))); %! assert (isequal (decorationpart (1 ./ infsupdec (-10.0, 0.0, "com")){1}, decorationpart (infsupdec (-inf, -9.999999999999999167e-02, "trv")){1})); %! assert (isequal (rdivide (1, infsupdec (-10.0, 0.0, "com")), infsupdec (-inf, -9.999999999999999167e-02, "trv"))); %! assert (isequal (decorationpart (rdivide (1, infsupdec (-10.0, 0.0, "com"))){1}, decorationpart (infsupdec (-inf, -9.999999999999999167e-02, "trv")){1})); %! assert (isequal (pown (infsupdec (-10.0, 0.0, "com"), -1), infsupdec (-inf, -9.999999999999999167e-02, "trv"))); %! assert (isequal (decorationpart (pown (infsupdec (-10.0, 0.0, "com"), -1)){1}, decorationpart (infsupdec (-inf, -9.999999999999999167e-02, "trv")){1})); %! assert (isequal (infsupdec (-10.0, 0.0, "com") .^ -1, infsupdec (-inf, -9.999999999999999167e-02, "trv"))); %! assert (isequal (decorationpart (infsupdec (-10.0, 0.0, "com") .^ -1){1}, decorationpart (infsupdec (-inf, -9.999999999999999167e-02, "trv")){1})); %! assert (isequal (power (infsupdec (-10.0, 0.0, "com"), -1), infsupdec (-inf, -9.999999999999999167e-02, "trv"))); %! assert (isequal (decorationpart (power (infsupdec (-10.0, 0.0, "com"), -1)){1}, decorationpart (infsupdec (-inf, -9.999999999999999167e-02, "trv")){1})); %! assert (isequal (infsupdec (-10.0, 0.0, "com") ^ -1, infsupdec (-inf, -9.999999999999999167e-02, "trv"))); %! assert (isequal (decorationpart (infsupdec (-10.0, 0.0, "com") ^ -1){1}, decorationpart (infsupdec (-inf, -9.999999999999999167e-02, "trv")){1})); %! assert (isequal (mpower (infsupdec (-10.0, 0.0, "com"), -1), infsupdec (-inf, -9.999999999999999167e-02, "trv"))); %! assert (isequal (decorationpart (mpower (infsupdec (-10.0, 0.0, "com"), -1)){1}, decorationpart (infsupdec (-inf, -9.999999999999999167e-02, "trv")){1})); %!test %! assert (isequal (1 ./ infsupdec (-10.0, inf, "dac"), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (1 ./ infsupdec (-10.0, inf, "dac")){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (rdivide (1, infsupdec (-10.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (rdivide (1, infsupdec (-10.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (pown (infsupdec (-10.0, inf, "dac"), -1), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pown (infsupdec (-10.0, inf, "dac"), -1)){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (infsupdec (-10.0, inf, "dac") .^ -1, infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (infsupdec (-10.0, inf, "dac") .^ -1){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (power (infsupdec (-10.0, inf, "dac"), -1), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (power (infsupdec (-10.0, inf, "dac"), -1)){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (infsupdec (-10.0, inf, "dac") ^ -1, infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (infsupdec (-10.0, inf, "dac") ^ -1){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (mpower (infsupdec (-10.0, inf, "dac"), -1), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (mpower (infsupdec (-10.0, inf, "dac"), -1)){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (1 ./ infsupdec (-0.0, inf, "dac"), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (1 ./ infsupdec (-0.0, inf, "dac")){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %! assert (isequal (rdivide (1, infsupdec (-0.0, inf, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (rdivide (1, infsupdec (-0.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %! assert (isequal (pown (infsupdec (-0.0, inf, "dac"), -1), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pown (infsupdec (-0.0, inf, "dac"), -1)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %! assert (isequal (infsupdec (-0.0, inf, "dac") .^ -1, infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (infsupdec (-0.0, inf, "dac") .^ -1){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %! assert (isequal (power (infsupdec (-0.0, inf, "dac"), -1), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (power (infsupdec (-0.0, inf, "dac"), -1)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %! assert (isequal (infsupdec (-0.0, inf, "dac") ^ -1, infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (infsupdec (-0.0, inf, "dac") ^ -1){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %! assert (isequal (mpower (infsupdec (-0.0, inf, "dac"), -1), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (mpower (infsupdec (-0.0, inf, "dac"), -1)){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (1 ./ infsupdec (entire, "def"), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (1 ./ infsupdec (entire, "def")){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (rdivide (1, infsupdec (entire, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (rdivide (1, infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (pown (infsupdec (entire, "def"), -1), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pown (infsupdec (entire, "def"), -1)){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (infsupdec (entire, "def") .^ -1, infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (infsupdec (entire, "def") .^ -1){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (power (infsupdec (entire, "def"), -1), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (power (infsupdec (entire, "def"), -1)){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (infsupdec (entire, "def") ^ -1, infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (infsupdec (entire, "def") ^ -1){1}, decorationpart (infsupdec (entire, "trv")){1})); %! assert (isequal (mpower (infsupdec (entire, "def"), -1), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (mpower (infsupdec (entire, "def"), -1)){1}, decorationpart (infsupdec (entire, "trv")){1})); ## minimal_sqr_test %!test %! assert (isequal (pown (infsup, 2), infsup)); %! assert (isequal (infsup .^ 2, infsup)); %! assert (isequal (power (infsup, 2), infsup)); %! assert (isequal (infsup ^ 2, infsup)); %! assert (isequal (mpower (infsup, 2), infsup)); %!test %! assert (isequal (pown (infsup (-inf, inf), 2), infsup (0.0, inf))); %! assert (isequal (infsup (-inf, inf) .^ 2, infsup (0.0, inf))); %! assert (isequal (power (infsup (-inf, inf), 2), infsup (0.0, inf))); %! assert (isequal (infsup (-inf, inf) ^ 2, infsup (0.0, inf))); %! assert (isequal (mpower (infsup (-inf, inf), 2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, -4.940656458412465442e-324), 2), infsup (0.0, inf))); %! assert (isequal (infsup (-inf, -4.940656458412465442e-324) .^ 2, infsup (0.0, inf))); %! assert (isequal (power (infsup (-inf, -4.940656458412465442e-324), 2), infsup (0.0, inf))); %! assert (isequal (infsup (-inf, -4.940656458412465442e-324) ^ 2, infsup (0.0, inf))); %! assert (isequal (mpower (infsup (-inf, -4.940656458412465442e-324), 2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-1.0, 1.0), 2), infsup (0.0, 1.0))); %! assert (isequal (infsup (-1.0, 1.0) .^ 2, infsup (0.0, 1.0))); %! assert (isequal (power (infsup (-1.0, 1.0), 2), infsup (0.0, 1.0))); %! assert (isequal (infsup (-1.0, 1.0) ^ 2, infsup (0.0, 1.0))); %! assert (isequal (mpower (infsup (-1.0, 1.0), 2), infsup (0.0, 1.0))); %!test %! assert (isequal (pown (infsup (0.0, 1.0), 2), infsup (0.0, 1.0))); %! assert (isequal (infsup (0.0, 1.0) .^ 2, infsup (0.0, 1.0))); %! assert (isequal (power (infsup (0.0, 1.0), 2), infsup (0.0, 1.0))); %! assert (isequal (infsup (0.0, 1.0) ^ 2, infsup (0.0, 1.0))); %! assert (isequal (mpower (infsup (0.0, 1.0), 2), infsup (0.0, 1.0))); %!test %! assert (isequal (pown (infsup (-0.0, 1.0), 2), infsup (0.0, 1.0))); %! assert (isequal (infsup (-0.0, 1.0) .^ 2, infsup (0.0, 1.0))); %! assert (isequal (power (infsup (-0.0, 1.0), 2), infsup (0.0, 1.0))); %! assert (isequal (infsup (-0.0, 1.0) ^ 2, infsup (0.0, 1.0))); %! assert (isequal (mpower (infsup (-0.0, 1.0), 2), infsup (0.0, 1.0))); %!test %! assert (isequal (pown (infsup (-5.0, 3.0), 2), infsup (0.0, 25.0))); %! assert (isequal (infsup (-5.0, 3.0) .^ 2, infsup (0.0, 25.0))); %! assert (isequal (power (infsup (-5.0, 3.0), 2), infsup (0.0, 25.0))); %! assert (isequal (infsup (-5.0, 3.0) ^ 2, infsup (0.0, 25.0))); %! assert (isequal (mpower (infsup (-5.0, 3.0), 2), infsup (0.0, 25.0))); %!test %! assert (isequal (pown (infsup (-5.0, 0.0), 2), infsup (0.0, 25.0))); %! assert (isequal (infsup (-5.0, 0.0) .^ 2, infsup (0.0, 25.0))); %! assert (isequal (power (infsup (-5.0, 0.0), 2), infsup (0.0, 25.0))); %! assert (isequal (infsup (-5.0, 0.0) ^ 2, infsup (0.0, 25.0))); %! assert (isequal (mpower (infsup (-5.0, 0.0), 2), infsup (0.0, 25.0))); %!test %! assert (isequal (pown (infsup (-5.0, -0.0), 2), infsup (0.0, 25.0))); %! assert (isequal (infsup (-5.0, -0.0) .^ 2, infsup (0.0, 25.0))); %! assert (isequal (power (infsup (-5.0, -0.0), 2), infsup (0.0, 25.0))); %! assert (isequal (infsup (-5.0, -0.0) ^ 2, infsup (0.0, 25.0))); %! assert (isequal (mpower (infsup (-5.0, -0.0), 2), infsup (0.0, 25.0))); %!test %! assert (isequal (pown (infsup (1.000000000000000056e-01, 1.000000000000000056e-01), 2), infsup (1.000000000000000021e-02, 1.000000000000000194e-02))); %! assert (isequal (infsup (1.000000000000000056e-01, 1.000000000000000056e-01) .^ 2, infsup (1.000000000000000021e-02, 1.000000000000000194e-02))); %! assert (isequal (power (infsup (1.000000000000000056e-01, 1.000000000000000056e-01), 2), infsup (1.000000000000000021e-02, 1.000000000000000194e-02))); %! assert (isequal (infsup (1.000000000000000056e-01, 1.000000000000000056e-01) ^ 2, infsup (1.000000000000000021e-02, 1.000000000000000194e-02))); %! assert (isequal (mpower (infsup (1.000000000000000056e-01, 1.000000000000000056e-01), 2), infsup (1.000000000000000021e-02, 1.000000000000000194e-02))); %!test %! assert (isequal (pown (infsup (-1.999999999999996447e+00, 1.000000000000000056e-01), 2), infsup (0.0, 3.999999999999986233e+00))); %! assert (isequal (infsup (-1.999999999999996447e+00, 1.000000000000000056e-01) .^ 2, infsup (0.0, 3.999999999999986233e+00))); %! assert (isequal (power (infsup (-1.999999999999996447e+00, 1.000000000000000056e-01), 2), infsup (0.0, 3.999999999999986233e+00))); %! assert (isequal (infsup (-1.999999999999996447e+00, 1.000000000000000056e-01) ^ 2, infsup (0.0, 3.999999999999986233e+00))); %! assert (isequal (mpower (infsup (-1.999999999999996447e+00, 1.000000000000000056e-01), 2), infsup (0.0, 3.999999999999986233e+00))); %!test %! assert (isequal (pown (infsup (-1.999999999999996447e+00, -1.999999999999996447e+00), 2), infsup (3.999999999999985789e+00, 3.999999999999986233e+00))); %! assert (isequal (infsup (-1.999999999999996447e+00, -1.999999999999996447e+00) .^ 2, infsup (3.999999999999985789e+00, 3.999999999999986233e+00))); %! assert (isequal (power (infsup (-1.999999999999996447e+00, -1.999999999999996447e+00), 2), infsup (3.999999999999985789e+00, 3.999999999999986233e+00))); %! assert (isequal (infsup (-1.999999999999996447e+00, -1.999999999999996447e+00) ^ 2, infsup (3.999999999999985789e+00, 3.999999999999986233e+00))); %! assert (isequal (mpower (infsup (-1.999999999999996447e+00, -1.999999999999996447e+00), 2), infsup (3.999999999999985789e+00, 3.999999999999986233e+00))); ## minimal_sqr_dec_test %!test %! assert (isequal (pown (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "com"), 2), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (pown (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "com"), 2)){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %! assert (isequal (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "com") .^ 2, infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "com") .^ 2){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %! assert (isequal (power (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "com"), 2), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (power (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "com"), 2)){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %! assert (isequal (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "com") ^ 2, infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "com") ^ 2){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %! assert (isequal (mpower (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "com"), 2), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (mpower (infsupdec (-1.797693134862315708e+308, -4.940656458412465442e-324, "com"), 2)){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %!test %! assert (isequal (pown (infsupdec (-1.0, 1.0, "def"), 2), infsupdec (0.0, 1.0, "def"))); %! assert (isequal (decorationpart (pown (infsupdec (-1.0, 1.0, "def"), 2)){1}, decorationpart (infsupdec (0.0, 1.0, "def")){1})); %! assert (isequal (infsupdec (-1.0, 1.0, "def") .^ 2, infsupdec (0.0, 1.0, "def"))); %! assert (isequal (decorationpart (infsupdec (-1.0, 1.0, "def") .^ 2){1}, decorationpart (infsupdec (0.0, 1.0, "def")){1})); %! assert (isequal (power (infsupdec (-1.0, 1.0, "def"), 2), infsupdec (0.0, 1.0, "def"))); %! assert (isequal (decorationpart (power (infsupdec (-1.0, 1.0, "def"), 2)){1}, decorationpart (infsupdec (0.0, 1.0, "def")){1})); %! assert (isequal (infsupdec (-1.0, 1.0, "def") ^ 2, infsupdec (0.0, 1.0, "def"))); %! assert (isequal (decorationpart (infsupdec (-1.0, 1.0, "def") ^ 2){1}, decorationpart (infsupdec (0.0, 1.0, "def")){1})); %! assert (isequal (mpower (infsupdec (-1.0, 1.0, "def"), 2), infsupdec (0.0, 1.0, "def"))); %! assert (isequal (decorationpart (mpower (infsupdec (-1.0, 1.0, "def"), 2)){1}, decorationpart (infsupdec (0.0, 1.0, "def")){1})); %!test %! assert (isequal (pown (infsupdec (-5.0, 3.0, "com"), 2), infsupdec (0.0, 25.0, "com"))); %! assert (isequal (decorationpart (pown (infsupdec (-5.0, 3.0, "com"), 2)){1}, decorationpart (infsupdec (0.0, 25.0, "com")){1})); %! assert (isequal (infsupdec (-5.0, 3.0, "com") .^ 2, infsupdec (0.0, 25.0, "com"))); %! assert (isequal (decorationpart (infsupdec (-5.0, 3.0, "com") .^ 2){1}, decorationpart (infsupdec (0.0, 25.0, "com")){1})); %! assert (isequal (power (infsupdec (-5.0, 3.0, "com"), 2), infsupdec (0.0, 25.0, "com"))); %! assert (isequal (decorationpart (power (infsupdec (-5.0, 3.0, "com"), 2)){1}, decorationpart (infsupdec (0.0, 25.0, "com")){1})); %! assert (isequal (infsupdec (-5.0, 3.0, "com") ^ 2, infsupdec (0.0, 25.0, "com"))); %! assert (isequal (decorationpart (infsupdec (-5.0, 3.0, "com") ^ 2){1}, decorationpart (infsupdec (0.0, 25.0, "com")){1})); %! assert (isequal (mpower (infsupdec (-5.0, 3.0, "com"), 2), infsupdec (0.0, 25.0, "com"))); %! assert (isequal (decorationpart (mpower (infsupdec (-5.0, 3.0, "com"), 2)){1}, decorationpart (infsupdec (0.0, 25.0, "com")){1})); %!test %! assert (isequal (pown (infsupdec (1.000000000000000056e-01, 1.000000000000000056e-01, "com"), 2), infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "com"))); %! assert (isequal (decorationpart (pown (infsupdec (1.000000000000000056e-01, 1.000000000000000056e-01, "com"), 2)){1}, decorationpart (infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "com")){1})); %! assert (isequal (infsupdec (1.000000000000000056e-01, 1.000000000000000056e-01, "com") .^ 2, infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "com"))); %! assert (isequal (decorationpart (infsupdec (1.000000000000000056e-01, 1.000000000000000056e-01, "com") .^ 2){1}, decorationpart (infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "com")){1})); %! assert (isequal (power (infsupdec (1.000000000000000056e-01, 1.000000000000000056e-01, "com"), 2), infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "com"))); %! assert (isequal (decorationpart (power (infsupdec (1.000000000000000056e-01, 1.000000000000000056e-01, "com"), 2)){1}, decorationpart (infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "com")){1})); %! assert (isequal (infsupdec (1.000000000000000056e-01, 1.000000000000000056e-01, "com") ^ 2, infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "com"))); %! assert (isequal (decorationpart (infsupdec (1.000000000000000056e-01, 1.000000000000000056e-01, "com") ^ 2){1}, decorationpart (infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "com")){1})); %! assert (isequal (mpower (infsupdec (1.000000000000000056e-01, 1.000000000000000056e-01, "com"), 2), infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "com"))); %! assert (isequal (decorationpart (mpower (infsupdec (1.000000000000000056e-01, 1.000000000000000056e-01, "com"), 2)){1}, decorationpart (infsupdec (1.000000000000000021e-02, 1.000000000000000194e-02, "com")){1})); ## minimal_sqrt_test %!test %! assert (isequal (realsqrt (infsup), infsup)); %!test %! assert (isequal (realsqrt (infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (realsqrt (infsup (-inf, -4.940656458412465442e-324)), infsup)); %!test %! assert (isequal (realsqrt (infsup (-1.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (realsqrt (infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (realsqrt (infsup (-0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (realsqrt (infsup (-5.0, 25.0)), infsup (0.0, 5.0))); %!test %! assert (isequal (realsqrt (infsup (0.0, 25.0)), infsup (0.0, 5.0))); %!test %! assert (isequal (realsqrt (infsup (-0.0, 25.0)), infsup (0.0, 5.0))); %!test %! assert (isequal (realsqrt (infsup (-5.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (realsqrt (infsup (1.000000000000000056e-01, 1.000000000000000056e-01)), infsup (3.162277660168379412e-01, 3.162277660168379967e-01))); %!test %! assert (isequal (realsqrt (infsup (-1.999999999999996447e+00, 1.000000000000000056e-01)), infsup (0.0, 3.162277660168379967e-01))); %!test %! assert (isequal (realsqrt (infsup (1.000000000000000056e-01, 1.999999999999996447e+00)), infsup (3.162277660168379412e-01, 1.414213562373093813e+00))); ## minimal_sqrt_dec_test %!test %! assert (isequal (realsqrt (infsupdec (1.0, 4.0, "com")), infsupdec (1.0, 2.0, "com"))); %! assert (isequal (decorationpart (realsqrt (infsupdec (1.0, 4.0, "com"))){1}, decorationpart (infsupdec (1.0, 2.0, "com")){1})); %!test %! assert (isequal (realsqrt (infsupdec (-5.0, 25.0, "com")), infsupdec (0.0, 5.0, "trv"))); %! assert (isequal (decorationpart (realsqrt (infsupdec (-5.0, 25.0, "com"))){1}, decorationpart (infsupdec (0.0, 5.0, "trv")){1})); %!test %! assert (isequal (realsqrt (infsupdec (0.0, 25.0, "def")), infsupdec (0.0, 5.0, "def"))); %! assert (isequal (decorationpart (realsqrt (infsupdec (0.0, 25.0, "def"))){1}, decorationpart (infsupdec (0.0, 5.0, "def")){1})); %!test %! assert (isequal (realsqrt (infsupdec (-5.0, inf, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (realsqrt (infsupdec (-5.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); ## minimal_fma_test %!test %! assert (isequal (fma (infsup, infsup, infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 1.0), infsup, infsup), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-1.0, 1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup, infsup), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup, infsup), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup, infsup), infsup)); %!test %! assert (isequal (fma (infsup, infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (1.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (1.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (1.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (1.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (1.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (1.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (1.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (1.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (1.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (1.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (1.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (1.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (1.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (1.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (1.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (1.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, -1.0), infsup), infsup)); %!#min max %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-10.0, 2.0), infsup (-5.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-1.0, 10.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-2.0, 2.0), infsup (-5.0, 3.0), infsup), infsup)); %!#end min max %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (1.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (1.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (1.0, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, -1.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, 3.0), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (1.0, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (fma (infsup, infsup, infsup (-inf, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 1.0), infsup, infsup (-inf, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-1.0, 1.0), infsup (-inf, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-inf, inf), infsup (-inf, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup, infsup (-inf, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup, infsup (-inf, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup, infsup (-inf, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (0.0, 0.0), infsup (-inf, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-0.0, -0.0), infsup (-inf, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (0.0, 0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-0.0, -0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, -1.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (1.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, -1.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (1.0, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (0.0, 0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-0.0, -0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, -1.0), infsup (-inf, 2.0)), infsup (-inf, 1.0))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (1.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, -1.0), infsup (-inf, 2.0)), infsup (-inf, 1.0))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (1.0, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (0.0, 0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-0.0, -0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, -1.0), infsup (-inf, 2.0)), infsup (-inf, 7.0))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (1.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, -1.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (1.0, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (0.0, 0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-0.0, -0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, -1.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (1.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, 11.0))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, -1.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (1.0, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (0.0, 0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-0.0, -0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, -1.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (1.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, -1.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (1.0, inf), infsup (-inf, 2.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (0.0, 0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-0.0, -0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, -1.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (1.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, -1.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, 3.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, inf), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (1.0, inf), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, inf), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (0.0, 0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-0.0, -0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, -1.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (1.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, -1.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, 3.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, inf), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (1.0, inf), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, inf), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (0.0, 0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-0.0, -0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, -1.0), infsup (-inf, 2.0)), infsup (-inf, 1.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, 17.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (1.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, 17.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, -1.0), infsup (-inf, 2.0)), infsup (-inf, 1.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, 3.0), infsup (-inf, 2.0)), infsup (-inf, 17.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (1.0, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (0.0, 0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-0.0, -0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, -1.0), infsup (-inf, 2.0)), infsup (-inf, 7.0))); %!#min max %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, 17.0))); %!test %! assert (isequal (fma (infsup (-10.0, 2.0), infsup (-5.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, 52.0))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-1.0, 10.0), infsup (-inf, 2.0)), infsup (-inf, 52.0))); %!test %! assert (isequal (fma (infsup (-2.0, 2.0), infsup (-5.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, 12.0))); %!#end min max %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (1.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, 17.0))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, -1.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (1.0, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (0.0, 0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-0.0, -0.0), infsup (-inf, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, -1.0), infsup (-inf, 2.0)), infsup (-inf, 52.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, 52.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (1.0, 3.0), infsup (-inf, 2.0)), infsup (-inf, -3.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, -1.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, 3.0), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, inf), infsup (-inf, 2.0)), infsup (-inf, 52.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (1.0, inf), infsup (-inf, 2.0)), infsup (-inf, -3.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, inf), infsup (-inf, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup, infsup, infsup (-2.0, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 1.0), infsup, infsup (-2.0, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-1.0, 1.0), infsup (-2.0, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-inf, inf), infsup (-2.0, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup, infsup (-2.0, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup, infsup (-2.0, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup, infsup (-2.0, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (0.0, 0.0), infsup (-2.0, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-0.0, -0.0), infsup (-2.0, 2.0)), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (0.0, 0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-0.0, -0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, -1.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, 3.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (1.0, 3.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, -1.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, 3.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (1.0, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (0.0, 0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-0.0, -0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, -1.0), infsup (-2.0, 2.0)), infsup (-inf, 1.0))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, 3.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (1.0, 3.0), infsup (-2.0, 2.0)), infsup (-1.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, -1.0), infsup (-2.0, 2.0)), infsup (-inf, 1.0))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, 3.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (1.0, inf), infsup (-2.0, 2.0)), infsup (-1.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (0.0, 0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-0.0, -0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, -1.0), infsup (-2.0, 2.0)), infsup (-inf, 7.0))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, 3.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (1.0, 3.0), infsup (-2.0, 2.0)), infsup (-5.0, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, -1.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, 3.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (1.0, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (0.0, 0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-0.0, -0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, -1.0), infsup (-2.0, 2.0)), infsup (-17.0, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, 3.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (1.0, 3.0), infsup (-2.0, 2.0)), infsup (-inf, 11.0))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, -1.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, 3.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (1.0, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (0.0, 0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-0.0, -0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, -1.0), infsup (-2.0, 2.0)), infsup (1.0, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, 3.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (1.0, 3.0), infsup (-2.0, 2.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, -1.0), infsup (-2.0, 2.0)), infsup (1.0, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, 3.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (1.0, inf), infsup (-2.0, 2.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (0.0, 0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-0.0, -0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, -1.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, 3.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (1.0, 3.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, -1.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, 3.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, inf), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (1.0, inf), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, inf), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (0.0, 0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-0.0, -0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, -1.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, 3.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (1.0, 3.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, -1.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, 3.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, inf), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (1.0, inf), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, inf), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (0.0, 0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-0.0, -0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, -1.0), infsup (-2.0, 2.0)), infsup (-27.0, 1.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, 3.0), infsup (-2.0, 2.0)), infsup (-27.0, 17.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (1.0, 3.0), infsup (-2.0, 2.0)), infsup (-1.0, 17.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, -1.0), infsup (-2.0, 2.0)), infsup (-inf, 1.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, 3.0), infsup (-2.0, 2.0)), infsup (-inf, 17.0))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, inf), infsup (-2.0, 2.0)), infsup (-27.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (1.0, inf), infsup (-2.0, 2.0)), infsup (-1.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (0.0, 0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-0.0, -0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, -1.0), infsup (-2.0, 2.0)), infsup (-27.0, 7.0))); %!#min max %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, 3.0), infsup (-2.0, 2.0)), infsup (-27.0, 17.0))); %!test %! assert (isequal (fma (infsup (-10.0, 2.0), infsup (-5.0, 3.0), infsup (-2.0, 2.0)), infsup (-32.0, 52.0))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-1.0, 10.0), infsup (-2.0, 2.0)), infsup (-12.0, 52.0))); %!test %! assert (isequal (fma (infsup (-2.0, 2.0), infsup (-5.0, 3.0), infsup (-2.0, 2.0)), infsup (-12.0, 12.0))); %!#end min max %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (1.0, 3.0), infsup (-2.0, 2.0)), infsup (-5.0, 17.0))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, -1.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, 3.0), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (1.0, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (0.0, 0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-0.0, -0.0), infsup (-2.0, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, -1.0), infsup (-2.0, 2.0)), infsup (3.0, 52.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, 3.0), infsup (-2.0, 2.0)), infsup (-32.0, 52.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (1.0, 3.0), infsup (-2.0, 2.0)), infsup (-32.0, -3.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, -1.0), infsup (-2.0, 2.0)), infsup (3.0, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, 3.0), infsup (-2.0, 2.0)), infsup (-32.0, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, inf), infsup (-2.0, 2.0)), infsup (-inf, 52.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (1.0, inf), infsup (-2.0, 2.0)), infsup (-inf, -3.0))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, inf), infsup (-2.0, 2.0)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup, infsup, infsup (-2.0, inf)), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 1.0), infsup, infsup (-2.0, inf)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-1.0, 1.0), infsup (-2.0, inf)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-inf, inf), infsup (-2.0, inf)), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup, infsup (-2.0, inf)), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup, infsup (-2.0, inf)), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup, infsup (-2.0, inf)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (0.0, 0.0), infsup (-2.0, inf)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-0.0, -0.0), infsup (-2.0, inf)), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (0.0, 0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-0.0, -0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, -1.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (1.0, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, -1.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (1.0, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (0.0, 0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-0.0, -0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, -1.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (1.0, 3.0), infsup (-2.0, inf)), infsup (-1.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, -1.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (1.0, inf), infsup (-2.0, inf)), infsup (-1.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (0.0, 0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-0.0, -0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, -1.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (1.0, 3.0), infsup (-2.0, inf)), infsup (-5.0, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, -1.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (1.0, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (0.0, 0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-0.0, -0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, -1.0), infsup (-2.0, inf)), infsup (-17.0, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (1.0, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, -1.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (1.0, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (0.0, 0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-0.0, -0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, -1.0), infsup (-2.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (1.0, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, -1.0), infsup (-2.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (1.0, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (0.0, 0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-0.0, -0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, -1.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, 3.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (1.0, 3.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, -1.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, 3.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, inf), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (1.0, inf), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, inf), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (0.0, 0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-0.0, -0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, -1.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, 3.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (1.0, 3.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, -1.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, 3.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, inf), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (1.0, inf), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, inf), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (0.0, 0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-0.0, -0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, -1.0), infsup (-2.0, inf)), infsup (-27.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, 3.0), infsup (-2.0, inf)), infsup (-27.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (1.0, 3.0), infsup (-2.0, inf)), infsup (-1.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, -1.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, inf), infsup (-2.0, inf)), infsup (-27.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (1.0, inf), infsup (-2.0, inf)), infsup (-1.0, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-0.0, -0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (0.0, 0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, -1.0), infsup (-2.0, inf)), infsup (-27.0, inf))); %!#min max %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, 3.0), infsup (-2.0, inf)), infsup (-27.0, inf))); %!test %! assert (isequal (fma (infsup (-10.0, 2.0), infsup (-5.0, 3.0), infsup (-2.0, inf)), infsup (-32.0, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-1.0, 10.0), infsup (-2.0, inf)), infsup (-12.0, inf))); %!test %! assert (isequal (fma (infsup (-2.0, 2.0), infsup (-5.0, 3.0), infsup (-2.0, inf)), infsup (-12.0, inf))); %!#end min max %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (1.0, 3.0), infsup (-2.0, inf)), infsup (-5.0, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, -1.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, 3.0), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (1.0, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (0.0, 0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-0.0, -0.0), infsup (-2.0, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, -1.0), infsup (-2.0, inf)), infsup (3.0, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, 3.0), infsup (-2.0, inf)), infsup (-32.0, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (1.0, 3.0), infsup (-2.0, inf)), infsup (-32.0, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, -1.0), infsup (-2.0, inf)), infsup (3.0, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, 3.0), infsup (-2.0, inf)), infsup (-32.0, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (1.0, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, inf), infsup (-2.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup, infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (fma (infsup (-1.0, 1.0), infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-1.0, 1.0), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-inf, inf), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (0.0, 0.0), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (fma (infsup, infsup (-0.0, -0.0), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (1.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-5.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, inf), infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (1.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-5.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, inf), infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (1.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-5.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, inf), infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (1.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-5.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, 3.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (1.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-5.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-inf, -3.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (1.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-5.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.0, 0.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (1.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-5.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-0.0, -0.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (1.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-5.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (1.0, 5.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!#min max %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, 2.0), infsup (-5.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-1.0, 10.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-2.0, 2.0), infsup (-5.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!#end min max %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (1.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-5.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-1.0, 5.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (0.0, 0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (1.0, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, -1.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, 3.0), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-5.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (-10.0, -5.0), infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fma (infsup (0.1, 0.5), infsup (-5.0, 3.0), infsup (-0.1, 0.1)), infsup (-2.600000000000000089e+00, 1.600000000000000089e+00))); %!test %! assert (isequal (fma (infsup (-0.5, 0.2), infsup (-5.0, 3.0), infsup (-0.1, 0.1)), infsup (-1.600000000000000089e+00, 2.600000000000000089e+00))); %!test %! assert (isequal (fma (infsup (-0.5, -0.1), infsup (2.0, 3.0), infsup (-0.1, 0.1)), infsup (-1.600000000000000089e+00, -1.000000000000000056e-01))); %!test %! assert (isequal (fma (infsup (-0.5, -0.1), infsup (-inf, 3.0), infsup (-0.1, 0.1)), infsup (-1.600000000000000089e+00, inf))); ## minimal_fma_dec_test %!test %! assert (isequal (fma (infsupdec (-0.5, -0.1, "com"), infsupdec (-inf, 3.0, "dac"), infsupdec (-0.1, 0.1, "com")), infsupdec (-1.600000000000000089e+00, inf, "dac"))); %! assert (isequal (decorationpart (fma (infsupdec (-0.5, -0.1, "com"), infsupdec (-inf, 3.0, "dac"), infsupdec (-0.1, 0.1, "com"))){1}, decorationpart (infsupdec (-1.600000000000000089e+00, inf, "dac")){1})); %!test %! assert (isequal (fma (infsupdec (1.0, 2.0, "com"), infsupdec (1.0, 1.797693134862315708e+308, "com"), infsupdec (0.0, 1.0, "com")), infsupdec (1.0, inf, "dac"))); %! assert (isequal (decorationpart (fma (infsupdec (1.0, 2.0, "com"), infsupdec (1.0, 1.797693134862315708e+308, "com"), infsupdec (0.0, 1.0, "com"))){1}, decorationpart (infsupdec (1.0, inf, "dac")){1})); %!test %! assert (isequal (fma (infsupdec (1.0, 2.0, "com"), infsupdec (1.0, 2.0, "com"), infsupdec (2.0, 5.0, "com")), infsupdec (3.0, 9.0, "com"))); %! assert (isequal (decorationpart (fma (infsupdec (1.0, 2.0, "com"), infsupdec (1.0, 2.0, "com"), infsupdec (2.0, 5.0, "com"))){1}, decorationpart (infsupdec (3.0, 9.0, "com")){1})); ## minimal_pown_test %!test %! assert (isequal (pown (infsup, 0), infsup)); %!test %! assert (isequal (pown (infsup (-inf, inf), 0), infsup (1.0, 1.0))); %!test %! assert (isequal (pown (infsup (0.0, 0.0), 0), infsup (1.0, 1.0))); %!test %! assert (isequal (pown (infsup (-0.0, -0.0), 0), infsup (1.0, 1.0))); %!test %! assert (isequal (pown (infsup (13.1, 13.1), 0), infsup (1.0, 1.0))); %!test %! assert (isequal (pown (infsup (-7451.145, -7451.145), 0), infsup (1.0, 1.0))); %!test %! assert (isequal (pown (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), 0), infsup (1.0, 1.0))); %!test %! assert (isequal (pown (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), 0), infsup (1.0, 1.0))); %!test %! assert (isequal (pown (infsup (0.0, inf), 0), infsup (1.0, 1.0))); %!test %! assert (isequal (pown (infsup (-0.0, inf), 0), infsup (1.0, 1.0))); %!test %! assert (isequal (pown (infsup (-inf, 0.0), 0), infsup (1.0, 1.0))); %!test %! assert (isequal (pown (infsup (-inf, -0.0), 0), infsup (1.0, 1.0))); %!test %! assert (isequal (pown (infsup (-324.3, 2.5), 0), infsup (1.0, 1.0))); %!test %! assert (isequal (pown (infsup, 2), infsup)); %!test %! assert (isequal (pown (infsup (-inf, inf), 2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (0.0, 0.0), 2), infsup (0.0, 0.0))); %!test %! assert (isequal (pown (infsup (-0.0, -0.0), 2), infsup (0.0, 0.0))); %!test %! assert (isequal (pown (infsup (13.1, 13.1), 2), infsup (1.716099999999999852e+02, 1.716100000000000136e+02))); %!test %! assert (isequal (pown (infsup (-7451.145, -7451.145), 2), infsup (5.551956181102500111e+07, 5.551956181102500856e+07))); %!test %! assert (isequal (pown (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), 2), infsup (1.797693134862315708e+308, inf))); %!test %! assert (isequal (pown (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), 2), infsup (1.797693134862315708e+308, inf))); %!test %! assert (isequal (pown (infsup (0.0, inf), 2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-0.0, inf), 2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, 0.0), 2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, -0.0), 2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-324.3, 2.5), 2), infsup (0.0, 1.051704900000000198e+05))); %!test %! assert (isequal (pown (infsup (0.01, 2.33), 2), infsup (9.999999999999999124e-05, 5.428900000000000503e+00))); %!test %! assert (isequal (pown (infsup (-1.9, -0.33), 2), infsup (1.088999999999999968e-01, 3.609999999999999876e+00))); %!test %! assert (isequal (pown (infsup, 8), infsup)); %!test %! assert (isequal (pown (infsup (-inf, inf), 8), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (0.0, 0.0), 8), infsup (0.0, 0.0))); %!test %! assert (isequal (pown (infsup (-0.0, -0.0), 8), infsup (0.0, 0.0))); %!test %! assert (isequal (pown (infsup (13.1, 13.1), 8), infsup (8.673020346900621653e+08, 8.673020346900622845e+08))); %!test %! assert (isequal (pown (infsup (-7451.145, -7451.145), 8), infsup (9.501323805961964567e+30, 9.501323805961965692e+30))); %!test %! assert (isequal (pown (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), 8), infsup (1.797693134862315708e+308, inf))); %!test %! assert (isequal (pown (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), 8), infsup (1.797693134862315708e+308, inf))); %!test %! assert (isequal (pown (infsup (0.0, inf), 8), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-0.0, inf), 8), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, 0.0), 8), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, -0.0), 8), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-324.3, 2.5), 8), infsup (0.0, 1.223420037986718843e+20))); %!test %! assert (isequal (pown (infsup (0.01, 2.33), 8), infsup (1.000000000000000102e-16, 8.686550888106663706e+02))); %!test %! assert (isequal (pown (infsup (-1.9, -0.33), 8), infsup (1.406408618241000491e-04, 1.698356304099999647e+02))); %!test %! assert (isequal (pown (infsup, 1), infsup)); %!test %! assert (isequal (pown (infsup (-inf, inf), 1), infsup (-inf, inf))); %!test %! assert (isequal (pown (infsup (0.0, 0.0), 1), infsup (0.0, 0.0))); %!test %! assert (isequal (pown (infsup (-0.0, -0.0), 1), infsup (0.0, 0.0))); %!test %! assert (isequal (pown (infsup (13.1, 13.1), 1), infsup (13.1, 13.1))); %!test %! assert (isequal (pown (infsup (-7451.145, -7451.145), 1), infsup (-7451.145, -7451.145))); %!test %! assert (isequal (pown (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), 1), infsup (1.797693134862315708e+308, 1.797693134862315708e+308))); %!test %! assert (isequal (pown (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), 1), infsup (-1.797693134862315708e+308, -1.797693134862315708e+308))); %!test %! assert (isequal (pown (infsup (0.0, inf), 1), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-0.0, inf), 1), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, 0.0), 1), infsup (-inf, 0.0))); %!test %! assert (isequal (pown (infsup (-inf, -0.0), 1), infsup (-inf, 0.0))); %!test %! assert (isequal (pown (infsup (-324.3, 2.5), 1), infsup (-324.3, 2.5))); %!test %! assert (isequal (pown (infsup (0.01, 2.33), 1), infsup (0.01, 2.33))); %!test %! assert (isequal (pown (infsup (-1.9, -0.33), 1), infsup (-1.9, -0.33))); %!test %! assert (isequal (pown (infsup, 3), infsup)); %!test %! assert (isequal (pown (infsup (-inf, inf), 3), infsup (-inf, inf))); %!test %! assert (isequal (pown (infsup (0.0, 0.0), 3), infsup (0.0, 0.0))); %!test %! assert (isequal (pown (infsup (-0.0, -0.0), 3), infsup (0.0, 0.0))); %!test %! assert (isequal (pown (infsup (13.1, 13.1), 3), infsup (2.248090999999999440e+03, 2.248090999999999894e+03))); %!test %! assert (isequal (pown (infsup (-7451.145, -7451.145), 3), infsup (-4.136843053904099731e+11, -4.136843053904099121e+11))); %!test %! assert (isequal (pown (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), 3), infsup (1.797693134862315708e+308, inf))); %!test %! assert (isequal (pown (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), 3), infsup (-inf, -1.797693134862315708e+308))); %!test %! assert (isequal (pown (infsup (0.0, inf), 3), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-0.0, inf), 3), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, 0.0), 3), infsup (-inf, 0.0))); %!test %! assert (isequal (pown (infsup (-inf, -0.0), 3), infsup (-inf, 0.0))); %!test %! assert (isequal (pown (infsup (-324.3, 2.5), 3), infsup (-3.410678990700000525e+07, 1.562500000000000000e+01))); %!test %! assert (isequal (pown (infsup (0.01, 2.33), 3), infsup (9.999999999999999547e-07, 1.264933700000000272e+01))); %!test %! assert (isequal (pown (infsup (-1.9, -0.33), 3), infsup (-6.858999999999999098e+00, -3.593700000000000366e-02))); %!test %! assert (isequal (pown (infsup, 7), infsup)); %!test %! assert (isequal (pown (infsup (-inf, inf), 7), infsup (-inf, inf))); %!test %! assert (isequal (pown (infsup (0.0, 0.0), 7), infsup (0.0, 0.0))); %!test %! assert (isequal (pown (infsup (-0.0, -0.0), 7), infsup (0.0, 0.0))); %!test %! assert (isequal (pown (infsup (13.1, 13.1), 7), infsup (6.620626219008108228e+07, 6.620626219008108974e+07))); %!test %! assert (isequal (pown (infsup (-7451.145, -7451.145), 7), infsup (-1.275149497957960280e+27, -1.275149497957960005e+27))); %!test %! assert (isequal (pown (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), 7), infsup (1.797693134862315708e+308, inf))); %!test %! assert (isequal (pown (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), 7), infsup (-inf, -1.797693134862315708e+308))); %!test %! assert (isequal (pown (infsup (0.0, inf), 7), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-0.0, inf), 7), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, 0.0), 7), infsup (-inf, 0.0))); %!test %! assert (isequal (pown (infsup (-inf, -0.0), 7), infsup (-inf, 0.0))); %!test %! assert (isequal (pown (infsup (-324.3, 2.5), 7), infsup (-3.772494720896449920e+17, 6.103515625000000000e+02))); %!test %! assert (isequal (pown (infsup (0.01, 2.33), 7), infsup (9.999999999999999988e-15, 3.728133428371958757e+02))); %!test %! assert (isequal (pown (infsup (-1.9, -0.33), 7), infsup (-8.938717389999997920e+01, -4.261844297700001028e-04))); %!test %! assert (isequal (pown (infsup, -2), infsup)); %!test %! assert (isequal (pown (infsup (-inf, inf), -2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (0.0, 0.0), -2), infsup)); %!test %! assert (isequal (pown (infsup (-0.0, -0.0), -2), infsup)); %!test %! assert (isequal (pown (infsup (13.1, 13.1), -2), infsup (5.827166249053085390e-03, 5.827166249053086257e-03))); %!test %! assert (isequal (pown (infsup (-7451.145, -7451.145), -2), infsup (1.801166953377180740e-08, 1.801166953377181071e-08))); %!test %! assert (isequal (pown (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), -2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %!test %! assert (isequal (pown (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), -2), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %!test %! assert (isequal (pown (infsup (0.0, inf), -2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-0.0, inf), -2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, 0.0), -2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, -0.0), -2), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-324.3, 2.5), -2), infsup (9.508370646556841917e-06, inf))); %!test %! assert (isequal (pown (infsup (0.01, 2.33), -2), infsup (1.841993774061043421e-01, 1.000000000000000000e+04))); %!test %! assert (isequal (pown (infsup (-1.9, -0.33), -2), infsup (2.770083102493074989e-01, 9.182736455463727410e+00))); %!test %! assert (isequal (pown (infsup, -8), infsup)); %!test %! assert (isequal (pown (infsup (-inf, inf), -8), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (0.0, 0.0), -8), infsup)); %!test %! assert (isequal (pown (infsup (-0.0, -0.0), -8), infsup)); %!test %! assert (isequal (pown (infsup (13.1, 13.1), -8), infsup (1.153000869365374417e-09, 1.153000869365374624e-09))); %!test %! assert (isequal (pown (infsup (-7451.145, -7451.145), -8), infsup (1.052484917283328578e-31, 1.052484917283328797e-31))); %!test %! assert (isequal (pown (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), -8), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %!test %! assert (isequal (pown (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), -8), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %!test %! assert (isequal (pown (infsup (0.0, inf), -8), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-0.0, inf), -8), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, 0.0), -8), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, -0.0), -8), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-324.3, 2.5), -8), infsup (8.173807596331487643e-21, inf))); %!test %! assert (isequal (pown (infsup (0.01, 2.33), -8), infsup (1.151204906160357110e-03, 1.000000000000000000e+16))); %!test %! assert (isequal (pown (infsup (-1.9, -0.33), -8), infsup (5.888045974722156024e-03, 7.110309102419345436e+03))); %!test %! assert (isequal (pown (infsup, -1), infsup)); %!test %! assert (isequal (pown (infsup (-inf, inf), -1), infsup (-inf, inf))); %!test %! assert (isequal (pown (infsup (0.0, 0.0), -1), infsup)); %!test %! assert (isequal (pown (infsup (-0.0, -0.0), -1), infsup)); %!test %! assert (isequal (pown (infsup (13.1, 13.1), -1), infsup (7.633587786259540819e-02, 7.633587786259542207e-02))); %!test %! assert (isequal (pown (infsup (-7451.145, -7451.145), -1), infsup (-1.342075613882161712e-04, -1.342075613882161441e-04))); %!test %! assert (isequal (pown (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), -1), infsup (5.562684646268003458e-309, 5.562684646268008398e-309))); %!test %! assert (isequal (pown (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), -1), infsup (-5.562684646268008398e-309, -5.562684646268003458e-309))); %!test %! assert (isequal (pown (infsup (0.0, inf), -1), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-0.0, inf), -1), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, 0.0), -1), infsup (-inf, 0.0))); %!test %! assert (isequal (pown (infsup (-inf, -0.0), -1), infsup (-inf, 0.0))); %!test %! assert (isequal (pown (infsup (-324.3, 2.5), -1), infsup (-inf, inf))); %!test %! assert (isequal (pown (infsup (0.01, 2.33), -1), infsup (4.291845493562231328e-01, 1.000000000000000000e+02))); %!test %! assert (isequal (pown (infsup (-1.9, -0.33), -1), infsup (-3.030303030303030276e+00, -5.263157894736841813e-01))); %!test %! assert (isequal (pown (infsup, -3), infsup)); %!test %! assert (isequal (pown (infsup (-inf, inf), -3), infsup (-inf, inf))); %!test %! assert (isequal (pown (infsup (0.0, 0.0), -3), infsup)); %!test %! assert (isequal (pown (infsup (-0.0, -0.0), -3), infsup)); %!test %! assert (isequal (pown (infsup (13.1, 13.1), -3), infsup (4.448218510727546177e-04, 4.448218510727546720e-04))); %!test %! assert (isequal (pown (infsup (-7451.145, -7451.145), -3), infsup (-2.417302244657943502e-12, -2.417302244657943098e-12))); %!test %! assert (isequal (pown (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), -3), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %!test %! assert (isequal (pown (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), -3), infsup (-4.940656458412465442e-324, -0.000000000000000000e+00))); %!test %! assert (isequal (pown (infsup (0.0, inf), -3), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-0.0, inf), -3), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, 0.0), -3), infsup (-inf, 0.0))); %!test %! assert (isequal (pown (infsup (-inf, -0.0), -3), infsup (-inf, 0.0))); %!test %! assert (isequal (pown (infsup (-324.3, 2.5), -3), infsup (-inf, inf))); %!test %! assert (isequal (pown (infsup (0.01, 2.33), -3), infsup (7.905552678373577169e-02, 1.000000000000000000e+06))); %!test %! assert (isequal (pown (infsup (-1.9, -0.33), -3), infsup (-2.782647410746584171e+01, -1.457938474996355316e-01))); %!test %! assert (isequal (pown (infsup, -7), infsup)); %!test %! assert (isequal (pown (infsup (-inf, inf), -7), infsup (-inf, inf))); %!test %! assert (isequal (pown (infsup (0.0, 0.0), -7), infsup)); %!test %! assert (isequal (pown (infsup (-0.0, -0.0), -7), infsup)); %!test %! assert (isequal (pown (infsup (13.1, 13.1), -7), infsup (1.510431138868640339e-08, 1.510431138868640670e-08))); %!test %! assert (isequal (pown (infsup (-7451.145, -7451.145), -7), infsup (-7.842217728991088300e-28, -7.842217728991087403e-28))); %!test %! assert (isequal (pown (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), -7), infsup (0.000000000000000000e+00, 4.940656458412465442e-324))); %!test %! assert (isequal (pown (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), -7), infsup (-4.940656458412465442e-324, -0.000000000000000000e+00))); %!test %! assert (isequal (pown (infsup (0.0, inf), -7), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-0.0, inf), -7), infsup (0.0, inf))); %!test %! assert (isequal (pown (infsup (-inf, 0.0), -7), infsup (-inf, 0.0))); %!test %! assert (isequal (pown (infsup (-inf, -0.0), -7), infsup (-inf, 0.0))); %!test %! assert (isequal (pown (infsup (-324.3, 2.5), -7), infsup (-inf, inf))); %!test %! assert (isequal (pown (infsup (0.01, 2.33), -7), infsup (2.682307431353632161e-03, 1.000000000000000000e+14))); %!test %! assert (isequal (pown (infsup (-1.9, -0.33), -7), infsup (-2.346402003798384158e+03, -1.118728735197209619e-02))); ## minimal_pown_dec_test %!test %! assert (isequal (pown (infsupdec (-5.0, 10.0, "com"), 0), infsupdec (1.0, 1.0, "com"))); %! assert (isequal (decorationpart (pown (infsupdec (-5.0, 10.0, "com"), 0)){1}, decorationpart (infsupdec (1.0, 1.0, "com")){1})); %!test %! assert (isequal (pown (infsupdec (-inf, 15.0, "dac"), 0), infsupdec (1.0, 1.0, "dac"))); %! assert (isequal (decorationpart (pown (infsupdec (-inf, 15.0, "dac"), 0)){1}, decorationpart (infsupdec (1.0, 1.0, "dac")){1})); %!test %! assert (isequal (pown (infsupdec (-3.0, 5.0, "def"), 2), infsupdec (0.0, 25.0, "def"))); %! assert (isequal (decorationpart (pown (infsupdec (-3.0, 5.0, "def"), 2)){1}, decorationpart (infsupdec (0.0, 25.0, "def")){1})); %!test %! assert (isequal (pown (infsupdec (-1.797693134862315708e+308, 2.0, "com"), 2), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (pown (infsupdec (-1.797693134862315708e+308, 2.0, "com"), 2)){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %!test %! assert (isequal (pown (infsupdec (-3.0, 5.0, "dac"), 3), infsupdec (-27.0, 125.0, "dac"))); %! assert (isequal (decorationpart (pown (infsupdec (-3.0, 5.0, "dac"), 3)){1}, decorationpart (infsupdec (-27.0, 125.0, "dac")){1})); %!test %! assert (isequal (pown (infsupdec (-1.797693134862315708e+308, 2.0, "com"), 3), infsupdec (-inf, 8.0, "dac"))); %! assert (isequal (decorationpart (pown (infsupdec (-1.797693134862315708e+308, 2.0, "com"), 3)){1}, decorationpart (infsupdec (-inf, 8.0, "dac")){1})); %!test %! assert (isequal (pown (infsupdec (3.0, 5.0, "com"), -2), infsupdec (3.999999999999999389e-02, 1.111111111111111188e-01, "com"))); %! assert (isequal (decorationpart (pown (infsupdec (3.0, 5.0, "com"), -2)){1}, decorationpart (infsupdec (3.999999999999999389e-02, 1.111111111111111188e-01, "com")){1})); %!test %! assert (isequal (pown (infsupdec (-5.0, -3.0, "def"), -2), infsupdec (3.999999999999999389e-02, 1.111111111111111188e-01, "def"))); %! assert (isequal (decorationpart (pown (infsupdec (-5.0, -3.0, "def"), -2)){1}, decorationpart (infsupdec (3.999999999999999389e-02, 1.111111111111111188e-01, "def")){1})); %!test %! assert (isequal (pown (infsupdec (-5.0, 3.0, "com"), -2), infsupdec (3.999999999999999389e-02, inf, "trv"))); %! assert (isequal (decorationpart (pown (infsupdec (-5.0, 3.0, "com"), -2)){1}, decorationpart (infsupdec (3.999999999999999389e-02, inf, "trv")){1})); %!test %! assert (isequal (pown (infsupdec (3.0, 5.0, "dac"), -3), infsupdec (7.999999999999998432e-03, 3.703703703703704192e-02, "dac"))); %! assert (isequal (decorationpart (pown (infsupdec (3.0, 5.0, "dac"), -3)){1}, decorationpart (infsupdec (7.999999999999998432e-03, 3.703703703703704192e-02, "dac")){1})); %!test %! assert (isequal (pown (infsupdec (-3.0, 5.0, "com"), -3), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (pown (infsupdec (-3.0, 5.0, "com"), -3)){1}, decorationpart (infsupdec (entire, "trv")){1})); ## minimal_pow_test %!test %! assert (isequal (pow (infsup, infsup), infsup)); %!test %! assert (isequal (pow (infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (pow (infsup, infsup (-inf, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup, infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup, infsup (-inf, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup, infsup (0.0, inf)), infsup)); %!test %! assert (isequal (pow (infsup, infsup (-0.0, inf)), infsup)); %!test %! assert (isequal (pow (infsup, infsup (1.0, inf)), infsup)); %!test %! assert (isequal (pow (infsup, infsup (-3.0, 5.0)), infsup)); %!test %! assert (isequal (pow (infsup, infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup, infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup, infsup (-5.0, -5.0)), infsup)); %!test %! assert (isequal (pow (infsup, infsup (5.0, 5.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup), infsup)); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (0.0, 1.0)), infsup (1.000000000000000056e-01, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-0.0, 1.0)), infsup (1.000000000000000056e-01, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (0.0, 2.5)), infsup (3.162277660168379394e-03, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-0.0, 2.5)), infsup (3.162277660168379394e-03, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (0.1, 0.1)), infsup (7.943282347242814900e-01, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (0.1, 1.0)), infsup (1.000000000000000056e-01, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (0.1, 2.5)), infsup (3.162277660168379394e-03, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (0.1, inf)), infsup (0.0, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (1.0, 1.0)), infsup (1.000000000000000056e-01, 5.000000000000000000e-01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (1.0, 2.5)), infsup (3.162277660168379394e-03, 5.000000000000000000e-01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (1.0, inf)), infsup (0.0, 5.000000000000000000e-01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (2.5, 2.5)), infsup (3.162277660168379394e-03, 1.767766952966368932e-01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (2.5, inf)), infsup (0.0, 1.767766952966368932e-01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-0.1, 0.1)), infsup (7.943282347242814900e-01, 1.258925411794167282e+00))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-0.1, 1.0)), infsup (1.000000000000000056e-01, 1.258925411794167282e+00))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-0.1, 2.5)), infsup (3.162277660168379394e-03, 1.258925411794167282e+00))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-0.1, inf)), infsup (0.0, 1.258925411794167282e+00))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-1.0, 0.1)), infsup (7.943282347242814900e-01, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-1.0, 1.0)), infsup (1.000000000000000056e-01, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-1.0, 2.5)), infsup (3.162277660168379394e-03, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-1.0, inf)), infsup (0.0, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-2.5, 0.1)), infsup (7.943282347242814900e-01, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-2.5, 1.0)), infsup (1.000000000000000056e-01, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-2.5, 2.5)), infsup (3.162277660168379394e-03, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-2.5, inf)), infsup (0.0, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-inf, 0.1)), infsup (7.943282347242814900e-01, inf))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-inf, 1.0)), infsup (1.000000000000000056e-01, inf))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-inf, 2.5)), infsup (3.162277660168379394e-03, inf))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-1.0, 0.0)), infsup (1.0, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-1.0, -0.0)), infsup (1.0, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-2.5, 0.0)), infsup (1.0, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-2.5, -0.0)), infsup (1.0, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-inf, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-inf, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-0.1, -0.1)), infsup (1.071773462536293131e+00, 1.258925411794167282e+00))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-1.0, -0.1)), infsup (1.071773462536293131e+00, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-2.5, -0.1)), infsup (1.071773462536293131e+00, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-inf, -0.1)), infsup (1.071773462536293131e+00, inf))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-1.0, -1.0)), infsup (2.000000000000000000e+00, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-2.5, -1.0)), infsup (2.000000000000000000e+00, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-inf, -1.0)), infsup (2.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-2.5, -2.5)), infsup (5.656854249492379694e+00, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 0.5), infsup (-inf, -2.5)), infsup (5.656854249492379694e+00, inf))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup), infsup)); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (0.0, 1.0)), infsup (1.000000000000000056e-01, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-0.0, 1.0)), infsup (1.000000000000000056e-01, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (0.0, 2.5)), infsup (3.162277660168379394e-03, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-0.0, 2.5)), infsup (3.162277660168379394e-03, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (0.1, 0.1)), infsup (7.943282347242814900e-01, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (0.1, 1.0)), infsup (1.000000000000000056e-01, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (0.1, 2.5)), infsup (3.162277660168379394e-03, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (0.1, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (1.0, 1.0)), infsup (1.000000000000000056e-01, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (1.0, 2.5)), infsup (3.162277660168379394e-03, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (1.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (2.5, 2.5)), infsup (3.162277660168379394e-03, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (2.5, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-0.1, 0.1)), infsup (7.943282347242814900e-01, 1.258925411794167282e+00))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-0.1, 1.0)), infsup (1.000000000000000056e-01, 1.258925411794167282e+00))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-0.1, 2.5)), infsup (3.162277660168379394e-03, 1.258925411794167282e+00))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-0.1, inf)), infsup (0.0, 1.258925411794167282e+00))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-1.0, 0.1)), infsup (7.943282347242814900e-01, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-1.0, 1.0)), infsup (1.000000000000000056e-01, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-1.0, 2.5)), infsup (3.162277660168379394e-03, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-1.0, inf)), infsup (0.0, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-2.5, 0.1)), infsup (7.943282347242814900e-01, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-2.5, 1.0)), infsup (1.000000000000000056e-01, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-2.5, 2.5)), infsup (3.162277660168379394e-03, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-2.5, inf)), infsup (0.0, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-inf, 0.1)), infsup (7.943282347242814900e-01, inf))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-inf, 1.0)), infsup (1.000000000000000056e-01, inf))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-inf, 2.5)), infsup (3.162277660168379394e-03, inf))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-0.1, 0.0)), infsup (1.0, 1.258925411794167282e+00))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-0.1, -0.0)), infsup (1.0, 1.258925411794167282e+00))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-1.0, 0.0)), infsup (1.0, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-1.0, -0.0)), infsup (1.0, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-2.5, 0.0)), infsup (1.0, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-2.5, -0.0)), infsup (1.0, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-inf, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-inf, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-0.1, -0.1)), infsup (1.0, 1.258925411794167282e+00))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-1.0, -0.1)), infsup (1.0, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-2.5, -0.1)), infsup (1.0, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-inf, -0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-1.0, -1.0)), infsup (1.0, 1.000000000000000000e+01))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-2.5, -1.0)), infsup (1.0, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-inf, -1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-2.5, -2.5)), infsup (1.0, 3.162277660168379043e+02))); %!test %! assert (isequal (pow (infsup (0.1, 1.0), infsup (-inf, -2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup), infsup)); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (0.0, 1.0)), infsup (0.5, 1.5))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-0.0, 1.0)), infsup (0.5, 1.5))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (0.0, 2.5)), infsup (1.767766952966368654e-01, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-0.0, 2.5)), infsup (1.767766952966368654e-01, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (0.1, 0.1)), infsup (9.330329915368074101e-01, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (0.1, 1.0)), infsup (0.5, 1.5))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (0.1, 2.5)), infsup (1.767766952966368654e-01, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (1.0, 1.0)), infsup (0.5, 1.5))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (1.0, 2.5)), infsup (1.767766952966368654e-01, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (2.5, 2.5)), infsup (1.767766952966368654e-01, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-0.1, 0.1)), infsup (9.330329915368074101e-01, 1.071773462536293353e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-0.1, 1.0)), infsup (5.000000000000000000e-01, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-0.1, 2.5)), infsup (1.767766952966368654e-01, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-0.1, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-1.0, 0.1)), infsup (6.666666666666666297e-01, 2.000000000000000000e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-1.0, 1.0)), infsup (5.000000000000000000e-01, 2.000000000000000000e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-1.0, 2.5)), infsup (1.767766952966368654e-01, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-1.0, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-2.5, 0.1)), infsup (3.628873693012115154e-01, 5.656854249492380582e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-2.5, 1.0)), infsup (3.628873693012115154e-01, 5.656854249492380582e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-2.5, 2.5)), infsup (1.767766952966368654e-01, 5.656854249492380582e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-2.5, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-inf, 0.1)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-inf, 1.0)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-inf, 2.5)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-inf, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-1.0, 0.0)), infsup (6.666666666666666297e-01, 2.000000000000000000e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-1.0, -0.0)), infsup (6.666666666666666297e-01, 2.000000000000000000e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-2.5, 0.0)), infsup (3.628873693012115154e-01, 5.656854249492380582e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-2.5, -0.0)), infsup (3.628873693012115154e-01, 5.656854249492380582e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-inf, 0.0)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-inf, -0.0)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-0.1, -0.1)), infsup (9.602645007922180342e-01, 1.071773462536293353e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-1.0, -0.1)), infsup (6.666666666666666297e-01, 2.000000000000000000e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-2.5, -0.1)), infsup (3.628873693012115154e-01, 5.656854249492380582e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-inf, -0.1)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-1.0, -1.0)), infsup (6.666666666666666297e-01, 2.000000000000000000e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-2.5, -1.0)), infsup (3.628873693012115154e-01, 5.656854249492380582e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-inf, -1.0)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-2.5, -2.5)), infsup (3.628873693012115154e-01, 5.656854249492380582e+00))); %!test %! assert (isequal (pow (infsup (0.5, 1.5), infsup (-inf, -2.5)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup), infsup)); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (0.0, 1.0)), infsup (0.5, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-0.0, 1.0)), infsup (0.5, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (0.0, 2.5)), infsup (1.767766952966368654e-01, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-0.0, 2.5)), infsup (1.767766952966368654e-01, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (0.1, 0.1)), infsup (9.330329915368074101e-01, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (0.1, 1.0)), infsup (0.5, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (0.1, 2.5)), infsup (1.767766952966368654e-01, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (1.0, 1.0)), infsup (0.5, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (1.0, 2.5)), infsup (1.767766952966368654e-01, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (2.5, 2.5)), infsup (1.767766952966368654e-01, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-1.0, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-2.5, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-2.5, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-inf, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-inf, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-inf, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-1.0, 0.0)), infsup (0.0, 2.000000000000000000e+00))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-1.0, -0.0)), infsup (0.0, 2.000000000000000000e+00))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-2.5, 0.0)), infsup (0.0, 5.656854249492380582e+00))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-2.5, -0.0)), infsup (0.0, 5.656854249492380582e+00))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-inf, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-0.1, -0.1)), infsup (0.0, 1.071773462536293353e+00))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-1.0, -0.1)), infsup (0.0, 2.000000000000000000e+00))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-2.5, -0.1)), infsup (0.0, 5.656854249492380582e+00))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-inf, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-1.0, -1.0)), infsup (0.0, 2.000000000000000000e+00))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-2.5, -1.0)), infsup (0.0, 5.656854249492380582e+00))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-inf, -1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-inf, -2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.5, inf), infsup (-2.5, -2.5)), infsup (0.0, 5.656854249492380582e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup), infsup)); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (0.0, 1.0)), infsup (1.0, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-0.0, 1.0)), infsup (1.0, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (0.0, 2.5)), infsup (1.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-0.0, 2.5)), infsup (1.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (0.1, 0.1)), infsup (1.0, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (0.1, 1.0)), infsup (1.0, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (0.1, 2.5)), infsup (1.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (0.1, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (1.0, 1.0)), infsup (1.0, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (1.0, 2.5)), infsup (1.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (2.5, 2.5)), infsup (1.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (2.5, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-0.1, 0.1)), infsup (9.602645007922180342e-01, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-0.1, 1.0)), infsup (9.602645007922180342e-01, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-0.1, 2.5)), infsup (9.602645007922180342e-01, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-0.1, inf)), infsup (9.602645007922180342e-01, inf))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-1.0, 0.1)), infsup (6.666666666666666297e-01, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-1.0, 1.0)), infsup (6.666666666666666297e-01, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-1.0, 2.5)), infsup (6.666666666666666297e-01, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-1.0, inf)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-2.5, 0.1)), infsup (3.628873693012115154e-01, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-2.5, 1.0)), infsup (3.628873693012115154e-01, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-2.5, 2.5)), infsup (3.628873693012115154e-01, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-2.5, inf)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-inf, 0.1)), infsup (0.000000000000000000e+00, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-inf, 1.0)), infsup (0.000000000000000000e+00, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-inf, 2.5)), infsup (0.000000000000000000e+00, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-inf, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-1.0, 0.0)), infsup (6.666666666666666297e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-1.0, -0.0)), infsup (6.666666666666666297e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-2.5, 0.0)), infsup (3.628873693012115154e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-2.5, -0.0)), infsup (3.628873693012115154e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-inf, 0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-inf, -0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-0.1, -0.1)), infsup (9.602645007922180342e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-1.0, -0.1)), infsup (6.666666666666666297e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-2.5, -0.1)), infsup (3.628873693012115154e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-inf, -0.1)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-1.0, -1.0)), infsup (6.666666666666666297e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-2.5, -1.0)), infsup (3.628873693012115154e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-inf, -1.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-2.5, -2.5)), infsup (3.628873693012115154e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, 1.5), infsup (-inf, -2.5)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup), infsup)); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (0.0, 1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-0.0, 1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (0.0, 2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-0.0, 2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (0.1, 0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (0.1, 1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (0.1, 2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (0.1, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (1.0, 1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (1.0, 2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (1.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (2.5, 2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (2.5, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-0.1, 0.1)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-0.1, 1.0)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-0.1, 2.5)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-0.1, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-1.0, 0.1)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-1.0, 1.0)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-1.0, 2.5)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-1.0, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-2.5, 0.1)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-2.5, 1.0)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-2.5, 2.5)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-2.5, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-inf, 0.1)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-inf, 1.0)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-inf, 2.5)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-inf, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-1.0, 0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-1.0, -0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-2.5, 0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-2.5, -0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-inf, 0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-inf, -0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-0.1, -0.1)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-1.0, -0.1)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-2.5, -0.1)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-inf, -0.1)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-1.0, -1.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-2.5, -1.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-inf, -1.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-2.5, -2.5)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.0, inf), infsup (-inf, -2.5)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup), infsup)); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (0.0, 1.0)), infsup (1.0, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-0.0, 1.0)), infsup (1.0, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (0.0, 2.5)), infsup (1.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-0.0, 2.5)), infsup (1.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (0.1, 0.1)), infsup (1.009576582776886999e+00, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (0.1, 1.0)), infsup (1.009576582776886999e+00, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (0.1, 2.5)), infsup (1.009576582776886999e+00, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (0.1, inf)), infsup (1.009576582776886999e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (1.0, 1.0)), infsup (1.100000000000000089e+00, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (1.0, 2.5)), infsup (1.100000000000000089e+00, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (1.0, inf)), infsup (1.100000000000000089e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (2.5, 2.5)), infsup (1.269058706285883575e+00, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (2.5, inf)), infsup (1.269058706285883575e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-0.1, 0.1)), infsup (9.602645007922180342e-01, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-0.1, 1.0)), infsup (9.602645007922180342e-01, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-0.1, 2.5)), infsup (9.602645007922180342e-01, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-0.1, inf)), infsup (9.602645007922180342e-01, inf))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-1.0, 0.1)), infsup (6.666666666666666297e-01, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-1.0, 1.0)), infsup (6.666666666666666297e-01, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-1.0, 2.5)), infsup (6.666666666666666297e-01, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-1.0, inf)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-2.5, 0.1)), infsup (3.628873693012115154e-01, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-2.5, 1.0)), infsup (3.628873693012115154e-01, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-2.5, 2.5)), infsup (3.628873693012115154e-01, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-2.5, inf)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-inf, 0.1)), infsup (0.000000000000000000e+00, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-inf, 1.0)), infsup (0.000000000000000000e+00, 1.500000000000000000e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-inf, 2.5)), infsup (0.000000000000000000e+00, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-inf, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-1.0, 0.0)), infsup (6.666666666666666297e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-1.0, -0.0)), infsup (6.666666666666666297e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-2.5, 0.0)), infsup (3.628873693012115154e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-2.5, -0.0)), infsup (3.628873693012115154e-01, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-inf, 0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-inf, -0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-0.1, -0.1)), infsup (9.602645007922180342e-01, 9.905142582145218810e-01))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-1.0, -0.1)), infsup (6.666666666666666297e-01, 9.905142582145218810e-01))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-2.5, -0.1)), infsup (3.628873693012115154e-01, 9.905142582145218810e-01))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-inf, -0.1)), infsup (0.000000000000000000e+00, 9.905142582145218810e-01))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-1.0, -1.0)), infsup (6.666666666666666297e-01, 9.090909090909090606e-01))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-2.5, -1.0)), infsup (3.628873693012115154e-01, 9.090909090909090606e-01))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-inf, -1.0)), infsup (0.000000000000000000e+00, 9.090909090909090606e-01))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-2.5, -2.5)), infsup (3.628873693012115154e-01, 7.879856109467704428e-01))); %!test %! assert (isequal (pow (infsup (1.1, 1.5), infsup (-inf, -2.5)), infsup (0.000000000000000000e+00, 7.879856109467704428e-01))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup), infsup)); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (0.0, 1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-0.0, 1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (0.0, 2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-0.0, 2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (0.1, 0.1)), infsup (1.009576582776886999e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (0.1, 1.0)), infsup (1.009576582776886999e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (0.1, 2.5)), infsup (1.009576582776886999e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (0.1, inf)), infsup (1.009576582776886999e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (1.0, 1.0)), infsup (1.100000000000000089e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (1.0, 2.5)), infsup (1.100000000000000089e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (1.0, inf)), infsup (1.100000000000000089e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (2.5, 2.5)), infsup (1.269058706285883575e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (2.5, inf)), infsup (1.269058706285883575e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-0.1, 0.1)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-0.1, 1.0)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-0.1, 2.5)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-0.1, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-1.0, 0.1)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-1.0, 1.0)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-1.0, 2.5)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-1.0, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-2.5, 0.1)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-2.5, 1.0)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-2.5, 2.5)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-2.5, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-inf, 0.1)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-inf, 1.0)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-inf, 2.5)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-inf, inf)), infsup (0.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-1.0, 0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-1.0, -0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-2.5, 0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-2.5, -0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-inf, 0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-inf, -0.0)), infsup (0.000000000000000000e+00, 1.0))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-0.1, -0.1)), infsup (0.000000000000000000e+00, 9.905142582145218810e-01))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-1.0, -0.1)), infsup (0.000000000000000000e+00, 9.905142582145218810e-01))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-2.5, -0.1)), infsup (0.000000000000000000e+00, 9.905142582145218810e-01))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-inf, -0.1)), infsup (0.000000000000000000e+00, 9.905142582145218810e-01))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-1.0, -1.0)), infsup (0.000000000000000000e+00, 9.090909090909090606e-01))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-2.5, -1.0)), infsup (0.000000000000000000e+00, 9.090909090909090606e-01))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-inf, -1.0)), infsup (0.000000000000000000e+00, 9.090909090909090606e-01))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-2.5, -2.5)), infsup (0.000000000000000000e+00, 7.879856109467704428e-01))); %!test %! assert (isequal (pow (infsup (1.1, inf), infsup (-inf, -2.5)), infsup (0.000000000000000000e+00, 7.879856109467704428e-01))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (0.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-0.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (0.1, 0.1)), infsup (0.0, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (0.1, 1.0)), infsup (0.0, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (0.1, 2.5)), infsup (0.0, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (0.1, inf)), infsup (0.0, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (1.0, 1.0)), infsup (0.0, 0.5))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (1.0, 2.5)), infsup (0.0, 0.5))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (1.0, inf)), infsup (0.0, 0.5))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (2.5, 2.5)), infsup (0.0, 1.767766952966368932e-01))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (2.5, inf)), infsup (0.0, 1.767766952966368932e-01))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-1.0, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-2.5, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-2.5, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-inf, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-inf, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-inf, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-1.0, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-1.0, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-2.5, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-2.5, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-inf, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-inf, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-0.1, -0.1)), infsup (1.071773462536293131e+00, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-1.0, -0.1)), infsup (1.071773462536293131e+00, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-2.5, -0.1)), infsup (1.071773462536293131e+00, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-inf, -0.1)), infsup (1.071773462536293131e+00, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-1.0, -1.0)), infsup (2.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-2.5, -1.0)), infsup (2.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-inf, -1.0)), infsup (2.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-2.5, -2.5)), infsup (5.656854249492379694e+00, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.5), infsup (-inf, -2.5)), infsup (5.656854249492379694e+00, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (0.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-0.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (0.1, 0.1)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (0.1, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (0.1, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (0.1, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (1.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (1.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (1.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (2.5, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (2.5, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-1.0, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-2.5, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-2.5, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-inf, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-inf, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-inf, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-0.1, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-0.1, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-1.0, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-1.0, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-2.5, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-2.5, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-inf, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-inf, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-0.1, -0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-1.0, -0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-2.5, -0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-inf, -0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-1.0, -1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-2.5, -1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-inf, -1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-2.5, -2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.0), infsup (-inf, -2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (0.0, 1.0)), infsup (0.0, 1.5))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-0.0, 1.0)), infsup (0.0, 1.5))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (0.0, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-0.0, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (0.1, 0.1)), infsup (0.0, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (0.1, 1.0)), infsup (0.0, 1.5))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (0.1, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (1.0, 1.0)), infsup (0.0, 1.5))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (1.0, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (2.5, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-1.0, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-2.5, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-2.5, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-inf, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-inf, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-inf, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-1.0, 0.0)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-1.0, -0.0)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-2.5, 0.0)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-2.5, -0.0)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-inf, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-0.1, -0.1)), infsup (9.602645007922180342e-01, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-1.0, -0.1)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-2.5, -0.1)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-inf, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-1.0, -1.0)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-2.5, -1.0)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-inf, -1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-2.5, -2.5)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (0.0, 1.5), infsup (-inf, -2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup), infsup)); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (0.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-0.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (0.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-0.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-1.0, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-2.5, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-2.5, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-inf, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-inf, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-inf, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-1.0, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-1.0, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-2.5, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-2.5, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-inf, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-0.1, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-1.0, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-2.5, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-inf, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-1.0, -1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-2.5, -1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-inf, -1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-inf, -2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, inf), infsup (-2.5, -2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (0.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-0.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (0.1, 0.1)), infsup (0.0, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (0.1, 1.0)), infsup (0.0, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (0.1, 2.5)), infsup (0.0, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (0.1, inf)), infsup (0.0, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (1.0, 1.0)), infsup (0.0, 0.5))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (1.0, 2.5)), infsup (0.0, 0.5))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (1.0, inf)), infsup (0.0, 0.5))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (2.5, 2.5)), infsup (0.0, 1.767766952966368932e-01))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (2.5, inf)), infsup (0.0, 1.767766952966368932e-01))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-1.0, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-2.5, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-2.5, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-inf, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-inf, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-inf, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-1.0, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-1.0, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-2.5, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-2.5, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-inf, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-inf, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-0.1, -0.1)), infsup (1.071773462536293131e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-1.0, -0.1)), infsup (1.071773462536293131e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-2.5, -0.1)), infsup (1.071773462536293131e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-inf, -0.1)), infsup (1.071773462536293131e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-1.0, -1.0)), infsup (2.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-2.5, -1.0)), infsup (2.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-inf, -1.0)), infsup (2.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-2.5, -2.5)), infsup (5.656854249492379694e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 0.5), infsup (-inf, -2.5)), infsup (5.656854249492379694e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (0.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-0.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (0.1, 0.1)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (0.1, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (0.1, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (0.1, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (1.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (1.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (1.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (2.5, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (2.5, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-1.0, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-2.5, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-2.5, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-inf, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-inf, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-inf, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-0.1, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-0.1, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-1.0, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-1.0, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-2.5, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-2.5, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-inf, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-inf, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-0.1, -0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-1.0, -0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-2.5, -0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-inf, -0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-1.0, -1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-2.5, -1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-inf, -1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-2.5, -2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.0), infsup (-inf, -2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (0.0, 1.0)), infsup (0.0, 1.5))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-0.0, 1.0)), infsup (0.0, 1.5))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (0.0, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-0.0, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (0.1, 0.1)), infsup (0.0, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (0.1, 1.0)), infsup (0.0, 1.5))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (0.1, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (1.0, 1.0)), infsup (0.0, 1.5))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (1.0, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (2.5, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-1.0, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-2.5, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-2.5, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-inf, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-inf, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-inf, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-1.0, 0.0)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-1.0, -0.0)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-2.5, 0.0)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-2.5, -0.0)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-inf, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-0.1, -0.1)), infsup (9.602645007922180342e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-1.0, -0.1)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-2.5, -0.1)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-inf, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-1.0, -1.0)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-2.5, -1.0)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-inf, -1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-2.5, -2.5)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.0, 1.5), infsup (-inf, -2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (0.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-0.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (0.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-0.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-1.0, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-2.5, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-2.5, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-inf, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-inf, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-inf, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-1.0, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-1.0, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-2.5, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-2.5, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-inf, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-0.1, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-1.0, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-2.5, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-inf, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-1.0, -1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-2.5, -1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-inf, -1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-inf, -2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.0, inf), infsup (-2.5, -2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup), infsup)); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (0.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-0.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (0.1, 0.1)), infsup (0.0, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (0.1, 1.0)), infsup (0.0, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (0.1, 2.5)), infsup (0.0, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (0.1, inf)), infsup (0.0, 9.330329915368075211e-01))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (1.0, 1.0)), infsup (0.0, 0.5))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (1.0, 2.5)), infsup (0.0, 0.5))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (1.0, inf)), infsup (0.0, 0.5))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (2.5, 2.5)), infsup (0.0, 1.767766952966368932e-01))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (2.5, inf)), infsup (0.0, 1.767766952966368932e-01))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-1.0, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-2.5, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-2.5, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-inf, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-inf, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-inf, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-1.0, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-1.0, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-2.5, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-2.5, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-inf, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-inf, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-0.1, -0.1)), infsup (1.071773462536293131e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-1.0, -0.1)), infsup (1.071773462536293131e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-2.5, -0.1)), infsup (1.071773462536293131e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-inf, -0.1)), infsup (1.071773462536293131e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-1.0, -1.0)), infsup (2.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-2.5, -1.0)), infsup (2.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-inf, -1.0)), infsup (2.000000000000000000e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-2.5, -2.5)), infsup (5.656854249492379694e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 0.5), infsup (-inf, -2.5)), infsup (5.656854249492379694e+00, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup), infsup)); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-0.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (0.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-0.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (0.1, 0.1)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (0.1, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (0.1, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (0.1, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (1.0, 1.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (1.0, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (1.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (2.5, 2.5)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (2.5, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-1.0, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-2.5, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-2.5, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-inf, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-inf, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-inf, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-0.1, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-0.1, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-1.0, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-1.0, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-2.5, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-2.5, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-inf, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-inf, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-0.1, -0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-1.0, -0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-2.5, -0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-inf, -0.1)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-1.0, -1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-2.5, -1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-inf, -1.0)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-2.5, -2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.0), infsup (-inf, -2.5)), infsup (1.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup), infsup)); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (0.0, 1.0)), infsup (0.0, 1.5))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-0.0, 1.0)), infsup (0.0, 1.5))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (0.0, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-0.0, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (0.1, 0.1)), infsup (0.0, 1.041379743992410623e+00))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (0.1, 1.0)), infsup (0.0, 1.5))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (0.1, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (1.0, 1.0)), infsup (0.0, 1.5))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (1.0, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (2.5, 2.5)), infsup (0.0, 2.755675960631075672e+00))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-1.0, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-2.5, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-2.5, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-inf, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-inf, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-inf, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-1.0, 0.0)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-1.0, -0.0)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-2.5, 0.0)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-2.5, -0.0)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-inf, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-0.1, -0.1)), infsup (9.602645007922180342e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-1.0, -0.1)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-2.5, -0.1)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-inf, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-1.0, -1.0)), infsup (6.666666666666666297e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-2.5, -1.0)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-inf, -1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-2.5, -2.5)), infsup (3.628873693012115154e-01, inf))); %!test %! assert (isequal (pow (infsup (-0.1, 1.5), infsup (-inf, -2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup), infsup)); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (0.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-0.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (0.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-0.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-0.1, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-0.1, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-0.1, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-0.1, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-1.0, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-1.0, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-1.0, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-2.5, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-2.5, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-2.5, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-2.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-inf, 0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-inf, 1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-inf, 2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-1.0, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-1.0, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-2.5, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-2.5, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-inf, 0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-inf, -0.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-0.1, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-1.0, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-2.5, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-inf, -0.1)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-1.0, -1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-2.5, -1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-inf, -1.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-inf, -2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (-0.1, inf), infsup (-2.5, -2.5)), infsup (0.0, inf))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (0.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-0.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (0.1, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (0.1, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (0.1, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (1.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (2.5, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (2.5, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-0.1, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-0.1, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-0.1, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-1.0, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-1.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-2.5, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-2.5, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-2.5, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-2.5, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-inf, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-inf, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-inf, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-1.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-1.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-2.5, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-2.5, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-inf, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-0.1, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-1.0, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-2.5, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-1.0, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-2.5, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-inf, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-inf, -2.5)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, 0.0), infsup (-2.5, -2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (0.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-0.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (0.1, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (0.1, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (0.1, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (1.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (2.5, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (2.5, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-0.1, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-0.1, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-0.1, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-1.0, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-1.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-2.5, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-2.5, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-2.5, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-2.5, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-inf, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-inf, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-inf, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-1.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-1.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-2.5, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-2.5, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-inf, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-0.1, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-1.0, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-2.5, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-1.0, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-2.5, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-inf, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-inf, -2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, -0.0), infsup (-2.5, -2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (0.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-0.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (0.1, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (0.1, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (0.1, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (1.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (2.5, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (2.5, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-0.1, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-0.1, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-0.1, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-1.0, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-1.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-2.5, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-2.5, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-2.5, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-2.5, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-inf, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-inf, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-inf, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-1.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-1.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-2.5, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-2.5, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-inf, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-0.1, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-1.0, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-2.5, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-1.0, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-2.5, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-inf, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-inf, -2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-0.0, 0.0), infsup (-2.5, -2.5)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (0.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-0.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (0.1, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (0.1, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (0.1, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (1.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (2.5, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (2.5, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-0.1, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-0.1, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-0.1, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-1.0, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-1.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-2.5, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-2.5, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-2.5, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-2.5, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-inf, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-inf, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-inf, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-1.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-1.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-2.5, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-2.5, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-inf, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-0.1, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-1.0, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-2.5, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-1.0, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-2.5, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-inf, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-inf, -2.5)), infsup)); %!test %! assert (isequal (pow (infsup (0.0, -0.0), infsup (-2.5, -2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (0.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-0.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (0.1, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (0.1, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (0.1, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (1.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (2.5, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (2.5, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-0.1, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-0.1, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-0.1, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-1.0, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-1.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-2.5, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-2.5, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-2.5, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-2.5, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-inf, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-inf, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-inf, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-1.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-1.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-2.5, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-2.5, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-inf, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-0.1, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-1.0, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-2.5, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-1.0, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-2.5, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-inf, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-inf, -2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, 0.0), infsup (-2.5, -2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (0.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-0.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-0.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (0.1, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (0.1, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (0.1, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (1.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (2.5, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (2.5, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-0.1, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-0.1, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-0.1, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-1.0, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-1.0, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-2.5, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-2.5, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-2.5, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-2.5, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-inf, 0.1)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-inf, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-inf, 2.5)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-1.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-1.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-2.5, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-2.5, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-inf, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-0.1, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-1.0, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-2.5, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-1.0, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-2.5, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-inf, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-inf, -2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.0), infsup (-2.5, -2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (0.0, 1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-0.0, 1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (0.0, 2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-0.0, 2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (0.0, inf)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-0.0, inf)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (0.1, 0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (0.1, 1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (0.1, 2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (0.1, inf)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (1.0, 1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (1.0, 2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (1.0, inf)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (2.5, 2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (2.5, inf)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-0.1, 0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-0.1, 1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-0.1, 2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-0.1, inf)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-1.0, 0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-1.0, 1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-1.0, 2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-1.0, inf)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-2.5, 0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-2.5, 1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-2.5, 2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-2.5, inf)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-inf, 0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-inf, 1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-inf, 2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-1.0, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-1.0, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-2.5, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-2.5, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-inf, -0.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-0.1, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-1.0, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-2.5, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-inf, -0.1)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-1.0, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-2.5, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-inf, -1.0)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-inf, -2.5)), infsup)); %!test %! assert (isequal (pow (infsup (-1.0, -0.1), infsup (-2.5, -2.5)), infsup)); ## minimal_pow_dec_test %!test %! assert (isequal (pow (infsupdec (0.1, 0.5, "com"), infsupdec (0.0, 1.0, "com")), infsupdec (1.000000000000000056e-01, 1.0, "com"))); %! assert (isequal (decorationpart (pow (infsupdec (0.1, 0.5, "com"), infsupdec (0.0, 1.0, "com"))){1}, decorationpart (infsupdec (1.000000000000000056e-01, 1.0, "com")){1})); %!test %! assert (isequal (pow (infsupdec (0.1, 0.5, "com"), infsupdec (0.1, 0.1, "def")), infsupdec (7.943282347242814900e-01, 9.330329915368075211e-01, "def"))); %! assert (isequal (decorationpart (pow (infsupdec (0.1, 0.5, "com"), infsupdec (0.1, 0.1, "def"))){1}, decorationpart (infsupdec (7.943282347242814900e-01, 9.330329915368075211e-01, "def")){1})); %!test %! assert (isequal (pow (infsupdec (0.1, 0.5, "trv"), infsupdec (-2.5, 2.5, "dac")), infsupdec (3.162277660168379394e-03, 3.162277660168379043e+02, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.1, 0.5, "trv"), infsupdec (-2.5, 2.5, "dac"))){1}, decorationpart (infsupdec (3.162277660168379394e-03, 3.162277660168379043e+02, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.1, 0.5, "com"), infsupdec (-2.5, inf, "dac")), infsupdec (0.0, 3.162277660168379043e+02, "dac"))); %! assert (isequal (decorationpart (pow (infsupdec (0.1, 0.5, "com"), infsupdec (-2.5, inf, "dac"))){1}, decorationpart (infsupdec (0.0, 3.162277660168379043e+02, "dac")){1})); %!test %! assert (isequal (pow (infsupdec (0.1, 0.5, "trv"), infsupdec (-inf, 0.1, "dac")), infsupdec (7.943282347242814900e-01, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.1, 0.5, "trv"), infsupdec (-inf, 0.1, "dac"))){1}, decorationpart (infsupdec (7.943282347242814900e-01, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.1, 1.0, "com"), infsupdec (0.0, 2.5, "com")), infsupdec (3.162277660168379394e-03, 1.0, "com"))); %! assert (isequal (decorationpart (pow (infsupdec (0.1, 1.0, "com"), infsupdec (0.0, 2.5, "com"))){1}, decorationpart (infsupdec (3.162277660168379394e-03, 1.0, "com")){1})); %!test %! assert (isequal (pow (infsupdec (0.1, 1.0, "def"), infsupdec (1.0, 1.0, "dac")), infsupdec (1.000000000000000056e-01, 1.0, "def"))); %! assert (isequal (decorationpart (pow (infsupdec (0.1, 1.0, "def"), infsupdec (1.0, 1.0, "dac"))){1}, decorationpart (infsupdec (1.000000000000000056e-01, 1.0, "def")){1})); %!test %! assert (isequal (pow (infsupdec (0.1, 1.0, "trv"), infsupdec (-2.5, 1.0, "def")), infsupdec (1.000000000000000056e-01, 3.162277660168379043e+02, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.1, 1.0, "trv"), infsupdec (-2.5, 1.0, "def"))){1}, decorationpart (infsupdec (1.000000000000000056e-01, 3.162277660168379043e+02, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.5, 1.5, "dac"), infsupdec (0.1, 0.1, "com")), infsupdec (9.330329915368074101e-01, 1.041379743992410623e+00, "dac"))); %! assert (isequal (decorationpart (pow (infsupdec (0.5, 1.5, "dac"), infsupdec (0.1, 0.1, "com"))){1}, decorationpart (infsupdec (9.330329915368074101e-01, 1.041379743992410623e+00, "dac")){1})); %!test %! assert (isequal (pow (infsupdec (0.5, 1.5, "def"), infsupdec (-2.5, 0.1, "trv")), infsupdec (3.628873693012115154e-01, 5.656854249492380582e+00, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.5, 1.5, "def"), infsupdec (-2.5, 0.1, "trv"))){1}, decorationpart (infsupdec (3.628873693012115154e-01, 5.656854249492380582e+00, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.5, 1.5, "com"), infsupdec (-2.5, -2.5, "com")), infsupdec (3.628873693012115154e-01, 5.656854249492380582e+00, "com"))); %! assert (isequal (decorationpart (pow (infsupdec (0.5, 1.5, "com"), infsupdec (-2.5, -2.5, "com"))){1}, decorationpart (infsupdec (3.628873693012115154e-01, 5.656854249492380582e+00, "com")){1})); %!test %! assert (isequal (pow (infsupdec (0.5, inf, "dac"), infsupdec (0.1, 0.1, "com")), infsupdec (9.330329915368074101e-01, inf, "dac"))); %! assert (isequal (decorationpart (pow (infsupdec (0.5, inf, "dac"), infsupdec (0.1, 0.1, "com"))){1}, decorationpart (infsupdec (9.330329915368074101e-01, inf, "dac")){1})); %!test %! assert (isequal (pow (infsupdec (0.5, inf, "def"), infsupdec (-2.5, -0.0, "com")), infsupdec (0.0, 5.656854249492380582e+00, "def"))); %! assert (isequal (decorationpart (pow (infsupdec (0.5, inf, "def"), infsupdec (-2.5, -0.0, "com"))){1}, decorationpart (infsupdec (0.0, 5.656854249492380582e+00, "def")){1})); %!test %! assert (isequal (pow (infsupdec (1.0, 1.5, "com"), infsupdec (-0.1, 0.1, "def")), infsupdec (9.602645007922180342e-01, 1.041379743992410623e+00, "def"))); %! assert (isequal (decorationpart (pow (infsupdec (1.0, 1.5, "com"), infsupdec (-0.1, 0.1, "def"))){1}, decorationpart (infsupdec (9.602645007922180342e-01, 1.041379743992410623e+00, "def")){1})); %!test %! assert (isequal (pow (infsupdec (1.0, 1.5, "trv"), infsupdec (-0.1, -0.1, "com")), infsupdec (9.602645007922180342e-01, 1.0, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (1.0, 1.5, "trv"), infsupdec (-0.1, -0.1, "com"))){1}, decorationpart (infsupdec (9.602645007922180342e-01, 1.0, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (1.0, inf, "dac"), infsupdec (1.0, 1.0, "dac")), infsupdec (1.0, inf, "dac"))); %! assert (isequal (decorationpart (pow (infsupdec (1.0, inf, "dac"), infsupdec (1.0, 1.0, "dac"))){1}, decorationpart (infsupdec (1.0, inf, "dac")){1})); %!test %! assert (isequal (pow (infsupdec (1.0, inf, "def"), infsupdec (-1.0, -0.0, "dac")), infsupdec (0.000000000000000000e+00, 1.0, "def"))); %! assert (isequal (decorationpart (pow (infsupdec (1.0, inf, "def"), infsupdec (-1.0, -0.0, "dac"))){1}, decorationpart (infsupdec (0.000000000000000000e+00, 1.0, "def")){1})); %!test %! assert (isequal (pow (infsupdec (1.1, 1.5, "def"), infsupdec (1.0, 2.5, "com")), infsupdec (1.100000000000000089e+00, 2.755675960631075672e+00, "def"))); %! assert (isequal (decorationpart (pow (infsupdec (1.1, 1.5, "def"), infsupdec (1.0, 2.5, "com"))){1}, decorationpart (infsupdec (1.100000000000000089e+00, 2.755675960631075672e+00, "def")){1})); %!test %! assert (isequal (pow (infsupdec (1.1, 1.5, "com"), infsupdec (-0.1, -0.1, "com")), infsupdec (9.602645007922180342e-01, 9.905142582145218810e-01, "com"))); %! assert (isequal (decorationpart (pow (infsupdec (1.1, 1.5, "com"), infsupdec (-0.1, -0.1, "com"))){1}, decorationpart (infsupdec (9.602645007922180342e-01, 9.905142582145218810e-01, "com")){1})); %!test %! assert (isequal (pow (infsupdec (1.1, inf, "dac"), infsupdec (0.1, inf, "dac")), infsupdec (1.009576582776886999e+00, inf, "dac"))); %! assert (isequal (decorationpart (pow (infsupdec (1.1, inf, "dac"), infsupdec (0.1, inf, "dac"))){1}, decorationpart (infsupdec (1.009576582776886999e+00, inf, "dac")){1})); %!test %! assert (isequal (pow (infsupdec (1.1, inf, "def"), infsupdec (-2.5, inf, "dac")), infsupdec (0.000000000000000000e+00, inf, "def"))); %! assert (isequal (decorationpart (pow (infsupdec (1.1, inf, "def"), infsupdec (-2.5, inf, "dac"))){1}, decorationpart (infsupdec (0.000000000000000000e+00, inf, "def")){1})); %!test %! assert (isequal (pow (infsupdec (1.1, inf, "trv"), infsupdec (-inf, -1.0, "def")), infsupdec (0.000000000000000000e+00, 9.090909090909090606e-01, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (1.1, inf, "trv"), infsupdec (-inf, -1.0, "def"))){1}, decorationpart (infsupdec (0.000000000000000000e+00, 9.090909090909090606e-01, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 0.5, "com"), infsupdec (0.1, 0.1, "com")), infsupdec (0.0, 9.330329915368075211e-01, "com"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 0.5, "com"), infsupdec (0.1, 0.1, "com"))){1}, decorationpart (infsupdec (0.0, 9.330329915368075211e-01, "com")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 0.5, "com"), infsupdec (2.5, inf, "dac")), infsupdec (0.0, 1.767766952966368932e-01, "dac"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 0.5, "com"), infsupdec (2.5, inf, "dac"))){1}, decorationpart (infsupdec (0.0, 1.767766952966368932e-01, "dac")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 0.5, "com"), infsupdec (-inf, -2.5, "dac")), infsupdec (5.656854249492379694e+00, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 0.5, "com"), infsupdec (-inf, -2.5, "dac"))){1}, decorationpart (infsupdec (5.656854249492379694e+00, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 1.0, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (1.0, 1.0, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 1.0, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (1.0, 1.0, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 1.0, "def"), infsupdec (0.0, 2.5, "dac")), infsupdec (0.0, 1.0, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 1.0, "def"), infsupdec (0.0, 2.5, "dac"))){1}, decorationpart (infsupdec (0.0, 1.0, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 1.0, "dac"), infsupdec (1.0, 2.5, "com")), infsupdec (0.0, 1.0, "dac"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 1.0, "dac"), infsupdec (1.0, 2.5, "com"))){1}, decorationpart (infsupdec (0.0, 1.0, "dac")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 1.0, "com"), infsupdec (-2.5, 0.1, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 1.0, "com"), infsupdec (-2.5, 0.1, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 1.0, "def"), infsupdec (entire, "def")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 1.0, "def"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 1.0, "dac"), infsupdec (-0.1, 0.0, "com")), infsupdec (1.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 1.0, "dac"), infsupdec (-0.1, 0.0, "com"))){1}, decorationpart (infsupdec (1.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 1.0, "com"), infsupdec (-inf, 0.0, "dac")), infsupdec (1.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 1.0, "com"), infsupdec (-inf, 0.0, "dac"))){1}, decorationpart (infsupdec (1.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 1.0, "def"), infsupdec (-inf, -2.5, "dac")), infsupdec (1.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 1.0, "def"), infsupdec (-inf, -2.5, "dac"))){1}, decorationpart (infsupdec (1.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 1.5, "com"), infsupdec (0.0, 2.5, "com")), infsupdec (0.0, 2.755675960631075672e+00, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 1.5, "com"), infsupdec (0.0, 2.5, "com"))){1}, decorationpart (infsupdec (0.0, 2.755675960631075672e+00, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 1.5, "def"), infsupdec (2.5, 2.5, "dac")), infsupdec (0.0, 2.755675960631075672e+00, "def"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 1.5, "def"), infsupdec (2.5, 2.5, "dac"))){1}, decorationpart (infsupdec (0.0, 2.755675960631075672e+00, "def")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 1.5, "dac"), infsupdec (-1.0, 0.0, "com")), infsupdec (6.666666666666666297e-01, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 1.5, "dac"), infsupdec (-1.0, 0.0, "com"))){1}, decorationpart (infsupdec (6.666666666666666297e-01, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 1.5, "com"), infsupdec (-2.5, -2.5, "def")), infsupdec (3.628873693012115154e-01, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 1.5, "com"), infsupdec (-2.5, -2.5, "def"))){1}, decorationpart (infsupdec (3.628873693012115154e-01, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, inf, "dac"), infsupdec (0.1, 0.1, "com")), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, inf, "dac"), infsupdec (0.1, 0.1, "com"))){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, inf, "def"), infsupdec (-1.0, 1.0, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, inf, "def"), infsupdec (-1.0, 1.0, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, inf, "trv"), infsupdec (-inf, -1.0, "def")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, inf, "trv"), infsupdec (-inf, -1.0, "def"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, inf, "dac"), infsupdec (-2.5, -2.5, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, inf, "dac"), infsupdec (-2.5, -2.5, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 0.5, "com"), infsupdec (0.0, inf, "dac")), infsupdec (0.0, 1.0, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 0.5, "com"), infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, 1.0, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 0.5, "def"), infsupdec (0.1, inf, "def")), infsupdec (0.0, 9.330329915368075211e-01, "def"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 0.5, "def"), infsupdec (0.1, inf, "def"))){1}, decorationpart (infsupdec (0.0, 9.330329915368075211e-01, "def")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 0.5, "dac"), infsupdec (2.5, 2.5, "com")), infsupdec (0.0, 1.767766952966368932e-01, "dac"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 0.5, "dac"), infsupdec (2.5, 2.5, "com"))){1}, decorationpart (infsupdec (0.0, 1.767766952966368932e-01, "dac")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 0.5, "trv"), infsupdec (-2.5, -0.0, "dac")), infsupdec (1.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 0.5, "trv"), infsupdec (-2.5, -0.0, "dac"))){1}, decorationpart (infsupdec (1.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 0.5, "com"), infsupdec (-inf, -0.1, "def")), infsupdec (1.071773462536293131e+00, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 0.5, "com"), infsupdec (-inf, -0.1, "def"))){1}, decorationpart (infsupdec (1.071773462536293131e+00, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 0.5, "def"), infsupdec (-inf, -2.5, "dac")), infsupdec (5.656854249492379694e+00, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 0.5, "def"), infsupdec (-inf, -2.5, "dac"))){1}, decorationpart (infsupdec (5.656854249492379694e+00, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 1.0, "com"), infsupdec (2.5, 2.5, "dac")), infsupdec (0.0, 1.0, "dac"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 1.0, "com"), infsupdec (2.5, 2.5, "dac"))){1}, decorationpart (infsupdec (0.0, 1.0, "dac")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 1.0, "dac"), infsupdec (-1.0, inf, "def")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 1.0, "dac"), infsupdec (-1.0, inf, "def"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 1.0, "com"), infsupdec (entire, "def")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 1.0, "com"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 1.0, "def"), infsupdec (-2.5, -2.5, "com")), infsupdec (1.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 1.0, "def"), infsupdec (-2.5, -2.5, "com"))){1}, decorationpart (infsupdec (1.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 1.0, "dac"), infsupdec (-inf, -2.5, "def")), infsupdec (1.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 1.0, "dac"), infsupdec (-inf, -2.5, "def"))){1}, decorationpart (infsupdec (1.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 1.5, "com"), infsupdec (0.1, 2.5, "dac")), infsupdec (0.0, 2.755675960631075672e+00, "dac"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 1.5, "com"), infsupdec (0.1, 2.5, "dac"))){1}, decorationpart (infsupdec (0.0, 2.755675960631075672e+00, "dac")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 1.5, "def"), infsupdec (-1.0, 0.0, "trv")), infsupdec (6.666666666666666297e-01, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 1.5, "def"), infsupdec (-1.0, 0.0, "trv"))){1}, decorationpart (infsupdec (6.666666666666666297e-01, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 1.5, "dac"), infsupdec (-2.5, -0.1, "def")), infsupdec (3.628873693012115154e-01, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 1.5, "dac"), infsupdec (-2.5, -0.1, "def"))){1}, decorationpart (infsupdec (3.628873693012115154e-01, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 1.5, "com"), infsupdec (-2.5, -2.5, "com")), infsupdec (3.628873693012115154e-01, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 1.5, "com"), infsupdec (-2.5, -2.5, "com"))){1}, decorationpart (infsupdec (3.628873693012115154e-01, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, 1.5, "def"), infsupdec (-inf, -2.5, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, 1.5, "def"), infsupdec (-inf, -2.5, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, inf, "dac"), infsupdec (-0.1, inf, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, inf, "dac"), infsupdec (-0.1, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, inf, "def"), infsupdec (-2.5, -0.0, "com")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, inf, "def"), infsupdec (-2.5, -0.0, "com"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, inf, "trv"), infsupdec (-inf, 0.0, "def")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, inf, "trv"), infsupdec (-inf, 0.0, "def"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, inf, "dac"), infsupdec (-inf, -0.0, "trv")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, inf, "dac"), infsupdec (-inf, -0.0, "trv"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.0, inf, "def"), infsupdec (-inf, -1.0, "def")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.0, inf, "def"), infsupdec (-inf, -1.0, "def"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, 0.5, "def"), infsupdec (0.1, inf, "dac")), infsupdec (0.0, 9.330329915368075211e-01, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, 0.5, "def"), infsupdec (0.1, inf, "dac"))){1}, decorationpart (infsupdec (0.0, 9.330329915368075211e-01, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, 0.5, "com"), infsupdec (-0.1, -0.1, "com")), infsupdec (1.071773462536293131e+00, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, 0.5, "com"), infsupdec (-0.1, -0.1, "com"))){1}, decorationpart (infsupdec (1.071773462536293131e+00, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, 0.5, "dac"), infsupdec (-inf, -2.5, "def")), infsupdec (5.656854249492379694e+00, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, 0.5, "dac"), infsupdec (-inf, -2.5, "def"))){1}, decorationpart (infsupdec (5.656854249492379694e+00, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, 1.0, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (1.0, 1.0, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, 1.0, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (1.0, 1.0, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, 1.0, "dac"), infsupdec (-inf, 2.5, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, 1.0, "dac"), infsupdec (-inf, 2.5, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, 1.0, "def"), infsupdec (-inf, -1.0, "def")), infsupdec (1.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, 1.0, "def"), infsupdec (-inf, -1.0, "def"))){1}, decorationpart (infsupdec (1.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, 1.0, "com"), infsupdec (-2.5, -2.5, "com")), infsupdec (1.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, 1.0, "com"), infsupdec (-2.5, -2.5, "com"))){1}, decorationpart (infsupdec (1.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, 1.0, "trv"), infsupdec (-inf, -2.5, "trv")), infsupdec (1.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, 1.0, "trv"), infsupdec (-inf, -2.5, "trv"))){1}, decorationpart (infsupdec (1.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, 1.5, "trv"), infsupdec (0.0, 2.5, "com")), infsupdec (0.0, 2.755675960631075672e+00, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, 1.5, "trv"), infsupdec (0.0, 2.5, "com"))){1}, decorationpart (infsupdec (0.0, 2.755675960631075672e+00, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, 1.5, "com"), infsupdec (2.5, 2.5, "dac")), infsupdec (0.0, 2.755675960631075672e+00, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, 1.5, "com"), infsupdec (2.5, 2.5, "dac"))){1}, decorationpart (infsupdec (0.0, 2.755675960631075672e+00, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, 1.5, "dac"), infsupdec (-1.0, 0.0, "trv")), infsupdec (6.666666666666666297e-01, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, 1.5, "dac"), infsupdec (-1.0, 0.0, "trv"))){1}, decorationpart (infsupdec (6.666666666666666297e-01, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, 1.5, "com"), infsupdec (-0.1, -0.1, "com")), infsupdec (9.602645007922180342e-01, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, 1.5, "com"), infsupdec (-0.1, -0.1, "com"))){1}, decorationpart (infsupdec (9.602645007922180342e-01, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, 1.5, "def"), infsupdec (-2.5, -2.5, "def")), infsupdec (3.628873693012115154e-01, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, 1.5, "def"), infsupdec (-2.5, -2.5, "def"))){1}, decorationpart (infsupdec (3.628873693012115154e-01, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, inf, "dac"), infsupdec (-0.1, 2.5, "com")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, inf, "dac"), infsupdec (-0.1, 2.5, "com"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, inf, "def"), infsupdec (-2.5, 0.0, "def")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, inf, "def"), infsupdec (-2.5, 0.0, "def"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-0.1, inf, "dac"), infsupdec (-2.5, -2.5, "trv")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-0.1, inf, "dac"), infsupdec (-2.5, -2.5, "trv"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 0.0, "com"), infsupdec (1.0, inf, "dac")), infsupdec (0.0, 0.0, "dac"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 0.0, "com"), infsupdec (1.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, 0.0, "dac")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 0.0, "com"), infsupdec (-2.5, 0.1, "com")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 0.0, "com"), infsupdec (-2.5, 0.1, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (0.0, 0.0, "dac"), infsupdec (-1.0, 0.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (0.0, 0.0, "dac"), infsupdec (-1.0, 0.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-1.0, -0.1, "com"), infsupdec (-0.1, 1.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-1.0, -0.1, "com"), infsupdec (-0.1, 1.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-1.0, -0.1, "dac"), infsupdec (-0.1, 2.5, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-1.0, -0.1, "dac"), infsupdec (-0.1, 2.5, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (pow (infsupdec (-1.0, -0.1, "def"), infsupdec (-0.1, inf, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (pow (infsupdec (-1.0, -0.1, "def"), infsupdec (-0.1, inf, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); ## minimal_exp_test %!test %! assert (isequal (exp (infsup), infsup)); %!test %! assert (isequal (exp (infsup (-inf, 0.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (exp (infsup (-inf, -0.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (exp (infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (exp (infsup (-0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (exp (infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (exp (infsup (-inf, 7.097827128933840868e+02)), infsup (0.0, inf))); %!test %! assert (isequal (exp (infsup (7.097827128933840868e+02, 7.097827128933840868e+02)), infsup (1.797693134862315708e+308, inf))); %!test %! assert (isequal (exp (infsup (0.0, 7.097827128933822678e+02)), infsup (1.0, 1.797693134859207786e+308))); %!test %! assert (isequal (exp (infsup (-0.0, 7.097827128933822678e+02)), infsup (1.0, 1.797693134859207786e+308))); %!test %! assert (isequal (exp (infsup (-7.083964185322641924e+02, 7.097827128933822678e+02)), infsup (2.225073858507009192e-308, 1.797693134859207786e+308))); %!test %! assert (isequal (exp (infsup (-3.541982092661320962e+02, 7.097827128933822678e+02)), infsup (1.491668146239976927e-154, 1.797693134859207786e+308))); %!test %! assert (isequal (exp (infsup (-3.541982092661320962e+02, 0.0)), infsup (1.491668146239976927e-154, 1.0))); %!test %! assert (isequal (exp (infsup (-3.541982092661320962e+02, -0.0)), infsup (1.491668146239976927e-154, 1.0))); %!test %! assert (isequal (exp (infsup (-3.541982092661320962e+02, 1.0)), infsup (1.491668146239976927e-154, 2.718281828459045535e+00))); %!test %! assert (isequal (exp (infsup (1.0, 5.0)), infsup (2.718281828459045091e+00, 1.484131591025766284e+02))); %!test %! assert (isequal (exp (infsup (-3.321928094887362626e+00, 1.807354922057604174e+00)), infsup (3.608319282078719520e-02, 6.094306179356355990e+00))); %!test %! assert (isequal (exp (infsup (7.655347463629769145e-01, 9.883328352961747498e+01)), infsup (2.150143848892317244e+00, 8.370466551497384459e+42))); %!test %! assert (isequal (exp (infsup (1.175028826901562873e+01, 2.599046225837774315e+01)), infsup (1.267901033964801463e+05, 1.938716653660042725e+11))); ## minimal_exp_dec_test %!test %! assert (isequal (exp (infsupdec (7.097827128933840868e+02, 7.097827128933840868e+02, "com")), infsupdec (1.797693134862315708e+308, inf, "dac"))); %! assert (isequal (decorationpart (exp (infsupdec (7.097827128933840868e+02, 7.097827128933840868e+02, "com"))){1}, decorationpart (infsupdec (1.797693134862315708e+308, inf, "dac")){1})); %!test %! assert (isequal (exp (infsupdec (0.0, 7.097827128933822678e+02, "def")), infsupdec (1.0, 1.797693134859207786e+308, "def"))); %! assert (isequal (decorationpart (exp (infsupdec (0.0, 7.097827128933822678e+02, "def"))){1}, decorationpart (infsupdec (1.0, 1.797693134859207786e+308, "def")){1})); ## minimal_exp2_test %!test %! assert (isequal (pow2 (infsup), infsup)); %!test %! assert (isequal (pow2 (infsup (-inf, 0.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow2 (infsup (-inf, -0.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow2 (infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow2 (infsup (-0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow2 (infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow2 (infsup (-inf, 1024.0)), infsup (0.0, inf))); %!test %! assert (isequal (pow2 (infsup (1024.0, 1024.0)), infsup (1.797693134862315708e+308, inf))); %!test %! assert (isequal (pow2 (infsup (0.0, 1023.0)), infsup (1.0, 8.988465674311579539e+307))); %!test %! assert (isequal (pow2 (infsup (-0.0, 1023.0)), infsup (1.0, 8.988465674311579539e+307))); %!test %! assert (isequal (pow2 (infsup (-1022.0, 1023.0)), infsup (2.225073858507201383e-308, 8.988465674311579539e+307))); %!test %! assert (isequal (pow2 (infsup (-1022.0, 0.0)), infsup (2.225073858507201383e-308, 1.0))); %!test %! assert (isequal (pow2 (infsup (-1022.0, -0.0)), infsup (2.225073858507201383e-308, 1.0))); %!test %! assert (isequal (pow2 (infsup (-1022.0, 1.0)), infsup (2.225073858507201383e-308, 2.0))); %!test %! assert (isequal (pow2 (infsup (1.0, 5.0)), infsup (2.0, 32.0))); %!test %! assert (isequal (pow2 (infsup (-3.321928094887362626e+00, 1.807354922057604174e+00)), infsup (9.999999999999997780e-02, 3.500000000000000444e+00))); %!test %! assert (isequal (pow2 (infsup (7.655347463629769145e-01, 9.883328352961747498e+01)), infsup (1.699999999999999734e+00, 5.646546544444466696e+29))); %!test %! assert (isequal (pow2 (infsup (1.175028826901562873e+01, 2.599046225837774315e+01)), infsup (3.445000003400298283e+03, 6.666666666666669399e+07))); ## minimal_exp2_dec_test %!test %! assert (isequal (pow2 (infsupdec (1024.0, 1024.0, "com")), infsupdec (1.797693134862315708e+308, inf, "dac"))); %! assert (isequal (decorationpart (pow2 (infsupdec (1024.0, 1024.0, "com"))){1}, decorationpart (infsupdec (1.797693134862315708e+308, inf, "dac")){1})); %!test %! assert (isequal (pow2 (infsupdec (7.655347463629769145e-01, 9.883328352961747498e+01, "def")), infsupdec (1.699999999999999734e+00, 5.646546544444466696e+29, "def"))); %! assert (isequal (decorationpart (pow2 (infsupdec (7.655347463629769145e-01, 9.883328352961747498e+01, "def"))){1}, decorationpart (infsupdec (1.699999999999999734e+00, 5.646546544444466696e+29, "def")){1})); ## minimal_exp10_test %!test %! assert (isequal (pow10 (infsup), infsup)); %!test %! assert (isequal (pow10 (infsup (-inf, 0.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow10 (infsup (-inf, -0.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (pow10 (infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow10 (infsup (-0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (pow10 (infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (pow10 (infsup (-inf, 3.082547155599167468e+02)), infsup (0.0, inf))); %!test %! assert (isequal (pow10 (infsup (3.082547155599167468e+02, 3.082547155599167468e+02)), infsup (1.797693134862315708e+308, inf))); %!test %! assert (isequal (pow10 (infsup (0.0, 3.082547155599166899e+02)), infsup (1.0, 1.797693134862092573e+308))); %!test %! assert (isequal (pow10 (infsup (-0.0, 3.082547155599166899e+02)), infsup (1.0, 1.797693134862092573e+308))); %!test %! assert (isequal (pow10 (infsup (-3.076526555685887843e+02, 3.082547155599166899e+02)), infsup (2.225073858507187055e-308, 1.797693134862092573e+308))); %!test %! assert (isequal (pow10 (infsup (-1.450000000000000000e+02, 3.082547155599166899e+02)), infsup (9.999999999999999149e-146, 1.797693134862092573e+308))); %!test %! assert (isequal (pow10 (infsup (-1.450000000000000000e+02, 0.0)), infsup (9.999999999999999149e-146, 1.0))); %!test %! assert (isequal (pow10 (infsup (-1.450000000000000000e+02, -0.0)), infsup (9.999999999999999149e-146, 1.0))); %!test %! assert (isequal (pow10 (infsup (-1.450000000000000000e+02, 1.0)), infsup (9.999999999999999149e-146, 10.0))); %!test %! assert (isequal (pow10 (infsup (1.0, 5.0)), infsup (10.0, 100000.0))); %!test %! assert (isequal (pow10 (infsup (-3.321928094887362626e+00, 1.807354922057604174e+00)), infsup (4.765098748902241383e-04, 6.417338117537050834e+01))); %!test %! assert (isequal (pow10 (infsup (7.655347463629769145e-01, 9.883328352961747498e+01)), infsup (5.828204023267978151e+00, 6.812139448068793717e+98))); %!test %! assert (isequal (pow10 (infsup (1.175028826901562873e+01, 2.599046225837774315e+01)), infsup (5.627147109892520752e+11, 9.782779355126447395e+25))); ## minimal_exp10_dec_test %!test %! assert (isequal (pow10 (infsupdec (3.082547155599167468e+02, 3.082547155599167468e+02, "com")), infsupdec (1.797693134862315708e+308, inf, "dac"))); %! assert (isequal (decorationpart (pow10 (infsupdec (3.082547155599167468e+02, 3.082547155599167468e+02, "com"))){1}, decorationpart (infsupdec (1.797693134862315708e+308, inf, "dac")){1})); %!test %! assert (isequal (pow10 (infsupdec (7.655347463629769145e-01, 9.883328352961747498e+01, "def")), infsupdec (5.828204023267978151e+00, 6.812139448068793717e+98, "def"))); %! assert (isequal (decorationpart (pow10 (infsupdec (7.655347463629769145e-01, 9.883328352961747498e+01, "def"))){1}, decorationpart (infsupdec (5.828204023267978151e+00, 6.812139448068793717e+98, "def")){1})); ## minimal_log_test %!test %! assert (isequal (log (infsup), infsup)); %!test %! assert (isequal (log (infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (log (infsup (-inf, -0.0)), infsup)); %!test %! assert (isequal (log (infsup (0.0, 1.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (log (infsup (-0.0, 1.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (log (infsup (1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (log (infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (log (infsup (-0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (log (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (log (infsup (0.0, 1.797693134862315708e+308)), infsup (-inf, 7.097827128933840868e+02))); %!test %! assert (isequal (log (infsup (-0.0, 1.797693134862315708e+308)), infsup (-inf, 7.097827128933840868e+02))); %!test %! assert (isequal (log (infsup (1.0, 1.797693134862315708e+308)), infsup (0.0, 7.097827128933840868e+02))); %!test %! assert (isequal (log (infsup (4.940656458412465442e-324, 1.797693134862315708e+308)), infsup (-7.444400719213813318e+02, 7.097827128933840868e+02))); %!test %! assert (isequal (log (infsup (4.940656458412465442e-324, 1.0)), infsup (-7.444400719213813318e+02, 0.0))); %!test %! assert (isequal (log (infsup (2.718281828459045091e+00, 2.718281828459045091e+00)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (log (infsup (2.718281828459045535e+00, 2.718281828459045535e+00)), infsup (1.000000000000000000e+00, 1.000000000000000222e+00))); %!test %! assert (isequal (log (infsup (4.940656458412465442e-324, 2.718281828459045535e+00)), infsup (-7.444400719213813318e+02, 1.000000000000000222e+00))); %!test %! assert (isequal (log (infsup (2.718281828459045091e+00, 32.0)), infsup (9.999999999999998890e-01, 3.465735902799726986e+00))); %!test %! assert (isequal (log (infsup (1.000000000000000056e-01, 3.500000000000000000e+00)), infsup (-2.302585092994045901e+00, 1.252762968495368057e+00))); %!test %! assert (isequal (log (infsup (1.699999999999999956e+00, 5.646546544444444178e+29)), infsup (5.306282510621702642e-01, 6.850601182403603673e+01))); %!test %! assert (isequal (log (infsup (3.445000003400302830e+03, 6.666666666666659713e+07)), infsup (8.144679184434783892e+00, 1.801521563584420349e+01))); ## minimal_log_dec_test %!test %! assert (isequal (log (infsupdec (4.940656458412465442e-324, 1.797693134862315708e+308, "com")), infsupdec (-7.444400719213813318e+02, 7.097827128933840868e+02, "com"))); %! assert (isequal (decorationpart (log (infsupdec (4.940656458412465442e-324, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (-7.444400719213813318e+02, 7.097827128933840868e+02, "com")){1})); %!test %! assert (isequal (log (infsupdec (0.0, 1.0, "com")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (log (infsupdec (0.0, 1.0, "com"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (log (infsupdec (2.718281828459045535e+00, 2.718281828459045535e+00, "def")), infsupdec (1.000000000000000000e+00, 1.000000000000000222e+00, "def"))); %! assert (isequal (decorationpart (log (infsupdec (2.718281828459045535e+00, 2.718281828459045535e+00, "def"))){1}, decorationpart (infsupdec (1.000000000000000000e+00, 1.000000000000000222e+00, "def")){1})); ## minimal_log2_test %!test %! assert (isequal (log2 (infsup), infsup)); %!test %! assert (isequal (log2 (infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (log2 (infsup (-inf, -0.0)), infsup)); %!test %! assert (isequal (log2 (infsup (0.0, 1.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (log2 (infsup (-0.0, 1.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (log2 (infsup (1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (log2 (infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (log2 (infsup (-0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (log2 (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (log2 (infsup (0.0, 1.797693134862315708e+308)), infsup (-inf, 1024.0))); %!test %! assert (isequal (log2 (infsup (-0.0, 1.797693134862315708e+308)), infsup (-inf, 1024.0))); %!test %! assert (isequal (log2 (infsup (1.0, 1.797693134862315708e+308)), infsup (0.0, 1024.0))); %!test %! assert (isequal (log2 (infsup (4.940656458412465442e-324, 1.797693134862315708e+308)), infsup (-1074.0, 1024.0))); %!test %! assert (isequal (log2 (infsup (4.940656458412465442e-324, 1.0)), infsup (-1074.0, 0.0))); %!test %! assert (isequal (log2 (infsup (4.940656458412465442e-324, 2.0)), infsup (-1074.0, 1.0))); %!test %! assert (isequal (log2 (infsup (2.0, 32.0)), infsup (1.0, 5.0))); %!test %! assert (isequal (log2 (infsup (1.000000000000000056e-01, 3.500000000000000000e+00)), infsup (-3.321928094887362626e+00, 1.807354922057604174e+00))); %!test %! assert (isequal (log2 (infsup (1.699999999999999956e+00, 5.646546544444444178e+29)), infsup (7.655347463629769145e-01, 9.883328352961747498e+01))); %!test %! assert (isequal (log2 (infsup (3.445000003400302830e+03, 6.666666666666659713e+07)), infsup (1.175028826901562873e+01, 2.599046225837774315e+01))); ## minimal_log2_dec_test %!test %! assert (isequal (log2 (infsupdec (4.940656458412465442e-324, 1.797693134862315708e+308, "com")), infsupdec (-1074.0, 1024.0, "com"))); %! assert (isequal (decorationpart (log2 (infsupdec (4.940656458412465442e-324, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (-1074.0, 1024.0, "com")){1})); %!test %! assert (isequal (log2 (infsupdec (4.940656458412465442e-324, inf, "dac")), infsupdec (-1074.0, inf, "dac"))); %! assert (isequal (decorationpart (log2 (infsupdec (4.940656458412465442e-324, inf, "dac"))){1}, decorationpart (infsupdec (-1074.0, inf, "dac")){1})); %!test %! assert (isequal (log2 (infsupdec (2.0, 32.0, "def")), infsupdec (1.0, 5.0, "def"))); %! assert (isequal (decorationpart (log2 (infsupdec (2.0, 32.0, "def"))){1}, decorationpart (infsupdec (1.0, 5.0, "def")){1})); %!test %! assert (isequal (log2 (infsupdec (0.0, 1.797693134862315708e+308, "com")), infsupdec (-inf, 1024.0, "trv"))); %! assert (isequal (decorationpart (log2 (infsupdec (0.0, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (-inf, 1024.0, "trv")){1})); ## minimal_log10_test %!test %! assert (isequal (log10 (infsup), infsup)); %!test %! assert (isequal (log10 (infsup (-inf, 0.0)), infsup)); %!test %! assert (isequal (log10 (infsup (-inf, -0.0)), infsup)); %!test %! assert (isequal (log10 (infsup (0.0, 1.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (log10 (infsup (-0.0, 1.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (log10 (infsup (1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (log10 (infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (log10 (infsup (-0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (log10 (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (log10 (infsup (0.0, 1.797693134862315708e+308)), infsup (-inf, 3.082547155599167468e+02))); %!test %! assert (isequal (log10 (infsup (-0.0, 1.797693134862315708e+308)), infsup (-inf, 3.082547155599167468e+02))); %!test %! assert (isequal (log10 (infsup (1.0, 1.797693134862315708e+308)), infsup (0.0, 3.082547155599167468e+02))); %!test %! assert (isequal (log10 (infsup (4.940656458412465442e-324, 1.797693134862315708e+308)), infsup (-3.233062153431158094e+02, 3.082547155599167468e+02))); %!test %! assert (isequal (log10 (infsup (4.940656458412465442e-324, 1.0)), infsup (-3.233062153431158094e+02, 0.0))); %!test %! assert (isequal (log10 (infsup (4.940656458412465442e-324, 10.0)), infsup (-3.233062153431158094e+02, 1.0))); %!test %! assert (isequal (log10 (infsup (10.0, 100000.0)), infsup (1.0, 5.0))); %!test %! assert (isequal (log10 (infsup (1.000000000000000056e-01, 3.500000000000000000e+00)), infsup (-1.000000000000000000e+00, 5.440680443502756702e-01))); %!test %! assert (isequal (log10 (infsup (1.000000000000000056e-01, 1.000000000000000056e-01)), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %!test %! assert (isequal (log10 (infsup (1.699999999999999956e+00, 5.646546544444444178e+29)), infsup (2.304489213782739132e-01, 2.975178291237777373e+01))); %!test %! assert (isequal (log10 (infsup (3.445000003400302830e+03, 6.666666666666659713e+07)), infsup (3.537189226672304176e+00, 7.823908740944318652e+00))); ## minimal_log10_dec_test %!test %! assert (isequal (log10 (infsupdec (4.940656458412465442e-324, 1.797693134862315708e+308, "com")), infsupdec (-3.233062153431158094e+02, 3.082547155599167468e+02, "com"))); %! assert (isequal (decorationpart (log10 (infsupdec (4.940656458412465442e-324, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (-3.233062153431158094e+02, 3.082547155599167468e+02, "com")){1})); %!test %! assert (isequal (log10 (infsupdec (0.0, 1.797693134862315708e+308, "dac")), infsupdec (-inf, 3.082547155599167468e+02, "trv"))); %! assert (isequal (decorationpart (log10 (infsupdec (0.0, 1.797693134862315708e+308, "dac"))){1}, decorationpart (infsupdec (-inf, 3.082547155599167468e+02, "trv")){1})); ## minimal_sin_test %!test %! assert (isequal (sin (infsup), infsup)); %!test %! assert (isequal (sin (infsup (0.0, inf)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-0.0, inf)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-inf, 0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-inf, -0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (-inf, inf)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sin (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (sin (infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (sin (infsup (1.570796326794896558e+00, 1.570796326794896558e+00)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (1.570796326794896780e+00, 1.570796326794896780e+00)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (1.570796326794896558e+00, 1.570796326794896780e+00)), infsup (9.999999999999998890e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (0.0, 1.570796326794896558e+00)), infsup (0.0, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (-0.0, 1.570796326794896558e+00)), infsup (0.0, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (0.0, 1.570796326794896780e+00)), infsup (0.0, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (-0.0, 1.570796326794896780e+00)), infsup (0.0, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (3.141592653589793116e+00, 3.141592653589793116e+00)), infsup (1.224646799147352961e-16, 1.224646799147353207e-16))); %!test %! assert (isequal (sin (infsup (3.141592653589793560e+00, 3.141592653589793560e+00)), infsup (-3.216245299353273201e-16, -3.216245299353272708e-16))); %!test %! assert (isequal (sin (infsup (3.141592653589793116e+00, 3.141592653589793560e+00)), infsup (-3.216245299353273201e-16, 1.224646799147353207e-16))); %!test %! assert (isequal (sin (infsup (0.0, 3.141592653589793116e+00)), infsup (0.0, 1.0))); %!test %! assert (isequal (sin (infsup (-0.0, 3.141592653589793116e+00)), infsup (0.0, 1.0))); %!test %! assert (isequal (sin (infsup (0.0, 3.141592653589793560e+00)), infsup (-3.216245299353273201e-16, 1.0))); %!test %! assert (isequal (sin (infsup (-0.0, 3.141592653589793560e+00)), infsup (-3.216245299353273201e-16, 1.0))); %!test %! assert (isequal (sin (infsup (1.570796326794896558e+00, 3.141592653589793116e+00)), infsup (1.224646799147352961e-16, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (1.570796326794896558e+00, 3.141592653589793560e+00)), infsup (-3.216245299353273201e-16, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (1.570796326794896780e+00, 3.141592653589793116e+00)), infsup (1.224646799147352961e-16, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (1.570796326794896780e+00, 3.141592653589793560e+00)), infsup (-3.216245299353273201e-16, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (-1.570796326794896558e+00, -1.570796326794896558e+00)), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %!test %! assert (isequal (sin (infsup (-1.570796326794896780e+00, -1.570796326794896780e+00)), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %!test %! assert (isequal (sin (infsup (-1.570796326794896780e+00, -1.570796326794896558e+00)), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %!test %! assert (isequal (sin (infsup (-1.570796326794896558e+00, 0.0)), infsup (-1.000000000000000000e+00, 0.0))); %!test %! assert (isequal (sin (infsup (-1.570796326794896558e+00, -0.0)), infsup (-1.000000000000000000e+00, 0.0))); %!test %! assert (isequal (sin (infsup (-1.570796326794896780e+00, 0.0)), infsup (-1.000000000000000000e+00, 0.0))); %!test %! assert (isequal (sin (infsup (-1.570796326794896780e+00, -0.0)), infsup (-1.000000000000000000e+00, 0.0))); %!test %! assert (isequal (sin (infsup (-3.141592653589793116e+00, -3.141592653589793116e+00)), infsup (-1.224646799147353207e-16, -1.224646799147352961e-16))); %!test %! assert (isequal (sin (infsup (-3.141592653589793560e+00, -3.141592653589793560e+00)), infsup (3.216245299353272708e-16, 3.216245299353273201e-16))); %!test %! assert (isequal (sin (infsup (-3.141592653589793560e+00, -3.141592653589793116e+00)), infsup (-1.224646799147353207e-16, 3.216245299353273201e-16))); %!test %! assert (isequal (sin (infsup (-3.141592653589793116e+00, 0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (sin (infsup (-3.141592653589793116e+00, -0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (sin (infsup (-3.141592653589793560e+00, 0.0)), infsup (-1.0, 3.216245299353273201e-16))); %!test %! assert (isequal (sin (infsup (-3.141592653589793560e+00, -0.0)), infsup (-1.0, 3.216245299353273201e-16))); %!test %! assert (isequal (sin (infsup (-3.141592653589793116e+00, -1.570796326794896558e+00)), infsup (-1.000000000000000000e+00, -1.224646799147352961e-16))); %!test %! assert (isequal (sin (infsup (-3.141592653589793560e+00, -1.570796326794896558e+00)), infsup (-1.000000000000000000e+00, 3.216245299353273201e-16))); %!test %! assert (isequal (sin (infsup (-3.141592653589793116e+00, -1.570796326794896780e+00)), infsup (-1.000000000000000000e+00, -1.224646799147352961e-16))); %!test %! assert (isequal (sin (infsup (-3.141592653589793560e+00, -1.570796326794896780e+00)), infsup (-1.000000000000000000e+00, 3.216245299353273201e-16))); %!test %! assert (isequal (sin (infsup (-1.570796326794896558e+00, 1.570796326794896558e+00)), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (-1.570796326794896558e+00, 1.570796326794896780e+00)), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (-1.570796326794896780e+00, 1.570796326794896558e+00)), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (-1.570796326794896780e+00, 1.570796326794896780e+00)), infsup (-1.000000000000000000e+00, 1.000000000000000000e+00))); %!test %! assert (isequal (sin (infsup (-0.7, 0.1)), infsup (-6.442176872376911279e-01, 9.983341664682816863e-02))); %!test %! assert (isequal (sin (infsup (1.0, 2.0)), infsup (8.414709848078965049e-01, 1.0))); %!test %! assert (isequal (sin (infsup (-3.2, -2.9)), infsup (-2.392493292139824257e-01, 5.837414342758009272e-02))); %!test %! assert (isequal (sin (infsup (2.0, 3.0)), infsup (1.411200080598672135e-01, 9.092974268256817094e-01))); ## minimal_sin_dec_test %!test %! assert (isequal (sin (infsupdec (-3.141592653589793116e+00, -1.570796326794896558e+00, "def")), infsupdec (-1.000000000000000000e+00, -1.224646799147352961e-16, "def"))); %! assert (isequal (decorationpart (sin (infsupdec (-3.141592653589793116e+00, -1.570796326794896558e+00, "def"))){1}, decorationpart (infsupdec (-1.000000000000000000e+00, -1.224646799147352961e-16, "def")){1})); %!test %! assert (isequal (sin (infsupdec (-inf, -0.0, "trv")), infsupdec (-1.0, 1.0, "trv"))); %! assert (isequal (decorationpart (sin (infsupdec (-inf, -0.0, "trv"))){1}, decorationpart (infsupdec (-1.0, 1.0, "trv")){1})); %!test %! assert (isequal (sin (infsupdec (entire, "def")), infsupdec (-1.0, 1.0, "def"))); %! assert (isequal (decorationpart (sin (infsupdec (entire, "def"))){1}, decorationpart (infsupdec (-1.0, 1.0, "def")){1})); ## minimal_cos_test %!test %! assert (isequal (cos (infsup), infsup)); %!test %! assert (isequal (cos (infsup (0.0, inf)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-0.0, inf)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-inf, 0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-inf, -0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-inf, inf)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (cos (infsup (1.570796326794896558e+00, 1.570796326794896558e+00)), infsup (6.123233995736764803e-17, 6.123233995736766036e-17))); %!test %! assert (isequal (cos (infsup (1.570796326794896780e+00, 1.570796326794896780e+00)), infsup (-1.608122649676636601e-16, -1.608122649676636354e-16))); %!test %! assert (isequal (cos (infsup (1.570796326794896558e+00, 1.570796326794896780e+00)), infsup (-1.608122649676636601e-16, 6.123233995736766036e-17))); %!test %! assert (isequal (cos (infsup (0.0, 1.570796326794896558e+00)), infsup (6.123233995736764803e-17, 1.0))); %!test %! assert (isequal (cos (infsup (-0.0, 1.570796326794896558e+00)), infsup (6.123233995736764803e-17, 1.0))); %!test %! assert (isequal (cos (infsup (0.0, 1.570796326794896780e+00)), infsup (-1.608122649676636601e-16, 1.0))); %!test %! assert (isequal (cos (infsup (-0.0, 1.570796326794896780e+00)), infsup (-1.608122649676636601e-16, 1.0))); %!test %! assert (isequal (cos (infsup (3.141592653589793116e+00, 3.141592653589793116e+00)), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %!test %! assert (isequal (cos (infsup (3.141592653589793560e+00, 3.141592653589793560e+00)), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %!test %! assert (isequal (cos (infsup (3.141592653589793116e+00, 3.141592653589793560e+00)), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %!test %! assert (isequal (cos (infsup (0.0, 3.141592653589793116e+00)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-0.0, 3.141592653589793116e+00)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (0.0, 3.141592653589793560e+00)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-0.0, 3.141592653589793560e+00)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (1.570796326794896558e+00, 3.141592653589793116e+00)), infsup (-1.0, 6.123233995736766036e-17))); %!test %! assert (isequal (cos (infsup (1.570796326794896558e+00, 3.141592653589793560e+00)), infsup (-1.0, 6.123233995736766036e-17))); %!test %! assert (isequal (cos (infsup (1.570796326794896780e+00, 3.141592653589793116e+00)), infsup (-1.0, -1.608122649676636354e-16))); %!test %! assert (isequal (cos (infsup (1.570796326794896780e+00, 3.141592653589793560e+00)), infsup (-1.0, -1.608122649676636354e-16))); %!test %! assert (isequal (cos (infsup (-1.570796326794896558e+00, -1.570796326794896558e+00)), infsup (6.123233995736764803e-17, 6.123233995736766036e-17))); %!test %! assert (isequal (cos (infsup (-1.570796326794896780e+00, -1.570796326794896780e+00)), infsup (-1.608122649676636601e-16, -1.608122649676636354e-16))); %!test %! assert (isequal (cos (infsup (-1.570796326794896780e+00, -1.570796326794896558e+00)), infsup (-1.608122649676636601e-16, 6.123233995736766036e-17))); %!test %! assert (isequal (cos (infsup (-1.570796326794896558e+00, 0.0)), infsup (6.123233995736764803e-17, 1.0))); %!test %! assert (isequal (cos (infsup (-1.570796326794896558e+00, -0.0)), infsup (6.123233995736764803e-17, 1.0))); %!test %! assert (isequal (cos (infsup (-1.570796326794896780e+00, 0.0)), infsup (-1.608122649676636601e-16, 1.0))); %!test %! assert (isequal (cos (infsup (-1.570796326794896780e+00, -0.0)), infsup (-1.608122649676636601e-16, 1.0))); %!test %! assert (isequal (cos (infsup (-3.141592653589793116e+00, -3.141592653589793116e+00)), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %!test %! assert (isequal (cos (infsup (-3.141592653589793560e+00, -3.141592653589793560e+00)), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %!test %! assert (isequal (cos (infsup (-3.141592653589793560e+00, -3.141592653589793116e+00)), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %!test %! assert (isequal (cos (infsup (-3.141592653589793116e+00, 0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-3.141592653589793116e+00, -0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-3.141592653589793560e+00, 0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-3.141592653589793560e+00, -0.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (cos (infsup (-3.141592653589793116e+00, -1.570796326794896558e+00)), infsup (-1.0, 6.123233995736766036e-17))); %!test %! assert (isequal (cos (infsup (-3.141592653589793560e+00, -1.570796326794896558e+00)), infsup (-1.0, 6.123233995736766036e-17))); %!test %! assert (isequal (cos (infsup (-3.141592653589793116e+00, -1.570796326794896780e+00)), infsup (-1.0, -1.608122649676636354e-16))); %!test %! assert (isequal (cos (infsup (-3.141592653589793560e+00, -1.570796326794896780e+00)), infsup (-1.0, -1.608122649676636354e-16))); %!test %! assert (isequal (cos (infsup (-1.570796326794896558e+00, 1.570796326794896558e+00)), infsup (6.123233995736764803e-17, 1.0))); %!test %! assert (isequal (cos (infsup (-1.570796326794896558e+00, 1.570796326794896780e+00)), infsup (-1.608122649676636601e-16, 1.0))); %!test %! assert (isequal (cos (infsup (-1.570796326794896780e+00, 1.570796326794896558e+00)), infsup (-1.608122649676636601e-16, 1.0))); %!test %! assert (isequal (cos (infsup (-1.570796326794896780e+00, 1.570796326794896780e+00)), infsup (-1.608122649676636601e-16, 1.0))); %!test %! assert (isequal (cos (infsup (-0.7, 0.1)), infsup (7.648421872844883840e-01, 1.0))); %!test %! assert (isequal (cos (infsup (1.0, 2.0)), infsup (-4.161468365471424069e-01, 5.403023058681397650e-01))); %!test %! assert (isequal (cos (infsup (-3.2, -2.9)), infsup (-1.0, -9.709581651495904353e-01))); %!test %! assert (isequal (cos (infsup (2.0, 3.0)), infsup (-9.899924966004455262e-01, -4.161468365471423514e-01))); ## minimal_cos_dec_test %!test %! assert (isequal (cos (infsupdec (-1.570796326794896558e+00, -1.570796326794896558e+00, "trv")), infsupdec (6.123233995736764803e-17, 6.123233995736766036e-17, "trv"))); %! assert (isequal (decorationpart (cos (infsupdec (-1.570796326794896558e+00, -1.570796326794896558e+00, "trv"))){1}, decorationpart (infsupdec (6.123233995736764803e-17, 6.123233995736766036e-17, "trv")){1})); %!test %! assert (isequal (cos (infsupdec (-inf, -0.0, "def")), infsupdec (-1.0, 1.0, "def"))); %! assert (isequal (decorationpart (cos (infsupdec (-inf, -0.0, "def"))){1}, decorationpart (infsupdec (-1.0, 1.0, "def")){1})); %!test %! assert (isequal (cos (infsupdec (entire, "def")), infsupdec (-1.0, 1.0, "def"))); %! assert (isequal (decorationpart (cos (infsupdec (entire, "def"))){1}, decorationpart (infsupdec (-1.0, 1.0, "def")){1})); ## minimal_tan_test %!test %! assert (isequal (tan (infsup), infsup)); %!test %! assert (isequal (tan (infsup (0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-0.0, inf)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-inf, 0.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-inf, -0.0)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (tan (infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (tan (infsup (1.570796326794896558e+00, 1.570796326794896558e+00)), infsup (1.633123935319536800e+16, 1.633123935319537000e+16))); %!test %! assert (isequal (tan (infsup (1.570796326794896780e+00, 1.570796326794896780e+00)), infsup (-6.218431163823739000e+15, -6.218431163823738000e+15))); %!test %! assert (isequal (tan (infsup (1.570796326794896558e+00, 1.570796326794896780e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (3.141592653589793116e+00, 3.141592653589793116e+00)), infsup (-1.224646799147353207e-16, -1.224646799147352961e-16))); %!test %! assert (isequal (tan (infsup (3.141592653589793560e+00, 3.141592653589793560e+00)), infsup (3.216245299353272708e-16, 3.216245299353273201e-16))); %!test %! assert (isequal (tan (infsup (0.0, 1.570796326794896558e+00)), infsup (0.0, 1.633123935319537000e+16))); %!test %! assert (isequal (tan (infsup (-0.0, 1.570796326794896558e+00)), infsup (0.0, 1.633123935319537000e+16))); %!test %! assert (isequal (tan (infsup (0.0, 1.570796326794896780e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-0.0, 1.570796326794896780e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (0.0, 3.141592653589793116e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-0.0, 3.141592653589793116e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (0.0, 3.141592653589793560e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-0.0, 3.141592653589793560e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (4.440892098500626162e-16, 3.141592653589793116e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (4.440892098500626162e-16, 3.141592653589793560e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (2.220446049250313081e-16, 3.141592653589793116e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (2.220446049250313081e-16, 3.141592653589793560e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-1.570796326794896558e+00, 1.570796326794896558e+00)), infsup (-1.633123935319537000e+16, 1.633123935319537000e+16))); %!test %! assert (isequal (tan (infsup (-1.570796326794896558e+00, 1.570796326794896780e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-1.570796326794896780e+00, 1.570796326794896558e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-1.570796326794896780e+00, 1.570796326794896780e+00)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (-3.333300000000000152e-01, 1.000000000000000056e-01)), infsup (-3.462498165431488473e-01, 1.003346720854505630e-01))); %!test %! assert (isequal (tan (infsup (5.345555000000000291e+03, 5.346010000000000218e+03)), infsup (-7.356840852049277402e+00, -1.493205097982578833e+00))); %!test %! assert (isequal (tan (infsup (5.345555000000000291e+03, 5.446010000000000218e+03)), infsup (-inf, inf))); %!test %! assert (isequal (tan (infsup (9.899999999999999911e-01, 1.010000000000000009e+00)), infsup (1.523676741017902181e+00, 1.592206024219570581e+00))); ## minimal_tan_dec_test %!test %! assert (isequal (tan (infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (0.0, inf, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (-0.0, inf, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (-0.0, inf, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (-inf, 0.0, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (-inf, 0.0, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (-inf, -0.0, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (-inf, -0.0, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (entire, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (0.0, 0.0, "com")), infsupdec (0.0, 0.0, "com"))); %! assert (isequal (decorationpart (tan (infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "com")){1})); %!test %! assert (isequal (tan (infsupdec (-0.0, -0.0, "def")), infsupdec (0.0, 0.0, "def"))); %! assert (isequal (decorationpart (tan (infsupdec (-0.0, -0.0, "def"))){1}, decorationpart (infsupdec (0.0, 0.0, "def")){1})); %!test %! assert (isequal (tan (infsupdec (1.570796326794896558e+00, 1.570796326794896558e+00, "com")), infsupdec (1.633123935319536800e+16, 1.633123935319537000e+16, "com"))); %! assert (isequal (decorationpart (tan (infsupdec (1.570796326794896558e+00, 1.570796326794896558e+00, "com"))){1}, decorationpart (infsupdec (1.633123935319536800e+16, 1.633123935319537000e+16, "com")){1})); %!test %! assert (isequal (tan (infsupdec (1.570796326794896780e+00, 1.570796326794896780e+00, "def")), infsupdec (-6.218431163823739000e+15, -6.218431163823738000e+15, "def"))); %! assert (isequal (decorationpart (tan (infsupdec (1.570796326794896780e+00, 1.570796326794896780e+00, "def"))){1}, decorationpart (infsupdec (-6.218431163823739000e+15, -6.218431163823738000e+15, "def")){1})); %!test %! assert (isequal (tan (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (3.141592653589793116e+00, 3.141592653589793116e+00, "trv")), infsupdec (-1.224646799147353207e-16, -1.224646799147352961e-16, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (3.141592653589793116e+00, 3.141592653589793116e+00, "trv"))){1}, decorationpart (infsupdec (-1.224646799147353207e-16, -1.224646799147352961e-16, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (3.141592653589793560e+00, 3.141592653589793560e+00, "com")), infsupdec (3.216245299353272708e-16, 3.216245299353273201e-16, "com"))); %! assert (isequal (decorationpart (tan (infsupdec (3.141592653589793560e+00, 3.141592653589793560e+00, "com"))){1}, decorationpart (infsupdec (3.216245299353272708e-16, 3.216245299353273201e-16, "com")){1})); %!test %! assert (isequal (tan (infsupdec (0.0, 1.570796326794896558e+00, "dac")), infsupdec (0.0, 1.633123935319537000e+16, "dac"))); %! assert (isequal (decorationpart (tan (infsupdec (0.0, 1.570796326794896558e+00, "dac"))){1}, decorationpart (infsupdec (0.0, 1.633123935319537000e+16, "dac")){1})); %!test %! assert (isequal (tan (infsupdec (-0.0, 1.570796326794896558e+00, "com")), infsupdec (0.0, 1.633123935319537000e+16, "com"))); %! assert (isequal (decorationpart (tan (infsupdec (-0.0, 1.570796326794896558e+00, "com"))){1}, decorationpart (infsupdec (0.0, 1.633123935319537000e+16, "com")){1})); %!test %! assert (isequal (tan (infsupdec (0.0, 1.570796326794896780e+00, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (0.0, 1.570796326794896780e+00, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (-0.0, 1.570796326794896780e+00, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (-0.0, 1.570796326794896780e+00, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (0.0, 3.141592653589793116e+00, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (0.0, 3.141592653589793116e+00, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (-0.0, 3.141592653589793116e+00, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (-0.0, 3.141592653589793116e+00, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (0.0, 3.141592653589793560e+00, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (0.0, 3.141592653589793560e+00, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (-0.0, 3.141592653589793560e+00, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (-0.0, 3.141592653589793560e+00, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (4.440892098500626162e-16, 3.141592653589793116e+00, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (4.440892098500626162e-16, 3.141592653589793116e+00, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (4.440892098500626162e-16, 3.141592653589793560e+00, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (4.440892098500626162e-16, 3.141592653589793560e+00, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (2.220446049250313081e-16, 3.141592653589793116e+00, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (2.220446049250313081e-16, 3.141592653589793116e+00, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (2.220446049250313081e-16, 3.141592653589793560e+00, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (2.220446049250313081e-16, 3.141592653589793560e+00, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (-1.570796326794896558e+00, 1.570796326794896558e+00, "com")), infsupdec (-1.633123935319537000e+16, 1.633123935319537000e+16, "com"))); %! assert (isequal (decorationpart (tan (infsupdec (-1.570796326794896558e+00, 1.570796326794896558e+00, "com"))){1}, decorationpart (infsupdec (-1.633123935319537000e+16, 1.633123935319537000e+16, "com")){1})); %!test %! assert (isequal (tan (infsupdec (-1.570796326794896558e+00, 1.570796326794896780e+00, "trv")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (-1.570796326794896558e+00, 1.570796326794896780e+00, "trv"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (-1.570796326794896780e+00, 1.570796326794896558e+00, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (-1.570796326794896780e+00, 1.570796326794896558e+00, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "dac")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "dac"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (-3.333300000000000152e-01, 1.000000000000000056e-01, "com")), infsupdec (-3.462498165431488473e-01, 1.003346720854505630e-01, "com"))); %! assert (isequal (decorationpart (tan (infsupdec (-3.333300000000000152e-01, 1.000000000000000056e-01, "com"))){1}, decorationpart (infsupdec (-3.462498165431488473e-01, 1.003346720854505630e-01, "com")){1})); %!test %! assert (isequal (tan (infsupdec (5.345555000000000291e+03, 5.346010000000000218e+03, "dac")), infsupdec (-7.356840852049277402e+00, -1.493205097982578833e+00, "dac"))); %! assert (isequal (decorationpart (tan (infsupdec (5.345555000000000291e+03, 5.346010000000000218e+03, "dac"))){1}, decorationpart (infsupdec (-7.356840852049277402e+00, -1.493205097982578833e+00, "dac")){1})); %!test %! assert (isequal (tan (infsupdec (5.345555000000000291e+03, 5.446010000000000218e+03, "def")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (5.345555000000000291e+03, 5.446010000000000218e+03, "def"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (tan (infsupdec (9.899999999999999911e-01, 1.010000000000000009e+00, "trv")), infsupdec (1.523676741017902181e+00, 1.592206024219570581e+00, "trv"))); %! assert (isequal (decorationpart (tan (infsupdec (9.899999999999999911e-01, 1.010000000000000009e+00, "trv"))){1}, decorationpart (infsupdec (1.523676741017902181e+00, 1.592206024219570581e+00, "trv")){1})); ## minimal_asin_test %!test %! assert (isequal (asin (infsup), infsup)); %!test %! assert (isequal (asin (infsup (0.0, inf)), infsup (0.0, 1.570796326794896780e+00))); %!test %! assert (isequal (asin (infsup (-0.0, inf)), infsup (0.0, 1.570796326794896780e+00))); %!test %! assert (isequal (asin (infsup (-inf, 0.0)), infsup (-1.570796326794896780e+00, 0.0))); %!test %! assert (isequal (asin (infsup (-inf, -0.0)), infsup (-1.570796326794896780e+00, 0.0))); %!test %! assert (isequal (asin (infsup (-inf, inf)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (asin (infsup (-1.0, 1.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (asin (infsup (-inf, -1.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (asin (infsup (1.0, inf)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (asin (infsup (-1.0, -1.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (asin (infsup (1.0, 1.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (asin (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (asin (infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (asin (infsup (-inf, -1.000000000000000222e+00)), infsup)); %!test %! assert (isequal (asin (infsup (1.000000000000000222e+00, inf)), infsup)); %!test %! assert (isequal (asin (infsup (-1.000000000000000056e-01, 1.000000000000000056e-01)), infsup (-1.001674211615598137e-01, 1.001674211615598137e-01))); %!test %! assert (isequal (asin (infsup (-3.300000000000000155e-01, 9.999999999999998890e-01)), infsup (-3.363035751539804052e-01, 1.570796311893735586e+00))); %!test %! assert (isequal (asin (infsup (-9.999999999999998890e-01, 9.999999999999998890e-01)), infsup (-1.570796311893735586e+00, 1.570796311893735586e+00))); ## minimal_asin_dec_test %!test %! assert (isequal (asin (infsupdec (0.0, inf, "dac")), infsupdec (0.0, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (asin (infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (asin (infsupdec (-inf, 0.0, "def")), infsupdec (-1.570796326794896780e+00, 0.0, "trv"))); %! assert (isequal (decorationpart (asin (infsupdec (-inf, 0.0, "def"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 0.0, "trv")){1})); %!test %! assert (isequal (asin (infsupdec (-1.0, 1.0, "com")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "com"))); %! assert (isequal (decorationpart (asin (infsupdec (-1.0, 1.0, "com"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "com")){1})); %!test %! assert (isequal (asin (infsupdec (entire, "def")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (asin (infsupdec (entire, "def"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (asin (infsupdec (-3.300000000000000155e-01, 9.999999999999998890e-01, "def")), infsupdec (-3.363035751539804052e-01, 1.570796311893735586e+00, "def"))); %! assert (isequal (decorationpart (asin (infsupdec (-3.300000000000000155e-01, 9.999999999999998890e-01, "def"))){1}, decorationpart (infsupdec (-3.363035751539804052e-01, 1.570796311893735586e+00, "def")){1})); ## minimal_acos_test %!test %! assert (isequal (acos (infsup), infsup)); %!test %! assert (isequal (acos (infsup (0.0, inf)), infsup (0.0, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-0.0, inf)), infsup (0.0, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-inf, 0.0)), infsup (1.570796326794896558e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (acos (infsup (-inf, -0.0)), infsup (1.570796326794896558e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (acos (infsup (-inf, inf)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (acos (infsup (-1.0, 1.0)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (acos (infsup (-inf, -1.0)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (acos (infsup (1.0, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (acos (infsup (-1.0, -1.0)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (acos (infsup (1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (acos (infsup (0.0, 0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-0.0, -0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (acos (infsup (-inf, -1.000000000000000222e+00)), infsup)); %!test %! assert (isequal (acos (infsup (1.000000000000000222e+00, inf)), infsup)); %!test %! assert (isequal (acos (infsup (-1.000000000000000056e-01, 1.000000000000000056e-01)), infsup (1.470628905633336814e+00, 1.670963747956456524e+00))); %!test %! assert (isequal (acos (infsup (-3.300000000000000155e-01, 9.999999999999998890e-01)), infsup (1.490116119384765625e-08, 1.907099901948877019e+00))); %!test %! assert (isequal (acos (infsup (-9.999999999999998890e-01, 9.999999999999998890e-01)), infsup (1.490116119384765625e-08, 3.141592638688632366e+00))); ## minimal_acos_dec_test %!test %! assert (isequal (acos (infsupdec (0.0, inf, "dac")), infsupdec (0.0, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (acos (infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (acos (infsupdec (-inf, 0.0, "def")), infsupdec (1.570796326794896558e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (acos (infsupdec (-inf, 0.0, "def"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (acos (infsupdec (-1.0, 1.0, "com")), infsupdec (0.0, 3.141592653589793560e+00, "com"))); %! assert (isequal (decorationpart (acos (infsupdec (-1.0, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "com")){1})); %!test %! assert (isequal (acos (infsupdec (entire, "def")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (acos (infsupdec (entire, "def"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (acos (infsupdec (-3.300000000000000155e-01, 9.999999999999998890e-01, "def")), infsupdec (1.490116119384765625e-08, 1.907099901948877019e+00, "def"))); %! assert (isequal (decorationpart (acos (infsupdec (-3.300000000000000155e-01, 9.999999999999998890e-01, "def"))){1}, decorationpart (infsupdec (1.490116119384765625e-08, 1.907099901948877019e+00, "def")){1})); ## minimal_atan_test %!test %! assert (isequal (atan (infsup), infsup)); %!test %! assert (isequal (atan (infsup (0.0, inf)), infsup (0.0, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (-0.0, inf)), infsup (0.0, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (-inf, 0.0)), infsup (-1.570796326794896780e+00, 0.0))); %!test %! assert (isequal (atan (infsup (-inf, -0.0)), infsup (-1.570796326794896780e+00, 0.0))); %!test %! assert (isequal (atan (infsup (-inf, inf)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan (infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan (infsup (1.0, 4.353453467566999793e+07)), infsup (7.853981633974482790e-01, 1.570796303824627094e+00))); %!test %! assert (isequal (atan (infsup (-5.466754345546680298e+11, -5.658889722000000120e+02)), infsup (-1.570796326793067577e+00, -1.569029197537726406e+00))); ## minimal_atan_dec_test %!test %! assert (isequal (atan (infsupdec (0.0, inf, "dac")), infsupdec (0.0, 1.570796326794896780e+00, "dac"))); %! assert (isequal (decorationpart (atan (infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, 1.570796326794896780e+00, "dac")){1})); %!test %! assert (isequal (atan (infsupdec (-inf, 0.0, "def")), infsupdec (-1.570796326794896780e+00, 0.0, "def"))); %! assert (isequal (decorationpart (atan (infsupdec (-inf, 0.0, "def"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 0.0, "def")){1})); %!test %! assert (isequal (atan (infsupdec (entire, "def")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "def"))); %! assert (isequal (decorationpart (atan (infsupdec (entire, "def"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "def")){1})); %!test %! assert (isequal (atan (infsupdec (1.0, 4.353453467566999793e+07, "trv")), infsupdec (7.853981633974482790e-01, 1.570796303824627094e+00, "trv"))); %! assert (isequal (decorationpart (atan (infsupdec (1.0, 4.353453467566999793e+07, "trv"))){1}, decorationpart (infsupdec (7.853981633974482790e-01, 1.570796303824627094e+00, "trv")){1})); %!test %! assert (isequal (atan (infsupdec (-5.466754345546680298e+11, -5.658889722000000120e+02, "com")), infsupdec (-1.570796326793067577e+00, -1.569029197537726406e+00, "com"))); %! assert (isequal (decorationpart (atan (infsupdec (-5.466754345546680298e+11, -5.658889722000000120e+02, "com"))){1}, decorationpart (infsupdec (-1.570796326793067577e+00, -1.569029197537726406e+00, "com")){1})); ## minimal_atan2_test %!test %! assert (isequal (atan2 (infsup, infsup), infsup)); %!test %! assert (isequal (atan2 (infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (atan2 (infsup, infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup, infsup (-0.0, 0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup, infsup (0.0, -0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup, infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup, infsup (-2.0, -0.1)), infsup)); %!test %! assert (isequal (atan2 (infsup, infsup (-2.0, 0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup, infsup (-2.0, -0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup, infsup (-2.0, 1.0)), infsup)); %!test %! assert (isequal (atan2 (infsup, infsup (0.0, 1.0)), infsup)); %!test %! assert (isequal (atan2 (infsup, infsup (-0.0, 1.0)), infsup)); %!test %! assert (isequal (atan2 (infsup, infsup (0.1, 1.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup), infsup)); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (-inf, inf)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (0.0, 0.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (0.0, -0.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (-0.0, 0.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (-0.0, -0.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (-2.0, -0.1)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (-2.0, 0.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (-2.0, -0.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (-2.0, 1.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (0.0, 1.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (-0.0, 1.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-inf, inf), infsup (0.1, 1.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (-0.0, 0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (0.0, -0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (-2.0, -0.1)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (-2.0, 0.0)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (-2.0, -0.0)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (-2.0, 1.0)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (-0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (0.0, 0.0), infsup (0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (-0.0, 0.0), infsup), infsup)); %!test %! assert (isequal (atan2 (infsup (-0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (-0.0, 0.0), infsup (-0.0, 0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (-0.0, 0.0), infsup (0.0, -0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (-0.0, 0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (-0.0, 0.0), infsup (-2.0, -0.1)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 0.0), infsup (-2.0, 0.0)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 0.0), infsup (-2.0, -0.0)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 0.0), infsup (-2.0, 1.0)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 0.0), infsup (0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (-0.0, 0.0), infsup (-0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (-0.0, 0.0), infsup (0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (atan2 (infsup (0.0, -0.0), infsup (-inf, inf)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, -0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (0.0, -0.0), infsup (-0.0, 0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (0.0, -0.0), infsup (0.0, -0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (0.0, -0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (0.0, -0.0), infsup (-2.0, -0.1)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, -0.0), infsup (-2.0, 0.0)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, -0.0), infsup (-2.0, -0.0)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, -0.0), infsup (-2.0, 1.0)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, -0.0), infsup (0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (0.0, -0.0), infsup (-0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (0.0, -0.0), infsup (0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (-0.0, -0.0), infsup), infsup)); %!test %! assert (isequal (atan2 (infsup (-0.0, -0.0), infsup (-inf, inf)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, -0.0), infsup (0.0, 0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (-0.0, -0.0), infsup (-0.0, 0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (-0.0, -0.0), infsup (0.0, -0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (-0.0, -0.0), infsup (-0.0, -0.0)), infsup)); %!test %! assert (isequal (atan2 (infsup (-0.0, -0.0), infsup (-2.0, -0.1)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, -0.0), infsup (-2.0, 0.0)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, -0.0), infsup (-2.0, -0.0)), infsup (3.141592653589793116e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, -0.0), infsup (-2.0, 1.0)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, -0.0), infsup (0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (-0.0, -0.0), infsup (-0.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (-0.0, -0.0), infsup (0.1, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.1), infsup), infsup)); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.1), infsup (-inf, inf)), infsup (-3.141592653589793560e+00, 0.0))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.1), infsup (0.0, 0.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.1), infsup (0.0, -0.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.1), infsup (-0.0, 0.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.1), infsup (0.0, -0.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.1), infsup (-2.0, -0.1)), infsup (-3.091634257867850621e+00, -1.620754722516839275e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.1), infsup (-2.0, 0.0)), infsup (-3.091634257867850621e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.1), infsup (-2.0, -0.0)), infsup (-3.091634257867850621e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.1), infsup (-2.0, 1.0)), infsup (-3.091634257867850621e+00, -9.966865249116202419e-02))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.1), infsup (0.0, 1.0)), infsup (-1.570796326794896780e+00, -9.966865249116202419e-02))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.1), infsup (-0.0, 1.0)), infsup (-1.570796326794896780e+00, -9.966865249116202419e-02))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.1), infsup (0.1, 1.0)), infsup (-1.520837931072954063e+00, -9.966865249116202419e-02))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup), infsup)); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (-inf, inf)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (0.0, 0.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (-0.0, 0.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (0.0, -0.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (-0.0, -0.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (-2.0, -0.1)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (-2.0, 0.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (-2.0, -0.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (-2.0, 1.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (0.0, 1.0)), infsup (-1.570796326794896780e+00, 0.0))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (-0.0, 1.0)), infsup (-1.570796326794896780e+00, 0.0))); %!test %! assert (isequal (atan2 (infsup (-2.0, 0.0), infsup (0.1, 1.0)), infsup (-1.520837931072954063e+00, 0.0))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.0), infsup), infsup)); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.0), infsup (-inf, inf)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.0), infsup (0.0, 0.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.0), infsup (-0.0, 0.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.0), infsup (0.0, -0.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.0), infsup (-0.0, -0.0)), infsup (-1.570796326794896780e+00, -1.570796326794896558e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.0), infsup (-2.0, -0.1)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.0), infsup (-2.0, 0.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.0), infsup (-2.0, -0.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.0), infsup (-2.0, 1.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.0), infsup (0.0, 1.0)), infsup (-1.570796326794896780e+00, 0.0))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.0), infsup (-0.0, 1.0)), infsup (-1.570796326794896780e+00, 0.0))); %!test %! assert (isequal (atan2 (infsup (-2.0, -0.0), infsup (0.1, 1.0)), infsup (-1.520837931072954063e+00, 0.0))); %!test %! assert (isequal (atan2 (infsup (-2.0, 1.0), infsup), infsup)); %!test %! assert (isequal (atan2 (infsup (-2.0, 1.0), infsup (-inf, inf)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 1.0), infsup (0.0, 0.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 1.0), infsup (-0.0, 0.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 1.0), infsup (0.0, -0.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 1.0), infsup (-0.0, -0.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 1.0), infsup (-2.0, -0.1)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 1.0), infsup (-2.0, 0.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 1.0), infsup (-2.0, -0.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 1.0), infsup (-2.0, 1.0)), infsup (-3.141592653589793560e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 1.0), infsup (0.0, 1.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 1.0), infsup (-0.0, 1.0)), infsup (-1.570796326794896780e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-2.0, 1.0), infsup (0.1, 1.0)), infsup (-1.520837931072954063e+00, 1.471127674303734700e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 1.0), infsup), infsup)); %!test %! assert (isequal (atan2 (infsup (-0.0, 1.0), infsup (-inf, inf)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 1.0), infsup (0.0, 0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 1.0), infsup (-0.0, 0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 1.0), infsup (0.0, -0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 1.0), infsup (-0.0, -0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 1.0), infsup (-2.0, -0.1)), infsup (1.670464979286058638e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 1.0), infsup (-2.0, 0.0)), infsup (1.570796326794896558e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 1.0), infsup (-2.0, -0.0)), infsup (1.570796326794896558e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 1.0), infsup (-2.0, 1.0)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 1.0), infsup (-0.0, 1.0)), infsup (0.0, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (-0.0, 1.0), infsup (0.1, 1.0)), infsup (0.0, 1.471127674303734700e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 1.0), infsup), infsup)); %!test %! assert (isequal (atan2 (infsup (0.0, 1.0), infsup (-inf, inf)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 1.0), infsup (0.0, 0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 1.0), infsup (-0.0, 0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 1.0), infsup (0.0, -0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 1.0), infsup (-0.0, -0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 1.0), infsup (-2.0, -0.1)), infsup (1.670464979286058638e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 1.0), infsup (-2.0, 0.0)), infsup (1.570796326794896558e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 1.0), infsup (-2.0, -0.0)), infsup (1.570796326794896558e+00, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 1.0), infsup (-2.0, 1.0)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 1.0), infsup (0.0, 1.0)), infsup (0.0, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 1.0), infsup (-0.0, 1.0)), infsup (0.0, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.0, 1.0), infsup (0.1, 1.0)), infsup (0.0, 1.471127674303734700e+00))); %!test %! assert (isequal (atan2 (infsup (0.1, 1.0), infsup), infsup)); %!test %! assert (isequal (atan2 (infsup (0.1, 1.0), infsup (-inf, inf)), infsup (0.0, 3.141592653589793560e+00))); %!test %! assert (isequal (atan2 (infsup (0.1, 1.0), infsup (0.0, 0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.1, 1.0), infsup (-0.0, 0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.1, 1.0), infsup (0.0, -0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.1, 1.0), infsup (-0.0, -0.0)), infsup (1.570796326794896558e+00, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.1, 1.0), infsup (-2.0, -0.1)), infsup (1.670464979286058638e+00, 3.091634257867850621e+00))); %!test %! assert (isequal (atan2 (infsup (0.1, 1.0), infsup (-2.0, 0.0)), infsup (1.570796326794896558e+00, 3.091634257867850621e+00))); %!test %! assert (isequal (atan2 (infsup (0.1, 1.0), infsup (-2.0, -0.0)), infsup (1.570796326794896558e+00, 3.091634257867850621e+00))); %!test %! assert (isequal (atan2 (infsup (0.1, 1.0), infsup (-2.0, 1.0)), infsup (9.966865249116202419e-02, 3.091634257867850621e+00))); %!test %! assert (isequal (atan2 (infsup (0.1, 1.0), infsup (0.0, 1.0)), infsup (9.966865249116202419e-02, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.1, 1.0), infsup (-0.0, 1.0)), infsup (9.966865249116202419e-02, 1.570796326794896780e+00))); %!test %! assert (isequal (atan2 (infsup (0.1, 1.0), infsup (0.1, 1.0)), infsup (9.966865249116202419e-02, 1.471127674303734700e+00))); ## minimal_atan2_dec_test %!test %! assert (isequal (atan2 (infsupdec (empty, "trv"), infsupdec (entire, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (empty, "trv"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (empty, "trv"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (empty, "trv"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (empty, "trv"), infsupdec (-0.0, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (empty, "trv"), infsupdec (-0.0, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (empty, "trv"), infsupdec (0.0, -0.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (empty, "trv"), infsupdec (0.0, -0.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (empty, "trv"), infsupdec (-0.0, -0.0, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (empty, "trv"), infsupdec (-0.0, -0.0, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (empty, "trv"), infsupdec (-2.0, -0.1, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (empty, "trv"), infsupdec (-2.0, -0.1, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (empty, "trv"), infsupdec (-2.0, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (empty, "trv"), infsupdec (-2.0, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (empty, "trv"), infsupdec (-2.0, -0.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (empty, "trv"), infsupdec (-2.0, -0.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (empty, "trv"), infsupdec (-2.0, 1.0, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (empty, "trv"), infsupdec (-2.0, 1.0, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (empty, "trv"), infsupdec (0.0, 1.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (empty, "trv"), infsupdec (0.0, 1.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (empty, "trv"), infsupdec (-0.0, 1.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (empty, "trv"), infsupdec (-0.0, 1.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (empty, "trv"), infsupdec (0.1, 1.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (empty, "trv"), infsupdec (0.1, 1.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (entire, "def"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (entire, "def"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (entire, "def"), infsupdec (entire, "def")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (entire, "def"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (entire, "def"), infsupdec (0.0, 0.0, "com")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (entire, "def"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (entire, "def"), infsupdec (0.0, -0.0, "def")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (entire, "def"), infsupdec (0.0, -0.0, "def"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (entire, "def"), infsupdec (-0.0, 0.0, "dac")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (entire, "def"), infsupdec (-0.0, 0.0, "dac"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (entire, "def"), infsupdec (-0.0, -0.0, "trv")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (entire, "def"), infsupdec (-0.0, -0.0, "trv"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (entire, "def"), infsupdec (-2.0, -0.1, "com")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (entire, "def"), infsupdec (-2.0, -0.1, "com"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (entire, "def"), infsupdec (-2.0, 0.0, "dac")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (entire, "def"), infsupdec (-2.0, 0.0, "dac"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (entire, "def"), infsupdec (-2.0, -0.0, "def")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (entire, "def"), infsupdec (-2.0, -0.0, "def"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (entire, "def"), infsupdec (-2.0, 1.0, "trv")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (entire, "def"), infsupdec (-2.0, 1.0, "trv"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (entire, "def"), infsupdec (0.0, 1.0, "dac")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (entire, "def"), infsupdec (0.0, 1.0, "dac"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (entire, "def"), infsupdec (-0.0, 1.0, "def")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (entire, "def"), infsupdec (-0.0, 1.0, "def"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (entire, "def"), infsupdec (0.1, 1.0, "com")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (entire, "def"), infsupdec (0.1, 1.0, "com"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 0.0, "com"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 0.0, "com"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 0.0, "dac"), infsupdec (entire, "def")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 0.0, "dac"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 0.0, "def"), infsupdec (0.0, 0.0, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 0.0, "def"), infsupdec (0.0, 0.0, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 0.0, "trv"), infsupdec (-0.0, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 0.0, "trv"), infsupdec (-0.0, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 0.0, "com"), infsupdec (0.0, -0.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 0.0, "com"), infsupdec (0.0, -0.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 0.0, "dac"), infsupdec (-0.0, -0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 0.0, "dac"), infsupdec (-0.0, -0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 0.0, "com"), infsupdec (-2.0, -0.1, "dac")), infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "dac"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 0.0, "com"), infsupdec (-2.0, -0.1, "dac"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "dac")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 0.0, "trv"), infsupdec (-2.0, 0.0, "com")), infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 0.0, "trv"), infsupdec (-2.0, 0.0, "com"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 0.0, "com"), infsupdec (-2.0, -0.0, "trv")), infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 0.0, "com"), infsupdec (-2.0, -0.0, "trv"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 0.0, "dac"), infsupdec (-2.0, 1.0, "def")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 0.0, "dac"), infsupdec (-2.0, 1.0, "def"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 0.0, "def"), infsupdec (0.0, 1.0, "com")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 0.0, "def"), infsupdec (0.0, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 0.0, "trv"), infsupdec (-0.0, 1.0, "dac")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 0.0, "trv"), infsupdec (-0.0, 1.0, "dac"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 0.0, "com"), infsupdec (0.1, 1.0, "com")), infsupdec (0.0, 0.0, "com"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 0.0, "com"), infsupdec (0.1, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "com")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 0.0, "com"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 0.0, "com"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 0.0, "dac"), infsupdec (entire, "def")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 0.0, "dac"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 0.0, "def"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 0.0, "def"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 0.0, "trv"), infsupdec (-0.0, 0.0, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 0.0, "trv"), infsupdec (-0.0, 0.0, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 0.0, "com"), infsupdec (0.0, -0.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 0.0, "com"), infsupdec (0.0, -0.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 0.0, "dac"), infsupdec (-0.0, -0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 0.0, "dac"), infsupdec (-0.0, -0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 0.0, "dac"), infsupdec (-2.0, -0.1, "dac")), infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "dac"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 0.0, "dac"), infsupdec (-2.0, -0.1, "dac"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "dac")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 0.0, "trv"), infsupdec (-2.0, 0.0, "com")), infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 0.0, "trv"), infsupdec (-2.0, 0.0, "com"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 0.0, "com"), infsupdec (-2.0, -0.0, "trv")), infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 0.0, "com"), infsupdec (-2.0, -0.0, "trv"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 0.0, "dac"), infsupdec (-2.0, 1.0, "def")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 0.0, "dac"), infsupdec (-2.0, 1.0, "def"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 0.0, "com"), infsupdec (0.0, 1.0, "com")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 0.0, "com"), infsupdec (0.0, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 0.0, "def"), infsupdec (-0.0, 1.0, "dac")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 0.0, "def"), infsupdec (-0.0, 1.0, "dac"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 0.0, "com"), infsupdec (0.1, 1.0, "com")), infsupdec (0.0, 0.0, "com"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 0.0, "com"), infsupdec (0.1, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "com")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, -0.0, "com"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, -0.0, "com"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, -0.0, "dac"), infsupdec (entire, "def")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, -0.0, "dac"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, -0.0, "def"), infsupdec (0.0, 0.0, "dac")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, -0.0, "def"), infsupdec (0.0, 0.0, "dac"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, -0.0, "trv"), infsupdec (-0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, -0.0, "trv"), infsupdec (-0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, -0.0, "dac"), infsupdec (0.0, -0.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, -0.0, "dac"), infsupdec (0.0, -0.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, -0.0, "com"), infsupdec (-0.0, -0.0, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, -0.0, "com"), infsupdec (-0.0, -0.0, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, -0.0, "com"), infsupdec (-2.0, -0.1, "dac")), infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "dac"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, -0.0, "com"), infsupdec (-2.0, -0.1, "dac"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "dac")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, -0.0, "def"), infsupdec (-2.0, 0.0, "com")), infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, -0.0, "def"), infsupdec (-2.0, 0.0, "com"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, -0.0, "com"), infsupdec (-2.0, -0.0, "dac")), infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, -0.0, "com"), infsupdec (-2.0, -0.0, "dac"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, -0.0, "dac"), infsupdec (-2.0, 1.0, "com")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, -0.0, "dac"), infsupdec (-2.0, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, -0.0, "com"), infsupdec (0.0, 1.0, "trv")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, -0.0, "com"), infsupdec (0.0, 1.0, "trv"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, -0.0, "def"), infsupdec (-0.0, 1.0, "com")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, -0.0, "def"), infsupdec (-0.0, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, -0.0, "com"), infsupdec (0.1, 1.0, "def")), infsupdec (0.0, 0.0, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, -0.0, "com"), infsupdec (0.1, 1.0, "def"))){1}, decorationpart (infsupdec (0.0, 0.0, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, -0.0, "com"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, -0.0, "com"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, -0.0, "def"), infsupdec (entire, "def")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, -0.0, "def"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, -0.0, "dac"), infsupdec (0.0, 0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, -0.0, "dac"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, -0.0, "trv"), infsupdec (-0.0, 0.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, -0.0, "trv"), infsupdec (-0.0, 0.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, -0.0, "com"), infsupdec (0.0, -0.0, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, -0.0, "com"), infsupdec (0.0, -0.0, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, -0.0, "dac"), infsupdec (-0.0, -0.0, "com")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, -0.0, "dac"), infsupdec (-0.0, -0.0, "com"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, -0.0, "def"), infsupdec (-2.0, -0.1, "dac")), infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, -0.0, "def"), infsupdec (-2.0, -0.1, "dac"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, -0.0, "trv"), infsupdec (-2.0, 0.0, "def")), infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, -0.0, "trv"), infsupdec (-2.0, 0.0, "def"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, -0.0, "dac"), infsupdec (-2.0, -0.0, "trv")), infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, -0.0, "dac"), infsupdec (-2.0, -0.0, "trv"))){1}, decorationpart (infsupdec (3.141592653589793116e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, -0.0, "def"), infsupdec (-2.0, 1.0, "com")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, -0.0, "def"), infsupdec (-2.0, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, -0.0, "com"), infsupdec (0.0, 1.0, "com")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, -0.0, "com"), infsupdec (0.0, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, -0.0, "trv"), infsupdec (-0.0, 1.0, "dac")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, -0.0, "trv"), infsupdec (-0.0, 1.0, "dac"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, -0.0, "com"), infsupdec (0.1, 1.0, "com")), infsupdec (0.0, 0.0, "com"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, -0.0, "com"), infsupdec (0.1, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "com")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.1, "dac"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.1, "dac"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.1, "def"), infsupdec (entire, "def")), infsupdec (-3.141592653589793560e+00, 0.0, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.1, "def"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 0.0, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.1, "trv"), infsupdec (0.0, 0.0, "com")), infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.1, "trv"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, -0.0, "dac")), infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "dac"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, -0.0, "dac"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "dac")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.1, "dac"), infsupdec (-0.0, 0.0, "def")), infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.1, "dac"), infsupdec (-0.0, 0.0, "def"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, -0.0, "trv")), infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, -0.0, "trv"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.1, "def"), infsupdec (-2.0, -0.1, "com")), infsupdec (-3.091634257867850621e+00, -1.620754722516839275e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.1, "def"), infsupdec (-2.0, -0.1, "com"))){1}, decorationpart (infsupdec (-3.091634257867850621e+00, -1.620754722516839275e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.1, "com"), infsupdec (-2.0, 0.0, "def")), infsupdec (-3.091634257867850621e+00, -1.570796326794896558e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.1, "com"), infsupdec (-2.0, 0.0, "def"))){1}, decorationpart (infsupdec (-3.091634257867850621e+00, -1.570796326794896558e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.1, "trv"), infsupdec (-2.0, -0.0, "dac")), infsupdec (-3.091634257867850621e+00, -1.570796326794896558e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.1, "trv"), infsupdec (-2.0, -0.0, "dac"))){1}, decorationpart (infsupdec (-3.091634257867850621e+00, -1.570796326794896558e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.1, "def"), infsupdec (-2.0, 1.0, "trv")), infsupdec (-3.091634257867850621e+00, -9.966865249116202419e-02, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.1, "def"), infsupdec (-2.0, 1.0, "trv"))){1}, decorationpart (infsupdec (-3.091634257867850621e+00, -9.966865249116202419e-02, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, 1.0, "def")), infsupdec (-1.570796326794896780e+00, -9.966865249116202419e-02, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.1, "com"), infsupdec (0.0, 1.0, "def"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -9.966865249116202419e-02, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.1, "dac"), infsupdec (-0.0, 1.0, "com")), infsupdec (-1.570796326794896780e+00, -9.966865249116202419e-02, "dac"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.1, "dac"), infsupdec (-0.0, 1.0, "com"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -9.966865249116202419e-02, "dac")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.1, "com"), infsupdec (0.1, 1.0, "com")), infsupdec (-1.520837931072954063e+00, -9.966865249116202419e-02, "com"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.1, "com"), infsupdec (0.1, 1.0, "com"))){1}, decorationpart (infsupdec (-1.520837931072954063e+00, -9.966865249116202419e-02, "com")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 0.0, "def"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 0.0, "def"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 0.0, "def"), infsupdec (entire, "def")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 0.0, "def"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 0.0, "dac"), infsupdec (0.0, 0.0, "dac")), infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 0.0, "dac"), infsupdec (0.0, 0.0, "dac"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 0.0, "trv"), infsupdec (-0.0, 0.0, "com")), infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 0.0, "trv"), infsupdec (-0.0, 0.0, "com"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 0.0, "com"), infsupdec (0.0, -0.0, "trv")), infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 0.0, "com"), infsupdec (0.0, -0.0, "trv"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 0.0, "def"), infsupdec (-0.0, -0.0, "def")), infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 0.0, "def"), infsupdec (-0.0, -0.0, "def"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 0.0, "com"), infsupdec (-2.0, -0.1, "dac")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 0.0, "com"), infsupdec (-2.0, -0.1, "dac"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 0.0, "dac"), infsupdec (-2.0, 0.0, "com")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 0.0, "dac"), infsupdec (-2.0, 0.0, "com"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 0.0, "com"), infsupdec (-2.0, -0.0, "dac")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 0.0, "com"), infsupdec (-2.0, -0.0, "dac"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 0.0, "trv"), infsupdec (-2.0, 1.0, "com")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 0.0, "trv"), infsupdec (-2.0, 1.0, "com"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 0.0, "def"), infsupdec (0.0, 1.0, "def")), infsupdec (-1.570796326794896780e+00, 0.0, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 0.0, "def"), infsupdec (0.0, 1.0, "def"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 0.0, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 0.0, "com"), infsupdec (-0.0, 1.0, "dac")), infsupdec (-1.570796326794896780e+00, 0.0, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 0.0, "com"), infsupdec (-0.0, 1.0, "dac"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 0.0, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 0.0, "com"), infsupdec (0.1, 1.0, "com")), infsupdec (-1.520837931072954063e+00, 0.0, "com"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 0.0, "com"), infsupdec (0.1, 1.0, "com"))){1}, decorationpart (infsupdec (-1.520837931072954063e+00, 0.0, "com")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.0, "trv"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.0, "trv"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.0, "dac"), infsupdec (entire, "def")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.0, "dac"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.0, "com"), infsupdec (0.0, 0.0, "com")), infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.0, "com"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.0, "def"), infsupdec (-0.0, 0.0, "dac")), infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.0, "def"), infsupdec (-0.0, 0.0, "dac"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.0, "dac"), infsupdec (0.0, -0.0, "def")), infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.0, "dac"), infsupdec (0.0, -0.0, "def"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.0, "com"), infsupdec (-0.0, -0.0, "trv")), infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.0, "com"), infsupdec (-0.0, -0.0, "trv"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, -1.570796326794896558e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.0, "def"), infsupdec (-2.0, -0.1, "com")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.0, "def"), infsupdec (-2.0, -0.1, "com"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.0, "com"), infsupdec (-2.0, 0.0, "dac")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.0, "com"), infsupdec (-2.0, 0.0, "dac"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.0, "dac"), infsupdec (-2.0, -0.0, "def")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.0, "dac"), infsupdec (-2.0, -0.0, "def"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.0, "def"), infsupdec (-2.0, 1.0, "trv")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.0, "def"), infsupdec (-2.0, 1.0, "trv"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.0, "trv"), infsupdec (0.0, 1.0, "dac")), infsupdec (-1.570796326794896780e+00, 0.0, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.0, "trv"), infsupdec (0.0, 1.0, "dac"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 0.0, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.0, "com"), infsupdec (-0.0, 1.0, "com")), infsupdec (-1.570796326794896780e+00, 0.0, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.0, "com"), infsupdec (-0.0, 1.0, "com"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 0.0, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, -0.0, "com"), infsupdec (0.1, 1.0, "com")), infsupdec (-1.520837931072954063e+00, 0.0, "com"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, -0.0, "com"), infsupdec (0.1, 1.0, "com"))){1}, decorationpart (infsupdec (-1.520837931072954063e+00, 0.0, "com")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 1.0, "def"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 1.0, "def"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 1.0, "dac"), infsupdec (entire, "def")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 1.0, "dac"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 1.0, "def"), infsupdec (0.0, 0.0, "def")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 1.0, "def"), infsupdec (0.0, 0.0, "def"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 1.0, "com"), infsupdec (-0.0, 0.0, "dac")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 1.0, "com"), infsupdec (-0.0, 0.0, "dac"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 1.0, "trv"), infsupdec (0.0, -0.0, "trv")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 1.0, "trv"), infsupdec (0.0, -0.0, "trv"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 1.0, "com"), infsupdec (-0.0, -0.0, "com")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 1.0, "com"), infsupdec (-0.0, -0.0, "com"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 1.0, "dac"), infsupdec (-2.0, -0.1, "dac")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 1.0, "dac"), infsupdec (-2.0, -0.1, "dac"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 1.0, "def"), infsupdec (-2.0, 0.0, "def")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 1.0, "def"), infsupdec (-2.0, 0.0, "def"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 1.0, "trv"), infsupdec (-2.0, -0.0, "trv")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 1.0, "trv"), infsupdec (-2.0, -0.0, "trv"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 1.0, "dac"), infsupdec (-2.0, 1.0, "com")), infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 1.0, "dac"), infsupdec (-2.0, 1.0, "com"))){1}, decorationpart (infsupdec (-3.141592653589793560e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 1.0, "com"), infsupdec (0.0, 1.0, "dac")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 1.0, "com"), infsupdec (0.0, 1.0, "dac"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 1.0, "trv"), infsupdec (-0.0, 1.0, "dac")), infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 1.0, "trv"), infsupdec (-0.0, 1.0, "dac"))){1}, decorationpart (infsupdec (-1.570796326794896780e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-2.0, 1.0, "com"), infsupdec (0.1, 1.0, "com")), infsupdec (-1.520837931072954063e+00, 1.471127674303734700e+00, "com"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-2.0, 1.0, "com"), infsupdec (0.1, 1.0, "com"))){1}, decorationpart (infsupdec (-1.520837931072954063e+00, 1.471127674303734700e+00, "com")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 1.0, "com"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 1.0, "com"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 1.0, "dac"), infsupdec (entire, "def")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 1.0, "dac"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 1.0, "def"), infsupdec (0.0, 0.0, "def")), infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 1.0, "def"), infsupdec (0.0, 0.0, "def"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 1.0, "trv"), infsupdec (-0.0, 0.0, "trv")), infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 1.0, "trv"), infsupdec (-0.0, 0.0, "trv"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 1.0, "dac"), infsupdec (0.0, -0.0, "dac")), infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 1.0, "dac"), infsupdec (0.0, -0.0, "dac"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 1.0, "com"), infsupdec (-0.0, -0.0, "def")), infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 1.0, "com"), infsupdec (-0.0, -0.0, "def"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 1.0, "com"), infsupdec (-2.0, -0.1, "com")), infsupdec (1.670464979286058638e+00, 3.141592653589793560e+00, "dac"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 1.0, "com"), infsupdec (-2.0, -0.1, "com"))){1}, decorationpart (infsupdec (1.670464979286058638e+00, 3.141592653589793560e+00, "dac")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 1.0, "def"), infsupdec (-2.0, 0.0, "com")), infsupdec (1.570796326794896558e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 1.0, "def"), infsupdec (-2.0, 0.0, "com"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 1.0, "def"), infsupdec (-2.0, -0.0, "def")), infsupdec (1.570796326794896558e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 1.0, "def"), infsupdec (-2.0, -0.0, "def"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 1.0, "dac"), infsupdec (-2.0, 1.0, "dac")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 1.0, "dac"), infsupdec (-2.0, 1.0, "dac"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 1.0, "dac"), infsupdec (0.0, 1.0, "dac")), infsupdec (0.0, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 1.0, "dac"), infsupdec (0.0, 1.0, "dac"))){1}, decorationpart (infsupdec (0.0, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 1.0, "trv"), infsupdec (-0.0, 1.0, "com")), infsupdec (0.0, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 1.0, "trv"), infsupdec (-0.0, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (-0.0, 1.0, "trv"), infsupdec (0.1, 1.0, "com")), infsupdec (0.0, 1.471127674303734700e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (-0.0, 1.0, "trv"), infsupdec (0.1, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 1.471127674303734700e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 1.0, "def"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 1.0, "def"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (entire, "def")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (0.0, 0.0, "def")), infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (0.0, 0.0, "def"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 1.0, "trv"), infsupdec (-0.0, 0.0, "trv")), infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 1.0, "trv"), infsupdec (-0.0, 0.0, "trv"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 1.0, "trv"), infsupdec (0.0, -0.0, "dac")), infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 1.0, "trv"), infsupdec (0.0, -0.0, "dac"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 1.0, "def"), infsupdec (-0.0, -0.0, "com")), infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 1.0, "def"), infsupdec (-0.0, -0.0, "com"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (-2.0, -0.1, "dac")), infsupdec (1.670464979286058638e+00, 3.141592653589793560e+00, "dac"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (-2.0, -0.1, "dac"))){1}, decorationpart (infsupdec (1.670464979286058638e+00, 3.141592653589793560e+00, "dac")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 1.0, "def"), infsupdec (-2.0, 0.0, "trv")), infsupdec (1.570796326794896558e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 1.0, "def"), infsupdec (-2.0, 0.0, "trv"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (-2.0, -0.0, "dac")), infsupdec (1.570796326794896558e+00, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (-2.0, -0.0, "dac"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (-2.0, 1.0, "def")), infsupdec (0.0, 3.141592653589793560e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (-2.0, 1.0, "def"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (0.0, 1.0, "trv")), infsupdec (0.0, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (0.0, 1.0, "trv"))){1}, decorationpart (infsupdec (0.0, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (-0.0, 1.0, "def")), infsupdec (0.0, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 1.0, "dac"), infsupdec (-0.0, 1.0, "def"))){1}, decorationpart (infsupdec (0.0, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.0, 1.0, "com"), infsupdec (0.1, 1.0, "com")), infsupdec (0.0, 1.471127674303734700e+00, "com"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.0, 1.0, "com"), infsupdec (0.1, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 1.471127674303734700e+00, "com")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.1, 1.0, "dac"), infsupdec (empty, "trv")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.1, 1.0, "dac"), infsupdec (empty, "trv"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.1, 1.0, "dac"), infsupdec (entire, "def")), infsupdec (0.0, 3.141592653589793560e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.1, 1.0, "dac"), infsupdec (entire, "def"))){1}, decorationpart (infsupdec (0.0, 3.141592653589793560e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.1, 1.0, "def"), infsupdec (0.0, 0.0, "com")), infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.1, 1.0, "def"), infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.1, 1.0, "trv"), infsupdec (-0.0, 0.0, "def")), infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.1, 1.0, "trv"), infsupdec (-0.0, 0.0, "def"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.1, 1.0, "trv"), infsupdec (0.0, -0.0, "def")), infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.1, 1.0, "trv"), infsupdec (0.0, -0.0, "def"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.1, 1.0, "dac"), infsupdec (-0.0, -0.0, "def")), infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.1, 1.0, "dac"), infsupdec (-0.0, -0.0, "def"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 1.570796326794896780e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.1, 1.0, "com"), infsupdec (-2.0, -0.1, "trv")), infsupdec (1.670464979286058638e+00, 3.091634257867850621e+00, "trv"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.1, 1.0, "com"), infsupdec (-2.0, -0.1, "trv"))){1}, decorationpart (infsupdec (1.670464979286058638e+00, 3.091634257867850621e+00, "trv")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.1, 1.0, "com"), infsupdec (-2.0, 0.0, "dac")), infsupdec (1.570796326794896558e+00, 3.091634257867850621e+00, "dac"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.1, 1.0, "com"), infsupdec (-2.0, 0.0, "dac"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 3.091634257867850621e+00, "dac")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.1, 1.0, "com"), infsupdec (-2.0, -0.0, "dac")), infsupdec (1.570796326794896558e+00, 3.091634257867850621e+00, "dac"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.1, 1.0, "com"), infsupdec (-2.0, -0.0, "dac"))){1}, decorationpart (infsupdec (1.570796326794896558e+00, 3.091634257867850621e+00, "dac")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.1, 1.0, "def"), infsupdec (-2.0, 1.0, "dac")), infsupdec (9.966865249116202419e-02, 3.091634257867850621e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.1, 1.0, "def"), infsupdec (-2.0, 1.0, "dac"))){1}, decorationpart (infsupdec (9.966865249116202419e-02, 3.091634257867850621e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.1, 1.0, "def"), infsupdec (0.0, 1.0, "def")), infsupdec (9.966865249116202419e-02, 1.570796326794896780e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.1, 1.0, "def"), infsupdec (0.0, 1.0, "def"))){1}, decorationpart (infsupdec (9.966865249116202419e-02, 1.570796326794896780e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.1, 1.0, "dac"), infsupdec (-0.0, 1.0, "def")), infsupdec (9.966865249116202419e-02, 1.570796326794896780e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.1, 1.0, "dac"), infsupdec (-0.0, 1.0, "def"))){1}, decorationpart (infsupdec (9.966865249116202419e-02, 1.570796326794896780e+00, "def")){1})); %!test %! assert (isequal (atan2 (infsupdec (0.1, 1.0, "dac"), infsupdec (0.1, 1.0, "def")), infsupdec (9.966865249116202419e-02, 1.471127674303734700e+00, "def"))); %! assert (isequal (decorationpart (atan2 (infsupdec (0.1, 1.0, "dac"), infsupdec (0.1, 1.0, "def"))){1}, decorationpart (infsupdec (9.966865249116202419e-02, 1.471127674303734700e+00, "def")){1})); ## minimal_sinh_test %!test %! assert (isequal (sinh (infsup), infsup)); %!test %! assert (isequal (sinh (infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (sinh (infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (sinh (infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (sinh (infsup (-inf, -0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (sinh (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (sinh (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (sinh (infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (sinh (infsup (1.0, 3.005632345000000214e+02)), infsup (1.175201193643801378e+00, 1.705784684221513993e+130))); %!test %! assert (isequal (sinh (infsup (-5.466754345546680298e+11, -5.658889722000000120e+02)), infsup (-inf, -2.893530074810801279e+245))); %!test %! assert (isequal (sinh (infsup (-1.100000000000000089e+00, 2.299999999999999822e+00)), infsup (-1.335647470124176950e+00, 4.936961805545958093e+00))); ## minimal_sinh_dec_test %!test %! assert (isequal (sinh (infsupdec (entire, "def")), infsupdec (entire, "def"))); %! assert (isequal (decorationpart (sinh (infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "def")){1})); %!test %! assert (isequal (sinh (infsupdec (0.0, inf, "dac")), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (sinh (infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %!test %! assert (isequal (sinh (infsupdec (-inf, 0.0, "def")), infsupdec (-inf, 0.0, "def"))); %! assert (isequal (decorationpart (sinh (infsupdec (-inf, 0.0, "def"))){1}, decorationpart (infsupdec (-inf, 0.0, "def")){1})); %!test %! assert (isequal (sinh (infsupdec (1.0, 3.005632345000000214e+02, "com")), infsupdec (1.175201193643801378e+00, 1.705784684221513993e+130, "com"))); %! assert (isequal (decorationpart (sinh (infsupdec (1.0, 3.005632345000000214e+02, "com"))){1}, decorationpart (infsupdec (1.175201193643801378e+00, 1.705784684221513993e+130, "com")){1})); %!test %! assert (isequal (sinh (infsupdec (-5.466754345546680298e+11, -5.658889722000000120e+02, "com")), infsupdec (-inf, -2.893530074810801279e+245, "dac"))); %! assert (isequal (decorationpart (sinh (infsupdec (-5.466754345546680298e+11, -5.658889722000000120e+02, "com"))){1}, decorationpart (infsupdec (-inf, -2.893530074810801279e+245, "dac")){1})); ## minimal_cosh_test %!test %! assert (isequal (cosh (infsup), infsup)); %!test %! assert (isequal (cosh (infsup (0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (cosh (infsup (-0.0, inf)), infsup (1.0, inf))); %!test %! assert (isequal (cosh (infsup (-inf, 0.0)), infsup (1.0, inf))); %!test %! assert (isequal (cosh (infsup (-inf, -0.0)), infsup (1.0, inf))); %!test %! assert (isequal (cosh (infsup (-inf, inf)), infsup (1.0, inf))); %!test %! assert (isequal (cosh (infsup (0.0, 0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (cosh (infsup (-0.0, -0.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (cosh (infsup (1.0, 3.005632345000000214e+02)), infsup (1.543080634815243712e+00, 1.705784684221513993e+130))); %!test %! assert (isequal (cosh (infsup (-5.466754345546680298e+11, -5.658889722000000120e+02)), infsup (2.893530074810801279e+245, inf))); %!test %! assert (isequal (cosh (infsup (-1.100000000000000089e+00, 2.299999999999999822e+00)), infsup (1.0, 5.037220649268761896e+00))); ## minimal_cosh_dec_test %!test %! assert (isequal (cosh (infsupdec (0.0, inf, "dac")), infsupdec (1.0, inf, "dac"))); %! assert (isequal (decorationpart (cosh (infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (1.0, inf, "dac")){1})); %!test %! assert (isequal (cosh (infsupdec (-inf, 0.0, "def")), infsupdec (1.0, inf, "def"))); %! assert (isequal (decorationpart (cosh (infsupdec (-inf, 0.0, "def"))){1}, decorationpart (infsupdec (1.0, inf, "def")){1})); %!test %! assert (isequal (cosh (infsupdec (entire, "def")), infsupdec (1.0, inf, "def"))); %! assert (isequal (decorationpart (cosh (infsupdec (entire, "def"))){1}, decorationpart (infsupdec (1.0, inf, "def")){1})); %!test %! assert (isequal (cosh (infsupdec (1.0, 3.005632345000000214e+02, "def")), infsupdec (1.543080634815243712e+00, 1.705784684221513993e+130, "def"))); %! assert (isequal (decorationpart (cosh (infsupdec (1.0, 3.005632345000000214e+02, "def"))){1}, decorationpart (infsupdec (1.543080634815243712e+00, 1.705784684221513993e+130, "def")){1})); %!test %! assert (isequal (cosh (infsupdec (-5.466754345546680298e+11, -5.658889722000000120e+02, "com")), infsupdec (2.893530074810801279e+245, inf, "dac"))); %! assert (isequal (decorationpart (cosh (infsupdec (-5.466754345546680298e+11, -5.658889722000000120e+02, "com"))){1}, decorationpart (infsupdec (2.893530074810801279e+245, inf, "dac")){1})); ## minimal_tanh_test %!test %! assert (isequal (tanh (infsup), infsup)); %!test %! assert (isequal (tanh (infsup (0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (tanh (infsup (-0.0, inf)), infsup (0.0, 1.0))); %!test %! assert (isequal (tanh (infsup (-inf, 0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (tanh (infsup (-inf, -0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (tanh (infsup (-inf, inf)), infsup (-1.0, 1.0))); %!test %! assert (isequal (tanh (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (tanh (infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (tanh (infsup (1.0, 3.005632345000000214e+02)), infsup (7.615941559557648510e-01, 1.000000000000000000e+00))); %!test %! assert (isequal (tanh (infsup (-5.466754345546680298e+11, -5.658889722000000120e+02)), infsup (-1.000000000000000000e+00, -9.999999999999998890e-01))); %!test %! assert (isequal (tanh (infsup (-1.100000000000000089e+00, 2.299999999999999822e+00)), infsup (-8.004990217606298142e-01, 9.800963962661913831e-01))); ## minimal_tanh_dec_test %!test %! assert (isequal (tanh (infsupdec (0.0, inf, "dac")), infsupdec (0.0, 1.0, "dac"))); %! assert (isequal (decorationpart (tanh (infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, 1.0, "dac")){1})); %!test %! assert (isequal (tanh (infsupdec (-inf, 0.0, "def")), infsupdec (-1.0, 0.0, "def"))); %! assert (isequal (decorationpart (tanh (infsupdec (-inf, 0.0, "def"))){1}, decorationpart (infsupdec (-1.0, 0.0, "def")){1})); %!test %! assert (isequal (tanh (infsupdec (entire, "def")), infsupdec (-1.0, 1.0, "def"))); %! assert (isequal (decorationpart (tanh (infsupdec (entire, "def"))){1}, decorationpart (infsupdec (-1.0, 1.0, "def")){1})); %!test %! assert (isequal (tanh (infsupdec (1.0, 3.005632345000000214e+02, "com")), infsupdec (7.615941559557648510e-01, 1.000000000000000000e+00, "com"))); %! assert (isequal (decorationpart (tanh (infsupdec (1.0, 3.005632345000000214e+02, "com"))){1}, decorationpart (infsupdec (7.615941559557648510e-01, 1.000000000000000000e+00, "com")){1})); %!test %! assert (isequal (tanh (infsupdec (-5.466754345546680298e+11, -5.658889722000000120e+02, "trv")), infsupdec (-1.000000000000000000e+00, -9.999999999999998890e-01, "trv"))); %! assert (isequal (decorationpart (tanh (infsupdec (-5.466754345546680298e+11, -5.658889722000000120e+02, "trv"))){1}, decorationpart (infsupdec (-1.000000000000000000e+00, -9.999999999999998890e-01, "trv")){1})); ## minimal_asinh_test %!test %! assert (isequal (asinh (infsup), infsup)); %!test %! assert (isequal (asinh (infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (asinh (infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (asinh (infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (asinh (infsup (-inf, -0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (asinh (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (asinh (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (asinh (infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (asinh (infsup (1.0, 3.005632345000000214e+02)), infsup (8.813735870195429367e-01, 6.398808110711462938e+00))); %!test %! assert (isequal (asinh (infsup (-5.466754345546680298e+11, -5.658889722000000120e+02)), infsup (-2.772026828834738765e+01, -7.031545858017159922e+00))); %!test %! assert (isequal (asinh (infsup (-1.100000000000000089e+00, 2.299999999999999822e+00)), infsup (-9.503469298211343341e-01, 1.570278543484978195e+00))); ## minimal_asinh_dec_test %!test %! assert (isequal (asinh (infsupdec (0.0, inf, "dac")), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (asinh (infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %!test %! assert (isequal (asinh (infsupdec (-inf, 0.0, "trv")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (asinh (infsupdec (-inf, 0.0, "trv"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (asinh (infsupdec (entire, "def")), infsupdec (entire, "def"))); %! assert (isequal (decorationpart (asinh (infsupdec (entire, "def"))){1}, decorationpart (infsupdec (entire, "def")){1})); %!test %! assert (isequal (asinh (infsupdec (1.0, 3.005632345000000214e+02, "com")), infsupdec (8.813735870195429367e-01, 6.398808110711462938e+00, "com"))); %! assert (isequal (decorationpart (asinh (infsupdec (1.0, 3.005632345000000214e+02, "com"))){1}, decorationpart (infsupdec (8.813735870195429367e-01, 6.398808110711462938e+00, "com")){1})); %!test %! assert (isequal (asinh (infsupdec (-5.466754345546680298e+11, -5.658889722000000120e+02, "def")), infsupdec (-2.772026828834738765e+01, -7.031545858017159922e+00, "def"))); %! assert (isequal (decorationpart (asinh (infsupdec (-5.466754345546680298e+11, -5.658889722000000120e+02, "def"))){1}, decorationpart (infsupdec (-2.772026828834738765e+01, -7.031545858017159922e+00, "def")){1})); ## minimal_acosh_test %!test %! assert (isequal (acosh (infsup), infsup)); %!test %! assert (isequal (acosh (infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (acosh (infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (acosh (infsup (1.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (acosh (infsup (-inf, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (acosh (infsup (-inf, 9.999999999999998890e-01)), infsup)); %!test %! assert (isequal (acosh (infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (acosh (infsup (1.0, 1.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (acosh (infsup (1.0, 3.005632345000000214e+02)), infsup (0.0, 6.398802575957843963e+00))); %!test %! assert (isequal (acosh (infsup (1.100000000000000089e+00, 2.299999999999999822e+00)), infsup (4.435682543851153792e-01, 1.475044781241425129e+00))); %!test %! assert (isequal (acosh (infsup (3.543445345434999763e+04, 7.777477475642000437e+08)), infsup (1.116858706759319908e+01, 2.116505997820545559e+01))); ## minimal_acosh_dec_test %!test %! assert (isequal (acosh (infsupdec (0.0, inf, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (acosh (infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (acosh (infsupdec (1.0, inf, "dac")), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (acosh (infsupdec (1.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); %!test %! assert (isequal (acosh (infsupdec (entire, "def")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (acosh (infsupdec (entire, "def"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (acosh (infsupdec (1.0, 1.0, "com")), infsupdec (0.0, 0.0, "com"))); %! assert (isequal (decorationpart (acosh (infsupdec (1.0, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "com")){1})); %!test %! assert (isequal (acosh (infsupdec (0.9, 1.0, "com")), infsupdec (0.0, 0.0, "trv"))); %! assert (isequal (decorationpart (acosh (infsupdec (0.9, 1.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "trv")){1})); %!test %! assert (isequal (acosh (infsupdec (1.0, 3.005632345000000214e+02, "dac")), infsupdec (0.0, 6.398802575957843963e+00, "dac"))); %! assert (isequal (decorationpart (acosh (infsupdec (1.0, 3.005632345000000214e+02, "dac"))){1}, decorationpart (infsupdec (0.0, 6.398802575957843963e+00, "dac")){1})); %!test %! assert (isequal (acosh (infsupdec (0.9, 3.005632345000000214e+02, "com")), infsupdec (0.0, 6.398802575957843963e+00, "trv"))); %! assert (isequal (decorationpart (acosh (infsupdec (0.9, 3.005632345000000214e+02, "com"))){1}, decorationpart (infsupdec (0.0, 6.398802575957843963e+00, "trv")){1})); %!test %! assert (isequal (acosh (infsupdec (3.543445345434999763e+04, 7.777477475642000437e+08, "def")), infsupdec (1.116858706759319908e+01, 2.116505997820545559e+01, "def"))); %! assert (isequal (decorationpart (acosh (infsupdec (3.543445345434999763e+04, 7.777477475642000437e+08, "def"))){1}, decorationpart (infsupdec (1.116858706759319908e+01, 2.116505997820545559e+01, "def")){1})); ## minimal_atanh_test %!test %! assert (isequal (atanh (infsup), infsup)); %!test %! assert (isequal (atanh (infsup (0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (atanh (infsup (-0.0, inf)), infsup (0.0, inf))); %!test %! assert (isequal (atanh (infsup (1.0, inf)), infsup)); %!test %! assert (isequal (atanh (infsup (-inf, 0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (atanh (infsup (-inf, -0.0)), infsup (-inf, 0.0))); %!test %! assert (isequal (atanh (infsup (-inf, -1.0)), infsup)); %!test %! assert (isequal (atanh (infsup (-1.0, 1.0)), infsup (-inf, inf))); %!test %! assert (isequal (atanh (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atanh (infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (atanh (infsup (-1.0, -1.0)), infsup)); %!test %! assert (isequal (atanh (infsup (1.0, 1.0)), infsup)); %!test %! assert (isequal (atanh (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (atanh (infsup (3.242344999999999811e-01, 9.999999999999998890e-01)), infsup (3.363718566236145735e-01, 1.871497387511852395e+01))); %!test %! assert (isequal (atanh (infsup (-9.994549339999999615e-01, 1.000000000000000056e-01)), infsup (-4.103739140065865598e+00, 1.003353477310755942e-01))); ## minimal_atanh_dec_test %!test %! assert (isequal (atanh (infsupdec (0.0, inf, "dac")), infsupdec (0.0, inf, "trv"))); %! assert (isequal (decorationpart (atanh (infsupdec (0.0, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "trv")){1})); %!test %! assert (isequal (atanh (infsupdec (-inf, 0.0, "def")), infsupdec (-inf, 0.0, "trv"))); %! assert (isequal (decorationpart (atanh (infsupdec (-inf, 0.0, "def"))){1}, decorationpart (infsupdec (-inf, 0.0, "trv")){1})); %!test %! assert (isequal (atanh (infsupdec (-1.0, 1.0, "com")), infsupdec (entire, "trv"))); %! assert (isequal (decorationpart (atanh (infsupdec (-1.0, 1.0, "com"))){1}, decorationpart (infsupdec (entire, "trv")){1})); %!test %! assert (isequal (atanh (infsupdec (0.0, 0.0, "com")), infsupdec (0.0, 0.0, "com"))); %! assert (isequal (decorationpart (atanh (infsupdec (0.0, 0.0, "com"))){1}, decorationpart (infsupdec (0.0, 0.0, "com")){1})); %!test %! assert (isequal (atanh (infsupdec (1.0, 1.0, "def")), infsupdec (empty, "trv"))); %! assert (isequal (decorationpart (atanh (infsupdec (1.0, 1.0, "def"))){1}, decorationpart (infsupdec (empty, "trv")){1})); %!test %! assert (isequal (atanh (infsupdec (3.242344999999999811e-01, 9.999999999999998890e-01, "com")), infsupdec (3.363718566236145735e-01, 1.871497387511852395e+01, "com"))); %! assert (isequal (decorationpart (atanh (infsupdec (3.242344999999999811e-01, 9.999999999999998890e-01, "com"))){1}, decorationpart (infsupdec (3.363718566236145735e-01, 1.871497387511852395e+01, "com")){1})); %!test %! assert (isequal (atanh (infsupdec (-1.0, 9.999999999999998890e-01, "com")), infsupdec (-inf, 1.871497387511852395e+01, "trv"))); %! assert (isequal (decorationpart (atanh (infsupdec (-1.0, 9.999999999999998890e-01, "com"))){1}, decorationpart (infsupdec (-inf, 1.871497387511852395e+01, "trv")){1})); %!test %! assert (isequal (atanh (infsupdec (-9.994549339999999615e-01, 1.000000000000000056e-01, "def")), infsupdec (-4.103739140065865598e+00, 1.003353477310755942e-01, "def"))); %! assert (isequal (decorationpart (atanh (infsupdec (-9.994549339999999615e-01, 1.000000000000000056e-01, "def"))){1}, decorationpart (infsupdec (-4.103739140065865598e+00, 1.003353477310755942e-01, "def")){1})); %!test %! assert (isequal (atanh (infsupdec (-9.994549339999999615e-01, 1.0, "com")), infsupdec (-4.103739140065865598e+00, inf, "trv"))); %! assert (isequal (decorationpart (atanh (infsupdec (-9.994549339999999615e-01, 1.0, "com"))){1}, decorationpart (infsupdec (-4.103739140065865598e+00, inf, "trv")){1})); ## minimal_sign_test %!test %! assert (isequal (sign (infsup), infsup)); %!test %! assert (isequal (sign (infsup (1.0, 2.0)), infsup (1.0, 1.0))); %!test %! assert (isequal (sign (infsup (-1.0, 2.0)), infsup (-1.0, 1.0))); %!test %! assert (isequal (sign (infsup (-1.0, 0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (sign (infsup (0.0, 2.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (sign (infsup (-0.0, 2.0)), infsup (0.0, 1.0))); %!test %! assert (isequal (sign (infsup (-5.0, -2.0)), infsup (-1.0, -1.0))); %!test %! assert (isequal (sign (infsup (0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (sign (infsup (-0.0, -0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (sign (infsup (-0.0, 0.0)), infsup (0.0, 0.0))); %!test %! assert (isequal (sign (infsup (-inf, inf)), infsup (-1.0, 1.0))); ## minimal_sign_dec_test %!test %! assert (isequal (sign (infsupdec (1.0, 2.0, "com")), infsupdec (1.0, 1.0, "com"))); %! assert (isequal (decorationpart (sign (infsupdec (1.0, 2.0, "com"))){1}, decorationpart (infsupdec (1.0, 1.0, "com")){1})); %!test %! assert (isequal (sign (infsupdec (-1.0, 2.0, "com")), infsupdec (-1.0, 1.0, "def"))); %! assert (isequal (decorationpart (sign (infsupdec (-1.0, 2.0, "com"))){1}, decorationpart (infsupdec (-1.0, 1.0, "def")){1})); %!test %! assert (isequal (sign (infsupdec (-1.0, 0.0, "com")), infsupdec (-1.0, 0.0, "def"))); %! assert (isequal (decorationpart (sign (infsupdec (-1.0, 0.0, "com"))){1}, decorationpart (infsupdec (-1.0, 0.0, "def")){1})); %!test %! assert (isequal (sign (infsupdec (0.0, 2.0, "com")), infsupdec (0.0, 1.0, "def"))); %! assert (isequal (decorationpart (sign (infsupdec (0.0, 2.0, "com"))){1}, decorationpart (infsupdec (0.0, 1.0, "def")){1})); %!test %! assert (isequal (sign (infsupdec (-0.0, 2.0, "def")), infsupdec (0.0, 1.0, "def"))); %! assert (isequal (decorationpart (sign (infsupdec (-0.0, 2.0, "def"))){1}, decorationpart (infsupdec (0.0, 1.0, "def")){1})); %!test %! assert (isequal (sign (infsupdec (-5.0, -2.0, "trv")), infsupdec (-1.0, -1.0, "trv"))); %! assert (isequal (decorationpart (sign (infsupdec (-5.0, -2.0, "trv"))){1}, decorationpart (infsupdec (-1.0, -1.0, "trv")){1})); %!test %! assert (isequal (sign (infsupdec (0.0, 0.0, "dac")), infsupdec (0.0, 0.0, "dac"))); %! assert (isequal (decorationpart (sign (infsupdec (0.0, 0.0, "dac"))){1}, decorationpart (infsupdec (0.0, 0.0, "dac")){1})); ## minimal_ceil_test %!test %! assert (isequal (ceil (infsup), infsup)); %!test %! assert (isequal (ceil (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (ceil (infsup (1.1, 2.0)), infsup (2.0, 2.0))); %!test %! assert (isequal (ceil (infsup (-1.1, 2.0)), infsup (-1.0, 2.0))); %!test %! assert (isequal (ceil (infsup (-1.1, 0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (ceil (infsup (-1.1, -0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (ceil (infsup (-1.1, -0.4)), infsup (-1.0, 0.0))); %!test %! assert (isequal (ceil (infsup (-1.9, 2.2)), infsup (-1.0, 3.0))); %!test %! assert (isequal (ceil (infsup (-1.0, 2.2)), infsup (-1.0, 3.0))); %!test %! assert (isequal (ceil (infsup (0.0, 2.2)), infsup (0.0, 3.0))); %!test %! assert (isequal (ceil (infsup (-0.0, 2.2)), infsup (0.0, 3.0))); %!test %! assert (isequal (ceil (infsup (-1.5, inf)), infsup (-1.0, inf))); %!test %! assert (isequal (ceil (infsup (1.797693134862315708e+308, inf)), infsup (1.797693134862315708e+308, inf))); %!test %! assert (isequal (ceil (infsup (-inf, 2.2)), infsup (-inf, 3.0))); %!test %! assert (isequal (ceil (infsup (-inf, -1.797693134862315708e+308)), infsup (-inf, -1.797693134862315708e+308))); ## minimal_ceil_dec_test %!test %! assert (isequal (ceil (infsupdec (1.1, 2.0, "com")), infsupdec (2.0, 2.0, "dac"))); %! assert (isequal (decorationpart (ceil (infsupdec (1.1, 2.0, "com"))){1}, decorationpart (infsupdec (2.0, 2.0, "dac")){1})); %!test %! assert (isequal (ceil (infsupdec (-1.1, 2.0, "com")), infsupdec (-1.0, 2.0, "def"))); %! assert (isequal (decorationpart (ceil (infsupdec (-1.1, 2.0, "com"))){1}, decorationpart (infsupdec (-1.0, 2.0, "def")){1})); %!test %! assert (isequal (ceil (infsupdec (-1.1, 0.0, "dac")), infsupdec (-1.0, 0.0, "def"))); %! assert (isequal (decorationpart (ceil (infsupdec (-1.1, 0.0, "dac"))){1}, decorationpart (infsupdec (-1.0, 0.0, "def")){1})); %!test %! assert (isequal (ceil (infsupdec (-1.1, -0.0, "trv")), infsupdec (-1.0, 0.0, "trv"))); %! assert (isequal (decorationpart (ceil (infsupdec (-1.1, -0.0, "trv"))){1}, decorationpart (infsupdec (-1.0, 0.0, "trv")){1})); %!test %! assert (isequal (ceil (infsupdec (-1.1, -0.4, "dac")), infsupdec (-1.0, 0.0, "def"))); %! assert (isequal (decorationpart (ceil (infsupdec (-1.1, -0.4, "dac"))){1}, decorationpart (infsupdec (-1.0, 0.0, "def")){1})); %!test %! assert (isequal (ceil (infsupdec (-1.9, 2.2, "com")), infsupdec (-1.0, 3.0, "def"))); %! assert (isequal (decorationpart (ceil (infsupdec (-1.9, 2.2, "com"))){1}, decorationpart (infsupdec (-1.0, 3.0, "def")){1})); %!test %! assert (isequal (ceil (infsupdec (-1.0, 2.2, "dac")), infsupdec (-1.0, 3.0, "def"))); %! assert (isequal (decorationpart (ceil (infsupdec (-1.0, 2.2, "dac"))){1}, decorationpart (infsupdec (-1.0, 3.0, "def")){1})); %!test %! assert (isequal (ceil (infsupdec (0.0, 2.2, "trv")), infsupdec (0.0, 3.0, "trv"))); %! assert (isequal (decorationpart (ceil (infsupdec (0.0, 2.2, "trv"))){1}, decorationpart (infsupdec (0.0, 3.0, "trv")){1})); %!test %! assert (isequal (ceil (infsupdec (-0.0, 2.2, "def")), infsupdec (0.0, 3.0, "def"))); %! assert (isequal (decorationpart (ceil (infsupdec (-0.0, 2.2, "def"))){1}, decorationpart (infsupdec (0.0, 3.0, "def")){1})); %!test %! assert (isequal (ceil (infsupdec (-1.5, inf, "trv")), infsupdec (-1.0, inf, "trv"))); %! assert (isequal (decorationpart (ceil (infsupdec (-1.5, inf, "trv"))){1}, decorationpart (infsupdec (-1.0, inf, "trv")){1})); %!test %! assert (isequal (ceil (infsupdec (1.797693134862315708e+308, inf, "dac")), infsupdec (1.797693134862315708e+308, inf, "def"))); %! assert (isequal (decorationpart (ceil (infsupdec (1.797693134862315708e+308, inf, "dac"))){1}, decorationpart (infsupdec (1.797693134862315708e+308, inf, "def")){1})); %!test %! assert (isequal (ceil (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "com")), infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "dac"))); %! assert (isequal (decorationpart (ceil (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "com"))){1}, decorationpart (infsupdec (1.797693134862315708e+308, 1.797693134862315708e+308, "dac")){1})); %!test %! assert (isequal (ceil (infsupdec (-inf, 2.2, "trv")), infsupdec (-inf, 3.0, "trv"))); %! assert (isequal (decorationpart (ceil (infsupdec (-inf, 2.2, "trv"))){1}, decorationpart (infsupdec (-inf, 3.0, "trv")){1})); %!test %! assert (isequal (ceil (infsupdec (-inf, -1.797693134862315708e+308, "dac")), infsupdec (-inf, -1.797693134862315708e+308, "def"))); %! assert (isequal (decorationpart (ceil (infsupdec (-inf, -1.797693134862315708e+308, "dac"))){1}, decorationpart (infsupdec (-inf, -1.797693134862315708e+308, "def")){1})); ## minimal_floor_test %!test %! assert (isequal (floor (infsup), infsup)); %!test %! assert (isequal (floor (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (floor (infsup (1.1, 2.0)), infsup (1.0, 2.0))); %!test %! assert (isequal (floor (infsup (-1.1, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (floor (infsup (-1.1, 0.0)), infsup (-2.0, 0.0))); %!test %! assert (isequal (floor (infsup (-1.1, -0.0)), infsup (-2.0, 0.0))); %!test %! assert (isequal (floor (infsup (-1.1, -0.4)), infsup (-2.0, -1.0))); %!test %! assert (isequal (floor (infsup (-1.9, 2.2)), infsup (-2.0, 2.0))); %!test %! assert (isequal (floor (infsup (-1.0, 2.2)), infsup (-1.0, 2.0))); %!test %! assert (isequal (floor (infsup (0.0, 2.2)), infsup (0.0, 2.0))); %!test %! assert (isequal (floor (infsup (-0.0, 2.2)), infsup (0.0, 2.0))); %!test %! assert (isequal (floor (infsup (-1.5, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (floor (infsup (-inf, 2.2)), infsup (-inf, 2.0))); ## minimal_floor_dec_test %!test %! assert (isequal (floor (infsupdec (1.1, 2.0, "com")), infsupdec (1.0, 2.0, "def"))); %! assert (isequal (decorationpart (floor (infsupdec (1.1, 2.0, "com"))){1}, decorationpart (infsupdec (1.0, 2.0, "def")){1})); %!test %! assert (isequal (floor (infsupdec (-1.1, 2.0, "def")), infsupdec (-2.0, 2.0, "def"))); %! assert (isequal (decorationpart (floor (infsupdec (-1.1, 2.0, "def"))){1}, decorationpart (infsupdec (-2.0, 2.0, "def")){1})); %!test %! assert (isequal (floor (infsupdec (-1.1, 0.0, "dac")), infsupdec (-2.0, 0.0, "def"))); %! assert (isequal (decorationpart (floor (infsupdec (-1.1, 0.0, "dac"))){1}, decorationpart (infsupdec (-2.0, 0.0, "def")){1})); %!test %! assert (isequal (floor (infsupdec (-1.2, -1.1, "com")), infsupdec (-2.0, -2.0, "com"))); %! assert (isequal (decorationpart (floor (infsupdec (-1.2, -1.1, "com"))){1}, decorationpart (infsupdec (-2.0, -2.0, "com")){1})); %!test %! assert (isequal (floor (infsupdec (-1.1, -0.4, "def")), infsupdec (-2.0, -1.0, "def"))); %! assert (isequal (decorationpart (floor (infsupdec (-1.1, -0.4, "def"))){1}, decorationpart (infsupdec (-2.0, -1.0, "def")){1})); %!test %! assert (isequal (floor (infsupdec (-1.9, 2.2, "com")), infsupdec (-2.0, 2.0, "def"))); %! assert (isequal (decorationpart (floor (infsupdec (-1.9, 2.2, "com"))){1}, decorationpart (infsupdec (-2.0, 2.0, "def")){1})); %!test %! assert (isequal (floor (infsupdec (-1.0, 2.2, "trv")), infsupdec (-1.0, 2.0, "trv"))); %! assert (isequal (decorationpart (floor (infsupdec (-1.0, 2.2, "trv"))){1}, decorationpart (infsupdec (-1.0, 2.0, "trv")){1})); %!test %! assert (isequal (floor (infsupdec (0.0, 2.2, "trv")), infsupdec (0.0, 2.0, "trv"))); %! assert (isequal (decorationpart (floor (infsupdec (0.0, 2.2, "trv"))){1}, decorationpart (infsupdec (0.0, 2.0, "trv")){1})); %!test %! assert (isequal (floor (infsupdec (-0.0, 2.2, "com")), infsupdec (0.0, 2.0, "def"))); %! assert (isequal (decorationpart (floor (infsupdec (-0.0, 2.2, "com"))){1}, decorationpart (infsupdec (0.0, 2.0, "def")){1})); %!test %! assert (isequal (floor (infsupdec (-1.5, inf, "dac")), infsupdec (-2.0, inf, "def"))); %! assert (isequal (decorationpart (floor (infsupdec (-1.5, inf, "dac"))){1}, decorationpart (infsupdec (-2.0, inf, "def")){1})); %!test %! assert (isequal (floor (infsupdec (-inf, 2.2, "trv")), infsupdec (-inf, 2.0, "trv"))); %! assert (isequal (decorationpart (floor (infsupdec (-inf, 2.2, "trv"))){1}, decorationpart (infsupdec (-inf, 2.0, "trv")){1})); ## minimal_trunc_test %!test %! assert (isequal (fix (infsup), infsup)); %!test %! assert (isequal (fix (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (fix (infsup (1.1, 2.1)), infsup (1.0, 2.0))); %!test %! assert (isequal (fix (infsup (-1.1, 2.0)), infsup (-1.0, 2.0))); %!test %! assert (isequal (fix (infsup (-1.1, 0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (fix (infsup (-1.1, -0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (fix (infsup (-1.1, -0.4)), infsup (-1.0, 0.0))); %!test %! assert (isequal (fix (infsup (-1.9, 2.2)), infsup (-1.0, 2.0))); %!test %! assert (isequal (fix (infsup (-1.0, 2.2)), infsup (-1.0, 2.0))); %!test %! assert (isequal (fix (infsup (0.0, 2.2)), infsup (0.0, 2.0))); %!test %! assert (isequal (fix (infsup (-0.0, 2.2)), infsup (0.0, 2.0))); %!test %! assert (isequal (fix (infsup (-1.5, inf)), infsup (-1.0, inf))); %!test %! assert (isequal (fix (infsup (-inf, 2.2)), infsup (-inf, 2.0))); ## minimal_trunc_dec_test %!test %! assert (isequal (fix (infsupdec (1.1, 2.1, "com")), infsupdec (1.0, 2.0, "def"))); %! assert (isequal (decorationpart (fix (infsupdec (1.1, 2.1, "com"))){1}, decorationpart (infsupdec (1.0, 2.0, "def")){1})); %!test %! assert (isequal (fix (infsupdec (1.1, 1.9, "com")), infsupdec (1.0, 1.0, "com"))); %! assert (isequal (decorationpart (fix (infsupdec (1.1, 1.9, "com"))){1}, decorationpart (infsupdec (1.0, 1.0, "com")){1})); %!test %! assert (isequal (fix (infsupdec (-1.1, 2.0, "dac")), infsupdec (-1.0, 2.0, "def"))); %! assert (isequal (decorationpart (fix (infsupdec (-1.1, 2.0, "dac"))){1}, decorationpart (infsupdec (-1.0, 2.0, "def")){1})); %!test %! assert (isequal (fix (infsupdec (-1.1, 0.0, "trv")), infsupdec (-1.0, 0.0, "trv"))); %! assert (isequal (decorationpart (fix (infsupdec (-1.1, 0.0, "trv"))){1}, decorationpart (infsupdec (-1.0, 0.0, "trv")){1})); %!test %! assert (isequal (fix (infsupdec (-1.1, -0.0, "def")), infsupdec (-1.0, 0.0, "def"))); %! assert (isequal (decorationpart (fix (infsupdec (-1.1, -0.0, "def"))){1}, decorationpart (infsupdec (-1.0, 0.0, "def")){1})); %!test %! assert (isequal (fix (infsupdec (-1.1, -0.4, "com")), infsupdec (-1.0, 0.0, "def"))); %! assert (isequal (decorationpart (fix (infsupdec (-1.1, -0.4, "com"))){1}, decorationpart (infsupdec (-1.0, 0.0, "def")){1})); %!test %! assert (isequal (fix (infsupdec (-1.9, 2.2, "def")), infsupdec (-1.0, 2.0, "def"))); %! assert (isequal (decorationpart (fix (infsupdec (-1.9, 2.2, "def"))){1}, decorationpart (infsupdec (-1.0, 2.0, "def")){1})); %!test %! assert (isequal (fix (infsupdec (-1.0, 2.2, "dac")), infsupdec (-1.0, 2.0, "def"))); %! assert (isequal (decorationpart (fix (infsupdec (-1.0, 2.2, "dac"))){1}, decorationpart (infsupdec (-1.0, 2.0, "def")){1})); %!test %! assert (isequal (fix (infsupdec (-1.5, inf, "dac")), infsupdec (-1.0, inf, "def"))); %! assert (isequal (decorationpart (fix (infsupdec (-1.5, inf, "dac"))){1}, decorationpart (infsupdec (-1.0, inf, "def")){1})); %!test %! assert (isequal (fix (infsupdec (-inf, 2.2, "trv")), infsupdec (-inf, 2.0, "trv"))); %! assert (isequal (decorationpart (fix (infsupdec (-inf, 2.2, "trv"))){1}, decorationpart (infsupdec (-inf, 2.0, "trv")){1})); ## minimal_roundTiesToEven_test %!test %! assert (isequal (roundb (infsup), infsup)); %!test %! assert (isequal (roundb (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (roundb (infsup (1.1, 2.1)), infsup (1.0, 2.0))); %!test %! assert (isequal (roundb (infsup (-1.1, 2.0)), infsup (-1.0, 2.0))); %!test %! assert (isequal (roundb (infsup (-1.1, -0.4)), infsup (-1.0, 0.0))); %!test %! assert (isequal (roundb (infsup (-1.1, 0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (roundb (infsup (-1.1, -0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (roundb (infsup (-1.9, 2.2)), infsup (-2.0, 2.0))); %!test %! assert (isequal (roundb (infsup (-1.0, 2.2)), infsup (-1.0, 2.0))); %!test %! assert (isequal (roundb (infsup (1.5, 2.1)), infsup (2.0, 2.0))); %!test %! assert (isequal (roundb (infsup (-1.5, 2.0)), infsup (-2.0, 2.0))); %!test %! assert (isequal (roundb (infsup (-1.1, -0.5)), infsup (-1.0, 0.0))); %!test %! assert (isequal (roundb (infsup (-1.9, 2.5)), infsup (-2.0, 2.0))); %!test %! assert (isequal (roundb (infsup (0.0, 2.5)), infsup (0.0, 2.0))); %!test %! assert (isequal (roundb (infsup (-0.0, 2.5)), infsup (0.0, 2.0))); %!test %! assert (isequal (roundb (infsup (-1.5, 2.5)), infsup (-2.0, 2.0))); %!test %! assert (isequal (roundb (infsup (-1.5, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (roundb (infsup (-inf, 2.2)), infsup (-inf, 2.0))); ## minimal_roundTiesToEven_dec_test %!test %! assert (isequal (roundb (infsupdec (1.1, 2.1, "com")), infsupdec (1.0, 2.0, "def"))); %! assert (isequal (decorationpart (roundb (infsupdec (1.1, 2.1, "com"))){1}, decorationpart (infsupdec (1.0, 2.0, "def")){1})); %!test %! assert (isequal (roundb (infsupdec (-1.1, 2.0, "trv")), infsupdec (-1.0, 2.0, "trv"))); %! assert (isequal (decorationpart (roundb (infsupdec (-1.1, 2.0, "trv"))){1}, decorationpart (infsupdec (-1.0, 2.0, "trv")){1})); %!test %! assert (isequal (roundb (infsupdec (-1.6, -1.5, "com")), infsupdec (-2.0, -2.0, "dac"))); %! assert (isequal (decorationpart (roundb (infsupdec (-1.6, -1.5, "com"))){1}, decorationpart (infsupdec (-2.0, -2.0, "dac")){1})); %!test %! assert (isequal (roundb (infsupdec (-1.6, -1.4, "com")), infsupdec (-2.0, -1.0, "def"))); %! assert (isequal (decorationpart (roundb (infsupdec (-1.6, -1.4, "com"))){1}, decorationpart (infsupdec (-2.0, -1.0, "def")){1})); %!test %! assert (isequal (roundb (infsupdec (-1.5, inf, "dac")), infsupdec (-2.0, inf, "def"))); %! assert (isequal (decorationpart (roundb (infsupdec (-1.5, inf, "dac"))){1}, decorationpart (infsupdec (-2.0, inf, "def")){1})); %!test %! assert (isequal (roundb (infsupdec (-inf, 2.2, "trv")), infsupdec (-inf, 2.0, "trv"))); %! assert (isequal (decorationpart (roundb (infsupdec (-inf, 2.2, "trv"))){1}, decorationpart (infsupdec (-inf, 2.0, "trv")){1})); ## minimal_roundTiesToAway_test %!test %! assert (isequal (round (infsup), infsup)); %!test %! assert (isequal (round (infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (round (infsup (1.1, 2.1)), infsup (1.0, 2.0))); %!test %! assert (isequal (round (infsup (-1.1, 2.0)), infsup (-1.0, 2.0))); %!test %! assert (isequal (round (infsup (-1.1, 0.0)), infsup (-1.0, 0.0))); %!test %! assert (isequal (round (infsup (-1.1, -0.0)), infsup (-1.0, -0.0))); %!test %! assert (isequal (round (infsup (-1.1, -0.4)), infsup (-1.0, 0.0))); %!test %! assert (isequal (round (infsup (-1.9, 2.2)), infsup (-2.0, 2.0))); %!test %! assert (isequal (round (infsup (-1.0, 2.2)), infsup (-1.0, 2.0))); %!test %! assert (isequal (round (infsup (0.5, 2.1)), infsup (1.0, 2.0))); %!test %! assert (isequal (round (infsup (-2.5, 2.0)), infsup (-3.0, 2.0))); %!test %! assert (isequal (round (infsup (-1.1, -0.5)), infsup (-1.0, -1.0))); %!test %! assert (isequal (round (infsup (-1.9, 2.5)), infsup (-2.0, 3.0))); %!test %! assert (isequal (round (infsup (-1.5, 2.5)), infsup (-2.0, 3.0))); %!test %! assert (isequal (round (infsup (0.0, 2.5)), infsup (0.0, 3.0))); %!test %! assert (isequal (round (infsup (-0.0, 2.5)), infsup (0.0, 3.0))); %!test %! assert (isequal (round (infsup (-1.5, inf)), infsup (-2.0, inf))); %!test %! assert (isequal (round (infsup (-inf, 2.2)), infsup (-inf, 2.0))); ## minimal_roundTiesToAway_dec_test %!test %! assert (isequal (round (infsupdec (1.1, 2.1, "com")), infsupdec (1.0, 2.0, "def"))); %! assert (isequal (decorationpart (round (infsupdec (1.1, 2.1, "com"))){1}, decorationpart (infsupdec (1.0, 2.0, "def")){1})); %!test %! assert (isequal (round (infsupdec (-1.9, 2.2, "com")), infsupdec (-2.0, 2.0, "def"))); %! assert (isequal (decorationpart (round (infsupdec (-1.9, 2.2, "com"))){1}, decorationpart (infsupdec (-2.0, 2.0, "def")){1})); %!test %! assert (isequal (round (infsupdec (1.9, 2.2, "com")), infsupdec (2.0, 2.0, "com"))); %! assert (isequal (decorationpart (round (infsupdec (1.9, 2.2, "com"))){1}, decorationpart (infsupdec (2.0, 2.0, "com")){1})); %!test %! assert (isequal (round (infsupdec (-1.0, 2.2, "trv")), infsupdec (-1.0, 2.0, "trv"))); %! assert (isequal (decorationpart (round (infsupdec (-1.0, 2.2, "trv"))){1}, decorationpart (infsupdec (-1.0, 2.0, "trv")){1})); %!test %! assert (isequal (round (infsupdec (2.5, 2.6, "com")), infsupdec (3.0, 3.0, "dac"))); %! assert (isequal (decorationpart (round (infsupdec (2.5, 2.6, "com"))){1}, decorationpart (infsupdec (3.0, 3.0, "dac")){1})); %!test %! assert (isequal (round (infsupdec (-1.5, inf, "dac")), infsupdec (-2.0, inf, "def"))); %! assert (isequal (decorationpart (round (infsupdec (-1.5, inf, "dac"))){1}, decorationpart (infsupdec (-2.0, inf, "def")){1})); %!test %! assert (isequal (round (infsupdec (-inf, 2.2, "def")), infsupdec (-inf, 2.0, "def"))); %! assert (isequal (decorationpart (round (infsupdec (-inf, 2.2, "def"))){1}, decorationpart (infsupdec (-inf, 2.0, "def")){1})); ## minimal_abs_test %!test %! assert (isequal (abs (infsup), infsup)); %!test %! assert (isequal (abs (infsup (-inf, inf)), infsup (0.0, inf))); %!test %! assert (isequal (abs (infsup (1.1, 2.1)), infsup (1.1, 2.1))); %!test %! assert (isequal (abs (infsup (-1.1, 2.0)), infsup (0.0, 2.0))); %!test %! assert (isequal (abs (infsup (-1.1, 0.0)), infsup (0.0, 1.1))); %!test %! assert (isequal (abs (infsup (-1.1, -0.0)), infsup (0.0, 1.1))); %!test %! assert (isequal (abs (infsup (-1.1, -0.4)), infsup (0.4, 1.1))); %!test %! assert (isequal (abs (infsup (-1.9, 0.2)), infsup (0.0, 1.9))); %!test %! assert (isequal (abs (infsup (0.0, 0.2)), infsup (0.0, 0.2))); %!test %! assert (isequal (abs (infsup (-0.0, 0.2)), infsup (0.0, 0.2))); %!test %! assert (isequal (abs (infsup (-1.5, inf)), infsup (0.0, inf))); %!test %! assert (isequal (abs (infsup (-inf, -2.2)), infsup (2.2, inf))); ## minimal_abs_dec_test %!test %! assert (isequal (abs (infsupdec (-1.1, 2.0, "com")), infsupdec (0.0, 2.0, "com"))); %! assert (isequal (decorationpart (abs (infsupdec (-1.1, 2.0, "com"))){1}, decorationpart (infsupdec (0.0, 2.0, "com")){1})); %!test %! assert (isequal (abs (infsupdec (-1.1, 0.0, "dac")), infsupdec (0.0, 1.1, "dac"))); %! assert (isequal (decorationpart (abs (infsupdec (-1.1, 0.0, "dac"))){1}, decorationpart (infsupdec (0.0, 1.1, "dac")){1})); %!test %! assert (isequal (abs (infsupdec (-1.1, -0.0, "def")), infsupdec (0.0, 1.1, "def"))); %! assert (isequal (decorationpart (abs (infsupdec (-1.1, -0.0, "def"))){1}, decorationpart (infsupdec (0.0, 1.1, "def")){1})); %!test %! assert (isequal (abs (infsupdec (-1.1, -0.4, "trv")), infsupdec (0.4, 1.1, "trv"))); %! assert (isequal (decorationpart (abs (infsupdec (-1.1, -0.4, "trv"))){1}, decorationpart (infsupdec (0.4, 1.1, "trv")){1})); %!test %! assert (isequal (abs (infsupdec (-1.9, 0.2, "dac")), infsupdec (0.0, 1.9, "dac"))); %! assert (isequal (decorationpart (abs (infsupdec (-1.9, 0.2, "dac"))){1}, decorationpart (infsupdec (0.0, 1.9, "dac")){1})); %!test %! assert (isequal (abs (infsupdec (0.0, 0.2, "def")), infsupdec (0.0, 0.2, "def"))); %! assert (isequal (decorationpart (abs (infsupdec (0.0, 0.2, "def"))){1}, decorationpart (infsupdec (0.0, 0.2, "def")){1})); %!test %! assert (isequal (abs (infsupdec (-0.0, 0.2, "com")), infsupdec (0.0, 0.2, "com"))); %! assert (isequal (decorationpart (abs (infsupdec (-0.0, 0.2, "com"))){1}, decorationpart (infsupdec (0.0, 0.2, "com")){1})); %!test %! assert (isequal (abs (infsupdec (-1.5, inf, "dac")), infsupdec (0.0, inf, "dac"))); %! assert (isequal (decorationpart (abs (infsupdec (-1.5, inf, "dac"))){1}, decorationpart (infsupdec (0.0, inf, "dac")){1})); ## minimal_min_test %!test %! assert (isequal (min (infsup, infsup (1.0, 2.0)), infsup)); %!test %! assert (isequal (min (infsup (1.0, 2.0), infsup), infsup)); %!test %! assert (isequal (min (infsup, infsup), infsup)); %!test %! assert (isequal (min (infsup (-inf, inf), infsup (1.0, 2.0)), infsup (-inf, 2.0))); %!test %! assert (isequal (min (infsup (1.0, 2.0), infsup (-inf, inf)), infsup (-inf, 2.0))); %!test %! assert (isequal (min (infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (min (infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (min (infsup (1.0, 5.0), infsup (2.0, 4.0)), infsup (1.0, 4.0))); %!test %! assert (isequal (min (infsup (0.0, 5.0), infsup (2.0, 4.0)), infsup (0.0, 4.0))); %!test %! assert (isequal (min (infsup (-0.0, 5.0), infsup (2.0, 4.0)), infsup (0.0, 4.0))); %!test %! assert (isequal (min (infsup (1.0, 5.0), infsup (2.0, 8.0)), infsup (1.0, 5.0))); %!test %! assert (isequal (min (infsup (1.0, 5.0), infsup (-inf, inf)), infsup (-inf, 5.0))); %!test %! assert (isequal (min (infsup (-7.0, -5.0), infsup (2.0, 4.0)), infsup (-7.0, -5.0))); %!test %! assert (isequal (min (infsup (-7.0, 0.0), infsup (2.0, 4.0)), infsup (-7.0, 0.0))); %!test %! assert (isequal (min (infsup (-7.0, -0.0), infsup (2.0, 4.0)), infsup (-7.0, 0.0))); ## minimal_min_dec_test %!test %! assert (isequal (min (infsupdec (entire, "def"), infsupdec (1.0, 2.0, "com")), infsupdec (-inf, 2.0, "def"))); %! assert (isequal (decorationpart (min (infsupdec (entire, "def"), infsupdec (1.0, 2.0, "com"))){1}, decorationpart (infsupdec (-inf, 2.0, "def")){1})); %!test %! assert (isequal (min (infsupdec (-7.0, -5.0, "trv"), infsupdec (2.0, 4.0, "def")), infsupdec (-7.0, -5.0, "trv"))); %! assert (isequal (decorationpart (min (infsupdec (-7.0, -5.0, "trv"), infsupdec (2.0, 4.0, "def"))){1}, decorationpart (infsupdec (-7.0, -5.0, "trv")){1})); %!test %! assert (isequal (min (infsupdec (-7.0, 0.0, "dac"), infsupdec (2.0, 4.0, "def")), infsupdec (-7.0, 0.0, "def"))); %! assert (isequal (decorationpart (min (infsupdec (-7.0, 0.0, "dac"), infsupdec (2.0, 4.0, "def"))){1}, decorationpart (infsupdec (-7.0, 0.0, "def")){1})); %!test %! assert (isequal (min (infsupdec (-7.0, -0.0, "com"), infsupdec (2.0, 4.0, "com")), infsupdec (-7.0, 0.0, "com"))); %! assert (isequal (decorationpart (min (infsupdec (-7.0, -0.0, "com"), infsupdec (2.0, 4.0, "com"))){1}, decorationpart (infsupdec (-7.0, 0.0, "com")){1})); ## minimal_max_test %!test %! assert (isequal (max (infsup, infsup (1.0, 2.0)), infsup)); %!test %! assert (isequal (max (infsup (1.0, 2.0), infsup), infsup)); %!test %! assert (isequal (max (infsup, infsup), infsup)); %!test %! assert (isequal (max (infsup (-inf, inf), infsup (1.0, 2.0)), infsup (1.0, inf))); %!test %! assert (isequal (max (infsup (1.0, 2.0), infsup (-inf, inf)), infsup (1.0, inf))); %!test %! assert (isequal (max (infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (max (infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (max (infsup (1.0, 5.0), infsup (2.0, 4.0)), infsup (2.0, 5.0))); %!test %! assert (isequal (max (infsup (1.0, 5.0), infsup (2.0, 8.0)), infsup (2.0, 8.0))); %!test %! assert (isequal (max (infsup (-1.0, 5.0), infsup (-inf, inf)), infsup (-1.0, inf))); %!test %! assert (isequal (max (infsup (-7.0, -5.0), infsup (2.0, 4.0)), infsup (2.0, 4.0))); %!test %! assert (isequal (max (infsup (-7.0, -5.0), infsup (0.0, 4.0)), infsup (0.0, 4.0))); %!test %! assert (isequal (max (infsup (-7.0, -5.0), infsup (-0.0, 4.0)), infsup (0.0, 4.0))); %!test %! assert (isequal (max (infsup (-7.0, -5.0), infsup (-2.0, 0.0)), infsup (-2.0, 0.0))); %!test %! assert (isequal (max (infsup (-7.0, -5.0), infsup (-2.0, -0.0)), infsup (-2.0, 0.0))); ## minimal_max_dec_test %!test %! assert (isequal (max (infsupdec (entire, "def"), infsupdec (1.0, 2.0, "com")), infsupdec (1.0, inf, "def"))); %! assert (isequal (decorationpart (max (infsupdec (entire, "def"), infsupdec (1.0, 2.0, "com"))){1}, decorationpart (infsupdec (1.0, inf, "def")){1})); %!test %! assert (isequal (max (infsupdec (-7.0, -5.0, "trv"), infsupdec (2.0, 4.0, "def")), infsupdec (2.0, 4.0, "trv"))); %! assert (isequal (decorationpart (max (infsupdec (-7.0, -5.0, "trv"), infsupdec (2.0, 4.0, "def"))){1}, decorationpart (infsupdec (2.0, 4.0, "trv")){1})); %!test %! assert (isequal (max (infsupdec (-7.0, 5.0, "dac"), infsupdec (2.0, 4.0, "def")), infsupdec (2.0, 5.0, "def"))); %! assert (isequal (decorationpart (max (infsupdec (-7.0, 5.0, "dac"), infsupdec (2.0, 4.0, "def"))){1}, decorationpart (infsupdec (2.0, 5.0, "def")){1})); %!test %! assert (isequal (max (infsupdec (3.0, 3.5, "com"), infsupdec (2.0, 4.0, "com")), infsupdec (3.0, 4.0, "com"))); %! assert (isequal (decorationpart (max (infsupdec (3.0, 3.5, "com"), infsupdec (2.0, 4.0, "com"))){1}, decorationpart (infsupdec (3.0, 4.0, "com")){1})); interval-2.1.0/inst/test/abs_rev.tst0000644000175000017500000001003713031037022017021 0ustar oliveroliver## DO NOT EDIT! Generated automatically from test/abs_rev.itl ## by the Interval Testing Framework for IEEE 1788. ## https://github.com/nehmeier/ITF1788/tree/92558f7e942665a78f2e883dbe7af52320100fba ## ## Copyright 2015-2016 Oliver Heimlich ## ## 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 . ## %!#Test library imports %!#Arithmetic library imports pkg load interval %!#Preamble try; error ("__FILE__"); catch test (lasterror.stack.file, "quiet", stdout); end_try_catch; %!function assert_warn (observed_value, expected_value) %! if (not (isequal (observed_value, expected_value))) %! observed_expression = regexprep (argn(1, :), '\s+$', ''); %! expected_expression = regexprep (argn(2, :), '\s+$', ''); %! observed_as_char = disp (observed_value)(1 : end - 1); %! expected_as_char = disp(expected_value)(1 : end - 1); %! warning ([observed_expression, " != ", expected_expression, ... %! "\n ", observed_as_char, " != ", expected_as_char]); %! endif %!endfunction ## minimal.absRevBin_test %!test %! assert (isequal (absrev (infsup, infsup (-inf, inf)), infsup)); %!test %! assert (isequal (absrev (infsup (0.0, 1.0), infsup), infsup)); %!test %! assert (isequal (absrev (infsup (0.0, 1.0), infsup (7.0, 9.0)), infsup)); %!test %! assert (isequal (absrev (infsup, infsup (0.0, 1.0)), infsup)); %!test %! assert (isequal (absrev (infsup (-2.0, -1.0), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (absrev (infsup (1.0, 1.0), infsup (-inf, inf)), infsup (-1.0, 1.0))); %!test %! assert (isequal (absrev (infsup (0.0, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (absrev (infsup (-1.0, -1.0), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (absrev (infsup (1.797693134862315708e+308, 1.797693134862315708e+308), infsup (-inf, inf)), infsup (-1.797693134862315708e+308, 1.797693134862315708e+308))); %!test %! assert (isequal (absrev (infsup (2.225073858507201383e-308, 2.225073858507201383e-308), infsup (-inf, inf)), infsup (-2.225073858507201383e-308, 2.225073858507201383e-308))); %!test %! assert (isequal (absrev (infsup (-2.225073858507201383e-308, -2.225073858507201383e-308), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (absrev (infsup (-1.797693134862315708e+308, -1.797693134862315708e+308), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (absrev (infsup (1.0, 2.0), infsup (-inf, inf)), infsup (-2.0, 2.0))); %!test %! assert (isequal (absrev (infsup (1.0, 2.0), infsup (0.0, 2.0)), infsup (1.0, 2.0))); %!test %! assert (isequal (absrev (infsup (0.0, 1.0), infsup (-0.5, 2.0)), infsup (-0.5, 1.0))); %!test %! assert (isequal (absrev (infsup (-1.0, 1.0), infsup (-inf, inf)), infsup (-1.0, 1.0))); %!test %! assert (isequal (absrev (infsup (-1.0, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (absrev (infsup (0.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (absrev (infsup (-inf, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (absrev (infsup (-inf, 0.0), infsup (-inf, inf)), infsup (0.0, 0.0))); %!test %! assert (isequal (absrev (infsup (1.0, inf), infsup (-inf, 0.0)), infsup (-inf, -1.0))); %!test %! assert (isequal (absrev (infsup (-1.0, inf), infsup (-inf, inf)), infsup (-inf, inf))); %!test %! assert (isequal (absrev (infsup (-inf, -1.0), infsup (-inf, inf)), infsup)); %!test %! assert (isequal (absrev (infsup (-inf, 1.0), infsup (-inf, inf)), infsup (-1.0, 1.0)));

,[B"6_e!n4.>efQ[nZ=/\99+AQi&K^U":mjuFpp+bSE6Nj&omrnEnH8 l%`:BnRI0cE3MmceVDl1l-W["p\pQ9EnBl_P.^K_T3JmQe6]Q?a8D6JWi%7m[jV*l?AEc8"gh\H73?Qbd._h6L6tF3D_HN+UT;t#%_u;$+ D-=0.)^3u&%H&$TG<0R8V#DPrT?34P/r?=97\0Kr[0mY2a;aCkW7NYJ:Bn"LZeYU?A"mZFD dXJn7I;$'aCTkJ^UD"E&RfA:A"ifrtY6^-p@Y+AHX\)oe6%(J6<"7-0hs@F^k"HG?J;HY4] N48RGbGk^XjS8XL2)#6fcHiD=2u-6!>J6t-`f@S%9"CEh+8<+52T*fe;%;Aga39d>kDAJ2O Q[SniF9I8*Yi\SbWQadY4ePS!;tYFKrjXnYf9D_0.[a)1<,&a$Ki4.U7^LBRk)F8j >d%7G(-;D[`Fc7m&*tNdl$I9VgTD>SQ.Fu>\m@#@"R5#MT00-X(b?.-%>D`/0j&Qs=TFG(+ V7crSkCN!aZ<7S1f=K_S^6K+)Eek&6`8@I1tnL4Y<7nE[*hSp#1%(lgMV3S]tX5`^>T P6pNPjfHGOO/Lq>\e)FF$^u''`uYRJ(5u^;k7tHt";HW0Bn`,nKWnrD??tV?ViF-4hT4F^Y &c7\9VbZ`89j3tqgV!*";tc&0qrZQ=^^U>T(n9,7$V4X=4OoE6KmC6P/$9%`Aq>71[= V$qV,Nd7d1J`=ZW\(<-r6AJ[gtfa(?@A)SD*PZ94Btac]&_-->^o Tde,^XJ7;gP/OIRaom8XCTR+7aKple@@f+`VEE6`9f$&12U2tHjYtJ+N9NFLe'.,@cP,C45 0suA"Z[&R:C!cp9h /BgK*^JDqbD7>#5lE+XgP5KoLM'e3rPAEOcmDQ$Ko!XlXn9QbE'>hj;=\I@LPQo3L1>/e*H l(etE<)^_fgA!f6),D]f2Xso:gGg7n#@i4&cNoV&>7??MT%S;lFfhP2*jV\Z#FI`,,AXV\K Y&0Zk):!AqkF(adTBI1'Kq[^t8bd]TVO;BZBj,,8VWo(KV5J'sNiT/Egmj#X)O!eoff0@G1>PY@ZI3S\K=&pRT ?Qh=pm:J`6B108&;T"E<.8&n@Q%kBXdkV bZC.Uug-RE\ f=_-R91t2Nf"U0/=0Q`0;>Pf;H"6#N*1ul`^%^Ff1bF&TUQK:R+@_+D, "`\Y,:jTfGc.5^a]LPW([,`S+5W(LZ5s-LK]+*g&"^?Lu/eqn5+qG,s3ZqnuG^-9V2>>+G< jY%Uq7Z+1f[F:YG\2kTp>(WnUb)#^R1oBj*#Jm&[8,Fg![Z]iWq`?gHNm7d/qUfMm6Z"DGj jJtQt^`KOfuFcfhX9#r:**[aki'r(r&3>KL7TbY&?%tW`f7L7H`[0E@3gY$r=/b-O+b4lGIau`,4\\CiID@Zd'bA[P5^auem?s F"hn/_nOfI<)B@A5Prh@[V,:C:N8/VW]6)8fP>H&f//"'YsQ`#+L>@Ot0/0fC0n:bB#*kUh _IXtbP'_75Gt1(W0@P/g\f*]Z?2Nq**3a;F,X$BXC7L[tYdGqULTgmk7t';VJMP]R0"n2:@ k7?P,tj(68lQa6m%bZTEMjq*.8?X6NAoQ#J`,Z2.%R3J!p2hsnIoQpU;tL9B T7_qgLDUU(TH8s;)D=ImfG+KC4&[%!]IXJ"1(>t5D%aXg>_t^1$fRU1e/FBFC0a3+o`2*,? qr:BI9imrKO!(h^KG>XBs%'"\^oL"-&W?R#/u+K!jRb@`q\:.2Eo.s!VcnYJC,LJKRqiT%r ).XQ5P5jdgTX:Ckb'o\&PX_#L]5b8tF3V2b)ob4.gY5fd8J--o%%9f6U(alnQF<3"Q`9A+/ 7L^ZIr'&#(%-#b_YRk+'lY;aaAT=g'et-P>>X:3+W/cT5gs=f\'.NcC3t7>Sbucs2VrnkB3 M"N:D7goc8"dY1#$D%PhlcA0dt2eKV>(G(ecOOl[P2VWLN8TR,>^)1tmb0r0=IH5l7^:NJdG<.#G c`@i\5qnJhtuo*6%]C#pfiYr4@b.r4s.age1k@YmuaiqoKrpNRrkfee+6mYc6\So-\fZ#k> YP=#]Z,DI7:+-2QPAShc]:4>)'Id_Uj-ABJ@B/UDfHU-a(:S2ht1hnUD).Hs[c]d)b8g_p- J3^G5?XhpCu/D.jAu&ghM8hRd-4metJ>GV:)t(8F].1f:nH#Idk%T<%[.^YAVRONSS1_qtD lUclcNqn\on"om?hs3LK?n-&eC"s64"rm25X0GOV-)$-r^!TcE`+eTKB;$*jD`@rkG&2+,4 X;QRc$&p^[:dW0@6u;t#'Hjd(:fPLi=NGG_"jgHWk5HFZc,%71!;%@!i#QAqI:q:#Y"oIDaUF$q)^ ,t)XW#S`f$TT3d7kZu6#I*M4:-Rr'!,@AW%JoQ.Kr+K&n!?ANDS-P"V@pF&FE4.!@e2rGnI 0&&aaQN&KMK=.2$VP&kJ6&5p-9sJc`2+3B)&e@1Ra*2< Z*PBe.,s[J)t)N%%c.t8lCRLi*:V,l/H2&g4QVG2*V%qI$6J>iAKG;=s$\f'"`7+ 7]7^/r&TXMPW':0Q*'HBJJK-L=":CZ.aMNQo!KtkN_losp2[tB_#b8nP4t&[3^lY?np)VRf.F:V/]DI *j`8I4K_a&Y.<=l116VL7Y5>O&qbmFj`P26X`A!u6*[0tNL4UHil5t%!rY$G0o-GV3l4kIq AhqZL+W_N;P5p[F1[kW+'0S0.8Mk$)*$OCUo.r7F=Z*Nk2=k4n62VWeE")4r"*8Ga;ft"iG &)Z)(;RllF+k,uBH$tE%5;>t1R/.XR5m'm3FTc?i=Rt(WB.+,#EfecK/=,_\da1h(3#U&1V l1mR67Ud$1Oi"e($T;fa@?+c6;HlJYZ5k_'B]]$rcSC6(/BNI1cV:ds:"7ijo]8h)ktVr[:3>r"[ *0Bg$3d,j&YO8Bo`J#*"]2T5;"Y&j+XReOg(2"6&+pr@'d$=2.8k:?;H5GLT`,NH(_Zoe&Y VWlog;[n79$Z[&Kq>kTahU,)c_#b'L=Pr@7V%([9Jp*>ID:Oou1.ca]p^H>]n:s2:5] PcX!s/?.IV6p#TCd/e]C9%\Y?gFn&g=o3ZY=?a]uBQ3CXSFq+N[(Vnr?!J=f=(L^>^@J1^N 2B-+K+_$`O.q,,#p,(qbGj"c`+;R0a;@-lS%qLh:#M)^nTu%@L$R0U;Ab%'X,=*N[.;#n2B #B'2_/pZ;4K4K2BB-SimaCKB_e?404]5/iDWn0b?LLpc--l$-121KA!q2g$(.!L'P2C%u[; 3),CZSk6Tfs?*X#$FsCt@!M[aYpuO;5TB)o5u!J\Q(\kAF>bDYEI92X>:)nSa`dDmoacpB> Ke$#hg2E-D'jFfZ(H-lR:IERu.LpEai=.<5Hd%RD?Y+Li",O)oM,F-f%32aMP05BOA'FOs* +pJl>p=`kNdFa%28[paH(ATjc-%Uh%.@-eOmKm.`fGF*`&2h?3tIsAGU(dYqW:RO)6iZ>r- CY$%4(SQ.cAer4S)oddgdZlI`nU#$m'Oa`U!?)V[JM9%-0Gi+j7D`;J__Ao;)F7J=6^f+G- YE,?I^ei["*lrNoGGEg*-4h2=9UOk#Cnc?JEA*m@D!O\q16$rJbUC?1L)"Fl5_[+K(F&9'7 5@J5T(_1#P8gc0_?3U/d=,&K_(Oa';'u"S0)2*,If%S3+QG2Z"5_sFMYm*@)kBn`B;duL\Q 7Ae'U>MgHBeu*3:2c/n;)X/'#7:3EBMlV"d$8$OSK-D3=V)o @M&Sk).<.B6(/+T;WXcjV)3&n'gX3/W$m4q9l=&YNEoq,Q3=>XgPSef,g&7IO2!p&k;Wq&^`JV5h-/lWOT_b[ gY@u?[B^XjkC9.nr)@uP2C)UNWnmLpPW?ueg5p5_45r"jTH$WYBS%=*ITpujkOrI)V3SDCg J[ca]l)D5RWS->=_+GT\PS@PmWk,C6g9I])[B$mFX89B.)SN45afKg5XBO#Q]$mbWeZHF9X Pi^fJVAWo80%`r*g:%N_7o\*KJU:J1YkP[W!D4(MZ4WcfI(.RPpXQQ2-l +TE&sq@Z"jA"'l5caT'B+0UQh-sj/[Tju?C.4XH,aK*g)f5?Y*]U*3"`T'@CBc'&7LY;HBG U^H+1D6\,1\a+k@UkH'ih4\G/(p)iSN_Tg78R\`VffiB.FV^\>+qNq*-W")rV\E=LUO4Z5EZU "lY=M^e,FE"9SAD"acnp#W.0i4cUB6_Yc"'/P[%s-j(=\_ta,I3;LL?6,\SN'*(uI!>5Ie( WEos`Ru!Fq%+=X$j0q,&",$STr8NQQ5dX]%=@'T-bLC,,RkW:aSC8+3IAkqOia,Yagl"$!@ S0]-RuT9o>A@>[ebX*aTbnP2J'>M*bh[9irH.QqZlJjLL1,6EHC<'l M9_OM$t3BZqVA9%RG!"ZXo4aC*M;%KWS2[&%sm?GVD]6a`47\)/Nmt+4`fCH6rq-s+$o\$- @N,Q'78IF\bd-]+WM/-,I4p-hYlgk3TIh:j7>#F+bgMsQfPcDjSZ1"(rsKQar6sC$p1T'5%Wk?BtF ED+(=d%*d'8#`J4=*1-s+p_!]AGM7n@t]tTWBLQHddKta&RUe0KFiYr(Z>JuhU1^se%tfGdp[4EgbFgo2=>q[L*:"=i'kSuq8?V:`8:Ua q"tdR^5P0_nGHk;58B;h@M'_8(uZ59")8<0UZoh5)PJ>^I%e[^3Q^/Ao7'!rToK`cAq<4hj NLL85tEb9]CihIp#-Z$E<"^CC"Hl^(]g]XH,\rX65+p7*Eo034c>o%n'?:XcbGGgr;Y,L"8 S\gT`#>r,9,#oI>6^(&0W^T)C,,oCXRY>i?,ioiOU#fl;To*lY#2s$DnL\'G'':IAS6g$G#_25]&BZQ@bX,PrL6F1U0[f:0bImsVl';%0lb!ss\!@ H[),ZfYDMPiJTbr0Bi%ONV2*m,b!"]84A1R?"+)WO\ePkqq+b7^#UieSDR]rKbK;Hs7CUnUtBi7WG5>)b0A9EudbjjEhr?LY;*0QNK(",05p( P9`_?4I[WgdU\t!8i!39.nXipX"6nae;.b&_Pr>`Kp*4m1!HslcS\DFACEH]B$!_):*XT>3 u$/FnN5&QjS(l7eEoIt<& Gsf;cDjF"@!hm0U-A^64I:(eeOHc>#te*CKacXX)-M`e[o^'p>*W)>ZV*LF'@_IjsM.%39G7DKAGF0hA;ICH=$?:o6XhG`V4j h\-;\Z?hbZEJmLr)i+.s9VA:$-fRXcmi`M3f(mtM'?t0c,8Us)/"o/9/A2t]"P%9:b-l("[ AB&$jTi#>lK&pDd#j/\3D4G6aepEqMq;`jr3e]*?$TCYL2RZKuore$Nt=523J^gLf?RDED977KZ)1&.7kfhY"U$qtC3,n9bHI_/ Q6-'FgA(GYhWX6$F@d)ap(@F53;+0?mY^8K8ZdjChiGFBoDIdr`8n8_%q]?W5NurHDc&p3h ^1dZM@kUfn0>jKm`fZ8%qT%0RP.8.\2J,NO,V:RC6i^4@J!(1ndIlSBU"/+!,rGrB"J7lfF P;ZA"a9c5*n,7`#kOJR:\,QD8"9X0N(')-omMl?(_@>Jf ?GP28"/(;\Jl#JR_0@C5+LD[nU#]2[pcSm*r#p`TNY=`-;$gYBedqm?;6"b3$e4t#&:uT)# SC>OiQO9:;"bqtpid9XoKn?G%O4>l+=TdK"c8$B-D3o#'Ol_o5%=S,*YN][7M*.=ll%N2=M VS(:l5fn-q+H9&gE"QBoR,42FdJt*+Nf+NY0]"7p,:"KHQ-bJ^d-p!9,4jgjtQ-$:7:/%3f =6MieW-77c);*CTCW%`3`ea]U8CUr8ad;KbaUq)KiKY_s8`q&BWOQGE@>0&_8p#025lrt I=B&E2(;j6Y&@-+8MQo&la"0ZFZWA`BF#Hn?fip1Bm+%D,"(4'@OfTEdnDFi9ShA#"^M3(8 WO8%df.]M/,/]lb[Z",=!tgP;6#aaR^l=P`COjNE'u'goV3Rpbgb2'g,Sd%I#rJ]Udk6hW\ sGnOh)h^dY%SJdD8PaIgVDVtrSkIKNq6R]d>tp#%e4@!iYT/4i@!m@n\lMiRWm7)uP\*JA*WOqKuP8F8..FO$591/:[1q)tZ&( 8I&oi)#8H@6+!]0@bBHHoDY*(qNt)lMK#963JZ?\U1dFRf;"3ELkZUqO)KJq]/a3hi-\f sTa=ST3d'RKrf=f;AB^=%5KE[$?hOFSF"4Jb.)65m+L"WD__*^n0#1[C1Ae(%iDPG%6DH%h ZWf9%X:.A*+L?EL\6F_RoFMPkIPIdl1ZQ-[iIN3l18?p#1fHn1C`"CY6A/0-[$+*=j;^#3* Al7e1qH7(UJSf8;F2$o,mZqnLgIh`DF.SS6>Q51A1*2[QNhDr$'Y)ii)k`4G<_TM$8=AlOD _L"@`'-q6R4BR/2RIe@Q"Rp.1KI`e<`PQ^F6``=9\<%-OcB3a#[p+$nr'*RTDDuf3K^` K\]L4^.7(:*(6sG+!oLLB<nCCn#,#6(;scT7mR@Uo7N:b"OBR8ES@R]m._oj(-opEQ*gFZT_L3tuhXEF?C'jZ?Fe^.`iC] 9##1tp;R7'YX ^E4rg<2+isq]8HSg:8$HWZGU#DAkXqAE8uq6J?tKQ:,/u0B3KRm-\`+YdnM*&bKP4G@gcRs 2.#aO#L8])HX,+dsncY%`LI5,t.+F70LoTOF"dJS3\u`]A#V.,==bU(JS/b1di4tW('(c*Por@c (*N_X<5;1,#-i9[2;"0'3%V0[8%^Kc7IpL0Sb?Q@g9l]`Pa=8e@`uCkmB[="i,,q4R>Elm6 a;._a$A>/64ak&]H#6#&%o[7-%-;j3LsVLCeVV=Vep@G!m$0:Rq:c0N=$, mPP]"2ogj][Fka4GP=RK?8lQ6JVh_6@fNbe1?O-4Gtg?8qC)LKW#F'4\/-j8BE_\8K_2ia; )guR8h\)<8C>Lm8-B!=p2>LKn)RA[%,8!S:IpD!>>B_A>@\6UK*h[*.V:IO;EZ@8Z\16a-^ h!TK.`T7S9JWeh(?34KAL%AH]L`dD]`2?sSJ:3_LD)KTKCB<:s!3i<7M6^L?Z\GtS9b@EZ% AbIR:=gqV%oF]V:\1+^8c4MnlcGQm;,"3=Kd?$nn:#,,l`5^6Ug(e`)tJP=%7"`t5NSI!TE $&7AZ#HSQ4h)lnb'dGIj6%+YcAW+B<6NgLa"1Uf'*89'Sg0#EMfd,@tjP\9h()`EHim;'j5lYX+"/@Er`,go\b)^!'="G)$W;LEK%gctrnF0$&hX<&I)$2=rL,?A&jsK nr;MY#NA=!52@i3P@Snh#q[14nVrXXpAEa#D MqDJ_a\iCBb"$8HV[ti9b#^oVmR18:dFJKs3=<(!nF/mlpr\*`,UbXdS.(PfmmPZ*i@!i'r G9E`qfO5I(#X%eBHQ.^t\Q7_"_7 @LiumI51@o,br\7FN7QY,2-@XfZS5#S^d`u'O]a:tA"GbJo1rLY4]tb@2)%XUP83&AXCNA< A1MN6S1;LfA+BJcdUL]pk>!>S;25OP\&d@353c)>3OI0Q:6<_Z4%%pa^in4Yl#E]c6J9cp]MHg?29 0&'?/lCD)_BLr8kLn)7r"GeR:#-_M7YoTOn#)V1!4 jQauYb!l=KNM4XL/DIrDH?I\&_KLN(.R9L]j^m`C[N>2qtsnU,ZgQ^TY;^Rc6hmOa64JC#9 ,GX^;sch+C`o3@d_D`GYL!>0j'AL"Ci#TS=9[ 9cjY#9K*o&Jdj\B>j"\<<^DS3`O3eaeWA>W#\Y2aCoUsB6[&D0>S:h!YI\L-T[mC)=tcKgF BpJP\NAQDiC>B[K#98*@W"9;#IQ45d%W"*(NNa7=2]n8APNIg?AUIYZj/lUGr7^(g([R"fQ\!g\!iff)BF2CYLCciUJ858V-3e]W!QQ[1[jm+<5ffO`Epf6r+C>ut=Th8#"].X<7l(-7S+BsWF(Uu3:g+ "DW+mBKF0@WG^7sN[=Tis[C/M]Q;Z-V:=6c\MC::/74JRYQb45RHL/:Bk`j"#`Z1Nn#Yh1P s[gafeBX&`ESsWsR]klZ'naUT;KK*=o2W3Y=FCH<+F_8EEC'ErW=_nu^Cd'4h]Z+bp)8M1; Tt".iN\#"2bqk*tn)%V'i-gCBb"X+m@k^@37aLdgd%coSm4Qn3^=Dqse>-F%m=s6Qg/-i'5 VZm;pFbfV5>X8jCUKs9KfEa`#"NIO@0\.@DEiJlXR:`)@p34B.;4!^aF)@bWEQ3ApIB:.dr ;c8Ef09SF$iml'fVB(^(\N-O"9Dgf1krOE.mG_[^bKcj_jcXZG,Q$Gq%Ae0 Ug+J"8VGc=I@H*;\d5F`<&8VVJ$H&&#;s.EVqHA?`_FN:.qa.n8@Ba)"%E;X;P5YQa\&pg/ `HD_H-(iG%P4U:udH4R1kNu3#s)/'=PLCcNL:E97-*.(gsBRYh\B-7#3+KYR$E\G#\Qu.JC .S('rB`cifcu+Lb1PUuS!XC7R5:Z66B*6L!o)>!RGRF]=63*rb"Af8C:X!lE2gjL@r9g,YB F/ah4T-ALI4m]8ldu4ZV+L.c*+0Hh1nm<*lmlk[H\VSVr6`9]n4@Y_5:OAQ,l;>( 7g5gIMtB4Cmt!f)AD$,:((50ikfcqRP""40LC!Z9pV4i$![82MY*$\Q?*;!;FR,nZ#&,1/B _&F,iW*L$jIoR]:NP"=Z^.7BJ#-^@5".eUqYE6akG-?E>.hK:`J:1poDo`ft7T@%=OC*apd 8Z#B7e@L&dTi7pjC,L=6>q%RV5$q+_"bt!+Z<;"pHUXg^C/VCoLXjS2iGuH`mak[^de.gt( )8DF;N7#o_;MPbHo<>[Mo9*[=PSWq-'$,YEk+<@B-r(;0Mh%_p4GT'dV/:,/Ol(*VdQnQNi QL,A[C*-G#'Ktk-M\#D^ud`#60Ckic'.DjdS->[]hNTNhne9\^B[6\t+;ZB<0eRGC[KVT%[5k%Gb"i8P_-rV! P!W7GaY%#[dRcerA=WA">57^-o*(:LY0g&#A7+"\2'ueR"@2?j;Ht=59Oh>I/8PNHWeOe1oT-h\nS>@^X1;'S;9%(qo-D*%]M_N@R*6Bt[dlc#7bu7m#2 U0]uiAf+U$-I"I`gLd%:D;7L4jVUE!Bs=Yrh>8>I:1[8)=Vj?Z^m 4hfiDCH2B?=B(3L1A'r>YKG-/#bgK(_mCtlDS]l;aBRERjTVRXPf)ZpY(FksNhcJ(uHsbL]s*>XfE85CFA"F-_@/*J7L#LZb+bnu9IO0m2R(ar,in2g:NT8Z:YW%Cc Yf\%uR5R^%j]P>]P\%kEfHhMj;"/LfKALI8B)0_tS`e\WJY)'cre6m)A%As4$YFAI*#\TjT ;QEBStm>D"5m9gO?g7^Y%r@O_6<3/p;sQ)KGZ7DOPkC`7=cCqhm[JBJQPJF40J%aD]@R+^@ +/_q7pq(%gg)Ag_UR>nN9#N`>.I43*MM3B-k]@I'59Jo3Aabbk&L)4j`gA+$\3G>rP@(oj( ?re90SS?e4okT1E,uTeTqC!klp(h04R@(_7DCLfRan6$J=LGlCL,jn[b7U#u28J#2H,T"h2 iq'IgA,@gN3^ho6%&WT>7h_3=II32hHpAI4*g%^!QO6QK>hj# (?(oSMEsLIi*jWV`sgmanZ"R(i;Fau2@Mm9MBIW2jY)^C]YXaD?:1rb)SsWf%2_qLThHtjd 'acXaCPb8k?Y7]n&P(ul1C&7Sa1#SC>\@pEc.OhNbE(u$%jKQN5Oei!g88i4rNI7FnF*Co o/+ClZX)^CGj(.$q6L!rJ&j+'T(_+#WeJ;Fk)AkP^P0.(5jS!298:eB>--fi@(&OK_c#f6^ 58AqWqP.Zas)-neiJJ]VBFI#R_="_U2\sK4c4,OUu,_a%YJZqIO9R2m*k$6#rPNm\8!880@pUr WuHT_'.U.:"Mjj-Y'$1r_M1=SImkhEfVI$VkEt4/^TnTH[g'L?IA]9u9G6N2c2BdbRWh[5t 0aqP@/+V+qui`->6r[8uSS?)uM)YZ;[\ZH)J6)M7<65W[EqX(2@8eZQC4g>N!cOL5K(JPOg cnQlF0U^ZPi@FtqjYcJjrYa-?J=IT\-eNi14!b/Ff)^T%G9$^ZkN\Xan`FeJeSW%'O5_mam )+$[j[*/0lYT$SWD.TZR_$,Co<]b-T"5gQOQEmr)E3:E;)Zc`X%P\A3j E!]!f/DhKEQl\J#`&r-:d0PeUNY@fghOd>YqaNsW r%<7@mZ=O2!ib2YX+jN119pEfB`'90Z_`+mVi%Au7'>pbg%l4u4baG(Xk*TWhU'+9:d5s-\GZENngd@K_Wc\RpGml1'<78,gK)7,T+`U+.`jW nCgD>*N/`Kf!\@WX]l3a"1)amHprSNi?Mi?Tt,mC+hi7+*GdV]`8pdYdge=r:-b#QC,J>F, MI1"5PKKD\cq9f+i8TG7faLNZA7)FadN_RpDa8!arj-OcW)PPCL-T1$kgR9FN@Q+M;/Ebgg TQD6/d/"qQ+%mCnjEum6H=on8h'kr)EB4SFg7kc[=;MFI&S!@n>O1*hY]\71f@AgW*s:,hp 7Bf9Cpni\g&&9^T&d:L8:hBTE&@e,>AEPTHgfeb^b>"`N,@a2\%Wg"G[D2(R2*]NG6c36p0 9IX.,ke([clN?M<qtJtAi*ZM6n@e%n'-OIai;=nl^1YR`h_40jhk>Zd33^;0`'j^3C*UPa/Gn(tn)D*uq#;# \G[S%!M(m]D6^ZgFJ^*b;r,n(*kO\]1fDG^/Op$.414[5h(c^$.,C[+V55o0Fr^O&M 7K#9jJ-DAIHkrQGPW4c#X;T`sfgY&o!/hc0#OfXr!e/*$P$-TjAUF[fMTZ%C#@'apKYn^?? _$),6^V:b`Mjnd3-')6LX-d2(KA)\GpegI^Jh&LKAdarY:6!i'KO@IP@8ob5^D'G0u,+_2I a\DKZFhiUg2@5\g.T&=JniQ`;!;.CB(B,8m*5XYn;0m;Q60u"\q8.Zr)(f@OW1"RG.gE"]!* T`4sn-K(iT,s-`*mU>piF!$'WiniZ)1aaR%`[ifaWT">+VG)):;.abWY\Ok+qc(j:>5+i@j 9>O,67odi8P-IrpQ"7,LSpJ-/A!.(B'Cl,goT[nl3*e*@9#V-0AGO_"8$'1@l[/&Kp9V+T` #>::osn-dmA[@.XXV?G-u3CS?,k@:TrM*;=71.IV@qc[tq4X"':8pl_q&!Ep+D.f(p7qJW2 ];Sao)_^p`j"efZD5Yu]&#>a/%Afr%D,RmQ;rf[F<'*eI[NY0'5 Y+WZS&aM03OrC$=%C(Ts62D5qFrE)"'LK+J%&D%/,otA>1^UtA&4$E)9/Mi."A!ion5BJ=> ;_5+"d!"J/F`oW1=+q-&<-f(+^51MHNu?V#Di*m;hl9tLdhY"RfTN*!H?N7TfLJl3XJ"XOK 9%5ZO;u#$hLV3'=BoR)V0mf%.MG&%<)m;>SbdBTKtKY/>gRa`#g\o&qP'@o?e7.kqb-\-Xf aeTs#J2ckCC$1bfA'5fa\VYn?U=&X3k?'Gd4daQDH)*$N!O_U'1Z^n:5g54gWpe2AX^^`>` #/PYr5EE!m>=V]3g(D1FO0lKK[>=FEF(K#NK:*iA\7Mu4g(kMK"d?,;48/K+a37NR?["fQA M]+nD*l7Y=AWfCMcJ2:;8eK64e>#WXUe.9:*s@'bFLOo-]1^Yf9L66-!>.&.b9&MZ9_?P*6 &H<5@3S?4)1?i%Ajr%SQ$4dO`_&s+!#r#9c?5;=H!MU>0\P6)m9dKi]!OL?"1-K"g_iO0O$HC&S&XH&4&`Dd!'#>FU,:18 5tR["ABhEiZD#g)hAnA!G+;JT*e.Y3ahdrJJC7fZY.j9BG7tCF2'hl5$)05uuH#2V16\fJ0b5ggLO-+c. %8^>2)2h6sS,P(#_[n@71jge.Z8*&A_Dp[T.I9;g$YmFfcrV_.@L7QretM*#Bbf#D% IB^pFr0H47W='k!S;G^!E#abSMnr1UJ1@*lA+Q4^oV?.b?I30\mnS.u%!H8hI',q'hNiZ&$ F(878s2YPePeMEEDI#`nsF9>s;+,nbqN>G[cqHU5;-H8VR[fNK-^V\dg[ +Trf/!Y8_H%%rZ1>).Pa+b#\0W>G$&2tFGepJ]]BWVW@!6)Y3bFrA*D"lYs]^h\MR)lqU/< ^E/b+DZR@aLt7!^">9G=>9K:7BP30Xr'ED;Rcd1>HZUYY4u/'(fCO2H50hP(h%Rr=DA9!#T +^q$Q+H"=F7;tIts_@&n#;ji?f$]2mQiOM46;XHSu&DQkU[*Ug$1,U&6"+p+5e_Po65SFs4;]caL&]br]@3B910M.mhrPRu/Tr5?%@5!@AYWdC'h1$R&CdH&%bFh8.kbSDuW'nKo/a?[.-q6ehR*4?(/EC )e!m/=-[3iMCNs\XYcXS/bIt>ZO'TA.QL%(1?hJmKsXO\esgK[)Ho6FL[ar2MI4=6ZTST%i%b8dk3>%eo7YSEWrMHn'C&a1)i]cY3a$@5 du>$]C!@EjLH+$nsG*4O4HiI'@%cPP-X0'EjT!#o=o$2TKV4Tr/RO/ZCqWLX^%3h:c3V14$ >#Jm8G^ht#tc3.R;%0/WA*Au:hS.:'^X1H-s3#3Asp'&%Mp0]-\5o##Ug""n_K0&+rrFN,m hA-,CE]Wru?$EJ":P=7#)50G*iHc01Fk 8u=PNlbqH@f`qL5f^32jkR0B)*p(,3^__n`5nX^(uYl]6,R9H3[]0c4e1fjC<@Xr&!p_HN4 @?Fh?Vt0Bt$0L[s6O8@.kD+K=Dca\:"!S@EA_cP@U/JO;s%sgRF;@ZjdtX]"sls+OCbu[Md i3Oqr&#HcNe2cb3Xl]q/`IG'gpWj6#+TBX>hsQ33Ber_1nA*ZaXcS,_\]S/SYkb2FN]S.4B Sr%C=j(1FhkSu9F(W1F"g)&/^cNbB)7VA],bDYE\c^4kp5JT'V`+0gJ8@>5^e#SOsl`LKrI *ol[G3Q9c^`^+8Ji>i3f`H_ k/p(kFpE?\V6:n'>@%\=OsLJI<\fh@!TqW4`E)4UoeE&ZL8`d/=i^*?#jSbQji7%)?6g5gB Kq2uMJfr;ASWiKt)t>L[u6rSVW3@/^9:cRD+2.?^7PqUa:82qEQ\X@WP&:e2QA&I4"UTobX X/fbO[7,dZ Bj2pbso*KTNdY@'A4!Q9-s]d:K] cnl)[FWXQ8Jdm'1S+1#cpn_9kg=Pi%u/#3nQ=RA58fR'A9+)#[QT_9)RS)X$ WJI8#asP[2Q`%[pcAkC\E&ZH^0Wkh/;tVh:gDLh+=aegcdA)NQL7%q#&uM4.4FZEu3(k'Ck qthfemfhY2N9iUM0jSmOFKdHTK%[n"ulPMPa&r-k8&\'+=7r#LtQA!no]oNi3ka]0'EO^)*-7IcUJ)FcHT X?[Aq;$]HXEU7rm82:='+3:_WdR"LU=TDJ76j[-H8eQNH.S=`gV(>6Ebc`FX"Y$p9r:%OV*3_hK4k"(dc!:3N#@lZ)Pch%YI5u9t+ChAg+!G"T\7*QZ@dF p@;]`tm_d]M4GA?PD;/+/UNBc8cj%OCWVp*^?%s&H61,3G)Q_jnY3PRV!GGB:J%o`a8!n=8%-:BJ/i?I%PW&O *g+MVNmrkH?PdVBpqmo@i?Y%S5U"g0hafpAWFC+le;WaZ#%#^ca%C,2Uf*OHZmrLD7bhc\S f$VbWc_/R.a%9K=Mh'N^PmN2@r=Hf>DSJ582%VHuRS*QNL)C>4R'E.Eccpa#D35][o` 7#4*7g$9fr#27p"14]iSLjFo@Y:g3+,Aid.5C(O+_[^%))4SEDMKSTq]kO5bF+2j^]&s0qEC^A#D3Hp8FfnpJ22ch)Wn+qMU\+BTK Ah]YXUC^%La92l?d&.>Kp&pTC'a%iS%tS[h#=0a]"Q6X%K+Loi6$P1h2L7Q8D(@eJi!lDiKmr2N<7D&k9*:#LV Bja,'C1A)r-#@/+I@:i`3p5faB7IRH`+'-cLZNKOo08IViY$ANeN#6R(N8XVLaUu\/3dY:N >3C,(uKUWe;#Ra7m="8pfKEA,0"U^q=![XYNQEo@Q9::&X-1ng9o(HH'H&+m9.2J<"-=ff\ O#(BEZkFR`Um!g;;C8KoRaYkb9sRAG7.($(u01e-*E\$3rhp,mU*^KNj9E>]>=/i@i1b(n";K7;/M61A#%6))30@#* ?5$:[X?0W_!/(/L*,,TQcu=^*X$9d:t6rV$XDQ1l"'Z*g"+,;n-#@(c=Nd2#qY=_u,0aH5! 7--DXVPO&JkA'gh,<&lguhL%YHS^ J=!cqCm@BekG.$2?3tW#R`n4u*UkQ(ActDq h9#n:oG5K@;o/_]HY?$kGVHOT\VEn'?)BFAF,KH?(8@GDY;brpNH$\L/Q1NV<R?EqWTV".WrNN6+Z_2($Qc QSdiPe7aS]Y6sb)((A#=&Rd;9KN[:IB:SdhoCdLW)>?DZiSHJI(15H--Uf]@@gqZ[6*0oM8 SJ&OUg_X2%tVr?L*20bU7S"+g4h.n/O:!.e6J"pVDi7gjf=)/Z;*M`geO?2<5L1 "aO_a#H/nk3BW3?tdSON@r^P\5bs9=&1FcBOe\Ar!$j.g>^#!lEGRJGFc*Aes9k4,7`l.;L `:ABN]^VfZgicauVbPQJ1dGti_O3d8%(Rj-cbK)qVnK(ag6@WWf4Jmp>9!&bZk)TVXP b/]`cNksh+/c`R'@tejb^58S`p!gQH+/Mq/SPq">:$N``W?@Y'<@YaalP3P3LJ[YElO@7g' n3@;4X[),35Z;:;Rpt^hqKZ=:Tg)V*FjQ_N`4)I:UUnPfP^>SKH"!tC/IV0&JcUmSY,EfHc 9/1(ZKgTO7CAmdFunqCAbK6kdC6j 0BjC_"8GZKG_Oi)8W*eL@AaWCR7&FQpK4C_;l]SfJ<_ncCb^b#,"eElTrBd5sf'G_JCO8F= >"Y4U084K:AAKoGYTr/Y>[*].>VBX=u^m0f4E&"9:Rha>*fY;F=qk_fJ_nJg@`c=i7":6`X ?WZol7E4cBJH[DQ5RW%nD3B7hlT#"US%"(O_t@`2bb6u#3o8.c&>3ruBp`3X-q_e+W_5(Pt *KFeKEE(#4\EQ'/A74WCI6Ub@\ 2?h/rJWkHbfMhnp@0O_*\9it.ZtG8h?NitH\DrN;_i;[[CW=kAW%_]aL`a/XPdrnra"YO5l`sHX[ls&aC u7h]<8aZYK33;Wt?>h,VYA=CP3Nn4*6OqCljgt\A4o'^q>jEC;-bF^q8pH8TVS`Qr+Ph7D' k_'][9ICn/.kSOpbjan21;S'9"gbXs,&asga%-ru%Zi@UMPXh()-J7]#HHbRtqb-\0@]@Ie GIPS],"o*."9X)SDpOfDJLBHO/6fUgR0f0F'GSAY]U0*kKd]4Ns%+,e1o :.N6dabU$-TO(dJ;`1kL*5_i-P#o27rG4[Zmacm8e3jTHe259p5CK.%]D?o*?j7Ds<;c.()[fff1KNHQc=OEjQKpYO74Btb5?.%G4 ME#/N!%C]!#_o!M!uRd:YYG4L?Nks.L*3S;P\AL0BIC;t"b8*mjXeF-/]RH9;U^U/J4K[]@ >&S6a#nB@75KmYAd&GccFiF@K^"8jGD>(L.;G3_H_#WrI8JGsP"i&Vc(QmS\NU]!QcX'244# bdW+H,[8d6D!"L(9cm9Icp?-3%O)#:'KeQS%9ZC0LJCk1L"`QUDm)_r'Kih?Kg, /.pNMK`;e:tJ?K=)lVK_*o^nlhT_g7j@V\3sL0XhrT_:UNpNrNOVCZB@I2>.@iedZ#_^ \7(*$0@KgUde2MGmGQFhKn3oV6C:J7aA#-'L^cbZ!9LuSj],Zc6">L$e5Q u"$?o3uYkqC^aPKf>W"%Z)iF]RFc;Z'k: 8jA)Usm/T=fDP*a=408B)If?J[$`Z*m`iXW28Z4K9Tj_i6^p0o1t!mjo$STA7?FB:XQ^*T3 #\X%u+Fb`]_NU^rk3+@W^*T>7j@e/GYfOTW5;h]XO9O9MW*6$Pa2?YF5"6hr#ABJ"g0[.Ll 9\]Q#m>KWJ4lb*WfZ_af23-`4O3LAL"gCN$Li6[-7G1]GA7e=F;;<2C.j!o%hVKYk`L>l5. -0?W#Jbcnk"92#;<9-&WRuudod`N/+7?"M.g#MhE%2I Ng*Y?N%Jju'DU3Z8573eK;t>Ae(1os`\AC"oe*>I.Ien43XhCBQ=?##I4//](a&EEjQ)k:d FBU.[ntB80MO!MESK0FWY[7"CiNd;F;9V&%kBb\-'dgpgF=TFG0YdG5RhVSHYoqJ[et?(c- qLKJ2CJ7o-H5[D*]h6ku@fJ/)q8caq/?5;C3p5nM=\-9*-JOST!QBVQW7f_B.hNjLeLh)1+ )[tZN?HuU9]H%4/@Y>?]8#hrBiGW'u@:Z.'?WJ?-?2%]dV;I$)e7f:t[7P+q&d-3<"jK]tp &5P?9kHfiKg7p-%Kk5s";8CGA:CkK8<2S@uq]jX+=]Q P"JDA?t'^m5^GQF(snf^(XI=pA[!@f@urL<&YBB*Y)VhWgYap7uNU,*-t-"d!V2?702od-W !@ACf5$J5$60B4_a(9BIkoL[fLCK9BS6@/#&$/NY8;bmDs%UOk9h5=[iBqqA- "As2I]LY^gMfa'SV')J@?_Q[K:u&Hu`hGnoJd5ouuumIe&kaLrbS>0.c<7/[rN"K[:OEl[S Cj$&7YFKA_!/pgj^"IcQlGLY.$1Y[[k32/'DQBY0"Qi%hMr)sJ-!oCkH@"lKQO8:^u0F>`* 4pdY?;QZQ\qW9TGC%\30Ws#GUR#8gm@jZBGmV+PLWE/jJ=%JA3lV.t1N?^F\^WV'C' K@Tp8a&oqPY&M!D"s?3bT!Q]+cmZ3S"LQq4nP]!%PDRMk!][_\l6f_$Mq6s^V`pXpe?NuGAo_A(`=EKigTqQEM0k\1491QBiEL@A=K#6ju@1&E=%HS79n^SlKV E:BJ-E3EIBI/(T54bga,JhIXRjgO[a&c:^+Hh9B&O>r!17"W`$J]AXU7i664)KEc;r--0YB Ol`l&_pb3Kt'GLmj*;4,>gT8H5Ns9LIQ!5jE(>GV6g7>*r^[?M-q=;N7d5HH\QbBr\*Wt-rJ/ I@H1CE=-hi`7m0o4>&3?O7%A'ue/N_Lga3"d_X!SKZc1SpMG)4\i` 2k*QSXOA@fNa,&Ub@nkk%Z<`M;J?h4&iE-u7\8l[.ZI3*= m]7*AYf$B:EtnB"HC^mFLtjt(V@BSomXV^n5pYW!rB99[U3snli.udaCKCGAkH(er^SXH&s(Q*WG\N(Y4:G8 9`k]8dirgu][e0lbK`2+D+\_ccKr*CHmK?`HJq0a=!=1?ZIp3]$\*r5bp_>A[Fs.AKCr;Ak kliR4&:b2NbSk"]u"i6::*='*Po,L_s`l!8_6OiB>$c?r-3=iSEH"pn$,tVW)PU.;H'h'i^ >o(ElA7ZRsEK!pU&`mu_65K+EDDi'&_"s=WjI'L%aRV%a8JWQ8+B]4P&F;h%"*k/Y%:g'!/ B`(`\M).T%(e7<'-tOPbnE4i1JO',gGR7)N8ZK]"i/V^QF"6q4ASoBq*32I%/iIg'HHa1Pm 28(P#7HL*0ekCD';L!<37B\R*Tt9-"$h!G=]`D(NEo[f'qK 2Ff+k-)>M"#A!'hC@$mej)Q7\)+fbR;IA_EAdSS-XlNMU@CL\^"QRKf1!1L!oA[r0t:rP`\ [QOV,Xgt,9JFkl_.eTY;cIH>_1Q\FgPh5:jZ:,5>5aCuS>0\_-9GSUU6hSS&hsI @fX?k(TGkH4Ge+*@)3qD2eU2YV?DEI\WiV>-=j*l?^aXX_S.B*&ei?R-1^?HPX`0m+Y:Y[I "oFe[FlbIc\%VRuZgB)oR!PBokYQRQZD;rr^&U>V?E!)+/(0A.8P=)96a0IjN2,S;/]3/1XGUR(u>^ej9Q`-&>5_)6\=-$>!rFg;&0:X?)M>hpDq"kgNT47HenGQ%tW\j"^rY ^pteN%jS>BSS`P/=DklLl?E^?oqL6bmm<]mG>"OA.:`DG'K3oqE?0[&>E?Vi4]N?S)WHQ^$dd-#@!iH9&5ENt=HX[i(4"63 keXFGl7-A!S%Z(;i7Q)A+YU`e` On81Bfo=R@-[WJhq>>jFo/WuoW[FqZ*&3JcXh+_3]iOV0988D+Y$jCF@7dRHi#3@uMP`/"m (r*]g!oIjbITTer$;G&rD.&B>.PqnjmLS8Z7_oSjD'$=>"3Gg?Z`3bk/hH^S!!$bZ/7[Qma 5n6`t5fdpWR8YGE&Lj5=#dU"";bh$>OUs"^fP)!$31LYm]/Rio4X]=oV%e4"3G1WK&L+ls: =@`UMeqjR;oX,Z$10k<\QUThaMO<#%6pcorLd*e^'Bcg,R#$o%RX'0MJ2LcbWsuP#^2)&3\ 6&b`>,.)?B%h2<':Jrq2Wkn5Y(*28a.tW%)TYnT0qd7c]p5]eB4.W3c.Ol=JQgLqOT4kI&f ]Gi#@nEU)ZJa4pTm`WDmc4;:d'\(kW\.%\B`E4_JU85I<=td99aFXbUli*qipk>2*=um=hgR+qR#!i7\q"h>(h&l)nCEUt;(-f;#t:ML" Ha0;B\7s4`R'SHnP1TK>q)W0]M'3;La?;!KlAmBU!sI/EXa`i[1$19(W0'hC7E>Gon(AmPb O?,>"Kj4,aX\"B3fHU_,\l%+4?`5E8)"BJ 4,S[Z'2c'fD8E`hld9#gpS-1c_,'XbP6u1@LQEK&C<"`&8'r'R!fLT&Ze_Mq(Z>\>n%.-;n5CGj]+O2Eh6HL L-XK5e;fdZDJQ@3TQM$FJt(4aIF!3C2<\(uq !(H/DonrJ.ZO?I%28dJKlLs1.kFmnrtcHZ)Fc0 Lc(o?4_mR&RZBq:ftdm>f^kla,HP1Y\;.?D$Frt#,e74JMIAp[*&le#S;[pn;)L$MA+p4)Z `P?O.mWQN"dH+*WaPi+mpDfda$)#K#f&O6#I(T%a_<_$h2+D0Za_7bm\8l(#^29/Jun)gC9 j2&\q;n%4os^l35"g'0q$@O*qPCq%&&A*Po&Y&IB#FU*!h?O)AkJDJU;PE7dm8f?k`SE?u6 s*nZI6fl8e]D3U8-q@=`eg/18lNMdJmXSbl0BH^7b+[4[5^6u62+UuH^nS#3WY+$lKh2ufL ,('cl*#B(O(bP%jD=6:)?4DH$&<7=[OdP(sRi-4:)Cb79:*COY)]I!C&h4<`$5DN?]]1V&) I^&gOUNt\]H'@#jmgjcn^d"\fcB?)'&e!P#iq##<6_Z_&[$*cOnKcFp_NtN#sguCOpL8,$K uL>+MaE[Tp52Q;'Fuj*^T@m;9E#FL-gPF*O7OD&iMX_U)ALV'gZU$;Fp/7`^N0]'TUBOJBS [X<"'p$(#ZM5!H&7\(`.4/(LXgI:?s:1k3en`&#"SJ0(SJZN:8T_n8aX?Eg3aN*_t#qnIHE c;Q(6pC*dX+(9]GCEj[F$.4`Ra)aVUfOt*l5^`Gf#+k"m51>*iagF[2'&cnL?;Tg\um4Ru" 0.J"aiT;-,rqH!b&(:V6o)t"\Xr$$_1BI;)O/"G5SMAHa1%Q\H1FO5/F:lso1G\=o:V/Ef; `!r@1c%7,@E]74k5@sNrJUILcf6me"Ms'"&g4XnNA(OpTFq6b)Z_&hlk[AZjr>_d)ke;^-M RlY)`[=/3=m>8E&.Rb2*'-Y`/I_5T]Q=F902Q64"OnR+;bhZ&cg9_"u'CH1W[Y!FZf/74YU k=F3t5C$Ol/7@<;oDE"[\ 2%2:)sZmQ:S.73YXd"-'I+Bo;hT1%Y9]S?u-`iD@EiX7Pb9=BZ@Sk nM=-a7kkPsnbYhTr=SQO&s4D0FG38b%20=88MN(o8Q659ob9,P'QHc<;,9#i4;bm;&ohCs' Y+t;>o%Iq9I1Ge$OdO(5T5c.h4f'$JLDBJHl"MjhXoi'@Ykr;bRm,])AMi^o_BD)qbLqj)N h4"EO/K9p^oekif5T0mPPt!*Drt!+*,ICTkG=bgEX*\,F(,,eMoo>C)Ok!e]@7)[!p/fK;C,$;K5o]D^StA-dLs(ouIsMbpZJZ.5fX)Q.K;!f^KCZ.WV:j Fl`(#rY4=Z/!S"((&;3ZrEhu/(P/5=Fa@U"nfNGY/f#0Rp)-pI)^3&f@295[Ft$n//L$n<) o6G^;[[*$4[t_t@j,kPZk*kV+_:0lAJ6M(<`icrp)`2S@eO?FF#c&kX_-.(1feZR_9NSLoG ^'<#d[BAB"DdHiAL=hD5!=/^jecamYTn]&V+%&!>G^RO:VCm)*ms$':!@>PABcU`"Sb'[`N >u4;bl^"/0B=?m.T?Bl3S!'qka25uJ9p#s5p14L<"FG4c&smh' (82cOG+E?`O:hP()F80JG!BKF6$MGE)^0eD4'UO-N3 I8e3B@NVIFJF2l\.quDB6J5563g/*]mS4<,.7LB;/Vjp\D>cp-Xb(0JWih#ktY*4Id,#m^q ^N?3D^On:\Y)hfEk@h"]3_U)ZpHeC(_"V)1hH&;1YAZ!BhX#oJ)@sjOK$ZW?\R$>V?!,#nf)$4Cf\A))F9j;`"k4m!BF=`WER,O$NV2N\>`]"X]sGYM\X'5=Lh\>mjPU$?.d,%\B0[bO'XT@?C92JV$B\F ]mY&'?b#'TGiU.o1)AihLP;N:TqE9h(LbttO8/s6j9-Eqi#VUcOZ=/=Go0]cXr%0-GI]#E) (0XOJfb$X$=el5iS#80>@htVPW;$oGs5`sef"R%Oh"G&N?"Wn>Hr3^S+T<: \V,hS90WGf$i)X&.i8^(]_m6'd9fN#Tk5_AhhFIki[b+*Jcd#K>UJ`iOa^#q"CI'VqX(.nN\ 'r@C,`9ZoDMXi1Ymn#EU6C&H`uM8C0[h<#FT#Z25g3fSPF:O@C(P=nSOnFfS^@V2IEdMYi$ a)hhL`[p6GT>[`13156?B_2NW`\iZUsFk;Tie[kP/?@_uT]!o;]l]+'CX(_16KnpUTclCe9 ]f?D4HVmi&PY.hbkAr5c(V]`T_4P[7DRSJ_#+pY@879TQ 61J>_Bk&(\RE@cA]!/t1TTdMTW=D8=(p98`%t^=JKt[#=r+?"e`NUE@e]Em)!8k\eX/q*[/689\f6!?lf@()TX%R+IAlB43uV Fci"#7+^>W;.AXWgdG5-2@>GN2=f%gb'qhhH]D'(dE$$7g*F'o>AZD^JH\E21W#CH@HA0kX VN[I2HQ?(N5l_E=D5l.%ef(=$$eu>r\Z5DM9=hOCi^\Ej0250n%)FD25eI]FFffu?XWF[X2TAHR"1Uk8p\AKY 9ZsHT!oPZ9*D%Zl;Nm:3m6j;22^;]g75i6kd;.m,VI*h*a"2c9[`3*kB+9]>6\H*auu* *guAi0>a54m6!2l?"l+R_@Btm_q'`)es"$All':R$4SY'6&6*q8f-Fl!rQ^#HsuN7C%2-3R TZR"TMqJ:jM!1$4JXd F)RHe'.q^joK6#[8,1[O#7<44%#rTVf\#H41br>eRpqMhI;=8fr=WLBIYI:Cp0J*h%2'k%. Wh/WIh$m5i[.nq:pE'[n$BLFHf%>;XXNWasQ^3/&K/NL DIsG+EHX4("W5`c'SA,";iF,d=>#bJTWUa#6EqA5a0GPj+@pMeM]g+3,`sYSXp0Ekl*N-I8>?Z3HX(to4`NsD cG3->S>PA<=EB'j.TM1ec^s-t,=&%:j?+5O@H!U08j*G&+[I\_%GK'B+?ap:>JR@%V"+?ag ;54Jja6E;6PiHbh;[p7&.>d&o`\3<\f]FuMj*:8bOCWV899Ec<-;Tn<3G)-TAU/_ODO'80r oIC1`cI\`H/g#iOec.064d<9M4s.E7ZXBZg1HPGl$@NJW+pX-X/TjfVQ[+;3p*Y4*.uVpC^ `W?a0P'$2UerO"E<.8&n@Nj\F(<%lah!2T(BR4>JZIm#)4iL'prMs6=5g^Y7JSA**4*!EVs /ga)YF?-d-PC6%D6&jtQiK)'e?MAe/=DPW"2l5gU&74^V4?Fo?Mof(ONIC"[[,5gg10UR3Z 8&--?mi:n?0MrK!\+-Y`1-#!VfPpAU$k^$QrVsAZCM,Zln`DIBRHbTNnn9f^%bOGH0-dhO6 564kX!^Cnfp\mCTkPK^8a6W[&s4@/I5POmP?h=DKikS0;iG']jA-mg+.L&05*<]bd'7pcn# shZJ"lRlD(?/j@%1u&G=V,Kl@m!kS_Mc"XM7JO>/@e=(F69#L7E>f 4[5V;LCp#5ToM$FQ#!8)Y\+73Cbl1gWY`L99o?a!,mAg#&ZG4IUsu)G//jYg08o:DJcWj(LoFJfDua_s,J\ A+g_#-W90[)AG%T\!+Ytg4&&MFM$=S<+3Wo/%)Zc$E2Q"fV>@VPh%IXs>>Ys;[R,J[/b\W* n^+][<)KP7E)e3,ljtXS2a#NDmN"GUb"s@gd,9/QAf5U-J;msf9,S,iAdK`46HNF^2.m/cn o!60S'g`lB4a3lmEs?+d!#>2k][6M]u-sE/B,;goF7cM:"pDC#)(QobO.KRYOf+4\ZQCLl hdZO&nd[?Pp2(?l23e'F^*R%L/<0%(EP8?JU19p(k@`A$B_4/Wm>^;3W-m(8G^BMKNH?Ng) ;J;=.Yo[J&2&gQH#Db'@JK2\tB-P1Oa\0_?r/2X?`WZ=<7TG;:LG'Af*UD$Vj.2`K7@hii8 4MWqlnPkbt:UgA2hWS'@bn;\dCkD)in+[3E&%jlAeSr0bf+iNaXTtGQ'EW.u>3;4TWKeTbI 8ghbpXVdSn"TOIFsKMdc4QepB*^e,1I JsQ)1d`=$u5Pj/4Y>srYECrIgP*c.T/lqHH1:!+>.[YqI0Z OT.P48OSd"CrhlF4-ZdjBZ@DIQ#[2_?1A.AY"4>)+npR^j2G$fafHROmlUEeN@J!';N=3LD sb^>IKe$$KO_>8Khl@"/a*QGV'%Vj@=O&=eb^D6kJQk/`dDp.tV;_8uA!).dtiVZG7%)Wod HN.@BrVtLCs,C\X"8H^83$kg1ZSC]m9[L1i`$_9`3e*l+ft5eA+'Zja4d? N]d&L$1[MA.V$<4of8("/@"A?k&[M-F-i'*FN<.GR]@O5_*W$_7M;)e/]SY5_*?"1D/t?"< ei81G_Z^69HJZ8-C`T3]"]$6@:.IN$a(2=p2n]ZlCVR'J2-e/g.*("TTtgW,i.c:Tu6g^Q? Nln9tVpEWl_95WED0Qn($e<(!]b_n8#t`&g?14s@.7KSUDON'T=j=[X_oKm6,gW+^m`0YXV Y5/]t*auPi'BgY9]7(I'.,""DdWN&$o[d.e=bYU_J;+2s.[ek'R1fVFuEhul)2bS?`Mg.1. =uVZC^Zha'3'm`mJ&U`&`UeTc)qUu3F!j>-Lu:%dE0:CjM7AJ$7XSi6?%#m=sB89<*7)AS/>LJ49?t3 2VFjgb][P3?/($tQdRp%1"G55gI'#PRY!%`Hb1s0P]R).KO%o%Qu@]>8B^?j9Dh@T"MY$mF9^B#QC)WF^dZ"BoLs)@9RHEUN5nVSNsFlr` 2pVqb=OpnrPcFq9^L+p`6h#`FG(c%L?LMsUC][H'Ym?UL@@]c=DT_ 93+O;/3"].Vf4'VI'o]b b:ilkk9hf[DZ"RPKO<6jV4]&6f:qSs6L$&6l\Q^,nM:<=TnL5"mAp:jMB5K_,4t> L:CTC[*;INMG/V18LK]ta"FejbP16P+KqN%4kfkrBk/]ASeGU Ae0K6-SLrcZSeLaa#3:R'S(b1"#!B+k9X!&Q Yh)luXfuu(R!hu6S^ig6eV/BNI=4aoID,u)#Cq#"V1D_hJljM\L<*eUjVCN!L0.`:;/pn*8 9,K5HO!Ab9SCO?c&>c[b#n%j(moLOY[1EhOsCI]9cYY89pAdd.9UAb#7rnJ*!2UH#;Io("- @>P=>5J[5Cr1V"5MYb"eU@Ii*%\hg-"=t7,gs0&Pc?'>(#?r-t%\+$&0Q\JBb+pi)kX$#>X pZgALAC#eGOSo33d:gH>)!h"BE,,p-t!gO/d#K_eJh=Tl5H:ZVK/bl'ldAHb=MLQHN\Rn-D LGD7MKfr;Ugn4Ee5>_J1Td)?ILNQ>@q%:#PB,+oNF*>)Q4&:fjEK]!GrQr&?.d/cdKKn(US I>6C.eect]LA5$,/_Nhg]PW%LD%M+pWKj\Fmc$hh6I@+U!OIKj;i(=H@'$3RK8R.R6:e]FL0if%WefZ[MQt(`dS5s33iVjp .%;*79B@`<@i]/Xo0L&U?D-$'OidG]RJN;<[EE<6a"d"20^sr^C?m7 Tf>B#1ulWNPXZ#8f"7eflcK=c:hd)Pq\kO"2Hh>A-E3YYOBMe&'\gU?k;,;UkYqU+FpAjnfI2%MctD-';1k6O"ILmu[XDD`IU&1 f_omQ1Xj(,=JVAVJJGmp[:!nZV:]X+"Kr?\9#)Qjd3sW9@YWb\Cb2_.[11biL0 /;J`-Y.Mc)LsTB`>XSW$m?JBAi1eeQ0HO%M.M.2e.DFLCeahG)ZoR"SYCfsqsK=#GQ_X;;#mW>gh!+Q3AK5O0EDSGI$5^EZKChTD*me6-I E,UJ58!_5@#2!AFDFNW0p2=:3A4V$%0Pg+%q@'f*jR2qVf)4d0rYcW$#7td[\3,NQ\-D.eK 1K\Z#UEu0T^Zk(9sA+0p_.5XUi<28g/JSors`Pt?9niu"=l.[7VdZJ!ej`D6p[ni3*V(Z)$Za=mf&)bLH/n:qX^\)LQHm h^:`:@h(`u^lM"P!#@*2NA;6199;$6Z@!QO"" RBu8WN\tuaCg7CEn"pkB=,,#8G.tb8_PdOOI&a,]t&Q?d27g^$_p%lnp%RP-p NLIGA^_1m`bom-!!q=aRYq2tsW=bITXF11u7f;3ESV=]41TkJWTLi%l3BET.qE.1o.GHC:B blH&tHN+?L$Qis2?Y/A,KucK/:fVM%(c)]1J2Up":1`R=j98pX!*?W+caFn@&d;TYn[BQZh na<^.><,*^#Pt@iN.FbqW2PE<9Z C=XFg[]2cY#fDhq4m?Rs$!SjQj]RCZ[e:8A_umbbOu/AK>6Aa=D T<+'oBq>1"a-f&@ScQ+5#p"[UUtYc=Z\$XTiu:T@%@pRXG5HOMcQM2;8"`\c&j\^)rA*A)W U'GGs-=<0GA>_;XmnS:3CC^lMSVbir/:SLi%MFZOqWa'Y]R8hpc&e`g3R]CC//IU>U;e`QR OID3I?a5QXarI/*lVr.1Cop8KDnA[X/&.AdE5`e);"Mh6H&I"-2nU`X5n<&,+6I;5W$H"R1 2%INcr&52)d1ekY`6g,5&k#)a*aB.BfkVDD0na*V`f[oH*6-CUE?3*Im"$2nUWGu7\IL0Q, KW\[QR'\9I%;\-ZCIU<8lDaq/'Cht\L8Oiil9Wp;]Nn7bfN^oDOX?V7lJVUHVlasdu)+N$'I3CnK`gLj()J-_/9@G`:2,;VbrARR%eJ1 AIeC?-J;H6^[=&d_8I9ft*[@L`++,@u"73(GM7Vn=,D1,enp'ljef[^e"@bEY&Q"J^8I@"X #es2qCg=EC2C0O`P[pu%#RFb!b_r^(`ij4i&EmfF:^gm\ikt+a[@u5%3`mb=?%W0KbI%TO*K7fC,@r!s+MnCn O##aLoU(WCBaIiZW#]Up@iEa5e&bO\uJ3R%'5TeI,qUsN8loXuVHeFahh:Y,2EBm*G]L(SG ZR"abJAf.;bn9^_82h8''a5Q`4'I5-C8WJ6qQfWLaJ">g!^7V&YRq.o9>S9>H[I/Bjn%nJj ?MDS2r4a>uo_fk=ch@P"TP,>r>!17$4A"B$3cfj" Y_h>^uupEi04r[,;`R-[;,usPT3_cFq?t77&\.^l5D;['LJ0e$K4PF*olb$QRHDR@>K(?,? Qs^iM-lkgcC4PrZ=NFHP#0>7#4\U,XcmB&Y`eu%KZK9#4V7<@['iLEE4VZGdS9\jB7DGCd\ MjAgbL;Wf3(/1<+Rh)Im;kNR=mf%:K5]=)n AXp%8i\3S%&K2_Pe@_,gp0^PhKeK;K_3hP=@n`;Q1?L^DR8Z.Y9_kMAAu*eB`!Cr+@.#F2L n>HVe<#hk7lY-,j.+SUFA>^l0uea#Ko/#I&)f2p`edVD;r"=tRI*29`;?1G&5!=mSi-g(^R akr09>=1?(metTl`2K6P,J1N/\Q-'O8Z*MCh;2jVonN9Zj9_q+/uj,rGeCI#j-pRE_,u2Q# 9bS$Cg!"o5r,.SHM($Kja"&;m_;jC !-3j&nfLi6`$h=t4NEF.Um-bW=W8Mpm!Y/)<`mP$d?l[?9qAWAIaD7;7;2'4A041kG!YFo# ]3fk[?ePY>8pd_eO\7-Tts4#n^b0$in:fAG2QU%Kl=+?_76rais*oT0gu8B\^s$m/qqgrm\ G$;dGjHIMm%;AjkF2F'L<3`!$"JjD#iM5o)'/@`b\1OBcreV4j#X rVo)E);!J&kh5A2Vj">jp/0#Ql]'nRI9[oW$PnVH\@64@t6>k57"^A'E9N1ZhriRe'QsIH%O5^_dHLF/F![6HDrSB IO(*k'PG$3*HY#=>Y`AA@@fHfP#[JC^8np*goepBcSI$#CJ1uqHepnG]+4(CeN6GInsf"4/ h-i:PplE05@%TWoF#[&OG\:`n97Oop3"FnWl1*9=oATip7E>#YrH4&L"Ru_@[CT3X?mB)2* O\$pm?j9"h&N[\U"YHWt7PIC6M,XKIj%b$%G'fHS6re!f$\FA6&i\bB.lh4)0%mhp=-#[%T [o;d76IIfLDf)=KZCjHUhc_Sg1iiocgIW1kj_WU@si?_I(Q(A8ULWX#R'LtjeN\s2@fW#jS CQMEM6V"[/,r)*4=Ag(mb3Zg%)8iA'h"+]6a1i?J#3anN@=UA>'n>Dg1cPfXUJHLZP8OC1U /]F';u0crl+KX$j9RRH!qo`fRK]SdA`-?bHiJ4Z7Yl4UCGon?nr25f<,IDG!*>b G4kF;(s-d[.n?oeM=Y>PIM=pRc`lL$m=\N[@OqX7kZf#[e3FKRiG/8I<^at4+FsY3s6sDL_gt#gj_&fUUu7qm*ro]V &1p*[IiLuVYqP_Jhq.dU7^=Ls8-[%Orc%4D!).;2N+i9r#'3(8&tgr"&/rUP8/EF=#@W,uT WlOW/p@>V(]`,.+l4.kG#3bF(h$msO@m^?]*/G>*$H^?@=f+WI*F?Sc&cJ\ctH.%)EPh/`bath%S1''G3hKnOjP2j:T3$'>\2h /b^")r>"`"(+o4s_4D5MXsO3h-VbZ?NYN@mIi#tl&qYA$M@C@)`o=!5$ZVKmEL@2dbROYc) pV.1HYj5&h+UYG>j`ngER3Y,;.dsKO> D.@'9%a*_uAR;G/9u:F'@`)*udilTPs?U)B*+nSu;jP%Q,iA5?X@*V#+8Z?mtIIjbq]-6]` 5JH6)g6R_Gr.2%sr94AsYi#DnC*hgdrmqDDMY:@u+p/8@M'"D(1i#?*[-rS'lYBouLcOUTU /Q0t+iQ`!"oG_31$P/oD:STPjlRrdG\)FJ'i5ce/q?HDoA)R+dTmRDZ/GsQ%r6lAXP8\%od (plMBOP-WN$A8ioeQ+os"cMg'/ojk&cf-9`MWY9'2&>s:B8jA`Sk>?i'd[e>]jFX(P,Nkk@ b880Zf)ha^Lt_Tb_m(mjs('*eCO5YY>9T:H6g^)o3p4!HJf"Aj _4OFVgh?kXYI#r%K(OH2NF+;k2h$5R<%md+Jk)gHc9R%nuKDd-!^E)V58X/TT9HTt1f/'+_4"OR8&C^uc1OB+X$6$R#_?TiVh' )%r04&p.1fZs,sr)\VZs7%h7*iB\/T9b`h17oXP"P]3%a!YPL_'`fWc_.je%_\R6#8Ps%jF HW0qjrU5>-ctA>C$QTJHV5'V90o'__3>mIn4WB+Pn)W 87D/la83CF2gYb!d"&@K.=pd2c*;*RWdX@:pl!9dF8N&OBS=i8PEdGRS"3(D6gJOpP$l$W? XQ5*?F"%p'K]b9:@`=!'oQ1ZNpsk_)^27`op]+7T3;C>+/Nm=ZC>%*Y1HAso4YsN6A+i?%!!rUg6H)b'2%r\A<``kVAe oqQ"Z'I#_)_cdIMO''(kHo?ZZ0WuE#diX(b/`r,$H'3dMu2L3>Rr@p6p<$X:epY3gQ[)p8L *]Y6KPa&caLFXR-9:?4t%24EJh2[`3n)'EoYO(8/KJ's1\5=ruY`*-R6XO!l$"l5t#<9d7t LZj/iss$/LEM0'+k1_"EK=:ns46'1>NPTLAhm9^Un?%L94JI+[qKFgEN(#["A@:Ta3#SjU! 7'o`Ye6,67:NY2eFL5OG[m_#3q+#OTFuO&([qOUUk*KL/&g3JTJLC^]H3Q3c8JIY=PaQdGS OpYR)5.9`+iYOrk=[O^H8h]MZ%a.DMf,8$*ob.W=1_0C]GuHr'VV-o2p4r4cV?hI$fPS7Q& Sma%'a7#9U,EMn^ALugE#8%:pk@FolNgB()=Zk%O""PUja)p[Ls<0;V2e:=;t1@*'^4u<#% P>GUPjq\Q(UF<7j'.&g:7t?%`r$d`%<=K@=HY$*"8*C75l(qMTT k?dm/N**uVL#Dab^^n6%q1*m$R+l"nhdEXe.cITGJCYVC0"ums&&:tMFtJd-qiD"cBE;WT: Z5i0%qN3aA=46r$nN-:;K3IVP#b_KQ!fG\U/*0HktZd"h)%1L\;JA-3G%.Cq5mKPKXg$8-V AY(H@V7fr.mqAh-usRnH%bp@EY,^)WI9E#/Ck=iYIT#se=8E;@ooJFjU9*M*rfN\i&&35Q; :!cMc^6\*r'@9I[G6Uk-FQBt0c(JCFT$_\A9PP84Q8Seuhs*!*@G.K&E=t#cfJOiasGT&Mb f7eJdMkg$-U^>s]1_e6RpoD>mfRqUDk%.U%)H6h2pHb3IAd5d$ fPZF\8eIj*).T`-Al#V[0(mn#So_@Kt=197#uj8";BDq,9YDJ+_uZ*^O_iiJf;Wk[5ihbc[ qr3+h0P7QoD/"3ik;*KNLTpHK_K(l4bpXWk.qYRe`tH:*!d&nbQik:1b&gOr0R/Yul(PRZA ehfH0#=Ya[#GRjtdrbSn;lR_(M8)`aA+663nbZ\?ODU%08WXbqI([2W2*$]l=dD&3"#[TLA ;]5*@PCqEU#%jA4h5c'Ign[JCI]e]8=$f\m41`.A?"'G_ep+*\3rYM78!eFGc+:jT;)nR&m ]3-#`?jO^[?'gpr/>G1_Cl2'qk=5@8%&[#SgM^Fh. X?=p^m-T:l+UTeS'kSe6>iE"@/8GF*`QQ[d5J4%T38c!!W5>hUErL)If 2-o@loRTn(k==9H;HQ5Qt`4s8Rs/.'r%cM4D3eO@)dEocR$lXu-HQ8hk<#B?`IanUO+Xa9N s3hna3EiQq5s?+=lp^up'"'*g4\MlI9rq>JXP2.RQn9I=7BO/[eidYu`*:_0l`PYW r/[tJ(NM()I^K(Hq6-RBH+dsdCkmO]p[9c6r3O>f\NIZSZ5NHAf?5D%@fSfrOL\+?lq]&*U $<>TnF)+=g_IB5p?ED+O3Lf!c7AP>V53q1$S&u)51XM ?,,-p?lf?q)4fgRKb,7jl'p8u9cR6Rr*,]Jbm`u8SQ?3dNEQq$(WS`"%_:i\d.,uo!Z-Cn% tMe6TgQq.s2s,fb!--RIgaCj>*]*f'k#/r&Nc`E+3U9"bLD#41kl4ibOZ_"GWaI"SCc$C43 `?7*ce#((S,jlnYP,@.KN]j,-RkLVpD`nclU1"K&R)F7N%a1d3!SZl7*3.B;iM7-:%JGTnE qbJf%nZ(EnMBJQ`n`^_J4i%M%Y6k^*H-J\&_-iueNHe-Oq!"K>HJoOK"*P ;rFshigX`CVf,s2Qh/l.pl*!=Rq]GS4;Fc3\!<7U8i/h%t*YA^46K+$YF?Ui[L,bcC'Dif& (Q??Y;:srY2^+5QU_5[EQ;Jom8`au\AA2>(QH\J(Ugl-?&tMe\PM,U-JO,u+k`f7.*g'$j; X'G"/*ZKiBs%lp3iu;^=fbZhp"IrB\R2UDCmGGdNmD:D>4#AF9to:mC+dbLp[e6P%t)#0c' :#lrIDZ@E0raG$PA*2iUL%*Aj7)oa(2In4LSM[U)H,/e*=&\[W:-;(kOa(k5.=1iea2u+>o(S9d@B` 8g1h8\%3d0,T`WF0(g#P_p\]K45I\i+p&+dg?f0oCrP&O+#RZk#8/P>=?pkY3O[(X!6i`=% ,m_A,ZmuPOOOPom__C.9%n&,<7hA(N'MB-.nPi3u73EaQ7Y+!:,RDD0XD&VD0uS8Ta0F-B* _5c8K-Ehul!@#87?KbI(1dbL@MaY?LgH%gUoc,ho$juqRRV!,INO?W:GOb>BnBG,"IS@09p 8i:3)0"/h)\:eXQMZ@1W9#K)<@0d>S9>F"$t:5,nE@?1bBM3;3Y'"85]#E*D03dXX?b?1_E t`!bH'e#ugL+5uCUh,sYTHTd6-BeWk6K=4O^4B3A9CNGi!%!D-s$Knb_-1+kHth-mH%-'#; RLWSX5fsZ$qBNclOd!6^#l#LfJpINY.D;7&B_E/DXYi\Fo2au8=h04"rG[6Z$hg+'; V=/b<2m)gsNW]*12igDq"+fB4-4b`;3%c##@@0n14Vf=1OaG-KF+eKN?pk3,*$2Ar%*q`?>H%mfuA6,B=Z<:/WiJ`[RM%$-B4b`qGrfWBc;/]Vs 1dIVl=FBNj#Hu)RcuTBqiud=6H"NE%_dA#i\=7HUcPmmT^htBgdS#`I=]S-!-"dn1nQ]]Ka)WK*Hn^l+&C&C>*5=;TF+!^>cuZl25LFSd-Vr._4Z?B jF_1rG5-F4jV.UT6PgiqU`1M,,pKcs3hfql`2@Wl*2d^dg3P5gl?sb`+0TX1 (DjFGH[b^sn65tQ:Ji3f4N$)MHbNLX?/F`#+=Bi\WuY&JcVrOYSLTY`'B<4t+AUV%mI8=,M !0.n-DA(?4slN"L(b7JOn?@jG]GdAAW%d0)+T(jm/4^,X.=jW.j,GE-\*4%H7>*okma�+ ^`n:PLUb%:_OsWOeW=^?8FH)Fr1.b%4-R<5uQ]fd!2$i_l&u>.iPOTtr8i]sgn)/;EtEH;au&O0SUI?l[4;;^@f*WKAsuFNp6f0UWGkp -.UQf:*FcD,%RO2eMVl*TNAo/6U'"-S!-,':s>AC"YOJ5iipDU$4W^\gt\Wj"n%(Hr%()5: =tZTG.Z/K4!cjc7Yjo&+%9k*[2d$d3t6`2'FsB_U^(e";>NdR:=7 r]1^8=9_);l0+I*+_&4qJIJ0@1or]i="SKJ8`:2/\](Le3f$GdP\:h<-_6E(26lBmIoC+ZF 87]9)"m!"N.mDAC+2Q(."WB>*&WWT*Y* j2NXLEZ7L-`g,6R7@^^U)?Zj)38>1NqofHmZX]FfcM]AUP`q0)P&*#L]XOWe]AoGq&L ft4$UGL!p"b?(h"i/b3(e"/?K2?2H6&c2DF=\.8id>=\H$:l_Ark?n6uYMLFUocdVNj2T9F F\:,t5I[N4Od@C,jbC2&<%=)P:#!8D+rWm]V\?`]n5JB<7kYBb1@F9Z^Rc-8k5'f@pO$$Ma97q$(7<0uPms,q@mg%uB`S-,k,, (GZ*2DiCgia*@+\TsqLn?Hu,2q)&^p+olTfi79afYX5.U`fkI)9?haD4/Ep)`!rD8)ejOKV =_cp$pc9K`W1br<;34fqL-h,keK@@bX6p7OFlan=$`cKX7a''f.+gJleR?!p,#Fm:hZcj07r-X_]bVbL];<[8156oq*ol.'EUuph#;G&?*[\j.T,HY$C3(?2:cJ iV-4DH_Qa:"1c?YI0k*0Pc&g34_.XOX`"aH=8IG3;!]4(!JW2aT#S68TsoGVOoQ3]Ch9TJ?Wm;?e7_@^GV3Zl; A!e1AJs6c/C%KS+/#bV@!J>dU4GU$H;KF>^GP/VJX[2)I;#9K=t83Q&3b_o#M"CKeX9>!qm c6ioNI)dP?!6FIRq2C(Z.<(*Nt@maa<_c01FKLrP\7Kn*=6S!"Ae1sGI9Z6!e#=s(EbT!GS B89<*2fpFVA6$TB<^ftgM-s8:^hQ:`>/djQ`Pc#;8qRAtgI:_f`WLh4$t$-B@]2V%-7F!h9GP63*Z["BYgh1TWYnV7RDF4!]U&P_dDVLap >s]!);@=@[m_[l[iU4().na:=A9-Gq9nWdHPR"HL'JWPpZ#ndG_8nmk%aFVW:&GSu"Q?W4G6`q@b;n;t`#)6[(=$D=18??m8_O E*H\^[jcGSX:b:eI/;[.UocNGOi$m\Ulq#`/pM0NM7!'Q&J@5H[gZh,ofln-PJqTku7TVt2 2A5#DXrl"\O"E7Fsi&h/[@RPVH`0*rk@OFOU3`'r'd"FO.N&ih45/[jod'X:W_E]@\6r%+5WJuJ?VgV"7.hDEKc/9_Ba4BF:75dNLjTHG=@IW[`H<G0:o-f-Dp&i';M?LHP[UJ'D2'H)-KoT,J6Bm_0#sc&;Y;_AqL8a[G)$MQdm0eMoC (.=_c(O5YBY&?!'#_349AK+7u]X[`BD7pH.*<_L4E&$PG$DNI8hU1"qX7T*.c0G7_38?%sV :]0F14g9#tOu8?@Zh[7sW^9[r]maCS2hcpn(HOB"'B"J?)P:_5-l\&ukD!E>?h3^F",GD=@ !M<]]ufPuT&5KWS*amEKY"^r'XA-A8G8mPuM7:f(ibq/?"b(A!aGRDu;X3/t.ZWa$LE'/dgpYCZ\kA$,f6)>@FM(9&HG5qs(_B4k%)H$+^mO0M`u1+p& 8d(S3!H6O!URjXU[u5noush!bc:Vo:dkLlcC5dM0J(UG/WJE5Nm0E.bsdQD&2Jo(8POTcc& Iq?;\C&e4e*t=c.i_%eX8\8hTdD)fu9H6eDW./?Ns%_L_O\p_]gil,YiKWSkL"fV'B&$d0G ?j='Y,rPd`s:1W6rrg;NMbeFK6I-(d.P"did%\6an,3!G+I!uOk\[/&Hf[G,g$>AuTV+DB/ N]$ZZQ"FsU/kWFP9@aS2jd7R:nlVGlu_U+Rcd!`i;2%%^L`mDE>d*Q/X`=C9!b0^sI;'!k+ FV<(jcJ/TL>RD_Z?rmQW]2>E:h*ofK;AFnAA-Yi+N>^CP+Cp3Q+l0OK?+hFfdUn82HO$D"? 3T9D'Ua_9C^"B!f+m@Qe,AT2pi2#G8R!+B.Ab7tp]pP*"/aSH_&HJ\=G.eO(d9oFFdl<+LO;&HRtB"4X]:i&[\qePF ]^:#KUgi-#Bfc323r7M1lGi4oVPE(^2H=G63EeUA'\86gjN+=j-="Apk:*Uj>BIg7r5"H?e i*ZVSj$^Tu:e65flc^D/fBJAj.Z7CDJlj]s=@bu6UrU]njYg)/!-X-O>KN7Q#Ab/AIA@nmkQeVFf.JY4E-MW+lf.nNg81a7#WmaEE8&R>Ak$ :&9s5X(:nL!K#%/_[_=Rk\AV*HBL0,r/W+B1fDVK&I>CLMFBJ9SIA6h*7[$A;YfMVo2cf]G tV$JZ+G[0$!HJCE*>ZQ6idoTe.a'=XS[=gj$^4G(bJm?_u,j'=,#)28=:kOR""n$J))N`h9M,<`f]*6OrtTMLELSMk*>1CQDW*d"*Q0YQ0)eX.oLnr#ASpI( gdEBm:l7[C&RD`!6gW%X(U?sa(<)e#RPCkg!Pphb\O2<"NXCqe,p^fZ87%cT/K4.[!mL*l:7dHrYjL1j`lesYd ,YGVY:C-L:I^i0O'I-)+`ismh]ehQRRH'eLef>ca9DDl!J3:8YRj-c,@DEA$+7tL>e=B1)? ;ta`#6#O'PKPLP3:@6^M7-%rKD[,\!(.I;=mMX#<=\eVM^@bWGQb]IqDh_*ANLOKCqW1cTA OI&_k[Xe'TZ]<#L6-B9U#T4uX`hITmIAcc"G!`iuHQ>:*8CZ `'AE;'q6#&F@>8qp)[ECOq\%i+7-7F2g.BUTXiaDV15;?f=>kD(%ah$)u^*p:9[kLBjnAq' :tJ9!,!;!*CNjpdKmUCiP4\kbg!%MA &1lVOH.!HF0lO`SBnQpE9A]_>H&BnfK*(;#t'4KMW1p5ki>NK?-hoFba%@O'@+s>]mQ,!>R#='G:WSKL+QnBOiG/ $\q%`8?bKW.hmn2@hH5\+]s^./(3CqRY4TcPKBX6\Q$"90:#9XdhX.CSGn"&+7m&(p3f/u: hWfh,o2J1Uf(leG9_+CP<%+W2%#ULWE6(MC=T?'DS9>[="IAK*JV#>8Iu[E+a'sBCq!Ye(H [&rj`\4@moQ"?ir+5=gD7mC>.#Ca_dY=boWW4CO.#'@=ZhF;-'c\cnk6AUmA@BLBCn4o(7. UjdHYi-X[]L"Xjf3EB".]tQ+,OdG?_cCpO0g7E-PVK1O7^L5-A.\SmO"9cf]Cq]fq3Fm$VW /dEN`aF19upGPkb8-\on*o6Pg+^H]3=E'LRdkG@Xnlh(('IilG?p[nJMKTPb+PN0bb!l4:^ &I$!IC_I&iOEmom&Z5X:3gV+*KNAd0UcArQV'-s(%jYiV3>$o);&)MS>[8,b&S,Gh`^;0b8 rFr<ocD_'P/ R\dWCHt984alHn^l+&C!u!o^tLIe5\(f;q.($9iTZ.?!UH2'l@G^elAh7?5V^kG(2K:mDM^e"QZV&- N>AI1cpQmEC^=X%Ga,\`Tqi-6"DKAbBW$\dOVAefn)`2ShOPD27MMdj312 2pR_`]]=Aq!LG1jB4*&PN2g+5%TmGOhm@Fq0$27k#nisS*$-YD4Kc7JRWO.V(%Qb'4n>'UM .5&Q)*Z57\-C?qJN"+l<:?cX6Q.nROsZ`aK.iIHN(gdCg/O6Zg<$6c*_C-?JW'X)eS3@mX' uY]C$m-"CDRIiIS`3qtC--n6@UK_sj0d%E.e,?QI%DA.a=4Qe\Jj^%2*)1!T;pmk`;]SHh= )oUR'ud1&KhENJi%[p,tX*IhYPG+*CbGMVFfmrdN3Sc=E%pmq_MiVgF(Sd1t_I\4'&X6oeUl@r%PApF;bQp2\9npK=jdImG;Dq4T1T7>ttrh"u5q>UDtnbrJpn +-M9j7XE:\9:%!%0>BT$%Yo*#!gf]"5naA)oF'nRe'Yci3X@[&7Q*bW&Y+@oHAjkNY"NJ70 gl+m2I`IglE&[1.K?^%C!hi_^K4.iNtV"YjNJuaE8#&"@%]=qBAhFN*4_+@EBc%j=>SLJW18A%Zu G&ahePf^g3FjFE<>#!tj@%3VH7Kon,377Vp7-ppBuLr3sF$pc?NUp)D612KS)WB2IQoV%K^ J7/`A7PD[s'pTE3<6DIo.RgRr!X*1sb=QM?-+pXP![n-_$%,,&!>1[i$=M(F!LX*8e56:PQn6+alPnjS/5FZC56mkN*!/qt(. mjqVnlr:;r2rKRJB&On<4=`kX^=>!C=or#V\(fKi$J9?U^WM"I!Z>MW#ld-P[MgoP/?m\ii PWR)g$D7MF3P9hF:d.#9Bh#A)hYBU/d9>+WNjT,k@F9-UYS^\"[AqbqP##ei-^U Es/B!FVB?59,_Nn868_IBR75UYk8A*e?#Z*m@h#QYtbKfG5"b #Ze:M`R]:"eW.o+\aE)Bkc+gWE.TMe69IiCMed)*CI2JdhiKG`fT.]iilr&OmYDgh6sgi7! :/>DfP$d34W*7jddOd/dEI6#KV:fL"S2^/9<:`>lb(,R!tW%GIdu8,Q5,(Wa^g@(P?t lWHZ+W)^/qsWM"+q5hF76c:DKK2i;>$Y>I/K*f)]8a$%_Rb.97PKCF$rDV._j@8%u $E5R!?N]kClX?D>Y"rtQ`GVY'%JEX7*V8Y'Z'k5s$Mt(#9FY9j#?u-L9Z,SY9_8&hSbOk@G #!^11mi^[bL@7P"\f>WOke/pT50)U[\9UgQN=j`&?k-=hfkLLu]Y0YQ#$fATIke_.8i=Vc< 6\RL2J1b#S+C.B+*@UU4Wod3 Em$;0"PYf[Zn[:8*TnZp9W_rYn>"FpN+H7V^TmX7^)/e_8&ICH2nMjGo=W6Wd 4jBh'QE"JXO0s']_@KHpRP^CYp!'aK3%C'/sfG]tH52#2S&rIrT@ (+gr_j$8B7^MAWJO]4eDc(.*Nc;9eH!L!Z\$j%*C/1IODsW9Mbe\:5$ooJhNVI\66/L/6YH _YATiiWE:SL+432."<)o>[NL-d9n4"ab`B8=*a7<5J?:d.-4^*DiFd4(c0buc_cMF%fs;Xq 8YMY708n+>FWt']fW1#%\WGXNR<&;mn kHXCLSq>nt`TgVcen<8#^:"otUF#qHlbX?U(R3"=UAk=Wd&f @3^3=!2pd/W(gcLFnrdA3W215UP:KQ/b$OF_V`ZJIkU-d5IMKK3.DP?^\n,57L^L@`9^aK0 FImI@0$oJFNe@q:`TFq+T5q\&Ktjn5:oOfKWs\@($Rg`O+lF@0I1.T7dqqM&%6Y,u^`[m7PtTZ8j/j?k9FBmUV"=Y5Iao;"'QI,k>!?AB,s5j@mME&!%F onnf_ZE)*GbZO8V]&q'8UIe)qWo1qjJ;N16'OXRMuo7>=1JY=+TTcLu!*eEu*P-"BjXrO,. (?*=E_.4N.hA'J1%,jGj+M8?GWX>FF)@r).ZJ@+P7^s71m4p?b12lV:ZR!BUo`,Nu1N3:LP;L1T,'%W;1iO*bYS T.Z3%Um'a@,r,t-3j"8):Z2iELJRh:ba,('> R6[Z+j!)btTZO(a2ocZb[X?[MY\A8JLDQiNO=gmjdkm3KAe8[/D(GruZmIl#I"O'b%(8-k@ f(+R6$AJFXDj)@rMh+uLen'eJ[r_!FHW#SKEJcIl-lB^fG%-4]&]dShHW;,m3g-*I%4&kOD qGR`UK&/'%2mh]$J-Lmo<:ssnrZ@uBNK(BV3..WX*[>A#VQRQ?d(r5)H<9m]RW#[&Dp2p$Z 's(Xq[k"c!/2G6sTY(oRWE\>^>ZJiXe]1q1\.YL7/p5i"*lt;. K;f`H,$f1L4Pb9YiD2)UiO]G$P1.2`EEWaj>B;W$F&Z:`G<@%Bl'gR@,n]ZZ;j rJ9eD*j1&6)#3='i^)%<7P,O3%J!R/V>3\Mb:jQE2cnO ^KihJ["WpihP??II=Vt_)V-k;%eetsALM.AAiT2Puf8(ZK%tS[>JFF=p_(8L+/ChRA[Ej^) SVf;LM85>fV?(!_Z!J9T?)AAEi@JG\mu0-q?PpjoTb\C%\H;*o?oA6t[MNL7hi9TkrQjG3F sCI`nW*2o@b*DH(,q<-!,qqb&+`5#G!V5c%:iL4N`b7O'+tbj3Yth$P&,peiG'>UAf2c?)F ;.[6.?qe<$-(!LQml?@H8IfK9\?GQ$.qJR8b"H'H(>=PaQ6O\SQt[$m'W/C6kW]\TsP3cPG HaoZdX^_:0EI_eba+R5p[OH'02aXr"WeBi`mqaNbe,":nqP%q)qdWLL56&V+Y/ 4GENfT8&qM56%jcpS?*QI'Yo$o(fOqJd*O7=X(EnSD[@O8N0K5]ML\14"\;2,TneQer%UiT ]i78Tn[L;%H)VCmD(oOe=?+)h!M85o"1>.RF\[OY>q3\jS(rqS;bI@A%&"up5N//)iA/jJ5 'g\Q'JN+G@)7hgK\p520TXYUJ+cbH>H]" ;(Z:)S%;.k$=/'0p>a#PM&2C3CU84Q?qNcQ2CrRg^TO]&I(Pf+)?ME*$)ln+=NrC*?h&R)1 BBTJ\q=A%)Kk#+ZT/Rr#9'D%_8'sH(DnO9uT$%)duPQ6Yg;h,<,FuN+!&)6-!#j!XW#KS,@ QPI!qNHl($!0)1agT3S2@>K:TeY(1ATn3U=f_n"/=1'nIQpG:C]//DBpuTUGu+RKq$hTsE.KfdH(8/OiJZ]gIl^D8W*b!osC$VSn!MnNTUjWFs!miN& ?_t6$d:%,1TQd:3+f='AVZS7^Th[E!2U6lP(I6NML/4KtA:YS^"G\ca$>5*5U,B>s[<+HlSj>+"D38qa7`;9=4 Ro',tMk)e\'b!T1Tp[@jfS%ZG*;<7N@]GUgaSm1=C4(GnQ]c5ScV`U#i5NBB4G+d`U46gH%//F`HPBf6R q*UBpiHL'mHs@2t]G'PDU$:b,)ZeZC^6@j]Z$1c5)5/@o*kg#d_8@i%*b!\>cX7dPZl!%@m T<%hR4rFB1Un5G U_8mOG7IIq/>!]"7I7kWp:T<7%eR-lhI9G,#iD@>`(SMBNJN)2/F0%Ur,(4g>fFB#1&Y_E. =udfP)[2,:A$]X]-V:0/O)P'p4=fp:kp)>$B*):SlV*[7e/18i;sime8g"*s[kAjmdW/Spsh>g$&/G''teXEKB_frBB,2a7&KqrBJWg rrGA=,QS!4E%rD9S)fMD6Bt$%fM34B;)VUpYe2Or6ZCO:%)_Sq5n?@<,Y&M9;++%k`:6f2( .Iau@PSS8\?&.9EO9^)a"cY!+%K33HQ^B"'T4/+nf3i<8Q%sC*/gU)Hng\:"K*`lP-hPH96 .\W/PFOQ^G/D<,f)90j$M)$*=E]\e0P Vo7O19%C6D#J_+7I'N@.@s,cPHrQ=`_:BcIA?e9E&_anEreF[]5/B],?Dd2r>_f8q* --FUWa6BI+%+eM4FksN\hg&MZV;lmYGI@$i?['3\I:(Ufs++Q;-38a,GVSuAT%>j4I\0-@Z ;V4BQ77[M\Ag1]@bBg!NoPBX6]bi'r_&Aafd9L[AN=@"QXtGk2K+ml*ZLS\q8LR+Su6kD5R XHFl5f(L*eg>%qDOP3l$>geV.mMqT;cPYVPC0VHFC/]CO3_,XTrI[68W9kWNK,-jrl2iD*) (S[Vbnbj0nB&@;\YhV-tVTmlTD!^2NoC"2=8P#78'Y6td97&R\*F`poRC,KOnQIk/U&5VZ/ )!1_Y$c1AUR5LFQ.-UZ>SI5b*SFaZJYeTK\\?eKTbfi1?>V-+?4'neOZm901(kYY.%R KkK#[m9KKFj.W6@RNkG:s`k`:r'plP6G:1cutD8i>,nP>DnVcB9$Ec+%=93N)>`m``UV+j&BWMOet#A@59] mR#W(>c8s!:m2fcUH]IXi4\+`3+64,eOHKZ47pt6s`Xm&!6Mko1l.P`_,l6;'m1*$3)_ Bb,gF15E\R+@GX]&Ae-18m+q=V*qAL;RTQIq,o5e+H-V9\:I:\BeC^][h9h54UAje7-5'rR "S@I&MUj@72\Q?"Vd&]142jZPgPqQnnUr[Y;Kq1dO58+B$AAe;$1cr&-Z19'oC0rB0f<(U- (@AE@)/gXRe&Cckq\7,S:7MNXd9N8;0(k5\I2$/nNhNR6r,a9UuNa'J>/;g*&g3ObOj.Ugl jI0h,j)gE2/dGRm+62[;>8(W/Xa$));tKJ9GGVbl^-lolTNbgT,u^ 9:ML&#).@&L+!_2F.TK'>L`WGC\t)een=(92kYhoN,_Zq9LoZeYY:,jU=)/7PX@S!s#m#.3 P&4u+Q+")$lIfD-Q#'&!8M[/"cX#keH*(b@Qf4DA/c+8Z@t5VcTB5VRo]! gYlq-(C]E,HE.\E7gKi$F(QQ*0Z\/R'.;d#;GN#L,6hOe_4M, DiM$A4*8d#!fFf,!aXj+G`O'nA:0@*?FELQGqnXGpR3];GTD18O"3CFYk]@@cP6IPIuj9MI 9.ri+2b$]MC9VMF&m#"O@qLo]\T*!L3(W.k[b&SRgJ%#Hd>jg'^+iY"pPXI$_n,:#"Y-pFB 47GOZ,_mm2MhmQB;sBO;SKNDAd>pRpBOrILhCVW-&lN2.JUd`Yd;H[8s9WOg[!b#j!4?*/E *Kf32s_68UT\;&CALJ9r8&1ct2E0u=<`#,1ZaM"0=fa8$MmjG#d$N%iaG8*Kj"S@=h'4 NKY*Yl(:rP*63WE]DR[Pimot6OLZC9_oJ^k]G^VoQ,m)KUC/c4Z9$Vl@m`&%7[<37]:HUT@ S=t>!LtZ9T1*e,fR8s'#NAHfo%`AHUhlHg_7>]%?fU?Mk %\n6Qf:=:p-&_skSR63(O#i<1o'i/8KSa?pAO*FsQLRIc_2`E>C\gH/K1m,?/c$LndnJ$\j0__ML+PVFcQ]=37_gjAL8n,=->>(`Vt%ps,CITO_gT/>+/TtDtajjs:# :[;;IYP!@`ch[_+jq":UH[cdsr0P%crbp!Us&1M]ieQ]Got!ACf_?K)>[IrF:`Plds1gTQs "ICOY]Kn2$j&Zs!ueKO0-FeY^`G2Q$p]%Q"rXfPi(="`&jX&@^rmBVe-gqS#;LQ@5mnJ`M] BP`*^MS&5thtY>8a!9",1,N1.*8%S/FVn,;O?\12IsPTN?es$&/FM!Ac:4].H>p,6hOPJjF R8!+pnRp_@am#%1anX#WMA3^To!6G+m:ZnKto:IN&ieK4#EHh_lPsfgI-br<<=-+Qp>JB&3[mX6UWqTL1kTb6WZZk[#[)u3'9MrbW=>jAq[[Uu">A1I'C:;Vo2TUFT+=su@E(.ED"(4QN9 7*QEFZ5Om2ktZ<*+6c1CU^Wt`TW;6+@H@=J>ZV%7Y5f]GY0?INAs%:3(QWN@u!%6D`E\oK@ j[eGUb\sCrWun39-.3$^/P8G=QIo7ps&d&9ERG6q=e-ZQORL^jZM2FpGfnL;8"e#[R`dS]E f`a@i,G:dV-kUcL<+8;r?qS"bMm8qs+>8B[pPgSma'UBX)e3o#ih%$E[0qE"5P3tNbBOBY: Y>69=H.at^e*1B#)Rlr$cah\Z'R2W]t]fYSR8c58Dj1i5__E87&8ijTe+?mG/56`XXL.%u_ S&YW(6\]'fL3(YQgWrLYY"JT<8^+G2]!&e'e3-a]"R&J_!)!II@YC[SL*0)]N4I,n;2.V:a 2GYaf[C#FE!GXf4p8\c*5Ti-_G!)0(!'a;&9(;'a%Um%9Sle&coXW'mCq)o9XN$f]Zh8fI# "YB5Bq+#TL(kIoM%Hs9hY-'>guJVO#^E@9U*SiOF2h6F,)/P"Od"Yj8m%Y!mU)i:&NsEoE. ?MQA2nIK3SX8]]MJ@'nr#HJBSEeh!.Y)lTjB!J:nJ/gD7UN'@-Lj:BVG/$QTCI7%M0M6%g1 CUEn/rpG+iNZ@j6iYZ_0S%#-H+!Giq*g`k)*,6gtf7C :h2-^fL^^#1IFkEd)ln'kYhOV2ZkoJL"KIY4?ZOm4OH8T;+2-q8g=OR=b>/KQ^Dq$#[^Cc) c=,jL/;lFS4Cum32(:F^AjpN9;T)ToU0 :!DCf:15JZ(_bC1+L[1I]/iK7HCD"D&or?cEdhdu?=cS7>#.A1%gEKifp[+B$4,B[cj0MWh 7a77%$2=p0p.#.R-T<,g?'E)_'FLDWL5aAmn`F4@jD$QO:ZN-E=-:=T5;<=>#$99moD)opH W8+_=&&5`VpE_&TPeW![2S;%2OTZE@Qe]h?!gkgVZ7]G1'8CW[N*FTHI/;1Zt8MlR\<0Gg7 @tN?-"rJbAQs<4*CIr)QKs3AFN1F#9Z.AQQDnAuT4\O>=CphH&\'(V(99k=VXbp5JE!L&pUKSOlLOa5r-'u>;F9gp"#,lGDLd0-@hG,'Kc6]RGh5jfG"O8`g#,"hG"Qdp 2?Nd;@KlBT`Pj?Vr%U4@j>DQ`A[;S0J7U:kT+'LV\^IfR8O*G#3Sn>m8VPNR?Pj/;AsPK#J0q`&(<#?%htpd /DWbGZk7f(K"Jn;,uFLA_c,$*X/35JQQT>\1u[4c\GMthFmTt89"m2+C9Iha4"tj"A/WfS64-2q`?$0X/FQ5Ejf5.9bL,I+BH +[.'fA1f6SUF+ga=K#69%AK&goo?Lc]enliqX,;9XIo4[KP]IfTns.Y!q!77q?L+Ka;2lgG 32,9.`DX(IaMJh3)=9PN;F4('&[dgQlBa;e8-l(C60qBE))!rZC?q [KV?%_Ksp.sEb@PFS3b+KDK[":]j'm;g\uG%lk`Gt_WSVMkKUn?KuHiEm%2nugls$s(4cZT 7Y.!+#7*tT^jQGrpJhM`RR@>'^bh-Q425[=N.)[7Ek""i2Y0 OY.;0\u/a?/Ct)p6mgo?3N;.bg:&-^bb+*A*NjcL.17]KLfi-2dW%#?H)5F9d3ol9ESB[hY $DG"Y/f3:gYO?db_)PNV-XjY>Xpr7A]h/7^<*Z6A5k2hpqbap9n>r[l9TQho.])BK$'-5i= >t<""<-.XPQG7"fM9i3!E'*XV0aE/,`2e?08I>'jZF&Sun,m"Q,2)j>n@Nec2Y.,@j2AQ=M 1;?d%;@EohNVUB<&dp^%Ne\3-m?6=$%+G.[,#+d&K:>0QPo>pnXeooiKJ1]c:."n6uiiJI* ^>VY&.>44Zj;(#K?8$2*bK8m&@jX$MNHJ`32K$3QP5[FNVE&.hmr%N@K;_.lBK1YsJ)fZUD a^d20''B!- !DnE/;gF&823l=QO`8E5)inO>@,tFU!eOLN%!^emIP,?u\CEEDBepY]U0=#sGMB5G3"O&7' s=&t&B+k/M1KT,r"0+#%kT)'ECA\/'C"]fj1QRZX/.ifQN*Qd. #epM,f0(SoY:Q$S(^dg/Q7q`pcBI>XlTP9((-m2oD#/pYgR!sf5;M8)2o?N>:erFh,/;EXc K7I51L`#@sekj3uTkH/p>n;Ya=ot:`oT#>]Sso;H7#![&JqNEF&86a[(\IQ_"t4Ffjlktg; X-;&l=Qmc?DUOOm:qBTC9FQ/T35M>G3[CY796SW"nop#0iKF(p'?HV0LLMb[&/SdlX%'o:M (s3T\pTr"&")Ap&nc&CM[I3"c@PZTLOP^Ef,=^Cc9.S$ugr'8:o+r@+NA7O*5?2a`i,W#5E 3Bk>4C!c3Lk,m,f)f0OP,Ddd7j$GQ3524]hh(W#KV3]^1?cK'RTQhHiLo8-uamU7=0+Nfn am-pgjZf[Mk^FJE:n'< g,_2g9jpF^ltg&Oo'*aBc&r#kT41k#D]*tW;mO>F46G6Ta*1Bq>QEVTi9>6P6qIZH^7n*5@ c2$UQ_"!9mP1I6W]7RMS7Kt(*5f1C(fo7&Fc?.`foYV3_ZpkH8rIu/-!+E-p#;h)J'C.DT4fdVq=7AkCEB(.SK2!^L]U&HfjG1`6G4YZr1S_@W4Z$GoWH(."3Tke'P,Yj=Rb6kLD-' #ZLe8JFS?9N`+Ld8XNi`WBQgAdK_sQQ*t"`-!-AOo0DGa3kZQ+ir(_OW]QM_2p=6L-2"T8b .h>.E^)'Yq!pP]X9=!K[GT)&r"Ds8J]c+cSJ9/>h(aW1ORk89Z%`%>)br*m6"/8bkXEJe(" I_cnkV(6I:r[#=Qqg<=q[Ie86?u;H/&Y1m:A4Y""aeYo-9b[,jGIe.iug;Ue](8Q4/>9j(F qeQlNY$`"A^0oq%mD-U-7c$W3\>Enj_Ra`H9>:"aVo`UMAIQP>E!3"tD0r)K!b=`."JV=?<7Qt30S@M5%\% te:-?584R3.;a$@G$ShM;m0R0oD-Kl-sQ63;u4*jB3NqP2t:[;3^0R]@>ca.I-?IcLO4+>kmD;1*8\aJ4:RU9hhHuo;qAu9*lM<]ZWU+rfcaiH?hUfU3LM"Xp1j!>l67eLWW *+\*AXOkRQ%Y5Dq>S.,mJQu+hs^RE:\juSp]UY*,QNAA%KjIs+p8'GMZFAI#Df#].RZN)Jr j.C_0@gA@,r/Wcu'B1fKff%'IADdGZ>$"$OT-YX:YFX/iS6GKOT$ =i(jchQYcSMq8g?`[NtOmSNrpU@7Y9$J,=-EMMQp&07@:=qik/QT;0ji`poHFXQu\.:c83J &-Q443kn^"@IuiRbm2S[d).N"k7`b6DA)qEdZ0jhI)$(l?r.U51)F?u?'d@1!Llp+<8'&N0 ,_B^>&jX$$8Vo)IAE95DdV;TMcs/7.J6!M=oJ9*b;^s(i_\[lg=c*bh/7k?WQBL*/9:9QJj i"fu;YFKkq1UK!,f,kS%V&2#OYZ&]`"q?o(l]\V)-e,#+-+&r9prCIk2b?06Nh<<+Sm]\,i bE$P&jBdd5pGQm@@1_3sh%N*5lgDSs.lSc[#1IBB8i[e*__3g&XJ&'a:6T6obP3TGtgGa:/ 1b>_ZYa/BFq.,#h[&;3ECOKBX:"KV"9&qF!o2i@-'`e.+8tf9;eGQc)'&cZe"[f6=(8OnBjBW/,4"iHLSd7VU@#Pg@%HW27u\(;97Db^&^4""4E=*jOFX6"W1[I1e3&\9s@`87`CAZ252n :$GWr]gNY=eUa!L$YNJZF3NO=dq-Xcu=RO,B4T)'OPO9NMEl3QIK)+5S\s6d7EL7fNS/_P& 6bp8KhnDUsuqmdbVT0[dr=7FM9J.&nF_Y`oLBOPanmcBF?"`>;&XFV!a\9]%:!L>t_SJmbQ Pn_2q:tF]tk"-0)Y\`q3SAds9INZW=+>paeMfYcje9+N"Y'hj(Bof!YIk=8?P85n#OcC?o1 #(Be,n'nM^'nkanM:9TBD^DHJA?q_/jZ)fg;E8qhR\8Mme*'bm+31)mbd_k(7%^EZ+7DOi+q6N=I2h LPUqr5uV(IUG-';>&!NR=1Z7D.6nq4.N-'0u>"M*OfdKTHgt)L_bQ#SX00(8]MAScjTF<[. T8We+'1'C-*=$+6A0erY%hJ5K>k!(9/0&JJMf*J(Hfrl*Me(+&=/,VK:>+rK<#0PqZG(j;e )g9H$<#k3ojjVIfY qta+siD(#^jG ^7U6WU!fBQ)J;a^BRQl!lCQLOM;%i.D5f\1[W_5H;YrURWVtU3#gi ?TN'W?'e[S]f0Q&_cE+>tLR^Dj^&`W+VBJonPW_tM1:>QGH(+cqljoQV^2qVGT[#b ,i:uB>G/U"onp\pLruF!ac<72$m/<9Yp-.Bf=g8#X/Hr&[?MiYaT7cV"5[4qs;VM&ke+s#DedJ3??!bk=HN0i,r nl#l?L-p)muR?J9CBRa!l'g"^^pkRKt(@2(;VO>!H8rXJD(Q#GRe-n(Einq@8:1l!aoh1", oGHbXDX'3s6*a_u[4c+gCV.;[#oa(Lb0"b^B[(HNm/d#&n&VODb?CS/;:H*&(G!d!l<4K*X s[)^0kFCpaQXZO'=7$':>WYa5[9oH)uP*0>nc"6L]A\eX/ucg\Nk%0I"-]aPIm$qGag_>$, (XNmO;+(=^]!O`hRZkX_H%'[VZa+/D/+OSFY%rhCV;#_&g!>!5PdUtBU!D!Z.DA%I\eBLP7 &K;>p*thEk&r5fg5n\cdDV!2nf!.:M81tV>>(u@)'TIq`Xc4%B;\]b'!^U3+^a^10)?ij4g a7%)o6S);=>S:6l2Q,S5*DPdJi 71>37GTk>D[1Oq-Y-Gj!3hU(3))cA(P_,bg! nF%:c;Om9?T.32t)8RF'ZAC(B/iV*CoFeb,o"Q]<_(3\/)aV7TEUmZ0Yd$u)Z*.CF@:U>GF "U7*/oP_^P4($OndlsB6][!Uc\4%`M(h_W#sfJ!c^=N(SM:cnq6-I$1EQCNJd\81\:H%E:V -F%1G]\&\R<]\n(BN.f/-:X1c%][F%T?L0G1"'rtAT8ZX!M$?<#8Cs0HJ?Kn048#<,Hg2fK '^bP;2?P6'#J!CbiST`u=;-5Rfq&YWqMTcb,$r'3OH&n,92JRT5-=qhN:4-2fkcq-=j]0$9 O`.9UW#j3cQdlg/u*22L9:iciIis-7Z4qm*Ce*:OR&fG,;4`gKbe,MZ@%[uAF$8A/=d%l4S=%_[m(?$58NLq!6F%eF2(Cd)XTd1)0Ul[n-)hFgGXhl.LJ.GW0)AML4Pj]MIo1m g-O5Z`E5d;776BgAK'-M00M-h4P'&`k)'S'U4eK5fS+W[s8;O&Tg_.XN*DL1'8WK;'6?VSl-.Cc?!"2Bd#au&RgiriH6=3M'<[Y=&+`!E\AW%K3/._,;,Z7 Q&d0?P3UIc=cTs:5\R"0XX-uE."KST+XJH*@j[@W>Eu[%dW"UakjHlDmbo&ri4UW`@jpo3. :L:0JFtBLj!kf,.WsqpTc+G/Ad4OL.$$)6FoO!n""Z>8?jcu,O%i#.pl8e:*`#nCcX/:;lX Ec^@WM'L[P)*C-kI$e0QR=Lp,cdtrX(q6)=nMPdhu]bRL;c01(UEsTXke&M@*cA(NVSm:VC B6Er.+D1tI"1[XU.-K4ibg;6.LF;e7jFP;X2B]ea@\n,0o8qAp%RCR@@."VXD@^.t3[#aaF0BHpX)9_qDH!St1UfJ)o/q*5DjL'7VB-ZWdMfM` E0L<162Nk[l#BYjEH`(9QQBdjl5suoE47?Bl%AC9HT^n*o;0<(DN^'k%dVnNBJI`?jptLf1_d#t*>_;SVTb%jQ<"a?IXoVafEg-tIh-Li`OHo-ne`?6PZX"(n.( L8!EjoGe,@FY#@$rC*_6P$=@1?6O+5u-!JbC%6c5r[,)Bm`G_.jrJ0k/]iQ$HT!=^RGI$4l TNA2ZT:fkZoW?4.o))Ko&Gekqe;PS4g<1*j&8(1h*DD4+FER%PDb"k.9ga_]PUD-#=NT:,:g G40AG")lluDgD\!5s-"#/R_U%LRK.BJNb!GTlJd6EOmZ@)D.\7Jf;J[(qL`_g-;AAMB$'%' DFqkf0?)*8#99T*[/lJfQJ9dU)%s4G$8[YRW!A)7a+0=Ua+giU$AeXdA:S\*^ <=Hko!V!MP#S5VCVGXc%qaLLt,t,\SeW!]kZb%tVV"hR6fY6ZL9 8mmjVWr5^11?/ej,MgF]j'5=.[c']BH5!6?nir!%_@&`C5?Q19tV"-C/!ORes(2WP4?o+d6'`KX`10>`Er20r5K-l+`Iq b0Uck(9'ujKf895f=X*^6-B4e]Ba-iL=fp_do;k!N_RllJIgl"#N/lOdBadKo5cg.)WD4Ho j)#;e+g""7`fNOs!=[:mVJWXcBLM_4hT,IBqgs=4"e"=;'DUZ"d=prUqhp,C6@DT)diMj:k o#5%7*J)\74TD/s"/>_ua2(.^eD8GV'@C)%GCcV-+OR#K,GcD.V0sd!d+TOCFrugDW80P54 [5nD6?46h(SN5(KBE][c5`O0'0SM.=)"WpT;d6OWSM:>8&-!MmKS5S&>1iqJM%*eXqlRB"^ 8Ihg:u;:_UTREJ_J4nSXL-5$`runKhZ^k(ZDMXiS.PngQ>5I!<<0tMut!igj8XsRfV=`s4o qF)aPYVRk0Xea:r%p:(1/E!Kn7)iNg'AhjsN!h=Qg1XqG-^huSEF5d@]+;;jf['gR,S)dD: u?fE+S[DALO^qLj5e/CIfj,ep0TroF5JV[W$\9j4FOp\)FQ44uE(OMe9gRGbNUUlqmMLf3I gTe@sE[7$_]GnVD_J0]l*X_eb,jomfTXDH*[Cqsbl(47+_W*"Jjm#V/0AugG!?_gDmuVo)l ^S:Ig]jk]TFq7@_)WINHl^'fe*S4._?5N2iOfni"HIj_PW;6uTe[DBa2EH$`*W>Z^A[Mg=q AGEpUj_LH#rK1=:(ZB)8'[N59.*3\Rh:LR,FtW_0O*AHh0@Lo0h@B5qr4aO3!q`oNt85"UY [3/f,Luah48=V,bYoE*3%;b5AZj5ASGi]?B-r&HRt(!>ZO_]GVje&`8B=T_8u6O:LlOc$u5 -+.^ZHe"@]Fc9J;RJ#giq3#J><@6sYJ^V4L'=s#m.d%(@[F3;-8c`.2[t4A!+:nC-`l%_ dAI[U]++>PtL/$flXr:0pt_tP?DDgq"o?I>-6nCqF*]2d%kbe,`/7?+#H`f\n*pl:T7<.Pm XooY>qZ)lW)Z`I^rji=DX9b22]dW?_<#;'I[;C(Kr-(.oam#A=!oZ&j[JuqYPcY?uVJA2@g =P`+&7=geL'OON1mP.^Wk@@",`B=Zc 7[i<$SpOU!9Dtn]$-Il@V"gY;I"i#"u)[J`kPTL4K0Vg?06SPT#$ q$-+3tOS&;'I?R"HZkq'd@(B?B!9B>o(ELP[bV$"#4=_"XTR(*Cl7IHQYiL'R_/r1+\2*8M W]#,K[5jSL-r!PbT^#'""P\QK95uI@hmO$SY71'ZVt&ZS]ub9f#c#2C4'FY':JRaiQPBWaogMO __sq=oO+i9dpJ:C6^.Yo#Z]^TNSlCN7?FrI(73#5I,B/@q g`%@(&rjC3$o/g@5okUKOL6K)i.lGd1BC9=LI+GhK[U,/J+ad]L!B%+V[Z`KNU'LOb;?1Q" ?@i>F9!tQK6mt]hGS]Im()Bq`kAbgdnRHJl[LSs>3^6bteHN)O&l3i9eO=ufP5 K!$h6LcsD$DaYG-PAkWg\:[(LZeJ^^Q7j[Iil/krdTFhqLB+Lqh9SN/V?lh(9eh_^k`^-?t 9e!E(1'u-m8`OZk\3);@Pp:2[3[N++qpp%`11k#p@;p&gHNi#f1]liG:'!d)Hni3+!,'PW" 8XhAntNGn)"i/dnBZ?Nr4Z0EW_O(h'4)N,[8h#"21BnN&'e32I@!N)tn!@Ojm7\JF2s=M)%1\"LVXuLj(rOkdDe.938,AU8AGb16s0cb-7iZfIZLc55tDk"+=&drORa/T #iSr8"PCX*P!2FY#pgm.UmI6bAkP^p0dbuRSWjb-;+^RR-tO[%PgWrRN_uJ+ATY,A'#n'I3 G=f`5g("L/7?Z#GVS=8^6c/)@8%Pq0IAWoR.D)(9Y$EEAk^O=PL<4;hM8o>*J6meNKHsTW9kP !oY-_*nrcno3Fsd!hORT6Gtog]4/_`CZ]*8t%E5i1"/X#6(@pTn9=V/B2>rehe"JZZZhn.KnBSQU(UsuE>]aBA`W_;#keM=((9%NfF)sFE-ZFEt/&S'_1om^! t]NHa:D.#6-JQBbq^k/(IKB:IjE-;],TqFf1(,EOhWqTrsAVX^&,DRu(*Q/eE&Ri*p`E:,- @sF]+Z2nJQKG_2;_V@;1ECM-?:mi$W/4_T+GgGpO4NI6k+CmTfc,Pj+$r&maA?;0J>,,,99 u4DP*3#1n[Sk9d="NH\[+5GKgD#L7IqCFt4br'KE,H@aMil$Eh,\H:3QF'k/E*,j[WTn6dl h>kp>j-TVfhG7ioiN/TjBX4d$c1H42A?P7\e^b)Fm>42n>`kX4I_gAb(e(cMCmQ!n7b\:r" )?WHBPce8OhIMdXs[Tf0*-]#G=t/RbaR[^F^*dp6a6)CC0B9): 7ebc&1.Os)9>>%-rnj4FJT)Y:^c406'8$ig\$>aN3-Pnm(I28d!PLAQXO?,K?]B&C3Q?=4) ro_/O:2_K3/7GFjW(1`EkY]"H!&c;@K(rO3Xs=^7lBHLhjnh+H-U^ Le$E:W8Wd?@;=?[@Vt^2bi-[bC B?)^)&]<[VNn\2_;6S4\K"r\f97umi+4^61?gW8[\St!iY6bKIGn1M#ec.Skr=b,k%83[DY 0ZRK(Llf="W_iPIH28SUdGO5fDfbfs0$5='cQhMReo?$"0\\)'u3;Bir?f9#/G!SYX8LH,R M8m!X+l\K"D:)<"9#g2O3S8Q_Aa\$P,N['#?pI_+YNY;1,W"&MZk:0k2':UDL1k3PWH^@42[jV6]aJ80Q"0j5I=Z\ZrB?0"@=-M ,m7mn1o!]3A4=FX9:fWeL,^Z9Y[4_1;ae5s7)VgW+rZ2H3etUfjDT/Hg$"K-3bj:c&;?A@AgZ2Sm]*N]f+DJp4R7OQ0LPTl';kpotO@b+f8ICEg/%8*V[`QFq8^s6OfH#]k3s!]6":u-V S>*WqV@003"e\P?5Zi]D&-[#F!3(uUW^hs\%K)X95rjDO@'"]?j"a`]_oIV'@4?:e3,V<9E`275Y6T(j@QnVXOf2HHg[;f1m*0Y)c%OcpI+j _X@"lBJOa(AipbiB8P0#iEc4kGU?tkC;pqLq35D&9e$i3V<63E$5#%09@/,hdJlbEqq^\$m .,QuEb"&AYq^g%-uo^Y7o!#ANA^ngYLK,c5bj!PbH/],IK.pkkW)CMi1db):"mBtoZolaD)UZJd;:QW5h&Oi&3.p!M`%<.N'd?%',K(uZ"Ft.'Hq )&.-W5NY!\d&t3$s<7>XZgf`8rR=oe"V_!!;X_TJT\<75Dhf1K,SUdoA5u3Y]Q7=]:#5ds* GIHsHlJA:lj7#&QJWCgTX7@E&aAU3'mtUM_;=AN(<:`cX`";lD,eG keB0tpr,Y@RFB%p0eHJh"qh0X$I0\\Y:*!?b@5aV-I`KreeWj7eUjc=G=h,)i#LugSD-kcc ?e,;@#H2j$gkj+#A&spG<]+F=AS%cYD?`'fed43-Lj_jbR+Ap<iL;^&XD!9% AXJ"ter2::\(cLQ_3'"`Qd1peQRa3eYjWhZ-N,J63$3+(%GXhc1cU:%h q"p>:G?K@!N6oci;$,[\50?d[Y\a@ZZ--K#%TdVUFf3$ADq@ULm!;QsBRjp'95#?'sqTF`O TSMAS_$e&Dj;e?JHjY\pe?rN"g@1EmCE%HZ_+bZ4n;s"hDeNQq)5t3.e<&8GO"[pjg7oY3_ iPlns\i>>@7"tt+[rZdn]hMrmD8u-9eG^cE(+*$.-K9VS#&nR:?+An&.tmt [msjeW=O$BQ`=K1ZLq]j%u"r+DQTVB3&%meo!KXL,n;"G6`)-L.4%a&9J+I<*)g[f1&'Wej >0PI#!5na;BC3Y]Y]iE.u(rj;(*n-:ufpGh7+4=,'E0i2[5f[`Ua]jUHTqMn@U7;h8M1APQ 2s:eZF2]R^Vq"K2`2FbWN6>.a:I9*e";KoY9fNb/F#jp\U+BEhTcPNG&>feDKI=Q\:cB?T^ VJAmo/XdRBY^kRA0!`c*kgs:W2IKu.<'/4Wb-s>]oV<::FB23O2;rWSBEe`qF#O$Pi0OP!" XH@a7Kr?M+*OBDHJ(lT+>;0985TJM!FU'm9j5u'Z@$cR,BNqUO:0rdlPif.\3.tsWg\nqC- B?k>O5)8ePs*+N,k/":>QeU/BiW4houZ!tQd9NlQE1LH[E_R80Ea(*R*F#a7FLGfe*6Ru0d nZ-+BS^W6;U\7C/*@G=BgFq7"js^"O%nkBLW+Nhs/2i3j']-4T>p%dc1(`@*Kp\6IFJ&T)h9@5\g. EgDm2#&fR*pYpP G$ELNZ8Y-;*bc8gr&,L'UJf3.DS)GQuf/L\1YifN;4.^^UI/:B;kG"IKU/raBh+,4[uh!2*? qkJ7pfaAr?HJTM*HoG2pu*7kA`=ot$RK.q[:?N>1j@"g"ALLn*]VMPtg] `sLUB[sn4%Zb`"OEC"jkoQ$nB2[%e5AmJsOHWKb8?Lmu6C"7^>H^D;?Tf%VPH\ZeCqp t^mk5>,JTC7k"9Q5K.W0UtE7<$9Lr(d^u:kHq'Hau[q#EX(`0O]Y'`VdcraVPCshp1`[cZ& ZW]7[Y62\L*nI-!:%nTWN3B,:G_J:tuY$ciq&N`pGS*(mCQJ]e_t50Si[WR)M2&T?l-e<\5,H7 Uo<*jE<[.O@Wn[3@'nb-^757;Rp>;7a?0!="[(/dUtG-:$5GhjQ:].9=.DaAau;s\>)qMoU 9>DSP#hZC,GdPq]9+dZG A>=!U8&*$,IoLVmS?\@b9e'og:BPfWsjaV]EKAhs1PagDn=/>3f)'j5AfZ7VgeR[mcc=g-F nFh9ekdq,rBD>.7Ok3%*'hec$n"n@j+atol^VF4ns`.M:cqE5=T=/jg9p3Oo'Je_=C74*C' 0+X%5Mb(BULVHosfBr?[ra,&ka6W?oIX`HS^\@C#4_CB+16mNc@fjI81_Bo,`Mn5=QGsK\# f:PF.1=#>bUX.?&EG\Y`";i8%n)Ng9+f#c3FlM,77hS\P@]jR6klGIl:ht4]Q5&_;=&QMa) VT:+\34cF?c!Y_'E/'&mUnQ8^`Qk.EV.^V(50$]X9<6P/P$cbOY#91!EQI__]N#7*RR5P?c p$9]Nr[D2Z?;X#ePt[.-<*;sa*?c]eS25gY`9%7*i*/JCLt!jO"aM'Qf%8CDUF.8/+=bpuN ;#$?mT)$1B_@T6>R7oIkP4]Gks`0#%?QIU\"8QI^FB3Nn%]ldO\Q-FY]f@CC^@Ft3)Jh3(] YgcC5[U#A7=k8S+C"`3^V/'8#]sV\2QGpOSg\1$NESOVI_fOV"7EoM07BipaQX[3;Gi!Y0l $M:=c0Kf8(RVKu(W.+=A2tuS$\PuW@5;GU,pA^D'rG[`=dd3bDJ'Sn_43iUk#hCK)*%U_OC VKH8X&4\:/.!b).$U7jr%cBQf`RRBq+/cfc"B1ME'H[(;p5#=V'S]A"r2`2Naj#>&KP%l%O s6\:S*p3 9&LLY>5FCRD$,^_p58D-,S4=U=nbd;Kamr]?,KoYJa">O,SDQKSF<'a%F.S/Ys3pW]:K>s< SSqfcp)T3)M]Lt0N+nU\2f[Yt4l:\Ep`8OOhtVX2M<"Bf:Q+?1*bUc#qAt-_kB`_\Q?*u+: M9(fLU#9ERjBcCnGIbPan,Gf:WrG0+(s-trZ?XOpO8`qlhUP;cggu5s6oU[T2=qp!r_O!_B qJPR,o6]Hs)7Arr_0>&:bJe;H85eK=;0`iLd=G[XL*(bt6,[(Ln;Ct;`/;b$3.)e0J'k5* \Mc!e4`L+1M`LrV&@a%LIEFL5EpoP0:9NDHB,9(-?DN5=S3Cd33*TNr?Nl&.q!E!;R5nL=9 !2*JV.1-Dm4GO[R9FM9e*!G>EOHK*'8kD#p,c&ADP;57$Lp.pM`&J'f&rKN.3DCr67&6)GS lNq$=Y&TUZ'DVn=9q//0E]Z<(d[?o9=]C&-1o$@'+SBn=bST-+N>"DZt"p=>r-)?cC,DABh _a*2#69qtF,"\[.EOU52!LO:Y&mF\eN7Dsn"*IhH4HWf.0oY^,9ui-O$U W/_o2):PR<"<3X\4:2$orj/q_O)'gnp2&#*#mMGX]$3CPof,",7m;6cKCKAd7_!si.ckn>5 >7#7ZrSs<4-=\J!b0r)5M"kh-[>(8b'bSQ"g) -klb;Fd)*l:?oAQ-=Q+B%FEHN`OKIk@aM.jR`ejV`Fu@'VR@56\6>qaBKb-9Y >s`!(UE%-Muf!D7QSC()[g'?0n^0+3%C?62e0b`D\6FQdMbJHC(:E82th(GfrI2I/G5^CB+ 3diFqDKM;9V&@@-u\&=_l=(A.W5&n_7!cD:hsL&;U8A+3St\/d9#"Ki3_7HM3AT(O>%*\7NDD,(niqBl+ *I.+K=^DH>8hqRgRYMs.(_Mi=[X:1jX6ArZ^*sLSm(nuW?Po>O($7W&+VUYI9k'JP/AKG NP!eMS?5e$HY_C!BAP[hdiT1^8HV=o1O!*=JP42LlYiHt(VH*M`7]OX-[jE/j$LV;2';F?4 &0BtZ[,[0E2O/qZb*m3Sb)7]FpAY?#Dd82g`4LO.\!l0Cj?X`_Xmf36p8CRoeE#GCN)]";D ^iO14gU_\SE04etP0se<#ce;Sloo64Q*2qWI++rKtNo@,o[]jc*)in_$9rY\46lL]>hAU:f ft64Gn_MsCG],QN1;gUY(1Ise7(rO32uH;+&L&R?pq=N'mg4pM,DGWi&K!f1Z4c)W=,Ba4* dGVHj"]=jM/Y:&K^^:ceCI(0fe4\_7jmCrDjCaX)]Q^\$^MFORIaQmc+0`2PTo$NJK][fk! q_)r=3:Y:5(>J<6Uh[/o>^`\^NTef,DLk/5^.0eYoZQTi>Di&(1#58+?EuK9/oc?Er2[f3. KHUUBfeg"ZCJEM6lu9aBOf5$Q,(*s96O$diDsGo]';<pbNFt8/%7j4I !UNo/d4>n8!o3Q@\4g@+)lE+1\aKQ25WB7T$uDo>^!6)n,;5c7#@s\GsB*'&Ro9ige38!bD-&d"TU4X)W;_H$^h#@)F<\q!N WI+la6d>0YVN'Hq;.&5^.2<5:1j"Ya-aE*WZ%@)" tp'T$*68rbX0:QUrAFo`A">"E3." YbS)ORa:Prkm!fET]aQU:$ujEp^q(-ZEleL\%=r[15o`>P4rB"s@R_bTbd@s4]+7TK&!6_5 %+NMk"Vm6;?u>o#//(2$#H_3>dg,TkE4(U8B)nUVN)A0PISfC=gOd?)t"P8 NhT)6oR[d>8]4U)j?@(bO1kmE6G'Yo@\d)lNHPU!O`+=s?9'*WaP+JUeCg]c3*A*HBmUZ*] -s3o6"_hTb@-n`q8/m"V2"#@W,n^eirE"Q4/$+Kbe(XrAN:)'Nl<+gMg@.)LpVaqc-Q":3K YN])k^-5HV="3C\-Nu6r7)!*AQ,a(j_DGUq<,Sb3+k7V%_:3.a7Aei,l!F^?dJ1Bd2FQg#T kjj+fcB@HJK^'2+l->Y8Td1(Bi9dh<.;@KU@5neVc4rVi.F.$)d[M`W[4=#C.h\-ei@#20p )\eCDrK+a_29C%C)!=QnP:)Uo%boR6S:lTn4'<[.7!C0;9-tiIDAT`,;iV0XD3&_) <0,6M-/@-Eg)OiD0&!YUr&p@^[DNWfsPsJ@A733&LJUn#DiVFXIp)[Y\)?I>__"CZL6WB=^"!Fo2fr+=1*,T@@@\ADAL%m"0r.SdKs%KO!,,R+n_C/[@nboU5AqO(4eFKTl(R[ClhQ\/ ac7Wnk18D`EXiM!eFMe5T(m=AL8/AQ%19Xh9G&_-_>c`!,1H'Yo[X]kA5;Z;)1j4a/"$\X9Pr1Ieq"%d *o3lAi?Em-?qP,eT!>6"YF#XrG2n$=Wj**IYck<+93AZ_4ducW9h)WrP3Ubf8@1X-:WrEUt )/F@VZaXj2nS`KU)W;YF1Wm8t)*M%-4X;p$JV"=3pYgPpj\$;lB0hXlOW;Y?kSBE#'(j+UeB(FP"\j4J9iqjTD$h@:[q0e %JYFn6+fZG\!Df(3:\ZGlGV+Oq%N8d,*EX>7pd'Qm6mH-a)^/9\eKoo,.tq)&Km6jH@G2]P M1fM@*8uhj2/QB=Fb_r%)cFZrVX,CUmN+[F)<#&(5i%4*G?1*!M0PP=[;f95Iu8KIMR@hai K+R8@9HToMm\\*ka,G;V2TPhN0U;E+a+S#LnoR908`:.cMRuWBG>u*@s,OkFhs+unE"(\&O 7@B[FpWs@MaRo!d3gjp$%Srm[5s(.(/r7fcUI7TFnu%@C?o6q(7dg(R',!PF49YJ`7RKKQZ 89*MKPMMM5PcAeWHs%iDFpA&W*]qJUH5:_a0@3n$h'r#)G4 SK4HA0l3qckW7!%JMak+W_@a'Fs(['Gi3=qGF'b$fKYN@;1 %3WfWnu(L]-6!JD*PrXZhMm%If'pXu].f<0>J&*>s&QfG7ckH?rAb^f*n@>>Hb*tg:UJ(kD G#-!-_&[?ZtZ+(<=@>GkeiKr:J(a5n"U"=o921k]cK3LFD@=f0/W#?U*[(B&>mkbrVFq*). [CBAIpg:HK>R\X9*SXEZ+ljY'Q+)"-\!Wb86-pJm9I/Tp*l6DH_8I-U*Ojdk\%A3?m?`\iY I\tX\sTRRBQAlAH]+9-Mqbcbkad[E`JjT:N+$T;TOJ_R?j\'6A,0oRp-';sg_V,7#PGU)f^ E(4otOW'>_tM*q#uim@[=!2QT5Y?HkF0YO!m"5OnJMuTsbS!`KU3KPM@aR]J7:91W&^K*MI osLL_C@X;&L8(-o-j*)W!6;jI8\/qJ.AL',UVU`A) FP):3"u-iV)hi/]eRt61q`na'H/-m4[Gtd7Ag#Te2KgoF;_"4VqgI2kgq*CV7>K=CjPDl2U' QO$dTWuM.V8dF%(dW6OiI/]HC_Y.d+C"HPI_ie2p>sS-k$/#Ti"?hYHX9qlO^?eY14-j-+7 =Lrl63eQ@,]"0ou!Bs_g_RQIfGU_c4tmXj2YOO6)YT-fQUbY'jus=Ij)eD=n7%dVV\B_*iG =]1a1j&T3ahTm9C7^KH,Np'k)a9q3gniYZ&V/9B2cFNo!_k7S"'GGlgDMrHOJJ\rH#Q/uR r3-;>TdC#FRF+/6EBP89qEbcZne7HddsX%#hsp^Gp&<9nd_#o;*+OHKD/e8DF6 _TV:PX[)5MaZRp=N#)7*K8&!OpL]78L'Ehc>"-BGq@L39;SriPf@DkRnVu9=iB`N4e0j]PR 6ko.*s?:=JY"f&-8XqNP= Ls\m=`JS$g2=PZjN>GPhpQ"bjg%n9CH].hR][@r`F1Q9QaZb%:.sS5HCHZok>#7+OX<@m.OIRO&6L_?<$H$i$3=S?\"@!Jc`W8K`uKOYlhEMR@h7e +E<*Ck,1Cda\'0`GRL1),QgaKe3p,tQHpP:"ClFJC6VEdXo:9%'N=/P@k[YqJajWQ]Z0EU: k)9_1[$2,/.&gG_juK]>'fEN.f9R7Z2;26U#;GNJ<4#EOa0rf&S_ehnAe?+\RARAS@25O_cZZ'uHX,1q jagGR-L$KIT4b.[F;ZAnK4e9:I>)B=2Pm*_>'@T[Cg2$:U-&\#M!?#92]]kX>k^,)Entq.f l^T0L#7/]f;7MRgr$@>@#q!I@R>\@p&T[$3$nl_?s#l+K])W+)hqb^Te7%FUsN8%@b@h:NF Os10ooghr]?3PGi2b3'gap6>`8k1H8B-CIU/=QH'W65k4tloRqFbDA6o[uaY"KtKQomd&\t Q0$0bW%*Mr#SDP*nC3i8UOC3mU]7Y4';&-WeZ3"rN4>7S][CqDqF4QR7)"3E"ZZQ2pV#bpI!;L I/cjeFPS4r-pZSoR23Rg\$!PBA`N651)b5kIK49r-s!3\n h^dR/gV/"+ZIJ:(OW)4iX_^'g]'&$/iTI76D06E(UI'GV',-X;cd'CbggOBGn`2\:d\A&]. XI$/ni1Koi/I_RNk[@>$FjnCA5,@/MRn.!udAmN09eI1Tij6\k1I+[g""+bT9BM*`[=`:3^ =U5Vp+;-#/85tE4%=KW8ZdOmuP],0KA@>p>#1Ia@M).Q'MND[,?$IL+.6f.#b^f;7.>=46B6 @fC$RqFeG5`#idXb7s$(0#"/&U/JC&TK67=\tTp.0b:oY[+BK1>Pil%"C.PXBUd3k]2Ar]a b4\08R,GZ$8M[(G*:h`cjV.C"#;VGPP.?N(.Kc$U"TnuMn^eH7hI'6K>]23576Dt'@Z'V3S ?KtN^WKe[*<4\]#9;lS=7UXBhHEC4AeQT!gDQd'h-67d_XY`M/di*j@T5jTMdl?mC[oWWKC_H;-o@VdWS4Q3^\T@&s6]Iq5)hR3 (nj'6qnEc+n#\Kc?1#fSH=<2J#@f1tX;>Hr<'e^qEJ<-f&5[F2Y g?JFFce\KoS6.Bh20aE*0Fo/m3o)2qN!IsSOUg)#nH*;#rJacS3_3cSSi3A^kJ[i-"@!.5Y ]J5-0dgs>UEso5g-HNG*+iK>''&kf%/d1r+(ZNLcN'V\+?fUuqGh3jDHtLYmi0ah%kXU7;F 6s^l/-Ko0C9:tnADEj/Eg'9#K![rH`m36mel`c?$jV_-#2i_ZA'A)B0]mc(hO H*OEnRkCk4^;lN2lLiimMA3s,%I-[W\M$S=I5(MCAhQ@i'@#Tj*4T4@>#N+^h+$ BPY]-OJHiOk*8"([&&K/t%&(,OfpaX-CosBR!J@1$'bjPh\/pn GXIP&QN`3g+b+B$ETK?/!T3ei6)`=,_c7cj<'46 ;nU;`>$(AEcCB'Hu*`L6"@-/kkG_6ajO@P5&3[KL\Q4maB9%lp,B11[s&q`_qN;DOo8)_,p !pjUP](99Wa1FCqB#Ifp(%;,<_>'W)iu\9h,/tpj5@M2lMdZT2m%Olo#VOAJO0NE5c`-f6D spk]4U7h!rKdKX>L24(Iu!Xp8Us/:TnkqJfB<1+p]!JU!'_l\LZj/hli Sm$">7n$^cVccC^)MbIYZj/5R[Vt?tokg!O)q25hlf6ljU]-%RC4.5n"Al*"tUMDO1/)6!F N/@gBht(Dgaq"4.l=gCD'4)aVXX6.poG!u!ut'LE0@JRDae-m/^*>Ctm86h>_I>="gCJt;5+(&=+kf+15dNcS2)j5\uA48mGHj;oV/SK#+3(&q?A-IK32$6^ol qTtG;+1U`71<&p872V*/4*kp`EAQ43+)hjIR',)7@[O6>ZccsD$L&D[G5(Gb?]`c;?[/2`Z &Bq,\&_oBXW8"`_9u6>\>3iBstWj7[.XGar`P%EAn#;7a,\X1Np6\E(9bF2gfUrTLo?3.Ka ?PKHkn)$\,Z+G=RN\\1<3A98LX#LI]7=8(pn<98kjcJ&i"W")pS\CQYJEO[qj$##I_k)jSK kQUlaqVRr4JgR3]hB*;%!"h6r'Qq@K(;M7;%"^I0],a$2"P(Xg:3X_Xm/#gX;WC`#J8Xu/> UmXfTWIri!"bX(l$aN@rTLnLD8c5:)#a9mc:PQcq]2YY">c0$`4lBs'qr,7Nillel9T7+fJF^c(>eXVG&-M4!]B^#Ln%S/'9aoHE*7I +0HABRf`N7WbC=\C.Im:"/c("Q(UtJJDgeG=,#FKoEbh#Sei(a^>9k\kYOE!O5"jTdH:/p: L>j"jr4pK):KC%R)LjmTJ'L=;:_*%*[m-[XHmEZ40:DE:6])og-(=,Yk:K6s&=D.f@*6NRpL$2Qh?t"cA0h#(G6A5V4@iI/W*l>#c6DY#U]aDWl7 tH"3Qfpqie2,!"&47iPKkNo*H*N'R63(D$"4.Fn]ba&D(dji2S*MrLoKCU8)]VshKO>T#pd p+&8(%f9;B/0S/Kn"L,#UQM1XLE%W+<#EjG21OL"K=Te59,V;UWK\dbQKD',Uft"jh?kL6u TVC]+M1lI/Hb&[U/Gcu0.3?+%I(`TpeuofE74?j.6R7Q!?;*+VNdB#[h:<"2/;*,*@"6q3_ 8U-*6N,]6S(82i"M7kI>',tg`;9;@"UK@iYGS9Dr,:e,q27s'&:6\S%T<(H%La443MS:A:qrt>WDdQ"Ahet!(MV-M,k%@VPK*j]SsqeNeFW'Kd;mS4_I>DBNAt`ep'6/0 M/i#UIi.98[WG-`GO3!DV"]^KP4Ek[%c/7U/t$`=']oLAT\9o2[&cL4+*sKD0f9q\4VjXb, h[:[&hmOWrcIr]H".X/V4>Q_TONb91=QX9nq;F>69mXbA=`4Q&A:mXimcj4S-o_'@K$#d`i Mh"Q3_lW+LejA;B.)PENL-[)C1"Qn.OD9WZ@[[@5d^RT[^B^.[RKgs%C6l-/go5.o@t%AR) YUfeAuL!XUhXYng\W"I*J#-_f9eD"0>gtK`J>0X2_-u"HEFP;_Z>91"R/+a%m=AFP3>?p@G A[P`Z\.deDLCdit1?=35?\H)_>MSc'm./p0^0CiV>ReP8jR^]/`(s[X:MG!,=?D),=bJ14: X&]@XianZL_uBV>h]jE^eb'<(4rJnZ&LHn/I(#e)pj9H?!RcmAIHk\/:iEt!GS8/(fuB41! pF@Z>a*&8.UFd4oj+Ld?W]t*TJqE)T1[u;8qXe=D*;3,>qem?Cg=eXX)c:l<_Hq*Op9I!*: d$HO#(>Y3G0Q+Bep[(/jNNhd%jAAbBDEq$"!$!N":QWLF,XEseXBAUtH#b#5D [5g]AO,fn]1Q]tKco/B,h-RG#!==iOHQDH8pq2MoPB9%:C*d_OkHfqI?gc`X39u^i;"..,XQgFZU[Y!;SK3YMW:]13ZW *P*2+GLG4!qlFh(5h=dQX*VBkhXkHG)p=t/C;a6JOioHGRiQ_V%@#B"s?>8=Cd(](kt:D!H ;J"h;M5&S6dh8)L"peFf(c5V@3pY)(2:sX;&5ln B^d]n?i0FUa/dTr:$=LTe<*CR*k/Uld%of,3Cn;7*V@k+%49WGl@:meb$\F)EKEa=Qm2d5* [aRb4MW*tDm8JuI#Xegh+k=j^3='1!=@,QD@cD3`@X(P!/h(84i*s^aijRia*oM\':5*R?D I,)9DDCR.k"2+a#-KoQXu:1+3,[%.#f&?.Si^igHZ'1VK%nkgSUP)IJ7J&/="5NmEKfR7A0*+kf`AsXQ 'PM*"')=e:]EZ+"ZY^,Cr,\K%^B.kT=+qb@h1iaa7^X-kPGWk6A/8*9\B?)WFcS"eDnn7*7 kO10%BP.FW*&+,qBKnCg:5!\9rS5tYR.UH1G[CVtZPibKoA.melrE9#Np,VdoFF8oFkGN;> (h,5?+:92:g=-2%gG!]JVKMBO%T&YQj+Zt!;<"+m[a"LT'?fY?>7K8n4<_*VKGY3F^Csj%eki/i;UmnY06RJaopp ."/%<#E*-rE(:Wcc"CPGN%ao2XdeH%\0Vn'6=\cP!0sP98"s0@P>0(PdfgL4:K>D^G@#fQ()6L6,1/5rj^ VE/&9aIGZ`,mk=Y>hL5^e'ur%B#;Z97#=4juo5?U0GNO@%*qPU>KtpOdcsR$Y<:fiprnm*0 G>7fra/"Agk.QplU>8T_D.FN0]$:`'B^q=OBOJ)C2DVk/a_%4\f^-%>25\ c:ZeK=tlXdflEOoC-f/p[snU%rVD6"rgWJJ5D@.:["2CB)p_rG`=lt/I.N,H'>VQ\'AeCM@ZInO;gKhhJFgp0D'InP*"+S/HE;83@7i.B(18H_(01LV)U2R?,NI.Igj2p%l@ns*)NCZ,$,^niBUNUUsV\,e$S4":t-4#5>p!22+^`s?:.-DqdW^3 c#2BZ)_s%2au8?h3WQAGhpu:iHa;35dj:R@Yl(7M8WhZJ)E9j"bP["4pQc!fN&T;k0 AmCL]"DAVKXp3\^/]0(NaVsuHHRO";?B5eh,"2XK^0+l'@>X'%?OJM]<4qYe1--C7UY;+5l >dl`;o=WsDd.A>#5LT102bDKk>u+VONs&Zl65JTgA_Ip[E=?'4jH3n9P'ueJ7hqj)h;[gN2 W*Tk*aaujq-J95kPALNC2+MGa0G".?Ji<]qqh@[?^ta/raV<[0@06<+(*RlrBGebpjM%\l1 t>9QgsqP5JQmjs,[-W^_cqJ"jl3Ic[l9bQk]\\A.=+:4pXFk,i/b#bRu40XhffM'DA0;qGZtmK;AIQg,W#oM[;hj8:.>)FuLTp=k6l:IdiVZ-#;&UW HGa/nNA4VR)/gnTiTbQLNfLp_uM"t+qtF+GnVAI>!:f-:-S$&`CZ99F62&Ag G9]dgBVZ=d(T&<6^fj#Y,!e_BT/]jUm(3CJBYg3J;'m*'u>=NKG%nL00<<6R5)&):/d]3.h @O#X&3FiB4#so:FF^Hr!?,4m1VrT9K8(:`9*6"u(u>Ub%9tRLqm-D$V&S5Uhns,YdKj4/15 *N)<2)7HiPFUQg4g;A*4uLKNYmL1#4cEKpo?=]u^Fe1_]Uo1\D62)!J5RT"NT:2/[3(F$(+ bF*-Bji'WR_oR'3b"kq#APIbGSCF"6>&2C)]W0L_X;eaVEiS*=X/@SS*#"c^cOo(tQ'SdXH IZ0!@G*c`T_T[5j]lSpp9)IL]HA-`JSX6A5j0L(+f%8/CaF_=0k)]NigpT'9N<:d@: ZI&1.I)Q-J=WKAs-_pZdsKIdY_7%et1>oPeUtN(kWUGOA/p^hOIN5F\_2^1-7!`C;] 7g($\QP.1:a'XqepcQQ8LD;77^'Gh6"U4^21qF`d&:e[d\Glo@S8Lc7DEZ(Pf2h/lAkU8!.k"r`UQb87go,4;dpdmgj!>Qjdbq>FX_s9H4Mt?T&9g#J6DV3BDi"+ZmL@NYQR:OObd _lp3+j;5=fK/-)C0aW25qh'^:KZVY&H1dlMtRC'[Kt8)X-iR[ro-Z(\dVdXnC8Yf:)[i`jjbFj5.b9gDaUTapIFV3(B'J-K)I:P>RCqZgopORhH>df!,D+.pRp5l.n/8FF\+o"rJ `La*^sY'X=A0RK'GaLP#K4-K!ogjgMbfcL60N5-Tj2nu&:q88K1-u['R,d^IT=M#B.;rTYE s;K5!6ihb0hMZAI-ODVT(U"$5DNn;ndl[H5B$6SK,9MnSAs7?LI(61h2IEeisDrVUZ\oX?H EQ3X8d4(F'VQ#1p(tVkT+U)0TX5K.A35XQ5c95/NYWC-(PT[DN2;$QBL)#RoSaU >#c"U&6SeTASS>\\.HLk1EgiY670cm7`` qIaGc5'OAa5?AEOV*]l&]j_W^igP;q?7>8g C:\+d5)FJ2\P%$(4cqtiGoMq=r:[c$kAaA%GqmqT+u?DQL3\gnRCB1B&='_(SMlS_7C5/g> J*>i,O5(&V1b6p><^%&E)=]^to8]M@T\LipiW#/hn8>0&ph:)U:Vf!Y?P`jQ5pCk#&eR&]5 S#`uFQl*(!7*q/?[/mC3JPE(<:UB-\jUd[l3hp44C_G6/Wg#h`'$-4NG5O@B:AD YmQ]L$M3(:PM\Q&idCj%*C8(8oCG1FpHOIE*C7=RdGYQ,#7]/j5ZA1XNAMYa^)'`F$mEP*@ 3H33-P6q$6I[GNoIE9C2a^P+6R\K;9p7tB)anZe#@X,4i,BIJ"p;+f'=;%7&NN:rA.ZO1(? #l/Tl^lS@MaS4#*aEgep0Dc&!)X^-)(.^e()Mg?-O\G +P>?BsqTo"\B.q@isE/Tq(F[KA+I#@J;QS?"N47g'H(6WH!F;j+T2hC-l@YPkRgrL.daHiuK1Qa^6[lO/o3S(r\N1ph+(`9TW 3ah:dJSPM!O_pDFD:Xthk11;6U_T2jDV"4oiS#<9krom[5'HmCQN(nockBib)>M*s([l(Dc;pllBNJ6^0fVpHq="79FOs0.%W=n>k4.cQ=^]Ge;ZAFR-=. h)&qQneEt;e>5@dnYPF4T?_%a_O9pChk_A6"6(0?bED.UP!Ai=:6[Voe:GA(,pBK:!EH#o: f/.gcfCDPZB)1m.MF;hu0C%tXLn3I1UNGB2eCKA,b3MW#\Ved$<%H.^3G0L6M'GWo$Qr`7; )8D\8Af]jq*SHRG&A0(#p)eJ\S_!n6(C-NlhL4AX2&Xl8)=sImRNI+Q*k3Y>3WX94#G=dJW YtNXj%^PE=qJe>eGRVAgLRY,s5LO7a2Rc1mi5eVRaQ[IMS#JmDK[*M H'ehBA_"*a'+=7Dm7q0uB3+G%6>@,6AN%=icJXI@J:HI=(4_@kere?D!a!N[*Qje/PM(a2u e\2AoMpTIcs0?I0$g1@KcMCCU0EW<^DLqpiV?R2E=c_ L_tPB4$p&/Ko!?5Y+X,PJQmsm=,C?#M7B=;or#5k%.V-?)g!6]TtFNDQlF]&N0qr$)h2-1d uBiTNVe]pTl(^)Z_4] Erdq+md-_)O7(BLTQCu3Gtof)t,3*D`h(:%ruWL?tj`8"#)%&n&db6IR8%H/iQ+ZF)fa25K )`gOOV!MU<5'uu:Z&Rh%Dq<>t'kK'(QaNY27J`\@cHc_eIahpLf6.Qs#l_'[Kb1s&@%5]%J SeCsmcCs/8ToGfC.Em)ibad#'gsaKP%APsEUJVl]Xe+6-8^DYF%K+*KDf35Qs :ad.`bDW-?G5%afj_*[/*2_3,<*/V]h,ZF+DQ(ie>827)%+Zi/5*_n!.>M;=PT4[@L-]2c8 N=c$?fn@N>A*V3GX?4nAq);u8CS&:p*N/Bt,T#FXI%6,9I#m e>(\(#b(EpR5^Ba=:-cs$0'-2_Js"V\]1Wn\;*C6OmMO5L=qosN9oXr`Hhc'1i=7k^)c*pp %d30,fqup?kG<]qfYs&8`E"PZ9GWc<,**JFff2UXa\(X/ZdNJKbFaD:X4&rh&Z2)TEhl\ /I%`*[1UKB=-7pBI"K(#DGKQOGJ!2*t=#_(<.)PJ5W^M`aa"ejF068Nl^8o8JIIf-^@9"P* p-h>qoTaa6Z7ZRVb$Rc=`?Oo]gujT[2h$=sY5F8Y!G"%Cc:"Ti%dglBPP\?EmY8l0go%Ab10IToq4>%9VM8WlmptSn3#\?H ,%-U."="fl`B(K0\c@7jIcY.Eh4Z83qQnohMAlI^,?*MrIG+1Y'bAjrFlcj(m@Mo$#i,H1g 4uX:?`8u"7HkdhZQEEc<3aGLQ=0^BEFh=39mr,nun9Fhfe:>r6MCpq$L\F[Y"SlspWXHgnY p?VoIXcjNi8.1s"$%oE^i1h2"$nV/(B_LX<#l0/n<>.)64gLO$c9,%a@7!k&I)IWnI.\q7' S"5&]HI]<>7lAFB]SNOd'2eN+EOPj=0D" g#'IC9S9b_Wd[4KLAoXceMP8(bdbVLNj1JKYVf/-3c<80B,o9A&l:,B!672:Q1V#J]HjSp[ Te-uFE:p_MZ6.%MH'gto@FW3kKPa*=^dPRcr0bXbq]Ls0MjZQAfioqq-$A=8%-P;(Z;cV@J ARAM>2/Qu.ZUOJD-g:$m<;`iKLptC=EZ9Q@p(]YQXe^W*b_[Cg-P_X _q?$mC"F,"b'D$cC;Z-D3>P,J(M8fH8XBX);jHHIAm^m:3GG!MPNH !B7i=>,Fe%W?p3WHFRMLCHkW1&OUM2bAQ_\>a`Kt)g:8QDL8hRKb_UY;3Gk0pA_pI4;S7>E2oncHQJsXNaVC)D]-T9 4GP<)o":;@b&[F31X:%]pG^Fi]a%'TFM/2\dW<>MP%#Ng2db3\4dTg8G.kA'gikb%r+RqML OP)).$'/AGb,_0jEUZ*NTPLMDjTX5-u&I)*kg1/lur\+P#Ihr0\c&D*rj.KI"+)ooR+DLch 2_$BA`C]5Bl5aIXeimr-k9in,<8Nj8XVU"oc:s!33_J3km,=>:V D0H*=rLCg1*7u5P>,/h!R'-\"+(BK2a'V^^(ij;^D&Q12LGdeGtiBe?4A0),P*XlO(ArO!d 2+Etd)C'4B&YU=f#f-!k6stA%dGd7.R/%f`oQlT2p-?[o"X.D%LQHO'4p[hN28`fm)SqX[8 Jrm$Unj??dUl+n\M+PKW+H9E5W+0KOrZh2_@Jn>@gKkR0uR`XQ.!NNb8G"Fjg;=['%@^,_' Bo=!0[n5ra\Zn(?eD6W.IW8*HaZ* m'mhippm'lN!1IRGTH1T%#$uoSf$&&%!oAl:bM>'33jStjjZsX8LXV^!i#E,r9K12Jo0EYG T+(O/Md5i]C7u6aV6O79/o(HG6m2_u:IZ[Lm8Os6rO/3%9PaMk\@>p>52!1%Pdi)pol*W:E #'e[edr''&of]5Xm+_eaqCGA)XJke;hc-:O)h[@PWRX>5eJbDc_h`^TQ!@1AE=s?\aGp`FI ^%B(!$fBPK+\3VZrX3U>3f:F&cmq[#k5N4l`G93e_!?J!4F-UJ6/r*!l*A,![P^7<>+:R-e ONP.tgH1(uc6!N.D6Z`__@$j#fX6_72=Vi8Pd;jC+%!i$!eVh6b(A71/"d,)'^e[3:K$%,5 ?1/XU(Wi_X5kMg''@jhJ8jPY-nhKlJ^c`OQ%LAd2cPEs?L,\ed9`L23&s/m[#>(L1PqMn"I ;iZ:Q;dd^W_aGfR>j1O!?&I-&U/J:588QW_T?Q86Wn$5\\$;p(4J3^f]?cu"hfsthEG/%KNJC467IMbW>"5m="_@(!R3oILjj(-3`>TAdm!Fk;H;a=h@UI/Q4dp]^_V8epbr5s$: <6L`=8d]5*i]YVmXo*(;9L'4VP+AfW=roX8/UqH$@)]dc)KT^'c_LJ_eL86+JbrcL8udqYd XWqCP;ef(ktCAheH#Di0t)OF`F]m6f(p:o*ei-LE?iNZ^Da.?K[@r.^(ZM&I_)WLNPlj]q_ #LN)`YU0QkXgnN,mb?LNLN%,o^U\P(k1lGuF`*c&pgA1TK2?c;D]S$O`^"hS!m!_0LhdK/^ AZt/s+,+V$,1r:\.M!#*s4Kl_dZ[WM;1UW70o_V-smeMgh)7[XtWa`$tG:%XuCALc7VM(0c L0N1!"&D+us9hjkRnBo0-S*_pI*I+[Srq\M_\Yk<8#/phbj!c8A"G<>cu?)U#:O/c':nQf6 ).FZILm-SJKc*FGpkDRn>Emp#,6LTjI7cn'k.s"&LrWK6$8ZhA:ZGXD%%"3LX/Hae.d'F28 EWVA0$fOEmT#EF$m2F3(2N%AkY[#b'e9\Gc:?h^Dp&;t(q_)CErO"s"_Al8R_&=T4kJ$])s5A>IM=<\f_ta6JjF"_-m mB?u'LC)6$P;SI"ddd9s'+i[?V5u\R#TKrbN.g-\r_3>j(S/T5^)1o@b"n4&G(gb&N+@5c [)ULKt+BelG63W`<_GhjK>UI=<=bFd^"ctm#+BZLf/4.!#_T4pX\3>Q_=2P.q6OY]e(dEZr =+gu=_d#&dA2Js1<Z+!Q;ZoosL3jG"Et-*8%`O*(`K XQFN*DNC0U0s\Yq]34KO;!3@'Pr)7Kd/>0i\9`G6aTu1Qe(]M`Wa?5Y'9ha4u'_jF>5 BJ=6eF"uAZ9o0o,f7Ka!!K]I0pF%o2YF3';qaHK7#BP3gqGKA9na)Fo\\7r@POL:mH[>^8? 'U$R+PFY6X#>fN`jHmuAR)tS\R2C)P!+!3YS@aE_alK!am%)8fK83!8Krg_80trD;>6I<88 n3"dCNdjBW60dmb'^53PcIEPX.P#g\!ddcWXac.3e>Xa"99%D$\D#6[(%*`3$;B-3"H2670 .1[9;@9cZ\_>eM5#pE4=n3>o>4/s/NEWj3=NcULgYmT*sW?H"07m7F.#^KRS8CVb`Y3r1-: 6S4G)mk9]Meil:m>oW?slKKU=\&^dnP%BEWi1\pL?0E(>KVYK`999q/E4XP;!qgs*4^9uPk ?Qu[ll6T\\)8Dnk#Qu^=XTLmdM"gB`cW)8+]]Xut`cBRV+jQh@f=p5`ZbREp`"Rh3JF9a4& 8j)[%\9Wk&Es .^>(t"$TdY8d:A+"CPP7AN*P)2q+$Oe"o$&[5l^L3n)& 2e($Y2bs0\8?37&q"kY>YG[49+6rZ<;e7D"!a@Cs"/Hg<&<0^'TSP%D1/qeaYK()2EU=Ofi?C#H=9C6L"a*tuX]e`4>6?iWKkN:GW)cpk?rctZ"L(u2! )s0\5_VaH"_C_k]I`h/gK`49T>!L@ Y:u"a=$u=BBor"F+%(!([XNHrn"/fB%A2[8R;6J63B]=<2pGLi:8N>=G>iKRd0Zn14^(B#Z rB=J^l,Zsq\,MT/V.`c[<]Bk,/P,-j9UZ<;@jb])6'E*6.Y=^@9F@k35B@C"sNfqaLZ=D%d cF9dVCcSMsH0pG29TZ=%#)74rc"Ff&nUY8_C>%E&g1IOboYfKP2b6l :jGWTT%b!bS,d@1BQcsHP?V"NgKh2@A[gE6`rsb'#'I4U[Cb24]UaRhL(HMn9V:)D^YBOb> R[1K0QPpu`3pM"9#\fme?%GZa'=VEgm-%;V9@YIY"JZ;T\*h.\/GO<6@dRo>pQi61pf4Z>D ,N[L!h'dXLqhmfA2\'L)j"n+C,'igYL-0?.IffjknnMi8+(b?3T?Y/leD=ue/ptpf$hgP@ YQ2=pbnqR303[c`ak\B#K!+5^*i$JK_2?@2T!oOW.KQ&i(pd]sc#N1UJ@$V+#\2T0#7ftG[ "E5cD5Xg6s@g#mLi=HcZ\4;.r$K.cri1:_C/)o,1@cf6$mOdGl0]N?lir1P888 ABJBa(.a@obKt?8ghu2rg2_A#;6GXuYON4QDf?Km5*OOACEk5NE;>A/7Mm-:?i87-$6pA4B #KG"1PI7V%fTjISp'TO%e8,DI%?K,.2BmS7\1?KjlTk1p0D87?KM`)jq]D$OEH1f0m2",e*n'FFe*U2bD._;bDUn,tf^4FHm=*dVQJ68Rg[3SIm H32@p>,-8hLar_L47B`mc/1Sc>HD;mT/K[*B(q%i3/$d;DjL6ARcAaUCBJpSF*/.? JV"Rnnbn37-H?P2[gDQ=$Ll(FnCIhq5X^>T+p:CInK/?_-PQ#/'_*S?L);% dG[H$k8d4]*"K5W-i(JdV/-T]\ERu7Oh]D=n+7^3iE[N"#0-TmF,k=GOninJl=!r$$-hiEmH?.pFc%B/oqg^o,f[X-St>Wm?B^"ftbsY=`oG9_?+e"R'E#D5 Gr^:\>N#od#%.,=Pdt;7'h&1il2EQ*/isXS%o^oqebo:hGD+`8"-op#(0%fR;M6[e:HGFrt ,c-Y&[VI>@$8p#fr\GA#[GI]/7Bgb3F9Veb'6^Wmp7>HiS]cr>Xgb?UZZpD7l*a)cGPF8&a XTOlA?pNN:?3s!uAKCBU]/_#!bHcof"KJS76:_a/d7Q=qkpa+Sf/_TnXK_S&kpcjN.=,2$5 LU`.F"8EH3YW[O*MtkVWGgK]Jck$Dc0EM5lK%M@E-^/g/PPJ:Eq.Gq;GEquRQMH<(q3RQGO .5sCS9_T6q)E6naW#&VbfbJO c^9LTgRKYkjEcqZjER(UEp.Zhmh1HY9__DmfId\GM&lqgZ3SQaVY+TD@Z@qraMspV$J(^A0 a!"/$51-p%Ft_u*cB?0pWaS^8(I##iA\'"V6>QaI&%JU,)n'?YGc[?>NI2C?1-e&# 9eGV>VI7MidGLl_JepWn5Kr@1chi3')Nd]N=rTDu7n(ms:i;Nu?rVtmV(ZTre>m%SK#4O6m &*Niqkkl7]reKcfQg4RjlhNMU!sg'(YWID,WW6D0)A54WhMah1g\@cuB*f`bO;A ga39d>kDAJ2OQ[SniF9I8.*Ui=b+=;t"n1MP*J4eL'!'KQsEK1DRRcV($Ym]$r3L!o(*]Nsu-CZX^UHbW^BB8.FIZ\QG -CKS5=1DPnj$K3ZT9"8Z1$PFLo.TZW4-[C\Cs!VT3JYgMV3S ]tX5`^>9]fN%FC4NQ'sjq-8AU-^iPj#YK-,0rkJmAp0nD>e-Q4BYTqFF&#KoD5Sui(!+:]f$%OPCd)7RG_h J0272A_t6P)X_/4gMnED0(A71id1(<-qsAJ`@+N+j6Nd>6FEQ:(Hp=NAhmIiugq*/u+5&hK 4ka\iEP9,@`q8naIN;7S1!o!GYRb>R]50?]O^]eIZo*6g34'.hTgbu8H32pHE&e4u6__"^D ;1VE[Ff M)\4sKV_OGl$j*0?]Xm(2hGKoN'?PhPsIc )%)"b5DW)MPLMO0j]Q J"QfXWi?'scBSo'm.)6R:aR=pSRTBI1'/pA6PY @ZI3S\K=&pRT?Qh=pm:J^G89pdAGpX*`'q8[jNc'ba:TmDZT1@/urIWCXC'nBpUaUq(TBl?&hp:ikrr;HZs.A?OJ5?FO5R7f!i&h0o&2",OfFn AFA.X==7LDF@/Hh`b'n\2H%7/V@2T!O#I?1ND5,_0]iB/E4mmJB/;!\EqF>/F<`Yq3(D%*, V224E_=c1UA/4>hk(Z%hn H'++A7TdPGj!8;sdAAfk\D8'uJ/oKCZkpT8m0]W,.?@?_4i`rc+5nX!$m?$`#B3Qj"99I)& h6;j\K)o*KT)'l5"Wj6.4+&^R?Fjn9M*>`-Y->W&-.67OQfIgAO-ciUd0bM3F#7SJMi`K^0 +*3BeAG:\X(\-M?\ZO:5Rq!."rjR9Nd0Kb#(h]`BZe#mggg!XETWS]afN'<2!Im)';pc&rTI8APf5Nh,.T@="t##P: S%b]^4<$m>q.MkIND%E@?7Z&3R_KaBV!C,c]7Nc+MkVtec'HSr) eM0FuaUQ^&BSMYd25aF9Sg0\J:T<_GW)X!9LZ'MAl9\3:PqJl.E8YK9k/S4:fR9TgsEXiikB@mZd@!7:Q>!#GlX[T(o/-o I?!P)gEKsA'ecIuK,D/Il1iu170SQjZ`Djekb\5rmo>RQO1mQ3BL,G8[RMk+q@#lPi4h75H @X`\O!FLsJ)RQB%JocWcuq/HcnH5%(^rEK.=LZmq/\L[qqj(] /]:1-(Lep54<+e!hA-F5paZJT]H)WDL((q$4k2YrNq,WKHNV/R15!+<+)qK,`)6CE@McU5J uCJXcu0\/]NkasL+UD)^DUNdBoVYS3QB_;'od16%WNO:aB8]=NF9a:+nRk<=XPO`r0NVQ8A bqqCfUgD\Wu12=c9h//7m&5QXYKL&7A*h`n9=>F%0fe=dq<]R)Uuc(d?$.QT=+hl(.FQ-5t ij+q%fG+lrWRPM-LCBIsUc1cC3<&oLQ=8QDPI5*2$T,$%@M/M8lm][L%s:2,\NVT@\/%g:s abWSZT[62L[1F/n6!8JX7m--7rS70\O1*fYD_br(qRk5CeC[RBdW)?H`iP"XkUH:,q#NGX>'u(J f'.X_$jcb%r]_d0ETKTi)JH^dr[,V6kUQ>*%mrSb)+$GLCN6C"?hSUHW)Co:#eeJ6&AHR-H -hJX5&`>nk-[=q)9b`]W[PG@7i"=fRFM9._0V(j3?n^2Wm3_STE=,*5oY"<':`)WY"):`<_ qMFsb4NhO2jZDc,cT9;jBrc9+TKd-FtUY$$>*4bp/?lrL0m>(4ZIq_r6V$kP^`ObmX1mr@c $can=,m'hc>dha1%jS.DkhsN.Jn(n;dGW'Y-a2mi>r\!@D@>ZHd-]u(@9([C)/`ciMQ1I1H c$A2+d]ZT!DaQWJK;!N4!?M+2=7=^IO':OsR"b]pi'd^k"q:"!\\^Pr$2_JcmsYMSpfL#o$ de5H#1-W]\_#tVO.2_iGhh1,&0h&A,fi [Q#_?k'XT6ac%g/pK"40%1n3mI/,S\&p">(u)/L:R;-mC6(e.?$ln7:#;B*L&'e1F.W%9!L K;$X4&.*Yk^E.f$eN%s>)fFX.rn]0P2,H\%di3c/`.(Xn3-ih&'a5R:$UU&o&&sGh pE"mYnZ*R\e&`c&ag)@"?Ho#'&i7*i\<"u0ej>]/k$oD&ah:3DD;i6@LtgR(61Z@:0?UQ>8 =DG(%G?@0jLa^kYBEK(@HA_/q"O5E>NVB:]Un;6&t/dq&"fV<6hH\/uKS)Wu81-):"`d_3> WA,jl0\)Y('"+oN?tf'Mq>m8:V;Z,%E"`*Paj+!L4p1"@:afc@?Q>@I(D_:J,%"WjiT*ms3 nnb!tN4rV7`%M@S@-@R$eQLjQ(+R_H:&e-!>)'O#@+]9I,O$[bNQk'13(4c_n:KI/:3?rQ& (829B-ThS$LA3EO,dL8mnl6s`=X>G?)*m6f6+RGc.ftlN!ci7u!ON47If*!Wqm(c#nqAI>M 't-;-usnXJ>A42F!gHmHr=X3^c_TLhYqPp.duL8JH,a)q^\lE/'n/F.(0o,p]HTe/FX<)&/ ?cf`#%@o"Q?m?ZK3P+kg#m+$c%W9@-@cU5qfH40@39E'*U&R&er.a"V=f?9d;B0.gGK[1%8 s61EA5L*n3nTQnX"G0R5HNHmp8*eZac:_".o[W7Xq92"71r&=k\"%F(@Ndrc)*GmmVu2fj@*mB[9YM%12Y%J,]AYiQ@Vm13%j3V/e&.SAPi<=hmkh[T5j0b4k; [6(_*&O=4jOWuu+$:Cs-(\'?rZdV'W3B`SU6ibG!%Pp:`R2!JP'1##(d:!f3q*/s!(/t5tY #qc?b87Mp(R,LJoFjL^'Mh"+'S2P\!E'[fN9I;8&qPS;&XaO/3C@mO)AGI%J]o/9`un>U7- 6*9Tro;rb8`?E*0af!ZscF8dMa:[*AgV`1j)<1Gd>0>*'o,tOmtt^pILO&8@4IgiQrN0?Uq Jn>QMPS@07\D)^7,<9(]5Y1oj8kYtKi&)BeSU_1W>lW8V(^D5$&>8/)i5Q,0SPZWT:s^[25dCZHU^B@i..n`3eKlXZ.8i#R;KXOA FW;?.[/q!,;"E`f+M7tXYq!.U<4,PViJ<3H>S+[i//;SDojo[J\.t\E!OCB120CKnG?6?J) 5,=\oat;K5gM4R#f1Zo?s>=+"#-"0=nS1d.5Va4!!H48>4W@Mn6Iel\M=o316o[[i_%]d?4 DGN1D;]Q1HSl`1C,1s#[l-m6E(iKb(lC)JiY(om;nmZQgV4%(niCpq`-oKEt?PS9m[)UtBs2WS"LZ5pd97TT%K2YBP*p MV4,'&fW([c_UR$#m?6)aT2hoT+!6NH)=hERu$9_ZS&R^tH!=04pe.@07:fR g([>@iVR/,^O;k^&q?sQ\g0m^5\HM=Cc(Ti$4+rcd`H$@&b+f5\KCK35f.bE'qn(\a&ncLa Z*ZM/K([$6'ubesEX`$?>d_m`;`TMU7>+[s1]_h1JFo9'"U_Jp?a]Q](&?'L1tZSu>,A5[WJ8ch2HY1(3-7-IH\kS.@2OiW=Gs7aafHrt4CO; -R$Xq$]raY\%&!Y=6d4@'V.9AeUj0"P@)ImSl\mn'Mq\2i)Zd0a]F46MN7MB(TXBarfs/'= Z2!,gJCY<4B$]u;7[/3S*3=S:(+d$3'&`IOD=X-8Up _%"_'%o(M3B+Em27KD_'Od2BfnHqS((l8BPkeCG4-@(!;B/!b@2k'74/KN#*$0[d)d.6K\T bYI\X-a9)'Ka+QNeI]U_`d"]_S253LRQbdCj>B)W=9t@=T#aK0J3r^=fc\G?mp/$j0:="V5 OAqurU\#FsQU^unZ6JJJM7bRgHCSemC'(QVC=;5!aN_PaOTi2R"X"2h\N_tjPT4?Y)gV']G #`9d%6LS^^B=eXVUrTJihBT&UtBqkNB/:'J"3]kB.6%6E<#$.>:Hde ta05f=4bJ$Bq($R#]jgE!R_8^r/^7NheG+YFH0PSCr6ZWfZF4%$@qC"?KSC$oNoRo-SAGLs H,5ku.WRp6Ii<#0gnC]R%B:6iFE#b\_DPG)rYNN_7/. SakXSR=b4X4Th2l.[GAOLh=9hQ!R;QgcUXC>*h1pA45&Mb12.S*R_Tlff0!Dc+ZKa]hk!VuG)e51>,]];SuTmJOrk4Nj]]hsR53%)DP:C!n NVCX*pSn,E:T3,OEjl0u@QX0\$!T_oZ)qp0Zgnc'W2gg\)/9Qt8kp5WmEsfQM;aA MqY/ED/+gM0o\D=r+&q-X"0k'q6X(AV>9VMp9D3jO73KY`@X&LdGS?cE)Z=I&I;Sb/L%rE7 ';7pX?%(=qJ,-jH;4W:VgKY?lC`.Y^CZS/%]q,%KS,9mlYi.nd!B1s@iSM>n@W&n$S\NpkQ 2SJNPtp'#s3L[ol#OW<)M*&@IGs#:\,X5<+9lGHiWTI9_-mn"<"\j"Ge`5M(mIcE'oPN@&X _'c3?=/Nj:W=E?-'cR2H7]L7&j09QV1p'acsMP0q(i!e![<*EBKdfBG:4VqM@M4d-/uJ74s WqV,O@XqNU6OV`(g0"P'Mc=^/&\/(NaE*&=ccL$[BK4f6nJ[p"CL,VWYEM%ZtR@hmuWBm[S O0A%6K%f_7!@Bc,H<[Sc@a("T6gkJTNQ,r(XR>eRe3Le>(([/]YKaMmD+V7h*:8:gkenQ/d 195N*8_S$i]7&8nH+;aLp\WeP%u&!\nbAW72^b$:kAn-RQI06!djYXX71iU6\(^7oqq`C_O 29oIH$p``=.@n-pA4aF+,A2"p%a$MT7>JUq=stSDdfXpL'I.Wkdg+t%g>6QA.[Uc_dHYWNk k!/$Gqn31CQWi]K6Qid,[D'6norQ'1?g(H9MDl@13=YZ$]go7WFZ.(rl*AE>qD&jED\9;?: Ao!p-Z[%`kq/TnmnFA8i!3?.nW^XX";Eae@Qq@j4HJ2$\C2S"i8YMdfc.Lk`0' \Tp\_B"1+6V3R4tLmlaFpjRYR]F7fW#:ilRC5u?&W%n0>PAJ%F/jUhJ)MaT958lF0@025A% jY9P0FT![D&#C,c4I)0h;,c"&AQMr5#tZ\V3bfIQ?As9>'>=pBj0)aYAIK%jfr`.AY@mC(INH@?d==!5"r6$?hA;ICH= $?:o6C`habh_^"ss;"i#!4;Jme?p'8'^q7Mghg\:tlX@JHE=MIQ@h1Q(4;`]9#g\.H_D(jE C\Ht9cW:R,930`GVl_uZ3lAm(.,RqB4NBq8jG5%64,L(8^+kSb4pU1jBEPG;hq7[L#e\qZW PC&4ErWbVC=Z`<>;`jr3NAeo`ak;g8sZY[6CagGs^?IQ?"qf_#.mWm1&QOG,'N%bcs-MP7C S+d$#E-qTm_/S0W&&iNN+Mp>[@hAcN$q(\X0p%p71!B/Nk;U_.>mEI3Aa%-&(1%f6iV:,WO6(WCB9VKRIWqRNH@C@El$D3aYO -[#=NEqa7"KSCP%G9h8f2)Y5%kYl;7ZCKhf%EJIQsahqgO%0lhl6^fDGK\p\=e2oDsK(%Ke sE&HQ95#D#]0#!d/F-3f!J&]5q&6"hbPi7&WsOCA_d\3C4,"=&RrQ4UoX8I?Ut.>)Q4ma>8jq=(';C.YMG[D&`H\?t ,.(L2O_ug@W509[$t"rjQ81pS`u8G!h]7>kOiI1T*+P4SNfhmS7sOMka7O]hiuDIIf`*%h" G;e6(-ord#pLWOM33rR7nBU&,@laoP#>=Q8U2[1A@.aG,N*r>R6`64'VgnUQ;^D$;(?-VTH @\%G7_%m6)BgNQBK*h90$oBA]23I;YFA=q0=Y?oYHoY%U'<-FrL\aH^/Y1B2&+m.u,!@.MG it9ld!eB!g9]'5h__ftfTp']5F%KJng09H$@XS-K4NYYOc(4A-Q'/`j@L:LRiYJC(e<5c@t E^h.4QeH;ID'[P-@#smcT$)*S-LJYQ'%0fXe$%nm;#P228kg^QG-H+T7K[!&%"X?`@P*&XG :kM(hecj+rQQOpfJ*DYCVGu-6ds>_'.CD16PjIq"5c+nuTLbmO(6_^D;K.^Q'*H=MV]o<9M <]dnW`<)uTj_a[JAJq-(ZE^SNRSD7W_ Ih+.?#L1:tQ4V>)uOh%`;CQ&Rd4jLTu"L``U&HUm2+I;moP"fl\pGeLJC:lOM3Cq`SV/mA% $(P0kfqMQt`)i3eJdeuegTCi+m4[Hfhm/k+<.=%Kt5U$Q,AQ;)=9!qKkh%?N=AON4M(a16C @k$7eSFDbsE\Vordgbr5W/e]aHXM)2(-K**8."3$#G4RSlcI]7"l+NFXpKkJhHZ+O7]ON#P ?[KP:D[lTY(\7N3f'G/]_g6<_,6Kp<%tS[eLN1U*aT`mm0V#Yh$t9t']$)m_nC+MWQtHof] KM'VE+*obn_H:^:PrHT_0_5Q(HoEN/.R5V(F!C7+- Ej(8BG!n-=m%@P]Cj4'V_C?L[cKBTpAo:q/R>6gqf?K(1,4QLGHb,CC[[M3"dFjAjgm#S9' ?N%H<=D$)*+mUI8_?=nb*mr:ck*p4CX0%PS5%O='#?rgF`a7qhiE.Kqfa)No#38W>AM[)ST a>'E[)rAgf%aNkkoUIaZu;6"b>X4k0kM3-R(C^UCMe'nFk4%RHKSTGJ^-.WSh.6[+RZhHSTXDggbX7G*M&K4mW,C,g"mhZD^[$BJ8k&Q1S_I,S1AT:4H BW&ig]$(^ASEO^*34F6PhDV=`931BUH2j]k!5fBWDG77_q2eiq,sq]"16pLmmXnr7@A.Sn$)l^HTZT)^Fo4Dpqr!]756-3G_EAq0Mqulu/N#p3t3=H[fSY]j:X3T 'tQDs+&e,%KjOl/)t$0OPd9XO`G\:$/o,ToPjiZ`*ZI-I:'8PnCAr`R%s).!4F%*AiI`%P8 esXdJ6@MLqmnZA)1E6 V7>R*NQ#U$\s+gN(D=ri?:4p=bdZ^N-qPRiEQ=G6!,_(.i<4$u:j'Z!0P6#&'-k]MX7@mQV '6)m!NaEIl!;*ir5_]7,ski`6>KVVi*um??UC5g_Q.%\Uas3NQPt]O*[t?j"IZ3XfLZ"CsP2+,, M9J>9&(HtYQ_Bh!Ja`ec*ua=i,j>=AN;L=e)YqS9\sY.H6*4!\l/4EJOoF@TJ'Kb-M#/%.N eGt3b:42cJ-e9j@%I7Lqu46+(<1k7\>JNQ&Fa<>:\9&2U5h7Y@o)-Z>h%#@%LM*1-]aGc!I ]?DlYL:o[j"r#M#$f?\BqRsf#aXiTH453>#P=\WSYH3i-I#ppXhT:u?KBQdY/*+E+"?p#p^ 2QCmUC08mTg$\o^=8n"4JGG@m/kp+"q0nBHPA[Pn\7`g9!#$b]Cj=^=[-S*5D/gTqtWkeqD %2,"V>E6,d]fV[6Q:Mb@J$(Cq(SV7YJnj^jNaZPe4`$]Z]*C1DC23`!eG;2o,>%5m'*"TT_ Z`(!Kq%9PbJb!g47+XnO.cq7!/#r*:qK+Knbs_K#i';.tQ$*9M^k'3':EbjDE5eq p3V7L<(lroN4P1!C_,4:^mKQ*_DMQ7Qb6Yr= :Ca=p*ss`ha><[1l*4'i?q#L"JM='"h#XLIUbXL,_$k\5\+YEQ:cp7qEa^_*@o2g/M2@'/_l$r5Vn&:N`-k`/hDoZ4GqT]N)N_ 5;d/Fg[#NOkGY%b#e#V&Pk[@%NQ.+PP;s]fKrB;-Xh+c9+=rq*EYr/5m58?98p>[] j"L\\(0;>AK^W[^qFAGarLTJFU#eAf.D%g\46a:A5,26f5/o;F`pi7GpEB0#EX_m4a^>UI95'`_XMHf`80&TJ63 fI=<_(+fOG%)ITTcQLJVUeI-8ddLsC."=KRH_]nqVkWf"K m@DS]DA-jqg8t`d[1#'O4+QNsKGXsA$tS)r&.rn+X$m`MA[GZ)[8C,:L+#"^Ff:<3/qQW*" $djRboP4)]i#V(0U2'u4d`DV-'dZ)7EV(CD]/6n_tgnAN3m4YTg2$ :p,e!2[)_ob*L2cFSA;e=E`*Rh\2d+n6@e"oF8e^5#>_A4]6hA;!K"W3V@b[PUdW2(7fd>)"t=ju?S&PW4PcJs)GR:-;]d4^(lMA'1 >HTIKtr(upoK3,iYc&0G)q79[Dp>0R"6`p/kmP_1_kS!C\9h5$TY^\D276>]*nR@9p!+2$9dZgm-%E5%A2! b$;l?@I@[Ndk^PJ7ol6!mU%E3S]5E6HYj!BPm2$FK/[R>b;o)h_ pC":5d:$:B`Fg?_."+rV5UeO(f@&bFH0$cBM\uPi(no^lAB<"ot@9Ba)3P?m&&Fn4V\_"mO SBl/&$h0PlM8CLP5W9[Ip;Y^57=;U%)7r=RG:p=8YfbRd%h.3m'KpY+<-;a+?:MpqEAEbc]&Mcc=!sW-h!SCD)p^h#&=) OU3m\]5dWBu:55ioDkA\MC(:1.Z$nE'RqK.oFlE&@a+@beEcAk)LV?O*cr1)nM`E3=1"3L:I"!ZWh>?89R EDLL^qJS4uqE?>j6(DIlef[UIb*Pa91-1,B$)/+L<*kmJEV=X6&N:G`r"DCScIZa12OE)," E\AUYI:-(j@VK_FEc.1`FMBV,R,A)Ui##9u/AcGK;:`NWC&X]Es"AF'SqNb4"u&[Ti-pIDZ h%C%ZrfQt2Q,hXV=Ta/F.,Z*LjZ#u2KRb>F6JMfBR&h9Z"jS1F=sd&W-=!eA^+RHCH-Zr=D qu)8SaYal\A,TW1$)@222B4JekuO#ZLjJ@0O_*lk[BG[o7)A_JDG;Cfa[(B3.kG@0BCL#:M n@f#[O0al?.=m;C,?rml5mhM/6b75iP:519-odIp]=3>cW8bEMW9Bgo!'"u&+gDFX#rg%Na 0&MgGfhVI8-E8)SCmOrX!-Zj5E\Z;aBX3-WD?KQrL5AlMIGHU:M^O175^@'>^me6)CpdFQT nTZ,GGUZd-(A2U$Kl;HqDi;MFB);:_r7ptln+V`Z%u]onN0pHln1JYK579-s0a$QYn;!3HD j0[OPo>s3q%&fFrsXPL@rV-hnIH9&:D4;)]O0QS >Hql&Q*6NM5=-"FP;F4V,"$iC:(;ZogWLTX"0J#m=*#_ZeN2QA8K_WC^Im7l+%FZm SL$UeAO3\%Pt'jm:/c9%5u6!0ogr!0[2ht@eJ2@ch\Y,68f,FV2I[;d%L7PmQp(t4i4*)*L1+2%+c#&ZFt&7,\=P:2iu$ W+No5T\N(Y7Jl1fbhffi8tj]PnmQK?eK@@61[SnXYUftMHrk?5Y!J"ObYm!9Mh0uc\NL-Y` JQo\!/V.lBISZ(eaStW0!>->-2lWUa-XR!IS]s-iB*l##I>:D+:RCV2-[dDguiOJ;[T'.SA-Z"o"o85UMemcroo:^F.:ur.W6^*LI#/Y[SED2s'mbJ$8D>s'N82qNl dr)iMNL%3Q>fJ8c8,5^4"ETO\@[YV$/H(a0%?Hkh60=pdQ?2$RIL(k^1Q&&Hma#iQI3(ZI+ gNSt3a#>g'b:pq1Wk[=nYPVn1LhASb;D%:"82B1V6.ZolK&BMLQLf#'77!Ot0@Ur#dd4Qfb fV'#=PZ5Y'K0+64,iO5jUuK=JH-jCDGVdOn&2fWm@:0KBuDfFH#K1F=BsSWf4c:!+>:.& @'APgYjs8kE#3j]ndMP-A=!O>JHj0FO20g02[FFY77d\\GDaTX52](/jF'bK5u(1d6[l'.lVNKbL318 cN]L'0@'[)Ust]p)\]_8cI(=Aa'tE6g1*e?Pr5G'hO2i]A/Gd+.AZ-_nfD=9:sgj`7#.]q# K(;1:rQ/.Ps#Q+)P'j-Ki>#%>8#rQ)XbO(d1IHDD)<&Y+%1qYHL59g]K01srFC ^ZbW`cKihRcjXlX&nrI'6QD^fUC:?]hQs&4q>h-7]^s"=e%[8`;j8q^#chV3&")V*?@3"Jl flS[4W19%iMtB*>H6)N+&ig7(rSeb-#OXbm,a$fud)V=et`i-l3QZocpTufs-tsK,C`GX:c^*H*/Jj#;,E*dd(a$s"IsIA;Ap< tKi!^ob3PH,=%,IFpVK:&9b<0EBo:>K/aUo[IFGN3^%q4%Cd$c!rka`.nU'-S*dS!,&*@7K QSrqHi?V>C40*^F_7S3UKB"./Mj5GVO5rGb_ln&i!JLm Y1M+2?u+SNYP&aNfUD_C#N.$bjqc4/4$R=o$#2$okS]jg?YdoWZ*sAWh:k#@DJfG80#Q$[) ?H'E$IJPRVi:)9>J#,th;u9CT(1[,gm\Vt!XgC,rLZ1NIMIIB622`4Tc>/+n;79Q7;-EGjm %cO:*mi'V&A:*:Q'4UrC5$H+JZr$2@$L8:UqY.jJ)u8LRM@@.CD4uSA1D3*a?kaLGV')V!i >AFDE?8?E9UrT-%S5,'k+1WZtG-p(,RODd]IYl[WVH %1W)b>(tK>8p5910HY7-]h5e&/hW*A=E*j0"0>(D_atBd/Q*Pi4^j#GCT7t($&o%p(pmX_3 m0AU?8jGXuOd0e]V7,sGccc,k1$8DcSb">\:Pr#SEiqX&\NZA0H@JrZXsM<'5/-2c&L8sJ? u-N$P3`"7[<9C^Y7oNki*P0knGWs:pg4iu0HiD17&(u;\G,38+/I&ad-_t8h4]i`*&Cbf&A aug#Q>7IpjX[Or83G)%M@baI\6$+hnSr9+6:Pa\FLVAWu#6knc&R?rVnPMs,[6\`rm<3Fq% m$)PK]Dk>ECW1IIq%.M^Sd+8^"/008?ln#V)VNLXg-?Dh_"\"k`=gG5'+MVg0eX2;3[ )=S+CSRei%bsS('1*k&HF*5Yu]`o=PhG4("$M+Z">;aoEDApi%]9h$2ia:HJm1uiDG1WmMO p.+;SiL)%J;;:,No/P8T63j,Q>B8jEoP8:7E;EiuX?O*m1l2UX8;E=KKfTl[^&AcGLcb_'%%;%RD!O%a+/+jWVq6 +qEc[;BI*',9i:'9-FZ2,f]9Q\.GhlZ<$Md>4L$InY&YJml;_54 XQ>1-IQr^Z?IYWJ65TFooakS:KJrbK.)Gh>Yeb=;O4m;!kPRW]5jQO!@2%@P5*J/.akWto! ^+R3#Y*():0NX;To*MLCg/8W?2I4s&%B0l/2@G(bs3s5(=">`1t1I3ir9$/] `%:Oi%i.V=^eeDM:(a3]':iQ]`eMaaP#)q4@Y_>$"G;mm(3"pWu1O]OZKFpJ"*2*WK:nn?d V)d"o3XBd6ORitO\N83?3tnST8>IJ=XpUh=%F`3)&DoU6`B:KI4NR(3@%mgd^^1[`4#='(# `]i(_?^__57n8f;$fINo07eZ%cB5[JI<)F+[F;B'u:.Vd5aLT2aPhS61c)MYs8Dr6j"Sn&R ZRl!?(u\2aar3'VPd70kD+4Bge1]7+>.'ZrSHg3Y4P^(DL?:$2#*sIn%h>7e)!]JFqg'*Y" e,)"F(d;4e`UMb%rKj"[:ge<]."d7M`k2%!D);9MRRWuRA+8sHKV$@!DPSih#C+*#t-6fpS mo,eS19bboJ;=dL=fKa>I(pWr'&ch7#^J<2b:@\oiqS;$=*2 1,uO3'FUTCZ-l9C;Fsc>dL>(O(;Sq9Ea9uS@8iFU;oK^iTh66oFXIfI<7OoI'j"B->."B)' d:'ti?5VXMcS8e.+NB>nr37f@oq*G\^+m]YAYmdG?E%u'S/`d'"_;0[99fG=k06U@5o*T.N a6>q=?=F9R-E;Y59l\qm,N?29.>7a]qih>ntZ$+U/ebL1qe'b`9.i>G8. GX2g9I)GoVia*=dEi1"UZ'6QPgRGnekU1u3G>l74$0%"S>QJH?Xo6]! WHkc5r^su62%oBYII+Qhq(Y='/g?h/:me%MrKX_Dq5>nm:,VJsloeTNh6W:Jo<#>X8+W(m/ T2elsP3>F(cNm0";Sau=L+](ms=a$TnLsgKb^G<3 )1@m`bflU!$<],l(d`NrM)$)pK8&uJ)4pI ^0(-nl:JTqU3>E@?h%('b+EKpI@S0Q455Zi9CF\d?`A8QM/do8QZb%!WlE]QjoQ$ T_\b6nSa`dR+[ZhiF!231_ZPs!VZmfq59ZaV*b5+E]5G:3Oa$S\XPoV'4CqGoOW)hb+GgAF >lFT2aA+.dLO*%8+_FV=m'pqlZILASq?c\dAM.)5S%:SG,g%b8pqY&H_Au5T_El.=qWo,]& `U>9Qu8d6'k9SQ_N)sUDKDp+N=rG!"]CuHM=am!=0JXZ_Y0(UtSKO@1F,5^O03j:H-BkpXs srh56WZVV6*g\nVX4j*kn8$c*8t(\+Ge8.=GrIt<0$>*jb#Rt&jk%fn-s\/0_MWN+SiWqrb rJK,=hUOr?WK%e+p'mV5cIjnRH>bNA8JD(]'98#@_?F$M;(f,ihl`Q]FKknmS622O(a03gf AC%@S#)ElMS/F;7Yo&+u3/+Va)mMl@)1g-SqZ!jj/$dBB*[/lJfWC%C4,TLlZ^X7edfpU2d 9sBn@640)RkDT%r#`cO)aR@3Gh7r0CUT^NNOs/O/?$_8YSU_A#U+j:i44pE"h;1*2VAD!Gn Z;:Qatk?OPuGMm/kX[-^*5d],<,4R:!Ro3P3sS]Bq#qD*'nK0u02WC(>=qJIeR9>Te>SFr1S/*7D"$o$]3MUQ(WPZ3 H_Ybkt+UeF_]u/O8`#6>.<(IZg!!X=_`>:P*):c]ofIf2?Sek%l)==%YCW;l^ijneTOerSj 7A)blV*hkgRM!W0(Wa7E*438MoYI7aRs:^gGks4jqDHEcVE_XPUY7sLH:<0(F/:opbSj:$> eeL/8UHn7HnN,B@1jFrGGcG:Vd/-)>iX+ikC-1rI\Ch3r:[F(bRoD>%KRaiqO+>]$dbFT-, hK83jI)$[F*^7dN'76eR;KYBri5nXBdL.7D4=Wd=[^5&7Jf[]&A<2ndY8U=aKJ=4]U%$nLD AD*'ojtQ03mHCPM0TLH?N]Rig71He2PQf7oY*JY3m/B@u%$f`p^\iKt5s6eU3ag)EK7?(]h `1`ITk%sYRA\A,Gq.G6'=*PnlpgND;@F55Meh#5A)Tr&O^a;;Zr$+J\Qbc< SbK\nq;5##)W;/7>HbYF$fI5:3d\d'>NOgjiShX&4i+0/Hd1Q>e)J!k]ed;*rZC*j3[2D=% &khnSk$PE9>;NAP6k]aG3-N!U)"Vp_7USP*bXV,T>C>o_L+)ThKS-hHUE?X&3r1lr("[hLZ mTP-%Rf_5\%bnc,E9S`OXUc6!+Qrn&@BL`uJs9I^eWL\tY^;T=8/G]Rc_tTVU1XaSsZ0hUf jjg,bRNkB\;nro^"cc5AaHb$O\^WhIT9bG4g6bBLA;]ZKZ5_sk=^nJoUZJJ"`kdicj([*lggZ$o#-KkdPe?Mo?Wk_9g&C$*gU diWZ*+*LeX407=hK4WgU]%O49O48mRKUl>tI9lZ@QW]dOYJ%[KluX9lnfImu*OH\SV;CTb]&)ll-M`V#h(=e/=A0bP&Vn>6Z'_&!0--1rAF]J#QOi?B=8qRoIT 1Pa@FF'B^T3Jb?V*`%Vu,5S *bp!^L]]"U#Tnn1n2Y@-eg;_9di_#stkT0+(&XZni1ZE:c"!6a7%a&O`jCA3U0-!>5YO"DA Sf7M1#X)Fe_RAK41Eb\n>^A7ur^&-1dC%`jef!@#Vu4Hh*`EcdQp8[=;I.8$nAY:7XM['_G XEqHst99U()1!#$i!Z;A60bZE=P?cj%:%OV*3_hK4ehI]3(s4t+PN;[+ch%qS6;S@R#=HkF 72J:M"1_etNeNkS3L5o+/P=I`eMBs!'_OC\e$T?L;,jq4:Jt1-2,dOUF`g\dG;FnL)fO+lN74;_*FNFLQ6W1uiE* S_EbB."`*O5:I%b ]2%7lDB!cZ\o)l'jh,KCcL8Gb]B9.,n2p@J^i4Wc^-S+f\HBfjS6m1B$cFcA0p+nk/'IM=a #D7a][&gf(.0en>)i`BIQA*r+&g__?"[NrG!0bVfQNgPCYX+3f59Ag4n!UPGJjeCAJF6'\` 7rV5Ek5TIWq(@H+o?3l$C(AYNbpJ\$bRLIeUJDH_2+hnbbU!cguQL0="(]7Yph0)*`ons,%CX.7H4q'k4OOM\0PQ7C]lE@e=#cUZd/fdD.l"J?9c#?pG-/JfhupD2n(s3 (Gsi*Fk%PNfi<_8!s)nj7IYZ&b\K1q#qpP,_qJ%-::>'&L-:XNKOo08P&X53!Y9/N"T_s8\ $i/AFuLY&r'7U3CtZ21oHTNA:+nBau%)QAsLf]=3DIq/EO7EQP.kSbB\4`A`UUmEs>uF.=j 281rYjr&nOa^QSN/`c^E6OB$E?02'oca(W"=;%?XgWLQLL;j7n)GRE7I"f]2AU%mEJ?V(&+Fu2QUqK[#q+Bmo/Z'5d[?pIdFt']JV[$h);gNX_C#qRWe HG)qOKK)=5>T%$cL;)[N*>H;_ ;'QT:59$6*BqhD3?29!*B''3AFQZ?tT``B+q?n9F!YO8F$%,p8TYPYi:Y4BuQ(Na(=_1o[j c0&FMVXn,pd]7Q=A&l1G?Q](BiZD'nVjC2 .kg8S?oYM+W:/Q_[S[:1qYc%E987[+fn'?#-uh8/gkV*V8Hc$=,O7p0?)Sa(?7McNA6_V`h F3h3;e$]!r.OkNd9"44G;mg)l40BU#9IjJ!41K9Zd)l-tPN;Q!Ido'dISf5.n@k?WLLVR=? r'*6FR(2Iju,Q0\id;E"^QO;UkA"(saXSR>K?cM?3WB>!=.+ESHQH3Z]K3&2b5\BPJWLf2* 7c\R)HLd#+!7W`1e&$F?IYQ_U4*[I$qN4["2q;11S a1]2Y4\C$fm=[1FDeRs\p%76LSej2mh`b5hZiQS2>_ahSalL4-ffZiO7Rg%cr*G+t">;I(5/\:^q0sLNLVL=iBq^JO$ZNg&7CY &T+CDC\!O9N]^bc*X49E;d"i+(A^e>!lX2*n#T_5nNjZlHp"0nf$o#/`Sj"$FF65!g53_B^@uj$,@5 %5]=V_H9-YJ7#[17\NL)Tbp"JGY^1):;Z$f6L6;@oJ"/c0qj,.#5DXdS2@W/0aHo^#EX2=3 ,Jd(@tkY+6aL4=_d^O542]i9_rO&"oK^=Z3J85["rgQ0<(+Z(7Dr_+`,g3Y\6jlhF13ZA7' '&"UeJ_69gloo`:QgD!bMY@?A",PKkPc;G]&<&L.$BPau"+\@SJ]4C87C64:]NW:iN!C 2,"JC)H=DoPmIg=VS#G>`7=Hb_VMFM,f`cI(eJr)K4OZ=t-`h[CiS8?3LV?TRZJl7d7qj5> :R7A3b7jN//':V#SFh5M73m;ecCO haYDBEeW*5a!)/]VM%0S=I^.SOpbj]PG]AX3J$`c]qa4PKA"D+Vo k7(b+u)&]A#KmXff8#")'iOoAD80iCali(9q[>A*;$7[*)tC96@SbHMFZeA%o;9^>uoL[(M cF19__g59'1;"7[57oKQ/-RE./e)[`g]r(LVsb\R+"FNBmqrBK?B!q8GY[*+0-0E`!15]d2 qK[7mWd*3i_9f18B4OT`"0*E,"Z0Vh5]F;Ts15&J,_#t?99G:.Mgs+mpc0X8Wi'mk5B>N(: c8=P+6ljQ8j\AM2c>iQMHm6k#,YjjS::0<'*$mpfmDK.aK@i"W0dal5)ebo tqL;6R;BOK_Mj[;7.rUca"t;6WQ'c=9OOb_urBPr;abN!Diq#cntmO704^dGDEt\cb0S1Ka ?%j$+>A5#LIe8jUB*+%7L^8d.Imr"V+BE&%9r02e.%:d!LOi@F1`GLR<)dP[28Y)9'i=d?P YJUfi=pFbY-CLZ!N7Ot$]mGD=1JL%$ogChQ:d,gp6MM*u&Ih'g:^.7Vi:d^:QZ\3kl_Emj# j;XAI'!5?KQK2X%K83JcX/MoMpWIdBM!gjfprA_jj3QMXj;ih_D+1t1PLL+kXh"Gg"k M:2,e=g,]KY,a=!_lNoY4I,^mQai^J/@b4N,!faB, 1XfcfPQ>pFO@l,f0H%M^p%'sO24XSKW&?TD3W=WQ-ON;=`'I-F"fC[2`$-QcD@#`[@GO[4jMRG:?3ct j=!?Zo$8'0PnIAY_M-&*7S"oT4FN&F%F3&X/b_lX$f/du*Kt,m&\VH8h#*feJ%2)mq]\DP\>P5\arP#."C'E6ILEL>c,ZI335gX+ak_9P]%o?^FpfE+s#1RY%i:[YG4KVXhY !'=(X.Ep'e=CAZs,.`j^qTU?#(O13iSNDOBJ o0j5(^?)X9(q.K")h-VS<2X9:"8S0?e,/?`gbKa;ZmpHi's?s/tcT9T^!X0KW%0;c3EQ7#D>hXe^Msh=BFF h$t0&EC::/-`Xlmsg0k_.@3Xrg5WpaV'^I([CGC=^4rJ-:)!bcPCMpPH?o!B*r8H3JCTb:Q olT1&G>'T5i^P8(<[V\f_<_j2@Y=[>Y/Js>`T"hjLL,!0Jam>&1CmN555V7X&*O5*$" i`BQQo>.u?K6c#m4QlJQIKE39*H/Hj6kOZrn-9)g$OOJ*lR8Q7RHLnh!O))TPd3d"eW.E6N r!JA=]K!+qTElo]5H&jPK'1k3&Fg?j=taAa1jNe2P:)Y@XU!jdtr&L@B*SnF%Y&LWFoLk3M J:p$ZMdU7cu`&8<$mA`d%ik"bgBVYkA@r7hQm"jf+3(hj-:HA?HU`E7NA`?0l,DX_7Vk4], MBS?ZC<CbK!2!&Bui`,'&)Ci<[("O.#K5iU)4FuIQ\^L[%&ATgE XS3b3t^d*V[1PAk<".2Z7(=dTZeFr%RG3Rldpe1l]g@lrIG:qWo7rt:KRBq6"j>V;Mhfs#' !T[;?A8cf;fJeL$;slj0pXQ'o*pEA7k]eH=GS#3,d!K?T;2<.hLIb'mQ;qi>M=3*TD]ao4[ uC*_>6apsmrsig#E[]$%#7=ODr6cIf9H(iQ$Glb`1Uq$+?p*=E!=m@LRkndXB*=(9(7n5n9 :LDJp<%V>6Huf#-H5rk^EchHH&?aE>PPC&#f"8R.2gDHFFW8^D)R,DT;H<7h6O8#9%q*(o` 7AET\Wg8$i(o*P)e+E[V^o*f9c\+\1]>JQQg$VmQ?Q,mNkfnrG8Is1n2r5qA%"/#p4^ikKO &`Ua;$"er_b0LGi;ST@oAA#\T0I(@4S0DhF@XsT 5M5U0fmSEDoOg[/n6S`bYk4RElTVW5B2/$u:Au'hrZQ7_pcX?tRHpbLFYDpFE&3k022!)aK 5a55GVfOG?U'$DrqBXrs'1$[VY/Lgp((O'n+?WJb\Vc@Is5K(LM$RQp["s]"op7Y)/Y$T@t RlR"t5!B&r\da&dJSn6/bXRA0r6'LI>S`3.+aQ(5bQ@;4-ER4W@h/<@tU>WOX==ae]W\<45 ^YQ:rUR)5PPp17V'O1O7LDGs@kHB@JC7%ZNoQ;(5*0.qJF8ACKg$$C+Yk=/jbceZ-T+]j7j D/62QfL<3so.2chW_`HIg[bL4O)l:F=F1^7Fk]MdhetGsun2Lgl(C>l5ic%ELEcj:Y8n7EP %$jsDQc\B1frW234e9r41g0buLInDmC37$5qe:0PfPG_84f6hJ\(kkEO/M=:`:A/Ugb%S+- &@%\Y^%4k:G89`k]8dirgu][fB[U+]tVO.[GC=rr*Ab=LWe`LH@6jL5I]22p3ZdG+/9!Kgh cDn?bbdur;XPD$j?[IO=UhC_%99T"i62?eo-mER;arK:o#HG_[sI<$U^$"3t9*T$pbKCnLR *B7$0T3'ZH2&>nt?KCge4$;647H`f\2V*642sI2t\OaO"pq7-WcT)JA%$H9nbQn95jAa\4V 8;P^3?b7_Iq.nc&L].M4T%)F[Ao.7j:9TqTh1sM4Ph)3ES3K-e,8!2C(*[c6=@[FtuLgH%h r<#;]<%SDDcu_tk78Xb)*CeHkAL0jpFH%_A(PI$N?4hab3DWS\rC'Q4Pm'lZeFbCjqan8/R8&W/XP\XmT *B%bILS`]b9Fe<<7re7$/RKebFkkZooV7Y-0\Z]e[rl),. Rg.-Bm/&E_[I%19e$kWqi&FXHTV4&/JU>-&]Ph$Bq7lBG%fO4_*$5X,nJink_sr+M)8VQ5+ >Qn-!:MA[EkK.Ebk%@F4jETrmm5@n>q\RooUSKHeFfA>?.F*=De%Dl,`r3NMaT95h"Q6KH/ JAQ%t!:1*[c%a&#C,c4I)LFS)t.>a^-k8V3ossQCbjtm!E(-\aTEF&&%L\+!8bur?!E;oDO /7g%YI&O5'L0+/e5sru]#Kn;ZJUF;r-M]RUP#!5LQ'!FS:uJ3i[2L/@@nTQC`rn4!aN3%Y9 +`"dnY?4B3Q3=!P8@1ORo0*d;)$)&mtKi"W^6ASnSiI!53&C).\=CVg!Uc=+UjrQn"I1DtS 4btfk*X2',1*SEn%)MjQL1()r@XLq.&PacD=JHVjUf`Ml/2P66efb62D@n*U3!cd^*5lgEN <;X-`j"GI#%2'TK&Sd\8EV"'`-78>g-/#oq]=eiJWLKS5KHt2+f$B=O]!MhL03RS`!EdZ_? *;#8LGfp`0ZZc>#%YW4!s%X[L<3C>_Xs=0I8QSPk(\P9"A4WV1bt:1;6ma=_TJLS@Os6lPJ7&q`+>4!tNZ/+?`?Z+UNm9s U3G1bCSPtu#:79g'"R)^$jW(*m8aK>f]_.m1mX7mao0;F"!2%aDP6h7J1eTi@Tgb9%:mr=i k]IK3"^n^'ZLpZ0bo&/KDN#A#hC-?'L+u.AO]#*h,_bHK2$U4KdaM2hWF[`[<5tA*$=H#Pd .Ku/'Rq&&i]]lJd2c_m98sONI*[L-u\eB4%TC5#H`=1M?(9R2]V63faEUG-o\CW$%N%l(Z#;CfA93l:<>H)brXkC;;C@#6< ]WbGZgL\U3nm4E%b:c,oDT[Ak+lg9+=_]QWphYl?$pr%p6=9mHhp#'']J a\4<)Bkal2&mUbY^93`(f(HH>U+slVAO!`oK@bVA0:lQCi/s*&iT)LM"*9=DBNmsLc4V[Z% J%U:-TTU9P9?)`](n(A4D*c:`t;KZH,ei,!.oHORbS(aVc`XADE@7"GhX7cPJ&n/?86G_n: 7*.HUhBngg<,ephW"qds*TRI_J6bh9$RB"ZrhF,"LZ0D5@\Qk'8)^3L6@o.LM34U1N_J'_# E60K.,)'F02%jMi6B\8*8iYI[(g.OtN4Y_q!8k?^^(GH\FB^XuE[7gk/C/`d2YPPZt/m&cb`,e.:pK)TFWr N.la`mrg*?YsZ9\[V:hiS3+FE,I[6)((G]R^6@%CG=0\L2>\8o7hJX=l$dS?MNC3kC.?T*$ YUUc_+MQJl"W?_)OX_i>aM)E8D3d"YcnpJcJ?#\g9`=`u!c8:Q4h\cs!C0)Pas+O\q5P?YM ABj]nUt#2qruKZM'.[*G.^:2S5Na#3$BgrTqtXt?\WYof8ohjb@7+V$A2kuDMqe\7O%qI`[ ih+O\h5-<@ME:4kNhk9Z!^"<,d@I.9[ZB*E.4mViVYW]#&p:fA;H\ZG*?,*rE*pMM.\DS7! ;'Vm$QWT$!h\fIHcWVD"iI".KnQmiEUJ\5m)=Z`SC2hJ)1!oH10=TiP??M"T2V`nbsWPptmU_0& `rJJ^sbr=81ues/5P(WtbBfj5tdIQhUJop_a+Z&RhlfL4;Z.rBHqIIc&f-7L4&=(n^Y6S5K 7bX(E-@n.+I5?H5`V!%`0k:]UQ8%03J?';60C%%,0+)Zf;r!Y?@R0I['B/9Cn6&3tcgn2SS ;4Nf*o$t/iEXMW76hTeqn"Y`XSE)?e#<<]U8"lX.?N:P9@CsNA"%05r9/IMfc#m]i,#V>r` @.5"M0%3XX#q[q>:lu''SI)NnL.IL8BTiF(;'sV0_EFf o[:aq!dj3_u/Z$>;KHP^/"U96j#DFk\*8u'NojbcVIDH8FkrY=BSk>A&t?0*>-O:1"dReh&TAO*O3s/6-pUsaWC!B+#3F1EVQV$kT-A" m]lua&dIdP%3Vqg+HdH^neWH)(_"6`(Vo/R!OMbnLkb*E^_7Z6 R:`i*Nnt]GBK_u@nr%bT/Ej7.#[4B5U^`\1(o#U\`bki%"^VQuYJ7gBq^Ff$3^k& p%J;jHqf.QOJ0,!Y*1ANS8IkG,h(Ei2M&+_KYm4clYs++&Z?n;rl)$(9T1,'4o;^!o;/B0t D&ATdt;`Ooc3s,":1c%ESB2T?##6Sp0"0b&6!4i_m(_&b&'&_OTTj7iND$De7##fS%F)a.F FTi=j#4QC5'8R**oG@"F#Z-(41RNh$71(`@$'V2H1TF:U[E'UbWF&L!?$;qN!Eb7f`G'@BH?ECiO&:IEVl'Z!0P!OW\"9brsh(=Z2MFB(c4&>6 k9(Y!"5'PSBUD&=lk(pnE&oQDhF&f*cg),ZkoC.&[8Gbn9<)\eQ/1mo:>S2>e=)Sp)PY(em QJ2fj-klZtf1#F$O]h>`K99dCgoZ'W^aJg=,)8VR[[+S0\h+dP"m"C0.Z5l]G)c#rG:=Sl2 '_P8/q+p(%)o7aNJ_hB?O<7p#*[CY)6'rCm;'aR];=u55.l\KA?4Tg5),`L]@JM4CTG_/G- WNS_PtA2Z_aG!BNG75tPN3-J:]8-06noRX?8Ai#]aF.1Gb&/[[J d;uR*F/rr;Y@k:pBAnZo6&5plrYY^Q&0[8H5mA2l_Dn42&>>FWQDm$UX[9Is6GXQXZg0erm ;)F/CbtPh#pV\kqeYm*D&1>2aWMB6*C5o3DDpHkG2I2Gj_hnc66VJ,2R3ab&/em0&a@8&(C 2h.]ij<>foP8Ml4J?bK8%1oWQUhSe8/3t8FYT 9Fc=#d6QV$h=Fn]Hj/oD_=n/ar7Z,->Z@ItWkKH2ef*43n6FO*Y4NHgeNGdif\GEf.:o'Fl dH8h[HGH#n`p)h,J86#O`GI`'E]hfN[Hagh=GJt]@X;A\6,(Wo=J_h?R2E#SZ:K8iA([4hA l[EBF-=JAF_:BRArisD1:F,X0[8DI^97YPgJEpiJF7d1o&=&"XC1^tKf,WZFf5I0V@#Ri>8=Q!Qt_4uD-_;1LGd>3Fjl,5F9Aqb#D LMB@+5CGjSotWs$jR75m.8*1(f$S?krKpFoR>dV2D/b'1!H9V^TVE(L\/sMtk8"R)3p\)A$ ;3@T-;8TaNa9p_).:N]&\'Fus6#:QG5;O#B^n=Rfr2lSt23O9c2EQ>;SjAWY.;#`t$Z2LU^ u)3OWH#kj)%Tbn[A!u(DDRPtbGh/mag826NTpe[(Ok(HIi;mIjK&gLef";g*qsWT.p04&@=_MoW&PBfH@Sot21de0Jm+G =14g?/'F1>S&>8WI(cSI`Xb0f[=Vs5R>.KC!]8#%S=M_'GTP&tic%T?H"[TX+5`)R']rgab $\4CP?p0;Am>'EcLV!,q;W\8(f<.De%_t_np#?"&=:d_NM>3j'gDPndYHdsD?_KXq+=2uY/ W>$0N12NC_%mSIM2b#NNL8O^)!A97272$#2OO_o9-X;P;t@]JG6UDSWeDo\[akf)+hEM8!I]Dh78f9\QQPHA.CN,Q?L 0Y>KDk5bRf>HCmfL63I/<-h%/)kR(7pbHf_uPO1sB4Q2-WUS$tNOar2DX&f1eAfrMp!WPJE ;,(`3.RCg;G^VSU@_>GU">S[k/+;n>0_`?8<0mT=Xhjq5H(tVK))<\rKl7jG,8GW/%H2kjo r2,#n(dTJ[@4\onpXQrce`Mf-i91:IoG^'.#f1Bh?p1`TmBGM$'23bY)]c4 INS(q,MW%*H>;OsE2mZe`fuH2e+U/4Y<""6a&R`rrJLcab:YYi]gXti"gLK$PakZc)h(VR3 R029LEsHt&hE-(nG&M"F)7WuB\39LtgPr`]0Glm<\iZOp^'3H/$/jcn\pLWF^)=MjUM>/Oi ]Fj59kk6m@D$l"iuU(jqpUl.fAlb_j;Zt/c)$d(oAof=jZDqmIScCSdLcM@6MpZBE68YV,M &@s^t]UdIW_*Q3#&@T_B+EJIYYd(NTd*A';7l6i;=2b3Q#0q_eq-FgdCA>5VBke(1E&kT"$ Kk=QV_Q`LauddBF9O+;)G=&qKBd+Y!k.?kVD#('-#T53M?!`"p0XaFL/JeGlL:k>bRr%i+pm#c.5,*ekar7?tdAAa9R-@Cu'Zp>8 PsUO4^)prr;W2CjO.s]H@7*637;nJ\bb+GZ5S!$&6=Ud27O3*u0W$U60]MAiU]h7cW]s)'H ;@7*/:P`%!=bHqKmRl+)Ji@l'TKB+mka\E^4TSCWo#%0D5PU/C,rRPcRW9;b^''Zu\)VbsH olID?*DR!HK=)8WK'mcZo4YD`W[H4:;C:7@6f,JSPfPO_-q=# Hr_0j@luHga+bp2-^)V`o%BP9D_[d,B65$i(4/WHdcg>WS<83i`7?WckI(tTA[Gi]G3?Qam r?%sDmu58(C,+l5r(FDSkgpAb3&7hLo,1:*7=%o]"NREB=Z[`G5M6q#EQjS327@gF<]bqm. L7)*rhS=l1+WJrnj?gn*fm)4`2ul0+\;o#6M]&1_U!XE','C6-s-a#sp>A+U^VU]IO'lj9] c[OG3m&&B#.p9+jY_*)dM>;++J%7BqMK)+F(c@i@i,Zu[/+EQ!,C8$W8I+\0s+6o:#1393P t%jSt>8[4kP=7kT4g84LSJNd7Z4)*a)UTqTDF;;WG6aVX/g"3`j;d_ HKMiCC\n=RZ#"b6bHl$^7anb\kNVbh)J-_/\8GN2kIYWD`p(0SqqgqYDu982^@6LT$,LSn7 hu+PR&ts$,9o*D\6n Xr4.+W4!_f'bUpRV&2i-9\MMrAp;-]dA75%fs8Rq5F[G8fT:gj8@6nb.APVMUU+(kq1un9e RRa7F\n8'1FOs'O7KIK+NOpATPsl1oeCa7&tUhr/fMK5l,\!MfaHE!cY3GRX^^/.7"?1'Kq q+TpYe%YBd3$Ge\R#%3h?&KrQELd:r#KHPl":m)F-=A]C`<$m<\VA@%Y>mt.p1PP>L)+/(O %H5esLQLL;6K,Wq_Pl8u@4!0dBT!J^<(Vq/+t#dgT+b[e;i4FQ.)gG1(*^+gMihm17B"$=@ gl_';3it,GfL_41hqiABIng&U_JAfdL%+s3_*lL*TPXpO-/Ed8%AR@A-@OH;AMJ+5c>+O>` 4RS1,_]!*@,03P6iHZ3J&uC*J!LEPB(D58bkLtAF-(U&s?*a=]$X0<2PqDVH1jM>qBQ?Z^( +4=\?N;(]kD3(kKI<$XiZ5Ad#u<1Cdng&R$:W^mYjc1e\2%(Gk34d$dm6C/&uO2J0>MRhK[ X:"d?A-PYI.F,"^1H-JB_/F/i?Z>9i`'EcG@+J+eBHP-)B4_M_1T2YH2cgh>c#oHkm@A#fI no@IHeI&"7,aae4Hs"PuA>40HM,ARJ7OYY^UQfYW;5ul^b;!Z_7DQK4>#8JABR:Pm,fWaI? t/A[0;_^u_1iV,C5kA>H<*j9s?.FrZKp]ha\!:r>A]]5Kd#f,r?%F[Ki4q"2n%O"cqHnC--C7hp(ZJ7QM ifJ)`IO:aXA+LYHjt[0LgV!mJYccJO+\EX'>djQ#iU.[L+p%R_jG?Q@B;bME=NU!,Fid;N) >IP<\).V[hiNO@>o2NoGth`dCLlJk],04a*?bgA,Lb:EUH38)&"0(>`k0><^q)'gbLqb=d3 r];fs<%9ES.b-c1Dc'S2?_$?r$2o*`ge=dLm*_87dW3:e,b<.>G;qi$uBnK$Y#@gheUra4f 6c]@NYkIgbdF9[BDqA&Y;kQ(lE<#AI?D2ZhW%)IZ;U84`ofFp>jGgCn!c;6-n.VT[Qf1 L+b[ei*Zo8!a$Q>&@tj[J&2)gRD\kD8!]n2-AVb@cTWQ$'-cmi#S4.?qnkugUq0"nt"OeH> e5p^3@$^h])!+MBNB3BE\=,S.C6k?4k"5r%A@l*MXc-E6n&!SUc`RVESa "%3>WduI#!^03_db2:F[u*\3:;CB?Y)!18^SnRKc+N(^%juW-n<4F8CO9C!^3ECgNm+6%r4 :Pu+K/1T,?/U!mbY>O%J]jG#r+19CL[Ze]f1,b^c5]+o:erKaoo+`J8K[=@S0$b"[tiS46r DEs"t%pVmV_d2pD7X+$:.a>4r*@r.u ZCo+[dYH(%qBhj6#6;U%?n"QPa126As5>)24Xh_&+!WIG_m8"L4"(=FUp3J'Ih0+7&kIZh8 e)iVWYAmf&Sm8.=IBSA3\Qs.B&c5PtLH$*1CG;DLll5VrU!>Qhi)"[Hl.5^WaNN!DV4#XFf o#"VSm'.Pc"f"gV^5l&nMM:mWF:]f&""%tF+*#1b2hZl,N"UKM]OEJ>MJ$XZC#/F*C1ID?6=!D?T#\m5KGFgl.1VK72SbC;J;:.3T,`8"-W$rAnP;ZmX@\7APu9N8N,XBJ]g,MFHih7IZk)l]O^VP=@'c`]R^"6t8\ZOuYmp`d3igLpVl g175\B7_>).bF:uJ^'nu%3Wl!8'Q?P\U+.;<%B?4Vg82ArW4IA"7soMNN-;e%X%01l._mop 8Em_W`B6P;%d5d'5[ZYmZTBFa&$rW);S0Q!\k$@e4.M)ICkrWX_CRLYaLf:$'TGZ%NQB>(8 GHQp5XYf)3.u%ka8CEY9R`.?`WjLN"OL_m_obQ?bK6QJ8Z\FR\Ldr_;$NN<8c-uZ"4TpWU. Pih8f:)%!)eQm5D4Pu4fd5XMqUdfW(NQ4Y.NQ5bM>e>hA0cnKqMp>)rf$RoE3`HK_+A"9Ba Ptknj3p"JYlKo)JjE=MGOZ-dl32om6isq1KFBM#h"=H:p-Rj7:L*Xg![0q\qEs??_t_Q/HbcA##(c679NWM>"Uq]eXWCg0g12/9a6QVeb lFJ%'*D4@?lMI9&4#Mm:AoK@tU.I"`1J.-"rV^8-R`A93l@,D/>R9l9;Q@"#sI<,eV_K]N6 Ytf.i0f)tM3YG"bn[9Po"*D0T-QGuq+mYi'F)J9O]+ITPod=8dY6pjIq5G>13MbtWgm9nZV SK@k$p=ET@#G[gm')U4h29pLZ3U^r2V9S**S5ql3Q60 -4l%g,E.,!SZoA>5C=8fIR(-X4jDV>:N(\_G#LQ$rEe0:qa?mD7Ef=:'T?'Jh=?]9b2gEWou09u>[f:P;7F;8jI/N>pZ@9>iXWF6.G;QVErQ(q2Vr:1??PB>eN$R1l70]Q3n6B"btb;V22")Ce-/'--sY7B6W?eO?S1nLq&Fnj&]OTmY*aZ]%KbtZ7G:PQqg4Pa"F%927+j^'.NF#$&YJ?sX)%gndVRV cG,P>de'HD6M'(KRdH`QorQ^]%9+b=!em<7N DR"=p4ME=2#d9%=;P"+CZB:@P/oD^fH3BCfh/p@X]_7N[YmnG)%2L=FMf'N\+@f/n3*Yinc =u%+#3'=+\,Df[_k=9oOfT9*'ic"irk4TQLIV2m\IcT$csIopTCHS)`V#A+c9neY$FnT&_2 iZuBN.:a:`\63HnX>(0"QIS!^d8[U\VgcqmJVJTS,IYCM>L+UWY,Wqlqm>CV("1oUG$S^(?!_bgDKq$BfA2E8kI b:?VZfcg:L^XQ=#*,hk$3LGVbrd3)nIfl+W*jaQnN;;?k6,K@!6q2?W4 c")9Fil8mQ#i)5iI*F@QqQd:;CZe_/(a>RD;&l0OWR?.I:rmC jsGj#]5;E6/r_6m(UYZc7j(kb\ZFd@c1r(\2'U?(LpK&=O,A"-qjYtAqa>8m0GHe-uT;d7L +0YL.-ZKMuGN-4#=lAA+&8bro!2CiE=AKj?DX82W\I"9/OX\DLP.EL.^m*kurg7jSi3J``I '/mV^6+!]Eo`r_r8)@"tU0JYqmRhXn_LC'-F7jj*X4`qa2[qDS[n"%X:RL0s'K+9d9Z!?6a s+@=I&B^dWgn31Q*:BNPQAH6+;";MedhJD?;$,p4h!:XD!BGlQW/nZ,."Y_ccNca(tct?[/ kEcm&58@h'(+>c#kIoMfJ3IW%h.QI#kPa48!7PU5inc#8;bi-h%YjNiL[lN3BSb^4V^4j@4 5\nb/GM++5[`IV[U1)lL?gf(fsO,M C]u0FG)r%>=+PT,Jo>"K,&B>m5 \^@f)!*WZ,HG.%ItRMLJ\s7G!@IU1Y5.k=Nc1;$K*AP)-u";>+9dQa!A2HIn3d8C"`Qs8q1 "`VO-ZZ+GUJgaH+s]3`>]!e2h@7+E:[]G+>j7f&c*oGnM_6R?PN?4VKuUGnUDDPMNi`MCN7 B6HG/,1TOEI44GF+q?9=rr:F#EXZ?m\"E\Fe+QR(de[Ss$g3mT0p>a4I0.M%i,Eka7(cRsS %/GnGABjWUm%l&GR1Ai:,F$DM=a12%S2S;"EeH%jepeqC;4`eB]I':acU=h,r6%&,dr;T*3 !oAVb<9gSloP`6$=4HkR@6 >[SD*6MmLf4@Vp&c'`D4]JK\:"UlG;F]f#Qt&0"+i\mcDFMKkepeqToeJS4s^eu6mC#<]N- a+NCRJ5puI#i+d,CWdO@SM;^Ylr`p:QNdU=nubi[AW`6rceS^(l3q=Or=6_I:'/He@FdY'l sOGGB/6D%,T<9i!``E'@^&u$eltS+eRu;DCJFC<6&W=VTF*e&=a gL_GITg$c&SN%LTq3qr85OE=>DN`6f8r'#cRf<>NNm#i6FP[d8J2ictSFWO%mm"$8 ";=o\faKaCQ3gITrk#t?>FIOZ#;N.S'9%'65.a&I[[4]WXr4+LSdgX>QbgR9R14APLlq*!'QeH%k\"$lKdN2+4C6d[_Z'h6T8I2>H%eeht-T>ZTD"H!T%PeU_&Z2>r5*ck(B8pFnS2l_ONP0:8pC55agt*:gEnrZ;eTTa.@1ZiUj<8MghRB ?KH']`f#$[#(!H!>E3!KPq*=d8$Y?^n-BnsmHHbjrF(1!XiFmm5:l>i@qGRj7_OAIjH6PL ]?>B3j0`*M6]mp0G.Ag\5""H/*W"hgaMX*Zp*qpcYSf;Aj#5E+aHfGFRdl?B;)LHJY9tlMD X[[I3n0Bkh/fAI1lsr4aW(o_fk=ch@kP5hI:`i04t.OBr70Qn8N8`#F?U/1ui83Zl@$_1[o='#Jln$=RHnL!Zt= _Ur9*iKQ3S0]!^8Li!W1j?&.Dl6&IHK+HrU7>R'I+iKb-&u%ceM:"407*)2"#sj'8 @95mjB[\kIP=5.`>IV\AW5$.1e*k_)WP@FNR>I"7i9$%L:F3$@c0%4Gk2t$e:!C?r]S=>r? .m=K94Ls6qBla+llmbOchmu8JrHmjFib\;H?I_Gr6nDjI)4;DGNkB5q(glV3FlH;G)47+9k *'#K%*FK#qFPV2VaHdahYr8TZ[T^bQeEYUPPdDAd"jW0kurCCAMI3X3[-*eV+CO4!_d#<:c \jJm#/H*U')jP-0QC2co#_`-`mga/c/TbLY[3bMkjS^X`cPTbE!6+Ge`iOlTpP2/=FD#Ku) qL26:"[H`I!2.Hrdf[?YBr*V_eB4:[>&naSn9>%%S3_]o=&@:b+r%m&%ABRR;UEBWWDu!V<; NFjC8Fb,eP-(%@0?f"+tTeFG-FqL`E2@CoL9,.)H*>J2$2u<).@nC$t.!h`[G7'Q.ES!C@P U6pgOWjpb;s\!FVu-RQ;79FdE,-os-Mf3KMaE7tZ\2f=!@;p*)_RPpD3/95!S!/iU \]M_OgtSNEmZM6YC"5GH/%'PpcB.[@&[P1n<_72UKUB&S \#L2pm!ak80m1q'RFgi.o[6S5u_QMZu;r`dS!G;*UP`L$0;@;KCP;%6#bkZmguc'c=(k8`< JZ\EPHg"/>G9>$H#Iur4e3mpFJb/Jg.g^b@88?1 I[tnUH2)+jbTmAMR1eNg8r.J7,m.8WKCEqaCAh]KFf)Fp]$FSrQolBY#e,\[r[@+=X0D:5` Rm6o@Vh$`Z?Bj'g"S#jCu(j!a2%TpOiqQXS[Gp"k2"eHIrK9GZ9Pf@eJEeF@d]X_]&l3Ch- 7@5DZ/\/\#/]P]?bhBSajGg^@`Bga=^,2FhkL4Yo,l]+Reg1^Gja1)FE(2MkNlU"gFj.K(N /ud=a-(r8cneO-!+C5KLAG,NRX7F3b=r4*b*$jkR52N,]ODa$>=he..+PNcdX5h`9kis.=B Ns$A//-Ks8%UfOX^dJ?p=l('rONNfVuL58\1FFoPl0sh\t%nl6E40S;ZCbrt20;j5iST^H? g:KjjmG5//e'Kp#KJ3oM_CPkJ;$mKm%:nqJd`herZ/FoNKW>"f`-?bHiOiV-'1+AWSq&iYI &1EFh>bZmZ$IBUGhEIu)mK/W(+M["J.j*!8c!p8l9/4Noq&qKq]B,1]n`rfhUgP0:Nc('hm rKQs5/2GHg8PIVtcs\j8>#oncZaB&t_,Gr9p?O"Lr.YU0KP^DmB#MceJ>+>O723dO"o0jSX Lonqf'M-,bm['0iu#rpShD"HVs_iM]J#J+NY(fDY`"fFrfW%cL4s!;I;5$NTZ*!_>nrK.bCKF&!KbThDU.ckcS9JWO`qVhFVk>tFJhlV/Jul0&K&oZ)%i2 PnXCCdOEjPMdh/Jr;6&(7U_1Yae.K.Su9r?%1%+Ar:aOoZ]R#9`REfKm(i!T)U0+!M=B,#Td4Ot.`t] H:SO*Y'&4NV_V>59mI",LSq)P"-eG73rR>,r/44_(l44$C>0P"lYg`!1;a'`?eE&O9(^a@' 18R63U89"Ytc[JO0M`ALIS"'juJ-!Gi,%L_kT_jR,ShP,BeT9.LXU.kX`]P.KcG]]KjB-R# W(i5@'^K]inm/Q1%LP0kl0f.H!Rk`3J3NlaBnZN_u1KQH_ >;d-t2G11e_%HfF.e=74>Xf9;p.:ecTH9t4O_^l@/(H:mLK>@4qm$A1ZpsNlTZ'I5= #,W6#I9"p(ef"IR,_"@8IW1q`rWX4`hK+<#[u"*C56O&jZ4,@.+3i//E=^6W>^+PVY\62ab Dp%cI.N<(TK"919Oj78uuMPZ'u#ljnY^%\WPc<,"gDCI\Bh7[/!1[!>0kG=I,G7Y'P1@;SQ "NC^F;8Pk?U0S`5nECoet8^N2%&<]f)F%Z)1%s5'L@,4G+&/a?`&L!?3<67gUapn!_%H.j9 <7ajOfhKuO%=o":5n"VRf1sib)'JJ_!M0k=0H-Vf'#CLX!@q!3%8aGC;,n5>TdC[coFb.G; DfUq<@SK0*Z@MD)?AD%6'Pob%oa,I<&"h]uh\DB<6n+@,;KSP7 t2e=&j'=Z)7C7aMjH]biJR(U^#AQ)@g9V-=0CcX@m@d@X XjR9T3P>SY:a*>uf?ZLTo6%3?-AU7e+>(@6>6SYoQ*$'*1[3 )%q'RA_(@'Q=jg\AS+6"'qhM`6&lUdC`1&m$DF8_G&_,mqNt]A'gRI$ZA0jZR q`_2C-YZ4Th5N,0F;0@(EgC@o!N8a]5/+dCa(G]P.th]_een^#(_@<@!Wf$$4dd.DGo5,Eo V&glYd8a/oukfP7op!rGT.EE)u`QJ@5abWX=8c1nguXTPJK_+)lEH0;5f^i/'4u0/AkM1A< YI".0oJn,m)t1Qt)m(J"R84qV]X1t-]Mi;s+41(g/s2=kH=2eRLMfMm^0XHa#=.;91T0!jaH.Sm=(T2T2X*YY]&p(TFe001g+++bH%k%NDoCY:g q*3@05XAU>PRTnm,CUHDIQ,/n=2#5b2+/8P6hg=BfDC&!rI:16J62o(QiV`i#CuRWJJ]1jT _8tKNEe30'L>J526.P5\f3pb'EO@-i?T0]rXsH?KHTarTh#Z%&/.$!KfDq`=BgKH?\N`7K] +`t@2"B_D2,Q=LHso4+Z9fr&Vo"iL\QLXR"pHJ3">s"M&;M731#KSOqY@!MEqc132qc8h@S X/MZH&#Ge+I]\VoD$&E,k`_$h#[bDc5@N>U"O\BGD5$l#)dN]?!X=R1tIe.A;o0!=BQ%$]t/nOVn^:!GW(;&f4[mOuX\K=X4H-&f6)H&K*BgGr:eR4q.N&(T*!) q+6ge&!XV%Pa,`YojsE!?>('fsU^i_7"C"oFf!"=gaZbQ'[lkLR@ap' 4FKOfI`NAYF5'iRMi#-&VbE5oC\Q=iu',*#==K)puJA;99g*ck A;8SlPZZQ2dH/j9i_('35iV()NURs.>_]JfqK;5rW9L%qAcTA""()RMV[O'quTbMLbaE_1E c2a^k6(UKTUORQG%G]GVk/B\%*8qFdWQ:S`;8UtShF)HUN"L)FDj#f3;PTY[If<#OY0$c-W n5[A+_SZ!HVW)ffE;NM&JF;:I%(]eL^!JVD@a)$'sCg*`PqP]llH4iJd(P*P1g:+,o\Z=H% X;]-[qTGsDc)dA[X]j2URaJ41Se5A9*C1ANiRST,&['jXY57anReO#>oroA3YWDfg>77[)& $UBoYhKnt)],d6)mUD#Z>)=b:UHTg[+eNeRo d#PAL[:Dmk"6[bGr6)gAdGHak#?\6FHmH\8htO0h0l$:1m(J:K6kMn0ji\iY n_S#MHi\hn=Bs^"_Y_)s=rilb=D ']`EWoA(2(J,STVi^`XT3Hjd_c+;BA>!l7\E?pVW!*PoB1_H\>&S0>c)-c5d3_]1?ETah05 1(h;@`#M4a4@d?F9>qlB`EZ3XHrJ"S?cCf1`Ooj'*,3DtCW@E5a'arj**Z(L9#%=qKTV&hXYI_BMb?Jp#T[4693XnA$bT+UG4NG\$bKV$Kc! 8T>I+-?1hp's:c+N5b*9kaRld$R>cWok`SFb(>pWqXtclEA;r8n[Np(Uq%&4'=D>oD%<)q# `KdTmmASKlRr((jsP(1A*l_.42[!#<=2&0Y-&>tNIm/_(k;eQjiYSQ"(P=4Q,3'B''/@.Vi 4n.24*f,]"c4a5N6He9?afNj!ZI=p1CO4`9PfY*X)*LYSdS(\mTg0L9&B30Zc*Z4tRgE!]V 4h'2%]A+F;gg.\MID?D&-lHGo'u@N@HQEG&)eoOrcT%uIHU\\kPg,FhM;eQ?k;+Tkrt6o?CD W0q1Lr)(-\S[Stgr]p(BZ&lN(M]I_16JrXto@'#?sS+ZpIt[Hubtm/GK$+ZgB`Q5a/hmRFJ L)<)SY//3R%mlp:1?MY;.7N2@R'L)]hIg,>6%MBpM)Z^ol_6l!NZjk2tGi\ o)CN;JHcc&#SR/'oK`NM5=c]CrD6nq&qQtR?Wm&188EY@h4Z).@A46_//V`4pHNZl?[MO>J +nGFpYU]"+,BXKMtnHOq-T3YJ!9]#TD@B>q7ij(+-[@G5T.=JhLDri^UO*t]DNb]r*R5:J& D2Vchu\Lr4gk^+5-T9Ki(ura((ge*6(sC-Cb? _?Ld^4l=Hlu!M,U_nCPHqS59>nWjAK+hSk1>o8nF0rFK/_k;lgC!jV_J`UaN#e;p!hgJNoi (W0A1Y75gtm/!@koKf5PuW)W%^>)cjf=K>JE.M(Ge7:#Qb2qV!I_c@n5rpB*s[Y?@^-c_FuLS'a^ame*2['pREF[`)9]@sme;4poU9&DT 2DT;0=Uhep%ApWkEd<&8B0Vs7k4JKj:7#%efB m^mSY#:g^#AI*qu0q=S&sjdH@;BGGH]okpjE'J?]X+/q"oMiT>1!j!'d55P$!TqR6hV'n4X Dt6*OlA"i;s8,mZhVR;,WS7Hn8-QmKPX@@)TqLgH%f,Y\oinPiF&71jWC(WEY4B,O1DN,KV )&[ZU#7re0D+@i^GIj%@fZ&W3$B8PJ]\$C+J-qZ7ZV^bW$l"%#h+2$HBEZqV'";7$'p=U50+: __?"XXQnA1rVCHe$RXg:/gg#6W-ku2+LTp[7+.s#BPU+8Fk(P>;3gfu?e ;&-S8+5M\aXf:2H?)U=giIFBNd&^$FMHZBO(=HQ,gG\0.Dd53fa)G:M(!C](pJO7g)ok @HGFk^P2I[;cV=l-O73VP//k9bUm+kB\ psVs&GuQ`KJ!rn":?HTpo-msI>%i*Va9">'uZ0W3OpI@jTp>EpAbHs-l3)0R`*dNA5^J$L= !Iuj^25Sse-i%dM86Sq4B_>%]8":p(q7L;@?.0X+d(J9>TIZLDHpYbZ&KBIJlMbq3\'g%<=,R(^&&;%i1#9d&"_Z6EaP9OM\R@"^ WfVrhM$,XqBJ/!\+TdaGVbW/h:2WjV"S+CfB:,8[e7L7qf,<( ;bkD52&R)kqhb('U8t30O-6LGXt3CJIt.l$NR0625_/:SPsiY!=(UF(c2;Ge2iF`C,JM\'d V>B;7f=HeK1^1^fq/]JI5?"-PYRA)FWeW'C,6r%)U(m"iu[+@NB':[@Xd,Rb:jpEiuK0Eir J)^9E>r@323!F]>C:?Yf=a94RI?O5VcF`f.R8'(3_3Wu5AV(o%pX<@X%1loX9spCW#83_2= m+KY3gZaPJ3g)EUrfarS;nk.G(93H"HD6((m=ADGU2ddZaWZ*0dH-[AoDXHtM)<7]?gLqka )Y7@Af-\JlWuH*IFj42daC_nNm+qgmUDFRrm7aRk1G7=fDls"R9c9\age3QFZ\nEN)qd5)D $k*E/JP:N?(ka;! QD$pa5E#Is-:\L/\6]U=su8ELiMV\*BS8O`o/[gY,t'IP&1/])pXX;QU9MQpt1l[eF@HrgW##hD=dZ7mG7;A3BS`qU4U3l?cl*-T9!Q5p#F3N\(I(=D%2MQ;D8StTghM`b -QOG9X0c&Bdcmf&Vf_'ndrF<9$o'&D[5G2=(;EjaG"a:'0UNehW,0s8#.$eWn/^-\?!luDl GU=AeuL]1&+PH67kTeK>:2mVXc]p@<5+_5$=Z\E]6EtWe_:mdA-HC$.dn\D-^._M$JXOMDg pl`4.C?[JLhe\!4:@&"*j8tHbDA(p"p7^HdA,S5A0u5fK9Ci>XA-KLS4/X&U7glS>X8FY7J dG7u)(:+iO/b'g#n:Xrj/ ESTDMjc[#&\TEA/"#2V#P3]#A'iijS;V!'B6pg;>"LHJSQ81R!7CX)[aXED7bf6YY/'Z.X- FWR83`diol\c8;q^=h7=TXG`uHY3"8RGE%.]H0GqI&/"J6>^\#(?*kAl0ekU4=>pRhBe5g+ Si'#G,b$.YK/A&?*#oL[-btOHb5j9kBG5F+)l#>V$i76gCJJqS_qqC^JuigBXJ^pggPqLpU 0_H\+\\ACu-2H:bOV^EK3,(Hp-*OG?;i[Kl[""mm$Df^X)N/6g&k:m=;Df#/M@AmADG\RVJbV"T'2WS6.O8l@Ma75?3"dg\B&7#A7R5on f^dJ:?;&k`b,na_U5_KEYPR4"7KEm/)^O,YbBP7RZ0f%*R"Y^ZQ,H8L'YQ^\-!te+U;m&1Z (.!#F6$sHB(fuF<.R=uW"u'\C5^8'OEBpR%E8[&@F:O ?YS>_SWXt6G(3'`%@bm;7.pr]Tb+_N%p_s:BidP#.S`/R_adG+Hjf:L2^]fUZo[kkD'Uo#E 1SNCLOY%A&:Vu]ket4&mVks@&=iOK)e`]_ed$97Ds:;VH[prnnL)p.lS^6`5CV'bN)(@:5# i32gdX"PYoC6;T#S72q!'WfPlT7F,-E6]Yls%PZaI(Jqp"E#>f,i(hj->$q9dt5g3WTr*`% t@Bu86Ks39C3#+[=B#!,6^[,WfQr*m"P;u!q"s@54C]qO1DT:aUK/*S&=pDsAElU"Xa$A/[ J9-HE@n&"nNgO&TBHa''m&S36PM4GJjfh#@Y CCg#:O6&A;QJ2@g=]-`C-B<3REJQD[,!=]di)6bb`D!VT@/l4aYhN_qH`e7S:$Xb.L8;b3j lV:kbU\*(/X;9MN\U:J36690p]RQqW/%@g3(073nSMN4I,b\3@5#YW:L\jLras@0c,eLG3l V!*t>h?\>_07O5pr7)d3"`_9?V##PHAFD43taiq(.Z'uZI'EUbr"igbkOq;Yh&7(86JBR<. bs^'g!,i'<7SIpUYh3WC\1s[2=G>BXaAgs2-rYhV8OsPIc33%M'S8,S;$CF2a4W\3&7u%>G 6`qAbuEoPOt4.s\OpD1b&lsX;nSl>.#$;i"hRC7+?tQf/4iP,a[GdC>kK>knj;u:acuSBM4 ;VgS&rgh3R$`Ii-'mdUs#"6chYq@(hL+6X"d:(Z19N=Ml=%.al:XpH4d467LHc

^)^/J1pe("=^ :r2X\02g6K44t%[CIF@ea&RMR=B3n2Bj'$;Q#U!Z28+-=f9Q;Y@+WsDP,TpgW&b39-@"l<= ;DpN-IarEWG:/1UoaqriB4_)J=n;!5`g\"#;o9JXRUC<=$>5Yh7$U"4]8b[9mTeUXmpbq=1 .jOhm_G?JD_7bs+9021ZqHcpg+hmiRiM];;i@`%fOpSjb\rM(4J9'A%:AYOQ79#5Eb)12G' +o=\`(Sfn6)[,\;6h?YNse^2][Y@-!k_)Rb,ZKuIP032\3^0A6^S(@DJn(Z_!^@3*a "iBak57,8H\[L>6n^r;972/0>X>u<:\8E8m+>=3,!e?q#8!51\P;VW25,6Wlh,dH5C7Ci(\ TV2kN)W7^[:su^YeS\Io#_"4;Z$`;6carliZ(7?OWG`4-q=p0A5+XP+sOu@!s8o^*J8jV$*QX`83;l)-$+c>P/Uq:g bmE%3/!E"TX&e98>f'+!oupQdPJK8,4#K-7$KrdT0mP=d(T&<6[OG3`XEBUs7tjbalh_l#Do\O.AcCHTJ?O>WeaLe4#L\Ff0`5@F&#mr3@Nu,UU4p";Aqgm"@,]gJCkB`i?T,S Pp;2CU5;e`X#hXNUD1UN2hdq$'S6$]&:p'9:^R(Rl4eW=<&UOKb*>D1AP&l//uM\_O[JAu< N=+YMH)*h2CSN0UfD`-9T#F\6c(,.RTS*Xo WW1M9t`AC+ViXdfQ;p$PcV,AQl@i0#uW!+P&$=G-]\(\(-rq&F/@eXS'`_=o1X#XX0[JZ". 0qYg`_TqHZV,/9-IWs(S'YFL)b="4rAA?D4#g#GG9QJH-Mi6818'@K8+gRgW'\A3)\.DTLW QTlfXde[egcl6"2"DD(%@mj5?JGFJ*ZHe!F\@S%Ntr'#]$,Qs:o!rsGHB2Dm -X_aGae?cHrZ&DAgk%;UbtXRp(;m//o]Cr&7^m\DPe``LB6ltLeoK%^odtD!;%(\/0T(RM7 ^#PEtRB4V3Ea,;9G;4fO=,hQK;Esb,pF3ik0,dEu&?2R@c4rQngZ)&:b"9L_,(LWYWFD1E? 4Ym,O&8T$'#SLUd1D$BX`n";!m(5p"tc&0Gl/k[+nS01]2mT9Zd\?cs?l9'La]VGn%/c^K; 0AaMFD0,)RU)P8j$N7FqNAujJ+Li/"+q5`A4HINgN5=I.)PB(9KdPD+7l-1reocD*)>8q$f EOi!T^&Bh4[^O-6f%W7sl^8Ehp%H$)_!ifSYUB`BfI[@DoKHA#; 6T7C_:^p-A8e$6^:2,ZTj'IO/@E+Mh]CV8*mSD!9:FffM",_.8ftf[`q;D0h%rCW =\%$1uLY1n,7Z\W8Em+P")T8jR#@U7KJRl=m^aKF#+hUQm=T,qEs(:T25K*RDr.*piiPa,5#6UcjFj$-5I+a:VajX*Dr6?`!Rj5NdG:R`bS!`LU><'7/N!pA;t,%RFJcLB+=q--X!uSR::RT7 d">8*^&Z1ZA:NjHP*XmSR=Ak^>\err/8^s%5Nq9&L"`Pu@0-_M:g8U)#(Sf]E "d$D$YepkQ#6jUd%)sLrE5(J]Cl5HD%FB;.nC(Krin":0C]NKi=qDE'[Z^l!c Abrap_Y\^>uj.5UHPO!j47UAIt7CW0\&dI1VMM$:WGU^s3Q%c3fBi"+VWt^aS%O,#<27'G6 rN&YU)iU-'#H(GW'EYs0.h6Oel,(=Bl2Z,%.E_]48Q&"npg`4>t^3#Edn%?\[HnGaF*#&EC)KGd#1'8m:G:-,X+Hf#3E Y0[O'-VB:.+11+&gJgqPpmuD,P$A41.6?78L3l-+!FUU5tnDR#`^#;!8nIq^lSqt8ehB7.! !W]Z?%Tqd)*)<.M6_M;UR=`M^bst.?a-KEq:p3oHgf8/a6CZWf\coY:tkE"2HMl0WkBUndf .n/X%8/;^3l8,`o=f0C]&q1F>-Qkq<\D1XeEB')=@]7k`=DERLY41C#2S$S%hu%O""DJ?fZ X8-FHL9:uGI"!SNp+Z!&B2q'38#P0_"9aS-^.!%C*F$hbTP<"hn3RDh(Z\WJ):i933.aqH\ %=oCj+;-td%%tlWT`u(%>;u/#3&A`@'@(@!LH86R37B06';%:kPs1Dp51ATDPG::1]m,&#!?;]%m`7jTEYCH?3UCW%7&PXMJO4',=,tq:\lP,%F0'Pp4dn'+t8^uW leDhuS&e%#f=\oM/!L=4'j%`)T8ef]^PY>mMX$p"qC2kLr5ro\\TE_'*#dUn!+>*`r5>9SI ;Um9r&puqZ!B?=q6.FX\[/3g&6WB+7)-$>Si"ShWj9QlZ<,t,CpO+2. 0#+TiP^-0Lh=/'b+4hB305>?.G?KopYY5T3RBY>#GH+Q*FN#pKpqseH!eu5]Vl-asqQ3AX* 4$V*e'KcW8TJ>t8%'Vsk-E^bed.q)#\:LOi -GX%nfEAFD>*(*!Rq__*EDeFAHb5*B6.LdIN%/H&OFPNJI-?5-#tplEn;g_(FaE,06;=nF- f+4f0aVg7ri&+*.cDsEa*\]FHrnL>(XIM 2c$br-ICIgVfAh;rkC**jIR3fH_13N5j(.loe+QcU(0NYKrZAuTJ(P9_(_U#GMh-CeJ\[D" !S)ckDB2"e&bcZ63#$4r&o/:">pE5d5m.cK80;9c*9`aspern5/VTQLL"K_/2tMNB83/^,L ("$3&\!9g4+N\-LA67S(kRTh.t[H3E7fiZ29eaYd:(3/KK)Gcpe-;(Q6/)d'UZ$0Gd:Q3$7 a6e!$QWH(m0bZ`dE#BJ!DsOO,8WIeVA/aLUbfn(upWFX,*,t>^5C7QoJm64c,k4M>0Yqa]9 F-"r-k?(g.B1)&&-%(Q@![3r!QSC"&&\_2YciNVOf_))IICj,UX/K/kh^3:qA2q"<;>ME(a n)%IKc=;&HVQ.\Hh)!@$i8j-<#Q714FEAD%R_]r4!lp>sNLQ3TQ?ACWft)hsF!+V0*#X*n=jrpB':;brR(9bl7M2%gf 9FChMG9NTRI`.9X9P*ET@?H%q&F5gd@]`ES<.HTdds"J$_a"./c".#\_ie-ibH$djI,:sH1 '8Bq4iJnUWM^#P.N6\qkTZ$Us\@u3GF5Z$)HjiT^aD'0h7p`>Gdj(@H$IK#go@aL*9_HQl7 Ah=tNeo0U(3Ii'H\.)%%)9T;e,1"PHqTg7ntc;c:0DW^bO8nM@$s;l4lEX4k9Zi9RIIV?`R 5A`<-3>'E]pI@'e\?i#IKg5(shNN=&aY/Hs4RKPC7Xfge*X"[>MEfI-2qllOs/\s0H#iZ[_ (TfYKNnXso)Ve_(i7IhdMu)[$Tk1Q..K]I:&">a$gI&7c7YH*ZV+:]bRn/CIrrnko#MTKk> @X_mNOFU%Q=PRL)fqKQ)i2(M/3,r!Rj;c2.6BUBN*A"tG?,L9h\ad\j \WeOMeKQl*_P7]@mXCU&5$4``pEsPt7=F<1C"XICM`5\<)*M+hF -7Oh4Q,B>qJ9K=c-F]=\6^)1EZ4(',Bn9;*`M)Ki=<4e$d-]qt>6m$GF7XhJjN]HMF9!5HH ;*Q3WB'O4GM4Ao@0qm>uC^`6U`U)r*Y(;-4U*2COoVGhkF8"6X'KF>dqmDb7F`n[oE*5XsGK1%hWQ9:%&]T3WZP)ES3O s,t5!>WmGM9_U.bZkh(g',Y>mOoQgnm&d@SA3C@#LJ(Sb`k97fjW,/:!H=tc%msrf^Klo-S )tB9=r1H!;"ZDSfBm$[QO0#U]&114COcXpY>iFh$)W!f)\B\(K0:H>HU8 Y"'t5;?aeA+PRgIRY)p`qa/_s,!4])GIK?"&qFA5Sn2mlbK>?#buM);BZtgW8E 5h'O,TSZ]Y]A=\Y6K%&B_]@g#'fq$UK)njr=le5K!g4^j,b(\RU*SX^5UOi6"!I,#Z"pNij &DdrS3l0V,>MU>5+8sd\^"W*Ahr3EBZ5r+&rTfY1mSs/UqjmG4*W+jQ7l(&[4MDcn4s9TK, l_1"jIT](QVno6a6&<]itId>=Y\rl94?r2j9R!k>49afLi_K'Z[gHf)\s8O80>QSL]1"NSl +?.<98R2s*e8C2pqJZlg29ckY4T.#%n/["oD);s]Q"Gd/5 ]>q`"oi=r^'IEBWan1SioZs0&+-67hdM^rCo0e06T<]Mf\+Vm*[9m`H+)nc_FF#$SZ6#FZ! K\,4fD9uZIosup?eVOle'oVGqm=[E*#D8>&u=>V'2$&(_)OP"Y=+VBPlOs p&k&Hru0`Zn@5jF0$2O%?&Z3Ad%!,aCs_Eg^IP>qqYhjp3?p^#'Hn:?Rhoo_sD-Thss:oqL 9ZVc>Z)<6AK)ThhXdWg+L):9@[#Yd=Rs071Bi&dLDp M7V$R6TTTmN8(Kl1KB$T&4b,iUPhMre6uN,Ot?s`?O.[qo&P"n.Ya%5Uhk6SA.m"(AB6B9; (Fa0S=>K/5*#*]>F'e1Ccb`o%:UYE%D4r7&_+2_a0Da96 ;>oR@u,NAFE<\l((*,=sXYQQinUm"6]Y16W@1\FMbc,tek]ZS"mgUTB,:P8$MB7+3^-'"j8 ^V`%8UFPf&Q1R.&`+j]5s4A>@rbs"oPZ>hqP1&N%Dd'D.LYf#ts2apTNAKJ:u1\E+Y`=s%? 9IQg(2?VF5V*@cW'bSD_;`-F.<'Bdm%5-$#D-p=DP''],?C[`qX6oljG'Zum1*>^&%J]J!-\?4GBjEVcROC]h/]nYXSh8OJJ2_JZ_Y1/b1S3*'\R[Ab+4M@Yn`3t=if,^@V:Zu%m*f=!MZT$+BV4,2m[jVr(4Q>:ir ?^PGPp1qHU=ha.2-Fr"%`'oI=(W>jTY+*,jS-@7s3e 9*oU=,lVG*spSBmb[?^=^034ga\f^"2EuhoJsb]=jIW4poOk'j9$H'6j*j'EEhWqkJ*#A:,Ir#9rSB duIdg^UlZeK]"V]hi"'<(,!Y@b$5r]Ya;<-8Xn7D1$f.@0!nHXFqC%4Kt](sDDm""T%fK+7 A$Xn-10]S02%B*t#T<%dA:ncN+\6tP.oH\3+"l@0W#n[Oj#)3LPZW-G*lD3$l'oE&J@JJ8N#iRUpQ,F#&Z"`.*!]5CgWAZH8/"58JtNMB9 /3*<1Xr[-tRM(E?edm!9n11Jpb%g%#S'*\Tk^GoWULl##d;0Kb7oRL-lS#?(slX0Hda.)Y# puO4gKgVQiFNEt1u?US.p)]9nh(EcFg[VKGoJ]pWr8Wj,eoo5SmbA^Yq]iZ#E\O'F\\nOMJ*G0+6-ge#F[%fkcjKM'LE1%RL(t8.B/fdBsl5) 4%X,]99g1aL/PKSql(;`V@&\Tdl=3GWO+RM<2uKbj8V@nM5$YbSQF0Q'1+$,OeHmaMp0n)- p]^d?I;5HK^it\C2;=oPmW^Pj)lb"]2k_mC9^dURn@DV/>(A!YL^;;Ns$JA?GRu!9gSYO-f &F779a"P&u+#>O$\sDH^;^.5@q(l`T"kJ<=Z[D\lHNk@F)I)m<]sQ$`Li *3R^?6ZF]tm.VmQa9km/52"%2#<[LT#og.Ll#lfG*#2$VDJ$Ai2+1kqE!+_00*E=55f`s^@;PB)[!q`*ne;ISG)_d#\+UHm <1CUo/g]h9d)^3_bP2[Qn8,lBlN(@IQZTC,gO-J7!\F5TJa[Zj]=6Au5C:;"n?s-bf:**'H 22cj_%FAj3CG$+jb[jDWjk$*_ar!9?X-_1*n\LKWI,/,0b`T`=Nt#Wghi*Uh@[FuW@EY!&ra33D#TmY50:>=BB?P!V)W:OfbAk gA:g! k3f>e'^l!p>P;#[t8'QQK#XUH!.n&%cuP]Wg.[@*nfdS1UANH*LW5*6eA#^2L muI]26gW;lB_FjXDY>j2O@!q`a_dp[/9kZn>olWp"%29AMPgnT(ZrI;u!VadY\LTq(*aF+1 nhsDG8+`L2[c^^=^m74XWG2@R+;[3lp*D.'pmc32.[[E"mfM$D`F4>Q\s6?'aX(L4pf)0Y] dCncXln86GpXhj)Ze-;o^%0SJ#;tq@Kd?C'.XF1KDXO>sTQkqqd/3"&p'c%Lq_/?D=0Nb?" 1R*29(1iSnc7`RVo@fE)p/#(l1.$EH216G=7/UEfdP3DrBEO$4\)6r'mo)8+&D0N]3aIaLY qsX$dh/qk?1'noe0sF1B2P=n@t%['0h,8rZ7s3]kcY;NT9SdS$0RnCPLmNK!YT09EV#Y9YR JM55XdYCXPHRdD"r55bQam>Ok#J^V;T2^u7rg/.\)O:VdYo\qBgk1]"Cuqm#Jb^,pPMl\N= Z%]9)ILPSbmYUVrS1I9IA41h%H"9uZ?X$D=U%.jkC"7O%<'0hur_B^IlJ98Y[[tGT#_P/s) /.BBm5EJNQ5uR)9A,Wgr(VfSZ_K7Q/C`gH7$Gmc=%"'9e96J*F/45X24a].TZe3.-$pctn[ BqQk]J%%K'>kJd6R4b31)Ihr+N.*V6X3!AUME8&2i^9c_pg!MX@G[rSO:UP[?M@\4?kIR5X B/u`#Cg,/54#Kq*[n$\84XR8>/Cm8AM8J$]tN23W+C.P\K7D,LmGXquT;ucn5J[DQ%m& itQYfd0Sb5AQg'XLFXZcc=Tb@ItQFLB;>[`a?7bETT]N4[9/]M#WEbN-@[oY!p$\-!R3KHu F>N,(k\ON><[8CGi*jADX&O0T1Ub-=!]\7(+G!.eMsbO!$fr6EOiccm0M9dJ*1/CD^!eBLD 3br?XCa=RK5cOoe\`KRc'ABK^EVp280b*9iPPcE!F/-/Qp!kd&XCu\8YekSp!c;`rOAEV6C kfVfbJTr1?]SM^JMTt_?9NrCYC6$Mc@B:Hj3;goo#rmNu2hSd-:5%e+AG=Dlps3dPc\2-f+ D?MND3=bM8lJ+%]^pqQh,!?8:$fefXPcnV(]b0mJrKQQFSSa\qbWO`d%q"@r658PH&&>F:< ^VuS1MtO(=)c]cO>i06iOm>o2&":Jl":VKaQ1t$W2m$d=iLdPkp,2Bni_fb!b(5nCUP8'o4 FB8qR5m/J#Vh"B#jCK?-RdXW(-6)q(!"d\S?i['Ba@2$9)\4m`>L5`JVK&();u;(Td2/JLA H'iJ0_Ka:e7XXhi%.FWu2e!2u>GS5U).>Qntc(,p&*C#Eu+OUuK;>dB-$1q!K0*qe.;d'N` b5h]9]`:;8!Tc@@ND%d/9[gBB!#QK&^aB4l3Q`VB&e+/,;o@&l$r\']dk(#0jRP"\2,n94) E:':cqf12)hJMn<5hS^oj62Q(eo60L;7__"J`bD,1HKV;-cLf"X?u-'@]`%<+T4*rC;XiG6 `qL_B=!_h;/TKB"FOrs(f0+?%c$K ]"bdST's]i.i,mR-#9fLg-c>r*Gm==khT=gauh9pF-X;d!Z3 =`pOArKu+tho*4'>,%Be`L/+HK.qPV"h _&c]qugag&XWI!rC[eak[OMgbl!4>O>]5J)">Y=bUPDKt(?PeD68Ugo]2+:>5N P.9bbqNLc*Q64Ae_W&igi^doh:UR)kab`-gj6Wh_Y)a56!`Te*X/d[e^30Xd.J*VA89 `ntA(>da=a%L8G.q;&@8?Fo]7_=HL6hRQ<2hu3mhnkE'UogNa#>o!QL=n:Ee$*2&N@/^q/p 'G)@o\ZuUi48Acc0dXSmmEBNiH?9$:''<:o3ireiAM9+bT>8'#$.SAiV"Uf?5R-L5%(D\iM m=F^&>Tt,[og_@c3m<"sY88o?+Kci(j6"s#bti8\ E4NlknK'6a-n`-bl,!J+TL-9*K>`(./jVb5^%$>*:5Fda3jDtZ; AmK"7B'!W'1__OQWk[82=lRFoX2[iq:,Z\G@367l`m.uQnV?6R*B/Y'q/eI0on)i\Dk4W,K(3&G/dcN`?BH]Y'?=KPHFfiZ,RdPCVk%Z8ECM 5=:B$P>"`_]neIco!S?s\B+VLds&OHY-Gk7V*7;Ujo=a_5giBS-e.QB>R0MWaMaBA@%]er( b2Np&p27`Lg0nMk50Nu?6,X[\PDhNcpbQDaGCl2CDAQAt#"N*IEnl'X)9#+`8qOD8[8Oli> %_7AhTe*8ZCl:+EXZn^a@Y%KAbl+r/>XCQ(CW+Z+#BeGJ2m^6iH*pWI1l5ghN(9sYS&nRr9 lT@LL:;#]>[VDdmCOBCQNjb4%X6\boB-tQ5Yg)LjTcr:-1u?"bB!TAsV'XuqCq\?b]X_f]DO%.@Yq(ujoc><$$m0)rr'&d[Sg0Brmm"=YfIGo$Te7uG'D1areY2 O8KU2@?\Q6+h_Y2,s%8nWmbB9e8=53V.KHu:KIm8^^b:@XKBfBp,,mXFYDE1ZKhk.F/r4B? ,ornbE@hkSc\msV5(-J#Vko%Pegn,ZnaB(aiKfl-<_N/%,s6D!Q(8FF<"n&*37dQVU4#$JD 7mT.>H's_d+%deHBm\]/d)\oPZRLT81Q >doG0i8s&F3WKCnV+F<:dq-W(b2;KH1_FZf6f:L*9G3HVGT?B84]D_:X[:NXoep.&A1hcd) &Nr6UNUj&MPi(M_DV%bEcc58p6T+SUd"7S2tTIDnX:J< YB`T5F*3SromBa5?V#BbHCLO$GQu*1Vd9kr:b,mj''F\](NA(MEVOC]p_RT8O*')/KD>1Do @JdTGD:A![Rug>:B,K=JYs<9`CH&7B8$(>G\b'`pEu7$=)@WESp /F$q34d&V9jLsU0941pL)["j@oCD!r<.f4a3UrQX'AGT_WMC1Zt,<0;ba6I\BhmqYWj0Vk$ -jOBK&oq"Loe5GQelnp1&YE[I@HAtXP3Wb7Uk!*r^>]CpUCQ;X2N';mmlC9O4JN9l L#J@H"XlADnlj$kg;T^gDB.)'WZ\tdX.$*h3[PBp[]*V)V:P$X]O#MX]B/bbJ)bQf]=CGWk;E>Z>P2\h@mA+EbBVEq`SF$4J&]]OE$T?p!Y N+Y=M/Z.$/FZOqO[oooT\6Mfh?(5\BgfZR?IGX.4^Ya!S]KQQ5[/YV?Zol'82kA:YFF%4VV cU"PlFN-,r\&JLhW&j.*^9Uj`FFKc],n_":-B`OCAqQ[XPS"lV,P,N^Xr5Ns/9[aV"6^04: L^2$WGd`_2rIR#Jq%2,mh.V)[cF"&B!Z>_iWY:$o8=A.1sL\.cSj_YgcY_`Gk`X(WFX_BSA ^VX9fi]n\f8aa,6pZj[@N*Kd"O#/<(mr&kX;64-A$`*m*s-V's"&9U.-F:OHG"`NQ:]!'ef j_(j/4.Z"0uEeMsG/Mb9#2pN(qjZ1VBKInfG'(#3QcP+5a3m\QJq\2i4eI+Q;e4VA22R9.1 7nkh"+Xb>&'eN)-'[8L0dtj6V8Q#-i5uH'J*3Dud$ad<1;"MTl1/'Qb@9LgsHD=A;<@ee_f 9P`O?e>uJmoEPT7?(?q;uM>[de"iDA6APRUt="VV+Y&t(;7+5;RU/MDql-<`GsB#h6UAB(H ]H3gimKDr^T!jPfnE7?QZ!.f48H\P>/Mhm[2l?="JGAB%rB^288\(Ua"&A'd+5Qfo=tKqZ( ;2J7p3)E_;[kaH9KM!8$MUSPIo!kYO!2;4-XN+m`V^l=a%bFjuSg`Q0,X& DgZG`mWZ"tRJtgOn!ia_UM]k""i0)UcMbY_qM,BWEL[q]X!%;Zc,o>bk.AQQ*7$Le\U,\Qa `>'!e]p__D]?1R40I\qm^p4ub&:Q5A_HdA^B)gX*-S6WG.m>Zh!ogD/]]%4#E@@--l4Pnq4 ;Mqk4@G*V;qDc(J!Z*SMu7ZFZZ5/epHZ=?0_8lO0S&O(n@%`4kN0KAhDXNWZ6CblXQV)1tAgp-@6q#LNYDK5HJ A60M#@e'n,BOKJ[JL]%M;KJA3Q\cP4>.go9T$&3(V#""%'pKn%hJg][f6Y3_1iS7"]:^R]M kWolAF1d?G^(SBjXV8s9ZVdsd)o^:N$f[[bN)>Pt_cXG]UH5*(;39'jfW^7m"@J2G8g5d1d (/.(Cl_H\^;S[](#_0-MG`np`E<-`j9[#a;5Q!;`,QV>,a"6f9TDSV)^XHRCQaD62b92-*+ PdcLe41"8ER6"ADF/L9Em^Qkn,$H]HWVVN^HG'D(Gu=Mj"dB?-*Cc0BNCaP0r,q9>bftV?q 4*ZJc3a#tHf0N(',VL/^j7XYnVHXdPAiqT(\$Y@XfjQLEC19NcQaAb=lN;lk_6_)*JD:lc4 ;`d,lZkrn4:q4=q\Hr%lW5A13"TMt]=:`9^,kVW[?'J>$bg(Yce3/%obSo[b,]eUsD)4>NX dnK!p8)To6U5Sh*d@*bX7Ms)aik/D'qH6IjD(hbc`gTg5D+s3-25_/VSQ"6`:[-t+Vpu!G< '$"8W^T>qihTTag,V.XKX!pESQ*lQT/`C[jdL:O!m[76=69q`X-?eme[ijWBZ4@'<,SY^fH 2MWK[=(*MR1Q"93SC6%i9iqE`IGa>AOIFHZOMGW!]Y7C\pZ'O.QJRPiO:V"q''m6\LiFnWaWgHB?=9,+UrV)R%R@;D0_MmAZ:;crp2DrI7 N['pOh>K_pCLb6CeUjgt?gHe@^'d5hd'%9p/Q$(UDX1>[qmTmH<'P3Q^:"J%eh:,MDY,1B! pA4;cfDffm4n6&6cLjkXPC&*sS\2=U\D7BoBePTT[.iS^,ce=j0Lb-?=-Ub[4:70g-4.ME@ e=%J/9%e)&&V/jpg6]JI;oG2ZW@)(@3S-i/rhA0P=ko64?&2G/dK4;Ri16j[tCr;'>c``)B *EBLU%#I_`6g'2s`V^EXj25<0qj7r:#0gWDNP'fTq0SI7>Xc2%k5A^&JeoKHlEfo&0;N6@r ;K9(p`><:pm$]t!uR:LT`5\]%)VkLhK[5mCQkIg\aEiu#cpKL@,e#/nH7^:?Ec&68[>]d?% ZI1b2954OKVDZ*(?+P)WCYaoPRa.Y8)NsN'Co+,g(4Y!5XT`MmXE*ug[+AN#D("Ye[Ec4kg U\J5ClOC7ZYn^W:_%bgIEfCtR^h$ODe<+BSY%fh/)"+7cH*Q@fY?/B`pHJ7cTZo>e#eMeR9EB[&cGRjr=>S!,;c#(SH#7BR;-\h /^4iDW$3DM\aM"'dN-JUD_pZa8!il-out",M<;JRG]Sn If?u<7kP^I2G!7iq3[Ikkh'8]c4[%7U#@Ha90= IT`;d_C1lqq0n'Lmpd.n4^!TU?YO;Rs.-Buj?X:OZeDt*I6k5,S:s0*Wp0ED2."T6GM!3ed 5ccZHiXT&_$.+]un=pA,H NDL>%c[Ep&Es^EE+Q2*_=51)&AnU.UtF&=%h(B+0\Hn3iePn:$F&J$L[>RjqRCLD&J6]@OS '6jq$Sme&*sZ8.%_&iIfE7Rhm"red1m7u(DWh)&b)2$0jJ^\.20lV'(Jm:+r_28D%j1%8as m[Ys?*eL5OB :&;B]n$pbb.\@GJ+)A/MYVBm-WB,Zom(6'YN0uDr?[2lMn)q"C"&UI=%Ju$f:I^.35Yf@#$ Ze>.+*,O7941 %->BBI7aO"YqeV7i*Cj7ZA$D-4oVk1.`^RH9fmcUG>Z$dT%:jbpBFT-1ZSjZ=PAgB.$)--L aAM19+e]Gpm:2-h=#>Z@s]i]c^45SW]._EgIqHO!0NT'b\C'&uR5-W@k(Ui:=c9;X?jC].A b@//$tIElTT6b:gbU/Etb<-lXaYL#dhI8[)(COC1$h+[1IS%f.5K@21:$@*;`-K;NA%V4)_gY;El0_t:H.jX0aZAf B,rk8fd2g:mIK3q9CXpHD`6'i1CtWeF0*F23c[$6ZElnZ:YRjmNB?aUU@V9rZ]oHNR5(k.' ^_q`9HQZ'qF3-YqcLc1>S+G3T'AGC]N@E'"2H0aHoBAHflQ 0!os3pX-ZM?S[Ma4LT3&Dj#Zj/tIb;]&'RhQKMF;HsD*Bk0(^pGIRF>Y:"0)`.56A#_3Zq, \R5t1=17!)'eOJPA0Y=0g8\b'#5<#h6H+\0Y(7PnaI;_HhqJO]:-Kete\88ga-SFa+=92p* )1l.UMN,b(`0sm7UPab=Fc99UrYS2,*WZ g,!-n'\?,p.8A=N:%(AC:WH4q+I=qR:X;U.<>d2AqbS"j.$V`>1s0M)%7rDh7Fa<+'cg&W. cGLqqfO>blmYj*5)hD0SJQN,==ArL".u-uEXH-AF<`PgiopY\6T2HE#8j*^a=5gAp*-C( :a9cT5$9Wa>PZ9G,eZQY9?rPU=QejBLcjh8SdUrCemcAQ;_VnhdQ2YDcS+qf%k=f`G01lDJ 4Mk'AVu_M"]AYE=%hIQHO3mI:UbjE)WlXQP^97R<&giD77i7/(8AbZ"R2Eg79kG4TsW"*7O(GKacFD_$% >TlaA!fCma@O"5>hOaO6!EQaVmV2]chX`!C$H?[;V=06[*Y0hGV+nrN#GJ/CJ0mkq>moRVQ GQ_ZgQBQOB)BGaMP(fKFm)#)tT1P'BN]p_.:A@sTa&4udUX[r6uqR8 17An9ARqQtqJD_1rkjnbiJ]`2K_WY,36dJ>`JljHNH#tuZ+5kd23'X\Nd1oJGjUBV.+C3&\/>! 0pe8h4:meamOsah&fNj_W#E_lmOchM_fd_8KrKJ(+Gkeb5D5WFd$'QVnPBb-(d"RR,?"b(A PaN%?pn$qW;-b&>1,iM`7&bF]lnZX-K4nAXUP:SVZs0_c NE:6'J9BPPPE#g$b:H-trGMll#[A)?5kg"/7;Z+/.m>@JV$2jeR2qUmb#S3`2`":SkX&V:o (KqIQNbBr2ecVL!0X\oFWoFf2flVtt\;)L\PFM5Y`[W*5=^\s')hQ)V?CUU^%pN`Dd3VkM/ 1U)H.4@IP?>p`@9=X1H'Hg;0k:`N6YgXSU&@)U5BFfr]SVX]j\c]&TphjfZ2ZY57=b3pj+S nZR9;YIah=Rg$"m#I$8rYkn2H1f)PO2n.C,p5W_Nf!OF``r)kNNNZhm!K\ hd)#,A)9MZo_-m+u,cY?*d?hSl/k#gJt\/B]_AsT.=uQ=pfu:>IM.l\,.dA)Q/YKM3FE;.J m\d)jRsCgU)"1[(&E/qjG$B/%(":[E@I.aO.%-WOobm\^>'$'SX,&]tCn@]#ritR/^q@O$W Z,]\DDXgVH?``F7NC^,tkA44$XTe[W+*Z]a4&)tUjm#Trs,*rG8N]C3PJ)0FX,1>B$\)mkS d\\Yp1Ge=P!HkS?L(W-)5A/lXFr$)p%'>hCH`:e\u1N10RH,I9l`Uu1..mLeZX16pc3ZJ=C *-JUc<>&P>E4fJsI"amLA21_e&A1ZLr.iC=3QJ@ra7?pb4IO?5"3@5HaQDU$B0jJkWQVW%a jR<6'_0=N^!*b9b/.f7$ie6>MoRs)c1h7^&6[4X=j3DpcLDLk!bonW(X89uc.qj92YG?l8^ L/G\]sO3L>nte0?dOqsd*tY7*@]HUa3fK=dDg=W'\1W;3RkUP76;S5(P+ BsG)%(qeD4O']f^0OM8m06e5aQ=SR^8qn[A8_J\0[&/T9B0\^V%efp4eSh::A(1#.+p ;-hF7^!Y]-ps%XJh9t'(f4WGNqr"_hhVEX]4*@4Fs0o]OiVbjE%e&60OM^kh`0%1lLTmA*K1ag]"VI/ktVlGO!Q>lQ4 %42jruk($is,l.F2E*nB[q>O7GGm*cF2*pN->'CCc(mEP=l)$TG7q=(Jnm`qZt&rZ3c%IpB \hu1+:gp?"k[Gr>Lo'87)%\rPj/+K5doB8"$*,4)/!Us7Tn=N#>/$JP?2=lufoAZ$AJ#%--M;,e)pA_&f5 FM7p&nq<;++L'_?c6bFX7j)Fq]ElW.BWEK#Q+%.r'/a2-A262Mg`>hD]^S1?hB(;f`>DC+: '>]&d8Dh_-mn"<#QV\L;Mos(kbX+'o>AROa,Af3>dfF?gm1Lr^eE"8`^SQ<3B@UQV6HS)3i E\24I>'':IAn:F]m2@iJ2oto$k0+C9&j=o>uDCSE]\kiN$'1?h.9,* I_Ua$[EnUtBi7WG5>)b0A7T(Bk(gcZ^g0739e^9SH2,"V%kpD(ei;kX4^15)DO8og`..n]B NZC\pQjLZL,dJUg89BtS'j%6LZDeO<3:$S=M=oS"M];KS`c90@7Us%Q;=jMt$ED2c^O;0-kO;c/fJ7lXE>AQr59on?mY< bXDd:Y,10@mJDJ'mj7gn!+PceFb6o-e=SPP@[m?AXd'?13>f5tTcXGRO/\>IrnR =q"gik'fF'SH.d[\n>]rb#\F?P1^?8N[VDd/DoO*+fRjnjO7p]U,#h7+c1K&+r<7$CsPA\j ,Y%ZOP?icq=NMdlJ!_005=jZ.QlGm3;l==dc#P>SP*1R2NsAm:U5l8Am-i;'6_Rk<8j99\? QhKs3N=b_R&BR2"`MrT%OCCOeL*^b6fe4*)dC2l-(UMBYFZ`S"cDIoX+qGtLok:%a+Sna`P MkFjTB%se3qh/UXCg-^UVJ5mEo6B-H7f&*ZgQ)HQE-s#?lYG7Q'b8QRZg`2bDDQBkX 1X_!)uq;<3nVm!f?_N%7ei7p&A>/gQH="=?ug^eJ17.iqDp0,236r[Vr(_%t:(X7GA]NiDOXosV5foEOB4G.KNUKQSa&l;qi]NctEmh84(oo ;DS;iH4[S"1-D_l!NDH:crJA?Ei2a8fER*Iltbo,+p-[`Og1XrMM3@?O;]U,2](5#6t6BpR _57THNHHqrm7qhO7So\4FG5:kmBBn0&6p,ZqW`pR6'e)dHbAMD f2K,>Bb!+Xc9.M3OmWZ1LI#=T==PqlRI6ZFR[?nd,uN[uVfh4C`7!Nc!-h&M3%Uo5Sg\s3aFc2!B?HG&rMjcF?f"jL[@ +FRHECqC`QEqHKe;/^_T7cXZ,5X.rOmcd)>.%*X-,Z?H1bf(jLLkoBT4<;VC)44b&/&K@]i 4"JX(!>4_Tn&&iLjk97WFmsg/VKdS6T_n($n,942G06B7I#jcA*[e+7:;,K[ru1>iF44r$- RsMI;tBlgN-VU&luE?&mWVmTH9O(DrKk.9I\laa^Ar\0`S:)-oAa8_C#Z31\+Et`h0a^GK7 3@lp`Mui?pHKVl5NDntj8(r;UqaOs3!9+E4:!LeruIm85-Vgd)[\h]#f,0(5YLR\Zgbb H&I<1X^uQ.ZF:"Y:$GU*Z^;DZje.]ZUW5/$$Wk8O#)_jW0)*uuN5tSXR>QCPk!PcPi60'7> 1`AVWKgE?K6-Ji94=Dak*unf65d@9))h5^U.)O]R1))$#WtiGZ*((R&6.@MS3eG5;)RF5q/ n>bUN%ICb3@?'t_#,-='IL^?N5IJ4_s26Z;5HU\2MG*=-k&)QoL(#G3l;%D[SlK[bXaaa-c A\N.3q.r]Kndk6EE::`2l`[Zphk.&jg+@ZQ).sr)>7HZU:tQ7*Fmag?qAq<5k:e71<3bBl- 9i>rl4^`M?j.r)L[Ef#)#@WT7/,KNUbAAKm@C7M<'q`*L<7;oW'W,+M;uCgo`;&4:ep7SIR :qA;\<;']+=6dknPS8^tj(rj,m`lp`SUi%n#HH0!2,p[J!\l?^$8B3i!a/jb8XEGHI=$L5* WH<&Kr.H01HcC*C7YGhQg;M'+M'SmIQpcM;>^3PJK?0RC*i+M1)7i>fBV^<'8F2N][#12dM n.VpX@/&i4I@.:O2o)_aV9N/%$J_kSK7WmUssTX.R$F=01gP^askNUS;&*/Rn/4&8*m!CH2 YkLC<9\68ePf0,cF>Y#=A'O8HB2k>`ktDVb5IE+"XB8`1P&u;8U5_b/CU/H)sV+Y947/8n9 \Kbd^I*(*9n?$agr6BGda)1p)@Yc7AA:_=*6sa;8"BG%q3=`lnWp9O9pu/Zo`.f[9$b(scd ^H?j+bnQ"]1V;:_`8]]`QL==&;`A9)c,8)]!ViB4X_&)+&Eq2dL@!`Kd+s )/J46nRU#%&F+qtn[aKRUdj[meSJ@o".o8(Ud`jRHGm;^^SC7>C2jB*FeMpLLBMhJGdnLV, @kpo84]EF4`XKE+>[p\GbgRk)<,!o476\llj&3JO;ftT0\F3@[Zr7,!<)_dUAP?)1-rbmM& bSB:)[fD8;,pa9eC(EobrWl#-G=h(T(u*P/=]$JKf!TE--"g4,%95P`)t8"RYY%t[FOrs(=)E+^IXaF3HI94+1f?JbGrI7oYIb5Zk==&N#/VI4hKig3e=A=P&?&)OALfg4'fWC! 4[>J)"NEFGc=N->'h2g4UOBETd=Y5`g4d&r:P?CVG=^@@sjWEP:]>(s"\0M_et'aE>U@3k/] :mW`EY:?>YW5n?,p30aBY:Vgo\\'[E;afc!8N=>fG#oh9XmDcs7[>>qOFZ4jmV)dp5]!?!Z &fcC"+5X^&?nLs-4n2oL"(4k.?sX(GU77?Y1Bf^)u:9%:N9O@9 t0f/gOmQ-"9%ai_Ch0IOAT_$"7]jiSGR6Xt4%r/Rl.@@a6UchCgZ#*o[AZ@)a>'[NXXb-KA Di@r<`*FuEiZ3Fe(1@tm'8c73<.4_"CS@h(Z^p-.O96"CHlA,tcP*]%:Y1ZVI+j%_Vp^,k> (8S!iRA;3`fSkJ.I9Oj@iA2Za7p-Rj>;.U58AHl(E*`K(N6tBUlj_e*DhFD,-=_,f]ADUJN [T_e,?"M;fA]2/[k#CIQ<+[1LjsFMK/nAQXAS*\Vj^(DfG%]o^pZ7EAjka?V[VTQYD.^M!k 0@jVr[-^oAnFeXk$E(@5'(@3Ep$bN8:G2`L3RFeJ*>aKB^UiCrf1[sEG/sIBQfSQDNn ifPj(AsBkW._L5KZ1H0L^-kdHRdp5nOaS8$iLl0b*Vp7>XROm-JPBjRQKG,+=TUhX54?KRV hVO6Y/BPFoIlE6fF^7]5dX(p4eC>Q-Y#(c&OV!B),CG)LM-F<"rZt(5Ul'AenQFH.VY3V[^ CTal,[^p7g]kbp-;._rVmQFUeNa_TbTlgDo3^<:?QOhi>rt`m*n*fkl2lD3!?;Sc.pCe*Sd8mG?`;mb hsEiFF:Dm:OB+4u-r7ghpHQmV^csIcbO&kAH0RC]<8Zro*:Zm;C5;DT;-V:?(YAnSU^VmT/ T@53Zu\l>K/bmoK."T&";@n*]W>Dm&qT^A76?Vf*(9DslXR*qO;o!H2lXDgqfW2ZiJ4X`'6 tDmoU`D[:<3$#k(q)Q*LPrpfKq2t.=\nF$L!rrmB9&Ffu;AbQCJT*Xqi'QIIpEGlQ]G_kk( %.Tqh-1;=`-QI+J*H<_Pn`Lq_l_EmW(iaa8EZZNH0-kQc,n-C`EN^a/d`M$o+7c$GEj$U+V ^q>I/144,nm<[55;.'g0QS^F<=\L7o4=u?$/An448"qLFcU$TG@U> "A2jftFgl"*keM>e?M4V=G+WPn%r?El&bT4:p/c0U:N1LGE;'(fG&M&<5?m#E3\QBm<^>GX%5`?]]O4O]=>Kpns=#T9OT(Q$GSfGe\?FcVJfCO*R@Zq59ANYFKmMAA ul\H1.!npQbRSTm%lNGRpQj:RQLSRsJGf@#B6a0STR*6(qPU"_^T1a\UA9SICQF&CLTl )KYkijSHS;>n0<4nFXF"$Mqe*BPBq_teW^Unj=Z?tIYHC),gHcO-RJ&cqsNViIdHnWY?^VYB=b:GlqqX;@;O2_$`aF%pSI36pd(,pW=bl(nn rGTr/J(>LpcMUJlD-tZg0@YEjh0hNDrQf?X8(`66f_uuOIP9XJhUMM-c[>KArTE?lpZR%ol $e"AI95HX-fb3Hm=)h<#`%+2s5iC0k5LG,IkUAB5O&272#auNrpT7SDtng3[f6=F_*B=6H1QMYgEgN0l!'dpC5Gk.lJ?S?WY"oeaT_I.>m4>nQ!Mo4Rp =R9Wa-'?>\1>+e(=#$2hB6-&_.Y4E-dR3ZRm7*F@Vq#R*Rf-R5?*`+!p=ilmdri.UmWY0!p BQ&_i,L_]?:Q*&`o_;e]Y8S[U!r2tHnTfLGIj_#9l1TH%hQM^Dj3 *9J,10Vuk2lHNIfIa\!<,5Zr!*5;O?k\F=@L4Yad9R_[tTV%`:r>m_# mMj$+/Ed2Z!r`A'JT(<)D`-HT/ -R4$-TN2\3td[[Kjb7`Q_qS)F:5;:!='Kn1pdk&m%9iF1+1sM53h)NZcSDcM(;loLNcVq4H 4MUCp@2DC4%1,>Ie.iQ^d53ug)G?7<+\0sYeL=&;[%/dBdhLUk:=E283D\.)%7sAqeK%F`e J2;Z02(olrE.VcSGQJjh?C>I:1\C*IhPN<]'>3;3kK(B$jY-R:oaSN=SNZ2S E70l31jSWA*LQaQ()hcJ(uHsbL]s*ilC*X. /R3'Cb_>'O>LL>&#,+,=;@D67s?f6/fkj#GmMNoO783KN6(%S;amfcEqPjV4iVMr>L2$('d WNbOkmfq*,Nk8E-!T'&-5H([n,<[FL"3^+pdBf\[$d:G@f=-[N(L8V!8R_Go*lFPiWY%q5/ _6:tKCr)`W4$LorkZ_B@[V]5diOA5ZG3QO)]:)*]Bq*tG^?Jl$q5%Q4%_]aKS3Fp0EBH`+` poRK(Wc.%QQ_N.L]6bdmbH[hcLY<83R@>'%nY,ih&fF$Dd2rq7ID7;fp> +>?h=oaoJ_kWWs+aVFrCo9X(h4h!N 7!YA``UT8U,5`,d8DpB.-2FYUi;@Ac9''Ih%c[.I>`)[5W";/)It+/ND^faaGC?MA7UU\dO E,Sf^gBK`0HB]?:meG/LG#hS!1fP5"GDH+Cu7`>#Gi#aOq^dV.?Qjd]QZofjQGnOj&tdISS "aFY77d\?u%P>ZX"H/ge1SFrIPhKhtSm!ImEk+%WiJ5?"F5H#k/TX52'cAC48 BOqRBF2!'")=p8Zh%cY`>)H1'2&U&o#,BZlOAL6l8*M$;Um.F':oW2:BjD4'1d[/M)DOqLh ))!.esoZbFQ$p#-E#@ZTMgZ":[/Z`W0JA+d]-GJl#f[=:bnM?)KSlWh,C?(P=#<8,kqCLi$s'je#mRc.N;Q$'5ehRZd7]3-XII';(h^Xq3@@-eRKXYm PpeE[gf.t)TE2Eo/a)Y%@>Kp/giU!&M%e2j\]S?mB^crp67B<+8B(m6.SZ\CV)K>[*D3mT%NBQTjNe)kD)RL"!WbVc9"MZk.d8ZrnmVWJ 8ch8^t9/"i*6kGn5^"73'RUU$lt"?VA$i!9+5661PP>L*Q+7o%H-d74%HOE*WtR=@Z4*?EF p`?fW,iuggc94Q8Q[Lh\kIED2tm@43-"J+CiWLO7F>XaI++pA=SR@njZr2#U_VGY LH:Fg"HZ'Osp?-?At/nOt"QuaT^bh8%5k$6<&o2]_Q3PRIb%,IFpVK:&9b<0EBo:>L(IF"> ]4m3maN^qb!+3B"#BUom4oOa*1g-8,B*@7NRVNoT`?VG1)25^$.S^Z;B:hh">W:_L6eCpNo C7SA)ok(>Vg:pa**G)>FVR>"/hcsrfFftE"^";!VFIncGqI`O eh*7i\*i7B_VcE$?)Zn9uIuq#;`'r84.=I\50es(C`thnSr9+6E G#VtL&Hhu%trp&>!SrVt4D!"]54:^6u^$NSNa!>#nF:_s.o)Ze;-!Y?RX:aZ=+.g"'N!t[6 j:cAK<3s3ho";!p':e(YM9*EU;"V=T9:fdg^>6WA\"qY8K9bJN:C)O6n(D(U&Y]^kfH5t:\ e"M$m60ef#$ig)Da&)"?N#OQI6Rl4NOR&$YU6;"brLq[G7Z&.X@1&I&Bc$O\'W!-&VUYn d]:)@E_j#SA6_nL"n;XpG[m)ppFg!Rh^4,nnY.'lcS?OV8Fk9,,cL'bO@Z;-+Jt%2HZ+('% VU;&Tf#-PjP-(CmhdJ^XgsmbX(M(U4&+J[$&S=W#PI)%i&M;3h2i@2[?j)8KYnZ)8M%g)Y% 4)3M6E;,7qB%2Jpk(-l.@O_bYME#We>'9Rn'EIe>!KcSG/&Fn`[1$8o68.P1X*>.kj1!La_ %K_dm$K)pI:j*VK/.3($&Fi(%Dtt<7)^3WO+qc+Di,9fj9-Va6l#>W!i(kSZXoU:A%['1(% F67s3!Ae8,SENPdGF(qY9hUC-5'f8;J.1/"9HeI"nH^]OKf_KXXA.=-k[gMJ8ZXJ9-eD=,d KK=dQR[e64T0=gp3+hns:XXT-\M\.h0o<'"8GBrW7Y!/.FZOU#lchb6m/8/HFrc;5k^7p`# CQ)RA?>Ep!c17h9"W!]'?k5SYr'4YOXN0G-&Z_7q[f$S^$>)KQN.P84jr)@dE%"EPe2i))7 \K/1`0*)eTno/@iO#;aWJ1Ej^n?lq225:\@8+&c)Xdh3R-Il5&&2?:KM;OJ_,ciBam2\T=J ;\(gNHO\r?0EJ-XTo'UAM@u,5%?J@mk5e.066qCo)fX^HTfh\0k#nnTh-usiA)NG134s$mYNbV7l6nE1_V`&OrZV?:I *1A("H>Nimbdb64tRrYS8(a.KQn0+lKmu9hZYY4#ipC"#N@`PF<%^9'APK71pjJe5k A3:_:!67?e;H_4=&Y,RK]QeksX!e9<(pT1@1=&+kK9OP8Ks.NGfJ!OOXMD+d6irBp3D"#NL hF@m*D:IR#`7:88I['(YfZURp.gC-as!&%$.%kD&geU[$];BJ5B8/P=`)rV`2:;KZ`KhaJe h]Pur;B?;>qUL`!*>'V#nfA7*$Kq'2%alU(eJ?]"lV?CWel<;Z<>eI?S,i48+nK4Pm;Xeq4 ZTbW()90uF,*;+Y2&[A"a'Q9bu[^V"]1HmkLCk&2&68D)bpuR:/rFf2.[sHBi;?fg/NY7nI J1lkuc252'MSqQ'X(b7+ARV(!s-LY.n-TV)6He<>AIBm9`%4,S>15kEB-eng"W$b12cX$Iu $)'uaFCbubIB;W&'a1M#*FlX%sK&iK7BF+7/kd9A@H:URX]e[m"_^(GM*2:^Ch2:"Qgdou- G?'6F;[MN6C.bPBb9Rnc-nK&%>AI(SI=gAgmZZ$QMX[!B2APEHAu<9s8RDq 2+.2Hss6?Q>4S$[36Ho2lZ-)A^pGd%U0`pAnq:EH.Hm&W"E*ketGp'`ecCn[;C*9Umf>/&CWI/phhS@rt;5n;[uS_f?GPkMiLup5kjQl/D\Y#3kGjbAd'"L'Ppjr`)YBLF-+0_qs+`EV^hj%29NB(3^R9nG>XWgoP'j7r40r LFb]qts=$d?=H`GOC"TUih;jIcZ]84;@X:8N>2$#fq//U7;'7/(=)V,q? gId2M?ce=e&`rW3bqdG44+r:CPjp]k(&clEGD>m8Z9`NU=;eR8"#;C/Vc9t<,=Q8#N G4bjXmJ[?PVfO.&Xp#6D9Rg7oreCPlW]r+lYVu\#ngD=:kQMD0OO9'dE$M"Z7*97Sa&%O83 #!LFd11R0J0@a?2e_OU7*G=5k-e>CIh&p4`Eade+=4d%TfJ'M^4c@tkPM((3fq?UCm5mdgS \?*t-<^0eo>1hU.hn-m3M;Gn;DjY"faAbSdk_@Cq9IMs)r^LI-6=JmSh1O<0ckd##lZg7Rn M]rcR)[K;$#_?67p&oX-Itj>>8\\5kETk@+9W($iU58h?OZW$eTnp`n._tt%u&??1&RFp7 ]i6\g`SXg#q3TSRNiY#b_;WHc0U#PVfj$#C34P9Hll`1YM!?X+or**\+`ms\L-o-G@m5n(N BaXkZA+c#4doiO;%lW3He.rKA4[:3qmLerle^2GRZWXQ\WHQN&oH-FJs$kd,Dk;qi=Z!H.q Hq)k7CLp#!#'4"Z`;F%WXU&Rn_aF>''ds`a2RPOQMY[*%3r%Vp&*\\'"uT8p6(q-=PZfpcO\)BIl'0nE5&pn -7q6-,[5dVXN]uco$.N7A<3\r'kW''39.,tHjg+]@RV=[M=/)lKZ't1j!QK%HX7X55i5%Np N[us?&7EIO5_4l7cQLua=Q-Eq[F6j:($>(;"+G_U3IPSYg0EkA;#SpCP+($J2DZT[S@4N&` :IgP1gZq e4.?s;'W^LJPC*4FUX6n0&aLd\38%nap)+K5qofd99V*0hF6@G7%fbQ;=bJ;Lfjp-Q!j0+: 3%e2Ik)Yk1-k6noBG&h](B%2;%q$Y18HUVpJJ7ORh?Y8NJ-LE&f=e8WG1$P:K(7rflil.'4BZ/'=n(dk!t$nrRk7V<#?lbTo$b%*Yg=,]/j2;ka:%ZZNR*_!L9O 3[ZYeR3G-um!g/(1\$5F(sslec%U!"4u^Ai,o4e<_&OAk91+C[NW_2DT1g[<75luS.,a8b. 2(!a;BmWSQDKh2;l8iXCB83Q'"*gV=u>V5M`]8I*;6C'""eXXcmfc;=OqVq..sSSPphX?_$ r)2do>DPNRS'!MWL2UeC7Yb_2Z1SXJd!%E[)h5cRGdTIFh5hMq,1A:j82fH="(gms?NL4$' DMl<-K)0oF\s$emSpeSe\$V8RpiK<it:i_\m5=6phrn3QJ.NB9mN4WqCb"!ksf)l7'a!XpBA2rdpi.hXW X*Hn+X)nfsT,M_,,4;mfi9*V-2T_r"8@W`^g$TT/e5YGc;ahS\&\$XBQi8-fBl1VXK1D?UW 7+Tk>'@h?V8*'lN9"^n\RK+MREYG4,i+RlFb&;Cc`#9#'e8>8@XZ5#L+=D(7aqa?MWH9bji ![(=/JWMjd_$D=j$@pBW!(nCH^c:$+ 7Rs1+@5D1-bB&ngYikXNUi4@cHq]Cl36X]Wg?64J."+TIW<@'^=Ve7*fJKnV)@SY#QR>`A- 7@d*V^6AD[o0g%nps7*(9$?-"OBLP7hJ%8[C0'AFL(n%Rs;,ctt40ki5"7e;ca-2"&3%SHr -3Ub0I%@j3q#@td`:9=.LrU_u00'*QU`E<,H4S-Y=41+3ndUf5^g_3tB_Bbhfn2+&A8*ckk q$/)gjQiNg9,#3+n,uc<#&4i>pE,JFV]fO0nk#J5pq8X^9.Yul]6hASda"iu?"ROuQ'8CLl 8]jt`m0>1?lnohL()CS'9,]WTcHb[<7;0(FR4rYYdC'8g'HIDdZmK)*arD11Kb?/*:o+Y*= 9baE*1EN'?dgdC3[q9IV[T6Ad=MZ[b,!9[.*cK7)5IpXUt2"KBVs,@!B:M+iY$mj,cd+6H)`'O!?X ^]645Xc)%Qis7rF(ACH4g;a>-NtD,1g'"X'XP;>$"4BZKjeG]VC.*7Y:KD3*=`(b74SEP9F Pr6>j)ItLaZ`>.o[tH.^,/ZNS@*KNH)A=%[QtL6o-93/hp29^aA0r461!+NRK+rTf\,_1D7o=i9+q1OYfKsb0O;4^()p(s8BPdDXc`tXfdPjdGo >"V]hkdR`V&t%l6F-E2)_D`8$ccC_!eU^aR*WkBK7rNAV<'!lglM;(hJ*UX!h\Sj7%^:UpEh *m?lMt4QS5t;(?5)7NWICrQ=!D5t2PS[3IjlT2PS+F3!O)37**"*BP!^3X3mt3&&EK=9SI; g$H5DeoVs(*!PS7;2aFG;ntHgUdN$hljM!W9JCmj)hbiaSV=K6Mi"KeLCdY8C45[hqJ^N/^ kYL\&\*On*qLb4f@M;E]#!p'!h0H4NOGJ+N]U"9=Pb"bhU2K8]o/aV?$fMRp*u/:%%'R+hh X$'Tn:Yiq+BK;X:QYp!P$5S7qhW[fLVtR!e)2Gj!CES3Q`JPjldL`!>f,OP2 bT^JKm(A-Ok`/AQNB6o]q>8>*l)Z)Y>A_pG[+j821FQmSm^LVtU*0WIJs.n(^]`ACN45_5 *F`!*J_Nlc3jN(#c/9u+9!5fh/+]FBak/]Hc]60hsqqZXm%3[Cc'N9GUX5n"W%cCLW"2],[ .q"'ZI/"hGq"fQH2_t:eR`PNSc7Ji"_#n9:I!(;X97PMtS5^Pssb=5nU`6^T('&\_m17mQ+ a0^2NF=[^Y/IG`Y3)ao2/1(YHGmqW;,9WZlGWZE$KYqO92p:*t#dMAn%*(?4a%UW2>]t\JB /^fDNkB)GWE;X*EY.k_a!de"r'leGPrda\I6DZb!p1n`7U'j+M(*#HqECjan240=h UJq*"N9?fR$POLKoL6@(Prd-FM\M#@_7dD3NfB/1P*j Ouo-0%>/[QDF!B<3bJl@WPQ:C4D4@'QPTVBUBC5We3OOUUqUpRH>U.>iMSCDi$OoWW-`QV_ gMO;OVi22&>ab\/k$:$l#`&5YmU!+nb9K[pN8jc+ITXj8/N9F)47#$D#LVo(tLubc]%)%0" ^54,A%32_q%(-Dc[OaPM97T.JOS2>io1IL;&L?=m*8+&Z!mRrt9u$m+d%JVLccO\g#]*A^D !]HsmEX\.),//'&\6'BU.Iq(,re@i6Do:^M\>\TbZV:%@?mQZ1[ &P3kQXiq%m+a8U@=_VEIPCTN>KuX3gb8OFQ>PG78(R9^EgCIo`*8I!Kc[MM\Q?V(B^k0P(NR+9$:U$i1*;n!mrR'8Vc %6<9pg+BqS<2H2N9_RC!)qD[7oH"7U/2`(\>7RN]2514eQAGCbtXoE%oi&@<A*9Lrn&!'d:9US]u"Xc$]M``E8 (q:(YrZM]H#YohblU;H5;IeP#F/Zh;FRVU$d2f8N+!R%Dn@Z.C--f.aI25bM/3BgibO/"l"UJrV&L:Hd&/L:EpV=H-9nW)S#%e;6KCX$+ld8lN7B 2'EF!\F?L8U7Al/K-d"H-kA-ReIE.:]H)@;Km_OL8]5bE7jXi8h3Ns>Q]TabNs1rq-!\YO? -]Qj:;)9^Hk,3_$jPpcJ.Gc7tn8&V%VE4?eX&Uh"B !j9niWMjVO&HM\R0<`NQ^50oNOI!dI$[:L)Am3_;,Z'iN [Z0fT$J*U"*hL_13fMJ>"X>M`nm)#,=#-SGC=/>WRS&#o-$?kb)A`+Je,V+P#$R$c%k@/.C g2im,s$p!2^Tc'&;rn5mLS0^MW0j;@\sRjh$])m/.Vq\-r.sJ5MJ`?M&_[ZZYM]tl?m;1OZ3t08m,P>Xj1qq[e%oMqCuZ)(@j,pR 0TD$'1gZZ/=/@NUaIV=YDqm6P$1:NHmS8gT:T?ASjjeoh2Ff)p5[lCF##X%R\?R3k1ujR@@0UDffV7P*$0A;-$7:"VT`jPQ@19#\8[]@EDEh Z\@V/AqUrGaKBmUKCs*t71MD]t8j_&t/UV4peE)F=+'*.?@&6kJTP;3HC!d<&k)/EsMrX2Jl(ls@]*#03BCaK=So#i8ts?: \iYfpkNn(\)k(f[mY\N,=$'Af^PQGb2e1>`@ptKDnK!mRsLu`1XinN2FW,^;p['c3_e=:M. e-p<:_QBd1mH"RLV4h;%5WC`\.8Gm_&deK]Lrd@=o:c9[#md^A<^-s\egCTGH$&8MFT51$02_6 T"'_<@UrXU#!3pZD$p[@D<"P[Xk6d8ZZA<6$BI<>.='CFK>Dae*%R/'P]*.tFH:L*+"*DKf2*kKGBYQZB!:dN5`+u!GI>&c89f@-HcU>HZ%[(Sm[G?6D>*08G 5)XC$V>M,NV62qp0[lDG#mgGVtQ44G+bQ&[o.;IBF4ur$E%h=8c?Z^QpQ- iB!LsS_=JIb7C:]PHpCfmTM#dIo*Te:;t>\J\QR@F\]B8UatAPJ:r=Gh6?1\H:'C`*h1aJs O(M@.OQ6\UQ]+C%*R`?(&I9q8RjYd(akcbB`djM>oX DpT9:NNdBp2HMb&G%/,#hPNEB$MH8DUB>fn8FV-0H^Y"OTLQ_Qfq0>1p$8i(a&FB$/ghj1SK.gB8GHRGa?d9Vl5F?WJUq\J01hKn%8tqd eu-+I7Uqt=H<>r'_`]koPHMa=6TXJ`VFJ3P@M.bg!>K';?m0hMK#lRNJWN&XFL:7Ik[LUE6 ceFVR-.[/<\-]XgSM\mYUAILsMu]&+Bq&M#g/@Iis7`+A_bX((CM%6=E^#A2YG=JdUL&#c( KQ'HtJ*&\-nF4V'qO@e!pOQ9QBA8n;p@bdKYbMB+$AGi7Ru'a;lhe%)1oI4tX3kYk%+%ZN^ fdUUK.A6&h\U-[t`H3FS(;2!"f'F?4#Yn!"aW"RV)IL^S/:]pF'1bp=,TH*B#gSNKgGJ%7# =1dSfrI;UK!;JSX<544(_ql694uRqqaBNKdHW@BGDn+ThbP^9/4X19s>oGfIqb.(@@:G4EA g^k)b\Emu4atr]>-:H#FrMF44$]2S09]h_icRA^eEXD&h&-GgV+56Y$?Qd&b*Z23gPLW-q7 N(t0%i@cIeg76gl?`"B=H^cpj@Nt5H!-#p\]JKG]Ne^!!5Cg/-LF;MrQd(ZbRJK7mW'T]a) =Q,(OOILtLAgU8D0PNL[6="p:e)"@RUTMSXoY_(H!R'r54o>^46o5rfgWV%da*T@(kN&1@V PI/?4loHO[ZW.Zc]6SR9e\hn%b*@JV;m%kO?10X*%9*t\o/[!(*]V#b@$>?(i!"jE2Y/W<[_)HBH.MMX3+g3V*5]e`Bi2AiW9@i3KKNT6Do4ceY 3qtSMp,S!O(U7q!Sdhg34?^H=(MFS`rbP9taVuo5*LE'Ia.L%W%3bV(JO79-DT/oS,>3UQd S/Z2J`hYP.M?9B$Ve<5>XkDX/@!\KDQGdWVL/uMrD$"V*+]l)*CJf`UA-@fS`d\f^6eGS?2fTS=Ikd*1tP$0+X9F$F!P&J8\,=g+ IEMs(CH&>c\gVLc*k[ToX&lTkE8)DYJmHI)m'6<:[na^+N_neL$UiE36b/qD7<&oddkQ*RX W<)nkd:i-8>PlO@"GXKacn[!;-O4DHl7CNEV_F-4U9pK+X:o.jhP;_$.5uO%$7Q\ J@?SXJ25W$:"XCp3,K,``&WS?!UMtF%Og<:I>C05+u9cD$diqkM*sB#6+?>?+4.0?J[PLp= 9&l)'Ef9B)?^QF'Op!:%tZ'=$(?Z")W8--K-NPh_9tBl"H6>)Tb9C46>5IL@nm'_H9MUJr- tDUE"WKZ%??hb\"6fZE?cdKMME+Vgj'WT/ke>sLG"9#aQ-i,R'aEq#6:;6V0(cqeMH^*tkQ #KUtpV8N[%8"7)1I^/@059`3U<:4FqargK2R!*p":Mi]3:^pq6:+Fp/;7]He]BJB^`Zu1Oq mX@sbrBKKL!D:RpMo(Va/>tfLTgXhV:tY[hL*[G(6nRJS)D)qbU52'eoY7I-NCViQCPM9t& ^jZ>!K+c#BB9+2;UK,MgVF&/isqM,n?/0g]NlYc(j(=dHr'iD5m$]g"LQ![63LRcOu4e`0! c3]Wdr-,6mh"93,1ti!0-oMaCm]"3TCib?,j(6M.^L0Ip GIm&S0d,k>GqQGuJk2h$YsYh:&E?kMlK"(g7CK,tC-r2>)_\"[Ng$Mq+_0k sO0W>cYU`U)=M_[^'%NPEerd^NlYUPaou=P-Lp^o2=d(!:`nX-(BJAWb_73PTpK@rOEUH9: /`^g(glk`ULcrD]`YRHq9'9;I]9*_mCieF\&3I&uGR.B2`7Usfq^q'=>LuWse`K)15i#nNQ 'p:UMU__X@$n(3o!fIIC0@UFGct-(^=W5`e;-PHYf7a&&PEfJXC1B>G8g/eCIVClXd9q!A6 7Hr3]:rFXMUc?$^HY/I'$-8)7S>Ohhtuo/Y2lY3am:I?3q'6-*1^Xd^!84<8](F5eedMZ@Q?A!2D]\=Js$f+&Kbc%N,H'jdr+iRE>RCbhtmO[F?$ 6J4; WnEYj(/0Gl4bH;0&Ca?aBTb-6$?+0.`&9tIi_n$o_rcYQH6*;'lm[q%EF7,I6V1LA.Aa77B ">K$!+UTgNjMhMaI=hpCsi]np*S1r!DdH8b\OS/0a-/Is()j5^2p,j5[,aLOlqii\_Q-I]b ]W#/T%;5Zst61@Q-i09dZEQW05U%e;@tBgqeG?!COkl^bFidb:)T_ qo9ZP&U(9M;igNi6nmKrX5q^OZ<7;\1e[di51g"`csEo(*Fp2q,Z+=im+&iQ!Xh`9DA:FfD K=jP#f6*Q-sG4\X)dDM#:$_8jJ/P$[J<7Hhd*@*VN7`DMX6Af\)![l.Ol,G4]cI eN-f;l)Pc$o+'Rp`340t\7)4mpbAg#.[jJStH@WCH)+bcI"C< Q5@$cr]]kN.*$QLcEo]m%=4hn02G;I1$Ppih.Jr)ZGR?8O>1n_rP:cZ/^9;rBmcn+6M8iV[ &DnpXri?/XVX/An[bFpe:&Kr=Hoito"MJ*m47a8,aBn,@gor;Z6e!&+QVE!ZNK%05l0!AG5 hE#A\\*">E7IE(L2:9a'r_"Y`p[E*3@K>m9_+ "u'TmE+oN\D$KKL#;C9*E-V\mI0]7m#V^pB!Wi~> Q Q Q showpage %%Trailer end restore %%EOF interval-2.1.0/doc/image/cameleon-transition.svg.eps0000644000175000017500000177727013031037006022047 0ustar oliveroliver%!PS-Adobe-3.0 EPSF-3.0 %%Creator: cairo 1.14.0 (http://cairographics.org) %%CreationDate: Wed Dec 28 23:34:46 2016 %%Pages: 1 %%DocumentData: Clean7Bit %%LanguageLevel: 2 %%BoundingBox: 0 -1 424 322 %%EndComments %%BeginProlog save 50 dict begin /q { gsave } bind def /Q { grestore } bind def /cm { 6 array astore concat } bind def /w { setlinewidth } bind def /J { setlinecap } bind def /j { setlinejoin } bind def /M { setmiterlimit } bind def /d { setdash } bind def /m { moveto } bind def /l { lineto } bind def /c { curveto } bind def /h { closepath } bind def /re { exch dup neg 3 1 roll 5 3 roll moveto 0 rlineto 0 exch rlineto 0 rlineto closepath } bind def /S { stroke } bind def /f { fill } bind def /f* { eofill } bind def /n { newpath } bind def /W { clip } bind def /W* { eoclip } bind def /BT { } bind def /ET { } bind def /pdfmark where { pop globaldict /?pdfmark /exec load put } { globaldict begin /?pdfmark /pop load def /pdfmark /cleartomark load def end } ifelse /BDC { mark 3 1 roll /BDC pdfmark } bind def /EMC { mark /EMC pdfmark } bind def /cairo_store_point { /cairo_point_y exch def /cairo_point_x exch def } def /Tj { show currentpoint cairo_store_point } bind def /TJ { { dup type /stringtype eq { show } { -0.001 mul 0 cairo_font_matrix dtransform rmoveto } ifelse } forall currentpoint cairo_store_point } bind def /cairo_selectfont { cairo_font_matrix aload pop pop pop 0 0 6 array astore cairo_font exch selectfont cairo_point_x cairo_point_y moveto } bind def /Tf { pop /cairo_font exch def /cairo_font_matrix where { pop cairo_selectfont } if } bind def /Td { matrix translate cairo_font_matrix matrix concatmatrix dup /cairo_font_matrix exch def dup 4 get exch 5 get cairo_store_point /cairo_font where { pop cairo_selectfont } if } bind def /Tm { 2 copy 8 2 roll 6 array astore /cairo_font_matrix exch def cairo_store_point /cairo_font where { pop cairo_selectfont } if } bind def /g { setgray } bind def /rg { setrgbcolor } bind def /d1 { setcachedevice } bind def %%EndProlog %%BeginSetup %%EndSetup %%Page: 1 1 %%BeginPageSetup %%PageBoundingBox: 0 -1 424 322 %%EndPageSetup q 0 -1 424 323 rectclip q 0 0.168627 0.211765 rg 1.44 w 1 J 0 j [] 0.0 d 4 M q 1 0 0 -1 0 321.940643 cm 123.84 121.605 m 145.441 121.605 l S Q q 1 0 0 -1 0 321.940643 cm 246.238 121.605 m 267.84 121.605 l S Q q 0 321.941 424 -322 re W n % Fallback Image: x=0 y=0 w=424 h=322 res=300ppi size=7113942 [ 0.24 0 0 0.24 0 -0.139357 ] concat /DeviceRGB setcolorspace 8 dict dup begin /ImageType 1 def /Width 1767 def /Height 1342 def /Interpolate false def /BitsPerComponent 8 def /Decode [ 0 1 0 1 0 1 ] def /DataSource currentfile /ASCII85Decode filter /LZWDecode filter def /ImageMatrix [ 1 0 0 -1 0 1342 ] def end image J3Vsg3$]7K#D>EP:q1$o*=mro@So+\<\5,H7Uo<*jE<[.O@Wn[3@'nb-^757;Rp>H>q_R=Al C^cJ_nFO^L%LcXS.',TMT<$3[GQ$8#0$s<4ZX!SPQ1`C/miUTHNh3K3OhuMLXWZWHGj94=M/6)*KS9PE`kN%="Tc _Aoh+fk'&t\ctIN)4XQLiVpoI(>.nOVLA,[GYNJ'?f)YJ]1pu)Ok4a;=i,EpG4sq/+a5h8d >eXi0S^6MAH?GC-^h=(,dIU>=;fBr>1IXb_>k P+oS^^pnWc6&t+n8OR9e&)@%E+nBUQDFE'I_]p(/ITH-bV]jIOR,+@`"0mRr :IRG5T$(Bkh#S7n?DNMG_V:6h[?RVn[o\-LF(.HF)%iq>RuQB^@N7$Iamtt* /^*`*cS`u=M_!.s(52E$\aeK/8X(+t(H^1?SSqfcp)T3*g%Lk+ggZS?+*H%FB460f+B7fFi V8utNT9gU:R1&;P6pMkRN:9]l"]BA;FhnMg%FM)T'sA]r#ZHgnbf"0/ps4&0<*fVStF`iS7 LRWINGDJc27M_ch78:TC;^XhuNs&UYL0_+Ro6bF:!L(eF/HLa>[K8&VmoVE0nr8UoF?F[-=IT7LJ[(`NmW5(h@)2r;%=d <=H*pP6qN5)W-8Y9AIfq0:krgSF,HY9#7'$WMc"@E7G,9iirieL7'LrrJX[@K6rAq:\8_i& !*TP(`I"UL%N]>K%j90s*,D8\pEUGj-"F?2./k/Cb*@'WuO_-9UH:UuR#;ZIRT!C,:$KVWVb4%? %WPMpWF[!H<`\=ire_7lB>7G$-7>\9;=FLcHi& ATIFg'?$ak,(<%><+,K=3DX=kc)Pm002\O^\$?q^ZCIV5[bAgd@:"H"a=6Z*m]Yg07]S:L^ `1ZI\I"82f6eLOe^!f+-eF>E*Xj6n9:0n5NWHKqH^7HqKZ[+Gi"^N=CJmo$,]:c(8cIIG/N^K9k&/4'!ZgLtlH=,-h6'_^NS6YjHH 0*Yh>*JA) Il^;H3]'H`H^h\`?mpKcUKh6=Uu]e>`FliP<-ap0,EWkY-%0$8BP(2.V2keQ-+pY*M]A0j3 4!ZmF'I!Mdn;M>g8].7VU+8D?5f#56u:QEQfb#r&3dopZbC#(p]LSN5Eg)EY!<+aJq&hVT/Y?#Do?*!4 e>0DX2;tM7TE2+mlgWap]giX: &KC!TuggrQMTQEX+e6"YkGRK&`R%kMK)[27)t\T'>b-)nBO02WCul4gfoq^?;8Q;6M>af:f `EJ43RBLg4C>6S`]hB\ bNp8i`j/*4oTraqd4:0F[OM?7p*A;h[f9a)Vt.;8*TtZYDSAQRP2E+mLEUCG1"W3q`i-ss' P5$_!:PRn*!DS!#pJ/%,mol!/;C8!XQ"3JLY')9/cg3,m&$7!j)5?@H@1A1_6d!&jYFq+VY <8Se%K;)5-[-YY>94:)i.;%Ib9ATun'8%(4G6#-_qKn8QI"r*&/f7PC]GTtD!g@DWY-jr7_I%"Y2c!/1_UeHmq_ $"9855\r+Bk6LC5r:%*(nF7#CoX;]6:8I=`n2qWj&dpBe#8#Jrd+]-$PT)n*$o"?9!Sjn4m gjCe'!X#$lJDQ`pBVno)PIKEYn[j*71g,'#sk-n^j-OSY-SS8'+nLbnR31_Eb[niD5Q1:Tt V.Ij;X3')?B[?YsT517i3t4)keA`;,iNj=U("")6o_MnXuLb$A$1IP5sS\i=H@tS.B"G(m0 RmnV%r:PT#)W#uQkQd;6<#Kc2]!*O4E@l$C;,BG7;>*$YG&TcOXdV@Z"T)puVE&cEh+5f@D0XL1a?>0P)N'ELHU"[HVPqr-l^+gr?KAe7nq6 *o61o@H;PZ4p]p)8Q=u1[@Camk%t<%tJd214Kdi&oOT7cL_E2oMJ%6<(D_L*s(.8iHuSQ;' M5J6.@2MZuJE2%N5?X#d`ngoJI3MGRUqP^+BpcFHK-OPt>KT4VN>ciQ;u\1Ifln7l789oWT 6"*!t,G6Zg!QnBM;]MN^cf8X.Ino[-AXMK%P:*20AO_.!r)Y>02A::.8q_5J")[7dn&6W50 <[)U"#;*/mM:pga/oaijrF<7..)F86[+\iKrkt^m<;KXQX'Aku0k>/J"3\k:SFTTbRF$J1g <4,G"oh[2Ld7(mk*'n`[oe04.AQC[&7j5)N@*q-;ooWB7P UOB-*$LeP[:`CFV-5aU6(pgY@A"1ILJsJK*!*DY@(fMgOQKQ0>d_g]p!=sp=s%l1;H9Vu(# `Hkj[(,d&[=Vm2=WE+:IFf1?`='"[F8MA"^lKZ+X,>Q_-^M+X'Tra=okQ7TW_S-HQ3S&%2H h.NVGX0$Y+??A$o&R@I,$N)e#%(@f Yo o3t"j$.`ddFieCLeSTK_.,k(CJQNEU[qiG8DR0Te+W(NO?UI]"%P`*Bm>U70gMh?CE3\+S>?'m+4=BpMkC1p)O0q'XpMQ[sqgPYS9@J)8Q.T=!JqU\.S7nC"JlR:QCrHFaA 82HEVQ86092SK63HhDLkCh@@e$\K6]4j+*#PNn]q"*XaPEHIBPCFiFie3]7+t7?=BWA@$Q, &2[+`jFq4`H\(uQo"b:L;*l62B2sGQ'l[`$?@Gn8;;%F4'[=?[m%W=o1b_(G521p-5jNkS# PDt-<'81JpFPsu:p`Te43X7K-Jr;,PO)9NZAVPGChDAOTfL^X]F&HGN'HkYFf9(3=2B-'B. i6ThlZW'oa+h*lM7B)-iV4K#pTMR[eUiLtX#oe$m=M%ki1_=W.8T8\$:N3+oVTnX5JWJ =TXBHaW7iM$olPCHFiL"&O$fZfI:ooEpk8bgnuptJ:^W"M@nE\TZ`)!upNAH(4;O-q#Nq&m ZX]G5fg*7WC_J:2OuZ7$q,"gljrArKP1a-&1a@dKcTXU8;ij6 PR1d<>@g6IfPrX8Zq1-!\%kqDKQ2*/#(PEKQe/?(*#Lp@Q[J>qf6DuT7$CQO8q6?D>5uF=m R+]0@'+'ZVfGYnJ+1:]c@*P#tOcLBfS[mRIlGTY&kF;:.T!oIR@3mdq]`@]DRX+hSnKP2?) kIrSTXkQ/iPl\M/"W1IS,h<-=&VIP\e6k$TD0gBoa.;f25>IWT9NS#=rX'e*FV7:'EH<+`N4)#F7n:fHI8#lL0&7jPY NXIAOZqXB>-e/adKoN[I0lYhc!>#Um41<63X;cSuqk:SK=)IZk\9hGa(J5TS*XV=7Dm8?6D^6A)Rl;:_]X uG$k6X*kLUu6nMURtRcqb(;NObOoKTiZ&>8OslotPkKC(l*1]GCqJ3 _?_7Uf)k%l$rO;+2c_RN$$J\i(NpV+9OO;(5-J`L`3+iJb"`251M6.a!/"hPMB*4*j0+^u+ 43;f#%`8#4Lr,?"EiI5$7a1PKoo@dBamN',u(-H6G,dUkuF3/ftaeb.AU!=SsglK@M(K>c"b^Ag'r:!Qlg`""Sb l%EMU$Ndc\00%LQ+Z,I91g:A*R?kddCgMopnN^oe'`Wka5O`J_%7bB'flWU)r0nn'h5kf_.(F?#e O\Q.]\":&t=G]iWXG8;!4I+g/3G*K/2kWf$3ffq#h2rP1UJkT"$+g)\F.3hR?W,i]@kj.3O 4lre'=V;+5uhS&8:3JJ7$MqVJ4g,\F;JQ`R>:"@$XMKnVSRcj,Blb;WjIU5NrbsT\' ;9jOjW"Ao68nN)\_\;dG#rAD^2rO&Q0Dc9*oYfm5(2VI\0K;Sp^`)BT!=,$_0TFUlb:'uij ks*Fm;/;R2$q]U,qbcJ*%5hI9sbWro*8hQl[E`)*Z1%\f;cZ=!Ua;$n@o AYObO6Mj=qom*_G2.&N1*gKHs;sAECF\8?+X&WpM9%; hHYY;g(O1Bt)a^qe]m1u0kY1[[$>OE:HQ-SW:]3XkAS(6s&ID9.Y(`X;%$&-9*nJIcs0,]b iA+CKWQ;8rpb@U8_RtL8-rcl,KNRp8BpABDP[2PT:Y?A!ZC\A\fQHs9QgMQ[(S_!7T^#*c' *$,n,M8eLZhljN-MjY[LaSHnUQTM1olLaqmf)!VrNd\R2mNg3RY?S+(I3*l>S(['"qYf:nL X*9g;'DR8LUSB$rVo+O"9SZiE$Pen5k%/T"[R*<)V6(XJa.V)LEY;t)(*2V;&?,R,Zu)uoK a"YB8Q9d7.EZD'h*+Q>8K`uKOYlhEMR@h7e+E'fD58;(6;XI0$m"F IHud.^"@#/i<$XeES0sik78\/<)b3ctKd0/eFJUK\;Y7keI%Ei-OWr9Hog9s'FTkpdUcY\)?B"bU5cFsW&V=S>1IAPU^m.gs6@+ajjIk^\9F^8g'^02)5'h`gY2l05q?>(jPHrY-:i+g6o/t^hGt_Tcf$1=\A@Y.:P7hGh^PCi0L1? W`H)>AHB)0GfSP?#Ub\LOo`e0ptGJ8TP)hojqHQ37($\[I7G,)!NH@?EIQDFL"Icl%>]:/dA<>F+TdDW_&iIHu5,qnI(I#6Ve]Hm]<>7Ha4;D3Y3h M4nUqLEFWE-J;?ZV&7r:I3%KJ_FtJDQE/C)HDa?^C53s#6_BFk&(bt&LL]"\IA@UaD&ZO/[ r)>:B=[d6[t22:4pfY]T09BAj`u;fS*,(rLSJ"*fk:"$fBeTZ2fF*`)&+5klK*@$D =VOB)`%LKH]Ge/NaqD@\Q)`%FGfAKR]:FGiFGqdEFgKl=746LoRg7c;^HnCAOGG]=4%dLSY RSc67"!'47jhghpT,=GXr!an!l(uq>2`;$#?@['fKO]EtVOifA2e/X,1FtQ5TW]nJ-n24lE GDqZ,$Y*-iNGuHf.m`#I"iCgk0jZq3GjuhbdtBN0r-/`R2p$+tAsCc5P?)HnFY]MBkcYM[L+c9s5r] K#?pr#II1G5akC_!]Q#jBW:AIjL"W3%[,Mm64H1=(2eGClHmQaG(lS&QOR24hCAl*c>6=s4 *T`]ge4F-`jBU'7*PZE]>F!s/k&C?oqL6#3_J38SebVjOnGmK8c4/HL=V,Xgu%M:H;LY2,; ZsoM'H>u\f\E=mMi(JuBMaJmm%B,O%UJrDP1WJYKVc>XQ<;N:fC6Y!',Og9hqE[*@eK:i&* ,Z,1o,S:2QdjDt)5HFIXYI:mQ>3& $r/NpGKQIaepHZ4q!i:e9n7]tMC+U:LS]b4rJ)%@NJB'rBa\OW`D$ZSTdmEO+kQWEDk5rL? /26a]Y^@,7K]Z4WT;XKaFgQ8L@BSNdEt"X?2M1A1B/%#bUNa7 r?"fZojE.ZJoFS#Qijed@/IQh0)I,rQl?4fHng@pef1iGgia/8j_up`nKF[3Ba]!2IRg?t' I"=l?i0_Yj(RHd@IS^V+l.o.eiUp<*e7ZMJV8%Z'2X<I.Uf`JdAW1[G0[,4<[oX!/RWDMFQSS.Tj@nI$BMbcIQ4#T`I.lSps0kc&VAT3lC4JCm9Og=*YM:[.*]Gd\+*fpap5D"J9" 7Tc\@H4O%nE8!KGNcmCWjE1qu_BjiK[FZ@]Etn`$.R\gd+*3c^DZ/P,<]Il5=?C$ZD3;OOO Q@L`ms/jN!Pipr"#310HB.Bn_KNfdM]uj7O4!AY#8j'EH_5?EIOoi$(n;,sm!<3&$-7B.,= \PdHLJ!)b'2'f).RHDE_^&eH'^>FK7mJ8Xqe@TduM5-f`,j*p,W@jPiFl9UN(Gj>D\R%k++ H/FRt6"a58<,I93Es0iB]\5>^[:GHZ/eQp$3qg?1VcKrRGo2D#OC63FT&M[kZn4-&AC6UYA V%e8D&d?$/:pT*kfs4)JRKCGHK_cW'!j[5qXkC&oC33_JE&1I,gK-Rr!IkTT6nEh%/Y?q!R 60N_/BG9CqC%ZBFl?u&i:EGSKHN.F?A\daR,6u58IiM"7W9>0k,B"&X^*NlbRJ<@`>E3]&, YJ/Ip0TcAFlA!2#BtaqSuRO=?@DGEfA$1pFpN0HET;N]6s[YA"cpLd4NA;1&766uIf:lXK] mq.UXfYJn+$C#Gi'MDgZlIVs/9_!\U49?/-A.""R3*$0OpHZ p^0DhRPS-6Y*&2RF6#ICDDZkG\-':BFg5n"MpC_oB_Etm8K^jGUeJPV%lA;*#X#P24)9FX4 >%C[I*L9P5TKHifEo7uPT^^Lmn@R_$<,XRG=6C]M=JF/!u)FDWf0I)&Z3-b^q@mU#I640"` ?seUtcbcb@6X%&4gXF#]3'q>E& aVq:V&uH86Gm9@>85tmF+bU).?mR@`8G&?BWLX^e5KB:Q8^`?KS9N)^TLoWd4a;=/E,nMqJ 2%m`L3Qf4`,l4c[n1Cj8TGT%3*1dNjiSRF9%e@l1hK:cYX(6g7P(]8/@.u2R'M6DKA<7qC( @-b*!bP-NtCkSUq96h7PS:$"&hAIkW9l"ZSuoPg<"4nrj>A#KV%C/B5pse/@3Ob7)9X3)G=idnNNh9q9old]/&F/Bj@ 7'd.AtE'5]cbT'/rL!W`Ar4GcYns/Rbc)g&&BbQ];ekV.R6;p_+FR)]7ln'cbKoFj3RmATm EYE/:"mk;E"S3^;GF2q!:<`E-B]4Y)@$r:WcBQnApj%i%pJ9$3:YM?kg>9mJm]UkTL%%\JK ;HmFj3K``$L"[O%/s(O#RtK2c_Ut((iT^NrQpN5:u)U.LiEUN85K`q6*Ve1kr4XtGHmf):d l-q3;X6&f$Ne%;4,7eFUHHs*"`Hb^6KU6m2o4%.)snX;&&IEn9,#/>a(R'&qMK/BWVK;8V= N4KQ'siSLW'a.oOVC;V`jW?p'*m<.js:"YDH-,r*k#1fG5Y"F*ar?q5nC2cGDhdu?>?O@Ou V9E]l=e'1&)eNQpi:5"-i"XlopPsSG-6I\.cKh+afGZP$(7auiWe:gInOBD^B7"rEIKLJU7 j\=7l:5.n&KJ6d:J3h^;;q3a)kfes^65SBQrWB@ab5HUkg#\i<`]`LqE+#=.OY=WV[6YYCk(D=4iQ9HKc*"_aVe=V[%O*KsVXPZ];t=Zr&'9pSq1QW]<6fq"L 5V3tJgS6AHs&tL4F=M[CTSM]%ap1L9PcT\8=\e^ YAFs>SqgBpif`G>$Oe?>[:W9'k#gF?sJM9ZST471YUXkR-l_?Ym7L-9u`.c:Q)Ee^8VPH]99=C'?oTSB+2"3l a1D2d=oNS]*J?B+5VL$N'9L4c^-#!JL0[I7Ghn6+<1h\GY<*V3VioNrp;?Tn)>:%hqBpKrp RhjsOLV>4K#r)r-R=sa/O*WK;+UtU7u>'9sNQ)\$5"Br5:g>I0Z-*cBVYm68p>=H#/Xg[0$ \6G63>L!^_^jB;I_-megi>c=^29"+c'@k?5gkEdRQ-*@?(gPSK1$*\.#?0g@LlsgMZ@i d;`/hpii4Cc)gA%"R2c9C:F5@b6hA0*tr/jX#+6=` 8KA)7)e/cOgRs4To??lhmp?3=B^9K0*Y@!2h:jpBdk$Y9<`gPrc%mLA+J&7Hmt>U@2E2AB_ O'k(u_?f)I^?!SNB-&kl/i%&tEb@Q#".2[aTKWO`E+E9CB:aB]Y!hHeH=t6EB ?ks=hLB1hJ7n;#kPg$G/qRb#J`oj]BNBe"?'Sr<8*GbN?j96eXek*m"Q[i3>2?@>L/(r)Zf Msb>?4X55*K3R<97_W>V3kTL(rET(#5)jAYikt[[UjJ?/_o#iQbeEkcbu^@H%H2@NH[u>mH -5G"`rgk#43n#\h)GBki[-C7/T;d!>q7CgsD`#;BTinOal8-j:_]c7ir8Q>pP,ZtEE]lX$s aAa4r#D?ZDFk\dtFB"M`"]'IAJld!4[hS3jW^h`ARli+_:0#DEg_52BXh?mZ1:uJQjLG4&=4qCl-Ch[3UAT!gh"3Uk%j)@n?NS&lAi/T1?[#(T9tk7Vc)'6?AqF%n7hW(mNq2WK9/F.XTHV ]kZ84EJ8#F14>ScT^sX5BIE$F<00s*8XLF.+g]E[NLEi2NOY=fFJ["\N3?1 /.:)Z-_Z9IF1%$*\%FQSW\q1j)SOoiG+!J2q7[GNY#SF=0HKY?H(`=nU*FFk9l@hd:Np@!1 X@FoPn-E)d+&W%P+XoS4cs!eGI.BQfGN3V_]Xh[H=UE.tei(,W`ue'*Pc8V?J3pE*H10333 r\-(TuFq8&+Dg$>S@eYq-GF*PuT6kdcI!;K:GJ>#L?tlmgl\E&ap1JsmW(h/RC%tJXGZ`h< =A\_#/X5t0G"H*m,-s@eAd"07G;jPd5E>O;l%=[>"3=LIVgS7%P^,KYGMe\]:R69UQ[+XXq 4F%"VLA\s*\P!_TGN4RC@83"L3aB(H5P0uQ\\N^F9Y98(0H%kHH\@QAd"JcGmBCTkGrp4F+ ^u#L0'jjn!a+QRgX[)B-r56:50!5q`hK9YKD7-[J\@oI+QSihp6]=cu:C9L:dR ?Y\/^[Gl+*P3.f0&"fR8]O&'0)&\8a[rA-\SkHhW>]-/AbcEP;9k0mI5^O2Un8`dUFu ISG_&QqIUs2MW*qr;Y&kYNgSOl2K#pIb3q8hsZ$]mffe)00"&&n'u^SmfhlCI@'YWCauHbP DR.4dS-'p"B5Om hM7H9id<8RsT%,be!^Q:I>L,Pf:uXI2d0F'6H.(?,EqL0G2M)Pu=8R/cj9@DJTA#9TdaJhkUN6sE*1Ha2Gc'*P,32WI &Aiu?5UL`!&;p>$icZAaU5L<@=#s_>:*=kKa'O;GCd567h85[lr.7qt;Pqbn[1qbb=7>HPm :t/JaishXAR:L6L'jJj^4S-57F*;d=&%@i?.WB>G2<=8`*Eu,$o8?``Y i9&bI@,YJ"t"<-:#i)Pi78R=AB`e@G"m.3"G%)QVM#>hD%dbpsq6\j4NccNau8k8!)f"5#% :&\R&.!AQ`nZQ`Yth[+jIU^2W'I#!((8kLI"l=m.mFKqddkq;-ChH-VhTl.UT[W9RQXWN,7 ;^9Od*>2HfmfdEc-BOD-<_G$"\g#@2@c7-hAP4t:$Gj\Y)j19,TY43bZLUlNS^h9@JBC'jY "2^l]+X;VJ\;(s@n^rmG`pu6gGEuF+!^Dch(KR8^MS8+&C>X*FDgtof[]p? CRGPrS#p/M8"7KqB(!XGJ2m^i:mMuaEmR:5EY%&?=0,_q;-Upkk\VXWTrd3ajtM%Hnd$1*l e;blQM&*hK!Nr\'agG>JJk`rNXJoB9kaqjF!Lg+i6k^rnmN(Qu44l5SkjLgmeOu:`9B?0e= ookdVU-\^ihJ+U$_f'nS,G$:0J"#%6L2K@"?E6.eO0eS1l,O)]PNa4heD](?3hL IIVb=$?4dc)I,ck0dM&T0g6`>HqtSG83t%9jT-Tr#`d<`4;0KK/48@')pjI-6:h=djNg"oRc3X#$B-WR7K!7BFiNFN&N9ucA^339Yh)o>Go:FFRHr!o:4m.X>)t9S8b4IS VPsVL8&rqWAH5.inM#/9OmXW\',t-sn'r'2aN)?$$7b1HV*&>H+>G)R#?8=Ug;&jd4Ne/?5%k:K*#76!C:ELB"jAGiFUm\j+=UJpHC< N;%P]j`)aNh=6`=W)qI*$rNK(3/4h?]*hDo?Oo,<6*SgEZL+_j02W7HElg)7mNK_WEbG+P d=MR@29AZN5iWn:M0@r(IqV\oSmH<6J[1ku1EX]GG-g^;M5L:H9Ep?L^DS!A$^A^.d;53Q8 cG!*d[c*K?6OZh+]3lgIqcen0S1O\.8[LS.UAB4q4(#-JVlSUcO9a0">"ii8L/[d07>0*EYrG@N7gmn KoR#fUij8Jatil("f`*r=BJOTJ2t1iYQ&fo&H4]Npef/>]1Oj&&ITp`u(BZ;e02@.li'^[S =Ls4!lYT+tQ+:I_jYm"_E(hQ?)+ibLpeejkR\;``V<232P@?OnM#DhAFMICH!7g0.F4sFjA [t4D12WT(D)m,#P'3^V"!JnU?0<,HtM^U'48_;"ku?HQ?VP,Gakh0HJ&1>usU650#Xa&og$ >#oi,nFXBr7ffrFM!?NaYaKM.[McaR3AXN.N[+9QT>\eb1XdoaBGe*XPM.('WF+2*R3Q#AI ff"\q#0kiU5A4mSV6orl.@.mB2+GgsMlb"_'d>tYf&rDbL>]-CqGTt"?.HMf:tl]c`aICqr &Y)?W-`"38-jWBWV%n@hq9\G$B^sa29uEWHl%HTIMK]/B*mP,#\OWPJ[J[+Zl*AS@r.]s`a Ph4*]o:;EZRZjq'RKLgn0fRauh2m^>.Ij^24?'3Zn[cok)MqG`C+1\iJp=kHCP(N_uipXK] ]P!o-?QNW6aSB1qLjlV&bRUG*qj^hQolTJ=Os0)G%O95I/"TT)?sMe0R1l^1%JqAj!f'Z"8cd% ^r1MH"OcL_a N48ncm-/!iOR3PjZPmjW)U_=unk^@#mio%h-.6-I&n<7c&0Ja6'k&C/134IM[*UL9CCs#T5 uJ24mhDkS'9PCUa#oR/4Nd(56)L]gG;>B9joO-?$>ORt7P)cMMNoHQ=p,si:n6I[Km6+S)CO$)J)'&d[:EoB%N7. "FQ3G5*>dd\tgq(L4/7FSY5o=[Ui7NUfn6aUc%'QZcDG),&E*20u-dk*_IL53D/9M[[.IHlIXr/`?C?!QK/rJO%]u9=2EQnR324.85sZ9XHNJo[?L`et57B*Q>i bKD(&Yf0j`H3MqC^Pi-`3kSunL*[7g-5lqn^Kgmp-7MQG'FV+ab\/l?\:,O+k'dHUV->B1K *eE8?1kS_+Ll(*1';5ILXG1HJnf@hX8^m3/k3A9iZOB'n9=cI9;0o:"8i6KB*sZND@tp=j)PD&`@Dg;BGq6*F[A/_4hgT%8f!p>Eus#!E L.*X][O)>h./+(",Fn2B6-b&+qkPc"=Frt0o,@Zr^@_op8[F@@Ugo[uRA(9p/_.'KXT21^M:_a.1Pndk1]k)? &AWZ^,0t1XnB4dHFB%CiZ12@1rk>R[n?;=lLMlLKBk4R:!<>GA8@H8BDP.="F11IC*U8^$D 'k%joC8BBh>.(LGi MBb%>Aog7A_-m"YXTXam,E39E7YV?(DC&Ukham=B9n$f$*maNBg+t_8qHb+T\jG72e`D"gn =0B9(EbVYTMk.i@tt aVB)A-(ABh&pYrGgS/_oY(4iP-j&&Gll4[TSFa%,A(]GetneGT0G?>B"3"pL\(P*D?Ob([n =26#2GT$V9Ga@$8#Cmg11/p-1>/A[+2YVOlX*Rl@KU8\NTp\#&-&%^jL"K`-JaOLd\U:k2I +W:V!Ql*B$mP7G=f1m6GN"?XqHg#dY9@?nU"iF$AKUYNJ68A""s"hoH%B':MV+tf(`eN:Y# D%<*_o"U!Z60F1O-DcN2UJ/iO\14-DBDq:Uc[9\"@t+:P_iL2^O4aHXJb] 0e^jES,OP"I>LmS\XYd/tUD4rP;GNEnG=s%AOY2Nb,Qh!u6ll)7`J2j`i)B="4Ph<= ,ppZM+=-Z,a*;I:1!YQOTkq/:KQIsEG+^,_Vcp:bsDZQRMR.$DEo9bp8R*\;ADhXK;Q^O82 REG*U0@p*4&Xo),OS.XI+duQW,TM(SS'a8;@A"BNmM2FnM+&NtJS#jb=r$irS_6:p'5KMtF -ScOQ'q$)\ac:g"NWopbb'V8i"`7&l3Gjaa&Y;Sd5j3TZh-5Gsa[&cl @1,.!m;LS$VaT6cEp(`FD\l)&b*'4Go$H3ooRg`GGGGluipC>'ah4qf*8);6I4)T/Wpa.b7 STR&W#)Ukflep=%B(L^+8=fnKGkAgnn'3\pL!Tk@&RAILkh.`At$Kr3JUSc$m90#BV\p(D^ i>$SDJD-!g)O%HfO0Y6&$_c1ORPYi8$*%2jm:"=8j+X0`rLnNVNdA[G]2>t>agFFf-(t/)X0#.a:poNLS]m).T_dZrMAS:VKu(?!DXNkfOU7YA:iVpV3 3o=Q/Td+gJL;jhRAjHXXc)!;%@!i.iV7*C6,/gPNd?*E7U6Xs$=RgR*'83P%=7\d_7ATf]`8"#))nEp81``:UWO\Xe@J@FIB#=XO(n#Ul;77J'kT5$c&@rmrgZupbl,]BIKfE/K gloibQcXn%D#rD,gNCYD$\mX*)hFee62%r2-b-h#8Sc\d9&LC,S&7`bFs4=PTj>RjV9P(e5 a2GkI,i1NkJ[;_c:'c7_oE6I"Tfe(XZ&H7_E*M]d(s2-d mY$+0tBPT_6GiWRICrHXYbK!HGXR8Vk$ieB#JSpjAh;4rJq&F>gV+>X-KHAQKe"C)l]o*:; ?_ldq\J21aZ2>0mqOU!MPPBH\Q[@1`3g-5p:1';:R"Tnd2B'AAupg:\HZO+M4S/)-W,gYKR eUo59,8eHJ7b'hO`V[,[V5i*eVdDhX lZ+Yjh7jXThZO-WSAP1k2($uA2ZhA6erf1h#;aJiQ)^A&0gXqK<<;OrTE$DQDKSrh?9dP5r 9H&e:Sn1'HrCm?"`IuQ4DkG)."'E*ZOH0([RM-*ZcK,!P?!n/ZN*<*$(7_I@8d)PN9IDjSn W/hXV-7A`\AHn(qL7rr\:McfZAXnD=bO+lF5HGN[f2n_Y;$k0+oUi#RM>*W`\dS`B<2jrU5 @&;i.T!KlZ()6r&)o\Ke&T^!2aJ]+/!p"mmbrl=_8=<9ZRUOhDGgh".uG*G0Hj*j)MiL0,j oD!fnmiR8m_+GRE"n3T5q4F95E[]03&c/-#qU/iADgdedqB!Je)S[HZ+2RL4s2s-$72>eD+ #iGP-6(oU&8F$7_2KB`%F"b!o_u>m$gVp9D9a55s2"cs5-A9i8/rBW#DGI;OI0i:*>+)qiU L$7=t(8I7UqR:oPQl6O@\G1=U^ln.$I87P.>\7@4dkik#5EYhIej<:8\c9o_*huThjlo)C6 G;^QurI1Q.:((XEgMaW-DO1a=cL5n g?LLtMc2RNh^L2"0)epg,gcVRiL*Z(-^78]oEd945?S.\gk49J7dK,HH5I&j%4YDpmWRP\T qV>2a=g-LpG+/rLcYp5HDYIAkcMr1*hf*h14f]%5ij84OSDJHSU!`+HqOLs%?a8;OG5Iiep OC$t<4+#J;:RN]CO=a>cl2d9LJPR\&\HDS)5%\o.Dr o=f,^p@l>j]E\\XE4c\l_JpPS'?4"lU%;T)gm9C?(e14TBA&g,1X9.9o)?NH$pt`K1!G?^e 6DlG_:A4enEsVi=,l%iG($d[g@lW&F5D+Xna:iJI&DbZGeQ+tjEWpjQf`S-GG")F5*r.FT? #XSG8fT5[T!`?3Rh]-0")a?P_;eAoO]1G>P7qZBA`H45AjMC'a/OQI31?:^02)Z49'"H+os q7#68-W#>)i+lb,]h,DI.8ED"#.$5&0LTX/?b%B^.+GW,h7j<'$$Kf=d,9JYC>&VTYM`PT, ^$R&J$L(M':6Ki+l@B;8>d,l<8\8L+-YkfHg1*K%@bW!R-p2dBRcbu3lDArO!cEXe/d4!GqgNY08k7l]`RA$gH@&`u5H\G04Io ,JeRS8sQ#1BJ0XV[^j1i>hXl3^p!>IS[fUaXJYaA@.P`nlAF,p-'OQf^Tu]=F-!IYp#r##* f`8dj7I0qOQT.\F[)/!#+njEJ2YACF=FI!N#mkA; ef$&+63'beM\FJ.[=!U`MA"/&cGc\ohqiJm!hCmqcPF+iN.[AEt0q#,fA9`&jbZi="<68`e ]cg@lR$bb4T*lh0lK%-qO[&N[.=>L9S*-`=,Th+GKlX&9^7YfaB*;Ck023+rFPk&J8XAm@: N6GZb=b&hAWkNO792e(U9h.R])R'V[ue>8q3kXeiBSG0Me)()T)(be-r6P1:C2E_q9)@bZaX/i:\4%N)'^1Q'-2H8Bi$;"B.%kRko #*c(WL&+E>+@_kqS%q:e#EJ\!+ZW8&#:gH]F("/,9EJK$pP4,o@MU@`>^dFq!'kg?CW`$k! n_n:4V%5pF-kj9Fdlu`gnor.O9Ut"+cEt9Gd3/;bSe_7oBlQ'Fna)Lhn6`>@tSTh6Ek.DVM UjJ(%bWWB]`n7mFASb5.36.E**#h+Um1#o"7I](R,3Wl\S[Z&9k2-q!<-J\SUcWcIk1mS@F ,E8R3s=ci*IGPGmg\BkKWrK;0K=/mXn`(nlk$oo#5iF%lbPOs"lUFCKlCoI_I9D;+*3>mnM A05L$HXmQjRss(IfIb5h2H)dg9G(8VB)_,?uH&fjW`?LH0N!jrCfc%\`5PGc*L`*9Wl6^3S %MpHRjFH9])o`]/\)O3803H]I(+=NB(_*EfGBAq$YHHDaj0bfF#r2JpBn;#DC[gSEqYWS)V GB9e*s>6p7@nXcu^*N3 XL4hF&(6`@[-*eHhIfXL*E/t#p89!9Y?'sR8Z]T`[auGpeSF&FY]_)0p)>70Cu)/"4gri6" 4(cMrOqZCmb?MYO*(:_dIDEmmbXQ`H2PAE^3B=thg[mX$dm/7pik?dhe.]BYHdg#nMMBjmi M6'aB/Wnio=9Z"2uf+K/lHjjM/Trrtqs\L#Bl1r6,%gTD?]\k[9,NEX*!C^a&us1]tN]"Md t?^gQT':je%SDh_)+"_^$1)FF`H?Nd%+#O$O?\8[,;OLqk3]>P=DbS*9/8d?bCT=Ol\BQAh E:-cFt6(>5IU`5INI>=bF^hJFrpi_At=2@!3_B^;A1_c?CGm9./60oqZF25YEW&ui:6COsf 9?+VBY_V5C]UQtm,KdC[0YGtX2oCT6_jb(%XH0f"B1'n*[Z!C;r'%R\i5?n+[k'm77$kVtHphc6ae1nQg0;M&8 g]\A3qRm3i-HFI:PT&FL;5d&+DA`1Ur?T87:`6RO>2G%ImpH<`MBNQ]W384F/3'59'!.toW QF@Yfd_-Wu,u6n8O)s7E6p`LM1E+d&\JeF9R1h8#3`:S@chC]UqR)]BJo9kWd6qE_I0gbSi huaF-]!?AHUE#9[r#$jN]UD:.43hFQUl% k"_0(cCF+DV!H=5m*;^"cG]-GeF&sW5Klf-6B$=T$nB=0;7CA4:LJcGjRK1YH&&&@#?Z-S] _]seqbP0.#>fPu\4-WmDGUK;:^mHP0NA>@6No/[K?-lDQnj?1A:k.\L-5jiXU7n4%+)s&d( Kq9eIPL<&()+'d3T?$2%e5!'%',_d,6S\gnoff$;/8Tb.S_9V&KUEC^4]6:PBk;ocMTc+OU uJSgit1b#eidSZ1tmdUE91H`i7!GD7MKbcJoa[49VCCU.Ft%kr;7(hh,%_G_1'],V*2YkWfC2HC3)dLNlZ"#^$7m5u\"R<"2.C2+#e]6<$rPe6PJl AOk6m8CVKJe:gLoPtKQF9@VKb<96f,&:B6%D^1p"L(IVq-q4#j*We_OK\j^6R2@+FXQec7jgk^&#T1e^GL4ok]9m8-Xl6"B]=>h/\.P7##A6"=Rf53'da#GLqh!=-\*`V0ggbI+PcS=2fU>omY NsITR>7fH#Lp-%ji-J:eD("tTM%gQbXTLs`nmdA0p!+DZ_&C"Usqf]A.GooIc+XH0U`"rL+ a,po&MLk_k,LS/JgI5kA`3SBBQ,fk-4n5Urgn&BVO"+?B^*L'_20gMBoZ/q(./BnDZ_gs(Q*C\S"A?,+@9=I"d"Fk3<[X5#Sch5/i][G0NT(<1cf(na .Ip"tnm^P[.0#;)h+V5N0-jI'+kKh+`U[)2q!ptp5i?\M'U78_Se]N_eVhqe:hec4Oh!+5D(gYM;:kYMIk Fk1r2.b4\G'uX/*;?]U.KYUH>TL/k?AqQaJL);rSTOEJ'7tr><>m:qt*YVs/'B)t+iFR7>1 \lZB=N-9Oh.@SaVAl:$FGHr0i-$1#p)i8u+Q#Q6D:@'_]2FM4J6Kh0sjAf`';kSfuG\ !(Q#dr?!H%6X^IKn/CLM0_CfPCZj@h!0YAKI#r2NqPD3JqRhQ:RJXH:MCK]k\%/\V`JI:s+?kO-%Lp:f_XJYS6W k[)-i)fN8W:F`T^h`*.li- a!Q1f#,3,Bq[CgR,0k5XdK6>UQ10ec7T7`f2%"Gn,gE$4Wt#_%O/GmB(bBa0\E%a]&>d:kj SK5a9H?OuOAeo;K;AY%;tJ3*qcg$PsXmCsFa^h_?T#4\#tnY[;qZ-#]fD\)V5DZ:c@E,#N[ /FHjglCOsU_`EF9o^Z&UnmlPA5Z\)mIu!"(Nh%tGp@*+A0ScHp>L4WH!,ZGc-DGT7(q@N;2"apu_-:0Q[Li<-EbRO sk,M(c2G14or,uH"O%1Ld-IrD0%XQq49M5DKZMSFG4@jG))ZpXDmsuVWRb8q3RiOTofR>=+ nN:%``R50;nOlW:rH[G=j''?Tn.-XETH$k\e%Z$9a&g#PYjrDT>*o:jAAkAVWNl"Ft+h=&J `7K(P)Ni?*c#[tOY!L0,5C`G\WNpPSkE2.=jXHN1k[2oGP^md\N."BV1BE?8_R226'8!U#d Ahok]>DZkSKH8h;jn!S5^Ae'2uI".c3M^rCI9`-kuLR,?$cp%C-U]$B5#:NFP1_,;FlM>_( HAAKupS`D<+o8sVHJd`YfAkF?LO;]UKP4dR#6e.XZLB4HLCe_9M+@j&JG]])qiA;en20Ms] mgj1ruKL6jAgi^!.Nh@IqOZa#[dlY@")JYs/5_n[%C5R,Tbq5I6Z/V@":&[`&;>rCB]@,Tb +_51htN,':]@bS5(RKMah1g\@cuB*f`bO;Aga39d>kDAJ2OQ[SniF9I8.*UsTP6pNPe%G>KuOg2kA:.4BP7S. PUVIlh.k1^=RS8hsP_NhB+,+c/SA@I6N-^\(U6Cr-cVpldb1Fr-j-&^ZY@hs1f0S"MKpE!R *`o-R99-5qlOa#/Up^,mV;+N%#.Od*+!L_[tld%`AqV71VeK$-8jVED0@I`K=p2'HSXDn7A -q0d(*H6huaMa&1oA*lnrkKc`jK%#Z:MdS,cLaQZPc61Ud`eRI&S<025o?p *__=b_/BK]lF%jh99bUdf2U2tHjYtJ+N9NFLe'-5p&dBbu:)NU$"$f[^/I=ekAiT']R$(F< 7oBt2,=g0]XXQokFNlC3;\\%N:=L!>74&Tn=cF4t'hq\.eWjuW=4S+GAQdTLX_h:o(!Ul,f 9P`O?e?,'Kjh1JdH&]BAE)KXXd3GTBA(jqRq^Ra@AHALW+$EWgK*SZE"YNr36a7g--^Gc(G 4*Wh,eIHGMQticrZCnnb@PekHWHPg/b?SIc)!="+T62/dSa'`jpG*@@1pPVC75aem+H+NST M!(qqkdj-[hKNZNqkRf##098_eA)*V$[j`sU(QfZn\>1pG]AfhdL:8?bCkF(1Sq.KNkJYD: 2/qWOUYJ+qOl'cL[r/h0\%hZb6Y,SJ?]#LkRl^H\DX[4KaT<[a@iUhSkV\/!7Q=fBg5a^[K 7o7\3T'[]Co#.TBmp##88'BB2nN-00*t?&+*%quCnPb\J5>`+P'?P8^@9l@j][#cdmel6*c L`+V7F-(FRHf3m>;'",opp#,fCg5GA_HdJYAN%g*RAk.T?$3kH(:b2]NGd_+,tntpcju(XC eFa/DJb8*U)6Id1e3Cq!L*-qju]Yme*^c)a%?e,@[hb&e1-24(rJ`$*+GXA6Aa)(p7GhOBqnX< 57C^+*GG[!Uf8+m;Ar.]71e#g;tcMTg0IA9Ke]H(cC.[8D%'#Zq&TX.EXVt'04iqQW"f`L% =pnb`b9`(dW/.5a.bKqBP!U^:1_sIRoO4B=+O&!OdH1G50(W1W&9U?<`eEB`L):TorS+QZ/ Rj#(n2&$>.R_&lW0m%j:jp#IZK*E?m`87S$igC=BW=Gk/?2>du&3ARiQ!TK^,jAP'0mL/S2 utIhu&Oc;1K(4m`-.U?e01ce\Y@[CMVHm-RNj@ sUGiWI#I/m9XbFm)pF_ZbgQb&plXI5f:?l+hX`a'Nft1='mOHh750'&M)?Y(^LT8U%.M_3] &(FL3Z'lbceP;=[b"n!?!"eJ0q6&?;]O/kTIm]Uk(o#FaQf64E`?"-X=/uM]ZFb>dA_k3l( k/5'a=0MWs2.q8%U]OI3(1Q.+%*n.QeMUO/2`+"(p=ZV9,/UdAWsDX58ds9Bk-M4'?EP=6^=PIERQq<<\IaMuB%r,VaX,scr=P?>2(4)ua$b)m:m^beJ%:'u\=_3/7Fei*6eEE*a!ipdYX7"8 I3QZ+N%bd#HRZVi#5L/6><&N!Xf"VWf]p-cWBF$@:`-nkF&EGt04lA!BgrCAVA]aPRbb'8c 7./'VBp?QU7;R6VAB1<&,tkZk$Z^nKU?"i^]pRepOch1a>O-W)lO/jsN8S(74F=kVVIqB'U #f@Aa0ls"+=G$KbDOAB7<_suUEN0TS^G5C+0b(M&Mcag0R=GpCq^2Dg+]A.#gbe(t_"qa$R qkj;]4jV)ld=S>t5AKaq:Wdri/`loN"!>GII#elR17r6)k8`C-F)0>a"K5A]T!+2,TpS-QU >kC.c]rTZD=&-BT+;%fFq/!N4\%3XoR<:gl?R2#4O#Du_glP"Ir"I9L&`5\fMFfLQ.%dL:? l2!mP;J8+SrQNlQ(':ITCs*5#:E.*KROM:YGX!^k!;Nqt1XYN/VU98J:&OApD)gn]9kJXK: jnW815Jn#l`m%f5Zhk4"'9UTYO:0E2)M!8i@k+%K6.YVcN%3tYkrCPqbY**VI'/a"T0pp%.D4G0?e*Jd0XdI09>&iYiQ?Ki XfOE1lj'PM?(aLQ4T):!jF*b/E$S(mf7->[h'2QnJ)Wj'*418!Moc,6%]_G!8Y\'Ce@&0KrqloG_Pl&9*=,O];R"N2[/L##AG=0Oc0@T"Y6C$F$E5;0*OgZ5q"-ksC IPTrJoK;])`pQQb]96+[h%qB*Xd*2,n80mOR4E>kT-*$I'J61u?#faG%%$h2+T0Y\$Q!t`RK*siqmnVn9'O!UY%]qLt1& RcGqB]FZV&`D+VEci;KG8c1Z*?f/2n#XBXk9Y/.--)/fiG9)=8uDoA*?f#.P'\[!Gi^*q&g 7](;84W%[/2T!O:f_X;9pe6`19cY.Bk^!&`FdOfe$u+&HRG)%/UQ1h%-ai,4b7K:a7*f%*G 7(&eYj$ZNVM9#`Oog&ebgs5h=f?oeEa,1%>=V0U44'.5J4]1@m4V-$FegF<'8^(dU)/nl[e geVa8Qp1ODT*EZIH7-r_C6D0- [q;+5SQ@hY49Ts+qjJfDMZ$KG(s1Sm.>R7UnN/*R!a1V#SG]1T2sldTtGPJoYk\NKMqT&CY +@F2UW,s_RomGSF*oEd]\f`H6\+O9IL_$<2(ks(C*\.]Abo^kr[rYX/>5h+C^.,Yo#QV01F ;"YDt2&,UQ(*91%)F88fXUdcuBi:1+.Y4N2J?)'13CH"oD[<5I.9h7*q#W7&M@*f4Rck&JB8^jYA'UiWtY-E&S8p-h"eY :&^^K->j96@jO1X0-;FYFNLX`N.&!B(j)T28Me>k7P^o(oeFe.D9<:A*L>PPm3k+qJ+5,.5 fp(%ko^iXl3W(q$JR2?dK3$"0cB.$@CH@Disj+][&C@I@kKcs9SW6"7'+)8PqM_BoamG?!- VA$;CB_/'bX*FuQ+*aui%Q4.S3H!"W(pBD%HLPb=)e V-6oZ8sYQ"eZ37tn@BeC>?&@P2PaF>a\$]S /_bLF70G_u@(W-hcdm*3A%7+'4\$p]Bhg8e/*F[KCfB%I*l$g,.57IV>9aPbTq/BF5Gg^"I Y@14#TeU =ruI?`?1[FRt.j:ZA)CtHXa/@g/9kh]^_'<`!rGf>O7a!6a1LR?JK37X"3%,m3d*'nTWQnO JE14EZ:F+Kno@"Ej;(QX?G)o3X+GY+!A9ou4.dX^$p@/:*/YS7)^NgMP0iPl\--]Nh3*eCa <)$tu,3J@!nKm>t<)Bf.fKsVbl0FN0TSEq/VD!@GnF&ph11`>VCZr Met7Ea+]"a+d@_4&)IXlu=kf"Jh^2dG&jYEL3n9hUfHeV4%&]l%!2lldkUhA>)I[QaV/9e; kT""p&:2s%<*,c^+/-53#U-P`TSa`Is(C"bUAH"a\hac+2l#+ZQ8j#3](Dkg8#4gZV"fTVi KpBQS!WlL';;9A)OIjXS#7-dVe5]5_&G'hK:2UQU?<\ug58^#cX.VoWLJG+:4d*42n6JZ\G MAaYt/5:ck'CHX1P%@TrJbK]<$@]XJn<$!>5c%![])9'gX(V]%ZAQD@U*H%tJhL3S0;c40. ,2TFD/a_"\Cc/&8Z'L5>Y[g,lV\(>1`7^1dorDV;A O.C9IB'Hrp^-&&2,?`#ksM49"54'T3?GI@4C9#0J7)fMZ[=AClO[qO+t5ujep8&SY'UfqGf >Tq.8H,mRF[&Uqg-hY%JM7pm!OeBt1qT6j$5*R11Pah<_ZChke,G) Z`J=>`6;[F<6"S)LR!6JqtG@KGGQ6at*S.RgmYi$_c3V%(m%T(NmP"M8t)W EP%"Y>YE@Xbb_>m4_.!r2BN7@\)PNAJr8<,gjj(L:gt-'Ui8=uOe.B:ccSp-ZQ[EFO"2UPo _:pj%W<=;J-c4[Ohr_-WiLeN:=2UJ8VH*QNrE7TT>N(8f`7fHSR?uEo8)g>\eCgXW!;`JI) rZ6.M8?&0Q_E;C8`[T[jPocQoI8No0@uc"jjm(GJXd9:IFqemfQ(U?TRj=$T]P2&RVAE.?, c#:DB](N^6]AA@(Y.f0/L==77$Jb6-(#(-kSaGfm!A*'ul0*jD3ORcc(#R9iSHfg*]d5k+k+B3VqrlAIhWa60uaP W%j?G%?Np"M!d'iamN41T5;fu/)c?8Pd,(2Q+%8"pTFh0bk20&!%42\ffqBS]*Ss7=][tEB YP+\NO9!r'!6PT+ck%>om(M8pg F!uQ/+&nrqrWUZIu&83jeSL8m_@-IJQ<[Tgcp5r(r=E9@29`J_t(PInt5>@T*s,ALULJV+: ';CSco7J_-mn"<#QV\L;Mos(kbX+'o>AROa*"F+N6"3)"ID1JjguK8`Xo[1o`f]>;4CiFpu B'17Cr"e![<*EBKdfBG:4VqM@M4d-/uJ74sWqV,O@XqNXOL9n#<6YPQde\QuC?lkUNTNlbk ==mZuoMa(+ZX)dE.9pie^Q 9=0%W9Pr'fZap#MLIn/fB_;.,7^#goeEcds%]U59]tI,q)mN+8$C8+om=BDs-LdjnG@V4rl;?rYB +uXVG$F[5-Q!t"$j(Y#mET`>S@<-n8olZ_Jk/VpR3?%K'te(3MJqK-HSk<2pMh''0$Rd9,' g7<*FaC8%U&b7WG5>)_MBcp3iJ8Bdj?TZ35Y#6II-3,04d]P6W$oE11SO64BJ7aqBr>.SB9 %ZR\[H`2%1k#;Gp5SO=V)1/-.JcS\EQAC3>1F*u_%:32Zc36q,knN0N&Jb!^udCfU`SgG%k Efl"1%n+eZt92`.9.8<_4h(qf)o^tRHe9(cbI\*I."]\QFAQr4jB>O:k& #ICi>#s1UDd?F%j`+X/Fo?Yp=EYF;@+b0!O^hNPAX@%4W3k-Enkjrdr\l>4kk*bf4Eib?8nU;4;A&;kXo2@h=Z5(p\"]At,]4qL\?gT4c:*Dja)R>!0bbjB8Y)])KUNCjQB.Z#%$> :hl1QFCqf_!0DB#2/\o-q-^e#"k7f+G!nk%\K(CS@UFW?/C/3E=KD 3:S7m-U4Z&:SF0K3$=GCu$Gede%$`ghW81O'C4YlUrXLQmI54gN$T7.GT,qe:ArgmhVNT*.B\G[OSYh9USESSWZG^]lgZkK54aqqnj4ia5U'B0Ki44 u86A5&JV&odaY&L\X=E-hgF!9jpMr!nIsU($SG3m.6^/6b*g'`lCu'q!/sA^Q&M@o-[WWB2 eG"N-GK8`.0nM"0V,adIuVE!HBQ3eT$3RZCKa]kOZ.B!Q&r''up;a3se@<8sF3L3$*McT+t Jm$lJ4G(8FiTO]#po9<"17Va[lg4bm.r*$X<0b3\f.WZWg1dbW+Wb9nj "c==X!+FT^-8%@Wo$C+G#YK7$8r>7"]=/Yf[RPk.RoQSL-mWO7RnD?cc.3eS?$Rr`&mc)Y] !B$B)1F+SLRrF7,=@\sG_^#K:F,L5>&j68W9_ML._Z %6V:)QL\@/a*L>u'r)IHNF(0A)[&k[^6FBKdS'+Y.5`QhOQQP*!:hebKMWAX>\[)=#$n5Dl Fe"'"u@Fb5)7\3_O+C4@=0eaE7PuGQup4jOn(U=fY\XpUcI+$-]2`+/&`@3'd@0V1P?#sYu S+L"5iL8-Ro>io0fR+d9jEqf2AF2,UVR2aE-X&gM,_Lh34(D)Z"^G8tEIM+K_gG UC4?]';JG^I@^i>4Hs-*"cCX#l]e4eV$C@d1$)Zc0JNe%0OmCmqV=n:?P[/X&Votn5M(IDe ^NM::oaNRgE]ZBVt2?tAu+#m"KO(m]uDOoA-H?W(too'rG^uGm@aDM0t<]*3?UD[Kr=hu's XDiUuesacclTK't04jV(Qb!c`nJqt?c1]eZ%qAsi/4XXPbG@mS3=Bh_\\sG8LAQ4GR&$(kR)d@dW^!pXWU,D4kPJJ<,sM^B 2G\(P3).!"h#)9bN$(I?+uoA7auGiH_aVnU<(07\GA?Hk>NO+W(jdmj$_P^jV8=,J3bLWZT .JI?&;J,e1$6iuHGKB)Lc9F,rDN+UiB! rH$mZ(?+b3#Jq2"GH\3)]jQE48F.pjZ$_SPnl1reCto!P8Q][A%#CV8>RqEc8W=Z6\9<+(; ;p_hRi5d$Wd=\Rm!Y5,p7Bmj.`)$I8)WtYUK9)S*_F(k0>dLV#NH_$L(q/l"8SH+k5;Gu2o LMik0?qQN\Ru%XQ?%\*7sY!T<%_6ptZP@X6:QITHO@D+UroCiqt^K3X/-PpA`X[O5\_E"\7 PL+,g.39:S$&SMR&B'#8Mi^br\:U:MTR-F2JX;aJ!9V8/T-5c^gtj$l8>%^^j[3oFX9oFO( ICBl)KU=absb3(iK'g#A0]3/N!'2g\D<&IKL43LYdg`&Q'*!7$]]DL,A9>a()+@7%iY;=,0 >K&^4@A-'04KHUkHca-\LTfHE4O_LV(f#fN?O$jU2S,B?U%sK!,!ltfWRuY_bRHp52+(V,6 Yn\KHO:#9Hj?Y$"nGh!Mt]T^pdbaR">Y0QIDcGt)>-8M$&s4HrE2P mf(`0aMiU-t%_P;bsY7)28S_(IgK9,_uLG[^luElOnhb\UueHk-B?@YVM"++SVA`"^5hDS^G >'rX9\W&TL(DaBa:6*,9#>guJ1eMU_i_8)-Hco.5KaC-u#"Uk13,/Rm1[g(27Jj=F2#X6G]?W'j23]m[/9Ynp]^XA)k+#IQVU+Ji UXLd3-9Ou4Bm)K=/EX-&(LPU=Igs4.*2*3p>`uDS01iuGcG#Oql;lnN(>h6rY-I%M&c)f[E aH)'4.YAR7[=n6Q4Q4dXpFfZs:,IGq5W=@4k"^Tm82X"qgWR7N2?a@uKEtRKN:0O^nPpRue LaW&Li:BQoHBs#H2eMOB[I\;hK3.<\4GT4VkN;c\ #F>0r50,I0`l5'95\p!Sk)g'-[\2o9roc;;H.f$GZkU6\;^[Nd,7@BI6b;A?f%3,.1^oKVe u6<VH)Dp4@_h@b;Z2M Ooe/.pI@kb/;`r=WrA9ePc\Edmbo9X,/NZn-45!o)=_MB!3*XleFT_,BL(HKOpgD@RgcXrf _Q]8Wpg[9/TiHf?e4L-E/EBcNpH3Rie?qnPIA[?+rQ_M1cHP\$m#"dh;,oKU>3ta4Lh$`^= /lfs=q.314'IE)D-2M#>A^iRICNL86NS*@Kd6l??"j Alc$iaM+No]G^eKDRc.eH+^+)7[=Cm1gD;[lXLYX\XdaVr4Xc-RTj\1'D9VM1cG^In.2;&C VdqCQAJ8J5=Q0X3XIBDFeY@*G`KpZgZTiD7eCkf(j@-WN%L iqGeiaEl@@4i4%4>a;DWuAgV>NQ`-%N!ma'S_uFJpkjJ*ZSV"5R*<8Jj`<<\8ooXpJ9lidE U6O4j"B3BnR$C@F4%hE'Jp+CSbV[iJ;meY]sSE%0q]$L%ZctFin!Dg#F++3T+iYLbIC$gga XGW\rYi%GtZU3$/moimAZHQ&8\Wjk``qA*l!L+kPS)kue2STC%co/CI6MQX9XYjBb>TW$KV A:^1;^"`Ru/AbQ?#5tFaG?]3,1Y[(VDrT,(2AL-6g77ZH3NJ&V[ASnB5XFPqZ6\\])KM#*p :hPF=7GIT6#0$pVSmZ./@9"#"X4^N%/lLh($t*1MA%$#^IV<>RBdu_2UImE'Xr(cr).q=G+"R'EK84nV5,_UDS!_>fFrhG(L8qoe1AF?> -a>S`ohdn^GAlbq@%THV3s.LA,ATe.?pgW/@A-8Jm#%0QH:hO@dBPUYWA_sft5$m@m@,R?] Ab^@C0it)/I;64))8Z/]2NV_b_/(10Cb(fQC8uqfChN0RCi76O^hX):0k[Y0Co21kG\dLJ. laJML!W_m!aCFf?%kIqD(Wm\QoWa#b779c!m\d:;jPG;_`)ggLQrg3cp$hTKVes-k]V\j,[ ,rT1BLBpKFg@]Xu2f2MlJ+_kiV&KpZ c[pf7U,P\J/2Bt]jIcmDBGcHN9 H#ZmMEN^=$^Dq77ZS;Oo0d@?KI`HI5a6[!7B:qG>^=DSR-#C.X;(1seP9ku4;hT0qV9!odO CE(Y/P7^6"B[u]"rq/f4DuTiKpK0*ARKa!6E*lglY,q,A<4mD]AUb$mQEb3PZYN&Ap+Hr"57hf 5\8`;uE@/9e-2+esT?g+V?b]dDcs)8*DKJ*\G40?mrOFkFH%m/2neZ@g2fma@AVP.h!Tu.\ IjN54bC^_[LDJYWI;Pm!a653DZ=Z0e^OcD;Kr.$* 1o95^>F1Z[p?1$h9CQ'FM?Bt62;TgDMLT(Gd)(m`Umf/DVmqO^j67#I%!TK0TSh]-M$Uho^ qojDf8DCgUqY*]_)OV"S\L@_n:YWU@h#VqJW6WIoUfLr:Ot.E$&3YZMt$R@#HLJ"?(L6 HO,p>cblNO0g83qtg=U%ti"A%PU?O_0SA9KoBH`t#(?YB(N]isP*i45J8@!`-fC\mUV>m&mVm?a#eOtN!B>C!sakHAV577mdqlirb(C909c<1G \K]E?9ad%DjUIBjmMH=RTO\-[HbdD22-j'Js]JkLS'&j3dM>`H7,Hh=/5mg88l8As0&>M\# Fl'<._VQqQHrU"!#%FJO(Dt=@=2F#)5HQYdd!HEl(&GfJ-L@=tptU7q4:KjFTN9P5/A&>r%d@k0mJOdWIL>bRY&8):9m!U!Ta&H8R%-9;GK8<7VqX#fSTmWg.>$?FXfeML;m\B \@cu"meM=Ho%AE1B/Q1(B62c(e,(\H@o%3qbs^_nVq#R*Re[?5o(gXLG2%GbkB4DnDg0t8# 7#t#ic04uIRbcNbNmjD:/6aV**g/^)T/_(JDZr5UM8P<@)Hbd1R%2GI(8]L\$ebip'AZ.(fuL??$/ 0uD;.!C+q-V$R)@Aaq2td8XBh7a]_4141'rm+k:Y[(P9idaZf%:!L])ga8Km&;*j0[3\OHe J2@ceMK(Pq&&Q6D+EfWHrd@p#.rE?1D[C3,t:d/%";R4_:!AJnfJ4ljM;AoA( =@B:c>Amgj#RZT;h,PhS6>^qd/$kIil_Qi,bEC!Ad$g1b[ ,Gr?#CmpAJ?Bg%YJQO6QF)k,Bm_cMu\erm),Fs1dau!8nOp:BO9VKV^f.#Dg_D:N5\aiVGU Sd%u;.EXY6Y1oFaB)2#/2%jh=Q+@7=VJ2!NU^OWWfhm=qgc`lpM80JE#Ubtahm!+QL`[8Ua +G\ AN&C7[VRAf?A&j;78GRpuNH].fk%)F:_&BC\NNnlP+QO5jO>7kD0bNV[hN6nACl suS&]c!3Yi-%#`,12_:,Ek?SS7SBUIlCd1>58kBjiHfKVk=RKSs?*c&,U]=^ruDPdQg:FgJ NBjY#;H]l"J^?4_(m-_%HZGdAH$9UC_ok![F];`((*G80(LUskdO0K9@$,itQ7h/^K!Z^-d *>?te$F`X,(:79>l9EV_ocIR5%2e"Rti:2)FE-MlWTeklmcC`SPO,7kP1LnZ5T[Y$9:mr+c k[b3se38[c':_9Wi;4R*LhI7F=rsAb/Uk'MOAYjC8#[dXUpQ/G+9APk6OY<oZcUkL4SWHB8h<3"DF+uE)td7Ume$KYN.UeV>L'Q]'!o,$`R>d(D`Ak"8cD2'OU-R2Nl7@h"&YoEPrs+"Y3G"sI/-_I0/WZB!R 0$Y%Ke,&omV09WaMpfKTXM*$p:-VA6u#?OMq2mQ?8,cP@a9;hjS>+$GKf\I9PoOX'1g+PtKRj4B+`-WRMLg^a.4f7T6S[4c7:,*?Z38"(hZt%+\ ]ReNsL1kZFissc.)e@@`\4I@Y5YX&>.<4bs]suen?>KLn/$;Ui\b@mjCjhO7"5(F6Qlg!LS Y^orVU=+nlL3R][5I[)EtW%RoTcDk=pn2D^:U!5DO^%)2d((6'?:#i%HQl]1WpBj3+VE)os M9h_]2%hHYH4Y_"]8\i7oE-E1RdQa7/dC@sDu$TcKN*DI_\]=,_,o29#?f?4CC(5Qf68aRR :rb<2D\,&s+o_8tRJOG%T[d/ZD0Y7!7`m!0*9G7SblEloC%T6(d/2FLAGjZJh.%,h6u0mIE mHtS@u6-;&F[oMB?G^'Y%GL3o+4mUI)4(m@Af_ZIrc["krLG6W=lj%?1=s"/dSK"@dVfV:[ 8%`NK-e5/\Q..ts:O!=7i++[&+%LR)AmrV?LPWP^,BuM5ObcV^R(h,ic;A@CRBJ6@ /:mpkk6*ooNMgdbH%DDp.qa#!RP'[4nl>Xn$D`EfA'ZkJ[[f(j7gM41^HC,HJIhYF;l(>)hLMh`iLMr84.=I\50ekYV7#A)qlonWY s9@!Lr9hi<2XU&P)4r;T/1);tu0DNcFo3:!Ct&jYIX0FU^0oM:/[$R%4VcWp.J$MB/-%=q]MYI sT_^Cd^m&Wn7_/[G,Q[eJd?&0WeH5q3R7V@c*F)K1r;d7"b1RhW&tSZek):T2#OarRC%H"# DJiU%6),n^`#nf`huOK01[HPb(Z(_MB;:2D"\l5ej1)'MiVZ'PVkR/bR+):>0D_5%[9Rfm[ B"Hg#0&[oj`Se&Ve9u6B@+ibF5,TT0i'Td/6n^SY=kSf!X6W(60jC![=V&BLE+!K]j;266N $6N^5*C7OU!:q59f*:N(#;CW4Or#9>)UF5<$";0l.'j3M.^0JI_X?Lm&=Xo-2^?\F?7tsoV k=oY]H%Qs$]r+L;H"lu!#e/A*Fk&u+o:_I)Y)blnjeQJTo'[Pg(rY*%W=IEiKXrEM[tu1&( 6Lf;#h6t<=mOa&FuJ2i5-/dNu#%)(@ndId^F+7.2)3c(gu\CTo'F*3Z5al'S3>"Ti;t^:G% ab)hBau&Pk$A9eOg_h+s^?Eq^;Y*#W1l*XA(>@nA26[4;]^*[1%h&k=[?)_oe`1(tlf6b;6 MdMlW/(1@Fhdl//N4!*uX1Qt'fJZ'33XWDKD2%dAV1JU^KiXM]n*au&d1E:bXr9GuE+S#n! ;f\u`\e5"p23G&A@%fD3S/fA"'=0&H8#CY&/eijM2f]?g76X[+)$dLO3n(DY5fa4^ck$3M# gV._0&\$/QR!6j,I>cBo?pq876+os$LKVq'B^Z_kpPFY.J,DG1c-'8V_GJB0_@^de4(\R]b82T&-4O(0fU ([658cP/bEO)Zt1ij6578D0!b";<-(QdbqDul8.erX@8[q.c?\AL)b5BGPXRtHPSrH0^_>T t<2W?QX%LmEmuQ6G"3Nab:_$E^1Xs5t<6%[3b!G!f'7dnY1KR;7"dg)'ir 8l0('PBf32q)U!e)Bf"b1uSFcTFh0a)^.f_Pg)#V[7_5U;68Cj+_DCPs%h/?+Z$AHe$W+S3 mZ%O4>;m[N%H8QePt#N4`sZ-'AZOgY9^DL5.+laok-J7"UlQU1K%j4Y8eM0E:RLE5dV"F6& -$qM@9MI.T@ETe0S7^.p99GoJA9iFf-]b>1p9P>83K0<0lFK9U^"@/<\70'%KI:b=6X#/eu heJP$Y#[n!fL0(n*l1k/%rlS"$(H/Z=U!T.+(ZWi&geWj?Hqdn>^8R]+@TZL]P 5R*pR&0Q;`[OT4(g`$9D@2=GUcEJ00F_2@A"8+HKQBtNnRo@:.*$FGRPsUCl0iX@]<>A;0< jQS"%98^I37+fFB`D+5CM^H*_u8799:hQP>dZjqd?V?e6N0[jPPFogHUl'*41-5scJh>t,RV>h.AH(IrRFi", o1)E$V_2cj<"F^C@%FqIar_^Ke]n/m5WEgJ(mU2h>lc"n2GGSc!W=,1H_fH+JD)POeZ5lkV a.='JlH5E&s-dWR14qGGOB",*VpU+VO:)flR%56KYF^$l"aK2h2AbM6/Y$;HGg'9RHjWOC) !Nm+:bBccA4TOPp=,DEZN#n\&)HY=:7)*G:SS=C^JJ\n'+Kl':W"<"2_R3$P[^C^S-\B=bC \RZa2.(1Ndt?:7K:sQ!!>6/VOq.Rq(a-g4@;ZJS6l*:9(81F>JUq^)m;E#`.[KmMFfAMF$# irTLY.5GQ).ZoGDN5E%<3,,31"i5Fc!t&(EkOL_51CWf6!?HM\rXU=%!YZ0H.E#Fh#8H6LT 'hK6AoH*.c``kFN;0S/GFsM>3Ma&o3,%l]0WdNu7HH,K)]sbWQ'YH2$ch3/MuQdqCfP<-2_QP^C&3"?m8cj?Dm&4$7X3$?)*-#7deK"7!gQnt#$s(k`XKD*]G)5OT^e eqlt('0:%@8%J^@>4cr'Hq9#_*/Xm[M+44$K3HNJ>a)(Jfo*)Lt*=QQ3=[M#:,)1e(o!R0'pn?cVg)1g=[\?hoS\"]/3'1"r((rqRo=egT/N4& &3c0$bO!dVVBHs-c82^0#u`L4;EVA`sA>%]jN^3h-jp,FOqi)54\`3N&<-$a>@5KL)/^Qq`8O<#4E0KttD:! Gi.Sc^c5($=Otm+J]U#KsR73Zb&H.i3Ot[qhXR*of;QM=mrbdo5OO$TA*/M+T=4/@6ko=MUYDQ=];E>YF_7\OK]c5G66\N\+/>EP/URH\5Hf_u1HbRno)IY$$Z*"un8/l_a)ke;^>*#] =$YI5R'#:_8iPl\8M0JUbXW/RcAA9/]LVVEt)Bf_"'baGklD28g*eE(ZH(.\t@M=,8XX'+4 HJbj8GK%kM)WaL0JFj4"' ;9FS5qWs]WY,+ob8WmW4L`Kr\][9l$_]G5>@l$1+P=;-[G+p1(k)j$1S,T0[PTrS@=\&U_m _bs]HJ[@iKp6A(p&),2]IggS!23GQX%@#'d:,_qk_\a>noChdMoD1'5K9h/.`tcEZFVGDeG cV8(69Ye/^oQlnlV=4N%Xs_qe8*rDgR[^XWW7F0 OJ=8bT1lh:F+$n[&3G$/MRqWOa^jUc/%[CZm7d8`2Ug_Uf5uH-7=F7m>(kW(1Hrc_HQQOHMcQik)LF2GWQ#3I##dJM$nYC&Kt[&!9t:Zh9%jW(LX0RiIT2O) p@([bJ#4[_1gi6LRn<:[+s!P?8p+m4.dMIc2KHC/XH)FJ(&f4jW7/Aqo?2#J[ep?qW!R^>m ]Ya%Cnb-&cniV^3@thIF8!>kR$5iU%.7mQfYnKWe\8 BE*F7u;\36-1%/jl?n[o*%L^T)\%OBi/Wh8!OgXn1ib@$&k6/!5cDg5^e*s(dLJOU4lS_Td U9u3J5i-W8.NIFsm%,SQ\!W!m:([>*Z*eCa<*rP3Wc,IFNh*3U[OFdiW)H_FG_EI#$^$YHA 8mB"!@-oKZG/rLT>Mks2&V4U5T_&sBO:4E5(`jA-r[7H3+nr\spYUQ>>=h,P7u6DNc$h\K5 !:?=&`c09j@c-T6!*.(PN?/QGeEYdDmC?kg`GGCci]]uIVmHHbN>K>'0*bi];baOkND\3dP 4fM(tNuK]H/s+jZg!,Te%*3$1[!Ts+*GnOB==\&IF.XiK2]64s:Mp7,j>2ZsGI)NCMrjf^s VY+d#=VP$'W5;(7c&jc\;=^,5h;^0WDb;fPo`CoNE#\a8m86(h';oNDtJM+=C?Bp=Kt/tYk :<9dIeNF&SdX&a#$](KgS?*MrIi#4n4,B^oQPPkjRQGXelsSic";$bN:q0SS^;'B>$VTbS:;QffQS/sU"O2^1#q-;cP5FKm]FF'HE7n^Z"_YI/]a?_r]V9E2Cl$5P(]O3j9"kl5N*0RVWC!$kif\:h1XQ6834'#XXW;.h" c6e1D.t0^L_/6nng7&&b]OZnmQ:5m0EE-LnbG7OVF!@2DE_(d5n/b]+XnZ/gBTa>*=@+@pN 0M^1iV<0&?I11[")8ht4\-kBtTl?UBIe@(7&`qe%SQNhQL1!EQAcSJ9O/Cu^QP>p9r:%OV* 3_hJ>DJ#$mTpe?7#&s'0)++]]@g[m/L+*^h'ba$`<+R.A;D`5<85b\;.nik5eLa@NUsY,SP D24f;:JSl:K(7N/QYnOPuV!