From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail From: Victor Porton Newsgroups: comp.lang.ada Subject: Two "parallel" iterators Date: Tue, 12 Sep 2017 00:56:13 +0300 Organization: Aioe.org NNTP Server Message-ID: NNTP-Posting-Host: qUTqmJlZKcITHxg9FVl9Fw.user.gioia.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset="ISO-8859-1" Content-Transfer-Encoding: 7Bit X-Complaints-To: abuse@aioe.org User-Agent: KNode/4.14.10 X-Notice: Filtered by postfilter v. 0.8.2 Xref: news.eternal-september.org comp.lang.ada:48020 Date: 2017-09-12T00:56:13+03:00 List-Id: I have two cursors i and j (possibly constructed from two iterators a and b) and need to check whether they return the same tuple of objects (objects with the same offset from the beginning of the iterator or the initial position of the cursor are the same and the number of elements the iterators make are the same). Let objects for i and j are o1(i) and o2(j). As I understand I should not use for-loop with "in iterator", because it supports only one iterator and I have two. What is the best (most concise and probably most symmetric) way to express this algorithm with two iterators or two cursors? Or should I first make two arrays from two iterators and then just compare the arrays? It may be a little inefficient, but who bothers? -- Victor Porton - http://portonvictor.org