mirror of
https://github.com/vale981/arb
synced 2025-03-05 17:31:38 -05:00
79 lines
2.3 KiB
C
79 lines
2.3 KiB
C
/*=============================================================================
|
|
|
|
This file is part of ARB.
|
|
|
|
ARB is free software; you can 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.
|
|
|
|
ARB is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with ARB; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
=============================================================================*/
|
|
/******************************************************************************
|
|
|
|
Copyright (C) 2012 Fredrik Johansson
|
|
|
|
******************************************************************************/
|
|
|
|
#include "bernoulli.h"
|
|
|
|
TLS_PREFIX long bernoulli_cache_num = 0;
|
|
|
|
TLS_PREFIX fmpq * bernoulli_cache = NULL;
|
|
|
|
void
|
|
bernoulli_cleanup(void)
|
|
{
|
|
long i;
|
|
|
|
for (i = 0; i < bernoulli_cache_num; i++)
|
|
fmpq_clear(bernoulli_cache + i);
|
|
|
|
flint_free(bernoulli_cache);
|
|
bernoulli_cache_num = 0;
|
|
}
|
|
|
|
void
|
|
bernoulli_cache_compute(long n)
|
|
{
|
|
if (bernoulli_cache_num < n)
|
|
{
|
|
long i, new_num;
|
|
bernoulli_rev_t iter;
|
|
|
|
if (bernoulli_cache_num == 0)
|
|
{
|
|
flint_register_cleanup_function(bernoulli_cleanup);
|
|
}
|
|
|
|
new_num = FLINT_MAX(bernoulli_cache_num + 128, n);
|
|
|
|
bernoulli_cache = flint_realloc(bernoulli_cache, new_num * sizeof(fmpq));
|
|
for (i = bernoulli_cache_num; i < new_num; i++)
|
|
fmpq_init(bernoulli_cache + i);
|
|
|
|
i = new_num - 1;
|
|
i -= (i % 2);
|
|
bernoulli_rev_init(iter, i);
|
|
for ( ; i >= bernoulli_cache_num; i -= 2)
|
|
{
|
|
bernoulli_rev_next(fmpq_numref(bernoulli_cache + i),
|
|
fmpq_denref(bernoulli_cache + i), iter);
|
|
}
|
|
bernoulli_rev_clear(iter);
|
|
|
|
if (new_num > 1)
|
|
fmpq_set_si(bernoulli_cache + 1, -1, 2);
|
|
|
|
bernoulli_cache_num = new_num;
|
|
}
|
|
}
|
|
|