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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
#############################################################################
##
#W filter1.g GAP library Steve Linton
##
##
#Y Copyright (C) 1996, Lehrstuhl D für Mathematik, RWTH Aachen, Germany
#Y (C) 1998 School Math and Comp. Sci., University of St Andrews, Scotland
#Y Copyright (C) 2002 The GAP Group
##
## Speed-critical code moved from filter.g so that it can be
## statically compiled
##
#############################################################################
##
#F WITH_HIDDEN_IMPS_FLAGS( <flags> )
##
HIDDEN_IMPS := [];
WITH_HIDDEN_IMPS_FLAGS_CACHE := [];
WITH_HIDDEN_IMPS_FLAGS_COUNT := 0;
WITH_HIDDEN_IMPS_FLAGS_CACHE_MISS := 0;
WITH_HIDDEN_IMPS_FLAGS_CACHE_HIT := 0;
Unbind( CLEAR_HIDDEN_IMP_CACHE);
BIND_GLOBAL( "CLEAR_HIDDEN_IMP_CACHE", function( filter )
local i, flags;
flags := FLAGS_FILTER(filter);
for i in [ 1, 3 .. LEN_LIST(WITH_HIDDEN_IMPS_FLAGS_CACHE)-1 ] do
if IsBound(WITH_HIDDEN_IMPS_FLAGS_CACHE[i]) then
if IS_SUBSET_FLAGS(WITH_HIDDEN_IMPS_FLAGS_CACHE[i+1],flags) then
Unbind(WITH_HIDDEN_IMPS_FLAGS_CACHE[i]);
Unbind(WITH_HIDDEN_IMPS_FLAGS_CACHE[i+1]);
fi;
fi;
od;
end );
BIND_GLOBAL( "WITH_HIDDEN_IMPS_FLAGS", function ( flags )
local with, changed, imp, hash;
hash := 2 * ( HASH_FLAGS(flags) mod 1009 ) + 1;
if IsBound(WITH_HIDDEN_IMPS_FLAGS_CACHE[hash]) then
if IS_IDENTICAL_OBJ(WITH_HIDDEN_IMPS_FLAGS_CACHE[hash],flags) then
WITH_HIDDEN_IMPS_FLAGS_CACHE_HIT :=
WITH_HIDDEN_IMPS_FLAGS_CACHE_HIT + 1;
return WITH_HIDDEN_IMPS_FLAGS_CACHE[hash+1];
fi;
fi;
WITH_HIDDEN_IMPS_FLAGS_CACHE_MISS := WITH_HIDDEN_IMPS_FLAGS_CACHE_MISS+1;
with := flags;
changed := true;
while changed do
changed := false;
for imp in HIDDEN_IMPS do
if IS_SUBSET_FLAGS( with, imp[2] )
and not IS_SUBSET_FLAGS( with, imp[1] )
then
with := AND_FLAGS( with, imp[1] );
changed := true;
fi;
od;
od;
WITH_HIDDEN_IMPS_FLAGS_CACHE[hash ] := flags;
WITH_HIDDEN_IMPS_FLAGS_CACHE[hash+1] := with;
return with;
end );
#############################################################################
##
#F WITH_IMPS_FLAGS( <flags> )
##
IMPLICATIONS := [];
WITH_IMPS_FLAGS_CACHE := [];
WITH_IMPS_FLAGS_COUNT := 0;
WITH_IMPS_FLAGS_CACHE_HIT := 0;
WITH_IMPS_FLAGS_CACHE_MISS := 0;
Unbind(CLEAR_IMP_CACHE);
BIND_GLOBAL( "CLEAR_IMP_CACHE", function()
WITH_IMPS_FLAGS_CACHE := [];
end );
BIND_GLOBAL( "WITH_IMPS_FLAGS", function ( flags )
local with, changed, imp, hash, hash2, i;
hash := HASH_FLAGS(flags) mod 11001;
for i in [ 0 .. 3 ] do
hash2 := 2 * ((hash+31*i) mod 11001) + 1;
if IsBound(WITH_IMPS_FLAGS_CACHE[hash2]) then
if IS_IDENTICAL_OBJ(WITH_IMPS_FLAGS_CACHE[hash2],flags) then
WITH_IMPS_FLAGS_CACHE_HIT := WITH_IMPS_FLAGS_CACHE_HIT + 1;
return WITH_IMPS_FLAGS_CACHE[hash2+1];
fi;
else
break;
fi;
od;
if i = 3 then
WITH_IMPS_FLAGS_COUNT := ( WITH_IMPS_FLAGS_COUNT + 1 ) mod 4;
i := WITH_IMPS_FLAGS_COUNT;
hash2 := 2*((hash+31*i) mod 11001) + 1;
fi;
WITH_IMPS_FLAGS_CACHE_MISS := WITH_IMPS_FLAGS_CACHE_MISS + 1;
with := flags;
changed := true;
while changed do
changed := false;
for imp in IMPLICATIONS do
if IS_SUBSET_FLAGS( with, imp[2] )
and not IS_SUBSET_FLAGS( with, imp[1] )
then
with := AND_FLAGS( with, imp[1] );
changed := true;
fi;
od;
od;
WITH_IMPS_FLAGS_CACHE[hash2 ] := flags;
WITH_IMPS_FLAGS_CACHE[hash2+1] := with;
return with;
end );
#############################################################################
##
#F RankFilter( <filter> ) . . . . . . . . . . . . . . . . rank of a filter
##
## Compute the rank including the hidden implications.
##
## (When completion files are used, the precomputed ranks are used.
## Therefore, `RankFilter' is set in `init.g' to appropriate values;
## the function that really computes the rank is `RANK_FILTER'.)
##
UNBIND_GLOBAL( "RANK_FILTER" );
BIND_GLOBAL( "RANK_FILTER", function( filter )
local rank, flags, i;
rank := 0;
if IS_FUNCTION(filter) then
flags := FLAGS_FILTER(filter);
else
flags := filter;
fi;
for i in TRUES_FLAGS(WITH_HIDDEN_IMPS_FLAGS(flags)) do
if IsBound(RANK_FILTERS[i]) then
rank := rank + RANK_FILTERS[i];
else
rank := rank + 1;
fi;
od;
return rank;
end );
RankFilter := RANK_FILTER;
UNBIND_GLOBAL( "RANK_FILTER_STORE" );
BIND_GLOBAL( "RANK_FILTER_STORE", function( filter )
local hash, rank, flags;
if IS_FUNCTION(filter) then
flags := FLAGS_FILTER(filter);
else
flags := filter;
fi;
hash := HASH_FLAGS(flags);
rank := RANK_FILTER(flags);
ADD_LIST( RANK_FILTER_LIST_CURRENT, hash );
ADD_LIST( RANK_FILTER_LIST_CURRENT, rank );
return rank;
end );
UNBIND_GLOBAL( "RANK_FILTER_COMPLETION" );
BIND_GLOBAL( "RANK_FILTER_COMPLETION", function( filter )
local hash, flags;
if IS_FUNCTION(filter) then
flags := FLAGS_FILTER(filter);
else
flags := filter;
fi;
hash := HASH_FLAGS(flags);
if hash <> RANK_FILTER_LIST[RANK_FILTER_COUNT] then
Error( "corrupted completion file" );
fi;
RANK_FILTER_COUNT := RANK_FILTER_COUNT+2;
return RANK_FILTER_LIST[RANK_FILTER_COUNT-1];
end );
#############################################################################
##
#E filter1.g . . . . . . . . . . . . . . . . . . . . . . . . . . . ends here
##
|
