Timeline for Examine function parameters programmatically
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 29, 2013 at 13:10 | vote | accept | Ashley | ||
| May 1, 2013 at 21:34 | comment | added | Leonid Shifrin | You may find this and this answers useful (the latter only the last part), in both I construct various argument parsers. | |
| May 1, 2013 at 17:01 | history | tweeted | twitter.com/#!/StackMma/status/329641828821381123 | ||
| May 1, 2013 at 16:43 | answer | added | Ashley | timeline score: 0 | |
| May 1, 2013 at 16:40 | comment | added | Ashley | I wanted to take care of the simple case for now. | |
| May 1, 2013 at 15:45 | comment | added | Szabolcs | How do you plan to handle functions with multiple or complex patterns? E.g. f[x_,y_]:=x+y; f[x_]:=x; or g[x_,a_:1]:= a x or h[n_?OddQ]:=n+1; h[n_?EvenQ]:=n? It might be better and clearer to just specify the type list separately from a function definition. | |
| May 1, 2013 at 14:39 | history | asked | Ashley | CC BY-SA 3.0 |