Skip to content

An atomic log with a partitioned consensus algorithm.

License

Notifications You must be signed in to change notification settings

flatheadmill/sympatico

Repository files navigation

Actions Status codecov License: MIT

An atomic log with a parititioned consensus algorithm.

What Where
Discussion #1
Documentation https://bigeasy.github.io/sympatico
Source https://github.com/bigeasy/sympatico
Issues https://github.com/bigeasy/sympatico/issues
CI https://travis-ci.org/bigeasy/sympatico
Coverage: https://codecov.io/gh/bigeasy/sympatico
License: MIT

Sympatico installs from NPM.

npm install sympatico

This README.md is also a unit test using the Proof unit test framework. We'll use the Proof okay function to assert out statements in the readme. A Proof unit test generally looks like this.

require('proof')(4, async okay => {
    okay('always okay')
    okay(true, 'okay if true')
    okay(1, 1, 'okay if equal')
    okay({ value: 1 }, { value: 1 }, 'okay if deep strict equal')
})

You can run this unit test yourself to see the output from the various code sections of the readme.

git clone [email protected]:bigeasy/packet.git
cd packet
npm install --no-package-lock --no-save
node --allow-natives-syntax test/readme/readme.t.js

Further Documentation

const Sympatico = require('packet/phaser')
okay(Sympatico, 'require')

About

An atomic log with a partitioned consensus algorithm.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published