| Commit | Date | |
|---|---|---|
| 2013-12-06 10:31:31 | Tree | |
|
[r27084]
by
thibautd
do not sort plans by decreasing number of incompatible plans not sorting improves computation time a lot, by making lazy computation |
2013-12-06 10:25:02 | Tree |
|
[r27083]
by
thibautd
lazilly compute incompatible plans This operation takes almost all the time of the selector, whereas in |
2013-12-06 10:24:51 | Tree |
|
[r27082]
by
thibautd
fix the stopwatch is not valid if the same operation is started and ended |
2013-12-06 10:24:41 | Tree |
| 2013-12-06 10:24:32 | Tree | |
|
[r27080]
by
thibautd
start optimizing incompatibility identification it seems to be responsible for a large part of the computation time for |
2013-12-06 10:24:22 | Tree |
| 2013-12-06 10:24:11 | Tree | |
|
[r27078]
by
kaddoura
|
2013-12-05 16:22:50 | Tree |
| 2013-12-05 16:21:27 | Tree | |
| 2013-12-05 16:00:00 | Tree |