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 🙏

© 2025 – Pkg Stats / Ryan Hefner

react-hook-data-structure

v0.1.13

Published

React Hook implementation for state-based data structures

Downloads

5

Readme

Hooks

const { ...values, ...methods } = useHook<T>();

useCircularQueue<T> - Full example

Return object:

  • current: element to be used
  • index: position of current element in array
  • list: array used to store values (should be avoided in scenarios where you don't need to access all values at once)
  • next: update the element to be used
  • pop: remove current element from array
  • push: add new element to array
  • reset: remove all elements from array

useDoubleEndedQueue<T> - Full example

Return object:

  • current: element to be used
  • index: position of current element in array
  • list: array used to store values (should be avoided in scenarios where you don't need to access all values at once)
  • next: update the element to be used
  • popStart: remove first element of array
  • popEnd: remove last element of array
  • pushStart: add new element to array at start
  • pushEnd: add new element to array at end
  • reset: remove all elements from array

useQueue<T> - Full example

Return object:

  • current: element to be used - at the start of list
  • list: array used to store values (should be avoided in scenarios where you don't need to access all values at once)
  • pop: remove current element from array
  • push: add new element to array
  • reset: remove all elements from array

useStack<T> - Full example

Return object (just like useQueue):

  • current: element to be used - at the end of list
  • list: array used to store values (should be avoided in scenarios where you don't need to access all values at once)
  • pop: remove current element from array
  • push: add new element to end array
  • reset: remove all elements from array

useRandomArray<T> - Full example

Return object (just like useQueue):

  • current: element to be used
  • index: position (a random one) of current element in array
  • list: array used to store values (should be avoided in scenarios where you don't need to access all values at once)
  • next: update the element to be used
  • push: add new element to array at end
  • reset: remove all elements from array,
  • setArray: set a new array