@@ -11,6 +11,10 @@ var assert = require('assert');
11
11
12
12
var MIN_TIME_TASK_DAY = 450 ; // minimum of 7.5 minutes for one task on a day (except if expected time is <7.5 min)
13
13
14
+ var log = function ( ) {
15
+ //console.log.apply(console, arguments);
16
+ } ;
17
+
14
18
/**
15
19
* @class HomeworkDescription
16
20
* @constructor
@@ -229,7 +233,7 @@ Planner=function(){
229
233
for ( i = 0 ; i < items . length ; i ++ ) {
230
234
needed [ i ] = this . estimate ( items [ i ] , gradeFn ) ;
231
235
}
232
- console . log ( " needed =" , needed ) ;
236
+ log ( " needed =" , needed ) ;
233
237
var maxdiff = 0 ;
234
238
for ( i = 0 ; i < items . length ; i ++ ) {
235
239
items [ i ] . duedate = startOfDay ( items [ i ] . duedate ) ;
@@ -239,7 +243,7 @@ Planner=function(){
239
243
}
240
244
var dueInDays = new Array ( maxdiff + 1 ) ;
241
245
for ( i = 0 ; i <= maxdiff ; i ++ ) available ( i ) ;
242
- console . log ( "available =" , availableCache ) ;
246
+ log ( "available =" , availableCache ) ;
243
247
for ( i = 0 ; i <= maxdiff ; i ++ ) dueInDays [ i ] = [ ] ;
244
248
for ( i = 0 ; i < items . length ; i ++ ) {
245
249
dueInDays [ items [ i ] . duediff ] . push ( { item :items [ i ] , needed :needed [ i ] } ) ;
@@ -260,19 +264,19 @@ Planner=function(){
260
264
while ( workingForDay < dueInDays . length && dueInDays [ workingForDay ] . length == 0 ) workingForDay ++ ;
261
265
if ( workingForDay >= dueInDays . length ) break ; //done!
262
266
it = dueInDays [ workingForDay ] . shift ( ) ;
263
- console . log ( "daylength=" + util . inspect ( daylength ) + " item={\"" + it . item . subject + "\" - " + util . inspect ( it . item . location ) + " - due in " + it . item . duediff + " day" + ( it . item . duediff == 1 ?"" :"s" ) + "} it.needed=" + it . needed ) ;
267
+ log ( "daylength=" + util . inspect ( daylength ) + " item={\"" + it . item . subject + "\" - " + util . inspect ( it . item . location ) + " - due in " + it . item . duediff + " day" + ( it . item . duediff == 1 ?"" :"s" ) + "} it.needed=" + it . needed ) ;
264
268
for ( day = 0 ; day < it . item . duediff ; day ++ ) {
265
269
if ( daylength [ day ] + it . needed <= available ( day ) ) break ;
266
270
}
267
271
if ( day < it . item . duediff ) {
268
- console . log ( " -> planned on day " + day ) ;
272
+ log ( " -> planned on day " + day ) ;
269
273
itemcopy = Object . clone ( it . item , true ) ;
270
274
itemcopy . timepart = it . needed ;
271
275
itemcopy . timefraction = 1 ;
272
276
schedule [ day ] . push ( itemcopy ) ;
273
277
daylength [ day ] += it . needed ;
274
278
} else { //the item didn't fit anywhere
275
- console . log ( " -> no fit found; distributing" ) ;
279
+ log ( " -> no fit found; distributing" ) ;
276
280
total = 0 ;
277
281
fractions = [ ] ;
278
282
firstUsedDay = - 1 ;
@@ -291,9 +295,9 @@ Planner=function(){
291
295
if ( total >= it . needed ) break ;
292
296
}
293
297
if ( total < it . needed ) {
294
- console . log ( " -> distributing left " + ( it . needed - total ) + " excess; putting on first used day" ) ;
298
+ log ( " -> distributing left " + ( it . needed - total ) + " excess; putting on first used day" ) ;
295
299
if ( firstUsedDay == - 1 ) { //HELP we didn't plan ANYTHING yet at all
296
- console . log ( " -> NO FIRST USED DAY, so just plugging everything on day 0" ) ;
300
+ log ( " -> NO FIRST USED DAY, so just plugging everything on day 0" ) ;
297
301
itemcopy = Object . clone ( it . item , true ) ;
298
302
itemcopy . timepart = it . needed ;
299
303
itemcopy . timefraction = 1 ;
@@ -320,7 +324,7 @@ Planner=function(){
320
324
}
321
325
}
322
326
}
323
- console . log ( "daylength=" + util . inspect ( daylength ) ) ;
327
+ log ( "daylength=" + util . inspect ( daylength ) ) ;
324
328
var ret = { } ;
325
329
for ( i = 0 ; i < schedule . length ; i ++ ) {
326
330
if ( schedule [ i ] . length == 0 ) continue ;
0 commit comments