// * date 2011/10/19 *


// ------ TRACE ------
function trace(s,o){if(window.console && window.console.debug){arguments.length === 2 ? window.console.debug(s,o) : window.console.debug(s);}}



// ------ HEXTORGB convert hex to rgb color ------
function HexToRGB(h){
	if(h.charAt(0)=="#"){
		var coul = h.substring(1,7);
		var r = parseInt(coul.substring(0,2),16);
		var g = parseInt(coul.substring(2,4),16);
		var b = parseInt(coul.substring(4,6),16);
		return 'rgb('+r+', '+g+', '+b+')';
	}else{
		return null;	
	}
}



// ------ PAIR check if number is pair of impair ------
function pair(n){return typeof n=='number'?(n%2==0?true:false):null;}



// ------ RANDOM ------
function random(n1,n2){
	return arguments.length === 1 && typeof n1 === 'number'? Math.random()*n1 : ( arguments.length === 2 && typeof n1 === typeof n2 && typeof n1 === 'number' ? n1 + Math.random()*(n2-n1) : NaN );
}

// ------ SHUFFLE Add a shuffle function to Array object prototype ------
/* author: Stephane Roucheray
 * src: http://sroucheray.org/blog/2009/11/array-sort-should-not-be-used-to-shuffle-an-array/
 * found 2011/09/08.
 */
Array.prototype.shuffle = function (){
    var i = this.length, j, temp;
    if ( i == 0 ) return;
    while ( --i ) {
        j = Math.floor( Math.random() * ( i + 1 ) );
        temp = this[i];
        this[i] = this[j];
        this[j] = temp;
    }
};


// ------ ROUNDED ------
function round(n,granularity){
	if(arguments.length == 1){
		n = Math.round(n);
	}else{
		granularity = granularity.toString();
		granularity = granularity.replace(/./gi, 0);
		granularity = granularity.replace(/^./gi, 1);
		granularity = parseInt(granularity);
		n = Math.round(n*granularity)/granularity;
	}
	return n;
}



// ------ FLOOR ------
function floor(n,granularity){
	if(arguments.length == 1){
		n = Math.floor(n);
	}else{
		granularity = granularity.toString();
		granularity = granularity.replace(/./gi, 0);
		granularity = granularity.replace(/^./gi, 1);
		granularity = parseInt(granularity);
		n = Math.floor(n*granularity)/granularity;
	}
	return n;
}



// ------ CEIL ------
function ceil(n,granularity){
	if(arguments.length == 1){
		n = Math.ceil(n);
	}else{
		granularity = granularity.toString();
		granularity = granularity.replace(/./gi, 0);
		granularity = granularity.replace(/^./gi, 1);
		granularity = parseInt(granularity);
		n = Math.ceil(n*granularity)/granularity;
	}
	return n;
}



// ------ UNIQUE reduces duplicates ------
Array.prototype.unique = function () {
	var r = new Array();
	o:for(var i = 0, n = this.length; i < n; i++)
	{
		for(var x = 0, y = r.length; x < y; x++)
		{
			if(r[x]==this[i])
			{
				continue o
			}
		}
		r[r.length] = this[i];
	}
	return r;
}



// ------ SUBSTRACT substract two array ------
function ArraySubtract(ara1,ara2) {
  var aRes = new Array() ;
  for (var i = ara1.length-1; i >= 0; i--)
    if( !ara2.contains(ara1[i]) )
      aRes.push(ara1[i]);
  return aRes ;

}



// ------ CONTAINS ------
Array.prototype.contains = function(obj) {
    var i = this.length;
    while (i--)
        if (this[i] === obj)
            return true;
    return false;
}



// ------ TRIM remove multiple, leading or trailing spaces ------
String.prototype.trim = function() {
	return this.replace(/(^\s*)|(\s*$)/gi,"").replace(/[ ]{2,}/gi," ").replace(/\n /,"\n");
}



// ------ OBJECTSIZE get the length of objects ------
function objectSize(o) {
	var len = o.length ? --o.length : 0;
	for (var k in o)
		len++;
	return len;
}
// Object.prototype.size = function () {
// 	// var len = this.length ? --this.length : -1; // POURQUOI NE FONCTIONNE PAS?
// 	var len = this.length ? --this.length : -2;
// 	for (var k in this)
// 		len++;
// 	return len;
// }



// ------ OBJECTGETKEY get key of index ------
function objectGetKey(o,index){
	var i = 0;
	for (var k in o){
		if (k === 'length' || !o.hasOwnProperty(k)) 
			continue;
		if(i == index) 
			return k;
		i ++;
	}
}
// Object.prototype.getKey = function(index){
// 	var i = 0;
// 	for (var key in this){
// 		if (key === 'length' || !this.hasOwnProperty(key)) 
// 			continue;
// 		if(i == index) 
// 			return key;
// 		i ++;
// 	}
// }

// ------ OBJECTSORT sort object ------
function objectSort(o,value) {
    var connection = new Array();
	for (var i = objectSize(o) - 1; i >= 0; i--){
		var k = objectGetKey(o,i);
		for (var j = objectSize(o[k].wit) - 1; j >= 0; j--){
			var k2 = objectGetKey(o[k].wit,j);
			if (k2==value) {
				var the_wit = parseFloat(o[k].wit[k2]);
				connection.push( {wit:the_wit,nid:k} );
			};
		};
	};

	connection.sort(function(a,b){
		// return (a.wit - b.wit);//ascending
		return (b.wit - a.wit);//descending
	});

	var o_sort = {};
	for (var i = connection.length - 1; i >= 0; i--){
		// o_sort[connection[i].wit+'-'+connection[i].nid] = o[connection[i].nid];
		o_sort[connection[i].nid] = o[connection[i].nid];
	};

	return o_sort;
}



// ------ REMOVE ------
// /!\	Found on the Internet, not sure of efficiency.
Array.prototype.remove = function(v) {
    var x, _i, _len, _results;
    _results = [];
    for (_i = 0, _len = this.length; _i < _len; _i++) {
        x = this[_i];
        if (x !== v) {
            _results.push(x);
        }
    }
    return _results;
};