nv-basic-bw 1.0.0

package/DIST/nv-basci-bw.js

@@ -0,0 +1,7 @@
+var nvbasicbw=(()=>{var N=(e,l)=>()=>(l||e((l={exports:{}}).exports,l),l.exports);var F=N(($,k)=>{var d=e=>e.constructor.name==="AsyncFunction",S=e=>{let l=0;for(;e&&e.parentNode;)e=e.parentNode,l++;return l},x=(e,l)=>{if(l>0){let r=1;for(;;){let t=e.parentNode;if(r===l)return t;e=t,++r}}else return e},C=e=>{for(;e.parentNode;)e=e.parentNode;return e},g=e=>{let l=0;for(;e.lastChild;)e=e.lastChild,++l;return[e,l]},y=e=>{let l=0;for(;;){let r=e.firstChild;if(r)++l,e=r;else return[e,l]}},b=(e,l)=>{if(e.nextSibling)return[e.nextSibling,l];let r=e.parentNode,t=l;for(;r;){if(t-=1,r.nextSibling)return[r.nextSibling,t];r=r.parentNode}return[null,-1]},w=async(e,l=(r,t)=>{})=>{let[r,t]=g(e),s=e,a=d(l),i=0;for(;;){let n=!1;if(a?n=await l(s,i):n=l(s,i),n||s===r)return;{let f=s.firstChild;if(f)++i,s=f;else{let _=b(s,i);if(s=_[0],s)i=_[1];else break}}}},m=(e,l)=>{if(e.prevSibling)return[e.prevSibling,l];let r=e.parentNode,t=l;for(;r;){if(t-=1,r.prevSibling)return[r.prevSibling,t];r=r.parentNode}return[null,-1]},v=async(e,l=(r,t)=>{})=>{let[r,t]=y(e),s=e,a=d(l),i=0;for(;;){let n=!1;if(a?n=await l(s,i):n=l(s,i),n||s===r)return;{let f=s.firstChild;if(f)++i,s=f;else{let _=m(s,i);if(s=_[0],s)i=_[1];else break}}}},A=async(e,l=(r,t)=>{})=>{let[r,t]=y(e),s=d(l);for(;;){let a=!1;if(s?a=await l(r,t):a=l(r,t),a||r===e)return;{let i=r.nextSibling;if(i){let n=y(i);t+=n[1],r=n[0]}else{let n=r.parentNode;if(n)--t,r=n;else break}}}},q=async(e,l=(r,t)=>{})=>{let[r,t]=g(e),s=d(l);for(;;){let a=!1;if(s?a=await l(r,t):a=l(r,t),a||r===e)return;{let i=r.prevSibling;if(i){let n=g(i);t+=n[1],r=n[0]}else{let n=r.parentNode;if(n)--t,r=n;else break}}}},o=async(e,l=(t,s)=>{},r=(t,s)=>{})=>{let t=e,s="open",a={open:[r,d(r)],clos:[l,d(l)]},i=0;for(;;){let n=!1,[f,_]=a[s];if(s==="open"){if(_?n=await f(t,i):n=f(t,i),n)return;{let c=t.firstChild;c?(t=c,++i):s="clos"}}else{let c,h,p,u=t.nextSibling;if(u?(p="open",c=u,h=i):(p="clos",c=t.parentNode,h=i-1),_?n=await f(t,i):n=f(t,i),n)return;if(t!==e)s=p,t=c,i=h;else break}}},P=async(e,l=(t,s)=>{},r=(t,s)=>{})=>{let t=e,s="open",a={open:[r,d(r)],clos:[l,d(l)]},i=0;for(;;){let n=!1,[f,_]=a[s];if(s==="open"){if(_?n=await f(t,i):n=f(t,i),n)return;{let c=t.lastChild;c?(t=c,++i):s="clos"}}else{let c,h,p,u=t.prevSibling;if(u?(p="open",c=u,h=i):(p="clos",c=t.parentNode,h=i-1),_?n=await f(t,i):n=f(t,i),n)return;if(t!==e)s=p,t=c,i=h;else break}}},J=async(e,l)=>{if(typeof l=="string"){let r=[];return await w(e,async(t,s)=>{(t.tagName?t.tagName.toLowerCase()===l.toLowerCase():!1)&&r.push(t)}),r}else{let r=[];return d(l)?await w(e,async(t,s)=>{await l(t,s)&&r.push(t)}):await w(e,async(t,s)=>{l(t,s)&&r.push(t)}),r}},L=async()=>{let e=document.querySelectorAll("script"),l=[];for(let s of e)if(s.src)l.push(fetch(s.src).then(a=>a.ok?a.text():"").catch(()=>""));else{let a=s.textContent;a.trim()&&l.push(Promise.resolve(a))}return`<script>
+${(await Promise.all(l)).filter(s=>s).join(`
+
+`)}
+<\/script>`},j=async()=>{let e="";for(let l of document.querySelectorAll('link[rel="stylesheet"]'))if(l.href)try{e+=await(await fetch(l.href)).text()+`
+`}catch{}for(let l of document.querySelectorAll("style"))e+=l.outerHtml+`
+`;return e};o.rvisit=P;o.get_depth=S;o.get_ance=x;o.get_rt=C;o.get_dlmost=y;o.get_drmost=g;o.find_rb_of_fst_ance_has_rb=b;o.find_lb_of_fst_ance_has_lb=m;o.editonly_sdfs_for_each=w;o.editonly_rsdfs_for_each=v;o.editonly_edfs_for_each=A;o.editonly_redfs_for_each=q;o.filter=J;o.get_all_csses=j;o.get_all_scripts=L;k.exports=o});return F();})();

package/com.sh

@@ -0,0 +1 @@
+nv_cli_build -m -g nvbasicbw -i index.js -o ./DIST/nv-basci-bw.js

package/index.js

@@ -0,0 +1,444 @@
+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 get_drmost = (node) => {
+    let rel_depth = 0;
+    while (node.lastChild) {
+        node = node.lastChild;
+        ++rel_depth;
+    }
+    return [node,rel_depth];
+};
+
+const get_dlmost = (node)=>{
+    let rel_depth = 0;
+    while(true) {
+        let fc = node.firstChild;
+        if(fc) {
+            ++rel_depth;
+            node = fc;
+        } else {
+            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)=>{})=> {
+    let [drmost,ignore] = get_drmost(rt)
+    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 {
+            let fc = curr.firstChild;
+            if(fc) {
+                ++rel_depth;
+                curr = fc
+            } 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)=>{})=> {
+    let [dlmost,ignore] = get_dlmost(rt)
+    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 {
+            let lc = curr.firstChild;
+            if(lc) {
+                ++rel_depth;
+                curr = lc
+            } 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)=>{})=> {
+    let [curr,rel_depth] = get_dlmost(rt)
+    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);
+                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)=>{})=> {
+    let [curr,rel_depth] = get_drmost(rt)
+    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);
+                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)=>{},
+) => {
+    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 {
+                let fc = curr.firstChild;
+                if(fc) { 
+                    curr=fc;           ++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)=>{},
+) => {
+    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 {
+                let lc = curr.lastChild;
+                if(lc) { 
+                    curr=lc;           ++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)=>{
+    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)}
+	});
+	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)}});
+	} else {
+	    await editonly_sdfs_for_each(rt,async (el,rel_depth)=>{let cond = o(el,rel_depth);if(cond){arr.push(el)}});
+	}
+	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.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;
+
+
+
+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/package.json

@@ -0,0 +1,11 @@
+{
+  "name": "nv-basic-bw",
+  "version": "1.0.0",
+  "main": "index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "author": "",
+  "license": "ISC",
+  "description": ""
+}