encoder.js
function(a,b) {
		var tA, tB, i;
		for (i=0; i<a.length; ++i) {
			tA = typeof a[i]; tB = typeof b[i];
			if (tA === tB) {
				if ((tA === 'number') || (tA === 'string') || (tA === 'boolean')) {
					if (a[i] < b[i]) return -1;
					if (a[i] > b[i]) return 1;
					if (a[i] !== b[i]) return 1;
				  /*if (a[i] == b[i]) continue;*/
				} else {
					if (a[i] === b[i]) continue;
					return 1;
				}
			} else {
				return 1;
			}
		}
		return 0;
	}
function(a,b) {
		var tA, tB, i;
		for (i=0; i<a.length; ++i) {
			tA = typeof a[i]; tB = typeof b[i];
			if (tA === tB) {
				if ((tA === 'number') || (tA === 'string') || (tA === 'boolean')) {
					if (a[i] < b[i]) return -1;
					if (a[i] > b[i]) return 1;
					if (a[i] !== b[i]) return 1;
				  /*if (a[i] == b[i]) continue;*/
				} else {
					if (a[i] === b[i]) continue;
					return 1;
				}
			} else {
				return 1;
			}
		}
		return 0;
	}
function ( a , b ) { var tA , tB , i ; for ( i = 0 ; i < a . length ; ++ i ) { tA = typeof a [ i ] ; tB = typeof b [ i ] ; if ( tA === tB ) { if ( ( tA === 'number' ) || ( tA === 'string' ) || ( tA === 'boolean' ) ) { if ( a [ i ] < b [ i ] ) return - 1 ; if ( a [ i ] > b [ i ] ) return 1 ; if ( a [ i ] !== b [ i ] ) return 1 ; /*if (a[i] == b[i]) continue;*/ } else { if ( a [ i ] === b [ i ] ) continue ; return 1 ; } } else { return 1 ; } } return 0 ; }
Binary Search Tree Helpers
Binary Search Tree Helpers