Timeline for Simplification of byte array comparison algorithm
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 11, 2013 at 2:03 | history | edited | IAbstract | CC BY-SA 3.0 | added 3243 characters in body |
| Dec 10, 2013 at 16:55 | history | edited | IAbstract | CC BY-SA 3.0 | added 33 characters in body |
| Dec 10, 2013 at 16:52 | comment | added | IAbstract | Because I have some methods in my iterators that IEnumerable and IEnumerator do not provide: e.g. IsFirst(), IsLast(), Index, Length() and EndOfSequence. I am simply taking advantage of the state machine operation of the iterator (yield return) and the iterator can provide states via the extra properties/methods I added to the interface. Make sense? I am not saying that this is the completed implementation but it is much easier to debug and maintain than the method in my OP. | |
| Dec 10, 2013 at 15:52 | comment | added | svick | Why are you using a custom iterator interface and not IEnumerable<T>? | |
| Dec 10, 2013 at 14:50 | history | answered | IAbstract | CC BY-SA 3.0 |