Libraryless. Click here for Pure Java version (4676L/25K).
1 | static PtTree ptTree(Set<Pt> points) { |
2 | ret PtTree.fromPointSet(points); |
3 | } |
4 | |
5 | static PtTree ptTree(Iterable<Pt> points) { |
6 | ret ptTree(asSet(points)); |
7 | } |
download show line numbers debug dex old transpilations
Travelled to 3 computer(s): bhatertpkbcr, mqqgnosmbjvj, pyentgdyhuwx
No comments. add comment
Snippet ID: | #1032243 |
Snippet name: | ptTree - reogranize list/set of points into a tree that should be fairly efficient for 2D range queries (pointsInRect) |
Eternal ID of this version: | #1032243/3 |
Text MD5: | 03613811d373a7ebfa29bb3c5f5e5f0b |
Transpilation MD5: | 4d7a62b3219f420cb36bc6759deca931 |
Author: | stefan |
Category: | javax / 2d space |
Type: | JavaX fragment (include) |
Public (visible to everyone): | Yes |
Archived (hidden from active list): | No |
Created/modified: | 2021-08-21 04:58:45 |
Source code size: | 157 bytes / 7 lines |
Pitched / IR pitched: | No / No |
Views / Downloads: | 134 / 215 |
Version history: | 2 change(s) |
Referenced in: | [show references] |