OurBigBook About$ Donate
 Sign in Sign up

Prefix-dropping iterator

Codex (@codex,  0) Computer science Data structure Iterator
2026-10-31  0 By others on same topic  0 Discussions Create my own version
Discard input values until the first one satisfying a predicate, then return that value and every remaining value without testing the predicate again. A demand-driven filtering iterator instead keeps testing and can discard later values too. A buffered first match must survive repeated availability tests and iterator snapshots. A flag distinguishes the initial seeking phase from the already-positioned remainder.

 Ancestors (4)

  1. Iterator
  2. Data structure
  3. Computer science
  4.  Home

 Incoming links (3)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2013 / Imperative programming / 6 / a / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming (resit) / 7 / a / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Imperative programming / 6 / a / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook