ast-is-empty 4.0.6 → 4.0.8

package/LICENSE

@@ -1,6 +1,6 @@
 MIT License
 
-Copyright (c) 2010-2022 Roy Revelt and other contributors
+Copyright (c) 2010-2023 Roy Revelt and other contributors
 
 Permission is hereby granted, free of charge, to any person obtaining
 a copy of this software and associated documentation files (the

package/README.md

@@ -80,6 +80,6 @@ To report bugs or request features or assistance, [raise an issue](https://githu
 
 MIT License.
 
-Copyright © 2010-2022 Roy Revelt and other contributors.
+Copyright © 2010-2023 Roy Revelt and other contributors.
 
 <p align="center"><img src="https://codsen.com/images/png-codsen-ok.png" width="98" alt="ok" align="center"> <img src="https://codsen.com/images/png-codsen-1.png" width="148" alt="codsen" align="center"> <img src="https://codsen.com/images/png-codsen-star-small.png" width="32" alt="star" align="center"></p>

package/dist/ast-is-empty.esm.js

@@ -1,10 +1,10 @@
 /**
  * @name ast-is-empty
  * @fileoverview Find out, is nested array/object/string/AST tree is empty
- * @version 4.0.6
+ * @version 4.0.8
  * @author Roy Revelt, Codsen Ltd
  * @license MIT
  * {@link https://codsen.com/os/ast-is-empty/}
  */
 
-import{isPlainObject as o}from"codsen-utils";var n="4.0.6";var d=n;function l(e){let t,r,s=!0;if(Array.isArray(e)){if(e.length===0)return!0;for(t=0,r=e.length;t<r;t++){if(s=l(e[t]),s===null)return null;if(!s)return!1}}else if(o(e)){if(Object.keys(e).length===0)return!0;for(t=0,r=Object.keys(e).length;t<r;t++){if(s=l(e[Object.keys(e)[t]]),s===null)return null;if(!s)return!1}}else if(typeof e=="string"){if(e.length!==0)return!1}else return null;return s}export{l as isEmpty,d as version};
+import{isPlainObject as o}from"codsen-utils";var n="4.0.8";var d=n;function l(e){let t,r,s=!0;if(Array.isArray(e)){if(e.length===0)return!0;for(t=0,r=e.length;t<r;t++){if(s=l(e[t]),s===null)return null;if(!s)return!1}}else if(o(e)){if(Object.keys(e).length===0)return!0;for(t=0,r=Object.keys(e).length;t<r;t++){if(s=l(e[Object.keys(e)[t]]),s===null)return null;if(!s)return!1}}else if(typeof e=="string"){if(e.length!==0)return!1}else return null;return s}export{l as isEmpty,d as version};

package/dist/ast-is-empty.umd.js

@@ -1,17 +1,17 @@
 /**
  * @name ast-is-empty
  * @fileoverview Find out, is nested array/object/string/AST tree is empty
- * @version 4.0.6
+ * @version 4.0.8
  * @author Roy Revelt, Codsen Ltd
  * @license MIT
  * {@link https://codsen.com/os/ast-is-empty/}
  */
 
-"use strict";var astIsEmpty=(()=>{var i=Object.defineProperty;var l=Object.getOwnPropertyDescriptor;var p=Object.getOwnPropertyNames;var c=Object.prototype.hasOwnProperty;var m=(e,t)=>{for(var s in t)i(e,s,{get:t[s],enumerable:!0})},d=(e,t,s,r)=>{if(t&&typeof t=="object"||typeof t=="function")for(let n of p(t))!c.call(e,n)&&n!==s&&i(e,n,{get:()=>t[n],enumerable:!(r=l(t,n))||r.enumerable});return e};var f=e=>d(i({},"__esModule",{value:!0}),e);var b={};m(b,{isEmpty:()=>o,version:()=>y});function a(e){if(e==null||typeof e!="object")return!1;let t=Object.getPrototypeOf(e);return t!==null&&t!==Object.prototype&&Object.getPrototypeOf(t)!==null?!1:!(Symbol.iterator in e)&&!(Symbol.toStringTag in e)}var u="4.0.6";var y=u;function o(e){let t,s,r=!0;if(Array.isArray(e)){if(e.length===0)return!0;for(t=0,s=e.length;t<s;t++){if(r=o(e[t]),r===null)return null;if(!r)return!1}}else if(a(e)){if(Object.keys(e).length===0)return!0;for(t=0,s=Object.keys(e).length;t<s;t++){if(r=o(e[Object.keys(e)[t]]),r===null)return null;if(!r)return!1}}else if(typeof e=="string"){if(e.length!==0)return!1}else return null;return r}return f(b);})();
+"use strict";var astIsEmpty=(()=>{var i=Object.defineProperty;var l=Object.getOwnPropertyDescriptor;var c=Object.getOwnPropertyNames;var p=Object.prototype.hasOwnProperty;var m=(e,r)=>{for(var s in r)i(e,s,{get:r[s],enumerable:!0})},d=(e,r,s,t)=>{if(r&&typeof r=="object"||typeof r=="function")for(let n of c(r))!p.call(e,n)&&n!==s&&i(e,n,{get:()=>r[n],enumerable:!(t=l(r,n))||t.enumerable});return e};var f=e=>d(i({},"__esModule",{value:!0}),e);var y={};m(y,{isEmpty:()=>u,version:()=>h});function a(e){if(e==null||typeof e!="object")return!1;let r=Object.getPrototypeOf(e);return r!==null&&r!==Object.prototype&&Object.getPrototypeOf(r)!==null?!1:!(Symbol.iterator in e)&&!(Symbol.toStringTag in e)}var o="4.0.8";var h=o;function u(e){let r,s,t=!0;if(Array.isArray(e)){if(e.length===0)return!0;for(r=0,s=e.length;r<s;r++){if(t=u(e[r]),t===null)return null;if(!t)return!1}}else if(a(e)){if(Object.keys(e).length===0)return!0;for(r=0,s=Object.keys(e).length;r<s;r++){if(t=u(e[Object.keys(e)[r]]),t===null)return null;if(!t)return!1}}else if(typeof e=="string"){if(e.length!==0)return!1}else return null;return t}return f(y);})();
 /**
  * @name codsen-utils
  * @fileoverview Various utility functions
- * @version 1.2.0
+ * @version 1.3.1
  * @author Roy Revelt, Codsen Ltd
  * @license MIT
  * {@link https://codsen.com/os/codsen-utils/}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "ast-is-empty",
-  "version": "4.0.6",
+  "version": "4.0.8",
   "description": "Find out, is nested array/object/string/AST tree is empty",
   "keywords": [
     "array",
@@ -81,6 +81,6 @@
     }
   },
   "dependencies": {
-    "codsen-utils": "^1.2.0"
+    "codsen-utils": "^1.3.1"
   }
 }