@projectwallace/css-layer-tree 1.0.0 → 1.0.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/README.md CHANGED
@@ -11,7 +11,7 @@ npm install @projectwallace/css-layer-tree
11
11
  ## Usage
12
12
 
13
13
  ```js
14
- import { get_tree } from '@projectwallace/css-layer-tree'
14
+ import { layer_tree } from '@projectwallace/css-layer-tree'
15
15
 
16
16
  let css = `
17
17
  @import url("test.css") layer;
@@ -25,7 +25,7 @@ let css = `
25
25
  @layer {}
26
26
  `
27
27
 
28
- let tree = get_tree(css)
28
+ let tree = layer_tree(css)
29
29
  ```
30
30
 
31
31
  This example would result in this `tree`:
@@ -11,14 +11,14 @@ class f {
11
11
  * @param {T} location
12
12
  */
13
13
  add_child(e, l, p) {
14
- let n = this;
14
+ let i = this;
15
15
  if (e.forEach((t) => {
16
- n = n.children.get(t);
17
- }), n.children.has(l))
18
- n.children.get(l).locations.push(p);
16
+ i = i.children.get(t);
17
+ }), i.children.has(l))
18
+ i.children.get(l).locations.push(p);
19
19
  else {
20
20
  const t = new f(l);
21
- t.locations.push(p), n.children.set(l, t);
21
+ t.locations.push(p), i.children.set(l, t);
22
22
  }
23
23
  }
24
24
  /**
@@ -39,8 +39,8 @@ class f {
39
39
  };
40
40
  }
41
41
  }
42
- function d(i) {
43
- let e = i.loc;
42
+ function d(a) {
43
+ let e = a.loc;
44
44
  if (e)
45
45
  return {
46
46
  line: e.start.line,
@@ -49,51 +49,49 @@ function d(i) {
49
49
  end: e.end.offset
50
50
  };
51
51
  }
52
- function _(i) {
53
- return i.name.toLowerCase() === "layer";
52
+ function _(a) {
53
+ return a.name.toLowerCase() === "layer";
54
54
  }
55
- function c(i) {
56
- return u.generate(i).split(".").map((e) => e.trim());
55
+ function c(a) {
56
+ return u.generate(a).split(".").map((e) => e.trim());
57
57
  }
58
- function h(i) {
58
+ function h(a) {
59
59
  let e = [], l = new f("root"), p = 0;
60
- function n() {
60
+ function i() {
61
61
  return p++, `__anonymous-${p}__`;
62
62
  }
63
- return u.walk(i, {
63
+ return u.walk(a, {
64
64
  visit: "Atrule",
65
65
  enter(t) {
66
66
  if (_(t)) {
67
- let s = d(t);
67
+ let n = d(t);
68
68
  if (t.prelude === null) {
69
- let r = n();
70
- l.add_child(e, r, s), e.push(r);
69
+ let r = i();
70
+ l.add_child(e, r, n), e.push(r);
71
71
  } else if (t.prelude.type === "AtrulePrelude")
72
72
  if (t.block === null) {
73
- let r = u.findAll(t.prelude, (o) => o.type === "Layer").map((o) => o.name);
74
- for (let o of r)
75
- l.add_child(e, o, s);
73
+ let r = u.findAll(t.prelude, (s) => s.type === "Layer").map((s) => s.name);
74
+ for (let s of r)
75
+ l.add_child(e, s, n);
76
76
  } else
77
77
  for (let r of c(t.prelude))
78
- l.add_child(e, r, s), e.push(r);
78
+ l.add_child(e, r, n), e.push(r);
79
79
  } else if (t.name.toLowerCase() === "import" && t.prelude !== null && t.prelude.type === "AtrulePrelude") {
80
- let s = d(t), r = t.prelude, o = u.find(r, (a) => a.type === "Layer");
81
- if (o) {
82
- for (let a of c(o))
83
- l.add_child(e, a, s), e.push(a);
80
+ let n = d(t), r = t.prelude, s = u.find(r, (o) => o.type === "Layer");
81
+ if (s) {
82
+ for (let o of c(s))
83
+ l.add_child(e, o, n), e.push(o);
84
84
  return this.skip;
85
85
  }
86
- if (u.find(r, (a) => a.type === "Function" && a.name.toLowerCase() === "layer"))
87
- return l.add_child([], n(), s), this.skip;
88
- if (u.find(r, (a) => a.type === "Identifier" && a.name.toLowerCase() === "layer"))
89
- return l.add_child([], n(), s), this.skip;
86
+ if (u.find(r, (o) => o.type === "Identifier" && o.name.toLowerCase() === "layer"))
87
+ return l.add_child([], i(), n), this.skip;
90
88
  }
91
89
  },
92
90
  leave(t) {
93
91
  if (_(t))
94
92
  if (t.prelude !== null && t.prelude.type === "AtrulePrelude") {
95
- let s = c(t.prelude);
96
- for (let r = 0; r < s.length; r++)
93
+ let n = c(t.prelude);
94
+ for (let r = 0; r < n.length; r++)
97
95
  e.pop();
98
96
  } else
99
97
  e.pop();
@@ -101,8 +99,8 @@ function h(i) {
101
99
  }
102
100
  }), l.to_plain_object().children;
103
101
  }
104
- function w(i) {
105
- let e = u.parse(i, {
102
+ function m(a) {
103
+ let e = u.parse(a, {
106
104
  positions: !0,
107
105
  parseAtrulePrelude: !0,
108
106
  parseValue: !1,
@@ -112,6 +110,6 @@ function w(i) {
112
110
  return h(e);
113
111
  }
114
112
  export {
115
- w as layer_tree,
113
+ m as layer_tree,
116
114
  h as layer_tree_from_ast
117
115
  };
@@ -1 +1 @@
1
- (function(o,p){typeof exports=="object"&&typeof module<"u"?p(exports,require("css-tree")):typeof define=="function"&&define.amd?define(["exports","css-tree"],p):(o=typeof globalThis<"u"?globalThis:o||self,p(o.cssLayerTree={},o.csstree))})(this,function(o,p){"use strict";function g(l){const e=Object.create(null,{[Symbol.toStringTag]:{value:"Module"}});if(l){for(const r in l)if(r!=="default"){const u=Object.getOwnPropertyDescriptor(l,r);Object.defineProperty(e,r,u.get?u:{enumerable:!0,get:()=>l[r]})}}return e.default=l,Object.freeze(e)}const f=g(p);class d{constructor(e){this.name=e,this.children=new Map,this.locations=[]}add_child(e,r,u){let a=this;if(e.forEach(t=>{a=a.children.get(t)}),a.children.has(r))a.children.get(r).locations.push(u);else{const t=new d(r);t.locations.push(u),a.children.set(r,t)}}to_plain_object(){return{name:this.name,locations:this.locations,children:Array.from(this.children.values(),e=>e.to_plain_object())}}}function y(l){let e=l.loc;if(e)return{line:e.start.line,column:e.start.column,start:e.start.offset,end:e.end.offset}}function h(l){return l.name.toLowerCase()==="layer"}function _(l){return f.generate(l).split(".").map(e=>e.trim())}function m(l){let e=[],r=new d("root"),u=0;function a(){return u++,`__anonymous-${u}__`}return f.walk(l,{visit:"Atrule",enter(t){if(h(t)){let s=y(t);if(t.prelude===null){let n=a();r.add_child(e,n,s),e.push(n)}else if(t.prelude.type==="AtrulePrelude")if(t.block===null){let n=f.findAll(t.prelude,c=>c.type==="Layer").map(c=>c.name);for(let c of n)r.add_child(e,c,s)}else for(let n of _(t.prelude))r.add_child(e,n,s),e.push(n)}else if(t.name.toLowerCase()==="import"&&t.prelude!==null&&t.prelude.type==="AtrulePrelude"){let s=y(t),n=t.prelude,c=f.find(n,i=>i.type==="Layer");if(c){for(let i of _(c))r.add_child(e,i,s),e.push(i);return this.skip}if(f.find(n,i=>i.type==="Function"&&i.name.toLowerCase()==="layer"))return r.add_child([],a(),s),this.skip;if(f.find(n,i=>i.type==="Identifier"&&i.name.toLowerCase()==="layer"))return r.add_child([],a(),s),this.skip}},leave(t){if(h(t))if(t.prelude!==null&&t.prelude.type==="AtrulePrelude"){let s=_(t.prelude);for(let n=0;n<s.length;n++)e.pop()}else e.pop();else t.name.toLowerCase()==="import"&&(e.length=0)}}),r.to_plain_object().children}function w(l){let e=f.parse(l,{positions:!0,parseAtrulePrelude:!0,parseValue:!1,parseRulePrelude:!1,parseCustomProperty:!1});return m(e)}o.layer_tree=w,o.layer_tree_from_ast=m,Object.defineProperty(o,Symbol.toStringTag,{value:"Module"})});
1
+ (function(i,p){typeof exports=="object"&&typeof module<"u"?p(exports,require("css-tree")):typeof define=="function"&&define.amd?define(["exports","css-tree"],p):(i=typeof globalThis<"u"?globalThis:i||self,p(i.cssLayerTree={},i.csstree))})(this,function(i,p){"use strict";function g(l){const e=Object.create(null,{[Symbol.toStringTag]:{value:"Module"}});if(l){for(const r in l)if(r!=="default"){const a=Object.getOwnPropertyDescriptor(l,r);Object.defineProperty(e,r,a.get?a:{enumerable:!0,get:()=>l[r]})}}return e.default=l,Object.freeze(e)}const f=g(p);class d{constructor(e){this.name=e,this.children=new Map,this.locations=[]}add_child(e,r,a){let s=this;if(e.forEach(t=>{s=s.children.get(t)}),s.children.has(r))s.children.get(r).locations.push(a);else{const t=new d(r);t.locations.push(a),s.children.set(r,t)}}to_plain_object(){return{name:this.name,locations:this.locations,children:Array.from(this.children.values(),e=>e.to_plain_object())}}}function y(l){let e=l.loc;if(e)return{line:e.start.line,column:e.start.column,start:e.start.offset,end:e.end.offset}}function h(l){return l.name.toLowerCase()==="layer"}function _(l){return f.generate(l).split(".").map(e=>e.trim())}function m(l){let e=[],r=new d("root"),a=0;function s(){return a++,`__anonymous-${a}__`}return f.walk(l,{visit:"Atrule",enter(t){if(h(t)){let o=y(t);if(t.prelude===null){let n=s();r.add_child(e,n,o),e.push(n)}else if(t.prelude.type==="AtrulePrelude")if(t.block===null){let n=f.findAll(t.prelude,u=>u.type==="Layer").map(u=>u.name);for(let u of n)r.add_child(e,u,o)}else for(let n of _(t.prelude))r.add_child(e,n,o),e.push(n)}else if(t.name.toLowerCase()==="import"&&t.prelude!==null&&t.prelude.type==="AtrulePrelude"){let o=y(t),n=t.prelude,u=f.find(n,c=>c.type==="Layer");if(u){for(let c of _(u))r.add_child(e,c,o),e.push(c);return this.skip}if(f.find(n,c=>c.type==="Identifier"&&c.name.toLowerCase()==="layer"))return r.add_child([],s(),o),this.skip}},leave(t){if(h(t))if(t.prelude!==null&&t.prelude.type==="AtrulePrelude"){let o=_(t.prelude);for(let n=0;n<o.length;n++)e.pop()}else e.pop();else t.name.toLowerCase()==="import"&&(e.length=0)}}),r.to_plain_object().children}function b(l){let e=f.parse(l,{positions:!0,parseAtrulePrelude:!0,parseValue:!1,parseRulePrelude:!1,parseCustomProperty:!1});return m(e)}i.layer_tree=b,i.layer_tree_from_ast=m,Object.defineProperty(i,Symbol.toStringTag,{value:"Module"})});
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@projectwallace/css-layer-tree",
3
- "version": "1.0.0",
3
+ "version": "1.0.1",
4
4
  "description": "Discover the composition of your CSS @layers",
5
5
  "repository": {
6
6
  "type": "git",