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

@nicodann/lotide

v1.0.2

Published

A js library based on lodash created as an educational project through Lighthouse Labs

Downloads

5

Readme

Lotide

A mini clone of the Lodash library.

Purpose

BEWARE: This library was published for learning purposes. It is not intended for use in production-grade software.

This project was created and published by me as part of my learnings at Lighthouse Labs.

Usage

Install it:

npm install @nicodann/lotide

Require it:

const _ = require('@nicodann/lotide');

Call it:

const results = _.tail([1, 2, 3]) // => [2, 3]

Documentation

The following functions are currently implemented:

  • countLetters(string): Given a string it returns an object with keys corresonding to each different character in the string and values corresponding to how many times the key exists in the string.
  • countOnly(array,object): Given an array of values and an object of keys and booleans it returns an) object containing the number of times 'true' keys exist in an array.
  • findKey(object, callback): Given an object and a callback it returns the key in an object whose value matches the output of the callback.
  • findKeyByValue(object, value): given an Object and a Value it returns the key that matches the value.
  • flatten(array): Given an array of values, including arrays and n levels of nested arrays, it will output an array without nested arrays with the same values
  • head(array): Given an array it returns the array containing the first value of an array.
  • letterPositions('string'): Given a string it will return an object with each different character as keys and the number of time the character appears in the string, as values.
  • map(array, callback): Given an array and a callback it passes each element through the callback and return an array of the results.
  • middle(array): Given an array it returns the array containing the middle value, or values, of an array.
  • tail(array or string): Given an array or string returns the array or string minus the first value.
  • takeUntil(array, callback): Given an array and a callback it will pass each element through the callback in turn and return an array containing each element of the input array until the callback returns true.
  • without(array1,array2): Given two arrays it will return the first array minus the elements in the second.