solid-js 1.6.4 → 1.6.5

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.
Files changed (9) hide show
  1. package/dist/dev.cjs +1 -1
  2. package/dist/dev.js +1 -1
  3. package/dist/solid.cjs +1 -1
  4. package/dist/solid.js +1 -1
  5. package/package.json +1 -1
  6. package/store/dist/dev.cjs +5 -5
  7. package/store/dist/dev.js +5 -5
  8. package/store/dist/store.cjs +5 -5
  9. package/store/dist/store.js +5 -5
package/dist/dev.cjs CHANGED
@@ -1269,7 +1269,7 @@ function mergeProps(...sources) {
1269
1269
  let proxy = false;
1270
1270
  for (let i = 0; i < sources.length; i++) {
1271
1271
  const s = sources[i];
1272
- proxy ||= !!s && $PROXY in s;
1272
+ proxy = proxy || !!s && $PROXY in s;
1273
1273
  sources[i] = typeof s === "function" ? (proxy = true, createMemo(s)) : s;
1274
1274
  }
1275
1275
  if (proxy) {
package/dist/dev.js CHANGED
@@ -1265,7 +1265,7 @@ function mergeProps(...sources) {
1265
1265
  let proxy = false;
1266
1266
  for (let i = 0; i < sources.length; i++) {
1267
1267
  const s = sources[i];
1268
- proxy ||= !!s && $PROXY in s;
1268
+ proxy = proxy || !!s && $PROXY in s;
1269
1269
  sources[i] = typeof s === "function" ? (proxy = true, createMemo(s)) : s;
1270
1270
  }
1271
1271
  if (proxy) {
package/dist/solid.cjs CHANGED
@@ -1177,7 +1177,7 @@ function mergeProps(...sources) {
1177
1177
  let proxy = false;
1178
1178
  for (let i = 0; i < sources.length; i++) {
1179
1179
  const s = sources[i];
1180
- proxy ||= !!s && $PROXY in s;
1180
+ proxy = proxy || !!s && $PROXY in s;
1181
1181
  sources[i] = typeof s === "function" ? (proxy = true, createMemo(s)) : s;
1182
1182
  }
1183
1183
  if (proxy) {
package/dist/solid.js CHANGED
@@ -1173,7 +1173,7 @@ function mergeProps(...sources) {
1173
1173
  let proxy = false;
1174
1174
  for (let i = 0; i < sources.length; i++) {
1175
1175
  const s = sources[i];
1176
- proxy ||= !!s && $PROXY in s;
1176
+ proxy = proxy || !!s && $PROXY in s;
1177
1177
  sources[i] = typeof s === "function" ? (proxy = true, createMemo(s)) : s;
1178
1178
  }
1179
1179
  if (proxy) {
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.6.4",
4
+ "version": "1.6.5",
5
5
  "author": "Ryan Carniato",
6
6
  "license": "MIT",
7
7
  "homepage": "https://solidjs.com",
package/store/dist/dev.cjs CHANGED
@@ -331,14 +331,14 @@ function applyState(target, parent, property, merge, key) {
331
331
  return;
332
332
  }
333
333
  if (Array.isArray(target)) {
334
- if (target.length && previous.length && (!merge || key && target[0][key] != null)) {
334
+ if (target.length && previous.length && (!merge || key && target[0] && target[0][key] != null)) {
335
335
  let i, j, start, end, newEnd, item, newIndicesNext, keyVal;
336
- for (start = 0, end = Math.min(previous.length, target.length); start < end && (previous[start] === target[start] || key && previous[start][key] === target[start][key]); start++) {
336
+ for (start = 0, end = Math.min(previous.length, target.length); start < end && (previous[start] === target[start] || key && previous[start] && target[start] && previous[start][key] === target[start][key]); start++) {
337
337
  applyState(target[start], previous, start, merge, key);
338
338
  }
339
339
  const temp = new Array(target.length),
340
340
  newIndices = new Map();
341
- for (end = previous.length - 1, newEnd = target.length - 1; end >= start && newEnd >= start && (previous[end] === target[newEnd] || key && previous[end][key] === target[newEnd][key]); end--, newEnd--) {
341
+ for (end = previous.length - 1, newEnd = target.length - 1; end >= start && newEnd >= start && (previous[end] === target[newEnd] || key && previous[start] && target[start] && previous[end][key] === target[newEnd][key]); end--, newEnd--) {
342
342
  temp[newEnd] = previous[end];
343
343
  }
344
344
  if (start > newEnd || start > end) {
@@ -353,14 +353,14 @@ function applyState(target, parent, property, merge, key) {
353
353
  newIndicesNext = new Array(newEnd + 1);
354
354
  for (j = newEnd; j >= start; j--) {
355
355
  item = target[j];
356
- keyVal = key ? item[key] : item;
356
+ keyVal = key && item ? item[key] : item;
357
357
  i = newIndices.get(keyVal);
358
358
  newIndicesNext[j] = i === undefined ? -1 : i;
359
359
  newIndices.set(keyVal, j);
360
360
  }
361
361
  for (i = start; i <= end; i++) {
362
362
  item = previous[i];
363
- keyVal = key ? item[key] : item;
363
+ keyVal = key && item ? item[key] : item;
364
364
  j = newIndices.get(keyVal);
365
365
  if (j !== undefined && j !== -1) {
366
366
  temp[j] = previous[i];
package/store/dist/dev.js CHANGED
@@ -327,14 +327,14 @@ function applyState(target, parent, property, merge, key) {
327
327
  return;
328
328
  }
329
329
  if (Array.isArray(target)) {
330
- if (target.length && previous.length && (!merge || key && target[0][key] != null)) {
330
+ if (target.length && previous.length && (!merge || key && target[0] && target[0][key] != null)) {
331
331
  let i, j, start, end, newEnd, item, newIndicesNext, keyVal;
332
- for (start = 0, end = Math.min(previous.length, target.length); start < end && (previous[start] === target[start] || key && previous[start][key] === target[start][key]); start++) {
332
+ for (start = 0, end = Math.min(previous.length, target.length); start < end && (previous[start] === target[start] || key && previous[start] && target[start] && previous[start][key] === target[start][key]); start++) {
333
333
  applyState(target[start], previous, start, merge, key);
334
334
  }
335
335
  const temp = new Array(target.length),
336
336
  newIndices = new Map();
337
- for (end = previous.length - 1, newEnd = target.length - 1; end >= start && newEnd >= start && (previous[end] === target[newEnd] || key && previous[end][key] === target[newEnd][key]); end--, newEnd--) {
337
+ for (end = previous.length - 1, newEnd = target.length - 1; end >= start && newEnd >= start && (previous[end] === target[newEnd] || key && previous[start] && target[start] && previous[end][key] === target[newEnd][key]); end--, newEnd--) {
338
338
  temp[newEnd] = previous[end];
339
339
  }
340
340
  if (start > newEnd || start > end) {
@@ -349,14 +349,14 @@ function applyState(target, parent, property, merge, key) {
349
349
  newIndicesNext = new Array(newEnd + 1);
350
350
  for (j = newEnd; j >= start; j--) {
351
351
  item = target[j];
352
- keyVal = key ? item[key] : item;
352
+ keyVal = key && item ? item[key] : item;
353
353
  i = newIndices.get(keyVal);
354
354
  newIndicesNext[j] = i === undefined ? -1 : i;
355
355
  newIndices.set(keyVal, j);
356
356
  }
357
357
  for (i = start; i <= end; i++) {
358
358
  item = previous[i];
359
- keyVal = key ? item[key] : item;
359
+ keyVal = key && item ? item[key] : item;
360
360
  j = newIndices.get(keyVal);
361
361
  if (j !== undefined && j !== -1) {
362
362
  temp[j] = previous[i];
package/store/dist/store.cjs CHANGED
@@ -308,14 +308,14 @@ function applyState(target, parent, property, merge, key) {
308
308
  return;
309
309
  }
310
310
  if (Array.isArray(target)) {
311
- if (target.length && previous.length && (!merge || key && target[0][key] != null)) {
311
+ if (target.length && previous.length && (!merge || key && target[0] && target[0][key] != null)) {
312
312
  let i, j, start, end, newEnd, item, newIndicesNext, keyVal;
313
- for (start = 0, end = Math.min(previous.length, target.length); start < end && (previous[start] === target[start] || key && previous[start][key] === target[start][key]); start++) {
313
+ for (start = 0, end = Math.min(previous.length, target.length); start < end && (previous[start] === target[start] || key && previous[start] && target[start] && previous[start][key] === target[start][key]); start++) {
314
314
  applyState(target[start], previous, start, merge, key);
315
315
  }
316
316
  const temp = new Array(target.length),
317
317
  newIndices = new Map();
318
- for (end = previous.length - 1, newEnd = target.length - 1; end >= start && newEnd >= start && (previous[end] === target[newEnd] || key && previous[end][key] === target[newEnd][key]); end--, newEnd--) {
318
+ for (end = previous.length - 1, newEnd = target.length - 1; end >= start && newEnd >= start && (previous[end] === target[newEnd] || key && previous[start] && target[start] && previous[end][key] === target[newEnd][key]); end--, newEnd--) {
319
319
  temp[newEnd] = previous[end];
320
320
  }
321
321
  if (start > newEnd || start > end) {
@@ -330,14 +330,14 @@ function applyState(target, parent, property, merge, key) {
330
330
  newIndicesNext = new Array(newEnd + 1);
331
331
  for (j = newEnd; j >= start; j--) {
332
332
  item = target[j];
333
- keyVal = key ? item[key] : item;
333
+ keyVal = key && item ? item[key] : item;
334
334
  i = newIndices.get(keyVal);
335
335
  newIndicesNext[j] = i === undefined ? -1 : i;
336
336
  newIndices.set(keyVal, j);
337
337
  }
338
338
  for (i = start; i <= end; i++) {
339
339
  item = previous[i];
340
- keyVal = key ? item[key] : item;
340
+ keyVal = key && item ? item[key] : item;
341
341
  j = newIndices.get(keyVal);
342
342
  if (j !== undefined && j !== -1) {
343
343
  temp[j] = previous[i];
package/store/dist/store.js CHANGED
@@ -304,14 +304,14 @@ function applyState(target, parent, property, merge, key) {
304
304
  return;
305
305
  }
306
306
  if (Array.isArray(target)) {
307
- if (target.length && previous.length && (!merge || key && target[0][key] != null)) {
307
+ if (target.length && previous.length && (!merge || key && target[0] && target[0][key] != null)) {
308
308
  let i, j, start, end, newEnd, item, newIndicesNext, keyVal;
309
- for (start = 0, end = Math.min(previous.length, target.length); start < end && (previous[start] === target[start] || key && previous[start][key] === target[start][key]); start++) {
309
+ for (start = 0, end = Math.min(previous.length, target.length); start < end && (previous[start] === target[start] || key && previous[start] && target[start] && previous[start][key] === target[start][key]); start++) {
310
310
  applyState(target[start], previous, start, merge, key);
311
311
  }
312
312
  const temp = new Array(target.length),
313
313
  newIndices = new Map();
314
- for (end = previous.length - 1, newEnd = target.length - 1; end >= start && newEnd >= start && (previous[end] === target[newEnd] || key && previous[end][key] === target[newEnd][key]); end--, newEnd--) {
314
+ for (end = previous.length - 1, newEnd = target.length - 1; end >= start && newEnd >= start && (previous[end] === target[newEnd] || key && previous[start] && target[start] && previous[end][key] === target[newEnd][key]); end--, newEnd--) {
315
315
  temp[newEnd] = previous[end];
316
316
  }
317
317
  if (start > newEnd || start > end) {
@@ -326,14 +326,14 @@ function applyState(target, parent, property, merge, key) {
326
326
  newIndicesNext = new Array(newEnd + 1);
327
327
  for (j = newEnd; j >= start; j--) {
328
328
  item = target[j];
329
- keyVal = key ? item[key] : item;
329
+ keyVal = key && item ? item[key] : item;
330
330
  i = newIndices.get(keyVal);
331
331
  newIndicesNext[j] = i === undefined ? -1 : i;
332
332
  newIndices.set(keyVal, j);
333
333
  }
334
334
  for (i = start; i <= end; i++) {
335
335
  item = previous[i];
336
- keyVal = key ? item[key] : item;
336
+ keyVal = key && item ? item[key] : item;
337
337
  j = newIndices.get(keyVal);
338
338
  if (j !== undefined && j !== -1) {
339
339
  temp[j] = previous[i];