nv-basic-bw 1.0.11 → 1.0.14

package/index.js

@@ -1,599 +1,27 @@
-const is_async = (f)=>f.constructor.name === "AsyncFunction";
-
-const get_depth = (node) => {
-    let depth = 0;
-    while (node && node.parentNode) {
-        node = node.parentNode;
-        depth++;
-    }
-    return depth;
-};
-
-const get_ance  = (node,which)=>{
-    if(which >0) {
-        let c = 1;
-        while(true) {
-            let pr = node.parentNode;
-            if(c===which) {
-                return pr;
-            } else {
-                node = pr;
-                ++c;
-            }
-        }
-    } else {
-        return node;
-    }
-}
-
-const get_rt = (node) => {
-    while (node.parentNode) {
-        node = node.parentNode;
-    }
-
-    return node;
-};
-
-
-const is_topo_leaf = (nd)=> nd.firstChild!==null && nd.firstChild!==undefined;
-
-const get_drmost = (node,is_leaf=is_topo_leaf) => {
-    let rel_depth = 0;
-    while (!(is_leaf(node))) {
-        node = node.lastChild;
-        ++rel_depth;
-    }
-    return [node,rel_depth];
-};
-
-const get_dlmost = (node,is_leaf=is_topo_leaf)=>{
-    let rel_depth = 0;
-    while(!is_leaf(node)) {
-        node = node.firstChild;
-        ++rel_depth;
-    }
-    return [node,rel_depth];
-}
-
-const find_rb_of_fst_ance_has_rb = (node, rel_depth) => {
-    // 1️⃣ 当前节点有 nextSibling
-    if (node.nextSibling) {
-        return [node.nextSibling, rel_depth];
-    }
-
-    // 2️⃣ 沿父节点向上查找
-    let current = node.parentNode;
-    let depth = rel_depth;
-
-    while (current) {
-        depth -= 1; // 向上走一层
-
-        if (current.nextSibling) {
-            return [current.nextSibling, depth];
-        }
-
-        current = current.parentNode;
-    }
-
-    // 3️⃣ 已到根节点，仍然没有
-    return [null,-1];
-};
-
-const editonly_sdfs_for_each = async(rt,cb=(el,rel_depth)=>{},is_leaf=is_topo_leaf)=> {
-    let [drmost,ignore] = get_drmost(rt,is_leaf)
-    let curr = rt;
-    let should_await = is_async(cb);
-    let rel_depth =0;
-    while(true) {
-        let should_break = false;
-        if(should_await) {
-            should_break = await cb(curr,rel_depth);    
-        } else {
-            should_break = cb(curr,rel_depth);
-        }
-        if(should_break||curr=== drmost) {return;} else {
-            if(!is_leaf(curr)) {
-                ++rel_depth;
-                curr = curr.firstChild;
-            } else {
-                let pair = find_rb_of_fst_ance_has_rb(curr,rel_depth);
-                curr = pair[0];
-                if(curr) {
-                    rel_depth = pair[1];
-                } else   {
-                    break;
-                }
-            }
-
-        }
-    }
-}
-
-const find_lb_of_fst_ance_has_lb = (node, rel_depth) => {
-    // 1️⃣ 当前节点有 nextSibling
-    if (node.prevSibling) {
-        return [node.prevSibling, rel_depth];
-    }
-
-    // 2️⃣ 沿父节点向上查找
-    let current = node.parentNode;
-    let depth = rel_depth;
-
-    while (current) {
-        depth -= 1; // 向上走一层
-
-        if (current.prevSibling) {
-            return [current.prevSibling, depth];
-        }
-
-        current = current.parentNode;
-    }
-
-    // 3️⃣ 已到根节点，仍然没有
-    return [null,-1];
-};
-
-const editonly_rsdfs_for_each = async(rt,cb=(el,rel_depth)=>{},is_leaf=is_topo_leaf)=> {
-    let [dlmost,ignore] = get_dlmost(rt,is_leaf)
-    let curr = rt;
-    let should_await = is_async(cb);
-    let rel_depth =0;
-    while(true) {
-        let should_break = false;
-        if(should_await) {
-            should_break = await cb(curr,rel_depth);
-        } else {
-            should_break = cb(curr,rel_depth);
-        }
-        if(should_break||curr=== dlmost) {return;} else {
-            if(!is_leaf(curr)) {
-                ++rel_depth;
-                curr = curr.lastChild;
-            } else {
-                let pair = find_lb_of_fst_ance_has_lb(curr,rel_depth);
-                curr = pair[0];
-                if(curr) {
-                    rel_depth = pair[1];
-                } else   {
-                    break;
-                }
-            }
-
-        }
-    }
-}
-
-const editonly_edfs_for_each = async(rt,cb=(el,rel_depth)=>{},is_leaf=is_topo_leaf)=> {
-    let [curr,rel_depth] = get_dlmost(rt,is_leaf)
-    let should_await = is_async(cb);
-    while(true) {
-        let should_break = false;
-        if(should_await) {
-            should_break = await cb(curr,rel_depth);
-        } else {
-            should_break = cb(curr,rel_depth);
-        }
-        if(should_break|| curr === rt) {return;} else {
-            let rb = curr.nextSibling;
-            if(rb) {
-                let pair = get_dlmost(rb,is_leaf);
-                rel_depth+= pair[1];
-                curr = pair[0];
-            } else {
-                let pr = curr.parentNode;
-                if(pr) {
-                    --rel_depth;
-                    curr = pr;
-                } else {
-                    break;
-                }
-            }
-        }
-    }
-}
-
-const editonly_redfs_for_each = async(rt,cb=(el,rel_depth)=>{},is_leaf=is_topo_leaf)=> {
-    let [curr,rel_depth] = get_drmost(rt,is_leaf)
-    let should_await = is_async(cb);
-    while(true) {
-        let should_break = false;
-        if(should_await) {
-            should_break = await cb(curr,rel_depth);
-        } else {
-            should_break = cb(curr,rel_depth);
-        }
-        if(should_break || curr === rt) {return;} else {
-            let lb = curr.prevSibling;
-            if(lb) {
-                let pair = get_drmost(lb,is_leaf);
-                rel_depth+= pair[1];
-                curr = pair[0];
-            } else {
-                let pr = curr.parentNode;
-                if(pr) {
-                    --rel_depth;
-                    curr = pr;
-                } else {
-                    break;
-                }
-            }
-        }
-    }
-}
-
-const visit = async(
-    rt,
-    exit_cb  = (el,rel_depth)=>{},
-    enter_cb = (el,rel_depth)=>{},
-    is_leaf=is_topo_leaf,
-) => {
-    let curr  = rt;
-    let state = "open";
-    let cbs   = {
-        "open": [enter_cb, is_async(enter_cb)],
-        "clos": [exit_cb,  is_async(exit_cb) ]
-    };
-    let rel_depth = 0;
-    while(true) {
-        let should_break = false;
-        let [cb,should_await] = cbs[state];
-        if(state === "open") {
-            // open 状态 先执行用户回调
-            if(should_await) {should_break = await cb(curr,rel_depth);} else{should_break = cb(curr,rel_depth);} 
-            // 然后再取下一个节点:  用户回调如果修改了树结构,拿到的是修改后的
-            if(should_break) {return;} else {
-                if(!is_leaf(curr)) { 
-                    curr=curr.firstChild; ++rel_depth;
-                } else {
-                    state = "clos";
-                }
-            }
-        } else {
-            //事先拿出nxt,因为用户可能改变树结构
-            let nxt;
-            let nxt_rel_depth;
-            let nxt_state;
-            let rb = curr.nextSibling;
-            if(rb) {
-                nxt_state = "open"; 
-                nxt = rb;
-                nxt_rel_depth = rel_depth;
-            } else {
-                nxt_state = "clos";
-                nxt           = curr.parentNode; 
-                nxt_rel_depth = rel_depth -1;
-            }
-            if(should_await) {should_break = await cb(curr,rel_depth);} else{should_break = cb(curr,rel_depth);}
-            if(should_break) {return;} else {
-                if(curr !== rt) {
-		    state = nxt_state;curr  = nxt;rel_depth = nxt_rel_depth;
-		} else          {
-		    break;
-		}
-            }
-        }
-    }
-}
-
-
-const rvisit = async(
-    rt,
-    exit_cb  = (el,rel_depth)=>{},
-    enter_cb = (el,rel_depth)=>{},
-    is_leaf=is_topo_leaf,
-) => {
-    let curr  = rt;
-    let state = "open";
-    let cbs   = {
-        "open": [enter_cb, is_async(enter_cb)],
-        "clos": [exit_cb,  is_async(exit_cb) ]
-    };
-    let rel_depth = 0;
-    while(true) {
-        let should_break = false;
-        let [cb,should_await] = cbs[state];
-        if(state === "open") {
-            // open 状态 先执行用户回调
-            if(should_await) {should_break = await cb(curr,rel_depth);} else{should_break = cb(curr,rel_depth);} 
-            // 然后再取下一个节点:  用户回调如果修改了树结构,拿到的是修改后的
-            if(should_break) {return;} else {
-                if(!is_leaf(curr)) { 
-                    curr=curr.lastChild;;           ++rel_depth;
-                } else {
-                    state = "clos";
-                }
-            }
-        } else {
-            //事先拿出nxt,因为用户可能改变树结构
-            let nxt;
-            let nxt_rel_depth;
-            let nxt_state;
-            let lb = curr.prevSibling;
-            if(lb) {
-                nxt_state = "open"; 
-                nxt = lb;
-                nxt_rel_depth = rel_depth;
-            } else {
-                nxt_state = "clos";
-                nxt           = curr.parentNode; 
-                nxt_rel_depth = rel_depth -1;
-            }
-            if(should_await) {should_break = await cb(curr,rel_depth);} else{should_break = cb(curr,rel_depth);}
-            if(should_break) {return;} else {
-                if(curr !== rt) {
-                    state = nxt_state;curr  = nxt;rel_depth = nxt_rel_depth;
-                } else          {
-                    break;
-                }            
-	    }
-        }
-    }
-}
-
-const filter = async(rt,o,is_leaf=is_topo_leaf)=>{
-    if(typeof(o)==="string") {
-	let arr =[];
-	await editonly_sdfs_for_each(rt,async (el,rel_depth)=>{
-	    let cond = el.tagName? (el.tagName.toLowerCase()===o.toLowerCase()):false;
-	    if(cond){arr.push(el)}
-	},is_leaf);
-	return arr;
-    } else {
-        let arr = [];
-	if(is_async(o)) {
-	    await editonly_sdfs_for_each(rt,async (el,rel_depth)=>{let cond = await o(el,rel_depth);if(cond){arr.push(el)}},is_leaf);
-	} else {
-	    await editonly_sdfs_for_each(rt,async (el,rel_depth)=>{let cond = o(el,rel_depth);if(cond){arr.push(el)}},is_leaf);
-	}
-	return arr;
-    }
-}
-
-const get_all_scripts = async()=>{
-  const scripts = document.querySelectorAll('script');
-  const codePromises = [];
-  
-  for (const script of scripts) {
-    if (script.src) {
-      codePromises.push(
-        fetch(script.src)
-          .then(r => r.ok ? r.text() : '')
-          .catch(() => '')
-      );
-    } else {
-      const inlineCode = script.textContent;
-      if (inlineCode.trim()) {
-        codePromises.push(Promise.resolve(inlineCode));
-      }
-    }
-  }
-  
-  const codes = await Promise.all(codePromises);
-  const allJsCode = codes.filter(code => code).join('\n\n');
-  
-  return `<script>\n${allJsCode}\n</script>`;
-}
-
-const get_all_csses = async()=>{
-  let css = '';
-  for (const link of document.querySelectorAll('link[rel="stylesheet"]')) {
-    if (link.href) {
-      try {
-        css += await (await fetch(link.href)).text() + '\n';
-      } catch {}
-    }
-  }
-  for (const style of document.querySelectorAll('style')) {
-    css += style.outerHtml + '\n';
-  }
-  return css;
-}
-
-visit.rvisit     = rvisit;
-visit.get_depth  = get_depth;
-visit.get_ance   = get_ance;
-visit.get_rt     = get_rt;
-visit.is_topo_leaf = is_topo_leaf;
-visit.get_dlmost = get_dlmost;
-visit.get_drmost = get_drmost;
-visit.find_rb_of_fst_ance_has_rb = find_rb_of_fst_ance_has_rb;
-visit.find_lb_of_fst_ance_has_lb = find_lb_of_fst_ance_has_lb;
-visit.editonly_sdfs_for_each     = editonly_sdfs_for_each;
-visit.editonly_rsdfs_for_each    = editonly_rsdfs_for_each;
-visit.editonly_edfs_for_each     = editonly_edfs_for_each;
-visit.editonly_redfs_for_each    = editonly_redfs_for_each;
-visit.filter = filter;
-visit.get_all_csses = get_all_csses;
-visit.get_all_scripts = get_all_scripts;
-
-
-const {wait_for_layout_ready} = require("./wait");
-
-const creat_rect_desc = () => ({
-    "x": 0,
-    "y": 0,
-    "width": 0,
-    "height": 0,
-    "top": 0,
-    "right": 0,
-    "bottom": 0,
-    "left": 0
-});
-
-const get_rect_desc_bfr_transfrom = async(el) => {
-    let rect_bfr_transfrom = creat_rect_desc();
-    // 方法：临时移除 transform 获取真实位置
-    // 保存原始 transform
-    const originalTransform = el.style.transform;
-    // 临时移除 transform（会触发一次 reflow）
-    el.style.transform = 'none';
-    await wait_for_layout_ready();
-    // 获取无 transform 的位置
-    const rect = el.getBoundingClientRect();
-    // 立即恢复 transform
-    el.style.transform = originalTransform;
-    // 复制所有值
-    rect_bfr_transfrom.x = rect.x;
-    rect_bfr_transfrom.y = rect.y;
-    rect_bfr_transfrom.width = rect.width;
-    rect_bfr_transfrom.height = rect.height;
-    rect_bfr_transfrom.top = rect.top;
-    rect_bfr_transfrom.left = rect.left;
-    rect_bfr_transfrom.right = rect.right;
-    rect_bfr_transfrom.bottom = rect.bottom;
-    return rect_bfr_transfrom;
-}
-
-const get_all_positions_bfr_transform = async (
-    el,
-    filter = (el) => true
-) => {
-    //使用editonly_sdfs_for_each 获取 
-    //类似 .getBoundingClientRect() 
-    let results = [];
-    await editonly_sdfs_for_each(el, async (curr_el) => {
-        if (filter(curr_el)) {
-            let rect_bfr_transfrom = await get_rect_desc_bfr_transfrom(curr_el);
-            results.push({
-                el: curr_el,
-                rect: rect_bfr_transfrom
-            });
-        }
-    });
-
-    return results;
-}
-const get_all_positions_aft_transform = async (
-    el,
-    filter = (el) => true
-) => {
-    // 获取 transform 之后的最终位置
-    let results = [];
-    await editonly_sdfs_for_each(el, async (curr_el) => {
-        if (filter(curr_el)) {
-            await wait_for_layout_ready();
-            let rect_aft_transfrom = curr_el.getBoundingClientRect();
-            results.push({
-                el: curr_el,
-                rect: rect_aft_transfrom
-            });
-        }
-    });
-
-    return results;
-}
-
-const get_all_positions_transform_diff = async(
-    el,
-    filter = (el) => true
-) => {
-    // 计算 transform 前后的差异
-    let results = [];
-    await editonly_sdfs_for_each(el, async (curr_el) => {
-        if (filter(curr_el)) {
-            let rect_bfr_transfrom =  await get_rect_desc_bfr_transfrom(curr_el);
-            await wait_for_layout_ready();//因为 get_rect_desc_bfr_transfrom 会改回去 transform，需要等待布局稳定
-            let rect_aft_transfrom = curr_el.getBoundingClientRect();
-            let rect_diff = {
-                x: rect_aft_transfrom.x - rect_bfr_transfrom.x,
-                y: rect_aft_transfrom.y - rect_bfr_transfrom.y,
-                width: rect_aft_transfrom.width - rect_bfr_transfrom.width,
-                height: rect_aft_transfrom.height - rect_bfr_transfrom.height,
-                top: rect_aft_transfrom.top - rect_bfr_transfrom.top,
-                right: rect_aft_transfrom.right - rect_bfr_transfrom.right,
-                bottom: rect_aft_transfrom.bottom - rect_bfr_transfrom.bottom,
-                left: rect_aft_transfrom.left - rect_bfr_transfrom.left
-            };
-            if (rect_diff.x === 0 && rect_diff.y === 0 &&
-                rect_diff.width === 0 && rect_diff.height === 0 &&
-                rect_diff.top === 0 && rect_diff.right === 0 &&
-                rect_diff.bottom === 0 && rect_diff.left === 0) {
-            } else {
-                results.push({
-                    el: curr_el,
-                    rect: rect_diff
-                });
-            }
-        }
-    });
-
-    return results;
-}
-
-
-visit.creat_rect_desc                  = creat_rect_desc;
-visit.get_rect_desc_bfr_transfrom      = get_rect_desc_bfr_transfrom;
-visit.get_all_positions_bfr_transform  = get_all_positions_bfr_transform;
-visit.get_all_positions_aft_transform  = get_all_positions_aft_transform;
-visit.get_all_positions_transform_diff = get_all_positions_transform_diff;
-
-const is_rect_overlapping = (rect1, rect2) => {
-    return !(rect1.right < rect2.left ||
-        rect1.left > rect2.right ||
-        rect1.bottom < rect2.top ||
-        rect1.top > rect2.bottom);
-}
-
-const is_ele_overlapping_with_eles = (checkEle, eleList) => {
-    let isOverlapping = false;
-    for (const element of eleList) {
-        const elementRect = element.getBoundingClientRect();
-        // 检查元素是否与标题重叠
-        if (is_rect_overlapping(elementRect, checkEle.getBoundingClientRect())) {
-            isOverlapping = true;
-            break;
-        }
-    }
-    return isOverlapping;
-}
-
-visit.is_rect_overlapping = is_rect_overlapping;
-visit.is_ele_overlapping_with_eles = is_ele_overlapping_with_eles;
-
-
+const _ison          = require("nvison-bw");
+const _util            = require("./util");
+const _nd              = require("./nd");
+const _ele             = require("./ele");
 const _attr          = require("./attr");
 const _wait          = require("./wait");
 const _ele_getter    = require("./ele-getter");
 const _cls_accessor  = require("./cls-accessor");
+const _limit         = require("./limit");
+const _code          = require("./code");
 const _ui            = require("./ui");
+const _dnld          = require("./dnld");
+
+module.exports = {
+   _ison,
+   _util,
+   _nd,
+   _ele,
+   _attr,
+   _wait,
+   _ele_getter,_cls_accessor,
+   _limit,
+   _code,
+   _ui,
+   _dnld
+}
 
-visit._attr         = _attr;
-visit._wait         = _wait;
-visit._ele_getter   = _ele_getter;
-visit._cls_accessor = _cls_accessor;
-visit._ui           = _ui;
-
-const _nvison = require("nvison");
-
-module.exports   = visit;
-
-/*
-visit(
-    document,
-	(el,rel_depth)=>{
-	    let t = el.nodeType;
-		switch(t) {
-		    case document.ELEMENT_NODE :{console.log(" ".repeat(rel_depth)+"</"+el.tagName.toLowerCase()+">");break;}
-			case document.TEXT_NODE    :{console.log(" ".repeat(rel_depth)+el.textContent);break;}
-			case document.COMMENT_NODE :{console.log(" ".repeat(rel_depth)+"<!--" +el.data + "-->");break;}
-			case document.ATTRIBUTE_NODE:              {break;}
-			case document.CDATA_SECTION_NODE :         {break;}
-			case document.ENTITY_REFERENCE_NODE:       {break;}
-			case document.ENTITY_NODE :                {break;}
-			case document.PROCESSING_INSTRUCTION_NODE: {break;}
-			case document.DOCUMENT_NODE:               {break;}
-			case document.DOCUMENT_TYPE_NODE:          {break;}
-			case document.DOCUMENT_FRAGMENT_NODE:      {break;}
-			case document.NOTATION_NODE :              {break;}
-		}
-	},
-	(el,rel_depth)=>{
-        let t = el.nodeType;
-		switch(t) {
-		    case document.ELEMENT_NODE :{
-			    console.log(" ".repeat(rel_depth)+"<"+el.tagName.toLowerCase()+">");break;
-			}
-		}
-	}, 
-)
-*/

package/limit.js

@@ -0,0 +1,103 @@
+class MxWhCtx {
+    css = `
+        position: fixed;
+        top: 0;
+        left: 0;
+        visibility: hidden;
+        overflow: hidden;
+        box-sizing: border-box;
+        border: none;
+        margin: 0;
+        padding: 0;
+        `;
+
+    is_ok(ele, dimension, val) {
+        ele.style[dimension] = `${val}px`;
+        const rect = ele.getBoundingClientRect();
+        return rect[dimension] === val;    
+    }
+
+    find_upbound(ele, dimension) {
+        let upper = 1;
+        while(true) {
+            if(this.is_ok(ele, dimension, upper)) {
+                upper *= 2;        
+            } else {
+                break;
+            }
+        }    
+        return upper;
+    }
+
+    mx(ele, dimension) {
+        ele.style.cssText = this.css;
+        document.body.appendChild(ele);
+
+        // 找到上界
+        let upper = this.find_upbound(ele, dimension);
+        let lower = Math.floor(upper / 2);
+
+        // 二分法查找精确的最大值
+        while (lower + 1 < upper) {
+            const mid = Math.floor((lower + upper) / 2);
+            if (this.is_ok(ele, dimension, mid)) {
+                lower = mid;  // 成功，向右搜索
+            } else {
+                upper = mid;  // 失败，向左搜索
+            }
+        }
+
+        document.body.removeChild(ele);
+        return lower;
+    }
+}
+
+// 主函数
+const find_mx_wh = () => {
+    let ele = document.createElement('div');
+    let ctx = new MxWhCtx();
+    let w = ctx.mx(ele, "width");
+    let h = ctx.mx(ele, "height");
+    return [w, h];
+};
+
+
+const creat_mxw_ele = (tag,height)=>{
+    let [w,h] = find_mx_wh();
+    let ele = document.createElement(tag);
+    ele.style.width  = `${w}px`;
+    ele.style.height = `${height}px`;
+    return ele;
+}
+const creat_mxh_ele = (tag,width)=>{
+    let [w,h] = find_mx_wh();
+    let ele = document.createElement(tag);
+    ele.style.width  = `${width}px`;
+    ele.style.height = `${h}px`;
+    return ele;
+}
+
+const creat_mxwh_ele = (tag)=>{
+    let [w,h] = find_mx_wh();
+    let ele = document.createElement(tag);
+    ele.style.width  = `${w}px`;
+    ele.style.height = `${h}px`;
+    return ele;
+}
+
+const calc_mx_cnt = (item_sz,dimension="height")=>{
+    let [w,h] = find_mx_wh();
+    if(dimension === "height") {
+	return Math.floor(w/item_sz);
+    } else {
+        return Math.floor(w/item_sz);
+    }
+}
+
+module.exports = {
+    find_mx_wh,
+    creat_mxw_ele,
+    creat_mxh_ele,
+    creat_mxwh_ele,
+    calc_mx_cnt
+}