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

@cartesi/tree

v1.1.0

Published

Tree DLib

Downloads

20

Vulnerabilities

Powered byPowered by Snyk
  • 0High
  • 0Medium
  • 0Low

Links

Git

Maintainers

gligneulgligneulvfuscovfuscocarlofragnicarlofragnistephcstephcfelipeargentofelipeargentotulertulermiltonjonatmiltonjonat

Keywords

cartesi

Readme

Tree DLib

This repository contains the on-chain and off-chain pieces that are used to deploy, launch and interact with Cartesi Tree library.

On-chain Tree library

Designed a skip list data structure that is efficient in speed and gas cost for insert/search operation. Below are explanation of the main functions.

  • insertVertex: Add a new vertex to the tree with the parent vertex id specified. The parent id will be ignored if the tree is empty. Upon success, the id of newly inserted vertex will be returned.
  • getDeepest: Get the deepest vertex id and its depth of the tree.
  • getAncestorAtDepth: Get the ancestor id of a vertex at a given depth.

The tree is designed to hold up to 2 ** 32 - 1 of vertices. The use of uint256 is for better gas effeciency. The library user should make sure all id and depth parameters don't exceed 2 ** 31 - 1, otherwise the transaction will be reverted. For example usage please refer to TestTree.

Off-chain Tree

[WIP]

Contributing

Thank you for your interest in Cartesi! Head over to our Contributing Guidelines for instructions on how to sign our Contributors Agreement and get started with Cartesi!

Please note we have a Code of Conduct, please follow it in all your interactions with the project.

Authors

  • Stephen Chen

License

The tree-dlib repository and all contributions are licensed under APACHE 2.0. Please review our LICENSE file.

Acknowledgments

  • Original work