Timeline for A variant of `Nearest`: Find the largest value that is smaller (larger) than a given value
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 25, 2019 at 2:24 | answer | added | Carl Woll | timeline score: 0 | |
| Feb 1, 2017 at 3:00 | answer | added | bill s | timeline score: 4 | |
| Jan 31, 2017 at 23:45 | answer | added | ubpdqn | timeline score: 2 | |
| Jan 31, 2017 at 17:00 | vote | accept | Sungmin | ||
| Jan 31, 2017 at 16:57 | vote | accept | Sungmin | ||
| Jan 31, 2017 at 17:00 | |||||
| Jan 31, 2017 at 16:55 | vote | accept | Sungmin | ||
| Jan 31, 2017 at 16:57 | |||||
| Jan 31, 2017 at 16:42 | history | tweeted | twitter.com/StackMma/status/826470672037715968 | ||
| Jan 31, 2017 at 14:34 | answer | added | Michael E2 | timeline score: 7 | |
| Jan 31, 2017 at 12:20 | answer | added | Sascha | timeline score: 6 | |
| Jan 31, 2017 at 12:14 | comment | added | J. M.'s missing motivation♦ |
You should still be able to use Nearest[] for this, if you change DistanceFunction accordingly. Alternatively, there's the (undocumented) function GeometricFunctions`BinarySearch[].
|
|
| Jan 31, 2017 at 12:04 | history | asked | Sungmin | CC BY-SA 3.0 |