Menu

Code Commit Log


Commit Date  
[r23390] by oblonski
2013-03-14 16:03:27 Tree
[r23389] by thibautd

do not compute bound for plans known infeasible

2013-03-14 14:54:25 Tree
[r23388] by thibautd

remove unecessary loops

2013-03-14 14:54:02 Tree
[r23387] by thibautd

remove all log.trace statements.

It makes the code harder to read

2013-03-14 14:53:39 Tree
[r23386] by thibautd

remove need of a map of PersonRecords by adding fields to PlanRecord

2013-03-14 14:53:16 Tree
[r23385] by thibautd

no need to test set intersections in weight estimation anymore

all is done with the "isStillFeasible" flag

2013-03-14 14:52:52 Tree
[r23384] by thibautd

move some code in helper methods

2013-03-14 14:52:28 Tree
[r23383] by thibautd

no set of allocated persons at each step anymore in buildPlanString

2013-03-14 14:52:04 Tree
[r23382] by thibautd

performance improvement: decrease the number of redundant set intersection tests

assertions are here to check that both methods are actually equivalent.
As a result, the improvements in performance happen only when assertions
are disabled.

2013-03-14 14:51:42 Tree
[r23381] by thibautd

rework a little searchForCombinationsWithoutForbiddenPlans

2013-03-14 14:51:17 Tree
Older >