Package Exports
- compare-cell
This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (compare-cell) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.
Readme
compare-cell
Compares two unordered integer sequences to test if they contain the same elements. This can be used to implement various algorithms for unoriented simplicial complexes.
For more information, see the following blog post:
Comparing sequences without sorting
Example
var compareCells = require('compare-cell')
var bsearch = require('binary-search-bounds')
//Create a list of triangles defined by indexed faces
var triangles = [
[1, 0, 2],
[2, 1, 3],
[3, 4, 5],
[5, 6, 7]
]
//Sort triangles
triangles.sort(compareCells)
//Now we can test if various cells are contained in the list in O(log n)
console.log(bsearch.eq(triangles, [2, 1, 0], compareCells) >= 0)
console.log(bsearch.eq(triangles, [3, 5, 7], compareCells) >= 0)API
var d = require('compare-cells')(a, b)
Tests if two unordered lists contain the same elements.
a, bare arrays of integers
Returns An order function which tests if a comes before or after b. The value is 0 if they are equal.
License
(c) 2015 Mikola Lysenko. MIT License