115 lines
3.5 KiB
JavaScript
115 lines
3.5 KiB
JavaScript
import { pretty } from "../util/pretty.js";
|
|
import { newLiteral, transform, read, getReadDependencies, verifyValue } from "../versioning/value.js";
|
|
import { merge, merge2, newSlot, overwrite } from "../versioning/slot.js";
|
|
import createRBTree from "functional-red-black-tree";
|
|
import { add, emptySet, RBTreeWrapper } from "../structures/set.js";
|
|
import { compareNumbers } from "../compare/primitives.js";
|
|
|
|
const inc = x => x + 1;
|
|
|
|
|
|
console.log("##############");
|
|
console.log("## Counting ##");
|
|
console.log("##############");
|
|
|
|
const counterOneSlot = newSlot(Symbol('counter'))(newLiteral(1));
|
|
const valueOne = read(counterOneSlot);
|
|
console.log(pretty({valueOne}));
|
|
const onePlusOne = transform(valueOne)(newLiteral(inc));
|
|
console.log(pretty({onePlusOne}));
|
|
const onePlusOnePlusOne = transform(onePlusOne)(newLiteral(inc));
|
|
console.log(pretty({onePlusOnePlusOne}));
|
|
|
|
verifyValue(valueOne);
|
|
verifyValue(onePlusOne);
|
|
verifyValue(onePlusOnePlusOne);
|
|
|
|
|
|
|
|
console.log("#############");
|
|
console.log("## Summing ##");
|
|
console.log("#############");
|
|
|
|
const priceSlot = newSlot(Symbol('price'))(newLiteral(20.66));
|
|
const taxSlot = newSlot(Symbol('tax'))(newLiteral(4.34));
|
|
|
|
const total =
|
|
transform(read(priceSlot))(
|
|
transform(read(taxSlot))(
|
|
newLiteral(tax => price => price + tax)));
|
|
|
|
console.log(pretty({total}))
|
|
|
|
const totalPlusOne = transform(total)(newLiteral(inc));
|
|
|
|
console.log(pretty({totalPlusOne}));
|
|
|
|
verifyValue(totalPlusOne);
|
|
|
|
console.log("getReadDependencies(totalPlusOne):", getReadDependencies(totalPlusOne));
|
|
|
|
|
|
|
|
console.log("###############");
|
|
console.log("## Branching ##");
|
|
console.log("###############");
|
|
|
|
const fiveSlot = newSlot(Symbol('counter'))(newLiteral(5));
|
|
const sixSlot = overwrite(fiveSlot)(newLiteral(6));
|
|
const sevenSlot = overwrite(fiveSlot)(newLiteral(7));
|
|
const eightSlot = overwrite(fiveSlot)(newLiteral(8));
|
|
|
|
const intMerge = merge(compareNumbers);
|
|
const intMerge2 = merge2(compareNumbers);
|
|
|
|
const sixSevenSlot = intMerge(sixSlot)(sevenSlot);
|
|
const sevenEightSlot = intMerge(sevenSlot)(eightSlot);
|
|
|
|
// console.log(compareSlots(intCompare)(fiveSlot)(fiveSlot));
|
|
// console.log(compareSlots(intCompare)(sixSlot)(sixSlot));
|
|
// console.log(compareSlots(intCompare)(fiveSlot)(sixSlot));
|
|
// console.log(compareSlots(intCompare)(sixSlot)(fiveSlot));
|
|
|
|
const sixSevenEightSlot = intMerge2(sixSevenSlot)(sevenEightSlot);
|
|
|
|
console.log(pretty({sixSevenEightSlot}));
|
|
|
|
// console.log("########################");
|
|
// console.log("## Heterogeneous data ##");
|
|
// console.log("########################");
|
|
|
|
// // Slot<Int>
|
|
// const numberOfSheepSlot = newSlot(Symbol('numberOfSheep'))(newLiteral(5));
|
|
// const alternativeNumberOfSheepSlot = newSlot(Symbol('alternativeNumberOfSheep'))(newLiteral(6));
|
|
// // Slot<String>
|
|
// const labelSlot = newSlot(Symbol('label'))(newLiteral("number of sheep"));
|
|
|
|
// const combineFn = newLiteral(label => numberOfSheep => `${label}: ${numberOfSheep}`)
|
|
|
|
// // Slot<String>
|
|
// const labelAndValueSlotA = overwrite(labelSlot)(
|
|
// transform(read(numberOfSheepSlot))(
|
|
// transform(read(labelSlot))(combineFn)));
|
|
|
|
// const labelAndValueSlotB = overwrite(labelSlot)(
|
|
// transform(read(alternativeNumberOfSheepSlot))(
|
|
// transform(read(labelSlot))(combineFn)));
|
|
|
|
// console.log(
|
|
// add(add(emptySet(compareSlots(compareStrings)))(labelAndValueSlotA))(labelAndValueSlotB)
|
|
// );
|
|
|
|
// merge()(labelSlot)(labelAndValueSlot)
|
|
|
|
|
|
console.log("#############")
|
|
console.log("## RB Tree ##")
|
|
console.log("#############")
|
|
|
|
// just a small experiment
|
|
console.log(
|
|
createRBTree()
|
|
.insert(1)
|
|
.insert(1)
|
|
.insert(2)
|
|
);
|