Re: recursive GetEnumerator()

"Jon Skeet [C# MVP]" <skeet@xxxxxxxxx> wrote in message
news:MPG.20ea1b5e3993d38c275@xxxxxxxxxxxxxxxxxxxxxxx
colin <colin.rowe1@xxxxxxxxxxxxxxxxxx> wrote:
although I had assumed it just put the code inline or something,
and put the code inside the foreach block at each yeild statement.

No, it couldn't do that - don't forget that foreach could be in one
type, and the iterator in a completely different one.

The way I implemented it before in c was to pass a function to the iterator,
it might of been simpler to use if the iterator was like a macro.
I had hoped it would expand the iterator in the code where the foreach
was used, but obviously this isnt so... too much to hope for ;)
I gues if the type isnt completly fixed at compile time this isnt possible
anyway.

Ive not tried using reflection or looking at the code directly,
im not sure I want to atm lol, I might not understand or like what I see.

There's a big difference between Reflector and reflection... if you
haven't used Reflector before, it's well worth downloading (just Google
for it).

thanks, Il have a look sometime, I think the important thing is that the
binary searching is fast and I havnt heard anything yet to think otherwise.

Ive not realy had any problems where I realy needed to see what was going on
underneath the code.
although I had to do a bit of work to get memory usage down to <2gb.

maybe its not as fast as I would like if its actually storing the stack
info,
but then this isnt a method that will be used intensivly to access the
list.
my original implementation was written partly in assembler many years ago
when CPU power wasnt so plentifull.
before that I also had a microcode version for a bit slice processor,
before content addressable ram made it obsolete.

Indeed - I wouldn't worry about speed until you've definitely got a
problem. It's not likely to be particularly slow, although using it
recursively can be a bit more of a hit than might be ideal:

http://blogs.msdn.com/toub/archive/2004/10/29/249858.aspx

thanks thats quite interesting read, ofc a tree is very good for searches,
and isnt so likely to be used like this often,
but it might be worth considering dumping it to an array,
wich could be quite quick and easy,
and iterating that, this might be quicker if the whole list was iterated.
in fact this might lead to an easy way of balancing the tree.

Colin =^.^=


.

Relevant Pages

  • Re: IEnumerable is strange
    ... That's exactly what 'yield return' is: ... int foo() ... and similarly investigate how foreach is ... The function implementing the iterator is technically never entered. ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: Features new to Java 5.0 rated today
    ... But would it not be useful if the foreach statement could go over an ... But what if the Iterator had been used previous to being passed to the ... If you're not thinking about the entering state of a Collection before ... puting it into a foreach statement you're.... ...
    (comp.lang.java.advocacy)
  • Re: Generic Package
    ... as required by the specification of iterator. ... But you could not present any formal specification of. ... "The foreach procedure operates as if the following body ... Some ordered sets might become unordered in ...
    (comp.lang.ada)
  • Re: Question about Iteration and forEach
    ... Not want to get in a coding contest but you can also encapsulate this in an iterator. ... // any IEnumerable collection in a foreach statement. ... foreach (Item itemCur in MyCollection) ... // Do some stuff with itemPrev. ...
    (microsoft.public.dotnet.languages.csharp)
  • Re: recursive GetEnumerator()
    ... The way I implemented it before in c was to pass a function to the iterator, ... I gues if the type isnt completly fixed at compile time this isnt possible ... it's well worth downloading (just Google ... in fact this might lead to an easy way of balancing the tree. ...
    (microsoft.public.dotnet.languages.csharp)