Package Licenses
MIT
Dependency Licenses
MIT18
| Package | Relation | Dependencies | Published |
|---|---|---|---|
| binary-search-bounds • 2.0.5Better binary searching | INDIRECT | 0 | |
| compare-angle • 1.0.1Compares two angles with a common edge | INDIRECT | 8 | |
| dup • 1.0.0Initialize an array of arrays to a constant | INDIRECT | 0 | |
| edges-to-adjacency-list • 1.0.0Convert a list of edges to an adjacency list | DIRECT | 1 | |
| functional-red-black-tree • 1.0.1A fully persistent balanced binary search tree | INDIRECT | 0 | |
| interval-tree-1d • 1.0.41D interval tree data structure | INDIRECT | 1 | |
| planar-dual • 1.0.2Find the faces of a planar graph | DIRECT | 10 | |
| point-in-big-polygon • 2.0.1Industrial strength point in polygon test | DIRECT | 10 | |
| robust-orientation • 1.2.1Exactly computes the orientation of a tuple of points | DIRECT | 5 | |
| robust-product • 1.0.0Exactly multiplies two non-overlapping increasing sequences | INDIRECT | 4 | |
| robust-scale • 1.0.2Multiplies a nonoverlapping increasing sequence of floats by a single float | INDIRECT | 2 | |
| robust-subtract • 1.0.0Exact subtraction of non-increasing overlapping sequences | INDIRECT | 0 | |
| robust-sum • 1.0.0Evaluates the sum of two nonoverlapping increasing sequences of floats | DIRECT | 0 | |
| signum • 0.0.0Returns the sign of a number | INDIRECT | 0 | |
| slab-decomposition • 1.0.3Slab decomposition data structure for 2D vertical ray queries | INDIRECT | 8 | |
| two-product • 1.0.2Multiplies two floating point numbers together producing a non-overlapping increasing sequence of floats | DIRECT | 0 | |
| two-sum • 1.0.0Computes a non-overlapping sequence representing the sum of two floating point numbers. | INDIRECT | 0 | |
| uniq • 1.0.1Removes duplicates from a sorted array in place | DIRECT | 0 |