Age | Commit message (Collapse) | Author |
|
|
|
|
|
|
|
|
|
|
|
|
|
This is kind-of-OK in C, but will break Julia's memory management.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
An experiment. The C interface doesn't have this distinction, but it
seems like it might be helpful.
|
|
RefLists are a bit strange. They're logically Cartesian arrays with 3
indexes, but they're not really designed for indexing in this way.
Rather, we always want to index them linearly, from start to finish.
|
|
This appears not to be necessary. I'd just got my thoughts into a
twist. Either that, or I've forgotten the reason why this doesn't work.
Let's see...
|
|
|
|
|
|
|
|
|
|
|
|
|
|
If the iteration ends early, the finalizer gives us a chance to free the
RefListIterator.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
This adds Julian enums for lattice type, centering and unique axis, and
a "show" method.
|
|
|
|
|
|
|
|
|
|
|
|
|