Count case-sensitive occurrences of a string in a string (like needles in a haystack)
The leanest and most handsome HTTP client in the Nodelands.
Replace all substring matches in a string
Tiny helpers for processing regex syntax
Replace matches in a Buffer
TypeScript definitions for needle
A simple TypeScript library for dependency injection
Tiny and blazing-fast fuzzy search in JavaScript
walk paths fast and efficiently
tiny binary search function with comparators
A tiny, efficient fuzzy matcher that doesn't suck
Streaming Boyer-Moore-Horspool searching for node.js
TypeScript definitions for probe-image-size
TypeScript definitions for streamsearch
Needle Engine is a web-based runtime for 3D apps. It runs on your machine for development with great integrations into editors like Unity or Blender - and can be deployed onto any device! It is flexible, extensible and networking and XR are built-in.
fast-find-in-files recursively searches sub-directories for needle matches
The official command-line interface for [Needle Cloud](https://cloud.needle.tools) — deploy websites, optimize 3D assets, and manage your projects from the terminal.
`@gitlab/needle` is a lightweight dependency injection framework for TypeScript, using ES stage 3 decorators. It provides a type-safe solution for managing dependencies in your TypeScript projects.
Pipeline and tools for optimizing gltf files using gltf-transform and compression settings within glTF extensions
long list of color names
Gauge chart for chart.js
Simplified requests for paged (paginated) content.
MaterialX material support for three.js and Needle Engine – render physically based MaterialX shaders in the browser via WebAssembly
Fuzzy finding algorithm
Find a needle in a haystack using string similarity and (optionally) regexp rules. Replaces loose_tight_dictionary.
DEPRECATED: use fuzzy_match instead. Find a needle in a haystack using string similarity and (optionally) regexp rules.
FuzzBall is a gem that finds fuzzy matches of a string (the 'needle') within an array of strings (the 'haystack'). It does so via a two-step process: first, it finds candidate strings from the haystack that have high similarity to the needle, then uses a Smith-Waterman algorithm to fuzzily match from these candidates. Strings are returned along with a matching score. Both steps of the search are written in C for greater performance.