pessimism
Advanced tools
Comparing version 1.1.1 to 1.1.2
@@ -272,24 +272,24 @@ function __(e, r) { | ||
function clearOptimistic(e, r) { | ||
for (var t = copyIndex(e, e[2]), i = 31; i >= 0; --i) { | ||
var a = 1 << i; | ||
if (0 != (a & t[0])) { | ||
var n = indexBit(t[0], a), c = clearOptimisticNode(t[1][n], r); | ||
switch (0 | c.tag) { | ||
for (var t = copyIndex(e, e[2]), i = t[0], a = 31; a >= 0; --a) { | ||
var n = 1 << a; | ||
if (0 != (n & t[0])) { | ||
var c = indexBit(t[0], n), o = clearOptimisticNode(t[1][c], r); | ||
switch (0 | o.tag) { | ||
case 0: | ||
var o = c[0], u = clearOptimistic(o, r); | ||
0 === u[0] ? (o[1].splice(n, 1), o[0] = o[0] ^ a) : o[1][n] = __(0, [ u ]); | ||
var u = o[0], v = clearOptimistic(u, r); | ||
0 === v[0] ? (u[1].splice(c, 1), u[0] = u[0] ^ n) : u[1][c] = __(0, [ v ]); | ||
break; | ||
case 4: | ||
t[1].splice(n, 1), t[0] = t[0] ^ a; | ||
t[1].splice(c, 1), i ^= n; | ||
break; | ||
default: | ||
t[1][n] = c; | ||
t[1][c] = o; | ||
} | ||
} | ||
} | ||
return t; | ||
return t[0] = i, t; | ||
} | ||
export { asImmutable, asMutable, clearOptimistic, getUndefined as get, make, remove, set, setOptimistic }; |
@@ -189,22 +189,22 @@ "use strict"; | ||
}, exports.clearOptimistic = function clearOptimistic(e, r) { | ||
for (var t = copyIndex(e, e[2]), i = 31; i >= 0; --i) { | ||
var a = 1 << i; | ||
if (0 != (a & t[0])) { | ||
var n = indexBit(t[0], a), o = clearOptimisticNode(t[1][n], r); | ||
switch (0 | o.tag) { | ||
for (var t = copyIndex(e, e[2]), i = t[0], a = 31; a >= 0; --a) { | ||
var n = 1 << a; | ||
if (0 != (n & t[0])) { | ||
var o = indexBit(t[0], n), c = clearOptimisticNode(t[1][o], r); | ||
switch (0 | c.tag) { | ||
case 0: | ||
var c = o[0], s = clearOptimistic(c, r); | ||
0 === s[0] ? (c[1].splice(n, 1), c[0] = c[0] ^ a) : c[1][n] = __(0, [ s ]); | ||
var s = c[0], u = clearOptimistic(s, r); | ||
0 === u[0] ? (s[1].splice(o, 1), s[0] = s[0] ^ n) : s[1][o] = __(0, [ u ]); | ||
break; | ||
case 4: | ||
t[1].splice(n, 1), t[0] = t[0] ^ a; | ||
t[1].splice(o, 1), i ^= n; | ||
break; | ||
default: | ||
t[1][n] = o; | ||
t[1][o] = c; | ||
} | ||
} | ||
} | ||
return t; | ||
return t[0] = i, t; | ||
}, exports.get = function getUndefined(e, r) { | ||
@@ -211,0 +211,0 @@ for (var t = hash(r), i = e, a = 0; ;) { |
@@ -616,2 +616,3 @@ 'use strict'; | ||
var index = copyIndex(map, owner); | ||
var newBitmap = index[/* bitmap */0]; | ||
for(var x = 31; x >= 0; --x){ | ||
@@ -635,3 +636,3 @@ var pos = (1 << x); | ||
index[/* contents */1].splice(i, 1); | ||
index[/* bitmap */0] = index[/* bitmap */0] ^ pos; | ||
newBitmap = newBitmap ^ pos; | ||
break; | ||
@@ -644,2 +645,3 @@ default: | ||
} | ||
index[/* bitmap */0] = newBitmap; | ||
return index; | ||
@@ -646,0 +648,0 @@ } |
{ | ||
"name": "pessimism", | ||
"description": "A fast HAMT Map intended for KV caching and optimistic updates", | ||
"version": "1.1.1", | ||
"version": "1.1.2", | ||
"author": "Phil Pluckthun <phil@kitten.sh>", | ||
@@ -6,0 +6,0 @@ "source": "./src/index.js", |
@@ -616,2 +616,3 @@ | ||
var index = copyIndex(map, owner); | ||
var newBitmap = index[/* bitmap */0]; | ||
for(var x = 31; x >= 0; --x){ | ||
@@ -635,3 +636,3 @@ var pos = (1 << x); | ||
index[/* contents */1].splice(i, 1); | ||
index[/* bitmap */0] = index[/* bitmap */0] ^ pos; | ||
newBitmap = newBitmap ^ pos; | ||
break; | ||
@@ -644,2 +645,3 @@ default: | ||
} | ||
index[/* bitmap */0] = newBitmap; | ||
return index; | ||
@@ -646,0 +648,0 @@ } |
Sorry, the diff of this file is not supported yet
96382
2540