Skip to content

Commit 3a8cd9c

Browse files
committed
💣 console.log
1 parent 324ac67 commit 3a8cd9c

File tree

1 file changed

+12
-8
lines changed

1 file changed

+12
-8
lines changed

packages/planner/planner.js

Lines changed: 12 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -11,6 +11,10 @@ var assert = require('assert');
1111

1212
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)
1313

14+
var log = function () {
15+
//console.log.apply(console, arguments);
16+
};
17+
1418
/**
1519
* @class HomeworkDescription
1620
* @constructor
@@ -229,7 +233,7 @@ Planner=function(){
229233
for(i=0;i<items.length;i++){
230234
needed[i]=this.estimate(items[i],gradeFn);
231235
}
232-
console.log(" needed =",needed);
236+
log(" needed =",needed);
233237
var maxdiff=0;
234238
for(i=0;i<items.length;i++){
235239
items[i].duedate=startOfDay(items[i].duedate);
@@ -239,7 +243,7 @@ Planner=function(){
239243
}
240244
var dueInDays=new Array(maxdiff+1);
241245
for(i=0;i<=maxdiff;i++)available(i);
242-
console.log("available =",availableCache);
246+
log("available =",availableCache);
243247
for(i=0;i<=maxdiff;i++)dueInDays[i]=[];
244248
for(i=0;i<items.length;i++){
245249
dueInDays[items[i].duediff].push({item:items[i],needed:needed[i]});
@@ -260,19 +264,19 @@ Planner=function(){
260264
while(workingForDay<dueInDays.length&&dueInDays[workingForDay].length==0)workingForDay++;
261265
if(workingForDay>=dueInDays.length)break; //done!
262266
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);
264268
for(day=0;day<it.item.duediff;day++){
265269
if(daylength[day]+it.needed<=available(day))break;
266270
}
267271
if(day<it.item.duediff){
268-
console.log(" -> planned on day "+day);
272+
log(" -> planned on day "+day);
269273
itemcopy=Object.clone(it.item,true);
270274
itemcopy.timepart=it.needed;
271275
itemcopy.timefraction=1;
272276
schedule[day].push(itemcopy);
273277
daylength[day]+=it.needed;
274278
} else { //the item didn't fit anywhere
275-
console.log(" -> no fit found; distributing");
279+
log(" -> no fit found; distributing");
276280
total=0;
277281
fractions=[];
278282
firstUsedDay=-1;
@@ -291,9 +295,9 @@ Planner=function(){
291295
if(total>=it.needed)break;
292296
}
293297
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");
295299
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");
297301
itemcopy=Object.clone(it.item,true);
298302
itemcopy.timepart=it.needed;
299303
itemcopy.timefraction=1;
@@ -320,7 +324,7 @@ Planner=function(){
320324
}
321325
}
322326
}
323-
console.log("daylength="+util.inspect(daylength));
327+
log("daylength="+util.inspect(daylength));
324328
var ret={};
325329
for(i=0;i<schedule.length;i++){
326330
if(schedule[i].length==0)continue;

0 commit comments

Comments
 (0)