[b1dfaf] | 1 | #include <kernel/mod2.h> |
---|
[599326] | 2 | #include <kernel/structs.h> |
---|
[0fb34ba] | 3 | #include <polys/polys.h> |
---|
[f0fd47] | 4 | #include <Minor.h> |
---|
[599326] | 5 | #include <kernel/febase.h> |
---|
[f0fd47] | 6 | |
---|
| 7 | void MinorKey::reset() |
---|
[d2ea299] | 8 | { |
---|
[f0fd47] | 9 | _numberOfRowBlocks = 0; |
---|
| 10 | _numberOfColumnBlocks = 0; |
---|
| 11 | delete [] _rowKey; |
---|
| 12 | delete [] _columnKey; |
---|
| 13 | _rowKey = 0; |
---|
| 14 | _columnKey = 0; |
---|
| 15 | } |
---|
| 16 | |
---|
| 17 | MinorKey::MinorKey (const MinorKey& mk) |
---|
| 18 | { |
---|
| 19 | _numberOfRowBlocks = mk.getNumberOfRowBlocks(); |
---|
| 20 | _numberOfColumnBlocks = mk.getNumberOfColumnBlocks();; |
---|
| 21 | |
---|
| 22 | /* allocate memory for new entries in _rowKey and _columnKey */ |
---|
| 23 | _rowKey = new unsigned int[_numberOfRowBlocks]; |
---|
| 24 | _columnKey = new unsigned int[_numberOfColumnBlocks]; |
---|
| 25 | |
---|
| 26 | /* copying values from parameter arrays to private arrays */ |
---|
| 27 | for (int r = 0; r < _numberOfRowBlocks; r++) |
---|
| 28 | _rowKey[r] = mk.getRowKey(r); |
---|
| 29 | for (int c = 0; c < _numberOfColumnBlocks; c++) |
---|
| 30 | _columnKey[c] = mk.getColumnKey(c); |
---|
| 31 | } |
---|
| 32 | |
---|
| 33 | MinorKey& MinorKey::operator=(const MinorKey& mk) |
---|
| 34 | { |
---|
| 35 | if (_numberOfRowBlocks != 0) delete [] _rowKey; |
---|
| 36 | if (_numberOfColumnBlocks != 0) delete [] _columnKey; |
---|
| 37 | _numberOfRowBlocks = 0; |
---|
| 38 | _numberOfColumnBlocks = 0; |
---|
| 39 | _rowKey = 0; |
---|
| 40 | _columnKey = 0; |
---|
| 41 | |
---|
| 42 | _numberOfRowBlocks = mk.getNumberOfRowBlocks(); |
---|
| 43 | _numberOfColumnBlocks = mk.getNumberOfColumnBlocks();; |
---|
| 44 | |
---|
| 45 | /* allocate memory for new entries in _rowKey and _columnKey */ |
---|
| 46 | _rowKey = new unsigned int[_numberOfRowBlocks]; |
---|
| 47 | _columnKey = new unsigned int[_numberOfColumnBlocks]; |
---|
| 48 | |
---|
| 49 | /* copying values from parameter arrays to private arrays */ |
---|
| 50 | for (int r = 0; r < _numberOfRowBlocks; r++) |
---|
| 51 | _rowKey[r] = mk.getRowKey(r); |
---|
| 52 | for (int c = 0; c < _numberOfColumnBlocks; c++) |
---|
| 53 | _columnKey[c] = mk.getColumnKey(c); |
---|
| 54 | |
---|
| 55 | return *this; |
---|
| 56 | } |
---|
| 57 | |
---|
| 58 | void MinorKey::set(const int lengthOfRowArray, const unsigned int* rowKey, |
---|
| 59 | const int lengthOfColumnArray, |
---|
| 60 | const unsigned int* columnKey) |
---|
| 61 | { |
---|
| 62 | /* free memory of _rowKey and _columnKey */ |
---|
| 63 | if (_numberOfRowBlocks > 0) { delete [] _rowKey; } |
---|
| 64 | if (_numberOfColumnBlocks > 0) { delete [] _columnKey; } |
---|
| 65 | |
---|
| 66 | _numberOfRowBlocks = lengthOfRowArray; |
---|
| 67 | _numberOfColumnBlocks = lengthOfColumnArray; |
---|
| 68 | |
---|
| 69 | /* allocate memory for new entries in _rowKey and _columnKey; */ |
---|
| 70 | _rowKey = new unsigned int[_numberOfRowBlocks]; |
---|
| 71 | _columnKey = new unsigned int[_numberOfColumnBlocks]; |
---|
| 72 | |
---|
| 73 | /* copying values from parameter arrays to private arrays */ |
---|
| 74 | for (int r = 0; r < _numberOfRowBlocks; r++) |
---|
| 75 | _rowKey[r] = rowKey[r]; |
---|
| 76 | for (int c = 0; c < _numberOfColumnBlocks; c++) |
---|
| 77 | _columnKey[c] = columnKey[c]; |
---|
| 78 | } |
---|
| 79 | |
---|
| 80 | MinorKey::MinorKey(const int lengthOfRowArray, |
---|
| 81 | const unsigned int* const rowKey, |
---|
| 82 | const int lengthOfColumnArray, |
---|
| 83 | const unsigned int* const columnKey) |
---|
| 84 | { |
---|
| 85 | _numberOfRowBlocks = lengthOfRowArray; |
---|
| 86 | _numberOfColumnBlocks = lengthOfColumnArray; |
---|
| 87 | |
---|
| 88 | /* allocate memory for new entries in _rowKey and _columnKey */ |
---|
| 89 | _rowKey = new unsigned int[_numberOfRowBlocks]; |
---|
| 90 | _columnKey = new unsigned int[_numberOfColumnBlocks]; |
---|
| 91 | |
---|
| 92 | /* copying values from parameter arrays to private arrays */ |
---|
| 93 | for (int r = 0; r < _numberOfRowBlocks; r++) |
---|
| 94 | _rowKey[r] = rowKey[r]; |
---|
| 95 | |
---|
| 96 | for (int c = 0; c < _numberOfColumnBlocks; c++) |
---|
| 97 | _columnKey[c] = columnKey[c]; |
---|
| 98 | } |
---|
| 99 | |
---|
| 100 | MinorKey::~MinorKey() |
---|
| 101 | { |
---|
[d2ea299] | 102 | _numberOfRowBlocks = 0; |
---|
| 103 | _numberOfColumnBlocks = 0; |
---|
[f0fd47] | 104 | delete [] _rowKey; |
---|
| 105 | delete [] _columnKey; |
---|
[d2ea299] | 106 | _rowKey = 0; |
---|
| 107 | _columnKey = 0; |
---|
[f0fd47] | 108 | } |
---|
| 109 | |
---|
| 110 | void MinorKey::print() const |
---|
| 111 | { |
---|
| 112 | cout << this->toString(); |
---|
| 113 | } |
---|
| 114 | |
---|
| 115 | int MinorKey::getAbsoluteRowIndex(const int i) const |
---|
| 116 | { |
---|
| 117 | /* This method is to return the absolute (0-based) index of the i-th |
---|
| 118 | row encoded in \a this. |
---|
| 119 | Example: bit-pattern of rows: "10010001101", i = 3: |
---|
| 120 | This should yield the 0-based absolute index of the 3-rd bit |
---|
| 121 | (counted from the right), i.e. 7. */ |
---|
| 122 | |
---|
| 123 | int matchedBits = -1; /* counter for matched bits; |
---|
| 124 | this needs to reach i, then we're done */ |
---|
| 125 | for (int block = 0; block < getNumberOfRowBlocks(); block ++) |
---|
| 126 | { |
---|
| 127 | /* start with lowest bits, i.e. in block No. 0 */ |
---|
| 128 | /* the bits in this block of 32 bits: */ |
---|
| 129 | unsigned int blockBits = getRowKey(block); |
---|
| 130 | unsigned int shiftedBit = 1; |
---|
| 131 | int exponent = 0; |
---|
| 132 | /* The invariant "shiftedBit = 2^exponent" will hold throughout the |
---|
| 133 | entire while loop. */ |
---|
| 134 | while (exponent < 32) |
---|
| 135 | { |
---|
| 136 | if (shiftedBit & blockBits) matchedBits++; |
---|
| 137 | if (matchedBits == i) return exponent + (32 * block); |
---|
| 138 | shiftedBit = shiftedBit << 1; |
---|
| 139 | exponent++; |
---|
| 140 | } |
---|
| 141 | } |
---|
| 142 | /* We should never reach this line of code. */ |
---|
| 143 | assert(false); |
---|
| 144 | } |
---|
| 145 | |
---|
| 146 | int MinorKey::getAbsoluteColumnIndex(const int i) const |
---|
| 147 | { |
---|
| 148 | /* This method is to return the absolute (0-based) index of the i-th |
---|
| 149 | column encoded in \a this. |
---|
| 150 | Example: bit-pattern of columns: "10010001101", i = 3: |
---|
| 151 | This should yield the 0-based absolute index of the 3-rd bit |
---|
| 152 | (counted from the right), i.e. 7. */ |
---|
| 153 | |
---|
| 154 | int matchedBits = -1; /* counter for matched bits; this needs to reach i, |
---|
| 155 | then we're done */ |
---|
| 156 | for (int block = 0; block < getNumberOfColumnBlocks(); block ++) |
---|
| 157 | { |
---|
| 158 | /* start with lowest bits, i.e. in block No. 0 */ |
---|
| 159 | /* the bits in this block of 32 bits: */ |
---|
| 160 | unsigned int blockBits = getColumnKey(block); |
---|
| 161 | unsigned int shiftedBit = 1; |
---|
| 162 | int exponent = 0; |
---|
| 163 | /* The invariant "shiftedBit = 2^exponent" will hold throughout the |
---|
| 164 | entire while loop. */ |
---|
| 165 | while (exponent < 32) |
---|
| 166 | { |
---|
| 167 | if (shiftedBit & blockBits) matchedBits++; |
---|
| 168 | if (matchedBits == i) return exponent + (32 * block); |
---|
| 169 | shiftedBit = shiftedBit << 1; |
---|
| 170 | exponent++; |
---|
| 171 | } |
---|
| 172 | } |
---|
| 173 | /* We should never reach this line of code. */ |
---|
| 174 | assert(false); |
---|
| 175 | } |
---|
| 176 | |
---|
| 177 | void MinorKey::getAbsoluteRowIndices(int* const target) const |
---|
| 178 | { |
---|
| 179 | int i = 0; /* index for filling the target array */ |
---|
| 180 | for (int block = 0; block < getNumberOfRowBlocks(); block ++) |
---|
| 181 | { |
---|
| 182 | /* start with lowest bits, i.e. in block No. 0 */ |
---|
| 183 | /* the bits in this block of 32 bits: */ |
---|
| 184 | unsigned int blockBits = getRowKey(block); |
---|
| 185 | unsigned int shiftedBit = 1; |
---|
| 186 | int exponent = 0; |
---|
| 187 | /* The invariant "shiftedBit = 2^exponent" will hold throughout the |
---|
| 188 | entire while loop. */ |
---|
| 189 | while (exponent < 32) |
---|
| 190 | { |
---|
| 191 | if (shiftedBit & blockBits) target[i++] = exponent + (32 * block); |
---|
| 192 | shiftedBit = shiftedBit << 1; |
---|
| 193 | exponent++; |
---|
| 194 | } |
---|
| 195 | } |
---|
| 196 | return; |
---|
| 197 | } |
---|
| 198 | |
---|
| 199 | void MinorKey::getAbsoluteColumnIndices(int* const target) const |
---|
| 200 | { |
---|
| 201 | int i = 0; /* index for filling the target array */ |
---|
| 202 | for (int block = 0; block < getNumberOfColumnBlocks(); block ++) |
---|
| 203 | { |
---|
| 204 | /* start with lowest bits, i.e. in block No. 0 */ |
---|
| 205 | /* the bits in this block of 32 bits: */ |
---|
| 206 | unsigned int blockBits = getColumnKey(block); |
---|
| 207 | unsigned int shiftedBit = 1; |
---|
| 208 | int exponent = 0; |
---|
| 209 | /* The invariant "shiftedBit = 2^exponent" will hold throughout the |
---|
| 210 | entire while loop. */ |
---|
| 211 | while (exponent < 32) |
---|
| 212 | { |
---|
| 213 | if (shiftedBit & blockBits) target[i++] = exponent + (32 * block); |
---|
| 214 | shiftedBit = shiftedBit << 1; |
---|
| 215 | exponent++; |
---|
| 216 | } |
---|
| 217 | } |
---|
| 218 | return; |
---|
| 219 | } |
---|
| 220 | |
---|
| 221 | int MinorKey::getRelativeRowIndex(const int i) const |
---|
| 222 | { |
---|
| 223 | /* This method is to return the relative (0-based) index of the row |
---|
| 224 | with absolute index \c i. |
---|
| 225 | Example: bit-pattern of rows: "10010001101", i = 7: |
---|
| 226 | This should yield the 0-based relative index of the bit |
---|
| 227 | corresponding to row no. 7, i.e. 3. */ |
---|
| 228 | |
---|
| 229 | int matchedBits = -1; /* counter for matched bits; this is going to |
---|
| 230 | contain our return value */ |
---|
| 231 | for (int block = 0; block < getNumberOfRowBlocks(); block ++) |
---|
| 232 | { |
---|
| 233 | /* start with lowest bits, i.e. in block No. 0 */ |
---|
| 234 | /* the bits in this block of 32 bits: */ |
---|
| 235 | unsigned int blockBits = getRowKey(block); |
---|
| 236 | unsigned int shiftedBit = 1; |
---|
| 237 | int exponent = 0; |
---|
| 238 | /* The invariant "shiftedBit = 2^exponent" will hold throughout the |
---|
| 239 | entire while loop. */ |
---|
| 240 | while (exponent < 32) |
---|
| 241 | { |
---|
| 242 | if (shiftedBit & blockBits) matchedBits++; |
---|
| 243 | if (exponent + (32 * block) == i) return matchedBits; |
---|
| 244 | shiftedBit = shiftedBit << 1; |
---|
| 245 | exponent++; |
---|
| 246 | } |
---|
| 247 | } |
---|
| 248 | /* We should never reach this line of code. */ |
---|
| 249 | assert(false); |
---|
| 250 | } |
---|
| 251 | |
---|
| 252 | int MinorKey::getRelativeColumnIndex(const int i) const |
---|
| 253 | { |
---|
| 254 | /* This method is to return the relative (0-based) index |
---|
| 255 | of the column with absolute index \c i. |
---|
| 256 | Example: bit-pattern of columns: "10010001101", i = 7: |
---|
| 257 | This should yield the 0-based relative index of the bit |
---|
| 258 | corresponding to column no. 7, i.e. 3. */ |
---|
| 259 | |
---|
| 260 | int matchedBits = -1; /* counter for matched bits; this is going |
---|
| 261 | to contain our return value */ |
---|
| 262 | for (int block = 0; block < getNumberOfColumnBlocks(); block ++) |
---|
| 263 | { |
---|
| 264 | /* start with lowest bits, i.e. in block No. 0 */ |
---|
| 265 | /* the bits in this block of 32 bits: */ |
---|
| 266 | unsigned int blockBits = getColumnKey(block); |
---|
| 267 | unsigned int shiftedBit = 1; |
---|
| 268 | int exponent = 0; |
---|
| 269 | /* The invariant "shiftedBit = 2^exponent" will hold |
---|
| 270 | throughout the entire while loop. */ |
---|
| 271 | while (exponent < 32) |
---|
| 272 | { |
---|
| 273 | if (shiftedBit & blockBits) matchedBits++; |
---|
| 274 | if (exponent + (32 * block) == i) return matchedBits; |
---|
| 275 | shiftedBit = shiftedBit << 1; |
---|
| 276 | exponent++; |
---|
| 277 | } |
---|
| 278 | } |
---|
| 279 | /* We should never reach this line of code. */ |
---|
| 280 | assert(false); |
---|
| 281 | } |
---|
| 282 | |
---|
| 283 | unsigned int MinorKey::getRowKey(const int blockIndex) const |
---|
| 284 | { |
---|
| 285 | return _rowKey[blockIndex]; |
---|
| 286 | } |
---|
| 287 | |
---|
| 288 | unsigned int MinorKey::getColumnKey(const int blockIndex) const |
---|
| 289 | { |
---|
| 290 | return _columnKey[blockIndex]; |
---|
| 291 | } |
---|
| 292 | |
---|
| 293 | int MinorKey::getNumberOfRowBlocks() const |
---|
| 294 | { |
---|
| 295 | return _numberOfRowBlocks; |
---|
| 296 | } |
---|
| 297 | |
---|
| 298 | int MinorKey::getNumberOfColumnBlocks() const |
---|
| 299 | { |
---|
| 300 | return _numberOfColumnBlocks; |
---|
| 301 | } |
---|
| 302 | |
---|
| 303 | int MinorKey::getSetBits(const int a) const |
---|
| 304 | { |
---|
| 305 | int b = 0; |
---|
| 306 | if (a == 1) |
---|
| 307 | { /* rows */ |
---|
| 308 | for (int i = 0; i < _numberOfRowBlocks; i++) |
---|
| 309 | { |
---|
| 310 | unsigned int m = _rowKey[i]; |
---|
| 311 | unsigned int k = 1; |
---|
| 312 | for (int j = 0; j < 32; j++) |
---|
| 313 | { |
---|
| 314 | /* k = 2^j */ |
---|
| 315 | if (m & k) b++; |
---|
| 316 | k = k << 1; |
---|
| 317 | } |
---|
| 318 | } |
---|
| 319 | } |
---|
| 320 | else |
---|
| 321 | { /* columns */ |
---|
| 322 | for (int i = 0; i < _numberOfColumnBlocks; i++) |
---|
| 323 | { |
---|
| 324 | unsigned int m = _columnKey[i]; |
---|
| 325 | unsigned int k = 1; |
---|
| 326 | for (int j = 0; j < 32; j++) |
---|
| 327 | { |
---|
| 328 | /* k = 2^j */ |
---|
| 329 | if (m & k) b++; |
---|
| 330 | k = k << 1; |
---|
| 331 | } |
---|
| 332 | } |
---|
| 333 | } |
---|
| 334 | return b; |
---|
| 335 | } |
---|
| 336 | |
---|
| 337 | MinorKey MinorKey::getSubMinorKey (const int absoluteEraseRowIndex, |
---|
| 338 | const int absoluteEraseColumnIndex) const |
---|
| 339 | { |
---|
| 340 | int rowBlock = absoluteEraseRowIndex / 32; |
---|
| 341 | int exponent = absoluteEraseRowIndex % 32; |
---|
| 342 | unsigned int newRowBits = getRowKey(rowBlock) - (1 << exponent); |
---|
| 343 | int highestRowBlock = getNumberOfRowBlocks() - 1; |
---|
| 344 | /* highestRowBlock will finally contain the highest block index with |
---|
| 345 | non-zero bit pattern */ |
---|
| 346 | if ((newRowBits == 0) && (rowBlock == highestRowBlock)) |
---|
| 347 | { |
---|
| 348 | /* we have thus nullified the highest block; |
---|
| 349 | we can now forget about the highest block... */ |
---|
| 350 | highestRowBlock -= 1; |
---|
| 351 | while (getRowKey(highestRowBlock) == 0) /* ...and maybe even some more |
---|
| 352 | zero-blocks */ |
---|
| 353 | highestRowBlock -= 1; |
---|
| 354 | } |
---|
| 355 | /* highestRowBlock now contains the highest row block index with non-zero |
---|
| 356 | bit pattern */ |
---|
| 357 | |
---|
| 358 | int columnBlock = absoluteEraseColumnIndex / 32; |
---|
| 359 | exponent = absoluteEraseColumnIndex % 32; |
---|
| 360 | unsigned int newColumnBits = getColumnKey(columnBlock) - (1 << exponent); |
---|
| 361 | int highestColumnBlock = getNumberOfColumnBlocks() - 1; |
---|
| 362 | /* highestColumnBlock will finally contain the highest block index with |
---|
| 363 | non-zero bit pattern */ |
---|
| 364 | if ((newColumnBits == 0) && (columnBlock == highestColumnBlock)) |
---|
| 365 | { |
---|
| 366 | /* we have thus nullified the highest block; |
---|
| 367 | we can now forget about the highest block... */ |
---|
| 368 | highestColumnBlock -= 1; |
---|
| 369 | while (getColumnKey(highestColumnBlock) == 0) /* ...and maybe even some |
---|
| 370 | more zero-blocks */ |
---|
| 371 | highestColumnBlock -= 1; |
---|
| 372 | } |
---|
| 373 | /* highestColumnBlock now contains the highest column block index with |
---|
| 374 | non-zero bit pattern */ |
---|
| 375 | |
---|
| 376 | MinorKey result(highestRowBlock + 1, _rowKey, highestColumnBlock + 1, |
---|
| 377 | _columnKey); |
---|
| 378 | /* This is just a copy with maybe some leading bit blocks omitted. We still |
---|
| 379 | need to re-define the row block at index 'rowBlock' and the column block |
---|
| 380 | at index 'columnBlock': */ |
---|
| 381 | if ((newRowBits != 0) || (rowBlock < getNumberOfRowBlocks() - 1)) |
---|
| 382 | result.setRowKey(rowBlock, newRowBits); |
---|
| 383 | if ((newColumnBits != 0) || (columnBlock < getNumberOfColumnBlocks() - 1)) |
---|
| 384 | result.setColumnKey(columnBlock, newColumnBits); |
---|
| 385 | |
---|
| 386 | /* let's check that the number of selected rows and columns are equal; |
---|
| 387 | (this check is only performed in the debug version) */ |
---|
[efa772b] | 388 | assume(result.getSetBits(1) == result.getSetBits(2)); |
---|
[f0fd47] | 389 | |
---|
| 390 | return result; |
---|
| 391 | } |
---|
| 392 | |
---|
| 393 | void MinorKey::setRowKey (const int blockIndex, const unsigned int rowKey) |
---|
| 394 | { |
---|
| 395 | _rowKey[blockIndex] = rowKey; |
---|
| 396 | } |
---|
| 397 | |
---|
| 398 | void MinorKey::setColumnKey (const int blockIndex, |
---|
| 399 | const unsigned int columnKey) |
---|
| 400 | { |
---|
| 401 | _columnKey[blockIndex] = columnKey; |
---|
| 402 | } |
---|
| 403 | |
---|
| 404 | int MinorKey::compare (const MinorKey& that) const |
---|
| 405 | { |
---|
| 406 | /* compare by rowKeys first; in case of equality, use columnKeys */ |
---|
| 407 | if (this->getNumberOfRowBlocks() < that.getNumberOfRowBlocks()) |
---|
| 408 | return -1; |
---|
| 409 | if (this->getNumberOfRowBlocks() > that.getNumberOfRowBlocks()) |
---|
| 410 | return 1; |
---|
| 411 | /* Here, numbers of rows are equal. */ |
---|
| 412 | for (int r = this->getNumberOfRowBlocks() - 1; r >= 0; r--) |
---|
| 413 | { |
---|
| 414 | if (this->getRowKey(r) < that.getRowKey(r)) return -1; |
---|
| 415 | if (this->getRowKey(r) > that.getRowKey(r)) return 1; |
---|
| 416 | } |
---|
| 417 | /* Here, this and that encode ecaxtly the same sets of rows. |
---|
| 418 | Now, we take a look at the columns. */ |
---|
| 419 | if (this->getNumberOfColumnBlocks() < that.getNumberOfColumnBlocks()) |
---|
| 420 | return -1; |
---|
| 421 | if (this->getNumberOfColumnBlocks() > that.getNumberOfColumnBlocks()) |
---|
| 422 | return 1; |
---|
| 423 | /* Here, numbers of columns are equal. */ |
---|
| 424 | for (int c = this->getNumberOfColumnBlocks() - 1; c >= 0; c--) |
---|
| 425 | { |
---|
| 426 | if (this->getColumnKey(c) < that.getColumnKey(c)) return -1; |
---|
| 427 | if (this->getColumnKey(c) > that.getColumnKey(c)) return 1; |
---|
| 428 | } |
---|
| 429 | /* Here, this and that encode exactly the same sets of rows and columns. */ |
---|
| 430 | return 0; |
---|
| 431 | } |
---|
| 432 | |
---|
| 433 | /* just to make the compiler happy; |
---|
| 434 | this method should never be called */ |
---|
| 435 | bool MinorKey::operator==(const MinorKey& mk) const |
---|
| 436 | { |
---|
| 437 | assert(false); |
---|
| 438 | return this->compare(mk) == 0; |
---|
| 439 | } |
---|
| 440 | |
---|
| 441 | /* just to make the compiler happy; |
---|
| 442 | this method should never be called */ |
---|
| 443 | bool MinorKey::operator<(const MinorKey& mk) const |
---|
| 444 | { |
---|
| 445 | assert(false); |
---|
| 446 | return this->compare(mk) == -1; |
---|
| 447 | } |
---|
| 448 | |
---|
| 449 | void MinorKey::selectFirstRows (const int k, const MinorKey& mk) |
---|
| 450 | { |
---|
| 451 | int hitBits = 0; /* the number of bits we have hit; in the end, this |
---|
| 452 | has to be equal to k, the dimension of the minor */ |
---|
| 453 | int blockIndex = -1; /* the index of the current int in mk */ |
---|
| 454 | unsigned int highestInt = 0; /* the new highest block of this MinorKey */ |
---|
| 455 | /* We determine which ints of mk we can copy. Their indices will be |
---|
| 456 | 0, 1, ..., blockIndex - 1. And highestInt is going to capture the highest |
---|
| 457 | int (which may be only a portion of the corresponding int in mk. |
---|
| 458 | We loop until hitBits = k: */ |
---|
| 459 | while (hitBits < k) |
---|
| 460 | { |
---|
| 461 | blockIndex++; |
---|
| 462 | highestInt = 0; |
---|
| 463 | unsigned int currentInt = mk.getRowKey(blockIndex); |
---|
| 464 | unsigned int shiftedBit = 1; |
---|
| 465 | int exponent = 0; |
---|
| 466 | /* invariant in the loop: shiftedBit = 2^exponent */ |
---|
| 467 | while (exponent < 32 && hitBits < k) |
---|
| 468 | { |
---|
| 469 | if (shiftedBit & currentInt) |
---|
| 470 | { |
---|
| 471 | highestInt += shiftedBit; |
---|
| 472 | hitBits++; |
---|
| 473 | } |
---|
| 474 | shiftedBit = shiftedBit << 1; |
---|
| 475 | exponent++; |
---|
| 476 | } |
---|
| 477 | } |
---|
| 478 | /* free old memory */ |
---|
| 479 | delete [] _rowKey; _rowKey = 0; |
---|
| 480 | _numberOfRowBlocks = blockIndex + 1; |
---|
| 481 | /* allocate memory for new entries in _rowKey; */ |
---|
| 482 | _rowKey = new unsigned int[_numberOfRowBlocks]; |
---|
| 483 | /* copying values from mk to this MinorKey */ |
---|
| 484 | for (int r = 0; r < blockIndex; r++) |
---|
| 485 | _rowKey[r] = mk.getRowKey(r); |
---|
| 486 | _rowKey[blockIndex] = highestInt; |
---|
| 487 | } |
---|
| 488 | |
---|
| 489 | void MinorKey::selectFirstColumns (const int k, const MinorKey& mk) |
---|
| 490 | { |
---|
| 491 | int hitBits = 0; /* the number of bits we have hit; in the end, this |
---|
| 492 | has to be equal to k, the dimension of the minor */ |
---|
| 493 | int blockIndex = -1; /* the index of the current int in mk */ |
---|
| 494 | unsigned int highestInt = 0; /* the new highest block of this MinorKey */ |
---|
| 495 | /* We determine which ints of mk we can copy. Their indices will be |
---|
| 496 | 0, 1, ..., blockIndex - 1. And highestInt is going to capture the highest |
---|
| 497 | int (which may be only a portion of the corresponding int in mk. |
---|
| 498 | We loop until hitBits = k: */ |
---|
| 499 | while (hitBits < k) |
---|
| 500 | { |
---|
| 501 | blockIndex++; |
---|
| 502 | highestInt = 0; |
---|
| 503 | unsigned int currentInt = mk.getColumnKey(blockIndex); |
---|
| 504 | unsigned int shiftedBit = 1; |
---|
| 505 | int exponent = 0; |
---|
| 506 | /* invariant in the loop: shiftedBit = 2^exponent */ |
---|
| 507 | while (exponent < 32 && hitBits < k) |
---|
| 508 | { |
---|
| 509 | if (shiftedBit & currentInt) |
---|
| 510 | { |
---|
| 511 | highestInt += shiftedBit; |
---|
| 512 | hitBits++; |
---|
| 513 | } |
---|
| 514 | shiftedBit = shiftedBit << 1; |
---|
| 515 | exponent++; |
---|
| 516 | } |
---|
| 517 | } |
---|
| 518 | /* free old memory */ |
---|
| 519 | delete [] _columnKey; _columnKey = 0; |
---|
| 520 | _numberOfColumnBlocks = blockIndex + 1; |
---|
| 521 | /* allocate memory for new entries in _columnKey; */ |
---|
| 522 | _columnKey = new unsigned int[_numberOfColumnBlocks]; |
---|
| 523 | /* copying values from mk to this MinorKey */ |
---|
| 524 | for (int c = 0; c < blockIndex; c++) |
---|
| 525 | _columnKey[c] = mk.getColumnKey(c); |
---|
| 526 | _columnKey[blockIndex] = highestInt; |
---|
| 527 | } |
---|
| 528 | |
---|
| 529 | bool MinorKey::selectNextRows (const int k, const MinorKey& mk) |
---|
| 530 | { |
---|
| 531 | /* We need to compute the set of k rows which must all be contained in mk. |
---|
| 532 | AND: This set must be the least possible of this kind which is larger |
---|
| 533 | than the currently encoded set of rows. (Here, '<' is w.r.t. to the |
---|
| 534 | natural ordering on multi-indices. |
---|
| 535 | Example: mk encodes the rows according to the bit pattern 11010111, |
---|
| 536 | k = 3, this MinorKey encodes 10010100. Then, the method must |
---|
| 537 | shift the set of rows in this MinorKey to 11000001 (, and |
---|
| 538 | return true). */ |
---|
| 539 | |
---|
| 540 | /* The next two variables will finally name a row which is |
---|
| 541 | (1) currently not yet among the rows in this MinorKey, but |
---|
| 542 | (2) among the rows in mk, and |
---|
| 543 | (3) which is "higher" than the lowest row in this MinorKey, and |
---|
| 544 | (4) which is the lowest possible choice such that (1) - (3) hold. |
---|
| 545 | If we should not be able to find such a row, then there is no next |
---|
| 546 | subset of rows. In this case, the method will return false; otherwise |
---|
| 547 | always true. */ |
---|
| 548 | int newBitBlockIndex = 0; /* the block index of the bit */ |
---|
| 549 | unsigned int newBitToBeSet = 0; /* the bit as 2^e, where 0 <= e <= 31 */ |
---|
| 550 | |
---|
| 551 | /* number of ints (representing rows) in this MinorKey: */ |
---|
| 552 | int blockCount = this->getNumberOfRowBlocks(); |
---|
| 553 | /* for iterating along the blocks of mk: */ |
---|
| 554 | int mkBlockIndex = mk.getNumberOfRowBlocks(); |
---|
| 555 | |
---|
| 556 | int hitBits = 0; /* the number of bits we have hit */ |
---|
| 557 | int bitCounter = 0; /* for storing the number of bits hit before a |
---|
| 558 | specific moment; see below */ |
---|
| 559 | while (hitBits < k) |
---|
| 560 | { |
---|
| 561 | mkBlockIndex--; |
---|
| 562 | unsigned int currentInt = mk.getRowKey(mkBlockIndex); |
---|
| 563 | unsigned int shiftedBit = 1 << 31; /* initially, this equals 2^31, i.e. |
---|
| 564 | the highest bit */ |
---|
| 565 | while (hitBits < k && shiftedBit > 0) |
---|
| 566 | { |
---|
| 567 | if ((blockCount - 1 >= mkBlockIndex) && |
---|
| 568 | (shiftedBit & this->getRowKey(mkBlockIndex))) hitBits++; |
---|
| 569 | else if (shiftedBit & currentInt) |
---|
| 570 | { |
---|
| 571 | newBitToBeSet = shiftedBit; |
---|
| 572 | newBitBlockIndex = mkBlockIndex; |
---|
| 573 | bitCounter = hitBits; /* So, whenever we set newBitToBeSet, we want |
---|
| 574 | to remember the momentary number of hit |
---|
| 575 | bits. This will later be needed; see below. */ |
---|
| 576 | } |
---|
| 577 | shiftedBit = shiftedBit >> 1; |
---|
| 578 | } |
---|
| 579 | } |
---|
| 580 | if (newBitToBeSet == 0) |
---|
| 581 | { |
---|
| 582 | return false; |
---|
| 583 | } |
---|
| 584 | else |
---|
| 585 | { |
---|
| 586 | /* Note that the following must hold when reaching this line of code: |
---|
| 587 | (1) The row with bit newBitToBeSet in this->getRowKey(newBitBlockIndex) |
---|
| 588 | is currently not among the rows in this MinorKey, but |
---|
| 589 | (2) it is among the rows in mk, and |
---|
| 590 | (3) it is higher than the lowest row in this MinorKey, and |
---|
| 591 | (4) it is the lowest possible choice such that (1) - (3) hold. |
---|
| 592 | In the above example, we would reach this line with |
---|
| 593 | newBitToBeSet == 2^6 and bitCounter == 1 (resulting from the bit 2^7). |
---|
| 594 | */ |
---|
| 595 | |
---|
| 596 | if (blockCount - 1 < newBitBlockIndex) |
---|
| 597 | { /* In this case, _rowKey is too small. */ |
---|
| 598 | /* free old memory */ |
---|
| 599 | delete [] _rowKey; _rowKey = 0; |
---|
| 600 | _numberOfRowBlocks = newBitBlockIndex + 1; |
---|
| 601 | /* allocate memory for new entries in _rowKey; */ |
---|
| 602 | _rowKey = new unsigned int[_numberOfRowBlocks]; |
---|
[94312b5] | 603 | /* initializing entries to zero */ |
---|
| 604 | for (int r = 0; r < _numberOfRowBlocks; r++) _rowKey[r] = 0; |
---|
[f0fd47] | 605 | } |
---|
| 606 | else |
---|
| 607 | { |
---|
| 608 | /* We need to delete all bits in _rowKey[newBitBlockIndex] that are |
---|
| 609 | below newBitToBeSet: */ |
---|
| 610 | unsigned int anInt = this->getRowKey(newBitBlockIndex); |
---|
| 611 | unsigned int deleteBit = newBitToBeSet >> 1; // in example: = 2^5 |
---|
| 612 | while (deleteBit > 0) |
---|
| 613 | { |
---|
| 614 | if (anInt & deleteBit) anInt -= deleteBit; |
---|
| 615 | deleteBit = deleteBit >> 1; |
---|
| 616 | }; |
---|
| 617 | _rowKey[newBitBlockIndex] = anInt; |
---|
| 618 | /* ...and we delete all entries in _rowKey[i] for |
---|
| 619 | 0 <= i < newBitBlockIndex */ |
---|
| 620 | for (int i = 0; i < newBitBlockIndex; i++) |
---|
| 621 | _rowKey[i] = 0; |
---|
| 622 | } |
---|
| 623 | |
---|
| 624 | /* We have now deleted all bits from _rowKey[...] below the bit |
---|
| 625 | 2^newBitToBeSet. |
---|
| 626 | In the example we shall have at this point: _rowKey[...] = 10000000. |
---|
| 627 | Now let's set the new bit: */ |
---|
| 628 | _rowKey[newBitBlockIndex] += newBitToBeSet; |
---|
| 629 | /* in the example: _rowKey[newBitBlockIndex] = 11000000 */ |
---|
| 630 | bitCounter++; /* This is now the number of correct bits in _rowKey[...]; |
---|
| 631 | i.e. in the example this will be equal to 2. */ |
---|
| 632 | |
---|
| 633 | /* Now we only need to fill _rowKey[...] with the lowest possible bits |
---|
| 634 | until it consists of exactly k bits. (We know that we need to set |
---|
| 635 | exactly (k - bitCounter) additional bits.) */ |
---|
| 636 | mkBlockIndex = -1; |
---|
| 637 | while (bitCounter < k) |
---|
| 638 | { |
---|
| 639 | mkBlockIndex++; |
---|
| 640 | unsigned int currentInt = mk.getRowKey(mkBlockIndex); |
---|
| 641 | unsigned int shiftedBit = 1; |
---|
| 642 | int exponent = 0; |
---|
| 643 | /* invariant: shiftedBit = 2^exponent */ |
---|
| 644 | while (bitCounter < k && exponent < 32) |
---|
| 645 | { |
---|
| 646 | if (shiftedBit & currentInt) |
---|
| 647 | { |
---|
| 648 | _rowKey[mkBlockIndex] += shiftedBit; |
---|
| 649 | bitCounter++; |
---|
| 650 | }; |
---|
| 651 | shiftedBit = shiftedBit << 1; |
---|
| 652 | exponent++; |
---|
| 653 | } |
---|
| 654 | }; |
---|
| 655 | /* in the example, we shall obtain _rowKey[...] = 11000001 */ |
---|
| 656 | return true; |
---|
| 657 | } |
---|
| 658 | } |
---|
| 659 | |
---|
| 660 | bool MinorKey::selectNextColumns (const int k, const MinorKey& mk) |
---|
| 661 | { |
---|
| 662 | /* We need to compute the set of k columns which must all be contained in mk. |
---|
| 663 | AND: This set must be the least possible of this kind which is larger |
---|
| 664 | than the currently encoded set of columns. (Here, '<' is w.r.t. to |
---|
| 665 | the natural ordering on multi-indices. |
---|
| 666 | Example: mk encodes the columns according to the bit pattern 11010111, |
---|
| 667 | k = 3, this MinorKey encodes 10010100. Then, the method must |
---|
| 668 | shift the set of columns in this MinorKey to 11000001 (, and |
---|
| 669 | return true). */ |
---|
| 670 | |
---|
[94312b5] | 671 | /* The next two variables will finally name a column which is |
---|
[f0fd47] | 672 | (1) currently not yet among the columns in this MinorKey, but |
---|
| 673 | (2) among the columns in mk, and |
---|
[94312b5] | 674 | (3) which is "higher" than the lowest column in this MinorKey, and |
---|
[f0fd47] | 675 | (4) which is the lowest possible choice such that (1) - (3) hold. |
---|
[94312b5] | 676 | If we should not be able to find such a column, then there is no next |
---|
[f0fd47] | 677 | subset of columns. In this case, the method will return false; otherwise |
---|
| 678 | always true. */ |
---|
| 679 | int newBitBlockIndex = 0; /* the block index of the bit */ |
---|
| 680 | unsigned int newBitToBeSet = 0; /* the bit as 2^e, where 0 <= e <= 31 */ |
---|
| 681 | |
---|
| 682 | /* number of ints (representing columns) in this MinorKey: */ |
---|
| 683 | int blockCount = this->getNumberOfColumnBlocks(); |
---|
| 684 | /* for iterating along the blocks of mk: */ |
---|
| 685 | int mkBlockIndex = mk.getNumberOfColumnBlocks(); |
---|
| 686 | |
---|
| 687 | int hitBits = 0; /* the number of bits we have hit */ |
---|
| 688 | int bitCounter = 0; /* for storing the number of bits hit before a specific |
---|
| 689 | moment; see below */ |
---|
[d2ea299] | 690 | while (hitBits < k) |
---|
[f0fd47] | 691 | { |
---|
| 692 | mkBlockIndex--; |
---|
| 693 | unsigned int currentInt = mk.getColumnKey(mkBlockIndex); |
---|
| 694 | unsigned int shiftedBit = 1 << 31; /* initially, this equals 2^31, i.e. |
---|
| 695 | the highest bit */ |
---|
| 696 | while (hitBits < k && shiftedBit > 0) |
---|
| 697 | { |
---|
| 698 | if ((blockCount - 1 >= mkBlockIndex) && |
---|
| 699 | (shiftedBit & this->getColumnKey(mkBlockIndex))) hitBits++; |
---|
| 700 | else if (shiftedBit & currentInt) |
---|
| 701 | { |
---|
| 702 | newBitToBeSet = shiftedBit; |
---|
| 703 | newBitBlockIndex = mkBlockIndex; |
---|
| 704 | bitCounter = hitBits; /* So, whenever we set newBitToBeSet, we want to |
---|
| 705 | remember the momentary number of hit bits. |
---|
| 706 | This will later be needed; see below. */ |
---|
| 707 | } |
---|
| 708 | shiftedBit = shiftedBit >> 1; |
---|
| 709 | } |
---|
| 710 | } |
---|
| 711 | if (newBitToBeSet == 0) |
---|
| 712 | { |
---|
| 713 | return false; |
---|
| 714 | } |
---|
| 715 | else |
---|
| 716 | { |
---|
| 717 | /* Note that the following must hold when reaching this line of code: |
---|
[94312b5] | 718 | (1) The column with bit newBitToBeSet in |
---|
[f0fd47] | 719 | this->getColumnKey(newBitBlockIndex) is currently not among the |
---|
| 720 | columns in this MinorKey, but |
---|
| 721 | (2) it is among the columns in mk, and |
---|
| 722 | (3) it is higher than the lowest columns in this MinorKey, and |
---|
| 723 | (4) it is the lowest possible choice such that (1) - (3) hold. |
---|
| 724 | In the above example, we would reach this line with |
---|
| 725 | newBitToBeSet == 2^6 and bitCounter == 1 (resulting from the bit 2^7). |
---|
| 726 | */ |
---|
| 727 | |
---|
| 728 | if (blockCount - 1 < newBitBlockIndex) |
---|
| 729 | { /* In this case, _columnKey is too small. */ |
---|
| 730 | /* free old memory */ |
---|
| 731 | delete [] _columnKey; _columnKey = 0; |
---|
| 732 | _numberOfColumnBlocks = newBitBlockIndex + 1; |
---|
| 733 | /* allocate memory for new entries in _columnKey; */ |
---|
| 734 | _columnKey = new unsigned int[_numberOfColumnBlocks]; |
---|
[94312b5] | 735 | /* initializing entries to zero */ |
---|
| 736 | for (int c = 0; c < _numberOfColumnBlocks; c++) _columnKey[c] = 0; |
---|
[f0fd47] | 737 | } |
---|
| 738 | else |
---|
| 739 | { |
---|
| 740 | /* We need to delete all bits in _columnKey[newBitBlockIndex] that are |
---|
| 741 | below newBitToBeSet: */ |
---|
| 742 | unsigned int anInt = this->getColumnKey(newBitBlockIndex); |
---|
| 743 | unsigned int deleteBit = newBitToBeSet >> 1; /* in example: = 2^5 */ |
---|
| 744 | while (deleteBit > 0) |
---|
| 745 | { |
---|
| 746 | if (anInt & deleteBit) anInt -= deleteBit; |
---|
| 747 | deleteBit = deleteBit >> 1; |
---|
| 748 | }; |
---|
| 749 | _columnKey[newBitBlockIndex] = anInt; |
---|
| 750 | /* ...and we delete all entries in _columnKey[i] fo |
---|
| 751 | 0 <= i < newBitBlockIndex */ |
---|
| 752 | for (int i = 0; i < newBitBlockIndex; i++) |
---|
| 753 | _columnKey[i] = 0; |
---|
| 754 | } |
---|
| 755 | /* We have now deleted all bits from _columnKey[...] below the bit |
---|
| 756 | 2^newBitToBeSet. In the example we shall have at this point: |
---|
| 757 | _columnKey[...] = 10000000. Now let's set the new bit: */ |
---|
| 758 | _columnKey[newBitBlockIndex] += newBitToBeSet; |
---|
| 759 | /* in the example: _columnKey[newBitBlockIndex] = 11000000 */ |
---|
| 760 | bitCounter++; /* This is now the number of correct bits in |
---|
| 761 | _columnKey[...]; i.e. in the example this will be equal |
---|
| 762 | to 2. */ |
---|
| 763 | |
---|
| 764 | /* Now we only need to fill _columnKey[...] with the lowest possible bits |
---|
| 765 | until it consists of exactly k bits. (We know that we need to set |
---|
| 766 | exactly (k - bitCounter) additional bits.) */ |
---|
| 767 | mkBlockIndex = -1; |
---|
| 768 | while (bitCounter < k) |
---|
| 769 | { |
---|
| 770 | mkBlockIndex++; |
---|
| 771 | unsigned int currentInt = mk.getColumnKey(mkBlockIndex); |
---|
| 772 | unsigned int shiftedBit = 1; |
---|
| 773 | int exponent = 0; |
---|
| 774 | /* invariant: shiftedBit = 2^exponent */ |
---|
| 775 | while (bitCounter < k && exponent < 32) |
---|
| 776 | { |
---|
| 777 | if (shiftedBit & currentInt) |
---|
| 778 | { |
---|
| 779 | _columnKey[mkBlockIndex] += shiftedBit; |
---|
| 780 | bitCounter++; |
---|
| 781 | }; |
---|
| 782 | shiftedBit = shiftedBit << 1; |
---|
| 783 | exponent++; |
---|
| 784 | } |
---|
| 785 | }; |
---|
| 786 | /* in the example, we shall obtain _columnKey[...] = 11000001 */ |
---|
| 787 | return true; |
---|
| 788 | } |
---|
| 789 | } |
---|
| 790 | |
---|
| 791 | string MinorKey::toString() const |
---|
| 792 | { |
---|
[94312b5] | 793 | string t; |
---|
[f0fd47] | 794 | string s = "("; |
---|
| 795 | unsigned int z = 0; |
---|
| 796 | for (int r = this->getNumberOfRowBlocks() - 1; r >= 0; r--) |
---|
| 797 | { |
---|
[94312b5] | 798 | t = ""; |
---|
[f0fd47] | 799 | z = this->getRowKey(r); |
---|
| 800 | while (z != 0) |
---|
| 801 | { |
---|
| 802 | if ((z % 2) != 0) t = "1" + t; else t = "0" + t; |
---|
| 803 | z = z / 2; |
---|
| 804 | } |
---|
| 805 | if (r < this->getNumberOfRowBlocks() - 1) |
---|
| 806 | t = string(32 - t.length(), '0') + t; |
---|
| 807 | s += t; |
---|
| 808 | } |
---|
| 809 | s += ", "; |
---|
| 810 | for (int c = this->getNumberOfColumnBlocks() - 1; c >= 0; c--) |
---|
| 811 | { |
---|
[94312b5] | 812 | t = ""; |
---|
[f0fd47] | 813 | z = this->getColumnKey(c); |
---|
| 814 | while (z != 0) |
---|
| 815 | { |
---|
| 816 | if ((z % 2) != 0) t = "1" + t; else t = "0" + t; |
---|
| 817 | z = z / 2; |
---|
| 818 | } |
---|
| 819 | if (c < this->getNumberOfColumnBlocks() - 1) |
---|
| 820 | t = string(32 - t.length(), '0') + t; |
---|
| 821 | s += t; |
---|
| 822 | } |
---|
| 823 | s += ")"; |
---|
| 824 | return s; |
---|
| 825 | } |
---|
| 826 | |
---|
[eb72ba1] | 827 | int MinorValue::g_rankingStrategy = -1; |
---|
[f0fd47] | 828 | |
---|
| 829 | int MinorValue::getWeight () const |
---|
| 830 | { |
---|
| 831 | assert(false); /* must be overridden in derived classes */ |
---|
| 832 | return 0; |
---|
| 833 | } |
---|
| 834 | |
---|
| 835 | /* just to make the compiler happy; |
---|
| 836 | this method should never be called */ |
---|
| 837 | bool MinorValue::operator==(const MinorValue& mv) const |
---|
| 838 | { |
---|
| 839 | assert(false); |
---|
| 840 | return (this == &mv); /* compare addresses of both objects */ |
---|
| 841 | } |
---|
| 842 | |
---|
| 843 | string MinorValue::toString () const |
---|
| 844 | { |
---|
| 845 | assert(false); /* must be overridden in derived classes */ |
---|
| 846 | return ""; |
---|
| 847 | } |
---|
| 848 | |
---|
| 849 | /* just to make the compiler happy; |
---|
| 850 | this method should never be called */ |
---|
| 851 | bool MinorValue::operator<(const MinorValue& mv) const |
---|
| 852 | { |
---|
| 853 | assert(false); |
---|
| 854 | return (this < &mv); /* compare addresses of both objects */ |
---|
| 855 | } |
---|
| 856 | |
---|
| 857 | int MinorValue::getRetrievals() const |
---|
| 858 | { |
---|
| 859 | return _retrievals; |
---|
| 860 | } |
---|
| 861 | |
---|
| 862 | void MinorValue::incrementRetrievals() |
---|
| 863 | { |
---|
| 864 | _retrievals++; |
---|
| 865 | } |
---|
| 866 | |
---|
| 867 | int MinorValue::getPotentialRetrievals() const |
---|
| 868 | { |
---|
| 869 | return _potentialRetrievals; |
---|
| 870 | } |
---|
| 871 | |
---|
| 872 | int MinorValue::getMultiplications() const |
---|
| 873 | { |
---|
| 874 | return _multiplications; |
---|
| 875 | } |
---|
| 876 | |
---|
| 877 | int MinorValue::getAdditions() const |
---|
| 878 | { |
---|
| 879 | return _additions; |
---|
| 880 | } |
---|
| 881 | |
---|
| 882 | int MinorValue::getAccumulatedMultiplications() const |
---|
| 883 | { |
---|
| 884 | return _accumulatedMult; |
---|
| 885 | } |
---|
| 886 | |
---|
| 887 | int MinorValue::getAccumulatedAdditions() const |
---|
| 888 | { |
---|
| 889 | return _accumulatedSum; |
---|
| 890 | } |
---|
| 891 | |
---|
| 892 | void MinorValue::print() const |
---|
| 893 | { |
---|
| 894 | cout << this->toString(); |
---|
| 895 | } |
---|
| 896 | |
---|
| 897 | |
---|
| 898 | void MinorValue::SetRankingStrategy (const int rankingStrategy) |
---|
| 899 | { |
---|
[eb72ba1] | 900 | g_rankingStrategy = rankingStrategy; |
---|
| 901 | if (g_rankingStrategy == 6) |
---|
[f0fd47] | 902 | { |
---|
| 903 | /* initialize the random generator with system time */ |
---|
| 904 | srand ( time(NULL) ); |
---|
| 905 | } |
---|
| 906 | } |
---|
| 907 | |
---|
| 908 | int MinorValue::GetRankingStrategy() |
---|
| 909 | { |
---|
[eb72ba1] | 910 | return g_rankingStrategy; |
---|
[f0fd47] | 911 | } |
---|
| 912 | |
---|
| 913 | /* this is for generically accessing the rank measure regardless of |
---|
| 914 | which strategy has been set */ |
---|
| 915 | int MinorValue::getUtility () const |
---|
| 916 | { |
---|
| 917 | switch (this->GetRankingStrategy()) |
---|
| 918 | { |
---|
| 919 | case 1: return this->rankMeasure1(); |
---|
| 920 | case 2: return this->rankMeasure2(); |
---|
| 921 | case 3: return this->rankMeasure3(); |
---|
| 922 | case 4: return this->rankMeasure4(); |
---|
| 923 | case 5: return this->rankMeasure5(); |
---|
| 924 | default: return this->rankMeasure1(); |
---|
| 925 | } |
---|
| 926 | } |
---|
| 927 | |
---|
| 928 | /* here are some sensible caching strategies: */ |
---|
| 929 | int MinorValue::rankMeasure1 () const |
---|
| 930 | { |
---|
| 931 | /* number of actually performed multiplications */ |
---|
| 932 | return this->getMultiplications(); |
---|
| 933 | } |
---|
| 934 | |
---|
| 935 | int MinorValue::rankMeasure2 () const |
---|
| 936 | { |
---|
| 937 | /* accumulated number of performed multiplications, i.e. all including |
---|
| 938 | nested multiplications */ |
---|
| 939 | return this->getAccumulatedMultiplications(); |
---|
| 940 | } |
---|
| 941 | |
---|
| 942 | int MinorValue::rankMeasure3 () const |
---|
| 943 | { |
---|
| 944 | /* number of performed multiplications, weighted with the ratio of |
---|
| 945 | not yet performed retrievals over the maximal number of retrievals */ |
---|
| 946 | return this->getMultiplications() |
---|
| 947 | * (this->getPotentialRetrievals() |
---|
| 948 | - this->getRetrievals()) |
---|
| 949 | / this->getPotentialRetrievals(); |
---|
| 950 | } |
---|
| 951 | |
---|
| 952 | int MinorValue::rankMeasure4 () const |
---|
| 953 | { |
---|
| 954 | /* number of performed multiplications, |
---|
| 955 | multiplied with the number of not yet performed retrievals */ |
---|
| 956 | return this->getMultiplications() |
---|
| 957 | * (this->getPotentialRetrievals() |
---|
| 958 | - this->getRetrievals()); |
---|
| 959 | } |
---|
| 960 | |
---|
| 961 | int MinorValue::rankMeasure5 () const |
---|
| 962 | { |
---|
| 963 | /* number of not yet performed retrievals; |
---|
| 964 | tends to cache entries longer when they are going to be retrieved more |
---|
| 965 | often in the future */ |
---|
| 966 | return this->getPotentialRetrievals() - this->getRetrievals(); |
---|
| 967 | } |
---|
| 968 | |
---|
| 969 | int IntMinorValue::getWeight () const |
---|
| 970 | { |
---|
| 971 | /* put measure for size of MinorValue here, i.e. number of monomials in |
---|
| 972 | polynomial; so far, we use the accumulated number of multiplications |
---|
| 973 | (i.e., including all nested ones) to simmulate the size of a polynomial */ |
---|
| 974 | return _accumulatedMult; |
---|
| 975 | } |
---|
| 976 | |
---|
| 977 | IntMinorValue::IntMinorValue (const int result, const int multiplications, |
---|
| 978 | const int additions, |
---|
| 979 | const int accumulatedMultiplications, |
---|
| 980 | const int accumulatedAdditions, |
---|
| 981 | const int retrievals, |
---|
| 982 | const int potentialRetrievals) |
---|
| 983 | { |
---|
| 984 | _result = result; |
---|
| 985 | _multiplications = multiplications; |
---|
| 986 | _additions = additions; |
---|
| 987 | _accumulatedMult = accumulatedMultiplications; |
---|
| 988 | _accumulatedSum = accumulatedAdditions; |
---|
| 989 | _potentialRetrievals = potentialRetrievals; |
---|
| 990 | _retrievals = retrievals; |
---|
| 991 | } |
---|
| 992 | |
---|
| 993 | IntMinorValue::IntMinorValue () |
---|
| 994 | { |
---|
| 995 | _result = -1; |
---|
| 996 | _multiplications = -1; |
---|
| 997 | _additions = -1; |
---|
| 998 | _accumulatedMult = -1; |
---|
| 999 | _accumulatedSum = -1; |
---|
| 1000 | _potentialRetrievals = -1; |
---|
| 1001 | _retrievals = -1; |
---|
| 1002 | } |
---|
| 1003 | |
---|
| 1004 | IntMinorValue::~IntMinorValue() |
---|
| 1005 | { |
---|
| 1006 | } |
---|
| 1007 | |
---|
| 1008 | int IntMinorValue::getResult() const |
---|
| 1009 | { |
---|
| 1010 | return _result; |
---|
| 1011 | } |
---|
| 1012 | |
---|
| 1013 | string IntMinorValue::toString () const |
---|
| 1014 | { |
---|
| 1015 | char h[10]; |
---|
| 1016 | |
---|
| 1017 | /* Let's see whether a cache has been used to compute this MinorValue: */ |
---|
| 1018 | bool cacheHasBeenUsed = true; |
---|
| 1019 | if (this->getRetrievals() == -1) cacheHasBeenUsed = false; |
---|
| 1020 | |
---|
| 1021 | sprintf(h, "%d", this->getResult()); |
---|
| 1022 | string s = h; |
---|
| 1023 | s += " [retrievals: "; |
---|
| 1024 | if (cacheHasBeenUsed) { sprintf(h, "%d", this->getRetrievals()); s += h; } |
---|
| 1025 | else s += "/"; |
---|
| 1026 | s += " (of "; |
---|
| 1027 | if (cacheHasBeenUsed) |
---|
| 1028 | { |
---|
| 1029 | sprintf(h, "%d", this->getPotentialRetrievals()); |
---|
| 1030 | s += h; |
---|
| 1031 | } |
---|
| 1032 | else s += "/"; |
---|
| 1033 | s += "), *: "; |
---|
| 1034 | sprintf(h, "%d", this->getMultiplications()); s += h; |
---|
| 1035 | s += " (accumulated: "; |
---|
| 1036 | sprintf(h, "%d", this->getAccumulatedMultiplications()); s += h; |
---|
| 1037 | s += "), +: "; |
---|
| 1038 | sprintf(h, "%d", this->getAdditions()); s += h; |
---|
| 1039 | s += " (accumulated: "; |
---|
| 1040 | sprintf(h, "%d", this->getAccumulatedAdditions()); s += h; |
---|
| 1041 | s += "), rank: "; |
---|
| 1042 | if (cacheHasBeenUsed) { sprintf(h, "%d", this->getUtility()); s += h; } |
---|
| 1043 | else s += "/"; |
---|
| 1044 | s += "]"; |
---|
| 1045 | return s; |
---|
| 1046 | } |
---|
| 1047 | |
---|
| 1048 | IntMinorValue::IntMinorValue (const IntMinorValue& mv) |
---|
| 1049 | { |
---|
| 1050 | _result = mv.getResult(); |
---|
| 1051 | _retrievals = mv.getRetrievals(); |
---|
| 1052 | _potentialRetrievals = mv.getPotentialRetrievals(); |
---|
| 1053 | _multiplications = mv.getMultiplications(); |
---|
| 1054 | _additions = mv.getAdditions(); |
---|
| 1055 | _accumulatedMult = mv.getAccumulatedMultiplications(); |
---|
| 1056 | _accumulatedSum = mv.getAccumulatedAdditions(); |
---|
| 1057 | } |
---|
| 1058 | |
---|
| 1059 | PolyMinorValue::PolyMinorValue (const poly result, const int multiplications, |
---|
| 1060 | const int additions, |
---|
| 1061 | const int accumulatedMultiplications, |
---|
| 1062 | const int accumulatedAdditions, |
---|
| 1063 | const int retrievals, |
---|
| 1064 | const int potentialRetrievals) |
---|
| 1065 | { |
---|
| 1066 | _result = pCopy(result); |
---|
| 1067 | _multiplications = multiplications; |
---|
| 1068 | _additions = additions; |
---|
| 1069 | _accumulatedMult = accumulatedMultiplications; |
---|
| 1070 | _accumulatedSum = accumulatedAdditions; |
---|
| 1071 | _potentialRetrievals = potentialRetrievals; |
---|
| 1072 | _retrievals = retrievals; |
---|
| 1073 | } |
---|
| 1074 | |
---|
| 1075 | PolyMinorValue::PolyMinorValue () |
---|
| 1076 | { |
---|
| 1077 | _result = NULL; |
---|
| 1078 | _multiplications = -1; |
---|
| 1079 | _additions = -1; |
---|
| 1080 | _accumulatedMult = -1; |
---|
| 1081 | _accumulatedSum = -1; |
---|
| 1082 | _potentialRetrievals = -1; |
---|
| 1083 | _retrievals = -1; |
---|
| 1084 | } |
---|
| 1085 | |
---|
| 1086 | PolyMinorValue::~PolyMinorValue() |
---|
| 1087 | { |
---|
| 1088 | p_Delete(&_result, currRing); |
---|
| 1089 | } |
---|
| 1090 | |
---|
| 1091 | poly PolyMinorValue::getResult() const |
---|
| 1092 | { |
---|
| 1093 | return _result; |
---|
| 1094 | } |
---|
| 1095 | |
---|
| 1096 | int PolyMinorValue::getWeight () const |
---|
| 1097 | { |
---|
| 1098 | /* put measure for size of PolyMinorValue here, e.g. the number of monomials |
---|
| 1099 | in the cached polynomial */ |
---|
| 1100 | return pLength(_result); // the number of monomials in the polynomial |
---|
| 1101 | } |
---|
| 1102 | |
---|
| 1103 | string PolyMinorValue::toString () const |
---|
| 1104 | { |
---|
| 1105 | char h[20]; |
---|
| 1106 | |
---|
| 1107 | /* Let's see whether a cache has been used to compute this MinorValue: */ |
---|
| 1108 | bool cacheHasBeenUsed = true; |
---|
| 1109 | if (this->getRetrievals() == -1) cacheHasBeenUsed = false; |
---|
| 1110 | |
---|
| 1111 | string s = pString(_result); |
---|
| 1112 | s += " [retrievals: "; |
---|
| 1113 | if (cacheHasBeenUsed) { sprintf(h, "%d", this->getRetrievals()); s += h; } |
---|
| 1114 | else s += "/"; |
---|
| 1115 | s += " (of "; |
---|
| 1116 | if (cacheHasBeenUsed) |
---|
| 1117 | { |
---|
| 1118 | sprintf(h, "%d", this->getPotentialRetrievals()); |
---|
| 1119 | s += h; |
---|
| 1120 | } |
---|
| 1121 | else s += "/"; |
---|
| 1122 | s += "), *: "; |
---|
| 1123 | sprintf(h, "%d", this->getMultiplications()); s += h; |
---|
| 1124 | s += " (accumulated: "; |
---|
| 1125 | sprintf(h, "%d", this->getAccumulatedMultiplications()); s += h; |
---|
| 1126 | s += "), +: "; |
---|
| 1127 | sprintf(h, "%d", this->getAdditions()); s += h; |
---|
| 1128 | s += " (accumulated: "; |
---|
| 1129 | sprintf(h, "%d", this->getAccumulatedAdditions()); s += h; |
---|
| 1130 | s += "), rank: "; |
---|
| 1131 | if (cacheHasBeenUsed) { sprintf(h, "%d", this->getUtility()); s += h; } |
---|
| 1132 | else s += "/"; |
---|
| 1133 | s += "]"; |
---|
| 1134 | return s; |
---|
| 1135 | } |
---|
| 1136 | |
---|
| 1137 | PolyMinorValue::PolyMinorValue (const PolyMinorValue& mv) |
---|
| 1138 | { |
---|
| 1139 | _result = pCopy(mv.getResult()); |
---|
| 1140 | _retrievals = mv.getRetrievals(); |
---|
| 1141 | _potentialRetrievals = mv.getPotentialRetrievals(); |
---|
| 1142 | _multiplications = mv.getMultiplications(); |
---|
| 1143 | _additions = mv.getAdditions(); |
---|
| 1144 | _accumulatedMult = mv.getAccumulatedMultiplications(); |
---|
| 1145 | _accumulatedSum = mv.getAccumulatedAdditions(); |
---|
| 1146 | } |
---|
| 1147 | |
---|
| 1148 | void PolyMinorValue::operator= (const PolyMinorValue& mv) |
---|
| 1149 | { |
---|
| 1150 | if (_result != mv.getResult()) pDelete(&_result); |
---|
| 1151 | _result = pCopy(mv.getResult()); |
---|
| 1152 | _retrievals = mv.getRetrievals(); |
---|
| 1153 | _potentialRetrievals = mv.getPotentialRetrievals(); |
---|
| 1154 | _multiplications = mv.getMultiplications(); |
---|
| 1155 | _additions = mv.getAdditions(); |
---|
| 1156 | _accumulatedMult = mv.getAccumulatedMultiplications(); |
---|
| 1157 | _accumulatedSum = mv.getAccumulatedAdditions(); |
---|
| 1158 | } |
---|