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

loudo-ds-ordered

v0.0.2

Published

Interface describing ordered data structures.

Downloads

1

Vulnerabilities

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

Links

Git

Maintainers

pjackpjack

Keywords

Readme

loudo-ds-ordered

Base interfaces for ordered data structures. Ordered data structures are also Reversible.

Ordered

The Ordered interface represents a data structure that is well-ordered, such as a binary tree. Ordered has an additional type parameter, K, representing the type that provides the order. K can be the same as T for sets, the same as I for arrays, and something completely different for dictionaries.

The Ordered class provides one operation, slice. Slice takes three parameters: the starting key, the ending key, and an object that specifies whether or not the starting key and ending key are inclusive or exclusive. Four constants are provided to cover the four cases:

  1. IN_IN: Both the starting key and the ending key are inclusive.
  2. IN_EX: The starting key is inclusive, but the ending key is exclusive. This is the default if none is specified.
  3. EX_IN: The starting key is exclusive, and the ending key is inclusive. This is useful for creating a reversed slice.
  4. EX_EX: Both the starting and ending keys are exclusive.

The slice method returns a view of the data structure's elements, starting at (or just above) the starting key and continuing to (or just below) the ending key. If the starting key is greater than the ending key, then a reversed slice view will be returned.

Again, the views reflect changes to the original data structure and vice-versa. And again, each view has its own list of event handlers, and events triggered for either the original or a view are sent to both. However, events that lie outside the range of the slice view will be discarded for that view.