Dear Julia users,
As I have mentioned in earlier posts, I am working on a 2-3 tree
implementation of a sort-order dict, that is, a dict in which the (key,
value) pairs can be retrieved in the sort-order of the keys. According to
section 2.1.7 of the manual, "for i = I; ; end" translates to:
You seem to be attributing a general principle where I don't think there is
one. For example, see the iterators in base/range.jl; there are not two calls
to next.
--Tim
On Tuesday, July 22, 2014 02:29:12 PM vava...@uwaterloo.ca wrote:
> Dear Julia users,
>
> As I have mentioned in earlier post
Hi Steve
> The more obvious way to implement the loop would be to put the body BEFORE
> the 'next' statement, and at first I thought that maybe the manual has a
> typo. But then I checked the file dict.jl, and I found indeed the code:
>
> done(t::ObjectIdDict, i) = is(next(t,i),())
>
> So this