| bio | website | colorfulengineering.org |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 7 months |
| seen | Oct 9 '12 at 21:36 | |
| stats | profile views | 12 |
{ Research fellow, engineer at heart, protege of MacGyver }
|
Oct 9 |
accepted | Maximum tuple value |
|
Oct 9 |
accepted | Map w/ multiple arguments |
|
Oct 9 |
comment |
Map w/ multiple arguments +1 I can also use parallel table to get an 8x speedup! |
|
Oct 9 |
comment |
Maximum tuple value I wanted lexicographic, so sorting or using ordering for fast selection is exactly what I want! |
|
Oct 9 |
comment |
Maximum tuple value +1 Thank you kind wizard! |
|
Oct 9 |
comment |
Map w/ multiple arguments I want to essentially do a nested for loop to return a nested list: { forall yvals {forall xvals f[xval, yval,100]} } |
|
Oct 9 |
comment |
Map w/ multiple arguments +1 Thanks! Is there a way to do it in a grid (i.e. vary xvals and yvals)? |
|
Oct 9 |
asked | Map w/ multiple arguments |
|
Oct 9 |
asked | Maximum tuple value |
|
Oct 9 |
awarded | Scholar |
|
Oct 9 |
comment |
Factor out invariant code from Plot +1 Thanks, I used that elsewhere. |
|
Oct 9 |
accepted | Factor out invariant code from Plot |
|
Oct 9 |
awarded | Supporter |
|
Oct 9 |
awarded | Student |
|
Oct 9 |
asked | Factor out invariant code from Plot |