Searched refs:nearestN (Results 1 – 5 of 5) sorted by relevance
| /dports/www/grafana8/grafana-8.3.6/vendor/gonum.org/v1/gonum/spatial/vptree/ |
| H A D | vptree_test.go | 196 func nearestN(n int, q Comparable, p []Comparable) []ComparableDist { func
233 wantP := nearestN(k, q, wpData)
424 r = nearestN(10, Point{rnd.Float64(), rnd.Float64(), rnd.Float64()}, data)
|
| /dports/www/grafana8/grafana-8.3.6/vendor/gonum.org/v1/gonum/spatial/kdtree/ |
| H A D | kdtree_test.go | 282 func nearestN(n int, q Point, p Points) []ComparableDist { func
316 wantP := nearestN(k, q, wpData)
607 r = nearestN(10, Point{rnd.Float64(), rnd.Float64(), rnd.Float64()}, data)
|
| /dports/games/libretro-scummvm/scummvm-7b1e929/engines/tinsel/ |
| H A D | polygons.cpp | 579 int nearestN; // Nearest Node in FindBestPoint() local
665 nearestN = NearestNodeWithin(hp, h, k); in FindBestPoint()
666 dropD = ABS(h - ptp.getNodeX(nearestN)) + ABS(k - ptp.getNodeY(nearestN)); in FindBestPoint()
671 *x = ptp.getNodeX(nearestN); in FindBestPoint()
672 *y = ptp.getNodeY(nearestN); in FindBestPoint()
673 *pline = nearestN; in FindBestPoint()
|
| /dports/games/scummvm/scummvm-2.5.1/engines/tinsel/ |
| H A D | polygons.cpp | 625 int nearestN; // Nearest Node in FindBestPoint() local
711 nearestN = NearestNodeWithin(hp, h, k); in FindBestPoint()
712 dropD = ABS(h - ptp.getNodeX(nearestN)) + ABS(k - ptp.getNodeY(nearestN)); in FindBestPoint()
717 *x = ptp.getNodeX(nearestN); in FindBestPoint()
718 *y = ptp.getNodeY(nearestN); in FindBestPoint()
719 *pline = nearestN; in FindBestPoint()
|
| /dports/graphics/py-visvis/visvis-1.13.0/core/ |
| H A D | baseTexture.py | 41 def nearestN(n1): function
49 s2 = [nearestN(n) for n in data.shape]
|