zerobias

export const defaultCache = store => {
  return {
    invalidate: hash =>
      new Promise(resolve => {
        delete store[hash];
        resolve(hash);
      }),
    invalidateAll: () =>
      new Promise(resolve => {
        store = {};

zerobias

license: mit

zerobias

module.exports = class Graph {

    constructor(V, E, directed = false) {
        this.vertices = V;
        this.edges = {};

        E.map(e => {
            const a = e[0]; const b = e[1]; const w = e[2] === undefined ? 1 : e[2];

            this.addEdge(a, b, w);

zerobias

//@flow

import {
  createStore,
  createEffect,
  type Store,
} from 'effector'

export function persistentStore(defaults: string, key: string) {
  const readEff = createEffect(`read ${key}`)

zerobias

//@flow

export class SemiMap<Key, Val> {
  /*::
  ;+_: Map<Key, Val>
  ;+@@iterator: () => Iterator<[Key, Val]>
  mutable: boolean
  */
  constructor(parent: Map<Key, Val> = new Map()) {
    this._ = parent

zerobias

Flow lazy (aka "blazing fast") server with force recheck shortcuts

Usage

Run ./flowtype to start server in lazy mode and ./check Foo to add ./src/Foo.js to flow watchlist

One line install

echo '#!/usr/bin/env bash\nnpx flow server --lazy-mode fs --strip-root\n' > ./flowtype && echo '#!/usr/bin/env bash\necho "focus check src/$1.js"\nnpx flow force-recheck --focus ./src/$1.js\n' > ./check && chmod +x ./flowtype && chmod +x ./check

zerobias

/**
 * A linked list implementation in JavaScript.
 */
class DoublyLinkedList {
  constructor() {
    /**
     * Pointer to first item in the list.
     * @property _head
     * @type Object
     * @private

zerobias

/**
 * A linked list implementation in JavaScript.
 * @class LinkedList
 * @constructor
 */
class LinkedList {
  constructor() {
    /**
     * The number of items in the list.
     * @property _length

zerobias

/**
 * A binary search tree implementation in JavaScript. This implementation
 * does not allow duplicate values to be inserted into the tree, ensuring
 * that there is just one instance of each value.
 * @class BinarySearchTree
 * @constructor
 */
class BinarySearchTree {
  constructor() {
    /**

zerobias

/**
 * Uses a binary search algorithm to locate a value in the specified array.
 * @param {Array} items The array containing the item.
 * @param {variant} value The value to search for.
 * @return {int} The zero-based index of the value in the array or -1 if not found.
 */
function binarySearch(items, value){

    var startIndex  = 0,
        stopIndex   = items.length - 1,