Timeline for Searching for closest entry in a table
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:55 | history | edited | CommunityBot |
replaced http://mathematica.stackexchange.com/ with https://mathematica.stackexchange.com/
|
|
| Feb 23, 2014 at 13:54 | vote | accept | Whelp | ||
| Feb 23, 2014 at 13:45 | comment | added | Michael E2 |
@Whelp It's the third synopsis on the documentation page. Think of the rule (->) as mapping the LHS -> RHS (element by element). Nearest will find the nearest element in the LHS and return the corresponding element of the RHS.
|
|
| Feb 23, 2014 at 13:20 | comment | added | Whelp | Could you clarify how function nf works? I see what you are doing with Flatten but I don't understand how nf processes its argument. | |
| Feb 23, 2014 at 13:09 | history | edited | Michael E2 | CC BY-SA 3.0 |
Added explanation
|
| Feb 23, 2014 at 13:01 | history | answered | Michael E2 | CC BY-SA 3.0 |