51static const uint res8[8] = {1, 7, 11, 13, 17, 19, 23, 29};
54static const uchar slot30[30] = {0xFF, 0, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 1, 0xFF, 0xFF, 0xFF, 2, 0xFF, 3, 0xFF, 0xFF,
55 0xFF, 4, 0xFF, 5, 0xFF, 0xFF, 0xFF, 6, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 7};
58static const uchar bump30[30] = {1, 0, 5, 4, 3, 2, 1, 0, 3, 2, 1, 0, 1, 0, 3,
59 2, 1, 0, 1, 0, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0};
62static const uchar gap30[30] = {0, 6, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 4, 0,
63 0, 0, 2, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 2};
101 249, 223, 239, 126, 182, 251, 61, 253, 215, 239, 94, 243, 251, 175,
102 253, 158, 239, 124, 247, 243, 191, 221, 219, 239, 110, 247, 186, 191,
103 125, 223, 231, 126, 215, 251, 191, 237, 223, 174, 126, 117, 251, 183,
104 253, 223, 235, 126, 231, 251, 190, 253, 93, 239, 118, 247, 219, 187,
105 253, 207, 239, 62, 247, 121, 191, 245, 223, 207, 122, 247, 235, 191,
106 188, 223, 109, 126, 247, 251, 159};
127 uint old_size =
G.map_size;
128 uint old_max =
G.max;
136 G.map_size = new_size;
141 uint skip_num = 0, skip_to = 0;
184 for (
uint i = 5; i < max_idx; ++i) {
196 ds[8 * i +
k] = dslot[
s];
198 s = (
s + dslot[
s]) & 7;
207 if (wend >= new_size) {
212 uint end = (seg_hi <= limit_idx + 1) ? seg_hi : limit_idx + 1;
220 while (act < max_idx && next[act] < end)
223 for (
uint i = 5; i < act; ++i) {
230 ulong k = skip_num / prime + (skip_num % prime != 0);
241 uint k = dpos[8 * i + (idx & 7)];
244 for (
uint u = 0; u < 8 && idx < end; ++u,
k = (
k + 1) & 7) {