ninegrid2 6.99.0 → 6.100.0

package/dist/bundle.cjs.js

@@ -11490,6 +11490,34 @@ class ninegrid {
 	}
 }
 
+Array.prototype.nineBinarySearch = function(target)
+{
+	//this.sort((a,b) => { return a > b ? 1 : -1; });
+	
+	let start = 0;
+	let end = this.length-1;
+	let mid;
+	
+	while (start <= end) { //점점 좁혀지다가 start와 end의 순서가 어긋나게 되면 반복을 종료한다
+	
+		mid = parseInt((start+end)/2);
+		
+		if (target == this[mid]) {
+			return mid;
+		}
+		else {
+			if (target < this[mid]){
+				end = mid - 1;
+			}
+			else {
+				start = mid + 1;
+			}
+		}
+	}
+	
+	return -1;
+};
+
 class NgContainer4 extends HTMLElement {
   constructor() {
     super();
@@ -17101,13 +17129,11 @@ class ngDataManager
 		this.exprFunction = (s) => {
 			
 			s = s.replaceAll("ninegrid.ROW.ORDER", ninegrid.ROW.ORDER);
-			
-
 
 			let args = '...args';
 			let body = 'let [data, currow, all] = args; currow = Number(currow); return ' + s + ';';
 			
-			console.log(s);
+			//console.log(s);
 
 			return new Function(args, body);
 			//return new Function('data', 'currow', 'return ' + s + ';');

package/dist/bundle.esm.js

@@ -11488,6 +11488,34 @@ class ninegrid {
 	}
 }
 
+Array.prototype.nineBinarySearch = function(target)
+{
+	//this.sort((a,b) => { return a > b ? 1 : -1; });
+	
+	let start = 0;
+	let end = this.length-1;
+	let mid;
+	
+	while (start <= end) { //점점 좁혀지다가 start와 end의 순서가 어긋나게 되면 반복을 종료한다
+	
+		mid = parseInt((start+end)/2);
+		
+		if (target == this[mid]) {
+			return mid;
+		}
+		else {
+			if (target < this[mid]){
+				end = mid - 1;
+			}
+			else {
+				start = mid + 1;
+			}
+		}
+	}
+	
+	return -1;
+};
+
 class NgContainer4 extends HTMLElement {
   constructor() {
     super();
@@ -17099,13 +17127,11 @@ class ngDataManager
 		this.exprFunction = (s) => {
 			
 			s = s.replaceAll("ninegrid.ROW.ORDER", ninegrid.ROW.ORDER);
-			
-
 
 			let args = '...args';
 			let body = 'let [data, currow, all] = args; currow = Number(currow); return ' + s + ';';
 			
-			console.log(s);
+			//console.log(s);
 
 			return new Function(args, body);
 			//return new Function('data', 'currow', 'return ' + s + ';');

package/dist/etc/ngDataManager.js

@@ -124,13 +124,11 @@ export class ngDataManager
 		this.exprFunction = (s) => {
 			
 			s = s.replaceAll("ninegrid.ROW.ORDER", ninegrid.ROW.ORDER);
-			
-
 
 			let args = '...args';
 			let body = 'let [data, currow, all] = args; currow = Number(currow); return ' + s + ';';
 			
-			console.log(s);
+			//console.log(s);
 
 			return new Function(args, body);
 			//return new Function('data', 'currow', 'return ' + s + ';');

package/dist/utils/ninegrid.js

@@ -784,4 +784,32 @@ export class ninegrid {
 				}
 			},
 	}
-}
+}
+
+Array.prototype.nineBinarySearch = function(target)
+{
+	//this.sort((a,b) => { return a > b ? 1 : -1; });
+	
+	let start = 0;
+	let end = this.length-1
+	let mid
+	
+	while (start <= end) { //점점 좁혀지다가 start와 end의 순서가 어긋나게 되면 반복을 종료한다
+	
+		mid = parseInt((start+end)/2)
+		
+		if (target == this[mid]) {
+			return mid;
+		}
+		else{
+			if (target < this[mid]){
+				end = mid - 1;
+			}
+			else {
+				start = mid + 1;
+			}
+		}
+	}
+	
+	return -1;
+};

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "ninegrid2",
   "type": "module",
-  "version": "6.99.0",
+  "version": "6.100.0",
   "main": "dist/index.js",
   "exports": {
     "import": "./dist/index.js",

package/src/etc/ngDataManager.js

@@ -124,13 +124,11 @@ export class ngDataManager
 		this.exprFunction = (s) => {
 			
 			s = s.replaceAll("ninegrid.ROW.ORDER", ninegrid.ROW.ORDER);
-			
-
 
 			let args = '...args';
 			let body = 'let [data, currow, all] = args; currow = Number(currow); return ' + s + ';';
 			
-			console.log(s);
+			//console.log(s);
 
 			return new Function(args, body);
 			//return new Function('data', 'currow', 'return ' + s + ';');

package/src/utils/ninegrid.js

@@ -784,4 +784,32 @@ export class ninegrid {
 				}
 			},
 	}
-}
+}
+
+Array.prototype.nineBinarySearch = function(target)
+{
+	//this.sort((a,b) => { return a > b ? 1 : -1; });
+	
+	let start = 0;
+	let end = this.length-1
+	let mid
+	
+	while (start <= end) { //점점 좁혀지다가 start와 end의 순서가 어긋나게 되면 반복을 종료한다
+	
+		mid = parseInt((start+end)/2)
+		
+		if (target == this[mid]) {
+			return mid;
+		}
+		else{
+			if (target < this[mid]){
+				end = mid - 1;
+			}
+			else {
+				start = mid + 1;
+			}
+		}
+	}
+	
+	return -1;
+};