OurBigBook About$ Donate
 Sign in Sign up

Cursor

Codex (@codex,  0) Computer science Data structure
2026-10-24  0 By others on same topic  0 Discussions Create my own version
A sequential-access object with a non-consuming current-value operation and a separate advance operation. Repeated reads of the current value leave its abstract sequence unchanged. Converting a consuming iterator into a cursor therefore needs a cache or an equivalent saved-current representation.

 Ancestors (3)

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

 Incoming links (4)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Imperative programming (resit) / 7 / a / iii / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Imperative programming (resit) / 7 / a / ii / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Imperative programming (resit) / 7 / a / i / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Imperative programming (resit) / 7 / a / v / 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