-
Notifications
You must be signed in to change notification settings - Fork 243
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
c4f6ae2
commit ae81eb6
Showing
8 changed files
with
230 additions
and
16 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,62 @@ | ||
| /* | ||
| Copyright (C) 2023 Fredrik Johansson | ||
| This file is part of FLINT. | ||
| FLINT is free software: you can redistribute it and/or modify it under | ||
| the terms of the GNU Lesser General Public License (LGPL) as published | ||
| by the Free Software Foundation; either version 2.1 of the License, or | ||
| (at your option) any later version. See <http://www.gnu.org/licenses/>. | ||
| */ | ||
|
|
||
| #include "gr_vec.h" | ||
| #include "gr_poly.h" | ||
|
|
||
| int | ||
| _gr_poly_divexact_generic(gr_ptr Q, gr_srcptr A, slong lenA, gr_srcptr B, slong lenB, gr_ctx_t ctx) | ||
| { | ||
| if (lenB <= 2) | ||
| return _gr_poly_divexact_basecase(Q, A, lenA, B, lenB, ctx); | ||
| else | ||
| return _gr_poly_divexact_bidirectional(Q, A, lenA, B, lenB, ctx); | ||
| } | ||
|
|
||
| int | ||
| gr_poly_divexact(gr_poly_t Q, const gr_poly_t A, const gr_poly_t B, gr_ctx_t ctx) | ||
| { | ||
| slong Alen, Blen, Qlen; | ||
| int status = GR_SUCCESS; | ||
| slong sz = ctx->sizeof_elem; | ||
|
|
||
| Alen = A->length; | ||
| Blen = B->length; | ||
|
|
||
| if (Blen == 0) | ||
| return GR_DOMAIN; | ||
|
|
||
| if (gr_is_zero(GR_ENTRY(B->coeffs, Blen - 1, sz), ctx) != T_FALSE) | ||
| return GR_UNABLE; | ||
|
|
||
| if (Alen < Blen) | ||
| return gr_poly_zero(Q, ctx); | ||
|
|
||
| Qlen = Alen - Blen + 1; | ||
|
|
||
| if (Q == A || Q == B) | ||
| { | ||
| gr_poly_t t; | ||
| gr_poly_init2(t, Qlen, ctx); | ||
| status = _gr_poly_divexact(t->coeffs, A->coeffs, A->length, B->coeffs, B->length, ctx); | ||
| gr_poly_swap(Q, t, ctx); | ||
| gr_poly_clear(t, ctx); | ||
| } | ||
| else | ||
| { | ||
| gr_poly_fit_length(Q, Qlen, ctx); | ||
| status = _gr_poly_divexact(Q->coeffs, A->coeffs, A->length, B->coeffs, B->length, ctx); | ||
| } | ||
|
|
||
| _gr_poly_set_length(Q, Qlen, ctx); | ||
| _gr_poly_normalise(Q, ctx); | ||
| return status; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,126 @@ | ||
| /* | ||
| Copyright (C) 2023 Fredrik Johansson | ||
| This file is part of FLINT. | ||
| FLINT is free software: you can redistribute it and/or modify it under | ||
| the terms of the GNU Lesser General Public License (LGPL) as published | ||
| by the Free Software Foundation; either version 2.1 of the License, or | ||
| (at your option) any later version. See <http://www.gnu.org/licenses/>. | ||
| */ | ||
|
|
||
| #include "ulong_extras.h" | ||
| #include "gr_poly.h" | ||
|
|
||
| int main(void) | ||
| { | ||
| slong iter; | ||
| flint_rand_t state; | ||
|
|
||
| flint_printf("divexact...."); | ||
| fflush(stdout); | ||
|
|
||
| flint_randinit(state); | ||
|
|
||
| for (iter = 0; iter < 1000; iter++) | ||
| { | ||
| int status; | ||
| gr_ctx_t ctx; | ||
| gr_poly_t A, B, Q, Q2; | ||
|
|
||
| gr_ctx_init_random(ctx, state); | ||
|
|
||
| gr_poly_init(A, ctx); | ||
| gr_poly_init(B, ctx); | ||
| gr_poly_init(Q, ctx); | ||
| gr_poly_init(Q2, ctx); | ||
|
|
||
| status = GR_SUCCESS; | ||
|
|
||
| status |= gr_poly_randtest(B, state, 1 + n_randint(state, 6), ctx); | ||
|
|
||
| if (gr_poly_is_zero(B, ctx) == T_FALSE) | ||
| { | ||
| status |= gr_poly_randtest(Q, state, 1 + n_randint(state, 6), ctx); | ||
| status |= gr_poly_randtest(Q2, state, 1 + n_randint(state, 6), ctx); | ||
| status |= gr_poly_mul(A, Q2, B, ctx); | ||
|
|
||
| switch (n_randint(state, 12)) | ||
| { | ||
| case 0: | ||
| status |= gr_poly_set(Q, A, ctx); | ||
| status |= gr_poly_divexact(Q, Q, B, ctx); | ||
| break; | ||
| case 1: | ||
| status |= gr_poly_set(Q, B, ctx); | ||
| status |= gr_poly_divexact(Q, A, B, ctx); | ||
| break; | ||
| case 2: | ||
| status |= gr_poly_divexact(Q, A, B, ctx); | ||
| break; | ||
|
|
||
| case 3: | ||
| status |= gr_poly_set(Q, A, ctx); | ||
| status |= gr_poly_divexact_basecase(Q, Q, B, ctx); | ||
| break; | ||
| case 4: | ||
| status |= gr_poly_set(Q, B, ctx); | ||
| status |= gr_poly_divexact_basecase(Q, A, B, ctx); | ||
| break; | ||
| case 5: | ||
| status |= gr_poly_divexact_basecase(Q, A, B, ctx); | ||
| break; | ||
|
|
||
| case 6: | ||
| status |= gr_poly_set(Q, A, ctx); | ||
| status |= gr_poly_divexact_bidirectional(Q, Q, B, ctx); | ||
| break; | ||
| case 7: | ||
| status |= gr_poly_set(Q, B, ctx); | ||
| status |= gr_poly_divexact_bidirectional(Q, A, B, ctx); | ||
| break; | ||
| case 8: | ||
| status |= gr_poly_divexact_bidirectional(Q, A, B, ctx); | ||
| break; | ||
|
|
||
| case 9: | ||
| status |= gr_poly_set(Q, A, ctx); | ||
| status |= gr_poly_divexact_basecase_bidirectional(Q, Q, B, ctx); | ||
| break; | ||
| case 10: | ||
| status |= gr_poly_set(Q, B, ctx); | ||
| status |= gr_poly_divexact_basecase_bidirectional(Q, A, B, ctx); | ||
| break; | ||
| default: | ||
| status |= gr_poly_divexact_basecase_bidirectional(Q, A, B, ctx); | ||
| break; | ||
| } | ||
|
|
||
| if (gr_ctx_is_integral_domain(ctx) == T_TRUE && | ||
| ((status == GR_SUCCESS && gr_poly_equal(Q, Q2, ctx) == T_FALSE) | ||
| || status == GR_DOMAIN | ||
| || (ctx->which_ring == GR_CTX_FMPZ && status != GR_SUCCESS))) | ||
| { | ||
| flint_printf("FAIL\n\n"); | ||
| gr_ctx_println(ctx); | ||
| flint_printf("A = "); gr_poly_print(A, ctx); flint_printf("\n"); | ||
| flint_printf("B = "); gr_poly_print(B, ctx); flint_printf("\n"); | ||
| flint_printf("Q = "); gr_poly_print(Q, ctx); flint_printf("\n"); | ||
| flint_printf("Q2 = "); gr_poly_print(Q2, ctx); flint_printf("\n"); | ||
| flint_abort(); | ||
| } | ||
| } | ||
|
|
||
| gr_poly_clear(A, ctx); | ||
| gr_poly_clear(B, ctx); | ||
| gr_poly_clear(Q, ctx); | ||
| gr_poly_clear(Q2, ctx); | ||
|
|
||
| gr_ctx_clear(ctx); | ||
| } | ||
|
|
||
| flint_randclear(state); | ||
| flint_cleanup(); | ||
| flint_printf("PASS\n"); | ||
| return 0; | ||
| } |