cubic-beziers-through-points/src/utils/dual-set.ts

A function to fit fair (bending energy minimizing) cubic bezier curves through a set of given ordered points in the plane.

/**
 * A 'dual-set' in the sense that it needs two ordered keys.
 */
type DualSet<K,L> = Map<K,Set<L>>;


/**
 * Get a value from the dual-set.
 * @param set 
 * @param k 
 */
function has<K,L>(
        set: DualSet<K,L>,
        k: K,
        l: L): boolean {

    const lSet = set.get(k);
    if (lSet === undefined) { return false; }

    return lSet.has(l);
}


/**
 * Adds a value to the dual-set.
 * 
 * * destructively sets the value
 * 
 * @param set 
 * @param k 
 * @param l 
 */
function add<K,L>(
        set: DualSet<K,L>,
        k: K,
        l: L): void {

    let lSet = set.get(k);
    if (lSet === undefined) {
        lSet = new Set();
        set.set(k, lSet);
    }
    lSet.add(l);
}


function remove<K,L>(
        set: DualSet<K,L>,
        k: K,
        l: L): boolean {

    let lSet = set.get(k);
    if (lSet === undefined) {
        return false;
    }
    const r = lSet.delete(l);
    if (!r) { return false; }

    if (lSet.size === 0) {
        set.delete(k);
    }

    return true;
}


const DualSetFs = { has, add, remove };


export { DualSet, DualSetFs }


// TESTING
// const s: DualSet<number,number> = new Map();
// add(s,1,2);
// has(s,1,2);//?
// has(s,2,1);//?
// has(s,1,1);//?
// add(s,1,1);
// has(s,1,1);//?
// has(s,1,2);//?