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

dstruct-js

v1.0.1

Published

A lightweight JavaScript package providing Stack and Queue data structures with TypeScript support.

Downloads

145

Readme

dstruct-js JavaScript TypeScript

A lightweight JavaScript package providing Stack and Queue data structures with TypeScript support.

Tags

🛠️ Data Structures | 📚 Stack | 📦 Queue | 💻 JavaScript | ⚙️ TypeScript | 🚀 Algorithms

Note: This package is still under construction for implementing additional data structures such as Graphs, Trees, and more. Stay tuned for updates!

Features

  • Implementations of Stack and Queue data structures
  • TypeScript support for better type safety
  • Simple and intuitive API
  • Works with both JavaScript and TypeScript

Installation

You can install dstruct-js via npm:

npm install dstruct-js

Usage

In JavaScript

import { Stack, Queue } from 'dstruct-js';

// Using Stack
const stack = new Stack();
stack.push(1);
stack.push(2);
console.log(stack.pop()); // 2
console.log(stack.peek()); // 1

// Using Queue
const queue = new Queue();
queue.enqueue(1);
queue.enqueue(2);
console.log(queue.dequeue()); // 1
console.log(queue.peek()); // 2

In TypeScript

import { Stack, Queue } from 'dstruct-js';

// Using Stack
const stack = new Stack<number>();
stack.push(1);
stack.push(2);
console.log(stack.pop()); // 2
console.log(stack.peek()); // 1

// Using Queue
const queue = new Queue<number>();
queue.enqueue(1);
queue.enqueue(2);
console.log(queue.dequeue()); // 1
console.log(queue.peek()); // 2

API

Stack

  • push(value: T): void - Adds an item to the top of the stack.
  • pop(): T | undefined - Removes and returns the top item of the stack.
  • peek(): T | undefined - Returns the top item without removing it.
  • isEmpty(): boolean - Returns true if the stack is empty.

Queue

  • enqueue(value: T): void - Adds an item to the end of the queue.
  • dequeue(): T | undefined - Removes and returns the item at the - front of the queue.
  • peek(): T | undefined - Returns the item at the front without removing it.
  • isEmpty(): boolean - Returns true if the queue is empty

Running Tests

To run the tests for this package, you can use:

npm test

Building the Package

To build the package, run:

npm run build

This will compile the TypeScript code into JavaScript and create a dist folder.

License

This project is licensed under the MIT License. See the LICENSE file for details.

Contributing

If you’d like to contribute to this project, please fork the repository and submit a pull request. Your contributions are welcome!

Author