Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with arrays
Search options not deleted
user 26360
A sequential random-access data structure whose size can typically not be changed after creation.
8
votes
1
answer
550
views
Applicative-order languages don't support constant time array writes? If not, why not?
one of his War Stories on page 155 he states:
Efficiency is a great challenge in Mathematica, due to its applicative
model of computation (it does not support constant-time write
operations to arrays … If true, what are the under-the-hood reasons for why applicative-order languages don't write to arrays in constant time? Why would the order of evaluation matter in determining array write time? …
- 205