For floating point arrays, inaccurate results may appear due to usual round-off and floating point comparison issues.
Speed could be gained in some operations by an implementation of numpy.sort
, that can provide directly the permutation vectors, thus avoiding calls to numpy.argsort
.
Original author: Robert Cimrman
Set operations for arrays based on sorting.
Set operations for arrays based on sorting.
For floating point arrays, inaccurate results may appear due to usual round-off and floating point comparison issues.
Speed could be gained in some operations by an implementation of numpy.sort
, that can provide directly the permutation vectors, thus avoiding calls to numpy.argsort
.
Original author: Robert Cimrman
The following pages refer to to this document either explicitly or contain code examples using this.
numpy.isin
numpy.in1d
numpy.setdiff1d
dask.array.routines.union1d
numpy.unique
numpy.union1d
numpy.intersect1d
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them