@fncts/base 0.0.20 → 0.0.22

package/_mjs/collection/immutable/HashMap/api.mjs

@@ -1,5 +1,5 @@
 import * as tsplus_module_1 from "@fncts/base/collection/immutable/HashMap/definition";
-import * as tsplus_module_2 from "@fncts/base/typeclass/HashEq";
+import * as tsplus_module_2 from "@fncts/base/data/HashEq";
 import * as tsplus_module_3 from "@fncts/base/data/Maybe/definition";
 import * as tsplus_module_4 from "@fncts/base/data/Maybe/constructors";
 import * as tsplus_module_5 from "@fncts/base/collection/immutable/HashSet/api";
@@ -7,131 +7,128 @@ import * as tsplus_module_6 from "@fncts/base/collection/mutable/ListBuffer";
 import * as tsplus_module_7 from "@fncts/base/data/Maybe/api";
 import * as tsplus_module_8 from "@fncts/base/data/function/api";
 import * as tsplus_module_9 from "@fncts/base/data/Either/destructors";
-import * as tsplus_module_10 from "@fncts/base/typeclass/TraversableWithIndex";
-import * as tsplus_module_11 from "@fncts/base/data/Maybe/destructors";
+import * as tsplus_module_10 from "@fncts/base/data/Maybe/destructors";
 export const makeWith = makeWith_1;
-export const makeDefault = makeDefault_1;
-export const getHash_ = getHash_1;
-export const get_ = get_1;
-export const modifyHash_ = modifyHash_1;
-export const modify_ = modify_1;
-export const set_ = set_1;
-export const remove_ = remove_1;
+export const empty = empty_1;
+export const getHash = getHash_1;
+export const get = get_1;
+export const modifyHash = modifyHash_1;
+export const modify = modify_1;
+export const set = set_1;
+export const remove = remove_1;
 export const beginMutation = beginMutation_1;
 export const endMutation = endMutation_1;
-export const mutate_ = mutate_1;
-export const forEachWithIndex_ = forEachWithIndex_1;
-export const forEach_ = forEach_1;
-export const mapWithIndex_ = mapWithIndex_1;
-export const flatMapWithIndex_ = flatMapWithIndex_1;
+export const mutate = mutate_1;
+export const forEachWithIndex = forEachWithIndex_1;
+export const forEach = forEach_1;
+export const mapWithIndex = mapWithIndex_1;
+export const flatMapWithIndex = flatMapWithIndex_1;
 export const compact = compact_1;
 export const separate = separate_1;
-export const filterMapWithIndex_ = filterMapWithIndex_1;
-export const filterMap_ = filterMap_1;
-export const filterWithIndex_ = filterWithIndex_1;
-export const partitionMapWithIndex_ = partitionMapWithIndex_1;
-export const partitionMap_ = partitionMap_1;
-export const partitionWithIndex_ = partitionWithIndex_1;
-export const foldLeftWithIndex_ = foldLeftWithIndex_1;
+export const filterMapWithIndex = filterMapWithIndex_1;
+export const filterMap = filterMap_1;
+export const filterWithIndex = filterWithIndex_1;
+export const partitionMapWithIndex = partitionMapWithIndex_1;
+export const partitionMap = partitionMap_1;
+export const partitionWithIndex = partitionWithIndex_1;
+export const foldLeftWithIndex = foldLeftWithIndex_1;
+export const _traverseWithIndex = _traverseWithIndex_1;
+export const _witherWithIndex = _witherWithIndex_1;
+export const _wiltWithIndex = _wiltWithIndex_1;
 import { HashMapIterator } from "@fncts/base/collection/immutable/HashMap/definition";
 import { _EmptyNode, fromBitmap, hashFragment, isEmptyNode, SIZE, toBitmap } from "@fncts/base/collection/immutable/HashMap/internal";
+import { pipe } from "@fncts/base/data/function";
 import * as P from "@fncts/base/typeclass";
 /**
  * Does `map` contain any elements?
  *
  * @tsplus getter fncts.HashMap isEmpty
  */
-
-export function isEmpty(map) {
-  return map && isEmptyNode(map.root);
+export function isEmpty(self) {
+  return self && isEmptyNode(self.root);
 }
 /**
  * Creates a new map
  *
  * @tsplus static fncts.HashMapOps makeWith
  */
-
 function makeWith_1(config) {
   return new tsplus_module_1.HashMap(false, 0, config, _EmptyNode, 0);
 }
 /**
  * @tsplus static fncts.HashMapOps __call
  */
-
-
 export function make(...items) {
-  return mutate_1(makeDefault_1(), map => {
+  return mutate_1(map => {
     for (const [key, value] of items) {
-      set_1(map, key, value);
+      set_1(key, value)(map);
     }
-  });
+  })(empty_1());
 }
 /**
  * Make a new map that has randomly cached hash and structural equality
  *
- * @tsplus static fncts.HashMapOps makeDefault
+ * @tsplus static fncts.HashMapOps empty
  */
-
-function makeDefault_1() {
+function empty_1() {
   return makeWith_1(tsplus_module_2.StructuralStrict);
 }
 /**
  * Makes a new map from a Foldable of key-value pairs
  *
- * @tsplus fluent fncts.HashMapOps fromFoldable
+ * @tsplus pipeable fncts.HashMapOps fromFoldable
  */
-
-
 export function fromFoldable(config, S, F) {
-  return fka => {
-    return F.foldLeft(fka, makeWith_1(config), (b, [k, a]) => {
-      const oa = get_1(b, k);
-
+  return self => {
+    return F.foldLeft(makeWith_1(config), (b, [k, a]) => {
+      const oa = get_1(k)(b);
       if (tsplus_module_3.isJust(oa)) {
-        return set_1(b, k, S.combine(oa.value, a));
+        return set_1(k, S.combine(a)(oa.value))(b);
       } else {
-        return set_1(b, k, a);
+        return set_1(k, a)(b);
       }
-    });
+    })(self);
   };
 }
 /**
  * Lookup the value for `key` in `map` using custom hash.
  *
- * @tsplus fluent fncts.HashMap getHash
+ * @tsplus pipeable fncts.HashMap getHash
  */
-
-function getHash_1(map, key, hash) {
-  return tryGetHash(map, key, hash);
+function getHash_1(key, hash) {
+  return self => {
+    return tryGetHash(self, key, hash);
+  };
 }
 /**
  * Lookup the value for `key` in `map` using internal hash function.
  *
- * @tsplus fluent fncts.HashMap get
+ * @tsplus pipeable fncts.HashMap get
  */
-
-
-function get_1(map, key) {
-  return tryGetHash(map, key, map.config.hash(key));
+function get_1(key) {
+  return self => {
+    return tryGetHash(self, key, self.config.hash(key));
+  };
 }
 /**
  * Does an entry exist for `key` in `map`? Uses custom `hash`.
  *
- * @tsplus fluent fncts.HashMap hashHash
+ * @tsplus pipeable fncts.HashMap hasHash
  */
-
-
-export function hasHash_(map, key, hash) {
-  return tsplus_module_3.isJust(tryGetHash(map, key, hash));
+export function hasHash(key, hash) {
+  return self => {
+    return tsplus_module_3.isJust(tryGetHash(self, key, hash));
+  };
 }
 /**
  * Does an entry exist for `key` in `map`? Uses internal hash function.
  *
- * @tsplus fluent fncts.HashMap has
+ * @tsplus pipeable fncts.HashMap has
  */
-
-export function has_(map, key) {
-  return tsplus_module_3.isJust(tryGetHash(map, key, map.config.hash(key)));
+export function has(key) {
+  return self => {
+    return tsplus_module_3.isJust(tryGetHash(self, key, self.config.hash(key)));
+  };
 }
 /**
  * Alter the value stored for `key` in `map` using function `f` using custom hash.
@@ -142,15 +139,16 @@ export function has_(map, key) {
  * `modify` will always either update or insert a value into the map.
  * Returns a map with the modified value. Does not alter `map`.
  *
- * @tsplus fluent fncts.HashMap modifyHash
+ * @tsplus pipeable fncts.HashMap modifyHash
  */
-
-function modifyHash_1(map, key, hash, f) {
-  const size = {
-    value: map.size
+function modifyHash_1(key, hash, f) {
+  return self => {
+    const size = {
+      value: self.size
+    };
+    const newRoot = self.root.modify(self.editable ? self.edit : NaN, self.config.equals, 0, f, hash, key, size);
+    return setTree(self, newRoot, size.value);
   };
-  const newRoot = map.root.modify(map.editable ? map.edit : NaN, map.config.equals, 0, f, hash, key, size);
-  return setTree(map, newRoot, size.value);
 }
 /**
  * Alter the value stored for `key` in `map` using function `f` using internal hash function.
@@ -161,126 +159,118 @@ function modifyHash_1(map, key, hash, f) {
  * `modify` will always either update or insert a value into the map.
  * Returns a map with the modified value. Does not alter `map`.
  *
- * @tsplus fluent fncts.HashMap modify
+ * @tsplus pipeable fncts.HashMap modify
  */
-
-
-function modify_1(map, key, f) {
-  return modifyHash_1(map, key, map.config.hash(key), f);
+function modify_1(key, f) {
+  return self => {
+    return modifyHash_1(key, self.config.hash(key), f)(self);
+  };
 }
 /**
  * Store `value` for `key` in `map` using internal hash function.
  *
- * @tsplus fluent fncts.HashMap set
+ * @tsplus pipeable fncts.HashMap set
  */
-
-
-function set_1(map, key, value) {
-  return modify_1(map, key, () => tsplus_module_4.just(value));
+function set_1(key, value) {
+  return self => {
+    return modify_1(key, () => tsplus_module_4.just(value))(self);
+  };
 }
 /**
  * Remove the entry for `key` in `map` using internal hash.
  *
- * @tsplus fluent fncts.HashMap remove
+ * @tsplus pipeable fncts.HashMap remove
  */
-
-
-function remove_1(map, key) {
-  return modify_1(map, key, () => tsplus_module_4.nothing());
+function remove_1(key) {
+  return self => {
+    return modify_1(key, () => tsplus_module_4.nothing())(self);
+  };
 }
 /**
  * Remove many keys
  *
- * @tsplus fluent fncts.HashMap removeMany
+ * @tsplus pipeable fncts.HashMap removeMany
  */
-
-
-export function removeMany_(map, keys) {
-  return mutate_1(map, m => {
-    for (const k of keys) {
-      remove_1(m, k);
-    }
-  });
+export function removeMany(keys) {
+  return self => {
+    return mutate_1(m => {
+      for (const k of keys) {
+        remove_1(k)(m);
+      }
+    })(self);
+  };
 }
 /**
  * Mark `map` as mutable.
  *
  * @tsplus getter fncts.HashMap beginMutation
  */
-
-function beginMutation_1(map) {
-  return new tsplus_module_1.HashMap(true, map.edit + 1, map.config, map.root, map.size);
+function beginMutation_1(self) {
+  return new tsplus_module_1.HashMap(true, self.edit + 1, self.config, self.root, self.size);
 }
 /**
  * Mark `map` as immutable.
  *
  * @tsplus getter fncts.HashMap endMutation
  */
-
-
-function endMutation_1(map) {
-  map.editable = false;
-  return map;
+function endMutation_1(self) {
+  self.editable = false;
+  return self;
 }
 /**
  * Mutate `map` within the context of `f`.
  *
- * @tsplus fluent fncts.HashMap mutate
+ * @tsplus pipeable fncts.HashMap mutate
  */
-
-
-function mutate_1(map, f) {
-  const transient = beginMutation_1(map);
-  f(transient);
-  return endMutation_1(transient);
+function mutate_1(f) {
+  return self => {
+    const transient = beginMutation_1(self);
+    f(transient);
+    return endMutation_1(transient);
+  };
 }
 /**
  * Get an IterableIterator of the map keys
  *
  * @tsplus getter fncts.HashMap keys
  */
-
-
-export function keys(map) {
-  return new HashMapIterator(map, ([k]) => k);
+export function keys(self) {
+  return new HashMapIterator(self, ([k]) => k);
 }
 /**
  * Get the set of keys
  *
  * @tsplus getter fncts.HashMap keySet
  */
-
 export function keySet(self) {
-  return tsplus_module_5.mutate_(tsplus_module_5.make(self.config), set => {
-    forEachWithIndex_1(self, k => {
-      tsplus_module_5.add_(set, k);
-    });
-  });
+  return tsplus_module_5.mutate(set => {
+    forEachWithIndex_1(k => {
+      tsplus_module_5.add(k)(set);
+    })(self);
+  })(tsplus_module_5.emptyWith(self.config));
 }
 /**
  * Get the set of values
  *
- * @tsplus getter fncts.HashMap keySetDefault
+ * @tsplus getter fncts.HashMap toSet
  */
-
-export function toSetDefault(map) {
-  return tsplus_module_5.mutate_(tsplus_module_5.makeDefault(), set => {
-    forEach_1(map, v => {
-      tsplus_module_5.add_(set, v);
-    });
-  });
+export function toSet(self) {
+  return tsplus_module_5.mutate(set => {
+    forEach_1(v => {
+      tsplus_module_5.add(v)(set);
+    })(self);
+  })(tsplus_module_5.empty());
 }
 /**
  * Get the set of values
  *
  * @tsplus getter fncts.HashMap toList
  */
-
-export function toList(map) {
+export function toList(self) {
   const buffer = new tsplus_module_6.ListBuffer();
-  forEachWithIndex_1(map, (k, v) => {
+  forEachWithIndex_1((k, v) => {
     buffer.append([k, v]);
-  });
+  })(self);
   return buffer.toList;
 }
 /**
@@ -288,14 +278,13 @@ export function toList(map) {
  *
  * @tsplus getter fncts.HashMap toArray
  */
-
-export function toArray(map) {
-  const buffer = Array(map.size);
+export function toArray(self) {
+  const buffer = Array(self.size);
   let i = 0;
-  forEachWithIndex_1(map, (k, v) => {
+  forEachWithIndex_1((k, v) => {
     buffer[i] = [k, v];
     i++;
-  });
+  })(self);
   return buffer;
 }
 /**
@@ -303,377 +292,364 @@ export function toArray(map) {
  *
  * @tsplus getter fncts.HashMap values
  */
-
-export function values(map) {
-  return new HashMapIterator(map, ([, v]) => v);
+export function values(self) {
+  return new HashMapIterator(self, ([, v]) => v);
 }
 /**
  * Update a value if exists
  *
- * @tsplus fluent fncts.HashMap update
+ * @tsplus pipeable fncts.HashMap update
  */
-
-export function update_(map, key, f) {
-  return modify_1(map, key, v => tsplus_module_7.map_(v, f));
+export function update(key, f) {
+  return self => {
+    return modify_1(key, v => tsplus_module_7.map(f)(v))(self);
+  };
 }
 /**
  * Apply f to each element
  *
- * @tsplus fluent fncts.HashMap forEachWithIndex
+ * @tsplus pipeable fncts.HashMap forEachWithIndex
  */
-
-function forEachWithIndex_1(map, f) {
-  foldLeftWithIndex_1(map, undefined, (key, _, value) => f(key, value, map));
+function forEachWithIndex_1(f) {
+  return self => {
+    foldLeftWithIndex_1(undefined, (key, _, value) => f(key, value, self))(self);
+  };
 }
 /**
  * Apply f to each element
  *
- * @tsplus fluent fncts.HashMap forEach
+ * @tsplus pipeable fncts.HashMap forEach
  */
-
-
-function forEach_1(map, f) {
-  return forEachWithIndex_1(map, (_, v, m) => f(v, m));
+function forEach_1(f) {
+  return self => {
+    return forEachWithIndex_1((_, v, m) => f(v, m))(self);
+  };
 }
 /**
  * Maps over the map entries
  *
- * @tsplus fluent fncts.HashMap mapWithIndex
+ * @tsplus pipeable fncts.HashMap mapWithIndex
  */
-
-
-function mapWithIndex_1(fa, f) {
-  return foldLeftWithIndex_1(fa, makeWith_1(fa.config), (k, z, v) => set_1(z, k, f(k, v)));
+function mapWithIndex_1(f) {
+  return self => {
+    return foldLeftWithIndex_1(makeWith_1(self.config), (k, z, v) => set_1(k, f(k, v))(z))(self);
+  };
 }
 /**
  * Maps over the map entries
  *
- * @tsplus fluent fncts.HashMap map
+ * @tsplus pipeable fncts.HashMap map
  */
-
-
-export function map_(fa, f) {
-  return mapWithIndex_1(fa, (_, a) => f(a));
+export function map(f) {
+  return self => {
+    return mapWithIndex_1((_, a) => f(a))(self);
+  };
 }
 /**
  * Chain over the map entries, the hash and equal of the 2 maps has to be the same
  *
- * @tsplus fluent fncts.HashMap flatMapWithIndex
+ * @tsplus pipeable fncts.HashMap flatMapWithIndex
  */
-
-function flatMapWithIndex_1(ma, f) {
-  return foldLeftWithIndex_1(ma, makeWith_1(ma.config), (k, z, v) => mutate_1(z, m => {
-    forEachWithIndex_1(f(k, v), (k1, a1) => {
-      set_1(m, k1, a1);
-    });
-  }));
+function flatMapWithIndex_1(f) {
+  return self => {
+    return foldLeftWithIndex_1(makeWith_1(self.config), (k, z, v) => mutate_1(m => {
+      forEachWithIndex_1((k1, a1) => {
+        set_1(k1, a1)(m);
+      })(f(k, v));
+    })(z))(self);
+  };
 }
 /**
  * Chain over the map entries, the hash and equal of the 2 maps has to be the same
  *
- * @tsplus fluent fncts.HashMap flatMap
+ * @tsplus pipeable fncts.HashMap flatMap
  */
-
-
-export function flatMap_(ma, f) {
-  return flatMapWithIndex_1(ma, (_, a) => f(a));
+export function flatMap(f) {
+  return self => {
+    return flatMapWithIndex_1((_, a) => f(a))(self);
+  };
 }
 /**
  * Removes values that are `Nothing`
  *
  * @tsplus getter fncts.HashMap compact
  */
-
-function compact_1(map) {
-  return filterMap_1(map, tsplus_module_8.identity);
+function compact_1(self) {
+  return filterMap_1(tsplus_module_8.identity)(self);
 }
 /**
  * Removes `Either` values into two separate `HashMaps`
  *
  * @tsplus getter fncts.HashMap separate
  */
-
-
-function separate_1(map) {
-  return partitionMap_1(map, tsplus_module_8.identity);
+function separate_1(self) {
+  return partitionMap_1(tsplus_module_8.identity)(self);
 }
 /**
  * Filter out None and map
  *
- * @tsplus fluent fncts.HashMap filterMapWithIndex
- */
-
-
-function filterMapWithIndex_1(map, f) {
-  return mutate_1(makeWith_1(map.config), m => {
-    for (const [k, a] of map) {
-      const o = f(k, a);
-
-      if (tsplus_module_3.isJust(o)) {
-        set_1(m, k, o.value);
+ * @tsplus pipeable fncts.HashMap filterMapWithIndex
+ */
+function filterMapWithIndex_1(f) {
+  return self => {
+    return mutate_1(m => {
+      for (const [k, a] of self) {
+        const o = f(k, a);
+        if (tsplus_module_3.isJust(o)) {
+          set_1(k, o.value)(m);
+        }
       }
-    }
-  });
+    })(makeWith_1(self.config));
+  };
 }
 /**
  * Filter out None and map
  *
- * @tsplus fluent fncts.HashMap filterMap
+ * @tsplus pipeable fncts.HashMap filterMap
  */
-
-
-function filterMap_1(map, f) {
-  return filterMapWithIndex_1(map, (_, a) => f(a));
+function filterMap_1(f) {
+  return self => {
+    return filterMapWithIndex_1((_, a) => f(a))(self);
+  };
 }
-
-function filterWithIndex_1(map, predicate) {
-  return mutate_1(makeWith_1(map.config), m => {
-    for (const [k, a] of map) {
-      if (predicate(k, a)) {
-        set_1(m, k, a);
+function filterWithIndex_1(predicate) {
+  return self => {
+    return mutate_1(m => {
+      for (const [k, a] of self) {
+        if (predicate(k, a)) {
+          set_1(k, a)(m);
+        }
       }
-    }
-  });
-}
-
-export function filter_(map, predicate) {
-  return filterWithIndex_1(map, (_, a) => predicate(a));
-}
-/**
- * @tsplus fluent fncts.HashMap partitionMapWithIndex
- */
-
-function partitionMapWithIndex_1(map, f) {
-  const left = beginMutation_1(makeWith_1(map.config));
-  const right = beginMutation_1(makeWith_1(map.config));
-  forEachWithIndex_1(map, (k, v) => {
-    tsplus_module_9.match_(f(k, v), a => {
-      set_1(left, k, a);
-    }, b => {
-      set_1(right, k, b);
-    });
-  });
-  return [endMutation_1(left), endMutation_1(right)];
-}
-/**
- * @tsplus fluent fncts.HashMap partitionMap
- */
-
-
-function partitionMap_1(map, f) {
-  return partitionMapWithIndex_1(map, (_, a) => f(a));
-}
-
-function partitionWithIndex_1(map, predicate) {
-  const left = beginMutation_1(makeWith_1(map.config));
-  const right = beginMutation_1(makeWith_1(map.config));
-  forEachWithIndex_1(map, (k, v) => {
-    if (predicate(k, v)) {
-      set_1(right, k, v);
-    } else {
-      set_1(left, k, v);
-    }
-  });
-  return [endMutation_1(left), endMutation_1(right)];
+    })(makeWith_1(self.config));
+  };
+}
+export function filter(predicate) {
+  return self => {
+    return filterWithIndex_1((_, a) => predicate(a))(self);
+  };
+}
+/**
+ * @tsplus pipeable fncts.HashMap partitionMapWithIndex
+ */
+function partitionMapWithIndex_1(f) {
+  return self => {
+    const left = beginMutation_1(makeWith_1(self.config));
+    const right = beginMutation_1(makeWith_1(self.config));
+    forEachWithIndex_1((k, v) => {
+      tsplus_module_9.match(a => {
+        set_1(k, a)(left);
+      }, b => {
+        set_1(k, b)(right);
+      })(f(k, v));
+    })(self);
+    return [endMutation_1(left), endMutation_1(right)];
+  };
 }
-
-export function partition_(map, predicate) {
-  return partitionWithIndex_1(map, (_, a) => predicate(a));
+/**
+ * @tsplus pipeable fncts.HashMap partitionMap
+ */
+function partitionMap_1(f) {
+  return self => {
+    return partitionMapWithIndex_1((_, a) => f(a))(self);
+  };
+}
+function partitionWithIndex_1(predicate) {
+  return self => {
+    const left = beginMutation_1(makeWith_1(self.config));
+    const right = beginMutation_1(makeWith_1(self.config));
+    forEachWithIndex_1((k, v) => {
+      if (predicate(k, v)) {
+        set_1(k, v)(right);
+      } else {
+        set_1(k, v)(left);
+      }
+    })(self);
+    return [endMutation_1(left), endMutation_1(right)];
+  };
+}
+export function partition(predicate) {
+  return self => {
+    return partitionWithIndex_1((_, a) => predicate(a))(self);
+  };
 }
 /**
  * Reduce a state over the map entries
  *
- * @tsplus fluent fncts.HashMap foldLeftWithIndex
+ * @tsplus pipeable fncts.HashMap foldLeftWithIndex
  */
-
-function foldLeftWithIndex_1(map, z, f) {
-  const root = map.root;
-  if (root._tag === "LeafNode") return tsplus_module_3.isJust(root.value) ? f(root.key, z, root.value.value) : z;
-
-  if (root._tag === "EmptyNode") {
-    return z;
-  }
-
-  const toVisit = [root.children];
-  let children;
-  let acc = z;
-
-  while (children = toVisit.pop()) {
-    for (let i = 0, len = children.length; i < len;) {
-      const child = children[i++];
-
-      if (child && !isEmptyNode(child)) {
-        if (child._tag === "LeafNode") {
-          if (tsplus_module_3.isJust(child.value)) {
-            // eslint-disable-next-line no-param-reassign
-            acc = f(child.key, acc, child.value.value);
+function foldLeftWithIndex_1(z, f) {
+  return self => {
+    const root = self.root;
+    if (root._tag === "LeafNode") return tsplus_module_3.isJust(root.value) ? f(root.key, z, root.value.value) : z;
+    if (root._tag === "EmptyNode") {
+      return z;
+    }
+    const toVisit = [root.children];
+    let children;
+    let acc = z;
+    while (children = toVisit.pop()) {
+      for (let i = 0, len = children.length; i < len;) {
+        const child = children[i++];
+        if (child && !isEmptyNode(child)) {
+          if (child._tag === "LeafNode") {
+            if (tsplus_module_3.isJust(child.value)) {
+              // eslint-disable-next-line no-param-reassign
+              acc = f(child.key, acc, child.value.value);
+            }
+          } else {
+            toVisit.push(child.children);
           }
-        } else {
-          toVisit.push(child.children);
         }
       }
     }
-  }
-
-  return acc;
+    return acc;
+  };
 }
 /**
  * Reduce a state over the map entries
  *
- * @tsplus fluent fncts.HashMap foldLeft
+ * @tsplus pipeable fncts.HashMap foldLeft
  */
-
-
-export function foldLeft_(map, z, f) {
-  return foldLeftWithIndex_1(map, z, (_, b, a) => f(b, a));
+export function foldLeft(z, f) {
+  return self => {
+    return foldLeftWithIndex_1(z, (_, b, a) => f(b, a))(self);
+  };
+}
+function _traverseWithIndex_1(self) {
+  return G => f => foldLeftWithIndex_1(G.pure(makeWith_1(self.config)), (k, b, a) => G.zipWith(f(k, a), (map, b) => set_1(k, b)(map))(b))(self);
 }
-/**
- * @tsplus getter fncts.HashMap traverseWithIndex
- */
-
-const traverseWithIndex_1 = /*#__PURE__*/tsplus_module_10.mkTraverseWithIndex_()(() => ta => G => f => foldLeftWithIndex_1(ta, G.pure(makeWith_1(ta.config)), (k, b, a) => G.zipWith(b, f(k, a), (map, b) => set_1(map, k, b))));
-export const traverseWithIndex = traverseWithIndex_1;
 /**
  * @tsplus getter fncts.HashMap traverse
  */
-
-export const traverse = ta => G => f => traverseWithIndex_1(ta)(G)((_, a) => f(a));
+export function _traverse(self) {
+  return G => f => _traverseWithIndex_1(self)(G)((_, a) => f(a));
+}
+export const traverseWithIndex = G => f => ta => _traverseWithIndex_1(ta)(G)(f);
+export const traverse = G => f => ta => _traverseWithIndex_1(ta)(G)((_, a) => f(a));
 /**
- * @tsplus fluent fncts.HashMap unsafeGet
+ * @tsplus pipeable fncts.HashMap unsafeGet
  */
-
-export function unsafeGet_(self, key) {
-  return tsplus_module_7.toUndefined(getHash_1(self, key, self.config.hash(key)));
+export function unsafeGet(key) {
+  return self => {
+    return tsplus_module_7.toUndefined(getHash_1(key, self.config.hash(key))(self));
+  };
 }
 /**
  * @tsplus getter fncts.HashMap witherWithIndex
  */
-
-const witherWithIndex_1 = wa => G => f => G.map(traverseWithIndex_1(wa)(G)(f), compact_1);
-
-export const witherWithIndex = witherWithIndex_1;
+function _witherWithIndex_1(self) {
+  return G => f => G.map(compact_1)(_traverseWithIndex_1(self)(G)(f));
+}
 /**
  * @tsplus getter fncts.HashMap wither
  */
-
-export const wither = wa => G => f => witherWithIndex_1(wa)(G)((_, a) => f(a));
+export function _wither(self) {
+  return G => f => _witherWithIndex_1(self)(G)((_, a) => f(a));
+}
+export const witherWithIndex = G => f => wa => _witherWithIndex_1(wa)(G)(f);
+export const wither = G => f => wa => _witherWithIndex_1(wa)(G)((_, a) => f(a));
 /**
  * @tsplus getter fncts.HashMap wiltWithIndex
  */
-
-const wiltWithIndex_1 = wa => G => f => G.map(traverseWithIndex_1(wa)(G)(f), separate_1);
-
-export const wiltWithIndex = wiltWithIndex_1;
+function _wiltWithIndex_1(self) {
+  return G => f => G.map(separate_1)(_traverseWithIndex_1(self)(G)(f));
+}
 /**
  * @tsplus getter fncts.HashMap wilt
  */
-
-export const wilt = wa => G => f => wiltWithIndex_1(wa)(G)((_, a) => f(a));
+export function _wilt(self) {
+  return G => f => _wiltWithIndex_1(self)(G)((_, a) => f(a));
+}
+export const wiltWithIndex = G => f => wa => _wiltWithIndex_1(wa)(G)(f);
+export const wilt = G => f => wa => _wiltWithIndex_1(wa)(G)((_, a) => f(a));
 /**
- * @tsplus fluent fncts.HashMap unionWith
+ * @tsplus pipeable fncts.HashMap unionWith
  */
-
-export function unionWith_(self, that, f) {
-  return mutate_1(self, m => {
-    for (const [k, a] of that) {
-      modify_1(m, k, v => tsplus_module_11.match_(v, () => tsplus_module_4.just(a), a0 => tsplus_module_4.just(f(a0, a))));
-    }
-  });
+export function unionWith(that, f) {
+  return self => {
+    return mutate_1(m => {
+      for (const [k, a] of that) {
+        modify_1(k, v => tsplus_module_10.match(() => tsplus_module_4.just(a), a0 => tsplus_module_4.just(f(a0, a)))(v))(m);
+      }
+    })(self);
+  };
 }
 /**
- * @tsplus fluent fncts.HashMap union
+ * @tsplus pipeable fncts.HashMap union
  */
-
-export function union_(self, that) {
-  return mutate_1(self, m => {
-    for (const [k, a] of that) {
-      set_1(m, k, a);
-    }
-  });
+export function union(that) {
+  return self => {
+    return mutate_1(m => {
+      for (const [k, a] of that) {
+        set_1(k, a)(m);
+      }
+    })(self);
+  };
 }
 /**
- * @tsplus fluent fncts.HashMap pop
+ * @tsplus pipeable fncts.HashMap pop
  */
-
-export function pop_(map, k) {
-  return tsplus_module_7.map_(get_1(map, k), a => [a, remove_1(map, k)]);
+export function pop(k) {
+  return self => {
+    return tsplus_module_7.map(a => [a, remove_1(k)(self)])(get_1(k)(self));
+  };
 }
-/*
- * -------------------------------------------------------------------------------------------------
- * internal
- * -------------------------------------------------------------------------------------------------
- */
-
 /**
  * Set the root of the map
  */
-
 function setTree(map, newRoot, newSize) {
   if (map.editable) {
     map.root = newRoot;
     map.size = newSize;
     return map;
   }
-
   return newRoot === map.root ? map : new tsplus_module_1.HashMap(map.editable, map.edit, map.config, newRoot, newSize);
 }
 /**
  * Lookup the value for `key` in `map` using custom hash.
  */
-
-
 function tryGetHash(map, key, hash) {
   let node = map.root;
   let shift = 0;
-  const keyEq = map.config.equals; // eslint-disable-next-line no-constant-condition
-
+  const keyEq = map.config.equals;
+  // eslint-disable-next-line no-constant-condition
   while (true) {
     switch (node._tag) {
       case "LeafNode":
         {
-          return keyEq(node.key, key) ? node.value : tsplus_module_4.nothing();
+          return keyEq(key)(node.key) ? node.value : tsplus_module_4.nothing();
         }
-
       case "CollisionNode":
         {
           if (hash === node.hash) {
             const children = node.children;
-
             for (let i = 0, len = children.length; i < len; ++i) {
               const child = children[i];
-              if ("key" in child && keyEq(child.key, key)) return child.value;
+              if ("key" in child && keyEq(key)(child.key)) return child.value;
             }
           }
-
           return tsplus_module_4.nothing();
         }
-
       case "IndexedNode":
         {
           const frag = hashFragment(shift, hash);
           const bit = toBitmap(frag);
-
           if (node.mask & bit) {
             node = node.children[fromBitmap(node.mask, bit)];
             shift += SIZE;
             break;
           }
-
           return tsplus_module_4.nothing();
         }
-
       case "ArrayNode":
         {
           node = node.children[hashFragment(shift, hash)];
-
           if (node) {
             shift += SIZE;
             break;
           }
-
           return tsplus_module_4.nothing();
         }
-
       default:
         return tsplus_module_4.nothing();
     }