/
tables.go
77 lines (69 loc) · 2.7 KB
/
tables.go
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
73
74
75
76
77
package primefield
import (
"math/bits"
"github.com/ReneBoedker/algobra/errors"
)
// DefaultMaxMem is the default maximal memory consumption for addition and
// multiplication tables. The value is in KiB.
const DefaultMaxMem uint = 1 << 19 // 512 MiB
type table struct {
t [][]uint
}
func newTable(f *Field, op func(i, j uint) uint, maxMem ...uint) (*table, error) {
if len(maxMem) == 0 {
maxMem = append(maxMem, DefaultMaxMem)
}
if m := estimateMemory(f); m > maxMem[0] {
return nil, errors.New(
"Creating arithmetic table", errors.InputTooLarge,
"Requires %d KiB, which exceeds maxMem (%d)", m, maxMem,
)
}
t := make([][]uint, f.char, f.char)
for i := uint(0); i < f.char; i++ {
t[i] = make([]uint, f.char-i, f.char-i)
for j := i; j < f.char; j++ {
t[i][j-i] = op(i, j)
}
}
return &table{t: t}, nil
}
func (t *table) lookup(i, j uint) uint {
if j < i {
return t.lookup(j, i)
}
return t.t[i][j-i]
}
// estimateMemory gives a lower bound on the memory required to store a table.
// This estimate ignores overhead from the slices. Return value is in KiB
func estimateMemory(f *Field) uint {
b := f.char * (f.char + 1) * (bits.UintSize / 16)
return b >> 10
}
/* Copyright 2019 René Bødker Christensen
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/