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

bmq

v0.2.0

Published

persistence queue

Downloads

3

Readme

BMQ

class BMQ {
    constructor(PREFIX) {
        // 在nodeway-raft中,PREFIX=服务占用端口号。
    }
    size() {
        // 返回队列总长度,实际可能没那么长。
    }
    shift() {
        // 移除在队里的第一项并返回(注意不是下标为0的项)。
    }
    push(entry) {
        // 队尾添加一项。
    }
    value(index) {
        // 返回下标对应项,没有的返回undefined。
    }
    front() {
        // 返回队里的第一项(注意不是下标为0的项)。
    }
    last() {
        // 返回队里的最后一项(注意last不受shift影响)。
    }
}

License

MIT © May xiaoya zhang