npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

hyper-string

v3.3.1

Published

conflict-free p2p string data structure powered by a hyperlog of operations

Downloads

35

Readme

hyper-string

conflict-free p2p string data structure powered by a hyperlog of operations

STATUS: very mad science-y work-in-progres

TODO: write some background / context on this. talk about the implications of representing a textual string as an append-only log of operations, with a materialized view as a DAG of character sequences.

Usage

Let's start writing "Helo", but have a fork where some other user wants to fix the spelling error by inserting another "l".

var hstring = require('hyper-string')
var memdb = require('memdb')

var str = hstring(memdb())

str.insert(null, null, 'Hola', function (err, ops) {
  // ops is an array of four unique IDs
  str.insert(null, ops[0], '¡')
  str.insert(ops[ops.length-1], null, '!')
})

str.text(function (err, text) {
  console.log(text)
})

This will output

¡Hola!

API

var hstring = require('hyper-string')

var str = hstring(db, opts={})

Creates a new hyper-string, backed by the LevelUP instance db.

str.insert(beforePos, afterPos, string, [cb])

Inserts all characters of string after position beforePos and before position afterPos, which are unique IDs of other characters previously inserted. If 'beforePosisnull, the given string is inserted at the beginning of the hyper-string. If afterPosisnull`, it is inserted at the end.

Remember, since the hyper-string is represented by a directed acyclic graph, it can have many different "beginnings" and "ends". hyper-string ensures that the ordering of these are deterministic.

The callback cb is called with the signature function (err, chars), where chars is an array of the inserted characters of the form

{
  chr: 'P',
  pos: '...'
}

str.delete(from, to, [cb])

Deletes the characters between positions from and to, inclusive. cb is called with the signature function (err).

{
  op: 'delete',
  from: '...',
  to: '...'
}

str.text(cb)

Asynchronously returns a string, in the order they would be displayed for a human to read.

str.chars(cb)

Asynchronously returns all characters in the string, in the order they would be displayed for a human to read. Each object is of the form

{
  chr: 'P',
  pos: '...'
}

Install

With npm installed, run

$ npm install hyper-string

Acknowledgments

Based on the Logroot CRDT paper by Stephane Weiss, Pascal Urso, and Pascal Molli.

License

ISC