solid-js 1.3.6 → 1.3.7

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/package.json CHANGED
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "name": "solid-js",
3
3
  "description": "A declarative JavaScript library for building user interfaces.",
4
- "version": "1.3.6",
4
+ "version": "1.3.7",
5
5
  "author": "Ryan Carniato",
6
6
  "license": "MIT",
7
7
  "homepage": "https://solidjs.com",
@@ -144,5 +144,5 @@
144
144
  "compiler",
145
145
  "performance"
146
146
  ],
147
- "gitHead": "10183a0ee2de5c685e4d4558cbe1b78a6ca4c48e"
147
+ "gitHead": "9e72454dafafeca50b6151ae4932ccd3aa3851f3"
148
148
  }
@@ -147,12 +147,12 @@ function updatePath(current, path, traversed = []) {
147
147
  isArray = Array.isArray(current);
148
148
  if (Array.isArray(part)) {
149
149
  for (let i = 0; i < part.length; i++) {
150
- updatePath(current, [part[i]].concat(path), [part[i]].concat(traversed));
150
+ updatePath(current, [part[i]].concat(path), traversed);
151
151
  }
152
152
  return;
153
153
  } else if (isArray && partType === "function") {
154
154
  for (let i = 0; i < current.length; i++) {
155
- if (part(current[i], i)) updatePath(current, [i].concat(path), [i].concat(traversed));
155
+ if (part(current[i], i)) updatePath(current, [i].concat(path), traversed);
156
156
  }
157
157
  return;
158
158
  } else if (isArray && partType === "object") {
@@ -162,7 +162,7 @@ function updatePath(current, path, traversed = []) {
162
162
  by = 1
163
163
  } = part;
164
164
  for (let i = from; i <= to; i += by) {
165
- updatePath(current, [i].concat(path), [i].concat(traversed));
165
+ updatePath(current, [i].concat(path), traversed);
166
166
  }
167
167
  return;
168
168
  } else if (path.length > 1) {
package/store/dist/dev.js CHANGED
@@ -143,12 +143,12 @@ function updatePath(current, path, traversed = []) {
143
143
  isArray = Array.isArray(current);
144
144
  if (Array.isArray(part)) {
145
145
  for (let i = 0; i < part.length; i++) {
146
- updatePath(current, [part[i]].concat(path), [part[i]].concat(traversed));
146
+ updatePath(current, [part[i]].concat(path), traversed);
147
147
  }
148
148
  return;
149
149
  } else if (isArray && partType === "function") {
150
150
  for (let i = 0; i < current.length; i++) {
151
- if (part(current[i], i)) updatePath(current, [i].concat(path), [i].concat(traversed));
151
+ if (part(current[i], i)) updatePath(current, [i].concat(path), traversed);
152
152
  }
153
153
  return;
154
154
  } else if (isArray && partType === "object") {
@@ -158,7 +158,7 @@ function updatePath(current, path, traversed = []) {
158
158
  by = 1
159
159
  } = part;
160
160
  for (let i = from; i <= to; i += by) {
161
- updatePath(current, [i].concat(path), [i].concat(traversed));
161
+ updatePath(current, [i].concat(path), traversed);
162
162
  }
163
163
  return;
164
164
  } else if (path.length > 1) {
@@ -31,12 +31,12 @@ function updatePath(current, path, traversed = []) {
31
31
  isArray = Array.isArray(current);
32
32
  if (Array.isArray(part)) {
33
33
  for (let i = 0; i < part.length; i++) {
34
- updatePath(current, [part[i]].concat(path), [part[i]].concat(traversed));
34
+ updatePath(current, [part[i]].concat(path), traversed);
35
35
  }
36
36
  return;
37
37
  } else if (isArray && partType === "function") {
38
38
  for (let i = 0; i < current.length; i++) {
39
- if (part(current[i], i)) updatePath(current, [i].concat(path), [i].concat(traversed));
39
+ if (part(current[i], i)) updatePath(current, [i].concat(path), traversed);
40
40
  }
41
41
  return;
42
42
  } else if (isArray && partType === "object") {
@@ -46,7 +46,7 @@ function updatePath(current, path, traversed = []) {
46
46
  by = 1
47
47
  } = part;
48
48
  for (let i = from; i <= to; i += by) {
49
- updatePath(current, [i].concat(path), [i].concat(traversed));
49
+ updatePath(current, [i].concat(path), traversed);
50
50
  }
51
51
  return;
52
52
  } else if (path.length > 1) {
@@ -27,12 +27,12 @@ function updatePath(current, path, traversed = []) {
27
27
  isArray = Array.isArray(current);
28
28
  if (Array.isArray(part)) {
29
29
  for (let i = 0; i < part.length; i++) {
30
- updatePath(current, [part[i]].concat(path), [part[i]].concat(traversed));
30
+ updatePath(current, [part[i]].concat(path), traversed);
31
31
  }
32
32
  return;
33
33
  } else if (isArray && partType === "function") {
34
34
  for (let i = 0; i < current.length; i++) {
35
- if (part(current[i], i)) updatePath(current, [i].concat(path), [i].concat(traversed));
35
+ if (part(current[i], i)) updatePath(current, [i].concat(path), traversed);
36
36
  }
37
37
  return;
38
38
  } else if (isArray && partType === "object") {
@@ -42,7 +42,7 @@ function updatePath(current, path, traversed = []) {
42
42
  by = 1
43
43
  } = part;
44
44
  for (let i = from; i <= to; i += by) {
45
- updatePath(current, [i].concat(path), [i].concat(traversed));
45
+ updatePath(current, [i].concat(path), traversed);
46
46
  }
47
47
  return;
48
48
  } else if (path.length > 1) {
@@ -142,12 +142,12 @@ function updatePath(current, path, traversed = []) {
142
142
  isArray = Array.isArray(current);
143
143
  if (Array.isArray(part)) {
144
144
  for (let i = 0; i < part.length; i++) {
145
- updatePath(current, [part[i]].concat(path), [part[i]].concat(traversed));
145
+ updatePath(current, [part[i]].concat(path), traversed);
146
146
  }
147
147
  return;
148
148
  } else if (isArray && partType === "function") {
149
149
  for (let i = 0; i < current.length; i++) {
150
- if (part(current[i], i)) updatePath(current, [i].concat(path), [i].concat(traversed));
150
+ if (part(current[i], i)) updatePath(current, [i].concat(path), traversed);
151
151
  }
152
152
  return;
153
153
  } else if (isArray && partType === "object") {
@@ -157,7 +157,7 @@ function updatePath(current, path, traversed = []) {
157
157
  by = 1
158
158
  } = part;
159
159
  for (let i = from; i <= to; i += by) {
160
- updatePath(current, [i].concat(path), [i].concat(traversed));
160
+ updatePath(current, [i].concat(path), traversed);
161
161
  }
162
162
  return;
163
163
  } else if (path.length > 1) {
@@ -138,12 +138,12 @@ function updatePath(current, path, traversed = []) {
138
138
  isArray = Array.isArray(current);
139
139
  if (Array.isArray(part)) {
140
140
  for (let i = 0; i < part.length; i++) {
141
- updatePath(current, [part[i]].concat(path), [part[i]].concat(traversed));
141
+ updatePath(current, [part[i]].concat(path), traversed);
142
142
  }
143
143
  return;
144
144
  } else if (isArray && partType === "function") {
145
145
  for (let i = 0; i < current.length; i++) {
146
- if (part(current[i], i)) updatePath(current, [i].concat(path), [i].concat(traversed));
146
+ if (part(current[i], i)) updatePath(current, [i].concat(path), traversed);
147
147
  }
148
148
  return;
149
149
  } else if (isArray && partType === "object") {
@@ -153,7 +153,7 @@ function updatePath(current, path, traversed = []) {
153
153
  by = 1
154
154
  } = part;
155
155
  for (let i = from; i <= to; i += by) {
156
- updatePath(current, [i].concat(path), [i].concat(traversed));
156
+ updatePath(current, [i].concat(path), traversed);
157
157
  }
158
158
  return;
159
159
  } else if (path.length > 1) {
package/web/dist/dev.cjs CHANGED
@@ -392,7 +392,8 @@ function insertExpression(parent, value, current, marker, unwrapArray) {
392
392
  return current;
393
393
  }
394
394
  if (array.length === 0) {
395
- cleanChildren(parent, current, marker);
395
+ current = cleanChildren(parent, current, marker);
396
+ if (multi) return current;
396
397
  } else if (Array.isArray(current)) {
397
398
  if (current.length === 0) {
398
399
  appendNodes(parent, array, marker);
package/web/dist/dev.js CHANGED
@@ -389,7 +389,8 @@ function insertExpression(parent, value, current, marker, unwrapArray) {
389
389
  return current;
390
390
  }
391
391
  if (array.length === 0) {
392
- cleanChildren(parent, current, marker);
392
+ current = cleanChildren(parent, current, marker);
393
+ if (multi) return current;
393
394
  } else if (Array.isArray(current)) {
394
395
  if (current.length === 0) {
395
396
  appendNodes(parent, array, marker);
package/web/dist/web.cjs CHANGED
@@ -391,7 +391,8 @@ function insertExpression(parent, value, current, marker, unwrapArray) {
391
391
  return current;
392
392
  }
393
393
  if (array.length === 0) {
394
- cleanChildren(parent, current, marker);
394
+ current = cleanChildren(parent, current, marker);
395
+ if (multi) return current;
395
396
  } else if (Array.isArray(current)) {
396
397
  if (current.length === 0) {
397
398
  appendNodes(parent, array, marker);
package/web/dist/web.js CHANGED
@@ -388,7 +388,8 @@ function insertExpression(parent, value, current, marker, unwrapArray) {
388
388
  return current;
389
389
  }
390
390
  if (array.length === 0) {
391
- cleanChildren(parent, current, marker);
391
+ current = cleanChildren(parent, current, marker);
392
+ if (multi) return current;
392
393
  } else if (Array.isArray(current)) {
393
394
  if (current.length === 0) {
394
395
  appendNodes(parent, array, marker);