Security News
tea.xyz Spam Plagues npm and RubyGems Package Registries
Tea.xyz, a crypto project aimed at rewarding open source contributions, is once again facing backlash due to an influx of spam packages flooding public package registries.
kdbush
Advanced tools
Readme
A very fast static spatial index for 2D points based on a flat KD-tree. Compared to RBush:
If you need a static index for rectangles, not only points, see Flatbush. When indexing points, KDBush has the advantage of taking ~2x less memory than Flatbush.
// initialize KDBush for 1000 items
const index = new KDBush(1000);
// fill it with 1000 points
for (const {x, y} of items) {
index.add(x, y);
}
// perform the indexing
index.finish();
// make a bounding box query
const foundIds = index.range(minX, minY, maxX, maxY);
// map ids to original items
const foundItems = foundIds.map(i => items[i]);
// make a radius query
const neighborIds = index.within(x, y, 5);
// instantly transfer the index from a worker to the main thread
postMessage(index.data, [index.data]);
// reconstruct the index from a raw array buffer
const index = KDBush.from(e.data);
Install with NPM: npm install kdbush
, then import as a module:
import KDBush from 'kdbush';
Or use as a module directly in the browser with jsDelivr:
<script type="module">
import KDBush from 'https://cdn.jsdelivr.net/npm/kdbush/+esm';
</script>
Alternatively, there's a browser bundle with a KDBush
global variable:
<script src="https://cdn.jsdelivr.net/npm/kdbush"></script>
Creates an index that will hold a given number of points (numItems
). Additionally accepts:
nodeSize
: Size of the KD-tree node, 64
by default. Higher means faster indexing but slower search, and vise versa.ArrayType
: Array type to use for storing coordinate values. Float64Array
by default, but if your coordinates are integer values, Int32Array
makes the index faster and smaller.Adds a given point to the index. Returns a zero-based, incremental number that represents the newly added point.
Finds all items within the given bounding box and returns an array of indices that refer to the order the items were added (the values returned by index.add(x, y)
).
Finds all items within a given radius from the query point and returns an array of indices.
KDBush.from(data)
Recreates a KDBush index from raw ArrayBuffer
data
(that's exposed as index.data
on a previously indexed KDBush instance).
Very useful for transferring or sharing indices between threads or storing them in a file.
data
: array buffer that holds the index.numItems
: number of stored items.nodeSize
: number of items in a KD-tree node.ArrayType
: array type used for internal coordinates storage.IndexArrayType
: array type used for internal item indices storage.FAQs
A very fast static 2D index for points based on kd-tree.
The npm package kdbush receives a total of 1,898,301 weekly downloads. As such, kdbush popularity was classified as popular.
We found that kdbush demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Tea.xyz, a crypto project aimed at rewarding open source contributions, is once again facing backlash due to an influx of spam packages flooding public package registries.
Security News
As cyber threats become more autonomous, AI-powered defenses are crucial for businesses to stay ahead of attackers who can exploit software vulnerabilities at scale.
Security News
UnitedHealth Group disclosed that the ransomware attack on Change Healthcare compromised protected health information for millions in the U.S., with estimated costs to the company expected to reach $1 billion.