nextcloud-news - Mirror of https://github.com/nextcloud/news

diff options

author	Benjamin Brahmer <info@b-brahmer.de>	2020-09-02 08:38:20 +0200
committer	Benjamin Brahmer <info@b-brahmer.de>	2020-09-02 08:47:33 +0200
commit	60474123f63a3f86062fbd2c86ce1e720bc362d9 (patch)
tree	71427eb0f34ce9094f62abd81e5b6697056224f0
parent	9bb6bf691c68a2f35854c12684bd763b62a026b8 (diff)

Release 14.2.214.2.2

Changed - added support for Nextcloud 20 #781 Fixed - Update interval not saved to config file #783 Signed-off-by: Benjamin Brahmer <info@b-brahmer.de>

Diffstat

-rw-r--r--

CHANGELOG.md

-rw-r--r--

appinfo/info.xml

2 files changed, 9 insertions, 1 deletions

// SPDX-License-Identifier: GPL-3.0 /******************************************************************** * * File: KolmogorovSmirnovDist.c * Environment: ISO C99 or ANSI C89 * Author: Richard Simard * Organization: DIRO, Université de Montréal * Date: 1 February 2012 * Version 1.1 * Copyright 1 march 2010 by Université de Montréal, Richard Simard and Pierre L'Ecuyer ===================================================================== This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, version 3 of the License. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see <http://www.gnu.org/licenses/>. =====================================================================*/ #include "KolmogorovSmirnovDist.h" #include <math.h> #include <stdlib.h> #define num_Pi 3.14159265358979323846 /* PI */ #define num_Ln2 0.69314718055994530941 /* log(2) */ /* For x close to 0 or 1, we use the exact formulae of Ruben-Gambino in all cases. For n <= NEXACT, we use exact algorithms: the Durbin matrix and the Pomeranz algorithms. For n > NEXACT, we use asymptotic methods except for x close to 0 where we still use the method of Durbin for n <= NKOLMO. For n > NKOLMO, we use asymptotic methods only and so the precision is less for x close to 0. We could increase the limit NKOLMO to 10^6 to get better precision for x close to 0, but at the price of a slower speed. */ #define NEXACT 500 #define NKOLMO 100000 /* The Durbin matrix algorithm for the Kolmogorov-Smirnov distribution */ static double DurbinMatrix (int n, double d); /*========================================================================*/ #if 0 /* For ANSI C89 only, not for ISO C99 */ #define MAXI 50 #define EPSILON 1.0e-15 double log1p (double x) { /* returns a value equivalent to log(1 + x) accurate also for small x. */ if (fabs (x) > 0.1) { return log (1.0 + x); } else { double term = x; double sum = x; int s = 2; while ((fabs (term) > EPSILON * fabs (sum)) && (s < MAXI)) { term *= -x; sum += term / s; s++; } return sum; } } #undef MAXI #undef EPSILON #endif /*========================================================================*/ #define MFACT 30 /* The natural logarithm of factorial n! for 0 <= n <= MFACT */ static double LnFactorial[MFACT + 1] = { 0., 0., 0.6931471805599453, 1.791759469228055, 3.178053830347946, 4.787491742782046, 6.579251212010101, 8.525161361065415, 10.60460290274525, 12.80182748008147, 15.10441257307552, 17.50230784587389, 19.98721449566188, 22.55216385312342, 25.19122118273868, 27.89927138384088, 30.67186010608066, 33.50507345013688, 36.39544520803305, 39.33988418719949, 42.33561646075348, 45.3801388984769, 48.47118135183522, 51.60667556776437, 54.7847293981123, 58.00360522298051, 61.26170176100199, 64.55753862700632, 67.88974313718154, 71.257038967168, 74.65823634883016 }; /*------------------------------------------------------------------------*/ static double getLogFactorial (int n) { /* Returns the natural logarithm of factorial n! */ if (n <= MFACT) { return LnFactorial[n]; } else { double x = (double) (n + 1); double y = 1.0 / (x * x); double z = ((-(5.95238095238E-4 * y) + 7.936500793651E-4) * y - 2.7777777777778E-3) * y + 8.3333333333333E-2; z = ((x - 0.5) * log (x) - x) + 9.1893853320467E-1 + z / x; return z; } } /*------------------------------------------------------------------------*/ static double rapfac (int n) { /* Computes n! / n^n */ int i; double res = 1.0 / n; for (i = 2; i <= n; i++) { res *= (double) i / n; } return res; } /*========================================================================*/ static double **CreateMatrixD (int N, int M) { int i; double **T2; T2 = (double **) malloc (N * sizeof (double *)); T2[0] = (double *) malloc ((size_t) N * M * sizeof (double)); for (i = 1; i < N; i++) T2[i] = T2[0] + i * M; return T2; } static void DeleteMatrixD (double **T) { free (T[0]); free (T); } /*========================================================================*/ static double KSPlusbarAsymp (int n, double x) { /* Compute the probability of the KS+ distribution using an asymptotic formula */ double t = (6.0 * n * x + 1); double z = t * t / (18.0 * n); double v = 1.0 - (2.0 * z * z - 4.0 * z - 1.0) / (18.0 * n); if (v <= 0.0) return 0.0; v = v * exp (-z); if (v >= 1.0) return 1.0; return v; } /*-------------------------------------------------------------------------*/ static double KSPlusbarUpper (int n, double x) { /* Compute the probability of the KS+ distribution in the upper tail using Smirnov's stable formula */ const double EPSILON = 1.0E-12; double q; double Sum = 0.0; double term; double t; double LogCom; double LOGJMAX; int j; int jdiv; int jmax = (int) (n * (1.0 - x)); if (n > 200000) return KSPlusbarAsymp (n, x); /* Avoid log(0) for j = jmax and q ~ 1.0 */ if ((1.0 - x - (double) jmax / n) <= 0.0) jmax--; if (n > 3000) jdiv = 2; else jdiv </


context:
space:
mode: