1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
/*
Copyright (C) 2016 Arb authors
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 3 of the License, or
(at your option) any later version. See <https://www.gnu.org/licenses/>.
*/
#include "longlong.h"
#include "bool_mat.h"
void
bool_mat_pow_ui(bool_mat_t B, const bool_mat_t A, ulong exp)
{
slong d;
if (!bool_mat_is_square(A))
{
flint_throw(FLINT_ERROR, "bool_mat_pow_ui: a square matrix is required!\n");
}
if (bool_mat_is_empty(A))
return;
d = bool_mat_nrows(A);
if (exp <= 2 || d <= 1)
{
if (exp == 0)
{
bool_mat_one(B);
}
else if (d == 1)
{
bool_mat_set_entry(B, 0, 0, bool_mat_get_entry(A, 0, 0));
}
else if (exp == 1)
{
bool_mat_set(B, A);
}
else if (exp == 2)
{
bool_mat_sqr(B, A);
}
}
else
{
slong i;
bool_mat_t T, U;
bool_mat_init(T, d, d);
bool_mat_set(T, A);
bool_mat_init(U, d, d);
for (i = ((slong) FLINT_BIT_COUNT(exp)) - 2; i >= 0; i--)
{
bool_mat_sqr(U, T);
if (exp & (WORD(1) << i))
bool_mat_mul(T, U, A);
else
bool_mat_swap(T, U);
}
bool_mat_swap(B, T);
bool_mat_clear(T);
bool_mat_clear(U);
}
}