grthtrhthjhtyjytjytkergtrhtrjytjerhrfh4:24 29/09/2026+ ä`A¯­ZãóZa€R`th0tRt.RaOt^RIt^RIt^RIt^RIt^RIHt^RI H t ^RI H t H t Ht^RIHtHt^RIHtHtHtHtHtHtHtHtHt^R IHtHtHtHtHtH t H!t!H"t"H#t#H$t$^R I%H&t&^R I'H(t(^R I)H*t*H+t+H,t,]!R 4t-]t.!RR]/4t0Rt1RbRlt2Rt3RbRlt4Rt5Rt6Rt7RcRlt8Rt9Rt:RbRlt;RbRltRt?RR/R lt@]+!R!Rd4tAR"R#/R$ltB/tCR%tD]D!R&R'4R(4tE]D!R)4R*4tF]D!R+4R,4tG]D!R-R.4R/4tH]D!R04R14tI]D!R2R34R44tJReR5ltKR6tL]D!R7R84R94tMR:tN]D!R;4R<4tO]D!R=4R>4tPADAEAFAGAHAIAJAMAOAPRfR?R#/R@lltQRfRAR/RBlltRRC^RRD/REltS!RFR4tTRGtURbRHltVRItWRJtXRKtYRLtZRgRMlt[RNRROR#RPRQRR^/RSRTllt\RURVlt]^]P¼P¾,^,t`]^kRWRXltaRYRZltbR[tcR\R]ltdR^te^R_IfHeteR# ]gdR#i;i)ha× Basic statistics module. This module provides functions for calculating statistics of data, including averages, variance, and standard deviation. Calculating averages -------------------- ================== ================================================== Function Description ================== ================================================== mean Arithmetic mean (average) of data. fmean Fast, floating-point arithmetic mean. geometric_mean Geometric mean of data. harmonic_mean Harmonic mean of data. median Median (middle value) of data. median_low Low median of data. median_high High median of data. median_grouped Median, or 50th percentile, of grouped data. mode Mode (most common value) of data. multimode List of modes (most common values of data). quantiles Divide data into intervals with equal probability. ================== ================================================== Calculate the arithmetic mean ("the average") of data: >>> mean([-1.0, 2.5, 3.25, 5.75]) 2.625 Calculate the standard median of discrete data: >>> median([2, 3, 4, 5]) 3.5 Calculate the median, or 50th percentile, of data grouped into class intervals centred on the data values provided. E.g. if your data points are rounded to the nearest whole number: >>> median_grouped([2, 2, 3, 3, 3, 4]) #doctest: +ELLIPSIS 2.8333333333... This should be interpreted in this way: you have two data points in the class interval 1.5-2.5, three data points in the class interval 2.5-3.5, and one in the class interval 3.5-4.5. The median of these data points is 2.8333... Calculating variability or spread --------------------------------- ================== ============================================= Function Description ================== ============================================= pvariance Population variance of data. variance Sample variance of data. pstdev Population standard deviation of data. stdev Sample standard deviation of data. ================== ============================================= Calculate the standard deviation of sample data: >>> stdev([2.5, 3.25, 5.5, 11.25, 11.75]) #doctest: +ELLIPSIS 4.38961843444... If you have previously calculated the mean, you can pass it as the optional second argument to the four "spread" functions to avoid recalculating it: >>> data = [1, 2, 2, 4, 4, 4, 5, 6] >>> mu = mean(data) >>> pvariance(data, mu) 2.5 Statistics for relations between two inputs ------------------------------------------- ================== ==================================================== Function Description ================== ==================================================== covariance Sample covariance for two variables. correlation Pearson's correlation coefficient for two variables. linear_regression Intercept and slope for simple linear regression. ================== ==================================================== Calculate covariance, Pearson's correlation, and simple linear regression for two inputs: >>> x = [1, 2, 3, 4, 5, 6, 7, 8, 9] >>> y = [1, 2, 3, 1, 2, 3, 1, 2, 3] >>> covariance(x, y) 0.75 >>> correlation(x, y) #doctest: +ELLIPSIS 0.31622776601... >>> linear_regression(x, y) #doctest: LinearRegression(slope=0.1, intercept=1.5) Exceptions ---------- A single exception is defined: StatisticsError is a subclass of ValueError. Ú NormalDistÚStatisticsErrorN©ÚFraction)ÚDecimal)ÚcountÚgroupbyÚrepeat)Ú bisect_leftÚ bisect_right) ÚhypotÚsqrtÚfabsÚexpÚerfcÚtauÚlogÚfsumÚsumprod) ÚisfiniteÚisinfÚpiÚcosÚsinÚtanÚcoshÚasinÚatanÚacos)Úreduce)Ú itemgetter)ÚCounterÚ namedtupleÚ defaultdictç@có€]tRt^˜tRtR#)r©N)Ú__name__Ú __module__Ú __qualname__Ú__firstlineno__Ú__static_attributes__r&óÚ1/opt/alt/python314/lib64/python3.14/statistics.pyrr˜s†Ûr,cóf€\V4wrpV^8d \R4h\W#, V4#)a\Return the sample arithmetic mean of data. >>> mean([1, 2, 3, 4, 4]) 2.8 >>> from fractions import Fraction as F >>> mean([F(3, 7), F(1, 21), F(5, 3), F(1, 3)]) Fraction(13, 21) >>> from decimal import Decimal as D >>> mean([D("0.5"), D("0.75"), D("0.625"), D("0.375")]) Decimal('0.5625') If ``data`` is empty, StatisticsError will be raised. z%mean requires at least one data point)Ú_sumrÚ_convert)ÚdataÚTÚtotalÚns& r-Úmeanr5žs3€ô"�t“*�K€Aˆa؈1„uÜÐEÓFÐFÜ �E•I˜qÓ !Ð!r,c óî€Vf3\V4p\V4pV'g \R4hW2, #\V\\34'g \V4p\W4p\T4pT'g \R4hYV, # \d@\4p\\ \ ^4\ Y444p\T4pL½i;i \d \R4hi;i)záConvert data to floats and compute the arithmetic mean. This runs faster than the mean() function and it always returns a float. If the input dataset is empty, it raises a StatisticsError. >>> fmean([3.5, 4.0, 5.25]) 4.25 z&fmean requires at least one data pointz(data and weights must be the same lengthzsum of weights must be non-zero)ÚlenrÚ TypeErrorrÚmapr ÚzipÚnextrÚ isinstanceÚlistÚtuplerÚ ValueError)r1Úweightsr4r3ÚcounterÚnumÚdens&& r-ÚfmeanrDµsÞ€ð‚ð Ü�D“ ˆAô˜“JˆEçÜ!Ð"JÓKÐ Kà�yÐä �g¤¤e˜}× -Ò -Ü�w“-ˆðJÜ�dÓ$ˆô ˆw‹-€Cç ÜÐ?Ó@Ð@à �9Ðøô5ô ä“gˆGÜœœZ¨›]¬C°Ó,>Ó?Ó@ˆEÜ�W“ ŠAð  ûô$ ôJÜÐHÓIÐIðJús† BÁ CÂACÃCÃC4cóZaa€^oRoVV3Rlp\\\V!V444pS'g \R4h\P !V4'd\P #S'd(V\P8Xd\P #R#\VS, 4#)aVConvert data to floats and compute the geometric mean. Raises a StatisticsError if the input dataset is empty or if it contains a negative value. Returns zero if the product of inputs is zero. No special efforts are made to achieve exact results. (However, this may change in the future.) >>> round(geometric_mean([54, 24, 36]), 9) 36.0 Fc3óº<"€\V^R7FDwopVR8”g\P!V4'dVx€K/VR8XdRoK:\RV4h R#5i)é©ÚstartçTzNo negative inputs allowedN)Ú enumerateÚmathÚisnanr)ÚiterableÚxÚ found_zeror4s& €€r-Úcount_positiveÚ&geometric_mean..count_positiveòsMøé€ä˜h¨a×0‰DˆAˆqØ�3Œwœ$Ÿ*š* QŸ-š-Ø”Ø�c”Ø!’ ä%Ð&BÀAÓFÐFó 1ùs ƒ6Aº!AzMust have a non-empty datasetrJ) rr9rrrLrMÚnanÚinfr)r1rQr3rPr4s& @@r-Úgeometric_meanrUàsù€ð €AØ€JöGô ””S™.¨Ó.Ó/Ó 0€Eç ÜÐ=Ó>Ð>Ü ‡z‚z�%×ÒÜ�x‰xˆßØ ¤D§H¡HÔ,Œt�x‰xÐ5°#Ð5ä ˆu�q�y‹>Ðr,có²€\V4VJd \V4pRp\V4pV^8d \R4hV^8XdSVfOV^,p\ V\ P \34'dV^8d \V4hV#\R4hVf\^V4pTpMS\V4VJd \V4p\V4V8wd \R4h\R\W444wrep\W4p\R\W444wrxp T^8:d \R4h\YX, T4# \d^#i;i)a£Return the harmonic mean of data. The harmonic mean is the reciprocal of the arithmetic mean of the reciprocals of the data. It can be used for averaging ratios or rates, for example speeds. Suppose a car travels 40 km/hr for 5 km and then speeds-up to 60 km/hr for another 5 km. What is the average speed? >>> harmonic_mean([40, 60]) 48.0 Suppose a car travels 40 km/hr for 5 km, and when traffic clears, speeds-up to 60 km/hr for the remaining 30 km of the journey. What is the average speed? >>> harmonic_mean([40, 60], weights=[5, 30]) 56.0 If ``data`` is empty, or any element is less than zero, ``harmonic_mean`` will raise ``StatisticsError``. z.harmonic mean does not support negative valuesz.harmonic_mean requires at least one data pointzunsupported typez*Number of weights does not match data sizec3ó$"€TFqx€K R#5i©Nr&)Ú.0Úws& r-Ú Ú harmonic_mean..9sé€Ð GÑ,F q¤Ó,Fùs‚c3óJ"€TFwrV'd W, M^x€K R#5i)éNr&)rYrZrOs& r-r[r\=sé€ÐPÑ=O±T°Q¯˜qžu¨qÔ0Ó=Oùó‚!#zWeighted sum must be positive)Úiterr=r7rr<ÚnumbersÚRealrr8r r/Ú _fail_negr:ÚZeroDivisionErrorr0) r1r@Úerrmsgr4rOÚ sum_weightsÚ_r2r3rs && r-Ú harmonic_meanrhsD€ô0 ˆDƒz�TÓÜ�D‹zˆà =€Fä ˆD‹ €A؈1„uÜÐNÓOÐOØ ˆaŒ�G’OØ ��GˆÜ �aœ'Ÿ,™,¬Ð0× 1Ò 1Ø�1ŒuÜ% fÓ-Ð-؈HäÐ.Ó/Ð /à‚ܘ˜A“,ˆØ‰ ä �‹=˜GÓ #ܘ7“mˆGÜ ˆw‹<˜1Ô Ü!Ð"NÓOÐ OÜ Ñ G¬I°gÔ,FÓ GÓGш˜ðܘÓ&ˆÜÑP¼SÀÔ=OÓPÓP‰ˆ�%ð �„zÜÐ=Ó>Ð>ä �KÕ'¨Ó +Ð+øô ôÚðúsÃ:)EÅ EÅEcóä€\V4p\V4pV^8Xd \R4hV^,^8XdW^,,#V^,pW^, ,W,,^, #)a"Return the median (middle value) of numeric data. When the number of data points is odd, return the middle data point. When the number of data points is even, the median is interpolated by taking the average of the two middle values: >>> median([1, 3, 5]) 3 >>> median([1, 3, 5, 7]) 4.0 úno median for empty data©Úsortedr7r)r1r4Úis& r-ÚmedianrnGsa€ô �$‹<€DÜ ˆD‹ €A؈A„vÜÐ8Ó9Ð9؈1…u�„zؘ•F�|Ðà ��FˆØ˜•U• ˜d�gÕ%¨Õ*Ð*r,có¸€\V4p\V4pV^8Xd \R4hV^,^8XdW^,,#W^,^, ,#)zíReturn the low median of numeric data. When the number of data points is odd, the middle value is returned. When it is even, the smaller of the two middle values is returned. >>> median_low([1, 3, 5]) 3 >>> median_low([1, 3, 5, 7]) 3 rjrk©r1r4s& r-Ú median_lowrq_sQ€ô �$‹<€DÜ ˆD‹ €A؈A„vÜÐ8Ó9Ð9؈1…u�„zؘ•F�|Ðà˜•F˜Q•JÕÐr,cóp€\V4p\V4pV^8Xd \R4hW^,,#)zçReturn the high median of data. When the number of data points is odd, the middle value is returned. When it is even, the larger of the two middle values is returned. >>> median_high([1, 3, 5]) 3 >>> median_high([1, 3, 5, 7]) 5 rjrkrps& r-Ú median_highrsxs5€ô �$‹<€DÜ ˆD‹ €A؈A„vÜÐ8Ó9Ð9Ø �Q•�<Ðr,có~€\V4p\V4pV'g \R4hW^,,p\W4p\ WVR7p\ V4p\ V4pY1R, , pTpYT, pYaT^, T, ,T, ,# \ d \R4hi;i)aEstimates the median for numeric data binned around the midpoints of consecutive, fixed-width intervals. The *data* can be any iterable of numeric data with each value being exactly the midpoint of a bin. At least one value must be present. The *interval* is width of each bin. For example, demographic information may have been summarized into consecutive ten-year age groups with each group being represented by the 5-year midpoints of the intervals: >>> demographics = Counter({ ... 25: 172, # 20 to 30 years old ... 35: 484, # 30 to 40 years old ... 45: 387, # 40 to 50 years old ... 55: 22, # 50 to 60 years old ... 65: 6, # 60 to 70 years old ... }) The 50th percentile (median) is the 536th person out of the 1071 member cohort. That person is in the 30 to 40 year old age group. The regular median() function would assume that everyone in the tricenarian age group was exactly 35 years old. A more tenable assumption is that the 484 members of that age group are evenly distributed between 30 and 40. For that, we use median_grouped(). >>> data = list(demographics.elements()) >>> median(data) 35 >>> round(median_grouped(data, interval=10), 1) 37.5 The caller is responsible for making sure the data points are separated by exact multiples of *interval*. This is essential for getting a correct result. The function does not check this precondition. Inputs may be any numeric type that can be coerced to a float during the interpolation step. rj)Úloz$Value cannot be converted to a floatr$)rlr7rr r Úfloatr?r8) r1Úintervalr4rOrmÚjÚLÚcfÚfs && r-Úmedian_groupedr|‹s·€ôV �$‹<€DÜ ˆD‹ €Aß ÜÐ8Ó9Ð9ð �!�V� €Aô �DÓ€AÜ�T Ô#€AðAܘ“?ˆÜ �!‹Hˆð �s�NÕ€AØ €BØ �€AØ ˜1˜q�5 2�:Õ&¨Õ*Õ *Ð*øô ôAÜÐ>Ó@Ð@ðAús ÁB%Â%B<có €\\V44P^4pV^,^,# \d\ R4Rhi;i)aDReturn the most common data point from discrete or nominal data. ``mode`` assumes discrete data, and returns a single value. This is the standard treatment of the mode as commonly taught in schools: >>> mode([1, 1, 2, 3, 3, 3, 3, 4]) 3 This also works with nominal (non-numeric) data: >>> mode(["red", "blue", "blue", "red", "green", "red", "red"]) 'red' If there are multiple modes with same frequency, return the first one encountered: >>> mode(['red', 'red', 'green', 'blue', 'blue']) 'red' If *data* is empty, ``mode``, raises StatisticsError. zno mode for empty dataN)r!r`Ú most_commonÚ IndexErrorr)r1Úpairss& r-Úmoder�ÓsP€ô. ”D˜“JÓ × +Ñ +¨AÓ .€EðBØ�Q�x˜�{ÐøÜ ôBÜÐ6Ó7¸TÐAðBús ¥5µA cóÔ€\\V44pV'g.#\VP44pVP 4UUu.uFwr4WB8XgK VNK upp#uuppi)a Return a list of the most frequently occurring values. Will return more than one result if there are multiple modes or an empty list if *data* is empty. >>> multimode('aabbbbbbbbcc') ['b'] >>> multimode('aabbbbccddddeeffffgg') ['b', 'd', 'f'] >>> multimode('') [] )r!r`ÚmaxÚvaluesÚitems)r1ÚcountsÚmaxcountÚvaluers& r-Ú multimoder‰ñsQ€ô”T˜$“ZÓ €Fß Øˆ Ü�6—=‘=“?Ó#€HØ&,§l¡l¤nÔ J¡n‘l�e¸Ñ8I�EˆE¡nÒ JÐJùÓ Js Á A$ÁA$cót€\W4wr#rEV^8d \R4h\W5^, , V4#)a^Return the sample variance of data. data should be an iterable of Real-valued numbers, with at least two values. The optional argument xbar, if given, should be the mean of the data. If it is missing or None, the mean is automatically calculated. Use this function when your data is a sample from a population. To calculate the variance from the entire population, see ``pvariance``. Examples: >>> data = [2.75, 1.75, 1.25, 0.25, 0.5, 1.25, 3.5] >>> variance(data) 1.3720238095238095 If you have already calculated the mean of your data, you can pass it as the optional second argument ``xbar`` to avoid recalculating it: >>> m = mean(data) >>> variance(data, m) 1.3720238095238095 This function does not check that ``xbar`` is actually the mean of ``data``. Giving arbitrary values for ``xbar`` may lead to invalid or impossible results. Decimals and Fractions are supported: >>> from decimal import Decimal as D >>> variance([D("27.5"), D("30.25"), D("30.25"), D("34.5"), D("41.75")]) Decimal('31.01875') >>> from fractions import Fraction as F >>> variance([F(1, 6), F(1, 2), F(5, 3)]) Fraction(67, 108) z*variance requires at least two data points©Ú_ssrr0)r1Úxbarr2ÚssÚcr4s&& r-Úvariancer�s8€ôP�d“/�K€Aˆ1؈1„uÜÐJÓKÐKÜ �B˜a�%•L !Ó $Ð$r,cóf€\W4wr#rEV^8d \R4h\W5, V4#)aÐReturn the population variance of ``data``. data should be a sequence or iterable of Real-valued numbers, with at least one value. The optional argument mu, if given, should be the mean of the data. If it is missing or None, the mean is automatically calculated. Use this function to calculate the variance from the entire population. To estimate the variance from a sample, the ``variance`` function is usually a better choice. Examples: >>> data = [0.0, 0.25, 0.25, 1.25, 1.5, 1.75, 2.75, 3.25] >>> pvariance(data) 1.25 If you have already calculated the mean of the data, you can pass it as the optional second argument to avoid recalculating it: >>> mu = mean(data) >>> pvariance(data, mu) 1.25 Decimals and Fractions are supported: >>> from decimal import Decimal as D >>> pvariance([D("27.5"), D("30.25"), D("30.25"), D("34.5"), D("41.75")]) Decimal('24.815') >>> from fractions import Fraction as F >>> pvariance([F(1, 4), F(5, 4), F(1, 2)]) Fraction(13, 72) z*pvariance requires at least one data pointr‹)r1Úmur2rŽr�r4s&& r-Ú pvariancer“6s4€ôJ�d“-�K€Aˆ1؈1„uÜÐJÓKÐKÜ �B•F˜AÓ Ðr,có€\W4wr#rEV^8d \R4hW5^, , pVPpVPp\ T\4'd \Yx4#\Yx4# \d \ R4hi;i)z¤Return the square root of the sample variance. See ``variance`` for arguments and other details. >>> stdev([1.5, 2.5, 2.5, 2.75, 3.25, 4.75]) 1.0810874155219827 ú'stdev requires at least two data pointsúinf or nan encountered in data© rŒrÚ numeratorÚ denominatorÚAttributeErrorr?Ú issubclassrÚ_decimal_sqrt_of_fracÚ_float_sqrt_of_frac) r1r�r2rŽr�r4ÚmssÚ mss_numeratorÚmss_denominators && r-Ústdevr¡asˆ€ô�d“/�K€Aˆ1؈1„uÜÐGÓHÐHØ �A•�,€Cð;ØŸ ™ ˆ ØŸ/™/ˆô�!”W×ÒÜ$ ]ÓDÐDÜ ˜}Ó >Ð>øô ô;ÜÐ9Ó:Ð:ð;ús ±A5Á5B có€\W4wr#rEV^8d \R4hW5, pVPpVPp\ T\4'd \Yx4#\Yx4# \d \ R4hi;i)z©Return the square root of the population variance. See ``pvariance`` for arguments and other details. >>> pstdev([1.5, 2.5, 2.5, 2.75, 3.25, 4.75]) 0.986893273527251 z'pstdev requires at least one data pointr–r—) r1r’r2rŽr�r4ržrŸr s && r-Úpstdevr£xs„€ô�d“-�K€Aˆ1؈1„uÜÐGÓHÐHØ �&€Cð;ØŸ ™ ˆ ØŸ/™/ˆô�!”W×ÒÜ$ ]ÓDÐDÜ ˜}Ó >Ð>øô ô;ÜÐ9Ó:Ð:ð;ús ªA.Á.Bcóaa€\V4p\V4V8wd \R4hV^8d \R4h\V4V, o\V4V, o\V3RlV4V3RlV44pW2^, , #)a@Covariance Return the sample covariance of two inputs *x* and *y*. Covariance is a measure of the joint variability of two inputs. >>> x = [1, 2, 3, 4, 5, 6, 7, 8, 9] >>> y = [1, 2, 3, 1, 2, 3, 1, 2, 3] >>> covariance(x, y) 0.75 >>> z = [9, 8, 7, 6, 5, 4, 3, 2, 1] >>> covariance(x, z) -7.5 >>> covariance(z, x) -7.5 zDcovariance requires that both inputs have same number of data pointsz,covariance requires at least two data pointsc3ó4<"€TF qS, x€K R#5irXr&)rYÚxir�s& €r-r[Úcovariance..ªsøé€Ð)¡q ˜—9’9£qùóƒc3ó4<"€TF qS, x€K R#5irXr&©rYÚyiÚybars& €r-r[r§ªsøé€Ð+BÁ¸"°¯IªIÃùr¨)r7rrr)rOÚyr4Úsxyr�r¬s"" @@r-Ú covariancer¯‘svù€ô$ ˆA‹€AÜ ˆ1ƒv�„{ÜÐdÓeÐe؈1„uÜÐLÓMÐMÜ �‹7�Q�;€DÜ �‹7�Q�;€DÜ Ô)¡qÓ)Ô+BÁÓ+BÓ C€CØ �a•%�=Ðr,ÚmethodÚlinearcóR€\V4p\V4V8wd \R4hV^8d \R4hVR9d\RV: 24hVR8Xd*V^, R, p\WR7p\WR7pMR\ V4V, p\ V4V, pVUu.uF qwV, NK ppVUu.uF qˆV, NK pp\ W4p \ W4p \ W4p V \ W«4, #uupiuupi \d \R4hi;i) a)Pearson's correlation coefficient Return the Pearson's correlation coefficient for two inputs. Pearson's correlation coefficient *r* takes values between -1 and +1. It measures the strength and direction of a linear relationship. >>> x = [1, 2, 3, 4, 5, 6, 7, 8, 9] >>> y = [9, 8, 7, 6, 5, 4, 3, 2, 1] >>> correlation(x, x) 1.0 >>> correlation(x, y) -1.0 If *method* is "ranked", computes Spearman's rank correlation coefficient for two inputs. The data is replaced by ranks. Ties are averaged so that equal values receive the same rank. The resulting coefficient measures the strength of a monotonic relationship. Spearman's rank correlation coefficient is appropriate for ordinal data or for continuous data that doesn't meet the linear proportion requirement for Pearson's correlation coefficient. zEcorrelation requires that both inputs have same number of data pointsz-correlation requires at least two data pointsÚrankedúUnknown method: rHz&at least one of the inputs is constant>r±r³éþÿÿÿ)r7rr?Ú_rankrrÚ _sqrtprodrd) rOr­r°r4rIr�r¬r¦r«r®ÚsxxÚsyys ""$ r-Ú correlationrº®s €ô4 ˆA‹€AÜ ˆ1ƒv�„{ÜÐeÓfÐf؈1„uÜÐMÓNÐNØ Ð)Ô)ÜÐ+¨F©:Ð6Ó7Ð7à �ÔØ�Q•˜"• ˆÜ �!Ô !ˆÜ �!Ô !‰ô�A‹w˜�{ˆÜ�A‹w˜�{ˆÙ!"Ó #¡˜2�$�YˆY¡ˆÐ #Ù!"Ó #¡˜2�$�YˆY¡ˆÐ #ä �!‹-€CÜ �!‹-€CÜ �!‹-€CðHØ”Y˜sÓ(Õ(Ð(ùò $ùÚ #øô ôHÜÐFÓGÐGðHúsÂ'DÂ>D Ã3DÄD&ÚLinearRegressionÚ proportionalFcóèa €\V4p\V4V8wd \R4hV^8d \R4hV'gH\V4V, p\V4V, o VUu.uF qUV, NK ppV 3RlV4p\W4R,p\W4pWg, pT'dRMS TX,, p \ Y‰R7#uupi \d \R4hi;i)aOSlope and intercept for simple linear regression. Return the slope and intercept of simple linear regression parameters estimated using ordinary least squares. Simple linear regression describes relationship between an independent variable *x* and a dependent variable *y* in terms of a linear function: y = slope * x + intercept + noise where *slope* and *intercept* are the regression parameters that are estimated, and noise represents the variability of the data that was not explained by the linear regression (it is equal to the difference between predicted and actual values of the dependent variable). The parameters are returned as a named tuple. >>> x = [1, 2, 3, 4, 5] >>> noise = NormalDist().samples(5, seed=42) >>> y = [3 * x[i] + 2 + noise[i] for i in range(5)] >>> linear_regression(x, y) #doctest: +ELLIPSIS LinearRegression(slope=3.17495..., intercept=1.00925...) If *proportional* is true, the independent variable *x* and the dependent variable *y* are assumed to be directly proportional. The data is fit to a line passing through the origin. Since the *intercept* will always be 0.0, the underlying linear function simplifies to: y = slope * x + noise >>> y = [3 * x[i] + noise[i] for i in range(5)] >>> linear_regression(x, y, proportional=True) #doctest: +ELLIPSIS LinearRegression(slope=2.90475..., intercept=0.0) zKlinear regression requires that both inputs have same number of data pointsz3linear regression requires at least two data pointsc3ó4<"€TF qS, x€K R#5irXr&rªs& €r-r[Ú$linear_regression..søé€Ð #¡˜2�$�YŠY£ùr¨rJz x is constant©ÚslopeÚ intercept)r7rrrrdr») rOr­r¼r4r�r¦r®r¸rÁrÂr¬s ""$ @r-Úlinear_regressionrÃèsÛø€ôN ˆA‹€AÜ ˆ1ƒv�„{ÜÐkÓlÐl؈1„uÜÐSÓTÐTç Ü�A‹w˜�{ˆÜ�A‹w˜�{ˆÙ!"Ó #¡˜2�$�YˆY¡ˆÐ #Ü #¡Ó #ˆä �!‹-˜#Õ €CÜ �!‹-€Cð/Ø• ˆ÷$‘¨°¸µ Õ)<€IÜ  %Ô =Ð=ùò $øô ô/ܘoÓ.Ð.ð/úsÁ*CÂ'CÃC1cóa€V3RlpV#)zCLoad the kernel's pdf, cdf, invcdf, and support into _kernel_specs.có`<€\\RV!444pSF pV\V&K V#)Úpdf©rÆÚcdfÚinvcdfÚsupport)Údictr:Ú _kernel_specs)ÚbuilderÚspecÚkernelÚkernelss& €r-ÚdecoÚregister..deco-s0ø€Ü”CÐ;¹W»YÓGÓHˆÛˆFØ$(ŒM˜&Ó !ñàˆr,r&)rÐrÑsj r-ÚregisterrÓ+sø€õð €Kr,ÚnormalÚgausscótaa€\^\,4o\^4)oV3RlpV3RlpRpRpWW#3#)écóD<€\RV,V,4S, #)rGçà¿©r)ÚtÚsqrt2pis&€r-ÚÚnormal_kernel..8sø€”C˜˜q� 1� Ó%¨Ö/r,có6<€R\VS, 4,#©rGçà?)r)rÛÚ neg_sqrt2s&€r-rÝrÞ9sø€�Cœ$˜q 9�}Ó-Ö-r,có€\VRR4#©rJçð?©Ú_normal_dist_inv_cdf©rÛs&r-rÝrÞ:s€Ô+¨A¨s°CÔ8r,N)r r)rÆrÈrÉrÊrârÜs @@r-Ú normal_kernelré4s:ù€ä�1”r•6‹l€GÜ�a“�€IÜ /€CÜ -€CÙ 8€FØ€GØ �VÐ $Ð$r,Úlogisticcó €RpRpRpRpWW#3#)có4€RR\V4,, #)rGrårá©rrès&r-rÝÚ!logistic_kernel..As€�C˜3¤ a£�=Ö)r,cóB€RR\V4R,, , #©rårÚrès&r-rÝrîBs€�C˜#¤ Q£¨#¥Õ.Ö.r,có4€\VRV, , 4#rð)r©Úps&r-rÝrîCs€”s˜1  a¥�=Ô)r,Nr&rÇs r-Úlogistic_kernelrô>s#€ñ *€CÙ .€CÙ )€FØ€GØ �VÐ $Ð$r,Úsigmoidcó†aaa€^\, o^\, o\^, oV3RlpV3RlpV3RlpRpWW#3#)rGcó(<€S\V4, #rXrí)rÛÚc1s&€r-rÝÚ sigmoid_kernel..Ms ø€�Bœ˜a›–Lr,có:<€S\\V44,#rX)rr©rÛÚc2s&€r-rÝrùNsø€�Bœœc !›f›Ö%r,có:<€\\VS,44#rX)rr)róÚc3s&€r-rÝrùOsø€”sœ3˜q 2�v›;Ô'r,N©r)rÆrÈrÉrÊrørürþs @@@r-Úsigmoid_kernelrGs?ú€ð ŒR�€BØ ŒR�€BÜ ˆa�€BÜ €CÜ %€CÜ '€FØ€GØ �VÐ $Ð$r,Ú rectangularÚuniformcó €RpRpRpRpWW#3#)có€R#ràr&rès&r-rÝÚ$rectangular_kernel..Us€‘Cr,có"€RV,R,#ràr&rès&r-rÝrVs €�C˜!•G˜c–Mr,có"€RV,R, #©r$rår&ròs&r-rÝrWs €�s˜Q•w –}r,rår&rÇs r-Úrectangular_kernelr Ss!€á €CÙ !€CÙ $€FØ€GØ �VÐ $Ð$r,Ú triangularcó €RpRpRpRpWW#3#)có&€R\V4, #rð©Úabsrès&r-rÝÚ#triangular_kernel..]s €�Cœ#˜a›&–Lr,cóN€W,VR8dRMR,V,R,#)rJrárÙr&rès&r-rÝr^s€�A•C ! c¤'™3¨tÕ4°qÕ8¸3Ö>r,có‚€VR8d\RV,4R, #R\RRV,, 4, #)rGr$rårá)r ròs&r-rÝr_s1€¨A°¬G”t˜C �E“{ SÕ(ÐP¸¼tÀCÈ#ÈaÍ%ÅKÓ?PÕ9PÐPr,rår&rÇs r-Útriangular_kernelr[s!€á €CÙ >€CÙ P€FØ€GØ �VÐ $Ð$r,Ú parabolicÚ epanechnikovcó €RpRpRpRpWW#3#)có.€RRW,, ,#)éråçè?r&rès&r-rÝÚ"parabolic_kernel..es€�C˜3 ¥�;Ö'r,có.€\RV^,VR34#)rGrå)gпrrá©rrès&r-rÝrfs€”GÐ,¨q°!­t°Q¸¨nÔ=r,cóx€R\\RV,R, 4\,R, 4,#)r$råg@)rrrròs&r-rÝrgs%€�sœS¤$ s¨1¥u¨s¥{Ó"3´bÕ"8¸CÕ!?Ó@Ö@r,rår&rÇs r-Úparabolic_kernelrcs!€á '€CÙ =€CÙ @€FØ€GØ �VÐ $Ð$r,có aaaa€VVVV3RlpV#)có„<€S!V4p\S!V4V, ;p4S8”dWS!V4, ,pK6V#)u=Return x such that f(x) ≈ y within the specified tolerance.r )r­rOÚdiffr{Úf_inv_estimateÚf_primeÚ tolerances& €€€€r-Úf_invÚ_newton_raphson..f_invls=ø€á ˜1Ó ˆÜ™!˜A›$ �(Ð"�$Ó# iÔ/Ø ™ › Õ"Õ "ŠA؈r,r&)r!r{r"r#r$sffff r-Ú_newton_raphsonr&ksû€÷ðð €Lr,có€VR 8:dRV3M R RV, 3wrVR8dRV,R,R, V,#RV,R,R, pVR8d(VR\RV,R ,4,, pW!,#) rGråg¡g³êsµ…?r$gq à-�Ø?gáðé¼¹AÛ?çV-²�ïß?gMÕp£^v›?gÔÚ$2h@g_ó€ÄÛ@ráçð¿©r©róÚsignrOs& r-Ú_quartic_invcdf_estimater-ts|€à˜sœ(ˆs�A‰h¨¨s°Q­w¨�G€D؈6„zØ�q•˜VÕ# cÕ)¨TÕ1Ð1Ø ˆq��_Õ$ sÕ*€A؈5„yØ ˆ[œ3˜{¨Q�Ð1AÕAÓBÕ BÕBˆØ �8€Or,ÚquarticÚbiweightcó<€RpRp\\WR7pRpWW#3#)có<€RRW,, ^,,#)éråçî?r&rès&r-rÝÚ quartic_kernel..€ó€�E˜S 1¥5�[¨QÕ.Ö.r,có>€\RV^,V^,VR34#)rrå)gÈ?gä¿r3rárrès&r-rÝr4�s €”GÐ4Ø �T 1 a¥4¨¨CÐ0ô2r,©r{r"rå)r&r-rÇs r-Úquartic_kernelr8~s+€á .€Cñ 2€Cä Ô5¸Ô J€FØ€GØ �VÐ $Ð$r,có€VR 8:dRV3M R RV, 3wrRV,R,R, pRTu;8dR8d=M W!,#VR\R\,VR, ,4,,pW!,#) rGrår$gÆcëÂÕ?gñh㈵øä>r(gL7‰A`å ?g…ëQ¸ñ?gìQ¸…ë¡?rár))rrr+s& r-Ú_triweight_invcdf_estimater:‡so€à˜sœ(ˆs�A‰h¨¨s°Q­w¨�G€DØ ˆq�Ð'Õ'¨#Õ-€AØ�Ö�UÖà �8€Oð ˆU”S˜¤� q¨5¥yÕ1Ó2Õ 2Õ2ˆØ �8€Or,Ú triweightcó<€RpRp\\WR7pRpWW#3#)có<€RRW,, ^,,#)é#råç€ñ?r&rès&r-rÝÚ"triweight_kernel..‘r5r,cóN€\RV^,V^,V^,VR34#)érå)gÄ¿gå?g€ñ¿r?rárrès&r-rÝr@’s&€”GÐ>Ø �T 1 a¥4¨¨A­¨q°#Ð6ô8r,r7rå)r&r:rÇs r-Útriweight_kernelrC�s+€á .€Cñ 8€Cä Ô7¸3Ô L€FØ€GØ �VÐ $Ð$r,Úcosinecófaa€\^, o\^, oVV3RlpV3RlpRpRpWW#3#)écó6<€S\SV,4,#rX)r)rÛrørüs&€€r-rÝÚcosine_kernel..œsø€�Bœ˜R !�V›Ö$r,cóD<€R\SV,4,R,#ràr*rûs&€r-rÝrH�sø€�Cœ#˜b 1�f›+Õ%¨Ö+r,cóX€R\RV,R, 4,\, #r)rrròs&r-rÝrHžs€�sœT #¨¥'¨C¥-Ó0Õ0´2Ö5r,rårÿ)rÆrÈrÉrÊrørüs @@r-Ú cosine_kernelrK˜s4ù€ä ˆa�€BÜ ˆa�€BÝ $€CÜ +€CÙ 5€FØ€GØ �VÐ $Ð$r,Ú cumulativecó,aaaa a a a €\S4o S 'g \R4h\S^,\\34'g \ R4hSR8:d\RS: 24h\ PV4pVf\RV: 24hVR,oVR,o VR,pVfVVV3R lpV VV3R lpM*\S4o SV,o VV VVV V 3R lpV V VVV V 3R lpV'dR S: RV: 2Vn V#RS: RV: 2Vn V#)aÿ Kernel Density Estimation: Create a continuous probability density function or cumulative distribution function from discrete samples. The basic idea is to smooth the data using a kernel function to help draw inferences about a population from a sample. The degree of smoothing is controlled by the scaling parameter h which is called the bandwidth. Smaller values emphasize local features while larger values give smoother results. The kernel determines the relative weights of the sample data points. Generally, the choice of kernel shape does not matter as much as the more influential bandwidth smoothing parameter. Kernels that give some weight to every sample point: normal (gauss) logistic sigmoid Kernels that only give weight to sample points within the bandwidth: rectangular (uniform) triangular parabolic (epanechnikov) quartic (biweight) triweight cosine If *cumulative* is true, will return a cumulative distribution function. A StatisticsError will be raised if the data sequence is empty. Example ------- Given a sample of six data points, construct a continuous function that estimates the underlying probability density: >>> sample = [-2.1, -1.3, -0.4, 1.9, 5.1, 6.2] >>> f_hat = kde(sample, h=1.5) Compute the area under the curve: >>> area = sum(f_hat(x) for x in range(-20, 20)) >>> round(area, 4) 1.0 Plot the estimated probability density function at evenly spaced points from -6 to 10: >>> for x in range(-6, 11): ... density = f_hat(x) ... plot = ' ' * int(density * 400) + 'x' ... print(f'{x:2}: {density:.3f} {plot}') ... -6: 0.002 x -5: 0.009 x -4: 0.031 x -3: 0.070 x -2: 0.111 x -1: 0.125 x 0: 0.110 x 1: 0.086 x 2: 0.068 x 3: 0.059 x 4: 0.066 x 5: 0.082 x 6: 0.082 x 7: 0.058 x 8: 0.028 x 9: 0.009 x 10: 0.002 x Estimate P(4.5 < X <= 7.5), the probability that a new sample value will be between 4.5 and 7.5: >>> cdf = kde(sample, h=1.5, cumulative=True) >>> round(cdf(7.5) - cdf(4.5), 2) 0.22 References ---------- Kernel density estimation and its application: https://www.itm-conferences.org/articles/itmconf/pdf/2018/08/itmconf_sam2018_00037.pdf Kernel functions in common use: https://en.wikipedia.org/wiki/Kernel_(statistics)#kernel_functions_in_common_use Interactive graphical demonstration and exploration: https://demonstrations.wolfram.com/KernelDensityEstimation/ Kernel estimation of cumulative distribution function of a random variable with bounded support https://www.econstor.eu/bitstream/10419/207829/1/10.21307_stattrans-2016-037.pdf úEmpty data sequenceú)Data sequence must contain ints or floatsrJú$Bandwidth h must be positive, not h=úUnknown kernel name: rÆrÈrÊcób<a€\VVV3RlS44\S4S,, #)c3óP<"€TFpS!SV, S, 4x€K R#5irXr&©rYÚx_iÚKÚhrOs& €€€r-r[Ú#kde..pdf..ó!øé€Ð8±4¨C‘q˜!˜c�' Q�×'Ð'³4ùóƒ#&©Úsumr7)rOrVr1rWsf€€€r-rÆÚkde..pdfs!ù€ÜÖ8±4Ó8Ó8¼CÀ»IȽMÕJÐ Jr,cóT<a€\VVV3RlS44\S4, #)c3óP<"€TFpS!SV, S, 4x€K R#5irXr&©rYrUÚWrWrOs& €€€r-r[Ú#kde..cdf.."rYrZr[)rOrar1rWsf€€€r-rÈÚkde..cdf!sù€ÜÖ8±4Ó8Ó8¼3¸t»9ÕDÐ Dr,cóð<a€\S4S8wd\S4o \S4o\S SS, 4p\S SS,4pS Wp\ VVV3RlV44SS,, #)c3óP<"€TFpS!SV, S, 4x€K R#5irXr&rTs& €€€r-r[rX1s!øé€Ð=±9¨C‘q˜!˜c�' Q�×'Ð'³9ùrZ©r7rlr r r\) rOrmrxÚ supportedrVÚ bandwidthr1rWr4Úsamples f €€€€€€r-rÆr])scù€ä�4‹y˜AŒ~Ü ›�ܘ“I�ܘF A¨ ¥MÓ2ˆAܘV Q¨¥]Ó3ˆAؘq˜ ˆIÜÖ=±9Ó=Ó=ÀÀQÅÕGÐ Gr,cóä<a€\S4S8wd\S4o \S4o\S SS, 4p\S SS,4pS Wp\ VVV3RlV4V4S, #)c3óP<"€TFpS!SV, S, 4x€K R#5irXr&r`s& €€€r-r[rb;s!øé€Ð>±I¨S™˜1˜s�7 a�-×(Ð(³IùrZrf) rOrmrxrgrarhr1rWr4ris f €€€€€€r-rÈrc3saù€ä�4‹y˜AŒ~Ü ›�ܘ“I�ܘF A¨ ¥MÓ2ˆAܘV Q¨¥]Ó3ˆAؘq˜ ˆIÜÖ>±IÓ>ÀÓBÀQÕFÐ Fr,zCDF estimate with h=ú and kernel=zPDF estimate with h=) r7rr<Úintrvr8rÌÚgetrlÚ__doc__) r1rWrÏrLÚ kernel_specrÊrÆrÈrVrarhr4ris ff&$ @@@@@r-Úkderq§sþ€ôH ˆD‹ €Aß ÜÐ3Ó4Ð4ä �d˜1•g¤¤U˜|× ,Ò ,ÜÐCÓDÐDàˆC„xÜÐ EÀ1Á&ÐIÓJÐJä×#Ñ# FÓ+€KØÒÜÐ 5°f±ZÐ@ÓAÐAØ�EÕ€AØ�EÕ€Aؘ)Õ$€Gà‚÷ K÷ Eð Eô ˜“ˆØ˜•Kˆ ÷ Hò H÷ Gò G÷Ø-¨1©&° °f±[ÐAˆŒ ؈ ð.¨1©&° °f±[ÐAˆŒ ؈ r,ÚseedcóÂaaaa a €\S4pV'g \R4h\S^,\\34'g \ R4hSR8:d\RS: 24h\ PV4pVf\RV: 24hVR,o \PV4pVPo VPoVVVV V 3RlpRS: R V: 2Vn V#) a<Return a function that makes a random selection from the estimated probability density function created by kde(data, h, kernel). Providing a *seed* allows reproducible selections within a single thread. The seed may be an integer, float, str, or bytes. A StatisticsError will be raised if the *data* sequence is empty. Example: >>> data = [-2.1, -1.3, -0.4, 1.9, 5.1, 6.2] >>> rand = kde_random(data, h=1.5, seed=8675309) >>> new_selections = [rand() for i in range(10)] >>> [round(x, 1) for x in new_selections] [0.7, 6.2, 1.2, 6.9, 7.0, 1.8, 2.5, -0.5, -1.8, 5.6] rNrOrJrPrQrÉcóF<€S!S4SS!S!44,,#rXr&)Úchoicer1rWrÉÚrandoms€€€€€r-ÚrandÚkde_random..randksø€Ù�d‹|˜a¡&©«Ó"2Õ2Õ2Ð2r,zRandom KDE selection with h=rl) r7rr<rmrvr8rÌrnÚ_randomÚRandomrvruro) r1rWrÏrrr4rpÚprngrwrurÉrvs ff&$ @@@r-Ú kde_randomr|FsÐü€ô$ ˆD‹ €Aß ÜÐ3Ó4Ð4ä �d˜1•g¤¤U˜|× ,Ò ,ÜÐCÓDÐDàˆC„xÜÐ EÀ1Á&ÐIÓJÐJä×#Ñ# FÓ+€KØÒÜÐ 5°f±ZÐ@ÓAÐAØ ˜Õ "€Fä �>‰>˜$Ó €DØ �[‰[€FØ �[‰[€F÷3ñ3ð3°©v°]¸6¹+ÐF€D„Là €Kr,r4Ú exclusivecó.€V^8d \R4h\V4p\V4pV^8d"V^8XdW^, ,#\R4hVR8Xd}V^, p.p\^V4F_p\ Wd,V4wrxW,W, ,W^,,V,,V, p VP V 4Ka V#VR8Xd®V^,p.p\^V4F�pWd,V,pV^8d^MWs^, 8”d V^, MTpWd,Wq,, pW^, ,W, ,W,V,,V, p VP V 4K’ V#\ RV: 24h)afDivide *data* into *n* continuous intervals with equal probability. Returns a list of (n - 1) cut points separating the intervals. Set *n* to 4 for quartiles (the default). Set *n* to 10 for deciles. Set *n* to 100 for percentiles which gives the 99 cuts points that separate *data* in to 100 equal sized groups. The *data* can be any iterable containing sample. The cut points are linearly interpolated between data points. If *method* is set to *inclusive*, *data* is treated as population data. The minimum value is treated as the 0th percentile and the maximum value is treated as the 100th percentile. zn must be at least 1z!must have at least one data pointÚ inclusiver}r´)rrlr7ÚrangeÚdivmodÚappendr?) r1r4r°ÚldÚmÚresultrmrxÚdeltaÚ interpolateds &$$ r-Ú quantilesrˆ—s\€ð" ˆ1„uÜÐ4Ó5Ð5ä �$‹<€Dä ˆT‹€BØ ˆA„vØ �Œ7ؘq�5•>Ð !ÜÐAÓBÐBà �ÔØ ��FˆØˆÜ�q˜!–ˆAܘa�e QÓ'‰HˆAØ �G q¥yÕ1°D¸Q½µKÀ%Õ4GÕGÈ1ÕLˆLØ �M‰M˜,Ö 'ñðˆ à �ÔØ ��FˆØˆÜ�q˜!–ˆAØ•˜• ˆAؘ”U‘¨¨q­D¬  1¦°aˆAØ•C˜!�#•IˆEØ  Q¥�K¨1­9Õ5¸½À%½ÕGÈ1ÕLˆLØ �M‰M˜,Ö 'ñ ð ˆ ä Ð'¨¡zÐ2Ó 3Ð3r,có a€]tRtRtoRtRRRR/tR$Rlt]R4tR R /R lt R t R t Rt R%Rlt RtRt]R4t]R4t]R4t]R4t]R4tRtRtRtRtRtRt]tRt]tRtRt R t!R!t"R"t#R#t$Vt%R #)&riÌz(Normal distribution of a random variableÚ_muz(Arithmetic mean of a normal distributionÚ_sigmaz+Standard deviation of a normal distributionc ój€VR8d \R4h\V4Vn\V4VnR#)zDNormalDist where mu is the mean and sigma is the standard deviation.rJzsigma must be non-negativeN)rrvrŠr‹)Úselfr’Úsigmas&&&r-Ú__init__ÚNormalDist.__init__Ös+€à �3Œ;Ü!Ð">Ó?Ð ?ܘ“9ˆŒÜ˜E“lˆŽ r,c ó €V!\V4!#)z5Make a normal distribution instance from sample data.)Ú _mean_stdev)Úclsr1s&&r-Ú from_samplesÚNormalDist.from_samplesÝs€ñ”K Ó%Ñ&Ð&r,rrNc óþ€Vf\PM\P!V4Pp\pVPpVPp\ RV4Uu.uFqt!V!4WV4NK up#uupi)z=Generate *n* samples for a given mean and standard deviation.N)rvrzrçrŠr‹r )r�r4rrÚrndÚinv_cdfr’rŽrgs&&$ r-ÚsamplesÚNormalDist.samplesâs^€à#š|Œf�mŠm´·²¸tÓ1D×1KÑ1KˆÜ&ˆØ �X‰XˆØ— ‘ ˆÜ39¸$À´?ÓC±?¨a�™›˜rÖ)±?ÑCÐCùÒCsÁ!A:c óú€VPVP,pV'g \R4hWP, p\W3,RV,, 4\ \ V,4, #)z4Probability density function. P(x <= X < x+dx) / dxz$pdf() not defined when sigma is zerogÀ)r‹rrŠrr r)r�rOr�r s&& r-rÆÚNormalDist.pdfêsR€à—;‘; §¡Õ,ˆßÜ!Ð"HÓIÐ IØ—8‘8�|ˆÜ�4•; $¨¥/Õ2Ó3´d¼3À½>Ó6JÕJÐJr,c óº€VP'g \R4hR\VPV, VP\,, 4,#)z,Cumulative distribution function. P(X <= x)z$cdf() not defined when sigma is zerorá)r‹rrrŠÚ_SQRT2©r�rOs&&r-rÈÚNormalDist.cdfòs=€à�{�{ˆ{Ü!Ð"HÓIÐ IØ”T˜4Ÿ8™8 a�<¨D¯K©K¼&Õ,@ÕAÓBÕBÐBr,c ót€VR8:gVR8¼d \R4h\WPVP4#)a#Inverse cumulative distribution function. x : P(X <= x) = p Finds the value of the random variable such that the probability of the variable being less than or equal to that value equals the given probability. This function is also called the percent point function or quantile function. rJråz$p must be in the range 0.0 < p < 1.0)rrçrŠr‹)r�rós&&r-r˜ÚNormalDist.inv_cdføs2€ð �Œ8�q˜C”xÜ!Ð"HÓIÐ IÜ# A§x¡x°·±Ó=Ð=r,c ól€\^V4Uu.uFq PW!, 4NK up#uupi)aFDivide into *n* continuous intervals with equal probability. Returns a list of (n - 1) cut points separating the intervals. Set *n* to 4 for quartiles (the default). Set *n* to 10 for deciles. Set *n* to 100 for percentiles which gives the 99 cuts points that separate the normal distribution in to 100 equal sized groups. )r€r˜)r�r4rms&& r-rˆÚNormalDist.quantiless+€ô.3°1°a¬[Ó9©[¨— ‘ ˜Q�UÖ#©[Ñ9Ð9ùÒ9s�1c  óè€\V\4'g \R4hYr2VPVP3VPVP38dY2r2VP VP rTV'd V'g \ R4hWT, p\VPVP, 4pV'g/\VRVP,\,, 4#VPV,VPV,, pVPVP,\Ww,V\WT, 4,,4,p W‰,V, p W‰, V, p R\VPV 4VPV 4, 4\VPV 4VPV 4, 4,, #)azCompute the overlapping coefficient (OVL) between two normal distributions. Measures the agreement between two normal probability distributions. Returns a value between 0.0 and 1.0 giving the overlapping area in the two underlying probability density functions. >>> N1 = NormalDist(2.4, 1.6) >>> N2 = NormalDist(3.2, 2.0) >>> N1.overlap(N2) 0.8035050657330205 z$Expected another NormalDist instancez(overlap() not defined when sigma is zeror$rå) r<rr8r‹rŠr�rrrržr rrÈ) r�ÚotherÚXÚYÚX_varÚY_varÚdvÚdmÚaÚbÚx1Úx2s && r-ÚoverlapÚNormalDist.overlapsI€ô ˜%¤×,Ò,ÜÐBÓCÐ C؈1Ø �H‰H�a—e‘eÐ  §¡¨!¯%©%Ð0Ô 0؈qØ—z‘z 1§:¡:ˆuߟEÜ!Ð"LÓMÐ MØ �]ˆÜ �!—%‘%˜!Ÿ%™%•-Ó ˆßܘ˜c A§H¡H�n¬vÕ5Õ6Ó7Ð 7Ø �E‰E�E�M˜AŸE™E E�MÕ )ˆØ �H‰H�q—x‘xÕ ¤$ r¥w°´c¸%½-Ó6HÕ1HÕ'HÓ"IÕ IˆØ�e�r�\ˆØ�e�r�\ˆØ”d˜1Ÿ5™5 ›9 q§u¡u¨R£yÕ0Ó1´D¸¿¹¸r»ÀQÇUÁUÈ2ÃYÕ9NÓ4OÕOÕPÐPr,c ó‚€VP'g \R4hWP, VP, #)z¡Compute the Standard Score. (x - mean) / stdev Describes *x* in terms of the number of standard deviations above or below the mean of the normal distribution. z'zscore() not defined when sigma is zero)r‹rrŠrŸs&&r-ÚzscoreÚNormalDist.zscore3s.€ð�{�{ˆ{Ü!Ð"KÓLÐ LØ—H‘H•  § ¡ Õ+Ð+r,c ó€VP#)z+Arithmetic mean of the normal distribution.©rŠ©r�s&r-r5ÚNormalDist.mean>ó €ð�x‰xˆr,c ó€VP#)z,Return the median of the normal distributionr·r¸s&r-rnÚNormalDist.medianCrºr,c ó€VP#)z�Return the mode of the normal distribution The mode is the value x where which the probability density function (pdf) takes its maximum value. r·r¸s&r-r�ÚNormalDist.modeHs €ð�x‰xˆr,c ó€VP#)z.Standard deviation of the normal distribution.©r‹r¸s&r-r¡ÚNormalDist.stdevQs€ð�{‰{Ðr,c ó<€VPVP,#)z!Square of the standard deviation.rÀr¸s&r-r�ÚNormalDist.varianceVs€ð�{‰{˜TŸ[™[Õ(Ð(r,c ó€\V\4'dF\VPVP,\VPVP44#\VPV,VP4#)a:Add a constant or another NormalDist instance. If *other* is a constant, translate mu by the constant, leaving sigma unchanged. If *other* is a NormalDist, add both the means and the variances. Mathematically, this works only if the two distributions are independent or if they are jointly normally distributed. ©r<rrŠr r‹©r¯r°s&&r-Ú__add__ÚNormalDist.__add__[óR€ô �bœ*× %Ò %ܘbŸf™f r§v¡v�o¬u°R·Y±YÀÇ Á Ó/JÓKÐ Kܘ"Ÿ&™& 2�+ r§y¡yÓ1Ð1r,c ó€\V\4'dF\VPVP, \VPVP44#\VPV, VP4#)aCSubtract a constant or another NormalDist instance. If *other* is a constant, translate by the constant mu, leaving sigma unchanged. If *other* is a NormalDist, subtract the means and add the variances. Mathematically, this works only if the two distributions are independent or if they are jointly normally distributed. rÅrÆs&&r-Ú__sub__ÚNormalDist.__sub__irÉr,c óp€\VPV,VP\V4,4#)z�Multiply both mu and sigma by a constant. Used for rescaling, perhaps to change measurement units. Sigma is scaled with the absolute value of the constant. ©rrŠr‹rrÆs&&r-Ú__mul__ÚNormalDist.__mul__wó&€ô ˜"Ÿ&™& 2�+ r§y¡y´4¸³8Õ';Ó<Ðô :ò QòD ,ðñóððñóððñóððñóððñ)óð)ò 2ò 2ò=ò=ò-ò.ð€Hòð€Hò;ò -òPò%÷&ð&r,cóŒ€^p\4pVPp/pVPp\V\4FAwrgV!V4\ \ V4F wr‰V^, pV!V ^4V,WI&K" KC RV9d VR,p M \RVP444p \\V\4p WºV3#)aU_sum(data) -> (type, sum, count) Return a high-precision sum of the given numeric data as a fraction, together with the type to be converted to and the count of items. Examples -------- >>> _sum([3, 2.25, 4.5, -0.5, 0.25]) (, Fraction(19, 2), 5) Some sources of round-off error will be avoided: # Built-in sum returns zero. >>> _sum([1e50, 1, -1e50] * 1000) (, Fraction(1000, 1), 3000) Fractions and Decimals are also supported: >>> from fractions import Fraction as F >>> _sum([F(2, 3), F(7, 5), F(1, 4), F(5, 6)]) (, Fraction(63, 20), 4) >>> from decimal import Decimal as D >>> data = [D("0.1375"), D("0.2108"), D("0.3061"), D("0.0419")] >>> _sum(data) (, Fraction(6963, 10000), 4) Mixed types are currently treated as an error, except that int is allowed. Nc3ó<"€TFwr\W!4x€K R#5irXr©rYÚdr4s& r-r[Ú_sum..ásé€Ð@Ñ/?¡t q”H˜Q—N�NÓ/?ùó‚) ÚsetÚaddrnrrêr9Ú _exact_ratior\r…rÚ_coercerm) r1rÚtypesÚ types_addÚpartialsÚ partials_getÚtypr„r4rÿr3r2s & r-r/r/­s¸€ðB €EÜ ‹E€EØ— ‘ €IØ€HØ—<‘<€Lä˜t¤TÖ*‰ ˆÙ�#ŒÜœ  fÖ-‰DˆAØ �Q�JˆEÙ& q¨!Ó,¨qÕ0ˆH‹Kó.ñ+ð  ˆxÔ𘕉ôÑ@¨x¯~©~Ô/?Ó@Ó@ˆäŒw˜œsÓ#€AØ �eÐ Ðr,cóìaa€Se\VV3RlV44wr#pW#SV3#^p\4pVPp\\4p\\4p\ V\ 4F`wršV!V 4\\V 4F?wp oV^, pVS;;,V , uu&VS;;,W»,, uu&KA Kb V'g\^4;poMwRV9d VR,;poMd\RVP444p \RVP444p WM,WÌ,, V, pWÄ, o\\V\4pW#SV3#)a#Return the exact mean and sum of square deviations of sequence data. Calculations are done in a single pass, allowing the input to be an iterator. If given *c* is used the mean; otherwise, it is calculated from the data. Use the *c* argument with care, as it can lead to garbage results. Nc3óF<"€TFqS, ;oS,x€K R#5irXr&)rYrOr�rÿs& €€r-r[Ú_ss..ñsøé€Ð<±t°! q¥5˜j˜a¨A×-Ò-³tùsƒ!c3ó<"€TFwr\W!4x€K R#5irXrrþs& r-r[r  sé€Ð@Ñ,?¡D A”˜!—�Ó,?ùrc3óJ"€TFwr\W!V,4x€K R#5irXrrþs& r-r[r  s é€ÐDÑ/C¡t q”(˜1 �c×"Ð"Ó/Cùr_)r/rrr#rmrrêr9rrr\r…rr)r1r�r2ÚssdrrrÚ sx_partialsÚ sxx_partialsr r„r4Úsxr¸rÿs&f @r-rŒrŒçsAù€ð ‚}ÜÕ<±tÓ<Ó<‰ ˆ�ؘ˜5Ð!Ð!à €EÜ ‹E€EØ— ‘ €IÜœcÓ"€KÜœsÓ#€Lä˜t¤TÖ*‰ ˆÙ�#ŒÜœ  fÖ-‰DˆAˆqØ �Q�JˆEØ ˜�N˜aÕ ‹NØ ˜�O˜q�uÕ $�Oó.ñ+÷ ܘ1“+Ј‰aà �Ô ð˜dÕ#Ð#ˆ‰aôÑ@¨K×,=Ñ,=Ô,?Ó@Ó @ˆÜÑD¨|×/AÑ/AÔ/CÓDÓDˆð�{˜R�WÕ$¨Õ-ˆØ �JˆäŒw˜œsÓ#€AØ �A�uÐ Ðr,cór€VP4# \d\P!T4u#i;irX)Ú is_finiteršrLr)rOs&r-Ú _isfiniters1€ð Ø�{‰{‹}ÐøÜ ô Ü�}Š}˜QÓÒð ús ‚’!6µ6có €WJdV#V\Jg V\JdV#V\JdV#\W4'dV#\W4'dV#\V\4'dV#\V\4'dV#\V\4'd\V\4'dV#\V\4'd\V\4'dV#Rp\ W P VP 3,4h)z²Coerce types T and S to a common type, or raise TypeError. Coercion rules are currently an implementation detail. See the CoerceTest test class in test_statistics for details. z"don't know how to coerce %s and %s)rmÚboolr›rrvr8r')r2ÚSÚmsgs&& r-rrsÅ€ð ƒv�q�àŒCƒx�1œ“9 a˜xØŒCƒx˜�(ä�!×Ò ˜(Ü�!×Ò ˜(ä�!”S×Ò 1˜HÜ�!”S×Ò 1˜Hä�!”X×Ò¤:¨a´×#7Ò#7؈Ü�!”U×Ò¤ ¨1¬h× 7Ò 7؈à .€CÜ �CŸ:™: q§z¡zÐ2Õ2Ó 3Ð3r,có €VP4# \dM\\3dTR3u#i;iTPTP 3# \d&R\ T4P R2p\T4hi;i)z–Return Real number x to exact (numerator, denominator) pair. >>> _exact_ratio(0.25) (1, 4) x is expected to be an int, Fraction, Decimal or float. Nzcan't convert type 'z' to numerator/denominator) Úas_integer_ratioršÚ OverflowErrorr?r˜r™rêr'r8)rOrs& r-rr=sŒ€ðØ×!Ñ!Ó#Ð#øÜ ô Ù Ü œ:Ð &ôð�4ˆyÒðúð à— ‘ ˜QŸ]™]Ð+Ð+øÜ ôØ$¤T¨!£W×%5Ñ%5Ð$6Ð6PÐQˆÜ˜‹nÐðús‚’ 6Ÿ6®6µ6ºAÁ0Bcó2€\V4VJdV#\V\4'dVP^8wd\pV!V4# \ dD\T\ 4'd,T!TP4T!TP4, u#hi;i)z&Convert value to given numeric type T.)rêr›rmr™rvr8rr˜)rˆr2s&&r-r0r0Ws€€ä ˆEƒ{�aÓðˆ ä�!”S×Ò˜e×/Ñ/°1Ô4Ü ˆðá�‹xˆøÜ ôÜ �aœ× !Ò !Ù�U—_‘_Ó%©¨%×*;Ñ*;Ó(<Õ<Ò <à ð úsÁAÁA BÂBc#óL"€VFpV^8d \V4hVx€K R#5i)z7Iterate over values, failing if any are less than zero.N)r)r„rerOs&& r-rcrcks&é€ã ˆØ ˆqŒ5Ü! &Ó)Ð )ØŒóùs‚"$ÚkeyÚreverseÚtiesÚaveragerIcó:€V^8„dQhR\\,/#)r×Úreturn)r=rv)Úformats"r-Ú __annotate__r'ss€÷3ñ3Ì4ÔPUÍ;ñ3r,cóŠ€VR8wd\RV: 24hVe \W4p\\V\ 44VR7pV^, p^.\ V4,p\ V\^4R7FHwr‰\V 4p \ V 4p Wk^,^, ,p V F wrÞWÇV&K Wk, pKJ V#)a½Rank order a dataset. The lowest value has rank 1. Ties are averaged so that equal values receive the same rank: >>> data = [31, 56, 31, 25, 75, 18] >>> _rank(data) [3.5, 5.0, 3.5, 2.0, 6.0, 1.0] The operation is idempotent: >>> _rank([3.5, 5.0, 3.5, 2.0, 6.0, 1.0]) [3.5, 5.0, 3.5, 2.0, 6.0, 1.0] It is possible to rank the data in reverse order so that the highest value has rank 1. Also, a key-function can extract the field to be ranked: >>> goals = [('eagles', 45), ('bears', 48), ('lions', 44)] >>> _rank(goals, key=itemgetter(1), reverse=True) [2.0, 1.0, 3.0] Ranks are conventionally numbered starting from one; however, setting *start* to zero allows the ranks to be used as array indices: >>> prize = ['Gold', 'Silver', 'Bronze', 'Certificate'] >>> scores = [8.1, 7.3, 9.4, 8.3] >>> [prize[int(i)] for i in _rank(scores, start=0, reverse=True)] ['Bronze', 'Certificate', 'Gold', 'Silver'] r#zUnknown tie resolution method: )r!)r ) r?r9rlr:rr7rr r=)r1r r!r"rIÚval_posrmr…rgÚgÚgroupÚsizeÚrankrˆÚorig_poss"$$$$ r-r¶r¶ss·€ðJ ˆyÔÜÐ:¸4¹(ÐCÓDÐDØ ‚Ü�3‹~ˆÜ”S˜œu›wÓ'°Ô9€GØ �� €A؈S”3�w“<Õ €Fܘ¤Z°£]×3‰ˆÜ�Q“ˆÜ�5‹zˆØ˜1•H •>Õ!ˆÛ$‰OˆEØ#�8Ó ñ %à � Šñ 4ð €Mr,có<€V^8„dQhR\R\R\/#©r×r4r„r%)rm)r&s"r-r'r'©s!€÷ñ¤ð¬ð´ñr,cól€\P!W,4pW"V,V,V8g,#)zFSquare root of n/m, rounded to the nearest integer using round-to-odd.)rLÚisqrt)r4r„r­s&& r-Ú_integer_sqrt_of_frac_rtor3©s)€ô � Š �1•6Ó€AØ �!•�A•˜‘ Õ Ðr,có<€V^8„dQhR\R\R\/#r0)rmrv)r&s"r-r'r'µs!€÷ #ñ #œ3ð #¤3ð #¬5ñ #r,có*€VP4VP4, \, ^,pV^8¼d+\W^V,,4V,p^pW4, #\VRV,,V4p^V),pW4, #)z1Square root of n/m as a float, correctly rounded.rµ)Ú bit_lengthÚ_sqrt_bit_widthr3)r4r„Úqr˜r™s&& r-r�r�µs|€ð �‰‹˜!Ÿ,™,›.Õ (¬?Õ :¸qÕ@€A؈A„vÜ-¨a°a¸!µeµÓ<ÀÕAˆ ؈ ð Õ "Ð"ô.¨a°2¸µ6­k¸1Ó=ˆ ؘA˜2•gˆ Ø Õ "Ð"r,có<€V^8„dQhR\R\R\/#r0)rmr)r&s"r-r'r'Âs!€÷ñœSð¤Sð¬Wñr,cóV€V^8:dV'g \R4#V)V)r\V4\V4, P4pVP4wr4VP4pVP4wrg^V,WG,^,,WV,Ws,,^,,8”dV#VP 4pVP4wrš^V,WJ,^,,WV ,W£,,^,,8dV#V#)z3Square root of n/m as a Decimal, correctly rounded.z0.0)rr rÚ next_plusÚ next_minus) r4r„ÚrootÚnrÚdrÚplusÚnpÚdpÚminusÚnmr¬s && r-rœrœÂsç€ð  ˆA„vßܘ5“>Ð !؈r�A�2ˆ1ä �A‹Jœ ›Õ #× )Ñ )Ó +€DØ × "Ñ "Ó $�F€Bà �>‰>Ó €DØ × "Ñ "Ó $�F€Bàˆ1…u�•˜�zÕ˜A B¥¨­¥°Õ 2Õ2Ô2؈ à �O‰OÓ €EØ × #Ñ #Ó %�F€Bàˆ1…u�•˜�zÕ˜A B¥¨­¥°Õ 2Õ2Ô2؈ à €Kr,có&€\V4wrr4V^8d \R4hW$^, , p\V4\VPVP 43# \ d*\T4\T4\T4, 3u#i;i)zFIn one pass, compute the mean and sample standard deviation as floats.r•)rŒrrvr�r˜r™rš)r1r2rŽr�r4ržs& r-r’r’Þs|€ä˜“Y�N€Aˆ4؈1„uÜÐGÓHÐHØ �A•�,€Cð4Ü�T‹{Ô/°· ± ¸s¿¹ÓOÐOÐOøÜ ô4ä�T‹{œE $›K¬%°«)Õ3Ð3Ò3ð4ús±*AÁ1BÂBcó<€V^8„dQhR\R\R\/#)r×rOr­r%)rv)r&s"r-r'r'ës!€÷ñ”ðœ5ð¤Uñr,có²€\W,4p\V4'gW\V4'dD\V4'g3\V4'g"Rp\W0,W1,4V, #V#V'g4V'd*V'd"Rp\W0,W1,4V, #V#\ W3W)34pW$RV,, ,#)zRReturn sqrt(x * y) computed with improved accuracy and without overflow/underflow.r$gðg€a)r rrr·r)rOr­rWÚscalerÿs&& r-r·r·ës €ô ˆQ�U‹ €Aä �A�;Š;Ü ��8Š8œE !ŸHšH¬U°1¯XªXàˆEܘU�Y¨­ Ó2°UÕ:Ð :؈ç ß —ðˆEܘU�Y¨­ Ó2°UÕ:Ð :؈ô ��˜˜B˜Ó €AØ �C˜!•G�}Õ Ðr,có€VR, p\V4R8:döRW3,, pRV,R,V,R,V,R,V,R,V,R,V,R ,V,R ,V,pR V,R ,V,R ,V,R,V,R,V,R,V,R,V,R,pWV, pWV,,#VR8:dTMRV, p\\V4)4pVR8:dÓVR, pRV,R,V,R,V,R,V,R,V,R,V,R,V,R,pRV,R,V,R ,V,R!,V,R",V,R#,V,R$,V,R,pMÑVR, pR%V,R&,V,R',V,R(,V,R),V,R*,V,R+,V,R,,pR-V,R.,V,R/,V,R0,V,R1,V,R2,V,R3,V,R,pWV, pVR8dV)pWV,,#)4rág333333Û?g…ëQ¸Ç?g^’}o)š£@gäE.kÒRà@g �·Ulð@g*u›†>læ@gçNÍØÑÊ@gÌÀ"]Ξ@gnC‹ˆ¤`@guïžÙ @giK˜Ê~j´@gv®±|EÜ@g¾ôdª|1ã@gfRÖÕr·Ô@gŸÈu.2µ@g÷³Èý~y…@gµn8(E@rårJg@gš™™™™™ù?g鬷ÀZaI?ggìElëD—?g7\¸¹«òÎ?g²uSÌSô?gÄ=Ë. @gj%b÷@g›±ÊHw…@gjRéýeÆö?gä9dh? >g('ß¿ŒñA?g¿«~z �?g@ð”3õÂ?gÉ…3ò’æ?g3fRæxÒú?gI¤F»ïl@g“¿“ÖtûŠ>g*àYÌÆnü>gESB\T?gçN;A+›?gÏUR1ÙúÒ?gE¤F¦Žü?gP‡nêÚ@g&å>Á±¡@g�Áøñ¿iâg¿tcI,\ó>g×Å�—¼ÈI?g*F2ùvŽ?gûC4ë†Á?g×ÇOÓ1ã?)rr r)rór’rŽr8ÚrrBrCrOs&&& r-rçrçs€ð ˆC�€Aä ˆAƒw�%ÔØ �q•uÕ ˆà0°1Õ4Ø0õ1Ø45õ6à0õ1à45õ6ð1õ1ð56õ6ð1õ 1ð56õ 6ð 1õ 1ð 56õ 6ð 1õ 1ð 56õ 6ð1õ1ð56õ6ˆð1°1Õ4Ø0õ1Ø45õ6à0õ1à45õ6ð1õ1ð56õ6ð1õ 1ð56õ 6ð 1õ 1ð 56õ 6ð 1õ 1ð 56õ 6ðõˆð �IˆØ˜•YÕÐà �#ŒX‰˜3 �7€AÜ Œc�!‹fˆW‹ €A؈C„xØ ��Gˆà1°AÕ5Ø1õ2Ø56õ7à1õ2à56õ7ð2õ2ð67õ7ð2õ 2ð67õ 7ð 2õ 2ð 67õ 7ð 2õ 2ð 67õ 7ð2õ2ˆð2°AÕ5Ø1õ2Ø56õ7à1õ2à56õ7ð2õ2ð67õ7ð2õ 2ð67õ 7ð 2õ 2ð 67õ 7ð 2õ 2ð 67õ 7ðõ‰ð ��Gˆà1°AÕ5Ø1õ2Ø56õ7à1õ2à56õ7ð2õ2ð67õ7ð2õ 2ð67õ 7ð 2õ 2ð 67õ 7ð 2õ 2ð 67õ 7ð2õ2ˆð3°QÕ6Ø1õ2Ø56õ7à1õ2à56õ7ð2õ2ð67õ7ð2õ 2ð67õ 7ð 2õ 2ð 67õ 7ð 2õ 2ð 67õ 7ðõˆð � €A؈3„wØ ˆBˆà �U•Õ Ðr,ræcó@€V^8„dQh/^\9d \;R&#)r×r7)Ú__conditional_annotations__rm)r&s"r-r'r's#€÷hñh÷b57Ò6”Ñ6òc5hr,)rrrºr¯rDrUrhrqr|rÃr5rnr|rsrqr�r‰r£r“rˆr¡r�rXrðrÀ)gê-�™—q=)rÔ)znegative value)irLroÚ__all__rLrarvÚsysÚ fractionsrÚdecimalrÚ itertoolsrrr Úbisectr r r r rrrrrrrrrrrrrrrrrÚ functoolsrÚoperatorr Ú collectionsr!r"r#ržryr?rr5rDrUrhrnrqrsr|r�r‰r�r“r¡r£r¯rºr»rÃrÌrÓrérôrr rrr&r-r8r:rCrKrqr|rˆrr/rŒrrrr0rcr¶r3Ú float_infoÚmant_digr7r�rœr’r·rçÚ _statisticsÚ ImportErrorr')rLs@r-ÚrZsçøðöhòT €ó2 ÛÛ Û åÝß,Ñ,ß,ßF×FÕFßK×K×KÝÝß8Ñ8á ˆc‹€Ø €ô �jô ò "ô.(òV%ôP<,ò~+ò0 ò2ô&E+òPBò<Kô.+%ô\(ôV?ô.?ò2ð:4H 8ô4HñnÐ0Ð2HÓIÐð<>¨uô<>ðB€ òñ ˆ(�GÓñ%óð%ñ ˆ*Óñ%óð%ñ ˆ)Óñ %óð %ñ ˆ-˜Ó#ñ%ó$ð%ñ ˆ,Óñ%óð%ñ ˆ+�~Ó&ñ%ó'ð%ôòñ ˆ)�ZÓ ñ%ó!ð%òñ ˆ+Óñ%óð%ñ ˆ(Óñ%óð%ð ˆm˜_¨nØÐ)Ð+;ØÐ$ mñ\°õ\ñ~*°õ*ðb04˜ð04 ;ô04÷j\&ñ\&òB7ôt,ò^ ò4ò@ò4ô(ð3˜$ð3¨ð3°Ið3ÀQ÷3õlð˜3Ÿ>™>×2Ñ2Õ2°QÕ6€Ó6õ #õò8 4õò4Kð^ ß0øØô Úð úsÈHÈH*È)H*