@projectwallace/format-css 2.0.0-alpha.1 → 2.0.1

package/dist/format-css.js

@@ -1,10 +1,10 @@
 import h from "css-tree/parser";
-const o = " ", i = "", N = ":", x = ";", L = '"', I = "(", g = ")", d = "[", ee = "]", H = "{", V = "}", te = "{}", W = ",", Z = "Atrule", z = "Rule", F = "Block", G = "SelectorList", Y = "Selector", B = "Declaration", $ = "Operator";
-function b(_) {
-  return /[A-Z]/.test(_) ? _.toLowerCase() : _;
+const o = " ", c = "", N = ":", $ = ";", L = '"', x = "(", g = ")", d = "[", ee = "]", H = "{", V = "}", te = "{}", W = ",", Z = "Atrule", z = "Rule", F = "Block", G = "SelectorList", I = "Selector", Y = "Declaration", B = "Operator";
+function C(y) {
+  return /[A-Z]/.test(y) ? y.toLowerCase() : y;
 }
-function re(_, { minify: P = !1 } = {}) {
-  let O = [], v = h(_, {
+function re(y, { minify: P = !1 } = {}) {
+  let O = [], v = h(y, {
     positions: !0,
     parseAtrulePrelude: !1,
     parseCustomProperty: !0,
@@ -13,55 +13,55 @@ function re(_, { minify: P = !1 } = {}) {
       O.push(e.start.offset, e.end.offset);
     }
   });
-  const u = P ? i : `
-`, C = P ? i : o, Q = P ? i : x;
-  let a = 0;
-  function s(n) {
-    return P ? i : "	".repeat(n);
+  const u = P ? c : `
+`, p = P ? c : o, Q = P ? c : $;
+  let s = 0;
+  function a(n) {
+    return P ? c : "	".repeat(n);
   }
   function A(n) {
     let e = n.loc;
-    return e ? _.slice(e.start.offset, e.end.offset) : i;
+    return e ? y.slice(e.start.offset, e.end.offset) : c;
   }
-  function y(n) {
+  function b(n) {
     return /** @type {import('css-tree').CssLocation} */ n.loc.start.offset;
   }
-  function c(n) {
+  function E(n) {
     return /** @type {import('css-tree').CssLocation} */ n.loc.end.offset;
   }
-  function E(n, e) {
+  function m(n, e) {
     if (P || n === void 0 || e === void 0)
-      return i;
+      return c;
     let t = "";
     for (let r = 0; r < O.length; r += 2) {
       let l = O[r];
       if (l === void 0 || l < n) continue;
       let f = O[r + 1];
       if (f === void 0 || f > e) break;
-      t.length > 0 && (t += u + s(a)), t += _.slice(l, f);
+      t.length > 0 && (t += u + a(s)), t += y.slice(l, f);
     }
     return t;
   }
   function w(n) {
     let e, t = n.prelude, r = n.block;
     t.type === G && (e = j(t));
-    let l = E(c(t), y(r));
-    return l && (e += u + s(a) + l), r.type === F && (e += M(r)), e;
+    let l = m(E(t), b(r));
+    return l && (e += u + a(s) + l), r.type === F && (e += M(r)), e;
   }
   function j(n) {
-    let e = i;
+    let e = c;
     return n.children.forEach((t, r) => {
-      t.type === Y && (e += s(a) + S(t)), r.next !== null && (e += W + u);
-      let l = r.next !== null ? y(r.next.data) : c(n), f = E(c(t), l);
-      f && (e += s(a) + f + u);
+      t.type === I && (e += a(s) + S(t)), r.next !== null && (e += W + u);
+      let l = r.next !== null ? b(r.next.data) : E(n), f = m(E(t), l);
+      f && (e += a(s) + f + u);
     }), e;
   }
   function S(n) {
-    let e = i;
+    let e = c;
     return (n.children || []).forEach((r) => {
       switch (r.type) {
         case "TypeSelector": {
-          e += b(r.name);
+          e += C(r.name);
           break;
         }
         case "Combinator": {
@@ -71,13 +71,13 @@ function re(_, { minify: P = !1 } = {}) {
         case "PseudoClassSelector":
         case "PseudoElementSelector": {
           e += N;
-          let l = b(r.name);
-          (l === "before" || l === "after" || r.type === "PseudoElementSelector") && (e += N), e += l, r.children && (e += I + S(r) + g);
+          let l = C(r.name);
+          (l === "before" || l === "after" || r.type === "PseudoElementSelector") && (e += N), e += l, r.children && (e += x + S(r) + g);
           break;
         }
         case G: {
           r.children.forEach((l, f) => {
-            l.type === Y && (e += S(l)), f.next && f.next.data.type === Y && (e += W + C);
+            l.type === I && (e += S(l)), f.next && f.next.data.type === I && (e += W + p);
           });
           break;
         }
@@ -85,8 +85,8 @@ function re(_, { minify: P = !1 } = {}) {
           let l = r.nth;
           if (l)
             if (l.type === "AnPlusB") {
-              let f = l.a, p = l.b;
-              f !== null && (e += f + "n"), f !== null && p !== null && (e += o), p !== null && (f !== null && !p.startsWith("-") && (e += "+" + o), e += p);
+              let f = l.a, i = l.b;
+              f !== null && (e += f + "n"), f !== null && i !== null && (e += o), i !== null && (f !== null && !i.startsWith("-") && (e += "+" + o), e += i);
             } else
               e += A(l);
           r.selector !== null && (e += o + "of" + o + S(r.selector));
@@ -104,80 +104,83 @@ function re(_, { minify: P = !1 } = {}) {
     }), e;
   }
   function M(n) {
-    let e = n.children, t = C;
+    let e = n.children, t = p;
     if (e.isEmpty) {
-      let f = E(y(n), c(n));
-      return f ? (t += H + u, t += s(a + 1) + f, t += u + s(a) + V, t) : t + te;
+      let f = m(b(n), E(n));
+      return f ? (t += H + u, t += a(s + 1) + f, t += u + a(s) + V, t) : t + te;
     }
-    t += H + u, a++;
-    let r = E(y(n), y(
+    t += H + u, s++;
+    let r = m(b(n), b(
       /** @type {import('css-tree').CssNode} */
       e.first
     ));
-    r && (t += s(a) + r + u), e.forEach((f, p) => {
-      if (p.prev !== null) {
-        let D = E(c(p.prev.data), y(f));
-        D && (t += s(a) + D + u);
+    r && (t += a(s) + r + u), e.forEach((f, i) => {
+      if (i.prev !== null) {
+        let D = m(E(i.prev.data), b(f));
+        D && (t += a(s) + D + u);
       }
-      f.type === B ? (t += J(f), p.next === null ? t += Q : t += x) : (p.prev !== null && p.prev.data.type === B && (t += u), f.type === z ? t += w(f) : f.type === Z ? t += K(f) : t += k(f, a)), p.next !== null && (t += u, f.type !== B && (t += u));
+      f.type === Y ? (t += J(f), i.next === null ? t += Q : t += $) : (i.prev !== null && i.prev.data.type === Y && (t += u), f.type === z ? t += w(f) : f.type === Z ? t += K(f) : t += k(f, s)), i.next !== null && (t += u, f.type !== Y && (t += u));
     });
-    let l = E(c(
+    let l = m(E(
       /** @type {import('css-tree').CssNode} */
       e.last
-    ), c(n));
-    return l && (t += u + s(a) + l), a--, t += u + s(a) + V, t;
+    ), E(n));
+    return l && (t += u + a(s) + l), s--, t += u + a(s) + V, t;
   }
   function K(n) {
-    let e = s(a) + "@", t = n.prelude, r = n.block;
-    return e += b(n.name), t !== null && (e += o + q(t)), r === null ? e += x : r.type === F && (e += M(r)), e;
+    let e = a(s) + "@", t = n.prelude, r = n.block;
+    return e += C(n.name), t !== null && (e += o + q(t)), r === null ? e += $ : r.type === F && (e += M(r)), e;
   }
   function q(n) {
     let e = A(n);
-    return e.replace(/\s*([:,])/g, e.toLowerCase().includes("selector(") ? "$1" : "$1 ").replace(/\s*(=>|<=)\s*/g, " $1 ").replace(/\)([a-zA-Z])/g, ") $1").replace(new RegExp("(?<!<=)(?<!=>)(?<!<= )([<>])(?![<= ])(?![=> ])(?![ =>])", "g"), " $1 ").replace(/calc\(([^*]*)\*([^*])/g, "calc($1 * $2").replace(/\s+/g, o).replace(/selector|url|supports|layer\(/ig, (t) => b(t));
+    return e.replace(/\s*([:,])/g, e.toLowerCase().includes("selector(") ? "$1" : "$1 ").replace(/\)([a-zA-Z])/g, ") $1").replace(/\s*(=>|<=)\s*/g, " $1 ").replace(/([^<>=\s])([<>])([^<>=\s])/g, `$1${p}$2${p}$3`).replace(/\s+/g, p).replace(/calc\(\s*([^()+\-*/]+)\s*([*/+-])\s*([^()+\-*/]+)\s*\)/g, (t, r, l, f) => {
+      let i = l === "+" || l === "-" ? o : p;
+      return `calc(${r.trim()}${i}${l}${i}${f.trim()})`;
+    }).replace(/selector|url|supports|layer\(/ig, (t) => C(t));
   }
   function J(n) {
     let e = n.property;
-    e.charCodeAt(0) === 45 && e.charCodeAt(1) === 45 || (e = b(e));
+    e.charCodeAt(0) === 45 && e.charCodeAt(1) === 45 || (e = C(e));
     let t = U(n.value);
-    return e === "font" && (t = t.replace(/\s*\/\s*/, "/")), t === i && P && (t += o), n.important === !0 ? t += C + "!important" : typeof n.important == "string" && (t += C + "!" + b(n.important)), s(a) + e + N + C + t;
+    return e === "font" && (t = t.replace(/\s*\/\s*/, "/")), t === c && P && (t += o), n.important === !0 ? t += p + "!important" : typeof n.important == "string" && (t += p + "!" + C(n.important)), a(s) + e + N + p + t;
   }
   function R(n) {
-    let e = i;
+    let e = c;
     return n.forEach((t, r) => {
-      t.type === "Identifier" ? e += t.name : t.type === "Function" ? e += b(t.name) + I + R(t.children) + g : t.type === "Dimension" ? e += t.value + b(t.unit) : t.type === "Value" ? e += U(t) : t.type === $ ? e += X(t) : t.type === "Parentheses" ? e += I + R(t.children) + g : t.type === "Url" ? e += "url(" + L + t.value + L + g : e += A(t), t.type !== $ && r.next !== null && r.next.data.type !== $ && (e += o);
+      t.type === "Identifier" ? e += t.name : t.type === "Function" ? e += C(t.name) + x + R(t.children) + g : t.type === "Dimension" ? e += t.value + C(t.unit) : t.type === "Value" ? e += U(t) : t.type === B ? e += X(t) : t.type === "Parentheses" ? e += x + R(t.children) + g : t.type === "Url" ? e += "url(" + L + t.value + L + g : e += A(t), t.type !== B && r.next !== null && r.next.data.type !== B && (e += o);
     }), e;
   }
   function X(n) {
-    let e = i, t = n.value.trim(), r = t.charCodeAt(0);
-    return r === 43 || r === 45 ? e += o : r !== 44 && (e += C), e += t, r === 43 || r === 45 ? e += o : e += C, e;
+    let e = c, t = n.value.trim(), r = t.charCodeAt(0);
+    return r === 43 || r === 45 ? e += o : r !== 44 && (e += p), e += t, r === 43 || r === 45 ? e += o : e += p, e;
   }
   function U(n) {
     return n.type === "Raw" ? k(n, 0) : R(n.children);
   }
   function k(n, e) {
-    return s(e) + A(n).trim();
+    return a(e) + A(n).trim();
   }
-  let T = v.children, m = i;
+  let T = v.children, _ = c;
   if (T.first) {
-    let n = E(0, y(T.first));
-    n && (m += n + u), T.forEach((t, r) => {
-      if (t.type === z ? m += w(t) : t.type === Z ? m += K(t) : m += k(t, a), r.next !== null) {
-        m += u;
-        let l = E(c(t), y(r.next.data));
-        l && (m += s(a) + l), m += u;
+    let n = m(0, b(T.first));
+    n && (_ += n + u), T.forEach((t, r) => {
+      if (t.type === z ? _ += w(t) : t.type === Z ? _ += K(t) : _ += k(t, s), r.next !== null) {
+        _ += u;
+        let l = m(E(t), b(r.next.data));
+        l && (_ += a(s) + l), _ += u;
       }
     });
-    let e = E(c(
+    let e = m(E(
       /** @type {import('css-tree').CssNode} */
       T.last
-    ), c(v));
-    e && (m += u + e);
+    ), E(v));
+    e && (_ += u + e);
   } else
-    m += E(0, c(v));
-  return m;
+    _ += m(0, E(v));
+  return _;
 }
-function le(_) {
-  return re(_, { minify: !0 });
+function le(y) {
+  return re(y, { minify: !0 });
 }
 export {
   re as format,

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@projectwallace/format-css",
-  "version": "2.0.0-alpha.1",
-  "description": "Fast, small, zero-config library to format CSS with basic rules.",
+  "version": "2.0.1",
+  "description": "Fast, small, zero-config library to format or minify CSS with basic rules.",
   "repository": {
     "type": "git",
     "url": "git+https://github.com/projectwallace/format-css.git"
@@ -26,16 +26,14 @@
     "prettier": "prettier --check index.js test/**/*.js"
   },
   "devDependencies": {
-    "@codecov/vite-plugin": "^1.4.0",
-    "@codspeed/tinybench-plugin": "^3.1.1",
-    "@types/css-tree": "^2.3.9",
-    "c8": "^10.1.2",
-    "prettier": "^3.3.3",
-    "tinybench": "^2.8.0",
-    "typescript": "^5.6.3",
+    "@codecov/vite-plugin": "^1.9.0",
+    "@types/css-tree": "^2.3.10",
+    "c8": "^10.1.3",
+    "prettier": "^3.5.3",
+    "typescript": "^5.8.3",
     "uvu": "^0.5.6",
-    "vite": "^5.4.11",
-    "vite-plugin-dts": "^4.3.0"
+    "vite": "^6.2.6",
+    "vite-plugin-dts": "^4.5.3"
   },
   "dependencies": {
     "css-tree": "^3.0.1"