//define the uc-namespace
var com = com||{};
com.unitedCoders = com.unitedCoders||{};

com.unitedCoders.Numbers1 = function(){
    this.maxLoop = 100;
    /* calculate all divisors of n and return the sum of it
    @var n int  - number to be checked
    @return the sum of all divisors
    */
    this.countcalc = 0;
    this.calcSumOfDivisors = function(n) {
	//include the divisor 1
        this.countcalc ++;
	var sum = 1;
	var middle = Math.sqrt(n);
	for (var i=2; i <= middle; i++) {
	    if (n % i === 0) {
		sum += i;
		sum += n/i;
	    }
	}
	return sum;
    };
    /* generate a cycle and break if maxLoop or n=1 or n to great
    @var start int    - start number of loop
    @return [int] - calculated loop
    */
    this.countcycle = 0;
    this.calcCycle = function(start) {
        this.countcycle++;
	var last = start, f = [], max = 100*start, length;
        do {
            last = this.calcSumOfDivisors(last);
	    length = f.push(last);
	} while (start!==last && last>1 && length<this.maxLoop && last<max);
	return f;
    };
    /* Calculate the cycle, check if there is a loop and if n the first element,
       return the numbers as a list.
    @var n int - start number for checking
    @return [int] if n is starting point of a social number group
    */ 
    this.getMinSociable = function(n) {
        var f = this.calcCycle(n, this.maxLoop);
        // Check if it has a cycle
	if (n === f[f.length-1]){
	    //Check if n is the lowest member of the cycle
	    var sorted = f.slice();
	    sorted.sort(function(a,b){return a-b;});
            if (n === sorted[0]) {
                //correct the list, put the starting number at pos:0
		f.unshift(f.pop());
		return f;
	    }
	}
        return;
    };
    /* Find sociable numbers from start to end
    @var start int - Starting number for checking
    @var end int - ending point for chekcing
    @return [ [int], ] list of sociable groups
    */
    this.findSociable = function(start, end) {
        var results = [];
        for (var i=start; i<end; i++) {
            var match = this.getMinSociable(i);
            if (match) {
                results.push(match);
            }
        }
        if (!self.importScripts) {
          console.info("calcSumOfDiv: +" + this.countcalc);
          console.info("calcCycles: +" + this.countcycle);
        }
        return results;
    };
};
        
com.unitedCoders.Numbers2 = function(){
    //use only a cache for calculation.
    this.calcCycle = function(n) {
        this.countcycle++;
	var lastN = n, f = [], maxN = 100*n, length;
        do {
	    lastN = this.sumCache[lastN] || this.getSumOfDivisors(lastN);
	    length = f.push(lastN);
	} while (n!==lastN && lastN>1 && length<this.maxLoop && lastN<maxN);
	return f;
    };
    this.sumCache = [];
    this.getSumOfDivisors = function(n) {
	sum = this.sumCache[n] || this.calcSumOfDivisors(n);
	this.sumCache[n] = sum;
	return sum;
    };
}
com.unitedCoders.Numbers2.prototype = new com.unitedCoders.Numbers1();

com.unitedCoders.Numbers3 = function(){
    this.findSociable = function(start, end) {
        var maxLoop = 100;
        var results = [];
        for (var n=start; n<end; n++) {
            //calcCycle
	    var lastN = n, f = [], maxN = 100*n, length;
	    do {
                //getSumOfDivisors
		if (!this.sumCache[lastN]) {
                    this.sumCache[lastN] = this.calcSumOfDivisors(lastN);
                }
                lastN = this.sumCache[lastN];
	        length = f.push(lastN);
	    } while (n!==lastN && lastN>1 && length<this.maxLoop && lastN<maxN);

            //getMinSociable
            if (n===lastN) {
                var sorted = f.slice();
                sorted.sort(function(a,b){return a-b;})
	        if (n === sorted[0]){
		    f.unshift(f.pop());
                    results.push(f);
                }
            }
        }
        return results;
    };
};
com.unitedCoders.Numbers3.prototype = new com.unitedCoders.Numbers2();

//Hook to use it as Worker.
if (self.importScripts){
    importScripts("/sites/default/files/json2.js.txt");
    onmessage = function(event) {
	var p = event.data.split(",");
        var worker = new com.unitedCoders['Numbers'+p[0]]();
	var results = worker.findSociable(+p[1], +p[2]);
	postMessage(JSON.stringify(results));
    }
}

//This is a helper object to init the hooks, start the variants, generate output
//Needed IDs in DOM: d1,d2,d3,w1,w2,w3,results
com.unitedCoders.NumberRunner = {
   times : {},
   count : {},
   getTime : function(variant, ms) {
     if (window['console']) { console.info("Variant "+variant+" takes "+ms+"ms.");}
     this.times[variant] = (this.times[variant]||0) + ms;
     this.count[variant] = (this.count[variant]||0) + 1;
     return Math.round(this.times[variant]/this.count[variant]);
   },
   initDom : function(modes){
     for (var j=0;j<modes.length;j++) {
       for (var i=1; i<4; i++) {
         var node = document.getElementById(modes[j]+i);
         if (node) {
	   if (modes[j]==="d" || window['Worker']) {
             node.innerHTML="Click me";
             (function(m, c) {
	       node.onclick=function(){com.unitedCoders.NumberRunner.run(m, c);};
             })(modes[j], i);
	   } else { node.innerHTML="nothing"; }
         }
       }
     }
   },
   run : function(mode, variant) {
     if (window.console) {console.info("starting "+mode+"-worker in variant "+variant); }
     var worker=[], max = 15000;
     //Starting the worker or direct variant
     if (mode==="d") {
       worker = new com.unitedCoders["Numbers"+variant]();
       window.setTimeout(function(){
         draw(worker.findSociable(1, max));
       }, 1);
     } else {
       for (var i=0;i<mode;i++) {
	 worker[i] = new Worker("/sites/default/files/numbers.js.txt");
         worker[i].onmessage = function(event) { collect(JSON.parse(event.data)); }
         worker[i].postMessage(variant+","+(max*i/mode)+","+(max*(i+1)/mode));
       }
     }
     //Writing "Working"
     document.getElementById(mode+variant).innerHTML = "Working ...";
     document.getElementById(mode+variant).onclick = 0;
     var start = new Date();
     var results = [];
     var calls = +mode;

     //collect the result from 4 calls
     function collect(part) {
       results = results.concat(part);
       if (window['console']) { console.info("Step "+(+mode+1-calls)+", time:"+((new Date()) - start)); }
       if (!--calls) { 
	   results.sort(function(a,b){return a[0]-b[0];});
           draw(results);
       }
     }

     //local function to draw the results and times.
     function draw(results) {
       if (mode!=="d") {
         for (var i=0; i<worker.length; i++) worker[i].terminate(); 
       }
       var node = document.getElementById("results");
       if (node) {
         var inner = "<ul>";
         var end = (new Date()) - start;
         for (var i=0; i<results.length; i++) {
            switch(results[i].length){
              case 1: inner+="<li>perfect number: "; break;
              case 2: inner += "<li>amicable numbers: "; break; 
              default: inner += "<li>sociable numbers: ";
            }
            inner += "[" + results[i].join(", ") + "].</li>";
         }
         node.innerHTML = inner;
       }
    
       node = document.getElementById(mode+variant);
       if (node) { 
         node.innerHTML = com.unitedCoders.NumberRunner.getTime(variant, end)+" ms."; 
         node.onclick = function(){ com.unitedCoders.NumberRunner.run(mode, variant); };
       }
   }
 }
};