#include <matrix.h>
Public Types | |
| enum | e_type { et_none = 0x0, et_constant = 0x1, et_stable = 0x2, et_variable = 0x3, et_unstable = 0x4, et_big = 0x8 } |
Public Member Functions | |
| Map (const uint size) | |
| ~Map () | |
| void | setUse (const uint i, const uint j, Map::e_type type, bool big) |
| void | createMap (int *map) |
| void | reset () |
Protected Member Functions | |
| bool | typeCmp (const uint t1, const uint t2) |
Definition at line 25 of file matrix.h.
| void Map::createMap | ( | int * | map | ) |
Generates an optimal permutation, returned in the given array
TODO We want to change this search to one that finds a swap, taking into acocunt the priorities given below
Definition at line 250 of file matrix.cpp.
References typeCmp().
Referenced by Matrix::createMap().
| void Map::reset | ( | ) |
| bool Map::typeCmp | ( | const uint | t1, | |
| const uint | t2 | |||
| ) | [protected] |
Compares two "types", returning true if t1 >= t2, else false
Definition at line 374 of file matrix.cpp.
Referenced by createMap().
1.5.1