mirror of
https://github.com/vale981/arb
synced 2025-03-06 01:41:39 -05:00
f488a8b034
- split files, one for each function - use acb_dirichlet prefix everywhere - distinguish pairing / character value + fix bug on exponent
59 lines
1.9 KiB
C
59 lines
1.9 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) 2016 Pascal Molin
|
|
|
|
******************************************************************************/
|
|
|
|
#include "acb_dirichlet.h"
|
|
|
|
int
|
|
acb_dirichlet_conrey_next_primitive(acb_dirichlet_conrey_t x, const acb_dirichlet_group_t G)
|
|
{
|
|
/* update index avoiding multiples of p except for first component
|
|
if 8|q */
|
|
ulong k = 0;
|
|
if (G->neven == 2)
|
|
{
|
|
/* x->n = n_mulmod(x->n, G->generators[0], G->q); */
|
|
x->n = x->n * G->generators[0] % G->q;
|
|
if (++x->log[0] == 1)
|
|
return 0;
|
|
x->log[0] = 0;
|
|
k = 1;
|
|
}
|
|
for (; k < G->num ; k++)
|
|
{
|
|
/* x->n = n_mulmod(x->n, G->generators[k], G->q); */
|
|
x->n = x->n * G->generators[k] % G->q;
|
|
if (++x->log[k] % G->primes[k] == 0)
|
|
{
|
|
/* x->n = n_mulmod(x->n, G->generators[k], G->q); */
|
|
x->n = x->n * G->generators[k] % G->q;
|
|
++x->log[k];
|
|
}
|
|
if (x->log[k] < G->phi[k])
|
|
break;
|
|
x->log[k] = 1;
|
|
}
|
|
/* return last index modified */
|
|
return k;
|
|
}
|