This is your code to list link titles from all non-redirect pages in a wiki.
var source = wiki.Query.allpages()
.Where(p => p.filterredir == allpagesfilterredir.nonredirects)
.Pages
.Select(p => PageResult.Create(
p.info, p.links().Select(l => l.title).ToEnumerable()));;
foreach ( var page in source.Take(2000)) // just the first 10 pages
foreach( var linkTitle in page.Data.Take(1)) // first 1 link from each page
Console.WriteLine(linkTitle);
The "page" foreach starts by getting
The linkTitle foreach causes 18 more api calls to start getting the links, all with plcontinue, before it yeilds even a single link.
And the reason for it, as Brad correctly noted, is that links are sorted in a different order from titles. At this point, you are half way through the current block, you have made 19 fairly expensive api calls, and if (and that's a big if) you decide to continue with the next gapcontinue, based on the first link you get, you still need to do each "plcontinue" so that you don't miss any pages.
The only thing you can really do, with minimal calls is -- get a block of data, take a RANDOM page with links on it, check the first link, and decide to go on to the next block. I see absolutelly no sense in this use.
In short - there are no way you can say "next page" until you iterate through every plcontinue in the current set. EXCEPT! if you go one page at a time (gaplimit=1) - in which case you can safely skip to the next gapcontinue. But this is exactly what I am trying to avoid, because it does not give any benefit whatsoever in using the generator. I might even suspect that it costs much more - because running generator, even with limit=1 has a bigger cost than just querying one specific page info and filling it out.