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

search-dot-js

v1.2.0

Published

search module for javascript

Downloads

1

Readme

Hello , this is a module for searching

How to use :

  • config :
const search = require("search-dot-js");
  • how to search :
search("l", "hello world hello", "hello"); // [0 , 5]

search("g", "hello world hello", "hello"); // [ [0 , 5] , [ 12 , 17 ] ]

search("n", "hello world hello", "hello"); // 2
  • Other uses :
if (search("l", "hello world", "home")) {
  console.log(true);
} else {
  console.log(false);
}

// false

if (search("l", "hello world", "hello")) {
  console.log(true);
} else {
  console.log(false);
}

// true

let num = search("n", "hello world", "hello");

switch (num) {
  case 1:
    console.log("1 hello");
    break;
  case 2:
    console.log("2 hello");
    break;
  case false:
    console.log("0 hello");
    break;
}

// 1 hello

Items before use :

  • Recursive values ?

Return values vary in operators, we give you examples to understand this

search("l", "hello world hello", "hello"); // [0 , 5]

search("l", "hello world hello", "home"); // false

search("g", "hello world hello", "hello"); // [ [0 , 5] , [ 12 , 17 ] ]

search("g", "hello world hello", "home"); // false

search("n", "hello world hello", "hello"); // 2

search("n", "hello world hello", "home"); // 0
  • what is operator ?

Operators specify the type of search operation, operator l only finishes the operation by finding an item, but the g operator completes the search, generally using the operator l for conditional operations, of course there is no limit to this .

  • What is An Operator n ?

This operator returns the number of available values, for example in the search for hello in hello world returns value 1, and if there are no values, the return value is false.

  • Is it necessary to use the return value of the n operator in the if/else ?

yes, you can give you an examples to understand this

if (search("n", "hello world hello", "home")) {
  console.log(true);
} else {
  console.log(false);
}

// false
let num = search("n", "hello world", "hello");

switch (num) {
  case 1:
    console.log("1 hello");
    break;
  case 2:
    console.log("2 hello");
    break;
  case false:
    console.log("0 hello");
    break;
}

// 1 hello
  • Which operator performs faster ?

Definitely the operator l because as soon as it finds the operation stops but the operator g checks the end of the text, so obviously l is faster, of course this issue is not very important in small operations and does not make much difference, but in large operations this issue is well felt

  • Is it sensitive to types ?

Yes , you can't find 10 in "10"